libtess-asm-P656RRWQ.js 247 KB

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