2017-04-04 10:50:00 +02:00
/*! cornerstone-wado-image-loader - v0.14.3 - 2017-04-04 | (c) 2014 Chris Hafey | https://github.com/chafey/cornerstoneWADOImageLoader */
function info ( a ){ PDFJS . verbosity >= PDFJS . VERBOSITY_LEVELS . infos && console . log ( "Info: " + a )} function warn ( a ){ PDFJS . verbosity >= PDFJS . VERBOSITY_LEVELS . warnings && console . log ( "Warning: " + a )} function error ( a ){ if ( arguments . length > 1 ){ var b = [ "Error:" ]; b . push . apply ( b , arguments ), console . log . apply ( console , b ), a = []. join . call ( arguments , " " )} else console . log ( "Error: " + a ); throw console . log ( backtrace ()), UnsupportedManager . notify ( UNSUPPORTED_FEATURES . unknown ), new Error ( a )} function backtrace (){ try { throw new Error } catch ( a ){ return a . stack ? a . stack . split ( "\n" ). slice ( 2 ). join ( "\n" ) : "" }} function assert ( a , b ){ a || error ( b )} function combineUrl ( a , b ){ if ( ! b ) return a ; if ( /^[a-z][a-z0-9+\-.]*:/i . test ( b )) return b ; var c ; if ( "/" === b . charAt ( 0 )) return c = a . indexOf ( "://" ), "/" === b . charAt ( 1 ) ?++ c : c = a . indexOf ( "/" , c + 3 ), a . substring ( 0 , c ) + b ; var d = a . length ; c = a . lastIndexOf ( "#" ), d = c >= 0 ? c : d , c = a . lastIndexOf ( "?" , d ), d = c >= 0 ? c : d ; var e = a . lastIndexOf ( "/" , d ); return a . substring ( 0 , e + 1 ) + b } function isValidUrl ( a , b ){ if ( ! a ) return ! 1 ; var c = /^[a-z][a-z0-9+\-.]*(?=:)/i . exec ( a ); if ( ! c ) return b ; switch ( c = c [ 0 ]. toLowerCase ()){ case "http" : case "https" : case "ftp" : case "mailto" : case "tel" : return ! 0 ; default : return ! 1 }} function shadow ( a , b , c ){ return Object . defineProperty ( a , b ,{ value : c , enumerable :! 0 , configurable :! 0 , writable :! 1 }), c } function bytesToString ( a ){ assert ( null !== a && "object" == typeof a && void 0 !== a . length , "Invalid argument for bytesToString" ); var b = a . length , c = 8192 ; if ( c > b ) return String . fromCharCode . apply ( null , a ); for ( var d = [], e = 0 ; b > e ; e += c ){ var f = Math . min ( e + c , b ), g = a . subarray ( e , f ); d . push ( String . fromCharCode . apply ( null , g ))} return d . join ( "" )} function stringToBytes ( a ){ assert ( "string" == typeof a , "Invalid argument for stringToBytes" ); for ( var b = a . length , c = new Uint8Array ( b ), d = 0 ; b > d ; ++ d ) c [ d ] = 255 & a . charCodeAt ( d ); return c } function string32 ( a ){ return String . fromCharCode ( a >> 24 & 255 , a >> 16 & 255 , a >> 8 & 255 , 255 & a )} function log2 ( a ){ for ( var b = 1 , c = 0 ; a > b ;) b <<= 1 , c ++ ; return c } function readInt8 ( a , b ){ return a [ b ] << 24 >> 24 } function readUint16 ( a , b ){ return a [ b ] << 8 | a [ b + 1 ]} function readUint32 ( a , b ){ return ( a [ b ] << 24 | a [ b + 1 ] << 16 | a [ b + 2 ] << 8 | a [ b + 3 ]) >>> 0 } function isLittleEndian (){ var a = new Uint8Array ( 2 ); a [ 0 ] = 1 ; var b = new Uint16Array ( a . buffer ); return 1 === b [ 0 ]} function hasCanvasTypedArrays (){ var a = document . createElement ( "canvas" ); a . width = a . height = 1 ; var b = a . getContext ( "2d" ), c = b . createImageData ( 1 , 1 ); return "undefined" != typeof c . data . buffer } function stringToPDFString ( a ){ var b , c = a . length , d = []; if ( "þ" === a [ 0 ] && "ÿ" === a [ 1 ]) for ( b = 2 ; c > b ; b += 2 ) d . push ( String . fromCharCode ( a . charCodeAt ( b ) << 8 | a . charCodeAt ( b + 1 ))); else for ( b = 0 ; c > b ; ++ b ){ var e = PDFStringTranslateTable [ a . charCodeAt ( b )]; d . push ( e ? String . fromCharCode ( e ) : a . charAt ( b ))} return d . join ( "" )} function stringToUTF8String ( a ){ return decodeURIComponent ( escape ( a ))} function isEmptyObj ( a ){ for ( var b in a ) return ! 1 ; return ! 0 } function isBool ( a ){ return "boolean" == typeof a } function isInt ( a ){ return "number" == typeof a && ( 0 | a ) === a } function isNum ( a ){ return "number" == typeof a } function isString ( a ){ return "string" == typeof a } function isNull ( a ){ return null === a } function isName ( a ){ return a instanceof Name } function isCmd ( a , b ){ return a instanceof Cmd && ( void 0 === b || a . cmd === b )} function isDict ( a , b ){ if ( ! ( a instanceof Dict )) return ! 1 ; if ( ! b ) return ! 0 ; var c = a . get ( "Type" ); return isName ( c ) && c . name === b } function isArray ( a ){ return a instanceof Array } function isStream ( a ){ return "object" == typeof a && null !== a && void 0 !== a . getBytes } function isArrayBuffer ( a ){ return "object" == typeof a && null !== a && void 0 !== a . byteLength } function isRef ( a ){ return a instanceof Ref } function createPromiseCapability (){ var a = {}; return a . promise = new Promise ( function ( b , c ){ a . resolve = b , a . reject = c }), a } function MessageHandler ( a , b ){ this . name = a , this . comObj = b , this . callbackIndex = 1 , this . postMessageTransfers =! 0 ; var c = this . callbacksCapabilities = {}, d = this . actionHandler = {}; d . console_log = [ function ( a ){ console . log . apply ( console , a )}], d . console_error = [ function ( a ){ console . error . apply ( console , a )}], d . _unsupported_feature = [ function ( a ){ UnsupportedManager . notify ( a )}], b . onmessage = function ( a ){ var e = a . data ; if ( e . isReply ){ var f = e . callbackId ; if ( e . callbackId in c ){ var g = c [ f ]; delete c [ f ], "error" in e ? g . reject ( e . error ) : g . resolve ( e . data )} else error (
} catch ( l ){ if ( "number" != typeof l && "longjmp" !== l ) throw l ; asm . setThrew ( 1 , 0 )}} function invoke_iii ( a , b , c ){ try { return Module . dynCall_iii ( a , b , c )} catch ( d ){ if ( "number" != typeof d && "longjmp" !== d ) throw d ; asm . setThrew ( 1 , 0 )}} function invoke_iiiiii ( a , b , c , d , e , f ){ try { return Module . dynCall_iiiiii ( a , b , c , d , e , f )} catch ( g ){ if ( "number" != typeof g && "longjmp" !== g ) throw g ; asm . setThrew ( 1 , 0 )}} function invoke_diii ( a , b , c , d ){ try { return Module . dynCall_diii ( a , b , c , d )} catch ( e ){ if ( "number" != typeof e && "longjmp" !== e ) throw e ; asm . setThrew ( 1 , 0 )}} function invoke_i ( a ){ try { return Module . dynCall_i ( a )} catch ( b ){ if ( "number" != typeof b && "longjmp" !== b ) throw b ; asm . setThrew ( 1 , 0 )}} function invoke_iiiii ( a , b , c , d , e ){ try { return Module . dynCall_iiiii ( a , b , c , d , e )} catch ( f ){ if ( "number" != typeof f && "longjmp" !== f ) throw f ; asm . setThrew ( 1 , 0 )}} function invoke_viii ( a , b , c , d ){ try { Module . dynCall_viii ( a , b , c , d )} catch ( e ){ if ( "number" != typeof e && "longjmp" !== e ) throw e ; asm . setThrew ( 1 , 0 )}} function invoke_v ( a ){ try { Module . dynCall_v ( a )} catch ( b ){ if ( "number" != typeof b && "longjmp" !== b ) throw b ; asm . setThrew ( 1 , 0 )}} function invoke_iiiiiiiii ( a , b , c , d , e , f , g , h , i ){ try { return Module . dynCall_iiiiiiiii ( a , b , c , d , e , f , g , h , i )} catch ( j ){ if ( "number" != typeof j && "longjmp" !== j ) throw j ; asm . setThrew ( 1 , 0 )}} function invoke_iiiiid ( a , b , c , d , e , f ){ try { return Module . dynCall_iiiiid ( a , b , c , d , e , f )} catch ( g ){ if ( "number" != typeof g && "longjmp" !== g ) throw g ; asm . setThrew ( 1 , 0 )}} function invoke_viiii ( a , b , c , d , e ){ try { Module . dynCall_viiii ( a , b , c , d , e )} catch ( f ){ if ( "number" != typeof f && "longjmp" !== f ) throw f ; asm . setThrew ( 1 , 0 )}} function ExitStatus ( a ){ this . name = "ExitStatus" , this . message = "Program terminated with exit(" + a + ")" , this . status = a } function run ( a ){ function b (){ Module . calledRun || ( Module . calledRun =! 0 , ABORT || ( ensureInitRuntime (), preMain (), Module . onRuntimeInitialized && Module . onRuntimeInitialized (), Module . _main && shouldRunNow && Module . callMain ( a ), postRun ()))} a = a || Module . arguments , null === preloadStartTime && ( preloadStartTime = Date . now ()), runDependencies > 0 || ( preRun (), runDependencies > 0 || Module . calledRun || ( Module . setStatus ? ( Module . setStatus ( "Running..." ), setTimeout ( function (){ setTimeout ( function (){ Module . setStatus ( "" )}, 1 ), b ()}, 1 )) : b ()))} function exit ( a , b ){ if ( ! b ||! Module . noExitRuntime ) throw Module . noExitRuntime || ( ABORT =! 0 , EXITSTATUS = a , STACKTOP = initialStackTop , exitRuntime (), Module . onExit && Module . onExit ( a )), ENVIRONMENT_IS_NODE ? ( process . stdout . once ( "drain" , function (){ process . exit ( a )}), console . log ( " " ), setTimeout ( function (){ process . exit ( a )}, 500 )) : ENVIRONMENT_IS_SHELL && "function" == typeof quit && quit ( a ), new ExitStatus ( a )} function abort ( a ){ void 0 !== a ? ( Module . print ( a ), Module . printErr ( a ), a = JSON . stringify ( a )) : a = "" , ABORT =! 0 , EXITSTATUS = 1 ; var b = "\nIf this abort() is unexpected, build with -s ASSERTIONS=1 which can give more information." , c = "abort(" + a + ") at " + stackTrace () + b ; throw abortDecorators && abortDecorators . forEach ( function ( b ){ c = b ( c , a )}), c } Module = Module || {}; var Module ; Module || ( Module = ( "undefined" != typeof CharLS ? CharLS : null ) || {}); var moduleOverrides = {}; for ( var key in Module ) Module . hasOwnProperty ( key ) && ( moduleOverrides [ key ] = Module [ key ]); var ENVIRONMENT_IS_WEB = "object" == typeof window , ENVIRONMENT_IS_WORKER = "function" == typeof importScripts , ENVIRONMENT_IS_NODE = "object" == typeof process && "function" == typeof require &&! ENVIRONMENT_IS_WEB &&! ENVIRONMENT_IS_WORKER , ENVIRONMENT_IS_SHELL =! ENVIRONMENT_IS_WEB &&! ENVIRONMENT_IS_NODE &&! ENVIRONMENT_IS_WORKER ; if ( ENVIRONMENT_IS_NODE ){ Module . print || ( Module . print = function ( a ){ process . stdout . write ( a + "\n" )}), Module . printErr || ( Module . printErr = function ( a ){ process . stderr . write ( a + "\n" )}); var nodeFS = require ( "fs" ), nodePath = require ( "path" ); Module . read = function ( a , b ){ a = nodePath . normalize ( a ); var c = nodeFS . readFileSync ( a ); return c || a == nodePath . resolve ( a ) || ( a = path . join ( __dirname , ".." , "src" , a ), c = nodeFS . readFileSync ( a )), c &&! b && ( c = c . toString ()), c }, Module . readBinary = function ( a ){ var b = Module . read ( a , ! 0 ); return b . buffer || ( b = new Uint8Array ( b )), assert ( b . buffer ), b }, Module . load = function ( a ){ globalEval ( read ( a ))}, Module . thisProgram || ( process . argv . length > 1 ? Module . thisProgram = process . argv [ 1 ]. replace ( /\\/g , "/" ) : Module . thisProgram = "unknown-program" ), Module . arguments = process . argv . slice ( 2 ), "undefi
allocate([32,97,32,100,105,114,101,99,116,111,114,121,0,73,115,32,97,32,100,105,114,101,99,116,111,114,121,0,84,101,120,116,32,102,105,108,101,32,98,117,115,121,0,69,120,101,99,32,102,111,114,109,97,116,32,101,114,114,111,114,0,73,110,118,97,108,105,100,32,97,114,103,117,109,101,110,116,0,65,114,103,117,109,101,110,116,32,108,105,115,116,32,116,111,111,32,108,111,110,103,0,83,121,109,98,111,108,105,99,32,108,105,110,107,32,108,111,111,112,0,70,105,108,101,110,97,109,101,32,116,111,111,32,108,111,110,103,0,84,111,111,32,109,97,110,121,32,111,112,101,110,32,102,105,108,101,115,32,105,110,32,115,121,115,116,101,109,0,78,111,32,102,105,108,101,32,100,101,115,99,114,105,112,116,111,114,115,32,97,118,97,105,108,97,98,108,101,0,66,97,100,32,102,105,108,101,32,100,101,115,99,114,105,112,116,111,114,0,78,111,32,99,104,105,108,100,32,112,114,111,99,101,115,115,0,66,97,100,32,97,100,100,114,101,115,115,0,70,105,108,101,32,116,111,111,32,108,97,114,103,101,0,84,111,111,32,109,97,110,121,32,108,105,110,107,115,0,78,111,32,108,111,99,107,115,32,97,118,97,105,108,97,98,108,101,0,82,101,115,111,117,114,99,101,32,100,101,97,100,108,111,99,107,32,119,111,117,108,100,32,111,99,99,117,114,0,83,116,97,116,101,32,110,111,116,32,114,101,99,111,118,101,114,97,98,108,101,0,80,114,101,118,105,111,117,115,32,111,119,110,101,114,32,100,105,101,100,0,79,112,101,114,97,116,105,111,110,32,99,97,110,99,101,108,101,100,0,70,117,110,99,116,105,111,110,32,110,111,116,32,105,109,112,108,101,109,101,110,116,101,100,0,78,111,32,109,101,115,115,97,103,101,32,111,102,32,100,101,115,105,114,101,100,32,116,121,112,101,0,73,100,101,110,116,105,102,105,101,114,32,114,101,109,111,118,101,100,0,68,101,118,105,99,101,32,110,111,116,32,97,32,115,116,114,101,97,109,0,78,111,32,100,97,116,97,32,97,118,97,105,108,97,98,108,101,0,68,101,118,105,99,101,32,116,105,109,101,111,117,116,0,79,117,116,32,111,102,32,115,116,114,101,97,109,115,32,114,101,115,111,117,114,99,101,115,0,76,105,110,107,32,104,97,115,32,98,101,101,110,32,115,101,118,101,114,101,100,0,80,114,111,116,111,99,111,108,32,101,114,114,111,114,0,66,97,100,32,109,101,115,115,97,103,101,0,70,105,108,101,32,100,101,115,99,114,105,112,116,111,114,32,105,110,32,98,97,100,32,115,116,97,116,101,0,78,111,116,32,97,32,115,111,99,107,101,116,0,68,101,115,116,105,110,97,116,105,111,110,32,97,100,100,114,101,115,115,32,114,101,113,117,105,114,101,100,0,77,101,115,115,97,103,101,32,116,111,111,32,108,97,114,103,101,0,80,114,111,116,111,99,111,108,32,119,114,111,110,103,32,116,121,112,101,32,102,111,114,32,115,111,99,107,101,116,0,80,114,111,116,111,99,111,108,32,110,111,116,32,97,118,97,105,108,97,98,108,101,0,80,114,111,116,111,99,111,108,32,110,111,116,32,115,117,112,112,111,114,116,101,100,0,83,111,99,107,101,116,32,116,121,112,101,32,110,111,116,32,115,117,112,112,111,114,116,101,100,0,78,111,116,32,115,117,112,112,111,114,116,101,100,0,80,114,111,116,111,99,111,108,32,102,97,109,105,108,121,32,110,111,116,32,115,117,112,112,111,114,116,101,100,0,65,100,100,114,101,115,115,32,102,97,109,105,108,121,32,110,111,116,32,115,117,112,112,111,114,116,101,100,32,98,121,32,112,114,111,116,111,99,111,108,0,65,100,100,114,101,115,115,32,110,111,116,32,97,118,97,105,108,97,98,108,101,0,78,101,116,119,111,114,107,32,105,115,32,100,111,119,110,0,78,101,116,119,111,114,107,32,117,110,114,101,97,99,104,97,98,108,101,0,67,111,110,110,101,99,116,105,111,110,32,114,101,115,101,116,32,98,121,32,110,101,116,119,111,114,107,0,67,111,110,110,101,99,116,105,111,110,32,97,98,111,114,116,101,100,0,78,111,32,98,117,102,102,101,114,32,115,112,97,99,101,32,97,118,97,105,108,97,98,108,101,0,83,111,99,107,101,116,32,105,115,32,99,111,110,110,101,99,116,101,100,0,83,111,99,107,101,116,32,110,111,116,32,99,111,110,110,101,99,116,101,100,0,67,97,110,110,111,116,32,115,101,110,100,32,97,102,116,101,114,32,115,111,99,107,101,116,32,115,104,117,116,100,111,119,110,0,79,112,101,114,97,116,105,111,110,32,97,108,114,101,97,100,121,32,105,110,32,112,114,111,103,114,101,115,115,0,79,112,101,114,97,116,105,111,110,32,105,110,32,112,114,111,103,114,101,115,115,0
}Browser.resizeCanvas?(a.width!=d&&(a.width=d),a.height!=e&&(a.height=e)," undefined "!=typeof a.style&&(a.style.removeProperty(" width "),a.style.removeProperty(" height "))):(a.width!=b&&(a.width=b),a.height!=c&&(a.height=c)," undefined "!=typeof a.style&&(d!=b||e!=c?(a.style.setProperty(" width ",d+" px "," important "),a.style.setProperty(" height ",e+" px "," important ")):(a.style.removeProperty(" width "),a.style.removeProperty(" height "))))},wgetRequests:{},nextWgetRequestHandle:0,getNextWgetRequestHandle:function(){var a=Browser.nextWgetRequestHandle;return Browser.nextWgetRequestHandle++,a}};Module._malloc=_malloc;var SYSCALLS={varargs:0,get:function(a){SYSCALLS.varargs+=4;var b=HEAP32[SYSCALLS.varargs-4>>2];return b},getStr:function(){var a=Pointer_stringify(SYSCALLS.get());return a},get64:function(){var a=SYSCALLS.get(),b=SYSCALLS.get();return assert(a>=0?0===b:-1===b),a},getZero:function(){assert(0===SYSCALLS.get())}};Module._i64Add=_i64Add,Module._bitshift64Lshr=_bitshift64Lshr;var _BDtoIHigh=!0;Module._memcpy=_memcpy;var _emscripten_postinvoke=!0;Module._bitshift64Shl=_bitshift64Shl,Module._memmove=_memmove;var _emscripten_preinvoke=!0,_BItoD=!0,___dso_handle=allocate(1," i32 * ",ALLOC_STATIC);Module.requestFullScreen=function(a,b,c){Browser.requestFullScreen(a,b,c)},Module.requestAnimationFrame=function(a){Browser.requestAnimationFrame(a)},Module.setCanvasSize=function(a,b,c){Browser.setCanvasSize(a,b,c)},Module.pauseMainLoop=function(){Browser.mainLoop.pause()},Module.resumeMainLoop=function(){Browser.mainLoop.resume()},Module.getUserMedia=function(){Browser.getUserMedia()},Module.createContext=function(a,b,c,d){return Browser.createContext(a,b,c,d)},STACK_BASE=STACKTOP=Runtime.alignMemory(STATICTOP),staticSealed=!0,STACK_MAX=STACK_BASE+TOTAL_STACK,DYNAMIC_BASE=DYNAMICTOP=Runtime.alignMemory(STACK_MAX),assert(TOTAL_MEMORY>DYNAMIC_BASE," TOTAL_MEMORY not big enough for stack ");var cttz_i8=allocate([8,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,5,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,6,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,5,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,7,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,5,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,6,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,5,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0]," i8 " , ALLOC_DYNAMIC ); Module . asmGlobalArg = { Math : Math , Int8Array : Int8Array , Int16Array : Int16Array , Int32Array : Int32Array , Uint8Array : Uint8Array , Uint16Array : Uint16Array , Uint32Array : Uint32Array , Float32Array : Float32Array , Float64Array : Float64Array , NaN : NaN , Infinity : 1 / 0 }, Module . asmLibraryArg = { abort : abort , assert : assert , invoke_iiiiiiii : invoke_iiiiiiii , invoke_viiiii : invoke_viiiii , invoke_iiiiiid : invoke_iiiiiid , invoke_vi : invoke_vi , invoke_vii : invoke_vii , invoke_iiiiiii : invoke_iiiiiii , invoke_ii : invoke_ii , invoke_iiiiiiiiiiii : invoke_iiiiiiiiiiii , invoke_iiii : invoke_iiii , invoke_viiiiiiiiiiiiiii : invoke_viiiiiiiiiiiiiii , invoke_viiiiii : invoke_viiiiii , invoke_viiiiiii : invoke_viiiiiii , invoke_viiiiiiiiii : invoke_viiiiiiiiii , invoke_iii : invoke_iii , invoke_iiiiii : invoke_iiiiii , invoke_diii : invoke_diii , invoke_i : invoke_i , invoke_iiiii : invoke_iiiii , invoke_viii : invoke_viii , invoke_v : invoke_v , invoke_iiiiiiiii : invoke_iiiiiiiii , invoke_iiiiid : invoke_iiiiid , invoke_viiii : invoke_viiii , _fabs : _fabs , _strftime : _strftime , _pthread_cond_wait : _pthread_cond_wait , ___lock : ___lock , _pthread_key_create : _pthread_key_create , _abort : _abort , ___cxa_guard_acquire : ___cxa_guard_acquire , ___setErrNo : ___setErrNo , ___gxx_personality_v0 : ___gxx_personality_v0 , ___assert_fail : ___assert_fail , ___cxa_free_exception : ___cxa_free_exception , ___cxa_allocate_exception : ___cxa_allocate_exception , ___cxa_find_matching_catch : ___cxa_find_matching_catch , __isLeapYear : __isLeapYear , ___cxa_guard_release : ___cxa_guard_release , __addDays : __addDays , _strftime_l : _strftime_l , _emscripten_set_main_loop_timing : _emscripten_set_main_loop_timing , _llvm_eh_typeid_for : _llvm_eh_typeid_for , _sbrk : _sbrk , ___cxa_begin_catch : ___cxa_begin_catch , _emscripten_me
f [ h + 92 >> 2 ] = 0 ; f [ h + 96 >> 2 ] = 0 ; f [ h + 100 >> 2 ] = 32 ; f [ h + 104 >> 2 ] = 0 ; f [ h + 108 >> 2 ] = 0 ; d [ h + 112 >> 0 ] = 0 ; l = h + 116 | 0 ; f [ l >> 2 ] = 0 ; f [ l + 4 >> 2 ] = 0 ; f [ l + 8 >> 2 ] = 0 ; f [ l + 12 >> 2 ] = 0 ; f [ l + 16 >> 2 ] = 0 ; f [ h >> 2 ] = 35884 ; f [ h + 136 >> 2 ] = m ; f [ h + 140 >> 2 ] = i ; f [ h + 144 >> 2 ] = n ; f [ h + 148 >> 2 ] = a ; f [ h + 152 >> 2 ] = c ; f [ h + 156 >> 2 ] = g ; f [ h + 160 >> 2 ] = 64 ; a = h + 164 | 0 ; f [ a >> 2 ] = 0 ; f [ a + 4 >> 2 ] = 0 ; f [ a + 8 >> 2 ] = 0 ; f [ a + 12 >> 2 ] = 0 ; f [ h + 180 >> 2 ] = f [ b >> 2 ]; f [ h + 184 >> 2 ] = 0 ; f [ h + 188 >> 2 ] = 0 ; f [ h + 192 >> 2 ] = 0 ; a = h + 4576 | 0 ; c = h + 196 | 0 ; do { f [ c >> 2 ] = 0 ; f [ c + 4 >> 2 ] = 0 ; e [ c + 8 >> 1 ] = 0 ; e [ c + 10 >> 1 ] = 1 ; c = c + 12 | 0 } while (( c | 0 ) != ( a | 0 )); f [ a >> 2 ] = 0 ; f [ a + 4 >> 2 ] = 0 ; e [ a + 8 >> 1 ] = 0 ; d [ a + 10 >> 0 ] = 0 ; b = h + 4588 | 0 ; f [ b >> 2 ] = 0 ; f [ b + 4 >> 2 ] = 0 ; e [ b + 8 >> 1 ] = 0 ; d [ b + 10 >> 0 ] = 0 ; b = h + 4600 | 0 ; f [ b >> 2 ] = 0 ; f [ b + 4 >> 2 ] = 0 ; f [ b + 8 >> 2 ] = 0 ; f [ b + 12 >> 2 ] = 0 ; f [ b + 16 >> 2 ] = 0 ; f [ b + 20 >> 2 ] = 0 ; f [ b + 24 >> 2 ] = 0 ; d [ b + 28 >> 0 ] = 0 ; if ( ! ( f [ h + 32 >> 2 ] | 0 )) f [ h + 24 >> 2 ] = 1 ; b = h ; return b | 0 }} if (( a | 0 ) >= 17 ){ b = 0 ; return b | 0 } i = n << 1 ; i = (( i + m | 0 ) / ( i | 1 | 0 ) | 0 ) + 1 | 0 ; if ( c ){ a = 0 ; while ( 1 ) if (( 1 << a | 0 ) < ( i | 0 )) a = a + 1 | 0 ; else break ; c = 0 ; while ( 1 ) if (( 1 << c | 0 ) < ( m | 0 )) c = c + 1 | 0 ; else break ; g = (( c | 0 ) < 8 ? 8 : c ) + c << 1 ; h = Iu ( 4632 ) | 0 ; f [ h + 4 >> 2 ] = 0 ; j = h + 8 | 0 ; k = b ; l = j + 84 | 0 ; do { f [ j >> 2 ] = f [ k >> 2 ]; j = j + 4 | 0 ; k = k + 4 | 0 } while (( j | 0 ) < ( l | 0 )); f [ h + 92 >> 2 ] = 0 ; f [ h + 96 >> 2 ] = 0 ; f [ h + 100 >> 2 ] = 32 ; f [ h + 104 >> 2 ] = 0 ; f [ h + 108 >> 2 ] = 0 ; d [ h + 112 >> 0 ] = 0 ; l = h + 116 | 0 ; f [ l >> 2 ] = 0 ; f [ l + 4 >> 2 ] = 0 ; f [ l + 8 >> 2 ] = 0 ; f [ l + 12 >> 2 ] = 0 ; f [ l + 16 >> 2 ] = 0 ; f [ h >> 2 ] = 36052 ; f [ h + 136 >> 2 ] = m ; f [ h + 140 >> 2 ] = i ; f [ h + 144 >> 2 ] = n ; f [ h + 148 >> 2 ] = a ; f [ h + 152 >> 2 ] = c ; f [ h + 156 >> 2 ] = g ; f [ h + 160 >> 2 ] = 64 ; a = h + 164 | 0 ; f [ a >> 2 ] = 0 ; f [ a + 4 >> 2 ] = 0 ; f [ a + 8 >> 2 ] = 0 ; f [ a + 12 >> 2 ] = 0 ; f [ h + 180 >> 2 ] = f [ b >> 2 ]; f [ h + 184 >> 2 ] = 0 ; f [ h + 188 >> 2 ] = 0 ; f [ h + 192 >> 2 ] = 0 ; a = h + 4576 | 0 ; c = h + 196 | 0 ; do { f [ c >> 2 ] = 0 ; f [ c + 4 >> 2 ] = 0 ; e [ c + 8 >> 1 ] = 0 ; e [ c + 10 >> 1 ] = 1 ; c = c + 12 | 0 } while (( c | 0 ) != ( a | 0 )); f [ a >> 2 ] = 0 ; f [ a + 4 >> 2 ] = 0 ; e [ a + 8 >> 1 ] = 0 ; d [ a + 10 >> 0 ] = 0 ; b = h + 4588 | 0 ; f [ b >> 2 ] = 0 ; f [ b + 4 >> 2 ] = 0 ; e [ b + 8 >> 1 ] = 0 ; d [ b + 10 >> 0 ] = 0 ; b = h + 4600 | 0 ; f [ b >> 2 ] = 0 ; f [ b + 4 >> 2 ] = 0 ; f [ b + 8 >> 2 ] = 0 ; f [ b + 12 >> 2 ] = 0 ; f [ b + 16 >> 2 ] = 0 ; f [ b + 20 >> 2 ] = 0 ; f [ b + 24 >> 2 ] = 0 ; d [ b + 28 >> 0 ] = 0 ; if ( ! ( f [ h + 32 >> 2 ] | 0 )) f [ h + 24 >> 2 ] = 1 ; b = h ; return b | 0 } else { a = 0 ; while ( 1 ) if (( 1 << a | 0 ) < ( i | 0 )) a = a + 1 | 0 ; else break ; c = 0 ; while ( 1 ) if (( 1 << c | 0 ) < ( m | 0 )) c = c + 1 | 0 ; else break ; g = (( c | 0 ) < 8 ? 8 : c ) + c << 1 ; h = Iu ( 4632 ) | 0 ; f [ h + 4 >> 2 ] = 0 ; j = h + 8 | 0 ; k = b ; l = j + 84 | 0 ; do { f [ j >> 2 ] = f [ k >> 2 ]; j = j + 4 | 0 ; k = k + 4 | 0 } while (( j | 0 ) < ( l | 0 )); f [ h + 92 >> 2 ] = 0 ; f [ h + 96 >> 2 ] = 0 ; f [ h + 100 >> 2 ] = 32 ; f [ h + 104 >> 2 ] = 0 ; f [ h + 108 >> 2 ] = 0 ; d [ h + 112 >> 0 ] = 0 ; l = h + 116 | 0 ; f [ l >> 2 ] = 0 ; f [ l + 4 >> 2 ] = 0 ; f [ l + 8 >> 2 ] = 0 ; f [ l + 12 >> 2 ] = 0 ; f [ l + 16 >> 2 ] = 0 ; f [ h >> 2 ] = 36080 ; f [ h + 136 >> 2 ] = m ; f [ h + 140 >> 2 ] = i ; f [ h + 144 >> 2 ] = n ; f [ h + 148 >> 2 ] = a ; f [ h + 152 >> 2 ] = c ; f [ h + 156 >> 2 ] = g ; f [ h + 160 >> 2 ] = 64 ; a = h + 164 | 0 ; f [ a >> 2 ] = 0 ; f [ a + 4 >> 2 ] = 0 ; f [ a + 8 >> 2 ] = 0 ; f [ a + 12 >> 2 ] = 0 ; f [ h + 180 >> 2 ] = f [ b >> 2 ]; f [ h + 184 >> 2 ] = 0 ; f [ h + 188 >> 2 ] = 0 ; f [ h + 192 >> 2 ] = 0 ; a = h + 4576 | 0 ; c = h + 196 | 0 ; do { f [ c >> 2 ] = 0 ; f [ c + 4 >> 2 ] = 0 ; e [ c + 8 >> 1 ] = 0 ; e [ c + 10 >> 1 ] = 1 ; c = c + 12 | 0 } while (( c | 0 ) != ( a | 0 )); f [ a >> 2 ] = 0 ; f [ a + 4 >> 2 ] = 0 ; e [ a + 8 >> 1 ] = 0 ; d [ a + 10 >> 0 ] = 0 ; b = h + 4588 | 0 ; f [ b >> 2 ] = 0 ; f [ b + 4 >> 2 ] = 0 ; e [ b + 8 >> 1 ] = 0 ; d [ b + 10 >> 0 ] = 0 ; b = h + 4600 | 0 ; f [ b >> 2 ] = 0 ; f [ b + 4 >> 2 ] = 0 ; f [ b + 8 >> 2 ] = 0 ; f [ b + 12 >> 2 ] = 0 ; f [ b + 16 >> 2 ] = 0 ; f [ b + 20 >> 2 ] = 0 ; f [ b + 24 >> 2 ] = 0 ; d [ b + 28 >> 0 ] = 0 ; if ( ! ( f [ h + 32 >> 2 ] | 0 )) f [ h + 24 >> 2 ] = 1 ; b = h ; return b | 0 } return 0 } function Zb (){ var a = 0 , b = 0 , c = 0 , d = 0 , e = 0 , g = 0 , h = 0 ; a = 2832 ; do { f [ a >> 2 ] = 0 ; f [ a + 4 >> 2 ] = 0 ; a = a + 8 | 0 } while (( a | 0 ) != 4880 ); ws ( 2832 , 0 , 2048 ) | 0 ; a = 0 ; do { h = 2832 + ( a + 128 << 3 ) | 0 ; f [ h >> 2 ] = 0 ; f [ h + 4 >> 2 ] = 1 ; a = a + 1 | 0 } while (( a | 0 ) != 128 ); a = 3088 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3096 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3104 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3112 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3120 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3128 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3136 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3144 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3152 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3160 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3168 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3176 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3184 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3192 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3200 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3208 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3216 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3224 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3232 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3240 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3248 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3256 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3264 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3272 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3280 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3288 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3296 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3304 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3312 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3320 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3328 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 3336 ; f [ a >> 2 ] = 1 ; f [ a + 4 >> 2 ] = 3 ; a = 2896 ; f [ a >> 2 ] = 2 ; f [ a + 4 >> 2 ] = 5 ; a = 2904 ; f [ a >> 2 ] = 2 ; f [ a + 4 >> 2 ] = 5 ; a = 2912 ; f [ a >> 2 ] = 2 ; f [ a + 4 >> 2 ] = 5 ; a = 2920 ; f [ a >> 2 ] = 2 ; f [ a + 4 >> 2 ] = 5 ; a = 2928 ; f [ a >> 2 ] = 2 ; f [ a + 4 >> 2 ] = 5 ; a = 2936 ; f [ a >> 2 ] = 2 ; f [ a + 4 >> 2 ] = 5 ; a = 2944 ; f [ a >> 2 ] = 2 ; f [ a + 4 >> 2 ] = 5 ; a = 29
cn ( j ); _a ( k | 0 )} f [ k + 128 >> 2 ] = 0 ; f [ k + 132 >> 2 ] =- 1 ; f [ k >> 2 ] = 36200 ; f [ k + 56 >> 2 ] = 36220 ; r = 0 ; ka ( 180 , h | 0 ); g = r ; r = 0 ; do if ( g & 1 ) c = Qa () | 0 ; else { f [ h >> 2 ] = 36236 ; g = k + 36 | 0 ; f [ g >> 2 ] = 0 ; f [ g + 4 >> 2 ] = 0 ; f [ g + 8 >> 2 ] = 0 ; f [ g + 12 >> 2 ] = 0 ; f [ k + 52 >> 2 ] = 16 ; f [ c >> 2 ] = 0 ; f [ c + 4 >> 2 ] = 0 ; f [ c + 8 >> 2 ] = 0 ; r = 0 ; la ( 63 , h | 0 , c | 0 ); a = r ; r = 0 ; if ( a & 1 ){ k = Qa () | 0 ; Fm ( c ); Fm ( g ); kn ( h ); c = k ; break } Fm ( c ); r = 0 ; c = pa ( 28 , k | 0 , 49087 , 24 ) | 0 ; a = r ; r = 0 ; if (( ! ( a & 1 ) ? ( r = 0 , e = ua ( 36 , c | 0 , b | 0 ) | 0 , b = r , r = 0 , ! ( b & 1 )) : 0 ) ? ( r = 0 , pa ( 28 , e | 0 , 49112 , 20 ) | 0 , b = r , r = 0 , ! ( b & 1 )) : 0 ){ a = Pa ( 16 ) | 0 ; r = 0 ; la ( 64 , i | 0 , h | 0 ); b = r ; r = 0 ; if ( ! ( b & 1 )){ if (( d [ 8 ] | 0 ) == 0 ? ( Ka ( 8 ) | 0 ) != 0 : 0 ){ nb ( 72 , 35648 , q | 0 ) | 0 ; Sa ( 8 )} r = 0 ; Da ( 36 , a | 0 , 1 , 35648 , i | 0 ); b = r ; r = 0 ; if ( b & 1 ) e = 1 ; else { r = 0 ; za ( 6 , a | 0 , 824 , 96 ); r = 0 ; e = 0 } c = Qa () | 0 ; Fm ( i ); if ( ! e ){ i = c ; f [ k >> 2 ] = 36200 ; f [ j >> 2 ] = 36220 ; f [ h >> 2 ] = 36236 ; Fm ( g ); kn ( h ); cn ( j ); _a ( i | 0 )}} else c = Qa () | 0 ; Oa ( a | 0 ); i = c ; f [ k >> 2 ] = 36200 ; f [ j >> 2 ] = 36220 ; f [ h >> 2 ] = 36236 ; Fm ( g ); kn ( h ); cn ( j ); _a ( i | 0 )} i = Qa () | 0 ; f [ k >> 2 ] = 36200 ; f [ j >> 2 ] = 36220 ; f [ h >> 2 ] = 36236 ; Fm ( g ); kn ( h ); cn ( j ); _a ( i | 0 )} while ( 0 ); k = c ; cn ( j ); _a ( k | 0 )} function vc ( a , b , c , g , i ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; g = g | 0 ; i = i | 0 ; var j = 0 , k = 0 , l = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , r = 0 , s = 0 , t = 0 ; n = a + 4 | 0 ; j = f [ n >> 2 ] | 0 ; a : do switch ( f [ j + 16 >> 2 ] | 0 ){ case 3 : { if (( f [ j + 24 >> 2 ] | 0 ) == 2 ){ if (( g | 0 ) <= 0 ) break a ; j = a + 40 | 0 ; a = 0 ; do { i = f [ j >> 2 ] | 0 ; l = h [ b + ( a * 6 | 0 ) + 2 >> 1 ] << i ; k = h [ b + ( a * 6 | 0 ) + 4 >> 1 ] << i ; m = ( h [ b + ( a * 6 | 0 ) >> 1 ] << i ) - ( k + l >> 2 ) + 16384 | 0 ; e [ c + ( a * 6 | 0 ) >> 1 ] = ( k + 32768 + m & 65535 ) >>> i ; e [ c + ( a * 6 | 0 ) + 2 >> 1 ] = ( m & 65535 ) >>> i ; e [ c + ( a * 6 | 0 ) + 4 >> 1 ] = ( l + 32768 + m & 65535 ) >>> i ; a = a + 1 | 0 } while (( a | 0 ) != ( g | 0 ))} else { k = ( g | 0 ) < ( i | 0 ) ? g : i ; if (( k | 0 ) <= 0 ) break a ; l = i << 1 ; j = a + 40 | 0 ; a = 0 ; do { m = f [ j >> 2 ] | 0 ; p = h [ b + ( a + i << 1 ) >> 1 ] << m ; q = h [ b + ( a + l << 1 ) >> 1 ] << m ; o = ( h [ b + ( a << 1 ) >> 1 ] << m ) - ( q + p >> 2 ) + 16384 | 0 ; e [ c + ( a * 6 | 0 ) >> 1 ] = ( q + 32768 + o & 65535 ) >>> m ; e [ c + ( a * 6 | 0 ) + 2 >> 1 ] = ( o & 65535 ) >>> m ; e [ c + ( a * 6 | 0 ) + 4 >> 1 ] = ( p + 32768 + o & 65535 ) >>> m ; a = a + 1 | 0 } while (( a | 0 ) != ( k | 0 ))} break } case 4 : { if (( f [ j + 24 >> 2 ] | 0 ) == 1 ? ( m = ( g | 0 ) < ( i | 0 ) ? g : i ,( m | 0 ) > 0 ) : 0 ){ l = i << 1 ; j = a + 40 | 0 ; a = i * 3 | 0 ; k = 0 ; do { q = f [ j >> 2 ] | 0 ; p = h [ b + ( k + i << 1 ) >> 1 ] << q ; s = h [ b + ( k + l << 1 ) >> 1 ] << q ; o = ( h [ b + ( k << 1 ) >> 1 ] << q ) - ( s + p >> 2 ) + 16384 | 0 ; r = e [ b + ( k + a << 1 ) >> 1 ] | 0 ; t = As (( o & 65535 ) >>> q & 65535 | 0 , 0 , 16 ) | 0 ; p = ( p + 32768 + o & 65535 ) >>> q | G ; r = As ( r & 65535 | 0 , 0 , 48 ) | 0 ; r = t | ( s + 32768 + o & 65535 ) >>> q & 65535 | r ; p = p & 65535 | G ; q = c + ( k << 3 ) | 0 ; o = q ; e [ o >> 1 ] = r ; e [ o + 2 >> 1 ] = r >>> 16 ; q = q + 4 | 0 ; e [ q >> 1 ] = p ; e [ q + 2 >> 1 ] = p >>> 16 ; k = k + 1 | 0 } while (( k | 0 ) != ( m | 0 ))} break } default : {}} while ( 0 ); j = f [ n >> 2 ] | 0 ; if ( ! ( d [ j + 32 >> 0 ] | 0 )) return ; k = f [ j + 16 >> 2 ] | 0 ; if (( g | 0 ) <= 0 ) return ; j = c ; a = 0 ; while ( 1 ){ t = j + 4 | 0 ; s = e [ j >> 1 ] | 0 ; e [ j >> 1 ] = e [ t >> 1 ] | 0 ; e [ t >> 1 ] = s ; a = a + 1 | 0 ; if (( a | 0 ) == ( g | 0 )) break ; else j = j + ( k << 1 ) | 0 } return } function wc ( a ){ a = a | 0 ; var b = 0 , c = 0 , d = 0 ; f [ a >> 2 ] = 36340 ; b = f [ a + 20 >> 2 ] | 0 ; if ( b ){ c = a + 24 | 0 ; if (( f [ c >> 2 ] | 0 ) != ( b | 0 )) f [ c >> 2 ] = b ; Ju ( b )} d = f [ a + 8 >> 2 ] | 0 ; if ( ! d ) return ; b = a + 12 | 0 ; c = f [ b >> 2 ] | 0 ; if (( c | 0 ) != ( d | 0 )) f [ b >> 2 ] = c + ( ~ (( c +- 2 - d | 0 ) >>> 1 ) << 1 ); Ju ( d ); return } function xc ( a ){ a = a | 0 ; var b = 0 , c = 0 , d = 0 ; f [ a >> 2 ] = 36340 ; b = f [ a + 20 >> 2 ] | 0 ; if ( b ){ c = a + 24 | 0 ; if (( f [ c >> 2 ] | 0 ) != ( b | 0 )) f [ c >> 2 ] = b ; Ju ( b )} d = f [ a + 8 >> 2 ] | 0 ; if ( ! d ){ Ju ( a ); return } b = a + 12 | 0 ; c = f [ b >> 2 ] | 0 ; if (( c | 0 ) != ( d | 0 )) f [ b >> 2 ] = c + ( ~ (( c +- 2 - d | 0 ) >>> 1 ) << 1 ); Ju ( d ); Ju ( a ); return } function yc ( a , b , c , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; var g = 0 , h = 0 , i = 0 , j = 0 , k = 0 ; g = a + 48 | 0 ; if ( ! ( f [ g >> 2 ] | 0 )){ j = a + 52 | 0 ; Cc ( a , b , f [ j >> 2 ] | 0 , c , e ); f [ j >> 2 ] = ( f [ j >> 2 ] | 0 ) + ( f [( f [ a + 4 >> 2 ] | 0 ) + 12 >> 2 ] | 0 ); return } k = a + 4 | 0 ; h = c << 1 ; i = ca ( h , f [( f [ k >> 2 ] | 0 ) + 16 >> 2 ] | 0 ) | 0 ; j = a + 20 | 0 ; Cc ( a , b , f [ j >> 2 ] | 0 , c , e ); b = f [ k >> 2 ] | 0 ; if (( f [ b + 28 >> 2 ] | 0 ) == 536870912 ) uc ( f [ j >> 2 ] | 0 , ca ( h , f [ b + 16 >> 2 ] | 0 ) | 0 ); k = f [ g >> 2 ] | 0 ; if (( kx [ f [( f [ k >> 2 ] | 0 ) + 48 >> 2 ] & 63 ]( k , f [ j >> 2 ] | 0 , i ) | 0 ) == ( i | 0 )) return ; b = Pa ( 16 ) | 0 ; if (( d [ 8 ] | 0 ) == 0 ? ( Ka ( 8 ) | 0 ) != 0 : 0 ){ nb ( 72 , 35648 , q | 0 ) | 0 ; Sa ( 8 )} r = 0 ; za ( 7 , b | 0 , 3 , 35648 ); k = r ; r = 0 ; if ( k & 1 ){ k = Qa () | 0 ; Oa ( b | 0 ); _a ( k | 0 )} else ob ( b | 0 , 824 , 96 )} function zc ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; var e = 0 ; e = f [ a + 48 >> 2 ] | 0 ; if ( ! e ){ e = a + 52 | 0 ; Ac ( a , f [ e >> 2 ] | 0 , b , c , d ); f [ e >> 2 ] = ( f [ e >> 2 ] | 0 ) + ( f [( f [ a + 4 >> 2 ] | 0 ) + 12 >> 2 ] | 0 ); return } else { Bc ( a , e , b , c , d ); return }} function Ac ( a , b , c , g , i ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; g = g | 0 ; i = i | 0 ; var j = 0 , k = 0 , l = 0 , m = 0 , n = 0 , o = 0 , p = 0 ; m = a + 4 | 0 ; j = f [ m >> 2 ] | 0 ; do if ( ! ( d [ j + 32 >> 0 ] | 0 )) n = b ; else { k = a + 8 | 0 ; zs ( f [ k >> 2 ] | 0 , b | 0 , g * 6 | 0 ) | 0 ; j = f [ m >> 2 ] | 0 ; l = f [ j + 16 >> 2 ] | 0 ; if (( g | 0 ) <= 0 ){ n = f [ k >> 2 ] | 0 ; break } b = f [ k >> 2 ] | 0 ; j = b ; k = 0 ; while ( 1 ){ n = j + 4 | 0 ; o = e [ j >> 1 ] | 0 ; e [ j >> 1 ] = e [ n >> 1 ] | 0 ; e [ n >> 1 ] = o ; k = k + 1 | 0 ; if (( k | 0 ) == ( g | 0 )) break ; else j = j + ( l << 1 ) | 0 } n = b ; j = f [ m >> 2 ] | 0 } while ( 0 ); switch ( f [ j + 16 >> 2 ] | 0 ){ case 3 : if (( f [ j + 24 >> 2 ] | 0 ) == 2 ){ if (( g | 0 ) <= 0 ) return ; j = a + 32 | 0 ; b = 0 ; do { i = f [ j >> 2 ] | 0 ; m = h [ n + ( b * 6 | 0 ) >> 1 ] << i ; a = h [ n + ( b * 6 | 0 ) + 2 >> 1 ] << i ; o = (( h [ n + (
b = b | 0 ; c = c | 0 ; g = g | 0 ; i = i | 0 ; var j = 0 , k = 0 , l = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 ; m = a + 4 | 0 ; a = f [ m >> 2 ] | 0 ; a : do switch ( f [ a + 16 >> 2 ] | 0 ){ case 3 : { if (( f [ a + 24 >> 2 ] | 0 ) == 2 ){ if (( g | 0 ) > 0 ) a = 0 ; else break a ; while ( 1 ){ l = e [ b + ( a * 6 | 0 ) + 2 >> 1 ] | 0 ; k = l & 65535 ; i = k + 32768 + ( h [ b + ( a * 6 | 0 ) + 4 >> 1 ] | 0 ) & 65535 ; e [ c + ( a * 6 | 0 ) >> 1 ] = ( h [ b + ( a * 6 | 0 ) >> 1 ] | 0 ) + 32768 + k ; e [ c + ( a * 6 | 0 ) + 2 >> 1 ] = l ; e [ c + ( a * 6 | 0 ) + 4 >> 1 ] = i ; a = a + 1 | 0 ; if (( a | 0 ) == ( g | 0 )) break a }} a = ( g | 0 ) < ( i | 0 ) ? g : i ; if (( a | 0 ) > 0 ){ j = i << 1 ; k = 0 ; do { n = e [ b + ( k + i << 1 ) >> 1 ] | 0 ; o = n & 65535 ; l = o + 32768 + ( h [ b + ( k + j << 1 ) >> 1 ] | 0 ) & 65535 ; e [ c + ( k * 6 | 0 ) >> 1 ] = ( h [ b + ( k << 1 ) >> 1 ] | 0 ) + 32768 + o ; e [ c + ( k * 6 | 0 ) + 2 >> 1 ] = n ; e [ c + ( k * 6 | 0 ) + 4 >> 1 ] = l ; k = k + 1 | 0 } while (( k | 0 ) != ( a | 0 ))} break } case 4 : { if (( f [ a + 24 >> 2 ] | 0 ) == 1 ? ( l = ( g | 0 ) < ( i | 0 ) ? g : i ,( l | 0 ) > 0 ) : 0 ){ a = i << 1 ; j = i * 3 | 0 ; k = 0 ; do { o = e [ b + ( k + i << 1 ) >> 1 ] | 0 ; n = o & 65535 ; p = ( h [ b + ( k << 1 ) >> 1 ] | 0 ) + 32768 + n | 0 ; n = n + 32768 + ( h [ b + ( k + a << 1 ) >> 1 ] | 0 ) | 0 ; q = e [ b + ( k + j << 1 ) >> 1 ] | 0 ; o = As ( o & 65535 | 0 , 0 , 16 ) | 0 ; n = G | n ; q = As ( q & 65535 | 0 , 0 , 48 ) | 0 ; q = p & 65535 | o | q ; n = n & 65535 | G ; o = c + ( k << 3 ) | 0 ; p = o ; e [ p >> 1 ] = q ; e [ p + 2 >> 1 ] = q >>> 16 ; o = o + 4 | 0 ; e [ o >> 1 ] = n ; e [ o + 2 >> 1 ] = n >>> 16 ; k = k + 1 | 0 } while (( k | 0 ) != ( l | 0 ))} break } default : {}} while ( 0 ); a = f [ m >> 2 ] | 0 ; if ( ! ( d [ a + 32 >> 0 ] | 0 )) return ; k = f [ a + 16 >> 2 ] | 0 ; if (( g | 0 ) <= 0 ) return ; a = c ; j = 0 ; while ( 1 ){ q = a + 4 | 0 ; p = e [ a >> 1 ] | 0 ; e [ a >> 1 ] = e [ q >> 1 ] | 0 ; e [ q >> 1 ] = p ; j = j + 1 | 0 ; if (( j | 0 ) == ( g | 0 )) break ; else a = a + ( k << 1 ) | 0 } return } function od ( a ){ a = a | 0 ; var b = 0 , c = 0 , d = 0 ; f [ a >> 2 ] = 36460 ; b = f [ a + 20 >> 2 ] | 0 ; if ( b ){ c = a + 24 | 0 ; if (( f [ c >> 2 ] | 0 ) != ( b | 0 )) f [ c >> 2 ] = b ; Ju ( b )} d = f [ a + 8 >> 2 ] | 0 ; if ( ! d ) return ; b = a + 12 | 0 ; c = f [ b >> 2 ] | 0 ; if (( c | 0 ) != ( d | 0 )) f [ b >> 2 ] = c + ( ~ (( c +- 2 - d | 0 ) >>> 1 ) << 1 ); Ju ( d ); return } function pd ( a ){ a = a | 0 ; var b = 0 , c = 0 , d = 0 ; f [ a >> 2 ] = 36460 ; b = f [ a + 20 >> 2 ] | 0 ; if ( b ){ c = a + 24 | 0 ; if (( f [ c >> 2 ] | 0 ) != ( b | 0 )) f [ c >> 2 ] = b ; Ju ( b )} d = f [ a + 8 >> 2 ] | 0 ; if ( ! d ){ Ju ( a ); return } b = a + 12 | 0 ; c = f [ b >> 2 ] | 0 ; if (( c | 0 ) != ( d | 0 )) f [ b >> 2 ] = c + ( ~ (( c +- 2 - d | 0 ) >>> 1 ) << 1 ); Ju ( d ); Ju ( a ); return } function qd ( a , b , c , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; var g = 0 , h = 0 , i = 0 , j = 0 , k = 0 ; g = a + 36 | 0 ; if ( ! ( f [ g >> 2 ] | 0 )){ j = a + 40 | 0 ; ud ( a , b , f [ j >> 2 ] | 0 , c , e ); f [ j >> 2 ] = ( f [ j >> 2 ] | 0 ) + ( f [( f [ a + 4 >> 2 ] | 0 ) + 12 >> 2 ] | 0 ); return } k = a + 4 | 0 ; h = c << 1 ; i = ca ( h , f [( f [ k >> 2 ] | 0 ) + 16 >> 2 ] | 0 ) | 0 ; j = a + 20 | 0 ; ud ( a , b , f [ j >> 2 ] | 0 , c , e ); b = f [ k >> 2 ] | 0 ; if (( f [ b + 28 >> 2 ] | 0 ) == 536870912 ) uc ( f [ j >> 2 ] | 0 , ca ( h , f [ b + 16 >> 2 ] | 0 ) | 0 ); k = f [ g >> 2 ] | 0 ; if (( kx [ f [( f [ k >> 2 ] | 0 ) + 48 >> 2 ] & 63 ]( k , f [ j >> 2 ] | 0 , i ) | 0 ) == ( i | 0 )) return ; b = Pa ( 16 ) | 0 ; if (( d [ 8 ] | 0 ) == 0 ? ( Ka ( 8 ) | 0 ) != 0 : 0 ){ nb ( 72 , 35648 , q | 0 ) | 0 ; Sa ( 8 )} r = 0 ; za ( 7 , b | 0 , 3 , 35648 ); k = r ; r = 0 ; if ( k & 1 ){ k = Qa () | 0 ; Oa ( b | 0 ); _a ( k | 0 )} else ob ( b | 0 , 824 , 96 )} function rd ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; var e = 0 ; e = f [ a + 36 >> 2 ] | 0 ; if ( ! e ){ e = a + 40 | 0 ; sd ( a , f [ e >> 2 ] | 0 , b , c , d ); f [ e >> 2 ] = ( f [ e >> 2 ] | 0 ) + ( f [( f [ a + 4 >> 2 ] | 0 ) + 12 >> 2 ] | 0 ); return } else { td ( a , e , b , c , d ); return }} function sd ( a , b , c , g , h ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; g = g | 0 ; h = h | 0 ; var i = 0 , j = 0 , k = 0 , l = 0 , m = 0 ; k = a + 4 | 0 ; i = f [ k >> 2 ] | 0 ; do if ( ! ( d [ i + 32 >> 0 ] | 0 )) l = b ; else { a = a + 8 | 0 ; zs ( f [ a >> 2 ] | 0 , b | 0 , g * 6 | 0 ) | 0 ; i = f [ k >> 2 ] | 0 ; j = f [ i + 16 >> 2 ] | 0 ; if (( g | 0 ) <= 0 ){ l = f [ a >> 2 ] | 0 ; break } a = f [ a >> 2 ] | 0 ; i = a ; b = 0 ; while ( 1 ){ l = i + 4 | 0 ; m = e [ i >> 1 ] | 0 ; e [ i >> 1 ] = e [ l >> 1 ] | 0 ; e [ l >> 1 ] = m ; b = b + 1 | 0 ; if (( b | 0 ) == ( g | 0 )) break ; else i = i + ( j << 1 ) | 0 } l = a ; i = f [ k >> 2 ] | 0 } while ( 0 ); switch ( f [ i + 16 >> 2 ] | 0 ){ case 3 : { if (( f [ i + 24 >> 2 ] | 0 ) == 2 ){ if (( g | 0 ) > 0 ) i = 0 ; else return ; do { h = e [ l + ( i * 6 | 0 ) + 2 >> 1 ] | 0 ; m = e [ l + ( i * 6 | 0 ) + 4 >> 1 ] | 0 ; e [ c + ( i * 6 | 0 ) >> 1 ] = e [ l + ( i * 6 | 0 ) >> 1 ] | 0 ; e [ c + ( i * 6 | 0 ) + 2 >> 1 ] = h ; e [ c + ( i * 6 | 0 ) + 4 >> 1 ] = m ; i = i + 1 | 0 } while (( i | 0 ) != ( g | 0 )); return } i = ( h | 0 ) < ( g | 0 ) ? h : g ; if (( i | 0 ) <= 0 ) return ; a = h << 1 ; b = 0 ; do { g = e [ l + ( b * 6 | 0 ) + 2 >> 1 ] | 0 ; m = e [ l + ( b * 6 | 0 ) + 4 >> 1 ] | 0 ; e [ c + ( b << 1 ) >> 1 ] = e [ l + ( b * 6 | 0 ) >> 1 ] | 0 ; e [ c + ( b + h << 1 ) >> 1 ] = g ; e [ c + ( b + a << 1 ) >> 1 ] = m ; b = b + 1 | 0 } while (( b | 0 ) != ( i | 0 )); return } case 4 : { if (( f [ i + 24 >> 2 ] | 0 ) != 1 ) return ; i = ( h | 0 ) < ( g | 0 ) ? h : g ; if (( i | 0 ) <= 0 ) return ; a = h << 1 ; b = h * 3 | 0 ; j = 0 ; do { k = e [ l + ( j << 3 ) + 2 >> 1 ] | 0 ; g = e [ l + ( j << 3 ) + 4 >> 1 ] | 0 ; m = e [ l + ( j << 3 ) + 6 >> 1 ] | 0 ; e [ c + ( j << 1 ) >> 1 ] = e [ l + ( j << 3 ) >> 1 ] | 0 ; e [ c + ( j + h << 1 ) >> 1 ] = k ; e [ c + ( j + a << 1 ) >> 1 ] = g ; e [ c + ( j + b << 1 ) >> 1 ] = m ; j = j + 1 | 0 } while (( j | 0 ) != ( i | 0 )); return } default : return }} function td ( a , b , c , e , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; g = g | 0 ; var h = 0 , i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , s = 0 , t = 0 ; o = l ; l = l + 176 | 0 ; p = o + 152 | 0 ; t = o + 16 | 0 ; s = o ; k = a + 4 | 0 ; h = f [ k >> 2 ] | 0 ; n = e << 1 ; i = ca ( n , f [ h + 16 >> 2 ] | 0 ) | 0 ; do if ( i ){ j = a + 20 | 0 ; while ( 1 ){ h = kx [ f [( f [ b >> 2 ] | 0 ) + 32 >> 2 ] & 63 ]( b , f [ j >> 2 ] | 0 , i ) | 0 ; if ( ! h ) break ; if (( i | 0 ) == ( h | 0 )){ m = 26 ; break } else i = i - h | 0 } if (( m | 0 ) == 26 ){ h = f [ k >> 2 ] | 0 ; break } m = t + 56 | 0 ; k = t + 4 | 0 ; f [ t >> 2 ] = 36160 ; f [ m >> 2 ] = 36180 ; r = 0 ; la ( 62 , t + 56 | 0 , k | 0 ); o = r ; r = 0 ; if ( o & 1 ){ t = Qa () | 0 ; cn ( m ); _a ( t | 0 )} f [ t + 128 >> 2 ] = 0 ; f [ t + 132 >> 2 ] =- 1 ; f [ t >> 2 ] = 36200 ; f [ t + 56 >> 2 ] = 36220 ; r = 0 ; ka ( 180 , k | 0 ); o = r ; r = 0 ; do if ( o & 1 ) h = Qa () | 0 ; else { f [ k >> 2 ] = 36236 ; b = t + 36 | 0 ; f [ b
x = A +- 1 | 0 ; j = f [ C >> 2 ] | 0 ; k = f [ D >> 2 ] | 0 ; b = A + 1 | 0 ; i = h [ k + ( A * 6 | 0 ) >> 1 ] | 0 ; z = f [ E >> 2 ] | 0 ; l = h [ k + ( x * 6 | 0 ) >> 1 ] | 0 ; m = i - l | 0 ; n = h [ j + ( x * 6 | 0 ) >> 1 ] | 0 ; o = l - n | 0 ; p = (((( d [ z + (( h [ k + ( b * 6 | 0 ) >> 1 ] | 0 ) - i ) >> 0 ] | 0 ) * 9 | 0 ) + ( d [ z + m >> 0 ] | 0 ) | 0 ) * 9 | 0 ) + ( d [ z + o >> 0 ] | 0 ) | 0 ; g = h [ k + ( A * 6 | 0 ) + 2 >> 1 ] | 0 ; q = h [ k + ( x * 6 | 0 ) + 2 >> 1 ] | 0 ; r = g - q | 0 ; s = h [ j + ( x * 6 | 0 ) + 2 >> 1 ] | 0 ; t = q - s | 0 ; u = (((( d [ z + (( h [ k + ( b * 6 | 0 ) + 2 >> 1 ] | 0 ) - g ) >> 0 ] | 0 ) * 9 | 0 ) + ( d [ z + r >> 0 ] | 0 ) | 0 ) * 9 | 0 ) + ( d [ z + t >> 0 ] | 0 ) | 0 ; c = h [ k + ( A * 6 | 0 ) + 4 >> 1 ] | 0 ; v = h [ k + ( x * 6 | 0 ) + 4 >> 1 ] | 0 ; w = c - v | 0 ; x = h [ j + ( x * 6 | 0 ) + 4 >> 1 ] | 0 ; y = v - x | 0 ; z = (((( d [ z + (( h [ k + ( b * 6 | 0 ) + 4 >> 1 ] | 0 ) - c ) >> 0 ] | 0 ) * 9 | 0 ) + ( d [ z + w >> 0 ] | 0 ) | 0 ) * 9 | 0 ) + ( d [ z + y >> 0 ] | 0 ) | 0 ; if ( ! ( u | p | z )) b = ( $d ( a , A , 0 ) | 0 ) + A | 0 ; else { k = h [ j + ( A * 6 | 0 ) >> 1 ] | 0 ; j = i - n >> 31 ; if (( j ^ o | 0 ) >= 0 ) if (( j ^ m | 0 ) < 0 ) i = n ; else i = n - l + i | 0 ; k = _d ( a , p , k , i , 0 ) | 0 ; j = h [( f [ C >> 2 ] | 0 ) + ( A * 6 | 0 ) + 2 >> 1 ] | 0 ; i = g - s >> 31 ; if (( i ^ t | 0 ) >= 0 ) if (( i ^ r | 0 ) < 0 ) g = s ; else g = s - q + g | 0 ; i = _d ( a , u , j , g , 0 ) | 0 ; j = h [( f [ C >> 2 ] | 0 ) + ( A * 6 | 0 ) + 4 >> 1 ] | 0 ; g = c - x >> 31 ; if (( g ^ y | 0 ) >= 0 ) if (( g ^ w | 0 ) < 0 ) c = x ; else c = x - v + c | 0 ; y = _d ( a , z , j , c , 0 ) | 0 ; z = f [ C >> 2 ] | 0 ; e [ z + ( A * 6 | 0 ) >> 1 ] = k ; e [ z + ( A * 6 | 0 ) + 2 >> 1 ] = i ; e [ z + ( A * 6 | 0 ) + 4 >> 1 ] = y } if (( b | 0 ) < ( f [ B >> 2 ] | 0 )) A = b ; else break } return } function $d ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var d = 0 , g = 0 , i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , r = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 , B = 0 , C = 0 ; B = l ; l = l + 48 | 0 ; r = B + 30 | 0 ; q = B + 24 | 0 ; p = B + 18 | 0 ; s = B + 12 | 0 ; x = B + 6 | 0 ; y = B ; z = ( f [ a + 180 >> 2 ] | 0 ) - b | 0 ; A = f [ a + 4608 >> 2 ] | 0 ; t = f [ a + 4604 >> 2 ] | 0 ; w = b +- 1 | 0 ; u = e [ A + ( w * 6 | 0 ) >> 1 ] | 0 ; v = e [ A + ( w * 6 | 0 ) + 2 >> 1 ] | 0 ; w = e [ A + ( w * 6 | 0 ) + 4 >> 1 ] | 0 ; c = u & 65535 ; d = a + 144 | 0 ; g = v & 65535 ; i = w & 65535 ; o = 0 ; while ( 1 ){ m = o + b | 0 ; j = A + ( m * 6 | 0 ) | 0 ; k = A + ( m * 6 | 0 ) + 2 | 0 ; m = A + ( m * 6 | 0 ) + 4 | 0 ; C = ( h [ j >> 1 ] | 0 ) - c | 0 ; n = f [ d >> 2 ] | 0 ; if (((( C | 0 ) >- 1 ? C : 0 - C | 0 ) | 0 ) > ( n | 0 )) break ; C = ( h [ k >> 1 ] | 0 ) - g | 0 ; if (((( C | 0 ) >- 1 ? C : 0 - C | 0 ) | 0 ) > ( n | 0 )) break ; C = ( h [ m >> 1 ] | 0 ) - i | 0 ; if (((( C | 0 ) >- 1 ? C : 0 - C | 0 ) | 0 ) > ( n | 0 )) break ; e [ j >> 1 ] = u ; e [ k >> 1 ] = v ; e [ m >> 1 ] = w ; o = o + 1 | 0 ; if (( o | 0 ) == ( z | 0 )){ o = z ; break }} g = ( o | 0 ) == ( z | 0 ); i = a + 4600 | 0 ; d = f [ 36476 + ( f [ i >> 2 ] << 2 ) >> 2 ] | 0 ; if (( 1 << d | 0 ) > ( o | 0 )) c = o ; else { c = o ; do { Id ( a , 1 , 1 ); d = f [ i >> 2 ] | 0 ; c = c - ( 1 << f [ 36476 + ( d << 2 ) >> 2 ]) | 0 ; d = ( d | 0 ) > 30 ? 31 : d + 1 | 0 ; f [ i >> 2 ] = d ; d = f [ 36476 + ( d << 2 ) >> 2 ] | 0 } while (( c | 0 ) >= ( 1 << d | 0 ))} if ( ! g ){ Id ( a , c , d + 1 | 0 ); b = o + b | 0 ; C = A + ( b * 6 | 0 ) | 0 ; e [ x >> 1 ] = e [ C >> 1 ] | 0 ; e [ x + 2 >> 1 ] = e [ C + 2 >> 1 ] | 0 ; e [ x + 4 >> 1 ] = e [ C + 4 >> 1 ] | 0 ; e [ y >> 1 ] = u ; e [ y + 2 >> 1 ] = v ; e [ y + 4 >> 1 ] = w ; b = t + ( b * 6 | 0 ) | 0 ; e [ p >> 1 ] = e [ x >> 1 ] | 0 ; e [ p + 2 >> 1 ] = e [ x + 2 >> 1 ] | 0 ; e [ p + 4 >> 1 ] = e [ x + 4 >> 1 ] | 0 ; e [ q >> 1 ] = e [ y >> 1 ] | 0 ; e [ q + 2 >> 1 ] = e [ y + 2 >> 1 ] | 0 ; e [ q + 4 >> 1 ] = e [ y + 4 >> 1 ] | 0 ; e [ r >> 1 ] = e [ b >> 1 ] | 0 ; e [ r + 2 >> 1 ] = e [ b + 2 >> 1 ] | 0 ; e [ r + 4 >> 1 ] = e [ b + 4 >> 1 ] | 0 ; be ( s , a , p , q , r ); e [ C >> 1 ] = e [ s >> 1 ] | 0 ; e [ C + 2 >> 1 ] = e [ s + 2 >> 1 ] | 0 ; e [ C + 4 >> 1 ] = e [ s + 4 >> 1 ] | 0 ; C = f [ i >> 2 ] | 0 ; f [ i >> 2 ] = ( C | 0 ) < 1 ? 0 : C +- 1 | 0 ; C = o + 1 | 0 ; l = B ; return C | 0 } if ( ! c ){ C = z ; l = B ; return C | 0 } Id ( a , 1 , 1 ); C = z ; l = B ; return C | 0 } function _d ( a , b , c , d , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; g = g | 0 ; var h = 0 , i = 0 , j = 0 , k = 0 , l = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , r = 0 ; r = b >> 31 ; h = ( r ^ b ) - r | 0 ; p = a + 196 + ( h * 12 | 0 ) + 10 | 0 ; i = e [ p >> 1 ] | 0 ; o = a + 196 + ( h * 12 | 0 ) | 0 ; g = f [ o >> 2 ] | 0 ; if (( i | 0 ) < ( g | 0 )) if (( i << 1 | 0 ) < ( g | 0 )) if (( i << 2 | 0 ) < ( g | 0 )) if (( i << 3 | 0 ) < ( g | 0 )) if (( i << 4 | 0 ) < ( g | 0 )){ b = 5 ; while ( 1 ) if (( i << b | 0 ) < ( g | 0 )) b = b + 1 | 0 ; else break } else b = 4 ; else b = 3 ; else b = 2 ; else b = 1 ; else b = 0 ; m = a + 196 + ( h * 12 | 0 ) + 8 | 0 ; g = ( e [ m >> 1 ] ^ r ) - r + d | 0 ; q = a + 136 | 0 ; d = f [ q >> 2 ] | 0 ; if (( g & d | 0 ) == ( g | 0 )) l = g ; else l = d &~ ( g >> 31 ); g = ( c - l ^ r ) - r | 0 ; k = a + 144 | 0 ; d = f [ k >> 2 ] | 0 ; if (( g | 0 ) > 0 ) g = ( g + d | 0 ) / ( d << 1 | 1 | 0 ) | 0 ; else g = ( g - d | 0 ) / ( d << 1 | 1 | 0 ) | 0 ; n = a + 140 | 0 ; j = f [ n >> 2 ] | 0 ; c = (( g | 0 ) < 0 ? j : 0 ) + g | 0 ; j = c - (( c | 0 ) < (( j + 1 | 0 ) / 2 | 0 | 0 ) ? 0 : j ) | 0 ; h = a + 196 + ( h * 12 | 0 ) + 4 | 0 ; if ( ! ( d | b )) g = ( f [ h >> 2 ] << 1 ) +- 1 + i >> 31 ; else g = 0 ; d = g ^ j ; ae ( a , b , d >> 30 ^ d << 1 , f [ a + 156 >> 2 ] | 0 ); d = f [ a + 160 >> 2 ] | 0 ; b = ( f [ o >> 2 ] | 0 ) + (( j | 0 ) >- 1 ? j : 0 - j | 0 ) | 0 ; g = ( f [ h >> 2 ] | 0 ) + ( ca ( f [ k >> 2 ] << 1 | 1 , j ) | 0 ) | 0 ; c = e [ p >> 1 ] | 0 ; if (( c | 0 ) == ( d | 0 )){ b = b >> 1 ; g = g >> 1 ; c = d >> 1 } f [ o >> 2 ] = b ; d = c + 1 | 0 ; e [ p >> 1 ] = d ; b = d + g | 0 ; if (( b | 0 ) >= 1 ){ if (( g | 0 ) > 0 ){ g = g - d | 0 ; p = e [ m >> 1 ] | 0 ; e [ m >> 1 ] = ( p << 16 >> 16 < 127 & 1 ) + ( p & 65535 ); g = ( g | 0 ) > 0 ? 0 : g }} else { g = e [ m >> 1 ] | 0 ; e [ m >> 1 ] = ( g & 65535 ) - ( g << 16 >> 16 >- 128 & 1 ); g = ( b | 0 ) > ( ~ c | 0 ) ? b : 0 - c | 0 } f [ h >> 2 ] = g ; d = f [ k >> 2 ] | 0 ; c = d << 1 | 1 ; b = ( ca ( c ,( j ^ r ) - r | 0 ) | 0 ) + l | 0 ; if (( b | 0 ) >= ( 0 - d | 0 )){ g = f [ q >> 2 ] | 0 ; if (( g + d | 0 ) < ( b | 0 )) b = b - ( ca ( f [ n >> 2 ] | 0 , c ) | 0 ) | 0 } else { b = ( ca ( f [ n >> 2 ] | 0 , c ) | 0 ) + b | 0 ; g = f [ q >> 2 ] | 0 } if (( b & g | 0 ) == ( b | 0 )){ r = b ; r = r & 65535 ; return r | 0 } r = g &~ ( b >> 31 ); r = r & 65535 ; return r | 0 } function ae ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; var e = 0 , g = 0 , h = 0 ; e = c >> b ; g = a + 148 | 0 ; h = d - ( f [ g >> 2 ] | 0 ) | 0 ; if (( e | 0 ) < ( h +- 1 | 0 )){ if (( e | 0 ) > 30 ){ d = ( e | 0 ) / 2 | 0 ; Id ( a , 0 , d ); e = e - d | 0 } Id ( a , 1 , e + 1 | 0 ); Id ( a ,( 1 << b ) +- 1 & c , b ); return } if (( h | 0 ) > 31 ){ Id ( a , 0 , 31 ); Id ( a , 1 , d +- 31 - ( f [ g >> 2 ] | 0 ) | 0 )} else Id ( a , 1 , h ); b = f [ g >> 2 ] | 0 ; Id ( a ,( 1 << b ) +- 1 & c +- 1 , b ); return } function be ( a ,
a = f [ l >> 2 ] | 0 ; a : do switch ( f [ a + 16 >> 2 ] | 0 ){ case 3 : { if (( f [ a + 24 >> 2 ] | 0 ) == 2 ){ if (( e | 0 ) > 0 ) a = 0 ; else break a ; while ( 1 ){ j = d [ b + ( a * 3 | 0 ) + 1 >> 0 ] | 0 ; i = j & 255 ; k = i + 128 + ( g [ b + ( a * 3 | 0 ) + 2 >> 0 ] | 0 ) & 255 ; h = c + ( a * 3 | 0 ) | 0 ; d [ h >> 0 ] = ( g [ b + ( a * 3 | 0 ) >> 0 ] | 0 ) + 128 + i ; d [ h + 1 >> 0 ] = j ; d [ h + 2 >> 0 ] = k ; a = a + 1 | 0 ; if (( a | 0 ) == ( e | 0 )) break a }} a = ( e | 0 ) < ( h | 0 ) ? e : h ; if (( a | 0 ) > 0 ){ i = h << 1 ; j = 0 ; do { n = d [ b + ( j + h ) >> 0 ] | 0 ; o = n & 255 ; m = o + 128 + ( g [ b + ( j + i ) >> 0 ] | 0 ) & 255 ; k = c + ( j * 3 | 0 ) | 0 ; d [ k >> 0 ] = ( g [ b + j >> 0 ] | 0 ) + 128 + o ; d [ k + 1 >> 0 ] = n ; d [ k + 2 >> 0 ] = m ; j = j + 1 | 0 } while (( j | 0 ) != ( a | 0 ))} break } case 4 : { if (( f [ a + 24 >> 2 ] | 0 ) == 1 ? ( k = ( e | 0 ) < ( h | 0 ) ? e : h ,( k | 0 ) > 0 ) : 0 ){ a = h << 1 ; i = h * 3 | 0 ; j = 0 ; do { n = g [ b + ( j + h ) >> 0 ] | 0 ; o = c + ( j << 2 ) | 0 ; n = ( g [ b + j >> 0 ] | 0 ) + 128 + n & 255 | n << 8 | g [ b + ( j + i ) >> 0 ] << 24 | n + 128 + ( g [ b + ( j + a ) >> 0 ] | 0 ) << 16 & 16711680 ; d [ o >> 0 ] = n ; d [ o + 1 >> 0 ] = n >> 8 ; d [ o + 2 >> 0 ] = n >> 16 ; d [ o + 3 >> 0 ] = n >> 24 ; j = j + 1 | 0 } while (( j | 0 ) != ( k | 0 ))} break } default : {}} while ( 0 ); a = f [ l >> 2 ] | 0 ; if ( ! ( d [ a + 32 >> 0 ] | 0 )) return ; j = f [ a + 16 >> 2 ] | 0 ; if (( e | 0 ) > 0 ){ a = c ; i = 0 } else return ; while ( 1 ){ o = a + 2 | 0 ; n = d [ a >> 0 ] | 0 ; d [ a >> 0 ] = d [ o >> 0 ] | 0 ; d [ o >> 0 ] = n ; i = i + 1 | 0 ; if (( i | 0 ) == ( e | 0 )) break ; else a = a + j | 0 } return } function Ie ( a ){ a = a | 0 ; var b = 0 , c = 0 ; f [ a >> 2 ] = 36712 ; b = f [ a + 20 >> 2 ] | 0 ; if ( b ){ c = a + 24 | 0 ; if (( f [ c >> 2 ] | 0 ) != ( b | 0 )) f [ c >> 2 ] = b ; Ju ( b )} c = f [ a + 8 >> 2 ] | 0 ; if ( ! c ) return ; b = a + 12 | 0 ; if (( f [ b >> 2 ] | 0 ) != ( c | 0 )) f [ b >> 2 ] = c ; Ju ( c ); return } function Je ( a ){ a = a | 0 ; var b = 0 , c = 0 ; f [ a >> 2 ] = 36712 ; b = f [ a + 20 >> 2 ] | 0 ; if ( b ){ c = a + 24 | 0 ; if (( f [ c >> 2 ] | 0 ) != ( b | 0 )) f [ c >> 2 ] = b ; Ju ( b )} b = f [ a + 8 >> 2 ] | 0 ; if ( ! b ){ Ju ( a ); return } c = a + 12 | 0 ; if (( f [ c >> 2 ] | 0 ) != ( b | 0 )) f [ c >> 2 ] = b ; Ju ( b ); Ju ( a ); return } function Ke ( a , b , c , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; var g = 0 , h = 0 , i = 0 ; g = a + 36 | 0 ; if ( ! ( f [ g >> 2 ] | 0 )){ g = a + 40 | 0 ; Oe ( a , b , f [ g >> 2 ] | 0 , c , e ); f [ g >> 2 ] = ( f [ g >> 2 ] | 0 ) + ( f [( f [ a + 4 >> 2 ] | 0 ) + 12 >> 2 ] | 0 ); return } h = ca ( f [( f [ a + 4 >> 2 ] | 0 ) + 16 >> 2 ] | 0 , c ) | 0 ; i = a + 20 | 0 ; Oe ( a , b , f [ i >> 2 ] | 0 , c , e ); a = f [ g >> 2 ] | 0 ; if (( kx [ f [( f [ a >> 2 ] | 0 ) + 48 >> 2 ] & 63 ]( a , f [ i >> 2 ] | 0 , h ) | 0 ) == ( h | 0 )) return ; g = Pa ( 16 ) | 0 ; if (( d [ 8 ] | 0 ) == 0 ? ( Ka ( 8 ) | 0 ) != 0 : 0 ){ nb ( 72 , 35648 , q | 0 ) | 0 ; Sa ( 8 )} r = 0 ; za ( 7 , g | 0 , 3 , 35648 ); i = r ; r = 0 ; if ( i & 1 ){ i = Qa () | 0 ; Oa ( g | 0 ); _a ( i | 0 )} else ob ( g | 0 , 824 , 96 )} function Le ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; var e = 0 ; e = f [ a + 36 >> 2 ] | 0 ; if ( ! e ){ e = a + 40 | 0 ; Me ( a , f [ e >> 2 ] | 0 , b , c , d ); f [ e >> 2 ] = ( f [ e >> 2 ] | 0 ) + ( f [( f [ a + 4 >> 2 ] | 0 ) + 12 >> 2 ] | 0 ); return } else { Ne ( a , e , b , c , d ); return }} function Me ( a , b , c , e , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; g = g | 0 ; var h = 0 , i = 0 , j = 0 , k = 0 , l = 0 ; j = a + 4 | 0 ; h = f [ j >> 2 ] | 0 ; if ( ! ( d [ h + 32 >> 0 ] | 0 )) j = b ; else { i = a + 8 | 0 ; zs ( f [ i >> 2 ] | 0 , b | 0 , e * 3 | 0 ) | 0 ; h = f [ j >> 2 ] | 0 ; b = f [ h + 16 >> 2 ] | 0 ; if (( e | 0 ) > 0 ){ h = f [ i >> 2 ] | 0 ; a = 0 ; while ( 1 ){ k = h + 2 | 0 ; l = d [ h >> 0 ] | 0 ; d [ h >> 0 ] = d [ k >> 0 ] | 0 ; d [ k >> 0 ] = l ; a = a + 1 | 0 ; if (( a | 0 ) == ( e | 0 )) break ; else h = h + b | 0 } h = f [ j >> 2 ] | 0 } j = f [ i >> 2 ] | 0 } switch ( f [ h + 16 >> 2 ] | 0 ){ case 3 : { if (( f [ h + 24 >> 2 ] | 0 ) == 2 ){ if (( e | 0 ) > 0 ) h = 0 ; else return ; do { g = d [ j + ( h * 3 | 0 ) + 1 >> 0 ] | 0 ; k = d [ j + ( h * 3 | 0 ) + 2 >> 0 ] | 0 ; l = c + ( h * 3 | 0 ) | 0 ; d [ l >> 0 ] = d [ j + ( h * 3 | 0 ) >> 0 ] | 0 ; d [ l + 1 >> 0 ] = g ; d [ l + 2 >> 0 ] = k ; h = h + 1 | 0 } while (( h | 0 ) != ( e | 0 )); return } h = ( g | 0 ) < ( e | 0 ) ? g : e ; if (( h | 0 ) <= 0 ) return ; a = g << 1 ; b = 0 ; do { k = d [ j + ( b * 3 | 0 ) + 1 >> 0 ] | 0 ; l = d [ j + ( b * 3 | 0 ) + 2 >> 0 ] | 0 ; d [ c + b >> 0 ] = d [ j + ( b * 3 | 0 ) >> 0 ] | 0 ; d [ c + ( b + g ) >> 0 ] = k ; d [ c + ( b + a ) >> 0 ] = l ; b = b + 1 | 0 } while (( b | 0 ) != ( h | 0 )); return } case 4 : { if (( f [ h + 24 >> 2 ] | 0 ) != 1 ) return ; h = ( g | 0 ) < ( e | 0 ) ? g : e ; if (( h | 0 ) <= 0 ) return ; a = g << 1 ; b = g * 3 | 0 ; i = 0 ; do { e = d [ j + ( i << 2 ) + 1 >> 0 ] | 0 ; k = d [ j + ( i << 2 ) + 2 >> 0 ] | 0 ; l = d [ j + ( i << 2 ) + 3 >> 0 ] | 0 ; d [ c + i >> 0 ] = d [ j + ( i << 2 ) >> 0 ] | 0 ; d [ c + ( i + g ) >> 0 ] = e ; d [ c + ( i + a ) >> 0 ] = k ; d [ c + ( i + b ) >> 0 ] = l ; i = i + 1 | 0 } while (( i | 0 ) != ( h | 0 )); return } default : return }} function Ne ( a , b , c , e , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; g = g | 0 ; var h = 0 , i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , s = 0 ; n = l ; l = l + 176 | 0 ; o = n + 152 | 0 ; s = n + 16 | 0 ; p = n ; i = ca ( f [( f [ a + 4 >> 2 ] | 0 ) + 16 >> 2 ] | 0 , e ) | 0 ; k = a + 20 | 0 ; h = f [ k >> 2 ] | 0 ; if ( ! i ){ s = h ; Me ( a , s , c , e , g ); l = n ; return } while ( 1 ){ j = kx [ f [( f [ b >> 2 ] | 0 ) + 32 >> 2 ] & 63 ]( b , h , i ) | 0 ; if ( ! j ) break ; h = f [ k >> 2 ] | 0 ; if (( i | 0 ) == ( j | 0 )){ m = 26 ; break } else i = i - j | 0 } if (( m | 0 ) == 26 ){ Me ( a , h , c , e , g ); l = n ; return } c = s + 56 | 0 ; k = s + 4 | 0 ; f [ s >> 2 ] = 36160 ; f [ c >> 2 ] = 36180 ; r = 0 ; la ( 62 , s + 56 | 0 , k | 0 ); n = r ; r = 0 ; if ( n & 1 ){ s = Qa () | 0 ; cn ( c ); _a ( s | 0 )} f [ s + 128 >> 2 ] = 0 ; f [ s + 132 >> 2 ] =- 1 ; f [ s >> 2 ] = 36200 ; f [ s + 56 >> 2 ] = 36220 ; r = 0 ; ka ( 180 , k | 0 ); n = r ; r = 0 ; do if ( n & 1 ) h = Qa () | 0 ; else { f [ k >> 2 ] = 36236 ; b = s + 36 | 0 ; f [ b >> 2 ] = 0 ; f [ b + 4 >> 2 ] = 0 ; f [ b + 8 >> 2 ] = 0 ; f [ b + 12 >> 2 ] = 0 ; f [ s + 52 >> 2 ] = 16 ; f [ o >> 2 ] = 0 ; f [ o + 4 >> 2 ] = 0 ; f [ o + 8 >> 2 ] = 0 ; r = 0 ; la ( 63 , k | 0 , o | 0 ); n = r ; r = 0 ; if ( n & 1 ){ h = Qa () | 0 ; Fm ( o ); Fm ( b ); kn ( k ); break } Fm ( o ); r = 0 ; h = pa ( 28 , s | 0 , 49029 , 57 ) | 0 ; o = r ; r = 0 ; if ( ! ( o & 1 ) ? ( r = 0 , ua ( 36 , h | 0 , 0 ) | 0 , o = r , r = 0 , ! ( o & 1 )) : 0 ){ j = Pa ( 16 ) | 0 ; r = 0 ; la ( 64 , p | 0 , k | 0 ); o = r ; r = 0 ; if ( ! ( o & 1 )){ if (( d [ 8 ] | 0 ) == 0 ? ( Ka ( 8 ) | 0 ) != 0 : 0 ){ nb ( 72 , 35648 , q | 0 ) | 0 ; Sa ( 8 )} r = 0 ; Da ( 36 , j | 0 , 3 , 35648 , p | 0 ); o = r ; r = 0 ; if ( o & 1 ) i = 1 ; else { r = 0 ; za
z = a ; l = w ; return z | 0 } z = Qa () | 0 ; Ju ( a ); _a ( z | 0 )} a = f [ a + 16 >> 2 ] | 0 ; if (( a | 0 ) == 16 ) switch ( i | 0 ){ case 1 : { a = Iu ( 48 ) | 0 ; r = 0 ; f [ y >> 2 ] = f [ b >> 2 ]; f [ y + 4 >> 2 ] = f [ b + 4 >> 2 ]; f [ y + 8 >> 2 ] = f [ b + 8 >> 2 ]; d [ x >> 0 ] = d [ e >> 0 ] | 0 ; Da ( 38 , a | 0 , y | 0 , s | 0 , x | 0 ); z = r ; r = 0 ; if ( ! ( z & 1 )){ z = a ; l = w ; return z | 0 } z = Qa () | 0 ; Ju ( a ); _a ( z | 0 )} case 2 : { a = Iu ( 48 ) | 0 ; r = 0 ; f [ y >> 2 ] = f [ b >> 2 ]; f [ y + 4 >> 2 ] = f [ b + 4 >> 2 ]; f [ y + 8 >> 2 ] = f [ b + 8 >> 2 ]; d [ x >> 0 ] = d [ g >> 0 ] | 0 ; Da ( 39 , a | 0 , y | 0 , s | 0 , x | 0 ); z = r ; r = 0 ; if ( ! ( z & 1 )){ z = a ; l = w ; return z | 0 } z = Qa () | 0 ; Ju ( a ); _a ( z | 0 )} case 3 : { a = Iu ( 48 ) | 0 ; r = 0 ; f [ y >> 2 ] = f [ b >> 2 ]; f [ y + 4 >> 2 ] = f [ b + 4 >> 2 ]; f [ y + 8 >> 2 ] = f [ b + 8 >> 2 ]; d [ x >> 0 ] = d [ h >> 0 ] | 0 ; Da ( 40 , a | 0 , y | 0 , s | 0 , x | 0 ); z = r ; r = 0 ; if ( ! ( z & 1 )){ z = a ; l = w ; return z | 0 } z = Qa () | 0 ; Ju ( a ); _a ( z | 0 )} default : { i = y + 56 | 0 ; g = y + 4 | 0 ; f [ y >> 2 ] = 36160 ; f [ i >> 2 ] = 36180 ; r = 0 ; la ( 62 , y + 56 | 0 , g | 0 ); w = r ; r = 0 ; if ( w & 1 ){ z = Qa () | 0 ; cn ( i ); _a ( z | 0 )} f [ y + 128 >> 2 ] = 0 ; f [ y + 132 >> 2 ] =- 1 ; f [ y >> 2 ] = 36200 ; f [ y + 56 >> 2 ] = 36220 ; r = 0 ; ka ( 180 , g | 0 ); w = r ; r = 0 ; do if ( w & 1 ) a = Qa () | 0 ; else { f [ g >> 2 ] = 36236 ; h = y + 36 | 0 ; f [ h >> 2 ] = 0 ; f [ h + 4 >> 2 ] = 0 ; f [ h + 8 >> 2 ] = 0 ; f [ h + 12 >> 2 ] = 0 ; f [ y + 52 >> 2 ] = 16 ; f [ x >> 2 ] = 0 ; f [ x + 4 >> 2 ] = 0 ; f [ x + 8 >> 2 ] = 0 ; r = 0 ; la ( 63 , g | 0 , x | 0 ); w = r ; r = 0 ; if ( w & 1 ){ a = Qa () | 0 ; Fm ( x ); Fm ( h ); kn ( g ); break } Fm ( x ); r = 0 ; a = pa ( 28 , y | 0 , 49007 , 21 ) | 0 ; x = r ; r = 0 ; do if (( ! ( x & 1 ) ? ( r = 0 , n = ua ( 36 , a | 0 , f [ u >> 2 ] | 0 ) | 0 , x = r , r = 0 , ! ( x & 1 )) : 0 ) ? ( r = 0 , pa ( 28 , n | 0 , 50997 , 18 ) | 0 , x = r , r = 0 , ! ( x & 1 )) : 0 ){ e = Pa ( 16 ) | 0 ; r = 0 ; la ( 64 , p | 0 , g | 0 ); x = r ; r = 0 ; if ( ! ( x & 1 )){ if (( d [ 8 ] | 0 ) == 0 ? ( Ka ( 8 ) | 0 ) != 0 : 0 ){ nb ( 72 , 35648 , q | 0 ) | 0 ; Sa ( 8 )} r = 0 ; Da ( 36 , e | 0 , 9 , 35648 , p | 0 ); x = r ; r = 0 ; if ( x & 1 ) c = 1 ; else { r = 0 ; za ( 6 , e | 0 , 824 , 96 ); r = 0 ; c = 0 } a = Qa () | 0 ; Fm ( p ); if ( ! c ) break } else a = Qa () | 0 ; Oa ( e | 0 )} else z = 34 ; while ( 0 ); if (( z | 0 ) == 34 ) a = Qa () | 0 ; f [ y >> 2 ] = 36200 ; f [ i >> 2 ] = 36220 ; f [ g >> 2 ] = 36236 ; Fm ( h ); kn ( g ); cn ( i ); z = a ; _a ( z | 0 )} while ( 0 ); z = a ; cn ( i ); _a ( z | 0 )}} if (( a | 0 ) <= 8 ){ a = Pa ( 16 ) | 0 ; if (( d [ 8 ] | 0 ) == 0 ? ( Ka ( 8 ) | 0 ) != 0 : 0 ){ nb ( 72 , 35648 , q | 0 ) | 0 ; Sa ( 8 )} r = 0 ; za ( 7 , a | 0 , 8 , 35648 ); z = r ; r = 0 ; if ( ! ( z & 1 )) ob ( a | 0 , 824 , 96 ); z = Qa () | 0 ; Oa ( a | 0 ); _a ( z | 0 )} c = 16 - a | 0 ; switch ( i | 0 ){ case 1 : { a = Iu ( 60 ) | 0 ; f [ j >> 2 ] = c ; r = 0 ; f [ y >> 2 ] = f [ b >> 2 ]; f [ y + 4 >> 2 ] = f [ b + 4 >> 2 ]; f [ y + 8 >> 2 ] = f [ b + 8 >> 2 ]; f [ x >> 2 ] = f [ j >> 2 ]; f [ x + 4 >> 2 ] = f [ j + 4 >> 2 ]; Da ( 41 , a | 0 , y | 0 , s | 0 , x | 0 ); z = r ; r = 0 ; if ( ! ( z & 1 )){ z = a ; l = w ; return z | 0 } z = Qa () | 0 ; Ju ( a ); _a ( z | 0 )} case 2 : { a = Iu ( 60 ) | 0 ; f [ k >> 2 ] = c ; r = 0 ; f [ y >> 2 ] = f [ b >> 2 ]; f [ y + 4 >> 2 ] = f [ b + 4 >> 2 ]; f [ y + 8 >> 2 ] = f [ b + 8 >> 2 ]; f [ x >> 2 ] = f [ k >> 2 ]; f [ x + 4 >> 2 ] = f [ k + 4 >> 2 ]; Da ( 42 , a | 0 , y | 0 , s | 0 , x | 0 ); z = r ; r = 0 ; if ( ! ( z & 1 )){ z = a ; l = w ; return z | 0 } z = Qa () | 0 ; Ju ( a ); _a ( z | 0 )} case 3 : { a = Iu ( 60 ) | 0 ; f [ m >> 2 ] = c ; r = 0 ; f [ y >> 2 ] = f [ b >> 2 ]; f [ y + 4 >> 2 ] = f [ b + 4 >> 2 ]; f [ y + 8 >> 2 ] = f [ b + 8 >> 2 ]; f [ x >> 2 ] = f [ m >> 2 ]; f [ x + 4 >> 2 ] = f [ m + 4 >> 2 ]; Da ( 43 , a | 0 , y | 0 , s | 0 , x | 0 ); z = r ; r = 0 ; if ( ! ( z & 1 )){ z = a ; l = w ; return z | 0 } z = Qa () | 0 ; Ju ( a ); _a ( z | 0 )} default : { i = v + 56 | 0 ; g = v + 4 | 0 ; f [ v >> 2 ] = 36160 ; f [ i >> 2 ] = 36180 ; r = 0 ; la ( 62 , v + 56 | 0 , g | 0 ); y = r ; r = 0 ; if ( y & 1 ){ z = Qa () | 0 ; cn ( i ); _a ( z | 0 )} f [ v + 128 >> 2 ] = 0 ; f [ v + 132 >> 2 ] =- 1 ; f [ v >> 2 ] = 36200 ; f [ v + 56 >> 2 ] = 36220 ; r = 0 ; ka ( 180 , g | 0 ); y = r ; r = 0 ; do if ( y & 1 ) a = Qa () | 0 ; else { f [ g >> 2 ] = 36236 ; h = v + 36 | 0 ; f [ h >> 2 ] = 0 ; f [ h + 4 >> 2 ] = 0 ; f [ h + 8 >> 2 ] = 0 ; f [ h + 12 >> 2 ] = 0 ; f [ v + 52 >> 2 ] = 16 ; f [ x >> 2 ] = 0 ; f [ x + 4 >> 2 ] = 0 ; f [ x + 8 >> 2 ] = 0 ; r = 0 ; la ( 63 , g | 0 , x | 0 ); y = r ; r = 0 ; if ( y & 1 ){ a = Qa () | 0 ; Fm ( x ); Fm ( h ); kn ( g ); break } Fm ( x ); r = 0 ; a = pa ( 28 , v | 0 , 49007 , 21 ) | 0 ; y = r ; r = 0 ; do if (( ! ( y & 1 ) ? ( r = 0 , o = ua ( 36 , a | 0 , f [ u >> 2 ] | 0 ) | 0 , y = r , r = 0 , ! ( y & 1 )) : 0 ) ? ( r = 0 , pa ( 28 , o | 0 , 50997 , 18 ) | 0 , y = r , r = 0 , ! ( y & 1 )) : 0 ){ e = Pa ( 16 ) | 0 ; r = 0 ; la ( 64 , t | 0 , g | 0 ); y = r ; r = 0 ; if ( ! ( y & 1 )){ if (( d [ 8 ] | 0 ) == 0 ? ( Ka ( 8 ) | 0 ) != 0 : 0 ){ nb ( 72 , 35648 , q | 0 ) | 0 ; Sa ( 8 )} r = 0 ; Da ( 36 , e | 0 , 9 , 35648 , t | 0 ); y = r ; r = 0 ; if ( y & 1 ) c = 1 ; else { r = 0 ; za ( 6 , e | 0 , 824 , 96 ); r = 0 ; c = 0 } a = Qa () | 0 ; Fm ( t ); if ( ! c ) break } else a = Qa () | 0 ; Oa ( e | 0 )} else z = 64 ; while ( 0 ); if (( z | 0 ) == 64 ) a = Qa () | 0 ; f [ v >> 2 ] = 36200 ; f [ i >> 2 ] = 36220 ; f [ g >> 2 ] = 36236 ; Fm ( h ); kn ( g ); cn ( i ); z = a ; _a ( z | 0 )} while ( 0 ); z = a ; cn ( i ); _a ( z | 0 )}}} c = f [ b + 4 >> 2 ] | 0 ; e = Iu ( 16 ) | 0 ; a = f [ a + 20 >> 2 ] | 0 ; if ( ! c ){ z = f [ b >> 2 ] | 0 ; f [ e >> 2 ] = 36132 ; f [ e + 4 >> 2 ] = z ; f [ e + 8 >> 2 ] = 2 ; f [ e + 12 >> 2 ] = a ; z = e ; l = w ; return z | 0 } else { f [ e >> 2 ] = 36108 ; f [ e + 4 >> 2 ] = c ; f [ e + 8 >> 2 ] = 2 ; f [ e + 12 >> 2 ] = a ; z = e ; l = w ; return z | 0 } return 0 } function nf ( a ){ a = a | 0 ; var b = 0 , c = 0 , d = 0 , g = 0 , h = 0 , i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 ; v = l ; l = l + 32 | 0 ; x = v + 12 | 0 ; u = v ; q = a + 156 | 0 ; s = ( f [ q >> 2 ] | 0 ) + 4 | 0 ; if (( f [ a + 32 >> 2 ] | 0 ) == 1 ) t = f [ a + 24 >> 2 ] | 0 ; else t = 1 ; b = ca ( t << 1 , s ) | 0 ; f [ x >> 2 ] = 0 ; y = x + 4 | 0 ; f [ y >> 2 ] = 0 ; f [ x + 8 >> 2 ] = 0 ; do if ( b ){ if ( ! (( b | 0 ) < 0 ? ( r = 0 , ka ( 178 , x | 0 ), w = r , r = 0 , w & 1 ) : 0 )) i = 6 ; if (( i | 0 ) == 6 ? ( c = b << 1 , r = 0 , d = na ( 67 , c | 0 ) | 0 , w = r , r = 0 , ! ( w & 1 )) : 0 ){ f [ x >> 2 ] = d ; w = d + ( b << 1 ) | 0 ; f [ x + 8 >> 2 ] = w ; ws ( d | 0 , 0 , c | 0 ) | 0 ; f [ y >> 2 ] = w ; break } d = Qa () | 0 ; b = f [ x >> 2 ] | 0 ; if ( ! b ) _a ( d | 0 ); c = f [ y >> 2 ] | 0 ; if (( c | 0 ) != ( b | 0 )) f [ y >> 2 ] = c + ( ~ (( c +- 2 - b | 0 ) >>> 1 ) << 1 ); Ju ( b ); _a ( d | 0 )} while ( 0 ); f [ u >> 2 ] = 0 ; w = u + 4 |
if (( e | 0 ) != ( b | 0 )) f [ v >> 2 ] = e + ( ~ (( e +- 4 - c | 0 ) >>> 2 ) << 2 ); Ju ( b )} b = f [ w >> 2 ] | 0 ; if ( ! b ){ l = u ; return } c = f [ x >> 2 ] | 0 ; if (( c | 0 ) != ( b | 0 )) f [ x >> 2 ] = c + ( ~ ((( c +- 3 - b | 0 ) >>> 0 ) / 3 | 0 ) * 3 | 0 ); Ju ( b ); l = u ; return } while ( 0 ); b = f [ t >> 2 ] | 0 ; c = b ; if ( b ){ g = f [ v >> 2 ] | 0 ; if (( g | 0 ) != ( b | 0 )) f [ v >> 2 ] = g + ( ~ (( g +- 4 - c | 0 ) >>> 2 ) << 2 ); Ju ( b )}} b = f [ w >> 2 ] | 0 ; if ( ! b ) _a ( e | 0 ); c = f [ x >> 2 ] | 0 ; if (( c | 0 ) != ( b | 0 )) f [ x >> 2 ] = c + ( ~ ((( c +- 3 - b | 0 ) >>> 0 ) / 3 | 0 ) * 3 | 0 ); Ju ( b ); _a ( e | 0 )} function Mf ( a , b ){ a = a | 0 ; b = b | 0 ; var c = 0 , e = 0 , h = 0 , i = 0 , j = 0 , k = 0 , l = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , r = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 , B = 0 , C = 0 , D = 0 ; A = a + 156 | 0 ; if (( f [ A >> 2 ] | 0 ) <= 0 ) return ; B = a + 4584 | 0 ; C = a + 4580 | 0 ; D = a + 4588 | 0 ; z = 0 ; while ( 1 ){ w = z +- 1 | 0 ; i = f [ B >> 2 ] | 0 ; j = f [ C >> 2 ] | 0 ; b = z + 1 | 0 ; h = g [ j + ( z * 3 | 0 ) >> 0 ] | 0 ; y = f [ D >> 2 ] | 0 ; k = g [ j + ( w * 3 | 0 ) >> 0 ] | 0 ; l = h - k | 0 ; m = g [ i + ( w * 3 | 0 ) >> 0 ] | 0 ; n = k - m | 0 ; o = (((( d [ y + (( g [ j + ( b * 3 | 0 ) >> 0 ] | 0 ) - h ) >> 0 ] | 0 ) * 9 | 0 ) + ( d [ y + l >> 0 ] | 0 ) | 0 ) * 9 | 0 ) + ( d [ y + n >> 0 ] | 0 ) | 0 ; e = g [ j + ( z * 3 | 0 ) + 1 >> 0 ] | 0 ; p = g [ j + ( w * 3 | 0 ) + 1 >> 0 ] | 0 ; q = e - p | 0 ; r = g [ i + ( w * 3 | 0 ) + 1 >> 0 ] | 0 ; s = p - r | 0 ; t = (((( d [ y + (( g [ j + ( b * 3 | 0 ) + 1 >> 0 ] | 0 ) - e ) >> 0 ] | 0 ) * 9 | 0 ) + ( d [ y + q >> 0 ] | 0 ) | 0 ) * 9 | 0 ) + ( d [ y + s >> 0 ] | 0 ) | 0 ; c = g [ j + ( z * 3 | 0 ) + 2 >> 0 ] | 0 ; u = g [ j + ( w * 3 | 0 ) + 2 >> 0 ] | 0 ; v = c - u | 0 ; w = g [ i + ( w * 3 | 0 ) + 2 >> 0 ] | 0 ; x = u - w | 0 ; y = (((( d [ y + (( g [ j + ( b * 3 | 0 ) + 2 >> 0 ] | 0 ) - c ) >> 0 ] | 0 ) * 9 | 0 ) + ( d [ y + v >> 0 ] | 0 ) | 0 ) * 9 | 0 ) + ( d [ y + x >> 0 ] | 0 ) | 0 ; if ( ! ( t | o | y )) b = ( Nf ( a , z , 0 ) | 0 ) + z | 0 ; else { j = g [ i + ( z * 3 | 0 ) >> 0 ] | 0 ; i = h - m >> 31 ; if (( i ^ n | 0 ) >= 0 ) if (( i ^ l | 0 ) < 0 ) h = m ; else h = m - k + h | 0 ; j = Of ( a , o , j , h , 0 ) | 0 ; i = g [( f [ B >> 2 ] | 0 ) + ( z * 3 | 0 ) + 1 >> 0 ] | 0 ; h = e - r >> 31 ; if (( h ^ s | 0 ) >= 0 ) if (( h ^ q | 0 ) < 0 ) e = r ; else e = r - p + e | 0 ; h = Of ( a , t , i , e , 0 ) | 0 ; i = g [( f [ B >> 2 ] | 0 ) + ( z * 3 | 0 ) + 2 >> 0 ] | 0 ; e = c - w >> 31 ; if (( e ^ x | 0 ) >= 0 ) if (( e ^ v | 0 ) < 0 ) c = w ; else c = w - u + c | 0 ; y = Of ( a , y , i , c , 0 ) | 0 ; z = ( f [ B >> 2 ] | 0 ) + ( z * 3 | 0 ) | 0 ; d [ z >> 0 ] = j ; d [ z + 1 >> 0 ] = h ; d [ z + 2 >> 0 ] = y } if (( b | 0 ) < ( f [ A >> 2 ] | 0 )) z = b ; else break } return } function Nf ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var e = 0 , h = 0 , i = 0 , j = 0 , k = 0 , l = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , r = 0 , s = 0 , t = 0 ; m = ( f [ a + 156 >> 2 ] | 0 ) - b | 0 ; n = f [ a + 4584 >> 2 ] | 0 ; o = f [ a + 4580 >> 2 ] | 0 ; l = n + (( b +- 1 | 0 ) * 3 | 0 ) | 0 ; p = d [ l >> 0 ] | 0 ; k = d [ l + 1 >> 0 ] | 0 ; l = d [ l + 2 >> 0 ] | 0 ; i = 0 ; while ( 1 ){ c = n + (( i + b | 0 ) * 3 | 0 ) | 0 ; e = c + 1 | 0 ; h = c + 2 | 0 ; if ( ! ((( d [ c >> 0 ] | 0 ) == p << 24 >> 24 ? ( d [ e >> 0 ] | 0 ) == k << 24 >> 24 : 0 ) & ( d [ h >> 0 ] | 0 ) == l << 24 >> 24 )) break ; d [ c >> 0 ] = p ; d [ e >> 0 ] = k ; d [ h >> 0 ] = l ; i = i + 1 | 0 ; if (( i | 0 ) == ( m | 0 )){ i = m ; break }} h = ( i | 0 ) == ( m | 0 ); j = a + 4576 | 0 ; e = f [ 36476 + ( f [ j >> 2 ] << 2 ) >> 2 ] | 0 ; if (( 1 << e | 0 ) > ( i | 0 )) c = i ; else { c = i ; do { Id ( a , 1 , 1 ); e = f [ j >> 2 ] | 0 ; c = c - ( 1 << f [ 36476 + ( e << 2 ) >> 2 ]) | 0 ; e = ( e | 0 ) > 30 ? 31 : e + 1 | 0 ; f [ j >> 2 ] = e ; e = f [ 36476 + ( e << 2 ) >> 2 ] | 0 } while (( c | 0 ) >= ( 1 << e | 0 ))} if ( ! h ){ Id ( a , c , e + 1 | 0 ); q = i + b | 0 ; m = n + ( q * 3 | 0 ) | 0 ; n = m + 1 | 0 ; r = d [ n >> 0 ] | 0 ; b = m + 2 | 0 ; c = d [ b >> 0 ] | 0 ; o = o + ( q * 3 | 0 ) | 0 ; q = d [ o + 1 >> 0 ] | 0 ; t = d [ o + 2 >> 0 ] | 0 ; o = g [ o >> 0 ] | 0 ; h = o - ( p & 255 ) >> 31 | 1 ; e = ( ca (( g [ m >> 0 ] | 0 ) - o << 24 , h ) | 0 ) >> 24 ; s = a + 4552 | 0 ; Pf ( a , s , e ); p = q & 255 ; q = p - ( k & 255 ) >> 31 | 1 ; r = ( ca (( r & 255 ) - p << 24 , q ) | 0 ) >> 24 ; Pf ( a , s , r ); k = t & 255 ; l = k - ( l & 255 ) >> 31 | 1 ; c = ( ca (( c & 255 ) - k << 24 , l ) | 0 ) >> 24 ; Pf ( a , s , c ); p = ( ca ( r , q ) | 0 ) + p & 255 ; a = ( ca ( c , l ) | 0 ) + k & 255 ; d [ m >> 0 ] = ( ca ( e , h ) | 0 ) + o ; d [ n >> 0 ] = p ; d [ b >> 0 ] = a ; a = f [ j >> 2 ] | 0 ; f [ j >> 2 ] = ( a | 0 ) < 1 ? 0 : a +- 1 | 0 ; a = i + 1 | 0 ; return a | 0 } if ( ! c ){ t = m ; return t | 0 } Id ( a , 1 , 1 ); t = m ; return t | 0 } function Of ( a , b , c , d , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; g = g | 0 ; var h = 0 , i = 0 , j = 0 , k = 0 , l = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 ; q = b >> 31 ; k = ( q ^ b ) - q | 0 ; p = a + 172 + ( k * 12 | 0 ) + 10 | 0 ; i = e [ p >> 1 ] | 0 ; o = a + 172 + ( k * 12 | 0 ) | 0 ; g = f [ o >> 2 ] | 0 ; if (( i | 0 ) < ( g | 0 )) if (( i << 1 | 0 ) < ( g | 0 )) if (( i << 2 | 0 ) < ( g | 0 )) if (( i << 3 | 0 ) < ( g | 0 )) if (( i << 4 | 0 ) < ( g | 0 )){ h = 5 ; while ( 1 ) if (( i << h | 0 ) < ( g | 0 )) h = h + 1 | 0 ; else break } else h = 4 ; else h = 3 ; else h = 2 ; else h = 1 ; else h = 0 ; n = a + 172 + ( k * 12 | 0 ) + 8 | 0 ; g = ( e [ n >> 1 ] ^ q ) - q + d | 0 ; if (( g & 255 | 0 ) == ( g | 0 )) m = g ; else m = g >> 31 & 255 ^ 255 ; j = ( c - m ^ q ) - q << 24 ; l = j >> 24 ; if ( ! h ) g = ( f [ a + 172 + ( k * 12 | 0 ) + 4 >> 2 ] << 1 ) +- 1 + i >> 31 ; else g = 0 ; g = g ^ l ; g = g >> 30 ^ g << 1 ; d = g >> h ; if (( d | 0 ) < 23 ){ Id ( a , 1 , d + 1 | 0 ); Id ( a , g & ( 1 << h ) +- 1 , h )} else { Id ( a , 1 , 24 ); Id ( a , g + 255 & 255 , 8 )} d = a + 172 + ( k * 12 | 0 ) + 4 | 0 ; i = e [ p >> 1 ] | 0 ; g = i << 16 >> 16 == 64 ; h = g & 1 ; c = ( f [ d >> 2 ] | 0 ) + l >> h ; i = g ? 32 : i << 16 >> 16 ; f [ o >> 2 ] = ( f [ o >> 2 ] | 0 ) + (( j | 0 ) >- 16777216 ? l : 0 - l | 0 ) >> h ; h = i + 1 | 0 ; e [ p >> 1 ] = h ; g = h + c | 0 ; if (( g | 0 ) < 1 ){ p = e [ n >> 1 ] | 0 ; e [ n >> 1 ] = ( p & 65535 ) - ( p << 16 >> 16 >- 128 & 1 ); p = ( g | 0 ) > ( ~ i | 0 ) ? g : 0 - i | 0 ; f [ d >> 2 ] = p ; q = l ^ q ; b = b >>> 31 ; b = m + b | 0 ; b = b + q | 0 ; b = b & 255 ; return b | 0 } if (( c | 0 ) <= 0 ){ p = c ; f [ d >> 2 ] = p ; q = l ^ q ; b = b >>> 31 ; b = m + b | 0 ; b = b + q | 0 ; b = b & 255 ; return b | 0 } p = c - h | 0 ; o = e [ n >> 1 ] | 0 ; e [ n >> 1 ] = ( o << 16 >> 16 < 127 & 1 ) + ( o & 65535 ); p = ( p | 0 ) > 0 ? 0 : p ; f [ d >> 2 ] = p ; q = l ^ q ; b = b >>> 31 ; b = m + b | 0 ; b = b + q | 0 ; b = b & 255 ; return b | 0 } function Pf ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var e = 0 , h = 0 , i = 0 , j = 0 , k = 0 , l = 0 , m = 0 , n = 0 ; n = b + 9 | 0 ; j = g [ n >> 0 ] | 0 ; m = b + 4 | 0 ; l = f [ m >> 2 ] | 0 ; h = ( ca ( j >>> 1 , l ) | 0 ) + ( f [ b >> 2 ] | 0 ) | 0 ; if (( j | 0 ) < ( h | 0 )){ i = j ; e = 0 ; do { i = i << 1 ; e = e + 1 | 0 } while (( i | 0 ) < ( h
a = a | 0 ; b = b | 0 ; c = c | 0 ; g = g | 0 ; var h = 0 , i = 0 , j = 0 , k = 0 , l = 0 , m = 0 , n = 0 , o = 0 , p = 0 ; k = a + 112 | 0 ; l = a + 108 | 0 ; m = a + 4592 | 0 ; h = f [ k >> 2 ] | 0 ; i = 0 ; while ( 1 ){ if (( h | 0 ) < 1 ){ Od ( a ); h = f [ k >> 2 ] | 0 } j = f [ l >> 2 ] | 0 ; h = h +- 1 | 0 ; f [ k >> 2 ] = h ; f [ l >> 2 ] = j << 1 ; if (( j | 0 ) >= 0 ){ n = 8 ; break } j = f [ m >> 2 ] | 0 ; o = 1 << f [ 36476 + ( j << 2 ) >> 2 ]; p = g - i | 0 ; p = ( o | 0 ) < ( p | 0 ) ? o : p ; i = p + i | 0 ; if (( p | 0 ) == ( o | 0 )) f [ m >> 2 ] = ( j | 0 ) > 30 ? 31 : j + 1 | 0 ; if (( i | 0 ) == ( g | 0 )){ h = g ; break }} if (( n | 0 ) == 8 ) if (( i | 0 ) != ( g | 0 )){ h = f [ m >> 2 ] | 0 ; if (( h +- 4 | 0 ) >>> 0 < 28 ) h = qg ( a , f [ 36476 + ( h << 2 ) >> 2 ] | 0 ) | 0 ; else h = 0 ; h = h + i | 0 ; if (( h | 0 ) > ( g | 0 )){ h = Pa ( 16 ) | 0 ; if (( d [ 8 ] | 0 ) == 0 ? ( Ka ( 8 ) | 0 ) != 0 : 0 ){ nb ( 72 , 35648 , q | 0 ) | 0 ; Sa ( 8 )} r = 0 ; za ( 7 , h | 0 , 5 , 35648 ); p = r ; r = 0 ; if ( p & 1 ){ p = Qa () | 0 ; Oa ( h | 0 ); _a ( p | 0 )} else ob ( h | 0 , 824 , 96 )}} else h = g ; if (( h | 0 ) > 0 ) i = 0 ; else return h | 0 ; do { e [ c + ( i << 1 ) >> 1 ] = b ; i = i + 1 | 0 } while (( i | 0 ) != ( h | 0 )); return h | 0 } function ng ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var d = 0 , e = 0 , g = 0 , h = 0 ; g = b - c | 0 ; h = a + 128 | 0 ; d = a + 136 | 0 ; if (((( g | 0 ) >- 1 ? g : 0 - g | 0 ) | 0 ) > ( f [ d >> 2 ] | 0 )){ b = ca ( og ( a , a + 4568 | 0 ) | 0 , c - b >> 31 | 1 ) | 0 ; e = f [ d >> 2 ] | 0 ; g = e << 1 | 1 ; b = ( ca ( b , g ) | 0 ) + c | 0 ; if (( b | 0 ) >= ( 0 - e | 0 )){ d = f [ h >> 2 ] | 0 ; if (( d + e | 0 ) < ( b | 0 )) b = b - ( ca ( f [ a + 132 >> 2 ] | 0 , g ) | 0 ) | 0 } else { b = ( ca ( f [ a + 132 >> 2 ] | 0 , g ) | 0 ) + b | 0 ; d = f [ h >> 2 ] | 0 } if (( b & d | 0 ) == ( b | 0 )){ a = b ; a = a & 65535 ; return a | 0 } a = d &~ ( b >> 31 ); a = a & 65535 ; return a | 0 } else { c = og ( a , a + 4580 | 0 ) | 0 ; g = f [ d >> 2 ] | 0 ; e = g << 1 | 1 ; b = ( ca ( e , c ) | 0 ) + b | 0 ; if (( b | 0 ) >= ( 0 - g | 0 )){ d = f [ h >> 2 ] | 0 ; if (( d + g | 0 ) < ( b | 0 )) b = b - ( ca ( f [ a + 132 >> 2 ] | 0 , e ) | 0 ) | 0 } else { b = ( ca ( f [ a + 132 >> 2 ] | 0 , e ) | 0 ) + b | 0 ; d = f [ h >> 2 ] | 0 } if (( b & d | 0 ) == ( b | 0 )){ a = b ; a = a & 65535 ; return a | 0 } a = d &~ ( b >> 31 ); a = a & 65535 ; return a | 0 } return 0 } function og ( a , b ){ a = a | 0 ; b = b | 0 ; var c = 0 , e = 0 , h = 0 , i = 0 , j = 0 , k = 0 , l = 0 , m = 0 ; m = b + 9 | 0 ; c = g [ m >> 0 ] | 0 ; i = b + 4 | 0 ; h = ( ca ( c >>> 1 , f [ i >> 2 ] | 0 ) | 0 ) + ( f [ b >> 2 ] | 0 ) | 0 ; if (( c | 0 ) < ( h | 0 )){ e = 0 ; do { c = c << 1 ; e = e + 1 | 0 } while (( c | 0 ) < ( h | 0 ))} else e = 0 ; j = f [ a + 148 >> 2 ] | 0 ; k = f [ 36476 + ( f [ a + 4592 >> 2 ] << 2 ) >> 2 ] | 0 ; c = f [ a + 140 >> 2 ] | 0 ; h = pg ( a ) | 0 ; do if (( h | 0 ) < ( j +- 2 - k - c | 0 )) if ( ! e ){ e = f [ i >> 2 ] | 0 ; a = e + h | 0 ; c = a & 1 ; a = ( c + a | 0 ) / 2 | 0 ; l = 8 ; break } else { k = ( qg ( a , e ) | 0 ) + ( h << e ) | 0 ; e = f [ i >> 2 ] | 0 ; h = k + e | 0 ; j = h & 1 ; c = j ; i = 1 ; h = ( j + h | 0 ) / 2 | 0 ; break } else { h = ( qg ( a , c ) | 0 ) + 1 | 0 ; j = f [ i >> 2 ] | 0 ; a = h + j | 0 ; c = a & 1 ; a = ( c + a | 0 ) / 2 | 0 ; if ( ! e ){ e = j ; l = 8 } else { k = h ; i = 1 ; h = a ; e = j }} while ( 0 ); if (( l | 0 ) == 8 ){ k = h ; i = g [ b + 10 >> 0 ] << 1 >>> 0 >= ( g [ m >> 0 ] | 0 ) >>> 0 ; h = a } h = ( c | 0 ) != 0 ^ i ? h : 0 - h | 0 ; if (( h | 0 ) < 0 ){ l = b + 10 | 0 ; d [ l >> 0 ] = ( g [ l >> 0 ] | 0 ) + 1 } c = ( k + 1 - e >> 1 ) + ( f [ b >> 2 ] | 0 ) | 0 ; f [ b >> 2 ] = c ; e = d [ m >> 0 ] | 0 ; if ( e << 24 >> 24 != ( d [ b + 8 >> 0 ] | 0 )){ b = e ; b = b & 255 ; b = b + 1 | 0 ; b = b & 255 ; d [ m >> 0 ] = b ; return h | 0 } f [ b >> 2 ] = c >> 1 ; l = ( e & 255 ) >>> 1 ; d [ m >> 0 ] = l ; b = b + 10 | 0 ; d [ b >> 0 ] = ( g [ b >> 0 ] | 0 ) >>> 1 ; b = l ; b = b & 255 ; b = b + 1 | 0 ; b = b & 255 ; d [ m >> 0 ] = b ; return h | 0 } function pg ( a ){ a = a | 0 ; var b = 0 , c = 0 , d = 0 , e = 0 , g = 0 , h = 0 ; g = a + 112 | 0 ; if (( f [ g >> 2 ] | 0 ) < 16 ) Od ( a ); h = a + 108 | 0 ; c = f [ h >> 2 ] | 0 ; if (( c | 0 ) >= 0 ) if ( ! ( c & 1073741824 )) if ( ! ( c & 536870912 )) if ( ! ( c & 268435456 )) if ( ! ( c & 134217728 )) if ( ! ( c & 67108864 )) if ( ! ( c & 33554432 )) if ( ! ( c & 16777216 )) if ( ! ( c & 8388608 )) if ( ! ( c & 4194304 )) if ( ! ( c & 2097152 )) if ( ! ( c & 1048576 )) if ( ! ( c & 524288 )) if ( ! ( c & 262144 )) if ( ! ( c & 131072 )){ e = c >>> 12 & 16 ; b = e +- 1 | 0 ; if ( ! e ){ b = ( f [ g >> 2 ] | 0 ) +- 15 | 0 ; f [ g >> 2 ] = b ; d = c << 15 ; f [ h >> 2 ] = d ; c = b ; b = 15 ; while ( 1 ){ if (( c | 0 ) < 1 ){ Od ( a ); e = f [ h >> 2 ] | 0 ; c = f [ g >> 2 ] | 0 } else e = d ; c = c +- 1 | 0 ; f [ g >> 2 ] = c ; d = e << 1 ; f [ h >> 2 ] = d ; if (( e | 0 ) < 0 ) break ; else b = b + 1 | 0 } return b | 0 }} else b = 14 ; else b = 13 ; else b = 12 ; else b = 11 ; else b = 10 ; else b = 9 ; else b = 8 ; else b = 7 ; else b = 6 ; else b = 5 ; else b = 4 ; else b = 3 ; else b = 2 ; else b = 1 ; else b = 0 ; a = b + 1 | 0 ; f [ g >> 2 ] = ( f [ g >> 2 ] | 0 ) - a ; f [ h >> 2 ] = c << a ; h = b ; return h | 0 } function qg ( a , b ){ a = a | 0 ; b = b | 0 ; var c = 0 , e = 0 , g = 0 ; e = a + 112 | 0 ; c = f [ e >> 2 ] | 0 ; if (( c | 0 ) < ( b | 0 )){ Od ( a ); c = f [ e >> 2 ] | 0 ; if (( c | 0 ) < ( b | 0 )){ c = Pa ( 16 ) | 0 ; if (( d [ 8 ] | 0 ) == 0 ? ( Ka ( 8 ) | 0 ) != 0 : 0 ){ nb ( 72 , 35648 , q | 0 ) | 0 ; Sa ( 8 )} r = 0 ; za ( 7 , c | 0 , 5 , 35648 ); a = r ; r = 0 ; if ( a & 1 ){ a = Qa () | 0 ; Oa ( c | 0 ); _a ( a | 0 )} else ob ( c | 0 , 824 , 96 )}} g = a + 108 | 0 ; a = f [ g >> 2 ] | 0 ; f [ e >> 2 ] = c - b ; f [ g >> 2 ] = a << b ; return a >>> ( 32 - b | 0 ) | 0 } function rg ( a ){ a = a | 0 ; var b = 0 , c = 0 , e = 0 , g = 0 , h = 0 , i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 ; p = l ; l = l + 32 | 0 ; e = p ; o = a + 136 | 0 ; a : do if ( ! ( f [ o >> 2 ] | 0 )){ c = f [ a + 128 >> 2 ] | 0 ; b = a + 144 | 0 ; if (((( c | 0 ) == (( 1 << f [ b >> 2 ]) +- 1 | 0 ) ? ( ju ( e , c , 0 ),( f [ e + 4 >> 2 ] | 0 ) == ( f [ a + 176 >> 2 ] | 0 )) : 0 ) ? ( f [ e + 8 >> 2 ] | 0 ) == ( f [ a + 180 >> 2 ] | 0 ) : 0 ) ? ( f [ e + 12 >> 2 ] | 0 ) == ( f [ a + 184 >> 2 ] | 0 ) : 0 ) switch ( f [ b >> 2 ] | 0 ){ case 8 : { o = f [ 8900 ] | 0 ; f [ a + 4604 >> 2 ] = o + ((( f [ 8901 ] | 0 ) - o | 0 ) >>> 1 ); l = p ; return } case 10 : { o = f [ 8903 ] | 0 ; f [ a + 4604 >> 2 ] = o + ((( f [ 8904 ] | 0 ) - o | 0 ) >>> 1 ); l = p ; return } case 12 : { o = f [ 8906 ] | 0 ; f [ a + 4604 >> 2 ] = o + ((( f [ 8907 ] | 0 ) - o | 0 ) >>> 1 ); l = p ; return } case 16 : { o = f [ 8909 ] | 0 ; f [ a + 4604 >> 2 ] = o + ((( f [ 8910 ] | 0 ) - o | 0 ) >>> 1 ); l = p ; return } default : break a }} else b = a + 144 | 0 ; while ( 0 ); n = 1 << f [ b >> 2 ]; c = a + 4608 | 0 ; e = n
} else { h = ( ca ( f [ b + 132 >> 2 ] | 0 , n ) | 0 ) + h | 0 ; i = f [ i >> 2 ] | 0 } if (( h & i | 0 ) != ( h | 0 )) h = i &~ ( h >> 31 ); k = h & 255 ; h = g [ e + 1 >> 0 ] | 0 ; h = ( ca ( ca ( n , j ) | 0 , h - ( g [ c + 1 >> 0 ] | 0 ) >> 31 | 1 ) | 0 ) + h | 0 ; if (( h | 0 ) >= ( o | 0 )){ if (( i + m | 0 ) < ( h | 0 )) h = h - ( ca ( f [ b + 132 >> 2 ] | 0 , n ) | 0 ) | 0 } else h = ( ca ( f [ b + 132 >> 2 ] | 0 , n ) | 0 ) + h | 0 ; if (( h & i | 0 ) != ( h | 0 )) h = i &~ ( h >> 31 ); j = h & 255 ; h = g [ e + 2 >> 0 ] | 0 ; h = ( ca ( ca ( n , l ) | 0 , h - ( g [ c + 2 >> 0 ] | 0 ) >> 31 | 1 ) | 0 ) + h | 0 ; if (( h | 0 ) >= ( o | 0 )){ if (( i + m | 0 ) < ( h | 0 )) h = h - ( ca ( f [ b + 132 >> 2 ] | 0 , n ) | 0 ) | 0 } else h = ( ca ( f [ b + 132 >> 2 ] | 0 , n ) | 0 ) + h | 0 ; if (( h & i | 0 ) == ( h | 0 )){ b = h ; b = b & 255 ; d [ a >> 0 ] = k ; o = a + 1 | 0 ; d [ o >> 0 ] = j ; a = a + 2 | 0 ; d [ a >> 0 ] = b ; return } b = i &~ ( h >> 31 ); b = b & 255 ; d [ a >> 0 ] = k ; o = a + 1 | 0 ; d [ o >> 0 ] = j ; a = a + 2 | 0 ; d [ a >> 0 ] = b ; return } function Pg ( a , b , c , g , h ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; g = g | 0 ; h = h | 0 ; var i = 0 , j = 0 , k = 0 , l = 0 , m = 0 , n = 0 , o = 0 , p = 0 , s = 0 , t = 0 ; t = b >> 31 ; l = ( t ^ b ) - t | 0 ; p = a + 188 + ( l * 12 | 0 ) + 10 | 0 ; c = e [ p >> 1 ] | 0 ; o = a + 188 + ( l * 12 | 0 ) | 0 ; h = f [ o >> 2 ] | 0 ; if (( c | 0 ) < ( h | 0 )) if (( c << 1 | 0 ) < ( h | 0 )) if (( c << 2 | 0 ) < ( h | 0 )) if (( c << 3 | 0 ) < ( h | 0 )) if (( c << 4 | 0 ) < ( h | 0 )){ b = 5 ; while ( 1 ) if (( c << b | 0 ) < ( h | 0 )) b = b + 1 | 0 ; else break } else b = 4 ; else b = 3 ; else b = 2 ; else b = 1 ; else b = 0 ; n = a + 188 + ( l * 12 | 0 ) + 8 | 0 ; c = ( e [ n >> 1 ] ^ t ) - t + g | 0 ; s = a + 128 | 0 ; h = f [ s >> 2 ] | 0 ; if (( c & h | 0 ) == ( c | 0 )) m = c ; else m = h &~ ( c >> 31 ); c = a + 112 | 0 ; if (( f [ c >> 2 ] | 0 ) < 8 ) Od ( a ); h = a + 108 | 0 ; g = f [ h >> 2 ] | 0 ; i = g >>> 24 ; j = f [ 2832 + ( b << 11 ) + ( i << 3 ) + 4 >> 2 ] | 0 ; if ( ! j ){ k = f [ a + 148 >> 2 ] | 0 ; h = f [ a + 140 >> 2 ] | 0 ; c = pg ( a ) | 0 ; if (( c | 0 ) < ( k +- 1 - h | 0 )){ if ( b ) c = ( qg ( a , b ) | 0 ) + ( c << b ) | 0 } else c = ( qg ( a , h ) | 0 ) + 1 | 0 ; c = c << 31 >> 31 ^ c >> 1 ; if (((( c | 0 ) >- 1 ? c : 0 - c | 0 ) | 0 ) > 65535 ){ c = Pa ( 16 ) | 0 ; if (( d [ 8 ] | 0 ) == 0 ? ( Ka ( 8 ) | 0 ) != 0 : 0 ){ nb ( 72 , 35648 , q | 0 ) | 0 ; Sa ( 8 )} r = 0 ; za ( 7 , c | 0 , 5 , 35648 ); a = r ; r = 0 ; if ( a & 1 ){ a = Qa () | 0 ; Oa ( c | 0 ); _a ( a | 0 )} else ob ( c | 0 , 824 , 96 )}} else { f [ c >> 2 ] = ( f [ c >> 2 ] | 0 ) - j ; f [ h >> 2 ] = g << j ; c = f [ 2832 + ( b << 11 ) + ( i << 3 ) >> 2 ] | 0 } k = a + 136 | 0 ; g = f [ k >> 2 ] | 0 ; if ( ! b ){ if ( ! g ) h = ( f [ a + 188 + ( l * 12 | 0 ) + 4 >> 2 ] << 1 ) +- 1 + ( e [ p >> 1 ] | 0 ) >> 31 ; else h = 0 ; j = h ^ c } else j = c ; b = f [ a + 152 >> 2 ] | 0 ; h = ( f [ o >> 2 ] | 0 ) + (( j | 0 ) >- 1 ? j : 0 - j | 0 ) | 0 ; i = a + 188 + ( l * 12 | 0 ) + 4 | 0 ; c = ( f [ i >> 2 ] | 0 ) + ( ca ( g << 1 | 1 , j ) | 0 ) | 0 ; g = e [ p >> 1 ] | 0 ; if (( g | 0 ) == ( b | 0 )){ h = h >> 1 ; c = c >> 1 ; g = b >> 1 } f [ o >> 2 ] = h ; b = g + 1 | 0 ; e [ p >> 1 ] = b ; h = b + c | 0 ; if (( h | 0 ) >= 1 ){ if (( c | 0 ) > 0 ){ c = c - b | 0 ; p = e [ n >> 1 ] | 0 ; e [ n >> 1 ] = ( p << 16 >> 16 < 127 & 1 ) + ( p & 65535 ); c = ( c | 0 ) > 0 ? 0 : c }} else { c = e [ n >> 1 ] | 0 ; e [ n >> 1 ] = ( c & 65535 ) - ( c << 16 >> 16 >- 128 & 1 ); c = ( h | 0 ) > ( ~ g | 0 ) ? h : 0 - g | 0 } f [ i >> 2 ] = c ; b = f [ k >> 2 ] | 0 ; g = b << 1 | 1 ; h = ( ca ( g ,( j ^ t ) - t | 0 ) | 0 ) + m | 0 ; if (( h | 0 ) >= ( 0 - b | 0 )){ c = f [ s >> 2 ] | 0 ; if (( c + b | 0 ) < ( h | 0 )) h = h - ( ca ( f [ a + 132 >> 2 ] | 0 , g ) | 0 ) | 0 } else { h = ( ca ( f [ a + 132 >> 2 ] | 0 , g ) | 0 ) + h | 0 ; c = f [ s >> 2 ] | 0 } if (( h & c | 0 ) == ( h | 0 )){ a = h ; a = a & 255 ; return a | 0 } a = c &~ ( h >> 31 ); a = a & 255 ; return a | 0 } function Qg ( a , b ){ a = a | 0 ; b = b | 0 ; var c = 0 , e = 0 , h = 0 , i = 0 , j = 0 , k = 0 , l = 0 , m = 0 ; m = b + 9 | 0 ; c = g [ m >> 0 ] | 0 ; i = b + 4 | 0 ; h = ( ca ( c >>> 1 , f [ i >> 2 ] | 0 ) | 0 ) + ( f [ b >> 2 ] | 0 ) | 0 ; if (( c | 0 ) < ( h | 0 )){ e = 0 ; do { c = c << 1 ; e = e + 1 | 0 } while (( c | 0 ) < ( h | 0 ))} else e = 0 ; j = f [ a + 148 >> 2 ] | 0 ; k = f [ 36476 + ( f [ a + 4592 >> 2 ] << 2 ) >> 2 ] | 0 ; c = f [ a + 140 >> 2 ] | 0 ; h = pg ( a ) | 0 ; do if (( h | 0 ) < ( j +- 2 - k - c | 0 )) if ( ! e ){ e = f [ i >> 2 ] | 0 ; a = e + h | 0 ; c = a & 1 ; a = ( c + a | 0 ) / 2 | 0 ; l = 8 ; break } else { k = ( qg ( a , e ) | 0 ) + ( h << e ) | 0 ; e = f [ i >> 2 ] | 0 ; h = k + e | 0 ; j = h & 1 ; c = j ; i = 1 ; h = ( j + h | 0 ) / 2 | 0 ; break } else { h = ( qg ( a , c ) | 0 ) + 1 | 0 ; j = f [ i >> 2 ] | 0 ; a = h + j | 0 ; c = a & 1 ; a = ( c + a | 0 ) / 2 | 0 ; if ( ! e ){ e = j ; l = 8 } else { k = h ; i = 1 ; h = a ; e = j }} while ( 0 ); if (( l | 0 ) == 8 ){ k = h ; i = g [ b + 10 >> 0 ] << 1 >>> 0 >= ( g [ m >> 0 ] | 0 ) >>> 0 ; h = a } h = ( c | 0 ) != 0 ^ i ? h : 0 - h | 0 ; if (( h | 0 ) < 0 ){ l = b + 10 | 0 ; d [ l >> 0 ] = ( g [ l >> 0 ] | 0 ) + 1 } c = ( k + 1 - e >> 1 ) + ( f [ b >> 2 ] | 0 ) | 0 ; f [ b >> 2 ] = c ; e = d [ m >> 0 ] | 0 ; if ( e << 24 >> 24 != ( d [ b + 8 >> 0 ] | 0 )){ b = e ; b = b & 255 ; b = b + 1 | 0 ; b = b & 255 ; d [ m >> 0 ] = b ; return h | 0 } f [ b >> 2 ] = c >> 1 ; l = ( e & 255 ) >>> 1 ; d [ m >> 0 ] = l ; b = b + 10 | 0 ; d [ b >> 0 ] = ( g [ b >> 0 ] | 0 ) >>> 1 ; b = l ; b = b & 255 ; b = b + 1 | 0 ; b = b & 255 ; d [ m >> 0 ] = b ; return h | 0 } function Rg ( a ){ a = a | 0 ; var b = 0 , c = 0 , e = 0 , g = 0 , h = 0 , i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 ; p = l ; l = l + 32 | 0 ; e = p ; o = a + 136 | 0 ; a : do if ( ! ( f [ o >> 2 ] | 0 )){ c = f [ a + 128 >> 2 ] | 0 ; b = a + 144 | 0 ; if (((( c | 0 ) == (( 1 << f [ b >> 2 ]) +- 1 | 0 ) ? ( ju ( e , c , 0 ),( f [ e + 4 >> 2 ] | 0 ) == ( f [ a + 176 >> 2 ] | 0 )) : 0 ) ? ( f [ e + 8 >> 2 ] | 0 ) == ( f [ a + 180 >> 2 ] | 0 ) : 0 ) ? ( f [ e + 12 >> 2 ] | 0 ) == ( f [ a + 184 >> 2 ] | 0 ) : 0 ) switch ( f [ b >> 2 ] | 0 ){ case 8 : { o = f [ 8900 ] | 0 ; f [ a + 4604 >> 2 ] = o + ((( f [ 8901 ] | 0 ) - o | 0 ) >>> 1 ); l = p ; return } case 10 : { o = f [ 8903 ] | 0 ; f [ a + 4604 >> 2 ] = o + ((( f [ 8904 ] | 0 ) - o | 0 ) >>> 1 ); l = p ; return } case 12 : { o = f [ 8906 ] | 0 ; f [ a + 4604 >> 2 ] = o + ((( f [ 8907 ] | 0 ) - o | 0 ) >>> 1 ); l = p ; return } case 16 : { o = f [ 8909 ] | 0 ; f [ a + 4604 >> 2 ] = o + ((( f [ 8910 ] | 0 ) - o | 0 ) >>> 1 ); l = p ; return } default : break a }} else b = a + 144 | 0 ; while ( 0 ); n = 1 << f [ b >> 2 ]; c = a + 4608 | 0 ; e = n << 1 ; g = a + 4612 | 0 ; h = f [ g >> 2 ] | 0 ; b = f [ c >> 2 ] | 0 ; i = h - b | 0 ; if ( e >>> 0 <= i >>> 0 ){ if ( e >>> 0 < i >>> 0 ? ( j = b + e | 0 ,( h | 0 ) != ( j | 0 )) : 0 ) f [ g >> 2 ] = j } else { Qd ( c , e - i | 0 ); b = f [ c >> 2 ] | 0 } m = a + 4604 | 0 ; f [ m >> 2 ] = b + n ; b = 0 - n | 0 ; if (( n | 0 ) <= ( b | 0 )){ l = p ; return } j = a + 184 | 0 ; k = a + 180 | 0 ; i = a + 176 | 0
f [ g >> 2 ] = 36236 ; h = y + 36 | 0 ; f [ h >> 2 ] = 0 ; f [ h + 4 >> 2 ] = 0 ; f [ h + 8 >> 2 ] = 0 ; f [ h + 12 >> 2 ] = 0 ; f [ y + 52 >> 2 ] = 16 ; f [ x >> 2 ] = 0 ; f [ x + 4 >> 2 ] = 0 ; f [ x + 8 >> 2 ] = 0 ; r = 0 ; la ( 63 , g | 0 , x | 0 ); w = r ; r = 0 ; if ( w & 1 ){ a = Qa () | 0 ; Fm ( x ); Fm ( h ); kn ( g ); break } Fm ( x ); r = 0 ; a = pa ( 28 , y | 0 , 49007 , 21 ) | 0 ; x = r ; r = 0 ; do if (( ! ( x & 1 ) ? ( r = 0 , n = ua ( 36 , a | 0 , f [ u >> 2 ] | 0 ) | 0 , x = r , r = 0 , ! ( x & 1 )) : 0 ) ? ( r = 0 , pa ( 28 , n | 0 , 50997 , 18 ) | 0 , x = r , r = 0 , ! ( x & 1 )) : 0 ){ e = Pa ( 16 ) | 0 ; r = 0 ; la ( 64 , p | 0 , g | 0 ); x = r ; r = 0 ; if ( ! ( x & 1 )){ if (( d [ 8 ] | 0 ) == 0 ? ( Ka ( 8 ) | 0 ) != 0 : 0 ){ nb ( 72 , 35648 , q | 0 ) | 0 ; Sa ( 8 )} r = 0 ; Da ( 36 , e | 0 , 9 , 35648 , p | 0 ); x = r ; r = 0 ; if ( x & 1 ) c = 1 ; else { r = 0 ; za ( 6 , e | 0 , 824 , 96 ); r = 0 ; c = 0 } a = Qa () | 0 ; Fm ( p ); if ( ! c ) break } else a = Qa () | 0 ; Oa ( e | 0 )} else z = 34 ; while ( 0 ); if (( z | 0 ) == 34 ) a = Qa () | 0 ; f [ y >> 2 ] = 36200 ; f [ i >> 2 ] = 36220 ; f [ g >> 2 ] = 36236 ; Fm ( h ); kn ( g ); cn ( i ); z = a ; _a ( z | 0 )} while ( 0 ); z = a ; cn ( i ); _a ( z | 0 )}} if (( a | 0 ) <= 8 ){ a = Pa ( 16 ) | 0 ; if (( d [ 8 ] | 0 ) == 0 ? ( Ka ( 8 ) | 0 ) != 0 : 0 ){ nb ( 72 , 35648 , q | 0 ) | 0 ; Sa ( 8 )} r = 0 ; za ( 7 , a | 0 , 8 , 35648 ); z = r ; r = 0 ; if ( ! ( z & 1 )) ob ( a | 0 , 824 , 96 ); z = Qa () | 0 ; Oa ( a | 0 ); _a ( z | 0 )} c = 16 - a | 0 ; switch ( i | 0 ){ case 1 : { a = Iu ( 60 ) | 0 ; f [ j >> 2 ] = c ; r = 0 ; f [ y >> 2 ] = f [ b >> 2 ]; f [ y + 4 >> 2 ] = f [ b + 4 >> 2 ]; f [ y + 8 >> 2 ] = f [ b + 8 >> 2 ]; f [ x >> 2 ] = f [ j >> 2 ]; f [ x + 4 >> 2 ] = f [ j + 4 >> 2 ]; Da ( 41 , a | 0 , y | 0 , s | 0 , x | 0 ); z = r ; r = 0 ; if ( ! ( z & 1 )){ z = a ; l = w ; return z | 0 } z = Qa () | 0 ; Ju ( a ); _a ( z | 0 )} case 2 : { a = Iu ( 60 ) | 0 ; f [ k >> 2 ] = c ; r = 0 ; f [ y >> 2 ] = f [ b >> 2 ]; f [ y + 4 >> 2 ] = f [ b + 4 >> 2 ]; f [ y + 8 >> 2 ] = f [ b + 8 >> 2 ]; f [ x >> 2 ] = f [ k >> 2 ]; f [ x + 4 >> 2 ] = f [ k + 4 >> 2 ]; Da ( 42 , a | 0 , y | 0 , s | 0 , x | 0 ); z = r ; r = 0 ; if ( ! ( z & 1 )){ z = a ; l = w ; return z | 0 } z = Qa () | 0 ; Ju ( a ); _a ( z | 0 )} case 3 : { a = Iu ( 60 ) | 0 ; f [ m >> 2 ] = c ; r = 0 ; f [ y >> 2 ] = f [ b >> 2 ]; f [ y + 4 >> 2 ] = f [ b + 4 >> 2 ]; f [ y + 8 >> 2 ] = f [ b + 8 >> 2 ]; f [ x >> 2 ] = f [ m >> 2 ]; f [ x + 4 >> 2 ] = f [ m + 4 >> 2 ]; Da ( 43 , a | 0 , y | 0 , s | 0 , x | 0 ); z = r ; r = 0 ; if ( ! ( z & 1 )){ z = a ; l = w ; return z | 0 } z = Qa () | 0 ; Ju ( a ); _a ( z | 0 )} default : { i = v + 56 | 0 ; g = v + 4 | 0 ; f [ v >> 2 ] = 36160 ; f [ i >> 2 ] = 36180 ; r = 0 ; la ( 62 , v + 56 | 0 , g | 0 ); y = r ; r = 0 ; if ( y & 1 ){ z = Qa () | 0 ; cn ( i ); _a ( z | 0 )} f [ v + 128 >> 2 ] = 0 ; f [ v + 132 >> 2 ] =- 1 ; f [ v >> 2 ] = 36200 ; f [ v + 56 >> 2 ] = 36220 ; r = 0 ; ka ( 180 , g | 0 ); y = r ; r = 0 ; do if ( y & 1 ) a = Qa () | 0 ; else { f [ g >> 2 ] = 36236 ; h = v + 36 | 0 ; f [ h >> 2 ] = 0 ; f [ h + 4 >> 2 ] = 0 ; f [ h + 8 >> 2 ] = 0 ; f [ h + 12 >> 2 ] = 0 ; f [ v + 52 >> 2 ] = 16 ; f [ x >> 2 ] = 0 ; f [ x + 4 >> 2 ] = 0 ; f [ x + 8 >> 2 ] = 0 ; r = 0 ; la ( 63 , g | 0 , x | 0 ); y = r ; r = 0 ; if ( y & 1 ){ a = Qa () | 0 ; Fm ( x ); Fm ( h ); kn ( g ); break } Fm ( x ); r = 0 ; a = pa ( 28 , v | 0 , 49007 , 21 ) | 0 ; y = r ; r = 0 ; do if (( ! ( y & 1 ) ? ( r = 0 , o = ua ( 36 , a | 0 , f [ u >> 2 ] | 0 ) | 0 , y = r , r = 0 , ! ( y & 1 )) : 0 ) ? ( r = 0 , pa ( 28 , o | 0 , 50997 , 18 ) | 0 , y = r , r = 0 , ! ( y & 1 )) : 0 ){ e = Pa ( 16 ) | 0 ; r = 0 ; la ( 64 , t | 0 , g | 0 ); y = r ; r = 0 ; if ( ! ( y & 1 )){ if (( d [ 8 ] | 0 ) == 0 ? ( Ka ( 8 ) | 0 ) != 0 : 0 ){ nb ( 72 , 35648 , q | 0 ) | 0 ; Sa ( 8 )} r = 0 ; Da ( 36 , e | 0 , 9 , 35648 , t | 0 ); y = r ; r = 0 ; if ( y & 1 ) c = 1 ; else { r = 0 ; za ( 6 , e | 0 , 824 , 96 ); r = 0 ; c = 0 } a = Qa () | 0 ; Fm ( t ); if ( ! c ) break } else a = Qa () | 0 ; Oa ( e | 0 )} else z = 64 ; while ( 0 ); if (( z | 0 ) == 64 ) a = Qa () | 0 ; f [ v >> 2 ] = 36200 ; f [ i >> 2 ] = 36220 ; f [ g >> 2 ] = 36236 ; Fm ( h ); kn ( g ); cn ( i ); z = a ; _a ( z | 0 )} while ( 0 ); z = a ; cn ( i ); _a ( z | 0 )}}} c = f [ b + 4 >> 2 ] | 0 ; e = Iu ( 16 ) | 0 ; a = f [ a + 16 >> 2 ] | 0 ; if ( ! c ){ z = f [ b >> 2 ] | 0 ; f [ e >> 2 ] = 36132 ; f [ e + 4 >> 2 ] = z ; f [ e + 8 >> 2 ] = 1 ; f [ e + 12 >> 2 ] = a ; z = e ; l = w ; return z | 0 } else { f [ e >> 2 ] = 36108 ; f [ e + 4 >> 2 ] = c ; f [ e + 8 >> 2 ] = 1 ; f [ e + 12 >> 2 ] = a ; z = e ; l = w ; return z | 0 } return 0 } function rh ( a , b ){ a = a | 0 ; b = b | 0 ; var c = 0 , g = 0 , h = 0 , i = 0 , j = 0 , k = 0 ; h = l ; l = l + 32 | 0 ; k = h ; ju ( k , 255 , 0 ); j = f [ b + 4 >> 2 ] | 0 ; i = f [ b + 8 >> 2 ] | 0 ; i = ( i | 0 ) == 0 ? f [ k + 8 >> 2 ] | 0 : i ; g = f [ b + 12 >> 2 ] | 0 ; g = ( g | 0 ) == 0 ? f [ k + 12 >> 2 ] | 0 : g ; b = f [ b + 16 >> 2 ] | 0 ; c = f [ k + 16 >> 2 ] | 0 ; f [ a + 152 >> 2 ] = ( j | 0 ) == 0 ? f [ k + 4 >> 2 ] | 0 : j ; f [ a + 156 >> 2 ] = i ; f [ a + 160 >> 2 ] = g ; zh ( a ); g = 0 ; do { f [ a + 164 + ( g * 12 | 0 ) >> 2 ] = 4 ; f [ a + 164 + ( g * 12 | 0 ) + 4 >> 2 ] = 0 ; e [ a + 164 + ( g * 12 | 0 ) + 8 >> 1 ] = 0 ; e [ a + 164 + ( g * 12 | 0 ) + 10 >> 1 ] = 1 ; g = g + 1 | 0 } while (( g | 0 ) != 365 ); k = (( b | 0 ) == 0 ? c : b ) & 255 ; f [ a + 4544 >> 2 ] = 4 ; f [ a + 4548 >> 2 ] = 0 ; d [ a + 4552 >> 0 ] = k ; d [ a + 4553 >> 0 ] = 1 ; d [ a + 4554 >> 0 ] = 0 ; f [ a + 4556 >> 2 ] = 4 ; f [ a + 4560 >> 2 ] = 1 ; d [ a + 4564 >> 0 ] = k ; d [ a + 4565 >> 0 ] = 1 ; d [ a + 4566 >> 0 ] = 0 ; f [ a + 4568 >> 2 ] = 0 ; l = h ; return } function sh ( a , b , c , e , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; g = g | 0 ; var h = 0 , i = 0 ; i = a + 88 | 0 ; h = f [ b >> 2 ] | 0 ; f [ b >> 2 ] = 0 ; b = f [ i >> 2 ] | 0 ; f [ i >> 2 ] = h ; if ( b ) fx [ f [( f [ b >> 2 ] | 0 ) + 4 >> 2 ] & 255 ]( b ); i = e + 4 | 0 ; h = f [ i >> 2 ] | 0 ; d [ a + 4596 >> 0 ] = g & 1 ; b = a + 132 | 0 ; f [ b >> 2 ] = f [ c >> 2 ]; f [ b + 4 >> 2 ] = f [ c + 4 >> 2 ]; f [ b + 8 >> 2 ] = f [ c + 8 >> 2 ]; f [ b + 12 >> 2 ] = f [ c + 12 >> 2 ]; Cd ( a , e ); th ( a ); b = f [ a + 116 >> 2 ] | 0 ; a = f [ a + 112 >> 2 ] | 0 ; while ( 1 ){ g = b +- 1 | 0 ; c = ( d [ g >> 0 ] | 0 ) ==- 1 ? 7 : 8 ; if (( a | 0 ) < ( c | 0 )) break ; else { b = g ; a = a - c | 0 }} b = b - h | 0 ; g = f [ i >> 2 ] | 0 ; if ( ! g ) return ; f [ i >> 2 ] = g + b ; e = e + 8 | 0 ; f [ e >> 2 ] = ( f [ e >> 2 ] | 0 ) - b ; return } function th ( a ){ a = a | 0 ; var b = 0 , c = 0 , e = 0 , g = 0 , h = 0 , i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 , B = 0 , C = 0 , D = 0 ; A = l ; l = l + 32 | 0 ; C = A + 12 | 0 ; z = A ; w = a + 148 | 0 ; x = ( f [ w >> 2 ] | 0 ) + 4 | 0 ; if (( f [ a + 28 >> 2 ] | 0 ) == 1 ) y = f [ a + 20 >> 2 ] | 0 ; else y = 1 ; b = ca ( y << 1 , x ) | 0 ; f [ C >> 2 ] = 0 ; D = C + 4 | 0 ; f [ D >> 2 ] = 0 ; f [ C + 8 >> 2 ] = 0 ; a : do if ( b ){ if ( ! (( b | 0 ) < 0 ? ( r = 0 , ka ( 178 , C | 0 ), B = r , r = 0 , B & 1 )
q = k + 1 | 0 ; if (( q | 0 ) == ( m | 0 )){ B = 17 ; break b } t = kx [ f [( f [ z >> 2 ] | 0 ) + 36 >> 2 ] & 63 ]( z , d [ q >> 0 ] | 0 , 0 ) | 0 ; switch ( t << 24 >> 24 ){ case 48 : case 69 : { s = k + 2 | 0 ; if (( s | 0 ) == ( m | 0 )){ B = 20 ; break b } k = q ; q = kx [ f [( f [ z >> 2 ] | 0 ) + 36 >> 2 ] & 63 ]( z , d [ s >> 0 ] | 0 , 0 ) | 0 ; n = t ; break } default : { q = t ; n = 0 }} t = f [( f [ a >> 2 ] | 0 ) + 36 >> 2 ] | 0 ; f [ x >> 2 ] = o ; f [ y >> 2 ] = p ; f [ v >> 2 ] = f [ x >> 2 ]; f [ w >> 2 ] = f [ y >> 2 ]; f [ b >> 2 ] = wx [ t & 15 ]( a , v , w , h , i , j , q , n ) | 0 ; k = k + 2 | 0 } else { o = d [ k >> 0 ] | 0 ; if ( o << 24 >> 24 >- 1 ? ( A = f [ u >> 2 ] | 0 ,( e [ A + ( o << 24 >> 24 << 1 ) >> 1 ] & 8192 ) != 0 ) : 0 ){ do { k = k + 1 | 0 ; if (( k | 0 ) == ( m | 0 )){ k = m ; break } o = d [ k >> 0 ] | 0 ; if ( o << 24 >> 24 <=- 1 ) break } while (( e [ A + ( o << 24 >> 24 << 1 ) >> 1 ] & 8192 ) != 0 ); o = q ; while ( 1 ){ if ( n ){ if (( f [ n + 12 >> 2 ] | 0 ) == ( f [ n + 16 >> 2 ] | 0 ) ? ( ix [ f [( f [ n >> 2 ] | 0 ) + 36 >> 2 ] & 127 ]( n ) | 0 ) ==- 1 : 0 ){ f [ b >> 2 ] = 0 ; n = 0 }} else n = 0 ; p = ( n | 0 ) == 0 ; do if ( q ){ if (( f [ q + 12 >> 2 ] | 0 ) != ( f [ q + 16 >> 2 ] | 0 )) if ( p ){ t = o ; break } else break c ; if (( ix [ f [( f [ q >> 2 ] | 0 ) + 36 >> 2 ] & 127 ]( q ) | 0 ) !=- 1 ) if ( p ^ ( o | 0 ) == 0 ){ t = o ; q = o ; break } else break c ; else { f [ c >> 2 ] = 0 ; o = 0 ; B = 39 ; break }} else B = 39 ; while ( 0 ); if (( B | 0 ) == 39 ){ B = 0 ; if ( p ) break c ; else { t = o ; q = 0 }} p = n + 12 | 0 ; o = f [ p >> 2 ] | 0 ; s = n + 16 | 0 ; if (( o | 0 ) == ( f [ s >> 2 ] | 0 )) o = ix [ f [( f [ n >> 2 ] | 0 ) + 36 >> 2 ] & 127 ]( n ) | 0 ; else o = g [ o >> 0 ] | 0 ; if (( o & 255 ) << 24 >> 24 <=- 1 ) break c ; if ( ! ( e [( f [ u >> 2 ] | 0 ) + ( o << 24 >> 24 << 1 ) >> 1 ] & 8192 )) break c ; o = f [ p >> 2 ] | 0 ; if (( o | 0 ) == ( f [ s >> 2 ] | 0 )){ ix [ f [( f [ n >> 2 ] | 0 ) + 40 >> 2 ] & 127 ]( n ) | 0 ; o = t ; continue } else { f [ p >> 2 ] = o + 1 ; o = t ; continue }}} p = n + 12 | 0 ; o = f [ p >> 2 ] | 0 ; q = n + 16 | 0 ; if (( o | 0 ) == ( f [ q >> 2 ] | 0 )) o = ix [ f [( f [ n >> 2 ] | 0 ) + 36 >> 2 ] & 127 ]( n ) | 0 ; else o = g [ o >> 0 ] | 0 ; t = px [ f [( f [ z >> 2 ] | 0 ) + 12 >> 2 ] & 63 ]( z , o & 255 ) | 0 ; if ( t << 24 >> 24 != ( px [ f [( f [ z >> 2 ] | 0 ) + 12 >> 2 ] & 63 ]( z , d [ k >> 0 ] | 0 ) | 0 ) << 24 >> 24 ){ B = 57 ; break b } o = f [ p >> 2 ] | 0 ; if (( o | 0 ) == ( f [ q >> 2 ] | 0 )) ix [ f [( f [ n >> 2 ] | 0 ) + 40 >> 2 ] & 127 ]( n ) | 0 ; else f [ p >> 2 ] = o + 1 ; k = k + 1 | 0 } while ( 0 ); n = f [ b >> 2 ] | 0 ; if ( ! (( k | 0 ) != ( m | 0 ) & ( f [ i >> 2 ] | 0 ) == 0 )) break a } if (( B | 0 ) == 13 ){ f [ i >> 2 ] = 4 ; break } else if (( B | 0 ) == 17 ){ f [ i >> 2 ] = 4 ; break } else if (( B | 0 ) == 20 ){ f [ i >> 2 ] = 4 ; break } else if (( B | 0 ) == 57 ){ f [ i >> 2 ] = 4 ; n = f [ b >> 2 ] | 0 ; break }} while ( 0 ); if ( n ){ if (( f [ n + 12 >> 2 ] | 0 ) == ( f [ n + 16 >> 2 ] | 0 ) ? ( ix [ f [( f [ n >> 2 ] | 0 ) + 36 >> 2 ] & 127 ]( n ) | 0 ) ==- 1 : 0 ){ f [ b >> 2 ] = 0 ; n = 0 }} else n = 0 ; k = ( n | 0 ) == 0 ; o = f [ c >> 2 ] | 0 ; do if ( o ){ if (( f [ o + 12 >> 2 ] | 0 ) == ( f [ o + 16 >> 2 ] | 0 ) ? ( ix [ f [( f [ o >> 2 ] | 0 ) + 36 >> 2 ] & 127 ]( o ) | 0 ) ==- 1 : 0 ){ f [ c >> 2 ] = 0 ; B = 67 ; break } if ( ! k ) B = 68 } else B = 67 ; while ( 0 ); if (( B | 0 ) == 67 ? k : 0 ) B = 68 ; if (( B | 0 ) == 68 ) f [ i >> 2 ] = f [ i >> 2 ] | 2 ; l = C ; return n | 0 } function Sh ( a ){ a = a | 0 ; return } function Th ( a ){ a = a | 0 ; Ju ( a ); return } function Uh ( a ){ a = a | 0 ; return 2 } function Vh ( a , b , c , d , e , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; g = g | 0 ; var h = 0 , i = 0 , j = 0 , k = 0 , m = 0 ; h = l ; l = l + 16 | 0 ; i = h + 12 | 0 ; j = h + 8 | 0 ; m = h + 4 | 0 ; k = h ; f [ m >> 2 ] = f [ b >> 2 ]; f [ k >> 2 ] = f [ c >> 2 ]; f [ j >> 2 ] = f [ m >> 2 ]; f [ i >> 2 ] = f [ k >> 2 ]; a = Rh ( a , j , i , d , e , g , 58907 , 58915 ) | 0 ; l = h ; return a | 0 } function Wh ( a , b , c , e , g , h ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; g = g | 0 ; h = h | 0 ; var i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 ; i = l ; l = l + 16 | 0 ; j = i + 12 | 0 ; k = i + 8 | 0 ; n = i + 4 | 0 ; m = i ; o = a + 8 | 0 ; o = ix [ f [( f [ o >> 2 ] | 0 ) + 20 >> 2 ] & 127 ]( o ) | 0 ; f [ n >> 2 ] = f [ b >> 2 ]; f [ m >> 2 ] = f [ c >> 2 ]; c = d [ o >> 0 ] | 0 ; p = ( c & 1 ) == 0 ; b = p ? o + 1 | 0 : f [ o + 8 >> 2 ] | 0 ; c = b + ( p ? ( c & 255 ) >>> 1 : f [ o + 4 >> 2 ] | 0 ) | 0 ; f [ k >> 2 ] = f [ n >> 2 ]; f [ j >> 2 ] = f [ m >> 2 ]; a = Rh ( a , k , j , e , g , h , b , c ) | 0 ; l = i ; return a | 0 } function Xh ( a , b , c , d , e , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; g = g | 0 ; var h = 0 , i = 0 , j = 0 , k = 0 , m = 0 ; k = l ; l = l + 16 | 0 ; i = k + 8 | 0 ; h = k + 4 | 0 ; j = k ; d = fn ( d ) | 0 ; f [ h >> 2 ] = d ; r = 0 ; h = ua ( 37 , h | 0 , 44220 ) | 0 ; m = r ; r = 0 ; if ( m & 1 ){ m = Qa () | 0 ; mm ( d ) | 0 ; _a ( m | 0 )} else { mm ( d ) | 0 ; f [ j >> 2 ] = f [ c >> 2 ]; f [ i >> 2 ] = f [ j >> 2 ]; Yh ( a , g + 24 | 0 , b , i , e , h ); l = k ; return f [ b >> 2 ] | 0 } return 0 } function Yh ( a , b , c , d , e , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; g = g | 0 ; var h = 0 , i = 0 , j = 0 ; h = l ; l = l + 16 | 0 ; i = h + 4 | 0 ; j = h ; a = a + 8 | 0 ; a = ix [ f [ f [ a >> 2 ] >> 2 ] & 127 ]( a ) | 0 ; f [ j >> 2 ] = f [ d >> 2 ]; f [ i >> 2 ] = f [ j >> 2 ]; c = ( Lq ( c , i , a , a + 168 | 0 , g , e , 0 ) | 0 ) - a | 0 ; if (( c | 0 ) < 168 ) f [ b >> 2 ] = (( c | 0 ) / 12 | 0 | 0 ) % 7 | 0 ; l = h ; return } function Zh ( a , b , c , d , e , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; g = g | 0 ; var h = 0 , i = 0 , j = 0 , k = 0 , m = 0 ; k = l ; l = l + 16 | 0 ; i = k + 8 | 0 ; h = k + 4 | 0 ; j = k ; d = fn ( d ) | 0 ; f [ h >> 2 ] = d ; r = 0 ; h = ua ( 37 , h | 0 , 44220 ) | 0 ; m = r ; r = 0 ; if ( m & 1 ){ m = Qa () | 0 ; mm ( d ) | 0 ; _a ( m | 0 )} else { mm ( d ) | 0 ; f [ j >> 2 ] = f [ c >> 2 ]; f [ i >> 2 ] = f [ j >> 2 ]; $h ( a , g + 16 | 0 , b , i , e , h ); l = k ; return f [ b >> 2 ] | 0 } return 0 } function $h ( a , b , c , d , e , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; g = g | 0 ; var h = 0 , i = 0 , j = 0 ; h = l ; l = l + 16 | 0 ; i = h + 4 | 0 ; j = h ; a = a + 8 | 0 ; a = ix [ f [( f [ a >> 2 ] | 0 ) + 4 >> 2 ] & 127 ]( a ) | 0 ; f [ j >> 2 ] = f [ d >> 2 ]; f [ i >> 2 ] = f [ j >> 2 ]; c = ( Lq ( c , i , a , a + 288 | 0 , g , e , 0 ) | 0 ) - a | 0 ; if (( c | 0 ) < 288 ) f [ b >> 2 ] = (( c | 0 ) / 12 | 0 | 0 ) % 12 | 0 ; l = h ; return } function _h ( a , b , c , d , e , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; g = g | 0 ; var h = 0 , i = 0 , j = 0 , k = 0 , m = 0 ; k = l ; l = l + 16 | 0 ; i = k + 8 | 0 ; h = k + 4 | 0 ; j = k ; d = fn ( d ) | 0 ; f [ h >> 2 ] = d ; r = 0 ; h = ua ( 37 , h | 0 , 44220 ) | 0 ; m = r ; r = 0 ;
if ( i & 1 ){ G = 10 ; break a } if (( a | 0 ) ==- 1 ){ f [ c >> 2 ] = 0 ; G = 37 ; break }} if ( ! j ) G = 38 } else G = 37 ; while ( 0 ); if (( G | 0 ) == 37 ? j : 0 ) G = 38 ; if (( G | 0 ) == 38 ) f [ h >> 2 ] = f [ h >> 2 ] | 2 ; j = f [ b >> 2 ] | 0 ; mm ( f [ C >> 2 ] | 0 ) | 0 ; a = f [ D >> 2 ] | 0 ; f [ D >> 2 ] = 0 ; if (( a | 0 ) != 0 ? ( r = 0 , ka ( f [ E >> 2 ] | 0 , a | 0 ), G = r , r = 0 , G & 1 ) : 0 ){ G = Qa ( 0 ) | 0 ; Mb ( G )} l = B ; return j | 0 } else G = 10 ; while ( 0 ); if (( G | 0 ) == 10 ){ k = Qa () | 0 ; j = D } mm ( f [ C >> 2 ] | 0 ) | 0 ; a = f [ j >> 2 ] | 0 ; f [ j >> 2 ] = 0 ; if ( ! a ) F = k ; else { j = f [ E >> 2 ] | 0 ; G = 45 }} else { k = Qa () | 0 ; f [ D >> 2 ] = 0 ; j = 189 ; G = 45 } if (( G | 0 ) == 45 ){ r = 0 ; ka ( j | 0 , a | 0 ); G = r ; r = 0 ; if ( G & 1 ){ G = Qa ( 0 ) | 0 ; Mb ( G )} else F = k } _a ( F | 0 ); return 0 } function Pj ( a ){ a = a | 0 ; return } function Qj ( a , b , c , h , i , j , k , m , n , o , p ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; h = h | 0 ; i = i | 0 ; j = j | 0 ; k = k | 0 ; m = m | 0 ; n = n | 0 ; o = o | 0 ; p = p | 0 ; var q = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 , B = 0 , C = 0 , D = 0 , E = 0 , F = 0 , G = 0 , H = 0 , I = 0 , J = 0 , K = 0 , L = 0 , M = 0 , N = 0 , O = 0 , P = 0 , Q = 0 , R = 0 , S = 0 , T = 0 , U = 0 , V = 0 , W = 0 , X = 0 , Y = 0 , Z = 0 , $ = 0 , _ = 0 , aa = 0 , ba = 0 , ca = 0 , da = 0 ; ba = l ; l = l + 512 | 0 ; P = ba + 88 | 0 ; u = ba + 96 | 0 ; da = ba + 80 | 0 ; T = ba + 72 | 0 ; S = ba + 68 | 0 ; U = ba + 500 | 0 ; Q = ba + 497 | 0 ; V = ba + 496 | 0 ; Y = ba + 56 | 0 ; aa = ba + 44 | 0 ; $ = ba + 32 | 0 ; Z = ba + 20 | 0 ; _ = ba + 8 | 0 ; R = ba + 4 | 0 ; X = ba ; f [ P >> 2 ] = p ; f [ da >> 2 ] = u ; ca = da + 4 | 0 ; f [ ca >> 2 ] = 189 ; f [ T >> 2 ] = u ; f [ S >> 2 ] = u + 400 ; f [ Y >> 2 ] = 0 ; f [ Y + 4 >> 2 ] = 0 ; f [ Y + 8 >> 2 ] = 0 ; f [ aa >> 2 ] = 0 ; f [ aa + 4 >> 2 ] = 0 ; f [ aa + 8 >> 2 ] = 0 ; f [ $ >> 2 ] = 0 ; f [ $ + 4 >> 2 ] = 0 ; f [ $ + 8 >> 2 ] = 0 ; f [ Z >> 2 ] = 0 ; f [ Z + 4 >> 2 ] = 0 ; f [ Z + 8 >> 2 ] = 0 ; f [ _ >> 2 ] = 0 ; f [ _ + 4 >> 2 ] = 0 ; f [ _ + 8 >> 2 ] = 0 ; r = 0 ; ta ( 1 , c | 0 , h | 0 , U | 0 , Q | 0 , V | 0 , Y | 0 , aa | 0 , $ | 0 , Z | 0 , R | 0 ); O = r ; r = 0 ; a : do if ( O & 1 ) m = Qa () | 0 ; else { f [ o >> 2 ] = f [ n >> 2 ]; I = m + 8 | 0 ; J = $ + 4 | 0 ; K = Z + 4 | 0 ; L = Z + 8 | 0 ; M = Z + 1 | 0 ; N = $ + 8 | 0 ; O = $ + 1 | 0 ; z = ( i & 512 | 0 ) != 0 ; A = aa + 8 | 0 ; B = aa + 1 | 0 ; C = aa + 4 | 0 ; D = _ + 4 | 0 ; E = _ + 8 | 0 ; F = _ + 1 | 0 ; G = U + 3 | 0 ; H = Y + 4 | 0 ; y = 0 ; t = 0 ; b : while ( 1 ){ p = f [ a >> 2 ] | 0 ; do if ( p ){ if (( f [ p + 12 >> 2 ] | 0 ) == ( f [ p + 16 >> 2 ] | 0 )){ r = 0 ; p = na ( f [( f [ p >> 2 ] | 0 ) + 36 >> 2 ] | 0 , p | 0 ) | 0 ; x = r ; r = 0 ; if ( x & 1 ){ W = 24 ; break b } if (( p | 0 ) ==- 1 ){ f [ a >> 2 ] = 0 ; p = 0 ; break } else { p = f [ a >> 2 ] | 0 ; break }}} else p = 0 ; while ( 0 ); p = ( p | 0 ) == 0 ; m = f [ b >> 2 ] | 0 ; do if ( m ){ if (( f [ m + 12 >> 2 ] | 0 ) != ( f [ m + 16 >> 2 ] | 0 )) if ( p ){ x = m ; break } else { W = 235 ; break b } r = 0 ; c = na ( f [( f [ m >> 2 ] | 0 ) + 36 >> 2 ] | 0 , m | 0 ) | 0 ; x = r ; r = 0 ; if ( x & 1 ){ W = 24 ; break b } if (( c | 0 ) !=- 1 ) if ( p ){ x = m ; break } else { W = 235 ; break b } else { f [ b >> 2 ] = 0 ; W = 15 ; break }} else W = 15 ; while ( 0 ); if (( W | 0 ) == 15 ){ W = 0 ; if ( p ){ W = 235 ; break } else x = 0 } c : do switch ( d [ U + y >> 0 ] | 0 ){ case 1 : { if (( y | 0 ) != 3 ){ p = f [ a >> 2 ] | 0 ; m = f [ p + 12 >> 2 ] | 0 ; if (( m | 0 ) == ( f [ p + 16 >> 2 ] | 0 )){ r = 0 ; p = na ( f [( f [ p >> 2 ] | 0 ) + 36 >> 2 ] | 0 , p | 0 ) | 0 ; W = r ; r = 0 ; if ( W & 1 ){ W = 24 ; break b }} else p = g [ m >> 0 ] | 0 ; if (( p & 255 ) << 24 >> 24 <=- 1 ){ W = 40 ; break b } if ( ! ( e [( f [ I >> 2 ] | 0 ) + ( p << 24 >> 24 << 1 ) >> 1 ] & 8192 )){ W = 40 ; break b } p = f [ a >> 2 ] | 0 ; m = p + 12 | 0 ; c = f [ m >> 2 ] | 0 ; if (( c | 0 ) == ( f [ p + 16 >> 2 ] | 0 )){ r = 0 ; p = na ( f [( f [ p >> 2 ] | 0 ) + 40 >> 2 ] | 0 , p | 0 ) | 0 ; W = r ; r = 0 ; if ( W & 1 ){ W = 24 ; break b }} else { f [ m >> 2 ] = c + 1 ; p = g [ c >> 0 ] | 0 } r = 0 ; la ( 67 , _ | 0 , p & 255 | 0 ); W = r ; r = 0 ; if ( W & 1 ){ W = 24 ; break b } else { p = x ; h = x ; W = 42 }} break } case 0 : { if (( y | 0 ) != 3 ){ p = x ; h = x ; W = 42 } break } case 3 : { m = d [ $ >> 0 ] | 0 ; p = ( m & 1 ) == 0 ? ( m & 255 ) >>> 1 : f [ J >> 2 ] | 0 ; c = d [ Z >> 0 ] | 0 ; h = ( c & 1 ) == 0 ? ( c & 255 ) >>> 1 : f [ K >> 2 ] | 0 ; if (( p | 0 ) != ( 0 - h | 0 )){ if ( ! p ){ p = f [ a >> 2 ] | 0 ; m = f [ p + 12 >> 2 ] | 0 ; if (( m | 0 ) == ( f [ p + 16 >> 2 ] | 0 )){ r = 0 ; p = na ( f [( f [ p >> 2 ] | 0 ) + 36 >> 2 ] | 0 , p | 0 ) | 0 ; x = r ; r = 0 ; if ( x & 1 ){ W = 24 ; break b } m = d [ Z >> 0 ] | 0 } else { p = g [ m >> 0 ] | 0 ; m = c } if (( p & 255 ) << 24 >> 24 != ( d [(( m & 1 ) == 0 ? M : f [ L >> 2 ] | 0 ) >> 0 ] | 0 )) break c ; p = f [ a >> 2 ] | 0 ; m = p + 12 | 0 ; c = f [ m >> 2 ] | 0 ; if (( c | 0 ) == ( f [ p + 16 >> 2 ] | 0 )){ r = 0 ; na ( f [( f [ p >> 2 ] | 0 ) + 40 >> 2 ] | 0 , p | 0 ) | 0 ; x = r ; r = 0 ; if ( x & 1 ){ W = 24 ; break b }} else f [ m >> 2 ] = c + 1 ; d [ k >> 0 ] = 1 ; x = d [ Z >> 0 ] | 0 ; t = (( x & 1 ) == 0 ? ( x & 255 ) >>> 1 : f [ K >> 2 ] | 0 ) >>> 0 > 1 ? Z : t ; break c } i = f [ a >> 2 ] | 0 ; q = f [ i + 12 >> 2 ] | 0 ; c = f [ i + 16 >> 2 ] | 0 ; p = ( q | 0 ) == ( c | 0 ); if ( ! h ){ if ( p ){ r = 0 ; p = na ( f [( f [ i >> 2 ] | 0 ) + 36 >> 2 ] | 0 , i | 0 ) | 0 ; x = r ; r = 0 ; if ( x & 1 ){ W = 24 ; break b } m = d [ $ >> 0 ] | 0 } else p = g [ q >> 0 ] | 0 ; if (( p & 255 ) << 24 >> 24 != ( d [(( m & 1 ) == 0 ? O : f [ N >> 2 ] | 0 ) >> 0 ] | 0 )){ d [ k >> 0 ] = 1 ; break c } p = f [ a >> 2 ] | 0 ; m = p + 12 | 0 ; c = f [ m >> 2 ] | 0 ; if (( c | 0 ) == ( f [ p + 16 >> 2 ] | 0 )){ r = 0 ; na ( f [( f [ p >> 2 ] | 0 ) + 40 >> 2 ] | 0 , p | 0 ) | 0 ; x = r ; r = 0 ; if ( x & 1 ){ W = 24 ; break b }} else f [ m >> 2 ] = c + 1 ; x = d [ $ >> 0 ] | 0 ; t = (( x & 1 ) == 0 ? ( x & 255 ) >>> 1 : f [ J >> 2 ] | 0 ) >>> 0 > 1 ? $ : t ; break c } if ( p ){ r = 0 ; p = na ( f [( f [ i >> 2 ] | 0 ) + 36 >> 2 ] | 0 , i | 0 ) | 0 ; x = r ; r = 0 ; if ( x & 1 ){ W = 24 ; break b } c = f [ a >> 2 ] | 0 ; m = d [ $ >> 0 ] | 0 ; i = c ; q = f [ c + 12 >> 2 ] | 0 ; c = f [ c + 16 >> 2 ] | 0 } else p = g [ q >> 0 ] | 0 ; h = i + 12 | 0 ; c = ( q | 0 ) == ( c | 0 ); if (( p & 255 ) << 24 >> 24 == ( d [(( m & 1 ) == 0 ? O : f [ N >> 2 ] | 0 ) >> 0 ] | 0 )){ if ( c ){ r = 0 ; na ( f [( f [ i >> 2 ] | 0 ) + 40 >> 2 ] | 0 , i | 0 ) | 0 ; x = r ; r = 0 ; if ( x & 1 ){ W = 24 ; break b }} else f [ h >> 2 ] = q + 1 ; x = d [ $ >> 0 ] | 0 ; t = (( x & 1 ) == 0 ? ( x & 255 ) >>> 1 : f [ J >> 2 ] | 0 ) >>> 0 > 1 ? $ : t ; break c } if ( c ){ r = 0 ; p = na ( f [( f [ i >> 2 ] | 0 ) + 36 >> 2 ] | 0 , i | 0 ) | 0 ; x = r ; r = 0 ; if ( x & 1 ){ W = 24 ; break b }} else p = g [ q >> 0 ] | 0 ; if (( p & 255 ) << 24 >> 24 != ( d [(( d [ Z >> 0 ] & 1 ) == 0 ? M : f [ L >> 2 ] | 0 ) >> 0 ] | 0 )){ W = 104 ; break b } p = f [ a
continue }} if (( R | 0 ) == 20 ){ c = Qa () | 0 ; break a } else if (( R | 0 ) == 271 ){ f [ i >> 2 ] = f [ i >> 2 ] | 4 ; c = 0 ; break b }} while ( 0 ); o = f [ $ >> 2 ] | 0 ; if (( o | 0 ) != ( t | 0 ) ? ( f [ S >> 2 ] = 0 , Uj ( T , o , t , S ),( f [ S >> 2 ] | 0 ) != 0 ) : 0 ){ f [ i >> 2 ] = f [ i >> 2 ] | 4 ; c = 0 } else c = 1 ; break }} Tm ( W ); Tm ( U ); Tm ( V ); Tm ( X ); Fm ( T ); o = f [ $ >> 2 ] | 0 ; f [ $ >> 2 ] = 0 ; if (( o | 0 ) != 0 ? ( r = 0 , ka ( f [ Z >> 2 ] | 0 , o | 0 ), $ = r , r = 0 , $ & 1 ) : 0 ){ $ = Qa ( 0 ) | 0 ; Mb ( $ )} l = Y ; return c | 0 } while ( 0 ); Tm ( W ); Tm ( U ); Tm ( V ); Tm ( X ); Fm ( T ); o = f [ $ >> 2 ] | 0 ; f [ $ >> 2 ] = 0 ; if (( o | 0 ) != 0 ? ( r = 0 , ka ( f [ Z >> 2 ] | 0 , o | 0 ), $ = r , r = 0 , $ & 1 ) : 0 ){ $ = Qa ( 0 ) | 0 ; Mb ( $ )} _a ( c | 0 ); return 0 } function Zj ( a , b , c , e , g , h , i ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; g = g | 0 ; h = h | 0 ; i = i | 0 ; var j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 ; w = l ; l = l + 432 | 0 ; j = w + 424 | 0 ; a = w + 24 | 0 ; y = w + 16 | 0 ; s = w + 8 | 0 ; o = w + 4 | 0 ; p = w + 428 | 0 ; k = w ; f [ y >> 2 ] = a ; A = y + 4 | 0 ; f [ A >> 2 ] = 189 ; m = a + 400 | 0 ; r = 0 ; v = na ( 68 , g | 0 ) | 0 ; n = r ; r = 0 ; if ( ! ( n & 1 )){ f [ o >> 2 ] = v ; r = 0 ; n = ua ( 37 , o | 0 , 44212 ) | 0 ; a = r ; r = 0 ; a : do if ( ! ( a & 1 ) ? ( d [ p >> 0 ] = 0 , t = f [ c >> 2 ] | 0 , f [ k >> 2 ] = t , q = f [ g + 4 >> 2 ] | 0 , u = t , r = 0 , f [ j >> 2 ] = f [ k >> 2 ], q = oa ( 2 , b | 0 , j | 0 , e | 0 , o | 0 , q | 0 , h | 0 , p | 0 , n | 0 , y | 0 , s | 0 , m | 0 ) | 0 , g = r , r = 0 , ! ( g & 1 )) : 0 ){ if ( q ){ if ( ! ( d [ i >> 0 ] & 1 )) d [ i >> 0 ] = 0 ; else f [ f [ i + 8 >> 2 ] >> 2 ] = 0 ; f [ i + 4 >> 2 ] = 0 ; if ( d [ p >> 0 ] | 0 ){ r = 0 ; a = ua ( f [( f [ n >> 2 ] | 0 ) + 44 >> 2 ] | 0 , n | 0 , 45 ) | 0 ; g = r ; r = 0 ; if ( g & 1 ) break ; r = 0 ; la ( 92 , i | 0 , a | 0 ); g = r ; r = 0 ; if ( g & 1 ) break } r = 0 ; k = ua ( f [( f [ n >> 2 ] | 0 ) + 44 >> 2 ] | 0 , n | 0 , 48 ) | 0 ; g = r ; r = 0 ; if ( g & 1 ) break ; a = f [ y >> 2 ] | 0 ; m = f [ s >> 2 ] | 0 ; j = m +- 4 | 0 ; b : do if ( a >>> 0 < j >>> 0 ) do { if (( f [ a >> 2 ] | 0 ) != ( k | 0 )) break b ; a = a + 4 | 0 } while ( a >>> 0 < j >>> 0 ); while ( 0 ); r = 0 ; pa ( 33 , i | 0 , a | 0 , m | 0 ) | 0 ; i = r ; r = 0 ; if ( i & 1 ) break } a = f [ b >> 2 ] | 0 ; do if ( a ){ j = f [ a + 12 >> 2 ] | 0 ; if (( j | 0 ) == ( f [ a + 16 >> 2 ] | 0 )){ r = 0 ; a = na ( f [( f [ a >> 2 ] | 0 ) + 36 >> 2 ] | 0 , a | 0 ) | 0 ; i = r ; r = 0 ; if ( i & 1 ) break a } else a = f [ j >> 2 ] | 0 ; if (( a | 0 ) ==- 1 ){ f [ b >> 2 ] = 0 ; j = 1 ; break } else { j = ( f [ b >> 2 ] | 0 ) == 0 ; break }} else j = 1 ; while ( 0 ); do if ( t ){ a = f [ u + 12 >> 2 ] | 0 ; if (( a | 0 ) == ( f [ u + 16 >> 2 ] | 0 )){ r = 0 ; a = na ( f [( f [ t >> 2 ] | 0 ) + 36 >> 2 ] | 0 , u | 0 ) | 0 ; u = r ; r = 0 ; if ( u & 1 ) break a } else a = f [ a >> 2 ] | 0 ; if (( a | 0 ) !=- 1 ) if ( j ) break ; else { z = 32 ; break } else { f [ c >> 2 ] = 0 ; z = 30 ; break }} else z = 30 ; while ( 0 ); if (( z | 0 ) == 30 ? j : 0 ) z = 32 ; if (( z | 0 ) == 32 ) f [ h >> 2 ] = f [ h >> 2 ] | 2 ; j = f [ b >> 2 ] | 0 ; mm ( v ) | 0 ; a = f [ y >> 2 ] | 0 ; f [ y >> 2 ] = 0 ; if (( a | 0 ) != 0 ? ( r = 0 , ka ( f [ A >> 2 ] | 0 , a | 0 ), A = r , r = 0 , A & 1 ) : 0 ){ A = Qa ( 0 ) | 0 ; Mb ( A )} l = w ; return j | 0 } while ( 0 ); j = Qa () | 0 ; mm ( v ) | 0 ; a = f [ y >> 2 ] | 0 ; f [ y >> 2 ] = 0 ; if ( ! a ) x = j ; else z = 38 } else { j = Qa () | 0 ; f [ y >> 2 ] = 0 ; z = 38 } if (( z | 0 ) == 38 ){ r = 0 ; ka ( f [ A >> 2 ] | 0 , a | 0 ); A = r ; r = 0 ; if ( A & 1 ){ A = Qa ( 0 ) | 0 ; Mb ( A )} else x = j } _a ( x | 0 ); return 0 } function $j ( a , b , c , e , g , h , i , j , k , m ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; g = g | 0 ; h = h | 0 ; i = i | 0 ; j = j | 0 ; k = k | 0 ; m = m | 0 ; var n = 0 , o = 0 , p = 0 , q = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 ; z = l ; l = l + 112 | 0 ; n = z + 100 | 0 ; o = z + 88 | 0 ; p = z + 76 | 0 ; q = z + 64 | 0 ; s = z + 52 | 0 ; t = z + 48 | 0 ; u = z + 36 | 0 ; v = z + 24 | 0 ; w = z + 12 | 0 ; x = z ; do if ( a ){ a = Ik ( b , 43956 ) | 0 ; gx [ f [( f [ a >> 2 ] | 0 ) + 44 >> 2 ] & 127 ]( n , a ); x = f [ n >> 2 ] | 0 ; d [ c >> 0 ] = x ; d [ c + 1 >> 0 ] = x >> 8 ; d [ c + 2 >> 0 ] = x >> 16 ; d [ c + 3 >> 0 ] = x >> 24 ; gx [ f [( f [ a >> 2 ] | 0 ) + 32 >> 2 ] & 127 ]( o , a ); if ( ! ( d [ k >> 0 ] & 1 )) d [ k >> 0 ] = 0 ; else f [ f [ k + 8 >> 2 ] >> 2 ] = 0 ; f [ k + 4 >> 2 ] = 0 ; r = 0 ; la ( 93 , k | 0 , 0 ); c = r ; r = 0 ; if ( c & 1 ){ c = Qa ( 0 ) | 0 ; Mb ( c )} f [ k >> 2 ] = f [ o >> 2 ]; f [ k + 4 >> 2 ] = f [ o + 4 >> 2 ]; f [ k + 8 >> 2 ] = f [ o + 8 >> 2 ]; f [ o >> 2 ] = 0 ; f [ o + 4 >> 2 ] = 0 ; f [ o + 8 >> 2 ] = 0 ; Tm ( o ); gx [ f [( f [ a >> 2 ] | 0 ) + 28 >> 2 ] & 127 ]( p , a ); if ( ! ( d [ j >> 0 ] & 1 )) d [ j >> 0 ] = 0 ; else f [ f [ j + 8 >> 2 ] >> 2 ] = 0 ; f [ j + 4 >> 2 ] = 0 ; r = 0 ; la ( 93 , j | 0 , 0 ); c = r ; r = 0 ; if ( c & 1 ){ c = Qa ( 0 ) | 0 ; Mb ( c )} f [ j >> 2 ] = f [ p >> 2 ]; f [ j + 4 >> 2 ] = f [ p + 4 >> 2 ]; f [ j + 8 >> 2 ] = f [ p + 8 >> 2 ]; f [ p >> 2 ] = 0 ; f [ p + 4 >> 2 ] = 0 ; f [ p + 8 >> 2 ] = 0 ; Tm ( p ); f [ e >> 2 ] = ix [ f [( f [ a >> 2 ] | 0 ) + 12 >> 2 ] & 127 ]( a ) | 0 ; f [ g >> 2 ] = ix [ f [( f [ a >> 2 ] | 0 ) + 16 >> 2 ] & 127 ]( a ) | 0 ; gx [ f [( f [ a >> 2 ] | 0 ) + 20 >> 2 ] & 127 ]( q , a ); if ( ! ( d [ h >> 0 ] & 1 )){ d [ h + 1 >> 0 ] = 0 ; d [ h >> 0 ] = 0 } else { d [ f [ h + 8 >> 2 ] >> 0 ] = 0 ; f [ h + 4 >> 2 ] = 0 } r = 0 ; la ( 91 , h | 0 , 0 ); g = r ; r = 0 ; if ( g & 1 ){ g = Qa ( 0 ) | 0 ; Mb ( g )} f [ h >> 2 ] = f [ q >> 2 ]; f [ h + 4 >> 2 ] = f [ q + 4 >> 2 ]; f [ h + 8 >> 2 ] = f [ q + 8 >> 2 ]; f [ q >> 2 ] = 0 ; f [ q + 4 >> 2 ] = 0 ; f [ q + 8 >> 2 ] = 0 ; Fm ( q ); gx [ f [( f [ a >> 2 ] | 0 ) + 24 >> 2 ] & 127 ]( s , a ); if ( ! ( d [ i >> 0 ] & 1 )) d [ i >> 0 ] = 0 ; else f [ f [ i + 8 >> 2 ] >> 2 ] = 0 ; f [ i + 4 >> 2 ] = 0 ; r = 0 ; la ( 93 , i | 0 , 0 ); g = r ; r = 0 ; if ( g & 1 ){ g = Qa ( 0 ) | 0 ; Mb ( g )} else { f [ i >> 2 ] = f [ s >> 2 ]; f [ i + 4 >> 2 ] = f [ s + 4 >> 2 ]; f [ i + 8 >> 2 ] = f [ s + 8 >> 2 ]; f [ s >> 2 ] = 0 ; f [ s + 4 >> 2 ] = 0 ; f [ s + 8 >> 2 ] = 0 ; Tm ( s ); y = ix [ f [( f [ a >> 2 ] | 0 ) + 36 >> 2 ] & 127 ]( a ) | 0 ; break }} else { a = Ik ( b , 43892 ) | 0 ; gx [ f [( f [ a >> 2 ] | 0 ) + 44 >> 2 ] & 127 ]( t , a ); t = f [ t >> 2 ] | 0 ; d [ c >> 0 ] = t ; d [ c + 1 >> 0 ] = t >> 8 ; d [ c + 2 >> 0 ] = t >> 16 ; d [ c + 3 >> 0 ] = t >> 24 ; gx [ f [( f [ a >> 2 ] | 0 ) + 32 >> 2 ] & 127 ]( u , a ); if ( ! ( d [ k >> 0 ] & 1 )) d [ k >> 0 ] = 0 ; else f [ f [ k + 8 >> 2 ] >> 2 ] = 0 ; f [ k + 4 >> 2 ] = 0 ; r = 0 ; la ( 93 , k | 0 , 0 ); c = r ; r = 0 ; if ( c & 1 ){ c = Qa ( 0 ) | 0 ; Mb ( c )} f [ k >> 2 ] = f [ u >> 2 ]; f [ k + 4 >> 2 ] = f [ u + 4 >> 2 ]; f [ k + 8 >> 2 ] = f [ u + 8 >> 2 ]; f [ u >> 2 ] = 0 ; f [ u + 4 >> 2 ] = 0 ; f [ u + 8 >> 2 ] = 0 ; Tm ( u ); gx [ f [( f [ a >> 2 ] | 0 ) + 28 >> 2 ] & 127 ]( v , a ); if ( ! ( d [ j >> 0 ] & 1 )) d [ j >> 0
a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; g = g | 0 ; var h = 0 , i = 0 ; i = ( c - b | 0 ) >>> 2 ; if (( b | 0 ) != ( c | 0 )){ h = b ; a = g ; while ( 1 ){ g = f [ h >> 2 ] | 0 ; d [ a >> 0 ] = g >>> 0 < 128 ? g & 255 : e ; h = h + 4 | 0 ; if (( h | 0 ) == ( c | 0 )) break ; else a = a + 1 | 0 }} return b + ( i << 2 ) | 0 } function al ( a ){ a = a | 0 ; var b = 0 ; f [ a >> 2 ] = 44236 ; b = f [ a + 8 >> 2 ] | 0 ; if (( b | 0 ) != 0 ? ( d [ a + 12 >> 0 ] | 0 ) != 0 : 0 ) Ku ( b ); return } function bl ( a ){ a = a | 0 ; al ( a ); Ju ( a ); return } function cl ( a , b ){ a = a | 0 ; b = b | 0 ; if ( b << 24 >> 24 >- 1 ) b = f [( Tk () | 0 ) + (( b & 255 ) << 2 ) >> 2 ] & 255 ; return b | 0 } function dl ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; if (( b | 0 ) != ( c | 0 )){ a = b ; do { b = d [ a >> 0 ] | 0 ; if ( b << 24 >> 24 >- 1 ) b = f [( Tk () | 0 ) + ( b << 24 >> 24 << 2 ) >> 2 ] & 255 ; d [ a >> 0 ] = b ; a = a + 1 | 0 } while (( a | 0 ) != ( c | 0 ))} return c | 0 } function el ( a , b ){ a = a | 0 ; b = b | 0 ; if ( b << 24 >> 24 >- 1 ) b = f [( Wk () | 0 ) + ( b << 24 >> 24 << 2 ) >> 2 ] & 255 ; return b | 0 } function fl ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; if (( b | 0 ) != ( c | 0 )){ a = b ; do { b = d [ a >> 0 ] | 0 ; if ( b << 24 >> 24 >- 1 ) b = f [( Wk () | 0 ) + ( b << 24 >> 24 << 2 ) >> 2 ] & 255 ; d [ a >> 0 ] = b ; a = a + 1 | 0 } while (( a | 0 ) != ( c | 0 ))} return c | 0 } function gl ( a , b ){ a = a | 0 ; b = b | 0 ; return b | 0 } function hl ( a , b , c , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; if (( b | 0 ) != ( c | 0 )) while ( 1 ){ d [ e >> 0 ] = d [ b >> 0 ] | 0 ; b = b + 1 | 0 ; if (( b | 0 ) == ( c | 0 )) break ; else e = e + 1 | 0 } return c | 0 } function il ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; return ( b << 24 >> 24 >- 1 ? b : c ) | 0 } function jl ( a , b , c , e , f ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; f = f | 0 ; if (( b | 0 ) != ( c | 0 )) while ( 1 ){ a = d [ b >> 0 ] | 0 ; d [ f >> 0 ] = a << 24 >> 24 >- 1 ? a : e ; b = b + 1 | 0 ; if (( b | 0 ) == ( c | 0 )) break ; else f = f + 1 | 0 } return c | 0 } function kl ( a ){ a = a | 0 ; Ju ( a ); return } function ll ( a , b , c , d , e , g , h , i ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; g = g | 0 ; h = h | 0 ; i = i | 0 ; f [ e >> 2 ] = c ; f [ i >> 2 ] = g ; return 3 } function ml ( a , b , c , d , e , g , h , i ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; g = g | 0 ; h = h | 0 ; i = i | 0 ; f [ e >> 2 ] = c ; f [ i >> 2 ] = g ; return 3 } function nl ( a , b , c , d , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; f [ e >> 2 ] = c ; return 3 } function ol ( a ){ a = a | 0 ; return 1 } function pl ( a ){ a = a | 0 ; return 1 } function ql ( a , b , c , d , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; a = d - c | 0 ; return ( a >>> 0 < e >>> 0 ? a : e ) | 0 } function rl ( a ){ a = a | 0 ; return 1 } function sl ( a , b ){ a = a | 0 ; b = b | 0 ; var c = 0 ; f [ a + 4 >> 2 ] = b +- 1 ; f [ a >> 2 ] = 44304 ; r = 0 ; b = xa ( 3 ) | 0 ; c = r ; r = 0 ; if ( c & 1 ){ c = Qa () | 0 ; _a ( c | 0 )} else { f [ a + 8 >> 2 ] = b ; return }} function tl ( a ){ a = a | 0 ; Kq ( a ); Ju ( a ); return } function ul ( a , b , c , h , i ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; h = h | 0 ; i = i | 0 ; var j = 0 , m = 0 , o = 0 , p = 0 , q = 0.0 , r = 0 , s = 0 , t = 0 , u = 0 , v = 0.0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 , B = 0 , C = 0 , D = 0 , E = 0 , F = 0 , H = 0 , I = 0 , J = 0 , K = 0 , L = 0 , M = 0 , N = 0 , O = 0 , P = 0 , Q = 0 , R = 0 , S = 0 , T = 0 , U = 0 , V = 0 , W = 0 , X = 0 , Y = 0 , Z = 0 , $ = 0 , _ = 0 , aa = 0 , ba = 0 , da = 0 , ea = 0 , fa = 0 , ga = 0 , ha = 0 ; ha = l ; l = l + 624 | 0 ; ba = ha + 24 | 0 ; ea = ha + 16 | 0 ; da = ha + 588 | 0 ; Y = ha + 576 | 0 ; aa = ha ; V = ha + 536 | 0 ; ga = ha + 8 | 0 ; fa = ha + 528 | 0 ; M = ( a | 0 ) != 0 ; N = V + 40 | 0 ; U = N ; V = V + 39 | 0 ; W = ga + 4 | 0 ; X = Y + 12 | 0 ; Y = Y + 11 | 0 ; Z = da ; $ = X ; _ = $ - Z | 0 ; O =- 2 - Z | 0 ; P = $ + 2 | 0 ; Q = ba + 288 | 0 ; R = da + 9 | 0 ; S = R ; T = da + 8 | 0 ; j = 0 ; w = b ; m = 0 ; b = 0 ; a : while ( 1 ){ do if (( j | 0 ) >- 1 ) if (( m | 0 ) > ( 2147483647 - j | 0 )){ f [( Jv () | 0 ) >> 2 ] = 75 ; j =- 1 ; break } else { j = m + j | 0 ; break } while ( 0 ); m = d [ w >> 0 ] | 0 ; if ( ! ( m << 24 >> 24 )){ L = 245 ; break } else o = w ; b : while ( 1 ){ switch ( m << 24 >> 24 ){ case 37 : { m = o ; L = 9 ; break b } case 0 : { m = o ; break b } default : {}} K = o + 1 | 0 ; m = d [ K >> 0 ] | 0 ; o = K } b : do if (( L | 0 ) == 9 ) while ( 1 ){ L = 0 ; if (( d [ m + 1 >> 0 ] | 0 ) != 37 ) break b ; o = o + 1 | 0 ; m = m + 2 | 0 ; if (( d [ m >> 0 ] | 0 ) == 37 ) L = 9 ; else break } while ( 0 ); y = o - w | 0 ; if ( M ? ( f [ a >> 2 ] & 32 | 0 ) == 0 : 0 ) Cw ( w , y , a ) | 0 ; if (( o | 0 ) != ( w | 0 )){ w = m ; m = y ; continue } r = m + 1 | 0 ; o = d [ r >> 0 ] | 0 ; p = ( o << 24 >> 24 ) +- 48 | 0 ; if ( p >>> 0 < 10 ){ K = ( d [ m + 2 >> 0 ] | 0 ) == 36 ; r = K ? m + 3 | 0 : r ; o = d [ r >> 0 ] | 0 ; u = K ? p :- 1 ; b = K ? 1 : b } else u =- 1 ; m = o << 24 >> 24 ; b : do if (( m &- 32 | 0 ) == 32 ){ p = 0 ; while ( 1 ){ if ( ! ( 1 << m +- 32 & 75913 )){ s = p ; m = r ; break b } p = 1 << ( o << 24 >> 24 ) +- 32 | p ; r = r + 1 | 0 ; o = d [ r >> 0 ] | 0 ; m = o << 24 >> 24 ; if (( m &- 32 | 0 ) != 32 ){ s = p ; m = r ; break }}} else { s = 0 ; m = r } while ( 0 ); do if ( o << 24 >> 24 == 42 ){ p = m + 1 | 0 ; o = ( d [ p >> 0 ] | 0 ) +- 48 | 0 ; if ( o >>> 0 < 10 ? ( d [ m + 2 >> 0 ] | 0 ) == 36 : 0 ){ f [ i + ( o << 2 ) >> 2 ] = 10 ; b = 1 ; m = m + 3 | 0 ; o = f [ h + (( d [ p >> 0 ] | 0 ) +- 48 << 3 ) >> 2 ] | 0 } else { if ( b ){ j =- 1 ; break a } if ( ! M ){ x = s ; m = p ; b = 0 ; K = 0 ; break } b = ( f [ c >> 2 ] | 0 ) + ( 4 - 1 ) &~ ( 4 - 1 ); o = f [ b >> 2 ] | 0 ; f [ c >> 2 ] = b + 4 ; b = 0 ; m = p } if (( o | 0 ) < 0 ){ x = s | 8192 ; K = 0 - o | 0 } else { x = s ; K = o }} else { p = ( o << 24 >> 24 ) +- 48 | 0 ; if ( p >>> 0 < 10 ){ o = 0 ; do { o = ( o * 10 | 0 ) + p | 0 ; m = m + 1 | 0 ; p = ( d [ m >> 0 ] | 0 ) +- 48 | 0 } while ( p >>> 0 < 10 ); if (( o | 0 ) < 0 ){ j =- 1 ; break a } else { x = s ; K = o }} else { x = s ; K = 0 }} while ( 0 ); b : do if (( d [ m >> 0 ] | 0 ) == 46 ){ p = m + 1 | 0 ; o = d [ p >> 0 ] | 0 ; if ( o << 24 >> 24 != 42 ){ r = ( o << 24 >> 24 ) +- 48 | 0 ; if ( r >>> 0 < 10 ){ m = p ; o = 0 } else { m = p ; r = 0 ; break } while ( 1 ){ o = ( o * 10 | 0 ) + r | 0 ; m = m + 1 | 0 ; r = ( d [ m >> 0 ] | 0 ) +- 48 | 0 ; if ( r >>> 0 >= 10 ){ r = o ; break b }}} p = m + 2 | 0 ; o = ( d [ p >> 0 ] | 0 ) +- 48 | 0 ; if ( o >>> 0 < 10 ? ( d [ m + 3 >> 0 ] | 0 ) == 36 : 0 ){ f [ i + ( o << 2 ) >> 2 ] = 10 ; m = m + 4 | 0 ; r = f [ h + (( d [ p >> 0 ] | 0 ) +- 48 << 3 ) >> 2 ] | 0 ; break } if ( b ){ j =- 1 ; break a } if ( M ){ m = ( f [ c >> 2 ] | 0 ) + ( 4 - 1 ) &~ ( 4 - 1 ); r = f [ m >> 2 ]
} c = f [ 10222 ] | 0 ; if ( p >>> 0 < c >>> 0 ) Ja (); f [ p + 24 >> 2 ] = h ; b = f [ a + ( o + 8 ) >> 2 ] | 0 ; do if ( b ) if ( b >>> 0 < c >>> 0 ) Ja (); else { f [ p + 16 >> 2 ] = b ; f [ b + 24 >> 2 ] = p ; break } while ( 0 ); b = f [ a + ( o + 12 ) >> 2 ] | 0 ; if ( b ) if ( b >>> 0 < ( f [ 10222 ] | 0 ) >>> 0 ) Ja (); else { f [ p + 20 >> 2 ] = b ; f [ b + 24 >> 2 ] = p ; break }}} else { d = f [ a + o >> 2 ] | 0 ; c = f [ a + ( o | 4 ) >> 2 ] | 0 ; b = 40912 + ( e << 1 << 2 ) | 0 ; if (( d | 0 ) != ( b | 0 )){ if ( d >>> 0 < ( f [ 10222 ] | 0 ) >>> 0 ) Ja (); if (( f [ d + 12 >> 2 ] | 0 ) != ( q | 0 )) Ja ()} if (( c | 0 ) == ( d | 0 )){ f [ 10218 ] = f [ 10218 ] &~ ( 1 << e ); break } if (( c | 0 ) != ( b | 0 )){ if ( c >>> 0 < ( f [ 10222 ] | 0 ) >>> 0 ) Ja (); b = c + 8 | 0 ; if (( f [ b >> 2 ] | 0 ) == ( q | 0 )) n = b ; else Ja ()} else n = c + 8 | 0 ; f [ d + 12 >> 2 ] = c ; f [ n >> 2 ] = d } while ( 0 ); f [ u + 4 >> 2 ] = g | 1 ; f [ u + g >> 2 ] = g ; if (( u | 0 ) == ( f [ 10223 ] | 0 )){ f [ 10220 ] = g ; return }} else { f [ b >> 2 ] = c &- 2 ; f [ u + 4 >> 2 ] = g | 1 ; f [ u + g >> 2 ] = g } b = g >>> 3 ; if ( g >>> 0 < 256 ){ c = b << 1 ; e = 40912 + ( c << 2 ) | 0 ; d = f [ 10218 ] | 0 ; b = 1 << b ; if ( d & b ){ b = 40912 + ( c + 2 << 2 ) | 0 ; c = f [ b >> 2 ] | 0 ; if ( c >>> 0 < ( f [ 10222 ] | 0 ) >>> 0 ) Ja (); else { r = b ; s = c }} else { f [ 10218 ] = d | b ; r = 40912 + ( c + 2 << 2 ) | 0 ; s = e } f [ r >> 2 ] = u ; f [ s + 12 >> 2 ] = u ; f [ u + 8 >> 2 ] = s ; f [ u + 12 >> 2 ] = e ; return } b = g >>> 8 ; if ( b ) if ( g >>> 0 > 16777215 ) e = 31 ; else { r = ( b + 1048320 | 0 ) >>> 16 & 8 ; s = b << r ; q = ( s + 520192 | 0 ) >>> 16 & 4 ; s = s << q ; e = ( s + 245760 | 0 ) >>> 16 & 2 ; e = 14 - ( q | r | e ) + ( s << e >>> 15 ) | 0 ; e = g >>> ( e + 7 | 0 ) & 1 | e << 1 } else e = 0 ; b = 41176 + ( e << 2 ) | 0 ; f [ u + 28 >> 2 ] = e ; f [ u + 20 >> 2 ] = 0 ; f [ u + 16 >> 2 ] = 0 ; c = f [ 10219 ] | 0 ; d = 1 << e ; a : do if ( c & d ){ b = f [ b >> 2 ] | 0 ; b : do if (( f [ b + 4 >> 2 ] &- 8 | 0 ) != ( g | 0 )){ e = g << (( e | 0 ) == 31 ? 0 : 25 - ( e >>> 1 ) | 0 ); while ( 1 ){ c = b + 16 + ( e >>> 31 << 2 ) | 0 ; d = f [ c >> 2 ] | 0 ; if ( ! d ) break ; if (( f [ d + 4 >> 2 ] &- 8 | 0 ) == ( g | 0 )){ t = d ; break b } else { e = e << 1 ; b = d }} if ( c >>> 0 < ( f [ 10222 ] | 0 ) >>> 0 ) Ja (); else { f [ c >> 2 ] = u ; f [ u + 24 >> 2 ] = b ; f [ u + 12 >> 2 ] = u ; f [ u + 8 >> 2 ] = u ; break a }} else t = b ; while ( 0 ); b = t + 8 | 0 ; c = f [ b >> 2 ] | 0 ; s = f [ 10222 ] | 0 ; if ( c >>> 0 >= s >>> 0 & t >>> 0 >= s >>> 0 ){ f [ c + 12 >> 2 ] = u ; f [ b >> 2 ] = u ; f [ u + 8 >> 2 ] = c ; f [ u + 12 >> 2 ] = t ; f [ u + 24 >> 2 ] = 0 ; break } else Ja ()} else { f [ 10219 ] = c | d ; f [ b >> 2 ] = u ; f [ u + 24 >> 2 ] = b ; f [ u + 12 >> 2 ] = u ; f [ u + 8 >> 2 ] = u } while ( 0 ); u = ( f [ 10226 ] | 0 ) +- 1 | 0 ; f [ 10226 ] = u ; if ( ! u ) b = 41328 ; else return ; while ( 1 ){ b = f [ b >> 2 ] | 0 ; if ( ! b ) break ; else b = b + 8 | 0 } f [ 10226 ] =- 1 ; return } function El ( a , b ){ a = a | 0 ; b = b | 0 ; var c = 0 ; if ( a ){ c = ca ( b , a ) | 0 ; if (( b | a ) >>> 0 > 65535 ) c = (( c >>> 0 ) / ( a >>> 0 ) | 0 | 0 ) == ( b | 0 ) ? c :- 1 } else c = 0 ; b = Cl ( c ) | 0 ; if ( ! b ) return b | 0 ; if ( ! ( f [ b +- 4 >> 2 ] & 3 )) return b | 0 ; ws ( b | 0 , 0 , c | 0 ) | 0 ; return b | 0 } function Fl ( a , b ){ a = a | 0 ; b = b | 0 ; var c = 0 , d = 0 ; if ( ! a ){ a = Cl ( b ) | 0 ; return a | 0 } if ( b >>> 0 > 4294967231 ){ f [( Jv () | 0 ) >> 2 ] = 12 ; a = 0 ; return a | 0 } c = Gl ( a +- 8 | 0 , b >>> 0 < 11 ? 16 : b + 11 &- 8 ) | 0 ; if ( c ){ a = c + 8 | 0 ; return a | 0 } c = Cl ( b ) | 0 ; if ( ! c ){ a = 0 ; return a | 0 } d = f [ a +- 4 >> 2 ] | 0 ; d = ( d &- 8 ) - (( d & 3 | 0 ) == 0 ? 8 : 4 ) | 0 ; zs ( c | 0 , a | 0 ,( d >>> 0 < b >>> 0 ? d : b ) | 0 ) | 0 ; Dl ( a ); a = c ; return a | 0 } function Gl ( a , b ){ a = a | 0 ; b = b | 0 ; var c = 0 , d = 0 , e = 0 , g = 0 , h = 0 , i = 0 , j = 0 , k = 0 , l = 0 , m = 0 , n = 0 , o = 0 , p = 0 ; o = a + 4 | 0 ; p = f [ o >> 2 ] | 0 ; j = p &- 8 ; l = a + j | 0 ; i = f [ 10222 ] | 0 ; c = p & 3 ; if ( ! (( c | 0 ) != 1 & a >>> 0 >= i >>> 0 & a >>> 0 < l >>> 0 )) Ja (); d = a + ( j | 4 ) | 0 ; e = f [ d >> 2 ] | 0 ; if ( ! ( e & 1 )) Ja (); if ( ! c ){ if ( b >>> 0 < 256 ){ a = 0 ; return a | 0 } if ( j >>> 0 >= ( b + 4 | 0 ) >>> 0 ? ( j - b | 0 ) >>> 0 <= f [ 10338 ] << 1 >>> 0 : 0 ) return a | 0 ; a = 0 ; return a | 0 } if ( j >>> 0 >= b >>> 0 ){ c = j - b | 0 ; if ( c >>> 0 <= 15 ) return a | 0 ; f [ o >> 2 ] = p & 1 | b | 2 ; f [ a + ( b + 4 ) >> 2 ] = c | 3 ; f [ d >> 2 ] = f [ d >> 2 ] | 1 ; Hl ( a + b | 0 , c ); return a | 0 } if (( l | 0 ) == ( f [ 10224 ] | 0 )){ c = ( f [ 10221 ] | 0 ) + j | 0 ; if ( c >>> 0 <= b >>> 0 ){ a = 0 ; return a | 0 } n = c - b | 0 ; f [ o >> 2 ] = p & 1 | b | 2 ; f [ a + ( b + 4 ) >> 2 ] = n | 1 ; f [ 10224 ] = a + b ; f [ 10221 ] = n ; return a | 0 } if (( l | 0 ) == ( f [ 10223 ] | 0 )){ d = ( f [ 10220 ] | 0 ) + j | 0 ; if ( d >>> 0 < b >>> 0 ){ a = 0 ; return a | 0 } c = d - b | 0 ; if ( c >>> 0 > 15 ){ f [ o >> 2 ] = p & 1 | b | 2 ; f [ a + ( b + 4 ) >> 2 ] = c | 1 ; f [ a + d >> 2 ] = c ; d = a + ( d + 4 ) | 0 ; f [ d >> 2 ] = f [ d >> 2 ] &- 2 ; d = a + b | 0 } else { f [ o >> 2 ] = p & 1 | d | 2 ; d = a + ( d + 4 ) | 0 ; f [ d >> 2 ] = f [ d >> 2 ] | 1 ; d = 0 ; c = 0 } f [ 10220 ] = c ; f [ 10223 ] = d ; return a | 0 } if ( e & 2 ){ a = 0 ; return a | 0 } m = ( e &- 8 ) + j | 0 ; if ( m >>> 0 < b >>> 0 ){ a = 0 ; return a | 0 } n = m - b | 0 ; g = e >>> 3 ; do if ( e >>> 0 >= 256 ){ h = f [ a + ( j + 24 ) >> 2 ] | 0 ; g = f [ a + ( j + 12 ) >> 2 ] | 0 ; do if (( g | 0 ) == ( l | 0 )){ d = a + ( j + 20 ) | 0 ; c = f [ d >> 2 ] | 0 ; if ( ! c ){ d = a + ( j + 16 ) | 0 ; c = f [ d >> 2 ] | 0 ; if ( ! c ){ k = 0 ; break }} while ( 1 ){ e = c + 20 | 0 ; g = f [ e >> 2 ] | 0 ; if ( g ){ c = g ; d = e ; continue } e = c + 16 | 0 ; g = f [ e >> 2 ] | 0 ; if ( ! g ) break ; else { c = g ; d = e }} if ( d >>> 0 < i >>> 0 ) Ja (); else { f [ d >> 2 ] = 0 ; k = c ; break }} else { e = f [ a + ( j + 8 ) >> 2 ] | 0 ; if ( e >>> 0 < i >>> 0 ) Ja (); c = e + 12 | 0 ; if (( f [ c >> 2 ] | 0 ) != ( l | 0 )) Ja (); d = g + 8 | 0 ; if (( f [ d >> 2 ] | 0 ) == ( l | 0 )){ f [ c >> 2 ] = g ; f [ d >> 2 ] = e ; k = g ; break } else Ja ()} while ( 0 ); if ( h ){ c = f [ a + ( j + 28 ) >> 2 ] | 0 ; d = 41176 + ( c << 2 ) | 0 ; if (( l | 0 ) == ( f [ d >> 2 ] | 0 )){ f [ d >> 2 ] = k ; if ( ! k ){ f [ 10219 ] = f [ 10219 ] &~ ( 1 << c ); break }} else { if ( h >>> 0 < ( f [ 10222 ] | 0 ) >>> 0 ) Ja (); c = h + 16 | 0 ; if (( f [ c >> 2 ] | 0 ) == ( l | 0 )) f [ c >> 2 ] = k ; else f [ h + 20 >> 2 ] = k ; if ( ! k ) break } d = f [ 10222 ] | 0 ; if ( k >>> 0 < d >>> 0 ) Ja (); f [ k + 24 >> 2 ] = h ; c = f [ a + ( j + 16 ) >> 2 ] | 0 ; do if ( c ) if ( c >>> 0 < d >>> 0 ) Ja (); else { f [ k + 16 >> 2 ] = c ; f [ c +
i = a + 24 | 0 ; j = a + 28 | 0 ; a : do if (( c | 0 ) > 0 ){ h = b ; b = 0 ; while ( 1 ){ e = f [ i >> 2 ] | 0 ; if ( e >>> 0 >= ( f [ j >> 2 ] | 0 ) >>> 0 ){ if (( px [ f [( f [ a >> 2 ] | 0 ) + 52 >> 2 ] & 63 ]( a , g [ h >> 0 ] | 0 ) | 0 ) ==- 1 ) break a } else { k = d [ h >> 0 ] | 0 ; f [ i >> 2 ] = e + 1 ; d [ e >> 0 ] = k } b = b + 1 | 0 ; if (( b | 0 ) < ( c | 0 )) h = h + 1 | 0 ; else break }} else b = 0 ; while ( 0 ); return b | 0 } function yn ( a , b ){ a = a | 0 ; b = b | 0 ; return - 1 } function zn ( a ){ a = a | 0 ; f [ a >> 2 ] = 42824 ; Gk ( a + 4 | 0 ); return } function An ( a ){ a = a | 0 ; f [ a >> 2 ] = 42824 ; Gk ( a + 4 | 0 ); Ju ( a ); return } function Bn ( a ){ a = a | 0 ; f [ a >> 2 ] = 42824 ; Ek ( a + 4 | 0 ); a = a + 8 | 0 ; f [ a >> 2 ] = 0 ; f [ a + 4 >> 2 ] = 0 ; f [ a + 8 >> 2 ] = 0 ; f [ a + 12 >> 2 ] = 0 ; f [ a + 16 >> 2 ] = 0 ; f [ a + 20 >> 2 ] = 0 ; return } function Cn ( a , b ){ a = a | 0 ; b = b | 0 ; return } function Dn ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; return a | 0 } function En ( a , b , c , d , e , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; g = g | 0 ; b = a ; f [ b >> 2 ] = 0 ; f [ b + 4 >> 2 ] = 0 ; b = a + 8 | 0 ; f [ b >> 2 ] =- 1 ; f [ b + 4 >> 2 ] =- 1 ; return } function Fn ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; b = a ; f [ b >> 2 ] = 0 ; f [ b + 4 >> 2 ] = 0 ; b = a + 8 | 0 ; f [ b >> 2 ] =- 1 ; f [ b + 4 >> 2 ] =- 1 ; return } function Gn ( a ){ a = a | 0 ; return 0 } function Hn ( a ){ a = a | 0 ; return 0 } function In ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var d = 0 , e = 0 , g = 0 , h = 0 ; g = a + 12 | 0 ; h = a + 16 | 0 ; a : do if (( c | 0 ) > 0 ){ e = b ; b = 0 ; while ( 1 ){ d = f [ g >> 2 ] | 0 ; if ( d >>> 0 >= ( f [ h >> 2 ] | 0 ) >>> 0 ){ d = ix [ f [( f [ a >> 2 ] | 0 ) + 40 >> 2 ] & 127 ]( a ) | 0 ; if (( d | 0 ) ==- 1 ) break a } else { f [ g >> 2 ] = d + 4 ; d = f [ d >> 2 ] | 0 } f [ e >> 2 ] = d ; b = b + 1 | 0 ; if (( b | 0 ) < ( c | 0 )) e = e + 4 | 0 ; else break }} else b = 0 ; while ( 0 ); return b | 0 } function Jn ( a ){ a = a | 0 ; return - 1 } function Kn ( a ){ a = a | 0 ; var b = 0 ; if (( ix [ f [( f [ a >> 2 ] | 0 ) + 36 >> 2 ] & 127 ]( a ) | 0 ) ==- 1 ) a =- 1 ; else { b = a + 12 | 0 ; a = f [ b >> 2 ] | 0 ; f [ b >> 2 ] = a + 4 ; a = f [ a >> 2 ] | 0 } return a | 0 } function Ln ( a , b ){ a = a | 0 ; b = b | 0 ; return - 1 } function Mn ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var d = 0 , e = 0 , g = 0 , h = 0 , i = 0 ; g = a + 24 | 0 ; h = a + 28 | 0 ; a : do if (( c | 0 ) > 0 ){ e = b ; b = 0 ; while ( 1 ){ d = f [ g >> 2 ] | 0 ; if ( d >>> 0 >= ( f [ h >> 2 ] | 0 ) >>> 0 ){ if (( px [ f [( f [ a >> 2 ] | 0 ) + 52 >> 2 ] & 63 ]( a , f [ e >> 2 ] | 0 ) | 0 ) ==- 1 ) break a } else { i = f [ e >> 2 ] | 0 ; f [ g >> 2 ] = d + 4 ; f [ d >> 2 ] = i } b = b + 1 | 0 ; if (( b | 0 ) < ( c | 0 )) e = e + 4 | 0 ; else break }} else b = 0 ; while ( 0 ); return b | 0 } function Nn ( a , b ){ a = a | 0 ; b = b | 0 ; return - 1 } function On ( a ){ a = a | 0 ; bn ( a + 8 | 0 ); return } function Pn ( a ){ a = a | 0 ; bn ( a + (( f [( f [ a >> 2 ] | 0 ) +- 12 >> 2 ] | 0 ) + 8 ) | 0 ); return } function Qn ( a ){ a = a | 0 ; bn ( a + 8 | 0 ); Ju ( a ); return } function Rn ( a ){ a = a | 0 ; Qn ( a + ( f [( f [ a >> 2 ] | 0 ) +- 12 >> 2 ] | 0 ) | 0 ); return } function Sn ( a ){ a = a | 0 ; var b = 0 , c = 0 , e = 0 , g = 0 ; e = l ; l = l + 16 | 0 ; c = e ; a : do if ( f [ a + (( f [( f [ a >> 2 ] | 0 ) +- 12 >> 2 ] | 0 ) + 24 ) >> 2 ] | 0 ){ r = 0 ; la ( 65 , c | 0 , a | 0 ); b = r ; r = 0 ; b : do if ( b & 1 ) b = Qa ( 0 ) | 0 ; else { do if ( d [ c >> 0 ] | 0 ){ b = f [ a + (( f [( f [ a >> 2 ] | 0 ) +- 12 >> 2 ] | 0 ) + 24 ) >> 2 ] | 0 ; r = 0 ; b = na ( f [( f [ b >> 2 ] | 0 ) + 24 >> 2 ] | 0 , b | 0 ) | 0 ; g = r ; r = 0 ; if ( ! ( g & 1 )){ if (( b | 0 ) !=- 1 ) break ; g = f [( f [ a >> 2 ] | 0 ) +- 12 >> 2 ] | 0 ; r = 0 ; la ( 66 , a + g | 0 , f [ a + ( g + 16 ) >> 2 ] | 1 | 0 ); g = r ; r = 0 ; if ( ! ( g & 1 )) break } b = Qa ( 0 ) | 0 ; eo ( c ); break b } while ( 0 ); eo ( c ); break a } while ( 0 ); Ya ( b | 0 ) | 0 ; r = 0 ; ka ( 181 , a + ( f [( f [ a >> 2 ] | 0 ) +- 12 >> 2 ] | 0 ) | 0 ); g = r ; r = 0 ; if ( ! ( g & 1 )){ $a (); break } b = Qa () | 0 ; r = 0 ; Aa ( 3 ); g = r ; r = 0 ; if ( g & 1 ){ g = Qa ( 0 ) | 0 ; Mb ( g )} else _a ( b | 0 )} while ( 0 ); l = e ; return a | 0 } function Tn ( a ){ a = a | 0 ; var b = 0 ; b = a + 16 | 0 ; f [ b >> 2 ] = f [ b >> 2 ] | 1 ; if ( ! ( f [ a + 20 >> 2 ] & 1 )) return ; else pb ()} function Un ( a ){ a = a | 0 ; bn ( a + 8 | 0 ); return } function Vn ( a ){ a = a | 0 ; bn ( a + (( f [( f [ a >> 2 ] | 0 ) +- 12 >> 2 ] | 0 ) + 8 ) | 0 ); return } function Wn ( a ){ a = a | 0 ; bn ( a + 8 | 0 ); Ju ( a ); return } function Xn ( a ){ a = a | 0 ; Wn ( a + ( f [( f [ a >> 2 ] | 0 ) +- 12 >> 2 ] | 0 ) | 0 ); return } function Yn ( a ){ a = a | 0 ; var b = 0 , c = 0 , e = 0 , g = 0 ; e = l ; l = l + 16 | 0 ; c = e ; a : do if ( f [ a + (( f [( f [ a >> 2 ] | 0 ) +- 12 >> 2 ] | 0 ) + 24 ) >> 2 ] | 0 ){ r = 0 ; la ( 89 , c | 0 , a | 0 ); b = r ; r = 0 ; b : do if ( b & 1 ) b = Qa ( 0 ) | 0 ; else { do if ( d [ c >> 0 ] | 0 ){ b = f [ a + (( f [( f [ a >> 2 ] | 0 ) +- 12 >> 2 ] | 0 ) + 24 ) >> 2 ] | 0 ; r = 0 ; b = na ( f [( f [ b >> 2 ] | 0 ) + 24 >> 2 ] | 0 , b | 0 ) | 0 ; g = r ; r = 0 ; if ( ! ( g & 1 )){ if (( b | 0 ) !=- 1 ) break ; g = f [( f [ a >> 2 ] | 0 ) +- 12 >> 2 ] | 0 ; r = 0 ; la ( 66 , a + g | 0 , f [ a + ( g + 16 ) >> 2 ] | 1 | 0 ); g = r ; r = 0 ; if ( ! ( g & 1 )) break } b = Qa ( 0 ) | 0 ; mo ( c ); break b } while ( 0 ); mo ( c ); break a } while ( 0 ); Ya ( b | 0 ) | 0 ; r = 0 ; ka ( 181 , a + ( f [( f [ a >> 2 ] | 0 ) +- 12 >> 2 ] | 0 ) | 0 ); g = r ; r = 0 ; if ( ! ( g & 1 )){ $a (); break } b = Qa () | 0 ; r = 0 ; Aa ( 3 ); g = r ; r = 0 ; if ( g & 1 ){ g = Qa ( 0 ) | 0 ; Mb ( g )} else _a ( b | 0 )} while ( 0 ); l = e ; return a | 0 } function Zn ( a , b ){ a = a | 0 ; b = b | 0 ; return } function $n ( a ){ a = a | 0 ; bn ( a + 4 | 0 ); return } function _n ( a ){ a = a | 0 ; bn ( a + (( f [( f [ a >> 2 ] | 0 ) +- 12 >> 2 ] | 0 ) + 4 ) | 0 ); return } function ao ( a ){ a = a | 0 ; bn ( a + 4 | 0 ); Ju ( a ); return } function bo ( a ){ a = a | 0 ; ao ( a + ( f [( f [ a >> 2 ] | 0 ) +- 12 >> 2 ] | 0 ) | 0 ); return } function co ( a , b ){ a = a | 0 ; b = b | 0 ; var c = 0 ; d [ a >> 0 ] = 0 ; f [ a + 4 >> 2 ] = b ; c = f [( f [ b >> 2 ] | 0 ) +- 12 >> 2 ] | 0 ; if ( ! ( f [ b + ( c + 16 ) >> 2 ] | 0 )){ c = f [ b + ( c + 72 ) >> 2 ] | 0 ; if ( c ) Sn ( c ) | 0 ; d [ a >> 0 ] = 1 } return } function eo ( a ){ a = a | 0 ; var b = 0 , c = 0 ; a = a + 4 | 0 ; c = f [ a >> 2 ] | 0 ; b = f [( f [ c >> 2 ] | 0 ) +- 12 >> 2 ] | 0 ; do if (((( f [ c + ( b + 24 ) >> 2 ] | 0 ) != 0 ? ( f [ c + ( b + 16 ) >> 2 ] | 0 ) == 0 : 0 ) ? ( f [ c + ( b + 4 ) >> 2 ] & 81
k = n + 12 | 0 ; o = n + 8 | 0 ; i = n + 4 | 0 ; d [ p >> 0 ] = d [ 58887 ] | 0 ; d [ p + 1 >> 0 ] = d [ 58888 ] | 0 ; d [ p + 2 >> 0 ] = d [ 58889 ] | 0 ; d [ p + 3 >> 0 ] = d [ 58890 ] | 0 ; d [ p + 4 >> 0 ] = d [ 58891 ] | 0 ; d [ p + 5 >> 0 ] = d [ 58892 ] | 0 ; rp ( p + 1 | 0 , 58893 , 0 , f [ c + 4 >> 2 ] | 0 ); a = Uo () | 0 ; f [ h >> 2 ] = g ; g = q + ( er ( q , 12 , a , p , h ) | 0 ) | 0 ; p = sp ( q , g , c ) | 0 ; a = fn ( c ) | 0 ; f [ o >> 2 ] = a ; r = 0 ; sa ( 1 , q | 0 , p | 0 , g | 0 , j | 0 , m | 0 , k | 0 , o | 0 ); g = r ; r = 0 ; if ( g & 1 ){ q = Qa () | 0 ; mm ( a ) | 0 ; _a ( q | 0 )} else { mm ( a ) | 0 ; f [ i >> 2 ] = f [ b >> 2 ]; p = f [ m >> 2 ] | 0 ; q = f [ k >> 2 ] | 0 ; f [ h >> 2 ] = f [ i >> 2 ]; q = Kc ( h , j , p , q , c , e ) | 0 ; l = n ; return q | 0 } return 0 } function wp ( a , b , c , d , e , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; g = g | 0 ; var h = 0 , i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , s = 0 ; n = l ; l = l + 112 | 0 ; h = n + 8 | 0 ; a = n ; p = n + 75 | 0 ; j = n + 32 | 0 ; m = n + 28 | 0 ; k = n + 24 | 0 ; o = n + 20 | 0 ; i = n + 16 | 0 ; q = a ; f [ q >> 2 ] = 37 ; f [ q + 4 >> 2 ] = 0 ; rp ( a + 1 | 0 , 58895 , 0 , f [ c + 4 >> 2 ] | 0 ); q = Uo () | 0 ; s = h ; f [ s >> 2 ] = e ; f [ s + 4 >> 2 ] = g ; g = p + ( er ( p , 23 , q , a , h ) | 0 ) | 0 ; e = sp ( p , g , c ) | 0 ; a = fn ( c ) | 0 ; f [ o >> 2 ] = a ; r = 0 ; sa ( 1 , p | 0 , e | 0 , g | 0 , j | 0 , m | 0 , k | 0 , o | 0 ); g = r ; r = 0 ; if ( g & 1 ){ s = Qa () | 0 ; mm ( a ) | 0 ; _a ( s | 0 )} else { mm ( a ) | 0 ; f [ i >> 2 ] = f [ b >> 2 ]; q = f [ m >> 2 ] | 0 ; s = f [ k >> 2 ] | 0 ; f [ h >> 2 ] = f [ i >> 2 ]; s = Kc ( h , j , q , s , c , d ) | 0 ; l = n ; return s | 0 } return 0 } function xp ( a , b , c , d , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e =+ e ; var g = 0 , h = 0 , i = 0 , j = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 ; z = l ; l = l + 176 | 0 ; u = z + 84 | 0 ; p = z + 48 | 0 ; o = z + 32 | 0 ; j = z + 24 | 0 ; g = z + 8 | 0 ; n = z ; s = z + 88 | 0 ; t = z + 80 | 0 ; i = z + 118 | 0 ; y = z + 76 | 0 ; x = z + 72 | 0 ; v = z + 68 | 0 ; w = z + 64 | 0 ; m = n ; f [ m >> 2 ] = 37 ; f [ m + 4 >> 2 ] = 0 ; m = yp ( n + 1 | 0 , 58898 , f [ c + 4 >> 2 ] | 0 ) | 0 ; f [ t >> 2 ] = s ; a = Uo () | 0 ; if ( m ){ f [ g >> 2 ] = f [ c + 8 >> 2 ]; k [ g + 8 >> 3 ] = e ; g = er ( s , 30 , a , n , g ) | 0 } else { k [ j >> 3 ] = e ; g = er ( s , 30 , a , n , j ) | 0 } a : do if (( g | 0 ) > 29 ){ r = 0 ; a = xa ( 3 ) | 0 ; g = r ; r = 0 ; g = g & 1 ; if ( m ){ if ( ! g ? ( r = 0 , f [ o >> 2 ] = f [ c + 8 >> 2 ], k [ o + 8 >> 3 ] = e , h = ya ( 17 , t | 0 , a | 0 , n | 0 , o | 0 ) | 0 , q = r , r = 0 , ! ( q & 1 )) : 0 ) A = 12 } else if ( ! g ? ( r = 0 , f [ p >> 2 ] = f [ c + 8 >> 2 ], k [ p + 8 >> 3 ] = e , q = ya ( 17 , t | 0 , a | 0 , n | 0 , p | 0 ) | 0 , p = r , r = 0 , ! ( p & 1 )) : 0 ){ h = q ; A = 12 } do if (( A | 0 ) == 12 ){ a = f [ t >> 2 ] | 0 ; if ( ! a ){ r = 0 ; Aa ( 6 ); q = r ; r = 0 ; if ( q & 1 ) break ; g = f [ t >> 2 ] | 0 } else g = a ; a = g ; n = g ; A = 16 ; break a } while ( 0 ); a = Qa () | 0 } else { a = f [ t >> 2 ] | 0 ; n = 0 ; h = g ; A = 16 } while ( 0 ); if (( A | 0 ) == 16 ){ j = a + h | 0 ; m = sp ( a , j , c ) | 0 ; do if (( a | 0 ) == ( s | 0 )){ a = s ; g = 0 ; A = 22 } else { h = Cl ( h << 1 ) | 0 ; if ( ! h ){ r = 0 ; Aa ( 6 ); A = r ; r = 0 ; if ( A & 1 ){ g = 0 ; A = 20 ; break } a = f [ t >> 2 ] | 0 } g = h ; i = h ; A = 22 } while ( 0 ); do if (( A | 0 ) == 22 ){ r = 0 ; h = na ( 68 , c | 0 ) | 0 ; t = r ; r = 0 ; if ( ! ( t & 1 )){ f [ v >> 2 ] = h ; r = 0 ; sa ( 2 , a | 0 , m | 0 , j | 0 , i | 0 , y | 0 , x | 0 , v | 0 ); v = r ; r = 0 ; if ( v & 1 ){ a = Qa () | 0 ; mm ( h ) | 0 ; break } mm ( h ) | 0 ; f [ w >> 2 ] = f [ b >> 2 ]; A = f [ y >> 2 ] | 0 ; a = f [ x >> 2 ] | 0 ; r = 0 ; f [ u >> 2 ] = f [ w >> 2 ]; a = ma ( 39 , u | 0 , i | 0 , A | 0 , a | 0 , c | 0 , d | 0 ) | 0 ; A = r ; r = 0 ; if ( ! ( A & 1 )){ f [ b >> 2 ] = a ; if ( g ) Dl ( g ); if ( n ) Dl ( n ); l = z ; return a | 0 } else A = 20 } else A = 20 } while ( 0 ); if (( A | 0 ) == 20 ) a = Qa () | 0 ; if ( g ) Dl ( g ); if ( n ) Dl ( n )} _a ( a | 0 ); return 0 } function yp ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var e = 0 , f = 0 , g = 0 , h = 0 , i = 0 ; if ( c & 2048 ){ d [ a >> 0 ] = 43 ; a = a + 1 | 0 } if ( c & 1024 ){ d [ a >> 0 ] = 35 ; a = a + 1 | 0 } h = c & 260 ; f = c >>> 14 ; i = ( h | 0 ) == 260 ; if ( i ) g = 0 ; else { d [ a >> 0 ] = 46 ; d [ a + 1 >> 0 ] = 42 ; a = a + 2 | 0 ; g = 1 } c = d [ b >> 0 ] | 0 ; if ( c << 24 >> 24 ){ e = a ; while ( 1 ){ b = b + 1 | 0 ; a = e + 1 | 0 ; d [ e >> 0 ] = c ; c = d [ b >> 0 ] | 0 ; if ( ! ( c << 24 >> 24 )) break ; else e = a }} a : do switch ( h | 0 ){ case 4 : if ( ! ( f & 1 )){ d [ a >> 0 ] = 102 ; break a } else { d [ a >> 0 ] = 70 ; break a } case 256 : if ( ! ( f & 1 )){ d [ a >> 0 ] = 101 ; break a } else { d [ a >> 0 ] = 69 ; break a } default : { c = ( f & 1 | 0 ) != 0 ; if ( i ) if ( c ){ d [ a >> 0 ] = 65 ; break a } else { d [ a >> 0 ] = 97 ; break a } else if ( c ){ d [ a >> 0 ] = 71 ; break a } else { d [ a >> 0 ] = 103 ; break a }}} while ( 0 ); return g | 0 } function zp ( a , b , c , e , g , h , i ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; g = g | 0 ; h = h | 0 ; i = i | 0 ; var j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 , B = 0 ; z = l ; l = l + 16 | 0 ; A = z ; y = Ik ( i , 44220 ) | 0 ; w = Ik ( i , 44360 ) | 0 ; gx [ f [( f [ w >> 2 ] | 0 ) + 20 >> 2 ] & 127 ]( A , w ); f [ h >> 2 ] = e ; i = d [ a >> 0 ] | 0 ; switch ( i << 24 >> 24 ){ case 43 : case 45 : { r = 0 ; i = ua ( f [( f [ y >> 2 ] | 0 ) + 28 >> 2 ] | 0 , y | 0 , i | 0 ) | 0 ; x = r ; r = 0 ; if ( x & 1 ) v = 8 ; else { n = f [ h >> 2 ] | 0 ; f [ h >> 2 ] = n + 1 ; d [ n >> 0 ] = i ; n = a + 1 | 0 ; v = 10 } break } default : { n = a ; v = 10 }} a : do if (( v | 0 ) == 10 ){ x = c ; b : do if (( x - n | 0 ) > 1 ? ( d [ n >> 0 ] | 0 ) == 48 : 0 ){ k = n + 1 | 0 ; switch ( d [ k >> 0 ] | 0 ){ case 88 : case 120 : break ; default : { v = 11 ; break b }} r = 0 ; i = ua ( f [( f [ y >> 2 ] | 0 ) + 28 >> 2 ] | 0 , y | 0 , 48 ) | 0 ; u = r ; r = 0 ; if ( u & 1 ){ v = 8 ; break a } u = f [ h >> 2 ] | 0 ; f [ h >> 2 ] = u + 1 ; d [ u >> 0 ] = i ; n = n + 2 | 0 ; r = 0 ; i = ua ( f [( f [ y >> 2 ] | 0 ) + 28 >> 2 ] | 0 , y | 0 , d [ k >> 0 ] | 0 ) | 0 ; u = r ; r = 0 ; if ( u & 1 ){ v = 8 ; break a } u = f [ h >> 2 ] | 0 ; f [ h >> 2 ] = u + 1 ; d [ u >> 0 ] = i ; if ( n >>> 0 < c >>> 0 ){ i = n ; while ( 1 ){ k = d [ i >> 0 ] | 0 ; r = 0 ; m = xa ( 3 ) | 0 ; u = r ; r = 0 ; if ( u & 1 ) break ; r = 0 ; k = ua ( 39 , k << 24 >> 24 | 0 , m | 0 ) | 0 ; u = r ; r = 0 ; if ( u & 1 ) break ; if ( ! k ){ u = n ; break b } i = i + 1 | 0 ; if ( i >>> 0 >= c >>> 0 ){ u = n ; break b }} i = Qa () | 0 ; break a } else { u = n ; i = n }} else v = 11 ; while ( 0 ); b : do if (( v | 0 ) == 11 ) if ( n >>> 0 < c >>> 0 ){ i = n ; while ( 1 ){ k = d [ i >> 0 ] | 0 ; r = 0 ; m = xa ( 3 ) | 0 ; u = r ; r = 0 ; if ( u & 1 ) break ; r = 0 ; k = u
f [ b >> 2 ] = 0 ; a = 0 }}} else a = 0 ; e = ( a | 0 ) == 0 ; do if ( j ){ if (( f [ j + 12 >> 2 ] | 0 ) == ( f [ j + 16 >> 2 ] | 0 )){ r = 0 ; a = na ( f [( f [ j >> 2 ] | 0 ) + 36 >> 2 ] | 0 , j | 0 ) | 0 ; E = r ; r = 0 ; if ( E & 1 ){ D = 25 ; break a } if (( a | 0 ) ==- 1 ){ f [ c >> 2 ] = 0 ; D = 49 ; break }} if ( ! e ) D = 50 } else D = 49 ; while ( 0 ); if (( D | 0 ) == 49 ? e : 0 ) D = 50 ; if (( D | 0 ) == 50 ) f [ h >> 2 ] = f [ h >> 2 ] | 2 ; E = f [ b >> 2 ] | 0 ; Fm ( B ); Fm ( C ); l = A ; return E | 0 } else D = 25 } else D = 25 ; while ( 0 ); if (( D | 0 ) == 25 ) a = Qa () | 0 ; Fm ( B ); Fm ( C ); _a ( a | 0 ); return 0 } function Nq ( a , b , c , e , h , i ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; h = h | 0 ; i = i | 0 ; var j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 , B = 0 , C = 0 , D = 0 , E = 0 ; A = l ; l = l + 240 | 0 ; t = A + 202 | 0 ; j = A + 200 | 0 ; C = A + 24 | 0 ; B = A + 12 | 0 ; v = A + 8 | 0 ; y = A + 40 | 0 ; z = A + 4 | 0 ; w = A ; u = vq ( e ) | 0 ; hp ( C , e , t , j ); f [ B >> 2 ] = 0 ; f [ B + 4 >> 2 ] = 0 ; f [ B + 8 >> 2 ] = 0 ; if ( ! ( d [ B >> 0 ] & 1 )) a = 10 ; else a = ( f [ B >> 2 ] &- 2 ) +- 1 | 0 ; r = 0 ; za ( 8 , B | 0 , a | 0 , 0 ); s = r ; r = 0 ; a : do if ( ! ( s & 1 )){ p = B + 8 | 0 ; q = B + 1 | 0 ; e = ( d [ B >> 0 ] & 1 ) == 0 ? q : f [ p >> 2 ] | 0 ; f [ v >> 2 ] = e ; f [ z >> 2 ] = y ; f [ w >> 2 ] = 0 ; s = B + 4 | 0 ; o = d [ j >> 0 ] | 0 ; a = f [ b >> 2 ] | 0 ; b : while ( 1 ){ if ( a ){ if (( f [ a + 12 >> 2 ] | 0 ) == ( f [ a + 16 >> 2 ] | 0 )){ r = 0 ; j = na ( f [( f [ a >> 2 ] | 0 ) + 36 >> 2 ] | 0 , a | 0 ) | 0 ; n = r ; r = 0 ; if ( n & 1 ){ D = 24 ; break } if (( j | 0 ) ==- 1 ){ f [ b >> 2 ] = 0 ; a = 0 }}} else a = 0 ; j = ( a | 0 ) == 0 ; k = f [ c >> 2 ] | 0 ; do if ( k ){ if (( f [ k + 12 >> 2 ] | 0 ) != ( f [ k + 16 >> 2 ] | 0 )) if ( j ) break ; else break b ; r = 0 ; m = na ( f [( f [ k >> 2 ] | 0 ) + 36 >> 2 ] | 0 , k | 0 ) | 0 ; n = r ; r = 0 ; if ( n & 1 ){ D = 24 ; break b } if (( m | 0 ) !=- 1 ) if ( j ) break ; else break b ; else { f [ c >> 2 ] = 0 ; D = 16 ; break }} else D = 16 ; while ( 0 ); if (( D | 0 ) == 16 ){ D = 0 ; if ( j ){ k = 0 ; break } else k = 0 } j = d [ B >> 0 ] | 0 ; j = ( j & 1 ) == 0 ? ( j & 255 ) >>> 1 : f [ s >> 2 ] | 0 ; if (( f [ v >> 2 ] | 0 ) == ( e + j | 0 )){ r = 0 ; za ( 8 , B | 0 , j << 1 | 0 , 0 ); n = r ; r = 0 ; if ( n & 1 ){ D = 24 ; break } if ( ! ( d [ B >> 0 ] & 1 )) e = 10 ; else e = ( f [ B >> 2 ] &- 2 ) +- 1 | 0 ; r = 0 ; za ( 8 , B | 0 , e | 0 , 0 ); n = r ; r = 0 ; if ( n & 1 ){ D = 24 ; break } e = ( d [ B >> 0 ] & 1 ) == 0 ? q : f [ p >> 2 ] | 0 ; f [ v >> 2 ] = e + j } m = a + 12 | 0 ; j = f [ m >> 2 ] | 0 ; n = a + 16 | 0 ; if (( j | 0 ) == ( f [ n >> 2 ] | 0 )){ r = 0 ; j = na ( f [( f [ a >> 2 ] | 0 ) + 36 >> 2 ] | 0 , a | 0 ) | 0 ; E = r ; r = 0 ; if ( E & 1 ){ D = 24 ; break }} else j = g [ j >> 0 ] | 0 ; if ( To ( j & 255 , u , e , v , w , o , C , y , z , t ) | 0 ) break ; j = f [ m >> 2 ] | 0 ; if (( j | 0 ) == ( f [ n >> 2 ] | 0 )){ r = 0 ; na ( f [( f [ a >> 2 ] | 0 ) + 40 >> 2 ] | 0 , a | 0 ) | 0 ; E = r ; r = 0 ; if ( E & 1 ){ D = 24 ; break } else continue } else { f [ m >> 2 ] = j + 1 ; continue }} if (( D | 0 ) == 24 ){ a = Qa () | 0 ; break } E = d [ C >> 0 ] | 0 ; if (((( E & 1 ) == 0 ? ( E & 255 ) >>> 1 : f [ C + 4 >> 2 ] | 0 ) | 0 ) != 0 ? ( x = f [ z >> 2 ] | 0 ,( x - y | 0 ) < 160 ) : 0 ){ E = f [ w >> 2 ] | 0 ; f [ z >> 2 ] = x + 4 ; f [ x >> 2 ] = E } r = 0 ; e = ya ( 22 , e | 0 , f [ v >> 2 ] | 0 , h | 0 , u | 0 ) | 0 ; j = G ; E = r ; r = 0 ; if ( ! ( E & 1 )){ E = i ; f [ E >> 2 ] = e ; f [ E + 4 >> 2 ] = j ; Uj ( C , y , f [ z >> 2 ] | 0 , h ); if ( a ){ if (( f [ a + 12 >> 2 ] | 0 ) == ( f [ a + 16 >> 2 ] | 0 )){ r = 0 ; e = na ( f [( f [ a >> 2 ] | 0 ) + 36 >> 2 ] | 0 , a | 0 ) | 0 ; E = r ; r = 0 ; if ( E & 1 ){ D = 25 ; break } if (( e | 0 ) ==- 1 ){ f [ b >> 2 ] = 0 ; a = 0 }}} else a = 0 ; e = ( a | 0 ) == 0 ; do if ( k ){ if (( f [ k + 12 >> 2 ] | 0 ) == ( f [ k + 16 >> 2 ] | 0 )){ r = 0 ; a = na ( f [( f [ k >> 2 ] | 0 ) + 36 >> 2 ] | 0 , k | 0 ) | 0 ; E = r ; r = 0 ; if ( E & 1 ){ D = 25 ; break a } if (( a | 0 ) ==- 1 ){ f [ c >> 2 ] = 0 ; D = 49 ; break }} if ( ! e ) D = 50 } else D = 49 ; while ( 0 ); if (( D | 0 ) == 49 ? e : 0 ) D = 50 ; if (( D | 0 ) == 50 ) f [ h >> 2 ] = f [ h >> 2 ] | 2 ; E = f [ b >> 2 ] | 0 ; Fm ( B ); Fm ( C ); l = A ; return E | 0 } else D = 25 } else D = 25 ; while ( 0 ); if (( D | 0 ) == 25 ) a = Qa () | 0 ; Fm ( B ); Fm ( C ); _a ( a | 0 ); return 0 } function Oq ( a , b , c , h , i , j ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; h = h | 0 ; i = i | 0 ; j = j | 0 ; var k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 , B = 0 , C = 0 , D = 0 , E = 0 , F = 0 ; B = l ; l = l + 240 | 0 ; u = B + 202 | 0 ; k = B + 200 | 0 ; D = B + 24 | 0 ; C = B + 12 | 0 ; w = B + 8 | 0 ; z = B + 40 | 0 ; A = B + 4 | 0 ; x = B ; v = vq ( h ) | 0 ; hp ( D , h , u , k ); f [ C >> 2 ] = 0 ; f [ C + 4 >> 2 ] = 0 ; f [ C + 8 >> 2 ] = 0 ; if ( ! ( d [ C >> 0 ] & 1 )) a = 10 ; else a = ( f [ C >> 2 ] &- 2 ) +- 1 | 0 ; r = 0 ; za ( 8 , C | 0 , a | 0 , 0 ); t = r ; r = 0 ; a : do if ( ! ( t & 1 )){ q = C + 8 | 0 ; s = C + 1 | 0 ; h = ( d [ C >> 0 ] & 1 ) == 0 ? s : f [ q >> 2 ] | 0 ; f [ w >> 2 ] = h ; f [ A >> 2 ] = z ; f [ x >> 2 ] = 0 ; t = C + 4 | 0 ; p = d [ k >> 0 ] | 0 ; a = f [ b >> 2 ] | 0 ; b : while ( 1 ){ if ( a ){ if (( f [ a + 12 >> 2 ] | 0 ) == ( f [ a + 16 >> 2 ] | 0 )){ r = 0 ; k = na ( f [( f [ a >> 2 ] | 0 ) + 36 >> 2 ] | 0 , a | 0 ) | 0 ; o = r ; r = 0 ; if ( o & 1 ){ E = 24 ; break } if (( k | 0 ) ==- 1 ){ f [ b >> 2 ] = 0 ; a = 0 }}} else a = 0 ; m = ( a | 0 ) == 0 ; k = f [ c >> 2 ] | 0 ; do if ( k ){ if (( f [ k + 12 >> 2 ] | 0 ) != ( f [ k + 16 >> 2 ] | 0 )) if ( m ) break ; else break b ; r = 0 ; n = na ( f [( f [ k >> 2 ] | 0 ) + 36 >> 2 ] | 0 , k | 0 ) | 0 ; o = r ; r = 0 ; if ( o & 1 ){ E = 24 ; break b } if (( n | 0 ) !=- 1 ) if ( m ) break ; else break b ; else { f [ c >> 2 ] = 0 ; E = 16 ; break }} else E = 16 ; while ( 0 ); if (( E | 0 ) == 16 ){ E = 0 ; if ( m ){ k = 0 ; break } else k = 0 } m = d [ C >> 0 ] | 0 ; m = ( m & 1 ) == 0 ? ( m & 255 ) >>> 1 : f [ t >> 2 ] | 0 ; if (( f [ w >> 2 ] | 0 ) == ( h + m | 0 )){ r = 0 ; za ( 8 , C | 0 , m << 1 | 0 , 0 ); o = r ; r = 0 ; if ( o & 1 ){ E = 24 ; break } if ( ! ( d [ C >> 0 ] & 1 )) h = 10 ; else h = ( f [ C >> 2 ] &- 2 ) +- 1 | 0 ; r = 0 ; za ( 8 , C | 0 , h | 0 , 0 ); o = r ; r = 0 ; if ( o & 1 ){ E = 24 ; break } h = ( d [ C >> 0 ] & 1 ) == 0 ? s : f [ q >> 2 ] | 0 ; f [ w >> 2 ] = h + m } n = a + 12 | 0 ; m = f [ n >> 2 ] | 0 ; o = a + 16 | 0 ; if (( m | 0 ) == ( f [ o >> 2 ] | 0 )){ r = 0 ; m = na ( f [( f [ a >> 2 ] | 0 ) + 36 >> 2 ] | 0 , a | 0 ) | 0 ; F = r ; r = 0 ; if ( F & 1 ){ E = 24 ; break }} else m = g [ m >> 0 ] | 0 ; if ( To ( m & 255 , v , h , w , x , p , D , z , A , u ) | 0 ) break ; k = f [ n >> 2 ] | 0 ; if (( k | 0 ) == ( f [ o >> 2 ] | 0 )){ r = 0 ; na ( f [( f [ a >> 2 ] | 0 ) + 40 >> 2 ] | 0 , a | 0 ) | 0 ; F = r ; r = 0 ; if ( F & 1 ){ E = 24 ; break } else con
r = 0 ; za ( 8 , A | 0 , i << 1 | 0 , 0 ); m = r ; r = 0 ; if ( m & 1 ){ C = 25 ; break } if ( ! ( d [ A >> 0 ] & 1 )) a = 10 ; else a = ( f [ A >> 2 ] &- 2 ) +- 1 | 0 ; r = 0 ; za ( 8 , A | 0 , a | 0 , 0 ); m = r ; r = 0 ; if ( m & 1 ){ C = 25 ; break } a = ( d [ A >> 0 ] & 1 ) == 0 ? p : f [ o >> 2 ] | 0 ; f [ u >> 2 ] = a + i } j = e + 12 | 0 ; i = f [ j >> 2 ] | 0 ; m = e + 16 | 0 ; if (( i | 0 ) == ( f [ m >> 2 ] | 0 )){ r = 0 ; i = na ( f [( f [ e >> 2 ] | 0 ) + 36 >> 2 ] | 0 , e | 0 ) | 0 ; D = r ; r = 0 ; if ( D & 1 ){ C = 25 ; break }} else i = f [ i >> 2 ] | 0 ; if ( gp ( i , t , a , u , v , n , B , x , y , s ) | 0 ){ i = k ; break } i = f [ j >> 2 ] | 0 ; if (( i | 0 ) == ( f [ m >> 2 ] | 0 )){ r = 0 ; na ( f [( f [ e >> 2 ] | 0 ) + 40 >> 2 ] | 0 , e | 0 ) | 0 ; D = r ; r = 0 ; if ( D & 1 ){ C = 25 ; break } else { i = e ; continue }} else { f [ j >> 2 ] = i + 4 ; i = e ; continue }} if (( C | 0 ) == 25 ){ a = Qa () | 0 ; break } D = d [ B >> 0 ] | 0 ; if (((( D & 1 ) == 0 ? ( D & 255 ) >>> 1 : f [ B + 4 >> 2 ] | 0 ) | 0 ) != 0 ? ( w = f [ y >> 2 ] | 0 ,( w - x | 0 ) < 160 ) : 0 ){ D = f [ v >> 2 ] | 0 ; f [ y >> 2 ] = w + 4 ; f [ w >> 2 ] = D } r = 0 ; a = ya ( 25 , a | 0 , f [ u >> 2 ] | 0 , g | 0 , t | 0 ) | 0 ; D = r ; r = 0 ; if ( ! ( D & 1 )){ f [ h >> 2 ] = a ; Uj ( B , x , f [ y >> 2 ] | 0 , g ); if ( e ){ a = f [ e + 12 >> 2 ] | 0 ; if (( a | 0 ) == ( f [ e + 16 >> 2 ] | 0 )){ r = 0 ; a = na ( f [( f [ e >> 2 ] | 0 ) + 36 >> 2 ] | 0 , e | 0 ) | 0 ; D = r ; r = 0 ; if ( D & 1 ){ C = 26 ; break }} else a = f [ a >> 2 ] | 0 ; if (( a | 0 ) ==- 1 ){ f [ b >> 2 ] = 0 ; e = 1 } else e = 0 } else e = 1 ; do if ( i ){ a = f [ i + 12 >> 2 ] | 0 ; if (( a | 0 ) == ( f [ i + 16 >> 2 ] | 0 )){ r = 0 ; a = na ( f [( f [ i >> 2 ] | 0 ) + 36 >> 2 ] | 0 , i | 0 ) | 0 ; D = r ; r = 0 ; if ( D & 1 ){ C = 26 ; break a }} else a = f [ a >> 2 ] | 0 ; if (( a | 0 ) !=- 1 ) if ( e ) break ; else { C = 53 ; break } else { f [ c >> 2 ] = 0 ; C = 51 ; break }} else C = 51 ; while ( 0 ); if (( C | 0 ) == 51 ? e : 0 ) C = 53 ; if (( C | 0 ) == 53 ) f [ g >> 2 ] = f [ g >> 2 ] | 2 ; D = f [ b >> 2 ] | 0 ; Fm ( A ); Fm ( B ); l = z ; return D | 0 } else C = 26 } else C = 26 ; while ( 0 ); if (( C | 0 ) == 26 ) a = Qa () | 0 ; Fm ( A ); Fm ( B ); _a ( a | 0 ); return 0 } function ar ( a , b , c , e , g , h ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; g = g | 0 ; h = h | 0 ; var i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 , B = 0 , C = 0 , D = 0 ; z = l ; l = l + 320 | 0 ; s = z + 208 | 0 ; i = z + 200 | 0 ; B = z + 24 | 0 ; A = z + 12 | 0 ; u = z + 8 | 0 ; x = z + 40 | 0 ; y = z + 4 | 0 ; v = z ; t = vq ( e ) | 0 ; kp ( B , e , s , i ); f [ A >> 2 ] = 0 ; f [ A + 4 >> 2 ] = 0 ; f [ A + 8 >> 2 ] = 0 ; if ( ! ( d [ A >> 0 ] & 1 )) a = 10 ; else a = ( f [ A >> 2 ] &- 2 ) +- 1 | 0 ; r = 0 ; za ( 8 , A | 0 , a | 0 , 0 ); q = r ; r = 0 ; a : do if ( ! ( q & 1 )){ o = A + 8 | 0 ; p = A + 1 | 0 ; a = ( d [ A >> 0 ] & 1 ) == 0 ? p : f [ o >> 2 ] | 0 ; f [ u >> 2 ] = a ; f [ y >> 2 ] = x ; f [ v >> 2 ] = 0 ; q = A + 4 | 0 ; n = f [ i >> 2 ] | 0 ; i = f [ b >> 2 ] | 0 ; b : while ( 1 ){ if ( i ){ e = f [ i + 12 >> 2 ] | 0 ; if (( e | 0 ) == ( f [ i + 16 >> 2 ] | 0 )){ r = 0 ; e = na ( f [( f [ i >> 2 ] | 0 ) + 36 >> 2 ] | 0 , i | 0 ) | 0 ; m = r ; r = 0 ; if ( m & 1 ){ C = 25 ; break }} else e = f [ e >> 2 ] | 0 ; if (( e | 0 ) ==- 1 ){ f [ b >> 2 ] = 0 ; i = 0 ; k = 1 } else k = 0 } else { i = 0 ; k = 1 } j = f [ c >> 2 ] | 0 ; do if ( j ){ e = f [ j + 12 >> 2 ] | 0 ; if (( e | 0 ) == ( f [ j + 16 >> 2 ] | 0 )){ r = 0 ; e = na ( f [( f [ j >> 2 ] | 0 ) + 36 >> 2 ] | 0 , j | 0 ) | 0 ; m = r ; r = 0 ; if ( m & 1 ){ C = 25 ; break b }} else e = f [ e >> 2 ] | 0 ; if (( e | 0 ) !=- 1 ) if ( k ) break ; else break b ; else { f [ c >> 2 ] = 0 ; C = 17 ; break }} else C = 17 ; while ( 0 ); if (( C | 0 ) == 17 ){ C = 0 ; if ( k ){ j = 0 ; break } else j = 0 } e = d [ A >> 0 ] | 0 ; e = ( e & 1 ) == 0 ? ( e & 255 ) >>> 1 : f [ q >> 2 ] | 0 ; if (( f [ u >> 2 ] | 0 ) == ( a + e | 0 )){ r = 0 ; za ( 8 , A | 0 , e << 1 | 0 , 0 ); m = r ; r = 0 ; if ( m & 1 ){ C = 25 ; break } if ( ! ( d [ A >> 0 ] & 1 )) a = 10 ; else a = ( f [ A >> 2 ] &- 2 ) +- 1 | 0 ; r = 0 ; za ( 8 , A | 0 , a | 0 , 0 ); m = r ; r = 0 ; if ( m & 1 ){ C = 25 ; break } a = ( d [ A >> 0 ] & 1 ) == 0 ? p : f [ o >> 2 ] | 0 ; f [ u >> 2 ] = a + e } k = i + 12 | 0 ; e = f [ k >> 2 ] | 0 ; m = i + 16 | 0 ; if (( e | 0 ) == ( f [ m >> 2 ] | 0 )){ r = 0 ; e = na ( f [( f [ i >> 2 ] | 0 ) + 36 >> 2 ] | 0 , i | 0 ) | 0 ; D = r ; r = 0 ; if ( D & 1 ){ C = 25 ; break }} else e = f [ e >> 2 ] | 0 ; if ( gp ( e , t , a , u , v , n , B , x , y , s ) | 0 ) break ; e = f [ k >> 2 ] | 0 ; if (( e | 0 ) == ( f [ m >> 2 ] | 0 )){ r = 0 ; na ( f [( f [ i >> 2 ] | 0 ) + 40 >> 2 ] | 0 , i | 0 ) | 0 ; D = r ; r = 0 ; if ( D & 1 ){ C = 25 ; break } else continue } else { f [ k >> 2 ] = e + 4 ; continue }} if (( C | 0 ) == 25 ){ a = Qa () | 0 ; break } D = d [ B >> 0 ] | 0 ; if (((( D & 1 ) == 0 ? ( D & 255 ) >>> 1 : f [ B + 4 >> 2 ] | 0 ) | 0 ) != 0 ? ( w = f [ y >> 2 ] | 0 ,( w - x | 0 ) < 160 ) : 0 ){ D = f [ v >> 2 ] | 0 ; f [ y >> 2 ] = w + 4 ; f [ w >> 2 ] = D } r = 0 ; a = ya ( 26 , a | 0 , f [ u >> 2 ] | 0 , g | 0 , t | 0 ) | 0 ; e = G ; D = r ; r = 0 ; if ( ! ( D & 1 )){ D = h ; f [ D >> 2 ] = a ; f [ D + 4 >> 2 ] = e ; Uj ( B , x , f [ y >> 2 ] | 0 , g ); if ( i ){ a = f [ i + 12 >> 2 ] | 0 ; if (( a | 0 ) == ( f [ i + 16 >> 2 ] | 0 )){ r = 0 ; a = na ( f [( f [ i >> 2 ] | 0 ) + 36 >> 2 ] | 0 , i | 0 ) | 0 ; D = r ; r = 0 ; if ( D & 1 ){ C = 26 ; break }} else a = f [ a >> 2 ] | 0 ; if (( a | 0 ) ==- 1 ){ f [ b >> 2 ] = 0 ; e = 1 } else e = 0 } else e = 1 ; do if ( j ){ a = f [ j + 12 >> 2 ] | 0 ; if (( a | 0 ) == ( f [ j + 16 >> 2 ] | 0 )){ r = 0 ; a = na ( f [( f [ j >> 2 ] | 0 ) + 36 >> 2 ] | 0 , j | 0 ) | 0 ; D = r ; r = 0 ; if ( D & 1 ){ C = 26 ; break a }} else a = f [ a >> 2 ] | 0 ; if (( a | 0 ) !=- 1 ) if ( e ) break ; else { C = 53 ; break } else { f [ c >> 2 ] = 0 ; C = 51 ; break }} else C = 51 ; while ( 0 ); if (( C | 0 ) == 51 ? e : 0 ) C = 53 ; if (( C | 0 ) == 53 ) f [ g >> 2 ] = f [ g >> 2 ] | 2 ; D = f [ b >> 2 ] | 0 ; Fm ( A ); Fm ( B ); l = z ; return D | 0 } else C = 26 } else C = 26 ; while ( 0 ); if (( C | 0 ) == 26 ) a = Qa () | 0 ; Fm ( A ); Fm ( B ); _a ( a | 0 ); return 0 } function br ( a , b , c , e , g , h ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; g = g | 0 ; h = h | 0 ; var i = 0.0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 , B = 0 , C = 0 , D = 0 , E = 0 , F = 0 , G = 0 , H = 0 ; D = l ; l = l + 352 | 0 ; v = D + 208 | 0 ; k = D + 40 | 0 ; m = D + 36 | 0 ; F = D + 24 | 0 ; E = D + 12 | 0 ; x = D + 8 | 0 ; B = D + 48 | 0 ; C = D + 4 | 0 ; y = D ; z = D + 337 | 0 ; w = D + 336 | 0 ; lp ( F , e , v , k , m ); f [ E >> 2 ] = 0 ; f [ E + 4 >> 2 ] = 0 ; f [ E + 8 >> 2 ] = 0 ; if ( ! ( d [ E >> 0 ] & 1 )) a = 10 ; else a = ( f [ E >> 2 ] &- 2 ) +- 1 | 0 ; r = 0 ; za ( 8 , E | 0 , a | 0 , 0 ); u = r ; r = 0 ; a : do if ( ! ( u & 1 )){ s = E + 8 | 0 ; t = E + 1 | 0 ; a = ( d [ E >> 0 ] & 1 ) == 0
return } function hs ( a , b , c , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; var g = 0 ; f [ a + 12 >> 2 ] = 0 ; f [ a + 16 >> 2 ] = e ; do if ( b ){ g = e + 112 | 0 ; if ( b >>> 0 < 29 & ( d [ g >> 0 ] | 0 ) == 0 ){ d [ g >> 0 ] = 1 ; break } else { e = Iu ( b << 2 ) | 0 ; break }} else e = 0 ; while ( 0 ); f [ a >> 2 ] = e ; c = e + ( c << 2 ) | 0 ; f [ a + 8 >> 2 ] = c ; f [ a + 4 >> 2 ] = c ; f [ a + 12 >> 2 ] = e + ( b << 2 ); return } function is ( a , b ){ a = a | 0 ; b = b | 0 ; var c = 0 , d = 0 , e = 0 , g = 0 , h = 0 ; d = f [ a >> 2 ] | 0 ; g = a + 4 | 0 ; c = b + 4 | 0 ; e = ( f [ g >> 2 ] | 0 ) - d | 0 ; h = ( f [ c >> 2 ] | 0 ) + ( 0 - ( e >> 2 ) << 2 ) | 0 ; f [ c >> 2 ] = h ; zs ( h | 0 , d | 0 , e | 0 ) | 0 ; e = f [ a >> 2 ] | 0 ; f [ a >> 2 ] = f [ c >> 2 ]; f [ c >> 2 ] = e ; e = b + 8 | 0 ; d = f [ g >> 2 ] | 0 ; f [ g >> 2 ] = f [ e >> 2 ]; f [ e >> 2 ] = d ; e = a + 8 | 0 ; a = b + 12 | 0 ; d = f [ e >> 2 ] | 0 ; f [ e >> 2 ] = f [ a >> 2 ]; f [ a >> 2 ] = d ; f [ b >> 2 ] = f [ c >> 2 ]; return } function js ( a ){ a = a | 0 ; var b = 0 , c = 0 , e = 0 ; c = f [ a + 4 >> 2 ] | 0 ; e = a + 8 | 0 ; b = f [ e >> 2 ] | 0 ; if (( b | 0 ) != ( c | 0 )){ do b = b +- 4 | 0 ; while (( b | 0 ) != ( c | 0 )); f [ e >> 2 ] = b } c = f [ a >> 2 ] | 0 ; do if ( c ){ b = f [ a + 16 >> 2 ] | 0 ; if (( b | 0 ) == ( c | 0 )){ d [ b + 112 >> 0 ] = 0 ; break } else { Ju ( c ); break }} while ( 0 ); return } function ks ( a , b ){ a = a | 0 ; b = b | 0 ; var c = 0 ; if ( b >>> 0 > 1073741823 ) Gu ( a ); c = a + 128 | 0 ; if ( b >>> 0 < 29 & ( d [ c >> 0 ] | 0 ) == 0 ){ d [ c >> 0 ] = 1 ; c = a + 16 | 0 } else c = Iu ( b << 2 ) | 0 ; f [ a + 4 >> 2 ] = c ; f [ a >> 2 ] = c ; f [ a + 8 >> 2 ] = c + ( b << 2 ); return } function ls ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var d = 0.0 , e = 0 , g = 0 , h = 0 , i = 0 ; i = l ; l = l + 16 | 0 ; h = i ; do if (( a | 0 ) != ( b | 0 )){ e = Jv () | 0 ; g = f [ e >> 2 ] | 0 ; f [ e >> 2 ] = 0 ; d =+ Nw ( a , h , Uo () | 0 ); a = f [ e >> 2 ] | 0 ; if ( ! a ) f [ e >> 2 ] = g ; if (( f [ h >> 2 ] | 0 ) != ( b | 0 )){ f [ c >> 2 ] = 4 ; d = 0.0 ; break } if (( a | 0 ) == 34 ) f [ c >> 2 ] = 4 } else { f [ c >> 2 ] = 4 ; d = 0.0 } while ( 0 ); l = i ; return + d } function ms ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var d = 0.0 , e = 0 , g = 0 , h = 0 , i = 0 ; i = l ; l = l + 16 | 0 ; h = i ; do if (( a | 0 ) != ( b | 0 )){ e = Jv () | 0 ; g = f [ e >> 2 ] | 0 ; f [ e >> 2 ] = 0 ; d =+ Nw ( a , h , Uo () | 0 ); a = f [ e >> 2 ] | 0 ; if ( ! a ) f [ e >> 2 ] = g ; if (( f [ h >> 2 ] | 0 ) != ( b | 0 )){ f [ c >> 2 ] = 4 ; d = 0.0 ; break } if (( a | 0 ) == 34 ) f [ c >> 2 ] = 4 } else { f [ c >> 2 ] = 4 ; d = 0.0 } while ( 0 ); l = i ; return + d } function ns ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var d = 0.0 , e = 0 , g = 0 , h = 0 , i = 0 ; i = l ; l = l + 16 | 0 ; h = i ; do if (( a | 0 ) == ( b | 0 )){ f [ c >> 2 ] = 4 ; d = 0.0 } else { e = Jv () | 0 ; g = f [ e >> 2 ] | 0 ; f [ e >> 2 ] = 0 ; d =+ Nw ( a , h , Uo () | 0 ); a = f [ e >> 2 ] | 0 ; if ( ! a ) f [ e >> 2 ] = g ; if (( f [ h >> 2 ] | 0 ) != ( b | 0 )){ f [ c >> 2 ] = 4 ; d = 0.0 ; break } if (( a | 0 ) == 34 ) f [ c >> 2 ] = 4 } while ( 0 ); l = i ; return + d } function os ( a , b , c , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; var g = 0 , h = 0 , i = 0 , j = 0 ; j = l ; l = l + 16 | 0 ; i = j ; do if (( a | 0 ) != ( b | 0 )){ if (( d [ a >> 0 ] | 0 ) == 45 ){ f [ c >> 2 ] = 4 ; e = 0 ; a = 0 ; break } g = Jv () | 0 ; h = f [ g >> 2 ] | 0 ; f [ g >> 2 ] = 0 ; a = Cv ( a , i , e , Uo () | 0 ) | 0 ; e = f [ g >> 2 ] | 0 ; if ( ! e ) f [ g >> 2 ] = h ; if (( f [ i >> 2 ] | 0 ) != ( b | 0 )){ f [ c >> 2 ] = 4 ; e = 0 ; a = 0 ; break } if (( e | 0 ) == 34 ){ f [ c >> 2 ] = 4 ; e =- 1 ; a =- 1 } else e = G } else { f [ c >> 2 ] = 4 ; e = 0 ; a = 0 } while ( 0 ); G = e ; l = j ; return a | 0 } function ps ( a , b , c , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; var g = 0 , h = 0 , i = 0 , j = 0 , k = 0 ; k = l ; l = l + 16 | 0 ; j = k ; do if (( a | 0 ) != ( b | 0 )){ if (( d [ a >> 0 ] | 0 ) == 45 ){ f [ c >> 2 ] = 4 ; a = 0 ; break } h = Jv () | 0 ; i = f [ h >> 2 ] | 0 ; f [ h >> 2 ] = 0 ; a = Cv ( a , j , e , Uo () | 0 ) | 0 ; e = G ; g = f [ h >> 2 ] | 0 ; if ( ! g ) f [ h >> 2 ] = i ; if (( f [ j >> 2 ] | 0 ) != ( b | 0 )){ f [ c >> 2 ] = 4 ; a = 0 ; break } if ( e >>> 0 > 0 | ( e | 0 ) == 0 & a >>> 0 > 4294967295 | ( g | 0 ) == 34 ){ f [ c >> 2 ] = 4 ; a =- 1 ; break } else break } else { f [ c >> 2 ] = 4 ; a = 0 } while ( 0 ); l = k ; return a | 0 } function qs ( a , b , c , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; var g = 0 , h = 0 , i = 0 , j = 0 , k = 0 ; k = l ; l = l + 16 | 0 ; j = k ; do if (( a | 0 ) != ( b | 0 )){ if (( d [ a >> 0 ] | 0 ) == 45 ){ f [ c >> 2 ] = 4 ; a = 0 ; break } h = Jv () | 0 ; i = f [ h >> 2 ] | 0 ; f [ h >> 2 ] = 0 ; a = Cv ( a , j , e , Uo () | 0 ) | 0 ; e = G ; g = f [ h >> 2 ] | 0 ; if ( ! g ) f [ h >> 2 ] = i ; if (( f [ j >> 2 ] | 0 ) != ( b | 0 )){ f [ c >> 2 ] = 4 ; a = 0 ; break } if ( e >>> 0 > 0 | ( e | 0 ) == 0 & a >>> 0 > 4294967295 | ( g | 0 ) == 34 ){ f [ c >> 2 ] = 4 ; a =- 1 ; break } else break } else { f [ c >> 2 ] = 4 ; a = 0 } while ( 0 ); l = k ; return a | 0 } function rs ( a , b , c , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; var g = 0 , h = 0 , i = 0 , j = 0 , k = 0 ; k = l ; l = l + 16 | 0 ; j = k ; do if (( a | 0 ) != ( b | 0 )){ if (( d [ a >> 0 ] | 0 ) == 45 ){ f [ c >> 2 ] = 4 ; a = 0 ; break } h = Jv () | 0 ; i = f [ h >> 2 ] | 0 ; f [ h >> 2 ] = 0 ; a = Cv ( a , j , e , Uo () | 0 ) | 0 ; e = G ; g = f [ h >> 2 ] | 0 ; if ( ! g ) f [ h >> 2 ] = i ; if (( f [ j >> 2 ] | 0 ) != ( b | 0 )){ f [ c >> 2 ] = 4 ; a = 0 ; break } if ( e >>> 0 > 0 | ( e | 0 ) == 0 & a >>> 0 > 65535 | ( g | 0 ) == 34 ){ f [ c >> 2 ] = 4 ; a =- 1 ; break } else { a = a & 65535 ; break }} else { f [ c >> 2 ] = 4 ; a = 0 } while ( 0 ); l = k ; return a | 0 } function ss ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; var e = 0 , g = 0 , h = 0 , i = 0 , j = 0 ; j = l ; l = l + 16 | 0 ; i = j ; do if (( a | 0 ) != ( b | 0 )){ g = Jv () | 0 ; h = f [ g >> 2 ] | 0 ; f [ g >> 2 ] = 0 ; a = Dv ( a , i , d , Uo () | 0 ) | 0 ; d = G ; e = f [ g >> 2 ] | 0 ; if ( ! e ) f [ g >> 2 ] = h ; if (( f [ i >> 2 ] | 0 ) != ( b | 0 )){ f [ c >> 2 ] = 4 ; d = 0 ; a = 0 ; break } if (( e | 0 ) == 34 ){ f [ c >> 2 ] = 4 ; i = ( d | 0 ) > 0 | ( d | 0 ) == 0 & a >>> 0 > 0 ; G = i ? 2147483647 :- 2147483648 ; l = j ; return ( i ?- 1 : 0 ) | 0 }} else { f [ c >> 2 ] = 4 ; d = 0 ; a = 0 } while ( 0 ); G = d ; l = j ; return a | 0 } function ts ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; var e = 0 , g = 0 , h = 0 , i = 0 , j = 0 ; j = l ; l = l + 16 | 0 ; i = j ; a : do if (( a | 0 ) == ( b | 0 )){ f [ c >> 2 ] = 4 ; a = 0 } else { g = Jv () | 0 ; h = f [ g >> 2 ] | 0 ; f [ g >> 2 ] = 0 ; a = Dv ( a , i , d , Uo () | 0 ) | 0 ; d = G ; e = f [ g >> 2 ] | 0 ; if ( ! e ) f [ g >> 2 ] = h ; if (( f [ i >> 2 ] | 0 ) != ( b | 0 )){ f [ c >> 2 ] = 4 ; a = 0 ; break } do if (( e | 0 ) == 34 ){ f [ c
o = r , r = 0 , ! ( o & 1 )) : 0 ){ o = a + 16 | 0 ; n = f [ o >> 2 ] & 255 ; b = f [ x >> 2 ] | 0 ; g = f [ p >> 2 ] | 0 ; if ( b >>> 0 >= g >>> 0 ){ h = f [ w >> 2 ] | 0 ; e = h ; i = b - e + 1 | 0 ; if (( i | 0 ) < 0 ){ r = 0 ; ka ( 178 , w | 0 ); m = r ; r = 0 ; if ( m & 1 ){ v = 43 ; break } h = f [ w >> 2 ] | 0 ; e = h ; g = f [ p >> 2 ] | 0 } m = h ; b = g - m | 0 ; if ( b >>> 0 < 1073741823 ){ b = b << 1 ; b = b >>> 0 < i >>> 0 ? i : b ; i = f [ x >> 2 ] | 0 ; j = i - m | 0 ; if ( ! b ){ k = 0 ; g = 0 } else v = 23 } else { j = f [ x >> 2 ] | 0 ; b = 2147483647 ; i = j ; j = j - m | 0 ; v = 23 } if (( v | 0 ) == 23 ){ r = 0 ; g = na ( 67 , b | 0 ) | 0 ; k = r ; r = 0 ; if ( k & 1 ){ v = 43 ; break } else k = b } d [ g + j >> 0 ] = n ; b = g + ( j + 1 ) | 0 ; m = i - m | 0 ; n = g + ( j - m ) | 0 ; zs ( n | 0 , h | 0 , m | 0 ) | 0 ; f [ w >> 2 ] = n ; f [ x >> 2 ] = b ; f [ p >> 2 ] = g + k ; if ( e ){ Ju ( e ); b = f [ x >> 2 ] | 0 }} else { d [ b >> 0 ] = n ; b = ( f [ x >> 2 ] | 0 ) + 1 | 0 ; f [ x >> 2 ] = b } n = a + 20 | 0 ; m = f [ n >> 2 ] & 255 ; e = f [ p >> 2 ] | 0 ; if ( b >>> 0 >= e >>> 0 ){ g = f [ w >> 2 ] | 0 ; h = g ; i = b - h + 1 | 0 ; if (( i | 0 ) < 0 ){ r = 0 ; ka ( 178 , w | 0 ); k = r ; r = 0 ; if ( k & 1 ){ v = 43 ; break } h = f [ w >> 2 ] | 0 ; e = f [ p >> 2 ] | 0 ; g = h } k = g ; b = e - k | 0 ; if ( b >>> 0 < 1073741823 ){ b = b << 1 ; b = b >>> 0 < i >>> 0 ? i : b ; e = f [ x >> 2 ] | 0 ; j = e - k | 0 ; if ( ! b ){ b = 0 ; i = 0 } else v = 34 } else { j = f [ x >> 2 ] | 0 ; b = 2147483647 ; e = j ; j = j - k | 0 ; v = 34 } if (( v | 0 ) == 34 ){ r = 0 ; i = na ( 67 , b | 0 ) | 0 ; y = r ; r = 0 ; if ( y & 1 ){ v = 43 ; break }} d [ i + j >> 0 ] = m ; m = e - k | 0 ; y = i + ( j - m ) | 0 ; zs ( y | 0 , g | 0 , m | 0 ) | 0 ; f [ w >> 2 ] = y ; f [ x >> 2 ] = i + ( j + 1 ); f [ p >> 2 ] = i + b ; if ( h ) Ju ( h )} else { d [ b >> 0 ] = m ; f [ x >> 2 ] = ( f [ x >> 2 ] | 0 ) + 1 } b = f [ o >> 2 ] | 0 ; do if (( b | 0 ) > 0 ){ if ( ! ( f [ a + 24 >> 2 ] | 0 )){ f [ s >> 2 ] = f [ x >> 2 ]; y = 0 + ( ca ( b * 3 | 0 , f [ n >> 2 ] | 0 ) | 0 ) | 0 ; r = 0 ; f [ q >> 2 ] = f [ s >> 2 ]; ya ( 15 , w | 0 , q | 0 , 0 , y | 0 ) | 0 ; y = r ; r = 0 ; if ( y & 1 ){ v = 43 ; break a } else break } e = Pa ( 16 ) | 0 ; r = 0 ; za ( 5 , t | 0 , 50792 , 57 ); y = r ; r = 0 ; if ( ! ( y & 1 )){ r = 0 ; b = xa ( 1 ) | 0 ; y = r ; r = 0 ; if ( ! ( y & 1 ) ? ( r = 0 , Da ( 36 , e | 0 , 1 , b | 0 , t | 0 ), y = r , r = 0 , ! ( y & 1 )) : 0 ){ r = 0 ; za ( 6 , e | 0 , 824 , 96 ); r = 0 ; c = 0 } else c = 1 ; b = Qa () | 0 ; Fm ( t ); if ( ! c ){ c = b ; break a }} else b = Qa () | 0 ; Oa ( e | 0 ); c = b ; break a } while ( 0 ); r = 0 ; j = na ( 67 , 20 ) | 0 ; y = r ; r = 0 ; if ( ! ( y & 1 )){ f [ j >> 2 ] = 36800 ; d [ j + 4 >> 0 ] =- 32 ; h = j + 8 | 0 ; f [ h >> 2 ] = 0 ; i = j + 12 | 0 ; f [ i >> 2 ] = 0 ; e = j + 16 | 0 ; f [ e >> 2 ] = 0 ; b = f [ x >> 2 ] | 0 ; y = f [ w >> 2 ] | 0 ; g = b - y | 0 ; do if (( b | 0 ) != ( y | 0 )){ if ( ! (( g | 0 ) < 0 ? ( r = 0 , ka ( 178 , h | 0 ), y = r , r = 0 , y & 1 ) : 0 )) v = 53 ; if (( v | 0 ) == 53 ? ( r = 0 , c = na ( 67 , g | 0 ) | 0 , y = r , r = 0 , ! ( y & 1 )) : 0 ){ f [ i >> 2 ] = c ; f [ h >> 2 ] = c ; f [ e >> 2 ] = c + g ; b = f [ w >> 2 ] | 0 ; e = f [ x >> 2 ] | 0 ; if (( b | 0 ) == ( e | 0 )) break ; do { d [ c >> 0 ] = d [ b >> 0 ] | 0 ; c = ( f [ i >> 2 ] | 0 ) + 1 | 0 ; f [ i >> 2 ] = c ; b = b + 1 | 0 } while (( b | 0 ) != ( e | 0 )); b = f [ w >> 2 ] | 0 ; break } b = Qa () | 0 ; c = f [ h >> 2 ] | 0 ; if ( c ){ if (( f [ i >> 2 ] | 0 ) != ( c | 0 )) f [ i >> 2 ] = c ; Ju ( c )} Ju ( j ); v = 44 ; break a } while ( 0 ); if ( ! b ){ l = u ; return j | 0 } if (( f [ x >> 2 ] | 0 ) != ( b | 0 )) f [ x >> 2 ] = b ; Ju ( b ); l = u ; return j | 0 } else v = 43 } else v = 43 } else v = 43 ; while ( 0 ); if (( v | 0 ) == 43 ){ b = Qa () | 0 ; v = 44 } if (( v | 0 ) == 44 ) c = b ; b = f [ w >> 2 ] | 0 ; if ( ! b ) _a ( c | 0 ); if (( f [ x >> 2 ] | 0 ) != ( b | 0 )) f [ x >> 2 ] = b ; Ju ( b ); _a ( c | 0 ); return 0 } function au ( a ){ a = a | 0 ; var b = 0 , c = 0 , e = 0 , g = 0 , h = 0 , i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 ; j = l ; l = l + 16 | 0 ; m = j ; f [ m >> 2 ] = 0 ; n = m + 4 | 0 ; f [ n >> 2 ] = 0 ; f [ m + 8 >> 2 ] = 0 ; r = 0 ; b = na ( 67 , 1 ) | 0 ; i = r ; r = 0 ; a : do if (((((( ! ( i & 1 ) ? ( i = b + 1 | 0 , d [ b >> 0 ] = 1 , f [ m >> 2 ] = b , f [ n >> 2 ] = i , f [ m + 8 >> 2 ] = i , r = 0 , la ( 84 , m | 0 , f [ a >> 2 ] & 65535 | 0 ), i = r , r = 0 , ! ( i & 1 )) : 0 ) ? ( r = 0 , la ( 84 , m | 0 , f [ a + 4 >> 2 ] & 65535 | 0 ), i = r , r = 0 , ! ( i & 1 )) : 0 ) ? ( r = 0 , la ( 84 , m | 0 , f [ a + 8 >> 2 ] & 65535 | 0 ), i = r , r = 0 , ! ( i & 1 )) : 0 ) ? ( r = 0 , la ( 84 , m | 0 , f [ a + 12 >> 2 ] & 65535 | 0 ), i = r , r = 0 , ! ( i & 1 )) : 0 ) ? ( r = 0 , la ( 84 , m | 0 , f [ a + 16 >> 2 ] & 65535 | 0 ), i = r , r = 0 , ! ( i & 1 )) : 0 ) ? ( r = 0 , k = na ( 67 , 20 ) | 0 , i = r , r = 0 , ! ( i & 1 )) : 0 ){ f [ k >> 2 ] = 36800 ; d [ k + 4 >> 0 ] =- 8 ; g = k + 8 | 0 ; f [ g >> 2 ] = 0 ; i = k + 12 | 0 ; f [ i >> 2 ] = 0 ; a = k + 16 | 0 ; f [ a >> 2 ] = 0 ; b = f [ n >> 2 ] | 0 ; o = f [ m >> 2 ] | 0 ; e = b - o | 0 ; do if (( b | 0 ) != ( o | 0 )){ if ( ! (( e | 0 ) < 0 ? ( r = 0 , ka ( 178 , g | 0 ), o = r , r = 0 , o & 1 ) : 0 )) h = 11 ; if (( h | 0 ) == 11 ? ( r = 0 , c = na ( 67 , e | 0 ) | 0 , o = r , r = 0 , ! ( o & 1 )) : 0 ){ f [ i >> 2 ] = c ; f [ g >> 2 ] = c ; f [ a >> 2 ] = c + e ; b = f [ m >> 2 ] | 0 ; a = f [ n >> 2 ] | 0 ; if (( b | 0 ) == ( a | 0 )) break ; do { d [ c >> 0 ] = d [ b >> 0 ] | 0 ; c = ( f [ i >> 2 ] | 0 ) + 1 | 0 ; f [ i >> 2 ] = c ; b = b + 1 | 0 } while (( b | 0 ) != ( a | 0 )); b = f [ m >> 2 ] | 0 ; break } c = Qa () | 0 ; b = f [ g >> 2 ] | 0 ; if ( b ){ if (( f [ i >> 2 ] | 0 ) != ( b | 0 )) f [ i >> 2 ] = b ; Ju ( b )} Ju ( k ); break a } while ( 0 ); if ( ! b ){ l = j ; return k | 0 } if (( f [ n >> 2 ] | 0 ) != ( b | 0 )) f [ n >> 2 ] = b ; Ju ( b ); l = j ; return k | 0 } else h = 25 ; while ( 0 ); if (( h | 0 ) == 25 ) c = Qa () | 0 ; b = f [ m >> 2 ] | 0 ; if ( ! b ) _a ( c | 0 ); if (( f [ n >> 2 ] | 0 ) != ( b | 0 )) f [ n >> 2 ] = b ; Ju ( b ); _a ( c | 0 ); return 0 } function bu ( a ){ a = a | 0 ; var b = 0 , c = 0 , e = 0 , g = 0 , h = 0 , i = 0 ; h = Iu ( 5 ) | 0 ; d [ h >> 0 ] = 109 ; d [ h + 1 >> 0 ] = 114 ; d [ h + 2 >> 0 ] = 102 ; d [ h + 3 >> 0 ] = 120 ; d [ h + 4 >> 0 ] = a ; r = 0 ; g = na ( 67 , 20 ) | 0 ; e = r ; r = 0 ; if ( e & 1 ){ g = Qa () | 0 ; Ju ( h ); _a ( g | 0 )} f [ g >> 2 ] = 36800 ; d [ g + 4 >> 0 ] =- 24 ; a = g + 8 | 0 ; f [ a >> 2 ] = 0 ; b = g + 12 | 0 ; f [ b >> 2 ] = 0 ; c = g + 16 | 0 ; f [ c >> 2 ] = 0 ; r = 0 ; e = na ( 67 , 5 ) | 0 ; i = r ; r = 0 ; if ( ! ( i & 1 )){ f [ b >> 2 ] = e ; f [ a >> 2 ] = e ; f [ c >> 2 ] = e + 5 ; d [ e >> 0 ] = 109 ; i = ( f [ b >> 2 ] | 0 ) + 1 | 0 ; f [ b >> 2 ] = i ; e = h + 1 | 0 ; d [ i >> 0 ] = d [ e >> 0 ] | 0 ; i = ( f [ b >> 2 ] | 0 ) + 1 | 0 ; f [ b >> 2 ] = i ; e = e + 1 | 0 ; d [ i >> 0 ] = d [ e >> 0 ] | 0 ; i = ( f [ b >> 2 ] | 0 ) + 1 | 0 ; f [ b >> 2 ] = i ; e = e + 1 | 0 ; d [ i >> 0 ] = d [ e >> 0 ] | 0 ; i = ( f [ b >> 2 ] | 0 ) + 1 | 0 ; f [ b >> 2 ] = i ; d [ i >> 0 ] = d [ e + 1 >> 0 ] | 0 ; f [ b >> 2 ] = ( f [ b >> 2 ] | 0 ) + 1 ; Ju ( h ); return
( f [ i >> 2 ] | 0 ) != ( c | 0 )) : 0 ){ f [ b + 32 >> 2 ] = e ; e = b + 44 | 0 ; if (( f [ e >> 2 ] | 0 ) == 4 ) break ; h = b + 52 | 0 ; d [ h >> 0 ] = 0 ; k = b + 53 | 0 ; d [ k >> 0 ] = 0 ; a = f [ a + 8 >> 2 ] | 0 ; mx [ f [( f [ a >> 2 ] | 0 ) + 20 >> 2 ] & 15 ]( a , b , c , c , 1 , g ); if ( d [ k >> 0 ] | 0 ){ if ( ! ( d [ h >> 0 ] | 0 )){ h = 1 ; j = 13 }} else { h = 0 ; j = 13 } do if (( j | 0 ) == 13 ){ f [ i >> 2 ] = c ; k = b + 40 | 0 ; f [ k >> 2 ] = ( f [ k >> 2 ] | 0 ) + 1 ; if (( f [ b + 36 >> 2 ] | 0 ) == 1 ? ( f [ b + 24 >> 2 ] | 0 ) == 2 : 0 ){ d [ b + 54 >> 0 ] = 1 ; if ( h ) break } else j = 16 ; if (( j | 0 ) == 16 ? h : 0 ) break ; f [ e >> 2 ] = 4 ; break a } while ( 0 ); f [ e >> 2 ] = 3 ; break } if (( e | 0 ) == 1 ) f [ b + 32 >> 2 ] = 1 } while ( 0 ); return } function rv ( a , b , c , e , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; g = g | 0 ; var h = 0 , i = 0 ; do if (( a | 0 ) == ( f [ b + 8 >> 2 ] | 0 )){ if (( f [ b + 4 >> 2 ] | 0 ) == ( c | 0 ) ? ( i = b + 28 | 0 ,( f [ i >> 2 ] | 0 ) != 1 ) : 0 ) f [ i >> 2 ] = e } else if (( a | 0 ) == ( f [ b >> 2 ] | 0 )){ if (( f [ b + 16 >> 2 ] | 0 ) != ( c | 0 ) ? ( h = b + 20 | 0 ,( f [ h >> 2 ] | 0 ) != ( c | 0 )) : 0 ){ f [ b + 32 >> 2 ] = e ; f [ h >> 2 ] = c ; g = b + 40 | 0 ; f [ g >> 2 ] = ( f [ g >> 2 ] | 0 ) + 1 ; if (( f [ b + 36 >> 2 ] | 0 ) == 1 ? ( f [ b + 24 >> 2 ] | 0 ) == 2 : 0 ) d [ b + 54 >> 0 ] = 1 ; f [ b + 44 >> 2 ] = 4 ; break } if (( e | 0 ) == 1 ) f [ b + 32 >> 2 ] = 1 } while ( 0 ); return } function sv ( a , b , c , e , g , h ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; g = g | 0 ; h = h | 0 ; var i = 0 , j = 0 , k = 0 , l = 0 , m = 0 , n = 0 , o = 0 , p = 0 ; if (( a | 0 ) == ( f [ b + 8 >> 2 ] | 0 )) mv ( 0 , b , c , e , g ); else { m = b + 52 | 0 ; n = d [ m >> 0 ] | 0 ; o = b + 53 | 0 ; p = d [ o >> 0 ] | 0 ; l = f [ a + 12 >> 2 ] | 0 ; i = a + 16 + ( l << 3 ) | 0 ; d [ m >> 0 ] = 0 ; d [ o >> 0 ] = 0 ; ov ( a + 16 | 0 , b , c , e , g , h ); a : do if (( l | 0 ) > 1 ){ j = b + 24 | 0 ; k = a + 8 | 0 ; l = b + 54 | 0 ; a = a + 24 | 0 ; do { if ( d [ l >> 0 ] | 0 ) break a ; if ( ! ( d [ m >> 0 ] | 0 )){ if (( d [ o >> 0 ] | 0 ) != 0 ? ( f [ k >> 2 ] & 1 | 0 ) == 0 : 0 ) break a } else { if (( f [ j >> 2 ] | 0 ) == 1 ) break a ; if ( ! ( f [ k >> 2 ] & 2 )) break a } d [ m >> 0 ] = 0 ; d [ o >> 0 ] = 0 ; ov ( a , b , c , e , g , h ); a = a + 8 | 0 } while ( a >>> 0 < i >>> 0 )} while ( 0 ); d [ m >> 0 ] = n ; d [ o >> 0 ] = p } return } function tv ( a , b , c , d , e , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; g = g | 0 ; if (( a | 0 ) == ( f [ b + 8 >> 2 ] | 0 )) mv ( 0 , b , c , d , e ); else { a = f [ a + 8 >> 2 ] | 0 ; mx [ f [( f [ a >> 2 ] | 0 ) + 20 >> 2 ] & 15 ]( a , b , c , d , e , g )} return } function uv ( a , b , c , d , e , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; g = g | 0 ; if (( a | 0 ) == ( f [ b + 8 >> 2 ] | 0 )) mv ( 0 , b , c , d , e ); return } function vv ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var d = 0 , e = 0 ; e = l ; l = l + 16 | 0 ; d = e ; f [ d >> 2 ] = f [ c >> 2 ]; a = kx [ f [( f [ a >> 2 ] | 0 ) + 16 >> 2 ] & 63 ]( a , b , d ) | 0 ; if ( a ) f [ c >> 2 ] = f [ d >> 2 ]; l = e ; return a & 1 | 0 } function wv ( a ){ a = a | 0 ; if ( ! a ) a = 0 ; else a = ( lv ( a , 656 , 704 , 0 ) | 0 ) != 0 ; return a & 1 | 0 } function xv (){ var a = 0 ; a = Pa ( 4 ) | 0 ; Lu ( a ); ob ( a | 0 , 592 , 78 )} function yv (){ var a = 0 , b = 0 , c = 0 , d = 0 , e = 0 , g = 0 , h = 0 , i = 0 ; e = l ; l = l + 48 | 0 ; h = e + 32 | 0 ; c = e + 24 | 0 ; i = e + 16 | 0 ; g = e ; e = e + 36 | 0 ; a = Hu () | 0 ; if (( a | 0 ) != 0 ? ( d = f [ a >> 2 ] | 0 ,( d | 0 ) != 0 ) : 0 ){ a = d + 48 | 0 ; b = f [ a >> 2 ] | 0 ; a = f [ a + 4 >> 2 ] | 0 ; if ( ! (( b &- 256 | 0 ) == 1126902528 & ( a | 0 ) == 1129074247 )){ f [ c >> 2 ] = f [ 9257 ]; Eu ( 51919 , c )} if (( b | 0 ) == 1126902529 & ( a | 0 ) == 1129074247 ) a = f [ d + 44 >> 2 ] | 0 ; else a = d + 80 | 0 ; f [ e >> 2 ] = a ; d = f [ d >> 2 ] | 0 ; a = f [ d + 4 >> 2 ] | 0 ; if ( kx [ f [( f [ 608 >> 2 ] | 0 ) + 16 >> 2 ] & 63 ]( 608 , d , e ) | 0 ){ i = f [ e >> 2 ] | 0 ; e = f [ 9257 ] | 0 ; i = ix [ f [( f [ i >> 2 ] | 0 ) + 8 >> 2 ] & 127 ]( i ) | 0 ; f [ g >> 2 ] = e ; f [ g + 4 >> 2 ] = a ; f [ g + 8 >> 2 ] = i ; Eu ( 51833 , g )} else { f [ i >> 2 ] = f [ 9257 ]; f [ i + 4 >> 2 ] = a ; Eu ( 51878 , i )}} Eu ( 51957 , h )} function zv (){ var a = 0 ; a = l ; l = l + 16 | 0 ; if ( ! ( Ia ( 37020 , 184 ) | 0 )){ l = a ; return } else Eu ( 51730 , a )} function Av ( a ){ a = a | 0 ; var b = 0 , c = 0 ; c = ( f [ a >> 2 ] | 0 ) +- 4 | 0 ; b = f [ c >> 2 ] | 0 ; f [ c >> 2 ] = b +- 1 ; if (( b +- 1 | 0 ) < 0 ) Ju (( f [ a >> 2 ] | 0 ) +- 12 | 0 ); return } function Bv ( a ){ a = a | 0 ; var b = 0 ; b = l ; l = l + 16 | 0 ; Dl ( a ); if ( ! ( mb ( f [ 9255 ] | 0 , 0 ) | 0 )){ l = b ; return } else Eu ( 51780 , b )} function Cv ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; a = Ow ( a , b , c ) | 0 ; return a | 0 } function Dv ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; a = Pw ( a , b , c ) | 0 ; return a | 0 } function Ev (){ return 37296 } function Fv (){ return 37300 } function Gv (){ return 37304 } function Hv ( a ){ a = a | 0 ; return (( a | 0 ) == 32 | ( a +- 9 | 0 ) >>> 0 < 5 ) & 1 | 0 } function Iv ( a ){ a = a | 0 ; if (( a +- 48 | 0 ) >>> 0 < 10 ) a = 1 ; else a = (( a | 32 ) +- 97 | 0 ) >>> 0 < 6 ; return a & 1 | 0 } function Jv (){ var a = 0 ; if ( ! ( f [ 9258 ] | 0 )) a = 37308 ; else a = f [( eb () | 0 ) + 60 >> 2 ] | 0 ; return a | 0 } function Kv ( a ){ a = a | 0 ; var b = 0 , c = 0 ; b = 0 ; while ( 1 ){ if (( g [ 51978 + b >> 0 ] | 0 ) == ( a | 0 )){ c = 2 ; break } b = b + 1 | 0 ; if (( b | 0 ) == 87 ){ b = 87 ; a = 52066 ; c = 5 ; break }} if (( c | 0 ) == 2 ) if ( ! b ) a = 52066 ; else { a = 52066 ; c = 5 } if (( c | 0 ) == 5 ) while ( 1 ){ c = a ; while ( 1 ){ a = c + 1 | 0 ; if ( ! ( d [ c >> 0 ] | 0 )) break ; else c = a } b = b +- 1 | 0 ; if ( ! b ) break ; else c = 5 } return a | 0 } function Lv ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var e = 0.0 , h = 0 , i = 0.0 , j = 0 , k = 0 , m = 0.0 , n = 0 , o = 0 , p = 0 , q = 0.0 , r = 0.0 , s = 0 , t = 0 , u = 0 , x = 0 , y = 0 , z = 0 , A = 0 , B = 0 , C = 0 , D = 0 , E = 0 , F = 0 , H = 0 , I = 0 , J = 0 , K = 0 , L = 0 , M = 0.0 ; L = l ; l = l + 512 | 0 ; H = L ; switch ( b | 0 ){ case 0 : { K = 24 ; J =- 149 ; A = 4 ; break } case 1 : { K = 53 ; J =- 1074 ; A = 4 ; break } case 2 : { K = 53 ; J =- 1074 ; A = 4 ; break } default : e = 0.0 } a : do if (( A | 0 ) == 4 ){ D = a + 4 | 0 ; C = a + 100 | 0 ; do { b = f [ D >> 2 ] | 0 ; if ( b >>> 0 < ( f [ C >> 2 ] | 0 ) >>> 0 ){ f [ D >> 2 ] = b + 1 ; b = g [ b >> 0 ] | 0 } else b = Ov ( a ) | 0 } while (( Hv ( b ) | 0 ) != 0 ); b : do switch ( b | 0 ){ case 43 : case 45 : { h = 1 - ((( b | 0 ) == 45 & 1 ) << 1 ) | 0 ; b = f [ D >>
f [ b >> 2 ] = c + 1 ; b = g [ c >> 0 ] | 0 } else b = zw ( a ) | 0 } else d = 3 ; do if (( d | 0 ) == 3 ){ b = a + 4 | 0 ; c = f [ b >> 2 ] | 0 ; if ( c >>> 0 < ( f [ a + 8 >> 2 ] | 0 ) >>> 0 ){ f [ b >> 2 ] = c + 1 ; b = g [ c >> 0 ] | 0 ; break } else { b = zw ( a ) | 0 ; break }} while ( 0 ); return b | 0 } function Fw ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; var e = 0 , g = 0 ; e = l ; l = l + 16 | 0 ; g = e ; f [ g >> 2 ] = d ; d = Lw ( a , b , c , g ) | 0 ; l = e ; return d | 0 } function Gw ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var d = 0 , e = 0 ; d = l ; l = l + 16 | 0 ; e = d ; f [ e >> 2 ] = c ; c = Mw ( a , b , e ) | 0 ; l = d ; return c | 0 } function Hw ( a , b ){ a = a | 0 ; b = b | 0 ; var c = 0 , e = 0 , g = 0 , h = 0 ; do if (( a | 0 ) !=- 1 ){ if (( f [ b + 76 >> 2 ] | 0 ) >- 1 ) g = ow ( b ) | 0 ; else g = 0 ; if ( ! (( f [ b + 8 >> 2 ] | 0 ) == 0 ? ( xw ( b ) | 0 ) != 0 : 0 )) h = 6 ; if (( h | 0 ) == 6 ? ( c = b + 4 | 0 , e = f [ c >> 2 ] | 0 , e >>> 0 > (( f [ b + 44 >> 2 ] | 0 ) +- 8 | 0 ) >>> 0 ) : 0 ){ h = e +- 1 | 0 ; f [ c >> 2 ] = h ; d [ h >> 0 ] = a ; f [ b >> 2 ] = f [ b >> 2 ] &- 17 ; if ( ! g ) break ; pw ( b ); break } if ( g ){ pw ( b ); a =- 1 } else a =- 1 } else a =- 1 ; while ( 0 ); return a | 0 } function Iw ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var d = 0 , e = 0 , g = 0 , h = 0 , i = 0 ; i = l ; l = l + 16 | 0 ; d = i ; e = Cl ( 240 ) | 0 ; do if ( e ){ f [ d >> 2 ] = f [ c >> 2 ]; d = Lw ( e , 240 , b , d ) | 0 ; if ( d >>> 0 < 240 ){ b = Fl ( e , d + 1 | 0 ) | 0 ; f [ a >> 2 ] = ( b | 0 ) != 0 ? b : e ; break } Dl ( e ); if (( d | 0 ) >= 0 ? ( h = d + 1 | 0 , g = Cl ( h ) | 0 , f [ a >> 2 ] = g ,( g | 0 ) != 0 ) : 0 ) d = Lw ( g , h , b , c ) | 0 ; else d =- 1 } else d =- 1 ; while ( 0 ); l = i ; return d | 0 } function Jw ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var e = 0 , g = 0 , h = 0 , i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , r = 0 , s = 0 ; s = l ; l = l + 224 | 0 ; o = s + 80 | 0 ; r = s + 96 | 0 ; q = s ; p = s + 136 | 0 ; e = r ; g = e + 40 | 0 ; do { f [ e >> 2 ] = 0 ; e = e + 4 | 0 } while (( e | 0 ) < ( g | 0 )); f [ o >> 2 ] = f [ c >> 2 ]; if (( ul ( 0 , b , o , q , r ) | 0 ) < 0 ) c =- 1 ; else { if (( f [ a + 76 >> 2 ] | 0 ) >- 1 ) m = ow ( a ) | 0 ; else m = 0 ; c = f [ a >> 2 ] | 0 ; n = c & 32 ; if (( d [ a + 74 >> 0 ] | 0 ) < 1 ) f [ a >> 2 ] = c &- 33 ; c = a + 48 | 0 ; if ( ! ( f [ c >> 2 ] | 0 )){ g = a + 44 | 0 ; h = f [ g >> 2 ] | 0 ; f [ g >> 2 ] = p ; i = a + 28 | 0 ; f [ i >> 2 ] = p ; j = a + 20 | 0 ; f [ j >> 2 ] = p ; f [ c >> 2 ] = 80 ; k = a + 16 | 0 ; f [ k >> 2 ] = p + 80 ; e = ul ( a , b , o , q , r ) | 0 ; if ( h ){ kx [ f [ a + 36 >> 2 ] & 63 ]( a , 0 , 0 ) | 0 ; e = ( f [ j >> 2 ] | 0 ) == 0 ?- 1 : e ; f [ g >> 2 ] = h ; f [ c >> 2 ] = 0 ; f [ k >> 2 ] = 0 ; f [ i >> 2 ] = 0 ; f [ j >> 2 ] = 0 }} else e = ul ( a , b , o , q , r ) | 0 ; c = f [ a >> 2 ] | 0 ; f [ a >> 2 ] = c | n ; if ( m ) pw ( a ); c = ( c & 32 | 0 ) == 0 ? e :- 1 } l = s ; return c | 0 } function Kw ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var h = 0 , i = 0 , m = 0 , n = 0 , o = 0 , p = 0.0 , q = 0 , r = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 , B = 0 , C = 0 , D = 0 , E = 0 , F = 0 , H = 0 , I = 0 , J = 0 , K = 0 , L = 0 , M = 0 , N = 0 , O = 0 , P = 0 , Q = 0 ; P = l ; l = l + 304 | 0 ; H = P + 16 | 0 ; J = P + 8 | 0 ; I = P + 33 | 0 ; K = P ; y = P + 32 | 0 ; if (( f [ a + 76 >> 2 ] | 0 ) >- 1 ) O = ow ( a ) | 0 ; else O = 0 ; h = d [ b >> 0 ] | 0 ; a : do if ( h << 24 >> 24 ){ L = a + 4 | 0 ; M = a + 100 | 0 ; F = a + 108 | 0 ; z = a + 8 | 0 ; A = I + 10 | 0 ; B = I + 33 | 0 ; C = J + 4 | 0 ; D = I + 46 | 0 ; E = I + 94 | 0 ; m = h ; h = 0 ; n = b ; s = 0 ; i = 0 ; b = 0 ; b : while ( 1 ){ c : do if ( ! ( Hv ( m & 255 ) | 0 )){ m = ( d [ n >> 0 ] | 0 ) == 37 ; d : do if ( m ){ q = n + 1 | 0 ; o = d [ q >> 0 ] | 0 ; e : do switch ( o << 24 >> 24 ){ case 37 : break d ; case 42 : { x = 0 ; o = n + 2 | 0 ; break } default : { o = ( o & 255 ) +- 48 | 0 ; if ( o >>> 0 < 10 ? ( d [ n + 2 >> 0 ] | 0 ) == 36 : 0 ){ f [ H >> 2 ] = f [ c >> 2 ]; while ( 1 ){ x = ( f [ H >> 2 ] | 0 ) + ( 4 - 1 ) &~ ( 4 - 1 ); m = f [ x >> 2 ] | 0 ; f [ H >> 2 ] = x + 4 ; if ( o >>> 0 > 1 ) o = o +- 1 | 0 ; else break } x = m ; o = n + 3 | 0 ; break e } o = ( f [ c >> 2 ] | 0 ) + ( 4 - 1 ) &~ ( 4 - 1 ); x = f [ o >> 2 ] | 0 ; f [ c >> 2 ] = o + 4 ; o = q }} while ( 0 ); m = d [ o >> 0 ] | 0 ; n = m & 255 ; if (( n +- 48 | 0 ) >>> 0 < 10 ){ m = 0 ; while ( 1 ){ q = ( m * 10 | 0 ) +- 48 + n | 0 ; o = o + 1 | 0 ; m = d [ o >> 0 ] | 0 ; n = m & 255 ; if (( n +- 48 | 0 ) >>> 0 >= 10 ) break ; else m = q }} else q = 0 ; if ( m << 24 >> 24 == 109 ){ o = o + 1 | 0 ; r = d [ o >> 0 ] | 0 ; m = ( x | 0 ) != 0 & 1 ; i = 0 ; b = 0 } else { r = m ; m = 0 } n = o + 1 | 0 ; switch ( r & 255 | 0 ){ case 104 : { w = ( d [ n >> 0 ] | 0 ) == 104 ; n = w ? o + 2 | 0 : n ; o = w ?- 2 :- 1 ; break } case 108 : { w = ( d [ n >> 0 ] | 0 ) == 108 ; n = w ? o + 2 | 0 : n ; o = w ? 3 : 1 ; break } case 106 : { o = 3 ; break } case 116 : case 122 : { o = 1 ; break } case 76 : { o = 2 ; break } case 110 : case 112 : case 67 : case 83 : case 91 : case 99 : case 115 : case 88 : case 71 : case 70 : case 69 : case 65 : case 103 : case 102 : case 101 : case 97 : case 120 : case 117 : case 111 : case 105 : case 100 : { n = o ; o = 0 ; break } default : { N = 152 ; break b }} r = g [ n >> 0 ] | 0 ; t = ( r & 47 | 0 ) == 3 ; r = t ? r | 32 : r ; t = t ? 1 : o ; switch ( r | 0 ){ case 99 : { w = s ; v = ( q | 0 ) < 1 ? 1 : q ; break } case 91 : { w = s ; v = q ; break } case 110 : { if ( ! x ){ o = s ; break c } switch ( t | 0 ){ case - 2 : { d [ x >> 0 ] = s ; o = s ; break c } case - 1 : { e [ x >> 1 ] = s ; o = s ; break c } case 0 : { f [ x >> 2 ] = s ; o = s ; break c } case 1 : { f [ x >> 2 ] = s ; o = s ; break c } case 3 : { o = x ; f [ o >> 2 ] = s ; f [ o + 4 >> 2 ] = (( s | 0 ) < 0 ) << 31 >> 31 ; o = s ; break c } default : { o = s ; break c }}} default : { Nv ( a , 0 ); do { o = f [ L >> 2 ] | 0 ; if ( o >>> 0 < ( f [ M >> 2 ] | 0 ) >>> 0 ){ f [ L >> 2 ] = o + 1 ; o = g [ o >> 0 ] | 0 } else o = Ov ( a ) | 0 } while (( Hv ( o ) | 0 ) != 0 ); o = f [ L >> 2 ] | 0 ; if ( f [ M >> 2 ] | 0 ){ o = o +- 1 | 0 ; f [ L >> 2 ] = o } w = ( f [ F >> 2 ] | 0 ) + s + o - ( f [ z >> 2 ] | 0 ) | 0 ; v = q }} Nv ( a , v ); o = f [ L >> 2 ] | 0 ; q = f [ M >> 2 ] | 0 ; if ( o >>> 0 < q >>> 0 ) f [ L >> 2 ] = o + 1 ; else { if (( Ov ( a ) | 0 ) < 0 ){ N = 152 ; break b } q = f [ M >> 2 ] | 0 } if ( q ) f [ L >> 2 ] = ( f [ L >> 2 ] | 0 ) +- 1 ; e : do switch ( r | 0 ){ case 91 : case 99 : case 115 : { u = ( r | 0 ) == 99 ; f : do if (( r & 239 | 0 ) == 99 ){ ws ( I | 0 , - 1 , 257 ) | 0 ; d [ I >> 0 ] = 0 ; if (( r | 0 ) == 115 ){ d [ B >> 0 ] = 0 ; d [ A >> 0 ] = 0 ; d [ A + 1 >> 0 ] = 0 ; d [ A + 2 >> 0 ] = 0 ; d [ A + 3 >> 0 ] = 0 ; d [ A + 4 >> 0 ] = 0 }} else { Q = n + 1 | 0 ; s = ( d [ Q >> 0 ] | 0 ) == 94 ; o = s &
var a = ( this . buffer [ this . index ] << 8 ) + this . buffer [ this . index + 1 ]; return this . index += 2 , a }, d . lossless . DataStream . prototype . get8 = function (){ var a = this . buffer [ this . index ]; return this . index += 1 , a }; var e = typeof b ; "undefined" !== e && b . exports && ( b . exports = d . lossless . DataStream )},{}], 3 : [ function ( a , b , c ){ "use strict" ; var d = d || {}; d . lossless = d . lossless || {}, d . lossless . DataStream = d . lossless . DataStream || ( "undefined" != typeof a ? a ( "./data-stream.js" ) : null ), d . lossless . HuffmanTable = d . lossless . HuffmanTable || ( "undefined" != typeof a ? a ( "./huffman-table.js" ) : null ), d . lossless . QuantizationTable = d . lossless . QuantizationTable || ( "undefined" != typeof a ? a ( "./quantization-table.js" ) : null ), d . lossless . ScanHeader = d . lossless . ScanHeader || ( "undefined" != typeof a ? a ( "./scan-header.js" ) : null ), d . lossless . FrameHeader = d . lossless . FrameHeader || ( "undefined" != typeof a ? a ( "./frame-header.js" ) : null ), d . lossless . Utils = d . lossless . Utils || ( "undefined" != typeof a ? a ( "./utils.js" ) : null ), d . lossless . Decoder = d . lossless . Decoder || function ( a , b ){ this . buffer = a , this . frame = new d . lossless . FrameHeader , this . huffTable = new d . lossless . HuffmanTable , this . quantTable = new d . lossless . QuantizationTable , this . scan = new d . lossless . ScanHeader , this . DU = d . lossless . Utils . createArray ( 10 , 4 , 64 ), this . HuffTab = d . lossless . Utils . createArray ( 4 , 2 , 12800 ), this . IDCT_Source = [], this . nBlock = [], this . acTab = d . lossless . Utils . createArray ( 10 , 1 ), this . dcTab = d . lossless . Utils . createArray ( 10 , 1 ), this . qTab = d . lossless . Utils . createArray ( 10 , 1 ), this . marker = 0 , this . markerIndex = 0 , this . numComp = 0 , this . restartInterval = 0 , this . selection = 0 , this . xDim = 0 , this . yDim = 0 , this . xLoc = 0 , this . yLoc = 0 , this . numBytes = 0 , this . outputData = null , this . restarting =! 1 , this . mask = 0 , "undefined" != typeof b && ( this . numBytes = b )}, d . lossless . Decoder . IDCT_P = [ 0 , 5 , 40 , 16 , 45 , 2 , 7 , 42 , 21 , 56 , 8 , 61 , 18 , 47 , 1 , 4 , 41 , 23 , 58 , 13 , 32 , 24 , 37 , 10 , 63 , 17 , 44 , 3 , 6 , 43 , 20 , 57 , 15 , 34 , 29 , 48 , 53 , 26 , 39 , 9 , 60 , 19 , 46 , 22 , 59 , 12 , 33 , 31 , 50 , 55 , 25 , 36 , 11 , 62 , 14 , 35 , 28 , 49 , 52 , 27 , 38 , 30 , 51 , 54 ], d . lossless . Decoder . TABLE = [ 0 , 1 , 5 , 6 , 14 , 15 , 27 , 28 , 2 , 4 , 7 , 13 , 16 , 26 , 29 , 42 , 3 , 8 , 12 , 17 , 25 , 30 , 41 , 43 , 9 , 11 , 18 , 24 , 31 , 40 , 44 , 53 , 10 , 19 , 23 , 32 , 39 , 45 , 52 , 54 , 20 , 22 , 33 , 38 , 46 , 51 , 55 , 60 , 21 , 34 , 37 , 47 , 50 , 56 , 59 , 61 , 35 , 36 , 48 , 49 , 57 , 58 , 62 , 63 ], d . lossless . Decoder . MAX_HUFFMAN_SUBTREE = 50 , d . lossless . Decoder . MSB = 2147483648 , d . lossless . Decoder . RESTART_MARKER_BEGIN = 65488 , d . lossless . Decoder . RESTART_MARKER_END = 65495 , d . lossless . Decoder . prototype . decompress = function ( a , b , c ){ return this . decode ( a , b , c ). buffer }, d . lossless . Decoder . prototype . decode = function ( a , b , c , e ){ var f , g , h , i , j = 0 , k = [], l = [], m = []; if ( "undefined" != typeof a && ( this . buffer = a ), "undefined" != typeof e && ( this . numBytes = e ), this . stream = new d . lossless . DataStream ( this . buffer , b , c ), this . buffer = null , this . xLoc = 0 , this . yLoc = 0 , f = this . stream . get16 (), 65496 !== f ) throw new Error ( "Not a JPEG file" ); for ( f = this . stream . get16 (); f >> 4 !== 4092 || 65476 === f ;){ switch ( f ){ case 65476 : this . huffTable . read ( this . stream , this . HuffTab ); break ; case 65484 : throw new Error ( "Program doesn't support arithmetic coding. (format throw new IOException)" ); case 65499 : this . quantTable . read ( this . stream , d . lossless . Decoder . TABLE ); break ; case 65501 : this . restartInterval = this . readNumber (); break ; case 65504 : case 65505 : case 65506 : case 65507 : case 65508 : case 65509 : case 65510 : case 65511 : case 65512 : case 65513 : case 65514 : case 65515 : case 65516 : case 65517 : case 65518 : case 65519 : this . readApp (); break ; case 65534 : this . readComment (); break ; default : if ( f >> 8 !== 255 ) throw new Error ( "ERROR: format throw new IOException! (decode)" )} f = this . stream . get16 ()} if ( 65472 > f || f > 65479 ) throw new Error ( "ERROR: could not handle arithmetic code!" ); this . frame . read ( this . stream ), f = this . stream . get16 (); do { for (; 65498 !== f ;){ switch ( f ){ case 65476 : this . huffTable . read ( this . stream , this . HuffTab ); break ; case 65484 : throw new Error ( "Program doesn't support arithmetic coding. (format throw new IOException)" ); case 65499 : this . quantTable . read ( this . stream , d . lossless . Decoder . TABLE ); break ; case 65501 : this . restartInterval = this . readNumber (); break ; case 65504 : case 65505 : case 65506 : case 65507 : case 65508 : case 65509 : case 65510 : case 65511 : case 65512 : case 65513 : case 65514 : case 65515 : case 65516 : case 65517 : case 65518 : case 65519 : this . readApp (); break ; case 65534 : this . readComment (); break ; default : if ( f >> 8
var k = j [ 0 ], l = c [ 0 ]. isSigned ; if ( l ) var m = new Int16Array ( k . items . length * d ); else var m = new Uint16Array ( k . items . length * d ); var n , o , p , q , s , t , u , v , w , x , y , z , A , B , C , D = { left : k . left , top : k . top , width : k . width , height : k . height , items : m }, E = 0 ; if ( i . codingStyleDefaultParameters . multipleComponentTransform ){ var F = 4 === d , G = j [ 0 ]. items , H = j [ 1 ]. items , I = j [ 2 ]. items , J = F ? j [ 3 ]. items : null ; n = c [ 0 ]. precision - 8 , o = ( 128 << n ) + . 5 , p = 255 * ( 1 << n ), s = . 5 * p , q =- s ; var K = i . components [ 0 ], L = d - 3 ; if ( u = G . length , K . codingStyleParameters . reversibleTransformation ) for ( t = 0 ; u > t ; t ++ , E += L ) v = G [ t ] + o , w = H [ t ], x = I [ t ], z = v - ( x + w >> 2 ), y = z + x , A = z + w , m [ E ++ ] = 0 >= y ? 0 : y >= p ? 255 : y >> n , m [ E ++ ] = 0 >= z ? 0 : z >= p ? 255 : z >> n , m [ E ++ ] = 0 >= A ? 0 : A >= p ? 255 : A >> n ; else for ( t = 0 ; u > t ; t ++ , E += L ) v = G [ t ] + o , w = H [ t ], x = I [ t ], y = v + 1.402 * x , z = v - . 34413 * w - . 71414 * x , A = v + 1.772 * w , m [ E ++ ] = 0 >= y ? 0 : y >= p ? 255 : y >> n , m [ E ++ ] = 0 >= z ? 0 : z >= p ? 255 : z >> n , m [ E ++ ] = 0 >= A ? 0 : A >= p ? 255 : A >> n ; if ( F ) for ( t = 0 , E = 3 ; u > t ; t ++ , E += 4 ) B = J [ t ], m [ E ] = q >= B ? 0 : B >= s ? 255 : B + o >> n } else for ( h = 0 ; d > h ; h ++ ) if ( 8 === c [ h ]. precision ){ var M = j [ h ]. items ; for ( n = c [ h ]. precision - 8 , o = ( 128 << n ) + . 5 , p = 127.5 * ( 1 << n ), q =- p , E = h , t = 0 , u = M . length ; u > t ; t ++ ) C = M [ t ], m [ E ] = q >= C ? 0 : C >= p ? 255 : C + o >> n , E += d } else { var l = c [ h ]. isSigned , M = j [ h ]. items ; if ( l ) for ( E = h , t = 0 , u = M . length ; u > t ; t ++ ) m [ E ] = M [ t ], E += d ; else { n = c [ h ]. precision - 8 , o = ( 128 << n ) + . 5 ; var N = Math . pow ( 2 , c [ h ]. precision ) - 1 ; for ( E = h , t = 0 , u = M . length ; u > t ; t ++ ) C = M [ t ], m [ E ] = Math . max ( Math . min ( C + o , N ), 0 ), E += d }} e . push ( D )} return e } function t ( a , b ){ for ( var c = a . SIZ , d = c . Csiz , e = a . tiles [ b ], f = 0 ; d > f ; f ++ ){ var g = e . components [ f ], h = void 0 !== a . currentTile . QCC [ f ] ? a . currentTile . QCC [ f ] : a . currentTile . QCD ; g . quantizationParameters = h ; var i = void 0 !== a . currentTile . COC [ f ] ? a . currentTile . COC [ f ] : a . currentTile . COD ; g . codingStyleParameters = i } e . codingStyleDefaultParameters = a . currentTile . COD } var u = { LL : 0 , LH : 1 , HL : 1 , HH : 2 }; a . prototype = { parse : function ( a ){ var b = readUint16 ( a , 0 ); if ( 65359 === b ) return void this . parseCodestream ( a , 0 , a . length ); for ( var c = 0 , d = a . length ; d > c ;){ var e = 8 , f = readUint32 ( a , c ), g = readUint32 ( a , c + 4 ); if ( c += e , 1 === f && ( f = 4294967296 * readUint32 ( a , c ) + readUint32 ( a , c + 4 ), c += 8 , e += 8 ), 0 === f && ( f = d - c + e ), e > f ) throw new Error ( "JPX Error: Invalid box field size" ); var h = f - e , i =! 0 ; switch ( g ){ case 1785737832 : i =! 1 ; break ; case 1668246642 : var j = a [ c ]; if ( a [ c + 1 ], a [ c + 2 ], 1 === j ){ var k = readUint32 ( a , c + 3 ); switch ( k ){ case 16 : case 17 : case 18 : break ; default : warn ( "Unknown colorspace " + k )}} else 2 === j && info ( "ICC profile not supported" ); break ; case 1785737827 : this . parseCodestream ( a , c , c + h ); break ; case 1783636e3 : 218793738 !== readUint32 ( a , c ) && warn ( "Invalid JP2 signature" ); break ; case 1783634458 : case 1718909296 : case 1920099697 : case 1919251232 : case 1768449138 : break ; default : var l = String . fromCharCode ( g >> 24 & 255 , g >> 16 & 255 , g >> 8 & 255 , 255 & g ); warn ( "Unsupported header type " + g + " (" + l + ")" )} i && ( c += h )}}, parseImageProperties : function ( a ){ for ( var b = a . getByte (); b >= 0 ;){ var c = b ; b = a . getByte (); var d = c << 8 | b ; if ( 65361 === d ){ a . skip ( 4 ); var e = a . getInt32 () >>> 0 , f = a . getInt32 () >>> 0 , g = a . getInt32 () >>> 0 , h = a . getInt32 () >>> 0 ; a . skip ( 16 ); var i = a . getUint16 (); return this . width = e - g , this . height = f - h , this . componentsCount = i , void ( this . bitsPerComponent = 8 )}} throw new Error ( "JPX Error: No size marker found in JPX stream" )}, parseCodestream : function ( a , d , e ){ var f = {}; try { for ( var g =! 1 , h = d ; e > h + 1 ;){ var i = readUint16 ( a , h ); h += 2 ; var j , k , l , m , n , q , r = 0 ; switch ( i ){ case 65359 : f . mainHeader =! 0 ; break ; case 65497 : break ; case 65361 : r = readUint16 ( a , h ); var u = {}; u . Xsiz = readUint32 ( a , h + 4 ), u . Ysiz = readUint32 ( a , h + 8 ), u . XOsiz = readUint32 ( a , h + 12 ), u . YOsiz = readUint32 ( a , h + 16 ), u . XTsiz = readUint32 ( a , h + 20 ), u . YTsiz = readUint32 ( a , h + 24 ), u . XTOsiz = readUint32 ( a , h + 28 ), u . YTOsiz = readUint32 ( a , h + 32 ); var v = readUint16 ( a , h + 36 ); u . Csiz = v ; var w = []; j = h + 38 ; for ( var x = 0 ; v > x ; x ++ ){ var y = { precision : ( 127 & a [ j ]) + 1 , isSigned :!! ( 128 & a [ j ]), XRsiz : a [ j + 1 ], YRsiz : a [ j + 1 ]}; b ( y , u ), w . push ( y )} f . SIZ = u , f . components = w , c ( f , w ), f . QCC = [], f . COC = []; break ; case 65372 : r = readUint16 ( a , h ); var z = {}; switch ( j = h + 2 , k = a [ j ++ ], 31 & k ){ case 0 : m = 8 , n =! 0 ; break ; case 1 : m = 16 , n =! 1 ; break ; case 2 : m = 16 , n =! 0 ; break ; default : throw new Error ( "JPX Error: Invalid SQcd value " + k )} for ( z . noQuantization = 8 === m , z . scalarExpounded = n , z . guardBits = k >> 5 , l = []; r + h > j ;){ var A = {}; 8 === m ? ( A . epsilon = a [ j ++ ] >> 3 , A . mu = 0 ) : ( A . epsilon = a [ j ] >> 3 , A . mu = ( 7 & a [ j ]) << 8 | a [ j + 1 ], j += 2 ), l . push ( A )} z . SPqcds = l , f . mainHeader ? f . QCD = z : ( f . c
}, sendWithPromise : function ( a , b , c ){ var d = this . callbackIndex ++ , e = { action : a , data : b , callbackId : d }, f = createPromiseCapability (); this . callbacksCapabilities [ d ] = f ; try { this . postMessage ( e , c )} catch ( g ){ f . reject ( g )} return f . promise }, postMessage : function ( a , b ){ b && this . postMessageTransfers ? this . comObj . postMessage ( a , b ) : this . comObj . postMessage ( a )}}; var OpenJPEG = function ( Module ){ function globalEval ( a ){ eval . call ( null , a )} function assert ( a , b ){ a || abort ( "Assertion failed: " + b )} function getCFunc ( ident ){ var func = Module [ "_" + ident ]; if ( ! func ) try { func = eval ( "_" + ident )} catch ( e ){} return assert ( func , "Cannot call unknown function " + ident + " (perhaps LLVM optimizations or closure removed it?)" ), func } function setValue ( a , b , c , d ){ switch ( c = c || "i8" , "*" === c . charAt ( c . length - 1 ) && ( c = "i32" ), c ){ case "i1" : HEAP8 [ a >> 0 ] = b ; break ; case "i8" : HEAP8 [ a >> 0 ] = b ; break ; case "i16" : HEAP16 [ a >> 1 ] = b ; break ; case "i32" : HEAP32 [ a >> 2 ] = b ; break ; case "i64" : tempI64 = [ b >>> 0 ,( tempDouble = b , + Math_abs ( tempDouble ) >= 1 ? tempDouble > 0 ? ( 0 | Math_min ( + Math_floor ( tempDouble / 4294967296 ), 4294967295 )) >>> 0 :~~+ Math_ceil (( tempDouble -+ ( ~~ tempDouble >>> 0 )) / 4294967296 ) >>> 0 : 0 )], HEAP32 [ a >> 2 ] = tempI64 [ 0 ], HEAP32 [ a + 4 >> 2 ] = tempI64 [ 1 ]; break ; case "float" : HEAPF32 [ a >> 2 ] = b ; break ; case "double" : HEAPF64 [ a >> 3 ] = b ; break ; default : abort ( "invalid type for setValue: " + c )}} function getValue ( a , b , c ){ switch ( b = b || "i8" , "*" === b . charAt ( b . length - 1 ) && ( b = "i32" ), b ){ case "i1" : return HEAP8 [ a >> 0 ]; case "i8" : return HEAP8 [ a >> 0 ]; case "i16" : return HEAP16 [ a >> 1 ]; case "i32" : return HEAP32 [ a >> 2 ]; case "i64" : return HEAP32 [ a >> 2 ]; case "float" : return HEAPF32 [ a >> 2 ]; case "double" : return HEAPF64 [ a >> 3 ]; default : abort ( "invalid type for setValue: " + b )} return null } function allocate ( a , b , c , d ){ var e , f ; "number" == typeof a ? ( e =! 0 , f = a ) : ( e =! 1 , f = a . length ); var g , h = "string" == typeof b ? b : null ; if ( g = c == ALLOC_NONE ? d : [ _malloc , Runtime . stackAlloc , Runtime . staticAlloc , Runtime . dynamicAlloc ][ void 0 === c ? ALLOC_STATIC : c ]( Math . max ( f , h ? 1 : b . length )), e ){ var i , d = g ; for ( assert ( 0 == ( 3 & g )), i = g + ( - 4 & f ); i > d ; d += 4 ) HEAP32 [ d >> 2 ] = 0 ; for ( i = g + f ; i > d ;) HEAP8 [ d ++>> 0 ] = 0 ; return g } if ( "i8" === h ) return a . subarray || a . slice ? HEAPU8 . set ( a , g ) : HEAPU8 . set ( new Uint8Array ( a ), g ), g ; for ( var j , k , l , m = 0 ; f > m ;){ var n = a [ m ]; "function" == typeof n && ( n = Runtime . getFunctionIndex ( n )), j = h || b [ m ], 0 !== j ? ( "i64" == j && ( j = "i32" ), setValue ( g + m , n , j ), l !== j && ( k = Runtime . getNativeTypeSize ( j ), l = j ), m += k ) : m ++ } return g } function getMemory ( a ){ return staticSealed ? "undefined" != typeof _sbrk &&! _sbrk . called ||! runtimeInitialized ? Runtime . dynamicAlloc ( a ) : _malloc ( a ) : Runtime . staticAlloc ( a )} function Pointer_stringify ( a , b ){ if ( 0 === b ||! a ) return "" ; for ( var c , d = 0 , e = 0 ;;){ if ( c = HEAPU8 [ a + e >> 0 ], d |= c , 0 == c &&! b ) break ; if ( e ++ , b && e == b ) break } b || ( b = e ); var f = "" ; if ( 128 > d ){ for ( var g , h = 1024 ; b > 0 ;) g = String . fromCharCode . apply ( String , HEAPU8 . subarray ( a , a + Math . min ( b , h ))), f = f ? f + g : g , a += h , b -= h ; return f } return Module . UTF8ToString ( a )} function AsciiToString ( a ){ for ( var b = "" ;;){ var c = HEAP8 [ a ++>> 0 ]; if ( ! c ) return b ; b += String . fromCharCode ( c )}} function stringToAscii ( a , b ){ return writeAsciiToMemory ( a , b , ! 1 )} function UTF8ArrayToString ( a , b ){ for ( var c , d , e , f , g , h , i = "" ;;){ if ( c = a [ b ++ ], ! c ) return i ; if ( 128 & c ) if ( d = 63 & a [ b ++ ], 192 != ( 224 & c )) if ( e = 63 & a [ b ++ ], 224 == ( 240 & c ) ? c = ( 15 & c ) << 12 | d << 6 | e : ( f = 63 & a [ b ++ ], 240 == ( 248 & c ) ? c = ( 7 & c ) << 18 | d << 12 | e << 6 | f : ( g = 63 & a [ b ++ ], 248 == ( 252 & c ) ? c = ( 3 & c ) << 24 | d << 18 | e << 12 | f << 6 | g : ( h = 63 & a [ b ++ ], c = ( 1 & c ) << 30 | d << 24 | e << 18 | f << 12 | g << 6 | h ))), 65536 > c ) i += String . fromCharCode ( c ); else { var j = c - 65536 ; i += String . fromCharCode ( 55296 | j >> 10 , 56320 | 1023 & j )} else i += String . fromCharCode (( 31 & c ) << 6 | d ); else i += String . fromCharCode ( c )}} function UTF8ToString ( a ){ return UTF8ArrayToString ( HEAPU8 , a )} function stringToUTF8Array ( a , b , c , d ){ if ( ! ( d > 0 )) return 0 ; for ( var e = c , f = c + d - 1 , g = 0 ; g < a . length ; ++ g ){ var h = a . charCodeAt ( g ); if ( h >= 55296 && 57343 >= h && ( h = 65536 + (( 1023 & h ) << 10 ) | 1023 & a . charCodeAt ( ++ g )), 127 >= h ){ if ( c >= f ) break ; b [ c ++ ] = h } else if ( 2047 >= h ){ if ( c + 1 >= f ) break ; b [ c ++ ] = 192 | h >> 6 , b [ c ++ ] = 128 | 63 & h } else if ( 65535 >= h ){ if ( c + 2 >= f ) break ; b [ c ++ ] = 224 | h >> 12 , b [ c ++ ] = 128 | h >> 6 & 63 , b [ c ++ ] = 128 | 63 & h } else if ( 2097151 >= h ){ if ( c + 3 >= f ) break ; b [ c ++ ] = 240 | h >> 18 , b [ c ++ ] = 128 | h >> 12 & 63 , b [ c ++ ] = 128 | h >> 6 & 63 , b [ c ++ ] = 128 | 63 & h } else if ( 67108863 >= h ){ if ( c + 4 >= f ) break ; b [ c ++ ] = 248 | h >> 24 , b [ c ++ ] = 128 | h >> 18 & 63 , b [ c ++ ] = 128 | h >> 12 & 63 , b [ c ++ ] = 128 | h >> 6 & 63 , b [ c ++ ] = 128 | 63 & h } el
HEAP32 [ 0 ] = 255 , assert ( 255 === HEAPU8 [ 0 ] && 0 === HEAPU8 [ 3 ], "Typed arrays 2 must be run on a little-endian system" ), Module . HEAP = HEAP , Module . buffer = buffer , Module . HEAP8 = HEAP8 , Module . HEAP16 = HEAP16 , Module . HEAP32 = HEAP32 , Module . HEAPU8 = HEAPU8 , Module . HEAPU16 = HEAPU16 , Module . HEAPU32 = HEAPU32 , Module . HEAPF32 = HEAPF32 , Module . HEAPF64 = HEAPF64 ; var __ATPRERUN__ = [], __ATINIT__ = [], __ATMAIN__ = [], __ATEXIT__ = [], __ATPOSTRUN__ = [], runtimeInitialized =! 1 , runtimeExited =! 1 ; Module . addOnPreRun = addOnPreRun , Module . addOnInit = addOnInit , Module . addOnPreMain = addOnPreMain , Module . addOnExit = addOnExit , Module . addOnPostRun = addOnPostRun , Module . intArrayFromString = intArrayFromString , Module . intArrayToString = intArrayToString , Module . writeStringToMemory = writeStringToMemory , Module . writeArrayToMemory = writeArrayToMemory , Module . writeAsciiToMemory = writeAsciiToMemory , Math . imul &&- 5 === Math . imul ( 4294967295 , 5 ) || ( Math . imul = function ( a , b ){ var c = a >>> 16 , d = 65535 & a , e = b >>> 16 , f = 65535 & b ; return d * f + ( c * f + d * e << 16 ) | 0 }), Math . imul = Math . imul , Math . clz32 || ( Math . clz32 = function ( a ){ a >>>= 0 ; for ( var b = 0 ; 32 > b ; b ++ ) if ( a & 1 << 31 - b ) return b ; return 32 }), Math . clz32 = Math . clz32 ; var Math_abs = Math . abs , Math_cos = Math . cos , Math_sin = Math . sin , Math_tan = Math . tan , Math_acos = Math . acos , Math_asin = Math . asin , Math_atan = Math . atan , Math_atan2 = Math . atan2 , Math_exp = Math . exp , Math_log = Math . log , Math_sqrt = Math . sqrt , Math_ceil = Math . ceil , Math_floor = Math . floor , Math_pow = Math . pow , Math_imul = Math . imul , Math_fround = Math . fround , Math_min = Math . min , Math_clz32 = Math . clz32 , runDependencies = 0 , runDependencyWatcher = null , dependenciesFulfilled = null ; Module . addRunDependency = addRunDependency , Module . removeRunDependency = removeRunDependency , Module . preloadedImages = {}, Module . preloadedAudios = {}; var memoryInitializer = null , ASM_CONSTS = []; STATIC_BASE = 8 , STATICTOP = STATIC_BASE + 25664 , __ATINIT__ . push (), allocate ([ 131 , 192 , 202 , 161 , 69 , 182 , 251 , 63 , 127 , 251 , 58 , 112 , 206 , 136 , 234 , 63 , 127 , 251 , 58 , 112 , 206 , 136 , 234 , 63 , 131 , 192 , 202 , 161 , 69 , 182 , 251 , 63 , 225 , 122 , 20 , 174 , 71 , 225 , 252 , 63 , 94 , 186 , 73 , 12 , 2 , 43 , 249 , 63 , 0 , 0 , 0 , 0 , 0 , 0 , 240 , 63 , 0 , 0 , 0 , 0 , 0 , 0 , 248 , 63 , 0 , 0 , 0 , 0 , 0 , 0 , 6 , 64 , 0 , 0 , 0 , 0 , 0 , 128 , 21 , 64 , 92 , 143 , 194 , 245 , 40 , 92 , 37 , 64 , 215 , 163 , 112 , 61 , 10 , 87 , 53 , 64 , 246 , 40 , 92 , 143 , 194 , 85 , 69 , 64 , 133 , 235 , 81 , 184 , 30 , 85 , 85 , 64 , 102 , 102 , 102 , 102 , 102 , 86 , 101 , 64 , 205 , 204 , 204 , 204 , 204 , 84 , 117 , 64 , 207 , 247 , 83 , 227 , 165 , 155 , 240 , 63 , 70 , 182 , 243 , 253 , 212 , 120 , 249 , 63 , 39 , 49 , 8 , 172 , 28 , 90 , 7 , 64 , 29 , 90 , 100 , 59 , 223 , 207 , 22 , 64 , 41 , 92 , 143 , 194 , 245 , 168 , 38 , 64 , 164 , 112 , 61 , 10 , 215 , 163 , 54 , 64 , 0 , 0 , 0 , 0 , 0 , 160 , 70 , 64 , 31 , 133 , 235 , 81 , 184 , 158 , 86 , 64 , 205 , 204 , 204 , 204 , 204 , 156 , 102 , 64 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 207 , 247 , 83 , 227 , 165 , 155 , 240 , 63 , 70 , 182 , 243 , 253 , 212 , 120 , 249 , 63 , 39 , 49 , 8 , 172 , 28 , 90 , 7 , 64 , 29 , 90 , 100 , 59 , 223 , 207 , 22 , 64 , 41 , 92 , 143 , 194 , 245 , 168 , 38 , 64 , 164 , 112 , 61 , 10 , 215 , 163 , 54 , 64 , 0 , 0 , 0 , 0 , 0 , 160 , 70 , 64 , 31 , 133 , 235 , 81 , 184 , 158 , 86 , 64 , 205 , 204 , 204 , 204 , 204 , 156 , 102 , 64 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 173 , 250 , 92 , 109 , 197 , 254 , 230 , 63 , 86 , 125 , 174 , 182 , 98 , 127 , 237 , 63 , 199 , 75 , 55 , 137 , 65 , 96 , 249 , 63 , 242 , 210 , 77 , 98 , 16 , 88 , 8 , 64 , 250 , 126 , 106 , 188 , 116 , 19 , 24 , 64 , 133 , 235 , 81 , 184 , 30 , 5 , 40 , 64 , 0 , 0 , 0 , 0 , 0 , 0 , 56 , 64 , 92 , 143 , 194 , 245 , 40 , 252 , 71 , 64 , 236 , 81 , 184 , 30 , 133 , 251 , 87 , 64 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 240 , 63 , 113 , 61 , 10 , 215 , 163 , 112 , 255 , 63 , 104 , 145 , 237 , 124 , 63 , 181 , 16 , 64 , 117 , 147 , 24 , 4 , 86 , 206 , 32 , 64 , 102 , 102 , 102 , 102 , 102 , 230 , 48 , 64 , 236 , 81 , 184 , 30 , 133 , 235 , 64 , 64 , 92 , 143 , 194 , 245 , 40 , 236 , 80 , 64 , 154 , 153 , 153 , 153 , 153 , 233 , 96 , 64 , 154 , 153 , 153 , 153 , 153 , 233 , 112 , 64 , 51 , 51 , 51 , 51 , 51 , 231 , 128 , 64 , 147 , 24 , 4 , 86 , 14 , 45 , 0 , 64 , 182 , 243 , 253 , 212 , 120 , 233 , 15 , 64 , 246 , 40 , 92 , 143 , 194 , 181 , 32 , 64 , 10 , 215 , 163 , 112 , 61 , 10 , 49 , 64 , 195 , 245 , 40 , 92 , 143 , 34 , 65 , 64 , 184 , 30 , 133 , 235 , 81 , 40 , 81 , 64 , 154 , 153 , 153 , 153 , 153 , 41 , 97 , 64 , 154 , 153 , 153 , 153 , 153 , 41 , 113 , 64 , 0 , 0 , 0 , 0 , 0 , 40 , 129 , 64 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 147 , 24 , 4 , 86 , 14 , 45 , 0 , 64 , 182 , 243 , 253 , 212 , 120 , 233 , 15 , 64 , 246 , 40 , 92 , 143 , 194 , 181 , 32 , 64 , 10 , 215 , 163 , 112 , 61 , 10 , 49 , 64 , 195 , 245 , 40 , 92 , 143 , 34 , 65 , 64 , 184 , 30 , 133 , 235 , 81 , 40 , 81 , 64 , 154 , 153 , 153 , 153 , 153 , 41 , 97 , 64 , 154 , 153 , 153 , 153 , 153 , 41 , 113 , 64 , 0 , 0 , 0 , 0 , 0 , 40 , 129 , 64 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 164 , 112 , 61 , 10 , 215 , 163 , 0 , 64 , 236 , 81 , 184 , 30 , 133 , 235 , 14 , 64 , 119 , 190 , 159 , 26 , 47 , 157 , 32 , 64 , 174 , 71 , 225 , 122 , 20 , 46 , 49 , 64 , 123 , 20 , 174 , 71 , 225 , 90 , 65 , 64 , 246 , 40 , 92 , 143 , 194 , 101 , 81 , 64 , 154 , 153 , 153 , 153 , 153 , 105 , 97 , 64 , 154 , 153 , 153 , 153 , 153 , 105 , 113 , 64 , 154 , 153 , 153 , 153 , 153 , 105 , 129 , 64 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 4 , 0 , 0 , 0 , 67 , 80 , 82 , 76 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 76 , 82 , 67 , 80 , 0 , 0 , 0 , 0 , 3 , 0 , 0 , 0 , 80 , 6
allocate ([ 97 , 100 , 101 , 114 , 32 , 101 , 110 , 100 , 32 , 112 , 111 , 115 , 105 , 116 , 105 , 111 , 110 , 61 , 37 , 108 , 108 , 105 , 10 , 0 , 9 , 32 , 77 , 97 , 114 , 107 , 101 , 114 , 32 , 108 , 105 , 115 , 116 , 58 , 32 , 123 , 10 , 0 , 9 , 9 , 32 , 116 , 121 , 112 , 101 , 61 , 37 , 35 , 120 , 44 , 32 , 112 , 111 , 115 , 61 , 37 , 108 , 108 , 105 , 44 , 32 , 108 , 101 , 110 , 61 , 37 , 100 , 10 , 0 , 9 , 32 , 125 , 10 , 0 , 9 , 32 , 84 , 105 , 108 , 101 , 32 , 105 , 110 , 100 , 101 , 120 , 58 , 32 , 123 , 10 , 0 , 9 , 9 , 32 , 110 , 98 , 32 , 111 , 102 , 32 , 116 , 105 , 108 , 101 , 45 , 112 , 97 , 114 , 116 , 32 , 105 , 110 , 32 , 116 , 105 , 108 , 101 , 32 , 91 , 37 , 100 , 93 , 61 , 37 , 100 , 10 , 0 , 9 , 9 , 9 , 32 , 116 , 105 , 108 , 101 , 45 , 112 , 97 , 114 , 116 , 91 , 37 , 100 , 93 , 58 , 32 , 115 , 116 , 97 , 114 , 95 , 112 , 111 , 115 , 61 , 37 , 108 , 108 , 105 , 44 , 32 , 101 , 110 , 100 , 95 , 104 , 101 , 97 , 100 , 101 , 114 , 61 , 37 , 108 , 108 , 105 , 44 , 32 , 101 , 110 , 100 , 95 , 112 , 111 , 115 , 61 , 37 , 108 , 108 , 105 , 46 , 10 , 0 , 91 , 68 , 69 , 86 , 93 , 32 , 68 , 117 , 109 , 112 , 32 , 97 , 110 , 32 , 105 , 109 , 97 , 103 , 101 , 95 , 104 , 101 , 97 , 100 , 101 , 114 , 32 , 115 , 116 , 114 , 117 , 99 , 116 , 32 , 123 , 10 , 0 , 73 , 109 , 97 , 103 , 101 , 32 , 105 , 110 , 102 , 111 , 32 , 123 , 10 , 0 , 37 , 115 , 32 , 120 , 48 , 61 , 37 , 100 , 44 , 32 , 121 , 48 , 61 , 37 , 100 , 10 , 0 , 37 , 115 , 32 , 120 , 49 , 61 , 37 , 100 , 44 , 32 , 121 , 49 , 61 , 37 , 100 , 10 , 0 , 37 , 115 , 32 , 110 , 117 , 109 , 99 , 111 , 109 , 112 , 115 , 61 , 37 , 100 , 10 , 0 , 37 , 115 , 9 , 32 , 99 , 111 , 109 , 112 , 111 , 110 , 101 , 110 , 116 , 32 , 37 , 100 , 32 , 123 , 10 , 0 , 37 , 115 , 125 , 10 , 0 , 91 , 68 , 69 , 86 , 93 , 32 , 68 , 117 , 109 , 112 , 32 , 97 , 110 , 32 , 105 , 109 , 97 , 103 , 101 , 95 , 99 , 111 , 109 , 112 , 95 , 104 , 101 , 97 , 100 , 101 , 114 , 32 , 115 , 116 , 114 , 117 , 99 , 116 , 32 , 123 , 10 , 0 , 37 , 115 , 32 , 100 , 120 , 61 , 37 , 100 , 44 , 32 , 100 , 121 , 61 , 37 , 100 , 10 , 0 , 37 , 115 , 32 , 112 , 114 , 101 , 99 , 61 , 37 , 100 , 10 , 0 , 37 , 115 , 32 , 115 , 103 , 110 , 100 , 61 , 37 , 100 , 10 , 0 , 87 , 101 , 32 , 110 , 101 , 101 , 100 , 32 , 97 , 110 , 32 , 105 , 109 , 97 , 103 , 101 , 32 , 112 , 114 , 101 , 118 , 105 , 111 , 117 , 115 , 108 , 121 , 32 , 99 , 114 , 101 , 97 , 116 , 101 , 100 , 46 , 10 , 0 , 84 , 105 , 108 , 101 , 32 , 105 , 110 , 100 , 101 , 120 , 32 , 112 , 114 , 111 , 118 , 105 , 100 , 101 , 100 , 32 , 98 , 121 , 32 , 116 , 104 , 101 , 32 , 117 , 115 , 101 , 114 , 32 , 105 , 115 , 32 , 105 , 110 , 99 , 111 , 114 , 114 , 101 , 99 , 116 , 32 , 37 , 100 , 32 , 40 , 109 , 97 , 120 , 32 , 61 , 32 , 37 , 100 , 41 , 32 , 10 , 0 , 82 , 101 , 115 , 111 , 108 , 117 , 116 , 105 , 111 , 110 , 32 , 102 , 97 , 99 , 116 , 111 , 114 , 32 , 105 , 115 , 32 , 103 , 114 , 101 , 97 , 116 , 101 , 114 , 32 , 116 , 104 , 97 , 110 , 32 , 116 , 104 , 101 , 32 , 109 , 97 , 120 , 105 , 109 , 117 , 109 , 32 , 114 , 101 , 115 , 111 , 108 , 117 , 116 , 105 , 111 , 110 , 32 , 105 , 110 , 32 , 116 , 104 , 101 , 32 , 99 , 111 , 109 , 112 , 111 , 110 , 101 , 110 , 116 , 46 , 10 , 0 , 84 , 104 , 101 , 32 , 103 , 105 , 118 , 101 , 110 , 32 , 116 , 105 , 108 , 101 , 32 , 105 , 110 , 100 , 101 , 120 , 32 , 100 , 111 , 101 , 115 , 32 , 110 , 111 , 116 , 32 , 109 , 97 , 116 , 99 , 104 , 46 , 0 , 116 , 105 , 108 , 101 , 32 , 110 , 117 , 109 , 98 , 101 , 114 , 32 , 37 , 100 , 32 , 47 , 32 , 37 , 100 , 10 , 0 , 69 , 114 , 114 , 111 , 114 , 32 , 97 , 108 , 108 , 111 , 99 , 97 , 116 , 105 , 110 , 103 , 32 , 116 , 105 , 108 , 101 , 32 , 99 , 111 , 109 , 112 , 111 , 110 , 101 , 110 , 116 , 32 , 100 , 97 , 116 , 97 , 46 , 0 , 78 , 111 , 116 , 32 , 101 , 110 , 111 , 117 , 103 , 104 , 32 , 109 , 101 , 109 , 111 , 114 , 121 , 32 , 116 , 111 , 32 , 101 , 110 , 99 , 111 , 100 , 101 , 32 , 97 , 108 , 108 , 32 , 116 , 105 , 108 , 101 , 115 , 10 , 0 , 83 , 105 , 122 , 101 , 32 , 109 , 105 , 115 , 109 , 97 , 116 , 99 , 104 , 32 , 98 , 101 , 116 , 119 , 101 , 101 , 110 , 32 , 116 , 105 , 108 , 101 , 32 , 100 , 97 , 116 , 97 , 32 , 97 , 110 , 100 , 32 , 115 , 101 , 110 , 116 , 32 , 100 , 97 , 116 , 97 , 46 , 0 , 70 , 97 , 105 , 108 , 101 , 100 , 32 , 116 , 111 , 32 , 97 , 108 , 108 , 111 , 99 , 97 , 116 , 101 , 32 , 105 , 109 , 97 , 103 , 101 , 32 , 104 , 101 , 97 , 100 , 101 , 114 , 46 , 0 , 69 , 114 , 114 , 111 , 114 , 32 , 119 , 104 , 105 , 108 , 101 , 32 , 111 , 112 , 106 , 95 , 106 , 50 , 107 , 95 , 112 , 114 , 101 , 95 , 119 , 114 , 105 , 116 , 101 , 95 , 116 , 105 , 108 , 101 , 32 , 119 , 105 , 116 , 104 , 32 , 116 , 105 , 108 , 101 , 32 , 105 , 110 , 100 , 101 , 120 , 32 , 61 , 32 , 37 , 100 , 10 , 0 , 69 , 114 , 114 , 111 , 114 , 32 , 119 , 104 , 105 , 108 , 101 , 32 , 111 , 112 , 106 , 95 , 106 , 50 , 107 , 95 , 112 , 111 , 115 , 116 , 95 , 119 , 114 , 105 , 116 , 101 , 95 , 116 , 105 , 108 , 101 , 32 , 119 , 105 , 116 , 104 , 32 , 116 , 105 , 108 , 101 , 32 , 105 , 110 , 100 , 101 , 120 , 32 , 61 , 32 , 37 , 100 , 10 , 0 , 78 , 111 , 116 , 32 , 101 , 110 , 111 , 117 , 103 , 104 , 32 , 109 , 101 , 109 , 111 , 114 , 121 , 32 , 116 , 111 , 32 , 99 , 114 , 101 , 97 , 116 , 101 , 32 , 84 , 105 , 108 , 101 , 32 , 67 , 111 , 100 , 101 , 114 , 10 , 0 , 78 , 111 , 116 , 32 , 101 , 110 , 111 , 117 , 103 , 104 , 32 , 109 , 101 , 109 , 111 , 114 , 121 , 32 , 116 , 111 , 32 , 119 , 114 , 105 , 116 , 101 , 32 , 67 , 66 , 68 , 32 , 109 , 97 , 114 , 107 , 101 , 114 , 10 , 0 , 78 , 111 , 116 , 32 , 101 , 110 , 111 , 117 , 103 , 104 , 32 , 109 , 101 , 109 , 111 , 114 , 121 , 32 , 116 , 111 , 32 , 119 , 114 , 105 , 116 , 101 , 32 , 77 , 67 , 84 , 32 , 109 , 97 , 114 , 107 , 101 , 114 , 10 , 0 , 78 , 111 , 116 , 32 , 101 , 110 , 111 , 117 , 103 , 104 , 32 , 109 , 101 , 109 , 111 , 114 , 121 , 32 , 116 , 111 , 32 , 119 , 114 , 105 , 116 , 101 , 32 , 77 , 67 , 67 , 32 , 109 , 97 , 114 , 107 , 101 , 114 , 10 , 0 , 78 , 111 , 116 , 32 , 101 , 110 , 111 , 117 , 103 , 104 , 32 , 109 , 101 , 109 , 111 , 114 , 121 , 32 , 116 , 111 , 32 , 119 , 114 , 105 , 116 , 101 , 32 , 77 , 67 , 79 , 32 , 109 , 97 , 114 , 107 , 101 , 114 , 10 , 0 , 78 , 111 , 116 , 32 , 101 , 110 , 111 , 117 , 103 , 104 , 32 , 109 , 101 , 109 , 111 , 114 , 121 , 32 , 116 , 111 , 32 , 119 , 114 , 105 , 116 , 101 , 32 , 116 , 104 , 101 , 32 , 67 , 79 , 77 , 32 , 109 , 97
allocate ([ 7 , 7 , 7 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 0 , 1 , 1 , 2 , 1 , 2 , 2 , 2 , 1 , 2 , 2 , 2 , 2 , 2 , 2 , 2 , 5 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 5 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 0 , 1 , 1 , 2 , 1 , 2 , 2 , 2 , 1 , 2 , 2 , 2 , 2 , 2 , 2 , 2 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 5 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 4 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 5 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 6 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 7 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 8 , 0 , 3 , 3 , 6 , 3 , 6 , 6 , 8 , 3 , 6 , 6 , 8 , 6 , 8 , 8 , 8 , 1 , 4 , 4 , 7 , 4 , 7 , 7 , 8 , 4 , 7 , 7 , 8 , 7 , 8 , 8 , 8 , 1 , 4 , 4 , 7 , 4 , 7 , 7 , 8 , 4 , 7 , 7 , 8 , 7 , 8 , 8 , 8 , 2 , 5 , 5 , 7 , 5 , 7 , 7 , 8 , 5 , 7 , 7 , 8 , 7 , 8 , 8 , 8 , 1 , 4 , 4 , 7 , 4 , 7 , 7 , 8 , 4 , 7 , 7 , 8 , 7 , 8 , 8 , 8 , 2 , 5 , 5 , 7 , 5 , 7 , 7 , 8 , 5 , 7 , 7 , 8 , 7 , 8 , 8 , 8 , 2 , 5 , 5 , 7 , 5 , 7 , 7 , 8 , 5 , 7 , 7 , 8 , 7 , 8 , 8 , 8 , 2 , 5 , 5 , 7 , 5 , 7 , 7 , 8 , 5 , 7 , 7 , 8 , 7 , 8 , 8 , 8 , 1 , 4 , 4 , 7 , 4 , 7 , 7 , 8 , 4 , 7 , 7 , 8 , 7 , 8 , 8 , 8 , 2 , 5 , 5 , 7 , 5 , 7 , 7 , 8 , 5 , 7 , 7 , 8 , 7 , 8 , 8 , 8 , 2 , 5 , 5 , 7 , 5 , 7 , 7 , 8 , 5 , 7 , 7 , 8 , 7 , 8 , 8 , 8 , 2 , 5 , 5 , 7 , 5 , 7 , 7 , 8 , 5 , 7 , 7 , 8 , 7 , 8 , 8 , 8 , 2 , 5 , 5 , 7 , 5 , 7 , 7 , 8 , 5 , 7 , 7 , 8 , 7 , 8 , 8 , 8 , 2 , 5 , 5 , 7 , 5 , 7 , 7 , 8 , 5 , 7 , 7 , 8 , 7 , 8 , 8 , 8 , 2 , 5 , 5 , 7 , 5 , 7 , 7 , 8 , 5 , 7 , 7 , 8 , 7 , 8 , 8 , 8 , 2 , 5 , 5 , 7 , 5 , 7 , 7 , 8 , 5 , 7 , 7 , 8 , 7 , 8 , 8 , 8 , 9 , 10 , 12 , 13 , 10 , 10 , 13 , 13 , 12 , 13 , 12 , 13 , 13 , 13 , 13 , 13 , 9 , 10 , 12 , 11 , 10 , 9 , 13 , 12 , 12 , 11 , 12 , 11 , 13 , 12 , 13 , 12 , 9 , 10 , 12 , 11 , 10 , 10 , 11 , 11 , 12 , 13 , 9 , 10 , 13 , 13 , 10 , 10 , 9 , 10 , 12 , 13 , 10 , 9 , 11 , 12 , 12 , 11 , 9 , 10 , 13 , 12 , 10 , 9 , 9 , 10 , 12 , 13 , 10 , 9 , 11 , 12 , 12 , 13 , 12 , 13 , 11 , 12 , 11 , 12 , 9 , 10 , 12 , 11 , 10 , 10 , 11 , 11 , 12 , 11 , 12 , 11 , 11 , 11 , 11 , 11 , 9 , 10 , 12 , 11 , 10 , 9 , 13 , 12 , 12 , 13 , 9 , 10 , 11 , 12 , 10 , 9 , 9 , 10 , 12 , 13 , 10 , 10 , 13 , 13 , 12 , 11 , 9 , 10 , 11 , 11 , 10 , 10 , 9 , 10 , 12 , 13 , 10 , 10 , 13 , 13 , 12 , 11 , 9 , 10 , 11 , 11 , 10 , 10 , 9 , 10 , 12 , 11 , 10 , 9 , 13 , 12 , 12 , 13 , 9 , 10 , 11 , 12 , 10 , 9 , 9 , 10 , 12 , 11 , 10 , 10 , 11 , 11 , 12 , 11 , 12 , 11 , 11 , 11 , 11 , 11 , 9 , 10 , 12 , 13 , 10 , 9 , 11 , 12 , 12 , 13 , 12 , 13 , 11 , 12 , 11 , 12 , 9 , 10 , 12 , 13 , 10 , 9 , 11 , 12 , 12 , 11 , 9 , 10 , 13 , 12 , 10 , 9 , 9 , 10 , 12 , 11 , 10 , 10 , 11 , 11 , 12 , 13 , 9 , 10 , 13 , 13 , 10 , 10 , 9 , 10 , 12 , 11 , 10 , 9 , 13 , 12 , 12 , 11 , 12 , 11 , 13 , 12 , 13 , 12 , 9 , 10 , 12 , 13 , 10 , 10 , 13 , 13 , 12 , 13 , 12 , 13 , 13 , 13 , 13 , 13 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 , 1 , 0 , 0 , 1 , 1 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 , 1 , 1 , 0 , 0 , 1 , 1 , 0 , 0 , 0 , 1 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 , 0 , 0 , 1 , 1 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 , 1 , 1 , 0 , 1 , 1 , 0 , 0 , 0 , 0 , 0 , 0 , 1 , 0 , 0 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 0 , 0 , 0 , 1 , 0 , 0 , 1 , 1 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 , 1 , 0 , 0 , 1 , 1 , 0 , 0 , 0 , 1 , 0 , 0 , 0 , 0 , 0 , 0 , 1 , 1 , 0 , 1 , 1 , 1 , 0 , 0 , 0 , 0 , 1 , 1 , 0 , 0 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 0 , 1 , 1 , 1 , 0 , 0 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 0 , 0 , 0 , 0 , 1 , 0 , 0 , 0 , 1 , 1 , 0 , 0 , 1 , 1 , 1 , 0 , 0 , 1 , 0 , 0 , 1 , 1 , 0 , 0 , 1 , 1 , 0 , 1 , 1 , 1 , 1 , 1 , 0 , 0 , 1 , 1 , 1 , 0 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 0 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 114 , 101 , 97 , 100 , 58 , 32 , 115 , 101 , 103 , 109 , 101 , 110 , 116 , 32 , 116 , 111 , 111 , 32 , 108 , 111 , 110 , 103 , 32 , 40 , 37 , 100 , 41 , 32 , 119 , 105 , 116 , 104 , 32 , 109 , 97 , 120 , 32 , 40 , 37 , 100 , 41 , 32 , 102 , 111 , 114 , 32 , 99 , 111 , 100 , 101 , 98 , 108 , 111 , 99 , 107 , 32 , 37 , 100 , 32 , 40 , 112 , 61 , 37 , 100 , 44 , 32 , 98 , 61 , 37 , 100 , 44 , 32 , 114 , 61 , 37 , 100 , 44 , 32 , 99 , 61 , 37 , 100 , 41 , 10 , 0 , 114 , 101 , 97 , 100 , 58 , 32 , 115 , 101 , 103 , 109 , 101 , 110 , 116 , 32 , 116 , 111 , 111 , 32 , 108 , 111 , 110 , 103 , 32 , 40 , 37 , 100 , 41 , 32 , 119 , 105 , 116 , 104 , 32 , 99 , 117 , 114 , 114 , 101 , 110 , 116 , 32 , 115 , 105 , 122 , 101 , 32 , 40 , 37 , 100 , 32 , 62 , 32 , 37 , 100 , 41 , 32 , 102 , 111 , 114 , 32 , 99 , 111 , 100 , 101 , 98 , 108 , 111 , 99 , 107 , 32 , 37 , 100 , 32 , 40 , 112 , 61 , 37 , 100 , 44 , 32 , 98 , 61 , 37 , 100 , 44 , 32 , 114 , 61 , 37 , 100 , 44 , 32 , 99 , 61 , 37 , 100 , 41 , 10 , 0 , 115 , 107 , 105 , 112 , 58 , 32 , 115 , 101 , 103 , 109 , 101 , 110 , 116 , 32 , 116 , 111 , 111 , 32 , 108 , 111 , 110 , 103 , 32 , 40 , 37 , 100 , 41 , 32 , 119 , 105 , 116 , 104 , 32 , 109 , 97 , 120 , 32 , 40 , 37 , 100 , 41 , 32 , 102 , 111 , 114 , 32 , 99 , 111 , 100 , 101 , 98 , 108 , 111 , 99 , 107 , 32 , 37 , 100 , 32 , 40 , 112 , 61 , 37 , 100 , 44 , 32 , 98 , 61 , 37 , 100 , 44 , 32 , 114 , 61 , 37 , 100 , 44 , 32 , 99 , 61 , 37 , 100 , 41 , 10 , 0 , 78 , 111 , 116 , 32 , 101 , 110 , 111 , 117 , 103 , 104 , 32 , 115 , 112 , 97 , 99 , 101 , 32 , 102 , 111 , 114 , 32 , 101 , 120 , 112 , 101 , 99 , 116 , 101 , 100 , 32 , 83 , 79 , 80 , 32 , 109 , 97 , 114 , 107 , 101 , 114 , 10 , 0 , 69 , 120 , 112 , 101 , 99 , 116 , 101 , 100 , 32 , 83 , 79 , 80 , 32 , 109 , 97 , 114 , 107 , 101 , 114 , 10 , 0 , 78 , 111 , 116 , 32 , 101 , 110 , 111 , 117 , 103 , 104 , 32 , 115 , 112 , 97 , 99 , 101 , 32 , 102 , 111 , 114 ,
var Da = b . ___setErrNo ; var Ea = b . _floor ; var Fa = b . _pthread_self ; var Ga = b . _sqrt ; var Ha = b . _floorf ; var Ia = b . ___syscall54 ; var Ja = b . ___unlock ; var Ka = b . _emscripten_set_main_loop ; var La = b . ___lock ; var Ma = b . ___syscall6 ; var Na = b . ___syscall5 ; var Oa = b . _time ; var Pa = b . ___syscall140 ; var Qa = b . ___syscall145 ; var Ra = b . ___syscall146 ; var Sa = 0.0 ; function Ta ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; var e = 0 , g = 0 , h = 0 , i = 0 , j = 0 , k = 0 , m = 0 ; m = l ; l = l + 48 | 0 ; e = m + 32 | 0 ; k = m + 28 | 0 ; f [ e >> 2 ] = c ; if (( f [ a + 8 >> 2 ] | 0 ) == 16 ) j = ( f [ a + 164 >> 2 ] | 0 ) + (( f [ a + 200 >> 2 ] | 0 ) * 5640 | 0 ) | 0 ; else j = f [ a + 12 >> 2 ] | 0 ; g = ( f [ a + 80 >> 2 ] | 0 ) + 16 | 0 ; h = ( f [ g >> 2 ] | 0 ) >>> 0 < 257 ? 1 : 2 ; i = h + 1 | 0 ; if ( i >>> 0 > c >>> 0 ){ Pd ( d , 1 , 14585 , m ) | 0 ; d = 0 ; l = m ; return d | 0 } f [ e >> 2 ] = c - i ; ld ( b , k , h ); c = f [ k >> 2 ] | 0 ; if ( c >>> 0 >= ( f [ g >> 2 ] | 0 ) >>> 0 ){ Pd ( d , 1 , 14611 , m + 8 | 0 ) | 0 ; d = 0 ; l = m ; return d | 0 } ld ( b + h | 0 ,( f [ j + 5584 >> 2 ] | 0 ) + ( c * 1080 | 0 ) | 0 , 1 ); if ( ! ( rb ( a , f [ k >> 2 ] | 0 , b + i | 0 , e , d ) | 0 )){ Pd ( d , 1 , 14585 , m + 16 | 0 ) | 0 ; d = 0 ; l = m ; return d | 0 } if ( ! ( f [ e >> 2 ] | 0 )){ d = 1 ; l = m ; return d | 0 } Pd ( d , 1 , 14585 , m + 24 | 0 ) | 0 ; d = 0 ; l = m ; return d | 0 } function Ua ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; var e = 0 , g = 0 , h = 0 , i = 0 , j = 0 ; j = l ; l = l + 32 | 0 ; i = j + 8 | 0 ; e = j + 20 | 0 ; h = f [( f [ a + 80 >> 2 ] | 0 ) + 16 >> 2 ] | 0 ; g = h >>> 0 < 257 ? 1 : 2 ; if (( g + 2 | 0 ) != ( c | 0 )){ Pd ( d , 1 , 14502 , j ) | 0 ; i = 0 ; l = j ; return i | 0 } if (( f [ a + 8 >> 2 ] | 0 ) == 16 ) a = ( f [ a + 164 >> 2 ] | 0 ) + (( f [ a + 200 >> 2 ] | 0 ) * 5640 | 0 ) | 0 ; else a = f [ a + 12 >> 2 ] | 0 ; ld ( b , e , g ); ld ( b + g | 0 , j + 16 | 0 , 1 ); c = f [ e >> 2 ] | 0 ; if ( c >>> 0 < h >>> 0 ){ ld ( b + ( g + 1 ) | 0 ,( f [ a + 5584 >> 2 ] | 0 ) + ( c * 1080 | 0 ) + 808 | 0 , 1 ); i = 1 ; l = j ; return i | 0 } else { f [ i >> 2 ] = c ; f [ i + 4 >> 2 ] = h ; Pd ( d , 1 , 14528 , i ) | 0 ; i = 0 ; l = j ; return i | 0 } return 0 } function Va ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; var e = 0 , g = 0 , h = 0 ; h = l ; l = l + 16 | 0 ; e = h + 12 | 0 ; f [ e >> 2 ] = c ; if ( ! ( qb ( a , 0 , b , e , d ) | 0 )){ Pd ( d , 1 , 14476 , h ) | 0 ; g = 0 ; l = h ; return g | 0 } if ( f [ e >> 2 ] | 0 ){ Pd ( d , 1 , 14476 , h + 8 | 0 ) | 0 ; g = 0 ; l = h ; return g | 0 } if (( f [ a + 8 >> 2 ] | 0 ) == 16 ) e = ( f [ a + 164 >> 2 ] | 0 ) + (( f [ a + 200 >> 2 ] | 0 ) * 5640 | 0 ) | 0 ; else e = f [ a + 12 >> 2 ] | 0 ; e = f [ e + 5584 >> 2 ] | 0 ; c = a + 80 | 0 ; if (( f [( f [ c >> 2 ] | 0 ) + 16 >> 2 ] | 0 ) >>> 0 <= 1 ){ g = 1 ; l = h ; return g | 0 } d = e + 24 | 0 ; a = e + 804 | 0 ; g = e + 28 | 0 ; b = 1 ; while ( 1 ){ f [ e + 1104 >> 2 ] = f [ d >> 2 ]; f [ e + 1884 >> 2 ] = f [ a >> 2 ]; Ki ( e + 1108 | 0 , g | 0 , 776 ) | 0 ; b = b + 1 | 0 ; if ( b >>> 0 >= ( f [( f [ c >> 2 ] | 0 ) + 16 >> 2 ] | 0 ) >>> 0 ){ e = 1 ; break } else e = e + 1080 | 0 } l = h ; return e | 0 } function Wa ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; var e = 0 , g = 0 , h = 0 , i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 ; o = l ; l = l + 48 | 0 ; n = o + 32 | 0 ; m = o + 24 | 0 ; k = o + 16 | 0 ; g = o + 8 | 0 ; e = o ; j = o + 40 | 0 ; h = o + 36 | 0 ; f [ j >> 2 ] = c ; i = a + 80 | 0 ; do if (( f [( f [ i >> 2 ] | 0 ) + 16 >> 2 ] | 0 ) >>> 0 < 257 ){ if ( c ){ ld ( b , h , 1 ); g = b + 1 | 0 ; b = c +- 1 | 0 ; break } Pd ( d , 1 , 14129 , e ) | 0 ; n = 0 ; l = o ; return n | 0 } else { if ( c >>> 0 >= 2 ){ ld ( b , h , 2 ); g = b + 2 | 0 ; b = c +- 2 | 0 ; break } Pd ( d , 1 , 14129 , g ) | 0 ; n = 0 ; l = o ; return n | 0 } while ( 0 ); f [ j >> 2 ] = b ; e = f [ h >> 2 ] | 0 ; b = f [( f [ i >> 2 ] | 0 ) + 16 >> 2 ] | 0 ; if ( e >>> 0 >= b >>> 0 ){ f [ k >> 2 ] = e ; f [ k + 4 >> 2 ] = b ; Pd ( d , 1 , 14155 , k ) | 0 ; n = 0 ; l = o ; return n | 0 } if ( ! ( qb ( a , e , g , j , d ) | 0 )){ Pd ( d , 1 , 14129 , m ) | 0 ; n = 0 ; l = o ; return n | 0 } if ( ! ( f [ j >> 2 ] | 0 )){ n = 1 ; l = o ; return n | 0 } Pd ( d , 1 , 14129 , n ) | 0 ; n = 0 ; l = o ; return n | 0 } function Xa ( a , b , c , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; var g = 0 , h = 0 , i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , r = 0 , s = 0 , t = 0 , u = 0 ; t = l ; l = l + 16 | 0 ; h = t + 8 | 0 ; s = t + 12 | 0 ; r = f [( f [ a + 80 >> 2 ] | 0 ) + 16 >> 2 ] | 0 ; q = r >>> 0 < 257 ? 1 : 2 ; p = ( q << 1 ) + 5 | 0 ; g = ( c >>> 0 ) / ( p >>> 0 ) | 0 ; if (( g | 0 ) == 0 | (( c >>> 0 ) % ( p >>> 0 ) | 0 | 0 ) != 0 ){ Pd ( e , 1 , 14085 , t ) | 0 ; s = 0 ; l = t ; return s | 0 } if (( f [ a + 8 >> 2 ] | 0 ) == 16 ) p = ( f [ a + 164 >> 2 ] | 0 ) + (( f [ a + 200 >> 2 ] | 0 ) * 5640 | 0 ) | 0 ; else p = f [ a + 12 >> 2 ] | 0 ; c = p + 5636 | 0 ; a = d [ c >> 0 ] | 0 ; if ( ! ( a & 4 )) o = 0 ; else o = ( f [ p + 420 >> 2 ] | 0 ) + 1 | 0 ; n = o + g | 0 ; if ( n >>> 0 > 31 ){ f [ h >> 2 ] = n ; Pd ( e , 1 , 14111 , h ) | 0 ; s = 0 ; l = t ; return s | 0 } d [ c >> 0 ] = a | 4 ; if ( o >>> 0 < n >>> 0 ){ e = q + 1 | 0 ; m = p + 8 | 0 ; h = q + 3 | 0 ; i = q | 4 ; j = i + q | 0 ; k = j + 1 | 0 ; a = b ; g = o ; c = p + 424 + ( o * 148 | 0 ) | 0 ; while ( 1 ){ ld ( a , c , 1 ); ld ( a + 1 | 0 , c + 4 | 0 , q ); b = c + 8 | 0 ; ld ( a + e | 0 , b , 2 ); u = f [ b >> 2 ] | 0 ; o = f [ m >> 2 ] | 0 ; f [ b >> 2 ] = u >>> 0 < o >>> 0 ? u : o ; ld ( a + h | 0 , c + 12 | 0 , 1 ); b = c + 16 | 0 ; ld ( a + i | 0 , b , q ); ld ( a + j | 0 , s , 1 ); f [ c + 36 >> 2 ] = f [ s >> 2 ]; o = f [ b >> 2 ] | 0 ; f [ b >> 2 ] = o >>> 0 < r >>> 0 ? o : r ; g = g + 1 | 0 ; if ( g >>> 0 >= n >>> 0 ) break ; else { a = a + k | 0 ; c = c + 148 | 0 }}} f [ p + 420 >> 2 ] = n +- 1 ; u = 1 ; l = t ; return u | 0 } function Ya ( a , b , c , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; g = g | 0 ; var h = 0 , i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , r = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 , B = 0 , C = 0 , D = 0 , E = 0 , G = 0 , H = 0 , I = 0 , J = 0 , K = 0 , L = 0 , M = 0 ; M = l ; l = l + 144 | 0 ; L = M + 128 | 0 ; H = M + 120 | 0 ; G = M + 112 | 0 ; E = M + 104 | 0 ; D = M + 96 | 0 ; C = M + 88 | 0 ; A = M + 72 | 0 ; t = M + 64 | 0 ; r = M + 56 | 0 ; q = M + 48 | 0 ; p = M + 40 | 0 ; s = M + 32 | 0 ; k = M + 24 | 0 ; i = M + 16 | 0 ; h = M + 136 | 0 ; w = M + 132 | 0 ; J = f [ a + 80 >> 2 ] | 0 ; K = a + 88 | 0 ; if ( c >>> 0 < 36 ){ Pd ( g , 1 , 13440 , M ) | 0 ; g = 0 ; l = M ; return g | 0 } I = c +- 36 | 0 ; o = ( I >>> 0 ) / 3 | 0 ; if (( I >>> 0 ) % 3 | 0 ){ Pd ( g , 1 , 13440 , M + 8 | 0 ) | 0 ; g = 0 ; l = M ; return g | 0 } ld ( b , h , 2 ); e [ K >> 1 ] = f [ h >> 2 ]; x = J + 8 | 0 ; ld ( b + 2 | 0 , x , 4 ); B = J + 12 | 0 ; ld (
y = l ; l = l + 80 | 0 ; w = y + 8 | 0 ; v = y ; u = y + 16 | 0 ; x = b + 8 | 0 ; d = f [ x >> 2 ] | 0 ; b = f [ d >> 2 ] | 0 ; t = e [ d + 4 >> 1 ] | 0 ; if ( t << 16 >> 16 ){ s = a + 16 | 0 ; o = a + 24 | 0 ; q = 1 ; r = 0 ; while ( 1 ){ p = e [ b + ( r * 6 | 0 ) >> 1 ] | 0 ; n = p & 65535 ; a = f [ s >> 2 ] | 0 ; a : do if ( n >>> 0 < a >>> 0 ){ d = e [ b + ( r * 6 | 0 ) + 4 >> 1 ] | 0 ; switch ( d << 16 >> 16 ){ case - 1 : case 0 : { e [( f [ o >> 2 ] | 0 ) + ( n * 52 | 0 ) + 48 >> 1 ] = e [ b + ( r * 6 | 0 ) + 2 >> 1 ] | 0 ; break a } default : {}} j = ( d & 65535 ) + 65535 | 0 ; m = j & 65535 ; j = j & 65535 ; if ( j >>> 0 >= a >>> 0 ){ f [ w >> 2 ] = j ; f [ w + 4 >> 2 ] = a ; Pd ( c , 2 , 19302 , w ) | 0 ; break } k = b + ( r * 6 | 0 ) + 2 | 0 ; if (( n | 0 ) != ( j | 0 ) ? ( e [ k >> 1 ] | 0 ) == 0 : 0 ){ d = f [ o >> 2 ] | 0 ; a = d + ( n * 52 | 0 ) | 0 ; g = u ; h = a ; i = g + 52 | 0 ; do { f [ g >> 2 ] = f [ h >> 2 ]; g = g + 4 | 0 ; h = h + 4 | 0 } while (( g | 0 ) < ( i | 0 )); g = a ; h = d + ( j * 52 | 0 ) | 0 ; i = g + 52 | 0 ; do { f [ g >> 2 ] = f [ h >> 2 ]; g = g + 4 | 0 ; h = h + 4 | 0 } while (( g | 0 ) < ( i | 0 )); g = ( f [ o >> 2 ] | 0 ) + ( j * 52 | 0 ) | 0 ; h = u ; i = g + 52 | 0 ; do { f [ g >> 2 ] = f [ h >> 2 ]; g = g + 4 | 0 ; h = h + 4 | 0 } while (( g | 0 ) < ( i | 0 )); if (( r + 1 & 65535 ) < ( t & 65535 )){ g = q ; do { d = b + ( g * 6 | 0 ) | 0 ; a = e [ d >> 1 ] | 0 ; if ( a << 16 >> 16 != p << 16 >> 16 ){ if ( a << 16 >> 16 == m << 16 >> 16 ) e [ d >> 1 ] = p } else e [ d >> 1 ] = m ; g = g + 1 | 0 } while (( g & 65535 ) << 16 >> 16 != t << 16 >> 16 )}} e [( f [ o >> 2 ] | 0 ) + ( n * 52 | 0 ) + 48 >> 1 ] = e [ k >> 1 ] | 0 } else { f [ v >> 2 ] = n ; f [ v + 4 >> 2 ] = a ; Pd ( c , 2 , 19262 , v ) | 0 } while ( 0 ); r = r + 1 | 0 ; if (( r & 65535 ) << 16 >> 16 == t << 16 >> 16 ) break ; else q = q + 1 | 0 } b = f [ x >> 2 ] | 0 ; d = b ; b = f [ b >> 2 ] | 0 } if ( ! b ){ w = d ; Pe ( w ); f [ x >> 2 ] = 0 ; l = y ; return } else { Pe ( b ); w = f [ x >> 2 ] | 0 ; Pe ( w ); f [ x >> 2 ] = 0 ; l = y ; return }} function Sb ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var d = 0 , e = 0 , g = 0 , h = 0 , i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , r = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 , B = 0 , C = 0 , D = 0 , E = 0 , G = 0 , H = 0 , I = 0 ; I = l ; l = l + 192 | 0 ; y = I + 152 | 0 ; x = I + 144 | 0 ; w = I + 136 | 0 ; v = I + 128 | 0 ; u = I + 120 | 0 ; D = I + 88 | 0 ; s = I + 80 | 0 ; q = I + 64 | 0 ; p = I + 48 | 0 ; G = I + 40 | 0 ; z = I + 32 | 0 ; E = I + 24 | 0 ; t = I + 16 | 0 ; r = I + 8 | 0 ; n = I + 176 | 0 ; o = I + 168 | 0 ; C = I + 156 | 0 ; d = Le ( 1 , 1024 ) | 0 ; if ( ! d ){ Pd ( c , 1 , 17098 , I ) | 0 ; H = 0 ; l = I ; return H | 0 } m = n + 4 | 0 ; A = C + 4 | 0 ; B = a + 100 | 0 ; k = 1024 ; a : while ( 1 ){ if (( Hd ( b , n , 8 , c ) | 0 ) != 8 ) break ; while ( 1 ){ ld ( n , C , 4 ); ld ( m , A , 4 ); switch ( f [ C >> 2 ] | 0 ){ case 0 : { e = Ld ( b ) | 0 ; j = F ; if (( j | 0 ) > 0 | ( j | 0 ) == 0 & e >>> 0 > 4294967287 ){ H = 6 ; break a } f [ C >> 2 ] = e + 8 ; i = 8 ; break } case 1 : { if (( Hd ( b , n , 8 , c ) | 0 ) != 8 ) break a ; ld ( n , o , 4 ); if ( f [ o >> 2 ] | 0 ){ H = 10 ; break a } ld ( m , C , 4 ); i = 16 ; break } default : i = 8 } g = f [ A >> 2 ] | 0 ; if (( g | 0 ) == 1785737827 ){ H = 13 ; break a } e = f [ C >> 2 ] | 0 ; if ( ! e ){ H = 17 ; break a } if ( e >>> 0 < i >>> 0 ){ H = 19 ; break a } if (( g | 0 ) == 1783636e3 ){ h = 1084 ; g = i ; H = 22 ; break } if (( g | 0 ) == 1718909296 ){ h = 1092 ; g = i ; H = 22 ; break } j = ( g | 0 ) == 1785737832 ; b : do if (( g | 0 ) != 1768449138 ) if (( g | 0 ) != 1668246642 ) if (( g | 0 ) != 1651532643 ) if (( g | 0 ) != 1885564018 ) if (( g | 0 ) != 1668112752 ){ h = ( g | 0 ) == 1667523942 ? 1148 : 0 ; e = e - i | 0 ; if (( g | 0 ) < 1785737832 ) switch ( g | 0 ){ case 1667523942 : { H = 30 ; break b } default : {}} else switch ( g | 0 ){ case 1785737832 : { H = 30 ; break b } default : {}} g = f [ B >> 2 ] | 0 ; if ( ! ( g & 1 )){ H = 45 ; break a } if ( ! ( g & 2 )){ H = 47 ; break a } f [ B >> 2 ] = g | 2147483647 ; j = Md ( b , e , 0 , c ) | 0 ; if ( ! (( j | 0 ) == ( e | 0 ) & ( F | 0 ) == 0 )){ H = 50 ; break a }} else { h = 1140 ; H = 28 } else { h = 1132 ; H = 28 } else { h = 1124 ; H = 28 } else { h = 1116 ; H = 28 } else { h = 1108 ; H = 28 } while ( 0 ); if (( H | 0 ) == 28 ){ e = e - i | 0 ; H = 30 } if (( H | 0 ) == 30 ){ H = 0 ; if ( j ){ h = 1100 ; break } f [ p >> 2 ] = g >>> 24 ; f [ p + 4 >> 2 ] = g >>> 16 & 255 ; f [ p + 8 >> 2 ] = g >>> 8 & 255 ; f [ p + 12 >> 2 ] = g & 255 ; Pd ( c , 2 , 17282 , p ) | 0 ; if ( f [ B >> 2 ] & 4 ) break ; j = f [ A >> 2 ] | 0 ; f [ q >> 2 ] = j >>> 24 ; f [ q + 4 >> 2 ] = j >>> 16 & 255 ; f [ q + 8 >> 2 ] = j >>> 8 & 255 ; f [ q + 12 >> 2 ] = j & 255 ; Pd ( c , 2 , 17333 , q ) | 0 ; f [ B >> 2 ] = f [ B >> 2 ] | 2147483647 ; j = Md ( b , e , 0 , c ) | 0 ; if ( ! (( j | 0 ) == ( e | 0 ) & ( F | 0 ) == 0 )){ H = 33 ; break a }} if (( Hd ( b , n , 8 , c ) | 0 ) != 8 ) break a } if (( H | 0 ) == 22 ){ H = 0 ; e = e - g | 0 } j = Ld ( b ) | 0 ; i = F ; if ( 0 > ( i | 0 ) | 0 == ( i | 0 ) & e >>> 0 > j >>> 0 ){ H = 35 ; break } if ( e >>> 0 > k >>> 0 ){ g = Oe ( d , e ) | 0 ; if ( ! g ){ H = 38 ; break } else { d = g ; g = e }} else g = k ; if (( Hd ( b , d , e , c ) | 0 ) != ( e | 0 )){ H = 40 ; break } if ( ! ( Aj [ f [ h + 4 >> 2 ] & 63 ]( a , d , e , c ) | 0 )){ H = 43 ; break } else k = g } switch ( H | 0 ){ case 6 : { Pd ( c , 1 , 17148 , r ) | 0 ; break } case 10 : { Pd ( c , 1 , 17148 , t ) | 0 ; break } case 13 : { e = f [ B >> 2 ] | 0 ; if ( ! ( e & 4 )){ Pd ( c , 1 , 17190 , E ) | 0 ; Pe ( d ); H = 0 ; l = I ; return H | 0 } else { f [ B >> 2 ] = e | 8 ; Pe ( d ); H = 1 ; l = I ; return H | 0 }} case 17 : { Pd ( c , 1 , 17218 , z ) | 0 ; Pe ( d ); H = 0 ; l = I ; return H | 0 } case 19 : { f [ G >> 2 ] = e ; f [ G + 4 >> 2 ] = g ; Pd ( c , 1 , 17256 , G ) | 0 ; Pe ( d ); H = 0 ; l = I ; return H | 0 } case 33 : { Pd ( c , 1 , 17399 , s ) | 0 ; Pe ( d ); H = 0 ; l = I ; return H | 0 } case 35 : { E = f [ C >> 2 ] | 0 ; G = f [ A >> 2 ] | 0 ; H = Ld ( b ) | 0 ; f [ D >> 2 ] = E ; f [ D + 4 >> 2 ] = G >>> 24 ; f [ D + 8 >> 2 ] = G >>> 16 & 255 ; f [ D + 12 >> 2 ] = G >>> 8 & 255 ; f [ D + 16 >> 2 ] = G & 255 ; f [ D + 20 >> 2 ] = e ; f [ D + 24 >> 2 ] = H ; Pd ( c , 1 , 17449 , D ) | 0 ; Pe ( d ); H = 0 ; l = I ; return H | 0 } case 38 : { Pe ( d ); Pd ( c , 1 , 17525 , u ) | 0 ; H = 0 ; l = I ; return H | 0 } case 40 : { Pd ( c , 1 , 17567 , v ) | 0 ; Pe ( d ); H = 0 ; l = I ; return H | 0 } case 43 : { Pe ( d ); H = 0 ; l = I ; return H | 0 } case 45 : { Pd ( c , 1 , 17616 , w ) | 0 ; Pe ( d ); H = 0 ; l = I ; return H | 0 } case 47 : { Pd ( c , 1 , 17686 , x ) | 0 ; Pe ( d ); H = 0 ; l = I ; return H | 0 } case 50 : { Pd ( c , 1 , 1
while ( 1 ){ x = f [ A >> 2 ] | 0 ; y = f [ A + 4 >> 2 ] | 0 ; z = f [ B + 4 >> 2 ] | 0 ; i = z >>> 0 > i >>> 0 ? z : i ; if ( z ){ v = ( C + y | 0 ) / ( y | 0 ) | 0 ; t = ( D + x | 0 ) / ( x | 0 ) | 0 ; r = ( E + y | 0 ) / ( y | 0 ) | 0 ; p = ( G + x | 0 ) / ( x | 0 ) | 0 ; p = Ii ( p | 0 ,(( p | 0 ) < 0 ) << 31 >> 31 | 0 , - 1 , - 1 ) | 0 ; q = F ; r = Ii ( r | 0 ,(( r | 0 ) < 0 ) << 31 >> 31 | 0 , - 1 , - 1 ) | 0 ; s = F ; t = Ii ( t | 0 ,(( t | 0 ) < 0 ) << 31 >> 31 | 0 , - 1 , - 1 ) | 0 ; u = F ; v = Ii ( v | 0 ,(( v | 0 ) < 0 ) << 31 >> 31 | 0 , - 1 , - 1 ) | 0 ; w = F ; b = 0 ; o = 0 ; while ( 1 ){ m = f [ B + 812 + ( o << 2 ) >> 2 ] | 0 ; n = f [ B + 944 + ( o << 2 ) >> 2 ] | 0 ; g = b +- 1 + z | 0 ; h = x << g + m ; O = y << n + g ; k = k >>> 0 < h >>> 0 ? k : h ; j = j >>> 0 < O >>> 0 ? j : O ; O = Hi ( 1 , 0 , g | 0 ) | 0 ; h = F ; b = Ii ( p | 0 , q | 0 , O | 0 , h | 0 ) | 0 ; b = Fi ( b | 0 , F | 0 , g | 0 ) | 0 ; e = Ii ( r | 0 , s | 0 , O | 0 , h | 0 ) | 0 ; e = Fi ( e | 0 , F | 0 , g | 0 ) | 0 ; a = Ii ( t | 0 , u | 0 , O | 0 , h | 0 ) | 0 ; a = Fi ( a | 0 , F | 0 , g | 0 ) | 0 ; h = Ii ( v | 0 , w | 0 , O | 0 , h | 0 ) | 0 ; g = Fi ( h | 0 , F | 0 , g | 0 ) | 0 ; h = Hi ( 1 , 0 , n | 0 ) | 0 ; h = Ii ( h | 0 , F | 0 , - 1 , - 1 ) | 0 ; h = Ii ( h | 0 , F | 0 , g | 0 ,(( g | 0 ) < 0 ) << 31 >> 31 | 0 ) | 0 ; h = Fi ( h | 0 , F | 0 , n | 0 ) | 0 ; if (( b | 0 ) == ( a | 0 )) b = 0 ; else { O = Hi ( 1 , 0 , m | 0 ) | 0 ; O = Ii ( O | 0 , F | 0 , - 1 , - 1 ) | 0 ; O = Ii ( O | 0 , F | 0 , a | 0 ,(( a | 0 ) < 0 ) << 31 >> 31 | 0 ) | 0 ; O = Fi ( O | 0 , F | 0 , m | 0 ) | 0 ; b = ( O << m ) - ( b >> m << m ) >> m } a = ba ( b ,( e | 0 ) == ( g | 0 ) ? 0 : ( h << n ) - ( e >> n << n ) >> n ) | 0 ; l = a >>> 0 > l >>> 0 ? a : l ; a = o + 1 | 0 ; if ( a >>> 0 < z >>> 0 ){ b =~ o ; o = a } else break }} H = H + 1 | 0 ; if ( H >>> 0 >= L >>> 0 ) break ; else { A = A + 52 | 0 ; B = B + 1080 | 0 }}} if ( d [ I + ( c * 5640 | 0 ) + 5636 >> 0 ] & 4 ){ Cc ( I , c , M , N , J , K , l , k , j ); return } e = ( f [ I + ( c * 5640 | 0 ) + 420 >> 2 ] | 0 ) + 1 | 0 ; if ( ! e ) return ; g = f [ I + ( c * 5640 | 0 ) + 8 >> 2 ] | 0 ; h = f [ I + ( c * 5640 | 0 ) + 4 >> 2 ] | 0 ; b = I + ( c * 5640 | 0 ) + 424 | 0 ; a = 0 ; while ( 1 ){ f [ b + 76 >> 2 ] = 0 ; f [ b + 92 >> 2 ] = L ; f [ b + 72 >> 2 ] = 0 ; f [ b + 88 >> 2 ] = i ; f [ b + 68 >> 2 ] = 0 ; f [ b + 84 >> 2 ] = g ; f [ b + 36 >> 2 ] = h ; f [ b + 80 >> 2 ] = 0 ; f [ b + 96 >> 2 ] = l ; f [ b + 100 >> 2 ] = M ; f [ b + 104 >> 2 ] = N ; f [ b + 108 >> 2 ] = J ; f [ b + 112 >> 2 ] = K ; f [ b + 116 >> 2 ] = k ; f [ b + 120 >> 2 ] = j ; a = a + 1 | 0 ; if (( a | 0 ) == ( e | 0 )) break ; else b = b + 148 | 0 } return } function zc ( a ){ a = a | 0 ; var b = 0 , c = 0 , g = 0 , h = 0 , i = 0 , j = 0 , k = 0 , l = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , r = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 , B = 0 , C = 0 , D = 0 , E = 0 , F = 0 , G = 0 , H = 0 , I = 0 , J = 0 , K = 0 , L = 0 , M = 0 , N = 0 , O = 0 , P = 0 , Q = 0 , R = 0 , S = 0 , T = 0 , U = 0 , V = 0 , W = 0 , X = 0 , Y = 0 , Z = 0 , $ = 0 , _ = 0 , aa = 0 , ca = 0 , da = 0 , ea = 0 , fa = 0 , ga = 0 , ha = 0 , ia = 0 , ja = 0 , ka = 0 , la = 0 , ma = 0 , na = 0 , oa = 0 , pa = 0 , qa = 0 , ra = 0 , sa = 0 , ta = 0 , ua = 0 , va = 0 , wa = 0 , xa = 0 , ya = 0 , za = 0 , Aa = 0 , Ba = 0 , Ca = 0 , Da = 0 , Ea = 0 , Fa = 0 , Ga = 0 , Ha = 0 , Ia = 0 , Ja = 0 , Ka = 0 , La = 0 , Ma = 0 , Na = 0 , Oa = 0 , Pa = 0 , Qa = 0 , Ra = 0 , Sa = 0 , Ta = 0 , Ua = 0 , Va = 0 , Wa = 0 , Xa = 0 , Ya = 0 , Za = 0 , $a = 0 , _a = 0 , ab = 0 , bb = 0 , cb = 0 , db = 0 , eb = 0 , fb = 0 , gb = 0 , hb = 0 , ib = 0 , jb = 0 , kb = 0 , lb = 0 , mb = 0 , nb = 0 ; switch ( f [ a + 80 >> 2 ] | 0 ){ case 0 : { b = a + 40 | 0 ; if ( ! ( f [ b >> 2 ] | 0 )){ E = a + 32 | 0 ; l = E ; E = f [ E >> 2 ] | 0 ; c = 18 } else { f [ b >> 2 ] = 0 ; t = f [ a + 64 >> 2 ] | 0 ; f [ a + 36 >> 2 ] = t ; c = 5 } while ( 1 ){ if (( c | 0 ) == 5 ){ if ( t >>> 0 >= ( f [ a + 52 >> 2 ] | 0 ) >>> 0 ){ nb = 0 ; c = 153 ; break } z = f [ a + 44 >> 2 ] | 0 ; f [ a + 28 >> 2 ] = z ; c = 7 } else if (( c | 0 ) == 18 ){ j = E + 1 | 0 ; f [ l >> 2 ] = j ; h = l ; c = 14 } while ( 1 ){ if (( c | 0 ) == 7 ){ c = 0 ; if ( z >>> 0 >= ( f [ a + 56 >> 2 ] | 0 ) >>> 0 ){ c = 21 ; break } A = f [ a + 48 >> 2 ] | 0 ; p = a + 24 | 0 ; f [ p >> 2 ] = A } else if (( c | 0 ) == 14 ){ if ( j >>> 0 < ( f [ a + 72 >> 2 ] | 0 ) >>> 0 ){ c = 16 ; break } F = a + 24 | 0 ; n = F ; F = f [ F >> 2 ] | 0 ; c = 19 } while ( 1 ){ if (( c | 0 ) == 19 ){ c = 0 ; A = F + 1 | 0 ; f [ n >> 2 ] = A ; p = n } if ( A >>> 0 >= ( f [ a + 60 >> 2 ] | 0 ) >>> 0 ){ c = 20 ; break } B = f [ a + 196 >> 2 ] | 0 ; C = f [ a + 28 >> 2 ] | 0 ; if ( C >>> 0 < ( f [ B + ( A << 4 ) + 8 >> 2 ] | 0 ) >>> 0 ) break ; else { n = p ; F = A ; c = 19 }} if (( c | 0 ) == 20 ){ c = a + 28 | 0 ; z = ( f [ c >> 2 ] | 0 ) + 1 | 0 ; f [ c >> 2 ] = z ; c = 7 ; continue } b = f [ B + ( A << 4 ) + 12 >> 2 ] | 0 ; if ( ! ( d [ a >> 0 ] | 0 )) f [ a + 72 >> 2 ] = ba ( f [ b + ( C << 4 ) + 12 >> 2 ] | 0 , f [ b + ( C << 4 ) + 8 >> 2 ] | 0 ) | 0 ; j = f [ a + 68 >> 2 ] | 0 ; h = a + 32 | 0 ; f [ h >> 2 ] = j ; c = 14 } if (( c | 0 ) == 16 ){ c = 0 ; D = ba ( f [ a + 8 >> 2 ] | 0 , f [ a + 36 >> 2 ] | 0 ) | 0 ; D = ( ba ( f [ a + 12 >> 2 ] | 0 , f [ a + 28 >> 2 ] | 0 ) | 0 ) + D | 0 ; D = D + ( ba ( f [ a + 16 >> 2 ] | 0 , f [ a + 24 >> 2 ] | 0 ) | 0 ) | 0 ; D = D + ( ba ( f [ a + 20 >> 2 ] | 0 , j ) | 0 ) | 0 ; D = ( f [ a + 4 >> 2 ] | 0 ) + ( D << 1 ) | 0 ; if ( ! ( e [ D >> 1 ] | 0 )) break ; else { l = h ; E = j ; c = 18 ; continue }} else if (( c | 0 ) == 21 ){ c = a + 36 | 0 ; t = ( f [ c >> 2 ] | 0 ) + 1 | 0 ; f [ c >> 2 ] = t ; c = 5 ; continue }} if (( c | 0 ) == 153 ) return nb | 0 ; e [ D >> 1 ] = 1 ; a = 1 ; return a | 0 } case 1 : { b = a + 40 | 0 ; if ( ! ( f [ b >> 2 ] | 0 )){ x = a + 32 | 0 ; k = x ; x = f [ x >> 2 ] | 0 ; c = 38 } else { f [ b >> 2 ] = 0 ; G = f [ a + 44 >> 2 ] | 0 ; f [ a + 28 >> 2 ] = G ; c = 25 } while ( 1 ){ if (( c | 0 ) == 25 ){ if ( G >>> 0 >= ( f [ a + 56 >> 2 ] | 0 ) >>> 0 ){ nb = 0 ; c = 153 ; break } r = f [ a + 64 >> 2 ] | 0 ; f [ a + 36 >> 2 ] = r ; c = 27 } else if (( c | 0 ) == 38 ){ i = x + 1 | 0 ; f [ k >> 2 ] = i ; g = k ; c = 34 } while ( 1 ){ if (( c | 0 ) == 27 ){ c = 0 ; if ( r >>> 0 >= ( f [ a + 52 >> 2 ] | 0 ) >>> 0 ){ c = 41 ; break } s = f [ a + 48 >> 2 ] | 0 ; o = a + 24 | 0 ; f [ o >> 2 ] = s } else if (( c | 0 ) == 34 ){ if ( i >>> 0 < ( f [ a + 72 >> 2 ] | 0 ) >>> 0 ){ c = 36 ; break } y = a + 24 | 0 ; m = y ; y = f [ y >> 2 ] | 0 ; c = 39 } while ( 1 ){ if (( c | 0 ) == 39 ){ c = 0 ; s = y + 1 | 0 ; f [ m >> 2 ] = s ; o = m } if ( s >>> 0 >= ( f [ a + 60 >> 2 ] | 0 ) >>> 0 ){ c = 40 ; break } u = f [ a + 196 >> 2 ] | 0 ; v = f [ a + 28 >> 2 ] | 0 ; if ( v >>> 0 < ( f [ u + ( s << 4 ) + 8 >> 2 ] | 0 ) >>> 0 ) break ; else { m = o ; y = s ; c = 39 }} if (( c | 0 ) == 40 ){ c = a + 36 | 0 ; r = ( f [ c >> 2 ] | 0 ) + 1 | 0 ; f [ c >> 2 ] = r ; c = 27 ; continue } b = f [ u + ( s << 4 ) + 12 >> 2 ] | 0 ; if ( ! ( d [ a >> 0 ] | 0 )) f [ a + 72 >> 2 ] = ba ( f [ b + ( v << 4 ) + 12 >> 2 ] | 0 , f [ b + ( v << 4 ) + 8 >> 2 ] | 0 ) | 0 ; i = f [ a + 68 >> 2 ] | 0 ; g = a + 32 | 0 ; f [ g >> 2 ] = i ; c = 34 } if (( c | 0 ) == 36 ){ c =
} else if (( a | 0 ) == 49 ){ l = u ; return d | 0 }} while ( 0 ); i = f [ p >> 2 ] | 0 ; a = f [ d + 20 >> 2 ] | 0 ; h = f [ i + 16 >> 2 ] | 0 ; do if ( h ){ b = ba (( f [ a + 12 >> 2 ] | 0 ) - ( f [ a + 4 >> 2 ] | 0 ) | 0 ,( f [ a + 8 >> 2 ] | 0 ) - ( f [ a >> 2 ] | 0 ) | 0 ) | 0 ; c = d + 16 | 0 ; d = f [ c >> 2 ] | 0 ; if ( d >>> 0 <= 2 ){ f [ m >> 2 ] = d ; Pd ( g , 1 , 19703 , m ) | 0 ; break } if (( ba (( f [ a + 64 >> 2 ] | 0 ) - ( f [ a + 56 >> 2 ] | 0 ) | 0 ,( f [ a + 60 >> 2 ] | 0 ) - ( f [ a + 52 >> 2 ] | 0 ) | 0 ) | 0 ) >= ( b | 0 ) ? ( ba (( f [ a + 116 >> 2 ] | 0 ) - ( f [ a + 108 >> 2 ] | 0 ) | 0 ,( f [ a + 112 >> 2 ] | 0 ) - ( f [ a + 104 >> 2 ] | 0 ) | 0 ) | 0 ) >= ( b | 0 ) : 0 ){ if (( h | 0 ) != 2 ){ d = f [ a + 32 >> 2 ] | 0 ; if (( f [( f [ i + 5584 >> 2 ] | 0 ) + 20 >> 2 ] | 0 ) == 1 ){ oc ( d , f [ a + 84 >> 2 ] | 0 , f [ a + 136 >> 2 ] | 0 , b ); break } else { qc ( d , f [ a + 84 >> 2 ] | 0 , f [ a + 136 >> 2 ] | 0 , b ); break }} e = i + 5604 | 0 ; if ( ! ( f [ e >> 2 ] | 0 )) break ; i = Ke ( d << 2 ) | 0 ; if ( ! i ){ t = 0 ; l = u ; return t | 0 } d = f [ c >> 2 ] | 0 ; if ( ! d ) d = 0 ; else { h = 0 ; while ( 1 ){ f [ i + ( h << 2 ) >> 2 ] = f [ a + 32 >> 2 ]; h = h + 1 | 0 ; if (( h | 0 ) == ( d | 0 )) break ; else a = a + 52 | 0 }} t = ( sc ( f [ e >> 2 ] | 0 , b , i , d , f [( f [( f [ o >> 2 ] | 0 ) + 24 >> 2 ] | 0 ) + 32 >> 2 ] | 0 ) | 0 ) == 0 ; Pe ( i ); if ( t ) d = 0 ; else break ; l = u ; return d | 0 } Pd ( g , 1 , 19642 , k ) | 0 ; t = 0 ; l = u ; return t | 0 } while ( 0 ); d = f [ f [ n >> 2 ] >> 2 ] | 0 ; s = d + 16 | 0 ; if ( ! ( f [ s >> 2 ] | 0 )){ t = 1 ; l = u ; return t | 0 } t = 0 ; r = f [( f [ o >> 2 ] | 0 ) + 24 >> 2 ] | 0 ; q = f [( f [ p >> 2 ] | 0 ) + 5584 >> 2 ] | 0 ; p = f [ d + 20 >> 2 ] | 0 ; while ( 1 ){ o = f [ p + 24 >> 2 ] | 0 ; g = f [ r + 36 >> 2 ] | 0 ; h = f [ o + ( g * 136 | 0 ) + 8 >> 2 ] | 0 ; i = f [ o + ( g * 136 | 0 ) >> 2 ] | 0 ; n = h - i | 0 ; e = f [ o + ( g * 136 | 0 ) + 12 >> 2 ] | 0 ; g = f [ o + ( g * 136 | 0 ) + 4 >> 2 ] | 0 ; o = ( f [ p + 8 >> 2 ] | 0 ) - ( f [ p >> 2 ] | 0 ) - n | 0 ; d = f [ r + 24 >> 2 ] | 0 ; if ( ! ( f [ r + 32 >> 2 ] | 0 )){ d = 1 << d ; m = 0 } else { m = 1 << d +- 1 ; d = m ; m = 0 - m | 0 } k = d +- 1 | 0 ; d = f [ p + 32 >> 2 ] | 0 ; a = ( e | 0 ) == ( g | 0 ); if (( f [ q + 20 >> 2 ] | 0 ) == 1 ){ if ( ! a ){ c = ( h | 0 ) == ( i | 0 ); b = q + 1076 | 0 ; i = e - g | 0 ; e = 0 ; while ( 1 ){ if ( ! c ){ a = 0 ; h = d ; while ( 1 ){ g = ( f [ b >> 2 ] | 0 ) + ( f [ h >> 2 ] | 0 ) | 0 ; f [ h >> 2 ] = ( g | 0 ) < ( m | 0 ) ? m : ( g | 0 ) > ( k | 0 ) ? k : g ; a = a + 1 | 0 ; if (( a | 0 ) == ( n | 0 )) break ; else h = h + 4 | 0 } d = d + ( n << 2 ) | 0 } e = e + 1 | 0 ; if (( e | 0 ) == ( i | 0 )) break ; else d = d + ( o << 2 ) | 0 }}} else if ( ! a ){ c = ( h | 0 ) == ( i | 0 ); b = q + 1076 | 0 ; i = e - g | 0 ; e = 0 ; while ( 1 ){ if ( ! c ){ a = 0 ; h = d ; while ( 1 ){ g = xh ( + j [ h >> 2 ]) | 0 ; g = ( f [ b >> 2 ] | 0 ) + g | 0 ; f [ h >> 2 ] = ( g | 0 ) < ( m | 0 ) ? m : ( g | 0 ) > ( k | 0 ) ? k : g ; a = a + 1 | 0 ; if (( a | 0 ) == ( n | 0 )) break ; else h = h + 4 | 0 } d = d + ( n << 2 ) | 0 } e = e + 1 | 0 ; if (( e | 0 ) == ( i | 0 )) break ; else d = d + ( o << 2 ) | 0 }} t = t + 1 | 0 ; if ( t >>> 0 >= ( f [ s >> 2 ] | 0 ) >>> 0 ){ d = 1 ; break } else { r = r + 52 | 0 ; q = q + 1080 | 0 ; p = p + 52 | 0 }} l = u ; return d | 0 } function Qc ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var g = 0 , h = 0 , i = 0 , j = 0 , k = 0 , l = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 ; q = a + 24 | 0 ; m = f [ q >> 2 ] | 0 ; h = f [ m + 16 >> 2 ] | 0 ; l = ( h | 0 ) == 0 ; if ( l ){ q = 1 ; return q | 0 } i = 0 ; g = 0 ; j = f [ m + 24 >> 2 ] | 0 ; k = f [( f [ f [ a + 20 >> 2 ] >> 2 ] | 0 ) + 20 >> 2 ] | 0 ; while ( 1 ){ n = f [ j + 24 >> 2 ] | 0 ; n = (( n & 7 | 0 ) != 0 & 1 ) + ( n >>> 3 ) | 0 ; o = f [ k + 24 >> 2 ] | 0 ; p = ( f [ k + 20 >> 2 ] | 0 ) +- 1 | 0 ; g = ( ba ( ba (( n | 0 ) == 3 ? 4 : n ,( f [ o + ( p * 136 | 0 ) + 8 >> 2 ] | 0 ) - ( f [ o + ( p * 136 | 0 ) >> 2 ] | 0 ) | 0 ) | 0 ,( f [ o + ( p * 136 | 0 ) + 12 >> 2 ] | 0 ) - ( f [ o + ( p * 136 | 0 ) + 4 >> 2 ] | 0 ) | 0 ) | 0 ) + g | 0 ; i = i + 1 | 0 ; if (( i | 0 ) == ( h | 0 )) break ; else { j = j + 52 | 0 ; k = k + 52 | 0 }} g = g >>> 0 > c >>> 0 ; if ( g | l ){ q = g & 1 ^ 1 ; return q | 0 } p = 0 ; o = f [ m + 24 >> 2 ] | 0 ; n = f [( f [ f [ a + 20 >> 2 ] >> 2 ] | 0 ) + 20 >> 2 ] | 0 ; while ( 1 ){ l = f [ o + 24 >> 2 ] | 0 ; a = f [ n + 24 >> 2 ] | 0 ; c = f [ o + 36 >> 2 ] | 0 ; i = f [ a + ( c * 136 | 0 ) + 8 >> 2 ] | 0 ; j = f [ a + ( c * 136 | 0 ) >> 2 ] | 0 ; m = i - j | 0 ; k = f [ a + ( c * 136 | 0 ) + 12 >> 2 ] | 0 ; c = f [ a + ( c * 136 | 0 ) + 4 >> 2 ] | 0 ; a = ( f [ n + 8 >> 2 ] | 0 ) - ( f [ n >> 2 ] | 0 ) - m | 0 ; l = (( l & 7 | 0 ) != 0 & 1 ) + ( l >>> 3 ) | 0 ; a : do switch ((( l | 0 ) == 3 ? 4 : l ) | 0 ){ case 1 : { g = f [ n + 32 >> 2 ] | 0 ; h = ( k | 0 ) == ( c | 0 ); if ( ! ( f [ o + 32 >> 2 ] | 0 )){ if ( h ) break a ; l = ( i | 0 ) == ( j | 0 ); k = k - c | 0 ; c = 0 ; while ( 1 ){ if ( ! l ){ j = b + m | 0 ; i = 0 ; h = g ; while ( 1 ){ d [ b >> 0 ] = f [ h >> 2 ]; i = i + 1 | 0 ; if (( i | 0 ) == ( m | 0 )) break ; else { b = b + 1 | 0 ; h = h + 4 | 0 }} b = j ; g = g + ( m << 2 ) | 0 } c = c + 1 | 0 ; if (( c | 0 ) == ( k | 0 )) break ; else g = g + ( a << 2 ) | 0 }} else { if ( h ) break a ; l = ( i | 0 ) == ( j | 0 ); k = k - c | 0 ; c = 0 ; while ( 1 ){ if ( ! l ){ j = b + m | 0 ; i = 0 ; h = g ; while ( 1 ){ d [ b >> 0 ] = f [ h >> 2 ]; i = i + 1 | 0 ; if (( i | 0 ) == ( m | 0 )) break ; else { b = b + 1 | 0 ; h = h + 4 | 0 }} b = j ; g = g + ( m << 2 ) | 0 } c = c + 1 | 0 ; if (( c | 0 ) == ( k | 0 )) break ; else g = g + ( a << 2 ) | 0 }} break } case 2 : { g = f [ n + 32 >> 2 ] | 0 ; h = ( k | 0 ) == ( c | 0 ); if ( ! ( f [ o + 32 >> 2 ] | 0 )){ if ( ! h ){ l = ( i | 0 ) == ( j | 0 ); k = k - c | 0 ; c = 0 ; while ( 1 ){ if ( ! l ){ j = b + ( m << 1 ) | 0 ; i = 0 ; h = g ; while ( 1 ){ e [ b >> 1 ] = f [ h >> 2 ]; i = i + 1 | 0 ; if (( i | 0 ) == ( m | 0 )) break ; else { b = b + 2 | 0 ; h = h + 4 | 0 }} b = j ; g = g + ( m << 2 ) | 0 } c = c + 1 | 0 ; if (( c | 0 ) == ( k | 0 )) break ; else g = g + ( a << 2 ) | 0 }}} else if ( ! h ){ l = ( i | 0 ) == ( j | 0 ); k = k - c | 0 ; c = 0 ; while ( 1 ){ if ( ! l ){ j = b + ( m << 1 ) | 0 ; i = 0 ; h = g ; while ( 1 ){ e [ b >> 1 ] = f [ h >> 2 ]; i = i + 1 | 0 ; if (( i | 0 ) == ( m | 0 )) break ; else { b = b + 2 | 0 ; h = h + 4 | 0 }} b = j ; g = g + ( m << 2 ) | 0 } c = c + 1 | 0 ; if (( c | 0 ) == ( k | 0 )) break ; else g = g + ( a << 2 ) | 0 }} break } case 4 : { if (( k | 0 ) != ( c | 0 )){ l = ( i | 0 ) == ( j | 0 ); k = k - c | 0 ; c = 0 ; g = f [ n + 32 >> 2 ] | 0 ; while ( 1 ){ if ( ! l ){ j = b + ( m << 2 ) | 0 ; i = 0 ; h = g ; while ( 1 ){ f [ b >> 2 ] = f [ h >> 2 ]; i = i + 1 | 0 ; if (( i | 0 ) == ( m | 0 )) break ; else { b = b + 4 | 0 ; h = h + 4 | 0 }} b = j ; g = g + ( m << 2 ) | 0 } c = c + 1 | 0 ; if (( c | 0 ) == ( k | 0 )) break ; else g = g + ( a << 2 ) | 0 }} break } default : {}} while ( 0 ); p = p + 1 | 0 ; if ( p >>> 0 >= ( f [( f [ q >> 2 ] | 0 ) + 16 >> 2 ] | 0 ) >>> 0 ){ b = 1 ; break } else { o = o
f [ b + 16 >> 2 ] = 11 ; f [ b >> 2 ] = 34 ; f [ b + 20 >> 2 ] = 1 ; f [ b + 24 >> 2 ] = 5 ; f [ b + 8 >> 2 ] = 1 ; f [ b + 12 >> 2 ] = 1 ; f [ b + 28 >> 2 ] = 1 ; f [ b + 32 >> 2 ] = 1 ; f [ b + 36 >> 2 ] = 12 ; a = af () | 0 ; f [ b + 40 >> 2 ] = a ; if ( ! a ){ Pe ( b ); a = 0 ; return a | 0 } break } case 2 : { f [ b + 72 >> 2 ] = 14 ; f [ b + 76 >> 2 ] = 4 ; f [ b + 80 >> 2 ] = 5 ; f [ b + 4 >> 2 ] = 35 ; f [ b + 16 >> 2 ] = 13 ; f [ b >> 2 ] = 36 ; f [ b + 8 >> 2 ] = 2 ; f [ b + 12 >> 2 ] = 2 ; f [ b + 20 >> 2 ] = 2 ; f [ b + 24 >> 2 ] = 6 ; f [ b + 28 >> 2 ] = 2 ; f [ b + 32 >> 2 ] = 2 ; f [ b + 36 >> 2 ] = 14 ; a = Kb ( 1 ) | 0 ; f [ b + 40 >> 2 ] = a ; if ( ! a ){ Pe ( b ); a = 0 ; return a | 0 } break } default : { Pe ( b ); a = 0 ; return a | 0 }} Qd ( b + 44 | 0 ); a = b ; return a | 0 } function ce ( a ){ a = a | 0 ; if ( ! a ) return ; Gi ( a | 0 , 0 , 8248 ) | 0 ; f [ a + 8200 >> 2 ] =- 1 ; f [ a + 8204 >> 2 ] =- 1 ; f [ a + 8248 >> 2 ] = 0 ; return } function de ( a , b ){ a = a | 0 ; b = b | 0 ; var c = 0 ; c = l ; l = l + 16 | 0 ; if ( ! (( a | 0 ) != 0 & ( b | 0 ) != 0 )){ b = 0 ; l = c ; return b | 0 } if ( ! ( f [ a + 68 >> 2 ] | 0 )){ Pd ( a + 44 | 0 , 1 , 4709 , c ) | 0 ; b = 0 ; l = c ; return b | 0 } else { vj [ f [ a + 24 >> 2 ] & 7 ]( f [ a + 40 >> 2 ] | 0 , b ); b = 1 ; l = c ; return b | 0 } return 0 } function ee ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var d = 0 ; d = l ; l = l + 16 | 0 ; if ( ! (( a | 0 ) != 0 & ( b | 0 ) != 0 )){ a = 0 ; l = d ; return a | 0 } if ( ! ( f [ b + 68 >> 2 ] | 0 )){ Pd ( b + 44 | 0 , 1 , 4790 , d ) | 0 ; a = 0 ; l = d ; return a | 0 } else { a = Aj [ f [ b >> 2 ] & 63 ]( a , f [ b + 40 >> 2 ] | 0 , c , b + 44 | 0 ) | 0 ; l = d ; return a | 0 } return 0 } function fe ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; if ( ! (( a | 0 ) != 0 & ( b | 0 ) != 0 )){ b = 0 ; return b | 0 } if ( ! ( f [ a + 68 >> 2 ] | 0 )){ b = 0 ; return b | 0 } b = Aj [ f [ a + 4 >> 2 ] & 63 ]( f [ a + 40 >> 2 ] | 0 , b , c , a + 44 | 0 ) | 0 ; return b | 0 } function ge ( a , b , c , d , e , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; g = g | 0 ; if ( ! a ){ d = 0 ; return d | 0 } if ( ! ( f [ a + 68 >> 2 ] | 0 )){ d = 0 ; return d | 0 } d = rj [ f [ a + 28 >> 2 ] & 3 ]( f [ a + 40 >> 2 ] | 0 , b , c , d , e , g , a + 44 | 0 ) | 0 ; return d | 0 } function he ( a , b , c , d , e , g , h , i , j , k ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; g = g | 0 ; h = h | 0 ; i = i | 0 ; j = j | 0 ; k = k | 0 ; if ( ! (( c | 0 ) != 0 & (( a | 0 ) != 0 & ( b | 0 ) != 0 & ( d | 0 ) != 0 ))){ i = 0 ; return i | 0 } if ( ! ( f [ a + 68 >> 2 ] | 0 )){ i = 0 ; return i | 0 } i = zj [ f [ a + 8 >> 2 ] & 3 ]( f [ a + 40 >> 2 ] | 0 , c , d , e , g , h , i , j , k , b , a + 44 | 0 ) | 0 ; return i | 0 } function ie ( a , b , c , d , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; if ( ! (( a | 0 ) != 0 & ( c | 0 ) != 0 & ( e | 0 ) != 0 )){ b = 0 ; return b | 0 } if ( ! ( f [ a + 68 >> 2 ] | 0 )){ b = 0 ; return b | 0 } b = wj [ f [ a + 12 >> 2 ] & 7 ]( f [ a + 40 >> 2 ] | 0 , b , c , d , e , a + 44 | 0 ) | 0 ; return b | 0 } function je ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; if ( ! (( a | 0 ) != 0 & ( b | 0 ) != 0 )){ d = 0 ; return d | 0 } if ( ! ( f [ a + 68 >> 2 ] | 0 )){ d = 0 ; return d | 0 } d = Cj [ f [ a + 32 >> 2 ] & 3 ]( f [ a + 40 >> 2 ] | 0 , b , c , a + 44 | 0 , d ) | 0 ; return d | 0 } function ke ( a , b ){ a = a | 0 ; b = b | 0 ; if ( ! a ){ b = 0 ; return b | 0 } b = sj [ f [ a + 36 >> 2 ] & 63 ]( f [ a + 40 >> 2 ] | 0 , b , a + 44 | 0 ) | 0 ; return b | 0 } function le ( a ){ a = a | 0 ; var b = 0 ; b = Le ( 1 , 84 ) | 0 ; if ( ! b ){ a = 0 ; return a | 0 } f [ b + 68 >> 2 ] = 0 ; switch ( a | 0 ){ case 0 : { f [ b + 4 >> 2 ] = 15 ; f [ b + 12 >> 2 ] = 16 ; f [ b >> 2 ] = 37 ; f [ b + 8 >> 2 ] = 3 ; f [ b + 16 >> 2 ] = 1 ; f [ b + 20 >> 2 ] = 38 ; a = Se () | 0 ; f [ b + 40 >> 2 ] = a ; if ( ! a ){ Pe ( b ); a = 0 ; return a | 0 } break } case 2 : { f [ b + 4 >> 2 ] = 17 ; f [ b + 12 >> 2 ] = 18 ; f [ b >> 2 ] = 39 ; f [ b + 8 >> 2 ] = 4 ; f [ b + 16 >> 2 ] = 2 ; f [ b + 20 >> 2 ] = 40 ; a = Kb ( 0 ) | 0 ; f [ b + 40 >> 2 ] = a ; if ( ! a ){ Pe ( b ); a = 0 ; return a | 0 } break } default : { Pe ( b ); a = 0 ; return a | 0 }} Qd ( b + 44 | 0 ); a = b ; return a | 0 } function me ( a ){ a = a | 0 ; if ( ! a ) return ; Gi ( a | 0 , 0 , 18708 ) | 0 ; f [ a + 5592 >> 2 ] = 6 ; f [ a + 18684 >> 2 ] = 0 ; f [ a + 5596 >> 2 ] = 64 ; f [ a + 5600 >> 2 ] = 64 ; f [ a + 44 >> 2 ] = 0 ; f [ a + 5612 >> 2 ] =- 1 ; f [ a + 18188 >> 2 ] = 1 ; f [ a + 18192 >> 2 ] = 1 ; d [ a + 18688 >> 0 ] = 0 ; f [ a + 18196 >> 2 ] =- 1 ; f [ a + 18200 >> 2 ] =- 1 ; j [ a + 4792 >> 2 ] = 0.0 ; f [ a + 4788 >> 2 ] = 0 ; f [ a + 20 >> 2 ] = 0 ; f [ a + 24 >> 2 ] = 0 ; f [ a + 28 >> 2 ] = 0 ; f [ a + 18692 >> 2 ] = 0 ; return } function ne ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; if ( ! (( a | 0 ) != 0 & ( b | 0 ) != 0 & ( c | 0 ) != 0 )){ b = 0 ; return b | 0 } if ( f [ a + 68 >> 2 ] | 0 ){ b = 0 ; return b | 0 } b = Aj [ f [ a + 20 >> 2 ] & 63 ]( f [ a + 40 >> 2 ] | 0 , b , c , a + 44 | 0 ) | 0 ; return b | 0 } function oe ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; if ( ! (( a | 0 ) != 0 & ( c | 0 ) != 0 )){ c = 0 ; return c | 0 } if ( f [ a + 68 >> 2 ] | 0 ){ c = 0 ; return c | 0 } c = Aj [ f [ a >> 2 ] & 63 ]( f [ a + 40 >> 2 ] | 0 , c , b , a + 44 | 0 ) | 0 ; return c | 0 } function pe ( a , b ){ a = a | 0 ; b = b | 0 ; if ( ! (( a | 0 ) != 0 & ( b | 0 ) != 0 )){ b = 0 ; return b | 0 } if ( f [ a + 68 >> 2 ] | 0 ){ b = 0 ; return b | 0 } b = sj [ f [ a + 4 >> 2 ] & 63 ]( f [ a + 40 >> 2 ] | 0 , b , a + 44 | 0 ) | 0 ; return b | 0 } function qe ( a , b ){ a = a | 0 ; b = b | 0 ; if ( ! (( a | 0 ) != 0 & ( b | 0 ) != 0 )){ b = 0 ; return b | 0 } if ( f [ a + 68 >> 2 ] | 0 ){ b = 0 ; return b | 0 } b = sj [ f [ a + 12 >> 2 ] & 63 ]( f [ a + 40 >> 2 ] | 0 , b , a + 44 | 0 ) | 0 ; return b | 0 } function re ( a , b ){ a = a | 0 ; b = b | 0 ; if ( ! (( a | 0 ) != 0 & ( b | 0 ) != 0 )){ b = 0 ; return b | 0 } if ( ! ( f [ a + 68 >> 2 ] | 0 )){ b = 0 ; return b | 0 } b = sj [ f [ a + 16 >> 2 ] & 63 ]( f [ a + 40 >> 2 ] | 0 , b , a + 44 | 0 ) | 0 ; return b | 0 } function se ( a , b , c , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; g = g | 0 ; var i = 0 , j = 0 , k = 0 ; k = g << 2 ; i = ba ( k , g ) | 0 ; j = a + 18704 | 0 ; g = h [ j >> 1 ] | 0 ; e [ j >> 1 ] = ( g & 32768 | 0 ) == 0 ?- 32512 : ( g | 256 ) & 65535 ; f [ a + 5608 >> 2 ] = 1 ; d [ a + 18690 >> 0 ] = 2 ; j = Ke ( i + k | 0 ) | 0 ; g = a + 18696 | 0 ; f [ g >> 2 ] = j ; if ( ! j ){ c = 0 ; return c | 0 } Ki ( j | 0 , b | 0 , i | 0 ) | 0 ; Ki (( f [ g >> 2 ] | 0 ) + i | 0 , c | 0 , k | 0 ) | 0 ; c = 1 ; return c | 0 } function te ( a , b , c , d , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; if ( ! (( c | 0 ) != 0 & (( a | 0 ) != 0 & ( e | 0 ) != 0 ))){ b = 0 ; return b | 0 } if ( f [ a + 68 >> 2
Pe ( f [ s + ( w << 3 ) >> 2 ] | 0 ); s = f [ x >> 2 ] | 0 ; f [ s + ( w << 3 ) >> 2 ] = 0 ; f [ s + ( w << 3 ) + 4 >> 2 ] = 0 ; r = f [ B >> 2 ] | 0 ; p = s } w = w + 1 | 0 ; if ( w >>> 0 >= r >>> 0 ) break ; else v = s }} f [ B >> 2 ] = 0 ; Pe ( p ); f [ x >> 2 ] = 0 ; f [ A + ( q * 5640 | 0 ) + 5168 >> 2 ] = f [ z >> 2 ]; f [ A + ( q * 5640 | 0 ) + 5176 >> 2 ] = f [ y >> 2 ]; q = f [ t >> 2 ] | 0 } p = a + 204 | 0 ; if ( ! ( Mc ( f [ p >> 2 ] | 0 , q , o ) | 0 )){ Pd ( o , 1 , 8839 , Ba ) | 0 ; o = 0 ; l = Da ; return o | 0 } else { Ba = ba ( f [ a + 112 >> 2 ] | 0 , f [ a + 116 >> 2 ] | 0 ) | 0 ; f [ Ca >> 2 ] = ( f [ t >> 2 ] | 0 ) + 1 ; f [ Ca + 4 >> 2 ] = Ba ; Pd ( o , 4 , 8873 , Ca ) | 0 ; f [ b >> 2 ] = f [ t >> 2 ]; f [ m >> 2 ] = 1 ; f [ c >> 2 ] = Nc ( f [ p >> 2 ] | 0 ) | 0 ; o = f [ f [( f [ p >> 2 ] | 0 ) + 20 >> 2 ] >> 2 ] | 0 ; f [ g >> 2 ] = f [ o >> 2 ]; f [ h >> 2 ] = f [ o + 4 >> 2 ]; f [ i >> 2 ] = f [ o + 8 >> 2 ]; f [ j >> 2 ] = f [ o + 12 >> 2 ]; f [ k >> 2 ] = f [ o + 16 >> 2 ]; f [ Aa >> 2 ] = f [ Aa >> 2 ] | 128 ; o = 1 ; l = Da ; return o | 0 } return 0 } function $e ( a , b , c , e , g , h ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; g = g | 0 ; h = h | 0 ; var i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , r = 0 , s = 0 , t = 0 ; t = l ; l = l + 48 | 0 ; r = t + 28 | 0 ; s = t + 32 | 0 ; o = a + 8 | 0 ; if ( ! ( f [ o >> 2 ] & 128 )){ g = 0 ; l = t ; return g | 0 } q = a + 200 | 0 ; if (( f [ q >> 2 ] | 0 ) != ( b | 0 )){ g = 0 ; l = t ; return g | 0 } i = f [ a + 164 >> 2 ] | 0 ; n = i + ( b * 5640 | 0 ) | 0 ; p = i + ( b * 5640 | 0 ) + 5592 | 0 ; j = f [ p >> 2 ] | 0 ; if ( ! j ){ of ( n ); g = 0 ; l = t ; return g | 0 } k = a + 204 | 0 ; m = i + ( b * 5640 | 0 ) + 5596 | 0 ; if ( ! ( Pc ( f [ k >> 2 ] | 0 , j , f [ m >> 2 ] | 0 , b , f [ a + 196 >> 2 ] | 0 , h ) | 0 )){ of ( n ); f [ o >> 2 ] = f [ o >> 2 ] | 32768 ; Pd ( h , 1 , 8912 , t ) | 0 ; g = 0 ; l = t ; return g | 0 } if ( ! ( Qc ( f [ k >> 2 ] | 0 , c , e ) | 0 )){ g = 0 ; l = t ; return g | 0 } i = f [ p >> 2 ] | 0 ; if ( i ){ Pe ( i ); f [ p >> 2 ] = 0 ; f [ m >> 2 ] = 0 } p = a + 76 | 0 ; d [ p >> 0 ] = d [ p >> 0 ] &- 2 ; f [ o >> 2 ] = f [ o >> 2 ] &- 129 ; p = Ld ( g ) | 0 ; a = f [ o >> 2 ] | 0 ; if (( a | 0 ) == 256 | ( p | 0 ) == 0 & ( F | 0 ) == 0 & ( a | 0 ) == 64 ){ g = 1 ; l = t ; return g | 0 } if (( Hd ( g , s , 2 , h ) | 0 ) != 2 ){ Pd ( h , 2 , 8931 , t + 8 | 0 ) | 0 ; g = 1 ; l = t ; return g | 0 } ld ( s , r , 2 ); switch ( f [ r >> 2 ] | 0 ){ case 65497 : { f [ q >> 2 ] = 0 ; f [ o >> 2 ] = 256 ; g = 1 ; l = t ; return g | 0 } case 65424 : { g = 1 ; l = t ; return g | 0 } default : if (( Ld ( g ) | 0 ) == 0 & ( F | 0 ) == 0 ){ f [ o >> 2 ] = 64 ; Pd ( h , 2 , 8975 , t + 16 | 0 ) | 0 ; g = 1 ; l = t ; return g | 0 } else { Pd ( h , 1 , 9005 , t + 24 | 0 ) | 0 ; g = 0 ; l = t ; return g | 0 }} return 0 } function _e ( a , b , c , e , g , h , i ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; e = e | 0 ; g = g | 0 ; h = h | 0 ; i = i | 0 ; var j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , r = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 ; z = l ; l = l + 112 | 0 ; y = z + 96 | 0 ; x = z + 88 | 0 ; w = z + 80 | 0 ; v = z + 72 | 0 ; u = z + 64 | 0 ; s = z + 56 | 0 ; r = z + 48 | 0 ; o = z + 40 | 0 ; n = z + 32 | 0 ; m = z + 24 | 0 ; k = z + 16 | 0 ; p = f [ a + 80 >> 2 ] | 0 ; if (( f [ a + 8 >> 2 ] | 0 ) != 8 ){ Pd ( i , 1 , 9037 , z ) | 0 ; i = 0 ; l = z ; return i | 0 } if ( ! ( e | c | g | h )){ Pd ( i , 4 , 9116 , z + 8 | 0 ) | 0 ; f [ a + 28 >> 2 ] = 0 ; f [ a + 32 >> 2 ] = 0 ; f [ a + 36 >> 2 ] = f [ a + 112 >> 2 ]; f [ a + 40 >> 2 ] = f [ a + 116 >> 2 ]; i = 1 ; l = z ; return i | 0 } t = p + 8 | 0 ; j = f [ t >> 2 ] | 0 ; if ( j >>> 0 < c >>> 0 ){ f [ k >> 2 ] = c ; f [ k + 4 >> 2 ] = j ; Pd ( i , 1 , 9185 , k ) | 0 ; i = 0 ; l = z ; return i | 0 } j = f [ p >> 2 ] | 0 ; if ( j >>> 0 > c >>> 0 ){ f [ m >> 2 ] = c ; f [ m + 4 >> 2 ] = j ; Pd ( i , 2 , 9272 , m ) | 0 ; j = 0 ; c = f [ p >> 2 ] | 0 } else j = (( c - ( f [ a + 92 >> 2 ] | 0 ) | 0 ) >>> 0 ) / (( f [ a + 100 >> 2 ] | 0 ) >>> 0 ) | 0 ; f [ a + 28 >> 2 ] = j ; f [ b >> 2 ] = c ; q = p + 12 | 0 ; c = f [ q >> 2 ] | 0 ; if ( c >>> 0 < e >>> 0 ){ f [ n >> 2 ] = e ; f [ n + 4 >> 2 ] = c ; Pd ( i , 1 , 9360 , n ) | 0 ; i = 0 ; l = z ; return i | 0 } k = p + 4 | 0 ; c = f [ k >> 2 ] | 0 ; if ( c >>> 0 > e >>> 0 ){ f [ o >> 2 ] = e ; f [ o + 4 >> 2 ] = c ; Pd ( i , 2 , 9445 , o ) | 0 ; c = 0 ; e = f [ k >> 2 ] | 0 } else c = (( e - ( f [ a + 96 >> 2 ] | 0 ) | 0 ) >>> 0 ) / (( f [ a + 104 >> 2 ] | 0 ) >>> 0 ) | 0 ; f [ a + 32 >> 2 ] = c ; m = b + 4 | 0 ; f [ m >> 2 ] = e ; c = f [ p >> 2 ] | 0 ; if ( c >>> 0 > g >>> 0 ){ f [ r >> 2 ] = g ; f [ r + 4 >> 2 ] = c ; Pd ( i , 1 , 9531 , r ) | 0 ; i = 0 ; l = z ; return i | 0 } c = f [ t >> 2 ] | 0 ; if ( c >>> 0 < g >>> 0 ){ f [ s >> 2 ] = g ; f [ s + 4 >> 2 ] = c ; Pd ( i , 2 , 9620 , s ) | 0 ; c = f [ a + 112 >> 2 ] | 0 ; g = f [ t >> 2 ] | 0 } else { c = f [ a + 100 >> 2 ] | 0 ; c = ( g +- 1 - ( f [ a + 92 >> 2 ] | 0 ) + c | 0 ) / ( c | 0 ) | 0 } f [ a + 36 >> 2 ] = c ; j = b + 8 | 0 ; f [ j >> 2 ] = g ; g = f [ k >> 2 ] | 0 ; if ( g >>> 0 > h >>> 0 ){ f [ u >> 2 ] = h ; f [ u + 4 >> 2 ] = g ; Pd ( i , 1 , 9708 , u ) | 0 ; i = 0 ; l = z ; return i | 0 } g = f [ q >> 2 ] | 0 ; if ( g >>> 0 < h >>> 0 ){ f [ v >> 2 ] = h ; f [ v + 4 >> 2 ] = g ; Pd ( i , 2 , 9798 , v ) | 0 ; c = f [ q >> 2 ] | 0 ; g = f [ a + 116 >> 2 ] | 0 } else { g = f [ a + 104 >> 2 ] | 0 ; c = h ; g = ( h +- 1 - ( f [ a + 96 >> 2 ] | 0 ) + g | 0 ) / ( g | 0 ) | 0 } f [ a + 40 >> 2 ] = g ; h = b + 12 | 0 ; f [ h >> 2 ] = c ; v = a + 76 | 0 ; d [ v >> 0 ] = d [ v >> 0 ] | 2 ; v = f [ b + 16 >> 2 ] | 0 ; a = f [ b >> 2 ] | 0 ; a : do if ( v ){ e = f [ m >> 2 ] | 0 ; t = e +- 1 | 0 ; u = f [ j >> 2 ] | 0 ; q = u +- 1 | 0 ; r = a +- 1 | 0 ; g = 0 ; p = f [ b + 24 >> 2 ] | 0 ; while ( 1 ){ b = f [ p >> 2 ] | 0 ; c = ( r + b | 0 ) / ( b | 0 ) | 0 ; f [ p + 16 >> 2 ] = c ; o = f [ p + 4 >> 2 ] | 0 ; j = ( t + o | 0 ) / ( o | 0 ) | 0 ; f [ p + 20 >> 2 ] = j ; b = ( q + b | 0 ) / ( b | 0 ) | 0 ; k = f [ p + 40 >> 2 ] | 0 ; m = Hi ( 1 , 0 , k | 0 ) | 0 ; n = F ; b = Ii ( b | 0 ,(( b | 0 ) < 0 ) << 31 >> 31 | 0 , - 1 , - 1 ) | 0 ; b = Ii ( b | 0 , F | 0 , m | 0 , n | 0 ) | 0 ; b = Fi ( b | 0 , F | 0 , k | 0 ) | 0 ; c = Ii ( c | 0 ,(( c | 0 ) < 0 ) << 31 >> 31 | 0 , - 1 , - 1 ) | 0 ; c = Ii ( c | 0 , F | 0 , m | 0 , n | 0 ) | 0 ; c = Fi ( c | 0 , F | 0 , k | 0 ) | 0 ; c = b - c | 0 ; if (( c | 0 ) < 0 ){ j = 29 ; break } s = f [ h >> 2 ] | 0 ; b = ( o +- 1 + s | 0 ) / ( o | 0 ) | 0 ; f [ p + 8 >> 2 ] = c ; b = Ii ( b | 0 ,(( b | 0 ) < 0 ) << 31 >> 31 | 0 , - 1 , - 1 ) | 0 ; b = Ii ( b | 0 , F | 0 , m | 0 , n | 0 ) | 0 ; b = Fi ( b | 0 , F | 0 , k | 0 ) | 0 ; c = Ii ( j | 0 ,(( j | 0 ) < 0 ) << 31 >> 31 | 0 , - 1 , - 1 ) | 0 ; c = Ii ( c | 0 , F | 0 , m | 0 , n | 0 ) | 0 ; c = Fi ( c | 0 , F | 0 , k | 0 ) | 0 ; c = b - c | 0 ; if (( c | 0 ) < 0 ){ j = 31 ; break } f [ p + 12 >> 2 ] = c ; g = g + 1 | 0 ; if ( g >>> 0 >= v >>> 0 ){ c = u ; g = s ; break a } else p = p + 52 | 0 } if (( j | 0 ) == 29 ){ f [ w >> 2 ] = g ; f [ w + 4 >> 2 ] = c ; Pd ( i , 1 , 9887 , w ) | 0 ; i = 0 ; l = z ; return i | 0 } else if (( j | 0 ) == 31 ){ f [ x >> 2 ] = g ; f [ x + 4 >> 2 ] = c ; Pd ( i , 1 , 9956 , x ) | 0 ; i = 0 ; l
f [ x + 4 >> 2 ] = A ; Pd ( c , 1 , 11946 , x ) | 0 ; c = 0 ; l = B ; return c | 0 } else if (( g | 0 ) == 11 ){ Pe ( d ); A = ba ( f [ A >> 2 ] | 0 , f [ z >> 2 ] | 0 ) | 0 ; f [ y >> 2 ] = e + 1 ; f [ y + 4 >> 2 ] = A ; Pd ( c , 1 , 12162 , y ) | 0 ; c = 0 ; l = B ; return c | 0 } else if (( g | 0 ) == 13 ){ Pe ( d ); c = 0 ; l = B ; return c | 0 } else if (( g | 0 ) == 17 ){ Pe ( d ); c = 1 ; l = B ; return c | 0 } return 0 } function vf ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var d = 0 , e = 0 , g = 0 , h = 0 , i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , r = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 , B = 0 , C = 0 , D = 0 , E = 0 , G = 0 ; G = l ; l = l + 96 | 0 ; y = G + 56 | 0 ; C = G + 48 | 0 ; x = G + 40 | 0 ; z = G + 32 | 0 ; D = G + 24 | 0 ; j = G + 16 | 0 ; i = G + 8 | 0 ; r = G + 92 | 0 ; B = G + 88 | 0 ; q = G + 84 | 0 ; t = G + 80 | 0 ; v = G + 76 | 0 ; u = G + 72 | 0 ; w = G + 68 | 0 ; s = G + 64 | 0 ; f [ r >> 2 ] = 1 ; d = Ke ( 1e3 ) | 0 ; if ( ! d ){ Pd ( c , 1 , 11880 , G ) | 0 ; E = 0 ; l = G ; return E | 0 } A = a + 196 | 0 ; g = f [ A >> 2 ] | 0 ; e = f [ g + 40 >> 2 ] | 0 ; a : do if ( ! e ){ e = ba ( f [ a + 116 >> 2 ] | 0 , f [ a + 112 >> 2 ] | 0 ) | 0 ; f [ g + 36 >> 2 ] = e ; e = Le ( e , 40 ) | 0 ; g = f [ A >> 2 ] | 0 ; f [ g + 40 >> 2 ] = e ; b : do if ( e ){ if ( f [ g + 36 >> 2 ] | 0 ){ h = 0 ; do { f [ e + ( h * 40 | 0 ) + 28 >> 2 ] = 100 ; f [ e + ( h * 40 | 0 ) + 20 >> 2 ] = 0 ; p = Le ( 100 , 24 ) | 0 ; g = f [ A >> 2 ] | 0 ; e = f [ g + 40 >> 2 ] | 0 ; f [ e + ( h * 40 | 0 ) + 24 >> 2 ] = p ; h = h + 1 | 0 ; if ( ! p ) break b } while ( h >>> 0 < ( f [ g + 36 >> 2 ] | 0 ) >>> 0 )} g = f [ a + 60 >> 2 ] | 0 ; if ( ! e ) break a ; else { E = 12 ; break a }} while ( 0 ); Pe ( d ); E = 0 ; l = G ; return E | 0 } else { g = f [ a + 60 >> 2 ] | 0 ; E = 12 } while ( 0 ); if (( E | 0 ) == 12 ) if ( f [ e + 16 >> 2 ] | 0 ){ if ( ! ( f [ e + ( g * 40 | 0 ) + 4 >> 2 ] | 0 )){ p = a + 64 | 0 ; p = Ii ( f [ p >> 2 ] | 0 , f [ p + 4 >> 2 ] | 0 , 2 , 0 ) | 0 ; if ( ! ( sd ( b , p , F , c ) | 0 )){ Pd ( c , 1 , 11918 , i ) | 0 ; Pe ( d ); E = 0 ; l = G ; return E | 0 }} else { p = f [ e + ( g * 40 | 0 ) + 16 >> 2 ] | 0 ; p = Ii ( f [ p >> 2 ] | 0 , f [ p + 4 >> 2 ] | 0 , 2 , 0 ) | 0 ; if ( ! ( sd ( b , p , F , c ) | 0 )){ Pd ( c , 1 , 11918 , j ) | 0 ; Pe ( d ); E = 0 ; l = G ; return E | 0 }} e = a + 8 | 0 ; if (( f [ e >> 2 ] | 0 ) == 256 ) f [ e >> 2 ] = 8 } a : do if ( Ze ( a , B , q , t , v , u , w , s , r , b , c ) | 0 ){ o = a + 116 | 0 ; p = a + 112 | 0 ; k = a + 204 | 0 ; m = a + 84 | 0 ; n = g + 1 | 0 ; e = 1e3 ; while ( 1 ){ if ( ! ( f [ r >> 2 ] | 0 )) break ; j = f [ q >> 2 ] | 0 ; if ( j >>> 0 > e >>> 0 ){ e = Oe ( d , j ) | 0 ; if ( ! e ){ E = 26 ; break } else { d = e ; i = j }} else i = e ; h = f [ B >> 2 ] | 0 ; if ( ! ( $e ( a , h , d , j , b , c ) | 0 )){ E = 28 ; break } e = h + 1 | 0 ; j = ba ( f [ p >> 2 ] | 0 , f [ o >> 2 ] | 0 ) | 0 ; f [ z >> 2 ] = e ; f [ z + 4 >> 2 ] = j ; Pd ( c , 4 , 11986 , z ) | 0 ; j = f [ k >> 2 ] | 0 ; if ( ! ( $f ( f [( f [ f [ j + 20 >> 2 ] >> 2 ] | 0 ) + 20 >> 2 ] | 0 , f [ j + 24 >> 2 ] | 0 , d , f [( f [ m >> 2 ] | 0 ) + 24 >> 2 ] | 0 ) | 0 )){ E = 30 ; break } f [ x >> 2 ] = e ; Pd ( c , 4 , 12016 , x ) | 0 ; if (( h | 0 ) == ( g | 0 )){ E = 32 ; break } f [ y >> 2 ] = e ; f [ y + 4 >> 2 ] = n ; Pd ( c , 2 , 12060 , y ) | 0 ; if ( ! ( Ze ( a , B , q , t , v , u , w , s , r , b , c ) | 0 )) break a ; else e = i } if (( E | 0 ) == 26 ){ Pe ( d ); E = ba ( f [ p >> 2 ] | 0 , f [ o >> 2 ] | 0 ) | 0 ; f [ D >> 2 ] = ( f [ B >> 2 ] | 0 ) + 1 ; f [ D + 4 >> 2 ] = E ; Pd ( c , 1 , 11946 , D ) | 0 ; E = 0 ; l = G ; return E | 0 } else if (( E | 0 ) == 28 ){ Pe ( d ); E = 0 ; l = G ; return E | 0 } else if (( E | 0 ) == 30 ){ Pe ( d ); E = 0 ; l = G ; return E | 0 } else if (( E | 0 ) == 32 ){ E = ( f [ A >> 2 ] | 0 ) + 8 | 0 ; E = Ii ( f [ E >> 2 ] | 0 , f [ E + 4 >> 2 ] | 0 , 2 , 0 ) | 0 ; if ( ! ( sd ( b , E , F , c ) | 0 )){ Pd ( c , 1 , 11918 , C ) | 0 ; Pe ( d ); E = 0 ; l = G ; return E | 0 }} Pe ( d ); E = 1 ; l = G ; return E | 0 } while ( 0 ); Pe ( d ); E = 0 ; l = G ; return E | 0 } function wf ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var d = 0 , g = 0 , h = 0 , i = 0 , j = 0 , k = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , r = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 , B = 0 , C = 0 , D = 0 , E = 0 , F = 0 , G = 0 , H = 0 , I = 0 , J = 0 ; H = l ; l = l + 32 | 0 ; D = H + 16 | 0 ; t = H + 8 | 0 ; k = H ; C = H + 20 | 0 ; E = f [ a + 40 >> 2 ] | 0 ; G = a + 36 | 0 ; n = f [ G >> 2 ] | 0 ; o = a + 204 | 0 ; j = f [ o >> 2 ] | 0 ; f [ j + 16 >> 2 ] = 0 ; B = a + 8 | 0 ; f [ B >> 2 ] = 0 ; f [ C >> 2 ] = 0 ; kd ( n , 65424 , 2 ); kd ( n + 2 | 0 , 10 , 2 ); F = a + 200 | 0 ; kd ( n + 4 | 0 , f [ F >> 2 ] | 0 , 2 ); z = a + 12 | 0 ; kd ( n + 10 | 0 , f [ z >> 2 ] | 0 , 1 ); A = a + 164 | 0 ; kd ( n + 11 | 0 , f [( f [ A >> 2 ] | 0 ) + (( f [ F >> 2 ] | 0 ) * 5640 | 0 ) + 5588 >> 2 ] | 0 , 1 ); f [ C >> 2 ] = 12 ; h = n + 12 | 0 ; d = E +- 12 | 0 ; m = a + 88 | 0 ; if ((( e [ m >> 1 ] | 0 ) +- 3 & 65535 ) >= 4 ? ( g = f [ F >> 2 ] | 0 , i = f [ A >> 2 ] | 0 ,( f [ i + ( g * 5640 | 0 ) + 420 >> 2 ] | 0 ) != 0 ) : 0 ){ f [ C >> 2 ] = 0 ; Wf ( f [( f [ a + 80 >> 2 ] | 0 ) + 16 >> 2 ] | 0 , i , g , h , C ); y = f [ C >> 2 ] | 0 ; g = y + 12 | 0 ; h = n + g | 0 ; d = d - y | 0 } else g = 12 ; f [ C >> 2 ] = 0 ; kd ( h , 65427 , 2 ); f [ j + 4 >> 2 ] = f [ B >> 2 ]; y = f [ z >> 2 ] | 0 ; f [ j + 8 >> 2 ] = y ; if ( ! y ) f [( f [ f [ j + 20 >> 2 ] >> 2 ] | 0 ) + 840 >> 2 ] = 0 ; f [ C >> 2 ] = 0 ; if ( ! ( Oc ( j , f [ F >> 2 ] | 0 , h + 2 | 0 , C , d +- 4 | 0 , 0 ) | 0 )){ Pd ( c , 1 , 11860 , k ) | 0 ; b = 0 ; l = H ; return b | 0 } d = ( f [ C >> 2 ] | 0 ) + 2 | 0 ; f [ C >> 2 ] = d ; d = d + g | 0 ; kd ( n + 6 | 0 , d , 4 ); if ((( e [ m >> 1 ] | 0 ) +- 3 & 65535 ) < 4 ){ y = a + 28 | 0 ; kd ( f [ y >> 2 ] | 0 , f [ F >> 2 ] | 0 , 1 ); x = ( f [ y >> 2 ] | 0 ) + 1 | 0 ; f [ y >> 2 ] = x ; kd ( x , d , 4 ); f [ y >> 2 ] = ( f [ y >> 2 ] | 0 ) + 4 } g = n + d | 0 ; y = E - d | 0 ; v = f [ o >> 2 ] | 0 ; w = a + 88 | 0 ; r = f [ A >> 2 ] | 0 ; s = f [ F >> 2 ] | 0 ; m = Zf ( w , 0 , s ) | 0 ; x = a + 8 | 0 ; f [ z >> 2 ] = ( f [ z >> 2 ] | 0 ) + 1 ; a : do if ( m >>> 0 > 1 ){ n = v + 4 | 0 ; o = v + 8 | 0 ; p = v + 20 | 0 ; q = a + 28 | 0 ; i = g ; g = y ; d = 0 ; k = 1 ; while ( 1 ){ f [ x >> 2 ] = k ; f [ C >> 2 ] = 0 ; kd ( i , 65424 , 2 ); kd ( i + 2 | 0 , 10 , 2 ); kd ( i + 4 | 0 , f [ F >> 2 ] | 0 , 2 ); kd ( i + 10 | 0 , f [ z >> 2 ] | 0 , 1 ); kd ( i + 11 | 0 , f [( f [ A >> 2 ] | 0 ) + (( f [ F >> 2 ] | 0 ) * 5640 | 0 ) + 5588 >> 2 ] | 0 , 1 ); f [ C >> 2 ] = 0 ; kd ( i + 12 | 0 , 65427 , 2 ); f [ n >> 2 ] = f [ B >> 2 ]; j = f [ z >> 2 ] | 0 ; f [ o >> 2 ] = j ; if ( ! j ) f [( f [ f [ p >> 2 ] >> 2 ] | 0 ) + 840 >> 2 ] = 0 ; f [ C >> 2 ] = 0 ; if ( ! ( Oc ( v , f [ F >> 2 ] | 0 , i + 14 | 0 , C , g +- 16 | 0 , 0 ) | 0 )) break ; I = f [ C >> 2 ] | 0 ; J = I + 2 | 0 ; f [ C >> 2 ] = J ; j = I + 14 | 0 ; h = i + j | 0 ; d = d + 12 + J | 0 ; g = g +- 12 + ( - 2 - I ) | 0 ; kd ( i + 6 | 0 , j , 4 ); if ((( e [ w >> 1 ] | 0 ) +- 3 & 65535 ) < 4 ){ kd ( f [ q >> 2 ] | 0 , f [ F >> 2 ] | 0 , 1 ); J = ( f [ q >> 2 ] | 0 ) +
f [ a >> 2 ] = b ; f [ m >> 2 ] = c ; f [ s >> 2 ] = b ; f [ t >> 2 ] = c ; e = a + 8 | 0 ; f [ e >> 2 ] = 0 ; g = 0 ; i = c ; j = b ; k = 0 ; while ( 1 ){ r = ba ( i , j ) | 0 ; j = ( j + 1 | 0 ) / 2 | 0 ; h = k + 1 | 0 ; f [ s + ( h << 2 ) >> 2 ] = j ; i = ( i + 1 | 0 ) / 2 | 0 ; f [ t + ( h << 2 ) >> 2 ] = i ; g = g + r | 0 ; if ( r >>> 0 <= 1 ) break ; else k = h } f [ e >> 2 ] = g ; if ( ! g ){ e = a + 12 | 0 ; g = f [ e >> 2 ] | 0 ; if ( g ){ Pe ( g ); f [ e >> 2 ] = 0 } Pe ( a ); t = 0 ; l = u ; return t | 0 } h = g << 4 ; i = a + 16 | 0 ; j = a + 12 | 0 ; do if ( h >>> 0 > ( f [ i >> 2 ] | 0 ) >>> 0 ){ g = Oe ( f [ j >> 2 ] | 0 , h ) | 0 ; if ( g ){ f [ j >> 2 ] = g ; c = f [ i >> 2 ] | 0 ; Gi ( g + c | 0 , 0 , h - c | 0 ) | 0 ; f [ i >> 2 ] = h ; c = f [ m >> 2 ] | 0 ; b = f [ a >> 2 ] | 0 ; break } Pd ( d , 1 , 20166 , n ) | 0 ; e = f [ j >> 2 ] | 0 ; if ( e ){ Pe ( e ); f [ j >> 2 ] = 0 } Pe ( a ); t = 0 ; l = u ; return t | 0 } while ( 0 ); g = f [ j >> 2 ] | 0 ; b = g + (( ba ( c , b ) | 0 ) << 4 ) | 0 ; if ( k ){ r = 0 ; c = b ; do { p = f [ t + ( r << 2 ) >> 2 ] | 0 ; a : do if (( p | 0 ) > 0 ){ q = f [ s + ( r << 2 ) >> 2 ] | 0 ; if (( q | 0 ) <= 0 ){ h = p +- 1 | 0 ; i = 0 ; while ( 1 ){ o = ( i & 1 | 0 ) != 0 | ( i | 0 ) == ( h | 0 ); j = o ? c : b + ( q << 4 ) | 0 ; c = o ? c : b ; i = i + 1 | 0 ; if (( i | 0 ) >= ( p | 0 )){ b = j ; break a } else b = j }} o = (( q + 2 + (( q | 0 ) < 2 ?~ q :- 3 ) | 0 ) >>> 1 ) + 1 | 0 ; d = p +- 1 | 0 ; n = 0 ; while ( 1 ){ m = q ; j = c ; while ( 1 ){ f [ g >> 2 ] = j ; h = g + 16 | 0 ; i = m ; m = m +- 2 | 0 ; if (( m | 0 ) >- 1 ){ f [ h >> 2 ] = j ; g = g + 32 | 0 } else g = h ; if (( i | 0 ) <= 2 ) break ; else j = j + 16 | 0 } c = c + ( o << 4 ) | 0 ; m = ( n & 1 | 0 ) != 0 | ( n | 0 ) == ( d | 0 ); h = m ? c : b + ( q << 4 ) | 0 ; c = m ? c : b ; n = n + 1 | 0 ; if (( n | 0 ) >= ( p | 0 )){ b = h ; break } else b = h }} while ( 0 ); r = r + 1 | 0 } while (( r | 0 ) != ( k | 0 ))} f [ g >> 2 ] = 0 } e = f [ e >> 2 ] | 0 ; if ( ! e ){ t = a ; l = u ; return t | 0 } g = 0 ; b = f [ a + 12 >> 2 ] | 0 ; while ( 1 ){ f [ b + 4 >> 2 ] = 999 ; f [ b + 8 >> 2 ] = 0 ; f [ b + 12 >> 2 ] = 0 ; g = g + 1 | 0 ; if (( g | 0 ) == ( e | 0 )) break ; else b = b + 16 | 0 } l = u ; return a | 0 } function cg ( a ){ a = a | 0 ; var b = 0 , c = 0 ; if ( ! a ) return ; b = a + 12 | 0 ; c = f [ b >> 2 ] | 0 ; if ( c ){ Pe ( c ); f [ b >> 2 ] = 0 } Pe ( a ); return } function dg ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; b = ( f [ a + 12 >> 2 ] | 0 ) + ( b << 4 ) | 0 ; if ( ! b ) return ; while ( 1 ){ a = b + 4 | 0 ; if (( f [ a >> 2 ] | 0 ) <= ( c | 0 )){ b = 4 ; break } f [ a >> 2 ] = c ; b = f [ b >> 2 ] | 0 ; if ( ! b ){ b = 4 ; break }} if (( b | 0 ) == 4 ) return } function eg ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; var e = 0 , g = 0 , h = 0 , i = 0 , j = 0 ; j = l ; l = l + 128 | 0 ; i = j ; c = ( f [ b + 12 >> 2 ] | 0 ) + ( c << 4 ) | 0 ; if ( ! ( f [ c >> 2 ] | 0 )){ e = 0 ; g = i } else { e = c ; b = i ; while ( 1 ){ g = b + 4 | 0 ; f [ b >> 2 ] = c ; c = f [ e >> 2 ] | 0 ; if ( ! ( f [ c >> 2 ] | 0 )){ e = 0 ; break } else { e = c ; b = g }}} while ( 1 ){ h = c + 8 | 0 ; b = f [ h >> 2 ] | 0 ; if (( e | 0 ) > ( b | 0 )){ f [ h >> 2 ] = e ; b = e } a : do if (( b | 0 ) < ( d | 0 )){ e = c + 4 | 0 ; while ( 1 ){ if (( b | 0 ) >= ( f [ e >> 2 ] | 0 )) break ; rg ( a , 0 , 1 ); b = b + 1 | 0 ; if (( b | 0 ) >= ( d | 0 )){ c = b ; break a }} c = c + 12 | 0 ; if ( ! ( f [ c >> 2 ] | 0 )){ rg ( a , 1 , 1 ); f [ c >> 2 ] = 1 ; c = b } else c = b } else c = b ; while ( 0 ); f [ h >> 2 ] = c ; if (( g | 0 ) == ( i | 0 )) break ; h = g +- 4 | 0 ; e = c ; c = f [ h >> 2 ] | 0 ; g = h } l = j ; return } function fg ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; var e = 0 , g = 0 , h = 0 , i = 0 , j = 0 ; j = l ; l = l + 128 | 0 ; i = j ; c = ( f [ b + 12 >> 2 ] | 0 ) + ( c << 4 ) | 0 ; if ( ! ( f [ c >> 2 ] | 0 )){ b = 0 ; g = i } else { e = c ; b = i ; while ( 1 ){ g = b + 4 | 0 ; f [ b >> 2 ] = c ; c = f [ e >> 2 ] | 0 ; if ( ! ( f [ c >> 2 ] | 0 )){ b = 0 ; break } else { e = c ; b = g }}} while ( 1 ){ h = c + 8 | 0 ; e = f [ h >> 2 ] | 0 ; if (( b | 0 ) > ( e | 0 )) f [ h >> 2 ] = b ; else b = e ; c = c + 4 | 0 ; a : do if (( b | 0 ) < ( d | 0 )){ while ( 1 ){ if (( b | 0 ) >= ( f [ c >> 2 ] | 0 )) break a ; if ( sg ( a , 1 ) | 0 ) break ; b = b + 1 | 0 ; if (( b | 0 ) >= ( d | 0 )) break a } f [ c >> 2 ] = b } while ( 0 ); f [ h >> 2 ] = b ; if (( g | 0 ) == ( i | 0 )) break ; h = g +- 4 | 0 ; c = f [ h >> 2 ] | 0 ; g = h } l = j ; return ( f [ c >> 2 ] | 0 ) < ( d | 0 ) | 0 } function gg (){ var a = 0 , b = 0 ; a = Le ( 1 , 12 ) | 0 ; if ( ! a ){ a = 0 ; return a | 0 } f [ a + 4 >> 2 ] = 10 ; b = Le ( 10 , 4 ) | 0 ; f [ a + 8 >> 2 ] = b ; if ( b ){ b = a ; return b | 0 } Pe ( a ); b = 0 ; return b | 0 } function hg ( a ){ a = a | 0 ; var b = 0 ; if ( ! a ) return ; b = f [ a + 8 >> 2 ] | 0 ; if ( b ) Pe ( b ); Pe ( a ); return } function ig ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var d = 0 , e = 0 , g = 0 , h = 0 , i = 0 ; i = l ; l = l + 16 | 0 ; h = i ; g = a + 4 | 0 ; e = f [ g >> 2 ] | 0 ; d = f [ a >> 2 ] | 0 ; do if (( e | 0 ) == ( d | 0 )){ e = e + 10 | 0 ; f [ g >> 2 ] = e ; d = a + 8 | 0 ; e = Oe ( f [ d >> 2 ] | 0 , e << 2 ) | 0 ; if ( e ){ f [ d >> 2 ] = e ; d = f [ a >> 2 ] | 0 ; break } Pe ( f [ d >> 2 ] | 0 ); f [ g >> 2 ] = 0 ; f [ a >> 2 ] = 0 ; Pd ( c , 1 , 20214 , h ) | 0 ; a = 0 ; l = i ; return a | 0 } else e = f [ a + 8 >> 2 ] | 0 ; while ( 0 ); f [ e + ( d << 2 ) >> 2 ] = b ; f [ a >> 2 ] = d + 1 ; a = 1 ; l = i ; return a | 0 } function jg ( a ){ a = a | 0 ; return f [ a >> 2 ] | 0 } function kg ( a ){ a = a | 0 ; return f [ a + 8 >> 2 ] | 0 } function lg ( a ){ a = a | 0 ; f [ a >> 2 ] = 0 ; return } function mg (){ return Ke ( 20 ) | 0 } function ng ( a ){ a = a | 0 ; if ( ! a ) return ; Pe ( a ); return } function og ( a ){ a = a | 0 ; return ( f [ a + 8 >> 2 ] | 0 ) - ( f [ a >> 2 ] | 0 ) | 0 } function pg ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; f [ a >> 2 ] = b ; f [ a + 4 >> 2 ] = b + c ; f [ a + 8 >> 2 ] = b ; f [ a + 12 >> 2 ] = 0 ; f [ a + 16 >> 2 ] = 8 ; return } function qg ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; f [ a >> 2 ] = b ; f [ a + 4 >> 2 ] = b + c ; f [ a + 8 >> 2 ] = b ; f [ a + 12 >> 2 ] = 0 ; f [ a + 16 >> 2 ] = 0 ; return } function rg ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var e = 0 , g = 0 , h = 0 , i = 0 , j = 0 , k = 0 , l = 0 , m = 0 ; if ( ! c ) return ; k = a + 16 | 0 ; l = a + 12 | 0 ; m = a + 8 | 0 ; h = a + 4 | 0 ; a = f [ k >> 2 ] | 0 ; j = c +- 1 | 0 ; do { i = b >>> j & 1 ; if ( ! a ){ g = f [ l >> 2 ] | 0 ; a = g << 8 & 65280 ; f [ l >> 2 ] = a ; a = ( a | 0 ) == 65280 ? 7 : 8 ; f [ k >> 2 ] = a ; e = f [ m >> 2 ] | 0 ; if ( e >>> 0 < ( f [ h >> 2 ] | 0 ) >>> 0 ){ f [ m >> 2 ] = e + 1 ; d [ e >> 0 ] = g ; a = f [ k >> 2 ] | 0 }} a = a +- 1 | 0 ; f [ k >> 2 ] = a ; f [ l >> 2 ] = i << a | f [ l >> 2 ]; j = j +- 1 | 0 } while ( j >>> 0 < c >>> 0 ); return } function sg ( a , b ){ a = a | 0 ; b = b | 0 ; var c = 0 , d = 0 , e = 0 , h
o = 0 ; while ( 1 ){ if ( ! m ) m = 0 ; else { r = o | 1 ; s = r + 1 | 0 ; t = o | 3 ; u = r + 3 | 0 ; v = 0 ; do { d = f [ qa >> 2 ] | 0 ; i = v ; v = v + 1 | 0 ; D = ( ba ( d , r ) | 0 ) + v | 0 ; G = f [ ra >> 2 ] | 0 ; D = e [ G + (( ba ( d , s ) | 0 ) + v << 1 ) >> 1 ] | e [ G + ( D << 1 ) >> 1 ]; D = D | e [ G + (( ba ( d , t ) | 0 ) + v << 1 ) >> 1 ]; d : do if ( ! (( D | e [ G + (( ba ( d , u ) | 0 ) + v << 1 ) >> 1 ]) & 20735 )){ f [ x >> 2 ] = w ; if ( ! ( mh ( E ) | 0 )) break ; f [ x >> 2 ] = y ; p = ( mh ( E ) | 0 ) << 1 ; p = p | ( mh ( E ) | 0 ); if ( p >>> 0 >= 4 ) break ; q = k + (( ba ( f [ wa >> 2 ] | 0 , p ) | 0 ) + i << 2 ) | 0 ; i = l + (( ba ( f [ qa >> 2 ] | 0 , p ) | 0 ) + i << 1 ) | 0 ; n = p ; while ( 1 ){ if ( n >>> 0 >= ( f [ xa >> 2 ] | 0 ) >>> 0 ) break d ; d = f [ qa >> 2 ] | 0 ; m = i ; i = i + ( d << 1 ) | 0 ; if (( n | 0 ) == ( p | 0 )){ G = f [ a >> 2 ] | 0 ; D = ( h [ i >> 1 ] | 0 ) >>> 4 & 255 ; f [ G + 100 >> 2 ] = G + 24 + ( g [ 21291 + D >> 0 ] << 2 ); G = mh ( G ) | 0 ; D = g [ 21547 + D >> 0 ] | 0 ; B = D ^ G ; f [ q >> 2 ] = ( G | 0 ) != ( D | 0 ) ? z : F ; D = f [ qa >> 2 ] | 0 ; G = m + ( d - D << 1 ) | 0 ; C = m + ( D + d << 1 ) | 0 ; A = m + ( d +~ D << 1 ) | 0 ; e [ A >> 1 ] = h [ A >> 1 ] | 2 ; e [ G >> 1 ] = e [ G >> 1 ] | e [ 3436 + ( B << 1 ) >> 1 ]; G = d + 1 | 0 ; A = m + ( G - D << 1 ) | 0 ; e [ A >> 1 ] = h [ A >> 1 ] | 4 ; A = d +- 1 | 0 ; d = m + ( A << 1 ) | 0 ; e [ d >> 1 ] = e [ d >> 1 ] | e [ 3436 + ( B + 2 << 1 ) >> 1 ]; e [ i >> 1 ] = h [ i >> 1 ] | 4096 ; d = m + ( G << 1 ) | 0 ; e [ d >> 1 ] = e [ d >> 1 ] | e [ 3436 + ( B + 4 << 1 ) >> 1 ]; A = m + ( D + A << 1 ) | 0 ; e [ A >> 1 ] = h [ A >> 1 ] | 1 ; e [ C >> 1 ] = e [ C >> 1 ] | e [ 3436 + ( B + 6 << 1 ) >> 1 ]; G = m + ( D + G << 1 ) | 0 ; e [ G >> 1 ] = h [ G >> 1 ] | 8 ; e [ i >> 1 ] = h [ i >> 1 ] & 49151 } else Sg ( a , i , q , S , F ); n = n + 1 | 0 ; if ( n >>> 0 >= 4 ) break ; else q = q + ( f [ wa >> 2 ] << 2 ) | 0 }} else { D = d + i | 0 ; Sg ( a , l + ( D << 1 ) | 0 , k + ( i << 2 ) | 0 , S , F ); G = ( f [ wa >> 2 ] | 0 ) + i | 0 ; D = ( f [ qa >> 2 ] | 0 ) + D | 0 ; Sg ( a , l + ( D << 1 ) | 0 , k + ( G << 2 ) | 0 , S , F ); G = ( f [ wa >> 2 ] | 0 ) + G | 0 ; D = ( f [ qa >> 2 ] | 0 ) + D | 0 ; Sg ( a , l + ( D << 1 ) | 0 , k + ( G << 2 ) | 0 , S , F ); Sg ( a , l + (( f [ qa >> 2 ] | 0 ) + D << 1 ) | 0 , k + (( f [ wa >> 2 ] | 0 ) + G << 2 ) | 0 , S , F )} while ( 0 ); d = f [ wa >> 2 ] | 0 } while ( v >>> 0 < d >>> 0 ); m = d ; i = f [ xa >> 2 ] | 0 } k = k + ( m << 2 << 2 ) | 0 ; l = l + ( f [ qa >> 2 ] << 2 << 1 ) | 0 ; o = o + 4 | 0 ; if ( o >>> 0 >= ( i &- 4 ) >>> 0 ){ q = k ; p = l ; break }}} else { d = f [ wa >> 2 ] | 0 ; q = k ; p = l ; o = 0 } if ( ! d ) break ; else n = 0 ; do { if ( o >>> 0 < i >>> 0 ){ k = q + ( n << 2 ) | 0 ; l = p + ( n << 1 ) | 0 ; m = o ; while ( 1 ){ l = l + ( f [ qa >> 2 ] << 1 ) | 0 ; Sg ( a , l , k , S , F ); d = f [ wa >> 2 ] | 0 ; m = m + 1 | 0 ; i = f [ xa >> 2 ] | 0 ; if ( m >>> 0 >= i >>> 0 ) break ; else k = k + ( d << 2 ) | 0 }} n = n + 1 | 0 } while ( n >>> 0 < d >>> 0 )} else { d = f [ xa >> 2 ] | 0 ; if ( ! d ) break ; A = E + 92 | 0 ; B = E + 100 | 0 ; C = E + 96 | 0 ; D = 0 - F | 0 ; i = f [ wa >> 2 ] | 0 ; z = 0 ; while ( 1 ){ if ( ! i ){ k = z + 4 | 0 ; i = 0 } else { v = z | 3 ; w = z | 1 ; x = w + 1 | 0 ; y = w + 3 | 0 ; k = z + 4 | 0 ; u = 0 ; while ( 1 ){ do if ( v >>> 0 < d >>> 0 ){ d = f [ qa >> 2 ] | 0 ; l = u + 1 | 0 ; t = ( ba ( d , w ) | 0 ) + l | 0 ; i = f [ ra >> 2 ] | 0 ; if ( e [ i + ( t << 1 ) >> 1 ] & 20735 ){ t = 0 ; d = 0 ; G = 127 ; break } if ( e [ i + (( ba ( d , x ) | 0 ) + l << 1 ) >> 1 ] & 20735 ){ t = 0 ; d = 0 ; G = 127 ; break } if ( e [ i + (( ba ( d , v ) | 0 ) + l << 1 ) >> 1 ] & 20735 ){ t = 0 ; d = 0 ; G = 127 ; break } if ( e [ i + (( ba ( d , y ) | 0 ) + l << 1 ) >> 1 ] & 20665 ){ t = 0 ; d = 0 ; G = 127 ; break } f [ B >> 2 ] = A ; if ( ! ( mh ( E ) | 0 )) break ; f [ B >> 2 ] = C ; d = ( mh ( E ) | 0 ) << 1 ; t = 1 ; d = d | ( mh ( E ) | 0 ); G = 127 } else { t = 0 ; d = 0 ; G = 127 } while ( 0 ); if (( G | 0 ) == 127 ){ G = 0 ; l = d + z | 0 ; d : do if ( l >>> 0 < k >>> 0 ){ s = l ; do { d = f [ xa >> 2 ] | 0 ; if ( s >>> 0 >= d >>> 0 ) break d ; Da = s ; s = s + 1 | 0 ; m = ( ba ( f [ qa >> 2 ] | 0 , s ) | 0 ) + u | 0 ; n = m + 1 | 0 ; o = f [ ra >> 2 ] | 0 ; p = o + ( n << 1 ) | 0 ; q = ( ba ( f [ wa >> 2 ] | 0 , Da ) | 0 ) + u | 0 ; q = ( f [ va >> 2 ] | 0 ) + ( q << 2 ) | 0 ; r = f [ a >> 2 ] | 0 ; i = e [ p >> 1 ] | 0 ; i = ( Da | 0 ) == ( v | 0 ) | ( Da | 0 ) == ( d +- 1 | 0 ) ? i &- 1095 : i ; do if ( ! ( t & ( Da | 0 ) == ( l | 0 ))){ if ( i & 20480 ) break ; d = r + 100 | 0 ; f [ d >> 2 ] = r + 24 + ( g [ 20267 + ( i & 255 | R ) >> 0 ] << 2 ); if ( mh ( r ) | 0 ) G = 133 } else { d = r + 100 | 0 ; G = 133 } while ( 0 ); if (( G | 0 ) == 133 ){ G = 0 ; i = i >>> 4 & 255 ; f [ d >> 2 ] = r + 24 + ( g [ 21291 + i >> 0 ] << 2 ); Da = mh ( r ) | 0 ; r = g [ 21547 + i >> 0 ] | 0 ; i = r ^ Da ; f [ q >> 2 ] = ( Da | 0 ) != ( r | 0 ) ? D : F ; r = f [ qa >> 2 ] | 0 ; Da = o + ( n - r << 1 ) | 0 ; q = o + ( r + n << 1 ) | 0 ; n = o + ( n +~ r << 1 ) | 0 ; e [ n >> 1 ] = h [ n >> 1 ] | 2 ; e [ Da >> 1 ] = e [ Da >> 1 ] | e [ 3436 + ( i << 1 ) >> 1 ]; Da = m + 2 | 0 ; n = o + ( Da - r << 1 ) | 0 ; e [ n >> 1 ] = h [ n >> 1 ] | 4 ; n = o + ( m << 1 ) | 0 ; e [ n >> 1 ] = e [ n >> 1 ] | e [ 3436 + ( i + 2 << 1 ) >> 1 ]; e [ p >> 1 ] = h [ p >> 1 ] | 4096 ; n = o + ( Da << 1 ) | 0 ; e [ n >> 1 ] = e [ n >> 1 ] | e [ 3436 + ( i + 4 << 1 ) >> 1 ]; n = o + ( r + m << 1 ) | 0 ; e [ n >> 1 ] = h [ n >> 1 ] | 1 ; e [ q >> 1 ] = e [ q >> 1 ] | e [ 3436 + ( i + 6 << 1 ) >> 1 ]; Da = o + ( r + Da << 1 ) | 0 ; e [ Da >> 1 ] = h [ Da >> 1 ] | 8 } e [ p >> 1 ] = h [ p >> 1 ] & 49151 } while ( s >>> 0 < k >>> 0 )} while ( 0 ); l = u + 1 | 0 } i = f [ wa >> 2 ] | 0 ; d = f [ xa >> 2 ] | 0 ; if ( l >>> 0 < i >>> 0 ) u = l ; else break }} if ( k >>> 0 < d >>> 0 ) z = k ; else break }} while ( 0 ); if ( M ){ G = 163 ; break c } f [ E + 100 >> 2 ] = E + 96 ; mh ( E ) | 0 ; mh ( E ) | 0 ; mh ( E ) | 0 ; mh ( E ) | 0 ; G = 163 ; break } default : G = 163 } while ( 0 ); do if (( G | 0 ) == 163 ){ G = 0 ; if ( J ) break ; gh ( U ); hh ( U , 18 , 0 , 46 ); hh ( U , 17 , 0 , 3 ); hh ( U , 0 , 0 , 4 )} while ( 0 ); c = c + 1 | 0 ; Da = ( c | 0 ) == 3 ; b = ( Da << 31 >> 31 ) + b | 0 ; c = Da ? 0 : c ; H = H + 1 | 0 ; if ( H >>> 0 >= ( f [ I >> 2 ] | 0 ) >>> 0 ) break b }} while ( 0 ); d = f [ X >> 2 ] | 0 } L = L + 1 | 0 } while ( L >>> 0 < d >>> 0 )} c = ( f [ V >> 2 ] | 0 ) - ( f [ fa >> 2 ] | 0 ) | 0 ; b = ( f [ Y >> 2 ] | 0 ) - ( f [ ga >> 2 ] | 0 ) | 0 ; d = f [ ea >> 2 ] | 0 ; if ( d & 1 ){ Da = f [ Aa >> 2 ] | 0 ; c = ( f [ Da + ( la * 136 | 0 ) + 8 >> 2 ] | 0 ) + c - ( f [ Da + ( la * 136 | 0 ) >> 2 ] | 0 ) | 0 } if ( d & 2 ){ Da = f [ Aa >> 2 ] | 0 ; b = ( f [ Da + ( la * 136 | 0 ) + 12 >> 2 ] | 0 ) + b - ( f [ Da + ( la * 136 | 0 ) + 4 >> 2 ] | 0 ) | 0 } p = f [ va >> 2 ] | 0 ; q = f [ wa >> 2 ] | 0 ; r = f [ xa >> 2 ] | 0 ; d = f [ Ba >> 2 ] | 0 ; if (( d | 0 ) != 0 ? ( ua = 1 << d ,( r | 0 ) != 0 ) : 0 ){ d = ( q | 0 ) == 0 ; o = 0 ; do { if ( ! d ){ i = ba ( o , q ) | 0 ; n = 0 ; do { k = p + ( n + i << 2 ) | 0 ; l = f [ k >> 2 ] | 0 ; m = (
g = f [ a + 100 >> 2 ] | 0 ; h = f [ g >> 2 ] | 0 ; j = ( f [ h + 4 >> 2 ] | 0 ) == ( b | 0 ); e = f [ h >> 2 ] | 0 ; k = a + 4 | 0 ; b = ( f [ k >> 2 ] | 0 ) - e | 0 ; f [ k >> 2 ] = b ; if ( ! j ){ if ( b >>> 0 < e >>> 0 ){ j = ( f [ a >> 2 ] | 0 ) + e | 0 ; f [ a >> 2 ] = j ; e = b ; b = j ; j = a } else { f [ k >> 2 ] = e ; b = f [ a >> 2 ] | 0 ; j = a } f [ g >> 2 ] = f [ h + 12 >> 2 ]; i = a + 8 | 0 ; h = a + 12 | 0 ; g = b ; b = f [ i >> 2 ] | 0 ; while ( 1 ){ e = e << 1 ; f [ k >> 2 ] = e ; c = g << 1 ; f [ j >> 2 ] = c ; b = b +- 1 | 0 ; f [ i >> 2 ] = b ; if ( ! b ){ b = f [ h >> 2 ] | 0 ; e = d [ b >> 0 ] | 0 ; do if ( e << 24 >> 24 !=- 1 ){ if ( ! ( c & 134217728 )){ c = b + 1 | 0 ; f [ h >> 2 ] = c ; d [ c >> 0 ] = g >>> 18 ; c = f [ j >> 2 ] & 524287 ; f [ j >> 2 ] = c ; f [ i >> 2 ] = 8 ; b = 8 ; break } d [ b >> 0 ] = e + 1 << 24 >> 24 ; b = f [ h >> 2 ] | 0 ; if (( d [ b >> 0 ] | 0 ) ==- 1 ){ a = f [ j >> 2 ] & 134217727 ; f [ j >> 2 ] = a ; c = b + 1 | 0 ; f [ h >> 2 ] = c ; d [ c >> 0 ] = a >>> 20 ; c = f [ j >> 2 ] & 1048575 ; f [ j >> 2 ] = c ; f [ i >> 2 ] = 7 ; b = 7 ; break } else { c = b + 1 | 0 ; f [ h >> 2 ] = c ; d [ c >> 0 ] = ( f [ j >> 2 ] | 0 ) >>> 19 ; c = f [ j >> 2 ] & 524287 ; f [ j >> 2 ] = c ; f [ i >> 2 ] = 8 ; b = 8 ; break }} else { c = b + 1 | 0 ; f [ h >> 2 ] = c ; d [ c >> 0 ] = g >>> 19 ; c = f [ j >> 2 ] & 1048575 ; f [ j >> 2 ] = c ; f [ i >> 2 ] = 7 ; b = 7 } while ( 0 ); e = f [ k >> 2 ] | 0 } if ( ! ( e & 32768 )) g = c ; else break } return } if ( b & 32768 ){ f [ a >> 2 ] = ( f [ a >> 2 ] | 0 ) + e ; return } if ( b >>> 0 < e >>> 0 ){ f [ k >> 2 ] = e ; c = f [ a >> 2 ] | 0 ; j = a } else { c = ( f [ a >> 2 ] | 0 ) + e | 0 ; f [ a >> 2 ] = c ; e = b ; j = a } f [ g >> 2 ] = f [ h + 8 >> 2 ]; i = a + 8 | 0 ; h = a + 12 | 0 ; g = c ; b = f [ i >> 2 ] | 0 ; while ( 1 ){ e = e << 1 ; f [ k >> 2 ] = e ; c = g << 1 ; f [ j >> 2 ] = c ; b = b +- 1 | 0 ; f [ i >> 2 ] = b ; if ( ! b ){ b = f [ h >> 2 ] | 0 ; e = d [ b >> 0 ] | 0 ; do if ( e << 24 >> 24 !=- 1 ){ if ( ! ( c & 134217728 )){ c = b + 1 | 0 ; f [ h >> 2 ] = c ; d [ c >> 0 ] = g >>> 18 ; c = f [ j >> 2 ] & 524287 ; f [ j >> 2 ] = c ; f [ i >> 2 ] = 8 ; b = 8 ; break } d [ b >> 0 ] = e + 1 << 24 >> 24 ; b = f [ h >> 2 ] | 0 ; if (( d [ b >> 0 ] | 0 ) ==- 1 ){ a = f [ j >> 2 ] & 134217727 ; f [ j >> 2 ] = a ; c = b + 1 | 0 ; f [ h >> 2 ] = c ; d [ c >> 0 ] = a >>> 20 ; c = f [ j >> 2 ] & 1048575 ; f [ j >> 2 ] = c ; f [ i >> 2 ] = 7 ; b = 7 ; break } else { c = b + 1 | 0 ; f [ h >> 2 ] = c ; d [ c >> 0 ] = ( f [ j >> 2 ] | 0 ) >>> 19 ; c = f [ j >> 2 ] & 524287 ; f [ j >> 2 ] = c ; f [ i >> 2 ] = 8 ; b = 8 ; break }} else { c = b + 1 | 0 ; f [ h >> 2 ] = c ; d [ c >> 0 ] = g >>> 19 ; c = f [ j >> 2 ] & 1048575 ; f [ j >> 2 ] = c ; f [ i >> 2 ] = 7 ; b = 7 } while ( 0 ); e = f [ k >> 2 ] | 0 } if ( ! ( e & 32768 )) g = c ; else break } return } function ch ( a ){ a = a | 0 ; var b = 0 , c = 0 , e = 0 , g = 0 , h = 0 ; h = f [ a >> 2 ] | 0 ; e = h | 65535 ; g = a + 8 | 0 ; e = ( e >>> 0 < (( f [ a + 4 >> 2 ] | 0 ) + h | 0 ) >>> 0 ? e : e +- 32768 | 0 ) << f [ g >> 2 ]; f [ a >> 2 ] = e ; h = a + 12 | 0 ; b = f [ h >> 2 ] | 0 ; c = d [ b >> 0 ] | 0 ; do if ( c << 24 >> 24 !=- 1 ){ if ( ! ( e & 134217728 )){ b = b + 1 | 0 ; f [ h >> 2 ] = b ; d [ b >> 0 ] = e >>> 19 ; b = f [ a >> 2 ] & 524287 ; f [ a >> 2 ] = b ; f [ g >> 2 ] = 8 ; c = 8 ; break } d [ b >> 0 ] = c + 1 << 24 >> 24 ; b = f [ h >> 2 ] | 0 ; if (( d [ b >> 0 ] | 0 ) ==- 1 ){ c = f [ a >> 2 ] & 134217727 ; f [ a >> 2 ] = c ; b = b + 1 | 0 ; f [ h >> 2 ] = b ; d [ b >> 0 ] = c >>> 20 ; b = f [ a >> 2 ] & 1048575 ; f [ a >> 2 ] = b ; f [ g >> 2 ] = 7 ; c = 7 ; break } else { b = b + 1 | 0 ; f [ h >> 2 ] = b ; d [ b >> 0 ] = ( f [ a >> 2 ] | 0 ) >>> 19 ; b = f [ a >> 2 ] & 524287 ; f [ a >> 2 ] = b ; f [ g >> 2 ] = 8 ; c = 8 ; break }} else { b = b + 1 | 0 ; f [ h >> 2 ] = b ; d [ b >> 0 ] = e >>> 20 ; b = f [ a >> 2 ] & 1048575 ; f [ a >> 2 ] = b ; f [ g >> 2 ] = 7 ; c = 7 } while ( 0 ); b = b << c ; f [ a >> 2 ] = b ; c = f [ h >> 2 ] | 0 ; e = d [ c >> 0 ] | 0 ; do if ( e << 24 >> 24 !=- 1 ){ if ( ! ( b & 134217728 )){ e = c + 1 | 0 ; f [ h >> 2 ] = e ; d [ e >> 0 ] = b >>> 19 ; f [ a >> 2 ] = f [ a >> 2 ] & 524287 ; f [ g >> 2 ] = 8 ; break } d [ c >> 0 ] = e + 1 << 24 >> 24 ; b = f [ h >> 2 ] | 0 ; if (( d [ b >> 0 ] | 0 ) ==- 1 ){ c = f [ a >> 2 ] & 134217727 ; f [ a >> 2 ] = c ; e = b + 1 | 0 ; f [ h >> 2 ] = e ; d [ e >> 0 ] = c >>> 20 ; f [ a >> 2 ] = f [ a >> 2 ] & 1048575 ; f [ g >> 2 ] = 7 ; break } else { e = b + 1 | 0 ; f [ h >> 2 ] = e ; d [ e >> 0 ] = ( f [ a >> 2 ] | 0 ) >>> 19 ; f [ a >> 2 ] = f [ a >> 2 ] & 524287 ; f [ g >> 2 ] = 8 ; break }} else { e = c + 1 | 0 ; f [ h >> 2 ] = e ; d [ e >> 0 ] = b >>> 20 ; f [ a >> 2 ] = f [ a >> 2 ] & 1048575 ; f [ g >> 2 ] = 7 } while ( 0 ); b = f [ h >> 2 ] | 0 ; if (( d [ b >> 0 ] | 0 ) ==- 1 ) return ; f [ h >> 2 ] = b + 1 ; return } function dh ( a ){ a = a | 0 ; f [ a >> 2 ] = 0 ; f [ a + 8 >> 2 ] = 8 ; return } function eh ( a , b ){ a = a | 0 ; b = b | 0 ; var c = 0 , e = 0 , g = 0 ; c = a + 8 | 0 ; e = ( f [ c >> 2 ] | 0 ) +- 1 | 0 ; f [ c >> 2 ] = e ; b = ( b << e ) + ( f [ a >> 2 ] | 0 ) | 0 ; f [ a >> 2 ] = b ; if ( e ) return ; e = a + 12 | 0 ; g = ( f [ e >> 2 ] | 0 ) + 1 | 0 ; f [ e >> 2 ] = g ; d [ g >> 0 ] = b ; f [ c >> 2 ] = 8 ; f [ c >> 2 ] = ( d [ f [ e >> 2 ] >> 0 ] | 0 ) ==- 1 ? 7 : 8 ; f [ a >> 2 ] = 0 ; return } function fh ( a ){ a = a | 0 ; f [ a + 28 >> 2 ] = 1156 ; f [ a + 32 >> 2 ] = 1156 ; f [ a + 36 >> 2 ] = 1156 ; f [ a + 40 >> 2 ] = 1156 ; f [ a + 44 >> 2 ] = 1156 ; f [ a + 48 >> 2 ] = 1156 ; f [ a + 52 >> 2 ] = 1156 ; f [ a + 56 >> 2 ] = 1156 ; f [ a + 60 >> 2 ] = 1156 ; f [ a + 64 >> 2 ] = 1156 ; f [ a + 68 >> 2 ] = 1156 ; f [ a + 72 >> 2 ] = 1156 ; f [ a + 76 >> 2 ] = 1156 ; f [ a + 80 >> 2 ] = 1156 ; f [ a + 84 >> 2 ] = 1156 ; f [ a + 88 >> 2 ] = 1156 ; f [ a + 96 >> 2 ] = 2628 ; f [ a + 92 >> 2 ] = 1252 ; f [ a + 24 >> 2 ] = 1284 ; return } function gh ( a ){ a = a | 0 ; f [ a + 24 >> 2 ] = 1156 ; f [ a + 28 >> 2 ] = 1156 ; f [ a + 32 >> 2 ] = 1156 ; f [ a + 36 >> 2 ] = 1156 ; f [ a + 40 >> 2 ] = 1156 ; f [ a + 44 >> 2 ] = 1156 ; f [ a + 48 >> 2 ] = 1156 ; f [ a + 52 >> 2 ] = 1156 ; f [ a + 56 >> 2 ] = 1156 ; f [ a + 60 >> 2 ] = 1156 ; f [ a + 64 >> 2 ] = 1156 ; f [ a + 68 >> 2 ] = 1156 ; f [ a + 72 >> 2 ] = 1156 ; f [ a + 76 >> 2 ] = 1156 ; f [ a + 80 >> 2 ] = 1156 ; f [ a + 84 >> 2 ] = 1156 ; f [ a + 88 >> 2 ] = 1156 ; f [ a + 92 >> 2 ] = 1156 ; f [ a + 96 >> 2 ] = 1156 ; return } function hh ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; f [ a + 24 + ( b << 2 ) >> 2 ] = 1156 + (( d << 1 ) + c << 4 ); return } function ih ( a ){ a = a | 0 ; var b = 0 , c = 0 ; f [ a + 100 >> 2 ] = a + 24 ; f [ a + 4 >> 2 ] = 32768 ; f [ a >> 2 ] = 0 ; b = a + 8 | 0 ; f [ b >> 2 ] = 12 ; c = a + 12 | 0 ; a = ( f [ c >> 2 ] | 0 ) +- 1 | 0 ; f [ c >> 2 ] = a ; if (( d [ a >> 0 ] | 0 ) !=- 1 ) return ; f [ b >> 2 ] = 13 ; return } function jh ( a ){ a = a | 0 ; var b = 0 , c = 0 , e = 0 , g = 0 , h = 0 , i = 0 ; i = a + 8 | 0 ; b = f [ i >> 2 ]
if ( ! ( f [ a >> 2 ] & 32 )) _h ( w , s , a ) | 0 ; ui ( a , 32 , m , r , p ^ 8192 ); w = J } a : do if (( L | 0 ) == 245 ) if ( ! a ) if ( b ){ j = 1 ; while ( 1 ){ b = f [ i + ( j << 2 ) >> 2 ] | 0 ; if ( ! b ) break ; si ( h + ( j << 3 ) | 0 , b , c ); j = j + 1 | 0 ; if (( j | 0 ) >= 10 ){ j = 1 ; break a }} if (( j | 0 ) < 10 ) while ( 1 ){ if ( f [ i + ( j << 2 ) >> 2 ] | 0 ){ j =- 1 ; break a } j = j + 1 | 0 ; if (( j | 0 ) >= 10 ){ j = 1 ; break }} else j = 1 } else j = 0 ; while ( 0 ); l = ha ; return j | 0 } function ri ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var d = 0 , e = 0 ; d = a + 20 | 0 ; e = f [ d >> 2 ] | 0 ; a = ( f [ a + 16 >> 2 ] | 0 ) - e | 0 ; a = a >>> 0 > c >>> 0 ? c : a ; Ki ( e | 0 , b | 0 , a | 0 ) | 0 ; f [ d >> 2 ] = ( f [ d >> 2 ] | 0 ) + a ; return c | 0 } function si ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var d = 0 , e = 0 , g = 0.0 ; a : do if ( b >>> 0 <= 20 ) do switch ( b | 0 ){ case 9 : { d = ( f [ c >> 2 ] | 0 ) + ( 4 - 1 ) &~ ( 4 - 1 ); b = f [ d >> 2 ] | 0 ; f [ c >> 2 ] = d + 4 ; f [ a >> 2 ] = b ; break a } case 10 : { d = ( f [ c >> 2 ] | 0 ) + ( 4 - 1 ) &~ ( 4 - 1 ); b = f [ d >> 2 ] | 0 ; f [ c >> 2 ] = d + 4 ; d = a ; f [ d >> 2 ] = b ; f [ d + 4 >> 2 ] = (( b | 0 ) < 0 ) << 31 >> 31 ; break a } case 11 : { d = ( f [ c >> 2 ] | 0 ) + ( 4 - 1 ) &~ ( 4 - 1 ); b = f [ d >> 2 ] | 0 ; f [ c >> 2 ] = d + 4 ; d = a ; f [ d >> 2 ] = b ; f [ d + 4 >> 2 ] = 0 ; break a } case 12 : { d = ( f [ c >> 2 ] | 0 ) + ( 8 - 1 ) &~ ( 8 - 1 ); b = d ; e = f [ b >> 2 ] | 0 ; b = f [ b + 4 >> 2 ] | 0 ; f [ c >> 2 ] = d + 8 ; d = a ; f [ d >> 2 ] = e ; f [ d + 4 >> 2 ] = b ; break a } case 13 : { e = ( f [ c >> 2 ] | 0 ) + ( 4 - 1 ) &~ ( 4 - 1 ); d = f [ e >> 2 ] | 0 ; f [ c >> 2 ] = e + 4 ; d = ( d & 65535 ) << 16 >> 16 ; e = a ; f [ e >> 2 ] = d ; f [ e + 4 >> 2 ] = (( d | 0 ) < 0 ) << 31 >> 31 ; break a } case 14 : { e = ( f [ c >> 2 ] | 0 ) + ( 4 - 1 ) &~ ( 4 - 1 ); d = f [ e >> 2 ] | 0 ; f [ c >> 2 ] = e + 4 ; e = a ; f [ e >> 2 ] = d & 65535 ; f [ e + 4 >> 2 ] = 0 ; break a } case 15 : { e = ( f [ c >> 2 ] | 0 ) + ( 4 - 1 ) &~ ( 4 - 1 ); d = f [ e >> 2 ] | 0 ; f [ c >> 2 ] = e + 4 ; d = ( d & 255 ) << 24 >> 24 ; e = a ; f [ e >> 2 ] = d ; f [ e + 4 >> 2 ] = (( d | 0 ) < 0 ) << 31 >> 31 ; break a } case 16 : { e = ( f [ c >> 2 ] | 0 ) + ( 4 - 1 ) &~ ( 4 - 1 ); d = f [ e >> 2 ] | 0 ; f [ c >> 2 ] = e + 4 ; e = a ; f [ e >> 2 ] = d & 255 ; f [ e + 4 >> 2 ] = 0 ; break a } case 17 : { e = ( f [ c >> 2 ] | 0 ) + ( 8 - 1 ) &~ ( 8 - 1 ); g =+ k [ e >> 3 ]; f [ c >> 2 ] = e + 8 ; k [ a >> 3 ] = g ; break a } case 18 : { e = ( f [ c >> 2 ] | 0 ) + ( 8 - 1 ) &~ ( 8 - 1 ); g =+ k [ e >> 3 ]; f [ c >> 2 ] = e + 8 ; k [ a >> 3 ] = g ; break a } default : break a } while ( 0 ); while ( 0 ); return } function ti ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; var e = 0 ; if ( b >>> 0 > 0 | ( b | 0 ) == 0 & a >>> 0 > 4294967295 ) while ( 1 ){ e = Ri ( a | 0 , b | 0 , 10 , 0 ) | 0 ; c = c +- 1 | 0 ; d [ c >> 0 ] = e | 48 ; e = Qi ( a | 0 , b | 0 , 10 , 0 ) | 0 ; if ( b >>> 0 > 9 | ( b | 0 ) == 9 & a >>> 0 > 4294967295 ){ a = e ; b = F } else { a = e ; break }} if ( a ) while ( 1 ){ c = c +- 1 | 0 ; d [ c >> 0 ] = ( a >>> 0 ) % 10 | 0 | 48 ; if ( a >>> 0 < 10 ) break ; else a = ( a >>> 0 ) / 10 | 0 } return c | 0 } function ui ( a , b , c , d , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; var g = 0 , h = 0 , i = 0 ; i = l ; l = l + 256 | 0 ; h = i ; do if (( c | 0 ) > ( d | 0 ) & ( e & 73728 | 0 ) == 0 ){ e = c - d | 0 ; Gi ( h | 0 , b | 0 ,( e >>> 0 > 256 ? 256 : e ) | 0 ) | 0 ; b = f [ a >> 2 ] | 0 ; g = ( b & 32 | 0 ) == 0 ; if ( e >>> 0 > 255 ){ d = c - d | 0 ; do { if ( g ){ _h ( h , 256 , a ) | 0 ; b = f [ a >> 2 ] | 0 } e = e +- 256 | 0 ; g = ( b & 32 | 0 ) == 0 } while ( e >>> 0 > 255 ); if ( g ) e = d & 255 ; else break } else if ( ! g ) break ; _h ( h , e , a ) | 0 } while ( 0 ); l = i ; return } function vi ( a ){ a = a | 0 ; var b = 0 , c = 0 , d = 0 , e = 0 , g = 0 , h = 0 , i = 0 , j = 0 , k = 0 , l = 0 , m = 0 , n = 0 , o = 0 , p = 0 , q = 0 , r = 0 , s = 0 , t = 0 , u = 0 , v = 0 , w = 0 , x = 0 , y = 0 , z = 0 , A = 0 , B = 0 , C = 0 , D = 0 , E = 0 , F = 0 , G = 0 , H = 0 , I = 0 , J = 0 , K = 0 , L = 0 , M = 0 ; do if ( a >>> 0 < 245 ){ o = a >>> 0 < 11 ? 16 : a + 11 &- 8 ; a = o >>> 3 ; i = f [ 735 ] | 0 ; c = i >>> a ; if ( c & 3 ){ a = ( c & 1 ^ 1 ) + a | 0 ; d = a << 1 ; c = 2980 + ( d << 2 ) | 0 ; d = 2980 + ( d + 2 << 2 ) | 0 ; e = f [ d >> 2 ] | 0 ; g = e + 8 | 0 ; h = f [ g >> 2 ] | 0 ; do if (( c | 0 ) != ( h | 0 )){ if ( h >>> 0 < ( f [ 739 ] | 0 ) >>> 0 ) wa (); b = h + 12 | 0 ; if (( f [ b >> 2 ] | 0 ) == ( e | 0 )){ f [ b >> 2 ] = c ; f [ d >> 2 ] = h ; break } else wa ()} else f [ 735 ] = i &~ ( 1 << a ); while ( 0 ); M = a << 3 ; f [ e + 4 >> 2 ] = M | 3 ; M = e + ( M | 4 ) | 0 ; f [ M >> 2 ] = f [ M >> 2 ] | 1 ; M = g ; return M | 0 } h = f [ 737 ] | 0 ; if ( o >>> 0 > h >>> 0 ){ if ( c ){ d = 2 << a ; d = c << a & ( d | 0 - d ); d = ( d & 0 - d ) +- 1 | 0 ; j = d >>> 12 & 16 ; d = d >>> j ; e = d >>> 5 & 8 ; d = d >>> e ; g = d >>> 2 & 4 ; d = d >>> g ; c = d >>> 1 & 2 ; d = d >>> c ; a = d >>> 1 & 1 ; a = ( e | j | g | c | a ) + ( d >>> a ) | 0 ; d = a << 1 ; c = 2980 + ( d << 2 ) | 0 ; d = 2980 + ( d + 2 << 2 ) | 0 ; g = f [ d >> 2 ] | 0 ; j = g + 8 | 0 ; e = f [ j >> 2 ] | 0 ; do if (( c | 0 ) != ( e | 0 )){ if ( e >>> 0 < ( f [ 739 ] | 0 ) >>> 0 ) wa (); b = e + 12 | 0 ; if (( f [ b >> 2 ] | 0 ) == ( g | 0 )){ f [ b >> 2 ] = c ; f [ d >> 2 ] = e ; k = f [ 737 ] | 0 ; break } else wa ()} else { f [ 735 ] = i &~ ( 1 << a ); k = h } while ( 0 ); M = a << 3 ; h = M - o | 0 ; f [ g + 4 >> 2 ] = o | 3 ; i = g + o | 0 ; f [ g + ( o | 4 ) >> 2 ] = h | 1 ; f [ g + M >> 2 ] = h ; if ( k ){ e = f [ 740 ] | 0 ; c = k >>> 3 ; b = c << 1 ; d = 2980 + ( b << 2 ) | 0 ; a = f [ 735 ] | 0 ; c = 1 << c ; if ( a & c ){ a = 2980 + ( b + 2 << 2 ) | 0 ; b = f [ a >> 2 ] | 0 ; if ( b >>> 0 < ( f [ 739 ] | 0 ) >>> 0 ) wa (); else { l = a ; m = b }} else { f [ 735 ] = a | c ; l = 2980 + ( b + 2 << 2 ) | 0 ; m = d } f [ l >> 2 ] = e ; f [ m + 12 >> 2 ] = e ; f [ e + 8 >> 2 ] = m ; f [ e + 12 >> 2 ] = d } f [ 737 ] = h ; f [ 740 ] = i ; M = j ; return M | 0 } a = f [ 736 ] | 0 ; if ( a ){ c = ( a & 0 - a ) +- 1 | 0 ; L = c >>> 12 & 16 ; c = c >>> L ; K = c >>> 5 & 8 ; c = c >>> K ; M = c >>> 2 & 4 ; c = c >>> M ; a = c >>> 1 & 2 ; c = c >>> a ; d = c >>> 1 & 1 ; d = f [ 3244 + (( K | L | M | a | d ) + ( c >>> d ) << 2 ) >> 2 ] | 0 ; c = ( f [ d + 4 >> 2 ] &- 8 ) - o | 0 ; a = d ; while ( 1 ){ b = f [ a + 16 >> 2 ] | 0 ; if ( ! b ){ b = f [ a + 20 >> 2 ] | 0 ; if ( ! b ){ j = c ; break }} a = ( f [ b + 4 >> 2 ] &- 8 ) - o | 0 ; M = a >>> 0 < c >>> 0 ; c = M ? a : c ; a = b ; d = M ? b : d } g = f [ 739 ] | 0 ; if ( d >>> 0 < g >>> 0 ) wa (); i = d + o | 0 ; if ( d >>> 0 >= i >>> 0 ) wa (); h = f [ d + 24 >> 2 ] | 0 ; c = f [ d + 12 >> 2 ] | 0 ; do if (( c | 0 ) == ( d | 0 )){ a = d + 20 | 0 ; b = f [ a >> 2 ] | 0 ; if ( ! b ){ a = d + 16 | 0 ; b = f [ a >> 2 ] | 0 ; if ( ! b ){ n = 0 ; break }} while ( 1 ){ c = b + 20 | 0 ; e = f [ c >> 2 ] | 0 ; if ( e ){ b = e ; a = c ;
b = g + 1 | 0 ; i = 31 - g | 0 ; h = b ; a = k << i | l >>> ( b >>> 0 ); b = k >>> ( b >>> 0 ); g = 0 ; i = l << i ; break } if ( ! e ){ o = 0 ; p = 0 ; return ( F = o , p ) | 0 } f [ e >> 2 ] = a | 0 ; f [ e + 4 >> 2 ] = j | b & 0 ; o = 0 ; p = 0 ; return ( F = o , p ) | 0 } while ( 0 ); if ( ! h ){ k = i ; j = 0 ; i = 0 } else { m = c | 0 | 0 ; l = n | d & 0 ; k = Ii ( m | 0 , l | 0 , - 1 , - 1 ) | 0 ; c = F ; j = i ; i = 0 ; do { d = j ; j = g >>> 31 | j << 1 ; g = i | g << 1 ; d = a << 1 | d >>> 31 | 0 ; n = a >>> 31 | b << 1 | 0 ; Ei ( k , c , d , n ) | 0 ; p = F ; o = p >> 31 | (( p | 0 ) < 0 ?- 1 : 0 ) << 1 ; i = o & 1 ; a = Ei ( d , n , o & m ,((( p | 0 ) < 0 ?- 1 : 0 ) >> 31 | (( p | 0 ) < 0 ?- 1 : 0 ) << 1 ) & l ) | 0 ; b = F ; h = h - 1 | 0 } while (( h | 0 ) != 0 ); k = j ; j = 0 } h = 0 ; if ( e ){ f [ e >> 2 ] = a ; f [ e + 4 >> 2 ] = b } o = ( g | 0 ) >>> 31 | ( k | h ) << 1 | ( h << 1 | g >>> 31 ) & 0 | j ; p = ( g << 1 | 0 >>> 31 ) &- 2 | i ; return ( F = o , p ) | 0 } function Ti ( a , b , c , d , e , f , g , h ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; f = f | 0 ; g = g | 0 ; h = h | 0 ; return rj [ a & 3 ]( b | 0 , c | 0 , d | 0 , e | 0 , f | 0 , g | 0 , h | 0 ) | 0 } function Ui ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; return sj [ a & 63 ]( b | 0 , c | 0 , d | 0 ) | 0 } function Vi ( a , b ){ a = a | 0 ; b = b | 0 ; return + tj [ a & 3 ]( b | 0 )} function Wi ( a , b ){ a = a | 0 ; b = b | 0 ; uj [ a & 7 ]( b | 0 )} function Xi ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; vj [ a & 7 ]( b | 0 , c | 0 )} function Yi ( a , b , c , d , e , f , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; f = f | 0 ; g = g | 0 ; return wj [ a & 7 ]( b | 0 , c | 0 , d | 0 , e | 0 , f | 0 , g | 0 ) | 0 } function Zi ( a , b ){ a = a | 0 ; b = b | 0 ; return xj [ a & 15 ]( b | 0 ) | 0 } function $i ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; yj [ a & 15 ]( b | 0 , c | 0 , d | 0 )} function _i ( a , b , c , d , e , f , g , h , i , j , k , l ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; f = f | 0 ; g = g | 0 ; h = h | 0 ; i = i | 0 ; j = j | 0 ; k = k | 0 ; l = l | 0 ; return zj [ a & 3 ]( b | 0 , c | 0 , d | 0 , e | 0 , f | 0 , g | 0 , h | 0 , i | 0 , j | 0 , k | 0 , l | 0 ) | 0 } function aj ( a , b , c , d , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; return Aj [ a & 63 ]( b | 0 , c | 0 , d | 0 , e | 0 ) | 0 } function bj ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; return Bj [ a & 7 ]( b | 0 , c | 0 ) | 0 } function cj ( a , b , c , d , e , f ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; f = f | 0 ; return Cj [ a & 3 ]( b | 0 , c | 0 , d | 0 , e | 0 , f | 0 ) | 0 } function dj ( a , b , c , d , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; Dj [ a & 3 ]( b | 0 , c | 0 , d | 0 , e | 0 )} function ej ( a , b , c , d , e , f , g ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; f = f | 0 ; g = g | 0 ; ea ( 0 ); return 0 } function fj ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; ea ( 1 ); return 0 } function gj ( a ){ a = a | 0 ; ea ( 2 ); return 0.0 } function hj ( a ){ a = a | 0 ; ea ( 3 )} function ij ( a , b ){ a = a | 0 ; b = b | 0 ; ea ( 4 )} function jj ( a , b , c , d , e , f ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; f = f | 0 ; ea ( 5 ); return 0 } function kj ( a ){ a = a | 0 ; ea ( 6 ); return 0 } function lj ( a , b , c ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; ea ( 7 )} function mj ( a , b , c , d , e , f , g , h , i , j , k ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; f = f | 0 ; g = g | 0 ; h = h | 0 ; i = i | 0 ; j = j | 0 ; k = k | 0 ; ea ( 8 ); return 0 } function nj ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; ea ( 9 ); return 0 } function oj ( a , b ){ a = a | 0 ; b = b | 0 ; ea ( 10 ); return 0 } function pj ( a , b , c , d , e ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; e = e | 0 ; ea ( 11 ); return 0 } function qj ( a , b , c , d ){ a = a | 0 ; b = b | 0 ; c = c | 0 ; d = d | 0 ; ea ( 12 )} var rj = [ ej , _e , Ib , ej ]; var sj = [ fj , ri , Lh , Jh , vd , wd , xd , yd , Ce , De , Fe , We , jf , Ab , Ob , kf , lf , zb , Bb , Ge , He , Ie , Je , pf , qf , rf , sf , uf , vf , xf , yf , zf , Af , Bf , Cf , Df , Ef , Ff , Gf , Hf , If , Jf , Kf , Lf , Mf , Nf , Of , Pf , Qf , Rf , Sf , Tf , Sb , Tb , Ub , Vb , Wb , Xb , Yb , Zb , Ih , Kh , fj , fj ]; var tj = [ gj , Uf , Vf , gj ]; var uj = [ hj , Te , Hb , Tc , Uc , ni , oi , hj ]; var vj = [ ij , hd , id , jd , Rd , Re , xb , ij ]; var wj = [ jj , $e , Gb , nf , Fb , jj , jj , jj ]; var xj = [ kj , Hh , ef , ff , Nb , Mb , Oh , Ag , xg , kj , kj , kj , kj , kj , kj , kj ]; var yj = [ lj , sb , tb , ub , vb , mb , nb , ob , pb , ib , jb , kb , lb , bf , Lb , lj ]; var zj = [ mj , Ze , Eb , mj ]; var Aj = [ nj , _f , ag , Ta , Ua , Va , Wa , Xa , Ya , Za , $a , _a , ab , bb , cb , db , eb , fb , gb , hb , ic , jc , kc , cc , dc , ec , fc , gc , hc , rd , sd , td , ud , gf , Xe , wb , Db , mf , Ue , Cb , yb , nj , nj , nj , nj , nj , nj , nj , nj , nj , nj , nj , nj , nj , nj , nj , nj , nj , nj , nj , nj , nj , nj , nj ]; var Bj = [ oj , Ee , $b , _b , ac , bc , oj , oj ]; var Cj = [ pj , hf , Jb , pj ]; var Dj = [ qj , Eg , Hg , qj ]; return { _opj_stream_destroy : Ad , _opj_stream_set_read_function : Bd , _opj_read_tile_header : he , _opj_set_warning_handler : Zd , _opj_destroy_cstr_info : xe , _opj_image_create : Td , _opj_set_error_handler : $d , _opj_stream_set_user_data : Fd , _opj_end_decompress : re , _bitshift64Lshr : Ji , _opj_stream_set_seek_function : Cd , _opj_decode : fe , _opj_set_decoded_resolution_factor : ke , _i64Add : Ii , _opj_stream_create_default_file_stream : Ae , _opj_set_default_decoder_parameters : ce , _bitshift64Ashr : Fi , _opj_get_decoded_tile : je , _memset : Gi , _opj_version : ae , _memcpy : Ki , _opj_destroy_cstr_index : ze , _opj_stream_set_user_data_length : Gd , _opj_stream_set_skip_function : Ed , _opj_image_destroy : Ud , _opj_stream_create_file_stream : Be , _opj_setup_encoder : ne , _opj_stream_default_create : zd , _bitshift64Shl : Hi , _opj_stream_create : qd , _jp2_version : gd , _i64Subtract : Ei , _opj_get_cstr_index : ye , _opj_encode : pe , _opj_read_header : ee , _opj_get_cstr_info : we , _opj_set_default_encoder_parameters : me , _opj_set_decode_area : ge , _opj_stream_set_write_function : Dd , _opj_dump_co
if ( 0 !== a . avail_in || 0 !== h . lookahead || b !== H && h . status !== ra ){ var o = h . strategy === T ? r ( h , b ) : h . strategy === U ? q ( h , b ) : B [ h . level ]. func ( h , b ); if (( o === ua || o === va ) && ( h . status = ra ), o === sa || o === ua ) return 0 === a . avail_out && ( h . last_flush =- 1 ), M ; if ( o === ta && ( b === I ? D . _tr_align ( h ) : b !== L && ( D . _tr_stored_block ( h , 0 , 0 , ! 1 ), b === J && ( f ( h . head ), 0 === h . lookahead && ( h . strstart = 0 , h . block_start = 0 , h . insert = 0 ))), g ( a ), 0 === a . avail_out )) return h . last_flush =- 1 , M } return b !== K ? M : h . wrap <= 0 ? N : ( 2 === h . wrap ? ( i ( h , 255 & a . adler ), i ( h , a . adler >> 8 & 255 ), i ( h , a . adler >> 16 & 255 ), i ( h , a . adler >> 24 & 255 ), i ( h , 255 & a . total_in ), i ( h , a . total_in >> 8 & 255 ), i ( h , a . total_in >> 16 & 255 ), i ( h , a . total_in >> 24 & 255 )) : ( j ( h , a . adler >>> 16 ), j ( h , 65535 & a . adler )), g ( a ), h . wrap > 0 && ( h . wrap =- h . wrap ), 0 !== h . pending ? M : N )} function A ( a ){ var b ; return a && a . state ? ( b = a . state . status , b !== la && b !== ma && b !== na && b !== oa && b !== pa && b !== qa && b !== ra ? d ( a , O ) : ( a . state = null , b === qa ? d ( a , P ) : M )) : O } var B , C = a ( "../utils/common" ), D = a ( "./trees" ), E = a ( "./adler32" ), F = a ( "./crc32" ), G = a ( "./messages" ), H = 0 , I = 1 , J = 3 , K = 4 , L = 5 , M = 0 , N = 1 , O =- 2 , P =- 3 , Q =- 5 , R =- 1 , S = 1 , T = 2 , U = 3 , V = 4 , W = 0 , X = 2 , Y = 8 , Z = 9 , $ = 15 , _ = 8 , aa = 29 , ba = 256 , ca = ba + 1 + aa , da = 30 , ea = 19 , fa = 2 * ca + 1 , ga = 15 , ha = 3 , ia = 258 , ja = ia + ha + 1 , ka = 32 , la = 42 , ma = 69 , na = 73 , oa = 91 , pa = 103 , qa = 113 , ra = 666 , sa = 1 , ta = 2 , ua = 3 , va = 4 , wa = 3 , xa = function ( a , b , c , d , e ){ this . good_length = a , this . max_lazy = b , this . nice_length = c , this . max_chain = d , this . func = e }; B = [ new xa ( 0 , 0 , 0 , 0 , n ), new xa ( 4 , 4 , 8 , 4 , o ), new xa ( 4 , 5 , 16 , 8 , o ), new xa ( 4 , 6 , 32 , 32 , o ), new xa ( 4 , 4 , 16 , 16 , p ), new xa ( 8 , 16 , 32 , 32 , p ), new xa ( 8 , 16 , 128 , 128 , p ), new xa ( 8 , 32 , 128 , 256 , p ), new xa ( 32 , 128 , 258 , 1024 , p ), new xa ( 32 , 258 , 258 , 4096 , p )], c . deflateInit = y , c . deflateInit2 = x , c . deflateReset = v , c . deflateResetKeep = u , c . deflateSetHeader = w , c . deflate = z , c . deflateEnd = A , c . deflateInfo = "pako deflate (from Nodeca project)" },{ "../utils/common" : 3 , "./adler32" : 5 , "./crc32" : 7 , "./messages" : 13 , "./trees" : 14 }], 9 : [ function ( a , b , c ){ "use strict" ; function d (){ this . text = 0 , this . time = 0 , this . xflags = 0 , this . os = 0 , this . extra = null , this . extra_len = 0 , this . name = "" , this . comment = "" , this . hcrc = 0 , this . done =! 1 } b . exports = d },{}], 10 : [ function ( a , b , c ){ "use strict" ; var d = 30 , e = 12 ; b . exports = function ( a , b ){ var c , f , g , h , i , j , k , l , m , n , o , p , q , r , s , t , u , v , w , x , y , z , A , B , C ; c = a . state , f = a . next_in , B = a . input , g = f + ( a . avail_in - 5 ), h = a . next_out , C = a . output , i = h - ( b - a . avail_out ), j = h + ( a . avail_out - 257 ), k = c . dmax , l = c . wsize , m = c . whave , n = c . wnext , o = c . window , p = c . hold , q = c . bits , r = c . lencode , s = c . distcode , t = ( 1 << c . lenbits ) - 1 , u = ( 1 << c . distbits ) - 1 ; a : do { 15 > q && ( p += B [ f ++ ] << q , q += 8 , p += B [ f ++ ] << q , q += 8 ), v = r [ p & t ]; b : for (;;){ if ( w = v >>> 24 , p >>>= w , q -= w , w = v >>> 16 & 255 , 0 === w ) C [ h ++ ] = 65535 & v ; else { if ( ! ( 16 & w )){ if ( 0 === ( 64 & w )){ v = r [( 65535 & v ) + ( p & ( 1 << w ) - 1 )]; continue b } if ( 32 & w ){ c . mode = e ; break a } a . msg = "invalid literal/length code" , c . mode = d ; break a } x = 65535 & v , w &= 15 , w && ( w > q && ( p += B [ f ++ ] << q , q += 8 ), x += p & ( 1 << w ) - 1 , p >>>= w , q -= w ), 15 > q && ( p += B [ f ++ ] << q , q += 8 , p += B [ f ++ ] << q , q += 8 ), v = s [ p & u ]; c : for (;;){ if ( w = v >>> 24 , p >>>= w , q -= w , w = v >>> 16 & 255 , ! ( 16 & w )){ if ( 0 === ( 64 & w )){ v = s [( 65535 & v ) + ( p & ( 1 << w ) - 1 )]; continue c } a . msg = "invalid distance code" , c . mode = d ; break a } if ( y = 65535 & v , w &= 15 , w > q && ( p += B [ f ++ ] << q , q += 8 , w > q && ( p += B [ f ++ ] << q , q += 8 )), y += p & ( 1 << w ) - 1 , y > k ){ a . msg = "invalid distance too far back" , c . mode = d ; break a } if ( p >>>= w , q -= w , w = h - i , y > w ){ if ( w = y - w , w > m && c . sane ){ a . msg = "invalid distance too far back" , c . mode = d ; break a } if ( z = 0 , A = o , 0 === n ){ if ( z += l - w , x > w ){ x -= w ; do C [ h ++ ] = o [ z ++ ]; while ( -- w ); z = h - y , A = C }} else if ( w > n ){ if ( z += l + n - w , w -= n , x > w ){ x -= w ; do C [ h ++ ] = o [ z ++ ]; while ( -- w ); if ( z = 0 , x > n ){ w = n , x -= w ; do C [ h ++ ] = o [ z ++ ]; while ( -- w ); z = h - y , A = C }}} else if ( z += n - w , x > w ){ x -= w ; do C [ h ++ ] = o [ z ++ ]; while ( -- w ); z = h - y , A = C } for (; x > 2 ;) C [ h ++ ] = A [ z ++ ], C [ h ++ ] = A [ z ++ ], C [ h ++ ] = A [ z ++ ], x -= 3 ; x && ( C [ h ++ ] = A [ z ++ ], x > 1 && ( C [ h ++ ] = A [ z ++ ]))} else { z = h - y ; do C [ h ++ ] = C [ z ++ ], C [ h ++ ] = C [ z ++ ], C [ h ++ ] = C [ z ++ ], x -= 3 ; while ( x > 2 ); x && ( C [ h ++ ] = C [ z ++ ], x > 1 && ( C [ h ++ ] = C [ z ++ ]))} break }} break }} while ( g > f && j > h ); x = q >> 3 , f -= x , q -= x << 3 , p &= ( 1 << q ) - 1 , a . next_in = f , a . next_out = h , a . avail_in = g > f ? 5 + ( g - f ) : 5 - ( f - g ), a . avail_out = j > h ? 257 + ( j - h ) : 257 - ( h - j ), c . hold = p , c . bits = q }},{}], 11 : [ function ( a , b , c ){ "use strict" ; function d ( a ){ return ( a >>> 24 & 255 ) + ( a >>> 8 & 65280 ) + (( 65280 & a ) << 8 ) + (( 255 & a ) << 24 )} function e (){ this . mode = 0 , this . last =! 1 , this . wrap = 0 , this . havedict =! 1 , this . flags = 0 , this . dmax = 0 , this . check = 0 , this . total = 0 , this . head = null , this . wbits = 0 , this . wsize = 0 , this . whave = 0 , thi
