trybeacon 0.1.0

package/.next/server/chunks/ssr/lib_drizzle_schema_ts_0oz5uob._.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../lib/drizzle/schema.ts","../../../../node_modules/bignumber.js/bignumber.mjs","../../../../node_modules/%40noble/hashes/src/_u64.ts","../../../../node_modules/%40paralleldrive/cuid2/src/index.js","../../../../node_modules/%40noble/hashes/src/utils.ts","../../../../node_modules/%40noble/hashes/src/sha3.ts"],"sourcesContent":["import {\n  sqliteTable,\n  type AnySQLiteColumn,\n  index,\n  foreignKey,\n  text,\n  integer,\n  real,\n  uniqueIndex,\n  primaryKey,\n} from \"drizzle-orm/sqlite-core\";\nimport { createId } from \"@paralleldrive/cuid2\";\n\n// Beacon data layer (Drizzle over libSQL). Generated from the live schema via `drizzle-kit pull`,\n// then corrected to PROPER column types instead of carrying over Prisma's storage choices:\n//   • Timestamps  → integer({ mode: \"timestamp_ms\" }) — real `Date` objects, compact epoch storage,\n//     correct chronological ordering (Prisma stored these as TEXT ISO strings).\n//   • Booleans    → integer({ mode: \"boolean\" }) — real true/false in TS. (SQLite has no native\n//     boolean type; 0/1 is the only physical encoding — the fix is the typed layer.)\n//   • Ids         → cuid2 via $defaultFn, so inserts don't have to supply an id.\n// Table + column + index names are kept verbatim so the schema maps onto existing local DBs.\n\n// ── Roadmap / architecture graph ─────────────────────────────────────────────\nexport const node = sqliteTable(\n  \"Node\",\n  {\n    id: text().primaryKey().$defaultFn(() => createId()),\n    view: text().notNull(),\n    cluster: text(),\n    title: text().notNull(),\n    role: text(),\n    plain: text(),\n    status: text().default(\"PENDING\").notNull(),\n    priority: integer().default(2).notNull(),\n    progress: integer().default(0).notNull(),\n    x: real().default(0).notNull(),\n    y: real().default(0).notNull(),\n    sourceRef: text(),\n    externalId: text(),\n    source: text().default(\"MANUAL\").notNull(),\n    parentId: text(),\n    createdAt: integer({ mode: \"timestamp_ms\" }).notNull().$defaultFn(() => new Date()),\n    updatedAt: integer({ mode: \"timestamp_ms\" })\n      .notNull()\n      .$defaultFn(() => new Date())\n      .$onUpdate(() => new Date()),\n    embedding: text(),\n  },\n  (t) => [\n    index(\"Node_cluster_idx\").on(t.cluster),\n    index(\"Node_parentId_idx\").on(t.parentId),\n    index(\"Node_view_idx\").on(t.view),\n    foreignKey(() => ({\n      columns: [t.parentId],\n      foreignColumns: [t.id],\n      name: \"Node_parentId_Node_id_fk\",\n    }))\n      .onUpdate(\"cascade\")\n      .onDelete(\"cascade\"),\n  ],\n);\n\nexport const nodeFile = sqliteTable(\n  \"NodeFile\",\n  {\n    id: text().primaryKey().$defaultFn(() => createId()),\n    nodeId: text()\n      .notNull()\n      .references(() => node.id, { onDelete: \"cascade\", onUpdate: \"cascade\" }),\n    path: text().notNull(),\n  },\n  (t) => [\n    uniqueIndex(\"NodeFile_nodeId_path_key\").on(t.nodeId, t.path),\n    index(\"NodeFile_nodeId_idx\").on(t.nodeId),\n  ],\n);\n\nexport const tag = sqliteTable(\n  \"Tag\",\n  {\n    id: text().primaryKey().$defaultFn(() => createId()),\n    label: text().notNull(),\n    color: text(),\n  },\n  (t) => [uniqueIndex(\"Tag_label_key\").on(t.label)],\n);\n\nexport const edge = sqliteTable(\n  \"Edge\",\n  {\n    id: text().primaryKey().$defaultFn(() => createId()),\n    fromId: text()\n      .notNull()\n      .references(() => node.id, { onDelete: \"cascade\", onUpdate: \"cascade\" }),\n    toId: text()\n      .notNull()\n      .references(() => node.id, { onDelete: \"cascade\", onUpdate: \"cascade\" }),\n    kind: text().default(\"DEPENDS\").notNull(),\n    label: text(),\n    sourceHandle: text(),\n    targetHandle: text(),\n  },\n  (t) => [\n    uniqueIndex(\"Edge_fromId_toId_kind_key\").on(t.fromId, t.toId, t.kind),\n    index(\"Edge_toId_idx\").on(t.toId),\n    index(\"Edge_fromId_idx\").on(t.fromId),\n  ],\n);\n\n// Node ↔ Tag implicit M:N — Prisma's `_NodeTags(A→Node, B→Tag)` table, modeled explicitly.\nexport const nodeTags = sqliteTable(\n  \"_NodeTags\",\n  {\n    a: text(\"A\")\n      .notNull()\n      .references(() => node.id, { onDelete: \"cascade\", onUpdate: \"cascade\" }),\n    b: text(\"B\")\n      .notNull()\n      .references(() => tag.id, { onDelete: \"cascade\", onUpdate: \"cascade\" }),\n  },\n  (t) => [uniqueIndex(\"_NodeTags_AB_unique\").on(t.a, t.b), index(\"_NodeTags_B_index\").on(t.b)],\n);\n\nexport const note = sqliteTable(\n  \"Note\",\n  {\n    id: text().primaryKey().$defaultFn(() => createId()),\n    title: text().default(\"Untitled\").notNull(),\n    body: text().default(\"\").notNull(),\n    ord: real().default(0).notNull(),\n    pinned: integer({ mode: \"boolean\" }).default(false).notNull(),\n    createdAt: integer({ mode: \"timestamp_ms\" }).notNull().$defaultFn(() => new Date()),\n    updatedAt: integer({ mode: \"timestamp_ms\" })\n      .notNull()\n      .$defaultFn(() => new Date())\n      .$onUpdate(() => new Date()),\n  },\n  (t) => [index(\"Note_updatedAt_idx\").on(t.updatedAt)],\n);\n\n// ── DB-designer schema map ───────────────────────────────────────────────────\nexport const dbTable = sqliteTable(\n  \"DbTable\",\n  {\n    id: text().primaryKey().$defaultFn(() => createId()),\n    name: text().notNull(),\n    domain: text(),\n    description: text(),\n    source: text().default(\"MANUAL\").notNull(),\n    x: real().default(0).notNull(),\n    y: real().default(0).notNull(),\n    createdAt: integer({ mode: \"timestamp_ms\" }).notNull().$defaultFn(() => new Date()),\n    updatedAt: integer({ mode: \"timestamp_ms\" })\n      .notNull()\n      .$defaultFn(() => new Date())\n      .$onUpdate(() => new Date()),\n  },\n  (t) => [index(\"DbTable_domain_idx\").on(t.domain), uniqueIndex(\"DbTable_name_key\").on(t.name)],\n);\n\nexport const dbColumn = sqliteTable(\n  \"DbColumn\",\n  {\n    id: text().primaryKey().$defaultFn(() => createId()),\n    tableId: text()\n      .notNull()\n      .references(() => dbTable.id, { onDelete: \"cascade\", onUpdate: \"cascade\" }),\n    name: text().notNull(),\n    type: text().notNull(),\n    isPk: integer({ mode: \"boolean\" }).default(false).notNull(),\n    isFk: integer({ mode: \"boolean\" }).default(false).notNull(),\n    nullable: integer({ mode: \"boolean\" }).default(true).notNull(),\n    note: text(),\n    ord: integer().default(0).notNull(),\n  },\n  (t) => [\n    uniqueIndex(\"DbColumn_tableId_name_key\").on(t.tableId, t.name),\n    index(\"DbColumn_tableId_idx\").on(t.tableId),\n  ],\n);\n\nexport const dbRelation = sqliteTable(\n  \"DbRelation\",\n  {\n    id: text().primaryKey().$defaultFn(() => createId()),\n    fromTableId: text()\n      .notNull()\n      .references(() => dbTable.id, { onDelete: \"cascade\", onUpdate: \"cascade\" }),\n    toTableId: text()\n      .notNull()\n      .references(() => dbTable.id, { onDelete: \"cascade\", onUpdate: \"cascade\" }),\n    fromColumn: text().notNull(),\n    toColumn: text().notNull(),\n    label: text(),\n  },\n  (t) => [\n    index(\"DbRelation_toTableId_idx\").on(t.toTableId),\n    index(\"DbRelation_fromTableId_idx\").on(t.fromTableId),\n  ],\n);\n\nexport const endpoint = sqliteTable(\n  \"Endpoint\",\n  {\n    id: text().primaryKey().$defaultFn(() => createId()),\n    method: text().notNull(),\n    path: text().notNull(),\n    domain: text(),\n    description: text(),\n    source: text().default(\"MANUAL\").notNull(),\n    x: real().default(0).notNull(),\n    y: real().default(0).notNull(),\n    createdAt: integer({ mode: \"timestamp_ms\" }).notNull().$defaultFn(() => new Date()),\n    updatedAt: integer({ mode: \"timestamp_ms\" })\n      .notNull()\n      .$defaultFn(() => new Date())\n      .$onUpdate(() => new Date()),\n  },\n  (t) => [\n    uniqueIndex(\"Endpoint_method_path_key\").on(t.method, t.path),\n    index(\"Endpoint_domain_idx\").on(t.domain),\n  ],\n);\n\nexport const endpointTable = sqliteTable(\n  \"EndpointTable\",\n  {\n    id: text().primaryKey().$defaultFn(() => createId()),\n    endpointId: text()\n      .notNull()\n      .references(() => endpoint.id, { onDelete: \"cascade\", onUpdate: \"cascade\" }),\n    tableId: text()\n      .notNull()\n      .references(() => dbTable.id, { onDelete: \"cascade\", onUpdate: \"cascade\" }),\n    access: text().default(\"read\").notNull(),\n  },\n  (t) => [\n    uniqueIndex(\"EndpointTable_endpointId_tableId_key\").on(t.endpointId, t.tableId),\n    index(\"EndpointTable_tableId_idx\").on(t.tableId),\n  ],\n);\n\n// ── DB-designer DRAFT layer (proposed schema under review) ────────────────────\nexport const draftTable = sqliteTable(\n  \"DraftTable\",\n  {\n    id: text().primaryKey().$defaultFn(() => createId()),\n    name: text().notNull(),\n    domain: text(),\n    description: text(),\n    x: real().default(0).notNull(),\n    y: real().default(0).notNull(),\n    createdAt: integer({ mode: \"timestamp_ms\" }).notNull().$defaultFn(() => new Date()),\n  },\n  (t) => [uniqueIndex(\"DraftTable_name_key\").on(t.name)],\n);\n\nexport const draftColumn = sqliteTable(\n  \"DraftColumn\",\n  {\n    id: text().primaryKey().$defaultFn(() => createId()),\n    tableId: text()\n      .notNull()\n      .references(() => draftTable.id, { onDelete: \"cascade\", onUpdate: \"cascade\" }),\n    name: text().notNull(),\n    type: text().notNull(),\n    isPk: integer({ mode: \"boolean\" }).default(false).notNull(),\n    isFk: integer({ mode: \"boolean\" }).default(false).notNull(),\n    nullable: integer({ mode: \"boolean\" }).default(true).notNull(),\n    note: text(),\n    ord: integer().default(0).notNull(),\n  },\n  (t) => [index(\"DraftColumn_tableId_idx\").on(t.tableId)],\n);\n\nexport const draftRelation = sqliteTable(\n  \"DraftRelation\",\n  {\n    id: text().primaryKey().$defaultFn(() => createId()),\n    fromTableId: text()\n      .notNull()\n      .references(() => draftTable.id, { onDelete: \"cascade\", onUpdate: \"cascade\" }),\n    toTableId: text()\n      .notNull()\n      .references(() => draftTable.id, { onDelete: \"cascade\", onUpdate: \"cascade\" }),\n    fromColumn: text().notNull(),\n    toColumn: text().notNull(),\n    label: text(),\n  },\n  (t) => [\n    index(\"DraftRelation_toTableId_idx\").on(t.toTableId),\n    index(\"DraftRelation_fromTableId_idx\").on(t.fromTableId),\n  ],\n);\n\n// ── Code-intelligence graph ──────────────────────────────────────────────────\nexport const codeFile = sqliteTable(\"CodeFile\", {\n  path: text().primaryKey(),\n  root: text(),\n  lang: text(),\n  x: real().default(0).notNull(),\n  y: real().default(0).notNull(),\n  mtimeMs: real(),\n  size: integer(),\n  inDegree: integer().default(0).notNull(),\n  outDegree: integer().default(0).notNull(),\n  updatedAt: integer({ mode: \"timestamp_ms\" })\n    .notNull()\n    .$defaultFn(() => new Date())\n    .$onUpdate(() => new Date()),\n});\n\nexport const codeFileEdge = sqliteTable(\n  \"CodeFileEdge\",\n  {\n    fromPath: text()\n      .notNull()\n      .references((): AnySQLiteColumn => codeFile.path, { onDelete: \"cascade\", onUpdate: \"cascade\" }),\n    toPath: text()\n      .notNull()\n      .references((): AnySQLiteColumn => codeFile.path, { onDelete: \"cascade\", onUpdate: \"cascade\" }),\n    circular: integer({ mode: \"boolean\" }).default(false).notNull(),\n  },\n  (t) => [\n    index(\"CodeFileEdge_circular_idx\").on(t.circular),\n    index(\"CodeFileEdge_toPath_idx\").on(t.toPath),\n    index(\"CodeFileEdge_fromPath_idx\").on(t.fromPath),\n    primaryKey({ columns: [t.fromPath, t.toPath], name: \"CodeFileEdge_fromPath_toPath_pk\" }),\n  ],\n);\n\n// ── Singletons ───────────────────────────────────────────────────────────────\nexport const syncState = sqliteTable(\"SyncState\", {\n  id: text().primaryKey().default(\"singleton\"),\n  version: integer().default(0).notNull(),\n  codeGraphSyncedAt: integer({ mode: \"timestamp_ms\" }),\n  updatedAt: integer({ mode: \"timestamp_ms\" })\n    .notNull()\n    .$defaultFn(() => new Date())\n    .$onUpdate(() => new Date()),\n});\n\nexport const appSetting = sqliteTable(\"AppSetting\", {\n  id: text().primaryKey().default(\"singleton\"),\n  intelModel: text().default(\"claude-haiku-4-5\").notNull(),\n  intelProvider: text().default(\"auto\").notNull(),\n  editor: text().default(\"auto\").notNull(),\n  currentFeatureId: text(),\n  updatedAt: integer({ mode: \"timestamp_ms\" })\n    .notNull()\n    .$defaultFn(() => new Date())\n    .$onUpdate(() => new Date()),\n});\n\nexport const projectMeta = sqliteTable(\"ProjectMeta\", {\n  id: text().primaryKey().default(\"singleton\"),\n  overview: text(),\n  conventions: text().default(\"[]\").notNull(),\n  updatedAt: integer({ mode: \"timestamp_ms\" })\n    .notNull()\n    .$defaultFn(() => new Date())\n    .$onUpdate(() => new Date()),\n});\n","/*\r\n *      bignumber.js v9.3.1\r\n *      A JavaScript library for arbitrary-precision arithmetic.\r\n *      https://github.com/MikeMcl/bignumber.js\r\n *      Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>\r\n *      MIT Licensed.\r\n *\r\n *      BigNumber.prototype methods     |  BigNumber methods\r\n *                                      |\r\n *      absoluteValue            abs    |  clone\r\n *      comparedTo                      |  config               set\r\n *      decimalPlaces            dp     |      DECIMAL_PLACES\r\n *      dividedBy                div    |      ROUNDING_MODE\r\n *      dividedToIntegerBy       idiv   |      EXPONENTIAL_AT\r\n *      exponentiatedBy          pow    |      RANGE\r\n *      integerValue                    |      CRYPTO\r\n *      isEqualTo                eq     |      MODULO_MODE\r\n *      isFinite                        |      POW_PRECISION\r\n *      isGreaterThan            gt     |      FORMAT\r\n *      isGreaterThanOrEqualTo   gte    |      ALPHABET\r\n *      isInteger                       |  isBigNumber\r\n *      isLessThan               lt     |  maximum              max\r\n *      isLessThanOrEqualTo      lte    |  minimum              min\r\n *      isNaN                           |  random\r\n *      isNegative                      |  sum\r\n *      isPositive                      |\r\n *      isZero                          |\r\n *      minus                           |\r\n *      modulo                   mod    |\r\n *      multipliedBy             times  |\r\n *      negated                         |\r\n *      plus                            |\r\n *      precision                sd     |\r\n *      shiftedBy                       |\r\n *      squareRoot               sqrt   |\r\n *      toExponential                   |\r\n *      toFixed                         |\r\n *      toFormat                        |\r\n *      toFraction                      |\r\n *      toJSON                          |\r\n *      toNumber                        |\r\n *      toPrecision                     |\r\n *      toString                        |\r\n *      valueOf                         |\r\n *\r\n */\r\n\r\n\r\nvar\r\n  isNumeric = /^-?(?:\\d+(?:\\.\\d*)?|\\.\\d+)(?:e[+-]?\\d+)?$/i,\r\n  mathceil = Math.ceil,\r\n  mathfloor = Math.floor,\r\n\r\n  bignumberError = '[BigNumber Error] ',\r\n  tooManyDigits = bignumberError + 'Number primitive has more than 15 significant digits: ',\r\n\r\n  BASE = 1e14,\r\n  LOG_BASE = 14,\r\n  MAX_SAFE_INTEGER = 0x1fffffffffffff,         // 2^53 - 1\r\n  // MAX_INT32 = 0x7fffffff,                   // 2^31 - 1\r\n  POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13],\r\n  SQRT_BASE = 1e7,\r\n\r\n  // EDITABLE\r\n  // The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and\r\n  // the arguments to toExponential, toFixed, toFormat, and toPrecision.\r\n  MAX = 1E9;                                   // 0 to MAX_INT32\r\n\r\n\r\n/*\r\n * Create and return a BigNumber constructor.\r\n */\r\nfunction clone(configObject) {\r\n  var div, convertBase, parseNumeric,\r\n    P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },\r\n    ONE = new BigNumber(1),\r\n\r\n\r\n    //----------------------------- EDITABLE CONFIG DEFAULTS -------------------------------\r\n\r\n\r\n    // The default values below must be integers within the inclusive ranges stated.\r\n    // The values can also be changed at run-time using BigNumber.set.\r\n\r\n    // The maximum number of decimal places for operations involving division.\r\n    DECIMAL_PLACES = 20,                     // 0 to MAX\r\n\r\n    // The rounding mode used when rounding to the above decimal places, and when using\r\n    // toExponential, toFixed, toFormat and toPrecision, and round (default value).\r\n    // UP         0 Away from zero.\r\n    // DOWN       1 Towards zero.\r\n    // CEIL       2 Towards +Infinity.\r\n    // FLOOR      3 Towards -Infinity.\r\n    // HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n    // HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n    // HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n    // HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n    // HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n    ROUNDING_MODE = 4,                       // 0 to 8\r\n\r\n    // EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS]\r\n\r\n    // The exponent value at and beneath which toString returns exponential notation.\r\n    // Number type: -7\r\n    TO_EXP_NEG = -7,                         // 0 to -MAX\r\n\r\n    // The exponent value at and above which toString returns exponential notation.\r\n    // Number type: 21\r\n    TO_EXP_POS = 21,                         // 0 to MAX\r\n\r\n    // RANGE : [MIN_EXP, MAX_EXP]\r\n\r\n    // The minimum exponent value, beneath which underflow to zero occurs.\r\n    // Number type: -324  (5e-324)\r\n    MIN_EXP = -1e7,                          // -1 to -MAX\r\n\r\n    // The maximum exponent value, above which overflow to Infinity occurs.\r\n    // Number type:  308  (1.7976931348623157e+308)\r\n    // For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow.\r\n    MAX_EXP = 1e7,                           // 1 to MAX\r\n\r\n    // Whether to use cryptographically-secure random number generation, if available.\r\n    CRYPTO = false,                          // true or false\r\n\r\n    // The modulo mode used when calculating the modulus: a mod n.\r\n    // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n    // The remainder (r) is calculated as: r = a - n * q.\r\n    //\r\n    // UP        0 The remainder is positive if the dividend is negative, else is negative.\r\n    // DOWN      1 The remainder has the same sign as the dividend.\r\n    //             This modulo mode is commonly known as 'truncated division' and is\r\n    //             equivalent to (a % n) in JavaScript.\r\n    // FLOOR     3 The remainder has the same sign as the divisor (Python %).\r\n    // HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function.\r\n    // EUCLID    9 Euclidian division. q = sign(n) * floor(a / abs(n)).\r\n    //             The remainder is always positive.\r\n    //\r\n    // The truncated division, floored division, Euclidian division and IEEE 754 remainder\r\n    // modes are commonly used for the modulus operation.\r\n    // Although the other rounding modes can also be used, they may not give useful results.\r\n    MODULO_MODE = 1,                         // 0 to 9\r\n\r\n    // The maximum number of significant digits of the result of the exponentiatedBy operation.\r\n    // If POW_PRECISION is 0, there will be unlimited significant digits.\r\n    POW_PRECISION = 0,                       // 0 to MAX\r\n\r\n    // The format specification used by the BigNumber.prototype.toFormat method.\r\n    FORMAT = {\r\n      prefix: '',\r\n      groupSize: 3,\r\n      secondaryGroupSize: 0,\r\n      groupSeparator: ',',\r\n      decimalSeparator: '.',\r\n      fractionGroupSize: 0,\r\n      fractionGroupSeparator: '\\xA0',        // non-breaking space\r\n      suffix: ''\r\n    },\r\n\r\n    // The alphabet used for base conversion. It must be at least 2 characters long, with no '+',\r\n    // '-', '.', whitespace, or repeated character.\r\n    // '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'\r\n    ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz',\r\n    alphabetHasNormalDecimalDigits = true;\r\n\r\n\r\n  //------------------------------------------------------------------------------------------\r\n\r\n\r\n  // CONSTRUCTOR\r\n\r\n\r\n  /*\r\n   * The BigNumber constructor and exported function.\r\n   * Create and return a new instance of a BigNumber object.\r\n   *\r\n   * v {number|string|BigNumber} A numeric value.\r\n   * [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive.\r\n   */\r\n  function BigNumber(v, b) {\r\n    var alphabet, c, caseChanged, e, i, isNum, len, str,\r\n      x = this;\r\n\r\n    // Enable constructor call without `new`.\r\n    if (!(x instanceof BigNumber)) return new BigNumber(v, b);\r\n\r\n    if (b == null) {\r\n\r\n      if (v && v._isBigNumber === true) {\r\n        x.s = v.s;\r\n\r\n        if (!v.c || v.e > MAX_EXP) {\r\n          x.c = x.e = null;\r\n        } else if (v.e < MIN_EXP) {\r\n          x.c = [x.e = 0];\r\n        } else {\r\n          x.e = v.e;\r\n          x.c = v.c.slice();\r\n        }\r\n\r\n        return;\r\n      }\r\n\r\n      if ((isNum = typeof v == 'number') && v * 0 == 0) {\r\n\r\n        // Use `1 / n` to handle minus zero also.\r\n        x.s = 1 / v < 0 ? (v = -v, -1) : 1;\r\n\r\n        // Fast path for integers, where n < 2147483648 (2**31).\r\n        if (v === ~~v) {\r\n          for (e = 0, i = v; i >= 10; i /= 10, e++);\r\n\r\n          if (e > MAX_EXP) {\r\n            x.c = x.e = null;\r\n          } else {\r\n            x.e = e;\r\n            x.c = [v];\r\n          }\r\n\r\n          return;\r\n        }\r\n\r\n        str = String(v);\r\n      } else {\r\n\r\n        if (!isNumeric.test(str = String(v))) return parseNumeric(x, str, isNum);\r\n\r\n        x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;\r\n      }\r\n\r\n      // Decimal point?\r\n      if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n      // Exponential form?\r\n      if ((i = str.search(/e/i)) > 0) {\r\n\r\n        // Determine exponent.\r\n        if (e < 0) e = i;\r\n        e += +str.slice(i + 1);\r\n        str = str.substring(0, i);\r\n      } else if (e < 0) {\r\n\r\n        // Integer.\r\n        e = str.length;\r\n      }\r\n\r\n    } else {\r\n\r\n      // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n      intCheck(b, 2, ALPHABET.length, 'Base');\r\n\r\n      // Allow exponential notation to be used with base 10 argument, while\r\n      // also rounding to DECIMAL_PLACES as with other bases.\r\n      if (b == 10 && alphabetHasNormalDecimalDigits) {\r\n        x = new BigNumber(v);\r\n        return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE);\r\n      }\r\n\r\n      str = String(v);\r\n\r\n      if (isNum = typeof v == 'number') {\r\n\r\n        // Avoid potential interpretation of Infinity and NaN as base 44+ values.\r\n        if (v * 0 != 0) return parseNumeric(x, str, isNum, b);\r\n\r\n        x.s = 1 / v < 0 ? (str = str.slice(1), -1) : 1;\r\n\r\n        // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n        if (BigNumber.DEBUG && str.replace(/^0\\.0*|\\./, '').length > 15) {\r\n          throw Error\r\n           (tooManyDigits + v);\r\n        }\r\n      } else {\r\n        x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;\r\n      }\r\n\r\n      alphabet = ALPHABET.slice(0, b);\r\n      e = i = 0;\r\n\r\n      // Check that str is a valid base b number.\r\n      // Don't use RegExp, so alphabet can contain special characters.\r\n      for (len = str.length; i < len; i++) {\r\n        if (alphabet.indexOf(c = str.charAt(i)) < 0) {\r\n          if (c == '.') {\r\n\r\n            // If '.' is not the first character and it has not be found before.\r\n            if (i > e) {\r\n              e = len;\r\n              continue;\r\n            }\r\n          } else if (!caseChanged) {\r\n\r\n            // Allow e.g. hexadecimal 'FF' as well as 'ff'.\r\n            if (str == str.toUpperCase() && (str = str.toLowerCase()) ||\r\n                str == str.toLowerCase() && (str = str.toUpperCase())) {\r\n              caseChanged = true;\r\n              i = -1;\r\n              e = 0;\r\n              continue;\r\n            }\r\n          }\r\n\r\n          return parseNumeric(x, String(v), isNum, b);\r\n        }\r\n      }\r\n\r\n      // Prevent later check for length on converted number.\r\n      isNum = false;\r\n      str = convertBase(str, b, 10, x.s);\r\n\r\n      // Decimal point?\r\n      if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n      else e = str.length;\r\n    }\r\n\r\n    // Determine leading zeros.\r\n    for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n    // Determine trailing zeros.\r\n    for (len = str.length; str.charCodeAt(--len) === 48;);\r\n\r\n    if (str = str.slice(i, ++len)) {\r\n      len -= i;\r\n\r\n      // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n      if (isNum && BigNumber.DEBUG &&\r\n        len > 15 && (v > MAX_SAFE_INTEGER || v !== mathfloor(v))) {\r\n          throw Error\r\n           (tooManyDigits + (x.s * v));\r\n      }\r\n\r\n       // Overflow?\r\n      if ((e = e - i - 1) > MAX_EXP) {\r\n\r\n        // Infinity.\r\n        x.c = x.e = null;\r\n\r\n      // Underflow?\r\n      } else if (e < MIN_EXP) {\r\n\r\n        // Zero.\r\n        x.c = [x.e = 0];\r\n      } else {\r\n        x.e = e;\r\n        x.c = [];\r\n\r\n        // Transform base\r\n\r\n        // e is the base 10 exponent.\r\n        // i is where to slice str to get the first element of the coefficient array.\r\n        i = (e + 1) % LOG_BASE;\r\n        if (e < 0) i += LOG_BASE;  // i < 1\r\n\r\n        if (i < len) {\r\n          if (i) x.c.push(+str.slice(0, i));\r\n\r\n          for (len -= LOG_BASE; i < len;) {\r\n            x.c.push(+str.slice(i, i += LOG_BASE));\r\n          }\r\n\r\n          i = LOG_BASE - (str = str.slice(i)).length;\r\n        } else {\r\n          i -= len;\r\n        }\r\n\r\n        for (; i--; str += '0');\r\n        x.c.push(+str);\r\n      }\r\n    } else {\r\n\r\n      // Zero.\r\n      x.c = [x.e = 0];\r\n    }\r\n  }\r\n\r\n\r\n  // CONSTRUCTOR PROPERTIES\r\n\r\n\r\n  BigNumber.clone = clone;\r\n\r\n  BigNumber.ROUND_UP = 0;\r\n  BigNumber.ROUND_DOWN = 1;\r\n  BigNumber.ROUND_CEIL = 2;\r\n  BigNumber.ROUND_FLOOR = 3;\r\n  BigNumber.ROUND_HALF_UP = 4;\r\n  BigNumber.ROUND_HALF_DOWN = 5;\r\n  BigNumber.ROUND_HALF_EVEN = 6;\r\n  BigNumber.ROUND_HALF_CEIL = 7;\r\n  BigNumber.ROUND_HALF_FLOOR = 8;\r\n  BigNumber.EUCLID = 9;\r\n\r\n\r\n  /*\r\n   * Configure infrequently-changing library-wide settings.\r\n   *\r\n   * Accept an object with the following optional properties (if the value of a property is\r\n   * a number, it must be an integer within the inclusive range stated):\r\n   *\r\n   *   DECIMAL_PLACES   {number}           0 to MAX\r\n   *   ROUNDING_MODE    {number}           0 to 8\r\n   *   EXPONENTIAL_AT   {number|number[]}  -MAX to MAX  or  [-MAX to 0, 0 to MAX]\r\n   *   RANGE            {number|number[]}  -MAX to MAX (not zero)  or  [-MAX to -1, 1 to MAX]\r\n   *   CRYPTO           {boolean}          true or false\r\n   *   MODULO_MODE      {number}           0 to 9\r\n   *   POW_PRECISION       {number}           0 to MAX\r\n   *   ALPHABET         {string}           A string of two or more unique characters which does\r\n   *                                       not contain '.'.\r\n   *   FORMAT           {object}           An object with some of the following properties:\r\n   *     prefix                 {string}\r\n   *     groupSize              {number}\r\n   *     secondaryGroupSize     {number}\r\n   *     groupSeparator         {string}\r\n   *     decimalSeparator       {string}\r\n   *     fractionGroupSize      {number}\r\n   *     fractionGroupSeparator {string}\r\n   *     suffix                 {string}\r\n   *\r\n   * (The values assigned to the above FORMAT object properties are not checked for validity.)\r\n   *\r\n   * E.g.\r\n   * BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 })\r\n   *\r\n   * Ignore properties/parameters set to null or undefined, except for ALPHABET.\r\n   *\r\n   * Return an object with the properties current values.\r\n   */\r\n  BigNumber.config = BigNumber.set = function (obj) {\r\n    var p, v;\r\n\r\n    if (obj != null) {\r\n\r\n      if (typeof obj == 'object') {\r\n\r\n        // DECIMAL_PLACES {number} Integer, 0 to MAX inclusive.\r\n        // '[BigNumber Error] DECIMAL_PLACES {not a primitive number|not an integer|out of range}: {v}'\r\n        if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) {\r\n          v = obj[p];\r\n          intCheck(v, 0, MAX, p);\r\n          DECIMAL_PLACES = v;\r\n        }\r\n\r\n        // ROUNDING_MODE {number} Integer, 0 to 8 inclusive.\r\n        // '[BigNumber Error] ROUNDING_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n        if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) {\r\n          v = obj[p];\r\n          intCheck(v, 0, 8, p);\r\n          ROUNDING_MODE = v;\r\n        }\r\n\r\n        // EXPONENTIAL_AT {number|number[]}\r\n        // Integer, -MAX to MAX inclusive or\r\n        // [integer -MAX to 0 inclusive, 0 to MAX inclusive].\r\n        // '[BigNumber Error] EXPONENTIAL_AT {not a primitive number|not an integer|out of range}: {v}'\r\n        if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) {\r\n          v = obj[p];\r\n          if (v && v.pop) {\r\n            intCheck(v[0], -MAX, 0, p);\r\n            intCheck(v[1], 0, MAX, p);\r\n            TO_EXP_NEG = v[0];\r\n            TO_EXP_POS = v[1];\r\n          } else {\r\n            intCheck(v, -MAX, MAX, p);\r\n            TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);\r\n          }\r\n        }\r\n\r\n        // RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or\r\n        // [integer -MAX to -1 inclusive, integer 1 to MAX inclusive].\r\n        // '[BigNumber Error] RANGE {not a primitive number|not an integer|out of range|cannot be zero}: {v}'\r\n        if (obj.hasOwnProperty(p = 'RANGE')) {\r\n          v = obj[p];\r\n          if (v && v.pop) {\r\n            intCheck(v[0], -MAX, -1, p);\r\n            intCheck(v[1], 1, MAX, p);\r\n            MIN_EXP = v[0];\r\n            MAX_EXP = v[1];\r\n          } else {\r\n            intCheck(v, -MAX, MAX, p);\r\n            if (v) {\r\n              MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);\r\n            } else {\r\n              throw Error\r\n               (bignumberError + p + ' cannot be zero: ' + v);\r\n            }\r\n          }\r\n        }\r\n\r\n        // CRYPTO {boolean} true or false.\r\n        // '[BigNumber Error] CRYPTO not true or false: {v}'\r\n        // '[BigNumber Error] crypto unavailable'\r\n        if (obj.hasOwnProperty(p = 'CRYPTO')) {\r\n          v = obj[p];\r\n          if (v === !!v) {\r\n            if (v) {\r\n              if (typeof crypto != 'undefined' && crypto &&\r\n               (crypto.getRandomValues || crypto.randomBytes)) {\r\n                CRYPTO = v;\r\n              } else {\r\n                CRYPTO = !v;\r\n                throw Error\r\n                 (bignumberError + 'crypto unavailable');\r\n              }\r\n            } else {\r\n              CRYPTO = v;\r\n            }\r\n          } else {\r\n            throw Error\r\n             (bignumberError + p + ' not true or false: ' + v);\r\n          }\r\n        }\r\n\r\n        // MODULO_MODE {number} Integer, 0 to 9 inclusive.\r\n        // '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n        if (obj.hasOwnProperty(p = 'MODULO_MODE')) {\r\n          v = obj[p];\r\n          intCheck(v, 0, 9, p);\r\n          MODULO_MODE = v;\r\n        }\r\n\r\n        // POW_PRECISION {number} Integer, 0 to MAX inclusive.\r\n        // '[BigNumber Error] POW_PRECISION {not a primitive number|not an integer|out of range}: {v}'\r\n        if (obj.hasOwnProperty(p = 'POW_PRECISION')) {\r\n          v = obj[p];\r\n          intCheck(v, 0, MAX, p);\r\n          POW_PRECISION = v;\r\n        }\r\n\r\n        // FORMAT {object}\r\n        // '[BigNumber Error] FORMAT not an object: {v}'\r\n        if (obj.hasOwnProperty(p = 'FORMAT')) {\r\n          v = obj[p];\r\n          if (typeof v == 'object') FORMAT = v;\r\n          else throw Error\r\n           (bignumberError + p + ' not an object: ' + v);\r\n        }\r\n\r\n        // ALPHABET {string}\r\n        // '[BigNumber Error] ALPHABET invalid: {v}'\r\n        if (obj.hasOwnProperty(p = 'ALPHABET')) {\r\n          v = obj[p];\r\n\r\n          // Disallow if less than two characters,\r\n          // or if it contains '+', '-', '.', whitespace, or a repeated character.\r\n          if (typeof v == 'string' && !/^.?$|[+\\-.\\s]|(.).*\\1/.test(v)) {\r\n            alphabetHasNormalDecimalDigits = v.slice(0, 10) == '0123456789';\r\n            ALPHABET = v;\r\n          } else {\r\n            throw Error\r\n             (bignumberError + p + ' invalid: ' + v);\r\n          }\r\n        }\r\n\r\n      } else {\r\n\r\n        // '[BigNumber Error] Object expected: {v}'\r\n        throw Error\r\n         (bignumberError + 'Object expected: ' + obj);\r\n      }\r\n    }\r\n\r\n    return {\r\n      DECIMAL_PLACES: DECIMAL_PLACES,\r\n      ROUNDING_MODE: ROUNDING_MODE,\r\n      EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],\r\n      RANGE: [MIN_EXP, MAX_EXP],\r\n      CRYPTO: CRYPTO,\r\n      MODULO_MODE: MODULO_MODE,\r\n      POW_PRECISION: POW_PRECISION,\r\n      FORMAT: FORMAT,\r\n      ALPHABET: ALPHABET\r\n    };\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if v is a BigNumber instance, otherwise return false.\r\n   *\r\n   * If BigNumber.DEBUG is true, throw if a BigNumber instance is not well-formed.\r\n   *\r\n   * v {any}\r\n   *\r\n   * '[BigNumber Error] Invalid BigNumber: {v}'\r\n   */\r\n  BigNumber.isBigNumber = function (v) {\r\n    if (!v || v._isBigNumber !== true) return false;\r\n    if (!BigNumber.DEBUG) return true;\r\n\r\n    var i, n,\r\n      c = v.c,\r\n      e = v.e,\r\n      s = v.s;\r\n\r\n    out: if ({}.toString.call(c) == '[object Array]') {\r\n\r\n      if ((s === 1 || s === -1) && e >= -MAX && e <= MAX && e === mathfloor(e)) {\r\n\r\n        // If the first element is zero, the BigNumber value must be zero.\r\n        if (c[0] === 0) {\r\n          if (e === 0 && c.length === 1) return true;\r\n          break out;\r\n        }\r\n\r\n        // Calculate number of digits that c[0] should have, based on the exponent.\r\n        i = (e + 1) % LOG_BASE;\r\n        if (i < 1) i += LOG_BASE;\r\n\r\n        // Calculate number of digits of c[0].\r\n        //if (Math.ceil(Math.log(c[0] + 1) / Math.LN10) == i) {\r\n        if (String(c[0]).length == i) {\r\n\r\n          for (i = 0; i < c.length; i++) {\r\n            n = c[i];\r\n            if (n < 0 || n >= BASE || n !== mathfloor(n)) break out;\r\n          }\r\n\r\n          // Last element cannot be zero, unless it is the only element.\r\n          if (n !== 0) return true;\r\n        }\r\n      }\r\n\r\n    // Infinity/NaN\r\n    } else if (c === null && e === null && (s === null || s === 1 || s === -1)) {\r\n      return true;\r\n    }\r\n\r\n    throw Error\r\n      (bignumberError + 'Invalid BigNumber: ' + v);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new BigNumber whose value is the maximum of the arguments.\r\n   *\r\n   * arguments {number|string|BigNumber}\r\n   */\r\n  BigNumber.maximum = BigNumber.max = function () {\r\n    return maxOrMin(arguments, -1);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new BigNumber whose value is the minimum of the arguments.\r\n   *\r\n   * arguments {number|string|BigNumber}\r\n   */\r\n  BigNumber.minimum = BigNumber.min = function () {\r\n    return maxOrMin(arguments, 1);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new BigNumber with a random value equal to or greater than 0 and less than 1,\r\n   * and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing\r\n   * zeros are produced).\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n   *\r\n   * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp}'\r\n   * '[BigNumber Error] crypto unavailable'\r\n   */\r\n  BigNumber.random = (function () {\r\n    var pow2_53 = 0x20000000000000;\r\n\r\n    // Return a 53 bit integer n, where 0 <= n < 9007199254740992.\r\n    // Check if Math.random() produces more than 32 bits of randomness.\r\n    // If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits.\r\n    // 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1.\r\n    var random53bitInt = (Math.random() * pow2_53) & 0x1fffff\r\n     ? function () { return mathfloor(Math.random() * pow2_53); }\r\n     : function () { return ((Math.random() * 0x40000000 | 0) * 0x800000) +\r\n       (Math.random() * 0x800000 | 0); };\r\n\r\n    return function (dp) {\r\n      var a, b, e, k, v,\r\n        i = 0,\r\n        c = [],\r\n        rand = new BigNumber(ONE);\r\n\r\n      if (dp == null) dp = DECIMAL_PLACES;\r\n      else intCheck(dp, 0, MAX);\r\n\r\n      k = mathceil(dp / LOG_BASE);\r\n\r\n      if (CRYPTO) {\r\n\r\n        // Browsers supporting crypto.getRandomValues.\r\n        if (crypto.getRandomValues) {\r\n\r\n          a = crypto.getRandomValues(new Uint32Array(k *= 2));\r\n\r\n          for (; i < k;) {\r\n\r\n            // 53 bits:\r\n            // ((Math.pow(2, 32) - 1) * Math.pow(2, 21)).toString(2)\r\n            // 11111 11111111 11111111 11111111 11100000 00000000 00000000\r\n            // ((Math.pow(2, 32) - 1) >>> 11).toString(2)\r\n            //                                     11111 11111111 11111111\r\n            // 0x20000 is 2^21.\r\n            v = a[i] * 0x20000 + (a[i + 1] >>> 11);\r\n\r\n            // Rejection sampling:\r\n            // 0 <= v < 9007199254740992\r\n            // Probability that v >= 9e15, is\r\n            // 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251\r\n            if (v >= 9e15) {\r\n              b = crypto.getRandomValues(new Uint32Array(2));\r\n              a[i] = b[0];\r\n              a[i + 1] = b[1];\r\n            } else {\r\n\r\n              // 0 <= v <= 8999999999999999\r\n              // 0 <= (v % 1e14) <= 99999999999999\r\n              c.push(v % 1e14);\r\n              i += 2;\r\n            }\r\n          }\r\n          i = k / 2;\r\n\r\n        // Node.js supporting crypto.randomBytes.\r\n        } else if (crypto.randomBytes) {\r\n\r\n          // buffer\r\n          a = crypto.randomBytes(k *= 7);\r\n\r\n          for (; i < k;) {\r\n\r\n            // 0x1000000000000 is 2^48, 0x10000000000 is 2^40\r\n            // 0x100000000 is 2^32, 0x1000000 is 2^24\r\n            // 11111 11111111 11111111 11111111 11111111 11111111 11111111\r\n            // 0 <= v < 9007199254740992\r\n            v = ((a[i] & 31) * 0x1000000000000) + (a[i + 1] * 0x10000000000) +\r\n               (a[i + 2] * 0x100000000) + (a[i + 3] * 0x1000000) +\r\n               (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];\r\n\r\n            if (v >= 9e15) {\r\n              crypto.randomBytes(7).copy(a, i);\r\n            } else {\r\n\r\n              // 0 <= (v % 1e14) <= 99999999999999\r\n              c.push(v % 1e14);\r\n              i += 7;\r\n            }\r\n          }\r\n          i = k / 7;\r\n        } else {\r\n          CRYPTO = false;\r\n          throw Error\r\n           (bignumberError + 'crypto unavailable');\r\n        }\r\n      }\r\n\r\n      // Use Math.random.\r\n      if (!CRYPTO) {\r\n\r\n        for (; i < k;) {\r\n          v = random53bitInt();\r\n          if (v < 9e15) c[i++] = v % 1e14;\r\n        }\r\n      }\r\n\r\n      k = c[--i];\r\n      dp %= LOG_BASE;\r\n\r\n      // Convert trailing digits to zeros according to dp.\r\n      if (k && dp) {\r\n        v = POWS_TEN[LOG_BASE - dp];\r\n        c[i] = mathfloor(k / v) * v;\r\n      }\r\n\r\n      // Remove trailing elements which are zero.\r\n      for (; c[i] === 0; c.pop(), i--);\r\n\r\n      // Zero?\r\n      if (i < 0) {\r\n        c = [e = 0];\r\n      } else {\r\n\r\n        // Remove leading elements which are zero and adjust exponent accordingly.\r\n        for (e = -1 ; c[0] === 0; c.splice(0, 1), e -= LOG_BASE);\r\n\r\n        // Count the digits of the first element of c to determine leading zeros, and...\r\n        for (i = 1, v = c[0]; v >= 10; v /= 10, i++);\r\n\r\n        // adjust the exponent accordingly.\r\n        if (i < LOG_BASE) e -= LOG_BASE - i;\r\n      }\r\n\r\n      rand.e = e;\r\n      rand.c = c;\r\n      return rand;\r\n    };\r\n  })();\r\n\r\n\r\n   /*\r\n   * Return a BigNumber whose value is the sum of the arguments.\r\n   *\r\n   * arguments {number|string|BigNumber}\r\n   */\r\n  BigNumber.sum = function () {\r\n    var i = 1,\r\n      args = arguments,\r\n      sum = new BigNumber(args[0]);\r\n    for (; i < args.length;) sum = sum.plus(args[i++]);\r\n    return sum;\r\n  };\r\n\r\n\r\n  // PRIVATE FUNCTIONS\r\n\r\n\r\n  // Called by BigNumber and BigNumber.prototype.toString.\r\n  convertBase = (function () {\r\n    var decimal = '0123456789';\r\n\r\n    /*\r\n     * Convert string of baseIn to an array of numbers of baseOut.\r\n     * Eg. toBaseOut('255', 10, 16) returns [15, 15].\r\n     * Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5].\r\n     */\r\n    function toBaseOut(str, baseIn, baseOut, alphabet) {\r\n      var j,\r\n        arr = [0],\r\n        arrL,\r\n        i = 0,\r\n        len = str.length;\r\n\r\n      for (; i < len;) {\r\n        for (arrL = arr.length; arrL--; arr[arrL] *= baseIn);\r\n\r\n        arr[0] += alphabet.indexOf(str.charAt(i++));\r\n\r\n        for (j = 0; j < arr.length; j++) {\r\n\r\n          if (arr[j] > baseOut - 1) {\r\n            if (arr[j + 1] == null) arr[j + 1] = 0;\r\n            arr[j + 1] += arr[j] / baseOut | 0;\r\n            arr[j] %= baseOut;\r\n          }\r\n        }\r\n      }\r\n\r\n      return arr.reverse();\r\n    }\r\n\r\n    // Convert a numeric string of baseIn to a numeric string of baseOut.\r\n    // If the caller is toString, we are converting from base 10 to baseOut.\r\n    // If the caller is BigNumber, we are converting from baseIn to base 10.\r\n    return function (str, baseIn, baseOut, sign, callerIsToString) {\r\n      var alphabet, d, e, k, r, x, xc, y,\r\n        i = str.indexOf('.'),\r\n        dp = DECIMAL_PLACES,\r\n        rm = ROUNDING_MODE;\r\n\r\n      // Non-integer.\r\n      if (i >= 0) {\r\n        k = POW_PRECISION;\r\n\r\n        // Unlimited precision.\r\n        POW_PRECISION = 0;\r\n        str = str.replace('.', '');\r\n        y = new BigNumber(baseIn);\r\n        x = y.pow(str.length - i);\r\n        POW_PRECISION = k;\r\n\r\n        // Convert str as if an integer, then restore the fraction part by dividing the\r\n        // result by its base raised to a power.\r\n\r\n        y.c = toBaseOut(toFixedPoint(coeffToString(x.c), x.e, '0'),\r\n         10, baseOut, decimal);\r\n        y.e = y.c.length;\r\n      }\r\n\r\n      // Convert the number as integer.\r\n\r\n      xc = toBaseOut(str, baseIn, baseOut, callerIsToString\r\n       ? (alphabet = ALPHABET, decimal)\r\n       : (alphabet = decimal, ALPHABET));\r\n\r\n      // xc now represents str as an integer and converted to baseOut. e is the exponent.\r\n      e = k = xc.length;\r\n\r\n      // Remove trailing zeros.\r\n      for (; xc[--k] == 0; xc.pop());\r\n\r\n      // Zero?\r\n      if (!xc[0]) return alphabet.charAt(0);\r\n\r\n      // Does str represent an integer? If so, no need for the division.\r\n      if (i < 0) {\r\n        --e;\r\n      } else {\r\n        x.c = xc;\r\n        x.e = e;\r\n\r\n        // The sign is needed for correct rounding.\r\n        x.s = sign;\r\n        x = div(x, y, dp, rm, baseOut);\r\n        xc = x.c;\r\n        r = x.r;\r\n        e = x.e;\r\n      }\r\n\r\n      // xc now represents str converted to baseOut.\r\n\r\n      // The index of the rounding digit.\r\n      d = e + dp + 1;\r\n\r\n      // The rounding digit: the digit to the right of the digit that may be rounded up.\r\n      i = xc[d];\r\n\r\n      // Look at the rounding digits and mode to determine whether to round up.\r\n\r\n      k = baseOut / 2;\r\n      r = r || d < 0 || xc[d + 1] != null;\r\n\r\n      r = rm < 4 ? (i != null || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n            : i > k || i == k &&(rm == 4 || r || rm == 6 && xc[d - 1] & 1 ||\r\n             rm == (x.s < 0 ? 8 : 7));\r\n\r\n      // If the index of the rounding digit is not greater than zero, or xc represents\r\n      // zero, then the result of the base conversion is zero or, if rounding up, a value\r\n      // such as 0.00001.\r\n      if (d < 1 || !xc[0]) {\r\n\r\n        // 1^-dp or 0\r\n        str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0)) : alphabet.charAt(0);\r\n      } else {\r\n\r\n        // Truncate xc to the required number of decimal places.\r\n        xc.length = d;\r\n\r\n        // Round up?\r\n        if (r) {\r\n\r\n          // Rounding up may mean the previous digit has to be rounded up and so on.\r\n          for (--baseOut; ++xc[--d] > baseOut;) {\r\n            xc[d] = 0;\r\n\r\n            if (!d) {\r\n              ++e;\r\n              xc = [1].concat(xc);\r\n            }\r\n          }\r\n        }\r\n\r\n        // Determine trailing zeros.\r\n        for (k = xc.length; !xc[--k];);\r\n\r\n        // E.g. [4, 11, 15] becomes 4bf.\r\n        for (i = 0, str = ''; i <= k; str += alphabet.charAt(xc[i++]));\r\n\r\n        // Add leading zeros, decimal point and trailing zeros as required.\r\n        str = toFixedPoint(str, e, alphabet.charAt(0));\r\n      }\r\n\r\n      // The caller will add the sign.\r\n      return str;\r\n    };\r\n  })();\r\n\r\n\r\n  // Perform division in the specified base. Called by div and convertBase.\r\n  div = (function () {\r\n\r\n    // Assume non-zero x and k.\r\n    function multiply(x, k, base) {\r\n      var m, temp, xlo, xhi,\r\n        carry = 0,\r\n        i = x.length,\r\n        klo = k % SQRT_BASE,\r\n        khi = k / SQRT_BASE | 0;\r\n\r\n      for (x = x.slice(); i--;) {\r\n        xlo = x[i] % SQRT_BASE;\r\n        xhi = x[i] / SQRT_BASE | 0;\r\n        m = khi * xlo + xhi * klo;\r\n        temp = klo * xlo + ((m % SQRT_BASE) * SQRT_BASE) + carry;\r\n        carry = (temp / base | 0) + (m / SQRT_BASE | 0) + khi * xhi;\r\n        x[i] = temp % base;\r\n      }\r\n\r\n      if (carry) x = [carry].concat(x);\r\n\r\n      return x;\r\n    }\r\n\r\n    function compare(a, b, aL, bL) {\r\n      var i, cmp;\r\n\r\n      if (aL != bL) {\r\n        cmp = aL > bL ? 1 : -1;\r\n      } else {\r\n\r\n        for (i = cmp = 0; i < aL; i++) {\r\n\r\n          if (a[i] != b[i]) {\r\n            cmp = a[i] > b[i] ? 1 : -1;\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      return cmp;\r\n    }\r\n\r\n    function subtract(a, b, aL, base) {\r\n      var i = 0;\r\n\r\n      // Subtract b from a.\r\n      for (; aL--;) {\r\n        a[aL] -= i;\r\n        i = a[aL] < b[aL] ? 1 : 0;\r\n        a[aL] = i * base + a[aL] - b[aL];\r\n      }\r\n\r\n      // Remove leading zeros.\r\n      for (; !a[0] && a.length > 1; a.splice(0, 1));\r\n    }\r\n\r\n    // x: dividend, y: divisor.\r\n    return function (x, y, dp, rm, base) {\r\n      var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0,\r\n        yL, yz,\r\n        s = x.s == y.s ? 1 : -1,\r\n        xc = x.c,\r\n        yc = y.c;\r\n\r\n      // Either NaN, Infinity or 0?\r\n      if (!xc || !xc[0] || !yc || !yc[0]) {\r\n\r\n        return new BigNumber(\r\n\r\n         // Return NaN if either NaN, or both Infinity or 0.\r\n         !x.s || !y.s || (xc ? yc && xc[0] == yc[0] : !yc) ? NaN :\r\n\r\n          // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.\r\n          xc && xc[0] == 0 || !yc ? s * 0 : s / 0\r\n       );\r\n      }\r\n\r\n      q = new BigNumber(s);\r\n      qc = q.c = [];\r\n      e = x.e - y.e;\r\n      s = dp + e + 1;\r\n\r\n      if (!base) {\r\n        base = BASE;\r\n        e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE);\r\n        s = s / LOG_BASE | 0;\r\n      }\r\n\r\n      // Result exponent may be one less then the current value of e.\r\n      // The coefficients of the BigNumbers from convertBase may have trailing zeros.\r\n      for (i = 0; yc[i] == (xc[i] || 0); i++);\r\n\r\n      if (yc[i] > (xc[i] || 0)) e--;\r\n\r\n      if (s < 0) {\r\n        qc.push(1);\r\n        more = true;\r\n      } else {\r\n        xL = xc.length;\r\n        yL = yc.length;\r\n        i = 0;\r\n        s += 2;\r\n\r\n        // Normalise xc and yc so highest order digit of yc is >= base / 2.\r\n\r\n        n = mathfloor(base / (yc[0] + 1));\r\n\r\n        // Not necessary, but to handle odd bases where yc[0] == (base / 2) - 1.\r\n        // if (n > 1 || n++ == 1 && yc[0] < base / 2) {\r\n        if (n > 1) {\r\n          yc = multiply(yc, n, base);\r\n          xc = multiply(xc, n, base);\r\n          yL = yc.length;\r\n          xL = xc.length;\r\n        }\r\n\r\n        xi = yL;\r\n        rem = xc.slice(0, yL);\r\n        remL = rem.length;\r\n\r\n        // Add zeros to make remainder as long as divisor.\r\n        for (; remL < yL; rem[remL++] = 0);\r\n        yz = yc.slice();\r\n        yz = [0].concat(yz);\r\n        yc0 = yc[0];\r\n        if (yc[1] >= base / 2) yc0++;\r\n        // Not necessary, but to prevent trial digit n > base, when using base 3.\r\n        // else if (base == 3 && yc0 == 1) yc0 = 1 + 1e-15;\r\n\r\n        do {\r\n          n = 0;\r\n\r\n          // Compare divisor and remainder.\r\n          cmp = compare(yc, rem, yL, remL);\r\n\r\n          // If divisor < remainder.\r\n          if (cmp < 0) {\r\n\r\n            // Calculate trial digit, n.\r\n\r\n            rem0 = rem[0];\r\n            if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n            // n is how many times the divisor goes into the current remainder.\r\n            n = mathfloor(rem0 / yc0);\r\n\r\n            //  Algorithm:\r\n            //  product = divisor multiplied by trial digit (n).\r\n            //  Compare product and remainder.\r\n            //  If product is greater than remainder:\r\n            //    Subtract divisor from product, decrement trial digit.\r\n            //  Subtract product from remainder.\r\n            //  If product was less than remainder at the last compare:\r\n            //    Compare new remainder and divisor.\r\n            //    If remainder is greater than divisor:\r\n            //      Subtract divisor from remainder, increment trial digit.\r\n\r\n            if (n > 1) {\r\n\r\n              // n may be > base only when base is 3.\r\n              if (n >= base) n = base - 1;\r\n\r\n              // product = divisor * trial digit.\r\n              prod = multiply(yc, n, base);\r\n              prodL = prod.length;\r\n              remL = rem.length;\r\n\r\n              // Compare product and remainder.\r\n              // If product > remainder then trial digit n too high.\r\n              // n is 1 too high about 5% of the time, and is not known to have\r\n              // ever been more than 1 too high.\r\n              while (compare(prod, rem, prodL, remL) == 1) {\r\n                n--;\r\n\r\n                // Subtract divisor from product.\r\n                subtract(prod, yL < prodL ? yz : yc, prodL, base);\r\n                prodL = prod.length;\r\n                cmp = 1;\r\n              }\r\n            } else {\r\n\r\n              // n is 0 or 1, cmp is -1.\r\n              // If n is 0, there is no need to compare yc and rem again below,\r\n              // so change cmp to 1 to avoid it.\r\n              // If n is 1, leave cmp as -1, so yc and rem are compared again.\r\n              if (n == 0) {\r\n\r\n                // divisor < remainder, so n must be at least 1.\r\n                cmp = n = 1;\r\n              }\r\n\r\n              // product = divisor\r\n              prod = yc.slice();\r\n              prodL = prod.length;\r\n            }\r\n\r\n            if (prodL < remL) prod = [0].concat(prod);\r\n\r\n            // Subtract product from remainder.\r\n            subtract(rem, prod, remL, base);\r\n            remL = rem.length;\r\n\r\n             // If product was < remainder.\r\n            if (cmp == -1) {\r\n\r\n              // Compare divisor and new remainder.\r\n              // If divisor < new remainder, subtract divisor from remainder.\r\n              // Trial digit n too low.\r\n              // n is 1 too low about 5% of the time, and very rarely 2 too low.\r\n              while (compare(yc, rem, yL, remL) < 1) {\r\n                n++;\r\n\r\n                // Subtract divisor from remainder.\r\n                subtract(rem, yL < remL ? yz : yc, remL, base);\r\n                remL = rem.length;\r\n              }\r\n            }\r\n          } else if (cmp === 0) {\r\n            n++;\r\n            rem = [0];\r\n          } // else cmp === 1 and n will be 0\r\n\r\n          // Add the next digit, n, to the result array.\r\n          qc[i++] = n;\r\n\r\n          // Update the remainder.\r\n          if (rem[0]) {\r\n            rem[remL++] = xc[xi] || 0;\r\n          } else {\r\n            rem = [xc[xi]];\r\n            remL = 1;\r\n          }\r\n        } while ((xi++ < xL || rem[0] != null) && s--);\r\n\r\n        more = rem[0] != null;\r\n\r\n        // Leading zero?\r\n        if (!qc[0]) qc.splice(0, 1);\r\n      }\r\n\r\n      if (base == BASE) {\r\n\r\n        // To calculate q.e, first get the number of digits of qc[0].\r\n        for (i = 1, s = qc[0]; s >= 10; s /= 10, i++);\r\n\r\n        round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more);\r\n\r\n      // Caller is convertBase.\r\n      } else {\r\n        q.e = e;\r\n        q.r = +more;\r\n      }\r\n\r\n      return q;\r\n    };\r\n  })();\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of BigNumber n in fixed-point or exponential\r\n   * notation rounded to the specified decimal places or significant digits.\r\n   *\r\n   * n: a BigNumber.\r\n   * i: the index of the last digit required (i.e. the digit that may be rounded up).\r\n   * rm: the rounding mode.\r\n   * id: 1 (toExponential) or 2 (toPrecision).\r\n   */\r\n  function format(n, i, rm, id) {\r\n    var c0, e, ne, len, str;\r\n\r\n    if (rm == null) rm = ROUNDING_MODE;\r\n    else intCheck(rm, 0, 8);\r\n\r\n    if (!n.c) return n.toString();\r\n\r\n    c0 = n.c[0];\r\n    ne = n.e;\r\n\r\n    if (i == null) {\r\n      str = coeffToString(n.c);\r\n      str = id == 1 || id == 2 && (ne <= TO_EXP_NEG || ne >= TO_EXP_POS)\r\n       ? toExponential(str, ne)\r\n       : toFixedPoint(str, ne, '0');\r\n    } else {\r\n      n = round(new BigNumber(n), i, rm);\r\n\r\n      // n.e may have changed if the value was rounded up.\r\n      e = n.e;\r\n\r\n      str = coeffToString(n.c);\r\n      len = str.length;\r\n\r\n      // toPrecision returns exponential notation if the number of significant digits\r\n      // specified is less than the number of digits necessary to represent the integer\r\n      // part of the value in fixed-point notation.\r\n\r\n      // Exponential notation.\r\n      if (id == 1 || id == 2 && (i <= e || e <= TO_EXP_NEG)) {\r\n\r\n        // Append zeros?\r\n        for (; len < i; str += '0', len++);\r\n        str = toExponential(str, e);\r\n\r\n      // Fixed-point notation.\r\n      } else {\r\n        i -= ne + (id === 2 && e > ne);\r\n        str = toFixedPoint(str, e, '0');\r\n\r\n        // Append zeros?\r\n        if (e + 1 > len) {\r\n          if (--i > 0) for (str += '.'; i--; str += '0');\r\n        } else {\r\n          i += e - len;\r\n          if (i > 0) {\r\n            if (e + 1 == len) str += '.';\r\n            for (; i--; str += '0');\r\n          }\r\n        }\r\n      }\r\n    }\r\n\r\n    return n.s < 0 && c0 ? '-' + str : str;\r\n  }\r\n\r\n\r\n  // Handle BigNumber.max and BigNumber.min.\r\n  // If any number is NaN, return NaN.\r\n  function maxOrMin(args, n) {\r\n    var k, y,\r\n      i = 1,\r\n      x = new BigNumber(args[0]);\r\n\r\n    for (; i < args.length; i++) {\r\n      y = new BigNumber(args[i]);\r\n      if (!y.s || (k = compare(x, y)) === n || k === 0 && x.s === n) {\r\n        x = y;\r\n      }\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP.\r\n   * Called by minus, plus and times.\r\n   */\r\n  function normalise(n, c, e) {\r\n    var i = 1,\r\n      j = c.length;\r\n\r\n     // Remove trailing zeros.\r\n    for (; !c[--j]; c.pop());\r\n\r\n    // Calculate the base 10 exponent. First get the number of digits of c[0].\r\n    for (j = c[0]; j >= 10; j /= 10, i++);\r\n\r\n    // Overflow?\r\n    if ((e = i + e * LOG_BASE - 1) > MAX_EXP) {\r\n\r\n      // Infinity.\r\n      n.c = n.e = null;\r\n\r\n    // Underflow?\r\n    } else if (e < MIN_EXP) {\r\n\r\n      // Zero.\r\n      n.c = [n.e = 0];\r\n    } else {\r\n      n.e = e;\r\n      n.c = c;\r\n    }\r\n\r\n    return n;\r\n  }\r\n\r\n\r\n  // Handle values that fail the validity test in BigNumber.\r\n  parseNumeric = (function () {\r\n    var basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i,\r\n      dotAfter = /^([^.]+)\\.$/,\r\n      dotBefore = /^\\.([^.]+)$/,\r\n      isInfinityOrNaN = /^-?(Infinity|NaN)$/,\r\n      whitespaceOrPlus = /^\\s*\\+(?=[\\w.])|^\\s+|\\s+$/g;\r\n\r\n    return function (x, str, isNum, b) {\r\n      var base,\r\n        s = isNum ? str : str.replace(whitespaceOrPlus, '');\r\n\r\n      // No exception on ±Infinity or NaN.\r\n      if (isInfinityOrNaN.test(s)) {\r\n        x.s = isNaN(s) ? null : s < 0 ? -1 : 1;\r\n      } else {\r\n        if (!isNum) {\r\n\r\n          // basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i\r\n          s = s.replace(basePrefix, function (m, p1, p2) {\r\n            base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;\r\n            return !b || b == base ? p1 : m;\r\n          });\r\n\r\n          if (b) {\r\n            base = b;\r\n\r\n            // E.g. '1.' to '1', '.1' to '0.1'\r\n            s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1');\r\n          }\r\n\r\n          if (str != s) return new BigNumber(s, base);\r\n        }\r\n\r\n        // '[BigNumber Error] Not a number: {n}'\r\n        // '[BigNumber Error] Not a base {b} number: {n}'\r\n        if (BigNumber.DEBUG) {\r\n          throw Error\r\n            (bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str);\r\n        }\r\n\r\n        // NaN\r\n        x.s = null;\r\n      }\r\n\r\n      x.c = x.e = null;\r\n    }\r\n  })();\r\n\r\n\r\n  /*\r\n   * Round x to sd significant digits using rounding mode rm. Check for over/under-flow.\r\n   * If r is truthy, it is known that there are more digits after the rounding digit.\r\n   */\r\n  function round(x, sd, rm, r) {\r\n    var d, i, j, k, n, ni, rd,\r\n      xc = x.c,\r\n      pows10 = POWS_TEN;\r\n\r\n    // if x is not Infinity or NaN...\r\n    if (xc) {\r\n\r\n      // rd is the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n      // n is a base 1e14 number, the value of the element of array x.c containing rd.\r\n      // ni is the index of n within x.c.\r\n      // d is the number of digits of n.\r\n      // i is the index of rd within n including leading zeros.\r\n      // j is the actual index of rd within n (if < 0, rd is a leading zero).\r\n      out: {\r\n\r\n        // Get the number of digits of the first element of xc.\r\n        for (d = 1, k = xc[0]; k >= 10; k /= 10, d++);\r\n        i = sd - d;\r\n\r\n        // If the rounding digit is in the first element of xc...\r\n        if (i < 0) {\r\n          i += LOG_BASE;\r\n          j = sd;\r\n          n = xc[ni = 0];\r\n\r\n          // Get the rounding digit at index j of n.\r\n          rd = mathfloor(n / pows10[d - j - 1] % 10);\r\n        } else {\r\n          ni = mathceil((i + 1) / LOG_BASE);\r\n\r\n          if (ni >= xc.length) {\r\n\r\n            if (r) {\r\n\r\n              // Needed by sqrt.\r\n              for (; xc.length <= ni; xc.push(0));\r\n              n = rd = 0;\r\n              d = 1;\r\n              i %= LOG_BASE;\r\n              j = i - LOG_BASE + 1;\r\n            } else {\r\n              break out;\r\n            }\r\n          } else {\r\n            n = k = xc[ni];\r\n\r\n            // Get the number of digits of n.\r\n            for (d = 1; k >= 10; k /= 10, d++);\r\n\r\n            // Get the index of rd within n.\r\n            i %= LOG_BASE;\r\n\r\n            // Get the index of rd within n, adjusted for leading zeros.\r\n            // The number of leading zeros of n is given by LOG_BASE - d.\r\n            j = i - LOG_BASE + d;\r\n\r\n            // Get the rounding digit at index j of n.\r\n            rd = j < 0 ? 0 : mathfloor(n / pows10[d - j - 1] % 10);\r\n          }\r\n        }\r\n\r\n        r = r || sd < 0 ||\r\n\r\n        // Are there any non-zero digits after the rounding digit?\r\n        // The expression  n % pows10[d - j - 1]  returns all digits of n to the right\r\n        // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.\r\n         xc[ni + 1] != null || (j < 0 ? n : n % pows10[d - j - 1]);\r\n\r\n        r = rm < 4\r\n         ? (rd || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n         : rd > 5 || rd == 5 && (rm == 4 || r || rm == 6 &&\r\n\r\n          // Check whether the digit to the left of the rounding digit is odd.\r\n          ((i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10) & 1 ||\r\n           rm == (x.s < 0 ? 8 : 7));\r\n\r\n        if (sd < 1 || !xc[0]) {\r\n          xc.length = 0;\r\n\r\n          if (r) {\r\n\r\n            // Convert sd to decimal places.\r\n            sd -= x.e + 1;\r\n\r\n            // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n            xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE];\r\n            x.e = -sd || 0;\r\n          } else {\r\n\r\n            // Zero.\r\n            xc[0] = x.e = 0;\r\n          }\r\n\r\n          return x;\r\n        }\r\n\r\n        // Remove excess digits.\r\n        if (i == 0) {\r\n          xc.length = ni;\r\n          k = 1;\r\n          ni--;\r\n        } else {\r\n          xc.length = ni + 1;\r\n          k = pows10[LOG_BASE - i];\r\n\r\n          // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n          // j > 0 means i > number of leading zeros of n.\r\n          xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) * k : 0;\r\n        }\r\n\r\n        // Round up?\r\n        if (r) {\r\n\r\n          for (; ;) {\r\n\r\n            // If the digit to be rounded up is in the first element of xc...\r\n            if (ni == 0) {\r\n\r\n              // i will be the length of xc[0] before k is added.\r\n              for (i = 1, j = xc[0]; j >= 10; j /= 10, i++);\r\n              j = xc[0] += k;\r\n              for (k = 1; j >= 10; j /= 10, k++);\r\n\r\n              // if i != k the length has increased.\r\n              if (i != k) {\r\n                x.e++;\r\n                if (xc[0] == BASE) xc[0] = 1;\r\n              }\r\n\r\n              break;\r\n            } else {\r\n              xc[ni] += k;\r\n              if (xc[ni] != BASE) break;\r\n              xc[ni--] = 0;\r\n              k = 1;\r\n            }\r\n          }\r\n        }\r\n\r\n        // Remove trailing zeros.\r\n        for (i = xc.length; xc[--i] === 0; xc.pop());\r\n      }\r\n\r\n      // Overflow? Infinity.\r\n      if (x.e > MAX_EXP) {\r\n        x.c = x.e = null;\r\n\r\n      // Underflow? Zero.\r\n      } else if (x.e < MIN_EXP) {\r\n        x.c = [x.e = 0];\r\n      }\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  function valueOf(n) {\r\n    var str,\r\n      e = n.e;\r\n\r\n    if (e === null) return n.toString();\r\n\r\n    str = coeffToString(n.c);\r\n\r\n    str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n      ? toExponential(str, e)\r\n      : toFixedPoint(str, e, '0');\r\n\r\n    return n.s < 0 ? '-' + str : str;\r\n  }\r\n\r\n\r\n  // PROTOTYPE/INSTANCE METHODS\r\n\r\n\r\n  /*\r\n   * Return a new BigNumber whose value is the absolute value of this BigNumber.\r\n   */\r\n  P.absoluteValue = P.abs = function () {\r\n    var x = new BigNumber(this);\r\n    if (x.s < 0) x.s = 1;\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return\r\n   *   1 if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n   *   -1 if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n   *   0 if they have the same value,\r\n   *   or null if the value of either is NaN.\r\n   */\r\n  P.comparedTo = function (y, b) {\r\n    return compare(this, new BigNumber(y, b));\r\n  };\r\n\r\n\r\n  /*\r\n   * If dp is undefined or null or true or false, return the number of decimal places of the\r\n   * value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n   *\r\n   * Otherwise, if dp is a number, return a new BigNumber whose value is the value of this\r\n   * BigNumber rounded to a maximum of dp decimal places using rounding mode rm, or\r\n   * ROUNDING_MODE if rm is omitted.\r\n   *\r\n   * [dp] {number} Decimal places: integer, 0 to MAX inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n   */\r\n  P.decimalPlaces = P.dp = function (dp, rm) {\r\n    var c, n, v,\r\n      x = this;\r\n\r\n    if (dp != null) {\r\n      intCheck(dp, 0, MAX);\r\n      if (rm == null) rm = ROUNDING_MODE;\r\n      else intCheck(rm, 0, 8);\r\n\r\n      return round(new BigNumber(x), dp + x.e + 1, rm);\r\n    }\r\n\r\n    if (!(c = x.c)) return null;\r\n    n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n    // Subtract the number of trailing zeros of the last number.\r\n    if (v = c[v]) for (; v % 10 == 0; v /= 10, n--);\r\n    if (n < 0) n = 0;\r\n\r\n    return n;\r\n  };\r\n\r\n\r\n  /*\r\n   *  n / 0 = I\r\n   *  n / N = N\r\n   *  n / I = 0\r\n   *  0 / n = 0\r\n   *  0 / 0 = N\r\n   *  0 / N = N\r\n   *  0 / I = 0\r\n   *  N / n = N\r\n   *  N / 0 = N\r\n   *  N / N = N\r\n   *  N / I = N\r\n   *  I / n = I\r\n   *  I / 0 = I\r\n   *  I / N = N\r\n   *  I / I = N\r\n   *\r\n   * Return a new BigNumber whose value is the value of this BigNumber divided by the value of\r\n   * BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n   */\r\n  P.dividedBy = P.div = function (y, b) {\r\n    return div(this, new BigNumber(y, b), DECIMAL_PLACES, ROUNDING_MODE);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new BigNumber whose value is the integer part of dividing the value of this\r\n   * BigNumber by the value of BigNumber(y, b).\r\n   */\r\n  P.dividedToIntegerBy = P.idiv = function (y, b) {\r\n    return div(this, new BigNumber(y, b), 0, 1);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a BigNumber whose value is the value of this BigNumber exponentiated by n.\r\n   *\r\n   * If m is present, return the result modulo m.\r\n   * If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE.\r\n   * If POW_PRECISION is non-zero and m is not present, round to POW_PRECISION using ROUNDING_MODE.\r\n   *\r\n   * The modular power operation works efficiently when x, n, and m are integers, otherwise it\r\n   * is equivalent to calculating x.exponentiatedBy(n).modulo(m) with a POW_PRECISION of 0.\r\n   *\r\n   * n {number|string|BigNumber} The exponent. An integer.\r\n   * [m] {number|string|BigNumber} The modulus.\r\n   *\r\n   * '[BigNumber Error] Exponent not an integer: {n}'\r\n   */\r\n  P.exponentiatedBy = P.pow = function (n, m) {\r\n    var half, isModExp, i, k, more, nIsBig, nIsNeg, nIsOdd, y,\r\n      x = this;\r\n\r\n    n = new BigNumber(n);\r\n\r\n    // Allow NaN and ±Infinity, but not other non-integers.\r\n    if (n.c && !n.isInteger()) {\r\n      throw Error\r\n        (bignumberError + 'Exponent not an integer: ' + valueOf(n));\r\n    }\r\n\r\n    if (m != null) m = new BigNumber(m);\r\n\r\n    // Exponent of MAX_SAFE_INTEGER is 15.\r\n    nIsBig = n.e > 14;\r\n\r\n    // If x is NaN, ±Infinity, ±0 or ±1, or n is ±Infinity, NaN or ±0.\r\n    if (!x.c || !x.c[0] || x.c[0] == 1 && !x.e && x.c.length == 1 || !n.c || !n.c[0]) {\r\n\r\n      // The sign of the result of pow when x is negative depends on the evenness of n.\r\n      // If +n overflows to ±Infinity, the evenness of n would be not be known.\r\n      y = new BigNumber(Math.pow(+valueOf(x), nIsBig ? n.s * (2 - isOdd(n)) : +valueOf(n)));\r\n      return m ? y.mod(m) : y;\r\n    }\r\n\r\n    nIsNeg = n.s < 0;\r\n\r\n    if (m) {\r\n\r\n      // x % m returns NaN if abs(m) is zero, or m is NaN.\r\n      if (m.c ? !m.c[0] : !m.s) return new BigNumber(NaN);\r\n\r\n      isModExp = !nIsNeg && x.isInteger() && m.isInteger();\r\n\r\n      if (isModExp) x = x.mod(m);\r\n\r\n    // Overflow to ±Infinity: >=2**1e10 or >=1.0000024**1e15.\r\n    // Underflow to ±0: <=0.79**1e10 or <=0.9999975**1e15.\r\n    } else if (n.e > 9 && (x.e > 0 || x.e < -1 || (x.e == 0\r\n      // [1, 240000000]\r\n      ? x.c[0] > 1 || nIsBig && x.c[1] >= 24e7\r\n      // [80000000000000]  [99999750000000]\r\n      : x.c[0] < 8e13 || nIsBig && x.c[0] <= 9999975e7))) {\r\n\r\n      // If x is negative and n is odd, k = -0, else k = 0.\r\n      k = x.s < 0 && isOdd(n) ? -0 : 0;\r\n\r\n      // If x >= 1, k = ±Infinity.\r\n      if (x.e > -1) k = 1 / k;\r\n\r\n      // If n is negative return ±0, else return ±Infinity.\r\n      return new BigNumber(nIsNeg ? 1 / k : k);\r\n\r\n    } else if (POW_PRECISION) {\r\n\r\n      // Truncating each coefficient array to a length of k after each multiplication\r\n      // equates to truncating significant digits to POW_PRECISION + [28, 41],\r\n      // i.e. there will be a minimum of 28 guard digits retained.\r\n      k = mathceil(POW_PRECISION / LOG_BASE + 2);\r\n    }\r\n\r\n    if (nIsBig) {\r\n      half = new BigNumber(0.5);\r\n      if (nIsNeg) n.s = 1;\r\n      nIsOdd = isOdd(n);\r\n    } else {\r\n      i = Math.abs(+valueOf(n));\r\n      nIsOdd = i % 2;\r\n    }\r\n\r\n    y = new BigNumber(ONE);\r\n\r\n    // Performs 54 loop iterations for n of 9007199254740991.\r\n    for (; ;) {\r\n\r\n      if (nIsOdd) {\r\n        y = y.times(x);\r\n        if (!y.c) break;\r\n\r\n        if (k) {\r\n          if (y.c.length > k) y.c.length = k;\r\n        } else if (isModExp) {\r\n          y = y.mod(m);    //y = y.minus(div(y, m, 0, MODULO_MODE).times(m));\r\n        }\r\n      }\r\n\r\n      if (i) {\r\n        i = mathfloor(i / 2);\r\n        if (i === 0) break;\r\n        nIsOdd = i % 2;\r\n      } else {\r\n        n = n.times(half);\r\n        round(n, n.e + 1, 1);\r\n\r\n        if (n.e > 14) {\r\n          nIsOdd = isOdd(n);\r\n        } else {\r\n          i = +valueOf(n);\r\n          if (i === 0) break;\r\n          nIsOdd = i % 2;\r\n        }\r\n      }\r\n\r\n      x = x.times(x);\r\n\r\n      if (k) {\r\n        if (x.c && x.c.length > k) x.c.length = k;\r\n      } else if (isModExp) {\r\n        x = x.mod(m);    //x = x.minus(div(x, m, 0, MODULO_MODE).times(m));\r\n      }\r\n    }\r\n\r\n    if (isModExp) return y;\r\n    if (nIsNeg) y = ONE.div(y);\r\n\r\n    return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new BigNumber whose value is the value of this BigNumber rounded to an integer\r\n   * using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n   *\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {rm}'\r\n   */\r\n  P.integerValue = function (rm) {\r\n    var n = new BigNumber(this);\r\n    if (rm == null) rm = ROUNDING_MODE;\r\n    else intCheck(rm, 0, 8);\r\n    return round(n, n.e + 1, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is equal to the value of BigNumber(y, b),\r\n   * otherwise return false.\r\n   */\r\n  P.isEqualTo = P.eq = function (y, b) {\r\n    return compare(this, new BigNumber(y, b)) === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is a finite number, otherwise return false.\r\n   */\r\n  P.isFinite = function () {\r\n    return !!this.c;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n   * otherwise return false.\r\n   */\r\n  P.isGreaterThan = P.gt = function (y, b) {\r\n    return compare(this, new BigNumber(y, b)) > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is greater than or equal to the value of\r\n   * BigNumber(y, b), otherwise return false.\r\n   */\r\n  P.isGreaterThanOrEqualTo = P.gte = function (y, b) {\r\n    return (b = compare(this, new BigNumber(y, b))) === 1 || b === 0;\r\n\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is an integer, otherwise return false.\r\n   */\r\n  P.isInteger = function () {\r\n    return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n   * otherwise return false.\r\n   */\r\n  P.isLessThan = P.lt = function (y, b) {\r\n    return compare(this, new BigNumber(y, b)) < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is less than or equal to the value of\r\n   * BigNumber(y, b), otherwise return false.\r\n   */\r\n  P.isLessThanOrEqualTo = P.lte = function (y, b) {\r\n    return (b = compare(this, new BigNumber(y, b))) === -1 || b === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is NaN, otherwise return false.\r\n   */\r\n  P.isNaN = function () {\r\n    return !this.s;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is negative, otherwise return false.\r\n   */\r\n  P.isNegative = function () {\r\n    return this.s < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is positive, otherwise return false.\r\n   */\r\n  P.isPositive = function () {\r\n    return this.s > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is 0 or -0, otherwise return false.\r\n   */\r\n  P.isZero = function () {\r\n    return !!this.c && this.c[0] == 0;\r\n  };\r\n\r\n\r\n  /*\r\n   *  n - 0 = n\r\n   *  n - N = N\r\n   *  n - I = -I\r\n   *  0 - n = -n\r\n   *  0 - 0 = 0\r\n   *  0 - N = N\r\n   *  0 - I = -I\r\n   *  N - n = N\r\n   *  N - 0 = N\r\n   *  N - N = N\r\n   *  N - I = N\r\n   *  I - n = I\r\n   *  I - 0 = I\r\n   *  I - N = N\r\n   *  I - I = N\r\n   *\r\n   * Return a new BigNumber whose value is the value of this BigNumber minus the value of\r\n   * BigNumber(y, b).\r\n   */\r\n  P.minus = function (y, b) {\r\n    var i, j, t, xLTy,\r\n      x = this,\r\n      a = x.s;\r\n\r\n    y = new BigNumber(y, b);\r\n    b = y.s;\r\n\r\n    // Either NaN?\r\n    if (!a || !b) return new BigNumber(NaN);\r\n\r\n    // Signs differ?\r\n    if (a != b) {\r\n      y.s = -b;\r\n      return x.plus(y);\r\n    }\r\n\r\n    var xe = x.e / LOG_BASE,\r\n      ye = y.e / LOG_BASE,\r\n      xc = x.c,\r\n      yc = y.c;\r\n\r\n    if (!xe || !ye) {\r\n\r\n      // Either Infinity?\r\n      if (!xc || !yc) return xc ? (y.s = -b, y) : new BigNumber(yc ? x : NaN);\r\n\r\n      // Either zero?\r\n      if (!xc[0] || !yc[0]) {\r\n\r\n        // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n        return yc[0] ? (y.s = -b, y) : new BigNumber(xc[0] ? x :\r\n\r\n         // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity\r\n         ROUNDING_MODE == 3 ? -0 : 0);\r\n      }\r\n    }\r\n\r\n    xe = bitFloor(xe);\r\n    ye = bitFloor(ye);\r\n    xc = xc.slice();\r\n\r\n    // Determine which is the bigger number.\r\n    if (a = xe - ye) {\r\n\r\n      if (xLTy = a < 0) {\r\n        a = -a;\r\n        t = xc;\r\n      } else {\r\n        ye = xe;\r\n        t = yc;\r\n      }\r\n\r\n      t.reverse();\r\n\r\n      // Prepend zeros to equalise exponents.\r\n      for (b = a; b--; t.push(0));\r\n      t.reverse();\r\n    } else {\r\n\r\n      // Exponents equal. Check digit by digit.\r\n      j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b;\r\n\r\n      for (a = b = 0; b < j; b++) {\r\n\r\n        if (xc[b] != yc[b]) {\r\n          xLTy = xc[b] < yc[b];\r\n          break;\r\n        }\r\n      }\r\n    }\r\n\r\n    // x < y? Point xc to the array of the bigger number.\r\n    if (xLTy) {\r\n      t = xc;\r\n      xc = yc;\r\n      yc = t;\r\n      y.s = -y.s;\r\n    }\r\n\r\n    b = (j = yc.length) - (i = xc.length);\r\n\r\n    // Append zeros to xc if shorter.\r\n    // No need to add zeros to yc if shorter as subtract only needs to start at yc.length.\r\n    if (b > 0) for (; b--; xc[i++] = 0);\r\n    b = BASE - 1;\r\n\r\n    // Subtract yc from xc.\r\n    for (; j > a;) {\r\n\r\n      if (xc[--j] < yc[j]) {\r\n        for (i = j; i && !xc[--i]; xc[i] = b);\r\n        --xc[i];\r\n        xc[j] += BASE;\r\n      }\r\n\r\n      xc[j] -= yc[j];\r\n    }\r\n\r\n    // Remove leading zeros and adjust exponent accordingly.\r\n    for (; xc[0] == 0; xc.splice(0, 1), --ye);\r\n\r\n    // Zero?\r\n    if (!xc[0]) {\r\n\r\n      // Following IEEE 754 (2008) 6.3,\r\n      // n - n = +0  but  n - n = -0  when rounding towards -Infinity.\r\n      y.s = ROUNDING_MODE == 3 ? -1 : 1;\r\n      y.c = [y.e = 0];\r\n      return y;\r\n    }\r\n\r\n    // No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity\r\n    // for finite x and y.\r\n    return normalise(y, xc, ye);\r\n  };\r\n\r\n\r\n  /*\r\n   *   n % 0 =  N\r\n   *   n % N =  N\r\n   *   n % I =  n\r\n   *   0 % n =  0\r\n   *  -0 % n = -0\r\n   *   0 % 0 =  N\r\n   *   0 % N =  N\r\n   *   0 % I =  0\r\n   *   N % n =  N\r\n   *   N % 0 =  N\r\n   *   N % N =  N\r\n   *   N % I =  N\r\n   *   I % n =  N\r\n   *   I % 0 =  N\r\n   *   I % N =  N\r\n   *   I % I =  N\r\n   *\r\n   * Return a new BigNumber whose value is the value of this BigNumber modulo the value of\r\n   * BigNumber(y, b). The result depends on the value of MODULO_MODE.\r\n   */\r\n  P.modulo = P.mod = function (y, b) {\r\n    var q, s,\r\n      x = this;\r\n\r\n    y = new BigNumber(y, b);\r\n\r\n    // Return NaN if x is Infinity or NaN, or y is NaN or zero.\r\n    if (!x.c || !y.s || y.c && !y.c[0]) {\r\n      return new BigNumber(NaN);\r\n\r\n    // Return x if y is Infinity or x is zero.\r\n    } else if (!y.c || x.c && !x.c[0]) {\r\n      return new BigNumber(x);\r\n    }\r\n\r\n    if (MODULO_MODE == 9) {\r\n\r\n      // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n      // r = x - qy    where  0 <= r < abs(y)\r\n      s = y.s;\r\n      y.s = 1;\r\n      q = div(x, y, 0, 3);\r\n      y.s = s;\r\n      q.s *= s;\r\n    } else {\r\n      q = div(x, y, 0, MODULO_MODE);\r\n    }\r\n\r\n    y = x.minus(q.times(y));\r\n\r\n    // To match JavaScript %, ensure sign of zero is sign of dividend.\r\n    if (!y.c[0] && MODULO_MODE == 1) y.s = x.s;\r\n\r\n    return y;\r\n  };\r\n\r\n\r\n  /*\r\n   *  n * 0 = 0\r\n   *  n * N = N\r\n   *  n * I = I\r\n   *  0 * n = 0\r\n   *  0 * 0 = 0\r\n   *  0 * N = N\r\n   *  0 * I = N\r\n   *  N * n = N\r\n   *  N * 0 = N\r\n   *  N * N = N\r\n   *  N * I = N\r\n   *  I * n = I\r\n   *  I * 0 = N\r\n   *  I * N = N\r\n   *  I * I = I\r\n   *\r\n   * Return a new BigNumber whose value is the value of this BigNumber multiplied by the value\r\n   * of BigNumber(y, b).\r\n   */\r\n  P.multipliedBy = P.times = function (y, b) {\r\n    var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc,\r\n      base, sqrtBase,\r\n      x = this,\r\n      xc = x.c,\r\n      yc = (y = new BigNumber(y, b)).c;\r\n\r\n    // Either NaN, ±Infinity or ±0?\r\n    if (!xc || !yc || !xc[0] || !yc[0]) {\r\n\r\n      // Return NaN if either is NaN, or one is 0 and the other is Infinity.\r\n      if (!x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc) {\r\n        y.c = y.e = y.s = null;\r\n      } else {\r\n        y.s *= x.s;\r\n\r\n        // Return ±Infinity if either is ±Infinity.\r\n        if (!xc || !yc) {\r\n          y.c = y.e = null;\r\n\r\n        // Return ±0 if either is ±0.\r\n        } else {\r\n          y.c = [0];\r\n          y.e = 0;\r\n        }\r\n      }\r\n\r\n      return y;\r\n    }\r\n\r\n    e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE);\r\n    y.s *= x.s;\r\n    xcL = xc.length;\r\n    ycL = yc.length;\r\n\r\n    // Ensure xc points to longer array and xcL to its length.\r\n    if (xcL < ycL) {\r\n      zc = xc;\r\n      xc = yc;\r\n      yc = zc;\r\n      i = xcL;\r\n      xcL = ycL;\r\n      ycL = i;\r\n    }\r\n\r\n    // Initialise the result array with zeros.\r\n    for (i = xcL + ycL, zc = []; i--; zc.push(0));\r\n\r\n    base = BASE;\r\n    sqrtBase = SQRT_BASE;\r\n\r\n    for (i = ycL; --i >= 0;) {\r\n      c = 0;\r\n      ylo = yc[i] % sqrtBase;\r\n      yhi = yc[i] / sqrtBase | 0;\r\n\r\n      for (k = xcL, j = i + k; j > i;) {\r\n        xlo = xc[--k] % sqrtBase;\r\n        xhi = xc[k] / sqrtBase | 0;\r\n        m = yhi * xlo + xhi * ylo;\r\n        xlo = ylo * xlo + ((m % sqrtBase) * sqrtBase) + zc[j] + c;\r\n        c = (xlo / base | 0) + (m / sqrtBase | 0) + yhi * xhi;\r\n        zc[j--] = xlo % base;\r\n      }\r\n\r\n      zc[j] = c;\r\n    }\r\n\r\n    if (c) {\r\n      ++e;\r\n    } else {\r\n      zc.splice(0, 1);\r\n    }\r\n\r\n    return normalise(y, zc, e);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new BigNumber whose value is the value of this BigNumber negated,\r\n   * i.e. multiplied by -1.\r\n   */\r\n  P.negated = function () {\r\n    var x = new BigNumber(this);\r\n    x.s = -x.s || null;\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   *  n + 0 = n\r\n   *  n + N = N\r\n   *  n + I = I\r\n   *  0 + n = n\r\n   *  0 + 0 = 0\r\n   *  0 + N = N\r\n   *  0 + I = I\r\n   *  N + n = N\r\n   *  N + 0 = N\r\n   *  N + N = N\r\n   *  N + I = N\r\n   *  I + n = I\r\n   *  I + 0 = I\r\n   *  I + N = N\r\n   *  I + I = I\r\n   *\r\n   * Return a new BigNumber whose value is the value of this BigNumber plus the value of\r\n   * BigNumber(y, b).\r\n   */\r\n  P.plus = function (y, b) {\r\n    var t,\r\n      x = this,\r\n      a = x.s;\r\n\r\n    y = new BigNumber(y, b);\r\n    b = y.s;\r\n\r\n    // Either NaN?\r\n    if (!a || !b) return new BigNumber(NaN);\r\n\r\n    // Signs differ?\r\n     if (a != b) {\r\n      y.s = -b;\r\n      return x.minus(y);\r\n    }\r\n\r\n    var xe = x.e / LOG_BASE,\r\n      ye = y.e / LOG_BASE,\r\n      xc = x.c,\r\n      yc = y.c;\r\n\r\n    if (!xe || !ye) {\r\n\r\n      // Return ±Infinity if either ±Infinity.\r\n      if (!xc || !yc) return new BigNumber(a / 0);\r\n\r\n      // Either zero?\r\n      // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n      if (!xc[0] || !yc[0]) return yc[0] ? y : new BigNumber(xc[0] ? x : a * 0);\r\n    }\r\n\r\n    xe = bitFloor(xe);\r\n    ye = bitFloor(ye);\r\n    xc = xc.slice();\r\n\r\n    // Prepend zeros to equalise exponents. Faster to use reverse then do unshifts.\r\n    if (a = xe - ye) {\r\n      if (a > 0) {\r\n        ye = xe;\r\n        t = yc;\r\n      } else {\r\n        a = -a;\r\n        t = xc;\r\n      }\r\n\r\n      t.reverse();\r\n      for (; a--; t.push(0));\r\n      t.reverse();\r\n    }\r\n\r\n    a = xc.length;\r\n    b = yc.length;\r\n\r\n    // Point xc to the longer array, and b to the shorter length.\r\n    if (a - b < 0) {\r\n      t = yc;\r\n      yc = xc;\r\n      xc = t;\r\n      b = a;\r\n    }\r\n\r\n    // Only start adding at yc.length - 1 as the further digits of xc can be ignored.\r\n    for (a = 0; b;) {\r\n      a = (xc[--b] = xc[b] + yc[b] + a) / BASE | 0;\r\n      xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE;\r\n    }\r\n\r\n    if (a) {\r\n      xc = [a].concat(xc);\r\n      ++ye;\r\n    }\r\n\r\n    // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n    // ye = MAX_EXP + 1 possible\r\n    return normalise(y, xc, ye);\r\n  };\r\n\r\n\r\n  /*\r\n   * If sd is undefined or null or true or false, return the number of significant digits of\r\n   * the value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n   * If sd is true include integer-part trailing zeros in the count.\r\n   *\r\n   * Otherwise, if sd is a number, return a new BigNumber whose value is the value of this\r\n   * BigNumber rounded to a maximum of sd significant digits using rounding mode rm, or\r\n   * ROUNDING_MODE if rm is omitted.\r\n   *\r\n   * sd {number|boolean} number: significant digits: integer, 1 to MAX inclusive.\r\n   *                     boolean: whether to count integer-part trailing zeros: true or false.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n   */\r\n  P.precision = P.sd = function (sd, rm) {\r\n    var c, n, v,\r\n      x = this;\r\n\r\n    if (sd != null && sd !== !!sd) {\r\n      intCheck(sd, 1, MAX);\r\n      if (rm == null) rm = ROUNDING_MODE;\r\n      else intCheck(rm, 0, 8);\r\n\r\n      return round(new BigNumber(x), sd, rm);\r\n    }\r\n\r\n    if (!(c = x.c)) return null;\r\n    v = c.length - 1;\r\n    n = v * LOG_BASE + 1;\r\n\r\n    if (v = c[v]) {\r\n\r\n      // Subtract the number of trailing zeros of the last element.\r\n      for (; v % 10 == 0; v /= 10, n--);\r\n\r\n      // Add the number of digits of the first element.\r\n      for (v = c[0]; v >= 10; v /= 10, n++);\r\n    }\r\n\r\n    if (sd && x.e + 1 > n) n = x.e + 1;\r\n\r\n    return n;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new BigNumber whose value is the value of this BigNumber shifted by k places\r\n   * (powers of 10). Shift to the right if n > 0, and to the left if n < 0.\r\n   *\r\n   * k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive.\r\n   *\r\n   * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {k}'\r\n   */\r\n  P.shiftedBy = function (k) {\r\n    intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);\r\n    return this.times('1e' + k);\r\n  };\r\n\r\n\r\n  /*\r\n   *  sqrt(-n) =  N\r\n   *  sqrt(N) =  N\r\n   *  sqrt(-I) =  N\r\n   *  sqrt(I) =  I\r\n   *  sqrt(0) =  0\r\n   *  sqrt(-0) = -0\r\n   *\r\n   * Return a new BigNumber whose value is the square root of the value of this BigNumber,\r\n   * rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n   */\r\n  P.squareRoot = P.sqrt = function () {\r\n    var m, n, r, rep, t,\r\n      x = this,\r\n      c = x.c,\r\n      s = x.s,\r\n      e = x.e,\r\n      dp = DECIMAL_PLACES + 4,\r\n      half = new BigNumber('0.5');\r\n\r\n    // Negative/NaN/Infinity/zero?\r\n    if (s !== 1 || !c || !c[0]) {\r\n      return new BigNumber(!s || s < 0 && (!c || c[0]) ? NaN : c ? x : 1 / 0);\r\n    }\r\n\r\n    // Initial estimate.\r\n    s = Math.sqrt(+valueOf(x));\r\n\r\n    // Math.sqrt underflow/overflow?\r\n    // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n    if (s == 0 || s == 1 / 0) {\r\n      n = coeffToString(c);\r\n      if ((n.length + e) % 2 == 0) n += '0';\r\n      s = Math.sqrt(+n);\r\n      e = bitFloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n      if (s == 1 / 0) {\r\n        n = '5e' + e;\r\n      } else {\r\n        n = s.toExponential();\r\n        n = n.slice(0, n.indexOf('e') + 1) + e;\r\n      }\r\n\r\n      r = new BigNumber(n);\r\n    } else {\r\n      r = new BigNumber(s + '');\r\n    }\r\n\r\n    // Check for zero.\r\n    // r could be zero if MIN_EXP is changed after the this value was created.\r\n    // This would cause a division by zero (x/t) and hence Infinity below, which would cause\r\n    // coeffToString to throw.\r\n    if (r.c[0]) {\r\n      e = r.e;\r\n      s = e + dp;\r\n      if (s < 3) s = 0;\r\n\r\n      // Newton-Raphson iteration.\r\n      for (; ;) {\r\n        t = r;\r\n        r = half.times(t.plus(div(x, t, dp, 1)));\r\n\r\n        if (coeffToString(t.c).slice(0, s) === (n = coeffToString(r.c)).slice(0, s)) {\r\n\r\n          // The exponent of r may here be one less than the final result exponent,\r\n          // e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits\r\n          // are indexed correctly.\r\n          if (r.e < e) --s;\r\n          n = n.slice(s - 3, s + 1);\r\n\r\n          // The 4th rounding digit may be in error by -1 so if the 4 rounding digits\r\n          // are 9999 or 4999 (i.e. approaching a rounding boundary) continue the\r\n          // iteration.\r\n          if (n == '9999' || !rep && n == '4999') {\r\n\r\n            // On the first iteration only, check to see if rounding up gives the\r\n            // exact result as the nines may infinitely repeat.\r\n            if (!rep) {\r\n              round(t, t.e + DECIMAL_PLACES + 2, 0);\r\n\r\n              if (t.times(t).eq(x)) {\r\n                r = t;\r\n                break;\r\n              }\r\n            }\r\n\r\n            dp += 4;\r\n            s += 4;\r\n            rep = 1;\r\n          } else {\r\n\r\n            // If rounding digits are null, 0{0,4} or 50{0,3}, check for exact\r\n            // result. If not, then there are further digits and m will be truthy.\r\n            if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n              // Truncate to the first rounding digit.\r\n              round(r, r.e + DECIMAL_PLACES + 2, 1);\r\n              m = !r.times(r).eq(x);\r\n            }\r\n\r\n            break;\r\n          }\r\n        }\r\n      }\r\n    }\r\n\r\n    return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this BigNumber in exponential notation and\r\n   * rounded using ROUNDING_MODE to dp fixed decimal places.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n   */\r\n  P.toExponential = function (dp, rm) {\r\n    if (dp != null) {\r\n      intCheck(dp, 0, MAX);\r\n      dp++;\r\n    }\r\n    return format(this, dp, rm, 1);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this BigNumber in fixed-point notation rounding\r\n   * to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n   *\r\n   * Note: as with JavaScript's number type, (-0).toFixed(0) is '0',\r\n   * but e.g. (-0.00001).toFixed(0) is '-0'.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n   */\r\n  P.toFixed = function (dp, rm) {\r\n    if (dp != null) {\r\n      intCheck(dp, 0, MAX);\r\n      dp = dp + this.e + 1;\r\n    }\r\n    return format(this, dp, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this BigNumber in fixed-point notation rounded\r\n   * using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties\r\n   * of the format or FORMAT object (see BigNumber.set).\r\n   *\r\n   * The formatting object may contain some or all of the properties shown below.\r\n   *\r\n   * FORMAT = {\r\n   *   prefix: '',\r\n   *   groupSize: 3,\r\n   *   secondaryGroupSize: 0,\r\n   *   groupSeparator: ',',\r\n   *   decimalSeparator: '.',\r\n   *   fractionGroupSize: 0,\r\n   *   fractionGroupSeparator: '\\xA0',      // non-breaking space\r\n   *   suffix: ''\r\n   * };\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   * [format] {object} Formatting options. See FORMAT pbject above.\r\n   *\r\n   * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n   * '[BigNumber Error] Argument not an object: {format}'\r\n   */\r\n  P.toFormat = function (dp, rm, format) {\r\n    var str,\r\n      x = this;\r\n\r\n    if (format == null) {\r\n      if (dp != null && rm && typeof rm == 'object') {\r\n        format = rm;\r\n        rm = null;\r\n      } else if (dp && typeof dp == 'object') {\r\n        format = dp;\r\n        dp = rm = null;\r\n      } else {\r\n        format = FORMAT;\r\n      }\r\n    } else if (typeof format != 'object') {\r\n      throw Error\r\n        (bignumberError + 'Argument not an object: ' + format);\r\n    }\r\n\r\n    str = x.toFixed(dp, rm);\r\n\r\n    if (x.c) {\r\n      var i,\r\n        arr = str.split('.'),\r\n        g1 = +format.groupSize,\r\n        g2 = +format.secondaryGroupSize,\r\n        groupSeparator = format.groupSeparator || '',\r\n        intPart = arr[0],\r\n        fractionPart = arr[1],\r\n        isNeg = x.s < 0,\r\n        intDigits = isNeg ? intPart.slice(1) : intPart,\r\n        len = intDigits.length;\r\n\r\n      if (g2) {\r\n        i = g1;\r\n        g1 = g2;\r\n        g2 = i;\r\n        len -= i;\r\n      }\r\n\r\n      if (g1 > 0 && len > 0) {\r\n        i = len % g1 || g1;\r\n        intPart = intDigits.substr(0, i);\r\n        for (; i < len; i += g1) intPart += groupSeparator + intDigits.substr(i, g1);\r\n        if (g2 > 0) intPart += groupSeparator + intDigits.slice(i);\r\n        if (isNeg) intPart = '-' + intPart;\r\n      }\r\n\r\n      str = fractionPart\r\n       ? intPart + (format.decimalSeparator || '') + ((g2 = +format.fractionGroupSize)\r\n        ? fractionPart.replace(new RegExp('\\\\d{' + g2 + '}\\\\B', 'g'),\r\n         '$&' + (format.fractionGroupSeparator || ''))\r\n        : fractionPart)\r\n       : intPart;\r\n    }\r\n\r\n    return (format.prefix || '') + str + (format.suffix || '');\r\n  };\r\n\r\n\r\n  /*\r\n   * Return an array of two BigNumbers representing the value of this BigNumber as a simple\r\n   * fraction with an integer numerator and an integer denominator.\r\n   * The denominator will be a positive non-zero value less than or equal to the specified\r\n   * maximum denominator. If a maximum denominator is not specified, the denominator will be\r\n   * the lowest value necessary to represent the number exactly.\r\n   *\r\n   * [md] {number|string|BigNumber} Integer >= 1, or Infinity. The maximum denominator.\r\n   *\r\n   * '[BigNumber Error] Argument {not an integer|out of range} : {md}'\r\n   */\r\n  P.toFraction = function (md) {\r\n    var d, d0, d1, d2, e, exp, n, n0, n1, q, r, s,\r\n      x = this,\r\n      xc = x.c;\r\n\r\n    if (md != null) {\r\n      n = new BigNumber(md);\r\n\r\n      // Throw if md is less than one or is not an integer, unless it is Infinity.\r\n      if (!n.isInteger() && (n.c || n.s !== 1) || n.lt(ONE)) {\r\n        throw Error\r\n          (bignumberError + 'Argument ' +\r\n            (n.isInteger() ? 'out of range: ' : 'not an integer: ') + valueOf(n));\r\n      }\r\n    }\r\n\r\n    if (!xc) return new BigNumber(x);\r\n\r\n    d = new BigNumber(ONE);\r\n    n1 = d0 = new BigNumber(ONE);\r\n    d1 = n0 = new BigNumber(ONE);\r\n    s = coeffToString(xc);\r\n\r\n    // Determine initial denominator.\r\n    // d is a power of 10 and the minimum max denominator that specifies the value exactly.\r\n    e = d.e = s.length - x.e - 1;\r\n    d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp];\r\n    md = !md || n.comparedTo(d) > 0 ? (e > 0 ? d : n1) : n;\r\n\r\n    exp = MAX_EXP;\r\n    MAX_EXP = 1 / 0;\r\n    n = new BigNumber(s);\r\n\r\n    // n0 = d1 = 0\r\n    n0.c[0] = 0;\r\n\r\n    for (; ;)  {\r\n      q = div(n, d, 0, 1);\r\n      d2 = d0.plus(q.times(d1));\r\n      if (d2.comparedTo(md) == 1) break;\r\n      d0 = d1;\r\n      d1 = d2;\r\n      n1 = n0.plus(q.times(d2 = n1));\r\n      n0 = d2;\r\n      d = n.minus(q.times(d2 = d));\r\n      n = d2;\r\n    }\r\n\r\n    d2 = div(md.minus(d0), d1, 0, 1);\r\n    n0 = n0.plus(d2.times(n1));\r\n    d0 = d0.plus(d2.times(d1));\r\n    n0.s = n1.s = x.s;\r\n    e = e * 2;\r\n\r\n    // Determine which fraction is closer to x, n0/d0 or n1/d1\r\n    r = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(\r\n        div(n0, d0, e, ROUNDING_MODE).minus(x).abs()) < 1 ? [n1, d1] : [n0, d0];\r\n\r\n    MAX_EXP = exp;\r\n\r\n    return r;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the value of this BigNumber converted to a number primitive.\r\n   */\r\n  P.toNumber = function () {\r\n    return +valueOf(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this BigNumber rounded to sd significant digits\r\n   * using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits\r\n   * necessary to represent the integer part of the value in fixed-point notation, then use\r\n   * exponential notation.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n   */\r\n  P.toPrecision = function (sd, rm) {\r\n    if (sd != null) intCheck(sd, 1, MAX);\r\n    return format(this, sd, rm, 2);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this BigNumber in base b, or base 10 if b is\r\n   * omitted. If a base is specified, including base 10, round according to DECIMAL_PLACES and\r\n   * ROUNDING_MODE. If a base is not specified, and this BigNumber has a positive exponent\r\n   * that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than\r\n   * TO_EXP_NEG, return exponential notation.\r\n   *\r\n   * [b] {number} Integer, 2 to ALPHABET.length inclusive.\r\n   *\r\n   * '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n   */\r\n  P.toString = function (b) {\r\n    var str,\r\n      n = this,\r\n      s = n.s,\r\n      e = n.e;\r\n\r\n    // Infinity or NaN?\r\n    if (e === null) {\r\n      if (s) {\r\n        str = 'Infinity';\r\n        if (s < 0) str = '-' + str;\r\n      } else {\r\n        str = 'NaN';\r\n      }\r\n    } else {\r\n      if (b == null) {\r\n        str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n         ? toExponential(coeffToString(n.c), e)\r\n         : toFixedPoint(coeffToString(n.c), e, '0');\r\n      } else if (b === 10 && alphabetHasNormalDecimalDigits) {\r\n        n = round(new BigNumber(n), DECIMAL_PLACES + e + 1, ROUNDING_MODE);\r\n        str = toFixedPoint(coeffToString(n.c), n.e, '0');\r\n      } else {\r\n        intCheck(b, 2, ALPHABET.length, 'Base');\r\n        str = convertBase(toFixedPoint(coeffToString(n.c), e, '0'), 10, b, s, true);\r\n      }\r\n\r\n      if (s < 0 && n.c[0]) str = '-' + str;\r\n    }\r\n\r\n    return str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return as toString, but do not accept a base argument, and include the minus sign for\r\n   * negative zero.\r\n   */\r\n  P.valueOf = P.toJSON = function () {\r\n    return valueOf(this);\r\n  };\r\n\r\n\r\n  P._isBigNumber = true;\r\n\r\n  P[Symbol.toStringTag] = 'BigNumber';\r\n\r\n  // Node.js v10.12.0+\r\n  P[Symbol.for('nodejs.util.inspect.custom')] = P.valueOf;\r\n\r\n  if (configObject != null) BigNumber.set(configObject);\r\n\r\n  return BigNumber;\r\n}\r\n\r\n\r\n// PRIVATE HELPER FUNCTIONS\r\n\r\n// These functions don't need access to variables,\r\n// e.g. DECIMAL_PLACES, in the scope of the `clone` function above.\r\n\r\n\r\nfunction bitFloor(n) {\r\n  var i = n | 0;\r\n  return n > 0 || n === i ? i : i - 1;\r\n}\r\n\r\n\r\n// Return a coefficient array as a string of base 10 digits.\r\nfunction coeffToString(a) {\r\n  var s, z,\r\n    i = 1,\r\n    j = a.length,\r\n    r = a[0] + '';\r\n\r\n  for (; i < j;) {\r\n    s = a[i++] + '';\r\n    z = LOG_BASE - s.length;\r\n    for (; z--; s = '0' + s);\r\n    r += s;\r\n  }\r\n\r\n  // Determine trailing zeros.\r\n  for (j = r.length; r.charCodeAt(--j) === 48;);\r\n\r\n  return r.slice(0, j + 1 || 1);\r\n}\r\n\r\n\r\n// Compare the value of BigNumbers x and y.\r\nfunction compare(x, y) {\r\n  var a, b,\r\n    xc = x.c,\r\n    yc = y.c,\r\n    i = x.s,\r\n    j = y.s,\r\n    k = x.e,\r\n    l = y.e;\r\n\r\n  // Either NaN?\r\n  if (!i || !j) return null;\r\n\r\n  a = xc && !xc[0];\r\n  b = yc && !yc[0];\r\n\r\n  // Either zero?\r\n  if (a || b) return a ? b ? 0 : -j : i;\r\n\r\n  // Signs differ?\r\n  if (i != j) return i;\r\n\r\n  a = i < 0;\r\n  b = k == l;\r\n\r\n  // Either Infinity?\r\n  if (!xc || !yc) return b ? 0 : !xc ^ a ? 1 : -1;\r\n\r\n  // Compare exponents.\r\n  if (!b) return k > l ^ a ? 1 : -1;\r\n\r\n  j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n  // Compare digit by digit.\r\n  for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1;\r\n\r\n  // Compare lengths.\r\n  return k == l ? 0 : k > l ^ a ? 1 : -1;\r\n}\r\n\r\n\r\n/*\r\n * Check that n is a primitive number, an integer, and in range, otherwise throw.\r\n */\r\nfunction intCheck(n, min, max, name) {\r\n  if (n < min || n > max || n !== mathfloor(n)) {\r\n    throw Error\r\n     (bignumberError + (name || 'Argument') + (typeof n == 'number'\r\n       ? n < min || n > max ? ' out of range: ' : ' not an integer: '\r\n       : ' not a primitive number: ') + String(n));\r\n  }\r\n}\r\n\r\n\r\n// Assumes finite n.\r\nfunction isOdd(n) {\r\n  var k = n.c.length - 1;\r\n  return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0;\r\n}\r\n\r\n\r\nfunction toExponential(str, e) {\r\n  return (str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str) +\r\n   (e < 0 ? 'e' : 'e+') + e;\r\n}\r\n\r\n\r\nfunction toFixedPoint(str, e, z) {\r\n  var len, zs;\r\n\r\n  // Negative exponent?\r\n  if (e < 0) {\r\n\r\n    // Prepend zeros.\r\n    for (zs = z + '.'; ++e; zs += z);\r\n    str = zs + str;\r\n\r\n  // Positive exponent\r\n  } else {\r\n    len = str.length;\r\n\r\n    // Append zeros.\r\n    if (++e > len) {\r\n      for (zs = z, e -= len; --e; zs += z);\r\n      str += zs;\r\n    } else if (e < len) {\r\n      str = str.slice(0, e) + '.' + str.slice(e);\r\n    }\r\n  }\r\n\r\n  return str;\r\n}\r\n\r\n\r\n// EXPORT\r\n\r\n\r\nexport var BigNumber = clone();\r\n\r\nexport default BigNumber;\r\n","/**\n * Internal helpers for u64.\n * BigUint64Array is too slow as per 2026, so we implement it using\n * Uint32Array.\n * @privateRemarks TODO: re-check {@link https://issues.chromium.org/issues/42212588}\n * @module\n */\nimport type { TRet } from './utils.ts';\n\nconst U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\n\n// Split bigint into two 32-bit halves. With `le=true`, returned fields become `{ h: low, l: high\n// }` to match little-endian word order rather than the property names.\nfunction fromBig(\n  n: bigint,\n  le = false\n): {\n  h: number;\n  l: number;\n} {\n  if (le) return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n  return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };\n}\n\n// Split bigint list into `[highWords, lowWords]` when `le=false`; with `le=true`, the first array\n// holds the low halves because `fromBig(...)` swaps the semantic meaning of `h` and `l`.\nfunction split(lst: bigint[], le = false): TRet<Uint32Array[]> {\n  const len = lst.length;\n  let Ah = new Uint32Array(len);\n  let Al = new Uint32Array(len);\n  for (let i = 0; i < len; i++) {\n    const { h, l } = fromBig(lst[i], le);\n    [Ah[i], Al[i]] = [h, l];\n  }\n  return [Ah, Al] as TRet<Uint32Array[]>;\n}\n\n// Combine explicit `(high, low)` 32-bit halves into a bigint; `>>> 0` normalizes signed JS\n// bitwise results back to uint32 first, and little-endian callers must swap.\nconst toBig = (h: number, l: number): bigint => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// High 32-bit half of a 64-bit logical right shift for `s` in `0..31`.\nconst shrSH = (h: number, _l: number, s: number): number => h >>> s;\n// Low 32-bit half of a 64-bit logical right shift, valid for `s` in `1..31`.\nconst shrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// High 32-bit half of a 64-bit right rotate, valid for `s` in `1..31`.\nconst rotrSH = (h: number, l: number, s: number): number => (h >>> s) | (l << (32 - s));\n// Low 32-bit half of a 64-bit right rotate, valid for `s` in `1..31`.\nconst rotrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// High 32-bit half of a 64-bit right rotate, valid for `s` in `33..63`; `32` uses `rotr32*`.\nconst rotrBH = (h: number, l: number, s: number): number => (h << (64 - s)) | (l >>> (s - 32));\n// Low 32-bit half of a 64-bit right rotate, valid for `s` in `33..63`; `32` uses `rotr32*`.\nconst rotrBL = (h: number, l: number, s: number): number => (h >>> (s - 32)) | (l << (64 - s));\n// High 32-bit half of a 64-bit right rotate for `s === 32`; this is just the swapped low half.\nconst rotr32H = (_h: number, l: number): number => l;\n// Low 32-bit half of a 64-bit right rotate for `s === 32`; this is just the swapped high half.\nconst rotr32L = (h: number, _l: number): number => h;\n// High 32-bit half of a 64-bit left rotate, valid for `s` in `1..31`.\nconst rotlSH = (h: number, l: number, s: number): number => (h << s) | (l >>> (32 - s));\n// Low 32-bit half of a 64-bit left rotate, valid for `s` in `1..31`.\nconst rotlSL = (h: number, l: number, s: number): number => (l << s) | (h >>> (32 - s));\n// High 32-bit half of a 64-bit left rotate, valid for `s` in `33..63`; `32` uses `rotr32*`.\nconst rotlBH = (h: number, l: number, s: number): number => (l << (s - 32)) | (h >>> (64 - s));\n// Low 32-bit half of a 64-bit left rotate, valid for `s` in `33..63`; `32` uses `rotr32*`.\nconst rotlBL = (h: number, l: number, s: number): number => (h << (s - 32)) | (l >>> (64 - s));\n\n// Add two split 64-bit words and return the split `{ h, l }` sum.\n// JS uses 32-bit signed integers for bitwise operations, so we cannot simply shift the carry out\n// of the low sum and instead use division.\nfunction add(\n  Ah: number,\n  Al: number,\n  Bh: number,\n  Bl: number\n): {\n  h: number;\n  l: number;\n} {\n  const l = (Al >>> 0) + (Bl >>> 0);\n  return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\n// Unmasked low-word accumulator for 3-way addition; pass the raw result into `add3H(...)`.\nconst add3L = (Al: number, Bl: number, Cl: number): number => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\n// High-word finalize step for 3-way addition; `low` must be the untruncated output of `add3L(...)`.\nconst add3H = (low: number, Ah: number, Bh: number, Ch: number): number =>\n  (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\n// Unmasked low-word accumulator for 4-way addition; pass the raw result into `add4H(...)`.\nconst add4L = (Al: number, Bl: number, Cl: number, Dl: number): number =>\n  (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\n// High-word finalize step for 4-way addition; `low` must be the untruncated output of `add4L(...)`.\nconst add4H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number): number =>\n  (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\n// Unmasked low-word accumulator for 5-way addition; pass the raw result into `add5H(...)`.\nconst add5L = (Al: number, Bl: number, Cl: number, Dl: number, El: number): number =>\n  (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\n// High-word finalize step for 5-way addition; `low` must be the untruncated output of `add5L(...)`.\nconst add5H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number): number =>\n  (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n\n// prettier-ignore\nexport {\n  add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, rotlBH, rotlBL, rotlSH, rotlSL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, shrSH, shrSL, split, toBig\n};\n// Canonical grouped namespace for callers that prefer one object.\n// Named exports stay for direct imports.\n// prettier-ignore\nconst u64: { fromBig: typeof fromBig; split: typeof split; toBig: (h: number, l: number) => bigint; shrSH: (h: number, _l: number, s: number) => number; shrSL: (h: number, l: number, s: number) => number; rotrSH: (h: number, l: number, s: number) => number; rotrSL: (h: number, l: number, s: number) => number; rotrBH: (h: number, l: number, s: number) => number; rotrBL: (h: number, l: number, s: number) => number; rotr32H: (_h: number, l: number) => number; rotr32L: (h: number, _l: number) => number; rotlSH: (h: number, l: number, s: number) => number; rotlSL: (h: number, l: number, s: number) => number; rotlBH: (h: number, l: number, s: number) => number; rotlBL: (h: number, l: number, s: number) => number; add: typeof add; add3L: (Al: number, Bl: number, Cl: number) => number; add3H: (low: number, Ah: number, Bh: number, Ch: number) => number; add4L: (Al: number, Bl: number, Cl: number, Dl: number) => number; add4H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number) => number; add5H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number) => number; add5L: (Al: number, Bl: number, Cl: number, Dl: number, El: number) => number; } = {\n  fromBig, split, toBig,\n  shrSH, shrSL,\n  rotrSH, rotrSL, rotrBH, rotrBL,\n  rotr32H, rotr32L,\n  rotlSH, rotlSL, rotlBH, rotlBL,\n  add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\n// Default export mirrors named `u64` for compatibility with object-style imports.\nexport default u64;\n","/* global global, window */\nimport { sha3_512 as sha3 } from \"@noble/hashes/sha3.js\";\nimport BigNumber from \"bignumber.js\";\n\nconst defaultLength = 24;\nconst bigLength = 32;\n\n/**\n * A cryptographically secure random number generator that mimics Math.random()\n * Uses the Web Crypto API which is available in both modern browsers and Node.js\n * Returns a random float in the range [0, 1) just like Math.random()\n */\nconst createRandom = () => {\n  // Use globalThis.crypto which works in both Node.js and browsers\n  if (\n    typeof globalThis !== \"undefined\" &&\n    globalThis.crypto &&\n    typeof globalThis.crypto.getRandomValues === \"function\"\n  ) {\n    return () => {\n      // Generate a random 32-bit unsigned integer\n      const buffer = new Uint32Array(1);\n      globalThis.crypto.getRandomValues(buffer);\n      // Convert to a float in [0, 1) by dividing by 2^32\n      return buffer[0] / 0x100000000;\n    };\n  }\n  // Fallback to Math.random if crypto is not available\n  return Math.random;\n};\n\nconst random = createRandom();\n\nconst createEntropy = (length = 4, rand = random) => {\n  let entropy = \"\";\n\n  while (entropy.length < length) {\n    entropy = entropy + Math.floor(rand() * 36).toString(36);\n  }\n  return entropy;\n};\n\n/*\n * Adapted from https://github.com/juanelas/bigint-conversion\n * MIT License Copyright (c) 2018 Juan Hernández Serrano\n */\nfunction bufToBigInt(buf) {\n  let value = new BigNumber(0);\n\n  for (const i of buf.values()) {\n    // Multiply by 256 (left shift by 8 bits) and add the current byte\n    value = value.multipliedBy(256).plus(i);\n  }\n  return value;\n}\n\nconst hash = (input = \"\") => {\n  // Drop the first character because it will bias the histogram\n  // to the left.\n  const encoder = new TextEncoder();\n  return bufToBigInt(sha3(encoder.encode(input)))\n    .toString(36)\n    .slice(1);\n};\n\nconst alphabet = Array.from({ length: 26 }, (x, i) =>\n  String.fromCharCode(i + 97),\n);\n\nconst randomLetter = (rand) => alphabet[Math.floor(rand() * alphabet.length)];\n\n/*\nThis is a fingerprint of the host environment. It is used to help\nprevent collisions when generating ids in a distributed system.\nIf no global object is available, you can pass in your own, or fall back\non a random string.\n*/\nconst createFingerprint = ({\n  globalObj = typeof global !== \"undefined\"\n    ? global\n    : typeof window !== \"undefined\"\n      ? window\n      : {},\n  random: rand = random,\n} = {}) => {\n  const globals = Object.keys(globalObj).toString();\n  const sourceString = globals.length\n    ? globals + createEntropy(bigLength, rand)\n    : createEntropy(bigLength, rand);\n\n  return hash(sourceString).substring(0, bigLength);\n};\n\nconst createCounter = (count) => () => {\n  return count++;\n};\n\n// ~22k hosts before 50% chance of initial counter collision\n// with a remaining counter range of 9.0e+15 in JavaScript.\nconst initialCountMax = 476782367;\n\nconst init = ({\n  // Fallback if the user does not pass in a CSPRNG. This should be OK\n  // because we don't rely solely on the random number generator for entropy.\n  // We also use the host fingerprint, current time, and a session counter.\n  random: rand = random,\n  counter = createCounter(Math.floor(rand() * initialCountMax)),\n  length = defaultLength,\n  fingerprint = createFingerprint({ random: rand }),\n} = {}) => {\n  if (length > bigLength) {\n    throw new Error(\n      `Length must be between 2 and ${bigLength}. Received: ${length}`,\n    );\n  }\n  return function cuid2() {\n    const firstLetter = randomLetter(rand);\n\n    // If we're lucky, the `.toString(36)` calls may reduce hashing rounds\n    // by shortening the input to the hash function a little.\n    const time = Date.now().toString(36);\n    const count = counter().toString(36);\n\n    // The salt should be long enough to be globally unique across the full\n    // length of the hash. For simplicity, we use the same length as the\n    // intended id output.\n    const salt = createEntropy(length, rand);\n    const hashInput = `${time + salt + count + fingerprint}`;\n\n    return `${firstLetter + hash(hashInput).substring(1, length)}`;\n  };\n};\n\nconst createId = lazy(init);\nfunction lazy(fn) {\n  let initialized;\n  return () => {\n    if (!initialized) {\n      initialized = fn();\n    }\n    return initialized();\n  };\n}\n\nconst isCuid = (\n  id,\n  { minLength = 2, maxLength = bigLength, length = id?.length } = {},\n) => {\n  const regex = /^[a-z][0-9a-z]+$/;\n\n  return (\n    typeof id === \"string\" &&\n    length >= minLength &&\n    length <= maxLength &&\n    regex.test(id)\n  );\n};\n\nexport const getConstants = () => ({ defaultLength, bigLength });\nexport { init };\nexport { createId };\nexport { bufToBigInt };\nexport { createCounter };\nexport { createFingerprint };\nexport { isCuid };\n","/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n/**\n * Bytes API type helpers for old + new TypeScript.\n *\n * TS 5.6 has `Uint8Array`, while TS 5.9+ made it generic `Uint8Array<ArrayBuffer>`.\n * We can't use specific return type, because TS 5.6 will error.\n * We can't use generic return type, because most TS 5.9 software will expect specific type.\n *\n * Maps typed-array input leaves to broad forms.\n * These are compatibility adapters, not ownership guarantees.\n *\n * - `TArg` keeps byte inputs broad.\n * - `TRet` marks byte outputs for TS 5.6 and TS 5.9+ compatibility.\n */\nexport type TypedArg<T> = T extends BigInt64Array\n  ? BigInt64Array\n  : T extends BigUint64Array\n    ? BigUint64Array\n    : T extends Float32Array\n      ? Float32Array\n      : T extends Float64Array\n        ? Float64Array\n        : T extends Int16Array\n          ? Int16Array\n          : T extends Int32Array\n            ? Int32Array\n            : T extends Int8Array\n              ? Int8Array\n              : T extends Uint16Array\n                ? Uint16Array\n                : T extends Uint32Array\n                  ? Uint32Array\n                  : T extends Uint8ClampedArray\n                    ? Uint8ClampedArray\n                    : T extends Uint8Array\n                      ? Uint8Array\n                      : never;\n/** Maps typed-array output leaves to narrow TS-compatible forms. */\nexport type TypedRet<T> = T extends BigInt64Array\n  ? ReturnType<typeof BigInt64Array.of>\n  : T extends BigUint64Array\n    ? ReturnType<typeof BigUint64Array.of>\n    : T extends Float32Array\n      ? ReturnType<typeof Float32Array.of>\n      : T extends Float64Array\n        ? ReturnType<typeof Float64Array.of>\n        : T extends Int16Array\n          ? ReturnType<typeof Int16Array.of>\n          : T extends Int32Array\n            ? ReturnType<typeof Int32Array.of>\n            : T extends Int8Array\n              ? ReturnType<typeof Int8Array.of>\n              : T extends Uint16Array\n                ? ReturnType<typeof Uint16Array.of>\n                : T extends Uint32Array\n                  ? ReturnType<typeof Uint32Array.of>\n                  : T extends Uint8ClampedArray\n                    ? ReturnType<typeof Uint8ClampedArray.of>\n                    : T extends Uint8Array\n                      ? ReturnType<typeof Uint8Array.of>\n                      : never;\n/** Recursively adapts byte-carrying API input types. See {@link TypedArg}. */\nexport type TArg<T> =\n  | T\n  | ([TypedArg<T>] extends [never]\n      ? T extends (...args: infer A) => infer R\n        ? ((...args: { [K in keyof A]: TRet<A[K]> }) => TArg<R>) & {\n            [K in keyof T]: T[K] extends (...args: any) => any ? T[K] : TArg<T[K]>;\n          }\n        : T extends [infer A, ...infer R]\n          ? [TArg<A>, ...{ [K in keyof R]: TArg<R[K]> }]\n          : T extends readonly [infer A, ...infer R]\n            ? readonly [TArg<A>, ...{ [K in keyof R]: TArg<R[K]> }]\n            : T extends (infer A)[]\n              ? TArg<A>[]\n              : T extends readonly (infer A)[]\n                ? readonly TArg<A>[]\n                : T extends Promise<infer A>\n                  ? Promise<TArg<A>>\n                  : T extends object\n                    ? { [K in keyof T]: TArg<T[K]> }\n                    : T\n      : TypedArg<T>);\n/** Recursively adapts byte-carrying API output types. See {@link TypedArg}. */\nexport type TRet<T> = T extends unknown\n  ? T &\n      ([TypedRet<T>] extends [never]\n        ? T extends (...args: infer A) => infer R\n          ? ((...args: { [K in keyof A]: TArg<A[K]> }) => TRet<R>) & {\n              [K in keyof T]: T[K] extends (...args: any) => any ? T[K] : TRet<T[K]>;\n            }\n          : T extends [infer A, ...infer R]\n            ? [TRet<A>, ...{ [K in keyof R]: TRet<R[K]> }]\n            : T extends readonly [infer A, ...infer R]\n              ? readonly [TRet<A>, ...{ [K in keyof R]: TRet<R[K]> }]\n              : T extends (infer A)[]\n                ? TRet<A>[]\n                : T extends readonly (infer A)[]\n                  ? readonly TRet<A>[]\n                  : T extends Promise<infer A>\n                    ? Promise<TRet<A>>\n                    : T extends object\n                      ? { [K in keyof T]: TRet<T[K]> }\n                      : T\n        : TypedRet<T>)\n  : never;\n/**\n * Checks if something is Uint8Array. Be careful: nodejs Buffer will return true.\n * @param a - value to test\n * @returns `true` when the value is a Uint8Array-compatible view.\n * @example\n * Check whether a value is a Uint8Array-compatible view.\n * ```ts\n * isBytes(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport function isBytes(a: unknown): a is Uint8Array {\n  // Plain `instanceof Uint8Array` is too strict for some Buffer / proxy / cross-realm cases.\n  // The fallback still requires a real ArrayBuffer view, so plain\n  // JSON-deserialized `{ constructor: ... }` spoofing is rejected, and\n  // `BYTES_PER_ELEMENT === 1` keeps the fallback on byte-oriented views.\n  return (\n    a instanceof Uint8Array ||\n    (ArrayBuffer.isView(a) &&\n      a.constructor.name === 'Uint8Array' &&\n      'BYTES_PER_ELEMENT' in a &&\n      a.BYTES_PER_ELEMENT === 1)\n  );\n}\n\n/**\n * Asserts something is a non-negative integer.\n * @param n - number to validate\n * @param title - label included in thrown errors\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Validate a non-negative integer option.\n * ```ts\n * anumber(32, 'length');\n * ```\n */\nexport function anumber(n: number, title: string = ''): void {\n  if (typeof n !== 'number') {\n    const prefix = title && `\"${title}\" `;\n    throw new TypeError(`${prefix}expected number, got ${typeof n}`);\n  }\n  if (!Number.isSafeInteger(n) || n < 0) {\n    const prefix = title && `\"${title}\" `;\n    throw new RangeError(`${prefix}expected integer >= 0, got ${n}`);\n  }\n}\n\n/**\n * Asserts something is Uint8Array.\n * @param value - value to validate\n * @param length - optional exact length constraint\n * @param title - label included in thrown errors\n * @returns The validated byte array.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Validate that a value is a byte array.\n * ```ts\n * abytes(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport function abytes(\n  value: TArg<Uint8Array>,\n  length?: number,\n  title: string = ''\n): TRet<Uint8Array> {\n  const bytes = isBytes(value);\n  const len = value?.length;\n  const needsLen = length !== undefined;\n  if (!bytes || (needsLen && len !== length)) {\n    const prefix = title && `\"${title}\" `;\n    const ofLen = needsLen ? ` of length ${length}` : '';\n    const got = bytes ? `length=${len}` : `type=${typeof value}`;\n    const message = prefix + 'expected Uint8Array' + ofLen + ', got ' + got;\n    if (!bytes) throw new TypeError(message);\n    throw new RangeError(message);\n  }\n  return value as TRet<Uint8Array>;\n}\n\n/**\n * Copies bytes into a fresh Uint8Array.\n * Buffer-style slices can alias the same backing store, so callers that need ownership should copy.\n * @param bytes - source bytes to clone\n * @returns Freshly allocated copy of `bytes`.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Clone a byte array before mutating it.\n * ```ts\n * const copy = copyBytes(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport function copyBytes(bytes: TArg<Uint8Array>): TRet<Uint8Array> {\n  // `Uint8Array.from(...)` would also accept arrays / other typed arrays. Keep this helper strict\n  // because callers use it at byte-validation boundaries before mutating the detached copy.\n  return Uint8Array.from(abytes(bytes)) as TRet<Uint8Array>;\n}\n\n/**\n * Asserts something is a wrapped hash constructor.\n * @param h - hash constructor to validate\n * @throws On wrong argument types or invalid hash wrapper shape. {@link TypeError}\n * @throws On invalid hash metadata ranges or values. {@link RangeError}\n * @throws If the hash metadata allows empty outputs or block sizes. {@link Error}\n * @example\n * Validate a callable hash wrapper.\n * ```ts\n * import { ahash } from '@noble/hashes/utils.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * ahash(sha256);\n * ```\n */\nexport function ahash(h: TArg<CHash>): void {\n  if (typeof h !== 'function' || typeof h.create !== 'function')\n    throw new TypeError('Hash must wrapped by utils.createHasher');\n  anumber(h.outputLen);\n  anumber(h.blockLen);\n  // HMAC and KDF callers treat these as real byte lengths; allowing zero lets fake wrappers pass\n  // validation and can produce empty outputs instead of failing fast.\n  if (h.outputLen < 1) throw new Error('\"outputLen\" must be >= 1');\n  if (h.blockLen < 1) throw new Error('\"blockLen\" must be >= 1');\n}\n\n/**\n * Asserts a hash instance has not been destroyed or finished.\n * @param instance - hash instance to validate\n * @param checkFinished - whether to reject finalized instances\n * @throws If the hash instance has already been destroyed or finalized. {@link Error}\n * @example\n * Validate that a hash instance is still usable.\n * ```ts\n * import { aexists } from '@noble/hashes/utils.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * const hash = sha256.create();\n * aexists(hash);\n * ```\n */\nexport function aexists(instance: any, checkFinished = true): void {\n  if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n  if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\n\n/**\n * Asserts output is a sufficiently-sized byte array.\n * @param out - destination buffer\n * @param instance - hash instance providing output length\n * Oversized buffers are allowed; downstream code only promises to fill the first `outputLen` bytes.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Validate a caller-provided digest buffer.\n * ```ts\n * import { aoutput } from '@noble/hashes/utils.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * const hash = sha256.create();\n * aoutput(new Uint8Array(hash.outputLen), hash);\n * ```\n */\nexport function aoutput(out: any, instance: any): void {\n  abytes(out, undefined, 'digestInto() output');\n  const min = instance.outputLen;\n  if (out.length < min) {\n    throw new RangeError('\"digestInto() output\" expected to be of length >=' + min);\n  }\n}\n\n/** Generic type encompassing 8/16/32-byte array views, but not 64-bit variants. */\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n  Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n/**\n * Casts a typed array view to Uint8Array.\n * @param arr - source typed array\n * @returns Uint8Array view over the same buffer.\n * @example\n * Reinterpret a typed array as bytes.\n * ```ts\n * u8(new Uint32Array([1, 2]));\n * ```\n */\nexport function u8(arr: TArg<TypedArray>): TRet<Uint8Array> {\n  return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength) as TRet<Uint8Array>;\n}\n\n/**\n * Casts a typed array view to Uint32Array.\n * `arr.byteOffset` must already be 4-byte aligned or the platform\n * Uint32Array constructor will throw.\n * @param arr - source typed array\n * @returns Uint32Array view over the same buffer.\n * @example\n * Reinterpret a byte array as 32-bit words.\n * ```ts\n * u32(new Uint8Array(8));\n * ```\n */\nexport function u32(arr: TArg<TypedArray>): TRet<Uint32Array> {\n  return new Uint32Array(\n    arr.buffer,\n    arr.byteOffset,\n    Math.floor(arr.byteLength / 4)\n  ) as TRet<Uint32Array>;\n}\n\n/**\n * Zeroizes typed arrays in place. Warning: JS provides no guarantees.\n * @param arrays - arrays to overwrite with zeros\n * @example\n * Zeroize sensitive buffers in place.\n * ```ts\n * clean(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport function clean(...arrays: TArg<TypedArray[]>): void {\n  for (let i = 0; i < arrays.length; i++) {\n    arrays[i].fill(0);\n  }\n}\n\n/**\n * Creates a DataView for byte-level manipulation.\n * @param arr - source typed array\n * @returns DataView over the same buffer region.\n * @example\n * Create a DataView over an existing buffer.\n * ```ts\n * createView(new Uint8Array(4));\n * ```\n */\nexport function createView(arr: TArg<TypedArray>): DataView {\n  return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/**\n * Rotate-right operation for uint32 values.\n * @param word - source word\n * @param shift - shift amount in bits\n * @returns Rotated word.\n * @example\n * Rotate a 32-bit word to the right.\n * ```ts\n * rotr(0x12345678, 8);\n * ```\n */\nexport function rotr(word: number, shift: number): number {\n  return (word << (32 - shift)) | (word >>> shift);\n}\n\n/**\n * Rotate-left operation for uint32 values.\n * @param word - source word\n * @param shift - shift amount in bits\n * @returns Rotated word.\n * @example\n * Rotate a 32-bit word to the left.\n * ```ts\n * rotl(0x12345678, 8);\n * ```\n */\nexport function rotl(word: number, shift: number): number {\n  return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n\n/** Whether the current platform is little-endian. */\nexport const isLE: boolean = /* @__PURE__ */ (() =>\n  new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n\n/**\n * Byte-swap operation for uint32 values.\n * @param word - source word\n * @returns Word with reversed byte order.\n * @example\n * Reverse the byte order of a 32-bit word.\n * ```ts\n * byteSwap(0x11223344);\n * ```\n */\nexport function byteSwap(word: number): number {\n  return (\n    ((word << 24) & 0xff000000) |\n    ((word << 8) & 0xff0000) |\n    ((word >>> 8) & 0xff00) |\n    ((word >>> 24) & 0xff)\n  );\n}\n/**\n * Conditionally byte-swaps one 32-bit word on big-endian platforms.\n * @param n - source word\n * @returns Original or byte-swapped word depending on platform endianness.\n * @example\n * Normalize a 32-bit word for host endianness.\n * ```ts\n * swap8IfBE(0x11223344);\n * ```\n */\nexport const swap8IfBE: (n: number) => number = isLE\n  ? (n: number) => n\n  : (n: number) => byteSwap(n) >>> 0;\n\n/**\n * Byte-swaps every word of a Uint32Array in place.\n * @param arr - array to mutate\n * @returns The same array after mutation; callers pass live state arrays here.\n * @example\n * Reverse the byte order of every word in place.\n * ```ts\n * byteSwap32(new Uint32Array([0x11223344]));\n * ```\n */\nexport function byteSwap32(arr: TArg<Uint32Array>): TRet<Uint32Array> {\n  for (let i = 0; i < arr.length; i++) {\n    arr[i] = byteSwap(arr[i]);\n  }\n  return arr as TRet<Uint32Array>;\n}\n\n/**\n * Conditionally byte-swaps a Uint32Array on big-endian platforms.\n * @param u - array to normalize for host endianness\n * @returns Original or byte-swapped array depending on platform endianness.\n *   On big-endian runtimes this mutates `u` in place via `byteSwap32(...)`.\n * @example\n * Normalize a word array for host endianness.\n * ```ts\n * swap32IfBE(new Uint32Array([0x11223344]));\n * ```\n */\nexport const swap32IfBE: (u: TArg<Uint32Array>) => TRet<Uint32Array> = isLE\n  ? (u: TArg<Uint32Array>) => u as TRet<Uint32Array>\n  : byteSwap32;\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin: boolean = /* @__PURE__ */ (() =>\n  // @ts-ignore\n  typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n  i.toString(16).padStart(2, '0')\n);\n\n/**\n * Convert byte array to hex string.\n * Uses the built-in function when available and assumes it matches the tested\n * fallback semantics.\n * @param bytes - bytes to encode\n * @returns Lowercase hexadecimal string.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Convert bytes to lowercase hexadecimal.\n * ```ts\n * bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])); // 'cafe0123'\n * ```\n */\nexport function bytesToHex(bytes: TArg<Uint8Array>): string {\n  abytes(bytes);\n  // @ts-ignore\n  if (hasHexBuiltin) return bytes.toHex();\n  // pre-caching improves the speed 6x\n  let hex = '';\n  for (let i = 0; i < bytes.length; i++) {\n    hex += hexes[bytes[i]];\n  }\n  return hex;\n}\n\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 } as const;\nfunction asciiToBase16(ch: number): number | undefined {\n  if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48\n  if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n  if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n  return;\n}\n\n/**\n * Convert hex string to byte array. Uses built-in function, when available.\n * @param hex - hexadecimal string to decode\n * @returns Decoded bytes.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Decode lowercase hexadecimal into bytes.\n * ```ts\n * hexToBytes('cafe0123'); // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n * ```\n */\nexport function hexToBytes(hex: string): TRet<Uint8Array> {\n  if (typeof hex !== 'string') throw new TypeError('hex string expected, got ' + typeof hex);\n  if (hasHexBuiltin) {\n    try {\n      return (Uint8Array as any).fromHex(hex);\n    } catch (error) {\n      if (error instanceof SyntaxError) throw new RangeError(error.message);\n      throw error;\n    }\n  }\n  const hl = hex.length;\n  const al = hl / 2;\n  if (hl % 2) throw new RangeError('hex string expected, got unpadded hex of length ' + hl);\n  const array = new Uint8Array(al);\n  for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n    const n1 = asciiToBase16(hex.charCodeAt(hi));\n    const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n    if (n1 === undefined || n2 === undefined) {\n      const char = hex[hi] + hex[hi + 1];\n      throw new RangeError(\n        'hex string expected, got non-hex character \"' + char + '\" at index ' + hi\n      );\n    }\n    array[ai] = n1 * 16 + n2; // multiply first octet, e.g. 'a3' => 10*16+3 => 160 + 3 => 163\n  }\n  return array;\n}\n\n/**\n * There is no setImmediate in browser and setTimeout is slow.\n * This yields to the Promise/microtask scheduler queue, not to timers or the\n * full macrotask event loop.\n * @example\n * Yield to the next scheduler tick.\n * ```ts\n * await nextTick();\n * ```\n */\nexport const nextTick = async (): Promise<void> => {};\n\n/**\n * Returns control to the Promise/microtask scheduler every `tick`\n * milliseconds to avoid blocking long loops.\n * @param iters - number of loop iterations to run\n * @param tick - maximum time slice in milliseconds\n * @param cb - callback executed on each iteration\n * @example\n * Run a loop that periodically yields back to the event loop.\n * ```ts\n * await asyncLoop(2, 0, () => {});\n * ```\n */\nexport async function asyncLoop(\n  iters: number,\n  tick: number,\n  cb: (i: number) => void\n): Promise<void> {\n  let ts = Date.now();\n  for (let i = 0; i < iters; i++) {\n    cb(i);\n    // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n    const diff = Date.now() - ts;\n    if (diff >= 0 && diff < tick) continue;\n    await nextTick();\n    ts += diff;\n  }\n}\n\n// Global symbols, but ts doesn't see them: https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * Non-ASCII details are delegated to the platform `TextEncoder`.\n * @param str - string to encode\n * @returns UTF-8 encoded bytes.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Encode a string as UTF-8 bytes.\n * ```ts\n * utf8ToBytes('abc'); // Uint8Array.from([97, 98, 99])\n * ```\n */\nexport function utf8ToBytes(str: string): TRet<Uint8Array> {\n  if (typeof str !== 'string') throw new TypeError('string expected');\n  return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n/** KDFs can accept string or Uint8Array for user convenience. */\nexport type KDFInput = string | Uint8Array;\n\n/**\n * Helper for KDFs: consumes Uint8Array or string.\n * String inputs are UTF-8 encoded; byte-array inputs stay aliased to the caller buffer.\n * @param data - user-provided KDF input\n * @param errorTitle - label included in thrown errors\n * @returns Byte representation of the input.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Normalize KDF input to bytes.\n * ```ts\n * kdfInputToBytes('password');\n * ```\n */\nexport function kdfInputToBytes(data: TArg<KDFInput>, errorTitle = ''): TRet<Uint8Array> {\n  if (typeof data === 'string') return utf8ToBytes(data);\n  return abytes(data, undefined, errorTitle);\n}\n\n/**\n * Copies several Uint8Arrays into one.\n * @param arrays - arrays to concatenate\n * @returns Concatenated byte array.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Concatenate multiple byte arrays.\n * ```ts\n * concatBytes(new Uint8Array([1]), new Uint8Array([2]));\n * ```\n */\nexport function concatBytes(...arrays: TArg<Uint8Array[]>): TRet<Uint8Array> {\n  let sum = 0;\n  for (let i = 0; i < arrays.length; i++) {\n    const a = arrays[i];\n    abytes(a);\n    sum += a.length;\n  }\n  const res = new Uint8Array(sum);\n  for (let i = 0, pad = 0; i < arrays.length; i++) {\n    const a = arrays[i];\n    res.set(a, pad);\n    pad += a.length;\n  }\n  return res;\n}\n\ntype EmptyObj = {};\n/**\n * Merges default options and passed options.\n * @param defaults - base option object\n * @param opts - user overrides\n * @returns Merged option object. The merge mutates `defaults` in place.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Merge user overrides onto default options.\n * ```ts\n * checkOpts({ dkLen: 32 }, { asyncTick: 10 });\n * ```\n */\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n  defaults: T1,\n  opts?: T2\n): T1 & T2 {\n  if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n    throw new TypeError('options must be object or undefined');\n  const merged = Object.assign(defaults, opts);\n  return merged as T1 & T2;\n}\n\n/** Common interface for all hash instances. */\nexport interface Hash<T> {\n  /** Bytes processed per compression block. */\n  blockLen: number;\n  /** Bytes produced by `digest()`. */\n  outputLen: number;\n  /** Whether the instance supports XOF-style variable-length output via `xof()` / `xofInto()`. */\n  canXOF: boolean;\n  /**\n   * Absorbs more message bytes into the running hash state.\n   * @param buf - message chunk to absorb\n   * @returns The same hash instance for chaining.\n   */\n  update(buf: TArg<Uint8Array>): this;\n  /**\n   * Finalizes the hash into a caller-provided buffer.\n   * @param buf - destination buffer\n   * @returns Nothing. Implementations write into `buf` in place.\n   */\n  digestInto(buf: TArg<Uint8Array>): void;\n  /**\n   * Finalizes the hash and returns a freshly allocated digest.\n   * @returns Digest bytes.\n   */\n  digest(): TRet<Uint8Array>;\n  /** Wipes internal state and makes the instance unusable. */\n  destroy(): void;\n  /**\n   * Copies the current hash state into an existing or new instance.\n   * @param to - Optional destination instance to reuse.\n   * @returns Cloned hash state.\n   */\n  _cloneInto(to?: T): T;\n  /**\n   * Creates an independent copy of the current hash state.\n   * @returns Cloned hash instance.\n   */\n  clone(): T;\n}\n\n/** Pseudorandom generator interface. */\nexport interface PRG {\n  /**\n   * Mixes more entropy into the generator state.\n   * @param seed - fresh entropy bytes\n   * @returns Nothing. Implementations update internal state in place.\n   */\n  addEntropy(seed: TArg<Uint8Array>): void;\n  /**\n   * Generates pseudorandom output bytes.\n   * @param length - number of bytes to generate\n   * @returns Generated pseudorandom bytes.\n   */\n  randomBytes(length: number): TRet<Uint8Array>;\n  /** Wipes generator state and makes the instance unusable. */\n  clean(): void;\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n  /**\n   * Reads more bytes from the XOF stream.\n   * @param bytes - number of bytes to read\n   * @returns Requested digest bytes.\n   */\n  xof(bytes: number): TRet<Uint8Array>;\n  /**\n   * Reads more bytes from the XOF stream into a caller-provided buffer.\n   * @param buf - destination buffer\n   * @returns Filled output buffer.\n   */\n  xofInto(buf: TArg<Uint8Array>): TRet<Uint8Array>;\n};\n\n/** Hash constructor or factory type. */\nexport type HasherCons<T, Opts = undefined> = Opts extends undefined ? () => T : (opts?: Opts) => T;\n/** Optional hash metadata. */\nexport type HashInfo = {\n  /** DER-encoded object identifier bytes for the hash algorithm. */\n  oid?: TRet<Uint8Array>;\n};\n/** Callable hash function type. */\nexport type CHash<T extends Hash<T> = Hash<any>, Opts = undefined> = {\n  /** Digest size in bytes. */\n  outputLen: number;\n  /** Input block size in bytes. */\n  blockLen: number;\n  /** Whether `.create()` returns a hash instance that can be used as an XOF stream. */\n  canXOF: boolean;\n} & HashInfo &\n  (Opts extends undefined\n    ? {\n        (msg: TArg<Uint8Array>): TRet<Uint8Array>;\n        create(): T;\n      }\n    : {\n        (msg: TArg<Uint8Array>, opts?: TArg<Opts>): TRet<Uint8Array>;\n        create(opts?: Opts): T;\n      });\n/** Callable extendable-output hash function type. */\nexport type CHashXOF<T extends HashXOF<T> = HashXOF<any>, Opts = undefined> = CHash<T, Opts>;\n\n/**\n * Creates a callable hash function from a stateful class constructor.\n * @param hashCons - hash constructor or factory\n * @param info - optional metadata such as DER OID\n * @returns Frozen callable hash wrapper with `.create()`.\n *   Wrapper construction eagerly calls `hashCons(undefined)` once to read\n *   `outputLen` / `blockLen`, so constructor side effects happen at module\n *   init time.\n * @example\n * Wrap a stateful hash constructor into a callable helper.\n * ```ts\n * import { createHasher } from '@noble/hashes/utils.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * const wrapped = createHasher(sha256.create, { oid: sha256.oid });\n * wrapped(new Uint8Array([1]));\n * ```\n */\nexport function createHasher<T extends Hash<T>, Opts = undefined>(\n  hashCons: HasherCons<T, Opts>,\n  info: TArg<HashInfo> = {}\n): TRet<CHash<T, Opts>> {\n  const hashC: any = (msg: TArg<Uint8Array>, opts?: TArg<Opts>) =>\n    hashCons(opts as Opts)\n      .update(msg)\n      .digest();\n  const tmp = hashCons(undefined);\n  hashC.outputLen = tmp.outputLen;\n  hashC.blockLen = tmp.blockLen;\n  hashC.canXOF = tmp.canXOF;\n  hashC.create = (opts?: Opts) => hashCons(opts);\n  Object.assign(hashC, info);\n  return Object.freeze(hashC) as TRet<CHash<T, Opts>>;\n}\n\n/**\n * Cryptographically secure PRNG backed by `crypto.getRandomValues`.\n * @param bytesLength - number of random bytes to generate\n * @returns Random bytes.\n * The platform `getRandomValues()` implementation still defines any\n * single-call length cap, and this helper rejects oversize requests\n * with a stable library `RangeError` instead of host-specific errors.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @throws If the current runtime does not provide `crypto.getRandomValues`. {@link Error}\n * @example\n * Generate a fresh random key or nonce.\n * ```ts\n * const key = randomBytes(16);\n * ```\n */\nexport function randomBytes(bytesLength = 32): TRet<Uint8Array> {\n  // Match the repo's other length-taking helpers instead of relying on Uint8Array coercion.\n  anumber(bytesLength, 'bytesLength');\n  const cr = typeof globalThis === 'object' ? (globalThis as any).crypto : null;\n  if (typeof cr?.getRandomValues !== 'function')\n    throw new Error('crypto.getRandomValues must be defined');\n  // Web Cryptography API Level 2 §10.1.1:\n  // if `byteLength > 65536`, throw `QuotaExceededError`.\n  // Keep the guard explicit so callers can see the quota in code\n  // instead of discovering it by reading the spec or host errors.\n  // This wrapper surfaces the same quota as a stable library RangeError.\n  if (bytesLength > 65536)\n    throw new RangeError(`\"bytesLength\" expected <= 65536, got ${bytesLength}`);\n  return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n\n/**\n * Creates OID metadata for NIST hashes with prefix `06 09 60 86 48 01 65 03 04 02`.\n * @param suffix - final OID byte for the selected hash.\n *   The helper accepts any byte even though only the documented NIST hash\n *   suffixes are meaningful downstream.\n * @returns Object containing the DER-encoded OID.\n * @example\n * Build OID metadata for a NIST hash.\n * ```ts\n * oidNist(0x01);\n * ```\n */\nexport const oidNist = (suffix: number): TRet<Required<HashInfo>> => ({\n  // Current NIST hashAlgs suffixes used here fit in one DER subidentifier octet.\n  // Larger suffix values would need base-128 OID encoding and a different length byte.\n  oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n","/**\n * SHA3 (keccak) hash function, based on a new \"Sponge function\" design.\n * Different from older hashes, the internal state is bigger than output size.\n *\n * Check out\n * {@link https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.202.pdf | FIPS-202},\n * {@link https://keccak.team/keccak.html | Website}, and\n * {@link https://crypto.stackexchange.com/q/15727 | the differences between\n * SHA-3 and Keccak}.\n *\n * Check out `sha3-addons` module for cSHAKE, k12, and others.\n * @module\n */\nimport { rotlBH, rotlBL, rotlSH, rotlSL, split } from './_u64.ts';\n// prettier-ignore\nimport {\n  abytes, aexists, anumber, aoutput,\n  clean, createHasher,\n  oidNist,\n  swap32IfBE,\n  u32,\n  type CHash, type CHashXOF,\n  type Hash,\n  type HashInfo,\n  type HashXOF,\n  type TArg,\n  type TRet\n} from './utils.ts';\n\n// No __PURE__ annotations in sha3 header:\n// EVERYTHING is in fact used on every export.\n// Various per round constants calculations\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst _7n = BigInt(7);\nconst _256n = BigInt(256);\n// FIPS 202 Algorithm 5 rc(): when the outgoing bit is 1, the 8-bit LFSR xors\n// taps 0, 4, 5, and 6, which compresses to the feedback mask `0x71`.\nconst _0x71n = BigInt(0x71);\nconst SHA3_PI: number[] = [];\nconst SHA3_ROTL: number[] = [];\nconst _SHA3_IOTA: bigint[] = []; // no pure annotation: var is always used\nfor (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {\n  // Pi\n  [x, y] = [y, (2 * x + 3 * y) % 5];\n  SHA3_PI.push(2 * (5 * y + x));\n  // Rotational\n  SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);\n  // Iota\n  let t = _0n;\n  for (let j = 0; j < 7; j++) {\n    R = ((R << _1n) ^ ((R >> _7n) * _0x71n)) % _256n;\n    if (R & _2n) t ^= _1n << ((_1n << BigInt(j)) - _1n);\n  }\n  _SHA3_IOTA.push(t);\n}\nconst IOTAS = split(_SHA3_IOTA, true);\n// `split(..., true)` keeps the local little-endian lane-word layout used by\n// `state32`, so these `H` / `L` tables follow the file's first-word /\n// second-word lane slots rather than `_u64.ts`'s usual high/low naming.\nconst SHA3_IOTA_H = IOTAS[0];\nconst SHA3_IOTA_L = IOTAS[1];\n\n// Left rotation (without 0, 32, 64)\nconst rotlH = (h: number, l: number, s: number) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));\nconst rotlL = (h: number, l: number, s: number) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));\n\n/**\n * `keccakf1600` internal permutation, additionally allows adjusting the round count.\n * @param s - 5x5 Keccak state encoded as 25 lanes split into 50 uint32 words\n *   in this file's local little-endian lane-word order\n * @param rounds - number of rounds to execute\n * @throws If `rounds` is outside the supported `1..24` range. {@link Error}\n * @example\n * Permute a Keccak state with the default 24 rounds.\n * ```ts\n * keccakP(new Uint32Array(50));\n * ```\n */\nexport function keccakP(s: TArg<Uint32Array>, rounds: number = 24): void {\n  anumber(rounds, 'rounds');\n  // This implementation precomputes only the standard Keccak-f[1600] 24-round Iota table.\n  if (rounds < 1 || rounds > 24) throw new Error('\"rounds\" expected integer 1..24');\n  const B = new Uint32Array(5 * 2);\n  // NOTE: all indices are x2 since we store state as u32 instead of u64 (bigints to slow in js)\n  for (let round = 24 - rounds; round < 24; round++) {\n    // Theta θ\n    for (let x = 0; x < 10; x++) B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];\n    for (let x = 0; x < 10; x += 2) {\n      const idx1 = (x + 8) % 10;\n      const idx0 = (x + 2) % 10;\n      const B0 = B[idx0];\n      const B1 = B[idx0 + 1];\n      const Th = rotlH(B0, B1, 1) ^ B[idx1];\n      const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];\n      for (let y = 0; y < 50; y += 10) {\n        s[x + y] ^= Th;\n        s[x + y + 1] ^= Tl;\n      }\n    }\n    // Rho (ρ) and Pi (π)\n    let curH = s[2];\n    let curL = s[3];\n    for (let t = 0; t < 24; t++) {\n      const shift = SHA3_ROTL[t];\n      const Th = rotlH(curH, curL, shift);\n      const Tl = rotlL(curH, curL, shift);\n      const PI = SHA3_PI[t];\n      curH = s[PI];\n      curL = s[PI + 1];\n      s[PI] = Th;\n      s[PI + 1] = Tl;\n    }\n    // Chi (χ)\n    // Same as:\n    // for (let x = 0; x < 10; x++) B[x] = s[y + x];\n    // for (let x = 0; x < 10; x++) s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];\n    for (let y = 0; y < 50; y += 10) {\n      const b0 = s[y],\n        b1 = s[y + 1],\n        b2 = s[y + 2],\n        b3 = s[y + 3];\n      s[y] ^= ~s[y + 2] & s[y + 4];\n      s[y + 1] ^= ~s[y + 3] & s[y + 5];\n      s[y + 2] ^= ~s[y + 4] & s[y + 6];\n      s[y + 3] ^= ~s[y + 5] & s[y + 7];\n      s[y + 4] ^= ~s[y + 6] & s[y + 8];\n      s[y + 5] ^= ~s[y + 7] & s[y + 9];\n      s[y + 6] ^= ~s[y + 8] & b0;\n      s[y + 7] ^= ~s[y + 9] & b1;\n      s[y + 8] ^= ~b0 & b2;\n      s[y + 9] ^= ~b1 & b3;\n    }\n    // Iota (ι)\n    s[0] ^= SHA3_IOTA_H[round];\n    s[1] ^= SHA3_IOTA_L[round];\n  }\n  clean(B);\n}\n\n/**\n * Keccak sponge function.\n * @param blockLen - absorb/squeeze rate in bytes\n * @param suffix - domain separation suffix byte\n * @param outputLen - default digest length in bytes. This base sponge only\n *   requires a non-negative integer; wrappers that need positive output\n *   lengths must enforce that themselves.\n * @param enableXOF - whether XOF output is allowed\n * @param rounds - number of Keccak-f rounds\n * @example\n * Build a sponge state, absorb bytes, then finalize a digest.\n * ```ts\n * const hash = new Keccak(136, 0x06, 32);\n * hash.update(new Uint8Array([1, 2, 3]));\n * hash.digest();\n * ```\n */\nexport class Keccak implements Hash<Keccak>, HashXOF<Keccak> {\n  protected state: Uint8Array;\n  protected pos = 0;\n  protected posOut = 0;\n  protected finished = false;\n  protected state32: Uint32Array;\n  protected destroyed = false;\n\n  public blockLen: number;\n  public suffix: number;\n  public outputLen: number;\n  public canXOF: boolean;\n  protected enableXOF = false;\n  protected rounds: number;\n\n  // NOTE: we accept arguments in bytes instead of bits here.\n  constructor(\n    blockLen: number,\n    suffix: number,\n    outputLen: number,\n    enableXOF = false,\n    rounds: number = 24\n  ) {\n    this.blockLen = blockLen;\n    this.suffix = suffix;\n    this.outputLen = outputLen;\n    this.enableXOF = enableXOF;\n    this.canXOF = enableXOF;\n    this.rounds = rounds;\n    // Can be passed from user as dkLen\n    anumber(outputLen, 'outputLen');\n    // 1600 = 5x5 matrix of 64bit.  1600 bits === 200 bytes\n    // 0 < blockLen < 200\n    if (!(0 < blockLen && blockLen < 200))\n      throw new Error('only keccak-f1600 function is supported');\n    this.state = new Uint8Array(200);\n    this.state32 = u32(this.state);\n  }\n  clone(): Keccak {\n    return this._cloneInto();\n  }\n  protected keccak(): void {\n    swap32IfBE(this.state32);\n    keccakP(this.state32, this.rounds);\n    swap32IfBE(this.state32);\n    this.posOut = 0;\n    this.pos = 0;\n  }\n  update(data: TArg<Uint8Array>): this {\n    aexists(this);\n    abytes(data);\n    const { blockLen, state } = this;\n    const len = data.length;\n    for (let pos = 0; pos < len; ) {\n      const take = Math.min(blockLen - this.pos, len - pos);\n      for (let i = 0; i < take; i++) state[this.pos++] ^= data[pos++];\n      if (this.pos === blockLen) this.keccak();\n    }\n    return this;\n  }\n  protected finish(): void {\n    if (this.finished) return;\n    this.finished = true;\n    const { state, suffix, pos, blockLen } = this;\n    // FIPS 202 appends the SHA3/SHAKE domain-separation suffix before pad10*1.\n    // These byte values already include the first padding bit, while the\n    // final `0x80` below supplies the closing `1` bit in the last rate byte.\n    state[pos] ^= suffix;\n    // If that combined suffix lands in the last rate byte and already sets\n    // bit 7, absorb it first so the final pad10*1 bit can be xored into a\n    // fresh block.\n    if ((suffix & 0x80) !== 0 && pos === blockLen - 1) this.keccak();\n    state[blockLen - 1] ^= 0x80;\n    this.keccak();\n  }\n  protected writeInto(out: TArg<Uint8Array>): TRet<Uint8Array> {\n    aexists(this, false);\n    abytes(out);\n    this.finish();\n    const bufferOut = this.state;\n    const { blockLen } = this;\n    for (let pos = 0, len = out.length; pos < len; ) {\n      if (this.posOut >= blockLen) this.keccak();\n      const take = Math.min(blockLen - this.posOut, len - pos);\n      out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);\n      this.posOut += take;\n      pos += take;\n    }\n    return out as TRet<Uint8Array>;\n  }\n  xofInto(out: TArg<Uint8Array>): TRet<Uint8Array> {\n    // Plain SHA3/Keccak usage with XOF is probably a mistake, but this base\n    // class is also reused by SHAKE/cSHAKE/KMAC/TupleHash/ParallelHash/\n    // TurboSHAKE/KangarooTwelve wrappers that intentionally enable XOF.\n    if (!this.enableXOF) throw new Error('XOF is not possible for this instance');\n    return this.writeInto(out);\n  }\n  xof(bytes: number): TRet<Uint8Array> {\n    anumber(bytes);\n    return this.xofInto(new Uint8Array(bytes));\n  }\n  digestInto(out: TArg<Uint8Array>): void {\n    aoutput(out, this);\n    if (this.finished) throw new Error('digest() was already called');\n    // `aoutput(...)` allows oversized buffers; digestInto() must fill only the advertised digest.\n    this.writeInto(out.subarray(0, this.outputLen));\n    this.destroy();\n  }\n  digest(): TRet<Uint8Array> {\n    const out = new Uint8Array(this.outputLen);\n    this.digestInto(out);\n    return out as TRet<Uint8Array>;\n  }\n  destroy(): void {\n    this.destroyed = true;\n    clean(this.state);\n  }\n  _cloneInto(to?: Keccak): Keccak {\n    const { blockLen, suffix, outputLen, rounds, enableXOF } = this;\n    to ||= new Keccak(blockLen, suffix, outputLen, enableXOF, rounds);\n    // Reused destinations can come from a different rate/capacity variant, so clone must rewrite\n    // the sponge geometry as well as the state words.\n    to.blockLen = blockLen;\n    to.state32.set(this.state32);\n    to.pos = this.pos;\n    to.posOut = this.posOut;\n    to.finished = this.finished;\n    to.rounds = rounds;\n    // Suffix can change in cSHAKE\n    to.suffix = suffix;\n    to.outputLen = outputLen;\n    to.enableXOF = enableXOF;\n    // Clones must preserve the public capability bit too; `_KMAC` reuses this path and deep clone\n    // tests compare instance fields directly, so leaving `canXOF` behind makes the clone lie.\n    to.canXOF = this.canXOF;\n    to.destroyed = this.destroyed;\n    return to;\n  }\n}\n\nconst genKeccak = (\n  suffix: number,\n  blockLen: number,\n  outputLen: number,\n  info: TArg<HashInfo> = {}\n) => createHasher(() => new Keccak(blockLen, suffix, outputLen), info);\n\n/**\n * SHA3-224 hash function.\n * @param msg - message bytes to hash\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA3-224.\n * ```ts\n * sha3_224(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha3_224: TRet<CHash> = /* @__PURE__ */ genKeccak(\n  0x06,\n  144,\n  28,\n  /* @__PURE__ */ oidNist(0x07)\n);\n/**\n * SHA3-256 hash function. Different from keccak-256.\n * @param msg - message bytes to hash\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA3-256.\n * ```ts\n * sha3_256(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha3_256: TRet<CHash> = /* @__PURE__ */ genKeccak(\n  0x06,\n  136,\n  32,\n  /* @__PURE__ */ oidNist(0x08)\n);\n/**\n * SHA3-384 hash function.\n * @param msg - message bytes to hash\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA3-384.\n * ```ts\n * sha3_384(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha3_384: TRet<CHash> = /* @__PURE__ */ genKeccak(\n  0x06,\n  104,\n  48,\n  /* @__PURE__ */ oidNist(0x09)\n);\n/**\n * SHA3-512 hash function.\n * @param msg - message bytes to hash\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA3-512.\n * ```ts\n * sha3_512(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha3_512: TRet<CHash> = /* @__PURE__ */ genKeccak(\n  0x06,\n  72,\n  64,\n  /* @__PURE__ */ oidNist(0x0a)\n);\n\n/**\n * Keccak-224 hash function.\n * @param msg - message bytes to hash\n * @returns Digest bytes.\n * @example\n * Hash a message with Keccak-224.\n * ```ts\n * keccak_224(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const keccak_224: TRet<CHash> = /* @__PURE__ */ genKeccak(0x01, 144, 28);\n/**\n * Keccak-256 hash function. Different from SHA3-256.\n * @param msg - message bytes to hash\n * @returns Digest bytes.\n * @example\n * Hash a message with Keccak-256.\n * ```ts\n * keccak_256(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const keccak_256: TRet<CHash> = /* @__PURE__ */ genKeccak(0x01, 136, 32);\n/**\n * Keccak-384 hash function.\n * @param msg - message bytes to hash\n * @returns Digest bytes.\n * @example\n * Hash a message with Keccak-384.\n * ```ts\n * keccak_384(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const keccak_384: TRet<CHash> = /* @__PURE__ */ genKeccak(0x01, 104, 48);\n/**\n * Keccak-512 hash function.\n * @param msg - message bytes to hash\n * @returns Digest bytes.\n * @example\n * Hash a message with Keccak-512.\n * ```ts\n * keccak_512(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const keccak_512: TRet<CHash> = /* @__PURE__ */ genKeccak(0x01, 72, 64);\n\n/** Options for SHAKE XOF. */\nexport type ShakeOpts = {\n  /** Desired number of output bytes. */\n  dkLen?: number;\n};\n\nconst genShake = (suffix: number, blockLen: number, outputLen: number, info: TArg<HashInfo> = {}) =>\n  createHasher<Keccak, ShakeOpts>(\n    (opts: ShakeOpts = {}) =>\n      new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true),\n    info\n  );\n\n/**\n * SHAKE128 XOF with 128-bit security and a 16-byte default output.\n * @param msg - message bytes to hash\n * @param opts - Optional output-length override. See {@link ShakeOpts}.\n * @returns Digest bytes.\n * @example\n * Hash a message with SHAKE128.\n * ```ts\n * shake128(new Uint8Array([97, 98, 99]), { dkLen: 32 });\n * ```\n */\nexport const shake128: TRet<CHashXOF<Keccak, ShakeOpts>> =\n  /* @__PURE__ */\n  genShake(0x1f, 168, 16, /* @__PURE__ */ oidNist(0x0b));\n/**\n * SHAKE256 XOF with 256-bit security and a 32-byte default output.\n * @param msg - message bytes to hash\n * @param opts - Optional output-length override. See {@link ShakeOpts}.\n * @returns Digest bytes.\n * @example\n * Hash a message with SHAKE256.\n * ```ts\n * shake256(new Uint8Array([97, 98, 99]), { dkLen: 64 });\n * ```\n */\nexport const shake256: TRet<CHashXOF<Keccak, ShakeOpts>> =\n  /* @__PURE__ */\n  genShake(0x1f, 136, 32, /* @__PURE__ */ oidNist(0x0c));\n\n/**\n * SHAKE128 XOF with 256-bit output (NIST version).\n * @param msg - message bytes to hash\n * @param opts - Optional output-length override. See {@link ShakeOpts}.\n * @returns Digest bytes.\n * @example\n * Hash a message with SHAKE128 using a 32-byte default output.\n * ```ts\n * shake128_32(new Uint8Array([97, 98, 99]), { dkLen: 32 });\n * ```\n */\nexport const shake128_32: TRet<CHashXOF<Keccak, ShakeOpts>> =\n  /* @__PURE__ */\n  genShake(0x1f, 168, 32, /* @__PURE__ */ oidNist(0x0b));\n/**\n * SHAKE256 XOF with 512-bit output (NIST version).\n * @param msg - message bytes to hash\n * @param opts - Optional output-length override. See {@link ShakeOpts}.\n * @returns Digest bytes.\n * @example\n * Hash a message with SHAKE256 using a 64-byte default output.\n * ```ts\n * shake256_64(new Uint8Array([97, 98, 99]), { dkLen: 64 });\n * ```\n */\nexport const shake256_64: TRet<CHashXOF<Keccak, ShakeOpts>> =\n  /* @__PURE__ */\n  genShake(0x1f, 136, 64, /* @__PURE__ */ oidNist(0x0c));\n"],"names":["n","len","fromBig","BigInt","s","h","l","shrSL","rotr32H","Bh","Dl","add4H","Ah","low","add3L","add4L","Ch","Dh","Bl","Al","El"],"mappings":"2CGuIM,EHvIN,IGsIc,EHtId,AGsIgB,EHtIhB,EAAA,CAAA,CAAA,OAAA,EAAA,EAAA,CAAA,CAAA,OAAA,EAAA,EAAA,CAAA,CAAA,OAAA,EAAA,EAAA,CAAA,CAAA,MAAA,EAAA,EAAA,CAAA,CAAA,OAAA,EAAA,EAAA,CAAA,CAAA,OAAA,EAAA,EAAA,CAAA,CAAA,WESM,EAA6B,MAAM,CAAC,CAA1B,AAA2B,GAAxB,CAA4B,EAAE,KAAG,CAAC,CAAC,CAAC,AACjD,EADa,AACU,EADK,AACxB,GAAG,CAAsB,CAAC,EAAE,CAAC,CAAC,AEwIlC,ICpGG,GHpCI,EGoCJ,AHpCmB,EEwIJ,CAAS,CAAA,EAAA,EAAoB,KACxC,UAAP,OAAO,EAAA,CACT,IAAA,EAAe,GAAA,CAAA,CAAA,EAAA,EAAA,EAAA,CAAA,AACf,OAAA,AAAU,UAAU,CAAA,EAAG,EAAM,qBAAA,EAAwB,OAAO,CAAC,CAAA,CAAE,CAAC,CAAC,GAE/D,CAAA,OAAA,aAAqB,CAAA,IAAO,CAAC,CAAG,CAAC,CAAE,CAAC,SACd,CAAA,CAAA,EAAA,EAAS,EAAA,CAAI,CAAC,ACpGA,MDqG5B,CCpGC,SDoGS,CAAC,CAAA,EAAG,EAAM,IAAA,uBAAA,EAA8B,CAAC,CAAA,CAAE,CAAC,CAAC,YAmBnE,CAAuB,CFzFwB,AAAY,AE0F3D,CAAe,CF1F0C,AE0F1C,EACC,EAAE,EAElB,IAAM,EAlDJ,MAkDY,OAlDC,YACZ,YAAA,MAAkB,CAAC,CAAC,CAAC,EF/FE,AEgGC,eFhGD,AEgJJ,EFhJI,GEgJC,CAAC,CAAC,MAhDZ,CAAC,CF/FG,GE+FC,EAClB,mBAAmB,IAAI,CAAC,CACA,AADA,CACC,CAAC,CAC7B,CAAC,AAF0B,EACtB,iBAAiB,CA+CjB,CF5FG,CE4FG,CAAH,EAAU,OACb,EAAW,KAAW,MAC5B,GAAI,CAAC,EF3FI,CAAA,GE2FkB,EF3F4C,EE2FpC,EAAA,CAIjC,GFzFO,CAAA,EEyFS,CAHD,GAAS,CAAA,CAAA,EAAI,EAAK,GAAA,AAAI,CAAC,CAGtB,uBAFF,CAEmC,CAFxB,CAAA,WAAA,EAAc,EAAA,CAAQ,CAAG,AAAF,CAAC,AFzFjC,CEyFkC,EAEO,EFxF9B,QEuFf,CACwD,CADhD,CAAA,EAAH,CAAC,CAAC,GAAC,EAAU,EAAG,CAAA,AAAE,CAAC,AAAE,CAAD,AAAC,KAAA,EAAQ,OAAO,EAAK,CAAA,AAAE,CAAC,CAAH,IAErD,EAAA,MAAA,AAAiB,UAAU,EAChC,AFxFsE,OEwFhE,WAAA,GAER,OAAO,EA4DH,SAAA,EAAA,CAA+B,CAAA,GAAkB,CAAI,KACrD,EAAS,SAAS,CAAE,MAAM,AAAI,MAAM,uCACpC,GAAA,EAA0B,QAAQ,CAAE,MAAU,AAAV,MAAgB,uCAAuC,CAAC,CAAC,AA2E7F,SAAU,EAAM,GAAG,CAA0B,YACpC,EAAG,CAAC,CAAG,EAAO,MAAM,CAAE,IAAK,CAAC,AACjC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAEpB,CAAC,AA+CM,IA+DM,EA/DA,AACX,AAA4D,AA8DS,CA/DpB,CCnHxC,EDoHuD,AA8DS,CA9DR,EAAE,AADxC,CACyC,AA8D/C,CA9DjB,UAAU,CAAC,GAD4B,CAAC,AACzB,GAD4B,QACjB,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CA+DrD,AAAC,CAAoB,EAAK,CAAsB,CAnB9C,EAoBF,OApBuB,AAAX,CAAiC,EAC/C,IAAK,IAAI,EAAI,CAAC,CAAE,CAAC,CAAG,EAAI,CAAD,KAAO,CAAE,CAAC,EAAE,CAAE,CAAC,MACpC,CAAG,CAAC,CAAC,CAAC,CAhCN,CAFqB,AAEpB,EAgCiB,CAAG,CAAC,AAlCW,CAkCV,CAAC,GAhCd,GAAM,UAAU,CAAC,AACzB,GAAQ,CAAC,CAAC,AAAG,SACb,GCvHG,CAAA,EAAA,MDwHH,IAAA,GAAe,GA6BQ,CAAC,OAErB,CACT,CAAC,CCzYK,EAAG,CAAA,MAAU,CAAC,AHGqB,CGHpB,CAAC,EACV,MAAM,CAAC,CAAC,CAAC,CAAC,SACH,CAAC,IACR,OAAO,CAAC,CAAC,CAAC,AACtB,EAAA,OAAqB,EHI0B,GGDzC,EAAA,OAAgB,OACI,EAAA,CACpB,EAAsB,EAAE,CAAC,AACzB,EAAA,EAAyB,EAAE,GAC5B,IAAI,EAAQ,CAAC,CAAE,CAAC,CAAG,EAAK,CAAF,AAAG,CAAG,CAAC,CAAE,CAAC,CAAG,CAAC,CAAE,EAAQ,EAAE,CAAL,AAAO,IAAS,CAAJ,AAAK,CAE9D,CAF2D,AAE1D,CAAE,CAAC,CAAC,CAAG,CAAC,CAH8D,AAG7D,CAAE,CAAC,EAAI,CAAC,CAAA,GAAO,CAAC,CAAC,AAAG,CAAC,CAAC,QACpB,CAAC,CAAA,CAAA,EAAQ,GAAI,GAE1B,EAAA,IAAc,CAAA,CAAA,GAAY,CAAC,EAAK,CHImC,CGJ3B,CAAC,CAAC,ADoGF,CCpGG,AHIkC,AGJ/B,CAAC,CAAC,AAAG,CHIgC,AAAG,CGJjC,CAAC,KAElD,CAAC,CAAG,CHIG,CGHX,IAAK,IAAI,CAAC,CDoGC,ACpGE,CAAC,CAAA,EAAM,CAAC,CAAE,CAAC,GAAI,AAEtB,CAFuB,AAEtB,GADA,GAAA,EAAA,CAAe,CAAC,AHI4B,EAAA,CAAA,EGJjB,CDoGC,CCpGM,CAAC,AAAG,CAAA,CAAK,CAAC,AACzC,IAAK,CAAC,EAAI,GAAA,CAAS,CHK4B,EGLrB,OAAO,EAAC,CAAC,CAAC,CAAA,EAE9C,EAAA,IAAA,CAAgB,CAAC,QH5BnB,AG8Bc,SH9BL,AAAM,CAAa,CAAE,EAAE,CAAlB,AAAqB,CAAK,MAChC,EAAM,CAAH,CAAO,CAAD,KAAO,CAClB,AADmB,CGfhB,CHgBD,AAAG,EGhBI,EAAA,YHgBY,EGhBI,CHiBzB,AADwB,CAAC,AGhBE,CHiBtB,AAAH,AADwB,IACjB,CGhBG,AADqB,EAAE,KAAK,EAAE,CHiBtB,CAAC,GAAG,CGjBwB,AHiBvB,CAAC,MACrB,CAAC,CGfJ,EAHyD,AHkB/C,CGlBgD,AHkB/C,CAAA,EAAQ,CAAC,EAAE,CAAE,CAAC,AGfL,AD8GD,AF9FvB,GAAM,GAAE,CGhBuB,AHgBtB,EGfX,CHea,CAAA,CAAG,CAAG,CGfd,EAAE,MHHA,AACP,CAAS,CACT,EAAK,EGCc,AHDT,CAFI,CGId,OAAO,AHGP,AAAI,EGFJ,AHEM,AAAS,CAAE,CAAT,AAAU,CAAE,MAAM,CGFhB,AHEiB,CAAC,CGD5B,AHC+B,GGD5B,AHCyC,CAAC,CGM9C,AHNgD,KAAN,CGMpC,AHNqC,AAAW,CAAE,CAAC,EAAI,EAAQ,EAAJ,AAAe,CAAE,AAAhB,CAAiB,AAC3E,CAAE,CAAC,AGKO,CAAC,AHL6B,CAAC,CAApC,CADkE,CAAC,IAC7D,CAAE,CAAC,EAAI,EAAQ,EAAJ,CAAC,AAAoB,CAAC,CAA2B,CAAC,CAA1B,GAAV,CAAC,EAAe,CAAC,CAAC,CAAG,EAAe,CAAE,AACnF,CADoF,AACnF,CAS4B,CAAG,CAAC,CAAC,CAAC,CAVyC,AAUvC,CAVwC,CAWzE,EAAC,CAAA,CAAA,EAAA,CAAO,CAAE,CAAC,CAAC,CAAC,CAAA,CAAA,KAAU,CAAC,SAEd,EAAE,AGHE,EAyBE,EAAY,EHKkC,EGD5D,EAAc,CAAK,CAAC,CAAC,CAAC,CAAC,AACvB,EAAc,CAAK,CAAC,CAAC,CAAC,CAAC,AAGvB,EAAA,CAAA,EAAoB,CAAS,CAAA,IAAiB,CAAC,CHazB,AGb4B,EAAE,CAAa,AHHV,CGGW,AHHV,AGLhC,CAQ+B,CHHM,AAgB/B,AGbsC,CARtC,AHKgC,AGGO,CHHJ,AGGK,AARvC,CAAC,AAQuC,CAAC,AHHL,CAAM,AGGA,AHHL,AGGP,AAAC,CHHY,AAAL,AGGN,CHHS,EAAQ,EAAE,AGGH,GHHM,AGGL,AHP1B,CAIgC,AGGL,CHHM,CAAC,CAAC,CGGN,AHPvB,AAAE,CGLxB,AHK2B,AGOmB,AHPvB,CAAC,EAAW,GGOa,CAAC,CHPT,AGOU,AAC9F,CHRqF,AGOU,CHPT,AGOU,AAClF,CHRyE,AGQzE,EAAA,EAAuB,IAAe,EAAI,GAAK,AHFA,CAAC,AAAH,CGEE,CHFM,CAAC,CAAG,EAAE,CAAM,AGER,AHFG,CAAM,AGER,AHFG,CAAG,EAAQ,EAAE,CGEd,CHazB,AGb0B,CHFgB,AGEf,AAAa,AHN5B,CGM6B,AHFE,AAJ9B,CAI+B,CAAC,AGEf,CHFgB,CAJ7B,AGMoB,AHNd,CAAL,AGMoB,AHa1B,AAnBY,AAAF,CAmBT,AAnBM,EAAW,EAAE,CGMW,CAAC,AA4FvF,CHlG8E,AGMU,CAAC,AHNV,CAAC,AGMU,CHNT,CAAC,EGkG3E,MAAM,CACW,KACZ,CAAC,QACE,CAAE,WACA,CAAM,QACI,AACrB,WAAA,CAAA,CAAkB,SAEJ,iBAEC,OACF,CACb,UAAA,CAAA,CAAkB,EDoGR,KCnGK,aAIvB,CAAgB,CAChB,CAAc,CACd,CAAiB,CACjB,GAAY,CAAK,CACjB,EAAiB,EADR,AACU,CAAA,CAYnB,GAVA,IAAI,CAAC,QAAQ,CAAG,EAChB,IAAI,CAAC,CADmB,CAAC,IACd,CAAG,EACd,IAAI,CAAC,SAAS,CAAG,EACjB,IAAI,CAAA,EADsB,CAAC,MACb,CAAG,EACjB,IAAI,CAAC,EADqB,IACf,CAAG,EACd,IAAI,CAAC,EADkB,CAAC,GACb,CAAG,EAEd,EAAQ,EAAW,AAFC,CAAC,UAES,CAAC,CAAC,AAG5B,CAAC,CAAA,EAAK,GAAY,EAAW,GAAA,CAAG,CAAC,AACnC,CAD4B,KACtB,MAAU,yCAAyC,CAAC,CAAC,AAC7D,IAAI,CAAC,KAAA,CAAQ,IAAI,WAAA,KACjB,IAAI,CAAC,OAAA,CAAU,ADiHb,SAAA,CAAA,SACG,IAAA,YACL,EAAI,MAAM,CAAA,EACN,UAAU,CACd,IAAI,CAAC,KAAK,CAAC,EAAI,CAAD,SAAW,CAAG,CAAC,CAAC,CACV,AACxB,CADyB,AACxB,CCvHsB,IAAI,CAAC,KAAK,CAAC,QAE3B,CACH,OAAO,IAAA,CAAK,UAAA,EACd,CAAC,AACS,QAAM,CACd,EAAW,IAAI,CAAC,OAAO,CAAC,CAAC,AAxHvB,AAyHF,SAzHY,AAAQ,CAAoB,CDwG9B,ACxGgC,EAAiB,EAAE,EAG/D,CDuGC,ECzGD,EAAA,EAAgB,UAEZ,CHmBJ,CAAA,GAAA,EGnB2B,EAAE,AHmBL,CAAE,MGnBW,AAAI,EDwGT,CAAC,ECxGa,CAAC,iCAAiC,CAAC,CAAC,AAClF,IAAM,CAAC,CAAG,IAAI,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAExB,EAAQ,EAAE,CAAL,AAAQ,EAAQ,EAAQ,EAAV,CAAc,IAAS,CAAJ,AAAK,AAElD,CHqBG,CGvB4C,EAE1C,IAAI,CAAC,CAAG,CAAC,CAAA,EAAM,EAAE,CAAE,CAAC,EAAE,CAAE,CAAC,CAAC,CAAC,CAAC,CAAG,CAAC,AHsBzB,CGtB0B,CAAC,CAAC,CAAA,CAAI,CAAC,CAAC,CAAG,EHsBrB,AGtBuB,CAAC,CAAG,CAAC,CAAC,CAAC,CAAG,EAAE,CAAC,CAAG,CAAC,CAAC,CAAC,CAAG,EAAE,CAAC,CAAG,CAAC,CAAC,CAAC,CAAG,EAAE,CAAC,CAAC,AACzF,GHsBK,CAAA,IGtBI,CAAC,CAAG,CAAC,CAAE,CAAC,CAAG,GAAI,CAAC,EAAI,CAAC,CAAE,CAAC,AAC/B,IAAM,EAAO,CAAA,GAAK,CAAC,CAAC,AAAG,EHsBG,AGtBD,CAAC,AACpB,EAAO,CHsBA,AGtBC,CAAJ,AAAK,CHsBK,CAAA,CGtBD,CAAC,AAAG,GACjB,EAAE,AAAG,CAAC,CAAA,EAAM,CAAC,AACnB,EAAW,CAAC,CAAA,EAAQ,CAAC,CAAC,CAAC,AACjB,CHsBO,CGtBL,AAAG,EAAM,EAAE,AAAE,CAAL,CAAO,AAAE,CAAC,CAAC,CAAG,CAAC,CAAC,EAAK,CAAC,AAChC,CAD8B,CACzB,AAAH,EAAS,EAAE,AAAE,CAAL,CAAO,AAAE,CAAC,CAAC,CAAG,CAAC,CAAC,EAAO,CAAC,CAAJ,AAAK,CAAC,AAC1C,IAAK,IAAA,EAAQ,EAAG,CHmB4D,AGnB3D,CAAG,EAAE,CAAE,CAAC,EAAA,GAAQ,AAC/B,CADgC,AAC/B,CAAC,CAAC,CAAG,CAAC,CAAC,EAAI,EACZ,CAAC,CAAC,CAAC,CAAG,EAAI,CAAC,CAAC,EAAI,CAEpB,CAFsB,AAErB,CAFsB,KAIZ,CAAC,CAAC,CAAC,CAAC,CAAC,AAChB,EAAW,CAAC,CAAC,CAAC,CAAC,CAAC,AAChB,IAAK,IAAI,CAAC,CAAG,CAAC,CAAE,CAAC,CAAG,EAAE,CAAE,CAAC,EAAE,CAAE,CAC3B,IAAA,EAAc,CAAA,CAAU,CAAC,CAAC,CAAC,AACrB,EAAK,AAAH,EAAS,EAAM,CAAP,CAAK,AAAQ,EAAF,CACrB,EAD4B,AAC1B,AAAG,CADwB,CAAC,AACnB,EAAM,CAAP,CAAK,AAAQ,EAAF,CAC3B,EADkC,AACvB,CADwB,AACjB,CADkB,AAClB,EAAA,CAClB,EAAO,CAAC,CAAC,EAAE,CACX,EAAO,CAAC,CAAC,EAAE,AAAG,CAAC,CAAC,CAAC,AACjB,CAAC,CAAC,EAAE,AAAC,CAAG,EACR,CAAC,CAAC,EAAE,AAAG,CAAC,CAAC,CAAG,CACd,CAAC,AADe,AAMhB,CANiB,EDiHZ,CC3GA,IAAI,CAAC,CAAG,CAAC,CAAE,CD2GG,AC3GF,CAAG,EAAE,CAAE,CAAC,EAAA,GAAQ,CAAC,IAC1B,EAAE,CAAA,CAAK,CAAC,CAAC,CACb,EAAE,AAAG,CAAC,CAAC,CAAC,CAAG,CAAC,CAAC,CACb,EAAE,AAAG,CAAC,CAAC,CAAC,CAAG,CAAC,CAAC,CACb,EAAE,AAAG,CAAC,CAAC,CAAC,CAAG,CAAC,CAAC,CAAC,AAChB,CAAC,CAAC,CAAC,CAAC,EAAI,CAAC,CAAC,CAAC,CAAC,CAAG,CAAC,CAAC,CAAG,CAAC,CAAC,CAAC,CAAG,CAAC,CAAC,CAC5B,AAD6B,CAC5B,CAAC,CAAC,CAAG,CAAC,CAAC,EAAI,CAAC,CAAC,CAAC,CAAC,CAAG,CAAC,CAAC,CAAG,CAAC,CAAC,CAAC,CAAG,CAAC,CAAC,CAChC,AADiC,CACjC,CAAE,EAAI,EAAE,EAAA,CAAK,CAAA,CAAE,CAAC,CAAG,CAAC,CAAC,CAAG,CAAC,CAAC,CAAC,CAAG,CAAC,CAAC,CAChC,AADiC,CAChC,CAAC,CAAC,CAAG,CAAC,CAAC,EAAI,CDuGoB,ACvGnB,CAAC,CAAC,CAAC,CAAG,CAAC,CAAC,CAAG,CAAC,CAAC,CAAC,CAAG,CAAC,CAAC,CAAC,AACjC,CAAC,CAAC,CAAC,CAAG,CDsGqD,ACtGpD,CDsGqD,ACtGpD,CDsGqD,CCtGjD,CAAC,CAAC,CAAC,CAAC,CAAG,CAAC,CAAC,CAAA,CAAI,CAAA,EAAK,CAAC,CAAC,CAAC,CAChC,CAAA,EAAA,EAAO,EAAI,CDsGmB,ACtGlB,CAAC,CAAC,CAAC,CAAG,CAAC,CAAC,CAAG,CAAC,CAAC,CAAC,CAAG,CAAC,CAAC,CAAC,AACjC,CAAC,CAAA,EDqGwD,ACrGnD,CDqGoD,ACrGnD,CAAC,ADqGmD,ECrG/C,CAAC,CAAC,CAAC,CAAC,CAAG,CAAC,CAAC,CAAG,EAAE,AAC1B,CAAC,AAD0B,CACzB,CAAC,CAAA,EAAK,EAAA,CAAK,CAAC,CAAC,CAAC,CAAA,EAAA,CAAQ,EAAE,CAAC,AAC1B,CAAC,CAAC,CAAG,CAAC,CAAC,EAAA,CAAK,EAAE,AAAG,EAAE,AACpB,CADqB,AACpB,CAAA,EAAK,CAAC,CAAC,EAAI,CAAC,EAAE,AAAG,CACpB,CADsB,AACrB,AAED,CAHuB,AAGvB,CAAA,EAAI,EAAI,CAAW,CAAC,EAAM,CAAC,AAC3B,CAAC,CADwB,AACvB,CAAC,CAAC,EAAI,CAAW,CAAA,EAAO,CAAC,EAEvB,CAAC,CAAC,AACV,CAAC,CA8DW,IAAI,CAAC,OAAO,CAAE,IAAA,CAAK,MAAM,CAAC,CAAC,AACnC,EAAW,IAAI,CAAC,OAAO,CAAC,CAAC,AACzB,IAAI,CAAC,MAAM,CAAG,CAAC,CAAC,AAChB,IAAI,CAAC,GAAG,CAAG,CAAC,AACd,CADe,AACd,AACD,MAAM,CAAC,CAAsB,CAAA,GACnB,GDoGO,CAAA,OClGf,GAAM,UAAE,CAAQ,OAAE,CAAK,CAAE,CAAG,IAAI,CAAC,AACjC,EAAY,EAAK,EAAD,IAAO,CACvB,AADwB,IACnB,IAAA,EAAU,EAAG,EAAA,GAAA,CAChB,IAAM,EAAO,IAAI,CAAC,GAAG,CAAC,EAAW,IAAI,CAAC,CAAR,EAAW,CAAE,EAAM,CAAH,EAAM,AACpD,CADqD,CAAC,EACjD,IAAI,CAAC,CAAG,CAAC,CAAE,CAAC,CAAG,EAAM,CAAC,CAAH,CAAK,CAAA,CAAO,CAAA,IAAA,CAAM,GAAG,GAAG,EAAI,CAAI,CAAC,GAAG,CAAG,CAAC,AAAF,KACrD,GAAG,GAAK,GAAU,IAAI,CAAA,MAAO,EACxC,CAAC,AACD,OAAA,IAAW,AACb,CADc,AACb,CD2GG,QCzGF,GAAI,IAAA,CAAA,QAAa,CAAE,AD2GD,OC3GQ,AAC1B,IAAI,CAAC,QAAQ,EAAG,EAChB,EADoB,CAAC,AACf,OAAE,CAAK,QAAE,CAAM,KAAE,CAAG,UAAE,CAAQ,CAAE,CAAG,IAAI,CAAC,CAIzC,CAAC,EAAI,EAAI,EAIV,CAAU,IAAT,CAAS,CAAI,CAAC,CAAK,CAAC,EAAI,GAAG,CAAK,EAAW,CAAC,EAAA,GAAJ,CAAI,CAAO,MAAM,EAAE,CAChE,CAAK,CAAA,EAAA,EAAc,EAAI,IACvB,IAAI,CAAC,MAAM,aAEO,CAAA,CAAqB,CACvC,EAAQ,IAAI,EAAE,GACd,EADmB,AACnB,CADoB,CAAC,CAErB,IAAI,CAAC,MAAM,EAAE,CACb,AADc,IACR,EAAY,IAAI,CAAC,EAAR,GAAa,CAAC,AACvB,UAAE,CAAQ,CAAE,CAAG,IAAI,CAAC,IACrB,IAAI,EAAM,CAAH,AAAI,CAAE,EAAM,CAAH,CAAO,CAAD,KAAO,CAAA,EAAQ,GAAO,AAAJ,CACvC,IAAI,CAAC,MAAM,EAAI,GAAU,IAAI,CAAC,MAAM,EAAE,CAAC,AAC3C,IAAM,EAAO,EAAH,EAAO,CAAC,GAAG,CAAC,EAAW,IAAI,CAAC,CAAR,KAAc,CAAE,EAAM,CAAH,EAAM,AACvD,CADwD,CAAC,AACrD,CAAD,EAAI,CAAC,EAAU,OAAD,CAAS,CAAC,IAAI,CAAC,MAAM,CAAE,IAAI,CAAC,MAAM,CAAG,GAAO,CAAH,CAAC,CAAK,CAAC,CAAC,GAC7D,GDgHS,GAAA,EChHC,EACf,GAAO,AAAJ,CDgHS,AC/Gd,AD+GU,CC/GT,AACD,OAAO,EAET,CAFgC,CAAC,MAEzB,CAAqB,CAAA,CAI3B,GAAI,CAAC,IAAA,CAAA,SAAc,CAAA,MAAQ,AAAI,MAAM,gDAC9B,IAAI,CAAC,SAAS,CAAC,EACxB,CAD2B,AAC1B,CAD2B,CAAC,EAEzB,CAAA,CAAa,CAEf,OADA,EAAA,GACO,CDkHG,GClHC,CAAC,OAAO,CAAC,CDkHG,GClHC,GDkHK,KAAK,GClHC,GACrC,CAAC,AACD,WAAW,CAAqB,CAAA,UDUpB,EAAW,qBAyG4B,MAxG7C,ECpGa,AA0FJ,CA1FI,ADoGV,GCVU,CDUE,ACVD,CAAC,QDUS,CAAC,GCVrB,ADWN,CAwGW,CAxGP,CCXK,KDWL,CAAS,EACf,GADoB,CAAC,EACrB,AAAU,WAAW,oDAAsD,GCX3E,ADW8E,CAAC,CAAC,CCX5E,IAAI,CAAC,QAAQ,CAAE,MAAM,AAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC,KAE7D,SAAS,CAAC,EAAI,QAAQ,CAAC,CAAC,CAAA,IAAM,CAAC,SAAS,CAAC,CAAC,CAC/C,AADgD,IAC5C,CAAC,OAAO,EAAE,CAAC,AAEjB,MAAM,EAAA,CACJ,IAAA,EAAY,IAAI,WAAW,IAAI,CAAC,SAAS,CAAC,CAAC,AAE3C,OADA,IAAI,CAAC,UAAU,CAAC,GAChB,CACF,CAAC,CDsHG,SCpHF,IAAI,CAAC,CDuHC,QCvHQ,EAAG,EACjB,EADqB,AACrB,CADsB,CDuHC,CAAC,CCtHd,CAAC,CDuHC,CAAC,GAAA,CCtHf,CAAC,AACD,UAAU,CAAC,CAAW,CAAA,CACpB,GAAM,UAAE,CAAQ,QAAE,CAAM,WAAE,CAAS,CAAE,QAAM,WAAE,CAAS,CAAE,CAAG,IAAI,CAAC,AAkBhE,MAdA,EAAE,OAHS,EAAO,EAAU,EAAQ,EAAW,EAAW,EAAM,CAAC,CAG9D,AAH+D,GAAV,KAG7C,CAAG,YACH,GAAG,CAAC,IAAA,CAAK,OAAO,CAAC,CAC5B,EAAG,GAAA,CAAA,IAAU,CAAC,GAAG,CACjB,AADkB,EACf,MAAA,CAAA,IAAa,CAAC,MAAM,CAAC,EACrB,QAAQ,CAAG,IAAA,CAAK,QAAQ,CAC3B,EAAG,MAAM,CAAG,IAET,CDwHW,KCxHL,CAAG,EACZ,EDwHY,ACxHV,AAAC,CDwHW,QCxHF,CDwHW,ACxHR,CDwHW,YCvHd,CAAG,EAGf,EAAE,AAAC,MAAA,CAAS,IAAI,CAAC,MAAA,CACjB,EAAG,SAAS,CAAG,IAAI,CAAC,SAAS,CACtB,AADuB,EACrB,CAAC,AAEb,AAmEM,IAAM,EAAwC,CAjEnC,CAChB,EAAA,EAEA,EACA,CA6DmC,CA7DZ,CAAA,CAAE,EACzB,CD+dI,AC/dD,CAAD,MA4DiC,EDmarB,CACd,CAA6B,CAC7B,ACjee,EDieQ,CAAA,CAAE,EAEzB,GAJ0B,CAIpB,EAAa,CAAC,EAAT,AAAgC,CAAF,GACvC,AAD0D,CAAI,CAAF,AACnD,GACN,CADkB,CAAC,CAAd,GACC,CAAC,GAAG,AACV,CADW,KACL,EAAE,CAAC,AACR,EAAA,OAAe,GAMrB,OALA,EAAK,GAAA,MAAU,CAAG,EAAI,CAAD,QAAU,CAAC,AAChC,EAAM,GAAD,KAAS,CAAG,EAAI,QAAQ,CAAC,AAC9B,EAAM,GAAD,GAAO,CAAG,EAAI,CAAD,KAAO,CAAC,AAC1B,EAAM,MAAM,CAAG,AAAC,GAAgB,CAAL,AAAI,CAAU,CAAZ,EAC7B,CAD6C,CAAC,CAAN,AAAO,GACzC,CAAC,MAAM,CAAC,EAAO,GACd,AADY,CAAM,CAAC,CAAC,GACd,CAAC,MAAM,CAAC,GACvB,CAAC,CC9eiB,GAAG,CAAG,CAAD,GAAK,EAAO,EAAU,EAAX,AAAmB,GAAY,CAAtB,AAAQ,CAAkB,CAAC,CAAC,AA4DlB,EA5DS,AA4DT,CA5DU,EA+D7D,EAAE,CD6dkE,CAGpE,AC/dA,GD+dG,CAAE,UAAU,CAAC,CC/dA,GD+dI,CAAC,CAAC,EAAM,EAAF,AAAQ,EAAF,CAAQ,CAAF,GAAM,AAAE,GAAM,CAAF,CAAQ,EAAF,EAAM,AAAE,EAAM,EAAM,AAAR,EC/d5C,AD+dkD,EAAM,CAAS,CC/d7D,AD+d8D,CC/d7D,ADwGJ,AAwX1B,CAAC,CH/xBF,AG+xBG,IH9xBDM,EAAY,6CACZ,EAAW,KAAK,IAAI,CACpB,EAAY,KAAK,KAAK,CAEtB,EAAiB,qBACjB,EAAgB,EAAiB,yDAMjC,CAJA,CAIW,CAAC,EAAG,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,KAAK,CAgqFpF,CA/pFE,QA+pFO,EAAS,CAAC,EACjB,IAAI,EAAQ,EAAJ,EACR,OAAO,EAAI,GAAK,IAAM,EAAI,EAAI,EAAI,CACpC,CAIA,SAAS,EAAc,CAAC,EAMtB,IALA,IAAI,EAAG,EACL,EAAI,EACJ,EAAI,EAAE,MAAM,CACZ,EAAI,CAAC,CAAC,EAAE,CAAG,GAEN,EAAI,GAAI,CAGb,IADA,EAAI,GAAW,CADf,EAAI,CAAC,CAAC,IAAI,CAAG,EAAA,EACI,MAAM,CAChB,IAAK,EAAI,IAAM,GACtB,GAAK,CACP,CAGA,IAAK,EAAI,EAAE,MAAM,CAAwB,KAAtB,EAAE,UAAU,CAAC,EAAE,KAElC,OAAO,EAAE,KAAK,CAAC,EAAG,EAAI,GAAK,EAC7B,CAIA,SAAS,EAAQ,CAAC,CAAE,CAAC,EACnB,IAAI,EAAG,EACL,EAAK,EAAE,CAAC,CACR,EAAK,EAAE,CAAC,CACR,EAAI,EAAE,CAAC,CACP,EAAI,EAAE,CAAC,CACP,EAAI,EAAE,CAAC,CACP,EAAI,EAAE,CAAC,CAGT,GAAI,CAAC,GAAK,CAAC,EAAG,OAAO,KAMrB,GAJA,EAAI,GAAM,CAAC,CAAE,CAAC,EAAE,CAChB,EAAI,GAAM,CAAC,CAAE,CAAC,EAAE,CAGZ,GAAK,EAAG,OAAO,EAAI,EAAI,EAAI,CAAC,EAAI,EAGpC,GAAI,GAAK,EAAG,OAAO,EAMnB,GAJA,EAAI,EAAI,EACR,EAAI,GAAK,EAGL,CAAC,GAAM,CAAC,EAAI,OAAO,EAAI,EAAI,CAAC,EAAK,EAAI,EAAI,CAAC,EAG9C,GAAI,CAAC,EAAG,OAAO,EAAI,EAAI,EAAI,EAAI,CAAC,EAKhC,IAAK,EAAI,EAHT,EAAI,CAAC,EAAI,EAAG,MAAM,AAAN,GAAW,CAAD,CAAK,EAAG,MAAA,AAAM,EAAI,EAAI,EAGhC,EAAI,EAAG,IAAK,GAAI,CAAE,CAAC,EAAE,EAAI,CAAE,CAAC,EAAE,CAAE,OAAO,CAAE,CAAC,EAAE,CAAG,CAAE,CAAC,EAAE,CAAG,EAAI,EAAI,CAAC,EAG5E,OAAO,GAAK,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,CAAC,CACvC,CAMA,SAAS,EAAS,CAAC,CAAE,CAAG,CAAE,CAAG,CAAE,CAAI,EACjC,GAAI,EAAI,GAAO,EAAI,GAAO,IAAM,EAAU,GACxC,CAD4C,KACtC,MACJ,EAAkB,IAAQ,UAAA,CAAT,AAAmB,EAAiB,EAAb,QAAC,OAAO,EAC7C,EAAI,GAAO,EAAI,EAAM,kBAAoB,oBACzC,2BAAA,CAA2B,CAAI,OAAO,GAE/C,CAIA,SAAS,EAAM,CAAC,EACd,IAAI,EAAI,EAAE,CAAC,CAAC,MAAM,CAAG,EACrB,OAAO,EAAS,EAAE,CAAC,CAvvFR,EAuvFW,EAtvFtB,CAsvFmC,GAAK,EAAE,CAAC,CAAC,EAAE,CAAG,GAAK,CACxD,CAGA,SAAS,EAAc,CAAG,CAAE,CAAC,EAC3B,MAAO,CAAC,EAAI,MAAM,CAAG,EAAI,EAAI,MAAM,CAAC,GAAK,IAAM,EAAI,KAAK,CAAC,GAAK,CAAA,CAAG,EAC/D,EAAD,AAAK,EAAI,IAAM,IAAA,CAAI,CAAI,CAC1B,CAGA,SAAS,EAAa,CAAG,CAAE,CAAC,CAAE,CAAC,EAC7B,IAAI,EAAK,EAGT,GAAI,EAAI,EAAG,CAGT,IAAK,EAAK,EAAI,IAAK,EAAE,EAAG,GAAM,GAC9B,EAAM,EAAK,CAGb,MAIE,CAJK,EACL,EAAM,EAAI,MAAM,CAGZ,EAAE,EAAI,EAAK,CACb,IAAK,EAAK,EAAG,GAAK,EAAK,EAAE,EAAG,GAAM,GAClC,GAAO,CACT,MAAW,CAAJ,CAAQ,IACb,CADkB,CACZ,EAAI,KAAK,CAAC,EAAG,GAAK,IAAM,EAAI,KAAK,CAAC,EAAA,EAI5C,OAAO,CACT,CAMO,IAAI,EAhxFX,AAgxFuB,SAhxFd,EAAM,CAAY,EACzB,IAklBM,YAllBF,EAAK,EAAa,EACpB,EAAI,EAAU,SAAS,CAAG,CAAE,YAAa,EAAW,SAAU,KAAM,QAAS,IAAK,EAClF,EAAM,IAAIG,EAAU,GAUpB,CAPA,CAOiB,GAajB,CAXA,CAWgBI,EAMhB,CAJA,CAIa,CAAC,EAId,CAFA,CAEa,GAMb,CAJA,CAIU,CAAC,IAKX,CAHA,CAGU,IAGV,CADA,EACS,EAkBT,EAAc,EAId,CAFA,AAlBA,CAoBgB,EAGhB,CADA,CACS,CACP,CAtC2B,MAsCnB,AAhDmC,GAiD3C,UAAW,EACX,mBAAoB,AAxEkE,AASL,EAgEjF,GA7C6E,IAUR,MAQT,EA2B5C,IAChB,KA/BgF,OAyBN,KAMxD,IAClB,EAXyF,gBAWtE,EACnB,uBAAwB,IACxB,OAAQ,EACV,EAKA,CAHA,CAGW,uCACX,GAAiC,EAgBnC,SAAS,EAAU,CAAC,CAAE,CAAC,EACrB,IAAI,EAAU,EAAG,EAAa,EAAG,EAAG,EAAO,EAAK,EAC9C,EAAI,IAAI,CAGV,GAAI,CAAC,CAAC,AAzBuF,aAyB1E,CAAA,CAAS,CAAG,OAAO,IAAI,EAAU,EAAG,GAEvD,GAAS,MAAL,EAAW,CAEb,GAAI,IAAwB,IAAnB,EAAE,YAAY,CAAW,CAChC,EAAE,CAAC,CAAG,EAAE,CAAC,CAEL,CAAC,EAAE,CAAC,EAAI,EAAE,CAAC,CAAG,EAChB,EAAE,CAAC,CAAG,EAAE,CAAC,AADgB,CACb,KACH,EAAE,CAAC,CAAG,EACf,EAAE,CAAC,CAAG,CAAC,EADiB,AACf,CAAC,CAAG,EAAE,EAEf,EAAE,CAAC,CAAG,EAAE,CAAC,CACT,EAAE,CAAC,CAAG,EAAE,CAAC,CAAC,KAAK,IAGjB,MACF,CAEA,GAAI,AAAC,GAAoB,UAAZ,OAAO,CAAK,CAAQ,EAAS,EAAJ,GAAS,EAAG,CAMhD,GAHA,EAAE,CAAC,CAAG,EAAI,EAAI,GAAK,CAAD,CAAK,CAAC,EAAG,EAAC,CAAC,CAAI,EAG7B,IAAM,CAAC,CAAC,EAAG,CACb,IAAK,EAAI,EAAG,EAAI,EAAG,GAAK,GAAI,GAAK,GAAI,KAEjC,EAAI,EACN,EAAE,CAAC,CAAG,EAAE,CADO,AACN,CAAG,MAEZ,EAAE,CAAC,CAAG,EACN,EAAE,CAAC,CAAG,CAAC,EAAE,EAGX,MACF,CAEA,EAAM,OAAO,EACf,KAAO,CAEL,GAAI,CAAC,EAAU,IAAI,CAAC,EAAM,OAAO,IAAK,OAAO,EAAa,EAAG,EAAK,GAElE,EAAE,CAAC,CAAwB,IAArB,CAA0B,CAAtB,UAAU,CAAC,IAAY,EAAM,EAAI,KAAK,CAAC,GAAI,EAAC,CAAC,CAAI,CAC7D,CAGI,CAAC,EAAI,EAAI,OAAO,CAAC,IAAA,CAAI,CAAI,CAAC,IAAG,EAAM,EAAI,OAAO,CAAC,IAAK,GAAA,EAGpD,CAAC,EAAI,EAAI,MAAM,CAAC,KAAA,CAAK,CAAI,GAAG,AAG1B,EAAI,IAAG,GAAI,EACf,GAAK,CAAC,EAAI,KAAK,CAAC,EAAI,GACpB,EAAM,EAAI,SAAS,CAAC,EAAG,IACd,EAAI,GAAG,CAGhB,EAAI,EAAI,MAAA,AAAM,CAGlB,KAAO,CAOL,GAJA,EAAS,EAAG,EAAG,EAAS,MAAM,CAAE,QAIvB,IAAL,GAAW,EAEb,OAAO,EADP,EAAI,EACS,EADL,EAAU,GACF,EAAiB,EAAE,CAAC,CAAG,EAAG,EAFG,CAO/C,GAFA,EAAM,OAAO,GAET,EAAoB,UAAZ,OAAO,EAAe,CAGhC,GAAQ,AAAJ,KAAS,EAAG,OAAO,EAAa,EAAG,EAAK,EAAO,GAKnD,GAHA,EAAE,CAAC,CAAG,EAAI,EAAI,GAAK,CAAD,CAAO,EAAI,KAAK,CAAC,GAAI,EAAC,CAAC,CAAI,EAGzC,EAAU,KAAK,EAAI,EAAI,OAAO,CAAC,YAAa,IAAI,MAAM,CAAG,GAC3D,CAD+D,KACzD,MACJ,EAAgB,EAEtB,MACE,CADK,CACH,CAAC,CAAyB,KAAK,AAA3B,EAAI,UAAU,CAAC,IAAa,EAAM,EAAI,KAAK,CAAC,GAAI,EAAC,CAAC,CAAI,EAQ9D,IALA,EAAW,EAAS,KAAK,CAAC,EAAG,GAC7B,EAAI,EAAI,EAIH,EAAM,EAAI,MAAM,CAAE,EAAI,EAAK,IAAK,AACnC,GAA0C,EAAtC,EAAS,OAAO,CAAC,EAAI,EAAI,MAAM,CAAC,IAAS,CAC3C,GAAS,KAAL,AAAU,GAGZ,GAAI,EAAI,EAAG,CACT,EAAI,EACJ,SACF,MACK,GAAI,CAAC,IAGN,GAAO,EAAI,IAHQ,OAGG,KAAO,CAAD,CAAO,EAAI,WAAW,EAAA,CAAE,EACpD,GAAO,EAAI,WAAW,IAAO,EAAD,CAAO,EAAI,WAAW,EAAA,CAAE,EAAG,CACzD,GAAc,EACd,EAAI,CAAC,EACL,EAAI,EACJ,QACF,CAGF,OAAO,EAAa,EAAG,OAAO,GAAI,EAAO,EAC3C,CAIF,GAAQ,EAIJ,CAAC,EAAI,CAHT,EAAM,EAAY,EAAK,EAAG,GAAI,EAAE,EAAC,EAGpB,OAAO,CAAC,IAAA,CAAI,CAAI,CAAC,EAAG,EAAM,EAAI,OAAO,CAAC,IAAK,IACnD,EAAI,EAAI,MAAM,AACrB,CAGA,IAAK,EAAI,EAAyB,KAAtB,EAAI,UAAU,CAAC,GAAW,KAGtC,IAAK,EAAM,EAAI,MAAM,CAA4B,KAA1B,EAAI,UAAU,CAAC,EAAE,KAExC,GAAI,EAAM,EAAI,KAAK,CAAC,EAAG,EAAE,GAAM,CAI7B,GAHA,GAAO,EAGH,GAAS,EAAU,KAAK,EAC1B,EAAM,KAAO,CAAD,CA3QC,EA2QI,gBAAoB,AA1Q3C,IA0QiD,EAAU,EAAA,CAAE,CACrD,EADwD,IAClD,MACJ,EAAiB,EAAE,CAAC,CAAG,GAI7B,GAAI,CAAC,EAAI,EAAI,GAAI,CAAC,CAAI,EAGpB,EAAE,CAAC,CAAG,EAAE,CAHqB,AAGpB,CAAG,EAnRsC,QAsR7C,GAAI,EAAI,EAGb,EAAE,CAAC,CAAG,CAAC,EAHe,AAGb,CAAC,CAAG,EAAE,KACV,CAWL,GAVA,EAAE,CAAC,CAAG,EACN,EAAE,CAAC,CAAG,EAAE,CAMR,EAAI,CAAC,GAAI,CAAC,IAAI,AACV,EAAI,IAAG,KAAK,EAEZ,CAFuB,CAEnB,EAAK,CAGX,IALiC,AAG7B,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAI,KAAK,CAAC,EAAG,IAEzB,MAAiB,CAAV,CAAc,GACxB,EAAE,AAD4B,CAC3B,CAAC,IAAI,CAAC,CAAC,EAAI,KAAK,CAAC,EAAG,KAAK,GAG9B,EAAI,GAAW,CAAC,EAAM,EAAI,KAAK,CAAC,EAAA,CAAE,CAAE,MAAM,AAC5C,MACE,CADK,EACA,EAGP,KAAO,IAAK,GAAO,KACnB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EACZ,CACF,MAGE,CAHK,CAGH,CAAC,CAAG,CAAC,EAAE,CAAC,CAAG,EAEjB,AAFmB,CA61BnB,SAAS,EAAO,CAAC,CAAE,CAAC,CAAE,CAAE,CAAE,CAAE,EAC1B,IAAI,EAAI,EAAG,EAAI,EAAK,EAKpB,GAHU,MAAN,EAAY,EAAK,EAChB,EAAS,EAAI,EAAG,GAEjB,CAAC,EAAE,CAAC,CAAE,OAAO,EAAE,QAAQ,GAK3B,GAHA,EAAK,EAAE,CAAC,CAAC,EAAE,CACX,EAAK,EAAE,CAAC,CAEC,MAAL,AAAW,EACb,EAAM,EAAc,EAAE,CAAC,EACvB,EAAY,GAAN,GAAiB,GAAN,EAAW,EAAC,GAAM,GAAc,GAAM,CAAA,CAAU,CAC9D,EAAc,EAAK,GACnB,EAAa,EAAK,EAAI,UAezB,GAVA,EAAI,CAHJ,EAAI,EAAM,IAAI,EAAU,GAAI,EAAG,EAAA,EAGzB,CAAC,CAGP,EAAM,CADN,EAAM,EAAc,EAAE,EAAC,EACb,MAAM,CAON,GAAN,GAAiB,GAAN,EAAW,EAAC,GAAK,GAAK,GAAK,CAAA,CAAU,CAAG,CAGrD,KAAO,EAAM,EAAG,GAAO,IAAK,KAC5B,EAAM,EAAc,EAAK,EAG3B,MAKE,CALK,EACL,GAAK,GAAa,EAAR,EAAC,GAAY,EAAI,CAAA,CAAE,CAC7B,EAAM,EAAa,EAAK,EAAG,KAGvB,EAAI,EAAI,GACV,EADe,CACX,EAAE,EAAI,EAAG,IAAK,GAAO,IAAK,IAAK,GAAO,KAAA,MAG1C,GAAI,CADJ,GAAK,EAAI,CAAA,EACD,EAEN,CAFS,GACL,EAAI,GAAK,IAAK,GAAO,GAAA,EAClB,IAAK,GAAO,KAM3B,OAAO,EAAE,CAAC,CAAG,GAAK,EAAK,IAAM,EAAM,CACrC,CAKA,SAAS,EAAS,CAAI,CAAE,CAAC,EAKvB,IAJA,IAAI,EAAG,EACL,EAAI,EACJ,EAAI,IAAI,EAAU,CAAI,CAAC,EAAE,EAEpB,EAAI,EAAK,MAAM,CAAE,IAAK,AAEvB,AAAC,CADL,EAAI,IAAI,EAAU,CAAI,CAAC,GAAE,EAClB,CAAC,EAAI,CAAC,EAAI,EAAQ,EAAG,EAAA,CAAE,GAAM,IAAW,IAAN,GAAW,EAAE,CAAC,IAAK,GAAG,CAC7D,GAAI,EAIR,OAAO,CACT,CAOA,SAAS,EAAU,CAAC,CAAE,CAAC,CAAE,CAAC,EAKxB,IAJA,IAAI,EAAI,EACN,EAAI,EAAE,MAAM,CAGP,CAAC,CAAC,CAAC,EAAE,EAAE,CAAE,EAAE,GAAG,IAGrB,IAAK,EAAI,CAAC,CAAC,EAAE,CAAE,GAAK,GAAI,GAAK,GAAI,KAkBjC,MAfI,AAAC,GAAI,KAAI,GAAe,CAAX,AAAY,CAAI,EAG/B,EAAE,CAAC,CAAG,EAAE,CAHgC,AAG/B,CAAG,KAGH,EAAI,EAGb,EAAE,CAAC,CAAG,CAAC,EAHe,AAGb,CAAC,CAAG,EAAE,EAEf,EAAE,CAAC,CAAG,EACN,EAAE,CAAC,CAAG,GAGD,CACT,CAyDA,SAAS,EAAM,CAAC,CAAE,CAAE,CAAE,CAAE,CAAE,CAAC,EACzB,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAI,EACrB,EAAK,EAAE,CAAC,CAIV,CAHE,EAGE,EAAI,CAQN,EAAK,CAGH,IAAK,EAAI,EAAG,EAAI,CAAE,CAAC,EAAE,CAAE,GAAK,GAAI,GAAK,GAAI,KAIzC,GAAI,CAHJ,EAAI,GAAK,EAGD,EACN,CADS,IACJ,CACL,EAAI,EAIJ,EAAK,EAAU,CAHf,EAAI,CAAE,CAAC,EAAK,EAAA,AAAE,EAGK,CAAM,CAAC,EAAI,EAAI,EAAE,CAAG,SAIvC,GAAI,CAFJ,EAAK,EAAS,AAAC,IAAI,CAAC,IAAI,GAEd,EAAG,MAAM,CAEjB,CAFmB,EAEf,EAAG,CAGL,KAAO,EAAG,MAAM,EAAI,EAAI,EAAG,IAAI,CAAC,IAChC,EAAI,EAAK,EACT,EAAI,EACJ,KAAK,CACL,EAAI,IAAI,CAAW,CACrB,MACE,CADK,KACC,MAEH,CAIL,IAAK,EAAI,EAHT,EAAI,EAAI,CAAE,CAAC,EAAG,CAGF,GAAK,GAAI,GAAK,GAAI,KAG9B,KAAK,CAOL,EAAK,CAHL,EAAI,IAAI,CAAW,GAGV,EAAI,EAAI,EAAU,EAvDxB,AAuD4B,CAAM,CAAC,EAAI,EAAI,EAAE,CAAG,GACrD,CAkBF,GAfA,EAAI,GAAK,EAAK,GAKb,AAAc,EAHf,KAGG,CAAC,AAAmB,EAAd,EAAE,GAAa,EAAI,EAAI,EAAI,EAAI,CAAM,CAAC,EAAI,EAAI,EAAA,AAAE,EAEzD,EAAI,EAAK,EACN,CAAC,IAAM,CAAC,GAAY,EAAP,CAAC,GAAW,IAAO,EAAD,AAAG,AANqB,CAMpB,CAAG,EAAI,GAAI,CAAC,CAAC,CAChD,EAAK,GAAW,GAAN,EAAW,EAAO,GAAN,GAAW,GAAW,GAAN,EAEvC,CACC,CAAC,EAAI,EAAI,EAAI,EAAI,EAAI,CAAM,CAAC,EAAI,EAAE,CAAG,EAAI,CAAE,CAAC,EAAK,EAAA,AAAE,EAAI,GAAM,GAC7D,IAAO,EAAD,AAAG,CAAC,CAAG,EAAI,GAAI,CAAC,CAAC,CAEtB,EAAK,GAAK,CAAC,CAAE,CAAC,EAAE,CAiBlB,CAjBoB,KAJgD,CAKpE,EAAG,MAAM,CAAG,EAER,GAAG,AAGL,GAAM,EAAE,CAAC,CAAG,EAGZ,CAAE,CAAC,EAAE,CAAG,CAAM,CAAC,CAAC,GAAW,IAAK,CAAQ,AAAR,IAAqB,AAAT,CAC5C,EAAE,CAAC,CAAG,CAAC,GAAM,GAIb,CAAE,CAAC,EAAE,CAAG,EAAE,CAAC,CAAG,EAGT,EAkBT,GAdS,GAAG,AAAR,GACF,EAAG,MAAM,CAAG,EACZ,EAAI,EACJ,MAEA,EAAG,MAAM,CAAG,EAAK,EACjB,EAAI,CAAM,CAAC,GAAW,EAAE,CAIxB,CAAE,CAAC,EAAG,CAAG,EAAI,EAAI,EAAU,EAAI,CAAM,CAAC,EAAI,EAAE,CAAG,CAAM,CAAC,EAAE,EAAI,EAAI,GAI9D,EAEF,CAFK,MAKH,AAHQ,GAGE,GAAN,EAAS,CAGX,IAAK,EAAI,EAAG,EAAI,CAAE,CAAC,EAAE,CAAE,GAAK,GAAI,GAAK,GAAI,KAEzC,IADA,EAAI,CAAE,CAAC,EAAE,EAAI,EACR,EAAI,EAAG,GAAK,GAAI,GAAK,GAAI,KAG1B,GAAK,GAAG,CACV,EAAE,CAAC,SACC,CAAE,CAAC,EAAE,GAAU,CAAE,AAAR,CAAS,EAAE,EAAG,GAG7B,KACF,KAAO,CAEL,GADA,CAAE,CAAC,EAAG,EAAI,QACN,CAAE,CAAC,EAAG,CAAU,GAAN,GACd,CAAE,CAAC,IAAK,CAAG,EACX,EAAI,CACN,CAKJ,IAAK,EAAI,EAAG,MAAM,CAAc,IAAZ,CAAE,CAAC,EAAE,EAAE,CAAQ,EAAG,GAAG,IAC3C,CAGI,EAAE,CAAC,CAAG,EACR,EAAE,CAAC,CAAG,EAAE,CADS,AACR,CAAG,KAGH,EAAE,CAAC,CAAG,IACf,EAAE,CAAC,CAAG,CAAC,AADiB,EACf,CAAC,CAAG,EAAE,CAEnB,CAEA,OAAO,CACT,CAGA,SAAS,EAAQ,CAAC,EAChB,IAAI,EACF,EAAI,EAAE,CAAC,QAET,AAAU,MAAM,CAAZ,EAAmB,EAAE,QAAQ,IAEjC,EAAM,EAAc,EAAE,CAAC,EAEvB,EAAM,GAAK,GAAc,GAAK,EAC1B,EAAc,EAAK,GACnB,EAAa,EAAK,EAAG,KAElB,EAAE,CAAC,CAAG,EAAI,IAAM,EAAM,EAC/B,CAorCA,OAx1EA,EAAU,KAAK,CAAG,EAElB,EAAU,QAAQ,CAAG,EACrB,EAAU,UAAU,CAAG,EACvB,EAAU,UAAU,CAAG,EACvB,EAAU,WAAW,CAAG,EACxB,EAAU,aAAa,CAAG,EAC1B,EAAU,eAAe,CAAG,EAC5B,EAAU,eAAe,CAAG,EAC5B,EAAU,eAAe,CAAG,EAC5B,EAAU,gBAAgB,CAAG,EAC7B,EAAU,MAAM,CAAG,EAqCnB,EAAU,MAAM,CAAG,EAAU,GAAG,CAAG,SAAU,CAAG,EAC9C,IAAI,EAAG,EAEP,GAAW,MAAP,AAAa,EAEf,GAAkB,UAAd,OAAO,EAAiB,CAsC1B,GAlCI,EAAI,cAAc,CAAC,EAAI,mBAAmB,CAE5C,EADA,EAAI,CAAG,CAAC,EAAE,CACE,AAAH,GAAM,GAAK,GACpB,EAAiB,GAKf,EAAI,cAAc,CAAC,EAAI,kBAAkB,CAE3C,EADA,EAAI,CAAG,CAAC,EAAE,CACD,AAAG,EAAG,EAAG,GAClB,EAAgB,GAOd,EAAI,cAAc,CAAC,EAAI,mBAAmB,CAExC,CADJ,EAAI,CAAG,CAAC,EAAA,AAAE,GACD,EAAE,GAAG,EAAE,AACd,EAAS,CAAC,CAAC,EAAE,CAAE,CAAC,IAAK,EAAG,GACxB,EAAS,CAAC,CAAC,EAAE,CAAE,GAAG,GAAK,GACvB,EAAa,CAAC,CAAC,EAAE,CACjB,EAAa,CAAC,CAAC,EAAE,GAEjB,EAAS,EAAG,CAAC,KAAK,GAAK,GACvB,EAAa,CAAC,CAAC,EAAa,EAAI,EAAI,CAAC,GAAI,CAAC,GAO1C,EAAI,cAAc,CAAC,EAAI,SAEzB,CAFmC,EAE/B,CADJ,EAAI,CAAG,CAAC,EAAA,AAAE,GACD,EAAE,GAAG,CACZ,CADc,CACL,CAAC,CAAC,EAAE,CAAE,CAAC,IAAK,CAAC,EAAG,GACzB,EAAS,CAAC,CAAC,EAAE,CAAE,GAAG,GAAK,GACvB,EAAU,CAAC,CAAC,EAAE,CACd,EAAU,CAAC,CAAC,EAAE,MAGd,GADA,EAAS,EAAG,CAAC,KAAK,GAAK,GACnB,EACF,CADK,CACK,CAAC,CAAC,EAAU,EAAI,EAAI,CAAC,GAAI,CAAC,MAEpC,MAAM,MACJ,EAAiB,EAAI,oBAAsB,GAQnD,GAAI,EAAI,cAAc,CAAC,EAAI,UAEzB,CAFoC,EAEhC,AAAM,CAAC,CAAC,CADZ,EAAI,AACW,CADR,CAAC,EAAA,AAAE,MAER,GAAI,EACF,CADK,EACgB,IAAjB,OAAO,QAAyB,SAClC,CAAD,MAAQ,eAAe,EAAI,OAAO,WAAA,AAAW,EAC5C,CAD+C,CACtC,OAGT,MADA,EAAS,CAAC,EACJ,MACJ,EAAiB,2BAGrB,EAAS,OAGX,MAAM,MACJ,EAAiB,EAAI,uBAAyB,GAsBpD,GAhBI,EAAI,cAAc,CAAC,EAAI,gBAAgB,CAEzC,EADA,EAAI,CAAG,CAAC,EAAE,CACD,AAAG,EAAG,EAAG,GAClB,EAAc,GAKZ,EAAI,cAAc,CAAC,EAAI,kBAAkB,CAE3C,EADA,EAAI,CAAG,CAAC,EAAE,CACD,AAAG,GAAG,GAAK,GACpB,EAAgB,GAKd,EAAI,cAAc,CAAC,EAAI,UAEzB,CAFoC,EAEpB,UAAZ,OAAO,AADX,EAAI,CAAG,CAAC,EAAE,AAAF,EACkB,EAAS,OAC9B,MAAM,MACT,EAAiB,EAAI,mBAAqB,GAK9C,GAAI,EAAI,cAAc,CAAC,EAAI,YAAa,CAKtC,GAAgB,UAAZ,EAAwB,KAAjB,AAJX,EAAI,CAAG,CAAC,EAAA,AAAE,GAImB,wBAAwB,IAAI,CAAC,GAIxD,CAJ4D,KAItD,MACJ,EAAiB,EAAI,aAAe,GAJtC,EAAmD,cAAlB,EAAE,KAAK,CAAC,EAAG,IAC5C,EAAW,CAKf,CAEF,MAGE,CAHK,KAGC,MACJ,EAAiB,oBAAsB,GAI7C,MAAO,CACL,eAAgB,EAChB,cAAe,EACf,eAAgB,CAAC,EAAY,EAAW,CACxC,MAAO,CAAC,EAAS,EAAQ,CACzB,OAAQ,EACR,YAAa,EACb,cAAe,EACf,OAAQ,EACR,SAAU,CACZ,CACF,EAYA,EAAU,WAAW,CAAG,SAAU,CAAC,EACjC,GAAI,CAAC,IAAwB,IAAnB,EAAE,YAAY,CAAW,OAAO,EAC1C,GAAI,CAAC,EAAU,KAAK,CAAE,OAAO,EAE7B,IAAI,EAAG,EACL,EAAI,EAAE,CAAC,CACP,EAAI,EAAE,CAAC,CACP,EAAI,EAAE,CAAC,CAET,EAAK,GAA2B,kBAAvB,AAAyC,GAAxC,CAAA,CAAE,QAAQ,CAAC,IAAI,CAAC,IAExB,GAAI,CAAC,AAAM,OAAW,AAAN,MAAO,CAAC,EAAK,GAAK,CAAC,KAAO,KAAK,GAAO,IAAM,EAAU,GAAI,CAGxE,GAAa,IAAT,CAAC,CAAC,EAAE,CAAQ,CACd,GAAU,IAAN,GAAW,AAAa,MAAX,MAAM,CAAQ,OAAO,EACtC,MAAM,CACR,CAQA,GAJI,CADJ,EAAI,CAAC,GAAI,CAAC,GAAI,CAAA,CACN,IAAG,KAAK,EAIZ,OAAO,CAAC,CAAC,EAAE,EAAE,MAAM,EAAI,EAAG,CAE5B,IAAK,EAAI,EAAG,EAAI,EAAE,MAAM,CAAE,IAAK,AAE7B,GAAI,CADJ,EAAI,CAAC,CAAC,EAAA,AAAE,EACA,GAAK,KAAK,IAAQ,IAAM,EAAU,GAAI,MAAM,EAItD,GAAU,IAAN,EAAS,OAAO,CACtB,EACF,MAGK,GAAU,OAAN,GAAc,AAAM,QAAQ,GAAO,OAAN,GAAoB,IAAN,GAAiB,KAAN,CAAO,CAAC,CACvE,EAD0E,KACnE,CAGT,OAAM,MACH,EAAiB,sBAAwB,EAC9C,EAQA,EAAU,OAAO,CAAG,EAAU,GAAG,CAAG,WAClC,OAAO,EAAS,UAAW,CAAC,EAC9B,EAQA,EAAU,OAAO,CAAG,EAAU,GAAG,CAAG,WAClC,OAAO,EAAS,UAAW,EAC7B,qBAoBuB,KAAM,MAAM,GAAgB,EAAX,MACnC,WAAc,OAAO,EAPV,iBAOoB,KAAK,MAAM,GAAe,EAAV,AAC/C,WAAc,MAAQ,CAAiB,WAAhB,KAAK,MAAM,IAAkB,CAAC,CAAI,SACxD,AAAgB,EAAjB,WAAM,MAAM,IAAgB,CAAC,AAAG,EAVrC,EAAU,MAAM,CAYP,EAZW,AAAD,OAYA,CAAE,EACjB,IAAI,EAAG,EAAG,EAAG,EAAG,EACd,EAAI,EACJ,EAAI,EAAE,CACN,EAAO,IAAI,EAAU,GAOvB,GALI,AAAM,QAAM,EAAK,EAChB,EAAS,EAAI,GAAG,IAErB,EAAI,EAAS,KAAK,CAEd,EAGF,GAAI,GAHM,IAGC,eAAe,CAAE,CAI1B,IAFA,EAAI,OAAO,eAAe,CAAC,IAAI,YAAY,GAAK,IAEzC,EAAI,GAAI,AAcT,CANJ,EAAW,OAAP,CAAC,CAAC,CAAe,CAAb,EAAc,CAAC,CAAC,EAAI,EAAE,GAAK,EAAA,CAAE,GAM5B,MAAM,AACb,EAAI,OAAO,eAAe,CAAC,IAAI,YAAY,IAC3C,CAAC,CAAC,EAAE,CAAG,CAAC,CAAC,EAAE,CACX,CAAC,CAAC,EAAI,EAAE,CAAG,CAAC,CAAC,EAAE,GAKf,EAAE,IAAI,CAAC,EAAI,MACX,GAAK,GAGT,EAAI,EAAI,CAGV,MAAO,GAAI,OAAO,WAAW,CAAE,CAK7B,IAFA,EAAI,OAAO,WAAW,CAAC,GAAK,GAErB,EAAI,GAUL,AAVS,CAMb,EAAK,CAAQ,GAAP,CAAC,CAAC,EAAE,AAAG,CAAE,CAAI,gBAA+B,cAAX,CAAC,CAAC,EAAI,EAAE,CAChC,YAAX,CAAC,CAAC,EAAI,EAAE,CAA8B,UAAX,CAAC,CAAC,AAC9B,EADkC,EAAE,EACnC,CAAC,CAAC,EAAI,EAAE,EAAI,EAAA,CAAE,EAAK,CAAC,CAAC,AAAH,EAAO,EAAE,GAAI,CAAC,CAAI,CAAC,CAAC,EAAI,EAAA,AAAE,GAEvC,KACP,CADa,MACN,WAAW,CAAC,GAAG,IAAI,CAAC,EAAG,IAI9B,EAAE,IAAI,CAAC,EAAI,MACX,GAAK,GAGT,EAAI,EAAI,CACV,MAEE,CAFK,KACL,GAAS,EACH,MACJ,EAAiB,sBAKvB,GAAI,CAAC,EAEH,KAAO,CAFI,CAEA,GAAI,AAET,CADJ,EAAI,GAAA,EACI,OAAM,CAAC,CAAC,IAAI,CAAG,EAAI,IAAA,EAc/B,IAVA,EAAI,CAAC,CAAC,EAAE,EAAE,CACV,MAAM,AAGF,GAAK,IAAI,AACX,EAAI,CAAQ,CAAC,GAAW,EAAG,CAC3B,CAAC,CAAC,EAAE,CAAG,EAAU,EAAI,GAAK,GAIZ,IAAT,CAAC,CAAC,EAAE,CAAQ,EAAE,GAAG,GAAI,KAG5B,GAAI,EAAI,EACN,CADS,CACL,CAAC,EAAI,EAAE,KACN,CAGL,IAAK,EAAI,CAAC,EAAI,AAAS,KAAR,CAAC,EAAE,CAAQ,EAAE,MAAM,CAAC,EAAG,GAAI,KAAK,EAG/C,IAAK,EAAI,EAAG,EAAI,CAAC,CAAC,EAAE,CAAE,GAAK,GAAI,GAAK,GAAI,KAGpC,IAAI,GAAU,GAAK,IAAW,CACpC,CAIA,OAFA,EAAK,CAAC,CAAG,EACT,EAAK,CAAC,CAAG,EACF,CACT,EASF,EAAU,GAAG,CAAG,WAId,IAHA,IAAI,EAAI,EACN,EAAO,UACP,EAAM,IAAI,EAAU,CAAI,CAAC,EAAE,EACtB,EAAI,EAAK,MAAM,EAAG,EAAM,EAAI,IAAI,CAAC,CAAI,CAAC,IAAI,EACjD,OAAO,CACT,EAOA,EAAc,WACZ,IAAI,EAAU,aAOd,SAAS,EAAU,CAAG,CAAE,CAAM,CAAE,CAAO,CAAE,CAAQ,EAO/C,IANA,IAAI,EAEF,EADA,EAAM,CAAC,EAAE,CAET,EAAI,EACJ,EAAM,EAAI,MAAM,CAEX,EAAI,GAAM,CACf,IAAK,EAAO,EAAI,MAAM,CAAE,IAAQ,CAAG,CAAC,EAAK,EAAI,GAI7C,IAFA,CAAG,CAAC,EAAE,EAAI,EAAS,OAAO,CAAC,EAAI,MAAM,CAAC,MAEjC,EAAI,EAAG,EAAI,EAAI,MAAM,CAAE,IAAK,AAE3B,CAAG,CAAC,EAAE,CAAG,EAAU,GAAG,CACN,MAAd,CAAG,CAAC,EAAI,EAAE,GAAU,CAAG,CAAC,EAAI,EAAE,EAAG,EACrC,CAAG,CAAC,EAAI,EAAE,EAAI,CAAG,CAAC,EAAE,CAAG,EAAU,EACjC,CAAG,CAAC,EAAE,EAAI,EAGhB,CAEA,OAAO,EAAI,OAAO,EACpB,CAKA,OAAO,SAAU,CAAG,CAAE,CAAM,CAAE,CAAO,CAAE,CAAI,CAAE,CAAgB,EAC3D,IAAI,EAAU,EAAG,EAAG,EAAG,EAAG,EAAG,EAAI,EAC/B,EAAI,EAAI,OAAO,CAAC,KAChB,EAAK,EACL,EAAK,EA+BP,IA5BI,GAAK,GAAG,CACV,EAAI,EAGJ,EAAgB,EAChB,EAAM,EAAI,OAAO,CAAC,IAAK,IAEvB,EAAI,CADJ,EAAI,IAAI,EAAU,EAAA,EACZ,GAAG,CAAC,EAAI,MAAM,CAAG,GACvB,EAAgB,EAKhB,EAAE,CAAC,CAAG,EAAU,EAAa,EAAc,EAAE,CAAC,EAAG,EAAE,CAAC,CAAE,KACrD,GAAI,EAAS,GACd,EAAE,CAAC,CAAG,EAAE,CAAC,CAAC,MAAM,EAUlB,EAAI,EAAI,CALR,EAAK,EAAU,EAAK,EAAQ,EAAS,GACjC,EAAW,EAAU,CAAA,CAAO,EAC5B,EAAW,AAAZ,EAAqB,CAAA,CAAQ,CAAA,CAD7B,CAIQ,MAAM,CAGC,GAAX,CAAE,CAAC,EAAE,EAAE,CAAO,EAAG,GAAG,IAG3B,GAAI,CAAC,CAAE,CAAC,EAAE,CAAE,OAAO,EAAS,MAAM,CAAC,GAqCnC,GAlCI,EAAI,EACN,CADS,CACP,GAEF,EAAE,CAAC,CAAG,EACN,EAAE,CAAC,CAAG,EAGN,EAAE,CAAC,CAAG,EAEN,EAAK,CADL,EAAI,EAAI,EAAG,EAAG,EAAI,EAAI,EAAA,EACf,CAAC,CACR,EAAI,EAAE,CAAC,CACP,EAAI,EAAE,CAAC,EAST,EAAI,CAAE,CAHN,AAGO,EAHH,EAAI,EAAK,EAGJ,CAIT,EAAI,EAAU,EACd,EAAI,GAAK,EAAI,GAAkB,AAAb,OAAE,CAAC,EAAI,EAAE,CAE3B,EAAI,EAAK,EAAI,CAAM,MAAL,IAAa,CAAC,GAAY,EAAP,CAAC,GAAW,IAAO,EAAE,AAAH,CAAI,CAAG,EAAI,GAAI,CAAC,CAAC,CAC5D,EAAI,GAAK,GAAK,IAAW,CAAP,EAAC,GAAW,GAAW,GAAN,GAAuB,EAAZ,CAAE,CAAC,EAAI,EAAE,EACxD,IAAO,EAAD,AAAG,CAAC,CAAG,EAAI,GAAI,CAAC,CAAC,CAK1B,EAAI,GAAK,CAAC,CAAE,CAAC,EAAE,CAGjB,CAHmB,CAGb,EAAI,EAAa,EAAS,MAAM,CAAC,GAAI,CAAC,EAAI,EAAS,MAAM,CAAC,IAAM,EAAS,MAAM,CAAC,OACjF,CAML,GAHA,EAAG,MAAM,CAAG,EAGR,EAGF,CAHK,GAGA,EAAE,EAAS,EAAE,CAAE,CAAC,EAAE,EAAE,CAAG,GAC1B,CAAE,CAAC,EAAE,CAAG,CAD4B,CAG/B,GAAG,CACN,EAAE,EACF,EAAK,CAAC,EAAE,CAAC,MAAM,CAAC,IAMtB,IAAK,EAAI,EAAG,MAAM,CAAE,CAAC,CAAE,CAAC,EAAE,EAAE,GAG5B,IAAK,EAAI,EAAG,EAAM,GAAI,GAAK,EAAG,GAAO,EAAS,MAAM,CAAC,CAAE,CAAC,IAAI,GAG5D,EAAM,EAAa,EAAK,EAAG,EAAS,MAAM,CAAC,GAC7C,CAGA,OAAO,CACT,CACF,IAIA,EAAO,WAGL,SAAS,EAAS,CAAC,CAAE,CAAC,CAAE,CAAI,EAC1B,IAAI,EAAG,EAAM,EAAK,EAChB,EAAQ,EACR,EAAI,EAAE,MAAM,CACZ,EAAM,IAAI,EACV,EAAM,IAAI,EAAY,EAExB,IAAK,EAAI,EAAE,KAAK,GAAI,KAAM,AAGxB,EAAI,GAFJ,EAAM,CAEI,AAFH,CAAC,EAAE,GAAG,CAAA,EAEG,CADhB,EAAM,CAAC,CAAC,EAAE,GAAG,GAAY,EACH,EAEtB,EAAQ,CAAC,CADT,EAAO,EAAM,EAAQ,IAAI,MAA0B,CAAA,EACnC,GADsB,AACf,CAAC,EAAK,EAAD,AAr5BtBP,EAq5B2B,GAn5BvC,AAm5BmD,CAAC,CAAI,EAAM,EACxD,CAAC,CAAC,EAAE,CAp5BC,AAo5BE,EAAO,EAKhB,OAFI,GAAO,GAAI,CAAC,EAAM,CAAC,MAAM,CAAC,EAAA,EAEvB,CACT,CAEA,SAAS,EAAQ,CAAC,CAAE,CAAC,CAAE,CAAE,CAAE,CAAE,EAC3B,IAAI,EAAG,EAEP,GAAI,GAAM,EACR,EADY,AACN,EAAK,EAAK,EAAI,CAAC,OAGrB,IAAK,EAAI,EAAM,EAAG,EAAI,EAAI,IAAK,AAE7B,GAAI,CAAC,CAAC,EAAE,EAAI,CAAC,CAAC,EAAE,CAAE,CAChB,EAAM,CAAC,CAAC,EAAE,CAAG,CAAC,CAAC,EAAE,CAAG,EAAI,CAAC,EACzB,KACF,CAIJ,OAAO,CACT,CAEA,SAAS,EAAS,CAAC,CAAE,CAAC,CAAE,CAAE,CAAE,CAAI,EAI9B,IAHA,IAAI,EAAI,EAGD,KACL,CADY,AACX,CAAC,EAAG,EAAI,EACT,IAAI,CAAC,CAAC,EAAG,CAAG,CAAC,CAAC,EAAA,AAAG,EACjB,CADoB,AACnB,CAAC,EAAG,CADmB,AAChB,EAAI,EAAO,CAAC,CAAC,EAAG,CAAG,CAAC,CAAC,EAAG,CAIlC,KAAO,CAAC,CAAC,CAAC,EAAE,EAAI,EAAE,MAAM,CAAG,EAAG,EAAE,MAAM,CAAC,EAAG,IAC5C,CAGA,OAAO,SAAU,CAAC,CAAE,CAAC,CAAE,CAAE,CAAE,CAAE,CAAE,CAAI,EACjC,IAAI,EAAK,EAAG,EAAG,EAAM,EAAG,EAAM,EAAO,EAAG,EAAI,EAAK,EAAM,EAAM,EAAI,EAAI,EACnE,EAAI,EACJ,EAAI,EAAE,CAAC,EAAI,EAAE,CAAC,CAAG,EAAI,CAAC,EACtB,EAAK,EAAE,CAAC,CACR,EAAK,EAAE,CAAC,CAGV,GAAI,CAAC,GAAM,CAAC,CAAE,CAAC,EAAE,EAAI,CAAC,GAAM,CAAC,CAAE,CAAC,EAAE,CAEhC,CAFkC,MAE3B,IAAI,EAGV,CAAC,EAAE,CAAC,EAAI,CAAC,CADT,CACW,CAAC,GAAK,CAAD,CAAM,GAAM,CAAE,CAAC,EAAE,EAAI,CAAE,CAAC,EAAE,CAAG,CAAC,CAAA,CAAE,CAAI,IAGnD,EADA,CACM,AAAS,IAAP,CAAC,EAAE,EAAS,CAAC,EAAS,EAAJ,EAAQ,EAAI,CAJY,EAqBtD,IAZA,EADA,AACK,GADD,IAAI,EAAU,EAAA,EACX,CAAC,CAAG,EAAE,CAEb,EAAI,GADJ,EAAI,AACK,EADH,CAAC,CAAG,GAAE,AAAC,EACA,EAER,IACH,EADS,IAVmE,CAWrE,AACP,EAAI,EAAS,EAAE,CAAC,GAAG,EAAY,EAAS,EAAE,CAAC,GAAG,EAC9C,EAAI,IAAI,CAAW,GAKhB,EAAI,EAAG,CAAE,CAAC,EAAE,GAAK,CAAE,AAAH,CAAI,EAAE,GAAI,CAAC,CAAG,KAInC,GAFI,CAAE,CAAC,EAAE,EAAI,CAAD,AAAG,CAAC,EAAE,GAAI,CAAC,EAAG,IAEtB,EAAI,EACN,CADS,CACN,IAAI,CAAC,GACR,GAAO,MACF,CAwBL,IAvBA,EAAK,EAAG,MAAM,CACd,EAAK,EAAG,MAAM,CACd,EAAI,EACJ,GAAK,GAIL,EAAI,EAAU,GAAQ,CAAE,CAAC,EAAE,AAAN,EAAS,CAAC,CAAA,EAIvB,GAAG,CACT,EAAK,EAAS,EAAI,EAAG,GACrB,EAAK,EAAS,EAAI,EAAG,GACrB,EAAK,EAAG,MAAM,CACd,EAAK,EAAG,MAAM,EAGhB,EAAK,EAEL,EAAO,CADP,EAAM,EAAG,KAAK,CAAC,EAAG,EAAA,EACP,MAAM,CAGV,EAAO,EAAI,CAAG,CAAC,IAAO,CAAG,GAEhC,EAAK,CAAC,EAAE,CAAC,MAAM,CAAC,AADhB,EAAK,EAAG,KAAK,IAEb,EAAM,CAAE,CAAC,EAAE,CACP,CAAE,CAAC,EAAE,EAAI,EAAO,GAAG,IAIvB,EAAG,CAOD,GANA,EAAI,EAMA,CAHJ,EAAM,EAAQ,EAAI,EAAK,EAAI,EAAA,EAGjB,EAAG,CAqBX,GAjBA,EAAO,CAAG,CAAC,EAAE,CACT,GAAM,IAAM,EAAO,EAAO,GAAQ,CAAG,CAAC,EAAL,AAAO,GAAI,CAAC,EAgB7C,CAbJ,EAAI,EAAU,EAAO,EAAA,EAab,EAcN,CAdS,GAGL,GAAK,IAAM,EAAI,GAAO,EAI1B,EAAQ,CADR,EAAO,EAAS,EAAI,EAAG,EAAA,EACV,MAAM,CACnB,EAAO,EAAI,MAAM,CAMyB,EAAG,CAAtC,EAAQ,EAAM,EAAK,EAAO,IAC/B,IAGA,EAAS,EAAM,EAAK,EAAQ,EAAK,EAAI,EAAO,GAC5C,EAAQ,EAAK,MAAM,CACnB,EAAM,OAQC,GAAL,AAAQ,IAGV,EAAM,GAAI,EAKZ,EADA,AACQ,GADD,EAAG,KAAK,EAAA,EACF,MAAM,CAUrB,GAPI,EAAQ,IAAM,EAAO,CAAC,EAAE,CAAC,MAAM,CAAC,EAAA,EAGpC,EAAS,EAAK,EAAM,EAAM,GAC1B,EAAO,EAAI,MAAM,CAGN,CAAC,GAAG,AAAX,EAMF,KAAoC,EAA7B,AAAgC,EAAxB,EAAI,EAAK,EAAI,IAC1B,IAGA,EAAS,EAAK,EAAK,EAAO,EAAK,EAAI,EAAM,GACzC,EAAO,EAAI,MAGjB,AAHuB,MAGJ,CAAZ,EAAe,CAAX,IACT,IACA,EAAM,CAAC,EAAE,EAIX,CAAE,CAAC,IAAI,CAAG,EAGN,CAAG,CAAC,EAAE,CACR,CAAG,AADO,CACN,IAAO,CAAG,CAAE,CAAC,EAAG,EAAI,GAExB,EAAM,CAAC,CAAE,CAAC,EAAG,CAAC,CACd,EAAO,EAEX,OAAS,CAAC,IAAO,GAAgB,MAAV,CAAG,CAAC,EAAE,AAAI,CAAI,EAAK,IAAK,AAE/C,EAAO,AAAU,OAAP,CAAC,EAAE,CAGT,AAAC,CAAE,CAAC,EAAE,EAAE,EAAG,MAAM,CAAC,EAAG,EAC3B,CAEA,SAAI,EAAc,CAGhB,IAAK,CAHK,CAGD,EAAG,EAAI,CAAE,CAAC,EAAE,CAAE,GAAK,GAAI,GAAK,GAAI,KAEzC,EAAM,EAAG,GAAM,EAAD,AAAG,CAAC,CAAG,KAAI,GAAe,CAAX,AAAY,CAAI,EAAG,EAAI,EAGtD,MACE,CADK,CACH,CAAC,CAAG,EACN,EAAE,CAAC,CAAG,CAAC,EAGT,OAAO,CACT,CACF,IA4HM,EAAa,8BACf,EAAW,cACX,EAAY,cACZ,EAAkB,qBAClB,EAAmB,6BALvB,EAOS,SAAU,CAAC,CAAE,CAAG,CAPT,AAAD,AAOY,CAAK,CAAE,CAAC,EAC/B,IAAI,EACF,EAAI,EAAQ,EAAM,EAAI,OAAO,CAAC,EAAkB,IAGlD,GAAI,EAAgB,IAAI,CAAC,GACvB,CAD2B,CACzB,CAAC,CAAG,MAAM,GAAK,KAAO,EAAI,EAAI,CAAC,EAAI,MAChC,CACL,GAAI,CAAC,IAGH,EAAI,CAHM,CAGJ,OAAO,CAAC,EAAY,SAAU,CAAC,CAAE,CAAE,CAAE,CAAE,EAE3C,OADA,EAAO,AAA2B,MAA1B,EAAK,EAAG,WAAW,EAAA,CAAE,CAAW,GAAW,KAAN,EAAY,EAAI,EACtD,AAAC,GAAK,GAAK,EAAY,EAAL,CAC3B,GAEI,GAAG,CACL,EAAO,EAGP,EAAI,EAAE,OAAO,CAAC,EAAU,MAAM,OAAO,CAAC,EAAW,SAG/C,GAAO,GAAG,OAAO,IAAI,EAAU,EAAG,GAKxC,GAAI,EAAU,KAAK,CACjB,CADmB,KACb,MACH,EAAiB,SAAW,CAAD,CAAK,SAAW,EAAI,EAAA,CAAE,CAAI,YAAc,EAIxE,GAAE,CAAC,CAAG,IACR,CAEA,EAAE,CAAC,CAAG,EAAE,CAAC,CAAG,IACd,EA4LF,EAAE,aAAa,CAAG,EAAE,GAAG,CAAG,WACxB,IAAI,EAAI,IAAI,EAAU,IAAI,EAE1B,OADI,EAAE,CAAC,CAAG,IAAG,EAAE,CAAC,EAAG,EACZ,CACT,EAUA,EAAE,UAAU,CAAG,SAAU,CAAC,CAAE,CAAC,EAC3B,OAAO,EAAQ,IAAI,CAAE,IAAI,EAAU,EAAG,GACxC,EAgBA,EAAE,aAAa,CAAG,EAAE,EAAE,CAAG,SAAU,CAAE,CAAE,CAAE,EACvC,IAAI,EAAG,EAAG,EAGV,CAFE,EAEQ,MAAN,AAAY,EAKd,OAJA,EAAS,EAAI,GAAG,IACN,MAAN,EAAY,EAAK,EAChB,EAAS,EAAI,EAAG,GAEd,EAAM,IAAI,MAPT,EAOuB,EAP3B,AAOuB,AAAS,KAAE,CAAC,CAAG,EAAG,GAG/C,GAAI,CAAC,CAAC,EAAI,KAAE,CAAC,EAAG,OAAO,KAIvB,GAHA,EAAI,CAAC,CAAC,EAAI,EAAE,MAAM,EAAG,CAAC,CAAI,EAAS,IAAI,CAAC,CAAC,GAAG,CAAA,CAAS,IAAI,AAGrD,EAAI,CAAC,CAAC,EAAE,CAAE,KAAO,EAAI,IAAM,EAAG,GAAK,GAAI,KAG3C,OAFI,EAAI,IAAG,GAAI,EAER,CACT,EAuBA,EAAE,SAAS,CAAG,EAAE,GAAG,CAAG,SAAU,CAAC,CAAE,CAAC,EAClC,OAAO,EAAI,IAAI,CAAE,IAAI,EAAU,EAAG,GAAI,EAAgB,EACxD,EAOA,EAAE,kBAAkB,CAAG,EAAE,IAAI,CAAG,SAAU,CAAC,CAAE,CAAC,EAC5C,OAAO,EAAI,IAAI,CAAE,IAAI,EAAU,EAAG,GAAI,EAAG,EAC3C,EAkBA,EAAE,eAAe,CAAG,EAAE,GAAG,CAAG,SAAU,CAAC,CAAE,CAAC,EACxC,IAAI,EAAM,EAAU,EAAG,EAAG,EAAM,EAAQ,EAAQ,EAAQ,EACtD,EAAI,IAAI,CAKV,GAAI,CAHJ,EAAI,IAAI,EAAU,EAAA,EAGZ,CAAC,EAAI,CAAC,EAAE,SAAS,GACrB,CADyB,KACnB,MACH,EAAiB,4BAA8B,EAAQ,IAS5D,GANI,AAAK,SAAM,GAAI,IAAI,EAAU,EAAA,EAGjC,EAAS,EAAE,CAAC,CAAG,GAGX,CAAC,EAAE,CAAC,EAAI,CAAC,EAAE,CAAC,CAAC,EAAE,EAAc,GAAV,EAAE,CAAC,CAAC,EAAE,EAAS,CAAC,EAAE,CAAC,EAAkB,GAAd,EAAE,CAAC,CAAC,MAAM,EAAS,CAAC,EAAE,CAAC,EAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAK9E,CALgF,MAIhF,EAAI,IAAI,EAAU,KAAK,GAAG,CAAC,CAAC,EAAQ,GAAI,EAAS,EAAE,CAAC,EAAI,CAAD,CAAK,EAAM,EAAA,CAAE,CAAI,CAAC,EAAQ,KAC1E,EAAI,EAAE,GAAG,CAAC,GAAK,EAKxB,GAFA,EAAS,EAAE,CAAC,CAAG,EAEX,EAAG,CAGL,GAAI,EAAE,CAAC,CAAG,CAAC,EAAE,CAAC,CAAC,EAAE,CAAG,CAAC,EAAE,CAAC,CAAE,OAAO,IAAI,EAAU,IAI3C,CAFJ,GAAW,CAAC,GAAU,EAAE,SAAS,IAAM,EAAE,SAAS,EAAA,IAEpC,EAAI,EAAE,GAAG,CAAC,EAAA,CAI1B,MAAO,GAAI,EAAE,CAAC,CAAG,IAAM,CAAD,CAAG,CAAC,CAAG,GAAK,EAAE,CAAC,CAAG,CAAC,IAAa,CAAR,EAAC,EAAE,CAAC,CAE9C,EAAE,CAAC,CAAC,EAAE,CAAG,GAAK,GAAU,EAAE,CAAC,CAAC,EAAE,EAAI,KAElC,EAAE,CAAC,CAAC,EAAE,CAAG,MAAQ,GAAU,EAAE,CAAC,CAAC,EAAE,EAAI,SAAA,CAAS,CAAC,CASjD,EAToD,KAGpD,EAAI,EAAE,CAAC,CAAG,GAAK,EAAM,GAAK,CAAC,EAAI,EAG3B,EAAE,CAAC,CAAG,CAAC,IAAG,EAAI,GAAI,EAGf,IAAI,EAAU,EAAS,EAAI,EAAI,EAE7B,IAKT,GAAI,EAAS,KAA2B,CALhB,CAKgB,EAe1C,IAZI,GACF,AAJ6B,EAItB,GADG,CACC,EAAU,IACjB,IAAQ,EAAE,CAAC,EAAG,EAClB,EAAS,EAAM,IAGf,EAAS,CADT,EAAI,KAAK,GAAG,CAAC,CAAC,EAAQ,GAAA,EACT,EAGf,EAAI,IAAI,EAAU,KAGR,CAER,GAAI,EAAQ,CAEV,GAAI,CAAC,CADL,EAAI,EAAE,KAAK,CAAC,EAAA,EACL,CAAC,CAAE,MAEN,EACE,CADC,CACC,CAAC,CAAC,MAAM,CAAG,IAAG,EAAE,CAAC,CAAC,MAAM,EAAG,EACxB,IACT,EAAI,EAAE,EADa,CACV,CAAC,EAAA,CAEd,CAEA,CAJqB,EAIjB,EAAG,CAEL,GAAI,AAAM,IADV,GAAI,EAAU,EAAI,EAAA,EACL,MACb,EAAS,EAAI,CACf,MAIE,CAJK,EAEL,EADA,EAAI,EAAE,AACA,CAV+D,IAS1D,CAAC,GACH,EAAE,CAAC,CAAG,EAAG,GAEd,EAAE,CAAC,CAAG,GACR,CADY,CACH,EAAM,OACV,CAEL,GAAI,AAAM,IADV,EAAI,CAAC,EAAQ,EAAA,EACA,MACb,EAAS,EAAI,CACf,CAGF,EAAI,EAAE,KAAK,CAAC,GAER,EACE,CADC,CACC,CAAC,EAAI,EAAE,CAAC,CAAC,MAAM,CAAG,IAAG,EAAE,CAAC,CAAC,MAAM,EAAG,EAC/B,GACT,GAAI,EAAE,EADa,CACV,CAAC,EAAA,CAEd,EAFqB,MAIrB,AAAI,EAAiB,GACjB,IAAQ,CADE,CACE,EAAI,GAAG,CAAC,EAAA,EAEjB,EAAI,EAAE,GAAG,CAAC,GAAK,EAAI,EAAM,EAAG,EAAe,EAAe,EAPM,CAOE,EAC3E,EAWA,EAAE,YAAY,CAAG,SAAU,CAAE,EAC3B,IAAI,EAAI,IAAI,EAAU,IAAI,EAG1B,OAFU,MAAN,EAAY,EAAK,EAChB,EAAS,EAAI,EAAG,GACd,EAAM,EAAG,EAAE,CAAC,CAAG,EAAG,EAC3B,EAOA,EAAE,SAAS,CAAG,EAAE,EAAE,CAAG,SAAU,CAAC,CAAE,CAAC,EACjC,OAA8C,IAAvC,EAAQ,IAAI,CAAE,IAAI,EAAU,EAAG,GACxC,EAMA,EAAE,QAAQ,CAAG,WACX,MAAO,CAAC,CAAC,IAAI,CAAC,CAChB,AADiB,EAQjB,EAAE,aAAa,CAAG,EAAE,EAAE,CAAG,SAAU,CAAC,CAAE,CAAC,EACrC,OAAO,EAAQ,IAAI,CAAE,IAAI,EAAU,EAAG,IAAM,CAC9C,EAOA,EAAE,sBAAsB,CAAG,EAAE,GAAG,CAAG,SAAU,CAAC,CAAE,CAAC,EAC/C,OAAO,AAA6C,IAA5C,GAAI,EAAQ,IAAI,CAAE,IAAI,EAAU,EAAG,GAAA,CAAG,EAAiB,IAAN,CAE3D,EAMA,EAAE,SAAS,CAAG,WACZ,MAAO,CAAC,CAAC,IAAI,CAAC,CAAC,EAAI,EAAS,IAAI,CAAC,CAAC,GAAG,EAAY,IAAI,CAAC,CAAC,CAAC,MAAM,CAAG,CACnE,EAOA,EAAE,UAAU,CAAG,EAAE,EAAE,CAAG,SAAU,CAAC,CAAE,CAAC,EAClC,OAA4C,EAArC,EAAQ,IAAI,CAAE,IAAI,EAAU,EAAG,GACxC,EAOA,EAAE,mBAAmB,CAAG,EAAE,GAAG,CAAG,SAAU,CAAC,CAAE,CAAC,EAC5C,OAAoD,AAA7C,CAA8C,KAA7C,EAAI,EAAQ,IAAI,CAAE,IAAI,EAAU,EAAG,GAAA,CAAG,EAAY,AAAM,KAClE,EAMA,EAAE,KAAK,CAAG,WACR,MAAO,CAAC,IAAI,CAAC,CAAC,AAChB,EAMA,EAAE,UAAU,CAAG,WACb,OAAO,IAAI,CAAC,CAAC,CAAG,CAClB,EAMA,EAAE,UAAU,CAAG,WACb,OAAO,IAAI,CAAC,CAAC,CAAG,CAClB,EAMA,EAAE,MAAM,CAAG,WACT,MAAO,CAAC,CAAC,IAAI,CAAC,CAAC,EAAiB,GAAb,IAAI,CAAC,CAAC,CAAC,EAAE,AAC9B,EAuBA,EAAE,KAAK,CAAG,SAAU,CAAC,CAAE,CAAC,EACtB,IAAI,EAAG,EAAG,EAAG,EAEX,EADI,AACA,EADJ,EAAQ,CACF,CAAC,CAMT,GAHA,EAAI,CADJ,EAAI,IAAI,EAAU,EAAG,EAAA,EACf,CAAC,CAGH,CAAC,GAAK,CAAC,EAAG,OAAO,IAAI,EAAU,KAGnC,GAAI,GAAK,EAEP,CAFU,MACV,EAAE,CAAC,CAAG,CAAC,EACA,KAAE,IAAI,CAAC,GAGhB,IAAI,EAAK,KAAE,CAAC,GAAG,CACb,EAAK,EAAE,CAAC,GAAG,CACX,EAAK,KAAE,CAAC,CACR,EAAK,EAAE,CAAC,CAEV,GAAI,CAAC,GAAM,CAAC,EAAI,CAGd,GAAI,CAAC,GAAM,CAAC,EAAI,OAAO,GAAM,EAAD,AAAG,CAAC,CAAG,CAAC,GAAG,CAAC,CAAI,IAAI,EAAU,KAAK,EAAI,KAGnE,GAAI,CAAC,CAAE,CAAC,EAAE,EAAI,CAAC,CAAE,CAAC,EAAE,CAGlB,CAHoB,MAGb,CAAE,CAAC,EAAE,EAAI,CAAD,CAAG,CAAC,CAAG,CAAC,GAAG,CAAC,CAAI,IAAI,EAAU,CAAE,CAAC,EAAE,GAAG,GAGnC,CADjB,EACA,EAAqB,CAAC,EAAI,EAE/B,CAOA,GALA,EAAK,EAAS,GACd,EAAK,EAAS,GACd,EAAK,EAAG,KAAK,GAGT,EAAI,EAAK,EAAI,CAaf,IAXI,GAAO,EAAI,GAAG,CAChB,EAAI,AAb0D,CAazD,EACL,EAAI,IAEJ,EAAK,EACL,EAAI,GAGN,EAAE,OAAO,GAGJ,EAAI,EAAG,IAAK,EAAE,IAAI,CAAC,IACxB,EAAE,OAAO,EACX,MAKE,CALK,GAGL,EAAI,AAAC,GAAO,CAAC,EAAI,EAAG,MAAA,AAAM,GAAK,CAAD,CAAK,EAAG,MAAA,AAAM,CAAC,EAAI,EAAI,EAEhD,EAAI,EAAI,EAAG,EAAI,EAAG,IAAK,AAE1B,GAAI,CAAE,CAAC,EAAE,EAAI,CAAE,CAAC,EAAE,CAAE,CAClB,EAAO,CAAE,CAAC,EAAE,CAAG,CAAE,CAAC,EAAE,CACpB,KACF,CAgBJ,GAXI,IACF,EADQ,AACJ,EACJ,EAAK,EACL,EAAK,EACL,EAAE,CAAC,CAAG,CAAC,EAAE,CAAC,EAOR,CAJJ,EAAI,AAAC,GAAI,EAAG,MAAA,AAAM,GAAK,CAAD,CAAK,EAAG,MAAA,CAAM,EAI5B,EAAG,KAAO,IAAK,CAAE,CAAC,IAAI,CAAG,GAIjC,IAHA,EAAI,KAAO,EAGJ,EAAI,GAAI,CAEb,GAAI,CAAE,CAAC,EAAE,EAAE,CAAG,CAAE,CAAC,EAAE,CAAE,CACnB,IAAK,EAAI,EAAG,GAAK,CAAC,CAAE,CAAC,EAAE,EAAE,CAAE,CAAE,CAAC,EAAE,CAAG,GACnC,EAAE,CAAE,CAAC,EAAE,CACP,CAAE,CAAC,EAAE,IAAI,EACX,CAEA,CAAE,CAAC,EAAE,EAAI,CAAE,CAAC,EAAE,AAChB,CAGA,KAAgB,GAAT,CAAE,CAAC,EAAE,CAAO,EAAG,MAAM,CAAC,EAAG,GAAI,EAAE,UAGtC,AAAK,CAAE,CAAC,EAAJ,AAAM,CAWH,CAXK,CAWK,EAAG,EAAI,IAPtB,EAAE,CAAC,CAAoB,GAAjB,EAAqB,CAAC,EAAI,EAChC,EAAE,CAAC,CAAG,CAAC,EAAE,CAAC,CAAG,EAAE,CACR,EAMX,EAwBA,EAAE,MAAM,CAAG,EAAE,GAAG,CAAG,SAAU,CAAC,CAAE,CAAC,EAC/B,IAAI,EAAG,GACL,KAKF,CAHA,EAAI,IAAI,EAAU,EAAG,GAGjB,AAAC,KAAE,CAAC,EAAK,EAAD,AAAG,CAAC,IAAI,EAAE,CAAC,EAAK,EAAD,AAAG,CAAC,CAAC,EAAE,AAAF,EAAI,CAIzB,AAAC,EAAE,CAAC,IAAI,KAAE,CAAC,EAAK,EAAD,GAAG,CAAC,CAAC,EAAA,AAAE,EAAE,CAIhB,GAAf,AAAkB,GAIpB,EAAI,EAAE,CAAC,CACP,EAAE,CAAC,CAAG,EACN,EAAI,IAAI,GAAG,EAAG,EAAG,GACjB,EAAE,CAAC,CAAG,EACN,EAAE,CAAC,EAAI,GAEP,EAAI,IAAI,GAAG,EAAG,EAAG,GAMf,AAAC,AAHL,GAAI,KAAE,KAAK,CAAC,EAAE,KAAK,CAAC,GAAA,EAGb,CAAC,CAAC,EAAE,EAAmB,GAAf,IAAkB,EAAE,CAAC,CAAG,MAAE,AAAC,EAEnC,GArBE,IAAI,EAVP,IAAI,EAMD,EAIc,EAJV,EAAU,IA0BzB,EAuBA,EAAE,YAAY,CAAG,EAAE,KAAK,CAAG,SAAU,CAAC,CAAE,CAAC,EACvC,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAK,EAAK,EAAK,EAAK,EAAK,EAAK,EAGlD,EAAK,AAFL,KAEO,CAFD,AAEE,CACR,EAAK,CAAC,EAAI,IAAI,AAFd,EAEwB,EAAG,EAAA,CAAE,CAAE,CAAC,CAGlC,GAAI,CAAC,GAAM,CAAC,GAAM,CAAC,CAAE,CAAC,EAAE,EAAI,CAAC,CAAE,CAAC,EAAE,CAmBhC,CAnBkC,MAG9B,AAAC,KAAE,CAAC,EAAK,EAAD,AAAG,CAAC,IAAI,GAAO,CAAE,CAAC,CAAJ,CAAM,EAAK,CAAA,CAAD,IAAO,GAAO,CAAE,CAAC,CAAJ,CAAM,EAAK,CAAA,CAAD,EAAK,AAG9D,EAAE,CAAC,EAAI,KAAE,CAAC,CAGN,AAAC,GAAO,GAAD,AAKT,CALc,CAKZ,CAAC,CAAG,CAAC,EAAE,CACT,EAAE,CAAC,CAAG,GALN,EAAE,CAAC,CAAG,EAAE,CAAC,CAAG,MANd,EAAE,CAAC,CAAG,EAAE,CAAC,CAAG,EAAE,CAAC,CAAG,KAeb,EAmBT,IAhBA,AAgBK,EAhBD,EAAS,KAAE,CAAC,GAAG,EAAY,EAAS,EAAE,CAAC,GAAG,EAC9C,EAAE,CAAC,EAAI,AA5BD,IAAI,CA4BD,CAAC,EACV,EAAM,EAAG,MAAA,AAAM,GACf,EAAM,EAAG,MAAA,AAAM,IAIb,EAAK,EACL,EAAK,EACL,EAAK,EACL,EAAI,EACJ,EAAM,EACN,EAAM,KAIC,EAAM,EAAK,EAAK,EAAE,CAAE,IAAK,EAAG,IAAI,CAAC,IAK1C,IAAK,EAAI,EAAK,EAAE,GAAK,GAAI,CAKvB,IAJA,EAAI,EACJ,EAAM,CAAE,CAAC,EAAE,GAAG,EACd,EAAM,CAAE,CAAC,EAAE,GAAG,EAAW,EAEX,EAAI,GAAb,CAAiB,CAAb,CAAA,EAAgB,EAAI,GAG3B,AAH+B,EAG3B,GAFJ,EAAM,CAAE,AAEE,CAFD,EAAE,EAAE,GAAG,CAAA,EAEA,CADhB,EAAM,CAAE,CAAC,EAAE,GAAG,GAAW,EACH,EAEtB,EAAI,CAAC,CADL,EAAM,EAAM,CACD,CADS,IAAI,MAAwB,CAAE,CAAC,EAAE,CAAG,AAApB,SAClB,CAAC,EAAK,EAAD,EAAK,GAAW,CAAC,CAAI,EAAM,EAClD,CAAE,CAAC,IAAI,CAAG,MAAM,CAGlB,CAAE,CAAC,EAAE,CAAG,CACV,CAQA,OANI,EACF,CADK,CACH,EAEF,EAAG,MAAM,CAAC,EAAG,GAGR,EAAU,EAAG,EAAI,EAC1B,EAOA,EAAE,OAAO,CAAG,WACV,IAAI,EAAI,IAAI,EAAU,IAAI,EAE1B,OADA,EAAE,CAAC,CAAG,CAAC,EAAE,CAAC,EAAI,KACP,CACT,EAuBA,EAAE,IAAI,CAAG,SAAU,CAAC,CAAE,CAAC,EACrB,IAAI,EAEF,CADA,CACI,KAAE,CAAC,CAMT,GAHA,EAAI,CADJ,EAAI,IAAI,EAAU,EAAG,EAAA,EACf,CAAC,CAGH,CAAC,GAAK,CAAC,EAAG,OAAO,IAAI,EAAU,KAGlC,GAAI,GAAK,EAER,CAFW,MACX,EAAE,CAAC,CAAG,CAAC,EACA,KAAE,KAAK,CAAC,GAGjB,IAAI,EAAK,KAAE,CAAC,GAAG,CACb,EAAK,EAAE,CAAC,GAAG,CACX,EAAK,KAAE,CAAC,CACR,EAAK,EAAE,CAAC,CAEV,GAAI,CAAC,GAAM,CAAC,EAAI,CAGd,GAAI,CAAC,GAAM,CAAC,EAAI,OAAO,IAAI,EAAU,EAAI,GAIzC,GAAI,CAAC,CAAE,CAAC,EAAE,EAAI,CAAC,CAAE,CAAC,EAAE,CAAE,OAAO,CAAE,CAAC,EAAE,CAAG,EAAI,IAAI,EAAU,CAAE,CAAC,EAAE,CA3BxD,EA2B2D,EA3BvD,CA2B+D,EAAJ,EACrE,CAOA,GALA,EAAK,EAAS,GACd,EAAK,EAAS,GACd,EAAK,EAAG,KAAK,GAGT,EAAI,EAAK,EAAI,CAUf,IATI,EAAI,GAAG,AACT,EAAK,EACL,EAAI,IAEJ,EAAI,CAAC,EACL,EAAI,GAGN,EAAE,OAAO,GACF,IAAK,EAAE,IAAI,CAAC,IACnB,EAAE,OAAO,EACX,CAcA,IAZA,GAAI,EAAG,MAAA,AAAM,GACb,EAAI,EAAG,MAAA,AAAM,EAGD,GAAG,CACb,EAAI,EACJ,EAAK,EACL,EAAK,EACL,EAAI,GAID,EAAI,EAAG,GACV,AADc,EACV,CAAC,CAAE,CAAC,EAAE,EAAE,CAAG,CAAE,CAAC,EAAE,CAAG,CAAE,CAAC,EAAE,EAAG,CAAC,IAAI,EAAO,EAC3C,CAAE,CAAC,EAAE,CAAG,OAAS,CAAE,CAAC,EAAE,CAAG,EAAI,CAAE,CAAC,EAAE,CAnsE/B,EAmsEkC,GAUvC,CA5sEF,MAqsEM,GAAG,CACL,EAAK,CAAC,EAAE,CAAC,MAAM,CAAC,GAChB,EAAE,GAKG,EAAU,EAAG,EAAI,EAC1B,EAkBA,EAAE,SAAS,CAAG,EAAE,EAAE,CAAG,SAAU,CAAE,CAAE,CAAE,EACnC,IAAI,EAAG,EAAG,EAGV,CAFE,EAEQ,MAAN,GAAqB,CAAC,CAAC,IAAT,AAAa,EAK7B,OAJA,EAAS,EAAI,GAAG,IACN,MAAN,EAAY,EAAK,EAChB,EAAS,EAAI,EAAG,GAEd,EAAM,IAAI,QAAc,EAAJ,AAAQ,GAGrC,GAAI,CAAC,CAAC,EAAI,MAAE,AAAC,EAAG,OAAO,KAIvB,GAFA,EAAI,IADJ,AACQ,EADJ,EAAE,MAAM,EAAG,EACI,EAEf,EAAI,CAAC,CAAC,EAAE,CAAE,CAGZ,KAAO,EAAI,IAAM,EAAG,GAAK,GAAI,KAG7B,IAAK,EAAI,CAAC,CAAC,EAAE,CAAE,GAAK,GAAI,GAAK,GAAI,KACnC,CAIA,OAFI,GAAM,KAAE,CAAC,CAAG,EAAI,IAAG,EAAI,AAvBrB,IAAI,CAuBmB,CAAC,EAAG,EAE1B,CACT,EAWA,EAAE,SAAS,CAAG,SAAU,CAAC,EAEvB,OADA,EAAS,EAAG,CAAC,kBAAkB,iBACxB,IAAI,CAAC,KAAK,CAAC,KAAO,EAC3B,EAcA,EAAE,UAAU,CAAG,EAAE,IAAI,CAAG,WACtB,IAAI,EAAG,EAAG,EAAG,EAAK,EAEhB,CADA,CACI,KAAE,CAAC,CACP,EAAI,KAAE,CAAC,CACP,EAAI,KAAE,CAAC,CACP,EAAK,EAAiB,EACtB,EAAO,IAAI,EAAU,OAGvB,GAAU,IAAN,GAAW,CAAC,GAAK,CAAC,CAAC,CAAC,EAAE,CACxB,CAD0B,MACnB,IAAI,EAAU,CAAC,GAAK,EAAI,IAAM,CAAD,AAAE,GAAK,CAAC,CAAC,EAAA,AAAE,EAAI,IAAM,IAAI,GAAI,EAAI,GA8BvE,GAtBI,AAAK,IAJT,EAAI,KAAK,IAAI,CAAC,CAAC,QAAQ,GAIT,GAAK,EAAI,GAAG,AAEpB,CAAC,CADL,EAAI,EAAc,EAAA,EACX,MAAM,CAAG,CAAC,EAAI,GAAK,IAAG,GAAK,GAAA,EAClC,EAAI,KAAK,IAAI,CAAC,CAAC,GACf,EAAI,EAAS,CAAC,EAAI,CAAC,EAAI,IAAM,CAAD,CAAK,GAAK,GAAI,CAAC,CAS3C,EAAI,IAAI,EANN,EADE,GAAK,EAAI,CAOK,CANZ,CADU,IACH,EAGP,CADJ,EAAI,EAAE,aAAa,EAAA,EACb,KAAK,CAAC,EAAG,EAAE,OAAO,CAAC,KAAO,GAAK,IAKvC,EAAI,IAAI,EAAU,EAAI,IAOpB,EAAE,CAAC,CAAC,EAAE,EAAE,AAMV,IAHI,CADJ,EAAI,AAIM,CALV,EAAI,GAAE,AAAC,EACC,CAAA,EACA,IAAG,EAAI,KAOb,GAHA,EAAI,EACJ,EAAI,EAAK,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,GAAG,EAAG,EAAI,KAEhC,EAAc,EAAE,CAAC,EAAE,KAAK,CAAC,EAAG,KAAO,CAAC,EAAI,EAAc,EAAE,EAAC,CAAC,CAAE,KAAK,CAAC,EAAG,GAAI,CAW3E,GANI,EAAE,CAAC,CAAG,GAAG,EAAE,EAMX,AAAK,SALT,EAAI,EAAE,KAAK,CAAC,EAAI,EAAG,EAAI,EAAA,IAKJ,AAAC,GAAY,QAAL,CAAK,EAgBzB,CAhBiC,AAoBjC,CAAC,IAAK,AAAC,CAAC,EAAE,KAAK,CAAC,IAAqB,KAAf,EAAE,MAAM,CAAC,EAAM,GAAK,CAG7C,EAAM,EAAG,EAAE,CAAC,CAAG,EAAiB,EAAG,GACnC,EAAI,CAAC,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,IApFnB,GAuFF,KACF,CAxBE,GAAI,CAAC,IACH,CADQ,CACF,EAAG,EAAE,CAAC,CAAG,EAAiB,EAAG,GAE/B,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,AAnEtB,OAmE0B,CACpB,EAAI,EACJ,KACF,CAGF,GAAM,EACN,GAAK,EACL,EAAM,CAcV,CACF,CAGF,OAAO,EAAM,EAAG,EAAE,CAAC,CAAG,EAAiB,EAAG,EAAe,EAC3D,EAYA,EAAE,aAAa,CAAG,SAAU,CAAE,CAAE,CAAE,EAKhC,OAJU,MAAN,AAAY,IACd,EAAS,EAAI,GAAG,IAChB,KAEK,EAAO,IAAI,CAAE,EAAI,EAAI,EAC9B,EAeA,EAAE,OAAO,CAAG,SAAU,CAAE,CAAE,CAAE,EAK1B,OAJU,MAAM,AAAZ,IACF,EAAS,EAAI,GAAG,IAChB,EAAK,EAAK,IAAI,CAAC,CAAC,CAAG,GAEd,EAAO,IAAI,CAAE,EAAI,EAC1B,EA4BA,EAAE,QAAQ,CAAG,SAAU,CAAE,CAAE,CAAE,CAAE,CAAM,EACnC,IAAI,EAGJ,GAFE,AAEY,MAAV,AAAgB,EACR,MAAN,GAAc,GAAmB,UAAU,AAAvB,OAAO,GAC7B,EAAS,EACT,EAAK,MACI,GAAM,AAAa,UAAU,OAAhB,GACtB,EAAS,EACT,EAAK,EAAK,MAEV,EAAS,OAEN,GAAqB,UAAU,AAA3B,OAAO,EAChB,MAAM,MACH,EAAiB,2BAA6B,GAKnD,GAFA,EAAM,KAAE,OAAO,CAAC,EAAI,GAEhB,KAAE,CAAC,CAAE,CACP,IAAI,EACF,EAAM,EAAI,KAAK,CAAC,KAChB,EAAK,CAAC,EAAO,SAAS,CACtB,EAAK,CAAC,EAAO,kBAAkB,CAC/B,EAAiB,EAAO,cAAc,EAAI,GAC1C,EAAU,CAAG,CAAC,EAAE,CAChB,EAAe,CAAG,CAAC,EAAE,CACrB,EAAQ,AA3BN,IAAI,CA2BI,CAAC,CAAG,EACd,EAAY,EAAQ,EAAQ,KAAK,CAAC,GAAK,EACvC,EAAM,EAAU,MAAM,CASxB,GAPI,IAAI,AACN,EAAI,EACJ,EAAK,EACL,EAAK,EACL,GAAO,GAGL,EAAK,GAAK,EAAM,EAAG,CAGrB,IAFA,EAAI,EAAM,GAAM,EAChB,EAAU,EAAU,MAAM,CAAC,EAAG,GACvB,EAAI,EAAK,GAAK,EAAI,GAAW,EAAiB,EAAU,MAAM,CAAC,EAAG,EACrE,GAAK,IAAG,GAAW,EAAiB,EAAU,KAAK,CAAC,EAAA,EACpD,IAAO,EAAU,IAAM,CAAA,CAC7B,CAEA,EAAM,EACH,GAAW,EAAO,KAAR,WAAwB,EAAI,EAAA,CAAE,EAAK,CAAC,CAAF,CAAO,CAAC,EAAO,iBAAiB,AAAjB,EAC1D,EAAa,OAAO,CAAC,AAAI,OAAO,OAAS,EAAK,OAAQ,KACvD,MAAQ,CAAD,CAAQ,sBAAsB,EAAI,EAAA,CAAE,EAC1C,CAAA,CAAY,CACb,CACL,CAEA,MAAO,CAAC,EAAO,MAAM,EAAI,EAAA,CAAE,CAAI,GAAO,EAAO,CAAR,KAAc,EAAI,EAAA,CAAE,AAC3D,EAcA,EAAE,UAAU,CAAG,SAAU,CAAE,EACzB,IAAI,EAAG,EAAI,EAAI,EAAI,EAAG,EAAK,EAAG,EAAI,EAAI,EAAG,EAAG,EAE1C,CADA,CACK,KAAE,CAAC,CAEV,GAAU,MAAN,AAAY,IAIV,CAAC,CAHL,EAAI,IAAI,EAAU,EAAA,EAGX,SAAS,KAAO,CAAD,CAAG,CAAC,EAAY,CAAC,GAAT,EAAE,CAAC,GAAW,EAAE,EAAE,CAAC,EAAA,EAC/C,CADqD,KAC/C,MACH,EAAiB,YACf,EAAD,CAAG,SAAS,GAAK,iBAAmB,kBAAA,CAAkB,CAAI,EAAQ,IAI1E,GAAI,CAAC,EAAI,OAAO,IAAI,QAoBpB,EApB8B,EAE9B,EAAI,CAkBO,GAlBH,EAAU,GAClB,EAAK,EAAK,IAAI,EAAU,GACxB,EAAK,EAAK,IAAI,EAAU,GACxB,EAAI,EAAc,GAIlB,EAAI,EAAE,CAAC,CAAG,EAAE,MAAM,CAAG,KAAE,CAAC,CAAG,EAC3B,EAAE,CAAC,CAAC,EAAE,CAAG,CAAQ,CAAC,AAAC,GAAM,IAAI,CAAQ,CAAI,EAAI,GAAW,EAAM,EAAI,CAClE,EAAK,CAAC,GAAM,EAAE,UAAU,CAAC,GAAK,EAAK,EAAI,EAAI,EAAI,EAAM,EAErD,EAAM,EACN,EAAU,EAAI,EACd,EAAI,IAAI,EAAU,GAGlB,EAAG,CAAC,CAAC,EAAE,CAAG,EAGR,EAAI,EAAI,EAAG,EAAG,EAAG,GAEQ,GAArB,AAAwB,CAD5B,EAAK,EAAG,IAAI,CAAC,EAAE,KAAK,CAAC,GAAA,EACd,UAAU,CAAC,IAClB,EAAK,EACL,EAAK,EACL,EAAK,EAAG,IAAI,CAAC,EAAE,KAAK,CAAC,EAAK,IAC1B,EAAK,EACL,EAAI,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,EAAK,IACzB,EAAI,EAeN,OAZA,EAAK,EAAI,EAAG,KAAK,CAAC,GAAK,EAAI,EAAG,GAC9B,EAAK,EAAG,IAAI,CAAC,EAAG,KAAK,CAAC,IACtB,EAAK,EAAG,IAAI,CAAC,EAAG,KAAK,CAAC,IACtB,EAAG,CAAC,CAAG,EAAG,CAAC,CAAG,KAAE,CAAC,CACjB,GAAQ,CAAJ,CAGJ,EACoD,EADhD,EAAI,EAAI,EAAI,EAAG,GAAe,KAAK,CAAC,MAAG,GAAG,GAAG,UAAU,CACvD,EAAI,EAAI,EAAI,EAAG,GAAe,KAAK,CAtDjC,AAsDkC,IAtD9B,EAsDiC,GAAG,IAAU,CAAC,EAAI,EAAG,CAAG,CAAC,EAAI,EAAG,CAE3E,EAAU,EAEH,CACT,EAMA,EAAE,QAAQ,CAAG,WACX,MAAO,CAAC,EAAQ,IAAI,CACtB,EAcA,EAAE,WAAW,CAAG,SAAU,CAAE,CAAE,CAAE,EAE9B,OADU,MAAN,GAAY,EAAS,EAAI,EA5kFzB,CA4kF4B,IA5kFW,AA6kFpC,EAAO,IAAI,CAAE,EAAI,EAAI,EAC9B,EAcA,EA5lF8D,AA4lF5D,QAAQ,CAAG,SAAU,CAAC,EACtB,IAAI,EACF,EAAI,IAAI,CACR,EAAI,EAAE,CAAC,CACP,EAAI,EAAE,CAAC,CA0BT,OAvBU,MAAM,CAAZ,EACE,GAAG,AACL,EAAM,WACF,EAAI,IAAG,EAAM,IAAM,CAAA,GAEvB,EAAM,OAGC,MAAL,AAAW,EACb,EAAM,GAAK,GAAc,GAAK,EAC3B,EAAc,EAAc,EAAE,CAAC,EAAG,GAClC,EAAa,EAAc,EAAE,CAAC,EAAG,EAAG,KACxB,KAAN,GAAY,EAErB,EAAM,EAAa,EAAc,CADjC,EAAI,EAAM,IAAI,EAAU,GAAI,EAAiB,EAAI,EAAG,EAAA,EADC,AAElB,CAAC,EAAG,EAAE,CAAC,CAAE,MAE5C,EAAS,EAAG,EAAG,EAAS,MAAM,CAAE,QAChC,EAAM,EAAY,EAAa,EAAc,EAAE,CAAC,EAAG,EAAG,KAAM,GAAI,EAAG,GAAG,IAGpE,EAAI,GAAK,EAAE,CAAC,CAAC,EAAE,GAAE,EAAM,IAAM,CAAA,GAG5B,CACT,EAOA,EAAE,OAAO,CAAG,EAAE,MAAM,CAAG,WACrB,OAAO,EAAQ,IAAI,CACrB,EAGA,EAAE,YAAY,EAAG,EAEjB,CAAC,CAAC,OAAO,WAAW,CAAC,CAAG,YAGxB,CAAC,CAAC,OAAO,GAAG,CAAC,8BAA8B,CAAG,EAAE,OAAO,CAEnD,AAAgB,SAAM,EAAU,GAAG,CAAC,GAEjC,CACT,IE/sFA,IAAM,EAAgB,GA2BhB,EAjBJ,AACE,AAAsB,OAgBX,IAhBJ,YACP,WAAW,MAAM,EAC4B,YAA7C,AACA,OADO,WAAW,MAAM,CAAC,eAAe,CAEjC,KAEL,IAAM,EAAS,IAAI,YAAY,GAG/B,OAFA,WAAW,MAAM,CAAC,eAAeL,CAAC,GAE3B,CAAM,CAAC,EAAE,CAAG,WACrB,EAGK,KAAK,MAAM,CAKd,EAAgB,CAAC,EAAS,CAAC,CAAE,EAAO,CAAM,IAC9C,IAAI,EAAU,GAEd,KAAO,EAAQ,MAAM,CAAG,GACtB,GAAoB,CADU,IACLE,EAAf,GAAoB,CAAC,AAAS,QAAI,QAAQ,CAAC,IAEvD,OAAO,CACT,EAgBM,EAAO,CAAC,EAAQ,EAAE,GAIf,CAdT,SAAS,AAAY,CAAGI,EACtB,IAAI,EAAQ,IAAIF,AF2yFH,EE3yFa,GAE1B,IAAK,IAAM,KAAK,EAAI,MAAM,GAAI,AAE5B,EAAQ,EAAM,YAAY,CAAC,KAAK,IAAI,CAAC,GAEvC,OAAO,EACT,EAMqB,EADH,AACQ,IADJ,cACY,MAAM,CAAC,KACpC,QAAQ,CAAC,IACT,KAAK,CAAC,GAGL,EAAW,MAAM,IAAI,CAAC,CAAE,OAAQ,EAAG,EAAG,CAAC,EAAG,IAC9C,OAAO,YAAY,CAAC,EAAI,KAWpB,EAAoB,CAAC,WACzB,EAAY,EAAA,CAAA,AAIJ,CACRD,EAHI,IAFQ,CAKJ,EAAO,CAAM,CACtB,CAAG,CAAC,CAAC,IACJ,IAAM,EAAU,OAAO,IAAI,CAAC,GAAW,QAAQ,GAK/C,OAAO,EAJc,EAAQ,CAIjB,KAJuB,CAC/B,EAAU,KAAyB,GACnC,KAAyB,CADD,GAGFC,KAFR,IAEiB,CAAC,GAAGC,EACzC,EAEM,EAAgB,AAAC,GAAU,IACxB,IAKH,GAAkB,WAkClB,MAhCO,CAAC,CAIZ,CAHA,EA+Be,IA5BPM,CA4BY,CA5BL,CAAM,SACrB,EAAU,EAAc,KAAK,KAAK,CAAC,IAAS,IAAiB,QAC7D,EAAS,CAAa,aACtB,EAAc,CANsD,CAMpC,CAAE,OAAQ,CAAK,EAAE,CAClD,CAAG,CAAC,CAAC,IACJ,GAAI,EAzGY,GA0Gd,IADW,EACL,AAAI,MACR,CAAC,EAFmB,2BAEU,EAAE,UAAU,IAAc,GAAQ,EAGpE,GAH0D,IAGnD,SAAS,EACd,IAAM,EA/CqB,CAAQ,CAACN,KAAK,KA+CrB,AA/C0BD,CA+CbO,AA/Cc,IAAS,EAASN,MAAM,EAAE,CAmDnE,EAAO,KAAK,GAAGY,GAAG,QAAQ,CAAC,IAC3B,EAAQ,IAAU,QAAQ,CAAC,IAK3B,EAAO,EAAc,EAAQ,GAC7B,EAAY,CAAA,EAAG,EAAO,EAAO,EAAQ,EAAA,CAAa,CAExD,MAAO,CAAA,EAAG,EAAc,EAAKE,GAAW,SAAS,CAACF,EAAG,GAAA,CAAS,AAChE,CACF,EAKS,KACD,AAAC,IACH,EAAc,GAAA,EAETT,EAHW,IHlHT,GAAO,CAAA,EAAA,EAAA,WAAA,AAAW,EAC7BN,OACA,CACE,GAAI,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,UAAU,GAAG,UAAU,CAAC,IAAM,MACzC,KAAM,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,GACpB,QAASC,CAAAA,EAAAA,EAAAA,IAAAA,AAAI,IACbA,MAAO,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,GACrB,KAAM,CAAA,EAAA,EAAA,IAAA,AAAI,IACV,MAAO,CAAA,EAAA,EAAA,IAAA,AAAI,IACX,OAAQ,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAAC,WAAW,OAAO,GACzC,SAAU,CAAA,EAAA,EAAA,OAAA,AAAO,IAAG,OAAO,CAAC,GAAG,OAAO,GACtC,SAAU,CAAA,EAAA,EAAA,OAAA,AAAO,IAAG,OAAO,CAAC,GAAG,OAAO,GACtC,EAAG,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAACC,GAAGC,OAAO,GAC5B,EAAG,CAAA,EAAA,EAAA,IAAA,AAAIA,IAAG,OAAO,CAACF,GAAG,OAAO,GAC5B,UAAW,CAAA,EAAA,EAAA,IAAA,AAAI,IACf,WAAY,CAAA,EAAA,EAAA,IAAA,AAAI,IAChB,OAAQ,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAAC,UAAUA,OAAOC,GACxC,SAAUC,CAAAA,EAAAA,EAAAA,IAAAA,AAAI,IACd,UAAW,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,CAAE,KAAM,cAAe,GAAG,OAAO,GAAG,UAAU,CAAC,IAAM,IAAI,MAC5E,UAAW,CAAA,EAAA,EAAA,OAAA,AAAO,EAACD,CAAE,KAAM,cAAe,GACvC,OAAO,GACP,UAAU,CAAC,IAAM,IAAI,MACrB,SAAS,CAAC,IAAM,IAAI,MACvB,UAAW,CAAA,EAAA,EAAA,IAAA,AAAI,GACjB,EACA,AAAC,GAAM,CACL,CAAA,EAAA,EAAA,KAAA,AAAKD,EAAC,oBAAoB,EAAE,CAAC,EAAEE,OAAO,EACtC,CAAA,EAAA,EAAA,KAAA,AAAK,EAAC,qBAAqB,EAAE,CAAC,EAAE,QAAQ,EACxC,CAAA,EAAA,EAAA,KAAA,AAAK,EAAC,iBAAiB,EAAE,CAAC,EAAE,IAAI,EAChC,CAAA,EAAA,EAAA,UAAA,AAAU,EAAC,IAAM,CAACE,CAChB,QAAS,CAAC,EAAE,QAAQ,CAAC,CACrB,eAAgB,CAAC,EAAE,EAAE,CAAC,CACtB,KAAM,2BACR,CAAC,EACE,QAAQ,CAAC,WACT,QAAQ,CAAC,WACb,EAGU,GAAW,CAAA,EAAA,EAAA,WAAA,AAAW,EACjC,WACA,CACE,GAAI,CAAA,EAAA,EAAA,IAAA,AAAIF,IAAGF,UAAU,GAAG,UAAU,CAAC,IAAMA,MACzC,OAAQ,CAAA,EAAA,EAAA,IAAA,AAAI,IACT,OAAO,GACP,UAAU,CAAC,IAAM,GAAK,EAAE,CAAE,CAAE,SAAUE,UAAW,SAAUD,SAAU,GACxE,KAAM,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,EACtB,EACA,AAAC,GAAM,CACL,CAAA,EAAA,EAAA,WAAW,AAAX,EAAY,4BAA4B,EAAE,CAAC,EAAE,MAAM,CAAE,EAAE,IAAI,EAC3D,CAAA,EAAA,EAAA,KAAA,AAAK,EAAC,uBAAuBA,EAAE,CAAC,EAAE,MAAM,EACzC,EAGU,GAAM,CAAA,EAAA,EAAA,WAAA,AAAW,EAC5B,MACA,CACE,GAAI,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,UAAU,GAAG,UAAU,CAAC,IAAM,MACzC,MAAO,CAAA,EAAA,EAAA,IAAA,AAAI,IAAGD,OAAO,GACrB,MAAO,CAAA,EAAA,EAAA,IAAA,AAAI,GACb,EACA,AAAC,GAAM,CAAC,CAAA,EAAA,EAAA,WAAA,AAAW,EAAC,iBAAiB,EAAE,CAAC,EAAE,KAAK,EAAE,EAGtC,GAAO,CAAA,EAAA,EAAA,WAAA,AAAW,EAC7B,OACA,CACE,GAAI,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,UAAU,GAAG,UAAU,CAAC,IAAM,MACzC,OAAQ,CAAA,EAAA,EAAA,IAAA,AAAI,IACT,OAAO,GACP,UAAU,CAACQ,IAAM,GAAK,EAAE,CAAE,CAAE,SAAU,UAAW,SAAU,SAAU,GACxE,KAAM,CAAA,EAAA,EAAA,IAAA,AAAI,IACPN,OAAO,GACP,UAAUA,CAAC,IAAM,GAAK,EAAE,CAAE,CAAE,SAAU,UAAW,SAAU,SAAU,GACxE,KAAM,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAAC,WAAW,OAAO,GACvC,MAAO,CAAA,EAAA,EAAA,IAAA,AAAI,IACX,aAAcQ,CAAAA,EAAAA,EAAAA,IAAAA,AAAI,IAClB,aAAc,CAAA,EAAA,EAAA,IAAA,AAAI,GACpB,EACA,AAAC,GAAM,CACL,CAAA,EAAA,EAAA,WAAA,AAAW,EAAC,6BAA6B,EAAE,CAAC,EAAE,MAAM,CAAE,EAAE,IAAI,CAAE,EAAE,IAAI,EACpE,CAAA,EAAA,EAAA,KAAK,AAAL,EAAM,iBAAiB,EAAE,CAAC,EAAE,IAAI,EAChC,CAAA,EAAA,EAAA,KAAA,AAAK,EAAC,mBAAmB,EAAE,CAAC,EAAE,MAAML,EACrC,EAIU,GAAWM,CAAAA,EAAAA,EAAAA,WAAAA,AAAW,EACjC,YACA,CACE,EAAG,CAAA,EAAA,EAAA,IAAA,AAAI,EAAC,KACL,OAAO,GACP,UAAU,CAAC,IAAM,GAAK,EAAE,CAAE,CAAE,SAAU,UAAW,SAAU,SAAU,GACxE,EAAG,CAAA,EAAA,EAAA,IAAA,AAAI,EAAC,KACL,OAAO,GACP,UAAU,CAAC,IAAMN,GAAIO,EAAE,CAAEC,CAAE,SAAU,UAAWA,SAAU,SAAU,EACzE,EACA,AAAC,GAAM,CAAC,CAAA,EAAA,EAAA,WAAA,AAAW,EAAC,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAE,EAAE,CAAC,EAAG,CAAA,EAAA,EAAA,KAAA,AAAK,EAAC,qBAAqB,EAAE,CAAC,EAAE,CAAC,EAAE,EAGjF,GAAO,CAAA,EAAA,EAAA,WAAA,AAAW,EAC7BE,OACA,CACE,GAAI,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,UAAU,GAAG,UAAU,CAAC,IAAM,MACzC,MAAO,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAAC,YAAY,OAAO,GACzC,KAAM,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAAC,IAAI,OAAO,GAChC,IAAK,CAAA,EAAA,EAAA,IAAI,AAAJ,IAAO,OAAO,CAAC,GAAG,OAAO,GAC9B,OAAQ,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,CAAE,KAAM,SAAUN,GAAG,OAAO,EAAC,GAAO,OAAO,GAC3D,UAAW,CAAA,EAAA,EAAA,OAAO,AAAP,EAAQ,CAAE,KAAM,cAAe,GAAG,OAAO,GAAG,UAAU,CAAC,IAAM,IAAI,MAC5E,UAAW,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,CAAE,KAAM,cAAe,GACvC,OAAO,GACP,UAAU,CAAC,IAAM,IAAI,MACrB,SAAS,CAAC,IAAM,IAAI,KACzB,EACC,AAAD,GAAO,CAAC,CAAA,EAAA,EAAA,KAAA,AAAK,EAAC,sBAAsB,EAAE,CAAC,EAAE,SAAS,EAAE,EAIzC,GAAU,CAAA,EAAA,EAAA,WAAW,AAAX,EACrB,UACA,CACE,GAAI,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,UAAU,GAAG,UAAU,CAAC,IAAM,MACzC,KAAM,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,GACpB,OAAQ,CAAA,EAAA,EAAA,IAAA,AAAI,IACZ,YAAa,CAAA,EAAA,EAAA,IAAI,AAAJ,IACb,OAAQ,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAAC,UAAU,OAAO,GACxC,EAAG,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAAC,GAAG,OAAO,GAC5B,EAAG,CAAA,EAAA,EAAA,IAAI,AAAJ,IAAO,OAAO,CAAC,GAAG,OAAO,GAC5B,UAAW,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,CAAE,KAAM,cAAe,GAAG,OAAO,GAAG,UAAU,CAAC,IAAM,IAAI,MAC5E,UAAW,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,CAAE,KAAM,cAAe,GACvC,OAAO,GACP,UAAU,CAAC,IAAM,IAAI,MACrB,SAAS,CAAC,IAAM,IAAI,KACzB,EACA,AAAC,GAAM,CAAC,CAAA,EAAA,EAAA,KAAA,AAAK,EAAC,sBAAsB,EAAE,CAAC,EAAE,MAAM,EAAG,CAAA,EAAA,EAAA,WAAW,AAAX,EAAY,oBAAoB,EAAE,CAAC,EAAE,IAAI,EAAE,EAGlF,GAAW,CAAA,EAAA,EAAA,WAAA,AAAW,EACjC,WACA,CACE,GAAI,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,UAAU,GAAG,UAAU,CAAC,IAAM,MACzC,QAAS,CAAA,EAAA,EAAA,IAAA,AAAI,IACV,OAAO,GACP,UAAU,CAAC,IAAM,GAAQ,EAAE,CAAE,CAAE,SAAU,UAAW,SAAU,SAAU,GAC3E,KAAM,CAAA,EAAA,EAAA,IAAI,AAAJ,IAAO,OAAO,GACpB,KAAM,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,GACpB,KAAM,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,CAAE,KAAM,SAAU,GAAG,OAAO,CAAC,IAAO,OAAO,GACzD,KAAM,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,CAAE,KAAM,SAAU,GAAG,OAAO,EAAC,GAAO,OAAO,GACzD,SAAU,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,CAAE,KAAM,SAAU,GAAG,OAAO,EAAC,GAAM,OAAO,GAC5D,KAAM,CAAA,EAAA,EAAA,IAAA,AAAI,IACV,IAAK,CAAA,EAAA,EAAA,OAAA,AAAO,IAAG,OAAO,CAAC,GAAG,OAAO,EACnC,EACA,AAAC,GAAM,CACL,CAAA,EAAA,EAAA,WAAA,AAAW,EAAC,6BAA6B,EAAE,CAAC,EAAE,OAAO,CAAE,EAAE,IAAI,EAC7D,CAAA,EAAA,EAAA,KAAA,AAAK,EAAC,wBAAwB,EAAE,CAAC,EAAE,OAAO,EAC3C,EAGU,GAAa,CAAA,EAAA,EAAA,WAAA,AAAW,EACnC,aACA,CACE,GAAI,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,UAAU,GAAG,UAAU,CAAC,IAAM,MACzC,YAAa,CAAA,EAAA,EAAA,IAAA,AAAI,IACd,OAAO,GACP,UAAU,CAAC,IAAM,GAAQ,EAAE,CAAE,CAAE,SAAU,UAAW,SAAU,SAAU,GAC3E,UAAW,CAAA,EAAA,EAAA,IAAA,AAAI,IACZ,OAAO,GACP,UAAU,CAAC,IAAM,GAAQ,EAAE,CAAE,CAAE,SAAU,UAAW,SAAU,SAAU,GAC3E,WAAY,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,GAC1B,SAAU,CAAA,EAAA,EAAA,IAAI,AAAJ,IAAO,OAAO,GACxB,MAAO,CAAA,EAAA,EAAA,IAAA,AAAI,GACb,EACA,AAAC,GAAM,CACL,CAAA,EAAA,EAAA,KAAA,AAAK,EAAC,4BAA4B,EAAE,CAAC,EAAE,SAAS,EAChD,CAAA,EAAA,EAAA,KAAK,AAAL,EAAM,8BAA8B,EAAE,CAAC,EAAE,WAAW,EACrD,EAGU,GAAW,CAAA,EAAA,EAAA,WAAA,AAAW,EACjC,WACA,CACE,GAAI,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,UAAU,GAAG,UAAU,CAAC,IAAM,MACzC,OAAQ,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,GACtB,KAAM,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,GACpB,OAAQ,CAAA,EAAA,EAAA,IAAI,AAAJ,IACR,YAAa,CAAA,EAAA,EAAA,IAAA,AAAI,IACjB,OAAQ,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAAC,UAAU,OAAO,GACxC,EAAG,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAAC,GAAG,OAAO,GAC5B,EAAG,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAAC,GAAG,OAAO,GAC5B,UAAW,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,CAAE,KAAM,cAAe,GAAG,OAAO,GAAG,UAAU,CAAC,IAAM,IAAI,MAC5E,UAAW,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,CAAE,KAAM,cAAe,GACvC,OAAO,GACP,UAAU,CAAC,IAAM,IAAI,MACrB,SAAS,CAAC,IAAM,IAAI,KACzB,EACA,AAAC,GAAM,CACL,CAAA,EAAA,EAAA,WAAA,AAAW,EAAC,4BAA4B,EAAE,CAAC,EAAE,MAAM,CAAE,EAAE,IAAI,EAC3D,CAAA,EAAA,EAAA,KAAA,AAAK,EAAC,uBAAuB,EAAE,CAAC,EAAE,MAAM,EACzC,EAGU,GAAgB,CAAA,EAAA,EAAA,WAAA,AAAW,EACtC,gBACA,CACE,GAAI,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,UAAU,GAAG,UAAU,CAAC,IAAM,MACzC,WAAY,CAAA,EAAA,EAAA,IAAA,AAAI,IACb,OAAO,GACP,UAAU,CAAC,IAAM,GAAS,EAAE,CAAE,CAAE,SAAU,UAAW,SAAU,SAAU,GAC5E,QAAS,CAAA,EAAA,EAAA,IAAA,AAAI,IACV,OAAO,GACP,UAAU,CAAC,IAAM,GAAQ,EAAE,CAAE,CAAE,SAAU,UAAW,SAAU,SAAU,GAC3E,OAAQ,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAAC,QAAQ,OAAO,EACxC,EACA,AAAC,GAAM,CACL,CAAA,EAAA,EAAA,WAAA,AAAW,EAAC,wCAAwC,EAAE,CAAC,EAAE,UAAU,CAAE,EAAE,OAAO,EAC9E,CAAA,EAAA,EAAA,KAAA,AAAK,EAAC,6BAA6B,EAAE,CAAC,EAAE,OAAO,EAChD,EAIU,GAAa,CAAA,EAAA,EAAA,WAAA,AAAW,EACnC,aACA,CACE,GAAI,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,UAAU,GAAG,UAAU,CAAC,IAAM,MACzC,KAAM,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,GACpB,OAAQ,CAAA,EAAA,EAAA,IAAA,AAAI,IACZ,YAAa,CAAA,EAAA,EAAA,IAAA,AAAI,IACjB,EAAG,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAAC,GAAG,OAAO,GAC5B,EAAG,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAAC,GAAG,OAAO,GAC5B,UAAW,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,CAAE,KAAM,cAAe,GAAG,OAAO,GAAG,UAAU,CAAC,IAAM,IAAI,KAC9E,EACC,AAAD,GAAO,CAAC,CAAA,EAAA,EAAA,WAAA,AAAW,EAAC,uBAAuB,EAAE,CAAC,EAAE,IAAI,EAAE,EAG3C,GAAc,CAAA,EAAA,EAAA,WAAA,AAAW,EACpC,cACA,CACE,GAAI,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,UAAU,GAAG,UAAU,CAAC,IAAM,MACzC,QAAS,CAAA,EAAA,EAAA,IAAA,AAAI,IACV,OAAO,GACP,UAAU,CAAC,IAAM,GAAW,EAAE,CAAE,CAAE,SAAU,UAAW,SAAU,SAAU,GAC9E,KAAM,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,GACpB,KAAM,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,GACpB,KAAM,CAAA,EAAA,EAAA,OAAO,AAAP,EAAQ,CAAE,KAAM,SAAU,GAAG,OAAO,EAAC,GAAO,OAAO,GACzD,KAAM,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,CAAE,KAAM,SAAU,GAAG,OAAO,EAAC,GAAO,OAAO,GACzD,SAAU,CAAA,EAAA,EAAA,OAAO,AAAP,EAAQ,CAAE,KAAM,SAAU,GAAG,OAAO,EAAC,GAAM,OAAO,GAC5D,KAAM,CAAA,EAAA,EAAA,IAAA,AAAI,IACV,IAAK,CAAA,EAAA,EAAA,OAAA,AAAO,IAAG,OAAO,CAAC,GAAG,OAAO,EACnC,EACA,AAAC,GAAM,CAAC,CAAA,EAAA,EAAA,KAAA,AAAK,EAAC,2BAA2B,EAAE,CAAC,EAAE,OAAO,EAAE,EAG5C,GAAgB,CAAA,EAAA,EAAA,WAAW,AAAX,EAC3B,gBACA,CACE,GAAI,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,UAAU,GAAG,UAAU,CAAC,IAAM,MACzC,YAAa,CAAA,EAAA,EAAA,IAAA,AAAI,IACd,OAAO,GACP,UAAU,CAAC,IAAM,GAAW,EAAE,CAAE,CAAE,SAAU,UAAW,SAAU,SAAU,GAC9E,UAAW,CAAA,EAAA,EAAA,IAAA,AAAI,IACZ,OAAO,GACP,UAAU,CAAC,IAAM,GAAW,EAAE,CAAE,CAAE,SAAU,UAAW,SAAU,SAAU,GAC9E,WAAY,CAAA,EAAA,EAAA,IAAI,AAAJ,IAAO,OAAO,GAC1B,SAAU,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,GACxB,MAAO,CAAA,EAAA,EAAA,IAAA,AAAI,GACb,EACC,AAAD,GAAO,CACL,CAAA,EAAA,EAAA,KAAA,AAAK,EAAC,+BAA+B,EAAE,CAAC,EAAE,SAAS,EACnD,CAAA,EAAA,EAAA,KAAA,AAAK,EAAC,iCAAiC,EAAE,CAAC,EAAE,WAAW,EACxD,EAIU,GAAW,CAAA,EAAA,EAAA,WAAA,AAAW,EAAC,WAAY,CAC9C,KAAM,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,UAAU,GACvB,KAAM,CAAA,EAAA,EAAA,IAAA,AAAI,IACV,KAAM,CAAA,EAAA,EAAA,IAAA,AAAI,IACV,EAAG,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAAC,GAAG,OAAO,GAC5B,EAAG,CAAA,EAAA,EAAA,IAAI,AAAJ,IAAO,OAAO,CAAC,GAAG,OAAO,GAC5B,QAAS,CAAA,EAAA,EAAA,IAAA,AAAI,IACb,KAAM,CAAA,EAAA,EAAA,OAAO,AAAP,IACN,SAAU,CAAA,EAAA,EAAA,OAAA,AAAO,IAAG,OAAO,CAAC,GAAG,OAAO,GACtC,UAAW,CAAA,EAAA,EAAA,OAAA,AAAO,IAAG,OAAO,CAAC,GAAG,OAAO,GACvC,UAAW,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,CAAE,KAAM,cAAe,GACvC,OAAO,GACP,UAAU,CAAC,IAAM,IAAI,MACrB,SAAS,CAAC,IAAM,IAAI,KACzB,GAEa,GAAe,CAAA,EAAA,EAAA,WAAA,AAAW,EACrC,eACA,CACE,SAAU,CAAA,EAAA,EAAA,IAAA,AAAI,IACX,OAAO,GACP,UAAU,CAAC,IAAuB,GAAS,IAAI,CAAE,CAAE,SAAU,UAAW,SAAU,SAAU,GAC/F,OAAQ,CAAA,EAAA,EAAA,IAAA,AAAI,IACT,OAAO,GACP,UAAU,CAAC,IAAuB,GAAS,IAAI,CAAE,CAAE,SAAU,UAAW,SAAU,SAAU,GAC/F,SAAU,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,CAAE,KAAM,SAAU,GAAG,OAAO,EAAC,GAAO,OAAO,EAC/D,EACA,AAAC,GAAM,CACL,CAAA,EAAA,EAAA,KAAA,AAAK,EAAC,6BAA6B,EAAE,CAAC,EAAE,QAAQ,EAChD,CAAA,EAAA,EAAA,KAAA,AAAK,EAAC,2BAA2B,EAAE,CAAC,EAAE,MAAM,EAC5C,CAAA,EAAA,EAAA,KAAA,AAAK,EAAC,6BAA6B,EAAE,CAAC,EAAE,QAAQ,EAChD,CAAA,EAAA,EAAA,UAAA,AAAU,EAAC,CAAE,QAAS,CAAC,EAAE,QAAQ,CAAE,EAAE,MAAM,CAAC,CAAE,KAAM,iCAAkC,GACvF,EAIU,GAAY,CAAA,EAAA,EAAA,WAAA,AAAW,EAAC,YAAa,CAChD,GAAI,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,UAAU,GAAG,OAAO,CAAC,aAChC,QAAS,CAAA,EAAA,EAAA,OAAA,AAAO,IAAG,OAAO,CAAC,GAAG,OAAO,GACrC,kBAAmB,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,CAAE,KAAM,cAAe,GAClD,UAAW,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,CAAE,KAAM,cAAe,GACvC,OAAO,GACP,UAAU,CAAC,IAAM,IAAI,MACrB,SAAS,CAAC,IAAM,IAAI,KACzB,GAEa,GAAa,CAAA,EAAA,EAAA,WAAA,AAAW,EAAC,aAAc,CAClD,GAAI,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,UAAU,GAAG,OAAO,CAAC,aAChC,WAAY,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAAC,oBAAoB,OAAO,GACtD,cAAe,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAAC,QAAQ,OAAO,GAC7C,OAAQ,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAAC,QAAQ,OAAO,GACtC,iBAAkB,CAAA,EAAA,EAAA,IAAA,AAAI,IACtB,UAAW,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,CAAE,KAAM,cAAe,GACvC,OAAO,GACP,UAAU,CAAC,IAAM,IAAI,MACrB,SAAS,CAAC,IAAM,IAAI,KACzB,GAEa,GAAc,CAAA,EAAA,EAAA,WAAA,AAAW,EAAC,cAAe,CACpD,GAAI,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,UAAU,GAAG,OAAO,CAAC,aAChC,SAAU,CAAA,EAAA,EAAA,IAAA,AAAI,IACd,YAAa,CAAA,EAAA,EAAA,IAAA,AAAI,IAAG,OAAO,CAAC,MAAM,OAAO,GACzC,UAAW,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,CAAE,KAAM,cAAe,GACvC,OAAO,GACP,UAAU,CAAC,IAAM,IAAI,MACrB,SAAS,CAAC,IAAM,IAAI,KACzB","ignoreList":[1,2,3,4,5]}