}
            for (j = 0; j < 24; ++j) {
                if (pcr[pc2[j]] != 0) {
                    kn[m] |= bigbyte[j];
                }
                if (pcr[pc2[j + 24]] != 0) {
                    kn[n] |= bigbyte[j];
                }
            }
        }
        cookey(kn, KnL);
    }

    private void cookey(final int[] raw, final int KnL[]) {
        int raw0, raw1;

ii: ꆈꌠ꒿ Nuosuhxop
ik: Iñupiaq
io: Ido
is: Íslenska
it: italiano
iu: ᐃᓄᒃᑎᑐᑦ
ja: 日本語
jv: basa Jawa
ka: ქართული
kg: Kikongo
ki: Gĩkũyũ
kj: Kuanyama
kk: қазақ тілі
kl: kalaallisut
km: ខេមរភាសា
kn: ಕನ್ನಡ
ko: 한국어
kr: Kanuri
ks: कश्मीरी
ku: Kurdî
kv: коми кыв
kw: Kernewek
ky: Кыргызча
la: latine
lb: Lëtzebuergesch
lg: Luganda
li: Limburgs
ln: Lingála
lo: ພາສາ
lt: lietuvių kalba

  // Cheat sheet:
  //
  // m: total bits
  // n: expected insertions
  // b: m/n, bits per insertion
  // p: expected false positive probability
  //
  // 1) Optimal k = b * ln2
  // 2) p = (1 - e ^ (-kn/m))^k
  // 3) For optimal k: p = 2 ^ (-k) ~= 0.6185^b
  // 4) For optimal k: m = -nlnp / ((ln2) ^ 2)

  /**
   * Computes the optimal number of hash functions (k) for a given false positive probability (p).
   *

edu.gi
edu.gl
edu.gn
edu.gp
edu.gr
edu.gt
edu.gu
edu.gy
edu.hk
edu.hn
edu.ht
edu.in
edu.io
edu.iq
edu.it
edu.jo
edu.kg
edu.ki
edu.km
edu.kn
edu.kp
edu.krd
edu.kw
edu.ky
edu.kz
edu.la
edu.lb
edu.lc
edu.lk
edu.lr
edu.ls
edu.lv
edu.ly
edu.me
edu.mg
edu.mk
edu.ml
edu.mn
edu.mo

edu.gi
edu.gl
edu.gn
edu.gp
edu.gr
edu.gt
edu.gu
edu.gy
edu.hk
edu.hn
edu.ht
edu.in
edu.io
edu.iq
edu.it
edu.jo
edu.kg
edu.ki
edu.km
edu.kn
edu.kp
edu.krd
edu.kw
edu.ky
edu.kz
edu.la
edu.lb
edu.lc
edu.lk
edu.lr
edu.ls
edu.lv
edu.ly
edu.me
edu.mg
edu.mk
edu.ml
edu.mn
edu.mo

coop.km
asso.km
presse.km
medecin.km
notaires.km
pharmaciens.km
veterinaire.km
gouv.km

// kn : https://www.iana.org/domains/root/db/kn.html
// http://www.dot.kn/domainRules.html
kn
net.kn
org.kn
edu.kn
gov.kn

// kp : http://www.kcce.kp/en_index.php
kp
com.kp
edu.kp
gov.kp
org.kp
rep.kp
tra.kp

\u0908/i,/^\u091c\u0942\u0928/i,/^\u091c\u0941\u0932/i,/^\u0905\u0917/i,/^\u0938\u093f\u0924\u0902|\u0938\u093f\u0924/i,/^\u0905\u0915\u094d\u091f\u0942/i,/^\u0928\u0935|\u0928\u0935\u0902/i,/^\u0926\u093f\u0938\u0902|\u0926\u093f\u0938/i];function kn(e,a,t){var s=e+" ";switch(t){case"ss":return s+=1===e?"sekunda":2===e||3===e||4===e?"sekunde":"sekundi";case"m":return a?"jedna minuta":"jedne minute";case"mm":return s+=1!==e&&(2===e||3===e||4===e)?"minute":"minuta";case"h":return a?"jedan sat":"jednog...

nternal-Server-Side-Encryption-Iv":"/4uPRyngFM7RBK+ougBfGUY+eziCfXnIqGJHD2egQR0=","X-Minio-Internal-Server-Side-Encryption-S3-Kms-Key-Id":"my-minio-key","X-Minio-Internal-Server-Side-Encryption-S3-Kms-Sealed-Key":"IAAfAO1/Z4b4u7vGxKtiFQ9szIF1/tCrHl+kn/miYLd2cvcQ1/3SQ==","X-Minio-Internal-Server-Side-Encryption-S3-Sealed-Key":"IAAfAIANKABkhR1D+3OUlibqM8+yo4KrSdxa4NVJJgozXTI+neW7LYvihNiqqb9wRrw==","X-Minio-Internal-Server-Side-Encryption-Seal-Algorithm":"DAREv2-HMAC-SHA256","content-type":"text/pl...