@unicom-cloud/ui 0.8.66 → 0.8.67

package/chunk/BoMCZV6K.js

@@ -0,0 +1,1098 @@
+/*!
+ *  decimal.js v10.5.0
+ *  An arbitrary-precision Decimal type for JavaScript.
+ *  https://github.com/MikeMcl/decimal.js
+ *  Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>
+ *  MIT Licence
+ */
+var cn = 9e15, B = 1e9, fn = "0123456789abcdef", X = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", Y = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", an = {
+  // These values must be integers within the stated ranges (inclusive).
+  // Most of these values can be changed at run-time using the `Decimal.config` method.
+  // The maximum number of significant digits of the result of a calculation or base conversion.
+  // E.g. `Decimal.config({ precision: 20 });`
+  precision: 20,
+  // 1 to MAX_DIGITS
+  // The rounding mode used when rounding to `precision`.
+  //
+  // ROUND_UP         0 Away from zero.
+  // ROUND_DOWN       1 Towards zero.
+  // ROUND_CEIL       2 Towards +Infinity.
+  // ROUND_FLOOR      3 Towards -Infinity.
+  // ROUND_HALF_UP    4 Towards nearest neighbour. If equidistant, up.
+  // ROUND_HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.
+  // ROUND_HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.
+  // ROUND_HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.
+  // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.
+  //
+  // E.g.
+  // `Decimal.rounding = 4;`
+  // `Decimal.rounding = Decimal.ROUND_HALF_UP;`
+  rounding: 4,
+  // 0 to 8
+  // The modulo mode used when calculating the modulus: a mod n.
+  // The quotient (q = a / n) is calculated according to the corresponding rounding mode.
+  // The remainder (r) is calculated as: r = a - n * q.
+  //
+  // UP         0 The remainder is positive if the dividend is negative, else is negative.
+  // DOWN       1 The remainder has the same sign as the dividend (JavaScript %).
+  // FLOOR      3 The remainder has the same sign as the divisor (Python %).
+  // HALF_EVEN  6 The IEEE 754 remainder function.
+  // EUCLID     9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.
+  //
+  // Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian
+  // division (9) are commonly used for the modulus operation. The other rounding modes can also
+  // be used, but they may not give useful results.
+  modulo: 1,
+  // 0 to 9
+  // The exponent value at and beneath which `toString` returns exponential notation.
+  // JavaScript numbers: -7
+  toExpNeg: -7,
+  // 0 to -EXP_LIMIT
+  // The exponent value at and above which `toString` returns exponential notation.
+  // JavaScript numbers: 21
+  toExpPos: 21,
+  // 0 to EXP_LIMIT
+  // The minimum exponent value, beneath which underflow to zero occurs.
+  // JavaScript numbers: -324  (5e-324)
+  minE: -9e15,
+  // -1 to -EXP_LIMIT
+  // The maximum exponent value, above which overflow to Infinity occurs.
+  // JavaScript numbers: 308  (1.7976931348623157e+308)
+  maxE: cn,
+  // 1 to EXP_LIMIT
+  // Whether to use cryptographically-secure random number generation, if available.
+  crypto: !1
+  // true/false
+}, Z, wn, k, w = !0, rn = "[DecimalError] ", H = rn + "Invalid argument: ", Nn = rn + "Precision limit exceeded", vn = rn + "crypto unavailable", bn = "[object Decimal]", A = Math.floor, M = Math.pow, Rn = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, Sn = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, Tn = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, En = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, T = 1e7, m = 7, _n = 9007199254740991, Ln = X.length - 1, ln = Y.length - 1, h = { toStringTag: bn };
+h.absoluteValue = h.abs = function() {
+  var n = new this.constructor(this);
+  return n.s < 0 && (n.s = 1), g(n);
+};
+h.ceil = function() {
+  return g(new this.constructor(this), this.e + 1, 2);
+};
+h.clampedTo = h.clamp = function(n, r) {
+  var i, e = this, s = e.constructor;
+  if (n = new s(n), r = new s(r), !n.s || !r.s) return new s(NaN);
+  if (n.gt(r)) throw Error(H + r);
+  return i = e.cmp(n), i < 0 ? n : e.cmp(r) > 0 ? r : new s(e);
+};
+h.comparedTo = h.cmp = function(n) {
+  var r, i, e, s, t = this, o = t.d, u = (n = new t.constructor(n)).d, f = t.s, c = n.s;
+  if (!o || !u)
+    return !f || !c ? NaN : f !== c ? f : o === u ? 0 : !o ^ f < 0 ? 1 : -1;
+  if (!o[0] || !u[0]) return o[0] ? f : u[0] ? -c : 0;
+  if (f !== c) return f;
+  if (t.e !== n.e) return t.e > n.e ^ f < 0 ? 1 : -1;
+  for (e = o.length, s = u.length, r = 0, i = e < s ? e : s; r < i; ++r)
+    if (o[r] !== u[r]) return o[r] > u[r] ^ f < 0 ? 1 : -1;
+  return e === s ? 0 : e > s ^ f < 0 ? 1 : -1;
+};
+h.cosine = h.cos = function() {
+  var n, r, i = this, e = i.constructor;
+  return i.d ? i.d[0] ? (n = e.precision, r = e.rounding, e.precision = n + Math.max(i.e, i.sd()) + m, e.rounding = 1, i = Un(e, On(e, i)), e.precision = n, e.rounding = r, g(k == 2 || k == 3 ? i.neg() : i, n, r, !0)) : new e(1) : new e(NaN);
+};
+h.cubeRoot = h.cbrt = function() {
+  var n, r, i, e, s, t, o, u, f, c, a = this, l = a.constructor;
+  if (!a.isFinite() || a.isZero()) return new l(a);
+  for (w = !1, t = a.s * M(a.s * a, 1 / 3), !t || Math.abs(t) == 1 / 0 ? (i = q(a.d), n = a.e, (t = (n - i.length + 1) % 3) && (i += t == 1 || t == -2 ? "0" : "00"), t = M(i, 1 / 3), n = A((n + 1) / 3) - (n % 3 == (n < 0 ? -1 : 2)), t == 1 / 0 ? i = "5e" + n : (i = t.toExponential(), i = i.slice(0, i.indexOf("e") + 1) + n), e = new l(i), e.s = a.s) : e = new l(t.toString()), o = (n = l.precision) + 3; ; )
+    if (u = e, f = u.times(u).times(u), c = f.plus(a), e = E(c.plus(a).times(u), c.plus(f), o + 2, 1), q(u.d).slice(0, o) === (i = q(e.d)).slice(0, o))
+      if (i = i.slice(o - 3, o + 1), i == "9999" || !s && i == "4999") {
+        if (!s && (g(u, n + 1, 0), u.times(u).times(u).eq(a))) {
+          e = u;
+          break;
+        }
+        o += 4, s = 1;
+      } else {
+        (!+i || !+i.slice(1) && i.charAt(0) == "5") && (g(e, n + 1, 1), r = !e.times(e).times(e).eq(a));
+        break;
+      }
+  return w = !0, g(e, n, l.rounding, r);
+};
+h.decimalPlaces = h.dp = function() {
+  var n, r = this.d, i = NaN;
+  if (r) {
+    if (n = r.length - 1, i = (n - A(this.e / m)) * m, n = r[n], n) for (; n % 10 == 0; n /= 10) i--;
+    i < 0 && (i = 0);
+  }
+  return i;
+};
+h.dividedBy = h.div = function(n) {
+  return E(this, new this.constructor(n));
+};
+h.dividedToIntegerBy = h.divToInt = function(n) {
+  var r = this, i = r.constructor;
+  return g(
+    E(r, new i(n), 0, 1, 1),
+    i.precision,
+    i.rounding
+  );
+};
+h.equals = h.eq = function(n) {
+  return this.cmp(n) === 0;
+};
+h.floor = function() {
+  return g(new this.constructor(this), this.e + 1, 3);
+};
+h.greaterThan = h.gt = function(n) {
+  return this.cmp(n) > 0;
+};
+h.greaterThanOrEqualTo = h.gte = function(n) {
+  var r = this.cmp(n);
+  return r == 1 || r === 0;
+};
+h.hyperbolicCosine = h.cosh = function() {
+  var n, r, i, e, s, t = this, o = t.constructor, u = new o(1);
+  if (!t.isFinite()) return new o(t.s ? 1 / 0 : NaN);
+  if (t.isZero()) return u;
+  i = o.precision, e = o.rounding, o.precision = i + Math.max(t.e, t.sd()) + 4, o.rounding = 1, s = t.d.length, s < 32 ? (n = Math.ceil(s / 3), r = (1 / tn(4, n)).toString()) : (n = 16, r = "2.3283064365386962890625e-10"), t = V(o, 1, t.times(r), new o(1), !0);
+  for (var f, c = n, a = new o(8); c--; )
+    f = t.times(t), t = u.minus(f.times(a.minus(f.times(a))));
+  return g(t, o.precision = i, o.rounding = e, !0);
+};
+h.hyperbolicSine = h.sinh = function() {
+  var n, r, i, e, s = this, t = s.constructor;
+  if (!s.isFinite() || s.isZero()) return new t(s);
+  if (r = t.precision, i = t.rounding, t.precision = r + Math.max(s.e, s.sd()) + 4, t.rounding = 1, e = s.d.length, e < 3)
+    s = V(t, 2, s, s, !0);
+  else {
+    n = 1.4 * Math.sqrt(e), n = n > 16 ? 16 : n | 0, s = s.times(1 / tn(5, n)), s = V(t, 2, s, s, !0);
+    for (var o, u = new t(5), f = new t(16), c = new t(20); n--; )
+      o = s.times(s), s = s.times(u.plus(o.times(f.times(o).plus(c))));
+  }
+  return t.precision = r, t.rounding = i, g(s, r, i, !0);
+};
+h.hyperbolicTangent = h.tanh = function() {
+  var n, r, i = this, e = i.constructor;
+  return i.isFinite() ? i.isZero() ? new e(i) : (n = e.precision, r = e.rounding, e.precision = n + 7, e.rounding = 1, E(
+    i.sinh(),
+    i.cosh(),
+    e.precision = n,
+    e.rounding = r
+  )) : new e(i.s);
+};
+h.inverseCosine = h.acos = function() {
+  var n = this, r = n.constructor, i = n.abs().cmp(1), e = r.precision, s = r.rounding;
+  return i !== -1 ? i === 0 ? (
+    // |x| is 1
+    n.isNeg() ? _(r, e, s) : new r(0)
+  ) : (
+    // |x| > 1 or x is NaN
+    new r(NaN)
+  ) : n.isZero() ? _(r, e + 4, s).times(0.5) : (r.precision = e + 6, r.rounding = 1, n = new r(1).minus(n).div(n.plus(1)).sqrt().atan(), r.precision = e, r.rounding = s, n.times(2));
+};
+h.inverseHyperbolicCosine = h.acosh = function() {
+  var n, r, i = this, e = i.constructor;
+  return i.lte(1) ? new e(i.eq(1) ? 0 : NaN) : i.isFinite() ? (n = e.precision, r = e.rounding, e.precision = n + Math.max(Math.abs(i.e), i.sd()) + 4, e.rounding = 1, w = !1, i = i.times(i).minus(1).sqrt().plus(i), w = !0, e.precision = n, e.rounding = r, i.ln()) : new e(i);
+};
+h.inverseHyperbolicSine = h.asinh = function() {
+  var n, r, i = this, e = i.constructor;
+  return !i.isFinite() || i.isZero() ? new e(i) : (n = e.precision, r = e.rounding, e.precision = n + 2 * Math.max(Math.abs(i.e), i.sd()) + 6, e.rounding = 1, w = !1, i = i.times(i).plus(1).sqrt().plus(i), w = !0, e.precision = n, e.rounding = r, i.ln());
+};
+h.inverseHyperbolicTangent = h.atanh = function() {
+  var n, r, i, e, s = this, t = s.constructor;
+  return s.isFinite() ? s.e >= 0 ? new t(s.abs().eq(1) ? s.s / 0 : s.isZero() ? s : NaN) : (n = t.precision, r = t.rounding, e = s.sd(), Math.max(e, n) < 2 * -s.e - 1 ? g(new t(s), n, r, !0) : (t.precision = i = e - s.e, s = E(s.plus(1), new t(1).minus(s), i + n, 1), t.precision = n + 4, t.rounding = 1, s = s.ln(), t.precision = n, t.rounding = r, s.times(0.5))) : new t(NaN);
+};
+h.inverseSine = h.asin = function() {
+  var n, r, i, e, s = this, t = s.constructor;
+  return s.isZero() ? new t(s) : (r = s.abs().cmp(1), i = t.precision, e = t.rounding, r !== -1 ? r === 0 ? (n = _(t, i + 4, e).times(0.5), n.s = s.s, n) : new t(NaN) : (t.precision = i + 6, t.rounding = 1, s = s.div(new t(1).minus(s.times(s)).sqrt().plus(1)).atan(), t.precision = i, t.rounding = e, s.times(2)));
+};
+h.inverseTangent = h.atan = function() {
+  var n, r, i, e, s, t, o, u, f, c = this, a = c.constructor, l = a.precision, d = a.rounding;
+  if (c.isFinite()) {
+    if (c.isZero())
+      return new a(c);
+    if (c.abs().eq(1) && l + 4 <= ln)
+      return o = _(a, l + 4, d).times(0.25), o.s = c.s, o;
+  } else {
+    if (!c.s) return new a(NaN);
+    if (l + 4 <= ln)
+      return o = _(a, l + 4, d).times(0.5), o.s = c.s, o;
+  }
+  for (a.precision = u = l + 10, a.rounding = 1, i = Math.min(28, u / m + 2 | 0), n = i; n; --n) c = c.div(c.times(c).plus(1).sqrt().plus(1));
+  for (w = !1, r = Math.ceil(u / m), e = 1, f = c.times(c), o = new a(c), s = c; n !== -1; )
+    if (s = s.times(f), t = o.minus(s.div(e += 2)), s = s.times(f), o = t.plus(s.div(e += 2)), o.d[r] !== void 0) for (n = r; o.d[n] === t.d[n] && n--; ) ;
+  return i && (o = o.times(2 << i - 1)), w = !0, g(o, a.precision = l, a.rounding = d, !0);
+};
+h.isFinite = function() {
+  return !!this.d;
+};
+h.isInteger = h.isInt = function() {
+  return !!this.d && A(this.e / m) > this.d.length - 2;
+};
+h.isNaN = function() {
+  return !this.s;
+};
+h.isNegative = h.isNeg = function() {
+  return this.s < 0;
+};
+h.isPositive = h.isPos = function() {
+  return this.s > 0;
+};
+h.isZero = function() {
+  return !!this.d && this.d[0] === 0;
+};
+h.lessThan = h.lt = function(n) {
+  return this.cmp(n) < 0;
+};
+h.lessThanOrEqualTo = h.lte = function(n) {
+  return this.cmp(n) < 1;
+};
+h.logarithm = h.log = function(n) {
+  var r, i, e, s, t, o, u, f, c = this, a = c.constructor, l = a.precision, d = a.rounding, p = 5;
+  if (n == null)
+    n = new a(10), r = !0;
+  else {
+    if (n = new a(n), i = n.d, n.s < 0 || !i || !i[0] || n.eq(1)) return new a(NaN);
+    r = n.eq(10);
+  }
+  if (i = c.d, c.s < 0 || !i || !i[0] || c.eq(1))
+    return new a(i && !i[0] ? -1 / 0 : c.s != 1 ? NaN : i ? 0 : 1 / 0);
+  if (r)
+    if (i.length > 1)
+      t = !0;
+    else {
+      for (s = i[0]; s % 10 === 0; ) s /= 10;
+      t = s !== 1;
+    }
+  if (w = !1, u = l + p, o = C(c, u), e = r ? nn(a, u + 10) : C(n, u), f = E(o, e, u, 1), j(f.d, s = l, d))
+    do
+      if (u += 10, o = C(c, u), e = r ? nn(a, u + 10) : C(n, u), f = E(o, e, u, 1), !t) {
+        +q(f.d).slice(s + 1, s + 15) + 1 == 1e14 && (f = g(f, l + 1, 0));
+        break;
+      }
+    while (j(f.d, s += 10, d));
+  return w = !0, g(f, l, d);
+};
+h.minus = h.sub = function(n) {
+  var r, i, e, s, t, o, u, f, c, a, l, d, p = this, v = p.constructor;
+  if (n = new v(n), !p.d || !n.d)
+    return !p.s || !n.s ? n = new v(NaN) : p.d ? n.s = -n.s : n = new v(n.d || p.s !== n.s ? p : NaN), n;
+  if (p.s != n.s)
+    return n.s = -n.s, p.plus(n);
+  if (c = p.d, d = n.d, u = v.precision, f = v.rounding, !c[0] || !d[0]) {
+    if (d[0]) n.s = -n.s;
+    else if (c[0]) n = new v(p);
+    else return new v(f === 3 ? -0 : 0);
+    return w ? g(n, u, f) : n;
+  }
+  if (i = A(n.e / m), a = A(p.e / m), c = c.slice(), t = a - i, t) {
+    for (l = t < 0, l ? (r = c, t = -t, o = d.length) : (r = d, i = a, o = c.length), e = Math.max(Math.ceil(u / m), o) + 2, t > e && (t = e, r.length = 1), r.reverse(), e = t; e--; ) r.push(0);
+    r.reverse();
+  } else {
+    for (e = c.length, o = d.length, l = e < o, l && (o = e), e = 0; e < o; e++)
+      if (c[e] != d[e]) {
+        l = c[e] < d[e];
+        break;
+      }
+    t = 0;
+  }
+  for (l && (r = c, c = d, d = r, n.s = -n.s), o = c.length, e = d.length - o; e > 0; --e) c[o++] = 0;
+  for (e = d.length; e > t; ) {
+    if (c[--e] < d[e]) {
+      for (s = e; s && c[--s] === 0; ) c[s] = T - 1;
+      --c[s], c[e] += T;
+    }
+    c[e] -= d[e];
+  }
+  for (; c[--o] === 0; ) c.pop();
+  for (; c[0] === 0; c.shift()) --i;
+  return c[0] ? (n.d = c, n.e = en(c, i), w ? g(n, u, f) : n) : new v(f === 3 ? -0 : 0);
+};
+h.modulo = h.mod = function(n) {
+  var r, i = this, e = i.constructor;
+  return n = new e(n), !i.d || !n.s || n.d && !n.d[0] ? new e(NaN) : !n.d || i.d && !i.d[0] ? g(new e(i), e.precision, e.rounding) : (w = !1, e.modulo == 9 ? (r = E(i, n.abs(), 0, 3, 1), r.s *= n.s) : r = E(i, n, 0, e.modulo, 1), r = r.times(n), w = !0, i.minus(r));
+};
+h.naturalExponential = h.exp = function() {
+  return dn(this);
+};
+h.naturalLogarithm = h.ln = function() {
+  return C(this);
+};
+h.negated = h.neg = function() {
+  var n = new this.constructor(this);
+  return n.s = -n.s, g(n);
+};
+h.plus = h.add = function(n) {
+  var r, i, e, s, t, o, u, f, c, a, l = this, d = l.constructor;
+  if (n = new d(n), !l.d || !n.d)
+    return !l.s || !n.s ? n = new d(NaN) : l.d || (n = new d(n.d || l.s === n.s ? l : NaN)), n;
+  if (l.s != n.s)
+    return n.s = -n.s, l.minus(n);
+  if (c = l.d, a = n.d, u = d.precision, f = d.rounding, !c[0] || !a[0])
+    return a[0] || (n = new d(l)), w ? g(n, u, f) : n;
+  if (t = A(l.e / m), e = A(n.e / m), c = c.slice(), s = t - e, s) {
+    for (s < 0 ? (i = c, s = -s, o = a.length) : (i = a, e = t, o = c.length), t = Math.ceil(u / m), o = t > o ? t + 1 : o + 1, s > o && (s = o, i.length = 1), i.reverse(); s--; ) i.push(0);
+    i.reverse();
+  }
+  for (o = c.length, s = a.length, o - s < 0 && (s = o, i = a, a = c, c = i), r = 0; s; )
+    r = (c[--s] = c[s] + a[s] + r) / T | 0, c[s] %= T;
+  for (r && (c.unshift(r), ++e), o = c.length; c[--o] == 0; ) c.pop();
+  return n.d = c, n.e = en(c, e), w ? g(n, u, f) : n;
+};
+h.precision = h.sd = function(n) {
+  var r, i = this;
+  if (n !== void 0 && n !== !!n && n !== 1 && n !== 0)
+    throw Error(H + n);
+  return i.d ? (r = xn(i.d), n && i.e + 1 > r && (r = i.e + 1)) : r = NaN, r;
+};
+h.round = function() {
+  var n = this, r = n.constructor;
+  return g(new r(n), n.e + 1, r.rounding);
+};
+h.sine = h.sin = function() {
+  var n, r, i = this, e = i.constructor;
+  return i.isFinite() ? i.isZero() ? new e(i) : (n = e.precision, r = e.rounding, e.precision = n + Math.max(i.e, i.sd()) + m, e.rounding = 1, i = In(e, On(e, i)), e.precision = n, e.rounding = r, g(k > 2 ? i.neg() : i, n, r, !0)) : new e(NaN);
+};
+h.squareRoot = h.sqrt = function() {
+  var n, r, i, e, s, t, o = this, u = o.d, f = o.e, c = o.s, a = o.constructor;
+  if (c !== 1 || !u || !u[0])
+    return new a(!c || c < 0 && (!u || u[0]) ? NaN : u ? o : 1 / 0);
+  for (w = !1, c = Math.sqrt(+o), c == 0 || c == 1 / 0 ? (r = q(u), (r.length + f) % 2 == 0 && (r += "0"), c = Math.sqrt(r), f = A((f + 1) / 2) - (f < 0 || f % 2), c == 1 / 0 ? r = "5e" + f : (r = c.toExponential(), r = r.slice(0, r.indexOf("e") + 1) + f), e = new a(r)) : e = new a(c.toString()), i = (f = a.precision) + 3; ; )
+    if (t = e, e = t.plus(E(o, t, i + 2, 1)).times(0.5), q(t.d).slice(0, i) === (r = q(e.d)).slice(0, i))
+      if (r = r.slice(i - 3, i + 1), r == "9999" || !s && r == "4999") {
+        if (!s && (g(t, f + 1, 0), t.times(t).eq(o))) {
+          e = t;
+          break;
+        }
+        i += 4, s = 1;
+      } else {
+        (!+r || !+r.slice(1) && r.charAt(0) == "5") && (g(e, f + 1, 1), n = !e.times(e).eq(o));
+        break;
+      }
+  return w = !0, g(e, f, a.rounding, n);
+};
+h.tangent = h.tan = function() {
+  var n, r, i = this, e = i.constructor;
+  return i.isFinite() ? i.isZero() ? new e(i) : (n = e.precision, r = e.rounding, e.precision = n + 10, e.rounding = 1, i = i.sin(), i.s = 1, i = E(i, new e(1).minus(i.times(i)).sqrt(), n + 10, 0), e.precision = n, e.rounding = r, g(k == 2 || k == 4 ? i.neg() : i, n, r, !0)) : new e(NaN);
+};
+h.times = h.mul = function(n) {
+  var r, i, e, s, t, o, u, f, c, a = this, l = a.constructor, d = a.d, p = (n = new l(n)).d;
+  if (n.s *= a.s, !d || !d[0] || !p || !p[0])
+    return new l(
+      !n.s || d && !d[0] && !p || p && !p[0] && !d ? (
+        // Return NaN if either is NaN.
+        // Return NaN if x is ±0 and y is ±Infinity, or y is ±0 and x is ±Infinity.
+        NaN
+      ) : (
+        // Return ±Infinity if either is ±Infinity.
+        // Return ±0 if either is ±0.
+        !d || !p ? n.s / 0 : n.s * 0
+      )
+    );
+  for (i = A(a.e / m) + A(n.e / m), f = d.length, c = p.length, f < c && (t = d, d = p, p = t, o = f, f = c, c = o), t = [], o = f + c, e = o; e--; ) t.push(0);
+  for (e = c; --e >= 0; ) {
+    for (r = 0, s = f + e; s > e; )
+      u = t[s] + p[e] * d[s - e - 1] + r, t[s--] = u % T | 0, r = u / T | 0;
+    t[s] = (t[s] + r) % T | 0;
+  }
+  for (; !t[--o]; ) t.pop();
+  return r ? ++i : t.shift(), n.d = t, n.e = en(t, i), w ? g(n, l.precision, l.rounding) : n;
+};
+h.toBinary = function(n, r) {
+  return hn(this, 2, n, r);
+};
+h.toDecimalPlaces = h.toDP = function(n, r) {
+  var i = this, e = i.constructor;
+  return i = new e(i), n === void 0 ? i : (P(n, 0, B), r === void 0 ? r = e.rounding : P(r, 0, 8), g(i, n + i.e + 1, r));
+};
+h.toExponential = function(n, r) {
+  var i, e = this, s = e.constructor;
+  return n === void 0 ? i = L(e, !0) : (P(n, 0, B), r === void 0 ? r = s.rounding : P(r, 0, 8), e = g(new s(e), n + 1, r), i = L(e, !0, n + 1)), e.isNeg() && !e.isZero() ? "-" + i : i;
+};
+h.toFixed = function(n, r) {
+  var i, e, s = this, t = s.constructor;
+  return n === void 0 ? i = L(s) : (P(n, 0, B), r === void 0 ? r = t.rounding : P(r, 0, 8), e = g(new t(s), n + s.e + 1, r), i = L(e, !1, n + e.e + 1)), s.isNeg() && !s.isZero() ? "-" + i : i;
+};
+h.toFraction = function(n) {
+  var r, i, e, s, t, o, u, f, c, a, l, d, p = this, v = p.d, N = p.constructor;
+  if (!v) return new N(p);
+  if (c = i = new N(1), e = f = new N(0), r = new N(e), t = r.e = xn(v) - p.e - 1, o = t % m, r.d[0] = M(10, o < 0 ? m + o : o), n == null)
+    n = t > 0 ? r : c;
+  else {
+    if (u = new N(n), !u.isInt() || u.lt(c)) throw Error(H + u);
+    n = u.gt(r) ? t > 0 ? r : c : u;
+  }
+  for (w = !1, u = new N(q(v)), a = N.precision, N.precision = t = v.length * m * 2; l = E(u, r, 0, 1, 1), s = i.plus(l.times(e)), s.cmp(n) != 1; )
+    i = e, e = s, s = c, c = f.plus(l.times(s)), f = s, s = r, r = u.minus(l.times(s)), u = s;
+  return s = E(n.minus(i), e, 0, 1, 1), f = f.plus(s.times(c)), i = i.plus(s.times(e)), f.s = c.s = p.s, d = E(c, e, t, 1).minus(p).abs().cmp(E(f, i, t, 1).minus(p).abs()) < 1 ? [c, e] : [f, i], N.precision = a, w = !0, d;
+};
+h.toHexadecimal = h.toHex = function(n, r) {
+  return hn(this, 16, n, r);
+};
+h.toNearest = function(n, r) {
+  var i = this, e = i.constructor;
+  if (i = new e(i), n == null) {
+    if (!i.d) return i;
+    n = new e(1), r = e.rounding;
+  } else {
+    if (n = new e(n), r === void 0 ? r = e.rounding : P(r, 0, 8), !i.d) return n.s ? i : n;
+    if (!n.d)
+      return n.s && (n.s = i.s), n;
+  }
+  return n.d[0] ? (w = !1, i = E(i, n, 0, r, 1).times(n), w = !0, g(i)) : (n.s = i.s, i = n), i;
+};
+h.toNumber = function() {
+  return +this;
+};
+h.toOctal = function(n, r) {
+  return hn(this, 8, n, r);
+};
+h.toPower = h.pow = function(n) {
+  var r, i, e, s, t, o, u = this, f = u.constructor, c = +(n = new f(n));
+  if (!u.d || !n.d || !u.d[0] || !n.d[0]) return new f(M(+u, c));
+  if (u = new f(u), u.eq(1)) return u;
+  if (e = f.precision, t = f.rounding, n.eq(1)) return g(u, e, t);
+  if (r = A(n.e / m), r >= n.d.length - 1 && (i = c < 0 ? -c : c) <= _n)
+    return s = yn(f, u, i, e), n.s < 0 ? new f(1).div(s) : g(s, e, t);
+  if (o = u.s, o < 0) {
+    if (r < n.d.length - 1) return new f(NaN);
+    if ((n.d[r] & 1) == 0 && (o = 1), u.e == 0 && u.d[0] == 1 && u.d.length == 1)
+      return u.s = o, u;
+  }
+  return i = M(+u, c), r = i == 0 || !isFinite(i) ? A(
+    c * (Math.log("0." + q(u.d)) / Math.LN10 + u.e + 1)
+  ) : new f(i + "").e, r > f.maxE + 1 || r < f.minE - 1 ? new f(r > 0 ? o / 0 : 0) : (w = !1, f.rounding = u.s = 1, i = Math.min(12, (r + "").length), s = dn(n.times(C(u, e + i)), e), s.d && (s = g(s, e + 5, 1), j(s.d, e, t) && (r = e + 10, s = g(
+    dn(n.times(C(u, r + i)), r),
+    r + 5,
+    1
+  ), +q(s.d).slice(e + 1, e + 15) + 1 == 1e14 && (s = g(s, e + 1, 0)))), s.s = o, w = !0, f.rounding = t, g(s, e, t));
+};
+h.toPrecision = function(n, r) {
+  var i, e = this, s = e.constructor;
+  return n === void 0 ? i = L(e, e.e <= s.toExpNeg || e.e >= s.toExpPos) : (P(n, 1, B), r === void 0 ? r = s.rounding : P(r, 0, 8), e = g(new s(e), n, r), i = L(e, n <= e.e || e.e <= s.toExpNeg, n)), e.isNeg() && !e.isZero() ? "-" + i : i;
+};
+h.toSignificantDigits = h.toSD = function(n, r) {
+  var i = this, e = i.constructor;
+  return n === void 0 ? (n = e.precision, r = e.rounding) : (P(n, 1, B), r === void 0 ? r = e.rounding : P(r, 0, 8)), g(new e(i), n, r);
+};
+h.toString = function() {
+  var n = this, r = n.constructor, i = L(n, n.e <= r.toExpNeg || n.e >= r.toExpPos);
+  return n.isNeg() && !n.isZero() ? "-" + i : i;
+};
+h.truncated = h.trunc = function() {
+  return g(new this.constructor(this), this.e + 1, 1);
+};
+h.valueOf = h.toJSON = function() {
+  var n = this, r = n.constructor, i = L(n, n.e <= r.toExpNeg || n.e >= r.toExpPos);
+  return n.isNeg() ? "-" + i : i;
+};
+function q(n) {
+  var r, i, e, s = n.length - 1, t = "", o = n[0];
+  if (s > 0) {
+    for (t += o, r = 1; r < s; r++)
+      e = n[r] + "", i = m - e.length, i && (t += I(i)), t += e;
+    o = n[r], e = o + "", i = m - e.length, i && (t += I(i));
+  } else if (o === 0)
+    return "0";
+  for (; o % 10 === 0; ) o /= 10;
+  return t + o;
+}
+function P(n, r, i) {
+  if (n !== ~~n || n < r || n > i)
+    throw Error(H + n);
+}
+function j(n, r, i, e) {
+  var s, t, o, u;
+  for (t = n[0]; t >= 10; t /= 10) --r;
+  return --r < 0 ? (r += m, s = 0) : (s = Math.ceil((r + 1) / m), r %= m), t = M(10, m - r), u = n[s] % t | 0, e == null ? r < 3 ? (r == 0 ? u = u / 100 | 0 : r == 1 && (u = u / 10 | 0), o = i < 4 && u == 99999 || i > 3 && u == 49999 || u == 5e4 || u == 0) : o = (i < 4 && u + 1 == t || i > 3 && u + 1 == t / 2) && (n[s + 1] / t / 100 | 0) == M(10, r - 2) - 1 || (u == t / 2 || u == 0) && (n[s + 1] / t / 100 | 0) == 0 : r < 4 ? (r == 0 ? u = u / 1e3 | 0 : r == 1 ? u = u / 100 | 0 : r == 2 && (u = u / 10 | 0), o = (e || i < 4) && u == 9999 || !e && i > 3 && u == 4999) : o = ((e || i < 4) && u + 1 == t || !e && i > 3 && u + 1 == t / 2) && (n[s + 1] / t / 1e3 | 0) == M(10, r - 3) - 1, o;
+}
+function K(n, r, i) {
+  for (var e, s = [0], t, o = 0, u = n.length; o < u; ) {
+    for (t = s.length; t--; ) s[t] *= r;
+    for (s[0] += fn.indexOf(n.charAt(o++)), e = 0; e < s.length; e++)
+      s[e] > i - 1 && (s[e + 1] === void 0 && (s[e + 1] = 0), s[e + 1] += s[e] / i | 0, s[e] %= i);
+  }
+  return s.reverse();
+}
+function Un(n, r) {
+  var i, e, s;
+  if (r.isZero()) return r;
+  e = r.d.length, e < 32 ? (i = Math.ceil(e / 3), s = (1 / tn(4, i)).toString()) : (i = 16, s = "2.3283064365386962890625e-10"), n.precision += i, r = V(n, 1, r.times(s), new n(1));
+  for (var t = i; t--; ) {
+    var o = r.times(r);
+    r = o.times(o).minus(o).times(8).plus(1);
+  }
+  return n.precision -= i, r;
+}
+var E = /* @__PURE__ */ function() {
+  function n(e, s, t) {
+    var o, u = 0, f = e.length;
+    for (e = e.slice(); f--; )
+      o = e[f] * s + u, e[f] = o % t | 0, u = o / t | 0;
+    return u && e.unshift(u), e;
+  }
+  function r(e, s, t, o) {
+    var u, f;
+    if (t != o)
+      f = t > o ? 1 : -1;
+    else
+      for (u = f = 0; u < t; u++)
+        if (e[u] != s[u]) {
+          f = e[u] > s[u] ? 1 : -1;
+          break;
+        }
+    return f;
+  }
+  function i(e, s, t, o) {
+    for (var u = 0; t--; )
+      e[t] -= u, u = e[t] < s[t] ? 1 : 0, e[t] = u * o + e[t] - s[t];
+    for (; !e[0] && e.length > 1; ) e.shift();
+  }
+  return function(e, s, t, o, u, f) {
+    var c, a, l, d, p, v, N, D, y, R, b, O, W, U, sn, J, $, on, S, z, G = e.constructor, un = e.s == s.s ? 1 : -1, F = e.d, x = s.d;
+    if (!F || !F[0] || !x || !x[0])
+      return new G(
+        // Return NaN if either NaN, or both Infinity or 0.
+        !e.s || !s.s || (F ? x && F[0] == x[0] : !x) ? NaN : (
+          // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.
+          F && F[0] == 0 || !x ? un * 0 : un / 0
+        )
+      );
+    for (f ? (p = 1, a = e.e - s.e) : (f = T, p = m, a = A(e.e / p) - A(s.e / p)), S = x.length, $ = F.length, y = new G(un), R = y.d = [], l = 0; x[l] == (F[l] || 0); l++) ;
+    if (x[l] > (F[l] || 0) && a--, t == null ? (U = t = G.precision, o = G.rounding) : u ? U = t + (e.e - s.e) + 1 : U = t, U < 0)
+      R.push(1), v = !0;
+    else {
+      if (U = U / p + 2 | 0, l = 0, S == 1) {
+        for (d = 0, x = x[0], U++; (l < $ || d) && U--; l++)
+          sn = d * f + (F[l] || 0), R[l] = sn / x | 0, d = sn % x | 0;
+        v = d || l < $;
+      } else {
+        for (d = f / (x[0] + 1) | 0, d > 1 && (x = n(x, d, f), F = n(F, d, f), S = x.length, $ = F.length), J = S, b = F.slice(0, S), O = b.length; O < S; ) b[O++] = 0;
+        z = x.slice(), z.unshift(0), on = x[0], x[1] >= f / 2 && ++on;
+        do
+          d = 0, c = r(x, b, S, O), c < 0 ? (W = b[0], S != O && (W = W * f + (b[1] || 0)), d = W / on | 0, d > 1 ? (d >= f && (d = f - 1), N = n(x, d, f), D = N.length, O = b.length, c = r(N, b, D, O), c == 1 && (d--, i(N, S < D ? z : x, D, f))) : (d == 0 && (c = d = 1), N = x.slice()), D = N.length, D < O && N.unshift(0), i(b, N, O, f), c == -1 && (O = b.length, c = r(x, b, S, O), c < 1 && (d++, i(b, S < O ? z : x, O, f))), O = b.length) : c === 0 && (d++, b = [0]), R[l++] = d, c && b[0] ? b[O++] = F[J] || 0 : (b = [F[J]], O = 1);
+        while ((J++ < $ || b[0] !== void 0) && U--);
+        v = b[0] !== void 0;
+      }
+      R[0] || R.shift();
+    }
+    if (p == 1)
+      y.e = a, wn = v;
+    else {
+      for (l = 1, d = R[0]; d >= 10; d /= 10) l++;
+      y.e = l + a * p - 1, g(y, u ? t + y.e + 1 : t, o, v);
+    }
+    return y;
+  };
+}();
+function g(n, r, i, e) {
+  var s, t, o, u, f, c, a, l, d, p = n.constructor;
+  n: if (r != null) {
+    if (l = n.d, !l) return n;
+    for (s = 1, u = l[0]; u >= 10; u /= 10) s++;
+    if (t = r - s, t < 0)
+      t += m, o = r, a = l[d = 0], f = a / M(10, s - o - 1) % 10 | 0;
+    else if (d = Math.ceil((t + 1) / m), u = l.length, d >= u)
+      if (e) {
+        for (; u++ <= d; ) l.push(0);
+        a = f = 0, s = 1, t %= m, o = t - m + 1;
+      } else
+        break n;
+    else {
+      for (a = u = l[d], s = 1; u >= 10; u /= 10) s++;
+      t %= m, o = t - m + s, f = o < 0 ? 0 : a / M(10, s - o - 1) % 10 | 0;
+    }
+    if (e = e || r < 0 || l[d + 1] !== void 0 || (o < 0 ? a : a % M(10, s - o - 1)), c = i < 4 ? (f || e) && (i == 0 || i == (n.s < 0 ? 3 : 2)) : f > 5 || f == 5 && (i == 4 || e || i == 6 && // Check whether the digit to the left of the rounding digit is odd.
+    (t > 0 ? o > 0 ? a / M(10, s - o) : 0 : l[d - 1]) % 10 & 1 || i == (n.s < 0 ? 8 : 7)), r < 1 || !l[0])
+      return l.length = 0, c ? (r -= n.e + 1, l[0] = M(10, (m - r % m) % m), n.e = -r || 0) : l[0] = n.e = 0, n;
+    if (t == 0 ? (l.length = d, u = 1, d--) : (l.length = d + 1, u = M(10, m - t), l[d] = o > 0 ? (a / M(10, s - o) % M(10, o) | 0) * u : 0), c)
+      for (; ; )
+        if (d == 0) {
+          for (t = 1, o = l[0]; o >= 10; o /= 10) t++;
+          for (o = l[0] += u, u = 1; o >= 10; o /= 10) u++;
+          t != u && (n.e++, l[0] == T && (l[0] = 1));
+          break;
+        } else {
+          if (l[d] += u, l[d] != T) break;
+          l[d--] = 0, u = 1;
+        }
+    for (t = l.length; l[--t] === 0; ) l.pop();
+  }
+  return w && (n.e > p.maxE ? (n.d = null, n.e = NaN) : n.e < p.minE && (n.e = 0, n.d = [0])), n;
+}
+function L(n, r, i) {
+  if (!n.isFinite()) return qn(n);
+  var e, s = n.e, t = q(n.d), o = t.length;
+  return r ? (i && (e = i - o) > 0 ? t = t.charAt(0) + "." + t.slice(1) + I(e) : o > 1 && (t = t.charAt(0) + "." + t.slice(1)), t = t + (n.e < 0 ? "e" : "e+") + n.e) : s < 0 ? (t = "0." + I(-s - 1) + t, i && (e = i - o) > 0 && (t += I(e))) : s >= o ? (t += I(s + 1 - o), i && (e = i - s - 1) > 0 && (t = t + "." + I(e))) : ((e = s + 1) < o && (t = t.slice(0, e) + "." + t.slice(e)), i && (e = i - o) > 0 && (s + 1 === o && (t += "."), t += I(e))), t;
+}
+function en(n, r) {
+  var i = n[0];
+  for (r *= m; i >= 10; i /= 10) r++;
+  return r;
+}
+function nn(n, r, i) {
+  if (r > Ln)
+    throw w = !0, i && (n.precision = i), Error(Nn);
+  return g(new n(X), r, 1, !0);
+}
+function _(n, r, i) {
+  if (r > ln) throw Error(Nn);
+  return g(new n(Y), r, i, !0);
+}
+function xn(n) {
+  var r = n.length - 1, i = r * m + 1;
+  if (r = n[r], r) {
+    for (; r % 10 == 0; r /= 10) i--;
+    for (r = n[0]; r >= 10; r /= 10) i++;
+  }
+  return i;
+}
+function I(n) {
+  for (var r = ""; n--; ) r += "0";
+  return r;
+}
+function yn(n, r, i, e) {
+  var s, t = new n(1), o = Math.ceil(e / m + 4);
+  for (w = !1; ; ) {
+    if (i % 2 && (t = t.times(r), pn(t.d, o) && (s = !0)), i = A(i / 2), i === 0) {
+      i = t.d.length - 1, s && t.d[i] === 0 && ++t.d[i];
+      break;
+    }
+    r = r.times(r), pn(r.d, o);
+  }
+  return w = !0, t;
+}
+function gn(n) {
+  return n.d[n.d.length - 1] & 1;
+}
+function Mn(n, r, i) {
+  for (var e, s, t = new n(r[0]), o = 0; ++o < r.length; ) {
+    if (s = new n(r[o]), !s.s) {
+      t = s;
+      break;
+    }
+    e = t.cmp(s), (e === i || e === 0 && t.s === i) && (t = s);
+  }
+  return t;
+}
+function dn(n, r) {
+  var i, e, s, t, o, u, f, c = 0, a = 0, l = 0, d = n.constructor, p = d.rounding, v = d.precision;
+  if (!n.d || !n.d[0] || n.e > 17)
+    return new d(
+      n.d ? n.d[0] ? n.s < 0 ? 0 : 1 / 0 : 1 : n.s ? n.s < 0 ? 0 : n : NaN
+    );
+  for (r == null ? (w = !1, f = v) : f = r, u = new d(0.03125); n.e > -2; )
+    n = n.times(u), l += 5;
+  for (e = Math.log(M(2, l)) / Math.LN10 * 2 + 5 | 0, f += e, i = t = o = new d(1), d.precision = f; ; ) {
+    if (t = g(t.times(n), f, 1), i = i.times(++a), u = o.plus(E(t, i, f, 1)), q(u.d).slice(0, f) === q(o.d).slice(0, f)) {
+      for (s = l; s--; ) o = g(o.times(o), f, 1);
+      if (r == null)
+        if (c < 3 && j(o.d, f - e, p, c))
+          d.precision = f += 10, i = t = u = new d(1), a = 0, c++;
+        else
+          return g(o, d.precision = v, p, w = !0);
+      else
+        return d.precision = v, o;
+    }
+    o = u;
+  }
+}
+function C(n, r) {
+  var i, e, s, t, o, u, f, c, a, l, d, p = 1, v = 10, N = n, D = N.d, y = N.constructor, R = y.rounding, b = y.precision;
+  if (N.s < 0 || !D || !D[0] || !N.e && D[0] == 1 && D.length == 1)
+    return new y(D && !D[0] ? -1 / 0 : N.s != 1 ? NaN : D ? 0 : N);
+  if (r == null ? (w = !1, a = b) : a = r, y.precision = a += v, i = q(D), e = i.charAt(0), Math.abs(t = N.e) < 15e14) {
+    for (; e < 7 && e != 1 || e == 1 && i.charAt(1) > 3; )
+      N = N.times(n), i = q(N.d), e = i.charAt(0), p++;
+    t = N.e, e > 1 ? (N = new y("0." + i), t++) : N = new y(e + "." + i.slice(1));
+  } else
+    return c = nn(y, a + 2, b).times(t + ""), N = C(new y(e + "." + i.slice(1)), a - v).plus(c), y.precision = b, r == null ? g(N, b, R, w = !0) : N;
+  for (l = N, f = o = N = E(N.minus(1), N.plus(1), a, 1), d = g(N.times(N), a, 1), s = 3; ; ) {
+    if (o = g(o.times(d), a, 1), c = f.plus(E(o, new y(s), a, 1)), q(c.d).slice(0, a) === q(f.d).slice(0, a))
+      if (f = f.times(2), t !== 0 && (f = f.plus(nn(y, a + 2, b).times(t + ""))), f = E(f, new y(p), a, 1), r == null)
+        if (j(f.d, a - v, R, u))
+          y.precision = a += v, c = o = N = E(l.minus(1), l.plus(1), a, 1), d = g(N.times(N), a, 1), s = u = 1;
+        else
+          return g(f, y.precision = b, R, w = !0);
+      else
+        return y.precision = b, f;
+    f = c, s += 2;
+  }
+}
+function qn(n) {
+  return String(n.s * n.s / 0);
+}
+function Q(n, r) {
+  var i, e, s;
+  for ((i = r.indexOf(".")) > -1 && (r = r.replace(".", "")), (e = r.search(/e/i)) > 0 ? (i < 0 && (i = e), i += +r.slice(e + 1), r = r.substring(0, e)) : i < 0 && (i = r.length), e = 0; r.charCodeAt(e) === 48; e++) ;
+  for (s = r.length; r.charCodeAt(s - 1) === 48; --s) ;
+  if (r = r.slice(e, s), r) {
+    if (s -= e, n.e = i = i - e - 1, n.d = [], e = (i + 1) % m, i < 0 && (e += m), e < s) {
+      for (e && n.d.push(+r.slice(0, e)), s -= m; e < s; ) n.d.push(+r.slice(e, e += m));
+      r = r.slice(e), e = m - r.length;
+    } else
+      e -= s;
+    for (; e--; ) r += "0";
+    n.d.push(+r), w && (n.e > n.constructor.maxE ? (n.d = null, n.e = NaN) : n.e < n.constructor.minE && (n.e = 0, n.d = [0]));
+  } else
+    n.e = 0, n.d = [0];
+  return n;
+}
+function kn(n, r) {
+  var i, e, s, t, o, u, f, c, a;
+  if (r.indexOf("_") > -1) {
+    if (r = r.replace(/(\d)_(?=\d)/g, "$1"), En.test(r)) return Q(n, r);
+  } else if (r === "Infinity" || r === "NaN")
+    return +r || (n.s = NaN), n.e = NaN, n.d = null, n;
+  if (Sn.test(r))
+    i = 16, r = r.toLowerCase();
+  else if (Rn.test(r))
+    i = 2;
+  else if (Tn.test(r))
+    i = 8;
+  else
+    throw Error(H + r);
+  for (t = r.search(/p/i), t > 0 ? (f = +r.slice(t + 1), r = r.substring(2, t)) : r = r.slice(2), t = r.indexOf("."), o = t >= 0, e = n.constructor, o && (r = r.replace(".", ""), u = r.length, t = u - t, s = yn(e, new e(i), t, t * 2)), c = K(r, i, T), a = c.length - 1, t = a; c[t] === 0; --t) c.pop();
+  return t < 0 ? new e(n.s * 0) : (n.e = en(c, a), n.d = c, w = !1, o && (n = E(n, s, u * 4)), f && (n = n.times(Math.abs(f) < 54 ? M(2, f) : Z.pow(2, f))), w = !0, n);
+}
+function In(n, r) {
+  var i, e = r.d.length;
+  if (e < 3)
+    return r.isZero() ? r : V(n, 2, r, r);
+  i = 1.4 * Math.sqrt(e), i = i > 16 ? 16 : i | 0, r = r.times(1 / tn(5, i)), r = V(n, 2, r, r);
+  for (var s, t = new n(5), o = new n(16), u = new n(20); i--; )
+    s = r.times(r), r = r.times(t.plus(s.times(o.times(s).minus(u))));
+  return r;
+}
+function V(n, r, i, e, s) {
+  var t, o, u, f, c = n.precision, a = Math.ceil(c / m);
+  for (w = !1, f = i.times(i), u = new n(e); ; ) {
+    if (o = E(u.times(f), new n(r++ * r++), c, 1), u = s ? e.plus(o) : e.minus(o), e = E(o.times(f), new n(r++ * r++), c, 1), o = u.plus(e), o.d[a] !== void 0) {
+      for (t = a; o.d[t] === u.d[t] && t--; ) ;
+      if (t == -1) break;
+    }
+    t = u, u = e, e = o, o = t;
+  }
+  return w = !0, o.d.length = a + 1, o;
+}
+function tn(n, r) {
+  for (var i = n; --r; ) i *= n;
+  return i;
+}
+function On(n, r) {
+  var i, e = r.s < 0, s = _(n, n.precision, 1), t = s.times(0.5);
+  if (r = r.abs(), r.lte(t))
+    return k = e ? 4 : 1, r;
+  if (i = r.divToInt(s), i.isZero())
+    k = e ? 3 : 2;
+  else {
+    if (r = r.minus(i.times(s)), r.lte(t))
+      return k = gn(i) ? e ? 2 : 3 : e ? 4 : 1, r;
+    k = gn(i) ? e ? 1 : 4 : e ? 3 : 2;
+  }
+  return r.minus(s).abs();
+}
+function hn(n, r, i, e) {
+  var s, t, o, u, f, c, a, l, d, p = n.constructor, v = i !== void 0;
+  if (v ? (P(i, 1, B), e === void 0 ? e = p.rounding : P(e, 0, 8)) : (i = p.precision, e = p.rounding), !n.isFinite())
+    a = qn(n);
+  else {
+    for (a = L(n), o = a.indexOf("."), v ? (s = 2, r == 16 ? i = i * 4 - 3 : r == 8 && (i = i * 3 - 2)) : s = r, o >= 0 && (a = a.replace(".", ""), d = new p(1), d.e = a.length - o, d.d = K(L(d), 10, s), d.e = d.d.length), l = K(a, 10, s), t = f = l.length; l[--f] == 0; ) l.pop();
+    if (!l[0])
+      a = v ? "0p+0" : "0";
+    else {
+      if (o < 0 ? t-- : (n = new p(n), n.d = l, n.e = t, n = E(n, d, i, e, 0, s), l = n.d, t = n.e, c = wn), o = l[i], u = s / 2, c = c || l[i + 1] !== void 0, c = e < 4 ? (o !== void 0 || c) && (e === 0 || e === (n.s < 0 ? 3 : 2)) : o > u || o === u && (e === 4 || c || e === 6 && l[i - 1] & 1 || e === (n.s < 0 ? 8 : 7)), l.length = i, c)
+        for (; ++l[--i] > s - 1; )
+          l[i] = 0, i || (++t, l.unshift(1));
+      for (f = l.length; !l[f - 1]; --f) ;
+      for (o = 0, a = ""; o < f; o++) a += fn.charAt(l[o]);
+      if (v) {
+        if (f > 1)
+          if (r == 16 || r == 8) {
+            for (o = r == 16 ? 4 : 3, --f; f % o; f++) a += "0";
+            for (l = K(a, s, r), f = l.length; !l[f - 1]; --f) ;
+            for (o = 1, a = "1."; o < f; o++) a += fn.charAt(l[o]);
+          } else
+            a = a.charAt(0) + "." + a.slice(1);
+        a = a + (t < 0 ? "p" : "p+") + t;
+      } else if (t < 0) {
+        for (; ++t; ) a = "0" + a;
+        a = "0." + a;
+      } else if (++t > f) for (t -= f; t--; ) a += "0";
+      else t < f && (a = a.slice(0, t) + "." + a.slice(t));
+    }
+    a = (r == 16 ? "0x" : r == 2 ? "0b" : r == 8 ? "0o" : "") + a;
+  }
+  return n.s < 0 ? "-" + a : a;
+}
+function pn(n, r) {
+  if (n.length > r)
+    return n.length = r, !0;
+}
+function Cn(n) {
+  return new this(n).abs();
+}
+function Hn(n) {
+  return new this(n).acos();
+}
+function Bn(n) {
+  return new this(n).acosh();
+}
+function Vn(n, r) {
+  return new this(n).plus(r);
+}
+function $n(n) {
+  return new this(n).asin();
+}
+function jn(n) {
+  return new this(n).asinh();
+}
+function Wn(n) {
+  return new this(n).atan();
+}
+function Jn(n) {
+  return new this(n).atanh();
+}
+function zn(n, r) {
+  n = new this(n), r = new this(r);
+  var i, e = this.precision, s = this.rounding, t = e + 4;
+  return !n.s || !r.s ? i = new this(NaN) : !n.d && !r.d ? (i = _(this, t, 1).times(r.s > 0 ? 0.25 : 0.75), i.s = n.s) : !r.d || n.isZero() ? (i = r.s < 0 ? _(this, e, s) : new this(0), i.s = n.s) : !n.d || r.isZero() ? (i = _(this, t, 1).times(0.5), i.s = n.s) : r.s < 0 ? (this.precision = t, this.rounding = 1, i = this.atan(E(n, r, t, 1)), r = _(this, t, 1), this.precision = e, this.rounding = s, i = n.s < 0 ? i.minus(r) : i.plus(r)) : i = this.atan(E(n, r, t, 1)), i;
+}
+function Gn(n) {
+  return new this(n).cbrt();
+}
+function Kn(n) {
+  return g(n = new this(n), n.e + 1, 2);
+}
+function Qn(n, r, i) {
+  return new this(n).clamp(r, i);
+}
+function Xn(n) {
+  if (!n || typeof n != "object")
+    throw Error(rn + "Object expected");
+  var r, i, e, s = n.defaults === !0, t = [
+    "precision",
+    1,
+    B,
+    "rounding",
+    0,
+    8,
+    "toExpNeg",
+    -9e15,
+    0,
+    "toExpPos",
+    0,
+    cn,
+    "maxE",
+    0,
+    cn,
+    "minE",
+    -9e15,
+    0,
+    "modulo",
+    0,
+    9
+  ];
+  for (r = 0; r < t.length; r += 3)
+    if (i = t[r], s && (this[i] = an[i]), (e = n[i]) !== void 0)
+      if (A(e) === e && e >= t[r + 1] && e <= t[r + 2]) this[i] = e;
+      else throw Error(H + i + ": " + e);
+  if (i = "crypto", s && (this[i] = an[i]), (e = n[i]) !== void 0)
+    if (e === !0 || e === !1 || e === 0 || e === 1)
+      if (e)
+        if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes))
+          this[i] = !0;
+        else
+          throw Error(vn);
+      else
+        this[i] = !1;
+    else
+      throw Error(H + i + ": " + e);
+  return this;
+}
+function Yn(n) {
+  return new this(n).cos();
+}
+function nr(n) {
+  return new this(n).cosh();
+}
+function Fn(n) {
+  var r, i, e;
+  function s(t) {
+    var o, u, f, c = this;
+    if (!(c instanceof s)) return new s(t);
+    if (c.constructor = s, mn(t)) {
+      c.s = t.s, w ? !t.d || t.e > s.maxE ? (c.e = NaN, c.d = null) : t.e < s.minE ? (c.e = 0, c.d = [0]) : (c.e = t.e, c.d = t.d.slice()) : (c.e = t.e, c.d = t.d ? t.d.slice() : t.d);
+      return;
+    }
+    if (f = typeof t, f === "number") {
+      if (t === 0) {
+        c.s = 1 / t < 0 ? -1 : 1, c.e = 0, c.d = [0];
+        return;
+      }
+      if (t < 0 ? (t = -t, c.s = -1) : c.s = 1, t === ~~t && t < 1e7) {
+        for (o = 0, u = t; u >= 10; u /= 10) o++;
+        w ? o > s.maxE ? (c.e = NaN, c.d = null) : o < s.minE ? (c.e = 0, c.d = [0]) : (c.e = o, c.d = [t]) : (c.e = o, c.d = [t]);
+        return;
+      }
+      if (t * 0 !== 0) {
+        t || (c.s = NaN), c.e = NaN, c.d = null;
+        return;
+      }
+      return Q(c, t.toString());
+    }
+    if (f === "string")
+      return (u = t.charCodeAt(0)) === 45 ? (t = t.slice(1), c.s = -1) : (u === 43 && (t = t.slice(1)), c.s = 1), En.test(t) ? Q(c, t) : kn(c, t);
+    if (f === "bigint")
+      return t < 0 ? (t = -t, c.s = -1) : c.s = 1, Q(c, t.toString());
+    throw Error(H + t);
+  }
+  if (s.prototype = h, s.ROUND_UP = 0, s.ROUND_DOWN = 1, s.ROUND_CEIL = 2, s.ROUND_FLOOR = 3, s.ROUND_HALF_UP = 4, s.ROUND_HALF_DOWN = 5, s.ROUND_HALF_EVEN = 6, s.ROUND_HALF_CEIL = 7, s.ROUND_HALF_FLOOR = 8, s.EUCLID = 9, s.config = s.set = Xn, s.clone = Fn, s.isDecimal = mn, s.abs = Cn, s.acos = Hn, s.acosh = Bn, s.add = Vn, s.asin = $n, s.asinh = jn, s.atan = Wn, s.atanh = Jn, s.atan2 = zn, s.cbrt = Gn, s.ceil = Kn, s.clamp = Qn, s.cos = Yn, s.cosh = nr, s.div = rr, s.exp = ir, s.floor = er, s.hypot = tr, s.ln = sr, s.log = or, s.log10 = cr, s.log2 = ur, s.max = fr, s.min = ar, s.mod = lr, s.mul = dr, s.pow = hr, s.random = gr, s.round = pr, s.sign = mr, s.sin = wr, s.sinh = Nr, s.sqrt = vr, s.sub = br, s.sum = Er, s.tan = xr, s.tanh = yr, s.trunc = Mr, n === void 0 && (n = {}), n && n.defaults !== !0)
+    for (e = [
+      "precision",
+      "rounding",
+      "toExpNeg",
+      "toExpPos",
+      "maxE",
+      "minE",
+      "modulo",
+      "crypto"
+    ], r = 0; r < e.length; )
+      n.hasOwnProperty(i = e[r++]) || (n[i] = this[i]);
+  return s.config(n), s;
+}
+function rr(n, r) {
+  return new this(n).div(r);
+}
+function ir(n) {
+  return new this(n).exp();
+}
+function er(n) {
+  return g(n = new this(n), n.e + 1, 3);
+}
+function tr() {
+  var n, r, i = new this(0);
+  for (w = !1, n = 0; n < arguments.length; )
+    if (r = new this(arguments[n++]), r.d)
+      i.d && (i = i.plus(r.times(r)));
+    else {
+      if (r.s)
+        return w = !0, new this(1 / 0);
+      i = r;
+    }
+  return w = !0, i.sqrt();
+}
+function mn(n) {
+  return n instanceof Z || n && n.toStringTag === bn || !1;
+}
+function sr(n) {
+  return new this(n).ln();
+}
+function or(n, r) {
+  return new this(n).log(r);
+}
+function ur(n) {
+  return new this(n).log(2);
+}
+function cr(n) {
+  return new this(n).log(10);
+}
+function fr() {
+  return Mn(this, arguments, -1);
+}
+function ar() {
+  return Mn(this, arguments, 1);
+}
+function lr(n, r) {
+  return new this(n).mod(r);
+}
+function dr(n, r) {
+  return new this(n).mul(r);
+}
+function hr(n, r) {
+  return new this(n).pow(r);
+}
+function gr(n) {
+  var r, i, e, s, t = 0, o = new this(1), u = [];
+  if (n === void 0 ? n = this.precision : P(n, 1, B), e = Math.ceil(n / m), this.crypto)
+    if (crypto.getRandomValues)
+      for (r = crypto.getRandomValues(new Uint32Array(e)); t < e; )
+        s = r[t], s >= 429e7 ? r[t] = crypto.getRandomValues(new Uint32Array(1))[0] : u[t++] = s % 1e7;
+    else if (crypto.randomBytes) {
+      for (r = crypto.randomBytes(e *= 4); t < e; )
+        s = r[t] + (r[t + 1] << 8) + (r[t + 2] << 16) + ((r[t + 3] & 127) << 24), s >= 214e7 ? crypto.randomBytes(4).copy(r, t) : (u.push(s % 1e7), t += 4);
+      t = e / 4;
+    } else
+      throw Error(vn);
+  else for (; t < e; ) u[t++] = Math.random() * 1e7 | 0;
+  for (e = u[--t], n %= m, e && n && (s = M(10, m - n), u[t] = (e / s | 0) * s); u[t] === 0; t--) u.pop();
+  if (t < 0)
+    i = 0, u = [0];
+  else {
+    for (i = -1; u[0] === 0; i -= m) u.shift();
+    for (e = 1, s = u[0]; s >= 10; s /= 10) e++;
+    e < m && (i -= m - e);
+  }
+  return o.e = i, o.d = u, o;
+}
+function pr(n) {
+  return g(n = new this(n), n.e + 1, this.rounding);
+}
+function mr(n) {
+  return n = new this(n), n.d ? n.d[0] ? n.s : 0 * n.s : n.s || NaN;
+}
+function wr(n) {
+  return new this(n).sin();
+}
+function Nr(n) {
+  return new this(n).sinh();
+}
+function vr(n) {
+  return new this(n).sqrt();
+}
+function br(n, r) {
+  return new this(n).sub(r);
+}
+function Er() {
+  var n = 0, r = arguments, i = new this(r[n]);
+  for (w = !1; i.s && ++n < r.length; ) i = i.plus(r[n]);
+  return w = !0, g(i, this.precision, this.rounding);
+}
+function xr(n) {
+  return new this(n).tan();
+}
+function yr(n) {
+  return new this(n).tanh();
+}
+function Mr(n) {
+  return g(n = new this(n), n.e + 1, 1);
+}
+Z = Fn(an);
+Z.prototype.constructor = Z;
+Z.default = Z.Decimal = Z;
+X = new Z(X);
+Y = new Z(Y);
+function An(n, r) {
+  return new Z(n).plus(r).toNumber();
+}
+function Dn(n, r) {
+  return new Z(n).minus(r).toNumber();
+}
+function Zn(n, r) {
+  return new Z(n).times(r).toNumber();
+}
+function Pn(n, r) {
+  return new Z(n).div(r).toNumber();
+}
+const qr = An, Or = Dn, Fr = Zn, Ar = Pn, Dr = {
+  plus: An,
+  minus: Dn,
+  times: Zn,
+  div: Pn,
+  add: qr,
+  subtract: Or,
+  multiply: Fr,
+  divide: Ar
+};
+export {
+  Fr as c,
+  Ar as d,
+  Dn as i,
+  Dr as l,
+  Or as m,
+  Zn as o,
+  Pn as r,
+  qr as s,
+  An as u
+};