libtess-asm-ZSHP2UIP.js 247 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999
  1. import {
  2. fs_exports,
  3. init_fs,
  4. init_path,
  5. path_exports
  6. } from "./chunk-DL3VOCHZ.js";
  7. import "./chunk-A5ICIBVI.js";
  8. // node_modules/@arcgis/core/chunks/libtess-asm.js
  9. function r(r2, e2) {
  10. for (var f2 = 0; f2 < e2.length; f2++) {
  11. const i2 = e2[f2];
  12. if (typeof i2 != "string" && !Array.isArray(i2)) {
  13. for (const e3 in i2)
  14. if (e3 !== "default" && !(e3 in r2)) {
  15. const f3 = Object.getOwnPropertyDescriptor(i2, e3);
  16. f3 && Object.defineProperty(r2, e3, f3.get ? f3 : { enumerable: true, get: () => i2[e3] });
  17. }
  18. }
  19. }
  20. return Object.freeze(Object.defineProperty(r2, Symbol.toStringTag, { value: "Module" }));
  21. }
  22. var e;
  23. var f;
  24. var i;
  25. var a = { exports: {} };
  26. e = a, f = function() {
  27. function r2(r3) {
  28. const f2 = r3.locateFile, i2 = {};
  29. var a2 = a2 !== void 0 ? a2 : {};
  30. const n2 = (() => {
  31. let r4;
  32. return { resolve: (e2) => r4(e2), promise: new Promise((e2) => r4 = e2) };
  33. })(), t = () => n2.promise;
  34. a2.locateFile = f2, a2.onRuntimeInitialized = () => {
  35. n2.resolve(i2);
  36. }, i2.Module = a2, i2.whenLoaded = t;
  37. var o, b = {};
  38. for (o in a2)
  39. a2.hasOwnProperty(o) && (b[o] = a2[o]);
  40. var k, u, c, s, A, l = typeof window == "object", v = typeof importScripts == "function", d = typeof process == "object" && typeof process.versions == "object" && typeof process.versions.node == "string", h = "";
  41. function p(r4) {
  42. return a2.locateFile ? a2.locateFile(r4, h) : h + r4;
  43. }
  44. d ? (h = v ? (init_path(), path_exports).dirname(h) + "/" : __dirname + "/", k = function(r4, e2) {
  45. var f3 = dr(r4);
  46. return f3 ? e2 ? f3 : f3.toString() : (s || (s = (init_fs(), fs_exports)), A || (A = (init_path(), path_exports)), r4 = A.normalize(r4), s.readFileSync(r4, e2 ? null : "utf8"));
  47. }, c = function(r4) {
  48. var e2 = k(r4, true);
  49. return e2.buffer || (e2 = new Uint8Array(e2)), S(e2.buffer), e2;
  50. }, u = function(r4, e2, f3) {
  51. var i3 = dr(r4);
  52. i3 && e2(i3), s || (s = (init_fs(), fs_exports)), A || (A = (init_path(), path_exports)), r4 = A.normalize(r4), s.readFile(r4, function(r5, i4) {
  53. r5 ? f3(r5) : e2(i4.buffer);
  54. });
  55. }, process.argv.length > 1 && process.argv[1].replace(/\\/g, "/"), process.argv.slice(2), e.exports = a2, process.on("uncaughtException", function(r4) {
  56. if (!(r4 instanceof Sr))
  57. throw r4;
  58. }), process.on("unhandledRejection", X), a2.inspect = function() {
  59. return "[Emscripten Module object]";
  60. }) : (l || v) && (v ? h = self.location.href : typeof document != "undefined" && document.currentScript && (h = document.currentScript.src), h = h.indexOf("blob:") !== 0 ? h.substr(0, h.lastIndexOf("/") + 1) : "", k = function(r4) {
  61. try {
  62. var e2 = new XMLHttpRequest();
  63. return e2.open("GET", r4, false), e2.send(null), e2.responseText;
  64. } catch (m2) {
  65. var f3 = dr(r4);
  66. if (f3)
  67. return Ar(f3);
  68. throw m2;
  69. }
  70. }, v && (c = function(r4) {
  71. try {
  72. var e2 = new XMLHttpRequest();
  73. return e2.open("GET", r4, false), e2.responseType = "arraybuffer", e2.send(null), new Uint8Array(e2.response);
  74. } catch (m2) {
  75. var f3 = dr(r4);
  76. if (f3)
  77. return f3;
  78. throw m2;
  79. }
  80. }), u = function(r4, e2, f3) {
  81. var i3 = new XMLHttpRequest();
  82. i3.open("GET", r4, true), i3.responseType = "arraybuffer", i3.onload = function() {
  83. if (i3.status == 200 || i3.status == 0 && i3.response)
  84. e2(i3.response);
  85. else {
  86. var a3 = dr(r4);
  87. a3 ? e2(a3.buffer) : f3();
  88. }
  89. }, i3.onerror = f3, i3.send(null);
  90. });
  91. var w = a2.print || console.log.bind(console), m = a2.printErr || console.warn.bind(console);
  92. for (o in b)
  93. b.hasOwnProperty(o) && (a2[o] = b[o]);
  94. b = null, a2.arguments && a2.arguments, a2.thisProgram && a2.thisProgram, a2.quit && a2.quit;
  95. var y, g = 0, E = function(r4) {
  96. g = r4;
  97. }, C = function() {
  98. return g;
  99. };
  100. a2.wasmBinary && (y = a2.wasmBinary), a2.noExitRuntime;
  101. var R, M = { Memory: function(r4) {
  102. this.buffer = new ArrayBuffer(65536 * r4.initial);
  103. }, Module: function(r4) {
  104. }, Instance: function(r4, e2) {
  105. this.exports = function(r5) {
  106. function e3(r6) {
  107. return r6.set = function(r7, e4) {
  108. this[r7] = e4;
  109. }, r6.get = function(r7) {
  110. return this[r7];
  111. }, r6;
  112. }
  113. for (var f3, i3 = new Uint8Array(123), a3 = 25; a3 >= 0; --a3)
  114. i3[48 + a3] = 52 + a3, i3[65 + a3] = a3, i3[97 + a3] = 26 + a3;
  115. function n3(r6, e4, f4) {
  116. for (var a4, n4, t3 = 0, o3 = e4, b3 = f4.length, k3 = e4 + (3 * b3 >> 2) - (f4[b3 - 2] == "=") - (f4[b3 - 1] == "="); t3 < b3; t3 += 4)
  117. a4 = i3[f4.charCodeAt(t3 + 1)], n4 = i3[f4.charCodeAt(t3 + 2)], r6[o3++] = i3[f4.charCodeAt(t3)] << 2 | a4 >> 4, o3 < k3 && (r6[o3++] = a4 << 4 | n4 >> 2), o3 < k3 && (r6[o3++] = n4 << 6 | i3[f4.charCodeAt(t3 + 3)]);
  118. }
  119. function t2(r6) {
  120. n3(f3, 1024, "LSsgICAwWDB4AC0wWCswWCAwWC0weCsweCAweABuYW4AaW5mAE5BTgBJTkYALgAobnVsbCkAR290IGVycm9yICVkCgAlZCAlZCAoJWYsJWYpLCglZiwlZiksKCVmLCVmKSAK"), n3(f3, 1132, "BwAAAAAAAD8AAAA/AAAAAAAAAAB4Bg=="), n3(f3, 1168, "EQAKABEREQAAAAAFAAAAAAAACQAAAAALAAAAAAAAAAARAA8KERERAwoHAAEACQsLAAAJBgsAAAsABhEAAAARERE="), n3(f3, 1249, "CwAAAAAAAAAAEQAKChEREQAKAAACAAkLAAAACQALAAAL"), n3(f3, 1307, "DA=="), n3(f3, 1319, "DAAAAAAMAAAAAAkMAAAAAAAMAAAM"), n3(f3, 1365, "Dg=="), n3(f3, 1377, "DQAAAAQNAAAAAAkOAAAAAAAOAAAO"), n3(f3, 1423, "EA=="), n3(f3, 1435, "DwAAAAAPAAAAAAkQAAAAAAAQAAAQAAASAAAAEhIS"), n3(f3, 1490, "EgAAABISEgAAAAAAAAk="), n3(f3, 1539, "Cw=="), n3(f3, 1551, "CgAAAAAKAAAAAAkLAAAAAAALAAAL"), n3(f3, 1597, "DA=="), n3(f3, 1609, "DAAAAAAMAAAAAAkMAAAAAAAMAAAMAAAwMTIzNDU2Nzg5QUJDREVG"), n3(f3, 1648, "4I8AAAAAAAAF"), n3(f3, 1668, "KA=="), n3(f3, 1692, "KQAAACoAAACYCwAAAAQ="), n3(f3, 1716, "AQ=="), n3(f3, 1731, "Cv////8="), n3(f3, 1972, "wA8=");
  121. }
  122. i3[43] = 62, i3[47] = 63;
  123. var o2 = new ArrayBuffer(16), b2 = new Int32Array(o2), k2 = new Float64Array(o2);
  124. function u2(r6) {
  125. return b2[r6];
  126. }
  127. function c2(r6, e4) {
  128. b2[r6] = e4;
  129. }
  130. function s2() {
  131. return k2[0];
  132. }
  133. function A2(r6) {
  134. k2[0] = r6;
  135. }
  136. function l2(r6) {
  137. var i4 = r6.a, a4 = i4.buffer;
  138. i4.grow = ue;
  139. var n4 = new Int8Array(a4), o3 = new Int16Array(a4), b3 = new Int32Array(a4), k3 = new Uint8Array(a4), l3 = new Uint16Array(a4), v2 = new Uint32Array(a4), d2 = new Float32Array(a4), h2 = new Float64Array(a4), p2 = Math.imul, w2 = Math.fround, m2 = Math.abs, y2 = Math.clz32, g2 = Math.max, E2 = r6.abort, C2 = r6.b, R2 = r6.c, M2 = r6.d, I2 = r6.e, S2 = r6.f, _2 = r6.g, P2 = r6.h, x2 = r6.i, L2 = r6.j, B2 = r6.k, T2 = r6.l, U2 = r6.m, j2 = 36832, F2 = 0;
  140. function O2(r7) {
  141. var e4 = 0, f4 = 0, i5 = 0, a5 = 0, n5 = 0, t3 = 0, o4 = 0, u3 = 0, c3 = 0, s3 = 0, A3 = 0, l4 = 0, d3 = 0, h3 = 0;
  142. j2 = l4 = j2 - 16 | 0;
  143. r: {
  144. e: {
  145. f: {
  146. i: {
  147. a: {
  148. n: {
  149. t: {
  150. o: {
  151. b: {
  152. k: {
  153. u: {
  154. c: {
  155. if ((r7 |= 0) >>> 0 <= 244) {
  156. if (3 & (e4 = (n5 = b3[614]) >>> (f4 = (u3 = r7 >>> 0 < 11 ? 16 : r7 + 11 & -8) >>> 3 | 0) | 0)) {
  157. r7 = (a5 = b3[2504 + (e4 = (i5 = f4 + (1 & (-1 ^ e4)) | 0) << 3) >> 2]) + 8 | 0, (0 | (f4 = b3[a5 + 8 >> 2])) != (0 | (e4 = e4 + 2496 | 0)) ? (b3[f4 + 12 >> 2] = e4, b3[e4 + 8 >> 2] = f4) : (d3 = 2456, h3 = Jr(i5) & n5, b3[d3 >> 2] = h3), e4 = i5 << 3, b3[a5 + 4 >> 2] = 3 | e4, b3[4 + (e4 = e4 + a5 | 0) >> 2] = 1 | b3[e4 + 4 >> 2];
  158. break r;
  159. }
  160. if ((s3 = b3[616]) >>> 0 >= u3 >>> 0)
  161. break c;
  162. if (e4) {
  163. f4 = r7 = (e4 = (0 - (r7 = (0 - (r7 = 2 << f4) | r7) & e4 << f4) & r7) - 1 | 0) >>> 12 & 16, f4 |= r7 = (e4 = e4 >>> r7 | 0) >>> 5 & 8, f4 |= r7 = (e4 = e4 >>> r7 | 0) >>> 2 & 4, t3 = b3[2504 + (r7 = (f4 = ((f4 |= r7 = (e4 = e4 >>> r7 | 0) >>> 1 & 2) | (r7 = (e4 = e4 >>> r7 | 0) >>> 1 & 1)) + (e4 >>> r7 | 0) | 0) << 3) >> 2], (0 | (e4 = b3[t3 + 8 >> 2])) != (0 | (r7 = r7 + 2496 | 0)) ? (b3[e4 + 12 >> 2] = r7, b3[r7 + 8 >> 2] = e4) : (n5 = Jr(f4) & n5, b3[614] = n5), r7 = t3 + 8 | 0, b3[t3 + 4 >> 2] = 3 | u3, a5 = (e4 = f4 << 3) - u3 | 0, b3[4 + (i5 = t3 + u3 | 0) >> 2] = 1 | a5, b3[e4 + t3 >> 2] = a5, s3 && (f4 = 2496 + ((e4 = s3 >>> 3 | 0) << 3) | 0, t3 = b3[619], (e4 = 1 << e4) & n5 ? e4 = b3[f4 + 8 >> 2] : (b3[614] = e4 | n5, e4 = f4), b3[f4 + 8 >> 2] = t3, b3[e4 + 12 >> 2] = t3, b3[t3 + 12 >> 2] = f4, b3[t3 + 8 >> 2] = e4), b3[619] = i5, b3[616] = a5;
  164. break r;
  165. }
  166. if (!(o4 = b3[615]))
  167. break c;
  168. for (f4 = r7 = (e4 = (o4 & 0 - o4) - 1 | 0) >>> 12 & 16, f4 |= r7 = (e4 = e4 >>> r7 | 0) >>> 5 & 8, f4 |= r7 = (e4 = e4 >>> r7 | 0) >>> 2 & 4, e4 = b3[2760 + (((f4 |= r7 = (e4 = e4 >>> r7 | 0) >>> 1 & 2) | (r7 = (e4 = e4 >>> r7 | 0) >>> 1 & 1)) + (e4 >>> r7 | 0) << 2) >> 2], i5 = (-8 & b3[e4 + 4 >> 2]) - u3 | 0, f4 = e4; (r7 = b3[f4 + 16 >> 2]) || (r7 = b3[f4 + 20 >> 2]); )
  169. i5 = (a5 = (f4 = (-8 & b3[r7 + 4 >> 2]) - u3 | 0) >>> 0 < i5 >>> 0) ? f4 : i5, e4 = a5 ? r7 : e4, f4 = r7;
  170. if ((c3 = e4 + u3 | 0) >>> 0 <= e4 >>> 0)
  171. break u;
  172. if (A3 = b3[e4 + 24 >> 2], (0 | (a5 = b3[e4 + 12 >> 2])) != (0 | e4)) {
  173. r7 = b3[e4 + 8 >> 2], b3[r7 + 12 >> 2] = a5, b3[a5 + 8 >> 2] = r7;
  174. break e;
  175. }
  176. if (!(r7 = b3[(f4 = e4 + 20 | 0) >> 2])) {
  177. if (!(r7 = b3[e4 + 16 >> 2]))
  178. break k;
  179. f4 = e4 + 16 | 0;
  180. }
  181. for (; t3 = f4, a5 = r7, (r7 = b3[(f4 = r7 + 20 | 0) >> 2]) || (f4 = a5 + 16 | 0, r7 = b3[a5 + 16 >> 2]); )
  182. ;
  183. b3[t3 >> 2] = 0;
  184. break e;
  185. }
  186. if (u3 = -1, !(r7 >>> 0 > 4294967231) && (u3 = -8 & (r7 = r7 + 11 | 0), c3 = b3[615])) {
  187. i5 = 0 - u3 | 0, n5 = 0, u3 >>> 0 < 256 || (n5 = 31, u3 >>> 0 > 16777215 || (r7 = r7 >>> 8 | 0, r7 <<= t3 = r7 + 1048320 >>> 16 & 8, n5 = 28 + ((r7 = ((r7 <<= f4 = r7 + 520192 >>> 16 & 4) << (e4 = r7 + 245760 >>> 16 & 2) >>> 15 | 0) - (e4 | f4 | t3) | 0) << 1 | u3 >>> r7 + 21 & 1) | 0));
  188. s: {
  189. A: {
  190. if (f4 = b3[2760 + (n5 << 2) >> 2])
  191. for (r7 = 0, e4 = u3 << ((0 | n5) == 31 ? 0 : 25 - (n5 >>> 1 | 0) | 0); ; ) {
  192. if (!((t3 = (-8 & b3[f4 + 4 >> 2]) - u3 | 0) >>> 0 >= i5 >>> 0 || (a5 = f4, i5 = t3))) {
  193. i5 = 0, r7 = f4;
  194. break A;
  195. }
  196. if (t3 = b3[f4 + 20 >> 2], f4 = b3[16 + ((e4 >>> 29 & 4) + f4 | 0) >> 2], r7 = t3 ? (0 | t3) == (0 | f4) ? r7 : t3 : r7, e4 <<= 1, !f4)
  197. break;
  198. }
  199. else
  200. r7 = 0;
  201. if (!(r7 | a5)) {
  202. if (a5 = 0, !(r7 = (0 - (r7 = 2 << n5) | r7) & c3))
  203. break c;
  204. f4 = r7 = (e4 = (r7 & 0 - r7) - 1 | 0) >>> 12 & 16, f4 |= r7 = (e4 = e4 >>> r7 | 0) >>> 5 & 8, f4 |= r7 = (e4 = e4 >>> r7 | 0) >>> 2 & 4, r7 = b3[2760 + (((f4 |= r7 = (e4 = e4 >>> r7 | 0) >>> 1 & 2) | (r7 = (e4 = e4 >>> r7 | 0) >>> 1 & 1)) + (e4 >>> r7 | 0) << 2) >> 2];
  205. }
  206. if (!r7)
  207. break s;
  208. }
  209. for (; i5 = (f4 = (e4 = (-8 & b3[r7 + 4 >> 2]) - u3 | 0) >>> 0 < i5 >>> 0) ? e4 : i5, a5 = f4 ? r7 : a5, r7 = (e4 = b3[r7 + 16 >> 2]) || b3[r7 + 20 >> 2]; )
  210. ;
  211. }
  212. if (!(!a5 | b3[616] - u3 >>> 0 <= i5 >>> 0)) {
  213. if ((o4 = a5 + u3 | 0) >>> 0 <= a5 >>> 0)
  214. break u;
  215. if (n5 = b3[a5 + 24 >> 2], (0 | a5) != (0 | (e4 = b3[a5 + 12 >> 2]))) {
  216. r7 = b3[a5 + 8 >> 2], b3[r7 + 12 >> 2] = e4, b3[e4 + 8 >> 2] = r7;
  217. break f;
  218. }
  219. if (!(r7 = b3[(f4 = a5 + 20 | 0) >> 2])) {
  220. if (!(r7 = b3[a5 + 16 >> 2]))
  221. break b;
  222. f4 = a5 + 16 | 0;
  223. }
  224. for (; t3 = f4, e4 = r7, (r7 = b3[(f4 = r7 + 20 | 0) >> 2]) || (f4 = e4 + 16 | 0, r7 = b3[e4 + 16 >> 2]); )
  225. ;
  226. b3[t3 >> 2] = 0;
  227. break f;
  228. }
  229. }
  230. }
  231. if ((f4 = b3[616]) >>> 0 >= u3 >>> 0) {
  232. i5 = b3[619], (e4 = f4 - u3 | 0) >>> 0 >= 16 ? (b3[616] = e4, r7 = i5 + u3 | 0, b3[619] = r7, b3[r7 + 4 >> 2] = 1 | e4, b3[f4 + i5 >> 2] = e4, b3[i5 + 4 >> 2] = 3 | u3) : (b3[619] = 0, b3[616] = 0, b3[i5 + 4 >> 2] = 3 | f4, b3[4 + (r7 = f4 + i5 | 0) >> 2] = 1 | b3[r7 + 4 >> 2]), r7 = i5 + 8 | 0;
  233. break r;
  234. }
  235. if ((o4 = b3[617]) >>> 0 > u3 >>> 0) {
  236. e4 = o4 - u3 | 0, b3[617] = e4, r7 = (f4 = b3[620]) + u3 | 0, b3[620] = r7, b3[r7 + 4 >> 2] = 1 | e4, b3[f4 + 4 >> 2] = 3 | u3, r7 = f4 + 8 | 0;
  237. break r;
  238. }
  239. if (r7 = 0, e4 = c3 = u3 + 47 | 0, b3[732] ? f4 = b3[734] : (b3[735] = -1, b3[736] = -1, b3[733] = 4096, b3[734] = 4096, b3[732] = l4 + 12 & -16 ^ 1431655768, b3[737] = 0, b3[725] = 0, f4 = 4096), (f4 = (t3 = e4 + f4 | 0) & (a5 = 0 - f4 | 0)) >>> 0 <= u3 >>> 0)
  240. break r;
  241. if ((i5 = b3[724]) && i5 >>> 0 < (n5 = (e4 = b3[722]) + f4 | 0) >>> 0 | e4 >>> 0 >= n5 >>> 0)
  242. break r;
  243. if (4 & k3[2900])
  244. break n;
  245. c: {
  246. s: {
  247. if (i5 = b3[620])
  248. for (r7 = 2904; ; ) {
  249. if (i5 >>> 0 < (e4 = b3[r7 >> 2]) + b3[r7 + 4 >> 2] >>> 0 && e4 >>> 0 <= i5 >>> 0)
  250. break s;
  251. if (!(r7 = b3[r7 + 8 >> 2]))
  252. break;
  253. }
  254. if ((0 | (e4 = Qr(0))) == -1)
  255. break t;
  256. if (n5 = f4, (r7 = (i5 = b3[733]) - 1 | 0) & e4 && (n5 = (f4 - e4 | 0) + (r7 + e4 & 0 - i5) | 0), n5 >>> 0 <= u3 >>> 0 | n5 >>> 0 > 2147483646)
  257. break t;
  258. if ((i5 = b3[724]) && i5 >>> 0 < (a5 = (r7 = b3[722]) + n5 | 0) >>> 0 | r7 >>> 0 >= a5 >>> 0)
  259. break t;
  260. if ((0 | e4) != (0 | (r7 = Qr(n5))))
  261. break c;
  262. break a;
  263. }
  264. if ((n5 = a5 & t3 - o4) >>> 0 > 2147483646)
  265. break t;
  266. if ((0 | (e4 = Qr(n5))) == (b3[r7 >> 2] + b3[r7 + 4 >> 2] | 0))
  267. break o;
  268. r7 = e4;
  269. }
  270. if (!((0 | r7) == -1 | u3 + 48 >>> 0 <= n5 >>> 0)) {
  271. if ((e4 = (e4 = b3[734]) + (c3 - n5 | 0) & 0 - e4) >>> 0 > 2147483646) {
  272. e4 = r7;
  273. break a;
  274. }
  275. if ((0 | Qr(e4)) != -1) {
  276. n5 = e4 + n5 | 0, e4 = r7;
  277. break a;
  278. }
  279. Qr(0 - n5 | 0);
  280. break t;
  281. }
  282. if (e4 = r7, (0 | r7) != -1)
  283. break a;
  284. break t;
  285. }
  286. E2();
  287. }
  288. a5 = 0;
  289. break e;
  290. }
  291. e4 = 0;
  292. break f;
  293. }
  294. if ((0 | e4) != -1)
  295. break a;
  296. }
  297. b3[725] = 4 | b3[725];
  298. }
  299. if (f4 >>> 0 > 2147483646)
  300. break i;
  301. if ((0 | (e4 = Qr(f4))) == -1 | (0 | (r7 = Qr(0))) == -1 | r7 >>> 0 <= e4 >>> 0)
  302. break i;
  303. if ((n5 = r7 - e4 | 0) >>> 0 <= u3 + 40 >>> 0)
  304. break i;
  305. }
  306. r7 = b3[722] + n5 | 0, b3[722] = r7, r7 >>> 0 > v2[723] && (b3[723] = r7);
  307. a: {
  308. n: {
  309. t: {
  310. if (t3 = b3[620]) {
  311. for (r7 = 2904; ; ) {
  312. if (((i5 = b3[r7 >> 2]) + (f4 = b3[r7 + 4 >> 2]) | 0) == (0 | e4))
  313. break t;
  314. if (!(r7 = b3[r7 + 8 >> 2]))
  315. break;
  316. }
  317. break n;
  318. }
  319. for ((r7 = b3[618]) >>> 0 <= e4 >>> 0 && r7 || (b3[618] = e4), r7 = 0, b3[727] = n5, b3[726] = e4, b3[622] = -1, b3[623] = b3[732], b3[729] = 0; f4 = 2496 + (i5 = r7 << 3) | 0, b3[i5 + 2504 >> 2] = f4, b3[i5 + 2508 >> 2] = f4, (0 | (r7 = r7 + 1 | 0)) != 32; )
  320. ;
  321. f4 = (i5 = n5 - 40 | 0) - (r7 = e4 + 8 & 7 ? -8 - e4 & 7 : 0) | 0, b3[617] = f4, r7 = r7 + e4 | 0, b3[620] = r7, b3[r7 + 4 >> 2] = 1 | f4, b3[4 + (e4 + i5 | 0) >> 2] = 40, b3[621] = b3[736];
  322. break a;
  323. }
  324. if (!(8 & k3[r7 + 12 | 0] | i5 >>> 0 > t3 >>> 0 | e4 >>> 0 <= t3 >>> 0)) {
  325. b3[r7 + 4 >> 2] = f4 + n5, f4 = (r7 = t3 + 8 & 7 ? -8 - t3 & 7 : 0) + t3 | 0, b3[620] = f4, r7 = (e4 = b3[617] + n5 | 0) - r7 | 0, b3[617] = r7, b3[f4 + 4 >> 2] = 1 | r7, b3[4 + (e4 + t3 | 0) >> 2] = 40, b3[621] = b3[736];
  326. break a;
  327. }
  328. }
  329. v2[618] > e4 >>> 0 && (b3[618] = e4), f4 = e4 + n5 | 0, r7 = 2904;
  330. n: {
  331. t: {
  332. o: {
  333. b: {
  334. k: {
  335. u: {
  336. for (; ; ) {
  337. if ((0 | f4) != b3[r7 >> 2]) {
  338. if (r7 = b3[r7 + 8 >> 2])
  339. continue;
  340. break u;
  341. }
  342. break;
  343. }
  344. if (!(8 & k3[r7 + 12 | 0]))
  345. break k;
  346. }
  347. for (r7 = 2904; ; ) {
  348. if ((f4 = b3[r7 >> 2]) >>> 0 <= t3 >>> 0 && (a5 = f4 + b3[r7 + 4 >> 2] | 0) >>> 0 > t3 >>> 0)
  349. break b;
  350. r7 = b3[r7 + 8 >> 2];
  351. }
  352. }
  353. if (b3[r7 >> 2] = e4, b3[r7 + 4 >> 2] = b3[r7 + 4 >> 2] + n5, b3[4 + (c3 = (e4 + 8 & 7 ? -8 - e4 & 7 : 0) + e4 | 0) >> 2] = 3 | u3, f4 = (n5 = f4 + (f4 + 8 & 7 ? -8 - f4 & 7 : 0) | 0) - (o4 = u3 + c3 | 0) | 0, (0 | t3) == (0 | n5)) {
  354. b3[620] = o4, r7 = b3[617] + f4 | 0, b3[617] = r7, b3[o4 + 4 >> 2] = 1 | r7;
  355. break t;
  356. }
  357. if (b3[619] == (0 | n5)) {
  358. b3[619] = o4, r7 = b3[616] + f4 | 0, b3[616] = r7, b3[o4 + 4 >> 2] = 1 | r7, b3[r7 + o4 >> 2] = r7;
  359. break t;
  360. }
  361. if ((3 & (r7 = b3[n5 + 4 >> 2])) == 1) {
  362. t3 = -8 & r7;
  363. k:
  364. if (r7 >>> 0 <= 255) {
  365. if (i5 = b3[n5 + 8 >> 2], r7 = r7 >>> 3 | 0, (0 | (e4 = b3[n5 + 12 >> 2])) == (0 | i5)) {
  366. d3 = 2456, h3 = b3[614] & Jr(r7), b3[d3 >> 2] = h3;
  367. break k;
  368. }
  369. b3[i5 + 12 >> 2] = e4, b3[e4 + 8 >> 2] = i5;
  370. } else {
  371. if (u3 = b3[n5 + 24 >> 2], (0 | n5) == (0 | (e4 = b3[n5 + 12 >> 2])))
  372. if ((i5 = b3[(r7 = n5 + 20 | 0) >> 2]) || (i5 = b3[(r7 = n5 + 16 | 0) >> 2])) {
  373. for (; a5 = r7, (i5 = b3[(r7 = (e4 = i5) + 20 | 0) >> 2]) || (r7 = e4 + 16 | 0, i5 = b3[e4 + 16 >> 2]); )
  374. ;
  375. b3[a5 >> 2] = 0;
  376. } else
  377. e4 = 0;
  378. else
  379. r7 = b3[n5 + 8 >> 2], b3[r7 + 12 >> 2] = e4, b3[e4 + 8 >> 2] = r7;
  380. if (u3) {
  381. i5 = b3[n5 + 28 >> 2];
  382. u: {
  383. if (b3[(r7 = 2760 + (i5 << 2) | 0) >> 2] == (0 | n5)) {
  384. if (b3[r7 >> 2] = e4, e4)
  385. break u;
  386. d3 = 2460, h3 = b3[615] & Jr(i5), b3[d3 >> 2] = h3;
  387. break k;
  388. }
  389. if (b3[u3 + (b3[u3 + 16 >> 2] == (0 | n5) ? 16 : 20) >> 2] = e4, !e4)
  390. break k;
  391. }
  392. b3[e4 + 24 >> 2] = u3, (r7 = b3[n5 + 16 >> 2]) && (b3[e4 + 16 >> 2] = r7, b3[r7 + 24 >> 2] = e4), (r7 = b3[n5 + 20 >> 2]) && (b3[e4 + 20 >> 2] = r7, b3[r7 + 24 >> 2] = e4);
  393. }
  394. }
  395. n5 = t3 + n5 | 0, f4 = f4 + t3 | 0;
  396. }
  397. if (b3[n5 + 4 >> 2] = -2 & b3[n5 + 4 >> 2], b3[o4 + 4 >> 2] = 1 | f4, b3[f4 + o4 >> 2] = f4, f4 >>> 0 <= 255) {
  398. e4 = 2496 + ((r7 = f4 >>> 3 | 0) << 3) | 0, (f4 = b3[614]) & (r7 = 1 << r7) ? r7 = b3[e4 + 8 >> 2] : (b3[614] = r7 | f4, r7 = e4), b3[e4 + 8 >> 2] = o4, b3[r7 + 12 >> 2] = o4, b3[o4 + 12 >> 2] = e4, b3[o4 + 8 >> 2] = r7;
  399. break t;
  400. }
  401. if (r7 = 31, f4 >>> 0 <= 16777215 && (r7 = f4 >>> 8 | 0, r7 <<= a5 = r7 + 1048320 >>> 16 & 8, r7 = 28 + ((r7 = ((r7 <<= i5 = r7 + 520192 >>> 16 & 4) << (e4 = r7 + 245760 >>> 16 & 2) >>> 15 | 0) - (e4 | i5 | a5) | 0) << 1 | f4 >>> r7 + 21 & 1) | 0), b3[o4 + 28 >> 2] = r7, b3[o4 + 16 >> 2] = 0, b3[o4 + 20 >> 2] = 0, a5 = 2760 + (r7 << 2) | 0, (i5 = b3[615]) & (e4 = 1 << r7)) {
  402. for (r7 = f4 << ((0 | r7) == 31 ? 0 : 25 - (r7 >>> 1 | 0) | 0), e4 = b3[a5 >> 2]; ; ) {
  403. if (i5 = e4, (-8 & b3[e4 + 4 >> 2]) == (0 | f4))
  404. break o;
  405. if (e4 = r7 >>> 29 | 0, r7 <<= 1, !(e4 = b3[16 + (a5 = i5 + (4 & e4) | 0) >> 2]))
  406. break;
  407. }
  408. b3[a5 + 16 >> 2] = o4, b3[o4 + 24 >> 2] = i5;
  409. } else
  410. b3[615] = e4 | i5, b3[a5 >> 2] = o4, b3[o4 + 24 >> 2] = a5;
  411. b3[o4 + 12 >> 2] = o4, b3[o4 + 8 >> 2] = o4;
  412. break t;
  413. }
  414. for (f4 = (i5 = n5 - 40 | 0) - (r7 = e4 + 8 & 7 ? -8 - e4 & 7 : 0) | 0, b3[617] = f4, r7 = r7 + e4 | 0, b3[620] = r7, b3[r7 + 4 >> 2] = 1 | f4, b3[4 + (e4 + i5 | 0) >> 2] = 40, b3[621] = b3[736], b3[(f4 = (r7 = (a5 + (a5 - 39 & 7 ? 39 - a5 & 7 : 0) | 0) - 47 | 0) >>> 0 < t3 + 16 >>> 0 ? t3 : r7) + 4 >> 2] = 27, r7 = b3[729], b3[f4 + 16 >> 2] = b3[728], b3[f4 + 20 >> 2] = r7, r7 = b3[727], b3[f4 + 8 >> 2] = b3[726], b3[f4 + 12 >> 2] = r7, b3[728] = f4 + 8, b3[727] = n5, b3[726] = e4, b3[729] = 0, r7 = f4 + 24 | 0; b3[r7 + 4 >> 2] = 7, e4 = r7 + 8 | 0, r7 = r7 + 4 | 0, e4 >>> 0 < a5 >>> 0; )
  415. ;
  416. if ((0 | f4) == (0 | t3))
  417. break a;
  418. if (b3[f4 + 4 >> 2] = -2 & b3[f4 + 4 >> 2], a5 = f4 - t3 | 0, b3[t3 + 4 >> 2] = 1 | a5, b3[f4 >> 2] = a5, a5 >>> 0 <= 255) {
  419. e4 = 2496 + ((r7 = a5 >>> 3 | 0) << 3) | 0, (f4 = b3[614]) & (r7 = 1 << r7) ? r7 = b3[e4 + 8 >> 2] : (b3[614] = r7 | f4, r7 = e4), b3[e4 + 8 >> 2] = t3, b3[r7 + 12 >> 2] = t3, b3[t3 + 12 >> 2] = e4, b3[t3 + 8 >> 2] = r7;
  420. break a;
  421. }
  422. if (r7 = 31, b3[t3 + 16 >> 2] = 0, b3[t3 + 20 >> 2] = 0, a5 >>> 0 <= 16777215 && (r7 = a5 >>> 8 | 0, r7 <<= i5 = r7 + 1048320 >>> 16 & 8, r7 = 28 + ((r7 = ((r7 <<= f4 = r7 + 520192 >>> 16 & 4) << (e4 = r7 + 245760 >>> 16 & 2) >>> 15 | 0) - (e4 | f4 | i5) | 0) << 1 | a5 >>> r7 + 21 & 1) | 0), b3[t3 + 28 >> 2] = r7, i5 = 2760 + (r7 << 2) | 0, (f4 = b3[615]) & (e4 = 1 << r7)) {
  423. for (r7 = a5 << ((0 | r7) == 31 ? 0 : 25 - (r7 >>> 1 | 0) | 0), e4 = b3[i5 >> 2]; ; ) {
  424. if (f4 = e4, (0 | a5) == (-8 & b3[e4 + 4 >> 2]))
  425. break n;
  426. if (e4 = r7 >>> 29 | 0, r7 <<= 1, !(e4 = b3[16 + (i5 = f4 + (4 & e4) | 0) >> 2]))
  427. break;
  428. }
  429. b3[i5 + 16 >> 2] = t3, b3[t3 + 24 >> 2] = f4;
  430. } else
  431. b3[615] = e4 | f4, b3[i5 >> 2] = t3, b3[t3 + 24 >> 2] = i5;
  432. b3[t3 + 12 >> 2] = t3, b3[t3 + 8 >> 2] = t3;
  433. break a;
  434. }
  435. r7 = b3[i5 + 8 >> 2], b3[r7 + 12 >> 2] = o4, b3[i5 + 8 >> 2] = o4, b3[o4 + 24 >> 2] = 0, b3[o4 + 12 >> 2] = i5, b3[o4 + 8 >> 2] = r7;
  436. }
  437. r7 = c3 + 8 | 0;
  438. break r;
  439. }
  440. r7 = b3[f4 + 8 >> 2], b3[r7 + 12 >> 2] = t3, b3[f4 + 8 >> 2] = t3, b3[t3 + 24 >> 2] = 0, b3[t3 + 12 >> 2] = f4, b3[t3 + 8 >> 2] = r7;
  441. }
  442. if (!((r7 = b3[617]) >>> 0 <= u3 >>> 0)) {
  443. e4 = r7 - u3 | 0, b3[617] = e4, r7 = (f4 = b3[620]) + u3 | 0, b3[620] = r7, b3[r7 + 4 >> 2] = 1 | e4, b3[f4 + 4 >> 2] = 3 | u3, r7 = f4 + 8 | 0;
  444. break r;
  445. }
  446. }
  447. b3[613] = 48, r7 = 0;
  448. break r;
  449. }
  450. f:
  451. if (n5) {
  452. f4 = b3[a5 + 28 >> 2];
  453. i: {
  454. if (b3[(r7 = 2760 + (f4 << 2) | 0) >> 2] == (0 | a5)) {
  455. if (b3[r7 >> 2] = e4, e4)
  456. break i;
  457. c3 = Jr(f4) & c3, b3[615] = c3;
  458. break f;
  459. }
  460. if (b3[n5 + (b3[n5 + 16 >> 2] == (0 | a5) ? 16 : 20) >> 2] = e4, !e4)
  461. break f;
  462. }
  463. b3[e4 + 24 >> 2] = n5, (r7 = b3[a5 + 16 >> 2]) && (b3[e4 + 16 >> 2] = r7, b3[r7 + 24 >> 2] = e4), (r7 = b3[a5 + 20 >> 2]) && (b3[e4 + 20 >> 2] = r7, b3[r7 + 24 >> 2] = e4);
  464. }
  465. f:
  466. if (i5 >>> 0 <= 15)
  467. r7 = i5 + u3 | 0, b3[a5 + 4 >> 2] = 3 | r7, b3[4 + (r7 = r7 + a5 | 0) >> 2] = 1 | b3[r7 + 4 >> 2];
  468. else if (b3[a5 + 4 >> 2] = 3 | u3, b3[o4 + 4 >> 2] = 1 | i5, b3[i5 + o4 >> 2] = i5, i5 >>> 0 <= 255)
  469. e4 = 2496 + ((r7 = i5 >>> 3 | 0) << 3) | 0, (f4 = b3[614]) & (r7 = 1 << r7) ? r7 = b3[e4 + 8 >> 2] : (b3[614] = r7 | f4, r7 = e4), b3[e4 + 8 >> 2] = o4, b3[r7 + 12 >> 2] = o4, b3[o4 + 12 >> 2] = e4, b3[o4 + 8 >> 2] = r7;
  470. else {
  471. r7 = 31, i5 >>> 0 <= 16777215 && (r7 = i5 >>> 8 | 0, r7 <<= t3 = r7 + 1048320 >>> 16 & 8, r7 = 28 + ((r7 = ((r7 <<= f4 = r7 + 520192 >>> 16 & 4) << (e4 = r7 + 245760 >>> 16 & 2) >>> 15 | 0) - (e4 | f4 | t3) | 0) << 1 | i5 >>> r7 + 21 & 1) | 0), b3[o4 + 28 >> 2] = r7, b3[o4 + 16 >> 2] = 0, b3[o4 + 20 >> 2] = 0, f4 = 2760 + (r7 << 2) | 0;
  472. i: {
  473. if ((e4 = 1 << r7) & c3) {
  474. for (r7 = i5 << ((0 | r7) == 31 ? 0 : 25 - (r7 >>> 1 | 0) | 0), u3 = b3[f4 >> 2]; ; ) {
  475. if ((-8 & b3[(e4 = u3) + 4 >> 2]) == (0 | i5))
  476. break i;
  477. if (f4 = r7 >>> 29 | 0, r7 <<= 1, !(u3 = b3[16 + (f4 = e4 + (4 & f4) | 0) >> 2]))
  478. break;
  479. }
  480. b3[f4 + 16 >> 2] = o4, b3[o4 + 24 >> 2] = e4;
  481. } else
  482. b3[615] = e4 | c3, b3[f4 >> 2] = o4, b3[o4 + 24 >> 2] = f4;
  483. b3[o4 + 12 >> 2] = o4, b3[o4 + 8 >> 2] = o4;
  484. break f;
  485. }
  486. r7 = b3[e4 + 8 >> 2], b3[r7 + 12 >> 2] = o4, b3[e4 + 8 >> 2] = o4, b3[o4 + 24 >> 2] = 0, b3[o4 + 12 >> 2] = e4, b3[o4 + 8 >> 2] = r7;
  487. }
  488. r7 = a5 + 8 | 0;
  489. break r;
  490. }
  491. e:
  492. if (A3) {
  493. f4 = b3[e4 + 28 >> 2];
  494. f: {
  495. if (b3[(r7 = 2760 + (f4 << 2) | 0) >> 2] == (0 | e4)) {
  496. if (b3[r7 >> 2] = a5, a5)
  497. break f;
  498. d3 = 2460, h3 = Jr(f4) & o4, b3[d3 >> 2] = h3;
  499. break e;
  500. }
  501. if (b3[(b3[A3 + 16 >> 2] == (0 | e4) ? 16 : 20) + A3 >> 2] = a5, !a5)
  502. break e;
  503. }
  504. b3[a5 + 24 >> 2] = A3, (r7 = b3[e4 + 16 >> 2]) && (b3[a5 + 16 >> 2] = r7, b3[r7 + 24 >> 2] = a5), (r7 = b3[e4 + 20 >> 2]) && (b3[a5 + 20 >> 2] = r7, b3[r7 + 24 >> 2] = a5);
  505. }
  506. i5 >>> 0 <= 15 ? (r7 = i5 + u3 | 0, b3[e4 + 4 >> 2] = 3 | r7, b3[4 + (r7 = r7 + e4 | 0) >> 2] = 1 | b3[r7 + 4 >> 2]) : (b3[e4 + 4 >> 2] = 3 | u3, b3[c3 + 4 >> 2] = 1 | i5, b3[i5 + c3 >> 2] = i5, s3 && (f4 = 2496 + ((r7 = s3 >>> 3 | 0) << 3) | 0, a5 = b3[619], (r7 = 1 << r7) & n5 ? r7 = b3[f4 + 8 >> 2] : (b3[614] = r7 | n5, r7 = f4), b3[f4 + 8 >> 2] = a5, b3[r7 + 12 >> 2] = a5, b3[a5 + 12 >> 2] = f4, b3[a5 + 8 >> 2] = r7), b3[619] = c3, b3[616] = i5), r7 = e4 + 8 | 0;
  507. }
  508. return j2 = l4 + 16 | 0, 0 | r7;
  509. }
  510. function D2(r7, e4, f4, i5, a5, t3) {
  511. r7 |= 0, e4 |= 0, f4 |= 0, i5 |= 0, a5 |= 0, t3 |= 0;
  512. for (var u3 = 0, c3 = 0, s3 = 0, A3 = 0, l4 = 0, v3 = w2(0), h3 = 0, m3 = w2(0), y3 = w2(0), g3 = 0, _3 = 0, P3 = 0, x3 = 0, U3 = 0, j3 = 0, F3 = 0, D3 = 0; (s3 = b3[2032 + (u3 = c3 << 2) >> 2]) && (b3[s3 >> 2] = 0), (s3 = b3[2032 + (4 | u3) >> 2]) && (b3[s3 >> 2] = 0), (s3 = b3[2032 + (8 | u3) >> 2]) && (b3[s3 >> 2] = 0), (u3 = b3[2032 + (12 | u3) >> 2]) && (b3[u3 >> 2] = 0), (0 | (c3 = c3 + 4 | 0)) != 100; )
  513. ;
  514. if ((c3 = b3[608]) || (c3 = O2(16), b3[608] = c3), b3[c3 + 8 >> 2] = t3, b3[c3 + 4 >> 2] = 0, b3[c3 + 12 >> 2] = i5, b3[c3 >> 2] = a5, (c3 = b3[609]) || ((a5 = O2(1900)) ? (b3[a5 + 100 >> 2] = 12, b3[a5 + 96 >> 2] = 13, b3[a5 + 92 >> 2] = 14, b3[a5 + 88 >> 2] = 15, o3[a5 + 80 >> 1] = 0, b3[a5 + 52 >> 2] = 0, b3[a5 + 56 >> 2] = 100130, b3[a5 + 16 >> 2] = 0, b3[a5 + 20 >> 2] = 0, b3[a5 >> 2] = 0, b3[a5 + 1896 >> 2] = 0, b3[a5 + 1736 >> 2] = 8, b3[a5 + 1732 >> 2] = 11, b3[a5 + 1728 >> 2] = 6, b3[a5 + 1724 >> 2] = 5, b3[a5 + 1720 >> 2] = 4, b3[a5 + 1716 >> 2] = 3, b3[a5 + 104 >> 2] = 16, b3[a5 + 76 >> 2] = 17, b3[a5 + 12 >> 2] = 18, b3[a5 + 24 >> 2] = 0) : a5 = 0, b3[609] = a5, mr2(a5, 100107, 34), mr2(b3[609], 100100, 35), mr2(b3[609], 100102, 36), mr2(b3[609], 100105, 37), mr2(b3[609], 100103, 38), mr2(b3[609], 100104, 39), b3[b3[609] + 56 >> 2] = 100130, a5 = b3[609], d2[a5 + 16 >> 2] = 0, d2[a5 + 24 >> 2] = 1, d2[a5 + 20 >> 2] = 0, c3 = b3[609]), a5 = 0, t3 = b3[608], b3[c3 >> 2] && cr2(c3, 0), b3[c3 + 112 >> 2] = 0, b3[c3 >> 2] = 1, n4[c3 + 108 | 0] = 0, b3[c3 + 1896 >> 2] = t3, b3[c3 + 8 >> 2] = 0, (0 | f4) > 0)
  515. for (t3 = 0; ; ) {
  516. if (g3 = b3[(t3 << 2) + e4 >> 2], u3 = b3[609], b3[u3 >> 2] != 1 && cr2(u3, 1), b3[u3 >> 2] = 2, b3[u3 + 4 >> 2] = 0, b3[u3 + 112 >> 2] >= 1 && (n4[u3 + 108 | 0] = 1), c3 = 0, (0 | g3) > 0)
  517. for (; ; ) {
  518. l4 = _3 = (p2(a5 + c3 | 0, i5) << 2) + r7 | 0, s3 = b3[609], b3[s3 >> 2] != 2 && cr2(s3, 2);
  519. r: {
  520. e: {
  521. f: {
  522. if (k3[s3 + 108 | 0]) {
  523. if (u3 = Rr2(), b3[s3 + 8 >> 2] = u3, !u3)
  524. break f;
  525. if ((0 | (u3 = b3[s3 + 112 >> 2])) >= 1)
  526. for (P3 = 116 + (s3 + (u3 << 4) | 0) | 0, A3 = s3 + 116 | 0, u3 = b3[s3 + 4 >> 2]; ; ) {
  527. D3 = b3[A3 + 12 >> 2];
  528. i: {
  529. if (!u3) {
  530. if (!(u3 = br2(b3[s3 + 8 >> 2])))
  531. break f;
  532. if (tr2(u3, b3[u3 + 4 >> 2]))
  533. break i;
  534. break f;
  535. }
  536. if (!ir2(u3))
  537. break f;
  538. u3 = b3[u3 + 12 >> 2];
  539. }
  540. if (h3 = b3[u3 + 16 >> 2], b3[h3 + 12 >> 2] = D3, d2[h3 + 16 >> 2] = d2[A3 >> 2], v3 = d2[A3 + 4 >> 2], b3[h3 + 24 >> 2] = 0, d2[h3 + 20 >> 2] = v3, b3[u3 + 28 >> 2] = 1, b3[b3[u3 + 4 >> 2] + 28 >> 2] = -1, b3[s3 + 4 >> 2] = u3, !(P3 >>> 0 > (A3 = A3 + 16 | 0) >>> 0))
  541. break;
  542. }
  543. n4[s3 + 108 | 0] = 0, b3[s3 + 112 >> 2] = 0, b3[s3 + 4 >> 2] = 0;
  544. }
  545. A3 = (U3 = +(v3 = (x3 = +(v3 = d2[l4 + 4 >> 2])) < -1e37 ? w2(-9999999933815813e21) : v3)) > 1e37, h3 = (F3 = +(m3 = (j3 = +(m3 = d2[l4 >> 2])) < -1e37 ? w2(-9999999933815813e21) : m3)) > 1e37, ((u3 = +(y3 = d2[l4 + 8 >> 2]) < -1e37) | (l4 = +(y3 = u3 ? w2(-9999999933815813e21) : y3) > 1e37) | x3 < -1e37 | U3 > 1e37 || F3 > 1e37 || j3 < -1e37) && ((0 | (u3 = b3[s3 + 1732 >> 2])) == 11 ? be[b3[s3 + 12 >> 2]](100155) : be[0 | u3](100155, b3[s3 + 1896 >> 2])), v3 = A3 ? w2(9999999933815813e21) : v3, m3 = h3 ? w2(9999999933815813e21) : m3;
  546. i: {
  547. if (!b3[s3 + 8 >> 2]) {
  548. if ((0 | (A3 = b3[s3 + 112 >> 2])) <= 99) {
  549. d2[124 + (u3 = s3 + (A3 << 4) | 0) >> 2] = l4 ? w2(9999999933815813e21) : y3, d2[u3 + 120 >> 2] = v3, d2[u3 + 116 >> 2] = m3, b3[u3 + 128 >> 2] = _3, b3[s3 + 112 >> 2] = A3 + 1;
  550. break r;
  551. }
  552. if (u3 = Rr2(), b3[s3 + 8 >> 2] = u3, !u3)
  553. break i;
  554. if ((0 | (u3 = b3[s3 + 112 >> 2])) >= 1)
  555. for (h3 = 116 + (s3 + (u3 << 4) | 0) | 0, A3 = s3 + 116 | 0, u3 = b3[s3 + 4 >> 2]; ; ) {
  556. P3 = b3[A3 + 12 >> 2];
  557. a: {
  558. if (!u3) {
  559. if (!(u3 = br2(b3[s3 + 8 >> 2])))
  560. break i;
  561. if (tr2(u3, b3[u3 + 4 >> 2]))
  562. break a;
  563. break i;
  564. }
  565. if (!ir2(u3))
  566. break i;
  567. u3 = b3[u3 + 12 >> 2];
  568. }
  569. if (l4 = b3[u3 + 16 >> 2], b3[l4 + 12 >> 2] = P3, d2[l4 + 16 >> 2] = d2[A3 >> 2], y3 = d2[A3 + 4 >> 2], b3[l4 + 24 >> 2] = 0, d2[l4 + 20 >> 2] = y3, b3[u3 + 28 >> 2] = 1, b3[b3[u3 + 4 >> 2] + 28 >> 2] = -1, b3[s3 + 4 >> 2] = u3, !(h3 >>> 0 > (A3 = A3 + 16 | 0) >>> 0))
  570. break;
  571. }
  572. n4[s3 + 108 | 0] = 0, b3[s3 + 112 >> 2] = 0;
  573. }
  574. a: {
  575. n: {
  576. if (!(u3 = b3[s3 + 4 >> 2])) {
  577. if (!(u3 = br2(b3[s3 + 8 >> 2])))
  578. break a;
  579. if (tr2(u3, b3[u3 + 4 >> 2]))
  580. break n;
  581. break a;
  582. }
  583. if (!ir2(u3))
  584. break a;
  585. u3 = b3[u3 + 12 >> 2];
  586. }
  587. A3 = b3[u3 + 16 >> 2], d2[A3 + 16 >> 2] = m3, b3[A3 + 12 >> 2] = _3, b3[A3 + 24 >> 2] = 0, d2[A3 + 20 >> 2] = v3, b3[u3 + 28 >> 2] = 1, b3[b3[u3 + 4 >> 2] + 28 >> 2] = -1, b3[s3 + 4 >> 2] = u3;
  588. break r;
  589. }
  590. if ((0 | (u3 = b3[s3 + 1732 >> 2])) != 11)
  591. break e;
  592. be[b3[s3 + 12 >> 2]](100902);
  593. break r;
  594. }
  595. if ((0 | (u3 = b3[s3 + 1732 >> 2])) != 11)
  596. break e;
  597. be[b3[s3 + 12 >> 2]](100902);
  598. break r;
  599. }
  600. if ((0 | (u3 = b3[s3 + 1732 >> 2])) == 11) {
  601. be[b3[s3 + 12 >> 2]](100902);
  602. break r;
  603. }
  604. }
  605. be[0 | u3](100902, b3[s3 + 1896 >> 2]);
  606. }
  607. if ((0 | g3) == (0 | (c3 = c3 + 1 | 0)))
  608. break;
  609. }
  610. if (u3 = b3[609], b3[u3 >> 2] != 2 && cr2(u3, 2), b3[u3 >> 2] = 1, a5 = a5 + g3 | 0, (0 | (t3 = t3 + 1 | 0)) == (0 | f4))
  611. break;
  612. }
  613. f4 = b3[609], r7 = 0, e4 = O2(40), b3[e4 >> 2] = 0, a5 = Tr2(s3 = f4 + 1740 | 0, 1, e4, 4), t3 = 0 | R2();
  614. r: {
  615. e: {
  616. f: {
  617. i: {
  618. a: {
  619. n:
  620. for (; ; ) {
  621. t: {
  622. o: {
  623. b: {
  624. k: {
  625. u: {
  626. c: {
  627. s: {
  628. if (r7) {
  629. if ((0 | (r7 = b3[f4 + 1732 >> 2])) != 11) {
  630. if (e4 = b3[f4 + 1896 >> 2], b3[611] = 0, M2(0 | r7, 100902, 0 | e4), r7 = b3[611], b3[611] = 0, e4 = -1, !r7)
  631. break c;
  632. if (!(i5 = b3[612]))
  633. break c;
  634. if (e4 = Hr(b3[r7 >> 2], a5, t3))
  635. break s;
  636. break a;
  637. }
  638. if (r7 = b3[f4 + 12 >> 2], b3[611] = 0, S2(0 | r7, 100902), r7 = b3[611], b3[611] = 0, e4 = -1, !r7)
  639. break k;
  640. if (!(i5 = b3[612]))
  641. break k;
  642. if (e4 = Hr(b3[r7 >> 2], a5, t3))
  643. break u;
  644. break a;
  645. }
  646. if (b3[f4 >> 2] == 1)
  647. break t;
  648. if (b3[611] = 0, M2(19, 0 | f4, 1), r7 = b3[611], b3[611] = 0, e4 = -1, !r7)
  649. break o;
  650. if (!(i5 = b3[612]))
  651. break o;
  652. if (e4 = Hr(b3[r7 >> 2], a5, t3))
  653. break b;
  654. break a;
  655. }
  656. C2(0 | i5);
  657. }
  658. if (r7 = 0 | R2(), (0 | e4) == 1)
  659. continue;
  660. break r;
  661. }
  662. C2(0 | i5);
  663. }
  664. if (r7 = 0 | R2(), (0 | e4) == 1)
  665. continue;
  666. break r;
  667. }
  668. C2(0 | i5);
  669. }
  670. if (r7 = 0 | R2(), (0 | e4) == 1)
  671. continue;
  672. }
  673. b3[f4 >> 2] = 0;
  674. t: {
  675. o: {
  676. b: {
  677. if (!b3[f4 + 8 >> 2]) {
  678. if (!(k3[f4 + 80 | 0] | b3[f4 + 104 >> 2] != 16)) {
  679. if (b3[611] = 0, u3 = 0 | I2(20, 0 | f4), r7 = b3[611], b3[611] = 0, e4 = -1, r7 && (i5 = b3[612])) {
  680. if (!(e4 = Hr(b3[r7 >> 2], a5, t3)))
  681. break a;
  682. C2(0 | i5);
  683. }
  684. if (r7 = 0 | R2(), (0 | e4) == 1)
  685. continue;
  686. if (u3) {
  687. b3[f4 + 1896 >> 2] = 0;
  688. break r;
  689. }
  690. }
  691. if (b3[611] = 0, i5 = 0 | T2(21), r7 = b3[611], b3[611] = 0, e4 = -1, r7 && (c3 = b3[612])) {
  692. if (!(e4 = Hr(b3[r7 >> 2], a5, t3)))
  693. break i;
  694. C2(0 | c3);
  695. }
  696. if (r7 = 0 | R2(), (0 | e4) == 1)
  697. continue;
  698. if (b3[f4 + 8 >> 2] = i5, !i5)
  699. break b;
  700. if ((0 | (r7 = b3[f4 + 112 >> 2])) >= 1)
  701. for (A3 = 116 + (f4 + (r7 << 4) | 0) | 0, i5 = f4 + 116 | 0, e4 = b3[f4 + 4 >> 2]; ; ) {
  702. g3 = b3[i5 + 12 >> 2];
  703. k: {
  704. u: {
  705. c: {
  706. s: {
  707. A: {
  708. l: {
  709. if (!e4) {
  710. if (r7 = b3[f4 + 8 >> 2], b3[611] = 0, e4 = 0 | I2(22, 0 | r7), r7 = b3[611], b3[611] = 0, c3 = -1, !r7)
  711. break A;
  712. if (!(u3 = b3[612]))
  713. break A;
  714. if (c3 = Hr(b3[r7 >> 2], a5, t3))
  715. break l;
  716. break f;
  717. }
  718. if (b3[611] = 0, l4 = 0 | I2(23, 0 | e4), r7 = b3[611], b3[611] = 0, c3 = -1, !r7)
  719. break c;
  720. if (!(u3 = b3[612]))
  721. break c;
  722. if (c3 = Hr(b3[r7 >> 2], a5, t3))
  723. break s;
  724. break f;
  725. }
  726. C2(0 | u3);
  727. }
  728. if (r7 = 0 | R2(), (0 | c3) != 1)
  729. break u;
  730. continue n;
  731. }
  732. C2(0 | u3);
  733. }
  734. if (r7 = 0 | R2(), (0 | c3) == 1)
  735. continue n;
  736. if (!l4)
  737. break b;
  738. e4 = b3[e4 + 12 >> 2];
  739. break k;
  740. }
  741. if (!e4)
  742. break b;
  743. if (r7 = b3[e4 + 4 >> 2], b3[611] = 0, l4 = 0 | B2(24, 0 | e4, 0 | r7), r7 = b3[611], b3[611] = 0, c3 = -1, r7 && (u3 = b3[612])) {
  744. if (!(c3 = Hr(b3[r7 >> 2], a5, t3)))
  745. break f;
  746. C2(0 | u3);
  747. }
  748. if (r7 = 0 | R2(), (0 | c3) == 1)
  749. continue n;
  750. if (!l4)
  751. break b;
  752. }
  753. if (r7 = b3[e4 + 16 >> 2], b3[r7 + 12 >> 2] = g3, d2[r7 + 16 >> 2] = d2[i5 >> 2], v3 = d2[i5 + 4 >> 2], b3[r7 + 24 >> 2] = 0, d2[r7 + 20 >> 2] = v3, b3[e4 + 28 >> 2] = 1, b3[b3[e4 + 4 >> 2] + 28 >> 2] = -1, b3[f4 + 4 >> 2] = e4, !(A3 >>> 0 > (i5 = i5 + 16 | 0) >>> 0))
  754. break;
  755. }
  756. n4[f4 + 108 | 0] = 0, b3[f4 + 112 >> 2] = 0;
  757. }
  758. if (b3[611] = 0, K2(f4), r7 = b3[611], b3[611] = 0, e4 = -1, !r7)
  759. break t;
  760. if (!(i5 = b3[612]))
  761. break t;
  762. if (e4 = Hr(b3[r7 >> 2], a5, t3))
  763. break o;
  764. break a;
  765. }
  766. if (b3[611] = 0, M2(26, 0 | s3, 1), e4 = b3[611], b3[611] = 0, e4 && (r7 = b3[612])) {
  767. if (!Hr(b3[e4 >> 2], a5, t3))
  768. break e;
  769. C2(0 | r7);
  770. }
  771. r7 = 0 | R2();
  772. continue;
  773. }
  774. C2(0 | i5);
  775. }
  776. if (r7 = 0 | R2(), (0 | e4) != 1) {
  777. if (b3[611] = 0, u3 = 0 | I2(27, 0 | f4), r7 = b3[611], b3[611] = 0, e4 = -1, r7 && (i5 = b3[612])) {
  778. if (!(e4 = Hr(b3[r7 >> 2], a5, t3)))
  779. break a;
  780. C2(0 | i5);
  781. }
  782. if (r7 = 0 | R2(), (0 | e4) != 1) {
  783. t: {
  784. o: {
  785. b: {
  786. k: {
  787. u: {
  788. c: {
  789. s: {
  790. A: {
  791. l: {
  792. v: {
  793. d: {
  794. if (!u3) {
  795. if (b3[611] = 0, M2(26, 0 | s3, 1), e4 = b3[611], b3[611] = 0, !e4)
  796. break v;
  797. if (!(r7 = b3[612]))
  798. break v;
  799. if (Hr(b3[e4 >> 2], a5, t3))
  800. break d;
  801. break e;
  802. }
  803. if (e4 = b3[f4 + 8 >> 2], k3[f4 + 60 | 0])
  804. break c;
  805. if (k3[f4 + 81 | 0]) {
  806. if (b3[611] = 0, c3 = 0 | L2(28, 0 | e4, 1, 1), r7 = b3[611], b3[611] = 0, i5 = -1, !r7)
  807. break s;
  808. if (!(u3 = b3[612]))
  809. break s;
  810. if (i5 = Hr(b3[r7 >> 2], a5, t3))
  811. break l;
  812. break f;
  813. }
  814. if (b3[611] = 0, c3 = 0 | I2(29, 0 | e4), r7 = b3[611], b3[611] = 0, i5 = -1, !r7)
  815. break s;
  816. if (!(u3 = b3[612]))
  817. break s;
  818. if (i5 = Hr(b3[r7 >> 2], a5, t3))
  819. break A;
  820. break f;
  821. }
  822. C2(0 | r7);
  823. }
  824. r7 = 0 | R2();
  825. continue;
  826. }
  827. C2(0 | u3);
  828. break s;
  829. }
  830. C2(0 | u3);
  831. }
  832. if (r7 = 0 | R2(), (0 | i5) == 1)
  833. continue;
  834. s: {
  835. A: {
  836. l: {
  837. v: {
  838. d: {
  839. h: {
  840. p: {
  841. if (!c3) {
  842. if (b3[611] = 0, M2(26, 0 | s3, 1), e4 = b3[611], b3[611] = 0, !e4)
  843. break h;
  844. if (!(r7 = b3[612]))
  845. break h;
  846. if (Hr(b3[e4 >> 2], a5, t3))
  847. break p;
  848. break e;
  849. }
  850. if (!(b3[f4 + 88 >> 2] != 15 | b3[f4 + 100 >> 2] != 12 | b3[f4 + 96 >> 2] != 13 | b3[f4 + 92 >> 2] != 14 || b3[f4 + 1716 >> 2] != 3 | b3[f4 + 1728 >> 2] != 6 | b3[f4 + 1724 >> 2] != 5 || b3[f4 + 1720 >> 2] != 4))
  851. break s;
  852. if (k3[f4 + 81 | 0]) {
  853. if (b3[611] = 0, M2(30, 0 | f4, 0 | e4), r7 = b3[611], b3[611] = 0, i5 = -1, !r7)
  854. break v;
  855. if (!(c3 = b3[612]))
  856. break v;
  857. if (i5 = Hr(b3[r7 >> 2], a5, t3))
  858. break d;
  859. break i;
  860. }
  861. if (b3[611] = 0, M2(31, 0 | f4, 0 | e4), r7 = b3[611], b3[611] = 0, i5 = -1, !r7)
  862. break A;
  863. if (!(c3 = b3[612]))
  864. break A;
  865. if (i5 = Hr(b3[r7 >> 2], a5, t3))
  866. break l;
  867. break i;
  868. }
  869. C2(0 | r7);
  870. }
  871. r7 = 0 | R2();
  872. continue;
  873. }
  874. C2(0 | c3);
  875. }
  876. if (r7 = 0 | R2(), (0 | i5) == 1)
  877. continue;
  878. break s;
  879. }
  880. C2(0 | c3);
  881. }
  882. if (r7 = 0 | R2(), (0 | i5) == 1)
  883. continue;
  884. }
  885. if (b3[f4 + 104 >> 2] != 16) {
  886. if (b3[611] = 0, nr2(e4), r7 = b3[611], b3[611] = 0, i5 = -1, !r7)
  887. break k;
  888. if (!(c3 = b3[612]))
  889. break k;
  890. if (i5 = Hr(b3[r7 >> 2], a5, t3))
  891. break u;
  892. break i;
  893. }
  894. }
  895. if (b3[611] = 0, Pr2(e4), r7 = b3[611], b3[611] = 0, e4 = -1, !r7)
  896. break o;
  897. if (!(i5 = b3[612]))
  898. break o;
  899. if (e4 = Hr(b3[r7 >> 2], a5, t3))
  900. break b;
  901. break a;
  902. }
  903. C2(0 | c3);
  904. }
  905. if (r7 = 0 | R2(), (0 | i5) != 1)
  906. break t;
  907. continue;
  908. }
  909. C2(0 | i5);
  910. }
  911. if (r7 = 0 | R2(), (0 | e4) == 1)
  912. continue;
  913. b3[f4 + 8 >> 2] = 0, b3[f4 + 1896 >> 2] = 0;
  914. break r;
  915. }
  916. if (r7 = b3[f4 + 104 >> 2], b3[611] = 0, S2(0 | r7, 0 | e4), r7 = b3[611], b3[611] = 0, e4 = -1, r7 && (i5 = b3[612])) {
  917. if (!(e4 = Hr(b3[r7 >> 2], a5, t3)))
  918. break a;
  919. C2(0 | i5);
  920. }
  921. if (r7 = 0 | R2(), (0 | e4) != 1)
  922. break;
  923. }
  924. }
  925. }
  926. b3[f4 + 1896 >> 2] = 0, b3[f4 + 8 >> 2] = 0;
  927. break r;
  928. }
  929. Zr(r7, i5), E2();
  930. }
  931. Zr(r7, c3), E2();
  932. }
  933. Zr(r7, u3), E2();
  934. }
  935. Zr(e4, r7), E2();
  936. }
  937. return Y2(a5), b3[b3[608] + 4 >> 2];
  938. }
  939. function H2(r7, e4) {
  940. var f4 = w2(0), i5 = w2(0), a5 = 0, t3 = w2(0), o4 = w2(0), u3 = 0, c3 = 0, s3 = w2(0), A3 = 0, l4 = 0, v3 = 0, p3 = w2(0), m3 = w2(0), y3 = w2(0), C3 = 0, R3 = 0, M3 = 0, I3 = 0, S3 = 0, _3 = 0, P3 = 0, x3 = 0, L3 = 0, B3 = w2(0), T3 = 0, U3 = w2(0);
  941. j2 = u3 = j2 - 144 | 0, L3 = b3[b3[b3[e4 + 4 >> 2] + 8 >> 2] >> 2], P3 = b3[L3 >> 2], M3 = b3[P3 + 16 >> 2], S3 = b3[b3[P3 + 4 >> 2] + 16 >> 2], _3 = b3[e4 >> 2], I3 = b3[b3[_3 + 4 >> 2] + 16 >> 2], C3 = b3[_3 + 16 >> 2], pr2(I3, b3[r7 + 72 >> 2], C3) > w2(0) && (f4 = d2[I3 + 28 >> 2], i5 = d2[I3 + 32 >> 2], a5 = b3[r7 + 72 >> 2], t3 = d2[a5 + 28 >> 2], o4 = d2[a5 + 32 >> 2], s3 = d2[C3 + 28 >> 2], h2[u3 + 40 >> 3] = d2[C3 + 32 >> 2], h2[u3 + 32 >> 3] = s3, h2[u3 + 24 >> 3] = o4, h2[u3 + 16 >> 3] = t3, h2[u3 + 8 >> 3] = i5, h2[u3 >> 3] = f4, Gr(1098, u3));
  942. r: {
  943. e: {
  944. f:
  945. if ((0 | C3) != (0 | M3) && !((m3 = (f4 = d2[C3 + 32 >> 2]) <= (i5 = d2[I3 + 32 >> 2]) ? f4 : i5) > ((i5 = d2[M3 + 32 >> 2]) >= (t3 = d2[S3 + 32 >> 2]) ? i5 : t3))) {
  946. i: {
  947. if (!(!(f4 <= i5) | (t3 = d2[C3 + 28 >> 2]) != (o4 = d2[M3 + 28 >> 2])) || t3 < o4) {
  948. if (!(pr2(S3, C3, M3) > w2(0)))
  949. break i;
  950. break f;
  951. }
  952. if (pr2(I3, M3, C3) < w2(0))
  953. break f;
  954. }
  955. v3 = S3, a5 = M3, l4 = C3, (f4 = d2[(A3 = I3) + 28 >> 2]) < (i5 = d2[C3 + 28 >> 2]) | (d2[A3 + 32 >> 2] <= d2[l4 + 32 >> 2] ? f4 == i5 : 0) ? (c3 = l4, l4 = A3) : c3 = A3, (f4 = d2[a5 + 28 >> 2]) > (i5 = d2[v3 + 28 >> 2]) | (d2[v3 + 32 >> 2] <= d2[a5 + 32 >> 2] ? f4 == i5 : 0) ? (f4 = i5, A3 = a5, a5 = v3) : A3 = v3, f4 > (i5 = d2[l4 + 28 >> 2]) | (d2[l4 + 32 >> 2] <= d2[a5 + 32 >> 2] ? f4 == i5 : 0) ? (i5 = f4, v3 = A3, R3 = a5, A3 = c3, a5 = l4) : (v3 = c3, R3 = l4), c3 = u3;
  956. i:
  957. if ((o4 = d2[A3 + 28 >> 2]) > i5 | (d2[R3 + 32 >> 2] <= d2[A3 + 32 >> 2] ? i5 == o4 : 0))
  958. if (p3 = d2[v3 + 28 >> 2], !(d2[A3 + 32 >> 2] <= d2[v3 + 32 >> 2]) | o4 != p3 && !(p3 > o4))
  959. if (i5 = pr2(a5, R3, A3), f4 = pr2(a5, v3, A3), l4 = w2(i5 - f4) < w2(0), (t3 = w2(g2(l4 ? w2(-i5) : i5, w2(0)))) <= (i5 = w2(g2(l4 ? f4 : w2(-f4), w2(0))))) {
  960. if (o4 = d2[R3 + 28 >> 2], s3 = d2[v3 + 28 >> 2], f4 = w2(w2(o4 + s3) * w2(0.5)), i5 == w2(0))
  961. break i;
  962. f4 = w2(o4 + w2(w2(t3 / w2(t3 + i5)) * w2(s3 - o4)));
  963. } else
  964. f4 = d2[v3 + 28 >> 2], f4 = w2(f4 + w2(w2(i5 / w2(t3 + i5)) * w2(d2[R3 + 28 >> 2] - f4)));
  965. else {
  966. if (f4 = w2(0), s3 = w2(o4 - i5), t3 = w2(i5 - d2[a5 + 28 >> 2]), (m3 = w2(s3 + t3)) > w2(0) && (f4 = d2[((l4 = t3 < s3) ? a5 : A3) + 32 >> 2], f4 = w2(w2(d2[R3 + 32 >> 2] - f4) + w2(w2((l4 ? t3 : s3) / m3) * w2(f4 - d2[(l4 ? A3 : a5) + 32 >> 2])))), B3 = w2(-f4), m3 = f4, p3 = w2(p3 - o4), (t3 = w2(s3 + p3)) > w2(0) && (y3 = d2[((l4 = s3 < p3) ? R3 : v3) + 32 >> 2], y3 = w2(w2(d2[A3 + 32 >> 2] - y3) + w2(w2((l4 ? s3 : p3) / t3) * w2(y3 - d2[(l4 ? v3 : R3) + 32 >> 2])))), l4 = w2(f4 + y3) < w2(0), (p3 = w2(g2(l4 ? B3 : m3, w2(0)))) <= (t3 = w2(g2(l4 ? w2(-y3) : y3, w2(0))))) {
  967. if (f4 = w2(w2(i5 + o4) * w2(0.5)), t3 == w2(0))
  968. break i;
  969. f4 = w2(i5 + w2(s3 * w2(p3 / w2(p3 + t3))));
  970. break i;
  971. }
  972. f4 = w2(o4 + w2(w2(i5 - o4) * w2(t3 / w2(p3 + t3))));
  973. }
  974. else
  975. f4 = w2(w2(i5 + o4) * w2(0.5));
  976. d2[c3 + 84 >> 2] = f4, (f4 = d2[a5 + 32 >> 2]) < (i5 = d2[A3 + 32 >> 2]) | (d2[a5 + 28 >> 2] <= d2[A3 + 28 >> 2] ? f4 == i5 : 0) ? (c3 = A3, A3 = a5) : c3 = a5, (i5 = d2[v3 + 32 >> 2]) > (f4 = d2[R3 + 32 >> 2]) | (d2[R3 + 28 >> 2] <= d2[v3 + 28 >> 2] ? f4 == i5 : 0) ? (i5 = f4, a5 = v3, v3 = R3) : a5 = R3, (f4 = d2[A3 + 32 >> 2]) < i5 | (d2[A3 + 28 >> 2] <= d2[v3 + 28 >> 2] ? f4 == i5 : 0) ? (R3 = a5, l4 = v3, a5 = c3, v3 = A3) : (R3 = c3, l4 = A3);
  977. i: {
  978. a:
  979. if ((o4 = d2[l4 + 32 >> 2]) < (s3 = d2[a5 + 32 >> 2]) | (d2[l4 + 28 >> 2] <= d2[a5 + 28 >> 2] ? o4 == s3 : 0)) {
  980. if (y3 = d2[R3 + 32 >> 2], !(!(d2[a5 + 28 >> 2] <= d2[R3 + 28 >> 2]) | s3 != y3) || y3 > s3) {
  981. if (f4 = w2(0), i5 = w2(0), p3 = w2(s3 - o4), t3 = w2(o4 - d2[v3 + 32 >> 2]), (m3 = w2(p3 + t3)) > w2(0) && (i5 = d2[((c3 = t3 < p3) ? v3 : a5) + 28 >> 2], i5 = w2(w2(d2[l4 + 28 >> 2] - i5) + w2(w2((c3 ? t3 : p3) / m3) * w2(i5 - d2[(c3 ? a5 : v3) + 28 >> 2])))), U3 = w2(-i5), m3 = i5, y3 = w2(y3 - s3), (t3 = w2(p3 + y3)) > w2(0) && (B3 = d2[a5 + 28 >> 2], f4 = d2[((a5 = p3 < y3) ? l4 : R3) + 28 >> 2], f4 = w2(w2(B3 - f4) + w2(w2((a5 ? p3 : y3) / t3) * w2(f4 - d2[(a5 ? R3 : l4) + 28 >> 2])))), a5 = w2(i5 + f4) < w2(0), (i5 = w2(g2(a5 ? U3 : m3, w2(0)))) <= (f4 = w2(g2(a5 ? w2(-f4) : f4, w2(0))))) {
  982. if (f4 == w2(0))
  983. break a;
  984. d2[u3 + 88 >> 2] = o4 + w2(p3 * w2(i5 / w2(i5 + f4)));
  985. break i;
  986. }
  987. d2[u3 + 88 >> 2] = s3 + w2(w2(o4 - s3) * w2(f4 / w2(i5 + f4)));
  988. break i;
  989. }
  990. if (f4 = w2(0), i5 = w2(0), t3 = w2(s3 - o4), p3 = d2[v3 + 32 >> 2], m3 = w2(o4 - p3), w2(t3 + m3) > w2(0) && (i5 = d2[l4 + 28 >> 2], i5 = w2(w2(m3 * w2(i5 - d2[a5 + 28 >> 2])) + w2(t3 * w2(i5 - d2[v3 + 28 >> 2])))), m3 = w2(-i5), t3 = i5, s3 = w2(s3 - y3), p3 = w2(y3 - p3), w2(s3 + p3) > w2(0) && (f4 = d2[R3 + 28 >> 2], f4 = w2(w2(p3 * w2(f4 - d2[a5 + 28 >> 2])) + w2(s3 * w2(f4 - d2[v3 + 28 >> 2])))), a5 = w2(i5 - f4) < w2(0), (i5 = w2(g2(a5 ? m3 : t3, w2(0)))) <= (f4 = w2(g2(a5 ? f4 : w2(-f4), w2(0))))) {
  991. if (f4 == w2(0)) {
  992. d2[u3 + 88 >> 2] = w2(o4 + y3) * w2(0.5);
  993. break i;
  994. }
  995. d2[u3 + 88 >> 2] = o4 + w2(w2(y3 - o4) * w2(i5 / w2(i5 + f4)));
  996. break i;
  997. }
  998. d2[u3 + 88 >> 2] = y3 + w2(w2(o4 - y3) * w2(f4 / w2(i5 + f4)));
  999. break i;
  1000. }
  1001. d2[u3 + 88 >> 2] = w2(o4 + s3) * w2(0.5);
  1002. }
  1003. f4 = d2[u3 + 84 >> 2], c3 = b3[r7 + 72 >> 2];
  1004. i: {
  1005. if (f4 < (t3 = d2[c3 + 28 >> 2]))
  1006. i5 = d2[c3 + 32 >> 2];
  1007. else {
  1008. if (f4 != t3)
  1009. break i;
  1010. if (!((i5 = d2[c3 + 32 >> 2]) >= d2[u3 + 88 >> 2]))
  1011. break i;
  1012. }
  1013. d2[u3 + 88 >> 2] = i5, d2[u3 + 84 >> 2] = t3, f4 = t3;
  1014. }
  1015. A3 = a5 = C3, (i5 = t3 = d2[a5 + 28 >> 2]) < (o4 = d2[M3 + 28 >> 2]) || t3 == o4 && (i5 = t3, A3 = C3, d2[a5 + 32 >> 2] <= d2[M3 + 32 >> 2]) || (i5 = o4, A3 = M3), a5 = A3;
  1016. i: {
  1017. if (f4 > i5)
  1018. o4 = d2[a5 + 32 >> 2];
  1019. else {
  1020. if (f4 != i5)
  1021. break i;
  1022. if (!((o4 = d2[a5 + 32 >> 2]) <= d2[u3 + 88 >> 2]))
  1023. break i;
  1024. }
  1025. d2[u3 + 88 >> 2] = o4, d2[u3 + 84 >> 2] = i5, t3 = d2[C3 + 28 >> 2], f4 = i5;
  1026. }
  1027. if (d2[M3 + 28 >> 2] != f4 | d2[u3 + 88 >> 2] != d2[M3 + 32 >> 2] && (d2[u3 + 88 >> 2] != d2[C3 + 32 >> 2] || f4 != t3)) {
  1028. i: {
  1029. f4 = d2[c3 + 28 >> 2];
  1030. a: {
  1031. if (d2[I3 + 32 >> 2] != d2[c3 + 32 >> 2] || f4 != d2[I3 + 28 >> 2]) {
  1032. if (pr2(I3, c3, u3 + 56 | 0) >= w2(0))
  1033. break a;
  1034. c3 = b3[r7 + 72 >> 2], f4 = d2[c3 + 28 >> 2];
  1035. }
  1036. if (d2[S3 + 32 >> 2] == d2[c3 + 32 >> 2] && f4 == d2[S3 + 28 >> 2])
  1037. break i;
  1038. if (!(pr2(S3, c3, u3 + 56 | 0) <= w2(0)))
  1039. break i;
  1040. }
  1041. if ((0 | (a5 = b3[r7 + 72 >> 2])) == (0 | S3)) {
  1042. if (!ir2(b3[_3 + 4 >> 2]))
  1043. break r;
  1044. if (!tr2(b3[P3 + 4 >> 2], _3))
  1045. break r;
  1046. for (a5 = b3[b3[e4 >> 2] + 16 >> 2]; e4 = b3[b3[b3[e4 + 4 >> 2] + 4 >> 2] >> 2], A3 = b3[e4 >> 2], (0 | a5) == b3[A3 + 16 >> 2]; )
  1047. ;
  1048. if (c3 = e4, k3[e4 + 15 | 0] && (c3 = 0, (a5 = er2(b3[b3[b3[b3[b3[e4 + 4 >> 2] + 8 >> 2] >> 2] >> 2] + 4 >> 2], b3[A3 + 12 >> 2])) && rr2(b3[e4 >> 2]) && (b3[e4 >> 2] = a5, n4[e4 + 15 | 0] = 0, b3[a5 + 24 >> 2] = e4, c3 = b3[b3[b3[e4 + 4 >> 2] + 4 >> 2] >> 2])), !c3)
  1049. break r;
  1050. a5 = b3[b3[b3[c3 + 4 >> 2] + 8 >> 2] >> 2], e4 = b3[a5 >> 2], wr2(r7, a5, L3), T3 = 1, ar2(r7, c3, b3[b3[e4 + 4 >> 2] + 12 >> 2], e4, e4, 1);
  1051. break f;
  1052. }
  1053. if ((0 | a5) == (0 | I3)) {
  1054. if (!ir2(b3[P3 + 4 >> 2]))
  1055. break r;
  1056. if (!tr2(b3[_3 + 12 >> 2], b3[b3[P3 + 4 >> 2] + 12 >> 2]))
  1057. break r;
  1058. for (c3 = b3[b3[b3[e4 >> 2] + 4 >> 2] + 16 >> 2], a5 = e4; a5 = b3[b3[b3[a5 + 4 >> 2] + 4 >> 2] >> 2], (0 | c3) == b3[b3[b3[a5 >> 2] + 4 >> 2] + 16 >> 2]; )
  1059. ;
  1060. c3 = b3[b3[b3[b3[b3[b3[a5 + 4 >> 2] + 8 >> 2] >> 2] >> 2] + 4 >> 2] + 8 >> 2], b3[e4 >> 2] = b3[b3[P3 + 4 >> 2] + 12 >> 2], T3 = 1, ar2(r7, a5, b3[wr2(r7, e4, 0) + 8 >> 2], b3[b3[_3 + 4 >> 2] + 8 >> 2], c3, 1);
  1061. break f;
  1062. }
  1063. if (pr2(I3, a5, u3 + 56 | 0) >= w2(0)) {
  1064. if (n4[e4 + 14 | 0] = 1, n4[b3[b3[b3[e4 + 4 >> 2] + 4 >> 2] >> 2] + 14 | 0] = 1, !ir2(b3[_3 + 4 >> 2]))
  1065. break r;
  1066. c3 = b3[_3 + 16 >> 2], a5 = b3[r7 + 72 >> 2], d2[c3 + 28 >> 2] = d2[a5 + 28 >> 2], d2[c3 + 32 >> 2] = d2[a5 + 32 >> 2];
  1067. } else
  1068. a5 = b3[r7 + 72 >> 2];
  1069. if (!(pr2(S3, a5, u3 + 56 | 0) <= w2(0)))
  1070. break f;
  1071. if (n4[L3 + 14 | 0] = 1, n4[e4 + 14 | 0] = 1, !ir2(b3[P3 + 4 >> 2]))
  1072. break r;
  1073. e4 = b3[P3 + 16 >> 2], r7 = b3[r7 + 72 >> 2], d2[e4 + 28 >> 2] = d2[r7 + 28 >> 2], d2[e4 + 32 >> 2] = d2[r7 + 32 >> 2];
  1074. break f;
  1075. }
  1076. if (!ir2(b3[_3 + 4 >> 2]))
  1077. break r;
  1078. if (!ir2(b3[P3 + 4 >> 2]))
  1079. break r;
  1080. if (!tr2(b3[b3[P3 + 4 >> 2] + 12 >> 2], _3))
  1081. break r;
  1082. if (a5 = b3[_3 + 16 >> 2], d2[a5 + 28 >> 2] = d2[u3 + 84 >> 2], d2[a5 + 32 >> 2] = d2[u3 + 88 >> 2], c3 = or2(b3[r7 + 68 >> 2], a5), a5 = b3[_3 + 16 >> 2], b3[a5 + 36 >> 2] = c3, (0 | c3) == 2147483647)
  1083. break e;
  1084. b3[u3 + 112 >> 2] = b3[C3 + 12 >> 2], b3[u3 + 116 >> 2] = b3[I3 + 12 >> 2], b3[u3 + 120 >> 2] = b3[M3 + 12 >> 2], b3[u3 + 124 >> 2] = b3[S3 + 12 >> 2], b3[a5 + 24 >> 2] = 0, b3[a5 + 16 >> 2] = 0, b3[a5 + 20 >> 2] = 0, f4 = d2[a5 + 28 >> 2], m3 = (i5 = w2(d2[I3 + 28 >> 2] - f4)) < w2(0) ? w2(-i5) : i5, i5 = d2[a5 + 32 >> 2], t3 = w2(d2[I3 + 32 >> 2] - i5), o4 = w2(m3 + (t3 < w2(0) ? w2(-t3) : t3)), m3 = (t3 = w2(d2[C3 + 28 >> 2] - f4)) < w2(0) ? w2(-t3) : t3, t3 = w2(d2[C3 + 32 >> 2] - i5), s3 = w2(m3 + (t3 < w2(0) ? w2(-t3) : t3)), x3 = +w2(s3 + o4), t3 = w2(0.5 * +o4 / x3), d2[u3 + 96 >> 2] = t3, o4 = w2(0.5 * +s3 / x3), d2[u3 + 100 >> 2] = o4, s3 = w2(w2(w2(d2[C3 + 16 >> 2] * t3) + w2(d2[I3 + 16 >> 2] * o4)) + w2(0)), d2[a5 + 16 >> 2] = s3, y3 = w2(w2(w2(d2[C3 + 20 >> 2] * t3) + w2(d2[I3 + 20 >> 2] * o4)) + w2(0)), d2[a5 + 20 >> 2] = y3, o4 = w2(w2(w2(d2[C3 + 24 >> 2] * t3) + w2(d2[I3 + 24 >> 2] * o4)) + w2(0)), d2[a5 + 24 >> 2] = o4, m3 = (t3 = w2(d2[M3 + 28 >> 2] - f4)) < w2(0) ? w2(-t3) : t3, t3 = w2(d2[M3 + 32 >> 2] - i5), t3 = w2(m3 + (t3 < w2(0) ? w2(-t3) : t3)), m3 = (f4 = w2(d2[S3 + 28 >> 2] - f4)) < w2(0) ? w2(-f4) : f4, f4 = w2(d2[S3 + 32 >> 2] - i5), f4 = w2(m3 + (f4 < w2(0) ? w2(-f4) : f4)), x3 = +w2(t3 + f4), f4 = w2(0.5 * +f4 / x3), d2[u3 + 104 >> 2] = f4, i5 = w2(0.5 * +t3 / x3), d2[u3 + 108 >> 2] = i5, t3 = w2(s3 + w2(w2(d2[M3 + 16 >> 2] * f4) + w2(d2[S3 + 16 >> 2] * i5))), d2[a5 + 16 >> 2] = t3, s3 = w2(y3 + w2(w2(d2[M3 + 20 >> 2] * f4) + w2(d2[S3 + 20 >> 2] * i5))), d2[a5 + 20 >> 2] = s3, f4 = w2(o4 + w2(w2(d2[M3 + 24 >> 2] * f4) + w2(d2[S3 + 24 >> 2] * i5))), d2[a5 + 24 >> 2] = f4, d2[u3 + 140 >> 2] = f4, d2[u3 + 136 >> 2] = s3, d2[u3 + 132 >> 2] = t3, b3[a5 + 12 >> 2] = 0, a5 = a5 + 12 | 0, (0 | (c3 = b3[r7 + 1736 >> 2])) == 8 ? be[b3[r7 + 76 >> 2]](u3 + 132 | 0, u3 + 112 | 0, u3 + 96 | 0, a5) : be[0 | c3](u3 + 132 | 0, u3 + 112 | 0, u3 + 96 | 0, a5, b3[r7 + 1896 >> 2]), b3[a5 >> 2] | k3[r7 + 60 | 0] || ((0 | (a5 = b3[r7 + 1732 >> 2])) == 11 ? be[b3[r7 + 12 >> 2]](100156) : be[0 | a5](100156, b3[r7 + 1896 >> 2]), n4[r7 + 60 | 0] = 1), n4[L3 + 14 | 0] = 1, n4[e4 + 14 | 0] = 1, n4[b3[b3[b3[e4 + 4 >> 2] + 4 >> 2] >> 2] + 14 | 0] = 1;
  1085. } else
  1086. G2(r7, e4);
  1087. }
  1088. return j2 = u3 + 144 | 0, T3;
  1089. }
  1090. Kr(b3[r7 + 68 >> 2]), b3[r7 + 68 >> 2] = 0;
  1091. }
  1092. Zr(r7 + 1740 | 0, 1), E2();
  1093. }
  1094. function Q2(r7) {
  1095. r7 |= 0;
  1096. var e4 = 0, f4 = 0, i5 = 0, a5 = 0, t3 = 0, o4 = 0, k4 = 0, u3 = 0, c3 = w2(0), s3 = w2(0), A3 = 0, l4 = 0, v3 = 0, h3 = 0, m3 = 0, y3 = 0, g3 = 0, C3 = 0, R3 = 0, M3 = 0;
  1097. j2 = t3 = j2 - 48 | 0, n4[r7 + 60 | 0] = 0;
  1098. r: {
  1099. if (f4 = b3[r7 + 8 >> 2], (0 | (e4 = b3[f4 + 64 >> 2])) != (0 | (k4 = f4 - -64 | 0)))
  1100. for (; ; ) {
  1101. f4 = b3[e4 + 12 >> 2], a5 = b3[e4 >> 2], o4 = b3[e4 + 16 >> 2], i5 = b3[b3[e4 + 4 >> 2] + 16 >> 2];
  1102. e: {
  1103. if (!(d2[o4 + 28 >> 2] != d2[i5 + 28 >> 2] | d2[o4 + 32 >> 2] != d2[i5 + 32 >> 2] | b3[f4 + 12 >> 2] == (0 | e4))) {
  1104. b3[t3 + 24 >> 2] = 0, b3[t3 + 28 >> 2] = 0, b3[t3 + 16 >> 2] = 0, b3[t3 + 20 >> 2] = 0, i5 = b3[287], b3[t3 + 8 >> 2] = b3[286], b3[t3 + 12 >> 2] = i5, i5 = b3[285], b3[t3 >> 2] = b3[284], b3[t3 + 4 >> 2] = i5, i5 = b3[f4 + 16 >> 2], b3[t3 + 16 >> 2] = b3[i5 + 12 >> 2], b3[t3 + 20 >> 2] = b3[o4 + 12 >> 2], d2[t3 + 36 >> 2] = d2[i5 + 16 >> 2], d2[t3 + 40 >> 2] = d2[i5 + 20 >> 2], d2[t3 + 44 >> 2] = d2[i5 + 24 >> 2], b3[i5 + 12 >> 2] = 0, i5 = i5 + 12 | 0, (0 | (o4 = b3[r7 + 1736 >> 2])) == 8 ? be[b3[r7 + 76 >> 2]](t3 + 36 | 0, t3 + 16 | 0, t3, i5) : be[0 | o4](t3 + 36 | 0, t3 + 16 | 0, t3, i5, b3[r7 + 1896 >> 2]), b3[i5 >> 2] || (b3[i5 >> 2] = b3[t3 + 16 >> 2]);
  1105. f: {
  1106. if (tr2(f4, e4)) {
  1107. if (!rr2(e4))
  1108. break f;
  1109. i5 = b3[f4 + 12 >> 2];
  1110. break e;
  1111. }
  1112. break r;
  1113. }
  1114. break r;
  1115. }
  1116. i5 = f4, f4 = e4;
  1117. }
  1118. if (b3[i5 + 12 >> 2] == (0 | f4)) {
  1119. if ((0 | f4) != (0 | i5) && (a5 = b3[a5 + 4 >> 2] != (0 | i5) && (0 | i5) != (0 | a5) ? a5 : b3[a5 >> 2], !rr2(i5)))
  1120. break r;
  1121. if (e4 = (0 | f4) == (0 | a5) | b3[a5 + 4 >> 2] == (0 | f4) ? b3[a5 >> 2] : a5, !rr2(f4))
  1122. break r;
  1123. } else
  1124. e4 = a5;
  1125. if ((0 | e4) == (0 | k4))
  1126. break;
  1127. }
  1128. a5 = r7, (e4 = O2(28)) ? (i5 = e4, (f4 = O2(28)) ? (b3[f4 + 8 >> 2] = 0, b3[f4 + 12 >> 2] = 32, o4 = O2(132), b3[f4 >> 2] = o4, o4 ? (k4 = O2(264), b3[f4 + 4 >> 2] = k4, k4 ? (b3[f4 + 24 >> 2] = 9, b3[f4 + 16 >> 2] = 0, b3[f4 + 20 >> 2] = 0, b3[o4 + 4 >> 2] = 1, b3[k4 + 8 >> 2] = 0) : (Y2(o4), Y2(f4), f4 = 0)) : (Y2(f4), f4 = 0)) : f4 = 0, b3[i5 >> 2] = f4, f4 ? (i5 = O2(128), b3[e4 + 4 >> 2] = i5, i5 ? (b3[e4 + 24 >> 2] = 9, b3[e4 + 20 >> 2] = 0, b3[e4 + 12 >> 2] = 0, b3[e4 + 16 >> 2] = 32) : (Y2(b3[f4 + 4 >> 2]), Y2(b3[f4 >> 2]), Y2(f4), Y2(e4), e4 = 0)) : (Y2(e4), e4 = 0)) : e4 = 0, v3 = e4, b3[a5 + 68 >> 2] = e4;
  1129. e:
  1130. if (e4) {
  1131. f: {
  1132. f4 = b3[r7 + 8 >> 2];
  1133. i: {
  1134. if ((0 | (e4 = b3[f4 >> 2])) != (0 | f4))
  1135. for (; ; ) {
  1136. if (a5 = or2(v3, e4), b3[e4 + 36 >> 2] = a5, (0 | a5) == 2147483647)
  1137. break i;
  1138. if ((0 | f4) == (0 | (e4 = b3[e4 >> 2])))
  1139. break;
  1140. }
  1141. if (j2 = y3 = j2 - 400 | 0, a5 = O2(4 + (e4 = (m3 = b3[v3 + 12 >> 2]) << 2) | 0), b3[v3 + 8 >> 2] = a5, j2 = y3 + 400 | 0, a5) {
  1142. if (!((o4 = (e4 + a5 | 0) - 4 | 0) >>> 0 < a5 >>> 0)) {
  1143. if (f4 = b3[v3 + 4 >> 2], i5 = 1 + ((k4 = (m3 << 2) - 4 | 0) >>> 2 | 0) & 7)
  1144. for (e4 = a5; b3[e4 >> 2] = f4, e4 = e4 + 4 | 0, f4 = f4 + 4 | 0, i5 = i5 - 1 | 0; )
  1145. ;
  1146. else
  1147. e4 = a5;
  1148. if (!(k4 >>> 0 < 28))
  1149. for (; b3[e4 >> 2] = f4, b3[e4 + 28 >> 2] = f4 + 28, b3[e4 + 24 >> 2] = f4 + 24, b3[e4 + 20 >> 2] = f4 + 20, b3[e4 + 16 >> 2] = f4 + 16, b3[e4 + 12 >> 2] = f4 + 12, b3[e4 + 8 >> 2] = f4 + 8, b3[e4 + 4 >> 2] = f4 + 4, f4 = f4 + 32 | 0, o4 >>> 0 >= (e4 = e4 + 32 | 0) >>> 0; )
  1150. ;
  1151. }
  1152. for (b3[y3 + 4 >> 2] = o4, b3[y3 >> 2] = a5, g3 = 2016473283, u3 = 1; ; ) {
  1153. if ((A3 = b3[((u3 << 3) + y3 | 0) - 4 >> 2]) >>> 0 > (k4 = b3[(h3 << 3) + y3 >> 2]) + 40 >>> 0)
  1154. for (; ; ) {
  1155. for (g3 = p2(g3, 1539415821) + 1 | 0, R3 = b3[(e4 = ((g3 >>> 0) % (1 + (A3 - k4 >> 2) >>> 0) << 2) + k4 | 0) >> 2], b3[e4 >> 2] = b3[k4 >> 2], b3[k4 >> 2] = R3, i5 = A3 + 4 | 0, f4 = k4 - 4 | 0; ; ) {
  1156. a5 = i5, l4 = b3[f4 + 4 >> 2], o4 = f4, e4 = f4 + 4 | 0, i5 = b3[l4 >> 2], c3 = d2[i5 + 28 >> 2], C3 = b3[R3 >> 2], u3 = e4;
  1157. a:
  1158. if (!(c3 < (s3 = d2[C3 + 28 >> 2]))) {
  1159. for (; ; ) {
  1160. if (f4 = e4, u3 = e4, d2[i5 + 32 >> 2] <= d2[C3 + 32 >> 2] && c3 == s3)
  1161. break a;
  1162. if (e4 = f4 + 4 | 0, o4 = f4, l4 = b3[f4 + 4 >> 2], i5 = b3[l4 >> 2], s3 > (c3 = d2[i5 + 28 >> 2]))
  1163. break;
  1164. }
  1165. u3 = e4;
  1166. }
  1167. f4 = u3, u3 = b3[(i5 = a5 - 4 | 0) >> 2], e4 = b3[u3 >> 2];
  1168. a:
  1169. if (!(s3 < (c3 = d2[e4 + 28 >> 2])))
  1170. for (; ; ) {
  1171. if (!(!(d2[C3 + 32 >> 2] <= d2[e4 + 32 >> 2]) | c3 != s3))
  1172. break a;
  1173. if (a5 = i5, u3 = b3[(i5 = i5 - 4 | 0) >> 2], e4 = b3[u3 >> 2], s3 < (c3 = d2[e4 + 28 >> 2]))
  1174. break;
  1175. }
  1176. if (b3[f4 >> 2] = u3, b3[i5 >> 2] = l4, !(f4 >>> 0 < i5 >>> 0))
  1177. break;
  1178. }
  1179. if (e4 = b3[f4 >> 2], b3[f4 >> 2] = l4, b3[i5 >> 2] = e4, (f4 - k4 | 0) < (A3 - i5 | 0) ? (e4 = a5, i5 = A3, A3 = o4) : (e4 = k4, i5 = o4, k4 = a5), b3[4 + (f4 = (h3 << 3) + y3 | 0) >> 2] = i5, b3[f4 >> 2] = e4, h3 = h3 + 1 | 0, !(k4 + 40 >>> 0 < A3 >>> 0))
  1180. break;
  1181. }
  1182. if (u3 = h3, A3 >>> 0 >= (a5 = k4 + 4 | 0) >>> 0)
  1183. for (; ; ) {
  1184. i5 = b3[a5 >> 2], f4 = e4 = a5;
  1185. a:
  1186. if (!(k4 >>> 0 >= e4 >>> 0))
  1187. for (; ; ) {
  1188. if (o4 = b3[i5 >> 2], c3 = d2[o4 + 28 >> 2], h3 = b3[(f4 = e4 - 4 | 0) >> 2], l4 = b3[h3 >> 2], c3 < (s3 = d2[l4 + 28 >> 2])) {
  1189. f4 = e4;
  1190. break a;
  1191. }
  1192. if (!(!(d2[o4 + 32 >> 2] <= d2[l4 + 32 >> 2]) | c3 != s3)) {
  1193. f4 = e4;
  1194. break a;
  1195. }
  1196. if (b3[e4 >> 2] = h3, !(k4 >>> 0 < (e4 = f4) >>> 0))
  1197. break;
  1198. }
  1199. if (b3[f4 >> 2] = i5, !(A3 >>> 0 >= (a5 = a5 + 4 | 0) >>> 0))
  1200. break;
  1201. }
  1202. if (h3 = u3 - 1 | 0, !((0 | u3) >= 1))
  1203. break;
  1204. }
  1205. if (b3[v3 + 20 >> 2] = 1, b3[v3 + 16 >> 2] = m3, v3 = b3[v3 >> 2], (0 | (a5 = b3[v3 + 8 >> 2])) >= 1)
  1206. for (A3 = b3[v3 + 4 >> 2], k4 = b3[v3 >> 2], f4 = a5; ; ) {
  1207. for (i5 = f4, u3 = A3 + ((h3 = b3[k4 + (f4 << 2) >> 2]) << 3) | 0, e4 = f4; (0 | a5) <= (0 | (f4 = e4 << 1)) || (l4 = b3[A3 + (b3[k4 + ((o4 = 1 | f4) << 2) >> 2] << 3) >> 2], c3 = d2[l4 + 28 >> 2], m3 = b3[A3 + (b3[k4 + (f4 << 2) >> 2] << 3) >> 2], s3 = d2[m3 + 28 >> 2], !(d2[l4 + 32 >> 2] <= d2[m3 + 32 >> 2]) | c3 != s3 && !(c3 < s3) || (f4 = o4)), !((0 | f4) > (0 | a5) || (o4 = b3[u3 >> 2], c3 = d2[o4 + 28 >> 2], l4 = b3[k4 + (f4 << 2) >> 2], g3 = b3[(m3 = A3 + (l4 << 3) | 0) >> 2], c3 < (s3 = d2[g3 + 28 >> 2]) | (d2[o4 + 32 >> 2] <= d2[g3 + 32 >> 2] ? c3 == s3 : 0))); )
  1208. b3[k4 + (e4 << 2) >> 2] = l4, b3[m3 + 4 >> 2] = e4, e4 = f4;
  1209. if (b3[k4 + (e4 << 2) >> 2] = h3, b3[u3 + 4 >> 2] = e4, f4 = i5 - 1 | 0, !((0 | i5) > 1))
  1210. break;
  1211. }
  1212. b3[v3 + 20 >> 2] = 1, e4 = 1;
  1213. } else
  1214. e4 = 0;
  1215. if (e4)
  1216. break f;
  1217. }
  1218. Kr(b3[r7 + 68 >> 2]), b3[r7 + 68 >> 2] = 0;
  1219. break e;
  1220. }
  1221. if (f4 = r7 - -64 | 0, (e4 = O2(20)) ? (b3[e4 + 16 >> 2] = 10, b3[e4 + 12 >> 2] = r7, b3[e4 >> 2] = 0, b3[e4 + 8 >> 2] = e4, b3[e4 + 4 >> 2] = e4) : e4 = 0, b3[f4 >> 2] = e4, !e4)
  1222. break r;
  1223. if (_r2(r7, w2(-3999999973526325e22)), _r2(r7, w2(3999999973526325e22)), f4 = Ir2(b3[r7 + 68 >> 2]))
  1224. for (; ; ) {
  1225. f:
  1226. if (e4 = xr2(b3[r7 + 68 >> 2]))
  1227. for (; ; ) {
  1228. if (d2[e4 + 28 >> 2] != d2[f4 + 28 >> 2] | d2[e4 + 32 >> 2] != d2[f4 + 32 >> 2])
  1229. break f;
  1230. if (a5 = b3[Ir2(b3[r7 + 68 >> 2]) + 8 >> 2], i5 = b3[f4 + 8 >> 2], b3[t3 + 24 >> 2] = 0, b3[t3 + 28 >> 2] = 0, b3[t3 + 16 >> 2] = 0, b3[t3 + 20 >> 2] = 0, e4 = b3[287], b3[t3 + 8 >> 2] = b3[286], b3[t3 + 12 >> 2] = e4, e4 = b3[285], b3[t3 >> 2] = b3[284], b3[t3 + 4 >> 2] = e4, e4 = b3[i5 + 16 >> 2], b3[t3 + 16 >> 2] = b3[e4 + 12 >> 2], b3[t3 + 20 >> 2] = b3[b3[a5 + 16 >> 2] + 12 >> 2], d2[t3 + 36 >> 2] = d2[e4 + 16 >> 2], d2[t3 + 40 >> 2] = d2[e4 + 20 >> 2], d2[t3 + 44 >> 2] = d2[e4 + 24 >> 2], b3[e4 + 12 >> 2] = 0, e4 = e4 + 12 | 0, (0 | (o4 = b3[r7 + 1736 >> 2])) == 8 ? be[b3[r7 + 76 >> 2]](t3 + 36 | 0, t3 + 16 | 0, t3, e4) : be[0 | o4](t3 + 36 | 0, t3 + 16 | 0, t3, e4, b3[r7 + 1896 >> 2]), b3[e4 >> 2] || (b3[e4 >> 2] = b3[t3 + 16 >> 2]), !tr2(i5, a5))
  1231. break r;
  1232. if (!(e4 = xr2(b3[r7 + 68 >> 2])))
  1233. break;
  1234. }
  1235. if (z2(r7, f4), !(f4 = Ir2(b3[r7 + 68 >> 2])))
  1236. break;
  1237. }
  1238. if (e4 = b3[b3[b3[(a5 = r7 - -64 | 0) >> 2] + 4 >> 2] >> 2], f4 = b3[e4 >> 2], b3[r7 + 72 >> 2] = b3[f4 + 16 >> 2], b3[f4 + 24 >> 2] = 0, Vr(b3[e4 + 4 >> 2]), Y2(e4), f4 = b3[a5 >> 2], e4 = b3[b3[f4 + 4 >> 2] >> 2])
  1239. for (; b3[b3[e4 >> 2] + 24 >> 2] = 0, Vr(b3[e4 + 4 >> 2]), Y2(e4), f4 = b3[a5 >> 2], e4 = b3[b3[f4 + 4 >> 2] >> 2]; )
  1240. ;
  1241. if ((0 | f4) != (0 | (e4 = b3[f4 + 4 >> 2])))
  1242. for (; Y2(e4), (0 | f4) != (0 | (e4 = b3[e4 + 4 >> 2])); )
  1243. ;
  1244. if (Y2(f4), Kr(b3[r7 + 68 >> 2]), M3 = 1, r7 = b3[r7 + 8 >> 2], (0 | (f4 = b3[r7 + 40 >> 2])) != (0 | (a5 = r7 + 40 | 0)))
  1245. for (; ; ) {
  1246. if (r7 = b3[f4 + 8 >> 2], f4 = b3[f4 >> 2], (0 | r7) == b3[b3[r7 + 12 >> 2] + 12 >> 2] && (e4 = b3[r7 + 8 >> 2], b3[e4 + 28 >> 2] = b3[e4 + 28 >> 2] + b3[r7 + 28 >> 2], e4 = b3[e4 + 4 >> 2], b3[e4 + 28 >> 2] = b3[e4 + 28 >> 2] + b3[b3[r7 + 4 >> 2] + 28 >> 2], !rr2(r7))) {
  1247. M3 = 0;
  1248. break e;
  1249. }
  1250. if ((0 | f4) == (0 | a5))
  1251. break;
  1252. }
  1253. }
  1254. return j2 = t3 + 48 | 0, 0 | M3;
  1255. }
  1256. Zr(r7 + 1740 | 0, 1), E2();
  1257. }
  1258. function W2(r7, e4, f4, i5, a5, t3) {
  1259. var u3 = 0, c3 = 0, s3 = 0, A3 = 0, l4 = 0, v3 = 0, d3 = 0, w3 = 0, m3 = 0, y3 = 0, g3 = 0, E3 = 0, C3 = 0, R3 = 0, M3 = 0, I3 = 0, S3 = 0;
  1260. j2 = c3 = j2 - 80 | 0, b3[c3 + 76 >> 2] = e4, M3 = c3 + 55 | 0, C3 = c3 + 56 | 0, e4 = 0;
  1261. r: {
  1262. e:
  1263. for (; ; ) {
  1264. (0 | m3) < 0 || ((2147483647 - m3 | 0) < (0 | e4) ? (b3[613] = 61, m3 = -1) : m3 = e4 + m3 | 0);
  1265. f: {
  1266. i: {
  1267. a: {
  1268. if (l4 = b3[c3 + 76 >> 2], u3 = k3[0 | (e4 = l4)])
  1269. for (; ; ) {
  1270. n: {
  1271. t:
  1272. if (u3 &= 255) {
  1273. if ((0 | u3) != 37)
  1274. break n;
  1275. for (u3 = e4; ; ) {
  1276. if (k3[e4 + 1 | 0] != 37)
  1277. break t;
  1278. if (s3 = e4 + 2 | 0, b3[c3 + 76 >> 2] = s3, u3 = u3 + 1 | 0, v3 = k3[e4 + 2 | 0], e4 = s3, (0 | v3) != 37)
  1279. break;
  1280. }
  1281. } else
  1282. u3 = e4;
  1283. if (e4 = u3 - l4 | 0, r7 && yr2(r7, l4, e4), e4)
  1284. continue e;
  1285. g3 = -1, u3 = 1, s3 = c3, e4 = b3[c3 + 76 >> 2], k3[e4 + 2 | 0] != 36 | n4[b3[c3 + 76 >> 2] + 1 | 0] - 48 >>> 0 >= 10 || (g3 = n4[e4 + 1 | 0] - 48 | 0, R3 = 1, u3 = 3), e4 = u3 + e4 | 0, b3[s3 + 76 >> 2] = e4, y3 = 0;
  1286. t:
  1287. if ((s3 = (A3 = n4[0 | e4]) - 32 | 0) >>> 0 > 31)
  1288. u3 = e4;
  1289. else if (u3 = e4, 75913 & (s3 = 1 << s3))
  1290. for (; ; ) {
  1291. if (u3 = e4 + 1 | 0, b3[c3 + 76 >> 2] = u3, y3 |= s3, (s3 = (A3 = n4[e4 + 1 | 0]) - 32 | 0) >>> 0 >= 32)
  1292. break t;
  1293. if (e4 = u3, !(75913 & (s3 = 1 << s3)))
  1294. break;
  1295. }
  1296. t:
  1297. if ((0 | A3) != 42) {
  1298. if ((0 | (d3 = Wr(c3 + 76 | 0))) < 0)
  1299. break a;
  1300. e4 = b3[c3 + 76 >> 2];
  1301. } else {
  1302. if (s3 = c3, n4[u3 + 1 | 0] - 48 >>> 0 >= 10 || (e4 = b3[c3 + 76 >> 2], k3[e4 + 2 | 0] != 36)) {
  1303. if (R3)
  1304. break a;
  1305. R3 = 0, d3 = 0, r7 && (e4 = b3[f4 >> 2], b3[f4 >> 2] = e4 + 4, d3 = b3[e4 >> 2]), e4 = b3[c3 + 76 >> 2] + 1 | 0;
  1306. } else
  1307. b3[((n4[e4 + 1 | 0] << 2) + a5 | 0) - 192 >> 2] = 10, d3 = b3[((n4[e4 + 1 | 0] << 3) + i5 | 0) - 384 >> 2], R3 = 1, e4 = e4 + 3 | 0;
  1308. if (b3[s3 + 76 >> 2] = e4, (0 | d3) > -1)
  1309. break t;
  1310. d3 = 0 - d3 | 0, y3 |= 8192;
  1311. }
  1312. v3 = -1;
  1313. t:
  1314. if (k3[0 | e4] == 46)
  1315. if (k3[e4 + 1 | 0] != 42)
  1316. b3[c3 + 76 >> 2] = e4 + 1, v3 = Wr(c3 + 76 | 0), e4 = b3[c3 + 76 >> 2];
  1317. else {
  1318. if (!(n4[e4 + 2 | 0] - 48 >>> 0 >= 10) && (e4 = b3[c3 + 76 >> 2], k3[e4 + 3 | 0] == 36)) {
  1319. b3[((n4[e4 + 2 | 0] << 2) + a5 | 0) - 192 >> 2] = 10, v3 = b3[((n4[e4 + 2 | 0] << 3) + i5 | 0) - 384 >> 2], e4 = e4 + 4 | 0, b3[c3 + 76 >> 2] = e4;
  1320. break t;
  1321. }
  1322. if (R3)
  1323. break a;
  1324. r7 ? (e4 = b3[f4 >> 2], b3[f4 >> 2] = e4 + 4, v3 = b3[e4 >> 2]) : v3 = 0, e4 = b3[c3 + 76 >> 2] + 2 | 0, b3[c3 + 76 >> 2] = e4;
  1325. }
  1326. for (u3 = 0; ; ) {
  1327. if (E3 = u3, w3 = -1, n4[0 | e4] - 65 >>> 0 > 57)
  1328. break r;
  1329. if (A3 = e4 + 1 | 0, b3[c3 + 76 >> 2] = A3, u3 = n4[0 | e4], e4 = A3, !((u3 = k3[1103 + (u3 + p2(E3, 58) | 0) | 0]) - 1 >>> 0 < 8))
  1330. break;
  1331. }
  1332. t: {
  1333. o: {
  1334. if ((0 | u3) != 19) {
  1335. if (!u3)
  1336. break r;
  1337. if ((0 | g3) >= 0) {
  1338. b3[(g3 << 2) + a5 >> 2] = u3, u3 = b3[4 + (e4 = (g3 << 3) + i5 | 0) >> 2], b3[c3 + 64 >> 2] = b3[e4 >> 2], b3[c3 + 68 >> 2] = u3;
  1339. break o;
  1340. }
  1341. if (!r7)
  1342. break f;
  1343. hr2(c3 - -64 | 0, u3, f4), A3 = b3[c3 + 76 >> 2];
  1344. break t;
  1345. }
  1346. if ((0 | g3) > -1)
  1347. break r;
  1348. }
  1349. if (e4 = 0, !r7)
  1350. continue e;
  1351. }
  1352. s3 = -65537 & y3, u3 = 8192 & y3 ? s3 : y3, w3 = 0, g3 = 1024, y3 = C3;
  1353. t: {
  1354. o: {
  1355. b: {
  1356. k: {
  1357. u: {
  1358. c: {
  1359. s: {
  1360. A: {
  1361. l: {
  1362. v: {
  1363. d: {
  1364. h: {
  1365. p: {
  1366. w: {
  1367. m: {
  1368. switch (e4 = n4[A3 - 1 | 0], (e4 = E3 && (15 & e4) == 3 ? -33 & e4 : e4) - 88 | 0) {
  1369. case 11:
  1370. break t;
  1371. case 9:
  1372. case 13:
  1373. case 14:
  1374. case 15:
  1375. break o;
  1376. case 27:
  1377. break s;
  1378. case 12:
  1379. case 17:
  1380. break v;
  1381. case 23:
  1382. break d;
  1383. case 0:
  1384. case 32:
  1385. break h;
  1386. case 24:
  1387. break p;
  1388. case 22:
  1389. break w;
  1390. case 29:
  1391. break m;
  1392. case 1:
  1393. case 2:
  1394. case 3:
  1395. case 4:
  1396. case 5:
  1397. case 6:
  1398. case 7:
  1399. case 8:
  1400. case 10:
  1401. case 16:
  1402. case 18:
  1403. case 19:
  1404. case 20:
  1405. case 21:
  1406. case 25:
  1407. case 26:
  1408. case 28:
  1409. case 30:
  1410. case 31:
  1411. break i;
  1412. }
  1413. switch (e4 - 65 | 0) {
  1414. case 0:
  1415. case 4:
  1416. case 5:
  1417. case 6:
  1418. break o;
  1419. case 2:
  1420. break u;
  1421. case 1:
  1422. case 3:
  1423. break i;
  1424. }
  1425. if ((0 | e4) == 83)
  1426. break c;
  1427. break i;
  1428. }
  1429. A3 = b3[c3 + 64 >> 2], s3 = b3[c3 + 68 >> 2], g3 = 1024;
  1430. break l;
  1431. }
  1432. e4 = 0;
  1433. w:
  1434. switch (255 & E3) {
  1435. case 0:
  1436. case 1:
  1437. case 6:
  1438. b3[b3[c3 + 64 >> 2] >> 2] = m3;
  1439. continue e;
  1440. case 2:
  1441. u3 = b3[c3 + 64 >> 2], b3[u3 >> 2] = m3, b3[u3 + 4 >> 2] = m3 >> 31;
  1442. continue e;
  1443. case 3:
  1444. o3[b3[c3 + 64 >> 2] >> 1] = m3;
  1445. continue e;
  1446. case 4:
  1447. n4[b3[c3 + 64 >> 2]] = m3;
  1448. continue e;
  1449. case 7:
  1450. break w;
  1451. default:
  1452. continue e;
  1453. }
  1454. u3 = b3[c3 + 64 >> 2], b3[u3 >> 2] = m3, b3[u3 + 4 >> 2] = m3 >> 31;
  1455. continue e;
  1456. }
  1457. v3 = v3 >>> 0 > 8 ? v3 : 8, u3 |= 8, e4 = 120;
  1458. }
  1459. if (l4 = C3, I3 = 32 & e4, (s3 = E3 = b3[c3 + 68 >> 2]) | (A3 = b3[c3 + 64 >> 2]))
  1460. for (; n4[0 | (l4 = l4 - 1 | 0)] = I3 | k3[1632 + (15 & A3) | 0], S3 = !s3 & A3 >>> 0 > 15 | (0 | s3) != 0, E3 = s3, s3 = s3 >>> 4 | 0, A3 = (15 & E3) << 28 | A3 >>> 4, S3; )
  1461. ;
  1462. if (!(b3[c3 + 64 >> 2] | b3[c3 + 68 >> 2]) | !(8 & u3))
  1463. break A;
  1464. g3 = 1024 + (e4 >>> 4 | 0) | 0, w3 = 2;
  1465. break A;
  1466. }
  1467. if (e4 = C3, (s3 = l4 = b3[c3 + 68 >> 2]) | (A3 = b3[c3 + 64 >> 2]))
  1468. for (; n4[0 | (e4 = e4 - 1 | 0)] = 7 & A3 | 48, E3 = !s3 & A3 >>> 0 > 7 | (0 | s3) != 0, l4 = s3, s3 = s3 >>> 3 | 0, A3 = (7 & l4) << 29 | A3 >>> 3, E3; )
  1469. ;
  1470. if (l4 = e4, !(8 & u3))
  1471. break A;
  1472. v3 = (0 | (e4 = C3 - l4 | 0)) < (0 | v3) ? v3 : e4 + 1 | 0;
  1473. break A;
  1474. }
  1475. s3 = e4 = b3[c3 + 68 >> 2], A3 = b3[c3 + 64 >> 2], (0 | e4) < -1 || (0 | e4) <= -1 ? (s3 = 0 - (s3 + ((0 | A3) != 0) | 0) | 0, A3 = 0 - A3 | 0, b3[c3 + 64 >> 2] = A3, b3[c3 + 68 >> 2] = s3, w3 = 1, g3 = 1024) : 2048 & u3 ? (w3 = 1, g3 = 1025) : g3 = (w3 = 1 & u3) ? 1026 : 1024;
  1476. }
  1477. l4 = Br2(A3, s3, C3);
  1478. }
  1479. if (u3 = (0 | v3) > -1 ? -65537 & u3 : u3, s3 = e4 = b3[c3 + 68 >> 2], !(v3 | (0 | (A3 = b3[c3 + 64 >> 2])) != 0 | (0 | e4) != 0)) {
  1480. v3 = 0, l4 = C3;
  1481. break i;
  1482. }
  1483. v3 = (0 | (e4 = !(s3 | A3) + (C3 - l4 | 0) | 0)) < (0 | v3) ? v3 : e4;
  1484. break i;
  1485. }
  1486. y3 = (0 | (e4 = v3)) != 0;
  1487. s: {
  1488. A: {
  1489. l: {
  1490. v:
  1491. if (!(!(3 & (u3 = l4 = (u3 = b3[c3 + 64 >> 2]) || 1071)) | !e4))
  1492. for (; ; ) {
  1493. if (!k3[0 | u3])
  1494. break l;
  1495. if (y3 = (0 | (e4 = e4 - 1 | 0)) != 0, !(3 & (u3 = u3 + 1 | 0)))
  1496. break v;
  1497. if (!e4)
  1498. break;
  1499. }
  1500. if (!y3)
  1501. break A;
  1502. }
  1503. l:
  1504. if (!(!k3[0 | u3] | e4 >>> 0 < 4))
  1505. for (; ; ) {
  1506. if ((-1 ^ (A3 = b3[u3 >> 2])) & A3 - 16843009 & -2139062144)
  1507. break l;
  1508. if (u3 = u3 + 4 | 0, !((e4 = e4 - 4 | 0) >>> 0 > 3))
  1509. break;
  1510. }
  1511. if (e4)
  1512. for (; ; ) {
  1513. if (A3 = u3, !k3[0 | u3])
  1514. break s;
  1515. if (u3 = u3 + 1 | 0, !(e4 = e4 - 1 | 0))
  1516. break;
  1517. }
  1518. }
  1519. A3 = 0;
  1520. }
  1521. y3 = A3 || v3 + l4 | 0, u3 = s3, v3 = A3 ? A3 - l4 | 0 : v3;
  1522. break i;
  1523. }
  1524. if (s3 = b3[c3 + 64 >> 2], v3)
  1525. break k;
  1526. e4 = 0, Dr(r7, 32, d3, 0, u3);
  1527. break b;
  1528. }
  1529. b3[c3 + 12 >> 2] = 0, b3[c3 + 8 >> 2] = b3[c3 + 64 >> 2], b3[c3 + 64 >> 2] = c3 + 8, v3 = -1, s3 = c3 + 8 | 0;
  1530. }
  1531. e4 = 0;
  1532. k: {
  1533. for (; ; ) {
  1534. if (!(l4 = b3[s3 >> 2]))
  1535. break k;
  1536. if (!((A3 = (0 | (l4 = Cr2(c3 + 4 | 0, l4))) < 0) | l4 >>> 0 > v3 - e4 >>> 0)) {
  1537. if (s3 = s3 + 4 | 0, v3 >>> 0 > (e4 = e4 + l4 | 0) >>> 0)
  1538. continue;
  1539. break k;
  1540. }
  1541. break;
  1542. }
  1543. if (w3 = -1, A3)
  1544. break r;
  1545. }
  1546. if (Dr(r7, 32, d3, e4, u3), e4)
  1547. for (s3 = 0, A3 = b3[c3 + 64 >> 2]; ; ) {
  1548. if (!(l4 = b3[A3 >> 2]))
  1549. break b;
  1550. if ((0 | (s3 = (l4 = Cr2(c3 + 4 | 0, l4)) + s3 | 0)) > (0 | e4))
  1551. break b;
  1552. if (yr2(r7, c3 + 4 | 0, l4), A3 = A3 + 4 | 0, !(e4 >>> 0 > s3 >>> 0))
  1553. break;
  1554. }
  1555. else
  1556. e4 = 0;
  1557. }
  1558. Dr(r7, 32, d3, e4, 8192 ^ u3), e4 = (0 | e4) < (0 | d3) ? d3 : e4;
  1559. continue e;
  1560. }
  1561. e4 = 0 | be[0 | t3](r7, h2[c3 + 64 >> 3], d3, v3, u3, e4);
  1562. continue e;
  1563. }
  1564. n4[c3 + 55 | 0] = b3[c3 + 64 >> 2], v3 = 1, l4 = M3, u3 = s3;
  1565. break i;
  1566. }
  1567. s3 = e4 + 1 | 0, b3[c3 + 76 >> 2] = s3, u3 = k3[e4 + 1 | 0], e4 = s3;
  1568. }
  1569. if (w3 = m3, r7)
  1570. break r;
  1571. if (!R3)
  1572. break f;
  1573. for (e4 = 1; ; ) {
  1574. if (r7 = b3[(e4 << 2) + a5 >> 2]) {
  1575. if (hr2((e4 << 3) + i5 | 0, r7, f4), w3 = 1, (0 | (e4 = e4 + 1 | 0)) != 10)
  1576. continue;
  1577. break r;
  1578. }
  1579. break;
  1580. }
  1581. if (w3 = 1, e4 >>> 0 >= 10)
  1582. break r;
  1583. for (; ; ) {
  1584. if (b3[(e4 << 2) + a5 >> 2])
  1585. break a;
  1586. if ((0 | (e4 = e4 + 1 | 0)) == 10)
  1587. break;
  1588. }
  1589. break r;
  1590. }
  1591. w3 = -1;
  1592. break r;
  1593. }
  1594. Dr(r7, 32, e4 = (0 | (s3 = (v3 = (0 | (A3 = y3 - l4 | 0)) > (0 | v3) ? A3 : v3) + w3 | 0)) > (0 | d3) ? s3 : d3, s3, u3), yr2(r7, g3, w3), Dr(r7, 48, e4, s3, 65536 ^ u3), Dr(r7, 48, v3, A3, 0), yr2(r7, l4, A3), Dr(r7, 32, e4, s3, 8192 ^ u3);
  1595. continue;
  1596. }
  1597. break;
  1598. }
  1599. w3 = 0;
  1600. }
  1601. return j2 = c3 + 80 | 0, w3;
  1602. }
  1603. function q2(r7, e4, f4, i5, a5, t3) {
  1604. r7 |= 0, e4 = +e4, f4 |= 0, i5 |= 0, a5 |= 0, t3 |= 0;
  1605. var o4 = 0, c3 = 0, s3 = 0, l4 = 0, v3 = 0, d3 = 0, h3 = 0, w3 = 0, y3 = 0, g3 = 0, E3 = 0, C3 = 0, R3 = 0, M3 = 0, I3 = 0, S3 = 0, _3 = 0, P3 = 0, x3 = 0, L3 = 0, B3 = 0;
  1606. j2 = l4 = j2 - 560 | 0, b3[l4 + 44 >> 2] = 0, A2(+e4), o4 = 0 | u2(1), u2(0), (0 | o4) < -1 || (0 | o4) <= -1 ? (I3 = 1, S3 = 1034, A2(+(e4 = -e4)), o4 = 0 | u2(1), u2(0)) : 2048 & a5 ? (I3 = 1, S3 = 1037) : (S3 = (I3 = 1 & a5) ? 1040 : 1035, B3 = !I3);
  1607. r:
  1608. if ((2146435072 & o4) != 2146435072) {
  1609. R3 = l4 + 16 | 0;
  1610. e: {
  1611. f: {
  1612. i: {
  1613. if (e4 = Ur2(e4, l4 + 44 | 0), (e4 += e4) != 0) {
  1614. if (o4 = b3[l4 + 44 >> 2], b3[l4 + 44 >> 2] = o4 - 1, (0 | (_3 = 32 | t3)) != 97)
  1615. break i;
  1616. break e;
  1617. }
  1618. if ((0 | (_3 = 32 | t3)) == 97)
  1619. break e;
  1620. v3 = b3[l4 + 44 >> 2], h3 = (0 | i5) < 0 ? 6 : i5;
  1621. break f;
  1622. }
  1623. v3 = o4 - 29 | 0, b3[l4 + 44 >> 2] = v3, e4 *= 268435456, h3 = (0 | i5) < 0 ? 6 : i5;
  1624. }
  1625. for (c3 = E3 = (0 | v3) < 0 ? l4 + 48 | 0 : l4 + 336 | 0; o4 = e4 < 4294967296 & e4 >= 0 ? ~~e4 >>> 0 : 0, b3[(i5 = c3) >> 2] = o4, c3 = c3 + 4 | 0, (e4 = 1e9 * (e4 - +(o4 >>> 0))) != 0; )
  1626. ;
  1627. if ((0 | v3) < 1)
  1628. i5 = v3, o4 = c3, s3 = E3;
  1629. else
  1630. for (s3 = E3, i5 = v3; ; ) {
  1631. if (C3 = (0 | i5) < 29 ? i5 : 29, !(s3 >>> 0 > (o4 = c3 - 4 | 0) >>> 0)) {
  1632. for (i5 = C3, y3 = 0; g3 = o4, w3 = 0, x3 = y3, y3 = b3[o4 >> 2], d3 = 31 & i5, (63 & i5) >>> 0 >= 32 ? (L3 = y3 << d3, d3 = 0) : (L3 = (1 << d3) - 1 & y3 >>> 32 - d3, d3 = y3 << d3), w3 = w3 + L3 | 0, w3 = d3 >>> 0 > (y3 = x3 + d3 | 0) >>> 0 ? w3 + 1 | 0 : w3, x3 = g3, g3 = Or2(y3 = sr2(d3 = y3, w3, 1e9), F2, 1e9, 0), b3[x3 >> 2] = d3 - g3, s3 >>> 0 <= (o4 = o4 - 4 | 0) >>> 0; )
  1633. ;
  1634. (i5 = y3) && (b3[(s3 = s3 - 4 | 0) >> 2] = i5);
  1635. }
  1636. for (; s3 >>> 0 < (o4 = c3) >>> 0 && !b3[(c3 = o4 - 4 | 0) >> 2]; )
  1637. ;
  1638. if (i5 = b3[l4 + 44 >> 2] - C3 | 0, b3[l4 + 44 >> 2] = i5, c3 = o4, !((0 | i5) > 0))
  1639. break;
  1640. }
  1641. if (c3 = (h3 + 25 | 0) / 9 | 0, (0 | i5) <= -1)
  1642. for (C3 = c3 + 1 | 0, P3 = (0 | _3) == 102; ; ) {
  1643. y3 = (0 | i5) < -9 ? 9 : 0 - i5 | 0;
  1644. f:
  1645. if (o4 >>> 0 > s3 >>> 0) {
  1646. for (g3 = 1e9 >>> y3 | 0, d3 = -1 << y3 ^ -1, i5 = 0, c3 = s3; x3 = i5, i5 = b3[c3 >> 2], b3[c3 >> 2] = x3 + (i5 >>> y3 | 0), i5 = p2(g3, i5 & d3), (c3 = c3 + 4 | 0) >>> 0 < o4 >>> 0; )
  1647. ;
  1648. if (s3 = b3[s3 >> 2] ? s3 : s3 + 4 | 0, !i5)
  1649. break f;
  1650. b3[o4 >> 2] = i5, o4 = o4 + 4 | 0;
  1651. } else
  1652. s3 = b3[s3 >> 2] ? s3 : s3 + 4 | 0;
  1653. if (i5 = b3[l4 + 44 >> 2] + y3 | 0, b3[l4 + 44 >> 2] = i5, o4 = (0 | C3) < o4 - (c3 = P3 ? E3 : s3) >> 2 ? c3 + (C3 << 2) | 0 : o4, !((0 | i5) < 0))
  1654. break;
  1655. }
  1656. if (c3 = 0, !(o4 >>> 0 <= s3 >>> 0 || (c3 = p2(E3 - s3 >> 2, 9), i5 = 10, (d3 = b3[s3 >> 2]) >>> 0 < 10)))
  1657. for (; c3 = c3 + 1 | 0, d3 >>> 0 >= (i5 = p2(i5, 10)) >>> 0; )
  1658. ;
  1659. if ((0 | (i5 = (h3 - ((0 | _3) == 102 ? 0 : c3) | 0) - ((0 | _3) == 103 & (0 | h3) != 0) | 0)) < (p2(o4 - E3 >> 2, 9) - 9 | 0)) {
  1660. if (w3 = (((d3 = (0 | (g3 = i5 + 9216 | 0)) / 9 | 0) << 2) + ((0 | v3) < 0 ? l4 + 48 | 4 : l4 + 340 | 0) | 0) - 4096 | 0, i5 = 10, (0 | (g3 = g3 - p2(d3, 9) | 0)) <= 7)
  1661. for (; i5 = p2(i5, 10), (0 | (g3 = g3 + 1 | 0)) != 8; )
  1662. ;
  1663. if (C3 = (g3 = b3[w3 >> 2]) - p2(i5, d3 = (g3 >>> 0) / (i5 >>> 0) | 0) | 0, ((0 | (v3 = w3 + 4 | 0)) != (0 | o4) || C3) && (e4 = (0 | o4) == (0 | v3) ? 1 : 1.5, M3 = (v3 = i5 >>> 1 | 0) >>> 0 > C3 >>> 0 ? 0.5 : (0 | v3) == (0 | C3) ? e4 : 1.5, e4 = 1 & d3 ? 9007199254740994 : 9007199254740992, k3[0 | S3] != 45 | B3 || (M3 = -M3, e4 = -e4), v3 = g3 - C3 | 0, b3[w3 >> 2] = v3, e4 + M3 != e4)) {
  1664. if (i5 = i5 + v3 | 0, b3[w3 >> 2] = i5, i5 >>> 0 >= 1e9)
  1665. for (; b3[w3 >> 2] = 0, (w3 = w3 - 4 | 0) >>> 0 < s3 >>> 0 && (b3[(s3 = s3 - 4 | 0) >> 2] = 0), i5 = b3[w3 >> 2] + 1 | 0, b3[w3 >> 2] = i5, i5 >>> 0 > 999999999; )
  1666. ;
  1667. if (c3 = p2(E3 - s3 >> 2, 9), i5 = 10, !((v3 = b3[s3 >> 2]) >>> 0 < 10))
  1668. for (; c3 = c3 + 1 | 0, v3 >>> 0 >= (i5 = p2(i5, 10)) >>> 0; )
  1669. ;
  1670. }
  1671. o4 = (i5 = w3 + 4 | 0) >>> 0 < o4 >>> 0 ? i5 : o4;
  1672. }
  1673. for (; d3 = o4, !(v3 = o4 >>> 0 <= s3 >>> 0) && !b3[(o4 = d3 - 4 | 0) >> 2]; )
  1674. ;
  1675. if ((0 | _3) == 103) {
  1676. if (h3 = ((i5 = (0 | (o4 = h3 || 1)) > (0 | c3) & (0 | c3) > -5) ? -1 ^ c3 : -1) + o4 | 0, t3 = (i5 ? -1 : -2) + t3 | 0, !(y3 = 8 & a5)) {
  1677. if (o4 = -9, !v3 && (v3 = b3[d3 - 4 >> 2]) && (g3 = 10, o4 = 0, !((v3 >>> 0) % 10 | 0))) {
  1678. for (; i5 = o4, o4 = o4 + 1 | 0, !((v3 >>> 0) % ((g3 = p2(g3, 10)) >>> 0) | 0); )
  1679. ;
  1680. o4 = -1 ^ i5;
  1681. }
  1682. i5 = p2(d3 - E3 >> 2, 9), (-33 & t3) != 70 ? (y3 = 0, h3 = (0 | (i5 = (0 | (i5 = ((i5 + c3 | 0) + o4 | 0) - 9 | 0)) > 0 ? i5 : 0)) > (0 | h3) ? h3 : i5) : (y3 = 0, h3 = (0 | (i5 = (0 | (i5 = (i5 + o4 | 0) - 9 | 0)) > 0 ? i5 : 0)) > (0 | h3) ? h3 : i5);
  1683. }
  1684. } else
  1685. y3 = 8 & a5;
  1686. if (C3 = (h3 | y3) != 0, i5 = r7, v3 = f4, (0 | (g3 = -33 & t3)) == 70)
  1687. t3 = (0 | c3) > 0 ? c3 : 0;
  1688. else {
  1689. if ((R3 - (o4 = Br2((o4 = c3 >> 31) + c3 ^ o4, 0, R3)) | 0) <= 1)
  1690. for (; n4[0 | (o4 = o4 - 1 | 0)] = 48, (R3 - o4 | 0) < 2; )
  1691. ;
  1692. n4[0 | (P3 = o4 - 2 | 0)] = t3, n4[o4 - 1 | 0] = (0 | c3) < 0 ? 45 : 43, t3 = R3 - P3 | 0;
  1693. }
  1694. Dr(i5, 32, v3, w3 = 1 + (t3 + (C3 + (h3 + I3 | 0) | 0) | 0) | 0, a5), yr2(r7, S3, I3), Dr(r7, 48, f4, w3, 65536 ^ a5);
  1695. f: {
  1696. i: {
  1697. a: {
  1698. if ((0 | g3) == 70) {
  1699. for (i5 = l4 + 16 | 8, c3 = l4 + 16 | 9, s3 = t3 = s3 >>> 0 > E3 >>> 0 ? E3 : s3; ; ) {
  1700. o4 = Br2(b3[s3 >> 2], 0, c3);
  1701. n:
  1702. if ((0 | t3) == (0 | s3))
  1703. (0 | o4) == (0 | c3) && (n4[l4 + 24 | 0] = 48, o4 = i5);
  1704. else {
  1705. if (l4 + 16 >>> 0 >= o4 >>> 0)
  1706. break n;
  1707. for (; n4[0 | (o4 = o4 - 1 | 0)] = 48, l4 + 16 >>> 0 < o4 >>> 0; )
  1708. ;
  1709. }
  1710. if (yr2(r7, o4, c3 - o4 | 0), !(E3 >>> 0 >= (s3 = s3 + 4 | 0) >>> 0))
  1711. break;
  1712. }
  1713. if (o4 = 0, !C3)
  1714. break i;
  1715. if (yr2(r7, 1069, 1), (0 | h3) < 1 | s3 >>> 0 >= d3 >>> 0)
  1716. break a;
  1717. for (; ; ) {
  1718. if ((o4 = Br2(b3[s3 >> 2], 0, c3)) >>> 0 > l4 + 16 >>> 0)
  1719. for (; n4[0 | (o4 = o4 - 1 | 0)] = 48, l4 + 16 >>> 0 < o4 >>> 0; )
  1720. ;
  1721. if (yr2(r7, o4, (0 | h3) < 9 ? h3 : 9), o4 = h3 - 9 | 0, d3 >>> 0 <= (s3 = s3 + 4 | 0) >>> 0)
  1722. break i;
  1723. if (i5 = (0 | h3) > 9, h3 = o4, !i5)
  1724. break;
  1725. }
  1726. break i;
  1727. }
  1728. n:
  1729. if (!((0 | h3) < 0))
  1730. for (t3 = s3 >>> 0 < d3 >>> 0 ? d3 : s3 + 4 | 0, v3 = l4 + 16 | 9, i5 = l4 + 16 | 8, c3 = s3; ; ) {
  1731. (0 | v3) == (0 | (o4 = Br2(b3[c3 >> 2], 0, v3))) && (n4[l4 + 24 | 0] = 48, o4 = i5);
  1732. t:
  1733. if ((0 | c3) == (0 | s3))
  1734. yr2(r7, o4, 1), o4 = o4 + 1 | 0, !y3 && (0 | h3) <= 0 || yr2(r7, 1069, 1);
  1735. else {
  1736. if (l4 + 16 >>> 0 >= o4 >>> 0)
  1737. break t;
  1738. for (; n4[0 | (o4 = o4 - 1 | 0)] = 48, l4 + 16 >>> 0 < o4 >>> 0; )
  1739. ;
  1740. }
  1741. if (yr2(r7, d3 = o4, (0 | (o4 = v3 - o4 | 0)) < (0 | h3) ? o4 : h3), h3 = h3 - o4 | 0, t3 >>> 0 <= (c3 = c3 + 4 | 0) >>> 0)
  1742. break n;
  1743. if (!((0 | h3) > -1))
  1744. break;
  1745. }
  1746. Dr(r7, 48, h3 + 18 | 0, 18, 0), yr2(r7, P3, R3 - P3 | 0);
  1747. break f;
  1748. }
  1749. o4 = h3;
  1750. }
  1751. Dr(r7, 48, o4 + 9 | 0, 9, 0);
  1752. }
  1753. break r;
  1754. }
  1755. if (E3 = (v3 = 32 & t3) ? S3 + 9 | 0 : S3, !(i5 >>> 0 > 11) && (o4 = 12 - i5 | 0)) {
  1756. for (M3 = 8; M3 *= 16, o4 = o4 - 1 | 0; )
  1757. ;
  1758. e4 = k3[0 | E3] != 45 ? e4 + M3 - M3 : -(M3 + (-e4 - M3));
  1759. }
  1760. for ((0 | R3) == (0 | (o4 = Br2((c3 = (o4 = b3[l4 + 44 >> 2]) >> 31) ^ o4 + c3, 0, R3))) && (n4[l4 + 15 | 0] = 48, o4 = l4 + 15 | 0), h3 = 2 | I3, c3 = b3[l4 + 44 >> 2], n4[0 | (d3 = o4 - 2 | 0)] = t3 + 15, n4[o4 - 1 | 0] = (0 | c3) < 0 ? 45 : 43, o4 = 8 & a5, s3 = l4 + 16 | 0; t3 = s3, y3 = v3, c3 = m2(e4) < 2147483648 ? ~~e4 : -2147483648, n4[0 | s3] = y3 | k3[c3 + 1632 | 0], e4 = 16 * (e4 - +(0 | c3)), !(o4 || (0 | i5) > 0 | e4 != 0) | ((s3 = t3 + 1 | 0) - (l4 + 16 | 0) | 0) != 1 || (n4[t3 + 1 | 0] = 46, s3 = t3 + 2 | 0), e4 != 0; )
  1761. ;
  1762. Dr(t3 = r7, 32, o4 = f4, w3 = (v3 = !i5 | ((s3 - l4 | 0) - 18 | 0) >= (0 | i5) ? (R3 - (d3 + (l4 + 16 | 0) | 0) | 0) + s3 | 0 : 2 + ((i5 + R3 | 0) - d3 | 0) | 0) + h3 | 0, a5), yr2(r7, E3, h3), Dr(r7, 48, f4, w3, 65536 ^ a5), yr2(r7, l4 + 16 | 0, i5 = s3 - (l4 + 16 | 0) | 0), Dr(r7, 48, v3 - ((t3 = i5) + (i5 = R3 - d3 | 0) | 0) | 0, 0, 0), yr2(r7, d3, i5);
  1763. } else
  1764. Dr(r7, 32, f4, w3 = I3 + 3 | 0, -65537 & a5), yr2(r7, S3, I3), i5 = 32 & t3, yr2(r7, e4 != e4 ? i5 ? 1053 : 1061 : i5 ? 1057 : 1065, 3);
  1765. return Dr(r7, 32, f4, w3, 8192 ^ a5), j2 = l4 + 560 | 0, 0 | ((0 | f4) > (0 | w3) ? f4 : w3);
  1766. }
  1767. function z2(r7, e4) {
  1768. var f4 = 0, i5 = 0, a5 = 0, t3 = 0, o4 = 0, u3 = w2(0), c3 = 0, s3 = w2(0), A3 = 0, l4 = 0, v3 = 0;
  1769. j2 = o4 = j2 + -64 | 0, b3[r7 + 72 >> 2] = e4, f4 = a5 = b3[e4 + 8 >> 2];
  1770. r: {
  1771. e: {
  1772. f: {
  1773. for (; ; ) {
  1774. if (i5 = b3[f4 + 24 >> 2])
  1775. break f;
  1776. if ((0 | a5) == (0 | (f4 = b3[f4 + 8 >> 2])))
  1777. break;
  1778. }
  1779. for (b3[o4 >> 2] = b3[a5 + 4 >> 2], a5 = f4 = b3[r7 - -64 >> 2]; a5 = b3[a5 + 4 >> 2], (i5 = b3[a5 >> 2]) && !(0 | be[b3[f4 + 16 >> 2]](b3[f4 + 12 >> 2], o4, i5)); )
  1780. ;
  1781. if (i5 = b3[a5 >> 2], a5 = b3[b3[b3[i5 + 4 >> 2] + 8 >> 2] >> 2], c3 = b3[a5 >> 2], t3 = b3[i5 >> 2], pr2(b3[b3[t3 + 4 >> 2] + 16 >> 2], e4, b3[t3 + 16 >> 2]) == w2(0)) {
  1782. if (u3 = d2[e4 + 28 >> 2], a5 = b3[i5 >> 2], f4 = b3[a5 + 16 >> 2], !(u3 != d2[f4 + 28 >> 2] | d2[f4 + 32 >> 2] != d2[e4 + 32 >> 2])) {
  1783. if (i5 = b3[e4 + 8 >> 2], b3[o4 + 40 >> 2] = 0, b3[o4 + 44 >> 2] = 0, b3[o4 + 32 >> 2] = 0, b3[o4 + 36 >> 2] = 0, e4 = b3[287], b3[o4 + 24 >> 2] = b3[286], b3[o4 + 28 >> 2] = e4, e4 = b3[285], b3[o4 + 16 >> 2] = b3[284], b3[o4 + 20 >> 2] = e4, b3[o4 + 32 >> 2] = b3[f4 + 12 >> 2], b3[o4 + 36 >> 2] = b3[b3[i5 + 16 >> 2] + 12 >> 2], d2[o4 + 52 >> 2] = d2[f4 + 16 >> 2], d2[o4 + 56 >> 2] = d2[f4 + 20 >> 2], d2[o4 + 60 >> 2] = d2[f4 + 24 >> 2], b3[f4 + 12 >> 2] = 0, e4 = f4 + 12 | 0, (0 | (f4 = b3[r7 + 1736 >> 2])) == 8 ? be[b3[r7 + 76 >> 2]](o4 + 52 | 0, o4 + 32 | 0, o4 + 16 | 0, e4) : be[0 | f4](o4 + 52 | 0, o4 + 32 | 0, o4 + 16 | 0, e4, b3[r7 + 1896 >> 2]), b3[e4 >> 2] || (b3[e4 >> 2] = b3[o4 + 32 >> 2]), tr2(a5, i5))
  1784. break e;
  1785. break r;
  1786. }
  1787. if (t3 = b3[a5 + 4 >> 2], f4 = b3[t3 + 16 >> 2], d2[f4 + 32 >> 2] != d2[e4 + 32 >> 2] || u3 != d2[f4 + 28 >> 2]) {
  1788. if (!ir2(t3))
  1789. break r;
  1790. if (k3[i5 + 15 | 0]) {
  1791. if (!rr2(b3[a5 + 8 >> 2]))
  1792. break r;
  1793. n4[i5 + 15 | 0] = 0;
  1794. }
  1795. if (!tr2(b3[e4 + 8 >> 2], a5))
  1796. break r;
  1797. z2(r7, e4);
  1798. break e;
  1799. }
  1800. for (; i5 = b3[b3[b3[i5 + 4 >> 2] + 4 >> 2] >> 2], (0 | f4) == b3[b3[b3[i5 >> 2] + 4 >> 2] + 16 >> 2]; )
  1801. ;
  1802. if (a5 = b3[b3[b3[i5 + 4 >> 2] + 8 >> 2] >> 2], c3 = b3[a5 >> 2], t3 = b3[c3 + 4 >> 2], f4 = b3[t3 + 8 >> 2], k3[a5 + 15 | 0]) {
  1803. if (b3[c3 + 24 >> 2] = 0, Vr(b3[a5 + 4 >> 2]), Y2(a5), !rr2(t3))
  1804. break r;
  1805. t3 = b3[b3[f4 + 4 >> 2] + 12 >> 2];
  1806. }
  1807. if (!tr2(b3[e4 + 8 >> 2], t3))
  1808. break r;
  1809. A3 = b3[t3 + 8 >> 2], t3 = f4, e4 = f4, a5 = b3[b3[f4 + 4 >> 2] + 16 >> 2], u3 = d2[a5 + 28 >> 2], c3 = b3[f4 + 16 >> 2], u3 < (s3 = d2[c3 + 28 >> 2]) | (d2[a5 + 32 >> 2] <= d2[c3 + 32 >> 2] ? u3 == s3 : 0) || (e4 = 0), ar2(r7, i5, A3, t3, e4, 1);
  1810. break e;
  1811. }
  1812. if (l4 = k3[i5 + 12 | 0], c3 = b3[c3 + 4 >> 2], A3 = b3[c3 + 16 >> 2], u3 = d2[A3 + 28 >> 2], v3 = b3[b3[t3 + 4 >> 2] + 16 >> 2], f4 = i5, u3 < (s3 = d2[v3 + 28 >> 2]) || u3 == s3 && (f4 = i5, d2[A3 + 32 >> 2] <= d2[v3 + 32 >> 2]) || (f4 = a5), k3[f4 + 15 | 0] || l4) {
  1813. i: {
  1814. if ((0 | f4) == (0 | i5)) {
  1815. if (a5 = er2(b3[b3[e4 + 8 >> 2] + 4 >> 2], b3[t3 + 12 >> 2]))
  1816. break i;
  1817. break r;
  1818. }
  1819. if (!(a5 = er2(b3[b3[c3 + 8 >> 2] + 4 >> 2], b3[e4 + 8 >> 2])))
  1820. break r;
  1821. a5 = b3[a5 + 4 >> 2];
  1822. }
  1823. if (k3[f4 + 15 | 0]) {
  1824. if (rr2(b3[f4 >> 2])) {
  1825. b3[f4 >> 2] = a5, n4[f4 + 15 | 0] = 0, b3[a5 + 24 >> 2] = f4, z2(r7, e4);
  1826. break e;
  1827. }
  1828. break r;
  1829. }
  1830. if (!(f4 = O2(16)))
  1831. break r;
  1832. if (b3[f4 >> 2] = a5, i5 = Fr2(b3[r7 - -64 >> 2], b3[i5 + 4 >> 2], f4), b3[f4 + 4 >> 2] = i5, !i5)
  1833. break r;
  1834. n4[f4 + 13 | 0] = 0, n4[f4 + 14 | 0] = 0, n4[f4 + 15 | 0] = 0, b3[a5 + 24 >> 2] = f4, t3 = b3[r7 + 56 >> 2], a5 = b3[b3[f4 >> 2] + 28 >> 2] + b3[b3[b3[i5 + 4 >> 2] >> 2] + 8 >> 2] | 0, b3[f4 + 8 >> 2] = a5;
  1835. i: {
  1836. a:
  1837. switch (t3 - 100130 | 0) {
  1838. case 0:
  1839. i5 = 1 & a5;
  1840. break i;
  1841. case 1:
  1842. i5 = (0 | a5) != 0;
  1843. break i;
  1844. case 2:
  1845. i5 = (0 | a5) > 0;
  1846. break i;
  1847. case 3:
  1848. i5 = a5 >>> 31 | 0;
  1849. break i;
  1850. case 4:
  1851. break a;
  1852. default:
  1853. break i;
  1854. }
  1855. i5 = a5 + 1 >>> 0 > 2;
  1856. }
  1857. n4[f4 + 12 | 0] = i5, z2(r7, e4);
  1858. break e;
  1859. }
  1860. ar2(f4 = r7, i5, r7 = b3[e4 + 8 >> 2], r7, 0, 1);
  1861. break e;
  1862. }
  1863. for (e4 = b3[b3[i5 >> 2] + 16 >> 2]; i5 = b3[b3[b3[i5 + 4 >> 2] + 4 >> 2] >> 2], f4 = b3[i5 >> 2], (0 | e4) == b3[f4 + 16 >> 2]; )
  1864. ;
  1865. if (k3[i5 + 15 | 0]) {
  1866. if (!(e4 = er2(b3[b3[b3[b3[b3[i5 + 4 >> 2] + 8 >> 2] >> 2] >> 2] + 4 >> 2], b3[f4 + 12 >> 2])))
  1867. break r;
  1868. if (!rr2(b3[i5 >> 2]))
  1869. break r;
  1870. if (b3[i5 >> 2] = e4, n4[i5 + 15 | 0] = 0, b3[e4 + 24 >> 2] = i5, !(i5 = b3[b3[b3[i5 + 4 >> 2] + 4 >> 2] >> 2]))
  1871. break r;
  1872. }
  1873. if (e4 = b3[b3[b3[i5 + 4 >> 2] + 8 >> 2] >> 2], f4 = b3[e4 >> 2], e4 = wr2(r7, e4, 0), (0 | f4) != (0 | (a5 = b3[e4 + 8 >> 2])))
  1874. ar2(r7, i5, a5, f4, f4, 1);
  1875. else {
  1876. if (a5 = b3[i5 >> 2], A3 = b3[b3[b3[i5 + 4 >> 2] + 8 >> 2] >> 2], c3 = b3[A3 >> 2], b3[b3[a5 + 4 >> 2] + 16 >> 2] != b3[b3[c3 + 4 >> 2] + 16 >> 2] && H2(r7, i5), v3 = 1, t3 = b3[r7 + 72 >> 2], u3 = d2[t3 + 28 >> 2], l4 = b3[a5 + 16 >> 2], !(u3 != d2[l4 + 28 >> 2] | d2[l4 + 32 >> 2] != d2[t3 + 32 >> 2])) {
  1877. if (!tr2(b3[b3[f4 + 4 >> 2] + 12 >> 2], a5))
  1878. break r;
  1879. for (f4 = b3[b3[i5 >> 2] + 16 >> 2]; i5 = b3[b3[b3[i5 + 4 >> 2] + 4 >> 2] >> 2], t3 = b3[i5 >> 2], (0 | f4) == b3[t3 + 16 >> 2]; )
  1880. ;
  1881. if (k3[i5 + 15 | 0]) {
  1882. if (!(f4 = er2(b3[b3[b3[b3[b3[i5 + 4 >> 2] + 8 >> 2] >> 2] >> 2] + 4 >> 2], b3[t3 + 12 >> 2])))
  1883. break r;
  1884. if (!rr2(b3[i5 >> 2]))
  1885. break r;
  1886. if (b3[i5 >> 2] = f4, n4[i5 + 15 | 0] = 0, b3[f4 + 24 >> 2] = i5, !(i5 = b3[b3[b3[i5 + 4 >> 2] + 4 >> 2] >> 2]))
  1887. break r;
  1888. }
  1889. t3 = b3[b3[b3[i5 + 4 >> 2] + 8 >> 2] >> 2], f4 = b3[t3 >> 2], wr2(r7, t3, A3), t3 = b3[r7 + 72 >> 2], u3 = d2[t3 + 28 >> 2], v3 = 0;
  1890. }
  1891. f: {
  1892. if (s3 = u3, l4 = b3[c3 + 16 >> 2], s3 != (u3 = d2[l4 + 28 >> 2]) | d2[l4 + 32 >> 2] != d2[t3 + 32 >> 2]) {
  1893. if (v3)
  1894. break f;
  1895. } else {
  1896. if (!tr2(e4, b3[b3[c3 + 4 >> 2] + 12 >> 2]))
  1897. break r;
  1898. e4 = wr2(r7, A3, 0);
  1899. }
  1900. ar2(r7, i5, b3[e4 + 8 >> 2], f4, f4, 1);
  1901. break e;
  1902. }
  1903. if (f4 = b3[a5 + 16 >> 2], s3 = d2[f4 + 28 >> 2], !(d2[l4 + 32 >> 2] <= d2[f4 + 32 >> 2]) | u3 != s3 && !(s3 > u3) || (a5 = b3[b3[c3 + 4 >> 2] + 12 >> 2]), !(e4 = er2(b3[b3[e4 + 8 >> 2] + 4 >> 2], a5)))
  1904. break r;
  1905. ar2(r7, i5, e4, f4 = b3[e4 + 8 >> 2], f4, 0), n4[b3[b3[e4 + 4 >> 2] + 24 >> 2] + 15 | 0] = 1, X2(r7, i5);
  1906. }
  1907. }
  1908. return void (j2 = o4 - -64 | 0);
  1909. }
  1910. Zr(r7 + 1740 | 0, 1), E2();
  1911. }
  1912. function K2(r7) {
  1913. r7 |= 0;
  1914. var e4 = 0, f4 = 0, i5 = 0, a5 = w2(0), n5 = w2(0), t3 = 0, o4 = 0, k4 = w2(0), u3 = w2(0), c3 = w2(0), s3 = w2(0), A3 = 0, l4 = w2(0), v3 = 0, h3 = w2(0), p3 = w2(0), m3 = w2(0), y3 = w2(0), g3 = w2(0), E3 = w2(0), C3 = w2(0), R3 = 0, M3 = 0, I3 = w2(0), S3 = w2(0), _3 = 0, P3 = 0, x3 = 0, L3 = 0, B3 = 0, T3 = 0, U3 = 0, F3 = 0;
  1915. v3 = b3[r7 + 8 >> 2], e4 = j2 - 80 | 0, n5 = d2[r7 + 16 >> 2], d2[e4 + 8 >> 2] = n5, p3 = d2[r7 + 20 >> 2], d2[e4 + 12 >> 2] = p3, m3 = d2[r7 + 24 >> 2], d2[e4 + 16 >> 2] = m3;
  1916. r:
  1917. if (_3 = n5 == w2(0) & p3 == w2(0) & m3 == w2(0)) {
  1918. if (b3[e4 + 76 >> 2] = -42943038, b3[e4 + 68 >> 2] = -42943038, b3[e4 + 72 >> 2] = -42943038, b3[e4 + 64 >> 2] = 2104540610, b3[e4 + 56 >> 2] = 2104540610, b3[e4 + 60 >> 2] = 2104540610, P3 = (0 | (A3 = b3[v3 >> 2])) == (0 | v3))
  1919. h3 = w2(-19999999867631625e21), k4 = w2(19999999867631625e21), u3 = w2(19999999867631625e21), l4 = w2(-19999999867631625e21), c3 = w2(19999999867631625e21), s3 = w2(-19999999867631625e21);
  1920. else {
  1921. for (y3 = w2(19999999867631625e21), g3 = w2(-19999999867631625e21), E3 = w2(-19999999867631625e21), C3 = w2(19999999867631625e21), I3 = w2(-19999999867631625e21), S3 = w2(19999999867631625e21), h3 = w2(-19999999867631625e21), k4 = w2(19999999867631625e21), s3 = w2(-19999999867631625e21), c3 = w2(19999999867631625e21), l4 = w2(-19999999867631625e21), u3 = w2(19999999867631625e21), f4 = A3; h3 = (i5 = (a5 = d2[f4 + 24 >> 2]) > h3) ? a5 : h3, g3 = i5 ? a5 : g3, k4 = (R3 = a5 < k4) ? a5 : k4, y3 = R3 ? a5 : y3, s3 = (t3 = (a5 = d2[f4 + 20 >> 2]) > s3) ? a5 : s3, E3 = t3 ? a5 : E3, c3 = (M3 = a5 < c3) ? a5 : c3, C3 = M3 ? a5 : C3, l4 = (o4 = (a5 = d2[f4 + 16 >> 2]) > l4) ? a5 : l4, I3 = o4 ? a5 : I3, x3 = o4 ? f4 : x3, u3 = (o4 = a5 < u3) ? a5 : u3, S3 = o4 ? a5 : S3, L3 = o4 ? f4 : L3, B3 = i5 ? f4 : B3, T3 = R3 ? f4 : T3, U3 = t3 ? f4 : U3, F3 = M3 ? f4 : F3, (0 | v3) != (0 | (f4 = b3[f4 >> 2])); )
  1922. ;
  1923. b3[e4 + 20 >> 2] = L3, d2[e4 + 56 >> 2] = S3, d2[e4 + 68 >> 2] = I3, b3[e4 + 32 >> 2] = x3, d2[e4 + 60 >> 2] = C3, b3[e4 + 24 >> 2] = F3, d2[e4 + 72 >> 2] = E3, b3[e4 + 36 >> 2] = U3, d2[e4 + 64 >> 2] = y3, b3[e4 + 28 >> 2] = T3, d2[e4 + 76 >> 2] = g3, b3[e4 + 40 >> 2] = B3;
  1924. }
  1925. if (f4 = 2, i5 = (t3 = w2(s3 - c3) > w2(l4 - u3)) << 2, i5 = w2(h3 - k4) > w2(d2[i5 + (e4 + 68 | 0) >> 2] - d2[i5 + (e4 + 56 | 0) >> 2]) ? 2 : t3, d2[(t3 = i5 << 2) + (e4 + 56 | 0) >> 2] >= d2[t3 + (e4 + 68 | 0) >> 2])
  1926. b3[e4 + 8 >> 2] = 0, b3[e4 + 12 >> 2] = 0;
  1927. else {
  1928. if (f4 = b3[(i5 <<= 2) + (e4 + 20 | 0) >> 2], i5 = b3[i5 + (e4 + 32 | 0) >> 2], g3 = d2[i5 + 16 >> 2], c3 = w2(d2[f4 + 16 >> 2] - g3), d2[e4 + 44 >> 2] = c3, E3 = d2[i5 + 20 >> 2], s3 = w2(d2[f4 + 20 >> 2] - E3), d2[e4 + 48 >> 2] = s3, C3 = d2[i5 + 24 >> 2], a5 = w2(d2[f4 + 24 >> 2] - C3), d2[e4 + 52 >> 2] = a5, !P3) {
  1929. for (y3 = w2(0), f4 = A3; k4 = w2(d2[f4 + 20 >> 2] - E3), u3 = w2(d2[f4 + 16 >> 2] - g3), h3 = w2(w2(c3 * k4) - w2(s3 * u3)), l4 = w2(d2[f4 + 24 >> 2] - C3), k4 = w2(w2(s3 * l4) - w2(a5 * k4)), u3 = w2(w2(a5 * u3) - w2(c3 * l4)), (l4 = w2(w2(h3 * h3) + w2(w2(k4 * k4) + w2(u3 * u3)))) > y3 && (m3 = h3, p3 = u3, y3 = l4, n5 = k4), (0 | v3) != (0 | (f4 = b3[f4 >> 2])); )
  1930. ;
  1931. if (d2[e4 + 16 >> 2] = m3, d2[e4 + 12 >> 2] = p3, d2[e4 + 8 >> 2] = n5, !(y3 <= w2(0)))
  1932. break r;
  1933. }
  1934. b3[e4 + 16 >> 2] = 0, b3[e4 + 8 >> 2] = 0, b3[e4 + 12 >> 2] = 0, f4 = (s3 < w2(0) ? w2(-s3) : s3) > (c3 < w2(0) ? w2(-c3) : c3), n5 = d2[(e4 + 44 | 0) + (f4 << 2) >> 2], f4 = (a5 < w2(0) ? w2(-a5) : a5) > (n5 < w2(0) ? w2(-n5) : n5) ? 2 : f4;
  1935. }
  1936. b3[(e4 + 8 | 0) + (f4 << 2) >> 2] = 1065353216, m3 = d2[e4 + 16 >> 2], n5 = d2[e4 + 8 >> 2], p3 = d2[e4 + 12 >> 2];
  1937. } else
  1938. A3 = b3[v3 >> 2];
  1939. if (i5 = (p3 < w2(0) ? w2(-p3) : p3) > (n5 < w2(0) ? w2(-n5) : n5), n5 = d2[(e4 + 8 | 0) + (i5 << 2) >> 2], f4 = r7 + 28 | 0, i5 = (m3 < w2(0) ? w2(-m3) : m3) > (n5 < w2(0) ? w2(-n5) : n5) ? 2 : i5, b3[f4 + (t3 = i5 << 2) >> 2] = 0, b3[(o4 = (i5 + 1 >>> 0) % 3 << 2) + f4 >> 2] = 1065353216, b3[(i5 = (i5 + 2 >>> 0) % 3 << 2) + f4 >> 2] = 0, b3[(f4 = r7 + 40 | 0) + t3 >> 2] = 0, e4 = d2[t3 + (e4 + 8 | 0) >> 2] > w2(0), d2[f4 + o4 >> 2] = w2(e4 ? -0 : 0), d2[f4 + i5 >> 2] = w2(e4 ? 1 : -1), !(i5 = (0 | v3) == (0 | A3)))
  1940. for (f4 = A3; e4 = b3[f4 + 20 >> 2], b3[f4 + 28 >> 2] = b3[f4 + 16 >> 2], b3[f4 + 32 >> 2] = e4, (0 | v3) != (0 | (f4 = b3[f4 >> 2])); )
  1941. ;
  1942. if (_3 && (0 | (e4 = b3[v3 + 40 >> 2])) != (0 | (t3 = v3 + 40 | 0))) {
  1943. for (n5 = w2(0); ; ) {
  1944. if (o4 = b3[e4 + 8 >> 2], b3[(f4 = o4) + 28 >> 2] >= 1)
  1945. for (; R3 = b3[f4 + 16 >> 2], M3 = b3[b3[f4 + 4 >> 2] + 16 >> 2], n5 = w2(n5 + w2(w2(d2[R3 + 28 >> 2] - d2[M3 + 28 >> 2]) * w2(d2[R3 + 32 >> 2] + d2[M3 + 32 >> 2]))), (0 | o4) != (0 | (f4 = b3[f4 + 12 >> 2])); )
  1946. ;
  1947. if ((0 | t3) == (0 | (e4 = b3[e4 >> 2])))
  1948. break;
  1949. }
  1950. if (n5 < w2(0)) {
  1951. if (!i5)
  1952. for (; d2[A3 + 32 >> 2] = -d2[A3 + 32 >> 2], (0 | (A3 = b3[A3 >> 2])) != (0 | v3); )
  1953. ;
  1954. d2[r7 + 40 >> 2] = -d2[r7 + 40 >> 2], d2[r7 + 44 >> 2] = -d2[r7 + 44 >> 2], d2[r7 + 48 >> 2] = -d2[r7 + 48 >> 2];
  1955. }
  1956. }
  1957. }
  1958. function Y2(r7) {
  1959. var e4 = 0, f4 = 0, i5 = 0, a5 = 0, n5 = 0, t3 = 0, o4 = 0, k4 = 0, u3 = 0;
  1960. r:
  1961. if (r7 |= 0) {
  1962. n5 = (i5 = r7 - 8 | 0) + (r7 = -8 & (e4 = b3[r7 - 4 >> 2])) | 0;
  1963. e:
  1964. if (!(1 & e4)) {
  1965. if (!(3 & e4))
  1966. break r;
  1967. if ((i5 = i5 - (e4 = b3[i5 >> 2]) | 0) >>> 0 < v2[618])
  1968. break r;
  1969. if (r7 = r7 + e4 | 0, b3[619] == (0 | i5)) {
  1970. if ((3 & (e4 = b3[n5 + 4 >> 2])) == 3)
  1971. return b3[616] = r7, b3[n5 + 4 >> 2] = -2 & e4, b3[i5 + 4 >> 2] = 1 | r7, void (b3[r7 + i5 >> 2] = r7);
  1972. } else {
  1973. if (e4 >>> 0 <= 255) {
  1974. if (a5 = b3[i5 + 8 >> 2], e4 = e4 >>> 3 | 0, (0 | (f4 = b3[i5 + 12 >> 2])) == (0 | a5)) {
  1975. k4 = 2456, u3 = b3[614] & Jr(e4), b3[k4 >> 2] = u3;
  1976. break e;
  1977. }
  1978. b3[a5 + 12 >> 2] = f4, b3[f4 + 8 >> 2] = a5;
  1979. break e;
  1980. }
  1981. if (o4 = b3[i5 + 24 >> 2], (0 | i5) == (0 | (e4 = b3[i5 + 12 >> 2])))
  1982. if ((f4 = b3[(a5 = i5 + 20 | 0) >> 2]) || (f4 = b3[(a5 = i5 + 16 | 0) >> 2])) {
  1983. for (; t3 = a5, (f4 = b3[(a5 = (e4 = f4) + 20 | 0) >> 2]) || (a5 = e4 + 16 | 0, f4 = b3[e4 + 16 >> 2]); )
  1984. ;
  1985. b3[t3 >> 2] = 0;
  1986. } else
  1987. e4 = 0;
  1988. else
  1989. f4 = b3[i5 + 8 >> 2], b3[f4 + 12 >> 2] = e4, b3[e4 + 8 >> 2] = f4;
  1990. if (!o4)
  1991. break e;
  1992. a5 = b3[i5 + 28 >> 2];
  1993. f: {
  1994. if (b3[(f4 = 2760 + (a5 << 2) | 0) >> 2] == (0 | i5)) {
  1995. if (b3[f4 >> 2] = e4, e4)
  1996. break f;
  1997. k4 = 2460, u3 = b3[615] & Jr(a5), b3[k4 >> 2] = u3;
  1998. break e;
  1999. }
  2000. if (b3[o4 + (b3[o4 + 16 >> 2] == (0 | i5) ? 16 : 20) >> 2] = e4, !e4)
  2001. break e;
  2002. }
  2003. if (b3[e4 + 24 >> 2] = o4, (f4 = b3[i5 + 16 >> 2]) && (b3[e4 + 16 >> 2] = f4, b3[f4 + 24 >> 2] = e4), !(f4 = b3[i5 + 20 >> 2]))
  2004. break e;
  2005. b3[e4 + 20 >> 2] = f4, b3[f4 + 24 >> 2] = e4;
  2006. }
  2007. }
  2008. if (!(i5 >>> 0 >= n5 >>> 0) && 1 & (e4 = b3[n5 + 4 >> 2])) {
  2009. e: {
  2010. if (!(2 & e4)) {
  2011. if (b3[620] == (0 | n5)) {
  2012. if (b3[620] = i5, r7 = b3[617] + r7 | 0, b3[617] = r7, b3[i5 + 4 >> 2] = 1 | r7, b3[619] != (0 | i5))
  2013. break r;
  2014. return b3[616] = 0, void (b3[619] = 0);
  2015. }
  2016. if (b3[619] == (0 | n5))
  2017. return b3[619] = i5, r7 = b3[616] + r7 | 0, b3[616] = r7, b3[i5 + 4 >> 2] = 1 | r7, void (b3[r7 + i5 >> 2] = r7);
  2018. r7 = (-8 & e4) + r7 | 0;
  2019. f:
  2020. if (e4 >>> 0 <= 255) {
  2021. if (a5 = b3[n5 + 8 >> 2], e4 = e4 >>> 3 | 0, (0 | (f4 = b3[n5 + 12 >> 2])) == (0 | a5)) {
  2022. k4 = 2456, u3 = b3[614] & Jr(e4), b3[k4 >> 2] = u3;
  2023. break f;
  2024. }
  2025. b3[a5 + 12 >> 2] = f4, b3[f4 + 8 >> 2] = a5;
  2026. } else {
  2027. if (o4 = b3[n5 + 24 >> 2], (0 | n5) == (0 | (e4 = b3[n5 + 12 >> 2])))
  2028. if ((f4 = b3[(a5 = n5 + 20 | 0) >> 2]) || (f4 = b3[(a5 = n5 + 16 | 0) >> 2])) {
  2029. for (; t3 = a5, (f4 = b3[(a5 = (e4 = f4) + 20 | 0) >> 2]) || (a5 = e4 + 16 | 0, f4 = b3[e4 + 16 >> 2]); )
  2030. ;
  2031. b3[t3 >> 2] = 0;
  2032. } else
  2033. e4 = 0;
  2034. else
  2035. f4 = b3[n5 + 8 >> 2], b3[f4 + 12 >> 2] = e4, b3[e4 + 8 >> 2] = f4;
  2036. if (o4) {
  2037. a5 = b3[n5 + 28 >> 2];
  2038. i: {
  2039. if (b3[(f4 = 2760 + (a5 << 2) | 0) >> 2] == (0 | n5)) {
  2040. if (b3[f4 >> 2] = e4, e4)
  2041. break i;
  2042. k4 = 2460, u3 = b3[615] & Jr(a5), b3[k4 >> 2] = u3;
  2043. break f;
  2044. }
  2045. if (b3[o4 + (b3[o4 + 16 >> 2] == (0 | n5) ? 16 : 20) >> 2] = e4, !e4)
  2046. break f;
  2047. }
  2048. b3[e4 + 24 >> 2] = o4, (f4 = b3[n5 + 16 >> 2]) && (b3[e4 + 16 >> 2] = f4, b3[f4 + 24 >> 2] = e4), (f4 = b3[n5 + 20 >> 2]) && (b3[e4 + 20 >> 2] = f4, b3[f4 + 24 >> 2] = e4);
  2049. }
  2050. }
  2051. if (b3[i5 + 4 >> 2] = 1 | r7, b3[r7 + i5 >> 2] = r7, b3[619] != (0 | i5))
  2052. break e;
  2053. return void (b3[616] = r7);
  2054. }
  2055. b3[n5 + 4 >> 2] = -2 & e4, b3[i5 + 4 >> 2] = 1 | r7, b3[r7 + i5 >> 2] = r7;
  2056. }
  2057. if (r7 >>> 0 <= 255)
  2058. return e4 = 2496 + ((r7 = r7 >>> 3 | 0) << 3) | 0, (f4 = b3[614]) & (r7 = 1 << r7) ? r7 = b3[e4 + 8 >> 2] : (b3[614] = r7 | f4, r7 = e4), b3[e4 + 8 >> 2] = i5, b3[r7 + 12 >> 2] = i5, b3[i5 + 12 >> 2] = e4, void (b3[i5 + 8 >> 2] = r7);
  2059. a5 = 31, b3[i5 + 16 >> 2] = 0, b3[i5 + 20 >> 2] = 0, r7 >>> 0 <= 16777215 && (e4 = r7 >>> 8 | 0, e4 <<= t3 = e4 + 1048320 >>> 16 & 8, a5 = 28 + ((e4 = ((e4 <<= a5 = e4 + 520192 >>> 16 & 4) << (f4 = e4 + 245760 >>> 16 & 2) >>> 15 | 0) - (f4 | a5 | t3) | 0) << 1 | r7 >>> e4 + 21 & 1) | 0), b3[i5 + 28 >> 2] = a5, t3 = 2760 + (a5 << 2) | 0;
  2060. e: {
  2061. f: {
  2062. if ((f4 = b3[615]) & (e4 = 1 << a5)) {
  2063. for (a5 = r7 << ((0 | a5) == 31 ? 0 : 25 - (a5 >>> 1 | 0) | 0), e4 = b3[t3 >> 2]; ; ) {
  2064. if (f4 = e4, (-8 & b3[e4 + 4 >> 2]) == (0 | r7))
  2065. break f;
  2066. if (e4 = a5 >>> 29 | 0, a5 <<= 1, !(e4 = b3[16 + (t3 = f4 + (4 & e4) | 0) >> 2]))
  2067. break;
  2068. }
  2069. b3[t3 + 16 >> 2] = i5, b3[i5 + 24 >> 2] = f4;
  2070. } else
  2071. b3[615] = e4 | f4, b3[t3 >> 2] = i5, b3[i5 + 24 >> 2] = t3;
  2072. b3[i5 + 12 >> 2] = i5, b3[i5 + 8 >> 2] = i5;
  2073. break e;
  2074. }
  2075. r7 = b3[f4 + 8 >> 2], b3[r7 + 12 >> 2] = i5, b3[f4 + 8 >> 2] = i5, b3[i5 + 24 >> 2] = 0, b3[i5 + 12 >> 2] = f4, b3[i5 + 8 >> 2] = r7;
  2076. }
  2077. r7 = b3[622] - 1 | 0, b3[622] = r7 || -1;
  2078. }
  2079. }
  2080. }
  2081. function N2(r7, e4) {
  2082. e4 |= 0;
  2083. var f4 = 0, i5 = 0, a5 = 0, t3 = 0, o4 = 0, u3 = 0, c3 = 0, s3 = 0, A3 = 0, l4 = 0, v3 = 0, d3 = 0, h3 = 0, p3 = 0, w3 = 0, m3 = 0, y3 = 0;
  2084. if (j2 = u3 = j2 - 16 | 0, b3[84 + (r7 |= 0) >> 2] = 0, (0 | (s3 = b3[e4 + 40 >> 2])) != (0 | (h3 = e4 + 40 | 0)))
  2085. for (e4 = s3; n4[e4 + 20 | 0] = 0, (0 | h3) != (0 | (e4 = b3[e4 >> 2])); )
  2086. ;
  2087. if ((0 | s3) != (0 | h3)) {
  2088. for (; ; ) {
  2089. if (!(k3[s3 + 20 | 0] | !k3[s3 + 21 | 0])) {
  2090. if (o4 = b3[s3 + 8 >> 2], k3[r7 + 80 | 0])
  2091. e4 = 1, f4 = 1;
  2092. else {
  2093. a5 = 0, i5 = 0, e4 = 0, t3 = b3[(f4 = o4) + 20 >> 2];
  2094. r:
  2095. if (k3[t3 + 21 | 0])
  2096. for (; ; ) {
  2097. if (k3[(e4 = t3) + 20 | 0]) {
  2098. e4 = i5;
  2099. break r;
  2100. }
  2101. if (n4[e4 + 20 | 0] = 1, b3[e4 + 16 >> 2] = i5, a5 = a5 + 1 | 0, i5 = e4, f4 = b3[f4 + 8 >> 2], t3 = b3[f4 + 20 >> 2], !k3[t3 + 21 | 0])
  2102. break;
  2103. }
  2104. i5 = b3[o4 + 4 >> 2], t3 = b3[i5 + 20 >> 2];
  2105. r: {
  2106. e:
  2107. if (!k3[t3 + 21 | 0] | k3[t3 + 20 | 0]) {
  2108. if (w3 = o4, !e4)
  2109. break r;
  2110. } else
  2111. for (f4 = e4; ; ) {
  2112. if (n4[(e4 = t3) + 20 | 0] = 1, b3[e4 + 16 >> 2] = f4, a5 = a5 + 1 | 0, w3 = b3[i5 + 12 >> 2], i5 = b3[w3 + 4 >> 2], t3 = b3[i5 + 20 >> 2], !k3[t3 + 21 | 0])
  2113. break e;
  2114. if (f4 = e4, k3[t3 + 20 | 0])
  2115. break;
  2116. }
  2117. for (; n4[e4 + 20 | 0] = 0, e4 = b3[e4 + 16 >> 2]; )
  2118. ;
  2119. }
  2120. m3 = (0 | a5) > 1, t3 = 0, f4 = 0, e4 = 0, v3 = b3[o4 + 12 >> 2], i5 = b3[(c3 = v3) + 20 >> 2];
  2121. r:
  2122. if (k3[i5 + 21 | 0])
  2123. for (; ; ) {
  2124. if (k3[(e4 = i5) + 20 | 0]) {
  2125. e4 = f4;
  2126. break r;
  2127. }
  2128. if (n4[e4 + 20 | 0] = 1, b3[e4 + 16 >> 2] = f4, t3 = t3 + 1 | 0, f4 = e4, c3 = b3[c3 + 8 >> 2], i5 = b3[c3 + 20 >> 2], !k3[i5 + 21 | 0])
  2129. break;
  2130. }
  2131. p3 = m3 ? a5 : 1, i5 = b3[v3 + 4 >> 2], a5 = b3[i5 + 20 >> 2];
  2132. r: {
  2133. e:
  2134. if (!k3[a5 + 21 | 0] | k3[a5 + 20 | 0]) {
  2135. if (!e4)
  2136. break r;
  2137. } else
  2138. for (f4 = e4; ; ) {
  2139. if (n4[(e4 = a5) + 20 | 0] = 1, b3[e4 + 16 >> 2] = f4, t3 = t3 + 1 | 0, v3 = b3[i5 + 12 >> 2], i5 = b3[v3 + 4 >> 2], a5 = b3[i5 + 20 >> 2], !k3[a5 + 21 | 0])
  2140. break e;
  2141. if (f4 = e4, k3[a5 + 20 | 0])
  2142. break;
  2143. }
  2144. for (; n4[e4 + 20 | 0] = 0, e4 = b3[e4 + 16 >> 2]; )
  2145. ;
  2146. }
  2147. y3 = (0 | t3) > (0 | p3), a5 = 0, f4 = 0, e4 = 0, d3 = b3[b3[o4 + 8 >> 2] + 4 >> 2], i5 = b3[(c3 = d3) + 20 >> 2];
  2148. r:
  2149. if (k3[i5 + 21 | 0])
  2150. for (; ; ) {
  2151. if (k3[(e4 = i5) + 20 | 0]) {
  2152. e4 = f4;
  2153. break r;
  2154. }
  2155. if (n4[e4 + 20 | 0] = 1, b3[e4 + 16 >> 2] = f4, a5 = a5 + 1 | 0, f4 = e4, c3 = b3[c3 + 8 >> 2], i5 = b3[c3 + 20 >> 2], !k3[i5 + 21 | 0])
  2156. break;
  2157. }
  2158. A3 = y3 ? t3 : p3, i5 = b3[d3 + 4 >> 2], t3 = b3[i5 + 20 >> 2];
  2159. r: {
  2160. e:
  2161. if (!k3[t3 + 21 | 0] | k3[t3 + 20 | 0]) {
  2162. if (!e4)
  2163. break r;
  2164. } else
  2165. for (f4 = e4; ; ) {
  2166. if (n4[(e4 = t3) + 20 | 0] = 1, b3[e4 + 16 >> 2] = f4, a5 = a5 + 1 | 0, d3 = b3[i5 + 12 >> 2], i5 = b3[d3 + 4 >> 2], t3 = b3[i5 + 20 >> 2], !k3[t3 + 21 | 0])
  2167. break e;
  2168. if (f4 = e4, k3[t3 + 20 | 0])
  2169. break;
  2170. }
  2171. for (; n4[e4 + 20 | 0] = 0, e4 = b3[e4 + 16 >> 2]; )
  2172. ;
  2173. }
  2174. kr2(u3, o4), c3 = b3[u3 + 8 >> 2], p3 = b3[u3 + 4 >> 2], l4 = b3[u3 >> 2], kr2(u3, b3[o4 + 12 >> 2]), t3 = b3[u3 + 8 >> 2], i5 = b3[u3 + 4 >> 2], f4 = b3[u3 >> 2], kr2(u3, b3[b3[o4 + 8 >> 2] + 4 >> 2]), e4 = a5, (0 | (e4 = (l4 = (0 | (e4 = (A3 = (0 | (e4 = (a5 = (0 | a5) > (0 | A3)) ? e4 : A3)) < (0 | l4)) ? l4 : e4)) < (0 | f4)) ? f4 : e4)) >= (0 | (f4 = b3[u3 >> 2])) ? (o4 = l4 ? i5 : A3 ? p3 : a5 ? d3 : y3 ? v3 : m3 ? w3 : o4, f4 = l4 ? t3 : A3 ? c3 : a5 || m3 | y3 ? 2 : 1) : (o4 = b3[u3 + 4 >> 2], e4 = f4, f4 = b3[u3 + 8 >> 2]);
  2175. }
  2176. be[0 | f4](r7, o4, e4);
  2177. }
  2178. if ((0 | h3) == (0 | (s3 = b3[s3 >> 2])))
  2179. break;
  2180. }
  2181. if (a5 = b3[r7 + 84 >> 2]) {
  2182. for ((0 | (e4 = b3[r7 + 1716 >> 2])) == 3 ? be[b3[r7 + 88 >> 2]](4) : be[0 | e4](4, b3[r7 + 1896 >> 2]), t3 = -1; ; ) {
  2183. for (e4 = b3[a5 + 8 >> 2]; k3[r7 + 80 | 0] && (0 | (f4 = !(o4 = k3[b3[b3[e4 + 4 >> 2] + 20 >> 2] + 21 | 0]))) != (0 | t3) && ((0 | (i5 = b3[r7 + 1720 >> 2])) == 4 ? be[b3[r7 + 92 >> 2]](!o4) : be[0 | i5](!o4, b3[r7 + 1896 >> 2]), t3 = f4), (0 | (f4 = b3[r7 + 1724 >> 2])) == 5 ? be[b3[r7 + 96 >> 2]](b3[b3[e4 + 16 >> 2] + 12 >> 2]) : be[0 | f4](b3[b3[e4 + 16 >> 2] + 12 >> 2], b3[r7 + 1896 >> 2]), (0 | (e4 = b3[e4 + 12 >> 2])) != b3[a5 + 8 >> 2]; )
  2184. ;
  2185. if (!(a5 = b3[a5 + 16 >> 2]))
  2186. break;
  2187. }
  2188. (0 | (e4 = b3[r7 + 1728 >> 2])) == 6 ? be[b3[r7 + 100 >> 2]]() : be[0 | e4](b3[r7 + 1896 >> 2]), b3[r7 + 84 >> 2] = 0;
  2189. }
  2190. }
  2191. j2 = u3 + 16 | 0;
  2192. }
  2193. function V2(r7, e4) {
  2194. var f4 = 0, i5 = 0, a5 = 0, n5 = 0, t3 = 0, o4 = 0, k4 = 0, u3 = 0;
  2195. n5 = r7 + e4 | 0;
  2196. r: {
  2197. e:
  2198. if (!(1 & (f4 = b3[r7 + 4 >> 2]))) {
  2199. if (!(3 & f4))
  2200. break r;
  2201. e4 = (f4 = b3[r7 >> 2]) + e4 | 0;
  2202. f: {
  2203. if ((0 | (r7 = r7 - f4 | 0)) != b3[619]) {
  2204. if (f4 >>> 0 <= 255) {
  2205. if (a5 = b3[r7 + 8 >> 2], f4 = f4 >>> 3 | 0, (0 | (i5 = b3[r7 + 12 >> 2])) != (0 | a5))
  2206. break f;
  2207. k4 = 2456, u3 = b3[614] & Jr(f4), b3[k4 >> 2] = u3;
  2208. break e;
  2209. }
  2210. if (o4 = b3[r7 + 24 >> 2], (0 | (f4 = b3[r7 + 12 >> 2])) == (0 | r7))
  2211. if ((i5 = b3[(a5 = r7 + 20 | 0) >> 2]) || (i5 = b3[(a5 = r7 + 16 | 0) >> 2])) {
  2212. for (; t3 = a5, (i5 = b3[(a5 = (f4 = i5) + 20 | 0) >> 2]) || (a5 = f4 + 16 | 0, i5 = b3[f4 + 16 >> 2]); )
  2213. ;
  2214. b3[t3 >> 2] = 0;
  2215. } else
  2216. f4 = 0;
  2217. else
  2218. i5 = b3[r7 + 8 >> 2], b3[i5 + 12 >> 2] = f4, b3[f4 + 8 >> 2] = i5;
  2219. if (!o4)
  2220. break e;
  2221. a5 = b3[r7 + 28 >> 2];
  2222. i: {
  2223. if (b3[(i5 = 2760 + (a5 << 2) | 0) >> 2] == (0 | r7)) {
  2224. if (b3[i5 >> 2] = f4, f4)
  2225. break i;
  2226. k4 = 2460, u3 = b3[615] & Jr(a5), b3[k4 >> 2] = u3;
  2227. break e;
  2228. }
  2229. if (b3[o4 + (b3[o4 + 16 >> 2] == (0 | r7) ? 16 : 20) >> 2] = f4, !f4)
  2230. break e;
  2231. }
  2232. if (b3[f4 + 24 >> 2] = o4, (i5 = b3[r7 + 16 >> 2]) && (b3[f4 + 16 >> 2] = i5, b3[i5 + 24 >> 2] = f4), !(i5 = b3[r7 + 20 >> 2]))
  2233. break e;
  2234. b3[f4 + 20 >> 2] = i5, b3[i5 + 24 >> 2] = f4;
  2235. break e;
  2236. }
  2237. if ((3 & (f4 = b3[n5 + 4 >> 2])) != 3)
  2238. break e;
  2239. return b3[616] = e4, b3[n5 + 4 >> 2] = -2 & f4, b3[r7 + 4 >> 2] = 1 | e4, void (b3[n5 >> 2] = e4);
  2240. }
  2241. b3[a5 + 12 >> 2] = i5, b3[i5 + 8 >> 2] = a5;
  2242. }
  2243. e: {
  2244. if (!(2 & (f4 = b3[n5 + 4 >> 2]))) {
  2245. if (b3[620] == (0 | n5)) {
  2246. if (b3[620] = r7, e4 = b3[617] + e4 | 0, b3[617] = e4, b3[r7 + 4 >> 2] = 1 | e4, b3[619] != (0 | r7))
  2247. break r;
  2248. return b3[616] = 0, void (b3[619] = 0);
  2249. }
  2250. if (b3[619] == (0 | n5))
  2251. return b3[619] = r7, e4 = b3[616] + e4 | 0, b3[616] = e4, b3[r7 + 4 >> 2] = 1 | e4, void (b3[r7 + e4 >> 2] = e4);
  2252. e4 = (-8 & f4) + e4 | 0;
  2253. f:
  2254. if (f4 >>> 0 <= 255) {
  2255. if (a5 = b3[n5 + 8 >> 2], f4 = f4 >>> 3 | 0, (0 | (i5 = b3[n5 + 12 >> 2])) == (0 | a5)) {
  2256. k4 = 2456, u3 = b3[614] & Jr(f4), b3[k4 >> 2] = u3;
  2257. break f;
  2258. }
  2259. b3[a5 + 12 >> 2] = i5, b3[i5 + 8 >> 2] = a5;
  2260. } else {
  2261. if (o4 = b3[n5 + 24 >> 2], (0 | n5) == (0 | (f4 = b3[n5 + 12 >> 2])))
  2262. if ((a5 = b3[(i5 = n5 + 20 | 0) >> 2]) || (a5 = b3[(i5 = n5 + 16 | 0) >> 2])) {
  2263. for (; t3 = i5, (a5 = b3[(i5 = (f4 = a5) + 20 | 0) >> 2]) || (i5 = f4 + 16 | 0, a5 = b3[f4 + 16 >> 2]); )
  2264. ;
  2265. b3[t3 >> 2] = 0;
  2266. } else
  2267. f4 = 0;
  2268. else
  2269. i5 = b3[n5 + 8 >> 2], b3[i5 + 12 >> 2] = f4, b3[f4 + 8 >> 2] = i5;
  2270. if (o4) {
  2271. a5 = b3[n5 + 28 >> 2];
  2272. i: {
  2273. if (b3[(i5 = 2760 + (a5 << 2) | 0) >> 2] == (0 | n5)) {
  2274. if (b3[i5 >> 2] = f4, f4)
  2275. break i;
  2276. k4 = 2460, u3 = b3[615] & Jr(a5), b3[k4 >> 2] = u3;
  2277. break f;
  2278. }
  2279. if (b3[o4 + (b3[o4 + 16 >> 2] == (0 | n5) ? 16 : 20) >> 2] = f4, !f4)
  2280. break f;
  2281. }
  2282. b3[f4 + 24 >> 2] = o4, (i5 = b3[n5 + 16 >> 2]) && (b3[f4 + 16 >> 2] = i5, b3[i5 + 24 >> 2] = f4), (i5 = b3[n5 + 20 >> 2]) && (b3[f4 + 20 >> 2] = i5, b3[i5 + 24 >> 2] = f4);
  2283. }
  2284. }
  2285. if (b3[r7 + 4 >> 2] = 1 | e4, b3[r7 + e4 >> 2] = e4, b3[619] != (0 | r7))
  2286. break e;
  2287. return void (b3[616] = e4);
  2288. }
  2289. b3[n5 + 4 >> 2] = -2 & f4, b3[r7 + 4 >> 2] = 1 | e4, b3[r7 + e4 >> 2] = e4;
  2290. }
  2291. if (e4 >>> 0 <= 255)
  2292. return f4 = 2496 + ((e4 = e4 >>> 3 | 0) << 3) | 0, (i5 = b3[614]) & (e4 = 1 << e4) ? e4 = b3[f4 + 8 >> 2] : (b3[614] = e4 | i5, e4 = f4), b3[f4 + 8 >> 2] = r7, b3[e4 + 12 >> 2] = r7, b3[r7 + 12 >> 2] = f4, void (b3[r7 + 8 >> 2] = e4);
  2293. a5 = 31, b3[r7 + 16 >> 2] = 0, b3[r7 + 20 >> 2] = 0, e4 >>> 0 <= 16777215 && (f4 = e4 >>> 8 | 0, f4 <<= t3 = f4 + 1048320 >>> 16 & 8, a5 = 28 + ((f4 = ((f4 <<= a5 = f4 + 520192 >>> 16 & 4) << (i5 = f4 + 245760 >>> 16 & 2) >>> 15 | 0) - (i5 | a5 | t3) | 0) << 1 | e4 >>> f4 + 21 & 1) | 0), b3[r7 + 28 >> 2] = a5, t3 = 2760 + (a5 << 2) | 0;
  2294. e: {
  2295. if ((i5 = b3[615]) & (f4 = 1 << a5)) {
  2296. for (a5 = e4 << ((0 | a5) == 31 ? 0 : 25 - (a5 >>> 1 | 0) | 0), f4 = b3[t3 >> 2]; ; ) {
  2297. if (i5 = f4, (-8 & b3[f4 + 4 >> 2]) == (0 | e4))
  2298. break e;
  2299. if (f4 = a5 >>> 29 | 0, a5 <<= 1, !(f4 = b3[16 + (t3 = i5 + (4 & f4) | 0) >> 2]))
  2300. break;
  2301. }
  2302. b3[t3 + 16 >> 2] = r7, b3[r7 + 24 >> 2] = i5;
  2303. } else
  2304. b3[615] = f4 | i5, b3[t3 >> 2] = r7, b3[r7 + 24 >> 2] = t3;
  2305. return b3[r7 + 12 >> 2] = r7, void (b3[r7 + 8 >> 2] = r7);
  2306. }
  2307. e4 = b3[i5 + 8 >> 2], b3[e4 + 12 >> 2] = r7, b3[i5 + 8 >> 2] = r7, b3[r7 + 24 >> 2] = 0, b3[r7 + 12 >> 2] = i5, b3[r7 + 8 >> 2] = e4;
  2308. }
  2309. }
  2310. function G2(r7, e4) {
  2311. var f4 = 0, i5 = 0, a5 = 0, t3 = w2(0), o4 = 0, k4 = 0, u3 = w2(0), c3 = 0, s3 = 0, A3 = 0, l4 = 0, v3 = 0, h3 = 0, p3 = 0, m3 = 0, y3 = 0, g3 = 0, C3 = 0, R3 = 0, M3 = 0, I3 = 0;
  2312. j2 = a5 = j2 - 48 | 0;
  2313. r: {
  2314. A3 = b3[e4 >> 2], k4 = b3[A3 + 16 >> 2], u3 = d2[k4 + 28 >> 2], f4 = b3[b3[b3[e4 + 4 >> 2] + 8 >> 2] >> 2], v3 = b3[f4 >> 2], i5 = b3[v3 + 16 >> 2], t3 = d2[i5 + 28 >> 2];
  2315. e: {
  2316. if (!(!(d2[k4 + 32 >> 2] <= d2[i5 + 32 >> 2]) | u3 != t3) || u3 < t3) {
  2317. if (pr2(b3[b3[v3 + 4 >> 2] + 16 >> 2], k4, i5) > w2(0))
  2318. break e;
  2319. if (k4 = b3[A3 + 16 >> 2], i5 = b3[v3 + 16 >> 2], d2[k4 + 32 >> 2] != d2[i5 + 32 >> 2] || d2[k4 + 28 >> 2] != d2[i5 + 28 >> 2]) {
  2320. if (!ir2(b3[v3 + 4 >> 2]))
  2321. break r;
  2322. if (!tr2(A3, b3[b3[v3 + 4 >> 2] + 12 >> 2]))
  2323. break r;
  2324. g3 = 1, n4[f4 + 14 | 0] = 1, n4[e4 + 14 | 0] = 1;
  2325. break e;
  2326. }
  2327. if (g3 = 1, (0 | i5) == (0 | k4))
  2328. break e;
  2329. if (o4 = b3[r7 + 68 >> 2], (0 | (e4 = b3[k4 + 36 >> 2])) >= 0) {
  2330. if (h3 = b3[o4 >> 2], c3 = b3[h3 >> 2], k4 = e4, s3 = b3[h3 + 4 >> 2], e4 = b3[4 + (C3 = s3 + (e4 << 3) | 0) >> 2], y3 = b3[h3 + 8 >> 2], m3 = b3[c3 + (y3 << 2) >> 2], b3[c3 + (e4 << 2) >> 2] = m3, b3[4 + (R3 = (m3 << 3) + s3 | 0) >> 2] = e4, M3 = y3 - 1 | 0, b3[h3 + 8 >> 2] = M3, (0 | e4) < (0 | y3)) {
  2331. f: {
  2332. if ((0 | e4) < 2 || (f4 = b3[(b3[c3 + (e4 << 1 & -4) >> 2] << 3) + s3 >> 2], t3 = d2[f4 + 28 >> 2], p3 = b3[(m3 << 3) + s3 >> 2], t3 < (u3 = d2[p3 + 28 >> 2]) || !(!(d2[f4 + 32 >> 2] <= d2[p3 + 32 >> 2]) | u3 != t3)))
  2333. for (I3 = (m3 << 3) + s3 | 0; ; ) {
  2334. if ((0 | M3) <= (0 | (f4 = e4 << 1)) || (l4 = b3[(b3[c3 + ((i5 = 1 | f4) << 2) >> 2] << 3) + s3 >> 2], u3 = d2[l4 + 28 >> 2], o4 = b3[(b3[c3 + (f4 << 2) >> 2] << 3) + s3 >> 2], t3 = d2[o4 + 28 >> 2], !(d2[l4 + 32 >> 2] <= d2[o4 + 32 >> 2]) | u3 != t3 && !(u3 < t3) || (f4 = i5)), (0 | f4) >= (0 | y3)) {
  2335. f4 = e4;
  2336. break f;
  2337. }
  2338. if (p3 = b3[I3 >> 2], u3 = d2[p3 + 28 >> 2], l4 = b3[c3 + (f4 << 2) >> 2], i5 = b3[(o4 = (l4 << 3) + s3 | 0) >> 2], u3 < (t3 = d2[i5 + 28 >> 2])) {
  2339. f4 = e4;
  2340. break f;
  2341. }
  2342. if (!(!(d2[p3 + 32 >> 2] <= d2[i5 + 32 >> 2]) | u3 != t3)) {
  2343. f4 = e4;
  2344. break f;
  2345. }
  2346. b3[c3 + (e4 << 2) >> 2] = l4, b3[o4 + 4 >> 2] = e4, e4 = f4;
  2347. }
  2348. for (; ; ) {
  2349. if (l4 = b3[c3 + ((f4 = e4 >> 1) << 2) >> 2], i5 = b3[(o4 = (l4 << 3) + s3 | 0) >> 2], (t3 = d2[i5 + 28 >> 2]) < u3) {
  2350. f4 = e4;
  2351. break f;
  2352. }
  2353. if (!(!(d2[i5 + 32 >> 2] <= d2[p3 + 32 >> 2]) | u3 != t3)) {
  2354. f4 = e4;
  2355. break f;
  2356. }
  2357. if (b3[c3 + (e4 << 2) >> 2] = l4, b3[o4 + 4 >> 2] = e4, !((e4 = f4) >>> 0 > 1))
  2358. break;
  2359. }
  2360. }
  2361. b3[c3 + (f4 << 2) >> 2] = m3, b3[R3 + 4 >> 2] = f4;
  2362. }
  2363. b3[C3 >> 2] = 0, b3[C3 + 4 >> 2] = b3[h3 + 16 >> 2], b3[h3 + 16 >> 2] = k4;
  2364. } else {
  2365. b3[b3[o4 + 4 >> 2] + ((-1 ^ e4) << 2) >> 2] = 0;
  2366. f:
  2367. if (!((0 | (e4 = b3[o4 + 12 >> 2])) < 1))
  2368. for (k4 = b3[o4 + 8 >> 2]; ; ) {
  2369. if (b3[b3[k4 + ((f4 = e4 - 1 | 0) << 2) >> 2] >> 2])
  2370. break f;
  2371. if (b3[o4 + 12 >> 2] = f4, i5 = (0 | e4) > 1, e4 = f4, !i5)
  2372. break;
  2373. }
  2374. }
  2375. if (f4 = b3[b3[v3 + 4 >> 2] + 12 >> 2], b3[a5 + 24 >> 2] = 0, b3[a5 + 28 >> 2] = 0, b3[a5 + 16 >> 2] = 0, b3[a5 + 20 >> 2] = 0, e4 = b3[287], b3[a5 + 8 >> 2] = b3[286], b3[a5 + 12 >> 2] = e4, e4 = b3[285], b3[a5 >> 2] = b3[284], b3[a5 + 4 >> 2] = e4, e4 = b3[f4 + 16 >> 2], b3[a5 + 16 >> 2] = b3[e4 + 12 >> 2], b3[a5 + 20 >> 2] = b3[b3[A3 + 16 >> 2] + 12 >> 2], d2[a5 + 36 >> 2] = d2[e4 + 16 >> 2], d2[a5 + 40 >> 2] = d2[e4 + 20 >> 2], d2[a5 + 44 >> 2] = d2[e4 + 24 >> 2], b3[e4 + 12 >> 2] = 0, i5 = e4 + 12 | 0, (0 | (e4 = b3[r7 + 1736 >> 2])) == 8 ? be[b3[r7 + 76 >> 2]](a5 + 36 | 0, a5 + 16 | 0, a5, i5) : be[0 | e4](a5 + 36 | 0, a5 + 16 | 0, a5, i5, b3[r7 + 1896 >> 2]), b3[i5 >> 2] || (b3[i5 >> 2] = b3[a5 + 16 >> 2]), tr2(f4, A3))
  2376. break e;
  2377. break r;
  2378. }
  2379. if (!(pr2(b3[b3[A3 + 4 >> 2] + 16 >> 2], i5, k4) < w2(0))) {
  2380. if (g3 = 1, n4[e4 + 14 | 0] = 1, n4[b3[b3[b3[e4 + 4 >> 2] + 4 >> 2] >> 2] + 14 | 0] = 1, !ir2(b3[A3 + 4 >> 2]))
  2381. break r;
  2382. if (!tr2(b3[b3[v3 + 4 >> 2] + 12 >> 2], A3))
  2383. break r;
  2384. }
  2385. }
  2386. return j2 = a5 + 48 | 0, g3;
  2387. }
  2388. Zr(r7 + 1740 | 0, 1), E2();
  2389. }
  2390. function J2(r7) {
  2391. r7 |= 0;
  2392. var e4 = 0, f4 = 0, i5 = w2(0), a5 = w2(0), n5 = w2(0), t3 = w2(0), o4 = w2(0), u3 = w2(0), c3 = 0, s3 = 0, A3 = 0, l4 = w2(0), v3 = w2(0), h3 = 0, p3 = w2(0), m3 = w2(0), y3 = w2(0), g3 = w2(0), E3 = w2(0), C3 = 0, R3 = 0, M3 = w2(0), I3 = w2(0), S3 = w2(0);
  2393. r: {
  2394. e:
  2395. if (!((0 | (A3 = b3[r7 + 112 >> 2])) < 3)) {
  2396. if (c3 = (R3 = r7 + 116 | 0) + (A3 << 4) | 0, t3 = d2[r7 + 24 >> 2], o4 = d2[r7 + 16 >> 2], u3 = d2[r7 + 20 >> 2], t3 != w2(0) || o4 != w2(0) | u3 != w2(0))
  2397. p3 = d2[r7 + 124 >> 2], n5 = w2(d2[r7 + 140 >> 2] - p3), m3 = d2[r7 + 120 >> 2], l4 = w2(d2[r7 + 136 >> 2] - m3), y3 = d2[r7 + 116 >> 2], v3 = w2(d2[r7 + 132 >> 2] - y3);
  2398. else {
  2399. for (f4 = r7 + 148 | 0, t3 = w2(0), u3 = w2(0), o4 = w2(0), e4 = r7 + 132 | 0, y3 = d2[r7 + 116 >> 2], i5 = v3 = w2(d2[e4 >> 2] - y3), m3 = d2[r7 + 120 >> 2], a5 = l4 = w2(d2[r7 + 136 >> 2] - m3), p3 = d2[r7 + 124 >> 2], g3 = n5 = w2(d2[r7 + 140 >> 2] - p3); E3 = w2(d2[e4 + 20 >> 2] - m3), M3 = w2(d2[f4 >> 2] - y3), I3 = w2(w2(i5 * E3) - w2(a5 * M3)), S3 = w2(d2[e4 + 24 >> 2] - p3), a5 = w2(w2(a5 * S3) - w2(g3 * E3)), i5 = w2(w2(g3 * M3) - w2(i5 * S3)), w2(w2(t3 * I3) + w2(w2(o4 * a5) + w2(u3 * i5))) >= w2(0) ? (u3 = w2(u3 + i5), o4 = w2(o4 + a5), t3 = w2(t3 + I3)) : (u3 = w2(u3 - i5), o4 = w2(o4 - a5), t3 = w2(t3 - I3)), i5 = M3, a5 = E3, g3 = S3, c3 >>> 0 > (f4 = (e4 = f4) + 16 | 0) >>> 0; )
  2400. ;
  2401. if ((0 | A3) < 3)
  2402. break e;
  2403. }
  2404. for (f4 = r7 + 148 | 0, e4 = h3 = r7 + 132 | 0; ; ) {
  2405. i5 = n5, n5 = l4, C3 = e4, a5 = v3, l4 = w2(d2[e4 + 20 >> 2] - m3), v3 = w2(d2[(e4 = f4) >> 2] - y3), E3 = w2(t3 * w2(w2(a5 * l4) - w2(n5 * v3))), g3 = n5, n5 = w2(d2[C3 + 24 >> 2] - p3);
  2406. f:
  2407. if ((i5 = w2(E3 + w2(w2(o4 * w2(w2(g3 * n5) - w2(i5 * l4))) + w2(u3 * w2(w2(i5 * v3) - w2(a5 * n5)))))) != w2(0)) {
  2408. if (i5 > w2(0)) {
  2409. if (f4 = 0, C3 = (0 | s3) < 0, s3 = 1, !C3)
  2410. break f;
  2411. break r;
  2412. }
  2413. if (f4 = 0, C3 = (0 | s3) > 0, s3 = -1, C3)
  2414. break r;
  2415. }
  2416. if (!(c3 >>> 0 > (f4 = e4 + 16 | 0) >>> 0))
  2417. break;
  2418. }
  2419. switch (f4 = 0, 0 | s3) {
  2420. case 2:
  2421. break r;
  2422. case 0:
  2423. break e;
  2424. }
  2425. f4 = 1;
  2426. f: {
  2427. i:
  2428. switch (b3[r7 + 56 >> 2] - 100132 | 0) {
  2429. case 0:
  2430. if ((0 | s3) >= 0)
  2431. break f;
  2432. break e;
  2433. case 2:
  2434. break r;
  2435. case 1:
  2436. break i;
  2437. default:
  2438. break f;
  2439. }
  2440. if ((0 | s3) > 0)
  2441. break e;
  2442. }
  2443. (0 | (e4 = b3[r7 + 1716 >> 2])) == 3 ? be[b3[r7 + 88 >> 2]](k3[r7 + 81 | 0] ? 2 : (0 | A3) < 4 ? 4 : 6) : be[0 | e4](k3[r7 + 81 | 0] ? 2 : (0 | A3) < 4 ? 4 : 6, b3[r7 + 1896 >> 2]), (0 | (e4 = b3[r7 + 1724 >> 2])) == 5 ? be[b3[r7 + 96 >> 2]](b3[r7 + 128 >> 2]) : be[0 | e4](b3[r7 + 128 >> 2], b3[r7 + 1896 >> 2]);
  2444. f:
  2445. if ((0 | s3) <= 0) {
  2446. if (R3 >>> 0 >= (e4 = c3 - 16 | 0) >>> 0)
  2447. break f;
  2448. for (; (0 | (f4 = b3[r7 + 1724 >> 2])) == 5 ? be[b3[r7 + 96 >> 2]](b3[c3 - 4 >> 2]) : be[0 | f4](b3[c3 - 4 >> 2], b3[r7 + 1896 >> 2]), c3 = e4, R3 >>> 0 < (e4 = e4 - 16 | 0) >>> 0; )
  2449. ;
  2450. } else if (!((0 | A3) < 2))
  2451. for (; (0 | (e4 = b3[r7 + 1724 >> 2])) == 5 ? be[b3[r7 + 96 >> 2]](b3[h3 + 12 >> 2]) : be[0 | e4](b3[h3 + 12 >> 2], b3[r7 + 1896 >> 2]), (h3 = h3 + 16 | 0) >>> 0 < c3 >>> 0; )
  2452. ;
  2453. (0 | (e4 = b3[r7 + 1728 >> 2])) == 6 ? be[b3[r7 + 100 >> 2]]() : be[0 | e4](b3[r7 + 1896 >> 2]);
  2454. }
  2455. f4 = 1;
  2456. }
  2457. return 0 | f4;
  2458. }
  2459. function Z2(r7, e4) {
  2460. var f4 = 0, i5 = 0, a5 = 0, n5 = 0, t3 = 0, o4 = 0, k4 = 0, u3 = 0, c3 = 0, s3 = 0, A3 = 0, l4 = 0, v3 = 0;
  2461. if (!r7)
  2462. return O2(e4);
  2463. if (e4 >>> 0 >= 4294967232)
  2464. return b3[613] = 48, 0;
  2465. t3 = e4 >>> 0 < 11 ? 16 : e4 + 11 & -8, a5 = -8 & (u3 = b3[4 + (n5 = r7 - 8 | 0) >> 2]);
  2466. r:
  2467. if (3 & u3) {
  2468. o4 = a5 + n5 | 0;
  2469. e:
  2470. if (a5 >>> 0 >= t3 >>> 0) {
  2471. if ((i5 = a5 - t3 | 0) >>> 0 < 16)
  2472. break e;
  2473. b3[n5 + 4 >> 2] = 1 & u3 | t3 | 2, b3[4 + (f4 = n5 + t3 | 0) >> 2] = 3 | i5, b3[o4 + 4 >> 2] = 1 | b3[o4 + 4 >> 2], V2(f4, i5);
  2474. } else if (b3[620] != (0 | o4))
  2475. if (b3[619] != (0 | o4)) {
  2476. if (2 & (i5 = b3[o4 + 4 >> 2]))
  2477. break r;
  2478. if ((c3 = a5 + (-8 & i5) | 0) >>> 0 < t3 >>> 0)
  2479. break r;
  2480. A3 = c3 - t3 | 0;
  2481. f:
  2482. if (i5 >>> 0 <= 255) {
  2483. if (a5 = b3[o4 + 8 >> 2], f4 = i5 >>> 3 | 0, (0 | (i5 = b3[o4 + 12 >> 2])) == (0 | a5)) {
  2484. l4 = 2456, v3 = b3[614] & Jr(f4), b3[l4 >> 2] = v3;
  2485. break f;
  2486. }
  2487. b3[a5 + 12 >> 2] = i5, b3[i5 + 8 >> 2] = a5;
  2488. } else {
  2489. if (s3 = b3[o4 + 24 >> 2], (0 | (k4 = b3[o4 + 12 >> 2])) == (0 | o4))
  2490. if ((f4 = b3[(a5 = o4 + 20 | 0) >> 2]) || (f4 = b3[(a5 = o4 + 16 | 0) >> 2])) {
  2491. for (; i5 = a5, k4 = f4, (f4 = b3[(a5 = f4 + 20 | 0) >> 2]) || (a5 = k4 + 16 | 0, f4 = b3[k4 + 16 >> 2]); )
  2492. ;
  2493. b3[i5 >> 2] = 0;
  2494. } else
  2495. k4 = 0;
  2496. else
  2497. f4 = b3[o4 + 8 >> 2], b3[f4 + 12 >> 2] = k4, b3[k4 + 8 >> 2] = f4;
  2498. if (s3) {
  2499. i5 = b3[o4 + 28 >> 2];
  2500. i: {
  2501. if (b3[(f4 = 2760 + (i5 << 2) | 0) >> 2] == (0 | o4)) {
  2502. if (b3[f4 >> 2] = k4, k4)
  2503. break i;
  2504. l4 = 2460, v3 = b3[615] & Jr(i5), b3[l4 >> 2] = v3;
  2505. break f;
  2506. }
  2507. if (b3[(b3[s3 + 16 >> 2] == (0 | o4) ? 16 : 20) + s3 >> 2] = k4, !k4)
  2508. break f;
  2509. }
  2510. b3[k4 + 24 >> 2] = s3, (f4 = b3[o4 + 16 >> 2]) && (b3[k4 + 16 >> 2] = f4, b3[f4 + 24 >> 2] = k4), (f4 = b3[o4 + 20 >> 2]) && (b3[k4 + 20 >> 2] = f4, b3[f4 + 24 >> 2] = k4);
  2511. }
  2512. }
  2513. A3 >>> 0 <= 15 ? (b3[n5 + 4 >> 2] = 1 & u3 | c3 | 2, b3[4 + (f4 = n5 + c3 | 0) >> 2] = 1 | b3[f4 + 4 >> 2]) : (b3[n5 + 4 >> 2] = 1 & u3 | t3 | 2, b3[4 + (i5 = n5 + t3 | 0) >> 2] = 3 | A3, b3[4 + (f4 = n5 + c3 | 0) >> 2] = 1 | b3[f4 + 4 >> 2], V2(i5, A3));
  2514. } else {
  2515. if ((i5 = a5 + b3[616] | 0) >>> 0 < t3 >>> 0)
  2516. break r;
  2517. (f4 = i5 - t3 | 0) >>> 0 >= 16 ? (b3[n5 + 4 >> 2] = 1 & u3 | t3 | 2, b3[4 + (a5 = n5 + t3 | 0) >> 2] = 1 | f4, b3[(i5 = i5 + n5 | 0) >> 2] = f4, b3[i5 + 4 >> 2] = -2 & b3[i5 + 4 >> 2]) : (b3[n5 + 4 >> 2] = i5 | 1 & u3 | 2, b3[4 + (f4 = i5 + n5 | 0) >> 2] = 1 | b3[f4 + 4 >> 2], f4 = 0, a5 = 0), b3[619] = a5, b3[616] = f4;
  2518. }
  2519. else {
  2520. if ((a5 = a5 + b3[617] | 0) >>> 0 <= t3 >>> 0)
  2521. break r;
  2522. b3[n5 + 4 >> 2] = 1 & u3 | t3 | 2, f4 = a5 - t3 | 0, b3[4 + (i5 = n5 + t3 | 0) >> 2] = 1 | f4, b3[617] = f4, b3[620] = i5;
  2523. }
  2524. f4 = n5;
  2525. } else {
  2526. if (t3 >>> 0 < 256)
  2527. break r;
  2528. if (a5 >>> 0 >= t3 + 4 >>> 0 && (f4 = n5, a5 - t3 >>> 0 <= b3[734] << 1 >>> 0))
  2529. break r;
  2530. f4 = 0;
  2531. }
  2532. return f4 ? f4 + 8 | 0 : (n5 = O2(e4)) ? (fr2(n5, r7, e4 >>> 0 > (f4 = (3 & (f4 = b3[r7 - 4 >> 2]) ? -4 : -8) + (-8 & f4) | 0) >>> 0 ? f4 : e4), Y2(r7), n5) : 0;
  2533. }
  2534. function X2(r7, e4) {
  2535. var f4 = 0, i5 = 0, a5 = 0, t3 = 0, o4 = 0, u3 = 0, c3 = w2(0), s3 = 0, A3 = w2(0);
  2536. for (i5 = b3[b3[b3[e4 + 4 >> 2] + 8 >> 2] >> 2]; ; ) {
  2537. r: {
  2538. if (k3[i5 + 14 | 0])
  2539. for (; i5 = b3[b3[b3[(e4 = i5) + 4 >> 2] + 8 >> 2] >> 2], k3[i5 + 14 | 0]; )
  2540. ;
  2541. e: {
  2542. f: {
  2543. i: {
  2544. a: {
  2545. if (k3[e4 + 14 | 0])
  2546. f4 = e4;
  2547. else {
  2548. if (!(f4 = b3[b3[b3[e4 + 4 >> 2] + 4 >> 2] >> 2]))
  2549. break a;
  2550. if (i5 = e4, !k3[f4 + 14 | 0])
  2551. break a;
  2552. }
  2553. n4[f4 + 14 | 0] = 0, a5 = b3[f4 >> 2], e4 = b3[b3[a5 + 4 >> 2] + 16 >> 2], o4 = b3[i5 >> 2];
  2554. n:
  2555. if ((0 | e4) != b3[b3[o4 + 4 >> 2] + 16 >> 2]) {
  2556. c3 = d2[e4 + 28 >> 2], s3 = b3[b3[b3[f4 + 4 >> 2] + 8 >> 2] >> 2], t3 = b3[s3 >> 2], u3 = b3[b3[t3 + 4 >> 2] + 16 >> 2], A3 = d2[u3 + 28 >> 2];
  2557. t: {
  2558. if (!(!(d2[e4 + 32 >> 2] <= d2[u3 + 32 >> 2]) | c3 != A3) || c3 < A3) {
  2559. if (pr2(e4, u3, b3[a5 + 16 >> 2]) < w2(0)) {
  2560. e4 = f4;
  2561. break n;
  2562. }
  2563. if (n4[f4 + 14 | 0] = 1, n4[b3[b3[b3[f4 + 4 >> 2] + 4 >> 2] >> 2] + 14 | 0] = 1, !(e4 = ir2(a5)))
  2564. break e;
  2565. if (tr2(b3[t3 + 4 >> 2], e4))
  2566. break t;
  2567. break r;
  2568. }
  2569. if (pr2(u3, e4, b3[t3 + 16 >> 2]) > w2(0)) {
  2570. e4 = f4;
  2571. break n;
  2572. }
  2573. if (n4[s3 + 14 | 0] = 1, n4[f4 + 14 | 0] = 1, !(e4 = ir2(t3)))
  2574. break r;
  2575. if (!tr2(b3[a5 + 12 >> 2], b3[t3 + 4 >> 2]))
  2576. break r;
  2577. e4 = b3[e4 + 4 >> 2];
  2578. }
  2579. if (n4[b3[e4 + 20 >> 2] + 21 | 0] = k3[f4 + 12 | 0], k3[i5 + 15 | 0]) {
  2580. if (b3[b3[i5 >> 2] + 24 >> 2] = 0, Vr(b3[i5 + 4 >> 2]), Y2(i5), !rr2(o4))
  2581. break r;
  2582. i5 = b3[b3[b3[f4 + 4 >> 2] + 8 >> 2] >> 2], o4 = b3[i5 >> 2], e4 = f4;
  2583. } else if (k3[f4 + 15 | 0]) {
  2584. if (b3[b3[f4 >> 2] + 24 >> 2] = 0, Vr(b3[f4 + 4 >> 2]), Y2(f4), !rr2(a5))
  2585. break r;
  2586. e4 = b3[b3[b3[i5 + 4 >> 2] + 4 >> 2] >> 2], a5 = b3[e4 >> 2];
  2587. } else
  2588. e4 = f4;
  2589. } else
  2590. e4 = f4;
  2591. if (b3[a5 + 16 >> 2] == b3[o4 + 16 >> 2])
  2592. break f;
  2593. if (f4 = b3[b3[a5 + 4 >> 2] + 16 >> 2], t3 = b3[b3[o4 + 4 >> 2] + 16 >> 2], k3[i5 + 15 | 0] | k3[e4 + 15 | 0] | (0 | f4) == (0 | t3))
  2594. break i;
  2595. if (u3 = f4, (0 | (f4 = b3[r7 + 72 >> 2])) != (0 | t3) && (0 | u3) != (0 | f4))
  2596. break i;
  2597. if (!H2(r7, e4))
  2598. break f;
  2599. }
  2600. return;
  2601. }
  2602. G2(r7, e4);
  2603. }
  2604. if (b3[a5 + 16 >> 2] != b3[o4 + 16 >> 2])
  2605. continue;
  2606. if (t3 = b3[a5 + 4 >> 2], f4 = b3[o4 + 4 >> 2], b3[t3 + 16 >> 2] != b3[f4 + 16 >> 2])
  2607. continue;
  2608. if (b3[o4 + 28 >> 2] = b3[o4 + 28 >> 2] + b3[a5 + 28 >> 2], b3[f4 + 28 >> 2] = b3[f4 + 28 >> 2] + b3[t3 + 28 >> 2], b3[b3[e4 >> 2] + 24 >> 2] = 0, Vr(b3[e4 + 4 >> 2]), Y2(e4), !rr2(a5))
  2609. break r;
  2610. e4 = b3[b3[b3[i5 + 4 >> 2] + 4 >> 2] >> 2];
  2611. continue;
  2612. }
  2613. }
  2614. break;
  2615. }
  2616. Zr(r7 + 1740 | 0, 1), E2();
  2617. }
  2618. function $2(r7) {
  2619. r7 |= 0;
  2620. var e4 = 0, f4 = 0, i5 = 0, a5 = w2(0), n5 = w2(0), t3 = 0, o4 = 0, u3 = 0, c3 = 0;
  2621. if ((0 | (e4 = b3[r7 + 40 >> 2])) != (0 | (u3 = r7 + 40 | 0)))
  2622. for (; ; ) {
  2623. if (r7 = b3[e4 >> 2], k3[e4 + 21 | 0]) {
  2624. for (e4 = e4 + 8 | 0; e4 = b3[e4 >> 2], f4 = b3[b3[e4 + 4 >> 2] + 16 >> 2], a5 = d2[f4 + 28 >> 2], i5 = b3[e4 + 16 >> 2], n5 = d2[i5 + 28 >> 2], !(!(d2[f4 + 32 >> 2] <= d2[i5 + 32 >> 2]) | a5 != n5) || a5 < n5; )
  2625. e4 = b3[e4 + 8 >> 2] + 4 | 0;
  2626. for (; !(!(d2[i5 + 32 >> 2] <= d2[f4 + 32 >> 2]) | a5 != n5) || a5 > n5; )
  2627. e4 = b3[e4 + 12 >> 2], i5 = b3[e4 + 16 >> 2], n5 = d2[i5 + 28 >> 2], f4 = b3[b3[e4 + 4 >> 2] + 16 >> 2], a5 = d2[f4 + 28 >> 2];
  2628. r: {
  2629. e:
  2630. if ((0 | (i5 = b3[b3[e4 + 8 >> 2] + 4 >> 2])) != b3[e4 + 12 >> 2])
  2631. for (; ; ) {
  2632. if (t3 = b3[i5 + 16 >> 2], n5 = d2[t3 + 28 >> 2], !(d2[f4 + 32 >> 2] <= d2[t3 + 32 >> 2]) | a5 != n5 && !(n5 > a5)) {
  2633. f:
  2634. if (b3[i5 + 12 >> 2] != (0 | e4))
  2635. for (; ; ) {
  2636. if (f4 = b3[b3[e4 + 8 >> 2] + 4 >> 2], t3 = b3[f4 + 16 >> 2], a5 = d2[t3 + 28 >> 2], o4 = b3[b3[f4 + 4 >> 2] + 16 >> 2], !(a5 < (n5 = d2[o4 + 28 >> 2]) | (d2[t3 + 32 >> 2] <= d2[o4 + 32 >> 2] ? a5 == n5 : 0))) {
  2637. if (!(pr2(b3[b3[e4 + 4 >> 2] + 16 >> 2], b3[e4 + 16 >> 2], t3) >= w2(0)))
  2638. break f;
  2639. f4 = b3[b3[e4 + 8 >> 2] + 4 >> 2];
  2640. }
  2641. if (e4 = er2(e4, f4), f4 = 0, !e4)
  2642. break r;
  2643. if ((0 | (e4 = b3[e4 + 4 >> 2])) == b3[i5 + 12 >> 2])
  2644. break;
  2645. }
  2646. e4 = b3[e4 + 12 >> 2];
  2647. } else {
  2648. f:
  2649. if ((0 | (f4 = b3[i5 + 12 >> 2])) != (0 | e4))
  2650. for (t3 = i5 + 12 | 0; ; ) {
  2651. if (o4 = b3[b3[f4 + 4 >> 2] + 16 >> 2], a5 = d2[o4 + 28 >> 2], c3 = b3[f4 + 16 >> 2], !(a5 < (n5 = d2[c3 + 28 >> 2]) | (d2[o4 + 32 >> 2] <= d2[c3 + 32 >> 2] ? a5 == n5 : 0))) {
  2652. if (!(pr2(b3[i5 + 16 >> 2], b3[b3[i5 + 4 >> 2] + 16 >> 2], o4) <= w2(0)))
  2653. break f;
  2654. f4 = b3[t3 >> 2];
  2655. }
  2656. if (i5 = er2(f4, i5), f4 = 0, !i5)
  2657. break r;
  2658. if (t3 = (i5 = b3[i5 + 4 >> 2]) + 12 | 0, (0 | (f4 = b3[i5 + 12 >> 2])) == (0 | e4))
  2659. break;
  2660. }
  2661. i5 = b3[b3[i5 + 8 >> 2] + 4 >> 2];
  2662. }
  2663. if (b3[e4 + 12 >> 2] == (0 | i5))
  2664. break e;
  2665. f4 = b3[b3[e4 + 4 >> 2] + 16 >> 2], a5 = d2[f4 + 28 >> 2];
  2666. }
  2667. if (f4 = b3[i5 + 12 >> 2], b3[f4 + 12 >> 2] != (0 | e4))
  2668. for (; ; ) {
  2669. if (i5 = er2(f4, i5), f4 = 0, !i5)
  2670. break r;
  2671. if (i5 = b3[i5 + 4 >> 2], f4 = b3[i5 + 12 >> 2], b3[f4 + 12 >> 2] == (0 | e4))
  2672. break;
  2673. }
  2674. f4 = 1;
  2675. }
  2676. if (!f4)
  2677. return 0;
  2678. }
  2679. if ((0 | u3) == (0 | (e4 = r7)))
  2680. break;
  2681. }
  2682. return 1;
  2683. }
  2684. function rr2(r7) {
  2685. var e4 = 0, f4 = 0, i5 = 0, a5 = 0, t3 = 0, o4 = 0;
  2686. if (a5 = b3[r7 + 4 >> 2], (0 | (o4 = b3[a5 + 20 >> 2])) != (0 | (f4 = b3[r7 + 20 >> 2]))) {
  2687. for (e4 = i5 = b3[f4 + 8 >> 2]; b3[e4 + 20 >> 2] = o4, (0 | i5) != (0 | (e4 = b3[e4 + 12 >> 2])); )
  2688. ;
  2689. e4 = b3[f4 >> 2], i5 = b3[f4 + 4 >> 2], b3[e4 + 4 >> 2] = i5, b3[i5 >> 2] = e4, Y2(f4);
  2690. }
  2691. if ((0 | (i5 = b3[r7 + 8 >> 2])) != (0 | r7)) {
  2692. if (t3 = b3[r7 + 4 >> 2], e4 = b3[t3 + 12 >> 2], b3[b3[t3 + 20 >> 2] + 8 >> 2] = e4, b3[b3[r7 + 16 >> 2] + 8 >> 2] = i5, t3 = b3[e4 + 8 >> 2], b3[b3[i5 + 4 >> 2] + 12 >> 2] = e4, b3[b3[t3 + 4 >> 2] + 12 >> 2] = r7, b3[r7 + 8 >> 2] = t3, b3[e4 + 8 >> 2] = i5, (0 | f4) == (0 | o4)) {
  2693. if (!(f4 = O2(24)))
  2694. return 0;
  2695. for (e4 = b3[r7 + 20 >> 2], i5 = b3[e4 + 4 >> 2], b3[f4 + 4 >> 2] = i5, b3[i5 >> 2] = f4, b3[f4 >> 2] = e4, b3[e4 + 4 >> 2] = f4, b3[f4 + 12 >> 2] = 0, b3[f4 + 16 >> 2] = 0, b3[f4 + 8 >> 2] = r7, n4[f4 + 20 | 0] = 0, n4[f4 + 21 | 0] = k3[e4 + 21 | 0], e4 = r7; b3[e4 + 20 >> 2] = f4, (0 | (e4 = b3[e4 + 12 >> 2])) != (0 | r7); )
  2696. ;
  2697. }
  2698. } else {
  2699. for (f4 = b3[r7 + 16 >> 2], e4 = i5 = b3[f4 + 8 >> 2]; b3[e4 + 16 >> 2] = 0, (0 | i5) != (0 | (e4 = b3[e4 + 8 >> 2])); )
  2700. ;
  2701. e4 = b3[f4 >> 2], i5 = b3[f4 + 4 >> 2], b3[e4 + 4 >> 2] = i5, b3[i5 >> 2] = e4, Y2(f4);
  2702. }
  2703. if ((0 | (e4 = b3[a5 + 8 >> 2])) != (0 | a5))
  2704. f4 = b3[b3[a5 + 4 >> 2] + 12 >> 2], b3[b3[r7 + 20 >> 2] + 8 >> 2] = f4, b3[b3[a5 + 16 >> 2] + 8 >> 2] = e4, i5 = b3[f4 + 8 >> 2], b3[b3[e4 + 4 >> 2] + 12 >> 2] = f4, b3[b3[i5 + 4 >> 2] + 12 >> 2] = a5, b3[a5 + 8 >> 2] = i5, b3[f4 + 8 >> 2] = e4;
  2705. else {
  2706. for (f4 = b3[a5 + 16 >> 2], e4 = i5 = b3[f4 + 8 >> 2]; b3[e4 + 16 >> 2] = 0, (0 | i5) != (0 | (e4 = b3[e4 + 8 >> 2])); )
  2707. ;
  2708. for (e4 = b3[f4 >> 2], i5 = b3[f4 + 4 >> 2], b3[e4 + 4 >> 2] = i5, b3[i5 >> 2] = e4, Y2(f4), f4 = b3[a5 + 20 >> 2], e4 = a5 = b3[f4 + 8 >> 2]; b3[e4 + 20 >> 2] = 0, (0 | a5) != (0 | (e4 = b3[e4 + 12 >> 2])); )
  2709. ;
  2710. e4 = b3[f4 >> 2], a5 = b3[f4 + 4 >> 2], b3[e4 + 4 >> 2] = a5, b3[a5 >> 2] = e4, Y2(f4);
  2711. }
  2712. return e4 = b3[r7 + 4 >> 2], e4 = b3[(r7 = r7 >>> 0 > e4 >>> 0 ? e4 : r7) >> 2], f4 = b3[b3[r7 + 4 >> 2] >> 2], b3[b3[e4 + 4 >> 2] >> 2] = f4, b3[b3[f4 + 4 >> 2] >> 2] = e4, Y2(r7), 1;
  2713. }
  2714. function er2(r7, e4) {
  2715. var f4 = 0, i5 = 0, a5 = 0, t3 = 0, o4 = 0, u3 = 0, c3 = 0, s3 = 0;
  2716. if (i5 = 0, f4 = O2(64)) {
  2717. if (u3 = b3[r7 + 4 >> 2], t3 = b3[(i5 = r7 >>> 0 > u3 >>> 0 ? u3 : r7) + 4 >> 2], a5 = b3[t3 >> 2], b3[f4 + 32 >> 2] = a5, b3[b3[a5 + 4 >> 2] >> 2] = f4, b3[f4 >> 2] = i5, o4 = f4 + 32 | 0, b3[t3 >> 2] = o4, b3[f4 + 16 >> 2] = 0, b3[f4 + 20 >> 2] = 0, b3[f4 + 12 >> 2] = o4, b3[f4 + 4 >> 2] = o4, b3[f4 + 24 >> 2] = 0, b3[f4 + 28 >> 2] = 0, b3[f4 + 48 >> 2] = 0, b3[f4 + 52 >> 2] = 0, b3[f4 + 44 >> 2] = f4, b3[f4 + 40 >> 2] = o4, b3[f4 + 36 >> 2] = f4, b3[f4 + 56 >> 2] = 0, b3[f4 + 60 >> 2] = 0, b3[f4 + 8 >> 2] = f4, (0 | (c3 = b3[r7 + 20 >> 2])) != (0 | (t3 = b3[e4 + 20 >> 2]))) {
  2718. for (i5 = a5 = b3[t3 + 8 >> 2]; b3[i5 + 20 >> 2] = c3, (0 | a5) != (0 | (i5 = b3[i5 + 12 >> 2])); )
  2719. ;
  2720. i5 = b3[t3 >> 2], a5 = b3[t3 + 4 >> 2], b3[i5 + 4 >> 2] = a5, b3[a5 >> 2] = i5, Y2(t3), u3 = b3[r7 + 4 >> 2], a5 = b3[f4 + 8 >> 2], i5 = b3[r7 + 20 >> 2];
  2721. } else
  2722. a5 = f4, i5 = t3;
  2723. if (r7 = b3[r7 + 12 >> 2], s3 = b3[r7 + 8 >> 2], b3[b3[a5 + 4 >> 2] + 12 >> 2] = r7, b3[b3[s3 + 4 >> 2] + 12 >> 2] = f4, b3[f4 + 8 >> 2] = s3, b3[r7 + 8 >> 2] = a5, r7 = b3[e4 + 8 >> 2], a5 = b3[f4 + 40 >> 2], b3[b3[a5 + 4 >> 2] + 12 >> 2] = e4, b3[b3[r7 + 4 >> 2] + 12 >> 2] = o4, b3[f4 + 40 >> 2] = r7, b3[e4 + 8 >> 2] = a5, b3[f4 + 16 >> 2] = b3[u3 + 16 >> 2], e4 = b3[e4 + 16 >> 2], r7 = i5, b3[f4 + 52 >> 2] = r7, b3[f4 + 48 >> 2] = e4, b3[f4 + 20 >> 2] = r7, b3[r7 + 8 >> 2] = o4, i5 = f4, (0 | t3) == (0 | c3) && (i5 = 0, e4 = O2(24))) {
  2724. for (i5 = b3[r7 + 4 >> 2], b3[e4 + 4 >> 2] = i5, b3[i5 >> 2] = e4, b3[e4 >> 2] = r7, b3[r7 + 4 >> 2] = e4, b3[e4 + 12 >> 2] = 0, b3[e4 + 16 >> 2] = 0, b3[e4 + 8 >> 2] = f4, n4[e4 + 20 | 0] = 0, n4[e4 + 21 | 0] = k3[r7 + 21 | 0], i5 = f4; b3[i5 + 20 >> 2] = e4, (0 | (i5 = b3[i5 + 12 >> 2])) != (0 | f4); )
  2725. ;
  2726. i5 = f4;
  2727. }
  2728. }
  2729. return i5;
  2730. }
  2731. function fr2(r7, e4, f4) {
  2732. var i5 = 0, a5 = 0;
  2733. if (f4 >>> 0 >= 512)
  2734. U2(0 | r7, 0 | e4, 0 | f4);
  2735. else {
  2736. i5 = r7 + f4 | 0;
  2737. r:
  2738. if (3 & (r7 ^ e4))
  2739. if (i5 >>> 0 < 4)
  2740. f4 = r7;
  2741. else if ((a5 = i5 - 4 | 0) >>> 0 < r7 >>> 0)
  2742. f4 = r7;
  2743. else
  2744. for (f4 = r7; n4[0 | f4] = k3[0 | e4], n4[f4 + 1 | 0] = k3[e4 + 1 | 0], n4[f4 + 2 | 0] = k3[e4 + 2 | 0], n4[f4 + 3 | 0] = k3[e4 + 3 | 0], e4 = e4 + 4 | 0, a5 >>> 0 >= (f4 = f4 + 4 | 0) >>> 0; )
  2745. ;
  2746. else {
  2747. e:
  2748. if (3 & r7)
  2749. if ((0 | f4) < 1)
  2750. f4 = r7;
  2751. else
  2752. for (f4 = r7; ; ) {
  2753. if (n4[0 | f4] = k3[0 | e4], e4 = e4 + 1 | 0, !(3 & (f4 = f4 + 1 | 0)))
  2754. break e;
  2755. if (!(f4 >>> 0 < i5 >>> 0))
  2756. break;
  2757. }
  2758. else
  2759. f4 = r7;
  2760. if (!((r7 = -4 & i5) >>> 0 < 64 || (a5 = r7 + -64 | 0) >>> 0 < f4 >>> 0))
  2761. for (; b3[f4 >> 2] = b3[e4 >> 2], b3[f4 + 4 >> 2] = b3[e4 + 4 >> 2], b3[f4 + 8 >> 2] = b3[e4 + 8 >> 2], b3[f4 + 12 >> 2] = b3[e4 + 12 >> 2], b3[f4 + 16 >> 2] = b3[e4 + 16 >> 2], b3[f4 + 20 >> 2] = b3[e4 + 20 >> 2], b3[f4 + 24 >> 2] = b3[e4 + 24 >> 2], b3[f4 + 28 >> 2] = b3[e4 + 28 >> 2], b3[f4 + 32 >> 2] = b3[e4 + 32 >> 2], b3[f4 + 36 >> 2] = b3[e4 + 36 >> 2], b3[f4 + 40 >> 2] = b3[e4 + 40 >> 2], b3[f4 + 44 >> 2] = b3[e4 + 44 >> 2], b3[f4 + 48 >> 2] = b3[e4 + 48 >> 2], b3[f4 + 52 >> 2] = b3[e4 + 52 >> 2], b3[f4 + 56 >> 2] = b3[e4 + 56 >> 2], b3[f4 + 60 >> 2] = b3[e4 + 60 >> 2], e4 = e4 - -64 | 0, a5 >>> 0 >= (f4 = f4 - -64 | 0) >>> 0; )
  2762. ;
  2763. if (r7 >>> 0 <= f4 >>> 0)
  2764. break r;
  2765. for (; b3[f4 >> 2] = b3[e4 >> 2], e4 = e4 + 4 | 0, r7 >>> 0 > (f4 = f4 + 4 | 0) >>> 0; )
  2766. ;
  2767. }
  2768. if (f4 >>> 0 < i5 >>> 0)
  2769. for (; n4[0 | f4] = k3[0 | e4], e4 = e4 + 1 | 0, (0 | i5) != (0 | (f4 = f4 + 1 | 0)); )
  2770. ;
  2771. }
  2772. }
  2773. function ir2(r7) {
  2774. var e4 = 0, f4 = 0, i5 = 0, a5 = 0, n5 = 0, t3 = 0;
  2775. if (n5 = r7 |= 0, r7 = 0, (e4 = O2(64)) && (i5 = b3[n5 + 4 >> 2], a5 = b3[(f4 = i5 >>> 0 < n5 >>> 0 ? i5 : n5) + 4 >> 2], t3 = b3[a5 >> 2], b3[e4 + 32 >> 2] = t3, b3[b3[t3 + 4 >> 2] >> 2] = e4, b3[e4 >> 2] = f4, f4 = e4 + 32 | 0, b3[a5 >> 2] = f4, b3[e4 + 16 >> 2] = 0, b3[e4 + 20 >> 2] = 0, b3[e4 + 12 >> 2] = f4, b3[e4 + 4 >> 2] = f4, b3[e4 + 24 >> 2] = 0, b3[e4 + 28 >> 2] = 0, b3[e4 + 48 >> 2] = 0, b3[e4 + 52 >> 2] = 0, b3[e4 + 40 >> 2] = f4, b3[e4 + 36 >> 2] = e4, b3[e4 + 56 >> 2] = 0, b3[e4 + 60 >> 2] = 0, b3[e4 + 8 >> 2] = e4, a5 = b3[n5 + 12 >> 2], t3 = b3[a5 + 8 >> 2], b3[e4 + 44 >> 2] = a5, b3[b3[t3 + 4 >> 2] + 12 >> 2] = e4, b3[e4 + 8 >> 2] = t3, b3[a5 + 8 >> 2] = e4, a5 = b3[i5 + 16 >> 2], b3[e4 + 16 >> 2] = a5, i5 = O2(40))) {
  2776. for (r7 = b3[a5 + 4 >> 2], b3[i5 + 4 >> 2] = r7, b3[r7 >> 2] = i5, b3[i5 >> 2] = a5, b3[a5 + 4 >> 2] = i5, b3[i5 + 12 >> 2] = 0, b3[i5 + 8 >> 2] = f4, r7 = f4; b3[r7 + 16 >> 2] = i5, (0 | f4) != (0 | (r7 = b3[r7 + 8 >> 2])); )
  2777. ;
  2778. r7 = b3[n5 + 20 >> 2], b3[e4 + 20 >> 2] = r7, b3[e4 + 52 >> 2] = r7, r7 = e4;
  2779. }
  2780. return r7 ? (e4 = b3[r7 + 4 >> 2], r7 = b3[n5 + 4 >> 2], f4 = b3[b3[r7 + 4 >> 2] + 12 >> 2], i5 = b3[f4 + 8 >> 2], a5 = b3[r7 + 8 >> 2], b3[b3[a5 + 4 >> 2] + 12 >> 2] = f4, b3[b3[i5 + 4 >> 2] + 12 >> 2] = r7, b3[r7 + 8 >> 2] = i5, b3[f4 + 8 >> 2] = a5, f4 = b3[e4 + 8 >> 2], i5 = b3[r7 + 8 >> 2], b3[b3[i5 + 4 >> 2] + 12 >> 2] = e4, b3[b3[f4 + 4 >> 2] + 12 >> 2] = r7, b3[r7 + 8 >> 2] = f4, b3[e4 + 8 >> 2] = i5, b3[r7 + 16 >> 2] = b3[e4 + 16 >> 2], f4 = b3[e4 + 4 >> 2], b3[b3[f4 + 16 >> 2] + 8 >> 2] = f4, b3[f4 + 20 >> 2] = b3[r7 + 20 >> 2], b3[e4 + 28 >> 2] = b3[n5 + 28 >> 2], b3[f4 + 28 >> 2] = b3[r7 + 28 >> 2], 0 | e4) : 0;
  2781. }
  2782. function ar2(r7, e4, f4, i5, a5, t3) {
  2783. var o4 = 0, k4 = 0, u3 = 0, c3 = 0, s3 = 0;
  2784. c3 = e4 + 4 | 0, u3 = r7 - -64 | 0;
  2785. r: {
  2786. for (; ; ) {
  2787. if (k4 = b3[f4 + 4 >> 2], !(o4 = O2(16)))
  2788. break r;
  2789. if (b3[o4 >> 2] = k4, s3 = Fr2(b3[u3 >> 2], b3[e4 + 4 >> 2], o4), b3[o4 + 4 >> 2] = s3, !s3)
  2790. break r;
  2791. if (n4[o4 + 13 | 0] = 0, n4[o4 + 14 | 0] = 0, n4[o4 + 15 | 0] = 0, b3[k4 + 24 >> 2] = o4, (0 | i5) == (0 | (f4 = b3[f4 + 8 >> 2])))
  2792. break;
  2793. }
  2794. if (o4 = b3[b3[b3[e4 + 4 >> 2] + 8 >> 2] >> 2], f4 = b3[b3[o4 >> 2] + 4 >> 2], a5 = a5 || b3[f4 + 8 >> 2], b3[f4 + 16 >> 2] == b3[a5 + 16 >> 2])
  2795. for (u3 = 0; ; ) {
  2796. if (i5 = e4, e4 = o4, (0 | (o4 = a5)) != b3[(a5 = f4) + 8 >> 2]) {
  2797. if (!tr2(b3[b3[a5 + 4 >> 2] + 12 >> 2], a5))
  2798. break r;
  2799. if (!tr2(b3[b3[o4 + 4 >> 2] + 12 >> 2], a5))
  2800. break r;
  2801. }
  2802. k4 = b3[i5 + 8 >> 2] - b3[a5 + 28 >> 2] | 0, b3[e4 + 8 >> 2] = k4;
  2803. e: {
  2804. f:
  2805. switch (b3[r7 + 56 >> 2] - 100130 | 0) {
  2806. case 0:
  2807. f4 = 1 & k4;
  2808. break e;
  2809. case 1:
  2810. f4 = (0 | k4) != 0;
  2811. break e;
  2812. case 2:
  2813. f4 = (0 | k4) > 0;
  2814. break e;
  2815. case 3:
  2816. f4 = k4 >>> 31 | 0;
  2817. break e;
  2818. case 4:
  2819. break f;
  2820. default:
  2821. break e;
  2822. }
  2823. f4 = k4 + 1 >>> 0 > 2;
  2824. }
  2825. if (n4[e4 + 12 | 0] = f4, n4[i5 + 14 | 0] = 1, u3 && G2(r7, i5) && (b3[a5 + 28 >> 2] = b3[a5 + 28 >> 2] + b3[o4 + 28 >> 2], f4 = b3[a5 + 4 >> 2], b3[f4 + 28 >> 2] = b3[f4 + 28 >> 2] + b3[b3[o4 + 4 >> 2] + 28 >> 2], b3[b3[i5 >> 2] + 24 >> 2] = 0, Vr(b3[c3 >> 2]), Y2(i5), !rr2(o4)))
  2826. break r;
  2827. if (c3 = e4 + 4 | 0, u3 = 1, o4 = b3[b3[b3[e4 + 4 >> 2] + 8 >> 2] >> 2], f4 = b3[b3[o4 >> 2] + 4 >> 2], b3[f4 + 16 >> 2] != b3[a5 + 16 >> 2])
  2828. break;
  2829. }
  2830. return n4[e4 + 14 | 0] = 1, void (t3 && X2(r7, e4));
  2831. }
  2832. Zr(r7 + 1740 | 0, 1), E2();
  2833. }
  2834. function nr2(r7) {
  2835. var e4 = 0, f4 = 0, i5 = 0, a5 = 0, n5 = 0, t3 = 0, o4 = 0, u3 = 0, c3 = 0;
  2836. if ((0 | (a5 = b3[40 + (r7 |= 0) >> 2])) != (0 | (o4 = r7 + 40 | 0)))
  2837. for (; ; ) {
  2838. if (c3 = b3[a5 >> 2], !k3[a5 + 21 | 0]) {
  2839. for (u3 = b3[a5 + 8 >> 2], r7 = b3[u3 + 12 >> 2]; ; ) {
  2840. if (b3[r7 + 20 >> 2] = 0, t3 = b3[r7 + 12 >> 2], e4 = b3[r7 + 4 >> 2], !b3[e4 + 20 >> 2]) {
  2841. if (i5 = b3[r7 + 16 >> 2], (0 | (f4 = b3[r7 + 8 >> 2])) != (0 | r7))
  2842. b3[i5 + 8 >> 2] = f4, i5 = b3[e4 + 12 >> 2], n5 = b3[i5 + 8 >> 2], b3[b3[f4 + 4 >> 2] + 12 >> 2] = i5, b3[b3[n5 + 4 >> 2] + 12 >> 2] = r7, b3[r7 + 8 >> 2] = n5, b3[i5 + 8 >> 2] = f4;
  2843. else {
  2844. for (e4 = f4 = b3[i5 + 8 >> 2]; b3[e4 + 16 >> 2] = 0, (0 | f4) != (0 | (e4 = b3[e4 + 8 >> 2])); )
  2845. ;
  2846. e4 = b3[i5 >> 2], f4 = b3[i5 + 4 >> 2], b3[e4 + 4 >> 2] = f4, b3[f4 >> 2] = e4, Y2(i5), e4 = b3[r7 + 4 >> 2];
  2847. }
  2848. if (i5 = b3[e4 + 16 >> 2], (0 | (f4 = b3[e4 + 8 >> 2])) != (0 | e4))
  2849. b3[i5 + 8 >> 2] = f4, i5 = b3[b3[e4 + 4 >> 2] + 12 >> 2], n5 = b3[i5 + 8 >> 2], b3[b3[f4 + 4 >> 2] + 12 >> 2] = i5, b3[b3[n5 + 4 >> 2] + 12 >> 2] = e4, b3[e4 + 8 >> 2] = n5, b3[i5 + 8 >> 2] = f4;
  2850. else {
  2851. for (e4 = f4 = b3[i5 + 8 >> 2]; b3[e4 + 16 >> 2] = 0, (0 | f4) != (0 | (e4 = b3[e4 + 8 >> 2])); )
  2852. ;
  2853. e4 = b3[i5 >> 2], f4 = b3[i5 + 4 >> 2], b3[e4 + 4 >> 2] = f4, b3[f4 >> 2] = e4, Y2(i5), e4 = b3[r7 + 4 >> 2];
  2854. }
  2855. i5 = b3[(e4 = r7 >>> 0 > e4 >>> 0 ? e4 : r7) >> 2], f4 = b3[b3[e4 + 4 >> 2] >> 2], b3[b3[i5 + 4 >> 2] >> 2] = f4, b3[b3[f4 + 4 >> 2] >> 2] = i5, Y2(e4);
  2856. }
  2857. if (e4 = (0 | r7) != (0 | u3), r7 = t3, !e4)
  2858. break;
  2859. }
  2860. r7 = b3[a5 >> 2], t3 = b3[a5 + 4 >> 2], b3[r7 + 4 >> 2] = t3, b3[t3 >> 2] = r7, Y2(a5);
  2861. }
  2862. if ((0 | o4) == (0 | (a5 = c3)))
  2863. break;
  2864. }
  2865. }
  2866. function tr2(r7, e4) {
  2867. var f4 = 0, i5 = 0, a5 = 0, t3 = 0, o4 = 0, u3 = 0;
  2868. if ((0 | (r7 |= 0)) != (0 | (e4 |= 0))) {
  2869. if ((0 | (i5 = b3[e4 + 16 >> 2])) != (0 | (o4 = b3[r7 + 16 >> 2]))) {
  2870. for (f4 = a5 = b3[i5 + 8 >> 2]; b3[f4 + 16 >> 2] = o4, (0 | a5) != (0 | (f4 = b3[f4 + 8 >> 2])); )
  2871. ;
  2872. f4 = b3[i5 >> 2], a5 = b3[i5 + 4 >> 2], b3[f4 + 4 >> 2] = a5, b3[a5 >> 2] = f4, Y2(i5);
  2873. }
  2874. if ((0 | (u3 = b3[r7 + 20 >> 2])) != (0 | (a5 = b3[e4 + 20 >> 2]))) {
  2875. for (f4 = t3 = b3[a5 + 8 >> 2]; b3[f4 + 20 >> 2] = u3, (0 | t3) != (0 | (f4 = b3[f4 + 12 >> 2])); )
  2876. ;
  2877. f4 = b3[a5 >> 2], t3 = b3[a5 + 4 >> 2], b3[f4 + 4 >> 2] = t3, b3[t3 >> 2] = f4, Y2(a5);
  2878. }
  2879. if (f4 = b3[r7 + 8 >> 2], t3 = b3[e4 + 8 >> 2], b3[b3[t3 + 4 >> 2] + 12 >> 2] = r7, b3[b3[f4 + 4 >> 2] + 12 >> 2] = e4, b3[e4 + 8 >> 2] = f4, b3[r7 + 8 >> 2] = t3, (0 | i5) == (0 | o4)) {
  2880. if (!(i5 = O2(40)))
  2881. return 0;
  2882. for (f4 = b3[r7 + 16 >> 2], o4 = b3[f4 + 4 >> 2], b3[i5 + 4 >> 2] = o4, b3[o4 >> 2] = i5, b3[i5 >> 2] = f4, b3[f4 + 4 >> 2] = i5, b3[i5 + 12 >> 2] = 0, b3[i5 + 8 >> 2] = e4, f4 = e4; b3[f4 + 16 >> 2] = i5, (0 | (f4 = b3[f4 + 8 >> 2])) != (0 | e4); )
  2883. ;
  2884. b3[b3[r7 + 16 >> 2] + 8 >> 2] = r7;
  2885. }
  2886. if ((0 | a5) == (0 | u3)) {
  2887. if (!(i5 = O2(24)))
  2888. return 0;
  2889. for (f4 = b3[r7 + 20 >> 2], a5 = b3[f4 + 4 >> 2], b3[i5 + 4 >> 2] = a5, b3[a5 >> 2] = i5, b3[i5 >> 2] = f4, b3[f4 + 4 >> 2] = i5, b3[i5 + 12 >> 2] = 0, b3[i5 + 16 >> 2] = 0, b3[i5 + 8 >> 2] = e4, n4[i5 + 20 | 0] = 0, n4[i5 + 21 | 0] = k3[f4 + 21 | 0], f4 = e4; b3[f4 + 20 >> 2] = i5, (0 | (f4 = b3[f4 + 12 >> 2])) != (0 | e4); )
  2890. ;
  2891. b3[b3[r7 + 20 >> 2] + 8 >> 2] = r7;
  2892. }
  2893. }
  2894. return 1;
  2895. }
  2896. function or2(r7, e4) {
  2897. var f4 = 0, i5 = 0, a5 = 0, n5 = 0, t3 = 0, o4 = 0, k4 = w2(0), u3 = 0, c3 = 0, s3 = w2(0);
  2898. if (b3[r7 + 20 >> 2]) {
  2899. i5 = e4, f4 = b3[r7 >> 2], r7 = b3[f4 + 8 >> 2] + 1 | 0, b3[f4 + 8 >> 2] = r7;
  2900. r: {
  2901. if (!((0 | (e4 = b3[f4 + 12 >> 2])) >= r7 << 1)) {
  2902. if (b3[f4 + 12 >> 2] = e4 << 1, a5 = b3[f4 + 4 >> 2], e4 = Z2(n5 = b3[f4 >> 2], e4 << 3 | 4), b3[f4 >> 2] = e4, !e4) {
  2903. b3[f4 >> 2] = n5, a5 = 2147483647;
  2904. break r;
  2905. }
  2906. if (e4 = Z2(b3[f4 + 4 >> 2], 8 + (b3[f4 + 12 >> 2] << 3) | 0), b3[f4 + 4 >> 2] = e4, !e4) {
  2907. b3[f4 + 4 >> 2] = a5, a5 = 2147483647;
  2908. break r;
  2909. }
  2910. }
  2911. if (n5 = b3[f4 + 4 >> 2], a5 = r7, (e4 = b3[f4 + 16 >> 2]) && (b3[f4 + 16 >> 2] = b3[4 + (n5 + (e4 << 3) | 0) >> 2], a5 = e4), t3 = b3[f4 >> 2], b3[t3 + (r7 << 2) >> 2] = a5, b3[(o4 = n5 + (a5 << 3) | 0) >> 2] = i5, b3[o4 + 4 >> 2] = r7, b3[f4 + 20 >> 2]) {
  2912. e:
  2913. if (r7 >>> 0 < 2)
  2914. e4 = r7;
  2915. else
  2916. for (k4 = d2[i5 + 28 >> 2]; ; ) {
  2917. if (f4 = b3[((e4 = r7 >> 1) << 2) + t3 >> 2], c3 = b3[(u3 = n5 + (f4 << 3) | 0) >> 2], (s3 = d2[c3 + 28 >> 2]) < k4) {
  2918. e4 = r7;
  2919. break e;
  2920. }
  2921. if (!(!(d2[c3 + 32 >> 2] <= d2[i5 + 32 >> 2]) | k4 != s3)) {
  2922. e4 = r7;
  2923. break e;
  2924. }
  2925. if (b3[(r7 << 2) + t3 >> 2] = f4, b3[u3 + 4 >> 2] = r7, !((r7 = e4) >>> 0 > 1))
  2926. break;
  2927. }
  2928. b3[(e4 << 2) + t3 >> 2] = a5, b3[o4 + 4 >> 2] = e4;
  2929. }
  2930. }
  2931. return a5;
  2932. }
  2933. if (i5 = (f4 = b3[r7 + 12 >> 2]) + 1 | 0, b3[r7 + 12 >> 2] = i5, a5 = b3[r7 + 4 >> 2], (0 | (n5 = i5)) < (0 | (i5 = b3[r7 + 16 >> 2])))
  2934. i5 = a5;
  2935. else if (b3[r7 + 16 >> 2] = i5 << 1, i5 = Z2(a5, i5 << 3), b3[r7 + 4 >> 2] = i5, !i5)
  2936. return b3[r7 + 4 >> 2] = a5, 2147483647;
  2937. return b3[(f4 << 2) + i5 >> 2] = e4, -1 ^ f4;
  2938. }
  2939. function br2(r7) {
  2940. r7 |= 0;
  2941. var e4 = 0, f4 = 0, i5 = 0, a5 = 0, t3 = 0, o4 = 0, u3 = 0;
  2942. t3 = O2(40), o4 = O2(40);
  2943. r: {
  2944. if (!(i5 = O2(24)) || !t3 | !o4) {
  2945. if (t3 && Y2(t3), o4 && Y2(o4), !i5)
  2946. break r;
  2947. return Y2(i5), 0;
  2948. }
  2949. if (!(e4 = O2(64)))
  2950. return 0;
  2951. for (f4 = b3[r7 + 68 >> 2], a5 = b3[(f4 = f4 >>> 0 < (a5 = r7 - -64 | 0) >>> 0 ? f4 : a5) + 4 >> 2], u3 = b3[a5 >> 2], b3[e4 + 32 >> 2] = u3, b3[b3[u3 + 4 >> 2] >> 2] = e4, b3[e4 >> 2] = f4, f4 = a5, a5 = e4 + 32 | 0, b3[f4 >> 2] = a5, b3[e4 + 16 >> 2] = 0, b3[e4 + 20 >> 2] = 0, b3[e4 + 12 >> 2] = a5, b3[e4 + 4 >> 2] = a5, b3[e4 + 24 >> 2] = 0, b3[e4 + 28 >> 2] = 0, b3[e4 + 48 >> 2] = 0, b3[e4 + 52 >> 2] = 0, b3[e4 + 44 >> 2] = e4, b3[e4 + 40 >> 2] = a5, b3[e4 + 36 >> 2] = e4, b3[e4 + 56 >> 2] = 0, b3[e4 + 60 >> 2] = 0, b3[e4 + 8 >> 2] = e4, f4 = b3[r7 + 4 >> 2], b3[t3 + 4 >> 2] = f4, b3[f4 >> 2] = t3, b3[t3 + 12 >> 2] = 0, b3[t3 + 8 >> 2] = e4, f4 = e4; b3[f4 + 16 >> 2] = t3, (0 | (f4 = b3[f4 + 8 >> 2])) != (0 | e4); )
  2952. ;
  2953. for (b3[o4 + 4 >> 2] = t3, b3[t3 >> 2] = o4, b3[o4 >> 2] = r7, b3[r7 + 4 >> 2] = o4, b3[o4 + 12 >> 2] = 0, b3[o4 + 8 >> 2] = a5, f4 = a5; b3[f4 + 16 >> 2] = o4, (0 | a5) != (0 | (f4 = b3[f4 + 8 >> 2])); )
  2954. ;
  2955. for (f4 = b3[r7 + 44 >> 2], b3[i5 + 4 >> 2] = f4, b3[f4 >> 2] = i5, b3[i5 >> 2] = r7 + 40, b3[r7 + 44 >> 2] = i5, b3[i5 + 12 >> 2] = 0, b3[i5 + 16 >> 2] = 0, b3[i5 + 8 >> 2] = e4, n4[i5 + 20 | 0] = 0, n4[i5 + 21 | 0] = k3[r7 + 61 | 0], f4 = e4; b3[f4 + 20 >> 2] = i5, (0 | (f4 = b3[f4 + 12 >> 2])) != (0 | e4); )
  2956. ;
  2957. }
  2958. return 0 | e4;
  2959. }
  2960. function kr2(r7, e4) {
  2961. var f4 = 0, i5 = 0, a5 = 0, t3 = 0, o4 = 0, u3 = 0;
  2962. b3[r7 + 8 >> 2] = b3[283], f4 = b3[282], b3[r7 >> 2] = b3[281], b3[r7 + 4 >> 2] = f4, f4 = b3[e4 + 20 >> 2];
  2963. r:
  2964. if (k3[f4 + 21 | 0]) {
  2965. a5 = e4;
  2966. e: {
  2967. f: {
  2968. for (; ; ) {
  2969. if (k3[f4 + 20 | 0])
  2970. break r;
  2971. if (n4[f4 + 20 | 0] = 1, b3[f4 + 16 >> 2] = i5, a5 = b3[b3[a5 + 12 >> 2] + 4 >> 2], i5 = b3[a5 + 20 >> 2], k3[i5 + 21 | 0]) {
  2972. if (k3[i5 + 20 | 0])
  2973. break f;
  2974. if (n4[i5 + 20 | 0] = 1, b3[i5 + 16 >> 2] = f4, t3 = t3 + 2 | 0, a5 = b3[a5 + 8 >> 2], f4 = b3[a5 + 20 >> 2], k3[f4 + 21 | 0])
  2975. continue;
  2976. break r;
  2977. }
  2978. break;
  2979. }
  2980. t3 |= 1;
  2981. break e;
  2982. }
  2983. t3 |= 1;
  2984. }
  2985. i5 = f4;
  2986. } else
  2987. a5 = e4;
  2988. o4 = b3[e4 + 4 >> 2], f4 = b3[o4 + 20 >> 2];
  2989. r:
  2990. if (!(!k3[f4 + 21 | 0] | k3[f4 + 20 | 0])) {
  2991. e: {
  2992. f: {
  2993. for (; ; ) {
  2994. if (n4[f4 + 20 | 0] = 1, b3[f4 + 16 >> 2] = i5, e4 = b3[o4 + 12 >> 2], o4 = b3[e4 + 4 >> 2], i5 = b3[o4 + 20 >> 2], k3[i5 + 21 | 0]) {
  2995. if (k3[i5 + 20 | 0])
  2996. break f;
  2997. if (n4[i5 + 20 | 0] = 1, b3[i5 + 16 >> 2] = f4, u3 = u3 + 2 | 0, e4 = b3[b3[o4 + 8 >> 2] + 4 >> 2], o4 = b3[e4 + 4 >> 2], f4 = b3[o4 + 20 >> 2], !k3[f4 + 21 | 0])
  2998. break r;
  2999. if (!k3[f4 + 20 | 0])
  3000. continue;
  3001. break r;
  3002. }
  3003. break;
  3004. }
  3005. u3 |= 1;
  3006. break e;
  3007. }
  3008. u3 |= 1;
  3009. }
  3010. i5 = f4;
  3011. }
  3012. f4 = t3 + u3 | 0, b3[r7 >> 2] = f4;
  3013. r: {
  3014. if (1 & t3) {
  3015. if (!(1 & u3))
  3016. break r;
  3017. b3[r7 >> 2] = f4 - 1, e4 = e4 + 8 | 0;
  3018. } else
  3019. e4 = a5 + 4 | 0;
  3020. e4 = b3[e4 >> 2];
  3021. }
  3022. if (b3[r7 + 4 >> 2] = e4, i5)
  3023. for (; n4[i5 + 20 | 0] = 0, i5 = b3[i5 + 16 >> 2]; )
  3024. ;
  3025. }
  3026. function ur2(r7, e4, f4) {
  3027. e4 |= 0, f4 |= 0, (0 | (f4 = b3[1716 + (r7 |= 0) >> 2])) == 3 ? be[b3[r7 + 88 >> 2]](5) : be[0 | f4](5, b3[r7 + 1896 >> 2]), (0 | (f4 = b3[r7 + 1724 >> 2])) == 5 ? be[b3[r7 + 96 >> 2]](b3[b3[e4 + 16 >> 2] + 12 >> 2]) : be[0 | f4](b3[b3[e4 + 16 >> 2] + 12 >> 2], b3[r7 + 1896 >> 2]), (0 | (f4 = b3[r7 + 1724 >> 2])) == 5 ? be[b3[r7 + 96 >> 2]](b3[b3[b3[e4 + 4 >> 2] + 16 >> 2] + 12 >> 2]) : be[0 | f4](b3[b3[b3[e4 + 4 >> 2] + 16 >> 2] + 12 >> 2], b3[r7 + 1896 >> 2]), f4 = b3[e4 + 20 >> 2];
  3028. r:
  3029. if (k3[f4 + 21 | 0])
  3030. for (; ; ) {
  3031. if (k3[f4 + 20 | 0])
  3032. break r;
  3033. if (n4[f4 + 20 | 0] = 1, e4 = b3[b3[e4 + 12 >> 2] + 4 >> 2], (0 | (f4 = b3[r7 + 1724 >> 2])) == 5 ? be[b3[r7 + 96 >> 2]](b3[b3[e4 + 16 >> 2] + 12 >> 2]) : be[0 | f4](b3[b3[e4 + 16 >> 2] + 12 >> 2], b3[r7 + 1896 >> 2]), f4 = b3[e4 + 20 >> 2], !k3[f4 + 21 | 0] | k3[f4 + 20 | 0])
  3034. break r;
  3035. if (n4[f4 + 20 | 0] = 1, e4 = b3[e4 + 8 >> 2], (0 | (f4 = b3[r7 + 1724 >> 2])) == 5 ? be[b3[r7 + 96 >> 2]](b3[b3[b3[e4 + 4 >> 2] + 16 >> 2] + 12 >> 2]) : be[0 | f4](b3[b3[b3[e4 + 4 >> 2] + 16 >> 2] + 12 >> 2], b3[r7 + 1896 >> 2]), f4 = b3[e4 + 20 >> 2], !k3[f4 + 21 | 0])
  3036. break;
  3037. }
  3038. (0 | (e4 = b3[r7 + 1728 >> 2])) == 6 ? be[b3[r7 + 100 >> 2]]() : be[0 | e4](b3[r7 + 1896 >> 2]);
  3039. }
  3040. function cr2(r7, e4) {
  3041. e4 |= 0;
  3042. var f4 = 0;
  3043. if ((0 | (f4 = b3[(r7 |= 0) >> 2])) != (0 | e4))
  3044. for (; ; ) {
  3045. r:
  3046. if (e4 >>> 0 > f4 >>> 0) {
  3047. e:
  3048. switch (0 | f4) {
  3049. case 0:
  3050. (0 | (f4 = b3[r7 + 1732 >> 2])) == 11 ? be[b3[r7 + 12 >> 2]](100151) : be[0 | f4](100151, b3[r7 + 1896 >> 2]), b3[r7 >> 2] && cr2(r7, 0), b3[r7 + 112 >> 2] = 0, f4 = 1, b3[r7 >> 2] = 1, n4[r7 + 108 | 0] = 0, b3[r7 + 1896 >> 2] = 0, b3[r7 + 8 >> 2] = 0;
  3051. break r;
  3052. case 1:
  3053. break e;
  3054. default:
  3055. break r;
  3056. }
  3057. if ((0 | (f4 = b3[r7 + 1732 >> 2])) == 11 ? be[b3[r7 + 12 >> 2]](100152) : be[0 | f4](100152, b3[r7 + 1896 >> 2]), b3[r7 >> 2] != 1 && cr2(r7, 1), b3[r7 >> 2] = 2, b3[r7 + 4 >> 2] = 0, f4 = 2, b3[r7 + 112 >> 2] < 1)
  3058. break r;
  3059. n4[r7 + 108 | 0] = 1;
  3060. } else {
  3061. e:
  3062. switch (f4 - 1 | 0) {
  3063. case 1:
  3064. (0 | (f4 = b3[r7 + 1732 >> 2])) == 11 ? be[b3[r7 + 12 >> 2]](100154) : be[0 | f4](100154, b3[r7 + 1896 >> 2]), b3[r7 >> 2] != 2 && cr2(r7, 2), f4 = 1, b3[r7 >> 2] = 1;
  3065. break r;
  3066. case 0:
  3067. break e;
  3068. default:
  3069. break r;
  3070. }
  3071. (0 | (f4 = b3[r7 + 1732 >> 2])) == 11 ? be[b3[r7 + 12 >> 2]](100153) : be[0 | f4](100153, b3[r7 + 1896 >> 2]), (f4 = b3[r7 + 8 >> 2]) && Pr2(f4), f4 = 0, b3[r7 + 8 >> 2] = 0, b3[r7 >> 2] = 0, b3[r7 + 4 >> 2] = 0;
  3072. }
  3073. if ((0 | e4) == (0 | f4))
  3074. break;
  3075. }
  3076. }
  3077. function sr2(r7, e4, f4) {
  3078. var i5 = 0, a5 = 0, n5 = 0, t3 = 0, o4 = 0, b4 = 0, k4 = 0, u3 = 0, c3 = 0;
  3079. r: {
  3080. e: {
  3081. f: {
  3082. i: {
  3083. a: {
  3084. n: {
  3085. t: {
  3086. o: {
  3087. b: {
  3088. k: {
  3089. if (a5 = e4, e4) {
  3090. if (!(i5 = f4))
  3091. break k;
  3092. break b;
  3093. }
  3094. r7 = (r7 >>> 0) / (f4 >>> 0) | 0, F2 = 0;
  3095. break r;
  3096. }
  3097. if (!r7)
  3098. break o;
  3099. break t;
  3100. }
  3101. if (!(i5 - 1 & i5))
  3102. break n;
  3103. b4 = 0 - (o4 = (y2(i5) + 33 | 0) - y2(a5) | 0) | 0;
  3104. break i;
  3105. }
  3106. r7 = (a5 >>> 0) / 0 | 0, F2 = 0;
  3107. break r;
  3108. }
  3109. if ((i5 = 32 - y2(a5) | 0) >>> 0 < 31)
  3110. break a;
  3111. break f;
  3112. }
  3113. if ((0 | i5) == 1)
  3114. break e;
  3115. f4 = 31 & (i5 = i5 ? 31 - y2(i5 - 1 ^ i5) | 0 : 32), (63 & i5) >>> 0 >= 32 ? (a5 = 0, r7 = e4 >>> f4 | 0) : (a5 = e4 >>> f4 | 0, r7 = ((1 << f4) - 1 & e4) << 32 - f4 | r7 >>> f4), F2 = a5;
  3116. break r;
  3117. }
  3118. o4 = i5 + 1 | 0, b4 = 63 - i5 | 0;
  3119. }
  3120. if (i5 = e4, n5 = 31 & (a5 = 63 & o4), a5 >>> 0 >= 32 ? (a5 = 0, n5 = i5 >>> n5 | 0) : (a5 = i5 >>> n5 | 0, n5 = ((1 << n5) - 1 & i5) << 32 - n5 | r7 >>> n5), i5 = 31 & (b4 &= 63), b4 >>> 0 >= 32 ? (e4 = r7 << i5, r7 = 0) : (e4 = (1 << i5) - 1 & r7 >>> 32 - i5 | e4 << i5, r7 <<= i5), o4)
  3121. for (b4 = (0 | (i5 = f4 - 1 | 0)) != -1 ? 0 : -1; n5 = (k4 = t3 = n5 << 1 | e4 >>> 31) - (u3 = f4 & (t3 = b4 - ((a5 = a5 << 1 | n5 >>> 31) + (i5 >>> 0 < t3 >>> 0) | 0) >> 31)) | 0, a5 = a5 - (k4 >>> 0 < u3 >>> 0) | 0, e4 = e4 << 1 | r7 >>> 31, r7 = c3 | r7 << 1, c3 = t3 &= 1, o4 = o4 - 1 | 0; )
  3122. ;
  3123. F2 = e4 << 1 | r7 >>> 31, r7 = t3 | r7 << 1;
  3124. break r;
  3125. }
  3126. r7 = 0, e4 = 0;
  3127. }
  3128. F2 = e4;
  3129. }
  3130. return r7;
  3131. }
  3132. function Ar2(r7, e4, f4) {
  3133. e4 |= 0, f4 |= 0;
  3134. var i5 = 0, a5 = 0, n5 = 0, t3 = 0, o4 = 0, k4 = 0, u3 = 0;
  3135. j2 = a5 = j2 - 32 | 0, n5 = b3[28 + (r7 |= 0) >> 2], b3[a5 + 16 >> 2] = n5, i5 = b3[r7 + 20 >> 2], b3[a5 + 28 >> 2] = f4, b3[a5 + 24 >> 2] = e4, e4 = i5 - n5 | 0, b3[a5 + 20 >> 2] = e4, n5 = e4 + f4 | 0, u3 = 2, e4 = a5 + 16 | 0;
  3136. r: {
  3137. e: {
  3138. (i5 = 0 | _2(b3[r7 + 60 >> 2], a5 + 16 | 0, 2, a5 + 12 | 0)) ? (b3[613] = i5, i5 = -1) : i5 = 0;
  3139. f: {
  3140. if (!i5)
  3141. for (; ; ) {
  3142. if ((0 | (i5 = b3[a5 + 12 >> 2])) == (0 | n5))
  3143. break f;
  3144. if ((0 | i5) <= -1)
  3145. break e;
  3146. if (t3 = i5 - ((o4 = (t3 = b3[e4 + 4 >> 2]) >>> 0 < i5 >>> 0) ? t3 : 0) | 0, b3[(k4 = (o4 << 3) + e4 | 0) >> 2] = t3 + b3[k4 >> 2], b3[(k4 = (o4 ? 12 : 4) + e4 | 0) >> 2] = b3[k4 >> 2] - t3, n5 = n5 - i5 | 0, e4 = o4 ? e4 + 8 | 0 : e4, u3 = u3 - o4 | 0, (i5 = 0 | _2(b3[r7 + 60 >> 2], 0 | e4, 0 | u3, a5 + 12 | 0)) ? (b3[613] = i5, i5 = -1) : i5 = 0, i5)
  3147. break;
  3148. }
  3149. if ((0 | n5) != -1)
  3150. break e;
  3151. }
  3152. e4 = b3[r7 + 44 >> 2], b3[r7 + 28 >> 2] = e4, b3[r7 + 20 >> 2] = e4, b3[r7 + 16 >> 2] = e4 + b3[r7 + 48 >> 2], r7 = f4;
  3153. break r;
  3154. }
  3155. b3[r7 + 28 >> 2] = 0, b3[r7 + 16 >> 2] = 0, b3[r7 + 20 >> 2] = 0, b3[r7 >> 2] = 32 | b3[r7 >> 2], r7 = 0, (0 | u3) != 2 && (r7 = f4 - b3[e4 + 4 >> 2] | 0);
  3156. }
  3157. return j2 = a5 + 32 | 0, 0 | r7;
  3158. }
  3159. function lr2(r7) {
  3160. var e4 = 0, f4 = 0, i5 = 0, a5 = 0, n5 = 0, t3 = 0, o4 = w2(0), k4 = 0, u3 = w2(0), c3 = 0, s3 = 0, A3 = 0, l4 = 0, v3 = 0, h3 = 0;
  3161. if (a5 = b3[r7 + 4 >> 2], f4 = b3[r7 >> 2], i5 = b3[f4 + 4 >> 2], v3 = b3[(e4 = a5 + (i5 << 3) | 0) >> 2], !((0 | (n5 = b3[r7 + 8 >> 2])) < 1) && (c3 = b3[(n5 << 2) + f4 >> 2], b3[f4 + 4 >> 2] = c3, b3[4 + (s3 = (c3 << 3) + a5 | 0) >> 2] = 1, b3[e4 >> 2] = 0, b3[e4 + 4 >> 2] = b3[r7 + 16 >> 2], A3 = n5 - 1 | 0, b3[r7 + 8 >> 2] = A3, b3[r7 + 16 >> 2] = i5, (0 | n5) != 1)) {
  3162. for (h3 = (c3 << 3) + a5 | 0, e4 = 1; (0 | A3) <= (0 | (r7 = e4 << 1)) || (t3 = b3[(b3[((i5 = 1 | r7) << 2) + f4 >> 2] << 3) + a5 >> 2], o4 = d2[t3 + 28 >> 2], k4 = b3[(b3[(r7 << 2) + f4 >> 2] << 3) + a5 >> 2], u3 = d2[k4 + 28 >> 2], !(d2[t3 + 32 >> 2] <= d2[k4 + 32 >> 2]) | o4 != u3 && !(o4 < u3) || (r7 = i5)), !((0 | r7) >= (0 | n5) || (i5 = b3[h3 >> 2], o4 = d2[i5 + 28 >> 2], t3 = b3[(r7 << 2) + f4 >> 2], l4 = b3[(k4 = (t3 << 3) + a5 | 0) >> 2], o4 < (u3 = d2[l4 + 28 >> 2]) | (d2[i5 + 32 >> 2] <= d2[l4 + 32 >> 2] ? o4 == u3 : 0))); )
  3163. b3[(e4 << 2) + f4 >> 2] = t3, b3[k4 + 4 >> 2] = e4, e4 = r7;
  3164. b3[(e4 << 2) + f4 >> 2] = c3, b3[s3 + 4 >> 2] = e4;
  3165. }
  3166. return v3;
  3167. }
  3168. function vr2(r7, e4, f4) {
  3169. e4 |= 0, f4 |= 0, (0 | (f4 = b3[1716 + (r7 |= 0) >> 2])) == 3 ? be[b3[r7 + 88 >> 2]](6) : be[0 | f4](6, b3[r7 + 1896 >> 2]), (0 | (f4 = b3[r7 + 1724 >> 2])) == 5 ? be[b3[r7 + 96 >> 2]](b3[b3[e4 + 16 >> 2] + 12 >> 2]) : be[0 | f4](b3[b3[e4 + 16 >> 2] + 12 >> 2], b3[r7 + 1896 >> 2]), (0 | (f4 = b3[r7 + 1724 >> 2])) == 5 ? be[b3[r7 + 96 >> 2]](b3[b3[b3[e4 + 4 >> 2] + 16 >> 2] + 12 >> 2]) : be[0 | f4](b3[b3[b3[e4 + 4 >> 2] + 16 >> 2] + 12 >> 2], b3[r7 + 1896 >> 2]), f4 = b3[e4 + 20 >> 2];
  3170. r:
  3171. if (k3[f4 + 21 | 0])
  3172. for (; ; ) {
  3173. if (k3[f4 + 20 | 0])
  3174. break r;
  3175. if (n4[f4 + 20 | 0] = 1, e4 = b3[e4 + 8 >> 2], (0 | (f4 = b3[r7 + 1724 >> 2])) == 5 ? be[b3[r7 + 96 >> 2]](b3[b3[b3[e4 + 4 >> 2] + 16 >> 2] + 12 >> 2]) : be[0 | f4](b3[b3[b3[e4 + 4 >> 2] + 16 >> 2] + 12 >> 2], b3[r7 + 1896 >> 2]), f4 = b3[e4 + 20 >> 2], !k3[f4 + 21 | 0])
  3176. break;
  3177. }
  3178. (0 | (e4 = b3[r7 + 1728 >> 2])) == 6 ? be[b3[r7 + 100 >> 2]]() : be[0 | e4](b3[r7 + 1896 >> 2]);
  3179. }
  3180. function dr2(r7, e4, f4) {
  3181. var i5 = 0, a5 = 0;
  3182. if (f4 && (n4[(i5 = r7 + f4 | 0) - 1 | 0] = e4, n4[0 | r7] = e4, !(f4 >>> 0 < 3 || (n4[i5 - 2 | 0] = e4, n4[r7 + 1 | 0] = e4, n4[i5 - 3 | 0] = e4, n4[r7 + 2 | 0] = e4, f4 >>> 0 < 7 || (n4[i5 - 4 | 0] = e4, n4[r7 + 3 | 0] = e4, f4 >>> 0 < 9 || (i5 = (i5 = r7) + (r7 = 0 - r7 & 3) | 0, a5 = p2(255 & e4, 16843009), b3[i5 >> 2] = a5, b3[(e4 = (r7 = f4 - r7 & -4) + i5 | 0) - 4 >> 2] = a5, r7 >>> 0 < 9 || (b3[i5 + 8 >> 2] = a5, b3[i5 + 4 >> 2] = a5, b3[e4 - 8 >> 2] = a5, b3[e4 - 12 >> 2] = a5, r7 >>> 0 < 25 || (b3[i5 + 24 >> 2] = a5, b3[i5 + 20 >> 2] = a5, b3[i5 + 16 >> 2] = a5, b3[i5 + 12 >> 2] = a5, b3[e4 - 16 >> 2] = a5, b3[e4 - 20 >> 2] = a5, b3[e4 - 24 >> 2] = a5, b3[e4 - 28 >> 2] = a5, (f4 = r7 - (e4 = 4 & i5 | 24) | 0) >>> 0 < 32))))))))
  3183. for (a5 = Or2(a5, 0, 1, 1), r7 = F2, e4 = e4 + i5 | 0; b3[e4 + 24 >> 2] = a5, i5 = r7, b3[e4 + 28 >> 2] = i5, b3[e4 + 16 >> 2] = a5, b3[e4 + 20 >> 2] = i5, b3[e4 + 8 >> 2] = a5, b3[e4 + 12 >> 2] = i5, b3[e4 >> 2] = a5, b3[e4 + 4 >> 2] = i5, e4 = e4 + 32 | 0, (f4 = f4 - 32 | 0) >>> 0 > 31; )
  3184. ;
  3185. }
  3186. function hr2(r7, e4, f4) {
  3187. r:
  3188. if (!(e4 >>> 0 > 20)) {
  3189. e:
  3190. switch (e4 - 9 | 0) {
  3191. case 0:
  3192. return e4 = b3[f4 >> 2], b3[f4 >> 2] = e4 + 4, void (b3[r7 >> 2] = b3[e4 >> 2]);
  3193. case 1:
  3194. return e4 = b3[f4 >> 2], b3[f4 >> 2] = e4 + 4, e4 = b3[e4 >> 2], b3[r7 >> 2] = e4, void (b3[r7 + 4 >> 2] = e4 >> 31);
  3195. case 2:
  3196. return e4 = b3[f4 >> 2], b3[f4 >> 2] = e4 + 4, b3[r7 >> 2] = b3[e4 >> 2], void (b3[r7 + 4 >> 2] = 0);
  3197. case 3:
  3198. return e4 = b3[f4 >> 2] + 7 & -8, b3[f4 >> 2] = e4 + 8, f4 = b3[e4 + 4 >> 2], b3[r7 >> 2] = b3[e4 >> 2], void (b3[r7 + 4 >> 2] = f4);
  3199. case 4:
  3200. return e4 = b3[f4 >> 2], b3[f4 >> 2] = e4 + 4, e4 = o3[e4 >> 1], b3[r7 >> 2] = e4, void (b3[r7 + 4 >> 2] = e4 >> 31);
  3201. case 5:
  3202. return e4 = b3[f4 >> 2], b3[f4 >> 2] = e4 + 4, b3[r7 >> 2] = l3[e4 >> 1], void (b3[r7 + 4 >> 2] = 0);
  3203. case 6:
  3204. return e4 = b3[f4 >> 2], b3[f4 >> 2] = e4 + 4, e4 = n4[0 | e4], b3[r7 >> 2] = e4, void (b3[r7 + 4 >> 2] = e4 >> 31);
  3205. case 7:
  3206. return e4 = b3[f4 >> 2], b3[f4 >> 2] = e4 + 4, b3[r7 >> 2] = k3[0 | e4], void (b3[r7 + 4 >> 2] = 0);
  3207. case 8:
  3208. return e4 = b3[f4 >> 2] + 7 & -8, b3[f4 >> 2] = e4 + 8, void (h2[r7 >> 3] = h2[e4 >> 3]);
  3209. case 9:
  3210. break e;
  3211. default:
  3212. break r;
  3213. }
  3214. be[0](r7, f4);
  3215. }
  3216. }
  3217. function pr2(r7, e4, f4) {
  3218. var i5 = w2(0), a5 = w2(0), n5 = 0, t3 = 0, o4 = w2(0), k4 = w2(0), u3 = 0, c3 = w2(0), s3 = w2(0);
  3219. j2 = t3 = j2 + -64 | 0, u3 = (i5 = d2[e4 + 28 >> 2]) > (a5 = d2[r7 + 28 >> 2]);
  3220. r: {
  3221. e: {
  3222. if (!(!(d2[r7 + 32 >> 2] <= d2[e4 + 32 >> 2]) | i5 != a5) || u3) {
  3223. if ((o4 = d2[f4 + 28 >> 2]) > i5 | (d2[e4 + 32 >> 2] <= d2[f4 + 32 >> 2] ? i5 == o4 : 0))
  3224. break r;
  3225. if (n5 = 1, u3)
  3226. break e;
  3227. }
  3228. n5 = 0, i5 == a5 && (n5 = d2[r7 + 32 >> 2] <= d2[e4 + 32 >> 2]);
  3229. }
  3230. u3 = n5, n5 = 1, (o4 = d2[f4 + 28 >> 2]) > i5 || (n5 = 0, i5 == o4 && (n5 = d2[e4 + 32 >> 2] <= d2[f4 + 32 >> 2])), k4 = d2[r7 + 32 >> 2], c3 = d2[e4 + 32 >> 2], s3 = d2[f4 + 32 >> 2], h2[t3 + 40 >> 3] = o4, h2[t3 + 24 >> 3] = i5, h2[t3 + 48 >> 3] = s3, h2[t3 + 32 >> 3] = c3, h2[t3 + 16 >> 3] = k4, h2[t3 + 8 >> 3] = a5, b3[t3 + 4 >> 2] = n5, b3[t3 >> 2] = u3, Gr(1092, t3), o4 = d2[f4 + 28 >> 2], a5 = d2[r7 + 28 >> 2], i5 = d2[e4 + 28 >> 2];
  3231. }
  3232. return k4 = w2(0), j2 = t3 - -64 | 0, a5 = w2(i5 - a5), i5 = w2(o4 - i5), w2(a5 + i5) > w2(0) && (k4 = a5, a5 = d2[e4 + 32 >> 2], k4 = w2(w2(k4 * w2(a5 - d2[f4 + 32 >> 2])) + w2(i5 * w2(a5 - d2[r7 + 32 >> 2])))), k4;
  3233. }
  3234. function wr2(r7, e4, f4) {
  3235. var i5 = 0, a5 = 0, t3 = 0, o4 = 0;
  3236. i5 = b3[e4 >> 2];
  3237. r: {
  3238. if ((0 | e4) != (0 | f4))
  3239. for (; ; ) {
  3240. if (n4[e4 + 15 | 0] = 0, o4 = b3[e4 + 4 >> 2], t3 = b3[b3[o4 + 8 >> 2] >> 2], a5 = b3[t3 >> 2], b3[a5 + 16 >> 2] != b3[i5 + 16 >> 2]) {
  3241. if (!k3[t3 + 15 | 0])
  3242. return r7 = k3[e4 + 12 | 0], f4 = b3[i5 + 20 >> 2], b3[f4 + 8 >> 2] = i5, n4[f4 + 21 | 0] = r7, b3[i5 + 24 >> 2] = 0, Vr(o4), Y2(e4), i5;
  3243. if (!(a5 = er2(b3[b3[i5 + 8 >> 2] + 4 >> 2], b3[a5 + 4 >> 2])))
  3244. break r;
  3245. if (!rr2(b3[t3 >> 2]))
  3246. break r;
  3247. b3[t3 >> 2] = a5, n4[t3 + 15 | 0] = 0, b3[a5 + 24 >> 2] = t3;
  3248. }
  3249. if (b3[i5 + 8 >> 2] != (0 | a5)) {
  3250. if (!tr2(b3[b3[a5 + 4 >> 2] + 12 >> 2], a5))
  3251. break r;
  3252. if (!tr2(i5, a5))
  3253. break r;
  3254. }
  3255. if (a5 = k3[e4 + 12 | 0], i5 = b3[e4 >> 2], o4 = b3[i5 + 20 >> 2], b3[o4 + 8 >> 2] = i5, n4[o4 + 21 | 0] = a5, b3[i5 + 24 >> 2] = 0, Vr(b3[e4 + 4 >> 2]), Y2(e4), i5 = b3[t3 >> 2], (0 | f4) == (0 | (e4 = t3)))
  3256. break;
  3257. }
  3258. return i5;
  3259. }
  3260. Zr(r7 + 1740 | 0, 1), E2();
  3261. }
  3262. function mr2(r7, e4, f4) {
  3263. switch (e4 - 100100 | 0) {
  3264. case 0:
  3265. return void (b3[r7 + 88 >> 2] = f4 || 15);
  3266. case 6:
  3267. return void (b3[r7 + 1716 >> 2] = f4 || 3);
  3268. case 4:
  3269. return n4[r7 + 80 | 0] = (0 | f4) != 0, void (b3[r7 + 92 >> 2] = f4 || 14);
  3270. case 10:
  3271. return n4[r7 + 80 | 0] = (0 | f4) != 0, void (b3[r7 + 1720 >> 2] = f4 || 4);
  3272. case 1:
  3273. return void (b3[r7 + 96 >> 2] = f4 || 13);
  3274. case 7:
  3275. return void (b3[r7 + 1724 >> 2] = f4 || 5);
  3276. case 2:
  3277. return void (b3[r7 + 100 >> 2] = f4 || 12);
  3278. case 8:
  3279. return void (b3[r7 + 1728 >> 2] = f4 || 6);
  3280. case 3:
  3281. return void (b3[r7 + 12 >> 2] = f4 || 18);
  3282. case 9:
  3283. return void (b3[r7 + 1732 >> 2] = f4 || 11);
  3284. case 5:
  3285. return void (b3[r7 + 76 >> 2] = f4 || 17);
  3286. case 11:
  3287. return void (b3[r7 + 1736 >> 2] = f4 || 8);
  3288. case 12:
  3289. return void (b3[r7 + 104 >> 2] = f4 || 16);
  3290. }
  3291. (0 | (e4 = b3[r7 + 1732 >> 2])) == 11 ? be[b3[r7 + 12 >> 2]](100900) : be[0 | e4](100900, b3[r7 + 1896 >> 2]);
  3292. }
  3293. function yr2(r7, e4, f4) {
  3294. var i5 = 0, a5 = 0, t3 = 0;
  3295. if (!(32 & k3[0 | r7]))
  3296. r: {
  3297. a5 = e4, i5 = f4;
  3298. e: {
  3299. if (!(r7 = b3[(e4 = r7) + 16 >> 2])) {
  3300. if (r7 = k3[e4 + 74 | 0], n4[e4 + 74 | 0] = r7 - 1 | r7, 8 & (r7 = b3[e4 >> 2]) ? (b3[e4 >> 2] = 32 | r7, r7 = -1) : (b3[e4 + 4 >> 2] = 0, b3[e4 + 8 >> 2] = 0, r7 = b3[e4 + 44 >> 2], b3[e4 + 28 >> 2] = r7, b3[e4 + 20 >> 2] = r7, b3[e4 + 16 >> 2] = r7 + b3[e4 + 48 >> 2], r7 = 0), r7)
  3301. break e;
  3302. r7 = b3[e4 + 16 >> 2];
  3303. }
  3304. if (r7 - (t3 = b3[e4 + 20 >> 2]) >>> 0 < i5 >>> 0) {
  3305. be[b3[e4 + 36 >> 2]](e4, a5, f4);
  3306. break r;
  3307. }
  3308. f:
  3309. if (!(n4[e4 + 75 | 0] < 0)) {
  3310. for (r7 = f4; ; ) {
  3311. if (i5 = r7, !r7)
  3312. break f;
  3313. if (k3[a5 + (r7 = i5 - 1 | 0) | 0] == 10)
  3314. break;
  3315. }
  3316. if (be[b3[e4 + 36 >> 2]](e4, a5, i5) >>> 0 < i5 >>> 0)
  3317. break e;
  3318. a5 = i5 + a5 | 0, f4 = f4 - i5 | 0, t3 = b3[e4 + 20 >> 2];
  3319. }
  3320. fr2(t3, a5, f4), b3[e4 + 20 >> 2] = b3[e4 + 20 >> 2] + f4;
  3321. }
  3322. }
  3323. }
  3324. function gr2(r7, e4, f4, i5) {
  3325. var a5 = 0, t3 = 0;
  3326. j2 = a5 = j2 - 208 | 0, b3[a5 + 204 >> 2] = f4, dr2(a5 + 160 | 0, 0, 40), b3[a5 + 200 >> 2] = b3[a5 + 204 >> 2], (0 | W2(0, e4, a5 + 200 | 0, a5 + 80 | 0, a5 + 160 | 0, i5)) < 0 || (b3[r7 + 76 >> 2], f4 = b3[r7 >> 2], n4[r7 + 74 | 0] <= 0 && (b3[r7 >> 2] = -33 & f4), t3 = 32 & f4, b3[r7 + 48 >> 2] ? W2(r7, e4, a5 + 200 | 0, a5 + 80 | 0, a5 + 160 | 0, i5) : (b3[r7 + 48 >> 2] = 80, b3[r7 + 16 >> 2] = a5 + 80, b3[r7 + 28 >> 2] = a5, b3[r7 + 20 >> 2] = a5, f4 = b3[r7 + 44 >> 2], b3[r7 + 44 >> 2] = a5, W2(r7, e4, a5 + 200 | 0, a5 + 80 | 0, a5 + 160 | 0, i5), f4 && (be[b3[r7 + 36 >> 2]](r7, 0, 0), b3[r7 + 48 >> 2] = 0, b3[r7 + 44 >> 2] = f4, b3[r7 + 28 >> 2] = 0, b3[r7 + 16 >> 2] = 0, b3[r7 + 20 >> 2] = 0)), b3[r7 >> 2] = b3[r7 >> 2] | t3), j2 = a5 + 208 | 0;
  3327. }
  3328. function Er2(r7, e4) {
  3329. r7 |= 0;
  3330. var f4 = 0, i5 = 0, a5 = 0;
  3331. if ((0 | (f4 = b3[40 + (e4 |= 0) >> 2])) != (0 | (i5 = e4 + 40 | 0)))
  3332. for (; ; ) {
  3333. if (k3[f4 + 21 | 0]) {
  3334. for ((0 | (e4 = b3[r7 + 1716 >> 2])) == 3 ? be[b3[r7 + 88 >> 2]](2) : be[0 | e4](2, b3[r7 + 1896 >> 2]), e4 = b3[f4 + 8 >> 2]; (0 | (a5 = b3[r7 + 1724 >> 2])) == 5 ? be[b3[r7 + 96 >> 2]](b3[b3[e4 + 16 >> 2] + 12 >> 2]) : be[0 | a5](b3[b3[e4 + 16 >> 2] + 12 >> 2], b3[r7 + 1896 >> 2]), (0 | (e4 = b3[e4 + 12 >> 2])) != b3[f4 + 8 >> 2]; )
  3335. ;
  3336. (0 | (e4 = b3[r7 + 1728 >> 2])) == 6 ? be[b3[r7 + 100 >> 2]]() : be[0 | e4](b3[r7 + 1896 >> 2]);
  3337. }
  3338. if ((0 | i5) == (0 | (f4 = b3[f4 >> 2])))
  3339. break;
  3340. }
  3341. }
  3342. function Cr2(r7, e4) {
  3343. if (!r7)
  3344. return 0;
  3345. r: {
  3346. e: {
  3347. if (r7) {
  3348. if (e4 >>> 0 <= 127)
  3349. break e;
  3350. if (b3[b3[493] >> 2]) {
  3351. if (e4 >>> 0 <= 2047) {
  3352. n4[r7 + 1 | 0] = 63 & e4 | 128, n4[0 | r7] = e4 >>> 6 | 192, r7 = 2;
  3353. break r;
  3354. }
  3355. if (!((-8192 & e4) != 57344 && e4 >>> 0 >= 55296)) {
  3356. n4[r7 + 2 | 0] = 63 & e4 | 128, n4[0 | r7] = e4 >>> 12 | 224, n4[r7 + 1 | 0] = e4 >>> 6 & 63 | 128, r7 = 3;
  3357. break r;
  3358. }
  3359. if (e4 - 65536 >>> 0 <= 1048575) {
  3360. n4[r7 + 3 | 0] = 63 & e4 | 128, n4[0 | r7] = e4 >>> 18 | 240, n4[r7 + 2 | 0] = e4 >>> 6 & 63 | 128, n4[r7 + 1 | 0] = e4 >>> 12 & 63 | 128, r7 = 4;
  3361. break r;
  3362. }
  3363. } else if ((-128 & e4) == 57216)
  3364. break e;
  3365. b3[613] = 25, r7 = -1;
  3366. } else
  3367. r7 = 1;
  3368. break r;
  3369. }
  3370. n4[0 | r7] = e4, r7 = 1;
  3371. }
  3372. return r7;
  3373. }
  3374. function Rr2() {
  3375. var r7 = 0, e4 = 0, f4 = 0;
  3376. return (r7 = O2(128)) ? (b3[r7 + 8 >> 2] = 0, b3[r7 + 12 >> 2] = 0, e4 = r7 + 40 | 0, b3[r7 + 44 >> 2] = e4, b3[r7 + 48 >> 2] = 0, b3[r7 + 52 >> 2] = 0, b3[r7 + 40 >> 2] = e4, o3[r7 + 54 >> 1] = 0, o3[r7 + 56 >> 1] = 0, o3[r7 + 58 >> 1] = 0, o3[r7 + 60 >> 1] = 0, b3[r7 + 72 >> 2] = 0, b3[r7 + 76 >> 2] = 0, e4 = r7 + 96 | 0, b3[r7 + 68 >> 2] = e4, f4 = r7 - -64 | 0, b3[r7 + 64 >> 2] = f4, b3[r7 + 80 >> 2] = 0, b3[r7 + 84 >> 2] = 0, b3[r7 + 88 >> 2] = 0, b3[r7 + 92 >> 2] = 0, b3[r7 + 104 >> 2] = 0, b3[r7 + 108 >> 2] = 0, b3[r7 + 100 >> 2] = f4, b3[r7 + 96 >> 2] = e4, b3[r7 + 112 >> 2] = 0, b3[r7 + 116 >> 2] = 0, b3[r7 + 120 >> 2] = 0, b3[r7 + 124 >> 2] = 0, b3[r7 >> 2] = r7, b3[r7 + 4 >> 2] = r7, 0 | r7) : 0;
  3377. }
  3378. function Mr2(r7, e4, f4) {
  3379. r7 |= 0, e4 |= 0, f4 |= 0;
  3380. var i5 = 0, a5 = 0, n5 = w2(0), t3 = w2(0);
  3381. return f4 = b3[f4 >> 2], i5 = b3[b3[f4 + 4 >> 2] + 16 >> 2], e4 = b3[e4 >> 2], (0 | (a5 = b3[b3[e4 + 4 >> 2] + 16 >> 2])) == (0 | (r7 = b3[r7 + 72 >> 2])) ? (0 | r7) == (0 | i5) ? (e4 = b3[e4 + 16 >> 2], n5 = d2[e4 + 28 >> 2], f4 = b3[f4 + 16 >> 2], t3 = d2[f4 + 28 >> 2], !(!(d2[e4 + 32 >> 2] <= d2[f4 + 32 >> 2]) | n5 != t3) || n5 < t3 ? pr2(r7, e4, f4) <= w2(0) | 0 : pr2(r7, f4, e4) >= w2(0) | 0) : pr2(i5, r7, b3[f4 + 16 >> 2]) <= w2(0) | 0 : (e4 = b3[e4 + 16 >> 2], (0 | r7) == (0 | i5) ? pr2(a5, r7, e4) >= w2(0) | 0 : jr2(a5, r7, e4) >= jr2(b3[b3[f4 + 4 >> 2] + 16 >> 2], r7, b3[f4 + 16 >> 2]) | 0);
  3382. }
  3383. function Ir2(r7) {
  3384. var e4 = 0, f4 = 0, i5 = 0, a5 = 0, n5 = 0, t3 = w2(0), o4 = w2(0), k4 = 0;
  3385. if (!(e4 = b3[r7 + 12 >> 2]))
  3386. return lr2(b3[r7 >> 2]);
  3387. if (n5 = b3[r7 + 8 >> 2], i5 = b3[b3[(n5 + (e4 << 2) | 0) - 4 >> 2] >> 2], f4 = b3[r7 >> 2], b3[f4 + 8 >> 2] && (a5 = b3[b3[f4 + 4 >> 2] + (b3[b3[f4 >> 2] + 4 >> 2] << 3) >> 2], t3 = d2[a5 + 28 >> 2], o4 = d2[i5 + 28 >> 2], !(!(d2[a5 + 32 >> 2] <= d2[i5 + 32 >> 2]) | t3 != o4) || t3 < o4))
  3388. return lr2(f4);
  3389. for (f4 = ((0 | e4) < 1 ? e4 : 1) - 1 | 0; ; ) {
  3390. if ((0 | e4) < 2)
  3391. return b3[r7 + 12 >> 2] = f4, i5;
  3392. if (a5 = e4 << 2, e4 = k4 = e4 - 1 | 0, b3[b3[(a5 + n5 | 0) - 8 >> 2] >> 2])
  3393. break;
  3394. }
  3395. return b3[r7 + 12 >> 2] = k4, i5;
  3396. }
  3397. function Sr2(r7, e4, f4) {
  3398. e4 |= 0, f4 |= 0;
  3399. var i5 = 0, a5 = 0, n5 = 0, t3 = 0;
  3400. n5 = 1;
  3401. r:
  3402. if ((0 | (i5 = b3[64 + (r7 |= 0) >> 2])) != (0 | (a5 = r7 - -64 | 0))) {
  3403. if (t3 = 0 - e4 | 0, !f4) {
  3404. for (; ; )
  3405. if (r7 = k3[b3[i5 + 20 >> 2] + 21 | 0], b3[i5 + 28 >> 2] = (0 | r7) == k3[b3[b3[i5 + 4 >> 2] + 20 >> 2] + 21 | 0] ? 0 : r7 ? e4 : t3, (0 | a5) == (0 | (i5 = b3[i5 >> 2])))
  3406. break r;
  3407. }
  3408. for (; ; ) {
  3409. if (r7 = b3[i5 >> 2], (0 | (f4 = k3[b3[i5 + 20 >> 2] + 21 | 0])) == k3[b3[b3[i5 + 4 >> 2] + 20 >> 2] + 21 | 0]) {
  3410. if (!rr2(i5)) {
  3411. n5 = 0;
  3412. break r;
  3413. }
  3414. } else
  3415. b3[i5 + 28 >> 2] = f4 ? e4 : t3;
  3416. if ((0 | a5) == (0 | (i5 = r7)))
  3417. break;
  3418. }
  3419. }
  3420. return 0 | n5;
  3421. }
  3422. function _r2(r7, e4) {
  3423. var f4 = 0, i5 = 0, a5 = 0;
  3424. (f4 = O2(16)) && (a5 = br2(b3[r7 + 8 >> 2])) && (i5 = b3[a5 + 16 >> 2], d2[i5 + 32 >> 2] = e4, b3[i5 + 28 >> 2] = 2112929218, i5 = b3[b3[a5 + 4 >> 2] + 16 >> 2], d2[i5 + 32 >> 2] = e4, b3[i5 + 28 >> 2] = -34554430, b3[r7 + 72 >> 2] = i5, n4[f4 + 15 | 0] = 0, n4[f4 + 12 | 0] = 0, b3[f4 + 8 >> 2] = 0, b3[f4 >> 2] = a5, n4[f4 + 13 | 0] = 1, n4[f4 + 14 | 0] = 0, i5 = f4, f4 = Fr2(a5 = b3[r7 + 64 >> 2], a5, f4), b3[i5 + 4 >> 2] = f4, f4) || (Zr(r7 + 1740 | 0, 1), E2());
  3425. }
  3426. function Pr2(r7) {
  3427. var e4 = 0, f4 = 0, i5 = 0;
  3428. if ((0 | (e4 = b3[40 + (r7 |= 0) >> 2])) != (0 | (f4 = r7 + 40 | 0)))
  3429. for (; i5 = b3[e4 >> 2], Y2(e4), (0 | f4) != (0 | (e4 = i5)); )
  3430. ;
  3431. if ((0 | (e4 = b3[r7 >> 2])) != (0 | r7))
  3432. for (; i5 = b3[e4 >> 2], Y2(e4), (0 | (e4 = i5)) != (0 | r7); )
  3433. ;
  3434. if ((0 | (e4 = b3[r7 + 64 >> 2])) != (0 | (f4 = r7 - -64 | 0)))
  3435. for (; i5 = b3[e4 >> 2], Y2(e4), (0 | f4) != (0 | (e4 = i5)); )
  3436. ;
  3437. Y2(r7);
  3438. }
  3439. function xr2(r7) {
  3440. var e4 = 0, f4 = w2(0), i5 = w2(0);
  3441. if (!(e4 = b3[r7 + 12 >> 2]))
  3442. return r7 = b3[r7 >> 2], b3[b3[r7 + 4 >> 2] + (b3[b3[r7 >> 2] + 4 >> 2] << 3) >> 2];
  3443. e4 = b3[b3[(b3[r7 + 8 >> 2] + (e4 << 2) | 0) - 4 >> 2] >> 2], r7 = b3[r7 >> 2];
  3444. r: {
  3445. if (b3[r7 + 8 >> 2]) {
  3446. if (r7 = b3[b3[r7 + 4 >> 2] + (b3[b3[r7 >> 2] + 4 >> 2] << 3) >> 2], (f4 = d2[r7 + 28 >> 2]) < (i5 = d2[e4 + 28 >> 2]))
  3447. break r;
  3448. if (f4 == i5 && d2[r7 + 32 >> 2] <= d2[e4 + 32 >> 2])
  3449. break r;
  3450. }
  3451. r7 = e4;
  3452. }
  3453. return r7;
  3454. }
  3455. function Lr2(r7, e4, f4, i5) {
  3456. r7 |= 0, e4 |= 0, f4 |= 0, i5 |= 0, f4 = 0;
  3457. r: {
  3458. if (e4 = b3[520]) {
  3459. if (!((f4 = b3[e4 >> 2]) >>> 0 < 100001)) {
  3460. e4 = O2(12);
  3461. break r;
  3462. }
  3463. } else
  3464. e4 = O2(1200008), b3[e4 + 4 >> 2] = 12, b3[e4 >> 2] = 0, b3[520] = e4;
  3465. b3[e4 >> 2] = f4 + 1, e4 = 8 + (p2(f4, 12) + e4 | 0) | 0;
  3466. }
  3467. d2[e4 >> 2] = d2[r7 >> 2], d2[e4 + 4 >> 2] = d2[r7 + 4 >> 2], d2[e4 + 8 >> 2] = d2[r7 + 8 >> 2], b3[i5 >> 2] = e4;
  3468. }
  3469. function Br2(r7, e4, f4) {
  3470. var i5 = 0, a5 = 0, t3 = 0;
  3471. if (e4 >>> 0 < 1)
  3472. i5 = r7;
  3473. else
  3474. for (; i5 = sr2(r7, e4, 10), t3 = a5 = F2, a5 = Or2(i5, a5, 10, 0), n4[0 | (f4 = f4 - 1 | 0)] = r7 - a5 | 48, a5 = e4 >>> 0 > 9, r7 = i5, e4 = t3, a5; )
  3475. ;
  3476. if (i5)
  3477. for (; r7 = (i5 >>> 0) / 10 | 0, n4[0 | (f4 = f4 - 1 | 0)] = i5 - p2(r7, 10) | 48, e4 = i5 >>> 0 > 9, i5 = r7, e4; )
  3478. ;
  3479. return f4;
  3480. }
  3481. function Tr2(r7, e4, f4, i5) {
  3482. var a5 = 0, n5 = 0, t3 = 0;
  3483. if (n5 = b3[610] + 1 | 0, b3[610] = n5, b3[r7 >> 2] = n5, i5)
  3484. for (; ; ) {
  3485. if (!b3[(t3 = (a5 << 3) + f4 | 0) >> 2])
  3486. return b3[t3 >> 2] = n5, b3[4 + (r7 = (a5 << 3) + f4 | 0) >> 2] = e4, b3[r7 + 8 >> 2] = 0, C2(0 | i5), f4;
  3487. if ((0 | (a5 = a5 + 1 | 0)) == (0 | i5))
  3488. break;
  3489. }
  3490. return a5 = r7, r7 = i5 << 1, e4 = Tr2(a5, e4, Z2(f4, i5 << 4 | 8), r7), C2(0 | r7), e4;
  3491. }
  3492. function Ur2(r7, e4) {
  3493. var f4 = 0, i5 = 0, a5 = 0;
  3494. if (A2(+r7), f4 = 0 | u2(1), i5 = 0 | u2(0), a5 = f4, (0 | (f4 = f4 >>> 20 & 2047)) != 2047) {
  3495. if (!f4)
  3496. return f4 = e4, r7 == 0 ? e4 = 0 : (r7 = Ur2(18446744073709552e3 * r7, e4), e4 = b3[e4 >> 2] + -64 | 0), b3[f4 >> 2] = e4, r7;
  3497. b3[e4 >> 2] = f4 - 1022, c2(0, 0 | i5), c2(1, -2146435073 & a5 | 1071644672), r7 = +s2();
  3498. }
  3499. return r7;
  3500. }
  3501. function jr2(r7, e4, f4) {
  3502. var i5 = w2(0), a5 = w2(0), n5 = w2(0), t3 = w2(0), o4 = w2(0);
  3503. return i5 = d2[e4 + 28 >> 2], a5 = w2(i5 - d2[r7 + 28 >> 2]), i5 = w2(d2[f4 + 28 >> 2] - i5), (n5 = w2(a5 + i5)) > w2(0) ? (o4 = d2[e4 + 32 >> 2], t3 = d2[((e4 = i5 > a5) ? r7 : f4) + 32 >> 2], i5 = w2(w2(o4 - t3) + w2(w2((e4 ? a5 : i5) / n5) * w2(t3 - d2[(e4 ? f4 : r7) + 32 >> 2])))) : i5 = w2(0), i5;
  3504. }
  3505. function Fr2(r7, e4, f4) {
  3506. for (var i5 = 0; e4 = b3[e4 + 8 >> 2], (i5 = b3[e4 >> 2]) && !(0 | be[b3[r7 + 16 >> 2]](b3[r7 + 12 >> 2], i5, f4)); )
  3507. ;
  3508. return (r7 = O2(12)) ? (b3[r7 >> 2] = f4, b3[r7 + 4 >> 2] = b3[e4 + 4 >> 2], b3[b3[e4 + 4 >> 2] + 8 >> 2] = r7, b3[r7 + 8 >> 2] = e4, b3[e4 + 4 >> 2] = r7, r7) : 0;
  3509. }
  3510. function Or2(r7, e4, f4, i5) {
  3511. var a5 = 0, n5 = 0, t3 = 0, o4 = 0, b4 = 0, k4 = 0;
  3512. return k4 = p2(a5 = f4 >>> 16 | 0, n5 = r7 >>> 16 | 0), a5 = (65535 & (n5 = ((b4 = p2(t3 = 65535 & f4, o4 = 65535 & r7)) >>> 16 | 0) + p2(n5, t3) | 0)) + p2(a5, o4) | 0, F2 = (p2(e4, f4) + k4 | 0) + p2(r7, i5) + (n5 >>> 16) + (a5 >>> 16) | 0, 65535 & b4 | a5 << 16;
  3513. }
  3514. function Dr(r7, e4, f4, i5, a5) {
  3515. var n5 = 0;
  3516. if (j2 = n5 = j2 - 256 | 0, !(73728 & a5 | (0 | f4) <= (0 | i5))) {
  3517. if (dr2(n5, 255 & e4, (i5 = (f4 = f4 - i5 | 0) >>> 0 < 256) ? f4 : 256), !i5)
  3518. for (; yr2(r7, n5, 256), (f4 = f4 - 256 | 0) >>> 0 > 255; )
  3519. ;
  3520. yr2(r7, n5, f4);
  3521. }
  3522. j2 = n5 + 256 | 0;
  3523. }
  3524. function Hr(r7, e4, f4) {
  3525. var i5 = 0, a5 = 0;
  3526. r:
  3527. if (f4)
  3528. for (; ; ) {
  3529. if (!(a5 = b3[(i5 << 3) + e4 >> 2]))
  3530. break r;
  3531. if ((0 | r7) == (0 | a5))
  3532. return b3[4 + ((i5 << 3) + e4 | 0) >> 2];
  3533. if ((0 | (i5 = i5 + 1 | 0)) == (0 | f4))
  3534. break;
  3535. }
  3536. return 0;
  3537. }
  3538. function Qr(r7) {
  3539. var e4 = 0, f4 = 0;
  3540. return (r7 = (e4 = b3[412]) + (f4 = r7 + 3 & -4) | 0) >>> 0 <= e4 >>> 0 && f4 || r7 >>> 0 > ke() << 16 >>> 0 && !(0 | P2(0 | r7)) ? (b3[613] = 48, -1) : (b3[412] = r7, e4);
  3541. }
  3542. function Wr(r7) {
  3543. var e4 = 0, f4 = 0, i5 = 0;
  3544. if (n4[b3[r7 >> 2]] - 48 >>> 0 < 10)
  3545. for (; e4 = b3[r7 >> 2], i5 = n4[0 | e4], b3[r7 >> 2] = e4 + 1, f4 = (p2(f4, 10) + i5 | 0) - 48 | 0, n4[e4 + 1 | 0] - 48 >>> 0 < 10; )
  3546. ;
  3547. return f4;
  3548. }
  3549. function qr(r7, e4) {
  3550. r7 |= 0;
  3551. var f4 = 0, i5 = 0;
  3552. (0 | (f4 = b3[4 + (e4 |= 0) >> 2])) < b3[e4 + 8 >> 2] && (i5 = b3[e4 >> 2] + (p2(b3[e4 + 12 >> 2], f4) << 2) | 0, d2[i5 >> 2] = d2[r7 >> 2], d2[i5 + 4 >> 2] = d2[r7 + 4 >> 2], b3[e4 + 4 >> 2] = f4 + 1);
  3553. }
  3554. function zr(r7, e4) {
  3555. r7 |= 0, e4 |= 0;
  3556. var f4 = w2(0), i5 = w2(0);
  3557. if ((f4 = d2[r7 + 28 >> 2]) < (i5 = d2[e4 + 28 >> 2]))
  3558. r7 = 1;
  3559. else {
  3560. if (f4 != i5)
  3561. return 0;
  3562. r7 = d2[r7 + 32 >> 2] <= d2[e4 + 32 >> 2];
  3563. }
  3564. return 0 | r7;
  3565. }
  3566. function Kr(r7) {
  3567. var e4 = 0;
  3568. (e4 = b3[r7 >> 2]) && (Y2(b3[e4 + 4 >> 2]), Y2(b3[e4 >> 2]), Y2(e4)), (e4 = b3[r7 + 8 >> 2]) && Y2(e4), (e4 = b3[r7 + 4 >> 2]) && Y2(e4), Y2(r7);
  3569. }
  3570. function Yr(r7) {
  3571. r7 |= 0;
  3572. var e4 = 0;
  3573. j2 = e4 = j2 - 16 | 0, b3[e4 >> 2] = r7, j2 = r7 = j2 - 16 | 0, b3[r7 + 12 >> 2] = e4, gr2(b3[288], 1078, e4, 0), j2 = r7 + 16 | 0, j2 = e4 + 16 | 0;
  3574. }
  3575. function Nr(r7, e4, f4) {
  3576. r7 |= 0, e4 = b3[20 + (e4 |= 0) >> 2], b3[e4 + 16 >> 2] = b3[r7 + 84 >> 2], b3[r7 + 84 >> 2] = e4, n4[e4 + 20 | 0] = 1;
  3577. }
  3578. function Vr(r7) {
  3579. var e4 = 0;
  3580. e4 = b3[r7 + 4 >> 2], b3[e4 + 8 >> 2] = b3[r7 + 8 >> 2], b3[b3[r7 + 8 >> 2] + 4 >> 2] = e4, Y2(r7);
  3581. }
  3582. function Gr(r7, e4) {
  3583. var f4 = 0;
  3584. j2 = f4 = j2 - 16 | 0, b3[f4 + 12 >> 2] = e4, gr2(b3[288], r7, e4, 43), j2 = f4 + 16 | 0;
  3585. }
  3586. function Jr(r7) {
  3587. var e4 = 0;
  3588. return (-1 >>> (e4 = 31 & r7) & -2) << e4 | (-1 << (r7 = 0 - r7 & 31) & -2) >>> r7;
  3589. }
  3590. function Zr(r7, e4) {
  3591. r7 |= 0, e4 |= 0, b3[611] || (b3[612] = e4, b3[611] = r7), x2();
  3592. }
  3593. function Xr(r7, e4) {
  3594. r7 |= 0, e4 |= 0, b3[611] || (b3[612] = e4, b3[611] = r7);
  3595. }
  3596. function $r(r7, e4, f4, i5) {
  3597. return F2 = 0, 0;
  3598. }
  3599. function re(r7, e4, f4, i5, a5) {
  3600. }
  3601. function ee(r7, e4, f4, i5) {
  3602. }
  3603. function fe(r7) {
  3604. return 0;
  3605. }
  3606. function ie(r7, e4) {
  3607. }
  3608. function ae() {
  3609. return 0 | j2;
  3610. }
  3611. function ne(r7) {
  3612. j2 = r7 |= 0;
  3613. }
  3614. function te(r7) {
  3615. }
  3616. function oe() {
  3617. }
  3618. f3 = k3, t2();
  3619. var be = e3([null, Nr, vr2, ie, ie, ie, te, ur2, re, zr, Mr2, ie, oe, te, te, te, te, ee, te, cr2, J2, Rr2, br2, ir2, tr2, K2, Zr, Q2, Sr2, $2, Er2, N2, nr2, Pr2, qr, te, oe, Lr2, Yr, te, fe, Ar2, $r, q2]);
  3620. function ke() {
  3621. return a4.byteLength / 65536 | 0;
  3622. }
  3623. function ue(r7) {
  3624. r7 |= 0;
  3625. var e4 = 0 | ke(), t3 = e4 + r7 | 0;
  3626. if (e4 < t3 && t3 < 65536) {
  3627. var u3 = new ArrayBuffer(p2(t3, 65536));
  3628. new Int8Array(u3).set(n4), n4 = new Int8Array(u3), o3 = new Int16Array(u3), b3 = new Int32Array(u3), k3 = new Uint8Array(u3), l3 = new Uint16Array(u3), v2 = new Uint32Array(u3), d2 = new Float32Array(u3), h2 = new Float64Array(u3), a4 = u3, i4.buffer = a4, f3 = k3;
  3629. }
  3630. return e4;
  3631. }
  3632. return { n: oe, o: O2, p: Y2, q: be, r: D2, s: ae, t: ne, u: Xr };
  3633. }
  3634. return l2(r5);
  3635. }(hr);
  3636. }, instantiate: function(r4, e2) {
  3637. return { then: function(e3) {
  3638. var f3 = new M.Module(r4);
  3639. e3({ instance: new M.Instance(f3) });
  3640. } };
  3641. }, RuntimeError: Error };
  3642. y = [], typeof M != "object" && X("no native wasm support detected");
  3643. var I = false;
  3644. function S(r4, e2) {
  3645. r4 || X("Assertion failed: " + e2);
  3646. }
  3647. var _, P, x, L = typeof TextDecoder != "undefined" ? new TextDecoder("utf8") : void 0;
  3648. function B(r4, e2, f3) {
  3649. for (var i3 = e2 + f3, a3 = e2; r4[a3] && !(a3 >= i3); )
  3650. ++a3;
  3651. if (a3 - e2 > 16 && r4.subarray && L)
  3652. return L.decode(r4.subarray(e2, a3));
  3653. for (var n3 = ""; e2 < a3; ) {
  3654. var t2 = r4[e2++];
  3655. if (128 & t2) {
  3656. var o2 = 63 & r4[e2++];
  3657. if ((224 & t2) != 192) {
  3658. var b2 = 63 & r4[e2++];
  3659. if ((t2 = (240 & t2) == 224 ? (15 & t2) << 12 | o2 << 6 | b2 : (7 & t2) << 18 | o2 << 12 | b2 << 6 | 63 & r4[e2++]) < 65536)
  3660. n3 += String.fromCharCode(t2);
  3661. else {
  3662. var k2 = t2 - 65536;
  3663. n3 += String.fromCharCode(55296 | k2 >> 10, 56320 | 1023 & k2);
  3664. }
  3665. } else
  3666. n3 += String.fromCharCode((31 & t2) << 6 | o2);
  3667. } else
  3668. n3 += String.fromCharCode(t2);
  3669. }
  3670. return n3;
  3671. }
  3672. function T(r4, e2) {
  3673. return r4 ? B(P, r4, e2) : "";
  3674. }
  3675. function U(r4, e2) {
  3676. return r4 % e2 > 0 && (r4 += e2 - r4 % e2), r4;
  3677. }
  3678. function j(r4) {
  3679. _ = r4, a2.HEAP8 = new Int8Array(r4), a2.HEAP16 = new Int16Array(r4), a2.HEAP32 = x = new Int32Array(r4), a2.HEAPU8 = P = new Uint8Array(r4), a2.HEAPU16 = new Uint16Array(r4), a2.HEAPU32 = new Uint32Array(r4), a2.HEAPF32 = new Float32Array(r4), a2.HEAPF64 = new Float64Array(r4);
  3680. }
  3681. var F, O = a2.INITIAL_MEMORY || 4194304;
  3682. (R = a2.wasmMemory ? a2.wasmMemory : new M.Memory({ initial: O / 65536, maximum: 32768 })) && (_ = R.buffer), O = _.byteLength, j(_);
  3683. var D = [], H = [], Q = [];
  3684. function W() {
  3685. if (a2.preRun)
  3686. for (typeof a2.preRun == "function" && (a2.preRun = [a2.preRun]); a2.preRun.length; )
  3687. K(a2.preRun.shift());
  3688. tr(D);
  3689. }
  3690. function q() {
  3691. tr(H);
  3692. }
  3693. function z() {
  3694. if (a2.postRun)
  3695. for (typeof a2.postRun == "function" && (a2.postRun = [a2.postRun]); a2.postRun.length; )
  3696. N(a2.postRun.shift());
  3697. tr(Q);
  3698. }
  3699. function K(r4) {
  3700. D.unshift(r4);
  3701. }
  3702. function Y(r4) {
  3703. H.unshift(r4);
  3704. }
  3705. function N(r4) {
  3706. Q.unshift(r4);
  3707. }
  3708. var V = 0, G = null;
  3709. function J(r4) {
  3710. V++, a2.monitorRunDependencies && a2.monitorRunDependencies(V);
  3711. }
  3712. function Z(r4) {
  3713. if (V--, a2.monitorRunDependencies && a2.monitorRunDependencies(V), V == 0 && G) {
  3714. var e2 = G;
  3715. G = null, e2();
  3716. }
  3717. }
  3718. function X(r4) {
  3719. throw a2.onAbort && a2.onAbort(r4), m(r4 += ""), I = true, r4 = "abort(" + r4 + "). Build with -s ASSERTIONS=1 for more info.", new M.RuntimeError(r4);
  3720. }
  3721. a2.preloadedImages = {}, a2.preloadedAudios = {};
  3722. var $, rr = "data:application/octet-stream;base64,";
  3723. function er(r4) {
  3724. return r4.startsWith(rr);
  3725. }
  3726. function fr(r4) {
  3727. return r4.startsWith("file://");
  3728. }
  3729. function ir(r4) {
  3730. try {
  3731. if (r4 == $ && y)
  3732. return new Uint8Array(y);
  3733. var e2 = dr(r4);
  3734. if (e2)
  3735. return e2;
  3736. if (c)
  3737. return c(r4);
  3738. throw "both async and sync fetching of the wasm failed";
  3739. } catch (m2) {
  3740. X(m2);
  3741. }
  3742. }
  3743. function ar() {
  3744. if (!y && (l || v)) {
  3745. if (typeof fetch == "function" && !fr($))
  3746. return fetch($, { credentials: "same-origin" }).then(function(r4) {
  3747. if (!r4.ok)
  3748. throw "failed to load wasm binary file at '" + $ + "'";
  3749. return r4.arrayBuffer();
  3750. }).catch(function() {
  3751. return ir($);
  3752. });
  3753. if (u)
  3754. return new Promise(function(r4, e2) {
  3755. u($, function(e3) {
  3756. r4(new Uint8Array(e3));
  3757. }, e2);
  3758. });
  3759. }
  3760. return Promise.resolve().then(function() {
  3761. return ir($);
  3762. });
  3763. }
  3764. function nr() {
  3765. var r4 = { a: hr };
  3766. function e2(r5, e3) {
  3767. var f4 = r5.exports;
  3768. a2.asm = f4, F = a2.asm.q, Y(a2.asm.n), Z();
  3769. }
  3770. function f3(r5) {
  3771. e2(r5.instance);
  3772. }
  3773. function i3(e3) {
  3774. return ar().then(function(e4) {
  3775. return M.instantiate(e4, r4);
  3776. }).then(e3, function(r5) {
  3777. m("failed to asynchronously prepare wasm: " + r5), X(r5);
  3778. });
  3779. }
  3780. function n3() {
  3781. return y || typeof M.instantiateStreaming != "function" || er($) || fr($) || typeof fetch != "function" ? i3(f3) : fetch($, { credentials: "same-origin" }).then(function(e3) {
  3782. return M.instantiateStreaming(e3, r4).then(f3, function(r5) {
  3783. return m("wasm streaming compile failed: " + r5), m("falling back to ArrayBuffer instantiation"), i3(f3);
  3784. });
  3785. });
  3786. }
  3787. if (J(), a2.instantiateWasm)
  3788. try {
  3789. return a2.instantiateWasm(r4, e2);
  3790. } catch (t2) {
  3791. return m("Module.instantiateWasm callback failed with error: " + t2), false;
  3792. }
  3793. return n3(), {};
  3794. }
  3795. function tr(r4) {
  3796. for (; r4.length > 0; ) {
  3797. var e2 = r4.shift();
  3798. if (typeof e2 != "function") {
  3799. var f3 = e2.func;
  3800. typeof f3 == "number" ? e2.arg === void 0 ? F.get(f3)() : F.get(f3)(e2.arg) : f3(e2.arg === void 0 ? null : e2.arg);
  3801. } else
  3802. e2(a2);
  3803. }
  3804. }
  3805. function or() {
  3806. throw "longjmp";
  3807. }
  3808. function br(r4, e2, f3) {
  3809. P.copyWithin(r4, e2, e2 + f3);
  3810. }
  3811. function kr(r4) {
  3812. try {
  3813. return R.grow(r4 - _.byteLength + 65535 >>> 16), j(R.buffer), 1;
  3814. } catch (e2) {
  3815. }
  3816. }
  3817. function ur(r4) {
  3818. var e2 = P.length, f3 = 2147483648;
  3819. if ((r4 >>>= 0) > f3)
  3820. return false;
  3821. for (var i3 = 1; i3 <= 4; i3 *= 2) {
  3822. var a3 = e2 * (1 + 0.2 / i3);
  3823. if (a3 = Math.min(a3, r4 + 100663296), kr(Math.min(f3, U(Math.max(r4, a3), 65536))))
  3824. return true;
  3825. }
  3826. return false;
  3827. }
  3828. er($ = "libtess-asm.wasm") || ($ = p($));
  3829. var cr = { mappings: {}, buffers: [null, [], []], printChar: function(r4, e2) {
  3830. var f3 = cr.buffers[r4];
  3831. e2 === 0 || e2 === 10 ? ((r4 === 1 ? w : m)(B(f3, 0)), f3.length = 0) : f3.push(e2);
  3832. }, varargs: void 0, get: function() {
  3833. return cr.varargs += 4, x[cr.varargs - 4 >> 2];
  3834. }, getStr: function(r4) {
  3835. return T(r4);
  3836. }, get64: function(r4, e2) {
  3837. return r4;
  3838. } };
  3839. function sr(r4, e2, f3, i3) {
  3840. for (var a3 = 0, n3 = 0; n3 < f3; n3++) {
  3841. for (var t2 = x[e2 + 8 * n3 >> 2], o2 = x[e2 + (8 * n3 + 4) >> 2], b2 = 0; b2 < o2; b2++)
  3842. cr.printChar(r4, P[t2 + b2]);
  3843. a3 += o2;
  3844. }
  3845. return x[i3 >> 2] = a3, 0;
  3846. }
  3847. function Ar(r4) {
  3848. for (var e2 = [], f3 = 0; f3 < r4.length; f3++) {
  3849. var i3 = r4[f3];
  3850. i3 > 255 && (i3 &= 255), e2.push(String.fromCharCode(i3));
  3851. }
  3852. return e2.join("");
  3853. }
  3854. var lr = typeof atob == "function" ? atob : function(r4) {
  3855. var e2, f3, i3, a3, n3, t2, o2 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=", b2 = "", k2 = 0;
  3856. r4 = r4.replace(/[^A-Za-z0-9\+\/\=]/g, "");
  3857. do {
  3858. e2 = o2.indexOf(r4.charAt(k2++)) << 2 | (a3 = o2.indexOf(r4.charAt(k2++))) >> 4, f3 = (15 & a3) << 4 | (n3 = o2.indexOf(r4.charAt(k2++))) >> 2, i3 = (3 & n3) << 6 | (t2 = o2.indexOf(r4.charAt(k2++))), b2 += String.fromCharCode(e2), n3 !== 64 && (b2 += String.fromCharCode(f3)), t2 !== 64 && (b2 += String.fromCharCode(i3));
  3859. } while (k2 < r4.length);
  3860. return b2;
  3861. };
  3862. function vr(r4) {
  3863. if (typeof d == "boolean" && d) {
  3864. var e2 = Buffer.from(r4, "base64");
  3865. return new Uint8Array(e2.buffer, e2.byteOffset, e2.byteLength);
  3866. }
  3867. try {
  3868. for (var f3 = lr(r4), i3 = new Uint8Array(f3.length), a3 = 0; a3 < f3.length; ++a3)
  3869. i3[a3] = f3.charCodeAt(a3);
  3870. return i3;
  3871. } catch (n3) {
  3872. throw new Error("Converting base64 string to bytes failed.");
  3873. }
  3874. }
  3875. function dr(r4) {
  3876. if (er(r4))
  3877. return vr(r4.slice(rr.length));
  3878. }
  3879. var hr = { i: or, m: br, h: ur, g: sr, c: C, l: Rr, e: Cr, k: Mr, j: Ir, f: Er, d: gr, a: R, b: E };
  3880. nr(), a2.___wasm_call_ctors = function() {
  3881. return (a2.___wasm_call_ctors = a2.asm.n).apply(null, arguments);
  3882. }, a2._malloc = function() {
  3883. return (a2._malloc = a2.asm.o).apply(null, arguments);
  3884. }, a2._free = function() {
  3885. return (a2._free = a2.asm.p).apply(null, arguments);
  3886. }, a2._triangulate = function() {
  3887. return (a2._triangulate = a2.asm.r).apply(null, arguments);
  3888. };
  3889. var pr, wr = a2.stackSave = function() {
  3890. return (wr = a2.stackSave = a2.asm.s).apply(null, arguments);
  3891. }, mr = a2.stackRestore = function() {
  3892. return (mr = a2.stackRestore = a2.asm.t).apply(null, arguments);
  3893. }, yr = a2._setThrew = function() {
  3894. return (yr = a2._setThrew = a2.asm.u).apply(null, arguments);
  3895. };
  3896. function gr(r4, e2, f3) {
  3897. var i3 = wr();
  3898. try {
  3899. F.get(r4)(e2, f3);
  3900. } catch (a3) {
  3901. if (mr(i3), a3 !== a3 + 0 && a3 !== "longjmp")
  3902. throw a3;
  3903. yr(1, 0);
  3904. }
  3905. }
  3906. function Er(r4, e2) {
  3907. var f3 = wr();
  3908. try {
  3909. F.get(r4)(e2);
  3910. } catch (i3) {
  3911. if (mr(f3), i3 !== i3 + 0 && i3 !== "longjmp")
  3912. throw i3;
  3913. yr(1, 0);
  3914. }
  3915. }
  3916. function Cr(r4, e2) {
  3917. var f3 = wr();
  3918. try {
  3919. return F.get(r4)(e2);
  3920. } catch (i3) {
  3921. if (mr(f3), i3 !== i3 + 0 && i3 !== "longjmp")
  3922. throw i3;
  3923. yr(1, 0);
  3924. }
  3925. }
  3926. function Rr(r4) {
  3927. var e2 = wr();
  3928. try {
  3929. return F.get(r4)();
  3930. } catch (f3) {
  3931. if (mr(e2), f3 !== f3 + 0 && f3 !== "longjmp")
  3932. throw f3;
  3933. yr(1, 0);
  3934. }
  3935. }
  3936. function Mr(r4, e2, f3) {
  3937. var i3 = wr();
  3938. try {
  3939. return F.get(r4)(e2, f3);
  3940. } catch (a3) {
  3941. if (mr(i3), a3 !== a3 + 0 && a3 !== "longjmp")
  3942. throw a3;
  3943. yr(1, 0);
  3944. }
  3945. }
  3946. function Ir(r4, e2, f3, i3) {
  3947. var a3 = wr();
  3948. try {
  3949. return F.get(r4)(e2, f3, i3);
  3950. } catch (n3) {
  3951. if (mr(a3), n3 !== n3 + 0 && n3 !== "longjmp")
  3952. throw n3;
  3953. yr(1, 0);
  3954. }
  3955. }
  3956. function Sr(r4) {
  3957. this.name = "ExitStatus", this.message = "Program terminated with exit(" + r4 + ")", this.status = r4;
  3958. }
  3959. function _r(r4) {
  3960. function e2() {
  3961. pr || (pr = true, a2.calledRun = true, I || (q(), a2.onRuntimeInitialized && a2.onRuntimeInitialized(), z()));
  3962. }
  3963. V > 0 || (W(), V > 0 || (a2.setStatus ? (a2.setStatus("Running..."), setTimeout(function() {
  3964. setTimeout(function() {
  3965. a2.setStatus("");
  3966. }, 1), e2();
  3967. }, 1)) : e2()));
  3968. }
  3969. if (G = function r4() {
  3970. pr || _r(), pr || (G = r4);
  3971. }, a2.run = _r, a2.preInit)
  3972. for (typeof a2.preInit == "function" && (a2.preInit = [a2.preInit]); a2.preInit.length > 0; )
  3973. a2.preInit.pop()();
  3974. _r();
  3975. let Pr = null, xr = null, Lr = null, Br = null;
  3976. const Tr = i2.Module, Ur = 2, jr = 4e3;
  3977. let Fr = 0;
  3978. const Or = (r4, e2, f3) => {
  3979. Pr || (Pr = Tr._triangulate);
  3980. let i3 = Tr.HEAPF32;
  3981. const a3 = Tr.HEAP32.BYTES_PER_ELEMENT, n3 = 2, t2 = i3.BYTES_PER_ELEMENT;
  3982. f3 > Fr && (Fr = f3, Lr && (Tr._free(Lr), Lr = 0), xr && (Tr._free(xr), xr = 0)), Lr || (Lr = Tr._malloc(f3 * t2)), Br || (Br = Tr._malloc(jr * a3));
  3983. const o2 = f3 * Ur;
  3984. xr || (xr = Tr._malloc(o2 * t2)), i3 = Tr.HEAPF32, i3.set(r4, Lr / t2), Tr.HEAP32.set(e2, Br / a3);
  3985. const b2 = o2 / n3, k2 = Pr(Lr, Br, Math.min(e2.length, jr), n3, xr, b2), u2 = k2 * n3;
  3986. i3 = Tr.HEAPF32;
  3987. const c2 = i3.slice(xr / t2, xr / t2 + u2), s2 = {};
  3988. return s2.buffer = c2, s2.vertexCount = k2, s2;
  3989. };
  3990. return i2.triangulate = Or, i2.whenLoaded();
  3991. }
  3992. return { load: r2 };
  3993. }, (i = f()) !== void 0 && (e.exports = i);
  3994. var n = r({ __proto__: null, default: a.exports }, [a.exports]);
  3995. export {
  3996. n as l
  3997. };
  3998. //# sourceMappingURL=libtess-asm-ZSHP2UIP.js.map