@ashtuka/react-lib 1.0.40 → 1.0.42

package/dist/modules/DiyaModule/DiyaModule-CR7O-AA3.mjs

@@ -0,0 +1,2159 @@
+import { jsxs as z, jsx as b } from "react/jsx-runtime";
+import * as oe from "react";
+import j, { cloneElement as Ve, Component as qe, createElement as De, useState as pe, useEffect as ge } from "react";
+import { c as We } from "../../chunks/index-BDjvzGbZ.mjs";
+import { L as X } from "../../types/Locale-D0KYJGGt.mjs";
+import ee from "react-localization";
+import { S as vt } from "../../chunks/spinner-By2573Fq.mjs";
+const K = /Android|webOS|iPhone|iPad|iPod|BlackBerry|IEMobile|Opera Mini/i.test(navigator.userAgent), yt = "_diya_5iyk8_1", gt = "_logo_5iyk8_21", Et = "_titleBlock_5iyk8_32", Tt = "_loaderBlock_5iyk8_49", Ct = "_loaderTitle_5iyk8_58", wt = "_loaderSpinner_5iyk8_72", bt = "_spinner_5iyk8_77", St = "_content_5iyk8_86", _t = "_column_5iyk8_97", Pt = "_columnMob_5iyk8_106", Mt = "_qrBlock_5iyk8_110", Rt = "_qr_5iyk8_110", Ot = "_qrTitle_5iyk8_128", At = "_btn_5iyk8_136", kt = "_mob_5iyk8_151", It = "_timerBlock_5iyk8_168", Dt = "_timer_5iyk8_168", Lt = "_timerTitle_5iyk8_196", xt = "_textBlock_5iyk8_209", Nt = "_list_5iyk8_216", Bt = "_phone_5iyk8_228", $t = "_linkBlock_5iyk8_234", Ut = "_linkText_5iyk8_243", Ft = "_timeOverBlock_5iyk8_249", jt = "_downloadBlock_5iyk8_277", zt = "_storeBlock_5iyk8_294", Ht = "_linkLogo_5iyk8_300", N = {
+  diya: yt,
+  logo: gt,
+  titleBlock: Et,
+  loaderBlock: Tt,
+  loaderTitle: Ct,
+  loaderSpinner: wt,
+  spinner: bt,
+  content: St,
+  column: _t,
+  columnMob: Pt,
+  qrBlock: Mt,
+  qr: Rt,
+  qrTitle: Ot,
+  btn: At,
+  mob: kt,
+  timerBlock: It,
+  timer: Dt,
+  timerTitle: Lt,
+  textBlock: xt,
+  list: Nt,
+  phone: Bt,
+  linkBlock: $t,
+  linkText: Ut,
+  timeOverBlock: Ft,
+  downloadBlock: jt,
+  storeBlock: zt,
+  linkLogo: Ht
+}, Yt = ({ locale: t = X.UK }) => {
+  const i = new ee({
+    uk: {
+      noDiya: "Немає застосунку Дія?",
+      download: "Завантажити Дія можна тут"
+    },
+    ru: {
+      noDiya: "Нет приложение Дія?",
+      download: "Скачать Дія можно здесь"
+    }
+  });
+  return i.setLanguage(t), /* @__PURE__ */ z("div", { className: N.downloadBlock, children: [
+    /* @__PURE__ */ b("p", { children: i.noDiya }),
+    /* @__PURE__ */ z("p", { children: [
+      i.download,
+      /* @__PURE__ */ b("span", { children: "↴" })
+    ] }),
+    /* @__PURE__ */ z("div", { className: N.storeBlock, children: [
+      /* @__PURE__ */ b("a", { className: N.linkLogo, href: "https://apps.apple.com/us/app/%D0%B4%D1%96%D1%8F/id1489717872", children: /* @__PURE__ */ b(
+        "img",
+        {
+          src: "https://polis.ua/static/img/react-modules/appsBannerModule/v2/appleSvg.svg",
+          alt: "Apple"
+        }
+      ) }),
+      /* @__PURE__ */ b(
+        "a",
+        {
+          className: N.linkLogo,
+          href: "https://play.google.com/store/apps/details?id=ua.gov.diia.app&hl=ru&gl=US",
+          children: /* @__PURE__ */ b(
+            "img",
+            {
+              src: "https://polis.ua/static/img/react-modules/appsBannerModule/v2/googleSvg.svg",
+              alt: "Google"
+            }
+          )
+        }
+      )
+    ] })
+  ] });
+}, Qt = (t) => /* @__PURE__ */ oe.createElement("svg", { width: 24, height: 24, viewBox: "0 0 24 24", fill: "none", xmlns: "http://www.w3.org/2000/svg", ...t }, /* @__PURE__ */ oe.createElement("path", { d: "M12 24C5.28 24 3.47151 23.6606 1.90545 22.0945C0.339394 20.5285 0 18.72 0 12C0 5.28 0.339394 3.48121 1.90545 1.90545C3.47151 0.329697 5.28 0 12 0C18.72 0 20.5285 0.339394 22.0945 1.90545C23.6606 3.47151 24 5.28 24 12C24 18.72 23.6703 20.5188 22.0945 22.0945C20.5188 23.6703 18.72 24 12 24Z", fill: "black" }), /* @__PURE__ */ oe.createElement("path", { d: "M16.7066 11.9902C16.5092 11.9902 16.3199 11.9118 16.1803 11.7723C16.0408 11.6327 15.9624 11.4434 15.9624 11.246C15.9624 11.0486 16.0408 10.8593 16.1803 10.7197C16.3199 10.5802 16.5092 10.5018 16.7066 10.5018H17.9042V11.9902H16.7066ZM18.9102 9.6363H16.5902C15.6084 9.6363 14.9369 10.2787 14.9369 11.2024C14.9239 11.5347 15.0236 11.8617 15.2199 12.1301C15.4162 12.3986 15.6975 12.5928 16.0181 12.6812L14.7527 14.606H15.8727L17.0096 12.8484H17.9042V14.5987H18.9102V9.6363ZM6.37933 10.9405V9.45449H8.31873V13.6921H5.88479C6.14661 13.2339 6.37933 12.1745 6.37933 10.9405ZM9.3563 8.48479H5.38782V10.9793C5.38782 12.2521 5.16479 13.2436 4.86418 13.6921H4.37933V15.9587H5.36115V14.6157H9.08479V15.9587H10.0666V13.6921H9.3563V8.48479ZM12.3502 13.7599L12.263 13.7018L13.4218 9.6363H11.0775L10.8351 10.5405H12.1951L11.3102 13.6436C11.2697 13.7729 11.2611 13.9101 11.2851 14.0434C11.3092 14.1768 11.3652 14.3023 11.4484 14.4093C11.5315 14.5163 11.6393 14.6015 11.7626 14.6577C11.8859 14.7139 12.021 14.7394 12.1563 14.7321C12.3682 14.729 12.5747 14.6641 12.7502 14.5454L14.3454 13.4666L13.8605 12.7393L12.3502 13.7599ZM13.0315 8.70297C13.5163 8.70297 13.7321 8.51873 13.7321 8.07994C13.7321 7.64115 13.5187 7.43994 13.0315 7.43994C12.5442 7.43994 12.3309 7.62418 12.3309 8.07994C12.3309 8.5357 12.5369 8.70297 13.0315 8.70297Z", fill: "white" })), Vt = (t) => /* @__PURE__ */ oe.createElement("svg", { xmlns: "http://www.w3.org/2000/svg", width: 24, height: 24, viewBox: "0 0 24 24", fill: "none", ...t }, /* @__PURE__ */ oe.createElement("path", { d: "M4 13L16.17 13L10.58 18.59L12 20L20 12L12 4L10.59 5.41L16.17 11L4 11L4 13Z", fill: "#2D2B2B" })), qt = () => {
+  const t = navigator.userAgent || navigator.vendor;
+  return /android/i.test(t) ? "android" : /iPad|iPhone|iPod/.test(t) ? "ios" : "desktop";
+}, Wt = (t) => {
+  const i = qt();
+  let a = "";
+  const s = t == null ? void 0 : t.slice(6);
+  switch (i) {
+    case "android":
+      a = `intent:${s}#Intent;scheme=https;package=ua.gov.diia.app;action=android.intent.action.VIEW;S.browser_fallback_url=https%3A%2F%2Fplay.google.com%2Fstore%2Fapps%2Fdetails%3Fid%3Dua.gov.diia.app%26launch%3Dtrue%0A;end;`;
+      break;
+    case "ios":
+      a = t;
+      break;
+  }
+  return a;
+}, Zt = ({ locale: t = X.UK, deeplink: i }) => {
+  const a = new ee({
+    uk: {
+      linkText: "За цим посиланням Ви потрапите до застосунку Дія. Після виконання інструкцій застосунку Дія повертайтесь до нас, Ваші дані буде внесено до анкети.",
+      linkBtnText: "Перейти в Дія"
+    },
+    ru: {
+      linkText: "По этой ссылке Вы попадете в приложение Дія. После выполнения инструкций приложения Дія возвращайтесь к нам, Ваши данные будут внесены в анкету.",
+      linkBtnText: "Перейти в Дія"
+    }
+  });
+  return a.setLanguage(t), /* @__PURE__ */ z("div", { className: N.linkBlock, children: [
+    /* @__PURE__ */ b("p", { className: N.linkText, children: a.linkText }),
+    /* @__PURE__ */ z(
+      "a",
+      {
+        className: We(N.btn, { [N.mob]: K }),
+        href: Wt(i || ""),
+        children: [
+          K && /* @__PURE__ */ b(Qt, {}),
+          a.linkBtnText,
+          /* @__PURE__ */ b(Vt, {})
+        ]
+      }
+    )
+  ] });
+}, Gt = ({ locale: t = X.UK }) => {
+  const i = new ee({
+    uk: {
+      text1: "Вам потрібно:",
+      text2: "Відкрийте застосунок Дія на Вашому смартфоні",
+      text3: "Переконайтесь що у Вас активовано Дія.Підпис",
+      text4: "На екрані натисніть кнопку сканування QR-коду (як на фото нижче)",
+      text5: "Відскануйте QR-код на цьому екрані."
+    },
+    ru: {
+      text1: "Вам нужно:",
+      text2: "Откройте приложение Дія на Вашем смартфоне",
+      text3: "Убедитесь, что у Вас активировано Дія.Підпис",
+      text4: "На экране нажмите кнопку сканирования QR-кода (как на фото ниже)",
+      text5: "Отсканируйте QR-код на этом экране."
+    }
+  });
+  return i.setLanguage(t), /* @__PURE__ */ z("div", { className: N.textBlock, children: [
+    /* @__PURE__ */ b("p", { children: i.text1 }),
+    /* @__PURE__ */ z("ul", { className: N.list, children: [
+      /* @__PURE__ */ b("li", { children: i.text2 }),
+      /* @__PURE__ */ b("li", { children: i.text3 }),
+      /* @__PURE__ */ b("li", { children: i.text4 }),
+      /* @__PURE__ */ b("img", { className: N.phone, src: "https://polis.ua/static/img/react-modules/diya/diya.png", alt: "Phone" }),
+      /* @__PURE__ */ b("li", { children: i.text5 })
+    ] })
+  ] });
+}, Kt = (t) => /* @__PURE__ */ oe.createElement("svg", { xmlns: "http://www.w3.org/2000/svg", width: 25, height: 24, viewBox: "0 0 25 24", fill: "none", ...t }, /* @__PURE__ */ oe.createElement("path", { d: "M17.6876 18.5356C18.0886 18.1558 18.1058 17.5229 17.7261 17.1219C17.3463 16.7209 16.7134 16.7037 16.3124 17.0834L17.6876 18.5356ZM19.5 15L18.7929 15.7071C19.1834 16.0976 19.8166 16.0976 20.2071 15.7071L19.5 15ZM17.2071 11.2929C16.8166 10.9024 16.1834 10.9024 15.7929 11.2929C15.4024 11.6834 15.4024 12.3166 15.7929 12.7071L17.2071 11.2929ZM23.2071 12.7071C23.5976 12.3166 23.5976 11.6834 23.2071 11.2929C22.8166 10.9024 22.1834 10.9024 21.7929 11.2929L23.2071 12.7071ZM11.5 19C7.63401 19 4.5 15.866 4.5 12H2.5C2.5 16.9706 6.52944 21 11.5 21V19ZM4.5 12C4.5 8.13401 7.63401 5 11.5 5V3C6.52944 3 2.5 7.02944 2.5 12H4.5ZM11.5 5C15.366 5 18.5 8.13401 18.5 12H20.5C20.5 7.02944 16.4706 3 11.5 3V5ZM16.3124 17.0834C15.057 18.2723 13.3646 19 11.5 19V21C13.8963 21 16.0756 20.0622 17.6876 18.5356L16.3124 17.0834ZM18.5 12V15H20.5V12H18.5ZM20.2071 14.2929L17.2071 11.2929L15.7929 12.7071L18.7929 15.7071L20.2071 14.2929ZM20.2071 15.7071L23.2071 12.7071L21.7929 11.2929L18.7929 14.2929L20.2071 15.7071Z", fill: "#2D2B2B" })), Ze = ({ locale: t = X.UK, updateHandler: i }) => {
+  const a = new ee({
+    uk: {
+      updateBtn: "ОНОВИТИ Qr-код",
+      updateLink: "ОНОВИТИ посилання"
+    },
+    ru: {
+      updateBtn: "ОБНОВИТЬ Qr-код",
+      updateLink: "ОБНОВИТЬ ссылку"
+    }
+  });
+  return a.setLanguage(t), /* @__PURE__ */ z(
+    "button",
+    {
+      className: N.btn,
+      type: "button",
+      onClick: i,
+      children: [
+        /* @__PURE__ */ b(Kt, {}),
+        K ? a.updateLink : a.updateBtn
+      ]
+    }
+  );
+};
+var _e = { exports: {} }, he = { exports: {} }, L = {};
+/** @license React v16.13.1
+ * react-is.production.min.js
+ *
+ * Copyright (c) Facebook, Inc. and its affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+var Le;
+function Xt() {
+  if (Le) return L;
+  Le = 1;
+  var t = typeof Symbol == "function" && Symbol.for, i = t ? Symbol.for("react.element") : 60103, a = t ? Symbol.for("react.portal") : 60106, s = t ? Symbol.for("react.fragment") : 60107, o = t ? Symbol.for("react.strict_mode") : 60108, u = t ? Symbol.for("react.profiler") : 60114, m = t ? Symbol.for("react.provider") : 60109, h = t ? Symbol.for("react.context") : 60110, e = t ? Symbol.for("react.async_mode") : 60111, n = t ? Symbol.for("react.concurrent_mode") : 60111, r = t ? Symbol.for("react.forward_ref") : 60112, c = t ? Symbol.for("react.suspense") : 60113, l = t ? Symbol.for("react.suspense_list") : 60120, f = t ? Symbol.for("react.memo") : 60115, d = t ? Symbol.for("react.lazy") : 60116, g = t ? Symbol.for("react.block") : 60121, E = t ? Symbol.for("react.fundamental") : 60117, D = t ? Symbol.for("react.responder") : 60118, $ = t ? Symbol.for("react.scope") : 60119;
+  function C(v) {
+    if (typeof v == "object" && v !== null) {
+      var Z = v.$$typeof;
+      switch (Z) {
+        case i:
+          switch (v = v.type, v) {
+            case e:
+            case n:
+            case s:
+            case u:
+            case o:
+            case c:
+              return v;
+            default:
+              switch (v = v && v.$$typeof, v) {
+                case h:
+                case r:
+                case d:
+                case f:
+                case m:
+                  return v;
+                default:
+                  return Z;
+              }
+          }
+        case a:
+          return Z;
+      }
+    }
+  }
+  function S(v) {
+    return C(v) === n;
+  }
+  return L.AsyncMode = e, L.ConcurrentMode = n, L.ContextConsumer = h, L.ContextProvider = m, L.Element = i, L.ForwardRef = r, L.Fragment = s, L.Lazy = d, L.Memo = f, L.Portal = a, L.Profiler = u, L.StrictMode = o, L.Suspense = c, L.isAsyncMode = function(v) {
+    return S(v) || C(v) === e;
+  }, L.isConcurrentMode = S, L.isContextConsumer = function(v) {
+    return C(v) === h;
+  }, L.isContextProvider = function(v) {
+    return C(v) === m;
+  }, L.isElement = function(v) {
+    return typeof v == "object" && v !== null && v.$$typeof === i;
+  }, L.isForwardRef = function(v) {
+    return C(v) === r;
+  }, L.isFragment = function(v) {
+    return C(v) === s;
+  }, L.isLazy = function(v) {
+    return C(v) === d;
+  }, L.isMemo = function(v) {
+    return C(v) === f;
+  }, L.isPortal = function(v) {
+    return C(v) === a;
+  }, L.isProfiler = function(v) {
+    return C(v) === u;
+  }, L.isStrictMode = function(v) {
+    return C(v) === o;
+  }, L.isSuspense = function(v) {
+    return C(v) === c;
+  }, L.isValidElementType = function(v) {
+    return typeof v == "string" || typeof v == "function" || v === s || v === n || v === u || v === o || v === c || v === l || typeof v == "object" && v !== null && (v.$$typeof === d || v.$$typeof === f || v.$$typeof === m || v.$$typeof === h || v.$$typeof === r || v.$$typeof === E || v.$$typeof === D || v.$$typeof === $ || v.$$typeof === g);
+  }, L.typeOf = C, L;
+}
+var x = {};
+/** @license React v16.13.1
+ * react-is.development.js
+ *
+ * Copyright (c) Facebook, Inc. and its affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+var xe;
+function Jt() {
+  return xe || (xe = 1, process.env.NODE_ENV !== "production" && function() {
+    var t = typeof Symbol == "function" && Symbol.for, i = t ? Symbol.for("react.element") : 60103, a = t ? Symbol.for("react.portal") : 60106, s = t ? Symbol.for("react.fragment") : 60107, o = t ? Symbol.for("react.strict_mode") : 60108, u = t ? Symbol.for("react.profiler") : 60114, m = t ? Symbol.for("react.provider") : 60109, h = t ? Symbol.for("react.context") : 60110, e = t ? Symbol.for("react.async_mode") : 60111, n = t ? Symbol.for("react.concurrent_mode") : 60111, r = t ? Symbol.for("react.forward_ref") : 60112, c = t ? Symbol.for("react.suspense") : 60113, l = t ? Symbol.for("react.suspense_list") : 60120, f = t ? Symbol.for("react.memo") : 60115, d = t ? Symbol.for("react.lazy") : 60116, g = t ? Symbol.for("react.block") : 60121, E = t ? Symbol.for("react.fundamental") : 60117, D = t ? Symbol.for("react.responder") : 60118, $ = t ? Symbol.for("react.scope") : 60119;
+    function C(y) {
+      return typeof y == "string" || typeof y == "function" || // Note: its typeof might be other than 'symbol' or 'number' if it's a polyfill.
+      y === s || y === n || y === u || y === o || y === c || y === l || typeof y == "object" && y !== null && (y.$$typeof === d || y.$$typeof === f || y.$$typeof === m || y.$$typeof === h || y.$$typeof === r || y.$$typeof === E || y.$$typeof === D || y.$$typeof === $ || y.$$typeof === g);
+    }
+    function S(y) {
+      if (typeof y == "object" && y !== null) {
+        var G = y.$$typeof;
+        switch (G) {
+          case i:
+            var de = y.type;
+            switch (de) {
+              case e:
+              case n:
+              case s:
+              case u:
+              case o:
+              case c:
+                return de;
+              default:
+                var Ie = de && de.$$typeof;
+                switch (Ie) {
+                  case h:
+                  case r:
+                  case d:
+                  case f:
+                  case m:
+                    return Ie;
+                  default:
+                    return G;
+                }
+            }
+          case a:
+            return G;
+        }
+      }
+    }
+    var v = e, Z = n, ae = h, J = m, te = i, re = r, H = s, ue = d, se = f, Y = a, V = u, q = o, W = c, ne = !1;
+    function ce(y) {
+      return ne || (ne = !0, console.warn("The ReactIs.isAsyncMode() alias has been deprecated, and will be removed in React 17+. Update your code to use ReactIs.isConcurrentMode() instead. It has the exact same API.")), p(y) || S(y) === e;
+    }
+    function p(y) {
+      return S(y) === n;
+    }
+    function T(y) {
+      return S(y) === h;
+    }
+    function P(y) {
+      return S(y) === m;
+    }
+    function _(y) {
+      return typeof y == "object" && y !== null && y.$$typeof === i;
+    }
+    function w(y) {
+      return S(y) === r;
+    }
+    function A(y) {
+      return S(y) === s;
+    }
+    function M(y) {
+      return S(y) === d;
+    }
+    function O(y) {
+      return S(y) === f;
+    }
+    function k(y) {
+      return S(y) === a;
+    }
+    function B(y) {
+      return S(y) === u;
+    }
+    function I(y) {
+      return S(y) === o;
+    }
+    function Q(y) {
+      return S(y) === c;
+    }
+    x.AsyncMode = v, x.ConcurrentMode = Z, x.ContextConsumer = ae, x.ContextProvider = J, x.Element = te, x.ForwardRef = re, x.Fragment = H, x.Lazy = ue, x.Memo = se, x.Portal = Y, x.Profiler = V, x.StrictMode = q, x.Suspense = W, x.isAsyncMode = ce, x.isConcurrentMode = p, x.isContextConsumer = T, x.isContextProvider = P, x.isElement = _, x.isForwardRef = w, x.isFragment = A, x.isLazy = M, x.isMemo = O, x.isPortal = k, x.isProfiler = B, x.isStrictMode = I, x.isSuspense = Q, x.isValidElementType = C, x.typeOf = S;
+  }()), x;
+}
+var Ne;
+function Ge() {
+  return Ne || (Ne = 1, process.env.NODE_ENV === "production" ? he.exports = Xt() : he.exports = Jt()), he.exports;
+}
+/*
+object-assign
+(c) Sindre Sorhus
+@license MIT
+*/
+var Ee, Be;
+function er() {
+  if (Be) return Ee;
+  Be = 1;
+  var t = Object.getOwnPropertySymbols, i = Object.prototype.hasOwnProperty, a = Object.prototype.propertyIsEnumerable;
+  function s(u) {
+    if (u == null)
+      throw new TypeError("Object.assign cannot be called with null or undefined");
+    return Object(u);
+  }
+  function o() {
+    try {
+      if (!Object.assign)
+        return !1;
+      var u = new String("abc");
+      if (u[5] = "de", Object.getOwnPropertyNames(u)[0] === "5")
+        return !1;
+      for (var m = {}, h = 0; h < 10; h++)
+        m["_" + String.fromCharCode(h)] = h;
+      var e = Object.getOwnPropertyNames(m).map(function(r) {
+        return m[r];
+      });
+      if (e.join("") !== "0123456789")
+        return !1;
+      var n = {};
+      return "abcdefghijklmnopqrst".split("").forEach(function(r) {
+        n[r] = r;
+      }), Object.keys(Object.assign({}, n)).join("") === "abcdefghijklmnopqrst";
+    } catch {
+      return !1;
+    }
+  }
+  return Ee = o() ? Object.assign : function(u, m) {
+    for (var h, e = s(u), n, r = 1; r < arguments.length; r++) {
+      h = Object(arguments[r]);
+      for (var c in h)
+        i.call(h, c) && (e[c] = h[c]);
+      if (t) {
+        n = t(h);
+        for (var l = 0; l < n.length; l++)
+          a.call(h, n[l]) && (e[n[l]] = h[n[l]]);
+      }
+    }
+    return e;
+  }, Ee;
+}
+var Te, $e;
+function Ae() {
+  if ($e) return Te;
+  $e = 1;
+  var t = "SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED";
+  return Te = t, Te;
+}
+var Ce, Ue;
+function Ke() {
+  return Ue || (Ue = 1, Ce = Function.call.bind(Object.prototype.hasOwnProperty)), Ce;
+}
+var we, Fe;
+function tr() {
+  if (Fe) return we;
+  Fe = 1;
+  var t = function() {
+  };
+  if (process.env.NODE_ENV !== "production") {
+    var i = Ae(), a = {}, s = Ke();
+    t = function(u) {
+      var m = "Warning: " + u;
+      typeof console < "u" && console.error(m);
+      try {
+        throw new Error(m);
+      } catch {
+      }
+    };
+  }
+  function o(u, m, h, e, n) {
+    if (process.env.NODE_ENV !== "production") {
+      for (var r in u)
+        if (s(u, r)) {
+          var c;
+          try {
+            if (typeof u[r] != "function") {
+              var l = Error(
+                (e || "React class") + ": " + h + " type `" + r + "` is invalid; it must be a function, usually from the `prop-types` package, but received `" + typeof u[r] + "`.This often happens because of typos such as `PropTypes.function` instead of `PropTypes.func`."
+              );
+              throw l.name = "Invariant Violation", l;
+            }
+            c = u[r](m, r, e, h, null, i);
+          } catch (d) {
+            c = d;
+          }
+          if (c && !(c instanceof Error) && t(
+            (e || "React class") + ": type specification of " + h + " `" + r + "` is invalid; the type checker function must return `null` or an `Error` but returned a " + typeof c + ". You may have forgotten to pass an argument to the type checker creator (arrayOf, instanceOf, objectOf, oneOf, oneOfType, and shape all require an argument)."
+          ), c instanceof Error && !(c.message in a)) {
+            a[c.message] = !0;
+            var f = n ? n() : "";
+            t(
+              "Failed " + h + " type: " + c.message + (f ?? "")
+            );
+          }
+        }
+    }
+  }
+  return o.resetWarningCache = function() {
+    process.env.NODE_ENV !== "production" && (a = {});
+  }, we = o, we;
+}
+var be, je;
+function rr() {
+  if (je) return be;
+  je = 1;
+  var t = Ge(), i = er(), a = Ae(), s = Ke(), o = tr(), u = function() {
+  };
+  process.env.NODE_ENV !== "production" && (u = function(h) {
+    var e = "Warning: " + h;
+    typeof console < "u" && console.error(e);
+    try {
+      throw new Error(e);
+    } catch {
+    }
+  });
+  function m() {
+    return null;
+  }
+  return be = function(h, e) {
+    var n = typeof Symbol == "function" && Symbol.iterator, r = "@@iterator";
+    function c(p) {
+      var T = p && (n && p[n] || p[r]);
+      if (typeof T == "function")
+        return T;
+    }
+    var l = "<<anonymous>>", f = {
+      array: D("array"),
+      bigint: D("bigint"),
+      bool: D("boolean"),
+      func: D("function"),
+      number: D("number"),
+      object: D("object"),
+      string: D("string"),
+      symbol: D("symbol"),
+      any: $(),
+      arrayOf: C,
+      element: S(),
+      elementType: v(),
+      instanceOf: Z,
+      node: re(),
+      objectOf: J,
+      oneOf: ae,
+      oneOfType: te,
+      shape: ue,
+      exact: se
+    };
+    function d(p, T) {
+      return p === T ? p !== 0 || 1 / p === 1 / T : p !== p && T !== T;
+    }
+    function g(p, T) {
+      this.message = p, this.data = T && typeof T == "object" ? T : {}, this.stack = "";
+    }
+    g.prototype = Error.prototype;
+    function E(p) {
+      if (process.env.NODE_ENV !== "production")
+        var T = {}, P = 0;
+      function _(A, M, O, k, B, I, Q) {
+        if (k = k || l, I = I || O, Q !== a) {
+          if (e) {
+            var y = new Error(
+              "Calling PropTypes validators directly is not supported by the `prop-types` package. Use `PropTypes.checkPropTypes()` to call them. Read more at http://fb.me/use-check-prop-types"
+            );
+            throw y.name = "Invariant Violation", y;
+          } else if (process.env.NODE_ENV !== "production" && typeof console < "u") {
+            var G = k + ":" + O;
+            !T[G] && // Avoid spamming the console because they are often not actionable except for lib authors
+            P < 3 && (u(
+              "You are manually calling a React.PropTypes validation function for the `" + I + "` prop on `" + k + "`. This is deprecated and will throw in the standalone `prop-types` package. You may be seeing this warning due to a third-party PropTypes library. See https://fb.me/react-warning-dont-call-proptypes for details."
+            ), T[G] = !0, P++);
+          }
+        }
+        return M[O] == null ? A ? M[O] === null ? new g("The " + B + " `" + I + "` is marked as required " + ("in `" + k + "`, but its value is `null`.")) : new g("The " + B + " `" + I + "` is marked as required in " + ("`" + k + "`, but its value is `undefined`.")) : null : p(M, O, k, B, I);
+      }
+      var w = _.bind(null, !1);
+      return w.isRequired = _.bind(null, !0), w;
+    }
+    function D(p) {
+      function T(P, _, w, A, M, O) {
+        var k = P[_], B = q(k);
+        if (B !== p) {
+          var I = W(k);
+          return new g(
+            "Invalid " + A + " `" + M + "` of type " + ("`" + I + "` supplied to `" + w + "`, expected ") + ("`" + p + "`."),
+            { expectedType: p }
+          );
+        }
+        return null;
+      }
+      return E(T);
+    }
+    function $() {
+      return E(m);
+    }
+    function C(p) {
+      function T(P, _, w, A, M) {
+        if (typeof p != "function")
+          return new g("Property `" + M + "` of component `" + w + "` has invalid PropType notation inside arrayOf.");
+        var O = P[_];
+        if (!Array.isArray(O)) {
+          var k = q(O);
+          return new g("Invalid " + A + " `" + M + "` of type " + ("`" + k + "` supplied to `" + w + "`, expected an array."));
+        }
+        for (var B = 0; B < O.length; B++) {
+          var I = p(O, B, w, A, M + "[" + B + "]", a);
+          if (I instanceof Error)
+            return I;
+        }
+        return null;
+      }
+      return E(T);
+    }
+    function S() {
+      function p(T, P, _, w, A) {
+        var M = T[P];
+        if (!h(M)) {
+          var O = q(M);
+          return new g("Invalid " + w + " `" + A + "` of type " + ("`" + O + "` supplied to `" + _ + "`, expected a single ReactElement."));
+        }
+        return null;
+      }
+      return E(p);
+    }
+    function v() {
+      function p(T, P, _, w, A) {
+        var M = T[P];
+        if (!t.isValidElementType(M)) {
+          var O = q(M);
+          return new g("Invalid " + w + " `" + A + "` of type " + ("`" + O + "` supplied to `" + _ + "`, expected a single ReactElement type."));
+        }
+        return null;
+      }
+      return E(p);
+    }
+    function Z(p) {
+      function T(P, _, w, A, M) {
+        if (!(P[_] instanceof p)) {
+          var O = p.name || l, k = ce(P[_]);
+          return new g("Invalid " + A + " `" + M + "` of type " + ("`" + k + "` supplied to `" + w + "`, expected ") + ("instance of `" + O + "`."));
+        }
+        return null;
+      }
+      return E(T);
+    }
+    function ae(p) {
+      if (!Array.isArray(p))
+        return process.env.NODE_ENV !== "production" && (arguments.length > 1 ? u(
+          "Invalid arguments supplied to oneOf, expected an array, got " + arguments.length + " arguments. A common mistake is to write oneOf(x, y, z) instead of oneOf([x, y, z])."
+        ) : u("Invalid argument supplied to oneOf, expected an array.")), m;
+      function T(P, _, w, A, M) {
+        for (var O = P[_], k = 0; k < p.length; k++)
+          if (d(O, p[k]))
+            return null;
+        var B = JSON.stringify(p, function(Q, y) {
+          var G = W(y);
+          return G === "symbol" ? String(y) : y;
+        });
+        return new g("Invalid " + A + " `" + M + "` of value `" + String(O) + "` " + ("supplied to `" + w + "`, expected one of " + B + "."));
+      }
+      return E(T);
+    }
+    function J(p) {
+      function T(P, _, w, A, M) {
+        if (typeof p != "function")
+          return new g("Property `" + M + "` of component `" + w + "` has invalid PropType notation inside objectOf.");
+        var O = P[_], k = q(O);
+        if (k !== "object")
+          return new g("Invalid " + A + " `" + M + "` of type " + ("`" + k + "` supplied to `" + w + "`, expected an object."));
+        for (var B in O)
+          if (s(O, B)) {
+            var I = p(O, B, w, A, M + "." + B, a);
+            if (I instanceof Error)
+              return I;
+          }
+        return null;
+      }
+      return E(T);
+    }
+    function te(p) {
+      if (!Array.isArray(p))
+        return process.env.NODE_ENV !== "production" && u("Invalid argument supplied to oneOfType, expected an instance of array."), m;
+      for (var T = 0; T < p.length; T++) {
+        var P = p[T];
+        if (typeof P != "function")
+          return u(
+            "Invalid argument supplied to oneOfType. Expected an array of check functions, but received " + ne(P) + " at index " + T + "."
+          ), m;
+      }
+      function _(w, A, M, O, k) {
+        for (var B = [], I = 0; I < p.length; I++) {
+          var Q = p[I], y = Q(w, A, M, O, k, a);
+          if (y == null)
+            return null;
+          y.data && s(y.data, "expectedType") && B.push(y.data.expectedType);
+        }
+        var G = B.length > 0 ? ", expected one of type [" + B.join(", ") + "]" : "";
+        return new g("Invalid " + O + " `" + k + "` supplied to " + ("`" + M + "`" + G + "."));
+      }
+      return E(_);
+    }
+    function re() {
+      function p(T, P, _, w, A) {
+        return Y(T[P]) ? null : new g("Invalid " + w + " `" + A + "` supplied to " + ("`" + _ + "`, expected a ReactNode."));
+      }
+      return E(p);
+    }
+    function H(p, T, P, _, w) {
+      return new g(
+        (p || "React class") + ": " + T + " type `" + P + "." + _ + "` is invalid; it must be a function, usually from the `prop-types` package, but received `" + w + "`."
+      );
+    }
+    function ue(p) {
+      function T(P, _, w, A, M) {
+        var O = P[_], k = q(O);
+        if (k !== "object")
+          return new g("Invalid " + A + " `" + M + "` of type `" + k + "` " + ("supplied to `" + w + "`, expected `object`."));
+        for (var B in p) {
+          var I = p[B];
+          if (typeof I != "function")
+            return H(w, A, M, B, W(I));
+          var Q = I(O, B, w, A, M + "." + B, a);
+          if (Q)
+            return Q;
+        }
+        return null;
+      }
+      return E(T);
+    }
+    function se(p) {
+      function T(P, _, w, A, M) {
+        var O = P[_], k = q(O);
+        if (k !== "object")
+          return new g("Invalid " + A + " `" + M + "` of type `" + k + "` " + ("supplied to `" + w + "`, expected `object`."));
+        var B = i({}, P[_], p);
+        for (var I in B) {
+          var Q = p[I];
+          if (s(p, I) && typeof Q != "function")
+            return H(w, A, M, I, W(Q));
+          if (!Q)
+            return new g(
+              "Invalid " + A + " `" + M + "` key `" + I + "` supplied to `" + w + "`.\nBad object: " + JSON.stringify(P[_], null, "  ") + `
+Valid keys: ` + JSON.stringify(Object.keys(p), null, "  ")
+            );
+          var y = Q(O, I, w, A, M + "." + I, a);
+          if (y)
+            return y;
+        }
+        return null;
+      }
+      return E(T);
+    }
+    function Y(p) {
+      switch (typeof p) {
+        case "number":
+        case "string":
+        case "undefined":
+          return !0;
+        case "boolean":
+          return !p;
+        case "object":
+          if (Array.isArray(p))
+            return p.every(Y);
+          if (p === null || h(p))
+            return !0;
+          var T = c(p);
+          if (T) {
+            var P = T.call(p), _;
+            if (T !== p.entries) {
+              for (; !(_ = P.next()).done; )
+                if (!Y(_.value))
+                  return !1;
+            } else
+              for (; !(_ = P.next()).done; ) {
+                var w = _.value;
+                if (w && !Y(w[1]))
+                  return !1;
+              }
+          } else
+            return !1;
+          return !0;
+        default:
+          return !1;
+      }
+    }
+    function V(p, T) {
+      return p === "symbol" ? !0 : T ? T["@@toStringTag"] === "Symbol" || typeof Symbol == "function" && T instanceof Symbol : !1;
+    }
+    function q(p) {
+      var T = typeof p;
+      return Array.isArray(p) ? "array" : p instanceof RegExp ? "object" : V(T, p) ? "symbol" : T;
+    }
+    function W(p) {
+      if (typeof p > "u" || p === null)
+        return "" + p;
+      var T = q(p);
+      if (T === "object") {
+        if (p instanceof Date)
+          return "date";
+        if (p instanceof RegExp)
+          return "regexp";
+      }
+      return T;
+    }
+    function ne(p) {
+      var T = W(p);
+      switch (T) {
+        case "array":
+        case "object":
+          return "an " + T;
+        case "boolean":
+        case "date":
+        case "regexp":
+          return "a " + T;
+        default:
+          return T;
+      }
+    }
+    function ce(p) {
+      return !p.constructor || !p.constructor.name ? l : p.constructor.name;
+    }
+    return f.checkPropTypes = o, f.resetWarningCache = o.resetWarningCache, f.PropTypes = f, f;
+  }, be;
+}
+var Se, ze;
+function nr() {
+  if (ze) return Se;
+  ze = 1;
+  var t = Ae();
+  function i() {
+  }
+  function a() {
+  }
+  return a.resetWarningCache = i, Se = function() {
+    function s(m, h, e, n, r, c) {
+      if (c !== t) {
+        var l = new Error(
+          "Calling PropTypes validators directly is not supported by the `prop-types` package. Use PropTypes.checkPropTypes() to call them. Read more at http://fb.me/use-check-prop-types"
+        );
+        throw l.name = "Invariant Violation", l;
+      }
+    }
+    s.isRequired = s;
+    function o() {
+      return s;
+    }
+    var u = {
+      array: s,
+      bigint: s,
+      bool: s,
+      func: s,
+      number: s,
+      object: s,
+      string: s,
+      symbol: s,
+      any: s,
+      arrayOf: o,
+      element: s,
+      elementType: s,
+      instanceOf: o,
+      node: s,
+      objectOf: o,
+      oneOf: o,
+      oneOfType: o,
+      shape: o,
+      exact: o,
+      checkPropTypes: a,
+      resetWarningCache: i
+    };
+    return u.PropTypes = u, u;
+  }, Se;
+}
+if (process.env.NODE_ENV !== "production") {
+  var or = Ge(), ir = !0;
+  _e.exports = rr()(or.isElement, ir);
+} else
+  _e.exports = nr()();
+var U = _e.exports;
+function Xe(t, i) {
+  if (!(t instanceof i))
+    throw new TypeError("Cannot call a class as a function");
+}
+function ar(t, i) {
+  for (var a = 0; a < i.length; a++) {
+    var s = i[a];
+    s.enumerable = s.enumerable || !1, s.configurable = !0, "value" in s && (s.writable = !0), Object.defineProperty(t, s.key, s);
+  }
+}
+function Je(t, i, a) {
+  return i && ar(t.prototype, i), t;
+}
+function et(t, i) {
+  if (typeof i != "function" && i !== null)
+    throw new TypeError("Super expression must either be null or a function");
+  t.prototype = Object.create(i && i.prototype, {
+    constructor: {
+      value: t,
+      writable: !0,
+      configurable: !0
+    }
+  }), i && Pe(t, i);
+}
+function ve(t) {
+  return ve = Object.setPrototypeOf ? Object.getPrototypeOf : function(a) {
+    return a.__proto__ || Object.getPrototypeOf(a);
+  }, ve(t);
+}
+function Pe(t, i) {
+  return Pe = Object.setPrototypeOf || function(s, o) {
+    return s.__proto__ = o, s;
+  }, Pe(t, i);
+}
+function sr() {
+  if (typeof Reflect > "u" || !Reflect.construct || Reflect.construct.sham) return !1;
+  if (typeof Proxy == "function") return !0;
+  try {
+    return Date.prototype.toString.call(Reflect.construct(Date, [], function() {
+    })), !0;
+  } catch {
+    return !1;
+  }
+}
+function cr(t) {
+  if (t === void 0)
+    throw new ReferenceError("this hasn't been initialised - super() hasn't been called");
+  return t;
+}
+function lr(t, i) {
+  return i && (typeof i == "object" || typeof i == "function") ? i : cr(t);
+}
+function tt(t) {
+  var i = sr();
+  return function() {
+    var s = ve(t), o;
+    if (i) {
+      var u = ve(this).constructor;
+      o = Reflect.construct(s, arguments, u);
+    } else
+      o = s.apply(this, arguments);
+    return lr(this, o);
+  };
+}
+function ur(t) {
+  return fr(t) || dr(t) || pr(t) || hr();
+}
+function fr(t) {
+  if (Array.isArray(t)) return Me(t);
+}
+function dr(t) {
+  if (typeof Symbol < "u" && Symbol.iterator in Object(t)) return Array.from(t);
+}
+function pr(t, i) {
+  if (t) {
+    if (typeof t == "string") return Me(t, i);
+    var a = Object.prototype.toString.call(t).slice(8, -1);
+    if (a === "Object" && t.constructor && (a = t.constructor.name), a === "Map" || a === "Set") return Array.from(t);
+    if (a === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(a)) return Me(t, i);
+  }
+}
+function Me(t, i) {
+  (i == null || i > t.length) && (i = t.length);
+  for (var a = 0, s = new Array(i); a < i; a++) s[a] = t[a];
+  return s;
+}
+function hr() {
+  throw new TypeError(`Invalid attempt to spread non-iterable instance.
+In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
+}
+function fe(t) {
+  var i = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : 2, a = String(t);
+  if (i === 0) return a;
+  var s = a.match(/(.*?)([0-9]+)(.*)/), o = s ? s[1] : "", u = s ? s[3] : "", m = s ? s[2] : a, h = m.length >= i ? m : (ur(Array(i)).map(function() {
+    return "0";
+  }).join("") + m).slice(i * -1);
+  return "".concat(o).concat(h).concat(u);
+}
+var rt = {
+  daysInHours: !1,
+  zeroPadTime: 2
+};
+function mr(t) {
+  var i = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, a = i.now, s = a === void 0 ? Date.now : a, o = i.precision, u = o === void 0 ? 0 : o, m = i.controlled, h = i.offsetTime, e = h === void 0 ? 0 : h, n = i.overtime, r;
+  typeof t == "string" ? r = new Date(t).getTime() : t instanceof Date ? r = t.getTime() : r = t, m || (r += e);
+  var c = m ? r : r - s(), l = Math.min(20, Math.max(0, u)), f = Math.round(parseFloat(((n ? c : Math.max(0, c)) / 1e3).toFixed(l)) * 1e3), d = Math.abs(f) / 1e3;
+  return {
+    total: f,
+    days: Math.floor(d / (3600 * 24)),
+    hours: Math.floor(d / 3600 % 24),
+    minutes: Math.floor(d / 60 % 60),
+    seconds: Math.floor(d % 60),
+    milliseconds: Number((d % 1 * 1e3).toFixed()),
+    completed: f <= 0
+  };
+}
+function vr(t, i) {
+  var a = t.days, s = t.hours, o = t.minutes, u = t.seconds, m = Object.assign(Object.assign({}, rt), i), h = m.daysInHours, e = m.zeroPadTime, n = m.zeroPadDays, r = n === void 0 ? e : n, c = Math.min(2, e), l = h ? fe(s + a * 24, e) : fe(s, c);
+  return {
+    days: h ? "" : fe(a, r),
+    hours: l,
+    minutes: fe(o, c),
+    seconds: fe(u, c)
+  };
+}
+var nt = function(t) {
+  et(a, t);
+  var i = tt(a);
+  function a() {
+    var s;
+    return Xe(this, a), s = i.apply(this, arguments), s.state = {
+      count: s.props.count || 3
+    }, s.startCountdown = function() {
+      s.interval = window.setInterval(function() {
+        var o = s.state.count - 1;
+        o === 0 ? (s.stopCountdown(), s.props.onComplete && s.props.onComplete()) : s.setState(function(u) {
+          return {
+            count: u.count - 1
+          };
+        });
+      }, 1e3);
+    }, s.stopCountdown = function() {
+      clearInterval(s.interval);
+    }, s.addTime = function(o) {
+      s.stopCountdown(), s.setState(function(u) {
+        return {
+          count: u.count + o
+        };
+      }, s.startCountdown);
+    }, s;
+  }
+  return Je(a, [{
+    key: "componentDidMount",
+    value: function() {
+      this.startCountdown();
+    }
+  }, {
+    key: "componentWillUnmount",
+    value: function() {
+      clearInterval(this.interval);
+    }
+  }, {
+    key: "render",
+    value: function() {
+      return this.props.children ? Ve(this.props.children, {
+        count: this.state.count
+      }) : null;
+    }
+  }]), a;
+}(qe);
+nt.propTypes = {
+  count: U.number,
+  children: U.element,
+  onComplete: U.func
+};
+var ke = function(t) {
+  et(a, t);
+  var i = tt(a);
+  function a(s) {
+    var o;
+    if (Xe(this, a), o = i.call(this, s), o.mounted = !1, o.initialTimestamp = o.calcOffsetStartTimestamp(), o.offsetStartTimestamp = o.props.autoStart ? 0 : o.initialTimestamp, o.offsetTime = 0, o.legacyMode = !1, o.legacyCountdownRef = null, o.tick = function() {
+      var m = o.calcTimeDelta(), h = m.completed && !o.props.overtime ? void 0 : o.props.onTick;
+      o.setTimeDeltaState(m, void 0, h);
+    }, o.setLegacyCountdownRef = function(m) {
+      o.legacyCountdownRef = m;
+    }, o.start = function() {
+      if (!o.isStarted()) {
+        var m = o.offsetStartTimestamp;
+        o.offsetStartTimestamp = 0, o.offsetTime += m ? o.calcOffsetStartTimestamp() - m : 0;
+        var h = o.calcTimeDelta();
+        o.setTimeDeltaState(h, "STARTED", o.props.onStart), !o.props.controlled && (!h.completed || o.props.overtime) && (o.clearTimer(), o.interval = window.setInterval(o.tick, o.props.intervalDelay));
+      }
+    }, o.pause = function() {
+      o.isPaused() || (o.clearTimer(), o.offsetStartTimestamp = o.calcOffsetStartTimestamp(), o.setTimeDeltaState(o.state.timeDelta, "PAUSED", o.props.onPause));
+    }, o.stop = function() {
+      o.isStopped() || (o.clearTimer(), o.offsetStartTimestamp = o.calcOffsetStartTimestamp(), o.offsetTime = o.offsetStartTimestamp - o.initialTimestamp, o.setTimeDeltaState(o.calcTimeDelta(), "STOPPED", o.props.onStop));
+    }, o.isStarted = function() {
+      return o.isStatus("STARTED");
+    }, o.isPaused = function() {
+      return o.isStatus("PAUSED");
+    }, o.isStopped = function() {
+      return o.isStatus("STOPPED");
+    }, o.isCompleted = function() {
+      return o.isStatus("COMPLETED");
+    }, s.date) {
+      var u = o.calcTimeDelta();
+      o.state = {
+        timeDelta: u,
+        status: u.completed ? "COMPLETED" : "STOPPED"
+      };
+    } else
+      o.legacyMode = !0;
+    return o;
+  }
+  return Je(a, [{
+    key: "componentDidMount",
+    value: function() {
+      this.legacyMode || (this.mounted = !0, this.props.onMount && this.props.onMount(this.calcTimeDelta()), this.props.autoStart && this.start());
+    }
+  }, {
+    key: "componentDidUpdate",
+    value: function(o) {
+      this.legacyMode || this.props.date !== o.date && (this.initialTimestamp = this.calcOffsetStartTimestamp(), this.offsetStartTimestamp = this.initialTimestamp, this.offsetTime = 0, this.setTimeDeltaState(this.calcTimeDelta()));
+    }
+  }, {
+    key: "componentWillUnmount",
+    value: function() {
+      this.legacyMode || (this.mounted = !1, this.clearTimer());
+    }
+  }, {
+    key: "calcTimeDelta",
+    value: function() {
+      var o = this.props, u = o.date, m = o.now, h = o.precision, e = o.controlled, n = o.overtime;
+      return mr(u, {
+        now: m,
+        precision: h,
+        controlled: e,
+        offsetTime: this.offsetTime,
+        overtime: n
+      });
+    }
+  }, {
+    key: "calcOffsetStartTimestamp",
+    value: function() {
+      return Date.now();
+    }
+  }, {
+    key: "addTime",
+    value: function(o) {
+      this.legacyCountdownRef.addTime(o);
+    }
+  }, {
+    key: "clearTimer",
+    value: function() {
+      window.clearInterval(this.interval);
+    }
+  }, {
+    key: "isStatus",
+    value: function(o) {
+      return this.state.status === o;
+    }
+  }, {
+    key: "setTimeDeltaState",
+    value: function(o, u, m) {
+      var h = this;
+      if (this.mounted) {
+        var e = o.completed && !this.state.timeDelta.completed, n = o.completed && u === "STARTED";
+        e && !this.props.overtime && this.clearTimer();
+        var r = function() {
+          m && m(h.state.timeDelta), h.props.onComplete && (e || n) && h.props.onComplete(o, n);
+        };
+        return this.setState(function(c) {
+          var l = u || c.status;
+          return o.completed && !h.props.overtime ? l = "COMPLETED" : !u && l === "COMPLETED" && (l = "STOPPED"), {
+            timeDelta: o,
+            status: l
+          };
+        }, r);
+      }
+    }
+  }, {
+    key: "getApi",
+    value: function() {
+      return this.api = this.api || {
+        start: this.start,
+        pause: this.pause,
+        stop: this.stop,
+        isStarted: this.isStarted,
+        isPaused: this.isPaused,
+        isStopped: this.isStopped,
+        isCompleted: this.isCompleted
+      };
+    }
+  }, {
+    key: "getRenderProps",
+    value: function() {
+      var o = this.props, u = o.daysInHours, m = o.zeroPadTime, h = o.zeroPadDays, e = this.state.timeDelta;
+      return Object.assign(Object.assign({}, e), {
+        api: this.getApi(),
+        props: this.props,
+        formatted: vr(e, {
+          daysInHours: u,
+          zeroPadTime: m,
+          zeroPadDays: h
+        })
+      });
+    }
+  }, {
+    key: "render",
+    value: function() {
+      if (this.legacyMode) {
+        var o = this.props, u = o.count, m = o.children, h = o.onComplete;
+        return De(nt, {
+          ref: this.setLegacyCountdownRef,
+          count: u,
+          onComplete: h
+        }, m);
+      }
+      var e = this.props, n = e.className, r = e.overtime, c = e.children, l = e.renderer, f = this.getRenderProps();
+      if (l)
+        return l(f);
+      if (c && this.state.timeDelta.completed && !r)
+        return Ve(c, {
+          countdown: f
+        });
+      var d = f.formatted, g = d.days, E = d.hours, D = d.minutes, $ = d.seconds;
+      return De("span", {
+        className: n
+      }, f.total < 0 ? "-" : "", g, g ? ":" : "", E, ":", D, ":", $);
+    }
+  }]), a;
+}(qe);
+ke.defaultProps = Object.assign(Object.assign({}, rt), {
+  controlled: !1,
+  intervalDelay: 1e3,
+  precision: 0,
+  autoStart: !0
+});
+ke.propTypes = {
+  date: U.oneOfType([U.instanceOf(Date), U.string, U.number]),
+  daysInHours: U.bool,
+  zeroPadTime: U.number,
+  zeroPadDays: U.number,
+  controlled: U.bool,
+  intervalDelay: U.number,
+  precision: U.number,
+  autoStart: U.bool,
+  overtime: U.bool,
+  className: U.string,
+  children: U.element,
+  renderer: U.func,
+  now: U.func,
+  onMount: U.func,
+  onStart: U.func,
+  onPause: U.func,
+  onStop: U.func,
+  onTick: U.func,
+  onComplete: U.func
+};
+const yr = ({ locale: t = X.UK, start: i, setIsTimeOver: a }) => {
+  const s = new ee({
+    uk: {
+      timerTitle: "Ви маєте обмежений час для переходу в застосунок Дія"
+    },
+    ru: {
+      timerTitle: "У вас есть ограниченное время для перехода в приложение Дія"
+    }
+  });
+  s.setLanguage(t);
+  const o = (u) => {
+    const { seconds: m, completed: h, minutes: e } = u;
+    return h ? (a(!0), null) : /* @__PURE__ */ b("div", { children: `${e}:${m > 9 ? m : `0${m}`}` });
+  };
+  return /* @__PURE__ */ z("div", { className: N.timerBlock, children: [
+    /* @__PURE__ */ b("div", { className: N.timer, children: /* @__PURE__ */ b(
+      ke,
+      {
+        date: i,
+        renderer: o
+      }
+    ) }),
+    /* @__PURE__ */ b("div", { className: N.timerTitle, children: s.timerTitle })
+  ] });
+}, gr = ({ locale: t = X.UK }) => {
+  const i = new ee({
+    uk: {
+      timeOver: "Упс, ваш час минув",
+      tryAgain: "Спробуйте ще раз або скористайтеся іншим способом ідентифікації."
+    },
+    ru: {
+      timeOver: "Упс, ваше время прошло",
+      tryAgain: "Попробуйте снова или воспользуйтесь другим способом идентификации."
+    }
+  });
+  return i.setLanguage(t), /* @__PURE__ */ z("div", { className: N.timeOverBlock, children: [
+    /* @__PURE__ */ b("p", { children: i.timeOver }),
+    /* @__PURE__ */ b("p", { children: i.tryAgain })
+  ] });
+}, Er = ({ locale: t = X.UK }) => {
+  const i = new ee({
+    uk: {
+      title: "Переконайтесь, що завантажена остання версія застосунку Дія"
+    },
+    ru: {
+      title: "Убедитесь, что загружена последняя версия приложения Дія"
+    }
+  });
+  return i.setLanguage(t), /* @__PURE__ */ z("div", { className: N.titleBlock, children: [
+    /* @__PURE__ */ z("svg", { xmlns: "http://www.w3.org/2000/svg", width: "25", height: "24", viewBox: "0 0 25 24", fill: "none", children: [
+      /* @__PURE__ */ b("circle", { cx: "12.5", cy: "12", r: "12", fill: "#FFD63B" }),
+      /* @__PURE__ */ b(
+        "path",
+        {
+          d: "M13.8189 5.21875V10.4936C13.8189 11.0592 13.7863 11.6217 13.7211 12.1812C13.6559 12.7345 13.5699 13.3001 13.4632 13.878H11.5956C11.4889 13.3001 11.4029 12.7345 11.3377 12.1812C11.2725 11.6217 11.2399 11.0592 11.2399 10.4936V5.21875H13.8189ZM10.9375 17.207C10.9375 16.9857 10.976 16.7798 11.0531 16.5892C11.1361 16.3986 11.2458 16.2326 11.3822 16.0912C11.5245 15.9498 11.6905 15.8391 11.8802 15.7592C12.0699 15.6732 12.2774 15.6301 12.5027 15.6301C12.7221 15.6301 12.9266 15.6732 13.1164 15.7592C13.3061 15.8391 13.4721 15.9498 13.6144 16.0912C13.7567 16.2326 13.8664 16.3986 13.9434 16.5892C14.0264 16.7798 14.0679 16.9857 14.0679 17.207C14.0679 17.4284 14.0264 17.6374 13.9434 17.8341C13.8664 18.0247 13.7567 18.1907 13.6144 18.3321C13.4721 18.4735 13.3061 18.5842 13.1164 18.6641C12.9266 18.744 12.7221 18.784 12.5027 18.784C12.2774 18.784 12.0699 18.744 11.8802 18.6641C11.6905 18.5842 11.5245 18.4735 11.3822 18.3321C11.2458 18.1907 11.1361 18.0247 11.0531 17.8341C10.976 17.6374 10.9375 17.4284 10.9375 17.207Z",
+          fill: "#2D2B2B"
+        }
+      )
+    ] }),
+    /* @__PURE__ */ b("p", { children: i.title })
+  ] });
+}, Tr = ({ locale: t = X.UK }) => {
+  const i = new ee({
+    uk: {
+      loaderTitleDesk: "Очікуйте завантаження QR-коду",
+      loaderTitleMob: "Очікуйте переходу до застосунку Дія"
+    },
+    ru: {
+      loaderTitleDesk: "Ожидайте загрузку QR-кода",
+      loaderTitleMob: "Ожидайте перехода в приложение Дія"
+    }
+  });
+  return i.setLanguage(t), /* @__PURE__ */ z("div", { className: N.loaderBlock, children: [
+    /* @__PURE__ */ b("p", { className: N.loaderTitle, children: K ? i.loaderTitleMob : i.loaderTitleDesk }),
+    /* @__PURE__ */ b("div", { className: N.loaderSpinner, children: /* @__PURE__ */ b(vt, { className: N.spinner }) })
+  ] });
+};
+var Cr = Object.defineProperty, ye = Object.getOwnPropertySymbols, ot = Object.prototype.hasOwnProperty, it = Object.prototype.propertyIsEnumerable, He = (t, i, a) => i in t ? Cr(t, i, { enumerable: !0, configurable: !0, writable: !0, value: a }) : t[i] = a, Re = (t, i) => {
+  for (var a in i || (i = {}))
+    ot.call(i, a) && He(t, a, i[a]);
+  if (ye)
+    for (var a of ye(i))
+      it.call(i, a) && He(t, a, i[a]);
+  return t;
+}, Oe = (t, i) => {
+  var a = {};
+  for (var s in t)
+    ot.call(t, s) && i.indexOf(s) < 0 && (a[s] = t[s]);
+  if (t != null && ye)
+    for (var s of ye(t))
+      i.indexOf(s) < 0 && it.call(t, s) && (a[s] = t[s]);
+  return a;
+};
+/**
+ * @license QR Code generator library (TypeScript)
+ * Copyright (c) Project Nayuki.
+ * SPDX-License-Identifier: MIT
+ */
+var ie;
+((t) => {
+  const i = class R {
+    /*-- Constructor (low level) and fields --*/
+    // Creates a new QR Code with the given version number,
+    // error correction level, data codeword bytes, and mask number.
+    // This is a low-level API that most users should not use directly.
+    // A mid-level API is the encodeSegments() function.
+    constructor(e, n, r, c) {
+      if (this.version = e, this.errorCorrectionLevel = n, this.modules = [], this.isFunction = [], e < R.MIN_VERSION || e > R.MAX_VERSION)
+        throw new RangeError("Version value out of range");
+      if (c < -1 || c > 7)
+        throw new RangeError("Mask value out of range");
+      this.size = e * 4 + 17;
+      let l = [];
+      for (let d = 0; d < this.size; d++)
+        l.push(!1);
+      for (let d = 0; d < this.size; d++)
+        this.modules.push(l.slice()), this.isFunction.push(l.slice());
+      this.drawFunctionPatterns();
+      const f = this.addEccAndInterleave(r);
+      if (this.drawCodewords(f), c == -1) {
+        let d = 1e9;
+        for (let g = 0; g < 8; g++) {
+          this.applyMask(g), this.drawFormatBits(g);
+          const E = this.getPenaltyScore();
+          E < d && (c = g, d = E), this.applyMask(g);
+        }
+      }
+      o(0 <= c && c <= 7), this.mask = c, this.applyMask(c), this.drawFormatBits(c), this.isFunction = [];
+    }
+    /*-- Static factory functions (high level) --*/
+    // Returns a QR Code representing the given Unicode text string at the given error correction level.
+    // As a conservative upper bound, this function is guaranteed to succeed for strings that have 738 or fewer
+    // Unicode code points (not UTF-16 code units) if the low error correction level is used. The smallest possible
+    // QR Code version is automatically chosen for the output. The ECC level of the result may be higher than the
+    // ecl argument if it can be done without increasing the version.
+    static encodeText(e, n) {
+      const r = t.QrSegment.makeSegments(e);
+      return R.encodeSegments(r, n);
+    }
+    // Returns a QR Code representing the given binary data at the given error correction level.
+    // This function always encodes using the binary segment mode, not any text mode. The maximum number of
+    // bytes allowed is 2953. The smallest possible QR Code version is automatically chosen for the output.
+    // The ECC level of the result may be higher than the ecl argument if it can be done without increasing the version.
+    static encodeBinary(e, n) {
+      const r = t.QrSegment.makeBytes(e);
+      return R.encodeSegments([r], n);
+    }
+    /*-- Static factory functions (mid level) --*/
+    // Returns a QR Code representing the given segments with the given encoding parameters.
+    // The smallest possible QR Code version within the given range is automatically
+    // chosen for the output. Iff boostEcl is true, then the ECC level of the result
+    // may be higher than the ecl argument if it can be done without increasing the
+    // version. The mask number is either between 0 to 7 (inclusive) to force that
+    // mask, or -1 to automatically choose an appropriate mask (which may be slow).
+    // This function allows the user to create a custom sequence of segments that switches
+    // between modes (such as alphanumeric and byte) to encode text in less space.
+    // This is a mid-level API; the high-level API is encodeText() and encodeBinary().
+    static encodeSegments(e, n, r = 1, c = 40, l = -1, f = !0) {
+      if (!(R.MIN_VERSION <= r && r <= c && c <= R.MAX_VERSION) || l < -1 || l > 7)
+        throw new RangeError("Invalid value");
+      let d, g;
+      for (d = r; ; d++) {
+        const C = R.getNumDataCodewords(d, n) * 8, S = m.getTotalBits(e, d);
+        if (S <= C) {
+          g = S;
+          break;
+        }
+        if (d >= c)
+          throw new RangeError("Data too long");
+      }
+      for (const C of [R.Ecc.MEDIUM, R.Ecc.QUARTILE, R.Ecc.HIGH])
+        f && g <= R.getNumDataCodewords(d, C) * 8 && (n = C);
+      let E = [];
+      for (const C of e) {
+        a(C.mode.modeBits, 4, E), a(C.numChars, C.mode.numCharCountBits(d), E);
+        for (const S of C.getData())
+          E.push(S);
+      }
+      o(E.length == g);
+      const D = R.getNumDataCodewords(d, n) * 8;
+      o(E.length <= D), a(0, Math.min(4, D - E.length), E), a(0, (8 - E.length % 8) % 8, E), o(E.length % 8 == 0);
+      for (let C = 236; E.length < D; C ^= 253)
+        a(C, 8, E);
+      let $ = [];
+      for (; $.length * 8 < E.length; )
+        $.push(0);
+      return E.forEach((C, S) => $[S >>> 3] |= C << 7 - (S & 7)), new R(d, n, $, l);
+    }
+    /*-- Accessor methods --*/
+    // Returns the color of the module (pixel) at the given coordinates, which is false
+    // for light or true for dark. The top left corner has the coordinates (x=0, y=0).
+    // If the given coordinates are out of bounds, then false (light) is returned.
+    getModule(e, n) {
+      return 0 <= e && e < this.size && 0 <= n && n < this.size && this.modules[n][e];
+    }
+    // Modified to expose modules for easy access
+    getModules() {
+      return this.modules;
+    }
+    /*-- Private helper methods for constructor: Drawing function modules --*/
+    // Reads this object's version field, and draws and marks all function modules.
+    drawFunctionPatterns() {
+      for (let r = 0; r < this.size; r++)
+        this.setFunctionModule(6, r, r % 2 == 0), this.setFunctionModule(r, 6, r % 2 == 0);
+      this.drawFinderPattern(3, 3), this.drawFinderPattern(this.size - 4, 3), this.drawFinderPattern(3, this.size - 4);
+      const e = this.getAlignmentPatternPositions(), n = e.length;
+      for (let r = 0; r < n; r++)
+        for (let c = 0; c < n; c++)
+          r == 0 && c == 0 || r == 0 && c == n - 1 || r == n - 1 && c == 0 || this.drawAlignmentPattern(e[r], e[c]);
+      this.drawFormatBits(0), this.drawVersion();
+    }
+    // Draws two copies of the format bits (with its own error correction code)
+    // based on the given mask and this object's error correction level field.
+    drawFormatBits(e) {
+      const n = this.errorCorrectionLevel.formatBits << 3 | e;
+      let r = n;
+      for (let l = 0; l < 10; l++)
+        r = r << 1 ^ (r >>> 9) * 1335;
+      const c = (n << 10 | r) ^ 21522;
+      o(c >>> 15 == 0);
+      for (let l = 0; l <= 5; l++)
+        this.setFunctionModule(8, l, s(c, l));
+      this.setFunctionModule(8, 7, s(c, 6)), this.setFunctionModule(8, 8, s(c, 7)), this.setFunctionModule(7, 8, s(c, 8));
+      for (let l = 9; l < 15; l++)
+        this.setFunctionModule(14 - l, 8, s(c, l));
+      for (let l = 0; l < 8; l++)
+        this.setFunctionModule(this.size - 1 - l, 8, s(c, l));
+      for (let l = 8; l < 15; l++)
+        this.setFunctionModule(8, this.size - 15 + l, s(c, l));
+      this.setFunctionModule(8, this.size - 8, !0);
+    }
+    // Draws two copies of the version bits (with its own error correction code),
+    // based on this object's version field, iff 7 <= version <= 40.
+    drawVersion() {
+      if (this.version < 7)
+        return;
+      let e = this.version;
+      for (let r = 0; r < 12; r++)
+        e = e << 1 ^ (e >>> 11) * 7973;
+      const n = this.version << 12 | e;
+      o(n >>> 18 == 0);
+      for (let r = 0; r < 18; r++) {
+        const c = s(n, r), l = this.size - 11 + r % 3, f = Math.floor(r / 3);
+        this.setFunctionModule(l, f, c), this.setFunctionModule(f, l, c);
+      }
+    }
+    // Draws a 9*9 finder pattern including the border separator,
+    // with the center module at (x, y). Modules can be out of bounds.
+    drawFinderPattern(e, n) {
+      for (let r = -4; r <= 4; r++)
+        for (let c = -4; c <= 4; c++) {
+          const l = Math.max(Math.abs(c), Math.abs(r)), f = e + c, d = n + r;
+          0 <= f && f < this.size && 0 <= d && d < this.size && this.setFunctionModule(f, d, l != 2 && l != 4);
+        }
+    }
+    // Draws a 5*5 alignment pattern, with the center module
+    // at (x, y). All modules must be in bounds.
+    drawAlignmentPattern(e, n) {
+      for (let r = -2; r <= 2; r++)
+        for (let c = -2; c <= 2; c++)
+          this.setFunctionModule(e + c, n + r, Math.max(Math.abs(c), Math.abs(r)) != 1);
+    }
+    // Sets the color of a module and marks it as a function module.
+    // Only used by the constructor. Coordinates must be in bounds.
+    setFunctionModule(e, n, r) {
+      this.modules[n][e] = r, this.isFunction[n][e] = !0;
+    }
+    /*-- Private helper methods for constructor: Codewords and masking --*/
+    // Returns a new byte string representing the given data with the appropriate error correction
+    // codewords appended to it, based on this object's version and error correction level.
+    addEccAndInterleave(e) {
+      const n = this.version, r = this.errorCorrectionLevel;
+      if (e.length != R.getNumDataCodewords(n, r))
+        throw new RangeError("Invalid argument");
+      const c = R.NUM_ERROR_CORRECTION_BLOCKS[r.ordinal][n], l = R.ECC_CODEWORDS_PER_BLOCK[r.ordinal][n], f = Math.floor(R.getNumRawDataModules(n) / 8), d = c - f % c, g = Math.floor(f / c);
+      let E = [];
+      const D = R.reedSolomonComputeDivisor(l);
+      for (let C = 0, S = 0; C < c; C++) {
+        let v = e.slice(S, S + g - l + (C < d ? 0 : 1));
+        S += v.length;
+        const Z = R.reedSolomonComputeRemainder(v, D);
+        C < d && v.push(0), E.push(v.concat(Z));
+      }
+      let $ = [];
+      for (let C = 0; C < E[0].length; C++)
+        E.forEach((S, v) => {
+          (C != g - l || v >= d) && $.push(S[C]);
+        });
+      return o($.length == f), $;
+    }
+    // Draws the given sequence of 8-bit codewords (data and error correction) onto the entire
+    // data area of this QR Code. Function modules need to be marked off before this is called.
+    drawCodewords(e) {
+      if (e.length != Math.floor(R.getNumRawDataModules(this.version) / 8))
+        throw new RangeError("Invalid argument");
+      let n = 0;
+      for (let r = this.size - 1; r >= 1; r -= 2) {
+        r == 6 && (r = 5);
+        for (let c = 0; c < this.size; c++)
+          for (let l = 0; l < 2; l++) {
+            const f = r - l, g = (r + 1 & 2) == 0 ? this.size - 1 - c : c;
+            !this.isFunction[g][f] && n < e.length * 8 && (this.modules[g][f] = s(e[n >>> 3], 7 - (n & 7)), n++);
+          }
+      }
+      o(n == e.length * 8);
+    }
+    // XORs the codeword modules in this QR Code with the given mask pattern.
+    // The function modules must be marked and the codeword bits must be drawn
+    // before masking. Due to the arithmetic of XOR, calling applyMask() with
+    // the same mask value a second time will undo the mask. A final well-formed
+    // QR Code needs exactly one (not zero, two, etc.) mask applied.
+    applyMask(e) {
+      if (e < 0 || e > 7)
+        throw new RangeError("Mask value out of range");
+      for (let n = 0; n < this.size; n++)
+        for (let r = 0; r < this.size; r++) {
+          let c;
+          switch (e) {
+            case 0:
+              c = (r + n) % 2 == 0;
+              break;
+            case 1:
+              c = n % 2 == 0;
+              break;
+            case 2:
+              c = r % 3 == 0;
+              break;
+            case 3:
+              c = (r + n) % 3 == 0;
+              break;
+            case 4:
+              c = (Math.floor(r / 3) + Math.floor(n / 2)) % 2 == 0;
+              break;
+            case 5:
+              c = r * n % 2 + r * n % 3 == 0;
+              break;
+            case 6:
+              c = (r * n % 2 + r * n % 3) % 2 == 0;
+              break;
+            case 7:
+              c = ((r + n) % 2 + r * n % 3) % 2 == 0;
+              break;
+            default:
+              throw new Error("Unreachable");
+          }
+          !this.isFunction[n][r] && c && (this.modules[n][r] = !this.modules[n][r]);
+        }
+    }
+    // Calculates and returns the penalty score based on state of this QR Code's current modules.
+    // This is used by the automatic mask choice algorithm to find the mask pattern that yields the lowest score.
+    getPenaltyScore() {
+      let e = 0;
+      for (let l = 0; l < this.size; l++) {
+        let f = !1, d = 0, g = [0, 0, 0, 0, 0, 0, 0];
+        for (let E = 0; E < this.size; E++)
+          this.modules[l][E] == f ? (d++, d == 5 ? e += R.PENALTY_N1 : d > 5 && e++) : (this.finderPenaltyAddHistory(d, g), f || (e += this.finderPenaltyCountPatterns(g) * R.PENALTY_N3), f = this.modules[l][E], d = 1);
+        e += this.finderPenaltyTerminateAndCount(f, d, g) * R.PENALTY_N3;
+      }
+      for (let l = 0; l < this.size; l++) {
+        let f = !1, d = 0, g = [0, 0, 0, 0, 0, 0, 0];
+        for (let E = 0; E < this.size; E++)
+          this.modules[E][l] == f ? (d++, d == 5 ? e += R.PENALTY_N1 : d > 5 && e++) : (this.finderPenaltyAddHistory(d, g), f || (e += this.finderPenaltyCountPatterns(g) * R.PENALTY_N3), f = this.modules[E][l], d = 1);
+        e += this.finderPenaltyTerminateAndCount(f, d, g) * R.PENALTY_N3;
+      }
+      for (let l = 0; l < this.size - 1; l++)
+        for (let f = 0; f < this.size - 1; f++) {
+          const d = this.modules[l][f];
+          d == this.modules[l][f + 1] && d == this.modules[l + 1][f] && d == this.modules[l + 1][f + 1] && (e += R.PENALTY_N2);
+        }
+      let n = 0;
+      for (const l of this.modules)
+        n = l.reduce((f, d) => f + (d ? 1 : 0), n);
+      const r = this.size * this.size, c = Math.ceil(Math.abs(n * 20 - r * 10) / r) - 1;
+      return o(0 <= c && c <= 9), e += c * R.PENALTY_N4, o(0 <= e && e <= 2568888), e;
+    }
+    /*-- Private helper functions --*/
+    // Returns an ascending list of positions of alignment patterns for this version number.
+    // Each position is in the range [0,177), and are used on both the x and y axes.
+    // This could be implemented as lookup table of 40 variable-length lists of integers.
+    getAlignmentPatternPositions() {
+      if (this.version == 1)
+        return [];
+      {
+        const e = Math.floor(this.version / 7) + 2, n = this.version == 32 ? 26 : Math.ceil((this.version * 4 + 4) / (e * 2 - 2)) * 2;
+        let r = [6];
+        for (let c = this.size - 7; r.length < e; c -= n)
+          r.splice(1, 0, c);
+        return r;
+      }
+    }
+    // Returns the number of data bits that can be stored in a QR Code of the given version number, after
+    // all function modules are excluded. This includes remainder bits, so it might not be a multiple of 8.
+    // The result is in the range [208, 29648]. This could be implemented as a 40-entry lookup table.
+    static getNumRawDataModules(e) {
+      if (e < R.MIN_VERSION || e > R.MAX_VERSION)
+        throw new RangeError("Version number out of range");
+      let n = (16 * e + 128) * e + 64;
+      if (e >= 2) {
+        const r = Math.floor(e / 7) + 2;
+        n -= (25 * r - 10) * r - 55, e >= 7 && (n -= 36);
+      }
+      return o(208 <= n && n <= 29648), n;
+    }
+    // Returns the number of 8-bit data (i.e. not error correction) codewords contained in any
+    // QR Code of the given version number and error correction level, with remainder bits discarded.
+    // This stateless pure function could be implemented as a (40*4)-cell lookup table.
+    static getNumDataCodewords(e, n) {
+      return Math.floor(R.getNumRawDataModules(e) / 8) - R.ECC_CODEWORDS_PER_BLOCK[n.ordinal][e] * R.NUM_ERROR_CORRECTION_BLOCKS[n.ordinal][e];
+    }
+    // Returns a Reed-Solomon ECC generator polynomial for the given degree. This could be
+    // implemented as a lookup table over all possible parameter values, instead of as an algorithm.
+    static reedSolomonComputeDivisor(e) {
+      if (e < 1 || e > 255)
+        throw new RangeError("Degree out of range");
+      let n = [];
+      for (let c = 0; c < e - 1; c++)
+        n.push(0);
+      n.push(1);
+      let r = 1;
+      for (let c = 0; c < e; c++) {
+        for (let l = 0; l < n.length; l++)
+          n[l] = R.reedSolomonMultiply(n[l], r), l + 1 < n.length && (n[l] ^= n[l + 1]);
+        r = R.reedSolomonMultiply(r, 2);
+      }
+      return n;
+    }
+    // Returns the Reed-Solomon error correction codeword for the given data and divisor polynomials.
+    static reedSolomonComputeRemainder(e, n) {
+      let r = n.map((c) => 0);
+      for (const c of e) {
+        const l = c ^ r.shift();
+        r.push(0), n.forEach((f, d) => r[d] ^= R.reedSolomonMultiply(f, l));
+      }
+      return r;
+    }
+    // Returns the product of the two given field elements modulo GF(2^8/0x11D). The arguments and result
+    // are unsigned 8-bit integers. This could be implemented as a lookup table of 256*256 entries of uint8.
+    static reedSolomonMultiply(e, n) {
+      if (e >>> 8 || n >>> 8)
+        throw new RangeError("Byte out of range");
+      let r = 0;
+      for (let c = 7; c >= 0; c--)
+        r = r << 1 ^ (r >>> 7) * 285, r ^= (n >>> c & 1) * e;
+      return o(r >>> 8 == 0), r;
+    }
+    // Can only be called immediately after a light run is added, and
+    // returns either 0, 1, or 2. A helper function for getPenaltyScore().
+    finderPenaltyCountPatterns(e) {
+      const n = e[1];
+      o(n <= this.size * 3);
+      const r = n > 0 && e[2] == n && e[3] == n * 3 && e[4] == n && e[5] == n;
+      return (r && e[0] >= n * 4 && e[6] >= n ? 1 : 0) + (r && e[6] >= n * 4 && e[0] >= n ? 1 : 0);
+    }
+    // Must be called at the end of a line (row or column) of modules. A helper function for getPenaltyScore().
+    finderPenaltyTerminateAndCount(e, n, r) {
+      return e && (this.finderPenaltyAddHistory(n, r), n = 0), n += this.size, this.finderPenaltyAddHistory(n, r), this.finderPenaltyCountPatterns(r);
+    }
+    // Pushes the given value to the front and drops the last value. A helper function for getPenaltyScore().
+    finderPenaltyAddHistory(e, n) {
+      n[0] == 0 && (e += this.size), n.pop(), n.unshift(e);
+    }
+  };
+  i.MIN_VERSION = 1, i.MAX_VERSION = 40, i.PENALTY_N1 = 3, i.PENALTY_N2 = 3, i.PENALTY_N3 = 40, i.PENALTY_N4 = 10, i.ECC_CODEWORDS_PER_BLOCK = [
+    // Version: (note that index 0 is for padding, and is set to an illegal value)
+    //0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40    Error correction level
+    [-1, 7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28, 30, 28, 28, 28, 28, 30, 30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30],
+    // Low
+    [-1, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28],
+    // Medium
+    [-1, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30, 30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30],
+    // Quartile
+    [-1, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
+    // High
+  ], i.NUM_ERROR_CORRECTION_BLOCKS = [
+    // Version: (note that index 0 is for padding, and is set to an illegal value)
+    //0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40    Error correction level
+    [-1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 8, 8, 9, 9, 10, 12, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25],
+    // Low
+    [-1, 1, 1, 1, 2, 2, 4, 4, 4, 5, 5, 5, 8, 9, 9, 10, 10, 11, 13, 14, 16, 17, 17, 18, 20, 21, 23, 25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45, 47, 49],
+    // Medium
+    [-1, 1, 1, 2, 2, 4, 4, 6, 6, 8, 8, 8, 10, 12, 16, 12, 17, 16, 18, 21, 20, 23, 23, 25, 27, 29, 34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68],
+    // Quartile
+    [-1, 1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25, 25, 25, 34, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81]
+    // High
+  ], t.QrCode = i;
+  function a(h, e, n) {
+    if (e < 0 || e > 31 || h >>> e)
+      throw new RangeError("Value out of range");
+    for (let r = e - 1; r >= 0; r--)
+      n.push(h >>> r & 1);
+  }
+  function s(h, e) {
+    return (h >>> e & 1) != 0;
+  }
+  function o(h) {
+    if (!h)
+      throw new Error("Assertion error");
+  }
+  const u = class F {
+    /*-- Constructor (low level) and fields --*/
+    // Creates a new QR Code segment with the given attributes and data.
+    // The character count (numChars) must agree with the mode and the bit buffer length,
+    // but the constraint isn't checked. The given bit buffer is cloned and stored.
+    constructor(e, n, r) {
+      if (this.mode = e, this.numChars = n, this.bitData = r, n < 0)
+        throw new RangeError("Invalid argument");
+      this.bitData = r.slice();
+    }
+    /*-- Static factory functions (mid level) --*/
+    // Returns a segment representing the given binary data encoded in
+    // byte mode. All input byte arrays are acceptable. Any text string
+    // can be converted to UTF-8 bytes and encoded as a byte mode segment.
+    static makeBytes(e) {
+      let n = [];
+      for (const r of e)
+        a(r, 8, n);
+      return new F(F.Mode.BYTE, e.length, n);
+    }
+    // Returns a segment representing the given string of decimal digits encoded in numeric mode.
+    static makeNumeric(e) {
+      if (!F.isNumeric(e))
+        throw new RangeError("String contains non-numeric characters");
+      let n = [];
+      for (let r = 0; r < e.length; ) {
+        const c = Math.min(e.length - r, 3);
+        a(parseInt(e.substring(r, r + c), 10), c * 3 + 1, n), r += c;
+      }
+      return new F(F.Mode.NUMERIC, e.length, n);
+    }
+    // Returns a segment representing the given text string encoded in alphanumeric mode.
+    // The characters allowed are: 0 to 9, A to Z (uppercase only), space,
+    // dollar, percent, asterisk, plus, hyphen, period, slash, colon.
+    static makeAlphanumeric(e) {
+      if (!F.isAlphanumeric(e))
+        throw new RangeError("String contains unencodable characters in alphanumeric mode");
+      let n = [], r;
+      for (r = 0; r + 2 <= e.length; r += 2) {
+        let c = F.ALPHANUMERIC_CHARSET.indexOf(e.charAt(r)) * 45;
+        c += F.ALPHANUMERIC_CHARSET.indexOf(e.charAt(r + 1)), a(c, 11, n);
+      }
+      return r < e.length && a(F.ALPHANUMERIC_CHARSET.indexOf(e.charAt(r)), 6, n), new F(F.Mode.ALPHANUMERIC, e.length, n);
+    }
+    // Returns a new mutable list of zero or more segments to represent the given Unicode text string.
+    // The result may use various segment modes and switch modes to optimize the length of the bit stream.
+    static makeSegments(e) {
+      return e == "" ? [] : F.isNumeric(e) ? [F.makeNumeric(e)] : F.isAlphanumeric(e) ? [F.makeAlphanumeric(e)] : [F.makeBytes(F.toUtf8ByteArray(e))];
+    }
+    // Returns a segment representing an Extended Channel Interpretation
+    // (ECI) designator with the given assignment value.
+    static makeEci(e) {
+      let n = [];
+      if (e < 0)
+        throw new RangeError("ECI assignment value out of range");
+      if (e < 128)
+        a(e, 8, n);
+      else if (e < 16384)
+        a(2, 2, n), a(e, 14, n);
+      else if (e < 1e6)
+        a(6, 3, n), a(e, 21, n);
+      else
+        throw new RangeError("ECI assignment value out of range");
+      return new F(F.Mode.ECI, 0, n);
+    }
+    // Tests whether the given string can be encoded as a segment in numeric mode.
+    // A string is encodable iff each character is in the range 0 to 9.
+    static isNumeric(e) {
+      return F.NUMERIC_REGEX.test(e);
+    }
+    // Tests whether the given string can be encoded as a segment in alphanumeric mode.
+    // A string is encodable iff each character is in the following set: 0 to 9, A to Z
+    // (uppercase only), space, dollar, percent, asterisk, plus, hyphen, period, slash, colon.
+    static isAlphanumeric(e) {
+      return F.ALPHANUMERIC_REGEX.test(e);
+    }
+    /*-- Methods --*/
+    // Returns a new copy of the data bits of this segment.
+    getData() {
+      return this.bitData.slice();
+    }
+    // (Package-private) Calculates and returns the number of bits needed to encode the given segments at
+    // the given version. The result is infinity if a segment has too many characters to fit its length field.
+    static getTotalBits(e, n) {
+      let r = 0;
+      for (const c of e) {
+        const l = c.mode.numCharCountBits(n);
+        if (c.numChars >= 1 << l)
+          return 1 / 0;
+        r += 4 + l + c.bitData.length;
+      }
+      return r;
+    }
+    // Returns a new array of bytes representing the given string encoded in UTF-8.
+    static toUtf8ByteArray(e) {
+      e = encodeURI(e);
+      let n = [];
+      for (let r = 0; r < e.length; r++)
+        e.charAt(r) != "%" ? n.push(e.charCodeAt(r)) : (n.push(parseInt(e.substring(r + 1, r + 3), 16)), r += 2);
+      return n;
+    }
+  };
+  u.NUMERIC_REGEX = /^[0-9]*$/, u.ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+.\/:-]*$/, u.ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:";
+  let m = u;
+  t.QrSegment = u;
+})(ie || (ie = {}));
+((t) => {
+  ((i) => {
+    const a = class {
+      // The QR Code can tolerate about 30% erroneous codewords
+      /*-- Constructor and fields --*/
+      constructor(o, u) {
+        this.ordinal = o, this.formatBits = u;
+      }
+    };
+    a.LOW = new a(0, 1), a.MEDIUM = new a(1, 0), a.QUARTILE = new a(2, 3), a.HIGH = new a(3, 2), i.Ecc = a;
+  })(t.QrCode || (t.QrCode = {}));
+})(ie || (ie = {}));
+((t) => {
+  ((i) => {
+    const a = class {
+      /*-- Constructor and fields --*/
+      constructor(o, u) {
+        this.modeBits = o, this.numBitsCharCount = u;
+      }
+      /*-- Method --*/
+      // (Package-private) Returns the bit width of the character count field for a segment in
+      // this mode in a QR Code at the given version number. The result is in the range [0, 16].
+      numCharCountBits(o) {
+        return this.numBitsCharCount[Math.floor((o + 7) / 17)];
+      }
+    };
+    a.NUMERIC = new a(1, [10, 12, 14]), a.ALPHANUMERIC = new a(2, [9, 11, 13]), a.BYTE = new a(4, [8, 16, 16]), a.KANJI = new a(8, [8, 10, 12]), a.ECI = new a(7, [0, 0, 0]), i.Mode = a;
+  })(t.QrSegment || (t.QrSegment = {}));
+})(ie || (ie = {}));
+var le = ie;
+/**
+ * @license qrcode.react
+ * Copyright (c) Paul O'Shannessy
+ * SPDX-License-Identifier: ISC
+ */
+var wr = {
+  L: le.QrCode.Ecc.LOW,
+  M: le.QrCode.Ecc.MEDIUM,
+  Q: le.QrCode.Ecc.QUARTILE,
+  H: le.QrCode.Ecc.HIGH
+}, at = 128, st = "L", ct = "#FFFFFF", lt = "#000000", ut = !1, ft = 1, br = 4, Sr = 0, _r = 0.1;
+function dt(t, i = 0) {
+  const a = [];
+  return t.forEach(function(s, o) {
+    let u = null;
+    s.forEach(function(m, h) {
+      if (!m && u !== null) {
+        a.push(
+          `M${u + i} ${o + i}h${h - u}v1H${u + i}z`
+        ), u = null;
+        return;
+      }
+      if (h === s.length - 1) {
+        if (!m)
+          return;
+        u === null ? a.push(`M${h + i},${o + i} h1v1H${h + i}z`) : a.push(
+          `M${u + i},${o + i} h${h + 1 - u}v1H${u + i}z`
+        );
+        return;
+      }
+      m && u === null && (u = h);
+    });
+  }), a.join("");
+}
+function pt(t, i) {
+  return t.slice().map((a, s) => s < i.y || s >= i.y + i.h ? a : a.map((o, u) => u < i.x || u >= i.x + i.w ? o : !1));
+}
+function Pr(t, i, a, s) {
+  if (s == null)
+    return null;
+  const o = t.length + a * 2, u = Math.floor(i * _r), m = o / i, h = (s.width || u) * m, e = (s.height || u) * m, n = s.x == null ? t.length / 2 - h / 2 : s.x * m, r = s.y == null ? t.length / 2 - e / 2 : s.y * m, c = s.opacity == null ? 1 : s.opacity;
+  let l = null;
+  if (s.excavate) {
+    let d = Math.floor(n), g = Math.floor(r), E = Math.ceil(h + n - d), D = Math.ceil(e + r - g);
+    l = { x: d, y: g, w: E, h: D };
+  }
+  const f = s.crossOrigin;
+  return { x: n, y: r, h: e, w: h, excavation: l, opacity: c, crossOrigin: f };
+}
+function Mr(t, i) {
+  return i != null ? Math.max(Math.floor(i), 0) : t ? br : Sr;
+}
+function ht({
+  value: t,
+  level: i,
+  minVersion: a,
+  includeMargin: s,
+  marginSize: o,
+  imageSettings: u,
+  size: m,
+  boostLevel: h
+}) {
+  let e = j.useMemo(() => {
+    const d = (Array.isArray(t) ? t : [t]).reduce((g, E) => (g.push(...le.QrSegment.makeSegments(E)), g), []);
+    return le.QrCode.encodeSegments(
+      d,
+      wr[i],
+      a,
+      void 0,
+      void 0,
+      h
+    );
+  }, [t, i, a, h]);
+  const { cells: n, margin: r, numCells: c, calculatedImageSettings: l } = j.useMemo(() => {
+    let f = e.getModules();
+    const d = Mr(s, o), g = f.length + d * 2, E = Pr(
+      f,
+      m,
+      d,
+      u
+    );
+    return {
+      cells: f,
+      margin: d,
+      numCells: g,
+      calculatedImageSettings: E
+    };
+  }, [e, m, u, s, o]);
+  return {
+    qrcode: e,
+    margin: r,
+    cells: n,
+    numCells: c,
+    calculatedImageSettings: l
+  };
+}
+var Rr = function() {
+  try {
+    new Path2D().addPath(new Path2D());
+  } catch {
+    return !1;
+  }
+  return !0;
+}(), mt = j.forwardRef(
+  function(i, a) {
+    const s = i, {
+      value: o,
+      size: u = at,
+      level: m = st,
+      bgColor: h = ct,
+      fgColor: e = lt,
+      includeMargin: n = ut,
+      minVersion: r = ft,
+      boostLevel: c,
+      marginSize: l,
+      imageSettings: f
+    } = s, g = Oe(s, [
+      "value",
+      "size",
+      "level",
+      "bgColor",
+      "fgColor",
+      "includeMargin",
+      "minVersion",
+      "boostLevel",
+      "marginSize",
+      "imageSettings"
+    ]), { style: E } = g, D = Oe(g, ["style"]), $ = f == null ? void 0 : f.src, C = j.useRef(null), S = j.useRef(null), v = j.useCallback(
+      (Y) => {
+        C.current = Y, typeof a == "function" ? a(Y) : a && (a.current = Y);
+      },
+      [a]
+    ), [Z, ae] = j.useState(!1), { margin: J, cells: te, numCells: re, calculatedImageSettings: H } = ht({
+      value: o,
+      level: m,
+      minVersion: r,
+      boostLevel: c,
+      includeMargin: n,
+      marginSize: l,
+      imageSettings: f,
+      size: u
+    });
+    j.useEffect(() => {
+      if (C.current != null) {
+        const Y = C.current, V = Y.getContext("2d");
+        if (!V)
+          return;
+        let q = te;
+        const W = S.current, ne = H != null && W !== null && W.complete && W.naturalHeight !== 0 && W.naturalWidth !== 0;
+        ne && H.excavation != null && (q = pt(
+          te,
+          H.excavation
+        ));
+        const ce = window.devicePixelRatio || 1;
+        Y.height = Y.width = u * ce;
+        const p = u / re * ce;
+        V.scale(p, p), V.fillStyle = h, V.fillRect(0, 0, re, re), V.fillStyle = e, Rr ? V.fill(new Path2D(dt(q, J))) : te.forEach(function(T, P) {
+          T.forEach(function(_, w) {
+            _ && V.fillRect(w + J, P + J, 1, 1);
+          });
+        }), H && (V.globalAlpha = H.opacity), ne && V.drawImage(
+          W,
+          H.x + J,
+          H.y + J,
+          H.w,
+          H.h
+        );
+      }
+    }), j.useEffect(() => {
+      ae(!1);
+    }, [$]);
+    const ue = Re({ height: u, width: u }, E);
+    let se = null;
+    return $ != null && (se = /* @__PURE__ */ j.createElement(
+      "img",
+      {
+        src: $,
+        key: $,
+        style: { display: "none" },
+        onLoad: () => {
+          ae(!0);
+        },
+        ref: S,
+        crossOrigin: H == null ? void 0 : H.crossOrigin
+      }
+    )), /* @__PURE__ */ j.createElement(j.Fragment, null, /* @__PURE__ */ j.createElement(
+      "canvas",
+      Re({
+        style: ue,
+        height: u,
+        width: u,
+        ref: v,
+        role: "img"
+      }, D)
+    ), se);
+  }
+);
+mt.displayName = "QRCodeCanvas";
+var Or = j.forwardRef(
+  function(i, a) {
+    const s = i, {
+      value: o,
+      size: u = at,
+      level: m = st,
+      bgColor: h = ct,
+      fgColor: e = lt,
+      includeMargin: n = ut,
+      minVersion: r = ft,
+      boostLevel: c,
+      title: l,
+      marginSize: f,
+      imageSettings: d
+    } = s, g = Oe(s, [
+      "value",
+      "size",
+      "level",
+      "bgColor",
+      "fgColor",
+      "includeMargin",
+      "minVersion",
+      "boostLevel",
+      "title",
+      "marginSize",
+      "imageSettings"
+    ]), { margin: E, cells: D, numCells: $, calculatedImageSettings: C } = ht({
+      value: o,
+      level: m,
+      minVersion: r,
+      boostLevel: c,
+      includeMargin: n,
+      marginSize: f,
+      imageSettings: d,
+      size: u
+    });
+    let S = D, v = null;
+    d != null && C != null && (C.excavation != null && (S = pt(
+      D,
+      C.excavation
+    )), v = /* @__PURE__ */ j.createElement(
+      "image",
+      {
+        href: d.src,
+        height: C.h,
+        width: C.w,
+        x: C.x + E,
+        y: C.y + E,
+        preserveAspectRatio: "none",
+        opacity: C.opacity,
+        crossOrigin: C.crossOrigin
+      }
+    ));
+    const Z = dt(S, E);
+    return /* @__PURE__ */ j.createElement(
+      "svg",
+      Re({
+        height: u,
+        width: u,
+        viewBox: `0 0 ${$} ${$}`,
+        ref: a,
+        role: "img"
+      }, g),
+      !!l && /* @__PURE__ */ j.createElement("title", null, l),
+      /* @__PURE__ */ j.createElement(
+        "path",
+        {
+          fill: h,
+          d: `M0,0 h${$}v${$}H0z`,
+          shapeRendering: "crispEdges"
+        }
+      ),
+      /* @__PURE__ */ j.createElement("path", { fill: e, d: Z, shapeRendering: "crispEdges" }),
+      v
+    );
+  }
+);
+Or.displayName = "QRCodeSVG";
+const Ar = ({ locale: t = X.UK, deeplink: i = "", updateHandler: a }) => {
+  const s = new ee({
+    uk: {
+      qrTitle: "Відскануйте QR-код"
+    },
+    ru: {
+      qrTitle: "Отсканируйте QR-код"
+    }
+  });
+  return s.setLanguage(t), /* @__PURE__ */ z("div", { className: N.column, children: [
+    /* @__PURE__ */ z("div", { className: N.qrBlock, children: [
+      /* @__PURE__ */ b("p", { className: N.qrTitle, children: s.qrTitle }),
+      /* @__PURE__ */ b("div", { className: N.qr, children: /* @__PURE__ */ b(mt, { value: i, size: 206 }) })
+    ] }),
+    /* @__PURE__ */ b(Ze, { locale: t, updateHandler: a })
+  ] });
+};
+var me = /* @__PURE__ */ ((t) => (t.INITIAL = "initial", t.LOADING = "loading", t.SUCCESS = "success", t.ERROR = "error", t))(me || {});
+const Ye = 6e4, Qe = 1e3, Ur = ({
+  locale: t = X.UK,
+  deeplinkStatus: i,
+  deeplink: a,
+  getDeeplinkCallback: s,
+  updateDeeplinkCallback: o,
+  getUserDataCallback: u,
+  setTimerIdCallback: m
+}) => {
+  const [h, e] = pe(Date.now() + 3 * Ye), [n, r] = pe(!1), [c, l] = pe(!1), [f, d] = pe(null), g = () => {
+    o(), e(Date.now() + 3 * Ye), r(!1), f && clearInterval(f), l(!1), s();
+  }, E = () => {
+    f && clearInterval(f);
+  };
+  return ge(() => {
+    s();
+  }, []), ge(() => (f && window.addEventListener("popstate", E), () => {
+    E(), window.removeEventListener("popstate", E);
+  }), [f]), ge(() => (f && clearInterval(f), a && !c && (l(!0), setTimeout(() => {
+    const D = setInterval(
+      () => u(),
+      2.5 * Qe
+    );
+    d(D), m(D);
+  }, 20 * Qe)), () => {
+    f && clearInterval(f);
+  }), [a]), /* @__PURE__ */ z("div", { className: N.diya, children: [
+    /* @__PURE__ */ b("img", { className: N.logo, src: "https://polis.ua/static/img/react-modules/diya/diyaLogo.png", alt: "Diya logo" }),
+    !K && /* @__PURE__ */ b(Er, { locale: t }),
+    (i === me.INITIAL || i === me.LOADING) && /* @__PURE__ */ b(Tr, { locale: t }),
+    i === me.SUCCESS && a && /* @__PURE__ */ z("div", { className: N.content, children: [
+      !K && !n && /* @__PURE__ */ b(Ar, { locale: t, deeplink: a, updateHandler: g }),
+      /* @__PURE__ */ z("div", { className: We(N.column, { [N.columnMob]: K || n }), children: [
+        !n && /* @__PURE__ */ b(yr, { locale: t, start: h, setIsTimeOver: r }),
+        !K && !n && /* @__PURE__ */ b(Gt, { locale: t }),
+        K && !n && /* @__PURE__ */ b(Zt, { locale: t, deeplink: a }),
+        K && !n && /* @__PURE__ */ b(Yt, { locale: t }),
+        n && /* @__PURE__ */ b(gr, { locale: t }),
+        n && /* @__PURE__ */ b(Ze, { locale: t, updateHandler: g })
+      ] })
+    ] })
+  ] });
+};
+export {
+  Ur as D
+};