@unicom-cloud/ui 0.8.55 → 0.8.56

package/chunk/Lk60-jkf.js

@@ -0,0 +1,1098 @@
+/*!
+ *  decimal.js v10.4.3
+ *  An arbitrary-precision Decimal type for JavaScript.
+ *  https://github.com/MikeMcl/decimal.js
+ *  Copyright (c) 2022 Michael Mclaughlin <M8ch88l@gmail.com>
+ *  MIT Licence
+ */
+let V = 9e15, H = 1e9, cn = "0123456789abcdef", X = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", Y = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", ln = {
+  // 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: -V,
+  // -1 to -EXP_LIMIT
+  // The maximum exponent value, above which overflow to Infinity occurs.
+  // JavaScript numbers: 308  (1.7976931348623157e+308)
+  maxE: V,
+  // 1 to EXP_LIMIT
+  // Whether to use cryptographically-secure random number generation, if available.
+  crypto: !1
+  // true/false
+}, wn, L, w = !0, tn = "[DecimalError] ", C = tn + "Invalid argument: ", Nn = tn + "Precision limit exceeded", bn = tn + "crypto unavailable", En = "[object Decimal]", A = Math.floor, M = Math.pow, Pn = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, Rn = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, Tn = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, vn = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, T = 1e7, m = 7, _n = 9007199254740991, kn = X.length - 1, fn = Y.length - 1, a = { toStringTag: En };
+a.absoluteValue = a.abs = function() {
+  let n = new this.constructor(this);
+  return n.s < 0 && (n.s = 1), g(n);
+};
+a.ceil = function() {
+  return g(new this.constructor(this), this.e + 1, 2);
+};
+a.clampedTo = a.clamp = function(n, t) {
+  let e, r = this, i = r.constructor;
+  if (n = new i(n), t = new i(t), !n.s || !t.s) return new i(NaN);
+  if (n.gt(t)) throw Error(C + t);
+  return e = r.cmp(n), e < 0 ? n : r.cmp(t) > 0 ? t : new i(r);
+};
+a.comparedTo = a.cmp = function(n) {
+  let t, e, r, i, s = this, o = s.d, u = (n = new s.constructor(n)).d, l = s.s, c = n.s;
+  if (!o || !u)
+    return !l || !c ? NaN : l !== c ? l : o === u ? 0 : !o ^ l < 0 ? 1 : -1;
+  if (!o[0] || !u[0]) return o[0] ? l : u[0] ? -c : 0;
+  if (l !== c) return l;
+  if (s.e !== n.e) return s.e > n.e ^ l < 0 ? 1 : -1;
+  for (r = o.length, i = u.length, t = 0, e = r < i ? r : i; t < e; ++t)
+    if (o[t] !== u[t]) return o[t] > u[t] ^ l < 0 ? 1 : -1;
+  return r === i ? 0 : r > i ^ l < 0 ? 1 : -1;
+};
+a.cosine = a.cos = function() {
+  let n, t, e = this, r = e.constructor;
+  return e.d ? e.d[0] ? (n = r.precision, t = r.rounding, r.precision = n + Math.max(e.e, e.sd()) + m, r.rounding = 1, e = Ln(r, On(r, e)), r.precision = n, r.rounding = t, g(L == 2 || L == 3 ? e.neg() : e, n, t, !0)) : new r(1) : new r(NaN);
+};
+a.cubeRoot = a.cbrt = function() {
+  let n, t, e, r, i, s, o, u, l, c, f = this, h = f.constructor;
+  if (!f.isFinite() || f.isZero()) return new h(f);
+  for (w = !1, s = f.s * M(f.s * f, 1 / 3), !s || Math.abs(s) == 1 / 0 ? (e = q(f.d), n = f.e, (s = (n - e.length + 1) % 3) && (e += s == 1 || s == -2 ? "0" : "00"), s = M(e, 1 / 3), n = A((n + 1) / 3) - (n % 3 == (n < 0 ? -1 : 2)), s == 1 / 0 ? e = "5e" + n : (e = s.toExponential(), e = e.slice(0, e.indexOf("e") + 1) + n), r = new h(e), r.s = f.s) : r = new h(s.toString()), o = (n = h.precision) + 3; ; )
+    if (u = r, l = u.times(u).times(u), c = l.plus(f), r = v(c.plus(f).times(u), c.plus(l), o + 2, 1), q(u.d).slice(0, o) === (e = q(r.d)).slice(0, o))
+      if (e = e.slice(o - 3, o + 1), e == "9999" || !i && e == "4999") {
+        if (!i && (g(u, n + 1, 0), u.times(u).times(u).eq(f))) {
+          r = u;
+          break;
+        }
+        o += 4, i = 1;
+      } else {
+        (!+e || !+e.slice(1) && e.charAt(0) == "5") && (g(r, n + 1, 1), t = !r.times(r).times(r).eq(f));
+        break;
+      }
+  return w = !0, g(r, n, h.rounding, t);
+};
+a.decimalPlaces = a.dp = function() {
+  let n, t = this.d, e = NaN;
+  if (t) {
+    if (n = t.length - 1, e = (n - A(this.e / m)) * m, n = t[n], n) for (; n % 10 == 0; n /= 10) e--;
+    e < 0 && (e = 0);
+  }
+  return e;
+};
+a.dividedBy = a.div = function(n) {
+  return v(this, new this.constructor(n));
+};
+a.dividedToIntegerBy = a.divToInt = function(n) {
+  let t = this, e = t.constructor;
+  return g(
+    v(t, new e(n), 0, 1, 1),
+    e.precision,
+    e.rounding
+  );
+};
+a.equals = a.eq = function(n) {
+  return this.cmp(n) === 0;
+};
+a.floor = function() {
+  return g(new this.constructor(this), this.e + 1, 3);
+};
+a.greaterThan = a.gt = function(n) {
+  return this.cmp(n) > 0;
+};
+a.greaterThanOrEqualTo = a.gte = function(n) {
+  let t = this.cmp(n);
+  return t == 1 || t === 0;
+};
+a.hyperbolicCosine = a.cosh = function() {
+  let n, t, e, r, i, s = this, o = s.constructor, u = new o(1);
+  if (!s.isFinite()) return new o(s.s ? 1 / 0 : NaN);
+  if (s.isZero()) return u;
+  e = o.precision, r = o.rounding, o.precision = e + Math.max(s.e, s.sd()) + 4, o.rounding = 1, i = s.d.length, i < 32 ? (n = Math.ceil(i / 3), t = (1 / rn(4, n)).toString()) : (n = 16, t = "2.3283064365386962890625e-10"), s = $(o, 1, s.times(t), new o(1), !0);
+  let l, c = n, f = new o(8);
+  for (; c--; )
+    l = s.times(s), s = u.minus(l.times(f.minus(l.times(f))));
+  return g(s, o.precision = e, o.rounding = r, !0);
+};
+a.hyperbolicSine = a.sinh = function() {
+  let n, t, e, r, i = this, s = i.constructor;
+  if (!i.isFinite() || i.isZero()) return new s(i);
+  if (t = s.precision, e = s.rounding, s.precision = t + Math.max(i.e, i.sd()) + 4, s.rounding = 1, r = i.d.length, r < 3)
+    i = $(s, 2, i, i, !0);
+  else {
+    n = 1.4 * Math.sqrt(r), n = n > 16 ? 16 : n | 0, i = i.times(1 / rn(5, n)), i = $(s, 2, i, i, !0);
+    let o, u = new s(5), l = new s(16), c = new s(20);
+    for (; n--; )
+      o = i.times(i), i = i.times(u.plus(o.times(l.times(o).plus(c))));
+  }
+  return s.precision = t, s.rounding = e, g(i, t, e, !0);
+};
+a.hyperbolicTangent = a.tanh = function() {
+  let n, t, e = this, r = e.constructor;
+  return e.isFinite() ? e.isZero() ? new r(e) : (n = r.precision, t = r.rounding, r.precision = n + 7, r.rounding = 1, v(
+    e.sinh(),
+    e.cosh(),
+    r.precision = n,
+    r.rounding = t
+  )) : new r(e.s);
+};
+a.inverseCosine = a.acos = function() {
+  let n, t = this, e = t.constructor, r = t.abs().cmp(1), i = e.precision, s = e.rounding;
+  return r !== -1 ? r === 0 ? (
+    // |x| is 1
+    t.isNeg() ? R(e, i, s) : new e(0)
+  ) : (
+    // |x| > 1 or x is NaN
+    new e(NaN)
+  ) : t.isZero() ? R(e, i + 4, s).times(0.5) : (e.precision = i + 6, e.rounding = 1, t = t.asin(), n = R(e, i + 4, s).times(0.5), e.precision = i, e.rounding = s, n.minus(t));
+};
+a.inverseHyperbolicCosine = a.acosh = function() {
+  let n, t, e = this, r = e.constructor;
+  return e.lte(1) ? new r(e.eq(1) ? 0 : NaN) : e.isFinite() ? (n = r.precision, t = r.rounding, r.precision = n + Math.max(Math.abs(e.e), e.sd()) + 4, r.rounding = 1, w = !1, e = e.times(e).minus(1).sqrt().plus(e), w = !0, r.precision = n, r.rounding = t, e.ln()) : new r(e);
+};
+a.inverseHyperbolicSine = a.asinh = function() {
+  let n, t, e = this, r = e.constructor;
+  return !e.isFinite() || e.isZero() ? new r(e) : (n = r.precision, t = r.rounding, r.precision = n + 2 * Math.max(Math.abs(e.e), e.sd()) + 6, r.rounding = 1, w = !1, e = e.times(e).plus(1).sqrt().plus(e), w = !0, r.precision = n, r.rounding = t, e.ln());
+};
+a.inverseHyperbolicTangent = a.atanh = function() {
+  let n, t, e, r, i = this, s = i.constructor;
+  return i.isFinite() ? i.e >= 0 ? new s(i.abs().eq(1) ? i.s / 0 : i.isZero() ? i : NaN) : (n = s.precision, t = s.rounding, r = i.sd(), Math.max(r, n) < 2 * -i.e - 1 ? g(new s(i), n, t, !0) : (s.precision = e = r - i.e, i = v(i.plus(1), new s(1).minus(i), e + n, 1), s.precision = n + 4, s.rounding = 1, i = i.ln(), s.precision = n, s.rounding = t, i.times(0.5))) : new s(NaN);
+};
+a.inverseSine = a.asin = function() {
+  let n, t, e, r, i = this, s = i.constructor;
+  return i.isZero() ? new s(i) : (t = i.abs().cmp(1), e = s.precision, r = s.rounding, t !== -1 ? t === 0 ? (n = R(s, e + 4, r).times(0.5), n.s = i.s, n) : new s(NaN) : (s.precision = e + 6, s.rounding = 1, i = i.div(new s(1).minus(i.times(i)).sqrt().plus(1)).atan(), s.precision = e, s.rounding = r, i.times(2)));
+};
+a.inverseTangent = a.atan = function() {
+  let n, t, e, r, i, s, o, u, l, c = this, f = c.constructor, h = f.precision, d = f.rounding;
+  if (c.isFinite()) {
+    if (c.isZero())
+      return new f(c);
+    if (c.abs().eq(1) && h + 4 <= fn)
+      return o = R(f, h + 4, d).times(0.25), o.s = c.s, o;
+  } else {
+    if (!c.s) return new f(NaN);
+    if (h + 4 <= fn)
+      return o = R(f, h + 4, d).times(0.5), o.s = c.s, o;
+  }
+  for (f.precision = u = h + 10, f.rounding = 1, e = Math.min(28, u / m + 2 | 0), n = e; n; --n) c = c.div(c.times(c).plus(1).sqrt().plus(1));
+  for (w = !1, t = Math.ceil(u / m), r = 1, l = c.times(c), o = new f(c), i = c; n !== -1; )
+    if (i = i.times(l), s = o.minus(i.div(r += 2)), i = i.times(l), o = s.plus(i.div(r += 2)), o.d[t] !== void 0) for (n = t; o.d[n] === s.d[n] && n--; ) ;
+  return e && (o = o.times(2 << e - 1)), w = !0, g(o, f.precision = h, f.rounding = d, !0);
+};
+a.isFinite = function() {
+  return !!this.d;
+};
+a.isInteger = a.isInt = function() {
+  return !!this.d && A(this.e / m) > this.d.length - 2;
+};
+a.isNaN = function() {
+  return !this.s;
+};
+a.isNegative = a.isNeg = function() {
+  return this.s < 0;
+};
+a.isPositive = a.isPos = function() {
+  return this.s > 0;
+};
+a.isZero = function() {
+  return !!this.d && this.d[0] === 0;
+};
+a.lessThan = a.lt = function(n) {
+  return this.cmp(n) < 0;
+};
+a.lessThanOrEqualTo = a.lte = function(n) {
+  return this.cmp(n) < 1;
+};
+a.logarithm = a.log = function(n) {
+  let t, e, r, i, s, o, u, l, c = this, f = c.constructor, h = f.precision, d = f.rounding, p = 5;
+  if (n == null)
+    n = new f(10), t = !0;
+  else {
+    if (n = new f(n), e = n.d, n.s < 0 || !e || !e[0] || n.eq(1)) return new f(NaN);
+    t = n.eq(10);
+  }
+  if (e = c.d, c.s < 0 || !e || !e[0] || c.eq(1))
+    return new f(e && !e[0] ? -1 / 0 : c.s != 1 ? NaN : e ? 0 : 1 / 0);
+  if (t)
+    if (e.length > 1)
+      s = !0;
+    else {
+      for (i = e[0]; i % 10 === 0; ) i /= 10;
+      s = i !== 1;
+    }
+  if (w = !1, u = h + p, o = I(c, u), r = t ? nn(f, u + 10) : I(n, u), l = v(o, r, u, 1), W(l.d, i = h, d))
+    do
+      if (u += 10, o = I(c, u), r = t ? nn(f, u + 10) : I(n, u), l = v(o, r, u, 1), !s) {
+        +q(l.d).slice(i + 1, i + 15) + 1 == 1e14 && (l = g(l, h + 1, 0));
+        break;
+      }
+    while (W(l.d, i += 10, d));
+  return w = !0, g(l, h, d);
+};
+a.minus = a.sub = function(n) {
+  let t, e, r, i, s, o, u, l, c, f, h, d, p = this, b = p.constructor;
+  if (n = new b(n), !p.d || !n.d)
+    return !p.s || !n.s ? n = new b(NaN) : p.d ? n.s = -n.s : n = new b(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 = b.precision, l = b.rounding, !c[0] || !d[0]) {
+    if (d[0]) n.s = -n.s;
+    else if (c[0]) n = new b(p);
+    else return new b(l === 3 ? -0 : 0);
+    return w ? g(n, u, l) : n;
+  }
+  if (e = A(n.e / m), f = A(p.e / m), c = c.slice(), s = f - e, s) {
+    for (h = s < 0, h ? (t = c, s = -s, o = d.length) : (t = d, e = f, o = c.length), r = Math.max(Math.ceil(u / m), o) + 2, s > r && (s = r, t.length = 1), t.reverse(), r = s; r--; ) t.push(0);
+    t.reverse();
+  } else {
+    for (r = c.length, o = d.length, h = r < o, h && (o = r), r = 0; r < o; r++)
+      if (c[r] != d[r]) {
+        h = c[r] < d[r];
+        break;
+      }
+    s = 0;
+  }
+  for (h && (t = c, c = d, d = t, n.s = -n.s), o = c.length, r = d.length - o; r > 0; --r) c[o++] = 0;
+  for (r = d.length; r > s; ) {
+    if (c[--r] < d[r]) {
+      for (i = r; i && c[--i] === 0; ) c[i] = T - 1;
+      --c[i], c[r] += T;
+    }
+    c[r] -= d[r];
+  }
+  for (; c[--o] === 0; ) c.pop();
+  for (; c[0] === 0; c.shift()) --e;
+  return c[0] ? (n.d = c, n.e = en(c, e), w ? g(n, u, l) : n) : new b(l === 3 ? -0 : 0);
+};
+a.modulo = a.mod = function(n) {
+  let t, e = this, r = e.constructor;
+  return n = new r(n), !e.d || !n.s || n.d && !n.d[0] ? new r(NaN) : !n.d || e.d && !e.d[0] ? g(new r(e), r.precision, r.rounding) : (w = !1, r.modulo == 9 ? (t = v(e, n.abs(), 0, 3, 1), t.s *= n.s) : t = v(e, n, 0, r.modulo, 1), t = t.times(n), w = !0, e.minus(t));
+};
+a.naturalExponential = a.exp = function() {
+  return hn(this);
+};
+a.naturalLogarithm = a.ln = function() {
+  return I(this);
+};
+a.negated = a.neg = function() {
+  let n = new this.constructor(this);
+  return n.s = -n.s, g(n);
+};
+a.plus = a.add = function(n) {
+  let t, e, r, i, s, o, u, l, c, f, h = this, d = h.constructor;
+  if (n = new d(n), !h.d || !n.d)
+    return !h.s || !n.s ? n = new d(NaN) : h.d || (n = new d(n.d || h.s === n.s ? h : NaN)), n;
+  if (h.s != n.s)
+    return n.s = -n.s, h.minus(n);
+  if (c = h.d, f = n.d, u = d.precision, l = d.rounding, !c[0] || !f[0])
+    return f[0] || (n = new d(h)), w ? g(n, u, l) : n;
+  if (s = A(h.e / m), r = A(n.e / m), c = c.slice(), i = s - r, i) {
+    for (i < 0 ? (e = c, i = -i, o = f.length) : (e = f, r = s, o = c.length), s = Math.ceil(u / m), o = s > o ? s + 1 : o + 1, i > o && (i = o, e.length = 1), e.reverse(); i--; ) e.push(0);
+    e.reverse();
+  }
+  for (o = c.length, i = f.length, o - i < 0 && (i = o, e = f, f = c, c = e), t = 0; i; )
+    t = (c[--i] = c[i] + f[i] + t) / T | 0, c[i] %= T;
+  for (t && (c.unshift(t), ++r), o = c.length; c[--o] == 0; ) c.pop();
+  return n.d = c, n.e = en(c, r), w ? g(n, u, l) : n;
+};
+a.precision = a.sd = function(n) {
+  let t, e = this;
+  if (n !== void 0 && n !== !!n && n !== 1 && n !== 0)
+    throw Error(C + n);
+  return e.d ? (t = xn(e.d), n && e.e + 1 > t && (t = e.e + 1)) : t = NaN, t;
+};
+a.round = function() {
+  let n = this, t = n.constructor;
+  return g(new t(n), n.e + 1, t.rounding);
+};
+a.sine = a.sin = function() {
+  let n, t, e = this, r = e.constructor;
+  return e.isFinite() ? e.isZero() ? new r(e) : (n = r.precision, t = r.rounding, r.precision = n + Math.max(e.e, e.sd()) + m, r.rounding = 1, e = In(r, On(r, e)), r.precision = n, r.rounding = t, g(L > 2 ? e.neg() : e, n, t, !0)) : new r(NaN);
+};
+a.squareRoot = a.sqrt = function() {
+  let n, t, e, r, i, s, o = this, u = o.d, l = o.e, c = o.s, f = o.constructor;
+  if (c !== 1 || !u || !u[0])
+    return new f(!c || c < 0 && (!u || u[0]) ? NaN : u ? o : 1 / 0);
+  for (w = !1, c = Math.sqrt(+o), c == 0 || c == 1 / 0 ? (t = q(u), (t.length + l) % 2 == 0 && (t += "0"), c = Math.sqrt(t), l = A((l + 1) / 2) - (l < 0 || l % 2), c == 1 / 0 ? t = "5e" + l : (t = c.toExponential(), t = t.slice(0, t.indexOf("e") + 1) + l), r = new f(t)) : r = new f(c.toString()), e = (l = f.precision) + 3; ; )
+    if (s = r, r = s.plus(v(o, s, e + 2, 1)).times(0.5), q(s.d).slice(0, e) === (t = q(r.d)).slice(0, e))
+      if (t = t.slice(e - 3, e + 1), t == "9999" || !i && t == "4999") {
+        if (!i && (g(s, l + 1, 0), s.times(s).eq(o))) {
+          r = s;
+          break;
+        }
+        e += 4, i = 1;
+      } else {
+        (!+t || !+t.slice(1) && t.charAt(0) == "5") && (g(r, l + 1, 1), n = !r.times(r).eq(o));
+        break;
+      }
+  return w = !0, g(r, l, f.rounding, n);
+};
+a.tangent = a.tan = function() {
+  let n, t, e = this, r = e.constructor;
+  return e.isFinite() ? e.isZero() ? new r(e) : (n = r.precision, t = r.rounding, r.precision = n + 10, r.rounding = 1, e = e.sin(), e.s = 1, e = v(e, new r(1).minus(e.times(e)).sqrt(), n + 10, 0), r.precision = n, r.rounding = t, g(L == 2 || L == 4 ? e.neg() : e, n, t, !0)) : new r(NaN);
+};
+a.times = a.mul = function(n) {
+  let t, e, r, i, s, o, u, l, c, f = this, h = f.constructor, d = f.d, p = (n = new h(n)).d;
+  if (n.s *= f.s, !d || !d[0] || !p || !p[0])
+    return new h(
+      !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 (e = A(f.e / m) + A(n.e / m), l = d.length, c = p.length, l < c && (s = d, d = p, p = s, o = l, l = c, c = o), s = [], o = l + c, r = o; r--; ) s.push(0);
+  for (r = c; --r >= 0; ) {
+    for (t = 0, i = l + r; i > r; )
+      u = s[i] + p[r] * d[i - r - 1] + t, s[i--] = u % T | 0, t = u / T | 0;
+    s[i] = (s[i] + t) % T | 0;
+  }
+  for (; !s[--o]; ) s.pop();
+  return t ? ++e : s.shift(), n.d = s, n.e = en(s, e), w ? g(n, h.precision, h.rounding) : n;
+};
+a.toBinary = function(n, t) {
+  return an(this, 2, n, t);
+};
+a.toDecimalPlaces = a.toDP = function(n, t) {
+  let e = this, r = e.constructor;
+  return e = new r(e), n === void 0 ? e : (D(n, 0, H), t === void 0 ? t = r.rounding : D(t, 0, 8), g(e, n + e.e + 1, t));
+};
+a.toExponential = function(n, t) {
+  let e, r = this, i = r.constructor;
+  return n === void 0 ? e = _(r, !0) : (D(n, 0, H), t === void 0 ? t = i.rounding : D(t, 0, 8), r = g(new i(r), n + 1, t), e = _(r, !0, n + 1)), r.isNeg() && !r.isZero() ? "-" + e : e;
+};
+a.toFixed = function(n, t) {
+  let e, r, i = this, s = i.constructor;
+  return n === void 0 ? e = _(i) : (D(n, 0, H), t === void 0 ? t = s.rounding : D(t, 0, 8), r = g(new s(i), n + i.e + 1, t), e = _(r, !1, n + r.e + 1)), i.isNeg() && !i.isZero() ? "-" + e : e;
+};
+a.toFraction = function(n) {
+  let t, e, r, i, s, o, u, l, c, f, h, d, p = this, b = p.d, N = p.constructor;
+  if (!b) return new N(p);
+  if (c = e = new N(1), r = l = new N(0), t = new N(r), s = t.e = xn(b) - p.e - 1, o = s % m, t.d[0] = M(10, o < 0 ? m + o : o), n == null)
+    n = s > 0 ? t : c;
+  else {
+    if (u = new N(n), !u.isInt() || u.lt(c)) throw Error(C + u);
+    n = u.gt(t) ? s > 0 ? t : c : u;
+  }
+  for (w = !1, u = new N(q(b)), f = N.precision, N.precision = s = b.length * m * 2; h = v(u, t, 0, 1, 1), i = e.plus(h.times(r)), i.cmp(n) != 1; )
+    e = r, r = i, i = c, c = l.plus(h.times(i)), l = i, i = t, t = u.minus(h.times(i)), u = i;
+  return i = v(n.minus(e), r, 0, 1, 1), l = l.plus(i.times(c)), e = e.plus(i.times(r)), l.s = c.s = p.s, d = v(c, r, s, 1).minus(p).abs().cmp(v(l, e, s, 1).minus(p).abs()) < 1 ? [c, r] : [l, e], N.precision = f, w = !0, d;
+};
+a.toHexadecimal = a.toHex = function(n, t) {
+  return an(this, 16, n, t);
+};
+a.toNearest = function(n, t) {
+  let e = this, r = e.constructor;
+  if (e = new r(e), n == null) {
+    if (!e.d) return e;
+    n = new r(1), t = r.rounding;
+  } else {
+    if (n = new r(n), t === void 0 ? t = r.rounding : D(t, 0, 8), !e.d) return n.s ? e : n;
+    if (!n.d)
+      return n.s && (n.s = e.s), n;
+  }
+  return n.d[0] ? (w = !1, e = v(e, n, 0, t, 1).times(n), w = !0, g(e)) : (n.s = e.s, e = n), e;
+};
+a.toNumber = function() {
+  return +this;
+};
+a.toOctal = function(n, t) {
+  return an(this, 8, n, t);
+};
+a.toPower = a.pow = function(n) {
+  let t, e, r, i, s, o, u = this, l = u.constructor, c = +(n = new l(n));
+  if (!u.d || !n.d || !u.d[0] || !n.d[0]) return new l(M(+u, c));
+  if (u = new l(u), u.eq(1)) return u;
+  if (r = l.precision, s = l.rounding, n.eq(1)) return g(u, r, s);
+  if (t = A(n.e / m), t >= n.d.length - 1 && (e = c < 0 ? -c : c) <= _n)
+    return i = yn(l, u, e, r), n.s < 0 ? new l(1).div(i) : g(i, r, s);
+  if (o = u.s, o < 0) {
+    if (t < n.d.length - 1) return new l(NaN);
+    if (n.d[t] & 1 || (o = 1), u.e == 0 && u.d[0] == 1 && u.d.length == 1)
+      return u.s = o, u;
+  }
+  return e = M(+u, c), t = e == 0 || !isFinite(e) ? A(
+    c * (Math.log("0." + q(u.d)) / Math.LN10 + u.e + 1)
+  ) : new l(e + "").e, t > l.maxE + 1 || t < l.minE - 1 ? new l(t > 0 ? o / 0 : 0) : (w = !1, l.rounding = u.s = 1, e = Math.min(12, (t + "").length), i = hn(n.times(I(u, r + e)), r), i.d && (i = g(i, r + 5, 1), W(i.d, r, s) && (t = r + 10, i = g(
+    hn(n.times(I(u, t + e)), t),
+    t + 5,
+    1
+  ), +q(i.d).slice(r + 1, r + 15) + 1 == 1e14 && (i = g(i, r + 1, 0)))), i.s = o, w = !0, l.rounding = s, g(i, r, s));
+};
+a.toPrecision = function(n, t) {
+  let e, r = this, i = r.constructor;
+  return n === void 0 ? e = _(r, r.e <= i.toExpNeg || r.e >= i.toExpPos) : (D(n, 1, H), t === void 0 ? t = i.rounding : D(t, 0, 8), r = g(new i(r), n, t), e = _(r, n <= r.e || r.e <= i.toExpNeg, n)), r.isNeg() && !r.isZero() ? "-" + e : e;
+};
+a.toSignificantDigits = a.toSD = function(n, t) {
+  let e = this, r = e.constructor;
+  return n === void 0 ? (n = r.precision, t = r.rounding) : (D(n, 1, H), t === void 0 ? t = r.rounding : D(t, 0, 8)), g(new r(e), n, t);
+};
+a.toString = function() {
+  let n = this, t = n.constructor, e = _(n, n.e <= t.toExpNeg || n.e >= t.toExpPos);
+  return n.isNeg() && !n.isZero() ? "-" + e : e;
+};
+a.truncated = a.trunc = function() {
+  return g(new this.constructor(this), this.e + 1, 1);
+};
+a.valueOf = a.toJSON = function() {
+  let n = this, t = n.constructor, e = _(n, n.e <= t.toExpNeg || n.e >= t.toExpPos);
+  return n.isNeg() ? "-" + e : e;
+};
+function q(n) {
+  let t, e, r, i = n.length - 1, s = "", o = n[0];
+  if (i > 0) {
+    for (s += o, t = 1; t < i; t++)
+      r = n[t] + "", e = m - r.length, e && (s += U(e)), s += r;
+    o = n[t], r = o + "", e = m - r.length, e && (s += U(e));
+  } else if (o === 0)
+    return "0";
+  for (; o % 10 === 0; ) o /= 10;
+  return s + o;
+}
+function D(n, t, e) {
+  if (n !== ~~n || n < t || n > e)
+    throw Error(C + n);
+}
+function W(n, t, e, r) {
+  let i, s, o, u;
+  for (s = n[0]; s >= 10; s /= 10) --t;
+  return --t < 0 ? (t += m, i = 0) : (i = Math.ceil((t + 1) / m), t %= m), s = M(10, m - t), u = n[i] % s | 0, r == null ? t < 3 ? (t == 0 ? u = u / 100 | 0 : t == 1 && (u = u / 10 | 0), o = e < 4 && u == 99999 || e > 3 && u == 49999 || u == 5e4 || u == 0) : o = (e < 4 && u + 1 == s || e > 3 && u + 1 == s / 2) && (n[i + 1] / s / 100 | 0) == M(10, t - 2) - 1 || (u == s / 2 || u == 0) && (n[i + 1] / s / 100 | 0) == 0 : t < 4 ? (t == 0 ? u = u / 1e3 | 0 : t == 1 ? u = u / 100 | 0 : t == 2 && (u = u / 10 | 0), o = (r || e < 4) && u == 9999 || !r && e > 3 && u == 4999) : o = ((r || e < 4) && u + 1 == s || !r && e > 3 && u + 1 == s / 2) && (n[i + 1] / s / 1e3 | 0) == M(10, t - 3) - 1, o;
+}
+function Q(n, t, e) {
+  let r, i = [0], s, o = 0, u = n.length;
+  for (; o < u; ) {
+    for (s = i.length; s--; ) i[s] *= t;
+    for (i[0] += cn.indexOf(n.charAt(o++)), r = 0; r < i.length; r++)
+      i[r] > e - 1 && (i[r + 1] === void 0 && (i[r + 1] = 0), i[r + 1] += i[r] / e | 0, i[r] %= e);
+  }
+  return i.reverse();
+}
+function Ln(n, t) {
+  let e, r, i;
+  if (t.isZero()) return t;
+  r = t.d.length, r < 32 ? (e = Math.ceil(r / 3), i = (1 / rn(4, e)).toString()) : (e = 16, i = "2.3283064365386962890625e-10"), n.precision += e, t = $(n, 1, t.times(i), new n(1));
+  for (let s = e; s--; ) {
+    let o = t.times(t);
+    t = o.times(o).minus(o).times(8).plus(1);
+  }
+  return n.precision -= e, t;
+}
+let v = /* @__PURE__ */ function() {
+  function n(r, i, s) {
+    let o, u = 0, l = r.length;
+    for (r = r.slice(); l--; )
+      o = r[l] * i + u, r[l] = o % s | 0, u = o / s | 0;
+    return u && r.unshift(u), r;
+  }
+  function t(r, i, s, o) {
+    let u, l;
+    if (s != o)
+      l = s > o ? 1 : -1;
+    else
+      for (u = l = 0; u < s; u++)
+        if (r[u] != i[u]) {
+          l = r[u] > i[u] ? 1 : -1;
+          break;
+        }
+    return l;
+  }
+  function e(r, i, s, o) {
+    let u = 0;
+    for (; s--; )
+      r[s] -= u, u = r[s] < i[s] ? 1 : 0, r[s] = u * o + r[s] - i[s];
+    for (; !r[0] && r.length > 1; ) r.shift();
+  }
+  return function(r, i, s, o, u, l) {
+    let c, f, h, d, p, b, N, Z, y, S, E, O, J, k, sn, z, j, on, P, G, K = r.constructor, un = r.s == i.s ? 1 : -1, F = r.d, x = i.d;
+    if (!F || !F[0] || !x || !x[0])
+      return new K(
+        // Return NaN if either NaN, or both Infinity or 0.
+        !r.s || !i.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 (l ? (p = 1, f = r.e - i.e) : (l = T, p = m, f = A(r.e / p) - A(i.e / p)), P = x.length, j = F.length, y = new K(un), S = y.d = [], h = 0; x[h] == (F[h] || 0); h++) ;
+    if (x[h] > (F[h] || 0) && f--, s == null ? (k = s = K.precision, o = K.rounding) : u ? k = s + (r.e - i.e) + 1 : k = s, k < 0)
+      S.push(1), b = !0;
+    else {
+      if (k = k / p + 2 | 0, h = 0, P == 1) {
+        for (d = 0, x = x[0], k++; (h < j || d) && k--; h++)
+          sn = d * l + (F[h] || 0), S[h] = sn / x | 0, d = sn % x | 0;
+        b = d || h < j;
+      } else {
+        for (d = l / (x[0] + 1) | 0, d > 1 && (x = n(x, d, l), F = n(F, d, l), P = x.length, j = F.length), z = P, E = F.slice(0, P), O = E.length; O < P; ) E[O++] = 0;
+        G = x.slice(), G.unshift(0), on = x[0], x[1] >= l / 2 && ++on;
+        do
+          d = 0, c = t(x, E, P, O), c < 0 ? (J = E[0], P != O && (J = J * l + (E[1] || 0)), d = J / on | 0, d > 1 ? (d >= l && (d = l - 1), N = n(x, d, l), Z = N.length, O = E.length, c = t(N, E, Z, O), c == 1 && (d--, e(N, P < Z ? G : x, Z, l))) : (d == 0 && (c = d = 1), N = x.slice()), Z = N.length, Z < O && N.unshift(0), e(E, N, O, l), c == -1 && (O = E.length, c = t(x, E, P, O), c < 1 && (d++, e(E, P < O ? G : x, O, l))), O = E.length) : c === 0 && (d++, E = [0]), S[h++] = d, c && E[0] ? E[O++] = F[z] || 0 : (E = [F[z]], O = 1);
+        while ((z++ < j || E[0] !== void 0) && k--);
+        b = E[0] !== void 0;
+      }
+      S[0] || S.shift();
+    }
+    if (p == 1)
+      y.e = f, wn = b;
+    else {
+      for (h = 1, d = S[0]; d >= 10; d /= 10) h++;
+      y.e = h + f * p - 1, g(y, u ? s + y.e + 1 : s, o, b);
+    }
+    return y;
+  };
+}();
+function g(n, t, e, r) {
+  let i, s, o, u, l, c, f, h, d, p = n.constructor;
+  n: if (t != null) {
+    if (h = n.d, !h) return n;
+    for (i = 1, u = h[0]; u >= 10; u /= 10) i++;
+    if (s = t - i, s < 0)
+      s += m, o = t, f = h[d = 0], l = f / M(10, i - o - 1) % 10 | 0;
+    else if (d = Math.ceil((s + 1) / m), u = h.length, d >= u)
+      if (r) {
+        for (; u++ <= d; ) h.push(0);
+        f = l = 0, i = 1, s %= m, o = s - m + 1;
+      } else
+        break n;
+    else {
+      for (f = u = h[d], i = 1; u >= 10; u /= 10) i++;
+      s %= m, o = s - m + i, l = o < 0 ? 0 : f / M(10, i - o - 1) % 10 | 0;
+    }
+    if (r = r || t < 0 || h[d + 1] !== void 0 || (o < 0 ? f : f % M(10, i - o - 1)), c = e < 4 ? (l || r) && (e == 0 || e == (n.s < 0 ? 3 : 2)) : l > 5 || l == 5 && (e == 4 || r || e == 6 && // Check whether the digit to the left of the rounding digit is odd.
+    (s > 0 ? o > 0 ? f / M(10, i - o) : 0 : h[d - 1]) % 10 & 1 || e == (n.s < 0 ? 8 : 7)), t < 1 || !h[0])
+      return h.length = 0, c ? (t -= n.e + 1, h[0] = M(10, (m - t % m) % m), n.e = -t || 0) : h[0] = n.e = 0, n;
+    if (s == 0 ? (h.length = d, u = 1, d--) : (h.length = d + 1, u = M(10, m - s), h[d] = o > 0 ? (f / M(10, i - o) % M(10, o) | 0) * u : 0), c)
+      for (; ; )
+        if (d == 0) {
+          for (s = 1, o = h[0]; o >= 10; o /= 10) s++;
+          for (o = h[0] += u, u = 1; o >= 10; o /= 10) u++;
+          s != u && (n.e++, h[0] == T && (h[0] = 1));
+          break;
+        } else {
+          if (h[d] += u, h[d] != T) break;
+          h[d--] = 0, u = 1;
+        }
+    for (s = h.length; h[--s] === 0; ) h.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 _(n, t, e) {
+  if (!n.isFinite()) return qn(n);
+  let r, i = n.e, s = q(n.d), o = s.length;
+  return t ? (e && (r = e - o) > 0 ? s = s.charAt(0) + "." + s.slice(1) + U(r) : o > 1 && (s = s.charAt(0) + "." + s.slice(1)), s = s + (n.e < 0 ? "e" : "e+") + n.e) : i < 0 ? (s = "0." + U(-i - 1) + s, e && (r = e - o) > 0 && (s += U(r))) : i >= o ? (s += U(i + 1 - o), e && (r = e - i - 1) > 0 && (s = s + "." + U(r))) : ((r = i + 1) < o && (s = s.slice(0, r) + "." + s.slice(r)), e && (r = e - o) > 0 && (i + 1 === o && (s += "."), s += U(r))), s;
+}
+function en(n, t) {
+  let e = n[0];
+  for (t *= m; e >= 10; e /= 10) t++;
+  return t;
+}
+function nn(n, t, e) {
+  if (t > kn)
+    throw w = !0, e && (n.precision = e), Error(Nn);
+  return g(new n(X), t, 1, !0);
+}
+function R(n, t, e) {
+  if (t > fn) throw Error(Nn);
+  return g(new n(Y), t, e, !0);
+}
+function xn(n) {
+  let t = n.length - 1, e = t * m + 1;
+  if (t = n[t], t) {
+    for (; t % 10 == 0; t /= 10) e--;
+    for (t = n[0]; t >= 10; t /= 10) e++;
+  }
+  return e;
+}
+function U(n) {
+  let t = "";
+  for (; n--; ) t += "0";
+  return t;
+}
+function yn(n, t, e, r) {
+  let i, s = new n(1), o = Math.ceil(r / m + 4);
+  for (w = !1; ; ) {
+    if (e % 2 && (s = s.times(t), pn(s.d, o) && (i = !0)), e = A(e / 2), e === 0) {
+      e = s.d.length - 1, i && s.d[e] === 0 && ++s.d[e];
+      break;
+    }
+    t = t.times(t), pn(t.d, o);
+  }
+  return w = !0, s;
+}
+function gn(n) {
+  return n.d[n.d.length - 1] & 1;
+}
+function Mn(n, t, e) {
+  let r, i = new n(t[0]), s = 0;
+  for (; ++s < t.length; )
+    if (r = new n(t[s]), r.s)
+      i[e](r) && (i = r);
+    else {
+      i = r;
+      break;
+    }
+  return i;
+}
+function hn(n, t) {
+  let e, r, i, s, o, u, l, c = 0, f = 0, h = 0, d = n.constructor, p = d.rounding, b = 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 (t == null ? (w = !1, l = b) : l = t, u = new d(0.03125); n.e > -2; )
+    n = n.times(u), h += 5;
+  for (r = Math.log(M(2, h)) / Math.LN10 * 2 + 5 | 0, l += r, e = s = o = new d(1), d.precision = l; ; ) {
+    if (s = g(s.times(n), l, 1), e = e.times(++f), u = o.plus(v(s, e, l, 1)), q(u.d).slice(0, l) === q(o.d).slice(0, l)) {
+      for (i = h; i--; ) o = g(o.times(o), l, 1);
+      if (t == null)
+        if (c < 3 && W(o.d, l - r, p, c))
+          d.precision = l += 10, e = s = u = new d(1), f = 0, c++;
+        else
+          return g(o, d.precision = b, p, w = !0);
+      else
+        return d.precision = b, o;
+    }
+    o = u;
+  }
+}
+function I(n, t) {
+  let e, r, i, s, o, u, l, c, f, h, d, p = 1, b = 10, N = n, Z = N.d, y = N.constructor, S = y.rounding, E = y.precision;
+  if (N.s < 0 || !Z || !Z[0] || !N.e && Z[0] == 1 && Z.length == 1)
+    return new y(Z && !Z[0] ? -1 / 0 : N.s != 1 ? NaN : Z ? 0 : N);
+  if (t == null ? (w = !1, f = E) : f = t, y.precision = f += b, e = q(Z), r = e.charAt(0), Math.abs(s = N.e) < 15e14) {
+    for (; r < 7 && r != 1 || r == 1 && e.charAt(1) > 3; )
+      N = N.times(n), e = q(N.d), r = e.charAt(0), p++;
+    s = N.e, r > 1 ? (N = new y("0." + e), s++) : N = new y(r + "." + e.slice(1));
+  } else
+    return c = nn(y, f + 2, E).times(s + ""), N = I(new y(r + "." + e.slice(1)), f - b).plus(c), y.precision = E, t == null ? g(N, E, S, w = !0) : N;
+  for (h = N, l = o = N = v(N.minus(1), N.plus(1), f, 1), d = g(N.times(N), f, 1), i = 3; ; ) {
+    if (o = g(o.times(d), f, 1), c = l.plus(v(o, new y(i), f, 1)), q(c.d).slice(0, f) === q(l.d).slice(0, f))
+      if (l = l.times(2), s !== 0 && (l = l.plus(nn(y, f + 2, E).times(s + ""))), l = v(l, new y(p), f, 1), t == null)
+        if (W(l.d, f - b, S, u))
+          y.precision = f += b, c = o = N = v(h.minus(1), h.plus(1), f, 1), d = g(N.times(N), f, 1), i = u = 1;
+        else
+          return g(l, y.precision = E, S, w = !0);
+      else
+        return y.precision = E, l;
+    l = c, i += 2;
+  }
+}
+function qn(n) {
+  return String(n.s * n.s / 0);
+}
+function dn(n, t) {
+  let e, r, i;
+  for ((e = t.indexOf(".")) > -1 && (t = t.replace(".", "")), (r = t.search(/e/i)) > 0 ? (e < 0 && (e = r), e += +t.slice(r + 1), t = t.substring(0, r)) : e < 0 && (e = t.length), r = 0; t.charCodeAt(r) === 48; r++) ;
+  for (i = t.length; t.charCodeAt(i - 1) === 48; --i) ;
+  if (t = t.slice(r, i), t) {
+    if (i -= r, n.e = e = e - r - 1, n.d = [], r = (e + 1) % m, e < 0 && (r += m), r < i) {
+      for (r && n.d.push(+t.slice(0, r)), i -= m; r < i; ) n.d.push(+t.slice(r, r += m));
+      t = t.slice(r), r = m - t.length;
+    } else
+      r -= i;
+    for (; r--; ) t += "0";
+    n.d.push(+t), 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 Un(n, t) {
+  let e, r, i, s, o, u, l, c, f;
+  if (t.indexOf("_") > -1) {
+    if (t = t.replace(/(\d)_(?=\d)/g, "$1"), vn.test(t)) return dn(n, t);
+  } else if (t === "Infinity" || t === "NaN")
+    return +t || (n.s = NaN), n.e = NaN, n.d = null, n;
+  if (Rn.test(t))
+    e = 16, t = t.toLowerCase();
+  else if (Pn.test(t))
+    e = 2;
+  else if (Tn.test(t))
+    e = 8;
+  else
+    throw Error(C + t);
+  for (s = t.search(/p/i), s > 0 ? (l = +t.slice(s + 1), t = t.substring(2, s)) : t = t.slice(2), s = t.indexOf("."), o = s >= 0, r = n.constructor, o && (t = t.replace(".", ""), u = t.length, s = u - s, i = yn(r, new r(e), s, s * 2)), c = Q(t, e, T), f = c.length - 1, s = f; c[s] === 0; --s) c.pop();
+  return s < 0 ? new r(n.s * 0) : (n.e = en(c, f), n.d = c, w = !1, o && (n = v(n, i, u * 4)), l && (n = n.times(Math.abs(l) < 54 ? M(2, l) : B.pow(2, l))), w = !0, n);
+}
+function In(n, t) {
+  let e, r = t.d.length;
+  if (r < 3)
+    return t.isZero() ? t : $(n, 2, t, t);
+  e = 1.4 * Math.sqrt(r), e = e > 16 ? 16 : e | 0, t = t.times(1 / rn(5, e)), t = $(n, 2, t, t);
+  let i, s = new n(5), o = new n(16), u = new n(20);
+  for (; e--; )
+    i = t.times(t), t = t.times(s.plus(i.times(o.times(i).minus(u))));
+  return t;
+}
+function $(n, t, e, r, i) {
+  let s, o, u, l, c = n.precision, f = Math.ceil(c / m);
+  for (w = !1, l = e.times(e), u = new n(r); ; ) {
+    if (o = v(u.times(l), new n(t++ * t++), c, 1), u = i ? r.plus(o) : r.minus(o), r = v(o.times(l), new n(t++ * t++), c, 1), o = u.plus(r), o.d[f] !== void 0) {
+      for (s = f; o.d[s] === u.d[s] && s--; ) ;
+      if (s == -1) break;
+    }
+    s = u, u = r, r = o, o = s;
+  }
+  return w = !0, o.d.length = f + 1, o;
+}
+function rn(n, t) {
+  let e = n;
+  for (; --t; ) e *= n;
+  return e;
+}
+function On(n, t) {
+  let e, r = t.s < 0, i = R(n, n.precision, 1), s = i.times(0.5);
+  if (t = t.abs(), t.lte(s))
+    return L = r ? 4 : 1, t;
+  if (e = t.divToInt(i), e.isZero())
+    L = r ? 3 : 2;
+  else {
+    if (t = t.minus(e.times(i)), t.lte(s))
+      return L = gn(e) ? r ? 2 : 3 : r ? 4 : 1, t;
+    L = gn(e) ? r ? 1 : 4 : r ? 3 : 2;
+  }
+  return t.minus(i).abs();
+}
+function an(n, t, e, r) {
+  let i, s, o, u, l, c, f, h, d, p = n.constructor, b = e !== void 0;
+  if (b ? (D(e, 1, H), r === void 0 ? r = p.rounding : D(r, 0, 8)) : (e = p.precision, r = p.rounding), !n.isFinite())
+    f = qn(n);
+  else {
+    for (f = _(n), o = f.indexOf("."), b ? (i = 2, t == 16 ? e = e * 4 - 3 : t == 8 && (e = e * 3 - 2)) : i = t, o >= 0 && (f = f.replace(".", ""), d = new p(1), d.e = f.length - o, d.d = Q(_(d), 10, i), d.e = d.d.length), h = Q(f, 10, i), s = l = h.length; h[--l] == 0; ) h.pop();
+    if (!h[0])
+      f = b ? "0p+0" : "0";
+    else {
+      if (o < 0 ? s-- : (n = new p(n), n.d = h, n.e = s, n = v(n, d, e, r, 0, i), h = n.d, s = n.e, c = wn), o = h[e], u = i / 2, c = c || h[e + 1] !== void 0, c = r < 4 ? (o !== void 0 || c) && (r === 0 || r === (n.s < 0 ? 3 : 2)) : o > u || o === u && (r === 4 || c || r === 6 && h[e - 1] & 1 || r === (n.s < 0 ? 8 : 7)), h.length = e, c)
+        for (; ++h[--e] > i - 1; )
+          h[e] = 0, e || (++s, h.unshift(1));
+      for (l = h.length; !h[l - 1]; --l) ;
+      for (o = 0, f = ""; o < l; o++) f += cn.charAt(h[o]);
+      if (b) {
+        if (l > 1)
+          if (t == 16 || t == 8) {
+            for (o = t == 16 ? 4 : 3, --l; l % o; l++) f += "0";
+            for (h = Q(f, i, t), l = h.length; !h[l - 1]; --l) ;
+            for (o = 1, f = "1."; o < l; o++) f += cn.charAt(h[o]);
+          } else
+            f = f.charAt(0) + "." + f.slice(1);
+        f = f + (s < 0 ? "p" : "p+") + s;
+      } else if (s < 0) {
+        for (; ++s; ) f = "0" + f;
+        f = "0." + f;
+      } else if (++s > l) for (s -= l; s--; ) f += "0";
+      else s < l && (f = f.slice(0, s) + "." + f.slice(s));
+    }
+    f = (t == 16 ? "0x" : t == 2 ? "0b" : t == 8 ? "0o" : "") + f;
+  }
+  return n.s < 0 ? "-" + f : f;
+}
+function pn(n, t) {
+  if (n.length > t)
+    return n.length = t, !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, t) {
+  return new this(n).plus(t);
+}
+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, t) {
+  n = new this(n), t = new this(t);
+  let e, r = this.precision, i = this.rounding, s = r + 4;
+  return !n.s || !t.s ? e = new this(NaN) : !n.d && !t.d ? (e = R(this, s, 1).times(t.s > 0 ? 0.25 : 0.75), e.s = n.s) : !t.d || n.isZero() ? (e = t.s < 0 ? R(this, r, i) : new this(0), e.s = n.s) : !n.d || t.isZero() ? (e = R(this, s, 1).times(0.5), e.s = n.s) : t.s < 0 ? (this.precision = s, this.rounding = 1, e = this.atan(v(n, t, s, 1)), t = R(this, s, 1), this.precision = r, this.rounding = i, e = n.s < 0 ? e.minus(t) : e.plus(t)) : e = this.atan(v(n, t, s, 1)), e;
+}
+function Gn(n) {
+  return new this(n).cbrt();
+}
+function Kn(n) {
+  return g(n = new this(n), n.e + 1, 2);
+}
+function Qn(n, t, e) {
+  return new this(n).clamp(t, e);
+}
+function Xn(n) {
+  if (!n || typeof n != "object")
+    throw Error(tn + "Object expected");
+  let t, e, r, i = n.defaults === !0, s = [
+    "precision",
+    1,
+    H,
+    "rounding",
+    0,
+    8,
+    "toExpNeg",
+    -V,
+    0,
+    "toExpPos",
+    0,
+    V,
+    "maxE",
+    0,
+    V,
+    "minE",
+    -V,
+    0,
+    "modulo",
+    0,
+    9
+  ];
+  for (t = 0; t < s.length; t += 3)
+    if (e = s[t], i && (this[e] = ln[e]), (r = n[e]) !== void 0)
+      if (A(r) === r && r >= s[t + 1] && r <= s[t + 2]) this[e] = r;
+      else throw Error(C + e + ": " + r);
+  if (e = "crypto", i && (this[e] = ln[e]), (r = n[e]) !== void 0)
+    if (r === !0 || r === !1 || r === 0 || r === 1)
+      if (r)
+        if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes))
+          this[e] = !0;
+        else
+          throw Error(bn);
+      else
+        this[e] = !1;
+    else
+      throw Error(C + e + ": " + r);
+  return this;
+}
+function Yn(n) {
+  return new this(n).cos();
+}
+function nt(n) {
+  return new this(n).cosh();
+}
+function Fn(n) {
+  let t, e, r;
+  function i(s) {
+    let o, u, l, c = this;
+    if (!(c instanceof i)) return new i(s);
+    if (c.constructor = i, mn(s)) {
+      c.s = s.s, w ? !s.d || s.e > i.maxE ? (c.e = NaN, c.d = null) : s.e < i.minE ? (c.e = 0, c.d = [0]) : (c.e = s.e, c.d = s.d.slice()) : (c.e = s.e, c.d = s.d ? s.d.slice() : s.d);
+      return;
+    }
+    if (l = typeof s, l === "number") {
+      if (s === 0) {
+        c.s = 1 / s < 0 ? -1 : 1, c.e = 0, c.d = [0];
+        return;
+      }
+      if (s < 0 ? (s = -s, c.s = -1) : c.s = 1, s === ~~s && s < 1e7) {
+        for (o = 0, u = s; u >= 10; u /= 10) o++;
+        w ? o > i.maxE ? (c.e = NaN, c.d = null) : o < i.minE ? (c.e = 0, c.d = [0]) : (c.e = o, c.d = [s]) : (c.e = o, c.d = [s]);
+        return;
+      } else if (s * 0 !== 0) {
+        s || (c.s = NaN), c.e = NaN, c.d = null;
+        return;
+      }
+      return dn(c, s.toString());
+    } else if (l !== "string")
+      throw Error(C + s);
+    return (u = s.charCodeAt(0)) === 45 ? (s = s.slice(1), c.s = -1) : (u === 43 && (s = s.slice(1)), c.s = 1), vn.test(s) ? dn(c, s) : Un(c, s);
+  }
+  if (i.prototype = a, i.ROUND_UP = 0, i.ROUND_DOWN = 1, i.ROUND_CEIL = 2, i.ROUND_FLOOR = 3, i.ROUND_HALF_UP = 4, i.ROUND_HALF_DOWN = 5, i.ROUND_HALF_EVEN = 6, i.ROUND_HALF_CEIL = 7, i.ROUND_HALF_FLOOR = 8, i.EUCLID = 9, i.config = i.set = Xn, i.clone = Fn, i.isDecimal = mn, i.abs = Cn, i.acos = Hn, i.acosh = Bn, i.add = Vn, i.asin = $n, i.asinh = jn, i.atan = Wn, i.atanh = Jn, i.atan2 = zn, i.cbrt = Gn, i.ceil = Kn, i.clamp = Qn, i.cos = Yn, i.cosh = nt, i.div = tt, i.exp = et, i.floor = rt, i.hypot = it, i.ln = st, i.log = ot, i.log10 = ct, i.log2 = ut, i.max = lt, i.min = ft, i.mod = ht, i.mul = dt, i.pow = at, i.random = gt, i.round = pt, i.sign = mt, i.sin = wt, i.sinh = Nt, i.sqrt = bt, i.sub = Et, i.sum = vt, i.tan = xt, i.tanh = yt, i.trunc = Mt, n === void 0 && (n = {}), n && n.defaults !== !0)
+    for (r = [
+      "precision",
+      "rounding",
+      "toExpNeg",
+      "toExpPos",
+      "maxE",
+      "minE",
+      "modulo",
+      "crypto"
+    ], t = 0; t < r.length; )
+      Object.prototype.hasOwnProperty.call(n, e = r[t++]) || (n[e] = this[e]);
+  return i.config(n), i;
+}
+function tt(n, t) {
+  return new this(n).div(t);
+}
+function et(n) {
+  return new this(n).exp();
+}
+function rt(n) {
+  return g(n = new this(n), n.e + 1, 3);
+}
+function it() {
+  let n, t, e = new this(0);
+  for (w = !1, n = 0; n < arguments.length; )
+    if (t = new this(arguments[n++]), t.d)
+      e.d && (e = e.plus(t.times(t)));
+    else {
+      if (t.s)
+        return w = !0, new this(1 / 0);
+      e = t;
+    }
+  return w = !0, e.sqrt();
+}
+function mn(n) {
+  return n instanceof B || n && n.toStringTag === En || !1;
+}
+function st(n) {
+  return new this(n).ln();
+}
+function ot(n, t) {
+  return new this(n).log(t);
+}
+function ut(n) {
+  return new this(n).log(2);
+}
+function ct(n) {
+  return new this(n).log(10);
+}
+function lt() {
+  return Mn(this, arguments, "lt");
+}
+function ft() {
+  return Mn(this, arguments, "gt");
+}
+function ht(n, t) {
+  return new this(n).mod(t);
+}
+function dt(n, t) {
+  return new this(n).mul(t);
+}
+function at(n, t) {
+  return new this(n).pow(t);
+}
+function gt(n) {
+  let t, e, r, i, s = 0, o = new this(1), u = [];
+  if (n === void 0 ? n = this.precision : D(n, 1, H), r = Math.ceil(n / m), this.crypto)
+    if (crypto.getRandomValues)
+      for (t = crypto.getRandomValues(new Uint32Array(r)); s < r; )
+        i = t[s], i >= 429e7 ? t[s] = crypto.getRandomValues(new Uint32Array(1))[0] : u[s++] = i % 1e7;
+    else if (crypto.randomBytes) {
+      for (t = crypto.randomBytes(r *= 4); s < r; )
+        i = t[s] + (t[s + 1] << 8) + (t[s + 2] << 16) + ((t[s + 3] & 127) << 24), i >= 214e7 ? crypto.randomBytes(4).copy(t, s) : (u.push(i % 1e7), s += 4);
+      s = r / 4;
+    } else
+      throw Error(bn);
+  else for (; s < r; ) u[s++] = Math.random() * 1e7 | 0;
+  for (r = u[--s], n %= m, r && n && (i = M(10, m - n), u[s] = (r / i | 0) * i); u[s] === 0; s--) u.pop();
+  if (s < 0)
+    e = 0, u = [0];
+  else {
+    for (e = -1; u[0] === 0; e -= m) u.shift();
+    for (r = 1, i = u[0]; i >= 10; i /= 10) r++;
+    r < m && (e -= m - r);
+  }
+  return o.e = e, o.d = u, o;
+}
+function pt(n) {
+  return g(n = new this(n), n.e + 1, this.rounding);
+}
+function mt(n) {
+  return n = new this(n), n.d ? n.d[0] ? n.s : 0 * n.s : n.s || NaN;
+}
+function wt(n) {
+  return new this(n).sin();
+}
+function Nt(n) {
+  return new this(n).sinh();
+}
+function bt(n) {
+  return new this(n).sqrt();
+}
+function Et(n, t) {
+  return new this(n).sub(t);
+}
+function vt() {
+  let n = 0, t = arguments, e = new this(t[n]);
+  for (w = !1; e.s && ++n < t.length; ) e = e.plus(t[n]);
+  return w = !0, g(e, this.precision, this.rounding);
+}
+function xt(n) {
+  return new this(n).tan();
+}
+function yt(n) {
+  return new this(n).tanh();
+}
+function Mt(n) {
+  return g(n = new this(n), n.e + 1, 1);
+}
+a[Symbol.for("nodejs.util.inspect.custom")] = a.toString;
+a[Symbol.toStringTag] = "Decimal";
+let B = a.constructor = Fn(ln);
+X = new B(X);
+Y = new B(Y);
+function An(n, t) {
+  return new B(n).plus(t).toNumber();
+}
+function Zn(n, t) {
+  return new B(n).minus(t).toNumber();
+}
+function Dn(n, t) {
+  return new B(n).times(t).toNumber();
+}
+function Sn(n, t) {
+  return new B(n).div(t).toNumber();
+}
+const qt = An, Ot = Zn, Ft = Dn, At = Sn, Zt = {
+  plus: An,
+  minus: Zn,
+  times: Dn,
+  div: Sn,
+  add: qt,
+  subtract: Ot,
+  multiply: Ft,
+  divide: At
+};
+export {
+  At as d,
+  Zn as i,
+  Zt as l,
+  Dn as o,
+  An as u
+};