@unicom-cloud/utils 0.1.37 → 0.1.39

package/decimal/decimal.js

@@ -1,1064 +1,802 @@
-/* 2026-01-27 10:43:49 */
-var G = 9e15, V = 1e9, fe = "0123456789abcdef", y = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", ee = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", ce = {
-  // 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: -G,
-  // -1 to -EXP_LIMIT
-  // The maximum exponent value, above which overflow to Infinity occurs.
-  // JavaScript numbers: 308  (1.7976931348623157e+308)
-  maxE: G,
-  // 1 to EXP_LIMIT
-  // Whether to use cryptographically-secure random number generation, if available.
-  crypto: !1
-  // true/false
-}, _, we, b, m = !0, ne = "[DecimalError] ", $ = `${ne}Invalid argument: `, me = `${ne}Precision limit exceeded`, Ne = `${ne}crypto unavailable`, ve = "[object Decimal]", L = Math.floor, C = Math.pow, Ae = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, Le = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, Fe = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, Ee = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, R = 1e7, w = 7, Oe = 9007199254740991, De = y.length - 1, le = ee.length - 1, d = { toStringTag: ve };
-d.absoluteValue = d.abs = function() {
-  var e = new this.constructor(this);
-  return e.s < 0 && (e.s = 1), p(e);
-};
-d.ceil = function() {
-  return p(new this.constructor(this), this.e + 1, 2);
-};
-d.clampedTo = d.clamp = function(e, i) {
-  var n, r = this, s = r.constructor;
-  if (e = new s(e), i = new s(i), !e.s || !i.s) return new s(NaN);
-  if (e.gt(i)) throw Error($ + i);
-  return n = r.cmp(e), n < 0 ? e : r.cmp(i) > 0 ? i : new s(r);
-};
-d.comparedTo = d.cmp = function(e) {
-  var i, n, r, s, t = this, o = t.d, u = (e = new t.constructor(e)).d, c = t.s, f = e.s;
-  if (!o || !u)
-    return !c || !f ? NaN : c !== f ? c : o === u ? 0 : !o ^ c < 0 ? 1 : -1;
-  if (!o[0] || !u[0]) return o[0] ? c : u[0] ? -f : 0;
-  if (c !== f) return c;
-  if (t.e !== e.e) return t.e > e.e ^ c < 0 ? 1 : -1;
-  for (r = o.length, s = u.length, i = 0, n = r < s ? r : s; i < n; ++i)
-    if (o[i] !== u[i]) return o[i] > u[i] ^ c < 0 ? 1 : -1;
-  return r === s ? 0 : r > s ^ c < 0 ? 1 : -1;
-};
-d.cosine = d.cos = function() {
-  var e, i, n = this, r = n.constructor;
-  return n.d ? n.d[0] ? (e = r.precision, i = r.rounding, r.precision = e + Math.max(n.e, n.sd()) + w, r.rounding = 1, n = Ie(r, Pe(r, n)), r.precision = e, r.rounding = i, p(b == 2 || b == 3 ? n.neg() : n, e, i, !0)) : new r(1) : new r(NaN);
-};
-d.cubeRoot = d.cbrt = function() {
-  var e, i, n, r, s, t, o, u, c, f, l = this, a = l.constructor;
-  if (!l.isFinite() || l.isZero()) return new a(l);
-  for (m = !1, t = l.s * C(l.s * l, 1 / 3), !t || Math.abs(t) == 1 / 0 ? (n = P(l.d), e = l.e, (t = (e - n.length + 1) % 3) && (n += t == 1 || t == -2 ? "0" : "00"), t = C(n, 1 / 3), e = L((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2)), t == 1 / 0 ? n = "5e" + e : (n = t.toExponential(), n = n.slice(0, n.indexOf("e") + 1) + e), r = new a(n), r.s = l.s) : r = new a(t.toString()), o = (e = a.precision) + 3; ; )
-    if (u = r, c = u.times(u).times(u), f = c.plus(l), r = k(f.plus(l).times(u), f.plus(c), o + 2, 1), P(u.d).slice(0, o) === (n = P(r.d)).slice(0, o))
-      if (n = n.slice(o - 3, o + 1), n == "9999" || !s && n == "4999") {
-        if (!s && (p(u, e + 1, 0), u.times(u).times(u).eq(l))) {
-          r = u;
-          break;
-        }
-        o += 4, s = 1;
-      } else {
-        (!+n || !+n.slice(1) && n.charAt(0) == "5") && (p(r, e + 1, 1), i = !r.times(r).times(r).eq(l));
-        break;
-      }
-  return m = !0, p(r, e, a.rounding, i);
-};
-d.decimalPlaces = d.dp = function() {
-  var e, i = this.d, n = NaN;
-  if (i) {
-    if (e = i.length - 1, n = (e - L(this.e / w)) * w, e = i[e], e) for (; e % 10 == 0; e /= 10) n--;
-    n < 0 && (n = 0);
-  }
-  return n;
-};
-d.dividedBy = d.div = function(e) {
-  return k(this, new this.constructor(e));
-};
-d.dividedToIntegerBy = d.divToInt = function(e) {
-  var i = this, n = i.constructor;
-  return p(
-    k(i, new n(e), 0, 1, 1),
-    n.precision,
-    n.rounding
-  );
-};
-d.equals = d.eq = function(e) {
-  return this.cmp(e) === 0;
-};
-d.floor = function() {
-  return p(new this.constructor(this), this.e + 1, 3);
-};
-d.greaterThan = d.gt = function(e) {
-  return this.cmp(e) > 0;
-};
-d.greaterThanOrEqualTo = d.gte = function(e) {
-  var i = this.cmp(e);
-  return i == 1 || i === 0;
-};
-d.hyperbolicCosine = d.cosh = function() {
-  var e, i, n, r, s, t = this, o = t.constructor, u = new o(1);
-  if (!t.isFinite()) return new o(t.s ? 1 / 0 : NaN);
-  if (t.isZero()) return u;
-  n = o.precision, r = o.rounding, o.precision = n + Math.max(t.e, t.sd()) + 4, o.rounding = 1, s = t.d.length, s < 32 ? (e = Math.ceil(s / 3), i = (1 / te(4, e)).toString()) : (e = 16, i = "2.3283064365386962890625e-10"), t = W(o, 1, t.times(i), new o(1), !0);
-  for (var c, f = e, l = new o(8); f--; )
-    c = t.times(t), t = u.minus(c.times(l.minus(c.times(l))));
-  return p(t, o.precision = n, o.rounding = r, !0);
-};
-d.hyperbolicSine = d.sinh = function() {
-  var e, i, n, r, s = this, t = s.constructor;
-  if (!s.isFinite() || s.isZero()) return new t(s);
-  if (i = t.precision, n = t.rounding, t.precision = i + Math.max(s.e, s.sd()) + 4, t.rounding = 1, r = s.d.length, r < 3)
-    s = W(t, 2, s, s, !0);
-  else {
-    e = 1.4 * Math.sqrt(r), e = e > 16 ? 16 : e | 0, s = s.times(1 / te(5, e)), s = W(t, 2, s, s, !0);
-    for (var o, u = new t(5), c = new t(16), f = new t(20); e--; )
-      o = s.times(s), s = s.times(u.plus(o.times(c.times(o).plus(f))));
-  }
-  return t.precision = i, t.rounding = n, p(s, i, n, !0);
-};
-d.hyperbolicTangent = d.tanh = function() {
-  var e, i, n = this, r = n.constructor;
-  return n.isFinite() ? n.isZero() ? new r(n) : (e = r.precision, i = r.rounding, r.precision = e + 7, r.rounding = 1, k(
-    n.sinh(),
-    n.cosh(),
-    r.precision = e,
-    r.rounding = i
-  )) : new r(n.s);
-};
-d.inverseCosine = d.acos = function() {
-  var e = this, i = e.constructor, n = e.abs().cmp(1), r = i.precision, s = i.rounding;
-  return n !== -1 ? n === 0 ? (
-    // |x| is 1
-    e.isNeg() ? T(i, r, s) : new i(0)
-  ) : (
-    // |x| > 1 or x is NaN
-    new i(NaN)
-  ) : e.isZero() ? T(i, r + 4, s).times(0.5) : (i.precision = r + 6, i.rounding = 1, e = new i(1).minus(e).div(e.plus(1)).sqrt().atan(), i.precision = r, i.rounding = s, e.times(2));
-};
-d.inverseHyperbolicCosine = d.acosh = function() {
-  var e, i, n = this, r = n.constructor;
-  return n.lte(1) ? new r(n.eq(1) ? 0 : NaN) : n.isFinite() ? (e = r.precision, i = r.rounding, r.precision = e + Math.max(Math.abs(n.e), n.sd()) + 4, r.rounding = 1, m = !1, n = n.times(n).minus(1).sqrt().plus(n), m = !0, r.precision = e, r.rounding = i, n.ln()) : new r(n);
-};
-d.inverseHyperbolicSine = d.asinh = function() {
-  var e, i, n = this, r = n.constructor;
-  return !n.isFinite() || n.isZero() ? new r(n) : (e = r.precision, i = r.rounding, r.precision = e + 2 * Math.max(Math.abs(n.e), n.sd()) + 6, r.rounding = 1, m = !1, n = n.times(n).plus(1).sqrt().plus(n), m = !0, r.precision = e, r.rounding = i, n.ln());
-};
-d.inverseHyperbolicTangent = d.atanh = function() {
-  var e, i, n, r, s = this, t = s.constructor;
-  return s.isFinite() ? s.e >= 0 ? new t(s.abs().eq(1) ? s.s / 0 : s.isZero() ? s : NaN) : (e = t.precision, i = t.rounding, r = s.sd(), Math.max(r, e) < 2 * -s.e - 1 ? p(new t(s), e, i, !0) : (t.precision = n = r - s.e, s = k(s.plus(1), new t(1).minus(s), n + e, 1), t.precision = e + 4, t.rounding = 1, s = s.ln(), t.precision = e, t.rounding = i, s.times(0.5))) : new t(NaN);
-};
-d.inverseSine = d.asin = function() {
-  var e, i, n, r, s = this, t = s.constructor;
-  return s.isZero() ? new t(s) : (i = s.abs().cmp(1), n = t.precision, r = t.rounding, i !== -1 ? i === 0 ? (e = T(t, n + 4, r).times(0.5), e.s = s.s, e) : new t(NaN) : (t.precision = n + 6, t.rounding = 1, s = s.div(new t(1).minus(s.times(s)).sqrt().plus(1)).atan(), t.precision = n, t.rounding = r, s.times(2)));
-};
-d.inverseTangent = d.atan = function() {
-  var e, i, n, r, s, t, o, u, c, f = this, l = f.constructor, a = l.precision, h = l.rounding;
-  if (f.isFinite()) {
-    if (f.isZero())
-      return new l(f);
-    if (f.abs().eq(1) && a + 4 <= le)
-      return o = T(l, a + 4, h).times(0.25), o.s = f.s, o;
-  } else {
-    if (!f.s) return new l(NaN);
-    if (a + 4 <= le)
-      return o = T(l, a + 4, h).times(0.5), o.s = f.s, o;
-  }
-  for (l.precision = u = a + 10, l.rounding = 1, n = Math.min(28, u / w + 2 | 0), e = n; e; --e) f = f.div(f.times(f).plus(1).sqrt().plus(1));
-  for (m = !1, i = Math.ceil(u / w), r = 1, c = f.times(f), o = new l(f), s = f; e !== -1; )
-    if (s = s.times(c), t = o.minus(s.div(r += 2)), s = s.times(c), o = t.plus(s.div(r += 2)), o.d[i] !== void 0) for (e = i; o.d[e] === t.d[e] && e--; ) ;
-  return n && (o = o.times(2 << n - 1)), m = !0, p(o, l.precision = a, l.rounding = h, !0);
-};
-d.isFinite = function() {
-  return !!this.d;
-};
-d.isInteger = d.isInt = function() {
-  return !!this.d && L(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(e) {
-  return this.cmp(e) < 0;
-};
-d.lessThanOrEqualTo = d.lte = function(e) {
-  return this.cmp(e) < 1;
-};
-d.logarithm = d.log = function(e) {
-  var i, n, r, s, t, o, u, c, f = this, l = f.constructor, a = l.precision, h = l.rounding, g = 5;
-  if (e == null)
-    e = new l(10), i = !0;
-  else {
-    if (e = new l(e), n = e.d, e.s < 0 || !n || !n[0] || e.eq(1)) return new l(NaN);
-    i = e.eq(10);
-  }
-  if (n = f.d, f.s < 0 || !n || !n[0] || f.eq(1))
-    return new l(n && !n[0] ? -1 / 0 : f.s != 1 ? NaN : n ? 0 : 1 / 0);
-  if (i)
-    if (n.length > 1)
-      t = !0;
-    else {
-      for (s = n[0]; s % 10 === 0; ) s /= 10;
-      t = s !== 1;
-    }
-  if (m = !1, u = a + g, o = H(f, u), r = i ? ie(l, u + 10) : H(e, u), c = k(o, r, u, 1), J(c.d, s = a, h))
-    do
-      if (u += 10, o = H(f, u), r = i ? ie(l, u + 10) : H(e, u), c = k(o, r, u, 1), !t) {
-        +P(c.d).slice(s + 1, s + 15) + 1 == 1e14 && (c = p(c, a + 1, 0));
-        break;
-      }
-    while (J(c.d, s += 10, h));
-  return m = !0, p(c, a, h);
-};
-d.minus = d.sub = function(e) {
-  var i, n, r, s, t, o, u, c, f, l, a, h, g = this, v = g.constructor;
-  if (e = new v(e), !g.d || !e.d)
-    return !g.s || !e.s ? e = new v(NaN) : g.d ? e.s = -e.s : e = new v(e.d || g.s !== e.s ? g : NaN), e;
-  if (g.s != e.s)
-    return e.s = -e.s, g.plus(e);
-  if (f = g.d, h = e.d, u = v.precision, c = v.rounding, !f[0] || !h[0]) {
-    if (h[0]) e.s = -e.s;
-    else if (f[0]) e = new v(g);
-    else return new v(c === 3 ? -0 : 0);
-    return m ? p(e, u, c) : e;
-  }
-  if (n = L(e.e / w), l = L(g.e / w), f = f.slice(), t = l - n, t) {
-    for (a = t < 0, a ? (i = f, t = -t, o = h.length) : (i = h, n = l, o = f.length), r = Math.max(Math.ceil(u / w), o) + 2, t > r && (t = r, i.length = 1), i.reverse(), r = t; r--; ) i.push(0);
-    i.reverse();
-  } else {
-    for (r = f.length, o = h.length, a = r < o, a && (o = r), r = 0; r < o; r++)
-      if (f[r] != h[r]) {
-        a = f[r] < h[r];
-        break;
-      }
-    t = 0;
-  }
-  for (a && (i = f, f = h, h = i, e.s = -e.s), o = f.length, r = h.length - o; r > 0; --r) f[o++] = 0;
-  for (r = h.length; r > t; ) {
-    if (f[--r] < h[r]) {
-      for (s = r; s && f[--s] === 0; ) f[s] = R - 1;
-      --f[s], f[r] += R;
-    }
-    f[r] -= h[r];
-  }
-  for (; f[--o] === 0; ) f.pop();
-  for (; f[0] === 0; f.shift()) --n;
-  return f[0] ? (e.d = f, e.e = re(f, n), m ? p(e, u, c) : e) : new v(c === 3 ? -0 : 0);
-};
-d.modulo = d.mod = function(e) {
-  var i, n = this, r = n.constructor;
-  return e = new r(e), !n.d || !e.s || e.d && !e.d[0] ? new r(NaN) : !e.d || n.d && !n.d[0] ? p(new r(n), r.precision, r.rounding) : (m = !1, r.modulo == 9 ? (i = k(n, e.abs(), 0, 3, 1), i.s *= e.s) : i = k(n, e, 0, r.modulo, 1), i = i.times(e), m = !0, n.minus(i));
-};
-d.naturalExponential = d.exp = function() {
-  return ae(this);
-};
-d.naturalLogarithm = d.ln = function() {
-  return H(this);
-};
-d.negated = d.neg = function() {
-  var e = new this.constructor(this);
-  return e.s = -e.s, p(e);
-};
-d.plus = d.add = function(e) {
-  var i, n, r, s, t, o, u, c, f, l, a = this, h = a.constructor;
-  if (e = new h(e), !a.d || !e.d)
-    return !a.s || !e.s ? e = new h(NaN) : a.d || (e = new h(e.d || a.s === e.s ? a : NaN)), e;
-  if (a.s != e.s)
-    return e.s = -e.s, a.minus(e);
-  if (f = a.d, l = e.d, u = h.precision, c = h.rounding, !f[0] || !l[0])
-    return l[0] || (e = new h(a)), m ? p(e, u, c) : e;
-  if (t = L(a.e / w), r = L(e.e / w), f = f.slice(), s = t - r, s) {
-    for (s < 0 ? (n = f, s = -s, o = l.length) : (n = l, r = t, o = f.length), t = Math.ceil(u / w), o = t > o ? t + 1 : o + 1, s > o && (s = o, n.length = 1), n.reverse(); s--; ) n.push(0);
-    n.reverse();
-  }
-  for (o = f.length, s = l.length, o - s < 0 && (s = o, n = l, l = f, f = n), i = 0; s; )
-    i = (f[--s] = f[s] + l[s] + i) / R | 0, f[s] %= R;
-  for (i && (f.unshift(i), ++r), o = f.length; f[--o] == 0; ) f.pop();
-  return e.d = f, e.e = re(f, r), m ? p(e, u, c) : e;
-};
-d.precision = d.sd = function(e) {
-  var i, n = this;
-  if (e !== void 0 && e !== !!e && e !== 1 && e !== 0)
-    throw Error($ + e);
-  return n.d ? (i = ke(n.d), e && n.e + 1 > i && (i = n.e + 1)) : i = NaN, i;
-};
-d.round = function() {
-  var e = this, i = e.constructor;
-  return p(new i(e), e.e + 1, i.rounding);
-};
-d.sine = d.sin = function() {
-  var e, i, n = this, r = n.constructor;
-  return n.isFinite() ? n.isZero() ? new r(n) : (e = r.precision, i = r.rounding, r.precision = e + Math.max(n.e, n.sd()) + w, r.rounding = 1, n = Re(r, Pe(r, n)), r.precision = e, r.rounding = i, p(b > 2 ? n.neg() : n, e, i, !0)) : new r(NaN);
-};
-d.squareRoot = d.sqrt = function() {
-  var e, i, n, r, s, t, o = this, u = o.d, c = o.e, f = o.s, l = o.constructor;
-  if (f !== 1 || !u || !u[0])
-    return new l(!f || f < 0 && (!u || u[0]) ? NaN : u ? o : 1 / 0);
-  for (m = !1, f = Math.sqrt(+o), f == 0 || f == 1 / 0 ? (i = P(u), (i.length + c) % 2 == 0 && (i += "0"), f = Math.sqrt(i), c = L((c + 1) / 2) - (c < 0 || c % 2), f == 1 / 0 ? i = "5e" + c : (i = f.toExponential(), i = i.slice(0, i.indexOf("e") + 1) + c), r = new l(i)) : r = new l(f.toString()), n = (c = l.precision) + 3; ; )
-    if (t = r, r = t.plus(k(o, t, n + 2, 1)).times(0.5), P(t.d).slice(0, n) === (i = P(r.d)).slice(0, n))
-      if (i = i.slice(n - 3, n + 1), i == "9999" || !s && i == "4999") {
-        if (!s && (p(t, c + 1, 0), t.times(t).eq(o))) {
-          r = t;
-          break;
-        }
-        n += 4, s = 1;
-      } else {
-        (!+i || !+i.slice(1) && i.charAt(0) == "5") && (p(r, c + 1, 1), e = !r.times(r).eq(o));
-        break;
-      }
-  return m = !0, p(r, c, l.rounding, e);
-};
-d.tangent = d.tan = function() {
-  var e, i, n = this, r = n.constructor;
-  return n.isFinite() ? n.isZero() ? new r(n) : (e = r.precision, i = r.rounding, r.precision = e + 10, r.rounding = 1, n = n.sin(), n.s = 1, n = k(n, new r(1).minus(n.times(n)).sqrt(), e + 10, 0), r.precision = e, r.rounding = i, p(b == 2 || b == 4 ? n.neg() : n, e, i, !0)) : new r(NaN);
-};
-d.times = d.mul = function(e) {
-  var i, n, r, s, t, o, u, c, f, l = this, a = l.constructor, h = l.d, g = (e = new a(e)).d;
-  if (e.s *= l.s, !h || !h[0] || !g || !g[0])
-    return new a(
-      !e.s || h && !h[0] && !g || g && !g[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 || !g ? e.s / 0 : e.s * 0
-      )
-    );
-  for (n = L(l.e / w) + L(e.e / w), c = h.length, f = g.length, c < f && (t = h, h = g, g = t, o = c, c = f, f = o), t = [], o = c + f, r = o; r--; ) t.push(0);
-  for (r = f; --r >= 0; ) {
-    for (i = 0, s = c + r; s > r; )
-      u = t[s] + g[r] * h[s - r - 1] + i, t[s--] = u % R | 0, i = u / R | 0;
-    t[s] = (t[s] + i) % R | 0;
-  }
-  for (; !t[--o]; ) t.pop();
-  return i ? ++n : t.shift(), e.d = t, e.e = re(t, n), m ? p(e, a.precision, a.rounding) : e;
-};
-d.toBinary = function(e, i) {
-  return he(this, 2, e, i);
-};
-d.toDecimalPlaces = d.toDP = function(e, i) {
-  var n = this, r = n.constructor;
-  return n = new r(n), e === void 0 ? n : (O(e, 0, V), i === void 0 ? i = r.rounding : O(i, 0, 8), p(n, e + n.e + 1, i));
-};
-d.toExponential = function(e, i) {
-  var n, r = this, s = r.constructor;
-  return e === void 0 ? n = Z(r, !0) : (O(e, 0, V), i === void 0 ? i = s.rounding : O(i, 0, 8), r = p(new s(r), e + 1, i), n = Z(r, !0, e + 1)), r.isNeg() && !r.isZero() ? "-" + n : n;
-};
-d.toFixed = function(e, i) {
-  var n, r, s = this, t = s.constructor;
-  return e === void 0 ? n = Z(s) : (O(e, 0, V), i === void 0 ? i = t.rounding : O(i, 0, 8), r = p(new t(s), e + s.e + 1, i), n = Z(r, !1, e + r.e + 1)), s.isNeg() && !s.isZero() ? "-" + n : n;
-};
-d.toFraction = function(e) {
-  var i, n, r, s, t, o, u, c, f, l, a, h, g = this, v = g.d, N = g.constructor;
-  if (!v) return new N(g);
-  if (f = n = new N(1), r = c = new N(0), i = new N(r), t = i.e = ke(v) - g.e - 1, o = t % w, i.d[0] = C(10, o < 0 ? w + o : o), e == null)
-    e = t > 0 ? i : f;
-  else {
-    if (u = new N(e), !u.isInt() || u.lt(f)) throw Error($ + u);
-    e = u.gt(i) ? t > 0 ? i : f : u;
-  }
-  for (m = !1, u = new N(P(v)), l = N.precision, N.precision = t = v.length * w * 2; a = k(u, i, 0, 1, 1), s = n.plus(a.times(r)), s.cmp(e) != 1; )
-    n = r, r = s, s = f, f = c.plus(a.times(s)), c = s, s = i, i = u.minus(a.times(s)), u = s;
-  return s = k(e.minus(n), r, 0, 1, 1), c = c.plus(s.times(f)), n = n.plus(s.times(r)), c.s = f.s = g.s, h = k(f, r, t, 1).minus(g).abs().cmp(k(c, n, t, 1).minus(g).abs()) < 1 ? [f, r] : [c, n], N.precision = l, m = !0, h;
-};
-d.toHexadecimal = d.toHex = function(e, i) {
-  return he(this, 16, e, i);
-};
-d.toNearest = function(e, i) {
-  var n = this, r = n.constructor;
-  if (n = new r(n), e == null) {
-    if (!n.d) return n;
-    e = new r(1), i = r.rounding;
-  } else {
-    if (e = new r(e), i === void 0 ? i = r.rounding : O(i, 0, 8), !n.d) return e.s ? n : e;
-    if (!e.d)
-      return e.s && (e.s = n.s), e;
-  }
-  return e.d[0] ? (m = !1, n = k(n, e, 0, i, 1).times(e), m = !0, p(n)) : (e.s = n.s, n = e), n;
-};
-d.toNumber = function() {
-  return +this;
-};
-d.toOctal = function(e, i) {
-  return he(this, 8, e, i);
-};
-d.toPower = d.pow = function(e) {
-  var i, n, r, s, t, o, u = this, c = u.constructor, f = +(e = new c(e));
-  if (!u.d || !e.d || !u.d[0] || !e.d[0]) return new c(C(+u, f));
-  if (u = new c(u), u.eq(1)) return u;
-  if (r = c.precision, t = c.rounding, e.eq(1)) return p(u, r, t);
-  if (i = L(e.e / w), i >= e.d.length - 1 && (n = f < 0 ? -f : f) <= Oe)
-    return s = Me(c, u, n, r), e.s < 0 ? new c(1).div(s) : p(s, r, t);
-  if (o = u.s, o < 0) {
-    if (i < e.d.length - 1) return new c(NaN);
-    if ((e.d[i] & 1) == 0 && (o = 1), u.e == 0 && u.d[0] == 1 && u.d.length == 1)
-      return u.s = o, u;
-  }
-  return n = C(+u, f), i = n == 0 || !isFinite(n) ? L(
-    f * (Math.log("0." + P(u.d)) / Math.LN10 + u.e + 1)
-  ) : new c(n + "").e, i > c.maxE + 1 || i < c.minE - 1 ? new c(i > 0 ? o / 0 : 0) : (m = !1, c.rounding = u.s = 1, n = Math.min(12, (i + "").length), s = ae(e.times(H(u, r + n)), r), s.d && (s = p(s, r + 5, 1), J(s.d, r, t) && (i = r + 10, s = p(
-    ae(e.times(H(u, i + n)), i),
-    i + 5,
-    1
-  ), +P(s.d).slice(r + 1, r + 15) + 1 == 1e14 && (s = p(s, r + 1, 0)))), s.s = o, m = !0, c.rounding = t, p(s, r, t));
-};
-d.toPrecision = function(e, i) {
-  var n, r = this, s = r.constructor;
-  return e === void 0 ? n = Z(r, r.e <= s.toExpNeg || r.e >= s.toExpPos) : (O(e, 1, V), i === void 0 ? i = s.rounding : O(i, 0, 8), r = p(new s(r), e, i), n = Z(r, e <= r.e || r.e <= s.toExpNeg, e)), r.isNeg() && !r.isZero() ? "-" + n : n;
-};
-d.toSignificantDigits = d.toSD = function(e, i) {
-  var n = this, r = n.constructor;
-  return e === void 0 ? (e = r.precision, i = r.rounding) : (O(e, 1, V), i === void 0 ? i = r.rounding : O(i, 0, 8)), p(new r(n), e, i);
-};
-d.toString = function() {
-  var e = this, i = e.constructor, n = Z(e, e.e <= i.toExpNeg || e.e >= i.toExpPos);
-  return e.isNeg() && !e.isZero() ? "-" + n : n;
-};
-d.truncated = d.trunc = function() {
-  return p(new this.constructor(this), this.e + 1, 1);
-};
-d.valueOf = d.toJSON = function() {
-  var e = this, i = e.constructor, n = Z(e, e.e <= i.toExpNeg || e.e >= i.toExpPos);
-  return e.isNeg() ? "-" + n : n;
-};
-function P(e) {
-  var i, n, r, s = e.length - 1, t = "", o = e[0];
-  if (s > 0) {
-    for (t += o, i = 1; i < s; i++)
-      r = e[i] + "", n = w - r.length, n && (t += B(n)), t += r;
-    o = e[i], r = o + "", n = w - r.length, n && (t += B(n));
-  } else if (o === 0)
-    return "0";
-  for (; o % 10 === 0; ) o /= 10;
-  return t + o;
-}
-function O(e, i, n) {
-  if (e !== ~~e || e < i || e > n)
-    throw Error($ + e);
-}
-function J(e, i, n, r) {
-  var s, t, o, u;
-  for (t = e[0]; t >= 10; t /= 10) --i;
-  return --i < 0 ? (i += w, s = 0) : (s = Math.ceil((i + 1) / w), i %= w), t = C(10, w - i), u = e[s] % t | 0, r == null ? i < 3 ? (i == 0 ? u = u / 100 | 0 : i == 1 && (u = u / 10 | 0), o = n < 4 && u == 99999 || n > 3 && u == 49999 || u == 5e4 || u == 0) : o = (n < 4 && u + 1 == t || n > 3 && u + 1 == t / 2) && (e[s + 1] / t / 100 | 0) == C(10, i - 2) - 1 || (u == t / 2 || u == 0) && (e[s + 1] / t / 100 | 0) == 0 : i < 4 ? (i == 0 ? u = u / 1e3 | 0 : i == 1 ? u = u / 100 | 0 : i == 2 && (u = u / 10 | 0), o = (r || n < 4) && u == 9999 || !r && n > 3 && u == 4999) : o = ((r || n < 4) && u + 1 == t || !r && n > 3 && u + 1 == t / 2) && (e[s + 1] / t / 1e3 | 0) == C(10, i - 3) - 1, o;
-}
-function z(e, i, n) {
-  for (var r, s = [0], t, o = 0, u = e.length; o < u; ) {
-    for (t = s.length; t--; ) s[t] *= i;
-    for (s[0] += fe.indexOf(e.charAt(o++)), r = 0; r < s.length; r++)
-      s[r] > n - 1 && (s[r + 1] === void 0 && (s[r + 1] = 0), s[r + 1] += s[r] / n | 0, s[r] %= n);
-  }
-  return s.reverse();
-}
-function Ie(e, i) {
-  var n, r, s;
-  if (i.isZero()) return i;
-  r = i.d.length, r < 32 ? (n = Math.ceil(r / 3), s = (1 / te(4, n)).toString()) : (n = 16, s = "2.3283064365386962890625e-10"), e.precision += n, i = W(e, 1, i.times(s), new e(1));
-  for (var t = n; t--; ) {
-    var o = i.times(i);
-    i = o.times(o).minus(o).times(8).plus(1);
-  }
-  return e.precision -= n, i;
-}
-var k = /* @__PURE__ */ (function() {
-  function e(r, s, t) {
-    var o, u = 0, c = r.length;
-    for (r = r.slice(); c--; )
-      o = r[c] * s + u, r[c] = o % t | 0, u = o / t | 0;
-    return u && r.unshift(u), r;
-  }
-  function i(r, s, t, o) {
-    var u, c;
-    if (t != o)
-      c = t > o ? 1 : -1;
-    else
-      for (u = c = 0; u < t; u++)
-        if (r[u] != s[u]) {
-          c = r[u] > s[u] ? 1 : -1;
-          break;
-        }
-    return c;
-  }
-  function n(r, s, t, o) {
-    for (var u = 0; t--; )
-      r[t] -= u, u = r[t] < s[t] ? 1 : 0, r[t] = u * o + r[t] - s[t];
-    for (; !r[0] && r.length > 1; ) r.shift();
-  }
-  return function(r, s, t, o, u, c) {
-    var f, l, a, h, g, v, N, F, q, D, E, S, K, U, se, Q, X, oe, I, Y, j = r.constructor, ue = r.s == s.s ? 1 : -1, A = r.d, M = s.d;
-    if (!A || !A[0] || !M || !M[0])
-      return new j(
-        // Return NaN if either NaN, or both Infinity or 0.
-        !r.s || !s.s || (A ? M && A[0] == M[0] : !M) ? NaN : (
-          // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.
-          A && A[0] == 0 || !M ? ue * 0 : ue / 0
-        )
-      );
-    for (c ? (g = 1, l = r.e - s.e) : (c = R, g = w, l = L(r.e / g) - L(s.e / g)), I = M.length, X = A.length, q = new j(ue), D = q.d = [], a = 0; M[a] == (A[a] || 0); a++) ;
-    if (M[a] > (A[a] || 0) && l--, t == null ? (U = t = j.precision, o = j.rounding) : u ? U = t + (r.e - s.e) + 1 : U = t, U < 0)
-      D.push(1), v = !0;
-    else {
-      if (U = U / g + 2 | 0, a = 0, I == 1) {
-        for (h = 0, M = M[0], U++; (a < X || h) && U--; a++)
-          se = h * c + (A[a] || 0), D[a] = se / M | 0, h = se % M | 0;
-        v = h || a < X;
-      } else {
-        for (h = c / (M[0] + 1) | 0, h > 1 && (M = e(M, h, c), A = e(A, h, c), I = M.length, X = A.length), Q = I, E = A.slice(0, I), S = E.length; S < I; ) E[S++] = 0;
-        Y = M.slice(), Y.unshift(0), oe = M[0], M[1] >= c / 2 && ++oe;
-        do
-          h = 0, f = i(M, E, I, S), f < 0 ? (K = E[0], I != S && (K = K * c + (E[1] || 0)), h = K / oe | 0, h > 1 ? (h >= c && (h = c - 1), N = e(M, h, c), F = N.length, S = E.length, f = i(N, E, F, S), f == 1 && (h--, n(N, I < F ? Y : M, F, c))) : (h == 0 && (f = h = 1), N = M.slice()), F = N.length, F < S && N.unshift(0), n(E, N, S, c), f == -1 && (S = E.length, f = i(M, E, I, S), f < 1 && (h++, n(E, I < S ? Y : M, S, c))), S = E.length) : f === 0 && (h++, E = [0]), D[a++] = h, f && E[0] ? E[S++] = A[Q] || 0 : (E = [A[Q]], S = 1);
-        while ((Q++ < X || E[0] !== void 0) && U--);
-        v = E[0] !== void 0;
-      }
-      D[0] || D.shift();
-    }
-    if (g == 1)
-      q.e = l, we = v;
-    else {
-      for (a = 1, h = D[0]; h >= 10; h /= 10) a++;
-      q.e = a + l * g - 1, p(q, u ? t + q.e + 1 : t, o, v);
-    }
-    return q;
-  };
+/* 潘启宝 2026-03-24 15:26:16 星期二 */
+//#region utils/decimal/decimal.js
+var e = 9e15, t = 1e9, n = "0123456789abcdef", r = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", i = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", a = {
+	precision: 20,
+	rounding: 4,
+	modulo: 1,
+	toExpNeg: -7,
+	toExpPos: 21,
+	minE: -e,
+	maxE: e,
+	crypto: !1
+}, o, s, c, l = !0, u = "[DecimalError] ", d = `${u}Invalid argument: `, f = `${u}Precision limit exceeded`, p = `${u}crypto unavailable`, m = "[object Decimal]", h = Math.floor, g = Math.pow, _ = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, v = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, y = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, b = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, x = 1e7, S = 7, C = 9007199254740991, w = r.length - 1, T = i.length - 1, E = { toStringTag: m };
+E.absoluteValue = E.abs = function() {
+	var e = new this.constructor(this);
+	return e.s < 0 && (e.s = 1), N(e);
+}, E.ceil = function() {
+	return N(new this.constructor(this), this.e + 1, 2);
+}, E.clampedTo = E.clamp = function(e, t) {
+	var n, r = this, i = r.constructor;
+	if (e = new i(e), t = new i(t), !e.s || !t.s) return new i(NaN);
+	if (e.gt(t)) throw Error(d + t);
+	return n = r.cmp(e), n < 0 ? e : r.cmp(t) > 0 ? t : new i(r);
+}, E.comparedTo = E.cmp = function(e) {
+	var t, n, r, i, a = this, o = a.d, s = (e = new a.constructor(e)).d, c = a.s, l = e.s;
+	if (!o || !s) return !c || !l ? NaN : c === l ? o === s ? 0 : !o ^ c < 0 ? 1 : -1 : c;
+	if (!o[0] || !s[0]) return o[0] ? c : s[0] ? -l : 0;
+	if (c !== l) return c;
+	if (a.e !== e.e) return a.e > e.e ^ c < 0 ? 1 : -1;
+	for (r = o.length, i = s.length, t = 0, n = r < i ? r : i; t < n; ++t) if (o[t] !== s[t]) return o[t] > s[t] ^ c < 0 ? 1 : -1;
+	return r === i ? 0 : r > i ^ c < 0 ? 1 : -1;
+}, E.cosine = E.cos = function() {
+	var e, t, n = this, r = n.constructor;
+	return n.d ? n.d[0] ? (e = r.precision, t = r.rounding, r.precision = e + Math.max(n.e, n.sd()) + S, r.rounding = 1, n = j(r, Y(r, n)), r.precision = e, r.rounding = t, N(c == 2 || c == 3 ? n.neg() : n, e, t, !0)) : new r(1) : new r(NaN);
+}, E.cubeRoot = E.cbrt = function() {
+	var e, t, n, r, i, a, o, s, c, u, d = this, f = d.constructor;
+	if (!d.isFinite() || d.isZero()) return new f(d);
+	for (l = !1, a = d.s * g(d.s * d, 1 / 3), !a || Math.abs(a) == Infinity ? (n = D(d.d), e = d.e, (a = (e - n.length + 1) % 3) && (n += a == 1 || a == -2 ? "0" : "00"), a = g(n, 1 / 3), e = h((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2)), a == Infinity ? n = "5e" + e : (n = a.toExponential(), n = n.slice(0, n.indexOf("e") + 1) + e), r = new f(n), r.s = d.s) : r = new f(a.toString()), o = (e = f.precision) + 3;;) if (s = r, c = s.times(s).times(s), u = c.plus(d), r = M(u.plus(d).times(s), u.plus(c), o + 2, 1), D(s.d).slice(0, o) === (n = D(r.d)).slice(0, o)) if (n = n.slice(o - 3, o + 1), n == "9999" || !i && n == "4999") {
+		if (!i && (N(s, e + 1, 0), s.times(s).times(s).eq(d))) {
+			r = s;
+			break;
+		}
+		o += 4, i = 1;
+	} else {
+		(!+n || !+n.slice(1) && n.charAt(0) == "5") && (N(r, e + 1, 1), t = !r.times(r).times(r).eq(d));
+		break;
+	}
+	return l = !0, N(r, e, f.rounding, t);
+}, E.decimalPlaces = E.dp = function() {
+	var e, t = this.d, n = NaN;
+	if (t) {
+		if (e = t.length - 1, n = (e - h(this.e / S)) * S, e = t[e], e) for (; e % 10 == 0; e /= 10) n--;
+		n < 0 && (n = 0);
+	}
+	return n;
+}, E.dividedBy = E.div = function(e) {
+	return M(this, new this.constructor(e));
+}, E.dividedToIntegerBy = E.divToInt = function(e) {
+	var t = this, n = t.constructor;
+	return N(M(t, new n(e), 0, 1, 1), n.precision, n.rounding);
+}, E.equals = E.eq = function(e) {
+	return this.cmp(e) === 0;
+}, E.floor = function() {
+	return N(new this.constructor(this), this.e + 1, 3);
+}, E.greaterThan = E.gt = function(e) {
+	return this.cmp(e) > 0;
+}, E.greaterThanOrEqualTo = E.gte = function(e) {
+	var t = this.cmp(e);
+	return t == 1 || t === 0;
+}, E.hyperbolicCosine = E.cosh = function() {
+	var e, t, n, r, i, a = this, o = a.constructor, s = new o(1);
+	if (!a.isFinite()) return new o(a.s ? Infinity : NaN);
+	if (a.isZero()) return s;
+	n = o.precision, r = o.rounding, o.precision = n + Math.max(a.e, a.sd()) + 4, o.rounding = 1, i = a.d.length, i < 32 ? (e = Math.ceil(i / 3), t = (1 / J(4, e)).toString()) : (e = 16, t = "2.3283064365386962890625e-10"), a = q(o, 1, a.times(t), new o(1), !0);
+	for (var c, l = e, u = new o(8); l--;) c = a.times(a), a = s.minus(c.times(u.minus(c.times(u))));
+	return N(a, o.precision = n, o.rounding = r, !0);
+}, E.hyperbolicSine = E.sinh = function() {
+	var e, t, n, r, i = this, a = i.constructor;
+	if (!i.isFinite() || i.isZero()) return new a(i);
+	if (t = a.precision, n = a.rounding, a.precision = t + Math.max(i.e, i.sd()) + 4, a.rounding = 1, r = i.d.length, r < 3) i = q(a, 2, i, i, !0);
+	else {
+		e = 1.4 * Math.sqrt(r), e = e > 16 ? 16 : e | 0, i = i.times(1 / J(5, e)), i = q(a, 2, i, i, !0);
+		for (var o, s = new a(5), c = new a(16), l = new a(20); e--;) o = i.times(i), i = i.times(s.plus(o.times(c.times(o).plus(l))));
+	}
+	return a.precision = t, a.rounding = n, N(i, t, n, !0);
+}, E.hyperbolicTangent = E.tanh = function() {
+	var e, t, n = this, r = n.constructor;
+	return n.isFinite() ? n.isZero() ? new r(n) : (e = r.precision, t = r.rounding, r.precision = e + 7, r.rounding = 1, M(n.sinh(), n.cosh(), r.precision = e, r.rounding = t)) : new r(n.s);
+}, E.inverseCosine = E.acos = function() {
+	var e = this, t = e.constructor, n = e.abs().cmp(1), r = t.precision, i = t.rounding;
+	return n === -1 ? e.isZero() ? L(t, r + 4, i).times(.5) : (t.precision = r + 6, t.rounding = 1, e = new t(1).minus(e).div(e.plus(1)).sqrt().atan(), t.precision = r, t.rounding = i, e.times(2)) : n === 0 ? e.isNeg() ? L(t, r, i) : new t(0) : new t(NaN);
+}, E.inverseHyperbolicCosine = E.acosh = function() {
+	var e, t, n = this, r = n.constructor;
+	return n.lte(1) ? new r(n.eq(1) ? 0 : NaN) : n.isFinite() ? (e = r.precision, t = r.rounding, r.precision = e + Math.max(Math.abs(n.e), n.sd()) + 4, r.rounding = 1, l = !1, n = n.times(n).minus(1).sqrt().plus(n), l = !0, r.precision = e, r.rounding = t, n.ln()) : new r(n);
+}, E.inverseHyperbolicSine = E.asinh = function() {
+	var e, t, n = this, r = n.constructor;
+	return !n.isFinite() || n.isZero() ? new r(n) : (e = r.precision, t = r.rounding, r.precision = e + 2 * Math.max(Math.abs(n.e), n.sd()) + 6, r.rounding = 1, l = !1, n = n.times(n).plus(1).sqrt().plus(n), l = !0, r.precision = e, r.rounding = t, n.ln());
+}, E.inverseHyperbolicTangent = E.atanh = function() {
+	var e, t, n, r, i = this, a = i.constructor;
+	return i.isFinite() ? i.e >= 0 ? new a(i.abs().eq(1) ? i.s / 0 : i.isZero() ? i : NaN) : (e = a.precision, t = a.rounding, r = i.sd(), Math.max(r, e) < 2 * -i.e - 1 ? N(new a(i), e, t, !0) : (a.precision = n = r - i.e, i = M(i.plus(1), new a(1).minus(i), n + e, 1), a.precision = e + 4, a.rounding = 1, i = i.ln(), a.precision = e, a.rounding = t, i.times(.5))) : new a(NaN);
+}, E.inverseSine = E.asin = function() {
+	var e, t, n, r, i = this, a = i.constructor;
+	return i.isZero() ? new a(i) : (t = i.abs().cmp(1), n = a.precision, r = a.rounding, t === -1 ? (a.precision = n + 6, a.rounding = 1, i = i.div(new a(1).minus(i.times(i)).sqrt().plus(1)).atan(), a.precision = n, a.rounding = r, i.times(2)) : t === 0 ? (e = L(a, n + 4, r).times(.5), e.s = i.s, e) : new a(NaN));
+}, E.inverseTangent = E.atan = function() {
+	var e, t, n, r, i, a, o, s, c, u = this, d = u.constructor, f = d.precision, p = d.rounding;
+	if (!u.isFinite()) {
+		if (!u.s) return new d(NaN);
+		if (f + 4 <= T) return o = L(d, f + 4, p).times(.5), o.s = u.s, o;
+	} else if (u.isZero()) return new d(u);
+	else if (u.abs().eq(1) && f + 4 <= T) return o = L(d, f + 4, p).times(.25), o.s = u.s, o;
+	for (d.precision = s = f + 10, d.rounding = 1, n = Math.min(28, s / S + 2 | 0), e = n; e; --e) u = u.div(u.times(u).plus(1).sqrt().plus(1));
+	for (l = !1, t = Math.ceil(s / S), r = 1, c = u.times(u), o = new d(u), i = u; e !== -1;) if (i = i.times(c), a = o.minus(i.div(r += 2)), i = i.times(c), o = a.plus(i.div(r += 2)), o.d[t] !== void 0) for (e = t; o.d[e] === a.d[e] && e--;);
+	return n && (o = o.times(2 << n - 1)), l = !0, N(o, d.precision = f, d.rounding = p, !0);
+}, E.isFinite = function() {
+	return !!this.d;
+}, E.isInteger = E.isInt = function() {
+	return !!this.d && h(this.e / S) > this.d.length - 2;
+}, E.isNaN = function() {
+	return !this.s;
+}, E.isNegative = E.isNeg = function() {
+	return this.s < 0;
+}, E.isPositive = E.isPos = function() {
+	return this.s > 0;
+}, E.isZero = function() {
+	return !!this.d && this.d[0] === 0;
+}, E.lessThan = E.lt = function(e) {
+	return this.cmp(e) < 0;
+}, E.lessThanOrEqualTo = E.lte = function(e) {
+	return this.cmp(e) < 1;
+}, E.logarithm = E.log = function(e) {
+	var t, n, r, i, a, o, s, c, u = this, d = u.constructor, f = d.precision, p = d.rounding, m = 5;
+	if (e == null) e = new d(10), t = !0;
+	else {
+		if (e = new d(e), n = e.d, e.s < 0 || !n || !n[0] || e.eq(1)) return new d(NaN);
+		t = e.eq(10);
+	}
+	if (n = u.d, u.s < 0 || !n || !n[0] || u.eq(1)) return new d(n && !n[0] ? -Infinity : u.s == 1 ? n ? 0 : Infinity : NaN);
+	if (t) if (n.length > 1) a = !0;
+	else {
+		for (i = n[0]; i % 10 == 0;) i /= 10;
+		a = i !== 1;
+	}
+	if (l = !1, s = f + m, o = W(u, s), r = t ? I(d, s + 10) : W(e, s), c = M(o, r, s, 1), k(c.d, i = f, p)) do
+		if (s += 10, o = W(u, s), r = t ? I(d, s + 10) : W(e, s), c = M(o, r, s, 1), !a) {
+			+D(c.d).slice(i + 1, i + 15) + 1 == 0x5af3107a4000 && (c = N(c, f + 1, 0));
+			break;
+		}
+	while (k(c.d, i += 10, p));
+	return l = !0, N(c, f, p);
+}, E.minus = E.sub = function(e) {
+	var t, n, r, i, a, o, s, c, u, d, f, p, m = this, g = m.constructor;
+	if (e = new g(e), !m.d || !e.d) return !m.s || !e.s ? e = new g(NaN) : m.d ? e.s = -e.s : e = new g(e.d || m.s !== e.s ? m : NaN), e;
+	if (m.s != e.s) return e.s = -e.s, m.plus(e);
+	if (u = m.d, p = e.d, s = g.precision, c = g.rounding, !u[0] || !p[0]) {
+		if (p[0]) e.s = -e.s;
+		else if (u[0]) e = new g(m);
+		else return new g(c === 3 ? -0 : 0);
+		return l ? N(e, s, c) : e;
+	}
+	if (n = h(e.e / S), d = h(m.e / S), u = u.slice(), a = d - n, a) {
+		for (f = a < 0, f ? (t = u, a = -a, o = p.length) : (t = p, n = d, o = u.length), r = Math.max(Math.ceil(s / S), o) + 2, a > r && (a = r, t.length = 1), t.reverse(), r = a; r--;) t.push(0);
+		t.reverse();
+	} else {
+		for (r = u.length, o = p.length, f = r < o, f && (o = r), r = 0; r < o; r++) if (u[r] != p[r]) {
+			f = u[r] < p[r];
+			break;
+		}
+		a = 0;
+	}
+	for (f && (t = u, u = p, p = t, e.s = -e.s), o = u.length, r = p.length - o; r > 0; --r) u[o++] = 0;
+	for (r = p.length; r > a;) {
+		if (u[--r] < p[r]) {
+			for (i = r; i && u[--i] === 0;) u[i] = x - 1;
+			--u[i], u[r] += x;
+		}
+		u[r] -= p[r];
+	}
+	for (; u[--o] === 0;) u.pop();
+	for (; u[0] === 0; u.shift()) --n;
+	return u[0] ? (e.d = u, e.e = F(u, n), l ? N(e, s, c) : e) : new g(c === 3 ? -0 : 0);
+}, E.modulo = E.mod = function(e) {
+	var t, n = this, r = n.constructor;
+	return e = new r(e), !n.d || !e.s || e.d && !e.d[0] ? new r(NaN) : !e.d || n.d && !n.d[0] ? N(new r(n), r.precision, r.rounding) : (l = !1, r.modulo == 9 ? (t = M(n, e.abs(), 0, 3, 1), t.s *= e.s) : t = M(n, e, 0, r.modulo, 1), t = t.times(e), l = !0, n.minus(t));
+}, E.naturalExponential = E.exp = function() {
+	return U(this);
+}, E.naturalLogarithm = E.ln = function() {
+	return W(this);
+}, E.negated = E.neg = function() {
+	var e = new this.constructor(this);
+	return e.s = -e.s, N(e);
+}, E.plus = E.add = function(e) {
+	var t, n, r, i, a, o, s, c, u, d, f = this, p = f.constructor;
+	if (e = new p(e), !f.d || !e.d) return !f.s || !e.s ? e = new p(NaN) : f.d || (e = new p(e.d || f.s === e.s ? f : NaN)), e;
+	if (f.s != e.s) return e.s = -e.s, f.minus(e);
+	if (u = f.d, d = e.d, s = p.precision, c = p.rounding, !u[0] || !d[0]) return d[0] || (e = new p(f)), l ? N(e, s, c) : e;
+	if (a = h(f.e / S), r = h(e.e / S), u = u.slice(), i = a - r, i) {
+		for (i < 0 ? (n = u, i = -i, o = d.length) : (n = d, r = a, o = u.length), a = Math.ceil(s / S), o = a > o ? a + 1 : o + 1, i > o && (i = o, n.length = 1), n.reverse(); i--;) n.push(0);
+		n.reverse();
+	}
+	for (o = u.length, i = d.length, o - i < 0 && (i = o, n = d, d = u, u = n), t = 0; i;) t = (u[--i] = u[i] + d[i] + t) / x | 0, u[i] %= x;
+	for (t && (u.unshift(t), ++r), o = u.length; u[--o] == 0;) u.pop();
+	return e.d = u, e.e = F(u, r), l ? N(e, s, c) : e;
+}, E.precision = E.sd = function(e) {
+	var t, n = this;
+	if (e !== void 0 && e !== !!e && e !== 1 && e !== 0) throw Error(d + e);
+	return n.d ? (t = R(n.d), e && n.e + 1 > t && (t = n.e + 1)) : t = NaN, t;
+}, E.round = function() {
+	var e = this, t = e.constructor;
+	return N(new t(e), e.e + 1, t.rounding);
+}, E.sine = E.sin = function() {
+	var e, t, n = this, r = n.constructor;
+	return n.isFinite() ? n.isZero() ? new r(n) : (e = r.precision, t = r.rounding, r.precision = e + Math.max(n.e, n.sd()) + S, r.rounding = 1, n = te(r, Y(r, n)), r.precision = e, r.rounding = t, N(c > 2 ? n.neg() : n, e, t, !0)) : new r(NaN);
+}, E.squareRoot = E.sqrt = function() {
+	var e, t, n, r, i, a, o = this, s = o.d, c = o.e, u = o.s, d = o.constructor;
+	if (u !== 1 || !s || !s[0]) return new d(!u || u < 0 && (!s || s[0]) ? NaN : s ? o : Infinity);
+	for (l = !1, u = Math.sqrt(+o), u == 0 || u == Infinity ? (t = D(s), (t.length + c) % 2 == 0 && (t += "0"), u = Math.sqrt(t), c = h((c + 1) / 2) - (c < 0 || c % 2), u == Infinity ? t = "5e" + c : (t = u.toExponential(), t = t.slice(0, t.indexOf("e") + 1) + c), r = new d(t)) : r = new d(u.toString()), n = (c = d.precision) + 3;;) if (a = r, r = a.plus(M(o, a, n + 2, 1)).times(.5), D(a.d).slice(0, n) === (t = D(r.d)).slice(0, n)) if (t = t.slice(n - 3, n + 1), t == "9999" || !i && t == "4999") {
+		if (!i && (N(a, c + 1, 0), a.times(a).eq(o))) {
+			r = a;
+			break;
+		}
+		n += 4, i = 1;
+	} else {
+		(!+t || !+t.slice(1) && t.charAt(0) == "5") && (N(r, c + 1, 1), e = !r.times(r).eq(o));
+		break;
+	}
+	return l = !0, N(r, c, d.rounding, e);
+}, E.tangent = E.tan = function() {
+	var e, t, n = this, r = n.constructor;
+	return n.isFinite() ? n.isZero() ? new r(n) : (e = r.precision, t = r.rounding, r.precision = e + 10, r.rounding = 1, n = n.sin(), n.s = 1, n = M(n, new r(1).minus(n.times(n)).sqrt(), e + 10, 0), r.precision = e, r.rounding = t, N(c == 2 || c == 4 ? n.neg() : n, e, t, !0)) : new r(NaN);
+}, E.times = E.mul = function(e) {
+	var t, n, r, i, a, o, s, c, u, d = this, f = d.constructor, p = d.d, m = (e = new f(e)).d;
+	if (e.s *= d.s, !p || !p[0] || !m || !m[0]) return new f(!e.s || p && !p[0] && !m || m && !m[0] && !p ? NaN : !p || !m ? e.s / 0 : e.s * 0);
+	for (n = h(d.e / S) + h(e.e / S), c = p.length, u = m.length, c < u && (a = p, p = m, m = a, o = c, c = u, u = o), a = [], o = c + u, r = o; r--;) a.push(0);
+	for (r = u; --r >= 0;) {
+		for (t = 0, i = c + r; i > r;) s = a[i] + m[r] * p[i - r - 1] + t, a[i--] = s % x | 0, t = s / x | 0;
+		a[i] = (a[i] + t) % x | 0;
+	}
+	for (; !a[--o];) a.pop();
+	return t ? ++n : a.shift(), e.d = a, e.e = F(a, n), l ? N(e, f.precision, f.rounding) : e;
+}, E.toBinary = function(e, t) {
+	return X(this, 2, e, t);
+}, E.toDecimalPlaces = E.toDP = function(e, n) {
+	var r = this, i = r.constructor;
+	return r = new i(r), e === void 0 ? r : (O(e, 0, t), n === void 0 ? n = i.rounding : O(n, 0, 8), N(r, e + r.e + 1, n));
+}, E.toExponential = function(e, n) {
+	var r, i = this, a = i.constructor;
+	return e === void 0 ? r = P(i, !0) : (O(e, 0, t), n === void 0 ? n = a.rounding : O(n, 0, 8), i = N(new a(i), e + 1, n), r = P(i, !0, e + 1)), i.isNeg() && !i.isZero() ? "-" + r : r;
+}, E.toFixed = function(e, n) {
+	var r, i, a = this, o = a.constructor;
+	return e === void 0 ? r = P(a) : (O(e, 0, t), n === void 0 ? n = o.rounding : O(n, 0, 8), i = N(new o(a), e + a.e + 1, n), r = P(i, !1, e + i.e + 1)), a.isNeg() && !a.isZero() ? "-" + r : r;
+}, E.toFraction = function(e) {
+	var t, n, r, i, a, o, s, c, u, f, p, m, h = this, _ = h.d, v = h.constructor;
+	if (!_) return new v(h);
+	if (u = n = new v(1), r = c = new v(0), t = new v(r), a = t.e = R(_) - h.e - 1, o = a % S, t.d[0] = g(10, o < 0 ? S + o : o), e == null) e = a > 0 ? t : u;
+	else {
+		if (s = new v(e), !s.isInt() || s.lt(u)) throw Error(d + s);
+		e = s.gt(t) ? a > 0 ? t : u : s;
+	}
+	for (l = !1, s = new v(D(_)), f = v.precision, v.precision = a = _.length * S * 2; p = M(s, t, 0, 1, 1), i = n.plus(p.times(r)), i.cmp(e) != 1;) n = r, r = i, i = u, u = c.plus(p.times(i)), c = i, i = t, t = s.minus(p.times(i)), s = i;
+	return i = M(e.minus(n), r, 0, 1, 1), c = c.plus(i.times(u)), n = n.plus(i.times(r)), c.s = u.s = h.s, m = M(u, r, a, 1).minus(h).abs().cmp(M(c, n, a, 1).minus(h).abs()) < 1 ? [u, r] : [c, n], v.precision = f, l = !0, m;
+}, E.toHexadecimal = E.toHex = function(e, t) {
+	return X(this, 16, e, t);
+}, E.toNearest = function(e, t) {
+	var n = this, r = n.constructor;
+	if (n = new r(n), e == null) {
+		if (!n.d) return n;
+		e = new r(1), t = r.rounding;
+	} else {
+		if (e = new r(e), t === void 0 ? t = r.rounding : O(t, 0, 8), !n.d) return e.s ? n : e;
+		if (!e.d) return e.s &&= n.s, e;
+	}
+	return e.d[0] ? (l = !1, n = M(n, e, 0, t, 1).times(e), l = !0, N(n)) : (e.s = n.s, n = e), n;
+}, E.toNumber = function() {
+	return +this;
+}, E.toOctal = function(e, t) {
+	return X(this, 8, e, t);
+}, E.toPower = E.pow = function(e) {
+	var t, n, r, i, a, o, s = this, c = s.constructor, u = +(e = new c(e));
+	if (!s.d || !e.d || !s.d[0] || !e.d[0]) return new c(g(+s, u));
+	if (s = new c(s), s.eq(1)) return s;
+	if (r = c.precision, a = c.rounding, e.eq(1)) return N(s, r, a);
+	if (t = h(e.e / S), t >= e.d.length - 1 && (n = u < 0 ? -u : u) <= C) return i = B(c, s, n, r), e.s < 0 ? new c(1).div(i) : N(i, r, a);
+	if (o = s.s, o < 0) {
+		if (t < e.d.length - 1) return new c(NaN);
+		if (e.d[t] & 1 || (o = 1), s.e == 0 && s.d[0] == 1 && s.d.length == 1) return s.s = o, s;
+	}
+	return n = g(+s, u), t = n == 0 || !isFinite(n) ? h(u * (Math.log("0." + D(s.d)) / Math.LN10 + s.e + 1)) : new c(n + "").e, t > c.maxE + 1 || t < c.minE - 1 ? new c(t > 0 ? o / 0 : 0) : (l = !1, c.rounding = s.s = 1, n = Math.min(12, (t + "").length), i = U(e.times(W(s, r + n)), r), i.d && (i = N(i, r + 5, 1), k(i.d, r, a) && (t = r + 10, i = N(U(e.times(W(s, t + n)), t), t + 5, 1), +D(i.d).slice(r + 1, r + 15) + 1 == 0x5af3107a4000 && (i = N(i, r + 1, 0)))), i.s = o, l = !0, c.rounding = a, N(i, r, a));
+}, E.toPrecision = function(e, n) {
+	var r, i = this, a = i.constructor;
+	return e === void 0 ? r = P(i, i.e <= a.toExpNeg || i.e >= a.toExpPos) : (O(e, 1, t), n === void 0 ? n = a.rounding : O(n, 0, 8), i = N(new a(i), e, n), r = P(i, e <= i.e || i.e <= a.toExpNeg, e)), i.isNeg() && !i.isZero() ? "-" + r : r;
+}, E.toSignificantDigits = E.toSD = function(e, n) {
+	var r = this, i = r.constructor;
+	return e === void 0 ? (e = i.precision, n = i.rounding) : (O(e, 1, t), n === void 0 ? n = i.rounding : O(n, 0, 8)), N(new i(r), e, n);
+}, E.toString = function() {
+	var e = this, t = e.constructor, n = P(e, e.e <= t.toExpNeg || e.e >= t.toExpPos);
+	return e.isNeg() && !e.isZero() ? "-" + n : n;
+}, E.truncated = E.trunc = function() {
+	return N(new this.constructor(this), this.e + 1, 1);
+}, E.valueOf = E.toJSON = function() {
+	var e = this, t = e.constructor, n = P(e, e.e <= t.toExpNeg || e.e >= t.toExpPos);
+	return e.isNeg() ? "-" + n : n;
+};
+function D(e) {
+	var t, n, r, i = e.length - 1, a = "", o = e[0];
+	if (i > 0) {
+		for (a += o, t = 1; t < i; t++) r = e[t] + "", n = S - r.length, n && (a += z(n)), a += r;
+		o = e[t], r = o + "", n = S - r.length, n && (a += z(n));
+	} else if (o === 0) return "0";
+	for (; o % 10 == 0;) o /= 10;
+	return a + o;
+}
+function O(e, t, n) {
+	if (e !== ~~e || e < t || e > n) throw Error(d + e);
+}
+function k(e, t, n, r) {
+	var i, a, o, s;
+	for (a = e[0]; a >= 10; a /= 10) --t;
+	return --t < 0 ? (t += S, i = 0) : (i = Math.ceil((t + 1) / S), t %= S), a = g(10, S - t), s = e[i] % a | 0, r == null ? t < 3 ? (t == 0 ? s = s / 100 | 0 : t == 1 && (s = s / 10 | 0), o = n < 4 && s == 99999 || n > 3 && s == 49999 || s == 5e4 || s == 0) : o = (n < 4 && s + 1 == a || n > 3 && s + 1 == a / 2) && (e[i + 1] / a / 100 | 0) == g(10, t - 2) - 1 || (s == a / 2 || s == 0) && (e[i + 1] / a / 100 | 0) == 0 : t < 4 ? (t == 0 ? s = s / 1e3 | 0 : t == 1 ? s = s / 100 | 0 : t == 2 && (s = s / 10 | 0), o = (r || n < 4) && s == 9999 || !r && n > 3 && s == 4999) : o = ((r || n < 4) && s + 1 == a || !r && n > 3 && s + 1 == a / 2) && (e[i + 1] / a / 1e3 | 0) == g(10, t - 3) - 1, o;
+}
+function A(e, t, r) {
+	for (var i, a = [0], o, s = 0, c = e.length; s < c;) {
+		for (o = a.length; o--;) a[o] *= t;
+		for (a[0] += n.indexOf(e.charAt(s++)), i = 0; i < a.length; i++) a[i] > r - 1 && (a[i + 1] === void 0 && (a[i + 1] = 0), a[i + 1] += a[i] / r | 0, a[i] %= r);
+	}
+	return a.reverse();
+}
+function j(e, t) {
+	var n, r, i;
+	if (t.isZero()) return t;
+	r = t.d.length, r < 32 ? (n = Math.ceil(r / 3), i = (1 / J(4, n)).toString()) : (n = 16, i = "2.3283064365386962890625e-10"), e.precision += n, t = q(e, 1, t.times(i), new e(1));
+	for (var a = n; a--;) {
+		var o = t.times(t);
+		t = o.times(o).minus(o).times(8).plus(1);
+	}
+	return e.precision -= n, t;
+}
+var M = (function() {
+	function e(e, t, n) {
+		var r, i = 0, a = e.length;
+		for (e = e.slice(); a--;) r = e[a] * t + i, e[a] = r % n | 0, i = r / n | 0;
+		return i && e.unshift(i), e;
+	}
+	function t(e, t, n, r) {
+		var i, a;
+		if (n != r) a = n > r ? 1 : -1;
+		else for (i = a = 0; i < n; i++) if (e[i] != t[i]) {
+			a = e[i] > t[i] ? 1 : -1;
+			break;
+		}
+		return a;
+	}
+	function n(e, t, n, r) {
+		for (var i = 0; n--;) e[n] -= i, i = e[n] < t[n] ? 1 : 0, e[n] = i * r + e[n] - t[n];
+		for (; !e[0] && e.length > 1;) e.shift();
+	}
+	return function(r, i, a, o, c, l) {
+		var u, d, f, p, m, g, _, v, y, b, C, w, T, E, D, O, k, A, j, M, P = r.constructor, F = r.s == i.s ? 1 : -1, I = r.d, L = i.d;
+		if (!I || !I[0] || !L || !L[0]) return new P(!r.s || !i.s || (I ? L && I[0] == L[0] : !L) ? NaN : I && I[0] == 0 || !L ? F * 0 : F / 0);
+		for (l ? (m = 1, d = r.e - i.e) : (l = x, m = S, d = h(r.e / m) - h(i.e / m)), j = L.length, k = I.length, y = new P(F), b = y.d = [], f = 0; L[f] == (I[f] || 0); f++);
+		if (L[f] > (I[f] || 0) && d--, a == null ? (E = a = P.precision, o = P.rounding) : E = c ? a + (r.e - i.e) + 1 : a, E < 0) b.push(1), g = !0;
+		else {
+			if (E = E / m + 2 | 0, f = 0, j == 1) {
+				for (p = 0, L = L[0], E++; (f < k || p) && E--; f++) D = p * l + (I[f] || 0), b[f] = D / L | 0, p = D % L | 0;
+				g = p || f < k;
+			} else {
+				for (p = l / (L[0] + 1) | 0, p > 1 && (L = e(L, p, l), I = e(I, p, l), j = L.length, k = I.length), O = j, C = I.slice(0, j), w = C.length; w < j;) C[w++] = 0;
+				M = L.slice(), M.unshift(0), A = L[0], L[1] >= l / 2 && ++A;
+				do
+					p = 0, u = t(L, C, j, w), u < 0 ? (T = C[0], j != w && (T = T * l + (C[1] || 0)), p = T / A | 0, p > 1 ? (p >= l && (p = l - 1), _ = e(L, p, l), v = _.length, w = C.length, u = t(_, C, v, w), u == 1 && (p--, n(_, j < v ? M : L, v, l))) : (p == 0 && (u = p = 1), _ = L.slice()), v = _.length, v < w && _.unshift(0), n(C, _, w, l), u == -1 && (w = C.length, u = t(L, C, j, w), u < 1 && (p++, n(C, j < w ? M : L, w, l))), w = C.length) : u === 0 && (p++, C = [0]), b[f++] = p, u && C[0] ? C[w++] = I[O] || 0 : (C = [I[O]], w = 1);
+				while ((O++ < k || C[0] !== void 0) && E--);
+				g = C[0] !== void 0;
+			}
+			b[0] || b.shift();
+		}
+		if (m == 1) y.e = d, s = g;
+		else {
+			for (f = 1, p = b[0]; p >= 10; p /= 10) f++;
+			y.e = f + d * m - 1, N(y, c ? a + y.e + 1 : a, o, g);
+		}
+		return y;
+	};
 })();
-function p(e, i, n, r) {
-  var s, t, o, u, c, f, l, a, h, g = e.constructor;
-  e: if (i != null) {
-    if (a = e.d, !a) return e;
-    for (s = 1, u = a[0]; u >= 10; u /= 10) s++;
-    if (t = i - s, t < 0)
-      t += w, o = i, l = a[h = 0], c = l / C(10, s - o - 1) % 10 | 0;
-    else if (h = Math.ceil((t + 1) / w), u = a.length, h >= u)
-      if (r) {
-        for (; u++ <= h; ) a.push(0);
-        l = c = 0, s = 1, t %= w, o = t - w + 1;
-      } else
-        break e;
-    else {
-      for (l = u = a[h], s = 1; u >= 10; u /= 10) s++;
-      t %= w, o = t - w + s, c = o < 0 ? 0 : l / C(10, s - o - 1) % 10 | 0;
-    }
-    if (r = r || i < 0 || a[h + 1] !== void 0 || (o < 0 ? l : l % C(10, s - o - 1)), f = n < 4 ? (c || r) && (n == 0 || n == (e.s < 0 ? 3 : 2)) : c > 5 || c == 5 && (n == 4 || r || n == 6 && // Check whether the digit to the left of the rounding digit is odd.
-    (t > 0 ? o > 0 ? l / C(10, s - o) : 0 : a[h - 1]) % 10 & 1 || n == (e.s < 0 ? 8 : 7)), i < 1 || !a[0])
-      return a.length = 0, f ? (i -= e.e + 1, a[0] = C(10, (w - i % w) % w), e.e = -i || 0) : a[0] = e.e = 0, e;
-    if (t == 0 ? (a.length = h, u = 1, h--) : (a.length = h + 1, u = C(10, w - t), a[h] = o > 0 ? (l / C(10, s - o) % C(10, o) | 0) * u : 0), f)
-      for (; ; )
-        if (h == 0) {
-          for (t = 1, o = a[0]; o >= 10; o /= 10) t++;
-          for (o = a[0] += u, u = 1; o >= 10; o /= 10) u++;
-          t != u && (e.e++, a[0] == R && (a[0] = 1));
-          break;
-        } else {
-          if (a[h] += u, a[h] != R) break;
-          a[h--] = 0, u = 1;
-        }
-    for (t = a.length; a[--t] === 0; ) a.pop();
-  }
-  return m && (e.e > g.maxE ? (e.d = null, e.e = NaN) : e.e < g.minE && (e.e = 0, e.d = [0])), e;
-}
-function Z(e, i, n) {
-  if (!e.isFinite()) return Ce(e);
-  var r, s = e.e, t = P(e.d), o = t.length;
-  return i ? (n && (r = n - o) > 0 ? t = t.charAt(0) + "." + t.slice(1) + B(r) : o > 1 && (t = t.charAt(0) + "." + t.slice(1)), t = t + (e.e < 0 ? "e" : "e+") + e.e) : s < 0 ? (t = "0." + B(-s - 1) + t, n && (r = n - o) > 0 && (t += B(r))) : s >= o ? (t += B(s + 1 - o), n && (r = n - s - 1) > 0 && (t = t + "." + B(r))) : ((r = s + 1) < o && (t = t.slice(0, r) + "." + t.slice(r)), n && (r = n - o) > 0 && (s + 1 === o && (t += "."), t += B(r))), t;
-}
-function re(e, i) {
-  var n = e[0];
-  for (i *= w; n >= 10; n /= 10) i++;
-  return i;
-}
-function ie(e, i, n) {
-  if (i > De)
-    throw m = !0, n && (e.precision = n), Error(me);
-  return p(new e(y), i, 1, !0);
-}
-function T(e, i, n) {
-  if (i > le) throw Error(me);
-  return p(new e(ee), i, n, !0);
-}
-function ke(e) {
-  var i = e.length - 1, n = i * w + 1;
-  if (i = e[i], i) {
-    for (; i % 10 == 0; i /= 10) n--;
-    for (i = e[0]; i >= 10; i /= 10) n++;
-  }
-  return n;
-}
-function B(e) {
-  for (var i = ""; e--; ) i += "0";
-  return i;
-}
-function Me(e, i, n, r) {
-  var s, t = new e(1), o = Math.ceil(r / w + 4);
-  for (m = !1; ; ) {
-    if (n % 2 && (t = t.times(i), pe(t.d, o) && (s = !0)), n = L(n / 2), n === 0) {
-      n = t.d.length - 1, s && t.d[n] === 0 && ++t.d[n];
-      break;
-    }
-    i = i.times(i), pe(i.d, o);
-  }
-  return m = !0, t;
+function N(e, t, n, r) {
+	var i, a, o, s, c, u, d, f, p, m = e.constructor;
+	out: if (t != null) {
+		if (f = e.d, !f) return e;
+		for (i = 1, s = f[0]; s >= 10; s /= 10) i++;
+		if (a = t - i, a < 0) a += S, o = t, d = f[p = 0], c = d / g(10, i - o - 1) % 10 | 0;
+		else if (p = Math.ceil((a + 1) / S), s = f.length, p >= s) if (r) {
+			for (; s++ <= p;) f.push(0);
+			d = c = 0, i = 1, a %= S, o = a - S + 1;
+		} else break out;
+		else {
+			for (d = s = f[p], i = 1; s >= 10; s /= 10) i++;
+			a %= S, o = a - S + i, c = o < 0 ? 0 : d / g(10, i - o - 1) % 10 | 0;
+		}
+		if (r = r || t < 0 || f[p + 1] !== void 0 || (o < 0 ? d : d % g(10, i - o - 1)), u = n < 4 ? (c || r) && (n == 0 || n == (e.s < 0 ? 3 : 2)) : c > 5 || c == 5 && (n == 4 || r || n == 6 && (a > 0 ? o > 0 ? d / g(10, i - o) : 0 : f[p - 1]) % 10 & 1 || n == (e.s < 0 ? 8 : 7)), t < 1 || !f[0]) return f.length = 0, u ? (t -= e.e + 1, f[0] = g(10, (S - t % S) % S), e.e = -t || 0) : f[0] = e.e = 0, e;
+		if (a == 0 ? (f.length = p, s = 1, p--) : (f.length = p + 1, s = g(10, S - a), f[p] = o > 0 ? (d / g(10, i - o) % g(10, o) | 0) * s : 0), u) for (;;) if (p == 0) {
+			for (a = 1, o = f[0]; o >= 10; o /= 10) a++;
+			for (o = f[0] += s, s = 1; o >= 10; o /= 10) s++;
+			a != s && (e.e++, f[0] == x && (f[0] = 1));
+			break;
+		} else {
+			if (f[p] += s, f[p] != x) break;
+			f[p--] = 0, s = 1;
+		}
+		for (a = f.length; f[--a] === 0;) f.pop();
+	}
+	return l && (e.e > m.maxE ? (e.d = null, e.e = NaN) : e.e < m.minE && (e.e = 0, e.d = [0])), e;
+}
+function P(e, t, n) {
+	if (!e.isFinite()) return G(e);
+	var r, i = e.e, a = D(e.d), o = a.length;
+	return t ? (n && (r = n - o) > 0 ? a = a.charAt(0) + "." + a.slice(1) + z(r) : o > 1 && (a = a.charAt(0) + "." + a.slice(1)), a = a + (e.e < 0 ? "e" : "e+") + e.e) : i < 0 ? (a = "0." + z(-i - 1) + a, n && (r = n - o) > 0 && (a += z(r))) : i >= o ? (a += z(i + 1 - o), n && (r = n - i - 1) > 0 && (a = a + "." + z(r))) : ((r = i + 1) < o && (a = a.slice(0, r) + "." + a.slice(r)), n && (r = n - o) > 0 && (i + 1 === o && (a += "."), a += z(r))), a;
+}
+function F(e, t) {
+	var n = e[0];
+	for (t *= S; n >= 10; n /= 10) t++;
+	return t;
+}
+function I(e, t, n) {
+	if (t > w) throw l = !0, n && (e.precision = n), Error(f);
+	return N(new e(r), t, 1, !0);
+}
+function L(e, t, n) {
+	if (t > T) throw Error(f);
+	return N(new e(i), t, n, !0);
+}
+function R(e) {
+	var t = e.length - 1, n = t * S + 1;
+	if (t = e[t], t) {
+		for (; t % 10 == 0; t /= 10) n--;
+		for (t = e[0]; t >= 10; t /= 10) n++;
+	}
+	return n;
+}
+function z(e) {
+	for (var t = ""; e--;) t += "0";
+	return t;
+}
+function B(e, t, n, r) {
+	var i, a = new e(1), o = Math.ceil(r / S + 4);
+	for (l = !1;;) {
+		if (n % 2 && (a = a.times(t), Z(a.d, o) && (i = !0)), n = h(n / 2), n === 0) {
+			n = a.d.length - 1, i && a.d[n] === 0 && ++a.d[n];
+			break;
+		}
+		t = t.times(t), Z(t.d, o);
+	}
+	return l = !0, a;
+}
+function V(e) {
+	return e.d[e.d.length - 1] & 1;
+}
+function H(e, t, n) {
+	for (var r, i, a = new e(t[0]), o = 0; ++o < t.length;) {
+		if (i = new e(t[o]), !i.s) {
+			a = i;
+			break;
+		}
+		r = a.cmp(i), (r === n || r === 0 && a.s === n) && (a = i);
+	}
+	return a;
+}
+function U(e, t) {
+	var n, r, i, a, o, s, c, u = 0, d = 0, f = 0, p = e.constructor, m = p.rounding, h = p.precision;
+	if (!e.d || !e.d[0] || e.e > 17) return new p(e.d ? e.d[0] ? e.s < 0 ? 0 : Infinity : 1 : e.s ? e.s < 0 ? 0 : e : NaN);
+	for (t == null ? (l = !1, c = h) : c = t, s = new p(.03125); e.e > -2;) e = e.times(s), f += 5;
+	for (r = Math.log(g(2, f)) / Math.LN10 * 2 + 5 | 0, c += r, n = a = o = new p(1), p.precision = c;;) {
+		if (a = N(a.times(e), c, 1), n = n.times(++d), s = o.plus(M(a, n, c, 1)), D(s.d).slice(0, c) === D(o.d).slice(0, c)) {
+			for (i = f; i--;) o = N(o.times(o), c, 1);
+			if (t == null) if (u < 3 && k(o.d, c - r, m, u)) p.precision = c += 10, n = a = s = new p(1), d = 0, u++;
+			else return N(o, p.precision = h, m, l = !0);
+			else return p.precision = h, o;
+		}
+		o = s;
+	}
+}
+function W(e, t) {
+	var n, r, i, a, o, s, c, u, d, f, p, m = 1, h = 10, g = e, _ = g.d, v = g.constructor, y = v.rounding, b = v.precision;
+	if (g.s < 0 || !_ || !_[0] || !g.e && _[0] == 1 && _.length == 1) return new v(_ && !_[0] ? -Infinity : g.s == 1 ? _ ? 0 : g : NaN);
+	if (t == null ? (l = !1, d = b) : d = t, v.precision = d += h, n = D(_), r = n.charAt(0), Math.abs(a = g.e) < 0x5543df729c000) {
+		for (; r < 7 && r != 1 || r == 1 && n.charAt(1) > 3;) g = g.times(e), n = D(g.d), r = n.charAt(0), m++;
+		a = g.e, r > 1 ? (g = new v("0." + n), a++) : g = new v(r + "." + n.slice(1));
+	} else return u = I(v, d + 2, b).times(a + ""), g = W(new v(r + "." + n.slice(1)), d - h).plus(u), v.precision = b, t == null ? N(g, b, y, l = !0) : g;
+	for (f = g, c = o = g = M(g.minus(1), g.plus(1), d, 1), p = N(g.times(g), d, 1), i = 3;;) {
+		if (o = N(o.times(p), d, 1), u = c.plus(M(o, new v(i), d, 1)), D(u.d).slice(0, d) === D(c.d).slice(0, d)) if (c = c.times(2), a !== 0 && (c = c.plus(I(v, d + 2, b).times(a + ""))), c = M(c, new v(m), d, 1), t == null) if (k(c.d, d - h, y, s)) v.precision = d += h, u = o = g = M(f.minus(1), f.plus(1), d, 1), p = N(g.times(g), d, 1), i = s = 1;
+		else return N(c, v.precision = b, y, l = !0);
+		else return v.precision = b, c;
+		c = u, i += 2;
+	}
+}
+function G(e) {
+	return String(e.s * e.s / 0);
+}
+function K(e, t) {
+	var n, r, i;
+	for ((n = t.indexOf(".")) > -1 && (t = t.replace(".", "")), (r = t.search(/e/i)) > 0 ? (n < 0 && (n = r), n += +t.slice(r + 1), t = t.substring(0, r)) : n < 0 && (n = 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, e.e = n = n - r - 1, e.d = [], r = (n + 1) % S, n < 0 && (r += S), r < i) {
+			for (r && e.d.push(+t.slice(0, r)), i -= S; r < i;) e.d.push(+t.slice(r, r += S));
+			t = t.slice(r), r = S - t.length;
+		} else r -= i;
+		for (; r--;) t += "0";
+		e.d.push(+t), l && (e.e > e.constructor.maxE ? (e.d = null, e.e = NaN) : e.e < e.constructor.minE && (e.e = 0, e.d = [0]));
+	} else e.e = 0, e.d = [0];
+	return e;
+}
+function ee(e, t) {
+	var n, r, i, a, s, c, u, f, p;
+	if (t.indexOf("_") > -1) {
+		if (t = t.replace(/(\d)_(?=\d)/g, "$1"), b.test(t)) return K(e, t);
+	} else if (t === "Infinity" || t === "NaN") return +t || (e.s = NaN), e.e = NaN, e.d = null, e;
+	if (v.test(t)) n = 16, t = t.toLowerCase();
+	else if (_.test(t)) n = 2;
+	else if (y.test(t)) n = 8;
+	else throw Error(d + t);
+	for (a = t.search(/p/i), a > 0 ? (u = +t.slice(a + 1), t = t.substring(2, a)) : t = t.slice(2), a = t.indexOf("."), s = a >= 0, r = e.constructor, s && (t = t.replace(".", ""), c = t.length, a = c - a, i = B(r, new r(n), a, a * 2)), f = A(t, n, x), p = f.length - 1, a = p; f[a] === 0; --a) f.pop();
+	return a < 0 ? new r(e.s * 0) : (e.e = F(f, p), e.d = f, l = !1, s && (e = M(e, i, c * 4)), u && (e = e.times(Math.abs(u) < 54 ? g(2, u) : o.pow(2, u))), l = !0, e);
+}
+function te(e, t) {
+	var n, r = t.d.length;
+	if (r < 3) return t.isZero() ? t : q(e, 2, t, t);
+	n = 1.4 * Math.sqrt(r), n = n > 16 ? 16 : n | 0, t = t.times(1 / J(5, n)), t = q(e, 2, t, t);
+	for (var i, a = new e(5), o = new e(16), s = new e(20); n--;) i = t.times(t), t = t.times(a.plus(i.times(o.times(i).minus(s))));
+	return t;
+}
+function q(e, t, n, r, i) {
+	var a, o, s, c, u = 1, d = e.precision, f = Math.ceil(d / S);
+	for (l = !1, c = n.times(n), s = new e(r);;) {
+		if (o = M(s.times(c), new e(t++ * t++), d, 1), s = i ? r.plus(o) : r.minus(o), r = M(o.times(c), new e(t++ * t++), d, 1), o = s.plus(r), o.d[f] !== void 0) {
+			for (a = f; o.d[a] === s.d[a] && a--;);
+			if (a == -1) break;
+		}
+		a = s, s = r, r = o, o = a, u++;
+	}
+	return l = !0, o.d.length = f + 1, o;
+}
+function J(e, t) {
+	for (var n = e; --t;) n *= e;
+	return n;
+}
+function Y(e, t) {
+	var n, r = t.s < 0, i = L(e, e.precision, 1), a = i.times(.5);
+	if (t = t.abs(), t.lte(a)) return c = r ? 4 : 1, t;
+	if (n = t.divToInt(i), n.isZero()) c = r ? 3 : 2;
+	else {
+		if (t = t.minus(n.times(i)), t.lte(a)) return c = V(n) ? r ? 2 : 3 : r ? 4 : 1, t;
+		c = V(n) ? r ? 1 : 4 : r ? 3 : 2;
+	}
+	return t.minus(i).abs();
+}
+function X(e, r, i, a) {
+	var o, c, l, u, d, f, p, m, h, g = e.constructor, _ = i !== void 0;
+	if (_ ? (O(i, 1, t), a === void 0 ? a = g.rounding : O(a, 0, 8)) : (i = g.precision, a = g.rounding), !e.isFinite()) p = G(e);
+	else {
+		for (p = P(e), l = p.indexOf("."), _ ? (o = 2, r == 16 ? i = i * 4 - 3 : r == 8 && (i = i * 3 - 2)) : o = r, l >= 0 && (p = p.replace(".", ""), h = new g(1), h.e = p.length - l, h.d = A(P(h), 10, o), h.e = h.d.length), m = A(p, 10, o), c = d = m.length; m[--d] == 0;) m.pop();
+		if (!m[0]) p = _ ? "0p+0" : "0";
+		else {
+			if (l < 0 ? c-- : (e = new g(e), e.d = m, e.e = c, e = M(e, h, i, a, 0, o), m = e.d, c = e.e, f = s), l = m[i], u = o / 2, f ||= m[i + 1] !== void 0, f = a < 4 ? (l !== void 0 || f) && (a === 0 || a === (e.s < 0 ? 3 : 2)) : l > u || l === u && (a === 4 || f || a === 6 && m[i - 1] & 1 || a === (e.s < 0 ? 8 : 7)), m.length = i, f) for (; ++m[--i] > o - 1;) m[i] = 0, i || (++c, m.unshift(1));
+			for (d = m.length; !m[d - 1]; --d);
+			for (l = 0, p = ""; l < d; l++) p += n.charAt(m[l]);
+			if (_) {
+				if (d > 1) if (r == 16 || r == 8) {
+					for (l = r == 16 ? 4 : 3, --d; d % l; d++) p += "0";
+					for (m = A(p, o, r), d = m.length; !m[d - 1]; --d);
+					for (l = 1, p = "1."; l < d; l++) p += n.charAt(m[l]);
+				} else p = p.charAt(0) + "." + p.slice(1);
+				p = p + (c < 0 ? "p" : "p+") + c;
+			} else if (c < 0) {
+				for (; ++c;) p = "0" + p;
+				p = "0." + p;
+			} else if (++c > d) for (c -= d; c--;) p += "0";
+			else c < d && (p = p.slice(0, c) + "." + p.slice(c));
+		}
+		p = (r == 16 ? "0x" : r == 2 ? "0b" : r == 8 ? "0o" : "") + p;
+	}
+	return e.s < 0 ? "-" + p : p;
+}
+function Z(e, t) {
+	if (e.length > t) return e.length = t, !0;
+}
+function ne(e) {
+	return new this(e).abs();
+}
+function re(e) {
+	return new this(e).acos();
+}
+function ie(e) {
+	return new this(e).acosh();
+}
+function ae(e, t) {
+	return new this(e).plus(t);
+}
+function oe(e) {
+	return new this(e).asin();
+}
+function se(e) {
+	return new this(e).asinh();
+}
+function ce(e) {
+	return new this(e).atan();
+}
+function le(e) {
+	return new this(e).atanh();
+}
+function ue(e, t) {
+	e = new this(e), t = new this(t);
+	var n, r = this.precision, i = this.rounding, a = r + 4;
+	return !e.s || !t.s ? n = new this(NaN) : !e.d && !t.d ? (n = L(this, a, 1).times(t.s > 0 ? .25 : .75), n.s = e.s) : !t.d || e.isZero() ? (n = t.s < 0 ? L(this, r, i) : new this(0), n.s = e.s) : !e.d || t.isZero() ? (n = L(this, a, 1).times(.5), n.s = e.s) : t.s < 0 ? (this.precision = a, this.rounding = 1, n = this.atan(M(e, t, a, 1)), t = L(this, a, 1), this.precision = r, this.rounding = i, n = e.s < 0 ? n.minus(t) : n.plus(t)) : n = this.atan(M(e, t, a, 1)), n;
 }
 function de(e) {
-  return e.d[e.d.length - 1] & 1;
-}
-function qe(e, i, n) {
-  for (var r, s, t = new e(i[0]), o = 0; ++o < i.length; ) {
-    if (s = new e(i[o]), !s.s) {
-      t = s;
-      break;
-    }
-    r = t.cmp(s), (r === n || r === 0 && t.s === n) && (t = s);
-  }
-  return t;
-}
-function ae(e, i) {
-  var n, r, s, t, o, u, c, f = 0, l = 0, a = 0, h = e.constructor, g = h.rounding, v = h.precision;
-  if (!e.d || !e.d[0] || e.e > 17)
-    return new h(
-      e.d ? e.d[0] ? e.s < 0 ? 0 : 1 / 0 : 1 : e.s ? e.s < 0 ? 0 : e : NaN
-    );
-  for (i == null ? (m = !1, c = v) : c = i, u = new h(0.03125); e.e > -2; )
-    e = e.times(u), a += 5;
-  for (r = Math.log(C(2, a)) / Math.LN10 * 2 + 5 | 0, c += r, n = t = o = new h(1), h.precision = c; ; ) {
-    if (t = p(t.times(e), c, 1), n = n.times(++l), u = o.plus(k(t, n, c, 1)), P(u.d).slice(0, c) === P(o.d).slice(0, c)) {
-      for (s = a; s--; ) o = p(o.times(o), c, 1);
-      if (i == null)
-        if (f < 3 && J(o.d, c - r, g, f))
-          h.precision = c += 10, n = t = u = new h(1), l = 0, f++;
-        else
-          return p(o, h.precision = v, g, m = !0);
-      else
-        return h.precision = v, o;
-    }
-    o = u;
-  }
-}
-function H(e, i) {
-  var n, r, s, t, o, u, c, f, l, a, h, g = 1, v = 10, N = e, F = N.d, q = N.constructor, D = q.rounding, E = q.precision;
-  if (N.s < 0 || !F || !F[0] || !N.e && F[0] == 1 && F.length == 1)
-    return new q(F && !F[0] ? -1 / 0 : N.s != 1 ? NaN : F ? 0 : N);
-  if (i == null ? (m = !1, l = E) : l = i, q.precision = l += v, n = P(F), r = n.charAt(0), Math.abs(t = N.e) < 15e14) {
-    for (; r < 7 && r != 1 || r == 1 && n.charAt(1) > 3; )
-      N = N.times(e), n = P(N.d), r = n.charAt(0), g++;
-    t = N.e, r > 1 ? (N = new q("0." + n), t++) : N = new q(r + "." + n.slice(1));
-  } else
-    return f = ie(q, l + 2, E).times(t + ""), N = H(new q(r + "." + n.slice(1)), l - v).plus(f), q.precision = E, i == null ? p(N, E, D, m = !0) : N;
-  for (a = N, c = o = N = k(N.minus(1), N.plus(1), l, 1), h = p(N.times(N), l, 1), s = 3; ; ) {
-    if (o = p(o.times(h), l, 1), f = c.plus(k(o, new q(s), l, 1)), P(f.d).slice(0, l) === P(c.d).slice(0, l))
-      if (c = c.times(2), t !== 0 && (c = c.plus(ie(q, l + 2, E).times(t + ""))), c = k(c, new q(g), l, 1), i == null)
-        if (J(c.d, l - v, D, u))
-          q.precision = l += v, f = o = N = k(a.minus(1), a.plus(1), l, 1), h = p(N.times(N), l, 1), s = u = 1;
-        else
-          return p(c, q.precision = E, D, m = !0);
-      else
-        return q.precision = E, c;
-    c = f, s += 2;
-  }
+	return new this(e).cbrt();
+}
+function fe(e) {
+	return N(e = new this(e), e.e + 1, 2);
+}
+function pe(e, t, n) {
+	return new this(e).clamp(t, n);
+}
+function me(n) {
+	if (!n || typeof n != "object") throw Error(u + "Object expected");
+	var r, i, o, s = n.defaults === !0, c = [
+		"precision",
+		1,
+		t,
+		"rounding",
+		0,
+		8,
+		"toExpNeg",
+		-e,
+		0,
+		"toExpPos",
+		0,
+		e,
+		"maxE",
+		0,
+		e,
+		"minE",
+		-e,
+		0,
+		"modulo",
+		0,
+		9
+	];
+	for (r = 0; r < c.length; r += 3) if (i = c[r], s && (this[i] = a[i]), (o = n[i]) !== void 0) if (h(o) === o && o >= c[r + 1] && o <= c[r + 2]) this[i] = o;
+	else throw Error(d + i + ": " + o);
+	if (i = "crypto", s && (this[i] = a[i]), (o = n[i]) !== void 0) if (o === !0 || o === !1 || o === 0 || o === 1) if (o) if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes)) this[i] = !0;
+	else throw Error(p);
+	else this[i] = !1;
+	else throw Error(d + i + ": " + o);
+	return this;
+}
+function he(e) {
+	return new this(e).cos();
+}
+function ge(e) {
+	return new this(e).cosh();
+}
+function Q(e) {
+	var t, n, r;
+	function i(e) {
+		var t, n, r, a = this;
+		if (!(a instanceof i)) return new i(e);
+		if (a.constructor = i, $(e)) {
+			a.s = e.s, l ? !e.d || e.e > i.maxE ? (a.e = NaN, a.d = null) : e.e < i.minE ? (a.e = 0, a.d = [0]) : (a.e = e.e, a.d = e.d.slice()) : (a.e = e.e, a.d = e.d ? e.d.slice() : e.d);
+			return;
+		}
+		if (r = typeof e, r === "number") {
+			if (e === 0) {
+				a.s = 1 / e < 0 ? -1 : 1, a.e = 0, a.d = [0];
+				return;
+			}
+			if (e < 0 ? (e = -e, a.s = -1) : a.s = 1, e === ~~e && e < 1e7) {
+				for (t = 0, n = e; n >= 10; n /= 10) t++;
+				l ? t > i.maxE ? (a.e = NaN, a.d = null) : t < i.minE ? (a.e = 0, a.d = [0]) : (a.e = t, a.d = [e]) : (a.e = t, a.d = [e]);
+				return;
+			}
+			if (e * 0 != 0) {
+				e || (a.s = NaN), a.e = NaN, a.d = null;
+				return;
+			}
+			return K(a, e.toString());
+		}
+		if (r === "string") return (n = e.charCodeAt(0)) === 45 ? (e = e.slice(1), a.s = -1) : (n === 43 && (e = e.slice(1)), a.s = 1), b.test(e) ? K(a, e) : ee(a, e);
+		if (r === "bigint") return e < 0 ? (e = -e, a.s = -1) : a.s = 1, K(a, e.toString());
+		throw Error(d + e);
+	}
+	if (i.prototype = E, 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 = me, i.clone = Q, i.isDecimal = $, i.abs = ne, i.acos = re, i.acosh = ie, i.add = ae, i.asin = oe, i.asinh = se, i.atan = ce, i.atanh = le, i.atan2 = ue, i.cbrt = de, i.ceil = fe, i.clamp = pe, i.cos = he, i.cosh = ge, i.div = _e, i.exp = ve, i.floor = ye, i.hypot = be, i.ln = xe, i.log = Se, i.log10 = we, i.log2 = Ce, i.max = Te, i.min = Ee, i.mod = De, i.mul = Oe, i.pow = ke, i.random = Ae, i.round = je, i.sign = Me, i.sin = Ne, i.sinh = Pe, i.sqrt = Fe, i.sub = Ie, i.sum = Le, i.tan = Re, i.tanh = ze, i.trunc = Be, e === void 0 && (e = {}), e && e.defaults !== !0) for (r = [
+		"precision",
+		"rounding",
+		"toExpNeg",
+		"toExpPos",
+		"maxE",
+		"minE",
+		"modulo",
+		"crypto"
+	], t = 0; t < r.length;) Object.prototype.hasOwnProperty.call(e, n = r[t++]) || (e[n] = this[n]);
+	return i.config(e), i;
+}
+function _e(e, t) {
+	return new this(e).div(t);
+}
+function ve(e) {
+	return new this(e).exp();
+}
+function ye(e) {
+	return N(e = new this(e), e.e + 1, 3);
+}
+function be() {
+	var e, t, n = new this(0);
+	for (l = !1, e = 0; e < arguments.length;) if (t = new this(arguments[e++]), t.d) n.d && (n = n.plus(t.times(t)));
+	else {
+		if (t.s) return l = !0, new this(Infinity);
+		n = t;
+	}
+	return l = !0, n.sqrt();
+}
+function $(e) {
+	return e instanceof o || e && e.toStringTag === m || !1;
+}
+function xe(e) {
+	return new this(e).ln();
+}
+function Se(e, t) {
+	return new this(e).log(t);
 }
 function Ce(e) {
-  return String(e.s * e.s / 0);
-}
-function x(e, i) {
-  var n, r, s;
-  for ((n = i.indexOf(".")) > -1 && (i = i.replace(".", "")), (r = i.search(/e/i)) > 0 ? (n < 0 && (n = r), n += +i.slice(r + 1), i = i.substring(0, r)) : n < 0 && (n = i.length), r = 0; i.charCodeAt(r) === 48; r++) ;
-  for (s = i.length; i.charCodeAt(s - 1) === 48; --s) ;
-  if (i = i.slice(r, s), i) {
-    if (s -= r, e.e = n = n - r - 1, e.d = [], r = (n + 1) % w, n < 0 && (r += w), r < s) {
-      for (r && e.d.push(+i.slice(0, r)), s -= w; r < s; ) e.d.push(+i.slice(r, r += w));
-      i = i.slice(r), r = w - i.length;
-    } else
-      r -= s;
-    for (; r--; ) i += "0";
-    e.d.push(+i), m && (e.e > e.constructor.maxE ? (e.d = null, e.e = NaN) : e.e < e.constructor.minE && (e.e = 0, e.d = [0]));
-  } else
-    e.e = 0, e.d = [0];
-  return e;
-}
-function _e(e, i) {
-  var n, r, s, t, o, u, c, f, l;
-  if (i.indexOf("_") > -1) {
-    if (i = i.replace(/(\d)_(?=\d)/g, "$1"), Ee.test(i)) return x(e, i);
-  } else if (i === "Infinity" || i === "NaN")
-    return +i || (e.s = NaN), e.e = NaN, e.d = null, e;
-  if (Le.test(i))
-    n = 16, i = i.toLowerCase();
-  else if (Ae.test(i))
-    n = 2;
-  else if (Fe.test(i))
-    n = 8;
-  else
-    throw Error($ + i);
-  for (t = i.search(/p/i), t > 0 ? (c = +i.slice(t + 1), i = i.substring(2, t)) : i = i.slice(2), t = i.indexOf("."), o = t >= 0, r = e.constructor, o && (i = i.replace(".", ""), u = i.length, t = u - t, s = Me(r, new r(n), t, t * 2)), f = z(i, n, R), l = f.length - 1, t = l; f[t] === 0; --t) f.pop();
-  return t < 0 ? new r(e.s * 0) : (e.e = re(f, l), e.d = f, m = !1, o && (e = k(e, s, u * 4)), c && (e = e.times(Math.abs(c) < 54 ? C(2, c) : _.pow(2, c))), m = !0, e);
-}
-function Re(e, i) {
-  var n, r = i.d.length;
-  if (r < 3)
-    return i.isZero() ? i : W(e, 2, i, i);
-  n = 1.4 * Math.sqrt(r), n = n > 16 ? 16 : n | 0, i = i.times(1 / te(5, n)), i = W(e, 2, i, i);
-  for (var s, t = new e(5), o = new e(16), u = new e(20); n--; )
-    s = i.times(i), i = i.times(t.plus(s.times(o.times(s).minus(u))));
-  return i;
-}
-function W(e, i, n, r, s) {
-  var t, o, u, c, f = e.precision, l = Math.ceil(f / w);
-  for (m = !1, c = n.times(n), u = new e(r); ; ) {
-    if (o = k(u.times(c), new e(i++ * i++), f, 1), u = s ? r.plus(o) : r.minus(o), r = k(o.times(c), new e(i++ * i++), f, 1), o = u.plus(r), o.d[l] !== void 0) {
-      for (t = l; o.d[t] === u.d[t] && t--; ) ;
-      if (t == -1) break;
-    }
-    t = u, u = r, r = o, o = t;
-  }
-  return m = !0, o.d.length = l + 1, o;
-}
-function te(e, i) {
-  for (var n = e; --i; ) n *= e;
-  return n;
-}
-function Pe(e, i) {
-  var n, r = i.s < 0, s = T(e, e.precision, 1), t = s.times(0.5);
-  if (i = i.abs(), i.lte(t))
-    return b = r ? 4 : 1, i;
-  if (n = i.divToInt(s), n.isZero())
-    b = r ? 3 : 2;
-  else {
-    if (i = i.minus(n.times(s)), i.lte(t))
-      return b = de(n) ? r ? 2 : 3 : r ? 4 : 1, i;
-    b = de(n) ? r ? 1 : 4 : r ? 3 : 2;
-  }
-  return i.minus(s).abs();
-}
-function he(e, i, n, r) {
-  var s, t, o, u, c, f, l, a, h, g = e.constructor, v = n !== void 0;
-  if (v ? (O(n, 1, V), r === void 0 ? r = g.rounding : O(r, 0, 8)) : (n = g.precision, r = g.rounding), !e.isFinite())
-    l = Ce(e);
-  else {
-    for (l = Z(e), o = l.indexOf("."), v ? (s = 2, i == 16 ? n = n * 4 - 3 : i == 8 && (n = n * 3 - 2)) : s = i, o >= 0 && (l = l.replace(".", ""), h = new g(1), h.e = l.length - o, h.d = z(Z(h), 10, s), h.e = h.d.length), a = z(l, 10, s), t = c = a.length; a[--c] == 0; ) a.pop();
-    if (!a[0])
-      l = v ? "0p+0" : "0";
-    else {
-      if (o < 0 ? t-- : (e = new g(e), e.d = a, e.e = t, e = k(e, h, n, r, 0, s), a = e.d, t = e.e, f = we), o = a[n], u = s / 2, f = f || a[n + 1] !== void 0, f = r < 4 ? (o !== void 0 || f) && (r === 0 || r === (e.s < 0 ? 3 : 2)) : o > u || o === u && (r === 4 || f || r === 6 && a[n - 1] & 1 || r === (e.s < 0 ? 8 : 7)), a.length = n, f)
-        for (; ++a[--n] > s - 1; )
-          a[n] = 0, n || (++t, a.unshift(1));
-      for (c = a.length; !a[c - 1]; --c) ;
-      for (o = 0, l = ""; o < c; o++) l += fe.charAt(a[o]);
-      if (v) {
-        if (c > 1)
-          if (i == 16 || i == 8) {
-            for (o = i == 16 ? 4 : 3, --c; c % o; c++) l += "0";
-            for (a = z(l, s, i), c = a.length; !a[c - 1]; --c) ;
-            for (o = 1, l = "1."; o < c; o++) l += fe.charAt(a[o]);
-          } else
-            l = l.charAt(0) + "." + l.slice(1);
-        l = l + (t < 0 ? "p" : "p+") + t;
-      } else if (t < 0) {
-        for (; ++t; ) l = "0" + l;
-        l = "0." + l;
-      } else if (++t > c) for (t -= c; t--; ) l += "0";
-      else t < c && (l = l.slice(0, t) + "." + l.slice(t));
-    }
-    l = (i == 16 ? "0x" : i == 2 ? "0b" : i == 8 ? "0o" : "") + l;
-  }
-  return e.s < 0 ? "-" + l : l;
-}
-function pe(e, i) {
-  if (e.length > i)
-    return e.length = i, !0;
-}
-function Te(e) {
-  return new this(e).abs();
-}
-function Ze(e) {
-  return new this(e).acos();
-}
-function Ue(e) {
-  return new this(e).acosh();
-}
-function be(e, i) {
-  return new this(e).plus(i);
+	return new this(e).log(2);
 }
-function Be(e) {
-  return new this(e).asin();
-}
-function He(e) {
-  return new this(e).asinh();
-}
-function $e(e) {
-  return new this(e).atan();
-}
-function Ve(e) {
-  return new this(e).atanh();
-}
-function Ge(e, i) {
-  e = new this(e), i = new this(i);
-  var n, r = this.precision, s = this.rounding, t = r + 4;
-  return !e.s || !i.s ? n = new this(NaN) : !e.d && !i.d ? (n = T(this, t, 1).times(i.s > 0 ? 0.25 : 0.75), n.s = e.s) : !i.d || e.isZero() ? (n = i.s < 0 ? T(this, r, s) : new this(0), n.s = e.s) : !e.d || i.isZero() ? (n = T(this, t, 1).times(0.5), n.s = e.s) : i.s < 0 ? (this.precision = t, this.rounding = 1, n = this.atan(k(e, i, t, 1)), i = T(this, t, 1), this.precision = r, this.rounding = s, n = e.s < 0 ? n.minus(i) : n.plus(i)) : n = this.atan(k(e, i, t, 1)), n;
-}
-function We(e) {
-  return new this(e).cbrt();
-}
-function Xe(e) {
-  return p(e = new this(e), e.e + 1, 2);
-}
-function Je(e, i, n) {
-  return new this(e).clamp(i, n);
-}
-function Ke(e) {
-  if (!e || typeof e != "object")
-    throw Error(ne + "Object expected");
-  var i, n, r, s = e.defaults === !0, t = [
-    "precision",
-    1,
-    V,
-    "rounding",
-    0,
-    8,
-    "toExpNeg",
-    -G,
-    0,
-    "toExpPos",
-    0,
-    G,
-    "maxE",
-    0,
-    G,
-    "minE",
-    -G,
-    0,
-    "modulo",
-    0,
-    9
-  ];
-  for (i = 0; i < t.length; i += 3)
-    if (n = t[i], s && (this[n] = ce[n]), (r = e[n]) !== void 0)
-      if (L(r) === r && r >= t[i + 1] && r <= t[i + 2]) this[n] = r;
-      else throw Error($ + n + ": " + r);
-  if (n = "crypto", s && (this[n] = ce[n]), (r = e[n]) !== void 0)
-    if (r === !0 || r === !1 || r === 0 || r === 1)
-      if (r)
-        if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes))
-          this[n] = !0;
-        else
-          throw Error(Ne);
-      else
-        this[n] = !1;
-    else
-      throw Error($ + n + ": " + r);
-  return this;
-}
-function Qe(e) {
-  return new this(e).cos();
-}
-function Ye(e) {
-  return new this(e).cosh();
-}
-function Se(e) {
-  var i, n, r;
-  function s(t) {
-    var o, u, c, f = this;
-    if (!(f instanceof s)) return new s(t);
-    if (f.constructor = s, ge(t)) {
-      f.s = t.s, m ? !t.d || t.e > s.maxE ? (f.e = NaN, f.d = null) : t.e < s.minE ? (f.e = 0, f.d = [0]) : (f.e = t.e, f.d = t.d.slice()) : (f.e = t.e, f.d = t.d ? t.d.slice() : t.d);
-      return;
-    }
-    if (c = typeof t, c === "number") {
-      if (t === 0) {
-        f.s = 1 / t < 0 ? -1 : 1, f.e = 0, f.d = [0];
-        return;
-      }
-      if (t < 0 ? (t = -t, f.s = -1) : f.s = 1, t === ~~t && t < 1e7) {
-        for (o = 0, u = t; u >= 10; u /= 10) o++;
-        m ? o > s.maxE ? (f.e = NaN, f.d = null) : o < s.minE ? (f.e = 0, f.d = [0]) : (f.e = o, f.d = [t]) : (f.e = o, f.d = [t]);
-        return;
-      }
-      if (t * 0 !== 0) {
-        t || (f.s = NaN), f.e = NaN, f.d = null;
-        return;
-      }
-      return x(f, t.toString());
-    }
-    if (c === "string")
-      return (u = t.charCodeAt(0)) === 45 ? (t = t.slice(1), f.s = -1) : (u === 43 && (t = t.slice(1)), f.s = 1), Ee.test(t) ? x(f, t) : _e(f, t);
-    if (c === "bigint")
-      return t < 0 ? (t = -t, f.s = -1) : f.s = 1, x(f, t.toString());
-    throw Error($ + t);
-  }
-  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 = Ke, s.clone = Se, s.isDecimal = ge, s.abs = Te, s.acos = Ze, s.acosh = Ue, s.add = be, s.asin = Be, s.asinh = He, s.atan = $e, s.atanh = Ve, s.atan2 = Ge, s.cbrt = We, s.ceil = Xe, s.clamp = Je, s.cos = Qe, s.cosh = Ye, s.div = je, s.exp = ze, s.floor = xe, s.hypot = ye, s.ln = ei, s.log = ii, s.log10 = ri, s.log2 = ni, s.max = ti, s.min = si, s.mod = oi, s.mul = ui, s.pow = fi, s.random = ci, s.round = li, s.sign = ai, s.sin = hi, s.sinh = di, s.sqrt = pi, s.sub = gi, s.sum = wi, s.tan = mi, s.tanh = Ni, s.trunc = vi, e === void 0 && (e = {}), e && e.defaults !== !0)
-    for (r = [
-      "precision",
-      "rounding",
-      "toExpNeg",
-      "toExpPos",
-      "maxE",
-      "minE",
-      "modulo",
-      "crypto"
-    ], i = 0; i < r.length; )
-      Object.prototype.hasOwnProperty.call(e, n = r[i++]) || (e[n] = this[n]);
-  return s.config(e), s;
-}
-function je(e, i) {
-  return new this(e).div(i);
+function we(e) {
+	return new this(e).log(10);
+}
+function Te() {
+	return H(this, arguments, -1);
+}
+function Ee() {
+	return H(this, arguments, 1);
+}
+function De(e, t) {
+	return new this(e).mod(t);
+}
+function Oe(e, t) {
+	return new this(e).mul(t);
+}
+function ke(e, t) {
+	return new this(e).pow(t);
+}
+function Ae(e) {
+	var n, r, i, a, o = 0, s = new this(1), c = [];
+	if (e === void 0 ? e = this.precision : O(e, 1, t), i = Math.ceil(e / S), !this.crypto) for (; o < i;) c[o++] = Math.random() * 1e7 | 0;
+	else if (crypto.getRandomValues) for (n = crypto.getRandomValues(new Uint32Array(i)); o < i;) a = n[o], a >= 429e7 ? n[o] = crypto.getRandomValues(new Uint32Array(1))[0] : c[o++] = a % 1e7;
+	else if (crypto.randomBytes) {
+		for (n = crypto.randomBytes(i *= 4); o < i;) a = n[o] + (n[o + 1] << 8) + (n[o + 2] << 16) + ((n[o + 3] & 127) << 24), a >= 214e7 ? crypto.randomBytes(4).copy(n, o) : (c.push(a % 1e7), o += 4);
+		o = i / 4;
+	} else throw Error(p);
+	for (i = c[--o], e %= S, i && e && (a = g(10, S - e), c[o] = (i / a | 0) * a); c[o] === 0; o--) c.pop();
+	if (o < 0) r = 0, c = [0];
+	else {
+		for (r = -1; c[0] === 0; r -= S) c.shift();
+		for (i = 1, a = c[0]; a >= 10; a /= 10) i++;
+		i < S && (r -= S - i);
+	}
+	return s.e = r, s.d = c, s;
+}
+function je(e) {
+	return N(e = new this(e), e.e + 1, this.rounding);
+}
+function Me(e) {
+	return e = new this(e), e.d ? e.d[0] ? e.s : 0 * e.s : e.s || NaN;
+}
+function Ne(e) {
+	return new this(e).sin();
+}
+function Pe(e) {
+	return new this(e).sinh();
+}
+function Fe(e) {
+	return new this(e).sqrt();
+}
+function Ie(e, t) {
+	return new this(e).sub(t);
+}
+function Le() {
+	var e = 0, t = arguments, n = new this(t[e]);
+	for (l = !1; n.s && ++e < t.length;) n = n.plus(t[e]);
+	return l = !0, N(n, this.precision, this.rounding);
+}
+function Re(e) {
+	return new this(e).tan();
 }
 function ze(e) {
-  return new this(e).exp();
+	return new this(e).tanh();
 }
-function xe(e) {
-  return p(e = new this(e), e.e + 1, 3);
-}
-function ye() {
-  var e, i, n = new this(0);
-  for (m = !1, e = 0; e < arguments.length; )
-    if (i = new this(arguments[e++]), i.d)
-      n.d && (n = n.plus(i.times(i)));
-    else {
-      if (i.s)
-        return m = !0, new this(1 / 0);
-      n = i;
-    }
-  return m = !0, n.sqrt();
+function Be(e) {
+	return N(e = new this(e), e.e + 1, 1);
 }
-function ge(e) {
-  return e instanceof _ || e && e.toStringTag === ve || !1;
-}
-function ei(e) {
-  return new this(e).ln();
-}
-function ii(e, i) {
-  return new this(e).log(i);
-}
-function ni(e) {
-  return new this(e).log(2);
-}
-function ri(e) {
-  return new this(e).log(10);
-}
-function ti() {
-  return qe(this, arguments, -1);
-}
-function si() {
-  return qe(this, arguments, 1);
-}
-function oi(e, i) {
-  return new this(e).mod(i);
-}
-function ui(e, i) {
-  return new this(e).mul(i);
-}
-function fi(e, i) {
-  return new this(e).pow(i);
-}
-function ci(e) {
-  var i, n, r, s, t = 0, o = new this(1), u = [];
-  if (e === void 0 ? e = this.precision : O(e, 1, V), r = Math.ceil(e / w), this.crypto)
-    if (crypto.getRandomValues)
-      for (i = crypto.getRandomValues(new Uint32Array(r)); t < r; )
-        s = i[t], s >= 429e7 ? i[t] = crypto.getRandomValues(new Uint32Array(1))[0] : u[t++] = s % 1e7;
-    else if (crypto.randomBytes) {
-      for (i = crypto.randomBytes(r *= 4); t < r; )
-        s = i[t] + (i[t + 1] << 8) + (i[t + 2] << 16) + ((i[t + 3] & 127) << 24), s >= 214e7 ? crypto.randomBytes(4).copy(i, t) : (u.push(s % 1e7), t += 4);
-      t = r / 4;
-    } else
-      throw Error(Ne);
-  else for (; t < r; ) u[t++] = Math.random() * 1e7 | 0;
-  for (r = u[--t], e %= w, r && e && (s = C(10, w - e), u[t] = (r / s | 0) * s); u[t] === 0; t--) u.pop();
-  if (t < 0)
-    n = 0, u = [0];
-  else {
-    for (n = -1; u[0] === 0; n -= w) u.shift();
-    for (r = 1, s = u[0]; s >= 10; s /= 10) r++;
-    r < w && (n -= w - r);
-  }
-  return o.e = n, o.d = u, o;
-}
-function li(e) {
-  return p(e = new this(e), e.e + 1, this.rounding);
-}
-function ai(e) {
-  return e = new this(e), e.d ? e.d[0] ? e.s : 0 * e.s : e.s || NaN;
-}
-function hi(e) {
-  return new this(e).sin();
-}
-function di(e) {
-  return new this(e).sinh();
-}
-function pi(e) {
-  return new this(e).sqrt();
-}
-function gi(e, i) {
-  return new this(e).sub(i);
-}
-function wi() {
-  var e = 0, i = arguments, n = new this(i[e]);
-  for (m = !1; n.s && ++e < i.length; ) n = n.plus(i[e]);
-  return m = !0, p(n, this.precision, this.rounding);
-}
-function mi(e) {
-  return new this(e).tan();
-}
-function Ni(e) {
-  return new this(e).tanh();
-}
-function vi(e) {
-  return p(e = new this(e), e.e + 1, 1);
-}
-_ = Se(ce);
-_.prototype.constructor = _;
-_.default = _.Decimal = _;
-y = new _(y);
-ee = new _(ee);
-const Ei = _;
-export {
-  _ as Decimal,
-  Ei as default
-};
+o = Q(a), o.prototype.constructor = o, o.default = o.Decimal = o, r = new o(r), i = new o(i);
+var Ve = o;
+//#endregion
+export { o as Decimal, Ve as default };
+/* 独立思考，明辨是非 */