Files
kami_jd_ck/bind_card/js/captcha_m.js
2025-04-13 19:17:51 +08:00

13831 lines
624 KiB
JavaScript

var deasync = require("deasync")
var windows = {};
var Module = typeof Module !== "undefined" ? Module : {};
var moduleOverrides = {};
var key;
for (key in Module) {
if (Module.hasOwnProperty(key)) {
moduleOverrides[key] = Module[key]
}
}
var arguments_ = [];
var thisProgram = "./this.program";
var quit_ = function (status, toThrow) {
throw toThrow
};
var ENVIRONMENT_IS_WEB = false;
var ENVIRONMENT_IS_WORKER = false;
var ENVIRONMENT_IS_NODE = false;
var ENVIRONMENT_HAS_NODE = false;
var ENVIRONMENT_IS_SHELL = false;
ENVIRONMENT_IS_WEB = typeof window === "object";
ENVIRONMENT_IS_WORKER = typeof importScripts === "function";
ENVIRONMENT_HAS_NODE = typeof process === "object" && typeof process.versions === "object" && typeof process.versions.node === "string";
ENVIRONMENT_IS_NODE = ENVIRONMENT_HAS_NODE && !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_WORKER;
ENVIRONMENT_IS_SHELL = !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_WORKER;
var scriptDirectory = "";
function locateFile(path) {
if (Module["locateFile"]) {
return Module["locateFile"](path, scriptDirectory)
}
return scriptDirectory + path
}
var read_, readAsync, readBinary, setWindowTitle;
var nodeFS;
var nodePath;
if (ENVIRONMENT_IS_NODE) {
scriptDirectory = __dirname + "/";
read_ = function shell_read(filename, binary) {
var ret = tryParseAsDataURI(filename);
if (ret) {
return binary ? ret : ret.toString()
}
if (!nodeFS)
nodeFS = require("fs");
if (!nodePath)
nodePath = require("path");
filename = nodePath["normalize"](filename);
return nodeFS["readFileSync"](filename, binary ? null : "utf8")
}
;
readBinary = function readBinary(filename) {
var ret = read_(filename, true);
if (!ret.buffer) {
ret = new Uint8Array(ret)
}
assert(ret.buffer);
return ret
}
;
if (process["argv"].length > 1) {
thisProgram = process["argv"][1].replace(/\\/g, "/")
}
arguments_ = process["argv"].slice(2);
if (typeof module !== "undefined") {
module["exports"] = Module
}
process["on"]("uncaughtException", function (ex) {
if (!(ex instanceof ExitStatus)) {
throw ex
}
});
process["on"]("unhandledRejection", abort);
quit_ = function (status) {
process["exit"](status)
}
;
Module["inspect"] = function () {
return "[Emscripten Module object]"
}
} else if (ENVIRONMENT_IS_SHELL) {
if (typeof read != "undefined") {
read_ = function shell_read(f) {
var data = tryParseAsDataURI(f);
if (data) {
return intArrayToString(data)
}
return read(f)
}
}
readBinary = function readBinary(f) {
var data;
data = tryParseAsDataURI(f);
if (data) {
return data
}
if (typeof readbuffer === "function") {
return new Uint8Array(readbuffer(f))
}
data = read(f, "binary");
assert(typeof data === "object");
return data
}
;
if (typeof scriptArgs != "undefined") {
arguments_ = scriptArgs
} else if (typeof arguments != "undefined") {
arguments_ = arguments
}
if (typeof quit === "function") {
quit_ = function (status) {
quit(status)
}
}
if (typeof print !== "undefined") {
if (typeof console === "undefined")
console = {};
console.log = print;
console.warn = console.error = typeof printErr !== "undefined" ? printErr : print
}
} else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) {
if (ENVIRONMENT_IS_WORKER) {
scriptDirectory = self.location.href
} else if (document.currentScript) {
scriptDirectory = document.currentScript.src
}
if (scriptDirectory.indexOf("blob:") !== 0) {
scriptDirectory = scriptDirectory.substr(0, scriptDirectory.lastIndexOf("/") + 1)
} else {
scriptDirectory = ""
}
{
read_ = function shell_read(url) {
try {
var xhr = new XMLHttpRequest;
xhr.open("GET", url, false);
xhr.send(null);
return xhr.responseText
} catch (err) {
var data = tryParseAsDataURI(url);
if (data) {
return intArrayToString(data)
}
throw err
}
}
;
if (ENVIRONMENT_IS_WORKER) {
readBinary = function readBinary(url) {
try {
var xhr = new XMLHttpRequest;
xhr.open("GET", url, false);
xhr.responseType = "arraybuffer";
xhr.send(null);
return new Uint8Array(xhr.response)
} catch (err) {
var data = tryParseAsDataURI(url);
if (data) {
return data
}
throw err
}
}
}
readAsync = function readAsync(url, onload, onerror) {
var xhr = new XMLHttpRequest;
xhr.open("GET", url, true);
xhr.responseType = "arraybuffer";
xhr.onload = function xhr_onload() {
if (xhr.status == 200 || xhr.status == 0 && xhr.response) {
onload(xhr.response);
return
}
var data = tryParseAsDataURI(url);
if (data) {
onload(data.buffer);
return
}
onerror()
}
;
xhr.onerror = onerror;
xhr.send(null)
}
}
setWindowTitle = function (title) {
document.title = title
}
} else {
}
var out = Module["print"] || console.log.bind(console);
var err = Module["printErr"] || console.warn.bind(console);
for (key in moduleOverrides) {
if (moduleOverrides.hasOwnProperty(key)) {
Module[key] = moduleOverrides[key]
}
}
moduleOverrides = null;
if (Module["arguments"])
arguments_ = Module["arguments"];
if (Module["thisProgram"])
thisProgram = Module["thisProgram"];
if (Module["quit"])
quit_ = Module["quit"];
var STACK_ALIGN = 16;
function dynamicAlloc(size) {
var ret = HEAP32[DYNAMICTOP_PTR >> 2];
var end = ret + size + 15 & -16;
if (end > _emscripten_get_heap_size()) {
abort()
}
HEAP32[DYNAMICTOP_PTR >> 2] = end;
return ret
}
function getNativeTypeSize(type) {
switch (type) {
case "i1":
case "i8":
return 1;
case "i16":
return 2;
case "i32":
return 4;
case "i64":
return 8;
case "float":
return 4;
case "double":
return 8;
default: {
if (type[type.length - 1] === "*") {
return 4
} else if (type[0] === "i") {
var bits = parseInt(type.substr(1));
assert(bits % 8 === 0, "getNativeTypeSize invalid bits " + bits + ", type " + type);
return bits / 8
} else {
return 0
}
}
}
}
function warnOnce(text) {
if (!warnOnce.shown)
warnOnce.shown = {};
if (!warnOnce.shown[text]) {
warnOnce.shown[text] = 1;
err(text)
}
}
function convertJsFunctionToWasm(func, sig) {
return func
}
function addFunctionWasm(func, sig) {
var table = wasmTable;
var ret = table.length;
try {
table.grow(1)
} catch (err) {
if (!err instanceof RangeError) {
throw err
}
throw "Unable to grow wasm table. Use a higher value for RESERVED_FUNCTION_POINTERS or set ALLOW_TABLE_GROWTH."
}
try {
table.set(ret, func)
} catch (err) {
if (!err instanceof TypeError) {
throw err
}
assert(typeof sig !== "undefined", "Missing signature argument to addFunction");
var wrapped = convertJsFunctionToWasm(func, sig);
table.set(ret, wrapped)
}
return ret
}
function removeFunctionWasm(index) {
}
var funcWrappers = {};
function dynCall(sig, ptr, args) {
if (args && args.length) {
return Module["dynCall_" + sig].apply(null, [ptr].concat(args))
} else {
return Module["dynCall_" + sig].call(null, ptr)
}
}
var tempRet0 = 0;
var setTempRet0 = function (value) {
tempRet0 = value
};
var getTempRet0 = function () {
return tempRet0
};
var wasmBinary;
if (Module["wasmBinary"])
wasmBinary = Module["wasmBinary"];
var noExitRuntime;
if (Module["noExitRuntime"])
noExitRuntime = Module["noExitRuntime"];
var WebAssembly = {
Memory: function (opts) {
return {
buffer: new ArrayBuffer(opts["initial"] * 65536),
grow: function (amount) {
var ret = __growWasmMemory(amount);
return ret
}
}
},
Table: function (opts) {
var ret = new Array(opts["initial"]);
ret.grow = function (by) {
if (ret.length >= 103 + 0) {
abort("Unable to grow wasm table. Use a higher value for RESERVED_FUNCTION_POINTERS or set ALLOW_TABLE_GROWTH.")
}
ret.push(null)
}
;
ret.set = function (i, func) {
ret[i] = func
}
;
ret.get = function (i) {
return ret[i]
}
;
return ret
},
Module: function (binary) {
return {}
},
Instance: function (module, info) {
var decodeBase64 = typeof atob === "function" ? atob : function (input) {
var keyStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
var output = "";
var chr1, chr2, chr3;
var enc1, enc2, enc3, enc4;
var i = 0;
input = input.replace(/[^A-Za-z0-9\+\/\=]/g, "");
do {
enc1 = keyStr.indexOf(input.charAt(i++));
enc2 = keyStr.indexOf(input.charAt(i++));
enc3 = keyStr.indexOf(input.charAt(i++));
enc4 = keyStr.indexOf(input.charAt(i++));
chr1 = enc1 << 2 | enc2 >> 4;
chr2 = (enc2 & 15) << 4 | enc3 >> 2;
chr3 = (enc3 & 3) << 6 | enc4;
output = output + String.fromCharCode(chr1);
if (enc3 !== 64) {
output = output + String.fromCharCode(chr2)
}
if (enc4 !== 64) {
output = output + String.fromCharCode(chr3)
}
} while (i < input.length);
return output
}
;
function intArrayFromBase64(s) {
if (typeof ENVIRONMENT_IS_NODE === "boolean" && ENVIRONMENT_IS_NODE) {
var buf;
try {
buf = Buffer.from(s, "base64")
} catch (_) {
buf = new Buffer(s, "base64")
}
return new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength)
}
try {
var decoded = decodeBase64(s);
var bytes = new Uint8Array(decoded.length);
for (var i = 0; i < decoded.length; ++i) {
bytes[i] = decoded.charCodeAt(i)
}
return bytes
} catch (_) {
throw new Error("Converting base64 string to bytes failed.")
}
}
var atob = decodeBase64;
var exports = (// EMSCRIPTEN_START_ASM
function a(/** @suppress {uselessCode} */
asmLibraryArg, wasmMemory, wasmTable) {
function b(global, env, buffer) {
var memory = env.memory;
var c = wasmTable;
var d = new global.Int8Array(buffer);
var e = new global.Int16Array(buffer);
var f = new global.Int32Array(buffer);
var g = new global.Uint8Array(buffer);
var h = new global.Uint16Array(buffer);
var i = new global.Uint32Array(buffer);
var j = new global.Float32Array(buffer);
var k = new global.Float64Array(buffer);
var l = global.Math.imul;
var m = global.Math.fround;
var n = global.Math.abs;
var o = global.Math.clz32;
var p = global.Math.min;
var q = global.Math.max;
var r = global.Math.floor;
var s = global.Math.ceil;
var t = global.Math.sqrt;
var u = env.abort;
var v = global.NaN;
var w = global.Infinity;
var x = env._embind_register_value_object;
var y = env._embind_register_value_object_field;
var z = env._embind_finalize_value_object;
var A = env._embind_register_function;
var B = env.__cxa_allocate_exception;
var C = env.__cxa_throw;
var D = env.fd_write;
var E = env.__lock;
var F = env.__unlock;
var G = env.environ_sizes_get;
var H = env.environ_get;
var I = env.abort;
var J = env._embind_register_void;
var K = env._embind_register_bool;
var L = env._embind_register_std_string;
var M = env._embind_register_std_wstring;
var N = env._embind_register_emval;
var O = env._embind_register_integer;
var P = env._embind_register_float;
var Q = env._embind_register_memory_view;
var R = env.emscripten_resize_heap;
var S = env.emscripten_memcpy_big;
var T = env.setTempRet0;
var U = 5268320;
var V = 25440;
var W = 0;
// EMSCRIPTEN_START_FUNCS
function fa() {
od();
tc();
Ec();
c[102](24932) | 0
}
function ga(a) {
var b = 0;
if (a) {
b = 280;
while (1) {
d[a | 0] = 0;
a = a + 1 | 0;
b = b + -1 | 0;
if (b) {
continue
}
break
}
}
}
function ha(a, c, e) {
var h = 0
, i = 0
, j = 0
, k = 0
, l = 0
, m = 0
, n = 0
, o = 0
, p = 0
, q = 0
, r = 0;
m = U - 2048 | 0;
U = m;
if (!g[15072]) {
h = 1;
while (1) {
f[(h << 2) + m >> 2] = i;
f[(m + 1024 | 0) + (i << 2) >> 2] = h;
h = h << 24 >> 31 & 27 ^ (h << 1 & 254 ^ h);
i = i + 1 | 0;
if ((i | 0) != 256) {
continue
}
break
}
f[3780] = 27;
f[3781] = 54;
f[3778] = 64;
f[3779] = 128;
f[3776] = 16;
f[3777] = 32;
f[3774] = 4;
f[3775] = 8;
f[3772] = 1;
f[3773] = 2;
d[15136] = 99;
d[23683] = 0;
h = 1;
while (1) {
i = f[((0 - f[(h << 2) + m >> 2] << 2) + m | 0) + 2044 >> 2];
j = (i << 1 | i >>> 7) & 255;
k = j << 1 & 254;
l = k | j >>> 7;
o = l << 1 & 254;
k = k >>> 7 | o;
i = (k << 1 & 254 | o >>> 7) ^ (k ^ (l ^ (i ^ j))) ^ 99;
d[h + 15136 | 0] = i;
d[i + 23584 | 0] = h;
h = h + 1 | 0;
if ((h | 0) != 256) {
continue
}
break
}
j = 0;
o = f[m + 44 >> 2];
p = f[m + 52 >> 2];
q = f[m + 36 >> 2];
r = f[m + 56 >> 2];
while (1) {
i = g[j + 15136 | 0];
k = i << 24 >> 31 & 27 ^ i << 1 & 254;
h = j << 2;
l = k | (i << 16 | i << 8);
k = i ^ k;
n = l << 8 | k;
f[h + 20512 >> 2] = n;
f[h + 19488 >> 2] = l | k << 24;
k = i | n << 8;
f[h + 21536 >> 2] = k;
f[h + 22560 >> 2] = i | k << 8;
i = 0;
k = 0;
l = 0;
n = g[j + 23584 | 0];
if (n) {
l = f[(n << 2) + m >> 2];
k = f[(m + 1024 | 0) + ((l + r | 0) % 255 << 2) >> 2] ^ f[(m + 1024 | 0) + ((l + q | 0) % 255 << 2) >> 2] << 8;
i = k ^ f[(m + 1024 | 0) + ((l + p | 0) % 255 << 2) >> 2] << 16;
l = f[(m + 1024 | 0) + ((l + o | 0) % 255 << 2) >> 2]
}
l = l << 24 ^ i;
f[h + 15392 >> 2] = l;
l = i << 8 | l >>> 24;
f[h + 16416 >> 2] = l;
i = i >>> 16 & 255 | l << 8;
f[h + 17440 >> 2] = i;
f[h + 18464 >> 2] = k >>> 8 & 255 | i << 8;
j = j + 1 | 0;
if ((j | 0) != 256) {
continue
}
break
}
d[15072] = 1
}
h = a;
i = 10;
a: {
b: {
if ((e | 0) == 128) {
break b
}
if ((e | 0) != 256) {
l = -32;
if ((e | 0) != 192) {
break a
}
i = 12;
break b
}
i = 14
}
f[h >> 2] = i;
h = a + 8 | 0;
f[a + 4 >> 2] = h;
k = e >>> 5;
j = 0;
while (1) {
e = j << 2;
f[(e + a | 0) + 8 >> 2] = g[c + e | 0] | g[(e | 1) + c | 0] << 8 | g[(e | 2) + c | 0] << 16 | g[(e | 3) + c | 0] << 24;
j = j + 1 | 0;
if ((k | 0) != (j | 0)) {
continue
}
break
}
l = 0;
a = i + -10 | 0;
if (a >>> 0 > 4) {
break a
}
c: {
switch (a - 1 | 0) {
default:
c = f[h >> 2];
j = 0;
while (1) {
a = f[h + 12 >> 2];
c = g[(a >>> 8 & 255) + 15136 | 0] ^ (f[(j << 2) + 15088 >> 2] ^ c) ^ g[(a >>> 16 & 255) + 15136 | 0] << 8 ^ g[(a >>> 24) + 15136 | 0] << 16 ^ g[(a & 255) + 15136 | 0] << 24;
f[h + 16 >> 2] = c;
e = f[h + 4 >> 2] ^ c;
f[h + 20 >> 2] = e;
e = e ^ f[h + 8 >> 2];
f[h + 24 >> 2] = e;
f[h + 28 >> 2] = a ^ e;
h = h + 16 | 0;
j = j + 1 | 0;
if ((j | 0) != 10) {
continue
}
break
}
break a;
case 1:
c = f[h >> 2];
j = 0;
while (1) {
a = f[h + 20 >> 2];
c = g[(a >>> 8 & 255) + 15136 | 0] ^ (f[(j << 2) + 15088 >> 2] ^ c) ^ g[(a >>> 16 & 255) + 15136 | 0] << 8 ^ g[(a >>> 24) + 15136 | 0] << 16 ^ g[(a & 255) + 15136 | 0] << 24;
f[h + 24 >> 2] = c;
e = f[h + 4 >> 2] ^ c;
f[h + 28 >> 2] = e;
e = e ^ f[h + 8 >> 2];
f[h + 32 >> 2] = e;
e = e ^ f[h + 12 >> 2];
f[h + 36 >> 2] = e;
e = e ^ f[h + 16 >> 2];
f[h + 40 >> 2] = e;
f[h + 44 >> 2] = a ^ e;
h = h + 24 | 0;
j = j + 1 | 0;
if ((j | 0) != 8) {
continue
}
break
}
break a;
case 3:
break c;
case 0:
case 2:
break a
}
}
j = f[h >> 2];
k = 0;
while (1) {
a = f[h + 28 >> 2];
j = g[(a >>> 8 & 255) + 15136 | 0] ^ (f[(k << 2) + 15088 >> 2] ^ j) ^ g[(a >>> 16 & 255) + 15136 | 0] << 8 ^ g[(a >>> 24) + 15136 | 0] << 16 ^ g[(a & 255) + 15136 | 0] << 24;
f[h + 32 >> 2] = j;
c = f[h + 4 >> 2] ^ j;
f[h + 36 >> 2] = c;
c = c ^ f[h + 8 >> 2];
f[h + 40 >> 2] = c;
c = c ^ f[h + 12 >> 2];
f[h + 44 >> 2] = c;
c = f[h + 16 >> 2] ^ g[(c & 255) + 15136 | 0] ^ g[(c >>> 8 & 255) + 15136 | 0] << 8 ^ g[(c >>> 16 & 255) + 15136 | 0] << 16 ^ g[(c >>> 24) + 15136 | 0] << 24;
f[h + 48 >> 2] = c;
c = c ^ f[h + 20 >> 2];
f[h + 52 >> 2] = c;
c = c ^ f[h + 24 >> 2];
f[h + 56 >> 2] = c;
f[h + 60 >> 2] = a ^ c;
h = h + 32 | 0;
k = k + 1 | 0;
if ((k | 0) != 7) {
continue
}
break
}
}
U = m + 2048 | 0;
return l
}
function ia(a, c, e) {
var s = 0
, t = 0
, u = 0
, v = 0
, w = 0;
t = U - 288 | 0;
U = t;
v = 280;
Ve(t + 8 | 0, 280);
f[a + 4 >> 2] = a + 8;
w = ha(t + 8 | 0, c, e);
if (!w) {
u = f[t + 8 >> 2];
f[a >> 2] = u;
c = f[t + 12 >> 2] + (u << 4) | 0;
f[a + 8 >> 2] = f[c >> 2];
f[a + 12 >> 2] = f[c + 4 >> 2];
f[a + 16 >> 2] = f[c + 8 >> 2];
f[a + 20 >> 2] = f[c + 12 >> 2];
a = a + 24 | 0;
e = c + -16 | 0;
if (!((u | 0) < 2)) {
while (1) {
c = f[e >> 2];
f[a >> 2] = f[(g[(c >>> 8 & 255) + 15136 | 0] << 2) + 16416 >> 2] ^ f[(g[(c & 255) + 15136 | 0] << 2) + 15392 >> 2] ^ f[(g[(c >>> 16 & 255) + 15136 | 0] << 2) + 17440 >> 2] ^ f[(g[(c >>> 24) + 15136 | 0] << 2) + 18464 >> 2];
c = e;
s = f[c + 4 >> 2];
f[a + 4 >> 2] = f[(g[(s >>> 8 & 255) + 15136 | 0] << 2) + 16416 >> 2] ^ f[(g[(s & 255) + 15136 | 0] << 2) + 15392 >> 2] ^ f[(g[(s >>> 16 & 255) + 15136 | 0] << 2) + 17440 >> 2] ^ f[(g[(s >>> 24) + 15136 | 0] << 2) + 18464 >> 2];
s = f[c + 8 >> 2];
f[a + 8 >> 2] = f[(g[(s >>> 8 & 255) + 15136 | 0] << 2) + 16416 >> 2] ^ f[(g[(s & 255) + 15136 | 0] << 2) + 15392 >> 2] ^ f[(g[(s >>> 16 & 255) + 15136 | 0] << 2) + 17440 >> 2] ^ f[(g[(s >>> 24) + 15136 | 0] << 2) + 18464 >> 2];
s = f[c + 12 >> 2];
f[a + 12 >> 2] = f[(g[(s >>> 8 & 255) + 15136 | 0] << 2) + 16416 >> 2] ^ f[(g[(s & 255) + 15136 | 0] << 2) + 15392 >> 2] ^ f[(g[(s >>> 16 & 255) + 15136 | 0] << 2) + 17440 >> 2] ^ f[(g[(s >>> 24) + 15136 | 0] << 2) + 18464 >> 2];
e = c + -16 | 0;
a = a + 16 | 0;
s = (u | 0) > 2;
u = u + -1 | 0;
if (s) {
continue
}
break
}
}
c = c + 16 | 0;
f[a >> 2] = f[e >> 2];
f[a + 4 >> 2] = f[c + -28 >> 2];
f[a + 8 >> 2] = f[c + -24 >> 2];
f[a + 12 >> 2] = f[c + -20 >> 2]
}
a = t + 8 | 0;
while (1) {
d[a | 0] = 0;
a = a + 1 | 0;
v = v + -1 | 0;
if (v) {
continue
}
break
}
U = t + 288 | 0;
return w
}
function ja(a, c, e) {
var x = 0
, y = 0
, z = 0
, A = 0
, B = 0
, C = 0
, D = 0
, E = 0
, F = 0
, G = 0
, H = 0
, I = 0
, J = 0
, K = 0
, L = 0
, M = 0
, N = 0
, O = 0;
y = f[a + 4 >> 2];
x = U - 48 | 0;
z = g[c | 0] | g[c + 1 | 0] << 8 | (g[c + 2 | 0] << 16 | g[c + 3 | 0] << 24);
f[x + 40 >> 2] = z;
B = z ^ f[y >> 2];
f[x + 40 >> 2] = B;
C = f[y + 4 >> 2] ^ (g[c + 4 | 0] | g[c + 5 | 0] << 8 | (g[c + 6 | 0] << 16 | g[c + 7 | 0] << 24));
f[x + 36 >> 2] = C;
D = f[y + 8 >> 2] ^ (g[c + 8 | 0] | g[c + 9 | 0] << 8 | (g[c + 10 | 0] << 16 | g[c + 11 | 0] << 24));
f[x + 32 >> 2] = D;
z = g[c + 12 | 0] | g[c + 13 | 0] << 8 | (g[c + 14 | 0] << 16 | g[c + 15 | 0] << 24);
c = y + 16 | 0;
f[x + 44 >> 2] = c;
A = z ^ f[y + 12 >> 2];
f[x + 28 >> 2] = A;
E = f[a >> 2] >> 1;
while (1) {
a = f[(D >>> 22 & 1020) + 22560 >> 2] ^ (f[(C >>> 14 & 1020) + 21536 >> 2] ^ (f[(B >>> 6 & 1020) + 20512 >> 2] ^ (f[((A & 255) << 2) + 19488 >> 2] ^ f[c + 12 >> 2])));
y = f[(C >>> 22 & 1020) + 22560 >> 2] ^ (f[(B >>> 14 & 1020) + 21536 >> 2] ^ (f[(A >>> 6 & 1020) + 20512 >> 2] ^ (f[((D & 255) << 2) + 19488 >> 2] ^ f[c + 8 >> 2])));
z = f[(B >>> 22 & 1020) + 22560 >> 2] ^ (f[(A >>> 14 & 1020) + 21536 >> 2] ^ (f[(D >>> 6 & 1020) + 20512 >> 2] ^ (f[((C & 255) << 2) + 19488 >> 2] ^ f[c + 4 >> 2])));
A = f[(A >>> 22 & 1020) + 22560 >> 2] ^ (f[(D >>> 14 & 1020) + 21536 >> 2] ^ (f[(C >>> 6 & 1020) + 20512 >> 2] ^ (f[((B & 255) << 2) + 19488 >> 2] ^ f[c >> 2])));
B = A & 255;
C = f[c + 16 >> 2];
if ((E | 0) >= 2) {
B = f[(a >>> 22 & 1020) + 22560 >> 2] ^ (f[(y >>> 14 & 1020) + 21536 >> 2] ^ (f[(z >>> 6 & 1020) + 20512 >> 2] ^ (C ^ f[(B << 2) + 19488 >> 2])));
f[x + 40 >> 2] = B;
C = f[(A >>> 22 & 1020) + 22560 >> 2] ^ (f[(a >>> 14 & 1020) + 21536 >> 2] ^ (f[(y >>> 6 & 1020) + 20512 >> 2] ^ (f[((z & 255) << 2) + 19488 >> 2] ^ f[c + 20 >> 2])));
f[x + 36 >> 2] = C;
D = f[(z >>> 22 & 1020) + 22560 >> 2] ^ (f[(A >>> 14 & 1020) + 21536 >> 2] ^ (f[(a >>> 6 & 1020) + 20512 >> 2] ^ (f[((y & 255) << 2) + 19488 >> 2] ^ f[c + 24 >> 2])));
f[x + 32 >> 2] = D;
A = f[(y >>> 22 & 1020) + 22560 >> 2] ^ (f[(z >>> 14 & 1020) + 21536 >> 2] ^ (f[(A >>> 6 & 1020) + 20512 >> 2] ^ (f[((a & 255) << 2) + 19488 >> 2] ^ f[c + 28 >> 2])));
f[x + 28 >> 2] = A;
c = c + 32 | 0;
E = E + -1 | 0;
continue
}
break
}
B = g[B + 15136 | 0];
f[x + 20 >> 2] = z;
D = g[(z >>> 8 & 255) + 15136 | 0];
f[x + 16 >> 2] = y;
E = g[(y >>> 16 & 255) + 15136 | 0];
f[x + 12 >> 2] = a;
B = B ^ C;
C = B ^ D << 8;
D = C ^ E << 16;
E = D ^ g[(a >>> 24) + 15136 | 0] << 24;
f[x + 40 >> 2] = E;
G = g[(y >>> 8 & 255) + 15136 | 0];
H = g[(z & 255) + 15136 | 0];
f[x + 24 >> 2] = A;
F = G << 8;
G = H ^ f[c + 20 >> 2];
H = F ^ G;
M = H ^ g[(a >>> 16 & 255) + 15136 | 0] << 16;
N = M ^ g[(A >>> 24) + 15136 | 0] << 24;
f[x + 36 >> 2] = N;
F = g[(z >>> 24) + 15136 | 0];
I = g[(A >>> 16 & 255) + 15136 | 0];
J = g[(a >>> 8 & 255) + 15136 | 0];
K = f[c + 24 >> 2];
f[x + 44 >> 2] = c + 32;
L = F << 24;
O = I << 16;
F = K ^ g[(y & 255) + 15136 | 0];
I = F ^ J << 8;
J = O ^ I;
K = L ^ J;
f[x + 32 >> 2] = K;
L = g[(y >>> 24) + 15136 | 0] << 24;
a = f[c + 28 >> 2] ^ g[(a & 255) + 15136 | 0];
c = a ^ g[(A >>> 8 & 255) + 15136 | 0] << 8;
y = c ^ g[(z >>> 16 & 255) + 15136 | 0] << 16;
z = L ^ y;
f[x + 28 >> 2] = z;
d[e + 14 | 0] = y >>> 16;
d[e + 13 | 0] = c >>> 8;
d[e + 12 | 0] = a;
d[e + 11 | 0] = K >>> 24;
d[e + 10 | 0] = J >>> 16;
d[e + 9 | 0] = I >>> 8;
d[e + 8 | 0] = F;
d[e + 7 | 0] = N >>> 24;
d[e + 6 | 0] = M >>> 16;
d[e + 5 | 0] = H >>> 8;
d[e + 4 | 0] = G;
d[e + 3 | 0] = E >>> 24;
d[e + 2 | 0] = D >>> 16;
d[e + 1 | 0] = C >>> 8;
d[e | 0] = B;
d[e + 15 | 0] = z >>> 24;
d[x + 40 | 0] = 0;
d[x + 41 | 0] = 0;
d[x + 42 | 0] = 0;
d[x + 43 | 0] = 0;
d[x + 36 | 0] = 0;
d[x + 37 | 0] = 0;
d[x + 38 | 0] = 0;
d[x + 39 | 0] = 0;
d[x + 32 | 0] = 0;
d[x + 33 | 0] = 0;
d[x + 34 | 0] = 0;
d[x + 35 | 0] = 0;
d[x + 28 | 0] = 0;
d[x + 29 | 0] = 0;
d[x + 30 | 0] = 0;
d[x + 31 | 0] = 0;
d[x + 24 | 0] = 0;
d[x + 25 | 0] = 0;
d[x + 26 | 0] = 0;
d[x + 27 | 0] = 0;
d[x + 20 | 0] = 0;
d[x + 21 | 0] = 0;
d[x + 22 | 0] = 0;
d[x + 23 | 0] = 0;
d[x + 16 | 0] = 0;
d[x + 17 | 0] = 0;
d[x + 18 | 0] = 0;
d[x + 19 | 0] = 0;
d[x + 12 | 0] = 0;
d[x + 13 | 0] = 0;
d[x + 14 | 0] = 0;
d[x + 15 | 0] = 0;
d[x + 44 | 0] = 0;
d[x + 45 | 0] = 0;
d[x + 46 | 0] = 0;
d[x + 47 | 0] = 0
}
function ka(a, c, e) {
var P = 0
, Q = 0
, R = 0
, S = 0
, T = 0
, V = 0
, W = 0
, X = 0
, Y = 0
, Z = 0
, _ = 0
, $ = 0
, aa = 0
, ba = 0
, ca = 0
, da = 0
, ea = 0
, fa = 0;
Q = f[a + 4 >> 2];
P = U - 48 | 0;
R = g[c | 0] | g[c + 1 | 0] << 8 | (g[c + 2 | 0] << 16 | g[c + 3 | 0] << 24);
f[P + 40 >> 2] = R;
T = R ^ f[Q >> 2];
f[P + 40 >> 2] = T;
V = f[Q + 4 >> 2] ^ (g[c + 4 | 0] | g[c + 5 | 0] << 8 | (g[c + 6 | 0] << 16 | g[c + 7 | 0] << 24));
f[P + 36 >> 2] = V;
W = f[Q + 8 >> 2] ^ (g[c + 8 | 0] | g[c + 9 | 0] << 8 | (g[c + 10 | 0] << 16 | g[c + 11 | 0] << 24));
f[P + 32 >> 2] = W;
R = g[c + 12 | 0] | g[c + 13 | 0] << 8 | (g[c + 14 | 0] << 16 | g[c + 15 | 0] << 24);
c = Q + 16 | 0;
f[P + 44 >> 2] = c;
S = R ^ f[Q + 12 >> 2];
f[P + 28 >> 2] = S;
X = f[a >> 2] >> 1;
while (1) {
a = f[(T >>> 22 & 1020) + 18464 >> 2] ^ (f[(V >>> 14 & 1020) + 17440 >> 2] ^ (f[(W >>> 6 & 1020) + 16416 >> 2] ^ (f[((S & 255) << 2) + 15392 >> 2] ^ f[c + 12 >> 2])));
Q = f[(S >>> 22 & 1020) + 18464 >> 2] ^ (f[(T >>> 14 & 1020) + 17440 >> 2] ^ (f[(V >>> 6 & 1020) + 16416 >> 2] ^ (f[((W & 255) << 2) + 15392 >> 2] ^ f[c + 8 >> 2])));
R = f[(W >>> 22 & 1020) + 18464 >> 2] ^ (f[(S >>> 14 & 1020) + 17440 >> 2] ^ (f[(T >>> 6 & 1020) + 16416 >> 2] ^ (f[((V & 255) << 2) + 15392 >> 2] ^ f[c + 4 >> 2])));
S = f[(V >>> 22 & 1020) + 18464 >> 2] ^ (f[(W >>> 14 & 1020) + 17440 >> 2] ^ (f[(S >>> 6 & 1020) + 16416 >> 2] ^ (f[((T & 255) << 2) + 15392 >> 2] ^ f[c >> 2])));
T = S & 255;
V = f[c + 16 >> 2];
if ((X | 0) >= 2) {
T = f[(R >>> 22 & 1020) + 18464 >> 2] ^ (f[(Q >>> 14 & 1020) + 17440 >> 2] ^ (f[(a >>> 6 & 1020) + 16416 >> 2] ^ (V ^ f[(T << 2) + 15392 >> 2])));
f[P + 40 >> 2] = T;
V = f[(Q >>> 22 & 1020) + 18464 >> 2] ^ (f[(a >>> 14 & 1020) + 17440 >> 2] ^ (f[(S >>> 6 & 1020) + 16416 >> 2] ^ (f[((R & 255) << 2) + 15392 >> 2] ^ f[c + 20 >> 2])));
f[P + 36 >> 2] = V;
W = f[(a >>> 22 & 1020) + 18464 >> 2] ^ (f[(S >>> 14 & 1020) + 17440 >> 2] ^ (f[(R >>> 6 & 1020) + 16416 >> 2] ^ (f[((Q & 255) << 2) + 15392 >> 2] ^ f[c + 24 >> 2])));
f[P + 32 >> 2] = W;
S = f[(S >>> 22 & 1020) + 18464 >> 2] ^ (f[(R >>> 14 & 1020) + 17440 >> 2] ^ (f[(Q >>> 6 & 1020) + 16416 >> 2] ^ (f[((a & 255) << 2) + 15392 >> 2] ^ f[c + 28 >> 2])));
f[P + 28 >> 2] = S;
c = c + 32 | 0;
X = X + -1 | 0;
continue
}
break
}
T = g[T + 23584 | 0];
f[P + 12 >> 2] = a;
W = g[(a >>> 8 & 255) + 23584 | 0];
f[P + 16 >> 2] = Q;
X = g[(Q >>> 16 & 255) + 23584 | 0];
f[P + 20 >> 2] = R;
T = T ^ V;
V = T ^ W << 8;
W = V ^ X << 16;
X = W ^ g[(R >>> 24) + 23584 | 0] << 24;
f[P + 40 >> 2] = X;
f[P + 24 >> 2] = S;
aa = f[c + 20 >> 2] ^ g[(R & 255) + 23584 | 0];
ba = aa ^ g[(S >>> 8 & 255) + 23584 | 0] << 8;
ca = ba ^ g[(a >>> 16 & 255) + 23584 | 0] << 16;
da = ca ^ g[(Q >>> 24) + 23584 | 0] << 24;
f[P + 36 >> 2] = da;
Y = g[(a >>> 24) + 23584 | 0];
Z = g[(S >>> 16 & 255) + 23584 | 0];
_ = g[(R >>> 8 & 255) + 23584 | 0];
$ = f[c + 24 >> 2];
f[P + 44 >> 2] = c + 32;
ea = Y << 24;
fa = Z << 16;
Y = $ ^ g[(Q & 255) + 23584 | 0];
Z = Y ^ _ << 8;
_ = fa ^ Z;
$ = ea ^ _;
f[P + 32 >> 2] = $;
a = f[c + 28 >> 2] ^ g[(a & 255) + 23584 | 0];
c = a ^ g[(Q >>> 8 & 255) + 23584 | 0] << 8;
Q = c ^ g[(R >>> 16 & 255) + 23584 | 0] << 16;
R = Q ^ g[(S >>> 24) + 23584 | 0] << 24;
f[P + 28 >> 2] = R;
d[e + 14 | 0] = Q >>> 16;
d[e + 13 | 0] = c >>> 8;
d[e + 12 | 0] = a;
d[e + 11 | 0] = $ >>> 24;
d[e + 10 | 0] = _ >>> 16;
d[e + 9 | 0] = Z >>> 8;
d[e + 8 | 0] = Y;
d[e + 7 | 0] = da >>> 24;
d[e + 6 | 0] = ca >>> 16;
d[e + 5 | 0] = ba >>> 8;
d[e + 4 | 0] = aa;
d[e + 3 | 0] = X >>> 24;
d[e + 2 | 0] = W >>> 16;
d[e + 1 | 0] = V >>> 8;
d[e | 0] = T;
d[e + 15 | 0] = R >>> 24;
d[P + 40 | 0] = 0;
d[P + 41 | 0] = 0;
d[P + 42 | 0] = 0;
d[P + 43 | 0] = 0;
d[P + 36 | 0] = 0;
d[P + 37 | 0] = 0;
d[P + 38 | 0] = 0;
d[P + 39 | 0] = 0;
d[P + 32 | 0] = 0;
d[P + 33 | 0] = 0;
d[P + 34 | 0] = 0;
d[P + 35 | 0] = 0;
d[P + 28 | 0] = 0;
d[P + 29 | 0] = 0;
d[P + 30 | 0] = 0;
d[P + 31 | 0] = 0;
d[P + 24 | 0] = 0;
d[P + 25 | 0] = 0;
d[P + 26 | 0] = 0;
d[P + 27 | 0] = 0;
d[P + 20 | 0] = 0;
d[P + 21 | 0] = 0;
d[P + 22 | 0] = 0;
d[P + 23 | 0] = 0;
d[P + 16 | 0] = 0;
d[P + 17 | 0] = 0;
d[P + 18 | 0] = 0;
d[P + 19 | 0] = 0;
d[P + 12 | 0] = 0;
d[P + 13 | 0] = 0;
d[P + 14 | 0] = 0;
d[P + 15 | 0] = 0;
d[P + 44 | 0] = 0;
d[P + 45 | 0] = 0;
d[P + 46 | 0] = 0;
d[P + 47 | 0] = 0
}
function la(a, c, d, e) {
if ((c | 0) == 1) {
ja(a, d, e);
return 0
}
ka(a, d, e);
return 0
}
function ma(a, c, e, ga, ha, ia) {
var la = 0
, ma = 0
, na = 0
, oa = 0
, pa = 0
, qa = 0
, ra = 0
, sa = 0
, ta = 0
, ua = 0
, va = 0
, wa = 0
, xa = 0
, ya = 0
, za = 0
, Aa = 0;
ma = U - 16 | 0;
U = ma;
na = -34;
a: {
if (e & 15) {
break a
}
if (c) {
na = 0;
if (!e) {
break a
}
oa = (c | 0) != 1;
while (1) {
d[ia | 0] = g[ga | 0] ^ g[ha | 0];
d[ia + 1 | 0] = g[ga + 1 | 0] ^ g[ha + 1 | 0];
d[ia + 2 | 0] = g[ga + 2 | 0] ^ g[ha + 2 | 0];
d[ia + 3 | 0] = g[ga + 3 | 0] ^ g[ha + 3 | 0];
d[ia + 4 | 0] = g[ga + 4 | 0] ^ g[ha + 4 | 0];
d[ia + 5 | 0] = g[ga + 5 | 0] ^ g[ha + 5 | 0];
d[ia + 6 | 0] = g[ga + 6 | 0] ^ g[ha + 6 | 0];
d[ia + 7 | 0] = g[ga + 7 | 0] ^ g[ha + 7 | 0];
d[ia + 8 | 0] = g[ga + 8 | 0] ^ g[ha + 8 | 0];
d[ia + 9 | 0] = g[ga + 9 | 0] ^ g[ha + 9 | 0];
d[ia + 10 | 0] = g[ga + 10 | 0] ^ g[ha + 10 | 0];
d[ia + 11 | 0] = g[ga + 11 | 0] ^ g[ha + 11 | 0];
d[ia + 12 | 0] = g[ga + 12 | 0] ^ g[ha + 12 | 0];
d[ia + 13 | 0] = g[ga + 13 | 0] ^ g[ha + 13 | 0];
d[ia + 14 | 0] = g[ga + 14 | 0] ^ g[ha + 14 | 0];
d[ia + 15 | 0] = g[ga + 15 | 0] ^ g[ha + 15 | 0];
b: {
if (!oa) {
ja(a, ia, ia);
break b
}
ka(a, ia, ia)
}
c = g[ia + 4 | 0] | g[ia + 5 | 0] << 8 | (g[ia + 6 | 0] << 16 | g[ia + 7 | 0] << 24);
la = g[ia | 0] | g[ia + 1 | 0] << 8 | (g[ia + 2 | 0] << 16 | g[ia + 3 | 0] << 24);
d[ga | 0] = la;
d[ga + 1 | 0] = la >>> 8;
d[ga + 2 | 0] = la >>> 16;
d[ga + 3 | 0] = la >>> 24;
d[ga + 4 | 0] = c;
d[ga + 5 | 0] = c >>> 8;
d[ga + 6 | 0] = c >>> 16;
d[ga + 7 | 0] = c >>> 24;
c = g[ia + 12 | 0] | g[ia + 13 | 0] << 8 | (g[ia + 14 | 0] << 16 | g[ia + 15 | 0] << 24);
la = g[ia + 8 | 0] | g[ia + 9 | 0] << 8 | (g[ia + 10 | 0] << 16 | g[ia + 11 | 0] << 24);
d[ga + 8 | 0] = la;
d[ga + 9 | 0] = la >>> 8;
d[ga + 10 | 0] = la >>> 16;
d[ga + 11 | 0] = la >>> 24;
d[ga + 12 | 0] = c;
d[ga + 13 | 0] = c >>> 8;
d[ga + 14 | 0] = c >>> 16;
d[ga + 15 | 0] = c >>> 24;
ia = ia + 16 | 0;
ha = ha + 16 | 0;
e = e + -16 | 0;
if (e) {
continue
}
break
}
break a
}
na = 0;
if (!e) {
break a
}
while (1) {
c = g[ha + 4 | 0] | g[ha + 5 | 0] << 8 | (g[ha + 6 | 0] << 16 | g[ha + 7 | 0] << 24);
f[ma >> 2] = g[ha | 0] | g[ha + 1 | 0] << 8 | (g[ha + 2 | 0] << 16 | g[ha + 3 | 0] << 24);
f[ma + 4 >> 2] = c;
c = g[ha + 12 | 0] | g[ha + 13 | 0] << 8 | (g[ha + 14 | 0] << 16 | g[ha + 15 | 0] << 24);
f[ma + 8 >> 2] = g[ha + 8 | 0] | g[ha + 9 | 0] << 8 | (g[ha + 10 | 0] << 16 | g[ha + 11 | 0] << 24);
f[ma + 12 >> 2] = c;
ka(a, ha, ia);
c = g[ia + 15 | 0];
la = g[ia + 14 | 0];
oa = g[ia + 13 | 0];
pa = g[ia + 12 | 0];
qa = g[ia + 11 | 0];
ra = g[ia + 10 | 0];
sa = g[ia + 9 | 0];
ta = g[ia + 8 | 0];
ua = g[ia + 7 | 0];
va = g[ia + 6 | 0];
wa = g[ia + 5 | 0];
xa = g[ia + 4 | 0];
ya = g[ia + 3 | 0];
za = g[ia + 2 | 0];
Aa = g[ia + 1 | 0];
d[ia | 0] = g[ga | 0] ^ g[ia | 0];
d[ia + 1 | 0] = g[ga + 1 | 0] ^ Aa;
d[ia + 2 | 0] = g[ga + 2 | 0] ^ za;
d[ia + 3 | 0] = g[ga + 3 | 0] ^ ya;
d[ia + 4 | 0] = g[ga + 4 | 0] ^ xa;
d[ia + 5 | 0] = g[ga + 5 | 0] ^ wa;
d[ia + 6 | 0] = g[ga + 6 | 0] ^ va;
d[ia + 7 | 0] = g[ga + 7 | 0] ^ ua;
d[ia + 8 | 0] = g[ga + 8 | 0] ^ ta;
d[ia + 9 | 0] = g[ga + 9 | 0] ^ sa;
d[ia + 10 | 0] = g[ga + 10 | 0] ^ ra;
d[ia + 11 | 0] = g[ga + 11 | 0] ^ qa;
d[ia + 12 | 0] = g[ga + 12 | 0] ^ pa;
d[ia + 13 | 0] = g[ga + 13 | 0] ^ oa;
d[ia + 14 | 0] = g[ga + 14 | 0] ^ la;
d[ia + 15 | 0] = c ^ g[ga + 15 | 0];
c = f[ma + 12 >> 2];
la = f[ma + 8 >> 2];
d[ga + 8 | 0] = la;
d[ga + 9 | 0] = la >>> 8;
d[ga + 10 | 0] = la >>> 16;
d[ga + 11 | 0] = la >>> 24;
d[ga + 12 | 0] = c;
d[ga + 13 | 0] = c >>> 8;
d[ga + 14 | 0] = c >>> 16;
d[ga + 15 | 0] = c >>> 24;
c = f[ma + 4 >> 2];
la = f[ma >> 2];
d[ga | 0] = la;
d[ga + 1 | 0] = la >>> 8;
d[ga + 2 | 0] = la >>> 16;
d[ga + 3 | 0] = la >>> 24;
d[ga + 4 | 0] = c;
d[ga + 5 | 0] = c >>> 8;
d[ga + 6 | 0] = c >>> 16;
d[ga + 7 | 0] = c >>> 24;
ia = ia + 16 | 0;
ha = ha + 16 | 0;
e = e + -16 | 0;
if (e) {
continue
}
break
}
}
U = ma + 16 | 0;
return na
}
function na(a, c, e, U, ga, ha, ia) {
var ka = 0
, Ba = 0;
ka = e + -1 | 0;
Ba = f[U >> 2];
a: {
if (c) {
if (!e) {
break a
}
while (1) {
c = ka;
if (!Ba) {
ja(a, ga, ga)
}
e = ga + Ba | 0;
ka = g[ha | 0] ^ g[e | 0];
d[ia | 0] = ka;
d[e | 0] = ka;
ka = c + -1 | 0;
ia = ia + 1 | 0;
ha = ha + 1 | 0;
Ba = Ba + 1 & 15;
if (c) {
continue
}
break
}
break a
}
if (!e) {
break a
}
while (1) {
c = ka;
if (!Ba) {
ja(a, ga, ga)
}
ka = g[ha | 0];
e = ga + Ba | 0;
d[ia | 0] = ka ^ g[e | 0];
d[e | 0] = ka;
ka = c + -1 | 0;
ia = ia + 1 | 0;
ha = ha + 1 | 0;
Ba = Ba + 1 & 15;
if (c) {
continue
}
break
}
}
f[U >> 2] = Ba;
return 0
}
function oa(a, c, e, U, ga, ha, ia) {
var Ca = 0
, Da = 0
, Ea = 0
, Fa = 0;
Ca = f[e >> 2];
if (c) {
while (1) {
c = c + -1 | 0;
a: {
if (Ca) {
break a
}
ja(a, U, ga);
Da = 16;
while (1) {
if (!Da) {
break a
}
Da = Da + -1 | 0;
Fa = Da + U | 0;
Ea = g[Fa | 0] + 1 | 0;
d[Fa | 0] = Ea;
if ((Ea | 0) != (Ea & 255)) {
continue
}
break
}
}
d[ia | 0] = g[ga + Ca | 0] ^ g[ha | 0];
ia = ia + 1 | 0;
ha = ha + 1 | 0;
Ca = Ca + 1 & 15;
if (c) {
continue
}
break
}
}
f[e >> 2] = Ca;
return 0
}
function pa(a) {
var c = 0;
if (a) {
c = 264;
while (1) {
d[a | 0] = 0;
a = a + 1 | 0;
c = c + -1 | 0;
if (c) {
continue
}
break
}
}
}
function qa(a, e, U) {
var ga = 0
, ha = 0
, ia = 0
, ja = 0
, Ga = 0
, Ha = 0;
f[a >> 2] = 0;
f[a + 4 >> 2] = 0;
while (1) {
d[(a + ga | 0) + 8 | 0] = ga;
ga = ga + 1 | 0;
if ((ga | 0) != 256) {
continue
}
break
}
a = a + 8 | 0;
ga = 0;
while (1) {
ia = ga >>> 0 < U >>> 0 ? ga : 0;
ja = a + ha | 0;
Ga = g[ja | 0];
Ha = g[ia + e | 0] + (Ga + Ha | 0) & 255;
ga = a + Ha | 0;
d[ja | 0] = g[ga | 0];
d[ga | 0] = Ga;
ga = ia + 1 | 0;
ha = ha + 1 | 0;
if ((ha | 0) != 256) {
continue
}
break
}
}
function ra(a, e, U, Ia) {
var Ja = 0
, Ka = 0
, La = 0
, Ma = 0
, Na = 0
, Oa = 0
, Pa = 0
, Qa = 0;
Ja = f[a + 4 >> 2];
Ka = f[a >> 2];
if (e) {
Ma = a + 8 | 0;
while (1) {
Ka = Ka + 1 & 255;
Oa = Ma + Ka | 0;
Na = g[Oa | 0];
Ja = Na + Ja & 255;
Pa = Ma + Ja | 0;
Qa = g[Pa | 0];
d[Oa | 0] = Qa;
d[Pa | 0] = Na;
d[Ia + La | 0] = g[(Na + Qa & 255) + Ma | 0] ^ g[U + La | 0];
La = La + 1 | 0;
if ((La | 0) != (e | 0)) {
continue
}
break
}
}
f[a + 4 >> 2] = Ja;
f[a >> 2] = Ka;
return 0
}
function sa(a) {
var e = 0;
if (a) {
e = 4168;
while (1) {
d[a | 0] = 0;
a = a + 1 | 0;
e = e + -1 | 0;
if (e) {
continue
}
break
}
}
}
function ta(a, d, U) {
var Ia = 0
, Ra = 0
, Sa = 0
, Ta = 0
, Ua = 0
, Va = 0
, Wa = 0
, Xa = 0;
Ia = -22;
if (!(U & 7 | U + -32 >>> 0 > 416)) {
Ue(a + 72 | 0, 1024, 1024);
Ue(a + 1096 | 0, 2048, 1024);
Ue(a + 2120 | 0, 3072, 1024);
Ue(a + 3144 | 0, 4096, 1024);
U = U >>> 3;
Ia = 0;
while (1) {
Sa = Ia + 1 | 0;
Va = Sa >>> 0 < U >>> 0 ? Sa : 0;
Sa = Va + 1 | 0;
Wa = Sa >>> 0 < U >>> 0 ? Sa : 0;
Sa = Wa + 1 | 0;
Sa = Sa >>> 0 < U >>> 0 ? Sa : 0;
Xa = Ra << 2;
f[Xa + a >> 2] = f[Xa + 5120 >> 2] ^ (g[d + Sa | 0] | (g[d + Wa | 0] | (g[d + Ia | 0] << 16 | g[d + Va | 0] << 8)) << 8);
Ia = Sa + 1 | 0;
Ia = Ia >>> 0 < U >>> 0 ? Ia : 0;
Ra = Ra + 1 | 0;
if ((Ra | 0) != 18) {
continue
}
break
}
U = a + 72 | 0;
Ra = 0;
while (1) {
Ia = 0;
while (1) {
d = f[(Ia << 2) + a >> 2] ^ Ta;
Ta = (f[(U + (d >>> 14 & 1020) | 0) + 1024 >> 2] + f[U + (d >>> 22 & 1020) >> 2] ^ f[(U + (d >>> 6 & 1020) | 0) + 2048 >> 2]) + f[(U + ((d & 255) << 2) | 0) + 3072 >> 2] ^ Ra;
Ra = d;
Ia = Ia + 1 | 0;
if ((Ia | 0) != 16) {
continue
}
break
}
Ra = f[a + 64 >> 2];
Ia = Ua << 2;
d = d ^ f[a + 68 >> 2];
f[Ia + a >> 2] = d;
Ra = Ra ^ Ta;
f[(Ia | 4) + a >> 2] = Ra;
Ia = Ua >>> 0 < 16;
Ua = Ua + 2 | 0;
Ta = d;
if (Ia) {
continue
}
break
}
Va = f[a + 68 >> 2];
Wa = f[a + 64 >> 2];
Ua = 0;
Sa = a + 72 | 0;
while (1) {
Ta = 0;
while (1) {
Ia = 0;
while (1) {
U = f[(Ia << 2) + a >> 2] ^ d;
d = (f[(Sa + (U >>> 14 & 1020) | 0) + 1024 >> 2] + f[Sa + (U >>> 22 & 1020) >> 2] ^ f[(Sa + (U >>> 6 & 1020) | 0) + 2048 >> 2]) + f[(Sa + ((U & 255) << 2) | 0) + 3072 >> 2] ^ Ra;
Ra = U;
Ia = Ia + 1 | 0;
if ((Ia | 0) != 16) {
continue
}
break
}
Ra = ((Ua << 10) + a | 0) + 72 | 0;
Ia = Ta << 2;
U = U ^ Va;
f[Ra + Ia >> 2] = U;
Ia = Ra + (Ia | 4) | 0;
Ra = d ^ Wa;
f[Ia >> 2] = Ra;
Ia = Ta >>> 0 < 254;
Ta = Ta + 2 | 0;
d = U;
if (Ia) {
continue
}
break
}
Ua = Ua + 1 | 0;
if ((Ua | 0) != 4) {
continue
}
break
}
Ia = 0
}
return Ia
}
function ua(a, U, Ya, Za) {
var _a = 0
, $a = 0
, ab = 0
, bb = 0;
$a = g[Ya + 4 | 0] | g[Ya + 5 | 0] << 8 | (g[Ya + 6 | 0] << 16 | g[Ya + 7 | 0] << 24);
$a = $a << 24 | $a << 8 & 16711680 | ($a >>> 8 & 65280 | $a >>> 24);
Ya = g[Ya | 0] | g[Ya + 1 | 0] << 8 | (g[Ya + 2 | 0] << 16 | g[Ya + 3 | 0] << 24);
ab = Ya << 24 | Ya << 8 & 16711680 | (Ya >>> 8 & 65280 | Ya >>> 24);
a: {
if (!U) {
Ya = 17;
bb = a + 72 | 0;
while (1) {
_a = f[(Ya << 2) + a >> 2] ^ ab;
ab = (f[(bb + (_a >>> 14 & 1020) | 0) + 1024 >> 2] + f[bb + (_a >>> 22 & 1020) >> 2] ^ f[(bb + (_a >>> 6 & 1020) | 0) + 2048 >> 2]) + f[(bb + ((_a & 255) << 2) | 0) + 3072 >> 2] ^ $a;
U = Ya >>> 0 > 2;
Ya = Ya + -1 | 0;
$a = _a;
if (U) {
continue
}
break
}
Ya = f[a + 4 >> 2] ^ ab;
break a
}
U = 0;
Ya = a + 72 | 0;
while (1) {
_a = f[(U << 2) + a >> 2] ^ ab;
ab = (f[(Ya + (_a >>> 14 & 1020) | 0) + 1024 >> 2] + f[Ya + (_a >>> 22 & 1020) >> 2] ^ f[(Ya + (_a >>> 6 & 1020) | 0) + 2048 >> 2]) + f[(Ya + ((_a & 255) << 2) | 0) + 3072 >> 2] ^ $a;
$a = _a;
U = U + 1 | 0;
if ((U | 0) != 16) {
continue
}
break
}
Ya = f[a + 64 >> 2] ^ ab;
a = a + 68 | 0
}
a = f[a >> 2];
d[Za + 7 | 0] = Ya;
d[Za + 6 | 0] = Ya >>> 8;
d[Za + 5 | 0] = Ya >>> 16;
d[Za + 4 | 0] = Ya >>> 24;
a = a ^ _a;
d[Za + 3 | 0] = a;
d[Za + 2 | 0] = a >>> 8;
d[Za + 1 | 0] = a >>> 16;
d[Za | 0] = a >>> 24;
return 0
}
function va(a, f, U, Ya, Za, cb) {
var db = 0
, eb = 0
, fb = 0;
fb = -24;
a: {
if (U & 7) {
break a
}
if (f) {
fb = 0;
if (!U) {
break a
}
db = g[Ya | 0];
while (1) {
d[cb | 0] = g[Za | 0] ^ db;
d[cb + 1 | 0] = g[Ya + 1 | 0] ^ g[Za + 1 | 0];
d[cb + 2 | 0] = g[Ya + 2 | 0] ^ g[Za + 2 | 0];
d[cb + 3 | 0] = g[Ya + 3 | 0] ^ g[Za + 3 | 0];
d[cb + 4 | 0] = g[Ya + 4 | 0] ^ g[Za + 4 | 0];
d[cb + 5 | 0] = g[Ya + 5 | 0] ^ g[Za + 5 | 0];
d[cb + 6 | 0] = g[Ya + 6 | 0] ^ g[Za + 6 | 0];
d[cb + 7 | 0] = g[Ya + 7 | 0] ^ g[Za + 7 | 0];
ua(a, f, cb, cb);
eb = g[cb + 4 | 0] | g[cb + 5 | 0] << 8 | (g[cb + 6 | 0] << 16 | g[cb + 7 | 0] << 24);
db = g[cb | 0] | g[cb + 1 | 0] << 8 | (g[cb + 2 | 0] << 16 | g[cb + 3 | 0] << 24);
d[Ya | 0] = db;
d[Ya + 1 | 0] = db >>> 8;
d[Ya + 2 | 0] = db >>> 16;
d[Ya + 3 | 0] = db >>> 24;
d[Ya + 4 | 0] = eb;
d[Ya + 5 | 0] = eb >>> 8;
d[Ya + 6 | 0] = eb >>> 16;
d[Ya + 7 | 0] = eb >>> 24;
cb = cb + 8 | 0;
Za = Za + 8 | 0;
U = U + -8 | 0;
if (U) {
continue
}
break
}
break a
}
if (!U) {
return 0
}
while (1) {
db = g[Za + 4 | 0] | g[Za + 5 | 0] << 8 | (g[Za + 6 | 0] << 16 | g[Za + 7 | 0] << 24);
f = g[Za | 0] | g[Za + 1 | 0] << 8 | (g[Za + 2 | 0] << 16 | g[Za + 3 | 0] << 24);
fb = 0;
ua(a, 0, Za, cb);
d[cb | 0] = g[Ya | 0] ^ g[cb | 0];
d[cb + 1 | 0] = g[Ya + 1 | 0] ^ g[cb + 1 | 0];
d[cb + 2 | 0] = g[Ya + 2 | 0] ^ g[cb + 2 | 0];
d[cb + 3 | 0] = g[Ya + 3 | 0] ^ g[cb + 3 | 0];
d[cb + 4 | 0] = g[Ya + 4 | 0] ^ g[cb + 4 | 0];
d[cb + 5 | 0] = g[Ya + 5 | 0] ^ g[cb + 5 | 0];
d[cb + 6 | 0] = g[Ya + 6 | 0] ^ g[cb + 6 | 0];
d[cb + 7 | 0] = g[Ya + 7 | 0] ^ g[cb + 7 | 0];
d[Ya | 0] = f;
d[Ya + 1 | 0] = f >>> 8;
d[Ya + 2 | 0] = f >>> 16;
d[Ya + 3 | 0] = f >>> 24;
d[Ya + 4 | 0] = db;
d[Ya + 5 | 0] = db >>> 8;
d[Ya + 6 | 0] = db >>> 16;
d[Ya + 7 | 0] = db >>> 24;
cb = cb + 8 | 0;
Za = Za + 8 | 0;
U = U + -8 | 0;
if (U) {
continue
}
break
}
}
return fb
}
function wa(a, U, Ya, Za, cb, gb, hb) {
var ib = 0
, jb = 0;
ib = Ya + -1 | 0;
jb = f[Za >> 2];
a: {
if (U) {
if (!Ya) {
break a
}
while (1) {
U = ib;
if (!jb) {
ua(a, 1, cb, cb)
}
Ya = cb + jb | 0;
ib = g[gb | 0] ^ g[Ya | 0];
d[hb | 0] = ib;
d[Ya | 0] = ib;
ib = U + -1 | 0;
hb = hb + 1 | 0;
gb = gb + 1 | 0;
jb = jb + 1 & 7;
if (U) {
continue
}
break
}
break a
}
if (!Ya) {
break a
}
while (1) {
U = ib;
if (!jb) {
ua(a, 1, cb, cb)
}
ib = g[gb | 0];
Ya = cb + jb | 0;
d[hb | 0] = ib ^ g[Ya | 0];
d[Ya | 0] = ib;
ib = U + -1 | 0;
hb = hb + 1 | 0;
gb = gb + 1 | 0;
jb = jb + 1 & 7;
if (U) {
continue
}
break
}
}
f[Za >> 2] = jb;
return 0
}
function xa(a, U, Ya, Za, cb, gb, hb) {
var kb = 0
, lb = 0
, mb = 0
, nb = 0;
kb = f[Ya >> 2];
if (U) {
while (1) {
U = U + -1 | 0;
a: {
if (kb) {
break a
}
ua(a, 1, Za, cb);
lb = 8;
while (1) {
if (!lb) {
break a
}
lb = lb + -1 | 0;
nb = lb + Za | 0;
mb = g[nb | 0] + 1 | 0;
d[nb | 0] = mb;
if ((mb | 0) != (mb & 255)) {
continue
}
break
}
}
d[hb | 0] = g[cb + kb | 0] ^ g[gb | 0];
hb = hb + 1 | 0;
gb = gb + 1 | 0;
kb = kb + 1 & 7;
if (U) {
continue
}
break
}
}
f[Ya >> 2] = kb;
return 0
}
function ya(a) {
var f = 0;
if (a) {
f = 276;
while (1) {
d[a | 0] = 0;
a = a + 1 | 0;
f = f + -1 | 0;
if (f) {
continue
}
break
}
}
}
function za(a, Ya, Za) {
var cb = 0
, gb = 0
, hb = 0
, ob = 0
, pb = 0
, qb = 0
, rb = 0
, sb = 0
, tb = 0
, ub = 0
, vb = 0
, wb = 0
, xb = 0
, yb = 0;
cb = U - 256 | 0;
U = cb;
f[cb + 208 >> 2] = 0;
f[cb + 212 >> 2] = 0;
f[cb + 216 >> 2] = 0;
f[cb + 220 >> 2] = 0;
f[cb + 224 >> 2] = 0;
f[cb + 228 >> 2] = 0;
f[cb + 232 >> 2] = 0;
f[cb + 236 >> 2] = 0;
f[cb + 240 >> 2] = 0;
f[cb + 244 >> 2] = 0;
f[cb + 248 >> 2] = 0;
f[cb + 252 >> 2] = 0;
f[cb + 192 >> 2] = 0;
f[cb + 196 >> 2] = 0;
f[cb + 200 >> 2] = 0;
f[cb + 204 >> 2] = 0;
Ve(a + 4 | 0, 272);
a: {
b: {
c: {
if (!((Za | 0) == 256 | (Za | 0) == 192)) {
gb = -36;
if ((Za | 0) != 128) {
break a
}
f[a >> 2] = 3;
hb = 16;
break c
}
f[a >> 2] = 4;
rb = 1;
hb = Za >>> 3;
if (!hb) {
break b
}
}
Ue(cb + 192 | 0, Ya, hb)
}
if ((Za | 0) == 192) {
d[cb + 216 | 0] = g[cb + 208 | 0] ^ -1;
d[cb + 217 | 0] = g[cb + 209 | 0] ^ -1;
d[cb + 218 | 0] = g[cb + 210 | 0] ^ -1;
d[cb + 219 | 0] = g[cb + 211 | 0] ^ -1;
d[cb + 220 | 0] = g[cb + 212 | 0] ^ -1;
d[cb + 221 | 0] = g[cb + 213 | 0] ^ -1;
d[cb + 222 | 0] = g[cb + 214 | 0] ^ -1;
d[cb + 223 | 0] = g[cb + 215 | 0] ^ -1
}
Ya = 0;
while (1) {
hb = Ya << 3;
gb = hb + (cb + 144 | 0) | 0;
ob = f[hb + 5204 >> 2];
f[gb + 4 >> 2] = ob << 24 | ob << 8 & 16711680 | (ob >>> 8 & 65280 | ob >>> 24);
sb = gb;
gb = f[hb + 5200 >> 2];
f[sb >> 2] = gb << 24 | gb << 8 & 16711680 | (gb >>> 8 & 65280 | gb >>> 24);
Ya = Ya + 1 | 0;
if ((Ya | 0) != 6) {
continue
}
break
}
gb = cb + 96 | 0;
f[gb >> 2] = 0;
f[gb + 4 >> 2] = 0;
f[cb + 136 >> 2] = 0;
f[cb + 140 >> 2] = 0;
f[cb + 128 >> 2] = 0;
f[cb + 132 >> 2] = 0;
sb = cb + 120 | 0;
Ya = sb;
f[Ya >> 2] = 0;
f[Ya + 4 >> 2] = 0;
ub = cb + 112 | 0;
f[ub >> 2] = 0;
f[ub + 4 >> 2] = 0;
Ya = cb + 104 | 0;
f[Ya >> 2] = 0;
f[Ya + 4 >> 2] = 0;
pb = gb;
gb = f[cb + 208 >> 2];
hb = gb << 24 | gb << 8 & 16711680 | (gb >>> 8 & 65280 | gb >>> 24);
f[pb >> 2] = hb;
f[cb + 80 >> 2] = 0;
f[cb + 84 >> 2] = 0;
f[cb + 88 >> 2] = 0;
f[cb + 92 >> 2] = 0;
gb = f[cb + 192 >> 2];
f[cb + 80 >> 2] = gb << 24 | gb << 8 & 16711680 | (gb >>> 8 & 65280 | gb >>> 24);
gb = f[cb + 196 >> 2];
f[cb + 84 >> 2] = gb << 24 | gb << 8 & 16711680 | (gb >>> 8 & 65280 | gb >>> 24);
gb = f[cb + 200 >> 2];
f[cb + 88 >> 2] = gb << 24 | gb << 8 & 16711680 | (gb >>> 8 & 65280 | gb >>> 24);
gb = f[cb + 204 >> 2];
qb = gb << 24 | gb << 8 & 16711680 | (gb >>> 8 & 65280 | gb >>> 24);
f[cb + 92 >> 2] = qb;
gb = f[cb + 212 >> 2];
gb = gb << 24 | gb << 8 & 16711680 | (gb >>> 8 & 65280 | gb >>> 24);
f[cb + 100 >> 2] = gb;
pb = Ya;
Ya = f[cb + 216 >> 2];
ob = Ya << 24 | Ya << 8 & 16711680 | (Ya >>> 8 & 65280 | Ya >>> 24);
f[pb >> 2] = ob;
Ya = f[cb + 220 >> 2];
Ya = Ya << 24 | Ya << 8 & 16711680 | (Ya >>> 8 & 65280 | Ya >>> 24);
f[cb + 108 >> 2] = Ya;
tb = hb ^ f[cb + 80 >> 2];
f[ub >> 2] = tb;
vb = gb ^ f[cb + 84 >> 2];
f[cb + 116 >> 2] = vb;
hb = f[cb + 80 >> 2];
gb = vb ^ f[cb + 148 >> 2];
pb = g[(gb >>> 24) + 5712 | 0];
qb = Ya ^ qb;
gb = g[(gb & 255) + 5456 | 0] | (g[(gb >>> 16 & 255) + 5968 | 0] << 16 | pb << 24 | g[(gb >>> 8 & 255) + 6224 | 0] << 8);
Ya = tb ^ f[cb + 144 >> 2];
Ya = (pb | gb << 8) ^ (g[(Ya >>> 16 & 255) + 5712 | 0] << 16 | g[(Ya >>> 24) + 5456 | 0] << 24 | g[(Ya >>> 8 & 255) + 5968 | 0] << 8 | g[(Ya & 255) + 6224 | 0]);
gb = tf(Ya, 16) ^ gb;
Ya = tf(gb, 24) ^ Ya;
wb = qb ^ Ya;
qb = wb ^ f[cb + 156 >> 2];
pb = g[(qb >>> 24) + 5712 | 0];
qb = g[(qb & 255) + 5456 | 0] | (g[(qb >>> 16 & 255) + 5968 | 0] << 16 | pb << 24 | g[(qb >>> 8 & 255) + 6224 | 0] << 8);
ob = gb ^ (ob ^ f[cb + 88 >> 2]) ^ tf(Ya, 24);
Ya = ob ^ f[cb + 152 >> 2];
gb = (pb | qb << 8) ^ (g[(Ya >>> 16 & 255) + 5712 | 0] << 16 | g[(Ya >>> 24) + 5456 | 0] << 24 | g[(Ya >>> 8 & 255) + 5968 | 0] << 8 | g[(Ya & 255) + 6224 | 0]);
Ya = tf(gb, 16) ^ qb;
gb = tf(Ya, 24) ^ gb;
tb = tf(gb, 24) ^ (Ya ^ tb) ^ hb;
f[ub >> 2] = tb;
qb = f[cb + 84 >> 2] ^ (gb ^ vb);
f[cb + 116 >> 2] = qb;
hb = f[cb + 92 >> 2];
gb = qb ^ f[cb + 164 >> 2];
Ya = g[(gb >>> 24) + 5712 | 0];
gb = g[(gb & 255) + 5456 | 0] | (g[(gb >>> 16 & 255) + 5968 | 0] << 16 | Ya << 24 | g[(gb >>> 8 & 255) + 6224 | 0] << 8);
pb = Ya | gb << 8;
Ya = tb ^ f[cb + 160 >> 2];
Ya = pb ^ (g[(Ya >>> 16 & 255) + 5712 | 0] << 16 | g[(Ya >>> 24) + 5456 | 0] << 24 | g[(Ya >>> 8 & 255) + 5968 | 0] << 8 | g[(Ya & 255) + 6224 | 0]);
gb = tf(Ya, 16) ^ gb;
pb = gb ^ (ob ^ f[cb + 88 >> 2]);
Ya = tf(gb, 24) ^ Ya;
ob = pb ^ tf(Ya, 24);
f[sb >> 2] = ob;
pb = Ya ^ (hb ^ wb);
f[cb + 124 >> 2] = pb;
Ya = pb ^ f[cb + 172 >> 2];
gb = g[(Ya >>> 24) + 5712 | 0];
Ya = g[(Ya & 255) + 5456 | 0] | (g[(Ya >>> 16 & 255) + 5968 | 0] << 16 | gb << 24 | g[(Ya >>> 8 & 255) + 6224 | 0] << 8);
sb = gb | Ya << 8;
gb = ob ^ f[cb + 168 >> 2];
gb = sb ^ (g[(gb >>> 16 & 255) + 5712 | 0] << 16 | g[(gb >>> 24) + 5456 | 0] << 24 | g[(gb >>> 8 & 255) + 5968 | 0] << 8 | g[(gb & 255) + 6224 | 0]);
Ya = tf(gb, 16) ^ Ya;
gb = tf(Ya, 24) ^ gb;
hb = tf(gb, 24) ^ (Ya ^ tb);
f[ub >> 2] = hb;
Ya = gb ^ qb;
f[cb + 116 >> 2] = Ya;
if (Za >>> 0 >= 129) {
sb = Ya ^ f[cb + 100 >> 2];
gb = sb ^ f[cb + 180 >> 2];
Ya = g[(gb >>> 24) + 5712 | 0];
gb = g[(gb & 255) + 5456 | 0] | (g[(gb >>> 16 & 255) + 5968 | 0] << 16 | Ya << 24 | g[(gb >>> 8 & 255) + 6224 | 0] << 8);
tb = Ya | gb << 8;
qb = hb ^ f[cb + 96 >> 2];
Ya = qb ^ f[cb + 176 >> 2];
Ya = tb ^ (g[(Ya >>> 16 & 255) + 5712 | 0] << 16 | g[(Ya >>> 24) + 5456 | 0] << 24 | g[(Ya >>> 8 & 255) + 5968 | 0] << 8 | g[(Ya & 255) + 6224 | 0]);
gb = tf(Ya, 16) ^ gb;
hb = gb ^ (ob ^ f[cb + 104 >> 2]);
Ya = tf(gb, 24) ^ Ya;
ob = hb ^ tf(Ya, 24);
f[cb + 136 >> 2] = ob;
hb = f[cb + 184 >> 2];
Ya = Ya ^ (pb ^ f[cb + 108 >> 2]);
f[cb + 140 >> 2] = Ya;
gb = Ya ^ f[cb + 188 >> 2];
Ya = g[(gb >>> 24) + 5712 | 0];
gb = g[(gb & 255) + 5456 | 0] | (g[(gb >>> 16 & 255) + 5968 | 0] << 16 | Ya << 24 | g[(gb >>> 8 & 255) + 6224 | 0] << 8);
pb = Ya | gb << 8;
Ya = hb ^ ob;
Ya = pb ^ (g[(Ya >>> 16 & 255) + 5712 | 0] << 16 | g[(Ya >>> 24) + 5456 | 0] << 24 | g[(Ya >>> 8 & 255) + 5968 | 0] << 8 | g[(Ya & 255) + 6224 | 0]);
gb = tf(Ya, 16) ^ gb;
Ya = tf(gb, 24) ^ Ya;
f[cb + 132 >> 2] = Ya ^ sb;
xb = cb,
yb = tf(Ya, 24) ^ (gb ^ qb),
f[xb + 128 >> 2] = yb
}
ob = f[cb + 80 >> 2];
f[cb >> 2] = ob;
hb = f[cb + 84 >> 2];
f[cb + 4 >> 2] = hb;
gb = f[cb + 88 >> 2];
f[cb + 8 >> 2] = gb;
Ya = f[cb + 92 >> 2];
f[cb + 12 >> 2] = Ya;
f[cb + 28 >> 2] = Ya << 15 | ob >>> 17;
f[cb + 24 >> 2] = gb << 15 | Ya >>> 17;
f[cb + 20 >> 2] = hb << 15 | gb >>> 17;
f[cb + 16 >> 2] = ob << 15 | hb >>> 17;
if (!rb) {
f[cb + 44 >> 2] = Ya << 30 | ob >>> 2;
f[cb + 40 >> 2] = gb << 30 | Ya >>> 2;
f[cb + 36 >> 2] = hb << 30 | gb >>> 2;
f[cb + 32 >> 2] = ob << 30 | hb >>> 2
}
f[cb + 76 >> 2] = Ya << 28 | ob >>> 4;
f[cb + 72 >> 2] = gb << 28 | Ya >>> 4;
f[cb + 68 >> 2] = hb << 28 | gb >>> 4;
f[cb + 64 >> 2] = ob << 28 | hb >>> 4;
f[cb + 60 >> 2] = Ya << 13 | ob >>> 19;
f[cb + 56 >> 2] = gb << 13 | Ya >>> 19;
f[cb + 52 >> 2] = hb << 13 | gb >>> 19;
f[cb + 48 >> 2] = ob << 13 | hb >>> 19;
hb = 0;
gb = l(rb, 80);
while (1) {
Ya = d[(gb + hb | 0) + 5248 | 0];
if ((Ya | 0) != -1) {
f[((Ya << 2) + a | 0) + 4 >> 2] = f[(hb << 2) + cb >> 2]
}
hb = hb + 1 | 0;
if ((hb | 0) != 20) {
continue
}
break
}
if (Za >>> 0 >= 129) {
ob = f[cb + 96 >> 2];
f[cb >> 2] = ob;
hb = f[cb + 100 >> 2];
f[cb + 4 >> 2] = hb;
gb = f[cb + 104 >> 2];
f[cb + 8 >> 2] = gb;
Ya = f[cb + 108 >> 2];
f[cb + 12 >> 2] = Ya;
if (rb) {
f[cb + 76 >> 2] = Ya << 28 | ob >>> 4;
f[cb + 72 >> 2] = gb << 28 | Ya >>> 4;
f[cb + 68 >> 2] = hb << 28 | gb >>> 4;
f[cb + 64 >> 2] = ob << 28 | hb >>> 4;
f[cb + 44 >> 2] = Ya << 30 | ob >>> 2;
f[cb + 40 >> 2] = gb << 30 | Ya >>> 2;
f[cb + 36 >> 2] = hb << 30 | gb >>> 2;
f[cb + 32 >> 2] = ob << 30 | hb >>> 2;
f[cb + 28 >> 2] = Ya << 15 | ob >>> 17;
f[cb + 24 >> 2] = gb << 15 | Ya >>> 17;
f[cb + 20 >> 2] = hb << 15 | gb >>> 17;
f[cb + 16 >> 2] = ob << 15 | hb >>> 17
}
hb = 0;
gb = l(rb, 80);
while (1) {
Ya = d[(gb + hb | 0) + 5268 | 0];
if ((Ya | 0) != -1) {
f[((Ya << 2) + a | 0) + 4 >> 2] = f[(hb << 2) + cb >> 2]
}
hb = hb + 1 | 0;
if ((hb | 0) != 20) {
continue
}
break
}
}
ob = f[cb + 112 >> 2];
f[cb >> 2] = ob;
hb = f[cb + 116 >> 2];
f[cb + 4 >> 2] = hb;
gb = f[cb + 120 >> 2];
f[cb + 8 >> 2] = gb;
Ya = f[cb + 124 >> 2];
f[cb + 12 >> 2] = Ya;
f[cb + 60 >> 2] = Ya << 13 | ob >>> 19;
f[cb + 56 >> 2] = gb << 13 | Ya >>> 19;
f[cb + 52 >> 2] = hb << 13 | gb >>> 19;
f[cb + 48 >> 2] = ob << 13 | hb >>> 19;
f[cb + 44 >> 2] = Ya << 30 | ob >>> 2;
f[cb + 40 >> 2] = gb << 30 | Ya >>> 2;
f[cb + 36 >> 2] = hb << 30 | gb >>> 2;
f[cb + 32 >> 2] = ob << 30 | hb >>> 2;
f[cb + 28 >> 2] = Ya << 15 | ob >>> 17;
f[cb + 24 >> 2] = gb << 15 | Ya >>> 17;
f[cb + 20 >> 2] = hb << 15 | gb >>> 17;
f[cb + 16 >> 2] = ob << 15 | hb >>> 17;
if (!rb) {
f[cb + 76 >> 2] = Ya << 28 | ob >>> 4;
f[cb + 72 >> 2] = gb << 28 | Ya >>> 4;
f[cb + 68 >> 2] = hb << 28 | gb >>> 4;
f[cb + 64 >> 2] = ob << 28 | hb >>> 4
}
hb = 0;
gb = l(rb, 80);
while (1) {
Ya = d[(gb + hb | 0) + 5288 | 0];
if ((Ya | 0) != -1) {
f[((Ya << 2) + a | 0) + 4 >> 2] = f[(hb << 2) + cb >> 2]
}
hb = hb + 1 | 0;
if ((hb | 0) != 20) {
continue
}
break
}
if (Za >>> 0 >= 129) {
hb = f[cb + 128 >> 2];
f[cb >> 2] = hb;
gb = f[cb + 132 >> 2];
f[cb + 4 >> 2] = gb;
Za = f[cb + 136 >> 2];
f[cb + 8 >> 2] = Za;
Ya = f[cb + 140 >> 2];
f[cb + 12 >> 2] = Ya;
if (rb) {
f[cb + 76 >> 2] = Ya << 28 | hb >>> 4;
f[cb + 72 >> 2] = Za << 28 | Ya >>> 4;
f[cb + 68 >> 2] = gb << 28 | Za >>> 4;
f[cb + 64 >> 2] = hb << 28 | gb >>> 4;
f[cb + 44 >> 2] = Ya << 30 | hb >>> 2;
f[cb + 40 >> 2] = Za << 30 | Ya >>> 2;
f[cb + 36 >> 2] = gb << 30 | Za >>> 2;
f[cb + 32 >> 2] = hb << 30 | gb >>> 2;
f[cb + 28 >> 2] = Ya << 15 | hb >>> 17;
f[cb + 24 >> 2] = Za << 15 | Ya >>> 17;
f[cb + 20 >> 2] = gb << 15 | Za >>> 17;
f[cb + 16 >> 2] = hb << 15 | gb >>> 17
}
hb = 0;
Za = l(rb, 80);
while (1) {
Ya = d[(Za + hb | 0) + 5308 | 0];
if ((Ya | 0) != -1) {
f[((Ya << 2) + a | 0) + 4 >> 2] = f[(hb << 2) + cb >> 2]
}
hb = hb + 1 | 0;
if ((hb | 0) != 20) {
continue
}
break
}
}
Za = l(rb, 12) | 32;
hb = 0;
Ya = l(rb, 20);
gb = a + 4 | 0;
while (1) {
a = d[(Ya + hb | 0) + 5408 | 0];
if ((a | 0) != -1) {
f[gb + (Za + hb << 2) >> 2] = f[gb + (a << 2) >> 2]
}
hb = hb + 1 | 0;
if ((hb | 0) != 20) {
continue
}
break
}
gb = 0
}
U = cb + 256 | 0;
return gb
}
function Aa(a, g, Ya) {
var Za = 0
, zb = 0
, Ab = 0
, Bb = 0
, Cb = 0;
Za = U - 288 | 0;
U = Za;
Ab = 276;
Ve(Za + 8 | 0, 276);
Cb = za(Za + 8 | 0, g, Ya);
if (!Cb) {
g = f[Za + 8 >> 2];
f[a >> 2] = g;
Ya = (g | 0) == 4;
zb = (Za + 8 | 0) + (Ya << 6) | 0;
g = zb | 4;
f[a + 4 >> 2] = f[g + 192 >> 2];
f[a + 8 >> 2] = f[g + 196 >> 2];
f[a + 12 >> 2] = f[zb + 204 >> 2];
f[a + 16 >> 2] = f[g + 204 >> 2];
zb = a + 20 | 0;
Bb = Ya << 3 | 22;
Ya = g + 184 | 0;
while (1) {
a = zb;
g = Ya;
f[a >> 2] = f[g >> 2];
f[a + 4 >> 2] = f[g + 4 >> 2];
Ya = g + -8 | 0;
zb = a + 8 | 0;
Bb = Bb + -1 | 0;
if (Bb) {
continue
}
break
}
f[a + 8 >> 2] = f[g + -16 >> 2];
f[a + 12 >> 2] = f[g + -12 >> 2];
f[a + 16 >> 2] = f[Ya >> 2];
f[a + 20 >> 2] = f[g + -4 >> 2]
}
a = Za + 8 | 0;
while (1) {
d[a | 0] = 0;
a = a + 1 | 0;
Ab = Ab + -1 | 0;
if (Ab) {
continue
}
break
}
U = Za + 288 | 0;
return Cb
}
function Ba(a, U, Ya) {
var Db = 0
, Eb = 0
, Fb = 0
, Gb = 0
, Hb = 0
, Ib = 0
, Jb = 0
, Kb = 0
, Lb = 0
, Mb = 0;
Db = g[U + 12 | 0] | g[U + 13 | 0] << 8 | (g[U + 14 | 0] << 16 | g[U + 15 | 0] << 24);
Fb = f[a + 16 >> 2] ^ (Db << 24 | Db << 8 & 16711680 | (Db >>> 8 & 65280 | Db >>> 24));
Db = g[U + 8 | 0] | g[U + 9 | 0] << 8 | (g[U + 10 | 0] << 16 | g[U + 11 | 0] << 24);
Jb = f[a + 12 >> 2] ^ (Db << 24 | Db << 8 & 16711680 | (Db >>> 8 & 65280 | Db >>> 24));
Db = g[U + 4 | 0] | g[U + 5 | 0] << 8 | (g[U + 6 | 0] << 16 | g[U + 7 | 0] << 24);
Gb = f[a + 8 >> 2] ^ (Db << 24 | Db << 8 & 16711680 | (Db >>> 8 & 65280 | Db >>> 24));
U = g[U | 0] | g[U + 1 | 0] << 8 | (g[U + 2 | 0] << 16 | g[U + 3 | 0] << 24);
Db = f[a + 4 >> 2] ^ (U << 24 | U << 8 & 16711680 | (U >>> 8 & 65280 | U >>> 24));
U = a + 20 | 0;
Lb = f[a >> 2];
if (Lb) {
while (1) {
a = f[U + 4 >> 2] ^ Gb;
Eb = g[(a >>> 24) + 5712 | 0];
Mb = Fb;
Fb = g[(a & 255) + 5456 | 0] | (g[(a >>> 16 & 255) + 5968 | 0] << 16 | Eb << 24 | g[(a >>> 8 & 255) + 6224 | 0] << 8);
a = f[U >> 2] ^ Db;
a = (Eb | Fb << 8) ^ (g[(a >>> 16 & 255) + 5712 | 0] << 16 | g[(a >>> 24) + 5456 | 0] << 24 | g[(a >>> 8 & 255) + 5968 | 0] << 8 | g[(a & 255) + 6224 | 0]);
Ib = tf(a, 16) ^ Fb;
Kb = tf(Ib, 24) ^ a;
Fb = Mb ^ Kb;
a = Fb ^ f[U + 12 >> 2];
Eb = g[(a >>> 24) + 5712 | 0];
Hb = g[(a & 255) + 5456 | 0] | (g[(a >>> 16 & 255) + 5968 | 0] << 16 | Eb << 24 | g[(a >>> 8 & 255) + 6224 | 0] << 8);
Jb = tf(Kb, 24) ^ (Jb ^ Ib);
a = Jb ^ f[U + 8 >> 2];
a = (Eb | Hb << 8) ^ (g[(a >>> 16 & 255) + 5712 | 0] << 16 | g[(a >>> 24) + 5456 | 0] << 24 | g[(a >>> 8 & 255) + 5968 | 0] << 8 | g[(a & 255) + 6224 | 0]);
Ib = tf(a, 16) ^ Hb;
Kb = tf(Ib, 24) ^ a;
Gb = Kb ^ Gb;
a = Gb ^ f[U + 20 >> 2];
Eb = g[(a >>> 24) + 5712 | 0];
Hb = g[(a & 255) + 5456 | 0] | (g[(a >>> 16 & 255) + 5968 | 0] << 16 | Eb << 24 | g[(a >>> 8 & 255) + 6224 | 0] << 8);
Db = tf(Kb, 24) ^ (Db ^ Ib);
a = Db ^ f[U + 16 >> 2];
a = (Eb | Hb << 8) ^ (g[(a >>> 16 & 255) + 5712 | 0] << 16 | g[(a >>> 24) + 5456 | 0] << 24 | g[(a >>> 8 & 255) + 5968 | 0] << 8 | g[(a & 255) + 6224 | 0]);
Ib = tf(a, 16) ^ Hb;
Kb = tf(Ib, 24) ^ a;
Fb = Kb ^ Fb;
a = Fb ^ f[U + 28 >> 2];
Eb = g[(a >>> 24) + 5712 | 0];
Hb = g[(a & 255) + 5456 | 0] | (g[(a >>> 16 & 255) + 5968 | 0] << 16 | Eb << 24 | g[(a >>> 8 & 255) + 6224 | 0] << 8);
Jb = tf(Kb, 24) ^ (Jb ^ Ib);
a = Jb ^ f[U + 24 >> 2];
a = (Eb | Hb << 8) ^ (g[(a >>> 16 & 255) + 5712 | 0] << 16 | g[(a >>> 24) + 5456 | 0] << 24 | g[(a >>> 8 & 255) + 5968 | 0] << 8 | g[(a & 255) + 6224 | 0]);
Ib = tf(a, 16) ^ Hb;
Kb = tf(Ib, 24) ^ a;
Gb = Kb ^ Gb;
a = Gb ^ f[U + 36 >> 2];
Eb = g[(a >>> 24) + 5712 | 0];
Hb = g[(a & 255) + 5456 | 0] | (g[(a >>> 16 & 255) + 5968 | 0] << 16 | Eb << 24 | g[(a >>> 8 & 255) + 6224 | 0] << 8);
Db = tf(Kb, 24) ^ (Db ^ Ib);
a = Db ^ f[U + 32 >> 2];
a = (Eb | Hb << 8) ^ (g[(a >>> 16 & 255) + 5712 | 0] << 16 | g[(a >>> 24) + 5456 | 0] << 24 | g[(a >>> 8 & 255) + 5968 | 0] << 8 | g[(a & 255) + 6224 | 0]);
Hb = tf(a, 16) ^ Hb;
Ib = tf(Hb, 24) ^ a;
Fb = Ib ^ Fb;
a = Fb ^ f[U + 44 >> 2];
Eb = g[(a >>> 24) + 5712 | 0];
Mb = Gb;
Gb = g[(a & 255) + 5456 | 0] | (g[(a >>> 16 & 255) + 5968 | 0] << 16 | Eb << 24 | g[(a >>> 8 & 255) + 6224 | 0] << 8);
Jb = tf(Ib, 24) ^ (Hb ^ Jb);
a = Jb ^ f[U + 40 >> 2];
a = (Eb | Gb << 8) ^ (g[(a >>> 16 & 255) + 5712 | 0] << 16 | g[(a >>> 24) + 5456 | 0] << 24 | g[(a >>> 8 & 255) + 5968 | 0] << 8 | g[(a & 255) + 6224 | 0]);
Eb = tf(a, 16) ^ Gb;
a = tf(Eb, 24) ^ a;
Gb = Mb ^ a;
Db = tf(a, 24) ^ (Db ^ Eb);
Lb = Lb + -1 | 0;
if (Lb) {
Jb = (f[U + 60 >> 2] | Fb) ^ Jb;
Fb = tf(Jb & f[U + 56 >> 2], 1) ^ Fb;
Gb = tf(f[U + 48 >> 2] & Db, 1) ^ Gb;
Db = (Gb | f[U + 52 >> 2]) ^ Db;
U = U - -64 | 0;
continue
} else {
U = U + 48 | 0
}
break
}
}
Lb = f[U >> 2];
Eb = f[U + 4 >> 2];
Hb = f[U + 8 >> 2];
a = f[U + 12 >> 2] ^ Gb;
d[Ya + 15 | 0] = a;
U = Db ^ Hb;
d[Ya + 11 | 0] = U;
Db = Eb ^ Fb;
d[Ya + 7 | 0] = Db;
Fb = Jb ^ Lb;
d[Ya + 3 | 0] = Fb;
d[Ya + 14 | 0] = a >>> 8;
d[Ya + 13 | 0] = a >>> 16;
d[Ya + 12 | 0] = a >>> 24;
d[Ya + 10 | 0] = U >>> 8;
d[Ya + 9 | 0] = U >>> 16;
d[Ya + 8 | 0] = U >>> 24;
d[Ya + 6 | 0] = Db >>> 8;
d[Ya + 5 | 0] = Db >>> 16;
d[Ya + 4 | 0] = Db >>> 24;
d[Ya + 2 | 0] = Fb >>> 8;
d[Ya + 1 | 0] = Fb >>> 16;
d[Ya | 0] = Fb >>> 24;
return 0
}
function Ca(a, Ya, Nb, Ob, Pb, Qb) {
var Rb = 0
, Sb = 0
, Tb = 0;
Sb = U - 16 | 0;
U = Sb;
Tb = -38;
a: {
if (Nb & 15) {
break a
}
if (Ya) {
Tb = 0;
if (!Nb) {
break a
}
while (1) {
d[Qb | 0] = g[Ob | 0] ^ g[Pb | 0];
d[Qb + 1 | 0] = g[Ob + 1 | 0] ^ g[Pb + 1 | 0];
d[Qb + 2 | 0] = g[Ob + 2 | 0] ^ g[Pb + 2 | 0];
d[Qb + 3 | 0] = g[Ob + 3 | 0] ^ g[Pb + 3 | 0];
d[Qb + 4 | 0] = g[Ob + 4 | 0] ^ g[Pb + 4 | 0];
d[Qb + 5 | 0] = g[Ob + 5 | 0] ^ g[Pb + 5 | 0];
d[Qb + 6 | 0] = g[Ob + 6 | 0] ^ g[Pb + 6 | 0];
d[Qb + 7 | 0] = g[Ob + 7 | 0] ^ g[Pb + 7 | 0];
d[Qb + 8 | 0] = g[Ob + 8 | 0] ^ g[Pb + 8 | 0];
d[Qb + 9 | 0] = g[Ob + 9 | 0] ^ g[Pb + 9 | 0];
d[Qb + 10 | 0] = g[Ob + 10 | 0] ^ g[Pb + 10 | 0];
d[Qb + 11 | 0] = g[Ob + 11 | 0] ^ g[Pb + 11 | 0];
d[Qb + 12 | 0] = g[Ob + 12 | 0] ^ g[Pb + 12 | 0];
d[Qb + 13 | 0] = g[Ob + 13 | 0] ^ g[Pb + 13 | 0];
d[Qb + 14 | 0] = g[Ob + 14 | 0] ^ g[Pb + 14 | 0];
d[Qb + 15 | 0] = g[Ob + 15 | 0] ^ g[Pb + 15 | 0];
Ba(a, Qb, Qb);
Ya = g[Qb + 12 | 0] | g[Qb + 13 | 0] << 8 | (g[Qb + 14 | 0] << 16 | g[Qb + 15 | 0] << 24);
Rb = g[Qb + 8 | 0] | g[Qb + 9 | 0] << 8 | (g[Qb + 10 | 0] << 16 | g[Qb + 11 | 0] << 24);
d[Ob + 8 | 0] = Rb;
d[Ob + 9 | 0] = Rb >>> 8;
d[Ob + 10 | 0] = Rb >>> 16;
d[Ob + 11 | 0] = Rb >>> 24;
d[Ob + 12 | 0] = Ya;
d[Ob + 13 | 0] = Ya >>> 8;
d[Ob + 14 | 0] = Ya >>> 16;
d[Ob + 15 | 0] = Ya >>> 24;
Ya = g[Qb + 4 | 0] | g[Qb + 5 | 0] << 8 | (g[Qb + 6 | 0] << 16 | g[Qb + 7 | 0] << 24);
Rb = g[Qb | 0] | g[Qb + 1 | 0] << 8 | (g[Qb + 2 | 0] << 16 | g[Qb + 3 | 0] << 24);
d[Ob | 0] = Rb;
d[Ob + 1 | 0] = Rb >>> 8;
d[Ob + 2 | 0] = Rb >>> 16;
d[Ob + 3 | 0] = Rb >>> 24;
d[Ob + 4 | 0] = Ya;
d[Ob + 5 | 0] = Ya >>> 8;
d[Ob + 6 | 0] = Ya >>> 16;
d[Ob + 7 | 0] = Ya >>> 24;
Qb = Qb + 16 | 0;
Pb = Pb + 16 | 0;
Nb = Nb + -16 | 0;
if (Nb) {
continue
}
break
}
break a
}
Tb = 0;
if (!Nb) {
break a
}
while (1) {
Ya = g[Pb + 4 | 0] | g[Pb + 5 | 0] << 8 | (g[Pb + 6 | 0] << 16 | g[Pb + 7 | 0] << 24);
f[Sb >> 2] = g[Pb | 0] | g[Pb + 1 | 0] << 8 | (g[Pb + 2 | 0] << 16 | g[Pb + 3 | 0] << 24);
f[Sb + 4 >> 2] = Ya;
Ya = g[Pb + 12 | 0] | g[Pb + 13 | 0] << 8 | (g[Pb + 14 | 0] << 16 | g[Pb + 15 | 0] << 24);
f[Sb + 8 >> 2] = g[Pb + 8 | 0] | g[Pb + 9 | 0] << 8 | (g[Pb + 10 | 0] << 16 | g[Pb + 11 | 0] << 24);
f[Sb + 12 >> 2] = Ya;
Ba(a, Pb, Qb);
d[Qb | 0] = g[Ob | 0] ^ g[Qb | 0];
d[Qb + 1 | 0] = g[Ob + 1 | 0] ^ g[Qb + 1 | 0];
d[Qb + 2 | 0] = g[Ob + 2 | 0] ^ g[Qb + 2 | 0];
d[Qb + 3 | 0] = g[Ob + 3 | 0] ^ g[Qb + 3 | 0];
d[Qb + 4 | 0] = g[Ob + 4 | 0] ^ g[Qb + 4 | 0];
d[Qb + 5 | 0] = g[Ob + 5 | 0] ^ g[Qb + 5 | 0];
d[Qb + 6 | 0] = g[Ob + 6 | 0] ^ g[Qb + 6 | 0];
d[Qb + 7 | 0] = g[Ob + 7 | 0] ^ g[Qb + 7 | 0];
d[Qb + 8 | 0] = g[Ob + 8 | 0] ^ g[Qb + 8 | 0];
d[Qb + 9 | 0] = g[Ob + 9 | 0] ^ g[Qb + 9 | 0];
d[Qb + 10 | 0] = g[Ob + 10 | 0] ^ g[Qb + 10 | 0];
d[Qb + 11 | 0] = g[Ob + 11 | 0] ^ g[Qb + 11 | 0];
d[Qb + 12 | 0] = g[Ob + 12 | 0] ^ g[Qb + 12 | 0];
d[Qb + 13 | 0] = g[Ob + 13 | 0] ^ g[Qb + 13 | 0];
d[Qb + 14 | 0] = g[Ob + 14 | 0] ^ g[Qb + 14 | 0];
d[Qb + 15 | 0] = g[Ob + 15 | 0] ^ g[Qb + 15 | 0];
Ya = f[Sb + 12 >> 2];
Rb = f[Sb + 8 >> 2];
d[Ob + 8 | 0] = Rb;
d[Ob + 9 | 0] = Rb >>> 8;
d[Ob + 10 | 0] = Rb >>> 16;
d[Ob + 11 | 0] = Rb >>> 24;
d[Ob + 12 | 0] = Ya;
d[Ob + 13 | 0] = Ya >>> 8;
d[Ob + 14 | 0] = Ya >>> 16;
d[Ob + 15 | 0] = Ya >>> 24;
Ya = f[Sb + 4 >> 2];
Rb = f[Sb >> 2];
d[Ob | 0] = Rb;
d[Ob + 1 | 0] = Rb >>> 8;
d[Ob + 2 | 0] = Rb >>> 16;
d[Ob + 3 | 0] = Rb >>> 24;
d[Ob + 4 | 0] = Ya;
d[Ob + 5 | 0] = Ya >>> 8;
d[Ob + 6 | 0] = Ya >>> 16;
d[Ob + 7 | 0] = Ya >>> 24;
Qb = Qb + 16 | 0;
Pb = Pb + 16 | 0;
Nb = Nb + -16 | 0;
if (Nb) {
continue
}
break
}
}
U = Sb + 16 | 0;
return Tb
}
function Da(a, U, Ya, Nb, Ob, Pb, Qb) {
var Ub = 0
, Vb = 0;
Ub = Ya + -1 | 0;
Vb = f[Nb >> 2];
a: {
if (U) {
if (!Ya) {
break a
}
while (1) {
U = Ub;
if (!Vb) {
Ba(a, Ob, Ob)
}
Ya = Ob + Vb | 0;
Ub = g[Pb | 0] ^ g[Ya | 0];
d[Qb | 0] = Ub;
d[Ya | 0] = Ub;
Ub = U + -1 | 0;
Qb = Qb + 1 | 0;
Pb = Pb + 1 | 0;
Vb = Vb + 1 & 15;
if (U) {
continue
}
break
}
break a
}
if (!Ya) {
break a
}
while (1) {
U = Ub;
if (!Vb) {
Ba(a, Ob, Ob)
}
Ub = g[Pb | 0];
Ya = Ob + Vb | 0;
d[Qb | 0] = Ub ^ g[Ya | 0];
d[Ya | 0] = Ub;
Ub = U + -1 | 0;
Qb = Qb + 1 | 0;
Pb = Pb + 1 | 0;
Vb = Vb + 1 & 15;
if (U) {
continue
}
break
}
}
f[Nb >> 2] = Vb;
return 0
}
function Ea(a, U, Ya, Nb, Ob, Pb, Qb) {
var Wb = 0
, Xb = 0
, Yb = 0
, Zb = 0;
Wb = f[Ya >> 2];
if (U) {
while (1) {
U = U + -1 | 0;
a: {
if (Wb) {
break a
}
Ba(a, Nb, Ob);
Xb = 16;
while (1) {
if (!Xb) {
break a
}
Xb = Xb + -1 | 0;
Zb = Xb + Nb | 0;
Yb = g[Zb | 0] + 1 | 0;
d[Zb | 0] = Yb;
if ((Yb | 0) != (Yb & 255)) {
continue
}
break
}
}
d[Qb | 0] = g[Ob + Wb | 0] ^ g[Pb | 0];
Qb = Qb + 1 | 0;
Pb = Pb + 1 | 0;
Wb = Wb + 1 & 15;
if (U) {
continue
}
break
}
}
f[Ya >> 2] = Wb;
return 0
}
function Fa(a) {
f[a >> 2] = 0;
f[a + 4 >> 2] = 0;
f[a + 56 >> 2] = 0;
f[a + 60 >> 2] = 0;
f[a + 48 >> 2] = 0;
f[a + 52 >> 2] = 0;
f[a + 40 >> 2] = 0;
f[a + 44 >> 2] = 0;
f[a + 32 >> 2] = 0;
f[a + 36 >> 2] = 0;
f[a + 24 >> 2] = 0;
f[a + 28 >> 2] = 0;
f[a + 16 >> 2] = 0;
f[a + 20 >> 2] = 0;
f[a + 8 >> 2] = 0;
f[a + 12 >> 2] = 0
}
function Ga(a, d, g, U) {
var Ya = 0;
Ya = -13;
d = Ja(d, U);
a: {
if (!d | f[d + 24 >> 2] != 16) {
break a
}
Ka(a);
Ya = La(a, d);
if (Ya) {
break a
}
Ya = Wa(a, g, U)
}
return Ya
}
function Ha(a) {
Ka(a);
d[a | 0] = 0;
d[a + 1 | 0] = 0;
d[a + 2 | 0] = 0;
d[a + 3 | 0] = 0;
d[a + 4 | 0] = 0;
d[a + 5 | 0] = 0;
d[a + 6 | 0] = 0;
d[a + 7 | 0] = 0;
d[a + 8 | 0] = 0;
d[a + 9 | 0] = 0;
d[a + 10 | 0] = 0;
d[a + 11 | 0] = 0;
d[a + 12 | 0] = 0;
d[a + 13 | 0] = 0;
d[a + 14 | 0] = 0;
d[a + 15 | 0] = 0;
d[a + 16 | 0] = 0;
d[a + 17 | 0] = 0;
d[a + 18 | 0] = 0;
d[a + 19 | 0] = 0;
d[a + 20 | 0] = 0;
d[a + 21 | 0] = 0;
d[a + 22 | 0] = 0;
d[a + 23 | 0] = 0;
d[a + 24 | 0] = 0;
d[a + 25 | 0] = 0;
d[a + 26 | 0] = 0;
d[a + 27 | 0] = 0;
d[a + 28 | 0] = 0;
d[a + 29 | 0] = 0;
d[a + 30 | 0] = 0;
d[a + 31 | 0] = 0;
d[a + 32 | 0] = 0;
d[a + 33 | 0] = 0;
d[a + 34 | 0] = 0;
d[a + 35 | 0] = 0;
d[a + 36 | 0] = 0;
d[a + 37 | 0] = 0;
d[a + 38 | 0] = 0;
d[a + 39 | 0] = 0;
d[a + 40 | 0] = 0;
d[a + 41 | 0] = 0;
d[a + 42 | 0] = 0;
d[a + 43 | 0] = 0;
d[a + 44 | 0] = 0;
d[a + 45 | 0] = 0;
d[a + 46 | 0] = 0;
d[a + 47 | 0] = 0;
d[a + 48 | 0] = 0;
d[a + 49 | 0] = 0;
d[a + 50 | 0] = 0;
d[a + 51 | 0] = 0;
d[a + 52 | 0] = 0;
d[a + 53 | 0] = 0;
d[a + 54 | 0] = 0;
d[a + 55 | 0] = 0;
d[a + 56 | 0] = 0;
d[a + 57 | 0] = 0;
d[a + 58 | 0] = 0;
d[a + 59 | 0] = 0;
d[a + 60 | 0] = 0;
d[a + 61 | 0] = 0;
d[a + 62 | 0] = 0;
d[a + 63 | 0] = 0
}
function Ia(a) {
var d = 0
, g = 0;
d = f[1997];
a: {
if (!d) {
break a
}
g = d;
if (f[1996] == (a | 0)) {
break a
}
d = 7984;
while (1) {
g = f[d + 12 >> 2];
if (!g) {
return 0
}
d = d + 8 | 0;
if (f[d >> 2] != (a | 0)) {
continue
}
break
}
}
return g
}
function Ja(a, U) {
var Nb = 0
, Ob = 0
, Pb = 0;
Nb = f[1997];
a: {
if (Nb) {
Ob = 7984;
while (1) {
Pb = Ob;
if (f[Nb + 4 >> 2] == 1 ? !(f[f[Nb + 28 >> 2] >> 2] != (a | 0) | f[Nb + 8 >> 2] != (U | 0)) : 0) {
break a
}
Ob = Pb + 8 | 0;
Nb = f[Pb + 12 >> 2];
if (Nb) {
continue
}
break
}
}
Nb = 0
}
return Nb
}
function Ka(a) {
var U = 0;
if (a) {
U = f[a + 60 >> 2];
if (U) {
c[f[f[f[a >> 2] + 28 >> 2] + 36 >> 2]](U)
}
d[a | 0] = 0;
d[a + 1 | 0] = 0;
d[a + 2 | 0] = 0;
d[a + 3 | 0] = 0;
d[a + 4 | 0] = 0;
d[a + 5 | 0] = 0;
d[a + 6 | 0] = 0;
d[a + 7 | 0] = 0;
d[a + 8 | 0] = 0;
d[a + 9 | 0] = 0;
d[a + 10 | 0] = 0;
d[a + 11 | 0] = 0;
d[a + 12 | 0] = 0;
d[a + 13 | 0] = 0;
d[a + 14 | 0] = 0;
d[a + 15 | 0] = 0;
d[a + 16 | 0] = 0;
d[a + 17 | 0] = 0;
d[a + 18 | 0] = 0;
d[a + 19 | 0] = 0;
d[a + 20 | 0] = 0;
d[a + 21 | 0] = 0;
d[a + 22 | 0] = 0;
d[a + 23 | 0] = 0;
d[a + 24 | 0] = 0;
d[a + 25 | 0] = 0;
d[a + 26 | 0] = 0;
d[a + 27 | 0] = 0;
d[a + 28 | 0] = 0;
d[a + 29 | 0] = 0;
d[a + 30 | 0] = 0;
d[a + 31 | 0] = 0;
d[a + 32 | 0] = 0;
d[a + 33 | 0] = 0;
d[a + 34 | 0] = 0;
d[a + 35 | 0] = 0;
d[a + 36 | 0] = 0;
d[a + 37 | 0] = 0;
d[a + 38 | 0] = 0;
d[a + 39 | 0] = 0;
d[a + 40 | 0] = 0;
d[a + 41 | 0] = 0;
d[a + 42 | 0] = 0;
d[a + 43 | 0] = 0;
d[a + 44 | 0] = 0;
d[a + 45 | 0] = 0;
d[a + 46 | 0] = 0;
d[a + 47 | 0] = 0;
d[a + 48 | 0] = 0;
d[a + 49 | 0] = 0;
d[a + 50 | 0] = 0;
d[a + 51 | 0] = 0;
d[a + 52 | 0] = 0;
d[a + 53 | 0] = 0;
d[a + 54 | 0] = 0;
d[a + 55 | 0] = 0;
d[a + 56 | 0] = 0;
d[a + 57 | 0] = 0;
d[a + 58 | 0] = 0;
d[a + 59 | 0] = 0;
d[a + 60 | 0] = 0;
d[a + 61 | 0] = 0;
d[a + 62 | 0] = 0;
d[a + 63 | 0] = 0
}
}
function La(a, Qb) {
var _b = 0;
_b = -24832;
a: {
if (!a | !Qb) {
break a
}
_b = a;
f[_b >> 2] = 0;
f[_b + 4 >> 2] = 0;
f[_b + 56 >> 2] = 0;
f[_b + 60 >> 2] = 0;
f[_b + 48 >> 2] = 0;
f[_b + 52 >> 2] = 0;
f[_b + 40 >> 2] = 0;
f[_b + 44 >> 2] = 0;
f[_b + 32 >> 2] = 0;
f[_b + 36 >> 2] = 0;
f[_b + 24 >> 2] = 0;
f[_b + 28 >> 2] = 0;
f[_b + 16 >> 2] = 0;
f[_b + 20 >> 2] = 0;
f[_b + 8 >> 2] = 0;
f[_b + 12 >> 2] = 0;
_b = c[f[f[Qb + 28 >> 2] + 32 >> 2]]() | 0;
f[a + 60 >> 2] = _b;
if (!_b) {
return -24960
}
f[a >> 2] = Qb;
_b = 0;
if (f[Qb + 4 >> 2] != 2) {
break a
}
f[a + 16 >> 2] = 1;
f[a + 12 >> 2] = 2
}
return _b
}
function Ma(a, Qb, $b) {
a = a | 0;
Qb = Qb | 0;
$b = $b | 0;
var ac = 0
, bc = 0
, cc = 0;
ac = -24832;
if (!(!a | !$b)) {
bc = g[(a + Qb | 0) + -1 | 0];
cc = Qb - bc | 0;
f[$b >> 2] = cc;
$b = !bc | Qb >>> 0 < bc >>> 0;
if (Qb) {
ac = 0;
while (1) {
$b = (ac >>> 0 < cc >>> 0 ? 0 : g[a + ac | 0] ^ bc) | $b;
ac = ac + 1 | 0;
if ((ac | 0) != (Qb | 0)) {
continue
}
break
}
}
ac = $b & 255 ? -25088 : 0
}
return ac | 0
}
function Na(a, Qb, $b) {
a = a | 0;
Qb = Qb | 0;
$b = $b | 0;
var dc = 0
, ec = 0;
Qb = Qb - $b | 0;
if (Qb) {
while (1) {
d[($b + dc | 0) + a | 0] = Qb;
ec = ec + 1 | 0;
dc = ec & 255;
if (Qb >>> 0 > dc >>> 0) {
continue
}
break
}
}
}
function Oa(a, Qb) {
if (!(!a | f[f[a >> 2] + 4 >> 2] != 2)) {
if (Qb >>> 0 > 4) {
return
}
a: {
switch (Qb - 1 | 0) {
default:
f[a + 16 >> 2] = 1;
f[a + 12 >> 2] = 2;
return;
case 0:
f[a + 16 >> 2] = 3;
f[a + 12 >> 2] = 4;
return;
case 1:
f[a + 16 >> 2] = 5;
f[a + 12 >> 2] = 6;
return;
case 2:
f[a + 16 >> 2] = 7;
f[a + 12 >> 2] = 8;
return;
case 3:
break a
}
}
f[a + 16 >> 2] = 9;
f[a + 12 >> 2] = 0
}
}
function Pa(a, Qb, $b) {
a = a | 0;
Qb = Qb | 0;
$b = $b | 0;
var fc = 0
, gc = 0
, hc = 0
, ic = 0
, jc = 0;
fc = -24832;
if (!(!a | !$b)) {
f[$b >> 2] = 0;
if (!Qb) {
return -25088
}
hc = 128;
fc = 0;
while (1) {
gc = fc;
Qb = Qb + -1 | 0;
ic = Qb + a | 0;
fc = g[ic | 0] != 0 | fc;
gc = (gc | 0) != (fc | 0);
jc = (gc ? Qb : 0) | jc;
f[$b >> 2] = jc;
hc = (gc ? g[ic | 0] : 0) ^ hc;
if (Qb) {
continue
}
break
}
fc = hc ? -25088 : 0
}
return fc | 0
}
function Qa(a, Qb, $b) {
a = a | 0;
Qb = Qb | 0;
$b = $b | 0;
var kc = 0
, lc = 0;
d[a + $b | 0] = 128;
lc = Qb - $b | 0;
if (lc >>> 0 >= 2) {
Qb = 1;
kc = 1;
while (1) {
d[(Qb + $b | 0) + a | 0] = 0;
kc = kc + 1 | 0;
Qb = kc & 255;
if (lc >>> 0 > Qb >>> 0) {
continue
}
break
}
}
}
function Ra(a, Qb, $b) {
a = a | 0;
Qb = Qb | 0;
$b = $b | 0;
var mc = 0
, nc = 0
, oc = 0;
mc = -24832;
if (!(!a | !$b)) {
oc = $b;
$b = Qb + -1 | 0;
mc = g[$b + a | 0];
nc = Qb - mc | 0;
f[oc >> 2] = nc;
Qb = !mc | Qb >>> 0 < mc >>> 0;
if ($b) {
mc = 0;
while (1) {
Qb = (mc >>> 0 < nc >>> 0 ? 0 : g[a + mc | 0]) | Qb;
mc = mc + 1 | 0;
if (($b | 0) != (mc | 0)) {
continue
}
break
}
}
mc = Qb & 255 ? -25088 : 0
}
return mc | 0
}
function Sa(a, Qb, $b) {
a = a | 0;
Qb = Qb | 0;
$b = $b | 0;
var pc = 0
, qc = 0
, rc = 0;
pc = Qb - $b | 0;
if (pc >>> 0 >= 2) {
rc = $b + -1 | 0;
$b = 1;
qc = 1;
while (1) {
d[($b + rc | 0) + a | 0] = 0;
qc = qc + 1 | 0;
$b = qc & 255;
if (pc >>> 0 > $b >>> 0) {
continue
}
break
}
}
d[(a + Qb | 0) + -1 | 0] = pc
}
function Ta(a, Qb, $b) {
a = a | 0;
Qb = Qb | 0;
$b = $b | 0;
var sc = 0
, tc = 0
, uc = 0
, vc = 0
, wc = 0;
tc = -24832;
if (!(!a | !$b)) {
f[$b >> 2] = 0;
if (!Qb) {
return 0
}
while (1) {
tc = 0;
vc = Qb;
wc = sc;
Qb = Qb + -1 | 0;
sc = g[Qb + a | 0] != 0 | sc;
uc = ((wc | 0) == (sc | 0) ? 0 : vc) | uc;
f[$b >> 2] = uc;
if (Qb) {
continue
}
break
}
}
return tc | 0
}
function Ua(a, Qb, $b) {
a = a | 0;
Qb = Qb | 0;
$b = $b | 0;
if (Qb >>> 0 > $b >>> 0) {
Ve(a + $b | 0, Qb - $b | 0)
}
}
function Va(a, Qb, $b) {
a = a | 0;
Qb = Qb | 0;
$b = $b | 0;
var xc = 0;
xc = -24832;
if (!(!a | !$b)) {
f[$b >> 2] = Qb;
xc = 0
}
return xc | 0
}
function Wa(a, Qb, $b) {
var yc = 0;
a: {
if (!a) {
break a
}
yc = f[a >> 2];
if (!yc | (f[yc + 8 >> 2] != ($b | 0) ? !(g[yc + 20 | 0] & 2) : 0)) {
break a
}
f[a + 8 >> 2] = 1;
f[a + 4 >> 2] = $b;
return c[f[f[yc + 28 >> 2] + 24 >> 2]](f[a + 60 >> 2], Qb, $b) | 0
}
return -24832
}
function Xa(a, Qb, $b) {
var zc = 0;
a: {
if (!a) {
break a
}
zc = f[a >> 2];
if (!zc | ($b ? !Qb : 0)) {
break a
}
b: {
if (!(Qb | $b)) {
f[a + 56 >> 2] = 0;
break b
}
if ($b >>> 0 > 16) {
break a
}
}
c: {
if (d[zc + 20 | 0] & 1) {
zc = $b;
break c
}
zc = f[zc + 16 >> 2];
if (zc >>> 0 > $b >>> 0) {
break a
}
}
if (!zc) {
break a
}
Ue(a + 40 | 0, Qb, zc);
f[a + 56 >> 2] = zc
}
}
function Ya(a, Qb, $b, Ac, Bc) {
var Cc = 0
, Dc = 0
, Ec = 0
, Fc = 0
, Gc = 0;
Cc = -24832;
a: {
if (!a | !Bc) {
break a
}
Dc = f[a >> 2];
if (!Dc) {
break a
}
f[Bc >> 2] = 0;
Ec = f[Dc + 24 >> 2];
b: {
Fc = f[Dc + 4 >> 2];
Gc = Fc + -1 | 0;
if (Gc >>> 0 > 5) {
break b
}
c: {
switch (Gc - 1 | 0) {
default:
Cc = -25216;
if (($b | 0) != (Ec | 0)) {
break a
}
f[Bc >> 2] = $b;
return c[f[f[Dc + 28 >> 2] + 4 >> 2]](f[a + 60 >> 2], f[a + 8 >> 2], Qb, Ac) | 0;
case 0:
case 1:
case 2:
case 3:
break b;
case 4:
break c
}
}
f[Bc >> 2] = $b;
return kc(f[a + 60 >> 2], $b, Qb, Ac)
}
if (!Ec) {
return -25472
}
if (f[a + 36 >> 2] | ($b >>> 0) % (Ec >>> 0) ? (Qb | 0) == (Ac | 0) : 0) {
break a
}
Cc = -24704;
Fc = Fc + -2 | 0;
if (Fc >>> 0 > 5) {
break a
}
d: {
e: {
f: {
g: {
switch (Fc - 1 | 0) {
default:
Cc = f[a + 8 >> 2];
h: {
if (Cc >>> 0 > 1) {
break h
}
i: {
if (Cc - 1) {
Cc = f[a + 36 >> 2];
Dc = Ec - Cc | 0;
if (!f[a + 12 >> 2]) {
break i
}
if (Dc >>> 0 >= $b >>> 0) {
break e
}
break h
}
Cc = f[a + 36 >> 2];
if (Ec - Cc >>> 0 <= $b >>> 0) {
break h
}
break e
}
if (Dc >>> 0 > $b >>> 0) {
break e
}
}
Cc = f[a + 36 >> 2];
if (Cc) {
Fc = a + 20 | 0;
Dc = Ec - Cc | 0;
Ue(Fc + Cc | 0, Qb, Dc);
Cc = c[f[f[f[a >> 2] + 28 >> 2] + 8 >> 2]](f[a + 60 >> 2], f[a + 8 >> 2], Ec, a + 40 | 0, Fc, Ac) | 0;
if (Cc) {
break a
}
f[Bc >> 2] = f[Bc >> 2] + Ec;
f[a + 36 >> 2] = 0;
$b = $b - Dc | 0;
Ac = Ac + Ec | 0;
Qb = Qb + Dc | 0
}
Cc = 0;
if (!$b) {
break a
}
Dc = ($b >>> 0) % (Ec >>> 0) | 0;
j: {
if (Dc) {
break j
}
Dc = 0;
if (f[a + 8 >> 2]) {
break j
}
Dc = f[a + 12 >> 2] ? Ec : 0
}
$b = $b - Dc | 0;
Ue(a + 20 | 0, $b + Qb | 0, Dc);
f[a + 36 >> 2] = f[a + 36 >> 2] + Dc;
if (!$b) {
break a
}
Cc = c[f[f[f[a >> 2] + 28 >> 2] + 8 >> 2]](f[a + 60 >> 2], f[a + 8 >> 2], $b, a + 40 | 0, Qb, Ac) | 0;
if (Cc) {
break a
}
f[Bc >> 2] = $b + f[Bc >> 2];
break d;
case 0:
Cc = c[f[f[Dc + 28 >> 2] + 12 >> 2]](f[a + 60 >> 2], f[a + 8 >> 2], $b, a + 36 | 0, a + 40 | 0, Qb, Ac) | 0;
if (!Cc) {
break f
}
break a;
case 2:
Cc = c[f[f[Dc + 28 >> 2] + 16 >> 2]](f[a + 60 >> 2], $b, a + 36 | 0, a + 40 | 0, a + 20 | 0, Qb, Ac) | 0;
if (!Cc) {
break f
}
break a;
case 1:
case 3:
break a;
case 4:
break g
}
}
Cc = c[f[f[Dc + 28 >> 2] + 20 >> 2]](f[a + 60 >> 2], $b, Qb, Ac) | 0;
if (Cc) {
break a
}
}
f[Bc >> 2] = $b;
break d
}
Ue((a + Cc | 0) + 20 | 0, Qb, $b);
f[a + 36 >> 2] = f[a + 36 >> 2] + $b
}
Cc = 0
}
return Cc
}
function Za(a, Qb, $b) {
var Ac = 0
, Bc = 0
, Hc = 0
, Ic = 0;
Ac = -24832;
a: {
b: {
c: {
if (!a | !$b) {
break c
}
Hc = f[a >> 2];
if (!Hc) {
break c
}
Ac = 0;
f[$b >> 2] = 0;
d: {
Bc = f[Hc + 4 >> 2] + -1 | 0;
if (Bc >>> 0 > 6) {
break d
}
e: {
switch (Bc - 1 | 0) {
case 1:
case 3:
case 4:
case 5:
break c;
case 2:
break d;
case 0:
break e;
default:
break a
}
}
Ac = f[a + 8 >> 2];
f: {
if ((Ac | 0) == 1) {
Bc = f[a + 12 >> 2];
if (!Bc) {
break a
}
Ic = a + 20 | 0;
Ac = f[a + 56 >> 2];
if (!Ac) {
Ac = f[Hc + 16 >> 2]
}
c[Bc](Ic, Ac, f[a + 36 >> 2]);
Ac = f[a + 8 >> 2];
Hc = f[a >> 2];
Bc = f[Hc + 24 >> 2];
break f
}
Bc = f[Hc + 24 >> 2];
Ic = f[a + 36 >> 2];
if ((Bc | 0) != (Ic | 0)) {
break b
}
}
Ac = c[f[f[Hc + 28 >> 2] + 8 >> 2]](f[a + 60 >> 2], Ac, Bc, a + 40 | 0, a + 20 | 0, Qb) | 0;
if (Ac) {
break c
}
if (!f[a + 8 >> 2]) {
Ac = f[a + 16 >> 2];
a = f[a >> 2];
if (!a) {
return c[Ac](Qb, 0, $b) | 0
}
return c[Ac](Qb, f[a + 24 >> 2], $b) | 0
}
a = f[a >> 2];
if (a) {
a = f[a + 24 >> 2]
} else {
a = 0
}
f[$b >> 2] = a;
return 0
}
Ac = -24704
}
return Ac
}
return f[a + 12 >> 2] | Ic ? -25216 : 0
}
return f[a + 36 >> 2] ? -25216 : 0
}
function _a(a, Qb, $b, Jc, Kc, Lc, Mc) {
var Nc = 0
, Oc = 0
, Pc = 0;
Pc = U - 16 | 0;
U = Pc;
Oc = -24832;
a: {
if (!a) {
break a
}
Nc = f[a >> 2];
if (!Nc | ($b ? !Qb : 0)) {
break a
}
b: {
if (!(Qb | $b)) {
f[a + 56 >> 2] = 0;
break b
}
Oc = -24704;
if ($b >>> 0 > 16) {
break a
}
}
c: {
if (d[Nc + 20 | 0] & 1) {
Nc = $b;
break c
}
Oc = -24832;
Nc = f[Nc + 16 >> 2];
if (Nc >>> 0 > $b >>> 0) {
break a
}
}
if (Nc) {
Ue(a + 40 | 0, Qb, Nc);
f[a + 56 >> 2] = Nc
}
f[a + 36 >> 2] = 0;
Oc = Ya(a, Jc, Kc, Lc, Mc);
if (Oc) {
break a
}
Oc = Za(a, f[Mc >> 2] + Lc | 0, Pc + 12 | 0);
if (Oc) {
break a
}
f[Mc >> 2] = f[Mc >> 2] + f[Pc + 12 >> 2];
Oc = 0
}
U = Pc + 16 | 0;
return Oc
}
function $a(a, Qb, $b, Jc) {
a = a | 0;
Qb = Qb | 0;
$b = $b | 0;
Jc = Jc | 0;
return la(a, Qb, $b, Jc) | 0
}
function ab(a, Qb, $b, Jc, Kc, Lc) {
a = a | 0;
Qb = Qb | 0;
$b = $b | 0;
Jc = Jc | 0;
Kc = Kc | 0;
Lc = Lc | 0;
return ma(a, Qb, $b, Jc, Kc, Lc) | 0
}
function bb(a, Qb, $b, Jc, Kc, Lc, Mc) {
a = a | 0;
Qb = Qb | 0;
$b = $b | 0;
Jc = Jc | 0;
Kc = Kc | 0;
Lc = Lc | 0;
Mc = Mc | 0;
return na(a, Qb, $b, Jc, Kc, Lc, Mc) | 0
}
function cb(a, Qb, $b, Jc, Kc, Lc, Mc) {
a = a | 0;
Qb = Qb | 0;
$b = $b | 0;
Jc = Jc | 0;
Kc = Kc | 0;
Lc = Lc | 0;
Mc = Mc | 0;
return oa(a, Qb, $b, Jc, Kc, Lc, Mc) | 0
}
function db(a, Qb, $b) {
a = a | 0;
Qb = Qb | 0;
$b = $b | 0;
return ha(a, Qb, $b) | 0
}
function eb(a, Qb, $b) {
a = a | 0;
Qb = Qb | 0;
$b = $b | 0;
return ia(a, Qb, $b) | 0
}
function fb() {
var a = 0;
a = Se(1, 280);
if (a) {
Ve(a, 280)
}
return a | 0
}
function gb(Qb) {
Qb = Qb | 0;
ga(Qb);
Re(Qb)
}
function hb(Qb, $b, Jc) {
Qb = Qb | 0;
$b = $b | 0;
Jc = Jc | 0;
return ic(Qb, 2, $b, Jc) | 0
}
function ib() {
var Qb = 0;
Qb = Se(1, 392);
if (Qb) {
Ve(Qb, 392)
}
return Qb | 0
}
function jb($b) {
$b = $b | 0;
lc($b);
Re($b)
}
function kb($b, Jc, Kc) {
$b = $b | 0;
Jc = Jc | 0;
Kc = Kc | 0;
return Ga($b, 2, Jc, Kc) | 0
}
function lb() {
var $b = 0;
$b = Se(1, 64);
if ($b) {
Fa($b)
}
return $b | 0
}
function mb(Jc) {
Jc = Jc | 0;
Ha(Jc);
Re(Jc)
}
function nb(Jc, Kc, Lc, Mc) {
Jc = Jc | 0;
Kc = Kc | 0;
Lc = Lc | 0;
Mc = Mc | 0;
return ra(Jc, Kc, Lc, Mc) | 0
}
function ob(Jc, Kc, Lc) {
Jc = Jc | 0;
Kc = Kc | 0;
Lc = Lc | 0;
if (Lc & 7) {
Jc = -24832
} else {
qa(Jc, Kc, Lc >>> 3);
Jc = 0
}
return Jc | 0
}
function pb() {
var Jc = 0;
Jc = Se(1, 264);
if (Jc) {
Ve(Jc, 264)
}
return Jc | 0
}
function qb(Kc) {
Kc = Kc | 0;
pa(Kc);
Re(Kc)
}
function rb(Kc, Lc, Mc, Qc) {
Kc = Kc | 0;
Lc = Lc | 0;
Mc = Mc | 0;
Qc = Qc | 0;
return ua(Kc, Lc, Mc, Qc) | 0
}
function sb(Kc, Lc, Mc, Qc, Rc, Sc) {
Kc = Kc | 0;
Lc = Lc | 0;
Mc = Mc | 0;
Qc = Qc | 0;
Rc = Rc | 0;
Sc = Sc | 0;
return va(Kc, Lc, Mc, Qc, Rc, Sc) | 0
}
function tb(Kc, Lc, Mc, Qc, Rc, Sc, Tc) {
Kc = Kc | 0;
Lc = Lc | 0;
Mc = Mc | 0;
Qc = Qc | 0;
Rc = Rc | 0;
Sc = Sc | 0;
Tc = Tc | 0;
return wa(Kc, Lc, Mc, Qc, Rc, Sc, Tc) | 0
}
function ub(Kc, Lc, Mc, Qc, Rc, Sc, Tc) {
Kc = Kc | 0;
Lc = Lc | 0;
Mc = Mc | 0;
Qc = Qc | 0;
Rc = Rc | 0;
Sc = Sc | 0;
Tc = Tc | 0;
return xa(Kc, Lc, Mc, Qc, Rc, Sc, Tc) | 0
}
function vb(Kc, Lc, Mc) {
Kc = Kc | 0;
Lc = Lc | 0;
Mc = Mc | 0;
return ta(Kc, Lc, Mc) | 0
}
function wb() {
var Kc = 0;
Kc = Se(1, 4168);
if (Kc) {
Ve(Kc, 4168)
}
return Kc | 0
}
function xb(Lc) {
Lc = Lc | 0;
sa(Lc);
Re(Lc)
}
function yb(Lc, Mc, Qc, Rc) {
Lc = Lc | 0;
Mc = Mc | 0;
Qc = Qc | 0;
Rc = Rc | 0;
return Ba(Lc, Qc, Rc) | 0
}
function zb(Lc, Mc, Qc, Rc, Sc, Tc) {
Lc = Lc | 0;
Mc = Mc | 0;
Qc = Qc | 0;
Rc = Rc | 0;
Sc = Sc | 0;
Tc = Tc | 0;
return Ca(Lc, Mc, Qc, Rc, Sc, Tc) | 0
}
function Ab(Lc, Mc, Qc, Rc, Sc, Tc, Uc) {
Lc = Lc | 0;
Mc = Mc | 0;
Qc = Qc | 0;
Rc = Rc | 0;
Sc = Sc | 0;
Tc = Tc | 0;
Uc = Uc | 0;
return Da(Lc, Mc, Qc, Rc, Sc, Tc, Uc) | 0
}
function Bb(Lc, Mc, Qc, Rc, Sc, Tc, Uc) {
Lc = Lc | 0;
Mc = Mc | 0;
Qc = Qc | 0;
Rc = Rc | 0;
Sc = Sc | 0;
Tc = Tc | 0;
Uc = Uc | 0;
return Ea(Lc, Mc, Qc, Rc, Sc, Tc, Uc) | 0
}
function Cb(Lc, Mc, Qc) {
Lc = Lc | 0;
Mc = Mc | 0;
Qc = Qc | 0;
return za(Lc, Mc, Qc) | 0
}
function Db(Lc, Mc, Qc) {
Lc = Lc | 0;
Mc = Mc | 0;
Qc = Qc | 0;
return Aa(Lc, Mc, Qc) | 0
}
function Eb() {
var Lc = 0;
Lc = Se(1, 276);
if (Lc) {
Ve(Lc, 276)
}
return Lc | 0
}
function Fb(Mc) {
Mc = Mc | 0;
ya(Mc);
Re(Mc)
}
function Gb(Mc, Qc, Rc) {
Mc = Mc | 0;
Qc = Qc | 0;
Rc = Rc | 0;
return ic(Mc, 5, Qc, Rc) | 0
}
function Hb(Mc, Qc, Rc) {
Mc = Mc | 0;
Qc = Qc | 0;
Rc = Rc | 0;
return Ga(Mc, 5, Qc, Rc) | 0
}
function Ib(Mc, Qc, Rc, Sc) {
Mc = Mc | 0;
Qc = Qc | 0;
Rc = Rc | 0;
Sc = Sc | 0;
return ec(Mc, Rc, Sc) | 0
}
function Jb(Mc, Qc, Rc, Sc, Tc, Uc) {
Mc = Mc | 0;
Qc = Qc | 0;
Rc = Rc | 0;
Sc = Sc | 0;
Tc = Tc | 0;
Uc = Uc | 0;
return fc(Mc, Qc, Rc, Sc, Tc, Uc) | 0
}
function Kb(Mc, Qc, Rc) {
Mc = Mc | 0;
Qc = Qc | 0;
Rc = Rc | 0;
Yb(Mc, Qc);
return 0
}
function Lb(Mc, Qc, Rc) {
Mc = Mc | 0;
Qc = Qc | 0;
Rc = Rc | 0;
return Zb(Mc, Qc) | 0
}
function Mb() {
var Mc = 0;
Mc = Se(1, 128);
if (Mc) {
Ve(Mc, 128)
}
return Mc | 0
}
function Nb(Qc) {
Qc = Qc | 0;
Wb(Qc);
Re(Qc)
}
function Ob(Qc, Rc, Sc, Tc) {
Qc = Qc | 0;
Rc = Rc | 0;
Sc = Sc | 0;
Tc = Tc | 0;
return gc(Qc, Sc, Tc) | 0
}
function Pb(Qc, Rc, Sc, Tc, Uc, Vc) {
Qc = Qc | 0;
Rc = Rc | 0;
Sc = Sc | 0;
Tc = Tc | 0;
Uc = Uc | 0;
Vc = Vc | 0;
return hc(Qc, Rc, Sc, Tc, Uc, Vc) | 0
}
function Qb(Qc, Rc, Sc) {
Qc = Qc | 0;
Rc = Rc | 0;
Sc = Sc | 0;
return _b(Qc, Rc) | 0
}
function Rb(Qc, Rc, Sc) {
Qc = Qc | 0;
Rc = Rc | 0;
Sc = Sc | 0;
return ac(Qc, Rc) | 0
}
function Sb() {
var Qc = 0;
Qc = Se(1, 384);
if (Qc) {
Ve(Qc, 384)
}
return Qc | 0
}
function Tb(Rc) {
Rc = Rc | 0;
Xb(Rc);
Re(Rc)
}
function Ub(Rc, Sc, Tc) {
Rc = Rc | 0;
Sc = Sc | 0;
Tc = Tc | 0;
return bc(Rc, Sc) | 0
}
function Vb(Rc, Sc, Tc) {
Rc = Rc | 0;
Sc = Sc | 0;
Tc = Tc | 0;
return dc(Rc, Sc) | 0
}
function Wb(Rc) {
var Sc = 0;
if (Rc) {
Sc = 128;
while (1) {
d[Rc | 0] = 0;
Rc = Rc + 1 | 0;
Sc = Sc + -1 | 0;
if (Sc) {
continue
}
break
}
}
}
function Xb(Rc) {
var Tc = 0;
if (Rc) {
Tc = 384;
while (1) {
d[Rc | 0] = 0;
Rc = Rc + 1 | 0;
Tc = Tc + -1 | 0;
if (Tc) {
continue
}
break
}
}
}
function Yb(Rc, Uc) {
var Vc = 0
, Wc = 0
, Xc = 0
, Yc = 0
, Zc = 0
, _c = 0
, $c = 0
, ad = 0
, bd = 0
, cd = 0
, dd = 0
, ed = 0
, fd = 0
, gd = 0;
Vc = g[Uc + 4 | 0] | g[Uc + 5 | 0] << 8 | (g[Uc + 6 | 0] << 16 | g[Uc + 7 | 0] << 24);
Xc = Vc << 24 | Vc << 8 & 16711680 | (Vc >>> 8 & 65280 | Vc >>> 24);
Wc = g[Uc | 0];
Vc = g[Uc + 3 | 0] | (g[Uc + 1 | 0] << 16 | Wc << 24 | g[Uc + 2 | 0] << 8);
Zc = (Xc >>> 4 ^ Vc) & 252645135;
Uc = (Zc << 4 ^ Xc) & -269488145 | Vc & 269488144;
Xc = (f[(Uc >>> 7 & 60) + 9568 >> 2] << 2 | f[(Uc << 1 & 60) + 9568 >> 2] << 3 | f[(Uc >>> 15 & 60) + 9568 >> 2] << 1 | f[(Uc >>> 23 & 60) + 9568 >> 2] | f[(Uc >>> 2 & 60) + 9568 >> 2] << 7 | f[(Uc >>> 10 & 60) + 9568 >> 2] << 6 | f[(Uc >>> 18 & 60) + 9568 >> 2] << 5 | f[(Uc >>> 26 & 60) + 9568 >> 2] << 4) & 268435455;
Uc = Vc ^ Zc;
Wc = (f[(Uc >>> 6 & 60) + 9504 >> 2] << 2 | f[((Uc & 15) << 2) + 9504 >> 2] << 3 | f[(Uc >>> 14 & 60) + 9504 >> 2] << 1 | f[(Uc >>> 22 & 60) + 9504 >> 2] | f[(Uc >>> 3 & 60) + 9504 >> 2] << 7 | f[(Uc >>> 11 & 60) + 9504 >> 2] << 6 | f[(Uc >>> 19 & 60) + 9504 >> 2] << 5 | f[(Wc >>> 3 & 28) + 9504 >> 2] << 4) & 268435455;
Zc = 0;
while (1) {
a: {
if (!(!(1 << Zc & 33027) | Zc >>> 0 > 15)) {
$c = 27;
Yc = 1;
_c = 268435454;
break a
}
$c = 26;
Yc = 2;
_c = 268435452
}
Uc = _c;
Vc = Wc << Yc;
ad = Uc & Vc;
bd = Wc >>> $c;
Wc = ad | bd;
cd = Wc << 10;
Uc = Xc << Yc;
Yc = _c & Uc;
$c = Xc >>> $c;
Xc = Yc | $c;
Yc = Yc >>> 14;
_c = Uc >>> 10 & 16 | (Uc >>> 5 & 32 | (Yc & 512 | (Uc >>> 1 & 1024 | (Xc << 6 & 2048 | (Uc >>> 4 & 4096 | (Uc >>> 13 & 8192 | (Uc & 256 | (Vc >>> 10 & 65536 | (ad << 2 & 131072 | (cd & 262144 | (Vc >>> 1 & 1048576 | (Vc << 9 & 2097152 | (Vc << 6 & 16777216 | (Wc << 18 & 34078720 | (Vc << 14 & 134217728 | (ad << 4 & 603979776 | bd << 28 & 268435456))))))))))))))));
bd = Xc >>> 3;
f[Rc >> 2] = Uc >>> 24 & 1 | (Uc >>> 26 & 2 | (Uc >>> 18 & 4 | (_c | bd & 8)));
_c = Uc >>> 21 & 2;
dd = Uc >>> 7 & 32;
ed = Uc >>> 9 & 1024;
fd = Uc >>> 2 & 8192;
gd = Uc & 512;
Uc = Wc << 15;
f[Rc + 4 >> 2] = _c | ($c << 2 & 4 | (bd & 17 | (dd | (Xc << 7 & 256 | (ed | (Yc & 2056 | (Xc << 8 & 4096 | (fd | (gd | (Vc >>> 4 & 65536 | (Vc >>> 6 & 262144 | (ad << 3 & 524288 | (Vc << 11 & 1048576 | (Wc << 16 & 2097152 | (ad << 1 & 16777216 | (Vc >>> 2 & 33554432 | (Wc << 22 & 67108864 | (cd & 134217728 | (Uc & 536870912 | Vc << 17 & 268435456)))))))) | Uc & 131072)))))))))));
Rc = Rc + 8 | 0;
Zc = Zc + 1 | 0;
if ((Zc | 0) != 16) {
continue
}
break
}
}
function Zb(Rc, Uc) {
var hd = 0
, id = 0;
Yb(Rc, Uc);
Uc = f[Rc >> 2];
hd = f[Rc + 4 >> 2];
id = f[Rc + 124 >> 2];
f[Rc >> 2] = f[Rc + 120 >> 2];
f[Rc + 4 >> 2] = id;
f[Rc + 120 >> 2] = Uc;
f[Rc + 124 >> 2] = hd;
Uc = f[Rc + 8 >> 2];
hd = f[Rc + 12 >> 2];
id = f[Rc + 116 >> 2];
f[Rc + 8 >> 2] = f[Rc + 112 >> 2];
f[Rc + 12 >> 2] = id;
f[Rc + 112 >> 2] = Uc;
f[Rc + 116 >> 2] = hd;
Uc = f[Rc + 104 >> 2];
hd = f[Rc + 108 >> 2];
id = f[Rc + 20 >> 2];
f[Rc + 104 >> 2] = f[Rc + 16 >> 2];
f[Rc + 108 >> 2] = id;
f[Rc + 16 >> 2] = Uc;
f[Rc + 20 >> 2] = hd;
Uc = f[Rc + 24 >> 2];
f[Rc + 24 >> 2] = f[Rc + 96 >> 2];
f[Rc + 96 >> 2] = Uc;
Uc = f[Rc + 100 >> 2];
f[Rc + 100 >> 2] = f[Rc + 28 >> 2];
f[Rc + 28 >> 2] = Uc;
Uc = f[Rc + 88 >> 2];
f[Rc + 88 >> 2] = f[Rc + 32 >> 2];
f[Rc + 32 >> 2] = Uc;
Uc = f[Rc + 92 >> 2];
f[Rc + 92 >> 2] = f[Rc + 36 >> 2];
f[Rc + 36 >> 2] = Uc;
Uc = f[Rc + 80 >> 2];
f[Rc + 80 >> 2] = f[Rc + 40 >> 2];
f[Rc + 40 >> 2] = Uc;
Uc = f[Rc + 84 >> 2];
f[Rc + 84 >> 2] = f[Rc + 44 >> 2];
f[Rc + 44 >> 2] = Uc;
Uc = f[Rc + 72 >> 2];
f[Rc + 72 >> 2] = f[Rc + 48 >> 2];
f[Rc + 48 >> 2] = Uc;
Uc = f[Rc + 76 >> 2];
f[Rc + 76 >> 2] = f[Rc + 52 >> 2];
f[Rc + 52 >> 2] = Uc;
Uc = f[Rc + 64 >> 2];
f[Rc + 64 >> 2] = f[Rc + 56 >> 2];
f[Rc + 56 >> 2] = Uc;
Uc = f[Rc + 68 >> 2];
f[Rc + 68 >> 2] = f[Rc + 60 >> 2];
f[Rc + 60 >> 2] = Uc;
return 0
}
function _b(Rc, Uc) {
var jd = 0;
jd = U - 384 | 0;
U = jd;
$b(Rc, jd, Uc);
Uc = 384;
Rc = jd;
while (1) {
d[Rc | 0] = 0;
Rc = Rc + 1 | 0;
Uc = Uc + -1 | 0;
if (Uc) {
continue
}
break
}
U = jd + 384 | 0;
return 0
}
function $b(Rc, Uc, kd) {
var ld = 0
, md = 0
, nd = 0
, od = 0
, pd = 0
, qd = 0;
Yb(Rc, kd);
Yb(Uc + 128 | 0, kd + 8 | 0);
kd = 0;
while (1) {
ld = kd << 2;
nd = ld + Uc | 0;
f[nd >> 2] = f[(30 - kd << 2) + Rc >> 2];
od = ld | 4;
pd = od + Uc | 0;
f[pd >> 2] = f[(31 - kd << 2) + Rc >> 2];
md = Rc + ld | 0;
f[md + 128 >> 2] = f[(62 - kd << 2) + Uc >> 2];
f[md + 132 >> 2] = f[(63 - kd << 2) + Uc >> 2];
qd = ld + 256 | 0;
f[qd + Rc >> 2] = f[md >> 2];
ld = ld + 260 | 0;
f[ld + Rc >> 2] = f[Rc + od >> 2];
f[Uc + qd >> 2] = f[nd >> 2];
f[Uc + ld >> 2] = f[pd >> 2];
ld = kd >>> 0 < 30;
kd = kd + 2 | 0;
if (ld) {
continue
}
break
}
}
function ac(Rc, Uc) {
var kd = 0;
kd = U - 384 | 0;
U = kd;
$b(kd, Rc, Uc);
Uc = 384;
Rc = kd;
while (1) {
d[Rc | 0] = 0;
Rc = Rc + 1 | 0;
Uc = Uc + -1 | 0;
if (Uc) {
continue
}
break
}
U = kd + 384 | 0;
return 0
}
function bc(Rc, Uc) {
var rd = 0;
rd = U - 384 | 0;
U = rd;
cc(Rc, rd, Uc);
Uc = 384;
Rc = rd;
while (1) {
d[Rc | 0] = 0;
Rc = Rc + 1 | 0;
Uc = Uc + -1 | 0;
if (Uc) {
continue
}
break
}
U = rd + 384 | 0;
return 0
}
function cc(Rc, Uc, sd) {
var td = 0
, ud = 0;
Yb(Rc, sd);
Yb(Uc + 128 | 0, sd + 8 | 0);
Yb(Rc + 256 | 0, sd + 16 | 0);
sd = 0;
while (1) {
td = sd << 2;
ud = td + Uc | 0;
f[ud >> 2] = f[(94 - sd << 2) + Rc >> 2];
f[(td | 4) + Uc >> 2] = f[(95 - sd << 2) + Rc >> 2];
td = Rc + td | 0;
f[td + 128 >> 2] = f[(62 - sd << 2) + Uc >> 2];
f[td + 132 >> 2] = f[(63 - sd << 2) + Uc >> 2];
f[ud + 256 >> 2] = f[(30 - sd << 2) + Rc >> 2];
f[ud + 260 >> 2] = f[(31 - sd << 2) + Rc >> 2];
td = sd >>> 0 < 30;
sd = sd + 2 | 0;
if (td) {
continue
}
break
}
}
function dc(Rc, Uc) {
var sd = 0;
sd = U - 384 | 0;
U = sd;
cc(sd, Rc, Uc);
Uc = 384;
Rc = sd;
while (1) {
d[Rc | 0] = 0;
Rc = Rc + 1 | 0;
Uc = Uc + -1 | 0;
if (Uc) {
continue
}
break
}
U = sd + 384 | 0;
return 0
}
function ec(Rc, Uc, vd) {
var wd = 0
, xd = 0
, yd = 0
, zd = 0;
wd = g[Uc | 0] | g[Uc + 1 | 0] << 8 | (g[Uc + 2 | 0] << 16 | g[Uc + 3 | 0] << 24);
wd = wd << 24 | wd << 8 & 16711680 | (wd >>> 8 & 65280 | wd >>> 24);
Uc = g[Uc + 4 | 0] | g[Uc + 5 | 0] << 8 | (g[Uc + 6 | 0] << 16 | g[Uc + 7 | 0] << 24);
Uc = Uc << 24 | Uc << 8 & 16711680 | (Uc >>> 8 & 65280 | Uc >>> 24);
xd = (wd >>> 4 ^ Uc) & 252645135;
wd = xd << 4 ^ wd;
xd = Uc ^ xd;
Uc = wd >>> 16 ^ xd & 65535;
xd = Uc ^ xd;
Uc = wd ^ Uc << 16;
wd = (xd >>> 2 ^ Uc) & 858993459;
xd = wd << 2 ^ xd;
Uc = Uc ^ wd;
wd = (xd >>> 8 ^ Uc) & 16711935;
xd = wd << 8 ^ xd;
yd = tf(xd, 1);
Uc = Uc ^ wd;
xd = (Uc ^ xd << 1) & -1431655766;
wd = yd ^ xd;
Uc = tf(Uc ^ xd, 1);
xd = 0;
while (1) {
yd = wd;
zd = Uc;
Uc = f[Rc >> 2] ^ wd;
zd = zd ^ f[((Uc & 63) << 2) + 9632 >> 2] ^ f[(Uc >>> 6 & 252) + 9888 >> 2] ^ f[(Uc >>> 14 & 252) + 10144 >> 2] ^ f[(Uc >>> 22 & 252) + 10400 >> 2];
Uc = f[Rc + 4 >> 2] ^ tf(wd, 28);
Uc = zd ^ f[((Uc & 63) << 2) + 10656 >> 2] ^ f[(Uc >>> 6 & 252) + 10912 >> 2] ^ f[(Uc >>> 14 & 252) + 11168 >> 2] ^ f[(Uc >>> 22 & 252) + 11424 >> 2];
wd = Uc ^ f[Rc + 8 >> 2];
yd = yd ^ f[((wd & 63) << 2) + 9632 >> 2] ^ f[(wd >>> 6 & 252) + 9888 >> 2] ^ f[(wd >>> 14 & 252) + 10144 >> 2] ^ f[(wd >>> 22 & 252) + 10400 >> 2];
wd = f[Rc + 12 >> 2] ^ tf(Uc, 28);
wd = yd ^ f[((wd & 63) << 2) + 10656 >> 2] ^ f[(wd >>> 6 & 252) + 10912 >> 2] ^ f[(wd >>> 14 & 252) + 11168 >> 2] ^ f[(wd >>> 22 & 252) + 11424 >> 2];
Rc = Rc + 16 | 0;
xd = xd + 1 | 0;
if ((xd | 0) != 8) {
continue
}
break
}
zd = Uc << 31;
yd = Uc;
Rc = tf(wd, 31);
Uc = (Rc ^ Uc) & -1431655766;
wd = zd | (yd ^ Uc) >>> 1;
Rc = Rc ^ Uc;
Uc = (wd >>> 8 ^ Rc) & 16711935;
wd = Uc << 8 ^ wd;
Rc = Rc ^ Uc;
Uc = (wd >>> 2 ^ Rc) & 858993459;
wd = Uc << 2 ^ wd;
Rc = Rc ^ Uc;
Uc = wd & 65535 ^ Rc >>> 16;
xd = Uc << 16 ^ Rc;
Rc = Uc ^ wd;
Uc = (xd >>> 4 ^ Rc) & 252645135;
Rc = Rc ^ Uc;
d[vd + 7 | 0] = Rc;
d[vd + 6 | 0] = Rc >>> 8;
d[vd + 5 | 0] = Rc >>> 16;
d[vd + 4 | 0] = Rc >>> 24;
Rc = xd ^ Uc << 4;
d[vd + 3 | 0] = Rc;
d[vd + 2 | 0] = Rc >>> 8;
d[vd + 1 | 0] = Rc >>> 16;
d[vd | 0] = Rc >>> 24;
return 0
}
function fc(Rc, Uc, vd, Ad, Bd, Cd) {
var Dd = 0
, Ed = 0;
Ed = -50;
a: {
if (vd & 7) {
break a
}
if ((Uc | 0) != 1) {
Ed = 0;
if (!vd) {
break a
}
while (1) {
Dd = g[Bd + 4 | 0] | g[Bd + 5 | 0] << 8 | (g[Bd + 6 | 0] << 16 | g[Bd + 7 | 0] << 24);
Uc = g[Bd | 0] | g[Bd + 1 | 0] << 8 | (g[Bd + 2 | 0] << 16 | g[Bd + 3 | 0] << 24);
ec(Rc, Bd, Cd);
d[Cd | 0] = g[Ad | 0] ^ g[Cd | 0];
d[Cd + 1 | 0] = g[Ad + 1 | 0] ^ g[Cd + 1 | 0];
d[Cd + 2 | 0] = g[Ad + 2 | 0] ^ g[Cd + 2 | 0];
d[Cd + 3 | 0] = g[Ad + 3 | 0] ^ g[Cd + 3 | 0];
d[Cd + 4 | 0] = g[Ad + 4 | 0] ^ g[Cd + 4 | 0];
d[Cd + 5 | 0] = g[Ad + 5 | 0] ^ g[Cd + 5 | 0];
d[Cd + 6 | 0] = g[Ad + 6 | 0] ^ g[Cd + 6 | 0];
d[Cd + 7 | 0] = g[Ad + 7 | 0] ^ g[Cd + 7 | 0];
d[Ad | 0] = Uc;
d[Ad + 1 | 0] = Uc >>> 8;
d[Ad + 2 | 0] = Uc >>> 16;
d[Ad + 3 | 0] = Uc >>> 24;
d[Ad + 4 | 0] = Dd;
d[Ad + 5 | 0] = Dd >>> 8;
d[Ad + 6 | 0] = Dd >>> 16;
d[Ad + 7 | 0] = Dd >>> 24;
Cd = Cd + 8 | 0;
Bd = Bd + 8 | 0;
vd = vd + -8 | 0;
if (vd) {
continue
}
break
}
break a
}
Ed = 0;
if (!vd) {
break a
}
Uc = g[Ad | 0];
while (1) {
d[Cd | 0] = g[Bd | 0] ^ Uc;
d[Cd + 1 | 0] = g[Ad + 1 | 0] ^ g[Bd + 1 | 0];
d[Cd + 2 | 0] = g[Ad + 2 | 0] ^ g[Bd + 2 | 0];
d[Cd + 3 | 0] = g[Ad + 3 | 0] ^ g[Bd + 3 | 0];
d[Cd + 4 | 0] = g[Ad + 4 | 0] ^ g[Bd + 4 | 0];
d[Cd + 5 | 0] = g[Ad + 5 | 0] ^ g[Bd + 5 | 0];
d[Cd + 6 | 0] = g[Ad + 6 | 0] ^ g[Bd + 6 | 0];
d[Cd + 7 | 0] = g[Ad + 7 | 0] ^ g[Bd + 7 | 0];
ec(Rc, Cd, Cd);
Dd = g[Cd + 4 | 0] | g[Cd + 5 | 0] << 8 | (g[Cd + 6 | 0] << 16 | g[Cd + 7 | 0] << 24);
Uc = g[Cd | 0] | g[Cd + 1 | 0] << 8 | (g[Cd + 2 | 0] << 16 | g[Cd + 3 | 0] << 24);
d[Ad | 0] = Uc;
d[Ad + 1 | 0] = Uc >>> 8;
d[Ad + 2 | 0] = Uc >>> 16;
d[Ad + 3 | 0] = Uc >>> 24;
d[Ad + 4 | 0] = Dd;
d[Ad + 5 | 0] = Dd >>> 8;
d[Ad + 6 | 0] = Dd >>> 16;
d[Ad + 7 | 0] = Dd >>> 24;
Cd = Cd + 8 | 0;
Bd = Bd + 8 | 0;
vd = vd + -8 | 0;
if (vd) {
continue
}
break
}
}
return Ed
}
function gc(Rc, Uc, vd) {
var Ad = 0
, Bd = 0
, Cd = 0
, Fd = 0
, Gd = 0;
Ad = g[Uc | 0] | g[Uc + 1 | 0] << 8 | (g[Uc + 2 | 0] << 16 | g[Uc + 3 | 0] << 24);
Ad = Ad << 24 | Ad << 8 & 16711680 | (Ad >>> 8 & 65280 | Ad >>> 24);
Uc = g[Uc + 4 | 0] | g[Uc + 5 | 0] << 8 | (g[Uc + 6 | 0] << 16 | g[Uc + 7 | 0] << 24);
Uc = Uc << 24 | Uc << 8 & 16711680 | (Uc >>> 8 & 65280 | Uc >>> 24);
Bd = (Ad >>> 4 ^ Uc) & 252645135;
Ad = Bd << 4 ^ Ad;
Bd = Uc ^ Bd;
Uc = Ad >>> 16 ^ Bd & 65535;
Bd = Uc ^ Bd;
Uc = Ad ^ Uc << 16;
Ad = (Bd >>> 2 ^ Uc) & 858993459;
Bd = Ad << 2 ^ Bd;
Uc = Uc ^ Ad;
Ad = (Bd >>> 8 ^ Uc) & 16711935;
Bd = Ad << 8 ^ Bd;
Uc = Uc ^ Ad;
Ad = (Uc ^ Bd << 1) & -1431655766;
Bd = tf(Bd, 1) ^ Ad;
Uc = tf(Uc ^ Ad, 1);
Ad = Rc;
while (1) {
Fd = Bd;
Gd = Uc;
Uc = f[Ad >> 2] ^ Bd;
Gd = Gd ^ f[((Uc & 63) << 2) + 9632 >> 2] ^ f[(Uc >>> 6 & 252) + 9888 >> 2] ^ f[(Uc >>> 14 & 252) + 10144 >> 2] ^ f[(Uc >>> 22 & 252) + 10400 >> 2];
Uc = f[Ad + 4 >> 2] ^ tf(Bd, 28);
Uc = Gd ^ f[((Uc & 63) << 2) + 10656 >> 2] ^ f[(Uc >>> 6 & 252) + 10912 >> 2] ^ f[(Uc >>> 14 & 252) + 11168 >> 2] ^ f[(Uc >>> 22 & 252) + 11424 >> 2];
Bd = Uc ^ f[Ad + 8 >> 2];
Fd = Fd ^ f[((Bd & 63) << 2) + 9632 >> 2] ^ f[(Bd >>> 6 & 252) + 9888 >> 2] ^ f[(Bd >>> 14 & 252) + 10144 >> 2] ^ f[(Bd >>> 22 & 252) + 10400 >> 2];
Bd = f[Ad + 12 >> 2] ^ tf(Uc, 28);
Bd = Fd ^ f[((Bd & 63) << 2) + 10656 >> 2] ^ f[(Bd >>> 6 & 252) + 10912 >> 2] ^ f[(Bd >>> 14 & 252) + 11168 >> 2] ^ f[(Bd >>> 22 & 252) + 11424 >> 2];
Ad = Ad + 16 | 0;
Cd = Cd + 1 | 0;
if ((Cd | 0) != 8) {
continue
}
break
}
Ad = Rc + 128 | 0;
Cd = 0;
while (1) {
Fd = Uc;
Gd = Bd;
Bd = f[Ad >> 2] ^ Uc;
Bd = Gd ^ f[((Bd & 63) << 2) + 9632 >> 2] ^ f[(Bd >>> 6 & 252) + 9888 >> 2] ^ f[(Bd >>> 14 & 252) + 10144 >> 2] ^ f[(Bd >>> 22 & 252) + 10400 >> 2];
Uc = f[Ad + 4 >> 2] ^ tf(Uc, 28);
Bd = Bd ^ f[((Uc & 63) << 2) + 10656 >> 2] ^ f[(Uc >>> 6 & 252) + 10912 >> 2] ^ f[(Uc >>> 14 & 252) + 11168 >> 2] ^ f[(Uc >>> 22 & 252) + 11424 >> 2];
Uc = Bd ^ f[Ad + 8 >> 2];
Fd = Fd ^ f[((Uc & 63) << 2) + 9632 >> 2] ^ f[(Uc >>> 6 & 252) + 9888 >> 2] ^ f[(Uc >>> 14 & 252) + 10144 >> 2] ^ f[(Uc >>> 22 & 252) + 10400 >> 2];
Uc = f[Ad + 12 >> 2] ^ tf(Bd, 28);
Uc = Fd ^ f[((Uc & 63) << 2) + 10656 >> 2] ^ f[(Uc >>> 6 & 252) + 10912 >> 2] ^ f[(Uc >>> 14 & 252) + 11168 >> 2] ^ f[(Uc >>> 22 & 252) + 11424 >> 2];
Ad = Ad + 16 | 0;
Cd = Cd + 1 | 0;
if ((Cd | 0) != 8) {
continue
}
break
}
Ad = Rc + 256 | 0;
Cd = 0;
while (1) {
Rc = f[Ad >> 2] ^ Bd;
Uc = f[((Rc & 63) << 2) + 9632 >> 2] ^ Uc ^ f[(Rc >>> 6 & 252) + 9888 >> 2] ^ f[(Rc >>> 14 & 252) + 10144 >> 2] ^ f[(Rc >>> 22 & 252) + 10400 >> 2];
Rc = f[Ad + 4 >> 2] ^ tf(Bd, 28);
Uc = Uc ^ f[((Rc & 63) << 2) + 10656 >> 2] ^ f[(Rc >>> 6 & 252) + 10912 >> 2] ^ f[(Rc >>> 14 & 252) + 11168 >> 2] ^ f[(Rc >>> 22 & 252) + 11424 >> 2];
Rc = Uc ^ f[Ad + 8 >> 2];
Bd = f[((Rc & 63) << 2) + 9632 >> 2] ^ Bd ^ f[(Rc >>> 6 & 252) + 9888 >> 2] ^ f[(Rc >>> 14 & 252) + 10144 >> 2] ^ f[(Rc >>> 22 & 252) + 10400 >> 2];
Rc = f[Ad + 12 >> 2] ^ tf(Uc, 28);
Bd = Bd ^ f[((Rc & 63) << 2) + 10656 >> 2] ^ f[(Rc >>> 6 & 252) + 10912 >> 2] ^ f[(Rc >>> 14 & 252) + 11168 >> 2] ^ f[(Rc >>> 22 & 252) + 11424 >> 2];
Ad = Ad + 16 | 0;
Cd = Cd + 1 | 0;
if ((Cd | 0) != 8) {
continue
}
break
}
Fd = Uc << 31;
Ad = Uc;
Rc = tf(Bd, 31);
Uc = (Rc ^ Uc) & -1431655766;
Ad = Fd | (Ad ^ Uc) >>> 1;
Rc = Rc ^ Uc;
Uc = (Ad >>> 8 ^ Rc) & 16711935;
Ad = Uc << 8 ^ Ad;
Rc = Rc ^ Uc;
Uc = (Ad >>> 2 ^ Rc) & 858993459;
Ad = Uc << 2 ^ Ad;
Rc = Rc ^ Uc;
Uc = Ad & 65535 ^ Rc >>> 16;
Bd = Uc << 16 ^ Rc;
Rc = Uc ^ Ad;
Uc = (Bd >>> 4 ^ Rc) & 252645135;
Rc = Rc ^ Uc;
d[vd + 7 | 0] = Rc;
d[vd + 6 | 0] = Rc >>> 8;
d[vd + 5 | 0] = Rc >>> 16;
d[vd + 4 | 0] = Rc >>> 24;
Rc = Bd ^ Uc << 4;
d[vd + 3 | 0] = Rc;
d[vd + 2 | 0] = Rc >>> 8;
d[vd + 1 | 0] = Rc >>> 16;
d[vd | 0] = Rc >>> 24;
return 0
}
function hc(Rc, Uc, vd, Hd, Id, Jd) {
var Kd = 0
, Ld = 0;
Ld = -50;
a: {
if (vd & 7) {
break a
}
if ((Uc | 0) != 1) {
Ld = 0;
if (!vd) {
break a
}
while (1) {
Kd = g[Id + 4 | 0] | g[Id + 5 | 0] << 8 | (g[Id + 6 | 0] << 16 | g[Id + 7 | 0] << 24);
Uc = g[Id | 0] | g[Id + 1 | 0] << 8 | (g[Id + 2 | 0] << 16 | g[Id + 3 | 0] << 24);
gc(Rc, Id, Jd);
d[Jd | 0] = g[Hd | 0] ^ g[Jd | 0];
d[Jd + 1 | 0] = g[Hd + 1 | 0] ^ g[Jd + 1 | 0];
d[Jd + 2 | 0] = g[Hd + 2 | 0] ^ g[Jd + 2 | 0];
d[Jd + 3 | 0] = g[Hd + 3 | 0] ^ g[Jd + 3 | 0];
d[Jd + 4 | 0] = g[Hd + 4 | 0] ^ g[Jd + 4 | 0];
d[Jd + 5 | 0] = g[Hd + 5 | 0] ^ g[Jd + 5 | 0];
d[Jd + 6 | 0] = g[Hd + 6 | 0] ^ g[Jd + 6 | 0];
d[Jd + 7 | 0] = g[Hd + 7 | 0] ^ g[Jd + 7 | 0];
d[Hd | 0] = Uc;
d[Hd + 1 | 0] = Uc >>> 8;
d[Hd + 2 | 0] = Uc >>> 16;
d[Hd + 3 | 0] = Uc >>> 24;
d[Hd + 4 | 0] = Kd;
d[Hd + 5 | 0] = Kd >>> 8;
d[Hd + 6 | 0] = Kd >>> 16;
d[Hd + 7 | 0] = Kd >>> 24;
Jd = Jd + 8 | 0;
Id = Id + 8 | 0;
vd = vd + -8 | 0;
if (vd) {
continue
}
break
}
break a
}
Ld = 0;
if (!vd) {
break a
}
Uc = g[Hd | 0];
while (1) {
d[Jd | 0] = g[Id | 0] ^ Uc;
d[Jd + 1 | 0] = g[Hd + 1 | 0] ^ g[Id + 1 | 0];
d[Jd + 2 | 0] = g[Hd + 2 | 0] ^ g[Id + 2 | 0];
d[Jd + 3 | 0] = g[Hd + 3 | 0] ^ g[Id + 3 | 0];
d[Jd + 4 | 0] = g[Hd + 4 | 0] ^ g[Id + 4 | 0];
d[Jd + 5 | 0] = g[Hd + 5 | 0] ^ g[Id + 5 | 0];
d[Jd + 6 | 0] = g[Hd + 6 | 0] ^ g[Id + 6 | 0];
d[Jd + 7 | 0] = g[Hd + 7 | 0] ^ g[Id + 7 | 0];
gc(Rc, Jd, Jd);
Kd = g[Jd + 4 | 0] | g[Jd + 5 | 0] << 8 | (g[Jd + 6 | 0] << 16 | g[Jd + 7 | 0] << 24);
Uc = g[Jd | 0] | g[Jd + 1 | 0] << 8 | (g[Jd + 2 | 0] << 16 | g[Jd + 3 | 0] << 24);
d[Hd | 0] = Uc;
d[Hd + 1 | 0] = Uc >>> 8;
d[Hd + 2 | 0] = Uc >>> 16;
d[Hd + 3 | 0] = Uc >>> 24;
d[Hd + 4 | 0] = Kd;
d[Hd + 5 | 0] = Kd >>> 8;
d[Hd + 6 | 0] = Kd >>> 16;
d[Hd + 7 | 0] = Kd >>> 24;
Jd = Jd + 8 | 0;
Id = Id + 8 | 0;
vd = vd + -8 | 0;
if (vd) {
continue
}
break
}
}
return Ld
}
function ic(Rc, Uc, vd, Hd) {
var Id = 0
, Jd = 0
, Md = 0
, Nd = 0
, Od = 0
, Pd = 0
, Qd = 0
, Rd = 0
, Sd = 0
, Td = 0
, Ud = 0
, Vd = 0
, Wd = 0
, Xd = 0
, Yd = 0
, Zd = 0
, _d = 0
, $d = 0
, ae = 0
, be = 0
, ce = 0
, de = 0
, ee = 0
, fe = 0
, ge = 0
, he = 0
, ie = 0
, je = 0
, ke = 0;
ae = U - 32 | 0;
U = ae;
Vd = -20;
Uc = Ja(Uc, Hd);
a: {
if (!Uc | f[Uc + 24 >> 2] != 16) {
break a
}
Ka(Rc);
Vd = La(Rc, Uc);
if (Vd) {
break a
}
Vd = Wa(Rc, vd, Hd);
if (Vd) {
break a
}
Uc = ae;
f[Uc + 16 >> 2] = 0;
f[Uc + 20 >> 2] = 0;
f[Uc + 24 >> 2] = 0;
f[Uc + 28 >> 2] = 0;
f[Uc + 12 >> 2] = 0;
Vd = Ya(Rc, Uc + 16 | 0, 16, Uc + 16 | 0, Uc + 12 | 0);
if (Vd) {
break a
}
Hd = ae;
Xd = g[Hd + 31 | 0];
Zd = g[Hd + 30 | 0];
fe = g[Hd + 27 | 0];
be = g[Hd + 26 | 0];
ge = g[Hd + 25 | 0];
Md = g[Hd + 24 | 0];
Wd = g[Hd + 29 | 0];
Ud = g[Hd + 28 | 0];
vd = g[Hd + 23 | 0];
Jd = g[Hd + 22 | 0];
Nd = g[Hd + 19 | 0];
Od = g[Hd + 18 | 0];
Rd = g[Hd + 17 | 0];
Pd = g[Hd + 16 | 0];
Uc = g[Hd + 21 | 0];
Id = g[Hd + 20 | 0];
f[Rc + 192 >> 2] = 0;
f[Rc + 196 >> 2] = 0;
f[Rc + 64 >> 2] = 0;
f[Rc + 68 >> 2] = 0;
Hd = Uc;
Uc = Uc >>> 16;
ce = Hd << 16 | Id << 24;
Qd = Id >>> 8 | Uc;
Rd = Rd << 16 | Pd << 24;
Uc = Od << 8 | Rd | Nd;
Id = ce;
Uc = Uc | Qd | Jd >>> 24;
Qd = Uc;
Sd = Jd << 8 | Id | vd;
f[Rc + 256 >> 2] = Sd;
f[Rc + 260 >> 2] = Uc;
Nd = Wd >>> 16 | Ud >>> 8;
Od = ge << 16 | Md << 24;
Uc = be << 8 | Od | fe;
Id = Wd << 16 | Ud << 24;
Uc = Uc | Nd | Zd >>> 24;
Jd = Uc;
Td = Zd << 8 | Id | Xd;
f[Rc + 128 >> 2] = Td;
f[Rc + 132 >> 2] = Uc;
Hd = Qd;
Uc = Hd >>> 1;
Ud = (Hd & 1) << 31 | Sd >>> 1;
Yd = sf(Xd & 1, 0, -520093696) ^ Ud;
Uc = W ^ Uc;
Nd = Uc;
f[Rc + 224 >> 2] = Yd;
f[Rc + 228 >> 2] = Uc;
Uc = vd << 31 | Jd >>> 1;
Od = Uc;
Pd = (Jd & 1) << 31 | Td >>> 1;
de = Pd;
f[Rc + 96 >> 2] = Pd;
f[Rc + 100 >> 2] = Uc;
Wd = (Nd & 1) << 31 | Yd >>> 1;
_d = sf(Pd & 1, 0, -520093696) ^ Wd;
Uc = W ^ Nd >>> 1;
Rd = Uc;
f[Rc + 208 >> 2] = _d;
f[Rc + 212 >> 2] = Uc;
Md = (Od & 1) << 31 | Pd >>> 1;
Uc = Ud << 31 | Od >>> 1;
Pd = Uc;
je = Md;
f[Rc + 80 >> 2] = Md;
f[Rc + 84 >> 2] = Uc;
Uc = Nd ^ Rd;
ke = Uc;
Zd = Yd ^ _d;
f[Rc + 240 >> 2] = Zd;
f[Rc + 244 >> 2] = Uc;
Uc = Od ^ Pd;
fe = Uc;
be = de ^ Md;
f[Rc + 112 >> 2] = be;
f[Rc + 116 >> 2] = Uc;
Hd = Rd;
Uc = Hd >>> 1;
Id = sf(Md & 1, 0, -520093696) ^ ((Hd & 1) << 31 | _d >>> 1);
Uc = Uc ^ W;
$d = Uc;
f[Rc + 200 >> 2] = Id;
f[Rc + 204 >> 2] = Uc;
vd = Wd << 31;
Hd = Pd;
Uc = Hd >>> 1;
ee = (Hd & 1) << 31 | Md >>> 1;
Uc = Uc | vd;
he = Uc;
f[Rc + 72 >> 2] = ee;
f[Rc + 76 >> 2] = Uc;
Uc = Rd ^ $d;
vd = Uc;
ie = Id ^ _d;
f[Rc + 216 >> 2] = ie;
f[Rc + 220 >> 2] = Uc;
Uc = Nd ^ $d;
ge = Uc;
Md = Id ^ Yd;
f[Rc + 232 >> 2] = Md;
f[Rc + 236 >> 2] = Uc;
Uc = Hd ^ he;
ce = Uc;
Xd = je ^ ee;
f[Rc + 88 >> 2] = Xd;
f[Rc + 92 >> 2] = Uc;
Uc = Od ^ he;
Wd = Uc;
Ud = de ^ ee;
f[Rc + 104 >> 2] = Ud;
f[Rc + 108 >> 2] = Uc;
f[Rc + 264 >> 2] = Id ^ Sd;
f[Rc + 268 >> 2] = Qd ^ $d;
Uc = Nd ^ vd;
$d = Uc;
Id = Yd ^ ie;
f[Rc + 248 >> 2] = Id;
f[Rc + 252 >> 2] = Uc;
Hd = Od ^ ce;
Uc = Xd ^ de;
f[Rc + 120 >> 2] = Uc;
f[Rc + 124 >> 2] = Hd;
f[Rc + 272 >> 2] = Sd ^ _d;
f[Rc + 276 >> 2] = Qd ^ Rd;
f[Rc + 136 >> 2] = Td ^ ee;
f[Rc + 140 >> 2] = Jd ^ he;
f[Rc + 144 >> 2] = Td ^ je;
f[Rc + 148 >> 2] = Jd ^ Pd;
f[Rc + 280 >> 2] = Sd ^ ie;
f[Rc + 284 >> 2] = Qd ^ vd;
f[Rc + 152 >> 2] = Td ^ Xd;
f[Rc + 156 >> 2] = Jd ^ ce;
f[Rc + 288 >> 2] = Sd ^ Yd;
f[Rc + 292 >> 2] = Nd ^ Qd;
f[Rc + 160 >> 2] = Td ^ de;
f[Rc + 164 >> 2] = Jd ^ Od;
f[Rc + 296 >> 2] = Sd ^ Md;
f[Rc + 300 >> 2] = Qd ^ ge;
f[Rc + 168 >> 2] = Td ^ Ud;
f[Rc + 172 >> 2] = Jd ^ Wd;
f[Rc + 304 >> 2] = Sd ^ Zd;
f[Rc + 308 >> 2] = Qd ^ ke;
f[Rc + 176 >> 2] = Td ^ be;
f[Rc + 180 >> 2] = Jd ^ fe;
f[Rc + 312 >> 2] = Id ^ Sd;
f[Rc + 316 >> 2] = Qd ^ $d;
f[Rc + 184 >> 2] = Uc ^ Td;
f[Rc + 188 >> 2] = Hd ^ Jd
}
U = ae + 32 | 0;
return Vd
}
function jc(Rc, Uc, vd) {
var Hd = 0
, le = 0
, me = 0
, ne = 0
, oe = 0
, pe = 0
, qe = 0
, re = 0
, se = 0;
oe = g[Uc + 15 | 0];
le = ((oe & 15) << 3) + Rc | 0;
Hd = le - -64 | 0;
pe = f[Hd >> 2];
me = f[Hd + 4 >> 2];
ne = f[le + 192 >> 2];
Hd = f[le + 196 >> 2];
qe = 15;
while (1) {
re = (oe & 240) >>> 4;
a: {
if ((qe | 0) == 15) {
oe = pe;
break a
}
se = ((oe & 15) << 3) + Rc | 0;
le = se - -64 | 0;
oe = f[le >> 2] ^ ((me & 15) << 28 | pe >>> 4);
me = f[le + 4 >> 2] ^ (ne << 28 | me >>> 4);
ne = f[se + 192 >> 2] ^ ((Hd & 15) << 28 | ne >>> 4);
le = ((pe & 15) << 3) + 11680 | 0;
le;
Hd = f[se + 196 >> 2] ^ (f[le >> 2] << 16 ^ Hd >>> 4)
}
re = (re << 3) + Rc | 0;
le = re - -64 | 0;
pe = f[le >> 2] ^ ((me & 15) << 28 | oe >>> 4);
me = f[le + 4 >> 2] ^ (ne << 28 | me >>> 4);
ne = f[re + 192 >> 2] ^ ((Hd & 15) << 28 | ne >>> 4);
le = ((oe & 15) << 3) + 11680 | 0;
le;
Hd = f[re + 196 >> 2] ^ (f[le >> 2] << 16 ^ Hd >>> 4);
if (qe) {
qe = qe + -1 | 0;
oe = g[qe + Uc | 0];
continue
}
break
}
d[vd + 15 | 0] = pe;
d[vd + 7 | 0] = ne;
d[vd + 14 | 0] = (me & 255) << 24 | pe >>> 8;
d[vd + 13 | 0] = (me & 65535) << 16 | pe >>> 16;
d[vd + 12 | 0] = (me & 16777215) << 8 | pe >>> 24;
d[vd + 11 | 0] = me;
d[vd + 10 | 0] = me >>> 8;
d[vd + 9 | 0] = me >>> 16;
d[vd + 8 | 0] = me >>> 24;
d[vd + 6 | 0] = (Hd & 255) << 24 | ne >>> 8;
d[vd + 5 | 0] = (Hd & 65535) << 16 | ne >>> 16;
d[vd + 4 | 0] = (Hd & 16777215) << 8 | ne >>> 24;
d[vd + 3 | 0] = Hd;
d[vd + 2 | 0] = Hd >>> 8;
d[vd + 1 | 0] = Hd >>> 16;
d[vd | 0] = Hd >>> 24
}
function kc(Rc, Uc, vd, te) {
var ue = 0
, ve = 0
, we = 0
, xe = 0
, ye = 0
, ze = 0
, Ae = 0;
xe = U - 32 | 0;
U = xe;
f[xe + 12 >> 2] = 0;
a: {
if (te >>> 0 > vd >>> 0) {
we = -20;
if (te - vd >>> 0 < Uc >>> 0) {
break a
}
}
we = -20;
ye = f[Rc + 324 >> 2];
ue = ye;
Ae = f[Rc + 320 >> 2];
ve = Uc;
ze = Ae + ve | 0;
if (ze >>> 0 < ve >>> 0) {
ue = ue + 1 | 0
}
ve = ze;
if ((ue | 0) == (ye | 0) & ve >>> 0 < Ae >>> 0 | ue >>> 0 < ye >>> 0 | ((ue | 0) == 15 & ve >>> 0 > 4294967264 | ue >>> 0 > 15)) {
break a
}
f[Rc + 320 >> 2] = ve;
f[Rc + 324 >> 2] = ue;
if (Uc) {
ye = Rc + 368 | 0;
Ae = Rc + 352 | 0;
while (1) {
ue = 16;
while (1) {
if (ue >>> 0 >= 13) {
ue = ue + -1 | 0;
we = (ue + Rc | 0) + 352 | 0;
ve = g[we | 0] + 1 | 0;
d[we | 0] = ve;
if ((ve | 0) != (ve & 255)) {
continue
}
}
break
}
ue = 0;
we = Ya(Rc, Ae, 16, xe + 16 | 0, xe + 12 | 0);
if (we) {
break a
}
ve = Uc >>> 0 < 16 ? Uc : 16;
while (1) {
if (!f[Rc + 384 >> 2]) {
we = (Rc + ue | 0) + 368 | 0;
d[we | 0] = g[we | 0] ^ g[vd + ue | 0]
}
we = g[vd + ue | 0] ^ g[(xe + 16 | 0) + ue | 0];
d[te + ue | 0] = we;
if (f[Rc + 384 >> 2] == 1) {
ze = (Rc + ue | 0) + 368 | 0;
d[ze | 0] = we ^ g[ze | 0]
}
ue = ue + 1 | 0;
if (ue >>> 0 < ve >>> 0) {
continue
}
break
}
jc(Rc, ye, ye);
te = te + ve | 0;
vd = vd + ve | 0;
Uc = Uc - ve | 0;
if (Uc) {
continue
}
break
}
}
we = 0
}
U = xe + 32 | 0;
return we
}
function lc(Rc) {
var Uc = 0;
Ka(Rc);
Uc = 392;
while (1) {
d[Rc | 0] = 0;
Rc = Rc + 1 | 0;
Uc = Uc + -1 | 0;
if (Uc) {
continue
}
break
}
}
function mc(Rc, vd, te) {
var Be = 0
, Ce = 0
, De = 0
, Ee = 0
, Fe = 0
, Ge = 0
, He = 0
, Ie = 0;
if (!te) {
return 0
}
De = 57;
while (1) {
Ee = Ce + 2 | 0;
He = De >>> 0 > vd >>> 0 ? vd : De;
if (Ee >>> 0 < He >>> 0) {
while (1) {
Ge = te + Be | 0;
Fe = Rc + Ce | 0;
d[Ge | 0] = g[(g[Fe | 0] >>> 2) + 11888 | 0];
Ie = g[Fe | 0] << 4 & 48;
Fe = Fe + 1 | 0;
d[Ge + 1 | 0] = g[(Ie | g[Fe | 0] >>> 4) + 11888 | 0];
Ee = Rc + Ee | 0;
d[Ge + 2 | 0] = g[(g[Fe | 0] << 2 & 60 | g[Ee | 0] >>> 6) + 11888 | 0];
d[Ge + 3 | 0] = g[(g[Ee | 0] & 63) + 11888 | 0];
Be = Be + 4 | 0;
Ee = Ce + 5 | 0;
Ce = Ce + 3 | 0;
if (Ee >>> 0 < He >>> 0) {
continue
}
break
}
}
if (De >>> 0 < vd >>> 0) {
d[te + Be | 0] = 10;
Be = Be + 1 | 0;
De = He + 57 | 0;
continue
}
break
}
De = Ce + 1 | 0;
a: {
if (De >>> 0 < vd >>> 0) {
vd = te + Be | 0;
Ce = Rc + Ce | 0;
d[vd | 0] = g[(g[Ce | 0] >>> 2) + 11888 | 0];
Rc = Rc + De | 0;
d[vd + 1 | 0] = g[(g[Ce | 0] << 4 & 48 | g[Rc | 0] >>> 4) + 11888 | 0];
d[vd + 2 | 0] = g[(g[Rc | 0] << 2 & 60) + 11888 | 0];
d[(Be + 3 | 0) + te | 0] = 61;
Be = Be + 4 | 0;
break a
}
if (Ce >>> 0 >= vd >>> 0) {
break a
}
vd = te + Be | 0;
Rc = Rc + Ce | 0;
d[vd | 0] = g[(g[Rc | 0] >>> 2) + 11888 | 0];
d[vd + 1 | 0] = g[(g[Rc | 0] << 4 & 48) + 11888 | 0];
d[(Be + 2 | 0) + te | 0] = 61;
d[vd + 3 | 0] = 61;
Be = Be + 4 | 0
}
d[te + Be | 0] = 0;
return Be
}
function nc(Rc, vd) {
var te = 0
, Je = 0
, Ke = 0
, Le = 0
, Me = 0
, Ne = 0;
f[Rc >> 2] = 12016;
te = f[vd + 4 >> 2];
Je = f[vd + 8 >> 2];
f[Rc + 20 >> 2] = 0;
f[Rc + 12 >> 2] = 0;
f[Rc + 16 >> 2] = 0;
f[Rc + 4 >> 2] = te;
f[Rc + 8 >> 2] = Je;
a: {
b: {
te = f[vd + 16 >> 2] - f[vd + 12 >> 2] | 0;
c: {
if (!te) {
break c
}
if ((te | 0) <= -1) {
break b
}
Je = Dd(te);
f[Rc + 12 >> 2] = Je;
Ke = Rc + 16 | 0;
f[Ke >> 2] = Je;
f[Rc + 20 >> 2] = te + Je;
Le = f[vd + 12 >> 2];
te = f[vd + 16 >> 2] - Le | 0;
if ((te | 0) < 1) {
break c
}
Me = Ke,
Ne = Ue(Je, Le, te) + te | 0,
f[Me >> 2] = Ne
}
f[Rc + 24 >> 2] = 0;
f[Rc + 28 >> 2] = 0;
f[Rc + 32 >> 2] = 0;
te = f[vd + 28 >> 2] - f[vd + 24 >> 2] | 0;
d: {
if (!te) {
break d
}
if ((te | 0) <= -1) {
break a
}
Je = Dd(te);
f[Rc + 24 >> 2] = Je;
Ke = Rc + 28 | 0;
f[Ke >> 2] = Je;
f[Rc + 32 >> 2] = te + Je;
Rc = f[vd + 28 >> 2];
vd = f[vd + 24 >> 2];
Rc = Rc - vd | 0;
if ((Rc | 0) < 1) {
break d
}
Me = Ke,
Ne = Ue(Je, vd, Rc) + Rc | 0,
f[Me >> 2] = Ne
}
return
}
Qd();
u()
}
Qd();
u()
}
function oc(Rc, vd, Oe) {
var Pe = 0
, Qe = 0
, Re = 0
, Se = 0;
Pe = U - 131168 | 0;
U = Pe;
Re = f[vd + 4 >> 2];
Se = f[vd + 8 >> 2];
Qe = zc(vd);
Fa(Pe + 131104 | 0);
La(Pe + 131104 | 0, Ia(Re));
Re = f[Qe >> 2];
Wa(Pe + 131104 | 0, Re, f[Qe + 4 >> 2] - Re << 3);
vd = vd + 24 | 0;
Qe = f[vd >> 2];
Xa(Pe + 131104 | 0, Qe, f[vd + 4 >> 2] - Qe | 0);
Oa(Pe + 131104 | 0, Se);
vd = Pe + 131104 | 0;
if (!(!vd | !f[vd >> 2])) {
f[vd + 36 >> 2] = 0
}
Ve(Pe + 65568 | 0, 65536);
vd = g[Oe + 11 | 0];
Qe = vd << 24 >> 24 < 0;
vd = _a(Pe + 131104 | 0, Pe + 131144 | 0, f[Pe + 131160 >> 2], Qe ? f[Oe >> 2] : Oe, Qe ? f[Oe + 4 >> 2] : vd, Pe + 65568 | 0, Pe + 65564 | 0);
Ka(Pe + 131104 | 0);
a: {
b: {
if (vd) {
f[Rc >> 2] = 0;
f[Rc + 4 >> 2] = 0;
f[Rc + 8 >> 2] = 0;
break b
}
vd = mc(Pe + 65568 | 0, f[Pe + 65564 >> 2], Pe + 16 | 0);
f[Pe + 8 >> 2] = 0;
f[Pe >> 2] = 0;
f[Pe + 4 >> 2] = 0;
if (vd >>> 0 >= 4294967280) {
break a
}
c: {
d: {
if (vd >>> 0 >= 11) {
Qe = vd + 16 & -16;
Oe = Dd(Qe);
f[Pe + 8 >> 2] = Qe | -2147483648;
f[Pe >> 2] = Oe;
f[Pe + 4 >> 2] = vd;
break d
}
d[Pe + 11 | 0] = vd;
Oe = Pe;
if (!vd) {
break c
}
}
Qe = vd + (Pe + 16 | 0) | 0;
vd = Pe + 16 | 0;
while (1) {
d[Oe | 0] = g[vd | 0];
Oe = Oe + 1 | 0;
vd = vd + 1 | 0;
if ((Qe | 0) != (vd | 0)) {
continue
}
break
}
}
d[Oe | 0] = 0;
f[Rc + 8 >> 2] = f[Pe + 8 >> 2];
vd = f[Pe + 4 >> 2];
f[Rc >> 2] = f[Pe >> 2];
f[Rc + 4 >> 2] = vd
}
U = Pe + 131168 | 0;
return
}
Fd();
u()
}
function pc(Rc) {
Rc = Rc | 0;
return Rc | 0
}
function qc(Rc) {
Rc = Rc | 0;
Re(Rc)
}
function rc(Rc, vd, Oe) {
vd = f[Oe >> 2];
f[Rc >> 2] = 12376;
Rc = vd + -25700 | 0;
Oc(Rc >>> 12 & 7, Rc >>> 8 & 7, Rc >>> 4 & 7, Rc & 7, Rc >>> 16)
}
function sc() {
a: {
if (d[23848] & 1) {
break a
}
if (!Rd()) {
break a
}
f[5961] = 11964;
Sd()
}
return 23844
}
function tc() {
if (!(d[23840] & 1)) {
a: {
if (d[23848] & 1) {
break a
}
if (!Rd()) {
break a
}
f[5961] = 11964;
Sd()
}
f[5960] = 1
}
}
function uc(Rc, vd, Oe, Te) {
var Ue = 0
, Ve = 0;
Ue = U - 16 | 0;
U = Ue;
f[Rc >> 2] = 12016;
Ve = Rc;
f[Ve + 12 >> 2] = 0;
f[Ve + 16 >> 2] = 0;
f[Ve + 20 >> 2] = 0;
f[Ve + 24 >> 2] = 0;
f[Ve + 28 >> 2] = 0;
f[Ve + 32 >> 2] = 0;
f[Ue + 8 >> 2] = 83886080;
f[Ue >> 2] = 0;
f[Ue + 4 >> 2] = 0;
d[Ue + 5 | 0] = 0;
f[Ue >> 2] = g[12024] | g[12025] << 8 | (g[12026] << 16 | g[12027] << 24);
d[Ue + 4 | 0] = g[12028];
vc(Ve, Oe, Te, vd, Ue);
if (d[Ue + 11 | 0] <= -1) {
Re(f[Ue >> 2])
}
U = Ue + 16 | 0;
return Rc
}
function vc(Rc, vd, Oe, Te, We) {
var Xe = 0
, Ye = 0
, Ze = 0;
Xe = Rc + 12 | 0;
if ((Xe | 0) != (vd | 0)) {
wc(Xe, f[vd >> 2], f[vd + 4 >> 2])
}
vd = Rc + 24 | 0;
if ((vd | 0) != (Oe | 0)) {
wc(vd, f[Oe >> 2], f[Oe + 4 >> 2])
}
Ye = Rc,
Ze = bd(d[Te + 11 | 0] < 0 ? f[Te >> 2] : Te),
f[Ye + 4 >> 2] = Ze;
Oe = g[We + 11 | 0];
vd = Oe << 24 >> 24 < 0;
Oe = vd ? f[We + 4 >> 2] : Oe;
a: {
b: {
c: {
if ((Oe | 0) < 5) {
break c
}
vd = vd ? f[We >> 2] : We;
Xe = vd + Oe | 0;
We = vd;
while (1) {
Oe = Oe + -4 | 0;
if (!Oe) {
break c
}
Oe = fd(We, 112, Oe);
if (!Oe) {
break c
}
if (dd(Oe, 12024, 5)) {
We = Oe + 1 | 0;
Oe = Xe - We | 0;
if ((Oe | 0) >= 5) {
continue
}
break c
}
break
}
if ((Oe | 0) == (Xe | 0)) {
break c
}
if ((Oe - vd | 0) != -1) {
break b
}
}
Oe = g[Te + 11 | 0];
vd = Oe << 24 >> 24 < 0;
Oe = vd ? f[Te + 4 >> 2] : Oe;
if ((Oe | 0) < 5) {
break a
}
vd = vd ? f[Te >> 2] : Te;
Te = vd + Oe | 0;
We = vd;
while (1) {
Oe = Oe + -4 | 0;
if (!Oe) {
break a
}
Oe = fd(We, 80, Oe);
if (!Oe) {
break a
}
if (dd(Oe, 12030, 5)) {
We = Oe + 1 | 0;
Oe = Te - We | 0;
if ((Oe | 0) >= 5) {
continue
}
break a
}
break
}
if ((Oe | 0) == (Te | 0) | (Oe - vd | 0) == -1) {
break a
}
}
f[Rc + 8 >> 2] = 0
}
}
function wc(Rc, vd, Oe) {
var Te = 0
, _e = 0
, $e = 0
, af = 0
, bf = 0;
a: {
$e = Oe - vd | 0;
Te = f[Rc + 8 >> 2];
_e = f[Rc >> 2];
b: {
c: {
if ($e >>> 0 <= Te - _e >>> 0) {
Te = Rc + 4 | 0;
Rc = f[Te >> 2] - _e | 0;
af = $e >>> 0 > Rc >>> 0 ? Rc + vd | 0 : Oe;
bf = af - vd | 0;
if (bf) {
We(_e, vd, bf)
}
if ($e >>> 0 > Rc >>> 0) {
Rc = Oe - af | 0;
if ((Rc | 0) < 1) {
break b
}
Ue(f[Te >> 2], af, Rc);
Rc = Rc + f[Te >> 2] | 0;
break c
}
Rc = _e + bf | 0;
break c
}
if (_e) {
f[Rc + 4 >> 2] = _e;
Re(_e);
f[Rc + 8 >> 2] = 0;
f[Rc >> 2] = 0;
f[Rc + 4 >> 2] = 0;
Te = 0
}
if (($e | 0) <= -1) {
break a
}
Oe = Te << 1;
_e = Te >>> 0 < 1073741823 ? Oe >>> 0 < $e >>> 0 ? $e : Oe : 2147483647;
if ((_e | 0) <= -1) {
break a
}
Oe = Dd(_e);
f[Rc >> 2] = Oe;
Te = Rc + 4 | 0;
f[Te >> 2] = Oe;
f[Rc + 8 >> 2] = Oe + _e;
Rc = Ue(Oe, vd, $e) + $e | 0
}
f[Te >> 2] = Rc
}
return
}
Qd();
u()
}
function xc(Rc) {
Rc = Rc | 0;
var vd = 0;
f[Rc >> 2] = 12016;
vd = f[Rc + 24 >> 2];
if (vd) {
f[Rc + 28 >> 2] = vd;
Re(vd)
}
vd = f[Rc + 12 >> 2];
if (vd) {
f[Rc + 16 >> 2] = vd;
Re(vd)
}
return Rc | 0
}
function yc(Rc) {
Rc = Rc | 0;
var Oe = 0;
f[Rc >> 2] = 12016;
Oe = f[Rc + 24 >> 2];
if (Oe) {
f[Rc + 28 >> 2] = Oe;
Re(Oe)
}
Oe = f[Rc + 12 >> 2];
if (Oe) {
f[Rc + 16 >> 2] = Oe;
Re(Oe)
}
Re(Rc)
}
function zc(Rc) {
return Rc + 12 | 0
}
function Ac(Rc, We) {
var cf = 0
, df = 0
, ef = 0
, ff = 0
, gf = 0
, hf = 0
, jf = 0
, kf = 0;
ff = -1;
cf = ed(Rc);
a: {
if (cf & 1) {
break a
}
gf = (cf | 0) / 2 | 0;
if (cf + 1 >>> 0 >= 3) {
kf = gf << 1;
while (1) {
df = g[Rc + ef | 0];
cf = df + -48 | 0;
b: {
if ((cf & 255) >>> 0 < 10) {
break b
}
if ((df + -97 & 255) >>> 0 <= 5) {
cf = df + -87 | 0;
break b
}
if ((df + -65 & 255) >>> 0 > 5) {
break a
}
cf = df + -55 | 0
}
hf = (ef >>> 1) + We | 0;
jf = cf << 4;
d[hf | 0] = jf;
df = g[(ef | 1) + Rc | 0];
cf = df + -48 | 0;
c: {
if ((cf & 255) >>> 0 < 10) {
break c
}
if ((df + -97 & 255) >>> 0 <= 5) {
cf = df + -87 | 0;
break c
}
if ((df + -65 & 255) >>> 0 > 5) {
break a
}
cf = df + -55 | 0
}
d[hf | 0] = cf | jf;
ef = ef + 2 | 0;
if (ef >>> 0 < kf >>> 0) {
continue
}
break
}
}
ff = gf
}
return ff
}
function Bc(Rc, We) {
var lf = 0
, mf = 0
, nf = 0
, of = 0;
lf = U - 16 | 0;
U = lf;
f[Rc >> 2] = 0;
f[Rc + 4 >> 2] = 0;
f[Rc + 8 >> 2] = 0;
nf = We + 4 | 0;
mf = g[We + 11 | 0];
if (mf << 24 >> 24 < 0 ? f[nf >> 2] : mf) {
mf = 0;
while (1) {
Jd(lf, We, mf, 2);
Od(Rc, $c(d[lf + 11 | 0] < 0 ? f[lf >> 2] : lf) << 24 >> 24);
if (d[lf + 11 | 0] <= -1) {
Re(f[lf >> 2])
}
mf = mf + 2 | 0;
of = g[We + 11 | 0];
if (mf >>> 0 < (of << 24 >> 24 < 0 ? f[nf >> 2] : of) >>> 0) {
continue
}
break
}
}
U = lf + 16 | 0
}
function Cc(Rc, We, pf) {
Rc = Rc | 0;
We = We | 0;
pf = pf | 0;
var qf = 0
, rf = 0
, sf = 0
, tf = 0
, uf = 0
, vf = 0
, wf = 0
, xf = 0
, yf = 0
, zf = 0
, Af = 0
, Bf = 0
, Cf = 0
, Df = 0;
qf = U - 288 | 0;
U = qf;
rf = d[pf + 11 | 0];
a: {
if ((rf | 0) <= -1) {
sf = f[pf + 4 >> 2];
rf = f[pf >> 2];
break a
}
sf = rf & 255;
rf = pf
}
b: {
if (!sf) {
break b
}
sf = (rf + sf | 0) + -1 | 0;
if (sf >>> 0 <= rf >>> 0) {
break b
}
while (1) {
uf = g[rf | 0];
d[rf | 0] = g[sf | 0];
d[sf | 0] = uf;
rf = rf + 1 | 0;
sf = sf + -1 | 0;
if (rf >>> 0 < sf >>> 0) {
continue
}
break
}
}
Bc(qf + 40 | 0, pf);
c: {
if (d[pf + 11 | 0] >= 0) {
d[pf + 11 | 0] = 0;
d[pf | 0] = 0;
break c
}
d[f[pf >> 2]] = 0;
f[pf + 4 >> 2] = 0;
if (d[pf + 11 | 0] > -1) {
break c
}
Re(f[pf >> 2]);
f[pf + 8 >> 2] = 0
}
f[pf + 8 >> 2] = f[qf + 48 >> 2];
rf = f[qf + 44 >> 2];
f[pf >> 2] = f[qf + 40 >> 2];
f[pf + 4 >> 2] = rf;
uf = g[pf + 11 | 0];
if (uf << 24 >> 24 <= -1) {
uf = f[pf + 4 >> 2]
}
f[qf + 280 >> 2] = 0;
f[qf + 272 >> 2] = 0;
f[qf + 276 >> 2] = 0;
d: {
if ((uf | 0) < 1) {
sf = 0;
rf = 0;
pf = 0;
break d
}
rf = 0;
while (1) {
Jd(qf + 40 | 0, pf, rf, 4);
e: {
if (d[qf + 51 | 0] >= 0) {
sf = bd(qf + 40 | 0);
break e
}
vf = f[qf + 40 >> 2];
sf = bd(vf);
Re(vf)
}
vf = rf + 4 | 0;
rf = Jd(qf + 40 | 0, pf, vf, sf);
sf = f[qf + 276 >> 2];
f: {
if ((sf | 0) != f[qf + 280 >> 2]) {
Hd(sf, rf);
f[qf + 276 >> 2] = f[qf + 276 >> 2] + 12;
break f
}
Dc(qf + 272 | 0, rf)
}
rf = d[qf + 51 | 0];
g: {
if ((rf | 0) >= 0) {
sf = rf & 255;
break g
}
sf = f[qf + 44 >> 2];
Re(f[qf + 40 >> 2])
}
rf = sf + vf | 0;
if ((rf | 0) < (uf | 0)) {
continue
}
break
}
rf = f[qf + 276 >> 2];
sf = f[qf + 272 >> 2];
pf = sf
}
f[Rc >> 2] = 0;
f[Rc + 4 >> 2] = 0;
f[Rc + 8 >> 2] = 0;
h: {
if ((rf - pf | 0) / 12 >>> 0 <= 3) {
Kd(Rc, We);
f[Rc + 12 >> 2] = 0;
break h
}
uf = Hd(qf + 256 | 0, sf);
zf = Hd(qf + 240 | 0, f[qf + 272 >> 2] + 12 | 0);
vf = Hd(qf + 224 | 0, f[qf + 272 >> 2] + 24 | 0);
rf = f[qf + 272 >> 2];
pf = rf + 36 | 0;
if (d[rf + 47 | 0] <= -1) {
pf = f[pf >> 2]
}
Bf = bd(pf);
f[qf + 216 >> 2] = 0;
f[qf + 208 >> 2] = 0;
f[qf + 212 >> 2] = 0;
i: {
j: {
pf = g[uf + 11 | 0];
if (((pf << 24 >> 24 < 0 ? f[uf + 4 >> 2] : pf) | 0) != 1) {
break j
}
if (Pd(uf)) {
break j
}
Cf = qf,
Df = bd(d[vf + 11 | 0] < 0 ? f[vf >> 2] : qf + 224 | 0),
f[Cf + 40 >> 2] = Df;
rc(qf, sc(), qf + 40 | 0);
Pc(zf, We, qf + 208 | 0);
break i
}
Af = Ac(d[zf + 11 | 0] < 0 ? f[zf >> 2] : qf + 240 | 0, qf + 160 | 0);
f[qf + 152 >> 2] = 0;
f[qf + 144 >> 2] = 0;
f[qf + 148 >> 2] = 0;
k: {
l: {
m: {
n: {
if (!Af) {
break n
}
sf = 0;
rf = 0;
pf = 0;
while (1) {
xf = (qf + 160 | 0) + pf | 0;
o: {
if ((rf | 0) != (sf | 0)) {
d[rf | 0] = g[xf | 0];
f[qf + 148 >> 2] = f[qf + 148 >> 2] + 1;
break o
}
yf = f[qf + 144 >> 2];
sf = sf - yf | 0;
tf = sf + 1 | 0;
if ((tf | 0) <= -1) {
break m
}
wf = sf << 1;
tf = sf >>> 0 < 1073741823 ? wf >>> 0 < tf >>> 0 ? tf : wf : 2147483647;
rf = 0;
p: {
if (!tf) {
break p
}
rf = Dd(tf)
}
wf = rf + sf | 0;
d[wf | 0] = g[xf | 0];
xf = rf + tf | 0;
tf = wf + 1 | 0;
if ((sf | 0) >= 1) {
Ue(rf, yf, sf)
}
f[qf + 152 >> 2] = xf;
f[qf + 148 >> 2] = tf;
f[qf + 144 >> 2] = rf;
if (!yf) {
break o
}
Re(yf)
}
pf = pf + 1 | 0;
if ((Af | 0) == (pf | 0)) {
break n
}
sf = f[qf + 152 >> 2];
rf = f[qf + 148 >> 2];
continue
}
}
sf = 0;
Af = Ac(d[vf + 11 | 0] < 0 ? f[vf >> 2] : qf + 224 | 0, qf + 96 | 0);
f[qf + 88 >> 2] = 0;
f[qf + 80 >> 2] = 0;
f[qf + 84 >> 2] = 0;
if (!Af) {
break k
}
rf = 0;
pf = 0;
while (1) {
xf = (qf + 96 | 0) + pf | 0;
q: {
if ((rf | 0) != (sf | 0)) {
d[rf | 0] = g[xf | 0];
f[qf + 84 >> 2] = f[qf + 84 >> 2] + 1;
break q
}
yf = f[qf + 80 >> 2];
sf = sf - yf | 0;
tf = sf + 1 | 0;
if ((tf | 0) <= -1) {
break l
}
wf = sf << 1;
tf = sf >>> 0 < 1073741823 ? wf >>> 0 < tf >>> 0 ? tf : wf : 2147483647;
rf = 0;
r: {
if (!tf) {
break r
}
rf = Dd(tf)
}
wf = rf + sf | 0;
d[wf | 0] = g[xf | 0];
xf = rf + tf | 0;
tf = wf + 1 | 0;
if ((sf | 0) >= 1) {
Ue(rf, yf, sf)
}
f[qf + 88 >> 2] = xf;
f[qf + 84 >> 2] = tf;
f[qf + 80 >> 2] = rf;
if (!yf) {
break q
}
Re(yf)
}
pf = pf + 1 | 0;
if ((Af | 0) == (pf | 0)) {
break k
}
sf = f[qf + 88 >> 2];
rf = f[qf + 84 >> 2];
continue
}
}
Qd();
u()
}
Qd();
u()
}
sc();
pf = uc(qf, uf, qf + 144 | 0, qf + 80 | 0);
nc(qf + 40 | 0, pf);
xc(pf);
oc(qf, qf + 40 | 0, We);
s: {
if (d[qf + 219 | 0] >= 0) {
d[qf + 219 | 0] = 0;
d[qf + 208 | 0] = 0;
break s
}
d[f[qf + 208 >> 2]] = 0;
f[qf + 212 >> 2] = 0;
if (d[qf + 219 | 0] > -1) {
break s
}
Re(f[qf + 208 >> 2]);
f[qf + 216 >> 2] = 0
}
f[qf + 216 >> 2] = f[qf + 8 >> 2];
We = f[qf + 4 >> 2];
f[qf + 208 >> 2] = f[qf >> 2];
f[qf + 212 >> 2] = We;
xc(qf + 40 | 0);
We = f[qf + 80 >> 2];
if (We) {
f[qf + 84 >> 2] = We;
Re(We)
}
We = f[qf + 144 >> 2];
if (!We) {
break i
}
f[qf + 148 >> 2] = We;
Re(We)
}
Kd(Rc, qf + 208 | 0);
f[Rc + 12 >> 2] = Bf;
if (d[qf + 219 | 0] <= -1) {
Re(f[qf + 208 >> 2])
}
if (d[vf + 11 | 0] <= -1) {
Re(f[vf >> 2])
}
if (d[zf + 11 | 0] <= -1) {
Re(f[zf >> 2])
}
if (d[uf + 11 | 0] > -1) {
break h
}
Re(f[uf >> 2])
}
Rc = f[qf + 272 >> 2];
if (Rc) {
We = Rc;
rf = f[qf + 276 >> 2];
pf = We;
t: {
if ((We | 0) == (rf | 0)) {
break t
}
while (1) {
We = rf + -12 | 0;
if (d[rf + -1 | 0] <= -1) {
Re(f[We >> 2])
}
rf = We;
if ((rf | 0) != (Rc | 0)) {
continue
}
break
}
pf = f[qf + 272 >> 2]
}
We = pf;
f[qf + 276 >> 2] = Rc;
Re(We)
}
U = qf + 288 | 0
}
function Dc(Rc, We) {
var pf = 0
, Ef = 0
, Ff = 0
, Gf = 0
, Hf = 0;
Ff = f[Rc >> 2];
Hf = (f[Rc + 4 >> 2] - Ff | 0) / 12 | 0;
pf = Hf + 1 | 0;
a: {
b: {
c: {
if (pf >>> 0 < 357913942) {
Ff = (f[Rc + 8 >> 2] - Ff | 0) / 12 | 0;
Gf = Ff << 1;
pf = Ff >>> 0 < 178956970 ? Gf >>> 0 < pf >>> 0 ? pf : Gf : 357913941;
Ef = 0;
d: {
if (!pf) {
break d
}
if (pf >>> 0 >= 357913942) {
break c
}
Ef = Dd(l(pf, 12))
}
Ff = Ef + l(pf, 12) | 0;
We = Hd(Ef + l(Hf, 12) | 0, We);
Hf = We + 12 | 0;
pf = f[Rc + 4 >> 2];
Ef = f[Rc >> 2];
if ((pf | 0) == (Ef | 0)) {
break b
}
while (1) {
pf = pf + -12 | 0;
Gf = f[pf + 4 >> 2];
We = We + -12 | 0;
f[We >> 2] = f[pf >> 2];
f[We + 4 >> 2] = Gf;
Gf = pf + 8 | 0;
f[We + 8 >> 2] = f[Gf >> 2];
f[pf >> 2] = 0;
f[pf + 4 >> 2] = 0;
f[Gf >> 2] = 0;
if ((pf | 0) != (Ef | 0)) {
continue
}
break
}
Ef = f[Rc + 4 >> 2];
pf = f[Rc >> 2];
break a
}
Qd();
u()
}
Mc(12105);
u()
}
pf = Ef
}
f[Rc >> 2] = We;
f[Rc + 8 >> 2] = Ff;
f[Rc + 4 >> 2] = Hf;
if ((pf | 0) != (Ef | 0)) {
while (1) {
Rc = Ef + -12 | 0;
if (d[Ef + -1 | 0] <= -1) {
Re(f[Rc >> 2])
}
Ef = Rc;
if ((Rc | 0) != (pf | 0)) {
continue
}
break
}
}
if (pf) {
Re(pf)
}
}
function Ec() {
var Rc = 0
, We = 0;
x(12188, 12066, 12196, 63, 12198, 64);
Rc = Dd(4);
f[Rc >> 2] = 0;
We = Dd(4);
f[We >> 2] = 0;
y(12188, 12077, 12312, 12336, 65, Rc | 0, 12312, 12340, 66, We | 0);
Rc = Dd(4);
f[Rc >> 2] = 12;
We = Dd(4);
f[We >> 2] = 12;
y(12188, 12082, 13232, 12336, 67, Rc | 0, 13232, 12340, 68, We | 0);
z(12188);
A(12090, 3, 12348, 12360, 69, 70)
}
function Fc() {
var If = 0;
If = Dd(16);
f[If >> 2] = 0;
f[If + 4 >> 2] = 0;
f[If + 8 >> 2] = 0;
f[If + 12 >> 2] = 0;
return If | 0
}
function Gc(Jf) {
Jf = Jf | 0;
if (Jf) {
if (d[Jf + 11 | 0] <= -1) {
Re(f[Jf >> 2])
}
Re(Jf)
}
}
function Hc(Jf, Kf) {
Jf = Jf | 0;
Kf = Kf | 0;
var Lf = 0;
Kf = f[Jf >> 2] + Kf | 0;
Jf = d[Kf + 11 | 0];
a: {
if ((Jf | 0) <= -1) {
Jf = f[Kf + 4 >> 2];
Lf = Qe(Jf + 4 | 0);
f[Lf >> 2] = Jf;
Kf = f[Kf >> 2];
break a
}
Jf = Jf & 255;
Lf = Qe(Jf + 4 | 0);
f[Lf >> 2] = Jf
}
Ue(Lf + 4 | 0, Kf, Jf);
return Lf | 0
}
function Ic(Jf, Kf, Mf) {
Jf = Jf | 0;
Kf = Kf | 0;
Mf = Mf | 0;
var Nf = 0
, Of = 0
, Pf = 0
, Qf = 0;
Nf = U - 16 | 0;
U = Nf;
Of = f[Mf >> 2];
f[Nf + 8 >> 2] = 0;
f[Nf >> 2] = 0;
f[Nf + 4 >> 2] = 0;
if (Of >>> 0 < 4294967280) {
a: {
b: {
if (Of >>> 0 >= 11) {
Qf = Of + 16 & -16;
Pf = Dd(Qf);
f[Nf + 8 >> 2] = Qf | -2147483648;
f[Nf >> 2] = Pf;
f[Nf + 4 >> 2] = Of;
break b
}
d[Nf + 11 | 0] = Of;
Pf = Nf;
if (!Of) {
break a
}
}
Ue(Pf, Mf + 4 | 0, Of)
}
d[Of + Pf | 0] = 0;
Kf = f[Jf >> 2] + Kf | 0;
c: {
if (d[Kf + 11 | 0] >= 0) {
d[Kf + 11 | 0] = 0;
d[Kf | 0] = 0;
break c
}
d[f[Kf >> 2]] = 0;
f[Kf + 4 >> 2] = 0;
if (d[Kf + 11 | 0] > -1) {
break c
}
Re(f[Kf >> 2]);
f[Kf + 8 >> 2] = 0
}
Jf = f[Nf + 4 >> 2];
f[Kf >> 2] = f[Nf >> 2];
f[Kf + 4 >> 2] = Jf;
f[Kf + 8 >> 2] = f[Nf + 8 >> 2];
U = Nf + 16 | 0;
return
}
Fd();
u()
}
function Jc(Jf, Kf) {
Jf = Jf | 0;
Kf = Kf | 0;
return f[f[Jf >> 2] + Kf >> 2]
}
function Kc(Jf, Kf, Mf) {
Jf = Jf | 0;
Kf = Kf | 0;
Mf = Mf | 0;
f[f[Jf >> 2] + Kf >> 2] = Mf
}
function Lc(Jf, Kf, Mf) {
Jf = Jf | 0;
Kf = Kf | 0;
Mf = Mf | 0;
var Rf = 0
, Sf = 0
, Tf = 0
, Uf = 0;
Rf = U - 48 | 0;
U = Rf;
Uf = f[Kf >> 2];
f[Rf + 24 >> 2] = 0;
f[Rf + 16 >> 2] = 0;
f[Rf + 20 >> 2] = 0;
a: {
if (Uf >>> 0 < 4294967280) {
b: {
c: {
if (Uf >>> 0 >= 11) {
Sf = Uf + 16 & -16;
Tf = Dd(Sf);
f[Rf + 24 >> 2] = Sf | -2147483648;
f[Rf + 16 >> 2] = Tf;
f[Rf + 20 >> 2] = Uf;
break c
}
d[Rf + 27 | 0] = Uf;
Tf = Rf + 16 | 0;
if (!Uf) {
break b
}
}
Ue(Tf, Kf + 4 | 0, Uf)
}
d[Tf + Uf | 0] = 0;
Sf = f[Mf >> 2];
f[Rf + 8 >> 2] = 0;
f[Rf >> 2] = 0;
f[Rf + 4 >> 2] = 0;
if (Sf >>> 0 >= 4294967280) {
break a
}
d: {
e: {
if (Sf >>> 0 >= 11) {
Kf = Sf + 16 & -16;
Tf = Dd(Kf);
f[Rf + 8 >> 2] = Kf | -2147483648;
f[Rf >> 2] = Tf;
f[Rf + 4 >> 2] = Sf;
break e
}
d[Rf + 11 | 0] = Sf;
Tf = Rf;
if (!Sf) {
break d
}
}
Ue(Tf, Mf + 4 | 0, Sf)
}
d[Sf + Tf | 0] = 0;
c[Jf](Rf + 32 | 0, Rf + 16 | 0, Rf);
Mf = Dd(16);
Kf = Rf + 40 | 0;
f[Mf + 8 >> 2] = f[Kf >> 2];
Jf = f[Rf + 36 >> 2];
f[Mf >> 2] = f[Rf + 32 >> 2];
f[Mf + 4 >> 2] = Jf;
f[Kf >> 2] = 0;
f[Rf + 32 >> 2] = 0;
f[Rf + 36 >> 2] = 0;
f[Mf + 12 >> 2] = f[Rf + 44 >> 2];
if (d[Rf + 11 | 0] <= -1) {
Re(f[Rf >> 2])
}
if (d[Rf + 27 | 0] <= -1) {
Re(f[Rf + 16 >> 2])
}
U = Rf + 48 | 0;
return Mf | 0
}
Fd();
u()
}
Fd();
u()
}
function Mc(Jf) {
var Kf = 0;
Kf = B(8) | 0;
f[Kf >> 2] = 12796;
f[Kf >> 2] = 12840;
Ed(Kf + 4 | 0, Jf);
f[Kf >> 2] = 12888;
C(Kf | 0, 12920, 71);
u()
}
function Nc(Jf, Mf, Vf) {
Jf = Jf | 0;
Mf = Mf | 0;
Vf = Vf | 0;
return (g[23853] ? ((Jf + Mf >>> (7 - h[11930] >> 1) ^ Vf >>> h[11929]) & 63) + (Jf << h[11928] ^ Mf >>> h[11927]) | 0 : 0) | 0
}
function Oc(Jf, Mf, Vf, Wf, Xf) {
if ((Xf | 0) == 1) {
d[23853] = 1;
e[11927] = Jf & 7;
e[11928] = Mf & 7;
e[11929] = Vf & 7;
e[11930] = Wf & 7;
return
}
e[11930] = 0;
d[23853] = 0;
e[11929] = 0;
e[11928] = 0;
e[11927] = 0
}
function Pc(Jf, Mf, Vf) {
var Wf = 0
, Xf = 0
, Yf = 0;
Wf = U - 131088 | 0;
U = Wf;
f[Wf + 12 >> 2] = 0;
Xf = g[Mf + 11 | 0];
Yf = Xf << 24 >> 24 < 0;
Jf = Qc(Yf ? f[Mf >> 2] : Mf, Yf ? f[Mf + 4 >> 2] : Xf, d[Jf + 11 | 0] < 0 ? f[Jf >> 2] : Jf, Wf + 12 | 0);
if (Jf) {
Ld(Vf, Wf + 16 | 0, mc(Jf, f[Wf + 12 >> 2], Wf + 16 | 0));
Re(Jf)
}
U = Wf + 131088 | 0
}
function Qc(Jf, Mf, Vf, Zf) {
var _f = 0
, $f = 0
, ag = 0
, bg = 0
, cg = 0
, dg = 0
, eg = 0
, fg = 0
, gg = 0
, hg = 0
, ig = 0
, jg = 0
, kg = 0;
$f = U - 16 | 0;
U = $f;
_f = g[Vf + 4 | 0] | g[Vf + 5 | 0] << 8 | (g[Vf + 6 | 0] << 16 | g[Vf + 7 | 0] << 24);
cg = g[Vf | 0] | g[Vf + 1 | 0] << 8 | (g[Vf + 2 | 0] << 16 | g[Vf + 3 | 0] << 24);
f[$f >> 2] = cg;
f[$f + 4 >> 2] = _f;
_f = g[Vf + 12 | 0] | g[Vf + 13 | 0] << 8 | (g[Vf + 14 | 0] << 16 | g[Vf + 15 | 0] << 24);
f[$f + 8 >> 2] = g[Vf + 8 | 0] | g[Vf + 9 | 0] << 8 | (g[Vf + 10 | 0] << 16 | g[Vf + 11 | 0] << 24);
f[$f + 12 >> 2] = _f;
_f = 0;
a: {
b: {
if (!(cg & 255)) {
break b
}
_f = 1;
if (!g[$f + 1 | 0]) {
break b
}
_f = 2;
if (!g[$f + 2 | 0]) {
break b
}
_f = 3;
if (!g[$f + 3 | 0]) {
break b
}
_f = 4;
if (!g[$f + 4 | 0]) {
break b
}
_f = 5;
if (!g[$f + 5 | 0]) {
break b
}
_f = 6;
if (!g[$f + 6 | 0]) {
break b
}
_f = 7;
if (!g[$f + 7 | 0]) {
break b
}
_f = 8;
if (!g[$f + 8 | 0]) {
break b
}
_f = 9;
if (!g[$f + 9 | 0]) {
break b
}
_f = 10;
if (!g[$f + 10 | 0]) {
break b
}
_f = 11;
if (!g[$f + 11 | 0]) {
break b
}
_f = 12;
if (!g[$f + 12 | 0]) {
break b
}
_f = 13;
if (!g[$f + 13 | 0]) {
break b
}
if (g[$f + 14 | 0]) {
break a
}
_f = 14
}
Ve((_f | $f) + 1 | 0, _f ^ 15)
}
c: {
if (!Mf) {
Vf = 0;
break c
}
Vf = 0;
dg = (Mf >>> 2) + ((Mf & 3) != 0) | 0;
gg = dg + 1 | 0;
_f = Se(gg, 4);
if (!_f) {
break c
}
eg = _f + (dg << 2) | 0;
f[eg >> 2] = Mf;
bg = Ue(_f, Jf, Mf);
ag = Se(4, 4);
if (ag) {
Jf = f[$f + 4 >> 2];
f[ag >> 2] = f[$f >> 2];
f[ag + 4 >> 2] = Jf;
Jf = f[$f + 12 >> 2];
f[ag + 8 >> 2] = f[$f + 8 >> 2];
f[ag + 12 >> 2] = Jf;
if (dg) {
ig = dg & 3;
Vf = (52 / (gg >>> 0) | 0) + 5 | 0;
Mf = f[eg >> 2];
Jf = 0;
while (1) {
_f = Vf;
Jf = Jf + -1640531527 | 0;
hg = Jf >>> 2 & 3;
Vf = 0;
while (1) {
cg = Vf + 1 | 0;
fg = f[(cg << 2) + bg >> 2];
Mf = (f[((Vf & 3 ^ hg) << 2) + ag >> 2] ^ Mf) + (fg ^ Jf) ^ c[72](Mf, fg, Jf) ^ (fg << 2 ^ Mf >>> 5) + (Mf << 4 ^ fg >>> 3);
Vf = (Vf << 2) + bg | 0;
Mf = Mf + f[Vf >> 2] | 0;
f[Vf >> 2] = Mf;
Vf = cg;
if ((dg | 0) != (Vf | 0)) {
continue
}
break
}
Vf = f[bg >> 2];
Mf = ((f[((hg ^ ig) << 2) + ag >> 2] ^ Mf) + (Vf ^ Jf) ^ c[72](Mf, Vf, Jf) ^ (Vf << 2 ^ Mf >>> 5) + (Mf << 4 ^ Vf >>> 3)) + f[eg >> 2] | 0;
f[eg >> 2] = Mf;
Vf = _f + -1 | 0;
if (_f) {
continue
}
break
}
}
Jf = gg << 2;
Vf = Qe(Jf | 1);
jg = Ue(Vf, bg, Jf) + Jf | 0,
kg = 0,
d[jg | 0] = kg;
f[Zf >> 2] = Jf;
Re(bg);
Re(ag);
break c
}
Re(bg)
}
U = $f + 16 | 0;
return Vf
}
function Rc(Jf) {
Jf = Jf | 0
}
function Sc(Jf) {
Jf = Jf | 0;
var Mf = 0;
if (Jf) {
if (f[Jf + 76 >> 2] <= -1) {
return Tc(Jf) | 0
}
return Tc(Jf) | 0
}
if (f[3766]) {
Mf = Sc(f[3766])
}
E(23864);
Jf = f[5968];
if (Jf) {
while (1) {
if (i[Jf + 20 >> 2] > i[Jf + 28 >> 2]) {
Mf = Tc(Jf) | Mf
}
Jf = f[Jf + 56 >> 2];
if (Jf) {
continue
}
break
}
}
F(23864);
return Mf | 0
}
function Tc(Jf) {
var Vf = 0
, Zf = 0;
a: {
if (i[Jf + 20 >> 2] <= i[Jf + 28 >> 2]) {
break a
}
c[f[Jf + 36 >> 2]](Jf, 0, 0) | 0;
if (f[Jf + 20 >> 2]) {
break a
}
return -1
}
Vf = f[Jf + 4 >> 2];
Zf = f[Jf + 8 >> 2];
if (Vf >>> 0 < Zf >>> 0) {
Vf = Vf - Zf | 0;
c[f[Jf + 40 >> 2]](Jf, Vf, Vf >> 31, 1) | 0
}
f[Jf + 28 >> 2] = 0;
f[Jf + 16 >> 2] = 0;
f[Jf + 20 >> 2] = 0;
f[Jf + 4 >> 2] = 0;
f[Jf + 8 >> 2] = 0;
return 0
}
function Uc(Jf, lg, mg) {
Jf = Jf | 0;
lg = lg | 0;
mg = mg | 0;
var ng = 0
, og = 0
, pg = 0
, qg = 0
, rg = 0
, sg = 0;
og = U - 32 | 0;
U = og;
ng = f[Jf + 28 >> 2];
f[og + 16 >> 2] = ng;
qg = f[Jf + 20 >> 2];
f[og + 28 >> 2] = mg;
f[og + 24 >> 2] = lg;
lg = qg - ng | 0;
f[og + 20 >> 2] = lg;
qg = lg + mg | 0;
rg = 2;
lg = og + 16 | 0;
while (1) {
a: {
pg = D(f[Jf + 60 >> 2], lg | 0, rg | 0, og + 12 | 0) | 0;
ng = 0;
b: {
if (!pg) {
break b
}
f[6230] = pg;
ng = -1
}
c: {
if (ng) {
f[og + 12 >> 2] = -1;
ng = -1;
break c
}
ng = f[og + 12 >> 2]
}
d: {
if ((ng | 0) == (qg | 0)) {
lg = f[Jf + 44 >> 2];
f[Jf + 28 >> 2] = lg;
f[Jf + 20 >> 2] = lg;
f[Jf + 16 >> 2] = lg + f[Jf + 48 >> 2];
Jf = mg;
break d
}
if ((ng | 0) > -1) {
break a
}
f[Jf + 28 >> 2] = 0;
f[Jf + 16 >> 2] = 0;
f[Jf + 20 >> 2] = 0;
f[Jf >> 2] = f[Jf >> 2] | 32;
Jf = 0;
if ((rg | 0) == 2) {
break d
}
Jf = mg - f[lg + 4 >> 2] | 0
}
U = og + 32 | 0;
return Jf | 0
}
pg = f[lg + 4 >> 2];
sg = ng >>> 0 > pg >>> 0;
lg = sg ? lg + 8 | 0 : lg;
pg = ng - (sg ? pg : 0) | 0;
f[lg >> 2] = pg + f[lg >> 2];
f[lg + 4 >> 2] = f[lg + 4 >> 2] - pg;
qg = qg - ng | 0;
rg = rg - sg | 0;
continue
}
}
function Vc(Jf) {
var lg = 0
, mg = 0;
lg = g[Jf + 74 | 0];
d[Jf + 74 | 0] = lg + -1 | lg;
if (i[Jf + 20 >> 2] > i[Jf + 28 >> 2]) {
c[f[Jf + 36 >> 2]](Jf, 0, 0) | 0
}
f[Jf + 28 >> 2] = 0;
f[Jf + 16 >> 2] = 0;
f[Jf + 20 >> 2] = 0;
lg = f[Jf >> 2];
if (lg & 4) {
f[Jf >> 2] = lg | 32;
return -1
}
mg = f[Jf + 44 >> 2] + f[Jf + 48 >> 2] | 0;
f[Jf + 8 >> 2] = mg;
f[Jf + 4 >> 2] = mg;
return lg << 27 >> 31
}
function Wc(Jf) {
var tg = 0
, ug = 0;
tg = U - 16 | 0;
U = tg;
ug = -1;
a: {
if (Vc(Jf)) {
break a
}
if ((c[f[Jf + 32 >> 2]](Jf, tg + 15 | 0, 1) | 0) != 1) {
break a
}
ug = g[tg + 15 | 0]
}
U = tg + 16 | 0;
return ug
}
function Xc(Jf) {
Jf = Jf | 0;
return 0
}
function Yc(Jf, vg, wg, xg) {
Jf = Jf | 0;
vg = vg | 0;
wg = wg | 0;
xg = xg | 0;
W = 0;
return 0
}
function Zc() {
return 24920
}
function _c(Jf) {
return Jf + -48 >>> 0 < 10
}
function $c(Jf) {
var vg = 0;
vg = U - 144 | 0;
U = vg;
f[vg + 44 >> 2] = Jf;
f[vg + 4 >> 2] = Jf;
f[vg >> 2] = 0;
f[vg + 76 >> 2] = -1;
f[vg + 8 >> 2] = (Jf | 0) < 0 ? -1 : Jf + 2147483647 | 0;
hd(vg);
Jf = gd(vg);
U = vg + 144 | 0;
return Jf
}
function ad(Jf) {
return (Jf | 0) == 32 | Jf + -9 >>> 0 < 5
}
function bd(Jf) {
var wg = 0
, xg = 0
, yg = 0
, zg = 0
, Ag = 0
, Bg = 0;
while (1) {
wg = Jf;
Jf = wg + 1 | 0;
if (ad(d[wg | 0])) {
continue
}
break
}
xg = d[wg | 0];
zg = xg + -43 | 0;
a: {
if (zg >>> 0 > 2) {
break a
}
b: {
switch (zg - 1 | 0) {
case 1:
Ag = 1;
break;
case 0:
break a;
default:
break b
}
}
xg = d[Jf | 0];
wg = Jf;
Bg = Ag
}
if (_c(xg)) {
while (1) {
yg = (l(yg, 10) - d[wg | 0] | 0) + 48 | 0;
Jf = d[wg + 1 | 0];
wg = wg + 1 | 0;
if (_c(Jf)) {
continue
}
break
}
}
return Bg ? yg : 0 - yg | 0
}
function cd(Jf, Cg) {
var Dg = 0
, Eg = 0;
Dg = g[Jf | 0];
Eg = g[Cg | 0];
a: {
if (!Dg | (Dg | 0) != (Eg | 0)) {
break a
}
while (1) {
Eg = g[Cg + 1 | 0];
Dg = g[Jf + 1 | 0];
if (!Dg) {
break a
}
Cg = Cg + 1 | 0;
Jf = Jf + 1 | 0;
if ((Dg | 0) == (Eg | 0)) {
continue
}
break
}
}
return Dg - Eg | 0
}
function dd(Jf, Cg, Fg) {
var Gg = 0
, Hg = 0
, Ig = 0;
a: {
if (!Fg) {
break a
}
while (1) {
Gg = g[Jf | 0];
Hg = g[Cg | 0];
if ((Gg | 0) == (Hg | 0)) {
Cg = Cg + 1 | 0;
Jf = Jf + 1 | 0;
Fg = Fg + -1 | 0;
if (Fg) {
continue
}
break a
}
break
}
Ig = Gg - Hg | 0
}
return Ig
}
function ed(Jf) {
var Cg = 0
, Fg = 0
, Jg = 0;
a: {
b: {
Cg = Jf;
if (!(Cg & 3)) {
break b
}
if (!g[Jf | 0]) {
break a
}
while (1) {
Cg = Cg + 1 | 0;
if (!(Cg & 3)) {
break b
}
if (g[Cg | 0]) {
continue
}
break
}
break a
}
while (1) {
Fg = Cg;
Cg = Cg + 4 | 0;
Jg = f[Fg >> 2];
if (!((Jg ^ -1) & Jg + -16843009 & -2139062144)) {
continue
}
break
}
if (!(Jg & 255)) {
Cg = Fg;
break a
}
while (1) {
Jg = g[Fg + 1 | 0];
Cg = Fg + 1 | 0;
Fg = Cg;
if (Jg) {
continue
}
break
}
}
return Cg - Jf | 0
}
function fd(Jf, Kg, Lg) {
var Mg = 0
, Ng = 0
, Og = 0
, Pg = 0;
Mg = (Lg | 0) != 0;
a: {
b: {
c: {
d: {
if (!Lg | !(Jf & 3)) {
break d
}
Ng = Kg & 255;
while (1) {
if ((Ng | 0) == g[Jf | 0]) {
break c
}
Jf = Jf + 1 | 0;
Lg = Lg + -1 | 0;
Mg = (Lg | 0) != 0;
if (!Lg) {
break d
}
if (Jf & 3) {
continue
}
break
}
}
if (!Mg) {
break b
}
}
if (g[Jf | 0] == (Kg & 255)) {
break a
}
e: {
if (Lg >>> 0 >= 4) {
Pg = l(Kg & 255, 16843009);
Mg = Lg + -4 | 0;
Ng = Mg & -4;
Mg = Mg - Ng | 0;
Ng = (Jf + Ng | 0) + 4 | 0;
while (1) {
Og = Pg ^ f[Jf >> 2];
if ((Og ^ -1) & Og + -16843009 & -2139062144) {
break e
}
Jf = Jf + 4 | 0;
Lg = Lg + -4 | 0;
if (Lg >>> 0 > 3) {
continue
}
break
}
Lg = Mg;
Jf = Ng
}
if (!Lg) {
break b
}
}
Kg = Kg & 255;
while (1) {
if ((Kg | 0) == g[Jf | 0]) {
break a
}
Jf = Jf + 1 | 0;
Lg = Lg + -1 | 0;
if (Lg) {
continue
}
break
}
}
return 0
}
return Jf
}
function gd(Jf) {
var Kg = 0
, Lg = 0
, Qg = 0
, Rg = 0
, Sg = 0
, Tg = 0
, Ug = 0
, Vg = 0
, Wg = 0
, Xg = 0
, Yg = 0
, Zg = 0
, _g = 0
, $g = 0
, ah = 0;
Tg = -2147483648;
Wg = U - 16 | 0;
U = Wg;
while (1) {
Kg = f[Jf + 4 >> 2];
a: {
if (Kg >>> 0 < i[Jf + 104 >> 2]) {
f[Jf + 4 >> 2] = Kg + 1;
Kg = g[Kg | 0];
break a
}
Kg = id(Jf)
}
if (ad(Kg)) {
continue
}
break
}
Sg = Kg + -43 | 0;
b: {
if (Sg >>> 0 > 2 | !(Sg - 1)) {
break b
}
Xg = (Kg | 0) == 45 ? -1 : 0;
Kg = f[Jf + 4 >> 2];
if (Kg >>> 0 < i[Jf + 104 >> 2]) {
f[Jf + 4 >> 2] = Kg + 1;
Kg = g[Kg | 0];
break b
}
Kg = id(Jf)
}
c: {
d: {
if ((Kg | 0) == 48) {
Kg = f[Jf + 4 >> 2];
e: {
if (Kg >>> 0 < i[Jf + 104 >> 2]) {
f[Jf + 4 >> 2] = Kg + 1;
Kg = g[Kg | 0];
break e
}
Kg = id(Jf)
}
if ((Kg | 32) == 120) {
Kg = f[Jf + 4 >> 2];
f: {
if (Kg >>> 0 < i[Jf + 104 >> 2]) {
f[Jf + 4 >> 2] = Kg + 1;
Kg = g[Kg | 0];
break f
}
Kg = id(Jf)
}
if (g[Kg + 12417 | 0] < 16) {
break d
}
Kg = f[Jf + 104 >> 2];
if (Kg) {
f[Jf + 4 >> 2] = f[Jf + 4 >> 2] + -1
}
Tg = 0;
if (!Kg) {
break c
}
f[Jf + 4 >> 2] = f[Jf + 4 >> 2] + -1;
break c
}
break d
}
if (16 > g[Kg + 12417 | 0]) {
break d
}
if (f[Jf + 104 >> 2]) {
f[Jf + 4 >> 2] = f[Jf + 4 >> 2] + -1
}
Tg = 0;
hd(Jf);
f[6230] = 28;
break c
}
Ug = d[12676];
Zg = Ug;
Sg = Ug;
Lg = Sg & 31;
if (32 <= (Sg & 63) >>> 0) {
Sg = 0;
Vg = -1 >>> Lg
} else {
Sg = -1 >>> Lg;
Vg = (1 << Lg) - 1 << 32 - Lg | -1 >>> Lg
}
_g = Vg;
Yg = Sg;
Lg = g[Kg + 12417 | 0];
if (16 > Lg >>> 0) {
while (1) {
Qg = Qg << Ug | Lg;
$g = Qg >>> 0 <= 134217727;
Kg = f[Jf + 4 >> 2];
g: {
if (Kg >>> 0 < i[Jf + 104 >> 2]) {
f[Jf + 4 >> 2] = Kg + 1;
Kg = g[Kg | 0];
break g
}
Kg = id(Jf)
}
Lg = g[Kg + 12417 | 0];
if (16 > Lg >>> 0 ? $g : 0) {
continue
}
break
}
}
h: {
if (!Yg & _g >>> 0 < Qg >>> 0 | Yg >>> 0 < 0 | 16 <= Lg >>> 0) {
break h
}
while (1) {
Ug = Lg & 255;
Lg = Qg;
Kg = Zg;
Qg = Kg & 31;
if (32 <= (Kg & 63) >>> 0) {
Rg = Lg << Qg;
Kg = 0
} else {
Rg = (1 << Qg) - 1 & Lg >>> 32 - Qg | Rg << Qg;
Kg = Lg << Qg
}
Qg = Ug | Kg;
Kg = f[Jf + 4 >> 2];
i: {
if (Kg >>> 0 < i[Jf + 104 >> 2]) {
f[Jf + 4 >> 2] = Kg + 1;
Kg = g[Kg | 0];
break i
}
Kg = id(Jf)
}
if ((Rg | 0) == (Sg | 0) & Qg >>> 0 > Vg >>> 0 | Rg >>> 0 > Sg >>> 0) {
break h
}
Lg = g[Kg + 12417 | 0];
if (16 > Lg >>> 0) {
continue
}
break
}
}
if (16 > g[Kg + 12417 | 0]) {
while (1) {
Kg = f[Jf + 4 >> 2];
j: {
if (Kg >>> 0 < i[Jf + 104 >> 2]) {
f[Jf + 4 >> 2] = Kg + 1;
Kg = g[Kg | 0];
break j
}
Kg = id(Jf)
}
if (16 > g[Kg + 12417 | 0]) {
continue
}
break
}
f[6230] = 68;
Qg = -2147483648;
Rg = 0
}
if (f[Jf + 104 >> 2]) {
f[Jf + 4 >> 2] = f[Jf + 4 >> 2] + -1
}
k: {
if (!Rg & Qg >>> 0 < 2147483648 | Rg >>> 0 < 0) {
break k
}
if (!Xg) {
f[6230] = 68;
Tg = 2147483647;
break c
}
if (!Rg & Qg >>> 0 <= 2147483648 | Rg >>> 0 < 0) {
break k
}
f[6230] = 68;
break c
}
Jf = Xg;
Kg = Jf ^ Qg;
Tg = Kg - Jf | 0;
Sg = Rg;
Rg = Jf >> 31;
ah = (Sg ^ Rg) - (Rg + (Kg >>> 0 < Jf >>> 0) | 0) | 0
}
U = Wg + 16 | 0;
W = ah;
return Tg
}
function hd(Jf) {
var bh = 0
, ch = 0;
f[Jf + 112 >> 2] = 0;
f[Jf + 116 >> 2] = 0;
bh = f[Jf + 8 >> 2];
ch = bh - f[Jf + 4 >> 2] | 0;
f[Jf + 120 >> 2] = ch;
f[Jf + 124 >> 2] = ch >> 31;
f[Jf + 104 >> 2] = bh
}
function id(Jf) {
var dh = 0
, eh = 0
, fh = 0
, gh = 0
, hh = 0
, ih = 0
, jh = 0;
dh = f[Jf + 116 >> 2];
eh = dh;
a: {
hh = f[Jf + 112 >> 2];
b: {
if (dh | hh) {
dh = f[Jf + 124 >> 2];
if ((dh | 0) > (eh | 0) ? 1 : (dh | 0) >= (eh | 0) ? i[Jf + 120 >> 2] < hh >>> 0 ? 0 : 1 : 0) {
break b
}
}
hh = Wc(Jf);
if ((hh | 0) > -1) {
break a
}
}
f[Jf + 104 >> 2] = 0;
return -1
}
dh = f[Jf + 8 >> 2];
eh = f[Jf + 116 >> 2];
gh = eh;
c: {
d: {
fh = f[Jf + 112 >> 2];
if (!(eh | fh)) {
break d
}
eh = (f[Jf + 124 >> 2] ^ -1) + gh | 0;
gh = f[Jf + 120 >> 2] ^ -1;
fh = gh + fh | 0;
if (fh >>> 0 < gh >>> 0) {
eh = eh + 1 | 0
}
gh = fh;
fh = f[Jf + 4 >> 2];
ih = dh - fh | 0;
jh = gh >>> 0 < ih >>> 0 ? 0 : 1;
ih = ih >> 31;
if ((eh | 0) > (ih | 0) ? 1 : (eh | 0) >= (ih | 0) ? jh : 0) {
break d
}
f[Jf + 104 >> 2] = gh + fh;
break c
}
f[Jf + 104 >> 2] = dh
}
e: {
if (!dh) {
dh = f[Jf + 4 >> 2];
break e
}
eh = Jf;
gh = dh;
dh = f[Jf + 4 >> 2];
fh = (gh - dh | 0) + 1 | 0;
gh = fh + f[Jf + 120 >> 2] | 0;
Jf = f[Jf + 124 >> 2] + (fh >> 31) | 0;
f[eh + 120 >> 2] = gh;
f[eh + 124 >> 2] = gh >>> 0 < fh >>> 0 ? Jf + 1 | 0 : Jf
}
Jf = dh + -1 | 0;
if (g[Jf | 0] != (hh | 0)) {
d[Jf | 0] = hh
}
return hh
}
function jd() {
return 0
}
function kd(Jf, kh, lh) {
if (lh) {
Ue(Jf, kh, lh)
}
}
function ld(Jf, kh) {
return md(Jf, kh)
}
function md(Jf, kh) {
var lh = 0
, mh = 0;
lh = U - 16 | 0;
U = lh;
mh = nd(Jf, kh);
U = lh + 16 | 0;
return mh ? kh : Jf
}
function nd(Jf, kh) {
return i[Jf >> 2] < i[kh >> 2]
}
function od() {
var Jf = 0
, kh = 0
, nh = 0;
Jf = U - 16 | 0;
U = Jf;
a: {
if (G(Jf + 12 | 0, Jf + 8 | 0)) {
break a
}
kh = Qe((f[Jf + 12 >> 2] << 2) + 4 | 0);
f[6231] = kh;
if (!kh) {
break a
}
b: {
kh = Qe(f[Jf + 8 >> 2]);
if (kh) {
nh = f[6231];
if (nh) {
break b
}
}
f[6231] = 0;
break a
}
f[(f[Jf + 12 >> 2] << 2) + nh >> 2] = 0;
if (!H(f[6231], kh | 0)) {
break a
}
f[6231] = 0
}
U = Jf + 16 | 0
}
function pd(oh) {
if (qd(oh)) {
return f[oh + 4 >> 2]
}
return g[oh + 11 | 0]
}
function qd(oh) {
return d[oh + 11 | 0] < 0
}
function rd(oh) {
return f[oh + 8 >> 2] & 2147483647
}
function sd(oh) {
if (qd(oh)) {
return f[oh >> 2]
}
return oh
}
function td(oh, ph) {
d[oh | 0] = g[ph | 0]
}
function ud(oh, ph) {
f[oh + 4 >> 2] = ph
}
function vd(oh, ph) {
d[oh + 11 | 0] = ph
}
function wd(oh, ph) {
return xd(oh, ph)
}
function xd(oh, ph) {
var qh = 0
, rh = 0;
qh = U - 16 | 0;
U = qh;
rh = nd(ph, oh);
U = qh + 16 | 0;
return rh ? ph : oh
}
function yd(oh) {
var ph = 0;
if (oh >>> 0 >= 11) {
ph = oh + 16 & -16;
oh = ph + -1 | 0;
oh = (oh | 0) == 11 ? ph : oh
} else {
oh = 10
}
return oh
}
function zd(oh) {
if (4294967295 < oh >>> 0) {
Mc(12682);
u()
}
return Dd(oh)
}
function Ad(oh, sh) {
f[oh >> 2] = sh
}
function Bd(oh, sh) {
f[oh + 8 >> 2] = sh | -2147483648
}
function Cd(oh) {
f[oh >> 2] = 0;
f[oh + 4 >> 2] = 0;
f[oh + 8 >> 2] = 0;
return oh
}
function Dd(oh) {
var sh = 0
, th = 0;
oh = oh ? oh : 1;
while (1) {
a: {
sh = Qe(oh);
if (sh) {
break a
}
th = f[6232];
if (!th) {
break a
}
c[th]();
continue
}
break
}
return sh
}
function Ed(oh, uh) {
var vh = 0
, wh = 0
, xh = 0
, yh = 0;
vh = ed(uh);
wh = Dd(vh + 13 | 0);
f[wh + 8 >> 2] = 0;
f[wh + 4 >> 2] = vh;
f[wh >> 2] = vh;
xh = oh,
yh = Ue(zc(wh), uh, vh + 1 | 0),
f[xh >> 2] = yh
}
function Fd() {
Mc(12750);
u()
}
function Gd() {
I();
u()
}
function Hd(oh, uh) {
var zh = 0
, Ah = 0
, Bh = 0;
Ah = U - 16 | 0;
U = Ah;
zh = Cd(oh);
a: {
if (!qd(uh)) {
f[zh + 8 >> 2] = f[uh + 8 >> 2];
Bh = f[uh + 4 >> 2];
f[zh >> 2] = f[uh >> 2];
f[zh + 4 >> 2] = Bh;
break a
}
Id(oh, f[uh >> 2], f[uh + 4 >> 2])
}
U = Ah + 16 | 0;
return oh
}
function Id(oh, uh, Ch) {
var Dh = 0
, Eh = 0
, Fh = 0;
Dh = U - 16 | 0;
U = Dh;
if (4294967279 >= Ch >>> 0) {
a: {
if (Ch >>> 0 <= 10) {
vd(oh, Ch);
Eh = oh;
break a
}
Fh = yd(Ch) + 1 | 0;
Eh = zd(Fh);
Ad(oh, Eh);
Bd(oh, Fh);
ud(oh, Ch)
}
kd(Eh, uh, Ch);
d[Dh + 15 | 0] = 0;
td(Ch + Eh | 0, Dh + 15 | 0);
U = Dh + 16 | 0;
return
}
Fd();
u()
}
function Jd(oh, uh, Ch, Gh) {
var Hh = 0;
Hh = U - 16 | 0;
U = Hh;
f[Hh + 12 >> 2] = Gh;
Cd(oh);
Gh = pd(uh);
if (Gh >>> 0 < Ch >>> 0) {
Gd();
u()
}
uh = sd(uh);
f[Hh + 8 >> 2] = Gh - Ch;
Id(oh, uh + Ch | 0, f[wd(Hh + 12 | 0, Hh + 8 | 0) >> 2]);
U = Hh + 16 | 0;
return oh
}
function Kd(oh, uh) {
if ((oh | 0) != (uh | 0)) {
Ld(oh, sd(uh), pd(uh))
}
}
function Ld(oh, uh, Ch) {
var Gh = 0
, Ih = 0
, Jh = 0
, Kh = 0;
Ih = U - 16 | 0;
U = Ih;
Gh = oh;
if (qd(oh)) {
Gh = rd(Gh) + -1 | 0
} else {
Gh = 10
}
a: {
if (Gh >>> 0 >= Ch >>> 0) {
Jh = sd(oh);
Kh = Jh;
Gh = Ch;
if (Ch) {
We(Kh, uh, Gh)
}
d[Ih + 15 | 0] = 0;
td(Ch + Jh | 0, Ih + 15 | 0);
b: {
if (qd(oh)) {
ud(oh, Ch);
break b
}
vd(oh, Ch)
}
break a
}
Jh = oh;
oh = pd(oh);
Md(Jh, Gh, Ch - Gh | 0, oh, oh, Ch, uh)
}
U = Ih + 16 | 0
}
function Md(oh, uh, Ch, Lh, Mh, Nh, Oh) {
var Ph = 0
, Qh = 0
, Rh = 0;
Ph = U - 16 | 0;
U = Ph;
if ((uh ^ -1) + -17 >>> 0 >= Ch >>> 0) {
Qh = sd(oh);
a: {
if (2147483623 > uh >>> 0) {
f[Ph + 8 >> 2] = uh << 1;
f[Ph + 12 >> 2] = uh + Ch;
Ch = yd(f[ld(Ph + 12 | 0, Ph + 8 | 0) >> 2]);
break a
}
Ch = -18
}
Rh = Ch + 1 | 0;
Ch = zd(Rh);
if (Nh) {
kd(Ch, Oh, Nh)
}
Lh = Lh - Mh | 0;
Oh = Lh;
if (Lh) {
kd(Ch + Nh | 0, Mh + Qh | 0, Oh)
}
if ((uh | 0) != 10) {
Re(Qh)
}
Ad(oh, Ch);
Bd(oh, Rh);
uh = oh;
oh = Lh + Nh | 0;
ud(uh, oh);
d[Ph + 7 | 0] = 0;
td(oh + Ch | 0, Ph + 7 | 0);
U = Ph + 16 | 0;
return
}
Fd();
u()
}
function Nd(oh, uh, Ch, Lh) {
var Mh = 0
, Nh = 0
, Oh = 0
, Sh = 0;
Mh = U - 16 | 0;
U = Mh;
if (-17 - uh >>> 0 >= 1) {
Oh = sd(oh);
a: {
if (2147483623 > uh >>> 0) {
f[Mh + 8 >> 2] = uh << 1;
f[Mh + 12 >> 2] = uh + 1;
Nh = yd(f[ld(Mh + 12 | 0, Mh + 8 | 0) >> 2]);
break a
}
Nh = -18
}
Sh = Nh + 1 | 0;
Nh = zd(Sh);
if (Lh) {
kd(Nh, Oh, Lh)
}
Ch = Ch - Lh | 0;
if (Ch) {
kd(Lh + Nh | 0, Lh + Oh | 0, Ch)
}
if ((uh | 0) != 10) {
Re(Oh)
}
Ad(oh, Nh);
Bd(oh, Sh);
U = Mh + 16 | 0;
return
}
Fd();
u()
}
function Od(oh, uh) {
var Ch = 0
, Lh = 0
, Th = 0;
Ch = U - 16 | 0;
U = Ch;
d[Ch + 15 | 0] = uh;
Th = qd(oh);
a: {
if (!Th) {
uh = 10;
Lh = g[oh + 11 | 0];
break a
}
uh = rd(oh) + -1 | 0;
Lh = f[oh + 4 >> 2]
}
b: {
c: {
d: {
if ((uh | 0) == (Lh | 0)) {
Nd(oh, uh, uh, uh);
if (!qd(oh)) {
break d
}
break c
}
if (Th) {
break c
}
}
uh = oh;
vd(oh, Lh + 1 | 0);
break b
}
uh = f[oh >> 2];
ud(oh, Lh + 1 | 0)
}
oh = uh + Lh | 0;
td(oh, Ch + 15 | 0);
d[Ch + 14 | 0] = 0;
td(oh + 1 | 0, Ch + 14 | 0);
U = Ch + 16 | 0
}
function Pd(oh) {
var uh = 0
, Uh = 0
, Vh = 0
, Wh = 0
, Xh = 0;
uh = U - 16 | 0;
U = uh;
f[uh + 8 >> 2] = 1;
f[uh + 12 >> 2] = -1;
Uh = pd(oh);
if (Uh >>> 0 >= 0) {
f[uh >> 2] = Uh;
Wh = uh,
Xh = f[wd(uh + 12 | 0, uh) >> 2],
f[Wh + 4 >> 2] = Xh;
Uh = sd(oh);
Vh = f[wd(uh + 4 | 0, uh + 8 | 0) >> 2];
oh = 0;
a: {
if (!Vh) {
break a
}
oh = dd(Uh, 12064, Vh)
}
b: {
if (oh) {
break b
}
oh = -1;
Uh = f[uh + 4 >> 2];
Vh = f[uh + 8 >> 2];
if (Uh >>> 0 < Vh >>> 0) {
break b
}
oh = Uh >>> 0 > Vh >>> 0
}
U = uh + 16 | 0;
return oh
}
Gd();
u()
}
function Qd() {
Mc(12763);
u()
}
function Rd() {
return g[23848] != 0 ^ 1
}
function Sd() {
f[5962] = 0;
f[5962] = f[5962] | 1
}
function Td(oh) {
oh = oh | 0;
return 12770
}
function Ud(oh) {
oh = oh | 0;
f[oh >> 2] = 12840;
Vd(oh + 4 | 0);
return oh | 0
}
function Vd(oh) {
var Yh = 0
, Zh = 0;
Yh = f[oh >> 2] + -12 | 0;
Zh = Yh + 8 | 0;
oh = f[Zh >> 2] + -1 | 0;
f[Zh >> 2] = oh;
if ((oh | 0) <= -1) {
Re(Yh)
}
}
function Wd(oh) {
oh = oh | 0;
Re(Ud(oh))
}
function Xd(oh) {
oh = oh | 0;
return f[oh + 4 >> 2]
}
function Yd(oh) {
oh = oh | 0;
Ud(oh);
Re(oh)
}
function Zd(oh, _h, $h) {
oh = oh | 0;
_h = _h | 0;
$h = $h | 0;
return _d(oh, _h, 0) | 0
}
function _d(oh, _h, $h) {
if (!$h) {
return (oh | 0) == (_h | 0)
}
return !cd(f[oh + 4 >> 2], f[_h + 4 >> 2])
}
function $d(oh, _h, $h) {
oh = oh | 0;
_h = _h | 0;
$h = $h | 0;
var ai = 0
, bi = 0;
ai = U + -64 | 0;
U = ai;
bi = 1;
a: {
if (_d(oh, _h, 0)) {
break a
}
bi = 0;
if (!_h) {
break a
}
_h = ae(_h);
bi = 0;
if (!_h) {
break a
}
f[ai + 20 >> 2] = -1;
f[ai + 16 >> 2] = oh;
f[ai + 12 >> 2] = 0;
f[ai + 8 >> 2] = _h;
Ve(ai + 24 | 0, 39);
f[ai + 56 >> 2] = 1;
c[f[f[_h >> 2] + 28 >> 2]](_h, ai + 8 | 0, f[$h >> 2], 1);
bi = 0;
if (f[ai + 32 >> 2] != 1) {
break a
}
f[$h >> 2] = f[ai + 24 >> 2];
bi = 1
}
U = ai - -64 | 0;
return bi | 0
}
function ae(oh) {
var _h = 0
, $h = 0
, ci = 0
, di = 0;
_h = U + -64 | 0;
U = _h;
$h = f[oh >> 2];
di = f[$h + -8 >> 2];
$h = f[$h + -4 >> 2];
f[_h + 20 >> 2] = 0;
f[_h + 16 >> 2] = 12992;
f[_h + 12 >> 2] = oh;
f[_h + 8 >> 2] = 13040;
Ve(_h + 24 | 0, 39);
oh = oh + di | 0;
a: {
if (_d($h, 13040, 0)) {
f[_h + 56 >> 2] = 1;
c[f[f[$h >> 2] + 20 >> 2]]($h, _h + 8 | 0, oh, oh, 1, 0);
ci = f[_h + 32 >> 2] == 1 ? oh : 0;
break a
}
c[f[f[$h >> 2] + 24 >> 2]]($h, _h + 8 | 0, oh, 1, 0);
oh = f[_h + 44 >> 2];
if (oh >>> 0 > 1) {
break a
}
if (oh - 1) {
ci = f[_h + 48 >> 2] == 1 ? f[_h + 36 >> 2] == 1 ? f[_h + 40 >> 2] == 1 ? f[_h + 28 >> 2] : 0 : 0 : 0;
break a
}
if (f[_h + 32 >> 2] != 1) {
if (f[_h + 48 >> 2] | f[_h + 36 >> 2] != 1 | f[_h + 40 >> 2] != 1) {
break a
}
}
ci = f[_h + 24 >> 2]
}
U = _h - -64 | 0;
return ci
}
function be(oh, ei, fi) {
var gi = 0;
gi = f[oh + 16 >> 2];
if (!gi) {
f[oh + 36 >> 2] = 1;
f[oh + 24 >> 2] = fi;
f[oh + 16 >> 2] = ei;
return
}
a: {
if ((ei | 0) == (gi | 0)) {
if (f[oh + 24 >> 2] != 2) {
break a
}
f[oh + 24 >> 2] = fi;
return
}
d[oh + 54 | 0] = 1;
f[oh + 24 >> 2] = 2;
f[oh + 36 >> 2] = f[oh + 36 >> 2] + 1
}
}
function ce(oh, ei, fi, hi) {
oh = oh | 0;
ei = ei | 0;
fi = fi | 0;
hi = hi | 0;
if (_d(oh, f[ei + 8 >> 2], 0)) {
be(ei, fi, hi)
}
}
function de(oh, ei, fi, hi) {
oh = oh | 0;
ei = ei | 0;
fi = fi | 0;
hi = hi | 0;
if (_d(oh, f[ei + 8 >> 2], 0)) {
be(ei, fi, hi);
return
}
oh = f[oh + 8 >> 2];
c[f[f[oh >> 2] + 28 >> 2]](oh, ei, fi, hi)
}
function ee(oh, ei, fi, hi) {
var ii = 0
, ji = 0
, ki = 0
, li = 0;
ji = f[oh + 4 >> 2];
oh = f[oh >> 2];
ki = oh;
li = ei;
ii = 0;
a: {
if (!fi) {
break a
}
ei = ji >> 8;
ii = ei;
if (!(ji & 1)) {
break a
}
ii = f[ei + f[fi >> 2] >> 2]
}
c[f[f[oh >> 2] + 28 >> 2]](ki, li, ii + fi | 0, ji & 2 ? hi : 2)
}
function fe(oh, ei, fi, hi) {
oh = oh | 0;
ei = ei | 0;
fi = fi | 0;
hi = hi | 0;
var mi = 0
, ni = 0;
if (_d(oh, f[ei + 8 >> 2], 0)) {
be(ei, fi, hi);
return
}
mi = f[oh + 12 >> 2];
ni = oh + 16 | 0;
ee(ni, ei, fi, hi);
a: {
if ((mi | 0) < 2) {
break a
}
mi = (mi << 3) + ni | 0;
oh = oh + 24 | 0;
while (1) {
ee(oh, ei, fi, hi);
if (g[ei + 54 | 0]) {
break a
}
oh = oh + 8 | 0;
if (oh >>> 0 < mi >>> 0) {
continue
}
break
}
}
}
function ge(oh, ei, fi, hi) {
d[oh + 53 | 0] = 1;
a: {
if (f[oh + 4 >> 2] != (fi | 0)) {
break a
}
d[oh + 52 | 0] = 1;
fi = f[oh + 16 >> 2];
if (!fi) {
f[oh + 36 >> 2] = 1;
f[oh + 24 >> 2] = hi;
f[oh + 16 >> 2] = ei;
if ((hi | 0) != 1 | f[oh + 48 >> 2] != 1) {
break a
}
d[oh + 54 | 0] = 1;
return
}
if ((ei | 0) == (fi | 0)) {
fi = f[oh + 24 >> 2];
if ((fi | 0) == 2) {
f[oh + 24 >> 2] = hi;
fi = hi
}
if (f[oh + 48 >> 2] != 1 | (fi | 0) != 1) {
break a
}
d[oh + 54 | 0] = 1;
return
}
d[oh + 54 | 0] = 1;
f[oh + 36 >> 2] = f[oh + 36 >> 2] + 1
}
}
function he(oh, ei, fi) {
if (!(f[oh + 28 >> 2] == 1 | f[oh + 4 >> 2] != (ei | 0))) {
f[oh + 28 >> 2] = fi
}
}
function ie(oh, ei, fi, hi, oi) {
oh = oh | 0;
ei = ei | 0;
fi = fi | 0;
hi = hi | 0;
oi = oi | 0;
var pi = 0
, qi = 0
, ri = 0
, si = 0
, ti = 0;
if (_d(oh, f[ei + 8 >> 2], oi)) {
he(ei, fi, hi);
return
}
a: {
if (_d(oh, f[ei >> 2], oi)) {
if (!(f[ei + 20 >> 2] != (fi | 0) ? f[ei + 16 >> 2] != (fi | 0) : 0)) {
if ((hi | 0) != 1) {
break a
}
f[ei + 32 >> 2] = 1;
return
}
f[ei + 32 >> 2] = hi;
if (f[ei + 44 >> 2] != 4) {
pi = oh + 16 | 0;
si = pi + (f[oh + 12 >> 2] << 3) | 0;
ti = ei;
b: {
c: {
while (1) {
d: {
if (pi >>> 0 >= si >>> 0) {
break d
}
e[ei + 52 >> 1] = 0;
je(pi, ei, fi, fi, 1, oi);
if (g[ei + 54 | 0]) {
break d
}
e: {
if (!g[ei + 53 | 0]) {
break e
}
if (g[ei + 52 | 0]) {
hi = 1;
if (f[ei + 24 >> 2] == 1) {
break c
}
ri = 1;
qi = 1;
if (g[oh + 8 | 0] & 2) {
break e
}
break c
}
ri = 1;
hi = qi;
if (!(d[oh + 8 | 0] & 1)) {
break c
}
}
pi = pi + 8 | 0;
continue
}
break
}
hi = qi;
oh = 4;
if (!ri) {
break b
}
}
oh = 3
}
f[ti + 44 >> 2] = oh;
if (hi & 1) {
break a
}
}
f[ei + 20 >> 2] = fi;
f[ei + 40 >> 2] = f[ei + 40 >> 2] + 1;
if (f[ei + 36 >> 2] != 1 | f[ei + 24 >> 2] != 2) {
break a
}
d[ei + 54 | 0] = 1;
return
}
qi = f[oh + 12 >> 2];
pi = oh + 16 | 0;
ke(pi, ei, fi, hi, oi);
if ((qi | 0) < 2) {
break a
}
qi = pi + (qi << 3) | 0;
pi = oh + 24 | 0;
oh = f[oh + 8 >> 2];
if (!(f[ei + 36 >> 2] != 1 ? !(oh & 2) : 0)) {
while (1) {
if (g[ei + 54 | 0]) {
break a
}
ke(pi, ei, fi, hi, oi);
pi = pi + 8 | 0;
if (pi >>> 0 < qi >>> 0) {
continue
}
break
}
break a
}
if (!(oh & 1)) {
while (1) {
if (g[ei + 54 | 0] | f[ei + 36 >> 2] == 1) {
break a
}
ke(pi, ei, fi, hi, oi);
pi = pi + 8 | 0;
if (pi >>> 0 < qi >>> 0) {
continue
}
break a
}
}
while (1) {
if (g[ei + 54 | 0] | (f[ei + 24 >> 2] == 1 ? f[ei + 36 >> 2] == 1 : 0)) {
break a
}
ke(pi, ei, fi, hi, oi);
pi = pi + 8 | 0;
if (pi >>> 0 < qi >>> 0) {
continue
}
break
}
}
}
function je(oh, ei, fi, hi, oi, ui) {
var vi = 0
, wi = 0
, xi = 0;
vi = f[oh + 4 >> 2];
wi = vi >> 8;
oh = f[oh >> 2];
xi = oh;
if (vi & 1) {
wi = f[f[hi >> 2] + wi >> 2]
}
c[f[f[oh >> 2] + 20 >> 2]](xi, ei, fi, hi + wi | 0, vi & 2 ? oi : 2, ui)
}
function ke(oh, ei, fi, hi, oi) {
var ui = 0
, yi = 0
, zi = 0;
ui = f[oh + 4 >> 2];
yi = ui >> 8;
oh = f[oh >> 2];
zi = oh;
if (ui & 1) {
yi = f[f[fi >> 2] + yi >> 2]
}
c[f[f[oh >> 2] + 24 >> 2]](zi, ei, fi + yi | 0, ui & 2 ? hi : 2, oi)
}
function le(oh, ei, fi, hi, oi) {
oh = oh | 0;
ei = ei | 0;
fi = fi | 0;
hi = hi | 0;
oi = oi | 0;
if (_d(oh, f[ei + 8 >> 2], oi)) {
he(ei, fi, hi);
return
}
a: {
if (_d(oh, f[ei >> 2], oi)) {
if (!(f[ei + 20 >> 2] != (fi | 0) ? f[ei + 16 >> 2] != (fi | 0) : 0)) {
if ((hi | 0) != 1) {
break a
}
f[ei + 32 >> 2] = 1;
return
}
f[ei + 32 >> 2] = hi;
b: {
if (f[ei + 44 >> 2] == 4) {
break b
}
e[ei + 52 >> 1] = 0;
oh = f[oh + 8 >> 2];
c[f[f[oh >> 2] + 20 >> 2]](oh, ei, fi, fi, 1, oi);
if (g[ei + 53 | 0]) {
f[ei + 44 >> 2] = 3;
if (!g[ei + 52 | 0]) {
break b
}
break a
}
f[ei + 44 >> 2] = 4
}
f[ei + 20 >> 2] = fi;
f[ei + 40 >> 2] = f[ei + 40 >> 2] + 1;
if (f[ei + 36 >> 2] != 1 | f[ei + 24 >> 2] != 2) {
break a
}
d[ei + 54 | 0] = 1;
return
}
oh = f[oh + 8 >> 2];
c[f[f[oh >> 2] + 24 >> 2]](oh, ei, fi, hi, oi)
}
}
function me(oh, ei, fi, hi, oi) {
oh = oh | 0;
ei = ei | 0;
fi = fi | 0;
hi = hi | 0;
oi = oi | 0;
if (_d(oh, f[ei + 8 >> 2], oi)) {
he(ei, fi, hi);
return
}
a: {
if (!_d(oh, f[ei >> 2], oi)) {
break a
}
if (!(f[ei + 20 >> 2] != (fi | 0) ? f[ei + 16 >> 2] != (fi | 0) : 0)) {
if ((hi | 0) != 1) {
break a
}
f[ei + 32 >> 2] = 1;
return
}
f[ei + 20 >> 2] = fi;
f[ei + 32 >> 2] = hi;
f[ei + 40 >> 2] = f[ei + 40 >> 2] + 1;
if (!(f[ei + 36 >> 2] != 1 | f[ei + 24 >> 2] != 2)) {
d[ei + 54 | 0] = 1
}
f[ei + 44 >> 2] = 4
}
}
function ne(oh, ei, fi, hi, oi, Ai) {
oh = oh | 0;
ei = ei | 0;
fi = fi | 0;
hi = hi | 0;
oi = oi | 0;
Ai = Ai | 0;
var Bi = 0
, Ci = 0
, Di = 0
, Ei = 0
, Fi = 0
, Gi = 0;
if (_d(oh, f[ei + 8 >> 2], Ai)) {
ge(ei, fi, hi, oi);
return
}
Ci = g[ei + 53 | 0];
Bi = f[oh + 12 >> 2];
d[ei + 53 | 0] = 0;
Di = g[ei + 52 | 0];
d[ei + 52 | 0] = 0;
Ei = oh + 16 | 0;
je(Ei, ei, fi, hi, oi, Ai);
Fi = g[ei + 53 | 0];
Ci = Ci | Fi;
Gi = g[ei + 52 | 0];
Di = Di | Gi;
a: {
if ((Bi | 0) < 2) {
break a
}
Ei = Ei + (Bi << 3) | 0;
Bi = oh + 24 | 0;
while (1) {
if (g[ei + 54 | 0]) {
break a
}
b: {
if (Gi) {
if (f[ei + 24 >> 2] == 1) {
break a
}
if (g[oh + 8 | 0] & 2) {
break b
}
break a
}
if (!Fi) {
break b
}
if (!(d[oh + 8 | 0] & 1)) {
break a
}
}
e[ei + 52 >> 1] = 0;
je(Bi, ei, fi, hi, oi, Ai);
Fi = g[ei + 53 | 0];
Ci = Fi | Ci;
Gi = g[ei + 52 | 0];
Di = Gi | Di;
Bi = Bi + 8 | 0;
if (Bi >>> 0 < Ei >>> 0) {
continue
}
break
}
}
d[ei + 53 | 0] = (Ci & 255) != 0;
d[ei + 52 | 0] = (Di & 255) != 0
}
function oe(oh, ei, fi, hi, oi, Ai) {
oh = oh | 0;
ei = ei | 0;
fi = fi | 0;
hi = hi | 0;
oi = oi | 0;
Ai = Ai | 0;
if (_d(oh, f[ei + 8 >> 2], Ai)) {
ge(ei, fi, hi, oi);
return
}
oh = f[oh + 8 >> 2];
c[f[f[oh >> 2] + 20 >> 2]](oh, ei, fi, hi, oi, Ai)
}
function pe(oh, ei, fi, hi, oi, Ai) {
oh = oh | 0;
ei = ei | 0;
fi = fi | 0;
hi = hi | 0;
oi = oi | 0;
Ai = Ai | 0;
if (_d(oh, f[ei + 8 >> 2], Ai)) {
ge(ei, fi, hi, oi)
}
}
function qe(oh) {
var ei = 0
, fi = 0;
ei = ed(oh) + 1 | 0;
fi = Qe(ei);
if (!fi) {
return 0
}
return Ue(fi, oh, ei)
}
function re(oh) {
oh = oh | 0;
var hi = 0;
hi = U - 16 | 0;
U = hi;
f[hi + 12 >> 2] = oh;
oh = qe(f[f[hi + 12 >> 2] + 4 >> 2]);
U = hi + 16 | 0;
return oh | 0
}
function se() {
J(13136, 13512);
K(13148, 13517, 1, 1, 0);
te();
ue();
ve();
we();
xe();
ye();
ze();
Ae();
Be();
Ce();
De();
L(12312, 13623);
L(14336, 13635);
M(14424, 4, 13668);
N(14468, 13681);
Ee();
Fe(13727);
Ge(13764);
He(13803);
Ie(13834);
Je(13874);
Ke(13903);
Le();
Me();
Fe(14010);
Ge(14042);
He(14075);
Ie(14108);
Je(14142);
Ke(14175);
Ne();
Oe()
}
function te() {
var oh = 0;
oh = U - 16 | 0;
U = oh;
f[oh + 12 >> 2] = 13522;
O(13160, f[oh + 12 >> 2], 1, -128, 127);
U = oh + 16 | 0
}
function ue() {
var oi = 0;
oi = U - 16 | 0;
U = oi;
f[oi + 12 >> 2] = 13527;
O(13184, f[oi + 12 >> 2], 1, -128, 127);
U = oi + 16 | 0
}
function ve() {
var Ai = 0;
Ai = U - 16 | 0;
U = Ai;
f[Ai + 12 >> 2] = 13539;
O(13172, f[Ai + 12 >> 2], 1, 0, 255);
U = Ai + 16 | 0
}
function we() {
var Hi = 0;
Hi = U - 16 | 0;
U = Hi;
f[Hi + 12 >> 2] = 13553;
O(13196, f[Hi + 12 >> 2], 2, -32768, 32767);
U = Hi + 16 | 0
}
function xe() {
var Ii = 0;
Ii = U - 16 | 0;
U = Ii;
f[Ii + 12 >> 2] = 13559;
O(13208, f[Ii + 12 >> 2], 2, 0, 65535);
U = Ii + 16 | 0
}
function ye() {
var Ji = 0;
Ji = U - 16 | 0;
U = Ji;
f[Ji + 12 >> 2] = 13574;
O(13220, f[Ji + 12 >> 2], 4, -2147483648, 2147483647);
U = Ji + 16 | 0
}
function ze() {
var Ki = 0;
Ki = U - 16 | 0;
U = Ki;
f[Ki + 12 >> 2] = 13578;
O(13232, f[Ki + 12 >> 2], 4, 0, -1);
U = Ki + 16 | 0
}
function Ae() {
var Li = 0;
Li = U - 16 | 0;
U = Li;
f[Li + 12 >> 2] = 13591;
O(13244, f[Li + 12 >> 2], 4, -2147483648, 2147483647);
U = Li + 16 | 0
}
function Be() {
var Mi = 0;
Mi = U - 16 | 0;
U = Mi;
f[Mi + 12 >> 2] = 13596;
O(13256, f[Mi + 12 >> 2], 4, 0, -1);
U = Mi + 16 | 0
}
function Ce() {
var Ni = 0;
Ni = U - 16 | 0;
U = Ni;
f[Ni + 12 >> 2] = 13610;
P(13268, f[Ni + 12 >> 2], 4);
U = Ni + 16 | 0
}
function De() {
var Oi = 0;
Oi = U - 16 | 0;
U = Oi;
f[Oi + 12 >> 2] = 13616;
P(13280, f[Oi + 12 >> 2], 8);
U = Oi + 16 | 0
}
function Ee() {
var Pi = 0;
Pi = U - 16 | 0;
U = Pi;
f[Pi + 12 >> 2] = 13697;
Q(14508, 0, f[Pi + 12 >> 2]);
U = Pi + 16 | 0
}
function Fe(Qi) {
var Ri = 0;
Ri = U - 16 | 0;
U = Ri;
f[Ri + 12 >> 2] = Qi;
Q(14548, 0, f[Ri + 12 >> 2]);
U = Ri + 16 | 0
}
function Ge(Qi) {
var Si = 0;
Si = U - 16 | 0;
U = Si;
f[Si + 12 >> 2] = Qi;
Q(14588, 1, f[Si + 12 >> 2]);
U = Si + 16 | 0
}
function He(Qi) {
var Ti = 0;
Ti = U - 16 | 0;
U = Ti;
f[Ti + 12 >> 2] = Qi;
Q(14628, 2, f[Ti + 12 >> 2]);
U = Ti + 16 | 0
}
function Ie(Qi) {
var Ui = 0;
Ui = U - 16 | 0;
U = Ui;
f[Ui + 12 >> 2] = Qi;
Q(14668, 3, f[Ui + 12 >> 2]);
U = Ui + 16 | 0
}
function Je(Qi) {
var Vi = 0;
Vi = U - 16 | 0;
U = Vi;
f[Vi + 12 >> 2] = Qi;
Q(14708, 4, f[Vi + 12 >> 2]);
U = Vi + 16 | 0
}
function Ke(Qi) {
var Wi = 0;
Wi = U - 16 | 0;
U = Wi;
f[Wi + 12 >> 2] = Qi;
Q(14748, 5, f[Wi + 12 >> 2]);
U = Wi + 16 | 0
}
function Le() {
var Qi = 0;
Qi = U - 16 | 0;
U = Qi;
f[Qi + 12 >> 2] = 13941;
Q(14788, 4, f[Qi + 12 >> 2]);
U = Qi + 16 | 0
}
function Me() {
var Xi = 0;
Xi = U - 16 | 0;
U = Xi;
f[Xi + 12 >> 2] = 13971;
Q(14828, 5, f[Xi + 12 >> 2]);
U = Xi + 16 | 0
}
function Ne() {
var Yi = 0;
Yi = U - 16 | 0;
U = Yi;
f[Yi + 12 >> 2] = 14209;
Q(14868, 6, f[Yi + 12 >> 2]);
U = Yi + 16 | 0
}
function Oe() {
var Zi = 0;
Zi = U - 16 | 0;
U = Zi;
f[Zi + 12 >> 2] = 14240;
Q(14908, 7, f[Zi + 12 >> 2]);
U = Zi + 16 | 0
}
function Pe(_i) {
_i = _i | 0;
var $i = 0;
$i = U - 16 | 0;
U = $i;
f[$i + 12 >> 2] = _i;
_i = f[$i + 12 >> 2];
se();
U = $i + 16 | 0;
return _i | 0
}
function Qe(_i) {
_i = _i | 0;
var aj = 0
, bj = 0
, cj = 0
, dj = 0
, ej = 0
, fj = 0
, gj = 0
, hj = 0
, ij = 0
, jj = 0
, kj = 0
, lj = 0
, mj = 0;
kj = U - 16 | 0;
U = kj;
a: {
b: {
c: {
d: {
e: {
f: {
g: {
h: {
i: {
j: {
k: {
if (_i >>> 0 <= 244) {
ej = f[6234];
gj = _i >>> 0 < 11 ? 16 : _i + 11 & -8;
aj = gj >>> 3;
_i = ej >>> aj;
if (_i & 3) {
cj = aj + ((_i ^ -1) & 1) | 0;
aj = cj << 3;
dj = f[aj + 24984 >> 2];
_i = dj + 8 | 0;
bj = f[dj + 8 >> 2];
aj = aj + 24976 | 0;
l: {
if ((bj | 0) == (aj | 0)) {
lj = 24936,
mj = tf(-2, cj) & ej,
f[lj >> 2] = mj;
break l
}
f[bj + 12 >> 2] = aj;
f[aj + 8 >> 2] = bj
}
aj = cj << 3;
f[dj + 4 >> 2] = aj | 3;
aj = aj + dj | 0;
f[aj + 4 >> 2] = f[aj + 4 >> 2] | 1;
break a
}
jj = f[6236];
if (gj >>> 0 <= jj >>> 0) {
break k
}
if (_i) {
bj = _i << aj;
_i = 2 << aj;
_i = bj & (0 - _i | _i);
aj = (0 - _i & _i) + -1 | 0;
_i = aj >>> 12 & 16;
bj = _i;
aj = aj >>> _i;
_i = aj >>> 5 & 8;
bj = bj | _i;
aj = aj >>> _i;
_i = aj >>> 2 & 4;
bj = bj | _i;
aj = aj >>> _i;
_i = aj >>> 1 & 2;
bj = bj | _i;
aj = aj >>> _i;
_i = aj >>> 1 & 1;
bj = (bj | _i) + (aj >>> _i) | 0;
_i = bj << 3;
fj = f[_i + 24984 >> 2];
aj = f[fj + 8 >> 2];
_i = _i + 24976 | 0;
m: {
if ((aj | 0) == (_i | 0)) {
ej = tf(-2, bj) & ej;
f[6234] = ej;
break m
}
f[aj + 12 >> 2] = _i;
f[_i + 8 >> 2] = aj
}
_i = fj + 8 | 0;
f[fj + 4 >> 2] = gj | 3;
cj = fj + gj | 0;
aj = bj << 3;
dj = aj - gj | 0;
f[cj + 4 >> 2] = dj | 1;
f[aj + fj >> 2] = dj;
if (jj) {
aj = jj >>> 3;
bj = (aj << 3) + 24976 | 0;
gj = f[6239];
aj = 1 << aj;
n: {
if (!(aj & ej)) {
f[6234] = aj | ej;
aj = bj;
break n
}
aj = f[bj + 8 >> 2]
}
f[bj + 8 >> 2] = gj;
f[aj + 12 >> 2] = gj;
f[gj + 12 >> 2] = bj;
f[gj + 8 >> 2] = aj
}
f[6239] = cj;
f[6236] = dj;
break a
}
hj = f[6235];
if (!hj) {
break k
}
aj = (hj & 0 - hj) + -1 | 0;
_i = aj >>> 12 & 16;
bj = _i;
aj = aj >>> _i;
_i = aj >>> 5 & 8;
bj = bj | _i;
aj = aj >>> _i;
_i = aj >>> 2 & 4;
bj = bj | _i;
aj = aj >>> _i;
_i = aj >>> 1 & 2;
bj = bj | _i;
aj = aj >>> _i;
_i = aj >>> 1 & 1;
aj = f[((bj | _i) + (aj >>> _i) << 2) + 25240 >> 2];
cj = (f[aj + 4 >> 2] & -8) - gj | 0;
bj = aj;
while (1) {
o: {
_i = f[bj + 16 >> 2];
if (!_i) {
_i = f[bj + 20 >> 2];
if (!_i) {
break o
}
}
bj = (f[_i + 4 >> 2] & -8) - gj | 0;
dj = bj >>> 0 < cj >>> 0;
cj = dj ? bj : cj;
aj = dj ? _i : aj;
bj = _i;
continue
}
break
}
ij = f[aj + 24 >> 2];
dj = f[aj + 12 >> 2];
if ((dj | 0) != (aj | 0)) {
_i = f[aj + 8 >> 2];
f[_i + 12 >> 2] = dj;
f[dj + 8 >> 2] = _i;
break b
}
bj = aj + 20 | 0;
_i = f[bj >> 2];
if (!_i) {
_i = f[aj + 16 >> 2];
if (!_i) {
break j
}
bj = aj + 16 | 0
}
while (1) {
fj = bj;
dj = _i;
bj = _i + 20 | 0;
_i = f[bj >> 2];
if (_i) {
continue
}
bj = dj + 16 | 0;
_i = f[dj + 16 >> 2];
if (_i) {
continue
}
break
}
f[fj >> 2] = 0;
break b
}
gj = -1;
if (_i >>> 0 > 4294967231) {
break k
}
_i = _i + 11 | 0;
gj = _i & -8;
hj = f[6235];
if (!hj) {
break k
}
_i = _i >>> 8;
fj = 0;
p: {
if (!_i) {
break p
}
fj = 31;
if (gj >>> 0 > 16777215) {
break p
}
aj = _i + 1048320 >>> 16 & 8;
_i = _i << aj;
cj = _i + 520192 >>> 16 & 4;
_i = _i << cj;
bj = _i + 245760 >>> 16 & 2;
_i = (_i << bj >>> 15) - (bj | (aj | cj)) | 0;
fj = (_i << 1 | gj >>> _i + 21 & 1) + 28 | 0
}
bj = 0 - gj | 0;
cj = f[(fj << 2) + 25240 >> 2];
q: {
r: {
s: {
if (!cj) {
_i = 0;
break s
}
aj = gj << ((fj | 0) == 31 ? 0 : 25 - (fj >>> 1) | 0);
_i = 0;
while (1) {
t: {
ej = (f[cj + 4 >> 2] & -8) - gj | 0;
if (ej >>> 0 >= bj >>> 0) {
break t
}
dj = cj;
bj = ej;
if (bj) {
break t
}
bj = 0;
_i = cj;
break r
}
ej = f[cj + 20 >> 2];
cj = f[((aj >>> 29 & 4) + cj | 0) + 16 >> 2];
_i = ej ? (ej | 0) == (cj | 0) ? _i : ej : _i;
aj = aj << ((cj | 0) != 0);
if (cj) {
continue
}
break
}
}
if (!(_i | dj)) {
_i = 2 << fj;
_i = (0 - _i | _i) & hj;
if (!_i) {
break k
}
aj = (_i & 0 - _i) + -1 | 0;
_i = aj >>> 12 & 16;
cj = _i;
aj = aj >>> _i;
_i = aj >>> 5 & 8;
cj = cj | _i;
aj = aj >>> _i;
_i = aj >>> 2 & 4;
cj = cj | _i;
aj = aj >>> _i;
_i = aj >>> 1 & 2;
cj = cj | _i;
aj = aj >>> _i;
_i = aj >>> 1 & 1;
_i = f[((cj | _i) + (aj >>> _i) << 2) + 25240 >> 2]
}
if (!_i) {
break q
}
}
while (1) {
aj = (f[_i + 4 >> 2] & -8) - gj | 0;
cj = aj >>> 0 < bj >>> 0;
bj = cj ? aj : bj;
dj = cj ? _i : dj;
aj = f[_i + 16 >> 2];
if (aj) {
_i = aj
} else {
_i = f[_i + 20 >> 2]
}
if (_i) {
continue
}
break
}
}
if (!dj | bj >>> 0 >= f[6236] - gj >>> 0) {
break k
}
fj = f[dj + 24 >> 2];
aj = f[dj + 12 >> 2];
if ((dj | 0) != (aj | 0)) {
_i = f[dj + 8 >> 2];
f[_i + 12 >> 2] = aj;
f[aj + 8 >> 2] = _i;
break c
}
cj = dj + 20 | 0;
_i = f[cj >> 2];
if (!_i) {
_i = f[dj + 16 >> 2];
if (!_i) {
break i
}
cj = dj + 16 | 0
}
while (1) {
ej = cj;
aj = _i;
cj = _i + 20 | 0;
_i = f[cj >> 2];
if (_i) {
continue
}
cj = aj + 16 | 0;
_i = f[aj + 16 >> 2];
if (_i) {
continue
}
break
}
f[ej >> 2] = 0;
break c
}
bj = f[6236];
if (bj >>> 0 >= gj >>> 0) {
cj = f[6239];
aj = bj - gj | 0;
u: {
if (aj >>> 0 >= 16) {
f[6236] = aj;
_i = cj + gj | 0;
f[6239] = _i;
f[_i + 4 >> 2] = aj | 1;
f[bj + cj >> 2] = aj;
f[cj + 4 >> 2] = gj | 3;
break u
}
f[6239] = 0;
f[6236] = 0;
f[cj + 4 >> 2] = bj | 3;
_i = bj + cj | 0;
f[_i + 4 >> 2] = f[_i + 4 >> 2] | 1
}
_i = cj + 8 | 0;
break a
}
ij = f[6237];
if (ij >>> 0 > gj >>> 0) {
aj = ij - gj | 0;
f[6237] = aj;
bj = f[6240];
_i = bj + gj | 0;
f[6240] = _i;
f[_i + 4 >> 2] = aj | 1;
f[bj + 4 >> 2] = gj | 3;
_i = bj + 8 | 0;
break a
}
_i = 0;
hj = gj + 47 | 0;
aj = hj;
if (f[6352]) {
bj = f[6354]
} else {
f[6355] = -1;
f[6356] = -1;
f[6353] = 4096;
f[6354] = 4096;
f[6352] = kj + 12 & -16 ^ 1431655768;
f[6357] = 0;
f[6345] = 0;
bj = 4096
}
fj = aj + bj | 0;
ej = 0 - bj | 0;
bj = fj & ej;
if (bj >>> 0 <= gj >>> 0) {
break a
}
dj = f[6344];
if (dj) {
cj = f[6342];
aj = cj + bj | 0;
if (aj >>> 0 <= cj >>> 0 | aj >>> 0 > dj >>> 0) {
break a
}
}
if (g[25380] & 4) {
break f
}
v: {
w: {
cj = f[6240];
if (cj) {
_i = 25384;
while (1) {
aj = f[_i >> 2];
if (aj + f[_i + 4 >> 2] >>> 0 > cj >>> 0 ? aj >>> 0 <= cj >>> 0 : 0) {
break w
}
_i = f[_i + 8 >> 2];
if (_i) {
continue
}
break
}
}
aj = Te(0);
if ((aj | 0) == -1) {
break g
}
ej = bj;
cj = f[6353];
_i = cj + -1 | 0;
if (_i & aj) {
ej = (bj - aj | 0) + (_i + aj & 0 - cj) | 0
}
if (ej >>> 0 <= gj >>> 0 | ej >>> 0 > 2147483646) {
break g
}
dj = f[6344];
if (dj) {
cj = f[6342];
_i = cj + ej | 0;
if (_i >>> 0 <= cj >>> 0 | _i >>> 0 > dj >>> 0) {
break g
}
}
_i = Te(ej);
if ((aj | 0) != (_i | 0)) {
break v
}
break e
}
ej = ej & fj - ij;
if (ej >>> 0 > 2147483646) {
break g
}
aj = Te(ej);
if ((aj | 0) == (f[_i >> 2] + f[_i + 4 >> 2] | 0)) {
break h
}
_i = aj
}
aj = _i;
if (!(gj + 48 >>> 0 <= ej >>> 0 | ej >>> 0 > 2147483646 | (_i | 0) == -1)) {
_i = f[6354];
_i = _i + (hj - ej | 0) & 0 - _i;
if (_i >>> 0 > 2147483646) {
break e
}
if ((Te(_i) | 0) != -1) {
ej = _i + ej | 0;
break e
}
Te(0 - ej | 0);
break g
}
if ((aj | 0) != -1) {
break e
}
break g
}
dj = 0;
break b
}
aj = 0;
break c
}
if ((aj | 0) != -1) {
break e
}
}
f[6345] = f[6345] | 4
}
if (bj >>> 0 > 2147483646) {
break d
}
aj = Te(bj);
_i = Te(0);
if (aj >>> 0 >= _i >>> 0 | (aj | 0) == -1 | (_i | 0) == -1) {
break d
}
ej = _i - aj | 0;
if (ej >>> 0 <= gj + 40 >>> 0) {
break d
}
}
_i = f[6342] + ej | 0;
f[6342] = _i;
if (_i >>> 0 > i[6343]) {
f[6343] = _i
}
x: {
y: {
z: {
cj = f[6240];
if (cj) {
_i = 25384;
while (1) {
dj = f[_i >> 2];
bj = f[_i + 4 >> 2];
if ((dj + bj | 0) == (aj | 0)) {
break z
}
_i = f[_i + 8 >> 2];
if (_i) {
continue
}
break
}
break y
}
_i = f[6238];
if (!(aj >>> 0 >= _i >>> 0 ? _i : 0)) {
f[6238] = aj
}
_i = 0;
f[6347] = ej;
f[6346] = aj;
f[6242] = -1;
f[6243] = f[6352];
f[6349] = 0;
while (1) {
cj = _i << 3;
bj = cj + 24976 | 0;
f[cj + 24984 >> 2] = bj;
f[cj + 24988 >> 2] = bj;
_i = _i + 1 | 0;
if ((_i | 0) != 32) {
continue
}
break
}
cj = ej + -40 | 0;
_i = aj + 8 & 7 ? -8 - aj & 7 : 0;
bj = cj - _i | 0;
f[6237] = bj;
_i = _i + aj | 0;
f[6240] = _i;
f[_i + 4 >> 2] = bj | 1;
f[(aj + cj | 0) + 4 >> 2] = 40;
f[6241] = f[6356];
break x
}
if (g[_i + 12 | 0] & 8 | aj >>> 0 <= cj >>> 0 | dj >>> 0 > cj >>> 0) {
break y
}
f[_i + 4 >> 2] = bj + ej;
_i = cj + 8 & 7 ? -8 - cj & 7 : 0;
bj = _i + cj | 0;
f[6240] = bj;
aj = f[6237] + ej | 0;
_i = aj - _i | 0;
f[6237] = _i;
f[bj + 4 >> 2] = _i | 1;
f[(aj + cj | 0) + 4 >> 2] = 40;
f[6241] = f[6356];
break x
}
dj = f[6238];
if (aj >>> 0 < dj >>> 0) {
f[6238] = aj;
dj = 0
}
bj = aj + ej | 0;
_i = 25384;
A: {
B: {
C: {
D: {
E: {
F: {
while (1) {
if ((bj | 0) != f[_i >> 2]) {
_i = f[_i + 8 >> 2];
if (_i) {
continue
}
break F
}
break
}
if (!(g[_i + 12 | 0] & 8)) {
break E
}
}
_i = 25384;
while (1) {
bj = f[_i >> 2];
if (bj >>> 0 <= cj >>> 0) {
fj = bj + f[_i + 4 >> 2] | 0;
if (fj >>> 0 > cj >>> 0) {
break D
}
}
_i = f[_i + 8 >> 2];
continue
}
}
f[_i >> 2] = aj;
f[_i + 4 >> 2] = f[_i + 4 >> 2] + ej;
ij = (aj + 8 & 7 ? -8 - aj & 7 : 0) + aj | 0;
f[ij + 4 >> 2] = gj | 3;
aj = bj + (bj + 8 & 7 ? -8 - bj & 7 : 0) | 0;
_i = (aj - ij | 0) - gj | 0;
fj = gj + ij | 0;
if ((aj | 0) == (cj | 0)) {
f[6240] = fj;
_i = f[6237] + _i | 0;
f[6237] = _i;
f[fj + 4 >> 2] = _i | 1;
break B
}
if (f[6239] == (aj | 0)) {
f[6239] = fj;
_i = f[6236] + _i | 0;
f[6236] = _i;
f[fj + 4 >> 2] = _i | 1;
f[_i + fj >> 2] = _i;
break B
}
bj = f[aj + 4 >> 2];
if ((bj & 3) == 1) {
hj = bj & -8;
G: {
if (bj >>> 0 <= 255) {
dj = f[aj + 8 >> 2];
bj = bj >>> 3;
cj = f[aj + 12 >> 2];
if ((cj | 0) == (dj | 0)) {
lj = 24936,
mj = f[6234] & tf(-2, bj),
f[lj >> 2] = mj;
break G
}
f[dj + 12 >> 2] = cj;
f[cj + 8 >> 2] = dj;
break G
}
jj = f[aj + 24 >> 2];
ej = f[aj + 12 >> 2];
H: {
if ((ej | 0) != (aj | 0)) {
bj = f[aj + 8 >> 2];
f[bj + 12 >> 2] = ej;
f[ej + 8 >> 2] = bj;
break H
}
I: {
cj = aj + 20 | 0;
gj = f[cj >> 2];
if (gj) {
break I
}
cj = aj + 16 | 0;
gj = f[cj >> 2];
if (gj) {
break I
}
ej = 0;
break H
}
while (1) {
bj = cj;
ej = gj;
cj = ej + 20 | 0;
gj = f[cj >> 2];
if (gj) {
continue
}
cj = ej + 16 | 0;
gj = f[ej + 16 >> 2];
if (gj) {
continue
}
break
}
f[bj >> 2] = 0
}
if (!jj) {
break G
}
cj = f[aj + 28 >> 2];
bj = (cj << 2) + 25240 | 0;
J: {
if (f[bj >> 2] == (aj | 0)) {
f[bj >> 2] = ej;
if (ej) {
break J
}
lj = 24940,
mj = f[6235] & tf(-2, cj),
f[lj >> 2] = mj;
break G
}
f[jj + (f[jj + 16 >> 2] == (aj | 0) ? 16 : 20) >> 2] = ej;
if (!ej) {
break G
}
}
f[ej + 24 >> 2] = jj;
bj = f[aj + 16 >> 2];
if (bj) {
f[ej + 16 >> 2] = bj;
f[bj + 24 >> 2] = ej
}
bj = f[aj + 20 >> 2];
if (!bj) {
break G
}
f[ej + 20 >> 2] = bj;
f[bj + 24 >> 2] = ej
}
aj = aj + hj | 0;
_i = _i + hj | 0
}
f[aj + 4 >> 2] = f[aj + 4 >> 2] & -2;
f[fj + 4 >> 2] = _i | 1;
f[_i + fj >> 2] = _i;
if (_i >>> 0 <= 255) {
_i = _i >>> 3;
aj = (_i << 3) + 24976 | 0;
bj = f[6234];
_i = 1 << _i;
K: {
if (!(bj & _i)) {
f[6234] = _i | bj;
_i = aj;
break K
}
_i = f[aj + 8 >> 2]
}
f[aj + 8 >> 2] = fj;
f[_i + 12 >> 2] = fj;
f[fj + 12 >> 2] = aj;
f[fj + 8 >> 2] = _i;
break B
}
aj = fj;
cj = _i >>> 8;
bj = 0;
L: {
if (!cj) {
break L
}
bj = 31;
if (_i >>> 0 > 16777215) {
break L
}
bj = cj;
cj = cj + 1048320 >>> 16 & 8;
bj = bj << cj;
ej = bj + 520192 >>> 16 & 4;
bj = bj << ej;
dj = bj + 245760 >>> 16 & 2;
bj = (bj << dj >>> 15) - (dj | (cj | ej)) | 0;
bj = (bj << 1 | _i >>> bj + 21 & 1) + 28 | 0
}
f[aj + 28 >> 2] = bj;
f[fj + 16 >> 2] = 0;
f[fj + 20 >> 2] = 0;
dj = (bj << 2) + 25240 | 0;
cj = f[6235];
aj = 1 << bj;
M: {
if (!(cj & aj)) {
f[6235] = aj | cj;
f[dj >> 2] = fj;
f[fj + 24 >> 2] = dj;
break M
}
cj = _i << ((bj | 0) == 31 ? 0 : 25 - (bj >>> 1) | 0);
aj = f[dj >> 2];
while (1) {
bj = aj;
if ((f[aj + 4 >> 2] & -8) == (_i | 0)) {
break C
}
aj = cj >>> 29;
cj = cj << 1;
dj = (bj + (aj & 4) | 0) + 16 | 0;
aj = f[dj >> 2];
if (aj) {
continue
}
break
}
f[dj >> 2] = fj;
f[fj + 24 >> 2] = bj
}
f[fj + 12 >> 2] = fj;
f[fj + 8 >> 2] = fj;
break B
}
dj = ej + -40 | 0;
_i = aj + 8 & 7 ? -8 - aj & 7 : 0;
bj = dj - _i | 0;
f[6237] = bj;
_i = _i + aj | 0;
f[6240] = _i;
f[_i + 4 >> 2] = bj | 1;
f[(aj + dj | 0) + 4 >> 2] = 40;
f[6241] = f[6356];
_i = (fj + (fj + -39 & 7 ? 39 - fj & 7 : 0) | 0) + -47 | 0;
bj = _i >>> 0 < cj + 16 >>> 0 ? cj : _i;
f[bj + 4 >> 2] = 27;
_i = f[6349];
f[bj + 16 >> 2] = f[6348];
f[bj + 20 >> 2] = _i;
_i = f[6347];
f[bj + 8 >> 2] = f[6346];
f[bj + 12 >> 2] = _i;
f[6348] = bj + 8;
f[6347] = ej;
f[6346] = aj;
f[6349] = 0;
_i = bj + 24 | 0;
while (1) {
f[_i + 4 >> 2] = 7;
aj = _i + 8 | 0;
_i = _i + 4 | 0;
if (aj >>> 0 < fj >>> 0) {
continue
}
break
}
if ((bj | 0) == (cj | 0)) {
break x
}
f[bj + 4 >> 2] = f[bj + 4 >> 2] & -2;
fj = bj - cj | 0;
f[cj + 4 >> 2] = fj | 1;
f[bj >> 2] = fj;
if (fj >>> 0 <= 255) {
_i = fj >>> 3;
aj = (_i << 3) + 24976 | 0;
bj = f[6234];
_i = 1 << _i;
N: {
if (!(bj & _i)) {
f[6234] = _i | bj;
_i = aj;
break N
}
_i = f[aj + 8 >> 2]
}
f[aj + 8 >> 2] = cj;
f[_i + 12 >> 2] = cj;
f[cj + 12 >> 2] = aj;
f[cj + 8 >> 2] = _i;
break x
}
f[cj + 16 >> 2] = 0;
f[cj + 20 >> 2] = 0;
_i = cj;
bj = fj >>> 8;
aj = 0;
O: {
if (!bj) {
break O
}
aj = 31;
if (fj >>> 0 > 16777215) {
break O
}
aj = bj;
bj = bj + 1048320 >>> 16 & 8;
aj = aj << bj;
ej = aj + 520192 >>> 16 & 4;
aj = aj << ej;
dj = aj + 245760 >>> 16 & 2;
aj = (aj << dj >>> 15) - (dj | (bj | ej)) | 0;
aj = (aj << 1 | fj >>> aj + 21 & 1) + 28 | 0
}
f[_i + 28 >> 2] = aj;
dj = (aj << 2) + 25240 | 0;
bj = f[6235];
_i = 1 << aj;
P: {
if (!(bj & _i)) {
f[6235] = _i | bj;
f[dj >> 2] = cj;
f[cj + 24 >> 2] = dj;
break P
}
_i = fj << ((aj | 0) == 31 ? 0 : 25 - (aj >>> 1) | 0);
aj = f[dj >> 2];
while (1) {
bj = aj;
if ((fj | 0) == (f[aj + 4 >> 2] & -8)) {
break A
}
aj = _i >>> 29;
_i = _i << 1;
dj = (bj + (aj & 4) | 0) + 16 | 0;
aj = f[dj >> 2];
if (aj) {
continue
}
break
}
f[dj >> 2] = cj;
f[cj + 24 >> 2] = bj
}
f[cj + 12 >> 2] = cj;
f[cj + 8 >> 2] = cj;
break x
}
_i = f[bj + 8 >> 2];
f[_i + 12 >> 2] = fj;
f[bj + 8 >> 2] = fj;
f[fj + 24 >> 2] = 0;
f[fj + 12 >> 2] = bj;
f[fj + 8 >> 2] = _i
}
_i = ij + 8 | 0;
break a
}
_i = f[bj + 8 >> 2];
f[_i + 12 >> 2] = cj;
f[bj + 8 >> 2] = cj;
f[cj + 24 >> 2] = 0;
f[cj + 12 >> 2] = bj;
f[cj + 8 >> 2] = _i
}
_i = f[6237];
if (_i >>> 0 <= gj >>> 0) {
break d
}
aj = _i - gj | 0;
f[6237] = aj;
bj = f[6240];
_i = bj + gj | 0;
f[6240] = _i;
f[_i + 4 >> 2] = aj | 1;
f[bj + 4 >> 2] = gj | 3;
_i = bj + 8 | 0;
break a
}
f[6230] = 48;
_i = 0;
break a
}
Q: {
if (!fj) {
break Q
}
cj = f[dj + 28 >> 2];
_i = (cj << 2) + 25240 | 0;
R: {
if (f[_i >> 2] == (dj | 0)) {
f[_i >> 2] = aj;
if (aj) {
break R
}
hj = tf(-2, cj) & hj;
f[6235] = hj;
break Q
}
f[fj + (f[fj + 16 >> 2] == (dj | 0) ? 16 : 20) >> 2] = aj;
if (!aj) {
break Q
}
}
f[aj + 24 >> 2] = fj;
_i = f[dj + 16 >> 2];
if (_i) {
f[aj + 16 >> 2] = _i;
f[_i + 24 >> 2] = aj
}
_i = f[dj + 20 >> 2];
if (!_i) {
break Q
}
f[aj + 20 >> 2] = _i;
f[_i + 24 >> 2] = aj
}
S: {
if (bj >>> 0 <= 15) {
_i = bj + gj | 0;
f[dj + 4 >> 2] = _i | 3;
_i = _i + dj | 0;
f[_i + 4 >> 2] = f[_i + 4 >> 2] | 1;
break S
}
f[dj + 4 >> 2] = gj | 3;
cj = dj + gj | 0;
f[cj + 4 >> 2] = bj | 1;
f[bj + cj >> 2] = bj;
if (bj >>> 0 <= 255) {
_i = bj >>> 3;
aj = (_i << 3) + 24976 | 0;
bj = f[6234];
_i = 1 << _i;
T: {
if (!(bj & _i)) {
f[6234] = _i | bj;
_i = aj;
break T
}
_i = f[aj + 8 >> 2]
}
f[aj + 8 >> 2] = cj;
f[_i + 12 >> 2] = cj;
f[cj + 12 >> 2] = aj;
f[cj + 8 >> 2] = _i;
break S
}
_i = cj;
ej = bj >>> 8;
aj = 0;
U: {
if (!ej) {
break U
}
aj = 31;
if (bj >>> 0 > 16777215) {
break U
}
aj = ej;
ej = ej + 1048320 >>> 16 & 8;
aj = aj << ej;
fj = aj + 520192 >>> 16 & 4;
aj = aj << fj;
gj = aj + 245760 >>> 16 & 2;
aj = (aj << gj >>> 15) - (gj | (ej | fj)) | 0;
aj = (aj << 1 | bj >>> aj + 21 & 1) + 28 | 0
}
f[_i + 28 >> 2] = aj;
f[cj + 16 >> 2] = 0;
f[cj + 20 >> 2] = 0;
ej = (aj << 2) + 25240 | 0;
V: {
_i = 1 << aj;
W: {
if (!(_i & hj)) {
f[6235] = _i | hj;
f[ej >> 2] = cj;
f[cj + 24 >> 2] = ej;
break W
}
_i = bj << ((aj | 0) == 31 ? 0 : 25 - (aj >>> 1) | 0);
gj = f[ej >> 2];
while (1) {
aj = gj;
if ((f[aj + 4 >> 2] & -8) == (bj | 0)) {
break V
}
ej = _i >>> 29;
_i = _i << 1;
ej = (aj + (ej & 4) | 0) + 16 | 0;
gj = f[ej >> 2];
if (gj) {
continue
}
break
}
f[ej >> 2] = cj;
f[cj + 24 >> 2] = aj
}
f[cj + 12 >> 2] = cj;
f[cj + 8 >> 2] = cj;
break S
}
_i = f[aj + 8 >> 2];
f[_i + 12 >> 2] = cj;
f[aj + 8 >> 2] = cj;
f[cj + 24 >> 2] = 0;
f[cj + 12 >> 2] = aj;
f[cj + 8 >> 2] = _i
}
_i = dj + 8 | 0;
break a
}
X: {
if (!ij) {
break X
}
bj = f[aj + 28 >> 2];
_i = (bj << 2) + 25240 | 0;
Y: {
if (f[_i >> 2] == (aj | 0)) {
f[_i >> 2] = dj;
if (dj) {
break Y
}
lj = 24940,
mj = tf(-2, bj) & hj,
f[lj >> 2] = mj;
break X
}
f[(f[ij + 16 >> 2] == (aj | 0) ? 16 : 20) + ij >> 2] = dj;
if (!dj) {
break X
}
}
f[dj + 24 >> 2] = ij;
_i = f[aj + 16 >> 2];
if (_i) {
f[dj + 16 >> 2] = _i;
f[_i + 24 >> 2] = dj
}
_i = f[aj + 20 >> 2];
if (!_i) {
break X
}
f[dj + 20 >> 2] = _i;
f[_i + 24 >> 2] = dj
}
Z: {
if (cj >>> 0 <= 15) {
_i = cj + gj | 0;
f[aj + 4 >> 2] = _i | 3;
_i = _i + aj | 0;
f[_i + 4 >> 2] = f[_i + 4 >> 2] | 1;
break Z
}
f[aj + 4 >> 2] = gj | 3;
dj = aj + gj | 0;
f[dj + 4 >> 2] = cj | 1;
f[cj + dj >> 2] = cj;
if (jj) {
_i = jj >>> 3;
bj = (_i << 3) + 24976 | 0;
gj = f[6239];
_i = 1 << _i;
_: {
if (!(_i & ej)) {
f[6234] = _i | ej;
_i = bj;
break _
}
_i = f[bj + 8 >> 2]
}
f[bj + 8 >> 2] = gj;
f[_i + 12 >> 2] = gj;
f[gj + 12 >> 2] = bj;
f[gj + 8 >> 2] = _i
}
f[6239] = dj;
f[6236] = cj
}
_i = aj + 8 | 0
}
U = kj + 16 | 0;
return _i | 0
}
function Re(_i) {
_i = _i | 0;
var nj = 0
, oj = 0
, pj = 0
, qj = 0
, rj = 0
, sj = 0
, tj = 0
, uj = 0
, vj = 0;
a: {
if (!_i) {
break a
}
pj = _i + -8 | 0;
oj = f[_i + -4 >> 2];
_i = oj & -8;
rj = pj + _i | 0;
b: {
if (oj & 1) {
break b
}
if (!(oj & 3)) {
break a
}
oj = f[pj >> 2];
pj = pj - oj | 0;
if (pj >>> 0 < i[6238]) {
break a
}
_i = _i + oj | 0;
if (f[6239] != (pj | 0)) {
if (oj >>> 0 <= 255) {
qj = f[pj + 8 >> 2];
oj = oj >>> 3;
nj = f[pj + 12 >> 2];
if ((nj | 0) == (qj | 0)) {
uj = 24936,
vj = f[6234] & tf(-2, oj),
f[uj >> 2] = vj;
break b
}
f[qj + 12 >> 2] = nj;
f[nj + 8 >> 2] = qj;
break b
}
tj = f[pj + 24 >> 2];
oj = f[pj + 12 >> 2];
c: {
if ((oj | 0) != (pj | 0)) {
nj = f[pj + 8 >> 2];
f[nj + 12 >> 2] = oj;
f[oj + 8 >> 2] = nj;
break c
}
d: {
qj = pj + 20 | 0;
nj = f[qj >> 2];
if (nj) {
break d
}
qj = pj + 16 | 0;
nj = f[qj >> 2];
if (nj) {
break d
}
oj = 0;
break c
}
while (1) {
sj = qj;
oj = nj;
qj = oj + 20 | 0;
nj = f[qj >> 2];
if (nj) {
continue
}
qj = oj + 16 | 0;
nj = f[oj + 16 >> 2];
if (nj) {
continue
}
break
}
f[sj >> 2] = 0
}
if (!tj) {
break b
}
qj = f[pj + 28 >> 2];
nj = (qj << 2) + 25240 | 0;
e: {
if (f[nj >> 2] == (pj | 0)) {
f[nj >> 2] = oj;
if (oj) {
break e
}
uj = 24940,
vj = f[6235] & tf(-2, qj),
f[uj >> 2] = vj;
break b
}
f[tj + (f[tj + 16 >> 2] == (pj | 0) ? 16 : 20) >> 2] = oj;
if (!oj) {
break b
}
}
f[oj + 24 >> 2] = tj;
nj = f[pj + 16 >> 2];
if (nj) {
f[oj + 16 >> 2] = nj;
f[nj + 24 >> 2] = oj
}
nj = f[pj + 20 >> 2];
if (!nj) {
break b
}
f[oj + 20 >> 2] = nj;
f[nj + 24 >> 2] = oj;
break b
}
oj = f[rj + 4 >> 2];
if ((oj & 3) != 3) {
break b
}
f[6236] = _i;
f[rj + 4 >> 2] = oj & -2;
f[pj + 4 >> 2] = _i | 1;
f[_i + pj >> 2] = _i;
return
}
if (rj >>> 0 <= pj >>> 0) {
break a
}
oj = f[rj + 4 >> 2];
if (!(oj & 1)) {
break a
}
f: {
if (!(oj & 2)) {
if ((rj | 0) == f[6240]) {
f[6240] = pj;
_i = f[6237] + _i | 0;
f[6237] = _i;
f[pj + 4 >> 2] = _i | 1;
if (f[6239] != (pj | 0)) {
break a
}
f[6236] = 0;
f[6239] = 0;
return
}
if ((rj | 0) == f[6239]) {
f[6239] = pj;
_i = f[6236] + _i | 0;
f[6236] = _i;
f[pj + 4 >> 2] = _i | 1;
f[_i + pj >> 2] = _i;
return
}
_i = (oj & -8) + _i | 0;
g: {
if (oj >>> 0 <= 255) {
nj = f[rj + 8 >> 2];
oj = oj >>> 3;
qj = f[rj + 12 >> 2];
if ((nj | 0) == (qj | 0)) {
uj = 24936,
vj = f[6234] & tf(-2, oj),
f[uj >> 2] = vj;
break g
}
f[nj + 12 >> 2] = qj;
f[qj + 8 >> 2] = nj;
break g
}
tj = f[rj + 24 >> 2];
oj = f[rj + 12 >> 2];
h: {
if ((rj | 0) != (oj | 0)) {
nj = f[rj + 8 >> 2];
f[nj + 12 >> 2] = oj;
f[oj + 8 >> 2] = nj;
break h
}
i: {
qj = rj + 20 | 0;
nj = f[qj >> 2];
if (nj) {
break i
}
qj = rj + 16 | 0;
nj = f[qj >> 2];
if (nj) {
break i
}
oj = 0;
break h
}
while (1) {
sj = qj;
oj = nj;
qj = oj + 20 | 0;
nj = f[qj >> 2];
if (nj) {
continue
}
qj = oj + 16 | 0;
nj = f[oj + 16 >> 2];
if (nj) {
continue
}
break
}
f[sj >> 2] = 0
}
if (!tj) {
break g
}
qj = f[rj + 28 >> 2];
nj = (qj << 2) + 25240 | 0;
j: {
if ((rj | 0) == f[nj >> 2]) {
f[nj >> 2] = oj;
if (oj) {
break j
}
uj = 24940,
vj = f[6235] & tf(-2, qj),
f[uj >> 2] = vj;
break g
}
f[tj + ((rj | 0) == f[tj + 16 >> 2] ? 16 : 20) >> 2] = oj;
if (!oj) {
break g
}
}
f[oj + 24 >> 2] = tj;
nj = f[rj + 16 >> 2];
if (nj) {
f[oj + 16 >> 2] = nj;
f[nj + 24 >> 2] = oj
}
nj = f[rj + 20 >> 2];
if (!nj) {
break g
}
f[oj + 20 >> 2] = nj;
f[nj + 24 >> 2] = oj
}
f[pj + 4 >> 2] = _i | 1;
f[_i + pj >> 2] = _i;
if (f[6239] != (pj | 0)) {
break f
}
f[6236] = _i;
return
}
f[rj + 4 >> 2] = oj & -2;
f[pj + 4 >> 2] = _i | 1;
f[_i + pj >> 2] = _i
}
if (_i >>> 0 <= 255) {
_i = _i >>> 3;
oj = (_i << 3) + 24976 | 0;
nj = f[6234];
_i = 1 << _i;
k: {
if (!(nj & _i)) {
f[6234] = _i | nj;
_i = oj;
break k
}
_i = f[oj + 8 >> 2]
}
f[oj + 8 >> 2] = pj;
f[_i + 12 >> 2] = pj;
f[pj + 12 >> 2] = oj;
f[pj + 8 >> 2] = _i;
return
}
f[pj + 16 >> 2] = 0;
f[pj + 20 >> 2] = 0;
oj = pj;
qj = _i >>> 8;
nj = 0;
l: {
if (!qj) {
break l
}
nj = 31;
if (_i >>> 0 > 16777215) {
break l
}
nj = qj;
qj = qj + 1048320 >>> 16 & 8;
nj = nj << qj;
tj = nj + 520192 >>> 16 & 4;
nj = nj << tj;
sj = nj + 245760 >>> 16 & 2;
nj = (nj << sj >>> 15) - (sj | (qj | tj)) | 0;
nj = (nj << 1 | _i >>> nj + 21 & 1) + 28 | 0
}
f[oj + 28 >> 2] = nj;
sj = (nj << 2) + 25240 | 0;
qj = f[6235];
oj = 1 << nj;
m: {
if (!(qj & oj)) {
f[6235] = oj | qj;
f[sj >> 2] = pj;
f[pj + 12 >> 2] = pj;
f[pj + 24 >> 2] = sj;
f[pj + 8 >> 2] = pj;
break m
}
qj = _i << ((nj | 0) == 31 ? 0 : 25 - (nj >>> 1) | 0);
oj = f[sj >> 2];
n: {
while (1) {
nj = oj;
if ((f[oj + 4 >> 2] & -8) == (_i | 0)) {
break n
}
oj = qj >>> 29;
qj = qj << 1;
sj = (nj + (oj & 4) | 0) + 16 | 0;
oj = f[sj >> 2];
if (oj) {
continue
}
break
}
f[sj >> 2] = pj;
f[pj + 12 >> 2] = pj;
f[pj + 24 >> 2] = nj;
f[pj + 8 >> 2] = pj;
break m
}
_i = f[nj + 8 >> 2];
f[_i + 12 >> 2] = pj;
f[nj + 8 >> 2] = pj;
f[pj + 24 >> 2] = 0;
f[pj + 12 >> 2] = nj;
f[pj + 8 >> 2] = _i
}
_i = f[6242] + -1 | 0;
f[6242] = _i;
if (_i) {
break a
}
pj = 25392;
while (1) {
_i = f[pj >> 2];
pj = _i + 8 | 0;
if (_i) {
continue
}
break
}
f[6242] = -1
}
}
function Se(_i, wj) {
var xj = 0
, yj = 0
, zj = 0;
xj = 0;
a: {
if (!_i) {
break a
}
yj = sf(_i, wj, 0);
zj = W;
xj = yj;
if ((_i | wj) >>> 0 < 65536) {
break a
}
xj = zj ? -1 : yj
}
wj = xj;
_i = Qe(wj);
if (!(!_i | !(g[_i + -4 | 0] & 3))) {
Ve(_i, wj)
}
return _i
}
function Te(_i) {
var wj = 0;
wj = f[6360];
_i = wj + _i | 0;
if ((_i | 0) <= -1) {
f[6230] = 48;
return -1
}
a: {
if (_i >>> 0 <= X() << 16 >>> 0) {
break a
}
if (R(_i | 0)) {
break a
}
f[6230] = 48;
return -1
}
f[6360] = _i;
return wj
}
function Ue(_i, Aj, Bj) {
var Cj = 0
, Dj = 0
, Ej = 0;
if (Bj >>> 0 >= 8192) {
S(_i | 0, Aj | 0, Bj | 0) | 0;
return _i
}
Dj = _i + Bj | 0;
a: {
if (!((_i ^ Aj) & 3)) {
b: {
if ((Bj | 0) < 1) {
Bj = _i;
break b
}
if (!(_i & 3)) {
Bj = _i;
break b
}
Bj = _i;
while (1) {
d[Bj | 0] = g[Aj | 0];
Aj = Aj + 1 | 0;
Bj = Bj + 1 | 0;
if (Bj >>> 0 >= Dj >>> 0) {
break b
}
if (Bj & 3) {
continue
}
break
}
}
Cj = Dj & -4;
c: {
if (Cj >>> 0 < 64) {
break c
}
Ej = Cj + -64 | 0;
if (Bj >>> 0 > Ej >>> 0) {
break c
}
while (1) {
f[Bj >> 2] = f[Aj >> 2];
f[Bj + 4 >> 2] = f[Aj + 4 >> 2];
f[Bj + 8 >> 2] = f[Aj + 8 >> 2];
f[Bj + 12 >> 2] = f[Aj + 12 >> 2];
f[Bj + 16 >> 2] = f[Aj + 16 >> 2];
f[Bj + 20 >> 2] = f[Aj + 20 >> 2];
f[Bj + 24 >> 2] = f[Aj + 24 >> 2];
f[Bj + 28 >> 2] = f[Aj + 28 >> 2];
f[Bj + 32 >> 2] = f[Aj + 32 >> 2];
f[Bj + 36 >> 2] = f[Aj + 36 >> 2];
f[Bj + 40 >> 2] = f[Aj + 40 >> 2];
f[Bj + 44 >> 2] = f[Aj + 44 >> 2];
f[Bj + 48 >> 2] = f[Aj + 48 >> 2];
f[Bj + 52 >> 2] = f[Aj + 52 >> 2];
f[Bj + 56 >> 2] = f[Aj + 56 >> 2];
f[Bj + 60 >> 2] = f[Aj + 60 >> 2];
Aj = Aj - -64 | 0;
Bj = Bj - -64 | 0;
if (Bj >>> 0 <= Ej >>> 0) {
continue
}
break
}
}
if (Bj >>> 0 >= Cj >>> 0) {
break a
}
while (1) {
f[Bj >> 2] = f[Aj >> 2];
Aj = Aj + 4 | 0;
Bj = Bj + 4 | 0;
if (Bj >>> 0 < Cj >>> 0) {
continue
}
break
}
break a
}
if (Dj >>> 0 < 4) {
Bj = _i;
break a
}
Cj = Dj + -4 | 0;
if (Cj >>> 0 < _i >>> 0) {
Bj = _i;
break a
}
Bj = _i;
while (1) {
d[Bj | 0] = g[Aj | 0];
d[Bj + 1 | 0] = g[Aj + 1 | 0];
d[Bj + 2 | 0] = g[Aj + 2 | 0];
d[Bj + 3 | 0] = g[Aj + 3 | 0];
Aj = Aj + 4 | 0;
Bj = Bj + 4 | 0;
if (Bj >>> 0 <= Cj >>> 0) {
continue
}
break
}
}
if (Bj >>> 0 < Dj >>> 0) {
while (1) {
d[Bj | 0] = g[Aj | 0];
Aj = Aj + 1 | 0;
Bj = Bj + 1 | 0;
if ((Dj | 0) != (Bj | 0)) {
continue
}
break
}
}
return _i
}
function Ve(_i, Aj) {
var Bj = 0;
a: {
if (!Aj) {
break a
}
Bj = _i + Aj | 0;
d[Bj + -1 | 0] = 0;
d[_i | 0] = 0;
if (Aj >>> 0 < 3) {
break a
}
d[Bj + -2 | 0] = 0;
d[_i + 1 | 0] = 0;
d[Bj + -3 | 0] = 0;
d[_i + 2 | 0] = 0;
if (Aj >>> 0 < 7) {
break a
}
d[Bj + -4 | 0] = 0;
d[_i + 3 | 0] = 0;
if (Aj >>> 0 < 9) {
break a
}
Bj = 0 - _i & 3;
_i = Bj + _i | 0;
f[_i >> 2] = 0;
Bj = Aj - Bj & -4;
Aj = Bj + _i | 0;
f[Aj + -4 >> 2] = 0;
if (Bj >>> 0 < 9) {
break a
}
f[_i + 8 >> 2] = 0;
f[_i + 4 >> 2] = 0;
f[Aj + -8 >> 2] = 0;
f[Aj + -12 >> 2] = 0;
if (Bj >>> 0 < 25) {
break a
}
f[_i + 24 >> 2] = 0;
f[_i + 20 >> 2] = 0;
f[_i + 16 >> 2] = 0;
f[_i + 12 >> 2] = 0;
f[Aj + -16 >> 2] = 0;
f[Aj + -20 >> 2] = 0;
f[Aj + -24 >> 2] = 0;
f[Aj + -28 >> 2] = 0;
Aj = Bj;
Bj = _i & 4 | 24;
Aj = Aj - Bj | 0;
if (Aj >>> 0 < 32) {
break a
}
_i = _i + Bj | 0;
while (1) {
f[_i + 24 >> 2] = 0;
f[_i + 28 >> 2] = 0;
f[_i + 16 >> 2] = 0;
f[_i + 20 >> 2] = 0;
f[_i + 8 >> 2] = 0;
f[_i + 12 >> 2] = 0;
f[_i >> 2] = 0;
f[_i + 4 >> 2] = 0;
_i = _i + 32 | 0;
Aj = Aj + -32 | 0;
if (Aj >>> 0 > 31) {
continue
}
break
}
}
}
function We(_i, Aj, Fj) {
var Gj = 0
, Hj = 0;
a: {
if ((_i | 0) == (Aj | 0)) {
break a
}
b: {
if (Aj + Fj >>> 0 > _i >>> 0) {
Hj = _i + Fj | 0;
if (Hj >>> 0 > Aj >>> 0) {
break b
}
}
Ue(_i, Aj, Fj);
return
}
Gj = (_i ^ Aj) & 3;
c: {
d: {
if (_i >>> 0 < Aj >>> 0) {
if (Gj) {
break c
}
if (!(_i & 3)) {
break d
}
while (1) {
if (!Fj) {
break a
}
d[_i | 0] = g[Aj | 0];
Aj = Aj + 1 | 0;
Fj = Fj + -1 | 0;
_i = _i + 1 | 0;
if (_i & 3) {
continue
}
break
}
break d
}
e: {
if (Gj) {
break e
}
if (Hj & 3) {
while (1) {
if (!Fj) {
break a
}
Fj = Fj + -1 | 0;
Gj = Fj + _i | 0;
d[Gj | 0] = g[Aj + Fj | 0];
if (Gj & 3) {
continue
}
break
}
}
if (Fj >>> 0 <= 3) {
break e
}
while (1) {
Fj = Fj + -4 | 0;
f[Fj + _i >> 2] = f[Aj + Fj >> 2];
if (Fj >>> 0 > 3) {
continue
}
break
}
}
if (!Fj) {
break a
}
while (1) {
Fj = Fj + -1 | 0;
d[Fj + _i | 0] = g[Aj + Fj | 0];
if (Fj) {
continue
}
break
}
break a
}
if (Fj >>> 0 <= 3) {
break c
}
Gj = Fj;
while (1) {
f[_i >> 2] = f[Aj >> 2];
Aj = Aj + 4 | 0;
_i = _i + 4 | 0;
Gj = Gj + -4 | 0;
if (Gj >>> 0 > 3) {
continue
}
break
}
Fj = Fj & 3
}
if (!Fj) {
break a
}
while (1) {
d[_i | 0] = g[Aj | 0];
_i = _i + 1 | 0;
Aj = Aj + 1 | 0;
Fj = Fj + -1 | 0;
if (Fj) {
continue
}
break
}
}
}
function Xe(_i, Aj) {
_i = _i | 0;
Aj = Aj | 0;
if (!f[6358]) {
f[6359] = Aj;
f[6358] = _i
}
}
function Ye(_i) {
_i = _i | 0;
return Ze(_i) | 0
}
function Ze(_i) {
return _i << 8 & 16711680 | _i << 24 | (_i >>> 8 & 65280 | _i >>> 24)
}
function _e(_i) {
_i = _i | 0;
return (_i << 24 | _i << 8) >>> 16
}
function $e() {
return U | 0
}
function af(_i) {
_i = _i | 0;
_i = U - _i & -16;
U = _i;
return _i | 0
}
function bf(_i) {
_i = _i | 0;
U = _i
}
function cf(_i) {
_i = _i | 0;
return Y(_i | 0) | 0
}
function df(_i, Aj, Fj, Ij) {
_i = _i | 0;
Aj = Aj | 0;
Fj = Fj | 0;
Ij = Ij | 0;
return c[_i](Aj, Fj, Ij) | 0
}
function ef(_i, Aj, Fj, Ij) {
_i = _i | 0;
Aj = Aj | 0;
Fj = Fj | 0;
Ij = Ij | 0;
c[_i](Aj, Fj, Ij)
}
function ff(_i, Aj, Fj, Ij, Jj) {
_i = _i | 0;
Aj = Aj | 0;
Fj = Fj | 0;
Ij = Ij | 0;
Jj = Jj | 0;
return c[_i](Aj, Fj, Ij, Jj) | 0
}
function gf(_i, Aj, Fj, Ij, Jj, Kj, Lj) {
_i = _i | 0;
Aj = Aj | 0;
Fj = Fj | 0;
Ij = Ij | 0;
Jj = Jj | 0;
Kj = Kj | 0;
Lj = Lj | 0;
return c[_i](Aj, Fj, Ij, Jj, Kj, Lj) | 0
}
function hf(_i, Aj, Fj, Ij, Jj, Kj, Lj, Mj) {
_i = _i | 0;
Aj = Aj | 0;
Fj = Fj | 0;
Ij = Ij | 0;
Jj = Jj | 0;
Kj = Kj | 0;
Lj = Lj | 0;
Mj = Mj | 0;
return c[_i](Aj, Fj, Ij, Jj, Kj, Lj, Mj) | 0
}
function jf(_i) {
_i = _i | 0;
return c[_i]() | 0
}
function kf(_i, Aj) {
_i = _i | 0;
Aj = Aj | 0;
c[_i](Aj)
}
function lf(_i, Aj) {
_i = _i | 0;
Aj = Aj | 0;
return c[_i](Aj) | 0
}
function mf(_i, Aj, Fj) {
_i = _i | 0;
Aj = Aj | 0;
Fj = Fj | 0;
return c[_i](Aj, Fj) | 0
}
function nf(_i, Aj, Fj, Ij, Jj, Kj, Lj) {
_i = _i | 0;
Aj = Aj | 0;
Fj = Fj | 0;
Ij = Ij | 0;
Jj = Jj | 0;
Kj = Kj | 0;
Lj = Lj | 0;
c[_i](Aj, Fj, Ij, Jj, Kj, Lj)
}
function of(_i, Aj, Fj, Ij, Jj, Kj) {
_i = _i | 0;
Aj = Aj | 0;
Fj = Fj | 0;
Ij = Ij | 0;
Jj = Jj | 0;
Kj = Kj | 0;
c[_i](Aj, Fj, Ij, Jj, Kj)
}
function pf(_i, Aj, Fj, Ij, Jj) {
_i = _i | 0;
Aj = Aj | 0;
Fj = Fj | 0;
Ij = Ij | 0;
Jj = Jj | 0;
c[_i](Aj, Fj, Ij, Jj)
}
function qf(_i, Aj, Fj, Ij, Jj) {
_i = _i | 0;
Aj = Aj | 0;
Fj = Fj | 0;
Ij = Ij | 0;
Jj = Jj | 0;
_i = c[_i](Aj, Fj, Ij, Jj) | 0;
T(W | 0);
return _i | 0
}
function rf(_i, Aj, Fj) {
var Ij = 0
, Jj = 0
, Kj = 0
, Lj = 0
, Mj = 0;
Jj = Aj >>> 16;
Ij = _i >>> 16;
Mj = l(Jj, Ij);
Aj = Aj & 65535;
Kj = _i & 65535;
Lj = l(Aj, Kj);
Ij = (Lj >>> 16) + l(Aj, Ij) | 0;
Aj = (Ij & 65535) + l(Jj, Kj) | 0;
W = ((Mj + l(_i, Fj) | 0) + (Ij >>> 16) | 0) + (Aj >>> 16) | 0;
return Lj & 65535 | Aj << 16
}
function sf(_i, Aj, Fj) {
return rf(_i, Aj, Fj)
}
function tf(_i, Aj) {
var Fj = 0
, Nj = 0;
Fj = Aj & 31;
Nj = (-1 >>> Fj & _i) << Fj;
Fj = _i;
_i = 0 - Aj & 31;
return Nj | (Fj & -1 << _i) >>> _i
}
// EMSCRIPTEN_END_FUNCS
c[1] = Ma;
c[2] = Na;
c[3] = Pa;
c[4] = Qa;
c[5] = Ra;
c[6] = Sa;
c[7] = Ta;
c[8] = Ua;
c[9] = Va;
c[10] = $a;
c[11] = ab;
c[12] = bb;
c[13] = cb;
c[14] = db;
c[15] = eb;
c[16] = fb;
c[17] = gb;
c[18] = hb;
c[19] = ib;
c[20] = jb;
c[21] = kb;
c[22] = lb;
c[23] = mb;
c[24] = nb;
c[25] = ob;
c[26] = pb;
c[27] = qb;
c[28] = rb;
c[29] = sb;
c[30] = tb;
c[31] = ub;
c[32] = vb;
c[33] = wb;
c[34] = xb;
c[35] = yb;
c[36] = zb;
c[37] = Ab;
c[38] = Bb;
c[39] = Cb;
c[40] = Db;
c[41] = Eb;
c[42] = Fb;
c[43] = Gb;
c[44] = Hb;
c[45] = Ib;
c[46] = Jb;
c[47] = Kb;
c[48] = Lb;
c[49] = Mb;
c[50] = Nb;
c[51] = Ob;
c[52] = Pb;
c[53] = Qb;
c[54] = Rb;
c[55] = Sb;
c[56] = Tb;
c[57] = Ub;
c[58] = Vb;
c[59] = pc;
c[60] = qc;
c[61] = xc;
c[62] = yc;
c[63] = Fc;
c[64] = Gc;
c[65] = Hc;
c[66] = Ic;
c[67] = Jc;
c[68] = Kc;
c[69] = Lc;
c[70] = Cc;
c[71] = Ud;
c[72] = Nc;
c[73] = pc;
c[74] = qc;
c[75] = Xc;
c[76] = Uc;
c[77] = Yc;
c[78] = pc;
c[79] = qc;
c[80] = Td;
c[81] = Wd;
c[82] = Xd;
c[83] = Yd;
c[84] = pc;
c[85] = qc;
c[86] = Rc;
c[87] = Rc;
c[88] = Zd;
c[89] = qc;
c[90] = $d;
c[91] = pe;
c[92] = me;
c[93] = ce;
c[94] = qc;
c[95] = oe;
c[96] = le;
c[97] = de;
c[98] = qc;
c[99] = ne;
c[100] = ie;
c[101] = fe;
c[102] = Pe;
function X() {
return buffer.byteLength / 65536 | 0
}
function Y(pagesToAdd) {
pagesToAdd = pagesToAdd | 0;
var Z = X() | 0;
var _ = Z + pagesToAdd | 0;
if (Z < _ && _ < 65536) {
var $ = new ArrayBuffer(l(_, 65536));
var aa = new global.Int8Array($);
aa.set(d);
d = aa;
d = new global.Int8Array($);
e = new global.Int16Array($);
f = new global.Int32Array($);
g = new global.Uint8Array($);
h = new global.Uint16Array($);
i = new global.Uint32Array($);
j = new global.Float32Array($);
k = new global.Float64Array($);
buffer = $;
memory.buffer = $
}
return Z
}
return {
"__wasm_call_ctors": fa,
"free": Re,
"__errno_location": Zc,
"malloc": Qe,
"htons": _e,
"ntohs": _e,
"htonl": Ye,
"fflush": Sc,
"setThrew": Xe,
"_ZSt18uncaught_exceptionv": jd,
"__getTypeName": re,
"__embind_register_native_and_builtin_types": se,
"stackSave": $e,
"stackAlloc": af,
"stackRestore": bf,
"__growWasmMemory": cf,
"dynCall_iiii": df,
"dynCall_viii": ef,
"dynCall_iiiii": ff,
"dynCall_iiiiiii": gf,
"dynCall_iiiiiiii": hf,
"dynCall_i": jf,
"dynCall_vi": kf,
"dynCall_ii": lf,
"dynCall_iii": mf,
"dynCall_jiji": qf,
"dynCall_viiiiii": nf,
"dynCall_viiiii": of,
"dynCall_viiii": pf
}
}
var ba = (function (mem) {
var ca = new Uint8Array(mem);
return (function (offset, s) {
var da, ea;
if (typeof Buffer === "undefined") {
da = atob(s);
for (ea = 0; ea < da.length; ea++)
ca[offset + ea] = da.charCodeAt(ea)
} else {
da = Buffer.from(s, "base64");
for (ea = 0; ea < da.length; ea++)
ca[offset + ea] = da[ea]
}
}
)
}
)(wasmMemory.buffer);
ba(1024, "pgsx0ay135jbcv0vt98a0O2v4biWfiZqRZB8upl/LPFHmaEk92yRs+LyAQgW/I6F2CBpY2lOV3Gj/likfj2T9I90lQ1Yto5yWM2Lce5KFYIdpFR7tVlawjnVMJwTYPIqI7DRxfCFYCgYeUHK7zjbuLDceY4OGDpgiw6ebD6KHrDBdxXXJ0sxvdovr3hgXGBV8yVV5pSrVapimEhXQBToY2o5ylW2EKsqNFzMtM7oQRGvhlShk+lyfBEU7rMqvG9jXcWpK/YxGHQWPlzOHpOHmzO61q9czyRsgVMyeneGlSiYSI87r7lLaxvov8STIShmzAnYYZGpIftgrHxIMoDsXV1dhO+xdYXpAiMm3IgbZeuBPokjxayW0/NvbQ85QvSDgkQLLgQghKRK8MhpXpsfnkJoxiGabOn2YZwMZ/CI06vSoFFqaC9U2CinD5ajM1GrbAvvbuQ7ehNQ8Du6mCr7fh1l8aF2Aa85PlnKZogOQ4IZhu6MtJ9vRcOlhH2+Xos72HVv4HMgwYWfRBpApmrBVmKq004Gdz82ct/+Gz0Cm0Ik19A3SBIK0NPqD9ubwPFJyXJTB3sbmYDYedQl997o9hpQ/uM7THm2veBsl7oGwAS2T6nBxGCfQMKeXF5jJGoZr2/7aLVTbD7rsjkTb+xSOx9R/G0slTCbREWBzAm9Xq8E0OO+/Uoz3gcoD2azSy4ZV6jLwA90yEU5XwvS2/vTub3AeVUKMmAaxgCh1nlyLED+JZ9nzKMf+/jppY74IjLb3xZ1PBVrYf3IHlAvq1IFrfq1PTJghyP9SHsxU4LfAD67V1yeoIxvyi5WhxrbaRff9qhC1cP/fijGMmesc1VPjLAnW2nIWMq7XaP/4aAR8LiYPfoQuIMh/Wy1/Epb09EteeRTmmVF+La8SY7SkJf7S9ry3eEzfsukQRP7YujG5M7ayiDvAUx3Nv6eftC0H/ErTdrblZiRkK5xjq3qoNWTa9DRjtDgJcevL1s8jreUdY774vaPZCsS8hK4iIgc8A2QoF6tTxzDj2iR8c/RrcGosxgiLy93Fw6+/i116qEfAosPzKDl6HRvtdbzrBiZ4onO4E+otLfgE/2BO8R82ait0maiXxYFd5WAFHPMk3cUGiFlIK3mhvq1d/VCVMfPNZ37DK/N66CJPnvTG0HWSX4eri0OJQBes3EguwBoIq/guFebNmQkHrkJ8B2RY1Wqpt9ZiUPBeH9TWtmiW30gxbnlAnYDJoOpz5ViaBnIEUFKc07KLUezSqkUe1IAURsVKVOaP1cP1uTGm7x2pGArAHTmgbVvuggf6RtXa+yW8hXZDSohZWO2tvm55y4FNP9kVoXFXS2wU6GPn6mZR7oIageFbulwektEKbO1Lgl12yMmGcSwpm6tfd+nSbhg7pxmsu2PcYyq7P8XmmlsUmRW4Z6xwqUCNhkpTAl1QBNZoD46GOSamFQ/ZZ1CW9bkj2vWP/eZB5zSofUw6O/mOC1NwV0l8IYg3Uwm63CExumCY17MHgI/a2gJye+6PhQYlzyhcGprhDV/aIbioFIFU5y3NwdQqhyEBz5crt5/7ER9jrjyFlc32jqwDQxQ8AQfHPD/swACGvUMrrJ0tTxYeoMlvSEJ3PkTkdH2L6l8c0cylAFH9SKB5eU63NrCNzR2tcin3fOaRmFEqQ4D0A8+x8jsQR51pJnNOOIvDuo7obuAMjGzPhg4i1ROCLltTwMNQm+/BAr2kBK4LHl8lyRysHlWr4mvvB93mt4QCJPZEq6Lsy4/z9wfchJVJHFrLubdGlCHzYSfGEdYehfaCHS8mp+8jH1L6Trseuz6HYXbZkMJY9LDZMRHGBzvCNkVMjc7Q90WusIkQ02hElHEZSoCAJRQ3eQ6E57433FVTjEQ1nesgZsZEV/xVjUEa8ej1zsYETwJpSRZ7eaP8vr78Zcsv7qebjwVHnBF44axb+nqCl4OhrMqPloc5x93+gY9TrncZSkPHeeZ1ok+gCXIZlJ4yUwuarMQnLoOFcZ46uKUUzz8pfQtCh6nTvfyPSsdNg8mORlgecIZCKcjUrYSE/du/q3rZh/D6pVFvOODyHum0Td/sSj/jAHv3TLDpVpsvoUhWGUCmKtoD6XO7juVL9utfe8qhC9uWyi2IRVwYQcpdUfd7BAVn2EwqMwTlr1h6x7+NAPPYwOqkFxztTmicEwLnp7VFN6qy7yGzO6nLGJgq1yrnG6E87KvHotkyvC9GblpI6BQu1plMlpoQLO0KjzV6Z4x97ghwBkLVJuZoF+Hfpn3lah9PWKaiDf4dy3jl1+T7RGBEmgWKYg1DtYf5seh396WmbpYeKWE9VdjciIb/8ODm5ZGwhrrCrPNVDAuU+RI2Y8oMbxt7/LrWOr/xjRh7Sj+czx87tkUSl3jt2ToFF0QQuATPiC24u5F6quqoxVPbNvQT8v6QvRCx7W7au8dO09lBSHNQZ55HtjHTYWGakdL5FBigT3yoWLPRiaNW6CDiPyjtsfBwyQVf5J0y2kLioRHhbKSVgC/WwmdSBmtdLFiFAAOgiMqjUJY6vVVDD70rR1hcD8jkvByM0F+k43x7F/W2zsibFk33nxgdO7Lp/KFQG4yd86EgAemnlD4GVXY7+g1l9lhqqdpqcIGDMX8qwRa3MoLgC56RJ6ENEXDBWfV/cmeHg7T23PbzYhVEHnaX2dAQ2fjZTTExdg4PnGe+Cg9IP9t8echPhVKPbCPK5/j5vetg9toWj3p90CBlBwmTPY0KWmU9yAVQffUAnYua/S8aACi1HEkCNRq9CAzt9S3Q69hAFAu9jkeRkUkl3RPIRRAiIu/HfyVTa+RtZbT3fRwRS+gZuwJvL+Fl70D0G2sfwSFyzGzJ+uWQTn9VeZHJdqaCsqrJXhQKPQpBFPahiwK+2226WIU3GgAaUjXpMAOaO6NoSei/j9PjK2H6AbgjLW21vR6fB7OquxfN9OZo3jOQiprQDWe/iC5hfPZq9c57otOEjv3+skdVhhtSzFmoyayl+PqdPpuOjJDW93350Fo+yB4yk71CvuXs/7YrFZARSeVSLo6OlNVh42DILepa/5LlZbQvGeoVViaFaFjKanMM9vhmVZKKqb5JTE/HH70XnwxKZAC6Pj9cC8nBFwVu4DjLCgFSBXBlSJtxuQ/E8FI3IYPx+7J+QcPHwRBpHlHQBduiF3rUV8y0cCb1Y/BvPJkNRFBNHh7JWCcKmCj6PjfG2xjH8K0Eg6eMuEC0U9mrxWB0crglSNr4ZI+M2ILJDsiub7uDqKyhZkNuuaMDHLeKPeiLUV4EtD9lLeVYgh9ZPD1zOdvo0lU+kh9hyf9ncMejT7zQWNHCnT/Lpmrbm86N/349GDcEqj43euhTOEbmQ1rbtsQVXvGNyxnbTvUZScE6NDcxw0p8aP/AMySDzm1C+0Pafufe2acfdvOC8+RoKNeFdmILxO7JK1bUb95lHvr1jt2sy45N3lZEcyX4iaALTEu9KetQmg7K2rGzEx1EhzxLng3QhJq51GSt+a7oQZQY/tLGBBrGvrtyhHYvSU9ycPh4lkWQkSGExIKbuwM2Srqq9VOZ69kX6iG2ojpv77+w+RkV4C8nYbA9/D4e3hgTWADYEaD/dGwHzj2BK5Fd8z8Ntcza0KDcase8IdBgLBfXgA8vlegdySu6L2ZQkZVYS5Yv4/0WE6i/d3yOO909MK9iYfD+WZTdI6zyFXydbS52fxGYSbreoTfHYt5DmqE4pVfkY5ZbkZwV7QgkVXVjEzeAsnhrAu50AWCu0hiqBGeqXR1thl/twncqeChCS1mM0YyxAIfWuiMvvAJJaCZShD+bh0dPbka36SlCw/yhqFp8Wgog9q33P4GOVebzuKhUn/NTwFeEVD6gwanxLUCoCfQ5g0njPiaQYY/dwZMYMO1BqhhKHoX8OCG9cCqWGAAYn3cMNee5hFj6jgjlN3CUzQWwsJW7su73ra8kKF9/Ot2HVnOCeQFb4gBfEs9CnI5JHySfF9y44a5nU1ytFvBGvy4ntN4VVTttaX8CNN8PdjED61NXu9QHvjmYbHZFIWiPBNRbOfH1W/ETuFWzr8qNjfIxt00MprXEoJjko76DmfgAGBAN845Os/1+tM3d8KrGy3FWp5nsFxCN6NPQCeC076bvJmdjhHVFXMPv34cLdZ7xADHaxuMt0WQoSG+sW6ytG42ai+rSFd5bpS80najxsjCSWXu+A9Tfd6NRh0Kc9XGTdBM27s5KVBGuqnoJpWsBONevvDV+qGaUS1q4ozvYyLuhpq4wonA9i4kQ6oDHqWk0PKcumHAg01q6ZtQFeWP1ltkuvmiJijhOjqnhpWpS+liVe/T7y/H2vdS92lvBD9ZCvp3FankgAGGsIet5gmbk+U+O1r9kOmX1zSe2bfwLFGLKwI6rNWWfaZ9AdY+z9EoLX18zyWfH5u48q1ytNZaTPWIWnGsKeDmpRng/aywR5v6k+2NxNPozFc7KClm1fgoLhN5kQFfeFVgde1EDpb3jF7T49RtBRW6bfSIJWGhA73wZAUVnuvDoleQPOwaJ5cqBzqpm20/G/UhYx77Zpz1GfPcJijZM3X1/VWxgjRWA7s8uooRd1Eo+NkKwmdRzKtfkq3MURfoTY7cMDhiWJ03kfkgk8KQeurOez77ZM4hUTK+T3d+47aoRj0pw2lT3kiA5hNkEAiuoiSybd39LYVpZiEHCQpGmrPdwEVkz95sWK7IIBzd975bQI1YG38B0sy747Rrfmqi3UX/WTpECjU+1c20vKjO6nK7hGT6rhJmjUdvPL9j5JvSnl0vVBt3wq5wY072jQ0OdFcTW+dxFnL4XX1TrwjLQEDM4rROakbSNISvFQEoBLDhHTqYlbSfuAZIoG7Ogjs/b4KrIDVLHRoB+CdyJ7FgFWHcP5PnK3k6u70lRTThOYigS3nOUbfJMi/Juh+gfsgc4PbRx7zDEQHPx6rooUmHkBqavU/Uy97a0DjaCtUqwzkDZzaRxnwx+Y1PK7Hgt1me9zq79UP/GdXynEXZJywil78q/OYVcfyRDyUVlJthk+X665y2zllkqMLRqLoSXgfBtgxqBeNlUNIQQqQDyw5u7OA725gWvqCYTGTpeDIylR+f35LT4Cs0oNMe8nGJQXQKG4w0o0sgcb7F2DJ2w42fNd8uL5mbR28L5h3x4w9U2kzlkdjaHs95Ys5vfj7NZrEYFgUdLP3F0o+EmSL79lfzI/UjdjKmMTWokwLNzFZigfCstet1Wpc2Fm7Mc9KIkmKW3tBJuYEbkFBMFFbGcb3HxuYKFHoyBtDhRZp78sP9U6rJAA+oYuK/Jbv20r01BWkScSICBLJ8z8u2K5x2zcA+EVPT40AWYL2rOPCtRyWcIDi6ds5G98Whr3dgYHUgTv7LhdiN6Iqw+ap6fqr5TFzCSBmMivsC5GrDAfnh69Zp+NSQoN5cpi0lCT+f5gjCMmFOt1vid87j349X5nLDOohqPyTTCKOFLooZE0RzcAMiOAmk0DGfKZj6LgiJbE7s5iEoRXcT0DjPZlS+bAzpNLcprMDdUHzJtdWEPxcJR7XZ1RaSG/t5iQ==");
ba(5200, "oJ5mfzvMkIu2euhYTKpzssbvNy/pT4K+VP9TpfHTbxwQ5Sf63mgtHbBWiMKz5sH9AAECAwgJCgsmJyQlFxQVFhv//xr//////////////////////////wQFBgcMDQ4PEBESE/8YGf8fHB0e//////////////////////////8AAQIDPT4/PP////8bGBkaIyAhIv////8ICQoLEBESE/////8nJCUm/////wwNDg86Ozg5HxwdHv////8EBQYHQUJDQBQVFhf/////KygpKhUWFxT/////EhMQEQsICQoPDA0OGRobGB0eHxwSExAR//////////8=");
ba(5456, "cIIs7LMnwOXkhVc16gyuQSPva5NFGaUh7Q5PTh1lkr2GuK+PfOsfzj4w3F9exQsapuE5ytVHXT3ZAVrWUVZsTYsNmmb7zLAtdBIrIPCxhJnfTMvCNH52BW23qTHRFwTXFFg6Yd4bERwyD5wWUxjyIv5Ez7LDtXqRJAjoqGD8aVCq0KB9oYlil1RbHpXg/2TSEMQASKP3dduKA+baCT/dlIdcgwLNSpAzc2f2851/v+JSm9gmyDfGO4GWb0sTvmMu6XmnjJ9uvI4p9fm2L/20WXiYBmrnRnG61CWrQoiijfpyB7lV+O6sCjZJKmg8OPGkQCjTe7vJQ8EV4630d8eAnuAFWNlnToHLyQuuatUYXYJG39YnijJLQtscnpw6yiV7DXFfH/jXPp18YLm+vIsWNE3DcpWrjrp6swK0raKs2JoXGjXM95lhWugkVkDhYwkzv5iXhWj87Arab1Nioy4IryiwdMK9NiI4ZB45LKYw5UT9iJ9lh2v0I0gQ0VHA+dKgVaFB+kMTxC+otjwrwf/IpSCJAJBH7+q3FQbNtRJ+uykPuAcEm5QhZubO7ec7/n/FpDexTJFujXYDLd6WJn3GXNPyTxk/3HkdUuvzbV77abLwMQzUz4zidalKV4QRRRv15A5zqvHdWRRsklTQeHDjSYBQp/Z3k4aDKsdb6e6PAT04QRZ22ZNg8nLCq5p1Blegkfe1yaKM0pD2B6cnjrJJ3kNc18c+9Y9nHxhury/ihQ1T8Jxl6qOunuyALWuoKzamxYZNM/1mWJY6CZUQeNhCzO8m5WEaPzuCttvUmOiLAusKLB2wb42IDhmHTgupDHkRfyLnWeHaPcgSBHRUMH60KFVoUL7QxDHLKq0PynD/MmkIYgAk0fu67UWBc22En+5Kwy7BAeYlSJm5s3v5zr/fcSnNbBNkm2OdwEu3pYlfsRf0vNNGzzdeR5T6/FuX/lqsPEwDNfMjuF1qktUhRFHGfTmD3Kp8d1YFG6QVNB4c+FIgFOm93eSh4Irx1nq740BPcCyzwORX6q4ja0Wl7U8dkoavfB8+3F4LpjnVXdlaUWyLmvuwdCvwhN/LNHZtqdEEFDreETKcU/L+z8N6JOhgaaqgoWJUHuBkEACjdYrmCd2Hg82Qc/adv1LYyMaBbxNj6aefvCn5L7R4Budx1KuIjXK5+Kw2KjzxQNO7QxWtd4CC7CflhTUMQe+TGSEOTmW9uI/rzjBfxRrhykc9AdZWTQ1mzC0SILGZTMJ+BbcxF9dYYRscDxYYIkSytZEIqPxQ0H2Jl1uV/9LESPfbA9o/lFwCSjNn83/imyY3O5ZLvi55jG6O9bb9WZhqRrolQqL6B1XuCkloOKQoe8nB4/THngIAAAABAAAAgAAAALAg");
ba(6504, "EAAAALwgAAADAAAAAQAAAMAAAADkIA==");
ba(6536, "EAAAALwgAAAEAAAAAQAAAAABAADwIA==");
ba(6568, "EAAAALwgAAAFAAAAAgAAAIAAAAD8IAAAEAAAAAAAAAAQAAAAvCAAAAYAAAACAAAAwAAAAAghAAAQAAAAAAAAABAAAAC8IAAABwAAAAIAAAAAAQAAFCEAABAAAAAAAAAAEAAAALwgAAAIAAAAAwAAAIAAAAAgIQAAEAAAAAAAAAAQAAAAvCAAAAkAAAADAAAAwAAAAC8hAAAQAAAAAAAAABAAAAC8IAAACgAAAAMAAAAAAQAAPiEAABAAAAAAAAAAEAAAALwgAAALAAAABQAAAIAAAABNIQAAEAAAAAAAAAAQAAAAvCAAAAwAAAAFAAAAwAAAAFkhAAAQAAAAAAAAABAAAAC8IAAADQAAAAUAAAAAAQAAZSEAABAAAAAAAAAAEAAAALwgAAAOAAAABgAAAIAAAABxIQAADAAAAAEAAAAQAAAAgCEAAA8AAAAGAAAAwAAAAKghAAAMAAAAAQAAABAAAACAIQAAEAAAAAYAAAAAAQAAtCEAAAwAAAABAAAAEAAAAIAhAAArAAAACAAAAIAAAADAIQAADAAAAAEAAAAQAAAAzCEAACwAAAAIAAAAwAAAAPQhAAAMAAAAAQAAABAAAADMIQAALQAAAAgAAAAAAQAAACIAAAwAAAABAAAAEAAAAMwhAAAqAAAABwAAAIAAAAAMIg==");
ba(7080, "AQAAABgiAAAmAAAAAQAAAIAAAABAIgAACAAAAAIAAAAIAAAAUCIAACcAAAACAAAAgAAAAHgiAAAIAAAAAgAAAAgAAABQIgAAKAAAAAMAAACAAAAAhSIAAAgAAAACAAAACAAAAFAiAAApAAAABQAAAIAAAACUIgAACAAAAAIAAAAIAAAAUCIAABEAAAABAAAAgAAAAKEiAAAQAAAAAAAAABAAAAC0IgAAEgAAAAEAAADAAAAA3CIAABAAAAAAAAAAEAAAALQiAAATAAAAAQAAAAABAADtIgAAEAAAAAAAAAAQAAAAtCIAABQAAAACAAAAgAAAAP4iAAAQAAAAAAAAABAAAAC0IgAAFQAAAAIAAADAAAAADyMAABAAAAAAAAAAEAAAALQiAAAWAAAAAgAAAAABAAAgIwAAEAAAAAAAAAAQAAAAtCIAABcAAAADAAAAgAAAADEjAAAQAAAAAAAAABAAAAC0IgAAGAAAAAMAAADAAAAARSMAABAAAAAAAAAAEAAAALQiAAAZAAAAAwAAAAABAABZIwAAEAAAAAAAAAAQAAAAtCIAABoAAAAFAAAAgAAAAG0jAAAQAAAAAAAAABAAAAC0IgAAGwAAAAUAAADAAAAAfiMAABAAAAAAAAAAEAAAALQiAAAcAAAABQAAAAABAACPIwAAEAAAAAAAAAAQAAAAtCIAAB0AAAAGAAAAgAAAAKAjAAAMAAAAAQAAABAAAAC0IwAAHgAAAAYAAADAAAAA3CMAAAwAAAABAAAAEAAAALQjAAAfAAAABgAAAAABAADtIwAADAAAAAEAAAAQAAAAtCMAAC4AAAAIAAAAgAAAAP4jAAAMAAAAAQAAABAAAAAQJAAALwAAAAgAAADAAAAAOCQAAAwAAAABAAAAEAAAABAkAAAwAAAACAAAAAABAABJJAAADAAAAAEAAAAQAAAAECQAACAAAAABAAAAQAAAAFokAAAIAAAAAAAAAAgAAABkJAAAIgAAAAEAAACAAAAAjCQAAAgAAAAAAAAACAAAAJgkAAAkAAAAAQAAAMAAAADAJAAACAAAAAAAAAAIAAAA0CQAACEAAAACAAAAQAAAAPgkAAAIAAAAAAAAAAgAAABkJAAAIwAAAAIAAACAAAAAACUAAAgAAAAAAAAACAAAAJgkAAAlAAAAAgAAAMAAAAAMJQAACAAAAAAAAAAIAAAA0CQAAAIAAABQGQAAAwAAAHAZAAAEAAAAkBkAAAUAAACwGQAABgAAANAZAAAHAAAA8BkAAAgAAAAQGgAACQAAADAaAAAKAAAAUBoAAAsAAABwGgAADAAAAJAaAAANAAAAsBoAAA4AAADQGgAADwAAAPAaAAAQAAAAEBsAACsAAAAwGwAALAAAAFAbAAAtAAAAcBsAACoAAACQGwAAJgAAALAbAAAnAAAA0BsAACgAAADwGwAAKQAAABAcAAARAAAAMBwAABIAAABQHAAAEwAAAHAcAAAUAAAAkBwAABUAAACwHAAAFgAAANAcAAAXAAAA8BwAABgAAAAQHQAAGQAAADAdAAAaAAAAUB0AABsAAABwHQAAHAAAAJAdAAAdAAAAsB0AAB4AAADQHQAAHwAAAPAdAAAuAAAAEB4AAC8AAAAwHgAAMAAAAFAeAAAgAAAAcB4AACIAAACQHgAAJAAAALAeAAAhAAAA0B4AACMAAADwHgAAJQAAABAf");
ba(8368, "QUVTLTEyOC1FQ0IAAgAAAAoAAAALAAAADAAAAA0AAAAAAAAADgAAAA8AAAAQAAAAEQAAAEFFUy0xOTItRUNCAEFFUy0yNTYtRUNCAEFFUy0xMjgtQ0JDAEFFUy0xOTItQ0JDAEFFUy0yNTYtQ0JDAEFFUy0xMjgtQ0ZCMTI4AEFFUy0xOTItQ0ZCMTI4AEFFUy0yNTYtQ0ZCMTI4AEFFUy0xMjgtQ1RSAEFFUy0xOTItQ1RSAEFFUy0yNTYtQ1RSAEFFUy0xMjgtR0NNAAAAAAI=");
ba(8600, "EgAAABIAAAATAAAAFAAAAEFFUy0xOTItR0NNAEFFUy0yNTYtR0NNAEFFUy0xMjgtQ0NNAAI=");
ba(8676, "FQAAABUAAAAWAAAAFwAAAEFFUy0xOTItQ0NNAEFFUy0yNTYtQ0NNAEFSQzQtMTI4AAAAAAc=");
ba(8748, "GAAAABkAAAAZAAAAGgAAABsAAABCTE9XRklTSC1FQ0IAAAAABgAAABwAAAAdAAAAHgAAAB8AAAAAAAAAIAAAACAAAAAhAAAAIgAAAEJMT1dGSVNILUNCQwBCTE9XRklTSC1DRkI2NABCTE9XRklTSC1DVFIAQ0FNRUxMSUEtMTI4LUVDQgAAAAUAAAAjAAAAJAAAACUAAAAmAAAAAAAAACcAAAAoAAAAKQAAACoAAABDQU1FTExJQS0xOTItRUNCAENBTUVMTElBLTI1Ni1FQ0IAQ0FNRUxMSUEtMTI4LUNCQwBDQU1FTExJQS0xOTItQ0JDAENBTUVMTElBLTI1Ni1DQkMAQ0FNRUxMSUEtMTI4LUNGQjEyOABDQU1FTExJQS0xOTItQ0ZCMTI4AENBTUVMTElBLTI1Ni1DRkIxMjgAQ0FNRUxMSUEtMTI4LUNUUgBDQU1FTExJQS0xOTItQ1RSAENBTUVMTElBLTI1Ni1DVFIAQ0FNRUxMSUEtMTI4LUdDTQAAAAAF");
ba(9164, "KwAAACsAAAATAAAAFAAAAENBTUVMTElBLTE5Mi1HQ00AQ0FNRUxMSUEtMjU2LUdDTQBDQU1FTExJQS0xMjgtQ0NNAAAF");
ba(9256, "LAAAACwAAAAWAAAAFwAAAENBTUVMTElBLTE5Mi1DQ00AQ0FNRUxMSUEtMjU2LUNDTQBERVMtRUNCAAAAAwAAAC0AAAAu");
ba(9340, "LwAAADAAAAAxAAAAMgAAAERFUy1FREUtRUNCAAMAAAAzAAAANA==");
ba(9392, "NQAAADYAAAA3AAAAOAAAAERFUy1FREUzLUVDQgAAAAAEAAAAMwAAADQ=");
ba(9448, "OQAAADoAAAA3AAAAOAAAAERFUy1DQkMAREVTLUVERS1DQkMAREVTLUVERTMtQ0JD");
ba(9508, "AQAAAAABAAABAQAAAAABAAEAAQAAAQEAAQEBAAAAAAEBAAABAAEAAQEBAAEAAAEBAQABAQABAQEBAQEBAAAAAAAAAAEAAAEAAAABAQABAAAAAQABAAEBAAABAQEBAAAAAQAAAQEAAQABAAEBAQEAAAEBAAEBAQEAAQEBAUAQABAAEAAAAAAEAEAQBBAAAAAQQBAAEEAAAAAAAAAQQAAEAAAABBBAEAQQABAEAAAQBBBAEAQAABAAAEAAAAAAAAQQQAAAEAAQABBAEAAAABAEAEAABABAAAQQABAEEEAQ");
ba(9740, "QAAEEEAAABAAEAAQQBAEAAAABABAEAQAAAAEAAAQBBAAEAAAQAAAAEAABBAAEAAAQBAEAAAQABBAAAAAQAAAEAAABBBAAAQQAAAAEAAABABAEAAQAAAAAEAQBBBAAAQAQAAAEAAABBAAEAAQQBAAEAAAAABAEAQQABAEAAAQBABAEAAAQBAAAEAABAAAAAAQABAEEBAAACAAAEAgAEAAABBAQCAAAEAgEAAAABBAQCAAAEAAAEAAIBBAQAAAAEAAEAAAIBAAQAAAQAAgAAAAIBBAAAAAAAAAEABAABBAACAAQAAAAEBAABBAACAQAAAAEABAIBAAQCAAAAAAEEBAAABAQCAQQAAAAEBAAABAQCAAAAAgAEAAIBAAAAAQAEAgAEBAABBAQCAAAEAAEEAAABAAACAAAEAAAEAAIAAAACAQQAAAEAAAIBBAQCAAQEAAAABAIBBAQAAAQEAgAAAAABAAQCAQAAAAAEAAAAAAQCAQQEAAAEAAABAAQAAQQAAgAAAAAABAQCAAAAAgEABAABBAACABIIAAgSAAAIEgAACAAAAAgCCAAIEAgAABAIAAASAAAAAAAAAAIIAAACCAAIEggACBAAAAAAAAAIAAgAABAIAAAQAAAAAgAAAAAIAAASCAAIAAAAAAAIAAASAAAIAgAACBAIAAAQAAAIAgAACAAIAAACAAAIAggACBIIAAgQAAAIAAgAABAIAAACCAAIEggACB");
ba(10301, "IIAAgCAAAIAAgACBAIAAAQAAAAEggACBIAAAgSAAAIAAAACBIIAAgQAAAAEAAAAAIAAAAQCAAAEgAACAIIAAgQCAAAEgAACAIAAAAACAAAEggACAAAAAAACAAAAgAACAIIAAIIAQgACAAIAAgAAAIIAQAAAAEAAgAAAAIAAQgCCAAIAgAACAIIAQgACAEIAAAACAAIAAgAAAEAAgAAAAIAAQgACAEAAgABAAIIAAgAAAAAAAAACAAIAAACCAEAAAABCAIAAQACAAAIAAAAAAAIAQACCAAAAAgBCAAAAQgCCAAAAAAAAAIIAQACAAEIAAABAAIIAAgAAAEIAAgBCAAIAAAAAAEIAAgACAIAAAACCAEIAggBAAIAAAAACAAAAAAACAIIAAAACAEIAAABAAIAAAgCAAEAAggACAIAAAgCAAEAAAgBAAAAAAAACAAIAggAAAAAAAgCAAEIAggBCAAIAQAAAAIAACACAEAggABAAAAAAACAAAAggABAIIIAAACCAEAgggBAAAIAAAAAAAAgAABAIAAAAAAAAEAgAgBAIIAAAACAAEAgggAAIAIAAACAAEAgAABAAAIAQACCAEAgAgAAAAIAQACAAAAggAAAIIIAQACCAAAgAAAAAAAAQACCAAAAAABAAIIAAAACAAAggABAIIAAQCACAEAgAgBAIAAAACACAAAAAABAAIAAQAACAAAAggBAIIAAACCCAAAAggBAIIAAACAAAEAgggBAAAIAQACCAAAAAAAAIAAAACCCAEAAAAAAIIIAAAACAEAAgAAAIAAAQACAAEAAgAAAIAIAAAAQAAAAEIAgAACAIAAQBCAAAIAAABAAAAAABAAAAIAgABCEAAAAgAAAEAAgABCEAAAQBCAAAIQgABCAAAAABAAAAAAgAACEAAAAhAAAAAAAABAEAAAQhCAAEIQgABAAIAAAhCAAEAQAAAAAAAAABCAAEIAgAAAAIAAABCAAEIAAAACAAAAQBCAAEAAAAAAAIAAABAAAAIAgABAEIAAQhAAAEAAgAAAEAAAAhCAAEIAgABCEAAAQAAAAAAAgAACEIAAQhCAAEIAAAAAEIAAQhCAAAIAgAAAAAAAAhAAAAAQgABCAAAAQACAAEAQAAACAAAAAAAAAAIQAABCAIAAQBACAIAAAACAggAAAAACAACCAACAAgAAAAACAICAAACAAgIAAIACAAACAgAAAgAAAIACAICCAgAAgAAAAIICAIAAAAAAAgIAAAAAAICCAACAAAAAgIAAAACCAgAAggIAgIACAIACAACAgAAAAIACAIACAgAAAAIAgIIAAIAAAAAAAgAAgIIAAAACAgAAgAIAgAAAAACAAACAggAAgAIAAAAAAACAAAIAAIACAICCAACAAgIAAAIAAIAAAAAAAAIAAIICAIACAAAAgAAAAAICAICCAgAAAAIAgIAAAICAAgAAAgAAAIICAIACAgCAAAAAAIICAICAAgAAAAIAAIIAAICAAAEAQEAAAAAAAABAAQEAQEEAAEBBAQBAAQAAAAAAAEAAAQAAAAEAQEEBAEBAAQAAAQEAAEEAAEBAAAAAQQAAAAEBAAAAAQAAQAEAAEABAEAAAQBAAAAAQEAAAEBBAQAAQQAAQAEAAABBAAAAQQAAQAAAAAABAQAAAQEAQAAAAABAAABAAQEAQEEAAAAAAABAQAEAQEAAAABAAAAAQAEAAAEAAEBAAABAAAEAQAEAAABAAQAAAQAAAAEBAABBAQBAAQEAQEEAAEAAAABAQQEAAEEAAABBAQAAAQEAQAABAEBBAQAAAAEAAEABAABAAAAAAQAAQAABAEAAAAAAAQAAQE=");
ba(11688, "IBwAAAAAAABAOAAAAAAAAGAkAAAAAAAAgHAAAAAAAACgbAAAAAAAAMBIAAAAAAAA4FQAAAAAAAAA4QAAAAAAACD9AAAAAAAAQNkAAAAAAABgxQAAAAAAAICRAAAAAAAAoI0AAAAAAADAqQAAAAAAAOC1AAAAAAAAQUJDREVGR0hJSktMTU5PUFFSU1RVVldYWVphYmNkZWZnaGlqa2xtbm9wcXJzdHV2d3h5ejAxMjM0NTY3ODkrLw==");
ba(11888, "QUJDREVGR0hJSktMTU5PUFFSU1RVVldYWVphYmNkZWZnaGlqa2xtbm9wcXJzdHV2d3h5ejAxMjM0NTY3ODktXw==");
ba(11960, "4C4AADsAAAA8AAAATjZDcnlwdG8xM0NpcGhlckZhY3RvcnlFAAAAAPAzAADELgAAAAAAABgvAAA9AAAAPgAAAHBrY3M3AFBLQ1M3AE42Q3J5cHRvOUNpcGhlcktleUUA8DMAAAQvAAAxAENyeXB0b0RhdGEAZGF0YQB2ZXJzaW9uAGdldEVuY3J5cHREYXRhAGFsbG9jYXRvcjxUPjo6YWxsb2NhdGUoc2l6ZV90IG4pICduJyBleGNlZWRzIG1heGltdW0gc3VwcG9ydGVkIHNpemUAMTBDcnlwdG9EYXRhAAAA8DMAAI0vAABpAHZpAE5TdDNfXzIxMmJhc2ljX3N0cmluZ0ljTlNfMTFjaGFyX3RyYWl0c0ljRUVOU185YWxsb2NhdG9ySWNFRUVFAE5TdDNfXzIyMV9fYmFzaWNfc3RyaW5nX2NvbW1vbklMYjFFRUUAAADwMwAA6C8AAHQ0AACpLwAAAAAAAAEAAAAQMAAAAAAAAGlpaQB2aWlpAAAAAJwvAAAYMAAAGDAAAGlpaWk=");
ba(12372, "dDAAAEkAAABKAAAATjZDcnlwdG82VGVhVXJsRQAAAADwMwAAYDAAAAAAAAD/////////////////////////////////////////////////////////////////AAECAwQFBgcICf////////8KCwwNDg8QERITFBUWFxgZGhscHR4fICEiI////////woLDA0ODxAREhMUFRYXGBkaGxwdHh8gISIj/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////wABAgQHAwYFAGFsbG9jYXRvcjxUPjo6YWxsb2NhdGUoc2l6ZV90IG4pICduJyBleGNlZWRzIG1heGltdW0gc3VwcG9ydGVkIHNpemUAYmFzaWNfc3RyaW5nAHZlY3RvcgBzdGQ6OmV4Y2VwdGlvbg==");
ba(12792, "GDIAAE4AAABPAAAAUAAAAFN0OWV4Y2VwdGlvbgAAAADwMwAACDIAAAAAAABEMgAARwAAAFEAAABSAAAAU3QxMWxvZ2ljX2Vycm9yABg0AAA0MgAAGDIAAAAAAAB4MgAARwAAAFMAAABSAAAAU3QxMmxlbmd0aF9lcnJvcgAAAAAYNAAAZDIAAEQyAABTdDl0eXBlX2luZm8AAAAA8DMAAIQyAABOMTBfX2N4eGFiaXYxMTZfX3NoaW1fdHlwZV9pbmZvRQAAAAAYNAAAnDIAAJQyAABOMTBfX2N4eGFiaXYxMTdfX2NsYXNzX3R5cGVfaW5mb0UAAAAYNAAAzDIAAMAyAAAAAAAAQDMAAFQAAABVAAAAVgAAAFcAAABYAAAATjEwX19jeHhhYml2MTIzX19mdW5kYW1lbnRhbF90eXBlX2luZm9FABg0AAAYMwAAwDIAAHYAAAAEMwAATDMAAGIAAAAEMwAAWDMAAGMAAAAEMwAAZDMAAGgAAAAEMwAAcDMAAGEAAAAEMwAAfDMAAHMAAAAEMwAAiDMAAHQAAAAEMwAAlDMAAGkAAAAEMwAAoDMAAGoAAAAEMwAArDMAAGwAAAAEMwAAuDMAAG0AAAAEMwAAxDMAAGYAAAAEMwAA0DMAAGQAAAAEMwAA3DMAAAAAAADwMgAAVAAAAFkAAABWAAAAVwAAAFoAAABbAAAAXAAAAF0AAAAAAAAAYDQAAFQAAABeAAAAVgAAAFcAAABaAAAAXwAAAGAAAABhAAAATjEwX19jeHhhYml2MTIwX19zaV9jbGFzc190eXBlX2luZm9FAAAAABg0AAA4NAAA8DIAAAAAAAC8NAAAVAAAAGIAAABWAAAAVwAAAFoAAABjAAAAZAAAAGUAAABOMTBfX2N4eGFiaXYxMjFfX3ZtaV9jbGFzc190eXBlX2luZm9FAAAAGDQAAJQ0AADwMgAAdm9pZABib29sAGNoYXIAc2lnbmVkIGNoYXIAdW5zaWduZWQgY2hhcgBzaG9ydAB1bnNpZ25lZCBzaG9ydABpbnQAdW5zaWduZWQgaW50AGxvbmcAdW5zaWduZWQgbG9uZwBmbG9hdABkb3VibGUAc3RkOjpzdHJpbmcAc3RkOjpiYXNpY19zdHJpbmc8dW5zaWduZWQgY2hhcj4Ac3RkOjp3c3RyaW5nAGVtc2NyaXB0ZW46OnZhbABlbXNjcmlwdGVuOjptZW1vcnlfdmlldzxjaGFyPgBlbXNjcmlwdGVuOjptZW1vcnlfdmlldzxzaWduZWQgY2hhcj4AZW1zY3JpcHRlbjo6bWVtb3J5X3ZpZXc8dW5zaWduZWQgY2hhcj4AZW1zY3JpcHRlbjo6bWVtb3J5X3ZpZXc8c2hvcnQ+AGVtc2NyaXB0ZW46Om1lbW9yeV92aWV3PHVuc2lnbmVkIHNob3J0PgBlbXNjcmlwdGVuOjptZW1vcnlfdmlldzxpbnQ+AGVtc2NyaXB0ZW46Om1lbW9yeV92aWV3PHVuc2lnbmVkIGludD4AZW1zY3JpcHRlbjo6bWVtb3J5X3ZpZXc8bG9uZz4AZW1zY3JpcHRlbjo6bWVtb3J5X3ZpZXc8dW5zaWduZWQgbG9uZz4AZW1zY3JpcHRlbjo6bWVtb3J5X3ZpZXc8aW50OF90PgBlbXNjcmlwdGVuOjptZW1vcnlfdmlldzx1aW50OF90PgBlbXNjcmlwdGVuOjptZW1vcnlfdmlldzxpbnQxNl90PgBlbXNjcmlwdGVuOjptZW1vcnlfdmlldzx1aW50MTZfdD4AZW1zY3JpcHRlbjo6bWVtb3J5X3ZpZXc8aW50MzJfdD4AZW1zY3JpcHRlbjo6bWVtb3J5X3ZpZXc8dWludDMyX3Q+AGVtc2NyaXB0ZW46Om1lbW9yeV92aWV3PGZsb2F0PgBlbXNjcmlwdGVuOjptZW1vcnlfdmlldzxkb3VibGU+AE5TdDNfXzIxMmJhc2ljX3N0cmluZ0loTlNfMTFjaGFyX3RyYWl0c0loRUVOU185YWxsb2NhdG9ySWhFRUVFAAB0NAAAwDcAAAAAAAABAAAAEDAAAAAAAABOU3QzX18yMTJiYXNpY19zdHJpbmdJd05TXzExY2hhcl90cmFpdHNJd0VFTlNfOWFsbG9jYXRvckl3RUVFRQAAdDQAABg4AAAAAAAAAQAAABAwAAAAAAAATjEwZW1zY3JpcHRlbjN2YWxFAADwMwAAcDgAAE4xMGVtc2NyaXB0ZW4xMW1lbW9yeV92aWV3SWNFRQAA8DMAAIw4AABOMTBlbXNjcmlwdGVuMTFtZW1vcnlfdmlld0lhRUUAAPAzAAC0OAAATjEwZW1zY3JpcHRlbjExbWVtb3J5X3ZpZXdJaEVFAADwMwAA3DgAAE4xMGVtc2NyaXB0ZW4xMW1lbW9yeV92aWV3SXNFRQAA8DMAAAQ5AABOMTBlbXNjcmlwdGVuMTFtZW1vcnlfdmlld0l0RUUAAPAzAAAsOQAATjEwZW1zY3JpcHRlbjExbWVtb3J5X3ZpZXdJaUVFAADwMwAAVDkAAE4xMGVtc2NyaXB0ZW4xMW1lbW9yeV92aWV3SWpFRQAA8DMAAHw5AABOMTBlbXNjcmlwdGVuMTFtZW1vcnlfdmlld0lsRUUAAPAzAACkOQAATjEwZW1zY3JpcHRlbjExbWVtb3J5X3ZpZXdJbUVFAADwMwAAzDkAAE4xMGVtc2NyaXB0ZW4xMW1lbW9yeV92aWV3SWZFRQAA8DMAAPQ5AABOMTBlbXNjcmlwdGVuMTFtZW1vcnlfdmlld0lkRUUAAPAzAAAcOg==");
ba(14920, "BQ==");
ba(14932, "Sw==");
ba(14956, "TAAAAE0AAABYXQAAAAQ=");
ba(14980, "AQ==");
ba(14995, "Cv////8=");
ba(15064, "SDo=");
return b({
"Int8Array": Int8Array,
"Int16Array": Int16Array,
"Int32Array": Int32Array,
"Uint8Array": Uint8Array,
"Uint16Array": Uint16Array,
"Uint32Array": Uint32Array,
"Float32Array": Float32Array,
"Float64Array": Float64Array,
"NaN": NaN,
"Infinity": Infinity,
"Math": Math
}, asmLibraryArg, wasmMemory.buffer)
}
// EMSCRIPTEN_END_ASM
)(asmLibraryArg, wasmMemory, wasmTable);
return {
"exports": exports
}
},
instantiate: function (binary, info) {
return {
then: function (ok, err) {
ok({
"instance": new WebAssembly.Instance(new WebAssembly.Module(binary, info))
})
}
}
},
RuntimeError: Error
};
wasmBinary = [];
if (typeof WebAssembly !== "object") {
err("no native wasm support detected")
}
function setValue(ptr, value, type, noSafe) {
type = type || "i8";
if (type.charAt(type.length - 1) === "*")
type = "i32";
switch (type) {
case "i1":
HEAP8[ptr >> 0] = value;
break;
case "i8":
HEAP8[ptr >> 0] = value;
break;
case "i16":
HEAP16[ptr >> 1] = value;
break;
case "i32":
HEAP32[ptr >> 2] = value;
break;
case "i64":
tempI64 = [value >>> 0, (tempDouble = value,
+Math_abs(tempDouble) >= 1 ? tempDouble > 0 ? (Math_min(+Math_floor(tempDouble / 4294967296), 4294967295) | 0) >>> 0 : ~~+Math_ceil((tempDouble - +(~~tempDouble >>> 0)) / 4294967296) >>> 0 : 0)],
HEAP32[ptr >> 2] = tempI64[0],
HEAP32[ptr + 4 >> 2] = tempI64[1];
break;
case "float":
HEAPF32[ptr >> 2] = value;
break;
case "double":
HEAPF64[ptr >> 3] = value;
break;
default:
abort("invalid type for setValue: " + type)
}
}
var wasmMemory;
var wasmTable = new WebAssembly.Table({
"initial": 103,
"maximum": 103 + 0,
"element": "anyfunc"
});
var ABORT = false;
var EXITSTATUS = 0;
function assert(condition, text) {
if (!condition) {
abort("Assertion failed: " + text)
}
}
function getCFunc(ident) {
var func = Module["_" + ident];
assert(func, "Cannot call unknown function " + ident + ", make sure it is exported");
return func
}
function ccall(ident, returnType, argTypes, args, opts) {
var toC = {
"string": function (str) {
var ret = 0;
if (str !== null && str !== undefined && str !== 0) {
var len = (str.length << 2) + 1;
ret = stackAlloc(len);
stringToUTF8(str, ret, len)
}
return ret
},
"array": function (arr) {
var ret = stackAlloc(arr.length);
writeArrayToMemory(arr, ret);
return ret
}
};
function convertReturnValue(ret) {
if (returnType === "string")
return UTF8ToString(ret);
if (returnType === "boolean")
return Boolean(ret);
return ret
}
var func = getCFunc(ident);
var cArgs = [];
var stack = 0;
if (args) {
for (var i = 0; i < args.length; i++) {
var converter = toC[argTypes[i]];
if (converter) {
if (stack === 0)
stack = stackSave();
cArgs[i] = converter(args[i])
} else {
cArgs[i] = args[i]
}
}
}
var ret = func.apply(null, cArgs);
ret = convertReturnValue(ret);
if (stack !== 0)
stackRestore(stack);
return ret
}
var ALLOC_NONE = 3;
var UTF8Decoder = typeof TextDecoder !== "undefined" ? new TextDecoder("utf8") : undefined;
function UTF8ArrayToString(u8Array, idx, maxBytesToRead) {
var endIdx = idx + maxBytesToRead;
var endPtr = idx;
while (u8Array[endPtr] && !(endPtr >= endIdx))
++endPtr;
if (endPtr - idx > 16 && u8Array.subarray && UTF8Decoder) {
return UTF8Decoder.decode(u8Array.subarray(idx, endPtr))
} else {
var str = "";
while (idx < endPtr) {
var u0 = u8Array[idx++];
if (!(u0 & 128)) {
str += String.fromCharCode(u0);
continue
}
var u1 = u8Array[idx++] & 63;
if ((u0 & 224) == 192) {
str += String.fromCharCode((u0 & 31) << 6 | u1);
continue
}
var u2 = u8Array[idx++] & 63;
if ((u0 & 240) == 224) {
u0 = (u0 & 15) << 12 | u1 << 6 | u2
} else {
u0 = (u0 & 7) << 18 | u1 << 12 | u2 << 6 | u8Array[idx++] & 63
}
if (u0 < 65536) {
str += String.fromCharCode(u0)
} else {
var ch = u0 - 65536;
str += String.fromCharCode(55296 | ch >> 10, 56320 | ch & 1023)
}
}
}
return str
}
function UTF8ToString(ptr, maxBytesToRead) {
return ptr ? UTF8ArrayToString(HEAPU8, ptr, maxBytesToRead) : ""
}
function stringToUTF8Array(str, outU8Array, outIdx, maxBytesToWrite) {
if (!(maxBytesToWrite > 0))
return 0;
var startIdx = outIdx;
var endIdx = outIdx + maxBytesToWrite - 1;
for (var i = 0; i < str.length; ++i) {
var u = str.charCodeAt(i);
if (u >= 55296 && u <= 57343) {
var u1 = str.charCodeAt(++i);
u = 65536 + ((u & 1023) << 10) | u1 & 1023
}
if (u <= 127) {
if (outIdx >= endIdx)
break;
outU8Array[outIdx++] = u
} else if (u <= 2047) {
if (outIdx + 1 >= endIdx)
break;
outU8Array[outIdx++] = 192 | u >> 6;
outU8Array[outIdx++] = 128 | u & 63
} else if (u <= 65535) {
if (outIdx + 2 >= endIdx)
break;
outU8Array[outIdx++] = 224 | u >> 12;
outU8Array[outIdx++] = 128 | u >> 6 & 63;
outU8Array[outIdx++] = 128 | u & 63
} else {
if (outIdx + 3 >= endIdx)
break;
outU8Array[outIdx++] = 240 | u >> 18;
outU8Array[outIdx++] = 128 | u >> 12 & 63;
outU8Array[outIdx++] = 128 | u >> 6 & 63;
outU8Array[outIdx++] = 128 | u & 63
}
}
outU8Array[outIdx] = 0;
return outIdx - startIdx
}
function stringToUTF8(str, outPtr, maxBytesToWrite) {
return stringToUTF8Array(str, HEAPU8, outPtr, maxBytesToWrite)
}
function lengthBytesUTF8(str) {
var len = 0;
for (var i = 0; i < str.length; ++i) {
var u = str.charCodeAt(i);
if (u >= 55296 && u <= 57343)
u = 65536 + ((u & 1023) << 10) | str.charCodeAt(++i) & 1023;
if (u <= 127)
++len;
else if (u <= 2047)
len += 2;
else if (u <= 65535)
len += 3;
else
len += 4
}
return len
}
var UTF16Decoder = typeof TextDecoder !== "undefined" ? new TextDecoder("utf-16le") : undefined;
function writeArrayToMemory(array, buffer) {
HEAP8.set(array, buffer)
}
function writeAsciiToMemory(str, buffer, dontAddNull) {
for (var i = 0; i < str.length; ++i) {
HEAP8[buffer++ >> 0] = str.charCodeAt(i)
}
if (!dontAddNull)
HEAP8[buffer >> 0] = 0
}
var WASM_PAGE_SIZE = 65536;
function alignUp(x, multiple) {
if (x % multiple > 0) {
x += multiple - x % multiple
}
return x
}
var buffer, HEAP8, HEAPU8, HEAP16, HEAPU16, HEAP32, HEAPU32, HEAPF32, HEAPF64;
function updateGlobalBufferAndViews(buf) {
buffer = buf;
Module["HEAP8"] = HEAP8 = new Int8Array(buf);
Module["HEAP16"] = HEAP16 = new Int16Array(buf);
Module["HEAP32"] = HEAP32 = new Int32Array(buf);
Module["HEAPU8"] = HEAPU8 = new Uint8Array(buf);
Module["HEAPU16"] = HEAPU16 = new Uint16Array(buf);
Module["HEAPU32"] = HEAPU32 = new Uint32Array(buf);
Module["HEAPF32"] = HEAPF32 = new Float32Array(buf);
Module["HEAPF64"] = HEAPF64 = new Float64Array(buf)
}
var STACK_BASE = 5268480
, DYNAMIC_BASE = 5268480
, DYNAMICTOP_PTR = 25440;
var INITIAL_TOTAL_MEMORY = Module["TOTAL_MEMORY"] || 16777216;
if (Module["wasmMemory"]) {
wasmMemory = Module["wasmMemory"]
} else {
wasmMemory = new WebAssembly.Memory({
"initial": INITIAL_TOTAL_MEMORY / WASM_PAGE_SIZE
})
}
if (wasmMemory) {
buffer = wasmMemory.buffer
}
INITIAL_TOTAL_MEMORY = buffer.byteLength;
updateGlobalBufferAndViews(buffer);
HEAP32[DYNAMICTOP_PTR >> 2] = DYNAMIC_BASE;
function callRuntimeCallbacks(callbacks) {
while (callbacks.length > 0) {
var callback = callbacks.shift();
if (typeof callback == "function") {
callback();
continue
}
var func = callback.func;
if (typeof func === "number") {
if (callback.arg === undefined) {
Module["dynCall_v"](func)
} else {
Module["dynCall_vi"](func, callback.arg)
}
} else {
func(callback.arg === undefined ? null : callback.arg)
}
}
}
var __ATPRERUN__ = [];
var __ATINIT__ = [];
var __ATMAIN__ = [];
var __ATEXIT__ = [];
var __ATPOSTRUN__ = [];
var runtimeInitialized = false;
var runtimeExited = false;
function preRun() {
if (Module["preRun"]) {
if (typeof Module["preRun"] == "function")
Module["preRun"] = [Module["preRun"]];
while (Module["preRun"].length) {
addOnPreRun(Module["preRun"].shift())
}
}
callRuntimeCallbacks(__ATPRERUN__)
}
function initRuntime() {
runtimeInitialized = true;
callRuntimeCallbacks(__ATINIT__)
}
function preMain() {
callRuntimeCallbacks(__ATMAIN__)
}
function exitRuntime() {
callRuntimeCallbacks(__ATEXIT__);
runtimeExited = true
}
function postRun() {
if (Module["postRun"]) {
if (typeof Module["postRun"] == "function")
Module["postRun"] = [Module["postRun"]];
while (Module["postRun"].length) {
addOnPostRun(Module["postRun"].shift())
}
}
callRuntimeCallbacks(__ATPOSTRUN__)
}
function addOnPreRun(cb) {
__ATPRERUN__.unshift(cb)
}
function addOnPostRun(cb) {
__ATPOSTRUN__.unshift(cb)
}
var Math_abs = Math.abs;
var Math_ceil = Math.ceil;
var Math_floor = Math.floor;
var Math_min = Math.min;
var runDependencies = 0;
var runDependencyWatcher = null;
var dependenciesFulfilled = null;
function addRunDependency(id) {
runDependencies++;
if (Module["monitorRunDependencies"]) {
Module["monitorRunDependencies"](runDependencies)
}
}
function removeRunDependency(id) {
runDependencies--;
if (Module["monitorRunDependencies"]) {
Module["monitorRunDependencies"](runDependencies)
}
if (runDependencies == 0) {
if (runDependencyWatcher !== null) {
clearInterval(runDependencyWatcher);
runDependencyWatcher = null
}
if (dependenciesFulfilled) {
var callback = dependenciesFulfilled;
dependenciesFulfilled = null;
callback()
}
}
}
Module["preloadedImages"] = {};
Module["preloadedAudios"] = {};
function abort(what) {
if (Module["onAbort"]) {
Module["onAbort"](what)
}
what += "";
out(what);
err(what);
ABORT = true;
EXITSTATUS = 1;
what = "abort(" + what + "). Build with -s ASSERTIONS=1 for more info.";
throw new WebAssembly.RuntimeError(what)
}
var dataURIPrefix = "data:application/octet-stream;base64,";
function isDataURI(filename) {
return String.prototype.startsWith ? filename.startsWith(dataURIPrefix) : filename.indexOf(dataURIPrefix) === 0
}
var wasmBinaryFile = "cipher.wasm";
if (!isDataURI(wasmBinaryFile)) {
wasmBinaryFile = locateFile(wasmBinaryFile)
}
function getBinary() {
try {
if (wasmBinary) {
return new Uint8Array(wasmBinary)
}
var binary = tryParseAsDataURI(wasmBinaryFile);
if (binary) {
return binary
}
if (readBinary) {
return readBinary(wasmBinaryFile)
} else {
throw "both async and sync fetching of the wasm failed"
}
} catch (err) {
abort(err)
}
}
function getBinaryPromise() {
if (!wasmBinary && (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) && typeof fetch === "function") {
return fetch(wasmBinaryFile, {
credentials: "same-origin"
}).then(function (response) {
if (!response["ok"]) {
throw "failed to load wasm binary file at '" + wasmBinaryFile + "'"
}
return response["arrayBuffer"]()
}).catch(function () {
return getBinary()
})
}
return new Promise(function (resolve, reject) {
resolve(getBinary())
}
)
}
function createWasm() {
var info = {
"env": asmLibraryArg,
"wasi_snapshot_preview1": asmLibraryArg
};
function receiveInstance(instance, module) {
var exports = instance.exports;
Module["asm"] = exports;
removeRunDependency("wasm-instantiate")
}
addRunDependency("wasm-instantiate");
function receiveInstantiatedSource(output) {
receiveInstance(output["instance"])
}
function instantiateArrayBuffer(receiver) {
return getBinaryPromise().then(function (binary) {
return WebAssembly.instantiate(binary, info)
}).then(receiver, function (reason) {
err("failed to asynchronously prepare wasm: " + reason);
abort(reason)
})
}
function instantiateAsync() {
if (!wasmBinary && typeof WebAssembly.instantiateStreaming === "function" && !isDataURI(wasmBinaryFile) && typeof fetch === "function") {
fetch(wasmBinaryFile, {
credentials: "same-origin"
}).then(function (response) {
var result = WebAssembly.instantiateStreaming(response, info);
return result.then(receiveInstantiatedSource, function (reason) {
err("wasm streaming compile failed: " + reason);
err("falling back to ArrayBuffer instantiation");
instantiateArrayBuffer(receiveInstantiatedSource)
})
})
} else {
return instantiateArrayBuffer(receiveInstantiatedSource)
}
}
if (Module["instantiateWasm"]) {
try {
var exports = Module["instantiateWasm"](info, receiveInstance);
return exports
} catch (e) {
err("Module.instantiateWasm callback failed with error: " + e);
return false
}
}
instantiateAsync();
return {}
}
var tempDouble;
var tempI64;
__ATINIT__.push({
func: function () {
___wasm_call_ctors()
}
});
function demangle(func) {
return func
}
function demangleAll(text) {
var regex = /\b_Z[\w\d_]+/g;
return text.replace(regex, function (x) {
var y = demangle(x);
return x === y ? x : y + " [" + x + "]"
})
}
function jsStackTrace() {
var err = new Error;
if (!err.stack) {
try {
throw new Error(0)
} catch (e) {
err = e
}
if (!err.stack) {
return "(no stack trace available)"
}
}
return err.stack.toString()
}
function ___cxa_allocate_exception(size) {
return _malloc(size)
}
var ___exception_infos = {};
var ___exception_last = 0;
function ___cxa_throw(ptr, type, destructor) {
___exception_infos[ptr] = {
ptr: ptr,
adjusted: [ptr],
type: type,
destructor: destructor,
refcount: 0,
caught: false,
rethrown: false
};
___exception_last = ptr;
if (!("uncaught_exception" in __ZSt18uncaught_exceptionv)) {
__ZSt18uncaught_exceptionv.uncaught_exceptions = 1
} else {
__ZSt18uncaught_exceptionv.uncaught_exceptions++
}
throw ptr
}
function ___lock() {
}
function ___unlock() {
}
var structRegistrations = {};
function runDestructors(destructors) {
while (destructors.length) {
var ptr = destructors.pop();
var del = destructors.pop();
del(ptr)
}
}
function simpleReadValueFromPointer(pointer) {
return this["fromWireType"](HEAPU32[pointer >> 2])
}
var awaitingDependencies = {};
var registeredTypes = {};
var typeDependencies = {};
var char_0 = 48;
var char_9 = 57;
function makeLegalFunctionName(name) {
if (undefined === name) {
return "_unknown"
}
name = name.replace(/[^a-zA-Z0-9_]/g, "$");
var f = name.charCodeAt(0);
if (f >= char_0 && f <= char_9) {
return "_" + name
} else {
return name
}
}
function createNamedFunction(name, body) {
name = makeLegalFunctionName(name);
return new Function("body", "return function " + name + "() {\n" + ' "use strict";' + " return body.apply(this, arguments);\n" + "};\n")(body)
}
function extendError(baseErrorType, errorName) {
var errorClass = createNamedFunction(errorName, function (message) {
this.name = errorName;
this.message = message;
var stack = new Error(message).stack;
if (stack !== undefined) {
this.stack = this.toString() + "\n" + stack.replace(/^Error(:[^\n]*)?\n/, "")
}
});
errorClass.prototype = Object.create(baseErrorType.prototype);
errorClass.prototype.constructor = errorClass;
errorClass.prototype.toString = function () {
if (this.message === undefined) {
return this.name
} else {
return this.name + ": " + this.message
}
}
;
return errorClass
}
var InternalError = undefined;
function throwInternalError(message) {
throw new InternalError(message)
}
function whenDependentTypesAreResolved(myTypes, dependentTypes, getTypeConverters) {
myTypes.forEach(function (type) {
typeDependencies[type] = dependentTypes
});
function onComplete(typeConverters) {
var myTypeConverters = getTypeConverters(typeConverters);
if (myTypeConverters.length !== myTypes.length) {
throwInternalError("Mismatched type converter count")
}
for (var i = 0; i < myTypes.length; ++i) {
registerType(myTypes[i], myTypeConverters[i])
}
}
var typeConverters = new Array(dependentTypes.length);
var unregisteredTypes = [];
var registered = 0;
dependentTypes.forEach(function (dt, i) {
if (registeredTypes.hasOwnProperty(dt)) {
typeConverters[i] = registeredTypes[dt]
} else {
unregisteredTypes.push(dt);
if (!awaitingDependencies.hasOwnProperty(dt)) {
awaitingDependencies[dt] = []
}
awaitingDependencies[dt].push(function () {
typeConverters[i] = registeredTypes[dt];
++registered;
if (registered === unregisteredTypes.length) {
onComplete(typeConverters)
}
})
}
});
if (0 === unregisteredTypes.length) {
onComplete(typeConverters)
}
}
function __embind_finalize_value_object(structType) {
var reg = structRegistrations[structType];
delete structRegistrations[structType];
var rawConstructor = reg.rawConstructor;
var rawDestructor = reg.rawDestructor;
var fieldRecords = reg.fields;
var fieldTypes = fieldRecords.map(function (field) {
return field.getterReturnType
}).concat(fieldRecords.map(function (field) {
return field.setterArgumentType
}));
whenDependentTypesAreResolved([structType], fieldTypes, function (fieldTypes) {
var fields = {};
fieldRecords.forEach(function (field, i) {
var fieldName = field.fieldName;
var getterReturnType = fieldTypes[i];
var getter = field.getter;
var getterContext = field.getterContext;
var setterArgumentType = fieldTypes[i + fieldRecords.length];
var setter = field.setter;
var setterContext = field.setterContext;
fields[fieldName] = {
read: function (ptr) {
return getterReturnType["fromWireType"](getter(getterContext, ptr))
},
write: function (ptr, o) {
var destructors = [];
setter(setterContext, ptr, setterArgumentType["toWireType"](destructors, o));
runDestructors(destructors)
}
}
});
return [{
name: reg.name,
"fromWireType": function (ptr) {
var rv = {};
for (var i in fields) {
rv[i] = fields[i].read(ptr)
}
rawDestructor(ptr);
return rv
},
"toWireType": function (destructors, o) {
for (var fieldName in fields) {
if (!(fieldName in o)) {
throw new TypeError("Missing field")
}
}
var ptr = rawConstructor();
for (fieldName in fields) {
fields[fieldName].write(ptr, o[fieldName])
}
if (destructors !== null) {
destructors.push(rawDestructor, ptr)
}
return ptr
},
"argPackAdvance": 8,
"readValueFromPointer": simpleReadValueFromPointer,
destructorFunction: rawDestructor
}]
})
}
function getShiftFromSize(size) {
switch (size) {
case 1:
return 0;
case 2:
return 1;
case 4:
return 2;
case 8:
return 3;
default:
throw new TypeError("Unknown type size: " + size)
}
}
function embind_init_charCodes() {
var codes = new Array(256);
for (var i = 0; i < 256; ++i) {
codes[i] = String.fromCharCode(i)
}
embind_charCodes = codes
}
var embind_charCodes = undefined;
function readLatin1String(ptr) {
var ret = "";
var c = ptr;
while (HEAPU8[c]) {
ret += embind_charCodes[HEAPU8[c++]]
}
return ret
}
var BindingError = undefined;
function throwBindingError(message) {
throw new BindingError(message)
}
function registerType(rawType, registeredInstance, options) {
options = options || {};
if (!("argPackAdvance" in registeredInstance)) {
throw new TypeError("registerType registeredInstance requires argPackAdvance")
}
var name = registeredInstance.name;
if (!rawType) {
throwBindingError('type "' + name + '" must have a positive integer typeid pointer')
}
if (registeredTypes.hasOwnProperty(rawType)) {
if (options.ignoreDuplicateRegistrations) {
return
} else {
throwBindingError("Cannot register type '" + name + "' twice")
}
}
registeredTypes[rawType] = registeredInstance;
delete typeDependencies[rawType];
if (awaitingDependencies.hasOwnProperty(rawType)) {
var callbacks = awaitingDependencies[rawType];
delete awaitingDependencies[rawType];
callbacks.forEach(function (cb) {
cb()
})
}
}
function __embind_register_bool(rawType, name, size, trueValue, falseValue) {
var shift = getShiftFromSize(size);
name = readLatin1String(name);
registerType(rawType, {
name: name,
"fromWireType": function (wt) {
return !!wt
},
"toWireType": function (destructors, o) {
return o ? trueValue : falseValue
},
"argPackAdvance": 8,
"readValueFromPointer": function (pointer) {
var heap;
if (size === 1) {
heap = HEAP8
} else if (size === 2) {
heap = HEAP16
} else if (size === 4) {
heap = HEAP32
} else {
throw new TypeError("Unknown boolean type size: " + name)
}
return this["fromWireType"](heap[pointer >> shift])
},
destructorFunction: null
})
}
var emval_free_list = [];
var emval_handle_array = [{}, {
value: undefined
}, {
value: null
}, {
value: true
}, {
value: false
}];
function __emval_decref(handle) {
if (handle > 4 && 0 === --emval_handle_array[handle].refcount) {
emval_handle_array[handle] = undefined;
emval_free_list.push(handle)
}
}
function count_emval_handles() {
var count = 0;
for (var i = 5; i < emval_handle_array.length; ++i) {
if (emval_handle_array[i] !== undefined) {
++count
}
}
return count
}
function get_first_emval() {
for (var i = 5; i < emval_handle_array.length; ++i) {
if (emval_handle_array[i] !== undefined) {
return emval_handle_array[i]
}
}
return null
}
function init_emval() {
Module["count_emval_handles"] = count_emval_handles;
Module["get_first_emval"] = get_first_emval
}
function __emval_register(value) {
switch (value) {
case undefined: {
return 1
}
case null: {
return 2
}
case true: {
return 3
}
case false: {
return 4
}
default: {
var handle = emval_free_list.length ? emval_free_list.pop() : emval_handle_array.length;
emval_handle_array[handle] = {
refcount: 1,
value: value
};
return handle
}
}
}
function __embind_register_emval(rawType, name) {
name = readLatin1String(name);
registerType(rawType, {
name: name,
"fromWireType": function (handle) {
var rv = emval_handle_array[handle].value;
__emval_decref(handle);
return rv
},
"toWireType": function (destructors, value) {
return __emval_register(value)
},
"argPackAdvance": 8,
"readValueFromPointer": simpleReadValueFromPointer,
destructorFunction: null
})
}
function _embind_repr(v) {
if (v === null) {
return "null"
}
var t = typeof v;
if (t === "object" || t === "array" || t === "function") {
return v.toString()
} else {
return "" + v
}
}
function floatReadValueFromPointer(name, shift) {
switch (shift) {
case 2:
return function (pointer) {
return this["fromWireType"](HEAPF32[pointer >> 2])
}
;
case 3:
return function (pointer) {
return this["fromWireType"](HEAPF64[pointer >> 3])
}
;
default:
throw new TypeError("Unknown float type: " + name)
}
}
function __embind_register_float(rawType, name, size) {
var shift = getShiftFromSize(size);
name = readLatin1String(name);
registerType(rawType, {
name: name,
"fromWireType": function (value) {
return value
},
"toWireType": function (destructors, value) {
if (typeof value !== "number" && typeof value !== "boolean") {
throw new TypeError('Cannot convert "' + _embind_repr(value) + '" to ' + this.name)
}
return value
},
"argPackAdvance": 8,
"readValueFromPointer": floatReadValueFromPointer(name, shift),
destructorFunction: null
})
}
function new_(constructor, argumentList) {
if (!(constructor instanceof Function)) {
throw new TypeError("new_ called with constructor type " + typeof constructor + " which is not a function")
}
var dummy = createNamedFunction(constructor.name || "unknownFunctionName", function () {
});
dummy.prototype = constructor.prototype;
var obj = new dummy;
var r = constructor.apply(obj, argumentList);
return r instanceof Object ? r : obj
}
function craftInvokerFunction(humanName, argTypes, classType, cppInvokerFunc, cppTargetFunc) {
var argCount = argTypes.length;
if (argCount < 2) {
throwBindingError("argTypes array size mismatch! Must at least get return value and 'this' types!")
}
var isClassMethodFunc = argTypes[1] !== null && classType !== null;
var needsDestructorStack = false;
for (var i = 1; i < argTypes.length; ++i) {
if (argTypes[i] !== null && argTypes[i].destructorFunction === undefined) {
needsDestructorStack = true;
break
}
}
var returns = argTypes[0].name !== "void";
var argsList = "";
var argsListWired = "";
for (var i = 0; i < argCount - 2; ++i) {
argsList += (i !== 0 ? ", " : "") + "arg" + i;
argsListWired += (i !== 0 ? ", " : "") + "arg" + i + "Wired"
}
var invokerFnBody = "return function " + makeLegalFunctionName(humanName) + "(" + argsList + ") {\n" + "if (arguments.length !== " + (argCount - 2) + ") {\n" + "throwBindingError('function " + humanName + " called with ' + arguments.length + ' arguments, expected " + (argCount - 2) + " args!');\n" + "}\n";
if (needsDestructorStack) {
invokerFnBody += "var destructors = [];\n"
}
var dtorStack = needsDestructorStack ? "destructors" : "null";
var args1 = ["throwBindingError", "invoker", "fn", "runDestructors", "retType", "classParam"];
var args2 = [throwBindingError, cppInvokerFunc, cppTargetFunc, runDestructors, argTypes[0], argTypes[1]];
if (isClassMethodFunc) {
invokerFnBody += "var thisWired = classParam.toWireType(" + dtorStack + ", this);\n"
}
for (var i = 0; i < argCount - 2; ++i) {
invokerFnBody += "var arg" + i + "Wired = argType" + i + ".toWireType(" + dtorStack + ", arg" + i + "); // " + argTypes[i + 2].name + "\n";
args1.push("argType" + i);
args2.push(argTypes[i + 2])
}
if (isClassMethodFunc) {
argsListWired = "thisWired" + (argsListWired.length > 0 ? ", " : "") + argsListWired
}
invokerFnBody += (returns ? "var rv = " : "") + "invoker(fn" + (argsListWired.length > 0 ? ", " : "") + argsListWired + ");\n";
if (needsDestructorStack) {
invokerFnBody += "runDestructors(destructors);\n"
} else {
for (var i = isClassMethodFunc ? 1 : 2; i < argTypes.length; ++i) {
var paramName = i === 1 ? "thisWired" : "arg" + (i - 2) + "Wired";
if (argTypes[i].destructorFunction !== null) {
invokerFnBody += paramName + "_dtor(" + paramName + "); // " + argTypes[i].name + "\n";
args1.push(paramName + "_dtor");
args2.push(argTypes[i].destructorFunction)
}
}
}
if (returns) {
invokerFnBody += "var ret = retType.fromWireType(rv);\n" + "return ret;\n"
} else {
}
invokerFnBody += "}\n";
args1.push(invokerFnBody);
var invokerFunction = new_(Function, args1).apply(null, args2);
return invokerFunction
}
function ensureOverloadTable(proto, methodName, humanName) {
if (undefined === proto[methodName].overloadTable) {
var prevFunc = proto[methodName];
proto[methodName] = function () {
if (!proto[methodName].overloadTable.hasOwnProperty(arguments.length)) {
throwBindingError("Function '" + humanName + "' called with an invalid number of arguments (" + arguments.length + ") - expects one of (" + proto[methodName].overloadTable + ")!")
}
return proto[methodName].overloadTable[arguments.length].apply(this, arguments)
}
;
proto[methodName].overloadTable = [];
proto[methodName].overloadTable[prevFunc.argCount] = prevFunc
}
}
function exposePublicSymbol(name, value, numArguments) {
if (Module.hasOwnProperty(name)) {
if (undefined === numArguments || undefined !== Module[name].overloadTable && undefined !== Module[name].overloadTable[numArguments]) {
throwBindingError("Cannot register public name '" + name + "' twice")
}
ensureOverloadTable(Module, name, name);
if (Module.hasOwnProperty(numArguments)) {
throwBindingError("Cannot register multiple overloads of a function with the same number of arguments (" + numArguments + ")!")
}
Module[name].overloadTable[numArguments] = value
} else {
Module[name] = value;
if (undefined !== numArguments) {
Module[name].numArguments = numArguments
}
}
}
function heap32VectorToArray(count, firstElement) {
var array = [];
for (var i = 0; i < count; i++) {
array.push(HEAP32[(firstElement >> 2) + i])
}
return array
}
function replacePublicSymbol(name, value, numArguments) {
if (!Module.hasOwnProperty(name)) {
throwInternalError("Replacing nonexistant public symbol")
}
if (undefined !== Module[name].overloadTable && undefined !== numArguments) {
Module[name].overloadTable[numArguments] = value
} else {
Module[name] = value;
Module[name].argCount = numArguments
}
}
function embind__requireFunction(signature, rawFunction) {
signature = readLatin1String(signature);
function makeDynCaller(dynCall) {
var args = [];
for (var i = 1; i < signature.length; ++i) {
args.push("a" + i)
}
var name = "dynCall_" + signature + "_" + rawFunction;
var body = "return function " + name + "(" + args.join(", ") + ") {\n";
body += " return dynCall(rawFunction" + (args.length ? ", " : "") + args.join(", ") + ");\n";
body += "};\n";
return new Function("dynCall", "rawFunction", body)(dynCall, rawFunction)
}
var fp;
if (Module["FUNCTION_TABLE_" + signature] !== undefined) {
fp = Module["FUNCTION_TABLE_" + signature][rawFunction]
} else if (typeof FUNCTION_TABLE !== "undefined") {
fp = FUNCTION_TABLE[rawFunction]
} else {
var dc = Module["dynCall_" + signature];
if (dc === undefined) {
dc = Module["dynCall_" + signature.replace(/f/g, "d")];
if (dc === undefined) {
throwBindingError("No dynCall invoker for signature: " + signature)
}
}
fp = makeDynCaller(dc)
}
if (typeof fp !== "function") {
throwBindingError("unknown function pointer with signature " + signature + ": " + rawFunction)
}
return fp
}
var UnboundTypeError = undefined;
function getTypeName(type) {
var ptr = ___getTypeName(type);
var rv = readLatin1String(ptr);
_free(ptr);
return rv
}
function throwUnboundTypeError(message, types) {
var unboundTypes = [];
var seen = {};
function visit(type) {
if (seen[type]) {
return
}
if (registeredTypes[type]) {
return
}
if (typeDependencies[type]) {
typeDependencies[type].forEach(visit);
return
}
unboundTypes.push(type);
seen[type] = true
}
types.forEach(visit);
throw new UnboundTypeError(message + ": " + unboundTypes.map(getTypeName).join([", "]))
}
function __embind_register_function(name, argCount, rawArgTypesAddr, signature, rawInvoker, fn) {
var argTypes = heap32VectorToArray(argCount, rawArgTypesAddr);
name = readLatin1String(name);
rawInvoker = embind__requireFunction(signature, rawInvoker);
exposePublicSymbol(name, function () {
throwUnboundTypeError("Cannot call " + name + " due to unbound types", argTypes)
}, argCount - 1);
whenDependentTypesAreResolved([], argTypes, function (argTypes) {
var invokerArgsArray = [argTypes[0], null].concat(argTypes.slice(1));
replacePublicSymbol(name, craftInvokerFunction(name, invokerArgsArray, null, rawInvoker, fn), argCount - 1);
return []
})
}
function integerReadValueFromPointer(name, shift, signed) {
switch (shift) {
case 0:
return signed ? function readS8FromPointer(pointer) {
return HEAP8[pointer]
}
: function readU8FromPointer(pointer) {
return HEAPU8[pointer]
}
;
case 1:
return signed ? function readS16FromPointer(pointer) {
return HEAP16[pointer >> 1]
}
: function readU16FromPointer(pointer) {
return HEAPU16[pointer >> 1]
}
;
case 2:
return signed ? function readS32FromPointer(pointer) {
return HEAP32[pointer >> 2]
}
: function readU32FromPointer(pointer) {
return HEAPU32[pointer >> 2]
}
;
default:
throw new TypeError("Unknown integer type: " + name)
}
}
function __embind_register_integer(primitiveType, name, size, minRange, maxRange) {
name = readLatin1String(name);
if (maxRange === -1) {
maxRange = 4294967295
}
var shift = getShiftFromSize(size);
var fromWireType = function (value) {
return value
};
if (minRange === 0) {
var bitshift = 32 - 8 * size;
fromWireType = function (value) {
return value << bitshift >>> bitshift
}
}
var isUnsignedType = name.indexOf("unsigned") != -1;
registerType(primitiveType, {
name: name,
"fromWireType": fromWireType,
"toWireType": function (destructors, value) {
if (typeof value !== "number" && typeof value !== "boolean") {
throw new TypeError('Cannot convert "' + _embind_repr(value) + '" to ' + this.name)
}
if (value < minRange || value > maxRange) {
throw new TypeError('Passing a number "' + _embind_repr(value) + '" from JS side to C/C++ side to an argument of type "' + name + '", which is outside the valid range [' + minRange + ", " + maxRange + "]!")
}
return isUnsignedType ? value >>> 0 : value | 0
},
"argPackAdvance": 8,
"readValueFromPointer": integerReadValueFromPointer(name, shift, minRange !== 0),
destructorFunction: null
})
}
function __embind_register_memory_view(rawType, dataTypeIndex, name) {
var typeMapping = [Int8Array, Uint8Array, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array];
var TA = typeMapping[dataTypeIndex];
function decodeMemoryView(handle) {
handle = handle >> 2;
var heap = HEAPU32;
var size = heap[handle];
var data = heap[handle + 1];
return new TA(heap["buffer"], data, size)
}
name = readLatin1String(name);
registerType(rawType, {
name: name,
"fromWireType": decodeMemoryView,
"argPackAdvance": 8,
"readValueFromPointer": decodeMemoryView
}, {
ignoreDuplicateRegistrations: true
})
}
function __embind_register_std_string(rawType, name) {
name = readLatin1String(name);
var stdStringIsUTF8 = name === "std::string";
registerType(rawType, {
name: name,
"fromWireType": function (value) {
var length = HEAPU32[value >> 2];
var str;
if (stdStringIsUTF8) {
var endChar = HEAPU8[value + 4 + length];
var endCharSwap = 0;
if (endChar != 0) {
endCharSwap = endChar;
HEAPU8[value + 4 + length] = 0
}
var decodeStartPtr = value + 4;
for (var i = 0; i <= length; ++i) {
var currentBytePtr = value + 4 + i;
if (HEAPU8[currentBytePtr] == 0) {
var stringSegment = UTF8ToString(decodeStartPtr);
if (str === undefined)
str = stringSegment;
else {
str += String.fromCharCode(0);
str += stringSegment
}
decodeStartPtr = currentBytePtr + 1
}
}
if (endCharSwap != 0)
HEAPU8[value + 4 + length] = endCharSwap
} else {
var a = new Array(length);
for (var i = 0; i < length; ++i) {
a[i] = String.fromCharCode(HEAPU8[value + 4 + i])
}
str = a.join("")
}
_free(value);
return str
},
"toWireType": function (destructors, value) {
if (value instanceof ArrayBuffer) {
value = new Uint8Array(value)
}
var getLength;
var valueIsOfTypeString = typeof value === "string";
if (!(valueIsOfTypeString || value instanceof Uint8Array || value instanceof Uint8ClampedArray || value instanceof Int8Array)) {
throwBindingError("Cannot pass non-string to std::string")
}
if (stdStringIsUTF8 && valueIsOfTypeString) {
getLength = function () {
return lengthBytesUTF8(value)
}
} else {
getLength = function () {
return value.length
}
}
var length = getLength();
var ptr = _malloc(4 + length + 1);
HEAPU32[ptr >> 2] = length;
if (stdStringIsUTF8 && valueIsOfTypeString) {
stringToUTF8(value, ptr + 4, length + 1)
} else {
if (valueIsOfTypeString) {
for (var i = 0; i < length; ++i) {
var charCode = value.charCodeAt(i);
if (charCode > 255) {
_free(ptr);
throwBindingError("String has UTF-16 code units that do not fit in 8 bits")
}
HEAPU8[ptr + 4 + i] = charCode
}
} else {
for (var i = 0; i < length; ++i) {
HEAPU8[ptr + 4 + i] = value[i]
}
}
}
if (destructors !== null) {
destructors.push(_free, ptr)
}
return ptr
},
"argPackAdvance": 8,
"readValueFromPointer": simpleReadValueFromPointer,
destructorFunction: function (ptr) {
_free(ptr)
}
})
}
function __embind_register_std_wstring(rawType, charSize, name) {
name = readLatin1String(name);
var getHeap, shift;
if (charSize === 2) {
getHeap = function () {
return HEAPU16
}
;
shift = 1
} else if (charSize === 4) {
getHeap = function () {
return HEAPU32
}
;
shift = 2
}
registerType(rawType, {
name: name,
"fromWireType": function (value) {
var HEAP = getHeap();
var length = HEAPU32[value >> 2];
var a = new Array(length);
var start = value + 4 >> shift;
for (var i = 0; i < length; ++i) {
a[i] = String.fromCharCode(HEAP[start + i])
}
_free(value);
return a.join("")
},
"toWireType": function (destructors, value) {
var length = value.length;
var ptr = _malloc(4 + length * charSize);
var HEAP = getHeap();
HEAPU32[ptr >> 2] = length;
var start = ptr + 4 >> shift;
for (var i = 0; i < length; ++i) {
HEAP[start + i] = value.charCodeAt(i)
}
if (destructors !== null) {
destructors.push(_free, ptr)
}
return ptr
},
"argPackAdvance": 8,
"readValueFromPointer": simpleReadValueFromPointer,
destructorFunction: function (ptr) {
_free(ptr)
}
})
}
function __embind_register_value_object(rawType, name, constructorSignature, rawConstructor, destructorSignature, rawDestructor) {
structRegistrations[rawType] = {
name: readLatin1String(name),
rawConstructor: embind__requireFunction(constructorSignature, rawConstructor),
rawDestructor: embind__requireFunction(destructorSignature, rawDestructor),
fields: []
}
}
function __embind_register_value_object_field(structType, fieldName, getterReturnType, getterSignature, getter, getterContext, setterArgumentType, setterSignature, setter, setterContext) {
structRegistrations[structType].fields.push({
fieldName: readLatin1String(fieldName),
getterReturnType: getterReturnType,
getter: embind__requireFunction(getterSignature, getter),
getterContext: getterContext,
setterArgumentType: setterArgumentType,
setter: embind__requireFunction(setterSignature, setter),
setterContext: setterContext
})
}
function __embind_register_void(rawType, name) {
name = readLatin1String(name);
registerType(rawType, {
isVoid: true,
name: name,
"argPackAdvance": 0,
"fromWireType": function () {
return undefined
},
"toWireType": function (destructors, o) {
return undefined
}
})
}
function _abort() {
abort()
}
function _emscripten_get_heap_size() {
return HEAP8.length
}
function _emscripten_get_sbrk_ptr() {
return 25440
}
function _emscripten_memcpy_big(dest, src, num) {
HEAPU8.set(HEAPU8.subarray(src, src + num), dest)
}
function emscripten_realloc_buffer(size) {
try {
wasmMemory.grow(size - buffer.byteLength + 65535 >> 16);
updateGlobalBufferAndViews(wasmMemory.buffer);
return 1
} catch (e) {
}
}
function _emscripten_resize_heap(requestedSize) {
var oldSize = _emscripten_get_heap_size();
var PAGE_MULTIPLE = 65536;
var LIMIT = 2147483648 - PAGE_MULTIPLE;
if (requestedSize > LIMIT) {
return false
}
var MIN_TOTAL_MEMORY = 16777216;
var newSize = Math.max(oldSize, MIN_TOTAL_MEMORY);
while (newSize < requestedSize) {
if (newSize <= 536870912) {
newSize = alignUp(2 * newSize, PAGE_MULTIPLE)
} else {
newSize = Math.min(alignUp((3 * newSize + 2147483648) / 4, PAGE_MULTIPLE), LIMIT)
}
}
var replacement = emscripten_realloc_buffer(newSize);
if (!replacement) {
return false
}
return true
}
var ENV = {};
function _emscripten_get_environ() {
if (!_emscripten_get_environ.strings) {
var env = {
"USER": "web_user",
"LOGNAME": "web_user",
"PATH": "/",
"PWD": "/",
"HOME": "/home/web_user",
"LANG": (typeof navigator === "object" && navigator.languages && navigator.languages[0] || "C").replace("-", "_") + ".UTF-8",
"_": thisProgram
};
for (var x in ENV) {
env[x] = ENV[x]
}
var strings = [];
for (var x in env) {
strings.push(x + "=" + env[x])
}
_emscripten_get_environ.strings = strings
}
return _emscripten_get_environ.strings
}
function _environ_get(__environ, environ_buf) {
var strings = _emscripten_get_environ();
var bufSize = 0;
strings.forEach(function (string, i) {
var ptr = environ_buf + bufSize;
HEAP32[__environ + i * 4 >> 2] = ptr;
writeAsciiToMemory(string, ptr);
bufSize += string.length + 1
});
return 0
}
function _environ_sizes_get(penviron_count, penviron_buf_size) {
var strings = _emscripten_get_environ();
HEAP32[penviron_count >> 2] = strings.length;
var bufSize = 0;
strings.forEach(function (string) {
bufSize += string.length + 1
});
HEAP32[penviron_buf_size >> 2] = bufSize;
return 0
}
function flush_NO_FILESYSTEM() {
var fflush = Module["_fflush"];
if (fflush)
fflush(0);
var buffers = SYSCALLS.buffers;
if (buffers[1].length)
SYSCALLS.printChar(1, 10);
if (buffers[2].length)
SYSCALLS.printChar(2, 10)
}
var PATH = {
splitPath: function (filename) {
var splitPathRe = /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;
return splitPathRe.exec(filename).slice(1)
},
normalizeArray: function (parts, allowAboveRoot) {
var up = 0;
for (var i = parts.length - 1; i >= 0; i--) {
var last = parts[i];
if (last === ".") {
parts.splice(i, 1)
} else if (last === "..") {
parts.splice(i, 1);
up++
} else if (up) {
parts.splice(i, 1);
up--
}
}
if (allowAboveRoot) {
for (; up; up--) {
parts.unshift("..")
}
}
return parts
},
normalize: function (path) {
var isAbsolute = path.charAt(0) === "/"
, trailingSlash = path.substr(-1) === "/";
path = PATH.normalizeArray(path.split("/").filter(function (p) {
return !!p
}), !isAbsolute).join("/");
if (!path && !isAbsolute) {
path = "."
}
if (path && trailingSlash) {
path += "/"
}
return (isAbsolute ? "/" : "") + path
},
dirname: function (path) {
var result = PATH.splitPath(path)
, root = result[0]
, dir = result[1];
if (!root && !dir) {
return "."
}
if (dir) {
dir = dir.substr(0, dir.length - 1)
}
return root + dir
},
basename: function (path) {
if (path === "/")
return "/";
var lastSlash = path.lastIndexOf("/");
if (lastSlash === -1)
return path;
return path.substr(lastSlash + 1)
},
extname: function (path) {
return PATH.splitPath(path)[3]
},
join: function () {
var paths = Array.prototype.slice.call(arguments, 0);
return PATH.normalize(paths.join("/"))
},
join2: function (l, r) {
return PATH.normalize(l + "/" + r)
}
};
var SYSCALLS = {
buffers: [null, [], []],
printChar: function (stream, curr) {
var buffer = SYSCALLS.buffers[stream];
if (curr === 0 || curr === 10) {
(stream === 1 ? out : err)(UTF8ArrayToString(buffer, 0));
buffer.length = 0
} else {
buffer.push(curr)
}
},
varargs: 0,
get: function (varargs) {
SYSCALLS.varargs += 4;
var ret = HEAP32[SYSCALLS.varargs - 4 >> 2];
return ret
},
getStr: function () {
var ret = UTF8ToString(SYSCALLS.get());
return ret
},
get64: function () {
var low = SYSCALLS.get()
, high = SYSCALLS.get();
return low
},
getZero: function () {
SYSCALLS.get()
}
};
function _fd_write(fd, iov, iovcnt, pnum) {
try {
var num = 0;
for (var i = 0; i < iovcnt; i++) {
var ptr = HEAP32[iov + i * 8 >> 2];
var len = HEAP32[iov + (i * 8 + 4) >> 2];
for (var j = 0; j < len; j++) {
SYSCALLS.printChar(fd, HEAPU8[ptr + j])
}
num += len
}
HEAP32[pnum >> 2] = num;
return 0
} catch (e) {
if (typeof FS === "undefined" || !(e instanceof FS.ErrnoError))
abort(e);
return e.errno
}
}
InternalError = Module["InternalError"] = extendError(Error, "InternalError");
embind_init_charCodes();
BindingError = Module["BindingError"] = extendError(Error, "BindingError");
init_emval();
UnboundTypeError = Module["UnboundTypeError"] = extendError(Error, "UnboundTypeError");
__ATEXIT__.push(flush_NO_FILESYSTEM);
var ASSERTIONS = false;
function intArrayToString(array) {
var ret = [];
for (var i = 0; i < array.length; i++) {
var chr = array[i];
if (chr > 255) {
if (ASSERTIONS) {
assert(false, "Character code " + chr + " (" + String.fromCharCode(chr) + ") at offset " + i + " not in 0x00-0xFF.")
}
chr &= 255
}
ret.push(String.fromCharCode(chr))
}
return ret.join("")
}
var decodeBase64 = typeof atob === "function" ? atob : function (input) {
var keyStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
var output = "";
var chr1, chr2, chr3;
var enc1, enc2, enc3, enc4;
var i = 0;
input = input.replace(/[^A-Za-z0-9\+\/\=]/g, "");
do {
enc1 = keyStr.indexOf(input.charAt(i++));
enc2 = keyStr.indexOf(input.charAt(i++));
enc3 = keyStr.indexOf(input.charAt(i++));
enc4 = keyStr.indexOf(input.charAt(i++));
chr1 = enc1 << 2 | enc2 >> 4;
chr2 = (enc2 & 15) << 4 | enc3 >> 2;
chr3 = (enc3 & 3) << 6 | enc4;
output = output + String.fromCharCode(chr1);
if (enc3 !== 64) {
output = output + String.fromCharCode(chr2)
}
if (enc4 !== 64) {
output = output + String.fromCharCode(chr3)
}
} while (i < input.length);
return output
}
;
function intArrayFromBase64(s) {
if (typeof ENVIRONMENT_IS_NODE === "boolean" && ENVIRONMENT_IS_NODE) {
var buf;
try {
buf = Buffer.from(s, "base64")
} catch (_) {
buf = new Buffer(s, "base64")
}
return new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength)
}
try {
var decoded = decodeBase64(s);
var bytes = new Uint8Array(decoded.length);
for (var i = 0; i < decoded.length; ++i) {
bytes[i] = decoded.charCodeAt(i)
}
return bytes
} catch (_) {
throw new Error("Converting base64 string to bytes failed.")
}
}
function tryParseAsDataURI(filename) {
if (!isDataURI(filename)) {
return
}
return intArrayFromBase64(filename.slice(dataURIPrefix.length))
}
var asmLibraryArg = {
"__cxa_allocate_exception": ___cxa_allocate_exception,
"__cxa_throw": ___cxa_throw,
"__lock": ___lock,
"__unlock": ___unlock,
"_embind_finalize_value_object": __embind_finalize_value_object,
"_embind_register_bool": __embind_register_bool,
"_embind_register_emval": __embind_register_emval,
"_embind_register_float": __embind_register_float,
"_embind_register_function": __embind_register_function,
"_embind_register_integer": __embind_register_integer,
"_embind_register_memory_view": __embind_register_memory_view,
"_embind_register_std_string": __embind_register_std_string,
"_embind_register_std_wstring": __embind_register_std_wstring,
"_embind_register_value_object": __embind_register_value_object,
"_embind_register_value_object_field": __embind_register_value_object_field,
"_embind_register_void": __embind_register_void,
"abort": _abort,
"emscripten_get_sbrk_ptr": _emscripten_get_sbrk_ptr,
"emscripten_memcpy_big": _emscripten_memcpy_big,
"emscripten_resize_heap": _emscripten_resize_heap,
"environ_get": _environ_get,
"environ_sizes_get": _environ_sizes_get,
"fd_write": _fd_write,
"getTempRet0": getTempRet0,
"memory": wasmMemory,
"setTempRet0": setTempRet0,
"table": wasmTable
};
var asm = createWasm();
Module["asm"] = asm;
var ___wasm_call_ctors = Module["___wasm_call_ctors"] = function () {
return Module["asm"]["__wasm_call_ctors"].apply(null, arguments)
}
;
var _free = Module["_free"] = function () {
return Module["asm"]["free"].apply(null, arguments)
}
;
var ___errno_location = Module["___errno_location"] = function () {
return Module["asm"]["__errno_location"].apply(null, arguments)
}
;
var _malloc = Module["_malloc"] = function () {
return Module["asm"]["malloc"].apply(null, arguments)
}
;
var _htons = Module["_htons"] = function () {
return Module["asm"]["htons"].apply(null, arguments)
}
;
var _ntohs = Module["_ntohs"] = function () {
return Module["asm"]["ntohs"].apply(null, arguments)
}
;
var _htonl = Module["_htonl"] = function () {
return Module["asm"]["htonl"].apply(null, arguments)
}
;
var _fflush = Module["_fflush"] = function () {
return Module["asm"]["fflush"].apply(null, arguments)
}
;
var _setThrew = Module["_setThrew"] = function () {
return Module["asm"]["setThrew"].apply(null, arguments)
}
;
var __ZSt18uncaught_exceptionv = Module["__ZSt18uncaught_exceptionv"] = function () {
return Module["asm"]["_ZSt18uncaught_exceptionv"].apply(null, arguments)
}
;
var ___getTypeName = Module["___getTypeName"] = function () {
return Module["asm"]["__getTypeName"].apply(null, arguments)
}
;
var ___embind_register_native_and_builtin_types = Module["___embind_register_native_and_builtin_types"] = function () {
return Module["asm"]["__embind_register_native_and_builtin_types"].apply(null, arguments)
}
;
var stackSave = Module["stackSave"] = function () {
return Module["asm"]["stackSave"].apply(null, arguments)
}
;
var stackAlloc = Module["stackAlloc"] = function () {
return Module["asm"]["stackAlloc"].apply(null, arguments)
}
;
var stackRestore = Module["stackRestore"] = function () {
return Module["asm"]["stackRestore"].apply(null, arguments)
}
;
var __growWasmMemory = Module["__growWasmMemory"] = function () {
return Module["asm"]["__growWasmMemory"].apply(null, arguments)
}
;
var dynCall_iiii = Module["dynCall_iiii"] = function () {
return Module["asm"]["dynCall_iiii"].apply(null, arguments)
}
;
var dynCall_viii = Module["dynCall_viii"] = function () {
return Module["asm"]["dynCall_viii"].apply(null, arguments)
}
;
var dynCall_iiiii = Module["dynCall_iiiii"] = function () {
return Module["asm"]["dynCall_iiiii"].apply(null, arguments)
}
;
var dynCall_iiiiiii = Module["dynCall_iiiiiii"] = function () {
return Module["asm"]["dynCall_iiiiiii"].apply(null, arguments)
}
;
var dynCall_iiiiiiii = Module["dynCall_iiiiiiii"] = function () {
return Module["asm"]["dynCall_iiiiiiii"].apply(null, arguments)
}
;
var dynCall_i = Module["dynCall_i"] = function () {
return Module["asm"]["dynCall_i"].apply(null, arguments)
}
;
var dynCall_vi = Module["dynCall_vi"] = function () {
return Module["asm"]["dynCall_vi"].apply(null, arguments)
}
;
var dynCall_ii = Module["dynCall_ii"] = function () {
return Module["asm"]["dynCall_ii"].apply(null, arguments)
}
;
var dynCall_iii = Module["dynCall_iii"] = function () {
return Module["asm"]["dynCall_iii"].apply(null, arguments)
}
;
var dynCall_jiji = Module["dynCall_jiji"] = function () {
return Module["asm"]["dynCall_jiji"].apply(null, arguments)
}
;
var dynCall_viiiiii = Module["dynCall_viiiiii"] = function () {
return Module["asm"]["dynCall_viiiiii"].apply(null, arguments)
}
;
var dynCall_viiiii = Module["dynCall_viiiii"] = function () {
return Module["asm"]["dynCall_viiiii"].apply(null, arguments)
}
;
var dynCall_viiii = Module["dynCall_viiii"] = function () {
return Module["asm"]["dynCall_viiii"].apply(null, arguments)
}
;
Module["asm"] = asm;
var calledRun;
function ExitStatus(status) {
this.name = "ExitStatus";
this.message = "Program terminated with exit(" + status + ")";
this.status = status
}
dependenciesFulfilled = function runCaller() {
if (!calledRun)
run();
if (!calledRun)
dependenciesFulfilled = runCaller
}
;
function run(args) {
args = args || arguments_;
if (runDependencies > 0) {
return
}
preRun();
if (runDependencies > 0)
return;
function doRun() {
if (calledRun)
return;
calledRun = true;
if (ABORT)
return;
initRuntime();
preMain();
if (Module["onRuntimeInitialized"])
Module["onRuntimeInitialized"]();
postRun()
}
if (Module["setStatus"]) {
Module["setStatus"]("Running...");
setTimeout(function () {
setTimeout(function () {
Module["setStatus"]("")
}, 1);
doRun()
}, 1)
} else {
doRun()
}
}
Module["run"] = run;
if (Module["preInit"]) {
if (typeof Module["preInit"] == "function")
Module["preInit"] = [Module["preInit"]];
while (Module["preInit"].length > 0) {
Module["preInit"].pop()()
}
}
run();
while (typeof Module["getEncryptData"] === "undefined") {
deasync.sleep(100)
}
var f = Module;
windows.f = Module
var o = "E736B80A35290F193C2034A8021CC63B"
, i = null;
function a() {
var t = navigator.connection || navigator.mozConnection || navigator.webkitConnection || {};
return t.type || (t.bandwidth && "number" == typeof t.bandwidth ? t.bandwidth > 10 ? t.type = "wifi" : t.bandwidth > 2 ? t.type = "3g" : t.bandwidth > 0 ? t.type = "2g" : 0 == t.bandwidth ? t.type = "none" : t.type = "unknown" : t.type = "unknown"),
t.type
}
function s(t, e, n) {
var r = t
, a = o;
e && (i = e);
return JSON.stringify(windows.f.getEncryptData(r, n))
// try {
// return n ? JSON.stringify(window.f.getEncryptData(r, n)) : c(r, a)
// } catch (t) {
// return c(r, a)
// }
}
function c(t, e) {
return u(f(t, e, i))
}
function u(t) {
var e, n, r, o, i, a, s, c = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_".split("");
for (n = r = 0,
o = t.length,
a = (o -= i = o % 3) / 3 << 2,
i > 0 && (a += 4),
e = new Array(a); n < o;)
s = t.charCodeAt(n++) << 16 | t.charCodeAt(n++) << 8 | t.charCodeAt(n++),
e[r++] = c[s >> 18] + c[s >> 12 & 63] + c[s >> 6 & 63] + c[63 & s];
return 1 == i ? (s = t.charCodeAt(n++),
e[r++] = c[s >> 2] + c[(3 & s) << 4]) : 2 == i && (s = t.charCodeAt(n++) << 8 | t.charCodeAt(n++),
e[r++] = c[s >> 10] + c[s >> 4 & 63] + c[(15 & s) << 2]),
e.join("")
}
function f(t, e, n) {
return null == t || 0 === t.length ? t : (t = l(t),
e = l(e),
d(p(b(t, !0), _(b(e, !1)), n), !1))
}
function l(t) {
if (/^[\x00-\x7f]*$captcha/.test(t))
return t;
for (var e = [], n = t.length, r = 0, o = 0; r < n; ++r,
++o) {
var i = t.charCodeAt(r);
if (i < 128)
e[o] = t.charAt(r);
else if (i < 2048)
e[o] = String.fromCharCode(192 | i >> 6, 128 | 63 & i);
else {
if (!(i < 55296 || i > 57343)) {
if (r + 1 < n) {
var a = t.charCodeAt(r + 1);
if (i < 56320 && a >= 56320 && a <= 57343) {
var s = 65536 + ((1023 & i) << 10 | 1023 & a);
e[o] = String.fromCharCode(240 | s >> 18 & 63, 128 | s >> 12 & 63, 128 | s >> 6 & 63, 128 | 63 & s),
++r;
continue
}
}
throw new Error("Malformed string")
}
e[o] = String.fromCharCode(224 | i >> 12, 128 | i >> 6 & 63, 128 | 63 & i)
}
}
return e.join("")
}
function d(t, e) {
var n = t.length
, r = n << 2;
if (e) {
var o = t[n - 1];
if (o < (r -= 4) - 3 || o > r)
return null;
r = o
}
for (var i = 0; i < n; i++)
t[i] = String.fromCharCode(255 & t[i], t[i] >>> 8 & 255, t[i] >>> 16 & 255, t[i] >>> 24 & 255);
var a = t.join("");
return e ? a.substring(0, r) : a
}
function p(t, e, n) {
var r, o, i, a, s, c, u = t.length, f = u - 1;
for (o = t[f],
i = 0,
c = 0 | Math.floor(6 + 52 / u); c > 0; --c) {
for (a = (i = h(i + g())) >>> 2 & 3,
s = 0; s < f; ++s)
r = t[s + 1],
o = t[s] = h(t[s] + m(i, r, o, s, a, e, n));
r = t[0],
o = t[f] = h(t[f] + m(i, r, o, f, a, e, n))
}
return t
}
function h(t) {
return 4294967295 & t
}
function g() {
return 1111471640 + parseInt(v("MTU0Mjk2NDEyOQ"))
}
function v(t) {
var e, n, r, o, i, a, s, c, u, f,
l = [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, -1, -1, -1, 63, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -1, -1, -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1, -1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1];
if (s = t.length,
t = (t += Array(5 - s % 4).join("=")).replace(/\-/g, "+").replace(/\_/g, "/"),
/[^ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\+\/\=]/.test(t))
return "";
for (u = s,
(c = "=" == t.charAt(s - 2) ? 1 : "=" == t.charAt(s - 1) ? 2 : 0) > 0 && (u -= 4),
u = 3 * (u >> 2) + c,
f = new Array(u),
i = a = 0; i < s && -1 != (e = l[t.charCodeAt(i++)]) && -1 != (n = l[t.charCodeAt(i++)]) && (f[a++] = String.fromCharCode(e << 2 | (48 & n) >> 4),
-1 != (r = l[t.charCodeAt(i++)])) && (f[a++] = String.fromCharCode((15 & n) << 4 | (60 & r) >> 2),
-1 != (o = l[t.charCodeAt(i++)]));)
f[a++] = String.fromCharCode((3 & r) << 6 | o);
return f.join("")
}
function m(t, e, n, r, o, i, a) {
var s = a - 25700;
if (s >>> 16 == 1) {
var c = s >>> 12 & 7
, u = s >>> 8 & 7
, f = s >>> 4 & 7
, l = 7 & s;
return y(t, e, n, r, o, i) ^ (e >>> c ^ n << u) + (t >>> f & 63 ^ n + e >>> (7 - l >>> 1) & 63)
}
return y(t, e, n, r, o, i)
}
function y(t, e, n, r, o, i) {
var a = function (t, e) {
return t ^ e
}
, s = function (t, e) {
return t + e
}
, c = function (t, e) {
return t << e
}
, u = function (t, e) {
return t >>> e
};
return a(s(a(n >>> 5, c(e, 2)), a(u(e, 3), c(n, 4))), (t ^ e) + (i[a(3 & r, o)] ^ n))
}
function b(t, e) {
var n, r = t.length, o = r >> 2;
0 != (3 & r) && ++o,
e ? (n = new Array(o + 1))[o] = r : n = new Array(o);
for (var i = 0; i < r; ++i)
n[i >> 2] |= t.charCodeAt(i) << ((3 & i) << 3);
return n
}
function _(t) {
return t.length < 4 && (t.length = 4),
t
}
function w(t) {
for (var e = ["0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"], n = "", r = 0; r < t; r++) {
n += e[Math.floor(35 * Math.random())]
}
return n
}
function x(t, e) {
for (var n = t.toString().length; n < e;)
t = "0" + t,
n++;
return t
}
function S(t) {
var e = t.account
, n = t.ccode
, o = t.eid
, i = t.pin
, a = Object(r.d)("captcha_fp") || ""
, s = []
, c = (s.join("~~"),
{});
s = [],
e && (c.account = e + ""),
n && (c.ccode = n + ""),
o && (c.eid = o + ""),
i && (c.pin = i + ""),
c.capfp = a,
c.cvs = Y(),
c.wgl = W(),
c.pr = P() + "",
c.cd = I() + "",
c.fv = z(),
c.fts = st(),
c.scr = ct() + "x" + E() + "," + j() + "x" + M(),
c.cpu = B() + "",
c.pt = R(),
c.tzo = N() + "",
c.lan = L(),
c.wvr = Q(),
c.wdr = et(),
c.mem = nt(),
c.sdv = "2.0";
var u = F() || [];
Array.isArray(u) && (c.lns = u.join(","));
var f = A() || [];
return Array.isArray(f) && (c.tsp = f.some((function (t) {
return t > 0
}
)) ? "1" : "0"),
JSON.stringify(c)
}
function k() {
return navigator.cookieEnabled
}
function O() {
try {
return !!window.sessionStorage
} catch (t) {
return !0
}
}
function C() {
try {
return !!window.indexedDB
} catch (t) {
return !0
}
}
function T() {
try {
return !!window.localStorage
} catch (t) {
return !0
}
}
function A() {
var t = 0
, e = 0;
void 0 !== navigator.maxTouchpts ? t = navigator.maxTouchpts : void 0 !== navigator.msMaxTouchpts && (t = navigator.msMaxTouchpts);
try {
document.createEvent("TouchEvent"),
e = 1
} catch (t) {
}
return [t, e, "ontouchstart" in window ? 1 : 0]
}
function E() {
return screen.height
}
function M() {
return screen.availHeight
}
function j() {
return screen.availWidth
}
function P() {
return window.devicePixelRatio || ""
}
function R() {
return navigator.platform ? navigator.platform : "unknown"
}
function I() {
return screen.colorDepth
}
function F() {
return navigator.languages
}
function N() {
return window.Intl && window.Intl.DateTimeFormat ? (new window.Intl.DateTimeFormat).resolvedOptions().timeZone : ""
}
function L() {
return navigator.language
}
function B() {
return navigator.hardwareConcurrency ? navigator.hardwareConcurrency : "unknown"
}
function D() {
return screen.deviceXDPI
}
function U() {
return screen.deviceYDPI
}
function z() {
try {
if ($()) {
var t = navigator.plugins && navigator.plugins["Shockwave Flash"];
return t && t.version || ""
}
return ""
} catch (t) {
return ""
}
}
function $() {
return !!(navigator.plugins && navigator.plugins["Shockwave Flash"])
}
function Y() {
return it(rt(), 31)
}
function W() {
return it(X(), 31)
}
function V() {
if (!J())
return !1;
var t, e = document.createElement("canvas");
try {
t = e.getContext && (e.getContext("webgl") || e.getContext("experimental-webgl"))
} catch (e) {
t = !1
}
return !!window.WebGLRenderingContext && !!t
}
function J() {
var t = document.createElement("canvas");
try {
return !(!t.getContext || !t.getContext("2d"))
} catch (t) {
return !1
}
}
function X() {
if (!V())
return null;
var t, e = document.createElement("canvas");
try {
t = e.getContext("webgl") || e.getContext("experimental-webgl")
} catch (t) {
}
if (!t)
return null;
var n = t.createBuffer();
t.bindBuffer(t.ARRAY_BUFFER, n);
var r = new Float32Array([-.2, -.9, 0, .4, -.26, 0, 0, .732134444, 0]);
t.bufferData(t.ARRAY_BUFFER, r, t.STATIC_DRAW),
n.itemSize = 3,
n.numItems = 3;
var o = t.createProgram()
, i = t.createShader(t.VERTEX_SHADER);
t.shaderSource(i, "attribute vec2 attrVertex;varying vec2 varyinTexCoordinate;uniform vec2 uniformOffset;void main(){varyinTexCoordinate=attrVertex+uniformOffset;gl_Position=vec4(attrVertex,0,1);}"),
t.compileShader(i);
var a = t.createShader(t.FRAGMENT_SHADER);
return t.shaderSource(a, "precision mediump float;varying vec2 varyinTexCoordinate;void main() {gl_FragColor=vec4(varyinTexCoordinate,0,1);}"),
t.compileShader(a),
t.attachShader(o, i),
t.attachShader(o, a),
t.linkProgram(o),
t.useProgram(o),
o.vertexPosAttrib = t.getAttribLocation(o, "attrVertex"),
o.offsetUniform = t.getUniformLocation(o, "uniformOffset"),
t.enableVertexAttribArray(o.vertexPosArray),
t.vertexAttribPointer(o.vertexPosAttrib, n.itemSize, t.FLOAT, !1, 0, 0),
t.uniform2f(o.offsetUniform, 1, 1),
t.drawArrays(t.TRIANGLE_STRIP, 0, n.numItems),
null != t.canvas ? t.canvas.toDataURL() : null
}
function G() {
var t = document.createElement("canvas")
, e = null;
try {
e = t.getContext("webgl") || t.getContext("experimental-webgl")
} catch (t) {
}
return e || (e = null),
e
}
function H() {
var t = document.createElement("canvas");
return !(!t.getContext || !t.getContext("2d"))
}
function K() {
if (!H())
return !1;
var t = G();
return !!window.WebGLRenderingContext && !!t
}
function q() {
try {
var t = G()
, e = t.getExtension("WEBGL_debug_renderer_info");
return t.getParameter(e.UNMASKED_VENDOR_WEBGL) + "~" + t.getParameter(e.UNMASKED_RENDERER_WEBGL)
} catch (t) {
return null
}
}
function Q() {
if (K())
return q()
}
function Z() {
return navigator.mediaDevices && navigator.mediaDevices.enumerateDevices
}
function tt() {
if (!Z())
return [];
var t = [];
return navigator.mediaDevices.enumerateDevices().then((function (e) {
t = e.map((function (t) {
return "id=" + t.deviceId + ";gid=" + t.groupId + ";" + t.kind + ";" + t.label
}
))
}
)).catch((function (t) {
}
)),
t
}
function et() {
return null == navigator.webdriver ? "" : navigator.webdriver
}
function nt() {
return navigator.deviceMemory || ""
}
function rt() {
var t, e = document.createElement("canvas");
try {
t = e.getContext("2d")
} catch (t) {
return null
}
var n = "JCap Fingureprint <canvas> 1.0";
return e.width = 2e3,
e.height = 200,
e.style.display = "inline",
t.rect(0, 0, 11, 11),
t.rect(3, 3, 6, 6),
t.textBaseline = "alphabetic",
t.fillStyle = "#f60",
t.fillRect(125, 1, 62, 20),
t.fillStyle = "#069",
t.font = "11px Arial",
t.fillText(n, 2, 15),
t.fillStyle = "rgba(102, 204, 0, 0.7)",
t.font = "18pt Arial",
t.fillText(n, 4, 45),
t.globalCompositeOperation = "multiply",
t.fillStyle = "rgb(255,0,255)",
t.beginPath(),
t.arc(52, 50, 50, 0, 2 * Math.PI, !0),
t.closePath(),
t.fill(),
t.fillStyle = "rgb(0,255,255)",
t.beginPath(),
t.arc(100, 50, 50, 0, 2 * Math.PI, !0),
t.closePath(),
t.fill(),
t.fillStyle = "rgb(255,255,0)",
t.beginPath(),
t.arc(75, 100, 50, 0, 2 * Math.PI, !0),
t.closePath(),
t.fill(),
t.fillStyle = "rgb(255,0,255)",
t.arc(75, 75, 75, 0, 2 * Math.PI, !0),
t.arc(75, 75, 25, 0, 2 * Math.PI, !0),
t.fill("evenodd"),
e.toDataURL()
}
function ot(t, e) {
return [t[0] ^ e[0], t[1] ^ e[1]]
}
function it(t, e) {
e = e || 0;
for (var n = (t = t || "").length % 16, r = t.length - n, o = [0, e], i = [0, e], a = [0, 0], s = [0, 0], c = [2277735313, 289559509], u = [1291169091, 658871167], f = 0; f < r; f += 16)
a = [255 & t.charCodeAt(f + 4) | (255 & t.charCodeAt(f + 5)) << 8 | (255 & t.charCodeAt(f + 6)) << 16 | (255 & t.charCodeAt(f + 7)) << 24, 255 & t.charCodeAt(f) | (255 & t.charCodeAt(f + 1)) << 8 | (255 & t.charCodeAt(f + 2)) << 16 | (255 & t.charCodeAt(f + 3)) << 24],
s = [255 & t.charCodeAt(f + 12) | (255 & t.charCodeAt(f + 13)) << 8 | (255 & t.charCodeAt(f + 14)) << 16 | (255 & t.charCodeAt(f + 15)) << 24, 255 & t.charCodeAt(f + 8) | (255 & t.charCodeAt(f + 9)) << 8 | (255 & t.charCodeAt(f + 10)) << 16 | (255 & t.charCodeAt(f + 11)) << 24],
a = lt(a = ft(a, c), 31),
o = ut(o = lt(o = ot(o, a = ft(a, u)), 27), i),
o = ut(ft(o, [0, 5]), [0, 1390208809]),
s = lt(s = ft(s, u), 33),
i = ut(i = lt(i = ot(i, s = ft(s, c)), 31), o),
i = ut(ft(i, [0, 5]), [0, 944331445]);
switch (a = [0, 0],
s = [0, 0],
n) {
case 15:
s = ot(s, dt([0, t.charCodeAt(f + 14)], 48));
case 14:
s = ot(s, dt([0, t.charCodeAt(f + 13)], 40));
case 13:
s = ot(s, dt([0, t.charCodeAt(f + 12)], 32));
case 12:
s = ot(s, dt([0, t.charCodeAt(f + 11)], 24));
case 11:
s = ot(s, dt([0, t.charCodeAt(f + 10)], 16));
case 10:
s = ot(s, dt([0, t.charCodeAt(f + 9)], 8));
case 9:
s = ft(s = ot(s, [0, t.charCodeAt(f + 8)]), u),
i = ot(i, s = ft(s = lt(s, 33), c));
case 8:
a = ot(a, dt([0, t.charCodeAt(f + 7)], 56));
case 7:
a = ot(a, dt([0, t.charCodeAt(f + 6)], 48));
case 6:
a = ot(a, dt([0, t.charCodeAt(f + 5)], 40));
case 5:
a = ot(a, dt([0, t.charCodeAt(f + 4)], 32));
case 4:
a = ot(a, dt([0, t.charCodeAt(f + 3)], 24));
case 3:
a = ot(a, dt([0, t.charCodeAt(f + 2)], 16));
case 2:
a = ot(a, dt([0, t.charCodeAt(f + 1)], 8));
case 1:
a = ft(a = ot(a, [0, t.charCodeAt(f)]), c),
o = ot(o, a = ft(a = lt(a, 31), u))
}
return o = ut(o = ot(o, [0, t.length]), i = ot(i, [0, t.length])),
i = ut(i, o),
o = ut(o = at(o), i = at(i)),
i = ut(i, o),
("00000000" + (o[0] >>> 0).toString(16)).slice(-8) + ("00000000" + (o[1] >>> 0).toString(16)).slice(-8) + ("00000000" + (i[0] >>> 0).toString(16)).slice(-8) + ("00000000" + (i[1] >>> 0).toString(16)).slice(-8)
}
function at(t) {
return t = ot(t, [0, t[0] >>> 1]),
t = ot(t = ft(t, [4283543511, 3981806797]), [0, t[0] >>> 1]),
t = ot(t = ft(t, [3301882366, 444984403]), [0, t[0] >>> 1])
}
function st() {
var t = []
, e = ["monospace", "sans-serif", "serif"]
,
n = ["Andale Mono", "Arial", "Bitstream Vera Sans Mono", "Book Antiqua", "Bookman Old Style", "Calibri", "Cambria", "Century", "Century Gothic", "Century Schoolbook", "Consolas", "Courier", "Courier New", "Garamond", "Geneva", "Georgia", "Helvetica", "Impact", "Lucida Bright", "Lucida Console", "Lucida Handwriting", "Lucida Sans", "Lucida Sans Typewriter", "Lucida Sans Unicode", "Monaco", "Monotype Corsiva", "MS Gothic", "MS PGothic", "MYRIAD", "MYRIAD PRO", "Palatino", "Palatino Linotype", "Segoe Print", "Segoe Script", "Segoe UI", "Tahoma", "Times", "Times New Roman", "Trebuchet MS", "Verdana", "Wingdings", "Baskerville", "Casual", "cursive", "fantasy", "Droid Sans", "Goudy", "ITC Stone Serif", "Palatino", "sans-serif-condensed", "sans-serif-light", "sans-serif-medium", "sans-serif-smallcaps", "sans-serif-thin", "-apple-system", "AmericanTypewriter", "AppleGothic", "Charter", "Damascus", "DiwanMishafi", "Farah", "Futura", "Marion", "Menlo", "Mishafi", "Seravek", "Superclarendon", "Symbol", "Thonburi", "TrebuchetMS", "Zapfino", "Bookshelf Symbol 7", "Candara", "Constantia", "Corbel", "Didot", "Ebrima", "FangSong", "French Script MT", "Gabriola", "Microsoft YaHei", "Microsoft Yi Baiti", "MingLiU-ExtB", "PMingLiU-ExtB", "SimHei", "SimSun", "SimSun-ExtB"]
, r = document.getElementsByTagName("body")[0]
, o = document.createElement("div")
, i = document.createElement("div")
, a = {}
, s = {}
, c = function () {
var t = document.createElement("span");
return t.style.position = "absolute",
t.style.left = "-9999px",
t.style.fontSize = "72px",
t.style.lineHeight = "normal",
t.innerHTML = "wssywssywssy",
t
}
, u = function (t, e) {
var n = c();
return n.style.fontFamily = "'" + t + "'," + e,
n
}
, f = function (t) {
for (var n = !1, r = 0; r < e.length; r++)
if (n = t[r].offsetWidth !== a[e[r]] || t[r].offsetHeight !== s[e[r]])
return n;
return n
}
, l = function () {
for (var t = [], n = 0, r = e.length; n < r; n++) {
var i = c();
i.style.fontFamily = e[n],
o.appendChild(i),
t.push(i)
}
return t
}();
r.appendChild(o);
for (var d = 0, p = e.length; d < p; d++)
a[e[d]] = l[d].offsetWidth,
s[e[d]] = l[d].offsetHeight;
var h = function () {
for (var t = {}, r = 0, o = n.length; r < o; r++) {
for (var a = [], s = 0, c = e.length; s < c; s++) {
var f = u(n[r], e[s]);
i.appendChild(f),
a.push(f)
}
t[n[r]] = a
}
return t
}();
r.appendChild(i);
for (var g = 0, v = n.length; g < v; g++)
f(h[n[g]]) && t.push(n[g].replace(/\s/g, "").replace(/-/g, ""));
return r.removeChild(i),
r.removeChild(o),
t.join(",")
}
function ct() {
return screen.width
}
function ut(t, e) {
t = [t[0] >>> 16, 65535 & t[0], t[1] >>> 16, 65535 & t[1]],
e = [e[0] >>> 16, 65535 & e[0], e[1] >>> 16, 65535 & e[1]];
var n = [0, 0, 0, 0];
return n[3] += t[3] + e[3],
n[2] += n[3] >>> 16,
n[3] &= 65535,
n[2] += t[2] + e[2],
n[1] += n[2] >>> 16,
n[2] &= 65535,
n[1] += t[1] + e[1],
n[0] += n[1] >>> 16,
n[1] &= 65535,
n[0] += t[0] + e[0],
n[0] &= 65535,
[n[0] << 16 | n[1], n[2] << 16 | n[3]]
}
function ft(t, e) {
t = [t[0] >>> 16, 65535 & t[0], t[1] >>> 16, 65535 & t[1]],
e = [e[0] >>> 16, 65535 & e[0], e[1] >>> 16, 65535 & e[1]];
var n = [0, 0, 0, 0];
return n[3] += t[3] * e[3],
n[2] += n[3] >>> 16,
n[3] &= 65535,
n[2] += t[2] * e[3],
n[1] += n[2] >>> 16,
n[2] &= 65535,
n[2] += t[3] * e[2],
n[1] += n[2] >>> 16,
n[2] &= 65535,
n[1] += t[1] * e[3],
n[0] += n[1] >>> 16,
n[1] &= 65535,
n[1] += t[2] * e[2],
n[0] += n[1] >>> 16,
n[1] &= 65535,
n[1] += t[3] * e[1],
n[0] += n[1] >>> 16,
n[1] &= 65535,
n[0] += t[0] * e[3] + t[1] * e[2] + t[2] * e[1] + t[3] * e[0],
n[0] &= 65535,
[n[0] << 16 | n[1], n[2] << 16 | n[3]]
}
function lt(t, e) {
return 32 === (e %= 64) ? [t[1], t[0]] : e < 32 ? [t[0] << e | t[1] >>> 32 - e, t[1] << e | t[0] >>> 32 - e] : (e -= 32,
[t[1] << e | t[0] >>> 32 - e, t[0] << e | t[1] >>> 32 - e])
}
function dt(t, e) {
return 0 === (e %= 64) ? t : e < 32 ? [t[0] << e | t[1] >>> 32 - e, t[1] << e] : [t[1] << e - 32, 0]
}
function randomChoice(array) {
// 生成一个 0 到 array.length - 1 之间的随机整数
const randomIndex = Math.floor(Math.random() * array.length);
// 返回数组中对应的随机元素
return array[randomIndex];
}
function result(sessionid, way, jdst, ttt, client, fp) {
if (fp === "" || fp == null) {
fp = {};
}
const cvs_array = [
"d4688eeabcbd3f99117c0e1554720709"
];
const cvs = randomChoice(cvs_array);
const wgl_array = [
"fe71272caec34c43e21ce73956d51a00"
];
const wgl = randomChoice(wgl_array);
var tdat_code = 99992, vvv = '', track = '', getSensorInfo = JSON.stringify(
{
"capfp": fp,
"cvs": cvs,
"wgl": wgl,
"pr": "3.0000001192092896",
"cd": "24",
"fv": "",
"fts": "Arial,BookAntiqua,BookmanOldStyle,Calibri,Cambria,Century,CenturyGothic,CenturySchoolbook,Consolas,Courier,CourierNew,Garamond,Georgia,Helvetica,Impact,LucidaBright,LucidaConsole,LucidaHandwriting,LucidaSans,LucidaSansTypewriter,LucidaSansUnicode,MonotypeCorsiva,MSGothic,MSPGothic,PalatinoLinotype,SegoePrint,SegoeScript,SegoeUI,Tahoma,Times,TimesNewRoman,TrebuchetMS,Verdana,Wingdings,Symbol,BookshelfSymbol7,Candara,Constantia,Corbel,Didot,Ebrima,FangSong,FrenchScriptMT,Gabriola,MicrosoftYaHei,MicrosoftYiBaiti,MingLiUExtB,PMingLiUExtB,SimHei,SimSun,SimSunExtB",
"scr": "390x844,390x844",
"cpu": "12",
"pt": "Win32",
"tzo": "Asia/Shanghai",
"lan": "zh-CN",
"wvr": "Google Inc. (NVIDIA)~ANGLE (NVIDIA, NVIDIA GeForce GTX 1050 Ti (0x00001C82) Direct3D11 vs_5_0 ps_5_0, D3D11)",
"wdr": "0",
"mem": "8",
"sdv": "2.0",
"jsv": "xk2hmw",
"sdf": "{\"Xk9Elx\":\"yhcpMY\",\"KvRuI4\":\"ffB8Nb\"}",
"lns": "zh-CN",
"tsp": "1",
"pdf": "0",
"cke": "1",
"bid": "",
"gpu": "4",
"uat": "11",
"ol": "1",
"ets": "33",
"wch": "0"
}
),
ddd = Date.parse(new Date + "");
var ppp = ddd % 41
var _n = '23130303037303236454145424647333930364347354831453137323142373636383333363233303033333234454636454541433246344546333730344346493333373831483530334233303035313030303'
switch (way) {
case 0:
vvv = {
si: sessionid,
lang: 1,
ct: s(w(ddd % 19) + x(sessionid.length, 4) + sessionid + getSensorInfo + ddd, tdat_code, _n),
version: 2,
client: client
};
break
case 1:
var tnow = new Date().getTime()
track = {
"touchList": [
{
"eid": "click",
"did": "",
"cn": "Yep-nav-bar-title",
"sx": 316,
"sy": 167,
"px": 241,
"py": 22,
"time": tnow
},
{
"eid": "touch",
"did": "",
"cn": "captcha_drop",
"time": tnow + 300023,
"pt": [
[
390.3999938964844,
310.3999938964844,
315.3999938964844,
165.40000915527344,
1724311497911
]
]
},
{
"eid": "click",
"did": "",
"cn": "captcha_drop",
"sx": 390,
"sy": 310,
"px": 315,
"py": 165,
"time": tnow + 603023
},
{
"eid": "touch",
"did": "",
"cn": "button",
"time": tnow + 933333,
"pt": [
[
304.8000183105469,
630.4000244140625,
229.80003356933594,
485.3999938964844,
1724311535408
]
]
},
{
"eid": "click",
"did": "",
"cn": "button",
"sx": 304,
"sy": 630,
"px": 229,
"py": 485,
"time": tnow + 1233333
},
{
"eid": "click",
"did": "",
"cn": "Yep-nav-bar-title",
"sx": 321,
"sy": 168,
"px": 246,
"py": 23,
"time": tnow + 1533333
},
{
"eid": "touch",
"did": "",
"cn": "captcha_drop",
"time": tnow + 1833333,
"pt": [
[
355.20001220703125,
339.20001220703125,
280.20001220703125,
194.20001220703125,
1724311537337
]
]
},
{
"eid": "click",
"did": "",
"cn": "captcha_drop",
"sx": 355,
"sy": 339,
"px": 280,
"py": 194,
"time": tnow + 2133333
},
{
"eid": "touch",
"did": "",
"cn": "button",
"time": tnow + 2433333,
"pt": [
[
416,
632.7999877929688,
341,
487.8000183105469,
1724311559520
]
]
},
{
"eid": "click",
"did": "",
"cn": "button",
"sx": 416,
"sy": 632,
"px": 340,
"py": 488,
"time": tnow + 2733333
}
]
};
vvv = {
si: sessionid,
lang: 1,
tk: s(ddd + x(sessionid.length, 4) + sessionid + x(jdst.length, 4) + jdst + x(0, 6) + '' + JSON.stringify(track) + w(ppp), 99992, _n),
ct: s(w(1723309571000 % 19) + x(sessionid.length, 4) + sessionid + getSensorInfo + 1723309571000, tdat_code, _n),
version: 2,
client: client
};
break;
case 2:
var tnow = new Date().getTime()
// ttt=encodeURI(ttt)
track = {
"touchList": [
{
"eid": "touch",
"did": "",
"cn": "captcha_drop",
"time": tnow,
"pt": [
[
355.20001220703125,
339.20001220703125,
280.20001220703125,
194.20001220703125,
1724311537337
]
]
},
{
"eid": "click",
"did": "",
"cn": "captcha_drop",
"sx": 355,
"sy": 339,
"px": 280,
"py": 194,
"time": tnow + 300023
},
{
"eid": "touch",
"did": "",
"cn": "button",
"time": tnow + 603023,
"pt": [
[
416,
632.7999877929688,
341,
487.8000183105469,
1724311559520
]
]
},
{
"eid": "click",
"did": "",
"cn": "button",
"sx": 416,
"sy": 632,
"px": 340,
"py": 488,
"time": tnow + 933333
},
{
"eid": "click",
"did": "",
"cn": "Yep-nav-bar-title",
"sx": 315,
"sy": 168,
"px": 240,
"py": 23,
"time": tnow + 1233333
},
{
"eid": "touch",
"did": "",
"cn": "captcha_drop",
"time": tnow + 1533333,
"pt": [
[
324.8000183105469,
382.3999938964844,
249.80003356933594,
237.40000915527344,
1724311563521
]
]
},
{
"eid": "click",
"did": "",
"cn": "captcha_drop",
"sx": 324,
"sy": 382,
"px": 249,
"py": 237,
"time": tnow + 1833333
},
{
"eid": "touch",
"did": "",
"cn": "button",
"time": tnow + 2133333,
"pt": [
[
320.8000183105469,
632.7999877929688,
245.80003356933594,
487.8000183105469,
1724311646144
]
]
},
{
"eid": "click",
"did": "",
"cn": "button",
"sx": 320,
"sy": 632,
"px": 245,
"py": 488,
"time": tnow + 2433333
},
{
"eid": "click",
"did": "",
"cn": "Yep-nav-bar-title",
"sx": 318,
"sy": 168,
"px": 243,
"py": 24,
"time": tnow + 2733333
}
]
};
vvv = {
si: sessionid,
lang: 1,
tk: s(ddd + x(sessionid.length, 4) + sessionid + x(jdst.length, 4) + jdst + x(ttt.length, 6) + ttt + JSON.stringify(track) + w(ppp), 99992, _n),
ct: s(w(ddd % 19) + x(sessionid.length, 4) + sessionid + getSensorInfo + ddd, tdat_code, _n),
version: 2,
client: client
};
break
case 3:
const _g = {
nonce: w(16),
sid: sessionid,
token: jdst
}
// const _g = {
// "nonce": "ner964xj8tg4esxx",
// "token": "LY2DwFCIEq2SHvqo",
// "sid": "C_6JZwABAAABnKFAV-IAMErNi_nhQuXksUzOLPgv4x721rBTxKXs7LB7abYHgPaoQN6iQ3bbp35r452K85fASwAAAAA"
// }
vvv = {
si: sessionid,
lang: 1,
version: 2,
client: client,
type: 0,
se: s(JSON.stringify(_g), null, _n)
}
}
return vvv
}
sid = "C_6JZwABAAABnKFAV-IAMErNi_nhQuXksUzOLPgv4x721rBTxKXs7LB7abYHgPaoQN6iQ3bbp35r452K85fASwAAAAA"
jdst = "LY2DwFCIEq2SHvqo"
ttt = ""
client = "m"
fp = "Ecf3kD3OEIA2ZIOrPgIqR-g_lTjv_zaXeP2c-3G7HOPrzrhuL-KLk6mqZZOiFmT1YXllZEz922LyeyaQBsrI_g=="
console.log(result(sid, 3, jdst, ttt, client, fp))