!function(e) {
"use strict";
var r, n = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i, t = Math.ceil, i = Math.floor, o = "[BigNumber Error] ", u = o + "Number primitive has more than 15 significant digits: ", f = 1e14, s = 14, c = 9007199254740991, l = [ 1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13 ], a = 1e7, g = 1e9;
function bitFloor(e) {
var r = 0 | e;
return e > 0 || e === r ? r : r - 1;
}
function coeffToString(e) {
for (var r, n, t = 1, i = e.length, o = e[0] + ""; t < i; ) {
for (r = e[t++] + "", n = s - r.length; n--; r = "0" + r) ;
o += r;
}
for (i = o.length; 48 === o.charCodeAt(--i); ) ;
return o.slice(0, i + 1 || 1);
}
function compare(e, r) {
var n, t, i = e.c, o = r.c, u = e.s, f = r.s, s = e.e, c = r.e;
if (!u || !f) return null;
if (n = i && !i[0], t = o && !o[0], n || t) return n ? t ? 0 : -f : u;
if (u != f) return u;
if (n = u < 0, t = s == c, !i || !o) return t ? 0 : !i ^ n ? 1 : -1;
if (!t) return s > c ^ n ? 1 : -1;
for (f = (s = i.length) < (c = o.length) ? s : c, u = 0; u < f; u++) if (i[u] != o[u]) return i[u] > o[u] ^ n ? 1 : -1;
return s == c ? 0 : s > c ^ n ? 1 : -1;
}
function intCheck(e, r, n, u) {
if (e < r || e > n || e !== (e < 0 ? t(e) : i(e))) throw Error(o + (u || "Argument") + ("number" == typeof e ? e < r || e > n ? " out of range: " : " not an integer: " : " not a primitive number: ") + String(e));
}
function isOdd(e) {
var r = e.c.length - 1;
return bitFloor(e.e / s) == r && e.c[r] % 2 != 0;
}
function toExponential(e, r) {
return (e.length > 1 ? e.charAt(0) + "." + e.slice(1) : e) + (r < 0 ? "e" : "e+") + r;
}
function toFixedPoint(e, r, n) {
var t, i;
if (r < 0) {
for (i = n + "."; ++r; i += n) ;
e = i + e;
} else if (++r > (t = e.length)) {
for (i = n, r -= t; --r; i += n) ;
e += i;
} else r < t && (e = e.slice(0, r) + "." + e.slice(r));
return e;
}
(r = function clone(e) {
var r, m, h, b, p, N, d, B, w, O = BigNumber.prototype = {
constructor: BigNumber,
toString: null,
valueOf: null
}, v = new BigNumber(1), y = 20, E = 4, C = -7, x = 21, A = -1e7, S = 1e7, k = !1, F = 1, P = 0, T = {
prefix: "",
groupSize: 3,
secondaryGroupSize: 0,
groupSeparator: ",",
decimalSeparator: ".",
fractionGroupSize: 0,
fractionGroupSeparator: "Â ",
suffix: ""
}, R = "0123456789abcdefghijklmnopqrstuvwxyz";
function BigNumber(e, r) {
var t, o, f, l, a, g, b, p, N = this;
if (!(N instanceof BigNumber)) return new BigNumber(e, r);
if (null == r) {
if (e instanceof BigNumber) return N.s = e.s, N.e = e.e, void (N.c = (e = e.c) ? e.slice() : e);
if ((g = "number" == typeof e) && 0 * e == 0) {
if (N.s = 1 / e < 0 ? (e = -e, -1) : 1, e === ~~e) {
for (l = 0, a = e; a >= 10; a /= 10, l++) ;
return N.e = l, void (N.c = [ e ]);
}
p = String(e);
} else {
if (p = String(e), !n.test(p)) return h(N, p, g);
N.s = 45 == p.charCodeAt(0) ? (p = p.slice(1), -1) : 1;
}
(l = p.indexOf(".")) > -1 && (p = p.replace(".", "")), (a = p.search(/e/i)) > 0 ? (l < 0 && (l = a),
l += +p.slice(a + 1), p = p.substring(0, a)) : l < 0 && (l = p.length);
} else {
if (intCheck(r, 2, R.length, "Base"), p = String(e), 10 == r) return round(N = new BigNumber(e instanceof BigNumber ? e : p), y + N.e + 1, E);
if (g = "number" == typeof e) {
if (0 * e != 0) return h(N, p, g, r);
if (N.s = 1 / e < 0 ? (p = p.slice(1), -1) : 1, BigNumber.DEBUG && p.replace(/^0\.0*|\./, "").length > 15) throw Error(u + e);
g = !1;
} else N.s = 45 === p.charCodeAt(0) ? (p = p.slice(1), -1) : 1;
for (t = R.slice(0, r), l = a = 0, b = p.length; a < b; a++) if (t.indexOf(o = p.charAt(a)) < 0) {
if ("." == o) {
if (a > l) {
l = b;
continue;
}
} else if (!f && (p == p.toUpperCase() && (p = p.toLowerCase()) || p == p.toLowerCase() && (p = p.toUpperCase()))) {
f = !0, a = -1, l = 0;
continue;
}
return h(N, String(e), g, r);
}
(l = (p = m(p, r, 10, N.s)).indexOf(".")) > -1 ? p = p.replace(".", "") : l = p.length;
}
for (a = 0; 48 === p.charCodeAt(a); a++) ;
for (b = p.length; 48 === p.charCodeAt(--b); ) ;
if (p = p.slice(a, ++b)) {
if (b -= a, g && BigNumber.DEBUG && b > 15 && (e > c || e !== i(e))) throw Error(u + N.s * e);
if ((l = l - a - 1) > S) N.c = N.e = null; else if (l < A) N.c = [ N.e = 0 ]; else {
if (N.e = l, N.c = [], a = (l + 1) % s, l < 0 && (a += s), a < b) {
for (a && N.c.push(+p.slice(0, a)), b -= s; a < b; ) N.c.push(+p.slice(a, a += s));
p = p.slice(a), a = s - p.length;
} else a -= b;
for (;a--; p += "0") ;
N.c.push(+p);
}
} else N.c = [ N.e = 0 ];
}
function format(e, r, n, t) {
var i, o, u, f, s;
if (null == n ? n = E : intCheck(n, 0, 8), !e.c) return e.toString();
if (i = e.c[0], u = e.e, null == r) s = coeffToString(e.c), s = 1 == t || 2 == t && u <= C ? toExponential(s, u) : toFixedPoint(s, u, "0"); else if (o = (e = round(new BigNumber(e), r, n)).e,
f = (s = coeffToString(e.c)).length, 1 == t || 2 == t && (r <= o || o <= C)) {
for (;f < r; s += "0", f++) ;
s = toExponential(s, o);
} else if (r -= u, s = toFixedPoint(s, o, "0"), o + 1 > f) {
if (--r > 0) for (s += "."; r--; s += "0") ;
} else if ((r += o - f) > 0) for (o + 1 == f && (s += "."); r--; s += "0") ;
return e.s < 0 && i ? "-" + s : s;
}
function maxOrMin(e, r) {
for (var n, t = 1, i = new BigNumber(e[0]); t < e.length; t++) {
if (!(n = new BigNumber(e[t])).s) {
i = n;
break;
}
r.call(i, n) && (i = n);
}
return i;
}
function normalise(e, r, n) {
for (var t = 1, i = r.length; !r[--i]; r.pop()) ;
for (i = r[0]; i >= 10; i /= 10, t++) ;
return (n = t + n * s - 1) > S ? e.c = e.e = null : n < A ? e.c = [ e.e = 0 ] : (e.e = n,
e.c = r), e;
}
function round(e, r, n, o) {
var u, c, a, g, m, h, b, p = e.c, N = l;
if (p) {
e: {
for (u = 1, g = p[0]; g >= 10; g /= 10, u++) ;
if ((c = r - u) < 0) c += s, a = r, b = (m = p[h = 0]) / N[u - a - 1] % 10 | 0; else if ((h = t((c + 1) / s)) >= p.length) {
if (!o) break e;
for (;p.length <= h; p.push(0)) ;
m = b = 0, u = 1, a = (c %= s) - s + 1;
} else {
for (m = g = p[h], u = 1; g >= 10; g /= 10, u++) ;
b = (a = (c %= s) - s + u) < 0 ? 0 : m / N[u - a - 1] % 10 | 0;
}
if (o = o || r < 0 || null != p[h + 1] || (a < 0 ? m : m % N[u - a - 1]), o = n < 4 ? (b || o) && (0 == n || n == (e.s < 0 ? 3 : 2)) : b > 5 || 5 == b && (4 == n || o || 6 == n && (c > 0 ? a > 0 ? m / N[u - a] : 0 : p[h - 1]) % 10 & 1 || n == (e.s < 0 ? 8 : 7)),
r < 1 || !p[0]) return p.length = 0, o ? (r -= e.e + 1, p[0] = N[(s - r % s) % s],
e.e = -r || 0) : p[0] = e.e = 0, e;
if (0 == c ? (p.length = h, g = 1, h--) : (p.length = h + 1, g = N[s - c], p[h] = a > 0 ? i(m / N[u - a] % N[a]) * g : 0),
o) for (;;) {
if (0 == h) {
for (c = 1, a = p[0]; a >= 10; a /= 10, c++) ;
for (a = p[0] += g, g = 1; a >= 10; a /= 10, g++) ;
c != g && (e.e++, p[0] == f && (p[0] = 1));
break;
}
if (p[h] += g, p[h] != f) break;
p[h--] = 0, g = 1;
}
for (c = p.length; 0 === p[--c]; p.pop()) ;
}
e.e > S ? e.c = e.e = null : e.e < A && (e.c = [ e.e = 0 ]);
}
return e;
}
function valueOf(e) {
var r, n = e.e;
return null === n ? e.toString() : (r = coeffToString(e.c), r = n <= C || n >= x ? toExponential(r, n) : toFixedPoint(r, n, "0"),
e.s < 0 ? "-" + r : r);
}
return BigNumber.clone = clone, BigNumber.ROUND_UP = 0, BigNumber.ROUND_DOWN = 1,
BigNumber.ROUND_CEIL = 2, BigNumber.ROUND_FLOOR = 3, BigNumber.ROUND_HALF_UP = 4,
BigNumber.ROUND_HALF_DOWN = 5, BigNumber.ROUND_HALF_EVEN = 6, BigNumber.ROUND_HALF_CEIL = 7,
BigNumber.ROUND_HALF_FLOOR = 8, BigNumber.EUCLID = 9, BigNumber.config = BigNumber.set = function(e) {
var r, n;
if (null != e) {
if ("object" != typeof e) throw Error(o + "Object expected: " + e);
if (e.hasOwnProperty(r = "DECIMAL_PLACES") && (intCheck(n = e[r], 0, g, r), y = n),
e.hasOwnProperty(r = "ROUNDING_MODE") && (intCheck(n = e[r], 0, 8, r), E = n), e.hasOwnProperty(r = "EXPONENTIAL_AT") && ((n = e[r]) && n.pop ? (intCheck(n[0], -g, 0, r),
intCheck(n[1], 0, g, r), C = n[0], x = n[1]) : (intCheck(n, -g, g, r), C = -(x = n < 0 ? -n : n))),
e.hasOwnProperty(r = "RANGE")) if ((n = e[r]) && n.pop) intCheck(n[0], -g, -1, r),
intCheck(n[1], 1, g, r), A = n[0], S = n[1]; else {
if (intCheck(n, -g, g, r), !n) throw Error(o + r + " cannot be zero: " + n);
A = -(S = n < 0 ? -n : n);
}
if (e.hasOwnProperty(r = "CRYPTO")) {
if ((n = e[r]) !== !!n) throw Error(o + r + " not true or false: " + n);
if (n) {
if ("undefined" == typeof crypto || !crypto || !crypto.getRandomValues && !crypto.randomBytes) throw k = !n,
Error(o + "crypto unavailable");
k = n;
} else k = n;
}
if (e.hasOwnProperty(r = "MODULO_MODE") && (intCheck(n = e[r], 0, 9, r), F = n),
e.hasOwnProperty(r = "POW_PRECISION") && (intCheck(n = e[r], 0, g, r), P = n), e.hasOwnProperty(r = "FORMAT")) {
if ("object" != typeof (n = e[r])) throw Error(o + r + " not an object: " + n);
T = n;
}
if (e.hasOwnProperty(r = "ALPHABET")) {
if ("string" != typeof (n = e[r]) || /^.$|[+-.\s]|(.).*\1/.test(n)) throw Error(o + r + " invalid: " + n);
R = n;
}
}
return {
DECIMAL_PLACES: y,
ROUNDING_MODE: E,
EXPONENTIAL_AT: [ C, x ],
RANGE: [ A, S ],
CRYPTO: k,
MODULO_MODE: F,
POW_PRECISION: P,
FORMAT: T,
ALPHABET: R
};
}, BigNumber.isBigNumber = function(e) {
return e instanceof BigNumber || e && !0 === e._isBigNumber || !1;
}, BigNumber.maximum = BigNumber.max = function() {
return maxOrMin(arguments, O.lt);
}, BigNumber.minimum = BigNumber.min = function() {
return maxOrMin(arguments, O.gt);
}, BigNumber.random = (b = 9007199254740992 * Math.random() & 2097151 ? function() {
return i(9007199254740992 * Math.random());
} : function() {
return 8388608 * (1073741824 * Math.random() | 0) + (8388608 * Math.random() | 0);
}, function(e) {
var r, n, u, f, c, a = 0, m = [], h = new BigNumber(v);
if (null == e ? e = y : intCheck(e, 0, g), f = t(e / s), k) if (crypto.getRandomValues) {
for (r = crypto.getRandomValues(new Uint32Array(f *= 2)); a < f; ) (c = 131072 * r[a] + (r[a + 1] >>> 11)) >= 9e15 ? (n = crypto.getRandomValues(new Uint32Array(2)),
r[a] = n[0], r[a + 1] = n[1]) : (m.push(c % 1e14), a += 2);
a = f / 2;
} else {
if (!crypto.randomBytes) throw k = !1, Error(o + "crypto unavailable");
for (r = crypto.randomBytes(f *= 7); a < f; ) (c = 281474976710656 * (31 & r[a]) + 1099511627776 * r[a + 1] + 4294967296 * r[a + 2] + 16777216 * r[a + 3] + (r[a + 4] << 16) + (r[a + 5] << 8) + r[a + 6]) >= 9e15 ? crypto.randomBytes(7).copy(r, a) : (m.push(c % 1e14),
a += 7);
a = f / 7;
}
if (!k) for (;a < f; ) (c = b()) < 9e15 && (m[a++] = c % 1e14);
for (f = m[--a], e %= s, f && e && (c = l[s - e], m[a] = i(f / c) * c); 0 === m[a]; m.pop(),
a--) ;
if (a < 0) m = [ u = 0 ]; else {
for (u = -1; 0 === m[0]; m.splice(0, 1), u -= s) ;
for (a = 1, c = m[0]; c >= 10; c /= 10, a++) ;
a < s && (u -= s - a);
}
return h.e = u, h.c = m, h;
}), BigNumber.sum = function() {
for (var e = 1, r = arguments, n = new BigNumber(r[0]); e < r.length; ) n = n.plus(r[e++]);
return n;
}, m = function() {
function toBaseOut(e, r, n, t) {
for (var i, o, u = [ 0 ], f = 0, s = e.length; f < s; ) {
for (o = u.length; o--; u[o] *= r) ;
for (u[0] += t.indexOf(e.charAt(f++)), i = 0; i < u.length; i++) u[i] > n - 1 && (null == u[i + 1] && (u[i + 1] = 0),
u[i + 1] += u[i] / n | 0, u[i] %= n);
}
return u.reverse();
}
return function(e, n, t, i, o) {
var u, f, s, c, l, a, g, m, h = e.indexOf("."), b = y, p = E;
for (h >= 0 && (c = P, P = 0, e = e.replace(".", ""), a = (m = new BigNumber(n)).pow(e.length - h),
P = c, m.c = toBaseOut(toFixedPoint(coeffToString(a.c), a.e, "0"), 10, t, "0123456789"),
m.e = m.c.length), s = c = (g = toBaseOut(e, n, t, o ? (u = R, "0123456789") : (u = "0123456789",
R))).length; 0 == g[--c]; g.pop()) ;
if (!g[0]) return u.charAt(0);
if (h < 0 ? --s : (a.c = g, a.e = s, a.s = i, g = (a = r(a, m, b, p, t)).c, l = a.r,
s = a.e), h = g[f = s + b + 1], c = t / 2, l = l || f < 0 || null != g[f + 1], l = p < 4 ? (null != h || l) && (0 == p || p == (a.s < 0 ? 3 : 2)) : h > c || h == c && (4 == p || l || 6 == p && 1 & g[f - 1] || p == (a.s < 0 ? 8 : 7)),
f < 1 || !g[0]) e = l ? toFixedPoint(u.charAt(1), -b, u.charAt(0)) : u.charAt(0); else {
if (g.length = f, l) for (--t; ++g[--f] > t; ) g[f] = 0, f || (++s, g = [ 1 ].concat(g));
for (c = g.length; !g[--c]; ) ;
for (h = 0, e = ""; h <= c; e += u.charAt(g[h++])) ;
e = toFixedPoint(e, s, u.charAt(0));
}
return e;
};
}(), r = function() {
function multiply(e, r, n) {
var t, i, o, u, f = 0, s = e.length, c = r % a, l = r / a | 0;
for (e = e.slice(); s--; ) f = ((i = c * (o = e[s] % a) + (t = l * o + (u = e[s] / a | 0) * c) % a * a + f) / n | 0) + (t / a | 0) + l * u,
e[s] = i % n;
return f && (e = [ f ].concat(e)), e;
}
function compare(e, r, n, t) {
var i, o;
if (n != t) o = n > t ? 1 : -1; else for (i = o = 0; i < n; i++) if (e[i] != r[i]) {
o = e[i] > r[i] ? 1 : -1;
break;
}
return o;
}
function subtract(e, r, n, t) {
for (var i = 0; n--; ) e[n] -= i, i = e[n] < r[n] ? 1 : 0, e[n] = i * t + e[n] - r[n];
for (;!e[0] && e.length > 1; e.splice(0, 1)) ;
}
return function(e, r, n, t, o) {
var u, c, l, a, g, m, h, b, p, N, d, B, w, O, v, y, E, C = e.s == r.s ? 1 : -1, x = e.c, A = r.c;
if (!(x && x[0] && A && A[0])) return new BigNumber(e.s && r.s && (x ? !A || x[0] != A[0] : A) ? x && 0 == x[0] || !A ? 0 * C : C / 0 : NaN);
for (p = (b = new BigNumber(C)).c = [], C = n + (c = e.e - r.e) + 1, o || (o = f,
c = bitFloor(e.e / s) - bitFloor(r.e / s), C = C / s | 0), l = 0; A[l] == (x[l] || 0); l++) ;
if (A[l] > (x[l] || 0) && c--, C < 0) p.push(1), a = !0; else {
for (O = x.length, y = A.length, l = 0, C += 2, (g = i(o / (A[0] + 1))) > 1 && (A = multiply(A, g, o),
x = multiply(x, g, o), y = A.length, O = x.length), w = y, d = (N = x.slice(0, y)).length; d < y; N[d++] = 0) ;
E = A.slice(), E = [ 0 ].concat(E), v = A[0], A[1] >= o / 2 && v++;
do {
if (g = 0, (u = compare(A, N, y, d)) < 0) {
if (B = N[0], y != d && (B = B * o + (N[1] || 0)), (g = i(B / v)) > 1) for (g >= o && (g = o - 1),
h = (m = multiply(A, g, o)).length, d = N.length; 1 == compare(m, N, h, d); ) g--,
subtract(m, y < h ? E : A, h, o), h = m.length, u = 1; else 0 == g && (u = g = 1),
h = (m = A.slice()).length;
if (h < d && (m = [ 0 ].concat(m)), subtract(N, m, d, o), d = N.length, -1 == u) for (;compare(A, N, y, d) < 1; ) g++,
subtract(N, y < d ? E : A, d, o), d = N.length;
} else 0 === u && (g++, N = [ 0 ]);
p[l++] = g, N[0] ? N[d++] = x[w] || 0 : (N = [ x[w] ], d = 1);
} while ((w++ < O || null != N[0]) && C--);
a = null != N[0], p[0] || p.splice(0, 1);
}
if (o == f) {
for (l = 1, C = p[0]; C >= 10; C /= 10, l++) ;
round(b, n + (b.e = l + c * s - 1) + 1, t, a);
} else b.e = c, b.r = +a;
return b;
};
}(), p = /^(-?)0([xbo])(?=\w[\w.]*$)/i, N = /^([^.]+)\.$/, d = /^\.([^.]+)$/, B = /^-?(Infinity|NaN)$/,
w = /^\s*\+(?=[\w.])|^\s+|\s+$/g, h = function(e, r, n, t) {
var i, u = n ? r : r.replace(w, "");
if (B.test(u)) e.s = isNaN(u) ? null : u < 0 ? -1 : 1, e.c = e.e = null; else {
if (!n && (u = u.replace(p, function(e, r, n) {
return i = "x" == (n = n.toLowerCase()) ? 16 : "b" == n ? 2 : 8, t && t != i ? e : r;
}), t && (i = t, u = u.replace(N, "$1").replace(d, "0.$1")), r != u)) return new BigNumber(u, i);
if (BigNumber.DEBUG) throw Error(o + "Not a" + (t ? " base " + t : "") + " number: " + r);
e.c = e.e = e.s = null;
}
}, O.absoluteValue = O.abs = function() {
var e = new BigNumber(this);
return e.s < 0 && (e.s = 1), e;
}, O.comparedTo = function(e, r) {
return compare(this, new BigNumber(e, r));
}, O.decimalPlaces = O.dp = function(e, r) {
var n, t, i, o = this;
if (null != e) return intCheck(e, 0, g), null == r ? r = E : intCheck(r, 0, 8),
round(new BigNumber(o), e + o.e + 1, r);
if (!(n = o.c)) return null;
if (t = ((i = n.length - 1) - bitFloor(this.e / s)) * s, i = n[i]) for (;i % 10 == 0; i /= 10,
t--) ;
return t < 0 && (t = 0), t;
}, O.dividedBy = O.div = function(e, n) {
return r(this, new BigNumber(e, n), y, E);
}, O.dividedToIntegerBy = O.idiv = function(e, n) {
return r(this, new BigNumber(e, n), 0, 1);
}, O.exponentiatedBy = O.pow = function(e, r) {
var n, u, f, c, l, a, g, m, h = this;
if ((e = new BigNumber(e)).c && !e.isInteger()) throw Error(o + "Exponent not an integer: " + valueOf(e));
if (null != r && (r = new BigNumber(r)), l = e.e > 14, !h.c || !h.c[0] || 1 == h.c[0] && !h.e && 1 == h.c.length || !e.c || !e.c[0]) return m = new BigNumber(Math.pow(+valueOf(h), l ? 2 - isOdd(e) : +valueOf(e))),
r ? m.mod(r) : m;
if (a = e.s < 0, r) {
if (r.c ? !r.c[0] : !r.s) return new BigNumber(NaN);
(u = !a && h.isInteger() && r.isInteger()) && (h = h.mod(r));
} else {
if (e.e > 9 && (h.e > 0 || h.e < -1 || (0 == h.e ? h.c[0] > 1 || l && h.c[1] >= 24e7 : h.c[0] < 8e13 || l && h.c[0] <= 9999975e7))) return c = h.s < 0 && isOdd(e) ? -0 : 0,
h.e > -1 && (c = 1 / c), new BigNumber(a ? 1 / c : c);
P && (c = t(P / s + 2));
}
for (l ? (n = new BigNumber(.5), a && (e.s = 1), g = isOdd(e)) : g = (f = Math.abs(+valueOf(e))) % 2,
m = new BigNumber(v); ;) {
if (g) {
if (!(m = m.times(h)).c) break;
c ? m.c.length > c && (m.c.length = c) : u && (m = m.mod(r));
}
if (f) {
if (0 === (f = i(f / 2))) break;
g = f % 2;
} else if (round(e = e.times(n), e.e + 1, 1), e.e > 14) g = isOdd(e); else {
if (0 == (f = +valueOf(e))) break;
g = f % 2;
}
h = h.times(h), c ? h.c && h.c.length > c && (h.c.length = c) : u && (h = h.mod(r));
}
return u ? m : (a && (m = v.div(m)), r ? m.mod(r) : c ? round(m, P, E, void 0) : m);
}, O.integerValue = function(e) {
var r = new BigNumber(this);
return null == e ? e = E : intCheck(e, 0, 8), round(r, r.e + 1, e);
}, O.isEqualTo = O.eq = function(e, r) {
return 0 === compare(this, new BigNumber(e, r));
}, O.isFinite = function() {
return !!this.c;
}, O.isGreaterThan = O.gt = function(e, r) {
return compare(this, new BigNumber(e, r)) > 0;
}, O.isGreaterThanOrEqualTo = O.gte = function(e, r) {
return 1 === (r = compare(this, new BigNumber(e, r))) || 0 === r;
}, O.isInteger = function() {
return !!this.c && bitFloor(this.e / s) > this.c.length - 2;
}, O.isLessThan = O.lt = function(e, r) {
return compare(this, new BigNumber(e, r)) < 0;
}, O.isLessThanOrEqualTo = O.lte = function(e, r) {
return -1 === (r = compare(this, new BigNumber(e, r))) || 0 === r;
}, O.isNaN = function() {
return !this.s;
}, O.isNegative = function() {
return this.s < 0;
}, O.isPositive = function() {
return this.s > 0;
}, O.isZero = function() {
return !!this.c && 0 == this.c[0];
}, O.minus = function(e, r) {
var n, t, i, o, u = this, c = u.s;
if (r = (e = new BigNumber(e, r)).s, !c || !r) return new BigNumber(NaN);
if (c != r) return e.s = -r, u.plus(e);
var l = u.e / s, a = e.e / s, g = u.c, m = e.c;
if (!l || !a) {
if (!g || !m) return g ? (e.s = -r, e) : new BigNumber(m ? u : NaN);
if (!g[0] || !m[0]) return m[0] ? (e.s = -r, e) : new BigNumber(g[0] ? u : 3 == E ? -0 : 0);
}
if (l = bitFloor(l), a = bitFloor(a), g = g.slice(), c = l - a) {
for ((o = c < 0) ? (c = -c, i = g) : (a = l, i = m), i.reverse(), r = c; r--; i.push(0)) ;
i.reverse();
} else for (t = (o = (c = g.length) < (r = m.length)) ? c : r, c = r = 0; r < t; r++) if (g[r] != m[r]) {
o = g[r] < m[r];
break;
}
if (o && (i = g, g = m, m = i, e.s = -e.s), (r = (t = m.length) - (n = g.length)) > 0) for (;r--; g[n++] = 0) ;
for (r = f - 1; t > c; ) {
if (g[--t] < m[t]) {
for (n = t; n && !g[--n]; g[n] = r) ;
--g[n], g[t] += f;
}
g[t] -= m[t];
}
for (;0 == g[0]; g.splice(0, 1), --a) ;
return g[0] ? normalise(e, g, a) : (e.s = 3 == E ? -1 : 1, e.c = [ e.e = 0 ], e);
}, O.modulo = O.mod = function(e, n) {
var t, i, o = this;
return e = new BigNumber(e, n), !o.c || !e.s || e.c && !e.c[0] ? new BigNumber(NaN) : !e.c || o.c && !o.c[0] ? new BigNumber(o) : (9 == F ? (i = e.s,
e.s = 1, t = r(o, e, 0, 3), e.s = i, t.s *= i) : t = r(o, e, 0, F), (e = o.minus(t.times(e))).c[0] || 1 != F || (e.s = o.s),
e);
}, O.multipliedBy = O.times = function(e, r) {
var n, t, i, o, u, c, l, g, m, h, b, p, N, d, B, w = this, O = w.c, v = (e = new BigNumber(e, r)).c;
if (!(O && v && O[0] && v[0])) return !w.s || !e.s || O && !O[0] && !v || v && !v[0] && !O ? e.c = e.e = e.s = null : (e.s *= w.s,
O && v ? (e.c = [ 0 ], e.e = 0) : e.c = e.e = null), e;
for (t = bitFloor(w.e / s) + bitFloor(e.e / s), e.s *= w.s, (l = O.length) < (h = v.length) && (N = O,
O = v, v = N, i = l, l = h, h = i), i = l + h, N = []; i--; N.push(0)) ;
for (d = f, B = a, i = h; --i >= 0; ) {
for (n = 0, b = v[i] % B, p = v[i] / B | 0, o = i + (u = l); o > i; ) n = ((g = b * (g = O[--u] % B) + (c = p * g + (m = O[u] / B | 0) * b) % B * B + N[o] + n) / d | 0) + (c / B | 0) + p * m,
N[o--] = g % d;
N[o] = n;
}
return n ? ++t : N.splice(0, 1), normalise(e, N, t);
}, O.negated = function() {
var e = new BigNumber(this);
return e.s = -e.s || null, e;
}, O.plus = function(e, r) {
var n, t = this, i = t.s;
if (r = (e = new BigNumber(e, r)).s, !i || !r) return new BigNumber(NaN);
if (i != r) return e.s = -r, t.minus(e);
var o = t.e / s, u = e.e / s, c = t.c, l = e.c;
if (!o || !u) {
if (!c || !l) return new BigNumber(i / 0);
if (!c[0] || !l[0]) return l[0] ? e : new BigNumber(c[0] ? t : 0 * i);
}
if (o = bitFloor(o), u = bitFloor(u), c = c.slice(), i = o - u) {
for (i > 0 ? (u = o, n = l) : (i = -i, n = c), n.reverse(); i--; n.push(0)) ;
n.reverse();
}
for ((i = c.length) - (r = l.length) < 0 && (n = l, l = c, c = n, r = i), i = 0; r; ) i = (c[--r] = c[r] + l[r] + i) / f | 0,
c[r] = f === c[r] ? 0 : c[r] % f;
return i && (c = [ i ].concat(c), ++u), normalise(e, c, u);
}, O.precision = O.sd = function(e, r) {
var n, t, i, o = this;
if (null != e && e !== !!e) return intCheck(e, 1, g), null == r ? r = E : intCheck(r, 0, 8),
round(new BigNumber(o), e, r);
if (!(n = o.c)) return null;
if (t = (i = n.length - 1) * s + 1, i = n[i]) {
for (;i % 10 == 0; i /= 10, t--) ;
for (i = n[0]; i >= 10; i /= 10, t++) ;
}
return e && o.e + 1 > t && (t = o.e + 1), t;
}, O.shiftedBy = function(e) {
return intCheck(e, -c, c), this.times("1e" + e);
}, O.squareRoot = O.sqrt = function() {
var e, n, t, i, o, u = this, f = u.c, s = u.s, c = u.e, l = y + 4, a = new BigNumber("0.5");
if (1 !== s || !f || !f[0]) return new BigNumber(!s || s < 0 && (!f || f[0]) ? NaN : f ? u : 1 / 0);
if (0 == (s = Math.sqrt(+valueOf(u))) || s == 1 / 0 ? (((n = coeffToString(f)).length + c) % 2 == 0 && (n += "0"),
s = Math.sqrt(+n), c = bitFloor((c + 1) / 2) - (c < 0 || c % 2), t = new BigNumber(n = s == 1 / 0 ? "1e" + c : (n = s.toExponential()).slice(0, n.indexOf("e") + 1) + c)) : t = new BigNumber(s + ""),
t.c[0]) for ((s = (c = t.e) + l) < 3 && (s = 0); ;) if (o = t, t = a.times(o.plus(r(u, o, l, 1))),
coeffToString(o.c).slice(0, s) === (n = coeffToString(t.c)).slice(0, s)) {
if (t.e < c && --s, "9999" != (n = n.slice(s - 3, s + 1)) && (i || "4999" != n)) {
+n && (+n.slice(1) || "5" != n.charAt(0)) || (round(t, t.e + y + 2, 1), e = !t.times(t).eq(u));
break;
}
if (!i && (round(o, o.e + y + 2, 0), o.times(o).eq(u))) {
t = o;
break;
}
l += 4, s += 4, i = 1;
}
return round(t, t.e + y + 1, E, e);
}, O.toExponential = function(e, r) {
return null != e && (intCheck(e, 0, g), e++), format(this, e, r, 1);
}, O.toFixed = function(e, r) {
return null != e && (intCheck(e, 0, g), e = e + this.e + 1), format(this, e, r);
}, O.toFormat = function(e, r, n) {
var t, i = this;
if (null == n) null != e && r && "object" == typeof r ? (n = r, r = null) : e && "object" == typeof e ? (n = e,
e = r = null) : n = T; else if ("object" != typeof n) throw Error(o + "Argument not an object: " + n);
if (t = i.toFixed(e, r), i.c) {
var u, f = t.split("."), s = +n.groupSize, c = +n.secondaryGroupSize, l = n.groupSeparator || "", a = f[0], g = f[1], m = i.s < 0, h = m ? a.slice(1) : a, b = h.length;
if (c && (u = s, s = c, c = u, b -= u), s > 0 && b > 0) {
for (u = b % s || s, a = h.substr(0, u); u < b; u += s) a += l + h.substr(u, s);
c > 0 && (a += l + h.slice(u)), m && (a = "-" + a);
}
t = g ? a + (n.decimalSeparator || "") + ((c = +n.fractionGroupSize) ? g.replace(new RegExp("\\d{" + c + "}\\B", "g"), "$&" + (n.fractionGroupSeparator || "")) : g) : a;
}
return (n.prefix || "") + t + (n.suffix || "");
}, O.toFraction = function(e) {
var n, t, i, u, f, c, a, g, m, h, b, p, N = this, d = N.c;
if (null != e && (!(a = new BigNumber(e)).isInteger() && (a.c || 1 !== a.s) || a.lt(v))) throw Error(o + "Argument " + (a.isInteger() ? "out of range: " : "not an integer: ") + valueOf(a));
if (!d) return new BigNumber(N);
for (n = new BigNumber(v), m = t = new BigNumber(v), i = g = new BigNumber(v), p = coeffToString(d),
f = n.e = p.length - N.e - 1, n.c[0] = l[(c = f % s) < 0 ? s + c : c], e = !e || a.comparedTo(n) > 0 ? f > 0 ? n : m : a,
c = S, S = 1 / 0, a = new BigNumber(p), g.c[0] = 0; h = r(a, n, 0, 1), 1 != (u = t.plus(h.times(i))).comparedTo(e); ) t = i,
i = u, m = g.plus(h.times(u = m)), g = u, n = a.minus(h.times(u = n)), a = u;
return u = r(e.minus(t), i, 0, 1), g = g.plus(u.times(m)), t = t.plus(u.times(i)),
g.s = m.s = N.s, b = r(m, i, f *= 2, E).minus(N).abs().comparedTo(r(g, t, f, E).minus(N).abs()) < 1 ? [ m, i ] : [ g, t ],
S = c, b;
}, O.toNumber = function() {
return +valueOf(this);
}, O.toPrecision = function(e, r) {
return null != e && intCheck(e, 1, g), format(this, e, r, 2);
}, O.toString = function(e) {
var r, n = this, t = n.s, i = n.e;
return null === i ? t ? (r = "Infinity", t < 0 && (r = "-" + r)) : r = "NaN" : (r = coeffToString(n.c),
null == e ? r = i <= C || i >= x ? toExponential(r, i) : toFixedPoint(r, i, "0") : (intCheck(e, 2, R.length, "Base"),
r = m(toFixedPoint(r, i, "0"), 10, e, t, !0)), t < 0 && n.c[0] && (r = "-" + r)),
r;
}, O.valueOf = O.toJSON = function() {
return valueOf(this);
}, O._isBigNumber = !0, "function" == typeof Symbol && "symbol" == typeof Symbol.iterator && (O[Symbol.toStringTag] = "BigNumber",
O[Symbol.for("nodejs.util.inspect.custom")] = O.valueOf), null != e && BigNumber.set(e),
BigNumber;
}()).default = r.BigNumber = r, "function" == typeof define && define.amd ? define(function() {
return r;
}) : "undefined" != typeof module && module.exports ? module.exports = r : (e || (e = "undefined" != typeof self && self ? self : window),
e.BigNumber = r), e.BigNumber = r;
}(window);