大学生在线四史答题软件(v3.6)

大学生在线四史答题软件

亲测可用,,会误报毒,因为是由易语言编写

已失效,官方加了验证码,

不是我的软件,不是我的软件,不是我的软件,广告不要轻易相信,,

本来想写这个软件,既然有人发了,我也懒得写了

下面是我抠出来的验证码code加密,起码能证明我打算写这个软件了

var window=this; 
var navigator={};
var e={};
        (function(t) {
            "use strict";
            var e = "0123456789abcdefghijklmnopqrstuvwxyz";
            function n(t) {
                return e.charAt(t)
            }
            function i(t, e) {
                return t & e
            }
            function r(t, e) {
                return t | e
            }
            function o(t, e) {
                return t ^ e
            }
            function a(t, e) {
                return t & ~e
            }
            function s(t) {
                if (0 == t)
                    return -1;
                var e = 0;
                return 0 == (65535 & t) && (t >>= 16,
                e += 16),
                0 == (255 & t) && (t >>= 8,
                e += 8),
                0 == (15 & t) && (t >>= 4,
                e += 4),
                0 == (3 & t) && (t >>= 2,
                e += 2),
                0 == (1 & t) && ++e,
                e
            }
            function u(t) {
                for (var e = 0; 0 != t; )
                    t &= t - 1,
                    ++e;
                return e
            }
            var c = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"
              , l = "=";
            function h(t) {
                var e, n, i = "";
                for (e = 0; e + 3 <= t.length; e += 3) n = parseInt(t.substring(e, e + 3), 16), i += c.charAt(n >> 6) + c.charAt(63 & n);
                for (e + 1 == t.length ? (n = parseInt(t.substring(e, e + 1), 16),
                i += c.charAt(n << 2)) : e + 2 == t.length && (n = parseInt(t.substring(e, e + 2), 16), i += c.charAt(n >> 2) + c.charAt((3 & n) << 4)); (3 & i.length) > 0; )
                    i += l;
                return i
            }
            function f(t) {
                var e, i = "", r = 0, o = 0;
                for (e = 0; e < t.length && t.charAt(e) != l; ++e) {
                    var a = c.indexOf(t.charAt(e));
                    a < 0 || (0 == r ? (i += n(a >> 2),
                    o = 3 & a,
                    r = 1) : 1 == r ? (i += n(o << 2 | a >> 4),
                    o = 15 & a,
                    r = 2) : 2 == r ? (i += n(o),
                    i += n(a >> 2),
                    o = 3 & a,
                    r = 3) : (i += n(o << 2 | a >> 4),
                    i += n(15 & a),
                    r = 0))
                }
                return 1 == r && (i += n(o << 2)),
                i
            }
            /*! *****************************************************************************
Copyright (c) Microsoft Corporation. All rights reserved.
Licensed under the Apache License, Version 2.0 (the "License"); you may not use
this file except in compliance with the License. You may obtain a copy of the
License at http://www.apache.org/licenses/LICENSE-2.0

THIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,
MERCHANTABLITY OR NON-INFRINGEMENT.

See the Apache Version 2.0 License for specific language governing permissions
and limitations under the License.
***************************************************************************** */
            var d, p = function(t, e) {
                return (p = Object.setPrototypeOf || {
                    __proto__: []
                }instanceof Array && function(t, e) {
                    t.__proto__ = e
                }
                || function(t, e) {
                    for (var n in e)
                        e.hasOwnProperty(n) && (t[n] = e[n])
                }
                )(t, e)
            };
            var g, v = function(t) {
                var e;
                if (void 0 === d) {
                    var n = "0123456789ABCDEF"
                      , i = " \f\n\r\t?\u2028\u2029";
                    for (d = {},
                    e = 0; e < 16; ++e)
                        d[n.charAt(e)] = e;
                    for (n = n.toLowerCase(),
                    e = 10; e < 16; ++e)
                        d[n.charAt(e)] = e;
                    for (e = 0; e < i.length; ++e)
                        d[i.charAt(e)] = -1
                }
                var r = []
                  , o = 0
                  , a = 0;
                for (e = 0; e < t.length; ++e) { var s = t.charAt(e); if ("=" == s) break; if (-1 != (s = d[s])) { if (void 0 === s) throw new Error("Illegal character at offset " + e); o |= s, ++a >= 2 ? (r[r.length] = o,
                        o = 0,
                        a = 0) : o <<= 4
                    }
                }
                if (a)
                    throw new Error("Hex encoding incomplete: 4 bits missing");
                return r
            }, m = {
                decode: function(t) {
                    var e;
                    if (void 0 === g) {
                        var n = "= \f\n\r\t?\u2028\u2029";
                        for (g = Object.create(null),
                        e = 0; e < 64; ++e)
                            g["ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".charAt(e)] = e;
                        for (e = 0; e < n.length; ++e)
                            g[n.charAt(e)] = -1
                    }
                    var i = []
                      , r = 0
                      , o = 0;
                    for (e = 0; e < t.length; ++e) { var a = t.charAt(e); if ("=" == a) break; if (-1 != (a = g[a])) { if (void 0 === a) throw new Error("Illegal character at offset " + e); r |= a, ++o >= 4 ? (i[i.length] = r >> 16,
                            i[i.length] = r >> 8 & 255,
                            i[i.length] = 255 & r,
                            r = 0,
                            o = 0) : r <<= 6 } } switch (o) { case 1: throw new Error("Base64 encoding incomplete: at least 2 bits missing"); case 2: i[i.length] = r >> 10;
                        break;
                    case 3:
                        i[i.length] = r >> 16,
                        i[i.length] = r >> 8 & 255
                    }
                    return i
                },
                re: /-----BEGIN [^-]+-----([A-Za-z0-9+\/=\s]+)-----END [^-]+-----|begin-base64[^\n]+\n([A-Za-z0-9+\/=\s]+)====/,
                unarmor: function(t) {
                    var e = m.re.exec(t);
                    if (e)
                        if (e[1])
                            t = e[1];
                        else {
                            if (!e[2])
                                throw new Error("RegExp out of sync");
                            t = e[2]
                        }
                    return m.decode(t)
                }
            }, y = function() {
                function t(t) {
                    this.buf = [+t || 0]
                }
                return t.prototype.mulAdd = function(t, e) {
                    var n, i, r = this.buf, o = r.length;
                    for (n = 0; n < o; ++n)
                        (i = r[n] * t + e) < 1e13 ? e = 0 : i -= 1e13 * (e = 0 | i / 1e13), r[n] = i; e > 0 && (r[n] = e)
                }
                ,
                t.prototype.sub = function(t) {
                    var e, n, i = this.buf, r = i.length;
                    for (e = 0; e < r; ++e)
                        (n = i[e] - t) < 0 ? (n += 1e13, t = 1) : t = 0, i[e] = n; for (; 0 === i[i.length - 1]; ) i.pop() } , t.prototype.toString = function(t) { if (10 != (t || 10)) throw new Error("only base 10 is supported"); for (var e = this.buf, n = e[e.length - 1].toString(), i = e.length - 2; i >= 0; --i)
                        n += (1e13 + e[i]).toString().substring(1);
                    return n
                }
                ,
                t.prototype.valueOf = function() {
                    for (var t = this.buf, e = 0, n = t.length - 1; n >= 0; --n)
                        e = 1e13 * e + t[n];
                    return e
                }
                ,
                t.prototype.simplify = function() {
                    var t = this.buf;
                    return 1 == t.length ? t[0] : this
                }
                ,
                t
            }(), x = "…", b = /^(\d\d)(0[1-9]|1[0-2])(0[1-9]|[12]\d|3[01])([01]\d|2[0-3])(?:([0-5]\d)(?:([0-5]\d)(?:[.,](\d{1,3}))?)?)?(Z|[-+](?:[0]\d|1[0-2])([0-5]\d)?)?$/, S = /^(\d\d\d\d)(0[1-9]|1[0-2])(0[1-9]|[12]\d|3[01])([01]\d|2[0-3])(?:([0-5]\d)(?:([0-5]\d)(?:[.,](\d{1,3}))?)?)?(Z|[-+](?:[0]\d|1[0-2])([0-5]\d)?)?$/;
            function _(t, e) {
                return t.length > e && (t = t.substring(0, e) + x),
                t
            }
            var w, T = function() {
                function t(e, n) {
                    this.hexDigits = "0123456789ABCDEF",
                    e instanceof t ? (this.enc = e.enc,
                    this.pos = e.pos) : (this.enc = e,
                    this.pos = n)
                }
                return t.prototype.get = function(t) {
                    if (void 0 === t && (t = this.pos++),
                    t >= this.enc.length)
                        throw new Error("Requesting byte offset " + t + " on a stream of length " + this.enc.length);
                    return "string" == typeof this.enc ? this.enc.charCodeAt(t) : this.enc[t]
                }
                ,
                t.prototype.hexByte = function(t) {
                    return this.hexDigits.charAt(t >> 4 & 15) + this.hexDigits.charAt(15 & t)
                }
                ,
                t.prototype.hexDump = function(t, e, n) {
                    for (var i = "", r = t; r < e; ++r)
                        if (i += this.hexByte(this.get(r)),
                        !0 !== n)
                            switch (15 & r) {
                            case 7:
                                i += "  ";
                                break;
                            case 15:
                                i += "\n";
                                break;
                            default:
                                i += " "
                            }
                    return i
                }
                ,
                t.prototype.isASCII = function(t, e) {
                    for (var n = t; n < e; ++n) {
                        var i = this.get(n);
                        if (i < 32 || i > 176)
                            return !1
                    }
                    return !0
                }
                ,
                t.prototype.parseStringISO = function(t, e) {
                    for (var n = "", i = t; i < e; ++i)
                        n += String.fromCharCode(this.get(i));
                    return n
                }
                ,
                t.prototype.parseStringUTF = function(t, e) {
                    for (var n = "", i = t; i < e; ) {
                        var r = this.get(i++);
                        n += r < 128 ? String.fromCharCode(r) : r > 191 && r < 224 ? String.fromCharCode((31 & r) << 6 | 63 & this.get(i++)) : String.fromCharCode((15 & r) << 12 | (63 & this.get(i++)) << 6 | 63 & this.get(i++))
                    }
                    return n
                }
                ,
                t.prototype.parseStringBMP = function(t, e) {
                    for (var n, i, r = "", o = t; o < e; )
                        n = this.get(o++),
                        i = this.get(o++),
                        r += String.fromCharCode(n << 8 | i);
                    return r
                }
                ,
                t.prototype.parseTime = function(t, e, n) {
                    var i = this.parseStringISO(t, e)
                      , r = (n ? b : S).exec(i);
                    return r ? (n && (r[1] = +r[1],
                    r[1] += +r[1] < 70 ? 2e3 : 1900), i = r[1] + "-" + r[2] + "-" + r[3] + " " + r[4], r[5] && (i += ":" + r[5], r[6] && (i += ":" + r[6], r[7] && (i += "." + r[7]))), r[8] && (i += " UTC", "Z" != r[8] && (i += r[8], r[9] && (i += ":" + r[9]))), i) : "Unrecognized time: " + i } , t.prototype.parseInteger = function(t, e) { for (var n, i = this.get(t), r = i > 127, o = r ? 255 : 0, a = ""; i == o && ++t < e; ) i = this.get(t); if (0 === (n = e - t)) return r ? -1 : 0; if (n > 4) {
                        for (a = i,
                        n <<= 3; 0 == (128 & (+a ^ o)); )
                            a = +a << 1,
                            --n;
                        a = "(" + n + " bit)\n"
                    }
                    r && (i -= 256);
                    for (var s = new y(i), u = t + 1; u < e; ++u)
                        s.mulAdd(256, this.get(u));
                    return a + s.toString()
                }
                ,
                t.prototype.parseBitString = function(t, e, n) {
                    for (var i = this.get(t), r = "(" + ((e - t - 1 << 3) - i) + " bit)\n", o = "", a = t + 1; a < e; ++a) { for (var s = this.get(a), u = a == e - 1 ? i : 0, c = 7; c >= u; --c)
                            o += s >> c & 1 ? "1" : "0";
                        if (o.length > n)
                            return r + _(o, n)
                    }
                    return r + o
                }
                ,
                t.prototype.parseOctetString = function(t, e, n) {
                    if (this.isASCII(t, e))
                        return _(this.parseStringISO(t, e), n);
                    var i = e - t
                      , r = "(" + i + " byte)\n";
                    i > (n /= 2) && (e = t + n);
                    for (var o = t; o < e; ++o) r += this.hexByte(this.get(o)); return i > n && (r += x),
                    r
                }
                ,
                t.prototype.parseOID = function(t, e, n) {
                    for (var i = "", r = new y, o = 0, a = t; a < e; ++a) {
                        var s = this.get(a);
                        if (r.mulAdd(128, 127 & s),
                        o += 7,
                        !(128 & s)) {
                            if ("" === i)
                                if ((r = r.simplify())instanceof y)
                                    r.sub(80),
                                    i = "2." + r.toString();
                                else {
                                    var u = r < 80 ? r < 40 ? 0 : 1 : 2; i = u + "." + (r - 40 * u) } else i += "." + r.toString(); if (i.length > n)
                                return _(i, n);
                            r = new y,
                            o = 0
                        }
                    }
                    return o > 0 && (i += ".incomplete"),
                    i
                }
                ,
                t
            }(), C = function() {
                function t(t, e, n, i, r) {
                    if (!(i instanceof k))
                        throw new Error("Invalid tag value.");
                    this.stream = t,
                    this.header = e,
                    this.length = n,
                    this.tag = i,
                    this.sub = r
                }
                return t.prototype.typeName = function() {
                    switch (this.tag.tagClass) {
                    case 0:
                        switch (this.tag.tagNumber) {
                        case 0:
                            return "EOC";
                        case 1:
                            return "BOOLEAN";
                        case 2:
                            return "INTEGER";
                        case 3:
                            return "BIT_STRING";
                        case 4:
                            return "OCTET_STRING";
                        case 5:
                            return "NULL";
                        case 6:
                            return "OBJECT_IDENTIFIER";
                        case 7:
                            return "ObjectDescriptor";
                        case 8:
                            return "EXTERNAL";
                        case 9:
                            return "REAL";
                        case 10:
                            return "ENUMERATED";
                        case 11:
                            return "EMBEDDED_PDV";
                        case 12:
                            return "UTF8String";
                        case 16:
                            return "SEQUENCE";
                        case 17:
                            return "SET";
                        case 18:
                            return "NumericString";
                        case 19:
                            return "PrintableString";
                        case 20:
                            return "TeletexString";
                        case 21:
                            return "VideotexString";
                        case 22:
                            return "IA5String";
                        case 23:
                            return "UTCTime";
                        case 24:
                            return "GeneralizedTime";
                        case 25:
                            return "GraphicString";
                        case 26:
                            return "VisibleString";
                        case 27:
                            return "GeneralString";
                        case 28:
                            return "UniversalString";
                        case 30:
                            return "BMPString"
                        }
                        return "Universal_" + this.tag.tagNumber.toString();
                    case 1:
                        return "Application_" + this.tag.tagNumber.toString();
                    case 2:
                        return "[" + this.tag.tagNumber.toString() + "]";
                    case 3:
                        return "Private_" + this.tag.tagNumber.toString()
                    }
                }
                ,
                t.prototype.content = function(t) {
                    if (void 0 === this.tag)
                        return null;
                    void 0 === t && (t = 1 / 0);
                    var e = this.posContent()
                      , n = Math.abs(this.length);
                    if (!this.tag.isUniversal())
                        return null !== this.sub ? "(" + this.sub.length + " elem)" : this.stream.parseOctetString(e, e + n, t);
                    switch (this.tag.tagNumber) {
                    case 1:
                        return 0 === this.stream.get(e) ? "false" : "true";
                    case 2:
                        return this.stream.parseInteger(e, e + n);
                    case 3:
                        return this.sub ? "(" + this.sub.length + " elem)" : this.stream.parseBitString(e, e + n, t);
                    case 4:
                        return this.sub ? "(" + this.sub.length + " elem)" : this.stream.parseOctetString(e, e + n, t);
                    case 6:
                        return this.stream.parseOID(e, e + n, t);
                    case 16:
                    case 17:
                        return null !== this.sub ? "(" + this.sub.length + " elem)" : "(no elem)";
                    case 12:
                        return _(this.stream.parseStringUTF(e, e + n), t);
                    case 18:
                    case 19:
                    case 20:
                    case 21:
                    case 22:
                    case 26:
                        return _(this.stream.parseStringISO(e, e + n), t);
                    case 30:
                        return _(this.stream.parseStringBMP(e, e + n), t);
                    case 23:
                    case 24:
                        return this.stream.parseTime(e, e + n, 23 == this.tag.tagNumber)
                    }
                    return null
                }
                ,
                t.prototype.toString = function() {
                    return this.typeName() + "@" + this.stream.pos + "[header:" + this.header + ",length:" + this.length + ",sub:" + (null === this.sub ? "null" : this.sub.length) + "]"
                }
                ,
                t.prototype.toPrettyString = function(t) {
                    void 0 === t && (t = "");
                    var e = t + this.typeName() + " @" + this.stream.pos;
                    if (this.length >= 0 && (e += "+"),
                    e += this.length,
                    this.tag.tagConstructed ? e += " (constructed)" : !this.tag.isUniversal() || 3 != this.tag.tagNumber && 4 != this.tag.tagNumber || null === this.sub || (e += " (encapsulates)"),
                    e += "\n",
                    null !== this.sub) {
                        t += "  ";
                        for (var n = 0, i = this.sub.length; n < i; ++n) e += this.sub[n].toPrettyString(t) } return e } , t.prototype.posStart = function() { return this.stream.pos } , t.prototype.posContent = function() { return this.stream.pos + this.header } , t.prototype.posEnd = function() { return this.stream.pos + this.header + Math.abs(this.length) } , t.prototype.toHexString = function() { return this.stream.hexDump(this.posStart(), this.posEnd(), !0) } , t.decodeLength = function(t) { var e = t.get() , n = 127 & e; if (n == e) return n; if (n > 6)
                        throw new Error("Length over 48 bits not supported at position " + (t.pos - 1));
                    if (0 === n)
                        return null;
                    e = 0;
                    for (var i = 0; i < n; ++i)
                        e = 256 * e + t.get();
                    return e
                }
                ,
                t.prototype.getHexStringValue = function() {
                    var t = this.toHexString()
                      , e = 2 * this.header
                      , n = 2 * this.length;
                    return t.substr(e, n)
                }
                ,
                t.decode = function(e) {
                    var n;
                    n = e instanceof T ? e : new T(e,0);
                    var i = new T(n)
                      , r = new k(n)
                      , o = t.decodeLength(n)
                      , a = n.pos
                      , s = a - i.pos
                      , u = null
                      , c = function() {
                        var e = [];
                        if (null !== o) {
                            for (var i = a + o; n.pos < i; )
                                e[e.length] = t.decode(n);
                            if (n.pos != i)
                                throw new Error("Content size is not correct for container starting at offset " + a)
                        } else
                            try {
                                for (; ; ) {
                                    var r = t.decode(n);
                                    if (r.tag.isEOC())
                                        break;
                                    e[e.length] = r
                                }
                                o = a - n.pos
                            } catch (t) {
                                throw new Error("Exception while decoding undefined length content: " + t)
                            }
                        return e
                    };
                    if (r.tagConstructed)
                        u = c();
                    else if (r.isUniversal() && (3 == r.tagNumber || 4 == r.tagNumber))
                        try {
                            if (3 == r.tagNumber && 0 != n.get())
                                throw new Error("BIT STRINGs with unused bits cannot encapsulate.");
                            u = c();
                            for (var l = 0; l < u.length; ++l) if (u[l].tag.isEOC()) throw new Error("EOC is not supposed to be actual content.") } catch (t) { u = null } if (null === u) { if (null === o) throw new Error("We can't skip over an invalid tag with undefined length at offset " + a); n.pos = a + Math.abs(o) } return new t(i,s,o,r,u) } , t }(), k = function() { function t(t) { var e = t.get(); if (this.tagClass = e >> 6,
                    this.tagConstructed = 0 != (32 & e),
                    this.tagNumber = 31 & e,
                    31 == this.tagNumber) {
                        var n = new y;
                        do {
                            e = t.get(),
                            n.mulAdd(128, 127 & e)
                        } while (128 & e);this.tagNumber = n.simplify()
                    }
                }
                return t.prototype.isUniversal = function() {
                    return 0 === this.tagClass
                }
                ,
                t.prototype.isEOC = function() {
                    return 0 === this.tagClass && 0 === this.tagNumber
                }
                ,
                t
            }(), O = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997], M = (1 << 26) / O[O.length - 1], E = function() {
                function t(t, e, n) {
                    null != t && ("number" == typeof t ? this.fromNumber(t, e, n) : null == e && "string" != typeof t ? this.fromString(t, 256) : this.fromString(t, e))
                }
                return t.prototype.toString = function(t) {
                    if (this.s < 0)
                        return "-" + this.negate().toString(t);
                    var e;
                    if (16 == t)
                        e = 4;
                    else if (8 == t)
                        e = 3;
                    else if (2 == t)
                        e = 1;
                    else if (32 == t)
                        e = 5;
                    else {
                        if (4 != t)
                            return this.toRadix(t);
                        e = 2
                    }
                    var i, r = (1 << e) - 1, o = !1, a = "", s = this.t, u = this.DB - s * this.DB % e; if (s-- > 0)
                        for (u < this.DB && (i = this[s] >> u) > 0 && (o = !0,
                        a = n(i)); s >= 0; )
                            u < e ? (i = (this[s] & (1 << u) - 1) << e - u, i |= this[--s] >> (u += this.DB - e)) : (i = this[s] >> (u -= e) & r,
                            u <= 0 && (u += this.DB, --s)), i > 0 && (o = !0),
                            o && (a += n(i));
                    return o ? a : "0"
                }
                ,
                t.prototype.negate = function() {
                    var e = R();
                    return t.ZERO.subTo(this, e),
                    e
                }
                ,
                t.prototype.abs = function() {
                    return this.s < 0 ? this.negate() : this
                }
                ,
                t.prototype.compareTo = function(t) {
                    var e = this.s - t.s;
                    if (0 != e)
                        return e;
                    var n = this.t;
                    if (0 != (e = n - t.t))
                        return this.s < 0 ? -e : e; for (; --n >= 0; )
                        if (0 != (e = this[n] - t[n]))
                            return e;
                    return 0
                }
                ,
                t.prototype.bitLength = function() {
                    return this.t <= 0 ? 0 : this.DB * (this.t - 1) + H(this[this.t - 1] ^ this.s & this.DM)
                }
                ,
                t.prototype.mod = function(e) {
                    var n = R();
                    return this.abs().divRemTo(e, null, n),
                    this.s < 0 && n.compareTo(t.ZERO) > 0 && e.subTo(n, n),
                    n
                }
                ,
                t.prototype.modPowInt = function(t, e) {
                    var n;
                    return n = t < 256 || e.isEven() ? new A(e) : new D(e),
                    this.exp(t, n)
                }
                ,
                t.prototype.clone = function() {
                    var t = R();
                    return this.copyTo(t),
                    t
                }
                ,
                t.prototype.intValue = function() {
                    if (this.s < 0) {
                        if (1 == this.t)
                            return this[0] - this.DV;
                        if (0 == this.t)
                            return -1
                    } else {
                        if (1 == this.t)
                            return this[0];
                        if (0 == this.t)
                            return 0
                    }
                    return (this[1] & (1 << 32 - this.DB) - 1) << this.DB | this[0]
                }
                ,
                t.prototype.byteValue = function() {
                    return 0 == this.t ? this.s : this[0] << 24 >> 24
                }
                ,
                t.prototype.shortValue = function() {
                    return 0 == this.t ? this.s : this[0] << 16 >> 16
                }
                ,
                t.prototype.signum = function() {
                    return this.s < 0 ? -1 : this.t <= 0 || 1 == this.t && this[0] <= 0 ? 0 : 1 } , t.prototype.toByteArray = function() { var t = this.t , e = []; e[0] = this.s; var n, i = this.DB - t * this.DB % 8, r = 0; if (t-- > 0)
                        for (i < this.DB && (n = this[t] >> i) != (this.s & this.DM) >> i && (e[r++] = n | this.s << this.DB - i); t >= 0; )
                            i < 8 ? (n = (this[t] & (1 << i) - 1) << 8 - i, n |= this[--t] >> (i += this.DB - 8)) : (n = this[t] >> (i -= 8) & 255,
                            i <= 0 && (i += this.DB, --t)), 0 != (128 & n) && (n |= -256), 0 == r && (128 & this.s) != (128 & n) && ++r, (r > 0 || n != this.s) && (e[r++] = n);
                    return e
                }
                ,
                t.prototype.equals = function(t) {
                    return 0 == this.compareTo(t)
                }
                ,
                t.prototype.min = function(t) {
                    return this.compareTo(t) < 0 ? this : t } , t.prototype.max = function(t) { return this.compareTo(t) > 0 ? this : t
                }
                ,
                t.prototype.and = function(t) {
                    var e = R();
                    return this.bitwiseTo(t, i, e),
                    e
                }
                ,
                t.prototype.or = function(t) {
                    var e = R();
                    return this.bitwiseTo(t, r, e),
                    e
                }
                ,
                t.prototype.xor = function(t) {
                    var e = R();
                    return this.bitwiseTo(t, o, e),
                    e
                }
                ,
                t.prototype.andNot = function(t) {
                    var e = R();
                    return this.bitwiseTo(t, a, e),
                    e
                }
                ,
                t.prototype.not = function() {
                    for (var t = R(), e = 0; e < this.t; ++e)
                        t[e] = this.DM & ~this[e];
                    return t.t = this.t,
                    t.s = ~this.s,
                    t
                }
                ,
                t.prototype.shiftLeft = function(t) {
                    var e = R();
                    return t < 0 ? this.rShiftTo(-t, e) : this.lShiftTo(t, e),
                    e
                }
                ,
                t.prototype.shiftRight = function(t) {
                    var e = R();
                    return t < 0 ? this.lShiftTo(-t, e) : this.rShiftTo(t, e),
                    e
                }
                ,
                t.prototype.getLowestSetBit = function() {
                    for (var t = 0; t < this.t; ++t)
                        if (0 != this[t])
                            return t * this.DB + s(this[t]);
                    return this.s < 0 ? this.t * this.DB : -1
                }
                ,
                t.prototype.bitCount = function() {
                    for (var t = 0, e = this.s & this.DM, n = 0; n < this.t; ++n) t += u(this[n] ^ e); return t } , t.prototype.testBit = function(t) { var e = Math.floor(t / this.DB); return e >= this.t ? 0 != this.s : 0 != (this[e] & 1 << t % this.DB)
                }
                ,
                t.prototype.setBit = function(t) {
                    return this.changeBit(t, r)
                }
                ,
                t.prototype.clearBit = function(t) {
                    return this.changeBit(t, a)
                }
                ,
                t.prototype.flipBit = function(t) {
                    return this.changeBit(t, o)
                }
                ,
                t.prototype.add = function(t) {
                    var e = R();
                    return this.addTo(t, e),
                    e
                }
                ,
                t.prototype.subtract = function(t) {
                    var e = R();
                    return this.subTo(t, e),
                    e
                }
                ,
                t.prototype.multiply = function(t) {
                    var e = R();
                    return this.multiplyTo(t, e),
                    e
                }
                ,
                t.prototype.divide = function(t) {
                    var e = R();
                    return this.divRemTo(t, e, null),
                    e
                }
                ,
                t.prototype.remainder = function(t) {
                    var e = R();
                    return this.divRemTo(t, null, e),
                    e
                }
                ,
                t.prototype.divideAndRemainder = function(t) {
                    var e = R()
                      , n = R();
                    return this.divRemTo(t, e, n),
                    [e, n]
                }
                ,
                t.prototype.modPow = function(t, e) {
                    var n, i, r = t.bitLength(), o = Y(1);
                    if (r <= 0)
                        return o;
                    n = r < 18 ? 1 : r < 48 ? 3 : r < 144 ? 4 : r < 768 ? 5 : 6,
                    i = r < 8 ? new A(e) : e.isEven() ? new I(e) : new D(e);
                    var a = []
                      , s = 3
                      , u = n - 1
                      , c = (1 << n) - 1; if (a[1] = i.convert(this), n > 1) {
                        var l = R();
                        for (i.sqrTo(a[1], l); s <= c; ) a[s] = R(), i.mulTo(l, a[s - 2], a[s]), s += 2 } var h, f, d = t.t - 1, p = !0, g = R(); for (r = H(t[d]) - 1; d >= 0; ) {
                        for (r >= u ? h = t[d] >> r - u & c : (h = (t[d] & (1 << r + 1) - 1) << u - r, d > 0 && (h |= t[d - 1] >> this.DB + r - u)),
                        s = n; 0 == (1 & h); )
                            h >>= 1,
                            --s;
                        if ((r -= s) < 0 && (r += this.DB, --d), p) a[h].copyTo(o), p = !1; else { for (; s > 1; )
                                i.sqrTo(o, g),
                                i.sqrTo(g, o),
                                s -= 2;
                            s > 0 ? i.sqrTo(o, g) : (f = o,
                            o = g,
                            g = f),
                            i.mulTo(g, a[h], o)
                        }
                        for (; d >= 0 && 0 == (t[d] & 1 << r); )
                            i.sqrTo(o, g),
                            f = o,
                            o = g,
                            g = f,
                            --r < 0 && (r = this.DB - 1, --d) } return i.revert(o) } , t.prototype.modInverse = function(e) { var n = e.isEven(); if (this.isEven() && n || 0 == e.signum()) return t.ZERO; for (var i = e.clone(), r = this.clone(), o = Y(1), a = Y(0), s = Y(0), u = Y(1); 0 != i.signum(); ) { for (; i.isEven(); ) i.rShiftTo(1, i), n ? (o.isEven() && a.isEven() || (o.addTo(this, o), a.subTo(e, a)), o.rShiftTo(1, o)) : a.isEven() || a.subTo(e, a), a.rShiftTo(1, a); for (; r.isEven(); ) r.rShiftTo(1, r), n ? (s.isEven() && u.isEven() || (s.addTo(this, s), u.subTo(e, u)), s.rShiftTo(1, s)) : u.isEven() || u.subTo(e, u), u.rShiftTo(1, u); i.compareTo(r) >= 0 ? (i.subTo(r, i),
                        n && o.subTo(s, o),
                        a.subTo(u, a)) : (r.subTo(i, r),
                        n && s.subTo(o, s),
                        u.subTo(a, u))
                    }
                    return 0 != r.compareTo(t.ONE) ? t.ZERO : u.compareTo(e) >= 0 ? u.subtract(e) : u.signum() < 0 ? (u.addTo(e, u),
                    u.signum() < 0 ? u.add(e) : u) : u
                }
                ,
                t.prototype.pow = function(t) {
                    return this.exp(t, new P)
                }
                ,
                t.prototype.gcd = function(t) {
                    var e = this.s < 0 ? this.negate() : this.clone()
                      , n = t.s < 0 ? t.negate() : t.clone();
                    if (e.compareTo(n) < 0) {
                        var i = e;
                        e = n,
                        n = i
                    }
                    var r = e.getLowestSetBit()
                      , o = n.getLowestSetBit();
                    if (o < 0)
                        return e;
                    for (r < o && (o = r), o > 0 && (e.rShiftTo(o, e),
                    n.rShiftTo(o, n)); e.signum() > 0; )
                        (r = e.getLowestSetBit()) > 0 && e.rShiftTo(r, e),
                        (r = n.getLowestSetBit()) > 0 && n.rShiftTo(r, n),
                        e.compareTo(n) >= 0 ? (e.subTo(n, e),
                        e.rShiftTo(1, e)) : (n.subTo(e, n),
                        n.rShiftTo(1, n));
                    return o > 0 && n.lShiftTo(o, n),
                    n
                }
                ,
                t.prototype.isProbablePrime = function(t) {
                    var e, n = this.abs();
                    if (1 == n.t && n[0] <= O[O.length - 1]) {
                        for (e = 0; e < O.length; ++e)
                            if (n[0] == O[e])
                                return !0;
                        return !1
                    }
                    if (n.isEven())
                        return !1;
                    for (e = 1; e < O.length; ) {
                        for (var i = O[e], r = e + 1; r < O.length && i < M; )
                            i *= O[r++];
                        for (i = n.modInt(i); e < r; ) if (i % O[e++] == 0) return !1 } return n.millerRabin(t) } , t.prototype.copyTo = function(t) { for (var e = this.t - 1; e >= 0; --e)
                        t[e] = this[e];
                    t.t = this.t,
                    t.s = this.s
                }
                ,
                t.prototype.fromInt = function(t) {
                    this.t = 1,
                    this.s = t < 0 ? -1 : 0, t > 0 ? this[0] = t : t < -1 ? this[0] = t + this.DV : this.t = 0 } , t.prototype.fromString = function(e, n) { var i; if (16 == n) i = 4; else if (8 == n) i = 3; else if (256 == n) i = 8; else if (2 == n) i = 1; else if (32 == n) i = 5; else { if (4 != n) return void this.fromRadix(e, n); i = 2 } this.t = 0, this.s = 0; for (var r = e.length, o = !1, a = 0; --r >= 0; ) {
                        var s = 8 == i ? 255 & +e[r] : F(e, r);
                        s < 0 ? "-" == e.charAt(r) && (o = !0) : (o = !1, 0 == a ? this[this.t++] = s : a + i > this.DB ? (this[this.t - 1] |= (s & (1 << this.DB - a) - 1) << a, this[this.t++] = s >> this.DB - a) : this[this.t - 1] |= s << a, (a += i) >= this.DB && (a -= this.DB))
                    }
                    8 == i && 0 != (128 & +e[0]) && (this.s = -1,
                    a > 0 && (this[this.t - 1] |= (1 << this.DB - a) - 1 << a)), this.clamp(), o && t.ZERO.subTo(this, this) } , t.prototype.clamp = function() { for (var t = this.s & this.DM; this.t > 0 && this[this.t - 1] == t; )
                        --this.t
                }
                ,
                t.prototype.dlShiftTo = function(t, e) {
                    var n;
                    for (n = this.t - 1; n >= 0; --n)
                        e[n + t] = this[n];
                    for (n = t - 1; n >= 0; --n)
                        e[n] = 0;
                    e.t = this.t + t,
                    e.s = this.s
                }
                ,
                t.prototype.drShiftTo = function(t, e) {
                    for (var n = t; n < this.t; ++n)
                        e[n - t] = this[n];
                    e.t = Math.max(this.t - t, 0),
                    e.s = this.s
                }
                ,
                t.prototype.lShiftTo = function(t, e) {
                    for (var n = t % this.DB, i = this.DB - n, r = (1 << i) - 1, o = Math.floor(t / this.DB), a = this.s << n & this.DM, s = this.t - 1; s >= 0; --s)
                        e[s + o + 1] = this[s] >> i | a,
                        a = (this[s] & r) << n; for (s = o - 1; s >= 0; --s)
                        e[s] = 0;
                    e[o] = a,
                    e.t = this.t + o + 1,
                    e.s = this.s,
                    e.clamp()
                }
                ,
                t.prototype.rShiftTo = function(t, e) {
                    e.s = this.s;
                    var n = Math.floor(t / this.DB);
                    if (n >= this.t)
                        e.t = 0;
                    else {
                        var i = t % this.DB
                          , r = this.DB - i
                          , o = (1 << i) - 1; e[0] = this[n] >> i;
                        for (var a = n + 1; a < this.t; ++a)
                            e[a - n - 1] |= (this[a] & o) << r, e[a - n] = this[a] >> i;
                        i > 0 && (e[this.t - n - 1] |= (this.s & o) << r),
                        e.t = this.t - n,
                        e.clamp()
                    }
                }
                ,
                t.prototype.subTo = function(t, e) {
                    for (var n = 0, i = 0, r = Math.min(t.t, this.t); n < r; ) i += this[n] - t[n], e[n++] = i & this.DM, i >>= this.DB;
                    if (t.t < this.t) {
                        for (i -= t.s; n < this.t; ) i += this[n], e[n++] = i & this.DM, i >>= this.DB;
                        i += this.s
                    } else {
                        for (i += this.s; n < t.t; ) i -= t[n], e[n++] = i & this.DM, i >>= this.DB;
                        i -= t.s
                    }
                    e.s = i < 0 ? -1 : 0,
                    i < -1 ? e[n++] = this.DV + i : i > 0 && (e[n++] = i),
                    e.t = n,
                    e.clamp()
                }
                ,
                t.prototype.multiplyTo = function(e, n) {
                    var i = this.abs()
                      , r = e.abs()
                      , o = i.t;
                    for (n.t = o + r.t; --o >= 0; )
                        n[o] = 0;
                    for (o = 0; o < r.t; ++o) n[o + i.t] = i.am(0, r[o], n, o, 0, i.t); n.s = 0, n.clamp(), this.s != e.s && t.ZERO.subTo(n, n) } , t.prototype.squareTo = function(t) { for (var e = this.abs(), n = t.t = 2 * e.t; --n >= 0; )
                        t[n] = 0;
                    for (n = 0; n < e.t - 1; ++n) { var i = e.am(n, e[n], t, 2 * n, 0, 1); (t[n + e.t] += e.am(n + 1, 2 * e[n], t, 2 * n + 1, i, e.t - n - 1)) >= e.DV && (t[n + e.t] -= e.DV,
                        t[n + e.t + 1] = 1)
                    }
                    t.t > 0 && (t[t.t - 1] += e.am(n, e[n], t, 2 * n, 0, 1)),
                    t.s = 0,
                    t.clamp()
                }
                ,
                t.prototype.divRemTo = function(e, n, i) {
                    var r = e.abs();
                    if (!(r.t <= 0)) {
                        var o = this.abs();
                        if (o.t < r.t) return null != n && n.fromInt(0), void (null != i && this.copyTo(i)); null == i && (i = R()); var a = R() , s = this.s , u = e.s , c = this.DB - H(r[r.t - 1]); c > 0 ? (r.lShiftTo(c, a),
                        o.lShiftTo(c, i)) : (r.copyTo(a),
                        o.copyTo(i));
                        var l = a.t
                          , h = a[l - 1];
                        if (0 != h) {
                            var f = h * (1 << this.F1) + (l > 1 ? a[l - 2] >> this.F2 : 0)
                              , d = this.FV / f
                              , p = (1 << this.F1) / f
                              , g = 1 << this.F2 , v = i.t , m = v - l , y = null == n ? R() : n; for (a.dlShiftTo(m, y), i.compareTo(y) >= 0 && (i[i.t++] = 1,
                            i.subTo(y, i)),
                            t.ONE.dlShiftTo(l, y),
                            y.subTo(a, a); a.t < l; ) a[a.t++] = 0; for (; --m >= 0; ) {
                                var x = i[--v] == h ? this.DM : Math.floor(i[v] * d + (i[v - 1] + g) * p);
                                if ((i[v] += a.am(0, x, i, m, 0, l)) < x)
                                    for (a.dlShiftTo(m, y),
                                    i.subTo(y, i); i[v] < --x; ) i.subTo(y, i) } null != n && (i.drShiftTo(l, n), s != u && t.ZERO.subTo(n, n)), i.t = l, i.clamp(), c > 0 && i.rShiftTo(c, i),
                            s < 0 && t.ZERO.subTo(i, i)
                        }
                    }
                }
                ,
                t.prototype.invDigit = function() {
                    if (this.t < 1) return 0; var t = this[0]; if (0 == (1 & t)) return 0; var e = 3 & t; return (e = (e = (e = (e = e * (2 - (15 & t) * e) & 15) * (2 - (255 & t) * e) & 255) * (2 - ((65535 & t) * e & 65535)) & 65535) * (2 - t * e % this.DV) % this.DV) > 0 ? this.DV - e : -e
                }
                ,
                t.prototype.isEven = function() {
                    return 0 == (this.t > 0 ? 1 & this[0] : this.s)
                }
                ,
                t.prototype.exp = function(e, n) {
                    if (e > 4294967295 || e < 1) return t.ONE; var i = R() , r = R() , o = n.convert(this) , a = H(e) - 1; for (o.copyTo(i); --a >= 0; )
                        if (n.sqrTo(i, r),
                        (e & 1 << a) > 0)
                            n.mulTo(r, o, i);
                        else {
                            var s = i;
                            i = r,
                            r = s
                        }
                    return n.revert(i)
                }
                ,
                t.prototype.chunkSize = function(t) {
                    return Math.floor(Math.LN2 * this.DB / Math.log(t))
                }
                ,
                t.prototype.toRadix = function(t) {
                    if (null == t && (t = 10),
                    0 == this.signum() || t < 2 || t > 36)
                        return "0";
                    var e = this.chunkSize(t)
                      , n = Math.pow(t, e)
                      , i = Y(n)
                      , r = R()
                      , o = R()
                      , a = "";
                    for (this.divRemTo(i, r, o); r.signum() > 0; )
                        a = (n + o.intValue()).toString(t).substr(1) + a,
                        r.divRemTo(i, r, o);
                    return o.intValue().toString(t) + a
                }
                ,
                t.prototype.fromRadix = function(e, n) {
                    this.fromInt(0),
                    null == n && (n = 10);
                    for (var i = this.chunkSize(n), r = Math.pow(n, i), o = !1, a = 0, s = 0, u = 0; u < e.length; ++u) {
                        var c = F(e, u);
                        c < 0 ? "-" == e.charAt(u) && 0 == this.signum() && (o = !0) : (s = n * s + c, ++a >= i && (this.dMultiply(r),
                        this.dAddOffset(s, 0),
                        a = 0,
                        s = 0))
                    }
                    a > 0 && (this.dMultiply(Math.pow(n, a)),
                    this.dAddOffset(s, 0)),
                    o && t.ZERO.subTo(this, this)
                }
                ,
                t.prototype.fromNumber = function(e, n, i) {
                    if ("number" == typeof n)
                        if (e < 2) this.fromInt(1); else for (this.fromNumber(e, i), this.testBit(e - 1) || this.bitwiseTo(t.ONE.shiftLeft(e - 1), r, this), this.isEven() && this.dAddOffset(1, 0); !this.isProbablePrime(n); ) this.dAddOffset(2, 0), this.bitLength() > e && this.subTo(t.ONE.shiftLeft(e - 1), this);
                    else {
                        var o = []
                          , a = 7 & e;
                        o.length = 1 + (e >> 3),
                        n.nextBytes(o),
                        a > 0 ? o[0] &= (1 << a) - 1 : o[0] = 0,
                        this.fromString(o, 256)
                    }
                }
                ,
                t.prototype.bitwiseTo = function(t, e, n) {
                    var i, r, o = Math.min(t.t, this.t);
                    for (i = 0; i < o; ++i)
                        n[i] = e(this[i], t[i]);
                    if (t.t < this.t) {
                        for (r = t.s & this.DM,
                        i = o; i < this.t; ++i)
                            n[i] = e(this[i], r);
                        n.t = this.t
                    } else {
                        for (r = this.s & this.DM,
                        i = o; i < t.t; ++i)
                            n[i] = e(r, t[i]);
                        n.t = t.t
                    }
                    n.s = e(this.s, t.s),
                    n.clamp()
                }
                ,
                t.prototype.changeBit = function(e, n) {
                    var i = t.ONE.shiftLeft(e);
                    return this.bitwiseTo(i, n, i),
                    i
                }
                ,
                t.prototype.addTo = function(t, e) {
                    for (var n = 0, i = 0, r = Math.min(t.t, this.t); n < r; ) i += this[n] + t[n], e[n++] = i & this.DM, i >>= this.DB;
                    if (t.t < this.t) {
                        for (i += t.s; n < this.t; ) i += this[n], e[n++] = i & this.DM, i >>= this.DB;
                        i += this.s
                    } else {
                        for (i += this.s; n < t.t; ) i += t[n], e[n++] = i & this.DM, i >>= this.DB;
                        i += t.s
                    }
                    e.s = i < 0 ? -1 : 0, i > 0 ? e[n++] = i : i < -1 && (e[n++] = this.DV + i),
                    e.t = n,
                    e.clamp()
                }
                ,
                t.prototype.dMultiply = function(t) {
                    this[this.t] = this.am(0, t - 1, this, 0, 0, this.t),
                    ++this.t,
                    this.clamp()
                }
                ,
                t.prototype.dAddOffset = function(t, e) {
                    if (0 != t) {
                        for (; this.t <= e; ) this[this.t++] = 0; for (this[e] += t; this[e] >= this.DV; )
                            this[e] -= this.DV,
                            ++e >= this.t && (this[this.t++] = 0),
                            ++this[e]
                    }
                }
                ,
                t.prototype.multiplyLowerTo = function(t, e, n) {
                    var i = Math.min(this.t + t.t, e);
                    for (n.s = 0,
                    n.t = i; i > 0; )
                        n[--i] = 0;
                    for (var r = n.t - this.t; i < r; ++i)
                        n[i + this.t] = this.am(0, t[i], n, i, 0, this.t);
                    for (r = Math.min(t.t, e); i < r; ++i) this.am(0, t[i], n, i, 0, e - i); n.clamp() } , t.prototype.multiplyUpperTo = function(t, e, n) { --e; var i = n.t = this.t + t.t - e; for (n.s = 0; --i >= 0; )
                        n[i] = 0;
                    for (i = Math.max(e - this.t, 0); i < t.t; ++i)
                        n[this.t + i - e] = this.am(e - i, t[i], n, 0, 0, this.t + i - e);
                    n.clamp(),
                    n.drShiftTo(1, n)
                }
                ,
                t.prototype.modInt = function(t) {
                    if (t <= 0)
                        return 0;
                    var e = this.DV % t
                      , n = this.s < 0 ? t - 1 : 0; if (this.t > 0)
                        if (0 == e)
                            n = this[0] % t;
                        else
                            for (var i = this.t - 1; i >= 0; --i)
                                n = (e * n + this[i]) % t;
                    return n
                }
                ,
                t.prototype.millerRabin = function(e) {
                    var n = this.subtract(t.ONE)
                      , i = n.getLowestSetBit();
                    if (i <= 0) return !1; var r = n.shiftRight(i); (e = e + 1 >> 1) > O.length && (e = O.length);
                    for (var o = R(), a = 0; a < e; ++a) {
                        o.fromInt(O[Math.floor(Math.random() * O.length)]);
                        var s = o.modPow(r, this);
                        if (0 != s.compareTo(t.ONE) && 0 != s.compareTo(n)) {
                            for (var u = 1; u++ < i && 0 != s.compareTo(n); )
                                if (0 == (s = s.modPowInt(2, this)).compareTo(t.ONE))
                                    return !1;
                            if (0 != s.compareTo(n))
                                return !1
                        }
                    }
                    return !0
                }
                ,
                t.prototype.square = function() {
                    var t = R();
                    return this.squareTo(t),
                    t
                }
                ,
                t.prototype.gcda = function(t, e) {
                    var n = this.s < 0 ? this.negate() : this.clone()
                      , i = t.s < 0 ? t.negate() : t.clone();
                    if (n.compareTo(i) < 0) {
                        var r = n;
                        n = i,
                        i = r
                    }
                    var o = n.getLowestSetBit()
                      , a = i.getLowestSetBit();
                    if (a < 0)
                        e(n);
                    else {
                        o < a && (a = o), a > 0 && (n.rShiftTo(a, n),
                        i.rShiftTo(a, i));
                        var s = function() {
                            (o = n.getLowestSetBit()) > 0 && n.rShiftTo(o, n),
                            (o = i.getLowestSetBit()) > 0 && i.rShiftTo(o, i),
                            n.compareTo(i) >= 0 ? (n.subTo(i, n),
                            n.rShiftTo(1, n)) : (i.subTo(n, i),
                            i.rShiftTo(1, i)),
                            n.signum() > 0 ? setTimeout(s, 0) : (a > 0 && i.lShiftTo(a, i),
                            setTimeout(function() {
                                e(i)
                            }, 0))
                        };
                        setTimeout(s, 10)
                    }
                }
                ,
                t.prototype.fromNumberAsync = function(e, n, i, o) {
                    if ("number" == typeof n)
                        if (e < 2) this.fromInt(1); else { this.fromNumber(e, i), this.testBit(e - 1) || this.bitwiseTo(t.ONE.shiftLeft(e - 1), r, this), this.isEven() && this.dAddOffset(1, 0); var a = this , s = function() { a.dAddOffset(2, 0), a.bitLength() > e && a.subTo(t.ONE.shiftLeft(e - 1), a),
                                a.isProbablePrime(n) ? setTimeout(function() {
                                    o()
                                }, 0) : setTimeout(s, 0)
                            };
                            setTimeout(s, 0)
                        }
                    else {
                        var u = []
                          , c = 7 & e;
                        u.length = 1 + (e >> 3),
                        n.nextBytes(u),
                        c > 0 ? u[0] &= (1 << c) - 1 : u[0] = 0,
                        this.fromString(u, 256)
                    }
                }
                ,
                t
            }(), P = function() {
                function t() {}
                return t.prototype.convert = function(t) {
                    return t
                }
                ,
                t.prototype.revert = function(t) {
                    return t
                }
                ,
                t.prototype.mulTo = function(t, e, n) {
                    t.multiplyTo(e, n)
                }
                ,
                t.prototype.sqrTo = function(t, e) {
                    t.squareTo(e)
                }
                ,
                t
            }(), A = function() {
                function t(t) {
                    this.m = t
                }
                return t.prototype.convert = function(t) {
                    return t.s < 0 || t.compareTo(this.m) >= 0 ? t.mod(this.m) : t
                }
                ,
                t.prototype.revert = function(t) {
                    return t
                }
                ,
                t.prototype.reduce = function(t) {
                    t.divRemTo(this.m, null, t)
                }
                ,
                t.prototype.mulTo = function(t, e, n) {
                    t.multiplyTo(e, n),
                    this.reduce(n)
                }
                ,
                t.prototype.sqrTo = function(t, e) {
                    t.squareTo(e),
                    this.reduce(e)
                }
                ,
                t
            }(), D = function() {
                function t(t) {
                    this.m = t,
                    this.mp = t.invDigit(),
                    this.mpl = 32767 & this.mp,
                    this.mph = this.mp >> 15,
                    this.um = (1 << t.DB - 15) - 1,
                    this.mt2 = 2 * t.t
                }
                return t.prototype.convert = function(t) {
                    var e = R();
                    return t.abs().dlShiftTo(this.m.t, e),
                    e.divRemTo(this.m, null, e),
                    t.s < 0 && e.compareTo(E.ZERO) > 0 && this.m.subTo(e, e),
                    e
                }
                ,
                t.prototype.revert = function(t) {
                    var e = R();
                    return t.copyTo(e),
                    this.reduce(e),
                    e
                }
                ,
                t.prototype.reduce = function(t) {
                    for (; t.t <= this.mt2; )
                        t[t.t++] = 0;
                    for (var e = 0; e < this.m.t; ++e) { var n = 32767 & t[e] , i = n * this.mpl + ((n * this.mph + (t[e] >> 15) * this.mpl & this.um) << 15) & t.DM; for (t[n = e + this.m.t] += this.m.am(0, i, t, e, 0, this.m.t); t[n] >= t.DV; )
                            t[n] -= t.DV,
                            t[++n]++
                    }
                    t.clamp(),
                    t.drShiftTo(this.m.t, t),
                    t.compareTo(this.m) >= 0 && t.subTo(this.m, t)
                }
                ,
                t.prototype.mulTo = function(t, e, n) {
                    t.multiplyTo(e, n),
                    this.reduce(n)
                }
                ,
                t.prototype.sqrTo = function(t, e) {
                    t.squareTo(e),
                    this.reduce(e)
                }
                ,
                t
            }(), I = function() {
                function t(t) {
                    this.m = t,
                    this.r2 = R(),
                    this.q3 = R(),
                    E.ONE.dlShiftTo(2 * t.t, this.r2),
                    this.mu = this.r2.divide(t)
                }
                return t.prototype.convert = function(t) {
                    if (t.s < 0 || t.t > 2 * this.m.t)
                        return t.mod(this.m);
                    if (t.compareTo(this.m) < 0) return t; var e = R(); return t.copyTo(e), this.reduce(e), e } , t.prototype.revert = function(t) { return t } , t.prototype.reduce = function(t) { for (t.drShiftTo(this.m.t - 1, this.r2), t.t > this.m.t + 1 && (t.t = this.m.t + 1,
                    t.clamp()),
                    this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3),
                    this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2); t.compareTo(this.r2) < 0; ) t.dAddOffset(1, this.m.t + 1); for (t.subTo(this.r2, t); t.compareTo(this.m) >= 0; )
                        t.subTo(this.m, t)
                }
                ,
                t.prototype.mulTo = function(t, e, n) {
                    t.multiplyTo(e, n),
                    this.reduce(n)
                }
                ,
                t.prototype.sqrTo = function(t, e) {
                    t.squareTo(e),
                    this.reduce(e)
                }
                ,
                t
            }();
            function R() {
                return new E(null)
            }
            function N(t, e) {
                return new E(t,e)
            }
            "Microsoft Internet Explorer" == navigator.appName ? (E.prototype.am = function(t, e, n, i, r, o) {
                for (var a = 32767 & e, s = e >> 15; --o >= 0; ) {
                    var u = 32767 & this[t]
                      , c = this[t++] >> 15
                      , l = s * u + c * a;
                    r = ((u = a * u + ((32767 & l) << 15) + n[i] + (1073741823 & r)) >>> 30) + (l >>> 15) + s * c + (r >>> 30),
                    n[i++] = 1073741823 & u
                }
                return r
            }
            ,
            w = 30) : "Netscape" != navigator.appName ? (E.prototype.am = function(t, e, n, i, r, o) {
                for (; --o >= 0; ) {
                    var a = e * this[t++] + n[i] + r;
                    r = Math.floor(a / 67108864),
                    n[i++] = 67108863 & a
                }
                return r
            }
            ,
            w = 26) : (E.prototype.am = function(t, e, n, i, r, o) {
                for (var a = 16383 & e, s = e >> 14; --o >= 0; ) {
                    var u = 16383 & this[t]
                      , c = this[t++] >> 14
                      , l = s * u + c * a;
                    r = ((u = a * u + ((16383 & l) << 14) + n[i] + r) >> 28) + (l >> 14) + s * c,
                    n[i++] = 268435455 & u
                }
                return r
            }
            ,
            w = 28),
            E.prototype.DB = w,
            E.prototype.DM = (1 << w) - 1,
            E.prototype.DV = 1 << w;
            E.prototype.FV = Math.pow(2, 52),
            E.prototype.F1 = 52 - w,
            E.prototype.F2 = 2 * w - 52;
            var B, j, L = [];
            for (B = "0".charCodeAt(0),
            j = 0; j <= 9; ++j)
                L[B++] = j;
            for (B = "a".charCodeAt(0),
            j = 10; j < 36; ++j)
                L[B++] = j;
            for (B = "A".charCodeAt(0),
            j = 10; j < 36; ++j) L[B++] = j; function F(t, e) { var n = L[t.charCodeAt(e)]; return null == n ? -1 : n } function Y(t) { var e = R(); return e.fromInt(t), e } function H(t) { var e, n = 1; return 0 != (e = t >>> 16) && (t = e,
                n += 16),
                0 != (e = t >> 8) && (t = e,
                n += 8),
                0 != (e = t >> 4) && (t = e,
                n += 4),
                0 != (e = t >> 2) && (t = e,
                n += 2),
                0 != (e = t >> 1) && (t = e,
                n += 1),
                n
            }
            E.ZERO = Y(0),
            E.ONE = Y(1);
            var z = function() {
                function t() {
                    this.i = 0,
                    this.j = 0,
                    this.S = []
                }
                return t.prototype.init = function(t) {
                    var e, n, i;
                    for (e = 0; e < 256; ++e)
                        this.S[e] = e;
                    for (n = 0,
                    e = 0; e < 256; ++e)
                        n = n + this.S[e] + t[e % t.length] & 255,
                        i = this.S[e],
                        this.S[e] = this.S[n],
                        this.S[n] = i;
                    this.i = 0,
                    this.j = 0
                }
                ,
                t.prototype.next = function() {
                    var t;
                    return this.i = this.i + 1 & 255,
                    this.j = this.j + this.S[this.i] & 255,
                    t = this.S[this.i],
                    this.S[this.i] = this.S[this.j],
                    this.S[this.j] = t,
                    this.S[t + this.S[this.i] & 255]
                }
                ,
                t
            }();
            var V, U, W = 256, G = null;
            if (null == G) {
                G = [],
                U = 0;
                var X = void 0;
                if (window.crypto && window.crypto.getRandomValues) {
                    var q = new Uint32Array(256);
                    for (window.crypto.getRandomValues(q),
                    X = 0; X < q.length; ++X) G[U++] = 255 & q[X] } var K = function(t) { if (this.count = this.count || 0, this.count >= 256 || U >= W)
                        window.removeEventListener ? window.removeEventListener("mousemove", K, !1) : window.detachEvent && window.detachEvent("onmousemove", K);
                    else
                        try {
                            var e = t.x + t.y;
                            G[U++] = 255 & e,
                            this.count += 1
                        } catch (t) {}
                };
                window.addEventListener ? window.addEventListener("mousemove", K, !1) : window.attachEvent && window.attachEvent("onmousemove", K)
            }
            function $() {
                if (null == V) {
                    for (V = new z; U < W; ) {
                        var t = Math.floor(65536 * Math.random());
                        G[U++] = 255 & t
                    }
                    for (V.init(G),
                    U = 0; U < G.length; ++U)
                        G[U] = 0;
                    U = 0
                }
                return V.next()
            }
            var Z = function() {
                function t() {}
                return t.prototype.nextBytes = function(t) {
                    for (var e = 0; e < t.length; ++e)
                        t[e] = $()
                }
                ,
                t
            }();
            var Q = function() {
                function t() {
                    this.n = null,
                    this.e = 0,
                    this.d = null,
                    this.p = null,
                    this.q = null,
                    this.dmp1 = null,
                    this.dmq1 = null,
                    this.coeff = null
                }
                return t.prototype.doPublic = function(t) {
                    return t.modPowInt(this.e, this.n)
                }
                ,
                t.prototype.doPrivate = function(t) {
                    if (null == this.p || null == this.q)
                        return t.modPow(this.d, this.n);
                    for (var e = t.mod(this.p).modPow(this.dmp1, this.p), n = t.mod(this.q).modPow(this.dmq1, this.q); e.compareTo(n) < 0; ) e = e.add(this.p); return e.subtract(n).multiply(this.coeff).mod(this.p).multiply(this.q).add(n) } , t.prototype.setPublic = function(t, e) { null != t && null != e && t.length > 0 && e.length > 0 ? (this.n = N(t, 16),
                    this.e = parseInt(e, 16)) : console.error("Invalid RSA public key")
                }
                ,
                t.prototype.encrypt = function(t) {
                    var e = function(t, e) {
                        if (e < t.length + 11) return console.error("Message too long for RSA"), null; for (var n = [], i = t.length - 1; i >= 0 && e > 0; ) {
                            var r = t.charCodeAt(i--);
                            r < 128 ? n[--e] = r : r > 127 && r < 2048 ? (n[--e] = 63 & r | 128, n[--e] = r >> 6 | 192) : (n[--e] = 63 & r | 128,
                            n[--e] = r >> 6 & 63 | 128,
                            n[--e] = r >> 12 | 224)
                        }
                        n[--e] = 0;
                        for (var o = new Z, a = []; e > 2; ) {
                            for (a[0] = 0; 0 == a[0]; )
                                o.nextBytes(a);
                            n[--e] = a[0]
                        }
                        return n[--e] = 2,
                        n[--e] = 0,
                        new E(n)
                    }(t, this.n.bitLength() + 7 >> 3);
                    if (null == e)
                        return null;
                    var n = this.doPublic(e);
                    if (null == n)
                        return null;
                    var i = n.toString(16);
                    return 0 == (1 & i.length) ? i : "0" + i
                }
                ,
                t.prototype.setPrivate = function(t, e, n) {
                    null != t && null != e && t.length > 0 && e.length > 0 ? (this.n = N(t, 16),
                    this.e = parseInt(e, 16),
                    this.d = N(n, 16)) : console.error("Invalid RSA private key")
                }
                ,
                t.prototype.setPrivateEx = function(t, e, n, i, r, o, a, s) {
                    null != t && null != e && t.length > 0 && e.length > 0 ? (this.n = N(t, 16),
                    this.e = parseInt(e, 16),
                    this.d = N(n, 16),
                    this.p = N(i, 16),
                    this.q = N(r, 16),
                    this.dmp1 = N(o, 16),
                    this.dmq1 = N(a, 16),
                    this.coeff = N(s, 16)) : console.error("Invalid RSA private key")
                }
                ,
                t.prototype.generate = function(t, e) {
                    var n = new Z
                      , i = t >> 1;
                    this.e = parseInt(e, 16);
                    for (var r = new E(e,16); ; ) {
                        for (; this.p = new E(t - i,1,n),
                        0 != this.p.subtract(E.ONE).gcd(r).compareTo(E.ONE) || !this.p.isProbablePrime(10); )
                            ;
                        for (; this.q = new E(i,1,n),
                        0 != this.q.subtract(E.ONE).gcd(r).compareTo(E.ONE) || !this.q.isProbablePrime(10); )
                            ;
                        if (this.p.compareTo(this.q) <= 0) {
                            var o = this.p;
                            this.p = this.q,
                            this.q = o
                        }
                        var a = this.p.subtract(E.ONE)
                          , s = this.q.subtract(E.ONE)
                          , u = a.multiply(s);
                        if (0 == u.gcd(r).compareTo(E.ONE)) {
                            this.n = this.p.multiply(this.q),
                            this.d = r.modInverse(u),
                            this.dmp1 = this.d.mod(a),
                            this.dmq1 = this.d.mod(s),
                            this.coeff = this.q.modInverse(this.p);
                            break
                        }
                    }
                }
                ,
                t.prototype.decrypt = function(t) {
                    var e = N(t, 16)
                      , n = this.doPrivate(e);
                    return null == n ? null : function(t, e) {
                        var n = t.toByteArray()
                          , i = 0;
                        for (; i < n.length && 0 == n[i]; ) ++i; if (n.length - i != e - 1 || 2 != n[i]) return null; ++i; for (; 0 != n[i]; ) if (++i >= n.length)
                                return null;
                        var r = "";
                        for (; ++i < n.length; ) {
                            var o = 255 & n[i];
                            o < 128 ? r += String.fromCharCode(o) : o > 191 && o < 224 ? (r += String.fromCharCode((31 & o) << 6 | 63 & n[i + 1]),
                            ++i) : (r += String.fromCharCode((15 & o) << 12 | (63 & n[i + 1]) << 6 | 63 & n[i + 2]), i += 2) } return r }(n, this.n.bitLength() + 7 >> 3)
                }
                ,
                t.prototype.generateAsync = function(t, e, n) {
                    var i = new Z
                      , r = t >> 1;
                    this.e = parseInt(e, 16);
                    var o = new E(e,16)
                      , a = this
                      , s = function() {
                        var e = function() {
                            if (a.p.compareTo(a.q) <= 0) {
                                var t = a.p;
                                a.p = a.q,
                                a.q = t
                            }
                            var e = a.p.subtract(E.ONE)
                              , i = a.q.subtract(E.ONE)
                              , r = e.multiply(i);
                            0 == r.gcd(o).compareTo(E.ONE) ? (a.n = a.p.multiply(a.q),
                            a.d = o.modInverse(r),
                            a.dmp1 = a.d.mod(e),
                            a.dmq1 = a.d.mod(i),
                            a.coeff = a.q.modInverse(a.p),
                            setTimeout(function() {
                                n()
                            }, 0)) : setTimeout(s, 0)
                        }
                          , u = function() {
                            a.q = R(),
                            a.q.fromNumberAsync(r, 1, i, function() {
                                a.q.subtract(E.ONE).gcda(o, function(t) {
                                    0 == t.compareTo(E.ONE) && a.q.isProbablePrime(10) ? setTimeout(e, 0) : setTimeout(u, 0)
                                })
                            })
                        }
                          , c = function() {
                            a.p = R(),
                            a.p.fromNumberAsync(t - r, 1, i, function() {
                                a.p.subtract(E.ONE).gcda(o, function(t) {
                                    0 == t.compareTo(E.ONE) && a.p.isProbablePrime(10) ? setTimeout(u, 0) : setTimeout(c, 0)
                                })
                            })
                        };
                        setTimeout(c, 0)
                    };
                    setTimeout(s, 0)
                }
                ,
                t.prototype.sign = function(t, e, n) {
                    var i = function(t, e) {
                        if (e < t.length + 22)
                            return console.error("Message too long for RSA"),
                            null;
                        for (var n = e - t.length - 6, i = "", r = 0; r < n; r += 2)
                            i += "ff";
                        return N("0001" + i + "00" + t, 16)
                    }((J[n] || "") + e(t).toString(), this.n.bitLength() / 4);
                    if (null == i)
                        return null;
                    var r = this.doPrivate(i);
                    if (null == r)
                        return null;
                    var o = r.toString(16);
                    return 0 == (1 & o.length) ? o : "0" + o
                }
                ,
                t.prototype.verify = function(t, e, n) {
                    var i = N(e, 16)
                      , r = this.doPublic(i);
                    return null == r ? null : function(t) {
                        for (var e in J)
                            if (J.hasOwnProperty(e)) {
                                var n = J[e]
                                  , i = n.length;
                                if (t.substr(0, i) == n)
                                    return t.substr(i)
                            }
                        return t
                    }/*!
Copyright (c) 2011, Yahoo! Inc. All rights reserved.
Code licensed under the BSD License:
http://developer.yahoo.com/yui/license.html
version: 2.9.0
*/
                    (r.toString(16).replace(/^1f+00/, "")) == n(t).toString()
                }
                ,
                t
            }();
            var J = {
                md2: "3020300c06082a864886f70d020205000410",
                md5: "3020300c06082a864886f70d020505000410",
                sha1: "3021300906052b0e03021a05000414",
                sha224: "302d300d06096086480165030402040500041c",
                sha256: "3031300d060960864801650304020105000420",
                sha384: "3041300d060960864801650304020205000430",
                sha512: "3051300d060960864801650304020305000440",
                ripemd160: "3021300906052b2403020105000414"
            };
            var tt = {};
            tt.lang = {
                extend: function(t, e, n) {
                    if (!e || !t)
                        throw new Error("YAHOO.lang.extend failed, please check that all dependencies are included.");
                    var i = function() {};
                    if (i.prototype = e.prototype,
                    t.prototype = new i,
                    t.prototype.constructor = t,
                    t.superclass = e.prototype,
                    e.prototype.constructor == Object.prototype.constructor && (e.prototype.constructor = e),
                    n) {
                        var r;
                        for (r in n)
                            t.prototype[r] = n[r];
                        var o = function() {}
                          , a = ["toString", "valueOf"];
                        try {
                            /MSIE/.test(navigator.userAgent) && (o = function(t, e) {
                                for (r = 0; r < a.length; r += 1) {
                                    var n = a[r]
                                      , i = e[n];
                                    "function" == typeof i && i != Object.prototype[n] && (t[n] = i)
                                }
                            }
                            )
                        } catch (t) {}
                        o(t.prototype, n)
                    }
                }
            };
            /**
 * @fileOverview
 * @name asn1-1.0.js
 * @author Kenji Urushima kenji.urushima@gmail.com
 * @version asn1 1.0.13 (2017-Jun-02)
 * @since jsrsasign 2.1
 * @license

MIT License

 */
            var et = {};
            void 0 !== et.asn1 && et.asn1 || (et.asn1 = {}),
            et.asn1.ASN1Util = new function() {
                this.integerToByteHex = function(t) {
                    var e = t.toString(16);
                    return e.length % 2 == 1 && (e = "0" + e),
                    e
                }
                ,
                this.bigIntToMinTwosComplementsHex = function(t) {
                    var e = t.toString(16);
                    if ("-" != e.substr(0, 1))
                        e.length % 2 == 1 ? e = "0" + e : e.match(/^[0-7]/) || (e = "00" + e);
                    else {
                        var n = e.substr(1).length;
                        n % 2 == 1 ? n += 1 : e.match(/^[0-7]/) || (n += 2);
                        for (var i = "", r = 0; r < n; r++)
                            i += "f";
                        e = new E(i,16).xor(t).add(E.ONE).toString(16).replace(/^-/, "")
                    }
                    return e
                }
                ,
                this.getPEMStringFromHex = function(t, e) {
                    return hextopem(t, e)
                }
                ,
                this.newObject = function(t) {
                    var e = et.asn1
                      , n = e.DERBoolean
                      , i = e.DERInteger
                      , r = e.DERBitString
                      , o = e.DEROctetString
                      , a = e.DERNull
                      , s = e.DERObjectIdentifier
                      , u = e.DEREnumerated
                      , c = e.DERUTF8String
                      , l = e.DERNumericString
                      , h = e.DERPrintableString
                      , f = e.DERTeletexString
                      , d = e.DERIA5String
                      , p = e.DERUTCTime
                      , g = e.DERGeneralizedTime
                      , v = e.DERSequence
                      , m = e.DERSet
                      , y = e.DERTaggedObject
                      , x = e.ASN1Util.newObject
                      , b = Object.keys(t);
                    if (1 != b.length)
                        throw "key of param shall be only one.";
                    var S = b[0];
                    if (-1 == ":bool:int:bitstr:octstr:null:oid:enum:utf8str:numstr:prnstr:telstr:ia5str:utctime:gentime:seq:set:tag:".indexOf(":" + S + ":"))
                        throw "undefined key: " + S;
                    if ("bool" == S)
                        return new n(t[S]);
                    if ("int" == S)
                        return new i(t[S]);
                    if ("bitstr" == S)
                        return new r(t[S]);
                    if ("octstr" == S)
                        return new o(t[S]);
                    if ("null" == S)
                        return new a(t[S]);
                    if ("oid" == S)
                        return new s(t[S]);
                    if ("enum" == S)
                        return new u(t[S]);
                    if ("utf8str" == S)
                        return new c(t[S]);
                    if ("numstr" == S)
                        return new l(t[S]);
                    if ("prnstr" == S)
                        return new h(t[S]);
                    if ("telstr" == S)
                        return new f(t[S]);
                    if ("ia5str" == S)
                        return new d(t[S]);
                    if ("utctime" == S)
                        return new p(t[S]);
                    if ("gentime" == S)
                        return new g(t[S]);
                    if ("seq" == S) {
                        for (var _ = t[S], w = [], T = 0; T < _.length; T++) {
                            var C = x(_[T]);
                            w.push(C)
                        }
                        return new v({
                            array: w
                        })
                    }
                    if ("set" == S) {
                        for (_ = t[S],
                        w = [],
                        T = 0; T < _.length; T++) {
                            C = x(_[T]);
                            w.push(C)
                        }
                        return new m({
                            array: w
                        })
                    }
                    if ("tag" == S) {
                        var k = t[S];
                        if ("[object Array]" === Object.prototype.toString.call(k) && 3 == k.length) {
                            var O = x(k[2]);
                            return new y({
                                tag: k[0],
                                explicit: k[1],
                                obj: O
                            })
                        }
                        var M = {};
                        if (void 0 !== k.explicit && (M.explicit = k.explicit),
                        void 0 !== k.tag && (M.tag = k.tag),
                        void 0 === k.obj)
                            throw "obj shall be specified for 'tag'.";
                        return M.obj = x(k.obj),
                        new y(M)
                    }
                }
                ,
                this.jsonToASN1HEX = function(t) {
                    return this.newObject(t).getEncodedHex()
                }
            }
            ,
            et.asn1.ASN1Util.oidHexToInt = function(t) {
                for (var e = "", n = parseInt(t.substr(0, 2), 16), i = (e = Math.floor(n / 40) + "." + n % 40,
                ""), r = 2; r < t.length; r += 2) {
                    var o = ("00000000" + parseInt(t.substr(r, 2), 16).toString(2)).slice(-8);
                    if (i += o.substr(1, 7),
                    "0" == o.substr(0, 1))
                        e = e + "." + new E(i,2).toString(10),
                        i = ""
                }
                return e
            }
            ,
            et.asn1.ASN1Util.oidIntToHex = function(t) {
                var e = function(t) {
                    var e = t.toString(16);
                    return 1 == e.length && (e = "0" + e),
                    e
                }
                  , n = function(t) {
                    var n = ""
                      , i = new E(t,10).toString(2)
                      , r = 7 - i.length % 7;
                    7 == r && (r = 0);
                    for (var o = "", a = 0; a < r; a++)
                        o += "0";
                    i = o + i;
                    for (a = 0; a < i.length - 1; a += 7) {
                        var s = i.substr(a, 7);
                        a != i.length - 7 && (s = "1" + s),
                        n += e(parseInt(s, 2))
                    }
                    return n
                };
                if (!t.match(/^[0-9.]+$/))
                    throw "malformed oid string: " + t;
                var i = ""
                  , r = t.split(".")
                  , o = 40 * parseInt(r[0]) + parseInt(r[1]);
                i += e(o),
                r.splice(0, 2);
                for (var a = 0; a < r.length; a++)
                    i += n(r[a]);
                return i
            }
            ,
            et.asn1.ASN1Object = function() {
                this.getLengthHexFromValue = function() {
                    if (void 0 === this.hV || null == this.hV)
                        throw "this.hV is null or undefined.";
                    if (this.hV.length % 2 == 1)
                        throw "value hex must be even length: n=" + "".length + ",v=" + this.hV;
                    var t = this.hV.length / 2
                      , e = t.toString(16);
                    if (e.length % 2 == 1 && (e = "0" + e),
                    t < 128) return e; var n = e.length / 2; if (n > 15)
                        throw "ASN.1 length too long to represent by 8x: n = " + t.toString(16);
                    return (128 + n).toString(16) + e
                }
                ,
                this.getEncodedHex = function() {
                    return (null == this.hTLV || this.isModified) && (this.hV = this.getFreshValueHex(),
                    this.hL = this.getLengthHexFromValue(),
                    this.hTLV = this.hT + this.hL + this.hV,
                    this.isModified = !1),
                    this.hTLV
                }
                ,
                this.getValueHex = function() {
                    return this.getEncodedHex(),
                    this.hV
                }
                ,
                this.getFreshValueHex = function() {
                    return ""
                }
            }
            ,
            et.asn1.DERAbstractString = function(t) {
                et.asn1.DERAbstractString.superclass.constructor.call(this),
                this.getString = function() {
                    return this.s
                }
                ,
                this.setString = function(t) {
                    this.hTLV = null,
                    this.isModified = !0,
                    this.s = t,
                    this.hV = stohex(this.s)
                }
                ,
                this.setStringHex = function(t) {
                    this.hTLV = null,
                    this.isModified = !0,
                    this.s = null,
                    this.hV = t
                }
                ,
                this.getFreshValueHex = function() {
                    return this.hV
                }
                ,
                void 0 !== t && ("string" == typeof t ? this.setString(t) : void 0 !== t.str ? this.setString(t.str) : void 0 !== t.hex && this.setStringHex(t.hex))
            }
            ,
            tt.lang.extend(et.asn1.DERAbstractString, et.asn1.ASN1Object),
            et.asn1.DERAbstractTime = function(t) {
                et.asn1.DERAbstractTime.superclass.constructor.call(this),
                this.localDateToUTC = function(t) {
                    return utc = t.getTime() + 6e4 * t.getTimezoneOffset(),
                    new Date(utc)
                }
                ,
                this.formatDate = function(t, e, n) {
                    var i = this.zeroPadding
                      , r = this.localDateToUTC(t)
                      , o = String(r.getFullYear());
                    "utc" == e && (o = o.substr(2, 2));
                    var a = o + i(String(r.getMonth() + 1), 2) + i(String(r.getDate()), 2) + i(String(r.getHours()), 2) + i(String(r.getMinutes()), 2) + i(String(r.getSeconds()), 2);
                    if (!0 === n) {
                        var s = r.getMilliseconds();
                        if (0 != s) {
                            var u = i(String(s), 3);
                            a = a + "." + (u = u.replace(/[0]+$/, ""))
                        }
                    }
                    return a + "Z"
                }
                ,
                this.zeroPadding = function(t, e) {
                    return t.length >= e ? t : new Array(e - t.length + 1).join("0") + t
                }
                ,
                this.getString = function() {
                    return this.s
                }
                ,
                this.setString = function(t) {
                    this.hTLV = null,
                    this.isModified = !0,
                    this.s = t,
                    this.hV = stohex(t)
                }
                ,
                this.setByDateValue = function(t, e, n, i, r, o) {
                    var a = new Date(Date.UTC(t, e - 1, n, i, r, o, 0));
                    this.setByDate(a)
                }
                ,
                this.getFreshValueHex = function() {
                    return this.hV
                }
            }
            ,
            tt.lang.extend(et.asn1.DERAbstractTime, et.asn1.ASN1Object),
            et.asn1.DERAbstractStructured = function(t) {
                et.asn1.DERAbstractString.superclass.constructor.call(this),
                this.setByASN1ObjectArray = function(t) {
                    this.hTLV = null,
                    this.isModified = !0,
                    this.asn1Array = t
                }
                ,
                this.appendASN1Object = function(t) {
                    this.hTLV = null,
                    this.isModified = !0,
                    this.asn1Array.push(t)
                }
                ,
                this.asn1Array = new Array,
                void 0 !== t && void 0 !== t.array && (this.asn1Array = t.array)
            }
            ,
            tt.lang.extend(et.asn1.DERAbstractStructured, et.asn1.ASN1Object),
            et.asn1.DERBoolean = function() {
                et.asn1.DERBoolean.superclass.constructor.call(this),
                this.hT = "01",
                this.hTLV = "0101ff"
            }
            ,
            tt.lang.extend(et.asn1.DERBoolean, et.asn1.ASN1Object),
            et.asn1.DERInteger = function(t) {
                et.asn1.DERInteger.superclass.constructor.call(this),
                this.hT = "02",
                this.setByBigInteger = function(t) {
                    this.hTLV = null,
                    this.isModified = !0,
                    this.hV = et.asn1.ASN1Util.bigIntToMinTwosComplementsHex(t)
                }
                ,
                this.setByInteger = function(t) {
                    var e = new E(String(t),10);
                    this.setByBigInteger(e)
                }
                ,
                this.setValueHex = function(t) {
                    this.hV = t
                }
                ,
                this.getFreshValueHex = function() {
                    return this.hV
                }
                ,
                void 0 !== t && (void 0 !== t.bigint ? this.setByBigInteger(t.bigint) : void 0 !== t.int ? this.setByInteger(t.int) : "number" == typeof t ? this.setByInteger(t) : void 0 !== t.hex && this.setValueHex(t.hex))
            }
            ,
            tt.lang.extend(et.asn1.DERInteger, et.asn1.ASN1Object),
            et.asn1.DERBitString = function(t) {
                if (void 0 !== t && void 0 !== t.obj) {
                    var e = et.asn1.ASN1Util.newObject(t.obj);
                    t.hex = "00" + e.getEncodedHex()
                }
                et.asn1.DERBitString.superclass.constructor.call(this),
                this.hT = "03",
                this.setHexValueIncludingUnusedBits = function(t) {
                    this.hTLV = null,
                    this.isModified = !0,
                    this.hV = t
                }
                ,
                this.setUnusedBitsAndHexValue = function(t, e) {
                    if (t < 0 || 7 < t)
                        throw "unused bits shall be from 0 to 7: u = " + t;
                    var n = "0" + t;
                    this.hTLV = null,
                    this.isModified = !0,
                    this.hV = n + e
                }
                ,
                this.setByBinaryString = function(t) {
                    var e = 8 - (t = t.replace(/0+$/, "")).length % 8;
                    8 == e && (e = 0);
                    for (var n = 0; n <= e; n++)
                        t += "0";
                    var i = "";
                    for (n = 0; n < t.length - 1; n += 8) {
                        var r = t.substr(n, 8)
                          , o = parseInt(r, 2).toString(16);
                        1 == o.length && (o = "0" + o),
                        i += o
                    }
                    this.hTLV = null,
                    this.isModified = !0,
                    this.hV = "0" + e + i
                }
                ,
                this.setByBooleanArray = function(t) {
                    for (var e = "", n = 0; n < t.length; n++)
                        1 == t[n] ? e += "1" : e += "0";
                    this.setByBinaryString(e)
                }
                ,
                this.newFalseArray = function(t) {
                    for (var e = new Array(t), n = 0; n < t; n++)
                        e[n] = !1;
                    return e
                }
                ,
                this.getFreshValueHex = function() {
                    return this.hV
                }
                ,
                void 0 !== t && ("string" == typeof t && t.toLowerCase().match(/^[0-9a-f]+$/) ? this.setHexValueIncludingUnusedBits(t) : void 0 !== t.hex ? this.setHexValueIncludingUnusedBits(t.hex) : void 0 !== t.bin ? this.setByBinaryString(t.bin) : void 0 !== t.array && this.setByBooleanArray(t.array))
            }
            ,
            tt.lang.extend(et.asn1.DERBitString, et.asn1.ASN1Object),
            et.asn1.DEROctetString = function(t) {
                if (void 0 !== t && void 0 !== t.obj) {
                    var e = et.asn1.ASN1Util.newObject(t.obj);
                    t.hex = e.getEncodedHex()
                }
                et.asn1.DEROctetString.superclass.constructor.call(this, t),
                this.hT = "04"
            }
            ,
            tt.lang.extend(et.asn1.DEROctetString, et.asn1.DERAbstractString),
            et.asn1.DERNull = function() {
                et.asn1.DERNull.superclass.constructor.call(this),
                this.hT = "05",
                this.hTLV = "0500"
            }
            ,
            tt.lang.extend(et.asn1.DERNull, et.asn1.ASN1Object),
            et.asn1.DERObjectIdentifier = function(t) {
                var e = function(t) {
                    var e = t.toString(16);
                    return 1 == e.length && (e = "0" + e),
                    e
                }
                  , n = function(t) {
                    var n = ""
                      , i = new E(t,10).toString(2)
                      , r = 7 - i.length % 7;
                    7 == r && (r = 0);
                    for (var o = "", a = 0; a < r; a++)
                        o += "0";
                    i = o + i;
                    for (a = 0; a < i.length - 1; a += 7) {
                        var s = i.substr(a, 7);
                        a != i.length - 7 && (s = "1" + s),
                        n += e(parseInt(s, 2))
                    }
                    return n
                };
                et.asn1.DERObjectIdentifier.superclass.constructor.call(this),
                this.hT = "06",
                this.setValueHex = function(t) {
                    this.hTLV = null,
                    this.isModified = !0,
                    this.s = null,
                    this.hV = t
                }
                ,
                this.setValueOidString = function(t) {
                    if (!t.match(/^[0-9.]+$/))
                        throw "malformed oid string: " + t;
                    var i = ""
                      , r = t.split(".")
                      , o = 40 * parseInt(r[0]) + parseInt(r[1]);
                    i += e(o),
                    r.splice(0, 2);
                    for (var a = 0; a < r.length; a++)
                        i += n(r[a]);
                    this.hTLV = null,
                    this.isModified = !0,
                    this.s = null,
                    this.hV = i
                }
                ,
                this.setValueName = function(t) {
                    var e = et.asn1.x509.OID.name2oid(t);
                    if ("" === e)
                        throw "DERObjectIdentifier oidName undefined: " + t;
                    this.setValueOidString(e)
                }
                ,
                this.getFreshValueHex = function() {
                    return this.hV
                }
                ,
                void 0 !== t && ("string" == typeof t ? t.match(/^[0-2].[0-9.]+$/) ? this.setValueOidString(t) : this.setValueName(t) : void 0 !== t.oid ? this.setValueOidString(t.oid) : void 0 !== t.hex ? this.setValueHex(t.hex) : void 0 !== t.name && this.setValueName(t.name))
            }
            ,
            tt.lang.extend(et.asn1.DERObjectIdentifier, et.asn1.ASN1Object),
            et.asn1.DEREnumerated = function(t) {
                et.asn1.DEREnumerated.superclass.constructor.call(this),
                this.hT = "0a",
                this.setByBigInteger = function(t) {
                    this.hTLV = null,
                    this.isModified = !0,
                    this.hV = et.asn1.ASN1Util.bigIntToMinTwosComplementsHex(t)
                }
                ,
                this.setByInteger = function(t) {
                    var e = new E(String(t),10);
                    this.setByBigInteger(e)
                }
                ,
                this.setValueHex = function(t) {
                    this.hV = t
                }
                ,
                this.getFreshValueHex = function() {
                    return this.hV
                }
                ,
                void 0 !== t && (void 0 !== t.int ? this.setByInteger(t.int) : "number" == typeof t ? this.setByInteger(t) : void 0 !== t.hex && this.setValueHex(t.hex))
            }
            ,
            tt.lang.extend(et.asn1.DEREnumerated, et.asn1.ASN1Object),
            et.asn1.DERUTF8String = function(t) {
                et.asn1.DERUTF8String.superclass.constructor.call(this, t),
                this.hT = "0c"
            }
            ,
            tt.lang.extend(et.asn1.DERUTF8String, et.asn1.DERAbstractString),
            et.asn1.DERNumericString = function(t) {
                et.asn1.DERNumericString.superclass.constructor.call(this, t),
                this.hT = "12"
            }
            ,
            tt.lang.extend(et.asn1.DERNumericString, et.asn1.DERAbstractString),
            et.asn1.DERPrintableString = function(t) {
                et.asn1.DERPrintableString.superclass.constructor.call(this, t),
                this.hT = "13"
            }
            ,
            tt.lang.extend(et.asn1.DERPrintableString, et.asn1.DERAbstractString),
            et.asn1.DERTeletexString = function(t) {
                et.asn1.DERTeletexString.superclass.constructor.call(this, t),
                this.hT = "14"
            }
            ,
            tt.lang.extend(et.asn1.DERTeletexString, et.asn1.DERAbstractString),
            et.asn1.DERIA5String = function(t) {
                et.asn1.DERIA5String.superclass.constructor.call(this, t),
                this.hT = "16"
            }
            ,
            tt.lang.extend(et.asn1.DERIA5String, et.asn1.DERAbstractString),
            et.asn1.DERUTCTime = function(t) {
                et.asn1.DERUTCTime.superclass.constructor.call(this, t),
                this.hT = "17",
                this.setByDate = function(t) {
                    this.hTLV = null,
                    this.isModified = !0,
                    this.date = t,
                    this.s = this.formatDate(this.date, "utc"),
                    this.hV = stohex(this.s)
                }
                ,
                this.getFreshValueHex = function() {
                    return void 0 === this.date && void 0 === this.s && (this.date = new Date,
                    this.s = this.formatDate(this.date, "utc"),
                    this.hV = stohex(this.s)),
                    this.hV
                }
                ,
                void 0 !== t && (void 0 !== t.str ? this.setString(t.str) : "string" == typeof t && t.match(/^[0-9]{12}Z$/) ? this.setString(t) : void 0 !== t.hex ? this.setStringHex(t.hex) : void 0 !== t.date && this.setByDate(t.date))
            }
            ,
            tt.lang.extend(et.asn1.DERUTCTime, et.asn1.DERAbstractTime),
            et.asn1.DERGeneralizedTime = function(t) {
                et.asn1.DERGeneralizedTime.superclass.constructor.call(this, t),
                this.hT = "18",
                this.withMillis = !1,
                this.setByDate = function(t) {
                    this.hTLV = null,
                    this.isModified = !0,
                    this.date = t,
                    this.s = this.formatDate(this.date, "gen", this.withMillis),
                    this.hV = stohex(this.s)
                }
                ,
                this.getFreshValueHex = function() {
                    return void 0 === this.date && void 0 === this.s && (this.date = new Date,
                    this.s = this.formatDate(this.date, "gen", this.withMillis),
                    this.hV = stohex(this.s)),
                    this.hV
                }
                ,
                void 0 !== t && (void 0 !== t.str ? this.setString(t.str) : "string" == typeof t && t.match(/^[0-9]{14}Z$/) ? this.setString(t) : void 0 !== t.hex ? this.setStringHex(t.hex) : void 0 !== t.date && this.setByDate(t.date),
                !0 === t.millis && (this.withMillis = !0))
            }
            ,
            tt.lang.extend(et.asn1.DERGeneralizedTime, et.asn1.DERAbstractTime),
            et.asn1.DERSequence = function(t) {
                et.asn1.DERSequence.superclass.constructor.call(this, t),
                this.hT = "30",
                this.getFreshValueHex = function() {
                    for (var t = "", e = 0; e < this.asn1Array.length; e++) {
                        t += this.asn1Array[e].getEncodedHex()
                    }
                    return this.hV = t,
                    this.hV
                }
            }
            ,
            tt.lang.extend(et.asn1.DERSequence, et.asn1.DERAbstractStructured),
            et.asn1.DERSet = function(t) {
                et.asn1.DERSet.superclass.constructor.call(this, t),
                this.hT = "31",
                this.sortFlag = !0,
                this.getFreshValueHex = function() {
                    for (var t = new Array, e = 0; e < this.asn1Array.length; e++) {
                        var n = this.asn1Array[e];
                        t.push(n.getEncodedHex())
                    }
                    return 1 == this.sortFlag && t.sort(),
                    this.hV = t.join(""),
                    this.hV
                }
                ,
                void 0 !== t && void 0 !== t.sortflag && 0 == t.sortflag && (this.sortFlag = !1)
            }
            ,
            tt.lang.extend(et.asn1.DERSet, et.asn1.DERAbstractStructured),
            et.asn1.DERTaggedObject = function(t) {
                et.asn1.DERTaggedObject.superclass.constructor.call(this),
                this.hT = "a0",
                this.hV = "",
                this.isExplicit = !0,
                this.asn1Object = null,
                this.setASN1Object = function(t, e, n) {
                    this.hT = e,
                    this.isExplicit = t,
                    this.asn1Object = n,
                    this.isExplicit ? (this.hV = this.asn1Object.getEncodedHex(),
                    this.hTLV = null,
                    this.isModified = !0) : (this.hV = null,
                    this.hTLV = n.getEncodedHex(),
                    this.hTLV = this.hTLV.replace(/^../, e),
                    this.isModified = !1)
                }
                ,
                this.getFreshValueHex = function() {
                    return this.hV
                }
                ,
                void 0 !== t && (void 0 !== t.tag && (this.hT = t.tag),
                void 0 !== t.explicit && (this.isExplicit = t.explicit),
                void 0 !== t.obj && (this.asn1Object = t.obj,
                this.setASN1Object(this.isExplicit, this.hT, this.asn1Object)))
            }
            ,
            tt.lang.extend(et.asn1.DERTaggedObject, et.asn1.ASN1Object);
            var nt = function(t) {
                function e(n) {
                    var i = t.call(this) || this;
                    return n && ("string" == typeof n ? i.parseKey(n) : (e.hasPrivateKeyProperty(n) || e.hasPublicKeyProperty(n)) && i.parsePropertiesFrom(n)),
                    i
                }
                return function(t, e) {
                    function n() {
                        this.constructor = t
                    }
                    p(t, e),
                    t.prototype = null === e ? Object.create(e) : (n.prototype = e.prototype,
                    new n)
                }(e, t),
                e.prototype.parseKey = function(t) {
                    try {
                        var e = 0
                          , n = 0
                          , i = /^\s*(?:[0-9A-Fa-f][0-9A-Fa-f]\s*)+$/.test(t) ? v(t) : m.unarmor(t)
                          , r = C.decode(i);
                        if (3 === r.sub.length && (r = r.sub[2].sub[0]),
                        9 === r.sub.length) {
                            e = r.sub[1].getHexStringValue(),
                            this.n = N(e, 16),
                            n = r.sub[2].getHexStringValue(),
                            this.e = parseInt(n, 16);
                            var o = r.sub[3].getHexStringValue();
                            this.d = N(o, 16);
                            var a = r.sub[4].getHexStringValue();
                            this.p = N(a, 16);
                            var s = r.sub[5].getHexStringValue();
                            this.q = N(s, 16);
                            var u = r.sub[6].getHexStringValue();
                            this.dmp1 = N(u, 16);
                            var c = r.sub[7].getHexStringValue();
                            this.dmq1 = N(c, 16);
                            var l = r.sub[8].getHexStringValue();
                            this.coeff = N(l, 16)
                        } else {
                            if (2 !== r.sub.length)
                                return !1;
                            var h = r.sub[1].sub[0];
                            e = h.sub[0].getHexStringValue(),
                            this.n = N(e, 16),
                            n = h.sub[1].getHexStringValue(),
                            this.e = parseInt(n, 16)
                        }
                        return !0
                    } catch (t) {
                        return !1
                    }
                }
                ,
                e.prototype.getPrivateBaseKey = function() {
                    var t = {
                        array: [new et.asn1.DERInteger({
                            int: 0
                        }), new et.asn1.DERInteger({
                            bigint: this.n
                        }), new et.asn1.DERInteger({
                            int: this.e
                        }), new et.asn1.DERInteger({
                            bigint: this.d
                        }), new et.asn1.DERInteger({
                            bigint: this.p
                        }), new et.asn1.DERInteger({
                            bigint: this.q
                        }), new et.asn1.DERInteger({
                            bigint: this.dmp1
                        }), new et.asn1.DERInteger({
                            bigint: this.dmq1
                        }), new et.asn1.DERInteger({
                            bigint: this.coeff
                        })]
                    };
                    return new et.asn1.DERSequence(t).getEncodedHex()
                }
                ,
                e.prototype.getPrivateBaseKeyB64 = function() {
                    return h(this.getPrivateBaseKey())
                }
                ,
                e.prototype.getPublicBaseKey = function() {
                    var t = new et.asn1.DERSequence({
                        array: [new et.asn1.DERObjectIdentifier({
                            oid: "1.2.840.113549.1.1.1"
                        }), new et.asn1.DERNull]
                    })
                      , e = new et.asn1.DERSequence({
                        array: [new et.asn1.DERInteger({
                            bigint: this.n
                        }), new et.asn1.DERInteger({
                            int: this.e
                        })]
                    })
                      , n = new et.asn1.DERBitString({
                        hex: "00" + e.getEncodedHex()
                    });
                    return new et.asn1.DERSequence({
                        array: [t, n]
                    }).getEncodedHex()
                }
                ,
                e.prototype.getPublicBaseKeyB64 = function() {
                    return h(this.getPublicBaseKey())
                }
                ,
                e.wordwrap = function(t, e) {
                    if (e = e || 64,
                    !t)
                        return t;
                    var n = "(.{1," + e + "})( +|$\n?)|(.{1," + e + "})";
                    return t.match(RegExp(n, "g")).join("\n")
                }
                ,
                e.prototype.getPrivateKey = function() {
                    var t = "-----BEGIN RSA PRIVATE KEY-----\n";
                    return t += e.wordwrap(this.getPrivateBaseKeyB64()) + "\n",
                    t += "-----END RSA PRIVATE KEY-----"
                }
                ,
                e.prototype.getPublicKey = function() {
                    var t = "-----BEGIN PUBLIC KEY-----\n";
                    return t += e.wordwrap(this.getPublicBaseKeyB64()) + "\n",
                    t += "-----END PUBLIC KEY-----"
                }
                ,
                e.hasPublicKeyProperty = function(t) {
                    return (t = t || {}).hasOwnProperty("n") && t.hasOwnProperty("e")
                }
                ,
                e.hasPrivateKeyProperty = function(t) {
                    return (t = t || {}).hasOwnProperty("n") && t.hasOwnProperty("e") && t.hasOwnProperty("d") && t.hasOwnProperty("p") && t.hasOwnProperty("q") && t.hasOwnProperty("dmp1") && t.hasOwnProperty("dmq1") && t.hasOwnProperty("coeff")
                }
                ,
                e.prototype.parsePropertiesFrom = function(t) {
                    this.n = t.n,
                    this.e = t.e,
                    t.hasOwnProperty("d") && (this.d = t.d,
                    this.p = t.p,
                    this.q = t.q,
                    this.dmp1 = t.dmp1,
                    this.dmq1 = t.dmq1,
                    this.coeff = t.coeff)
                }
                ,
                e
            }(Q)
              , it = function() {
                function t(t) {
                    t = t || {},
                    window.default_key_size =  1024,
                    window.default_public_exponent = t.default_public_exponent || "010001",
                    window.log = t.log || !1,
                    window.key = null
                }
                return t.prototype.setKey = function(t) {
                    this.log && this.key && console.warn("A key was already set, overriding existing."),
                    this.key = new nt(t)
                }
                ,
                t.prototype.setPrivateKey = function(t) {
                    this.setKey(t)
                }
                ,
                t.prototype.setPublicKey = function(t) {
                    this.setKey(t)
                }
                ,
                t.prototype.decrypt = function(t) {
                    try {
                        return this.getKey().decrypt(f(t))
                    } catch (t) {
                        return !1
                    }
                }
                ,
                t.prototype.encrypt = function(t) {
                    try {
                        return h(this.getKey().encrypt(t))
                    } catch (t) {
                        return !1
                    }
                }
                ,
                t.prototype.sign = function(t, e, n) {
                    try {
                        return h(this.getKey().sign(t, e, n))
                    } catch (t) {
                        return !1
                    }
                }
                ,
                t.prototype.verify = function(t, e, n) {
                    try {
                        return this.getKey().verify(t, f(e), n)
                    } catch (t) {
                        return !1
                    }
                }
                ,
                t.prototype.getKey = function(t) {
                    if (!this.key) {
                        if (this.key = new nt,
                        t && "[object Function]" === {}.toString.call(t))
                            return void this.key.generateAsync(this.default_key_size, this.default_public_exponent, t);
                        this.key.generate(this.default_key_size, this.default_public_exponent)
                    }
                    return this.key
                }
                ,
                t.prototype.getPrivateKey = function() {
                    return this.getKey().getPrivateKey()
                }
                ,
                t.prototype.getPrivateKeyB64 = function() {
                    return this.getKey().getPrivateBaseKeyB64()
                }
                ,
                t.prototype.getPublicKey = function() {
                    return this.getKey().getPublicKey()
                }
                ,
                t.prototype.getPublicKeyB64 = function() {
                    return this.getKey().getPublicBaseKeyB64()
                }
                ,
                t.version = "3.0.0-rc.1",
                t
            }();
            window.JSEncrypt = it,
            t.JSEncrypt = it;
        }
        )(e)
    


function JssEncrypt(t) {
var e='-----BEGIN PUBLIC KEY-----\nMIGfMA0GCSqGSIb3DQEBAQUAA4GNADCBiQKBgQC7RbOvlgnlY8YB3TB+/GGHO4ID\nFD6t2+Bchioa0VbtiqplDyNrOMg5pBYk6PjhVtD/uKvEFwNu7tStjtyzMh8qDjZ8\nllF9NWoLnqYsGS5rdKVDN9s1MP4hWTm2ogQxkqrMdcLMU8ZgBtYBvVU2nu8gDs/Y\nhBaGmJ9LWk6aqCbPmwIDAQAB\n-----END PUBLIC KEY-----\n';
            var n = new window.JSEncrypt;
            return n.setPublicKey(e),
            n.encrypt(t)
        }
		
		function JssDecrypt(t) {
var e='-----BEGIN PUBLIC KEY-----\nMIGfMA0GCSqGSIb3DQEBAQUAA4GNADCBiQKBgQC7RbOvlgnlY8YB3TB+/GGHO4ID\nFD6t2+Bchioa0VbtiqplDyNrOMg5pBYk6PjhVtD/uKvEFwNu7tStjtyzMh8qDjZ8\nllF9NWoLnqYsGS5rdKVDN9s1MP4hWTm2ogQxkqrMdcLMU8ZgBtYBvVU2nu8gDs/Y\nhBaGmJ9LWk6aqCbPmwIDAQAB\n-----END PUBLIC KEY-----\n';
            var n = new window.JSEncrypt;
            return n.setPublicKey(e),
            n.decrypt(t)
        }

不是我的软件,不是我的软件,不是我的软件,广告不要轻易相信,,

本来想写这个软件,既然有人发了,我也懒得写了

转载:https://www.kxdao.net/thread-566521-1-1.html

未经允许不得转载:晗雅|星空 » 大学生在线四史答题软件(v3.6)
分享到:

请选择你看完该文章的感受:

1瞧一瞧 0扯淡 1学到了 0不懂 1正能量 0无聊

评论9

  • 昵称 (必填)
  • 邮箱 (必填)
  • 网址 (选填)
  1. #5
    今天的不对啦
    阿敬2021-02-05 11:36:26回复
  2. #4
    貌似不能用了,积分半天不涨
    请问2021-02-05 15:50:15回复
  3. #3
    求求作者来个新版本
    zhixu2021-02-07 12:55:29回复
  4. #2
    java写的
    奥利给2021-02-09 1:16:51回复
    • 软件是易语言写的,作者发的代码是js加密算法,这个易语言软件不是作者写的
      古德2021-02-09 10:28:44回复
  5. #1
    用易语言也打不开啊
    sasa2021-02-09 15:08:37回复