var __TENCENT_CHAOS_VM = function() {
    var a = function a(c, d, e) {
        var b = [], f = 0;
        while (f++ < d) {
            b.push(c += e);
        }
        return b;
    };
    var c = function c(i) {
        var k = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=".split("");
        var f = String(i).replace(/[=]+$/, ""), j = f.length, b, a, d = 0, e = 0, h = [];
        for (;e < j; e++) {
            a = g[f.charCodeAt(e)];
            ~a && (b = d % 4 ? 64 * b + a : a, d++ % 4) ? h.push(255 & b >> (-2 * d & 6)) : 0;
        }
        return h;
    };
    var d = function d(a) {
        return a >> 1 ^ -(1 & a);
    };
    var b = function b(i) {
        var f = [];
        var g = new Int8Array(c(i));
        var j = g.length;
        var h = 0;
        while (j > h) {
            var a = g[h++];
            var e = 127 & a;
            if (a >= 0) {
                f.push(d(e));
                continue;
            }
            a = g[h++];
            e |= (127 & a) << 7;
            if (a >= 0) {
                f.push(d(e));
                continue;
            }
            a = g[h++];
            e |= (127 & a) << 14;
            if (a >= 0) {
                f.push(d(e));
                continue;
            }
            a = g[h++];
            e |= (127 & a) << 21;
            if (a >= 0) {
                f.push(d(e));
                continue;
            }
            a = g[h++];
            e |= a << 28;
            f.push(d(e));
        }
        return f;
    };
    var e = [];
    var f;
    var g = a(0, 43, 0).concat([ 62, 0, 62, 0, 63 ]).concat(a(51, 10, 1)).concat(a(0, 8, 0)).concat(a(0, 25, 1)).concat([ 0, 0, 0, 0, 63, 0 ]).concat(a(25, 26, 1));
    var h = b;
    return function g(b, c) {
        var i = h(b);
        var d, a;
        var a = function(b, c, d, g, h) {
            return function r() {
                var k = [ d, g, c, this, arguments, r, i, 0 ];
                var n = void 0;
                var j = b;
                var o = [];
                var q, l, m, s;
                while (true) {
                    try {
                        while (true) {
                            switch (i[++j]) {
                              case 0:
                                k[i[++j]] = k[i[++j]];
                                break;

                              case 1:
                                k[i[++j]] += String.fromCharCode(i[++j]);
                                k[i[++j]] += String.fromCharCode(i[++j]);
                                k[i[++j]] += String.fromCharCode(i[++j]);
                                break;

                              case 2:
                                o.pop();
                                break;

                              case 3:
                                k[i[++j]][k[i[++j]]] = k[i[++j]];
                                break;

                              case 4:
                                k[i[++j]] += String.fromCharCode(i[++j]);
                                k[i[++j]][k[i[++j]]] = k[i[++j]];
                                k[i[++j]] = k[i[++j]][i[++j]];
                                break;

                              case 5:
                                k[i[++j]] = k[i[++j]][i[++j]];
                                k[i[++j]] = k[i[++j]][i[++j]];
                                k[i[++j]] = k[i[++j]][k[i[++j]]];
                                break;

                              case 6:
                                k[i[++j]] = k[i[++j]][i[++j]];
                                k[i[++j]] = k[i[++j]][i[++j]];
                                k[i[++j]] = k[i[++j]];
                                break;

                              case 7:
                                k[i[++j]] = k[i[++j]][k[i[++j]]];
                                k[i[++j]] = {};
                                k[i[++j]] = k[i[++j]][i[++j]];
                                break;

                              case 8:
                                k[i[++j]] = k[i[++j]][i[++j]];
                                k[i[++j]] = k[i[++j]][k[i[++j]]];
                                break;

                              case 9:
                                k[i[++j]] = k[i[++j]].call(n, k[i[++j]]);
                                break;

                              case 10:
                                k[i[++j]] = k[i[++j]].call(k[i[++j]], k[i[++j]]);
                                break;

                              case 11:
                                k[i[++j]] = "";
                                break;

                              case 12:
                                k[i[++j]] = k[i[++j]][k[i[++j]]];
                                k[i[++j]] = k[i[++j]][i[++j]];
                                break;

                              case 13:
                                k[i[++j]] = k[i[++j]] + k[i[++j]];
                                break;

                              case 14:
                                k[i[++j]] = n;
                                break;

                              case 15:
                                k[i[++j]] = Array(i[++j]);
                                break;

                              case 16:
                                k[i[++j]] = new k[i[++j]](k[i[++j]]);
                                break;

                              case 17:
                                j += k[i[++j]] ? i[++j] : i[(++j, ++j)];
                                break;

                              case 18:
                                k[i[++j]] = k[i[++j]].call(k[i[++j]]);
                                k[i[++j]] = n;
                                return k[i[++j]];
                                break;

                              case 19:
                                k[i[++j]] = Array(i[++j]);
                                k[i[++j]] = k[i[++j]];
                                break;

                              case 20:
                                k[i[++j]] = k[i[++j]] > i[++j];
                                break;

                              case 21:
                                k[i[++j]] = k[i[++j]];
                                k[i[++j]][i[++j]] = k[i[++j]];
                                k[i[++j]] = k[i[++j]][i[++j]];
                                break;

                              case 22:
                                k[i[++j]] = k[i[++j]][i[++j]];
                                k[i[++j]] = {};
                                k[i[++j]] = k[i[++j]][i[++j]];
                                break;

                              case 23:
                                k[i[++j]] = k[i[++j]][k[i[++j]]];
                                break;

                              case 24:
                                k[i[++j]] = i[++j];
                                break;

                              case 25:
                                k[i[++j]] = k[i[++j]][i[++j]];
                                k[i[++j]] = k[i[++j]][k[i[++j]]];
                                k[i[++j]] = k[i[++j]][i[++j]];
                                break;

                              case 26:
                                return k[i[++j]];
                                break;

                              case 27:
                                k[i[++j]] = q;
                                break;

                              case 28:
                                k[i[++j]] = k[i[++j]][i[++j]];
                                break;

                              case 29:
                                k[i[++j]][i[++j]] = k[i[++j]];
                                break;

                              case 30:
                                k[i[++j]] = k[i[++j]].call(k[i[++j]]);
                                break;

                              case 31:
                                k[i[++j]][k[i[++j]]] = k[i[++j]];
                                k[i[++j]] = k[i[++j]][i[++j]];
                                k[i[++j]] = "";
                                break;

                              case 32:
                                k[i[++j]] = k[i[++j]].call(k[i[++j]], k[i[++j]], k[i[++j]]);
                                break;

                              case 33:
                                j += i[++j];
                                break;

                              case 34:
                                k[i[++j]] = k[i[++j]][i[++j]];
                                k[i[++j]] = k[i[++j]];
                                k[i[++j]] = k[i[++j]][i[++j]];
                                break;

                              case 35:
                                k[i[++j]] += String.fromCharCode(i[++j]);
                                break;

                              case 36:
                                o.push(j + i[++j]);
                                break;

                              case 37:
                                k[i[++j]] = {};
                                break;

                              case 38:
                                k[i[++j]] = k[i[++j]].call(k[i[++j]], k[i[++j]]);
                                k[i[++j]] = n;
                                return k[i[++j]];
                                break;

                              case 39:
                                k[i[++j]] = k[i[++j]][k[i[++j]]];
                                k[i[++j]] = "";
                                k[i[++j]] += String.fromCharCode(i[++j]);
                                break;

                              case 40:
                                throw k[i[++j]];
                                break;

                              case 41:
                                k[i[++j]] = k[i[++j]].call(n);
                                break;

                              case 42:
                                k[i[++j]] = k[i[++j]][i[++j]];
                                l = [];
                                for (m = i[++j]; m > 0; m--) l.push(k[i[++j]]);
                                k[i[++j]] = a(j + i[++j], l, d, g, h);
                                try {
                                    Object.defineProperty(k[i[j - 1]], "length", {
                                        value: i[++j],
                                        configurable: true,
                                        writable: false,
                                        enumerable: false
                                    });
                                } catch (t) {}
                                k[i[++j]][k[i[++j]]] = k[i[++j]];
                                break;

                              case 43:
                                k[i[++j]] = k[i[++j]] === k[i[++j]];
                                break;

                              case 44:
                                k[i[++j]] = k[i[++j]][i[++j]];
                                k[i[++j]] = k[i[++j]][i[++j]];
                                k[i[++j]] = k[i[++j]][i[++j]];
                                break;

                              case 45:
                                k[i[++j]] = k[i[++j]][i[++j]];
                                k[i[++j]][k[i[++j]]] = k[i[++j]];
                                k[i[++j]] = k[i[++j]][i[++j]];
                                break;

                              case 46:
                                l = [];
                                for (m = i[++j]; m > 0; m--) l.push(k[i[++j]]);
                                k[i[++j]] = a(j + i[++j], l, d, g, h);
                                try {
                                    Object.defineProperty(k[i[j - 1]], "length", {
                                        value: i[++j],
                                        configurable: true,
                                        writable: false,
                                        enumerable: false
                                    });
                                } catch (u) {}
                                break;

                              case 47:
                                k[i[++j]] = k[i[++j]][k[i[++j]]];
                                k[i[++j]] = k[i[++j]].call(k[i[++j]], k[i[++j]]);
                                break;

                              case 48:
                                k[i[++j]] = k[i[++j]][i[++j]];
                                k[i[++j]] = Array(i[++j]);
                                k[i[++j]][i[++j]] = k[i[++j]];
                                break;

                              case 49:
                                k[i[++j]] = {};
                                k[i[++j]] = k[i[++j]][i[++j]];
                                k[i[++j]] = k[i[++j]][i[++j]];
                                break;

                              case 50:
                                k[i[++j]][k[i[++j]]] = k[i[++j]];
                                k[i[++j]] = k[i[++j]][i[++j]];
                                k[i[++j]] = k[i[++j]][i[++j]];
                                break;
                            }
                        }
                    } catch (p) {
                        // p = VM2_INTERNAL_STATE_DO_NOT_USE_OR_PROGRAM_WILL_FAIL.handleException(p);
                        // if (o.length > 0) {
                        //     f = j;
                        //     e = [];
                        // }
                        // q = p;
                        // e.push(j);
                        // if (0 === o.length) {
                        //     throw h ? h(p, k, e) : p;
                        // }
                        // j = o.pop();
                        // e.pop();
                    }
                }
            };
        };
        return c ? d : a;
    };
}();

function a(b, a) {
    if (null != a && "undefined" != typeof Symbol && a[Symbol.hasInstance]) {
        return !!a[Symbol.hasInstance](b);
    }
    return b instanceof a;
}

__TENCENT_CHAOS_VM("WCYIADwEABoEAjg2BAQAHgoQIAIkFiYgIha4GKQeEB4CbiocHlwCIh68EgIUECocHgAgEDIQAiwQABAeAi5eKhAeFioQIAAWICIW3hG2F1gaCAAgBAAsBAJEJgQEMAo8IAAyFAJKJDwUFAIqGDIaFBQsADIeAhQqFB4eAgguFCoeQB4kPDIUADoeMh4CTB4AHhQCTl4yHhQUMh46ABYUOBQmAEoyCh4CUiQCUDwWJAYyHjwKPAJWHgJUJBYeBjI8JAokAlo8AlgeFjwGMiQeCh4CXiQCXDwWJAYyHjwKPAJiHgJgJBYeBjI8JBIoFDIcMjQyEBICABIAEhYgAiDGASDeASDmAQIgWiDuASDwAQIgWiDmASDIAQIg1gEgWiDsAUYgahIiEiA6EAAiECICACIAIhYgAiBcIF4g2AECINIBIMQBIF4CIMIBIMoBIOYBAiBcINQBIOYBEhIiIDoaABIQEgICEgASSiAsIgIUHBYCBBYeAh7QAR7oAR7oAQIe4AEe5gEedAIeXh5eHsQBAh7CAR7EAR7yAQIeXB7QAR7yAQIe5gEewgEewgECHuYBHlwexgEIHtwBHBYeHgIGFhYCFmIWXBZgRhZcCBZgHB4WFgIIFh4CHmYeYh5mAh5kHmYeZgIeZh5oHmYCHmoeZh5sAh5mHm4eZgIecB5mHnICHmYeYB5oAh5iHmgeZAIeaB5mHmgCHmgeaB5qRh5oCB5sHBYeHgIKFhYGHB4WOB4CDD4cHhYeAg4WAhbuARbwARZoAhZkFmAWxAECFmgWchZuAhZyFsYBFmICFmYWchbCAQIWbBZmFm4+HB4WFgIQHgIenvACHsztAh7IzwJGHq6vBAgejNsEHBYeHgISFhYCFrK/BBbUuAIWnvACAhbM7QIWyM8CFq6vBAIWjNsEFtTkAhb65QICFtDUAxbM1QIWmPwHAhbQjgMWoI0EFrL7A0YWwL0CRhaC/AcGHB4WBiAiHFQcAiAAIq4FAiAcIlQiAhoAHKoGAiAiHFQcAhwAIrIBACAcIlQiAmYEEBocRgAgIhxUHAJsACKkEQAgHCJUIgJ2AByIAwIgIhwSGBIgHCA0IB4YAAwUBAAWBAImCjoYAAY4IBQAShBUJAJkBBgWHNQJBBAkHCAcIBA0HCYaABAKMhgCFhgAGBYCNi4cGBY8FhwYOhoAFgoWGgAcAjgYFhxcAByMAQIUIBgWHAocGgAYAjwWHBhcAhoY/AYAFCAWHBgKGBoAFgJIHBgWXAAWwAsATCAcGBYWFhweNB4KHhAAHAJGJB4cJBIkHiIiOBQIADIcAiwcABwSAi4uHhwSEBICOhoUEkwQHhwaGhpgKggAIgAiACoAFAoyKgIUEAYqKgJqLh4QKgAcHiIcnw6jATgkCABEFAQAEAomFAAyIAIUIiYgIAJqECYCKhwkJgYiIBwcHDQcNhJQEjgmIgBSMCYcODQ4HCI0IjgeCAAAEAoyIgIWIgAiGAIYLhwiGBYYAhjeARjgARjKAQIY3AEY0gEYyAEUKhwiGAAoKiIojgO+Bxw4NDgMFggAEAQAGgoQHgJEEhYeIhKfA5MBYBIIACAAIAASHiYAHhYAKhQKJgAGEiYAMhwCFBgSHBwCBC4SGBwWHAIcXhzQARxqAhxeHMIBHOABAhzSARxeHO4BAhzKARzSARzwAQIc0gEc3AEcXgIc2AEc3gEczgFGHNIBRhzcARoYEhw6FgAYMhgCFhgAGBwCIi4SGBxKHFQeAjIGFiYgGtMSAhweGkwQEhgcHBwQKgJyECAqKBYQACIWngfPBTgYCAA4EgQAMhoCcBYYGhoSAFYcFho0HDIqAhQYBioqAgoANCgGGCooECACHDYGICQ0NgYsLDgeBAAyFgIWFgAWEAI+DhQWEBAcAkAWGgIa6JsDGuCWAxqgjwMIGvTkAxAcGhoCQhYcAhzglgMckMkDHNicAwIc5PcCHJ77AxyMxwICHI7kAhz65QIczNUCAhyY/Acc7q8EHJrHBAIc3tACHKj6AhzQ1AMGEBocVBwCMgIeGusEAhAcGkwYFBYQEBA4LAgAYB4IAhIAEgAeOBwEAEQWBAIaCh4cADIgAhQQHiAgAgQuHhAgFiACIF4g0AEgagIgXiDCASDgAQIg0gEgXiDoAQIgygEg8AEg6AECIMQBIN4BIN4BAiDWASBeIOYBRiDoAUYg5gEaEB4gACQQMhACFhAAECACJg4eECAgFAIoBiAUJDgUAipKJgYgFCZUJgIyBhYcEhS9FgIgJhRMGB4QICAgECoCGhgGKjw0GAYQIAIcNgYgJDQ2Biws2gHgAgCkARbgAeoC1AOkAcwDngKYAmRg4gGWATD8AbwDlAGcAiIW3AGRCx4QAB4aAEivCQRCgxUcEDQQMhYCFhYAFiACJg4sFiAgIgIoWjQ8ACAiNDQCKkoiChgCJBACJBQmGGQiGBQUAg4YGgAyMgIUJBgyOgIOLjIkFAYiFDIGIDQiVCICMgQaNjQ4AiAiNEwcLBYgKiowEAAuKiAQEBACdB4qEDQeWDIIAB4EACIEAgAaCjIoAiwoACgmAi5ONCgmJiZkFDA0KCY4Jh4AMjQCFCgmNDQCCjImAioqMiYYAgouNio0ADA2Big0NjI2AhY2ADYoAjAuKjYoMiQCKigyJhQCCi4mKDRAMCo2NCY4MCIAIjDpDOkLHhoAKhIKGgAGGBoAMiQCFCgYJBgCBC4QKBgWGAIYXhjQARhqAhheGMIBGOABAhjSARheGMYBAhjeARjaARjaAQIY3gEY3AEYXkYY1gFGGOwBGigQGAAsKGIoGAJoEBoAMiYCFCAQJBACDi4kIBAGKBgkABQoMigCFigAKCQCJg4YKCQkEAIoBiQQLDgQAioGJBAUVBACMgIaIN8PAiQQIEwuGCgkJCQyIAIsIAAgLAIuLhYgLBYsAiz22QMsqv0CLOLkAkYsyrQERiyC/AcQNAI0IiY0GjQsIkwcFiA0Kio=", false)(1573, [], {
    get require() {
        return "undefined" == typeof require ? void 0 : require;
    },
    set require(_require) {
        require = _require;
    },
    get App() {
        return "undefined" == typeof App ? void 0 : App;
    },
    set App(_App) {
        App = _App;
    },
    get wx() {
        return "undefined" == typeof wx ? void 0 : wx;
    },
    set wx(_wx) {
        wx = _wx;
    },
    get console() {
        return "undefined" == typeof console ? void 0 : console;
    },
    set console(_console) {
        console = _console;
    },
    get JSON() {
        return "undefined" == typeof JSON ? void 0 : JSON;
    },
    set JSON(_JSON) {
        JSON = _JSON;
    }
}, [ "require", "App", "API_URL", "version", "key", "openid", "unionId", "appId", "appTitle", "share_title", "globalData", "wx", "getStorageSync", "wxLogin", "updateApp", void 0, "onLaunch", "login", "code", "request", "url", "data", "console", "log", "setStorageSync", "success", "errMsg", "getUpdateManager", "onCheckForUpdate", "hasUpdate", "onUpdateReady", "showModal", "title", "content", "confirm", "applyUpdate", "onUpdateFailed", "decrypt", "JSON", "parse", "tmpSecretId", "TmpSecretId", "tmpSecretKey", "TmpSecretKey", "sessionToken", "XCosSecurityToken", "startTime", "StartTime", "expiredTime", "ExpiredTime", "getAuthorization", "getCos", "miniapp", "appKv", "getAppKvList", "filter", "appKey", "length", "appValue", "getKv" ], function h(c, e, d) {
    if (!a(c, Error) || !d || 0 == d.length) return c;
    var f = " [DEBUG app.js:";
    var g = f + d[0] + "]";
    var e = c.stack.split("\n");
    if (c.message.indexOf(g) < 0 && c.message.indexOf(f) >= 0) {
        for (var b = 0; b < d.length; b++) e.splice(b + 1, 0, "    throw again (guess)" + f + d[b] + "]");
    } else {
        if (c.message.indexOf(g) < 0) {
            c.message += g;
            e[0] += g;
        }
        for (var b = 0; b < d.length; b++) if (e[b + 1].indexOf(f) < 0) e[b + 1] += f + d[b] + "]";
    }
    c.stack = e.join("\n");
    return c;
})();