orion-design 0.1.48 → 0.1.50

package/dist/index-BW3nOBfD.js

@@ -0,0 +1,714 @@
+import { c as Hi } from "./_commonjsHelpers-DaMA6jEr.js";
+var Y = { exports: {} };
+(function($, Ji) {
+  (function() {
+    var D, x = 244837814094590, Z = (x & 16777215) == 15715070;
+    function s(t, i, e) {
+      t != null && (typeof t == "number" ? this.fromNumber(t, i, e) : i == null && typeof t != "string" ? this.fromString(t, 256) : this.fromString(t, i));
+    }
+    function u() {
+      return new s(null);
+    }
+    function tt(t, i, e, o, r, n) {
+      for (; --n >= 0; ) {
+        var h = i * this[t++] + e[o] + r;
+        r = Math.floor(h / 67108864), e[o++] = h & 67108863;
+      }
+      return r;
+    }
+    function it(t, i, e, o, r, n) {
+      for (var h = i & 32767, f = i >> 15; --n >= 0; ) {
+        var p = this[t] & 32767, l = this[t++] >> 15, y = f * p + l * h;
+        p = h * p + ((y & 32767) << 15) + e[o] + (r & 1073741823), r = (p >>> 30) + (y >>> 15) + f * l + (r >>> 30), e[o++] = p & 1073741823;
+      }
+      return r;
+    }
+    function et(t, i, e, o, r, n) {
+      for (var h = i & 16383, f = i >> 14; --n >= 0; ) {
+        var p = this[t] & 16383, l = this[t++] >> 14, y = f * p + l * h;
+        p = h * p + ((y & 16383) << 14) + e[o] + r, r = (p >> 28) + (y >> 14) + f * l, e[o++] = p & 268435455;
+      }
+      return r;
+    }
+    var j = typeof navigator < "u";
+    j && Z && navigator.appName == "Microsoft Internet Explorer" ? (s.prototype.am = it, D = 30) : j && Z && navigator.appName != "Netscape" ? (s.prototype.am = tt, D = 26) : (s.prototype.am = et, D = 28), s.prototype.DB = D, s.prototype.DM = (1 << D) - 1, s.prototype.DV = 1 << D;
+    var q = 52;
+    s.prototype.FV = Math.pow(2, q), s.prototype.F1 = q - D, s.prototype.F2 = 2 * D - q;
+    var ot = "0123456789abcdefghijklmnopqrstuvwxyz", N = new Array(), A, T;
+    for (A = 48, T = 0; T <= 9; ++T) N[A++] = T;
+    for (A = 97, T = 10; T < 36; ++T) N[A++] = T;
+    for (A = 65, T = 10; T < 36; ++T) N[A++] = T;
+    function z(t) {
+      return ot.charAt(t);
+    }
+    function U(t, i) {
+      var e = N[t.charCodeAt(i)];
+      return e ?? -1;
+    }
+    function rt(t) {
+      for (var i = this.t - 1; i >= 0; --i) t[i] = this[i];
+      t.t = this.t, t.s = this.s;
+    }
+    function st(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;
+    }
+    function S(t) {
+      var i = u();
+      return i.fromInt(t), i;
+    }
+    function nt(t, i) {
+      var e;
+      if (i == 16) e = 4;
+      else if (i == 8) e = 3;
+      else if (i == 256) e = 8;
+      else if (i == 2) e = 1;
+      else if (i == 32) e = 5;
+      else if (i == 4) e = 2;
+      else {
+        this.fromRadix(t, i);
+        return;
+      }
+      this.t = 0, this.s = 0;
+      for (var o = t.length, r = !1, n = 0; --o >= 0; ) {
+        var h = e == 8 ? t[o] & 255 : U(t, o);
+        if (h < 0) {
+          t.charAt(o) == "-" && (r = !0);
+          continue;
+        }
+        r = !1, n == 0 ? this[this.t++] = h : n + e > this.DB ? (this[this.t - 1] |= (h & (1 << this.DB - n) - 1) << n, this[this.t++] = h >> this.DB - n) : this[this.t - 1] |= h << n, n += e, n >= this.DB && (n -= this.DB);
+      }
+      e == 8 && t[0] & 128 && (this.s = -1, n > 0 && (this[this.t - 1] |= (1 << this.DB - n) - 1 << n)), this.clamp(), r && s.ZERO.subTo(this, this);
+    }
+    function ht() {
+      for (var t = this.s & this.DM; this.t > 0 && this[this.t - 1] == t; ) --this.t;
+    }
+    function ft(t) {
+      if (this.s < 0) return "-" + this.negate().toString(t);
+      var i;
+      if (t == 16) i = 4;
+      else if (t == 8) i = 3;
+      else if (t == 2) i = 1;
+      else if (t == 32) i = 5;
+      else if (t == 4) i = 2;
+      else return this.toRadix(t);
+      var e = (1 << i) - 1, o, r = !1, n = "", h = this.t, f = this.DB - h * this.DB % i;
+      if (h-- > 0)
+        for (f < this.DB && (o = this[h] >> f) > 0 && (r = !0, n = z(o)); h >= 0; )
+          f < i ? (o = (this[h] & (1 << f) - 1) << i - f, o |= this[--h] >> (f += this.DB - i)) : (o = this[h] >> (f -= i) & e, f <= 0 && (f += this.DB, --h)), o > 0 && (r = !0), r && (n += z(o));
+      return r ? n : "0";
+    }
+    function ut() {
+      var t = u();
+      return s.ZERO.subTo(this, t), t;
+    }
+    function pt() {
+      return this.s < 0 ? this.negate() : this;
+    }
+    function at(t) {
+      var i = this.s - t.s;
+      if (i != 0) return i;
+      var e = this.t;
+      if (i = e - t.t, i != 0) return this.s < 0 ? -i : i;
+      for (; --e >= 0; ) if ((i = this[e] - t[e]) != 0) return i;
+      return 0;
+    }
+    function V(t) {
+      var i = 1, e;
+      return (e = t >>> 16) != 0 && (t = e, i += 16), (e = t >> 8) != 0 && (t = e, i += 8), (e = t >> 4) != 0 && (t = e, i += 4), (e = t >> 2) != 0 && (t = e, i += 2), (e = t >> 1) != 0 && (t = e, i += 1), i;
+    }
+    function lt() {
+      return this.t <= 0 ? 0 : this.DB * (this.t - 1) + V(this[this.t - 1] ^ this.s & this.DM);
+    }
+    function ct(t, i) {
+      var e;
+      for (e = this.t - 1; e >= 0; --e) i[e + t] = this[e];
+      for (e = t - 1; e >= 0; --e) i[e] = 0;
+      i.t = this.t + t, i.s = this.s;
+    }
+    function vt(t, i) {
+      for (var e = t; e < this.t; ++e) i[e - t] = this[e];
+      i.t = Math.max(this.t - t, 0), i.s = this.s;
+    }
+    function mt(t, i) {
+      var e = t % this.DB, o = this.DB - e, r = (1 << o) - 1, n = Math.floor(t / this.DB), h = this.s << e & this.DM, f;
+      for (f = this.t - 1; f >= 0; --f)
+        i[f + n + 1] = this[f] >> o | h, h = (this[f] & r) << e;
+      for (f = n - 1; f >= 0; --f) i[f] = 0;
+      i[n] = h, i.t = this.t + n + 1, i.s = this.s, i.clamp();
+    }
+    function Tt(t, i) {
+      i.s = this.s;
+      var e = Math.floor(t / this.DB);
+      if (e >= this.t) {
+        i.t = 0;
+        return;
+      }
+      var o = t % this.DB, r = this.DB - o, n = (1 << o) - 1;
+      i[0] = this[e] >> o;
+      for (var h = e + 1; h < this.t; ++h)
+        i[h - e - 1] |= (this[h] & n) << r, i[h - e] = this[h] >> o;
+      o > 0 && (i[this.t - e - 1] |= (this.s & n) << r), i.t = this.t - e, i.clamp();
+    }
+    function yt(t, i) {
+      for (var e = 0, o = 0, r = Math.min(t.t, this.t); e < r; )
+        o += this[e] - t[e], i[e++] = o & this.DM, o >>= this.DB;
+      if (t.t < this.t) {
+        for (o -= t.s; e < this.t; )
+          o += this[e], i[e++] = o & this.DM, o >>= this.DB;
+        o += this.s;
+      } else {
+        for (o += this.s; e < t.t; )
+          o -= t[e], i[e++] = o & this.DM, o >>= this.DB;
+        o -= t.s;
+      }
+      i.s = o < 0 ? -1 : 0, o < -1 ? i[e++] = this.DV + o : o > 0 && (i[e++] = o), i.t = e, i.clamp();
+    }
+    function dt(t, i) {
+      var e = this.abs(), o = t.abs(), r = e.t;
+      for (i.t = r + o.t; --r >= 0; ) i[r] = 0;
+      for (r = 0; r < o.t; ++r) i[r + e.t] = e.am(0, o[r], i, r, 0, e.t);
+      i.s = 0, i.clamp(), this.s != t.s && s.ZERO.subTo(i, i);
+    }
+    function bt(t) {
+      for (var i = this.abs(), e = t.t = 2 * i.t; --e >= 0; ) t[e] = 0;
+      for (e = 0; e < i.t - 1; ++e) {
+        var o = i.am(e, i[e], t, 2 * e, 0, 1);
+        (t[e + i.t] += i.am(e + 1, 2 * i[e], t, 2 * e + 1, o, i.t - e - 1)) >= i.DV && (t[e + i.t] -= i.DV, t[e + i.t + 1] = 1);
+      }
+      t.t > 0 && (t[t.t - 1] += i.am(e, i[e], t, 2 * e, 0, 1)), t.s = 0, t.clamp();
+    }
+    function wt(t, i, e) {
+      var o = t.abs();
+      if (!(o.t <= 0)) {
+        var r = this.abs();
+        if (r.t < o.t) {
+          i != null && i.fromInt(0), e != null && this.copyTo(e);
+          return;
+        }
+        e == null && (e = u());
+        var n = u(), h = this.s, f = t.s, p = this.DB - V(o[o.t - 1]);
+        p > 0 ? (o.lShiftTo(p, n), r.lShiftTo(p, e)) : (o.copyTo(n), r.copyTo(e));
+        var l = n.t, y = n[l - 1];
+        if (y != 0) {
+          var m = y * (1 << this.F1) + (l > 1 ? n[l - 2] >> this.F2 : 0), g = this.FV / m, C = (1 << this.F1) / m, b = 1 << this.F2, w = e.t, L = w - l, B = i ?? u();
+          for (n.dlShiftTo(L, B), e.compareTo(B) >= 0 && (e[e.t++] = 1, e.subTo(B, e)), s.ONE.dlShiftTo(l, B), B.subTo(n, n); n.t < l; ) n[n.t++] = 0;
+          for (; --L >= 0; ) {
+            var k = e[--w] == y ? this.DM : Math.floor(e[w] * g + (e[w - 1] + b) * C);
+            if ((e[w] += n.am(0, k, e, L, 0, l)) < k)
+              for (n.dlShiftTo(L, B), e.subTo(B, e); e[w] < --k; ) e.subTo(B, e);
+          }
+          i != null && (e.drShiftTo(l, i), h != f && s.ZERO.subTo(i, i)), e.t = l, e.clamp(), p > 0 && e.rShiftTo(p, e), h < 0 && s.ZERO.subTo(e, e);
+        }
+      }
+    }
+    function gt(t) {
+      var i = u();
+      return this.abs().divRemTo(t, null, i), this.s < 0 && i.compareTo(s.ZERO) > 0 && t.subTo(i, i), i;
+    }
+    function M(t) {
+      this.m = t;
+    }
+    function Dt(t) {
+      return t.s < 0 || t.compareTo(this.m) >= 0 ? t.mod(this.m) : t;
+    }
+    function St(t) {
+      return t;
+    }
+    function Bt(t) {
+      t.divRemTo(this.m, null, t);
+    }
+    function Mt(t, i, e) {
+      t.multiplyTo(i, e), this.reduce(e);
+    }
+    function Rt(t, i) {
+      t.squareTo(i), this.reduce(i);
+    }
+    M.prototype.convert = Dt, M.prototype.revert = St, M.prototype.reduce = Bt, M.prototype.mulTo = Mt, M.prototype.sqrTo = Rt;
+    function Et() {
+      if (this.t < 1) return 0;
+      var t = this[0];
+      if (!(t & 1)) return 0;
+      var i = t & 3;
+      return i = i * (2 - (t & 15) * i) & 15, i = i * (2 - (t & 255) * i) & 255, i = i * (2 - ((t & 65535) * i & 65535)) & 65535, i = i * (2 - t * i % this.DV) % this.DV, i > 0 ? this.DV - i : -i;
+    }
+    function R(t) {
+      this.m = t, this.mp = t.invDigit(), this.mpl = this.mp & 32767, this.mph = this.mp >> 15, this.um = (1 << t.DB - 15) - 1, this.mt2 = 2 * t.t;
+    }
+    function At(t) {
+      var i = u();
+      return t.abs().dlShiftTo(this.m.t, i), i.divRemTo(this.m, null, i), t.s < 0 && i.compareTo(s.ZERO) > 0 && this.m.subTo(i, i), i;
+    }
+    function Ot(t) {
+      var i = u();
+      return t.copyTo(i), this.reduce(i), i;
+    }
+    function Nt(t) {
+      for (; t.t <= this.mt2; )
+        t[t.t++] = 0;
+      for (var i = 0; i < this.m.t; ++i) {
+        var e = t[i] & 32767, o = e * this.mpl + ((e * this.mph + (t[i] >> 15) * this.mpl & this.um) << 15) & t.DM;
+        for (e = i + this.m.t, t[e] += this.m.am(0, o, t, i, 0, this.m.t); t[e] >= t.DV; )
+          t[e] -= t.DV, t[++e]++;
+      }
+      t.clamp(), t.drShiftTo(this.m.t, t), t.compareTo(this.m) >= 0 && t.subTo(this.m, t);
+    }
+    function Vt(t, i) {
+      t.squareTo(i), this.reduce(i);
+    }
+    function It(t, i, e) {
+      t.multiplyTo(i, e), this.reduce(e);
+    }
+    R.prototype.convert = At, R.prototype.revert = Ot, R.prototype.reduce = Nt, R.prototype.mulTo = It, R.prototype.sqrTo = Vt;
+    function Ct() {
+      return (this.t > 0 ? this[0] & 1 : this.s) == 0;
+    }
+    function Lt(t, i) {
+      if (t > 4294967295 || t < 1) return s.ONE;
+      var e = u(), o = u(), r = i.convert(this), n = V(t) - 1;
+      for (r.copyTo(e); --n >= 0; )
+        if (i.sqrTo(e, o), (t & 1 << n) > 0) i.mulTo(o, r, e);
+        else {
+          var h = e;
+          e = o, o = h;
+        }
+      return i.revert(e);
+    }
+    function qt(t, i) {
+      var e;
+      return t < 256 || i.isEven() ? e = new M(i) : e = new R(i), this.exp(t, e);
+    }
+    s.prototype.copyTo = rt, s.prototype.fromInt = st, s.prototype.fromString = nt, s.prototype.clamp = ht, s.prototype.dlShiftTo = ct, s.prototype.drShiftTo = vt, s.prototype.lShiftTo = mt, s.prototype.rShiftTo = Tt, s.prototype.subTo = yt, s.prototype.multiplyTo = dt, s.prototype.squareTo = bt, s.prototype.divRemTo = wt, s.prototype.invDigit = Et, s.prototype.isEven = Ct, s.prototype.exp = Lt, s.prototype.toString = ft, s.prototype.negate = ut, s.prototype.abs = pt, s.prototype.compareTo = at, s.prototype.bitLength = lt, s.prototype.mod = gt, s.prototype.modPowInt = qt, s.ZERO = S(0), s.ONE = S(1);
+    function _t() {
+      var t = u();
+      return this.copyTo(t), t;
+    }
+    function Ft() {
+      if (this.s < 0) {
+        if (this.t == 1) return this[0] - this.DV;
+        if (this.t == 0) return -1;
+      } else {
+        if (this.t == 1) return this[0];
+        if (this.t == 0) return 0;
+      }
+      return (this[1] & (1 << 32 - this.DB) - 1) << this.DB | this[0];
+    }
+    function Pt() {
+      return this.t == 0 ? this.s : this[0] << 24 >> 24;
+    }
+    function kt() {
+      return this.t == 0 ? this.s : this[0] << 16 >> 16;
+    }
+    function Zt(t) {
+      return Math.floor(Math.LN2 * this.DB / Math.log(t));
+    }
+    function jt() {
+      return this.s < 0 ? -1 : this.t <= 0 || this.t == 1 && this[0] <= 0 ? 0 : 1;
+    }
+    function zt(t) {
+      if (t == null && (t = 10), this.signum() == 0 || t < 2 || t > 36) return "0";
+      var i = this.chunkSize(t), e = Math.pow(t, i), o = S(e), r = u(), n = u(), h = "";
+      for (this.divRemTo(o, r, n); r.signum() > 0; )
+        h = (e + n.intValue()).toString(t).substr(1) + h, r.divRemTo(o, r, n);
+      return n.intValue().toString(t) + h;
+    }
+    function Ut(t, i) {
+      this.fromInt(0), i == null && (i = 10);
+      for (var e = this.chunkSize(i), o = Math.pow(i, e), r = !1, n = 0, h = 0, f = 0; f < t.length; ++f) {
+        var p = U(t, f);
+        if (p < 0) {
+          t.charAt(f) == "-" && this.signum() == 0 && (r = !0);
+          continue;
+        }
+        h = i * h + p, ++n >= e && (this.dMultiply(o), this.dAddOffset(h, 0), n = 0, h = 0);
+      }
+      n > 0 && (this.dMultiply(Math.pow(i, n)), this.dAddOffset(h, 0)), r && s.ZERO.subTo(this, this);
+    }
+    function Gt(t, i, e) {
+      if (typeof i == "number")
+        if (t < 2) this.fromInt(1);
+        else
+          for (this.fromNumber(t, e), this.testBit(t - 1) || this.bitwiseTo(s.ONE.shiftLeft(t - 1), _, this), this.isEven() && this.dAddOffset(1, 0); !this.isProbablePrime(i); )
+            this.dAddOffset(2, 0), this.bitLength() > t && this.subTo(s.ONE.shiftLeft(t - 1), this);
+      else {
+        var o = new Array(), r = t & 7;
+        o.length = (t >> 3) + 1, i.nextBytes(o), r > 0 ? o[0] &= (1 << r) - 1 : o[0] = 0, this.fromString(o, 256);
+      }
+    }
+    function Xt() {
+      var t = this.t, i = new Array();
+      i[0] = this.s;
+      var e = this.DB - t * this.DB % 8, o, r = 0;
+      if (t-- > 0)
+        for (e < this.DB && (o = this[t] >> e) != (this.s & this.DM) >> e && (i[r++] = o | this.s << this.DB - e); t >= 0; )
+          e < 8 ? (o = (this[t] & (1 << e) - 1) << 8 - e, o |= this[--t] >> (e += this.DB - 8)) : (o = this[t] >> (e -= 8) & 255, e <= 0 && (e += this.DB, --t)), o & 128 && (o |= -256), r == 0 && (this.s & 128) != (o & 128) && ++r, (r > 0 || o != this.s) && (i[r++] = o);
+      return i;
+    }
+    function Ht(t) {
+      return this.compareTo(t) == 0;
+    }
+    function Jt(t) {
+      return this.compareTo(t) < 0 ? this : t;
+    }
+    function Kt(t) {
+      return this.compareTo(t) > 0 ? this : t;
+    }
+    function Qt(t, i, e) {
+      var o, r, n = Math.min(t.t, this.t);
+      for (o = 0; o < n; ++o) e[o] = i(this[o], t[o]);
+      if (t.t < this.t) {
+        for (r = t.s & this.DM, o = n; o < this.t; ++o) e[o] = i(this[o], r);
+        e.t = this.t;
+      } else {
+        for (r = this.s & this.DM, o = n; o < t.t; ++o) e[o] = i(r, t[o]);
+        e.t = t.t;
+      }
+      e.s = i(this.s, t.s), e.clamp();
+    }
+    function Wt(t, i) {
+      return t & i;
+    }
+    function Yt(t) {
+      var i = u();
+      return this.bitwiseTo(t, Wt, i), i;
+    }
+    function _(t, i) {
+      return t | i;
+    }
+    function $t(t) {
+      var i = u();
+      return this.bitwiseTo(t, _, i), i;
+    }
+    function G(t, i) {
+      return t ^ i;
+    }
+    function xt(t) {
+      var i = u();
+      return this.bitwiseTo(t, G, i), i;
+    }
+    function X(t, i) {
+      return t & ~i;
+    }
+    function ti(t) {
+      var i = u();
+      return this.bitwiseTo(t, X, i), i;
+    }
+    function ii() {
+      for (var t = u(), i = 0; i < this.t; ++i) t[i] = this.DM & ~this[i];
+      return t.t = this.t, t.s = ~this.s, t;
+    }
+    function ei(t) {
+      var i = u();
+      return t < 0 ? this.rShiftTo(-t, i) : this.lShiftTo(t, i), i;
+    }
+    function oi(t) {
+      var i = u();
+      return t < 0 ? this.lShiftTo(-t, i) : this.rShiftTo(t, i), i;
+    }
+    function ri(t) {
+      if (t == 0) return -1;
+      var i = 0;
+      return t & 65535 || (t >>= 16, i += 16), t & 255 || (t >>= 8, i += 8), t & 15 || (t >>= 4, i += 4), t & 3 || (t >>= 2, i += 2), t & 1 || ++i, i;
+    }
+    function si() {
+      for (var t = 0; t < this.t; ++t)
+        if (this[t] != 0) return t * this.DB + ri(this[t]);
+      return this.s < 0 ? this.t * this.DB : -1;
+    }
+    function ni(t) {
+      for (var i = 0; t != 0; )
+        t &= t - 1, ++i;
+      return i;
+    }
+    function hi() {
+      for (var t = 0, i = this.s & this.DM, e = 0; e < this.t; ++e) t += ni(this[e] ^ i);
+      return t;
+    }
+    function fi(t) {
+      var i = Math.floor(t / this.DB);
+      return i >= this.t ? this.s != 0 : (this[i] & 1 << t % this.DB) != 0;
+    }
+    function ui(t, i) {
+      var e = s.ONE.shiftLeft(t);
+      return this.bitwiseTo(e, i, e), e;
+    }
+    function pi(t) {
+      return this.changeBit(t, _);
+    }
+    function ai(t) {
+      return this.changeBit(t, X);
+    }
+    function li(t) {
+      return this.changeBit(t, G);
+    }
+    function ci(t, i) {
+      for (var e = 0, o = 0, r = Math.min(t.t, this.t); e < r; )
+        o += this[e] + t[e], i[e++] = o & this.DM, o >>= this.DB;
+      if (t.t < this.t) {
+        for (o += t.s; e < this.t; )
+          o += this[e], i[e++] = o & this.DM, o >>= this.DB;
+        o += this.s;
+      } else {
+        for (o += this.s; e < t.t; )
+          o += t[e], i[e++] = o & this.DM, o >>= this.DB;
+        o += t.s;
+      }
+      i.s = o < 0 ? -1 : 0, o > 0 ? i[e++] = o : o < -1 && (i[e++] = this.DV + o), i.t = e, i.clamp();
+    }
+    function vi(t) {
+      var i = u();
+      return this.addTo(t, i), i;
+    }
+    function mi(t) {
+      var i = u();
+      return this.subTo(t, i), i;
+    }
+    function Ti(t) {
+      var i = u();
+      return this.multiplyTo(t, i), i;
+    }
+    function yi() {
+      var t = u();
+      return this.squareTo(t), t;
+    }
+    function di(t) {
+      var i = u();
+      return this.divRemTo(t, i, null), i;
+    }
+    function bi(t) {
+      var i = u();
+      return this.divRemTo(t, null, i), i;
+    }
+    function wi(t) {
+      var i = u(), e = u();
+      return this.divRemTo(t, i, e), new Array(i, e);
+    }
+    function gi(t) {
+      this[this.t] = this.am(0, t - 1, this, 0, 0, this.t), ++this.t, this.clamp();
+    }
+    function Di(t, i) {
+      if (t != 0) {
+        for (; this.t <= i; ) this[this.t++] = 0;
+        for (this[i] += t; this[i] >= this.DV; )
+          this[i] -= this.DV, ++i >= this.t && (this[this.t++] = 0), ++this[i];
+      }
+    }
+    function O() {
+    }
+    function H(t) {
+      return t;
+    }
+    function Si(t, i, e) {
+      t.multiplyTo(i, e);
+    }
+    function Bi(t, i) {
+      t.squareTo(i);
+    }
+    O.prototype.convert = H, O.prototype.revert = H, O.prototype.mulTo = Si, O.prototype.sqrTo = Bi;
+    function Mi(t) {
+      return this.exp(t, new O());
+    }
+    function Ri(t, i, e) {
+      var o = Math.min(this.t + t.t, i);
+      for (e.s = 0, e.t = o; o > 0; ) e[--o] = 0;
+      var r;
+      for (r = e.t - this.t; o < r; ++o) e[o + this.t] = this.am(0, t[o], e, o, 0, this.t);
+      for (r = Math.min(t.t, i); o < r; ++o) this.am(0, t[o], e, o, 0, i - o);
+      e.clamp();
+    }
+    function Ei(t, i, e) {
+      --i;
+      var o = e.t = this.t + t.t - i;
+      for (e.s = 0; --o >= 0; ) e[o] = 0;
+      for (o = Math.max(i - this.t, 0); o < t.t; ++o)
+        e[this.t + o - i] = this.am(i - o, t[o], e, 0, 0, this.t + o - i);
+      e.clamp(), e.drShiftTo(1, e);
+    }
+    function E(t) {
+      this.r2 = u(), this.q3 = u(), s.ONE.dlShiftTo(2 * t.t, this.r2), this.mu = this.r2.divide(t), this.m = t;
+    }
+    function Ai(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 i = u();
+      return t.copyTo(i), this.reduce(i), i;
+    }
+    function Oi(t) {
+      return t;
+    }
+    function Ni(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);
+    }
+    function Vi(t, i) {
+      t.squareTo(i), this.reduce(i);
+    }
+    function Ii(t, i, e) {
+      t.multiplyTo(i, e), this.reduce(e);
+    }
+    E.prototype.convert = Ai, E.prototype.revert = Oi, E.prototype.reduce = Ni, E.prototype.mulTo = Ii, E.prototype.sqrTo = Vi;
+    function Ci(t, i) {
+      var e = t.bitLength(), o, r = S(1), n;
+      if (e <= 0) return r;
+      e < 18 ? o = 1 : e < 48 ? o = 3 : e < 144 ? o = 4 : e < 768 ? o = 5 : o = 6, e < 8 ? n = new M(i) : i.isEven() ? n = new E(i) : n = new R(i);
+      var h = new Array(), f = 3, p = o - 1, l = (1 << o) - 1;
+      if (h[1] = n.convert(this), o > 1) {
+        var y = u();
+        for (n.sqrTo(h[1], y); f <= l; )
+          h[f] = u(), n.mulTo(y, h[f - 2], h[f]), f += 2;
+      }
+      var m = t.t - 1, g, C = !0, b = u(), w;
+      for (e = V(t[m]) - 1; m >= 0; ) {
+        for (e >= p ? g = t[m] >> e - p & l : (g = (t[m] & (1 << e + 1) - 1) << p - e, m > 0 && (g |= t[m - 1] >> this.DB + e - p)), f = o; !(g & 1); )
+          g >>= 1, --f;
+        if ((e -= f) < 0 && (e += this.DB, --m), C)
+          h[g].copyTo(r), C = !1;
+        else {
+          for (; f > 1; )
+            n.sqrTo(r, b), n.sqrTo(b, r), f -= 2;
+          f > 0 ? n.sqrTo(r, b) : (w = r, r = b, b = w), n.mulTo(b, h[g], r);
+        }
+        for (; m >= 0 && !(t[m] & 1 << e); )
+          n.sqrTo(r, b), w = r, r = b, b = w, --e < 0 && (e = this.DB - 1, --m);
+      }
+      return n.revert(r);
+    }
+    function Li(t) {
+      var i = this.s < 0 ? this.negate() : this.clone(), e = t.s < 0 ? t.negate() : t.clone();
+      if (i.compareTo(e) < 0) {
+        var o = i;
+        i = e, e = o;
+      }
+      var r = i.getLowestSetBit(), n = e.getLowestSetBit();
+      if (n < 0) return i;
+      for (r < n && (n = r), n > 0 && (i.rShiftTo(n, i), e.rShiftTo(n, e)); i.signum() > 0; )
+        (r = i.getLowestSetBit()) > 0 && i.rShiftTo(r, i), (r = e.getLowestSetBit()) > 0 && e.rShiftTo(r, e), i.compareTo(e) >= 0 ? (i.subTo(e, i), i.rShiftTo(1, i)) : (e.subTo(i, e), e.rShiftTo(1, e));
+      return n > 0 && e.lShiftTo(n, e), e;
+    }
+    function qi(t) {
+      if (t <= 0) return 0;
+      var i = this.DV % t, e = this.s < 0 ? t - 1 : 0;
+      if (this.t > 0)
+        if (i == 0) e = this[0] % t;
+        else for (var o = this.t - 1; o >= 0; --o) e = (i * e + this[o]) % t;
+      return e;
+    }
+    function _i(t) {
+      var i = t.isEven();
+      if (this.isEven() && i || t.signum() == 0) return s.ZERO;
+      for (var e = t.clone(), o = this.clone(), r = S(1), n = S(0), h = S(0), f = S(1); e.signum() != 0; ) {
+        for (; e.isEven(); )
+          e.rShiftTo(1, e), i ? ((!r.isEven() || !n.isEven()) && (r.addTo(this, r), n.subTo(t, n)), r.rShiftTo(1, r)) : n.isEven() || n.subTo(t, n), n.rShiftTo(1, n);
+        for (; o.isEven(); )
+          o.rShiftTo(1, o), i ? ((!h.isEven() || !f.isEven()) && (h.addTo(this, h), f.subTo(t, f)), h.rShiftTo(1, h)) : f.isEven() || f.subTo(t, f), f.rShiftTo(1, f);
+        e.compareTo(o) >= 0 ? (e.subTo(o, e), i && r.subTo(h, r), n.subTo(f, n)) : (o.subTo(e, o), i && h.subTo(r, h), f.subTo(n, f));
+      }
+      if (o.compareTo(s.ONE) != 0) return s.ZERO;
+      if (f.compareTo(t) >= 0) return f.subtract(t);
+      if (f.signum() < 0) f.addTo(t, f);
+      else return f;
+      return f.signum() < 0 ? f.add(t) : f;
+    }
+    var c = [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], Fi = (1 << 26) / c[c.length - 1];
+    function Pi(t) {
+      var i, e = this.abs();
+      if (e.t == 1 && e[0] <= c[c.length - 1]) {
+        for (i = 0; i < c.length; ++i)
+          if (e[0] == c[i]) return !0;
+        return !1;
+      }
+      if (e.isEven()) return !1;
+      for (i = 1; i < c.length; ) {
+        for (var o = c[i], r = i + 1; r < c.length && o < Fi; ) o *= c[r++];
+        for (o = e.modInt(o); i < r; ) if (o % c[i++] == 0) return !1;
+      }
+      return e.millerRabin(t);
+    }
+    function ki(t) {
+      var i = this.subtract(s.ONE), e = i.getLowestSetBit();
+      if (e <= 0) return !1;
+      var o = i.shiftRight(e);
+      t = t + 1 >> 1, t > c.length && (t = c.length);
+      for (var r = u(), n = 0; n < t; ++n) {
+        r.fromInt(c[Math.floor(Math.random() * c.length)]);
+        var h = r.modPow(o, this);
+        if (h.compareTo(s.ONE) != 0 && h.compareTo(i) != 0) {
+          for (var f = 1; f++ < e && h.compareTo(i) != 0; )
+            if (h = h.modPowInt(2, this), h.compareTo(s.ONE) == 0) return !1;
+          if (h.compareTo(i) != 0) return !1;
+        }
+      }
+      return !0;
+    }
+    s.prototype.chunkSize = Zt, s.prototype.toRadix = zt, s.prototype.fromRadix = Ut, s.prototype.fromNumber = Gt, s.prototype.bitwiseTo = Qt, s.prototype.changeBit = ui, s.prototype.addTo = ci, s.prototype.dMultiply = gi, s.prototype.dAddOffset = Di, s.prototype.multiplyLowerTo = Ri, s.prototype.multiplyUpperTo = Ei, s.prototype.modInt = qi, s.prototype.millerRabin = ki, s.prototype.clone = _t, s.prototype.intValue = Ft, s.prototype.byteValue = Pt, s.prototype.shortValue = kt, s.prototype.signum = jt, s.prototype.toByteArray = Xt, s.prototype.equals = Ht, s.prototype.min = Jt, s.prototype.max = Kt, s.prototype.and = Yt, s.prototype.or = $t, s.prototype.xor = xt, s.prototype.andNot = ti, s.prototype.not = ii, s.prototype.shiftLeft = ei, s.prototype.shiftRight = oi, s.prototype.getLowestSetBit = si, s.prototype.bitCount = hi, s.prototype.testBit = fi, s.prototype.setBit = pi, s.prototype.clearBit = ai, s.prototype.flipBit = li, s.prototype.add = vi, s.prototype.subtract = mi, s.prototype.multiply = Ti, s.prototype.divide = di, s.prototype.remainder = bi, s.prototype.divideAndRemainder = wi, s.prototype.modPow = Ci, s.prototype.modInverse = _i, s.prototype.pow = Mi, s.prototype.gcd = Li, s.prototype.isProbablePrime = Pi, s.prototype.square = yi, s.prototype.Barrett = E;
+    var I, v, a;
+    function Zi(t) {
+      v[a++] ^= t & 255, v[a++] ^= t >> 8 & 255, v[a++] ^= t >> 16 & 255, v[a++] ^= t >> 24 & 255, a >= P && (a -= P);
+    }
+    function J() {
+      Zi((/* @__PURE__ */ new Date()).getTime());
+    }
+    if (v == null) {
+      v = new Array(), a = 0;
+      var d;
+      if (typeof window < "u" && window.crypto) {
+        if (window.crypto.getRandomValues) {
+          var K = new Uint8Array(32);
+          for (window.crypto.getRandomValues(K), d = 0; d < 32; ++d)
+            v[a++] = K[d];
+        } else if (navigator.appName == "Netscape" && navigator.appVersion < "5") {
+          var Q = window.crypto.random(32);
+          for (d = 0; d < Q.length; ++d)
+            v[a++] = Q.charCodeAt(d) & 255;
+        }
+      }
+      for (; a < P; )
+        d = Math.floor(65536 * Math.random()), v[a++] = d >>> 8, v[a++] = d & 255;
+      a = 0, J();
+    }
+    function ji() {
+      if (I == null) {
+        for (J(), I = Xi(), I.init(v), a = 0; a < v.length; ++a)
+          v[a] = 0;
+        a = 0;
+      }
+      return I.next();
+    }
+    function zi(t) {
+      var i;
+      for (i = 0; i < t.length; ++i) t[i] = ji();
+    }
+    function W() {
+    }
+    W.prototype.nextBytes = zi;
+    function F() {
+      this.i = 0, this.j = 0, this.S = new Array();
+    }
+    function Ui(t) {
+      var i, e, o;
+      for (i = 0; i < 256; ++i)
+        this.S[i] = i;
+      for (e = 0, i = 0; i < 256; ++i)
+        e = e + this.S[i] + t[i % t.length] & 255, o = this.S[i], this.S[i] = this.S[e], this.S[e] = o;
+      this.i = 0, this.j = 0;
+    }
+    function Gi() {
+      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];
+    }
+    F.prototype.init = Ui, F.prototype.next = Gi;
+    function Xi() {
+      return new F();
+    }
+    var P = 256;
+    $.exports = {
+      default: s,
+      BigInteger: s,
+      SecureRandom: W
+    };
+  }).call(Hi);
+})(Y);
+var Qi = Y.exports;
+export {
+  Qi as j
+};
+//# sourceMappingURL=index-BW3nOBfD.js.map