Skip to content

Instantly share code, notes, and snippets.

@uzielweb

uzielweb/gist:ee5f1ce6965cd5f0615dfd6fb2fa6f20

Last active July 24, 2019 15:00
Show Gist options
  • Save uzielweb/ee5f1ce6965cd5f0615dfd6fb2fa6f20 to your computer and use it in GitHub Desktop.
Save uzielweb/ee5f1ce6965cd5f0615dfd6fb2fa6f20 to your computer and use it in GitHub Desktop.
Download ZIP
WEB WhatsApp 24/07/2019 Bug
Raw
gistfile1.js
/*! Copyright (c) 2019 WhatsApp Inc. All Rights Reserved. */ ! function(e) {
function i(n) {
if (r[n]) return r[n].exports;
var f = r[n] = {
i: n,
l: !1,
exports: {}
};
return e[n].call(f.exports, f, f.exports, i), f.l = !0, f.exports
}
var r = {};
i.m = e, i.c = r, i.d = function(e, r, n) {
i.o(e, r) || Object.defineProperty(e, r, {
configurable: !1,
enumerable: !0,
get: n
})
}, i.n = function(e) {
var r = e && e.__esModule ? function() {
return e.default
} : function() {
return e
};
return i.d(r, "a", r), r
}, i.o = function(e, i) {
return Object.prototype.hasOwnProperty.call(e, i)
}, i.p = "/", i(i.s = "bihhfhhehf")
}({
bhcjcihgg: function(e, i, r) {
(function(e) {
function r(e, i) {
for (var r = 0, n = e.length - 1; n >= 0; n--) {
var f = e[n];
"." === f ? e.splice(n, 1) : ".." === f ? (e.splice(n, 1), r++) : r && (e.splice(n, 1), r--)
}
if (i)
for (; r--; r) e.unshift("..");
return e
}
function n(e, i) {
if (e.filter) return e.filter(i);
for (var r = [], n = 0; n < e.length; n++) i(e[n], n, e) && r.push(e[n]);
return r
}
var f = /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/,
t = function(e) {
return f.exec(e).slice(1)
};
i.resolve = function() {
for (var i = "", f = !1, t = arguments.length - 1; t >= -1 && !f; t--) {
var u = t >= 0 ? arguments[t] : e.cwd();
if ("string" != typeof u) throw new TypeError("Arguments to path.resolve must be strings");
u && (i = u + "/" + i, f = "/" === u.charAt(0))
}
return i = r(n(i.split("/"), function(e) {
return !!e
}), !f).join("/"), (f ? "/" : "") + i || "."
}, i.normalize = function(e) {
var f = i.isAbsolute(e),
t = "/" === u(e, -1);
return e = r(n(e.split("/"), function(e) {
return !!e
}), !f).join("/"), e || f || (e = "."), e && t && (e += "/"), (f ? "/" : "") + e
}, i.isAbsolute = function(e) {
return "/" === e.charAt(0)
}, i.join = function() {
var e = Array.prototype.slice.call(arguments, 0);
return i.normalize(n(e, function(e, i) {
if ("string" != typeof e) throw new TypeError("Arguments to path.join must be strings");
return e
}).join("/"))
}, i.relative = function(e, r) {
function n(e) {
for (var i = 0; i < e.length && "" === e[i]; i++);
for (var r = e.length - 1; r >= 0 && "" === e[r]; r--);
return i > r ? [] : e.slice(i, r - i + 1)
}
e = i.resolve(e).substr(1), r = i.resolve(r).substr(1);
for (var f = n(e.split("/")), t = n(r.split("/")), u = Math.min(f.length, t.length), a = u, A = 0; A < u; A++)
if (f[A] !== t[A]) {
a = A;
break
} for (var l = [], A = a; A < f.length; A++) l.push("..");
return l = l.concat(t.slice(a)), l.join("/")
}, i.sep = "/", i.delimiter = ":", i.dirname = function(e) {
var i = t(e),
r = i[0],
n = i[1];
return r || n ? (n && (n = n.substr(0, n.length - 1)), r + n) : "."
}, i.basename = function(e, i) {
var r = t(e)[2];
return i && r.substr(-1 * i.length) === i && (r = r.substr(0, r.length - i.length)), r
}, i.extname = function(e) {
return t(e)[3]
};
var u = "b" === "ab".substr(-1) ? function(e, i, r) {
return e.substr(i, r)
} : function(e, i, r) {
return i < 0 && (i = e.length + i), e.substr(i, r)
}
}).call(i, r("ddghcccjbh"))
},
bihhfhhehf: function(e, i, r) {
"use strict";
var n = r("dadibcdeid"),
f = function(e) {
return e && e.__esModule ? e : {
default: e
}
}(n),
t = f.default.cwrap("WebpToRGBA", "number", ["array", "number"]);
self.onmessage = function(e) {
var i = e.data.webpBuffer,
r = new Uint8Array(i),
n = t(r, r.length),
u = f.default.HEAP32[n + 0 >> 2],
a = f.default.HEAP32[n + 4 >> 2],
A = f.default.HEAP32[n + 8 >> 2];
if (!A) throw new Error("unsupported");
var l = f.default.HEAPU8.slice(A, A + a * u * 4),
o = l.buffer;
self.postMessage({
rgbaBuffer: o,
height: a,
width: u
}, [o])
}
},
dadibcdeid: function(e, i, r) {
(function(i, n) {
function f(e, i) {
e || U("Assertion failed: " + i)
}
function t(e) {
var i = V["_" + e];
return f(i, "Cannot call unknown function " + e + ", make sure it is exported"), i
}
function u(e, i, r, n, f) {
var u = {
string: function(e) {
var i = 0;
if (null != e && 0 !== e) {
var r = 1 + (e.length << 2);
c(e, i = Ge(r), r)
}
return i
},
array: function(e) {
var i = Ge(e.length);
return s(e, i), i
}
},
a = t(e),
A = [],
o = 0;
if (n)
for (var b = 0; b < n.length; b++) {
var h = u[r[b]];
A[b] = h ? (0 === o && (o = Me()), h(n[b])) : n[b]
}
var w = a.apply(null, A);
return w = function(e) {
return "string" === i ? l(e) : "boolean" === i ? Boolean(e) : e
}(w), 0 !== o && Te(o), w
}
function a(e, i, r, n) {
var f = (r = r || []).every(function(e) {
return "number" === e
});
return "string" !== i && f && !n ? t(e) : function() {
return u(e, i, r, arguments, n)
}
}
function A(e, i, r) {
for (var n = i + r, f = i; e[f] && !(n <= f);) ++f;
if (16 < f - i && e.subarray && be) return be.decode(e.subarray(i, f));
for (var t = ""; i < f;) {
var u = e[i++];
if (128 & u) {
var a = 63 & e[i++];
if (192 != (224 & u)) {
var A = 63 & e[i++];
if ((u = 224 == (240 & u) ? (15 & u) << 12 | a << 6 | A : (7 & u) << 18 | a << 12 | A << 6 | 63 & e[i++]) < 65536) t += String.fromCharCode(u);
else {
var l = u - 65536;
t += String.fromCharCode(55296 | l >> 10, 56320 | 1023 & l)
}
} else t += String.fromCharCode((31 & u) << 6 | a)
} else t += String.fromCharCode(u)
}
return t
}
function l(e, i) {
return e ? A(ie, e, i) : ""
}
function o(e, i, r, n) {
if (!(0 < n)) return 0;
for (var f = r, t = r + n - 1, u = 0; u < e.length; ++u) {
var a = e.charCodeAt(u);
if (55296 <= a && a <= 57343 && (a = 65536 + ((1023 & a) << 10) | 1023 & e.charCodeAt(++u)), a <= 127) {
if (t <= r) break;
i[r++] = a
} else if (a <= 2047) {
if (t <= r + 1) break;
i[r++] = 192 | a >> 6, i[r++] = 128 | 63 & a
} else if (a <= 65535) {
if (t <= r + 2) break;
i[r++] = 224 | a >> 12, i[r++] = 128 | a >> 6 & 63, i[r++] = 128 | 63 & a
} else {
if (t <= r + 3) break;
i[r++] = 240 | a >> 18, i[r++] = 128 | a >> 12 & 63, i[r++] = 128 | a >> 6 & 63, i[r++] = 128 | 63 & a
}
}
return i[r] = 0, r - f
}
function c(e, i, r) {
return o(e, ie, i, r)
}
function s(e, i) {
ee.set(e, i)
}
function b(e) {
for (; 0 < e.length;) {
var i = e.shift();
if ("function" != typeof i) {
var r = i.func;
"number" == typeof r ? void 0 === i.arg ? V.dynCall_v(r) : V.dynCall_vi(r, i.arg) : r(void 0 === i.arg ? null : i.arg)
} else i()
}
}
function h() {
if (V.preRun)
for ("function" == typeof V.preRun && (V.preRun = [V.preRun]); V.preRun.length;) v(V.preRun.shift());
b(ke)
}
function w() {
Ie || (Ie = !0, b(ge))
}
function k() {
b(ve)
}
function g() {
if (V.postRun)
for ("function" == typeof V.postRun && (V.postRun = [V.postRun]); V.postRun.length;) C(V.postRun.shift());
b(Ce)
}
function v(e) {
ke.unshift(e)
}
function C(e) {
Ce.unshift(e)
}
function I(e) {
if (de--, V.monitorRunDependencies && V.monitorRunDependencies(de), 0 == de && (null !== me && (clearInterval(me), me = null), pe)) {
var i = pe;
pe = null, i()
}
}
function d(e) {
return String.prototype.startsWith ? e.startsWith(Pe) : 0 === e.indexOf(Pe)
}
function m() {
return we
}
function p(e) {
U("Cannot enlarge memory arrays to size " + e + " bytes. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value " + we + ", (2) compile with -s ALLOW_MEMORY_GROWTH=1 which allows increasing the size at runtime but prevents some optimizations, (3) set Module.TOTAL_MEMORY to a higher value before the program runs, or (4) if you want malloc to return NULL (0) instead of this abort, compile with -s ABORTING_MALLOC=0 ")
}
function y(e) {
p(e)
}
function P(e, i, r) {
ie.set(ie.subarray(i, i + r), e)
}
function D() {
return 0
}
function B() {
return 0
}
function E() {
return 0
}
function _() {
return 0
}
function R() {
return 11
}
function G() {}
function T() {}
function M() {}
function S(e) {
return V.___errno_location && (fe[V.___errno_location() >> 2] = e), e
}
function x(e) {
for (var i = [], r = 0; r < e.length; r++) {
var n = e[r];
255 < n && (De && f(!1, "Character code " + n + " (" + String.fromCharCode(n) + ") at offset " + r + " not in 0x00-0xFF."), n &= 255), i.push(String.fromCharCode(n))
}
return i.join("")
}
function F(e) {
if ("boolean" == typeof O && O) {
var i;
try {
i = Buffer.from(e, "base64")
} catch (r) {
i = new Buffer(e, "base64")
}
return new Uint8Array(i.buffer, i.byteOffset, i.byteLength)
}
try {
for (var r = Be(e), n = new Uint8Array(r.length), f = 0; f < r.length; ++f) n[f] = r.charCodeAt(f);
return n
} catch (e) {
throw new Error("Converting base64 string to bytes failed.")
}
}
function L(e) {
if (d(e)) return F(e.slice(Pe.length))
}
function Q(e) {
this.name = "ExitStatus", this.message = "Program terminated with exit(" + e + ")", this.status = e
}
function Y(e) {
function i() {
V.calledRun || (V.calledRun = !0, ce || (w(), k(), V.onRuntimeInitialized && V.onRuntimeInitialized(), g()))
}
e = e || V.arguments, 0 < de || (h(), 0 < de || V.calledRun || (V.setStatus ? (V.setStatus("Running..."), setTimeout(function() {
setTimeout(function() {
V.setStatus("")
}, 1), i()
}, 1)) : i()))
}
function U(e) {
throw V.onAbort && V.onAbort(e), e = void 0 !== e ? (X(e), N(e), JSON.stringify(e)) : "", ce = !0, se = 1, "abort(" + e + "). Build with -s ASSERTIONS=1 for more info."
}
var H, V = void 0 !== V ? V : {},
W = {};
for (H in V) V.hasOwnProperty(H) && (W[H] = V[H]);
V.arguments = [], V.thisProgram = "./this.program", V.quit = function(e, i) {
throw i
}, V.preRun = [];
var Z = !(V.postRun = []),
z = !1,
O = !1,
J = !1;
Z = "object" == typeof window, z = "function" == typeof importScripts, O = "object" == typeof i && !0 && !Z && !z, J = !Z && !O && !z;
var j, q, K = "";
O ? (K = n + "/", V.read = function(e, i) {
var n;
return (n = L(e)) || (j || (j = r(! function() {
var e = new Error('Cannot find module "fs"');
throw e.code = "MODULE_NOT_FOUND", e
}())), q || (q = r("bhcjcihgg")), e = q.normalize(e), n = j.readFileSync(e)), i ? n : n.toString()
}, V.readBinary = function(e) {
var i = V.read(e, !0);
return i.buffer || (i = new Uint8Array(i)), f(i.buffer), i
}, 1 < i.argv.length && (V.thisProgram = i.argv[1].replace(/\\/g, "/")), V.arguments = i.argv.slice(2), void 0 !== e && (e.exports = V), i.on("uncaughtException", function(e) {
if (!(e instanceof Q)) throw e
}), i.on("unhandledRejection", U), V.quit = function(e) {
i.exit(e)
}, V.inspect = function() {
return "[Emscripten Module object]"
}) : J ? ("undefined" != typeof read && (V.read = function(e) {
var i = L(e);
return i ? x(i) : read(e)
}), V.readBinary = function(e) {
var i;
return (i = L(e)) ? i : "function" == typeof readbuffer ? new Uint8Array(readbuffer(e)) : (f("object" == typeof(i = read(e, "binary"))), i)
}, "undefined" != typeof scriptArgs ? V.arguments = scriptArgs : void 0 !== arguments && (V.arguments = arguments), "function" == typeof quit && (V.quit = function(e) {
quit(e)
})) : (Z || z) && (z ? K = self.location.href : document.currentScript && (K = document.currentScript.src), K = 0 !== K.indexOf("blob:") ? K.substr(0, K.lastIndexOf("/") + 1) : "", V.read = function(e) {
try {
var i = new XMLHttpRequest;
return i.open("GET", e, !1), i.send(null), i.responseText
} catch (i) {
var r = L(e);
if (r) return x(r);
throw i
}
}, z && (V.readBinary = function(e) {
try {
var i = new XMLHttpRequest;
return i.open("GET", e, !1), i.responseType = "arraybuffer", i.send(null), new Uint8Array(i.response)
} catch (i) {
var r = L(e);
if (r) return r;
throw i
}
}), V.readAsync = function(e, i, r) {
var n = new XMLHttpRequest;
n.open("GET", e, !0), n.responseType = "arraybuffer", n.onload = function() {
if (200 == n.status || 0 == n.status && n.response) i(n.response);
else {
var f = L(e);
f ? i(f.buffer) : r()
}
}, n.onerror = r, n.send(null)
}, V.setWindowTitle = function(e) {
document.title = e
});
var X = V.print || ("undefined" != typeof console ? console.log.bind(console) : "undefined" != typeof print ? print : null),
N = V.printErr || ("undefined" != typeof printErr ? printErr : "undefined" != typeof console && console.warn.bind(console) || X);
for (H in W) W.hasOwnProperty(H) && (V[H] = W[H]);
W = void 0;
var $, ee, ie, re, ne, fe, te, ue, ae, Ae = (new Array(0), 0),
le = function(e) {
Ae = e
},
oe = function() {
return Ae
},
ce = !1,
se = 0,
be = "undefined" != typeof TextDecoder ? new TextDecoder("utf8") : void 0,
he = ("undefined" != typeof TextDecoder && new TextDecoder("utf-16le"), 9776),
we = V.TOTAL_MEMORY || 16777216;
we < 5242880 && N("TOTAL_MEMORY should be larger than TOTAL_STACK, was " + we + "! (TOTAL_STACK=5242880)"), V.buffer ? $ = V.buffer : ($ = new ArrayBuffer(we), V.buffer = $),
function() {
V.HEAP8 = ee = new Int8Array($), V.HEAP16 = re = new Int16Array($), V.HEAP32 = fe = new Int32Array($), V.HEAPU8 = ie = new Uint8Array($), V.HEAPU16 = ne = new Uint16Array($), V.HEAPU32 = te = new Uint32Array($), V.HEAPF32 = ue = new Float32Array($), V.HEAPF64 = ae = new Float64Array($)
}(), fe[he >> 2] = 5252912;
var ke = [],
ge = [],
ve = [],
Ce = [],
Ie = !1,
de = (Math.abs, Math.ceil, Math.floor, Math.min, 0),
me = null,
pe = null;
V.preloadedImages = {}, V.preloadedAudios = {};
var ye = null,
Pe = "data:application/octet-stream;base64,",
De = !(ye = "data:application/octet-stream;base64,AAAAAAAAAABWUDggAQAAAAIAAABWUDhMAQAAAAIAAABWUDhYAwAAAAQAAAAwMDAwAAAAAAAAAACAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgIGCg4SFhoeIiYqLjI2Oj5CRkpOUlZaXmJmam5ydnp+goaKjpKWmp6ipqqusra6vsLGys7S1tre4ubq7vL2+v8DBwsPExcbHyMnKy8zNzs/Q0dLT1NXW19jZ2tvc3d7f4OHi4+Tl5ufo6err7O3u7/Dx8vP09fb3+Pn6+/z9/v8AAQIDBAUGBwgJCgsMDQ4PEBESExQVFhcYGRobHB0eHyAhIiMkJSYnKCkqKywtLi8wMTIzNDU2Nzg5Ojs8PT4/QEFCQ0RFRkdISUpLTE1OT1BRUlNUVVZXWFlaW1xdXl9gYWJjZGVmZ2hpamtsbW5vcHFyc3R1dnd4eXp7fH1+f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f39/f38AAAAAAAAAAPDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDx8vP09fb3+Pn6+/z9/v8AAQIDBAUGBwgJCgsMDQ4PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PDw8PAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAgMEBQYHCAkKCwwNDg8QERITFBUWFxgZGhscHR4fICEiIyQlJicoKSorLC0uLzAxMjM0NTY3ODk6Ozw9Pj9AQUJDREVGR0hJSktMTU5PUFFSU1RVVldYWVpbXF1eX2BhYmNkZWZnaGlqa2xtbm9wcXJzdHV2d3h5ent8fX5/gIGCg4SFhoeIiYqLjI2Oj5CRkpOUlZaXmJmam5ydnp+goaKjpKWmp6ipqqusra6vsLGys7S1tre4ubq7vL2+v8DBwsPExcbHyMnKy8zNzs/Q0dLT1NXW19jZ2tvc3d7f4OHi4+Tl5ufo6err7O3u7/Dx8vP09fb3+Pn6+/z9/v////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////8AAP/+/fz7+vn49/b19PPy8fDv7u3s6+rp6Ofm5eTj4uHg397d3Nva2djX1tXU09LR0M/OzczLysnIx8bFxMPCwcC/vr28u7q5uLe2tbSzsrGwr66trKuqqainpqWko6KhoJ+enZybmpmYl5aVlJOSkZCPjo2Mi4qJiIeGhYSDgoGAf359fHt6eXh3dnV0c3JxcG9ubWxramloZ2ZlZGNiYWBfXl1cW1pZWFdWVVRTUlFQT05NTEtKSUhHRkVEQ0JBQD8+PTw7Ojk4NzY1NDMyMTAvLi0sKyopKCcmJSQjIiEgHx4dHBsaGRgXFhUUExIREA8ODQwLCgkIBwYFBAMCAQABAgMEBQYHCAkKCwwNDg8QERITFBUWFxgZGhscHR4fICEiIyQlJicoKSorLC0uLzAxMjM0NTY3ODk6Ozw9Pj9AQUJDREVGR0hJSktMTU5PUFFSU1RVVldYWVpbXF1eX2BhYmNkZWZnaGlqa2xtbm9wcXJzdHV2d3h5ent8fX5/gIGCg4SFhoeIiYqLjI2Oj5CRkpOUlZaXmJmam5ydnp+goaKjpKWmp6ipqqusra6vsLGys7S1tre4ubq7vL2+v8DBwsPExcbHyMnKy8zNzs/Q0dLT1NXW19jZ2tvc3d7f4OHi4+Tl5ufo6err7O3u7/Dx8vP09fb3+Pn6+/z9/v8AGAcXGSgGJykWGiYqOAU3ORUbNjolK0gER0kUHDU7RkokLFhFSzQ8A1dZEx1WWiMtRExVWzM9aAJnaRIeZmoiLlRcQ01lazI+eAF3eVNdER9kbEJOdnohL3V7MT9jbVJeAHR8QU8QIGJuMHN9UV9Acn5hb1Bxf2BwAAAAAAAAAAAAAAAAAQAAAAMAAAAHAAAADwAAAB8AAAA/AAAAfwAAAP8AAAD/AQAA/wMAAP8HAAD/DwAA/x8AAP8/AAD/fwAA//8AAP//AQD//wMA//8HAP//DwD//x8A//8/AP//fwD///8AAAAAAAAAAAAAAAAAiguMC44LkguaC6oLygsKDIwMjA2MD4wTAAAAAAAAAAAREgABAgMEBRAGBwgJCgsMDQ4PAAAAAAAAAAAAAAAAADBS4Q2GGLMDy6xfd2piiBxVXDhoKLizFPj+hUpLuN1Jl/P8ZIkCVVwAAClK2sF+Dau3QFl9V5JUcsoZTmmM0zhl7gEMX3WhMlL2N1QyLLtasVeqD+cz9XPa7l9o4sxjdYMOmW7tpzBHxtnATzwVa0n6AxRPDPsaVDILmXMcy9cmBjfMb9h3uywqL3Z13cwlZGFUsyQVh30KqBQEIme/HhSDFbRW4wLlc2+xykRCTSYo+666c+3rUAr7tmodC9Q6DWg72zWDHggrlWvOd/DlgVG8O4V4lJSfADzt5ScAAAAAAAAEAAgADACAAIQAiACMAAABBAEIAQwBgAGEAYgBjAHneDBZc3F4mHCYs0B+qnYuRl+vRY9QVVJIm2c4Ogqr2r0RDZhyGhGjLMMVCq15GFDDGj4sQFWQRwomq9WQIhqqLjcTiKAhzkc/FAhyctAMCeJRKAtgtlQdECSGt1mJYmVqpZRIu2SCnW8gS1BCZqdjSj4o6oApNQmy8Y0aCGtKKxqSSaYxF51BJmmgMzQfc4BoTwwb2f9XEQdXREcscjMPuhcvKQ5utrcVEcJCLRlmxb0XEhZYWJOWKi4txM0rYbd1VSYjsz0nNchXGhUr6Ks4IjNocmYdXU0nHFWrOqVaYkAiFnTOFyIrpklrNiAaMwFRKx9EGWoWQKsk4XIiExVmhLwQTHw+Ek5fVTkyMDPBZSOf129ZLm88lB+s2+QVEm9wcU1Vs/8meHIoKgHE9dEKGW1YKx2MptUlK5o9Px6bQy1EAdFkUAgrmgEzGkeOTk4Q/4AixaspKAVm07cEAd0zMhGo0cAXGVKKHySrG6YmLOVDVzqpUnMaO7M/O1q0O6ZdSZooKBV0j9EiJ68vDxC3It8xLbcuESG3BmIPILc5LhYYgAE2ESVBIElzHIAXgM0oAwlzM8ASBt9XJQlzO01AFS9oNyzaCTY1guJAWkbNKCkXGjk2OXC4BSkmptUeIhqFmHQKIIYnEzXdGnIgSf8fCUHqAg8BdklLIAwzwP+gKzNYHyNDZlU3ulU4FRdvO80tJcA3JkZ8SWYBImJ9YipYaFV1r1JfVDVZgGRxZS1LT3svM4BRqwE5EQVHZjk1KTEmIQ15OUkaAVUpCkOKTW5aL3JzFQIKZv+mFwZlHRAKVYBlxBo5EgpmZtUiFCt1FA8ko4BEARpmPUclIjUf88BFPEcmSXcc3iVELYAiAS8L9as+ERNGklU3PkYlKyWaZKNVoAE/CVyIHEAgyVVLDwkJQP+4dxBWBhwFQP8Z+AE4CBGEif83dIA6DxRShzkaeSikMh+JmoUZI9ozZyyDg3sfBp5WKECHlOAtt4AWGhGD8JoOAdEtEBVbQN4HAcU4FSebPIoXZtVTDA02wP9ELxxVGlVVgIAgkqsSCwc/kKsEBPYjGwqSrqsMGoC+UCNjtFB+Ni1Vfi9XsDMpFCBlS4CLdpJ0gFU4KQ+w7FUlCT5HHhF3dv8REoplJjyKN0YrGo6SJBMeq/9hGxSKLT0+2wFRvEAgKRR1l44UFaNwEww9w4AwBBgAAAAAAAAAAAAAAAAAAf8C/gMEBv0F/Pv6B/kI+PcAAAAAAAAAAAAAAAAAAP///////////////////////////////////////////7D2////////////3/H8///////////5/f3////////////0/P//////////6v7+///////////9///////////////2/v//////////7/3+///////////+//7////////////4/v//////////+//+///////////////////////////9/v//////////+/7+///////////+//7////////////+/f/+////////+v/+//7////////+/////////////////////////////////////////////////////////9n/////////////4fzx/f///v/////q+vH6/f/9/v/////+////////////3/7+///////////u/f7+///////////4/v//////////+f7////////////////////////////9////////////9/7////////////////////////////9/v///////////P/////////////////////////////+/v///////////f/////////////////////////////+/f//////////+v/////////////+/////////////////////////////////////////////////////////7r7+v//////////6vv0/v/////////7+/P9/v/+///////9/v//////////7P3+///////////7/f3+/v/////////+/v///////////v7+///////////////////////////+/////////////v7////////////+/////////////////////////////v////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////j/////////////+v78/v/////////4/vn9///////////9/f//////////9v39///////////8/vv+/v/////////+/P//////////+P79///////////9//7+///////////7/v//////////9fv+///////////9/f7////////////7/f///////////P3+/////////////v/////////////8////////////+f/+//////////////7//////////////f//////////+v///////////////////////////////////////////v///////////////////////////4CAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgP2I/v/k24CAgICAvYHy/+PV/9uAgIBqfuP81tH//4CAgAFi+P/s4v//gICAtYXu/t3q/5qAgIBOhsr3xrT/24CAgAG5+f/z/4CAgICAuJb3/+zggICAgIBNbtj/7OaAgICAgAFl+//x/4CAgICAqovx/OzR//+AgIAldMTz5P///4CAgAHM/v/1/4CAgICAz6D6/+6AgICAgIBmZ+f/06uAgICAgAGY/P/w/4CAgICAsYfz/+rhgICAgIBQgdP/wuCAgICAgAEB/4CAgICAgICA9gH/gICAgICAgID/gICAgICAgICAgMYj7d/Bu6KgkZs+gy3G3ayw3J383QFEL5LQlafdov/fgAGV8f/d4P//gICAuI3q/d7c/8eAgIBRY7XysL75yv//gAGB6P3WxfLE//+AY3nS+snG/8qAgIAXW6Pyqrv30v//gAHI9v/q/4CAgICAbbLx/+f1//+AgIAsgsn9zcD//4CAgAGE7/vb0f+lgICAXojh+9q+//+AgIAWZK71uqH/x4CAgAG2+f/o64CAgICAfI/x/+PqgICAgIAjTbX7wdP/zYCAgAGd9//s5///gICAeY3r/+Hj//+AgIAtY7z7w9n/4ICAgAEB+//V/4CAgICAywH4//+AgICAgICJAbH/4P+AgICAgP0J+PvP0P/AgICArw3g88G5+cb//4BJEavdobPsp//qgAFf9/3Ut///gICA71r0+tPR//+AgICbTcP4vMP//4CAgAEY7/va2//NgICAyTPb/8S6gICAgIBFLr7vydr/5ICAgAG/+///gICAgICA36X5/9X/gICAgICNfPj//4CAgICAgAEQ+P//gICAgICAviTm/+z/gICAgICVAf+AgICAgICAgAHi/4CAgICAgICA98D/gICAgICAgIDwgP+AgICAgICAgAGG/P//gICAgICA1T76//+AgICAgIA3Xf+AgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgMoY1eu6v9yg8K//fia26Km45K7/u4A9Lorbl7Lwqv/YgAFw5vrHv/ef//+Apm3k/NPX/66AgIAnTaLorLT1sv//gAE03PbGx/nc//+AfEq/87fB+t3//4AYR4Lbmqrztv//gAG24fnb8P/ggICAlZbi/NjN/6uAgIAcbKryt8L+3///gAFR5vzMy//AgICAe2bR97zE/+mAgIAUX5nzpK3/y4CAgAHe+P/Y1YCAgICAqK/2/OvN//+AgIAvdNf/09T//4CAgAF57P3U1v//gICAjVTV/MnK/9uAgIAqUKDworn/zYCAgAEB/4CAgICAgICA9AH/gICAgICAgIDuAf+AgICAgICAgAABAgMGBAUGBgYGBgYGBgcAAAAAAAAAAAAAAAAAAAAABAUGBwgJCgoLDA0ODxARERITFBQVFRYWFxcYGRkaGxwdHh8gISIjJCUlJicoKSorLC0uLi8wMTIzNDU2Nzg5Ojs8PT4/QEFCQ0RFRkdISUpLTExNTk9QUVJTVFVWV1hZW11fYGJkZWZoamxucHJ0dnp8foCChIaIioyPkZSXmp0EAAUABgAHAAgACQAKAAsADAANAA4ADwAQABEAEgATABQAFQAWABcAGAAZABoAGwAcAB0AHgAfACAAIQAiACMAJAAlACYAJwAoACkAKgArACwALQAuAC8AMAAxADIAMwA0ADUANgA3ADgAOQA6ADwAPgBAAEIARABGAEgASgBMAE4AUABSAFQAVgBYAFoAXABeAGAAYgBkAGYAaABqAGwAbgBwAHIAdAB3AHoAfQCAAIMAhgCJAIwAjwCSAJUAmACbAJ4AoQCkAKcAqgCtALEAtQC5AL0AwQDFAMkAzQDRANUA2QDdAOEA5QDqAO8A9QD5AP4AAwEIAQ0BEgEXARwBAAEECAUCAwYJDA0KBwsODyogAAAuIAAAMyAAADkgAAA8BAAAsAgAAC8KAAAvDQAAIB4AACQeAAAoHgAALB4AADAeAAA0HgAAOB4AAAEAAAAFAAAABgAAAAIAAAADAAAABAAAAFQeAABYHgAAGAEAAQABAAEoAAIDBwMDCwMEAwQEAgIEBAQCAQEIBwYEBAICAgEBAQEAAghDb3VsZCBub3QgZGVjb2RlIGFscGhhIGRhdGEuAEZyYW1lIHNldHVwIGZhaWxlZABubyBtZW1vcnkgZHVyaW5nIGZyYW1lIGluaXRpYWxpemF0aW9uLgB0aHJlYWQgaW5pdGlhbGl6YXRpb24gZmFpbGVkLgBBTFBIAFZQOEwAVlA4IABWUDhYAFJJRkYAV0VCUABudWxsIFZQOElvIHBhc3NlZCB0byBWUDhHZXRIZWFkZXJzKCkAVHJ1bmNhdGVkIGhlYWRlci4ASW5jb3JyZWN0IGtleWZyYW1lIHBhcmFtZXRlcnMuAEZyYW1lIG5vdCBkaXNwbGF5YWJsZS4AY2Fubm90IHBhcnNlIHBpY3R1cmUgaGVhZGVyAEJhZCBjb2RlIHdvcmQAYmFkIHBhcnRpdGlvbiBsZW5ndGgAY2Fubm90IHBhcnNlIHNlZ21lbnQgaGVhZGVyAGNhbm5vdCBwYXJzZSBmaWx0ZXIgaGVhZGVyAGNhbm5vdCBwYXJzZSBwYXJ0aXRpb25zAE5vdCBhIGtleSBmcmFtZS4AT0sArZSMALCbjIcAtJ2NhoIA/v7z5sSxmYyFgoEATlVMTCBWUDhJbyBwYXJhbWV0ZXIgaW4gVlA4RGVjb2RlKCkuAFByZW1hdHVyZSBlbmQtb2YtcGFydGl0aW9uMCBlbmNvdW50ZXJlZC4AUHJlbWF0dXJlIGVuZC1vZi1maWxlIGVuY291bnRlcmVkLgBPdXRwdXQgYWJvcnRlZC4="),
Be = "function" == typeof atob ? atob : function(e) {
var i, r, n, f, t, u, a = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",
A = "",
l = 0;
for (e = e.replace(/[^A-Za-z0-9\+\/\=]/g, ""); i = a.indexOf(e.charAt(l++)) << 2 | (f = a.indexOf(e.charAt(l++))) >> 4, r = (15 & f) << 4 | (t = a.indexOf(e.charAt(l++))) >> 2, n = (3 & t) << 6 | (u = a.indexOf(e.charAt(l++))), A += String.fromCharCode(i), 64 !== t && (A += String.fromCharCode(r)), 64 !== u && (A += String.fromCharCode(n)), l < e.length;);
return A
},
Ee = {
Math: Math,
Int8Array: Int8Array,
Int16Array: Int16Array,
Int32Array: Int32Array,
Uint8Array: Uint8Array,
Uint16Array: Uint16Array
},
_e = {
a: U,
b: le,
c: oe,
d: S,
e: m,
f: P,
g: y,
h: D,
i: B,
j: E,
k: _,
l: R,
m: G,
n: T,
o: M,
p: p,
q: 10016,
r: he
},
Re = function(e, i, r) {
"use asm";
var n = new e.Int8Array(r),
f = new e.Int16Array(r),
t = new e.Int32Array(r),
u = new e.Uint8Array(r),
a = new e.Uint16Array(r),
A = i.q | 0,
l = i.r | 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
v = e.Math.imul,
C = e.Math.clz32,
I = i.a,
d = i.b,
m = i.c,
p = i.d,
y = i.e,
P = i.f,
D = i.g,
B = i.h,
E = i.i,
_ = i.j,
R = i.k,
G = i.l,
T = i.m,
M = i.n,
S = i.o,
x = i.p,
F = 10032,
L = 5252912,
Q = 0;
function Y(e) {
e = e | 0;
var i = 0;
i = F;
F = F + e | 0;
F = F + 15 & -16;
return i | 0
}
function U() {
return F | 0
}
function H(e) {
e = e | 0;
F = e
}
function V(e, i) {
e = e | 0;
i = i | 0;
F = e;
L = i
}
function W(e, i) {
e = e | 0;
i = i | 0;
if ((e | 0) != 0 & (i & -256 | 0) == 256) {
Z(e);
e = 1
} else e = 0;
return e | 0
}
function Z(e) {
e = e | 0;
t[e >> 2] = 1;
t[e + 4 >> 2] = 0;
return
}
function z(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0;
o = F;
F = F + 48 | 0;
l = o;
do {
if ((e | 0) != 0 & (r & -256 | 0) == 256) {
r = En(1, 0, 328) | 0;
if (r | 0) {
if (!i) Z(l);
else {
f = l;
n = f + 36 | 0;
do {
t[f >> 2] = t[i >> 2];
f = f + 4 | 0;
i = i + 4 | 0
} while ((f | 0) < (n | 0))
}
if (((O(l, r) | 0 ? (u = J(e) | 0, t[r >> 2] = u, u | 0) : 0) ? (e = j(u, 1) | 0, a = r + 208 | 0, t[a >> 2] = e, l = j(u, 2) | 0, A = r + 212 | 0, t[A >> 2] = l, t[r + 216 >> 2] = j(u, 3) | 0, t[r + 220 >> 2] = j(u, 4) | 0, t[r + 224 >> 2] = j(u, 5) | 0, l = En(e << 2, 0, l) | 0, t[r + 244 >> 2] = l, l | 0) : 0) ? (l = En(t[a >> 2] << 2, 0, t[A >> 2] | 0) | 0, t[r + 248 >> 2] = l, l | 0) : 0) {
q(r);
break
}
}
K(r);
r = 0
} else r = 0
} while (0);
F = o;
return r | 0
}
function O(e, i) {
e = e | 0;
i = i | 0;
var r = 0;
r = t[e >> 2] | 0;
switch (r | 0) {
case 1:
case 3:
case 7:
case 8: {
t[i + 204 >> 2] = (r | 2 | 0) == 3 ? 1 : 2;
Ce(i + 4 | 0);
t[i + 44 >> 2] = r;
t[i + 56 >> 2] = 1;
t[i + 168 >> 2] = t[e + 4 >> 2];
e = 1;
break
}
default:
e = 0
}
return e | 0
}
function J(e) {
e = e | 0;
return ae(e, 0, 0, 263) | 0
}
function j(e, i) {
e = e | 0;
i = i | 0;
e: do {
if (!e) e = 0;
else switch (i | 0) {
case 0: {
e = t[e + 28 >> 2] | 0;
break e
}
case 1: {
e = t[e + 32 >> 2] | 0;
break e
}
case 2: {
e = t[e + 36 >> 2] | 0;
break e
}
case 3: {
e = t[e + 40 >> 2] | 0;
break e
}
case 4: {
e = t[e + 44 >> 2] | 0;
break e
}
case 5: {
e = t[e + 48 >> 2] | 0;
break e
}
default: {
e = 0;
break e
}
}
} while (0);
return e | 0
}
function q(e) {
e = e | 0;
var i = 0,
r = 0;
if (e | 0) {
r = e + 324 | 0;
e = e + 252 | 0;
i = e + 72 | 0;
do {
t[e >> 2] = 0;
e = e + 4 | 0
} while ((e | 0) < (i | 0));
t[r >> 2] = 1
}
return
}
function K(e) {
e = e | 0;
if (e | 0) {
ue(t[e >> 2] | 0);
ii(t[e + 244 >> 2] | 0);
ii(t[e + 248 >> 2] | 0);
ii(e)
}
return
}
function X(e, i) {
e = e | 0;
i = i | 0;
var r = 0;
if ((e | 0) == 0 | (i | 0) == 0) i = 0;
else {
e = e + 208 | 0;
r = i + 36 | 0;
do {
t[i >> 2] = t[e >> 2];
i = i + 4 | 0;
e = e + 4 | 0
} while ((i | 0) < (r | 0));
i = 1
}
return i | 0
}
function N(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
C = 0,
I = 0,
d = 0,
m = 0,
p = 0,
y = 0,
P = 0,
D = 0,
B = 0,
E = 0;
B = F;
F = F + 80 | 0;
n = B + 16 | 0;
o = B + 12 | 0;
c = B + 8 | 0;
s = B + 4 | 0;
b = B;
do {
if ((!((e | 0) == 0 | (i | 0) == 0 | (r | 0) == 0) ? ($(e) | 0) != 0 : 0) ? (p = t[e + 208 >> 2] | 0, y = t[e + 212 >> 2] | 0, k = t[e + 204 >> 2] | 0, P = e + 324 | 0, (ee(t[e >> 2] | 0, t[P >> 2] | 0, n) | 0) != 0) : 0) {
g = e + 252 | 0;
D = (t[n + 24 >> 2] | 0) + (t[g >> 2] | 0) | 0;
u = e + 256 | 0;
d = e + 320 | 0;
m = ie(n, u, t[d >> 2] | 0, p, y) | 0;
if (!m) {
f = e + 244 | 0;
if (!(ne(t[e + 248 >> 2] | 0, t[f >> 2] | 0, p, y) | 0)) {
n = 0;
break
} else C = f
} else {
f = e + 244 | 0;
if (!(re(t[f >> 2] | 0, p, y) | 0)) {
n = 0;
break
} else C = f
}
a = t[n + 36 >> 2] | 0;
A = t[n + 40 >> 2] | 0;
h = n + 12 | 0;
f = v(t[h >> 2] | 0, p) | 0;
l = n + 8 | 0;
f = f + (t[l >> 2] | 0) << 2;
I = p << 2;
t[e + 64 >> 2] = I;
w = n + 20 | 0;
t[e + 68 >> 2] = v(t[w >> 2] | 0, I) | 0;
t[e + 60 >> 2] = (t[C >> 2] | 0) + f;
if (!(Ao(a, A, e + 4 | 0) | 0)) {
e: do {
if ((t[n >> 2] | 0) > 1 ? (t[n + 48 >> 2] | m | 0) == 0 : 0) {
if (!(t[e + 284 >> 2] | 0)) {
a = e + 248 | 0;
A = n + 16 | 0;
f = 0;
while (1) {
if ((f | 0) >= (t[w >> 2] | 0)) break e;
b = v((t[h >> 2] | 0) + f | 0, p) | 0;
b = b + (t[l >> 2] | 0) | 0;
Ac[k & 7]((t[C >> 2] | 0) + (b << 2) | 0, (t[a >> 2] | 0) + (b << 2) | 0, t[A >> 2] | 0);
f = f + 1 | 0
}
}
A = e + 248 | 0;
a = 0;
while (1) {
if ((a | 0) >= (t[w >> 2] | 0)) break e;
l = (t[h >> 2] | 0) + a | 0;
fe(n, u, l, o, c, s, b);
f = t[c >> 2] | 0;
if ((f | 0) > 0) {
E = v(l, p) | 0;
E = (t[o >> 2] | 0) + E | 0;
Ac[k & 7]((t[C >> 2] | 0) + (E << 2) | 0, (t[A >> 2] | 0) + (E << 2) | 0, f)
}
f = t[b >> 2] | 0;
if ((f | 0) > 0) {
E = v(l, p) | 0;
E = (t[s >> 2] | 0) + E | 0;
Ac[k & 7]((t[C >> 2] | 0) + (E << 2) | 0, (t[A >> 2] | 0) + (E << 2) | 0, f)
}
a = a + 1 | 0
}
}
} while (0);t[g >> 2] = D;f = u + 64 | 0;do {
t[u >> 2] = t[n >> 2];
u = u + 4 | 0;
n = n + 4 | 0
} while ((u | 0) < (f | 0));t[d >> 2] = m;n = e + 248 | 0;ne(t[C >> 2] | 0, t[n >> 2] | 0, p, y) | 0;
if ((t[e + 284 >> 2] | 0) == 1) te(t[n >> 2] | 0, I, t[e + 264 >> 2] | 0, t[e + 268 >> 2] | 0, t[e + 272 >> 2] | 0, t[e + 276 >> 2] | 0);t[P >> 2] = (t[P >> 2] | 0) + 1;t[i >> 2] = t[C >> 2];t[r >> 2] = D;n = 1
}
else n = 0
} else n = 0
} while (0);
F = B;
return n | 0
}
function $(e) {
e = e | 0;
if (!e) e = 0;
else e = (t[e + 324 >> 2] | 0) <= (t[e + 224 >> 2] | 0) & 1;
return e | 0
}
function ee(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0;
if (!r) e = 0;
else {
n = r;
f = n + 60 | 0;
do {
t[n >> 2] = 0;
n = n + 4 | 0
} while ((n | 0) < (f | 0));
t[r + 60 >> 2] = e;
e = be(i, r) | 0
}
return e | 0
}
function ie(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var u = 0;
do {
if ((t[e >> 2] | 0) != 1) {
if (!((t[e + 44 >> 2] | 0) != 0 ? (t[e + 48 >> 2] | 0) != 1 : 0)) u = 4;
if ((u | 0) == 4 ? ye(t[e + 16 >> 2] | 0, t[e + 20 >> 2] | 0, n, f) | 0 : 0) {
e = 1;
break
}
if ((t[i + 28 >> 2] | 0) == 1) e = (ye(t[i + 16 >> 2] | 0, t[i + 20 >> 2] | 0, n, f) | 0 | r | 0) != 0 & 1;
else e = 0
} else e = 1
} while (0);
return e | 0
}
function re(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
i = po(i | 0, 0, 2) | 0;
i = wo(i | 0, m() | 0, r | 0, 0) | 0;
if ((i | 0) == (i & -4 | 0) & (m() | 0) == 0) {
Bo(e | 0, 0, i | 0) | 0;
i = 1
} else i = 0;
return i | 0
}
function ne(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
r = po(r | 0, 0, 2) | 0;
r = wo(r | 0, m() | 0, n | 0, 0) | 0;
if ((r | 0) == (r & -4 | 0) & (m() | 0) == 0) {
Po(i | 0, e | 0, r | 0) | 0;
r = 1
} else r = 0;
return r | 0
}
function fe(e, i, r, n, f, u, a) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
u = u | 0;
a = a | 0;
var A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0;
b = e + 8 | 0;
c = e + 16 | 0;
A = (t[c >> 2] | 0) + (t[b >> 2] | 0) | 0;
l = i + 8 | 0;
o = (t[i + 16 >> 2] | 0) + (t[l >> 2] | 0) | 0;
h = i + 12 | 0;
w = t[h >> 2] | 0;
i = t[i + 20 >> 2] | 0;
t[n >> 2] = -1;
t[f >> 2] = 0;
t[u >> 2] = -1;
t[a >> 2] = 0;
e = t[b >> 2] | 0;
if (((i + w | 0) > (r | 0) ? (t[h >> 2] | 0) <= (r | 0) : 0) & (e | 0) < (o | 0) ? (s = t[l >> 2] | 0, (A | 0) > (s | 0)) : 0) {
if ((e | 0) < (s | 0)) {
t[n >> 2] = e;
t[f >> 2] = (t[l >> 2] | 0) - (t[b >> 2] | 0)
}
if ((A | 0) > (o | 0)) {
t[u >> 2] = o;
t[a >> 2] = A - o
}
} else {
t[n >> 2] = e;
t[f >> 2] = t[c >> 2]
}
return
}
function te(e, i, r, n, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
var u = 0,
a = 0;
a = f << 2;
u = 0;
f = e + ((v(n, i) | 0) + (r << 2)) | 0;
while (1) {
if ((u | 0) >= (t | 0)) break;
Bo(f | 0, 0, a | 0) | 0;
u = u + 1 | 0;
f = f + i | 0
}
return
}
function ue(e) {
e = e | 0;
var i = 0,
r = 0;
if (e | 0) {
i = t[e + 52 >> 2] | 0;
while (1) {
if (!i) break;
r = t[i + 56 >> 2] | 0;
ii(i);
i = r
}
i = t[e + 60 >> 2] | 0;
while (1) {
if (!i) break;
r = t[i + 8 >> 2] | 0;
ii(i);
i = r
}
ii(e)
}
return
}
function ae(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0;
c = F;
F = F + 32 | 0;
a = c + 4 | 0;
A = c;
o = (r | 0) != 0;
if (o) t[r >> 2] = -1;
e: do {
if (((!((e | 0) == 0 | (n & -256 | 0) != 256) ? (u = t[e >> 2] | 0, (u | 0) != 0) : 0) ? (f = t[e + 4 >> 2] | 0, (f | 0) != 0) : 0) ? (Ae(a, u, f) | 0) != 0 : 0) {
e = le(a) | 0;
switch (e | 0) {
case 0: {
u = (t[a + 12 >> 2] | 0) >>> 0 < (t[a + 8 >> 2] | 0) >>> 0;
if ((i | 0) == 0 & u) {
e = 0;
break e
}
e = En(1, 0, 68) | 0;
t[A >> 2] = e;
if (!e) {
e = 0;
break e
}
ce(e, a);
n = 16;
while (1) {
f = t[n + 4 >> 2] | 0;
if (!f) {
f = 2;
break
}
if (!(bo(n, se(e) | 0, 4) | 0)) {
l = 19;
break
}
n = n + 12 | 0
}
do {
if ((l | 0) == 19) {
f = ic[f & 15](e) | 0;
if (!f) t[e + 20 >> 2] = 2;
if (!((f | 0) == 2 | (u | (f | 0) != 1) ^ 1) ? ic[t[n + 8 >> 2] & 15](e) | 0 : 0) break;
t[e + 20 >> 2] = -1;
f = 2
}
} while (0);
if (o) t[r >> 2] = t[e + 20 >> 2];
if ((f | 0) != 2) break e;
ue(e);
e = 0;
break e
}
case 2: {
e = oe(a, A) | 0;
if (!e) {
if (o) t[r >> 2] = 2;
e = t[A >> 2] | 0;
break e
}
break
}
default: {}
}
if (o) {
t[r >> 2] = ((e | 0) != 1) << 31 >> 31;
e = 0
} else e = 0
} else e = 0
} while (0);
F = c;
return e | 0
}
function Ae(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
t[e >> 2] = 0;
t[e + 4 >> 2] = 0;
t[e + 8 >> 2] = 0;
t[e + 12 >> 2] = 0;
t[e + 16 >> 2] = 0;
return Pe(e, i, r) | 0
}
function le(e) {
e = e | 0;
var i = 0,
r = 0;
if ((De(e) | 0) >>> 0 >= 20) {
r = se(e) | 0;
if (((bo(r, 7953, 4) | 0) == 0 ? (bo(r + 8 | 0, 7958, 4) | 0) == 0 : 0) ? (i = Be(r + 4 | 0) | 0, (i + -8 | 0) >>> 0 <= 4294967278) : 0) {
i = i + 8 | 0;
t[e + 8 >> 2] = i;
r = e + 12 | 0;
if ((t[r >> 2] | 0) >>> 0 > i >>> 0) {
t[e + 4 >> 2] = i;
t[r >> 2] = i
}
Ee(e, 12);
i = 0
} else i = 2
} else i = 1;
return i | 0
}
function oe(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0;
a = F;
F = F + 48 | 0;
f = a;
u = e + 12 | 0;
r = Re(t[e + 16 >> 2] | 0, t[u >> 2] | 0, f) | 0;
t[i >> 2] = 0;
do {
if (!r) {
r = En(1, 0, 68) | 0;
n = En(1, 0, 60) | 0;
if (!((r | 0) == 0 | (n | 0) == 0) ? (ce(r, e), Ge(0, t[u >> 2] | 0, 1, 1, f, n), Te(r, n) | 0) : 0) {
t[r + 20 >> 2] = 2;
t[r + 32 >> 2] = t[n + 8 >> 2];
t[r + 36 >> 2] = t[n + 12 >> 2];
u = r + 28 | 0;
t[u >> 2] = ((t[n + 16 >> 2] | 0) == 0 ? 0 : 16) | t[u >> 2];
t[r + 48 >> 2] = 1;
t[i >> 2] = r;
r = 0;
break
}
ii(r);
ii(n);
r = 2
} else r = (r | 0) == 7 ? 1 : 2
} while (0);
F = a;
return r | 0
}
function ce(e, i) {
e = e | 0;
i = i | 0;
t[e + 20 >> 2] = 0;
t[e + 40 >> 2] = 1;
t[e + 44 >> 2] = -1;
t[e + 32 >> 2] = -1;
t[e + 36 >> 2] = -1;
t[e + 56 >> 2] = e + 52;
t[e + 64 >> 2] = e + 60;
t[e >> 2] = t[i >> 2];
t[e + 4 >> 2] = t[i + 4 >> 2];
t[e + 8 >> 2] = t[i + 8 >> 2];
t[e + 12 >> 2] = t[i + 12 >> 2];
t[e + 16 >> 2] = t[i + 16 >> 2];
return
}
function se(e) {
e = e | 0;
return (t[e + 16 >> 2] | 0) + (t[e >> 2] | 0) | 0
}
function be(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0;
n = t[i + 60 >> 2] | 0;
if ((!((e | 0) < 0 | (n | 0) == 0) ? (f = t[n + 48 >> 2] | 0, (f | 0) >= (e | 0)) : 0) ? (r = Xe(n, (e | 0) == 0 ? f : e) | 0, (r | 0) != 0) : 0) e = Ne(n, r, i) | 0;
else e = 0;
return e | 0
}
function he(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0;
A = F;
F = F + 144 | 0;
l = A + 104 | 0;
r = A + 92 | 0;
n = A + 56 | 0;
f = A + 48 | 0;
u = A + 8 | 0;
a = A + 4 | 0;
t[l >> 2] = e;
t[l + 4 >> 2] = i;
t[l + 8 >> 2] = 1;
if ((Wl(l) | 0) == 8) {
we(n);
t[f >> 2] = e;
t[f + 4 >> 2] = i;
l = ke(f, n) | 0;
X(l, u) | 0;
N(l, a, A) | 0;
t[r >> 2] = t[u >> 2];
t[r + 4 >> 2] = t[u + 4 >> 2];
t[r + 8 >> 2] = t[a >> 2];
K(l)
} else t[r + 8 >> 2] = uo(e, i, r, r + 4 | 0) | 0;
F = A;
return r | 0
}
function we(e) {
e = e | 0;
W(e, 263) | 0;
return
}
function ke(e, i) {
e = e | 0;
i = i | 0;
return z(e, i, 263) | 0
}
function ge(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0;
n = 0;
while (1) {
if ((n | 0) >= (r | 0)) break;
f = e + (n << 2) | 0;
u = t[f >> 2] | 0;
if (u >>> 0 < 4278190080) t[f >> 2] = Ie(u, t[i + (n << 2) >> 2] | 0) | 0;
n = n + 1 | 0
}
return
}
function ve(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0;
n = 0;
while (1) {
if ((n | 0) >= (r | 0)) break;
f = e + (n << 2) | 0;
u = t[f >> 2] | 0;
if (u >>> 0 < 4278190080) t[f >> 2] = me(u, t[i + (n << 2) >> 2] | 0) | 0;
n = n + 1 | 0
}
return
}
function Ce(e) {
e = e | 0;
ao(e, 520) | 0;
return
}
function Ie(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
t = 0,
u = 0,
a = 0;
r = e >>> 24;
n = r & 255;
if (r) {
a = (v(i >>> 24, 256 - r | 0) | 0) >>> 8;
f = a & 255;
a = a + r | 0;
r = 16777216 / ((a & 255) >>> 0) | 0;
u = de(e, n, i, f, r, 0) | 0;
t = de(e, n, i, f, r, 8) | 0;
i = a << 24 | u & 255 | (t & 255) << 8 | ((de(e, n, i, f, r, 16) | 0) & 255) << 16
}
return i | 0
}
function de(e, i, r, n, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
return (v((v(e >>> t & 255, i & 255) | 0) + (v(r >>> t & 255, n & 255) | 0) | 0, f) | 0) >>> 24 & 255 | 0
}
function me(e, i) {
e = e | 0;
i = i | 0;
return (pe(i, 256 - (e >>> 24) | 0) | 0) + e | 0
}
function pe(e, i) {
e = e | 0;
i = i | 0;
return (v(e & 16711935, i) | 0) >>> 8 & 16711935 | (v(e >>> 8 & 16711935, i) | 0) & -16711936 | 0
}
function ye(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
return (e | 0) == (r | 0) & (i | 0) == (n | 0) & 1 | 0
}
function Pe(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0;
n = e + 12 | 0;
if ((t[n >> 2] | 0) >>> 0 > r >>> 0) e = 0;
else {
t[e + 16 >> 2] = i;
t[n >> 2] = r;
t[e + 4 >> 2] = r;
e = 1
}
return e | 0
}
function De(e) {
e = e | 0;
return (t[e + 4 >> 2] | 0) - (t[e >> 2] | 0) | 0
}
function Be(e) {
e = e | 0;
var i = 0;
i = _e(e) | 0;
return (_e(e + 2 | 0) | 0) << 16 | i | 0
}
function Ee(e, i) {
e = e | 0;
i = i | 0;
t[e >> 2] = (t[e >> 2] | 0) + i;
return
}
function _e(e) {
e = e | 0;
return (u[e + 1 >> 0] | 0) << 8 | (u[e >> 0] | 0) | 0
}
function Re(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
return EA(e, i, r, 520) | 0
}
function Ge(e, i, r, n, f, u) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
u = u | 0;
t[u + 40 >> 2] = e;
t[u + 44 >> 2] = i;
t[u + 8 >> 2] = t[f >> 2];
t[u + 12 >> 2] = t[f + 4 >> 2];
i = u + 16 | 0;
t[i >> 2] = t[i >> 2] | t[f + 8 >> 2];
t[u + 32 >> 2] = r;
t[u + 36 >> 2] = n;
return
}
function Te(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0;
e = e + 56 | 0;
r = t[e >> 2] | 0;
n = t[r >> 2] | 0;
if ((n | 0) != 0 ? (t[n + 36 >> 2] | 0) == 0 : 0) e = 0;
else {
t[r >> 2] = i;
n = i + 56 | 0;
t[n >> 2] = 0;
t[e >> 2] = n;
e = 1
}
return e | 0
}
function Me(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0;
do {
if ((t[e + 52 >> 2] | 0) == 0 ? (Le(e, 8) | 0) == 0 : 0)
if ((De(e) | 0) >>> 0 >= 8) {
A = En(1, 0, 60) | 0;
if (!A) i = 2;
else {
i = Qe(1, 0, e, A) | 0;
if ((i | 0) != 2) {
r = e + 28 | 0;
n = t[r >> 2] | 0;
if ((n & 16 | 0) == 0 ? (f = A + 52 | 0, t[f >> 2] | 0) : 0) {
t[A + 48 >> 2] = 0;
t[f >> 2] = 0;
t[A + 16 >> 2] = 0
}
if (((t[e + 24 >> 2] | 0) == 0 ? (u = t[A + 8 >> 2] | 0, (u | 0) > 0) : 0) ? (a = t[A + 12 >> 2] | 0, (a | 0) > 0) : 0) {
t[e + 20 >> 2] = 1;
t[e + 32 >> 2] = u;
t[e + 36 >> 2] = a;
t[r >> 2] = ((t[A + 16 >> 2] | 0) == 0 ? 0 : 16) | n
}
if (Te(e, A) | 0) {
t[e + 48 >> 2] = 1;
break
}
}
ii(A);
i = 2
}
} else i = 1;
else i = 2
} while (0);
return i | 0
}
function Se(e) {
e = e | 0;
var i = 0,
r = 0;
i = t[e + 52 >> 2] | 0;
r = t[e + 20 >> 2] | 0;
if (r)
if ((((t[e + 32 >> 2] | 0) >= 1 ? (t[e + 36 >> 2] | 0) >= 1 : 0) ? !((i | 0) == 0 & (r | 0) == 2) : 0) ? (t[i + 8 >> 2] | 0) >= 1 : 0) return (t[i + 12 >> 2] | 0) > 0 | 0;
else e = 0;
else e = 1;
return e | 0
}
function xe(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0;
if ((De(e) | 0) >>> 0 >= 8) {
t[e + 24 >> 2] = 1;
Ee(e, 4);
i = Ye(e) | 0;
if ((i + -10 | 0) >>> 0 <= 4294967276 ? (r = (i & 1) + i | 0, (Le(e, r) | 0) == 0) : 0)
if ((De(e) | 0) >>> 0 >= r >>> 0) {
t[e + 28 >> 2] = (He(e) | 0) & 255;
Ee(e, 3);
n = e + 32 | 0;
t[n >> 2] = (Ve(e) | 0) + 1;
i = (Ve(e) | 0) + 1 | 0;
t[e + 36 >> 2] = i;
n = t[n >> 2] | 0;
i = wo(n | 0, ((n | 0) < 0) << 31 >> 31 | 0, i | 0, ((i | 0) < 0) << 31 >> 31 | 0) | 0;
n = m() | 0;
if (!(n >>> 0 > 0 | (n | 0) == 0 & i >>> 0 > 4294967295) ? (Ee(e, r + -10 | 0), t[e + 20 >> 2] = 1, (Le(e, 8) | 0) == 0) : 0)
if ((De(e) | 0) >>> 0 < 8) e = 1;
else e = We(e) | 0;
else e = 2
} else e = 1;
else e = 2
} else e = 1;
return e | 0
}
function Fe(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0;
r = t[e + 28 >> 2] | 0;
n = r & 2;
o = (n | 0) == 0;
i = t[e + 52 >> 2] | 0;
f = t[e + 20 >> 2] | 0;
e: do {
if (f) {
a = t[e + 32 >> 2] | 0;
if ((((a | 0) >= 1 ? (A = t[e + 36 >> 2] | 0, (A | 0) >= 1) : 0) ? (t[e + 40 >> 2] | 0) >= 0 : 0) ? (l = (f | 0) == 2, (r & -63 | 0) == 0 & ((i | 0) == 0 & l ^ 1)) : 0) {
u = n >>> 1 ^ 1;
while (1) {
if (!i) {
i = 1;
break e
}
n = t[i + 32 >> 2] | 0;
f = o & (n | 0) > 1;
while (1) {
if (!i) {
i = 0;
break
}
if ((t[i + 32 >> 2] | 0) != (n | 0)) break;
e = i + 40 | 0;
r = i + 48 | 0;
if (f) {
i = 0;
break e
}
if (!(t[i + 36 >> 2] | 0)) {
if (l) {
i = 0;
break e
}
if ((t[i + 52 >> 2] | 0 ? t[i + 44 >> 2] | 0 : 0) ? (t[r >> 2] | 0) >>> 0 > (t[e >> 2] | 0) >>> 0 : 0) {
i = 0;
break e
}
if (t[i + 56 >> 2] | 0) {
i = 0;
break e
}
if ((t[i + 8 >> 2] | 0) > 0) c = 25
} else {
if (!(t[i + 52 >> 2] | 0)) {
if (!(t[i + 44 >> 2] | 0)) {
i = 0;
break e
}
} else if ((t[r >> 2] | 0) >>> 0 > (t[e >> 2] | 0) >>> 0) {
i = 0;
break e
}
if ((t[i + 8 >> 2] | 0) < 1) {
i = 0;
break e
}
if ((t[i + 12 >> 2] | 0) < 1) {
i = 0;
break e
} else c = 25
}
if (((c | 0) == 25 ? (c = 0, (t[i + 12 >> 2] | 0) > 0) : 0) ? (Ke(i, u, a, A) | 0) == 0 : 0) {
i = 0;
break e
}
i = t[i + 56 >> 2] | 0
}
}
} else i = 0
} else i = 1
} while (0);
return i | 0
}
function Le(e, i) {
e = e | 0;
i = i | 0;
return ((t[e + 8 >> 2] | 0) - (t[e >> 2] | 0) | 0) >>> 0 < i >>> 0 | 0
}
function Qe(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
v = 0,
C = 0,
I = 0,
d = 0,
m = 0,
p = 0;
m = F;
F = F + 48 | 0;
I = m;
C = De(r) | 0;
e: do {
if (C >>> 0 < 8 | C >>> 0 < i >>> 0) i = 1;
else {
v = r + 8 | 0;
C = n + 48 | 0;
b = n + 52 | 0;
h = n + 16 | 0;
w = n + 32 | 0;
k = r + 16 | 0;
a = 0;
u = 0;
f = 0;
i = 0;
g = t[r >> 2] | 0;
while (1) {
o = Ye(r) | 0;
p = Ye(r) | 0;
A = (p & 1) + p | 0;
s = De(r) | 0;
l = A >>> 0 > s >>> 0;
s = l ? s : A;
c = s + 8 | 0;
if (p >>> 0 > 4294967286) {
i = 2;
break e
}
if (Le(r, A) | 0) {
i = 2;
break e
}
i = l ? 1 : i;
i: do {
if ((o | 0) >= 1213221953) {
if ((o | 0) >= 1278758998) {
switch (o | 0) {
case 1278758998:
break;
default: {
d = 14;
break i
}
}
if ((a | 0) > 0) {
i = 2;
break e
} else {
d = 9;
break
}
}
switch (o | 0) {
case 1213221953:
break;
default: {
d = 14;
break i
}
}
if (!a) {
t[C >> 2] = g;
t[b >> 2] = c;
t[h >> 2] = 1;
t[w >> 2] = e;
Ee(r, s);
a = 1
} else d = 14
} else switch (o | 0) {
case 540561494: {
d = 9;
break
}
default:
d = 14
}
} while (0);
if ((d | 0) == 9) {
d = 0;
if (!u) {
u = Re((t[k >> 2] | 0) + g | 0, c, I) | 0;
if ((i | 0) == 1 & (u | 0) == 7) {
i = 1;
break
}
if (u | 0) {
i = 2;
break
}
Ge(g, c, e, (i | 0) == 0 & 1, I, n);
Ee(r, s);
u = 1
} else d = 14
}
if ((d | 0) == 14) {
d = 0;
Ue(r);
f = 1
}
g = t[r >> 2] | 0;
if ((g | 0) == (t[v >> 2] | 0)) f = 1;
else {
p = (De(r) | 0) >>> 0 < 8;
i = p ? 1 : i
}
if (f | i | 0) break e
}
}
} while (0);
F = m;
return i | 0
}
function Ye(e) {
e = e | 0;
var i = 0;
i = Be((t[e + 16 >> 2] | 0) + (t[e >> 2] | 0) | 0) | 0;
Ee(e, 4);
return i | 0
}
function Ue(e) {
e = e | 0;
t[e >> 2] = (t[e >> 2] | 0) + -8;
return
}
function He(e) {
e = e | 0;
var i = 0;
i = n[(t[e + 16 >> 2] | 0) + (t[e >> 2] | 0) >> 0] | 0;
Ee(e, 1);
return i | 0
}
function Ve(e) {
e = e | 0;
var i = 0;
i = Ze((t[e + 16 >> 2] | 0) + (t[e >> 2] | 0) | 0) | 0;
Ee(e, 3);
return i | 0
}
function We(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
u = e + 28 | 0;
A = (t[u >> 2] & 2 | 0) != 0;
l = e + 8 | 0;
o = e + 44 | 0;
c = e + 40 | 0;
r = 0;
a = t[e >> 2] | 0;
e: do {
i = Ye(e) | 0;
n = Ye(e) | 0;
f = (n & 1) + n | 0;
if (n >>> 0 > 4294967286) {
i = 2;
break
}
if (Le(e, f) | 0) {
i = 2;
break
}
i: do {
if ((i | 0) >= 1213221953) {
if ((i | 0) < 1296649793)
if ((i | 0) < 1278758998) switch (i | 0) {
case 1213221953: {
s = 5;
break i
}
default: {
i = 1;
s = 16;
break i
}
} else switch (i | 0) {
case 1278758998: {
s = 5;
break i
}
default: {
i = 1;
s = 16;
break i
}
}
if ((i | 0) >= 1346585417) {
if ((i | 0) >= 1480085590) switch (i | 0) {
case 1480085590: {
i = 2;
break e
}
default: {
i = 1;
s = 16;
break i
}
}
switch (i | 0) {
case 1346585417:
break;
default: {
i = 1;
s = 16;
break i
}
}
i = (t[u >> 2] | 0) >>> 5 & 1;
s = 16;
break
}
switch (i | 0) {
case 1296649793:
break;
default: {
i = 1;
s = 16;
break i
}
}
if (f >>> 0 < 6) {
i = 2;
break e
}
if ((De(e) | 0) >>> 0 >= f >>> 0)
if (!r) {
t[o >> 2] = Ye(e) | 0;
t[c >> 2] = ze(e) | 0;
Ee(e, f + -6 | 0);
r = 1;
i = 0
} else {
i = 0;
s = 16
}
else i = 1
} else {
if ((i | 0) < 1179211845) {
if ((i | 0) < 542133592) switch (i | 0) {
case 540561494: {
s = 5;
break i
}
default: {
i = 1;
s = 16;
break i
}
}
switch (i | 0) {
case 542133592:
break;
default: {
i = 1;
s = 16;
break i
}
}
i = (t[u >> 2] | 0) >>> 2 & 1;
s = 16;
break
}
if ((i | 0) < 1179471425) {
switch (i | 0) {
case 1179211845:
break;
default: {
i = 1;
s = 16;
break i
}
}
i = (t[u >> 2] | 0) >>> 3 & 1;
s = 16;
break
}
switch (i | 0) {
case 1179471425:
break;
default: {
i = 1;
s = 16;
break i
}
}
if (!r) {
i = 2;
break e
}
i = Oe(e, f) | 0
}
} while (0);
if ((s | 0) == 5) {
s = 0;
if (A | (r | 0) > 0) {
i = 2;
break
}
Ue(e);
i = Me(e) | 0
} else if ((s | 0) == 16) {
s = 0;
if (f >>> 0 > (De(e) | 0) >>> 0) i = 1;
else {
if (i | 0 ? (Je(e, a, n + 8 | 0) | 0) == 0 : 0) {
i = 2;
break
}
Ee(e, f);
i = 0
}
}
a = t[e >> 2] | 0;
if ((a | 0) == (t[l >> 2] | 0)) break;
f = (De(e) | 0) >>> 0 < 8;
i = f ? 1 : i
} while (!(i | 0));
return i | 0
}
function Ze(e) {
e = e | 0;
var i = 0;
i = _e(e) | 0;
return (u[e + 2 >> 0] | 0) << 16 | i | 0
}
function ze(e) {
e = e | 0;
var i = 0;
i = _e((t[e + 16 >> 2] | 0) + (t[e >> 2] | 0) | 0) | 0;
Ee(e, 2);
return i | 0
}
function Oe(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0;
a = F;
F = F + 16 | 0;
r = a;
u = (t[e + 28 >> 2] & 2 | 0) != 0;
f = i + -16 | 0;
i = je(e, i, r) | 0;
do {
if (!i) {
i = (Ve(e) | 0) << 1;
n = t[r >> 2] | 0;
t[n >> 2] = i;
t[n + 4 >> 2] = (Ve(e) | 0) << 1;
r = n + 8 | 0;
t[r >> 2] = (Ve(e) | 0) + 1;
i = n + 12 | 0;
t[i >> 2] = (Ve(e) | 0) + 1;
t[n + 20 >> 2] = Ve(e) | 0;
A = (He(e) | 0) & 255;
t[n + 24 >> 2] = A & 1;
t[n + 28 >> 2] = A >>> 1 & 1;
r = t[r >> 2] | 0;
i = t[i >> 2] | 0;
r = wo(i | 0, ((i | 0) < 0) << 31 >> 31 | 0, r | 0, ((r | 0) < 0) << 31 >> 31 | 0) | 0;
i = m() | 0;
if (i >>> 0 > 0 | (i | 0) == 0 & r >>> 0 > 4294967295) {
ii(n);
i = 2;
break
}
r = e + 48 | 0;
i = Qe((t[r >> 2] | 0) + 1 | 0, f, e, n) | 0;
if (u & (i | 0) != 2 ? (t[n + 32 >> 2] | 0) > 0 : 0)
if (!(Te(e, n) | 0)) i = 2;
else {
t[r >> 2] = (t[r >> 2] | 0) + 1;
break
} ii(n)
}
} while (0);
F = a;
return i | 0
}
function Je(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0;
n = En(1, 0, 12) | 0;
if (!n) e = 0;
else {
t[n >> 2] = i;
t[n + 4 >> 2] = r;
qe(e, n);
e = 1
}
return e | 0
}
function je(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
if (!(i >>> 0 < 16 | (Le(e, 16) | 0) != 0))
if ((De(e) | 0) >>> 0 < 16) e = 1;
else {
e = En(1, 0, 60) | 0;
t[r >> 2] = e;
e = (e | 0) == 0 ? 2 : 0
}
else e = 2;
return e | 0
}
function qe(e, i) {
e = e | 0;
i = i | 0;
e = e + 64 | 0;
t[t[e >> 2] >> 2] = i;
i = i + 8 | 0;
t[i >> 2] = 0;
t[e >> 2] = i;
return
}
function Ke(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0,
a = 0;
u = t[e >> 2] | 0;
if (!i)
if ((((u | 0) >= 0 ? (f = t[e + 4 >> 2] | 0, (f | 0) >= 0) : 0) ? ((t[e + 8 >> 2] | 0) + u | 0) <= (r | 0) : 0) ? ((t[e + 12 >> 2] | 0) + f | 0) <= (n | 0) : 0) a = 10;
else e = 0;
else if ((((u | 0) == 0 ? (t[e + 4 >> 2] | 0) == 0 : 0) ? (t[e + 8 >> 2] | 0) == (r | 0) : 0) ? (t[e + 12 >> 2] | 0) == (n | 0) : 0) a = 10;
else e = 0;
if ((a | 0) == 10) e = 1;
return e | 0
}
function Xe(e, i) {
e = e | 0;
i = i | 0;
e = e + 52 | 0;
while (1) {
e = t[e >> 2] | 0;
if (!e) {
e = 0;
break
}
if ((t[e + 32 >> 2] | 0) == (i | 0)) break;
e = e + 56 | 0
}
return e | 0
}
function Ne(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0;
u = F;
F = F + 16 | 0;
n = u;
f = t[e + 16 >> 2] | 0;
t[n >> 2] = 0;
f = $e(f, i, n) | 0;
if (!f) e = 0;
else {
t[r >> 2] = t[i + 32 >> 2];
t[r + 4 >> 2] = t[e + 48 >> 2];
t[r + 8 >> 2] = t[i >> 2];
t[r + 12 >> 2] = t[i + 4 >> 2];
t[r + 16 >> 2] = t[i + 8 >> 2];
t[r + 20 >> 2] = t[i + 12 >> 2];
t[r + 44 >> 2] = t[i + 16 >> 2];
t[r + 24 >> 2] = t[i + 20 >> 2];
t[r + 28 >> 2] = t[i + 24 >> 2];
t[r + 48 >> 2] = t[i + 28 >> 2];
t[r + 32 >> 2] = t[i + 36 >> 2];
t[r + 36 >> 2] = f;
t[r + 40 >> 2] = t[n >> 2];
e = 1
}
F = u;
return e | 0
}
function $e(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0,
a = 0;
t[r >> 2] = 0;
if (!i) n = 0;
else {
f = i + 40 | 0;
n = t[f >> 2] | 0;
u = t[i + 44 >> 2] | 0;
t[r >> 2] = u;
a = t[i + 52 >> 2] | 0;
if (a) {
f = t[f >> 2] | 0;
n = t[i + 48 >> 2] | 0;
t[r >> 2] = a + u + ((f | 0) == 0 ? 0 : f - a - n | 0)
}
n = e + n | 0
}
return n | 0
}
function ei(e) {
e = e | 0;
var i = 0;
i = e + 2360 | 0;
ii(t[i >> 2] | 0);
t[i >> 2] = 0;
t[e + 2364 >> 2] = 0;
e = e + 2344 | 0;
ri(t[e >> 2] | 0);
t[e >> 2] = 0;
return
}
function ii(e) {
e = e | 0;
oo(e);
return
}
function ri(e) {
e = e | 0;
var i = 0;
if (e | 0) {
i = e + 20 | 0;
ni(t[i >> 2] | 0);
t[i >> 2] = 0;
ii(e)
}
return
}
function ni(e) {
e = e | 0;
if (e | 0) {
fi(e);
ii(e)
}
return
}
function fi(e) {
e = e | 0;
var i = 0,
r = 0;
if (e | 0) {
ti(e + 120 | 0);
r = e + 16 | 0;
ii(t[r >> 2] | 0);
t[r >> 2] = 0;
r = e + 176 | 0;
i = 0;
while (1) {
if ((i | 0) >= (t[r >> 2] | 0)) break;
ui(e + 180 + (i * 20 | 0) | 0);
i = i + 1 | 0
}
t[r >> 2] = 0;
t[e + 260 >> 2] = 0;
r = e + 264 | 0;
ii(t[r >> 2] | 0);
t[r >> 2] = 0;
t[e + 12 >> 2] = 0
}
return
}
function ti(e) {
e = e | 0;
ii(t[e + 40 >> 2] | 0);
ii(t[e + 52 >> 2] | 0);
ai(t[e + 48 >> 2] | 0);
Ai(e + 4 | 0);
Ai(e + 16 | 0);
li(e);
return
}
function ui(e) {
e = e | 0;
e = e + 16 | 0;
ii(t[e >> 2] | 0);
t[e >> 2] = 0;
return
}
function ai(e) {
e = e | 0;
if (e | 0) ii(e);
return
}
function Ai(e) {
e = e | 0;
if (e | 0) {
ii(t[e >> 2] | 0);
t[e >> 2] = 0
}
return
}
function li(e) {
e = e | 0;
var i = 0;
i = e + 56 | 0;
do {
t[e >> 2] = 0;
e = e + 4 | 0
} while ((e | 0) < (i | 0));
return
}
function oi(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
o = t[i >> 2] | 0;
c = i + 88 | 0;
A = t[c >> 2] | 0;
e: do {
if ((r | 0) < 0 | (n | 0) < 1 | (n + r | 0) > (A | 0)) f = 0;
else {
u = e + 2356 | 0;
do {
if (!(t[u >> 2] | 0)) {
a = e + 2344 | 0;
do {
if (!(t[a >> 2] | 0)) {
s = ci() | 0;
t[a >> 2] = s;
if (!s) {
f = 0;
break e
}
if (si(e, i) | 0 ? bi(t[a >> 2] | 0, t[e + 2348 >> 2] | 0, t[e + 2352 >> 2] | 0, i, t[e + 2364 >> 2] | 0) | 0 : 0)
if ((t[(t[a >> 2] | 0) + 16 >> 2] | 0) == 1) {
f = A - r | 0;
l = 10;
break
} else {
t[e + 2372 >> 2] = 0;
f = n;
l = 10;
break
}
} else {
f = n;
l = 10
}
} while (0);
if ((l | 0) == 10 ? hi(e, r, f) | 0 : 0) {
if (!(t[u >> 2] | 0)) break;
ri(t[a >> 2] | 0);
t[a >> 2] = 0;
f = t[e + 2372 >> 2] | 0;
if ((f | 0) <= 0) break;
s = t[i + 84 >> 2] | 0;
A = (t[e + 2364 >> 2] | 0) + (v(s, o) | 0) | 0;
l = t[i + 76 >> 2] | 0;
if (wi(A + l | 0, (t[i + 80 >> 2] | 0) - l | 0, (t[c >> 2] | 0) - s | 0, o, f) | 0) break
}
ei(e);
f = 0;
break e
}
} while (0);
f = (t[e + 2364 >> 2] | 0) + (v(o, r) | 0) | 0
}
} while (0);
return f | 0
}
function ci() {
return En(1, 0, 144) | 0
}
function si(e, i) {
e = e | 0;
i = i | 0;
var r = 0;
r = t[i >> 2] | 0;
i = t[i + 88 >> 2] | 0;
i = wo(i | 0, ((i | 0) < 0) << 31 >> 31 | 0, r | 0, ((r | 0) < 0) << 31 >> 31 | 0) | 0;
i = mi(i, m() | 0, 1) | 0;
t[e + 2360 >> 2] = i;
if (!i) i = 0;
else {
t[e + 2364 >> 2] = i;
t[e + 2368 >> 2] = 0;
i = 1
}
return i | 0
}
function bi(e, i, r, f, a) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
a = a | 0;
var A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0;
c = i + 1 | 0;
s = r + -1 | 0;
b = e + 24 | 0;
bn();
t[e + 136 >> 2] = a;
t[e >> 2] = t[f >> 2];
a = f + 4 | 0;
A = e + 4 | 0;
t[A >> 2] = t[a >> 2];
do {
if ((r >>> 0 >= 2 ? (r = n[i >> 0] & 3, l = e + 8 | 0, t[l >> 2] = r & 255, t[e + 12 >> 2] = (u[i >> 0] | 0) >>> 2 & 3, o = (u[i >> 0] | 0) >>> 4 & 3, t[e + 16 >> 2] = o, (r & 255) <= 1) : 0) ? !(o >>> 0 > 1 | (u[i >> 0] | 0) > 63) : 0) {
hn(b);
wn(0, b);
t[e + 64 >> 2] = e;
t[b >> 2] = t[f >> 2];
t[e + 28 >> 2] = t[a >> 2];
t[e + 96 >> 2] = t[f + 72 >> 2];
t[e + 100 >> 2] = t[f + 76 >> 2];
t[e + 104 >> 2] = t[f + 80 >> 2];
t[e + 108 >> 2] = t[f + 84 >> 2];
t[e + 112 >> 2] = t[f + 88 >> 2];
if (!(t[l >> 2] | 0)) {
a = s >>> 0 >= (v(t[A >> 2] | 0, t[e >> 2] | 0) | 0) >>> 0 & 1;
break
} else {
a = kn(e, c, s) | 0;
break
}
} else a = 0
} while (0);
return a | 0
}
function hi(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
a = t[e + 2344 >> 2] | 0;
o = t[a >> 2] | 0;
c = t[a + 112 >> 2] | 0;
if (t[a + 8 >> 2] | 0) {
n = r + i | 0;
if (!(Di(a, n) | 0)) n = 0;
else f = 11
} else {
l = e + 2368 | 0;
n = t[l >> 2] | 0;
f = v(o, i) | 0;
u = (t[e + 2348 >> 2] | 0) + 1 + f | 0;
f = (t[e + 2364 >> 2] | 0) + f | 0;
A = a + 12 | 0;
e: do {
if (!(t[A >> 2] | 0)) {
a = f;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break e;
Po(a | 0, u | 0, o | 0) | 0;
n = a;
a = a + o | 0;
u = u + o | 0;
f = f + 1 | 0
}
} else {
a = f;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break e;
lc[t[8528 + (t[A >> 2] << 2) >> 2] & 31](n, u, a, o);
s = a;
a = a + o | 0;
u = u + o | 0;
f = f + 1 | 0;
n = s
}
}
} while (0);
t[l >> 2] = n;
n = r + i | 0;
f = 11
}
if ((f | 0) == 11)
if ((n | 0) < (c | 0)) n = 1;
else {
t[e + 2356 >> 2] = 1;
n = 1
} return n | 0
}
function wi(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var u = 0,
a = 0,
A = 0,
l = 0;
l = F;
F = F + 80 | 0;
A = l;
u = (f | 0) / 25 | 0;
do {
if (f >>> 0 <= 100 ? !((e | 0) == 0 | (i | 0) < 1 | (r | 0) < 1) : 0) {
f = (u << 1 | 1 | 0) > (i | 0) ? i + -1 >> 1 : u;
f = (f << 1 | 1 | 0) > (r | 0) ? r + -1 >> 1 : f;
if ((f | 0) > 0) {
u = A;
a = u + 76 | 0;
do {
t[u >> 2] = 0;
u = u + 4 | 0
} while ((u | 0) < (a | 0));
if (!(ki(e, i, r, n, f, A) | 0)) {
f = 0;
break
}
e: do {
if ((t[A + 56 >> 2] | 0) > 2) {
u = A + 12 | 0;
a = A + 4 | 0;
e = A + 24 | 0;
f = t[u >> 2] | 0;
while (1) {
if ((f | 0) >= (t[a >> 2] | 0)) break e;
gi(A);
f = t[u >> 2] | 0;
if ((f | 0) >= (t[e >> 2] | 0)) {
vi(A);
Ci(A);
f = t[u >> 2] | 0
}
f = f + 1 | 0;
t[u >> 2] = f
}
}
} while (0);
Ii(A);
f = 1
} else f = 1
} else f = 0
} while (0);
F = l;
return f | 0
}
function ki(e, i, r, n, f, u) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
u = u | 0;
var a = 0,
A = 0,
l = 0,
o = 0,
c = 0;
l = f << 1 | 1;
o = i << 1;
a = v(o, l + 1 | 0) | 0;
A = mi(1, 0, o + 4094 + a | 0) | 0;
if (!A) e = 0;
else {
t[u + 32 >> 2] = A;
t[u + 36 >> 2] = A;
t[u + 40 >> 2] = A;
c = A + ((v(l, i) | 0) << 1) | 0;
t[u + 44 >> 2] = c;
c = c + (0 - i << 1) | 0;
t[u + 48 >> 2] = c;
Bo(c | 0, 0, o | 0) | 0;
A = A + a | 0;
t[u + 52 >> 2] = A;
t[u >> 2] = i;
t[u + 4 >> 2] = r;
t[u + 8 >> 2] = n;
t[u + 16 >> 2] = e;
t[u + 20 >> 2] = e;
t[u + 24 >> 2] = f;
t[u + 28 >> 2] = 262144 / ((v(l, l) | 0) >>> 0) | 0;
t[u + 12 >> 2] = 0 - f;
pi(u);
e = A + o + 2046 | 0;
t[u + 72 >> 2] = e;
yi(e, t[u + 68 >> 2] | 0);
e = 1
}
return e | 0
}
function gi(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
v = 0;
n = e + 16 | 0;
l = t[n >> 2] | 0;
o = t[e >> 2] | 0;
c = e + 40 | 0;
s = t[c >> 2] | 0;
b = e + 48 | 0;
h = t[b >> 2] | 0;
w = t[e + 44 >> 2] | 0;
A = s;
i = 0;
r = 0;
while (1) {
if ((r | 0) >= (o | 0)) break;
k = (i & 65535) + (u[l + r >> 0] | 0) | 0;
v = k + (a[h + (r << 1) >> 1] | 0) | 0;
g = s + (r << 1) | 0;
f[w + (r << 1) >> 1] = v - (a[g >> 1] | 0);
f[g >> 1] = v;
i = k;
r = r + 1 | 0
}
t[b >> 2] = A;
v = s + (o << 1) | 0;
t[c >> 2] = v;
if ((v | 0) == (w | 0)) t[c >> 2] = t[e + 36 >> 2];
v = t[e + 12 >> 2] | 0;
if ((v | 0) > -1 ? (v | 0) < ((t[e + 4 >> 2] | 0) + -1 | 0) : 0) t[n >> 2] = l + (t[e + 8 >> 2] | 0);
return
}
function vi(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0,
u = 0,
A = 0,
l = 0,
o = 0,
c = 0;
A = t[e + 44 >> 2] | 0;
l = t[e + 52 >> 2] | 0;
o = t[e + 28 >> 2] | 0;
c = t[e >> 2] | 0;
n = t[e + 24 >> 2] | 0;
e = n + -1 | 0;
i = 0;
while (1) {
if ((n | 0) < (i | 0)) break;
f[l + (i << 1) >> 1] = (v((a[A + (n - i << 1) >> 1] | 0) + (a[A + (e + i << 1) >> 1] | 0) & 65535, o) | 0) >>> 16;
i = i + 1 | 0
}
r = c - n | 0;
u = ~n;
e = i;
while (1) {
if ((e | 0) >= (r | 0)) break;
f[l + (e << 1) >> 1] = (v((a[A + (e + n << 1) >> 1] | 0) - (a[A + (e + u << 1) >> 1] | 0) & 65535, o) | 0) >>> 16;
e = e + 1 | 0
}
r = A + (c + -1 << 1) | 0;
i = (c << 1) + -2 - n | 0;
while (1) {
if ((e | 0) >= (c | 0)) break;
f[l + (e << 1) >> 1] = (v(((a[r >> 1] | 0) << 1) - (a[A + (i - e << 1) >> 1] | 0) - (a[A + (e + u << 1) >> 1] | 0) & 65535, o) | 0) >>> 16;
e = e + 1 | 0
}
return
}
function Ci(e) {
e = e | 0;
var i = 0,
r = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0;
l = t[e + 52 >> 2] | 0;
o = t[e >> 2] | 0;
c = t[e + 72 >> 2] | 0;
s = e + 20 | 0;
b = t[s >> 2] | 0;
h = e + 64 | 0;
w = e + 60 | 0;
i = 0;
while (1) {
if ((i | 0) >= (o | 0)) break;
r = b + i | 0;
A = u[r >> 0] | 0;
if ((t[h >> 2] | 0) > (A | 0) ? (t[w >> 2] | 0) < (A | 0) : 0) n[r >> 0] = di((f[c + ((a[l + (i << 1) >> 1] | 0) - (A << 2) << 1) >> 1] | 0) + A | 0) | 0;
i = i + 1 | 0
}
t[s >> 2] = (t[s >> 2] | 0) + (t[e + 8 >> 2] | 0);
return
}
function Ii(e) {
e = e | 0;
ii(t[e + 32 >> 2] | 0);
return
}
function di(e) {
e = e | 0;
if (e >>> 0 > 255) e = (e >> 31 & -255) + 255 | 0;
else e = e & 255;
return e & 255 | 0
}
function mi(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
if (!(Pi(e, i, r) | 0)) e = 0;
else e = lo(v(e, r) | 0) | 0;
return e | 0
}
function pi(e) {
e = e | 0;
var i = 0,
r = 0,
f = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0;
g = F;
F = F + 256 | 0;
w = g;
Bo(w | 0, 0, 256) | 0;
l = t[e + 16 >> 2] | 0;
s = e + 60 | 0;
t[s >> 2] = 255;
b = e + 64 | 0;
t[b >> 2] = 0;
h = e + 8 | 0;
o = t[e + 4 >> 2] | 0;
A = 0;
r = 0;
i = 255;
while (1) {
if ((A | 0) >= (o | 0)) break;
c = t[e >> 2] | 0;
a = 0;
while (1) {
if ((a | 0) >= (c | 0)) break;
f = u[l + a >> 0] | 0;
if ((i | 0) > (f | 0)) {
t[s >> 2] = f;
i = f
}
if ((r | 0) < (f | 0)) {
t[b >> 2] = f;
r = f
}
n[w + f >> 0] = 1;
a = a + 1 | 0
}
A = A + 1 | 0;
l = l + (t[h >> 2] | 0) | 0
}
r = r - i | 0;
A = e + 68 | 0;
t[A >> 2] = r;
a = e + 56 | 0;
i = -1;
f = 0;
while (1) {
if ((f | 0) == 256) break;
if (n[w + f >> 0] | 0) {
t[a >> 2] = (t[a >> 2] | 0) + 1;
if ((i | 0) > -1 ? (k = f - i | 0, (k | 0) < (r | 0)) : 0) {
t[A >> 2] = k;
i = f;
r = k
} else i = f
}
f = f + 1 | 0
}
F = g;
return
}
function yi(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
t = 0,
u = 0;
u = i << 2;
n = i * 12 >> 2;
t = u - n | 0;
i = 1;
while (1) {
if ((i | 0) == 1024) break;
if ((i | 0) > (n | 0))
if ((u | 0) > (i | 0)) r = (v(u - i | 0, n) | 0) / (t | 0) | 0;
else r = 0;
else r = i;
r = r >> 2;
f[e + (i << 1) >> 1] = r;
f[e + (0 - i << 1) >> 1] = 0 - r;
i = i + 1 | 0
}
f[e >> 1] = 0;
return
}
function Pi(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0;
n = wo(r | 0, 0, e | 0, i | 0) | 0;
f = m() | 0;
if ((e | 0) == 0 & (i | 0) == 0) return 1;
else {
i = Io(2147418112, 0, e | 0, i | 0) | 0;
e = m() | 0;
return (n | 0) == (n | 0) & (f | 0) == 0 & (e >>> 0 > 0 | (e | 0) == 0 & i >>> 0 >= r >>> 0) & 1 | 0
}
return 0
}
function Di(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0;
n = t[e + 20 >> 2] | 0;
do {
if ((t[n + 108 >> 2] | 0) < (i | 0)) {
r = e + 132 | 0;
if (!(t[r >> 2] | 0)) {
Bi();
e = t[n + 16 >> 2] | 0;
if (!(t[r >> 2] | 0)) {
e = Ri(n, e, t[n + 100 >> 2] | 0, t[n + 104 >> 2] | 0, i, 1) | 0;
break
}
} else e = t[n + 16 >> 2] | 0;
e = Ei(n, e, t[n + 100 >> 2] | 0, t[n + 104 >> 2] | 0, i) | 0
} else e = 1
} while (0);
return e | 0
}
function Bi() {
var e = 0;
if (!(Eo(8996) | 0)) {
if (!(t[1928] | 0)) e = 0;
else {
Jr();
e = t[2248] | 0
}
t[1928] = e;
_o(8996) | 0
}
return
}
function Ei(e, i, r, f, u) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
u = u | 0;
var a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
C = 0,
I = 0;
I = e + 112 | 0;
l = t[I >> 2] | 0;
a = (l | 0) / (r | 0) | 0;
A = l - (v(a, r) | 0) | 0;
k = e + 24 | 0;
w = e + 120 | 0;
g = v(f, r) | 0;
b = v(u, r) | 0;
h = t[e + 148 >> 2] | 0;
if ((l | 0) < (b | 0)) f = Gi(w, A, a) | 0;
else f = 0;
C = e + 48 | 0;
c = a;
s = l;
a = t[C >> 2] | 0;
while (1) {
if (!((s | 0) < (b | 0) & (a | 0) == 0)) {
a = 22;
break
}
if (!(A & h)) l = Gi(w, A, c) | 0;
else l = f;
Mi(k);
f = Fi(t[l >> 2] | 0, k) | 0;
if ((f | 0) < 256) {
n[i + s >> 0] = f;
f = s + 1 | 0;
A = A + 1 | 0;
if ((A | 0) >= (r | 0)) {
a = c + 1 | 0;
if ((c | 0) < (u | 0) & (a & 15 | 0) == 0) {
Ur(e, a);
A = 0
} else A = 0
} else a = c
} else {
if ((f | 0) >= 280) {
a = 20;
break
}
a = Yi(f + -256 | 0, k) | 0;
f = Fi(t[l + 16 >> 2] | 0, k) | 0;
Mi(k);
f = Hi(r, Ui(f, k) | 0) | 0;
if ((g - s | 0) < (a | 0) | (s | 0) < (f | 0)) {
a = 20;
break
}
Hr(i + s | 0, f, a);
o = a + A | 0;
while (1) {
if ((o | 0) < (r | 0)) break;
f = c + 1 | 0;
if ((c | 0) < (u | 0) & (f & 15 | 0) == 0) Ur(e, f);
c = f;
o = o - r | 0
}
f = a + s | 0;
if ((f | 0) >= (b | 0) | (o & h | 0) == 0) {
a = c;
A = o
} else {
a = c;
A = o;
l = Gi(w, o, c) | 0
}
}
o = xi(k) | 0;
t[C >> 2] = o;
c = a;
s = f;
f = l;
a = o
}
if ((a | 0) == 20) {
f = xi(k) | 0;
t[C >> 2] = f;
a = 23
} else if ((a | 0) == 22) {
Ur(e, (c | 0) > (u | 0) ? u : c);
f = xi(k) | 0;
t[C >> 2] = f;
if ((g | 0) > (s | 0) & (f | 0) != 0) a = 23;
else {
t[I >> 2] = s;
f = 1
}
}
if ((a | 0) == 23) {
t[e >> 2] = (f | 0) == 0 ? 3 : 5;
f = 0
}
return f | 0
}
function _i(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0;
A = e + 108 | 0;
f = t[A >> 2] | 0;
l = e + 100 | 0;
u = e + 8 | 0;
a = e + 20 | 0;
r = f;
n = i - f | 0;
f = (t[e + 16 >> 2] | 0) + ((v(t[l >> 2] | 0, f) | 0) << 2) | 0;
while (1) {
if ((n | 0) <= 0) break;
o = (n | 0) < 16 ? n : 16;
s = t[u >> 2] | 0;
h = t[s + 40 >> 2] | 0;
s = t[s >> 2] | 0;
c = v(s, o) | 0;
b = (t[h + 136 >> 2] | 0) + (v(s, r) | 0) | 0;
w = t[a >> 2] | 0;
$i(e, o, f);
nn(w, b, c);
c = o + r | 0;
Yr(h, r, c, b, s);
r = c;
n = n - o | 0;
f = f + ((v(t[l >> 2] | 0, o) | 0) << 2) | 0
}
t[e + 116 >> 2] = i;
t[A >> 2] = i;
return
}
function Ri(e, i, r, n, f, u) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
u = u | 0;
var a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
C = 0,
I = 0,
d = 0,
m = 0,
p = 0,
y = 0,
P = 0,
D = 0,
B = 0,
E = 0,
_ = 0,
R = 0;
R = e + 112 | 0;
C = t[R >> 2] | 0;
a = (C | 0) / (r | 0) | 0;
A = C - (v(a, r) | 0) | 0;
D = e + 24 | 0;
B = e + 120 | 0;
l = i + (C << 2) | 0;
E = i + ((v(n, r) | 0) << 2) | 0;
I = v(f, r) | 0;
d = i + (I << 2) | 0;
p = t[B >> 2] | 0;
m = p + 280 | 0;
_ = e + 56 | 0;
o = (t[_ >> 2] | 0) == 0 ? 16777216 : a;
p = (p | 0) > 0;
y = p ? e + 124 | 0 : 0;
P = t[e + 148 >> 2] | 0;
if ((C | 0) < (I | 0)) n = Gi(B, A, a) | 0;
else n = 0;
C = (u | 0) != 0;
I = E;
c = l;
k = l;
e: while (1) {
w = a;
h = c;
a = o;
while (1) {
if (h >>> 0 >= d >>> 0) {
s = 53;
break e
}
if ((w | 0) < (a | 0)) g = a;
else {
Ti(e, h - i >> 2);
g = w + 8 | 0
}
if (!(A & P)) n = Gi(B, A, w) | 0;
if (t[n + 28 >> 2] | 0) {
s = 11;
break
}
Mi(D);
if (t[n + 32 >> 2] | 0) {
a = Si(n, D, h) | 0;
if (xi(D) | 0) {
s = 53;
break e
}
if (!a) {
s = 22;
break
}
} else a = Fi(t[n >> 2] | 0, D) | 0;
if (xi(D) | 0) {
s = 53;
break e
}
if ((a | 0) < 256) {
s = 18;
break
}
if ((a | 0) >= 280) {
s = 46;
break
}
o = Yi(a + -256 | 0, D) | 0;
a = Fi(t[n + 16 >> 2] | 0, D) | 0;
Mi(D);
a = Hi(r, Ui(a, D) | 0) | 0;
if (xi(D) | 0) {
s = 53;
break e
}
l = h;
if ((l - i >> 2 | 0) < (a | 0)) {
s = 59;
break e
}
if ((I - l >> 2 | 0) < (o | 0)) {
s = 59;
break e
}
Vi(h, a, o);
a = w;
A = o + A | 0;
while (1) {
if ((A | 0) < (r | 0)) break;
l = a + 1 | 0;
if (C & (a | 0) < (f | 0) & (l & 15 | 0) == 0) ac[u & 3](e, l);
a = l;
A = A - r | 0
}
c = h + (o << 2) | 0;
if (A & P) n = Gi(B, A, a) | 0;
if (p) {
s = 43;
break
} else {
w = a;
h = c;
a = g
}
}
do {
if ((s | 0) == 11) {
t[h >> 2] = t[n + 24 >> 2];
b = k;
a = k;
s = 23
} else if ((s | 0) == 18) {
s = k;
if (t[n + 20 >> 2] | 0) {
t[h >> 2] = t[n + 24 >> 2] | a << 8;
b = k;
a = s;
s = 23;
break
}
l = Fi(t[n + 4 >> 2] | 0, D) | 0;
Mi(D);
o = Fi(t[n + 8 >> 2] | 0, D) | 0;
c = Fi(t[n + 12 >> 2] | 0, D) | 0;
if (xi(D) | 0) {
s = 53;
break e
}
t[h >> 2] = l << 16 | a << 8 | o | c << 24;
b = k;
a = s;
s = 23
} else if ((s | 0) == 22) {
b = k;
a = k;
s = 23
} else if ((s | 0) == 43) {
s = 0;
o = ((k >>> 0 > c >>> 0 ? k : c) + 3 + (0 - k) | 0) >>> 2;
l = k;
while (1) {
if (l >>> 0 >= c >>> 0) break;
Qi(y, t[l >> 2] | 0);
l = l + 4 | 0
}
l = k + (o << 2) | 0
} else if ((s | 0) == 46) {
if ((a | 0) >= (m | 0)) {
s = 59;
break e
}
o = ((k >>> 0 > h >>> 0 ? k : h) + 3 + (0 - k) | 0) >>> 2;
l = k;
while (1) {
if (l >>> 0 >= h >>> 0) break;
Qi(y, t[l >> 2] | 0);
l = l + 4 | 0
}
s = k + (o << 2) | 0;
t[h >> 2] = Wi(y, a + -280 | 0) | 0;
b = s;
a = s;
s = 23
}
} while (0);
if ((s | 0) == 23) {
o = h + 4 | 0;
A = A + 1 | 0;
if ((A | 0) >= (r | 0)) {
A = w + 1 | 0;
if (C & (w | 0) < (f | 0) & (A & 15 | 0) == 0) ac[u & 3](e, A);
if (p) {
l = ((b >>> 0 > o >>> 0 ? b : o) + 3 + (0 - a) | 0) >>> 2;
a = b;
while (1) {
if (a >>> 0 >= o >>> 0) break;
Qi(y, t[a >> 2] | 0);
a = a + 4 | 0
}
a = A;
A = 0;
c = o;
l = b + (l << 2) | 0
} else {
a = A;
A = 0;
c = o;
l = b
}
} else {
a = w;
c = o;
l = b
}
}
k = l;
o = g
}
do {
if ((s | 0) == 53) {
n = xi(D) | 0;
t[e + 48 >> 2] = n;
n = (n | 0) == 0;
if (h >>> 0 < E >>> 0 & ((n | (t[_ >> 2] | 0) == 0) ^ 1)) {
Zi(e);
n = 1;
break
}
if (n) {
if (u | 0) ac[u & 3](e, (w | 0) > (f | 0) ? f : w);
t[e >> 2] = 0;
t[R >> 2] = h - i >> 2;
n = 1
} else s = 59
}
} while (0);
if ((s | 0) == 59) {
t[e >> 2] = 3;
n = 0
}
return n | 0
}
function Gi(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
r = Qr(t[e + 40 >> 2] | 0, t[e + 36 >> 2] | 0, t[e + 32 >> 2] | 0, i, r) | 0;
return (t[e + 48 >> 2] | 0) + (r * 548 | 0) | 0
}
function Ti(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0;
r = e + 64 | 0;
n = e + 24 | 0;
t[r >> 2] = t[n >> 2];
t[r + 4 >> 2] = t[n + 4 >> 2];
t[r + 8 >> 2] = t[n + 8 >> 2];
t[r + 12 >> 2] = t[n + 12 >> 2];
t[r + 16 >> 2] = t[n + 16 >> 2];
t[r + 20 >> 2] = t[n + 20 >> 2];
t[r + 24 >> 2] = t[n + 24 >> 2];
t[r + 28 >> 2] = t[n + 28 >> 2];
t[e + 96 >> 2] = i;
if ((t[e + 120 >> 2] | 0) > 0) zi(e + 124 | 0, e + 136 | 0);
return
}
function Mi(e) {
e = e | 0;
if ((t[e + 20 >> 2] | 0) > 31) Lr(e);
return
}
function Si(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0;
n = (xr(i) | 0) & 63;
f = t[e + 36 + (n << 3) >> 2] | 0;
e = t[e + 36 + (n << 3) + 4 >> 2] | 0;
n = (t[i + 20 >> 2] | 0) + f | 0;
if ((f | 0) < 256) {
Fr(i, n);
t[r >> 2] = e;
e = 0
} else Fr(i, n + -256 | 0);
return e | 0
}
function xi(e) {
e = e | 0;
if (!(t[e + 24 >> 2] | 0))
if ((t[e + 16 >> 2] | 0) == (t[e + 12 >> 2] | 0)) e = (t[e + 20 >> 2] | 0) > 64 & 1;
else e = 0;
else e = 1;
return e | 0
}
function Fi(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
f = 0,
u = 0,
A = 0,
l = 0;
u = (xr(i) | 0) & 255;
f = e + (u << 2) | 0;
r = n[f >> 0] | 0;
if ((r & 255) > 8) {
A = i + 20 | 0;
Fr(i, (t[A >> 2] | 0) + 8 | 0);
l = xr(i) | 0;
r = f + ((a[e + (u << 2) + 2 >> 1] | 0) << 2) + ((l & (1 << (r & 255) + -8) + -1) << 2) | 0;
f = r;
e = A;
r = n[r >> 0] | 0
} else e = i + 20 | 0;
Fr(i, (t[e >> 2] | 0) + (r & 255) | 0);
return a[f + 2 >> 1] | 0 | 0
}
function Li(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
s = F;
F = F + 16 | 0;
a = s;
c = e + 108 | 0;
r = t[c >> 2] | 0;
n = i - r | 0;
if ((n | 0) > 0) {
A = (t[e + 16 >> 2] | 0) + ((v(t[e + 100 >> 2] | 0, r) | 0) << 2) | 0;
l = t[e + 8 >> 2] | 0;
t[a >> 2] = t[e + 20 >> 2];
o = t[l >> 2] << 2;
$i(e, n, A);
do {
if (er(l, t[c >> 2] | 0, i, a, o) | 0) {
r = t[e + 12 >> 2] | 0;
f = t[r >> 2] | 0;
if (!(ir(f) | 0)) {
r = t[a >> 2] | 0;
if (!(t[l + 92 >> 2] | 0)) r = tr(e, r, o, t[l + 12 >> 2] | 0, t[l + 16 >> 2] | 0) | 0;
else r = fr(e, r, o, t[l + 16 >> 2] | 0) | 0;
t[e + 116 >> 2] = r;
break
} else {
A = e + 116 | 0;
u = t[r + 20 >> 2] | 0;
n = (t[r + 16 >> 2] | 0) + (v(u, t[A >> 2] | 0) | 0) | 0;
r = t[a >> 2] | 0;
if (!(t[l + 92 >> 2] | 0)) r = nr(f, r, o, t[l + 12 >> 2] | 0, t[l + 16 >> 2] | 0, n, u) | 0;
else r = rr(e, r, o, t[l + 16 >> 2] | 0, n, u) | 0;
t[A >> 2] = (t[A >> 2] | 0) + r;
break
}
}
} while (0)
}
t[c >> 2] = i;
F = s;
return
}
function Qi(e, i) {
e = e | 0;
i = i | 0;
var r = 0;
r = Ni(i, t[e + 4 >> 2] | 0) | 0;
t[(t[e >> 2] | 0) + (r << 2) >> 2] = i;
return
}
function Yi(e, i) {
e = e | 0;
i = i | 0;
return Ui(e, i) | 0
}
function Ui(e, i) {
e = e | 0;
i = i | 0;
var r = 0;
r = e + -2 >> 1;
if ((e | 0) >= 4) e = (Ji(i, r) | 0) + ((e & 1 | 2) << r) | 0;
return e + 1 | 0
}
function Hi(e, i) {
e = e | 0;
i = i | 0;
if ((i | 0) > 120) e = i + -120 | 0;
else {
i = u[3632 + (i + -1) >> 0] | 0;
e = (v(i >>> 4, e) | 0) + (8 - (i & 15)) | 0;
e = (e | 0) > 1 ? e : 1
}
return e | 0
}
function Vi(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0;
u = e + (0 - i << 2) | 0;
if ((i | 0) < 3 & (r | 0) > 3 ? (e & 3 | 0) == 0 : 0) {
if ((i | 0) == 1) {
n = t[u >> 2] | 0;
i = n
} else {
n = u;
i = t[n >> 2] | 0;
n = t[n + 4 >> 2] | 0
}
Oi(u, e, r, i, n)
} else f = 7;
e: do {
if ((f | 0) == 7) {
if ((i | 0) >= (r | 0)) {
Po(e | 0, u | 0, r << 2 | 0) | 0;
break
}
i = 0;
while (1) {
if ((i | 0) >= (r | 0)) break e;
t[e + (i << 2) >> 2] = t[u + (i << 2) >> 2];
i = i + 1 | 0
}
}
} while (0);
return
}
function Wi(e, i) {
e = e | 0;
i = i | 0;
return t[(t[e >> 2] | 0) + (i << 2) >> 2] | 0
}
function Zi(e) {
e = e | 0;
var i = 0,
r = 0;
t[e >> 2] = 5;
i = e + 24 | 0;
r = e + 64 | 0;
t[i >> 2] = t[r >> 2];
t[i + 4 >> 2] = t[r + 4 >> 2];
t[i + 8 >> 2] = t[r + 8 >> 2];
t[i + 12 >> 2] = t[r + 12 >> 2];
t[i + 16 >> 2] = t[r + 16 >> 2];
t[i + 20 >> 2] = t[r + 20 >> 2];
t[i + 24 >> 2] = t[r + 24 >> 2];
t[i + 28 >> 2] = t[r + 28 >> 2];
t[e + 112 >> 2] = t[e + 96 >> 2];
if ((t[e + 120 >> 2] | 0) > 0) zi(e + 136 | 0, e + 124 | 0);
return
}
function zi(e, i) {
e = e | 0;
i = i | 0;
Po(t[i >> 2] | 0, t[e >> 2] | 0, 4 << t[i + 8 >> 2] | 0) | 0;
return
}
function Oi(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var u = 0,
a = 0,
A = 0;
if (!(i & 4)) {
a = r;
u = n;
n = f
} else {
t[i >> 2] = t[e >> 2];
a = r + -1 | 0;
i = i + 4 | 0;
e = e + 4 | 0;
u = f
}
f = a >> 1;
r = 0;
while (1) {
if ((r | 0) >= (f | 0)) break;
A = i + (r << 3) | 0;
t[A >> 2] = u;
t[A + 4 >> 2] = n;
r = r + 1 | 0
}
r = r << 1;
if (a & 1 | 0) t[i + (r << 2) >> 2] = t[e + (r << 2) >> 2];
return
}
function Ji(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0;
if ((i | 0) < 25 & (t[e + 24 >> 2] | 0) == 0) {
r = ji(e) | 0;
r = t[3760 + (i << 2) >> 2] & r;
n = e + 20 | 0;
t[n >> 2] = (t[n >> 2] | 0) + i;
qi(e);
e = r
} else {
Ki(e);
e = 0
}
return e | 0
}
function ji(e) {
e = e | 0;
var i = 0;
i = e;
e = mo(t[i >> 2] | 0, t[i + 4 >> 2] | 0, t[e + 20 >> 2] & 63 | 0) | 0;
m() | 0;
return e | 0
}
function qi(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0,
f = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
i = e + 16 | 0;
r = e + 20 | 0;
n = e + 12 | 0;
f = e + 8 | 0;
a = t[r >> 2] | 0;
while (1) {
if ((a | 0) <= 7) break;
A = t[i >> 2] | 0;
if (A >>> 0 >= (t[n >> 2] | 0) >>> 0) break;
c = e;
c = mo(t[c >> 2] | 0, t[c + 4 >> 2] | 0, 8) | 0;
o = m() | 0;
s = e;
t[s >> 2] = c;
t[s + 4 >> 2] = o;
s = po(u[(t[f >> 2] | 0) + A >> 0] | 0 | 0, 0, 56) | 0;
o = m() | 0 | o;
l = e;
t[l >> 2] = s | c;
t[l + 4 >> 2] = o;
t[i >> 2] = A + 1;
A = a + -8 | 0;
t[r >> 2] = A;
a = A
}
if (Xi(e) | 0) Ki(e);
return
}
function Ki(e) {
e = e | 0;
t[e + 24 >> 2] = 1;
t[e + 20 >> 2] = 0;
return
}
function Xi(e) {
e = e | 0;
if (!(t[e + 24 >> 2] | 0))
if ((t[e + 16 >> 2] | 0) == (t[e + 12 >> 2] | 0)) e = (t[e + 20 >> 2] | 0) > 64 & 1;
else e = 0;
else e = 1;
return e | 0
}
function Ni(e, i) {
e = e | 0;
i = i | 0;
return (v(e, 506832829) | 0) >>> i | 0
}
function $i(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0;
a = t[e + 100 >> 2] | 0;
A = t[e + 108 >> 2] | 0;
l = A + i | 0;
u = t[e + 20 >> 2] | 0;
f = t[e + 176 >> 2] | 0;
while (1) {
n = f + -1 | 0;
if ((f | 0) <= 0) break;
mr(e + 180 + (n * 20 | 0) | 0, A, l, r, u);
f = n;
r = u
}
if ((r | 0) != (u | 0)) Po(u | 0, r | 0, v(i << 2, a) | 0) | 0;
return
}
function er(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var u = 0;
u = t[e + 88 >> 2] | 0;
u = (u | 0) < (r | 0) ? u : r;
r = t[e + 84 >> 2] | 0;
if ((r | 0) > (i | 0)) {
i = v(r - i | 0, f) | 0;
t[n >> 2] = (t[n >> 2] | 0) + i;
i = r
}
if ((u | 0) > (i | 0)) {
f = t[e + 76 >> 2] | 0;
t[n >> 2] = (t[n >> 2] | 0) + (f << 2);
t[e + 8 >> 2] = i - r;
t[e + 12 >> 2] = (t[e + 80 >> 2] | 0) - f;
t[e + 16 >> 2] = u - i;
i = 1
} else i = 0;
return i | 0
}
function ir(e) {
e = e | 0;
return e >>> 0 < 11 | 0
}
function rr(e, i, r, n, f, u) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
u = u | 0;
var a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0;
l = t[t[e + 12 >> 2] >> 2] | 0;
A = e + 268 | 0;
e = 0;
a = 0;
while (1) {
if ((e | 0) >= (n | 0)) break;
c = i + (v(e, r) | 0) | 0;
o = f + (v(a, u) | 0) | 0;
s = n - e | 0;
b = ar(t[A >> 2] | 0, s) | 0;
Ar(c, r, t[(t[A >> 2] | 0) + 44 >> 2] | 0, b, 0);
c = (lr(t[A >> 2] | 0, s, c, r) | 0) + e | 0;
e = c;
a = (dr(t[A >> 2] | 0, l, u, o) | 0) + a | 0
}
return a | 0
}
function nr(e, i, r, n, f, t, u) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
u = u | 0;
var a = 0;
a = f;
while (1) {
if ((a | 0) <= 0) break;
gr(i, n, e, t);
t = t + u | 0;
a = a + -1 | 0;
i = i + r | 0
}
return f | 0
}
function fr(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0,
a = 0,
A = 0,
l = 0;
a = e + 268 | 0;
f = 0;
u = t[e + 116 >> 2] | 0;
while (1) {
if ((f | 0) >= (n | 0)) break;
A = n - f | 0;
l = ar(t[a >> 2] | 0, A) | 0;
Ar(i, r, t[(t[a >> 2] | 0) + 44 >> 2] | 0, l, 0);
A = (lr(t[a >> 2] | 0, A, i, r) | 0) + f | 0;
l = i + (v(l, r) | 0) | 0;
i = l;
f = A;
u = (or(e, u) | 0) + u | 0
}
return u | 0
}
function tr(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var u = 0,
a = 0;
a = e + 12 | 0;
u = t[e + 116 >> 2] | 0;
e = f;
while (1) {
if ((e | 0) <= 0) break;
ur(i, n, u, t[a >> 2] | 0);
u = u + 1 | 0;
e = e + -1 | 0;
i = i + r | 0
}
return u | 0
}
function ur(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0;
XA(e, (t[n + 16 >> 2] | 0) + (v(t[n + 32 >> 2] | 0, r) | 0) | 0, i);
f = r >> 1;
u = (t[n + 20 >> 2] | 0) + (v(t[n + 36 >> 2] | 0, f) | 0) | 0;
NA(e, u, (t[n + 24 >> 2] | 0) + (v(t[n + 40 >> 2] | 0, f) | 0) | 0, i, r & 1 ^ 1);
f = t[n + 28 >> 2] | 0;
if (f | 0) rn(e + 3 | 0, 0, i, 1, f + (v(t[n + 44 >> 2] | 0, r) | 0) | 0, 0) | 0;
return
}
function ar(e, i) {
e = e | 0;
i = i | 0;
var r = 0;
r = t[e + 32 >> 2] | 0;
e = ((t[e + 24 >> 2] | 0) + -1 + r | 0) / (r | 0) | 0;
return ((e | 0) > (i | 0) ? i : e) | 0
}
function Ar(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var t = 0;
t = 0;
while (1) {
if ((t | 0) >= (n | 0)) break;
jr(e, r, f);
t = t + 1 | 0;
e = e + i | 0
}
return
}
function lr(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0;
l = e + 4 | 0;
o = e + 76 | 0;
c = e + 80 | 0;
s = e + 8 | 0;
b = e + 52 | 0;
h = e + 60 | 0;
a = e + 32 | 0;
A = e + 24 | 0;
u = 0;
while (1) {
if ((u | 0) >= (i | 0)) break;
if (hr(e) | 0) break;
if (t[l >> 2] | 0) {
f = t[o >> 2] | 0;
t[o >> 2] = t[c >> 2];
t[c >> 2] = f
}
wr(e, r);
e: do {
if (!(t[l >> 2] | 0)) {
f = 0;
while (1) {
if ((f | 0) >= (v(t[b >> 2] | 0, t[s >> 2] | 0) | 0)) break e;
w = (t[o >> 2] | 0) + (f << 2) | 0;
t[w >> 2] = (t[w >> 2] | 0) + (t[(t[c >> 2] | 0) + (f << 2) >> 2] | 0);
f = f + 1 | 0
}
}
} while (0);
t[h >> 2] = (t[h >> 2] | 0) + 1;
t[A >> 2] = (t[A >> 2] | 0) - (t[a >> 2] | 0);
r = r + n | 0;
u = u + 1 | 0
}
return u | 0
}
function or(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0;
f = t[e + 268 >> 2] | 0;
u = t[f + 68 >> 2] | 0;
a = t[f + 52 >> 2] | 0;
n = e + 12 | 0;
r = 0;
e = i;
while (1) {
if (!(cr(f) | 0)) break;
sr(f);
jr(u, a, 1);
ur(u, a, e, t[n >> 2] | 0);
r = r + 1 | 0;
e = e + 1 | 0
}
return r | 0
}
function cr(e) {
e = e | 0;
if (!(br(e) | 0)) e = (t[e + 24 >> 2] | 0) < 1 & 1;
else e = 0;
return e | 0
}
function sr(e) {
e = e | 0;
var i = 0,
r = 0,
f = 0,
u = 0,
a = 0,
A = 0;
r = e + 24 | 0;
if ((t[r >> 2] | 0) < 1) {
e: do {
if (!(t[e + 4 >> 2] | 0)) {
if (t[e + 20 >> 2] | 0) {
Et(e);
break
}
f = e + 8 | 0;
u = e + 52 | 0;
a = e + 76 | 0;
A = e + 68 | 0;
i = 0;
while (1) {
if ((i | 0) >= (v(t[u >> 2] | 0, t[f >> 2] | 0) | 0)) break e;
n[(t[A >> 2] | 0) + i >> 0] = t[(t[a >> 2] | 0) + (i << 2) >> 2];
t[(t[a >> 2] | 0) + (i << 2) >> 2] = 0;
i = i + 1 | 0
}
} else Bt(e)
} while (0);t[r >> 2] = (t[r >> 2] | 0) + (t[e + 28 >> 2] | 0);A = e + 68 | 0;t[A >> 2] = (t[A >> 2] | 0) + (t[e + 72 >> 2] | 0);A = e + 64 | 0;t[A >> 2] = (t[A >> 2] | 0) + 1
}
return
}
function br(e) {
e = e | 0;
return (t[e + 64 >> 2] | 0) >= (t[e + 56 >> 2] | 0) | 0
}
function hr(e) {
e = e | 0;
if (!(kr(e) | 0)) e = (t[e + 24 >> 2] | 0) < 1 & 1;
else e = 0;
return e | 0
}
function wr(e, i) {
e = e | 0;
i = i | 0;
if (!(t[e >> 2] | 0)) Rt(e, i);
else _t(e, i);
return
}
function kr(e) {
e = e | 0;
return (t[e + 64 >> 2] | 0) >= (t[e + 56 >> 2] | 0) | 0
}
function gr(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
do {
switch (r | 0) {
case 0: {
kf(e, i, n);
break
}
case 1: {
wf(e, i, n);
break
}
case 7: {
wf(e, i, n);
Nr(n, 0, i, 1, 0);
break
}
case 2: {
gf(e, i, n);
break
}
case 3: {
vr(e, i, n, 1);
break
}
case 8: {
vr(e, i, n, 1);
Nr(n, 0, i, 1, 0);
break
}
case 4: {
vr(e, i, n, 0);
break
}
case 9: {
vr(e, i, n, 0);
Nr(n, 1, i, 1, 0);
break
}
case 5: {
vf(e, i, n);
break
}
case 10: {
vf(e, i, n);
Kr(n, i, 1, 0);
break
}
case 6: {
Cf(e, i, n);
break
}
default: {}
}
} while (0);
return
}
function vr(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
e: do {
if (!n) {
i = e + (i << 2) | 0;
while (1) {
if (e >>> 0 >= i >>> 0) break e;
Ir(r, Cr(t[e >> 2] | 0) | 0);
e = e + 4 | 0;
r = r + 4 | 0
}
} else Po(r | 0, e | 0, i << 2 | 0) | 0
} while (0);
return
}
function Cr(e) {
e = e | 0;
return yo(e | 0) | 0
}
function Ir(e, i) {
e = e | 0;
i = i | 0;
n[e >> 0] = i;
n[e + 1 >> 0] = i >> 8;
n[e + 2 >> 0] = i >> 16;
n[e + 3 >> 0] = i >> 24;
return
}
function dr(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0,
a = 0,
A = 0;
u = t[e + 68 >> 2] | 0;
a = t[e + 52 >> 2] | 0;
f = 0;
while (1) {
if (!(cr(e) | 0)) break;
A = n + (v(f, r) | 0) | 0;
sr(e);
jr(u, a, 1);
gr(u, a, i, A);
f = f + 1 | 0
}
return f | 0
}
function mr(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var u = 0,
a = 0,
A = 0;
a = t[e + 8 >> 2] | 0;
e: do {
switch (t[e >> 2] | 0) {
case 2: {
bf(n, v(a, r - i | 0) | 0, f);
break
}
case 0: {
pr(e, i, r, n, f);
if ((t[e + 12 >> 2] | 0) != (r | 0)) Po(f + (0 - a << 2) | 0, f + ((v(a, ~i + r | 0) | 0) << 2) | 0, a << 2 | 0) | 0;
break
}
case 1: {
yr(e, i, r, n, f);
break
}
case 3: {
if ((n | 0) == (f | 0) ? (u = t[e + 4 >> 2] | 0, (u | 0) > 0) : 0) {
f = r - i | 0;
A = v(a, f) | 0;
f = v(Pr(a, u) | 0, f) | 0;
a = n + (A << 2) + (0 - f << 2) | 0;
Do(a | 0, n | 0, f << 2 | 0) | 0;
Dr(e, i, r, a, n);
break e
}
Dr(e, i, r, n, f);
break
}
default: {}
}
} while (0);
return
}
function pr(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0;
b = t[e + 8 >> 2] | 0;
if (!i) {
Rr(n, 0, 1, f);
Gr(n + 4 | 0, 0, b + -1 | 0, f + 4 | 0);
i = 1;
n = n + (b << 2) | 0;
f = f + (b << 2) | 0
}
a = t[e + 4 >> 2] | 0;
A = 1 << a;
l = A + -1 | 0;
o = Pr(b, a) | 0;
c = 0 - b | 0;
s = 0 - A | 0;
a = (t[e + 16 >> 2] | 0) + ((v(i >> a, o) | 0) << 2) | 0;
while (1) {
if ((i | 0) >= (r | 0)) break;
Tr(n, f + (c << 2) | 0, 1, f);
e = 1;
u = a;
while (1) {
if ((e | 0) >= (b | 0)) break;
h = (e & s) + A | 0;
h = (h | 0) > (b | 0) ? b : h;
w = f + (e << 2) | 0;
lc[t[8544 + (((t[u >> 2] | 0) >>> 8 & 15) << 2) >> 2] & 31](n + (e << 2) | 0, w + (c << 2) | 0, h - e | 0, w);
e = h;
u = u + 4 | 0
}
w = i + 1 | 0;
a = (w & l | 0) == 0 ? a + (o << 2) | 0 : a;
i = w;
n = n + (b << 2) | 0;
f = f + (b << 2) | 0
}
return
}
function yr(e, i, r, f, u) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
u = u | 0;
var a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0;
g = F;
F = F + 16 | 0;
w = g;
k = t[e + 8 >> 2] | 0;
l = t[e + 4 >> 2] | 0;
o = 1 << l;
c = o + -1 | 0;
s = k & 0 - o;
b = k - s | 0;
h = Pr(k, l) | 0;
l = (t[e + 16 >> 2] | 0) + ((v(i >> l, h) | 0) << 2) | 0;
while (1) {
if ((i | 0) >= (r | 0)) break;
n[w >> 0] = 0;
n[w + 1 >> 0] = 0;
n[w + 2 >> 0] = 0;
A = f + (s << 2) | 0;
e = l;
a = f;
while (1) {
if (a >>> 0 >= A >>> 0) break;
_r(t[e >> 2] | 0, w);
hf(w, a, o, u);
e = e + 4 | 0;
a = a + (o << 2) | 0;
u = u + (o << 2) | 0
}
if (a >>> 0 < (f + (k << 2) | 0) >>> 0) {
_r(t[e >> 2] | 0, w);
hf(w, a, b, u);
f = a + (b << 2) | 0;
u = u + (b << 2) | 0
} else f = a;
A = i + 1 | 0;
l = (A & c | 0) == 0 ? l + (h << 2) | 0 : l;
i = A
}
F = g;
return
}
function Pr(e, i) {
e = e | 0;
i = i | 0;
return (e + -1 + (1 << i) | 0) >>> i | 0
}
function Dr(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0;
u = t[e + 4 >> 2] | 0;
o = 8 >>> u;
c = t[e + 8 >> 2] | 0;
l = t[e + 16 >> 2] | 0;
e: do {
if ((o | 0) < 8) {
a = (1 << u) + -1 | 0;
A = (1 << o) + -1 | 0;
while (1) {
if ((i | 0) >= (r | 0)) break e;
u = 0;
e = 0;
while (1) {
if ((u | 0) >= (c | 0)) break;
if (!(u & a)) {
e = Br(t[n >> 2] | 0) | 0;
n = n + 4 | 0
}
t[f >> 2] = Er(t[l + ((e & A) << 2) >> 2] | 0) | 0;
u = u + 1 | 0;
e = e >>> o;
f = f + 4 | 0
}
i = i + 1 | 0
}
} else If(n, l, f, i, r, c)
} while (0);
return
}
function Br(e) {
e = e | 0;
return e >>> 8 & 255 | 0
}
function Er(e) {
e = e | 0;
return e | 0
}
function _r(e, i) {
e = e | 0;
i = i | 0;
n[i >> 0] = e;
n[i + 1 >> 0] = e >>> 8;
n[i + 2 >> 0] = e >>> 16;
return
}
function Rr(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
i = 0;
while (1) {
if ((i | 0) >= (r | 0)) break;
t[n + (i << 2) >> 2] = Sr(t[e + (i << 2) >> 2] | 0, -16777216) | 0;
i = i + 1 | 0
}
return
}
function Gr(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0;
i = t[n + -4 >> 2] | 0;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break;
u = Sr(t[e + (f << 2) >> 2] | 0, i) | 0;
t[n + (f << 2) >> 2] = u;
i = u;
f = f + 1 | 0
}
return
}
function Tr(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break;
u = Mr(t[n + (f + -1 << 2) >> 2] | 0, i + (f << 2) | 0) | 0;
t[n + (f << 2) >> 2] = Sr(t[e + (f << 2) >> 2] | 0, u) | 0;
f = f + 1 | 0
}
return
}
function Mr(e, i) {
e = e | 0;
i = i | 0;
return t[i >> 2] | 0
}
function Sr(e, i) {
e = e | 0;
i = i | 0;
return (i & -16711936) + (e & -16711936) & -16711936 | (i & 16711935) + (e & 16711935) & 16711935 | 0
}
function xr(e) {
e = e | 0;
var i = 0;
i = e;
e = mo(t[i >> 2] | 0, t[i + 4 >> 2] | 0, t[e + 20 >> 2] & 63 | 0) | 0;
m() | 0;
return e | 0
}
function Fr(e, i) {
e = e | 0;
i = i | 0;
t[e + 20 >> 2] = i;
return
}
function Lr(e) {
e = e | 0;
qi(e);
return
}
function Qr(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
if (!r) e = 0;
else e = t[e + ((v(f >> r, i) | 0) + (n >> r) << 2) >> 2] | 0;
return e | 0
}
function Yr(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var u = 0,
a = 0,
A = 0;
A = e + 12 | 0;
if (t[A >> 2] | 0) {
a = e + 140 | 0;
u = t[a >> 2] | 0;
e = n;
while (1) {
if ((i | 0) >= (r | 0)) break;
lc[t[8528 + (t[A >> 2] << 2) >> 2] & 31](u, e, e, f);
n = e;
i = i + 1 | 0;
e = e + f | 0;
u = n
}
t[a >> 2] = u
}
return
}
function Ur(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0;
n = t[e + 8 >> 2] | 0;
f = t[n + 40 >> 2] | 0;
u = e + 108 | 0;
a = t[((t[f + 12 >> 2] | 0) >>> 0 < 2 ? n + 84 | 0 : u) >> 2] | 0;
r = t[u >> 2] | 0;
r = (r | 0) < (a | 0) ? a : r;
if ((r | 0) < (i | 0)) {
a = t[n >> 2] | 0;
n = (t[f + 136 >> 2] | 0) + (v(a, r) | 0) | 0;
Zr(e + 180 | 0, r, i, (t[e + 16 >> 2] | 0) + (v(t[e + 100 >> 2] | 0, r) | 0) | 0, n);
Yr(f, r, i, n, a)
}
t[e + 116 >> 2] = i;
t[u >> 2] = i;
return
}
function Hr(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0,
t = 0;
t = e + (0 - i) | 0;
e: do {
if ((r | 0) > 7) {
switch (i | 0) {
case 1: {
i = v(u[t >> 0] | 0, 16843009) | 0;
break
}
case 2: {
i = ((u[t >> 0] | u[t + 1 >> 0] << 8) & 65535) * 65537 | 0;
break
}
case 4: {
i = u[t >> 0] | u[t + 1 >> 0] << 8 | u[t + 2 >> 0] << 16 | u[t + 3 >> 0] << 24;
break
}
default: {
f = 7;
break e
}
}
Vr(t, e, r, i)
} else f = 7
} while (0);
e: do {
if ((f | 0) == 7) {
if ((i | 0) >= (r | 0)) {
Po(e | 0, t | 0, r | 0) | 0;
break
}
i = 0;
while (1) {
if ((i | 0) >= (r | 0)) break e;
n[e + i >> 0] = n[t + i >> 0] | 0;
i = i + 1 | 0
}
}
} while (0);
return
}
function Vr(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
var u = 0,
a = 0;
a = i;
while (1) {
if (!(a & 3)) break;
n[a >> 0] = n[e >> 0] | 0;
f = Wr(f) | 0;
r = r + -1 | 0;
a = a + 1 | 0;
e = e + 1 | 0
}
u = r >> 2;
i = 0;
while (1) {
if ((i | 0) >= (u | 0)) break;
t[a + (i << 2) >> 2] = f;
i = i + 1 | 0
}
f = i << 2;
while (1) {
if ((f | 0) >= (r | 0)) break;
n[a + f >> 0] = n[e + f >> 0] | 0;
f = f + 1 | 0
}
return
}
function Wr(e) {
e = e | 0;
return e << 24 | e >>> 8 | 0
}
function Zr(e, i, r, f, u) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
u = u | 0;
var a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
a = t[e + 4 >> 2] | 0;
c = 8 >>> a;
s = t[e + 8 >> 2] | 0;
o = t[e + 16 >> 2] | 0;
e: do {
if ((c | 0) < 8) {
A = (1 << a) + -1 | 0;
l = (1 << c) + -1 | 0;
while (1) {
if ((i | 0) >= (r | 0)) break e;
a = 0;
e = 0;
while (1) {
if ((a | 0) >= (s | 0)) break;
if (!(a & A)) {
e = (zr(n[f >> 0] | 0) | 0) & 255;
f = f + 1 | 0
}
n[u >> 0] = Or(t[o + ((e & l) << 2) >> 2] | 0) | 0;
a = a + 1 | 0;
e = e >>> c;
u = u + 1 | 0
}
i = i + 1 | 0
}
} else df(f, o, u, i, r, s)
} while (0);
return
}
function zr(e) {
e = e | 0;
return e | 0
}
function Or(e) {
e = e | 0;
return e >>> 8 & 255 | 0
}
function Jr() {
var e = 0,
i = 0,
r = 0,
n = 0,
f = 0;
e = F;
F = F + 16 | 0;
i = e + 12 | 0;
t[i >> 2] = 0;
r = e + 8 | 0;
t[r >> 2] = 0;
f = e + 4 | 0;
t[f >> 2] = 0;
n = e;
t[n >> 2] = 0;
t[f >> 2] = 1;
t[n >> 2] = 2;
t[r >> 2] = 1;
t[i >> 2] = 2;
F = e;
return
}
function jr(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0,
a = 0,
A = 0;
f = 0;
while (1) {
if ((f | 0) >= (i | 0)) break;
u = e + (f << 2) | 0;
n = t[u >> 2] | 0;
if (n >>> 0 < 4278190080) {
if (n >>> 0 < 16777216) n = 0;
else {
a = cn(n >>> 24, r) | 0;
A = sn(n & 255, a) | 0 | n & -16777216;
A = A | (sn(n >>> 8 & 255, a) | 0) << 8;
n = A | (sn(n >>> 16 & 255, a) | 0) << 16
}
t[u >> 2] = n
}
f = f + 1 | 0
}
return
}
function qr(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
var t = 0,
u = 0,
a = 0;
t = 0;
while (1) {
if ((t | 0) >= (r | 0)) break;
u = n[i + t >> 0] | 0;
switch (u << 24 >> 24) {
case -1:
break;
case 0: {
n[e + t >> 0] = 0;
break
}
default: {
a = cn(u & 255, f) | 0;
u = e + t | 0;
n[u >> 0] = sn(n[u >> 0] | 0, a) | 0
}
}
t = t + 1 | 0
}
return
}
function Kr(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
an(e, i, r, n);
return
}
function Xr(e, i, r, n, f, a) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
a = a | 0;
var A = 0,
l = 0;
A = 0;
l = 0;
while (1) {
if ((l | 0) >= (n | 0)) break;
t[a + (l << 2) >> 2] = un(u[e + A >> 0] | 0, u[i + A >> 0] | 0, u[r + A >> 0] | 0) | 0;
A = A + f | 0;
l = l + 1 | 0
}
return
}
function Nr(e, i, r, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
t = t | 0;
var a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0;
s = (i | 0) != 0;
c = s & 1;
s = s ? 0 : 3;
i = f;
while (1) {
o = i + -1 | 0;
if ((i | 0) <= 0) break;
f = e + c | 0;
a = e + s | 0;
i = 0;
while (1) {
if ((i | 0) >= (r | 0)) break;
A = i << 2;
l = n[a + A >> 0] | 0;
if (l << 24 >> 24 != -1) {
b = (l & 255) * 32897 | 0;
l = f + A | 0;
n[l >> 0] = (v(b, u[l >> 0] | 0) | 0) >>> 23;
l = f + (A | 1) | 0;
n[l >> 0] = (v(b, u[l >> 0] | 0) | 0) >>> 23;
l = f + (A | 2) | 0;
n[l >> 0] = (v(b, u[l >> 0] | 0) | 0) >>> 23
}
i = i + 1 | 0
}
e = e + t | 0;
i = o
}
return
}
function $r(e, i, r, f, t, u) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
t = t | 0;
u = u | 0;
var a = 0,
A = 0,
l = 0,
o = 0;
l = 0;
a = 255;
while (1) {
if ((l | 0) >= (f | 0)) break;
A = 0;
while (1) {
if ((A | 0) >= (r | 0)) break;
o = n[e + A >> 0] | 0;
n[t + (A << 2) >> 0] = o;
A = A + 1 | 0;
a = a & (o & 255)
}
e = e + i | 0;
l = l + 1 | 0;
t = t + u | 0
}
return (a | 0) != 255 | 0
}
function en(e, i, r, n, f, a) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
a = a | 0;
var A = 0,
l = 0;
l = 0;
while (1) {
if ((l | 0) >= (n | 0)) break;
A = 0;
while (1) {
if ((A | 0) >= (r | 0)) break;
t[f + (A << 2) >> 2] = (u[e + A >> 0] | 0) << 8;
A = A + 1 | 0
}
l = l + 1 | 0;
e = e + i | 0;
f = f + (a << 2) | 0
}
return
}
function rn(e, i, r, f, t, u) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
t = t | 0;
u = u | 0;
var a = 0,
A = 0,
l = 0,
o = 0;
l = 0;
a = -1;
while (1) {
if ((l | 0) >= (f | 0)) break;
A = 0;
while (1) {
if ((A | 0) >= (r | 0)) break;
o = n[e + (A << 2) >> 0] | 0;
n[t + A >> 0] = o;
A = A + 1 | 0;
a = o & a
}
e = e + i | 0;
l = l + 1 | 0;
t = t + u | 0
}
return a << 24 >> 24 == -1 | 0
}
function nn(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break;
n[i + f >> 0] = (t[e + (f << 2) >> 2] | 0) >>> 8;
f = f + 1 | 0
}
return
}
function fn(e, i) {
e = e | 0;
i = i | 0;
while (1) {
if ((i | 0) <= 0) {
e = 0;
break
}
if ((n[e >> 0] | 0) == -1) {
i = i + -1 | 0;
e = e + 1 | 0
} else {
e = 1;
break
}
}
return e | 0
}
function tn(e, i) {
e = e | 0;
i = i | 0;
var r = 0;
r = 0;
while (1) {
if ((i | 0) <= 0) {
i = 0;
break
}
if ((n[e + r >> 0] | 0) == -1) {
r = r + 4 | 0;
i = i + -1 | 0
} else {
i = 1;
break
}
}
return i | 0
}
function un(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
return e << 16 | i << 8 | r | -16777216 | 0
}
function an(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
var t = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
while (1) {
t = r + -1 | 0;
if ((r | 0) <= 0) break;
r = 0;
while (1) {
if ((r | 0) >= (i | 0)) break;
u = r << 1;
l = e + u | 0;
c = n[l >> 0] | 0;
u = e + (u | 1) | 0;
s = n[u >> 0] | 0;
a = s & 15;
A = (a & 255) * 4369 | 0;
o = ln(An(c) | 0, A) | 0;
c = ln(on(c) | 0, A) | 0;
A = ln(An(s) | 0, A) | 0;
n[l >> 0] = (c & 255) >>> 4 | o & -16 & 255;
n[u >> 0] = A & -16 | a;
r = r + 1 | 0
}
e = e + f | 0;
r = t
}
return
}
function An(e) {
e = e | 0;
e = e & 255;
return (e & 240 | e >>> 4) & 255 | 0
}
function ln(e, i) {
e = e | 0;
i = i | 0;
return (v(e & 255, i) | 0) >>> 16 & 255 | 0
}
function on(e) {
e = e | 0;
e = e & 255;
return (e & 15 | e << 4) & 255 | 0
}
function cn(e, i) {
e = e | 0;
i = i | 0;
if (!i) e = e * 65793 | 0;
else e = 4278190080 / (e >>> 0) | 0;
return e | 0
}
function sn(e, i) {
e = e | 0;
i = i | 0;
return ((v(e & 255, i) | 0) + 8388608 | 0) >>> 24 | 0
}
function bn() {
var e = 0;
if (!(Eo(9164) | 0)) {
if (!(t[1934] | 0)) e = 0;
else {
ku();
e = t[2248] | 0
}
t[1934] = e;
_o(9164) | 0
}
return
}
function hn(e) {
e = e | 0;
wu(e, 520) | 0;
return
}
function wn(e, i) {
e = e | 0;
i = i | 0;
t[i + 44 >> 2] = 7;
t[i + 48 >> 2] = 8;
t[i + 52 >> 2] = 5;
t[i + 40 >> 2] = e;
return
}
function kn(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0,
a = 0,
A = 0;
n = gn() | 0;
do {
if (!n) i = 0;
else {
A = t[e >> 2] | 0;
t[n + 100 >> 2] = A;
f = e + 4 | 0;
u = t[f >> 2] | 0;
t[n + 104 >> 2] = u;
a = e + 24 | 0;
t[n + 8 >> 2] = a;
t[e + 64 >> 2] = e;
t[a >> 2] = A;
t[e + 28 >> 2] = u;
t[n >> 2] = 0;
vn(n + 24 | 0, i, r);
if (Cn(t[e >> 2] | 0, t[f >> 2] | 0, 1, n, 0) | 0) {
if (((t[n + 176 >> 2] | 0) == 1 ? (t[n + 180 >> 2] | 0) == 3 : 0) ? (In(n + 120 | 0) | 0) != 0 : 0) {
t[e + 132 >> 2] = 1;
i = dn(n) | 0
} else {
t[e + 132 >> 2] = 0;
i = mn(n, t[e >> 2] | 0) | 0
}
if (i | 0) {
t[e + 20 >> 2] = n;
i = 1;
break
}
}
ni(n);
i = 0
}
} while (0);
return i | 0
}
function gn() {
var e = 0;
e = En(1, 0, 272) | 0;
if (!e) e = 0;
else {
t[e >> 2] = 0;
t[e + 4 >> 2] = 2;
Un()
}
return e | 0
}
function vn(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
a = 0,
A = 0;
t[e + 12 >> 2] = r;
a = e;
t[a >> 2] = 0;
t[a + 4 >> 2] = 0;
t[e + 20 >> 2] = 0;
t[e + 24 >> 2] = 0;
a = r >>> 0 < 8 ? r : 8;
r = 0;
n = 0;
f = 0;
while (1) {
if (r >>> 0 >= a >>> 0) break;
A = po(u[i + r >> 0] | 0 | 0, 0, r << 3 | 0) | 0;
r = r + 1 | 0;
n = A | n;
f = m() | 0 | f
}
A = e;
t[A >> 2] = n;
t[A + 4 >> 2] = f;
t[e + 16 >> 2] = a;
t[e + 8 >> 2] = i;
return
}
function Cn(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
s = F;
F = F + 16 | 0;
A = s + 4 | 0;
u = s;
t[A >> 2] = e;
t[u >> 2] = i;
a = n + 24 | 0;
c = n + 120 | 0;
l = (r | 0) != 0;
e: do {
if (l) {
e = 1;
while (1) {
if (!e) {
o = 10;
break e
}
if (!(Ji(a, 1) | 0)) {
o = 6;
break e
}
e = pn(A, u, n) | 0
}
} else o = 6
} while (0);
do {
if ((o | 0) == 6) {
if (Ji(a, 1) | 0) {
e = Ji(a, 4) | 0;
if ((e + -1 | 0) >>> 0 >= 11) {
t[n >> 2] = 3;
e = 0;
o = 21;
break
}
} else e = 0;
u = t[A >> 2] | 0;
if (yn(n, u, i, e, r) | 0) {
if ((e | 0) > 0) {
t[c >> 2] = 1 << e;
if (!(Pn(n + 124 | 0, e) | 0)) {
t[n >> 2] = 1;
e = 0;
o = 21;
break
}
} else t[c >> 2] = 0;
Dn(n, u, i);
if (!l) {
e = wo(u | 0, ((u | 0) < 0) << 31 >> 31 | 0, i | 0, ((i | 0) < 0) << 31 >> 31 | 0) | 0;
e = mi(e, m() | 0, 4) | 0;
if (!e) {
t[n >> 2] = 1;
e = 0;
o = 21;
break
}
if (!(Ri(n, e, u, i, i, 0) | 0)) {
o = 21;
break
}
if (t[n + 48 >> 2] | 0) {
o = 21;
break
}
} else {
t[n + 4 >> 2] = 1;
e = 0
}
if (f | 0) t[f >> 2] = e;
t[n + 112 >> 2] = 0;
if (l) e = 1;
else {
ti(c);
e = 1
}
} else o = 10
}
} while (0);
if ((o | 0) == 10) {
t[n >> 2] = 3;
e = 0;
o = 21
}
if ((o | 0) == 21) {
ii(e);
ti(c);
e = 0
}
F = s;
return e | 0
}
function In(e) {
e = e | 0;
var i = 0,
r = 0,
f = 0;
e: do {
if ((t[e >> 2] | 0) > 0) e = 0;
else {
f = e + 48 | 0;
i = t[e + 44 >> 2] | 0;
e = 0;
while (1) {
if ((e | 0) >= (i | 0)) {
e = 1;
break e
}
r = t[f >> 2] | 0;
if (n[t[r + (e * 548 | 0) + 4 >> 2] >> 0] | 0) {
e = 0;
break e
}
if (n[t[r + (e * 548 | 0) + 8 >> 2] >> 0] | 0) {
e = 0;
break e
}
if (!(n[t[r + (e * 548 | 0) + 12 >> 2] >> 0] | 0)) e = e + 1 | 0;
else {
e = 0;
break
}
}
}
} while (0);
return e | 0
}
function dn(e) {
e = e | 0;
var i = 0,
r = 0;
r = t[e + 100 >> 2] | 0;
i = t[e + 104 >> 2] | 0;
r = wo(i | 0, ((i | 0) < 0) << 31 >> 31 | 0, r | 0, ((r | 0) < 0) << 31 >> 31 | 0) | 0;
i = m() | 0;
t[e + 20 >> 2] = 0;
i = mi(r, i, 1) | 0;
t[e + 16 >> 2] = i;
if (!i) {
t[e >> 2] = 1;
e = 0
} else e = 1;
return e | 0
}
function mn(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0;
f = t[e + 100 >> 2] | 0;
r = t[e + 104 >> 2] | 0;
f = wo(r | 0, ((r | 0) < 0) << 31 >> 31 | 0, f | 0, ((f | 0) < 0) << 31 >> 31 | 0) | 0;
r = m() | 0;
n = i & 65535;
i = po(i | 0, ((i | 0) < 0) << 31 >> 31 | 0, 4) | 0;
i = ko(i | 0, m() | 0, n | 0, 0) | 0;
i = ko(i | 0, m() | 0, f | 0, r | 0) | 0;
i = mi(i, m() | 0, 4) | 0;
t[e + 16 >> 2] = i;
if (!i) {
t[e >> 2] = 1;
r = 0;
i = 0
} else {
r = 1;
i = i + (f << 2) + (n << 2) | 0
}
t[e + 20 >> 2] = i;
return r | 0
}
function pn(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
A = r + 24 | 0;
l = r + 176 | 0;
c = t[l >> 2] | 0;
s = r + 180 + (c * 20 | 0) | 0;
o = Ji(A, 2) | 0;
f = r + 260 | 0;
u = t[f >> 2] | 0;
n = 1 << o;
e: do {
if (!(u & n)) {
t[f >> 2] = u | n;
t[s >> 2] = o;
a = r + 180 + (c * 20 | 0) + 8 | 0;
t[a >> 2] = t[e >> 2];
n = r + 180 + (c * 20 | 0) + 12 | 0;
t[n >> 2] = t[i >> 2];
u = r + 180 + (c * 20 | 0) + 16 | 0;
t[u >> 2] = 0;
t[l >> 2] = (t[l >> 2] | 0) + 1;
switch (o | 0) {
case 1:
case 0: {
s = (Ji(A, 3) | 0) + 2 | 0;
t[r + 180 + (c * 20 | 0) + 4 >> 2] = s;
n = Cn(Bn(t[a >> 2] | 0, s) | 0, Bn(t[n >> 2] | 0, s) | 0, 0, r, u) | 0;
break e
}
case 3:
break;
default: {
n = 1;
break e
}
}
n = (Ji(A, 8) | 0) + 1 | 0;
if ((n | 0) > 16) f = 0;
else f = (n | 0) > 4 ? 1 : (n | 0) > 2 ? 2 : 3;
t[e >> 2] = Bn(t[a >> 2] | 0, f) | 0;
t[r + 180 + (c * 20 | 0) + 4 >> 2] = f;
if (Cn(n, 1, 0, r, u) | 0) n = (Yn(n, s) | 0) != 0 & 1;
else n = 0
} else n = 0
} while (0);
return n | 0
}
function yn(e, i, r, u, A) {
e = e | 0;
i = i | 0;
r = r | 0;
u = u | 0;
A = A | 0;
var l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
C = 0,
I = 0,
d = 0,
m = 0,
p = 0,
y = 0,
P = 0,
D = 0,
B = 0,
E = 0,
_ = 0,
R = 0,
G = 0,
T = 0,
M = 0,
S = 0,
x = 0,
L = 0,
Q = 0;
L = F;
F = F + 560 | 0;
S = L + 548 | 0;
M = L;
l = e + 24 | 0;
t[S >> 2] = 0;
h = f[3872 + (u << 1) >> 1] | 0;
k = h & 65535;
do {
if ((A | 0) != 0 ? (Ji(l, 1) | 0) != 0 : 0) {
A = (Ji(l, 3) | 0) + 2 | 0;
E = Bn(i, A) | 0;
_ = Bn(r, A) | 0;
b = v(_, E) | 0;
if (Cn(E, _, 0, e, S) | 0) {
t[e + 152 >> 2] = A;
l = t[S >> 2] | 0;
A = 0;
w = 1;
while (1) {
if ((A | 0) >= (b | 0)) break;
E = l + (A << 2) | 0;
_ = (t[E >> 2] | 0) >>> 8 & 65535;
t[E >> 2] = _;
A = A + 1 | 0;
w = (_ | 0) < (w | 0) ? w : _ + 1 | 0
}
if ((w | 0) > 1e3 | (w | 0) > (v(r, i) | 0)) {
A = mi(w, ((w | 0) < 0) << 31 >> 31, 4) | 0;
if (!A) {
t[e >> 2] = 1;
c = 0;
r = 0;
o = 0;
i = 0;
l = 0;
A = 0;
break
}
Bo(A | 0, -1, w << 2 | 0) | 0;
c = t[S >> 2] | 0;
l = 0;
o = 0;
while (1) {
if ((o | 0) >= (b | 0)) break;
s = c + (o << 2) | 0;
i = A + (t[s >> 2] << 2) | 0;
r = t[i >> 2] | 0;
if ((r | 0) == -1) {
t[i >> 2] = l;
i = l + 1 | 0
} else {
i = l;
l = r
}
t[s >> 2] = l;
l = i;
o = o + 1 | 0
}
i = mi(h & 65535, 0, 4) | 0;
if (!i) {
t[e >> 2] = 1;
c = 0;
r = 0;
o = 0;
l = 0
} else {
E = A;
_ = w;
B = l;
x = 17
}
} else {
i = 0;
E = 0;
_ = w;
B = w;
A = 0;
x = 17
}
} else {
c = 0;
r = 0;
o = 0;
i = 0;
l = 0;
A = 0
}
} else {
i = 0;
E = 0;
_ = 1;
B = 1;
A = 0;
x = 17
}
} while (0);
e: do {
if ((x | 0) == 17)
if (!(t[e + 48 >> 2] | 0)) {
D = (u | 0) > 0;
P = 1 << u;
l = 0;
r = 0;
while (1) {
if ((l | 0) == 5) break;
y = (D & (l | 0) == 0 ? P : 0) + (a[7772 + (l << 1) >> 1] | 0) | 0;
l = l + 1 | 0;
r = (r | 0) < (y | 0) ? y : r
}
l = En(r, ((r | 0) < 0) << 31 >> 31, 4) | 0;
r = v(B, k) | 0;
r = mi(r, ((r | 0) < 0) << 31 >> 31, 4) | 0;
c = _n(B) | 0;
if ((r | 0) == 0 | ((l | 0) == 0 | (c | 0) == 0)) {
t[e >> 2] = 1;
o = 0;
break
}
y = (E | 0) == 0;
s = r;
p = 0;
while (1) {
if ((p | 0) >= (_ | 0)) break;
if (!y) {
o = t[E + (p << 2) >> 2] | 0;
if ((o | 0) == -1) {
I = 1;
d = M;
o = i;
m = M
} else x = 27
} else {
o = p;
x = 27
}
if ((x | 0) == 27) {
x = 0;
m = c + (o * 548 | 0) | 0;
I = 0;
d = m;
o = s
}
b = 0;
w = 1;
k = 0;
C = 0;
while (1) {
if (C >>> 0 >= 5) break;
u = a[7772 + (C << 1) >> 1] | 0;
t[m + (C << 2) >> 2] = o;
u = (D & (C | 0) == 0 ? P : 0) + u | 0;
h = Rn(u, e, l, o) | 0;
if (!h) {
o = 0;
break e
}
Q = n[o >> 0] | 0;
g = (w | 0) == 0 | (C | 4 | 0) == 4 ? w : Q << 24 >> 24 == 0 & 1;
k = k + (Q & 255) | 0;
o = o + (h << 2) | 0;
if (C >>> 0 < 4) {
h = 1;
w = t[l >> 2] | 0;
while (1) {
if ((h | 0) >= (u | 0)) break;
Q = t[l + (h << 2) >> 2] | 0;
h = h + 1 | 0;
w = (Q | 0) > (w | 0) ? Q : w
}
b = w + b | 0
}
w = g;
C = C + 1 | 0
}
s = I ? s : o;
t[m + 20 >> 2] = w;
o = m + 28 | 0;
t[o >> 2] = 0;
if (((w | 0) != 0 ? (R = (a[(t[m + 4 >> 2] | 0) + 2 >> 1] | 0) << 16 | (a[(t[m + 8 >> 2] | 0) + 2 >> 1] | 0) | (a[(t[m + 12 >> 2] | 0) + 2 >> 1] | 0) << 24, G = m + 24 | 0, t[G >> 2] = R, (k | 0) == 0) : 0) ? (T = f[(t[d >> 2] | 0) + 2 >> 1] | 0, (T & 65535) < 256) : 0) {
t[o >> 2] = 1;
t[G >> 2] = (T & 65535) << 8 | R;
t[m + 32 >> 2] = 0
} else x = 41;
if ((x | 0) == 41 ? (x = 0, Q = (b | 0) < 6, t[m + 32 >> 2] = Q & 1, Q) : 0) Gn(m);
p = p + 1 | 0
}
t[e + 160 >> 2] = t[S >> 2];
t[e + 164 >> 2] = B;
t[e + 168 >> 2] = c;
t[e + 172 >> 2] = r;
o = 1
} else {
c = 0;
r = 0;
o = 0;
l = 0
}
} while (0);
ii(l);
ii(i);
ii(A);
if (!o) {
ii(t[S >> 2] | 0);
ii(r);
ai(c)
}
F = L;
return o | 0
}
function Pn(e, i) {
e = e | 0;
i = i | 0;
var r = 0;
r = 1 << i;
r = En(r, ((r | 0) < 0) << 31 >> 31, 4) | 0;
t[e >> 2] = r;
if (!r) e = 0;
else {
t[e + 4 >> 2] = 32 - i;
t[e + 8 >> 2] = i;
e = 1
}
return e | 0
}
function Dn(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0;
n = t[e + 152 >> 2] | 0;
t[e + 100 >> 2] = i;
t[e + 104 >> 2] = r;
t[e + 156 >> 2] = Bn(i, n) | 0;
t[e + 148 >> 2] = (n | 0) == 0 ? -1 : (1 << n) + -1 | 0;
return
}
function Bn(e, i) {
e = e | 0;
i = i | 0;
return (e + -1 + (1 << i) | 0) >>> i | 0
}
function En(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
if (!(Pi(e, i, r) | 0)) e = 0;
else e = co(e, r) | 0;
return e | 0
}
function _n(e) {
e = e | 0;
return mi(e, ((e | 0) < 0) << 31 >> 31, 548) | 0
}
function Rn(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
s = F;
F = F + 80 | 0;
l = s;
o = i + 24 | 0;
A = Ji(o, 1) | 0;
Bo(r | 0, 0, e << 2 | 0) | 0;
do {
if (!A) {
a = l;
A = a + 76 | 0;
do {
t[a >> 2] = 0;
a = a + 4 | 0
} while ((a | 0) < (A | 0));
A = (Ji(o, 4) | 0) + 4 | 0;
if ((A | 0) > 19) {
t[i >> 2] = 3;
f = 0;
break
}
a = 0;
while (1) {
if ((a | 0) >= (A | 0)) break;
c = Ji(o, 3) | 0;
t[l + ((u[3904 + a >> 0] | 0) << 2) >> 2] = c;
a = a + 1 | 0
}
if (!(Mn(i, l, e, r) | 0)) c = 12;
else c = 10
} else {
c = Ji(o, 1) | 0;
l = (Ji(o, 1) | 0) == 0;
t[r + ((Ji(o, l ? 1 : 8) | 0) << 2) >> 2] = 1;
if ((c | 0) == 1) {
t[r + ((Ji(o, 8) | 0) << 2) >> 2] = 1;
c = 10
} else c = 10
}
} while (0);
if ((c | 0) == 10)
if (!((t[i + 48 >> 2] | 0) == 0 ? (f = Sn(n, 8, r, e) | 0, (f | 0) != 0) : 0)) c = 12;
if ((c | 0) == 12) {
t[i >> 2] = 3;
f = 0
}
F = s;
return f | 0
}
function Gn(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0,
u = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0;
b = F;
F = F + 16 | 0;
r = b + 4 | 0;
n = b;
u = e + 4 | 0;
A = e + 8 | 0;
l = e + 12 | 0;
i = 0;
while (1) {
if ((i | 0) == 64) break;
o = e + 36 + (i << 3) | 0;
c = (t[e >> 2] | 0) + (i << 2) | 0;
c = a[c >> 1] | a[c + 2 >> 1] << 16;
t[n >> 2] = c;
s = c >>> 16;
if ((s & 65535) > 255) {
t[o >> 2] = c & 255 | 256;
t[e + 36 + (i << 3) + 4 >> 2] = s
} else {
t[o >> 2] = 0;
t[e + 36 + (i << 3) + 4 >> 2] = 0;
f[r >> 1] = f[n >> 1] | 0;
f[r + 2 >> 1] = f[n + 2 >> 1] | 0;
s = i >>> (Tn(r, 8, o) | 0);
c = (t[u >> 2] | 0) + (s << 2) | 0;
f[r >> 1] = f[c >> 1] | 0;
f[r + 2 >> 1] = f[c + 2 >> 1] | 0;
s = s >>> (Tn(r, 16, o) | 0);
c = (t[A >> 2] | 0) + (s << 2) | 0;
f[r >> 1] = f[c >> 1] | 0;
f[r + 2 >> 1] = f[c + 2 >> 1] | 0;
s = s >>> (Tn(r, 0, o) | 0);
s = (t[l >> 2] | 0) + (s << 2) | 0;
f[r >> 1] = f[s >> 1] | 0;
f[r + 2 >> 1] = f[s + 2 >> 1] | 0;
Tn(r, 24, o) | 0
}
i = i + 1 | 0
}
F = b;
return
}
function Tn(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0;
n = u[e >> 0] | 0;
t[r >> 2] = (t[r >> 2] | 0) + n;
r = r + 4 | 0;
t[r >> 2] = (a[e + 2 >> 1] | 0) << i | t[r >> 2];
return n | 0
}
function Mn(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0;
k = F;
F = F + 512 | 0;
b = k;
h = e + 24 | 0;
e: do {
if (!(Sn(b, 7, i, 19) | 0)) w = 15;
else {
if (Ji(h, 1) | 0) {
i = (Ji(h, ((Ji(h, 3) | 0) << 1) + 2 | 0) | 0) + 2 | 0;
if ((i | 0) > (r | 0)) {
w = 15;
break
}
} else i = r;
s = e + 44 | 0;
a = 0;
c = 8;
while (1) {
l = a;
while (1) {
if ((l | 0) >= (r | 0)) {
i = 1;
break e
}
o = i + -1 | 0;
if (!i) {
i = 1;
break e
}
Mi(h);
A = (xr(h) | 0) & 127;
Fr(h, (t[s >> 2] | 0) + (u[b + (A << 2) >> 0] | 0) | 0);
A = f[b + (A << 2) + 2 >> 1] | 0;
i = A & 65535;
if ((A & 65535) < 16) break;
i = i + -16 | 0;
a = u[7785 + i >> 0] | 0;
a = (Ji(h, u[7782 + i >> 0] | 0) | 0) + a | 0;
if ((a + l | 0) > (r | 0)) {
w = 15;
break e
}
A = A << 16 >> 16 == 16 ? c : 0;
i = l;
while (1) {
if ((a | 0) <= 0) break;
t[n + (i << 2) >> 2] = A;
a = a + -1 | 0;
i = i + 1 | 0
}
l = i;
i = o
}
t[n + (l << 2) >> 2] = i;
a = l + 1 | 0;
c = A << 16 >> 16 == 0 ? c : i;
i = o
}
}
} while (0);
if ((w | 0) == 15) {
t[e >> 2] = 3;
i = 0
}
F = k;
return i | 0
}
function Sn(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
t = 0;
t = F;
F = F + 1024 | 0;
if ((n | 0) >= 513) {
f = mi(n, ((n | 0) < 0) << 31 >> 31, 2) | 0;
if (!f) e = 0;
else {
e = xn(e, i, r, n, f) | 0;
ii(f)
}
} else e = xn(e, i, r, n, t) | 0;
F = t;
return e | 0
}
function xn(e, i, r, u, a) {
e = e | 0;
i = i | 0;
r = r | 0;
u = u | 0;
a = a | 0;
var A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
v = 0,
C = 0,
I = 0,
d = 0,
m = 0,
p = 0,
y = 0,
P = 0,
D = 0,
B = 0,
E = 0;
D = F;
F = F + 144 | 0;
p = D + 132 | 0;
y = D + 64 | 0;
s = D;
P = D + 128 | 0;
A = 1 << i;
l = y;
o = l + 64 | 0;
do {
t[l >> 2] = 0;
l = l + 4 | 0
} while ((l | 0) < (o | 0));
l = 0;
while (1) {
if ((l | 0) >= (u | 0)) {
c = 5;
break
}
o = t[r + (l << 2) >> 2] | 0;
if ((o | 0) > 15) {
A = 0;
break
}
m = y + (o << 2) | 0;
t[m >> 2] = (t[m >> 2] | 0) + 1;
l = l + 1 | 0
}
e: do {
if ((c | 0) == 5)
if ((t[y >> 2] | 0) == (u | 0)) A = 0;
else {
l = 0;
o = 1;
while (1) {
t[s + (o << 2) >> 2] = l;
if (o >>> 0 >= 15) break;
c = t[y + (o << 2) >> 2] | 0;
if ((c | 0) > (1 << o | 0)) {
A = 0;
break e
}
l = l + c | 0;
o = o + 1 | 0
}
l = 0;
while (1) {
if ((l | 0) >= (u | 0)) break;
o = t[r + (l << 2) >> 2] | 0;
if ((o | 0) > 0) {
d = s + (o << 2) | 0;
m = t[d >> 2] | 0;
t[d >> 2] = m + 1;
f[a + (m << 1) >> 1] = l
}
l = l + 1 | 0
}
d = s + 60 | 0;
if ((t[d >> 2] | 0) == 1) {
n[P >> 0] = 0;
f[P + 2 >> 1] = f[a >> 1] | 0;
f[p >> 1] = f[P >> 1] | 0;
f[p + 2 >> 1] = f[P + 2 >> 1] | 0;
Fn(e, 1, A, p);
break
}
m = A + -1 | 0;
k = P + 2 | 0;
c = 1;
b = 1;
u = 0;
h = 2;
w = 1;
s = 0;
while (1) {
if ((w | 0) > (i | 0)) break;
c = c << 1;
b = c + b | 0;
o = y + (w << 2) | 0;
l = t[o >> 2] | 0;
c = c - l | 0;
if ((c | 0) < 0) {
A = 0;
break e
}
r = w & 255;
while (1) {
if ((l | 0) <= 0) break;
n[P >> 0] = r;
f[k >> 1] = f[a + (s << 1) >> 1] | 0;
f[p >> 1] = f[P >> 1] | 0;
f[p + 2 >> 1] = f[P + 2 >> 1] | 0;
Fn(e + (u << 2) | 0, h, A, p);
C = Ln(u, w) | 0;
I = l + -1 | 0;
t[o >> 2] = I;
u = C;
s = s + 1 | 0;
l = I
}
h = h << 1;
w = w + 1 | 0
}
C = P + 2 | 0;
I = e;
r = A;
h = -1;
l = e;
o = A;
v = 2;
A = i;
while (1) {
g = A + 1 | 0;
if ((A | 0) >= 15) break;
c = c << 1;
b = c + b | 0;
w = y + (g << 2) | 0;
A = t[w >> 2] | 0;
c = c - A | 0;
if ((c | 0) < 0) {
A = 0;
break e
}
k = g - i & 255;
while (1) {
if ((A | 0) <= 0) break;
A = u & m;
if ((A | 0) == (h | 0)) A = h;
else {
l = l + (r << 2) | 0;
r = Qn(y, g, i) | 0;
h = 1 << r;
n[e + (A << 2) >> 0] = r + i;
f[e + (A << 2) + 2 >> 1] = ((l - I | 0) >>> 2) - A;
r = h;
o = h + o | 0
}
n[P >> 0] = k;
f[C >> 1] = f[a + (s << 1) >> 1] | 0;
f[p >> 1] = f[P >> 1] | 0;
f[p + 2 >> 1] = f[P + 2 >> 1] | 0;
Fn(l + (u >>> i << 2) | 0, v, r, p);
E = Ln(u, g) | 0;
B = (t[w >> 2] | 0) + -1 | 0;
t[w >> 2] = B;
h = A;
u = E;
s = s + 1 | 0;
A = B
}
v = v << 1;
A = g
}
A = (b | 0) == ((t[d >> 2] << 1) + -1 | 0) ? o : 0
}
} while (0);
F = D;
return A | 0
}
function Fn(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var t = 0;
n = a[n >> 1] | a[n + 2 >> 1] << 16;
do {
r = r - i | 0;
t = e + (r << 2) | 0;
f[t >> 1] = n;
f[t + 2 >> 1] = n >>> 16
} while ((r | 0) > 0);
return
}
function Ln(e, i) {
e = e | 0;
i = i | 0;
i = 1 << i + -1;
while (1)
if (!(i & e)) break;
else i = i >>> 1;
return ((i | 0) == 0 ? e : (i + -1 & e) + i | 0) | 0
}
function Qn(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0;
n = 1 << i - r;
while (1) {
if ((i | 0) >= 15) break;
n = n - (t[e + (i << 2) >> 2] | 0) | 0;
if ((n | 0) < 1) break;
n = n << 1;
i = i + 1 | 0
}
return i - r | 0
}
function Yn(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
f = 0,
a = 0,
A = 0;
f = 1 << (8 >>> (t[i + 4 >> 2] | 0));
A = mi(f, ((f | 0) < 0) << 31 >> 31, 4) | 0;
if (!A) i = 0;
else {
a = i + 16 | 0;
r = t[a >> 2] | 0;
t[A >> 2] = t[r >> 2];
e = e << 2;
i = 4;
while (1) {
if ((i | 0) >= (e | 0)) break;
n[A + i >> 0] = (u[A + (i + -4) >> 0] | 0) + (u[r + i >> 0] | 0);
i = i + 1 | 0
}
e = f << 2;
while (1) {
if ((i | 0) >= (e | 0)) break;
n[A + i >> 0] = 0;
i = i + 1 | 0
}
ii(t[a >> 2] | 0);
t[a >> 2] = A;
i = 1
}
return i | 0
}
function Un() {
var e = 0;
if (!(Eo(9024) | 0)) {
if (!(t[1929] | 0)) e = 0;
else {
Hn();
e = t[2248] | 0
}
t[1929] = e;
_o(9024) | 0
}
return
}
function Hn() {
t[2152] = 3;
t[2153] = 4;
t[2154] = 5;
t[2155] = 6;
t[2156] = 7;
t[2157] = 8;
t[2158] = 9;
t[2159] = 10;
t[2160] = 11;
t[2161] = 12;
t[2162] = 13;
t[2163] = 14;
t[2164] = 15;
t[2165] = 16;
t[2166] = 3;
t[2167] = 3;
t[2184] = 3;
t[2185] = 4;
t[2186] = 5;
t[2187] = 6;
t[2188] = 7;
t[2189] = 8;
t[2190] = 9;
t[2191] = 10;
t[2192] = 11;
t[2193] = 12;
t[2194] = 13;
t[2195] = 14;
t[2196] = 15;
t[2197] = 16;
t[2198] = 3;
t[2199] = 3;
t[2136] = 1;
t[2137] = 2;
t[2138] = 3;
t[2139] = 4;
t[2140] = 5;
t[2141] = 6;
t[2142] = 7;
t[2143] = 8;
t[2144] = 9;
t[2145] = 10;
t[2146] = 11;
t[2147] = 12;
t[2148] = 13;
t[2149] = 14;
t[2150] = 1;
t[2151] = 1;
t[2168] = 1;
t[2169] = 2;
t[2170] = 3;
t[2171] = 4;
t[2172] = 5;
t[2173] = 6;
t[2174] = 7;
t[2175] = 8;
t[2176] = 9;
t[2177] = 10;
t[2178] = 11;
t[2179] = 12;
t[2180] = 13;
t[2181] = 14;
t[2182] = 1;
t[2183] = 1;
return
}
function Vn(e, i) {
e = e | 0;
i = i | 0;
return -16777216
}
function Wn(e, i) {
e = e | 0;
i = i | 0;
return e | 0
}
function Zn(e, i) {
e = e | 0;
i = i | 0;
return t[i + 4 >> 2] | 0
}
function zn(e, i) {
e = e | 0;
i = i | 0;
return t[i + -4 >> 2] | 0
}
function On(e, i) {
e = e | 0;
i = i | 0;
return Tf(e, t[i >> 2] | 0, t[i + 4 >> 2] | 0) | 0
}
function Jn(e, i) {
e = e | 0;
i = i | 0;
return yf(e, t[i + -4 >> 2] | 0) | 0
}
function jn(e, i) {
e = e | 0;
i = i | 0;
return yf(e, t[i >> 2] | 0) | 0
}
function qn(e, i) {
e = e | 0;
i = i | 0;
return yf(t[i + -4 >> 2] | 0, t[i >> 2] | 0) | 0
}
function Kn(e, i) {
e = e | 0;
i = i | 0;
return yf(t[i >> 2] | 0, t[i + 4 >> 2] | 0) | 0
}
function Xn(e, i) {
e = e | 0;
i = i | 0;
return Gf(e, t[i + -4 >> 2] | 0, t[i >> 2] | 0, t[i + 4 >> 2] | 0) | 0
}
function Nn(e, i) {
e = e | 0;
i = i | 0;
return _f(t[i >> 2] | 0, e, t[i + -4 >> 2] | 0) | 0
}
function $n(e, i) {
e = e | 0;
i = i | 0;
return Bf(e, t[i >> 2] | 0, t[i + -4 >> 2] | 0) | 0
}
function ef(e, i) {
e = e | 0;
i = i | 0;
return pf(e, t[i >> 2] | 0, t[i + -4 >> 2] | 0) | 0
}
function rf(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break;
u = Zn(t[n + (f + -1 << 2) >> 2] | 0, i + (f << 2) | 0) | 0;
t[n + (f << 2) >> 2] = Sr(t[e + (f << 2) >> 2] | 0, u) | 0;
f = f + 1 | 0
}
return
}
function nf(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break;
u = zn(t[n + (f + -1 << 2) >> 2] | 0, i + (f << 2) | 0) | 0;
t[n + (f << 2) >> 2] = Sr(t[e + (f << 2) >> 2] | 0, u) | 0;
f = f + 1 | 0
}
return
}
function ff(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break;
u = On(t[n + (f + -1 << 2) >> 2] | 0, i + (f << 2) | 0) | 0;
t[n + (f << 2) >> 2] = Sr(t[e + (f << 2) >> 2] | 0, u) | 0;
f = f + 1 | 0
}
return
}
function tf(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break;
u = Jn(t[n + (f + -1 << 2) >> 2] | 0, i + (f << 2) | 0) | 0;
t[n + (f << 2) >> 2] = Sr(t[e + (f << 2) >> 2] | 0, u) | 0;
f = f + 1 | 0
}
return
}
function uf(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break;
u = jn(t[n + (f + -1 << 2) >> 2] | 0, i + (f << 2) | 0) | 0;
t[n + (f << 2) >> 2] = Sr(t[e + (f << 2) >> 2] | 0, u) | 0;
f = f + 1 | 0
}
return
}
function af(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break;
u = qn(t[n + (f + -1 << 2) >> 2] | 0, i + (f << 2) | 0) | 0;
t[n + (f << 2) >> 2] = Sr(t[e + (f << 2) >> 2] | 0, u) | 0;
f = f + 1 | 0
}
return
}
function Af(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break;
u = Kn(t[n + (f + -1 << 2) >> 2] | 0, i + (f << 2) | 0) | 0;
t[n + (f << 2) >> 2] = Sr(t[e + (f << 2) >> 2] | 0, u) | 0;
f = f + 1 | 0
}
return
}
function lf(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break;
u = Xn(t[n + (f + -1 << 2) >> 2] | 0, i + (f << 2) | 0) | 0;
t[n + (f << 2) >> 2] = Sr(t[e + (f << 2) >> 2] | 0, u) | 0;
f = f + 1 | 0
}
return
}
function of (e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break;
u = Nn(t[n + (f + -1 << 2) >> 2] | 0, i + (f << 2) | 0) | 0;
t[n + (f << 2) >> 2] = Sr(t[e + (f << 2) >> 2] | 0, u) | 0;
f = f + 1 | 0
}
return
}
function cf(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break;
u = $n(t[n + (f + -1 << 2) >> 2] | 0, i + (f << 2) | 0) | 0;
t[n + (f << 2) >> 2] = Sr(t[e + (f << 2) >> 2] | 0, u) | 0;
f = f + 1 | 0
}
return
}
function sf(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break;
u = ef(t[n + (f + -1 << 2) >> 2] | 0, i + (f << 2) | 0) | 0;
t[n + (f << 2) >> 2] = Sr(t[e + (f << 2) >> 2] | 0, u) | 0;
f = f + 1 | 0
}
return
}
function bf(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0;
n = 0;
while (1) {
if ((n | 0) >= (i | 0)) break;
f = t[e + (n << 2) >> 2] | 0;
u = f >>> 8 & 255;
t[r + (n << 2) >> 2] = (u << 16 | u) + (f & 16711935) & 16711935 | f & -16711936;
n = n + 1 | 0
}
return
}
function hf(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
var u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0;
a = e + 1 | 0;
A = e + 2 | 0;
u = 0;
while (1) {
if ((u | 0) >= (r | 0)) break;
c = t[i + (u << 2) >> 2] | 0;
o = c >>> 8 & 255;
l = (mf(n[e >> 0] | 0, o) | 0) + (c >>> 16) | 0;
o = (mf(n[a >> 0] | 0, o) | 0) + c | 0;
t[f + (u << 2) >> 2] = l << 16 & 16711680 | c & -16711936 | o + (mf(n[A >> 0] | 0, l & 255) | 0) & 255;
u = u + 1 | 0
}
return
}
function wf(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0;
f = e + (i << 2) | 0;
i = e;
while (1) {
if (i >>> 0 >= f >>> 0) break;
e = t[i >> 2] | 0;
n[r >> 0] = e >>> 16;
n[r + 1 >> 0] = e >>> 8;
n[r + 2 >> 0] = e;
n[r + 3 >> 0] = e >>> 24;
i = i + 4 | 0;
r = r + 4 | 0
}
return
}
function kf(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0;
f = e + (i << 2) | 0;
i = e;
while (1) {
if (i >>> 0 >= f >>> 0) break;
e = t[i >> 2] | 0;
n[r >> 0] = e >>> 16;
n[r + 1 >> 0] = e >>> 8;
n[r + 2 >> 0] = e;
i = i + 4 | 0;
r = r + 3 | 0
}
return
}
function gf(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0;
f = e + (i << 2) | 0;
i = e;
while (1) {
if (i >>> 0 >= f >>> 0) break;
e = t[i >> 2] | 0;
n[r >> 0] = e;
n[r + 1 >> 0] = e >>> 8;
n[r + 2 >> 0] = e >>> 16;
i = i + 4 | 0;
r = r + 3 | 0
}
return
}
function vf(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0;
f = e + (i << 2) | 0;
i = e;
while (1) {
if (i >>> 0 >= f >>> 0) break;
e = t[i >> 2] | 0;
n[r >> 0] = e >>> 16 & 240 | e >>> 12 & 15;
n[r + 1 >> 0] = e & 240 | e >>> 28;
i = i + 4 | 0;
r = r + 2 | 0
}
return
}
function Cf(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0;
f = e + (i << 2) | 0;
i = e;
while (1) {
if (i >>> 0 >= f >>> 0) break;
e = t[i >> 2] | 0;
n[r >> 0] = e >>> 16 & 248 | e >>> 13 & 7;
n[r + 1 >> 0] = e >>> 5 & 224 | e >>> 3 & 31;
i = i + 4 | 0;
r = r + 2 | 0
}
return
}
function If(e, i, r, n, f, u) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
u = u | 0;
var a = 0;
while (1) {
if ((n | 0) >= (f | 0)) break;
a = 0;
while (1) {
if ((a | 0) >= (u | 0)) break;
t[r >> 2] = Er(t[i + ((Br(t[e >> 2] | 0) | 0) << 2) >> 2] | 0) | 0;
a = a + 1 | 0;
e = e + 4 | 0;
r = r + 4 | 0
}
n = n + 1 | 0
}
return
}
function df(e, i, r, f, u, a) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
u = u | 0;
a = a | 0;
var A = 0;
while (1) {
if ((f | 0) >= (u | 0)) break;
A = 0;
while (1) {
if ((A | 0) >= (a | 0)) break;
n[r >> 0] = Or(t[i + (((zr(n[e >> 0] | 0) | 0) & 255) << 2) >> 2] | 0) | 0;
A = A + 1 | 0;
e = e + 1 | 0;
r = r + 1 | 0
}
f = f + 1 | 0
}
return
}
function mf(e, i) {
e = e | 0;
i = i | 0;
return (v(i << 24 >> 24, e << 24 >> 24) | 0) >> 5 | 0
}
function pf(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0;
i = yf(e, i) | 0;
n = Pf(i >>> 24, r >>> 24) | 0;
f = Pf(i >>> 16 & 255, r >>> 16 & 255) | 0;
e = Pf(i >>> 8 & 255, r >>> 8 & 255) | 0;
return f << 16 | n << 24 | e << 8 | (Pf(i & 255, r & 255) | 0) | 0
}
function yf(e, i) {
e = e | 0;
i = i | 0;
return ((i ^ e) >>> 1 & 2139062143) + (i & e) | 0
}
function Pf(e, i) {
e = e | 0;
i = i | 0;
return Df(((e - i | 0) / 2 | 0) + e | 0) | 0
}
function Df(e) {
e = e | 0;
return (e >>> 0 < 256 ? e : e >>> 24 ^ 255) | 0
}
function Bf(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
t = 0;
f = Ef(e >>> 24, i >>> 24, r >>> 24) | 0;
t = Ef(e >>> 16 & 255, i >>> 16 & 255, r >>> 16 & 255) | 0;
n = Ef(e >>> 8 & 255, i >>> 8 & 255, r >>> 8 & 255) | 0;
return t << 16 | f << 24 | n << 8 | (Ef(e & 255, i & 255, r & 255) | 0) | 0
}
function Ef(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
return Df(i + e - r | 0) | 0
}
function _f(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0;
n = Rf(e >>> 24, i >>> 24, r >>> 24) | 0;
n = (Rf(e >>> 16 & 255, i >>> 16 & 255, r >>> 16 & 255) | 0) + n | 0;
n = n + (Rf(e >>> 8 & 255, i >>> 8 & 255, r >>> 8 & 255) | 0) | 0;
r = (n + (Rf(e & 255, i & 255, r & 255) | 0) | 0) < 1;
return (r ? e : i) | 0
}
function Rf(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
i = i - r | 0;
r = e - r | 0;
return ((i | 0) > -1 ? i : 0 - i | 0) - ((r | 0) > -1 ? r : 0 - r | 0) | 0
}
function Gf(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
i = yf(e, i) | 0;
return yf(i, yf(r, n) | 0) | 0
}
function Tf(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
return yf(yf(e, r) | 0, i) | 0
}
function Mf(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0;
n = t[e + 40 >> 2] | 0;
if ((t[e + 12 >> 2] | 0) < 1 ? 1 : (t[e + 16 >> 2] | 0) < 1) e = 0;
else {
i = rc[t[n + 44 >> 2] & 31](e, n) | 0;
r = t[n + 48 >> 2] | 0;
if (r | 0) nc[r & 7](e, n, i) | 0;
e = n + 16 | 0;
t[e >> 2] = (t[e >> 2] | 0) + i;
e = 1
}
return e | 0
}
function Sf(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0;
f = t[e + 40 >> 2] | 0;
a = t[t[f >> 2] >> 2] | 0;
i = Ff(a) | 0;
n = Lf(a) | 0;
A = f + 40 | 0;
l = f + 44 | 0;
o = f + 48 | 0;
t[A >> 2] = 0;
t[A + 4 >> 2] = 0;
t[A + 8 >> 2] = 0;
t[A + 12 >> 2] = 0;
n = (n | 0) != 0;
do {
if (!(Qf(t[f + 20 >> 2] | 0, e, n ? 11 : 12) | 0)) i = 0;
else {
if (n ? Yf(a) | 0 : 0) Uf();
if (!(t[e + 92 >> 2] | 0)) {
u = (i | 0) != 0;
if (u) {
Wf();
t[l >> 2] = 17;
if (t[e + 56 >> 2] | 0) {
i = e + 12 | 0;
r = t[i >> 2] | 0;
e = r + 1 | 0;
r = mi(1, 0, (e & -2) + r | 0) | 0;
t[A >> 2] = r;
if (!r) {
i = 0;
break
}
t[f + 4 >> 2] = r;
A = r + (t[i >> 2] | 0) | 0;
t[f + 8 >> 2] = A;
t[f + 12 >> 2] = A + (e >> 1);
t[l >> 2] = 18;
Uf()
}
} else t[l >> 2] = 19;
if (n) {
switch (a | 0) {
case 5:
case 10: {
i = 3;
break
}
default:
i = u ? 1 : 2
}
t[o >> 2] = i;
if (u) Bi()
}
} else {
if (!i) i = Vf(e, f) | 0;
else i = Hf(e, f) | 0;
if (!i) {
i = 0;
break
}
}
i = 1
}
} while (0);
return i | 0
}
function xf(e) {
e = e | 0;
e = (t[e + 40 >> 2] | 0) + 40 | 0;
ii(t[e >> 2] | 0);
t[e >> 2] = 0;
return
}
function Ff(e) {
e = e | 0;
return e >>> 0 < 11 | 0
}
function Lf(e) {
e = e | 0;
switch (e | 0) {
case 1:
case 3:
case 4:
case 5:
case 12: {
e = 1;
break
}
default:
e = (Yf(e) | 0) != 0 & 1
}
return e | 0
}
function Qf(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0;
b = F;
F = F + 16 | 0;
A = b + 4 | 0;
l = b;
c = t[i >> 2] | 0;
s = t[i + 4 >> 2] | 0;
a = (e | 0) != 0;
if (a) {
u = (t[e + 8 >> 2] | 0) > 0;
t[i + 72 >> 2] = u & 1;
if (u) {
u = t[e + 20 >> 2] | 0;
f = t[e + 24 >> 2] | 0;
w = t[e + 12 >> 2] | 0;
n = t[e + 16 >> 2] | 0;
h = (bu(r) | 0) == 0;
r = h ? w & -2 : w;
n = h ? n & -2 : n;
if ((n + f | 0) > (s | 0) | ((r + u | 0) > (c | 0) | ((f | 0) < 1 | ((u | 0) < 1 | (r | n | 0) < 0)))) r = 0;
else o = 5
} else {
f = s;
u = c;
n = 0;
r = 0;
o = 5
}
} else {
t[i + 72 >> 2] = 0;
f = s;
u = c;
n = 0;
r = 0;
o = 5
}
e: do {
if ((o | 0) == 5) {
t[i + 76 >> 2] = r;
t[i + 84 >> 2] = n;
t[i + 80 >> 2] = u + r;
t[i + 88 >> 2] = f + n;
t[i + 12 >> 2] = u;
t[i + 16 >> 2] = f;
if (!a) {
t[i + 92 >> 2] = 0;
t[i + 68 >> 2] = 0;
t[i + 56 >> 2] = 1;
r = 1;
break
}
w = (t[e + 28 >> 2] | 0) > 0;
r = i + 92 | 0;
t[r >> 2] = w & 1;
do {
if (w) {
t[A >> 2] = t[e + 32 >> 2];
t[l >> 2] = t[e + 36 >> 2];
if (!(hu(u, f, A, l) | 0)) {
r = 0;
break e
} else {
t[i + 96 >> 2] = t[A >> 2];
t[i + 100 >> 2] = t[l >> 2];
r = (t[r >> 2] | 0) == 0;
break
}
} else r = 1
} while (0);
n = i + 68 | 0;
t[n >> 2] = (t[e >> 2] | 0) != 0 & 1;
f = i + 56 | 0;
t[f >> 2] = (t[e + 4 >> 2] | 0) == 0 & 1;
if (r) r = 1;
else {
if ((t[i + 96 >> 2] | 0) < ((c * 3 | 0) / 4 | 0 | 0)) r = (t[i + 100 >> 2] | 0) < ((s * 3 | 0) / 4 | 0 | 0) & 1;
else r = 0;
t[n >> 2] = r;
t[f >> 2] = 0;
r = 1
}
}
} while (0);
F = b;
return r | 0
}
function Yf(e) {
e = e | 0;
return (e + -7 | 0) >>> 0 < 4 | 0
}
function Uf() {
var e = 0;
if (!(Eo(9136) | 0)) {
if (!(t[1933] | 0)) e = 0;
else {
tu();
e = t[2248] | 0
}
t[1933] = e;
_o(9136) | 0
}
return
}
function Hf(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
v = 0;
A = Lf(t[t[i >> 2] >> 2] | 0) | 0;
h = t[e + 96 >> 2] | 0;
w = t[e + 100 >> 2] | 0;
k = e + 12 | 0;
b = (t[k >> 2] | 0) + 1 >> 1;
f = e + 16 | 0;
u = (t[f >> 2] | 0) + 1 >> 1;
a = h << 1;
A = (A | 0) != 0;
l = h * 6 | 0;
o = h * 3 | 0;
c = h << 2;
e = A ? h << 3 : l;
r = (e << 2) + (A ? c : o) | 0;
s = mi(1, 0, r + (A ? 367 : 283) | 0) | 0;
t[i + 40 >> 2] = s;
if (s) {
n = s + (e << 2) | 0;
v = s + r + 31 & -32;
t[i + 24 >> 2] = v;
g = i + 28 | 0;
t[g >> 2] = v + 84;
r = i + 32 | 0;
t[r >> 2] = v + 168;
e = i + 36 | 0;
t[e >> 2] = A ? v + 252 | 0 : 0;
Ct(v, t[k >> 2] | 0, t[f >> 2] | 0, n, h, w, 0, 1, s);
Ct(t[g >> 2] | 0, b, u, n + h | 0, h, w, 0, 1, s + (a << 2) | 0);
Ct(t[r >> 2] | 0, b, u, n + a | 0, h, w, 0, 1, s + (c << 2) | 0);
t[i + 44 >> 2] = 20;
Tt();
if (A) {
Ct(t[e >> 2] | 0, t[k >> 2] | 0, t[f >> 2] | 0, n + o | 0, h, w, 0, 1, s + (l << 2) | 0);
t[i + 48 >> 2] = 4;
switch (t[t[i >> 2] >> 2] | 0) {
case 10:
case 5: {
e = 5;
break
}
default:
e = 6
}
t[i + 52 >> 2] = e;
Bi();
e = 1
} else e = 1
} else e = 0;
return e | 0
}
function Vf(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
v = 0,
C = 0;
w = t[i >> 2] | 0;
l = Lf(t[w >> 2] | 0) | 0;
k = t[e + 96 >> 2] | 0;
g = t[e + 100 >> 2] | 0;
A = k + 1 | 0;
c = A >> 1;
s = g + 1 >> 1;
b = e + 12 | 0;
h = (t[b >> 2] | 0) + 1 >> 1;
u = e + 16 | 0;
a = (t[u >> 2] | 0) + 1 >> 1;
r = k << 1;
A = A & -2;
l = (l | 0) != 0;
o = A << 1;
e = (o + r << 2) + (l ? k << 3 : 0) | 0;
n = mi(1, 0, e + (l ? 367 : 283) | 0) | 0;
t[i + 40 >> 2] = n;
if (n) {
e = n + e + 31 & -32;
t[i + 24 >> 2] = e;
C = i + 28 | 0;
t[C >> 2] = e + 84;
v = i + 32 | 0;
t[v >> 2] = e + 168;
f = i + 36 | 0;
t[f >> 2] = l ? e + 252 | 0 : 0;
Ct(e, t[b >> 2] | 0, t[u >> 2] | 0, t[w + 16 >> 2] | 0, k, g, t[w + 32 >> 2] | 0, 1, n);
e = n + (r << 2) | 0;
Ct(t[C >> 2] | 0, h, a, t[w + 20 >> 2] | 0, c, s, t[w + 36 >> 2] | 0, 1, e);
Ct(t[v >> 2] | 0, h, a, t[w + 24 >> 2] | 0, c, s, t[w + 40 >> 2] | 0, 1, e + (A << 2) | 0);
t[i + 44 >> 2] = 21;
if (l) {
Ct(t[f >> 2] | 0, t[b >> 2] | 0, t[u >> 2] | 0, t[w + 28 >> 2] | 0, k, g, t[w + 44 >> 2] | 0, 1, e + (o << 2) | 0);
t[i + 48 >> 2] = 7;
Bi();
e = 1
} else e = 1
} else e = 0;
return e | 0
}
function Wf() {
var e = 0;
if (!(Eo(9052) | 0)) {
if (!(t[1930] | 0)) e = 0;
else {
$f();
e = t[2248] | 0
}
t[1930] = e;
_o(9052) | 0
}
return
}
function Zf(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0;
r = t[i >> 2] | 0;
n = t[r + 20 >> 2] | 0;
f = (t[r + 16 >> 2] | 0) + (v(n, t[e + 8 >> 2] | 0) | 0) | 0;
i = e + 16 | 0;
Nf(t[e + 20 >> 2] | 0, t[e + 32 >> 2] | 0, t[e + 24 >> 2] | 0, t[e + 28 >> 2] | 0, t[e + 36 >> 2] | 0, f, n, t[e + 12 >> 2] | 0, t[i >> 2] | 0, t[8928 + (t[r >> 2] << 2) >> 2] | 0);
return t[i >> 2] | 0
}
function zf(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
C = 0,
I = 0,
d = 0,
m = 0,
p = 0,
y = 0;
r = t[e + 16 >> 2] | 0;
s = t[i >> 2] | 0;
l = t[e + 8 >> 2] | 0;
C = s + 20 | 0;
n = t[C >> 2] | 0;
u = (t[s + 16 >> 2] | 0) + (v(n, l) | 0) | 0;
s = t[8800 + (t[s >> 2] << 2) >> 2] | 0;
A = t[e + 20 >> 2] | 0;
f = t[e + 24 >> 2] | 0;
a = t[e + 28 >> 2] | 0;
b = i + 8 | 0;
h = i + 12 | 0;
w = l + r | 0;
k = t[e + 12 >> 2] | 0;
g = (k + 1 | 0) / 2 | 0;
if (!l) sc[s & 7](A, 0, f, a, f, a, u, 0, k);
else {
sc[s & 7](t[i + 4 >> 2] | 0, A, t[b >> 2] | 0, t[h >> 2] | 0, f, a, u + (0 - n) | 0, u, k);
r = r + 1 | 0
}
o = e + 36 | 0;
c = e + 32 | 0;
n = l;
while (1) {
n = n + 2 | 0;
if ((n | 0) >= (w | 0)) break;
I = t[o >> 2] | 0;
l = f + I | 0;
I = a + I | 0;
p = t[C >> 2] | 0;
m = u + (p << 1) | 0;
y = t[c >> 2] | 0;
d = A + (y << 1) | 0;
sc[s & 7](d + (0 - y) | 0, d, f, a, l, I, m + (0 - p) | 0, m, k);
u = m;
A = d;
a = I;
f = l
}
n = A + (t[c >> 2] | 0) | 0;
if (((t[e + 84 >> 2] | 0) + w | 0) >= (t[e + 88 >> 2] | 0)) {
if (!(w & 1)) sc[s & 7](n, 0, f, a, f, a, u + (t[C >> 2] | 0) | 0, 0, k)
} else {
Po(t[i + 4 >> 2] | 0, n | 0, k | 0) | 0;
Po(t[b >> 2] | 0, f | 0, g | 0) | 0;
Po(t[h >> 2] | 0, a | 0, g | 0) | 0;
r = r + -1 | 0
}
return r | 0
}
function Of(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
C = 0;
k = t[i >> 2] | 0;
s = t[e + 8 >> 2] | 0;
o = k + 32 | 0;
r = (t[k + 16 >> 2] | 0) + (v(t[o >> 2] | 0, s) | 0) | 0;
n = t[k + 20 >> 2] | 0;
s = s >> 1;
w = k + 36 | 0;
f = v(t[w >> 2] | 0, s) | 0;
c = t[k + 24 >> 2] | 0;
k = k + 40 | 0;
s = v(t[k >> 2] | 0, s) | 0;
u = t[e + 12 >> 2] | 0;
g = e + 16 | 0;
a = t[g >> 2] | 0;
b = u + 1 | 0;
h = a + 1 | 0;
A = e + 20 | 0;
l = e + 32 | 0;
i = 0;
while (1) {
if ((i | 0) >= (a | 0)) break;
C = r + (v(t[o >> 2] | 0, i) | 0) | 0;
Po(C | 0, (t[A >> 2] | 0) + (v(t[l >> 2] | 0, i) | 0) | 0, u | 0) | 0;
i = i + 1 | 0
}
l = n + f | 0;
A = c + s | 0;
a = (b | 0) / 2 | 0;
n = (h | 0) / 2 | 0;
f = e + 24 | 0;
u = e + 36 | 0;
r = e + 28 | 0;
i = 0;
while (1) {
if ((i | 0) >= (n | 0)) break;
C = l + (v(t[w >> 2] | 0, i) | 0) | 0;
Po(C | 0, (t[f >> 2] | 0) + (v(t[u >> 2] | 0, i) | 0) | 0, a | 0) | 0;
C = A + (v(t[k >> 2] | 0, i) | 0) | 0;
Po(C | 0, (t[r >> 2] | 0) + (v(t[u >> 2] | 0, i) | 0) | 0, a | 0) | 0;
i = i + 1 | 0
}
return t[g >> 2] | 0
}
function Jf(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
f = F;
F = F + 16 | 0;
r = f + 4 | 0;
n = f;
s = t[e + 104 >> 2] | 0;
t[r >> 2] = s;
if ((s | 0 ? (c = t[e + 12 >> 2] | 0, o = t[i >> 2] | 0, u = t[o >> 2] | 0, i = (u | 0) == 4 | (u | 0) == 9, a = i & 1, l = Kf(e, r, n) | 0, A = o + 20 | 0, s = t[A >> 2] | 0, l = (t[o + 16 >> 2] | 0) + (v(s, l) | 0) | 0, o = t[n >> 2] | 0, $r(t[r >> 2] | 0, t[e >> 2] | 0, c, o, l + (i ? 0 : 3) | 0, s) | 0) : 0) ? Yf(u) | 0 : 0) Nr(l, a, c, o, t[A >> 2] | 0);
F = f;
return 0
}
function jf(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0,
a = 0,
A = 0;
r = t[e + 104 >> 2] | 0;
u = t[i >> 2] | 0;
a = t[e + 12 >> 2] | 0;
A = t[e + 16 >> 2] | 0;
n = t[u + 28 >> 2] | 0;
u = u + 44 | 0;
f = t[u >> 2] | 0;
i = n + (v(f, t[e + 8 >> 2] | 0) | 0) | 0;
e: do {
if (!r) {
if (n | 0) Xf(i, a, A, f)
} else {
n = 0;
while (1) {
if ((n | 0) >= (A | 0)) break e;
Po(i | 0, r | 0, a | 0) | 0;
n = n + 1 | 0;
i = i + (t[u >> 2] | 0) | 0;
r = r + (t[e >> 2] | 0) | 0
}
}
} while (0);
return 0
}
function qf(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0;
w = F;
F = F + 16 | 0;
s = w + 4 | 0;
b = w;
h = t[e + 104 >> 2] | 0;
t[s >> 2] = h;
if (h | 0) {
h = t[e + 12 >> 2] | 0;
a = t[i >> 2] | 0;
l = t[a >> 2] | 0;
c = Kf(e, s, b) | 0;
o = a + 20 | 0;
f = t[o >> 2] | 0;
c = (t[a + 16 >> 2] | 0) + (v(f, c) | 0) | 0;
a = c + 1 | 0;
A = 0;
r = 15;
while (1) {
i = t[b >> 2] | 0;
if ((A | 0) >= (i | 0)) break;
i = 0;
while (1) {
if ((i | 0) >= (h | 0)) break;
f = (u[(t[s >> 2] | 0) + i >> 0] | 0) >>> 4;
k = a + (i << 1) | 0;
n[k >> 0] = f | n[k >> 0] & -16 & 255;
i = i + 1 | 0;
r = f & r
}
t[s >> 2] = (t[s >> 2] | 0) + (t[e >> 2] | 0);
f = t[o >> 2] | 0;
a = a + f | 0;
A = A + 1 | 0
}
if ((r | 0) != 15 ? Yf(l) | 0 : 0) Kr(c, h, i, f)
}
F = w;
return 0
}
function Kf(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0,
a = 0;
u = e + 8 | 0;
n = t[u >> 2] | 0;
a = e + 16 | 0;
f = t[a >> 2] | 0;
t[r >> 2] = f;
if (t[e + 56 >> 2] | 0) {
if (!n) {
t[r >> 2] = f + -1;
n = 0
} else {
t[i >> 2] = (t[i >> 2] | 0) + (0 - (t[e >> 2] | 0));
n = n + -1 | 0
}
f = t[e + 84 >> 2] | 0;
i = (t[u >> 2] | 0) + f + (t[a >> 2] | 0) | 0;
if ((i | 0) == (t[e + 88 >> 2] | 0)) t[r >> 2] = i - (f + n)
}
return n | 0
}
function Xf(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break;
Bo(e | 0, -1, i | 0) | 0;
f = f + 1 | 0;
e = e + n | 0
}
return
}
function Nf(e, i, r, n, f, t, u, a, A, l) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
u = u | 0;
a = a | 0;
A = A | 0;
l = l | 0;
var o = 0,
c = 0;
o = 0;
while (1) {
if ((o | 0) >= (A | 0)) break;
oc[l & 31](e, r, n, t, a);
c = (o & 1 | 0) == 0;
o = o + 1 | 0;
e = e + i | 0;
r = c ? r : r + f | 0;
n = c ? n : n + f | 0;
t = t + u | 0
}
return
}
function $f() {
t[2232] = 1;
t[2233] = 2;
t[2234] = 3;
t[2235] = 4;
t[2236] = 5;
t[2237] = 6;
t[2238] = 7;
t[2239] = 2;
t[2240] = 4;
t[2241] = 5;
t[2242] = 6;
return
}
function et(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var t = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
o = n + ((f & -2) * 3 | 0) | 0;
c = f >>> 1;
s = n + (c * 6 | 0) | 0;
l = f & -2;
a = e;
A = i;
t = r;
while (1) {
if ((n | 0) == (o | 0)) break;
wt(u[a >> 0] | 0, u[A >> 0] | 0, u[t >> 0] | 0, n);
wt(u[a + 1 >> 0] | 0, u[A >> 0] | 0, u[t >> 0] | 0, n + 3 | 0);
a = a + 2 | 0;
A = A + 1 | 0;
n = n + 6 | 0;
t = t + 1 | 0
}
if (f & 1 | 0) wt(u[e + l >> 0] | 0, u[i + c >> 0] | 0, u[r + c >> 0] | 0, s);
return
}
function it(e, i, r, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
t = t | 0;
var u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
o = f + (t << 2 & -8) | 0;
s = t >>> 1;
c = s & 536870911;
s = f + (s << 3) | 0;
l = c << 1;
a = e;
A = i;
u = r;
while (1) {
if ((f | 0) == (o | 0)) break;
vt(n[a >> 0] | 0, n[A >> 0] | 0, n[u >> 0] | 0, f);
vt(n[a + 1 >> 0] | 0, n[A >> 0] | 0, n[u >> 0] | 0, f + 4 | 0);
a = a + 2 | 0;
A = A + 1 | 0;
f = f + 8 | 0;
u = u + 1 | 0
}
if (t & 1 | 0) vt(n[e + l >> 0] | 0, n[i + c >> 0] | 0, n[r + c >> 0] | 0, s);
return
}
function rt(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var t = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
o = n + ((f & -2) * 3 | 0) | 0;
c = f >>> 1;
s = n + (c * 6 | 0) | 0;
l = f & -2;
a = e;
A = i;
t = r;
while (1) {
if ((n | 0) == (o | 0)) break;
gt(u[a >> 0] | 0, u[A >> 0] | 0, u[t >> 0] | 0, n);
gt(u[a + 1 >> 0] | 0, u[A >> 0] | 0, u[t >> 0] | 0, n + 3 | 0);
a = a + 2 | 0;
A = A + 1 | 0;
n = n + 6 | 0;
t = t + 1 | 0
}
if (f & 1 | 0) gt(u[e + l >> 0] | 0, u[i + c >> 0] | 0, u[r + c >> 0] | 0, s);
return
}
function nt(e, i, r, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
t = t | 0;
var u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
o = f + (t << 2 & -8) | 0;
s = t >>> 1;
c = s & 536870911;
s = f + (s << 3) | 0;
l = c << 1;
a = e;
A = i;
u = r;
while (1) {
if ((f | 0) == (o | 0)) break;
kt(n[a >> 0] | 0, n[A >> 0] | 0, n[u >> 0] | 0, f);
kt(n[a + 1 >> 0] | 0, n[A >> 0] | 0, n[u >> 0] | 0, f + 4 | 0);
a = a + 2 | 0;
A = A + 1 | 0;
f = f + 8 | 0;
u = u + 1 | 0
}
if (t & 1 | 0) kt(n[e + l >> 0] | 0, n[i + c >> 0] | 0, n[r + c >> 0] | 0, s);
return
}
function ft(e, i, r, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
t = t | 0;
var u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
o = f + (t << 2 & -8) | 0;
s = t >>> 1;
c = s & 536870911;
s = f + (s << 3) | 0;
l = c << 1;
a = e;
A = i;
u = r;
while (1) {
if ((f | 0) == (o | 0)) break;
ht(n[a >> 0] | 0, n[A >> 0] | 0, n[u >> 0] | 0, f);
ht(n[a + 1 >> 0] | 0, n[A >> 0] | 0, n[u >> 0] | 0, f + 4 | 0);
a = a + 2 | 0;
A = A + 1 | 0;
f = f + 8 | 0;
u = u + 1 | 0
}
if (t & 1 | 0) ht(n[e + l >> 0] | 0, n[i + c >> 0] | 0, n[r + c >> 0] | 0, s);
return
}
function tt(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var t = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
o = n + (f << 1 & -4) | 0;
s = f >>> 1;
c = s & 1073741823;
s = n + (s << 2) | 0;
l = c << 1;
a = e;
A = i;
t = r;
while (1) {
if ((n | 0) == (o | 0)) break;
bt(u[a >> 0] | 0, u[A >> 0] | 0, u[t >> 0] | 0, n);
bt(u[a + 1 >> 0] | 0, u[A >> 0] | 0, u[t >> 0] | 0, n + 2 | 0);
a = a + 2 | 0;
A = A + 1 | 0;
n = n + 4 | 0;
t = t + 1 | 0
}
if (f & 1 | 0) bt(u[e + l >> 0] | 0, u[i + c >> 0] | 0, u[r + c >> 0] | 0, s);
return
}
function ut(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var t = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
o = n + (f << 1 & -4) | 0;
s = f >>> 1;
c = s & 1073741823;
s = n + (s << 2) | 0;
l = c << 1;
a = e;
A = i;
t = r;
while (1) {
if ((n | 0) == (o | 0)) break;
at(u[a >> 0] | 0, u[A >> 0] | 0, u[t >> 0] | 0, n);
at(u[a + 1 >> 0] | 0, u[A >> 0] | 0, u[t >> 0] | 0, n + 2 | 0);
a = a + 2 | 0;
A = A + 1 | 0;
n = n + 4 | 0;
t = t + 1 | 0
}
if (f & 1 | 0) at(u[e + l >> 0] | 0, u[i + c >> 0] | 0, u[r + c >> 0] | 0, s);
return
}
function at(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
var t = 0,
u = 0;
t = At(e, r) | 0;
u = lt(e, i, r) | 0;
r = u << 3 & 224 | (ot(e, i) | 0) >>> 3;
n[f >> 0] = u >>> 5 | t & 248;
n[f + 1 >> 0] = r;
return
}
function At(e, i) {
e = e | 0;
i = i | 0;
e = ct(e, 19077) | 0;
return st(e + -14234 + (ct(i, 26149) | 0) | 0) | 0
}
function lt(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
e = ct(e, 19077) | 0;
i = ct(i, 6419) | 0;
return st(e + 8708 - i - (ct(r, 13320) | 0) | 0) | 0
}
function ot(e, i) {
e = e | 0;
i = i | 0;
e = ct(e, 19077) | 0;
return st(e + -17685 + (ct(i, 33050) | 0) | 0) | 0
}
function ct(e, i) {
e = e | 0;
i = i | 0;
return (v(i, e) | 0) >> 8 | 0
}
function st(e) {
e = e | 0;
if (e >>> 0 < 16384) e = e >>> 6;
else e = (e >> 31 & -255) + 255 | 0;
return e | 0
}
function bt(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
var t = 0,
u = 0;
t = At(e, r) | 0;
u = lt(e, i, r) | 0;
r = ot(e, i) | 0 | 15;
n[f >> 0] = u >>> 4 | t & 240;
n[f + 1 >> 0] = r;
return
}
function ht(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
n[f >> 0] = -1;
wt(e & 255, i & 255, r & 255, f + 1 | 0);
return
}
function wt(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
n[f >> 0] = At(e, r) | 0;
n[f + 1 >> 0] = lt(e, i, r) | 0;
n[f + 2 >> 0] = ot(e, i) | 0;
return
}
function kt(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
gt(e & 255, i & 255, r & 255, f);
n[f + 3 >> 0] = -1;
return
}
function gt(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
n[f >> 0] = ot(e, i) | 0;
n[f + 1 >> 0] = lt(e, i, r) | 0;
n[f + 2 >> 0] = At(e, r) | 0;
return
}
function vt(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
wt(e & 255, i & 255, r & 255, f);
n[f + 3 >> 0] = -1;
return
}
function Ct(e, i, r, n, f, u, a, A, l) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
u = u | 0;
a = a | 0;
A = A | 0;
l = l | 0;
var o = 0,
c = 0;
c = (i | 0) < (f | 0);
t[e >> 2] = c & 1;
o = (r | 0) < (u | 0);
t[e + 4 >> 2] = o & 1;
t[e + 44 >> 2] = i;
t[e + 48 >> 2] = r;
t[e + 52 >> 2] = f;
t[e + 56 >> 2] = u;
t[e + 60 >> 2] = 0;
t[e + 64 >> 2] = 0;
t[e + 68 >> 2] = n;
t[e + 72 >> 2] = a;
t[e + 8 >> 2] = A;
n = c ? f + -1 | 0 : i;
t[e + 36 >> 2] = n;
a = c ? i + -1 | 0 : f;
t[e + 40 >> 2] = a;
if (!c) {
c = Io(0, 1, a | 0, ((a | 0) < 0) << 31 >> 31 | 0) | 0;
m() | 0;
t[e + 12 >> 2] = c
}
i = o << 31 >> 31;
a = i + r | 0;
t[e + 28 >> 2] = a;
i = i + u | 0;
t[e + 32 >> 2] = i;
r = e + 24 | 0;
if (o) t[r >> 2] = i;
else {
t[r >> 2] = a;
n = v(a, n) | 0;
n = Io(0, u | 0, n | 0, ((n | 0) < 0) << 31 >> 31 | 0) | 0;
c = (n | 0) == (n | 0) & (m() | 0) == 0;
t[e + 20 >> 2] = c ? n : 0;
n = i
}
c = Io(0, 1, n | 0, ((n | 0) < 0) << 31 >> 31 | 0) | 0;
m() | 0;
t[e + 16 >> 2] = c;
t[e + 76 >> 2] = l;
t[e + 80 >> 2] = l + ((v(A, f) | 0) << 2);
Bo(l | 0, 0, v(f << 3, A) | 0) | 0;
Pt();
return
}
function It(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0;
n = t[e + 16 >> 2] | 0;
f = n + 1 >> 1;
u = t[i + 24 >> 2] | 0;
if (Lf(t[t[i >> 2] >> 2] | 0) | 0 ? (r = t[e + 104 >> 2] | 0, r | 0) : 0) pt(t[e + 20 >> 2] | 0, t[e + 32 >> 2] | 0, r, t[e >> 2] | 0, t[e + 12 >> 2] | 0, n, 0);
u = mt(t[e + 20 >> 2] | 0, t[e + 32 >> 2] | 0, n, u) | 0;
n = e + 36 | 0;
mt(t[e + 24 >> 2] | 0, t[n >> 2] | 0, f, t[i + 28 >> 2] | 0) | 0;
mt(t[e + 28 >> 2] | 0, t[n >> 2] | 0, f, t[i + 32 >> 2] | 0) | 0;
return u | 0
}
function dt(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0;
u = t[i >> 2] | 0;
n = t[u + 28 >> 2] | 0;
o = t[i + 16 >> 2] | 0;
c = u + 44 | 0;
f = t[c >> 2] | 0;
l = n + (v(f, o) | 0) | 0;
A = t[e + 104 >> 2] | 0;
if (!A) {
if (n | 0) Xf(l, t[e + 96 >> 2] | 0, r, f)
} else {
a = t[u + 16 >> 2] | 0;
f = u + 32 | 0;
u = t[f >> 2] | 0;
n = i + 36 | 0;
r = mt(A, t[e >> 2] | 0, t[e + 16 >> 2] | 0, t[n >> 2] | 0) | 0;
if ((r | 0) > 0) {
o = a + (v(u, o) | 0) | 0;
pt(o, t[f >> 2] | 0, l, t[c >> 2] | 0, t[(t[n >> 2] | 0) + 52 >> 2] | 0, r, 1)
}
}
return 0
}
function mt(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
t = 0,
u = 0;
f = 0;
while (1) {
if ((r | 0) <= 0) break;
t = lr(n, r, e, i) | 0;
u = e + (v(t, i) | 0) | 0;
e = u;
f = (yt(n) | 0) + f | 0;
r = r - t | 0
}
return f | 0
}
function pt(e, i, r, n, f, t, u) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
u = u | 0;
var a = 0;
a = 0;
while (1) {
if ((a | 0) >= (t | 0)) break;
qr(e, r, f, u);
a = a + 1 | 0;
e = e + i | 0;
r = r + n | 0
}
return
}
function yt(e) {
e = e | 0;
var i = 0;
i = 0;
while (1) {
if (!(hr(e) | 0)) break;
sr(e);
i = i + 1 | 0
}
return i | 0
}
function Pt() {
var e = 0;
if (!(Eo(9080) | 0)) {
if (!(t[1931] | 0)) e = 0;
else {
Dt();
e = t[2248] | 0
}
t[1931] = e;
_o(9080) | 0
}
return
}
function Dt() {
return
}
function Bt(e) {
e = e | 0;
var i = 0,
r = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0;
A = t[e + 68 >> 2] | 0;
u = t[e + 76 >> 2] | 0;
l = v(t[e + 8 >> 2] | 0, t[e + 52 >> 2] | 0) | 0;
a = t[e + 80 >> 2] | 0;
i = t[e + 24 >> 2] | 0;
e: do {
if (!i) {
e = e + 16 | 0;
i = 0;
while (1) {
if ((i | 0) >= (l | 0)) break e;
u = wo(t[e >> 2] | 0, 0, t[a + (i << 2) >> 2] | 0, 0) | 0;
ko(u | 0, m() | 0, -2147483648, 0) | 0;
n[A + i >> 0] = m() | 0;
i = i + 1 | 0
}
} else {
r = t[e + 32 >> 2] | 0;
r = Io(0, 0 - i | 0, r | 0, ((r | 0) < 0) << 31 >> 31 | 0) | 0;
m() | 0;
f = 0 - r | 0;
e = e + 16 | 0;
i = 0;
while (1) {
if ((i | 0) >= (l | 0)) break e;
b = wo(t[a + (i << 2) >> 2] | 0, 0, f | 0, 0) | 0;
s = m() | 0;
c = wo(r | 0, 0, t[u + (i << 2) >> 2] | 0, 0) | 0;
o = m() | 0;
s = ko(b | 0, s | 0, -2147483648, 0) | 0;
ko(s | 0, m() | 0, c | 0, o | 0) | 0;
o = m() | 0;
o = wo(o | 0, 0, t[e >> 2] | 0, 0) | 0;
ko(o | 0, m() | 0, -2147483648, 0) | 0;
n[A + i >> 0] = m() | 0;
i = i + 1 | 0
}
}
} while (0);
return
}
function Et(e) {
e = e | 0;
var i = 0,
r = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0;
u = t[e + 68 >> 2] | 0;
a = t[e + 76 >> 2] | 0;
A = v(t[e + 8 >> 2] | 0, t[e + 52 >> 2] | 0) | 0;
r = t[e + 80 >> 2] | 0;
f = v(t[e + 24 >> 2] | 0, 0 - (t[e + 16 >> 2] | 0) | 0) | 0;
e: do {
if (!f) {
i = e + 20 | 0;
e = 0;
while (1) {
if ((e | 0) >= (A | 0)) break e;
f = a + (e << 2) | 0;
r = wo(t[i >> 2] | 0, 0, t[f >> 2] | 0, 0) | 0;
ko(r | 0, m() | 0, -2147483648, 0) | 0;
n[u + e >> 0] = m() | 0;
t[f >> 2] = 0;
e = e + 1 | 0
}
} else {
i = e + 20 | 0;
e = 0;
while (1) {
if ((e | 0) >= (A | 0)) break e;
o = wo(t[r + (e << 2) >> 2] | 0, 0, f | 0, 0) | 0;
ko(o | 0, m() | 0, -2147483648, 0) | 0;
o = m() | 0;
l = a + (e << 2) | 0;
wo((t[l >> 2] | 0) - o | 0, 0, t[i >> 2] | 0, 0) | 0;
n[u + e >> 0] = m() | 0;
t[l >> 2] = o;
e = e + 1 | 0
}
}
} while (0);
return
}
function _t(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
C = 0;
b = t[e + 8 >> 2] | 0;
h = v(t[e + 52 >> 2] | 0, b) | 0;
w = e + 36 | 0;
k = e + 44 | 0;
g = e + 80 | 0;
s = e + 40 | 0;
o = 0;
while (1) {
if ((o | 0) >= (b | 0)) break;
a = t[w >> 2] | 0;
r = u[i + o >> 0] | 0;
n = o + b | 0;
if ((t[k >> 2] | 0) > 1) e = u[i + n >> 0] | 0;
else e = r;
c = t[g >> 2] | 0;
A = a;
f = o;
l = n;
n = a;
e: while (1) {
a = r - e | 0;
r = A;
while (1) {
t[c + (f << 2) >> 2] = (v(n, e) | 0) + (v(a, r) | 0);
f = f + b | 0;
if ((f | 0) >= (h | 0)) break e;
r = r - (t[s >> 2] | 0) | 0;
if ((r | 0) < 0) break;
n = t[w >> 2] | 0
}
C = l + b | 0;
n = t[w >> 2] | 0;
a = e;
e = u[i + C >> 0] | 0;
A = n + r | 0;
l = C;
r = a
}
o = o + 1 | 0
}
return
}
function Rt(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0;
o = t[e + 8 >> 2] | 0;
c = v(t[e + 52 >> 2] | 0, o) | 0;
s = e + 36 | 0;
b = e + 40 | 0;
h = e + 80 | 0;
l = e + 12 | 0;
f = 0;
while (1) {
if ((f | 0) >= (o | 0)) break;
e = 0;
r = 0;
A = f;
n = f;
while (1) {
if ((A | 0) >= (c | 0)) break;
a = 0;
e = (t[s >> 2] | 0) + e | 0;
while (1) {
if ((e | 0) <= 0) break;
w = u[i + n >> 0] | 0;
a = w;
e = e - (t[b >> 2] | 0) | 0;
r = r + w | 0;
n = n + o | 0
}
w = v(a, 0 - e | 0) | 0;
r = (v(t[b >> 2] | 0, r) | 0) - w | 0;
t[(t[h >> 2] | 0) + (A << 2) >> 2] = r;
r = wo(t[l >> 2] | 0, 0, w | 0, 0) | 0;
ko(r | 0, m() | 0, -2147483648, 0) | 0;
r = m() | 0;
A = A + o | 0
}
f = f + 1 | 0
}
return
}
function Gt(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
C = 0;
c = t[e + 16 >> 2] | 0;
s = c + 1 >> 1;
b = i + 24 | 0;
h = e + 20 | 0;
w = e + 32 | 0;
k = i + 28 | 0;
a = i + 16 | 0;
A = e + 24 | 0;
l = e + 36 | 0;
o = i + 32 | 0;
u = e + 28 | 0;
e = 0;
r = 0;
f = 0;
while (1) {
if ((c | 0) <= (e | 0)) break;
n = t[w >> 2] | 0;
e = (lr(t[b >> 2] | 0, c - e | 0, (t[h >> 2] | 0) + (v(n, e) | 0) | 0, n) | 0) + e | 0;
n = s - r | 0;
if (ar(t[k >> 2] | 0, n) | 0) {
g = t[l >> 2] | 0;
g = lr(t[k >> 2] | 0, n, (t[A >> 2] | 0) + (v(g, r) | 0) | 0, g) | 0;
C = t[l >> 2] | 0;
lr(t[o >> 2] | 0, n, (t[u >> 2] | 0) + (v(C, r) | 0) | 0, C) | 0;
r = g + r | 0
}
f = (fu(i, (t[a >> 2] | 0) + f | 0) | 0) + f | 0
}
return f | 0
}
function Tt() {
var e = 0;
if (!(Eo(9108) | 0)) {
if (!(t[1932] | 0)) e = 0;
else {
Qt();
e = t[2248] | 0
}
t[1932] = e;
_o(9108) | 0
}
return
}
function Mt(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0;
l = e + 104 | 0;
e: do {
if (t[l >> 2] | 0) {
o = t[i + 36 >> 2] | 0;
n = (t[i + 16 >> 2] | 0) + r | 0;
f = o + 60 | 0;
u = e + 8 | 0;
a = e + 16 | 0;
A = i + 52 | 0;
while (1) {
if ((r | 0) <= 0) break e;
b = t[f >> 2] | 0;
s = t[u >> 2] | 0;
c = t[e >> 2] | 0;
lr(o, s - b + (t[a >> 2] | 0) | 0, (t[l >> 2] | 0) + (v(c, b - s | 0) | 0) | 0, c) | 0;
r = r - (nc[t[A >> 2] & 7](i, n - r | 0, r) | 0) | 0
}
}
} while (0);
return 0
}
function St(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0;
l = t[e >> 2] | 0;
s = l + 20 | 0;
A = t[s >> 2] | 0;
c = (t[l + 16 >> 2] | 0) + (v(A, i) | 0) | 0;
l = t[l >> 2] | 0;
o = (l | 0) == 4 | (l | 0) == 9;
f = e + 36 | 0;
a = t[f >> 2] | 0;
u = t[a + 52 >> 2] | 0;
i = c + (o ? 0 : 3) | 0;
e = 0;
n = 0;
while (1) {
if (!((n | 0) < (r | 0) & (Ft(a) | 0) != 0)) break;
sr(a);
b = $r(t[(t[f >> 2] | 0) + 68 >> 2] | 0, 0, u, 1, i, 0) | 0 | e;
A = t[s >> 2] | 0;
i = i + A | 0;
e = b;
n = n + 1 | 0;
a = t[f >> 2] | 0
}
if ((Yf(l) | 0) != 0 & (e | 0) != 0) Nr(c, o & 1, u, n, A);
return n | 0
}
function xt(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0;
c = t[e >> 2] | 0;
b = c + 20 | 0;
f = t[b >> 2] | 0;
s = (t[c + 16 >> 2] | 0) + (v(f, i) | 0) | 0;
c = t[c >> 2] | 0;
l = e + 36 | 0;
e = t[l >> 2] | 0;
o = t[e + 52 >> 2] | 0;
a = s + 1 | 0;
i = 15;
A = 0;
while (1) {
if (!((A | 0) < (r | 0) & (Ft(e) | 0) != 0)) break;
sr(e);
e = 0;
while (1) {
if ((e | 0) >= (o | 0)) break;
f = (u[(t[(t[l >> 2] | 0) + 68 >> 2] | 0) + e >> 0] | 0) >>> 4;
h = a + (e << 1) | 0;
n[h >> 0] = f | n[h >> 0] & -16 & 255;
e = e + 1 | 0;
i = f & i
}
f = t[b >> 2] | 0;
a = a + f | 0;
A = A + 1 | 0;
e = t[l >> 2] | 0
}
if ((Yf(c) | 0) != 0 & (i | 0) != 15) Kr(s, o, A, f);
return A | 0
}
function Ft(e) {
e = e | 0;
if (!(Lt(e) | 0)) e = (t[e + 24 >> 2] | 0) < 1 & 1;
else e = 0;
return e | 0
}
function Lt(e) {
e = e | 0;
return (t[e + 64 >> 2] | 0) >= (t[e + 56 >> 2] | 0) | 0
}
function Qt() {
t[2217] = 8;
t[2219] = 9;
t[2216] = 10;
t[2218] = 11;
t[2220] = 12;
t[2221] = 13;
t[2222] = 14;
t[2223] = 8;
t[2224] = 9;
t[2225] = 12;
t[2226] = 13;
return
}
function Yt(e, i, r, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
t = t | 0;
var u = 0;
u = 0;
while (1) {
if ((u | 0) >= (t | 0)) break;
nu(n[e + u >> 0] | 0, n[i + u >> 0] | 0, n[r + u >> 0] | 0, f + (u << 2) | 0);
u = u + 1 | 0
}
return
}
function Ut(e, i, r, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
t = t | 0;
var u = 0;
u = 0;
while (1) {
if ((u | 0) >= (t | 0)) break;
ru(n[e + u >> 0] | 0, n[i + u >> 0] | 0, n[r + u >> 0] | 0, f + (u << 2) | 0);
u = u + 1 | 0
}
return
}
function Ht(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var t = 0;
t = 0;
while (1) {
if ((t | 0) >= (f | 0)) break;
eu(u[e + t >> 0] | 0, u[i + t >> 0] | 0, u[r + t >> 0] | 0, n + (t * 3 | 0) | 0);
t = t + 1 | 0
}
return
}
function Vt(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var t = 0;
t = 0;
while (1) {
if ((t | 0) >= (f | 0)) break;
iu(u[e + t >> 0] | 0, u[i + t >> 0] | 0, u[r + t >> 0] | 0, n + (t * 3 | 0) | 0);
t = t + 1 | 0
}
return
}
function Wt(e, i, r, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
t = t | 0;
var u = 0;
u = 0;
while (1) {
if ((u | 0) >= (t | 0)) break;
$t(n[e + u >> 0] | 0, n[i + u >> 0] | 0, n[r + u >> 0] | 0, f + (u << 2) | 0);
u = u + 1 | 0
}
return
}
function Zt(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var t = 0;
t = 0;
while (1) {
if ((t | 0) >= (f | 0)) break;
Nt(u[e + t >> 0] | 0, u[i + t >> 0] | 0, u[r + t >> 0] | 0, n + (t << 1) | 0);
t = t + 1 | 0
}
return
}
function zt(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var t = 0;
t = 0;
while (1) {
if ((t | 0) >= (f | 0)) break;
Ot(u[e + t >> 0] | 0, u[i + t >> 0] | 0, u[r + t >> 0] | 0, n + (t << 1) | 0);
t = t + 1 | 0
}
return
}
function Ot(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
var t = 0,
u = 0;
t = Jt(e, r) | 0;
u = jt(e, i, r) | 0;
r = u << 3 & 224 | (qt(e, i) | 0) >>> 3;
n[f >> 0] = u >>> 5 | t & 248;
n[f + 1 >> 0] = r;
return
}
function Jt(e, i) {
e = e | 0;
i = i | 0;
e = Kt(e, 19077) | 0;
return Xt(e + -14234 + (Kt(i, 26149) | 0) | 0) | 0
}
function jt(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
e = Kt(e, 19077) | 0;
i = Kt(i, 6419) | 0;
return Xt(e + 8708 - i - (Kt(r, 13320) | 0) | 0) | 0
}
function qt(e, i) {
e = e | 0;
i = i | 0;
e = Kt(e, 19077) | 0;
return Xt(e + -17685 + (Kt(i, 33050) | 0) | 0) | 0
}
function Kt(e, i) {
e = e | 0;
i = i | 0;
return (v(i, e) | 0) >> 8 | 0
}
function Xt(e) {
e = e | 0;
if (e >>> 0 < 16384) e = e >>> 6;
else e = (e >> 31 & -255) + 255 | 0;
return e | 0
}
function Nt(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
var t = 0,
u = 0;
t = Jt(e, r) | 0;
u = jt(e, i, r) | 0;
r = qt(e, i) | 0 | 15;
n[f >> 0] = u >>> 4 | t & 240;
n[f + 1 >> 0] = r;
return
}
function $t(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
n[f >> 0] = -1;
eu(e & 255, i & 255, r & 255, f + 1 | 0);
return
}
function eu(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
n[f >> 0] = Jt(e, r) | 0;
n[f + 1 >> 0] = jt(e, i, r) | 0;
n[f + 2 >> 0] = qt(e, i) | 0;
return
}
function iu(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
n[f >> 0] = qt(e, i) | 0;
n[f + 1 >> 0] = jt(e, i, r) | 0;
n[f + 2 >> 0] = Jt(e, r) | 0;
return
}
function ru(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
iu(e & 255, i & 255, r & 255, f);
n[f + 3 >> 0] = -1;
return
}
function nu(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
eu(e & 255, i & 255, r & 255, f);
n[f + 3 >> 0] = -1;
return
}
function fu(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0;
l = t[e >> 2] | 0;
a = t[8864 + (t[l >> 2] << 2) >> 2] | 0;
A = l + 20 | 0;
f = e + 28 | 0;
u = e + 24 | 0;
n = e + 32 | 0;
r = 0;
e = (t[l + 16 >> 2] | 0) + (v(t[A >> 2] | 0, i) | 0) | 0;
while (1) {
i = t[u >> 2] | 0;
if (!(Ft(i) | 0)) break;
if (!(Ft(t[f >> 2] | 0) | 0)) break;
sr(i);
sr(t[f >> 2] | 0);
sr(t[n >> 2] | 0);
l = t[u >> 2] | 0;
oc[a & 31](t[l + 68 >> 2] | 0, t[(t[f >> 2] | 0) + 68 >> 2] | 0, t[(t[n >> 2] | 0) + 68 >> 2] | 0, e, t[l + 52 >> 2] | 0);
r = r + 1 | 0;
e = e + (t[A >> 2] | 0) | 0
}
return r | 0
}
function tu() {
t[2201] = 1;
t[2203] = 2;
t[2207] = 1;
t[2208] = 2;
t[2200] = 3;
t[2202] = 4;
t[2204] = 5;
t[2205] = 6;
t[2206] = 7;
t[2209] = 5;
t[2210] = 6;
return
}
function uu(e, i, r, f, t, a, A, l, o) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
t = t | 0;
a = a | 0;
A = A | 0;
l = l | 0;
o = o | 0;
var c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
v = 0,
C = 0,
I = 0,
d = 0,
m = 0,
p = 0,
y = 0,
P = 0,
D = 0;
P = o + -1 | 0;
d = P >> 1;
s = (u[f >> 0] | 0) << 16 | (u[r >> 0] | 0);
b = (u[a >> 0] | 0) << 16 | (u[t >> 0] | 0);
y = (s * 3 | 0) + 131074 + b | 0;
nu(n[e >> 0] | 0, y >>> 2 & 255, y >>> 18 & 255, A);
y = (i | 0) != 0;
c = s + 131074 + (b * 3 | 0) | 0;
if (y) nu(n[i >> 0] | 0, c >>> 2 & 255, c >>> 18 & 255, l);
I = 1;
while (1) {
if ((I | 0) > (d | 0)) break;
k = (u[f + I >> 0] | 0) << 16 | (u[r + I >> 0] | 0);
g = (u[a + I >> 0] | 0) << 16 | (u[t + I >> 0] | 0);
v = k + b | 0;
C = v + 524296 + s + g | 0;
v = (C + (v << 1) | 0) >>> 3;
C = (C + (g + s << 1) | 0) >>> 3;
w = v + s | 0;
D = C + k | 0;
c = I << 1;
s = c + -1 | 0;
h = s << 2;
nu(n[e + s >> 0] | 0, w >>> 1 & 255, w >>> 17 & 255, A + h | 0);
w = I << 3;
nu(n[e + c >> 0] | 0, D >>> 1 & 255, D >>> 17 & 255, A + w | 0);
if (y) {
C = C + b | 0;
D = v + g | 0;
nu(n[i + s >> 0] | 0, C >>> 1 & 255, C >>> 17 & 255, l + h | 0);
nu(n[i + c >> 0] | 0, D >>> 1 & 255, D >>> 17 & 255, l + w | 0)
}
I = I + 1 | 0;
s = k;
b = g
}
if ((o & 1 | 0) == 0 ? (p = b + 131074 + (s * 3 | 0) | 0, m = P << 2, nu(n[e + P >> 0] | 0, p >>> 2 & 255, p >>> 18 & 255, A + m | 0), p = s + 131074 + (b * 3 | 0) | 0, y) : 0) nu(n[i + P >> 0] | 0, p >>> 2 & 255, p >>> 18 & 255, l + m | 0);
return
}
function au(e, i, r, f, t, a, A, l, o) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
t = t | 0;
a = a | 0;
A = A | 0;
l = l | 0;
o = o | 0;
var c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
v = 0,
C = 0,
I = 0,
d = 0,
m = 0,
p = 0,
y = 0,
P = 0,
D = 0;
P = o + -1 | 0;
d = P >> 1;
s = (u[f >> 0] | 0) << 16 | (u[r >> 0] | 0);
b = (u[a >> 0] | 0) << 16 | (u[t >> 0] | 0);
y = (s * 3 | 0) + 131074 + b | 0;
ru(n[e >> 0] | 0, y >>> 2 & 255, y >>> 18 & 255, A);
y = (i | 0) != 0;
c = s + 131074 + (b * 3 | 0) | 0;
if (y) ru(n[i >> 0] | 0, c >>> 2 & 255, c >>> 18 & 255, l);
I = 1;
while (1) {
if ((I | 0) > (d | 0)) break;
k = (u[f + I >> 0] | 0) << 16 | (u[r + I >> 0] | 0);
g = (u[a + I >> 0] | 0) << 16 | (u[t + I >> 0] | 0);
v = k + b | 0;
C = v + 524296 + s + g | 0;
v = (C + (v << 1) | 0) >>> 3;
C = (C + (g + s << 1) | 0) >>> 3;
w = v + s | 0;
D = C + k | 0;
c = I << 1;
s = c + -1 | 0;
h = s << 2;
ru(n[e + s >> 0] | 0, w >>> 1 & 255, w >>> 17 & 255, A + h | 0);
w = I << 3;
ru(n[e + c >> 0] | 0, D >>> 1 & 255, D >>> 17 & 255, A + w | 0);
if (y) {
C = C + b | 0;
D = v + g | 0;
ru(n[i + s >> 0] | 0, C >>> 1 & 255, C >>> 17 & 255, l + h | 0);
ru(n[i + c >> 0] | 0, D >>> 1 & 255, D >>> 17 & 255, l + w | 0)
}
I = I + 1 | 0;
s = k;
b = g
}
if ((o & 1 | 0) == 0 ? (p = b + 131074 + (s * 3 | 0) | 0, m = P << 2, ru(n[e + P >> 0] | 0, p >>> 2 & 255, p >>> 18 & 255, A + m | 0), p = s + 131074 + (b * 3 | 0) | 0, y) : 0) ru(n[i + P >> 0] | 0, p >>> 2 & 255, p >>> 18 & 255, l + m | 0);
return
}
function Au(e, i, r, n, f, t, a, A, l) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
a = a | 0;
A = A | 0;
l = l | 0;
var o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
v = 0,
C = 0,
I = 0,
d = 0,
m = 0,
p = 0,
y = 0,
P = 0;
y = l + -1 | 0;
I = y >> 1;
c = (u[n >> 0] | 0) << 16 | (u[r >> 0] | 0);
s = (u[t >> 0] | 0) << 16 | (u[f >> 0] | 0);
p = (c * 3 | 0) + 131074 + s | 0;
eu(u[e >> 0] | 0, p >>> 2 & 255, p >>> 18, a);
p = (i | 0) != 0;
o = c + 131074 + (s * 3 | 0) | 0;
if (p) eu(u[i >> 0] | 0, o >>> 2 & 255, o >>> 18, A);
C = 1;
while (1) {
if ((C | 0) > (I | 0)) break;
w = (u[n + C >> 0] | 0) << 16 | (u[r + C >> 0] | 0);
k = (u[t + C >> 0] | 0) << 16 | (u[f + C >> 0] | 0);
g = w + s | 0;
v = g + 524296 + c + k | 0;
g = (v + (g << 1) | 0) >>> 3;
v = (v + (k + c << 1) | 0) >>> 3;
h = g + c | 0;
P = v + w | 0;
o = C << 1;
c = o + -1 | 0;
b = c * 3 | 0;
eu(u[e + c >> 0] | 0, h >>> 1 & 255, h >>> 17, a + b | 0);
h = C * 6 | 0;
eu(u[e + o >> 0] | 0, P >>> 1 & 255, P >>> 17, a + h | 0);
if (p) {
v = v + s | 0;
P = g + k | 0;
eu(u[i + c >> 0] | 0, v >>> 1 & 255, v >>> 17, A + b | 0);
eu(u[i + o >> 0] | 0, P >>> 1 & 255, P >>> 17, A + h | 0)
}
C = C + 1 | 0;
c = w;
s = k
}
if ((l & 1 | 0) == 0 ? (m = s + 131074 + (c * 3 | 0) | 0, d = y * 3 | 0, eu(u[e + y >> 0] | 0, m >>> 2 & 255, m >>> 18, a + d | 0), m = c + 131074 + (s * 3 | 0) | 0, p) : 0) eu(u[i + y >> 0] | 0, m >>> 2 & 255, m >>> 18, A + d | 0);
return
}
function lu(e, i, r, n, f, t, a, A, l) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
a = a | 0;
A = A | 0;
l = l | 0;
var o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
v = 0,
C = 0,
I = 0,
d = 0,
m = 0,
p = 0,
y = 0,
P = 0;
y = l + -1 | 0;
I = y >> 1;
c = (u[n >> 0] | 0) << 16 | (u[r >> 0] | 0);
s = (u[t >> 0] | 0) << 16 | (u[f >> 0] | 0);
p = (c * 3 | 0) + 131074 + s | 0;
iu(u[e >> 0] | 0, p >>> 2 & 255, p >>> 18, a);
p = (i | 0) != 0;
o = c + 131074 + (s * 3 | 0) | 0;
if (p) iu(u[i >> 0] | 0, o >>> 2 & 255, o >>> 18, A);
C = 1;
while (1) {
if ((C | 0) > (I | 0)) break;
w = (u[n + C >> 0] | 0) << 16 | (u[r + C >> 0] | 0);
k = (u[t + C >> 0] | 0) << 16 | (u[f + C >> 0] | 0);
g = w + s | 0;
v = g + 524296 + c + k | 0;
g = (v + (g << 1) | 0) >>> 3;
v = (v + (k + c << 1) | 0) >>> 3;
h = g + c | 0;
P = v + w | 0;
o = C << 1;
c = o + -1 | 0;
b = c * 3 | 0;
iu(u[e + c >> 0] | 0, h >>> 1 & 255, h >>> 17, a + b | 0);
h = C * 6 | 0;
iu(u[e + o >> 0] | 0, P >>> 1 & 255, P >>> 17, a + h | 0);
if (p) {
v = v + s | 0;
P = g + k | 0;
iu(u[i + c >> 0] | 0, v >>> 1 & 255, v >>> 17, A + b | 0);
iu(u[i + o >> 0] | 0, P >>> 1 & 255, P >>> 17, A + h | 0)
}
C = C + 1 | 0;
c = w;
s = k
}
if ((l & 1 | 0) == 0 ? (m = s + 131074 + (c * 3 | 0) | 0, d = y * 3 | 0, iu(u[e + y >> 0] | 0, m >>> 2 & 255, m >>> 18, a + d | 0), m = c + 131074 + (s * 3 | 0) | 0, p) : 0) iu(u[i + y >> 0] | 0, m >>> 2 & 255, m >>> 18, A + d | 0);
return
}
function ou(e, i, r, f, t, a, A, l, o) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
t = t | 0;
a = a | 0;
A = A | 0;
l = l | 0;
o = o | 0;
var c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
v = 0,
C = 0,
I = 0,
d = 0,
m = 0,
p = 0,
y = 0,
P = 0,
D = 0;
P = o + -1 | 0;
d = P >> 1;
s = (u[f >> 0] | 0) << 16 | (u[r >> 0] | 0);
b = (u[a >> 0] | 0) << 16 | (u[t >> 0] | 0);
y = (s * 3 | 0) + 131074 + b | 0;
$t(n[e >> 0] | 0, y >>> 2 & 255, y >>> 18 & 255, A);
y = (i | 0) != 0;
c = s + 131074 + (b * 3 | 0) | 0;
if (y) $t(n[i >> 0] | 0, c >>> 2 & 255, c >>> 18 & 255, l);
I = 1;
while (1) {
if ((I | 0) > (d | 0)) break;
k = (u[f + I >> 0] | 0) << 16 | (u[r + I >> 0] | 0);
g = (u[a + I >> 0] | 0) << 16 | (u[t + I >> 0] | 0);
v = k + b | 0;
C = v + 524296 + s + g | 0;
v = (C + (v << 1) | 0) >>> 3;
C = (C + (g + s << 1) | 0) >>> 3;
w = v + s | 0;
D = C + k | 0;
c = I << 1;
s = c + -1 | 0;
h = s << 2;
$t(n[e + s >> 0] | 0, w >>> 1 & 255, w >>> 17 & 255, A + h | 0);
w = I << 3;
$t(n[e + c >> 0] | 0, D >>> 1 & 255, D >>> 17 & 255, A + w | 0);
if (y) {
C = C + b | 0;
D = v + g | 0;
$t(n[i + s >> 0] | 0, C >>> 1 & 255, C >>> 17 & 255, l + h | 0);
$t(n[i + c >> 0] | 0, D >>> 1 & 255, D >>> 17 & 255, l + w | 0)
}
I = I + 1 | 0;
s = k;
b = g
}
if ((o & 1 | 0) == 0 ? (p = b + 131074 + (s * 3 | 0) | 0, m = P << 2, $t(n[e + P >> 0] | 0, p >>> 2 & 255, p >>> 18 & 255, A + m | 0), p = s + 131074 + (b * 3 | 0) | 0, y) : 0) $t(n[i + P >> 0] | 0, p >>> 2 & 255, p >>> 18 & 255, l + m | 0);
return
}
function cu(e, i, r, n, f, t, a, A, l) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
a = a | 0;
A = A | 0;
l = l | 0;
var o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
v = 0,
C = 0,
I = 0,
d = 0,
m = 0,
p = 0,
y = 0,
P = 0;
y = l + -1 | 0;
I = y >> 1;
c = (u[n >> 0] | 0) << 16 | (u[r >> 0] | 0);
s = (u[t >> 0] | 0) << 16 | (u[f >> 0] | 0);
p = (c * 3 | 0) + 131074 + s | 0;
Nt(u[e >> 0] | 0, p >>> 2 & 255, p >>> 18, a);
p = (i | 0) != 0;
o = c + 131074 + (s * 3 | 0) | 0;
if (p) Nt(u[i >> 0] | 0, o >>> 2 & 255, o >>> 18, A);
C = 1;
while (1) {
if ((C | 0) > (I | 0)) break;
w = (u[n + C >> 0] | 0) << 16 | (u[r + C >> 0] | 0);
k = (u[t + C >> 0] | 0) << 16 | (u[f + C >> 0] | 0);
g = w + s | 0;
v = g + 524296 + c + k | 0;
g = (v + (g << 1) | 0) >>> 3;
v = (v + (k + c << 1) | 0) >>> 3;
h = g + c | 0;
P = v + w | 0;
o = C << 1;
c = o + -1 | 0;
b = c << 1;
Nt(u[e + c >> 0] | 0, h >>> 1 & 255, h >>> 17, a + b | 0);
h = C << 2;
Nt(u[e + o >> 0] | 0, P >>> 1 & 255, P >>> 17, a + h | 0);
if (p) {
v = v + s | 0;
P = g + k | 0;
Nt(u[i + c >> 0] | 0, v >>> 1 & 255, v >>> 17, A + b | 0);
Nt(u[i + o >> 0] | 0, P >>> 1 & 255, P >>> 17, A + h | 0)
}
C = C + 1 | 0;
c = w;
s = k
}
if ((l & 1 | 0) == 0 ? (m = s + 131074 + (c * 3 | 0) | 0, d = y << 1, Nt(u[e + y >> 0] | 0, m >>> 2 & 255, m >>> 18, a + d | 0), m = c + 131074 + (s * 3 | 0) | 0, p) : 0) Nt(u[i + y >> 0] | 0, m >>> 2 & 255, m >>> 18, A + d | 0);
return
}
function su(e, i, r, n, f, t, a, A, l) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
a = a | 0;
A = A | 0;
l = l | 0;
var o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
v = 0,
C = 0,
I = 0,
d = 0,
m = 0,
p = 0,
y = 0,
P = 0;
y = l + -1 | 0;
I = y >> 1;
c = (u[n >> 0] | 0) << 16 | (u[r >> 0] | 0);
s = (u[t >> 0] | 0) << 16 | (u[f >> 0] | 0);
p = (c * 3 | 0) + 131074 + s | 0;
Ot(u[e >> 0] | 0, p >>> 2 & 255, p >>> 18, a);
p = (i | 0) != 0;
o = c + 131074 + (s * 3 | 0) | 0;
if (p) Ot(u[i >> 0] | 0, o >>> 2 & 255, o >>> 18, A);
C = 1;
while (1) {
if ((C | 0) > (I | 0)) break;
w = (u[n + C >> 0] | 0) << 16 | (u[r + C >> 0] | 0);
k = (u[t + C >> 0] | 0) << 16 | (u[f + C >> 0] | 0);
g = w + s | 0;
v = g + 524296 + c + k | 0;
g = (v + (g << 1) | 0) >>> 3;
v = (v + (k + c << 1) | 0) >>> 3;
h = g + c | 0;
P = v + w | 0;
o = C << 1;
c = o + -1 | 0;
b = c << 1;
Ot(u[e + c >> 0] | 0, h >>> 1 & 255, h >>> 17, a + b | 0);
h = C << 2;
Ot(u[e + o >> 0] | 0, P >>> 1 & 255, P >>> 17, a + h | 0);
if (p) {
v = v + s | 0;
P = g + k | 0;
Ot(u[i + c >> 0] | 0, v >>> 1 & 255, v >>> 17, A + b | 0);
Ot(u[i + o >> 0] | 0, P >>> 1 & 255, P >>> 17, A + h | 0)
}
C = C + 1 | 0;
c = w;
s = k
}
if ((l & 1 | 0) == 0 ? (m = s + 131074 + (c * 3 | 0) | 0, d = y << 1, Ot(u[e + y >> 0] | 0, m >>> 2 & 255, m >>> 18, a + d | 0), m = c + 131074 + (s * 3 | 0) | 0, p) : 0) Ot(u[i + y >> 0] | 0, m >>> 2 & 255, m >>> 18, A + d | 0);
return
}
function bu(e) {
e = e | 0;
return e >>> 0 < 11 | 0
}
function hu(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0;
u = t[r >> 2] | 0;
f = t[n >> 2] | 0;
A = ((i | 0) < 0) << 31 >> 31;
a = ((e | 0) < 0) << 31 >> 31;
if ((i | 0) > 0 & (u | 0) == 0) {
l = wo(f | 0, ((f | 0) < 0) << 31 >> 31 | 0, e | 0, a | 0) | 0;
u = m() | 0;
o = ko(i | 0, A | 0, -1, -1) | 0;
u = ko(o | 0, m() | 0, l | 0, u | 0) | 0;
u = Io(u | 0, m() | 0, i | 0, A | 0) | 0;
m() | 0
}
if ((e | 0) > 0 & (f | 0) == 0) {
o = wo(u | 0, ((u | 0) < 0) << 31 >> 31 | 0, i | 0, A | 0) | 0;
f = m() | 0;
l = ko(e | 0, a | 0, -1, -1) | 0;
f = ko(l | 0, m() | 0, o | 0, f | 0) | 0;
f = Io(f | 0, m() | 0, e | 0, a | 0) | 0;
m() | 0
}
if ((u | 0) < 1 | (f | 0) < 1) f = 0;
else {
t[r >> 2] = u;
t[n >> 2] = f;
f = 1
}
return f | 0
}
function wu(e, i) {
e = e | 0;
i = i | 0;
if ((i & -256 | 0) == 512)
if (!e) e = 1;
else {
i = e + 108 | 0;
do {
t[e >> 2] = 0;
e = e + 4 | 0
} while ((e | 0) < (i | 0));
e = 1
}
else e = 0;
return e | 0
}
function ku() {
t[2132] = 0;
t[2133] = 15;
t[2134] = 16;
t[2135] = 17;
t[2128] = 0;
t[2129] = 15;
t[2130] = 16;
t[2131] = 17;
return
}
function gu(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
var t = 0,
a = 0;
if (!e) e = 0;
else e = n[e >> 0] | 0;
t = 0;
while (1) {
if ((t | 0) >= (f | 0)) break;
a = (u[i + t >> 0] | 0) + (e & 255) & 255;
n[r + t >> 0] = a;
t = t + 1 | 0;
e = a
}
return
}
function vu(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
var t = 0;
e: do {
if (!e) gu(0, i, r, f);
else {
t = 0;
while (1) {
if ((t | 0) >= (f | 0)) break e;
n[r + t >> 0] = (u[i + t >> 0] | 0) + (u[e + t >> 0] | 0);
t = t + 1 | 0
}
}
} while (0);
return
}
function Cu(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
var t = 0,
a = 0,
A = 0,
l = 0,
o = 0;
e: do {
if (!e) gu(0, i, r, f);
else {
A = n[e >> 0] | 0;
t = 0;
a = A;
while (1) {
if ((t | 0) >= (f | 0)) break e;
l = n[e + t >> 0] | 0;
o = u[i + t >> 0] | 0;
o = (Pu(a, l, A) | 0) + o & 255;
n[r + t >> 0] = o;
t = t + 1 | 0;
a = o;
A = l
}
}
} while (0);
return
}
function Iu(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
Bu(e, i, n, r, f);
return
}
function du(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
Du(e, i, n, r, f);
return
}
function mu(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
pu(e, i, n, r, f);
return
}
function pu(e, i, r, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
t = t | 0;
var a = 0,
A = 0,
l = 0,
o = 0,
c = 0;
n[t >> 0] = n[e >> 0] | 0;
yu(e + 1 | 0, e, t + 1 | 0, i + -1 | 0);
o = ~r;
l = 1;
while (1) {
A = e + r | 0;
t = t + r | 0;
if ((l | 0) >= (f | 0)) break;
yu(A, e, t, 1);
a = 1;
while (1) {
if ((a | 0) >= (i | 0)) break;
c = Pu(n[A + (a + -1) >> 0] | 0, n[e + a >> 0] | 0, n[A + (a + o) >> 0] | 0) | 0;
n[t + a >> 0] = (u[A + a >> 0] | 0) - c;
a = a + 1 | 0
}
l = l + 1 | 0;
e = A
}
return
}
function yu(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
var t = 0;
t = 0;
while (1) {
if ((t | 0) >= (f | 0)) break;
n[r + t >> 0] = (u[e + t >> 0] | 0) - (u[i + t >> 0] | 0);
t = t + 1 | 0
}
return
}
function Pu(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
r = (i & 255) + (e & 255) - (r & 255) | 0;
return (r >>> 0 < 256 ? r : (r >> 31 & -255) + 255 | 0) | 0
}
function Du(e, i, r, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
t = t | 0;
var u = 0,
a = 0;
n[t >> 0] = n[e >> 0] | 0;
yu(e + 1 | 0, e, t + 1 | 0, i + -1 | 0);
a = 1;
while (1) {
u = e + r | 0;
t = t + r | 0;
if ((a | 0) >= (f | 0)) break;
yu(u, e, t, i);
a = a + 1 | 0;
e = u
}
return
}
function Bu(e, i, r, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
t = t | 0;
var u = 0,
a = 0;
n[t >> 0] = n[e >> 0] | 0;
a = i + -1 | 0;
yu(e + 1 | 0, e, t + 1 | 0, a);
u = 1;
i = t;
while (1) {
t = e + r | 0;
i = i + r | 0;
if ((u | 0) >= (f | 0)) break;
yu(t, e, i, 1);
yu(t + 1 | 0, t, i + 1 | 0, a);
u = u + 1 | 0;
e = t
}
return
}
function Eu(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0,
f = 0,
u = 0,
a = 0;
do {
if (e) {
r = (_u(t[e >> 2] | 0) | 0) == 0;
n = (t[e + 8 >> 2] | 0) + -1 | 0;
if (!r) {
r = e + 20 | 0;
i = t[r >> 2] | 0;
n = v(i, n) | 0;
e = e + 16 | 0;
t[e >> 2] = (t[e >> 2] | 0) + n;
t[r >> 2] = 0 - i;
e = 0;
break
}
u = e + 32 | 0;
i = t[u >> 2] | 0;
a = v(i, n) | 0;
r = e + 16 | 0;
t[r >> 2] = (t[r >> 2] | 0) + a;
t[u >> 2] = 0 - i;
u = n >> 1;
i = e + 36 | 0;
r = t[i >> 2] | 0;
a = v(r, u) | 0;
f = e + 20 | 0;
t[f >> 2] = (t[f >> 2] | 0) + a;
t[i >> 2] = 0 - r;
i = e + 40 | 0;
r = t[i >> 2] | 0;
u = v(r, u) | 0;
f = e + 24 | 0;
t[f >> 2] = (t[f >> 2] | 0) + u;
t[i >> 2] = 0 - r;
i = e + 28 | 0;
r = t[i >> 2] | 0;
if (!r) e = 0;
else {
e = e + 44 | 0;
a = t[e >> 2] | 0;
t[i >> 2] = r + (v(a, n) | 0);
t[e >> 2] = 0 - a;
e = 0
}
} else e = 2
} while (0);
return e | 0
}
function _u(e) {
e = e | 0;
return e >>> 0 < 11 | 0
}
function Ru(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
s = F;
F = F + 16 | 0;
l = s + 4 | 0;
o = s;
do {
if (!((i | 0) < 1 | ((e | 0) < 1 | (n | 0) == 0))) {
c = (r | 0) != 0;
if (c) {
if (t[r + 8 >> 2] | 0) {
f = t[r + 20 >> 2] | 0;
A = t[r + 24 >> 2] | 0;
u = t[r + 12 >> 2] | 0;
a = t[r + 16 >> 2] | 0;
if ((A | 0) < 1 | ((f | 0) < 1 | (a | u | 0) < 0)) {
i = 2;
break
}
if (((u & -2) + f | 0) > (e | 0) | ((a & -2) + A | 0) > (i | 0)) {
i = 2;
break
} else {
e = f;
i = A
}
}
if (t[r + 28 >> 2] | 0) {
t[l >> 2] = t[r + 32 >> 2];
t[o >> 2] = t[r + 36 >> 2];
A = (hu(e, i, l, o) | 0) == 0;
if (A) {
i = 2;
break
} else {
e = t[l >> 2] | 0;
i = t[o >> 2] | 0
}
}
}
t[n + 4 >> 2] = e;
t[n + 8 >> 2] = i;
i = Gu(n) | 0;
if (!((i | 0) != 0 | c ^ 1))
if (!(t[r + 48 >> 2] | 0)) i = 0;
else i = Eu(n) | 0
} else i = 2
} while (0);
F = s;
return i | 0
}
function Gu(e) {
e = e | 0;
var i = 0,
r = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0;
u = t[e + 4 >> 2] | 0;
f = t[e + 8 >> 2] | 0;
w = t[e >> 2] | 0;
e: do {
if (!((u | 0) < 1 | (f | 0) < 1) ? (Tu(w) | 0) != 0 : 0) {
do {
if ((t[e + 12 >> 2] | 0) < 1 ? (h = e + 80 | 0, (t[h >> 2] | 0) == 0) : 0) {
r = ((u | 0) < 0) << 31 >> 31;
i = n[7788 + w >> 0] | 0;
b = wo(i & 255 | 0, 0, u | 0, r | 0) | 0;
s = m() | 0;
if (s >>> 0 > 0 | (s | 0) == 0 & b >>> 0 > 4294967295) {
i = 2;
break e
}
c = v(u, i & 255) | 0;
i = ((f | 0) < 0) << 31 >> 31;
s = wo(c | 0, ((c | 0) < 0) << 31 >> 31 | 0, f | 0, i | 0) | 0;
o = m() | 0;
b = (_u(w) | 0) == 0;
if (b) {
l = (u + 1 | 0) / 2 | 0;
a = (f + 1 | 0) / 2 | 0;
a = wo(a | 0, ((a | 0) < 0) << 31 >> 31 | 0, l | 0, ((l | 0) < 0) << 31 >> 31 | 0) | 0;
g = m() | 0;
k = (w | 0) == 12;
A = wo(f | 0, i | 0, u | 0, r | 0) | 0;
r = m() | 0;
u = k ? u : 0;
i = g;
A = k ? A : 0;
r = k ? r : 0
} else {
l = 0;
u = 0;
a = 0;
i = 0;
A = 0;
r = 0
}
f = po(a | 0, i | 0, 1) | 0;
i = m() | 0;
g = ko(A | 0, r | 0, s | 0, o | 0) | 0;
i = ko(g | 0, m() | 0, f | 0, i | 0) | 0;
i = mi(i, m() | 0, 1) | 0;
if (!i) {
i = 1;
break e
}
t[h >> 2] = i;
t[e + 16 >> 2] = i;
if (!b) {
t[e + 20 >> 2] = c;
t[e + 24 >> 2] = s;
break
}
t[e + 32 >> 2] = c;
t[e + 48 >> 2] = s;
i = i + s | 0;
t[e + 20 >> 2] = i;
t[e + 36 >> 2] = l;
t[e + 52 >> 2] = a;
t[e + 24 >> 2] = i + a;
t[e + 40 >> 2] = l;
t[e + 56 >> 2] = a;
if ((w | 0) == 12) t[e + 28 >> 2] = i + f;
t[e + 60 >> 2] = A;
t[e + 44 >> 2] = u
}
} while (0);
i = Mu(e) | 0
} else i = 2
} while (0);
return i | 0
}
function Tu(e) {
e = e | 0;
return e >>> 0 < 13 | 0
}
function Mu(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0,
f = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
C = 0,
I = 0;
r = t[e >> 2] | 0;
a = t[e + 4 >> 2] | 0;
i = t[e + 8 >> 2] | 0;
e: do {
if (!(Tu(r) | 0)) i = 2;
else {
do {
if (!(_u(r) | 0)) {
k = (a + 1 | 0) / 2 | 0;
w = t[e + 32 >> 2] | 0;
w = (w | 0) > -1 ? w : 0 - w | 0;
g = t[e + 36 >> 2] | 0;
g = (g | 0) > -1 ? g : 0 - g | 0;
C = t[e + 40 >> 2] | 0;
C = (C | 0) > -1 ? C : 0 - C | 0;
n = t[e + 44 >> 2] | 0;
n = (n | 0) > -1 ? n : 0 - n | 0;
f = i + -1 | 0;
A = ((f | 0) < 0) << 31 >> 31;
b = wo(w | 0, ((w | 0) < 0) << 31 >> 31 | 0, f | 0, A | 0) | 0;
l = ((a | 0) < 0) << 31 >> 31;
b = ko(b | 0, m() | 0, a | 0, l | 0) | 0;
h = m() | 0;
I = ((i + 1 | 0) / 2 | 0) + -1 | 0;
o = ((I | 0) < 0) << 31 >> 31;
c = wo(g | 0, ((g | 0) < 0) << 31 >> 31 | 0, I | 0, o | 0) | 0;
i = ((k | 0) < 0) << 31 >> 31;
c = ko(c | 0, m() | 0, k | 0, i | 0) | 0;
s = m() | 0;
o = wo(C | 0, ((C | 0) < 0) << 31 >> 31 | 0, I | 0, o | 0) | 0;
i = ko(o | 0, m() | 0, k | 0, i | 0) | 0;
o = m() | 0;
i = (t[e + 24 >> 2] | 0) != 0 & ((t[e + 20 >> 2] | 0) != 0 & ((t[e + 16 >> 2] | 0) != 0 & ((C | 0) >= (k | 0) & ((g | 0) >= (k | 0) & ((w | 0) >= (a | 0) & ((h >>> 0 < 0 | ((h | 0) == 0 ? b >>> 0 <= (t[e + 48 >> 2] | 0) >>> 0 : 0)) & (s >>> 0 < 0 | ((s | 0) == 0 ? c >>> 0 <= (t[e + 52 >> 2] | 0) >>> 0 : 0)) & (o >>> 0 < 0 | ((o | 0) == 0 ? i >>> 0 <= (t[e + 56 >> 2] | 0) >>> 0 : 0))))))));
if ((r | 0) == 12) {
I = wo(n | 0, ((n | 0) < 0) << 31 >> 31 | 0, f | 0, A | 0) | 0;
I = ko(I | 0, m() | 0, a | 0, l | 0) | 0;
C = m() | 0;
if ((t[e + 28 >> 2] | 0) != 0 & ((n | 0) >= (a | 0) & i & (C >>> 0 < 0 | ((C | 0) == 0 ? I >>> 0 <= (t[e + 60 >> 2] | 0) >>> 0 : 0)))) break;
else {
i = 2;
break e
}
} else if (i) break;
else {
i = 2;
break e
}
} else {
k = t[e + 20 >> 2] | 0;
k = (k | 0) > -1 ? k : 0 - k | 0;
C = i + -1 | 0;
C = wo(k | 0, ((k | 0) < 0) << 31 >> 31 | 0, C | 0, ((C | 0) < 0) << 31 >> 31 | 0) | 0;
I = m() | 0;
g = v(a, u[7788 + r >> 0] | 0) | 0;
I = ko(C | 0, I | 0, g | 0, ((g | 0) < 0) << 31 >> 31 | 0) | 0;
C = m() | 0;
if (!((t[e + 16 >> 2] | 0) != 0 & ((k | 0) >= (g | 0) & (C >>> 0 < 0 | ((C | 0) == 0 ? I >>> 0 <= (t[e + 24 >> 2] | 0) >>> 0 : 0))))) {
i = 2;
break e
}
}
} while (0);
i = 0
}
} while (0);
return i | 0
}
function Su(e, i) {
e = e | 0;
i = i | 0;
if ((e | 0) == 0 | (i & -256 | 0) != 512) e = 0;
else {
i = e + 84 | 0;
do {
t[e >> 2] = 0;
e = e + 4 | 0
} while ((e | 0) < (i | 0));
e = 1
}
return e | 0
}
function xu(e) {
e = e | 0;
var i = 0;
if (e | 0) {
i = e + 80 | 0;
if ((t[e + 12 >> 2] | 0) < 1) ii(t[i >> 2] | 0);
t[i >> 2] = 0
}
return
}
function Fu(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0;
if ((e | 0) != 0 & (i | 0) != 0) {
r = i;
n = e;
f = r + 84 | 0;
do {
t[r >> 2] = t[n >> 2];
r = r + 4 | 0;
n = n + 4 | 0
} while ((r | 0) < (f | 0));
if (t[e + 80 >> 2] | 0) {
t[i + 12 >> 2] = 1;
t[i + 80 >> 2] = 0
}
}
return
}
function Lu(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
a = 0,
A = 0;
f = e + 4 | 0;
t[i + 4 >> 2] = t[f >> 2];
a = e + 8 | 0;
t[i + 8 >> 2] = t[a >> 2];
do {
if (!(Mu(i) | 0)) {
r = t[e >> 2] | 0;
A = (_u(r) | 0) == 0;
n = t[e + 16 >> 2] | 0;
if (!A) {
A = v(t[f >> 2] | 0, u[7788 + r >> 0] | 0) | 0;
Qu(n, t[e + 20 >> 2] | 0, t[i + 16 >> 2] | 0, t[i + 20 >> 2] | 0, A, t[a >> 2] | 0);
e = 0;
break
}
Qu(n, t[e + 32 >> 2] | 0, t[i + 16 >> 2] | 0, t[i + 32 >> 2] | 0, t[f >> 2] | 0, t[a >> 2] | 0);
Qu(t[e + 20 >> 2] | 0, t[e + 36 >> 2] | 0, t[i + 20 >> 2] | 0, t[i + 36 >> 2] | 0, ((t[f >> 2] | 0) + 1 | 0) / 2 | 0, ((t[a >> 2] | 0) + 1 | 0) / 2 | 0);
Qu(t[e + 24 >> 2] | 0, t[e + 40 >> 2] | 0, t[i + 24 >> 2] | 0, t[i + 40 >> 2] | 0, ((t[f >> 2] | 0) + 1 | 0) / 2 | 0, ((t[a >> 2] | 0) + 1 | 0) / 2 | 0);
if (!(Yu(t[e >> 2] | 0) | 0)) e = 0;
else {
Qu(t[e + 28 >> 2] | 0, t[e + 44 >> 2] | 0, t[i + 28 >> 2] | 0, t[i + 44 >> 2] | 0, t[f >> 2] | 0, t[a >> 2] | 0);
e = 0
}
} else e = 2
} while (0);
return e | 0
}
function Qu(e, i, r, n, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
while (1) {
if ((t | 0) <= 0) break;
Po(r | 0, e | 0, f | 0) | 0;
t = t + -1 | 0;
e = e + i | 0;
r = r + n | 0
}
return
}
function Yu(e) {
e = e | 0;
switch (e | 0) {
case 1:
case 3:
case 4:
case 5:
case 12: {
e = 1;
break
}
default:
e = (Uu(e) | 0) != 0 & 1
}
return e | 0
}
function Uu(e) {
e = e | 0;
return (e + -7 | 0) >>> 0 < 4 | 0
}
function Hu(e, i) {
e = e | 0;
i = i | 0;
if ((t[e + 12 >> 2] | 0) > 1 ? (i | 0) != 0 & (Uu(t[e >> 2] | 0) | 0) != 0 : 0) e = (t[i + 8 >> 2] | 0) != 0 & 1;
else e = 0;
return e | 0
}
function Vu(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
a = 0;
do {
if (e | 0) {
r = t[e + 44 >> 2] | 0;
do {
if ((r | 0) >= 0) {
if ((r | 0) <= 100) {
r = r * 255 | 0;
if ((r | 0) > 99) a = (r | 0) / 100 | 0;
else break
} else a = 255;
n = 0;
f = 0;
while (1) {
if ((n | 0) == 4) break;
r = t[i + 776 + (n << 5) + 24 >> 2] | 0;
if ((r | 0) < 12) {
r = (v(a, u[7801 + ((r | 0) > 0 ? r : 0) >> 0] | 0) | 0) >> 3;
t[i + 776 + (n << 5) + 28 >> 2] = r
} else r = t[i + 776 + (n << 5) + 28 >> 2] | 0;
n = n + 1 | 0;
f = r | f
}
if (f | 0) {
Wu(i + 544 | 0, 1);
t[i + 540 >> 2] = 1
}
}
} while (0);
n = t[e + 52 >> 2] | 0;
r = i + 2372 | 0;
t[r >> 2] = n;
if ((n | 0) > 100) {
t[r >> 2] = 100;
break
}
if ((n | 0) < 0) t[r >> 2] = 0
}
} while (0);
return
}
function Wu(e, i) {
e = e | 0;
i = +i;
var r = 0;
Po(e + 8 | 0, 3936, 220) | 0;
t[e >> 2] = 0;
t[e + 4 >> 2] = 31;
if (!(i < 0))
if (i > 1) r = 256;
else r = ~~(i * 256) >>> 0;
else r = 0;
t[e + 228 >> 2] = r;
return
}
function Zu(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0;
l = e + 160 | 0;
if ((t[e + 2308 >> 2] | 0) > 0 ? (r = t[e + 2300 >> 2] | 0, (r | 0) >= (t[e + 300 >> 2] | 0)) : 0) u = (r | 0) <= (t[e + 308 >> 2] | 0);
else u = 0;
f = u & 1;
a = e + 148 | 0;
if (t[a >> 2] | 0) {
A = e + 124 | 0;
if (!((ic[t[(Ju() | 0) + 8 >> 2] & 15](A) | 0) & 1)) r = 0;
else {
n = e + 180 | 0;
r = n + 108 | 0;
do {
t[n >> 2] = t[i >> 2];
n = n + 4 | 0;
i = i + 4 | 0
} while ((n | 0) < (r | 0));
r = e + 152 | 0;
t[l >> 2] = t[r >> 2];
t[e + 164 >> 2] = t[e + 2300 >> 2];
t[e + 168 >> 2] = f;
if ((t[a >> 2] | 0) == 2) {
f = e + 176 | 0;
a = t[f >> 2] | 0;
l = e + 2304 | 0;
t[f >> 2] = t[l >> 2];
t[l >> 2] = a
} else zu(e, l);
if (u) {
u = e + 172 | 0;
a = t[u >> 2] | 0;
l = e + 2260 | 0;
t[u >> 2] = t[l >> 2];
t[l >> 2] = a
}
uc[t[(Ju() | 0) + 12 >> 2] & 31](A);
l = (t[r >> 2] | 0) + 1 | 0;
t[r >> 2] = (l | 0) == (t[e + 156 >> 2] | 0) ? 0 : l;
return 1
}
} else {
t[e + 164 >> 2] = t[e + 2300 >> 2];
t[e + 168 >> 2] = f;
zu(e, l);
r = Ou(e, i) | 0
}
return r | 0
}
function zu(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
f = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
C = 0,
I = 0,
d = 0,
m = 0,
p = 0,
y = 0,
P = 0,
D = 0,
B = 0,
E = 0,
_ = 0,
R = 0,
G = 0,
T = 0,
M = 0,
S = 0,
x = 0,
F = 0,
L = 0,
Q = 0,
Y = 0;
L = t[i + 4 >> 2] | 0;
f = t[i >> 2] | 0;
A = t[e + 2264 >> 2] | 0;
Q = A + 40 | 0;
Y = A + 584 | 0;
r = 0;
while (1) {
if ((r | 0) == 16) break;
n[Q + ((r << 5) + -1) >> 0] = -127;
r = r + 1 | 0
}
F = A + 600 | 0;
r = 0;
while (1) {
if ((r | 0) == 8) break;
x = (r << 5) + -1 | 0;
n[Y + x >> 0] = -127;
n[F + x >> 0] = -127;
r = r + 1 | 0
}
S = (L | 0) > 0;
if (S) {
n[A + 567 >> 0] = -127;
n[A + 551 >> 0] = -127;
n[A + 7 >> 0] = -127
} else {
o = A + 7 | 0;
c = o + 21 | 0;
do {
n[o >> 0] = 127;
o = o + 1 | 0
} while ((o | 0) < (c | 0));
o = A + 551 | 0;
c = o + 9 | 0;
do {
n[o >> 0] = 127;
o = o + 1 | 0
} while ((o | 0) < (c | 0));
o = A + 567 | 0;
c = o + 9 | 0;
do {
n[o >> 0] = 127;
o = o + 1 | 0
} while ((o | 0) < (c | 0))
}
x = e + 288 | 0;
m = i + 16 | 0;
p = e + 2252 | 0;
y = A + 8 | 0;
P = A + 552 | 0;
D = A + 568 | 0;
B = e + 292 | 0;
E = A + 24 | 0;
_ = A + 520 | 0;
R = A + 808 | 0;
G = A + 824 | 0;
T = f << 4;
M = e + 2280 | 0;
g = f << 3;
C = e + 2284 | 0;
I = e + 2268 | 0;
d = e + 2272 | 0;
h = e + 2276 | 0;
w = A + 408 | 0;
k = A + 280 | 0;
b = A + 152 | 0;
s = 0;
while (1) {
if ((s | 0) >= (t[x >> 2] | 0)) break;
A = t[m >> 2] | 0;
e: do {
if (s | 0) {
r = -1;
while (1) {
if ((r | 0) == 16) break;
c = r << 5;
Aa(Q + (c + -4) | 0, Q + (c | 12) | 0);
r = r + 1 | 0
}
r = -1;
while (1) {
if ((r | 0) == 8) break e;
c = r << 5;
o = c + -4 | 0;
c = c | 4;
Aa(Y + o | 0, Y + c | 0);
Aa(F + o | 0, F + c | 0);
r = r + 1 | 0
}
}
} while (0);
f = t[p >> 2] | 0;
e = f + (s << 5) | 0;
r = t[A + (s * 800 | 0) + 788 >> 2] | 0;
if (S) {
o = y;
l = e;
c = o + 16 | 0;
do {
n[o >> 0] = n[l >> 0] | 0;
o = o + 1 | 0;
l = l + 1 | 0
} while ((o | 0) < (c | 0));
i = f + (s << 5) + 16 | 0;
l = i;
l = u[l >> 0] | u[l + 1 >> 0] << 8 | u[l + 2 >> 0] << 16 | u[l + 3 >> 0] << 24;
i = i + 4 | 0;
i = u[i >> 0] | u[i + 1 >> 0] << 8 | u[i + 2 >> 0] << 16 | u[i + 3 >> 0] << 24;
o = P;
c = o;
n[c >> 0] = l;
n[c + 1 >> 0] = l >> 8;
n[c + 2 >> 0] = l >> 16;
n[c + 3 >> 0] = l >> 24;
o = o + 4 | 0;
n[o >> 0] = i;
n[o + 1 >> 0] = i >> 8;
n[o + 2 >> 0] = i >> 16;
n[o + 3 >> 0] = i >> 24;
o = f + (s << 5) + 24 | 0;
i = o;
i = u[i >> 0] | u[i + 1 >> 0] << 8 | u[i + 2 >> 0] << 16 | u[i + 3 >> 0] << 24;
o = o + 4 | 0;
o = u[o >> 0] | u[o + 1 >> 0] << 8 | u[o + 2 >> 0] << 16 | u[o + 3 >> 0] << 24;
c = D;
l = c;
n[l >> 0] = i;
n[l + 1 >> 0] = i >> 8;
n[l + 2 >> 0] = i >> 16;
n[l + 3 >> 0] = i >> 24;
c = c + 4 | 0;
n[c >> 0] = o;
n[c + 1 >> 0] = o >> 8;
n[c + 2 >> 0] = o >> 16;
n[c + 3 >> 0] = o >> 24
}
e: do {
if (!(n[A + (s * 800 | 0) + 768 >> 0] | 0)) {
uc[t[8400 + ((oa(s, L, n[A + (s * 800 | 0) + 769 >> 0] & 255) | 0) << 2) >> 2] & 31](Q);
if (r | 0) {
i = 0;
while (1) {
if ((i | 0) == 16) break e;
la(r, A + (s * 800 | 0) + (i << 4 << 1) | 0, Q + (a[4160 + (i << 1) >> 1] | 0) | 0);
r = r << 2;
i = i + 1 | 0
}
}
} else {
do {
if (S)
if ((s | 0) < ((t[x >> 2] | 0) + -1 | 0)) {
i = e + 32 | 0;
i = u[i >> 0] | u[i + 1 >> 0] << 8 | u[i + 2 >> 0] << 16 | u[i + 3 >> 0] << 24;
n[E >> 0] = i;
n[E + 1 >> 0] = i >> 8;
n[E + 2 >> 0] = i >> 16;
n[E + 3 >> 0] = i >> 24;
break
} else {
i = n[f + (s << 5) + 15 >> 0] | 0;
Bo(E | 0, i | 0, 4) | 0;
i = i & 255;
i = i << 8 | i;
i = i | i << 16;
break
}
else i = t[E >> 2] | 0
} while (0);
t[w >> 2] = i;
t[k >> 2] = i;
t[b >> 2] = i;
i = 0;
while (1) {
if ((i | 0) == 16) break e;
c = Q + (a[4160 + (i << 1) >> 1] | 0) | 0;
uc[t[8432 + ((n[A + (s * 800 | 0) + 769 + i >> 0] & 255) << 2) >> 2] & 31](c);
la(r, A + (s * 800 | 0) + (i << 4 << 1) | 0, c);
r = r << 2;
i = i + 1 | 0
}
}
} while (0);
c = t[A + (s * 800 | 0) + 792 >> 2] | 0;
o = 8480 + ((oa(s, L, u[A + (s * 800 | 0) + 785 >> 0] | 0) | 0) << 2) | 0;
uc[t[o >> 2] & 31](Y);
uc[t[o >> 2] & 31](F);
ca(c, A + (s * 800 | 0) + 512 | 0, Y);
ca(c >>> 8, A + (s * 800 | 0) + 640 | 0, F);
if ((L | 0) < ((t[B >> 2] | 0) + -1 | 0)) {
o = e;
l = _;
c = o + 16 | 0;
do {
n[o >> 0] = n[l >> 0] | 0;
o = o + 1 | 0;
l = l + 1 | 0
} while ((o | 0) < (c | 0));
A = R;
l = A;
l = u[l >> 0] | u[l + 1 >> 0] << 8 | u[l + 2 >> 0] << 16 | u[l + 3 >> 0] << 24;
A = A + 4 | 0;
A = u[A >> 0] | u[A + 1 >> 0] << 8 | u[A + 2 >> 0] << 16 | u[A + 3 >> 0] << 24;
o = f + (s << 5) + 16 | 0;
c = o;
n[c >> 0] = l;
n[c + 1 >> 0] = l >> 8;
n[c + 2 >> 0] = l >> 16;
n[c + 3 >> 0] = l >> 24;
o = o + 4 | 0;
n[o >> 0] = A;
n[o + 1 >> 0] = A >> 8;
n[o + 2 >> 0] = A >> 16;
n[o + 3 >> 0] = A >> 24;
o = G;
A = o;
A = u[A >> 0] | u[A + 1 >> 0] << 8 | u[A + 2 >> 0] << 16 | u[A + 3 >> 0] << 24;
o = o + 4 | 0;
o = u[o >> 0] | u[o + 1 >> 0] << 8 | u[o + 2 >> 0] << 16 | u[o + 3 >> 0] << 24;
c = f + (s << 5) + 24 | 0;
l = c;
n[l >> 0] = A;
n[l + 1 >> 0] = A >> 8;
n[l + 2 >> 0] = A >> 16;
n[l + 3 >> 0] = A >> 24;
c = c + 4 | 0;
n[c >> 0] = o;
n[c + 1 >> 0] = o >> 8;
n[c + 2 >> 0] = o >> 16;
n[c + 3 >> 0] = o >> 24
}
f = v(T, t[M >> 2] | 0) | 0;
i = t[C >> 2] | 0;
f = (t[I >> 2] | 0) + (s << 4) + f | 0;
A = s << 3;
e = (t[d >> 2] | 0) + A | 0;
A = (t[h >> 2] | 0) + A | 0;
r = 0;
while (1) {
if ((r | 0) == 16) break;
o = f + (v(t[M >> 2] | 0, r) | 0) | 0;
l = Q + (r << 5) | 0;
c = o + 16 | 0;
do {
n[o >> 0] = n[l >> 0] | 0;
o = o + 1 | 0;
l = l + 1 | 0
} while ((o | 0) < (c | 0));
r = r + 1 | 0
}
i = v(i, g) | 0;
f = e + i | 0;
i = A + i | 0;
r = 0;
while (1) {
if ((r | 0) == 8) break;
c = f + (v(t[C >> 2] | 0, r) | 0) | 0;
o = r << 5;
A = Y + o | 0;
e = A;
e = u[e >> 0] | u[e + 1 >> 0] << 8 | u[e + 2 >> 0] << 16 | u[e + 3 >> 0] << 24;
A = A + 4 | 0;
A = u[A >> 0] | u[A + 1 >> 0] << 8 | u[A + 2 >> 0] << 16 | u[A + 3 >> 0] << 24;
l = c;
n[l >> 0] = e;
n[l + 1 >> 0] = e >> 8;
n[l + 2 >> 0] = e >> 16;
n[l + 3 >> 0] = e >> 24;
c = c + 4 | 0;
n[c >> 0] = A;
n[c + 1 >> 0] = A >> 8;
n[c + 2 >> 0] = A >> 16;
n[c + 3 >> 0] = A >> 24;
c = i + (v(t[C >> 2] | 0, r) | 0) | 0;
o = F + o | 0;
A = o;
A = u[A >> 0] | u[A + 1 >> 0] << 8 | u[A + 2 >> 0] << 16 | u[A + 3 >> 0] << 24;
o = o + 4 | 0;
o = u[o >> 0] | u[o + 1 >> 0] << 8 | u[o + 2 >> 0] << 16 | u[o + 3 >> 0] << 24;
l = c;
n[l >> 0] = A;
n[l + 1 >> 0] = A >> 8;
n[l + 2 >> 0] = A >> 16;
n[l + 3 >> 0] = A >> 24;
c = c + 4 | 0;
n[c >> 0] = o;
n[c + 1 >> 0] = o >> 8;
n[c + 2 >> 0] = o >> 16;
n[c + 3 >> 0] = o >> 24;
r = r + 1 | 0
}
s = s + 1 | 0
}
return
}
function Ou(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
C = 0,
I = 0,
d = 0,
m = 0,
p = 0,
y = 0,
P = 0,
D = 0,
B = 0;
r = e + 160 | 0;
m = t[r >> 2] | 0;
l = u[7813 + (t[e + 2308 >> 2] | 0) >> 0] | 0;
D = e + 2280 | 0;
f = t[D >> 2] | 0;
s = v(f, l) | 0;
b = e + 2284 | 0;
A = t[b >> 2] | 0;
h = v(l >>> 1, A) | 0;
f = v(f, m << 4) | 0;
A = v(A, m << 3) | 0;
w = e + 2268 | 0;
k = 0 - s | 0;
g = (t[w >> 2] | 0) + k + f | 0;
C = e + 2272 | 0;
I = 0 - h | 0;
d = (t[C >> 2] | 0) + I + A | 0;
p = e + 2276 | 0;
y = (t[p >> 2] | 0) + I + A | 0;
n = t[e + 164 >> 2] | 0;
a = (n | 0) == 0;
P = (n | 0) >= ((t[e + 308 >> 2] | 0) + -1 | 0);
if ((t[e + 148 >> 2] | 0) == 2) zu(e, r);
if (t[e + 168 >> 2] | 0) ra(e);
if (t[e + 540 >> 2] | 0) na(e);
c = i + 44 | 0;
do {
if (t[c >> 2] | 0) {
n = n << 4;
if (a) {
t[i + 20 >> 2] = (t[w >> 2] | 0) + f;
t[i + 24 >> 2] = (t[C >> 2] | 0) + A;
f = 0;
r = (t[p >> 2] | 0) + A | 0
} else {
t[i + 20 >> 2] = g;
t[i + 24 >> 2] = d;
f = n - l | 0;
r = y
}
t[i + 28 >> 2] = r;
A = n + 16 + (P ? 0 : 0 - l | 0) | 0;
l = t[i + 88 >> 2] | 0;
A = (A | 0) > (l | 0) ? l : A;
l = i + 104 | 0;
t[l >> 2] = 0;
if ((t[e + 2348 >> 2] | 0) != 0 & (A | 0) > (f | 0)) {
r = oi(e, i, f, A - f | 0) | 0;
t[l >> 2] = r;
if (!r) {
r = fa(e, 3, 7816) | 0;
break
}
} else r = 0;
a = t[i + 84 >> 2] | 0;
if ((a | 0) > (f | 0)) {
n = a - f | 0;
o = v(t[D >> 2] | 0, n) | 0;
f = i + 20 | 0;
t[f >> 2] = (t[f >> 2] | 0) + o;
f = v(t[b >> 2] | 0, n >> 1) | 0;
o = i + 24 | 0;
t[o >> 2] = (t[o >> 2] | 0) + f;
o = i + 28 | 0;
t[o >> 2] = (t[o >> 2] | 0) + f;
if (!r) {
f = a;
r = 0
} else {
r = r + (v(t[i >> 2] | 0, n) | 0) | 0;
t[l >> 2] = r;
f = a
}
}
if ((A | 0) > (f | 0)) {
n = t[i + 76 >> 2] | 0;
B = i + 20 | 0;
t[B >> 2] = (t[B >> 2] | 0) + n;
B = n >> 1;
o = i + 24 | 0;
t[o >> 2] = (t[o >> 2] | 0) + B;
o = i + 28 | 0;
t[o >> 2] = (t[o >> 2] | 0) + B;
if (r | 0) t[l >> 2] = r + n;
t[i + 8 >> 2] = f - a;
t[i + 12 >> 2] = (t[i + 80 >> 2] | 0) - n;
t[i + 16 >> 2] = A - f;
r = ic[t[c >> 2] & 15](i) | 0;
o = 21
} else {
r = 1;
o = 21
}
} else {
r = 1;
o = 21
}
} while (0);
if ((o | 0) == 21)
if (!(P | (m + 1 | 0) != (t[e + 156 >> 2] | 0))) {
Po((t[w >> 2] | 0) + k | 0, g + (t[D >> 2] << 4) | 0, s | 0) | 0;
Po((t[C >> 2] | 0) + I | 0, d + (t[b >> 2] << 3) | 0, h | 0) | 0;
Po((t[p >> 2] | 0) + I | 0, y + (t[b >> 2] << 3) | 0, h | 0) | 0
} return r | 0
}
function Ju() {
return 7740
}
function ju(e) {
e = e | 0;
t[e >> 2] = 0;
t[e + 4 >> 2] = 0;
t[e + 8 >> 2] = 0;
t[e + 12 >> 2] = 0;
t[e + 16 >> 2] = 0;
t[e + 20 >> 2] = 0;
return
}
function qu(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0;
t[e + 20 >> 2] = 0;
n = e + 4 | 0;
i = t[n >> 2] | 0;
e: do {
switch (i | 0) {
case 0: {
i = En(1, 0, 80) | 0;
t[e >> 2] = i;
if (!i) i = 0;
else {
do {
if (!(S(i | 0, 0) | 0)) {
r = i + 28 | 0;
if (E(r | 0, 0) | 0) {
M(i | 0) | 0;
break
}
Eo(i | 0) | 0;
if (!(G(i + 76 | 0, 0, 9, e | 0) | 0)) {
t[n >> 2] = 1;
_o(i | 0) | 0;
i = 1;
break e
} else {
_o(i | 0) | 0;
M(i | 0) | 0;
B(r | 0) | 0;
break
}
}
} while (0);
ii(i);
t[e >> 2] = 0;
i = 0
}
break
}
case 1:
break;
default:
i = Ku(e) | 0
}
} while (0);
return i | 0
}
function Ku(e) {
e = e | 0;
ea(e, 1);
return (t[e + 20 >> 2] | 0) == 0 | 0
}
function Xu(e) {
e = e | 0;
ea(e, 2);
return
}
function Nu(e) {
e = e | 0;
var i = 0,
r = 0;
i = t[e + 8 >> 2] | 0;
if (i | 0) {
r = (rc[i & 31](t[e + 12 >> 2] | 0, t[e + 16 >> 2] | 0) | 0) == 0 & 1;
i = e + 20 | 0;
t[i >> 2] = t[i >> 2] | r
}
return
}
function $u(e) {
e = e | 0;
var i = 0;
i = t[e >> 2] | 0;
if (i | 0) {
ea(e, 0);
T(t[i + 76 >> 2] | 0, 0) | 0;
M(i | 0) | 0;
B(i + 28 | 0) | 0;
ii(i);
t[e >> 2] = 0
}
return
}
function ea(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0;
f = t[e >> 2] | 0;
if (f | 0) {
Eo(f | 0) | 0;
r = e + 4 | 0;
e = t[r >> 2] | 0;
if (e | 0) {
n = f + 28 | 0;
while (1) {
if ((e | 0) == 1) break;
R(n | 0, f | 0) | 0;
e = t[r >> 2] | 0
}
if ((i | 0) != 1) {
t[r >> 2] = i;
_(n | 0) | 0
}
}
_o(f | 0) | 0
}
return
}
function ia(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0,
f = 0,
u = 0;
r = t[e >> 2] | 0;
n = e + 4 | 0;
f = r + 28 | 0;
i = 0;
while (1) {
if (i | 0) break;
Eo(r | 0) | 0;
e: while (1) {
switch (t[n >> 2] | 0) {
case 2: {
u = 6;
break e
}
case 0: {
i = 1;
break e
}
case 1:
break;
default: {
u = 7;
break e
}
}
R(f | 0, r | 0) | 0
}
if ((u | 0) == 6) {
u = 0;
uc[t[7756 >> 2] & 31](e);
t[n >> 2] = 1;
i = 0
} else if ((u | 0) == 7) {
u = 0;
i = 0
}
_(f | 0) | 0;
_o(r | 0) | 0
}
return 0
}
function ra(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0;
r = t[e + 164 >> 2] | 0;
n = e + 304 | 0;
i = t[e + 296 >> 2] | 0;
while (1) {
if ((i | 0) >= (t[n >> 2] | 0)) break;
aa(e, i, r);
i = i + 1 | 0
}
return
}
function na(e) {
e = e | 0;
var i = 0,
r = 0,
f = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0;
a = e + 304 | 0;
A = e + 176 | 0;
l = e + 2284 | 0;
o = e + 160 | 0;
c = e + 2272 | 0;
s = e + 2276 | 0;
b = e + 544 | 0;
e = t[e + 296 >> 2] | 0;
while (1) {
if ((e | 0) >= (t[a >> 2] | 0)) break;
i = t[l >> 2] | 0;
r = (t[A >> 2] | 0) + (e * 800 | 0) + 796 | 0;
f = n[r >> 0] | 0;
if ((f & 255) > 3) {
k = v(t[o >> 2] << 3, i) | 0;
w = e << 3;
h = (t[s >> 2] | 0) + k + w | 0;
ta(b, (t[c >> 2] | 0) + k + w | 0, i, f & 255);
ta(b, h, i, u[r >> 0] | 0)
}
e = e + 1 | 0
}
return
}
function fa(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
if (!(t[e >> 2] | 0)) {
t[e >> 2] = i;
t[e + 8 >> 2] = r;
t[e + 4 >> 2] = 0
}
return 0
}
function ta(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
var t = 0,
u = 0,
a = 0;
a = F;
F = F + 64 | 0;
u = a;
t = 0;
while (1) {
if ((t | 0) == 64) break;
n[u + t >> 0] = ua(e, f) | 0;
t = t + 1 | 0
}
cA(u, i, r);
F = a;
return
}
function ua(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0;
f = e + 8 + (t[e >> 2] << 2) | 0;
n = e + 4 | 0;
r = (t[f >> 2] | 0) - (t[e + 8 + (t[n >> 2] << 2) >> 2] | 0) | 0;
t[f >> 2] = r & 2147483647;
f = (t[e >> 2] | 0) + 1 | 0;
t[e >> 2] = (f | 0) == 55 ? 0 : f;
e = (t[n >> 2] | 0) + 1 | 0;
t[n >> 2] = (e | 0) == 55 ? 0 : e;
return ((v(r << 1 >> 24, i) | 0) >> 8) + 128 | 0
}
function aa(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0;
f = t[e + 160 >> 2] | 0;
w = t[e + 2280 >> 2] | 0;
o = t[e + 172 >> 2] | 0;
b = (t[e + 2268 >> 2] | 0) + (v(f << 4, w) | 0) + (i << 4) | 0;
c = u[o + (i << 2) + 1 >> 0] | 0;
s = n[o + (i << 2) >> 0] | 0;
h = s & 255;
do {
if (s << 24 >> 24)
if ((t[e + 2308 >> 2] | 0) == 1) {
if ((i | 0) > 0) xa(b, w, h + 4 | 0);
f = o + (i << 2) + 2 | 0;
if (n[f >> 0] | 0) La(b, w, h);
if ((r | 0) > 0) Sa(b, w, h + 4 | 0);
if (!(n[f >> 0] | 0)) break;
Fa(b, w, h);
break
} else {
s = t[e + 2284 >> 2] | 0;
A = v(s, f << 3) | 0;
a = i << 3;
l = (t[e + 2272 >> 2] | 0) + A + a | 0;
e = (t[e + 2276 >> 2] | 0) + A + a | 0;
a = u[o + (i << 2) + 3 >> 0] | 0;
A = h + 4 | 0;
if ((i | 0) > 0) {
Ga(b, w, A, c, a);
Ya(l, e, s, A, c, a)
}
f = o + (i << 2) + 2 | 0;
if (n[f >> 0] | 0) {
Qa(b, w, h, c, a);
Ua(l, e, s, h, c, a)
}
if ((r | 0) > 0) {
_a(b, w, A, c, a);
Ta(l, e, s, A, c, a)
}
if (!(n[f >> 0] | 0)) break;
Ra(b, w, h, c, a);
Ma(l, e, s, h, c, a);
break
}
} while (0);
return
}
function Aa(e, i) {
e = e | 0;
i = i | 0;
i = u[i >> 0] | u[i + 1 >> 0] << 8 | u[i + 2 >> 0] << 16 | u[i + 3 >> 0] << 24;
n[e >> 0] = i;
n[e + 1 >> 0] = i >> 8;
n[e + 2 >> 0] = i >> 16;
n[e + 3 >> 0] = i >> 24;
return
}
function la(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
switch (e >>> 30 & 3) {
case 3: {
ya(i, r, 0);
break
}
case 2: {
Da(i, r);
break
}
case 1: {
Pa(i, r);
break
}
default: {}
}
return
}
function oa(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
do {
if (!r) {
r = (i | 0) == 0;
if (!e) {
r = r ? 6 : 5;
break
} else {
r = r ? 4 : 0;
break
}
}
} while (0);
return r | 0
}
function ca(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
do {
if (e & 255 | 0)
if (!(e & 170)) {
Ea(i, r);
break
} else {
Ba(i, r);
break
}
} while (0);
return
}
function sa(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
a = 0,
A = 0,
l = 0;
r = t[i + 48 >> 2] | 0;
if ((r | 0) != 0 ? (ic[r & 15](i) | 0) == 0 : 0) {
fa(e, 6, 7845) | 0;
r = t[e >> 2] | 0
} else {
r = e + 2308 | 0;
if (!(t[i + 68 >> 2] | 0)) {
A = t[r >> 2] | 0;
r = u[7813 + A >> 0] | 0;
if ((A | 0) == 2) {
t[e + 296 >> 2] = 0;
n = e + 300 | 0;
A = 11
} else A = 8
} else {
t[r >> 2] = 0;
r = 0;
A = 8
}
if ((A | 0) == 8) {
l = (t[i + 76 >> 2] | 0) - r | 0;
f = e + 296 | 0;
t[f >> 2] = l >> 4;
a = (t[i + 84 >> 2] | 0) - r | 0;
n = e + 300 | 0;
t[n >> 2] = a >> 4;
if ((l | 0) < 0) t[f >> 2] = 0;
if ((a | 0) < 0) A = 11
}
if ((A | 0) == 11) t[n >> 2] = 0;
r = r + 15 | 0;
l = r + (t[i + 88 >> 2] | 0) >> 4;
n = e + 308 | 0;
t[n >> 2] = l;
r = r + (t[i + 80 >> 2] | 0) >> 4;
i = t[e + 288 >> 2] | 0;
t[e + 304 >> 2] = (r | 0) > (i | 0) ? i : r;
r = t[e + 292 >> 2] | 0;
if ((l | 0) > (r | 0)) t[n >> 2] = r;
ba(e);
r = 0
}
return r | 0
}
function ba(e) {
e = e | 0;
var i = 0,
r = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0;
e: do {
if ((t[e + 2308 >> 2] | 0) > 0) {
l = e + 104 | 0;
o = e + 60 | 0;
c = e + 68 | 0;
s = e + 72 | 0;
b = e + 64 | 0;
h = e + 88 | 0;
A = e + 112 | 0;
a = 0;
while (1) {
if ((a | 0) == 4) break e;
if (t[l >> 2] | 0) {
i = n[e + 120 + a >> 0] | 0;
if (!(t[A >> 2] | 0)) i = (t[o >> 2] | 0) + i | 0
} else i = t[o >> 2] | 0;
u = 0;
while (1) {
if ((u | 0) == 2) break;
if (t[c >> 2] | 0) {
r = (t[s >> 2] | 0) + i | 0;
if (u) r = (t[h >> 2] | 0) + r | 0
} else r = i;
f = (r | 0) < 63 ? r : 63;
f = (f | 0) > 0 ? f : 0;
if ((r | 0) > 0) {
k = t[b >> 2] | 0;
r = f >>> ((k | 0) > 4 ? 2 : 1);
w = 9 - k | 0;
r = (k | 0) > 0 ? (r | 0) > (w | 0) ? w : r : f;
r = (r | 0) > 1 ? r : 1;
n[e + 2312 + (a << 3) + (u << 2) + 1 >> 0] = r;
n[e + 2312 + (a << 3) + (u << 2) + 3 >> 0] = (f | 0) > 39 ? 2 : (f | 0) > 14 & 1;
r = r + (f << 1) & 255
} else r = 0;
n[e + 2312 + (a << 3) + (u << 2) >> 0] = r;
n[e + 2312 + (a << 3) + (u << 2) + 2 >> 0] = u;
u = u + 1 | 0
}
a = a + 1 | 0
}
}
} while (0);
return
}
function ha(e, i) {
e = e | 0;
i = i | 0;
var r = 0;
if ((t[e + 148 >> 2] | 0) > 0) e = ic[t[(Ju() | 0) + 8 >> 2] & 15](e + 124 | 0) | 0;
else e = 1;
r = t[i + 52 >> 2] | 0;
if (r | 0) uc[r & 31](i);
return e | 0
}
function wa(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
if (!e) return 0;
else return ((t[e + 40 >> 2] | 0) == 0 ? 0 : (r | 0) > 511 ? 2 : 0) | 0;
return 0
}
function ka(e, i) {
e = e | 0;
i = i | 0;
if ((ga(e) | 0) != 0 ? (va(e) | 0) != 0 : 0) {
Ca(e, i);
Ia();
e = 1
} else e = 0;
return e | 0
}
function ga(e) {
e = e | 0;
t[e + 152 >> 2] = 0;
do {
if ((t[e + 148 >> 2] | 0) > 0)
if (!(ic[t[(Ju() | 0) + 4 >> 2] & 15](e + 124 | 0) | 0)) {
e = fa(e, 1, 7903) | 0;
break
} else {
t[e + 136 >> 2] = e;
t[e + 140 >> 2] = e + 180;
t[e + 132 >> 2] = 22;
t[e + 156 >> 2] = (t[e + 2308 >> 2] | 0) > 0 ? 3 : 2;
e = 1;
break
}
else {
t[e + 156 >> 2] = 1;
e = 1
}
} while (0);
return e | 0
}
function va(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0,
f = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
C = 0,
I = 0,
d = 0,
p = 0,
y = 0;
k = t[e + 156 >> 2] | 0;
I = t[e + 288 >> 2] | 0;
d = I << 2;
c = I << 5;
p = (I << 1) + 2 | 0;
y = e + 2308 | 0;
i = t[y >> 2] | 0;
o = e + 148 | 0;
A = t[o >> 2] | 0;
if ((i | 0) > 0) s = v(d, (A | 0) > 0 ? 2 : 1) | 0;
else s = 0;
g = v(I * 800 | 0, (A | 0) == 2 ? 2 : 1) | 0;
C = k << 4;
b = v(((C + (u[7813 + i >> 0] | 0) | 0) * 3 | 0) / 2 | 0, c) | 0;
if (!(t[e + 2348 >> 2] | 0)) {
h = 0;
w = 0
} else {
h = wo(a[e + 50 >> 1] | 0 | 0, 0, a[e + 48 >> 1] | 0 | 0, 0) | 0;
w = m() | 0
}
n = ko(c | 0, 0, 863, 0) | 0;
n = ko(n | 0, m() | 0, d | 0, 0) | 0;
n = ko(n | 0, m() | 0, p | 0, 0) | 0;
n = ko(n | 0, m() | 0, s | 0, 0) | 0;
n = ko(n | 0, m() | 0, g | 0, 0) | 0;
n = ko(n | 0, m() | 0, b | 0, 0) | 0;
n = ko(n | 0, m() | 0, h | 0, w | 0) | 0;
r = m() | 0;
e: do {
if ((n | 0) == (n | 0) & (r | 0) == 0) {
f = e + 2292 | 0;
l = e + 2288 | 0;
i = t[l >> 2] | 0;
do {
if (r >>> 0 > 0 | ((r | 0) == 0 ? n >>> 0 > (t[f >> 2] | 0) >>> 0 : 0)) {
ii(i);
t[f >> 2] = 0;
i = mi(n, r, 1) | 0;
t[l >> 2] = i;
if (!i) {
i = fa(e, 1, 7864) | 0;
break e
} else {
t[f >> 2] = n;
A = t[o >> 2] | 0;
break
}
}
} while (0);
f = e + 2244 | 0;
t[f >> 2] = i;
i = i + d | 0;
t[e + 2252 >> 2] = i;
i = i + c | 0;
n = i + 2 | 0;
t[e + 2256 >> 2] = n;
i = i + p | 0;
r = (s | 0) == 0 ? 0 : i;
t[e + 2260 >> 2] = r;
t[e + 160 >> 2] = 0;
t[e + 172 >> 2] = (A | 0) > 0 ? r + (I << 2) | 0 : r;
i = i + s + 31 & -32;
t[e + 2264 >> 2] = i;
i = i + 832 | 0;
t[e + 2304 >> 2] = i;
r = e + 176 | 0;
t[r >> 2] = i;
if ((A | 0) == 2) t[r >> 2] = i + (I * 800 | 0);
i = i + g | 0;
g = I << 4;
t[e + 2280 >> 2] = g;
I = I << 3;
t[e + 2284 >> 2] = I;
s = u[7813 + (t[y >> 2] | 0) >> 0] | 0;
y = v(s >>> 1, I) | 0;
s = i + (v(g, s) | 0) | 0;
t[e + 2268 >> 2] = s;
C = s + (v(g, C) | 0) + y | 0;
t[e + 2272 >> 2] = C;
t[e + 2276 >> 2] = C + (v(k << 3, I) | 0) + y;
t[e + 152 >> 2] = 0;
t[e + 2364 >> 2] = (h | 0) == 0 & (w | 0) == 0 ? 0 : i + b | 0;
Bo(n + -2 | 0, 0, p | 0) | 0;
DA(e);
Bo(t[f >> 2] | 0, 0, d | 0) | 0;
i = 1
} else i = 0
} while (0);
return i | 0
}
function Ca(e, i) {
e = e | 0;
i = i | 0;
t[i + 8 >> 2] = 0;
t[i + 20 >> 2] = t[e + 2268 >> 2];
t[i + 24 >> 2] = t[e + 2272 >> 2];
t[i + 28 >> 2] = t[e + 2276 >> 2];
t[i + 32 >> 2] = t[e + 2280 >> 2];
t[i + 36 >> 2] = t[e + 2284 >> 2];
t[i + 104 >> 2] = 0;
return
}
function Ia() {
var e = 0;
if (!(Eo(9192) | 0)) {
if (!(t[1941] | 0)) e = 0;
else {
da();
e = t[2248] | 0
}
t[1941] = e;
_o(9192) | 0
}
return
}
function da() {
t[2108] = 6;
t[2109] = 7;
t[2110] = 8;
t[2112] = 9;
t[2114] = 10;
t[2111] = 11;
t[2113] = 12;
t[2115] = 13;
t[2116] = 14;
t[2117] = 15;
t[2100] = 16;
t[2101] = 17;
t[2102] = 18;
t[2103] = 19;
t[2104] = 20;
t[2105] = 21;
t[2106] = 22;
t[2120] = 23;
t[2121] = 24;
t[2122] = 25;
t[2123] = 26;
t[2124] = 27;
t[2125] = 28;
t[2126] = 29;
return
}
function ma() {
return
}
function pa(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0;
u = F;
F = F + 64 | 0;
n = u;
r = 0;
while (1) {
if ((r | 0) == 4) break;
h = f[e + (r << 1) >> 1] | 0;
a = r + 12 | 0;
l = f[e + (a << 1) >> 1] | 0;
b = l + h | 0;
o = r + 4 | 0;
w = f[e + (o << 1) >> 1] | 0;
c = r + 8 | 0;
A = f[e + (c << 1) >> 1] | 0;
s = A + w | 0;
A = w - A | 0;
l = h - l | 0;
t[n + (r << 2) >> 2] = s + b;
t[n + (c << 2) >> 2] = b - s;
t[n + (o << 2) >> 2] = A + l;
t[n + (a << 2) >> 2] = l - A;
r = r + 1 | 0
}
r = 0;
while (1) {
if ((r | 0) == 4) break;
w = r << 2;
c = (t[n + (w << 2) >> 2] | 0) + 3 | 0;
h = t[n + ((w | 3) << 2) >> 2] | 0;
s = c + h | 0;
o = t[n + ((w | 1) << 2) >> 2] | 0;
w = t[n + ((w | 2) << 2) >> 2] | 0;
b = w + o | 0;
w = o - w | 0;
h = c - h | 0;
f[i >> 1] = (b + s | 0) >>> 3;
f[i + 32 >> 1] = (w + h | 0) >>> 3;
f[i + 64 >> 1] = (s - b | 0) >>> 3;
f[i + 96 >> 1] = (h - w | 0) >>> 3;
i = i + 128 | 0;
r = r + 1 | 0
}
F = u;
return
}
function ya(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
PA(e, i);
if (r | 0) PA(e + 32 | 0, i + 4 | 0);
return
}
function Pa(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
t = 0,
a = 0,
A = 0;
t = (f[e >> 1] | 0) + 4 >> 3;
e = 0;
while (1) {
if ((e | 0) == 4) break;
a = e << 5;
r = 0;
while (1) {
if ((r | 0) == 4) break;
A = i + (r + a) | 0;
n[A >> 0] = sA(t + (u[A >> 0] | 0) | 0) | 0;
r = r + 1 | 0
}
e = e + 1 | 0
}
return
}
function Da(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
t = 0,
a = 0,
A = 0,
l = 0,
o = 0;
t = (f[e >> 1] | 0) + 4 | 0;
r = f[e + 8 >> 1] | 0;
l = r * 35468 >> 16;
r = (r * 20091 >> 16) + r | 0;
e = f[e + 2 >> 1] | 0;
a = e * 35468 >> 16;
e = (e * 20091 >> 16) + e | 0;
A = r + t | 0;
n[i >> 0] = sA((A + e >> 3) + (u[i >> 0] | 0) | 0) | 0;
o = i + 1 | 0;
n[o >> 0] = sA((A + a >> 3) + (u[o >> 0] | 0) | 0) | 0;
o = i + 2 | 0;
n[o >> 0] = sA((A - a >> 3) + (u[o >> 0] | 0) | 0) | 0;
o = i + 3 | 0;
n[o >> 0] = sA((A - e >> 3) + (u[o >> 0] | 0) | 0) | 0;
o = l + t | 0;
A = i + 32 | 0;
n[A >> 0] = sA((e + o >> 3) + (u[A >> 0] | 0) | 0) | 0;
A = i + 33 | 0;
n[A >> 0] = sA((o + a >> 3) + (u[A >> 0] | 0) | 0) | 0;
A = i + 34 | 0;
n[A >> 0] = sA((o - a >> 3) + (u[A >> 0] | 0) | 0) | 0;
A = i + 35 | 0;
n[A >> 0] = sA((o - e >> 3) + (u[A >> 0] | 0) | 0) | 0;
l = t - l | 0;
A = i + 64 | 0;
n[A >> 0] = sA((e + l >> 3) + (u[A >> 0] | 0) | 0) | 0;
A = i + 65 | 0;
n[A >> 0] = sA((l + a >> 3) + (u[A >> 0] | 0) | 0) | 0;
A = i + 66 | 0;
n[A >> 0] = sA((l - a >> 3) + (u[A >> 0] | 0) | 0) | 0;
A = i + 67 | 0;
n[A >> 0] = sA((l - e >> 3) + (u[A >> 0] | 0) | 0) | 0;
r = t - r | 0;
t = i + 96 | 0;
n[t >> 0] = sA((r + e >> 3) + (u[t >> 0] | 0) | 0) | 0;
t = i + 97 | 0;
n[t >> 0] = sA((r + a >> 3) + (u[t >> 0] | 0) | 0) | 0;
t = i + 98 | 0;
n[t >> 0] = sA((r - a >> 3) + (u[t >> 0] | 0) | 0) | 0;
i = i + 99 | 0;
n[i >> 0] = sA((r - e >> 3) + (u[i >> 0] | 0) | 0) | 0;
return
}
function Ba(e, i) {
e = e | 0;
i = i | 0;
ya(e, i, 1);
ya(e + 64 | 0, i + 128 | 0, 1);
return
}
function Ea(e, i) {
e = e | 0;
i = i | 0;
var r = 0;
if (f[e >> 1] | 0) Pa(e, i);
r = e + 32 | 0;
if (f[r >> 1] | 0) Pa(r, i + 4 | 0);
r = e + 64 | 0;
if (f[r >> 1] | 0) Pa(r, i + 128 | 0);
r = e + 96 | 0;
if (f[r >> 1] | 0) Pa(r, i + 132 | 0);
return
}
function _a(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
mA(e, i, 1, 16, r, n, f);
return
}
function Ra(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var t = 0,
u = 0,
a = 0;
u = i << 2;
t = 3;
while (1) {
if (!t) break;
a = e + u | 0;
gA(a, i, 1, 16, r, n, f);
t = t + -1 | 0;
e = a
}
return
}
function Ga(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
mA(e, 1, i, 16, r, n, f);
return
}
function Ta(e, i, r, n, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
mA(e, r, 1, 8, n, f, t);
mA(i, r, 1, 8, n, f, t);
return
}
function Ma(e, i, r, n, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
var u = 0;
u = r << 2;
gA(e + u | 0, r, 1, 8, n, f, t);
gA(i + u | 0, r, 1, 8, n, f, t);
return
}
function Sa(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0;
n = r << 1 | 1;
r = 0;
while (1) {
if ((r | 0) == 16) break;
f = e + r | 0;
if (yA(f, i, n) | 0) IA(f, i);
r = r + 1 | 0
}
return
}
function xa(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0;
n = r << 1 | 1;
r = 0;
while (1) {
if ((r | 0) == 16) break;
f = e + (v(r, i) | 0) | 0;
if (yA(f, 1, n) | 0) IA(f, 1);
r = r + 1 | 0
}
return
}
function Fa(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
t = 0;
f = i << 2;
n = 3;
while (1) {
if (!n) break;
t = e + f | 0;
Sa(t, i, r);
n = n + -1 | 0;
e = t
}
return
}
function La(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0;
n = 3;
while (1) {
if (!n) break;
f = e + 4 | 0;
xa(f, i, r);
n = n + -1 | 0;
e = f
}
return
}
function Qa(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var t = 0,
u = 0;
t = 3;
while (1) {
if (!t) break;
u = e + 4 | 0;
gA(u, 1, i, 16, r, n, f);
t = t + -1 | 0;
e = u
}
return
}
function Ya(e, i, r, n, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
mA(e, 1, r, 8, n, f, t);
mA(i, 1, r, 8, n, f, t);
return
}
function Ua(e, i, r, n, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
gA(e + 4 | 0, 1, r, 8, n, f, t);
gA(i + 4 | 0, 1, r, 8, n, f, t);
return
}
function Ha(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0;
i = 0;
r = 4;
while (1) {
if ((i | 0) == 4) break;
n = r + (u[e + (i + -32) >> 0] | 0) + (u[e + ((i << 5) + -1) >> 0] | 0) | 0;
i = i + 1 | 0;
r = n
}
r = r >>> 3 & 255;
i = 0;
while (1) {
if ((i | 0) == 4) break;
Bo(e + (i << 5) | 0, r | 0, 4) | 0;
i = i + 1 | 0
}
return
}
function Va(e) {
e = e | 0;
hA(e, 4);
return
}
function Wa(e) {
e = e | 0;
var i = 0,
r = 0,
f = 0,
t = 0,
a = 0,
A = 0;
a = u[e + -32 >> 0] | 0;
f = u[e + -31 >> 0] | 0;
A = f + 2 | 0;
r = (A + (u[e + -33 >> 0] | 0) + (a << 1) | 0) >>> 2 & 255;
t = u[e + -30 >> 0] | 0;
i = t + 2 | 0;
f = (i + a + (f << 1) | 0) >>> 2 & 255;
a = u[e + -29 >> 0] | 0;
t = (A + (t << 1) + a | 0) >>> 2 & 255;
a = (i + (a << 1) + (u[e + -28 >> 0] | 0) | 0) >>> 2 & 255;
i = 0;
while (1) {
if ((i | 0) == 4) break;
A = e + (i << 5) | 0;
n[A >> 0] = r;
n[A + 1 >> 0] = f;
n[A + 2 >> 0] = t;
n[A + 3 >> 0] = a;
i = i + 1 | 0
}
return
}
function Za(e) {
e = e | 0;
var i = 0,
r = 0,
f = 0,
t = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
l = u[e + -1 >> 0] | 0;
s = u[e + 31 >> 0] | 0;
c = u[e + 63 >> 0] | 0;
a = u[e + -33 >> 0] | 0;
t = u[e + -32 >> 0] | 0;
f = u[e + -31 >> 0] | 0;
i = u[e + -30 >> 0] | 0;
r = u[e + -29 >> 0] | 0;
o = s + 2 | 0;
n[e + 96 >> 0] = (o + (c << 1) + (u[e + 95 >> 0] | 0) | 0) >>> 2;
A = l + 2 | 0;
c = (A + (s << 1) + c | 0) >>> 2 & 255;
n[e + 64 >> 0] = c;
n[e + 97 >> 0] = c;
l = (o + (l << 1) + a | 0) >>> 2 & 255;
n[e + 32 >> 0] = l;
n[e + 65 >> 0] = l;
n[e + 98 >> 0] = l;
A = (A + t + (a << 1) | 0) >>> 2 & 255;
n[e >> 0] = A;
n[e + 33 >> 0] = A;
n[e + 66 >> 0] = A;
n[e + 99 >> 0] = A;
a = (a + 2 + f + (t << 1) | 0) >>> 2 & 255;
n[e + 1 >> 0] = a;
n[e + 34 >> 0] = a;
n[e + 67 >> 0] = a;
t = (t + 2 + i + (f << 1) | 0) >>> 2 & 255;
n[e + 2 >> 0] = t;
n[e + 35 >> 0] = t;
n[e + 3 >> 0] = (f + 2 + r + (i << 1) | 0) >>> 2;
return
}
function za(e) {
e = e | 0;
var i = 0,
r = 0,
f = 0,
t = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0;
c = u[e + -31 >> 0] | 0;
o = u[e + -30 >> 0] | 0;
A = u[e + -29 >> 0] | 0;
t = u[e + -28 >> 0] | 0;
f = u[e + -27 >> 0] | 0;
r = u[e + -26 >> 0] | 0;
i = u[e + -25 >> 0] | 0;
l = o + 2 | 0;
n[e >> 0] = (l + (u[e + -32 >> 0] | 0) + (c << 1) | 0) >>> 2;
a = A + 2 | 0;
o = (a + c + (o << 1) | 0) >>> 2 & 255;
n[e + 32 >> 0] = o;
n[e + 1 >> 0] = o;
A = (l + (A << 1) + t | 0) >>> 2 & 255;
n[e + 64 >> 0] = A;
n[e + 33 >> 0] = A;
n[e + 2 >> 0] = A;
a = (a + (t << 1) + f | 0) >>> 2 & 255;
n[e + 96 >> 0] = a;
n[e + 65 >> 0] = a;
n[e + 34 >> 0] = a;
n[e + 3 >> 0] = a;
t = (t + 2 + (f << 1) + r | 0) >>> 2 & 255;
n[e + 97 >> 0] = t;
n[e + 66 >> 0] = t;
n[e + 35 >> 0] = t;
f = (f + 2 + (r << 1) + i | 0) >>> 2 & 255;
n[e + 98 >> 0] = f;
n[e + 67 >> 0] = f;
n[e + 99 >> 0] = (r + 2 + i + (i << 1) | 0) >>> 2;
return
}
function Oa(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0,
f = 0,
t = 0,
a = 0;
a = u[e + -1 >> 0] | 0;
t = u[e + 31 >> 0] | 0;
n = u[e + 63 >> 0] | 0;
i = u[e + 95 >> 0] | 0;
f = t + 2 | 0;
kA(e, v((f + (u[e + -33 >> 0] | 0) + (a << 1) | 0) >>> 2 & 255, 16843009) | 0);
r = n + 2 | 0;
kA(e + 32 | 0, v((r + a + (t << 1) | 0) >>> 2 & 255, 16843009) | 0);
kA(e + 64 | 0, v((f + (n << 1) + i | 0) >>> 2 & 255, 16843009) | 0);
kA(e + 96 | 0, v((r + i + (i << 1) | 0) >>> 2 & 255, 16843009) | 0);
return
}
function Ja(e) {
e = e | 0;
var i = 0,
r = 0,
f = 0,
t = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
o = u[e + -1 >> 0] | 0;
c = u[e + 31 >> 0] | 0;
a = u[e + 63 >> 0] | 0;
A = u[e + -33 >> 0] | 0;
t = u[e + -32 >> 0] | 0;
f = u[e + -31 >> 0] | 0;
r = u[e + -30 >> 0] | 0;
i = u[e + -29 >> 0] | 0;
l = t + 1 | 0;
s = (l + A | 0) >>> 1 & 255;
n[e + 65 >> 0] = s;
n[e >> 0] = s;
l = (l + f | 0) >>> 1 & 255;
n[e + 66 >> 0] = l;
n[e + 1 >> 0] = l;
l = (f + 1 + r | 0) >>> 1 & 255;
n[e + 67 >> 0] = l;
n[e + 2 >> 0] = l;
n[e + 3 >> 0] = (r + 1 + i | 0) >>> 1;
l = o + 2 | 0;
n[e + 96 >> 0] = (l + a + (c << 1) | 0) >>> 2;
a = A + 2 | 0;
n[e + 64 >> 0] = (a + c + (o << 1) | 0) >>> 2;
A = (l + (A << 1) + t | 0) >>> 2 & 255;
n[e + 97 >> 0] = A;
n[e + 32 >> 0] = A;
a = (a + (t << 1) + f | 0) >>> 2 & 255;
n[e + 98 >> 0] = a;
n[e + 33 >> 0] = a;
t = (t + 2 + (f << 1) + r | 0) >>> 2 & 255;
n[e + 99 >> 0] = t;
n[e + 34 >> 0] = t;
n[e + 35 >> 0] = (f + 2 + (r << 1) + i | 0) >>> 2;
return
}
function ja(e) {
e = e | 0;
var i = 0,
r = 0,
f = 0,
t = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0;
a = u[e + -32 >> 0] | 0;
c = u[e + -31 >> 0] | 0;
o = u[e + -30 >> 0] | 0;
A = u[e + -29 >> 0] | 0;
t = u[e + -28 >> 0] | 0;
f = u[e + -27 >> 0] | 0;
r = u[e + -26 >> 0] | 0;
i = u[e + -25 >> 0] | 0;
l = c + 1 | 0;
n[e >> 0] = (l + a | 0) >>> 1;
l = (l + o | 0) >>> 1 & 255;
n[e + 64 >> 0] = l;
n[e + 1 >> 0] = l;
l = (o + 1 + A | 0) >>> 1 & 255;
n[e + 65 >> 0] = l;
n[e + 2 >> 0] = l;
l = (A + 1 + t | 0) >>> 1 & 255;
n[e + 66 >> 0] = l;
n[e + 3 >> 0] = l;
l = o + 2 | 0;
n[e + 32 >> 0] = (l + a + (c << 1) | 0) >>> 2;
a = A + 2 | 0;
o = (a + c + (o << 1) | 0) >>> 2 & 255;
n[e + 96 >> 0] = o;
n[e + 33 >> 0] = o;
A = (l + (A << 1) + t | 0) >>> 2 & 255;
n[e + 97 >> 0] = A;
n[e + 34 >> 0] = A;
a = (a + (t << 1) + f | 0) >>> 2 & 255;
n[e + 98 >> 0] = a;
n[e + 35 >> 0] = a;
n[e + 67 >> 0] = (t + 2 + (f << 1) + r | 0) >>> 2;
n[e + 99 >> 0] = (f + 2 + (r << 1) + i | 0) >>> 2;
return
}
function qa(e) {
e = e | 0;
var i = 0,
r = 0,
f = 0,
t = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0;
l = u[e + -1 >> 0] | 0;
t = u[e + 31 >> 0] | 0;
i = u[e + 63 >> 0] | 0;
r = u[e + 95 >> 0] | 0;
A = u[e + -33 >> 0] | 0;
f = u[e + -32 >> 0] | 0;
a = u[e + -31 >> 0] | 0;
o = u[e + -30 >> 0] | 0;
c = l + 1 | 0;
s = (c + A | 0) >>> 1 & 255;
n[e + 34 >> 0] = s;
n[e >> 0] = s;
c = (c + t | 0) >>> 1 & 255;
n[e + 66 >> 0] = c;
n[e + 32 >> 0] = c;
c = (t + 1 + i | 0) >>> 1 & 255;
n[e + 98 >> 0] = c;
n[e + 64 >> 0] = c;
n[e + 96 >> 0] = (i + 1 + r | 0) >>> 1;
n[e + 3 >> 0] = (f + 2 + (a << 1) + o | 0) >>> 2;
n[e + 2 >> 0] = (A + 2 + (f << 1) + a | 0) >>> 2;
a = l + 2 | 0;
f = (a + (A << 1) + f | 0) >>> 2 & 255;
n[e + 35 >> 0] = f;
n[e + 1 >> 0] = f;
f = t + 2 | 0;
A = (f + (l << 1) + A | 0) >>> 2 & 255;
n[e + 67 >> 0] = A;
n[e + 33 >> 0] = A;
t = (a + i + (t << 1) | 0) >>> 2 & 255;
n[e + 99 >> 0] = t;
n[e + 65 >> 0] = t;
n[e + 97 >> 0] = (f + r + (i << 1) | 0) >>> 2;
return
}
function Ka(e) {
e = e | 0;
var i = 0,
r = 0,
f = 0,
t = 0,
a = 0,
A = 0;
A = u[e + -1 >> 0] | 0;
a = u[e + 31 >> 0] | 0;
t = u[e + 63 >> 0] | 0;
i = n[e + 95 >> 0] | 0;
r = i & 255;
f = a + 1 | 0;
n[e >> 0] = (f + A | 0) >>> 1;
f = (f + t | 0) >>> 1 & 255;
n[e + 32 >> 0] = f;
n[e + 2 >> 0] = f;
f = (t + 1 + r | 0) >>> 1 & 255;
n[e + 64 >> 0] = f;
n[e + 34 >> 0] = f;
f = t + 2 | 0;
n[e + 1 >> 0] = (f + A + (a << 1) | 0) >>> 2;
t = (r + 2 + a + (t << 1) | 0) >>> 2 & 255;
n[e + 33 >> 0] = t;
n[e + 3 >> 0] = t;
r = (f + r + (r << 1) | 0) >>> 2 & 255;
n[e + 65 >> 0] = r;
n[e + 35 >> 0] = r;
n[e + 66 >> 0] = i;
n[e + 67 >> 0] = i;
Bo(e + 96 | 0, i | 0, 4) | 0;
return
}
function Xa(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0;
i = 0;
r = 16;
while (1) {
if ((i | 0) == 16) break;
n = r + (u[e + ((i << 5) + -1) >> 0] | 0) + (u[e + (i + -32) >> 0] | 0) | 0;
i = i + 1 | 0;
r = n
}
wA(r >>> 5, e);
return
}
function Na(e) {
e = e | 0;
hA(e, 16);
return
}
function $a(e) {
e = e | 0;
var i = 0,
r = 0,
f = 0,
t = 0,
u = 0;
r = e + -32 | 0;
i = 0;
while (1) {
if ((i | 0) == 16) break;
f = e + (i << 5) | 0;
t = r;
u = f + 16 | 0;
do {
n[f >> 0] = n[t >> 0] | 0;
f = f + 1 | 0;
t = t + 1 | 0
} while ((f | 0) < (u | 0));
i = i + 1 | 0
}
return
}
function eA(e) {
e = e | 0;
var i = 0;
i = 16;
while (1) {
if (!i) break;
Bo(e | 0, n[e + -1 >> 0] | 0, 16) | 0;
i = i + -1 | 0;
e = e + 32 | 0
}
return
}
function iA(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0;
i = 0;
r = 8;
while (1) {
if ((i | 0) == 16) break;
n = r + (u[e + ((i << 5) + -1) >> 0] | 0) | 0;
i = i + 1 | 0;
r = n
}
wA(r >>> 4, e);
return
}
function rA(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0;
i = 0;
r = 8;
while (1) {
if ((i | 0) == 16) break;
n = r + (u[e + (i + -32) >> 0] | 0) | 0;
i = i + 1 | 0;
r = n
}
wA(r >>> 4, e);
return
}
function nA(e) {
e = e | 0;
wA(128, e);
return
}
function fA(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0;
i = 0;
r = 8;
while (1) {
if ((i | 0) == 8) break;
n = r + (u[e + (i + -32) >> 0] | 0) + (u[e + ((i << 5) + -1) >> 0] | 0) | 0;
i = i + 1 | 0;
r = n
}
bA(r >>> 4 & 255, e);
return
}
function tA(e) {
e = e | 0;
hA(e, 8);
return
}
function uA(e) {
e = e | 0;
var i = 0,
r = 0,
f = 0,
t = 0,
a = 0,
A = 0;
r = e + -32 | 0;
i = 0;
while (1) {
if ((i | 0) == 8) break;
t = r;
A = t;
A = u[A >> 0] | u[A + 1 >> 0] << 8 | u[A + 2 >> 0] << 16 | u[A + 3 >> 0] << 24;
t = t + 4 | 0;
t = u[t >> 0] | u[t + 1 >> 0] << 8 | u[t + 2 >> 0] << 16 | u[t + 3 >> 0] << 24;
f = e + (i << 5) | 0;
a = f;
n[a >> 0] = A;
n[a + 1 >> 0] = A >> 8;
n[a + 2 >> 0] = A >> 16;
n[a + 3 >> 0] = A >> 24;
f = f + 4 | 0;
n[f >> 0] = t;
n[f + 1 >> 0] = t >> 8;
n[f + 2 >> 0] = t >> 16;
n[f + 3 >> 0] = t >> 24;
i = i + 1 | 0
}
return
}
function aA(e) {
e = e | 0;
var i = 0;
i = 0;
while (1) {
if ((i | 0) == 8) break;
Bo(e | 0, n[e + -1 >> 0] | 0, 8) | 0;
i = i + 1 | 0;
e = e + 32 | 0
}
return
}
function AA(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0;
i = 0;
r = 4;
while (1) {
if ((i | 0) == 8) break;
n = r + (u[e + ((i << 5) + -1) >> 0] | 0) | 0;
i = i + 1 | 0;
r = n
}
bA(r >>> 3 & 255, e);
return
}
function lA(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0;
i = 0;
r = 4;
while (1) {
if ((i | 0) == 8) break;
n = r + (u[e + (i + -32) >> 0] | 0) | 0;
i = i + 1 | 0;
r = n
}
bA(r >>> 3 & 255, e);
return
}
function oA(e) {
e = e | 0;
bA(-128, e);
return
}
function cA(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0,
t = 0,
a = 0;
f = 0;
while (1) {
if ((f | 0) == 8) break;
t = 0;
while (1) {
if ((t | 0) == 8) break;
a = i + t | 0;
n[a >> 0] = sA(((u[e + t >> 0] | 0) + -120 >> 4) + (u[a >> 0] | 0) | 0) | 0;
t = t + 1 | 0
}
e = e + 8 | 0;
i = i + r | 0;
f = f + 1 | 0
}
return
}
function sA(e) {
e = e | 0;
return (e >>> 0 > 255 ? (e >>> 31) + 255 | 0 : e) & 255 | 0
}
function bA(e, i) {
e = e | 0;
i = i | 0;
var r = 0;
r = 0;
while (1) {
if ((r | 0) == 8) break;
Bo(i + (r << 5) | 0, e | 0, 8) | 0;
r = r + 1 | 0
}
return
}
function hA(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
f = 0,
a = 0,
A = 0,
l = 0;
A = e + -32 | 0;
l = (t[1926] | 0) + (0 - (u[e + -33 >> 0] | 0)) | 0;
f = 0;
while (1) {
if ((f | 0) >= (i | 0)) break;
a = l + (u[e + -1 >> 0] | 0) | 0;
r = 0;
while (1) {
if ((r | 0) == (i | 0)) break;
n[e + r >> 0] = n[a + (u[A + r >> 0] | 0) >> 0] | 0;
r = r + 1 | 0
}
e = e + 32 | 0;
f = f + 1 | 0
}
return
}
function wA(e, i) {
e = e | 0;
i = i | 0;
var r = 0;
r = e & 255;
e = 0;
while (1) {
if ((e | 0) == 16) break;
Bo(i + (e << 5) | 0, r | 0, 16) | 0;
e = e + 1 | 0
}
return
}
function kA(e, i) {
e = e | 0;
i = i | 0;
n[e >> 0] = i;
n[e + 1 >> 0] = i >> 8;
n[e + 2 >> 0] = i >> 16;
n[e + 3 >> 0] = i >> 24;
return
}
function gA(e, i, r, n, f, t, u) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
u = u | 0;
var a = 0;
a = f << 1 | 1;
f = n;
while (1) {
n = f + -1 | 0;
if ((f | 0) <= 0) break;
do {
if (vA(e, i, a, t) | 0)
if (!(CA(e, i, u) | 0)) {
dA(e, i);
break
} else {
IA(e, i);
break
}
} while (0);
e = e + r | 0;
f = n
}
return
}
function vA(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0;
b = u[e + (v(i, -3) | 0) >> 0] | 0;
s = u[e + (v(i, -2) | 0) >> 0] | 0;
c = u[e + (0 - i) >> 0] | 0;
f = u[e >> 0] | 0;
a = u[e + i >> 0] | 0;
l = u[e + (i << 1) >> 0] | 0;
o = u[e + (i * 3 | 0) >> 0] | 0;
A = t[1927] | 0;
if ((((((((u[A + (c - f) >> 0] | 0) << 2) + (u[A + (s - a) >> 0] | 0) | 0) <= (r | 0) ? (u[A + ((u[e + (v(i, -4) | 0) >> 0] | 0) - b) >> 0] | 0 | 0) <= (n | 0) : 0) ? (u[A + (b - s) >> 0] | 0 | 0) <= (n | 0) : 0) ? (u[A + (s - c) >> 0] | 0 | 0) <= (n | 0) : 0) ? (u[A + (o - l) >> 0] | 0 | 0) <= (n | 0) : 0) ? (u[A + (l - a) >> 0] | 0 | 0) <= (n | 0) : 0) e = (u[A + (a - f) >> 0] | 0 | 0) <= (n | 0) & 1;
else e = 0;
return e | 0
}
function CA(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0;
f = u[e + (v(i, -2) | 0) >> 0] | 0;
n = t[1927] | 0;
if ((u[n + (f - (u[e + (0 - i) >> 0] | 0)) >> 0] | 0 | 0) > (r | 0)) e = 1;
else e = (u[n + ((u[e + i >> 0] | 0) - (u[e >> 0] | 0)) >> 0] | 0 | 0) > (r | 0) & 1;
return e | 0
}
function IA(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
f = 0,
a = 0,
A = 0,
l = 0,
o = 0;
l = u[e + (v(i, -2) | 0) >> 0] | 0;
a = e + (0 - i) | 0;
A = u[a >> 0] | 0;
r = u[e >> 0] | 0;
l = ((r - A | 0) * 3 | 0) + (n[(t[1924] | 0) + (l - (u[e + i >> 0] | 0)) >> 0] | 0) | 0;
o = t[1925] | 0;
i = n[o + (l + 4 >> 3) >> 0] | 0;
f = t[1926] | 0;
n[a >> 0] = n[f + ((n[o + (l + 3 >> 3) >> 0] | 0) + A) >> 0] | 0;
n[e >> 0] = n[f + (r - i) >> 0] | 0;
return
}
function dA(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
f = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0;
b = e + (v(i, -2) | 0) | 0;
o = e + (0 - i) | 0;
c = u[o >> 0] | 0;
l = u[e >> 0] | 0;
i = e + i | 0;
f = u[i >> 0] | 0;
s = (l - c | 0) * 3 | 0;
r = t[1925] | 0;
A = n[r + (s + 4 >> 3) >> 0] | 0;
s = n[r + (s + 3 >> 3) >> 0] | 0;
r = A + 1 >> 1;
a = t[1926] | 0;
n[b >> 0] = n[a + (r + (u[b >> 0] | 0)) >> 0] | 0;
n[o >> 0] = n[a + (s + c) >> 0] | 0;
n[e >> 0] = n[a + (l - A) >> 0] | 0;
n[i >> 0] = n[a + (f - r) >> 0] | 0;
return
}
function mA(e, i, r, n, f, t, u) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
u = u | 0;
var a = 0;
a = f << 1 | 1;
f = n;
while (1) {
n = f + -1 | 0;
if ((f | 0) <= 0) break;
do {
if (vA(e, i, a, t) | 0)
if (!(CA(e, i, u) | 0)) {
pA(e, i);
break
} else {
IA(e, i);
break
}
} while (0);
e = e + r | 0;
f = n
}
return
}
function pA(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
f = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0;
g = e + (v(i, -3) | 0) | 0;
w = e + (v(i, -2) | 0) | 0;
k = u[w >> 0] | 0;
b = e + (0 - i) | 0;
h = u[b >> 0] | 0;
s = u[e >> 0] | 0;
A = e + i | 0;
o = u[A >> 0] | 0;
i = e + (i << 1) | 0;
f = u[i >> 0] | 0;
r = t[1924] | 0;
r = n[r + (((s - h | 0) * 3 | 0) + (n[r + (k - o) >> 0] | 0)) >> 0] | 0;
c = (r * 27 | 0) + 63 >> 7;
l = (r * 18 | 0) + 63 >> 7;
r = (r * 9 | 0) + 63 >> 7;
a = t[1926] | 0;
n[g >> 0] = n[a + (r + (u[g >> 0] | 0)) >> 0] | 0;
n[w >> 0] = n[a + (l + k) >> 0] | 0;
n[b >> 0] = n[a + (c + h) >> 0] | 0;
n[e >> 0] = n[a + (s - c) >> 0] | 0;
n[A >> 0] = n[a + (o - l) >> 0] | 0;
n[i >> 0] = n[a + (f - r) >> 0] | 0;
return
}
function yA(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0;
n = u[e + (v(i, -2) | 0) >> 0] | 0;
f = t[1927] | 0;
return (((u[f + ((u[e + (0 - i) >> 0] | 0) - (u[e >> 0] | 0)) >> 0] | 0) << 2) + (u[f + (n - (u[e + i >> 0] | 0)) >> 0] | 0) | 0) <= (r | 0) | 0
}
function PA(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0;
l = F;
F = F + 64 | 0;
r = l;
a = r;
A = 0;
while (1) {
if ((A | 0) == 4) break;
h = f[e >> 1] | 0;
b = f[e + 16 >> 1] | 0;
c = b + h | 0;
b = h - b | 0;
h = f[e + 8 >> 1] | 0;
o = f[e + 24 >> 1] | 0;
s = (h * 35468 >> 16) - o - (o * 20091 >> 16) | 0;
o = (h * 20091 >> 16) + h + (o * 35468 >> 16) | 0;
t[a >> 2] = o + c;
t[a + 4 >> 2] = s + b;
t[a + 8 >> 2] = b - s;
t[a + 12 >> 2] = c - o;
e = e + 2 | 0;
a = a + 16 | 0;
A = A + 1 | 0
}
e = 0;
while (1) {
if ((e | 0) == 4) break;
h = (t[r >> 2] | 0) + 4 | 0;
o = t[r + 32 >> 2] | 0;
s = h + o | 0;
o = h - o | 0;
h = t[r + 16 >> 2] | 0;
b = t[r + 48 >> 2] | 0;
c = (h * 35468 >> 16) - b - (b * 20091 >> 16) | 0;
b = (h * 20091 >> 16) + h + (b * 35468 >> 16) | 0;
n[i >> 0] = sA((b + s >> 3) + (u[i >> 0] | 0) | 0) | 0;
h = i + 1 | 0;
n[h >> 0] = sA((c + o >> 3) + (u[h >> 0] | 0) | 0) | 0;
h = i + 2 | 0;
n[h >> 0] = sA((o - c >> 3) + (u[h >> 0] | 0) | 0) | 0;
h = i + 3 | 0;
n[h >> 0] = sA((s - b >> 3) + (u[h >> 0] | 0) | 0) | 0;
i = i + 32 | 0;
r = r + 4 | 0;
e = e + 1 | 0
}
F = l;
return
}
function DA(e) {
e = e | 0;
var i = 0;
i = t[e + 2256 >> 2] | 0;
n[i + -2 >> 0] = 0;
n[i + -1 >> 0] = 0;
t[e + 2248 >> 2] = 0;
t[e + 2296 >> 2] = 0;
return
}
function BA(e) {
e = e | 0;
var i = 0;
if (e | 0) {
i = e + 56 | 0;
do {
t[e >> 2] = 0;
e = e + 4 | 0
} while ((e | 0) < (i | 0))
}
return
}
function EA(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
if ((r | 0) == 0 | (n & -256 | 0) != 512) e = 2;
else e = _A(e, i, r) | 0;
return e | 0
}
function _A(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
if ((e | 0) == 0 | (r | 0) == 0) e = 2;
else {
RA(r);
e = GA(e, i, r, r + 4 | 0, r + 8 | 0, r + 12 | 0, r + 16 | 0, 0) | 0
}
return e | 0
}
function RA(e) {
e = e | 0;
var i = 0;
i = e + 40 | 0;
do {
t[e >> 2] = 0;
e = e + 4 | 0
} while ((e | 0) < (i | 0));
return
}
function GA(e, i, r, n, f, u, a, A) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
u = u | 0;
a = a | 0;
A = A | 0;
var l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
v = 0,
C = 0,
I = 0,
d = 0,
m = 0,
p = 0,
y = 0,
P = 0,
D = 0,
B = 0,
E = 0,
_ = 0;
_ = F;
F = F + 80 | 0;
d = _ + 60 | 0;
I = _ + 56 | 0;
p = _ + 64 | 0;
y = _ + 52 | 0;
D = _ + 48 | 0;
B = _ + 44 | 0;
o = _ + 40 | 0;
E = _ + 4 | 0;
l = _;
t[d >> 2] = e;
t[I >> 2] = i;
t[p >> 2] = 0;
t[y >> 2] = 0;
t[D >> 2] = 0;
t[B >> 2] = 0;
t[o >> 2] = 0;
P = (A | 0) != 0;
if (P) v = t[A + 8 >> 2] | 0;
else v = 0;
e: do {
if (!((e | 0) == 0 | i >>> 0 < 12)) {
b = E + 8 | 0;
t[b >> 2] = 0;
t[b + 4 >> 2] = 0;
t[b + 8 >> 2] = 0;
t[b + 12 >> 2] = 0;
t[b + 16 >> 2] = 0;
t[b + 20 >> 2] = 0;
t[b + 24 >> 2] = 0;
t[E >> 2] = e;
t[E + 4 >> 2] = i;
b = E + 28 | 0;
e = TA(d, I, v, b) | 0;
if (!e) {
c = t[b >> 2] | 0;
s = (c | 0) != 0;
t[l >> 2] = 0;
e = MA(d, I, o, p, y, l) | 0;
if (!e) {
i = t[l >> 2] | 0;
e = i & 2;
k = (e | 0) != 0;
e = e >>> 1;
C = t[o >> 2] | 0;
g = (C | 0) != 0;
if (g & (s ^ 1)) e = 3;
else {
m = (f | 0) == 0;
if (!m) t[f >> 2] = i >>> 4 & 1;
if (u | 0) t[u >> 2] = e;
u = (a | 0) == 0;
if (!u) t[a >> 2] = 0;
t[D >> 2] = t[p >> 2];
t[B >> 2] = t[y >> 2];
h = (A | 0) == 0;
i: do {
if (!(h & (g & k))) {
do {
if ((t[I >> 2] | 0) >>> 0 >= 4) {
if (!(s & g))
if ((C | c | 0) == 0 ? (bo(t[d >> 2] | 0, 7933, 4) | 0) == 0 : 0) w = 19;
else e = c;
else w = 19;
if ((w | 0) == 19) {
e = SA(d, I, c, E + 16 | 0, E + 20 | 0) | 0;
if (e | 0) break;
e = t[b >> 2] | 0
}
i = E + 24 | 0;
o = E + 32 | 0;
e = xA(d, I, v, e, i, o) | 0;
if (!e) {
l = t[i >> 2] | 0;
if (l >>> 0 > 4294967286) {
e = 3;
break e
}
e = t[o >> 2] | 0;
if (!(u | k)) t[a >> 2] = (e | 0) == 0 ? 1 : 2;
i = t[I >> 2] | 0;
if (!e) {
if (i >>> 0 < 10) {
e = 7;
break
}
e = t[d >> 2] | 0;
if (!(FA(e, i, l, D, B) | 0)) {
e = 3;
break e
}
} else {
if (i >>> 0 < 5) {
e = 7;
break
}
e = t[d >> 2] | 0;
if (!(LA(e, i, D, B, f) | 0)) {
e = 3;
break e
}
}
o = e;
if (C | 0) {
if ((t[p >> 2] | 0) != (t[D >> 2] | 0)) {
e = 3;
break e
}
if ((t[y >> 2] | 0) != (t[B >> 2] | 0)) {
e = 3;
break e
}
}
if (!P) break i;
e = A;
i = E;
l = e + 36 | 0;
do {
t[e >> 2] = t[i >> 2];
e = e + 4 | 0;
i = i + 4 | 0
} while ((e | 0) < (l | 0));
t[A + 12 >> 2] = o - (t[A >> 2] | 0);
break i
}
} else e = 7
} while (0);
if (!(h & ((e | 0) == 7 & g))) break e
}
} while (0);
if (!m) t[f >> 2] = t[f >> 2] | (t[E + 16 >> 2] | 0) != 0;
if (r | 0) t[r >> 2] = t[D >> 2];
if (!n) {
e = 0;
break
}
t[n >> 2] = t[B >> 2];
e = 0;
break
}
}
}
} else e = 7
} while (0);
F = _;
return e | 0
}
function TA(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0,
a = 0;
t[n >> 2] = 0;
u = t[i >> 2] | 0;
if (u >>> 0 > 11 ? (a = t[e >> 2] | 0, (bo(a, 7953, 4) | 0) == 0) : 0)
if ((bo(a + 8 | 0, 7958, 4) | 0) == 0 ? (f = HA(a + 4 | 0) | 0, (f + -12 | 0) >>> 0 <= 4294967274) : 0)
if ((r | 0) != 0 & f >>> 0 > (u + -8 | 0) >>> 0) e = 7;
else {
t[n >> 2] = f;
t[e >> 2] = a + 12;
t[i >> 2] = (t[i >> 2] | 0) + -12;
e = 0
}
else e = 3;
else e = 0;
return e | 0
}
function MA(e, i, r, n, f, u) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
u = u | 0;
var a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0;
t[r >> 2] = 0;
o = t[i >> 2] | 0;
if (o >>> 0 >= 8) {
c = t[e >> 2] | 0;
if (!(bo(c, 7948, 4) | 0))
if ((HA(c + 4 | 0) | 0) == 10)
if (o >>> 0 >= 18) {
a = HA(c + 8 | 0) | 0;
A = (WA(c + 12 | 0) | 0) + 1 | 0;
l = (WA(c + 15 | 0) | 0) + 1 | 0;
s = wo(l | 0, ((l | 0) < 0) << 31 >> 31 | 0, A | 0, ((A | 0) < 0) << 31 >> 31 | 0) | 0;
b = m() | 0;
if (b >>> 0 > 0 | (b | 0) == 0 & s >>> 0 > 4294967295) e = 3;
else {
if (u | 0) t[u >> 2] = a;
if (n | 0) t[n >> 2] = A;
if (f | 0) t[f >> 2] = l;
t[e >> 2] = c + 18;
t[i >> 2] = o + -18;
t[r >> 2] = 1;
e = 0
}
} else e = 7;
else e = 3;
else e = 0
} else e = 7;
return e | 0
}
function SA(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0;
a = t[e >> 2] | 0;
A = t[i >> 2] | 0;
t[n >> 2] = 0;
t[f >> 2] = 0;
c = (r | 0) != 0;
u = 22;
while (1) {
t[e >> 2] = a;
t[i >> 2] = A;
if (A >>> 0 < 8) {
u = 7;
break
}
l = HA(a + 4 | 0) | 0;
if (l >>> 0 > 4294967286) {
u = 3;
break
}
o = l + 9 & -2;
u = o + u | 0;
if (c & u >>> 0 > r >>> 0) {
u = 3;
break
}
if (!(bo(a, 7943, 4) | 0)) {
u = 0;
break
}
if (!(bo(a, 7938, 4) | 0)) {
u = 0;
break
}
if (A >>> 0 < o >>> 0) {
u = 7;
break
}
if (!(bo(a, 7933, 4) | 0)) {
t[n >> 2] = a + 8;
t[f >> 2] = l
}
a = a + o | 0;
A = A - o | 0
}
return u | 0
}
function xA(e, i, r, n, f, u) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
u = u | 0;
var a = 0,
A = 0,
l = 0,
o = 0;
l = t[e >> 2] | 0;
a = (bo(l, 7938, 4) | 0) == 0;
o = a & 1;
A = t[i >> 2] | 0;
do {
if (A >>> 0 >= 8) {
if (!(a | (bo(l, 7943, 4) | 0) == 0)) {
t[u >> 2] = QA(l, A) | 0;
t[f >> 2] = t[i >> 2];
a = 0;
break
}
a = HA(l + 4 | 0) | 0;
if (!(n >>> 0 > 11 & a >>> 0 > (n + -12 | 0) >>> 0))
if ((r | 0) != 0 & a >>> 0 > (A + -8 | 0) >>> 0) a = 7;
else {
t[f >> 2] = a;
t[e >> 2] = l + 8;
t[i >> 2] = (t[i >> 2] | 0) + -8;
t[u >> 2] = o;
a = 0
}
else a = 3
} else a = 7
} while (0);
return a | 0
}
function FA(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var a = 0,
A = 0;
if (((!((e | 0) == 0 | i >>> 0 < 10) ? (UA(e + 3 | 0, i + -3 | 0) | 0) != 0 : 0) ? (i = u[e >> 0] | 0, a = (u[e + 7 >> 0] | 0) << 8 & 16128 | (u[e + 6 >> 0] | 0), A = (u[e + 9 >> 0] | 0) << 8 & 16128 | (u[e + 8 >> 0] | 0), (i & 25 | 0) == 16 ? ((u[e + 1 >> 0] | 0) << 8 | i | (u[e + 2 >> 0] | 0) << 16) >>> 5 >>> 0 < r >>> 0 : 0) : 0) ? !((a | 0) == 0 | (A | 0) == 0) : 0) {
if (n | 0) t[n >> 2] = a;
if (!f) e = 1;
else {
t[f >> 2] = A;
e = 1
}
} else e = 0;
return e | 0
}
function LA(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var u = 0,
a = 0,
A = 0,
l = 0,
o = 0;
o = F;
F = F + 48 | 0;
u = o + 40 | 0;
a = o + 36 | 0;
A = o + 32 | 0;
l = o;
if (!((e | 0) == 0 | i >>> 0 < 5) ? (QA(e, i) | 0) != 0 : 0) {
vn(l, e, i);
if (YA(l, u, a, A) | 0) {
if (r | 0) t[r >> 2] = t[u >> 2];
if (n | 0) t[n >> 2] = t[a >> 2];
if (!f) e = 1;
else {
t[f >> 2] = t[A >> 2];
e = 1
}
} else e = 0
} else e = 0;
F = o;
return e | 0
}
function QA(e, i) {
e = e | 0;
i = i | 0;
if (i >>> 0 > 4 ? (n[e >> 0] | 0) == 47 : 0) e = (u[e + 4 >> 0] | 0) < 32 & 1;
else e = 0;
return e | 0
}
function YA(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
if ((Ji(e, 8) | 0) == 47 ? (t[i >> 2] = (Ji(e, 14) | 0) + 1, t[r >> 2] = (Ji(e, 14) | 0) + 1, t[n >> 2] = Ji(e, 1) | 0, (Ji(e, 3) | 0) == 0) : 0) e = (t[e + 24 >> 2] | 0) == 0 & 1;
else e = 0;
return e | 0
}
function UA(e, i) {
e = e | 0;
i = i | 0;
if ((i >>> 0 > 2 ? (n[e >> 0] | 0) == -99 : 0) ? (n[e + 1 >> 0] | 0) == 1 : 0) e = (n[e + 2 >> 0] | 0) == 42 & 1;
else e = 0;
return e | 0
}
function HA(e) {
e = e | 0;
var i = 0;
i = VA(e) | 0;
return (VA(e + 2 | 0) | 0) << 16 | i | 0
}
function VA(e) {
e = e | 0;
return (u[e + 1 >> 0] | 0) << 8 | (u[e >> 0] | 0) | 0
}
function WA(e) {
e = e | 0;
var i = 0;
i = VA(e) | 0;
return (u[e + 2 >> 0] | 0) << 16 | i | 0
}
function ZA(e) {
e = e | 0;
if (e | 0) {
zA(e);
ii(e)
}
return
}
function zA(e) {
e = e | 0;
var i = 0;
if (e | 0) {
uc[t[(Ju() | 0) + 20 >> 2] & 31](e + 124 | 0);
ei(e);
i = e + 2288 | 0;
ii(t[i >> 2] | 0);
t[i >> 2] = 0;
t[e + 2292 >> 2] = 0;
i = e + 12 | 0;
t[i >> 2] = 0;
t[i + 4 >> 2] = 0;
t[i + 8 >> 2] = 0;
t[i + 12 >> 2] = 0;
t[i + 16 >> 2] = 0;
t[i + 20 >> 2] = 0;
t[i + 24 >> 2] = 0;
t[e + 4 >> 2] = 0
}
return
}
function OA(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0;
do {
if (!e) i = 0;
else {
n = t[e + 8 >> 2] | 0;
u = t[n + 40 >> 2] | 0;
a = e + 4 | 0;
do {
if (t[a >> 2] | 0) {
r = e + 12 | 0;
t[r >> 2] = t[u >> 2];
if (!(Qf(t[u + 20 >> 2] | 0, n, 3) | 0)) {
t[e >> 2] = 2;
break
}
if (mn(e, t[n >> 2] | 0) | 0) {
i = n + 92 | 0;
if (t[i >> 2] | 0) {
if (!(JA(e, n) | 0)) break;
if (t[i >> 2] | 0) A = 10;
else A = 9
} else A = 9;
if ((A | 0) == 9) {
i = t[t[r >> 2] >> 2] | 0;
if (jA(i) | 0) A = 10
}
if ((A | 0) == 10) {
Bi();
i = t[t[r >> 2] >> 2] | 0
}
if ((ir(i) | 0) == 0 ? (qA(), t[(t[r >> 2] | 0) + 28 >> 2] | 0) : 0) Bi();
if (((t[e + 56 >> 2] | 0 ? (t[e + 120 >> 2] | 0) > 0 : 0) ? (f = e + 136 | 0, (t[f >> 2] | 0) == 0) : 0) ? (Pn(f, t[e + 132 >> 2] | 0) | 0) == 0 : 0) {
t[e >> 2] = 1;
break
}
t[a >> 2] = 0;
A = 20
}
} else A = 20
} while (0);
if ((A | 0) == 20 ? Ri(e, t[e + 16 >> 2] | 0, t[e + 100 >> 2] | 0, t[e + 104 >> 2] | 0, t[n + 88 >> 2] | 0, 2) | 0 : 0) {
t[u + 16 >> 2] = t[e + 116 >> 2];
i = 1;
break
}
fi(e);
i = 0
}
} while (0);
return i | 0
}
function JA(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0;
f = t[i + 12 >> 2] | 0;
u = t[i + 96 >> 2] | 0;
a = t[i + 16 >> 2] | 0;
n = t[i + 100 >> 2] | 0;
r = ((u | 0) < 0) << 31 >> 31;
i = po(u | 0, r | 0, 5) | 0;
l = ko(i | 0, m() | 0, 84, 0) | 0;
A = m() | 0;
r = po(u | 0, r | 0, 2) | 0;
r = ko(l | 0, A | 0, r | 0, m() | 0) | 0;
r = mi(r, m() | 0, 1) | 0;
if (!r) {
t[e >> 2] = 1;
i = 0
} else {
t[e + 264 >> 2] = r;
t[e + 268 >> 2] = r;
l = r + 84 | 0;
Ct(r, f, a, l + i | 0, u, n, 0, 4, l);
i = 1
}
return i | 0
}
function jA(e) {
e = e | 0;
return (e + -7 | 0) >>> 0 < 4 | 0
}
function qA() {
var e = 0;
if (!(Eo(9220) | 0)) {
if (!(t[1942] | 0)) e = 0;
else {
KA();
e = t[2248] | 0
}
t[1942] = e;
_o(9220) | 0
}
return
}
function KA() {
var e = 0,
i = 0,
r = 0,
n = 0,
f = 0,
u = 0,
a = 0;
e = F;
F = F + 32 | 0;
i = e + 20 | 0;
t[i >> 2] = 0;
r = e + 16 | 0;
t[r >> 2] = 0;
n = e + 12 | 0;
t[n >> 2] = 0;
f = e + 8 | 0;
t[f >> 2] = 0;
u = e + 4 | 0;
t[u >> 2] = 0;
a = e;
t[a >> 2] = 0;
t[a >> 2] = 3;
t[u >> 2] = 4;
t[f >> 2] = 18;
t[n >> 2] = 1;
t[r >> 2] = 19;
t[i >> 2] = 18;
F = e;
return
}
function XA(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0,
u = 0;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break;
u = t[e + (f << 2) >> 2] | 0;
n[i + f >> 0] = ll(u >>> 16 & 255, u >>> 8 & 255, u & 255) | 0;
f = f + 1 | 0
}
return
}
function NA(e, i, r, f, a) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
a = a | 0;
var A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0;
l = f >> 1;
c = (a | 0) == 0;
o = 0;
while (1) {
if ((o | 0) >= (l | 0)) break;
a = o << 1;
A = t[e + (a << 2) >> 2] | 0;
a = t[e + ((a | 1) << 2) >> 2] | 0;
b = (a >>> 15 & 510) + (A >>> 15 & 510) | 0;
s = (a >>> 7 & 510) + (A >>> 7 & 510) | 0;
A = (a << 1 & 510) + (A << 1 & 510) | 0;
a = ul(b, s, A) | 0;
A = al(b, s, A) | 0;
if (c) {
b = i + o | 0;
n[b >> 0] = (a + 1 + (u[b >> 0] | 0) | 0) >>> 1;
b = r + o | 0;
n[b >> 0] = (A + 1 + (u[b >> 0] | 0) | 0) >>> 1
} else {
n[i + o >> 0] = a;
n[r + o >> 0] = A
}
o = o + 1 | 0
}
do {
if (f & 1 | 0) {
A = t[e + (o << 1 << 2) >> 2] | 0;
s = A >>> 14 & 1020;
b = A >>> 6 & 1020;
A = A << 2 & 1020;
a = ul(s, b, A) | 0;
A = al(s, b, A) | 0;
if (c) {
b = i + o | 0;
n[b >> 0] = (a + 1 + (u[b >> 0] | 0) | 0) >>> 1;
b = r + o | 0;
n[b >> 0] = (A + 1 + (u[b >> 0] | 0) | 0) >>> 1;
break
} else {
n[i + o >> 0] = a;
n[r + o >> 0] = A;
break
}
}
} while (0);
return
}
function $A(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break;
n[i + f >> 0] = ll(u[e >> 0] | 0, u[e + 1 >> 0] | 0, u[e + 2 >> 0] | 0) | 0;
f = f + 1 | 0;
e = e + 3 | 0
}
return
}
function el(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0;
f = 0;
while (1) {
if ((f | 0) >= (r | 0)) break;
n[i + f >> 0] = ll(u[e + 2 >> 0] | 0, u[e + 1 >> 0] | 0, u[e >> 0] | 0) | 0;
f = f + 1 | 0;
e = e + 3 | 0
}
return
}
function il(e, i, r, f) {
e = e | 0;
i = i | 0;
r = r | 0;
f = f | 0;
var t = 0,
u = 0,
A = 0,
l = 0;
t = 0;
while (1) {
if ((t | 0) >= (f | 0)) break;
l = a[e >> 1] | 0;
A = a[e + 2 >> 1] | 0;
u = a[e + 4 >> 1] | 0;
n[i + t >> 0] = ul(l, A, u) | 0;
n[r + t >> 0] = al(l, A, u) | 0;
e = e + 8 | 0;
t = t + 1 | 0
}
return
}
function rl(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var t = 0,
u = 0,
A = 0,
l = 0,
o = 0;
t = 0;
u = 0;
A = 0;
while (1) {
if ((t | 0) >= (n | 0)) break;
l = (a[e + (t << 1) >> 1] | 0) - (a[i + (t << 1) >> 1] | 0) | 0;
o = r + (t << 1) | 0;
f[o >> 1] = tl(l + (a[o >> 1] | 0) | 0) | 0;
l = (l | 0) > -1 ? l : 0 - l | 0;
l = ko(u | 0, A | 0, l | 0, ((l | 0) < 0) << 31 >> 31 | 0) | 0;
t = t + 1 | 0;
u = l;
A = m() | 0
}
d(A | 0);
return u | 0
}
function nl(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var t = 0,
u = 0;
t = 0;
while (1) {
if ((t | 0) >= (n | 0)) break;
u = r + (t << 1) | 0;
f[u >> 1] = (a[e + (t << 1) >> 1] | 0) - (a[i + (t << 1) >> 1] | 0) + (a[u >> 1] | 0);
t = t + 1 | 0
}
return
}
function fl(e, i, r, n, t) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
t = t | 0;
var u = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0;
u = 0;
while (1) {
if ((u | 0) >= (r | 0)) break;
c = f[e >> 1] | 0;
l = e + 2 | 0;
h = f[l >> 1] | 0;
b = f[i >> 1] | 0;
A = i + 2 | 0;
s = f[A >> 1] | 0;
o = u << 1;
f[t + (o << 1) >> 1] = tl(((c * 9 | 0) + 8 + s + ((b + h | 0) * 3 | 0) >> 4) + (a[n + (o << 1) >> 1] | 0) | 0) | 0;
o = o | 1;
f[t + (o << 1) >> 1] = tl(((h * 9 | 0) + 8 + b + ((s + c | 0) * 3 | 0) >> 4) + (a[n + (o << 1) >> 1] | 0) | 0) | 0;
e = l;
i = A;
u = u + 1 | 0
}
return
}
function tl(e) {
e = e | 0;
if ((e | 0) < 0) return 0;
else return ((e | 0) < 1023 ? e : 1023) & 65535 | 0;
return 0
}
function ul(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
return Al((v(i, -19081) | 0) + (v(e, -9719) | 0) + (r * 28800 | 0) | 0) | 0
}
function al(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
return Al((v(i, -24116) | 0) + (e * 28800 | 0) + (v(r, -4684) | 0) | 0) | 0
}
function Al(e) {
e = e | 0;
var i = 0;
i = e + 33685504 >> 18;
return (i >>> 0 < 256 ? i : (e | 0) < -33685504 ? 0 : 255) | 0
}
function ll(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
return (e * 16839 | 0) + 1081344 + (i * 33059 | 0) + (r * 6420 | 0) >> 16 | 0
}
function ol(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0;
u = F;
F = F + 16 | 0;
r = u + 8 | 0;
n = u + 4 | 0;
f = u;
do {
if (!e) e = 0;
else {
if (!i) {
t[e >> 2] = 2;
e = 0;
break
}
t[e + 8 >> 2] = i;
t[e >> 2] = 0;
a = e + 24 | 0;
vn(a, t[i + 64 >> 2] | 0, t[i + 60 >> 2] | 0);
if (YA(a, r, n, f) | 0) {
t[e + 4 >> 2] = 2;
f = t[r >> 2] | 0;
t[i >> 2] = f;
a = t[n >> 2] | 0;
t[i + 4 >> 2] = a;
if (Cn(f, a, 1, e, 0) | 0) {
e = 1;
break
}
} else t[e >> 2] = 3;
fi(e);
e = 0
}
} while (0);
F = u;
return e | 0
}
function cl(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0;
n = i + 288 | 0;
r = 0;
while (1) {
if ((r | 0) >= (t[n >> 2] | 0)) break;
wl(e, i, r);
r = r + 1 | 0
}
return (t[i + 36 >> 2] | 0) == 0 | 0
}
function sl(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
f = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0;
f = t[e + 2256 >> 2] | 0;
A = e + 2296 | 0;
l = t[A >> 2] | 0;
a = f + (l << 1) | 0;
o = t[e + 2304 >> 2] | 0;
if ((t[e + 2236 >> 2] | 0) != 0 ? (c = n[o + (l * 800 | 0) + 797 >> 0] | 0, r = c & 255, c << 24 >> 24 != 0) : 0) {
n[a >> 0] = 0;
n[f + -2 >> 0] = 0;
if (!(n[o + (l * 800 | 0) + 768 >> 0] | 0)) {
n[f + (l << 1) + 1 >> 0] = 0;
n[f + -1 >> 0] = 0
}
t[o + (l * 800 | 0) + 788 >> 2] = 0;
t[o + (l * 800 | 0) + 792 >> 2] = 0;
n[o + (l * 800 | 0) + 796 >> 0] = 0
} else r = bl(e, a, i) | 0;
if ((t[e + 2308 >> 2] | 0) > 0) {
a = t[e + 2260 >> 2] | 0;
c = t[A >> 2] | 0;
A = a + (c << 2) | 0;
o = e + 2312 + (u[o + (l * 800 | 0) + 798 >> 0] << 3) + (u[o + (l * 800 | 0) + 768 >> 0] << 2) | 0;
o = u[o >> 0] | u[o + 1 >> 0] << 8 | u[o + 2 >> 0] << 16 | u[o + 3 >> 0] << 24;
n[A >> 0] = o;
n[A + 1 >> 0] = o >> 8;
n[A + 2 >> 0] = o >> 16;
n[A + 3 >> 0] = o >> 24;
c = a + (c << 2) + 2 | 0;
n[c >> 0] = u[c >> 0] | (r | 0) == 0
}
return (t[i + 24 >> 2] | 0) == 0 | 0
}
function bl(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
v = 0,
C = 0,
I = 0,
d = 0,
m = 0,
p = 0,
y = 0,
P = 0,
D = 0,
B = 0,
E = 0,
_ = 0;
B = F;
F = F + 32 | 0;
a = B;
P = t[e + 2304 >> 2] | 0;
D = t[e + 2296 >> 2] | 0;
o = P + (D * 800 | 0) | 0;
y = u[P + (D * 800 | 0) + 798 >> 0] | 0;
l = t[e + 2256 >> 2] | 0;
Bo(o | 0, 0, 768) | 0;
if (!(n[P + (D * 800 | 0) + 768 >> 0] | 0)) {
t[a >> 2] = 0;
t[a + 4 >> 2] = 0;
t[a + 8 >> 2] = 0;
t[a + 12 >> 2] = 0;
t[a + 16 >> 2] = 0;
t[a + 20 >> 2] = 0;
t[a + 24 >> 2] = 0;
t[a + 28 >> 2] = 0;
m = i + 1 | 0;
I = l + -1 | 0;
p = tc[t[2312] & 1](r, e + 2032 | 0, (u[I >> 0] | 0) + (u[m >> 0] | 0) | 0, e + 776 + (y << 5) + 8 | 0, 0, a) | 0;
d = (p | 0) > 0 & 1;
n[I >> 0] = d;
n[m >> 0] = d;
e: do {
if ((p | 0) > 1) pa(a, o);
else {
A = (f[a >> 1] | 0) + 3 >> 3 & 65535;
a = 0;
while (1) {
if (a >>> 0 >= 256) break e;
f[P + (D * 800 | 0) + (a << 1) >> 1] = A;
a = a + 16 | 0
}
}
} while (0);
v = 1;
a = 0
} else {
v = 0;
a = 3
}
k = e + 1964 + (a * 68 | 0) | 0;
p = l + -2 | 0;
w = e + 776 + (y << 5) | 0;
g = n[i >> 0] & 15;
a = n[p >> 0] & 15;
m = 0;
h = 0;
while (1) {
if ((h | 0) == 4) break;
s = a & 255;
b = 0;
A = s & 1;
l = 0;
c = o;
a = g;
while (1) {
if ((l | 0) == 4) break;
d = a & 255;
C = tc[t[2312] & 1](r, k, (d & 1) + A | 0, w, v, c) | 0;
I = (C | 0) > (v | 0) & 1;
b = hl(b, C, (f[c >> 1] | 0) != 0 & 1) | 0;
A = I;
l = l + 1 | 0;
c = c + 32 | 0;
a = (I << 7 | d >>> 1) & 255
}
o = o + 128 | 0;
g = (a & 255) >>> 4;
a = (A << 7 | s >>> 1) & 255;
m = b | m << 8;
h = h + 1 | 0
}
C = e + 2100 | 0;
I = e + 776 + (y << 5) + 16 | 0;
d = 0;
v = (a & 255) >>> 4;
s = g & 255;
b = 0;
k = P + (D * 800 | 0) + 512 | 0;
while (1) {
if (b >>> 0 >= 4) break;
A = b + 4 | 0;
a = 0;
h = (u[p >> 0] | 0) >>> A;
w = 0;
A = (u[i >> 0] | 0) >>> A;
g = k;
while (1) {
if ((w | 0) == 2) break;
c = h & 1;
o = 0;
l = g;
while (1) {
if ((o | 0) == 2) break;
_ = tc[t[2312] & 1](r, C, c + (A & 1) | 0, I, 0, l) | 0;
E = (_ | 0) > 0 & 1;
c = E;
a = hl(a, _, (f[l >> 1] | 0) != 0 & 1) | 0;
o = o + 1 | 0;
A = E << 3 | A >>> 1 & 127;
l = l + 32 | 0
}
h = c << 5 | h >>> 1 & 127;
w = w + 1 | 0;
A = A >>> 2 & 63;
g = g + 64 | 0
}
d = a << (b << 2) | d;
v = (h & 240) << b | v;
s = (A << 4 & 4080) << b | s;
b = b + 2 | 0;
k = k + 128 | 0
}
n[i >> 0] = s;
n[p >> 0] = v;
t[P + (D * 800 | 0) + 788 >> 2] = m;
t[P + (D * 800 | 0) + 792 >> 2] = d;
if (!(d & 43690)) a = t[e + 776 + (y << 5) + 28 >> 2] & 255;
else a = 0;
n[P + (D * 800 | 0) + 796 >> 0] = a;
F = B;
return (d | m | 0) == 0 | 0
}
function hl(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
return ((i | 0) > 3 ? 3 : (i | 0) > 1 ? 2 : r) | e << 2 | 0
}
function wl(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0;
k = (t[i + 2244 >> 2] | 0) + (r << 2) | 0;
a = i + 2248 | 0;
g = t[i + 2304 >> 2] | 0;
if (!(t[i + 108 >> 2] | 0)) f = 0;
else {
if (!(kl(e, u[i + 904 >> 0] | 0) | 0)) f = kl(e, u[i + 905 >> 0] | 0) | 0;
else f = (kl(e, u[i + 906 >> 0] | 0) | 0) + 2 | 0;
f = f & 255
}
n[g + (r * 800 | 0) + 798 >> 0] = f;
if (t[i + 2236 >> 2] | 0) n[g + (r * 800 | 0) + 797 >> 0] = kl(e, u[i + 2240 >> 0] | 0) | 0;
w = (kl(e, 145) | 0) == 0;
n[g + (r * 800 | 0) + 768 >> 0] = w & 1;
e: do {
if (w) {
f = g + (r * 800 | 0) + 769 | 0;
l = 0;
while (1) {
if ((l | 0) == 4) break e;
c = i + 2248 + l | 0;
a = 0;
A = u[c >> 0] | 0;
while (1) {
if ((a | 0) == 4) break;
s = k + a | 0;
b = u[s >> 0] | 0;
o = kl(e, u[4192 + (b * 90 | 0) + (A * 9 | 0) >> 0] | 0) | 0;
while (1) {
h = n[5104 + o >> 0] | 0;
w = h << 24 >> 24;
if (!(41706 >>> o & 1)) break;
o = (kl(e, u[4192 + (b * 90 | 0) + (A * 9 | 0) + w >> 0] | 0) | 0) + (w << 1) | 0
}
A = 0 - (h << 24 >> 24) | 0;
n[s >> 0] = A;
a = a + 1 | 0
}
w = u[k >> 0] | u[k + 1 >> 0] << 8 | u[k + 2 >> 0] << 16 | u[k + 3 >> 0] << 24;
n[f >> 0] = w;
n[f + 1 >> 0] = w >> 8;
n[f + 2 >> 0] = w >> 16;
n[f + 3 >> 0] = w >> 24;
n[c >> 0] = A;
f = f + 4 | 0;
l = l + 1 | 0
}
} else {
if (!(kl(e, 156) | 0)) {
f = (kl(e, 163) | 0) == 0;
f = f ? 0 : 2
} else {
f = (kl(e, 128) | 0) == 0;
f = f ? 3 : 1
}
i = f & 255;
n[g + (r * 800 | 0) + 769 >> 0] = i;
Bo(k | 0, i | 0, 4) | 0;
Bo(a | 0, i | 0, 4) | 0
}
} while (0);
if (kl(e, 142) | 0)
if (!(kl(e, 114) | 0)) f = 2;
else {
f = (kl(e, 183) | 0) == 0;
f = f ? 3 : 1
}
else f = 0;
n[g + (r * 800 | 0) + 785 >> 0] = f;
return
}
function kl(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0;
a = e + 4 | 0;
u = t[a >> 2] | 0;
A = e + 8 | 0;
r = t[A >> 2] | 0;
if ((r | 0) < 0) {
gl(e);
f = t[A >> 2] | 0
} else f = r;
r = (v(u, i) | 0) >>> 8;
i = t[e >> 2] | 0;
n = i >>> f >>> 0 > r >>> 0;
if (n) {
t[e >> 2] = i - (r + 1 << f);
r = u - r | 0
} else r = r + 1 | 0;
u = (vl(r) | 0) ^ 7;
t[A >> 2] = f - u;
t[a >> 2] = (r << u) + -1;
return n & 1 | 0
}
function gl(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0;
i = e + 12 | 0;
r = t[i >> 2] | 0;
if (r >>> 0 < (t[e + 20 >> 2] | 0) >>> 0) {
n = u[r >> 0] | u[r + 1 >> 0] << 8 | u[r + 2 >> 0] << 16 | u[r + 3 >> 0] << 24;
t[i >> 2] = r + 3;
r = (Cl(n) | 0) >>> 8;
t[e >> 2] = t[e >> 2] << 24 | r;
r = e + 8 | 0;
t[r >> 2] = (t[r >> 2] | 0) + 24
} else Il(e);
return
}
function vl(e) {
e = e | 0;
return (C(e | 0) | 0) ^ 31 | 0
}
function Cl(e) {
e = e | 0;
return yo(e | 0) | 0
}
function Il(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0;
i = e + 12 | 0;
r = t[i >> 2] | 0;
do {
if (r >>> 0 >= (t[e + 16 >> 2] | 0) >>> 0) {
i = e + 24 | 0;
if (!(t[i >> 2] | 0)) {
t[e >> 2] = t[e >> 2] << 8;
e = e + 8 | 0;
t[e >> 2] = (t[e >> 2] | 0) + 8;
t[i >> 2] = 1;
break
} else {
t[e + 8 >> 2] = 0;
break
}
} else {
n = e + 8 | 0;
t[n >> 2] = (t[n >> 2] | 0) + 8;
t[i >> 2] = r + 1;
t[e >> 2] = t[e >> 2] << 8 | (u[r >> 0] | 0)
}
} while (0);
return
}
function dl(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0;
e: do {
if (e) {
pl(e);
if (!i) {
fa(e, 2, 7963) | 0;
r = 0;
break
}
o = t[i + 64 >> 2] | 0;
c = t[i + 60 >> 2] | 0;
if (c >>> 0 < 4) {
fa(e, 7, 8e3) | 0;
r = 0;
break
}
a = u[o >> 0] | 0;
r = u[o + 1 >> 0] << 8 | a | u[o + 2 >> 0] << 16;
l = (a & 1 ^ 1) & 255;
b = e + 40 | 0;
n[b >> 0] = l;
A = a >>> 1 & 7;
n[e + 41 >> 0] = A;
a = a >>> 4 & 1;
n[e + 42 >> 0] = a;
r = r >>> 5;
s = e + 44 | 0;
t[s >> 2] = r;
if ((A & 255) > 3) {
fa(e, 3, 8018) | 0;
r = 0;
break
}
if (!(a << 24 >> 24)) {
fa(e, 4, 8049) | 0;
r = 0;
break
}
A = o + 3 | 0;
a = c + -3 | 0;
do {
if (l << 24 >> 24) {
if (a >>> 0 < 7) {
fa(e, 7, 8072) | 0;
r = 0;
break e
}
if (!(UA(A, a) | 0)) {
fa(e, 3, 8100) | 0;
r = 0;
break e
} else {
l = o + 7 | 0;
r = u[l >> 0] << 8 & 16128 | u[o + 6 >> 0];
f[e + 48 >> 1] = r;
n[e + 52 >> 0] = (u[l >> 0] | 0) >>> 6;
l = o + 9 | 0;
a = u[l >> 0] << 8 & 16128 | u[o + 8 >> 0];
f[e + 50 >> 1] = a;
n[e + 53 >> 0] = (u[l >> 0] | 0) >>> 6;
t[e + 288 >> 2] = (r + 15 | 0) >>> 4;
t[e + 292 >> 2] = (a + 15 | 0) >>> 4;
t[i >> 2] = r;
t[i + 4 >> 2] = a;
t[i + 72 >> 2] = 0;
t[i + 84 >> 2] = 0;
t[i + 76 >> 2] = 0;
t[i + 80 >> 2] = r;
t[i + 88 >> 2] = a;
t[i + 92 >> 2] = 0;
t[i + 96 >> 2] = r;
t[i + 100 >> 2] = a;
t[i + 12 >> 2] = r;
t[i + 16 >> 2] = a;
yl(e + 904 | 0);
Pl(e + 104 | 0);
i = o + 10 | 0;
a = c + -10 | 0;
r = t[s >> 2] | 0;
break
}
} else i = A
} while (0);
if (r >>> 0 > a >>> 0) {
fa(e, 7, 8114) | 0;
r = 0;
break
}
A = e + 12 | 0;
Dl(A, i, r);
r = t[s >> 2] | 0;
if (n[b >> 0] | 0) {
n[e + 54 >> 0] = Bl(A) | 0;
n[e + 55 >> 0] = Bl(A) | 0
}
if (!(El(A, e + 104 | 0, e + 904 | 0) | 0)) {
fa(e, 3, 8135) | 0;
r = 0;
break
}
if (!(_l(A, e) | 0)) {
fa(e, 3, 8163) | 0;
r = 0;
break
}
r = Rl(e, i + r | 0, a - r | 0) | 0;
if (r | 0) {
fa(e, r, 8190) | 0;
r = 0;
break
}
Gl(e);
if (!(n[b >> 0] | 0)) {
fa(e, 4, 8214) | 0;
r = 0;
break
} else {
Bl(A) | 0;
Tl(A, e);
t[e + 4 >> 2] = 1;
r = 1;
break
}
} else r = 0
} while (0);
return r | 0
}
function ml(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0;
t[e + 12 >> 2] = i;
n = i + r | 0;
t[e + 16 >> 2] = n;
t[e + 20 >> 2] = r >>> 0 > 3 ? n + -4 + 1 | 0 : i;
return
}
function pl(e) {
e = e | 0;
t[e >> 2] = 0;
t[e + 8 >> 2] = 8231;
return
}
function yl(e) {
e = e | 0;
f[e >> 1] = 65535;
n[e + 2 >> 0] = 255;
return
}
function Pl(e) {
e = e | 0;
t[e >> 2] = 0;
t[e + 4 >> 2] = 0;
t[e + 8 >> 2] = 1;
t[e + 12 >> 2] = 0;
t[e + 16 >> 2] = 0;
return
}
function Dl(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
t[e + 4 >> 2] = 254;
t[e >> 2] = 0;
t[e + 8 >> 2] = -8;
t[e + 24 >> 2] = 0;
ml(e, i, r);
Fl(e);
return
}
function Bl(e) {
e = e | 0;
return Ml(e, 1) | 0
}
function El(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0,
u = 0,
a = 0;
a = Bl(e) | 0;
t[i >> 2] = a;
e: do {
if (a) {
a = i + 4 | 0;
t[a >> 2] = Bl(e) | 0;
i: do {
if (Bl(e) | 0) {
t[i + 8 >> 2] = Bl(e) | 0;
f = 0;
while (1) {
if ((f | 0) == 4) break;
if (!(Bl(e) | 0)) u = 0;
else u = Ul(e, 7) | 0;
n[i + 12 + f >> 0] = u;
f = f + 1 | 0
}
f = 0;
while (1) {
if ((f | 0) == 4) break i;
if (!(Bl(e) | 0)) u = 0;
else u = Ul(e, 6) | 0;
n[i + 16 + f >> 0] = u;
f = f + 1 | 0
}
}
} while (0);
if (t[a >> 2] | 0) {
f = 0;
while (1) {
if ((f | 0) == 3) break e;
if (!(Bl(e) | 0)) u = 255;
else u = Ml(e, 8) | 0;
n[r + f >> 0] = u;
f = f + 1 | 0
}
}
} else t[i + 4 >> 2] = 0
} while (0);
return (t[e + 24 >> 2] | 0) == 0 | 0
}
function _l(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0;
n = i + 56 | 0;
t[n >> 2] = Bl(e) | 0;
f = i + 60 | 0;
t[f >> 2] = Ml(e, 6) | 0;
t[i + 64 >> 2] = Ml(e, 3) | 0;
r = Bl(e) | 0;
t[i + 68 >> 2] = r;
e: do {
if (r | 0 ? Bl(e) | 0 : 0) {
r = 0;
while (1) {
if ((r | 0) == 4) break;
if (Bl(e) | 0) t[i + 72 + (r << 2) >> 2] = Ul(e, 6) | 0;
r = r + 1 | 0
}
r = 0;
while (1) {
if ((r | 0) == 4) break e;
if (Bl(e) | 0) t[i + 88 + (r << 2) >> 2] = Ul(e, 6) | 0;
r = r + 1 | 0
}
}
} while (0);
if (!(t[f >> 2] | 0)) r = 0;
else r = (t[n >> 2] | 0) == 0 ? 2 : 1;
t[i + 2308 >> 2] = r;
return (t[e + 24 >> 2] | 0) == 0 | 0
}
function Rl(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
a = 0,
A = 0,
l = 0;
A = i + r | 0;
l = (1 << (Ml(e + 12 | 0, 2) | 0)) + -1 | 0;
t[e + 312 >> 2] = l;
n = l * 3 | 0;
if (n >>> 0 > r >>> 0) i = 7;
else {
a = 0;
f = r - n | 0;
r = i + n | 0;
while (1) {
if ((a | 0) == (l | 0)) break;
n = (u[i + 1 >> 0] | 0) << 8 | (u[i >> 0] | 0) | (u[i + 2 >> 0] | 0) << 16;
n = n >>> 0 > f >>> 0 ? f : n;
Dl(e + 316 + (a * 28 | 0) | 0, r, n);
a = a + 1 | 0;
f = f - n | 0;
r = r + n | 0;
i = i + 3 | 0
}
Dl(e + 316 + (l * 28 | 0) | 0, r, f);
i = r >>> 0 < A >>> 0 ? 0 : 5
}
return i | 0
}
function Gl(e) {
e = e | 0;
var i = 0,
r = 0,
f = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0;
i = e + 12 | 0;
c = Ml(i, 7) | 0;
if (!(Yl(i) | 0)) s = 0;
else s = Ul(i, 4) | 0;
if (!(Yl(i) | 0)) b = 0;
else b = Ul(i, 4) | 0;
if (!(Yl(i) | 0)) h = 0;
else h = Ul(i, 4) | 0;
if (!(Yl(i) | 0)) w = 0;
else w = Ul(i, 4) | 0;
if (!(Yl(i) | 0)) o = 0;
else o = Ul(i, 4) | 0;
f = e + 104 | 0;
A = e + 112 | 0;
l = e + 776 | 0;
i = 0;
while (1) {
if ((i | 0) == 4) break;
if (!(t[f >> 2] | 0))
if (!i) {
r = c;
k = 17
} else {
r = e + 776 + (i << 5) | 0;
t[r >> 2] = t[l >> 2];
t[r + 4 >> 2] = t[l + 4 >> 2];
t[r + 8 >> 2] = t[l + 8 >> 2];
t[r + 12 >> 2] = t[l + 12 >> 2];
t[r + 16 >> 2] = t[l + 16 >> 2];
t[r + 20 >> 2] = t[l + 20 >> 2];
t[r + 24 >> 2] = t[l + 24 >> 2];
t[r + 28 >> 2] = t[l + 28 >> 2]
}
else {
r = ((t[A >> 2] | 0) == 0 ? c : 0) + (n[e + 116 + i >> 0] | 0) | 0;
k = 17
}
if ((k | 0) == 17) {
k = 0;
t[e + 776 + (i << 5) >> 2] = u[7280 + (Hl(r + s | 0, 127) | 0) >> 0];
t[e + 776 + (i << 5) + 4 >> 2] = a[7408 + ((Hl(r, 127) | 0) << 1) >> 1];
t[e + 776 + (i << 5) + 8 >> 2] = u[7280 + (Hl(r + b | 0, 127) | 0) >> 0] << 1;
g = (a[7408 + ((Hl(r + h | 0, 127) | 0) << 1) >> 1] | 0) * 101581 | 0;
t[e + 776 + (i << 5) + 12 >> 2] = g >>> 0 < 524288 ? 8 : g >>> 16;
t[e + 776 + (i << 5) + 16 >> 2] = u[7280 + (Hl(r + w | 0, 117) | 0) >> 0];
r = r + o | 0;
t[e + 776 + (i << 5) + 20 >> 2] = a[7408 + ((Hl(r, 127) | 0) << 1) >> 1];
t[e + 776 + (i << 5) + 24 >> 2] = r
}
i = i + 1 | 0
}
return
}
function Tl(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
f = 0,
a = 0,
A = 0,
l = 0;
l = 0;
while (1) {
if ((l | 0) == 4) break;
a = 0;
while (1) {
if ((a | 0) == 8) break;
f = 0;
while (1) {
if ((f | 0) == 3) break;
r = 0;
while (1) {
if ((r | 0) == 11) break;
if (!(kl(e, u[5136 + (l * 264 | 0) + (a * 33 | 0) + (f * 11 | 0) + r >> 0] | 0) | 0)) A = u[6192 + (l * 264 | 0) + (a * 33 | 0) + (f * 11 | 0) + r >> 0] | 0;
else A = Ml(e, 8) | 0;
n[i + 907 + (l * 264 | 0) + (a * 33 | 0) + (f * 11 | 0) + r >> 0] = A;
r = r + 1 | 0
}
f = f + 1 | 0
}
a = a + 1 | 0
}
r = 0;
while (1) {
if ((r | 0) == 17) break;
t[i + 1964 + (l * 68 | 0) + (r << 2) >> 2] = i + 907 + (l * 264 | 0) + ((u[7248 + r >> 0] | 0) * 33 | 0);
r = r + 1 | 0
}
l = l + 1 | 0
}
l = Sl(e) | 0;
t[i + 2236 >> 2] = l;
if (l | 0) n[i + 2240 >> 0] = Ml(e, 8) | 0;
return
}
function Ml(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0;
n = 0;
while (1) {
r = i + -1 | 0;
if ((i | 0) <= 0) break;
n = (xl(e) | 0) << r | n;
i = r
}
return n | 0
}
function Sl(e) {
e = e | 0;
return Ml(e, 1) | 0
}
function xl(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0;
a = e + 4 | 0;
u = t[a >> 2] | 0;
A = e + 8 | 0;
i = t[A >> 2] | 0;
if ((i | 0) < 0) {
Fl(e);
n = t[A >> 2] | 0
} else n = i;
i = u >>> 1 & 16777215;
r = t[e >> 2] | 0;
f = r >>> n >>> 0 > i >>> 0;
if (f) {
t[e >> 2] = r - (i + 1 << n);
i = u - i | 0
} else i = i + 1 | 0;
u = (Ll(i) | 0) ^ 7;
t[A >> 2] = n - u;
t[a >> 2] = (i << u) + -1;
return f & 1 | 0
}
function Fl(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0;
i = e + 12 | 0;
r = t[i >> 2] | 0;
if (r >>> 0 < (t[e + 20 >> 2] | 0) >>> 0) {
n = u[r >> 0] | u[r + 1 >> 0] << 8 | u[r + 2 >> 0] << 16 | u[r + 3 >> 0] << 24;
t[i >> 2] = r + 3;
r = (Ql(n) | 0) >>> 8;
t[e >> 2] = t[e >> 2] << 24 | r;
r = e + 8 | 0;
t[r >> 2] = (t[r >> 2] | 0) + 24
} else Il(e);
return
}
function Ll(e) {
e = e | 0;
return (C(e | 0) | 0) ^ 31 | 0
}
function Ql(e) {
e = e | 0;
return yo(e | 0) | 0
}
function Yl(e) {
e = e | 0;
return Ml(e, 1) | 0
}
function Ul(e, i) {
e = e | 0;
i = i | 0;
i = Ml(e, i) | 0;
e = (Vl(e) | 0) == 0;
return (e ? i : 0 - i | 0) | 0
}
function Hl(e, i) {
e = e | 0;
i = i | 0;
return ((e | 0) < 0 ? 0 : (e | 0) > (i | 0) ? i : e) | 0
}
function Vl(e) {
e = e | 0;
return Ml(e, 1) | 0
}
function Wl(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0,
f = 0;
f = F;
F = F + 16 | 0;
i = f + 4 | 0;
r = f;
t[r >> 2] = 0;
t[i >> 2] = GA(t[e >> 2] | 0, t[e + 4 >> 2] | 0, 0, 0, 0, r, 0, e) | 0;
if (!(t[i >> 2] | 0)) {
if (t[r >> 2] | 0) n = 4
} else if ((t[i >> 2] | 0) == 7 & (t[r >> 2] | 0) != 0) n = 4;
if ((n | 0) == 4) t[i >> 2] = 8;
F = f;
return t[i >> 2] | 0
}
function Zl() {
var e = 0;
e = En(1, 0, 2376) | 0;
if (e | 0) {
pl(e);
uc[t[(Ju() | 0) >> 2] & 31](e + 124 | 0);
t[e + 4 >> 2] = 0;
t[e + 312 >> 2] = 0;
zl()
}
return e | 0
}
function zl() {
if (!(t[2312] | 0)) t[2312] = 1;
return
}
function Ol(e, i, r, n, a, A) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
a = a | 0;
A = A | 0;
var l = 0,
o = 0,
c = 0;
r = (t[i + (a << 2) >> 2] | 0) + (r * 11 | 0) | 0;
e: while (1) {
if ((a | 0) >= 16) {
a = 16;
break
}
if (!(Xl(e, u[r >> 0] | 0) | 0)) break;
while (1) {
c = a + 1 | 0;
if (Xl(e, u[r + 1 >> 0] | 0) | 0) break;
if ((c | 0) == 16) {
a = 16;
break e
}
r = t[i + (c << 2) >> 2] | 0;
a = c
}
o = t[i + (c << 2) >> 2] | 0;
if (!(Xl(e, u[r + 2 >> 0] | 0) | 0)) {
l = 1;
r = o + 11 | 0
} else {
l = Jl(e, r) | 0;
r = o + 22 | 0
}
o = jl(e, l) | 0;
o = (v(t[n + (((a | 0) > 0 & 1) << 2) >> 2] | 0, o) | 0) & 65535;
f[A + ((u[7664 + a >> 0] | 0) << 1) >> 1] = o;
a = c
}
return a | 0
}
function Jl(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
f = 0,
a = 0;
do {
if (!(Xl(e, u[i + 3 >> 0] | 0) | 0))
if (!(Xl(e, u[i + 4 >> 0] | 0) | 0)) i = 2;
else i = (Xl(e, u[i + 5 >> 0] | 0) | 0) + 3 | 0;
else {
if (!(Xl(e, u[i + 6 >> 0] | 0) | 0))
if (!(Xl(e, u[i + 7 >> 0] | 0) | 0)) {
i = (Xl(e, 159) | 0) + 5 | 0;
break
} else {
i = ((Xl(e, 165) | 0) << 1) + 7 | 0;
i = i + (Xl(e, 145) | 0) | 0;
break
} f = Xl(e, u[i + 8 >> 0] | 0) | 0;
f = (Xl(e, u[i + (f + 9) >> 0] | 0) | 0) + (f << 1) | 0;
i = 0;
r = t[7680 + (f << 2) >> 2] | 0;
while (1) {
a = n[r >> 0] | 0;
if (!(a << 24 >> 24)) break;
i = (Xl(e, a & 255) | 0) + (i << 1) | 0;
r = r + 1 | 0
}
i = (8 << f) + 3 + i | 0
}
} while (0);
return i | 0
}
function jl(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0;
n = e + 8 | 0;
r = t[n >> 2] | 0;
if ((r | 0) < 0) {
ql(e);
r = t[n >> 2] | 0
}
A = e + 4 | 0;
l = t[A >> 2] | 0;
u = l >>> 1;
a = t[e >> 2] | 0;
f = u - (a >>> r) >> 31;
t[n >> 2] = r + -1;
t[A >> 2] = f + l | 1;
t[e >> 2] = a - ((f & u + 1) << r);
return (f ^ i) - f | 0
}
function ql(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0;
i = e + 12 | 0;
r = t[i >> 2] | 0;
if (r >>> 0 < (t[e + 20 >> 2] | 0) >>> 0) {
n = u[r >> 0] | u[r + 1 >> 0] << 8 | u[r + 2 >> 0] << 16 | u[r + 3 >> 0] << 24;
t[i >> 2] = r + 3;
r = (Kl(n) | 0) >>> 8;
t[e >> 2] = t[e >> 2] << 24 | r;
r = e + 8 | 0;
t[r >> 2] = (t[r >> 2] | 0) + 24
} else Il(e);
return
}
function Kl(e) {
e = e | 0;
return yo(e | 0) | 0
}
function Xl(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0;
a = e + 4 | 0;
u = t[a >> 2] | 0;
A = e + 8 | 0;
r = t[A >> 2] | 0;
if ((r | 0) < 0) {
ql(e);
f = t[A >> 2] | 0
} else f = r;
r = (v(u, i) | 0) >>> 8;
i = t[e >> 2] | 0;
n = i >>> f >>> 0 > r >>> 0;
if (n) {
t[e >> 2] = i - (r + 1 << f);
r = u - r | 0
} else r = r + 1 | 0;
u = (Nl(r) | 0) ^ 7;
t[A >> 2] = f - u;
t[a >> 2] = (r << u) + -1;
return n & 1 | 0
}
function Nl(e) {
e = e | 0;
return (C(e | 0) | 0) ^ 31 | 0
}
function $l(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0;
do {
if (!e) r = 0;
else {
if (!i) {
fa(e, 2, 8261) | 0;
r = 0;
break
}
n = e + 4 | 0;
if ((t[n >> 2] | 0) == 0 ? (dl(e, i) | 0) == 0 : 0) {
r = 0;
break
}
if (!(sa(e, i) | 0)) {
if (!(ka(e, i) | 0)) r = 0;
else r = eo(e, i) | 0;
r = (ha(e, i) | 0) & r;
if (r | 0) {
t[n >> 2] = 0;
break
}
}
zA(e);
r = 0
}
} while (0);
return r | 0
}
function eo(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0;
f = e + 2300 | 0;
u = e + 308 | 0;
a = e + 312 | 0;
A = e + 12 | 0;
l = e + 2296 | 0;
o = e + 288 | 0;
r = 0;
e: while (1) {
t[f >> 2] = r;
if ((r | 0) >= (t[u >> 2] | 0)) {
n = 13;
break
}
r = e + 316 + ((t[a >> 2] & r) * 28 | 0) | 0;
if (!(cl(A, e) | 0)) {
n = 4;
break
}
n = t[l >> 2] | 0;
while (1) {
if ((n | 0) >= (t[o >> 2] | 0)) break;
if (!(sl(e, r) | 0)) {
n = 8;
break e
}
n = (t[l >> 2] | 0) + 1 | 0;
t[l >> 2] = n
}
DA(e);
if (!(Zu(e, i) | 0)) {
n = 11;
break
}
r = (t[f >> 2] | 0) + 1 | 0
}
do {
if ((n | 0) == 4) {
fa(e, 7, 8298) | 0;
r = 0
} else if ((n | 0) == 8) {
fa(e, 7, 8339) | 0;
r = 0
} else if ((n | 0) == 11) {
fa(e, 6, 8374) | 0;
r = 0
} else if ((n | 0) == 13) {
if ((t[e + 148 >> 2] | 0) > 0 ? (ic[t[(Ju() | 0) + 8 >> 2] & 15](e + 124 | 0) | 0) == 0 : 0) {
r = 0;
break
}
r = 1
}
} while (0);
return r | 0
}
function io(e) {
e = e | 0;
Su(e, 520) | 0;
return
}
function ro(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0,
a = 0,
A = 0;
A = F;
F = F + 144 | 0;
a = A + 36 | 0;
u = A;
t[u >> 2] = e;
n = u + 4 | 0;
t[n >> 2] = i;
t[u + 8 >> 2] = 1;
e = Wl(u) | 0;
do {
if (!e) {
no(a);
f = t[u + 12 >> 2] | 0;
t[a + 64 >> 2] = (t[u >> 2] | 0) + f;
t[a + 60 >> 2] = (t[n >> 2] | 0) - f;
wn(r, a);
if (!(t[u + 32 >> 2] | 0)) {
f = Zl() | 0;
if (!f) {
e = 1;
break
}
t[f + 2348 >> 2] = t[u + 16 >> 2];
t[f + 2352 >> 2] = t[u + 20 >> 2];
if (dl(f, a) | 0) {
i = a + 4 | 0;
n = r + 20 | 0;
e = Ru(t[a >> 2] | 0, t[i >> 2] | 0, t[n >> 2] | 0, t[r >> 2] | 0) | 0;
if (!e) {
t[f + 148 >> 2] = wa(t[n >> 2] | 0, u, t[a >> 2] | 0, t[i >> 2] | 0) | 0;
Vu(t[n >> 2] | 0, f);
if (!($l(f, a) | 0)) e = t[f >> 2] | 0;
else e = 0
}
} else e = t[f >> 2] | 0;
ZA(f)
} else {
i = gn() | 0;
if (!i) {
e = 1;
break
}
if (ol(i, a) | 0) {
e = Ru(t[a >> 2] | 0, t[a + 4 >> 2] | 0, t[r + 20 >> 2] | 0, t[r >> 2] | 0) | 0;
if (!e)
if (!(OA(i) | 0)) e = t[i >> 2] | 0;
else e = 0
} else e = t[i >> 2] | 0;
ni(i)
}
if (e | 0) {
xu(t[r >> 2] | 0);
break
}
a = t[r + 20 >> 2] | 0;
if ((a | 0) != 0 ? (t[a + 48 >> 2] | 0) != 0 : 0) e = Eu(t[r >> 2] | 0) | 0;
else e = 0
}
} while (0);
F = A;
return e | 0
}
function no(e) {
e = e | 0;
wu(e, 520) | 0;
return
}
function fo(e, i, r, n, f, u) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
u = u | 0;
var a = 0,
A = 0,
l = 0,
o = 0;
o = F;
F = F + 144 | 0;
A = o + 88 | 0;
l = o;
io(l);
BA(A);
t[A >> 2] = l;
t[l >> 2] = e;
e = l + 4 | 0;
a = l + 8 | 0;
if (to(i, r, e, a) | 0) {
if (n | 0) t[n >> 2] = t[e >> 2];
if (f | 0) t[f >> 2] = t[a >> 2];
if (!(ro(i, r, A) | 0)) {
if (u | 0) Fu(l, u);
e = t[l + 16 >> 2] | 0
} else e = 0
} else e = 0;
F = o;
return e | 0
}
function to(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
u = 0;
u = F;
F = F + 48 | 0;
f = u;
if (!(_A(e, i, f) | 0)) {
if (r | 0) t[r >> 2] = t[f >> 2];
if (!n) e = 1;
else {
t[n >> 2] = t[f + 4 >> 2];
e = 1
}
} else e = 0;
F = u;
return e | 0
}
function uo(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
return fo(1, e, i, r, n, 0) | 0
}
function ao(e, i) {
e = e | 0;
i = i | 0;
if ((e | 0) == 0 | (i & -256 | 0) != 512) e = 0;
else {
Bo(e | 0, 0, 200) | 0;
RA(e);
io(e + 40 | 0);
e = 1
}
return e | 0
}
function Ao(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var n = 0,
f = 0,
u = 0,
a = 0,
A = 0;
A = F;
F = F + 144 | 0;
f = A + 88 | 0;
a = A;
e: do {
if (!r) n = 2;
else {
n = _A(e, i, r) | 0;
switch (n | 0) {
case 7: {
n = 3;
break e
}
case 0:
break;
default:
break e
}
BA(f);
t[f + 20 >> 2] = r + 124;
u = r + 40 | 0;
t[f >> 2] = u;
if (!(Hu(u, r) | 0)) {
n = ro(e, i, f) | 0;
break
}
io(a);
t[a >> 2] = t[u >> 2];
t[a + 4 >> 2] = t[r >> 2];
t[a + 8 >> 2] = t[r + 4 >> 2];
t[f >> 2] = a;
n = ro(e, i, f) | 0;
if (!n) n = Lu(a, u) | 0;
xu(a)
}
} while (0);
F = A;
return n | 0
}
function lo(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0,
k = 0,
g = 0,
v = 0,
C = 0,
I = 0,
d = 0,
m = 0;
m = F;
F = F + 16 | 0;
b = m;
do {
if (e >>> 0 < 245) {
o = e >>> 0 < 11 ? 16 : e + 11 & -8;
e = o >>> 3;
s = t[2313] | 0;
r = s >>> e;
if (r & 3 | 0) {
i = (r & 1 ^ 1) + e | 0;
e = 9292 + (i << 1 << 2) | 0;
r = e + 8 | 0;
n = t[r >> 2] | 0;
f = n + 8 | 0;
u = t[f >> 2] | 0;
if ((u | 0) == (e | 0)) t[2313] = s & ~(1 << i);
else {
t[u + 12 >> 2] = e;
t[r >> 2] = u
}
d = i << 3;
t[n + 4 >> 2] = d | 3;
d = n + d + 4 | 0;
t[d >> 2] = t[d >> 2] | 1;
d = f;
F = m;
return d | 0
}
c = t[2315] | 0;
if (o >>> 0 > c >>> 0) {
if (r | 0) {
i = 2 << e;
i = r << e & (i | 0 - i);
i = (i & 0 - i) + -1 | 0;
A = i >>> 12 & 16;
i = i >>> A;
r = i >>> 5 & 8;
i = i >>> r;
u = i >>> 2 & 4;
i = i >>> u;
e = i >>> 1 & 2;
i = i >>> e;
n = i >>> 1 & 1;
n = (r | A | u | e | n) + (i >>> n) | 0;
i = 9292 + (n << 1 << 2) | 0;
e = i + 8 | 0;
u = t[e >> 2] | 0;
A = u + 8 | 0;
r = t[A >> 2] | 0;
if ((r | 0) == (i | 0)) {
e = s & ~(1 << n);
t[2313] = e
} else {
t[r + 12 >> 2] = i;
t[e >> 2] = r;
e = s
}
d = n << 3;
a = d - o | 0;
t[u + 4 >> 2] = o | 3;
f = u + o | 0;
t[f + 4 >> 2] = a | 1;
t[u + d >> 2] = a;
if (c | 0) {
n = t[2318] | 0;
i = c >>> 3;
r = 9292 + (i << 1 << 2) | 0;
i = 1 << i;
if (!(e & i)) {
t[2313] = e | i;
i = r;
e = r + 8 | 0
} else {
e = r + 8 | 0;
i = t[e >> 2] | 0
}
t[e >> 2] = n;
t[i + 12 >> 2] = n;
t[n + 8 >> 2] = i;
t[n + 12 >> 2] = r
}
t[2315] = a;
t[2318] = f;
d = A;
F = m;
return d | 0
}
u = t[2314] | 0;
if (u) {
r = (u & 0 - u) + -1 | 0;
f = r >>> 12 & 16;
r = r >>> f;
n = r >>> 5 & 8;
r = r >>> n;
a = r >>> 2 & 4;
r = r >>> a;
A = r >>> 1 & 2;
r = r >>> A;
l = r >>> 1 & 1;
l = t[9556 + ((n | f | a | A | l) + (r >>> l) << 2) >> 2] | 0;
r = l;
A = l;
l = (t[l + 4 >> 2] & -8) - o | 0;
while (1) {
e = t[r + 16 >> 2] | 0;
if (!e) {
e = t[r + 20 >> 2] | 0;
if (!e) break
}
a = (t[e + 4 >> 2] & -8) - o | 0;
f = a >>> 0 < l >>> 0;
r = e;
A = f ? e : A;
l = f ? a : l
}
a = A + o | 0;
if (a >>> 0 > A >>> 0) {
f = t[A + 24 >> 2] | 0;
i = t[A + 12 >> 2] | 0;
do {
if ((i | 0) == (A | 0)) {
e = A + 20 | 0;
i = t[e >> 2] | 0;
if (!i) {
e = A + 16 | 0;
i = t[e >> 2] | 0;
if (!i) {
r = 0;
break
}
}
while (1) {
n = i + 20 | 0;
r = t[n >> 2] | 0;
if (!r) {
n = i + 16 | 0;
r = t[n >> 2] | 0;
if (!r) break;
else {
i = r;
e = n
}
} else {
i = r;
e = n
}
}
t[e >> 2] = 0;
r = i
} else {
r = t[A + 8 >> 2] | 0;
t[r + 12 >> 2] = i;
t[i + 8 >> 2] = r;
r = i
}
} while (0);
do {
if (f | 0) {
i = t[A + 28 >> 2] | 0;
e = 9556 + (i << 2) | 0;
if ((A | 0) == (t[e >> 2] | 0)) {
t[e >> 2] = r;
if (!r) {
t[2314] = u & ~(1 << i);
break
}
} else {
d = f + 16 | 0;
t[((t[d >> 2] | 0) == (A | 0) ? d : f + 20 | 0) >> 2] = r;
if (!r) break
}
t[r + 24 >> 2] = f;
i = t[A + 16 >> 2] | 0;
if (i | 0) {
t[r + 16 >> 2] = i;
t[i + 24 >> 2] = r
}
i = t[A + 20 >> 2] | 0;
if (i | 0) {
t[r + 20 >> 2] = i;
t[i + 24 >> 2] = r
}
}
} while (0);
if (l >>> 0 < 16) {
d = l + o | 0;
t[A + 4 >> 2] = d | 3;
d = A + d + 4 | 0;
t[d >> 2] = t[d >> 2] | 1
} else {
t[A + 4 >> 2] = o | 3;
t[a + 4 >> 2] = l | 1;
t[a + l >> 2] = l;
if (c | 0) {
n = t[2318] | 0;
i = c >>> 3;
r = 9292 + (i << 1 << 2) | 0;
i = 1 << i;
if (!(i & s)) {
t[2313] = i | s;
i = r;
e = r + 8 | 0
} else {
e = r + 8 | 0;
i = t[e >> 2] | 0
}
t[e >> 2] = n;
t[i + 12 >> 2] = n;
t[n + 8 >> 2] = i;
t[n + 12 >> 2] = r
}
t[2315] = l;
t[2318] = a
}
d = A + 8 | 0;
F = m;
return d | 0
} else s = o
} else s = o
} else s = o
} else if (e >>> 0 <= 4294967231) {
e = e + 11 | 0;
o = e & -8;
n = t[2314] | 0;
if (n) {
f = 0 - o | 0;
e = e >>> 8;
if (e)
if (o >>> 0 > 16777215) l = 31;
else {
s = (e + 1048320 | 0) >>> 16 & 8;
k = e << s;
A = (k + 520192 | 0) >>> 16 & 4;
k = k << A;
l = (k + 245760 | 0) >>> 16 & 2;
l = 14 - (A | s | l) + (k << l >>> 15) | 0;
l = o >>> (l + 7 | 0) & 1 | l << 1
}
else l = 0;
r = t[9556 + (l << 2) >> 2] | 0;
e: do {
if (!r) {
r = 0;
e = 0;
k = 61
} else {
e = 0;
A = o << ((l | 0) == 31 ? 0 : 25 - (l >>> 1) | 0);
u = 0;
while (1) {
a = (t[r + 4 >> 2] & -8) - o | 0;
if (a >>> 0 < f >>> 0)
if (!a) {
e = r;
f = 0;
k = 65;
break e
} else {
e = r;
f = a
} k = t[r + 20 >> 2] | 0;
r = t[r + 16 + (A >>> 31 << 2) >> 2] | 0;
u = (k | 0) == 0 | (k | 0) == (r | 0) ? u : k;
if (!r) {
r = u;
k = 61;
break
} else A = A << 1
}
}
} while (0);
if ((k | 0) == 61) {
if ((r | 0) == 0 & (e | 0) == 0) {
e = 2 << l;
e = (e | 0 - e) & n;
if (!e) {
s = o;
break
}
s = (e & 0 - e) + -1 | 0;
a = s >>> 12 & 16;
s = s >>> a;
u = s >>> 5 & 8;
s = s >>> u;
A = s >>> 2 & 4;
s = s >>> A;
l = s >>> 1 & 2;
s = s >>> l;
r = s >>> 1 & 1;
e = 0;
r = t[9556 + ((u | a | A | l | r) + (s >>> r) << 2) >> 2] | 0
}
if (!r) {
A = e;
a = f
} else k = 65
}
if ((k | 0) == 65) {
u = r;
while (1) {
s = (t[u + 4 >> 2] & -8) - o | 0;
r = s >>> 0 < f >>> 0;
f = r ? s : f;
e = r ? u : e;
r = t[u + 16 >> 2] | 0;
if (!r) r = t[u + 20 >> 2] | 0;
if (!r) {
A = e;
a = f;
break
} else u = r
}
}
if (((A | 0) != 0 ? a >>> 0 < ((t[2315] | 0) - o | 0) >>> 0 : 0) ? (c = A + o | 0, c >>> 0 > A >>> 0) : 0) {
u = t[A + 24 >> 2] | 0;
i = t[A + 12 >> 2] | 0;
do {
if ((i | 0) == (A | 0)) {
e = A + 20 | 0;
i = t[e >> 2] | 0;
if (!i) {
e = A + 16 | 0;
i = t[e >> 2] | 0;
if (!i) {
i = 0;
break
}
}
while (1) {
f = i + 20 | 0;
r = t[f >> 2] | 0;
if (!r) {
f = i + 16 | 0;
r = t[f >> 2] | 0;
if (!r) break;
else {
i = r;
e = f
}
} else {
i = r;
e = f
}
}
t[e >> 2] = 0
} else {
d = t[A + 8 >> 2] | 0;
t[d + 12 >> 2] = i;
t[i + 8 >> 2] = d
}
} while (0);
do {
if (u) {
e = t[A + 28 >> 2] | 0;
r = 9556 + (e << 2) | 0;
if ((A | 0) == (t[r >> 2] | 0)) {
t[r >> 2] = i;
if (!i) {
n = n & ~(1 << e);
t[2314] = n;
break
}
} else {
d = u + 16 | 0;
t[((t[d >> 2] | 0) == (A | 0) ? d : u + 20 | 0) >> 2] = i;
if (!i) break
}
t[i + 24 >> 2] = u;
e = t[A + 16 >> 2] | 0;
if (e | 0) {
t[i + 16 >> 2] = e;
t[e + 24 >> 2] = i
}
e = t[A + 20 >> 2] | 0;
if (e) {
t[i + 20 >> 2] = e;
t[e + 24 >> 2] = i
}
}
} while (0);
e: do {
if (a >>> 0 < 16) {
d = a + o | 0;
t[A + 4 >> 2] = d | 3;
d = A + d + 4 | 0;
t[d >> 2] = t[d >> 2] | 1
} else {
t[A + 4 >> 2] = o | 3;
t[c + 4 >> 2] = a | 1;
t[c + a >> 2] = a;
i = a >>> 3;
if (a >>> 0 < 256) {
r = 9292 + (i << 1 << 2) | 0;
e = t[2313] | 0;
i = 1 << i;
if (!(e & i)) {
t[2313] = e | i;
i = r;
e = r + 8 | 0
} else {
e = r + 8 | 0;
i = t[e >> 2] | 0
}
t[e >> 2] = c;
t[i + 12 >> 2] = c;
t[c + 8 >> 2] = i;
t[c + 12 >> 2] = r;
break
}
i = a >>> 8;
if (i)
if (a >>> 0 > 16777215) r = 31;
else {
I = (i + 1048320 | 0) >>> 16 & 8;
d = i << I;
C = (d + 520192 | 0) >>> 16 & 4;
d = d << C;
r = (d + 245760 | 0) >>> 16 & 2;
r = 14 - (C | I | r) + (d << r >>> 15) | 0;
r = a >>> (r + 7 | 0) & 1 | r << 1
}
else r = 0;
i = 9556 + (r << 2) | 0;
t[c + 28 >> 2] = r;
e = c + 16 | 0;
t[e + 4 >> 2] = 0;
t[e >> 2] = 0;
e = 1 << r;
if (!(n & e)) {
t[2314] = n | e;
t[i >> 2] = c;
t[c + 24 >> 2] = i;
t[c + 12 >> 2] = c;
t[c + 8 >> 2] = c;
break
}
i = t[i >> 2] | 0;
i: do {
if ((t[i + 4 >> 2] & -8 | 0) != (a | 0)) {
n = a << ((r | 0) == 31 ? 0 : 25 - (r >>> 1) | 0);
while (1) {
r = i + 16 + (n >>> 31 << 2) | 0;
e = t[r >> 2] | 0;
if (!e) break;
if ((t[e + 4 >> 2] & -8 | 0) == (a | 0)) {
i = e;
break i
} else {
n = n << 1;
i = e
}
}
t[r >> 2] = c;
t[c + 24 >> 2] = i;
t[c + 12 >> 2] = c;
t[c + 8 >> 2] = c;
break e
}
} while (0);
I = i + 8 | 0;
d = t[I >> 2] | 0;
t[d + 12 >> 2] = c;
t[I >> 2] = c;
t[c + 8 >> 2] = d;
t[c + 12 >> 2] = i;
t[c + 24 >> 2] = 0
}
} while (0);
d = A + 8 | 0;
F = m;
return d | 0
} else s = o
} else s = o
} else s = -1
} while (0);
r = t[2315] | 0;
if (r >>> 0 >= s >>> 0) {
i = r - s | 0;
e = t[2318] | 0;
if (i >>> 0 > 15) {
d = e + s | 0;
t[2318] = d;
t[2315] = i;
t[d + 4 >> 2] = i | 1;
t[e + r >> 2] = i;
t[e + 4 >> 2] = s | 3
} else {
t[2315] = 0;
t[2318] = 0;
t[e + 4 >> 2] = r | 3;
d = e + r + 4 | 0;
t[d >> 2] = t[d >> 2] | 1
}
d = e + 8 | 0;
F = m;
return d | 0
}
a = t[2316] | 0;
if (a >>> 0 > s >>> 0) {
C = a - s | 0;
t[2316] = C;
d = t[2319] | 0;
I = d + s | 0;
t[2319] = I;
t[I + 4 >> 2] = C | 1;
t[d + 4 >> 2] = s | 3;
d = d + 8 | 0;
F = m;
return d | 0
}
if (!(t[2431] | 0)) {
t[2433] = 4096;
t[2432] = 4096;
t[2434] = -1;
t[2435] = -1;
t[2436] = 0;
t[2424] = 0;
t[2431] = b & -16 ^ 1431655768;
e = 4096
} else e = t[2433] | 0;
A = s + 48 | 0;
l = s + 47 | 0;
u = e + l | 0;
f = 0 - e | 0;
o = u & f;
if (o >>> 0 <= s >>> 0) {
d = 0;
F = m;
return d | 0
}
e = t[2423] | 0;
if (e | 0 ? (c = t[2421] | 0, b = c + o | 0, b >>> 0 <= c >>> 0 | b >>> 0 > e >>> 0) : 0) {
d = 0;
F = m;
return d | 0
}
e: do {
if (!(t[2424] & 4)) {
r = t[2319] | 0;
i: do {
if (r) {
n = 9700;
while (1) {
b = t[n >> 2] | 0;
if (b >>> 0 <= r >>> 0 ? (b + (t[n + 4 >> 2] | 0) | 0) >>> 0 > r >>> 0 : 0) break;
e = t[n + 8 >> 2] | 0;
if (!e) {
k = 128;
break i
} else n = e
}
i = u - a & f;
if (i >>> 0 < 2147483647) {
e = Ro(i | 0) | 0;
if ((e | 0) == ((t[n >> 2] | 0) + (t[n + 4 >> 2] | 0) | 0)) {
if ((e | 0) != (-1 | 0)) {
a = i;
u = e;
k = 145;
break e
}
} else {
n = e;
k = 136
}
} else i = 0
} else k = 128
} while (0);
do {
if ((k | 0) == 128) {
r = Ro(0) | 0;
if ((r | 0) != (-1 | 0) ? (i = r, h = t[2432] | 0, w = h + -1 | 0, i = ((w & i | 0) == 0 ? 0 : (w + i & 0 - h) - i | 0) + o | 0, h = t[2421] | 0, w = i + h | 0, i >>> 0 > s >>> 0 & i >>> 0 < 2147483647) : 0) {
b = t[2423] | 0;
if (b | 0 ? w >>> 0 <= h >>> 0 | w >>> 0 > b >>> 0 : 0) {
i = 0;
break
}
e = Ro(i | 0) | 0;
if ((e | 0) == (r | 0)) {
a = i;
u = r;
k = 145;
break e
} else {
n = e;
k = 136
}
} else i = 0
}
} while (0);
do {
if ((k | 0) == 136) {
r = 0 - i | 0;
if (!(A >>> 0 > i >>> 0 & (i >>> 0 < 2147483647 & (n | 0) != (-1 | 0))))
if ((n | 0) == (-1 | 0)) {
i = 0;
break
} else {
a = i;
u = n;
k = 145;
break e
} e = t[2433] | 0;
e = l - i + e & 0 - e;
if (e >>> 0 >= 2147483647) {
a = i;
u = n;
k = 145;
break e
}
if ((Ro(e | 0) | 0) == (-1 | 0)) {
Ro(r | 0) | 0;
i = 0;
break
} else {
a = e + i | 0;
u = n;
k = 145;
break e
}
}
} while (0);
t[2424] = t[2424] | 4;
k = 143
} else {
i = 0;
k = 143
}
} while (0);
if (((k | 0) == 143 ? o >>> 0 < 2147483647 : 0) ? (C = Ro(o | 0) | 0, w = Ro(0) | 0, g = w - C | 0, v = g >>> 0 > (s + 40 | 0) >>> 0, !((C | 0) == (-1 | 0) | v ^ 1 | C >>> 0 < w >>> 0 & ((C | 0) != (-1 | 0) & (w | 0) != (-1 | 0)) ^ 1)) : 0) {
a = v ? g : i;
u = C;
k = 145
}
if ((k | 0) == 145) {
i = (t[2421] | 0) + a | 0;
t[2421] = i;
if (i >>> 0 > (t[2422] | 0) >>> 0) t[2422] = i;
l = t[2319] | 0;
e: do {
if (l) {
i = 9700;
while (1) {
e = t[i >> 2] | 0;
r = t[i + 4 >> 2] | 0;
if ((u | 0) == (e + r | 0)) {
k = 154;
break
}
n = t[i + 8 >> 2] | 0;
if (!n) break;
else i = n
}
if (((k | 0) == 154 ? (I = i + 4 | 0, (t[i + 12 >> 2] & 8 | 0) == 0) : 0) ? u >>> 0 > l >>> 0 & e >>> 0 <= l >>> 0 : 0) {
t[I >> 2] = r + a;
d = (t[2316] | 0) + a | 0;
C = l + 8 | 0;
C = (C & 7 | 0) == 0 ? 0 : 0 - C & 7;
I = l + C | 0;
C = d - C | 0;
t[2319] = I;
t[2316] = C;
t[I + 4 >> 2] = C | 1;
t[l + d + 4 >> 2] = 40;
t[2320] = t[2435];
break
}
if (u >>> 0 < (t[2317] | 0) >>> 0) t[2317] = u;
r = u + a | 0;
i = 9700;
while (1) {
if ((t[i >> 2] | 0) == (r | 0)) {
k = 162;
break
}
e = t[i + 8 >> 2] | 0;
if (!e) break;
else i = e
}
if ((k | 0) == 162 ? (t[i + 12 >> 2] & 8 | 0) == 0 : 0) {
t[i >> 2] = u;
c = i + 4 | 0;
t[c >> 2] = (t[c >> 2] | 0) + a;
c = u + 8 | 0;
c = u + ((c & 7 | 0) == 0 ? 0 : 0 - c & 7) | 0;
i = r + 8 | 0;
i = r + ((i & 7 | 0) == 0 ? 0 : 0 - i & 7) | 0;
o = c + s | 0;
A = i - c - s | 0;
t[c + 4 >> 2] = s | 3;
i: do {
if ((l | 0) == (i | 0)) {
d = (t[2316] | 0) + A | 0;
t[2316] = d;
t[2319] = o;
t[o + 4 >> 2] = d | 1
} else {
if ((t[2318] | 0) == (i | 0)) {
d = (t[2315] | 0) + A | 0;
t[2315] = d;
t[2318] = o;
t[o + 4 >> 2] = d | 1;
t[o + d >> 2] = d;
break
}
e = t[i + 4 >> 2] | 0;
if ((e & 3 | 0) == 1) {
a = e & -8;
n = e >>> 3;
r: do {
if (e >>> 0 < 256) {
e = t[i + 8 >> 2] | 0;
r = t[i + 12 >> 2] | 0;
if ((r | 0) == (e | 0)) {
t[2313] = t[2313] & ~(1 << n);
break
} else {
t[e + 12 >> 2] = r;
t[r + 8 >> 2] = e;
break
}
} else {
u = t[i + 24 >> 2] | 0;
e = t[i + 12 >> 2] | 0;
do {
if ((e | 0) == (i | 0)) {
r = i + 16 | 0;
n = r + 4 | 0;
e = t[n >> 2] | 0;
if (!e) {
e = t[r >> 2] | 0;
if (!e) {
e = 0;
break
}
} else r = n;
while (1) {
f = e + 20 | 0;
n = t[f >> 2] | 0;
if (!n) {
f = e + 16 | 0;
n = t[f >> 2] | 0;
if (!n) break;
else {
e = n;
r = f
}
} else {
e = n;
r = f
}
}
t[r >> 2] = 0
} else {
d = t[i + 8 >> 2] | 0;
t[d + 12 >> 2] = e;
t[e + 8 >> 2] = d
}
} while (0);
if (!u) break;
r = t[i + 28 >> 2] | 0;
n = 9556 + (r << 2) | 0;
do {
if ((t[n >> 2] | 0) != (i | 0)) {
d = u + 16 | 0;
t[((t[d >> 2] | 0) == (i | 0) ? d : u + 20 | 0) >> 2] = e;
if (!e) break r
} else {
t[n >> 2] = e;
if (e | 0) break;
t[2314] = t[2314] & ~(1 << r);
break r
}
} while (0);
t[e + 24 >> 2] = u;
r = i + 16 | 0;
n = t[r >> 2] | 0;
if (n | 0) {
t[e + 16 >> 2] = n;
t[n + 24 >> 2] = e
}
r = t[r + 4 >> 2] | 0;
if (!r) break;
t[e + 20 >> 2] = r;
t[r + 24 >> 2] = e
}
} while (0);
i = i + a | 0;
f = a + A | 0
} else f = A;
i = i + 4 | 0;
t[i >> 2] = t[i >> 2] & -2;
t[o + 4 >> 2] = f | 1;
t[o + f >> 2] = f;
i = f >>> 3;
if (f >>> 0 < 256) {
r = 9292 + (i << 1 << 2) | 0;
e = t[2313] | 0;
i = 1 << i;
if (!(e & i)) {
t[2313] = e | i;
i = r;
e = r + 8 | 0
} else {
e = r + 8 | 0;
i = t[e >> 2] | 0
}
t[e >> 2] = o;
t[i + 12 >> 2] = o;
t[o + 8 >> 2] = i;
t[o + 12 >> 2] = r;
break
}
i = f >>> 8;
do {
if (!i) n = 0;
else {
if (f >>> 0 > 16777215) {
n = 31;
break
}
I = (i + 1048320 | 0) >>> 16 & 8;
d = i << I;
C = (d + 520192 | 0) >>> 16 & 4;
d = d << C;
n = (d + 245760 | 0) >>> 16 & 2;
n = 14 - (C | I | n) + (d << n >>> 15) | 0;
n = f >>> (n + 7 | 0) & 1 | n << 1
}
} while (0);
i = 9556 + (n << 2) | 0;
t[o + 28 >> 2] = n;
e = o + 16 | 0;
t[e + 4 >> 2] = 0;
t[e >> 2] = 0;
e = t[2314] | 0;
r = 1 << n;
if (!(e & r)) {
t[2314] = e | r;
t[i >> 2] = o;
t[o + 24 >> 2] = i;
t[o + 12 >> 2] = o;
t[o + 8 >> 2] = o;
break
}
i = t[i >> 2] | 0;
r: do {
if ((t[i + 4 >> 2] & -8 | 0) != (f | 0)) {
n = f << ((n | 0) == 31 ? 0 : 25 - (n >>> 1) | 0);
while (1) {
r = i + 16 + (n >>> 31 << 2) | 0;
e = t[r >> 2] | 0;
if (!e) break;
if ((t[e + 4 >> 2] & -8 | 0) == (f | 0)) {
i = e;
break r
} else {
n = n << 1;
i = e
}
}
t[r >> 2] = o;
t[o + 24 >> 2] = i;
t[o + 12 >> 2] = o;
t[o + 8 >> 2] = o;
break i
}
} while (0);
I = i + 8 | 0;
d = t[I >> 2] | 0;
t[d + 12 >> 2] = o;
t[I >> 2] = o;
t[o + 8 >> 2] = d;
t[o + 12 >> 2] = i;
t[o + 24 >> 2] = 0
}
} while (0);
d = c + 8 | 0;
F = m;
return d | 0
}
i = 9700;
while (1) {
e = t[i >> 2] | 0;
if (e >>> 0 <= l >>> 0 ? (d = e + (t[i + 4 >> 2] | 0) | 0, d >>> 0 > l >>> 0) : 0) break;
i = t[i + 8 >> 2] | 0
}
f = d + -47 | 0;
e = f + 8 | 0;
e = f + ((e & 7 | 0) == 0 ? 0 : 0 - e & 7) | 0;
f = l + 16 | 0;
e = e >>> 0 < f >>> 0 ? l : e;
i = e + 8 | 0;
r = a + -40 | 0;
C = u + 8 | 0;
C = (C & 7 | 0) == 0 ? 0 : 0 - C & 7;
I = u + C | 0;
C = r - C | 0;
t[2319] = I;
t[2316] = C;
t[I + 4 >> 2] = C | 1;
t[u + r + 4 >> 2] = 40;
t[2320] = t[2435];
r = e + 4 | 0;
t[r >> 2] = 27;
t[i >> 2] = t[2425];
t[i + 4 >> 2] = t[2426];
t[i + 8 >> 2] = t[2427];
t[i + 12 >> 2] = t[2428];
t[2425] = u;
t[2426] = a;
t[2428] = 0;
t[2427] = i;
i = e + 24 | 0;
do {
I = i;
i = i + 4 | 0;
t[i >> 2] = 7
} while ((I + 8 | 0) >>> 0 < d >>> 0);
if ((e | 0) != (l | 0)) {
u = e - l | 0;
t[r >> 2] = t[r >> 2] & -2;
t[l + 4 >> 2] = u | 1;
t[e >> 2] = u;
i = u >>> 3;
if (u >>> 0 < 256) {
r = 9292 + (i << 1 << 2) | 0;
e = t[2313] | 0;
i = 1 << i;
if (!(e & i)) {
t[2313] = e | i;
i = r;
e = r + 8 | 0
} else {
e = r + 8 | 0;
i = t[e >> 2] | 0
}
t[e >> 2] = l;
t[i + 12 >> 2] = l;
t[l + 8 >> 2] = i;
t[l + 12 >> 2] = r;
break
}
i = u >>> 8;
if (i)
if (u >>> 0 > 16777215) n = 31;
else {
I = (i + 1048320 | 0) >>> 16 & 8;
d = i << I;
C = (d + 520192 | 0) >>> 16 & 4;
d = d << C;
n = (d + 245760 | 0) >>> 16 & 2;
n = 14 - (C | I | n) + (d << n >>> 15) | 0;
n = u >>> (n + 7 | 0) & 1 | n << 1
}
else n = 0;
r = 9556 + (n << 2) | 0;
t[l + 28 >> 2] = n;
t[l + 20 >> 2] = 0;
t[f >> 2] = 0;
i = t[2314] | 0;
e = 1 << n;
if (!(i & e)) {
t[2314] = i | e;
t[r >> 2] = l;
t[l + 24 >> 2] = r;
t[l + 12 >> 2] = l;
t[l + 8 >> 2] = l;
break
}
i = t[r >> 2] | 0;
i: do {
if ((t[i + 4 >> 2] & -8 | 0) != (u | 0)) {
n = u << ((n | 0) == 31 ? 0 : 25 - (n >>> 1) | 0);
while (1) {
r = i + 16 + (n >>> 31 << 2) | 0;
e = t[r >> 2] | 0;
if (!e) break;
if ((t[e + 4 >> 2] & -8 | 0) == (u | 0)) {
i = e;
break i
} else {
n = n << 1;
i = e
}
}
t[r >> 2] = l;
t[l + 24 >> 2] = i;
t[l + 12 >> 2] = l;
t[l + 8 >> 2] = l;
break e
}
} while (0);
I = i + 8 | 0;
d = t[I >> 2] | 0;
t[d + 12 >> 2] = l;
t[I >> 2] = l;
t[l + 8 >> 2] = d;
t[l + 12 >> 2] = i;
t[l + 24 >> 2] = 0
}
} else {
d = t[2317] | 0;
if ((d | 0) == 0 | u >>> 0 < d >>> 0) t[2317] = u;
t[2425] = u;
t[2426] = a;
t[2428] = 0;
t[2322] = t[2431];
t[2321] = -1;
t[2326] = 9292;
t[2325] = 9292;
t[2328] = 9300;
t[2327] = 9300;
t[2330] = 9308;
t[2329] = 9308;
t[2332] = 9316;
t[2331] = 9316;
t[2334] = 9324;
t[2333] = 9324;
t[2336] = 9332;
t[2335] = 9332;
t[2338] = 9340;
t[2337] = 9340;
t[2340] = 9348;
t[2339] = 9348;
t[2342] = 9356;
t[2341] = 9356;
t[2344] = 9364;
t[2343] = 9364;
t[2346] = 9372;
t[2345] = 9372;
t[2348] = 9380;
t[2347] = 9380;
t[2350] = 9388;
t[2349] = 9388;
t[2352] = 9396;
t[2351] = 9396;
t[2354] = 9404;
t[2353] = 9404;
t[2356] = 9412;
t[2355] = 9412;
t[2358] = 9420;
t[2357] = 9420;
t[2360] = 9428;
t[2359] = 9428;
t[2362] = 9436;
t[2361] = 9436;
t[2364] = 9444;
t[2363] = 9444;
t[2366] = 9452;
t[2365] = 9452;
t[2368] = 9460;
t[2367] = 9460;
t[2370] = 9468;
t[2369] = 9468;
t[2372] = 9476;
t[2371] = 9476;
t[2374] = 9484;
t[2373] = 9484;
t[2376] = 9492;
t[2375] = 9492;
t[2378] = 9500;
t[2377] = 9500;
t[2380] = 9508;
t[2379] = 9508;
t[2382] = 9516;
t[2381] = 9516;
t[2384] = 9524;
t[2383] = 9524;
t[2386] = 9532;
t[2385] = 9532;
t[2388] = 9540;
t[2387] = 9540;
d = a + -40 | 0;
C = u + 8 | 0;
C = (C & 7 | 0) == 0 ? 0 : 0 - C & 7;
I = u + C | 0;
C = d - C | 0;
t[2319] = I;
t[2316] = C;
t[I + 4 >> 2] = C | 1;
t[u + d + 4 >> 2] = 40;
t[2320] = t[2435]
}
} while (0);
i = t[2316] | 0;
if (i >>> 0 > s >>> 0) {
C = i - s | 0;
t[2316] = C;
d = t[2319] | 0;
I = d + s | 0;
t[2319] = I;
t[I + 4 >> 2] = C | 1;
t[d + 4 >> 2] = s | 3;
d = d + 8 | 0;
F = m;
return d | 0
}
}
t[(so() | 0) >> 2] = 12;
d = 0;
F = m;
return d | 0
}
function oo(e) {
e = e | 0;
var i = 0,
r = 0,
n = 0,
f = 0,
u = 0,
a = 0,
A = 0,
l = 0;
if (!e) return;
r = e + -8 | 0;
f = t[2317] | 0;
e = t[e + -4 >> 2] | 0;
i = e & -8;
l = r + i | 0;
do {
if (!(e & 1)) {
n = t[r >> 2] | 0;
if (!(e & 3)) return;
a = r + (0 - n) | 0;
u = n + i | 0;
if (a >>> 0 < f >>> 0) return;
if ((t[2318] | 0) == (a | 0)) {
e = l + 4 | 0;
i = t[e >> 2] | 0;
if ((i & 3 | 0) != 3) {
A = a;
i = u;
break
}
t[2315] = u;
t[e >> 2] = i & -2;
t[a + 4 >> 2] = u | 1;
t[a + u >> 2] = u;
return
}
r = n >>> 3;
if (n >>> 0 < 256) {
e = t[a + 8 >> 2] | 0;
i = t[a + 12 >> 2] | 0;
if ((i | 0) == (e | 0)) {
t[2313] = t[2313] & ~(1 << r);
A = a;
i = u;
break
} else {
t[e + 12 >> 2] = i;
t[i + 8 >> 2] = e;
A = a;
i = u;
break
}
}
f = t[a + 24 >> 2] | 0;
e = t[a + 12 >> 2] | 0;
do {
if ((e | 0) == (a | 0)) {
i = a + 16 | 0;
r = i + 4 | 0;
e = t[r >> 2] | 0;
if (!e) {
e = t[i >> 2] | 0;
if (!e) {
e = 0;
break
}
} else i = r;
while (1) {
n = e + 20 | 0;
r = t[n >> 2] | 0;
if (!r) {
n = e + 16 | 0;
r = t[n >> 2] | 0;
if (!r) break;
else {
e = r;
i = n
}
} else {
e = r;
i = n
}
}
t[i >> 2] = 0
} else {
A = t[a + 8 >> 2] | 0;
t[A + 12 >> 2] = e;
t[e + 8 >> 2] = A
}
} while (0);
if (f) {
i = t[a + 28 >> 2] | 0;
r = 9556 + (i << 2) | 0;
if ((t[r >> 2] | 0) == (a | 0)) {
t[r >> 2] = e;
if (!e) {
t[2314] = t[2314] & ~(1 << i);
A = a;
i = u;
break
}
} else {
A = f + 16 | 0;
t[((t[A >> 2] | 0) == (a | 0) ? A : f + 20 | 0) >> 2] = e;
if (!e) {
A = a;
i = u;
break
}
}
t[e + 24 >> 2] = f;
i = a + 16 | 0;
r = t[i >> 2] | 0;
if (r | 0) {
t[e + 16 >> 2] = r;
t[r + 24 >> 2] = e
}
i = t[i + 4 >> 2] | 0;
if (i) {
t[e + 20 >> 2] = i;
t[i + 24 >> 2] = e;
A = a;
i = u
} else {
A = a;
i = u
}
} else {
A = a;
i = u
}
} else {
A = r;
a = r
}
} while (0);
if (a >>> 0 >= l >>> 0) return;
e = l + 4 | 0;
n = t[e >> 2] | 0;
if (!(n & 1)) return;
if (!(n & 2)) {
if ((t[2319] | 0) == (l | 0)) {
l = (t[2316] | 0) + i | 0;
t[2316] = l;
t[2319] = A;
t[A + 4 >> 2] = l | 1;
if ((A | 0) != (t[2318] | 0)) return;
t[2318] = 0;
t[2315] = 0;
return
}
if ((t[2318] | 0) == (l | 0)) {
l = (t[2315] | 0) + i | 0;
t[2315] = l;
t[2318] = a;
t[A + 4 >> 2] = l | 1;
t[a + l >> 2] = l;
return
}
f = (n & -8) + i | 0;
r = n >>> 3;
do {
if (n >>> 0 < 256) {
i = t[l + 8 >> 2] | 0;
e = t[l + 12 >> 2] | 0;
if ((e | 0) == (i | 0)) {
t[2313] = t[2313] & ~(1 << r);
break
} else {
t[i + 12 >> 2] = e;
t[e + 8 >> 2] = i;
break
}
} else {
u = t[l + 24 >> 2] | 0;
e = t[l + 12 >> 2] | 0;
do {
if ((e | 0) == (l | 0)) {
i = l + 16 | 0;
r = i + 4 | 0;
e = t[r >> 2] | 0;
if (!e) {
e = t[i >> 2] | 0;
if (!e) {
r = 0;
break
}
} else i = r;
while (1) {
n = e + 20 | 0;
r = t[n >> 2] | 0;
if (!r) {
n = e + 16 | 0;
r = t[n >> 2] | 0;
if (!r) break;
else {
e = r;
i = n
}
} else {
e = r;
i = n
}
}
t[i >> 2] = 0;
r = e
} else {
r = t[l + 8 >> 2] | 0;
t[r + 12 >> 2] = e;
t[e + 8 >> 2] = r;
r = e
}
} while (0);
if (u | 0) {
e = t[l + 28 >> 2] | 0;
i = 9556 + (e << 2) | 0;
if ((t[i >> 2] | 0) == (l | 0)) {
t[i >> 2] = r;
if (!r) {
t[2314] = t[2314] & ~(1 << e);
break
}
} else {
n = u + 16 | 0;
t[((t[n >> 2] | 0) == (l | 0) ? n : u + 20 | 0) >> 2] = r;
if (!r) break
}
t[r + 24 >> 2] = u;
e = l + 16 | 0;
i = t[e >> 2] | 0;
if (i | 0) {
t[r + 16 >> 2] = i;
t[i + 24 >> 2] = r
}
e = t[e + 4 >> 2] | 0;
if (e | 0) {
t[r + 20 >> 2] = e;
t[e + 24 >> 2] = r
}
}
}
} while (0);
t[A + 4 >> 2] = f | 1;
t[a + f >> 2] = f;
if ((A | 0) == (t[2318] | 0)) {
t[2315] = f;
return
}
} else {
t[e >> 2] = n & -2;
t[A + 4 >> 2] = i | 1;
t[a + i >> 2] = i;
f = i
}
e = f >>> 3;
if (f >>> 0 < 256) {
r = 9292 + (e << 1 << 2) | 0;
i = t[2313] | 0;
e = 1 << e;
if (!(i & e)) {
t[2313] = i | e;
e = r;
i = r + 8 | 0
} else {
i = r + 8 | 0;
e = t[i >> 2] | 0
}
t[i >> 2] = A;
t[e + 12 >> 2] = A;
t[A + 8 >> 2] = e;
t[A + 12 >> 2] = r;
return
}
e = f >>> 8;
if (e)
if (f >>> 0 > 16777215) n = 31;
else {
a = (e + 1048320 | 0) >>> 16 & 8;
l = e << a;
u = (l + 520192 | 0) >>> 16 & 4;
l = l << u;
n = (l + 245760 | 0) >>> 16 & 2;
n = 14 - (u | a | n) + (l << n >>> 15) | 0;
n = f >>> (n + 7 | 0) & 1 | n << 1
}
else n = 0;
e = 9556 + (n << 2) | 0;
t[A + 28 >> 2] = n;
t[A + 20 >> 2] = 0;
t[A + 16 >> 2] = 0;
i = t[2314] | 0;
r = 1 << n;
e: do {
if (!(i & r)) {
t[2314] = i | r;
t[e >> 2] = A;
t[A + 24 >> 2] = e;
t[A + 12 >> 2] = A;
t[A + 8 >> 2] = A
} else {
e = t[e >> 2] | 0;
i: do {
if ((t[e + 4 >> 2] & -8 | 0) != (f | 0)) {
n = f << ((n | 0) == 31 ? 0 : 25 - (n >>> 1) | 0);
while (1) {
r = e + 16 + (n >>> 31 << 2) | 0;
i = t[r >> 2] | 0;
if (!i) break;
if ((t[i + 4 >> 2] & -8 | 0) == (f | 0)) {
e = i;
break i
} else {
n = n << 1;
e = i
}
}
t[r >> 2] = A;
t[A + 24 >> 2] = e;
t[A + 12 >> 2] = A;
t[A + 8 >> 2] = A;
break e
}
} while (0);
a = e + 8 | 0;
l = t[a >> 2] | 0;
t[l + 12 >> 2] = A;
t[a >> 2] = A;
t[A + 8 >> 2] = l;
t[A + 12 >> 2] = e;
t[A + 24 >> 2] = 0
}
} while (0);
l = (t[2321] | 0) + -1 | 0;
t[2321] = l;
if (l | 0) return;
e = 9708;
while (1) {
e = t[e >> 2] | 0;
if (!e) break;
else e = e + 8 | 0
}
t[2321] = -1;
return
}
function co(e, i) {
e = e | 0;
i = i | 0;
var r = 0;
if (e) {
r = v(i, e) | 0;
if ((i | e) >>> 0 > 65535) r = ((r >>> 0) / (e >>> 0) | 0 | 0) == (i | 0) ? r : -1
} else r = 0;
e = lo(r) | 0;
if (!e) return e | 0;
if (!(t[e + -4 >> 2] & 3)) return e | 0;
Bo(e | 0, 0, r | 0) | 0;
return e | 0
}
function so() {
return 9748
}
function bo(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0,
t = 0;
e: do {
if (!r) e = 0;
else {
while (1) {
f = n[e >> 0] | 0;
t = n[i >> 0] | 0;
if (f << 24 >> 24 != t << 24 >> 24) break;
r = r + -1 | 0;
if (!r) {
e = 0;
break e
} else {
e = e + 1 | 0;
i = i + 1 | 0
}
}
e = (f & 255) - (t & 255) | 0
}
} while (0);
return e | 0
}
function ho(e, i) {
e = e | 0;
i = i | 0;
var r = 0,
n = 0,
f = 0,
t = 0;
t = e & 65535;
f = i & 65535;
r = v(f, t) | 0;
n = e >>> 16;
e = (r >>> 16) + (v(f, n) | 0) | 0;
f = i >>> 16;
i = v(f, t) | 0;
return (d((e >>> 16) + (v(f, n) | 0) + (((e & 65535) + i | 0) >>> 16) | 0), e + i << 16 | r & 65535 | 0) | 0
}
function wo(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
var f = 0,
t = 0;
f = e;
t = r;
r = ho(f, t) | 0;
e = m() | 0;
return (d((v(i, t) | 0) + (v(n, f) | 0) + e | e & 0 | 0), r | 0 | 0) | 0
}
function ko(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
r = e + r >>> 0;
return (d(i + n + (r >>> 0 < e >>> 0 | 0) >>> 0 | 0), r | 0) | 0
}
function go(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
n = i - n - (r >>> 0 > e >>> 0 | 0) >>> 0;
return (d(n | 0), e - r >>> 0 | 0) | 0
}
function vo(e) {
e = e | 0;
return (e ? 31 - (C(e ^ e - 1) | 0) | 0 : 32) | 0
}
function Co(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
var u = 0,
a = 0,
A = 0,
l = 0,
o = 0,
c = 0,
s = 0,
b = 0,
h = 0,
w = 0;
c = e;
l = i;
o = l;
a = r;
b = n;
A = b;
if (!o) {
u = (f | 0) != 0;
if (!A) {
if (u) {
t[f >> 2] = (c >>> 0) % (a >>> 0);
t[f + 4 >> 2] = 0
}
b = 0;
f = (c >>> 0) / (a >>> 0) >>> 0;
return (d(b | 0), f) | 0
} else {
if (!u) {
b = 0;
f = 0;
return (d(b | 0), f) | 0
}
t[f >> 2] = e | 0;
t[f + 4 >> 2] = i & 0;
b = 0;
f = 0;
return (d(b | 0), f) | 0
}
}
u = (A | 0) == 0;
do {
if (a) {
if (!u) {
u = (C(A | 0) | 0) - (C(o | 0) | 0) | 0;
if (u >>> 0 <= 31) {
s = u + 1 | 0;
A = 31 - u | 0;
i = u - 31 >> 31;
a = s;
e = c >>> (s >>> 0) & i | o << A;
i = o >>> (s >>> 0) & i;
u = 0;
A = c << A;
break
}
if (!f) {
b = 0;
f = 0;
return (d(b | 0), f) | 0
}
t[f >> 2] = e | 0;
t[f + 4 >> 2] = l | i & 0;
b = 0;
f = 0;
return (d(b | 0), f) | 0
}
u = a - 1 | 0;
if (u & a | 0) {
A = (C(a | 0) | 0) + 33 - (C(o | 0) | 0) | 0;
w = 64 - A | 0;
s = 32 - A | 0;
l = s >> 31;
h = A - 32 | 0;
i = h >> 31;
a = A;
e = s - 1 >> 31 & o >>> (h >>> 0) | (o << s | c >>> (A >>> 0)) & i;
i = i & o >>> (A >>> 0);
u = c << w & l;
A = (o << w | c >>> (h >>> 0)) & l | c << s & A - 33 >> 31;
break
}
if (f | 0) {
t[f >> 2] = u & c;
t[f + 4 >> 2] = 0
}
if ((a | 0) == 1) {
h = l | i & 0;
w = e | 0 | 0;
return (d(h | 0), w) | 0
} else {
w = vo(a | 0) | 0;
h = o >>> (w >>> 0) | 0;
w = o << 32 - w | c >>> (w >>> 0) | 0;
return (d(h | 0), w) | 0
}
} else {
if (u) {
if (f | 0) {
t[f >> 2] = (o >>> 0) % (a >>> 0);
t[f + 4 >> 2] = 0
}
h = 0;
w = (o >>> 0) / (a >>> 0) >>> 0;
return (d(h | 0), w) | 0
}
if (!c) {
if (f | 0) {
t[f >> 2] = 0;
t[f + 4 >> 2] = (o >>> 0) % (A >>> 0)
}
h = 0;
w = (o >>> 0) / (A >>> 0) >>> 0;
return (d(h | 0), w) | 0
}
u = A - 1 | 0;
if (!(u & A)) {
if (f | 0) {
t[f >> 2] = e | 0;
t[f + 4 >> 2] = u & o | i & 0
}
h = 0;
w = o >>> ((vo(A | 0) | 0) >>> 0);
return (d(h | 0), w) | 0
}
u = (C(A | 0) | 0) - (C(o | 0) | 0) | 0;
if (u >>> 0 <= 30) {
i = u + 1 | 0;
A = 31 - u | 0;
a = i;
e = o << A | c >>> (i >>> 0);
i = o >>> (i >>> 0);
u = 0;
A = c << A;
break
}
if (!f) {
h = 0;
w = 0;
return (d(h | 0), w) | 0
}
t[f >> 2] = e | 0;
t[f + 4 >> 2] = l | i & 0;
h = 0;
w = 0;
return (d(h | 0), w) | 0
}
} while (0);
if (!a) {
o = A;
l = 0;
A = 0
} else {
s = r | 0 | 0;
c = b | n & 0;
o = ko(s | 0, c | 0, -1, -1) | 0;
r = m() | 0;
l = A;
A = 0;
do {
n = l;
l = u >>> 31 | l << 1;
u = A | u << 1;
n = e << 1 | n >>> 31 | 0;
b = e >>> 31 | i << 1 | 0;
go(o | 0, r | 0, n | 0, b | 0) | 0;
w = m() | 0;
h = w >> 31 | ((w | 0) < 0 ? -1 : 0) << 1;
A = h & 1;
e = go(n | 0, b | 0, h & s | 0, (((w | 0) < 0 ? -1 : 0) >> 31 | ((w | 0) < 0 ? -1 : 0) << 1) & c | 0) | 0;
i = m() | 0;
a = a - 1 | 0
} while ((a | 0) != 0);
o = l;
l = 0
}
a = 0;
if (f | 0) {
t[f >> 2] = e;
t[f + 4 >> 2] = i
}
h = (u | 0) >>> 31 | (o | a) << 1 | (a << 1 | u >>> 31) & 0 | l;
w = (u << 1 | 0 >>> 31) & -2 | A;
return (d(h | 0), w) | 0
}
function Io(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
return Co(e, i, r, n, 0) | 0
}
function mo(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
if ((r | 0) < 32) {
d(i >>> r | 0);
return e >>> r | (i & (1 << r) - 1) << 32 - r
}
d(0);
return i >>> r - 32 | 0
}
function po(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
if ((r | 0) < 32) {
d(i << r | (e & (1 << r) - 1 << 32 - r) >>> 32 - r | 0);
return e << r
}
d(e << r - 32 | 0);
return 0
}
function yo(e) {
e = e | 0;
return (e & 255) << 24 | (e >> 8 & 255) << 16 | (e >> 16 & 255) << 8 | e >>> 24 | 0
}
function Po(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0,
u = 0,
a = 0;
if ((r | 0) >= 8192) {
P(e | 0, i | 0, r | 0) | 0;
return e | 0
}
a = e | 0;
u = e + r | 0;
if ((e & 3) == (i & 3)) {
while (e & 3) {
if (!r) return a | 0;
n[e >> 0] = n[i >> 0] | 0;
e = e + 1 | 0;
i = i + 1 | 0;
r = r - 1 | 0
}
r = u & -4 | 0;
f = r - 64 | 0;
while ((e | 0) <= (f | 0)) {
t[e >> 2] = t[i >> 2];
t[e + 4 >> 2] = t[i + 4 >> 2];
t[e + 8 >> 2] = t[i + 8 >> 2];
t[e + 12 >> 2] = t[i + 12 >> 2];
t[e + 16 >> 2] = t[i + 16 >> 2];
t[e + 20 >> 2] = t[i + 20 >> 2];
t[e + 24 >> 2] = t[i + 24 >> 2];
t[e + 28 >> 2] = t[i + 28 >> 2];
t[e + 32 >> 2] = t[i + 32 >> 2];
t[e + 36 >> 2] = t[i + 36 >> 2];
t[e + 40 >> 2] = t[i + 40 >> 2];
t[e + 44 >> 2] = t[i + 44 >> 2];
t[e + 48 >> 2] = t[i + 48 >> 2];
t[e + 52 >> 2] = t[i + 52 >> 2];
t[e + 56 >> 2] = t[i + 56 >> 2];
t[e + 60 >> 2] = t[i + 60 >> 2];
e = e + 64 | 0;
i = i + 64 | 0
}
while ((e | 0) < (r | 0)) {
t[e >> 2] = t[i >> 2];
e = e + 4 | 0;
i = i + 4 | 0
}
} else {
r = u - 4 | 0;
while ((e | 0) < (r | 0)) {
n[e >> 0] = n[i >> 0] | 0;
n[e + 1 >> 0] = n[i + 1 >> 0] | 0;
n[e + 2 >> 0] = n[i + 2 >> 0] | 0;
n[e + 3 >> 0] = n[i + 3 >> 0] | 0;
e = e + 4 | 0;
i = i + 4 | 0
}
}
while ((e | 0) < (u | 0)) {
n[e >> 0] = n[i >> 0] | 0;
e = e + 1 | 0;
i = i + 1 | 0
}
return a | 0
}
function Do(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0;
if ((i | 0) < (e | 0) & (e | 0) < (i + r | 0)) {
f = e;
i = i + r | 0;
e = e + r | 0;
while ((r | 0) > 0) {
e = e - 1 | 0;
i = i - 1 | 0;
r = r - 1 | 0;
n[e >> 0] = n[i >> 0] | 0
}
e = f
} else Po(e, i, r) | 0;
return e | 0
}
function Bo(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
var f = 0,
u = 0,
a = 0,
A = 0;
a = e + r | 0;
i = i & 255;
if ((r | 0) >= 67) {
while (e & 3) {
n[e >> 0] = i;
e = e + 1 | 0
}
f = a & -4 | 0;
A = i | i << 8 | i << 16 | i << 24;
u = f - 64 | 0;
while ((e | 0) <= (u | 0)) {
t[e >> 2] = A;
t[e + 4 >> 2] = A;
t[e + 8 >> 2] = A;
t[e + 12 >> 2] = A;
t[e + 16 >> 2] = A;
t[e + 20 >> 2] = A;
t[e + 24 >> 2] = A;
t[e + 28 >> 2] = A;
t[e + 32 >> 2] = A;
t[e + 36 >> 2] = A;
t[e + 40 >> 2] = A;
t[e + 44 >> 2] = A;
t[e + 48 >> 2] = A;
t[e + 52 >> 2] = A;
t[e + 56 >> 2] = A;
t[e + 60 >> 2] = A;
e = e + 64 | 0
}
while ((e | 0) < (f | 0)) {
t[e >> 2] = A;
e = e + 4 | 0
}
}
while ((e | 0) < (a | 0)) {
n[e >> 0] = i;
e = e + 1 | 0
}
return a - r | 0
}
function Eo(e) {
e = e | 0;
return 0
}
function _o(e) {
e = e | 0;
return 0
}
function Ro(e) {
e = e | 0;
var i = 0,
r = 0;
r = t[l >> 2] | 0;
i = r + e | 0;
if ((e | 0) > 0 & (i | 0) < (r | 0) | (i | 0) < 0) {
x(i | 0) | 0;
p(12);
return -1
}
if ((i | 0) > (y() | 0)) {
if (!(D(i | 0) | 0)) {
p(12);
return -1
}
} else t[l >> 2] = i;
return r | 0
}
function Go(e, i) {
e = e | 0;
i = i | 0;
return ic[e & 15](i | 0) | 0
}
function To(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
return rc[e & 31](i | 0, r | 0) | 0
}
function Mo(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
return nc[e & 7](i | 0, r | 0, n | 0) | 0
}
function So(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
return fc[e & 1](i | 0, r | 0, n | 0, f | 0) | 0
}
function xo(e, i, r, n, f, t, u) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
u = u | 0;
return tc[e & 1](i | 0, r | 0, n | 0, f | 0, t | 0, u | 0) | 0
}
function Fo(e, i) {
e = e | 0;
i = i | 0;
uc[e & 31](i | 0)
}
function Lo(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
ac[e & 3](i | 0, r | 0)
}
function Qo(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
Ac[e & 7](i | 0, r | 0, n | 0)
}
function Yo(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
lc[e & 31](i | 0, r | 0, n | 0, f | 0)
}
function Uo(e, i, r, n, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
oc[e & 31](i | 0, r | 0, n | 0, f | 0, t | 0)
}
function Ho(e, i, r, n, f, t, u) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
u = u | 0;
cc[e & 3](i | 0, r | 0, n | 0, f | 0, t | 0, u | 0)
}
function Vo(e, i, r, n, f, t, u, a, A, l) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
u = u | 0;
a = a | 0;
A = A | 0;
l = l | 0;
sc[e & 7](i | 0, r | 0, n | 0, f | 0, t | 0, u | 0, a | 0, A | 0, l | 0)
}
function Wo(e) {
e = e | 0;
I(0);
return 0
}
function Zo(e, i) {
e = e | 0;
i = i | 0;
I(1);
return 0
}
function zo(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
I(2);
return 0
}
function Oo(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
I(3);
return 0
}
function Jo(e, i, r, n, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
I(4);
return 0
}
function jo(e) {
e = e | 0;
I(5)
}
function qo(e, i) {
e = e | 0;
i = i | 0;
I(6)
}
function Ko(e, i, r) {
e = e | 0;
i = i | 0;
r = r | 0;
I(7)
}
function Xo(e, i, r, n) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
I(8)
}
function No(e, i, r, n, f) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
I(9)
}
function $o(e, i, r, n, f, t) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
I(10)
}
function ec(e, i, r, n, f, t, u, a, A) {
e = e | 0;
i = i | 0;
r = r | 0;
n = n | 0;
f = f | 0;
t = t | 0;
u = u | 0;
a = a | 0;
A = A | 0;
I(11)
}
var ic = [Wo, Me, Se, xe, Fe, qu, Ku, Mf, Sf, ia, Wo, Wo, Wo, Wo, Wo, Wo];
var rc = [Zo, fn, tn, Vn, Wn, Mr, Zn, zn, On, Jn, jn, qn, Kn, Xn, Nn, $n, ef, Zf, zf, Of, Gt, It, Ou, Zo, Zo, Zo, Zo, Zo, Zo, Zo, Zo, Zo];
var nc = [zo, Jf, jf, qf, Mt, xt, St, dt];
var fc = [Oo, rl];
var tc = [Jo, Ol];
var uc = [jo, ju, Xu, Nu, $u, xf, Ha, Va, Wa, Za, za, Oa, Ja, ja, qa, Ka, Xa, Na, $a, eA, iA, rA, nA, fA, tA, uA, aA, AA, lA, oA, jo, jo];
var ac = [qo, _i, Li, qo];
var Ac = [Ko, ge, ve, $A, el, Ko, Ko, Ko];
var lc = [Xo, Rr, Gr, Tr, rf, nf, ff, tf, uf, af, Af, lf, of , cf, sf, gu, vu, Cu, il, nl, Xo, Xo, Xo, Xo, Xo, Xo, Xo, Xo, Xo, Xo, Xo, Xo];
var oc = [No, et, it, rt, nt, ft, tt, ut, Yt, Ut, Ht, Vt, Wt, Zt, zt, Iu, du, mu, fl, No, No, No, No, No, No, No, No, No, No, No, No, No];
var cc = [$o, Xr, en, $o];
var sc = [ec, uu, au, Au, lu, ou, cu, su];
return {
_WebpToRGBA: he,
___errno_location: so,
___muldi3: wo,
___udivdi3: Io,
_bitshift64Lshr: mo,
_bitshift64Shl: po,
_free: oo,
_i64Add: ko,
_llvm_bswap_i32: yo,
_malloc: lo,
_memcpy: Po,
_memmove: Do,
_memset: Bo,
_pthread_mutex_lock: Eo,
_pthread_mutex_unlock: _o,
_sbrk: Ro,
dynCall_ii: Go,
dynCall_iii: To,
dynCall_iiii: Mo,
dynCall_iiiii: So,
dynCall_iiiiiii: xo,
dynCall_vi: Fo,
dynCall_vii: Lo,
dynCall_viii: Qo,
dynCall_viiii: Yo,
dynCall_viiiii: Uo,
dynCall_viiiiii: Ho,
dynCall_viiiiiiiii: Vo,
establishStackSpace: V,
stackAlloc: Y,
stackRestore: H,
stackSave: U
}
}(Ee, _e, $),
Ge = (V._WebpToRGBA = Re._WebpToRGBA, V.___errno_location = Re.___errno_location, V.___muldi3 = Re.___muldi3, V.___udivdi3 = Re.___udivdi3, V._bitshift64Lshr = Re._bitshift64Lshr, V._bitshift64Shl = Re._bitshift64Shl, V._free = Re._free, V._i64Add = Re._i64Add, V._llvm_bswap_i32 = Re._llvm_bswap_i32, V._malloc = Re._malloc, V._memcpy = Re._memcpy, V._memmove = Re._memmove, V._memset = Re._memset, V._pthread_mutex_lock = Re._pthread_mutex_lock, V._pthread_mutex_unlock = Re._pthread_mutex_unlock, V._sbrk = Re._sbrk, V.establishStackSpace = Re.establishStackSpace, V.stackAlloc = Re.stackAlloc),
Te = V.stackRestore = Re.stackRestore,
Me = V.stackSave = Re.stackSave;
V.dynCall_ii = Re.dynCall_ii, V.dynCall_iii = Re.dynCall_iii, V.dynCall_iiii = Re.dynCall_iiii, V.dynCall_iiiii = Re.dynCall_iiiii, V.dynCall_iiiiiii = Re.dynCall_iiiiiii, V.dynCall_vi = Re.dynCall_vi, V.dynCall_vii = Re.dynCall_vii, V.dynCall_viii = Re.dynCall_viii, V.dynCall_viiii = Re.dynCall_viiii, V.dynCall_viiiii = Re.dynCall_viiiii, V.dynCall_viiiiii = Re.dynCall_viiiiii, V.dynCall_viiiiiiiii = Re.dynCall_viiiiiiiii;
if (V.asm = Re, V.cwrap = a, ye)
if (d(ye) || (ye = function(e) {
return V.locateFile ? V.locateFile(e, K) : K + e
}(ye)), O || J) {
var Se = V.readBinary(ye);
ie.set(Se, 8)
} else {
! function(e) {
de++, V.monitorRunDependencies && V.monitorRunDependencies(de)
}();
var xe = function(e) {
e.byteLength && (e = new Uint8Array(e)), ie.set(e, 8), V.memoryInitializerRequest && delete V.memoryInitializerRequest.response, I("memory initializer")
},
Fe = function() {
V.readAsync(ye, xe, function() {
throw "could not load memory initializer " + ye
})
},
Le = L(ye);
if (Le) xe(Le.buffer);
else if (V.memoryInitializerRequest) {
var Qe = function() {
var e = V.memoryInitializerRequest,
i = e.response;
if (200 !== e.status && 0 !== e.status) {
var r = L(V.memoryInitializerRequestURL);
if (!r) return console.warn("a problem seems to have happened with Module.memoryInitializerRequest, status: " + e.status + ", retrying " + ye), void Fe();
i = r.buffer
}
xe(i)
};
V.memoryInitializerRequest.response ? setTimeout(Qe, 0) : V.memoryInitializerRequest.addEventListener("load", Qe)
} else Fe()
} if (Q.prototype = new Error, Q.prototype.constructor = Q, pe = function e() {
V.calledRun || Y(), V.calledRun || (pe = e)
}, V.run = Y, V.abort = U, V.preInit)
for ("function" == typeof V.preInit && (V.preInit = [V.preInit]); 0 < V.preInit.length;) V.preInit.pop()();
V.noExitRuntime = !0, Y(), e.exports = V
}).call(i, r("ddghcccjbh"), "/")
},
ddghcccjbh: function(e, i) {
function r() {
throw new Error("setTimeout has not been defined")
}
function n() {
throw new Error("clearTimeout has not been defined")
}
function f(e) {
if (o === setTimeout) return setTimeout(e, 0);
if ((o === r || !o) && setTimeout) return o = setTimeout, setTimeout(e, 0);
try {
return o(e, 0)
} catch (i) {
try {
return o.call(null, e, 0)
} catch (i) {
return o.call(this, e, 0)
}
}
}
function t(e) {
if (c === clearTimeout) return clearTimeout(e);
if ((c === n || !c) && clearTimeout) return c = clearTimeout, clearTimeout(e);
try {
return c(e)
} catch (i) {
try {
return c.call(null, e)
} catch (i) {
return c.call(this, e)
}
}
}
function u() {
w && b && (w = !1, b.length ? h = b.concat(h) : k = -1, h.length && a())
}
function a() {
if (!w) {
var e = f(u);
w = !0;
for (var i = h.length; i;) {
for (b = h, h = []; ++k < i;) b && b[k].run();
k = -1, i = h.length
}
b = null, w = !1, t(e)
}
}
function A(e, i) {
this.fun = e, this.array = i
}
function l() {}
var o, c, s = e.exports = {};
! function() {
try {
o = "function" == typeof setTimeout ? setTimeout : r
} catch (e) {
o = r
}
try {
c = "function" == typeof clearTimeout ? clearTimeout : n
} catch (e) {
c = n
}
}();
var b, h = [],
w = !1,
k = -1;
s.nextTick = function(e) {
var i = new Array(arguments.length - 1);
if (arguments.length > 1)
for (var r = 1; r < arguments.length; r++) i[r - 1] = arguments[r];
h.push(new A(e, i)), 1 !== h.length || w || f(a)
}, A.prototype.run = function() {
this.fun.apply(null, this.array)
}, s.title = "browser", s.browser = !0, s.env = {}, s.argv = [], s.version = "", s.versions = {}, s.on = l, s.addListener = l, s.once = l, s.off = l, s.removeListener = l, s.removeAllListeners = l, s.emit = l, s.prependListener = l, s.prependOnceListener = l, s.listeners = function(e) {
return []
}, s.binding = function(e) {
throw new Error("process.binding is not supported")
}, s.cwd = function() {
return "/"
}, s.chdir = function(e) {
throw new Error("process.chdir is not supported")
}, s.umask = function() {
return 0
}
}
});
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment