@unicom-cloud/ui 0.8.66 → 0.8.68

package/chunk/yl4BU7Sd.js

@@ -0,0 +1,1068 @@
+/*!
+ *  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
+}, _, mn, k, m = !0, rn = "[DecimalError] ", H = rn + "Invalid argument: ", vn = rn + "Precision limit exceeded", Nn = rn + "crypto unavailable", bn = "[object Decimal]", A = Math.floor, M = Math.pow, An = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, Dn = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, Zn = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, En = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, S = 1e7, w = 7, Pn = 9007199254740991, Rn = X.length - 1, ln = Y.length - 1, d = { toStringTag: bn };
+d.absoluteValue = d.abs = function() {
+  var n = new this.constructor(this);
+  return n.s < 0 && (n.s = 1), g(n);
+};
+d.ceil = function() {
+  return g(new this.constructor(this), this.e + 1, 2);
+};
+d.clampedTo = d.clamp = function(n, r) {
+  var t, 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 t = e.cmp(n), t < 0 ? n : e.cmp(r) > 0 ? r : new s(e);
+};
+d.comparedTo = d.cmp = function(n) {
+  var r, t, e, s, i = this, o = i.d, u = (n = new i.constructor(n)).d, f = i.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 (i.e !== n.e) return i.e > n.e ^ f < 0 ? 1 : -1;
+  for (e = o.length, s = u.length, r = 0, t = e < s ? e : s; r < t; ++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;
+};
+d.cosine = d.cos = function() {
+  var n, r, t = this, e = t.constructor;
+  return t.d ? t.d[0] ? (n = e.precision, r = e.rounding, e.precision = n + Math.max(t.e, t.sd()) + w, e.rounding = 1, t = Sn(e, On(e, t)), e.precision = n, e.rounding = r, g(k == 2 || k == 3 ? t.neg() : t, n, r, !0)) : new e(1) : new e(NaN);
+};
+d.cubeRoot = d.cbrt = function() {
+  var n, r, t, e, s, i, o, u, f, c, a = this, l = a.constructor;
+  if (!a.isFinite() || a.isZero()) return new l(a);
+  for (m = !1, i = a.s * M(a.s * a, 1 / 3), !i || Math.abs(i) == 1 / 0 ? (t = q(a.d), n = a.e, (i = (n - t.length + 1) % 3) && (t += i == 1 || i == -2 ? "0" : "00"), i = M(t, 1 / 3), n = A((n + 1) / 3) - (n % 3 == (n < 0 ? -1 : 2)), i == 1 / 0 ? t = "5e" + n : (t = i.toExponential(), t = t.slice(0, t.indexOf("e") + 1) + n), e = new l(t), e.s = a.s) : e = new l(i.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) === (t = q(e.d)).slice(0, o))
+      if (t = t.slice(o - 3, o + 1), t == "9999" || !s && t == "4999") {
+        if (!s && (g(u, n + 1, 0), u.times(u).times(u).eq(a))) {
+          e = u;
+          break;
+        }
+        o += 4, s = 1;
+      } else {
+        (!+t || !+t.slice(1) && t.charAt(0) == "5") && (g(e, n + 1, 1), r = !e.times(e).times(e).eq(a));
+        break;
+      }
+  return m = !0, g(e, n, l.rounding, r);
+};
+d.decimalPlaces = d.dp = function() {
+  var n, r = this.d, t = NaN;
+  if (r) {
+    if (n = r.length - 1, t = (n - A(this.e / w)) * w, n = r[n], n) for (; n % 10 == 0; n /= 10) t--;
+    t < 0 && (t = 0);
+  }
+  return t;
+};
+d.dividedBy = d.div = function(n) {
+  return E(this, new this.constructor(n));
+};
+d.dividedToIntegerBy = d.divToInt = function(n) {
+  var r = this, t = r.constructor;
+  return g(
+    E(r, new t(n), 0, 1, 1),
+    t.precision,
+    t.rounding
+  );
+};
+d.equals = d.eq = function(n) {
+  return this.cmp(n) === 0;
+};
+d.floor = function() {
+  return g(new this.constructor(this), this.e + 1, 3);
+};
+d.greaterThan = d.gt = function(n) {
+  return this.cmp(n) > 0;
+};
+d.greaterThanOrEqualTo = d.gte = function(n) {
+  var r = this.cmp(n);
+  return r == 1 || r === 0;
+};
+d.hyperbolicCosine = d.cosh = function() {
+  var n, r, t, e, s, i = this, o = i.constructor, u = new o(1);
+  if (!i.isFinite()) return new o(i.s ? 1 / 0 : NaN);
+  if (i.isZero()) return u;
+  t = o.precision, e = o.rounding, o.precision = t + Math.max(i.e, i.sd()) + 4, o.rounding = 1, s = i.d.length, s < 32 ? (n = Math.ceil(s / 3), r = (1 / en(4, n)).toString()) : (n = 16, r = "2.3283064365386962890625e-10"), i = V(o, 1, i.times(r), new o(1), !0);
+  for (var f, c = n, a = new o(8); c--; )
+    f = i.times(i), i = u.minus(f.times(a.minus(f.times(a))));
+  return g(i, o.precision = t, o.rounding = e, !0);
+};
+d.hyperbolicSine = d.sinh = function() {
+  var n, r, t, e, s = this, i = s.constructor;
+  if (!s.isFinite() || s.isZero()) return new i(s);
+  if (r = i.precision, t = i.rounding, i.precision = r + Math.max(s.e, s.sd()) + 4, i.rounding = 1, e = s.d.length, e < 3)
+    s = V(i, 2, s, s, !0);
+  else {
+    n = 1.4 * Math.sqrt(e), n = n > 16 ? 16 : n | 0, s = s.times(1 / en(5, n)), s = V(i, 2, s, s, !0);
+    for (var o, u = new i(5), f = new i(16), c = new i(20); n--; )
+      o = s.times(s), s = s.times(u.plus(o.times(f.times(o).plus(c))));
+  }
+  return i.precision = r, i.rounding = t, g(s, r, t, !0);
+};
+d.hyperbolicTangent = d.tanh = function() {
+  var n, r, t = this, e = t.constructor;
+  return t.isFinite() ? t.isZero() ? new e(t) : (n = e.precision, r = e.rounding, e.precision = n + 7, e.rounding = 1, E(
+    t.sinh(),
+    t.cosh(),
+    e.precision = n,
+    e.rounding = r
+  )) : new e(t.s);
+};
+d.inverseCosine = d.acos = function() {
+  var n = this, r = n.constructor, t = n.abs().cmp(1), e = r.precision, s = r.rounding;
+  return t !== -1 ? t === 0 ? (
+    // |x| is 1
+    n.isNeg() ? T(r, e, s) : new r(0)
+  ) : (
+    // |x| > 1 or x is NaN
+    new r(NaN)
+  ) : n.isZero() ? T(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));
+};
+d.inverseHyperbolicCosine = d.acosh = function() {
+  var n, r, t = this, e = t.constructor;
+  return t.lte(1) ? new e(t.eq(1) ? 0 : NaN) : t.isFinite() ? (n = e.precision, r = e.rounding, e.precision = n + Math.max(Math.abs(t.e), t.sd()) + 4, e.rounding = 1, m = !1, t = t.times(t).minus(1).sqrt().plus(t), m = !0, e.precision = n, e.rounding = r, t.ln()) : new e(t);
+};
+d.inverseHyperbolicSine = d.asinh = function() {
+  var n, r, t = this, e = t.constructor;
+  return !t.isFinite() || t.isZero() ? new e(t) : (n = e.precision, r = e.rounding, e.precision = n + 2 * Math.max(Math.abs(t.e), t.sd()) + 6, e.rounding = 1, m = !1, t = t.times(t).plus(1).sqrt().plus(t), m = !0, e.precision = n, e.rounding = r, t.ln());
+};
+d.inverseHyperbolicTangent = d.atanh = function() {
+  var n, r, t, e, s = this, i = s.constructor;
+  return s.isFinite() ? s.e >= 0 ? new i(s.abs().eq(1) ? s.s / 0 : s.isZero() ? s : NaN) : (n = i.precision, r = i.rounding, e = s.sd(), Math.max(e, n) < 2 * -s.e - 1 ? g(new i(s), n, r, !0) : (i.precision = t = e - s.e, s = E(s.plus(1), new i(1).minus(s), t + n, 1), i.precision = n + 4, i.rounding = 1, s = s.ln(), i.precision = n, i.rounding = r, s.times(0.5))) : new i(NaN);
+};
+d.inverseSine = d.asin = function() {
+  var n, r, t, e, s = this, i = s.constructor;
+  return s.isZero() ? new i(s) : (r = s.abs().cmp(1), t = i.precision, e = i.rounding, r !== -1 ? r === 0 ? (n = T(i, t + 4, e).times(0.5), n.s = s.s, n) : new i(NaN) : (i.precision = t + 6, i.rounding = 1, s = s.div(new i(1).minus(s.times(s)).sqrt().plus(1)).atan(), i.precision = t, i.rounding = e, s.times(2)));
+};
+d.inverseTangent = d.atan = function() {
+  var n, r, t, e, s, i, o, u, f, c = this, a = c.constructor, l = a.precision, h = a.rounding;
+  if (c.isFinite()) {
+    if (c.isZero())
+      return new a(c);
+    if (c.abs().eq(1) && l + 4 <= ln)
+      return o = T(a, l + 4, h).times(0.25), o.s = c.s, o;
+  } else {
+    if (!c.s) return new a(NaN);
+    if (l + 4 <= ln)
+      return o = T(a, l + 4, h).times(0.5), o.s = c.s, o;
+  }
+  for (a.precision = u = l + 10, a.rounding = 1, t = Math.min(28, u / w + 2 | 0), n = t; n; --n) c = c.div(c.times(c).plus(1).sqrt().plus(1));
+  for (m = !1, r = Math.ceil(u / w), e = 1, f = c.times(c), o = new a(c), s = c; n !== -1; )
+    if (s = s.times(f), i = o.minus(s.div(e += 2)), s = s.times(f), o = i.plus(s.div(e += 2)), o.d[r] !== void 0) for (n = r; o.d[n] === i.d[n] && n--; ) ;
+  return t && (o = o.times(2 << t - 1)), m = !0, g(o, a.precision = l, a.rounding = h, !0);
+};
+d.isFinite = function() {
+  return !!this.d;
+};
+d.isInteger = d.isInt = function() {
+  return !!this.d && A(this.e / w) > this.d.length - 2;
+};
+d.isNaN = function() {
+  return !this.s;
+};
+d.isNegative = d.isNeg = function() {
+  return this.s < 0;
+};
+d.isPositive = d.isPos = function() {
+  return this.s > 0;
+};
+d.isZero = function() {
+  return !!this.d && this.d[0] === 0;
+};
+d.lessThan = d.lt = function(n) {
+  return this.cmp(n) < 0;
+};
+d.lessThanOrEqualTo = d.lte = function(n) {
+  return this.cmp(n) < 1;
+};
+d.logarithm = d.log = function(n) {
+  var r, t, e, s, i, o, u, f, c = this, a = c.constructor, l = a.precision, h = a.rounding, p = 5;
+  if (n == null)
+    n = new a(10), r = !0;
+  else {
+    if (n = new a(n), t = n.d, n.s < 0 || !t || !t[0] || n.eq(1)) return new a(NaN);
+    r = n.eq(10);
+  }
+  if (t = c.d, c.s < 0 || !t || !t[0] || c.eq(1))
+    return new a(t && !t[0] ? -1 / 0 : c.s != 1 ? NaN : t ? 0 : 1 / 0);
+  if (r)
+    if (t.length > 1)
+      i = !0;
+    else {
+      for (s = t[0]; s % 10 === 0; ) s /= 10;
+      i = s !== 1;
+    }
+  if (m = !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, h))
+    do
+      if (u += 10, o = C(c, u), e = r ? nn(a, u + 10) : C(n, u), f = E(o, e, u, 1), !i) {
+        +q(f.d).slice(s + 1, s + 15) + 1 == 1e14 && (f = g(f, l + 1, 0));
+        break;
+      }
+    while (j(f.d, s += 10, h));
+  return m = !0, g(f, l, h);
+};
+d.minus = d.sub = function(n) {
+  var r, t, e, s, i, o, u, f, c, a, l, h, p = this, N = p.constructor;
+  if (n = new N(n), !p.d || !n.d)
+    return !p.s || !n.s ? n = new N(NaN) : p.d ? n.s = -n.s : n = new N(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, h = n.d, u = N.precision, f = N.rounding, !c[0] || !h[0]) {
+    if (h[0]) n.s = -n.s;
+    else if (c[0]) n = new N(p);
+    else return new N(f === 3 ? -0 : 0);
+    return m ? g(n, u, f) : n;
+  }
+  if (t = A(n.e / w), a = A(p.e / w), c = c.slice(), i = a - t, i) {
+    for (l = i < 0, l ? (r = c, i = -i, o = h.length) : (r = h, t = a, o = c.length), e = Math.max(Math.ceil(u / w), o) + 2, i > e && (i = e, r.length = 1), r.reverse(), e = i; e--; ) r.push(0);
+    r.reverse();
+  } else {
+    for (e = c.length, o = h.length, l = e < o, l && (o = e), e = 0; e < o; e++)
+      if (c[e] != h[e]) {
+        l = c[e] < h[e];
+        break;
+      }
+    i = 0;
+  }
+  for (l && (r = c, c = h, h = r, n.s = -n.s), o = c.length, e = h.length - o; e > 0; --e) c[o++] = 0;
+  for (e = h.length; e > i; ) {
+    if (c[--e] < h[e]) {
+      for (s = e; s && c[--s] === 0; ) c[s] = S - 1;
+      --c[s], c[e] += S;
+    }
+    c[e] -= h[e];
+  }
+  for (; c[--o] === 0; ) c.pop();
+  for (; c[0] === 0; c.shift()) --t;
+  return c[0] ? (n.d = c, n.e = tn(c, t), m ? g(n, u, f) : n) : new N(f === 3 ? -0 : 0);
+};
+d.modulo = d.mod = function(n) {
+  var r, t = this, e = t.constructor;
+  return n = new e(n), !t.d || !n.s || n.d && !n.d[0] ? new e(NaN) : !n.d || t.d && !t.d[0] ? g(new e(t), e.precision, e.rounding) : (m = !1, e.modulo == 9 ? (r = E(t, n.abs(), 0, 3, 1), r.s *= n.s) : r = E(t, n, 0, e.modulo, 1), r = r.times(n), m = !0, t.minus(r));
+};
+d.naturalExponential = d.exp = function() {
+  return hn(this);
+};
+d.naturalLogarithm = d.ln = function() {
+  return C(this);
+};
+d.negated = d.neg = function() {
+  var n = new this.constructor(this);
+  return n.s = -n.s, g(n);
+};
+d.plus = d.add = function(n) {
+  var r, t, e, s, i, o, u, f, c, a, l = this, h = l.constructor;
+  if (n = new h(n), !l.d || !n.d)
+    return !l.s || !n.s ? n = new h(NaN) : l.d || (n = new h(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 = h.precision, f = h.rounding, !c[0] || !a[0])
+    return a[0] || (n = new h(l)), m ? g(n, u, f) : n;
+  if (i = A(l.e / w), e = A(n.e / w), c = c.slice(), s = i - e, s) {
+    for (s < 0 ? (t = c, s = -s, o = a.length) : (t = a, e = i, o = c.length), i = Math.ceil(u / w), o = i > o ? i + 1 : o + 1, s > o && (s = o, t.length = 1), t.reverse(); s--; ) t.push(0);
+    t.reverse();
+  }
+  for (o = c.length, s = a.length, o - s < 0 && (s = o, t = a, a = c, c = t), r = 0; s; )
+    r = (c[--s] = c[s] + a[s] + r) / S | 0, c[s] %= S;
+  for (r && (c.unshift(r), ++e), o = c.length; c[--o] == 0; ) c.pop();
+  return n.d = c, n.e = tn(c, e), m ? g(n, u, f) : n;
+};
+d.precision = d.sd = function(n) {
+  var r, t = this;
+  if (n !== void 0 && n !== !!n && n !== 1 && n !== 0)
+    throw Error(H + n);
+  return t.d ? (r = xn(t.d), n && t.e + 1 > r && (r = t.e + 1)) : r = NaN, r;
+};
+d.round = function() {
+  var n = this, r = n.constructor;
+  return g(new r(n), n.e + 1, r.rounding);
+};
+d.sine = d.sin = function() {
+  var n, r, t = this, e = t.constructor;
+  return t.isFinite() ? t.isZero() ? new e(t) : (n = e.precision, r = e.rounding, e.precision = n + Math.max(t.e, t.sd()) + w, e.rounding = 1, t = _n(e, On(e, t)), e.precision = n, e.rounding = r, g(k > 2 ? t.neg() : t, n, r, !0)) : new e(NaN);
+};
+d.squareRoot = d.sqrt = function() {
+  var n, r, t, e, s, i, 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 (m = !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()), t = (f = a.precision) + 3; ; )
+    if (i = e, e = i.plus(E(o, i, t + 2, 1)).times(0.5), q(i.d).slice(0, t) === (r = q(e.d)).slice(0, t))
+      if (r = r.slice(t - 3, t + 1), r == "9999" || !s && r == "4999") {
+        if (!s && (g(i, f + 1, 0), i.times(i).eq(o))) {
+          e = i;
+          break;
+        }
+        t += 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 m = !0, g(e, f, a.rounding, n);
+};
+d.tangent = d.tan = function() {
+  var n, r, t = this, e = t.constructor;
+  return t.isFinite() ? t.isZero() ? new e(t) : (n = e.precision, r = e.rounding, e.precision = n + 10, e.rounding = 1, t = t.sin(), t.s = 1, t = E(t, new e(1).minus(t.times(t)).sqrt(), n + 10, 0), e.precision = n, e.rounding = r, g(k == 2 || k == 4 ? t.neg() : t, n, r, !0)) : new e(NaN);
+};
+d.times = d.mul = function(n) {
+  var r, t, e, s, i, o, u, f, c, a = this, l = a.constructor, h = a.d, p = (n = new l(n)).d;
+  if (n.s *= a.s, !h || !h[0] || !p || !p[0])
+    return new l(
+      !n.s || h && !h[0] && !p || p && !p[0] && !h ? (
+        // 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.
+        !h || !p ? n.s / 0 : n.s * 0
+      )
+    );
+  for (t = A(a.e / w) + A(n.e / w), f = h.length, c = p.length, f < c && (i = h, h = p, p = i, o = f, f = c, c = o), i = [], o = f + c, e = o; e--; ) i.push(0);
+  for (e = c; --e >= 0; ) {
+    for (r = 0, s = f + e; s > e; )
+      u = i[s] + p[e] * h[s - e - 1] + r, i[s--] = u % S | 0, r = u / S | 0;
+    i[s] = (i[s] + r) % S | 0;
+  }
+  for (; !i[--o]; ) i.pop();
+  return r ? ++t : i.shift(), n.d = i, n.e = tn(i, t), m ? g(n, l.precision, l.rounding) : n;
+};
+d.toBinary = function(n, r) {
+  return dn(this, 2, n, r);
+};
+d.toDecimalPlaces = d.toDP = function(n, r) {
+  var t = this, e = t.constructor;
+  return t = new e(t), n === void 0 ? t : (Z(n, 0, B), r === void 0 ? r = e.rounding : Z(r, 0, 8), g(t, n + t.e + 1, r));
+};
+d.toExponential = function(n, r) {
+  var t, e = this, s = e.constructor;
+  return n === void 0 ? t = L(e, !0) : (Z(n, 0, B), r === void 0 ? r = s.rounding : Z(r, 0, 8), e = g(new s(e), n + 1, r), t = L(e, !0, n + 1)), e.isNeg() && !e.isZero() ? "-" + t : t;
+};
+d.toFixed = function(n, r) {
+  var t, e, s = this, i = s.constructor;
+  return n === void 0 ? t = L(s) : (Z(n, 0, B), r === void 0 ? r = i.rounding : Z(r, 0, 8), e = g(new i(s), n + s.e + 1, r), t = L(e, !1, n + e.e + 1)), s.isNeg() && !s.isZero() ? "-" + t : t;
+};
+d.toFraction = function(n) {
+  var r, t, e, s, i, o, u, f, c, a, l, h, p = this, N = p.d, v = p.constructor;
+  if (!N) return new v(p);
+  if (c = t = new v(1), e = f = new v(0), r = new v(e), i = r.e = xn(N) - p.e - 1, o = i % w, r.d[0] = M(10, o < 0 ? w + o : o), n == null)
+    n = i > 0 ? r : c;
+  else {
+    if (u = new v(n), !u.isInt() || u.lt(c)) throw Error(H + u);
+    n = u.gt(r) ? i > 0 ? r : c : u;
+  }
+  for (m = !1, u = new v(q(N)), a = v.precision, v.precision = i = N.length * w * 2; l = E(u, r, 0, 1, 1), s = t.plus(l.times(e)), s.cmp(n) != 1; )
+    t = 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(t), e, 0, 1, 1), f = f.plus(s.times(c)), t = t.plus(s.times(e)), f.s = c.s = p.s, h = E(c, e, i, 1).minus(p).abs().cmp(E(f, t, i, 1).minus(p).abs()) < 1 ? [c, e] : [f, t], v.precision = a, m = !0, h;
+};
+d.toHexadecimal = d.toHex = function(n, r) {
+  return dn(this, 16, n, r);
+};
+d.toNearest = function(n, r) {
+  var t = this, e = t.constructor;
+  if (t = new e(t), n == null) {
+    if (!t.d) return t;
+    n = new e(1), r = e.rounding;
+  } else {
+    if (n = new e(n), r === void 0 ? r = e.rounding : Z(r, 0, 8), !t.d) return n.s ? t : n;
+    if (!n.d)
+      return n.s && (n.s = t.s), n;
+  }
+  return n.d[0] ? (m = !1, t = E(t, n, 0, r, 1).times(n), m = !0, g(t)) : (n.s = t.s, t = n), t;
+};
+d.toNumber = function() {
+  return +this;
+};
+d.toOctal = function(n, r) {
+  return dn(this, 8, n, r);
+};
+d.toPower = d.pow = function(n) {
+  var r, t, e, s, i, 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, i = f.rounding, n.eq(1)) return g(u, e, i);
+  if (r = A(n.e / w), r >= n.d.length - 1 && (t = c < 0 ? -c : c) <= Pn)
+    return s = yn(f, u, t, e), n.s < 0 ? new f(1).div(s) : g(s, e, i);
+  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 t = M(+u, c), r = t == 0 || !isFinite(t) ? A(
+    c * (Math.log("0." + q(u.d)) / Math.LN10 + u.e + 1)
+  ) : new f(t + "").e, r > f.maxE + 1 || r < f.minE - 1 ? new f(r > 0 ? o / 0 : 0) : (m = !1, f.rounding = u.s = 1, t = Math.min(12, (r + "").length), s = hn(n.times(C(u, e + t)), e), s.d && (s = g(s, e + 5, 1), j(s.d, e, i) && (r = e + 10, s = g(
+    hn(n.times(C(u, r + t)), r),
+    r + 5,
+    1
+  ), +q(s.d).slice(e + 1, e + 15) + 1 == 1e14 && (s = g(s, e + 1, 0)))), s.s = o, m = !0, f.rounding = i, g(s, e, i));
+};
+d.toPrecision = function(n, r) {
+  var t, e = this, s = e.constructor;
+  return n === void 0 ? t = L(e, e.e <= s.toExpNeg || e.e >= s.toExpPos) : (Z(n, 1, B), r === void 0 ? r = s.rounding : Z(r, 0, 8), e = g(new s(e), n, r), t = L(e, n <= e.e || e.e <= s.toExpNeg, n)), e.isNeg() && !e.isZero() ? "-" + t : t;
+};
+d.toSignificantDigits = d.toSD = function(n, r) {
+  var t = this, e = t.constructor;
+  return n === void 0 ? (n = e.precision, r = e.rounding) : (Z(n, 1, B), r === void 0 ? r = e.rounding : Z(r, 0, 8)), g(new e(t), n, r);
+};
+d.toString = function() {
+  var n = this, r = n.constructor, t = L(n, n.e <= r.toExpNeg || n.e >= r.toExpPos);
+  return n.isNeg() && !n.isZero() ? "-" + t : t;
+};
+d.truncated = d.trunc = function() {
+  return g(new this.constructor(this), this.e + 1, 1);
+};
+d.valueOf = d.toJSON = function() {
+  var n = this, r = n.constructor, t = L(n, n.e <= r.toExpNeg || n.e >= r.toExpPos);
+  return n.isNeg() ? "-" + t : t;
+};
+function q(n) {
+  var r, t, e, s = n.length - 1, i = "", o = n[0];
+  if (s > 0) {
+    for (i += o, r = 1; r < s; r++)
+      e = n[r] + "", t = w - e.length, t && (i += I(t)), i += e;
+    o = n[r], e = o + "", t = w - e.length, t && (i += I(t));
+  } else if (o === 0)
+    return "0";
+  for (; o % 10 === 0; ) o /= 10;
+  return i + o;
+}
+function Z(n, r, t) {
+  if (n !== ~~n || n < r || n > t)
+    throw Error(H + n);
+}
+function j(n, r, t, e) {
+  var s, i, o, u;
+  for (i = n[0]; i >= 10; i /= 10) --r;
+  return --r < 0 ? (r += w, s = 0) : (s = Math.ceil((r + 1) / w), r %= w), i = M(10, w - r), u = n[s] % i | 0, e == null ? r < 3 ? (r == 0 ? u = u / 100 | 0 : r == 1 && (u = u / 10 | 0), o = t < 4 && u == 99999 || t > 3 && u == 49999 || u == 5e4 || u == 0) : o = (t < 4 && u + 1 == i || t > 3 && u + 1 == i / 2) && (n[s + 1] / i / 100 | 0) == M(10, r - 2) - 1 || (u == i / 2 || u == 0) && (n[s + 1] / i / 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 || t < 4) && u == 9999 || !e && t > 3 && u == 4999) : o = ((e || t < 4) && u + 1 == i || !e && t > 3 && u + 1 == i / 2) && (n[s + 1] / i / 1e3 | 0) == M(10, r - 3) - 1, o;
+}
+function K(n, r, t) {
+  for (var e, s = [0], i, o = 0, u = n.length; o < u; ) {
+    for (i = s.length; i--; ) s[i] *= r;
+    for (s[0] += fn.indexOf(n.charAt(o++)), e = 0; e < s.length; e++)
+      s[e] > t - 1 && (s[e + 1] === void 0 && (s[e + 1] = 0), s[e + 1] += s[e] / t | 0, s[e] %= t);
+  }
+  return s.reverse();
+}
+function Sn(n, r) {
+  var t, e, s;
+  if (r.isZero()) return r;
+  e = r.d.length, e < 32 ? (t = Math.ceil(e / 3), s = (1 / en(4, t)).toString()) : (t = 16, s = "2.3283064365386962890625e-10"), n.precision += t, r = V(n, 1, r.times(s), new n(1));
+  for (var i = t; i--; ) {
+    var o = r.times(r);
+    r = o.times(o).minus(o).times(8).plus(1);
+  }
+  return n.precision -= t, r;
+}
+var E = /* @__PURE__ */ function() {
+  function n(e, s, i) {
+    var o, u = 0, f = e.length;
+    for (e = e.slice(); f--; )
+      o = e[f] * s + u, e[f] = o % i | 0, u = o / i | 0;
+    return u && e.unshift(u), e;
+  }
+  function r(e, s, i, o) {
+    var u, f;
+    if (i != o)
+      f = i > o ? 1 : -1;
+    else
+      for (u = f = 0; u < i; u++)
+        if (e[u] != s[u]) {
+          f = e[u] > s[u] ? 1 : -1;
+          break;
+        }
+    return f;
+  }
+  function t(e, s, i, o) {
+    for (var u = 0; i--; )
+      e[i] -= u, u = e[i] < s[i] ? 1 : 0, e[i] = u * o + e[i] - s[i];
+    for (; !e[0] && e.length > 1; ) e.shift();
+  }
+  return function(e, s, i, o, u, f) {
+    var c, a, l, h, p, N, v, D, y, P, b, O, W, U, sn, J, $, on, R, 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 = S, p = w, a = A(e.e / p) - A(s.e / p)), R = x.length, $ = F.length, y = new G(un), P = y.d = [], l = 0; x[l] == (F[l] || 0); l++) ;
+    if (x[l] > (F[l] || 0) && a--, i == null ? (U = i = G.precision, o = G.rounding) : u ? U = i + (e.e - s.e) + 1 : U = i, U < 0)
+      P.push(1), N = !0;
+    else {
+      if (U = U / p + 2 | 0, l = 0, R == 1) {
+        for (h = 0, x = x[0], U++; (l < $ || h) && U--; l++)
+          sn = h * f + (F[l] || 0), P[l] = sn / x | 0, h = sn % x | 0;
+        N = h || l < $;
+      } else {
+        for (h = f / (x[0] + 1) | 0, h > 1 && (x = n(x, h, f), F = n(F, h, f), R = x.length, $ = F.length), J = R, b = F.slice(0, R), O = b.length; O < R; ) b[O++] = 0;
+        z = x.slice(), z.unshift(0), on = x[0], x[1] >= f / 2 && ++on;
+        do
+          h = 0, c = r(x, b, R, O), c < 0 ? (W = b[0], R != O && (W = W * f + (b[1] || 0)), h = W / on | 0, h > 1 ? (h >= f && (h = f - 1), v = n(x, h, f), D = v.length, O = b.length, c = r(v, b, D, O), c == 1 && (h--, t(v, R < D ? z : x, D, f))) : (h == 0 && (c = h = 1), v = x.slice()), D = v.length, D < O && v.unshift(0), t(b, v, O, f), c == -1 && (O = b.length, c = r(x, b, R, O), c < 1 && (h++, t(b, R < O ? z : x, O, f))), O = b.length) : c === 0 && (h++, b = [0]), P[l++] = h, c && b[0] ? b[O++] = F[J] || 0 : (b = [F[J]], O = 1);
+        while ((J++ < $ || b[0] !== void 0) && U--);
+        N = b[0] !== void 0;
+      }
+      P[0] || P.shift();
+    }
+    if (p == 1)
+      y.e = a, mn = N;
+    else {
+      for (l = 1, h = P[0]; h >= 10; h /= 10) l++;
+      y.e = l + a * p - 1, g(y, u ? i + y.e + 1 : i, o, N);
+    }
+    return y;
+  };
+}();
+function g(n, r, t, e) {
+  var s, i, o, u, f, c, a, l, h, 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 (i = r - s, i < 0)
+      i += w, o = r, a = l[h = 0], f = a / M(10, s - o - 1) % 10 | 0;
+    else if (h = Math.ceil((i + 1) / w), u = l.length, h >= u)
+      if (e) {
+        for (; u++ <= h; ) l.push(0);
+        a = f = 0, s = 1, i %= w, o = i - w + 1;
+      } else
+        break n;
+    else {
+      for (a = u = l[h], s = 1; u >= 10; u /= 10) s++;
+      i %= w, o = i - w + s, f = o < 0 ? 0 : a / M(10, s - o - 1) % 10 | 0;
+    }
+    if (e = e || r < 0 || l[h + 1] !== void 0 || (o < 0 ? a : a % M(10, s - o - 1)), c = t < 4 ? (f || e) && (t == 0 || t == (n.s < 0 ? 3 : 2)) : f > 5 || f == 5 && (t == 4 || e || t == 6 && // Check whether the digit to the left of the rounding digit is odd.
+    (i > 0 ? o > 0 ? a / M(10, s - o) : 0 : l[h - 1]) % 10 & 1 || t == (n.s < 0 ? 8 : 7)), r < 1 || !l[0])
+      return l.length = 0, c ? (r -= n.e + 1, l[0] = M(10, (w - r % w) % w), n.e = -r || 0) : l[0] = n.e = 0, n;
+    if (i == 0 ? (l.length = h, u = 1, h--) : (l.length = h + 1, u = M(10, w - i), l[h] = o > 0 ? (a / M(10, s - o) % M(10, o) | 0) * u : 0), c)
+      for (; ; )
+        if (h == 0) {
+          for (i = 1, o = l[0]; o >= 10; o /= 10) i++;
+          for (o = l[0] += u, u = 1; o >= 10; o /= 10) u++;
+          i != u && (n.e++, l[0] == S && (l[0] = 1));
+          break;
+        } else {
+          if (l[h] += u, l[h] != S) break;
+          l[h--] = 0, u = 1;
+        }
+    for (i = l.length; l[--i] === 0; ) l.pop();
+  }
+  return m && (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, t) {
+  if (!n.isFinite()) return qn(n);
+  var e, s = n.e, i = q(n.d), o = i.length;
+  return r ? (t && (e = t - o) > 0 ? i = i.charAt(0) + "." + i.slice(1) + I(e) : o > 1 && (i = i.charAt(0) + "." + i.slice(1)), i = i + (n.e < 0 ? "e" : "e+") + n.e) : s < 0 ? (i = "0." + I(-s - 1) + i, t && (e = t - o) > 0 && (i += I(e))) : s >= o ? (i += I(s + 1 - o), t && (e = t - s - 1) > 0 && (i = i + "." + I(e))) : ((e = s + 1) < o && (i = i.slice(0, e) + "." + i.slice(e)), t && (e = t - o) > 0 && (s + 1 === o && (i += "."), i += I(e))), i;
+}
+function tn(n, r) {
+  var t = n[0];
+  for (r *= w; t >= 10; t /= 10) r++;
+  return r;
+}
+function nn(n, r, t) {
+  if (r > Rn)
+    throw m = !0, t && (n.precision = t), Error(vn);
+  return g(new n(X), r, 1, !0);
+}
+function T(n, r, t) {
+  if (r > ln) throw Error(vn);
+  return g(new n(Y), r, t, !0);
+}
+function xn(n) {
+  var r = n.length - 1, t = r * w + 1;
+  if (r = n[r], r) {
+    for (; r % 10 == 0; r /= 10) t--;
+    for (r = n[0]; r >= 10; r /= 10) t++;
+  }
+  return t;
+}
+function I(n) {
+  for (var r = ""; n--; ) r += "0";
+  return r;
+}
+function yn(n, r, t, e) {
+  var s, i = new n(1), o = Math.ceil(e / w + 4);
+  for (m = !1; ; ) {
+    if (t % 2 && (i = i.times(r), pn(i.d, o) && (s = !0)), t = A(t / 2), t === 0) {
+      t = i.d.length - 1, s && i.d[t] === 0 && ++i.d[t];
+      break;
+    }
+    r = r.times(r), pn(r.d, o);
+  }
+  return m = !0, i;
+}
+function gn(n) {
+  return n.d[n.d.length - 1] & 1;
+}
+function Mn(n, r, t) {
+  for (var e, s, i = new n(r[0]), o = 0; ++o < r.length; ) {
+    if (s = new n(r[o]), !s.s) {
+      i = s;
+      break;
+    }
+    e = i.cmp(s), (e === t || e === 0 && i.s === t) && (i = s);
+  }
+  return i;
+}
+function hn(n, r) {
+  var t, e, s, i, o, u, f, c = 0, a = 0, l = 0, h = n.constructor, p = h.rounding, N = h.precision;
+  if (!n.d || !n.d[0] || n.e > 17)
+    return new h(
+      n.d ? n.d[0] ? n.s < 0 ? 0 : 1 / 0 : 1 : n.s ? n.s < 0 ? 0 : n : NaN
+    );
+  for (r == null ? (m = !1, f = N) : f = r, u = new h(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, t = i = o = new h(1), h.precision = f; ; ) {
+    if (i = g(i.times(n), f, 1), t = t.times(++a), u = o.plus(E(i, t, 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))
+          h.precision = f += 10, t = i = u = new h(1), a = 0, c++;
+        else
+          return g(o, h.precision = N, p, m = !0);
+      else
+        return h.precision = N, o;
+    }
+    o = u;
+  }
+}
+function C(n, r) {
+  var t, e, s, i, o, u, f, c, a, l, h, p = 1, N = 10, v = n, D = v.d, y = v.constructor, P = y.rounding, b = y.precision;
+  if (v.s < 0 || !D || !D[0] || !v.e && D[0] == 1 && D.length == 1)
+    return new y(D && !D[0] ? -1 / 0 : v.s != 1 ? NaN : D ? 0 : v);
+  if (r == null ? (m = !1, a = b) : a = r, y.precision = a += N, t = q(D), e = t.charAt(0), Math.abs(i = v.e) < 15e14) {
+    for (; e < 7 && e != 1 || e == 1 && t.charAt(1) > 3; )
+      v = v.times(n), t = q(v.d), e = t.charAt(0), p++;
+    i = v.e, e > 1 ? (v = new y("0." + t), i++) : v = new y(e + "." + t.slice(1));
+  } else
+    return c = nn(y, a + 2, b).times(i + ""), v = C(new y(e + "." + t.slice(1)), a - N).plus(c), y.precision = b, r == null ? g(v, b, P, m = !0) : v;
+  for (l = v, f = o = v = E(v.minus(1), v.plus(1), a, 1), h = g(v.times(v), a, 1), s = 3; ; ) {
+    if (o = g(o.times(h), 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), i !== 0 && (f = f.plus(nn(y, a + 2, b).times(i + ""))), f = E(f, new y(p), a, 1), r == null)
+        if (j(f.d, a - N, P, u))
+          y.precision = a += N, c = o = v = E(l.minus(1), l.plus(1), a, 1), h = g(v.times(v), a, 1), s = u = 1;
+        else
+          return g(f, y.precision = b, P, m = !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 t, e, s;
+  for ((t = r.indexOf(".")) > -1 && (r = r.replace(".", "")), (e = r.search(/e/i)) > 0 ? (t < 0 && (t = e), t += +r.slice(e + 1), r = r.substring(0, e)) : t < 0 && (t = 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 = t = t - e - 1, n.d = [], e = (t + 1) % w, t < 0 && (e += w), e < s) {
+      for (e && n.d.push(+r.slice(0, e)), s -= w; e < s; ) n.d.push(+r.slice(e, e += w));
+      r = r.slice(e), e = w - r.length;
+    } else
+      e -= s;
+    for (; e--; ) r += "0";
+    n.d.push(+r), m && (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 Tn(n, r) {
+  var t, e, s, i, 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 (Dn.test(r))
+    t = 16, r = r.toLowerCase();
+  else if (An.test(r))
+    t = 2;
+  else if (Zn.test(r))
+    t = 8;
+  else
+    throw Error(H + r);
+  for (i = r.search(/p/i), i > 0 ? (f = +r.slice(i + 1), r = r.substring(2, i)) : r = r.slice(2), i = r.indexOf("."), o = i >= 0, e = n.constructor, o && (r = r.replace(".", ""), u = r.length, i = u - i, s = yn(e, new e(t), i, i * 2)), c = K(r, t, S), a = c.length - 1, i = a; c[i] === 0; --i) c.pop();
+  return i < 0 ? new e(n.s * 0) : (n.e = tn(c, a), n.d = c, m = !1, o && (n = E(n, s, u * 4)), f && (n = n.times(Math.abs(f) < 54 ? M(2, f) : _.pow(2, f))), m = !0, n);
+}
+function _n(n, r) {
+  var t, e = r.d.length;
+  if (e < 3)
+    return r.isZero() ? r : V(n, 2, r, r);
+  t = 1.4 * Math.sqrt(e), t = t > 16 ? 16 : t | 0, r = r.times(1 / en(5, t)), r = V(n, 2, r, r);
+  for (var s, i = new n(5), o = new n(16), u = new n(20); t--; )
+    s = r.times(r), r = r.times(i.plus(s.times(o.times(s).minus(u))));
+  return r;
+}
+function V(n, r, t, e, s) {
+  var i, o, u, f, c = n.precision, a = Math.ceil(c / w);
+  for (m = !1, f = t.times(t), 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 (i = a; o.d[i] === u.d[i] && i--; ) ;
+      if (i == -1) break;
+    }
+    i = u, u = e, e = o, o = i;
+  }
+  return m = !0, o.d.length = a + 1, o;
+}
+function en(n, r) {
+  for (var t = n; --r; ) t *= n;
+  return t;
+}
+function On(n, r) {
+  var t, e = r.s < 0, s = T(n, n.precision, 1), i = s.times(0.5);
+  if (r = r.abs(), r.lte(i))
+    return k = e ? 4 : 1, r;
+  if (t = r.divToInt(s), t.isZero())
+    k = e ? 3 : 2;
+  else {
+    if (r = r.minus(t.times(s)), r.lte(i))
+      return k = gn(t) ? e ? 2 : 3 : e ? 4 : 1, r;
+    k = gn(t) ? e ? 1 : 4 : e ? 3 : 2;
+  }
+  return r.minus(s).abs();
+}
+function dn(n, r, t, e) {
+  var s, i, o, u, f, c, a, l, h, p = n.constructor, N = t !== void 0;
+  if (N ? (Z(t, 1, B), e === void 0 ? e = p.rounding : Z(e, 0, 8)) : (t = p.precision, e = p.rounding), !n.isFinite())
+    a = qn(n);
+  else {
+    for (a = L(n), o = a.indexOf("."), N ? (s = 2, r == 16 ? t = t * 4 - 3 : r == 8 && (t = t * 3 - 2)) : s = r, o >= 0 && (a = a.replace(".", ""), h = new p(1), h.e = a.length - o, h.d = K(L(h), 10, s), h.e = h.d.length), l = K(a, 10, s), i = f = l.length; l[--f] == 0; ) l.pop();
+    if (!l[0])
+      a = N ? "0p+0" : "0";
+    else {
+      if (o < 0 ? i-- : (n = new p(n), n.d = l, n.e = i, n = E(n, h, t, e, 0, s), l = n.d, i = n.e, c = mn), o = l[t], u = s / 2, c = c || l[t + 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[t - 1] & 1 || e === (n.s < 0 ? 8 : 7)), l.length = t, c)
+        for (; ++l[--t] > s - 1; )
+          l[t] = 0, t || (++i, l.unshift(1));
+      for (f = l.length; !l[f - 1]; --f) ;
+      for (o = 0, a = ""; o < f; o++) a += fn.charAt(l[o]);
+      if (N) {
+        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 + (i < 0 ? "p" : "p+") + i;
+      } else if (i < 0) {
+        for (; ++i; ) a = "0" + a;
+        a = "0." + a;
+      } else if (++i > f) for (i -= f; i--; ) a += "0";
+      else i < f && (a = a.slice(0, i) + "." + a.slice(i));
+    }
+    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 Ln(n) {
+  return new this(n).abs();
+}
+function Un(n) {
+  return new this(n).acos();
+}
+function kn(n) {
+  return new this(n).acosh();
+}
+function In(n, r) {
+  return new this(n).plus(r);
+}
+function Cn(n) {
+  return new this(n).asin();
+}
+function Hn(n) {
+  return new this(n).asinh();
+}
+function Bn(n) {
+  return new this(n).atan();
+}
+function Vn(n) {
+  return new this(n).atanh();
+}
+function $n(n, r) {
+  n = new this(n), r = new this(r);
+  var t, e = this.precision, s = this.rounding, i = e + 4;
+  return !n.s || !r.s ? t = new this(NaN) : !n.d && !r.d ? (t = T(this, i, 1).times(r.s > 0 ? 0.25 : 0.75), t.s = n.s) : !r.d || n.isZero() ? (t = r.s < 0 ? T(this, e, s) : new this(0), t.s = n.s) : !n.d || r.isZero() ? (t = T(this, i, 1).times(0.5), t.s = n.s) : r.s < 0 ? (this.precision = i, this.rounding = 1, t = this.atan(E(n, r, i, 1)), r = T(this, i, 1), this.precision = e, this.rounding = s, t = n.s < 0 ? t.minus(r) : t.plus(r)) : t = this.atan(E(n, r, i, 1)), t;
+}
+function jn(n) {
+  return new this(n).cbrt();
+}
+function Wn(n) {
+  return g(n = new this(n), n.e + 1, 2);
+}
+function Jn(n, r, t) {
+  return new this(n).clamp(r, t);
+}
+function zn(n) {
+  if (!n || typeof n != "object")
+    throw Error(rn + "Object expected");
+  var r, t, e, s = n.defaults === !0, i = [
+    "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 < i.length; r += 3)
+    if (t = i[r], s && (this[t] = an[t]), (e = n[t]) !== void 0)
+      if (A(e) === e && e >= i[r + 1] && e <= i[r + 2]) this[t] = e;
+      else throw Error(H + t + ": " + e);
+  if (t = "crypto", s && (this[t] = an[t]), (e = n[t]) !== void 0)
+    if (e === !0 || e === !1 || e === 0 || e === 1)
+      if (e)
+        if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes))
+          this[t] = !0;
+        else
+          throw Error(Nn);
+      else
+        this[t] = !1;
+    else
+      throw Error(H + t + ": " + e);
+  return this;
+}
+function Gn(n) {
+  return new this(n).cos();
+}
+function Kn(n) {
+  return new this(n).cosh();
+}
+function Fn(n) {
+  var r, t, e;
+  function s(i) {
+    var o, u, f, c = this;
+    if (!(c instanceof s)) return new s(i);
+    if (c.constructor = s, wn(i)) {
+      c.s = i.s, m ? !i.d || i.e > s.maxE ? (c.e = NaN, c.d = null) : i.e < s.minE ? (c.e = 0, c.d = [0]) : (c.e = i.e, c.d = i.d.slice()) : (c.e = i.e, c.d = i.d ? i.d.slice() : i.d);
+      return;
+    }
+    if (f = typeof i, f === "number") {
+      if (i === 0) {
+        c.s = 1 / i < 0 ? -1 : 1, c.e = 0, c.d = [0];
+        return;
+      }
+      if (i < 0 ? (i = -i, c.s = -1) : c.s = 1, i === ~~i && i < 1e7) {
+        for (o = 0, u = i; u >= 10; u /= 10) o++;
+        m ? o > s.maxE ? (c.e = NaN, c.d = null) : o < s.minE ? (c.e = 0, c.d = [0]) : (c.e = o, c.d = [i]) : (c.e = o, c.d = [i]);
+        return;
+      }
+      if (i * 0 !== 0) {
+        i || (c.s = NaN), c.e = NaN, c.d = null;
+        return;
+      }
+      return Q(c, i.toString());
+    }
+    if (f === "string")
+      return (u = i.charCodeAt(0)) === 45 ? (i = i.slice(1), c.s = -1) : (u === 43 && (i = i.slice(1)), c.s = 1), En.test(i) ? Q(c, i) : Tn(c, i);
+    if (f === "bigint")
+      return i < 0 ? (i = -i, c.s = -1) : c.s = 1, Q(c, i.toString());
+    throw Error(H + i);
+  }
+  if (s.prototype = d, 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 = zn, s.clone = Fn, s.isDecimal = wn, s.abs = Ln, s.acos = Un, s.acosh = kn, s.add = In, s.asin = Cn, s.asinh = Hn, s.atan = Bn, s.atanh = Vn, s.atan2 = $n, s.cbrt = jn, s.ceil = Wn, s.clamp = Jn, s.cos = Gn, s.cosh = Kn, s.div = Qn, s.exp = Xn, s.floor = Yn, s.hypot = nr, s.ln = rr, s.log = tr, s.log10 = ir, s.log2 = er, s.max = sr, s.min = or, s.mod = ur, s.mul = cr, s.pow = fr, s.random = ar, s.round = lr, s.sign = hr, s.sin = dr, s.sinh = gr, s.sqrt = pr, s.sub = wr, s.sum = mr, s.tan = vr, s.tanh = Nr, s.trunc = br, n === void 0 && (n = {}), n && n.defaults !== !0)
+    for (e = [
+      "precision",
+      "rounding",
+      "toExpNeg",
+      "toExpPos",
+      "maxE",
+      "minE",
+      "modulo",
+      "crypto"
+    ], r = 0; r < e.length; )
+      Object.prototype.hasOwnProperty.call(n, t = e[r++]) || (n[t] = this[t]);
+  return s.config(n), s;
+}
+function Qn(n, r) {
+  return new this(n).div(r);
+}
+function Xn(n) {
+  return new this(n).exp();
+}
+function Yn(n) {
+  return g(n = new this(n), n.e + 1, 3);
+}
+function nr() {
+  var n, r, t = new this(0);
+  for (m = !1, n = 0; n < arguments.length; )
+    if (r = new this(arguments[n++]), r.d)
+      t.d && (t = t.plus(r.times(r)));
+    else {
+      if (r.s)
+        return m = !0, new this(1 / 0);
+      t = r;
+    }
+  return m = !0, t.sqrt();
+}
+function wn(n) {
+  return n instanceof _ || n && n.toStringTag === bn || !1;
+}
+function rr(n) {
+  return new this(n).ln();
+}
+function tr(n, r) {
+  return new this(n).log(r);
+}
+function er(n) {
+  return new this(n).log(2);
+}
+function ir(n) {
+  return new this(n).log(10);
+}
+function sr() {
+  return Mn(this, arguments, -1);
+}
+function or() {
+  return Mn(this, arguments, 1);
+}
+function ur(n, r) {
+  return new this(n).mod(r);
+}
+function cr(n, r) {
+  return new this(n).mul(r);
+}
+function fr(n, r) {
+  return new this(n).pow(r);
+}
+function ar(n) {
+  var r, t, e, s, i = 0, o = new this(1), u = [];
+  if (n === void 0 ? n = this.precision : Z(n, 1, B), e = Math.ceil(n / w), this.crypto)
+    if (crypto.getRandomValues)
+      for (r = crypto.getRandomValues(new Uint32Array(e)); i < e; )
+        s = r[i], s >= 429e7 ? r[i] = crypto.getRandomValues(new Uint32Array(1))[0] : u[i++] = s % 1e7;
+    else if (crypto.randomBytes) {
+      for (r = crypto.randomBytes(e *= 4); i < e; )
+        s = r[i] + (r[i + 1] << 8) + (r[i + 2] << 16) + ((r[i + 3] & 127) << 24), s >= 214e7 ? crypto.randomBytes(4).copy(r, i) : (u.push(s % 1e7), i += 4);
+      i = e / 4;
+    } else
+      throw Error(Nn);
+  else for (; i < e; ) u[i++] = Math.random() * 1e7 | 0;
+  for (e = u[--i], n %= w, e && n && (s = M(10, w - n), u[i] = (e / s | 0) * s); u[i] === 0; i--) u.pop();
+  if (i < 0)
+    t = 0, u = [0];
+  else {
+    for (t = -1; u[0] === 0; t -= w) u.shift();
+    for (e = 1, s = u[0]; s >= 10; s /= 10) e++;
+    e < w && (t -= w - e);
+  }
+  return o.e = t, o.d = u, o;
+}
+function lr(n) {
+  return g(n = new this(n), n.e + 1, this.rounding);
+}
+function hr(n) {
+  return n = new this(n), n.d ? n.d[0] ? n.s : 0 * n.s : n.s || NaN;
+}
+function dr(n) {
+  return new this(n).sin();
+}
+function gr(n) {
+  return new this(n).sinh();
+}
+function pr(n) {
+  return new this(n).sqrt();
+}
+function wr(n, r) {
+  return new this(n).sub(r);
+}
+function mr() {
+  var n = 0, r = arguments, t = new this(r[n]);
+  for (m = !1; t.s && ++n < r.length; ) t = t.plus(r[n]);
+  return m = !0, g(t, this.precision, this.rounding);
+}
+function vr(n) {
+  return new this(n).tan();
+}
+function Nr(n) {
+  return new this(n).tanh();
+}
+function br(n) {
+  return g(n = new this(n), n.e + 1, 1);
+}
+_ = Fn(an);
+_.prototype.constructor = _;
+_.default = _.Decimal = _;
+X = new _(X);
+Y = new _(Y);
+export {
+  _
+};