{"version":3,"sources":["webpack:///./node_modules/asn1.js/lib/asn1/constants/index.js","webpack:///./node_modules/asn1.js/lib/asn1/decoders/index.js","webpack:///./node_modules/asn1.js/lib/asn1/encoders/index.js","webpack:///./node_modules/asn1.js/lib/asn1/encoders/der.js","webpack:///./node_modules/asn1.js/lib/asn1/base/index.js","webpack:///./node_modules/asn1.js/lib/asn1/base/buffer.js","webpack:///./node_modules/asn1.js/lib/asn1.js","webpack:///./node_modules/asn1.js/lib/asn1/base/node.js","webpack:///./node_modules/asn1.js/lib/asn1/encoders/pem.js","webpack:///./node_modules/asn1.js/lib/asn1/constants/der.js","webpack:///./node_modules/asn1.js/lib/asn1/decoders/pem.js","webpack:///./node_modules/asn1.js/node_modules/bn.js/lib/bn.js","webpack:///./node_modules/asn1.js/lib/asn1/decoders/der.js","webpack:///./node_modules/asn1.js/lib/asn1/base/reporter.js","webpack:///./node_modules/asn1.js/lib/asn1/api.js"],"names":["constants","exports","_reverse","map","res","Object","keys","forEach","key","value","der","decoders","pem","encoders","inherits","Buffer","Node","DEREncoder","entity","this","enc","name","tree","DERNode","_init","body","parent","call","two","num","encodeTag","tag","primitive","cls","reporter","tagByName","hasOwnProperty","error","tagClassByName","module","prototype","encode","data","_encode","join","_encodeComposite","content","encodedTag","length","header","alloc","_createEncoderBuffer","lenOctets","i","j","_encodeStr","str","unused","buf","writeUInt16BE","charCodeAt","_isNumstr","_isPrintstr","test","_encodeObjid","id","values","relative","split","Array","isArray","slice","JSON","stringify","splice","size","ident","objid","offset","_encodeTime","time","date","Date","getUTCFullYear","getUTCMonth","getUTCDate","getUTCHours","getUTCMinutes","getUTCSeconds","_encodeNull","_encodeInt","isBuffer","numArray","toArray","sign","unshift","from","out","copy","_encodeBool","_use","obj","_getEncoder","_skipDefault","dataBuffer","state","_baseState","undefined","defaultBuffer","_encodeValue","base","Reporter","DecoderBuffer","EncoderBuffer","options","item","isEncoderBuffer","byteLength","isDecoderBuffer","isCompatible","constructor","save","restore","isEmpty","readUInt8","skip","raw","fail","bytes","_reporterState","write","asn1","bignum","define","assert","tags","methods","concat","overrided","children","args","reverseArgs","choice","optional","any","use","useDecoder","explicit","implicit","contains","_wrap","stateProps","clone","cstate","prop","method","push","apply","arguments","filter","child","equal","_useArgs","arg","Error","def","val","newKey","_decode","input","wrapResult","prevObj","result","present","prevKey","enterKey","_peekTag","isError","_decodeGeneric","_decodeChoice","e","enterObject","_decodeTag","start","track","path","_getUse","leaveObject","exitKey","leaveKey","_decodeList","_decodeStr","_decodeObjid","_decodeTime","_decodeNull","_decodeBool","_decodeInt","match","some","node","type","_encodeChoice","_encodePrimitive","PEMEncoder","p","toString","label","reverse","tagClass","0","1","2","3","DERDecoder","PEMDecoder","decode","lines","toUpperCase","re","end","base64","replace","msg","ctor","superCtor","super_","TempCtor","BN","number","endian","isBN","negative","words","red","wordSize","parseHex","r","len","Math","min","c","parseBase","mul","max","left","right","cmp","_initNumber","_initArray","_parseHex","_parseBase","strip","ceil","w","off","limbLen","limbPow","total","mod","word","imuln","_iaddn","pow","dest","_expand","_normSign","inspect","zeros","groupSizes","groupBases","toBitArray","bitLength","bit","wbit","smallMulTo","self","a","b","lo","carry","k","ncarry","rword","maxJ","padding","groupSize","groupBase","isZero","modn","idivn","toNumber","ret","toJSON","toBuffer","toArrayLike","ArrayType","reqLength","littleEndian","q","andln","iushrn","clz32","_countBits","t","_zeroBits","hi","zeroBits","toTwos","width","abs","inotn","iaddn","fromTwos","testn","notn","ineg","isNeg","neg","iuor","ior","or","uor","iuand","iand","and","uand","iuxor","ixor","xor","uxor","bytesNeeded","bitsLeft","setn","iadd","isub","add","sub","comb10MulTo","mid","o","a0","al0","ah0","a1","al1","ah1","a2","al2","ah2","a3","al3","ah3","a4","al4","ah4","a5","al5","ah5","a6","al6","ah6","a7","al7","ah7","a8","al8","ah8","a9","al9","ah9","b0","bl0","bh0","b1","bl1","bh1","b2","bl2","bh2","b3","bl3","bh3","b4","bl4","bh4","b5","bl5","bh5","b6","bl6","bh6","b7","bl7","bh7","b8","bl8","bh8","b9","bl9","bh9","imul","w0","w1","w2","w3","w4","w5","w6","w7","w8","w9","w10","w11","w12","w13","w14","w15","w16","w17","w18","bigMulTo","hncarry","jumboMulTo","fftm","FFTM","mulp","x","y","mulTo","makeRBT","N","l","revBin","rb","permute","rbt","rws","iws","rtws","itws","transform","s","rtwdf","cos","PI","itwdf","sin","rtwdf_","itwdf_","ie","ro","io","rx","guessLen13b","n","m","odd","conjugate","normalize13b","ws","round","convert13b","stub","ph","_","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","muln","sqr","isqr","iushln","bits","carryMask","newCarry","ishln","hint","extended","h","mask","maskedWords","ishrn","shln","ushln","shrn","ushrn","imaskn","maskn","isubn","addn","subn","iabs","_ishlnsubmul","shift","_wordDiv","mode","bhi","bhiBits","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","acc","egcd","A","B","C","D","g","isEven","yp","xp","im","isOdd","jm","gcd","_invmp","x1","x2","delta","cmpn","invm","bincn","ucmp","gtn","gt","gten","gte","ltn","lt","lten","lte","eqn","eq","Red","toRed","ctx","convertTo","_forceRed","fromRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","shl","redMul","_verify2","redIMul","redSqr","_verify1","redISqr","redSqrt","sqrt","redInvm","redNeg","redPow","primes","k256","p224","p192","p25519","MPrime","tmp","_tmp","K256","P224","P192","P25519","prime","_prime","Mont","imod","rinv","minv","ireduce","rlen","imulK","_strip","output","outLen","prev","next","mod3","one","nOne","lpow","z","inv","windowSize","wnd","current","currentLen","mont","u","derDecodeTag","oct","tagStr","derDecodeLen","buffer","decodedTag","_skipUntilEnd","decoder","possibleEnd","String","fromCharCode","readUInt16BE","numstr","printstr","identifiers","subident","first","second","year","mon","day","hour","sec","UTC","_getDecoder","errors","ReporterError","rethrow","pathLen","index","now","err","inherited","elem","message","stack","partial","captureStackTrace","api","Entity","_createNamed","Base","Generated","_initNamed"],"mappings":"0HAEA,MAAMA,EAAYC,EAGlBD,EAAUE,SAAW,SAAiBC,GACpC,MAAMC,EAAM,GAWZ,OATAC,OAAOC,KAAKH,GAAKI,SAAQ,SAASC,IAErB,EAANA,IAAYA,IACfA,GAAY,GAEd,MAAMC,EAAQN,EAAIK,GAClBJ,EAAIK,GAASD,KAGRJ,GAGTJ,EAAUU,IAAM,EAAQ,S,qCClBxB,MAAMC,EAAWV,EAEjBU,EAASD,IAAM,EAAQ,QACvBC,EAASC,IAAM,EAAQ,S,oCCHvB,MAAMC,EAAWZ,EAEjBY,EAASH,IAAM,EAAQ,QACvBG,EAASD,IAAM,EAAQ,S,kCCHvB,MAAME,EAAW,EAAQ,QACnBC,EAAS,EAAQ,QAAgBA,OACjCC,EAAO,EAAQ,QAGfN,EAAM,EAAQ,QAEpB,SAASO,EAAWC,GAClBC,KAAKC,IAAM,MACXD,KAAKE,KAAOH,EAAOG,KACnBF,KAAKD,OAASA,EAGdC,KAAKG,KAAO,IAAIC,EAChBJ,KAAKG,KAAKE,MAAMN,EAAOO,MAUzB,SAASF,EAAQG,GACfV,EAAKW,KAAKR,KAAM,MAAOO,GAmHzB,SAASE,EAAIC,GACX,OAAIA,EAAM,GACD,IAAMA,EAENA,EA4HX,SAASC,EAAUC,EAAKC,EAAWC,EAAKC,GACtC,IAAI9B,EAOJ,GALY,UAAR2B,EACFA,EAAM,MACS,UAARA,IACPA,EAAM,OAEJrB,EAAIyB,UAAUC,eAAeL,GAC/B3B,EAAMM,EAAIyB,UAAUJ,OACjB,IAAmB,kBAARA,IAA2B,EAANA,KAAaA,EAGhD,OAAOG,EAASG,MAAM,gBAAkBN,GAFxC3B,EAAM2B,EAIR,OAAI3B,GAAO,GACF8B,EAASG,MAAM,yCAEnBL,IACH5B,GAAO,IAETA,GAAQM,EAAI4B,eAAeL,GAAO,cAAgB,EAE3C7B,GAnRTmC,EAAOtC,QAAUgB,EAEjBA,EAAWuB,UAAUC,OAAS,SAAgBC,EAAMR,GAClD,OAAOf,KAAKG,KAAKqB,QAAQD,EAAMR,GAAUU,QAQ3C9B,EAASS,EAASP,GAElBO,EAAQiB,UAAUK,iBAAmB,SAAyBd,EAC5DC,EACAC,EACAa,GACA,MAAMC,EAAajB,EAAUC,EAAKC,EAAWC,EAAKd,KAAKe,UAGvD,GAAIY,EAAQE,OAAS,IAAM,CACzB,MAAMC,EAASlC,EAAOmC,MAAM,GAG5B,OAFAD,EAAO,GAAKF,EACZE,EAAO,GAAKH,EAAQE,OACb7B,KAAKgC,qBAAqB,CAAEF,EAAQH,IAK7C,IAAIM,EAAY,EAChB,IAAK,IAAIC,EAAIP,EAAQE,OAAQK,GAAK,IAAOA,IAAM,EAC7CD,IAEF,MAAMH,EAASlC,EAAOmC,MAAM,EAAQE,GACpCH,EAAO,GAAKF,EACZE,EAAO,GAAK,IAAOG,EAEnB,IAAK,IAAIC,EAAI,EAAID,EAAWE,EAAIR,EAAQE,OAAQM,EAAI,EAAGD,IAAKC,IAAM,EAChEL,EAAOI,GAAS,IAAJC,EAEd,OAAOnC,KAAKgC,qBAAqB,CAAEF,EAAQH,KAG7CvB,EAAQiB,UAAUe,WAAa,SAAmBC,EAAKzB,GACrD,GAAY,WAARA,EACF,OAAOZ,KAAKgC,qBAAqB,CAAe,EAAbK,EAAIC,OAAYD,EAAId,OAClD,GAAY,WAARX,EAAkB,CAC3B,MAAM2B,EAAM3C,EAAOmC,MAAmB,EAAbM,EAAIR,QAC7B,IAAK,IAAIK,EAAI,EAAGA,EAAIG,EAAIR,OAAQK,IAC9BK,EAAIC,cAAcH,EAAII,WAAWP,GAAQ,EAAJA,GAEvC,OAAOlC,KAAKgC,qBAAqBO,GAC5B,MAAY,WAAR3B,EACJZ,KAAK0C,UAAUL,GAIbrC,KAAKgC,qBAAqBK,GAHxBrC,KAAKe,SAASG,MAAM,kEAIZ,aAARN,EACJZ,KAAK2C,YAAYN,GAQfrC,KAAKgC,qBAAqBK,GAPxBrC,KAAKe,SAASG,MAAM,qNAQpB,OAAO0B,KAAKhC,IAEJ,YAARA,EADFZ,KAAKgC,qBAAqBK,GAI1BrC,KAAKe,SAASG,MAAM,4BAA8BN,EAC9B,iBAI/BR,EAAQiB,UAAUwB,aAAe,SAAqBC,EAAIC,EAAQC,GAChE,GAAkB,kBAAPF,EAAiB,CAC1B,IAAKC,EACH,OAAO/C,KAAKe,SAASG,MAAM,+CAC7B,IAAK6B,EAAO9B,eAAe6B,GACzB,OAAO9C,KAAKe,SAASG,MAAM,iCAC7B4B,EAAKC,EAAOD,GAAIG,MAAM,WACtB,IAAK,IAAIf,EAAI,EAAGA,EAAIY,EAAGjB,OAAQK,IAC7BY,EAAGZ,IAAM,OACN,GAAIgB,MAAMC,QAAQL,GAAK,CAC5BA,EAAKA,EAAGM,QACR,IAAK,IAAIlB,EAAI,EAAGA,EAAIY,EAAGjB,OAAQK,IAC7BY,EAAGZ,IAAM,EAGb,IAAKgB,MAAMC,QAAQL,GACjB,OAAO9C,KAAKe,SAASG,MAAM,kDACUmC,KAAKC,UAAUR,IAGtD,IAAKE,EAAU,CACb,GAAIF,EAAG,IAAM,GACX,OAAO9C,KAAKe,SAASG,MAAM,+BAC7B4B,EAAGS,OAAO,EAAG,EAAW,GAART,EAAG,GAAUA,EAAG,IAIlC,IAAIU,EAAO,EACX,IAAK,IAAItB,EAAI,EAAGA,EAAIY,EAAGjB,OAAQK,IAAK,CAClC,IAAIuB,EAAQX,EAAGZ,GACf,IAAKsB,IAAQC,GAAS,IAAMA,IAAU,EACpCD,IAGJ,MAAME,EAAQ9D,EAAOmC,MAAMyB,GAC3B,IAAIG,EAASD,EAAM7B,OAAS,EAC5B,IAAK,IAAIK,EAAIY,EAAGjB,OAAS,EAAGK,GAAK,EAAGA,IAAK,CACvC,IAAIuB,EAAQX,EAAGZ,GACfwB,EAAMC,KAAoB,IAARF,EAClB,OAAQA,IAAU,GAAK,EACrBC,EAAMC,KAAY,IAAgB,IAARF,EAG9B,OAAOzD,KAAKgC,qBAAqB0B,IAUnCtD,EAAQiB,UAAUuC,YAAc,SAAoBC,EAAMjD,GACxD,IAAIyB,EACJ,MAAMyB,EAAO,IAAIC,KAAKF,GA0BtB,MAxBY,YAARjD,EACFyB,EAAM,CACJ5B,EAAIqD,EAAKE,kBACTvD,EAAIqD,EAAKG,cAAgB,GACzBxD,EAAIqD,EAAKI,cACTzD,EAAIqD,EAAKK,eACT1D,EAAIqD,EAAKM,iBACT3D,EAAIqD,EAAKO,iBACT,KACA5C,KAAK,IACU,YAARb,EACTyB,EAAM,CACJ5B,EAAIqD,EAAKE,iBAAmB,KAC5BvD,EAAIqD,EAAKG,cAAgB,GACzBxD,EAAIqD,EAAKI,cACTzD,EAAIqD,EAAKK,eACT1D,EAAIqD,EAAKM,iBACT3D,EAAIqD,EAAKO,iBACT,KACA5C,KAAK,IAEPzB,KAAKe,SAASG,MAAM,YAAcN,EAAM,8BAGnCZ,KAAKoC,WAAWC,EAAK,WAG9BjC,EAAQiB,UAAUiD,YAAc,WAC9B,OAAOtE,KAAKgC,qBAAqB,KAGnC5B,EAAQiB,UAAUkD,WAAa,SAAmB7D,EAAKqC,GACrD,GAAmB,kBAARrC,EAAkB,CAC3B,IAAKqC,EACH,OAAO/C,KAAKe,SAASG,MAAM,+CAC7B,IAAK6B,EAAO9B,eAAeP,GACzB,OAAOV,KAAKe,SAASG,MAAM,+BACAmC,KAAKC,UAAU5C,IAE5CA,EAAMqC,EAAOrC,GAIf,GAAmB,kBAARA,IAAqBd,EAAO4E,SAAS9D,GAAM,CACpD,MAAM+D,EAAW/D,EAAIgE,WAChBhE,EAAIiE,MAAsB,IAAdF,EAAS,IACxBA,EAASG,QAAQ,GAEnBlE,EAAMd,EAAOiF,KAAKJ,GAGpB,GAAI7E,EAAO4E,SAAS9D,GAAM,CACxB,IAAI8C,EAAO9C,EAAImB,OACI,IAAfnB,EAAImB,QACN2B,IAEF,MAAMsB,EAAMlF,EAAOmC,MAAMyB,GAIzB,OAHA9C,EAAIqE,KAAKD,GACU,IAAfpE,EAAImB,SACNiD,EAAI,GAAK,GACJ9E,KAAKgC,qBAAqB8C,GAGnC,GAAIpE,EAAM,IACR,OAAOV,KAAKgC,qBAAqBtB,GAEnC,GAAIA,EAAM,IACR,OAAOV,KAAKgC,qBAAqB,CAAC,EAAGtB,IAEvC,IAAI8C,EAAO,EACX,IAAK,IAAItB,EAAIxB,EAAKwB,GAAK,IAAOA,IAAM,EAClCsB,IAEF,MAAMsB,EAAM,IAAI5B,MAAMM,GACtB,IAAK,IAAItB,EAAI4C,EAAIjD,OAAS,EAAGK,GAAK,EAAGA,IACnC4C,EAAI5C,GAAW,IAANxB,EACTA,IAAQ,EAMV,OAJY,IAAToE,EAAI,IACLA,EAAIF,QAAQ,GAGP5E,KAAKgC,qBAAqBpC,EAAOiF,KAAKC,KAG/C1E,EAAQiB,UAAU2D,YAAc,SAAoB1F,GAClD,OAAOU,KAAKgC,qBAAqB1C,EAAQ,IAAO,IAGlDc,EAAQiB,UAAU4D,KAAO,SAAalF,EAAQmF,GAG5C,MAFsB,oBAAXnF,IACTA,EAASA,EAAOmF,IACXnF,EAAOoF,YAAY,OAAOhF,MAGnCC,EAAQiB,UAAU+D,aAAe,SAAqBC,EAAYtE,EAAUR,GAC1E,MAAM+E,EAAQtF,KAAKuF,WACnB,IAAIrD,EACJ,GAAyB,OAArBoD,EAAM,WACR,OAAO,EAET,MAAM/D,EAAO8D,EAAW5D,OAIxB,QAH4B+D,IAAxBF,EAAMG,gBACRH,EAAMG,cAAgBzF,KAAK0F,aAAaJ,EAAM,WAAYvE,EAAUR,GAAQkB,QAE1EF,EAAKM,SAAWyD,EAAMG,cAAc5D,OACtC,OAAO,EAET,IAAKK,EAAE,EAAGA,EAAIX,EAAKM,OAAQK,IACzB,GAAIX,EAAKW,KAAOoD,EAAMG,cAAcvD,GAClC,OAAO,EAEX,OAAO,I,oCCvQT,MAAMyD,EAAO7G,EAEb6G,EAAKC,SAAW,EAAQ,QAAcA,SACtCD,EAAKE,cAAgB,EAAQ,QAAYA,cACzCF,EAAKG,cAAgB,EAAQ,QAAYA,cACzCH,EAAK9F,KAAO,EAAQ,S,kCCLpB,MAAMF,EAAW,EAAQ,QACnBiG,EAAW,EAAQ,QAAoBA,SACvChG,EAAS,EAAQ,QAAgBA,OAEvC,SAASiG,EAAcF,EAAMI,GAC3BH,EAASpF,KAAKR,KAAM+F,GACfnG,EAAO4E,SAASmB,IAKrB3F,KAAK2F,KAAOA,EACZ3F,KAAK2D,OAAS,EACd3D,KAAK6B,OAAS8D,EAAK9D,QANjB7B,KAAKkB,MAAM,oBA8Ef,SAAS4E,EAAcxG,EAAOyB,GAC5B,GAAImC,MAAMC,QAAQ7D,GAChBU,KAAK6B,OAAS,EACd7B,KAAKV,MAAQA,EAAMN,KAAI,SAASgH,GAI9B,OAHKF,EAAcG,gBAAgBD,KACjCA,EAAO,IAAIF,EAAcE,EAAMjF,IACjCf,KAAK6B,QAAUmE,EAAKnE,OACbmE,IACNhG,WACE,GAAqB,kBAAVV,EAAoB,CACpC,KAAM,GAAKA,GAASA,GAAS,KAC3B,OAAOyB,EAASG,MAAM,gCACxBlB,KAAKV,MAAQA,EACbU,KAAK6B,OAAS,OACT,GAAqB,kBAAVvC,EAChBU,KAAKV,MAAQA,EACbU,KAAK6B,OAASjC,EAAOsG,WAAW5G,OAC3B,KAAIM,EAAO4E,SAASlF,GAIzB,OAAOyB,EAASG,MAAM,4BAA8B5B,GAHpDU,KAAKV,MAAQA,EACbU,KAAK6B,OAASvC,EAAMuC,QAzFxBlC,EAASkG,EAAeD,GACxB9G,EAAQ+G,cAAgBA,EAExBA,EAAcM,gBAAkB,SAAyB5E,GACvD,GAAIA,aAAgBsE,EAClB,OAAO,EAIT,MAAMO,EAA+B,kBAAT7E,GAC1B3B,EAAO4E,SAASjD,EAAKoE,OACK,kBAA1BpE,EAAK8E,YAAYnG,MACM,kBAAhBqB,EAAKoC,QACW,kBAAhBpC,EAAKM,QACS,oBAAdN,EAAK+E,MACY,oBAAjB/E,EAAKgF,SACY,oBAAjBhF,EAAKiF,SACc,oBAAnBjF,EAAKkF,WACS,oBAAdlF,EAAKmF,MACQ,oBAAbnF,EAAKoF,IAEd,OAAOP,GAGTP,EAAcxE,UAAUiF,KAAO,WAC7B,MAAO,CAAE3C,OAAQ3D,KAAK2D,OAAQ5C,SAAU6E,EAASvE,UAAUiF,KAAK9F,KAAKR,QAGvE6F,EAAcxE,UAAUkF,QAAU,SAAiBD,GAEjD,MAAMrH,EAAM,IAAI4G,EAAc7F,KAAK2F,MAOnC,OANA1G,EAAI0E,OAAS2C,EAAK3C,OAClB1E,EAAI4C,OAAS7B,KAAK2D,OAElB3D,KAAK2D,OAAS2C,EAAK3C,OACnBiC,EAASvE,UAAUkF,QAAQ/F,KAAKR,KAAMsG,EAAKvF,UAEpC9B,GAGT4G,EAAcxE,UAAUmF,QAAU,WAChC,OAAOxG,KAAK2D,SAAW3D,KAAK6B,QAG9BgE,EAAcxE,UAAUoF,UAAY,SAAmBG,GACrD,OAAI5G,KAAK2D,OAAS,GAAK3D,KAAK6B,OACnB7B,KAAK2F,KAAKc,UAAUzG,KAAK2D,UAAU,GAEnC3D,KAAKkB,MAAM0F,GAAQ,0BAG9Bf,EAAcxE,UAAUqF,KAAO,SAAcG,EAAOD,GAClD,KAAM5G,KAAK2D,OAASkD,GAAS7G,KAAK6B,QAChC,OAAO7B,KAAKkB,MAAM0F,GAAQ,yBAE5B,MAAM3H,EAAM,IAAI4G,EAAc7F,KAAK2F,MAQnC,OALA1G,EAAI6H,eAAiB9G,KAAK8G,eAE1B7H,EAAI0E,OAAS3D,KAAK2D,OAClB1E,EAAI4C,OAAS7B,KAAK2D,OAASkD,EAC3B7G,KAAK2D,QAAUkD,EACR5H,GAGT4G,EAAcxE,UAAUsF,IAAM,SAAaL,GACzC,OAAOtG,KAAK2F,KAAKvC,MAAMkD,EAAOA,EAAK3C,OAAS3D,KAAK2D,OAAQ3D,KAAK6B,SA2BhE/C,EAAQgH,cAAgBA,EAExBA,EAAcG,gBAAkB,SAAyB1E,GACvD,GAAIA,aAAgBuE,EAClB,OAAO,EAIT,MAAMM,EAA+B,kBAAT7E,GACA,kBAA1BA,EAAK8E,YAAYnG,MACM,kBAAhBqB,EAAKM,QACS,oBAAdN,EAAKE,KAEd,OAAO2E,GAGTN,EAAczE,UAAUI,KAAO,SAAcqD,EAAKnB,GAMhD,OALKmB,IACHA,EAAMlF,EAAOmC,MAAM/B,KAAK6B,SACrB8B,IACHA,EAAS,GAES,IAAhB3D,KAAK6B,SAGLqB,MAAMC,QAAQnD,KAAKV,OACrBU,KAAKV,MAAMF,SAAQ,SAAS4G,GAC1BA,EAAKvE,KAAKqD,EAAKnB,GACfA,GAAUqC,EAAKnE,WAGS,kBAAf7B,KAAKV,MACdwF,EAAInB,GAAU3D,KAAKV,MACU,kBAAfU,KAAKV,MACnBwF,EAAIiC,MAAM/G,KAAKV,MAAOqE,GACf/D,EAAO4E,SAASxE,KAAKV,QAC5BU,KAAKV,MAAMyF,KAAKD,EAAKnB,GACvBA,GAAU3D,KAAK6B,SAdRiD,I,oCCpIX,MAAMkC,EAAOlI,EAEbkI,EAAKC,OAAS,EAAQ,QAEtBD,EAAKE,OAAS,EAAQ,QAAcA,OACpCF,EAAKrB,KAAO,EAAQ,QACpBqB,EAAKnI,UAAY,EAAQ,QACzBmI,EAAKxH,SAAW,EAAQ,SACxBwH,EAAKtH,SAAW,EAAQ,S,kCCRxB,MAAMkG,EAAW,EAAQ,QAAoBA,SACvCE,EAAgB,EAAQ,QAAkBA,cAC1CD,EAAgB,EAAQ,QAAkBA,cAC1CsB,EAAS,EAAQ,QAGjBC,EAAO,CACX,MAAO,QAAS,MAAO,QAAS,QAAS,OACzC,UAAW,UAAW,QAAS,OAAQ,MAAO,UAC9C,SAAU,SAAU,UAAW,SAAU,WAAY,SAAU,YAC/D,SAAU,SAAU,WAAY,SAAU,SAAU,UAAW,YAI3DC,EAAU,CACd,MAAO,MAAO,MAAO,WAAY,WAAY,WAAY,MAAO,SAChE,MAAO,YACPC,OAAOF,GAGHG,EAAY,CAChB,WAAY,aAAc,OAC1B,aAAc,eAAgB,cAC9B,cAAe,aAAc,cAAe,cAE5C,mBAAoB,aAAc,eAAgB,cAClD,cAAe,aAAc,eAG/B,SAAS1H,EAAKI,EAAKM,EAAQL,GACzB,MAAMoF,EAAQ,GACdtF,KAAKuF,WAAaD,EAElBA,EAAMpF,KAAOA,EACboF,EAAMrF,IAAMA,EAEZqF,EAAM/E,OAASA,GAAU,KACzB+E,EAAMkC,SAAW,KAGjBlC,EAAM1E,IAAM,KACZ0E,EAAMmC,KAAO,KACbnC,EAAMoC,YAAc,KACpBpC,EAAMqC,OAAS,KACfrC,EAAMsC,UAAW,EACjBtC,EAAMuC,KAAM,EACZvC,EAAMJ,KAAM,EACZI,EAAMwC,IAAM,KACZxC,EAAMyC,WAAa,KACnBzC,EAAMjG,IAAM,KACZiG,EAAM,WAAa,KACnBA,EAAM0C,SAAW,KACjB1C,EAAM2C,SAAW,KACjB3C,EAAM4C,SAAW,KAGZ5C,EAAM/E,SACT+E,EAAMkC,SAAW,GACjBxH,KAAKmI,SAGT/G,EAAOtC,QAAUe,EAEjB,MAAMuI,EAAa,CACjB,MAAO,SAAU,WAAY,MAAO,OAAQ,cAAe,SAC3D,WAAY,MAAO,MAAO,MAAO,aAAc,MAAO,UAAW,WACjE,WAAY,YAGdvI,EAAKwB,UAAUgH,MAAQ,WACrB,MAAM/C,EAAQtF,KAAKuF,WACb+C,EAAS,GACfF,EAAWhJ,SAAQ,SAASmJ,GAC1BD,EAAOC,GAAQjD,EAAMiD,MAEvB,MAAMtJ,EAAM,IAAIe,KAAKqG,YAAYiC,EAAO/H,QAExC,OADAtB,EAAIsG,WAAa+C,EACVrJ,GAGTY,EAAKwB,UAAU8G,MAAQ,WACrB,MAAM7C,EAAQtF,KAAKuF,WACnB8B,EAAQjI,SAAQ,SAASoJ,GACvBxI,KAAKwI,GAAU,WACb,MAAMH,EAAQ,IAAIrI,KAAKqG,YAAYrG,MAEnC,OADAsF,EAAMkC,SAASiB,KAAKJ,GACbA,EAAMG,GAAQE,MAAML,EAAOM,cAEnC3I,OAGLH,EAAKwB,UAAUhB,MAAQ,SAAcC,GACnC,MAAMgF,EAAQtF,KAAKuF,WAEnB4B,EAAwB,OAAjB7B,EAAM/E,QACbD,EAAKE,KAAKR,MAGVsF,EAAMkC,SAAWlC,EAAMkC,SAASoB,QAAO,SAASC,GAC9C,OAAOA,EAAMtD,WAAWhF,SAAWP,OAClCA,MACHmH,EAAO2B,MAAMxD,EAAMkC,SAAS3F,OAAQ,EAAG,sCAGzChC,EAAKwB,UAAU0H,SAAW,SAAiBtB,GACzC,MAAMnC,EAAQtF,KAAKuF,WAGbiC,EAAWC,EAAKmB,QAAO,SAASI,GACpC,OAAOA,aAAehJ,KAAKqG,cAC1BrG,MACHyH,EAAOA,EAAKmB,QAAO,SAASI,GAC1B,QAASA,aAAehJ,KAAKqG,eAC5BrG,MAEqB,IAApBwH,EAAS3F,SACXsF,EAA0B,OAAnB7B,EAAMkC,UACblC,EAAMkC,SAAWA,EAGjBA,EAASpI,SAAQ,SAASyJ,GACxBA,EAAMtD,WAAWhF,OAASP,OACzBA,OAEe,IAAhByH,EAAK5F,SACPsF,EAAsB,OAAf7B,EAAMmC,MACbnC,EAAMmC,KAAOA,EACbnC,EAAMoC,YAAcD,EAAKzI,KAAI,SAASgK,GACpC,GAAmB,kBAARA,GAAoBA,EAAI3C,cAAgBnH,OACjD,OAAO8J,EAET,MAAM/J,EAAM,GAOZ,OANAC,OAAOC,KAAK6J,GAAK5J,SAAQ,SAASC,GAC5BA,IAAc,EAANA,KACVA,GAAO,GACT,MAAMC,EAAQ0J,EAAI3J,GAClBJ,EAAIK,GAASD,KAERJ,OASbsI,EAAUnI,SAAQ,SAASoJ,GACzB3I,EAAKwB,UAAUmH,GAAU,WACvB,MAAMlD,EAAQtF,KAAKuF,WACnB,MAAM,IAAI0D,MAAMT,EAAS,kCAAoClD,EAAMrF,SAQvEmH,EAAKhI,SAAQ,SAASwB,GACpBf,EAAKwB,UAAUT,GAAO,WACpB,MAAM0E,EAAQtF,KAAKuF,WACbkC,EAAOvE,MAAM7B,UAAU+B,MAAM5C,KAAKmI,WAOxC,OALAxB,EAAqB,OAAd7B,EAAM1E,KACb0E,EAAM1E,IAAMA,EAEZZ,KAAK+I,SAAStB,GAEPzH,SAIXH,EAAKwB,UAAUyG,IAAM,SAAa9B,GAChCmB,EAAOnB,GACP,MAAMV,EAAQtF,KAAKuF,WAKnB,OAHA4B,EAAqB,OAAd7B,EAAMwC,KACbxC,EAAMwC,IAAM9B,EAELhG,MAGTH,EAAKwB,UAAUuG,SAAW,WACxB,MAAMtC,EAAQtF,KAAKuF,WAInB,OAFAD,EAAMsC,UAAW,EAEV5H,MAGTH,EAAKwB,UAAU6H,IAAM,SAAaC,GAChC,MAAM7D,EAAQtF,KAAKuF,WAMnB,OAJA4B,EAA4B,OAArB7B,EAAM,YACbA,EAAM,WAAa6D,EACnB7D,EAAMsC,UAAW,EAEV5H,MAGTH,EAAKwB,UAAU2G,SAAW,SAAkBtH,GAC1C,MAAM4E,EAAQtF,KAAKuF,WAKnB,OAHA4B,EAA0B,OAAnB7B,EAAM0C,UAAwC,OAAnB1C,EAAM2C,UACxC3C,EAAM0C,SAAWtH,EAEVV,MAGTH,EAAKwB,UAAU4G,SAAW,SAAkBvH,GAC1C,MAAM4E,EAAQtF,KAAKuF,WAKnB,OAHA4B,EAA0B,OAAnB7B,EAAM0C,UAAwC,OAAnB1C,EAAM2C,UACxC3C,EAAM2C,SAAWvH,EAEVV,MAGTH,EAAKwB,UAAU6D,IAAM,WACnB,MAAMI,EAAQtF,KAAKuF,WACbkC,EAAOvE,MAAM7B,UAAU+B,MAAM5C,KAAKmI,WAOxC,OALArD,EAAMJ,KAAM,EAEQ,IAAhBuC,EAAK5F,QACP7B,KAAK+I,SAAStB,GAETzH,MAGTH,EAAKwB,UAAUhC,IAAM,SAAa+J,GAChC,MAAM9D,EAAQtF,KAAKuF,WAKnB,OAHA4B,EAAqB,OAAd7B,EAAMjG,KACbiG,EAAMjG,IAAM+J,EAELpJ,MAGTH,EAAKwB,UAAUwG,IAAM,WACnB,MAAMvC,EAAQtF,KAAKuF,WAInB,OAFAD,EAAMuC,KAAM,EAEL7H,MAGTH,EAAKwB,UAAUsG,OAAS,SAAgBzC,GACtC,MAAMI,EAAQtF,KAAKuF,WAQnB,OANA4B,EAAwB,OAAjB7B,EAAMqC,QACbrC,EAAMqC,OAASzC,EACflF,KAAK+I,SAAS7J,OAAOC,KAAK+F,GAAKlG,KAAI,SAASK,GAC1C,OAAO6F,EAAI7F,OAGNW,MAGTH,EAAKwB,UAAU6G,SAAW,SAAkBlC,GAC1C,MAAMV,EAAQtF,KAAKuF,WAKnB,OAHA4B,EAAqB,OAAd7B,EAAMwC,KACbxC,EAAM4C,SAAWlC,EAEVhG,MAOTH,EAAKwB,UAAUgI,QAAU,SAAgBC,EAAOvD,GAC9C,MAAMT,EAAQtF,KAAKuF,WAGnB,GAAqB,OAAjBD,EAAM/E,OACR,OAAO+I,EAAMC,WAAWjE,EAAMkC,SAAS,GAAG6B,QAAQC,EAAOvD,IAE3D,IAuCIyD,EAvCAC,EAASnE,EAAM,WACfoE,GAAU,EAEVC,EAAU,KAKd,GAJkB,OAAdrE,EAAMjG,MACRsK,EAAUL,EAAMM,SAAStE,EAAMjG,MAG7BiG,EAAMsC,SAAU,CAClB,IAAIhH,EAAM,KAQV,GAPuB,OAAnB0E,EAAM0C,SACRpH,EAAM0E,EAAM0C,SACc,OAAnB1C,EAAM2C,SACbrH,EAAM0E,EAAM2C,SACS,OAAd3C,EAAM1E,MACbA,EAAM0E,EAAM1E,KAEF,OAARA,GAAiB0E,EAAMuC,KAgBzB,GAFA6B,EAAU1J,KAAK6J,SAASP,EAAO1I,EAAK0E,EAAMuC,KAEtCyB,EAAMQ,QAAQJ,GAChB,OAAOA,MAjBqB,CAE9B,MAAMpD,EAAOgD,EAAMhD,OACnB,IACuB,OAAjBhB,EAAMqC,OACR3H,KAAK+J,eAAezE,EAAM1E,IAAK0I,EAAOvD,GAEtC/F,KAAKgK,cAAcV,EAAOvD,GAC5B2D,GAAU,EACV,MAAOO,GACPP,GAAU,EAEZJ,EAAM/C,QAAQD,IAclB,GAHIhB,EAAMJ,KAAOwE,IACfF,EAAUF,EAAMY,eAEdR,EAAS,CAEX,GAAuB,OAAnBpE,EAAM0C,SAAmB,CAC3B,MAAMA,EAAWhI,KAAKmK,WAAWb,EAAOhE,EAAM0C,UAC9C,GAAIsB,EAAMQ,QAAQ9B,GAChB,OAAOA,EACTsB,EAAQtB,EAGV,MAAMoC,EAAQd,EAAM3F,OAGpB,GAAkB,OAAd2B,EAAMwC,KAAiC,OAAjBxC,EAAMqC,OAAiB,CAC/C,IAAIrB,EACAhB,EAAMuC,MACRvB,EAAOgD,EAAMhD,QACf,MAAMhG,EAAON,KAAKmK,WAChBb,EACmB,OAAnBhE,EAAM2C,SAAoB3C,EAAM2C,SAAW3C,EAAM1E,IACjD0E,EAAMuC,KAER,GAAIyB,EAAMQ,QAAQxJ,GAChB,OAAOA,EAELgF,EAAMuC,IACR4B,EAASH,EAAM3C,IAAIL,GAEnBgD,EAAQhJ,EAkBZ,GAfIyF,GAAWA,EAAQsE,OAAuB,OAAd/E,EAAM1E,KACpCmF,EAAQsE,MAAMf,EAAMgB,OAAQF,EAAOd,EAAMzH,OAAQ,UAE/CkE,GAAWA,EAAQsE,OAAuB,OAAd/E,EAAM1E,KACpCmF,EAAQsE,MAAMf,EAAMgB,OAAQhB,EAAM3F,OAAQ2F,EAAMzH,OAAQ,WAGtDyD,EAAMuC,MAGR4B,EAD0B,OAAjBnE,EAAMqC,OACN3H,KAAK+J,eAAezE,EAAM1E,IAAK0I,EAAOvD,GAEtC/F,KAAKgK,cAAcV,EAAOvD,IAGjCuD,EAAMQ,QAAQL,GAChB,OAAOA,EAYT,GATKnE,EAAMuC,KAAwB,OAAjBvC,EAAMqC,QAAsC,OAAnBrC,EAAMkC,UAC/ClC,EAAMkC,SAASpI,SAAQ,SAAwByJ,GAG7CA,EAAMQ,QAAQC,EAAOvD,MAKrBT,EAAM4C,WAA2B,WAAd5C,EAAM1E,KAAkC,WAAd0E,EAAM1E,KAAmB,CACxE,MAAMW,EAAO,IAAIsE,EAAc4D,GAC/BA,EAASzJ,KAAKuK,QAAQjF,EAAM4C,SAAUoB,EAAMxC,eAAe5B,KACxDmE,QAAQ9H,EAAMwE,IAcrB,OATIT,EAAMJ,KAAOwE,IACfD,EAASH,EAAMkB,YAAYhB,IAGX,OAAdlE,EAAMjG,KAA4B,OAAXoK,IAA+B,IAAZC,EAEzB,OAAZC,GACPL,EAAMmB,QAAQd,GAFdL,EAAMoB,SAASf,EAASrE,EAAMjG,IAAKoK,GAI9BA,GAGT5J,EAAKwB,UAAU0I,eAAiB,SAAuBnJ,EAAK0I,EAAOvD,GACjE,MAAMT,EAAQtF,KAAKuF,WAEnB,MAAY,QAAR3E,GAAyB,QAARA,EACZ,KACG,UAARA,GAA2B,UAARA,EACdZ,KAAK2K,YAAYrB,EAAO1I,EAAK0E,EAAMmC,KAAK,GAAI1B,GAC5C,OAAOnD,KAAKhC,GACZZ,KAAK4K,WAAWtB,EAAO1I,EAAKmF,GACpB,UAARnF,GAAmB0E,EAAMmC,KACzBzH,KAAK6K,aAAavB,EAAOhE,EAAMmC,KAAK,GAAInC,EAAMmC,KAAK,GAAI1B,GAC/C,UAARnF,EACAZ,KAAK6K,aAAavB,EAAO,KAAM,KAAMvD,GAC7B,YAARnF,GAA6B,YAARA,EACrBZ,KAAK8K,YAAYxB,EAAO1I,EAAKmF,GACrB,UAARnF,EACAZ,KAAK+K,YAAYzB,EAAOvD,GAChB,SAARnF,EACAZ,KAAKgL,YAAY1B,EAAOvD,GAChB,YAARnF,EACAZ,KAAK4K,WAAWtB,EAAO1I,EAAKmF,GACpB,QAARnF,GAAyB,SAARA,EACjBZ,KAAKiL,WAAW3B,EAAOhE,EAAMmC,MAAQnC,EAAMmC,KAAK,GAAI1B,GAE3C,OAAdT,EAAMwC,IACD9H,KAAKuK,QAAQjF,EAAMwC,IAAKwB,EAAMxC,eAAe5B,KACjDmE,QAAQC,EAAOvD,GAEXuD,EAAMpI,MAAM,gBAAkBN,IAIzCf,EAAKwB,UAAUkJ,QAAU,SAAiBxK,EAAQmF,GAEhD,MAAMI,EAAQtF,KAAKuF,WASnB,OAPAD,EAAMyC,WAAa/H,KAAKiF,KAAKlF,EAAQmF,GACrCiC,EAA8C,OAAvC7B,EAAMyC,WAAWxC,WAAWhF,QACnC+E,EAAMyC,WAAazC,EAAMyC,WAAWxC,WAAWiC,SAAS,GACpDlC,EAAM2C,WAAa3C,EAAMyC,WAAWxC,WAAW0C,WACjD3C,EAAMyC,WAAazC,EAAMyC,WAAWM,QACpC/C,EAAMyC,WAAWxC,WAAW0C,SAAW3C,EAAM2C,UAExC3C,EAAMyC,YAGflI,EAAKwB,UAAU2I,cAAgB,SAAsBV,EAAOvD,GAC1D,MAAMT,EAAQtF,KAAKuF,WACnB,IAAIkE,EAAS,KACTyB,GAAQ,EAmBZ,OAjBAhM,OAAOC,KAAKmG,EAAMqC,QAAQwD,MAAK,SAAS9L,GACtC,MAAMiH,EAAOgD,EAAMhD,OACb8E,EAAO9F,EAAMqC,OAAOtI,GAC1B,IACE,MAAMC,EAAQ8L,EAAK/B,QAAQC,EAAOvD,GAClC,GAAIuD,EAAMQ,QAAQxK,GAChB,OAAO,EAETmK,EAAS,CAAE4B,KAAMhM,EAAKC,MAAOA,GAC7B4L,GAAQ,EACR,MAAOjB,GAEP,OADAX,EAAM/C,QAAQD,IACP,EAET,OAAO,IACNtG,MAEEkL,EAGEzB,EAFEH,EAAMpI,MAAM,uBASvBrB,EAAKwB,UAAUW,qBAAuB,SAA6BT,GACjE,OAAO,IAAIuE,EAAcvE,EAAMvB,KAAKe,WAGtClB,EAAKwB,UAAUG,QAAU,SAAgBD,EAAMR,EAAUR,GACvD,MAAM+E,EAAQtF,KAAKuF,WACnB,GAAyB,OAArBD,EAAM,YAAuBA,EAAM,aAAe/D,EACpD,OAEF,MAAMkI,EAASzJ,KAAK0F,aAAanE,EAAMR,EAAUR,GACjD,YAAeiF,IAAXiE,GAGAzJ,KAAKoF,aAAaqE,EAAQ1I,EAAUR,QAHxC,EAMOkJ,GAGT5J,EAAKwB,UAAUqE,aAAe,SAAgBnE,EAAMR,EAAUR,GAC5D,MAAM+E,EAAQtF,KAAKuF,WAGnB,GAAqB,OAAjBD,EAAM/E,OACR,OAAO+E,EAAMkC,SAAS,GAAGhG,QAAQD,EAAMR,GAAY,IAAI6E,GAEzD,IAAI6D,EAAS,KAMb,GAHAzJ,KAAKe,SAAWA,EAGZuE,EAAMsC,eAAqBpC,IAATjE,EAAoB,CACxC,GAAyB,OAArB+D,EAAM,WAGR,OAFA/D,EAAO+D,EAAM,WAMjB,IAAI3D,EAAU,KACVd,GAAY,EAChB,GAAIyE,EAAMuC,IAER4B,EAASzJ,KAAKgC,qBAAqBT,QAC9B,GAAI+D,EAAMqC,OACf8B,EAASzJ,KAAKsL,cAAc/J,EAAMR,QAC7B,GAAIuE,EAAM4C,SACfvG,EAAU3B,KAAKuK,QAAQjF,EAAM4C,SAAU3H,GAAQiB,QAAQD,EAAMR,GAC7DF,GAAY,OACP,GAAIyE,EAAMkC,SACf7F,EAAU2D,EAAMkC,SAASxI,KAAI,SAAS6J,GACpC,GAA6B,UAAzBA,EAAMtD,WAAW3E,IACnB,OAAOiI,EAAMrH,QAAQ,KAAMT,EAAUQ,GAEvC,GAA6B,OAAzBsH,EAAMtD,WAAWlG,IACnB,OAAO0B,EAASG,MAAM,2BACxB,MAAMyI,EAAU5I,EAAS6I,SAASf,EAAMtD,WAAWlG,KAEnD,GAAoB,kBAATkC,EACT,OAAOR,EAASG,MAAM,2CAExB,MAAMjC,EAAM4J,EAAMrH,QAAQD,EAAKsH,EAAMtD,WAAWlG,KAAM0B,EAAUQ,GAGhE,OAFAR,EAAS2J,SAASf,GAEX1K,IACNe,MAAM4I,QAAO,SAASC,GACvB,OAAOA,KAETlH,EAAU3B,KAAKgC,qBAAqBL,QAEpC,GAAkB,UAAd2D,EAAM1E,KAAiC,UAAd0E,EAAM1E,IAAiB,CAElD,IAAM0E,EAAMmC,MAA8B,IAAtBnC,EAAMmC,KAAK5F,OAC7B,OAAOd,EAASG,MAAM,uBAAyBoE,EAAM1E,KAEvD,IAAKsC,MAAMC,QAAQ5B,GACjB,OAAOR,EAASG,MAAM,sCAExB,MAAM2H,EAAQ7I,KAAKqI,QACnBQ,EAAMtD,WAAW0C,SAAW,KAC5BtG,EAAU3B,KAAKgC,qBAAqBT,EAAKvC,KAAI,SAASgH,GACpD,MAAMV,EAAQtF,KAAKuF,WAEnB,OAAOvF,KAAKuK,QAAQjF,EAAMmC,KAAK,GAAIlG,GAAMC,QAAQwE,EAAMjF,KACtD8H,SACoB,OAAdvD,EAAMwC,IACf2B,EAASzJ,KAAKuK,QAAQjF,EAAMwC,IAAKvH,GAAQiB,QAAQD,EAAMR,IAEvDY,EAAU3B,KAAKuL,iBAAiBjG,EAAM1E,IAAKW,GAC3CV,GAAY,GAKhB,IAAKyE,EAAMuC,KAAwB,OAAjBvC,EAAMqC,OAAiB,CACvC,MAAM/G,EAAyB,OAAnB0E,EAAM2C,SAAoB3C,EAAM2C,SAAW3C,EAAM1E,IACvDE,EAAyB,OAAnBwE,EAAM2C,SAAoB,YAAc,UAExC,OAARrH,EACgB,OAAd0E,EAAMwC,KACR/G,EAASG,MAAM,wCAEC,OAAdoE,EAAMwC,MACR2B,EAASzJ,KAAK0B,iBAAiBd,EAAKC,EAAWC,EAAKa,IAQ1D,OAHuB,OAAnB2D,EAAM0C,WACRyB,EAASzJ,KAAK0B,iBAAiB4D,EAAM0C,UAAU,EAAO,UAAWyB,IAE5DA,GAGT5J,EAAKwB,UAAUiK,cAAgB,SAAsB/J,EAAMR,GACzD,MAAMuE,EAAQtF,KAAKuF,WAEb6F,EAAO9F,EAAMqC,OAAOpG,EAAK8J,MAO/B,OANKD,GACHjE,GACE,EACA5F,EAAK8J,KAAO,iBACNhI,KAAKC,UAAUpE,OAAOC,KAAKmG,EAAMqC,UAEpCyD,EAAK5J,QAAQD,EAAKjC,MAAOyB,IAGlClB,EAAKwB,UAAUkK,iBAAmB,SAAyB3K,EAAKW,GAC9D,MAAM+D,EAAQtF,KAAKuF,WAEnB,GAAI,OAAO3C,KAAKhC,GACd,OAAOZ,KAAKoC,WAAWb,EAAMX,GAC1B,GAAY,UAARA,GAAmB0E,EAAMmC,KAChC,OAAOzH,KAAK6C,aAAatB,EAAM+D,EAAMoC,YAAY,GAAIpC,EAAMmC,KAAK,IAC7D,GAAY,UAAR7G,EACP,OAAOZ,KAAK6C,aAAatB,EAAM,KAAM,MAClC,GAAY,YAARX,GAA6B,YAARA,EAC5B,OAAOZ,KAAK4D,YAAYrC,EAAMX,GAC3B,GAAY,UAARA,EACP,OAAOZ,KAAKsE,cACT,GAAY,QAAR1D,GAAyB,SAARA,EACxB,OAAOZ,KAAKuE,WAAWhD,EAAM+D,EAAMmC,MAAQnC,EAAMoC,YAAY,IAC1D,GAAY,SAAR9G,EACP,OAAOZ,KAAKgF,YAAYzD,GACrB,GAAY,YAARX,EACP,OAAOZ,KAAKoC,WAAWb,EAAMX,GAE7B,MAAM,IAAIqI,MAAM,oBAAsBrI,IAG1Cf,EAAKwB,UAAUqB,UAAY,SAAkBL,GAC3C,MAAO,YAAYO,KAAKP,IAG1BxC,EAAKwB,UAAUsB,YAAc,SAAoBN,GAC/C,MAAO,6BAA6BO,KAAKP,K,oCC1nB3C,MAAM1C,EAAW,EAAQ,QAEnBG,EAAa,EAAQ,QAE3B,SAAS0L,EAAWzL,GAClBD,EAAWU,KAAKR,KAAMD,GACtBC,KAAKC,IAAM,MAEbN,EAAS6L,EAAY1L,GACrBsB,EAAOtC,QAAU0M,EAEjBA,EAAWnK,UAAUC,OAAS,SAAgBC,EAAMwE,GAClD,MAAMxD,EAAMzC,EAAWuB,UAAUC,OAAOd,KAAKR,KAAMuB,GAE7CkK,EAAIlJ,EAAImJ,SAAS,UACjB5G,EAAM,CAAE,cAAgBiB,EAAQ4F,MAAQ,SAC9C,IAAK,IAAIzJ,EAAI,EAAGA,EAAIuJ,EAAE5J,OAAQK,GAAK,GACjC4C,EAAI2D,KAAKgD,EAAErI,MAAMlB,EAAGA,EAAI,KAE1B,OADA4C,EAAI2D,KAAK,YAAc1C,EAAQ4F,MAAQ,SAChC7G,EAAIrD,KAAK,Q,oCClBlB,SAASmK,EAAQ5M,GACf,MAAMC,EAAM,GAWZ,OATAC,OAAOC,KAAKH,GAAKI,SAAQ,SAASC,IAErB,EAANA,IAAYA,IACfA,GAAY,GAEd,MAAMC,EAAQN,EAAIK,GAClBJ,EAAIK,GAASD,KAGRJ,EAGTH,EAAQ+M,SAAW,CACjBC,EAAG,YACHC,EAAG,cACHC,EAAG,UACHC,EAAG,WAELnN,EAAQqC,eAAiByK,EAAQ9M,EAAQ+M,UAEzC/M,EAAQ8B,IAAM,CACZkL,EAAM,MACN,EAAM,OACN,EAAM,MACN,EAAM,SACN,EAAM,SACN,EAAM,QACN,EAAM,QACN,EAAM,UACN,EAAM,WACN,EAAM,OACN,GAAM,OACN,GAAM,QACN,GAAM,UACN,GAAM,cACN,GAAM,MACN,GAAM,MACN,GAAM,SACN,GAAM,WACN,GAAM,SACN,GAAM,WACN,GAAM,SACN,GAAM,UACN,GAAM,UACN,GAAM,WACN,GAAM,YACN,GAAM,SACN,GAAM,SACN,GAAM,UACN,GAAM,UAERhN,EAAQkC,UAAY4K,EAAQ9M,EAAQ8B,M,oCCvDpC,MAAMjB,EAAW,EAAQ,QACnBC,EAAS,EAAQ,QAAgBA,OAEjCsM,EAAa,EAAQ,QAE3B,SAASC,EAAWpM,GAClBmM,EAAW1L,KAAKR,KAAMD,GACtBC,KAAKC,IAAM,MAEbN,EAASwM,EAAYD,GACrB9K,EAAOtC,QAAUqN,EAEjBA,EAAW9K,UAAU+K,OAAS,SAAgB7K,EAAMwE,GAClD,MAAMsG,EAAQ9K,EAAKmK,WAAWzI,MAAM,YAE9B0I,EAAQ5F,EAAQ4F,MAAMW,cAEtBC,EAAK,kCACX,IAAInC,GAAS,EACToC,GAAO,EACX,IAAK,IAAItK,EAAI,EAAGA,EAAImK,EAAMxK,OAAQK,IAAK,CACrC,MAAMgJ,EAAQmB,EAAMnK,GAAGgJ,MAAMqB,GAC7B,GAAc,OAAVrB,GAGAA,EAAM,KAAOS,EAAjB,CAGA,IAAe,IAAXvB,EAIG,CACL,GAAiB,QAAbc,EAAM,GACR,MACFsB,EAAMtK,EACN,MAPA,GAAiB,UAAbgJ,EAAM,GACR,MACFd,EAAQlI,GAQZ,IAAe,IAAXkI,IAAyB,IAAToC,EAClB,MAAM,IAAIvD,MAAM,8BAAgC0C,GAElD,MAAMc,EAASJ,EAAMjJ,MAAMgH,EAAQ,EAAGoC,GAAK/K,KAAK,IAEhDgL,EAAOC,QAAQ,kBAAmB,IAElC,MAAMpD,EAAQ1J,EAAOiF,KAAK4H,EAAQ,UAClC,OAAOP,EAAW7K,UAAU+K,OAAO5L,KAAKR,KAAMsJ,EAAOvD,K,sBCjDvD,2BACE,aAGA,SAASoB,EAAQgC,EAAKwD,GACpB,IAAKxD,EAAK,MAAM,IAAIF,MAAM0D,GAAO,oBAKnC,SAAShN,EAAUiN,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAAS1L,UAAYwL,EAAUxL,UAC/BuL,EAAKvL,UAAY,IAAI0L,EACrBH,EAAKvL,UAAUgF,YAAcuG,EAK/B,SAASI,EAAIC,EAAQtH,EAAMuH,GACzB,GAAIF,EAAGG,KAAKF,GACV,OAAOA,EAGTjN,KAAKoN,SAAW,EAChBpN,KAAKqN,MAAQ,KACbrN,KAAK6B,OAAS,EAGd7B,KAAKsN,IAAM,KAEI,OAAXL,IACW,OAATtH,GAA0B,OAATA,IACnBuH,EAASvH,EACTA,EAAO,IAGT3F,KAAKK,MAAM4M,GAAU,EAAGtH,GAAQ,GAAIuH,GAAU,OAYlD,IAAItN,EATkB,kBAAXwB,EACTA,EAAOtC,QAAUkO,EAEjBlO,EAAQkO,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGO,SAAW,GAGd,IACE3N,EAAS,EAAQ,IAAUA,OAC3B,MAAOqK,IAoIT,SAASuD,EAAUnL,EAAK+H,EAAOoC,GAG7B,IAFA,IAAIiB,EAAI,EACJC,EAAMC,KAAKC,IAAIvL,EAAIR,OAAQ2K,GACtBtK,EAAIkI,EAAOlI,EAAIwL,EAAKxL,IAAK,CAChC,IAAI2L,EAAIxL,EAAII,WAAWP,GAAK,GAE5BuL,IAAM,EAIJA,GADEI,GAAK,IAAMA,GAAK,GACbA,EAAI,GAAK,GAGLA,GAAK,IAAMA,GAAK,GACpBA,EAAI,GAAK,GAIL,GAAJA,EAGT,OAAOJ,EAiCT,SAASK,EAAWzL,EAAK+H,EAAOoC,EAAKuB,GAGnC,IAFA,IAAIN,EAAI,EACJC,EAAMC,KAAKC,IAAIvL,EAAIR,OAAQ2K,GACtBtK,EAAIkI,EAAOlI,EAAIwL,EAAKxL,IAAK,CAChC,IAAI2L,EAAIxL,EAAII,WAAWP,GAAK,GAE5BuL,GAAKM,EAIHN,GADEI,GAAK,GACFA,EAAI,GAAK,GAGLA,GAAK,GACTA,EAAI,GAAK,GAITA,EAGT,OAAOJ,EA5MTT,EAAGG,KAAO,SAAezM,GACvB,OAAIA,aAAesM,GAIJ,OAARtM,GAA+B,kBAARA,GAC5BA,EAAI2F,YAAYkH,WAAaP,EAAGO,UAAYrK,MAAMC,QAAQzC,EAAI2M,QAGlEL,EAAGgB,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTlB,EAAGY,IAAM,SAAcK,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTlB,EAAG3L,UAAUhB,MAAQ,SAAe4M,EAAQtH,EAAMuH,GAChD,GAAsB,kBAAXD,EACT,OAAOjN,KAAKoO,YAAYnB,EAAQtH,EAAMuH,GAGxC,GAAsB,kBAAXD,EACT,OAAOjN,KAAKqO,WAAWpB,EAAQtH,EAAMuH,GAG1B,QAATvH,IACFA,EAAO,IAETwB,EAAOxB,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAEnDsH,EAASA,EAAOvB,WAAWgB,QAAQ,OAAQ,IAC3C,IAAItC,EAAQ,EACM,MAAd6C,EAAO,IACT7C,IAGW,KAATzE,EACF3F,KAAKsO,UAAUrB,EAAQ7C,GAEvBpK,KAAKuO,WAAWtB,EAAQtH,EAAMyE,GAGd,MAAd6C,EAAO,KACTjN,KAAKoN,SAAW,GAGlBpN,KAAKwO,QAEU,OAAXtB,GAEJlN,KAAKqO,WAAWrO,KAAK0E,UAAWiB,EAAMuH,IAGxCF,EAAG3L,UAAU+M,YAAc,SAAsBnB,EAAQtH,EAAMuH,GACzDD,EAAS,IACXjN,KAAKoN,SAAW,EAChBH,GAAUA,GAERA,EAAS,UACXjN,KAAKqN,MAAQ,CAAW,SAATJ,GACfjN,KAAK6B,OAAS,GACLoL,EAAS,kBAClBjN,KAAKqN,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,UAEzBjN,KAAK6B,OAAS,IAEdsF,EAAO8F,EAAS,kBAChBjN,KAAKqN,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,SACvB,GAEFjN,KAAK6B,OAAS,GAGD,OAAXqL,GAGJlN,KAAKqO,WAAWrO,KAAK0E,UAAWiB,EAAMuH,IAGxCF,EAAG3L,UAAUgN,WAAa,SAAqBpB,EAAQtH,EAAMuH,GAG3D,GADA/F,EAAgC,kBAAlB8F,EAAOpL,QACjBoL,EAAOpL,QAAU,EAGnB,OAFA7B,KAAKqN,MAAQ,CAAE,GACfrN,KAAK6B,OAAS,EACP7B,KAGTA,KAAK6B,OAAS8L,KAAKc,KAAKxB,EAAOpL,OAAS,GACxC7B,KAAKqN,MAAQ,IAAInK,MAAMlD,KAAK6B,QAC5B,IAAK,IAAIK,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAC/BlC,KAAKqN,MAAMnL,GAAK,EAGlB,IAAIC,EAAGuM,EACHC,EAAM,EACV,GAAe,OAAXzB,EACF,IAAKhL,EAAI+K,EAAOpL,OAAS,EAAGM,EAAI,EAAGD,GAAK,EAAGA,GAAK,EAC9CwM,EAAIzB,EAAO/K,GAAM+K,EAAO/K,EAAI,IAAM,EAAM+K,EAAO/K,EAAI,IAAM,GACzDlC,KAAKqN,MAAMlL,IAAOuM,GAAKC,EAAO,SAC9B3O,KAAKqN,MAAMlL,EAAI,GAAMuM,IAAO,GAAKC,EAAQ,SACzCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPxM,UAGC,GAAe,OAAX+K,EACT,IAAKhL,EAAI,EAAGC,EAAI,EAAGD,EAAI+K,EAAOpL,OAAQK,GAAK,EACzCwM,EAAIzB,EAAO/K,GAAM+K,EAAO/K,EAAI,IAAM,EAAM+K,EAAO/K,EAAI,IAAM,GACzDlC,KAAKqN,MAAMlL,IAAOuM,GAAKC,EAAO,SAC9B3O,KAAKqN,MAAMlL,EAAI,GAAMuM,IAAO,GAAKC,EAAQ,SACzCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPxM,KAIN,OAAOnC,KAAKwO,SA2BdxB,EAAG3L,UAAUiN,UAAY,SAAoBrB,EAAQ7C,GAEnDpK,KAAK6B,OAAS8L,KAAKc,MAAMxB,EAAOpL,OAASuI,GAAS,GAClDpK,KAAKqN,MAAQ,IAAInK,MAAMlD,KAAK6B,QAC5B,IAAK,IAAIK,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAC/BlC,KAAKqN,MAAMnL,GAAK,EAGlB,IAAIC,EAAGuM,EAEHC,EAAM,EACV,IAAKzM,EAAI+K,EAAOpL,OAAS,EAAGM,EAAI,EAAGD,GAAKkI,EAAOlI,GAAK,EAClDwM,EAAIlB,EAASP,EAAQ/K,EAAGA,EAAI,GAC5BlC,KAAKqN,MAAMlL,IAAOuM,GAAKC,EAAO,SAE9B3O,KAAKqN,MAAMlL,EAAI,IAAMuM,IAAO,GAAKC,EAAO,QACxCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPxM,KAGAD,EAAI,IAAMkI,IACZsE,EAAIlB,EAASP,EAAQ7C,EAAOlI,EAAI,GAChClC,KAAKqN,MAAMlL,IAAOuM,GAAKC,EAAO,SAC9B3O,KAAKqN,MAAMlL,EAAI,IAAMuM,IAAO,GAAKC,EAAO,SAE1C3O,KAAKwO,SA2BPxB,EAAG3L,UAAUkN,WAAa,SAAqBtB,EAAQtH,EAAMyE,GAE3DpK,KAAKqN,MAAQ,CAAE,GACfrN,KAAK6B,OAAS,EAGd,IAAK,IAAI+M,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWlJ,EAClEiJ,IAEFA,IACAC,EAAWA,EAAUlJ,EAAQ,EAO7B,IALA,IAAImJ,EAAQ7B,EAAOpL,OAASuI,EACxB2E,EAAMD,EAAQF,EACdpC,EAAMmB,KAAKC,IAAIkB,EAAOA,EAAQC,GAAO3E,EAErC4E,EAAO,EACF9M,EAAIkI,EAAOlI,EAAIsK,EAAKtK,GAAK0M,EAChCI,EAAOlB,EAAUb,EAAQ/K,EAAGA,EAAI0M,EAASjJ,GAEzC3F,KAAKiP,MAAMJ,GACP7O,KAAKqN,MAAM,GAAK2B,EAAO,SACzBhP,KAAKqN,MAAM,IAAM2B,EAEjBhP,KAAKkP,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAOlB,EAAUb,EAAQ/K,EAAG+K,EAAOpL,OAAQ8D,GAEtCzD,EAAI,EAAGA,EAAI6M,EAAK7M,IACnBiN,GAAOxJ,EAGT3F,KAAKiP,MAAME,GACPnP,KAAKqN,MAAM,GAAK2B,EAAO,SACzBhP,KAAKqN,MAAM,IAAM2B,EAEjBhP,KAAKkP,OAAOF,KAKlBhC,EAAG3L,UAAU0D,KAAO,SAAeqK,GACjCA,EAAK/B,MAAQ,IAAInK,MAAMlD,KAAK6B,QAC5B,IAAK,IAAIK,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAC/BkN,EAAK/B,MAAMnL,GAAKlC,KAAKqN,MAAMnL,GAE7BkN,EAAKvN,OAAS7B,KAAK6B,OACnBuN,EAAKhC,SAAWpN,KAAKoN,SACrBgC,EAAK9B,IAAMtN,KAAKsN,KAGlBN,EAAG3L,UAAUgH,MAAQ,WACnB,IAAIoF,EAAI,IAAIT,EAAG,MAEf,OADAhN,KAAK+E,KAAK0I,GACHA,GAGTT,EAAG3L,UAAUgO,QAAU,SAAkB7L,GACvC,MAAOxD,KAAK6B,OAAS2B,EACnBxD,KAAKqN,MAAMrN,KAAK6B,UAAY,EAE9B,OAAO7B,MAITgN,EAAG3L,UAAUmN,MAAQ,WACnB,MAAOxO,KAAK6B,OAAS,GAAqC,IAAhC7B,KAAKqN,MAAMrN,KAAK6B,OAAS,GACjD7B,KAAK6B,SAEP,OAAO7B,KAAKsP,aAGdtC,EAAG3L,UAAUiO,UAAY,WAKvB,OAHoB,IAAhBtP,KAAK6B,QAAkC,IAAlB7B,KAAKqN,MAAM,KAClCrN,KAAKoN,SAAW,GAEXpN,MAGTgN,EAAG3L,UAAUkO,QAAU,WACrB,OAAQvP,KAAKsN,IAAM,UAAY,SAAWtN,KAAK0L,SAAS,IAAM,KAiChE,IAAI8D,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UAyM9D,SAASC,EAAYjP,GAGnB,IAFA,IAAIgO,EAAI,IAAIxL,MAAMxC,EAAIkP,aAEbC,EAAM,EAAGA,EAAMnB,EAAE7M,OAAQgO,IAAO,CACvC,IAAIlB,EAAOkB,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjBnB,EAAEmB,IAAQnP,EAAI2M,MAAMsB,GAAQ,GAAKmB,KAAWA,EAG9C,OAAOpB,EAmWT,SAASqB,EAAYC,EAAMtP,EAAKoE,GAC9BA,EAAIsI,SAAW1M,EAAI0M,SAAW4C,EAAK5C,SACnC,IAAIM,EAAOsC,EAAKnO,OAASnB,EAAImB,OAAU,EACvCiD,EAAIjD,OAAS6L,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIuC,EAAoB,EAAhBD,EAAK3C,MAAM,GACf6C,EAAmB,EAAfxP,EAAI2M,MAAM,GACdI,EAAIwC,EAAIC,EAERC,EAAS,SAAJ1C,EACL2C,EAAS3C,EAAI,SAAa,EAC9B3I,EAAIuI,MAAM,GAAK8C,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAI3C,EAAK2C,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAO7C,KAAKC,IAAIyC,EAAG3P,EAAImB,OAAS,GAC3BM,EAAIwL,KAAKK,IAAI,EAAGqC,EAAIL,EAAKnO,OAAS,GAAIM,GAAKqO,EAAMrO,IAAK,CAC7D,IAAID,EAAKmO,EAAIlO,EAAK,EAClB8N,EAAoB,EAAhBD,EAAK3C,MAAMnL,GACfgO,EAAmB,EAAfxP,EAAI2M,MAAMlL,GACdsL,EAAIwC,EAAIC,EAAIK,EACZD,GAAW7C,EAAI,SAAa,EAC5B8C,EAAY,SAAJ9C,EAEV3I,EAAIuI,MAAMgD,GAAa,EAARE,EACfH,EAAiB,EAATE,EAQV,OANc,IAAVF,EACFtL,EAAIuI,MAAMgD,GAAa,EAARD,EAEftL,EAAIjD,SAGCiD,EAAI0J,QAzlBbxB,EAAG3L,UAAUqK,SAAW,SAAmB/F,EAAM8K,GAI/C,IAAI3L,EACJ,GAJAa,EAAOA,GAAQ,GACf8K,EAAoB,EAAVA,GAAe,EAGZ,KAAT9K,GAAwB,QAATA,EAAgB,CACjCb,EAAM,GAGN,IAFA,IAAI6J,EAAM,EACNyB,EAAQ,EACHlO,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAAK,CACpC,IAAIwM,EAAI1O,KAAKqN,MAAMnL,GACf8M,GAA+B,UAArBN,GAAKC,EAAOyB,IAAmB1E,SAAS,IACtD0E,EAAS1B,IAAO,GAAKC,EAAQ,SAE3B7J,EADY,IAAVsL,GAAelO,IAAMlC,KAAK6B,OAAS,EAC/B2N,EAAM,EAAIR,EAAKnN,QAAUmN,EAAOlK,EAEhCkK,EAAOlK,EAEf6J,GAAO,EACHA,GAAO,KACTA,GAAO,GACPzM,KAGU,IAAVkO,IACFtL,EAAMsL,EAAM1E,SAAS,IAAM5G,GAE7B,MAAOA,EAAIjD,OAAS4O,IAAY,EAC9B3L,EAAM,IAAMA,EAKd,OAHsB,IAAlB9E,KAAKoN,WACPtI,EAAM,IAAMA,GAEPA,EAGT,GAAIa,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAI+K,EAAYjB,EAAW9J,GAEvBgL,EAAYjB,EAAW/J,GAC3Bb,EAAM,GACN,IAAI+I,EAAI7N,KAAKqI,QACbwF,EAAET,SAAW,EACb,OAAQS,EAAE+C,SAAU,CAClB,IAAInD,EAAII,EAAEgD,KAAKF,GAAWjF,SAAS/F,GACnCkI,EAAIA,EAAEiD,MAAMH,GAKV7L,EAHG+I,EAAE+C,SAGCnD,EAAI3I,EAFJ0K,EAAMkB,EAAYjD,EAAE5L,QAAU4L,EAAI3I,EAKxC9E,KAAK4Q,WACP9L,EAAM,IAAMA,GAEd,MAAOA,EAAIjD,OAAS4O,IAAY,EAC9B3L,EAAM,IAAMA,EAKd,OAHsB,IAAlB9E,KAAKoN,WACPtI,EAAM,IAAMA,GAEPA,EAGTqC,GAAO,EAAO,oCAGhB6F,EAAG3L,UAAU0P,SAAW,WACtB,IAAIC,EAAMhR,KAAKqN,MAAM,GASrB,OARoB,IAAhBrN,KAAK6B,OACPmP,GAAuB,SAAhBhR,KAAKqN,MAAM,GACO,IAAhBrN,KAAK6B,QAAkC,IAAlB7B,KAAKqN,MAAM,GAEzC2D,GAAO,iBAAoC,SAAhBhR,KAAKqN,MAAM,GAC7BrN,KAAK6B,OAAS,GACvBsF,GAAO,EAAO,8CAEU,IAAlBnH,KAAKoN,UAAmB4D,EAAMA,GAGxChE,EAAG3L,UAAU4P,OAAS,WACpB,OAAOjR,KAAK0L,SAAS,KAGvBsB,EAAG3L,UAAU6P,SAAW,SAAmBhE,EAAQrL,GAEjD,OADAsF,EAAyB,qBAAXvH,GACPI,KAAKmR,YAAYvR,EAAQsN,EAAQrL,IAG1CmL,EAAG3L,UAAUqD,QAAU,SAAkBwI,EAAQrL,GAC/C,OAAO7B,KAAKmR,YAAYjO,MAAOgK,EAAQrL,IAGzCmL,EAAG3L,UAAU8P,YAAc,SAAsBC,EAAWlE,EAAQrL,GAClE,IAAIqE,EAAalG,KAAKkG,aAClBmL,EAAYxP,GAAU8L,KAAKK,IAAI,EAAG9H,GACtCiB,EAAOjB,GAAcmL,EAAW,yCAChClK,EAAOkK,EAAY,EAAG,+BAEtBrR,KAAKwO,QACL,IAGI0B,EAAGhO,EAHHoP,EAA0B,OAAXpE,EACfjO,EAAM,IAAImS,EAAUC,GAGpBE,EAAIvR,KAAKqI,QACb,GAAKiJ,EAYE,CACL,IAAKpP,EAAI,GAAIqP,EAAEX,SAAU1O,IACvBgO,EAAIqB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETxS,EAAIiD,GAAKgO,EAGX,KAAOhO,EAAImP,EAAWnP,IACpBjD,EAAIiD,GAAK,MArBM,CAEjB,IAAKA,EAAI,EAAGA,EAAImP,EAAYnL,EAAYhE,IACtCjD,EAAIiD,GAAK,EAGX,IAAKA,EAAI,GAAIqP,EAAEX,SAAU1O,IACvBgO,EAAIqB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETxS,EAAIoS,EAAYnP,EAAI,GAAKgO,EAe7B,OAAOjR,GAGL0O,KAAK+D,MACP1E,EAAG3L,UAAUsQ,WAAa,SAAqBjD,GAC7C,OAAO,GAAKf,KAAK+D,MAAMhD,IAGzB1B,EAAG3L,UAAUsQ,WAAa,SAAqBjD,GAC7C,IAAIkD,EAAIlD,EACJjB,EAAI,EAiBR,OAhBImE,GAAK,OACPnE,GAAK,GACLmE,KAAO,IAELA,GAAK,KACPnE,GAAK,EACLmE,KAAO,GAELA,GAAK,IACPnE,GAAK,EACLmE,KAAO,GAELA,GAAK,IACPnE,GAAK,EACLmE,KAAO,GAEFnE,EAAImE,GAIf5E,EAAG3L,UAAUwQ,UAAY,SAAoBnD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAIkD,EAAIlD,EACJjB,EAAI,EAoBR,OAnBqB,KAAZ,KAAJmE,KACHnE,GAAK,GACLmE,KAAO,IAEU,KAAV,IAAJA,KACHnE,GAAK,EACLmE,KAAO,GAES,KAAT,GAAJA,KACHnE,GAAK,EACLmE,KAAO,GAES,KAAT,EAAJA,KACHnE,GAAK,EACLmE,KAAO,GAES,KAAT,EAAJA,IACHnE,IAEKA,GAITT,EAAG3L,UAAUuO,UAAY,WACvB,IAAIlB,EAAI1O,KAAKqN,MAAMrN,KAAK6B,OAAS,GAC7BiQ,EAAK9R,KAAK2R,WAAWjD,GACzB,OAA2B,IAAnB1O,KAAK6B,OAAS,GAAUiQ,GAiBlC9E,EAAG3L,UAAU0Q,SAAW,WACtB,GAAI/R,KAAK4Q,SAAU,OAAO,EAG1B,IADA,IAAInD,EAAI,EACCvL,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAAK,CACpC,IAAIgO,EAAIlQ,KAAK6R,UAAU7R,KAAKqN,MAAMnL,IAElC,GADAuL,GAAKyC,EACK,KAANA,EAAU,MAEhB,OAAOzC,GAGTT,EAAG3L,UAAU6E,WAAa,WACxB,OAAOyH,KAAKc,KAAKzO,KAAK4P,YAAc,IAGtC5C,EAAG3L,UAAU2Q,OAAS,SAAiBC,GACrC,OAAsB,IAAlBjS,KAAKoN,SACApN,KAAKkS,MAAMC,MAAMF,GAAOG,MAAM,GAEhCpS,KAAKqI,SAGd2E,EAAG3L,UAAUgR,SAAW,SAAmBJ,GACzC,OAAIjS,KAAKsS,MAAML,EAAQ,GACdjS,KAAKuS,KAAKN,GAAOG,MAAM,GAAGI,OAE5BxS,KAAKqI,SAGd2E,EAAG3L,UAAUoR,MAAQ,WACnB,OAAyB,IAAlBzS,KAAKoN,UAIdJ,EAAG3L,UAAUqR,IAAM,WACjB,OAAO1S,KAAKqI,QAAQmK,QAGtBxF,EAAG3L,UAAUmR,KAAO,WAKlB,OAJKxS,KAAK4Q,WACR5Q,KAAKoN,UAAY,GAGZpN,MAITgN,EAAG3L,UAAUsR,KAAO,SAAejS,GACjC,MAAOV,KAAK6B,OAASnB,EAAImB,OACvB7B,KAAKqN,MAAMrN,KAAK6B,UAAY,EAG9B,IAAK,IAAIK,EAAI,EAAGA,EAAIxB,EAAImB,OAAQK,IAC9BlC,KAAKqN,MAAMnL,GAAKlC,KAAKqN,MAAMnL,GAAKxB,EAAI2M,MAAMnL,GAG5C,OAAOlC,KAAKwO,SAGdxB,EAAG3L,UAAUuR,IAAM,SAAclS,GAE/B,OADAyG,EAA0C,KAAlCnH,KAAKoN,SAAW1M,EAAI0M,WACrBpN,KAAK2S,KAAKjS,IAInBsM,EAAG3L,UAAUwR,GAAK,SAAanS,GAC7B,OAAIV,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAKqI,QAAQuK,IAAIlS,GAC/CA,EAAI2H,QAAQuK,IAAI5S,OAGzBgN,EAAG3L,UAAUyR,IAAM,SAAcpS,GAC/B,OAAIV,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAKqI,QAAQsK,KAAKjS,GAChDA,EAAI2H,QAAQsK,KAAK3S,OAI1BgN,EAAG3L,UAAU0R,MAAQ,SAAgBrS,GAEnC,IAAIwP,EAEFA,EADElQ,KAAK6B,OAASnB,EAAImB,OAChBnB,EAEAV,KAGN,IAAK,IAAIkC,EAAI,EAAGA,EAAIgO,EAAErO,OAAQK,IAC5BlC,KAAKqN,MAAMnL,GAAKlC,KAAKqN,MAAMnL,GAAKxB,EAAI2M,MAAMnL,GAK5C,OAFAlC,KAAK6B,OAASqO,EAAErO,OAET7B,KAAKwO,SAGdxB,EAAG3L,UAAU2R,KAAO,SAAetS,GAEjC,OADAyG,EAA0C,KAAlCnH,KAAKoN,SAAW1M,EAAI0M,WACrBpN,KAAK+S,MAAMrS,IAIpBsM,EAAG3L,UAAU4R,IAAM,SAAcvS,GAC/B,OAAIV,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAKqI,QAAQ2K,KAAKtS,GAChDA,EAAI2H,QAAQ2K,KAAKhT,OAG1BgN,EAAG3L,UAAU6R,KAAO,SAAexS,GACjC,OAAIV,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAKqI,QAAQ0K,MAAMrS,GACjDA,EAAI2H,QAAQ0K,MAAM/S,OAI3BgN,EAAG3L,UAAU8R,MAAQ,SAAgBzS,GAEnC,IAAIuP,EACAC,EACAlQ,KAAK6B,OAASnB,EAAImB,QACpBoO,EAAIjQ,KACJkQ,EAAIxP,IAEJuP,EAAIvP,EACJwP,EAAIlQ,MAGN,IAAK,IAAIkC,EAAI,EAAGA,EAAIgO,EAAErO,OAAQK,IAC5BlC,KAAKqN,MAAMnL,GAAK+N,EAAE5C,MAAMnL,GAAKgO,EAAE7C,MAAMnL,GAGvC,GAAIlC,OAASiQ,EACX,KAAO/N,EAAI+N,EAAEpO,OAAQK,IACnBlC,KAAKqN,MAAMnL,GAAK+N,EAAE5C,MAAMnL,GAM5B,OAFAlC,KAAK6B,OAASoO,EAAEpO,OAET7B,KAAKwO,SAGdxB,EAAG3L,UAAU+R,KAAO,SAAe1S,GAEjC,OADAyG,EAA0C,KAAlCnH,KAAKoN,SAAW1M,EAAI0M,WACrBpN,KAAKmT,MAAMzS,IAIpBsM,EAAG3L,UAAUgS,IAAM,SAAc3S,GAC/B,OAAIV,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAKqI,QAAQ+K,KAAK1S,GAChDA,EAAI2H,QAAQ+K,KAAKpT,OAG1BgN,EAAG3L,UAAUiS,KAAO,SAAe5S,GACjC,OAAIV,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAKqI,QAAQ8K,MAAMzS,GACjDA,EAAI2H,QAAQ8K,MAAMnT,OAI3BgN,EAAG3L,UAAU8Q,MAAQ,SAAgBF,GACnC9K,EAAwB,kBAAV8K,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxB5F,KAAKc,KAAKwD,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvBjS,KAAKqP,QAAQkE,GAETC,EAAW,GACbD,IAIF,IAAK,IAAIrR,EAAI,EAAGA,EAAIqR,EAAarR,IAC/BlC,KAAKqN,MAAMnL,GAAsB,UAAhBlC,KAAKqN,MAAMnL,GAS9B,OALIsR,EAAW,IACbxT,KAAKqN,MAAMnL,IAAMlC,KAAKqN,MAAMnL,GAAM,UAAc,GAAKsR,GAIhDxT,KAAKwO,SAGdxB,EAAG3L,UAAUkR,KAAO,SAAeN,GACjC,OAAOjS,KAAKqI,QAAQ8J,MAAMF,IAI5BjF,EAAG3L,UAAUoS,KAAO,SAAe5D,EAAK1G,GACtChC,EAAsB,kBAAR0I,GAAoBA,GAAO,GAEzC,IAAIlB,EAAOkB,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARA7P,KAAKqP,QAAQV,EAAM,GAGjB3O,KAAKqN,MAAMsB,GADTxF,EACgBnJ,KAAKqN,MAAMsB,GAAQ,GAAKmB,EAExB9P,KAAKqN,MAAMsB,KAAS,GAAKmB,GAGtC9P,KAAKwO,SAIdxB,EAAG3L,UAAUqS,KAAO,SAAehT,GACjC,IAAI+M,EAkBAwC,EAAGC,EAfP,GAAsB,IAAlBlQ,KAAKoN,UAAmC,IAAjB1M,EAAI0M,SAI7B,OAHApN,KAAKoN,SAAW,EAChBK,EAAIzN,KAAK2T,KAAKjT,GACdV,KAAKoN,UAAY,EACVpN,KAAKsP,YAGP,GAAsB,IAAlBtP,KAAKoN,UAAmC,IAAjB1M,EAAI0M,SAIpC,OAHA1M,EAAI0M,SAAW,EACfK,EAAIzN,KAAK2T,KAAKjT,GACdA,EAAI0M,SAAW,EACRK,EAAE6B,YAKPtP,KAAK6B,OAASnB,EAAImB,QACpBoO,EAAIjQ,KACJkQ,EAAIxP,IAEJuP,EAAIvP,EACJwP,EAAIlQ,MAIN,IADA,IAAIoQ,EAAQ,EACHlO,EAAI,EAAGA,EAAIgO,EAAErO,OAAQK,IAC5BuL,GAAkB,EAAbwC,EAAE5C,MAAMnL,KAAwB,EAAbgO,EAAE7C,MAAMnL,IAAUkO,EAC1CpQ,KAAKqN,MAAMnL,GAAS,SAAJuL,EAChB2C,EAAQ3C,IAAM,GAEhB,KAAiB,IAAV2C,GAAelO,EAAI+N,EAAEpO,OAAQK,IAClCuL,GAAkB,EAAbwC,EAAE5C,MAAMnL,IAAUkO,EACvBpQ,KAAKqN,MAAMnL,GAAS,SAAJuL,EAChB2C,EAAQ3C,IAAM,GAIhB,GADAzN,KAAK6B,OAASoO,EAAEpO,OACF,IAAVuO,EACFpQ,KAAKqN,MAAMrN,KAAK6B,QAAUuO,EAC1BpQ,KAAK6B,cAEA,GAAIoO,IAAMjQ,KACf,KAAOkC,EAAI+N,EAAEpO,OAAQK,IACnBlC,KAAKqN,MAAMnL,GAAK+N,EAAE5C,MAAMnL,GAI5B,OAAOlC,MAITgN,EAAG3L,UAAUuS,IAAM,SAAclT,GAC/B,IAAIzB,EACJ,OAAqB,IAAjByB,EAAI0M,UAAoC,IAAlBpN,KAAKoN,UAC7B1M,EAAI0M,SAAW,EACfnO,EAAMe,KAAK6T,IAAInT,GACfA,EAAI0M,UAAY,EACTnO,GACmB,IAAjByB,EAAI0M,UAAoC,IAAlBpN,KAAKoN,UACpCpN,KAAKoN,SAAW,EAChBnO,EAAMyB,EAAImT,IAAI7T,MACdA,KAAKoN,SAAW,EACTnO,GAGLe,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAKqI,QAAQqL,KAAKhT,GAEhDA,EAAI2H,QAAQqL,KAAK1T,OAI1BgN,EAAG3L,UAAUsS,KAAO,SAAejT,GAEjC,GAAqB,IAAjBA,EAAI0M,SAAgB,CACtB1M,EAAI0M,SAAW,EACf,IAAIK,EAAIzN,KAAK0T,KAAKhT,GAElB,OADAA,EAAI0M,SAAW,EACRK,EAAE6B,YAGJ,GAAsB,IAAlBtP,KAAKoN,SAId,OAHApN,KAAKoN,SAAW,EAChBpN,KAAK0T,KAAKhT,GACVV,KAAKoN,SAAW,EACTpN,KAAKsP,YAId,IAWIW,EAAGC,EAXH/B,EAAMnO,KAAKmO,IAAIzN,GAGnB,GAAY,IAARyN,EAIF,OAHAnO,KAAKoN,SAAW,EAChBpN,KAAK6B,OAAS,EACd7B,KAAKqN,MAAM,GAAK,EACTrN,KAKLmO,EAAM,GACR8B,EAAIjQ,KACJkQ,EAAIxP,IAEJuP,EAAIvP,EACJwP,EAAIlQ,MAIN,IADA,IAAIoQ,EAAQ,EACHlO,EAAI,EAAGA,EAAIgO,EAAErO,OAAQK,IAC5BuL,GAAkB,EAAbwC,EAAE5C,MAAMnL,KAAwB,EAAbgO,EAAE7C,MAAMnL,IAAUkO,EAC1CA,EAAQ3C,GAAK,GACbzN,KAAKqN,MAAMnL,GAAS,SAAJuL,EAElB,KAAiB,IAAV2C,GAAelO,EAAI+N,EAAEpO,OAAQK,IAClCuL,GAAkB,EAAbwC,EAAE5C,MAAMnL,IAAUkO,EACvBA,EAAQ3C,GAAK,GACbzN,KAAKqN,MAAMnL,GAAS,SAAJuL,EAIlB,GAAc,IAAV2C,GAAelO,EAAI+N,EAAEpO,QAAUoO,IAAMjQ,KACvC,KAAOkC,EAAI+N,EAAEpO,OAAQK,IACnBlC,KAAKqN,MAAMnL,GAAK+N,EAAE5C,MAAMnL,GAU5B,OANAlC,KAAK6B,OAAS8L,KAAKK,IAAIhO,KAAK6B,OAAQK,GAEhC+N,IAAMjQ,OACRA,KAAKoN,SAAW,GAGXpN,KAAKwO,SAIdxB,EAAG3L,UAAUwS,IAAM,SAAcnT,GAC/B,OAAOV,KAAKqI,QAAQsL,KAAKjT,IA+C3B,IAAIoT,EAAc,SAAsB9D,EAAMtP,EAAKoE,GACjD,IAIIqL,EACA4D,EACAjC,EANA7B,EAAID,EAAK3C,MACT6C,EAAIxP,EAAI2M,MACR2G,EAAIlP,EAAIuI,MACRQ,EAAI,EAIJoG,EAAY,EAAPhE,EAAE,GACPiE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnE,EAAE,GACPoE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtE,EAAE,GACPuE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzE,EAAE,GACP0E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5E,EAAE,GACP6E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/E,EAAE,GACPgF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlF,EAAE,GACPmF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrF,EAAE,GACPsF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxF,EAAE,GACPyF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3F,EAAE,GACP4F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7F,EAAE,GACP8F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhG,EAAE,GACPiG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnG,EAAE,GACPoG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtG,EAAE,GACPuG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzG,EAAE,GACP0G,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAP5G,EAAE,GACP6G,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP/G,EAAE,GACPgH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPlH,EAAE,GACPmH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPrH,EAAE,GACPsH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPxH,EAAE,GACPyH,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjB5S,EAAIsI,SAAW4C,EAAK5C,SAAW1M,EAAI0M,SACnCtI,EAAIjD,OAAS,GAEbsO,EAAKxC,KAAKkK,KAAK3D,EAAK8B,GACpBjC,EAAMpG,KAAKkK,KAAK3D,EAAK+B,GACrBlC,EAAOA,EAAMpG,KAAKkK,KAAK1D,EAAK6B,GAAQ,EACpClE,EAAKnE,KAAKkK,KAAK1D,EAAK8B,GACpB,IAAI6B,IAAQjK,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EACrDlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAM+D,KAAO,IAAO,EAChDA,IAAM,SAEN3H,EAAKxC,KAAKkK,KAAKxD,EAAK2B,GACpBjC,EAAMpG,KAAKkK,KAAKxD,EAAK4B,GACrBlC,EAAOA,EAAMpG,KAAKkK,KAAKvD,EAAK0B,GAAQ,EACpClE,EAAKnE,KAAKkK,KAAKvD,EAAK2B,GACpB9F,EAAMA,EAAKxC,KAAKkK,KAAK3D,EAAKiC,GAAQ,EAClCpC,EAAOA,EAAMpG,KAAKkK,KAAK3D,EAAKkC,GAAQ,EACpCrC,EAAOA,EAAMpG,KAAKkK,KAAK1D,EAAKgC,GAAQ,EACpCrE,EAAMA,EAAKnE,KAAKkK,KAAK1D,EAAKiC,GAAQ,EAClC,IAAI2B,IAAQlK,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EACrDlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAEN5H,EAAKxC,KAAKkK,KAAKrD,EAAKwB,GACpBjC,EAAMpG,KAAKkK,KAAKrD,EAAKyB,GACrBlC,EAAOA,EAAMpG,KAAKkK,KAAKpD,EAAKuB,GAAQ,EACpClE,EAAKnE,KAAKkK,KAAKpD,EAAKwB,GACpB9F,EAAMA,EAAKxC,KAAKkK,KAAKxD,EAAK8B,GAAQ,EAClCpC,EAAOA,EAAMpG,KAAKkK,KAAKxD,EAAK+B,GAAQ,EACpCrC,EAAOA,EAAMpG,KAAKkK,KAAKvD,EAAK6B,GAAQ,EACpCrE,EAAMA,EAAKnE,KAAKkK,KAAKvD,EAAK8B,GAAQ,EAClCjG,EAAMA,EAAKxC,KAAKkK,KAAK3D,EAAKoC,GAAQ,EAClCvC,EAAOA,EAAMpG,KAAKkK,KAAK3D,EAAKqC,GAAQ,EACpCxC,EAAOA,EAAMpG,KAAKkK,KAAK1D,EAAKmC,GAAQ,EACpCxE,EAAMA,EAAKnE,KAAKkK,KAAK1D,EAAKoC,GAAQ,EAClC,IAAIyB,IAAQnK,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EACrDlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAEN7H,EAAKxC,KAAKkK,KAAKlD,EAAKqB,GACpBjC,EAAMpG,KAAKkK,KAAKlD,EAAKsB,GACrBlC,EAAOA,EAAMpG,KAAKkK,KAAKjD,EAAKoB,GAAQ,EACpClE,EAAKnE,KAAKkK,KAAKjD,EAAKqB,GACpB9F,EAAMA,EAAKxC,KAAKkK,KAAKrD,EAAK2B,GAAQ,EAClCpC,EAAOA,EAAMpG,KAAKkK,KAAKrD,EAAK4B,GAAQ,EACpCrC,EAAOA,EAAMpG,KAAKkK,KAAKpD,EAAK0B,GAAQ,EACpCrE,EAAMA,EAAKnE,KAAKkK,KAAKpD,EAAK2B,GAAQ,EAClCjG,EAAMA,EAAKxC,KAAKkK,KAAKxD,EAAKiC,GAAQ,EAClCvC,EAAOA,EAAMpG,KAAKkK,KAAKxD,EAAKkC,GAAQ,EACpCxC,EAAOA,EAAMpG,KAAKkK,KAAKvD,EAAKgC,GAAQ,EACpCxE,EAAMA,EAAKnE,KAAKkK,KAAKvD,EAAKiC,GAAQ,EAClCpG,EAAMA,EAAKxC,KAAKkK,KAAK3D,EAAKuC,GAAQ,EAClC1C,EAAOA,EAAMpG,KAAKkK,KAAK3D,EAAKwC,GAAQ,EACpC3C,EAAOA,EAAMpG,KAAKkK,KAAK1D,EAAKsC,GAAQ,EACpC3E,EAAMA,EAAKnE,KAAKkK,KAAK1D,EAAKuC,GAAQ,EAClC,IAAIuB,IAAQpK,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EACrDlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAEN9H,EAAKxC,KAAKkK,KAAK/C,EAAKkB,GACpBjC,EAAMpG,KAAKkK,KAAK/C,EAAKmB,GACrBlC,EAAOA,EAAMpG,KAAKkK,KAAK9C,EAAKiB,GAAQ,EACpClE,EAAKnE,KAAKkK,KAAK9C,EAAKkB,GACpB9F,EAAMA,EAAKxC,KAAKkK,KAAKlD,EAAKwB,GAAQ,EAClCpC,EAAOA,EAAMpG,KAAKkK,KAAKlD,EAAKyB,GAAQ,EACpCrC,EAAOA,EAAMpG,KAAKkK,KAAKjD,EAAKuB,GAAQ,EACpCrE,EAAMA,EAAKnE,KAAKkK,KAAKjD,EAAKwB,GAAQ,EAClCjG,EAAMA,EAAKxC,KAAKkK,KAAKrD,EAAK8B,GAAQ,EAClCvC,EAAOA,EAAMpG,KAAKkK,KAAKrD,EAAK+B,GAAQ,EACpCxC,EAAOA,EAAMpG,KAAKkK,KAAKpD,EAAK6B,GAAQ,EACpCxE,EAAMA,EAAKnE,KAAKkK,KAAKpD,EAAK8B,GAAQ,EAClCpG,EAAMA,EAAKxC,KAAKkK,KAAKxD,EAAKoC,GAAQ,EAClC1C,EAAOA,EAAMpG,KAAKkK,KAAKxD,EAAKqC,GAAQ,EACpC3C,EAAOA,EAAMpG,KAAKkK,KAAKvD,EAAKmC,GAAQ,EACpC3E,EAAMA,EAAKnE,KAAKkK,KAAKvD,EAAKoC,GAAQ,EAClCvG,EAAMA,EAAKxC,KAAKkK,KAAK3D,EAAK0C,GAAQ,EAClC7C,EAAOA,EAAMpG,KAAKkK,KAAK3D,EAAK2C,IAAQ,EACpC9C,EAAOA,EAAMpG,KAAKkK,KAAK1D,EAAKyC,GAAQ,EACpC9E,EAAMA,EAAKnE,KAAKkK,KAAK1D,EAAK0C,IAAQ,EAClC,IAAIqB,IAAQrK,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EACrDlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAKxC,KAAKkK,KAAK5C,EAAKe,GACpBjC,EAAMpG,KAAKkK,KAAK5C,EAAKgB,GACrBlC,EAAOA,EAAMpG,KAAKkK,KAAK3C,EAAKc,GAAQ,EACpClE,EAAKnE,KAAKkK,KAAK3C,EAAKe,GACpB9F,EAAMA,EAAKxC,KAAKkK,KAAK/C,EAAKqB,GAAQ,EAClCpC,EAAOA,EAAMpG,KAAKkK,KAAK/C,EAAKsB,GAAQ,EACpCrC,EAAOA,EAAMpG,KAAKkK,KAAK9C,EAAKoB,GAAQ,EACpCrE,EAAMA,EAAKnE,KAAKkK,KAAK9C,EAAKqB,GAAQ,EAClCjG,EAAMA,EAAKxC,KAAKkK,KAAKlD,EAAK2B,GAAQ,EAClCvC,EAAOA,EAAMpG,KAAKkK,KAAKlD,EAAK4B,GAAQ,EACpCxC,EAAOA,EAAMpG,KAAKkK,KAAKjD,EAAK0B,GAAQ,EACpCxE,EAAMA,EAAKnE,KAAKkK,KAAKjD,EAAK2B,GAAQ,EAClCpG,EAAMA,EAAKxC,KAAKkK,KAAKrD,EAAKiC,GAAQ,EAClC1C,EAAOA,EAAMpG,KAAKkK,KAAKrD,EAAKkC,GAAQ,EACpC3C,EAAOA,EAAMpG,KAAKkK,KAAKpD,EAAKgC,GAAQ,EACpC3E,EAAMA,EAAKnE,KAAKkK,KAAKpD,EAAKiC,GAAQ,EAClCvG,EAAMA,EAAKxC,KAAKkK,KAAKxD,EAAKuC,GAAQ,EAClC7C,EAAOA,EAAMpG,KAAKkK,KAAKxD,EAAKwC,IAAQ,EACpC9C,EAAOA,EAAMpG,KAAKkK,KAAKvD,EAAKsC,GAAQ,EACpC9E,EAAMA,EAAKnE,KAAKkK,KAAKvD,EAAKuC,IAAQ,EAClC1G,EAAMA,EAAKxC,KAAKkK,KAAK3D,EAAK6C,IAAQ,EAClChD,EAAOA,EAAMpG,KAAKkK,KAAK3D,EAAK8C,IAAQ,EACpCjD,EAAOA,EAAMpG,KAAKkK,KAAK1D,EAAK4C,IAAQ,EACpCjF,EAAMA,EAAKnE,KAAKkK,KAAK1D,EAAK6C,IAAQ,EAClC,IAAImB,IAAQtK,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EACrDlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENhI,EAAKxC,KAAKkK,KAAKzC,EAAKY,GACpBjC,EAAMpG,KAAKkK,KAAKzC,EAAKa,GACrBlC,EAAOA,EAAMpG,KAAKkK,KAAKxC,EAAKW,GAAQ,EACpClE,EAAKnE,KAAKkK,KAAKxC,EAAKY,GACpB9F,EAAMA,EAAKxC,KAAKkK,KAAK5C,EAAKkB,GAAQ,EAClCpC,EAAOA,EAAMpG,KAAKkK,KAAK5C,EAAKmB,GAAQ,EACpCrC,EAAOA,EAAMpG,KAAKkK,KAAK3C,EAAKiB,GAAQ,EACpCrE,EAAMA,EAAKnE,KAAKkK,KAAK3C,EAAKkB,GAAQ,EAClCjG,EAAMA,EAAKxC,KAAKkK,KAAK/C,EAAKwB,GAAQ,EAClCvC,EAAOA,EAAMpG,KAAKkK,KAAK/C,EAAKyB,GAAQ,EACpCxC,EAAOA,EAAMpG,KAAKkK,KAAK9C,EAAKuB,GAAQ,EACpCxE,EAAMA,EAAKnE,KAAKkK,KAAK9C,EAAKwB,GAAQ,EAClCpG,EAAMA,EAAKxC,KAAKkK,KAAKlD,EAAK8B,GAAQ,EAClC1C,EAAOA,EAAMpG,KAAKkK,KAAKlD,EAAK+B,GAAQ,EACpC3C,EAAOA,EAAMpG,KAAKkK,KAAKjD,EAAK6B,GAAQ,EACpC3E,EAAMA,EAAKnE,KAAKkK,KAAKjD,EAAK8B,GAAQ,EAClCvG,EAAMA,EAAKxC,KAAKkK,KAAKrD,EAAKoC,GAAQ,EAClC7C,EAAOA,EAAMpG,KAAKkK,KAAKrD,EAAKqC,IAAQ,EACpC9C,EAAOA,EAAMpG,KAAKkK,KAAKpD,EAAKmC,GAAQ,EACpC9E,EAAMA,EAAKnE,KAAKkK,KAAKpD,EAAKoC,IAAQ,EAClC1G,EAAMA,EAAKxC,KAAKkK,KAAKxD,EAAK0C,IAAQ,EAClChD,EAAOA,EAAMpG,KAAKkK,KAAKxD,EAAK2C,IAAQ,EACpCjD,EAAOA,EAAMpG,KAAKkK,KAAKvD,EAAKyC,IAAQ,EACpCjF,EAAMA,EAAKnE,KAAKkK,KAAKvD,EAAK0C,IAAQ,EAClC7G,EAAMA,EAAKxC,KAAKkK,KAAK3D,EAAKgD,IAAQ,EAClCnD,EAAOA,EAAMpG,KAAKkK,KAAK3D,EAAKiD,IAAQ,EACpCpD,EAAOA,EAAMpG,KAAKkK,KAAK1D,EAAK+C,IAAQ,EACpCpF,EAAMA,EAAKnE,KAAKkK,KAAK1D,EAAKgD,IAAQ,EAClC,IAAIiB,IAAQvK,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EACrDlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAKxC,KAAKkK,KAAKtC,EAAKS,GACpBjC,EAAMpG,KAAKkK,KAAKtC,EAAKU,GACrBlC,EAAOA,EAAMpG,KAAKkK,KAAKrC,EAAKQ,GAAQ,EACpClE,EAAKnE,KAAKkK,KAAKrC,EAAKS,GACpB9F,EAAMA,EAAKxC,KAAKkK,KAAKzC,EAAKe,GAAQ,EAClCpC,EAAOA,EAAMpG,KAAKkK,KAAKzC,EAAKgB,GAAQ,EACpCrC,EAAOA,EAAMpG,KAAKkK,KAAKxC,EAAKc,GAAQ,EACpCrE,EAAMA,EAAKnE,KAAKkK,KAAKxC,EAAKe,GAAQ,EAClCjG,EAAMA,EAAKxC,KAAKkK,KAAK5C,EAAKqB,GAAQ,EAClCvC,EAAOA,EAAMpG,KAAKkK,KAAK5C,EAAKsB,GAAQ,EACpCxC,EAAOA,EAAMpG,KAAKkK,KAAK3C,EAAKoB,GAAQ,EACpCxE,EAAMA,EAAKnE,KAAKkK,KAAK3C,EAAKqB,GAAQ,EAClCpG,EAAMA,EAAKxC,KAAKkK,KAAK/C,EAAK2B,GAAQ,EAClC1C,EAAOA,EAAMpG,KAAKkK,KAAK/C,EAAK4B,GAAQ,EACpC3C,EAAOA,EAAMpG,KAAKkK,KAAK9C,EAAK0B,GAAQ,EACpC3E,EAAMA,EAAKnE,KAAKkK,KAAK9C,EAAK2B,GAAQ,EAClCvG,EAAMA,EAAKxC,KAAKkK,KAAKlD,EAAKiC,GAAQ,EAClC7C,EAAOA,EAAMpG,KAAKkK,KAAKlD,EAAKkC,IAAQ,EACpC9C,EAAOA,EAAMpG,KAAKkK,KAAKjD,EAAKgC,GAAQ,EACpC9E,EAAMA,EAAKnE,KAAKkK,KAAKjD,EAAKiC,IAAQ,EAClC1G,EAAMA,EAAKxC,KAAKkK,KAAKrD,EAAKuC,IAAQ,EAClChD,EAAOA,EAAMpG,KAAKkK,KAAKrD,EAAKwC,IAAQ,EACpCjD,EAAOA,EAAMpG,KAAKkK,KAAKpD,EAAKsC,IAAQ,EACpCjF,EAAMA,EAAKnE,KAAKkK,KAAKpD,EAAKuC,IAAQ,EAClC7G,EAAMA,EAAKxC,KAAKkK,KAAKxD,EAAK6C,IAAQ,EAClCnD,EAAOA,EAAMpG,KAAKkK,KAAKxD,EAAK8C,IAAQ,EACpCpD,EAAOA,EAAMpG,KAAKkK,KAAKvD,EAAK4C,IAAQ,EACpCpF,EAAMA,EAAKnE,KAAKkK,KAAKvD,EAAK6C,IAAQ,EAClChH,EAAMA,EAAKxC,KAAKkK,KAAK3D,EAAKmD,IAAQ,EAClCtD,EAAOA,EAAMpG,KAAKkK,KAAK3D,EAAKoD,IAAQ,EACpCvD,EAAOA,EAAMpG,KAAKkK,KAAK1D,EAAKkD,IAAQ,EACpCvF,EAAMA,EAAKnE,KAAKkK,KAAK1D,EAAKmD,IAAQ,EAClC,IAAIe,IAAQxK,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EACrDlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAKxC,KAAKkK,KAAKnC,EAAKM,GACpBjC,EAAMpG,KAAKkK,KAAKnC,EAAKO,GACrBlC,EAAOA,EAAMpG,KAAKkK,KAAKlC,EAAKK,GAAQ,EACpClE,EAAKnE,KAAKkK,KAAKlC,EAAKM,GACpB9F,EAAMA,EAAKxC,KAAKkK,KAAKtC,EAAKY,GAAQ,EAClCpC,EAAOA,EAAMpG,KAAKkK,KAAKtC,EAAKa,GAAQ,EACpCrC,EAAOA,EAAMpG,KAAKkK,KAAKrC,EAAKW,GAAQ,EACpCrE,EAAMA,EAAKnE,KAAKkK,KAAKrC,EAAKY,GAAQ,EAClCjG,EAAMA,EAAKxC,KAAKkK,KAAKzC,EAAKkB,GAAQ,EAClCvC,EAAOA,EAAMpG,KAAKkK,KAAKzC,EAAKmB,GAAQ,EACpCxC,EAAOA,EAAMpG,KAAKkK,KAAKxC,EAAKiB,GAAQ,EACpCxE,EAAMA,EAAKnE,KAAKkK,KAAKxC,EAAKkB,GAAQ,EAClCpG,EAAMA,EAAKxC,KAAKkK,KAAK5C,EAAKwB,GAAQ,EAClC1C,EAAOA,EAAMpG,KAAKkK,KAAK5C,EAAKyB,GAAQ,EACpC3C,EAAOA,EAAMpG,KAAKkK,KAAK3C,EAAKuB,GAAQ,EACpC3E,EAAMA,EAAKnE,KAAKkK,KAAK3C,EAAKwB,GAAQ,EAClCvG,EAAMA,EAAKxC,KAAKkK,KAAK/C,EAAK8B,GAAQ,EAClC7C,EAAOA,EAAMpG,KAAKkK,KAAK/C,EAAK+B,IAAQ,EACpC9C,EAAOA,EAAMpG,KAAKkK,KAAK9C,EAAK6B,GAAQ,EACpC9E,EAAMA,EAAKnE,KAAKkK,KAAK9C,EAAK8B,IAAQ,EAClC1G,EAAMA,EAAKxC,KAAKkK,KAAKlD,EAAKoC,IAAQ,EAClChD,EAAOA,EAAMpG,KAAKkK,KAAKlD,EAAKqC,IAAQ,EACpCjD,EAAOA,EAAMpG,KAAKkK,KAAKjD,EAAKmC,IAAQ,EACpCjF,EAAMA,EAAKnE,KAAKkK,KAAKjD,EAAKoC,IAAQ,EAClC7G,EAAMA,EAAKxC,KAAKkK,KAAKrD,EAAK0C,IAAQ,EAClCnD,EAAOA,EAAMpG,KAAKkK,KAAKrD,EAAK2C,IAAQ,EACpCpD,EAAOA,EAAMpG,KAAKkK,KAAKpD,EAAKyC,IAAQ,EACpCpF,EAAMA,EAAKnE,KAAKkK,KAAKpD,EAAK0C,IAAQ,EAClChH,EAAMA,EAAKxC,KAAKkK,KAAKxD,EAAKgD,IAAQ,EAClCtD,EAAOA,EAAMpG,KAAKkK,KAAKxD,EAAKiD,IAAQ,EACpCvD,EAAOA,EAAMpG,KAAKkK,KAAKvD,EAAK+C,IAAQ,EACpCvF,EAAMA,EAAKnE,KAAKkK,KAAKvD,EAAKgD,IAAQ,EAClCnH,EAAMA,EAAKxC,KAAKkK,KAAK3D,EAAKsD,IAAQ,EAClCzD,EAAOA,EAAMpG,KAAKkK,KAAK3D,EAAKuD,IAAQ,EACpC1D,EAAOA,EAAMpG,KAAKkK,KAAK1D,EAAKqD,IAAQ,EACpC1F,EAAMA,EAAKnE,KAAKkK,KAAK1D,EAAKsD,IAAQ,EAClC,IAAIa,IAAQzK,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EACrDlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAKxC,KAAKkK,KAAKhC,EAAKG,GACpBjC,EAAMpG,KAAKkK,KAAKhC,EAAKI,GACrBlC,EAAOA,EAAMpG,KAAKkK,KAAK/B,EAAKE,GAAQ,EACpClE,EAAKnE,KAAKkK,KAAK/B,EAAKG,GACpB9F,EAAMA,EAAKxC,KAAKkK,KAAKnC,EAAKS,GAAQ,EAClCpC,EAAOA,EAAMpG,KAAKkK,KAAKnC,EAAKU,GAAQ,EACpCrC,EAAOA,EAAMpG,KAAKkK,KAAKlC,EAAKQ,GAAQ,EACpCrE,EAAMA,EAAKnE,KAAKkK,KAAKlC,EAAKS,GAAQ,EAClCjG,EAAMA,EAAKxC,KAAKkK,KAAKtC,EAAKe,GAAQ,EAClCvC,EAAOA,EAAMpG,KAAKkK,KAAKtC,EAAKgB,GAAQ,EACpCxC,EAAOA,EAAMpG,KAAKkK,KAAKrC,EAAKc,GAAQ,EACpCxE,EAAMA,EAAKnE,KAAKkK,KAAKrC,EAAKe,GAAQ,EAClCpG,EAAMA,EAAKxC,KAAKkK,KAAKzC,EAAKqB,GAAQ,EAClC1C,EAAOA,EAAMpG,KAAKkK,KAAKzC,EAAKsB,GAAQ,EACpC3C,EAAOA,EAAMpG,KAAKkK,KAAKxC,EAAKoB,GAAQ,EACpC3E,EAAMA,EAAKnE,KAAKkK,KAAKxC,EAAKqB,GAAQ,EAClCvG,EAAMA,EAAKxC,KAAKkK,KAAK5C,EAAK2B,GAAQ,EAClC7C,EAAOA,EAAMpG,KAAKkK,KAAK5C,EAAK4B,IAAQ,EACpC9C,EAAOA,EAAMpG,KAAKkK,KAAK3C,EAAK0B,GAAQ,EACpC9E,EAAMA,EAAKnE,KAAKkK,KAAK3C,EAAK2B,IAAQ,EAClC1G,EAAMA,EAAKxC,KAAKkK,KAAK/C,EAAKiC,IAAQ,EAClChD,EAAOA,EAAMpG,KAAKkK,KAAK/C,EAAKkC,IAAQ,EACpCjD,EAAOA,EAAMpG,KAAKkK,KAAK9C,EAAKgC,IAAQ,EACpCjF,EAAMA,EAAKnE,KAAKkK,KAAK9C,EAAKiC,IAAQ,EAClC7G,EAAMA,EAAKxC,KAAKkK,KAAKlD,EAAKuC,IAAQ,EAClCnD,EAAOA,EAAMpG,KAAKkK,KAAKlD,EAAKwC,IAAQ,EACpCpD,EAAOA,EAAMpG,KAAKkK,KAAKjD,EAAKsC,IAAQ,EACpCpF,EAAMA,EAAKnE,KAAKkK,KAAKjD,EAAKuC,IAAQ,EAClChH,EAAMA,EAAKxC,KAAKkK,KAAKrD,EAAK6C,IAAQ,EAClCtD,EAAOA,EAAMpG,KAAKkK,KAAKrD,EAAK8C,IAAQ,EACpCvD,EAAOA,EAAMpG,KAAKkK,KAAKpD,EAAK4C,IAAQ,EACpCvF,EAAMA,EAAKnE,KAAKkK,KAAKpD,EAAK6C,IAAQ,EAClCnH,EAAMA,EAAKxC,KAAKkK,KAAKxD,EAAKmD,IAAQ,EAClCzD,EAAOA,EAAMpG,KAAKkK,KAAKxD,EAAKoD,IAAQ,EACpC1D,EAAOA,EAAMpG,KAAKkK,KAAKvD,EAAKkD,IAAQ,EACpC1F,EAAMA,EAAKnE,KAAKkK,KAAKvD,EAAKmD,IAAQ,EAClCtH,EAAMA,EAAKxC,KAAKkK,KAAK3D,EAAKyD,IAAQ,EAClC5D,EAAOA,EAAMpG,KAAKkK,KAAK3D,EAAK0D,IAAQ,EACpC7D,EAAOA,EAAMpG,KAAKkK,KAAK1D,EAAKwD,IAAQ,EACpC7F,EAAMA,EAAKnE,KAAKkK,KAAK1D,EAAKyD,IAAQ,EAClC,IAAIW,IAAQ1K,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EACrDlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENpI,EAAKxC,KAAKkK,KAAKhC,EAAKM,GACpBpC,EAAMpG,KAAKkK,KAAKhC,EAAKO,GACrBrC,EAAOA,EAAMpG,KAAKkK,KAAK/B,EAAKK,GAAQ,EACpCrE,EAAKnE,KAAKkK,KAAK/B,EAAKM,GACpBjG,EAAMA,EAAKxC,KAAKkK,KAAKnC,EAAKY,GAAQ,EAClCvC,EAAOA,EAAMpG,KAAKkK,KAAKnC,EAAKa,GAAQ,EACpCxC,EAAOA,EAAMpG,KAAKkK,KAAKlC,EAAKW,GAAQ,EACpCxE,EAAMA,EAAKnE,KAAKkK,KAAKlC,EAAKY,GAAQ,EAClCpG,EAAMA,EAAKxC,KAAKkK,KAAKtC,EAAKkB,GAAQ,EAClC1C,EAAOA,EAAMpG,KAAKkK,KAAKtC,EAAKmB,GAAQ,EACpC3C,EAAOA,EAAMpG,KAAKkK,KAAKrC,EAAKiB,GAAQ,EACpC3E,EAAMA,EAAKnE,KAAKkK,KAAKrC,EAAKkB,GAAQ,EAClCvG,EAAMA,EAAKxC,KAAKkK,KAAKzC,EAAKwB,GAAQ,EAClC7C,EAAOA,EAAMpG,KAAKkK,KAAKzC,EAAKyB,IAAQ,EACpC9C,EAAOA,EAAMpG,KAAKkK,KAAKxC,EAAKuB,GAAQ,EACpC9E,EAAMA,EAAKnE,KAAKkK,KAAKxC,EAAKwB,IAAQ,EAClC1G,EAAMA,EAAKxC,KAAKkK,KAAK5C,EAAK8B,IAAQ,EAClChD,EAAOA,EAAMpG,KAAKkK,KAAK5C,EAAK+B,IAAQ,EACpCjD,EAAOA,EAAMpG,KAAKkK,KAAK3C,EAAK6B,IAAQ,EACpCjF,EAAMA,EAAKnE,KAAKkK,KAAK3C,EAAK8B,IAAQ,EAClC7G,EAAMA,EAAKxC,KAAKkK,KAAK/C,EAAKoC,IAAQ,EAClCnD,EAAOA,EAAMpG,KAAKkK,KAAK/C,EAAKqC,IAAQ,EACpCpD,EAAOA,EAAMpG,KAAKkK,KAAK9C,EAAKmC,IAAQ,EACpCpF,EAAMA,EAAKnE,KAAKkK,KAAK9C,EAAKoC,IAAQ,EAClChH,EAAMA,EAAKxC,KAAKkK,KAAKlD,EAAK0C,IAAQ,EAClCtD,EAAOA,EAAMpG,KAAKkK,KAAKlD,EAAK2C,IAAQ,EACpCvD,EAAOA,EAAMpG,KAAKkK,KAAKjD,EAAKyC,IAAQ,EACpCvF,EAAMA,EAAKnE,KAAKkK,KAAKjD,EAAK0C,IAAQ,EAClCnH,EAAMA,EAAKxC,KAAKkK,KAAKrD,EAAKgD,IAAQ,EAClCzD,EAAOA,EAAMpG,KAAKkK,KAAKrD,EAAKiD,IAAQ,EACpC1D,EAAOA,EAAMpG,KAAKkK,KAAKpD,EAAK+C,IAAQ,EACpC1F,EAAMA,EAAKnE,KAAKkK,KAAKpD,EAAKgD,IAAQ,EAClCtH,EAAMA,EAAKxC,KAAKkK,KAAKxD,EAAKsD,IAAQ,EAClC5D,EAAOA,EAAMpG,KAAKkK,KAAKxD,EAAKuD,IAAQ,EACpC7D,EAAOA,EAAMpG,KAAKkK,KAAKvD,EAAKqD,IAAQ,EACpC7F,EAAMA,EAAKnE,KAAKkK,KAAKvD,EAAKsD,IAAQ,EAClC,IAAIY,IAAS3K,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EACtDlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEPrI,EAAKxC,KAAKkK,KAAKhC,EAAKS,GACpBvC,EAAMpG,KAAKkK,KAAKhC,EAAKU,GACrBxC,EAAOA,EAAMpG,KAAKkK,KAAK/B,EAAKQ,GAAQ,EACpCxE,EAAKnE,KAAKkK,KAAK/B,EAAKS,GACpBpG,EAAMA,EAAKxC,KAAKkK,KAAKnC,EAAKe,GAAQ,EAClC1C,EAAOA,EAAMpG,KAAKkK,KAAKnC,EAAKgB,GAAQ,EACpC3C,EAAOA,EAAMpG,KAAKkK,KAAKlC,EAAKc,GAAQ,EACpC3E,EAAMA,EAAKnE,KAAKkK,KAAKlC,EAAKe,GAAQ,EAClCvG,EAAMA,EAAKxC,KAAKkK,KAAKtC,EAAKqB,GAAQ,EAClC7C,EAAOA,EAAMpG,KAAKkK,KAAKtC,EAAKsB,IAAQ,EACpC9C,EAAOA,EAAMpG,KAAKkK,KAAKrC,EAAKoB,GAAQ,EACpC9E,EAAMA,EAAKnE,KAAKkK,KAAKrC,EAAKqB,IAAQ,EAClC1G,EAAMA,EAAKxC,KAAKkK,KAAKzC,EAAK2B,IAAQ,EAClChD,EAAOA,EAAMpG,KAAKkK,KAAKzC,EAAK4B,IAAQ,EACpCjD,EAAOA,EAAMpG,KAAKkK,KAAKxC,EAAK0B,IAAQ,EACpCjF,EAAMA,EAAKnE,KAAKkK,KAAKxC,EAAK2B,IAAQ,EAClC7G,EAAMA,EAAKxC,KAAKkK,KAAK5C,EAAKiC,IAAQ,EAClCnD,EAAOA,EAAMpG,KAAKkK,KAAK5C,EAAKkC,IAAQ,EACpCpD,EAAOA,EAAMpG,KAAKkK,KAAK3C,EAAKgC,IAAQ,EACpCpF,EAAMA,EAAKnE,KAAKkK,KAAK3C,EAAKiC,IAAQ,EAClChH,EAAMA,EAAKxC,KAAKkK,KAAK/C,EAAKuC,IAAQ,EAClCtD,EAAOA,EAAMpG,KAAKkK,KAAK/C,EAAKwC,IAAQ,EACpCvD,EAAOA,EAAMpG,KAAKkK,KAAK9C,EAAKsC,IAAQ,EACpCvF,EAAMA,EAAKnE,KAAKkK,KAAK9C,EAAKuC,IAAQ,EAClCnH,EAAMA,EAAKxC,KAAKkK,KAAKlD,EAAK6C,IAAQ,EAClCzD,EAAOA,EAAMpG,KAAKkK,KAAKlD,EAAK8C,IAAQ,EACpC1D,EAAOA,EAAMpG,KAAKkK,KAAKjD,EAAK4C,IAAQ,EACpC1F,EAAMA,EAAKnE,KAAKkK,KAAKjD,EAAK6C,IAAQ,EAClCtH,EAAMA,EAAKxC,KAAKkK,KAAKrD,EAAKmD,IAAQ,EAClC5D,EAAOA,EAAMpG,KAAKkK,KAAKrD,EAAKoD,IAAQ,EACpC7D,EAAOA,EAAMpG,KAAKkK,KAAKpD,EAAKkD,IAAQ,EACpC7F,EAAMA,EAAKnE,KAAKkK,KAAKpD,EAAKmD,IAAQ,EAClC,IAAIa,IAAS5K,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EACtDlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEPtI,EAAKxC,KAAKkK,KAAKhC,EAAKY,GACpB1C,EAAMpG,KAAKkK,KAAKhC,EAAKa,GACrB3C,EAAOA,EAAMpG,KAAKkK,KAAK/B,EAAKW,GAAQ,EACpC3E,EAAKnE,KAAKkK,KAAK/B,EAAKY,GACpBvG,EAAMA,EAAKxC,KAAKkK,KAAKnC,EAAKkB,GAAQ,EAClC7C,EAAOA,EAAMpG,KAAKkK,KAAKnC,EAAKmB,IAAQ,EACpC9C,EAAOA,EAAMpG,KAAKkK,KAAKlC,EAAKiB,GAAQ,EACpC9E,EAAMA,EAAKnE,KAAKkK,KAAKlC,EAAKkB,IAAQ,EAClC1G,EAAMA,EAAKxC,KAAKkK,KAAKtC,EAAKwB,IAAQ,EAClChD,EAAOA,EAAMpG,KAAKkK,KAAKtC,EAAKyB,IAAQ,EACpCjD,EAAOA,EAAMpG,KAAKkK,KAAKrC,EAAKuB,IAAQ,EACpCjF,EAAMA,EAAKnE,KAAKkK,KAAKrC,EAAKwB,IAAQ,EAClC7G,EAAMA,EAAKxC,KAAKkK,KAAKzC,EAAK8B,IAAQ,EAClCnD,EAAOA,EAAMpG,KAAKkK,KAAKzC,EAAK+B,IAAQ,EACpCpD,EAAOA,EAAMpG,KAAKkK,KAAKxC,EAAK6B,IAAQ,EACpCpF,EAAMA,EAAKnE,KAAKkK,KAAKxC,EAAK8B,IAAQ,EAClChH,EAAMA,EAAKxC,KAAKkK,KAAK5C,EAAKoC,IAAQ,EAClCtD,EAAOA,EAAMpG,KAAKkK,KAAK5C,EAAKqC,IAAQ,EACpCvD,EAAOA,EAAMpG,KAAKkK,KAAK3C,EAAKmC,IAAQ,EACpCvF,EAAMA,EAAKnE,KAAKkK,KAAK3C,EAAKoC,IAAQ,EAClCnH,EAAMA,EAAKxC,KAAKkK,KAAK/C,EAAK0C,IAAQ,EAClCzD,EAAOA,EAAMpG,KAAKkK,KAAK/C,EAAK2C,IAAQ,EACpC1D,EAAOA,EAAMpG,KAAKkK,KAAK9C,EAAKyC,IAAQ,EACpC1F,EAAMA,EAAKnE,KAAKkK,KAAK9C,EAAK0C,IAAQ,EAClCtH,EAAMA,EAAKxC,KAAKkK,KAAKlD,EAAKgD,IAAQ,EAClC5D,EAAOA,EAAMpG,KAAKkK,KAAKlD,EAAKiD,IAAQ,EACpC7D,EAAOA,EAAMpG,KAAKkK,KAAKjD,EAAK+C,IAAQ,EACpC7F,EAAMA,EAAKnE,KAAKkK,KAAKjD,EAAKgD,IAAQ,EAClC,IAAIc,IAAS7K,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EACtDlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEPvI,EAAKxC,KAAKkK,KAAKhC,EAAKe,GACpB7C,EAAMpG,KAAKkK,KAAKhC,EAAKgB,IACrB9C,EAAOA,EAAMpG,KAAKkK,KAAK/B,EAAKc,GAAQ,EACpC9E,EAAKnE,KAAKkK,KAAK/B,EAAKe,IACpB1G,EAAMA,EAAKxC,KAAKkK,KAAKnC,EAAKqB,IAAQ,EAClChD,EAAOA,EAAMpG,KAAKkK,KAAKnC,EAAKsB,IAAQ,EACpCjD,EAAOA,EAAMpG,KAAKkK,KAAKlC,EAAKoB,IAAQ,EACpCjF,EAAMA,EAAKnE,KAAKkK,KAAKlC,EAAKqB,IAAQ,EAClC7G,EAAMA,EAAKxC,KAAKkK,KAAKtC,EAAK2B,IAAQ,EAClCnD,EAAOA,EAAMpG,KAAKkK,KAAKtC,EAAK4B,IAAQ,EACpCpD,EAAOA,EAAMpG,KAAKkK,KAAKrC,EAAK0B,IAAQ,EACpCpF,EAAMA,EAAKnE,KAAKkK,KAAKrC,EAAK2B,IAAQ,EAClChH,EAAMA,EAAKxC,KAAKkK,KAAKzC,EAAKiC,IAAQ,EAClCtD,EAAOA,EAAMpG,KAAKkK,KAAKzC,EAAKkC,IAAQ,EACpCvD,EAAOA,EAAMpG,KAAKkK,KAAKxC,EAAKgC,IAAQ,EACpCvF,EAAMA,EAAKnE,KAAKkK,KAAKxC,EAAKiC,IAAQ,EAClCnH,EAAMA,EAAKxC,KAAKkK,KAAK5C,EAAKuC,IAAQ,EAClCzD,EAAOA,EAAMpG,KAAKkK,KAAK5C,EAAKwC,IAAQ,EACpC1D,EAAOA,EAAMpG,KAAKkK,KAAK3C,EAAKsC,IAAQ,EACpC1F,EAAMA,EAAKnE,KAAKkK,KAAK3C,EAAKuC,IAAQ,EAClCtH,EAAMA,EAAKxC,KAAKkK,KAAK/C,EAAK6C,IAAQ,EAClC5D,EAAOA,EAAMpG,KAAKkK,KAAK/C,EAAK8C,IAAQ,EACpC7D,EAAOA,EAAMpG,KAAKkK,KAAK9C,EAAK4C,IAAQ,EACpC7F,EAAMA,EAAKnE,KAAKkK,KAAK9C,EAAK6C,IAAQ,EAClC,IAAIe,IAAS9K,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EACtDlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEPxI,EAAKxC,KAAKkK,KAAKhC,EAAKkB,IACpBhD,EAAMpG,KAAKkK,KAAKhC,EAAKmB,IACrBjD,EAAOA,EAAMpG,KAAKkK,KAAK/B,EAAKiB,IAAQ,EACpCjF,EAAKnE,KAAKkK,KAAK/B,EAAKkB,IACpB7G,EAAMA,EAAKxC,KAAKkK,KAAKnC,EAAKwB,IAAQ,EAClCnD,EAAOA,EAAMpG,KAAKkK,KAAKnC,EAAKyB,IAAQ,EACpCpD,EAAOA,EAAMpG,KAAKkK,KAAKlC,EAAKuB,IAAQ,EACpCpF,EAAMA,EAAKnE,KAAKkK,KAAKlC,EAAKwB,IAAQ,EAClChH,EAAMA,EAAKxC,KAAKkK,KAAKtC,EAAK8B,IAAQ,EAClCtD,EAAOA,EAAMpG,KAAKkK,KAAKtC,EAAK+B,IAAQ,EACpCvD,EAAOA,EAAMpG,KAAKkK,KAAKrC,EAAK6B,IAAQ,EACpCvF,EAAMA,EAAKnE,KAAKkK,KAAKrC,EAAK8B,IAAQ,EAClCnH,EAAMA,EAAKxC,KAAKkK,KAAKzC,EAAKoC,IAAQ,EAClCzD,EAAOA,EAAMpG,KAAKkK,KAAKzC,EAAKqC,IAAQ,EACpC1D,EAAOA,EAAMpG,KAAKkK,KAAKxC,EAAKmC,IAAQ,EACpC1F,EAAMA,EAAKnE,KAAKkK,KAAKxC,EAAKoC,IAAQ,EAClCtH,EAAMA,EAAKxC,KAAKkK,KAAK5C,EAAK0C,IAAQ,EAClC5D,EAAOA,EAAMpG,KAAKkK,KAAK5C,EAAK2C,IAAQ,EACpC7D,EAAOA,EAAMpG,KAAKkK,KAAK3C,EAAKyC,IAAQ,EACpC7F,EAAMA,EAAKnE,KAAKkK,KAAK3C,EAAK0C,IAAQ,EAClC,IAAIgB,IAAS/K,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EACtDlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEPzI,EAAKxC,KAAKkK,KAAKhC,EAAKqB,IACpBnD,EAAMpG,KAAKkK,KAAKhC,EAAKsB,IACrBpD,EAAOA,EAAMpG,KAAKkK,KAAK/B,EAAKoB,IAAQ,EACpCpF,EAAKnE,KAAKkK,KAAK/B,EAAKqB,IACpBhH,EAAMA,EAAKxC,KAAKkK,KAAKnC,EAAK2B,IAAQ,EAClCtD,EAAOA,EAAMpG,KAAKkK,KAAKnC,EAAK4B,IAAQ,EACpCvD,EAAOA,EAAMpG,KAAKkK,KAAKlC,EAAK0B,IAAQ,EACpCvF,EAAMA,EAAKnE,KAAKkK,KAAKlC,EAAK2B,IAAQ,EAClCnH,EAAMA,EAAKxC,KAAKkK,KAAKtC,EAAKiC,IAAQ,EAClCzD,EAAOA,EAAMpG,KAAKkK,KAAKtC,EAAKkC,IAAQ,EACpC1D,EAAOA,EAAMpG,KAAKkK,KAAKrC,EAAKgC,IAAQ,EACpC1F,EAAMA,EAAKnE,KAAKkK,KAAKrC,EAAKiC,IAAQ,EAClCtH,EAAMA,EAAKxC,KAAKkK,KAAKzC,EAAKuC,IAAQ,EAClC5D,EAAOA,EAAMpG,KAAKkK,KAAKzC,EAAKwC,IAAQ,EACpC7D,EAAOA,EAAMpG,KAAKkK,KAAKxC,EAAKsC,IAAQ,EACpC7F,EAAMA,EAAKnE,KAAKkK,KAAKxC,EAAKuC,IAAQ,EAClC,IAAIiB,IAAShL,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EACtDlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAKxC,KAAKkK,KAAKhC,EAAKwB,IACpBtD,EAAMpG,KAAKkK,KAAKhC,EAAKyB,IACrBvD,EAAOA,EAAMpG,KAAKkK,KAAK/B,EAAKuB,IAAQ,EACpCvF,EAAKnE,KAAKkK,KAAK/B,EAAKwB,IACpBnH,EAAMA,EAAKxC,KAAKkK,KAAKnC,EAAK8B,IAAQ,EAClCzD,EAAOA,EAAMpG,KAAKkK,KAAKnC,EAAK+B,IAAQ,EACpC1D,EAAOA,EAAMpG,KAAKkK,KAAKlC,EAAK6B,IAAQ,EACpC1F,EAAMA,EAAKnE,KAAKkK,KAAKlC,EAAK8B,IAAQ,EAClCtH,EAAMA,EAAKxC,KAAKkK,KAAKtC,EAAKoC,IAAQ,EAClC5D,EAAOA,EAAMpG,KAAKkK,KAAKtC,EAAKqC,IAAQ,EACpC7D,EAAOA,EAAMpG,KAAKkK,KAAKrC,EAAKmC,IAAQ,EACpC7F,EAAMA,EAAKnE,KAAKkK,KAAKrC,EAAKoC,IAAQ,EAClC,IAAIkB,IAASjL,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EACtDlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEP3I,EAAKxC,KAAKkK,KAAKhC,EAAK2B,IACpBzD,EAAMpG,KAAKkK,KAAKhC,EAAK4B,IACrB1D,EAAOA,EAAMpG,KAAKkK,KAAK/B,EAAK0B,IAAQ,EACpC1F,EAAKnE,KAAKkK,KAAK/B,EAAK2B,IACpBtH,EAAMA,EAAKxC,KAAKkK,KAAKnC,EAAKiC,IAAQ,EAClC5D,EAAOA,EAAMpG,KAAKkK,KAAKnC,EAAKkC,IAAQ,EACpC7D,EAAOA,EAAMpG,KAAKkK,KAAKlC,EAAKgC,IAAQ,EACpC7F,EAAMA,EAAKnE,KAAKkK,KAAKlC,EAAKiC,IAAQ,EAClC,IAAImB,IAASlL,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EACtDlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAEP5I,EAAKxC,KAAKkK,KAAKhC,EAAK8B,IACpB5D,EAAMpG,KAAKkK,KAAKhC,EAAK+B,IACrB7D,EAAOA,EAAMpG,KAAKkK,KAAK/B,EAAK6B,IAAQ,EACpC7F,EAAKnE,KAAKkK,KAAK/B,EAAK8B,IACpB,IAAIoB,IAASnL,EAAIsC,EAAM,KAAa,KAAN4D,IAAiB,IAAO,EA0BtD,OAzBAlG,GAAOiE,GAAMiC,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK8D,GACP9D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAANnL,IACFmG,EAAE,IAAMnG,EACR/I,EAAIjD,UAECiD,GAQT,SAASmU,EAAUjJ,EAAMtP,EAAKoE,GAC5BA,EAAIsI,SAAW1M,EAAI0M,SAAW4C,EAAK5C,SACnCtI,EAAIjD,OAASmO,EAAKnO,OAASnB,EAAImB,OAI/B,IAFA,IAAIuO,EAAQ,EACR8I,EAAU,EACL7I,EAAI,EAAGA,EAAIvL,EAAIjD,OAAS,EAAGwO,IAAK,CAGvC,IAAIC,EAAS4I,EACbA,EAAU,EAGV,IAFA,IAAI3I,EAAgB,SAARH,EACRI,EAAO7C,KAAKC,IAAIyC,EAAG3P,EAAImB,OAAS,GAC3BM,EAAIwL,KAAKK,IAAI,EAAGqC,EAAIL,EAAKnO,OAAS,GAAIM,GAAKqO,EAAMrO,IAAK,CAC7D,IAAID,EAAImO,EAAIlO,EACR8N,EAAoB,EAAhBD,EAAK3C,MAAMnL,GACfgO,EAAmB,EAAfxP,EAAI2M,MAAMlL,GACdsL,EAAIwC,EAAIC,EAERC,EAAS,SAAJ1C,EACT6C,EAAUA,GAAW7C,EAAI,SAAa,GAAM,EAC5C0C,EAAMA,EAAKI,EAAS,EACpBA,EAAa,SAALJ,EACRG,EAAUA,GAAUH,IAAO,IAAO,EAElC+I,GAAW5I,IAAW,GACtBA,GAAU,SAEZxL,EAAIuI,MAAMgD,GAAKE,EACfH,EAAQE,EACRA,EAAS4I,EAQX,OANc,IAAV9I,EACFtL,EAAIuI,MAAMgD,GAAKD,EAEftL,EAAIjD,SAGCiD,EAAI0J,QAGb,SAAS2K,EAAYnJ,EAAMtP,EAAKoE,GAC9B,IAAIsU,EAAO,IAAIC,EACf,OAAOD,EAAKE,KAAKtJ,EAAMtP,EAAKoE,GAsB9B,SAASuU,EAAME,EAAGC,GAChBxZ,KAAKuZ,EAAIA,EACTvZ,KAAKwZ,EAAIA,EAvEN7L,KAAKkK,OACR/D,EAAc/D,GAiDhB/C,EAAG3L,UAAUoY,MAAQ,SAAgB/Y,EAAKoE,GACxC,IAAI7F,EACAyO,EAAM1N,KAAK6B,OAASnB,EAAImB,OAW5B,OATE5C,EADkB,KAAhBe,KAAK6B,QAAgC,KAAfnB,EAAImB,OACtBiS,EAAY9T,KAAMU,EAAKoE,GACpB4I,EAAM,GACTqC,EAAW/P,KAAMU,EAAKoE,GACnB4I,EAAM,KACTuL,EAASjZ,KAAMU,EAAKoE,GAEpBqU,EAAWnZ,KAAMU,EAAKoE,GAGvB7F,GAWToa,EAAKhY,UAAUqY,QAAU,SAAkBC,GAGzC,IAFA,IAAI/H,EAAI,IAAI1O,MAAMyW,GACdC,EAAI5M,EAAG3L,UAAUsQ,WAAWgI,GAAK,EAC5BzX,EAAI,EAAGA,EAAIyX,EAAGzX,IACrB0P,EAAE1P,GAAKlC,KAAK6Z,OAAO3X,EAAG0X,EAAGD,GAG3B,OAAO/H,GAITyH,EAAKhY,UAAUwY,OAAS,SAAiBN,EAAGK,EAAGD,GAC7C,GAAU,IAANJ,GAAWA,IAAMI,EAAI,EAAG,OAAOJ,EAGnC,IADA,IAAIO,EAAK,EACA5X,EAAI,EAAGA,EAAI0X,EAAG1X,IACrB4X,IAAW,EAAJP,IAAWK,EAAI1X,EAAI,EAC1BqX,IAAM,EAGR,OAAOO,GAKTT,EAAKhY,UAAU0Y,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAIzX,EAAI,EAAGA,EAAIyX,EAAGzX,IACrBiY,EAAKjY,GAAK+X,EAAID,EAAI9X,IAClBkY,EAAKlY,GAAKgY,EAAIF,EAAI9X,KAItBmX,EAAKhY,UAAUgZ,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtEha,KAAK+Z,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQ5M,KAAK6M,IAAI,EAAI7M,KAAK8M,GAAKb,GAC/Bc,EAAQ/M,KAAKgN,IAAI,EAAIhN,KAAK8M,GAAKb,GAE1BnO,EAAI,EAAGA,EAAIkO,EAAGlO,GAAKmO,EAI1B,IAHA,IAAIgB,EAASL,EACTM,EAASH,EAEJvY,EAAI,EAAGA,EAAImY,EAAGnY,IAAK,CAC1B,IAAIoK,EAAK4N,EAAK1O,EAAItJ,GACd2Y,EAAKV,EAAK3O,EAAItJ,GAEd4Y,EAAKZ,EAAK1O,EAAItJ,EAAImY,GAClBU,EAAKZ,EAAK3O,EAAItJ,EAAImY,GAElBW,EAAKL,EAASG,EAAKF,EAASG,EAEhCA,EAAKJ,EAASI,EAAKH,EAASE,EAC5BA,EAAKE,EAELd,EAAK1O,EAAItJ,GAAKoK,EAAKwO,EACnBX,EAAK3O,EAAItJ,GAAK2Y,EAAKE,EAEnBb,EAAK1O,EAAItJ,EAAImY,GAAK/N,EAAKwO,EACvBX,EAAK3O,EAAItJ,EAAImY,GAAKQ,EAAKE,EAGnB7Y,IAAMyX,IACRqB,EAAKV,EAAQK,EAASF,EAAQG,EAE9BA,EAASN,EAAQM,EAASH,EAAQE,EAClCA,EAASK,KAOnB5B,EAAKhY,UAAU6Z,YAAc,SAAsBC,EAAGC,GACpD,IAAIzB,EAAqB,EAAjBhM,KAAKK,IAAIoN,EAAGD,GAChBE,EAAU,EAAJ1B,EACNzX,EAAI,EACR,IAAKyX,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/BzX,IAGF,OAAO,GAAKA,EAAI,EAAImZ,GAGtBhC,EAAKhY,UAAUia,UAAY,SAAoBrB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAIzX,EAAI,EAAGA,EAAIyX,EAAI,EAAGzX,IAAK,CAC9B,IAAI0P,EAAIqI,EAAI/X,GAEZ+X,EAAI/X,GAAK+X,EAAIN,EAAIzX,EAAI,GACrB+X,EAAIN,EAAIzX,EAAI,GAAK0P,EAEjBA,EAAIsI,EAAIhY,GAERgY,EAAIhY,IAAMgY,EAAIP,EAAIzX,EAAI,GACtBgY,EAAIP,EAAIzX,EAAI,IAAM0P,IAItByH,EAAKhY,UAAUka,aAAe,SAAuBC,EAAI7B,GAEvD,IADA,IAAIvJ,EAAQ,EACHlO,EAAI,EAAGA,EAAIyX,EAAI,EAAGzX,IAAK,CAC9B,IAAIwM,EAAoC,KAAhCf,KAAK8N,MAAMD,EAAG,EAAItZ,EAAI,GAAKyX,GACjChM,KAAK8N,MAAMD,EAAG,EAAItZ,GAAKyX,GACvBvJ,EAEFoL,EAAGtZ,GAAS,SAAJwM,EAGN0B,EADE1B,EAAI,SACE,EAEAA,EAAI,SAAY,EAI5B,OAAO8M,GAGTnC,EAAKhY,UAAUqa,WAAa,SAAqBF,EAAI9N,EAAKuM,EAAKN,GAE7D,IADA,IAAIvJ,EAAQ,EACHlO,EAAI,EAAGA,EAAIwL,EAAKxL,IACvBkO,GAAyB,EAARoL,EAAGtZ,GAEpB+X,EAAI,EAAI/X,GAAa,KAARkO,EAAgBA,KAAkB,GAC/C6J,EAAI,EAAI/X,EAAI,GAAa,KAARkO,EAAgBA,KAAkB,GAIrD,IAAKlO,EAAI,EAAIwL,EAAKxL,EAAIyX,IAAKzX,EACzB+X,EAAI/X,GAAK,EAGXiF,EAAiB,IAAViJ,GACPjJ,EAA6B,MAAb,KAARiJ,KAGViJ,EAAKhY,UAAUsa,KAAO,SAAehC,GAEnC,IADA,IAAIiC,EAAK,IAAI1Y,MAAMyW,GACVzX,EAAI,EAAGA,EAAIyX,EAAGzX,IACrB0Z,EAAG1Z,GAAK,EAGV,OAAO0Z,GAGTvC,EAAKhY,UAAUiY,KAAO,SAAeC,EAAGC,EAAG1U,GACzC,IAAI6U,EAAI,EAAI3Z,KAAKkb,YAAY3B,EAAE1X,OAAQ2X,EAAE3X,QAErCmY,EAAMha,KAAK0Z,QAAQC,GAEnBkC,EAAI7b,KAAK2b,KAAKhC,GAEdM,EAAM,IAAI/W,MAAMyW,GAChBmC,EAAO,IAAI5Y,MAAMyW,GACjBoC,EAAO,IAAI7Y,MAAMyW,GAEjBqC,EAAO,IAAI9Y,MAAMyW,GACjBsC,EAAQ,IAAI/Y,MAAMyW,GAClBuC,EAAQ,IAAIhZ,MAAMyW,GAElBwC,EAAOrX,EAAIuI,MACf8O,EAAKta,OAAS8X,EAEd3Z,KAAK0b,WAAWnC,EAAElM,MAAOkM,EAAE1X,OAAQoY,EAAKN,GACxC3Z,KAAK0b,WAAWlC,EAAEnM,MAAOmM,EAAE3X,OAAQma,EAAMrC,GAEzC3Z,KAAKqa,UAAUJ,EAAK4B,EAAGC,EAAMC,EAAMpC,EAAGK,GACtCha,KAAKqa,UAAU2B,EAAMH,EAAGI,EAAOC,EAAOvC,EAAGK,GAEzC,IAAK,IAAI9X,EAAI,EAAGA,EAAIyX,EAAGzX,IAAK,CAC1B,IAAI+Y,EAAKa,EAAK5Z,GAAK+Z,EAAM/Z,GAAK6Z,EAAK7Z,GAAKga,EAAMha,GAC9C6Z,EAAK7Z,GAAK4Z,EAAK5Z,GAAKga,EAAMha,GAAK6Z,EAAK7Z,GAAK+Z,EAAM/Z,GAC/C4Z,EAAK5Z,GAAK+Y,EAUZ,OAPAjb,KAAKsb,UAAUQ,EAAMC,EAAMpC,GAC3B3Z,KAAKqa,UAAUyB,EAAMC,EAAMI,EAAMN,EAAGlC,EAAGK,GACvCha,KAAKsb,UAAUa,EAAMN,EAAGlC,GACxB3Z,KAAKub,aAAaY,EAAMxC,GAExB7U,EAAIsI,SAAWmM,EAAEnM,SAAWoM,EAAEpM,SAC9BtI,EAAIjD,OAAS0X,EAAE1X,OAAS2X,EAAE3X,OACnBiD,EAAI0J,SAIbxB,EAAG3L,UAAU0M,IAAM,SAAcrN,GAC/B,IAAIoE,EAAM,IAAIkI,EAAG,MAEjB,OADAlI,EAAIuI,MAAQ,IAAInK,MAAMlD,KAAK6B,OAASnB,EAAImB,QACjC7B,KAAKyZ,MAAM/Y,EAAKoE,IAIzBkI,EAAG3L,UAAU+a,KAAO,SAAe1b,GACjC,IAAIoE,EAAM,IAAIkI,EAAG,MAEjB,OADAlI,EAAIuI,MAAQ,IAAInK,MAAMlD,KAAK6B,OAASnB,EAAImB,QACjCsX,EAAWnZ,KAAMU,EAAKoE,IAI/BkI,EAAG3L,UAAUwW,KAAO,SAAenX,GACjC,OAAOV,KAAKqI,QAAQoR,MAAM/Y,EAAKV,OAGjCgN,EAAG3L,UAAU4N,MAAQ,SAAgBvO,GACnCyG,EAAsB,kBAARzG,GACdyG,EAAOzG,EAAM,UAIb,IADA,IAAI0P,EAAQ,EACHlO,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAAK,CACpC,IAAIwM,GAAqB,EAAhB1O,KAAKqN,MAAMnL,IAAUxB,EAC1ByP,GAAU,SAAJzB,IAA0B,SAAR0B,GAC5BA,IAAU,GACVA,GAAU1B,EAAI,SAAa,EAE3B0B,GAASD,IAAO,GAChBnQ,KAAKqN,MAAMnL,GAAU,SAALiO,EAQlB,OALc,IAAVC,IACFpQ,KAAKqN,MAAMnL,GAAKkO,EAChBpQ,KAAK6B,UAGA7B,MAGTgN,EAAG3L,UAAUgb,KAAO,SAAe3b,GACjC,OAAOV,KAAKqI,QAAQ4G,MAAMvO,IAI5BsM,EAAG3L,UAAUib,IAAM,WACjB,OAAOtc,KAAK+N,IAAI/N,OAIlBgN,EAAG3L,UAAUkb,KAAO,WAClB,OAAOvc,KAAK6X,KAAK7X,KAAKqI,UAIxB2E,EAAG3L,UAAU8N,IAAM,SAAczO,GAC/B,IAAIgO,EAAIiB,EAAWjP,GACnB,GAAiB,IAAbgO,EAAE7M,OAAc,OAAO,IAAImL,EAAG,GAIlC,IADA,IAAI/N,EAAMe,KACDkC,EAAI,EAAGA,EAAIwM,EAAE7M,OAAQK,IAAKjD,EAAMA,EAAIqd,MAC3C,GAAa,IAAT5N,EAAExM,GAAU,MAGlB,KAAMA,EAAIwM,EAAE7M,OACV,IAAK,IAAI0P,EAAItS,EAAIqd,MAAOpa,EAAIwM,EAAE7M,OAAQK,IAAKqP,EAAIA,EAAE+K,MAClC,IAAT5N,EAAExM,KAENjD,EAAMA,EAAI8O,IAAIwD,IAIlB,OAAOtS,GAIT+N,EAAG3L,UAAUmb,OAAS,SAAiBC,GACrCtV,EAAuB,kBAATsV,GAAqBA,GAAQ,GAC3C,IAGIva,EAHAuL,EAAIgP,EAAO,GACXnC,GAAKmC,EAAOhP,GAAK,GACjBiP,EAAa,WAAe,GAAKjP,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAI2C,EAAQ,EAEZ,IAAKlO,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAAK,CAChC,IAAIya,EAAW3c,KAAKqN,MAAMnL,GAAKwa,EAC3B7O,GAAsB,EAAhB7N,KAAKqN,MAAMnL,IAAUya,GAAalP,EAC5CzN,KAAKqN,MAAMnL,GAAK2L,EAAIuC,EACpBA,EAAQuM,IAAc,GAAKlP,EAGzB2C,IACFpQ,KAAKqN,MAAMnL,GAAKkO,EAChBpQ,KAAK6B,UAIT,GAAU,IAANyY,EAAS,CACX,IAAKpY,EAAIlC,KAAK6B,OAAS,EAAGK,GAAK,EAAGA,IAChClC,KAAKqN,MAAMnL,EAAIoY,GAAKta,KAAKqN,MAAMnL,GAGjC,IAAKA,EAAI,EAAGA,EAAIoY,EAAGpY,IACjBlC,KAAKqN,MAAMnL,GAAK,EAGlBlC,KAAK6B,QAAUyY,EAGjB,OAAOta,KAAKwO,SAGdxB,EAAG3L,UAAUub,MAAQ,SAAgBH,GAGnC,OADAtV,EAAyB,IAAlBnH,KAAKoN,UACLpN,KAAKwc,OAAOC,IAMrBzP,EAAG3L,UAAUoQ,OAAS,SAAiBgL,EAAMI,EAAMC,GAEjD,IAAIC,EADJ5V,EAAuB,kBAATsV,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAIpP,EAAIgP,EAAO,GACXnC,EAAI3M,KAAKC,KAAK6O,EAAOhP,GAAK,GAAIzN,KAAK6B,QACnCmb,EAAO,SAAc,WAAcvP,GAAMA,EACzCwP,EAAcH,EAMlB,GAJAC,GAAKzC,EACLyC,EAAIpP,KAAKK,IAAI,EAAG+O,GAGZE,EAAa,CACf,IAAK,IAAI/a,EAAI,EAAGA,EAAIoY,EAAGpY,IACrB+a,EAAY5P,MAAMnL,GAAKlC,KAAKqN,MAAMnL,GAEpC+a,EAAYpb,OAASyY,EAGvB,GAAU,IAANA,QAEG,GAAIta,KAAK6B,OAASyY,EAEvB,IADAta,KAAK6B,QAAUyY,EACVpY,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAC3BlC,KAAKqN,MAAMnL,GAAKlC,KAAKqN,MAAMnL,EAAIoY,QAGjCta,KAAKqN,MAAM,GAAK,EAChBrN,KAAK6B,OAAS,EAGhB,IAAIuO,EAAQ,EACZ,IAAKlO,EAAIlC,KAAK6B,OAAS,EAAGK,GAAK,IAAgB,IAAVkO,GAAelO,GAAK6a,GAAI7a,IAAK,CAChE,IAAI8M,EAAuB,EAAhBhP,KAAKqN,MAAMnL,GACtBlC,KAAKqN,MAAMnL,GAAMkO,GAAU,GAAK3C,EAAOuB,IAASvB,EAChD2C,EAAQpB,EAAOgO,EAajB,OATIC,GAAyB,IAAV7M,IACjB6M,EAAY5P,MAAM4P,EAAYpb,UAAYuO,GAGxB,IAAhBpQ,KAAK6B,SACP7B,KAAKqN,MAAM,GAAK,EAChBrN,KAAK6B,OAAS,GAGT7B,KAAKwO,SAGdxB,EAAG3L,UAAU6b,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADA3V,EAAyB,IAAlBnH,KAAKoN,UACLpN,KAAKyR,OAAOgL,EAAMI,EAAMC,IAIjC9P,EAAG3L,UAAU8b,KAAO,SAAeV,GACjC,OAAOzc,KAAKqI,QAAQuU,MAAMH,IAG5BzP,EAAG3L,UAAU+b,MAAQ,SAAgBX,GACnC,OAAOzc,KAAKqI,QAAQmU,OAAOC,IAI7BzP,EAAG3L,UAAUgc,KAAO,SAAeZ,GACjC,OAAOzc,KAAKqI,QAAQ6U,MAAMT,IAG5BzP,EAAG3L,UAAUic,MAAQ,SAAgBb,GACnC,OAAOzc,KAAKqI,QAAQoJ,OAAOgL,IAI7BzP,EAAG3L,UAAUiR,MAAQ,SAAgBzC,GACnC1I,EAAsB,kBAAR0I,GAAoBA,GAAO,GACzC,IAAIpC,EAAIoC,EAAM,GACVyK,GAAKzK,EAAMpC,GAAK,GAChB8D,EAAI,GAAK9D,EAGb,GAAIzN,KAAK6B,QAAUyY,EAAG,OAAO,EAG7B,IAAI5L,EAAI1O,KAAKqN,MAAMiN,GAEnB,SAAU5L,EAAI6C,IAIhBvE,EAAG3L,UAAUkc,OAAS,SAAiBd,GACrCtV,EAAuB,kBAATsV,GAAqBA,GAAQ,GAC3C,IAAIhP,EAAIgP,EAAO,GACXnC,GAAKmC,EAAOhP,GAAK,GAIrB,GAFAtG,EAAyB,IAAlBnH,KAAKoN,SAAgB,2CAExBpN,KAAK6B,QAAUyY,EACjB,OAAOta,KAQT,GALU,IAANyN,GACF6M,IAEFta,KAAK6B,OAAS8L,KAAKC,IAAI0M,EAAGta,KAAK6B,QAErB,IAAN4L,EAAS,CACX,IAAIuP,EAAO,SAAc,WAAcvP,GAAMA,EAC7CzN,KAAKqN,MAAMrN,KAAK6B,OAAS,IAAMmb,EAGjC,OAAOhd,KAAKwO,SAIdxB,EAAG3L,UAAUmc,MAAQ,SAAgBf,GACnC,OAAOzc,KAAKqI,QAAQkV,OAAOd,IAI7BzP,EAAG3L,UAAU+Q,MAAQ,SAAgB1R,GAGnC,OAFAyG,EAAsB,kBAARzG,GACdyG,EAAOzG,EAAM,UACTA,EAAM,EAAUV,KAAKyd,OAAO/c,GAGV,IAAlBV,KAAKoN,SACa,IAAhBpN,KAAK6B,SAAiC,EAAhB7B,KAAKqN,MAAM,IAAU3M,GAC7CV,KAAKqN,MAAM,GAAK3M,GAAuB,EAAhBV,KAAKqN,MAAM,IAClCrN,KAAKoN,SAAW,EACTpN,OAGTA,KAAKoN,SAAW,EAChBpN,KAAKyd,MAAM/c,GACXV,KAAKoN,SAAW,EACTpN,MAIFA,KAAKkP,OAAOxO,IAGrBsM,EAAG3L,UAAU6N,OAAS,SAAiBxO,GACrCV,KAAKqN,MAAM,IAAM3M,EAGjB,IAAK,IAAIwB,EAAI,EAAGA,EAAIlC,KAAK6B,QAAU7B,KAAKqN,MAAMnL,IAAM,SAAWA,IAC7DlC,KAAKqN,MAAMnL,IAAM,SACbA,IAAMlC,KAAK6B,OAAS,EACtB7B,KAAKqN,MAAMnL,EAAI,GAAK,EAEpBlC,KAAKqN,MAAMnL,EAAI,KAKnB,OAFAlC,KAAK6B,OAAS8L,KAAKK,IAAIhO,KAAK6B,OAAQK,EAAI,GAEjClC,MAITgN,EAAG3L,UAAUoc,MAAQ,SAAgB/c,GAGnC,GAFAyG,EAAsB,kBAARzG,GACdyG,EAAOzG,EAAM,UACTA,EAAM,EAAG,OAAOV,KAAKoS,OAAO1R,GAEhC,GAAsB,IAAlBV,KAAKoN,SAIP,OAHApN,KAAKoN,SAAW,EAChBpN,KAAKoS,MAAM1R,GACXV,KAAKoN,SAAW,EACTpN,KAKT,GAFAA,KAAKqN,MAAM,IAAM3M,EAEG,IAAhBV,KAAK6B,QAAgB7B,KAAKqN,MAAM,GAAK,EACvCrN,KAAKqN,MAAM,IAAMrN,KAAKqN,MAAM,GAC5BrN,KAAKoN,SAAW,OAGhB,IAAK,IAAIlL,EAAI,EAAGA,EAAIlC,KAAK6B,QAAU7B,KAAKqN,MAAMnL,GAAK,EAAGA,IACpDlC,KAAKqN,MAAMnL,IAAM,SACjBlC,KAAKqN,MAAMnL,EAAI,IAAM,EAIzB,OAAOlC,KAAKwO,SAGdxB,EAAG3L,UAAUqc,KAAO,SAAehd,GACjC,OAAOV,KAAKqI,QAAQ+J,MAAM1R,IAG5BsM,EAAG3L,UAAUsc,KAAO,SAAejd,GACjC,OAAOV,KAAKqI,QAAQoV,MAAM/c,IAG5BsM,EAAG3L,UAAUuc,KAAO,WAGlB,OAFA5d,KAAKoN,SAAW,EAETpN,MAGTgN,EAAG3L,UAAU6Q,IAAM,WACjB,OAAOlS,KAAKqI,QAAQuV,QAGtB5Q,EAAG3L,UAAUwc,aAAe,SAAuBnd,EAAKqN,EAAK+P,GAC3D,IACI5b,EAIAwM,EALAhB,EAAMhN,EAAImB,OAASic,EAGvB9d,KAAKqP,QAAQ3B,GAGb,IAAI0C,EAAQ,EACZ,IAAKlO,EAAI,EAAGA,EAAIxB,EAAImB,OAAQK,IAAK,CAC/BwM,GAA6B,EAAxB1O,KAAKqN,MAAMnL,EAAI4b,IAAc1N,EAClC,IAAIlC,GAAwB,EAAfxN,EAAI2M,MAAMnL,IAAU6L,EACjCW,GAAa,SAARR,EACLkC,GAAS1B,GAAK,KAAQR,EAAQ,SAAa,GAC3ClO,KAAKqN,MAAMnL,EAAI4b,GAAa,SAAJpP,EAE1B,KAAOxM,EAAIlC,KAAK6B,OAASic,EAAO5b,IAC9BwM,GAA6B,EAAxB1O,KAAKqN,MAAMnL,EAAI4b,IAAc1N,EAClCA,EAAQ1B,GAAK,GACb1O,KAAKqN,MAAMnL,EAAI4b,GAAa,SAAJpP,EAG1B,GAAc,IAAV0B,EAAa,OAAOpQ,KAAKwO,QAK7B,IAFArH,GAAkB,IAAXiJ,GACPA,EAAQ,EACHlO,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAC3BwM,IAAsB,EAAhB1O,KAAKqN,MAAMnL,IAAUkO,EAC3BA,EAAQ1B,GAAK,GACb1O,KAAKqN,MAAMnL,GAAS,SAAJwM,EAIlB,OAFA1O,KAAKoN,SAAW,EAETpN,KAAKwO,SAGdxB,EAAG3L,UAAU0c,SAAW,SAAmBrd,EAAKsd,GAC9C,IAAIF,EAAQ9d,KAAK6B,OAASnB,EAAImB,OAE1BoO,EAAIjQ,KAAKqI,QACT6H,EAAIxP,EAGJud,EAA8B,EAAxB/N,EAAE7C,MAAM6C,EAAErO,OAAS,GACzBqc,EAAUle,KAAK2R,WAAWsM,GAC9BH,EAAQ,GAAKI,EACC,IAAVJ,IACF5N,EAAIA,EAAEkN,MAAMU,GACZ7N,EAAEuM,OAAOsB,GACTG,EAA8B,EAAxB/N,EAAE7C,MAAM6C,EAAErO,OAAS,IAI3B,IACI0P,EADA6J,EAAInL,EAAEpO,OAASqO,EAAErO,OAGrB,GAAa,QAATmc,EAAgB,CAClBzM,EAAI,IAAIvE,EAAG,MACXuE,EAAE1P,OAASuZ,EAAI,EACf7J,EAAElE,MAAQ,IAAInK,MAAMqO,EAAE1P,QACtB,IAAK,IAAIK,EAAI,EAAGA,EAAIqP,EAAE1P,OAAQK,IAC5BqP,EAAElE,MAAMnL,GAAK,EAIjB,IAAIic,EAAOlO,EAAE5H,QAAQwV,aAAa3N,EAAG,EAAGkL,GAClB,IAAlB+C,EAAK/Q,WACP6C,EAAIkO,EACA5M,IACFA,EAAElE,MAAM+N,GAAK,IAIjB,IAAK,IAAIjZ,EAAIiZ,EAAI,EAAGjZ,GAAK,EAAGA,IAAK,CAC/B,IAAIic,EAAmC,UAAL,EAAxBnO,EAAE5C,MAAM6C,EAAErO,OAASM,KACE,EAA5B8N,EAAE5C,MAAM6C,EAAErO,OAASM,EAAI,IAI1Bic,EAAKzQ,KAAKC,IAAKwQ,EAAKH,EAAO,EAAG,UAE9BhO,EAAE4N,aAAa3N,EAAGkO,EAAIjc,GACtB,MAAsB,IAAf8N,EAAE7C,SACPgR,IACAnO,EAAE7C,SAAW,EACb6C,EAAE4N,aAAa3N,EAAG,EAAG/N,GAChB8N,EAAEW,WACLX,EAAE7C,UAAY,GAGdmE,IACFA,EAAElE,MAAMlL,GAAKic,GAajB,OAVI7M,GACFA,EAAE/C,QAEJyB,EAAEzB,QAGW,QAATwP,GAA4B,IAAVF,GACpB7N,EAAEwB,OAAOqM,GAGJ,CACLO,IAAK9M,GAAK,KACVxC,IAAKkB,IAQTjD,EAAG3L,UAAUid,OAAS,SAAiB5d,EAAKsd,EAAMO,GAGhD,OAFApX,GAAQzG,EAAIkQ,UAER5Q,KAAK4Q,SACA,CACLyN,IAAK,IAAIrR,EAAG,GACZ+B,IAAK,IAAI/B,EAAG,IAKM,IAAlBhN,KAAKoN,UAAmC,IAAjB1M,EAAI0M,UAC7BnO,EAAMe,KAAK0S,MAAM4L,OAAO5d,EAAKsd,GAEhB,QAATA,IACFK,EAAMpf,EAAIof,IAAI3L,OAGH,QAATsL,IACFjP,EAAM9P,EAAI8P,IAAI2D,MACV6L,GAA6B,IAAjBxP,EAAI3B,UAClB2B,EAAI2E,KAAKhT,IAIN,CACL2d,IAAKA,EACLtP,IAAKA,IAIa,IAAlB/O,KAAKoN,UAAmC,IAAjB1M,EAAI0M,UAC7BnO,EAAMe,KAAKse,OAAO5d,EAAIgS,MAAOsL,GAEhB,QAATA,IACFK,EAAMpf,EAAIof,IAAI3L,OAGT,CACL2L,IAAKA,EACLtP,IAAK9P,EAAI8P,MAI0B,KAAlC/O,KAAKoN,SAAW1M,EAAI0M,WACvBnO,EAAMe,KAAK0S,MAAM4L,OAAO5d,EAAIgS,MAAOsL,GAEtB,QAATA,IACFjP,EAAM9P,EAAI8P,IAAI2D,MACV6L,GAA6B,IAAjBxP,EAAI3B,UAClB2B,EAAI4E,KAAKjT,IAIN,CACL2d,IAAKpf,EAAIof,IACTtP,IAAKA,IAOLrO,EAAImB,OAAS7B,KAAK6B,QAAU7B,KAAKmO,IAAIzN,GAAO,EACvC,CACL2d,IAAK,IAAIrR,EAAG,GACZ+B,IAAK/O,MAKU,IAAfU,EAAImB,OACO,QAATmc,EACK,CACLK,IAAKre,KAAKwe,KAAK9d,EAAI2M,MAAM,IACzB0B,IAAK,MAII,QAATiP,EACK,CACLK,IAAK,KACLtP,IAAK,IAAI/B,EAAGhN,KAAK6Q,KAAKnQ,EAAI2M,MAAM,MAI7B,CACLgR,IAAKre,KAAKwe,KAAK9d,EAAI2M,MAAM,IACzB0B,IAAK,IAAI/B,EAAGhN,KAAK6Q,KAAKnQ,EAAI2M,MAAM,MAI7BrN,KAAK+d,SAASrd,EAAKsd,GAlF1B,IAAIK,EAAKtP,EAAK9P,GAsFhB+N,EAAG3L,UAAUgd,IAAM,SAAc3d,GAC/B,OAAOV,KAAKse,OAAO5d,EAAK,OAAO,GAAO2d,KAIxCrR,EAAG3L,UAAU0N,IAAM,SAAcrO,GAC/B,OAAOV,KAAKse,OAAO5d,EAAK,OAAO,GAAOqO,KAGxC/B,EAAG3L,UAAUod,KAAO,SAAe/d,GACjC,OAAOV,KAAKse,OAAO5d,EAAK,OAAO,GAAMqO,KAIvC/B,EAAG3L,UAAUqd,SAAW,SAAmBhe,GACzC,IAAIie,EAAK3e,KAAKse,OAAO5d,GAGrB,GAAIie,EAAG5P,IAAI6B,SAAU,OAAO+N,EAAGN,IAE/B,IAAItP,EAA0B,IAApB4P,EAAGN,IAAIjR,SAAiBuR,EAAG5P,IAAI4E,KAAKjT,GAAOie,EAAG5P,IAEpD6P,EAAOle,EAAI4c,MAAM,GACjBuB,EAAKne,EAAI8Q,MAAM,GACfrD,EAAMY,EAAIZ,IAAIyQ,GAGlB,OAAIzQ,EAAM,GAAY,IAAP0Q,GAAoB,IAAR1Q,EAAkBwQ,EAAGN,IAGrB,IAApBM,EAAGN,IAAIjR,SAAiBuR,EAAGN,IAAIZ,MAAM,GAAKkB,EAAGN,IAAIjM,MAAM,IAGhEpF,EAAG3L,UAAUwP,KAAO,SAAenQ,GACjCyG,EAAOzG,GAAO,UAId,IAHA,IAAI+K,GAAK,GAAK,IAAM/K,EAEhBoe,EAAM,EACD5c,EAAIlC,KAAK6B,OAAS,EAAGK,GAAK,EAAGA,IACpC4c,GAAOrT,EAAIqT,GAAuB,EAAhB9e,KAAKqN,MAAMnL,KAAWxB,EAG1C,OAAOoe,GAIT9R,EAAG3L,UAAUyP,MAAQ,SAAgBpQ,GACnCyG,EAAOzG,GAAO,UAGd,IADA,IAAI0P,EAAQ,EACHlO,EAAIlC,KAAK6B,OAAS,EAAGK,GAAK,EAAGA,IAAK,CACzC,IAAIwM,GAAqB,EAAhB1O,KAAKqN,MAAMnL,IAAkB,SAARkO,EAC9BpQ,KAAKqN,MAAMnL,GAAMwM,EAAIhO,EAAO,EAC5B0P,EAAQ1B,EAAIhO,EAGd,OAAOV,KAAKwO,SAGdxB,EAAG3L,UAAUmd,KAAO,SAAe9d,GACjC,OAAOV,KAAKqI,QAAQyI,MAAMpQ,IAG5BsM,EAAG3L,UAAU0d,KAAO,SAAetT,GACjCtE,EAAsB,IAAfsE,EAAE2B,UACTjG,GAAQsE,EAAEmF,UAEV,IAAI2I,EAAIvZ,KACJwZ,EAAI/N,EAAEpD,QAGRkR,EADiB,IAAfA,EAAEnM,SACAmM,EAAEkF,KAAKhT,GAEP8N,EAAElR,QAIR,IAAI2W,EAAI,IAAIhS,EAAG,GACXiS,EAAI,IAAIjS,EAAG,GAGXkS,EAAI,IAAIlS,EAAG,GACXmS,EAAI,IAAInS,EAAG,GAEXoS,EAAI,EAER,MAAO7F,EAAE8F,UAAY7F,EAAE6F,SACrB9F,EAAE9H,OAAO,GACT+H,EAAE/H,OAAO,KACP2N,EAGJ,IAAIE,EAAK9F,EAAEnR,QACPkX,EAAKhG,EAAElR,QAEX,OAAQkR,EAAE3I,SAAU,CAClB,IAAK,IAAI1O,EAAI,EAAGsd,EAAK,EAAyB,KAArBjG,EAAElM,MAAM,GAAKmS,IAAatd,EAAI,KAAMA,EAAGsd,IAAO,GACvE,GAAItd,EAAI,EAAG,CACTqX,EAAE9H,OAAOvP,GACT,MAAOA,KAAM,GACP8c,EAAES,SAAWR,EAAEQ,WACjBT,EAAEtL,KAAK4L,GACPL,EAAEtL,KAAK4L,IAGTP,EAAEvN,OAAO,GACTwN,EAAExN,OAAO,GAIb,IAAK,IAAItP,EAAI,EAAGud,EAAK,EAAyB,KAArBlG,EAAEnM,MAAM,GAAKqS,IAAavd,EAAI,KAAMA,EAAGud,IAAO,GACvE,GAAIvd,EAAI,EAAG,CACTqX,EAAE/H,OAAOtP,GACT,MAAOA,KAAM,GACP+c,EAAEO,SAAWN,EAAEM,WACjBP,EAAExL,KAAK4L,GACPH,EAAExL,KAAK4L,IAGTL,EAAEzN,OAAO,GACT0N,EAAE1N,OAAO,GAIT8H,EAAEpL,IAAIqL,IAAM,GACdD,EAAE5F,KAAK6F,GACPwF,EAAErL,KAAKuL,GACPD,EAAEtL,KAAKwL,KAEP3F,EAAE7F,KAAK4F,GACP2F,EAAEvL,KAAKqL,GACPG,EAAExL,KAAKsL,IAIX,MAAO,CACLhP,EAAGiP,EACHhP,EAAGiP,EACHQ,IAAKnG,EAAEgD,OAAO4C,KAOlBpS,EAAG3L,UAAUue,OAAS,SAAiBnU,GACrCtE,EAAsB,IAAfsE,EAAE2B,UACTjG,GAAQsE,EAAEmF,UAEV,IAAIX,EAAIjQ,KACJkQ,EAAIzE,EAAEpD,QAGR4H,EADiB,IAAfA,EAAE7C,SACA6C,EAAEwO,KAAKhT,GAEPwE,EAAE5H,QAGR,IAuCIpJ,EAvCA4gB,EAAK,IAAI7S,EAAG,GACZ8S,EAAK,IAAI9S,EAAG,GAEZ+S,EAAQ7P,EAAE7H,QAEd,MAAO4H,EAAE+P,KAAK,GAAK,GAAK9P,EAAE8P,KAAK,GAAK,EAAG,CACrC,IAAK,IAAI9d,EAAI,EAAGsd,EAAK,EAAyB,KAArBvP,EAAE5C,MAAM,GAAKmS,IAAatd,EAAI,KAAMA,EAAGsd,IAAO,GACvE,GAAItd,EAAI,EAAG,CACT+N,EAAEwB,OAAOvP,GACT,MAAOA,KAAM,EACP2d,EAAGJ,SACLI,EAAGnM,KAAKqM,GAGVF,EAAGpO,OAAO,GAId,IAAK,IAAItP,EAAI,EAAGud,EAAK,EAAyB,KAArBxP,EAAE7C,MAAM,GAAKqS,IAAavd,EAAI,KAAMA,EAAGud,IAAO,GACvE,GAAIvd,EAAI,EAAG,CACT+N,EAAEuB,OAAOtP,GACT,MAAOA,KAAM,EACP2d,EAAGL,SACLK,EAAGpM,KAAKqM,GAGVD,EAAGrO,OAAO,GAIVxB,EAAE9B,IAAI+B,IAAM,GACdD,EAAE0D,KAAKzD,GACP2P,EAAGlM,KAAKmM,KAER5P,EAAEyD,KAAK1D,GACP6P,EAAGnM,KAAKkM,IAeZ,OATE5gB,EADgB,IAAdgR,EAAE+P,KAAK,GACHH,EAEAC,EAGJ7gB,EAAI+gB,KAAK,GAAK,GAChB/gB,EAAIyU,KAAKjI,GAGJxM,GAGT+N,EAAG3L,UAAUse,IAAM,SAAcjf,GAC/B,GAAIV,KAAK4Q,SAAU,OAAOlQ,EAAIwR,MAC9B,GAAIxR,EAAIkQ,SAAU,OAAO5Q,KAAKkS,MAE9B,IAAIjC,EAAIjQ,KAAKqI,QACT6H,EAAIxP,EAAI2H,QACZ4H,EAAE7C,SAAW,EACb8C,EAAE9C,SAAW,EAGb,IAAK,IAAI0Q,EAAQ,EAAG7N,EAAEoP,UAAYnP,EAAEmP,SAAUvB,IAC5C7N,EAAEwB,OAAO,GACTvB,EAAEuB,OAAO,GAGX,EAAG,CACD,MAAOxB,EAAEoP,SACPpP,EAAEwB,OAAO,GAEX,MAAOvB,EAAEmP,SACPnP,EAAEuB,OAAO,GAGX,IAAIhE,EAAIwC,EAAE9B,IAAI+B,GACd,GAAIzC,EAAI,EAAG,CAET,IAAImE,EAAI3B,EACRA,EAAIC,EACJA,EAAI0B,OACC,GAAU,IAANnE,GAAyB,IAAdyC,EAAE8P,KAAK,GAC3B,MAGF/P,EAAE0D,KAAKzD,SACA,GAET,OAAOA,EAAEsM,OAAOsB,IAIlB9Q,EAAG3L,UAAU4e,KAAO,SAAevf,GACjC,OAAOV,KAAK+e,KAAKre,GAAKuP,EAAEwO,KAAK/d,IAG/BsM,EAAG3L,UAAUge,OAAS,WACpB,OAA+B,KAAP,EAAhBrf,KAAKqN,MAAM,KAGrBL,EAAG3L,UAAUoe,MAAQ,WACnB,OAA+B,KAAP,EAAhBzf,KAAKqN,MAAM,KAIrBL,EAAG3L,UAAUmQ,MAAQ,SAAgB9Q,GACnC,OAAOV,KAAKqN,MAAM,GAAK3M,GAIzBsM,EAAG3L,UAAU6e,MAAQ,SAAgBrQ,GACnC1I,EAAsB,kBAAR0I,GACd,IAAIpC,EAAIoC,EAAM,GACVyK,GAAKzK,EAAMpC,GAAK,GAChB8D,EAAI,GAAK9D,EAGb,GAAIzN,KAAK6B,QAAUyY,EAGjB,OAFAta,KAAKqP,QAAQiL,EAAI,GACjBta,KAAKqN,MAAMiN,IAAM/I,EACVvR,KAKT,IADA,IAAIoQ,EAAQmB,EACHrP,EAAIoY,EAAa,IAAVlK,GAAelO,EAAIlC,KAAK6B,OAAQK,IAAK,CACnD,IAAIwM,EAAoB,EAAhB1O,KAAKqN,MAAMnL,GACnBwM,GAAK0B,EACLA,EAAQ1B,IAAM,GACdA,GAAK,SACL1O,KAAKqN,MAAMnL,GAAKwM,EAMlB,OAJc,IAAV0B,IACFpQ,KAAKqN,MAAMnL,GAAKkO,EAChBpQ,KAAK6B,UAEA7B,MAGTgN,EAAG3L,UAAUuP,OAAS,WACpB,OAAuB,IAAhB5Q,KAAK6B,QAAkC,IAAlB7B,KAAKqN,MAAM,IAGzCL,EAAG3L,UAAU2e,KAAO,SAAetf,GACjC,IAOIzB,EAPAmO,EAAW1M,EAAM,EAErB,GAAsB,IAAlBV,KAAKoN,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBpN,KAAKoN,UAAkBA,EAAU,OAAO,EAK5C,GAHApN,KAAKwO,QAGDxO,KAAK6B,OAAS,EAChB5C,EAAM,MACD,CACDmO,IACF1M,GAAOA,GAGTyG,EAAOzG,GAAO,SAAW,qBAEzB,IAAIgO,EAAoB,EAAhB1O,KAAKqN,MAAM,GACnBpO,EAAMyP,IAAMhO,EAAM,EAAIgO,EAAIhO,GAAO,EAAI,EAEvC,OAAsB,IAAlBV,KAAKoN,SAA8B,GAANnO,EAC1BA,GAOT+N,EAAG3L,UAAU8M,IAAM,SAAczN,GAC/B,GAAsB,IAAlBV,KAAKoN,UAAmC,IAAjB1M,EAAI0M,SAAgB,OAAQ,EACvD,GAAsB,IAAlBpN,KAAKoN,UAAmC,IAAjB1M,EAAI0M,SAAgB,OAAO,EAEtD,IAAInO,EAAMe,KAAKmgB,KAAKzf,GACpB,OAAsB,IAAlBV,KAAKoN,SAA8B,GAANnO,EAC1BA,GAIT+N,EAAG3L,UAAU8e,KAAO,SAAezf,GAEjC,GAAIV,KAAK6B,OAASnB,EAAImB,OAAQ,OAAO,EACrC,GAAI7B,KAAK6B,OAASnB,EAAImB,OAAQ,OAAQ,EAGtC,IADA,IAAI5C,EAAM,EACDiD,EAAIlC,KAAK6B,OAAS,EAAGK,GAAK,EAAGA,IAAK,CACzC,IAAI+N,EAAoB,EAAhBjQ,KAAKqN,MAAMnL,GACfgO,EAAmB,EAAfxP,EAAI2M,MAAMnL,GAElB,GAAI+N,IAAMC,EAAV,CACID,EAAIC,EACNjR,GAAO,EACEgR,EAAIC,IACbjR,EAAM,GAER,OAEF,OAAOA,GAGT+N,EAAG3L,UAAU+e,IAAM,SAAc1f,GAC/B,OAA0B,IAAnBV,KAAKggB,KAAKtf,IAGnBsM,EAAG3L,UAAUgf,GAAK,SAAa3f,GAC7B,OAAyB,IAAlBV,KAAKmO,IAAIzN,IAGlBsM,EAAG3L,UAAUif,KAAO,SAAe5f,GACjC,OAAOV,KAAKggB,KAAKtf,IAAQ,GAG3BsM,EAAG3L,UAAUkf,IAAM,SAAc7f,GAC/B,OAAOV,KAAKmO,IAAIzN,IAAQ,GAG1BsM,EAAG3L,UAAUmf,IAAM,SAAc9f,GAC/B,OAA2B,IAApBV,KAAKggB,KAAKtf,IAGnBsM,EAAG3L,UAAUof,GAAK,SAAa/f,GAC7B,OAA0B,IAAnBV,KAAKmO,IAAIzN,IAGlBsM,EAAG3L,UAAUqf,KAAO,SAAehgB,GACjC,OAAOV,KAAKggB,KAAKtf,IAAQ,GAG3BsM,EAAG3L,UAAUsf,IAAM,SAAcjgB,GAC/B,OAAOV,KAAKmO,IAAIzN,IAAQ,GAG1BsM,EAAG3L,UAAUuf,IAAM,SAAclgB,GAC/B,OAA0B,IAAnBV,KAAKggB,KAAKtf,IAGnBsM,EAAG3L,UAAUwf,GAAK,SAAangB,GAC7B,OAAyB,IAAlBV,KAAKmO,IAAIzN,IAOlBsM,EAAGM,IAAM,SAAc5M,GACrB,OAAO,IAAIogB,EAAIpgB,IAGjBsM,EAAG3L,UAAU0f,MAAQ,SAAgBC,GAGnC,OAFA7Z,GAAQnH,KAAKsN,IAAK,yCAClBnG,EAAyB,IAAlBnH,KAAKoN,SAAgB,iCACrB4T,EAAIC,UAAUjhB,MAAMkhB,UAAUF,IAGvChU,EAAG3L,UAAU8f,QAAU,WAErB,OADAha,EAAOnH,KAAKsN,IAAK,wDACVtN,KAAKsN,IAAI8T,YAAYphB,OAG9BgN,EAAG3L,UAAU6f,UAAY,SAAoBF,GAE3C,OADAhhB,KAAKsN,IAAM0T,EACJhhB,MAGTgN,EAAG3L,UAAUggB,SAAW,SAAmBL,GAEzC,OADA7Z,GAAQnH,KAAKsN,IAAK,yCACXtN,KAAKkhB,UAAUF,IAGxBhU,EAAG3L,UAAUigB,OAAS,SAAiB5gB,GAErC,OADAyG,EAAOnH,KAAKsN,IAAK,sCACVtN,KAAKsN,IAAIsG,IAAI5T,KAAMU,IAG5BsM,EAAG3L,UAAUkgB,QAAU,SAAkB7gB,GAEvC,OADAyG,EAAOnH,KAAKsN,IAAK,uCACVtN,KAAKsN,IAAIoG,KAAK1T,KAAMU,IAG7BsM,EAAG3L,UAAUmgB,OAAS,SAAiB9gB,GAErC,OADAyG,EAAOnH,KAAKsN,IAAK,sCACVtN,KAAKsN,IAAIuG,IAAI7T,KAAMU,IAG5BsM,EAAG3L,UAAUogB,QAAU,SAAkB/gB,GAEvC,OADAyG,EAAOnH,KAAKsN,IAAK,uCACVtN,KAAKsN,IAAIqG,KAAK3T,KAAMU,IAG7BsM,EAAG3L,UAAUqgB,OAAS,SAAiBhhB,GAErC,OADAyG,EAAOnH,KAAKsN,IAAK,sCACVtN,KAAKsN,IAAIqU,IAAI3hB,KAAMU,IAG5BsM,EAAG3L,UAAUugB,OAAS,SAAiBlhB,GAGrC,OAFAyG,EAAOnH,KAAKsN,IAAK,sCACjBtN,KAAKsN,IAAIuU,SAAS7hB,KAAMU,GACjBV,KAAKsN,IAAIS,IAAI/N,KAAMU,IAG5BsM,EAAG3L,UAAUygB,QAAU,SAAkBphB,GAGvC,OAFAyG,EAAOnH,KAAKsN,IAAK,sCACjBtN,KAAKsN,IAAIuU,SAAS7hB,KAAMU,GACjBV,KAAKsN,IAAIuK,KAAK7X,KAAMU,IAG7BsM,EAAG3L,UAAU0gB,OAAS,WAGpB,OAFA5a,EAAOnH,KAAKsN,IAAK,sCACjBtN,KAAKsN,IAAI0U,SAAShiB,MACXA,KAAKsN,IAAIgP,IAAItc,OAGtBgN,EAAG3L,UAAU4gB,QAAU,WAGrB,OAFA9a,EAAOnH,KAAKsN,IAAK,uCACjBtN,KAAKsN,IAAI0U,SAAShiB,MACXA,KAAKsN,IAAIiP,KAAKvc,OAIvBgN,EAAG3L,UAAU6gB,QAAU,WAGrB,OAFA/a,EAAOnH,KAAKsN,IAAK,uCACjBtN,KAAKsN,IAAI0U,SAAShiB,MACXA,KAAKsN,IAAI6U,KAAKniB,OAGvBgN,EAAG3L,UAAU+gB,QAAU,WAGrB,OAFAjb,EAAOnH,KAAKsN,IAAK,uCACjBtN,KAAKsN,IAAI0U,SAAShiB,MACXA,KAAKsN,IAAI2S,KAAKjgB,OAIvBgN,EAAG3L,UAAUghB,OAAS,WAGpB,OAFAlb,EAAOnH,KAAKsN,IAAK,sCACjBtN,KAAKsN,IAAI0U,SAAShiB,MACXA,KAAKsN,IAAIoF,IAAI1S,OAGtBgN,EAAG3L,UAAUihB,OAAS,SAAiB5hB,GAGrC,OAFAyG,EAAOnH,KAAKsN,MAAQ5M,EAAI4M,IAAK,qBAC7BtN,KAAKsN,IAAI0U,SAAShiB,MACXA,KAAKsN,IAAI6B,IAAInP,KAAMU,IAI5B,IAAI6hB,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQ1iB,EAAMuL,GAErBzL,KAAKE,KAAOA,EACZF,KAAKyL,EAAI,IAAIuB,EAAGvB,EAAG,IACnBzL,KAAKmb,EAAInb,KAAKyL,EAAEmE,YAChB5P,KAAKqQ,EAAI,IAAIrD,EAAG,GAAGwP,OAAOxc,KAAKmb,GAAGxH,KAAK3T,KAAKyL,GAE5CzL,KAAK6iB,IAAM7iB,KAAK8iB,OAiDlB,SAASC,IACPH,EAAOpiB,KACLR,KACA,OACA,2EA+DJ,SAASgjB,IACPJ,EAAOpiB,KACLR,KACA,OACA,kEAIJ,SAASijB,IACPL,EAAOpiB,KACLR,KACA,OACA,yDAIJ,SAASkjB,IAEPN,EAAOpiB,KACLR,KACA,QACA,uEA8CJ,SAAS8gB,EAAK1F,GACZ,GAAiB,kBAANA,EAAgB,CACzB,IAAI+H,EAAQnW,EAAGoW,OAAOhI,GACtBpb,KAAKob,EAAI+H,EAAM1X,EACfzL,KAAKmjB,MAAQA,OAEbhc,EAAOiU,EAAEgF,IAAI,GAAI,kCACjBpgB,KAAKob,EAAIA,EACTpb,KAAKmjB,MAAQ,KAkOjB,SAASE,EAAMjI,GACb0F,EAAItgB,KAAKR,KAAMob,GAEfpb,KAAK8d,MAAQ9d,KAAKob,EAAExL,YAChB5P,KAAK8d,MAAQ,KAAO,IACtB9d,KAAK8d,OAAS,GAAM9d,KAAK8d,MAAQ,IAGnC9d,KAAKyN,EAAI,IAAIT,EAAG,GAAGwP,OAAOxc,KAAK8d,OAC/B9d,KAAK6e,GAAK7e,KAAKsjB,KAAKtjB,KAAKyN,EAAE6O,OAC3Btc,KAAKujB,KAAOvjB,KAAKyN,EAAEmS,OAAO5f,KAAKob,GAE/Bpb,KAAKwjB,KAAOxjB,KAAKujB,KAAKxV,IAAI/N,KAAKyN,GAAGgQ,MAAM,GAAGY,IAAIre,KAAKob,GACpDpb,KAAKwjB,KAAOxjB,KAAKwjB,KAAK/E,KAAKze,KAAKyN,GAChCzN,KAAKwjB,KAAOxjB,KAAKyN,EAAEoG,IAAI7T,KAAKwjB,MA5a9BZ,EAAOvhB,UAAUyhB,KAAO,WACtB,IAAID,EAAM,IAAI7V,EAAG,MAEjB,OADA6V,EAAIxV,MAAQ,IAAInK,MAAMyK,KAAKc,KAAKzO,KAAKmb,EAAI,KAClC0H,GAGTD,EAAOvhB,UAAUoiB,QAAU,SAAkB/iB,GAG3C,IACIgjB,EADAjW,EAAI/M,EAGR,GACEV,KAAKiD,MAAMwK,EAAGzN,KAAK6iB,KACnBpV,EAAIzN,KAAK2jB,MAAMlW,GACfA,EAAIA,EAAEiG,KAAK1T,KAAK6iB,KAChBa,EAAOjW,EAAEmC,kBACF8T,EAAO1jB,KAAKmb,GAErB,IAAIhN,EAAMuV,EAAO1jB,KAAKmb,GAAK,EAAI1N,EAAE0S,KAAKngB,KAAKyL,GAgB3C,OAfY,IAAR0C,GACFV,EAAEJ,MAAM,GAAK,EACbI,EAAE5L,OAAS,GACFsM,EAAM,EACfV,EAAEkG,KAAK3T,KAAKyL,QAEIjG,IAAZiI,EAAEe,MAEJf,EAAEe,QAGFf,EAAEmW,SAICnW,GAGTmV,EAAOvhB,UAAU4B,MAAQ,SAAgBqG,EAAOxE,GAC9CwE,EAAMmI,OAAOzR,KAAKmb,EAAG,EAAGrW,IAG1B8d,EAAOvhB,UAAUsiB,MAAQ,SAAgBjjB,GACvC,OAAOA,EAAImX,KAAK7X,KAAKqQ,IASvB1Q,EAASojB,EAAMH,GAEfG,EAAK1hB,UAAU4B,MAAQ,SAAgBqG,EAAOua,GAK5C,IAHA,IAAI7G,EAAO,QAEP8G,EAASnW,KAAKC,IAAItE,EAAMzH,OAAQ,GAC3BK,EAAI,EAAGA,EAAI4hB,EAAQ5hB,IAC1B2hB,EAAOxW,MAAMnL,GAAKoH,EAAM+D,MAAMnL,GAIhC,GAFA2hB,EAAOhiB,OAASiiB,EAEZxa,EAAMzH,QAAU,EAGlB,OAFAyH,EAAM+D,MAAM,GAAK,OACjB/D,EAAMzH,OAAS,GAKjB,IAAIkiB,EAAOza,EAAM+D,MAAM,GAGvB,IAFAwW,EAAOxW,MAAMwW,EAAOhiB,UAAYkiB,EAAO/G,EAElC9a,EAAI,GAAIA,EAAIoH,EAAMzH,OAAQK,IAAK,CAClC,IAAI8hB,EAAwB,EAAjB1a,EAAM+D,MAAMnL,GACvBoH,EAAM+D,MAAMnL,EAAI,KAAQ8hB,EAAOhH,IAAS,EAAM+G,IAAS,GACvDA,EAAOC,EAETD,KAAU,GACVza,EAAM+D,MAAMnL,EAAI,IAAM6hB,EACT,IAATA,GAAcza,EAAMzH,OAAS,GAC/ByH,EAAMzH,QAAU,GAEhByH,EAAMzH,QAAU,GAIpBkhB,EAAK1hB,UAAUsiB,MAAQ,SAAgBjjB,GAErCA,EAAI2M,MAAM3M,EAAImB,QAAU,EACxBnB,EAAI2M,MAAM3M,EAAImB,OAAS,GAAK,EAC5BnB,EAAImB,QAAU,EAId,IADA,IAAIsO,EAAK,EACAjO,EAAI,EAAGA,EAAIxB,EAAImB,OAAQK,IAAK,CACnC,IAAIwM,EAAmB,EAAfhO,EAAI2M,MAAMnL,GAClBiO,GAAU,IAAJzB,EACNhO,EAAI2M,MAAMnL,GAAU,SAALiO,EACfA,EAAS,GAAJzB,GAAayB,EAAK,SAAa,GAUtC,OANkC,IAA9BzP,EAAI2M,MAAM3M,EAAImB,OAAS,KACzBnB,EAAImB,SAC8B,IAA9BnB,EAAI2M,MAAM3M,EAAImB,OAAS,IACzBnB,EAAImB,UAGDnB,GASTf,EAASqjB,EAAMJ,GAQfjjB,EAASsjB,EAAML,GASfjjB,EAASujB,EAAQN,GAEjBM,EAAO7hB,UAAUsiB,MAAQ,SAAgBjjB,GAGvC,IADA,IAAI0P,EAAQ,EACHlO,EAAI,EAAGA,EAAIxB,EAAImB,OAAQK,IAAK,CACnC,IAAI4P,EAA0B,IAAL,EAAfpR,EAAI2M,MAAMnL,IAAiBkO,EACjCD,EAAU,SAAL2B,EACTA,KAAQ,GAERpR,EAAI2M,MAAMnL,GAAKiO,EACfC,EAAQ0B,EAKV,OAHc,IAAV1B,IACF1P,EAAI2M,MAAM3M,EAAImB,UAAYuO,GAErB1P,GAITsM,EAAGoW,OAAS,SAAgBljB,GAE1B,GAAIqiB,EAAOriB,GAAO,OAAOqiB,EAAOriB,GAEhC,IAAIijB,EACJ,GAAa,SAATjjB,EACFijB,EAAQ,IAAIJ,OACP,GAAa,SAAT7iB,EACTijB,EAAQ,IAAIH,OACP,GAAa,SAAT9iB,EACTijB,EAAQ,IAAIF,MACP,IAAa,WAAT/iB,EAGT,MAAM,IAAI+I,MAAM,iBAAmB/I,GAFnCijB,EAAQ,IAAID,EAMd,OAFAX,EAAOriB,GAAQijB,EAERA,GAkBTrC,EAAIzf,UAAU2gB,SAAW,SAAmB/R,GAC1C9I,EAAsB,IAAf8I,EAAE7C,SAAgB,iCACzBjG,EAAO8I,EAAE3C,IAAK,oCAGhBwT,EAAIzf,UAAUwgB,SAAW,SAAmB5R,EAAGC,GAC7C/I,EAAqC,KAA7B8I,EAAE7C,SAAW8C,EAAE9C,UAAiB,iCACxCjG,EAAO8I,EAAE3C,KAAO2C,EAAE3C,MAAQ4C,EAAE5C,IAC1B,oCAGJwT,EAAIzf,UAAUiiB,KAAO,SAAerT,GAClC,OAAIjQ,KAAKmjB,MAAcnjB,KAAKmjB,MAAMM,QAAQxT,GAAGiR,UAAUlhB,MAChDiQ,EAAEwO,KAAKze,KAAKob,GAAG8F,UAAUlhB,OAGlC8gB,EAAIzf,UAAUqR,IAAM,SAAczC,GAChC,OAAIA,EAAEW,SACGX,EAAE5H,QAGJrI,KAAKob,EAAEvH,IAAI5D,GAAGiR,UAAUlhB,OAGjC8gB,EAAIzf,UAAUuS,IAAM,SAAc3D,EAAGC,GACnClQ,KAAK6hB,SAAS5R,EAAGC,GAEjB,IAAIjR,EAAMgR,EAAE2D,IAAI1D,GAIhB,OAHIjR,EAAIkP,IAAInO,KAAKob,IAAM,GACrBnc,EAAI0U,KAAK3T,KAAKob,GAETnc,EAAIiiB,UAAUlhB,OAGvB8gB,EAAIzf,UAAUqS,KAAO,SAAezD,EAAGC,GACrClQ,KAAK6hB,SAAS5R,EAAGC,GAEjB,IAAIjR,EAAMgR,EAAEyD,KAAKxD,GAIjB,OAHIjR,EAAIkP,IAAInO,KAAKob,IAAM,GACrBnc,EAAI0U,KAAK3T,KAAKob,GAETnc,GAGT6hB,EAAIzf,UAAUwS,IAAM,SAAc5D,EAAGC,GACnClQ,KAAK6hB,SAAS5R,EAAGC,GAEjB,IAAIjR,EAAMgR,EAAE4D,IAAI3D,GAIhB,OAHIjR,EAAI+gB,KAAK,GAAK,GAChB/gB,EAAIyU,KAAK1T,KAAKob,GAETnc,EAAIiiB,UAAUlhB,OAGvB8gB,EAAIzf,UAAUsS,KAAO,SAAe1D,EAAGC,GACrClQ,KAAK6hB,SAAS5R,EAAGC,GAEjB,IAAIjR,EAAMgR,EAAE0D,KAAKzD,GAIjB,OAHIjR,EAAI+gB,KAAK,GAAK,GAChB/gB,EAAIyU,KAAK1T,KAAKob,GAETnc,GAGT6hB,EAAIzf,UAAUsgB,IAAM,SAAc1R,EAAGvP,GAEnC,OADAV,KAAKgiB,SAAS/R,GACPjQ,KAAKsjB,KAAKrT,EAAEmN,MAAM1c,KAG3BogB,EAAIzf,UAAUwW,KAAO,SAAe5H,EAAGC,GAErC,OADAlQ,KAAK6hB,SAAS5R,EAAGC,GACVlQ,KAAKsjB,KAAKrT,EAAE4H,KAAK3H,KAG1B4Q,EAAIzf,UAAU0M,IAAM,SAAckC,EAAGC,GAEnC,OADAlQ,KAAK6hB,SAAS5R,EAAGC,GACVlQ,KAAKsjB,KAAKrT,EAAElC,IAAImC,KAGzB4Q,EAAIzf,UAAUkb,KAAO,SAAetM,GAClC,OAAOjQ,KAAK6X,KAAK5H,EAAGA,EAAE5H,UAGxByY,EAAIzf,UAAUib,IAAM,SAAcrM,GAChC,OAAOjQ,KAAK+N,IAAIkC,EAAGA,IAGrB6Q,EAAIzf,UAAU8gB,KAAO,SAAelS,GAClC,GAAIA,EAAEW,SAAU,OAAOX,EAAE5H,QAEzB,IAAI4b,EAAOjkB,KAAKob,EAAE5J,MAAM,GAIxB,GAHArK,EAAO8c,EAAO,IAAM,GAGP,IAATA,EAAY,CACd,IAAI9U,EAAMnP,KAAKob,EAAExH,IAAI,IAAI5G,EAAG,IAAIyE,OAAO,GACvC,OAAOzR,KAAKmP,IAAIc,EAAGd,GAMrB,IAAIoC,EAAIvR,KAAKob,EAAEuC,KAAK,GAChBrD,EAAI,EACR,OAAQ/I,EAAEX,UAA2B,IAAfW,EAAEC,MAAM,GAC5B8I,IACA/I,EAAEE,OAAO,GAEXtK,GAAQoK,EAAEX,UAEV,IAAIsT,EAAM,IAAIlX,EAAG,GAAG+T,MAAM/gB,MACtBmkB,EAAOD,EAAI7B,SAIX+B,EAAOpkB,KAAKob,EAAEuC,KAAK,GAAGlM,OAAO,GAC7B4S,EAAIrkB,KAAKob,EAAExL,YACfyU,EAAI,IAAIrX,EAAG,EAAIqX,EAAIA,GAAGtD,MAAM/gB,MAE5B,MAAuC,IAAhCA,KAAKmP,IAAIkV,EAAGD,GAAMjW,IAAIgW,GAC3BE,EAAE9C,QAAQ4C,GAGZ,IAAItW,EAAI7N,KAAKmP,IAAIkV,EAAG9S,GAChB9D,EAAIzN,KAAKmP,IAAIc,EAAGsB,EAAEmM,KAAK,GAAGjM,OAAO,IACjCG,EAAI5R,KAAKmP,IAAIc,EAAGsB,GAChB6J,EAAId,EACR,MAAsB,IAAf1I,EAAEzD,IAAI+V,GAAY,CAEvB,IADA,IAAIrB,EAAMjR,EACD1P,EAAI,EAAoB,IAAjB2gB,EAAI1U,IAAI+V,GAAYhiB,IAClC2gB,EAAMA,EAAId,SAEZ5a,EAAOjF,EAAIkZ,GACX,IAAIlL,EAAIlQ,KAAKmP,IAAItB,EAAG,IAAIb,EAAG,GAAGwP,OAAOpB,EAAIlZ,EAAI,IAE7CuL,EAAIA,EAAEmU,OAAO1R,GACbrC,EAAIqC,EAAE6R,SACNnQ,EAAIA,EAAEgQ,OAAO/T,GACbuN,EAAIlZ,EAGN,OAAOuL,GAGTqT,EAAIzf,UAAU4e,KAAO,SAAehQ,GAClC,IAAIqU,EAAMrU,EAAE2P,OAAO5f,KAAKob,GACxB,OAAqB,IAAjBkJ,EAAIlX,UACNkX,EAAIlX,SAAW,EACRpN,KAAKsjB,KAAKgB,GAAKjC,UAEfriB,KAAKsjB,KAAKgB,IAIrBxD,EAAIzf,UAAU8N,IAAM,SAAcc,EAAGvP,GACnC,GAAIA,EAAIkQ,SAAU,OAAO,IAAI5D,EAAG,GAAG+T,MAAM/gB,MACzC,GAAoB,IAAhBU,EAAIsf,KAAK,GAAU,OAAO/P,EAAE5H,QAEhC,IAAIkc,EAAa,EACbC,EAAM,IAAIthB,MAAM,GAAKqhB,GACzBC,EAAI,GAAK,IAAIxX,EAAG,GAAG+T,MAAM/gB,MACzBwkB,EAAI,GAAKvU,EACT,IAAK,IAAI/N,EAAI,EAAGA,EAAIsiB,EAAI3iB,OAAQK,IAC9BsiB,EAAItiB,GAAKlC,KAAK+N,IAAIyW,EAAItiB,EAAI,GAAI+N,GAGhC,IAAIhR,EAAMulB,EAAI,GACVC,EAAU,EACVC,EAAa,EACbta,EAAQ1J,EAAIkP,YAAc,GAK9B,IAJc,IAAVxF,IACFA,EAAQ,IAGLlI,EAAIxB,EAAImB,OAAS,EAAGK,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAI8M,EAAOtO,EAAI2M,MAAMnL,GACZC,EAAIiI,EAAQ,EAAGjI,GAAK,EAAGA,IAAK,CACnC,IAAI0N,EAAOb,GAAQ7M,EAAK,EACpBlD,IAAQulB,EAAI,KACdvlB,EAAMe,KAAKsc,IAAIrd,IAGL,IAAR4Q,GAAyB,IAAZ4U,GAKjBA,IAAY,EACZA,GAAW5U,EACX6U,KACIA,IAAeH,GAAqB,IAANriB,GAAiB,IAANC,KAE7ClD,EAAMe,KAAK+N,IAAI9O,EAAKulB,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,EAajBta,EAAQ,GAGV,OAAOnL,GAGT6hB,EAAIzf,UAAU4f,UAAY,SAAoBvgB,GAC5C,IAAI+M,EAAI/M,EAAI+d,KAAKze,KAAKob,GAEtB,OAAO3N,IAAM/M,EAAM+M,EAAEpF,QAAUoF,GAGjCqT,EAAIzf,UAAU+f,YAAc,SAAsB1gB,GAChD,IAAIzB,EAAMyB,EAAI2H,QAEd,OADApJ,EAAIqO,IAAM,KACHrO,GAOT+N,EAAG2X,KAAO,SAAejkB,GACvB,OAAO,IAAI2iB,EAAK3iB,IAmBlBf,EAAS0jB,EAAMvC,GAEfuC,EAAKhiB,UAAU4f,UAAY,SAAoBvgB,GAC7C,OAAOV,KAAKsjB,KAAK5iB,EAAI0c,MAAMpd,KAAK8d,SAGlCuF,EAAKhiB,UAAU+f,YAAc,SAAsB1gB,GACjD,IAAI+M,EAAIzN,KAAKsjB,KAAK5iB,EAAIqN,IAAI/N,KAAKujB,OAE/B,OADA9V,EAAEH,IAAM,KACDG,GAGT4V,EAAKhiB,UAAUwW,KAAO,SAAe5H,EAAGC,GACtC,GAAID,EAAEW,UAAYV,EAAEU,SAGlB,OAFAX,EAAE5C,MAAM,GAAK,EACb4C,EAAEpO,OAAS,EACJoO,EAGT,IAAI2B,EAAI3B,EAAE4H,KAAK3H,GACXrC,EAAI+D,EAAE4L,MAAMxd,KAAK8d,OAAO/P,IAAI/N,KAAKwjB,MAAMjG,OAAOvd,KAAK8d,OAAO/P,IAAI/N,KAAKob,GACnEwJ,EAAIhT,EAAE+B,KAAK9F,GAAG4D,OAAOzR,KAAK8d,OAC1B7e,EAAM2lB,EAQV,OANIA,EAAEzW,IAAInO,KAAKob,IAAM,EACnBnc,EAAM2lB,EAAEjR,KAAK3T,KAAKob,GACTwJ,EAAE5E,KAAK,GAAK,IACrB/gB,EAAM2lB,EAAElR,KAAK1T,KAAKob,IAGbnc,EAAIiiB,UAAUlhB,OAGvBqjB,EAAKhiB,UAAU0M,IAAM,SAAckC,EAAGC,GACpC,GAAID,EAAEW,UAAYV,EAAEU,SAAU,OAAO,IAAI5D,EAAG,GAAGkU,UAAUlhB,MAEzD,IAAI4R,EAAI3B,EAAElC,IAAImC,GACVrC,EAAI+D,EAAE4L,MAAMxd,KAAK8d,OAAO/P,IAAI/N,KAAKwjB,MAAMjG,OAAOvd,KAAK8d,OAAO/P,IAAI/N,KAAKob,GACnEwJ,EAAIhT,EAAE+B,KAAK9F,GAAG4D,OAAOzR,KAAK8d,OAC1B7e,EAAM2lB,EAOV,OANIA,EAAEzW,IAAInO,KAAKob,IAAM,EACnBnc,EAAM2lB,EAAEjR,KAAK3T,KAAKob,GACTwJ,EAAE5E,KAAK,GAAK,IACrB/gB,EAAM2lB,EAAElR,KAAK1T,KAAKob,IAGbnc,EAAIiiB,UAAUlhB,OAGvBqjB,EAAKhiB,UAAU4e,KAAO,SAAehQ,GAEnC,IAAIhR,EAAMe,KAAKsjB,KAAKrT,EAAE2P,OAAO5f,KAAKob,GAAGrN,IAAI/N,KAAK6e,KAC9C,OAAO5f,EAAIiiB,UAAUlhB,QAt2GzB,CAw2GoCoB,EAAQpB,Q,2DCt2G5C,MAAML,EAAW,EAAQ,QAEnBsH,EAAS,EAAQ,QACjBpB,EAAgB,EAAQ,QAAkBA,cAC1ChG,EAAO,EAAQ,QAGfN,EAAM,EAAQ,QAEpB,SAAS2M,EAAWnM,GAClBC,KAAKC,IAAM,MACXD,KAAKE,KAAOH,EAAOG,KACnBF,KAAKD,OAASA,EAGdC,KAAKG,KAAO,IAAIC,EAChBJ,KAAKG,KAAKE,MAAMN,EAAOO,MAczB,SAASF,EAAQG,GACfV,EAAKW,KAAKR,KAAM,MAAOO,GA8OzB,SAASskB,EAAatiB,EAAKqE,GACzB,IAAIhG,EAAM2B,EAAIkE,UAAUG,GACxB,GAAIrE,EAAIuH,QAAQlJ,GACd,OAAOA,EAET,MAAME,EAAMvB,EAAIsM,SAASjL,GAAO,GAC1BC,EAA6B,KAAV,GAAND,GAGnB,GAAqB,MAAV,GAANA,GAAsB,CACzB,IAAIkkB,EAAMlkB,EACVA,EAAM,EACN,MAAwB,OAAV,IAANkkB,GAAsB,CAE5B,GADAA,EAAMviB,EAAIkE,UAAUG,GAChBrE,EAAIuH,QAAQgb,GACd,OAAOA,EAETlkB,IAAQ,EACRA,GAAa,IAANkkB,QAGTlkB,GAAO,GAET,MAAMmkB,EAASxlB,EAAIqB,IAAIA,GAEvB,MAAO,CACLE,IAAKA,EACLD,UAAWA,EACXD,IAAKA,EACLmkB,OAAQA,GAIZ,SAASC,EAAaziB,EAAK1B,EAAW+F,GACpC,IAAI8G,EAAMnL,EAAIkE,UAAUG,GACxB,GAAIrE,EAAIuH,QAAQ4D,GACd,OAAOA,EAGT,IAAK7M,GAAqB,MAAR6M,EAChB,OAAO,KAGT,GAAqB,KAAV,IAANA,GAEH,OAAOA,EAIT,MAAMhN,EAAY,IAANgN,EACZ,GAAIhN,EAAM,EACR,OAAO6B,EAAIrB,MAAM,6BAEnBwM,EAAM,EACN,IAAK,IAAIxL,EAAI,EAAGA,EAAIxB,EAAKwB,IAAK,CAC5BwL,IAAQ,EACR,MAAMvL,EAAII,EAAIkE,UAAUG,GACxB,GAAIrE,EAAIuH,QAAQ3H,GACd,OAAOA,EACTuL,GAAOvL,EAGT,OAAOuL,EAzTTtM,EAAOtC,QAAUoN,EAEjBA,EAAW7K,UAAU+K,OAAS,SAAgB7K,EAAMwE,GAKlD,OAJKF,EAAcM,gBAAgB5E,KACjCA,EAAO,IAAIsE,EAActE,EAAMwE,IAG1B/F,KAAKG,KAAKkJ,QAAQ9H,EAAMwE,IAQjCpG,EAASS,EAASP,GAElBO,EAAQiB,UAAUwI,SAAW,SAAiBob,EAAQrkB,EAAKiH,GACzD,GAAIod,EAAOze,UACT,OAAO,EAET,MAAMlB,EAAQ2f,EAAO3e,OACf4e,EAAaL,EAAaI,EAAQ,wBAA0BrkB,EAAM,KACxE,OAAIqkB,EAAOnb,QAAQob,GACVA,GAETD,EAAO1e,QAAQjB,GAER4f,EAAWtkB,MAAQA,GAAOskB,EAAWH,SAAWnkB,GACpDskB,EAAWH,OAAS,OAAUnkB,GAAOiH,IAG1CzH,EAAQiB,UAAU8I,WAAa,SAAmB8a,EAAQrkB,EAAKiH,GAC7D,MAAMqd,EAAaL,EAAaI,EAC9B,4BAA8BrkB,EAAM,KACtC,GAAIqkB,EAAOnb,QAAQob,GACjB,OAAOA,EAET,IAAIxX,EAAMsX,EAAaC,EACrBC,EAAWrkB,UACX,4BAA8BD,EAAM,KAGtC,GAAIqkB,EAAOnb,QAAQ4D,GACjB,OAAOA,EAET,IAAK7F,GACDqd,EAAWtkB,MAAQA,GACnBskB,EAAWH,SAAWnkB,GACtBskB,EAAWH,OAAS,OAASnkB,EAC/B,OAAOqkB,EAAO/jB,MAAM,yBAA2BN,EAAM,KAGvD,GAAIskB,EAAWrkB,WAAqB,OAAR6M,EAC1B,OAAOuX,EAAOve,KAAKgH,EAAK,6BAA+B9M,EAAM,KAG/D,MAAM0E,EAAQ2f,EAAO3e,OACfrH,EAAMe,KAAKmlB,cACfF,EACA,2CAA6CjlB,KAAKY,IAAM,KAC1D,OAAIqkB,EAAOnb,QAAQ7K,GACVA,GAETyO,EAAMuX,EAAOthB,OAAS2B,EAAM3B,OAC5BshB,EAAO1e,QAAQjB,GACR2f,EAAOve,KAAKgH,EAAK,6BAA+B9M,EAAM,OAG/DR,EAAQiB,UAAU8jB,cAAgB,SAAsBF,EAAQre,GAC9D,OAAS,CACP,MAAMhG,EAAMikB,EAAaI,EAAQre,GACjC,GAAIqe,EAAOnb,QAAQlJ,GACjB,OAAOA,EACT,MAAM8M,EAAMsX,EAAaC,EAAQrkB,EAAIC,UAAW+F,GAChD,GAAIqe,EAAOnb,QAAQ4D,GACjB,OAAOA,EAET,IAAIzO,EAOJ,GALEA,EADE2B,EAAIC,WAAqB,OAAR6M,EACbuX,EAAOve,KAAKgH,GAEZ1N,KAAKmlB,cAAcF,EAAQre,GAG/Bqe,EAAOnb,QAAQ7K,GACjB,OAAOA,EAET,GAAmB,QAAf2B,EAAImkB,OACN,QAIN3kB,EAAQiB,UAAUsJ,YAAc,SAAoBsa,EAAQrkB,EAAKwkB,EAC/Drf,GACA,MAAM0D,EAAS,GACf,OAAQwb,EAAOze,UAAW,CACxB,MAAM6e,EAAcrlB,KAAK6J,SAASob,EAAQ,OAC1C,GAAIA,EAAOnb,QAAQub,GACjB,OAAOA,EAET,MAAMpmB,EAAMmmB,EAAQhZ,OAAO6Y,EAAQ,MAAOlf,GAC1C,GAAIkf,EAAOnb,QAAQ7K,IAAQomB,EACzB,MACF5b,EAAOhB,KAAKxJ,GAEd,OAAOwK,GAGTrJ,EAAQiB,UAAUuJ,WAAa,SAAmBqa,EAAQrkB,GACxD,GAAY,WAARA,EAAkB,CACpB,MAAM0B,EAAS2iB,EAAOxe,YACtB,OAAIwe,EAAOnb,QAAQxH,GACVA,EACF,CAAEA,OAAQA,EAAQf,KAAM0jB,EAAOte,OACjC,GAAY,WAAR/F,EAAkB,CAC3B,MAAM+F,EAAMse,EAAOte,MACnB,GAAIA,EAAI9E,OAAS,IAAM,EACrB,OAAOojB,EAAO/jB,MAAM,mDAEtB,IAAImB,EAAM,GACV,IAAK,IAAIH,EAAI,EAAGA,EAAIyE,EAAI9E,OAAS,EAAGK,IAClCG,GAAOijB,OAAOC,aAAa5e,EAAI6e,aAAiB,EAAJtjB,IAE9C,OAAOG,EACF,GAAY,WAARzB,EAAkB,CAC3B,MAAM6kB,EAASR,EAAOte,MAAM+E,SAAS,SACrC,OAAK1L,KAAK0C,UAAU+iB,GAIbA,EAHER,EAAO/jB,MAAM,0DAIjB,GAAY,WAARN,EACT,OAAOqkB,EAAOte,MACT,GAAY,YAAR/F,EACT,OAAOqkB,EAAOte,MACT,GAAY,aAAR/F,EAAoB,CAC7B,MAAM8kB,EAAWT,EAAOte,MAAM+E,SAAS,SACvC,OAAK1L,KAAK2C,YAAY+iB,GAIfA,EAHET,EAAO/jB,MAAM,4DAIjB,MAAI,OAAO0B,KAAKhC,GACdqkB,EAAOte,MAAM+E,WAEbuZ,EAAO/jB,MAAM,4BAA8BN,EAAM,iBAI5DR,EAAQiB,UAAUwJ,aAAe,SAAqBoa,EAAQliB,EAAQC,GACpE,IAAIyG,EACJ,MAAMkc,EAAc,GACpB,IAAIliB,EAAQ,EACRmiB,EAAW,EACf,OAAQX,EAAOze,UACbof,EAAWX,EAAOxe,YAClBhD,IAAU,EACVA,GAAoB,IAAXmiB,EACiB,KAAV,IAAXA,KACHD,EAAYld,KAAKhF,GACjBA,EAAQ,GAGG,IAAXmiB,GACFD,EAAYld,KAAKhF,GAEnB,MAAMoiB,EAASF,EAAY,GAAK,GAAM,EAChCG,EAASH,EAAY,GAAK,GAOhC,GAJElc,EADEzG,EACO2iB,EAEA,CAACE,EAAOC,GAAQxe,OAAOqe,EAAYviB,MAAM,IAEhDL,EAAQ,CACV,IAAI8f,EAAM9f,EAAO0G,EAAOhI,KAAK,WACjB+D,IAARqd,IACFA,EAAM9f,EAAO0G,EAAOhI,KAAK,YACf+D,IAARqd,IACFpZ,EAASoZ,GAGb,OAAOpZ,GAGTrJ,EAAQiB,UAAUyJ,YAAc,SAAoBma,EAAQrkB,GAC1D,MAAMyB,EAAM4iB,EAAOte,MAAM+E,WAEzB,IAAIqa,EACAC,EACAC,EACAC,EACAtY,EACAuY,EACJ,GAAY,YAARvlB,EACFmlB,EAAyB,EAAlB1jB,EAAIe,MAAM,EAAG,GACpB4iB,EAAwB,EAAlB3jB,EAAIe,MAAM,EAAG,GACnB6iB,EAAwB,EAAlB5jB,EAAIe,MAAM,EAAG,GACnB8iB,EAA0B,EAAnB7jB,EAAIe,MAAM,EAAG,IACpBwK,EAA0B,EAApBvL,EAAIe,MAAM,GAAI,IACpB+iB,EAA0B,EAApB9jB,EAAIe,MAAM,GAAI,QACf,IAAY,YAARxC,EAYT,OAAOqkB,EAAO/jB,MAAM,YAAcN,EAAM,8BAXxCmlB,EAAyB,EAAlB1jB,EAAIe,MAAM,EAAG,GACpB4iB,EAAwB,EAAlB3jB,EAAIe,MAAM,EAAG,GACnB6iB,EAAwB,EAAlB5jB,EAAIe,MAAM,EAAG,GACnB8iB,EAAyB,EAAlB7jB,EAAIe,MAAM,EAAG,GACpBwK,EAAyB,EAAnBvL,EAAIe,MAAM,EAAG,IACnB+iB,EAA0B,EAApB9jB,EAAIe,MAAM,GAAI,IAElB2iB,EADEA,EAAO,GACF,IAAOA,EAEP,KAAOA,EAKlB,OAAOhiB,KAAKqiB,IAAIL,EAAMC,EAAM,EAAGC,EAAKC,EAAMtY,EAAKuY,EAAK,IAGtD/lB,EAAQiB,UAAU0J,YAAc,WAC9B,OAAO,MAGT3K,EAAQiB,UAAU2J,YAAc,SAAoBia,GAClD,MAAMhmB,EAAMgmB,EAAOxe,YACnB,OAAIwe,EAAOnb,QAAQ7K,GACVA,EAEQ,IAARA,GAGXmB,EAAQiB,UAAU4J,WAAa,SAAmBga,EAAQliB,GAExD,MAAM4D,EAAMse,EAAOte,MACnB,IAAI1H,EAAM,IAAIgI,EAAON,GAKrB,OAHI5D,IACF9D,EAAM8D,EAAO9D,EAAIyM,SAAS,MAAQzM,GAE7BA,GAGTmB,EAAQiB,UAAU4D,KAAO,SAAalF,EAAQmF,GAG5C,MAFsB,oBAAXnF,IACTA,EAASA,EAAOmF,IACXnF,EAAOsmB,YAAY,OAAOlmB,O,kCCxQnC,MAAMR,EAAW,EAAQ,QAEzB,SAASiG,EAASG,GAChB/F,KAAK8G,eAAiB,CACpB5B,IAAK,KACLoF,KAAM,GACNvE,QAASA,GAAW,GACpBugB,OAAQ,IA6FZ,SAASC,EAAcjc,EAAMqC,GAC3B3M,KAAKsK,KAAOA,EACZtK,KAAKwmB,QAAQ7Z,GA5Ff7N,EAAQ8G,SAAWA,EAEnBA,EAASvE,UAAUyI,QAAU,SAAiB5E,GAC5C,OAAOA,aAAeqhB,GAGxB3gB,EAASvE,UAAUiF,KAAO,WACxB,MAAMhB,EAAQtF,KAAK8G,eAEnB,MAAO,CAAE5B,IAAKI,EAAMJ,IAAKuhB,QAASnhB,EAAMgF,KAAKzI,SAG/C+D,EAASvE,UAAUkF,QAAU,SAAiBhF,GAC5C,MAAM+D,EAAQtF,KAAK8G,eAEnBxB,EAAMJ,IAAM3D,EAAK2D,IACjBI,EAAMgF,KAAOhF,EAAMgF,KAAKlH,MAAM,EAAG7B,EAAKklB,UAGxC7gB,EAASvE,UAAUuI,SAAW,SAAkBvK,GAC9C,OAAOW,KAAK8G,eAAewD,KAAK7B,KAAKpJ,IAGvCuG,EAASvE,UAAUoJ,QAAU,SAAiBic,GAC5C,MAAMphB,EAAQtF,KAAK8G,eAEnBxB,EAAMgF,KAAOhF,EAAMgF,KAAKlH,MAAM,EAAGsjB,EAAQ,IAG3C9gB,EAASvE,UAAUqJ,SAAW,SAAkBgc,EAAOrnB,EAAKC,GAC1D,MAAMgG,EAAQtF,KAAK8G,eAEnB9G,KAAKyK,QAAQic,GACK,OAAdphB,EAAMJ,MACRI,EAAMJ,IAAI7F,GAAOC,IAGrBsG,EAASvE,UAAUiJ,KAAO,WACxB,OAAOtK,KAAK8G,eAAewD,KAAK7I,KAAK,MAGvCmE,EAASvE,UAAU6I,YAAc,WAC/B,MAAM5E,EAAQtF,KAAK8G,eAEbid,EAAOze,EAAMJ,IAEnB,OADAI,EAAMJ,IAAM,GACL6e,GAGTne,EAASvE,UAAUmJ,YAAc,SAAqBuZ,GACpD,MAAMze,EAAQtF,KAAK8G,eAEb6f,EAAMrhB,EAAMJ,IAElB,OADAI,EAAMJ,IAAM6e,EACL4C,GAGT/gB,EAASvE,UAAUH,MAAQ,SAAeyL,GACxC,IAAIia,EACJ,MAAMthB,EAAQtF,KAAK8G,eAEb+f,EAAYla,aAAe4Z,EASjC,GAPEK,EADEC,EACIla,EAEA,IAAI4Z,EAAcjhB,EAAMgF,KAAKtL,KAAI,SAAS8nB,GAC9C,MAAO,IAAMzjB,KAAKC,UAAUwjB,GAAQ,OACnCrlB,KAAK,IAAKkL,EAAIoa,SAAWpa,EAAKA,EAAIqa,QAGlC1hB,EAAMS,QAAQkhB,QACjB,MAAML,EAKR,OAHKC,GACHvhB,EAAMghB,OAAO7d,KAAKme,GAEbA,GAGThhB,EAASvE,UAAUkI,WAAa,SAAoBE,GAClD,MAAMnE,EAAQtF,KAAK8G,eACnB,OAAKxB,EAAMS,QAAQkhB,QAGZ,CACLxd,OAAQzJ,KAAK8J,QAAQL,GAAU,KAAOA,EACtC6c,OAAQhhB,EAAMghB,QAJP7c,GAYX9J,EAAS4mB,EAAetd,OAExBsd,EAAcllB,UAAUmlB,QAAU,SAAiB7Z,GAKjD,GAJA3M,KAAK+mB,QAAUpa,EAAM,SAAW3M,KAAKsK,MAAQ,aACzCrB,MAAMie,mBACRje,MAAMie,kBAAkBlnB,KAAMumB,IAE3BvmB,KAAKgnB,MACR,IAEE,MAAM,IAAI/d,MAAMjJ,KAAK+mB,SACrB,MAAO9c,GACPjK,KAAKgnB,MAAQ/c,EAAE+c,MAGnB,OAAOhnB,O,kCCvHT,MAAMN,EAAW,EAAQ,QACnBF,EAAW,EAAQ,SACnBG,EAAW,EAAQ,QAEnBwnB,EAAMroB,EAMZ,SAASsoB,EAAOlnB,EAAMI,GACpBN,KAAKE,KAAOA,EACZF,KAAKM,KAAOA,EAEZN,KAAKR,SAAW,GAChBQ,KAAKN,SAAW,GATlBynB,EAAIjgB,OAAS,SAAgBhH,EAAMI,GACjC,OAAO,IAAI8mB,EAAOlnB,EAAMI,IAW1B8mB,EAAO/lB,UAAUgmB,aAAe,SAAqBC,GACnD,MAAMpnB,EAAOF,KAAKE,KAElB,SAASqnB,EAAUxnB,GACjBC,KAAKwnB,WAAWznB,EAAQG,GAO1B,OALAP,EAAS4nB,EAAWD,GACpBC,EAAUlmB,UAAUmmB,WAAa,SAAoBznB,EAAQG,GAC3DonB,EAAK9mB,KAAKR,KAAMD,EAAQG,IAGnB,IAAIqnB,EAAUvnB,OAGvBonB,EAAO/lB,UAAUglB,YAAc,SAAqBpmB,GAKlD,OAJAA,EAAMA,GAAO,MAERD,KAAKR,SAASyB,eAAehB,KAChCD,KAAKR,SAASS,GAAOD,KAAKqnB,aAAa7nB,EAASS,KAC3CD,KAAKR,SAASS,IAGvBmnB,EAAO/lB,UAAU+K,OAAS,SAAgB7K,EAAMtB,EAAK8F,GACnD,OAAO/F,KAAKqmB,YAAYpmB,GAAKmM,OAAO7K,EAAMwE,IAG5CqhB,EAAO/lB,UAAU8D,YAAc,SAAqBlF,GAKlD,OAJAA,EAAMA,GAAO,MAERD,KAAKN,SAASuB,eAAehB,KAChCD,KAAKN,SAASO,GAAOD,KAAKqnB,aAAa3nB,EAASO,KAC3CD,KAAKN,SAASO,IAGvBmnB,EAAO/lB,UAAUC,OAAS,SAAgBC,EAAMtB,EAAoBc,GAClE,OAAOf,KAAKmF,YAAYlF,GAAKqB,OAAOC,EAAMR","file":"js/chunk-vendors~b51e15da.7b80a816.js","sourcesContent":["'use strict';\n\nconst constants = exports;\n\n// Helper\nconstants._reverse = function reverse(map) {\n  const res = {};\n\n  Object.keys(map).forEach(function(key) {\n    // Convert key to integer if it is stringified\n    if ((key | 0) == key)\n      key = key | 0;\n\n    const value = map[key];\n    res[value] = key;\n  });\n\n  return res;\n};\n\nconstants.der = require('./der');\n","'use strict';\n\nconst decoders = exports;\n\ndecoders.der = require('./der');\ndecoders.pem = require('./pem');\n","'use strict';\n\nconst encoders = exports;\n\nencoders.der = require('./der');\nencoders.pem = require('./pem');\n","'use strict';\n\nconst inherits = require('inherits');\nconst Buffer = require('safer-buffer').Buffer;\nconst Node = require('../base/node');\n\n// Import DER constants\nconst der = require('../constants/der');\n\nfunction DEREncoder(entity) {\n  this.enc = 'der';\n  this.name = entity.name;\n  this.entity = entity;\n\n  // Construct base tree\n  this.tree = new DERNode();\n  this.tree._init(entity.body);\n}\nmodule.exports = DEREncoder;\n\nDEREncoder.prototype.encode = function encode(data, reporter) {\n  return this.tree._encode(data, reporter).join();\n};\n\n// Tree methods\n\nfunction DERNode(parent) {\n  Node.call(this, 'der', parent);\n}\ninherits(DERNode, Node);\n\nDERNode.prototype._encodeComposite = function encodeComposite(tag,\n  primitive,\n  cls,\n  content) {\n  const encodedTag = encodeTag(tag, primitive, cls, this.reporter);\n\n  // Short form\n  if (content.length < 0x80) {\n    const header = Buffer.alloc(2);\n    header[0] = encodedTag;\n    header[1] = content.length;\n    return this._createEncoderBuffer([ header, content ]);\n  }\n\n  // Long form\n  // Count octets required to store length\n  let lenOctets = 1;\n  for (let i = content.length; i >= 0x100; i >>= 8)\n    lenOctets++;\n\n  const header = Buffer.alloc(1 + 1 + lenOctets);\n  header[0] = encodedTag;\n  header[1] = 0x80 | lenOctets;\n\n  for (let i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8)\n    header[i] = j & 0xff;\n\n  return this._createEncoderBuffer([ header, content ]);\n};\n\nDERNode.prototype._encodeStr = function encodeStr(str, tag) {\n  if (tag === 'bitstr') {\n    return this._createEncoderBuffer([ str.unused | 0, str.data ]);\n  } else if (tag === 'bmpstr') {\n    const buf = Buffer.alloc(str.length * 2);\n    for (let i = 0; i < str.length; i++) {\n      buf.writeUInt16BE(str.charCodeAt(i), i * 2);\n    }\n    return this._createEncoderBuffer(buf);\n  } else if (tag === 'numstr') {\n    if (!this._isNumstr(str)) {\n      return this.reporter.error('Encoding of string type: numstr supports ' +\n                                 'only digits and space');\n    }\n    return this._createEncoderBuffer(str);\n  } else if (tag === 'printstr') {\n    if (!this._isPrintstr(str)) {\n      return this.reporter.error('Encoding of string type: printstr supports ' +\n                                 'only latin upper and lower case letters, ' +\n                                 'digits, space, apostrophe, left and rigth ' +\n                                 'parenthesis, plus sign, comma, hyphen, ' +\n                                 'dot, slash, colon, equal sign, ' +\n                                 'question mark');\n    }\n    return this._createEncoderBuffer(str);\n  } else if (/str$/.test(tag)) {\n    return this._createEncoderBuffer(str);\n  } else if (tag === 'objDesc') {\n    return this._createEncoderBuffer(str);\n  } else {\n    return this.reporter.error('Encoding of string type: ' + tag +\n                               ' unsupported');\n  }\n};\n\nDERNode.prototype._encodeObjid = function encodeObjid(id, values, relative) {\n  if (typeof id === 'string') {\n    if (!values)\n      return this.reporter.error('string objid given, but no values map found');\n    if (!values.hasOwnProperty(id))\n      return this.reporter.error('objid not found in values map');\n    id = values[id].split(/[\\s.]+/g);\n    for (let i = 0; i < id.length; i++)\n      id[i] |= 0;\n  } else if (Array.isArray(id)) {\n    id = id.slice();\n    for (let i = 0; i < id.length; i++)\n      id[i] |= 0;\n  }\n\n  if (!Array.isArray(id)) {\n    return this.reporter.error('objid() should be either array or string, ' +\n                               'got: ' + JSON.stringify(id));\n  }\n\n  if (!relative) {\n    if (id[1] >= 40)\n      return this.reporter.error('Second objid identifier OOB');\n    id.splice(0, 2, id[0] * 40 + id[1]);\n  }\n\n  // Count number of octets\n  let size = 0;\n  for (let i = 0; i < id.length; i++) {\n    let ident = id[i];\n    for (size++; ident >= 0x80; ident >>= 7)\n      size++;\n  }\n\n  const objid = Buffer.alloc(size);\n  let offset = objid.length - 1;\n  for (let i = id.length - 1; i >= 0; i--) {\n    let ident = id[i];\n    objid[offset--] = ident & 0x7f;\n    while ((ident >>= 7) > 0)\n      objid[offset--] = 0x80 | (ident & 0x7f);\n  }\n\n  return this._createEncoderBuffer(objid);\n};\n\nfunction two(num) {\n  if (num < 10)\n    return '0' + num;\n  else\n    return num;\n}\n\nDERNode.prototype._encodeTime = function encodeTime(time, tag) {\n  let str;\n  const date = new Date(time);\n\n  if (tag === 'gentime') {\n    str = [\n      two(date.getUTCFullYear()),\n      two(date.getUTCMonth() + 1),\n      two(date.getUTCDate()),\n      two(date.getUTCHours()),\n      two(date.getUTCMinutes()),\n      two(date.getUTCSeconds()),\n      'Z'\n    ].join('');\n  } else if (tag === 'utctime') {\n    str = [\n      two(date.getUTCFullYear() % 100),\n      two(date.getUTCMonth() + 1),\n      two(date.getUTCDate()),\n      two(date.getUTCHours()),\n      two(date.getUTCMinutes()),\n      two(date.getUTCSeconds()),\n      'Z'\n    ].join('');\n  } else {\n    this.reporter.error('Encoding ' + tag + ' time is not supported yet');\n  }\n\n  return this._encodeStr(str, 'octstr');\n};\n\nDERNode.prototype._encodeNull = function encodeNull() {\n  return this._createEncoderBuffer('');\n};\n\nDERNode.prototype._encodeInt = function encodeInt(num, values) {\n  if (typeof num === 'string') {\n    if (!values)\n      return this.reporter.error('String int or enum given, but no values map');\n    if (!values.hasOwnProperty(num)) {\n      return this.reporter.error('Values map doesn\\'t contain: ' +\n                                 JSON.stringify(num));\n    }\n    num = values[num];\n  }\n\n  // Bignum, assume big endian\n  if (typeof num !== 'number' && !Buffer.isBuffer(num)) {\n    const numArray = num.toArray();\n    if (!num.sign && numArray[0] & 0x80) {\n      numArray.unshift(0);\n    }\n    num = Buffer.from(numArray);\n  }\n\n  if (Buffer.isBuffer(num)) {\n    let size = num.length;\n    if (num.length === 0)\n      size++;\n\n    const out = Buffer.alloc(size);\n    num.copy(out);\n    if (num.length === 0)\n      out[0] = 0;\n    return this._createEncoderBuffer(out);\n  }\n\n  if (num < 0x80)\n    return this._createEncoderBuffer(num);\n\n  if (num < 0x100)\n    return this._createEncoderBuffer([0, num]);\n\n  let size = 1;\n  for (let i = num; i >= 0x100; i >>= 8)\n    size++;\n\n  const out = new Array(size);\n  for (let i = out.length - 1; i >= 0; i--) {\n    out[i] = num & 0xff;\n    num >>= 8;\n  }\n  if(out[0] & 0x80) {\n    out.unshift(0);\n  }\n\n  return this._createEncoderBuffer(Buffer.from(out));\n};\n\nDERNode.prototype._encodeBool = function encodeBool(value) {\n  return this._createEncoderBuffer(value ? 0xff : 0);\n};\n\nDERNode.prototype._use = function use(entity, obj) {\n  if (typeof entity === 'function')\n    entity = entity(obj);\n  return entity._getEncoder('der').tree;\n};\n\nDERNode.prototype._skipDefault = function skipDefault(dataBuffer, reporter, parent) {\n  const state = this._baseState;\n  let i;\n  if (state['default'] === null)\n    return false;\n\n  const data = dataBuffer.join();\n  if (state.defaultBuffer === undefined)\n    state.defaultBuffer = this._encodeValue(state['default'], reporter, parent).join();\n\n  if (data.length !== state.defaultBuffer.length)\n    return false;\n\n  for (i=0; i < data.length; i++)\n    if (data[i] !== state.defaultBuffer[i])\n      return false;\n\n  return true;\n};\n\n// Utility methods\n\nfunction encodeTag(tag, primitive, cls, reporter) {\n  let res;\n\n  if (tag === 'seqof')\n    tag = 'seq';\n  else if (tag === 'setof')\n    tag = 'set';\n\n  if (der.tagByName.hasOwnProperty(tag))\n    res = der.tagByName[tag];\n  else if (typeof tag === 'number' && (tag | 0) === tag)\n    res = tag;\n  else\n    return reporter.error('Unknown tag: ' + tag);\n\n  if (res >= 0x1f)\n    return reporter.error('Multi-octet tag encoding unsupported');\n\n  if (!primitive)\n    res |= 0x20;\n\n  res |= (der.tagClassByName[cls || 'universal'] << 6);\n\n  return res;\n}\n","'use strict';\n\nconst base = exports;\n\nbase.Reporter = require('./reporter').Reporter;\nbase.DecoderBuffer = require('./buffer').DecoderBuffer;\nbase.EncoderBuffer = require('./buffer').EncoderBuffer;\nbase.Node = require('./node');\n","'use strict';\n\nconst inherits = require('inherits');\nconst Reporter = require('../base/reporter').Reporter;\nconst Buffer = require('safer-buffer').Buffer;\n\nfunction DecoderBuffer(base, options) {\n  Reporter.call(this, options);\n  if (!Buffer.isBuffer(base)) {\n    this.error('Input not Buffer');\n    return;\n  }\n\n  this.base = base;\n  this.offset = 0;\n  this.length = base.length;\n}\ninherits(DecoderBuffer, Reporter);\nexports.DecoderBuffer = DecoderBuffer;\n\nDecoderBuffer.isDecoderBuffer = function isDecoderBuffer(data) {\n  if (data instanceof DecoderBuffer) {\n    return true;\n  }\n\n  // Or accept compatible API\n  const isCompatible = typeof data === 'object' &&\n    Buffer.isBuffer(data.base) &&\n    data.constructor.name === 'DecoderBuffer' &&\n    typeof data.offset === 'number' &&\n    typeof data.length === 'number' &&\n    typeof data.save === 'function' &&\n    typeof data.restore === 'function' &&\n    typeof data.isEmpty === 'function' &&\n    typeof data.readUInt8 === 'function' &&\n    typeof data.skip === 'function' &&\n    typeof data.raw === 'function';\n\n  return isCompatible;\n};\n\nDecoderBuffer.prototype.save = function save() {\n  return { offset: this.offset, reporter: Reporter.prototype.save.call(this) };\n};\n\nDecoderBuffer.prototype.restore = function restore(save) {\n  // Return skipped data\n  const res = new DecoderBuffer(this.base);\n  res.offset = save.offset;\n  res.length = this.offset;\n\n  this.offset = save.offset;\n  Reporter.prototype.restore.call(this, save.reporter);\n\n  return res;\n};\n\nDecoderBuffer.prototype.isEmpty = function isEmpty() {\n  return this.offset === this.length;\n};\n\nDecoderBuffer.prototype.readUInt8 = function readUInt8(fail) {\n  if (this.offset + 1 <= this.length)\n    return this.base.readUInt8(this.offset++, true);\n  else\n    return this.error(fail || 'DecoderBuffer overrun');\n};\n\nDecoderBuffer.prototype.skip = function skip(bytes, fail) {\n  if (!(this.offset + bytes <= this.length))\n    return this.error(fail || 'DecoderBuffer overrun');\n\n  const res = new DecoderBuffer(this.base);\n\n  // Share reporter state\n  res._reporterState = this._reporterState;\n\n  res.offset = this.offset;\n  res.length = this.offset + bytes;\n  this.offset += bytes;\n  return res;\n};\n\nDecoderBuffer.prototype.raw = function raw(save) {\n  return this.base.slice(save ? save.offset : this.offset, this.length);\n};\n\nfunction EncoderBuffer(value, reporter) {\n  if (Array.isArray(value)) {\n    this.length = 0;\n    this.value = value.map(function(item) {\n      if (!EncoderBuffer.isEncoderBuffer(item))\n        item = new EncoderBuffer(item, reporter);\n      this.length += item.length;\n      return item;\n    }, this);\n  } else if (typeof value === 'number') {\n    if (!(0 <= value && value <= 0xff))\n      return reporter.error('non-byte EncoderBuffer value');\n    this.value = value;\n    this.length = 1;\n  } else if (typeof value === 'string') {\n    this.value = value;\n    this.length = Buffer.byteLength(value);\n  } else if (Buffer.isBuffer(value)) {\n    this.value = value;\n    this.length = value.length;\n  } else {\n    return reporter.error('Unsupported type: ' + typeof value);\n  }\n}\nexports.EncoderBuffer = EncoderBuffer;\n\nEncoderBuffer.isEncoderBuffer = function isEncoderBuffer(data) {\n  if (data instanceof EncoderBuffer) {\n    return true;\n  }\n\n  // Or accept compatible API\n  const isCompatible = typeof data === 'object' &&\n    data.constructor.name === 'EncoderBuffer' &&\n    typeof data.length === 'number' &&\n    typeof data.join === 'function';\n\n  return isCompatible;\n};\n\nEncoderBuffer.prototype.join = function join(out, offset) {\n  if (!out)\n    out = Buffer.alloc(this.length);\n  if (!offset)\n    offset = 0;\n\n  if (this.length === 0)\n    return out;\n\n  if (Array.isArray(this.value)) {\n    this.value.forEach(function(item) {\n      item.join(out, offset);\n      offset += item.length;\n    });\n  } else {\n    if (typeof this.value === 'number')\n      out[offset] = this.value;\n    else if (typeof this.value === 'string')\n      out.write(this.value, offset);\n    else if (Buffer.isBuffer(this.value))\n      this.value.copy(out, offset);\n    offset += this.length;\n  }\n\n  return out;\n};\n","'use strict';\n\nconst asn1 = exports;\n\nasn1.bignum = require('bn.js');\n\nasn1.define = require('./asn1/api').define;\nasn1.base = require('./asn1/base');\nasn1.constants = require('./asn1/constants');\nasn1.decoders = require('./asn1/decoders');\nasn1.encoders = require('./asn1/encoders');\n","'use strict';\n\nconst Reporter = require('../base/reporter').Reporter;\nconst EncoderBuffer = require('../base/buffer').EncoderBuffer;\nconst DecoderBuffer = require('../base/buffer').DecoderBuffer;\nconst assert = require('minimalistic-assert');\n\n// Supported tags\nconst tags = [\n  'seq', 'seqof', 'set', 'setof', 'objid', 'bool',\n  'gentime', 'utctime', 'null_', 'enum', 'int', 'objDesc',\n  'bitstr', 'bmpstr', 'charstr', 'genstr', 'graphstr', 'ia5str', 'iso646str',\n  'numstr', 'octstr', 'printstr', 't61str', 'unistr', 'utf8str', 'videostr'\n];\n\n// Public methods list\nconst methods = [\n  'key', 'obj', 'use', 'optional', 'explicit', 'implicit', 'def', 'choice',\n  'any', 'contains'\n].concat(tags);\n\n// Overrided methods list\nconst overrided = [\n  '_peekTag', '_decodeTag', '_use',\n  '_decodeStr', '_decodeObjid', '_decodeTime',\n  '_decodeNull', '_decodeInt', '_decodeBool', '_decodeList',\n\n  '_encodeComposite', '_encodeStr', '_encodeObjid', '_encodeTime',\n  '_encodeNull', '_encodeInt', '_encodeBool'\n];\n\nfunction Node(enc, parent, name) {\n  const state = {};\n  this._baseState = state;\n\n  state.name = name;\n  state.enc = enc;\n\n  state.parent = parent || null;\n  state.children = null;\n\n  // State\n  state.tag = null;\n  state.args = null;\n  state.reverseArgs = null;\n  state.choice = null;\n  state.optional = false;\n  state.any = false;\n  state.obj = false;\n  state.use = null;\n  state.useDecoder = null;\n  state.key = null;\n  state['default'] = null;\n  state.explicit = null;\n  state.implicit = null;\n  state.contains = null;\n\n  // Should create new instance on each method\n  if (!state.parent) {\n    state.children = [];\n    this._wrap();\n  }\n}\nmodule.exports = Node;\n\nconst stateProps = [\n  'enc', 'parent', 'children', 'tag', 'args', 'reverseArgs', 'choice',\n  'optional', 'any', 'obj', 'use', 'alteredUse', 'key', 'default', 'explicit',\n  'implicit', 'contains'\n];\n\nNode.prototype.clone = function clone() {\n  const state = this._baseState;\n  const cstate = {};\n  stateProps.forEach(function(prop) {\n    cstate[prop] = state[prop];\n  });\n  const res = new this.constructor(cstate.parent);\n  res._baseState = cstate;\n  return res;\n};\n\nNode.prototype._wrap = function wrap() {\n  const state = this._baseState;\n  methods.forEach(function(method) {\n    this[method] = function _wrappedMethod() {\n      const clone = new this.constructor(this);\n      state.children.push(clone);\n      return clone[method].apply(clone, arguments);\n    };\n  }, this);\n};\n\nNode.prototype._init = function init(body) {\n  const state = this._baseState;\n\n  assert(state.parent === null);\n  body.call(this);\n\n  // Filter children\n  state.children = state.children.filter(function(child) {\n    return child._baseState.parent === this;\n  }, this);\n  assert.equal(state.children.length, 1, 'Root node can have only one child');\n};\n\nNode.prototype._useArgs = function useArgs(args) {\n  const state = this._baseState;\n\n  // Filter children and args\n  const children = args.filter(function(arg) {\n    return arg instanceof this.constructor;\n  }, this);\n  args = args.filter(function(arg) {\n    return !(arg instanceof this.constructor);\n  }, this);\n\n  if (children.length !== 0) {\n    assert(state.children === null);\n    state.children = children;\n\n    // Replace parent to maintain backward link\n    children.forEach(function(child) {\n      child._baseState.parent = this;\n    }, this);\n  }\n  if (args.length !== 0) {\n    assert(state.args === null);\n    state.args = args;\n    state.reverseArgs = args.map(function(arg) {\n      if (typeof arg !== 'object' || arg.constructor !== Object)\n        return arg;\n\n      const res = {};\n      Object.keys(arg).forEach(function(key) {\n        if (key == (key | 0))\n          key |= 0;\n        const value = arg[key];\n        res[value] = key;\n      });\n      return res;\n    });\n  }\n};\n\n//\n// Overrided methods\n//\n\noverrided.forEach(function(method) {\n  Node.prototype[method] = function _overrided() {\n    const state = this._baseState;\n    throw new Error(method + ' not implemented for encoding: ' + state.enc);\n  };\n});\n\n//\n// Public methods\n//\n\ntags.forEach(function(tag) {\n  Node.prototype[tag] = function _tagMethod() {\n    const state = this._baseState;\n    const args = Array.prototype.slice.call(arguments);\n\n    assert(state.tag === null);\n    state.tag = tag;\n\n    this._useArgs(args);\n\n    return this;\n  };\n});\n\nNode.prototype.use = function use(item) {\n  assert(item);\n  const state = this._baseState;\n\n  assert(state.use === null);\n  state.use = item;\n\n  return this;\n};\n\nNode.prototype.optional = function optional() {\n  const state = this._baseState;\n\n  state.optional = true;\n\n  return this;\n};\n\nNode.prototype.def = function def(val) {\n  const state = this._baseState;\n\n  assert(state['default'] === null);\n  state['default'] = val;\n  state.optional = true;\n\n  return this;\n};\n\nNode.prototype.explicit = function explicit(num) {\n  const state = this._baseState;\n\n  assert(state.explicit === null && state.implicit === null);\n  state.explicit = num;\n\n  return this;\n};\n\nNode.prototype.implicit = function implicit(num) {\n  const state = this._baseState;\n\n  assert(state.explicit === null && state.implicit === null);\n  state.implicit = num;\n\n  return this;\n};\n\nNode.prototype.obj = function obj() {\n  const state = this._baseState;\n  const args = Array.prototype.slice.call(arguments);\n\n  state.obj = true;\n\n  if (args.length !== 0)\n    this._useArgs(args);\n\n  return this;\n};\n\nNode.prototype.key = function key(newKey) {\n  const state = this._baseState;\n\n  assert(state.key === null);\n  state.key = newKey;\n\n  return this;\n};\n\nNode.prototype.any = function any() {\n  const state = this._baseState;\n\n  state.any = true;\n\n  return this;\n};\n\nNode.prototype.choice = function choice(obj) {\n  const state = this._baseState;\n\n  assert(state.choice === null);\n  state.choice = obj;\n  this._useArgs(Object.keys(obj).map(function(key) {\n    return obj[key];\n  }));\n\n  return this;\n};\n\nNode.prototype.contains = function contains(item) {\n  const state = this._baseState;\n\n  assert(state.use === null);\n  state.contains = item;\n\n  return this;\n};\n\n//\n// Decoding\n//\n\nNode.prototype._decode = function decode(input, options) {\n  const state = this._baseState;\n\n  // Decode root node\n  if (state.parent === null)\n    return input.wrapResult(state.children[0]._decode(input, options));\n\n  let result = state['default'];\n  let present = true;\n\n  let prevKey = null;\n  if (state.key !== null)\n    prevKey = input.enterKey(state.key);\n\n  // Check if tag is there\n  if (state.optional) {\n    let tag = null;\n    if (state.explicit !== null)\n      tag = state.explicit;\n    else if (state.implicit !== null)\n      tag = state.implicit;\n    else if (state.tag !== null)\n      tag = state.tag;\n\n    if (tag === null && !state.any) {\n      // Trial and Error\n      const save = input.save();\n      try {\n        if (state.choice === null)\n          this._decodeGeneric(state.tag, input, options);\n        else\n          this._decodeChoice(input, options);\n        present = true;\n      } catch (e) {\n        present = false;\n      }\n      input.restore(save);\n    } else {\n      present = this._peekTag(input, tag, state.any);\n\n      if (input.isError(present))\n        return present;\n    }\n  }\n\n  // Push object on stack\n  let prevObj;\n  if (state.obj && present)\n    prevObj = input.enterObject();\n\n  if (present) {\n    // Unwrap explicit values\n    if (state.explicit !== null) {\n      const explicit = this._decodeTag(input, state.explicit);\n      if (input.isError(explicit))\n        return explicit;\n      input = explicit;\n    }\n\n    const start = input.offset;\n\n    // Unwrap implicit and normal values\n    if (state.use === null && state.choice === null) {\n      let save;\n      if (state.any)\n        save = input.save();\n      const body = this._decodeTag(\n        input,\n        state.implicit !== null ? state.implicit : state.tag,\n        state.any\n      );\n      if (input.isError(body))\n        return body;\n\n      if (state.any)\n        result = input.raw(save);\n      else\n        input = body;\n    }\n\n    if (options && options.track && state.tag !== null)\n      options.track(input.path(), start, input.length, 'tagged');\n\n    if (options && options.track && state.tag !== null)\n      options.track(input.path(), input.offset, input.length, 'content');\n\n    // Select proper method for tag\n    if (state.any) {\n      // no-op\n    } else if (state.choice === null) {\n      result = this._decodeGeneric(state.tag, input, options);\n    } else {\n      result = this._decodeChoice(input, options);\n    }\n\n    if (input.isError(result))\n      return result;\n\n    // Decode children\n    if (!state.any && state.choice === null && state.children !== null) {\n      state.children.forEach(function decodeChildren(child) {\n        // NOTE: We are ignoring errors here, to let parser continue with other\n        // parts of encoded data\n        child._decode(input, options);\n      });\n    }\n\n    // Decode contained/encoded by schema, only in bit or octet strings\n    if (state.contains && (state.tag === 'octstr' || state.tag === 'bitstr')) {\n      const data = new DecoderBuffer(result);\n      result = this._getUse(state.contains, input._reporterState.obj)\n        ._decode(data, options);\n    }\n  }\n\n  // Pop object\n  if (state.obj && present)\n    result = input.leaveObject(prevObj);\n\n  // Set key\n  if (state.key !== null && (result !== null || present === true))\n    input.leaveKey(prevKey, state.key, result);\n  else if (prevKey !== null)\n    input.exitKey(prevKey);\n\n  return result;\n};\n\nNode.prototype._decodeGeneric = function decodeGeneric(tag, input, options) {\n  const state = this._baseState;\n\n  if (tag === 'seq' || tag === 'set')\n    return null;\n  if (tag === 'seqof' || tag === 'setof')\n    return this._decodeList(input, tag, state.args[0], options);\n  else if (/str$/.test(tag))\n    return this._decodeStr(input, tag, options);\n  else if (tag === 'objid' && state.args)\n    return this._decodeObjid(input, state.args[0], state.args[1], options);\n  else if (tag === 'objid')\n    return this._decodeObjid(input, null, null, options);\n  else if (tag === 'gentime' || tag === 'utctime')\n    return this._decodeTime(input, tag, options);\n  else if (tag === 'null_')\n    return this._decodeNull(input, options);\n  else if (tag === 'bool')\n    return this._decodeBool(input, options);\n  else if (tag === 'objDesc')\n    return this._decodeStr(input, tag, options);\n  else if (tag === 'int' || tag === 'enum')\n    return this._decodeInt(input, state.args && state.args[0], options);\n\n  if (state.use !== null) {\n    return this._getUse(state.use, input._reporterState.obj)\n      ._decode(input, options);\n  } else {\n    return input.error('unknown tag: ' + tag);\n  }\n};\n\nNode.prototype._getUse = function _getUse(entity, obj) {\n\n  const state = this._baseState;\n  // Create altered use decoder if implicit is set\n  state.useDecoder = this._use(entity, obj);\n  assert(state.useDecoder._baseState.parent === null);\n  state.useDecoder = state.useDecoder._baseState.children[0];\n  if (state.implicit !== state.useDecoder._baseState.implicit) {\n    state.useDecoder = state.useDecoder.clone();\n    state.useDecoder._baseState.implicit = state.implicit;\n  }\n  return state.useDecoder;\n};\n\nNode.prototype._decodeChoice = function decodeChoice(input, options) {\n  const state = this._baseState;\n  let result = null;\n  let match = false;\n\n  Object.keys(state.choice).some(function(key) {\n    const save = input.save();\n    const node = state.choice[key];\n    try {\n      const value = node._decode(input, options);\n      if (input.isError(value))\n        return false;\n\n      result = { type: key, value: value };\n      match = true;\n    } catch (e) {\n      input.restore(save);\n      return false;\n    }\n    return true;\n  }, this);\n\n  if (!match)\n    return input.error('Choice not matched');\n\n  return result;\n};\n\n//\n// Encoding\n//\n\nNode.prototype._createEncoderBuffer = function createEncoderBuffer(data) {\n  return new EncoderBuffer(data, this.reporter);\n};\n\nNode.prototype._encode = function encode(data, reporter, parent) {\n  const state = this._baseState;\n  if (state['default'] !== null && state['default'] === data)\n    return;\n\n  const result = this._encodeValue(data, reporter, parent);\n  if (result === undefined)\n    return;\n\n  if (this._skipDefault(result, reporter, parent))\n    return;\n\n  return result;\n};\n\nNode.prototype._encodeValue = function encode(data, reporter, parent) {\n  const state = this._baseState;\n\n  // Decode root node\n  if (state.parent === null)\n    return state.children[0]._encode(data, reporter || new Reporter());\n\n  let result = null;\n\n  // Set reporter to share it with a child class\n  this.reporter = reporter;\n\n  // Check if data is there\n  if (state.optional && data === undefined) {\n    if (state['default'] !== null)\n      data = state['default'];\n    else\n      return;\n  }\n\n  // Encode children first\n  let content = null;\n  let primitive = false;\n  if (state.any) {\n    // Anything that was given is translated to buffer\n    result = this._createEncoderBuffer(data);\n  } else if (state.choice) {\n    result = this._encodeChoice(data, reporter);\n  } else if (state.contains) {\n    content = this._getUse(state.contains, parent)._encode(data, reporter);\n    primitive = true;\n  } else if (state.children) {\n    content = state.children.map(function(child) {\n      if (child._baseState.tag === 'null_')\n        return child._encode(null, reporter, data);\n\n      if (child._baseState.key === null)\n        return reporter.error('Child should have a key');\n      const prevKey = reporter.enterKey(child._baseState.key);\n\n      if (typeof data !== 'object')\n        return reporter.error('Child expected, but input is not object');\n\n      const res = child._encode(data[child._baseState.key], reporter, data);\n      reporter.leaveKey(prevKey);\n\n      return res;\n    }, this).filter(function(child) {\n      return child;\n    });\n    content = this._createEncoderBuffer(content);\n  } else {\n    if (state.tag === 'seqof' || state.tag === 'setof') {\n      // TODO(indutny): this should be thrown on DSL level\n      if (!(state.args && state.args.length === 1))\n        return reporter.error('Too many args for : ' + state.tag);\n\n      if (!Array.isArray(data))\n        return reporter.error('seqof/setof, but data is not Array');\n\n      const child = this.clone();\n      child._baseState.implicit = null;\n      content = this._createEncoderBuffer(data.map(function(item) {\n        const state = this._baseState;\n\n        return this._getUse(state.args[0], data)._encode(item, reporter);\n      }, child));\n    } else if (state.use !== null) {\n      result = this._getUse(state.use, parent)._encode(data, reporter);\n    } else {\n      content = this._encodePrimitive(state.tag, data);\n      primitive = true;\n    }\n  }\n\n  // Encode data itself\n  if (!state.any && state.choice === null) {\n    const tag = state.implicit !== null ? state.implicit : state.tag;\n    const cls = state.implicit === null ? 'universal' : 'context';\n\n    if (tag === null) {\n      if (state.use === null)\n        reporter.error('Tag could be omitted only for .use()');\n    } else {\n      if (state.use === null)\n        result = this._encodeComposite(tag, primitive, cls, content);\n    }\n  }\n\n  // Wrap in explicit\n  if (state.explicit !== null)\n    result = this._encodeComposite(state.explicit, false, 'context', result);\n\n  return result;\n};\n\nNode.prototype._encodeChoice = function encodeChoice(data, reporter) {\n  const state = this._baseState;\n\n  const node = state.choice[data.type];\n  if (!node) {\n    assert(\n      false,\n      data.type + ' not found in ' +\n            JSON.stringify(Object.keys(state.choice)));\n  }\n  return node._encode(data.value, reporter);\n};\n\nNode.prototype._encodePrimitive = function encodePrimitive(tag, data) {\n  const state = this._baseState;\n\n  if (/str$/.test(tag))\n    return this._encodeStr(data, tag);\n  else if (tag === 'objid' && state.args)\n    return this._encodeObjid(data, state.reverseArgs[0], state.args[1]);\n  else if (tag === 'objid')\n    return this._encodeObjid(data, null, null);\n  else if (tag === 'gentime' || tag === 'utctime')\n    return this._encodeTime(data, tag);\n  else if (tag === 'null_')\n    return this._encodeNull();\n  else if (tag === 'int' || tag === 'enum')\n    return this._encodeInt(data, state.args && state.reverseArgs[0]);\n  else if (tag === 'bool')\n    return this._encodeBool(data);\n  else if (tag === 'objDesc')\n    return this._encodeStr(data, tag);\n  else\n    throw new Error('Unsupported tag: ' + tag);\n};\n\nNode.prototype._isNumstr = function isNumstr(str) {\n  return /^[0-9 ]*$/.test(str);\n};\n\nNode.prototype._isPrintstr = function isPrintstr(str) {\n  return /^[A-Za-z0-9 '()+,-./:=?]*$/.test(str);\n};\n","'use strict';\n\nconst inherits = require('inherits');\n\nconst DEREncoder = require('./der');\n\nfunction PEMEncoder(entity) {\n  DEREncoder.call(this, entity);\n  this.enc = 'pem';\n}\ninherits(PEMEncoder, DEREncoder);\nmodule.exports = PEMEncoder;\n\nPEMEncoder.prototype.encode = function encode(data, options) {\n  const buf = DEREncoder.prototype.encode.call(this, data);\n\n  const p = buf.toString('base64');\n  const out = [ '-----BEGIN ' + options.label + '-----' ];\n  for (let i = 0; i < p.length; i += 64)\n    out.push(p.slice(i, i + 64));\n  out.push('-----END ' + options.label + '-----');\n  return out.join('\\n');\n};\n","'use strict';\n\n// Helper\nfunction reverse(map) {\n  const res = {};\n\n  Object.keys(map).forEach(function(key) {\n    // Convert key to integer if it is stringified\n    if ((key | 0) == key)\n      key = key | 0;\n\n    const value = map[key];\n    res[value] = key;\n  });\n\n  return res;\n}\n\nexports.tagClass = {\n  0: 'universal',\n  1: 'application',\n  2: 'context',\n  3: 'private'\n};\nexports.tagClassByName = reverse(exports.tagClass);\n\nexports.tag = {\n  0x00: 'end',\n  0x01: 'bool',\n  0x02: 'int',\n  0x03: 'bitstr',\n  0x04: 'octstr',\n  0x05: 'null_',\n  0x06: 'objid',\n  0x07: 'objDesc',\n  0x08: 'external',\n  0x09: 'real',\n  0x0a: 'enum',\n  0x0b: 'embed',\n  0x0c: 'utf8str',\n  0x0d: 'relativeOid',\n  0x10: 'seq',\n  0x11: 'set',\n  0x12: 'numstr',\n  0x13: 'printstr',\n  0x14: 't61str',\n  0x15: 'videostr',\n  0x16: 'ia5str',\n  0x17: 'utctime',\n  0x18: 'gentime',\n  0x19: 'graphstr',\n  0x1a: 'iso646str',\n  0x1b: 'genstr',\n  0x1c: 'unistr',\n  0x1d: 'charstr',\n  0x1e: 'bmpstr'\n};\nexports.tagByName = reverse(exports.tag);\n","'use strict';\n\nconst inherits = require('inherits');\nconst Buffer = require('safer-buffer').Buffer;\n\nconst DERDecoder = require('./der');\n\nfunction PEMDecoder(entity) {\n  DERDecoder.call(this, entity);\n  this.enc = 'pem';\n}\ninherits(PEMDecoder, DERDecoder);\nmodule.exports = PEMDecoder;\n\nPEMDecoder.prototype.decode = function decode(data, options) {\n  const lines = data.toString().split(/[\\r\\n]+/g);\n\n  const label = options.label.toUpperCase();\n\n  const re = /^-----(BEGIN|END) ([^-]+)-----$/;\n  let start = -1;\n  let end = -1;\n  for (let i = 0; i < lines.length; i++) {\n    const match = lines[i].match(re);\n    if (match === null)\n      continue;\n\n    if (match[2] !== label)\n      continue;\n\n    if (start === -1) {\n      if (match[1] !== 'BEGIN')\n        break;\n      start = i;\n    } else {\n      if (match[1] !== 'END')\n        break;\n      end = i;\n      break;\n    }\n  }\n  if (start === -1 || end === -1)\n    throw new Error('PEM section not found for: ' + label);\n\n  const base64 = lines.slice(start + 1, end).join('');\n  // Remove excessive symbols\n  base64.replace(/[^a-z0-9+/=]+/gi, '');\n\n  const input = Buffer.from(base64, 'base64');\n  return DERDecoder.prototype.decode.call(this, input, options);\n};\n","(function (module, exports) {\n  'use strict';\n\n  // Utils\n  function assert (val, msg) {\n    if (!val) throw new Error(msg || 'Assertion failed');\n  }\n\n  // Could use `inherits` module, but don't want to move from single file\n  // architecture yet.\n  function inherits (ctor, superCtor) {\n    ctor.super_ = superCtor;\n    var TempCtor = function () {};\n    TempCtor.prototype = superCtor.prototype;\n    ctor.prototype = new TempCtor();\n    ctor.prototype.constructor = ctor;\n  }\n\n  // BN\n\n  function BN (number, base, endian) {\n    if (BN.isBN(number)) {\n      return number;\n    }\n\n    this.negative = 0;\n    this.words = null;\n    this.length = 0;\n\n    // Reduction context\n    this.red = null;\n\n    if (number !== null) {\n      if (base === 'le' || base === 'be') {\n        endian = base;\n        base = 10;\n      }\n\n      this._init(number || 0, base || 10, endian || 'be');\n    }\n  }\n  if (typeof module === 'object') {\n    module.exports = BN;\n  } else {\n    exports.BN = BN;\n  }\n\n  BN.BN = BN;\n  BN.wordSize = 26;\n\n  var Buffer;\n  try {\n    Buffer = require('buffer').Buffer;\n  } catch (e) {\n  }\n\n  BN.isBN = function isBN (num) {\n    if (num instanceof BN) {\n      return true;\n    }\n\n    return num !== null && typeof num === 'object' &&\n      num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n  };\n\n  BN.max = function max (left, right) {\n    if (left.cmp(right) > 0) return left;\n    return right;\n  };\n\n  BN.min = function min (left, right) {\n    if (left.cmp(right) < 0) return left;\n    return right;\n  };\n\n  BN.prototype._init = function init (number, base, endian) {\n    if (typeof number === 'number') {\n      return this._initNumber(number, base, endian);\n    }\n\n    if (typeof number === 'object') {\n      return this._initArray(number, base, endian);\n    }\n\n    if (base === 'hex') {\n      base = 16;\n    }\n    assert(base === (base | 0) && base >= 2 && base <= 36);\n\n    number = number.toString().replace(/\\s+/g, '');\n    var start = 0;\n    if (number[0] === '-') {\n      start++;\n    }\n\n    if (base === 16) {\n      this._parseHex(number, start);\n    } else {\n      this._parseBase(number, base, start);\n    }\n\n    if (number[0] === '-') {\n      this.negative = 1;\n    }\n\n    this.strip();\n\n    if (endian !== 'le') return;\n\n    this._initArray(this.toArray(), base, endian);\n  };\n\n  BN.prototype._initNumber = function _initNumber (number, base, endian) {\n    if (number < 0) {\n      this.negative = 1;\n      number = -number;\n    }\n    if (number < 0x4000000) {\n      this.words = [ number & 0x3ffffff ];\n      this.length = 1;\n    } else if (number < 0x10000000000000) {\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff\n      ];\n      this.length = 2;\n    } else {\n      assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff,\n        1\n      ];\n      this.length = 3;\n    }\n\n    if (endian !== 'le') return;\n\n    // Reverse the bytes\n    this._initArray(this.toArray(), base, endian);\n  };\n\n  BN.prototype._initArray = function _initArray (number, base, endian) {\n    // Perhaps a Uint8Array\n    assert(typeof number.length === 'number');\n    if (number.length <= 0) {\n      this.words = [ 0 ];\n      this.length = 1;\n      return this;\n    }\n\n    this.length = Math.ceil(number.length / 3);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    var j, w;\n    var off = 0;\n    if (endian === 'be') {\n      for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n        w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    } else if (endian === 'le') {\n      for (i = 0, j = 0; i < number.length; i += 3) {\n        w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    }\n    return this.strip();\n  };\n\n  function parseHex (str, start, end) {\n    var r = 0;\n    var len = Math.min(str.length, end);\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r <<= 4;\n\n      // 'a' - 'f'\n      if (c >= 49 && c <= 54) {\n        r |= c - 49 + 0xa;\n\n      // 'A' - 'F'\n      } else if (c >= 17 && c <= 22) {\n        r |= c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        r |= c & 0xf;\n      }\n    }\n    return r;\n  }\n\n  BN.prototype._parseHex = function _parseHex (number, start) {\n    // Create possibly bigger array to ensure that it fits the number\n    this.length = Math.ceil((number.length - start) / 6);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    var j, w;\n    // Scan 24-bit chunks and add them to the number\n    var off = 0;\n    for (i = number.length - 6, j = 0; i >= start; i -= 6) {\n      w = parseHex(number, i, i + 6);\n      this.words[j] |= (w << off) & 0x3ffffff;\n      // NOTE: `0x3fffff` is intentional here, 26bits max shift + 24bit hex limb\n      this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;\n      off += 24;\n      if (off >= 26) {\n        off -= 26;\n        j++;\n      }\n    }\n    if (i + 6 !== start) {\n      w = parseHex(number, start, i + 6);\n      this.words[j] |= (w << off) & 0x3ffffff;\n      this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;\n    }\n    this.strip();\n  };\n\n  function parseBase (str, start, end, mul) {\n    var r = 0;\n    var len = Math.min(str.length, end);\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r *= mul;\n\n      // 'a'\n      if (c >= 49) {\n        r += c - 49 + 0xa;\n\n      // 'A'\n      } else if (c >= 17) {\n        r += c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        r += c;\n      }\n    }\n    return r;\n  }\n\n  BN.prototype._parseBase = function _parseBase (number, base, start) {\n    // Initialize as zero\n    this.words = [ 0 ];\n    this.length = 1;\n\n    // Find length of limb in base\n    for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n      limbLen++;\n    }\n    limbLen--;\n    limbPow = (limbPow / base) | 0;\n\n    var total = number.length - start;\n    var mod = total % limbLen;\n    var end = Math.min(total, total - mod) + start;\n\n    var word = 0;\n    for (var i = start; i < end; i += limbLen) {\n      word = parseBase(number, i, i + limbLen, base);\n\n      this.imuln(limbPow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    if (mod !== 0) {\n      var pow = 1;\n      word = parseBase(number, i, number.length, base);\n\n      for (i = 0; i < mod; i++) {\n        pow *= base;\n      }\n\n      this.imuln(pow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n  };\n\n  BN.prototype.copy = function copy (dest) {\n    dest.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      dest.words[i] = this.words[i];\n    }\n    dest.length = this.length;\n    dest.negative = this.negative;\n    dest.red = this.red;\n  };\n\n  BN.prototype.clone = function clone () {\n    var r = new BN(null);\n    this.copy(r);\n    return r;\n  };\n\n  BN.prototype._expand = function _expand (size) {\n    while (this.length < size) {\n      this.words[this.length++] = 0;\n    }\n    return this;\n  };\n\n  // Remove leading `0` from `this`\n  BN.prototype.strip = function strip () {\n    while (this.length > 1 && this.words[this.length - 1] === 0) {\n      this.length--;\n    }\n    return this._normSign();\n  };\n\n  BN.prototype._normSign = function _normSign () {\n    // -0 = 0\n    if (this.length === 1 && this.words[0] === 0) {\n      this.negative = 0;\n    }\n    return this;\n  };\n\n  BN.prototype.inspect = function inspect () {\n    return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n  };\n\n  /*\n\n  var zeros = [];\n  var groupSizes = [];\n  var groupBases = [];\n\n  var s = '';\n  var i = -1;\n  while (++i < BN.wordSize) {\n    zeros[i] = s;\n    s += '0';\n  }\n  groupSizes[0] = 0;\n  groupSizes[1] = 0;\n  groupBases[0] = 0;\n  groupBases[1] = 0;\n  var base = 2 - 1;\n  while (++base < 36 + 1) {\n    var groupSize = 0;\n    var groupBase = 1;\n    while (groupBase < (1 << BN.wordSize) / base) {\n      groupBase *= base;\n      groupSize += 1;\n    }\n    groupSizes[base] = groupSize;\n    groupBases[base] = groupBase;\n  }\n\n  */\n\n  var zeros = [\n    '',\n    '0',\n    '00',\n    '000',\n    '0000',\n    '00000',\n    '000000',\n    '0000000',\n    '00000000',\n    '000000000',\n    '0000000000',\n    '00000000000',\n    '000000000000',\n    '0000000000000',\n    '00000000000000',\n    '000000000000000',\n    '0000000000000000',\n    '00000000000000000',\n    '000000000000000000',\n    '0000000000000000000',\n    '00000000000000000000',\n    '000000000000000000000',\n    '0000000000000000000000',\n    '00000000000000000000000',\n    '000000000000000000000000',\n    '0000000000000000000000000'\n  ];\n\n  var groupSizes = [\n    0, 0,\n    25, 16, 12, 11, 10, 9, 8,\n    8, 7, 7, 7, 7, 6, 6,\n    6, 6, 6, 6, 6, 5, 5,\n    5, 5, 5, 5, 5, 5, 5,\n    5, 5, 5, 5, 5, 5, 5\n  ];\n\n  var groupBases = [\n    0, 0,\n    33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n    43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n    16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n    6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n    24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n  ];\n\n  BN.prototype.toString = function toString (base, padding) {\n    base = base || 10;\n    padding = padding | 0 || 1;\n\n    var out;\n    if (base === 16 || base === 'hex') {\n      out = '';\n      var off = 0;\n      var carry = 0;\n      for (var i = 0; i < this.length; i++) {\n        var w = this.words[i];\n        var word = (((w << off) | carry) & 0xffffff).toString(16);\n        carry = (w >>> (24 - off)) & 0xffffff;\n        if (carry !== 0 || i !== this.length - 1) {\n          out = zeros[6 - word.length] + word + out;\n        } else {\n          out = word + out;\n        }\n        off += 2;\n        if (off >= 26) {\n          off -= 26;\n          i--;\n        }\n      }\n      if (carry !== 0) {\n        out = carry.toString(16) + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    if (base === (base | 0) && base >= 2 && base <= 36) {\n      // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n      var groupSize = groupSizes[base];\n      // var groupBase = Math.pow(base, groupSize);\n      var groupBase = groupBases[base];\n      out = '';\n      var c = this.clone();\n      c.negative = 0;\n      while (!c.isZero()) {\n        var r = c.modn(groupBase).toString(base);\n        c = c.idivn(groupBase);\n\n        if (!c.isZero()) {\n          out = zeros[groupSize - r.length] + r + out;\n        } else {\n          out = r + out;\n        }\n      }\n      if (this.isZero()) {\n        out = '0' + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    assert(false, 'Base should be between 2 and 36');\n  };\n\n  BN.prototype.toNumber = function toNumber () {\n    var ret = this.words[0];\n    if (this.length === 2) {\n      ret += this.words[1] * 0x4000000;\n    } else if (this.length === 3 && this.words[2] === 0x01) {\n      // NOTE: at this stage it is known that the top bit is set\n      ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n    } else if (this.length > 2) {\n      assert(false, 'Number can only safely store up to 53 bits');\n    }\n    return (this.negative !== 0) ? -ret : ret;\n  };\n\n  BN.prototype.toJSON = function toJSON () {\n    return this.toString(16);\n  };\n\n  BN.prototype.toBuffer = function toBuffer (endian, length) {\n    assert(typeof Buffer !== 'undefined');\n    return this.toArrayLike(Buffer, endian, length);\n  };\n\n  BN.prototype.toArray = function toArray (endian, length) {\n    return this.toArrayLike(Array, endian, length);\n  };\n\n  BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n    var byteLength = this.byteLength();\n    var reqLength = length || Math.max(1, byteLength);\n    assert(byteLength <= reqLength, 'byte array longer than desired length');\n    assert(reqLength > 0, 'Requested array length <= 0');\n\n    this.strip();\n    var littleEndian = endian === 'le';\n    var res = new ArrayType(reqLength);\n\n    var b, i;\n    var q = this.clone();\n    if (!littleEndian) {\n      // Assume big-endian\n      for (i = 0; i < reqLength - byteLength; i++) {\n        res[i] = 0;\n      }\n\n      for (i = 0; !q.isZero(); i++) {\n        b = q.andln(0xff);\n        q.iushrn(8);\n\n        res[reqLength - i - 1] = b;\n      }\n    } else {\n      for (i = 0; !q.isZero(); i++) {\n        b = q.andln(0xff);\n        q.iushrn(8);\n\n        res[i] = b;\n      }\n\n      for (; i < reqLength; i++) {\n        res[i] = 0;\n      }\n    }\n\n    return res;\n  };\n\n  if (Math.clz32) {\n    BN.prototype._countBits = function _countBits (w) {\n      return 32 - Math.clz32(w);\n    };\n  } else {\n    BN.prototype._countBits = function _countBits (w) {\n      var t = w;\n      var r = 0;\n      if (t >= 0x1000) {\n        r += 13;\n        t >>>= 13;\n      }\n      if (t >= 0x40) {\n        r += 7;\n        t >>>= 7;\n      }\n      if (t >= 0x8) {\n        r += 4;\n        t >>>= 4;\n      }\n      if (t >= 0x02) {\n        r += 2;\n        t >>>= 2;\n      }\n      return r + t;\n    };\n  }\n\n  BN.prototype._zeroBits = function _zeroBits (w) {\n    // Short-cut\n    if (w === 0) return 26;\n\n    var t = w;\n    var r = 0;\n    if ((t & 0x1fff) === 0) {\n      r += 13;\n      t >>>= 13;\n    }\n    if ((t & 0x7f) === 0) {\n      r += 7;\n      t >>>= 7;\n    }\n    if ((t & 0xf) === 0) {\n      r += 4;\n      t >>>= 4;\n    }\n    if ((t & 0x3) === 0) {\n      r += 2;\n      t >>>= 2;\n    }\n    if ((t & 0x1) === 0) {\n      r++;\n    }\n    return r;\n  };\n\n  // Return number of used bits in a BN\n  BN.prototype.bitLength = function bitLength () {\n    var w = this.words[this.length - 1];\n    var hi = this._countBits(w);\n    return (this.length - 1) * 26 + hi;\n  };\n\n  function toBitArray (num) {\n    var w = new Array(num.bitLength());\n\n    for (var bit = 0; bit < w.length; bit++) {\n      var off = (bit / 26) | 0;\n      var wbit = bit % 26;\n\n      w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n    }\n\n    return w;\n  }\n\n  // Number of trailing zero bits\n  BN.prototype.zeroBits = function zeroBits () {\n    if (this.isZero()) return 0;\n\n    var r = 0;\n    for (var i = 0; i < this.length; i++) {\n      var b = this._zeroBits(this.words[i]);\n      r += b;\n      if (b !== 26) break;\n    }\n    return r;\n  };\n\n  BN.prototype.byteLength = function byteLength () {\n    return Math.ceil(this.bitLength() / 8);\n  };\n\n  BN.prototype.toTwos = function toTwos (width) {\n    if (this.negative !== 0) {\n      return this.abs().inotn(width).iaddn(1);\n    }\n    return this.clone();\n  };\n\n  BN.prototype.fromTwos = function fromTwos (width) {\n    if (this.testn(width - 1)) {\n      return this.notn(width).iaddn(1).ineg();\n    }\n    return this.clone();\n  };\n\n  BN.prototype.isNeg = function isNeg () {\n    return this.negative !== 0;\n  };\n\n  // Return negative clone of `this`\n  BN.prototype.neg = function neg () {\n    return this.clone().ineg();\n  };\n\n  BN.prototype.ineg = function ineg () {\n    if (!this.isZero()) {\n      this.negative ^= 1;\n    }\n\n    return this;\n  };\n\n  // Or `num` with `this` in-place\n  BN.prototype.iuor = function iuor (num) {\n    while (this.length < num.length) {\n      this.words[this.length++] = 0;\n    }\n\n    for (var i = 0; i < num.length; i++) {\n      this.words[i] = this.words[i] | num.words[i];\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ior = function ior (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuor(num);\n  };\n\n  // Or `num` with `this`\n  BN.prototype.or = function or (num) {\n    if (this.length > num.length) return this.clone().ior(num);\n    return num.clone().ior(this);\n  };\n\n  BN.prototype.uor = function uor (num) {\n    if (this.length > num.length) return this.clone().iuor(num);\n    return num.clone().iuor(this);\n  };\n\n  // And `num` with `this` in-place\n  BN.prototype.iuand = function iuand (num) {\n    // b = min-length(num, this)\n    var b;\n    if (this.length > num.length) {\n      b = num;\n    } else {\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = this.words[i] & num.words[i];\n    }\n\n    this.length = b.length;\n\n    return this.strip();\n  };\n\n  BN.prototype.iand = function iand (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuand(num);\n  };\n\n  // And `num` with `this`\n  BN.prototype.and = function and (num) {\n    if (this.length > num.length) return this.clone().iand(num);\n    return num.clone().iand(this);\n  };\n\n  BN.prototype.uand = function uand (num) {\n    if (this.length > num.length) return this.clone().iuand(num);\n    return num.clone().iuand(this);\n  };\n\n  // Xor `num` with `this` in-place\n  BN.prototype.iuxor = function iuxor (num) {\n    // a.length > b.length\n    var a;\n    var b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = a.words[i] ^ b.words[i];\n    }\n\n    if (this !== a) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = a.length;\n\n    return this.strip();\n  };\n\n  BN.prototype.ixor = function ixor (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuxor(num);\n  };\n\n  // Xor `num` with `this`\n  BN.prototype.xor = function xor (num) {\n    if (this.length > num.length) return this.clone().ixor(num);\n    return num.clone().ixor(this);\n  };\n\n  BN.prototype.uxor = function uxor (num) {\n    if (this.length > num.length) return this.clone().iuxor(num);\n    return num.clone().iuxor(this);\n  };\n\n  // Not ``this`` with ``width`` bitwidth\n  BN.prototype.inotn = function inotn (width) {\n    assert(typeof width === 'number' && width >= 0);\n\n    var bytesNeeded = Math.ceil(width / 26) | 0;\n    var bitsLeft = width % 26;\n\n    // Extend the buffer with leading zeroes\n    this._expand(bytesNeeded);\n\n    if (bitsLeft > 0) {\n      bytesNeeded--;\n    }\n\n    // Handle complete words\n    for (var i = 0; i < bytesNeeded; i++) {\n      this.words[i] = ~this.words[i] & 0x3ffffff;\n    }\n\n    // Handle the residue\n    if (bitsLeft > 0) {\n      this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n    }\n\n    // And remove leading zeroes\n    return this.strip();\n  };\n\n  BN.prototype.notn = function notn (width) {\n    return this.clone().inotn(width);\n  };\n\n  // Set `bit` of `this`\n  BN.prototype.setn = function setn (bit, val) {\n    assert(typeof bit === 'number' && bit >= 0);\n\n    var off = (bit / 26) | 0;\n    var wbit = bit % 26;\n\n    this._expand(off + 1);\n\n    if (val) {\n      this.words[off] = this.words[off] | (1 << wbit);\n    } else {\n      this.words[off] = this.words[off] & ~(1 << wbit);\n    }\n\n    return this.strip();\n  };\n\n  // Add `num` to `this` in-place\n  BN.prototype.iadd = function iadd (num) {\n    var r;\n\n    // negative + positive\n    if (this.negative !== 0 && num.negative === 0) {\n      this.negative = 0;\n      r = this.isub(num);\n      this.negative ^= 1;\n      return this._normSign();\n\n    // positive + negative\n    } else if (this.negative === 0 && num.negative !== 0) {\n      num.negative = 0;\n      r = this.isub(num);\n      num.negative = 1;\n      return r._normSign();\n    }\n\n    // a.length > b.length\n    var a, b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n\n    this.length = a.length;\n    if (carry !== 0) {\n      this.words[this.length] = carry;\n      this.length++;\n    // Copy the rest of the words\n    } else if (a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    return this;\n  };\n\n  // Add `num` to `this`\n  BN.prototype.add = function add (num) {\n    var res;\n    if (num.negative !== 0 && this.negative === 0) {\n      num.negative = 0;\n      res = this.sub(num);\n      num.negative ^= 1;\n      return res;\n    } else if (num.negative === 0 && this.negative !== 0) {\n      this.negative = 0;\n      res = num.sub(this);\n      this.negative = 1;\n      return res;\n    }\n\n    if (this.length > num.length) return this.clone().iadd(num);\n\n    return num.clone().iadd(this);\n  };\n\n  // Subtract `num` from `this` in-place\n  BN.prototype.isub = function isub (num) {\n    // this - (-num) = this + num\n    if (num.negative !== 0) {\n      num.negative = 0;\n      var r = this.iadd(num);\n      num.negative = 1;\n      return r._normSign();\n\n    // -this - num = -(this + num)\n    } else if (this.negative !== 0) {\n      this.negative = 0;\n      this.iadd(num);\n      this.negative = 1;\n      return this._normSign();\n    }\n\n    // At this point both numbers are positive\n    var cmp = this.cmp(num);\n\n    // Optimization - zeroify\n    if (cmp === 0) {\n      this.negative = 0;\n      this.length = 1;\n      this.words[0] = 0;\n      return this;\n    }\n\n    // a > b\n    var a, b;\n    if (cmp > 0) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n\n    // Copy rest of the words\n    if (carry === 0 && i < a.length && a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = Math.max(this.length, i);\n\n    if (a !== this) {\n      this.negative = 1;\n    }\n\n    return this.strip();\n  };\n\n  // Subtract `num` from `this`\n  BN.prototype.sub = function sub (num) {\n    return this.clone().isub(num);\n  };\n\n  function smallMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    var len = (self.length + num.length) | 0;\n    out.length = len;\n    len = (len - 1) | 0;\n\n    // Peel one iteration (compiler can't do it, because of code complexity)\n    var a = self.words[0] | 0;\n    var b = num.words[0] | 0;\n    var r = a * b;\n\n    var lo = r & 0x3ffffff;\n    var carry = (r / 0x4000000) | 0;\n    out.words[0] = lo;\n\n    for (var k = 1; k < len; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = carry >>> 26;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = (k - j) | 0;\n        a = self.words[i] | 0;\n        b = num.words[j] | 0;\n        r = a * b + rword;\n        ncarry += (r / 0x4000000) | 0;\n        rword = r & 0x3ffffff;\n      }\n      out.words[k] = rword | 0;\n      carry = ncarry | 0;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry | 0;\n    } else {\n      out.length--;\n    }\n\n    return out.strip();\n  }\n\n  // TODO(indutny): it may be reasonable to omit it for users who don't need\n  // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n  // multiplication (like elliptic secp256k1).\n  var comb10MulTo = function comb10MulTo (self, num, out) {\n    var a = self.words;\n    var b = num.words;\n    var o = out.words;\n    var c = 0;\n    var lo;\n    var mid;\n    var hi;\n    var a0 = a[0] | 0;\n    var al0 = a0 & 0x1fff;\n    var ah0 = a0 >>> 13;\n    var a1 = a[1] | 0;\n    var al1 = a1 & 0x1fff;\n    var ah1 = a1 >>> 13;\n    var a2 = a[2] | 0;\n    var al2 = a2 & 0x1fff;\n    var ah2 = a2 >>> 13;\n    var a3 = a[3] | 0;\n    var al3 = a3 & 0x1fff;\n    var ah3 = a3 >>> 13;\n    var a4 = a[4] | 0;\n    var al4 = a4 & 0x1fff;\n    var ah4 = a4 >>> 13;\n    var a5 = a[5] | 0;\n    var al5 = a5 & 0x1fff;\n    var ah5 = a5 >>> 13;\n    var a6 = a[6] | 0;\n    var al6 = a6 & 0x1fff;\n    var ah6 = a6 >>> 13;\n    var a7 = a[7] | 0;\n    var al7 = a7 & 0x1fff;\n    var ah7 = a7 >>> 13;\n    var a8 = a[8] | 0;\n    var al8 = a8 & 0x1fff;\n    var ah8 = a8 >>> 13;\n    var a9 = a[9] | 0;\n    var al9 = a9 & 0x1fff;\n    var ah9 = a9 >>> 13;\n    var b0 = b[0] | 0;\n    var bl0 = b0 & 0x1fff;\n    var bh0 = b0 >>> 13;\n    var b1 = b[1] | 0;\n    var bl1 = b1 & 0x1fff;\n    var bh1 = b1 >>> 13;\n    var b2 = b[2] | 0;\n    var bl2 = b2 & 0x1fff;\n    var bh2 = b2 >>> 13;\n    var b3 = b[3] | 0;\n    var bl3 = b3 & 0x1fff;\n    var bh3 = b3 >>> 13;\n    var b4 = b[4] | 0;\n    var bl4 = b4 & 0x1fff;\n    var bh4 = b4 >>> 13;\n    var b5 = b[5] | 0;\n    var bl5 = b5 & 0x1fff;\n    var bh5 = b5 >>> 13;\n    var b6 = b[6] | 0;\n    var bl6 = b6 & 0x1fff;\n    var bh6 = b6 >>> 13;\n    var b7 = b[7] | 0;\n    var bl7 = b7 & 0x1fff;\n    var bh7 = b7 >>> 13;\n    var b8 = b[8] | 0;\n    var bl8 = b8 & 0x1fff;\n    var bh8 = b8 >>> 13;\n    var b9 = b[9] | 0;\n    var bl9 = b9 & 0x1fff;\n    var bh9 = b9 >>> 13;\n\n    out.negative = self.negative ^ num.negative;\n    out.length = 19;\n    /* k = 0 */\n    lo = Math.imul(al0, bl0);\n    mid = Math.imul(al0, bh0);\n    mid = (mid + Math.imul(ah0, bl0)) | 0;\n    hi = Math.imul(ah0, bh0);\n    var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n    w0 &= 0x3ffffff;\n    /* k = 1 */\n    lo = Math.imul(al1, bl0);\n    mid = Math.imul(al1, bh0);\n    mid = (mid + Math.imul(ah1, bl0)) | 0;\n    hi = Math.imul(ah1, bh0);\n    lo = (lo + Math.imul(al0, bl1)) | 0;\n    mid = (mid + Math.imul(al0, bh1)) | 0;\n    mid = (mid + Math.imul(ah0, bl1)) | 0;\n    hi = (hi + Math.imul(ah0, bh1)) | 0;\n    var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n    w1 &= 0x3ffffff;\n    /* k = 2 */\n    lo = Math.imul(al2, bl0);\n    mid = Math.imul(al2, bh0);\n    mid = (mid + Math.imul(ah2, bl0)) | 0;\n    hi = Math.imul(ah2, bh0);\n    lo = (lo + Math.imul(al1, bl1)) | 0;\n    mid = (mid + Math.imul(al1, bh1)) | 0;\n    mid = (mid + Math.imul(ah1, bl1)) | 0;\n    hi = (hi + Math.imul(ah1, bh1)) | 0;\n    lo = (lo + Math.imul(al0, bl2)) | 0;\n    mid = (mid + Math.imul(al0, bh2)) | 0;\n    mid = (mid + Math.imul(ah0, bl2)) | 0;\n    hi = (hi + Math.imul(ah0, bh2)) | 0;\n    var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n    w2 &= 0x3ffffff;\n    /* k = 3 */\n    lo = Math.imul(al3, bl0);\n    mid = Math.imul(al3, bh0);\n    mid = (mid + Math.imul(ah3, bl0)) | 0;\n    hi = Math.imul(ah3, bh0);\n    lo = (lo + Math.imul(al2, bl1)) | 0;\n    mid = (mid + Math.imul(al2, bh1)) | 0;\n    mid = (mid + Math.imul(ah2, bl1)) | 0;\n    hi = (hi + Math.imul(ah2, bh1)) | 0;\n    lo = (lo + Math.imul(al1, bl2)) | 0;\n    mid = (mid + Math.imul(al1, bh2)) | 0;\n    mid = (mid + Math.imul(ah1, bl2)) | 0;\n    hi = (hi + Math.imul(ah1, bh2)) | 0;\n    lo = (lo + Math.imul(al0, bl3)) | 0;\n    mid = (mid + Math.imul(al0, bh3)) | 0;\n    mid = (mid + Math.imul(ah0, bl3)) | 0;\n    hi = (hi + Math.imul(ah0, bh3)) | 0;\n    var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n    w3 &= 0x3ffffff;\n    /* k = 4 */\n    lo = Math.imul(al4, bl0);\n    mid = Math.imul(al4, bh0);\n    mid = (mid + Math.imul(ah4, bl0)) | 0;\n    hi = Math.imul(ah4, bh0);\n    lo = (lo + Math.imul(al3, bl1)) | 0;\n    mid = (mid + Math.imul(al3, bh1)) | 0;\n    mid = (mid + Math.imul(ah3, bl1)) | 0;\n    hi = (hi + Math.imul(ah3, bh1)) | 0;\n    lo = (lo + Math.imul(al2, bl2)) | 0;\n    mid = (mid + Math.imul(al2, bh2)) | 0;\n    mid = (mid + Math.imul(ah2, bl2)) | 0;\n    hi = (hi + Math.imul(ah2, bh2)) | 0;\n    lo = (lo + Math.imul(al1, bl3)) | 0;\n    mid = (mid + Math.imul(al1, bh3)) | 0;\n    mid = (mid + Math.imul(ah1, bl3)) | 0;\n    hi = (hi + Math.imul(ah1, bh3)) | 0;\n    lo = (lo + Math.imul(al0, bl4)) | 0;\n    mid = (mid + Math.imul(al0, bh4)) | 0;\n    mid = (mid + Math.imul(ah0, bl4)) | 0;\n    hi = (hi + Math.imul(ah0, bh4)) | 0;\n    var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n    w4 &= 0x3ffffff;\n    /* k = 5 */\n    lo = Math.imul(al5, bl0);\n    mid = Math.imul(al5, bh0);\n    mid = (mid + Math.imul(ah5, bl0)) | 0;\n    hi = Math.imul(ah5, bh0);\n    lo = (lo + Math.imul(al4, bl1)) | 0;\n    mid = (mid + Math.imul(al4, bh1)) | 0;\n    mid = (mid + Math.imul(ah4, bl1)) | 0;\n    hi = (hi + Math.imul(ah4, bh1)) | 0;\n    lo = (lo + Math.imul(al3, bl2)) | 0;\n    mid = (mid + Math.imul(al3, bh2)) | 0;\n    mid = (mid + Math.imul(ah3, bl2)) | 0;\n    hi = (hi + Math.imul(ah3, bh2)) | 0;\n    lo = (lo + Math.imul(al2, bl3)) | 0;\n    mid = (mid + Math.imul(al2, bh3)) | 0;\n    mid = (mid + Math.imul(ah2, bl3)) | 0;\n    hi = (hi + Math.imul(ah2, bh3)) | 0;\n    lo = (lo + Math.imul(al1, bl4)) | 0;\n    mid = (mid + Math.imul(al1, bh4)) | 0;\n    mid = (mid + Math.imul(ah1, bl4)) | 0;\n    hi = (hi + Math.imul(ah1, bh4)) | 0;\n    lo = (lo + Math.imul(al0, bl5)) | 0;\n    mid = (mid + Math.imul(al0, bh5)) | 0;\n    mid = (mid + Math.imul(ah0, bl5)) | 0;\n    hi = (hi + Math.imul(ah0, bh5)) | 0;\n    var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n    w5 &= 0x3ffffff;\n    /* k = 6 */\n    lo = Math.imul(al6, bl0);\n    mid = Math.imul(al6, bh0);\n    mid = (mid + Math.imul(ah6, bl0)) | 0;\n    hi = Math.imul(ah6, bh0);\n    lo = (lo + Math.imul(al5, bl1)) | 0;\n    mid = (mid + Math.imul(al5, bh1)) | 0;\n    mid = (mid + Math.imul(ah5, bl1)) | 0;\n    hi = (hi + Math.imul(ah5, bh1)) | 0;\n    lo = (lo + Math.imul(al4, bl2)) | 0;\n    mid = (mid + Math.imul(al4, bh2)) | 0;\n    mid = (mid + Math.imul(ah4, bl2)) | 0;\n    hi = (hi + Math.imul(ah4, bh2)) | 0;\n    lo = (lo + Math.imul(al3, bl3)) | 0;\n    mid = (mid + Math.imul(al3, bh3)) | 0;\n    mid = (mid + Math.imul(ah3, bl3)) | 0;\n    hi = (hi + Math.imul(ah3, bh3)) | 0;\n    lo = (lo + Math.imul(al2, bl4)) | 0;\n    mid = (mid + Math.imul(al2, bh4)) | 0;\n    mid = (mid + Math.imul(ah2, bl4)) | 0;\n    hi = (hi + Math.imul(ah2, bh4)) | 0;\n    lo = (lo + Math.imul(al1, bl5)) | 0;\n    mid = (mid + Math.imul(al1, bh5)) | 0;\n    mid = (mid + Math.imul(ah1, bl5)) | 0;\n    hi = (hi + Math.imul(ah1, bh5)) | 0;\n    lo = (lo + Math.imul(al0, bl6)) | 0;\n    mid = (mid + Math.imul(al0, bh6)) | 0;\n    mid = (mid + Math.imul(ah0, bl6)) | 0;\n    hi = (hi + Math.imul(ah0, bh6)) | 0;\n    var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n    w6 &= 0x3ffffff;\n    /* k = 7 */\n    lo = Math.imul(al7, bl0);\n    mid = Math.imul(al7, bh0);\n    mid = (mid + Math.imul(ah7, bl0)) | 0;\n    hi = Math.imul(ah7, bh0);\n    lo = (lo + Math.imul(al6, bl1)) | 0;\n    mid = (mid + Math.imul(al6, bh1)) | 0;\n    mid = (mid + Math.imul(ah6, bl1)) | 0;\n    hi = (hi + Math.imul(ah6, bh1)) | 0;\n    lo = (lo + Math.imul(al5, bl2)) | 0;\n    mid = (mid + Math.imul(al5, bh2)) | 0;\n    mid = (mid + Math.imul(ah5, bl2)) | 0;\n    hi = (hi + Math.imul(ah5, bh2)) | 0;\n    lo = (lo + Math.imul(al4, bl3)) | 0;\n    mid = (mid + Math.imul(al4, bh3)) | 0;\n    mid = (mid + Math.imul(ah4, bl3)) | 0;\n    hi = (hi + Math.imul(ah4, bh3)) | 0;\n    lo = (lo + Math.imul(al3, bl4)) | 0;\n    mid = (mid + Math.imul(al3, bh4)) | 0;\n    mid = (mid + Math.imul(ah3, bl4)) | 0;\n    hi = (hi + Math.imul(ah3, bh4)) | 0;\n    lo = (lo + Math.imul(al2, bl5)) | 0;\n    mid = (mid + Math.imul(al2, bh5)) | 0;\n    mid = (mid + Math.imul(ah2, bl5)) | 0;\n    hi = (hi + Math.imul(ah2, bh5)) | 0;\n    lo = (lo + Math.imul(al1, bl6)) | 0;\n    mid = (mid + Math.imul(al1, bh6)) | 0;\n    mid = (mid + Math.imul(ah1, bl6)) | 0;\n    hi = (hi + Math.imul(ah1, bh6)) | 0;\n    lo = (lo + Math.imul(al0, bl7)) | 0;\n    mid = (mid + Math.imul(al0, bh7)) | 0;\n    mid = (mid + Math.imul(ah0, bl7)) | 0;\n    hi = (hi + Math.imul(ah0, bh7)) | 0;\n    var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n    w7 &= 0x3ffffff;\n    /* k = 8 */\n    lo = Math.imul(al8, bl0);\n    mid = Math.imul(al8, bh0);\n    mid = (mid + Math.imul(ah8, bl0)) | 0;\n    hi = Math.imul(ah8, bh0);\n    lo = (lo + Math.imul(al7, bl1)) | 0;\n    mid = (mid + Math.imul(al7, bh1)) | 0;\n    mid = (mid + Math.imul(ah7, bl1)) | 0;\n    hi = (hi + Math.imul(ah7, bh1)) | 0;\n    lo = (lo + Math.imul(al6, bl2)) | 0;\n    mid = (mid + Math.imul(al6, bh2)) | 0;\n    mid = (mid + Math.imul(ah6, bl2)) | 0;\n    hi = (hi + Math.imul(ah6, bh2)) | 0;\n    lo = (lo + Math.imul(al5, bl3)) | 0;\n    mid = (mid + Math.imul(al5, bh3)) | 0;\n    mid = (mid + Math.imul(ah5, bl3)) | 0;\n    hi = (hi + Math.imul(ah5, bh3)) | 0;\n    lo = (lo + Math.imul(al4, bl4)) | 0;\n    mid = (mid + Math.imul(al4, bh4)) | 0;\n    mid = (mid + Math.imul(ah4, bl4)) | 0;\n    hi = (hi + Math.imul(ah4, bh4)) | 0;\n    lo = (lo + Math.imul(al3, bl5)) | 0;\n    mid = (mid + Math.imul(al3, bh5)) | 0;\n    mid = (mid + Math.imul(ah3, bl5)) | 0;\n    hi = (hi + Math.imul(ah3, bh5)) | 0;\n    lo = (lo + Math.imul(al2, bl6)) | 0;\n    mid = (mid + Math.imul(al2, bh6)) | 0;\n    mid = (mid + Math.imul(ah2, bl6)) | 0;\n    hi = (hi + Math.imul(ah2, bh6)) | 0;\n    lo = (lo + Math.imul(al1, bl7)) | 0;\n    mid = (mid + Math.imul(al1, bh7)) | 0;\n    mid = (mid + Math.imul(ah1, bl7)) | 0;\n    hi = (hi + Math.imul(ah1, bh7)) | 0;\n    lo = (lo + Math.imul(al0, bl8)) | 0;\n    mid = (mid + Math.imul(al0, bh8)) | 0;\n    mid = (mid + Math.imul(ah0, bl8)) | 0;\n    hi = (hi + Math.imul(ah0, bh8)) | 0;\n    var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n    w8 &= 0x3ffffff;\n    /* k = 9 */\n    lo = Math.imul(al9, bl0);\n    mid = Math.imul(al9, bh0);\n    mid = (mid + Math.imul(ah9, bl0)) | 0;\n    hi = Math.imul(ah9, bh0);\n    lo = (lo + Math.imul(al8, bl1)) | 0;\n    mid = (mid + Math.imul(al8, bh1)) | 0;\n    mid = (mid + Math.imul(ah8, bl1)) | 0;\n    hi = (hi + Math.imul(ah8, bh1)) | 0;\n    lo = (lo + Math.imul(al7, bl2)) | 0;\n    mid = (mid + Math.imul(al7, bh2)) | 0;\n    mid = (mid + Math.imul(ah7, bl2)) | 0;\n    hi = (hi + Math.imul(ah7, bh2)) | 0;\n    lo = (lo + Math.imul(al6, bl3)) | 0;\n    mid = (mid + Math.imul(al6, bh3)) | 0;\n    mid = (mid + Math.imul(ah6, bl3)) | 0;\n    hi = (hi + Math.imul(ah6, bh3)) | 0;\n    lo = (lo + Math.imul(al5, bl4)) | 0;\n    mid = (mid + Math.imul(al5, bh4)) | 0;\n    mid = (mid + Math.imul(ah5, bl4)) | 0;\n    hi = (hi + Math.imul(ah5, bh4)) | 0;\n    lo = (lo + Math.imul(al4, bl5)) | 0;\n    mid = (mid + Math.imul(al4, bh5)) | 0;\n    mid = (mid + Math.imul(ah4, bl5)) | 0;\n    hi = (hi + Math.imul(ah4, bh5)) | 0;\n    lo = (lo + Math.imul(al3, bl6)) | 0;\n    mid = (mid + Math.imul(al3, bh6)) | 0;\n    mid = (mid + Math.imul(ah3, bl6)) | 0;\n    hi = (hi + Math.imul(ah3, bh6)) | 0;\n    lo = (lo + Math.imul(al2, bl7)) | 0;\n    mid = (mid + Math.imul(al2, bh7)) | 0;\n    mid = (mid + Math.imul(ah2, bl7)) | 0;\n    hi = (hi + Math.imul(ah2, bh7)) | 0;\n    lo = (lo + Math.imul(al1, bl8)) | 0;\n    mid = (mid + Math.imul(al1, bh8)) | 0;\n    mid = (mid + Math.imul(ah1, bl8)) | 0;\n    hi = (hi + Math.imul(ah1, bh8)) | 0;\n    lo = (lo + Math.imul(al0, bl9)) | 0;\n    mid = (mid + Math.imul(al0, bh9)) | 0;\n    mid = (mid + Math.imul(ah0, bl9)) | 0;\n    hi = (hi + Math.imul(ah0, bh9)) | 0;\n    var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n    w9 &= 0x3ffffff;\n    /* k = 10 */\n    lo = Math.imul(al9, bl1);\n    mid = Math.imul(al9, bh1);\n    mid = (mid + Math.imul(ah9, bl1)) | 0;\n    hi = Math.imul(ah9, bh1);\n    lo = (lo + Math.imul(al8, bl2)) | 0;\n    mid = (mid + Math.imul(al8, bh2)) | 0;\n    mid = (mid + Math.imul(ah8, bl2)) | 0;\n    hi = (hi + Math.imul(ah8, bh2)) | 0;\n    lo = (lo + Math.imul(al7, bl3)) | 0;\n    mid = (mid + Math.imul(al7, bh3)) | 0;\n    mid = (mid + Math.imul(ah7, bl3)) | 0;\n    hi = (hi + Math.imul(ah7, bh3)) | 0;\n    lo = (lo + Math.imul(al6, bl4)) | 0;\n    mid = (mid + Math.imul(al6, bh4)) | 0;\n    mid = (mid + Math.imul(ah6, bl4)) | 0;\n    hi = (hi + Math.imul(ah6, bh4)) | 0;\n    lo = (lo + Math.imul(al5, bl5)) | 0;\n    mid = (mid + Math.imul(al5, bh5)) | 0;\n    mid = (mid + Math.imul(ah5, bl5)) | 0;\n    hi = (hi + Math.imul(ah5, bh5)) | 0;\n    lo = (lo + Math.imul(al4, bl6)) | 0;\n    mid = (mid + Math.imul(al4, bh6)) | 0;\n    mid = (mid + Math.imul(ah4, bl6)) | 0;\n    hi = (hi + Math.imul(ah4, bh6)) | 0;\n    lo = (lo + Math.imul(al3, bl7)) | 0;\n    mid = (mid + Math.imul(al3, bh7)) | 0;\n    mid = (mid + Math.imul(ah3, bl7)) | 0;\n    hi = (hi + Math.imul(ah3, bh7)) | 0;\n    lo = (lo + Math.imul(al2, bl8)) | 0;\n    mid = (mid + Math.imul(al2, bh8)) | 0;\n    mid = (mid + Math.imul(ah2, bl8)) | 0;\n    hi = (hi + Math.imul(ah2, bh8)) | 0;\n    lo = (lo + Math.imul(al1, bl9)) | 0;\n    mid = (mid + Math.imul(al1, bh9)) | 0;\n    mid = (mid + Math.imul(ah1, bl9)) | 0;\n    hi = (hi + Math.imul(ah1, bh9)) | 0;\n    var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n    w10 &= 0x3ffffff;\n    /* k = 11 */\n    lo = Math.imul(al9, bl2);\n    mid = Math.imul(al9, bh2);\n    mid = (mid + Math.imul(ah9, bl2)) | 0;\n    hi = Math.imul(ah9, bh2);\n    lo = (lo + Math.imul(al8, bl3)) | 0;\n    mid = (mid + Math.imul(al8, bh3)) | 0;\n    mid = (mid + Math.imul(ah8, bl3)) | 0;\n    hi = (hi + Math.imul(ah8, bh3)) | 0;\n    lo = (lo + Math.imul(al7, bl4)) | 0;\n    mid = (mid + Math.imul(al7, bh4)) | 0;\n    mid = (mid + Math.imul(ah7, bl4)) | 0;\n    hi = (hi + Math.imul(ah7, bh4)) | 0;\n    lo = (lo + Math.imul(al6, bl5)) | 0;\n    mid = (mid + Math.imul(al6, bh5)) | 0;\n    mid = (mid + Math.imul(ah6, bl5)) | 0;\n    hi = (hi + Math.imul(ah6, bh5)) | 0;\n    lo = (lo + Math.imul(al5, bl6)) | 0;\n    mid = (mid + Math.imul(al5, bh6)) | 0;\n    mid = (mid + Math.imul(ah5, bl6)) | 0;\n    hi = (hi + Math.imul(ah5, bh6)) | 0;\n    lo = (lo + Math.imul(al4, bl7)) | 0;\n    mid = (mid + Math.imul(al4, bh7)) | 0;\n    mid = (mid + Math.imul(ah4, bl7)) | 0;\n    hi = (hi + Math.imul(ah4, bh7)) | 0;\n    lo = (lo + Math.imul(al3, bl8)) | 0;\n    mid = (mid + Math.imul(al3, bh8)) | 0;\n    mid = (mid + Math.imul(ah3, bl8)) | 0;\n    hi = (hi + Math.imul(ah3, bh8)) | 0;\n    lo = (lo + Math.imul(al2, bl9)) | 0;\n    mid = (mid + Math.imul(al2, bh9)) | 0;\n    mid = (mid + Math.imul(ah2, bl9)) | 0;\n    hi = (hi + Math.imul(ah2, bh9)) | 0;\n    var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n    w11 &= 0x3ffffff;\n    /* k = 12 */\n    lo = Math.imul(al9, bl3);\n    mid = Math.imul(al9, bh3);\n    mid = (mid + Math.imul(ah9, bl3)) | 0;\n    hi = Math.imul(ah9, bh3);\n    lo = (lo + Math.imul(al8, bl4)) | 0;\n    mid = (mid + Math.imul(al8, bh4)) | 0;\n    mid = (mid + Math.imul(ah8, bl4)) | 0;\n    hi = (hi + Math.imul(ah8, bh4)) | 0;\n    lo = (lo + Math.imul(al7, bl5)) | 0;\n    mid = (mid + Math.imul(al7, bh5)) | 0;\n    mid = (mid + Math.imul(ah7, bl5)) | 0;\n    hi = (hi + Math.imul(ah7, bh5)) | 0;\n    lo = (lo + Math.imul(al6, bl6)) | 0;\n    mid = (mid + Math.imul(al6, bh6)) | 0;\n    mid = (mid + Math.imul(ah6, bl6)) | 0;\n    hi = (hi + Math.imul(ah6, bh6)) | 0;\n    lo = (lo + Math.imul(al5, bl7)) | 0;\n    mid = (mid + Math.imul(al5, bh7)) | 0;\n    mid = (mid + Math.imul(ah5, bl7)) | 0;\n    hi = (hi + Math.imul(ah5, bh7)) | 0;\n    lo = (lo + Math.imul(al4, bl8)) | 0;\n    mid = (mid + Math.imul(al4, bh8)) | 0;\n    mid = (mid + Math.imul(ah4, bl8)) | 0;\n    hi = (hi + Math.imul(ah4, bh8)) | 0;\n    lo = (lo + Math.imul(al3, bl9)) | 0;\n    mid = (mid + Math.imul(al3, bh9)) | 0;\n    mid = (mid + Math.imul(ah3, bl9)) | 0;\n    hi = (hi + Math.imul(ah3, bh9)) | 0;\n    var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n    w12 &= 0x3ffffff;\n    /* k = 13 */\n    lo = Math.imul(al9, bl4);\n    mid = Math.imul(al9, bh4);\n    mid = (mid + Math.imul(ah9, bl4)) | 0;\n    hi = Math.imul(ah9, bh4);\n    lo = (lo + Math.imul(al8, bl5)) | 0;\n    mid = (mid + Math.imul(al8, bh5)) | 0;\n    mid = (mid + Math.imul(ah8, bl5)) | 0;\n    hi = (hi + Math.imul(ah8, bh5)) | 0;\n    lo = (lo + Math.imul(al7, bl6)) | 0;\n    mid = (mid + Math.imul(al7, bh6)) | 0;\n    mid = (mid + Math.imul(ah7, bl6)) | 0;\n    hi = (hi + Math.imul(ah7, bh6)) | 0;\n    lo = (lo + Math.imul(al6, bl7)) | 0;\n    mid = (mid + Math.imul(al6, bh7)) | 0;\n    mid = (mid + Math.imul(ah6, bl7)) | 0;\n    hi = (hi + Math.imul(ah6, bh7)) | 0;\n    lo = (lo + Math.imul(al5, bl8)) | 0;\n    mid = (mid + Math.imul(al5, bh8)) | 0;\n    mid = (mid + Math.imul(ah5, bl8)) | 0;\n    hi = (hi + Math.imul(ah5, bh8)) | 0;\n    lo = (lo + Math.imul(al4, bl9)) | 0;\n    mid = (mid + Math.imul(al4, bh9)) | 0;\n    mid = (mid + Math.imul(ah4, bl9)) | 0;\n    hi = (hi + Math.imul(ah4, bh9)) | 0;\n    var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n    w13 &= 0x3ffffff;\n    /* k = 14 */\n    lo = Math.imul(al9, bl5);\n    mid = Math.imul(al9, bh5);\n    mid = (mid + Math.imul(ah9, bl5)) | 0;\n    hi = Math.imul(ah9, bh5);\n    lo = (lo + Math.imul(al8, bl6)) | 0;\n    mid = (mid + Math.imul(al8, bh6)) | 0;\n    mid = (mid + Math.imul(ah8, bl6)) | 0;\n    hi = (hi + Math.imul(ah8, bh6)) | 0;\n    lo = (lo + Math.imul(al7, bl7)) | 0;\n    mid = (mid + Math.imul(al7, bh7)) | 0;\n    mid = (mid + Math.imul(ah7, bl7)) | 0;\n    hi = (hi + Math.imul(ah7, bh7)) | 0;\n    lo = (lo + Math.imul(al6, bl8)) | 0;\n    mid = (mid + Math.imul(al6, bh8)) | 0;\n    mid = (mid + Math.imul(ah6, bl8)) | 0;\n    hi = (hi + Math.imul(ah6, bh8)) | 0;\n    lo = (lo + Math.imul(al5, bl9)) | 0;\n    mid = (mid + Math.imul(al5, bh9)) | 0;\n    mid = (mid + Math.imul(ah5, bl9)) | 0;\n    hi = (hi + Math.imul(ah5, bh9)) | 0;\n    var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n    w14 &= 0x3ffffff;\n    /* k = 15 */\n    lo = Math.imul(al9, bl6);\n    mid = Math.imul(al9, bh6);\n    mid = (mid + Math.imul(ah9, bl6)) | 0;\n    hi = Math.imul(ah9, bh6);\n    lo = (lo + Math.imul(al8, bl7)) | 0;\n    mid = (mid + Math.imul(al8, bh7)) | 0;\n    mid = (mid + Math.imul(ah8, bl7)) | 0;\n    hi = (hi + Math.imul(ah8, bh7)) | 0;\n    lo = (lo + Math.imul(al7, bl8)) | 0;\n    mid = (mid + Math.imul(al7, bh8)) | 0;\n    mid = (mid + Math.imul(ah7, bl8)) | 0;\n    hi = (hi + Math.imul(ah7, bh8)) | 0;\n    lo = (lo + Math.imul(al6, bl9)) | 0;\n    mid = (mid + Math.imul(al6, bh9)) | 0;\n    mid = (mid + Math.imul(ah6, bl9)) | 0;\n    hi = (hi + Math.imul(ah6, bh9)) | 0;\n    var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n    w15 &= 0x3ffffff;\n    /* k = 16 */\n    lo = Math.imul(al9, bl7);\n    mid = Math.imul(al9, bh7);\n    mid = (mid + Math.imul(ah9, bl7)) | 0;\n    hi = Math.imul(ah9, bh7);\n    lo = (lo + Math.imul(al8, bl8)) | 0;\n    mid = (mid + Math.imul(al8, bh8)) | 0;\n    mid = (mid + Math.imul(ah8, bl8)) | 0;\n    hi = (hi + Math.imul(ah8, bh8)) | 0;\n    lo = (lo + Math.imul(al7, bl9)) | 0;\n    mid = (mid + Math.imul(al7, bh9)) | 0;\n    mid = (mid + Math.imul(ah7, bl9)) | 0;\n    hi = (hi + Math.imul(ah7, bh9)) | 0;\n    var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n    w16 &= 0x3ffffff;\n    /* k = 17 */\n    lo = Math.imul(al9, bl8);\n    mid = Math.imul(al9, bh8);\n    mid = (mid + Math.imul(ah9, bl8)) | 0;\n    hi = Math.imul(ah9, bh8);\n    lo = (lo + Math.imul(al8, bl9)) | 0;\n    mid = (mid + Math.imul(al8, bh9)) | 0;\n    mid = (mid + Math.imul(ah8, bl9)) | 0;\n    hi = (hi + Math.imul(ah8, bh9)) | 0;\n    var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n    w17 &= 0x3ffffff;\n    /* k = 18 */\n    lo = Math.imul(al9, bl9);\n    mid = Math.imul(al9, bh9);\n    mid = (mid + Math.imul(ah9, bl9)) | 0;\n    hi = Math.imul(ah9, bh9);\n    var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n    w18 &= 0x3ffffff;\n    o[0] = w0;\n    o[1] = w1;\n    o[2] = w2;\n    o[3] = w3;\n    o[4] = w4;\n    o[5] = w5;\n    o[6] = w6;\n    o[7] = w7;\n    o[8] = w8;\n    o[9] = w9;\n    o[10] = w10;\n    o[11] = w11;\n    o[12] = w12;\n    o[13] = w13;\n    o[14] = w14;\n    o[15] = w15;\n    o[16] = w16;\n    o[17] = w17;\n    o[18] = w18;\n    if (c !== 0) {\n      o[19] = c;\n      out.length++;\n    }\n    return out;\n  };\n\n  // Polyfill comb\n  if (!Math.imul) {\n    comb10MulTo = smallMulTo;\n  }\n\n  function bigMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    out.length = self.length + num.length;\n\n    var carry = 0;\n    var hncarry = 0;\n    for (var k = 0; k < out.length - 1; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = hncarry;\n      hncarry = 0;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = k - j;\n        var a = self.words[i] | 0;\n        var b = num.words[j] | 0;\n        var r = a * b;\n\n        var lo = r & 0x3ffffff;\n        ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n        lo = (lo + rword) | 0;\n        rword = lo & 0x3ffffff;\n        ncarry = (ncarry + (lo >>> 26)) | 0;\n\n        hncarry += ncarry >>> 26;\n        ncarry &= 0x3ffffff;\n      }\n      out.words[k] = rword;\n      carry = ncarry;\n      ncarry = hncarry;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry;\n    } else {\n      out.length--;\n    }\n\n    return out.strip();\n  }\n\n  function jumboMulTo (self, num, out) {\n    var fftm = new FFTM();\n    return fftm.mulp(self, num, out);\n  }\n\n  BN.prototype.mulTo = function mulTo (num, out) {\n    var res;\n    var len = this.length + num.length;\n    if (this.length === 10 && num.length === 10) {\n      res = comb10MulTo(this, num, out);\n    } else if (len < 63) {\n      res = smallMulTo(this, num, out);\n    } else if (len < 1024) {\n      res = bigMulTo(this, num, out);\n    } else {\n      res = jumboMulTo(this, num, out);\n    }\n\n    return res;\n  };\n\n  // Cooley-Tukey algorithm for FFT\n  // slightly revisited to rely on looping instead of recursion\n\n  function FFTM (x, y) {\n    this.x = x;\n    this.y = y;\n  }\n\n  FFTM.prototype.makeRBT = function makeRBT (N) {\n    var t = new Array(N);\n    var l = BN.prototype._countBits(N) - 1;\n    for (var i = 0; i < N; i++) {\n      t[i] = this.revBin(i, l, N);\n    }\n\n    return t;\n  };\n\n  // Returns binary-reversed representation of `x`\n  FFTM.prototype.revBin = function revBin (x, l, N) {\n    if (x === 0 || x === N - 1) return x;\n\n    var rb = 0;\n    for (var i = 0; i < l; i++) {\n      rb |= (x & 1) << (l - i - 1);\n      x >>= 1;\n    }\n\n    return rb;\n  };\n\n  // Performs \"tweedling\" phase, therefore 'emulating'\n  // behaviour of the recursive algorithm\n  FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n    for (var i = 0; i < N; i++) {\n      rtws[i] = rws[rbt[i]];\n      itws[i] = iws[rbt[i]];\n    }\n  };\n\n  FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n    this.permute(rbt, rws, iws, rtws, itws, N);\n\n    for (var s = 1; s < N; s <<= 1) {\n      var l = s << 1;\n\n      var rtwdf = Math.cos(2 * Math.PI / l);\n      var itwdf = Math.sin(2 * Math.PI / l);\n\n      for (var p = 0; p < N; p += l) {\n        var rtwdf_ = rtwdf;\n        var itwdf_ = itwdf;\n\n        for (var j = 0; j < s; j++) {\n          var re = rtws[p + j];\n          var ie = itws[p + j];\n\n          var ro = rtws[p + j + s];\n          var io = itws[p + j + s];\n\n          var rx = rtwdf_ * ro - itwdf_ * io;\n\n          io = rtwdf_ * io + itwdf_ * ro;\n          ro = rx;\n\n          rtws[p + j] = re + ro;\n          itws[p + j] = ie + io;\n\n          rtws[p + j + s] = re - ro;\n          itws[p + j + s] = ie - io;\n\n          /* jshint maxdepth : false */\n          if (j !== l) {\n            rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n            itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n            rtwdf_ = rx;\n          }\n        }\n      }\n    }\n  };\n\n  FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n    var N = Math.max(m, n) | 1;\n    var odd = N & 1;\n    var i = 0;\n    for (N = N / 2 | 0; N; N = N >>> 1) {\n      i++;\n    }\n\n    return 1 << i + 1 + odd;\n  };\n\n  FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n    if (N <= 1) return;\n\n    for (var i = 0; i < N / 2; i++) {\n      var t = rws[i];\n\n      rws[i] = rws[N - i - 1];\n      rws[N - i - 1] = t;\n\n      t = iws[i];\n\n      iws[i] = -iws[N - i - 1];\n      iws[N - i - 1] = -t;\n    }\n  };\n\n  FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n    var carry = 0;\n    for (var i = 0; i < N / 2; i++) {\n      var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n        Math.round(ws[2 * i] / N) +\n        carry;\n\n      ws[i] = w & 0x3ffffff;\n\n      if (w < 0x4000000) {\n        carry = 0;\n      } else {\n        carry = w / 0x4000000 | 0;\n      }\n    }\n\n    return ws;\n  };\n\n  FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n    var carry = 0;\n    for (var i = 0; i < len; i++) {\n      carry = carry + (ws[i] | 0);\n\n      rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n      rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n    }\n\n    // Pad with zeroes\n    for (i = 2 * len; i < N; ++i) {\n      rws[i] = 0;\n    }\n\n    assert(carry === 0);\n    assert((carry & ~0x1fff) === 0);\n  };\n\n  FFTM.prototype.stub = function stub (N) {\n    var ph = new Array(N);\n    for (var i = 0; i < N; i++) {\n      ph[i] = 0;\n    }\n\n    return ph;\n  };\n\n  FFTM.prototype.mulp = function mulp (x, y, out) {\n    var N = 2 * this.guessLen13b(x.length, y.length);\n\n    var rbt = this.makeRBT(N);\n\n    var _ = this.stub(N);\n\n    var rws = new Array(N);\n    var rwst = new Array(N);\n    var iwst = new Array(N);\n\n    var nrws = new Array(N);\n    var nrwst = new Array(N);\n    var niwst = new Array(N);\n\n    var rmws = out.words;\n    rmws.length = N;\n\n    this.convert13b(x.words, x.length, rws, N);\n    this.convert13b(y.words, y.length, nrws, N);\n\n    this.transform(rws, _, rwst, iwst, N, rbt);\n    this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n    for (var i = 0; i < N; i++) {\n      var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n      iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n      rwst[i] = rx;\n    }\n\n    this.conjugate(rwst, iwst, N);\n    this.transform(rwst, iwst, rmws, _, N, rbt);\n    this.conjugate(rmws, _, N);\n    this.normalize13b(rmws, N);\n\n    out.negative = x.negative ^ y.negative;\n    out.length = x.length + y.length;\n    return out.strip();\n  };\n\n  // Multiply `this` by `num`\n  BN.prototype.mul = function mul (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return this.mulTo(num, out);\n  };\n\n  // Multiply employing FFT\n  BN.prototype.mulf = function mulf (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return jumboMulTo(this, num, out);\n  };\n\n  // In-place Multiplication\n  BN.prototype.imul = function imul (num) {\n    return this.clone().mulTo(num, this);\n  };\n\n  BN.prototype.imuln = function imuln (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n\n    // Carry\n    var carry = 0;\n    for (var i = 0; i < this.length; i++) {\n      var w = (this.words[i] | 0) * num;\n      var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n      carry >>= 26;\n      carry += (w / 0x4000000) | 0;\n      // NOTE: lo is 27bit maximum\n      carry += lo >>> 26;\n      this.words[i] = lo & 0x3ffffff;\n    }\n\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n\n    return this;\n  };\n\n  BN.prototype.muln = function muln (num) {\n    return this.clone().imuln(num);\n  };\n\n  // `this` * `this`\n  BN.prototype.sqr = function sqr () {\n    return this.mul(this);\n  };\n\n  // `this` * `this` in-place\n  BN.prototype.isqr = function isqr () {\n    return this.imul(this.clone());\n  };\n\n  // Math.pow(`this`, `num`)\n  BN.prototype.pow = function pow (num) {\n    var w = toBitArray(num);\n    if (w.length === 0) return new BN(1);\n\n    // Skip leading zeroes\n    var res = this;\n    for (var i = 0; i < w.length; i++, res = res.sqr()) {\n      if (w[i] !== 0) break;\n    }\n\n    if (++i < w.length) {\n      for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n        if (w[i] === 0) continue;\n\n        res = res.mul(q);\n      }\n    }\n\n    return res;\n  };\n\n  // Shift-left in-place\n  BN.prototype.iushln = function iushln (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n    var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n    var i;\n\n    if (r !== 0) {\n      var carry = 0;\n\n      for (i = 0; i < this.length; i++) {\n        var newCarry = this.words[i] & carryMask;\n        var c = ((this.words[i] | 0) - newCarry) << r;\n        this.words[i] = c | carry;\n        carry = newCarry >>> (26 - r);\n      }\n\n      if (carry) {\n        this.words[i] = carry;\n        this.length++;\n      }\n    }\n\n    if (s !== 0) {\n      for (i = this.length - 1; i >= 0; i--) {\n        this.words[i + s] = this.words[i];\n      }\n\n      for (i = 0; i < s; i++) {\n        this.words[i] = 0;\n      }\n\n      this.length += s;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ishln = function ishln (bits) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushln(bits);\n  };\n\n  // Shift-right in-place\n  // NOTE: `hint` is a lowest bit before trailing zeroes\n  // NOTE: if `extended` is present - it will be filled with destroyed bits\n  BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var h;\n    if (hint) {\n      h = (hint - (hint % 26)) / 26;\n    } else {\n      h = 0;\n    }\n\n    var r = bits % 26;\n    var s = Math.min((bits - r) / 26, this.length);\n    var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n    var maskedWords = extended;\n\n    h -= s;\n    h = Math.max(0, h);\n\n    // Extended mode, copy masked part\n    if (maskedWords) {\n      for (var i = 0; i < s; i++) {\n        maskedWords.words[i] = this.words[i];\n      }\n      maskedWords.length = s;\n    }\n\n    if (s === 0) {\n      // No-op, we should not move anything at all\n    } else if (this.length > s) {\n      this.length -= s;\n      for (i = 0; i < this.length; i++) {\n        this.words[i] = this.words[i + s];\n      }\n    } else {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    var carry = 0;\n    for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n      var word = this.words[i] | 0;\n      this.words[i] = (carry << (26 - r)) | (word >>> r);\n      carry = word & mask;\n    }\n\n    // Push carried bits as a mask\n    if (maskedWords && carry !== 0) {\n      maskedWords.words[maskedWords.length++] = carry;\n    }\n\n    if (this.length === 0) {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushrn(bits, hint, extended);\n  };\n\n  // Shift-left\n  BN.prototype.shln = function shln (bits) {\n    return this.clone().ishln(bits);\n  };\n\n  BN.prototype.ushln = function ushln (bits) {\n    return this.clone().iushln(bits);\n  };\n\n  // Shift-right\n  BN.prototype.shrn = function shrn (bits) {\n    return this.clone().ishrn(bits);\n  };\n\n  BN.prototype.ushrn = function ushrn (bits) {\n    return this.clone().iushrn(bits);\n  };\n\n  // Test if n bit is set\n  BN.prototype.testn = function testn (bit) {\n    assert(typeof bit === 'number' && bit >= 0);\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) return false;\n\n    // Check bit and return\n    var w = this.words[s];\n\n    return !!(w & q);\n  };\n\n  // Return only lowers bits of number (in-place)\n  BN.prototype.imaskn = function imaskn (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n\n    assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n    if (this.length <= s) {\n      return this;\n    }\n\n    if (r !== 0) {\n      s++;\n    }\n    this.length = Math.min(s, this.length);\n\n    if (r !== 0) {\n      var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n      this.words[this.length - 1] &= mask;\n    }\n\n    return this.strip();\n  };\n\n  // Return only lowers bits of number\n  BN.prototype.maskn = function maskn (bits) {\n    return this.clone().imaskn(bits);\n  };\n\n  // Add plain number `num` to `this`\n  BN.prototype.iaddn = function iaddn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.isubn(-num);\n\n    // Possible sign change\n    if (this.negative !== 0) {\n      if (this.length === 1 && (this.words[0] | 0) < num) {\n        this.words[0] = num - (this.words[0] | 0);\n        this.negative = 0;\n        return this;\n      }\n\n      this.negative = 0;\n      this.isubn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    // Add without checks\n    return this._iaddn(num);\n  };\n\n  BN.prototype._iaddn = function _iaddn (num) {\n    this.words[0] += num;\n\n    // Carry\n    for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n      this.words[i] -= 0x4000000;\n      if (i === this.length - 1) {\n        this.words[i + 1] = 1;\n      } else {\n        this.words[i + 1]++;\n      }\n    }\n    this.length = Math.max(this.length, i + 1);\n\n    return this;\n  };\n\n  // Subtract plain number `num` from `this`\n  BN.prototype.isubn = function isubn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.iaddn(-num);\n\n    if (this.negative !== 0) {\n      this.negative = 0;\n      this.iaddn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    this.words[0] -= num;\n\n    if (this.length === 1 && this.words[0] < 0) {\n      this.words[0] = -this.words[0];\n      this.negative = 1;\n    } else {\n      // Carry\n      for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n        this.words[i] += 0x4000000;\n        this.words[i + 1] -= 1;\n      }\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.addn = function addn (num) {\n    return this.clone().iaddn(num);\n  };\n\n  BN.prototype.subn = function subn (num) {\n    return this.clone().isubn(num);\n  };\n\n  BN.prototype.iabs = function iabs () {\n    this.negative = 0;\n\n    return this;\n  };\n\n  BN.prototype.abs = function abs () {\n    return this.clone().iabs();\n  };\n\n  BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n    var len = num.length + shift;\n    var i;\n\n    this._expand(len);\n\n    var w;\n    var carry = 0;\n    for (i = 0; i < num.length; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      var right = (num.words[i] | 0) * mul;\n      w -= right & 0x3ffffff;\n      carry = (w >> 26) - ((right / 0x4000000) | 0);\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n    for (; i < this.length - shift; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      carry = w >> 26;\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n\n    if (carry === 0) return this.strip();\n\n    // Subtraction overflow\n    assert(carry === -1);\n    carry = 0;\n    for (i = 0; i < this.length; i++) {\n      w = -(this.words[i] | 0) + carry;\n      carry = w >> 26;\n      this.words[i] = w & 0x3ffffff;\n    }\n    this.negative = 1;\n\n    return this.strip();\n  };\n\n  BN.prototype._wordDiv = function _wordDiv (num, mode) {\n    var shift = this.length - num.length;\n\n    var a = this.clone();\n    var b = num;\n\n    // Normalize\n    var bhi = b.words[b.length - 1] | 0;\n    var bhiBits = this._countBits(bhi);\n    shift = 26 - bhiBits;\n    if (shift !== 0) {\n      b = b.ushln(shift);\n      a.iushln(shift);\n      bhi = b.words[b.length - 1] | 0;\n    }\n\n    // Initialize quotient\n    var m = a.length - b.length;\n    var q;\n\n    if (mode !== 'mod') {\n      q = new BN(null);\n      q.length = m + 1;\n      q.words = new Array(q.length);\n      for (var i = 0; i < q.length; i++) {\n        q.words[i] = 0;\n      }\n    }\n\n    var diff = a.clone()._ishlnsubmul(b, 1, m);\n    if (diff.negative === 0) {\n      a = diff;\n      if (q) {\n        q.words[m] = 1;\n      }\n    }\n\n    for (var j = m - 1; j >= 0; j--) {\n      var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n        (a.words[b.length + j - 1] | 0);\n\n      // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n      // (0x7ffffff)\n      qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n      a._ishlnsubmul(b, qj, j);\n      while (a.negative !== 0) {\n        qj--;\n        a.negative = 0;\n        a._ishlnsubmul(b, 1, j);\n        if (!a.isZero()) {\n          a.negative ^= 1;\n        }\n      }\n      if (q) {\n        q.words[j] = qj;\n      }\n    }\n    if (q) {\n      q.strip();\n    }\n    a.strip();\n\n    // Denormalize\n    if (mode !== 'div' && shift !== 0) {\n      a.iushrn(shift);\n    }\n\n    return {\n      div: q || null,\n      mod: a\n    };\n  };\n\n  // NOTE: 1) `mode` can be set to `mod` to request mod only,\n  //       to `div` to request div only, or be absent to\n  //       request both div & mod\n  //       2) `positive` is true if unsigned mod is requested\n  BN.prototype.divmod = function divmod (num, mode, positive) {\n    assert(!num.isZero());\n\n    if (this.isZero()) {\n      return {\n        div: new BN(0),\n        mod: new BN(0)\n      };\n    }\n\n    var div, mod, res;\n    if (this.negative !== 0 && num.negative === 0) {\n      res = this.neg().divmod(num, mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.iadd(num);\n        }\n      }\n\n      return {\n        div: div,\n        mod: mod\n      };\n    }\n\n    if (this.negative === 0 && num.negative !== 0) {\n      res = this.divmod(num.neg(), mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      return {\n        div: div,\n        mod: res.mod\n      };\n    }\n\n    if ((this.negative & num.negative) !== 0) {\n      res = this.neg().divmod(num.neg(), mode);\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.isub(num);\n        }\n      }\n\n      return {\n        div: res.div,\n        mod: mod\n      };\n    }\n\n    // Both numbers are positive at this point\n\n    // Strip both numbers to approximate shift value\n    if (num.length > this.length || this.cmp(num) < 0) {\n      return {\n        div: new BN(0),\n        mod: this\n      };\n    }\n\n    // Very short reduction\n    if (num.length === 1) {\n      if (mode === 'div') {\n        return {\n          div: this.divn(num.words[0]),\n          mod: null\n        };\n      }\n\n      if (mode === 'mod') {\n        return {\n          div: null,\n          mod: new BN(this.modn(num.words[0]))\n        };\n      }\n\n      return {\n        div: this.divn(num.words[0]),\n        mod: new BN(this.modn(num.words[0]))\n      };\n    }\n\n    return this._wordDiv(num, mode);\n  };\n\n  // Find `this` / `num`\n  BN.prototype.div = function div (num) {\n    return this.divmod(num, 'div', false).div;\n  };\n\n  // Find `this` % `num`\n  BN.prototype.mod = function mod (num) {\n    return this.divmod(num, 'mod', false).mod;\n  };\n\n  BN.prototype.umod = function umod (num) {\n    return this.divmod(num, 'mod', true).mod;\n  };\n\n  // Find Round(`this` / `num`)\n  BN.prototype.divRound = function divRound (num) {\n    var dm = this.divmod(num);\n\n    // Fast case - exact division\n    if (dm.mod.isZero()) return dm.div;\n\n    var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n    var half = num.ushrn(1);\n    var r2 = num.andln(1);\n    var cmp = mod.cmp(half);\n\n    // Round down\n    if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n    // Round up\n    return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n  };\n\n  BN.prototype.modn = function modn (num) {\n    assert(num <= 0x3ffffff);\n    var p = (1 << 26) % num;\n\n    var acc = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      acc = (p * acc + (this.words[i] | 0)) % num;\n    }\n\n    return acc;\n  };\n\n  // In-place division by number\n  BN.prototype.idivn = function idivn (num) {\n    assert(num <= 0x3ffffff);\n\n    var carry = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var w = (this.words[i] | 0) + carry * 0x4000000;\n      this.words[i] = (w / num) | 0;\n      carry = w % num;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.divn = function divn (num) {\n    return this.clone().idivn(num);\n  };\n\n  BN.prototype.egcd = function egcd (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var x = this;\n    var y = p.clone();\n\n    if (x.negative !== 0) {\n      x = x.umod(p);\n    } else {\n      x = x.clone();\n    }\n\n    // A * x + B * y = x\n    var A = new BN(1);\n    var B = new BN(0);\n\n    // C * x + D * y = y\n    var C = new BN(0);\n    var D = new BN(1);\n\n    var g = 0;\n\n    while (x.isEven() && y.isEven()) {\n      x.iushrn(1);\n      y.iushrn(1);\n      ++g;\n    }\n\n    var yp = y.clone();\n    var xp = x.clone();\n\n    while (!x.isZero()) {\n      for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        x.iushrn(i);\n        while (i-- > 0) {\n          if (A.isOdd() || B.isOdd()) {\n            A.iadd(yp);\n            B.isub(xp);\n          }\n\n          A.iushrn(1);\n          B.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        y.iushrn(j);\n        while (j-- > 0) {\n          if (C.isOdd() || D.isOdd()) {\n            C.iadd(yp);\n            D.isub(xp);\n          }\n\n          C.iushrn(1);\n          D.iushrn(1);\n        }\n      }\n\n      if (x.cmp(y) >= 0) {\n        x.isub(y);\n        A.isub(C);\n        B.isub(D);\n      } else {\n        y.isub(x);\n        C.isub(A);\n        D.isub(B);\n      }\n    }\n\n    return {\n      a: C,\n      b: D,\n      gcd: y.iushln(g)\n    };\n  };\n\n  // This is reduced incarnation of the binary EEA\n  // above, designated to invert members of the\n  // _prime_ fields F(p) at a maximal speed\n  BN.prototype._invmp = function _invmp (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var a = this;\n    var b = p.clone();\n\n    if (a.negative !== 0) {\n      a = a.umod(p);\n    } else {\n      a = a.clone();\n    }\n\n    var x1 = new BN(1);\n    var x2 = new BN(0);\n\n    var delta = b.clone();\n\n    while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n      for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        a.iushrn(i);\n        while (i-- > 0) {\n          if (x1.isOdd()) {\n            x1.iadd(delta);\n          }\n\n          x1.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        b.iushrn(j);\n        while (j-- > 0) {\n          if (x2.isOdd()) {\n            x2.iadd(delta);\n          }\n\n          x2.iushrn(1);\n        }\n      }\n\n      if (a.cmp(b) >= 0) {\n        a.isub(b);\n        x1.isub(x2);\n      } else {\n        b.isub(a);\n        x2.isub(x1);\n      }\n    }\n\n    var res;\n    if (a.cmpn(1) === 0) {\n      res = x1;\n    } else {\n      res = x2;\n    }\n\n    if (res.cmpn(0) < 0) {\n      res.iadd(p);\n    }\n\n    return res;\n  };\n\n  BN.prototype.gcd = function gcd (num) {\n    if (this.isZero()) return num.abs();\n    if (num.isZero()) return this.abs();\n\n    var a = this.clone();\n    var b = num.clone();\n    a.negative = 0;\n    b.negative = 0;\n\n    // Remove common factor of two\n    for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n      a.iushrn(1);\n      b.iushrn(1);\n    }\n\n    do {\n      while (a.isEven()) {\n        a.iushrn(1);\n      }\n      while (b.isEven()) {\n        b.iushrn(1);\n      }\n\n      var r = a.cmp(b);\n      if (r < 0) {\n        // Swap `a` and `b` to make `a` always bigger than `b`\n        var t = a;\n        a = b;\n        b = t;\n      } else if (r === 0 || b.cmpn(1) === 0) {\n        break;\n      }\n\n      a.isub(b);\n    } while (true);\n\n    return b.iushln(shift);\n  };\n\n  // Invert number in the field F(num)\n  BN.prototype.invm = function invm (num) {\n    return this.egcd(num).a.umod(num);\n  };\n\n  BN.prototype.isEven = function isEven () {\n    return (this.words[0] & 1) === 0;\n  };\n\n  BN.prototype.isOdd = function isOdd () {\n    return (this.words[0] & 1) === 1;\n  };\n\n  // And first word and num\n  BN.prototype.andln = function andln (num) {\n    return this.words[0] & num;\n  };\n\n  // Increment at the bit position in-line\n  BN.prototype.bincn = function bincn (bit) {\n    assert(typeof bit === 'number');\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) {\n      this._expand(s + 1);\n      this.words[s] |= q;\n      return this;\n    }\n\n    // Add bit and propagate, if needed\n    var carry = q;\n    for (var i = s; carry !== 0 && i < this.length; i++) {\n      var w = this.words[i] | 0;\n      w += carry;\n      carry = w >>> 26;\n      w &= 0x3ffffff;\n      this.words[i] = w;\n    }\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n    return this;\n  };\n\n  BN.prototype.isZero = function isZero () {\n    return this.length === 1 && this.words[0] === 0;\n  };\n\n  BN.prototype.cmpn = function cmpn (num) {\n    var negative = num < 0;\n\n    if (this.negative !== 0 && !negative) return -1;\n    if (this.negative === 0 && negative) return 1;\n\n    this.strip();\n\n    var res;\n    if (this.length > 1) {\n      res = 1;\n    } else {\n      if (negative) {\n        num = -num;\n      }\n\n      assert(num <= 0x3ffffff, 'Number is too big');\n\n      var w = this.words[0] | 0;\n      res = w === num ? 0 : w < num ? -1 : 1;\n    }\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Compare two numbers and return:\n  // 1 - if `this` > `num`\n  // 0 - if `this` == `num`\n  // -1 - if `this` < `num`\n  BN.prototype.cmp = function cmp (num) {\n    if (this.negative !== 0 && num.negative === 0) return -1;\n    if (this.negative === 0 && num.negative !== 0) return 1;\n\n    var res = this.ucmp(num);\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Unsigned comparison\n  BN.prototype.ucmp = function ucmp (num) {\n    // At this point both numbers have the same sign\n    if (this.length > num.length) return 1;\n    if (this.length < num.length) return -1;\n\n    var res = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var a = this.words[i] | 0;\n      var b = num.words[i] | 0;\n\n      if (a === b) continue;\n      if (a < b) {\n        res = -1;\n      } else if (a > b) {\n        res = 1;\n      }\n      break;\n    }\n    return res;\n  };\n\n  BN.prototype.gtn = function gtn (num) {\n    return this.cmpn(num) === 1;\n  };\n\n  BN.prototype.gt = function gt (num) {\n    return this.cmp(num) === 1;\n  };\n\n  BN.prototype.gten = function gten (num) {\n    return this.cmpn(num) >= 0;\n  };\n\n  BN.prototype.gte = function gte (num) {\n    return this.cmp(num) >= 0;\n  };\n\n  BN.prototype.ltn = function ltn (num) {\n    return this.cmpn(num) === -1;\n  };\n\n  BN.prototype.lt = function lt (num) {\n    return this.cmp(num) === -1;\n  };\n\n  BN.prototype.lten = function lten (num) {\n    return this.cmpn(num) <= 0;\n  };\n\n  BN.prototype.lte = function lte (num) {\n    return this.cmp(num) <= 0;\n  };\n\n  BN.prototype.eqn = function eqn (num) {\n    return this.cmpn(num) === 0;\n  };\n\n  BN.prototype.eq = function eq (num) {\n    return this.cmp(num) === 0;\n  };\n\n  //\n  // A reduce context, could be using montgomery or something better, depending\n  // on the `m` itself.\n  //\n  BN.red = function red (num) {\n    return new Red(num);\n  };\n\n  BN.prototype.toRed = function toRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    assert(this.negative === 0, 'red works only with positives');\n    return ctx.convertTo(this)._forceRed(ctx);\n  };\n\n  BN.prototype.fromRed = function fromRed () {\n    assert(this.red, 'fromRed works only with numbers in reduction context');\n    return this.red.convertFrom(this);\n  };\n\n  BN.prototype._forceRed = function _forceRed (ctx) {\n    this.red = ctx;\n    return this;\n  };\n\n  BN.prototype.forceRed = function forceRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    return this._forceRed(ctx);\n  };\n\n  BN.prototype.redAdd = function redAdd (num) {\n    assert(this.red, 'redAdd works only with red numbers');\n    return this.red.add(this, num);\n  };\n\n  BN.prototype.redIAdd = function redIAdd (num) {\n    assert(this.red, 'redIAdd works only with red numbers');\n    return this.red.iadd(this, num);\n  };\n\n  BN.prototype.redSub = function redSub (num) {\n    assert(this.red, 'redSub works only with red numbers');\n    return this.red.sub(this, num);\n  };\n\n  BN.prototype.redISub = function redISub (num) {\n    assert(this.red, 'redISub works only with red numbers');\n    return this.red.isub(this, num);\n  };\n\n  BN.prototype.redShl = function redShl (num) {\n    assert(this.red, 'redShl works only with red numbers');\n    return this.red.shl(this, num);\n  };\n\n  BN.prototype.redMul = function redMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.mul(this, num);\n  };\n\n  BN.prototype.redIMul = function redIMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.imul(this, num);\n  };\n\n  BN.prototype.redSqr = function redSqr () {\n    assert(this.red, 'redSqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqr(this);\n  };\n\n  BN.prototype.redISqr = function redISqr () {\n    assert(this.red, 'redISqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.isqr(this);\n  };\n\n  // Square root over p\n  BN.prototype.redSqrt = function redSqrt () {\n    assert(this.red, 'redSqrt works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqrt(this);\n  };\n\n  BN.prototype.redInvm = function redInvm () {\n    assert(this.red, 'redInvm works only with red numbers');\n    this.red._verify1(this);\n    return this.red.invm(this);\n  };\n\n  // Return negative clone of `this` % `red modulo`\n  BN.prototype.redNeg = function redNeg () {\n    assert(this.red, 'redNeg works only with red numbers');\n    this.red._verify1(this);\n    return this.red.neg(this);\n  };\n\n  BN.prototype.redPow = function redPow (num) {\n    assert(this.red && !num.red, 'redPow(normalNum)');\n    this.red._verify1(this);\n    return this.red.pow(this, num);\n  };\n\n  // Prime numbers with efficient reduction\n  var primes = {\n    k256: null,\n    p224: null,\n    p192: null,\n    p25519: null\n  };\n\n  // Pseudo-Mersenne prime\n  function MPrime (name, p) {\n    // P = 2 ^ N - K\n    this.name = name;\n    this.p = new BN(p, 16);\n    this.n = this.p.bitLength();\n    this.k = new BN(1).iushln(this.n).isub(this.p);\n\n    this.tmp = this._tmp();\n  }\n\n  MPrime.prototype._tmp = function _tmp () {\n    var tmp = new BN(null);\n    tmp.words = new Array(Math.ceil(this.n / 13));\n    return tmp;\n  };\n\n  MPrime.prototype.ireduce = function ireduce (num) {\n    // Assumes that `num` is less than `P^2`\n    // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n    var r = num;\n    var rlen;\n\n    do {\n      this.split(r, this.tmp);\n      r = this.imulK(r);\n      r = r.iadd(this.tmp);\n      rlen = r.bitLength();\n    } while (rlen > this.n);\n\n    var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n    if (cmp === 0) {\n      r.words[0] = 0;\n      r.length = 1;\n    } else if (cmp > 0) {\n      r.isub(this.p);\n    } else {\n      if (r.strip !== undefined) {\n        // r is BN v4 instance\n        r.strip();\n      } else {\n        // r is BN v5 instance\n        r._strip();\n      }\n    }\n\n    return r;\n  };\n\n  MPrime.prototype.split = function split (input, out) {\n    input.iushrn(this.n, 0, out);\n  };\n\n  MPrime.prototype.imulK = function imulK (num) {\n    return num.imul(this.k);\n  };\n\n  function K256 () {\n    MPrime.call(\n      this,\n      'k256',\n      'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n  }\n  inherits(K256, MPrime);\n\n  K256.prototype.split = function split (input, output) {\n    // 256 = 9 * 26 + 22\n    var mask = 0x3fffff;\n\n    var outLen = Math.min(input.length, 9);\n    for (var i = 0; i < outLen; i++) {\n      output.words[i] = input.words[i];\n    }\n    output.length = outLen;\n\n    if (input.length <= 9) {\n      input.words[0] = 0;\n      input.length = 1;\n      return;\n    }\n\n    // Shift by 9 limbs\n    var prev = input.words[9];\n    output.words[output.length++] = prev & mask;\n\n    for (i = 10; i < input.length; i++) {\n      var next = input.words[i] | 0;\n      input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n      prev = next;\n    }\n    prev >>>= 22;\n    input.words[i - 10] = prev;\n    if (prev === 0 && input.length > 10) {\n      input.length -= 10;\n    } else {\n      input.length -= 9;\n    }\n  };\n\n  K256.prototype.imulK = function imulK (num) {\n    // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n    num.words[num.length] = 0;\n    num.words[num.length + 1] = 0;\n    num.length += 2;\n\n    // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n    var lo = 0;\n    for (var i = 0; i < num.length; i++) {\n      var w = num.words[i] | 0;\n      lo += w * 0x3d1;\n      num.words[i] = lo & 0x3ffffff;\n      lo = w * 0x40 + ((lo / 0x4000000) | 0);\n    }\n\n    // Fast length reduction\n    if (num.words[num.length - 1] === 0) {\n      num.length--;\n      if (num.words[num.length - 1] === 0) {\n        num.length--;\n      }\n    }\n    return num;\n  };\n\n  function P224 () {\n    MPrime.call(\n      this,\n      'p224',\n      'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n  }\n  inherits(P224, MPrime);\n\n  function P192 () {\n    MPrime.call(\n      this,\n      'p192',\n      'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n  }\n  inherits(P192, MPrime);\n\n  function P25519 () {\n    // 2 ^ 255 - 19\n    MPrime.call(\n      this,\n      '25519',\n      '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n  }\n  inherits(P25519, MPrime);\n\n  P25519.prototype.imulK = function imulK (num) {\n    // K = 0x13\n    var carry = 0;\n    for (var i = 0; i < num.length; i++) {\n      var hi = (num.words[i] | 0) * 0x13 + carry;\n      var lo = hi & 0x3ffffff;\n      hi >>>= 26;\n\n      num.words[i] = lo;\n      carry = hi;\n    }\n    if (carry !== 0) {\n      num.words[num.length++] = carry;\n    }\n    return num;\n  };\n\n  // Exported mostly for testing purposes, use plain name instead\n  BN._prime = function prime (name) {\n    // Cached version of prime\n    if (primes[name]) return primes[name];\n\n    var prime;\n    if (name === 'k256') {\n      prime = new K256();\n    } else if (name === 'p224') {\n      prime = new P224();\n    } else if (name === 'p192') {\n      prime = new P192();\n    } else if (name === 'p25519') {\n      prime = new P25519();\n    } else {\n      throw new Error('Unknown prime ' + name);\n    }\n    primes[name] = prime;\n\n    return prime;\n  };\n\n  //\n  // Base reduction engine\n  //\n  function Red (m) {\n    if (typeof m === 'string') {\n      var prime = BN._prime(m);\n      this.m = prime.p;\n      this.prime = prime;\n    } else {\n      assert(m.gtn(1), 'modulus must be greater than 1');\n      this.m = m;\n      this.prime = null;\n    }\n  }\n\n  Red.prototype._verify1 = function _verify1 (a) {\n    assert(a.negative === 0, 'red works only with positives');\n    assert(a.red, 'red works only with red numbers');\n  };\n\n  Red.prototype._verify2 = function _verify2 (a, b) {\n    assert((a.negative | b.negative) === 0, 'red works only with positives');\n    assert(a.red && a.red === b.red,\n      'red works only with red numbers');\n  };\n\n  Red.prototype.imod = function imod (a) {\n    if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n    return a.umod(this.m)._forceRed(this);\n  };\n\n  Red.prototype.neg = function neg (a) {\n    if (a.isZero()) {\n      return a.clone();\n    }\n\n    return this.m.sub(a)._forceRed(this);\n  };\n\n  Red.prototype.add = function add (a, b) {\n    this._verify2(a, b);\n\n    var res = a.add(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.iadd = function iadd (a, b) {\n    this._verify2(a, b);\n\n    var res = a.iadd(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.sub = function sub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.sub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.isub = function isub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.isub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.shl = function shl (a, num) {\n    this._verify1(a);\n    return this.imod(a.ushln(num));\n  };\n\n  Red.prototype.imul = function imul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.imul(b));\n  };\n\n  Red.prototype.mul = function mul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.mul(b));\n  };\n\n  Red.prototype.isqr = function isqr (a) {\n    return this.imul(a, a.clone());\n  };\n\n  Red.prototype.sqr = function sqr (a) {\n    return this.mul(a, a);\n  };\n\n  Red.prototype.sqrt = function sqrt (a) {\n    if (a.isZero()) return a.clone();\n\n    var mod3 = this.m.andln(3);\n    assert(mod3 % 2 === 1);\n\n    // Fast case\n    if (mod3 === 3) {\n      var pow = this.m.add(new BN(1)).iushrn(2);\n      return this.pow(a, pow);\n    }\n\n    // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n    //\n    // Find Q and S, that Q * 2 ^ S = (P - 1)\n    var q = this.m.subn(1);\n    var s = 0;\n    while (!q.isZero() && q.andln(1) === 0) {\n      s++;\n      q.iushrn(1);\n    }\n    assert(!q.isZero());\n\n    var one = new BN(1).toRed(this);\n    var nOne = one.redNeg();\n\n    // Find quadratic non-residue\n    // NOTE: Max is such because of generalized Riemann hypothesis.\n    var lpow = this.m.subn(1).iushrn(1);\n    var z = this.m.bitLength();\n    z = new BN(2 * z * z).toRed(this);\n\n    while (this.pow(z, lpow).cmp(nOne) !== 0) {\n      z.redIAdd(nOne);\n    }\n\n    var c = this.pow(z, q);\n    var r = this.pow(a, q.addn(1).iushrn(1));\n    var t = this.pow(a, q);\n    var m = s;\n    while (t.cmp(one) !== 0) {\n      var tmp = t;\n      for (var i = 0; tmp.cmp(one) !== 0; i++) {\n        tmp = tmp.redSqr();\n      }\n      assert(i < m);\n      var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n      r = r.redMul(b);\n      c = b.redSqr();\n      t = t.redMul(c);\n      m = i;\n    }\n\n    return r;\n  };\n\n  Red.prototype.invm = function invm (a) {\n    var inv = a._invmp(this.m);\n    if (inv.negative !== 0) {\n      inv.negative = 0;\n      return this.imod(inv).redNeg();\n    } else {\n      return this.imod(inv);\n    }\n  };\n\n  Red.prototype.pow = function pow (a, num) {\n    if (num.isZero()) return new BN(1).toRed(this);\n    if (num.cmpn(1) === 0) return a.clone();\n\n    var windowSize = 4;\n    var wnd = new Array(1 << windowSize);\n    wnd[0] = new BN(1).toRed(this);\n    wnd[1] = a;\n    for (var i = 2; i < wnd.length; i++) {\n      wnd[i] = this.mul(wnd[i - 1], a);\n    }\n\n    var res = wnd[0];\n    var current = 0;\n    var currentLen = 0;\n    var start = num.bitLength() % 26;\n    if (start === 0) {\n      start = 26;\n    }\n\n    for (i = num.length - 1; i >= 0; i--) {\n      var word = num.words[i];\n      for (var j = start - 1; j >= 0; j--) {\n        var bit = (word >> j) & 1;\n        if (res !== wnd[0]) {\n          res = this.sqr(res);\n        }\n\n        if (bit === 0 && current === 0) {\n          currentLen = 0;\n          continue;\n        }\n\n        current <<= 1;\n        current |= bit;\n        currentLen++;\n        if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n        res = this.mul(res, wnd[current]);\n        currentLen = 0;\n        current = 0;\n      }\n      start = 26;\n    }\n\n    return res;\n  };\n\n  Red.prototype.convertTo = function convertTo (num) {\n    var r = num.umod(this.m);\n\n    return r === num ? r.clone() : r;\n  };\n\n  Red.prototype.convertFrom = function convertFrom (num) {\n    var res = num.clone();\n    res.red = null;\n    return res;\n  };\n\n  //\n  // Montgomery method engine\n  //\n\n  BN.mont = function mont (num) {\n    return new Mont(num);\n  };\n\n  function Mont (m) {\n    Red.call(this, m);\n\n    this.shift = this.m.bitLength();\n    if (this.shift % 26 !== 0) {\n      this.shift += 26 - (this.shift % 26);\n    }\n\n    this.r = new BN(1).iushln(this.shift);\n    this.r2 = this.imod(this.r.sqr());\n    this.rinv = this.r._invmp(this.m);\n\n    this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n    this.minv = this.minv.umod(this.r);\n    this.minv = this.r.sub(this.minv);\n  }\n  inherits(Mont, Red);\n\n  Mont.prototype.convertTo = function convertTo (num) {\n    return this.imod(num.ushln(this.shift));\n  };\n\n  Mont.prototype.convertFrom = function convertFrom (num) {\n    var r = this.imod(num.mul(this.rinv));\n    r.red = null;\n    return r;\n  };\n\n  Mont.prototype.imul = function imul (a, b) {\n    if (a.isZero() || b.isZero()) {\n      a.words[0] = 0;\n      a.length = 1;\n      return a;\n    }\n\n    var t = a.imul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.mul = function mul (a, b) {\n    if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n    var t = a.mul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.invm = function invm (a) {\n    // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n    var res = this.imod(a._invmp(this.m).mul(this.r2));\n    return res._forceRed(this);\n  };\n})(typeof module === 'undefined' || module, this);\n","'use strict';\n\nconst inherits = require('inherits');\n\nconst bignum = require('bn.js');\nconst DecoderBuffer = require('../base/buffer').DecoderBuffer;\nconst Node = require('../base/node');\n\n// Import DER constants\nconst der = require('../constants/der');\n\nfunction DERDecoder(entity) {\n  this.enc = 'der';\n  this.name = entity.name;\n  this.entity = entity;\n\n  // Construct base tree\n  this.tree = new DERNode();\n  this.tree._init(entity.body);\n}\nmodule.exports = DERDecoder;\n\nDERDecoder.prototype.decode = function decode(data, options) {\n  if (!DecoderBuffer.isDecoderBuffer(data)) {\n    data = new DecoderBuffer(data, options);\n  }\n\n  return this.tree._decode(data, options);\n};\n\n// Tree methods\n\nfunction DERNode(parent) {\n  Node.call(this, 'der', parent);\n}\ninherits(DERNode, Node);\n\nDERNode.prototype._peekTag = function peekTag(buffer, tag, any) {\n  if (buffer.isEmpty())\n    return false;\n\n  const state = buffer.save();\n  const decodedTag = derDecodeTag(buffer, 'Failed to peek tag: \"' + tag + '\"');\n  if (buffer.isError(decodedTag))\n    return decodedTag;\n\n  buffer.restore(state);\n\n  return decodedTag.tag === tag || decodedTag.tagStr === tag ||\n    (decodedTag.tagStr + 'of') === tag || any;\n};\n\nDERNode.prototype._decodeTag = function decodeTag(buffer, tag, any) {\n  const decodedTag = derDecodeTag(buffer,\n    'Failed to decode tag of \"' + tag + '\"');\n  if (buffer.isError(decodedTag))\n    return decodedTag;\n\n  let len = derDecodeLen(buffer,\n    decodedTag.primitive,\n    'Failed to get length of \"' + tag + '\"');\n\n  // Failure\n  if (buffer.isError(len))\n    return len;\n\n  if (!any &&\n      decodedTag.tag !== tag &&\n      decodedTag.tagStr !== tag &&\n      decodedTag.tagStr + 'of' !== tag) {\n    return buffer.error('Failed to match tag: \"' + tag + '\"');\n  }\n\n  if (decodedTag.primitive || len !== null)\n    return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n\n  // Indefinite length... find END tag\n  const state = buffer.save();\n  const res = this._skipUntilEnd(\n    buffer,\n    'Failed to skip indefinite length body: \"' + this.tag + '\"');\n  if (buffer.isError(res))\n    return res;\n\n  len = buffer.offset - state.offset;\n  buffer.restore(state);\n  return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n};\n\nDERNode.prototype._skipUntilEnd = function skipUntilEnd(buffer, fail) {\n  for (;;) {\n    const tag = derDecodeTag(buffer, fail);\n    if (buffer.isError(tag))\n      return tag;\n    const len = derDecodeLen(buffer, tag.primitive, fail);\n    if (buffer.isError(len))\n      return len;\n\n    let res;\n    if (tag.primitive || len !== null)\n      res = buffer.skip(len);\n    else\n      res = this._skipUntilEnd(buffer, fail);\n\n    // Failure\n    if (buffer.isError(res))\n      return res;\n\n    if (tag.tagStr === 'end')\n      break;\n  }\n};\n\nDERNode.prototype._decodeList = function decodeList(buffer, tag, decoder,\n  options) {\n  const result = [];\n  while (!buffer.isEmpty()) {\n    const possibleEnd = this._peekTag(buffer, 'end');\n    if (buffer.isError(possibleEnd))\n      return possibleEnd;\n\n    const res = decoder.decode(buffer, 'der', options);\n    if (buffer.isError(res) && possibleEnd)\n      break;\n    result.push(res);\n  }\n  return result;\n};\n\nDERNode.prototype._decodeStr = function decodeStr(buffer, tag) {\n  if (tag === 'bitstr') {\n    const unused = buffer.readUInt8();\n    if (buffer.isError(unused))\n      return unused;\n    return { unused: unused, data: buffer.raw() };\n  } else if (tag === 'bmpstr') {\n    const raw = buffer.raw();\n    if (raw.length % 2 === 1)\n      return buffer.error('Decoding of string type: bmpstr length mismatch');\n\n    let str = '';\n    for (let i = 0; i < raw.length / 2; i++) {\n      str += String.fromCharCode(raw.readUInt16BE(i * 2));\n    }\n    return str;\n  } else if (tag === 'numstr') {\n    const numstr = buffer.raw().toString('ascii');\n    if (!this._isNumstr(numstr)) {\n      return buffer.error('Decoding of string type: ' +\n                          'numstr unsupported characters');\n    }\n    return numstr;\n  } else if (tag === 'octstr') {\n    return buffer.raw();\n  } else if (tag === 'objDesc') {\n    return buffer.raw();\n  } else if (tag === 'printstr') {\n    const printstr = buffer.raw().toString('ascii');\n    if (!this._isPrintstr(printstr)) {\n      return buffer.error('Decoding of string type: ' +\n                          'printstr unsupported characters');\n    }\n    return printstr;\n  } else if (/str$/.test(tag)) {\n    return buffer.raw().toString();\n  } else {\n    return buffer.error('Decoding of string type: ' + tag + ' unsupported');\n  }\n};\n\nDERNode.prototype._decodeObjid = function decodeObjid(buffer, values, relative) {\n  let result;\n  const identifiers = [];\n  let ident = 0;\n  let subident = 0;\n  while (!buffer.isEmpty()) {\n    subident = buffer.readUInt8();\n    ident <<= 7;\n    ident |= subident & 0x7f;\n    if ((subident & 0x80) === 0) {\n      identifiers.push(ident);\n      ident = 0;\n    }\n  }\n  if (subident & 0x80)\n    identifiers.push(ident);\n\n  const first = (identifiers[0] / 40) | 0;\n  const second = identifiers[0] % 40;\n\n  if (relative)\n    result = identifiers;\n  else\n    result = [first, second].concat(identifiers.slice(1));\n\n  if (values) {\n    let tmp = values[result.join(' ')];\n    if (tmp === undefined)\n      tmp = values[result.join('.')];\n    if (tmp !== undefined)\n      result = tmp;\n  }\n\n  return result;\n};\n\nDERNode.prototype._decodeTime = function decodeTime(buffer, tag) {\n  const str = buffer.raw().toString();\n\n  let year;\n  let mon;\n  let day;\n  let hour;\n  let min;\n  let sec;\n  if (tag === 'gentime') {\n    year = str.slice(0, 4) | 0;\n    mon = str.slice(4, 6) | 0;\n    day = str.slice(6, 8) | 0;\n    hour = str.slice(8, 10) | 0;\n    min = str.slice(10, 12) | 0;\n    sec = str.slice(12, 14) | 0;\n  } else if (tag === 'utctime') {\n    year = str.slice(0, 2) | 0;\n    mon = str.slice(2, 4) | 0;\n    day = str.slice(4, 6) | 0;\n    hour = str.slice(6, 8) | 0;\n    min = str.slice(8, 10) | 0;\n    sec = str.slice(10, 12) | 0;\n    if (year < 70)\n      year = 2000 + year;\n    else\n      year = 1900 + year;\n  } else {\n    return buffer.error('Decoding ' + tag + ' time is not supported yet');\n  }\n\n  return Date.UTC(year, mon - 1, day, hour, min, sec, 0);\n};\n\nDERNode.prototype._decodeNull = function decodeNull() {\n  return null;\n};\n\nDERNode.prototype._decodeBool = function decodeBool(buffer) {\n  const res = buffer.readUInt8();\n  if (buffer.isError(res))\n    return res;\n  else\n    return res !== 0;\n};\n\nDERNode.prototype._decodeInt = function decodeInt(buffer, values) {\n  // Bigint, return as it is (assume big endian)\n  const raw = buffer.raw();\n  let res = new bignum(raw);\n\n  if (values)\n    res = values[res.toString(10)] || res;\n\n  return res;\n};\n\nDERNode.prototype._use = function use(entity, obj) {\n  if (typeof entity === 'function')\n    entity = entity(obj);\n  return entity._getDecoder('der').tree;\n};\n\n// Utility methods\n\nfunction derDecodeTag(buf, fail) {\n  let tag = buf.readUInt8(fail);\n  if (buf.isError(tag))\n    return tag;\n\n  const cls = der.tagClass[tag >> 6];\n  const primitive = (tag & 0x20) === 0;\n\n  // Multi-octet tag - load\n  if ((tag & 0x1f) === 0x1f) {\n    let oct = tag;\n    tag = 0;\n    while ((oct & 0x80) === 0x80) {\n      oct = buf.readUInt8(fail);\n      if (buf.isError(oct))\n        return oct;\n\n      tag <<= 7;\n      tag |= oct & 0x7f;\n    }\n  } else {\n    tag &= 0x1f;\n  }\n  const tagStr = der.tag[tag];\n\n  return {\n    cls: cls,\n    primitive: primitive,\n    tag: tag,\n    tagStr: tagStr\n  };\n}\n\nfunction derDecodeLen(buf, primitive, fail) {\n  let len = buf.readUInt8(fail);\n  if (buf.isError(len))\n    return len;\n\n  // Indefinite form\n  if (!primitive && len === 0x80)\n    return null;\n\n  // Definite form\n  if ((len & 0x80) === 0) {\n    // Short form\n    return len;\n  }\n\n  // Long form\n  const num = len & 0x7f;\n  if (num > 4)\n    return buf.error('length octect is too long');\n\n  len = 0;\n  for (let i = 0; i < num; i++) {\n    len <<= 8;\n    const j = buf.readUInt8(fail);\n    if (buf.isError(j))\n      return j;\n    len |= j;\n  }\n\n  return len;\n}\n","'use strict';\n\nconst inherits = require('inherits');\n\nfunction Reporter(options) {\n  this._reporterState = {\n    obj: null,\n    path: [],\n    options: options || {},\n    errors: []\n  };\n}\nexports.Reporter = Reporter;\n\nReporter.prototype.isError = function isError(obj) {\n  return obj instanceof ReporterError;\n};\n\nReporter.prototype.save = function save() {\n  const state = this._reporterState;\n\n  return { obj: state.obj, pathLen: state.path.length };\n};\n\nReporter.prototype.restore = function restore(data) {\n  const state = this._reporterState;\n\n  state.obj = data.obj;\n  state.path = state.path.slice(0, data.pathLen);\n};\n\nReporter.prototype.enterKey = function enterKey(key) {\n  return this._reporterState.path.push(key);\n};\n\nReporter.prototype.exitKey = function exitKey(index) {\n  const state = this._reporterState;\n\n  state.path = state.path.slice(0, index - 1);\n};\n\nReporter.prototype.leaveKey = function leaveKey(index, key, value) {\n  const state = this._reporterState;\n\n  this.exitKey(index);\n  if (state.obj !== null)\n    state.obj[key] = value;\n};\n\nReporter.prototype.path = function path() {\n  return this._reporterState.path.join('/');\n};\n\nReporter.prototype.enterObject = function enterObject() {\n  const state = this._reporterState;\n\n  const prev = state.obj;\n  state.obj = {};\n  return prev;\n};\n\nReporter.prototype.leaveObject = function leaveObject(prev) {\n  const state = this._reporterState;\n\n  const now = state.obj;\n  state.obj = prev;\n  return now;\n};\n\nReporter.prototype.error = function error(msg) {\n  let err;\n  const state = this._reporterState;\n\n  const inherited = msg instanceof ReporterError;\n  if (inherited) {\n    err = msg;\n  } else {\n    err = new ReporterError(state.path.map(function(elem) {\n      return '[' + JSON.stringify(elem) + ']';\n    }).join(''), msg.message || msg, msg.stack);\n  }\n\n  if (!state.options.partial)\n    throw err;\n\n  if (!inherited)\n    state.errors.push(err);\n\n  return err;\n};\n\nReporter.prototype.wrapResult = function wrapResult(result) {\n  const state = this._reporterState;\n  if (!state.options.partial)\n    return result;\n\n  return {\n    result: this.isError(result) ? null : result,\n    errors: state.errors\n  };\n};\n\nfunction ReporterError(path, msg) {\n  this.path = path;\n  this.rethrow(msg);\n}\ninherits(ReporterError, Error);\n\nReporterError.prototype.rethrow = function rethrow(msg) {\n  this.message = msg + ' at: ' + (this.path || '(shallow)');\n  if (Error.captureStackTrace)\n    Error.captureStackTrace(this, ReporterError);\n\n  if (!this.stack) {\n    try {\n      // IE only adds stack when thrown\n      throw new Error(this.message);\n    } catch (e) {\n      this.stack = e.stack;\n    }\n  }\n  return this;\n};\n","'use strict';\n\nconst encoders = require('./encoders');\nconst decoders = require('./decoders');\nconst inherits = require('inherits');\n\nconst api = exports;\n\napi.define = function define(name, body) {\n  return new Entity(name, body);\n};\n\nfunction Entity(name, body) {\n  this.name = name;\n  this.body = body;\n\n  this.decoders = {};\n  this.encoders = {};\n}\n\nEntity.prototype._createNamed = function createNamed(Base) {\n  const name = this.name;\n\n  function Generated(entity) {\n    this._initNamed(entity, name);\n  }\n  inherits(Generated, Base);\n  Generated.prototype._initNamed = function _initNamed(entity, name) {\n    Base.call(this, entity, name);\n  };\n\n  return new Generated(this);\n};\n\nEntity.prototype._getDecoder = function _getDecoder(enc) {\n  enc = enc || 'der';\n  // Lazily create decoder\n  if (!this.decoders.hasOwnProperty(enc))\n    this.decoders[enc] = this._createNamed(decoders[enc]);\n  return this.decoders[enc];\n};\n\nEntity.prototype.decode = function decode(data, enc, options) {\n  return this._getDecoder(enc).decode(data, options);\n};\n\nEntity.prototype._getEncoder = function _getEncoder(enc) {\n  enc = enc || 'der';\n  // Lazily create encoder\n  if (!this.encoders.hasOwnProperty(enc))\n    this.encoders[enc] = this._createNamed(encoders[enc]);\n  return this.encoders[enc];\n};\n\nEntity.prototype.encode = function encode(data, enc, /* internal */ reporter) {\n  return this._getEncoder(enc).encode(data, reporter);\n};\n"],"sourceRoot":""}