{"version":3,"sources":["webpack:///./node_modules/miller-rabin/lib/mr.js","webpack:///./node_modules/miller-rabin/node_modules/bn.js/lib/bn.js"],"names":["bn","brorand","MillerRabin","rand","this","Rand","module","exports","create","prototype","_randbelow","n","len","bitLength","min_bytes","Math","ceil","a","generate","cmp","_randrange","start","stop","size","sub","add","test","k","cb","red","mont","rone","toRed","max","n1","subn","s","testn","d","shrn","rn1","x","redPow","i","redSqr","getDivisor","g","gcd","cmpn","fromRed","assert","val","msg","Error","inherits","ctor","superCtor","super_","TempCtor","constructor","BN","number","base","endian","isBN","negative","words","length","_init","Buffer","wordSize","window","e","parseHex4Bits","string","index","c","charCodeAt","parseHexByte","lowerBound","r","parseBase","str","end","mul","min","num","Array","isArray","left","right","_initNumber","_initArray","toString","replace","_parseHex","_parseBase","toArray","j","w","off","strip","limbLen","limbPow","total","mod","word","imuln","_iaddn","pow","copy","dest","clone","_expand","_normSign","inspect","zeros","groupSizes","groupBases","smallMulTo","self","out","b","lo","carry","ncarry","rword","maxJ","padding","groupSize","groupBase","isZero","modn","idivn","toNumber","ret","toJSON","toBuffer","toArrayLike","ArrayType","byteLength","reqLength","littleEndian","res","q","andln","iushrn","clz32","_countBits","t","_zeroBits","hi","zeroBits","toTwos","width","abs","inotn","iaddn","fromTwos","notn","ineg","isNeg","neg","iuor","ior","or","uor","iuand","iand","and","uand","iuxor","ixor","xor","uxor","bytesNeeded","bitsLeft","setn","bit","wbit","iadd","isub","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","w0","imul","w1","w2","w3","w4","w5","w6","w7","w8","w9","w10","w11","w12","w13","w14","w15","w16","w17","w18","jumboMulTo","FFTM","mulp","y","mulTo","hncarry","bigMulTo","makeRBT","N","l","revBin","rb","permute","rbt","rws","iws","rtws","itws","transform","rtwdf","cos","PI","itwdf","sin","p","rtwdf_","itwdf_","re","ie","ro","io","rx","guessLen13b","m","odd","conjugate","normalize13b","ws","round","convert13b","stub","ph","_","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","muln","sqr","isqr","toBitArray","iushln","bits","carryMask","newCarry","ishln","hint","extended","h","mask","maskedWords","ishrn","shln","ushln","ushrn","imaskn","maskn","isubn","addn","iabs","_ishlnsubmul","shift","_wordDiv","mode","bhi","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","acc","egcd","A","B","C","D","isEven","yp","xp","im","isOdd","jm","_invmp","x1","x2","delta","invm","bincn","ucmp","gtn","gt","gten","gte","ltn","lt","lten","lte","eqn","eq","Red","ctx","convertTo","_forceRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","shl","redMul","_verify2","redIMul","_verify1","redISqr","redSqrt","sqrt","redInvm","redNeg","primes","k256","p224","p192","p25519","MPrime","name","tmp","_tmp","K256","call","P224","P192","P25519","prime","_prime","Mont","imod","rinv","minv","ireduce","rlen","split","imulK","undefined","_strip","input","output","outLen","prev","next","mod3","one","nOne","lpow","z","inv","wnd","current","currentLen","u"],"mappings":"8EAAA,IAAIA,EAAK,EAAQ,KACbC,EAAU,EAAQ,KAEtB,SAASC,EAAYC,GACnBC,KAAKD,KAAOA,GAAQ,IAAIF,EAAQI,KAElCC,EAAOC,QAAUL,EAEjBA,EAAYM,OAAS,SAAgBL,GACnC,OAAO,IAAID,EAAYC,IAGzBD,EAAYO,UAAUC,WAAa,SAAoBC,GACrD,IAAIC,EAAMD,EAAEE,YACRC,EAAYC,KAAKC,KAAKJ,EAAM,GAIhC,GACE,IAAIK,EAAI,IAAIjB,EAAGI,KAAKD,KAAKe,SAASJ,UAC7BG,EAAEE,IAAIR,IAAM,GAEnB,OAAOM,GAGTf,EAAYO,UAAUW,WAAa,SAAoBC,EAAOC,GAE5D,IAAIC,EAAOD,EAAKE,IAAIH,GACpB,OAAOA,EAAMI,IAAIrB,KAAKM,WAAWa,KAGnCrB,EAAYO,UAAUiB,KAAO,SAAcf,EAAGgB,EAAGC,GAC/C,IAAIhB,EAAMD,EAAEE,YACRgB,EAAM7B,EAAG8B,KAAKnB,GACdoB,EAAO,IAAI/B,EAAG,GAAGgC,MAAMH,GAEtBF,IACHA,EAAIZ,KAAKkB,IAAI,EAAIrB,EAAM,GAAM,IAI/B,IADA,IAAIsB,EAAKvB,EAAEwB,KAAK,GACPC,EAAI,GAAIF,EAAGG,MAAMD,GAAIA,KAM9B,IALA,IAAIE,EAAI3B,EAAE4B,KAAKH,GAEXI,EAAMN,EAAGF,MAAMH,GAGZF,EAAI,EAAGA,IAAK,CACjB,IAAIV,EAAIb,KAAKgB,WAAW,IAAIpB,EAAG,GAAIkC,GAC/BN,GACFA,EAAGX,GAEL,IAAIwB,EAAIxB,EAAEe,MAAMH,GAAKa,OAAOJ,GAC5B,GAAoB,IAAhBG,EAAEtB,IAAIY,IAA8B,IAAfU,EAAEtB,IAAIqB,GAA/B,CAGA,IAAK,IAAIG,EAAI,EAAGA,EAAIP,EAAGO,IAAK,CAG1B,GAAoB,KAFpBF,EAAIA,EAAEG,UAEAzB,IAAIY,GACR,OAAO,EACT,GAAmB,IAAfU,EAAEtB,IAAIqB,GACR,MAGJ,GAAIG,IAAMP,EACR,OAAO,GAGX,OAvBY,GA0BdlC,EAAYO,UAAUoC,WAAa,SAAoBlC,EAAGgB,GACxD,IAAIf,EAAMD,EAAEE,YACRgB,EAAM7B,EAAG8B,KAAKnB,GACdoB,EAAO,IAAI/B,EAAG,GAAGgC,MAAMH,GAEtBF,IACHA,EAAIZ,KAAKkB,IAAI,EAAIrB,EAAM,GAAM,IAI/B,IADA,IAAIsB,EAAKvB,EAAEwB,KAAK,GACPC,EAAI,GAAIF,EAAGG,MAAMD,GAAIA,KAK9B,IAJA,IAAIE,EAAI3B,EAAE4B,KAAKH,GAEXI,EAAMN,EAAGF,MAAMH,GAEZF,EAAI,EAAGA,IAAK,CACjB,IAAIV,EAAIb,KAAKgB,WAAW,IAAIpB,EAAG,GAAIkC,GAE/BY,EAAInC,EAAEoC,IAAI9B,GACd,GAAkB,IAAd6B,EAAEE,KAAK,GACT,OAAOF,EAET,IAAIL,EAAIxB,EAAEe,MAAMH,GAAKa,OAAOJ,GAC5B,GAAoB,IAAhBG,EAAEtB,IAAIY,IAA8B,IAAfU,EAAEtB,IAAIqB,GAA/B,CAGA,IAAK,IAAIG,EAAI,EAAGA,EAAIP,EAAGO,IAAK,CAG1B,GAAoB,KAFpBF,EAAIA,EAAEG,UAEAzB,IAAIY,GACR,OAAOU,EAAEQ,UAAUd,KAAK,GAAGY,IAAIpC,GACjC,GAAmB,IAAf8B,EAAEtB,IAAIqB,GACR,MAGJ,GAAIG,IAAMP,EAER,OADAK,EAAIA,EAAEG,UACGK,UAAUd,KAAK,GAAGY,IAAIpC,IAInC,OAAO,I,qBCjHT,2BACE,aAGA,SAASuC,EAAQC,EAAKC,GACpB,IAAKD,EAAK,MAAM,IAAIE,MAAMD,GAAO,oBAKnC,SAASE,EAAUC,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAASjD,UAAY+C,EAAU/C,UAC/B8C,EAAK9C,UAAY,IAAIiD,EACrBH,EAAK9C,UAAUkD,YAAcJ,EAK/B,SAASK,EAAIC,EAAQC,EAAMC,GACzB,GAAIH,EAAGI,KAAKH,GACV,OAAOA,EAGTzD,KAAK6D,SAAW,EAChB7D,KAAK8D,MAAQ,KACb9D,KAAK+D,OAAS,EAGd/D,KAAKyB,IAAM,KAEI,OAAXgC,IACW,OAATC,GAA0B,OAATA,IACnBC,EAASD,EACTA,EAAO,IAGT1D,KAAKgE,MAAMP,GAAU,EAAGC,GAAQ,GAAIC,GAAU,OAYlD,IAAIM,EATkB,iBAAX/D,EACTA,EAAOC,QAAUqD,EAEjBrD,EAAQqD,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGU,SAAW,GAGd,IAEID,EADoB,oBAAXE,aAAmD,IAAlBA,OAAOF,OACxCE,OAAOF,OAEP,EAAQ,KAAUA,OAE7B,MAAOG,IAgIT,SAASC,EAAeC,EAAQC,GAC9B,IAAIC,EAAIF,EAAOG,WAAWF,GAE1B,OAAIC,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,GAGHA,EAAI,GAAM,GAItB,SAASE,EAAcJ,EAAQK,EAAYJ,GACzC,IAAIK,EAAIP,EAAcC,EAAQC,GAI9B,OAHIA,EAAQ,GAAKI,IACfC,GAAKP,EAAcC,EAAQC,EAAQ,IAAM,GAEpCK,EA8CT,SAASC,EAAWC,EAAK7D,EAAO8D,EAAKC,GAGnC,IAFA,IAAIJ,EAAI,EACJpE,EAAMG,KAAKsE,IAAIH,EAAIf,OAAQgB,GACtBxC,EAAItB,EAAOsB,EAAI/B,EAAK+B,IAAK,CAChC,IAAIiC,EAAIM,EAAIL,WAAWlC,GAAK,GAE5BqC,GAAKI,EAIHJ,GADEJ,GAAK,GACFA,EAAI,GAAK,GAGLA,GAAK,GACTA,EAAI,GAAK,GAITA,EAGT,OAAOI,EAnNTpB,EAAGI,KAAO,SAAesB,GACvB,OAAIA,aAAe1B,GAIJ,OAAR0B,GAA+B,iBAARA,GAC5BA,EAAI3B,YAAYW,WAAaV,EAAGU,UAAYiB,MAAMC,QAAQF,EAAIpB,QAGlEN,EAAG3B,IAAM,SAAcwD,EAAMC,GAC3B,OAAID,EAAKtE,IAAIuE,GAAS,EAAUD,EACzBC,GAGT9B,EAAGyB,IAAM,SAAcI,EAAMC,GAC3B,OAAID,EAAKtE,IAAIuE,GAAS,EAAUD,EACzBC,GAGT9B,EAAGnD,UAAU2D,MAAQ,SAAeP,EAAQC,EAAMC,GAChD,GAAsB,iBAAXF,EACT,OAAOzD,KAAKuF,YAAY9B,EAAQC,EAAMC,GAGxC,GAAsB,iBAAXF,EACT,OAAOzD,KAAKwF,WAAW/B,EAAQC,EAAMC,GAG1B,QAATD,IACFA,EAAO,IAETZ,EAAOY,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAIzC,EAAQ,EACM,OAFlBwC,EAASA,EAAOgC,WAAWC,QAAQ,OAAQ,KAEhC,KACTzE,IACAjB,KAAK6D,SAAW,GAGd5C,EAAQwC,EAAOM,SACJ,KAATL,EACF1D,KAAK2F,UAAUlC,EAAQxC,EAAO0C,IAE9B3D,KAAK4F,WAAWnC,EAAQC,EAAMzC,GACf,OAAX0C,GACF3D,KAAKwF,WAAWxF,KAAK6F,UAAWnC,EAAMC,MAM9CH,EAAGnD,UAAUkF,YAAc,SAAsB9B,EAAQC,EAAMC,GACzDF,EAAS,IACXzD,KAAK6D,SAAW,EAChBJ,GAAUA,GAERA,EAAS,UACXzD,KAAK8D,MAAQ,CAAW,SAATL,GACfzD,KAAK+D,OAAS,GACLN,EAAS,kBAClBzD,KAAK8D,MAAQ,CACF,SAATL,EACCA,EAAS,SAAa,UAEzBzD,KAAK+D,OAAS,IAEdjB,EAAOW,EAAS,kBAChBzD,KAAK8D,MAAQ,CACF,SAATL,EACCA,EAAS,SAAa,SACvB,GAEFzD,KAAK+D,OAAS,GAGD,OAAXJ,GAGJ3D,KAAKwF,WAAWxF,KAAK6F,UAAWnC,EAAMC,IAGxCH,EAAGnD,UAAUmF,WAAa,SAAqB/B,EAAQC,EAAMC,GAG3D,GADAb,EAAgC,iBAAlBW,EAAOM,QACjBN,EAAOM,QAAU,EAGnB,OAFA/D,KAAK8D,MAAQ,CAAE,GACf9D,KAAK+D,OAAS,EACP/D,KAGTA,KAAK+D,OAASpD,KAAKC,KAAK6C,EAAOM,OAAS,GACxC/D,KAAK8D,MAAQ,IAAIqB,MAAMnF,KAAK+D,QAC5B,IAAK,IAAIxB,EAAI,EAAGA,EAAIvC,KAAK+D,OAAQxB,IAC/BvC,KAAK8D,MAAMvB,GAAK,EAGlB,IAAIuD,EAAGC,EACHC,EAAM,EACV,GAAe,OAAXrC,EACF,IAAKpB,EAAIkB,EAAOM,OAAS,EAAG+B,EAAI,EAAGvD,GAAK,EAAGA,GAAK,EAC9CwD,EAAItC,EAAOlB,GAAMkB,EAAOlB,EAAI,IAAM,EAAMkB,EAAOlB,EAAI,IAAM,GACzDvC,KAAK8D,MAAMgC,IAAOC,GAAKC,EAAO,SAC9BhG,KAAK8D,MAAMgC,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,UAGC,GAAe,OAAXnC,EACT,IAAKpB,EAAI,EAAGuD,EAAI,EAAGvD,EAAIkB,EAAOM,OAAQxB,GAAK,EACzCwD,EAAItC,EAAOlB,GAAMkB,EAAOlB,EAAI,IAAM,EAAMkB,EAAOlB,EAAI,IAAM,GACzDvC,KAAK8D,MAAMgC,IAAOC,GAAKC,EAAO,SAC9BhG,KAAK8D,MAAMgC,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,KAIN,OAAO9F,KAAKiG,SAyBdzC,EAAGnD,UAAUsF,UAAY,SAAoBlC,EAAQxC,EAAO0C,GAE1D3D,KAAK+D,OAASpD,KAAKC,MAAM6C,EAAOM,OAAS9C,GAAS,GAClDjB,KAAK8D,MAAQ,IAAIqB,MAAMnF,KAAK+D,QAC5B,IAAK,IAAIxB,EAAI,EAAGA,EAAIvC,KAAK+D,OAAQxB,IAC/BvC,KAAK8D,MAAMvB,GAAK,EAIlB,IAGIwD,EAHAC,EAAM,EACNF,EAAI,EAGR,GAAe,OAAXnC,EACF,IAAKpB,EAAIkB,EAAOM,OAAS,EAAGxB,GAAKtB,EAAOsB,GAAK,EAC3CwD,EAAIrB,EAAajB,EAAQxC,EAAOsB,IAAMyD,EACtChG,KAAK8D,MAAMgC,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACL9F,KAAK8D,MAAMgC,IAAMC,IAAM,IAEvBC,GAAO,OAKX,IAAKzD,GADakB,EAAOM,OAAS9C,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAOsB,EAAIkB,EAAOM,OAAQxB,GAAK,EAC1EwD,EAAIrB,EAAajB,EAAQxC,EAAOsB,IAAMyD,EACtChG,KAAK8D,MAAMgC,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACL9F,KAAK8D,MAAMgC,IAAMC,IAAM,IAEvBC,GAAO,EAKbhG,KAAKiG,SA2BPzC,EAAGnD,UAAUuF,WAAa,SAAqBnC,EAAQC,EAAMzC,GAE3DjB,KAAK8D,MAAQ,CAAE,GACf9D,KAAK+D,OAAS,EAGd,IAAK,IAAImC,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWzC,EAClEwC,IAEFA,IACAC,EAAWA,EAAUzC,EAAQ,EAO7B,IALA,IAAI0C,EAAQ3C,EAAOM,OAAS9C,EACxBoF,EAAMD,EAAQF,EACdnB,EAAMpE,KAAKsE,IAAImB,EAAOA,EAAQC,GAAOpF,EAErCqF,EAAO,EACF/D,EAAItB,EAAOsB,EAAIwC,EAAKxC,GAAK2D,EAChCI,EAAOzB,EAAUpB,EAAQlB,EAAGA,EAAI2D,EAASxC,GAEzC1D,KAAKuG,MAAMJ,GACPnG,KAAK8D,MAAM,GAAKwC,EAAO,SACzBtG,KAAK8D,MAAM,IAAMwC,EAEjBtG,KAAKwG,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAOzB,EAAUpB,EAAQlB,EAAGkB,EAAOM,OAAQL,GAEtCnB,EAAI,EAAGA,EAAI8D,EAAK9D,IACnBkE,GAAO/C,EAGT1D,KAAKuG,MAAME,GACPzG,KAAK8D,MAAM,GAAKwC,EAAO,SACzBtG,KAAK8D,MAAM,IAAMwC,EAEjBtG,KAAKwG,OAAOF,GAIhBtG,KAAKiG,SAGPzC,EAAGnD,UAAUqG,KAAO,SAAeC,GACjCA,EAAK7C,MAAQ,IAAIqB,MAAMnF,KAAK+D,QAC5B,IAAK,IAAIxB,EAAI,EAAGA,EAAIvC,KAAK+D,OAAQxB,IAC/BoE,EAAK7C,MAAMvB,GAAKvC,KAAK8D,MAAMvB,GAE7BoE,EAAK5C,OAAS/D,KAAK+D,OACnB4C,EAAK9C,SAAW7D,KAAK6D,SACrB8C,EAAKlF,IAAMzB,KAAKyB,KAGlB+B,EAAGnD,UAAUuG,MAAQ,WACnB,IAAIhC,EAAI,IAAIpB,EAAG,MAEf,OADAxD,KAAK0G,KAAK9B,GACHA,GAGTpB,EAAGnD,UAAUwG,QAAU,SAAkB1F,GACvC,KAAOnB,KAAK+D,OAAS5C,GACnBnB,KAAK8D,MAAM9D,KAAK+D,UAAY,EAE9B,OAAO/D,MAITwD,EAAGnD,UAAU4F,MAAQ,WACnB,KAAOjG,KAAK+D,OAAS,GAAqC,IAAhC/D,KAAK8D,MAAM9D,KAAK+D,OAAS,IACjD/D,KAAK+D,SAEP,OAAO/D,KAAK8G,aAGdtD,EAAGnD,UAAUyG,UAAY,WAKvB,OAHoB,IAAhB9G,KAAK+D,QAAkC,IAAlB/D,KAAK8D,MAAM,KAClC9D,KAAK6D,SAAW,GAEX7D,MAGTwD,EAAGnD,UAAU0G,QAAU,WACrB,OAAQ/G,KAAKyB,IAAM,UAAY,SAAWzB,KAAKyF,SAAS,IAAM,KAiChE,IAAIuB,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,UAsjB9D,SAASC,EAAYC,EAAMlC,EAAKmC,GAC9BA,EAAIxD,SAAWqB,EAAIrB,SAAWuD,EAAKvD,SACnC,IAAIrD,EAAO4G,EAAKrD,OAASmB,EAAInB,OAAU,EACvCsD,EAAItD,OAASvD,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIK,EAAoB,EAAhBuG,EAAKtD,MAAM,GACfwD,EAAmB,EAAfpC,EAAIpB,MAAM,GACdc,EAAI/D,EAAIyG,EAERC,EAAS,SAAJ3C,EACL4C,EAAS5C,EAAI,SAAa,EAC9ByC,EAAIvD,MAAM,GAAKyD,EAEf,IAAK,IAAIhG,EAAI,EAAGA,EAAIf,EAAKe,IAAK,CAM5B,IAHA,IAAIkG,EAASD,IAAU,GACnBE,EAAgB,SAARF,EACRG,EAAOhH,KAAKsE,IAAI1D,EAAG2D,EAAInB,OAAS,GAC3B+B,EAAInF,KAAKkB,IAAI,EAAGN,EAAI6F,EAAKrD,OAAS,GAAI+B,GAAK6B,EAAM7B,IAAK,CAC7D,IAAIvD,EAAKhB,EAAIuE,EAAK,EAIlB2B,IADA7C,GAFA/D,EAAoB,EAAhBuG,EAAKtD,MAAMvB,KACf+E,EAAmB,EAAfpC,EAAIpB,MAAMgC,IACF4B,GACG,SAAa,EAC5BA,EAAY,SAAJ9C,EAEVyC,EAAIvD,MAAMvC,GAAa,EAARmG,EACfF,EAAiB,EAATC,EAQV,OANc,IAAVD,EACFH,EAAIvD,MAAMvC,GAAa,EAARiG,EAEfH,EAAItD,SAGCsD,EAAIpB,QAzlBbzC,EAAGnD,UAAUoF,SAAW,SAAmB/B,EAAMkE,GAI/C,IAAIP,EACJ,GAHAO,EAAoB,EAAVA,GAAe,EAGZ,MAJblE,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjC2D,EAAM,GAGN,IAFA,IAAIrB,EAAM,EACNwB,EAAQ,EACHjF,EAAI,EAAGA,EAAIvC,KAAK+D,OAAQxB,IAAK,CACpC,IAAIwD,EAAI/F,KAAK8D,MAAMvB,GACf+D,GAA+B,UAArBP,GAAKC,EAAOwB,IAAmB/B,SAAS,IAGpD4B,EADY,KADdG,EAASzB,IAAO,GAAKC,EAAQ,WACVzD,IAAMvC,KAAK+D,OAAS,EAC/BiD,EAAM,EAAIV,EAAKvC,QAAUuC,EAAOe,EAEhCf,EAAOe,GAEfrB,GAAO,IACI,KACTA,GAAO,GACPzD,KAMJ,IAHc,IAAViF,IACFH,EAAMG,EAAM/B,SAAS,IAAM4B,GAEtBA,EAAItD,OAAS6D,GAAY,GAC9BP,EAAM,IAAMA,EAKd,OAHsB,IAAlBrH,KAAK6D,WACPwD,EAAM,IAAMA,GAEPA,EAGT,GAAI3D,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAImE,EAAYZ,EAAWvD,GAEvBoE,EAAYZ,EAAWxD,GAC3B2D,EAAM,GACN,IAAI7C,EAAIxE,KAAK4G,QAEb,IADApC,EAAEX,SAAW,GACLW,EAAEuD,UAAU,CAClB,IAAInD,EAAIJ,EAAEwD,KAAKF,GAAWrC,SAAS/B,GAMjC2D,GALF7C,EAAIA,EAAEyD,MAAMH,IAELC,SAGCnD,EAAIyC,EAFJL,EAAMa,EAAYjD,EAAEb,QAAUa,EAAIyC,EAQ5C,IAHIrH,KAAK+H,WACPV,EAAM,IAAMA,GAEPA,EAAItD,OAAS6D,GAAY,GAC9BP,EAAM,IAAMA,EAKd,OAHsB,IAAlBrH,KAAK6D,WACPwD,EAAM,IAAMA,GAEPA,EAGTvE,GAAO,EAAO,oCAGhBU,EAAGnD,UAAU6H,SAAW,WACtB,IAAIC,EAAMnI,KAAK8D,MAAM,GASrB,OARoB,IAAhB9D,KAAK+D,OACPoE,GAAuB,SAAhBnI,KAAK8D,MAAM,GACO,IAAhB9D,KAAK+D,QAAkC,IAAlB/D,KAAK8D,MAAM,GAEzCqE,GAAO,iBAAoC,SAAhBnI,KAAK8D,MAAM,GAC7B9D,KAAK+D,OAAS,GACvBjB,GAAO,EAAO,8CAEU,IAAlB9C,KAAK6D,UAAmBsE,EAAMA,GAGxC3E,EAAGnD,UAAU+H,OAAS,WACpB,OAAOpI,KAAKyF,SAAS,KAGvBjC,EAAGnD,UAAUgI,SAAW,SAAmB1E,EAAQI,GAEjD,OADAjB,OAAyB,IAAXmB,GACPjE,KAAKsI,YAAYrE,EAAQN,EAAQI,IAG1CP,EAAGnD,UAAUwF,QAAU,SAAkBlC,EAAQI,GAC/C,OAAO/D,KAAKsI,YAAYnD,MAAOxB,EAAQI,IAGzCP,EAAGnD,UAAUiI,YAAc,SAAsBC,EAAW5E,EAAQI,GAClE,IAAIyE,EAAaxI,KAAKwI,aAClBC,EAAY1E,GAAUpD,KAAKkB,IAAI,EAAG2G,GACtC1F,EAAO0F,GAAcC,EAAW,yCAChC3F,EAAO2F,EAAY,EAAG,+BAEtBzI,KAAKiG,QACL,IAGIqB,EAAG/E,EAHHmG,EAA0B,OAAX/E,EACfgF,EAAM,IAAIJ,EAAUE,GAGpBG,EAAI5I,KAAK4G,QACb,GAAK8B,EAYE,CACL,IAAKnG,EAAI,GAAIqG,EAAEb,SAAUxF,IACvB+E,EAAIsB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETH,EAAIpG,GAAK+E,EAGX,KAAO/E,EAAIkG,EAAWlG,IACpBoG,EAAIpG,GAAK,MArBM,CAEjB,IAAKA,EAAI,EAAGA,EAAIkG,EAAYD,EAAYjG,IACtCoG,EAAIpG,GAAK,EAGX,IAAKA,EAAI,GAAIqG,EAAEb,SAAUxF,IACvB+E,EAAIsB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETH,EAAIF,EAAYlG,EAAI,GAAK+E,EAe7B,OAAOqB,GAGLhI,KAAKoI,MACPvF,EAAGnD,UAAU2I,WAAa,SAAqBjD,GAC7C,OAAO,GAAKpF,KAAKoI,MAAMhD,IAGzBvC,EAAGnD,UAAU2I,WAAa,SAAqBjD,GAC7C,IAAIkD,EAAIlD,EACJnB,EAAI,EAiBR,OAhBIqE,GAAK,OACPrE,GAAK,GACLqE,KAAO,IAELA,GAAK,KACPrE,GAAK,EACLqE,KAAO,GAELA,GAAK,IACPrE,GAAK,EACLqE,KAAO,GAELA,GAAK,IACPrE,GAAK,EACLqE,KAAO,GAEFrE,EAAIqE,GAIfzF,EAAGnD,UAAU6I,UAAY,SAAoBnD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAIkD,EAAIlD,EACJnB,EAAI,EAoBR,OAnBqB,IAAZ,KAAJqE,KACHrE,GAAK,GACLqE,KAAO,IAEU,IAAV,IAAJA,KACHrE,GAAK,EACLqE,KAAO,GAES,IAAT,GAAJA,KACHrE,GAAK,EACLqE,KAAO,GAES,IAAT,EAAJA,KACHrE,GAAK,EACLqE,KAAO,GAES,IAAT,EAAJA,IACHrE,IAEKA,GAITpB,EAAGnD,UAAUI,UAAY,WACvB,IAAIsF,EAAI/F,KAAK8D,MAAM9D,KAAK+D,OAAS,GAC7BoF,EAAKnJ,KAAKgJ,WAAWjD,GACzB,OAA2B,IAAnB/F,KAAK+D,OAAS,GAAUoF,GAiBlC3F,EAAGnD,UAAU+I,SAAW,WACtB,GAAIpJ,KAAK+H,SAAU,OAAO,EAG1B,IADA,IAAInD,EAAI,EACCrC,EAAI,EAAGA,EAAIvC,KAAK+D,OAAQxB,IAAK,CACpC,IAAI+E,EAAItH,KAAKkJ,UAAUlJ,KAAK8D,MAAMvB,IAElC,GADAqC,GAAK0C,EACK,KAANA,EAAU,MAEhB,OAAO1C,GAGTpB,EAAGnD,UAAUmI,WAAa,WACxB,OAAO7H,KAAKC,KAAKZ,KAAKS,YAAc,IAGtC+C,EAAGnD,UAAUgJ,OAAS,SAAiBC,GACrC,OAAsB,IAAlBtJ,KAAK6D,SACA7D,KAAKuJ,MAAMC,MAAMF,GAAOG,MAAM,GAEhCzJ,KAAK4G,SAGdpD,EAAGnD,UAAUqJ,SAAW,SAAmBJ,GACzC,OAAItJ,KAAKiC,MAAMqH,EAAQ,GACdtJ,KAAK2J,KAAKL,GAAOG,MAAM,GAAGG,OAE5B5J,KAAK4G,SAGdpD,EAAGnD,UAAUwJ,MAAQ,WACnB,OAAyB,IAAlB7J,KAAK6D,UAIdL,EAAGnD,UAAUyJ,IAAM,WACjB,OAAO9J,KAAK4G,QAAQgD,QAGtBpG,EAAGnD,UAAUuJ,KAAO,WAKlB,OAJK5J,KAAK+H,WACR/H,KAAK6D,UAAY,GAGZ7D,MAITwD,EAAGnD,UAAU0J,KAAO,SAAe7E,GACjC,KAAOlF,KAAK+D,OAASmB,EAAInB,QACvB/D,KAAK8D,MAAM9D,KAAK+D,UAAY,EAG9B,IAAK,IAAIxB,EAAI,EAAGA,EAAI2C,EAAInB,OAAQxB,IAC9BvC,KAAK8D,MAAMvB,GAAKvC,KAAK8D,MAAMvB,GAAK2C,EAAIpB,MAAMvB,GAG5C,OAAOvC,KAAKiG,SAGdzC,EAAGnD,UAAU2J,IAAM,SAAc9E,GAE/B,OADApC,EAA0C,IAAlC9C,KAAK6D,SAAWqB,EAAIrB,WACrB7D,KAAK+J,KAAK7E,IAInB1B,EAAGnD,UAAU4J,GAAK,SAAa/E,GAC7B,OAAIlF,KAAK+D,OAASmB,EAAInB,OAAe/D,KAAK4G,QAAQoD,IAAI9E,GAC/CA,EAAI0B,QAAQoD,IAAIhK,OAGzBwD,EAAGnD,UAAU6J,IAAM,SAAchF,GAC/B,OAAIlF,KAAK+D,OAASmB,EAAInB,OAAe/D,KAAK4G,QAAQmD,KAAK7E,GAChDA,EAAI0B,QAAQmD,KAAK/J,OAI1BwD,EAAGnD,UAAU8J,MAAQ,SAAgBjF,GAEnC,IAAIoC,EAEFA,EADEtH,KAAK+D,OAASmB,EAAInB,OAChBmB,EAEAlF,KAGN,IAAK,IAAIuC,EAAI,EAAGA,EAAI+E,EAAEvD,OAAQxB,IAC5BvC,KAAK8D,MAAMvB,GAAKvC,KAAK8D,MAAMvB,GAAK2C,EAAIpB,MAAMvB,GAK5C,OAFAvC,KAAK+D,OAASuD,EAAEvD,OAET/D,KAAKiG,SAGdzC,EAAGnD,UAAU+J,KAAO,SAAelF,GAEjC,OADApC,EAA0C,IAAlC9C,KAAK6D,SAAWqB,EAAIrB,WACrB7D,KAAKmK,MAAMjF,IAIpB1B,EAAGnD,UAAUgK,IAAM,SAAcnF,GAC/B,OAAIlF,KAAK+D,OAASmB,EAAInB,OAAe/D,KAAK4G,QAAQwD,KAAKlF,GAChDA,EAAI0B,QAAQwD,KAAKpK,OAG1BwD,EAAGnD,UAAUiK,KAAO,SAAepF,GACjC,OAAIlF,KAAK+D,OAASmB,EAAInB,OAAe/D,KAAK4G,QAAQuD,MAAMjF,GACjDA,EAAI0B,QAAQuD,MAAMnK,OAI3BwD,EAAGnD,UAAUkK,MAAQ,SAAgBrF,GAEnC,IAAIrE,EACAyG,EACAtH,KAAK+D,OAASmB,EAAInB,QACpBlD,EAAIb,KACJsH,EAAIpC,IAEJrE,EAAIqE,EACJoC,EAAItH,MAGN,IAAK,IAAIuC,EAAI,EAAGA,EAAI+E,EAAEvD,OAAQxB,IAC5BvC,KAAK8D,MAAMvB,GAAK1B,EAAEiD,MAAMvB,GAAK+E,EAAExD,MAAMvB,GAGvC,GAAIvC,OAASa,EACX,KAAO0B,EAAI1B,EAAEkD,OAAQxB,IACnBvC,KAAK8D,MAAMvB,GAAK1B,EAAEiD,MAAMvB,GAM5B,OAFAvC,KAAK+D,OAASlD,EAAEkD,OAET/D,KAAKiG,SAGdzC,EAAGnD,UAAUmK,KAAO,SAAetF,GAEjC,OADApC,EAA0C,IAAlC9C,KAAK6D,SAAWqB,EAAIrB,WACrB7D,KAAKuK,MAAMrF,IAIpB1B,EAAGnD,UAAUoK,IAAM,SAAcvF,GAC/B,OAAIlF,KAAK+D,OAASmB,EAAInB,OAAe/D,KAAK4G,QAAQ4D,KAAKtF,GAChDA,EAAI0B,QAAQ4D,KAAKxK,OAG1BwD,EAAGnD,UAAUqK,KAAO,SAAexF,GACjC,OAAIlF,KAAK+D,OAASmB,EAAInB,OAAe/D,KAAK4G,QAAQ2D,MAAMrF,GACjDA,EAAI0B,QAAQ2D,MAAMvK,OAI3BwD,EAAGnD,UAAUmJ,MAAQ,SAAgBF,GACnCxG,EAAwB,iBAAVwG,GAAsBA,GAAS,GAE7C,IAAIqB,EAAsC,EAAxBhK,KAAKC,KAAK0I,EAAQ,IAChCsB,EAAWtB,EAAQ,GAGvBtJ,KAAK6G,QAAQ8D,GAETC,EAAW,GACbD,IAIF,IAAK,IAAIpI,EAAI,EAAGA,EAAIoI,EAAapI,IAC/BvC,KAAK8D,MAAMvB,GAAsB,UAAhBvC,KAAK8D,MAAMvB,GAS9B,OALIqI,EAAW,IACb5K,KAAK8D,MAAMvB,IAAMvC,KAAK8D,MAAMvB,GAAM,UAAc,GAAKqI,GAIhD5K,KAAKiG,SAGdzC,EAAGnD,UAAUsJ,KAAO,SAAeL,GACjC,OAAOtJ,KAAK4G,QAAQ4C,MAAMF,IAI5B9F,EAAGnD,UAAUwK,KAAO,SAAeC,EAAK/H,GACtCD,EAAsB,iBAARgI,GAAoBA,GAAO,GAEzC,IAAI9E,EAAO8E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARA9K,KAAK6G,QAAQb,EAAM,GAGjBhG,KAAK8D,MAAMkC,GADTjD,EACgB/C,KAAK8D,MAAMkC,GAAQ,GAAK+E,EAExB/K,KAAK8D,MAAMkC,KAAS,GAAK+E,GAGtC/K,KAAKiG,SAIdzC,EAAGnD,UAAU2K,KAAO,SAAe9F,GACjC,IAAIN,EAkBA/D,EAAGyG,EAfP,GAAsB,IAAlBtH,KAAK6D,UAAmC,IAAjBqB,EAAIrB,SAI7B,OAHA7D,KAAK6D,SAAW,EAChBe,EAAI5E,KAAKiL,KAAK/F,GACdlF,KAAK6D,UAAY,EACV7D,KAAK8G,YAGP,GAAsB,IAAlB9G,KAAK6D,UAAmC,IAAjBqB,EAAIrB,SAIpC,OAHAqB,EAAIrB,SAAW,EACfe,EAAI5E,KAAKiL,KAAK/F,GACdA,EAAIrB,SAAW,EACRe,EAAEkC,YAKP9G,KAAK+D,OAASmB,EAAInB,QACpBlD,EAAIb,KACJsH,EAAIpC,IAEJrE,EAAIqE,EACJoC,EAAItH,MAIN,IADA,IAAIwH,EAAQ,EACHjF,EAAI,EAAGA,EAAI+E,EAAEvD,OAAQxB,IAC5BqC,GAAkB,EAAb/D,EAAEiD,MAAMvB,KAAwB,EAAb+E,EAAExD,MAAMvB,IAAUiF,EAC1CxH,KAAK8D,MAAMvB,GAAS,SAAJqC,EAChB4C,EAAQ5C,IAAM,GAEhB,KAAiB,IAAV4C,GAAejF,EAAI1B,EAAEkD,OAAQxB,IAClCqC,GAAkB,EAAb/D,EAAEiD,MAAMvB,IAAUiF,EACvBxH,KAAK8D,MAAMvB,GAAS,SAAJqC,EAChB4C,EAAQ5C,IAAM,GAIhB,GADA5E,KAAK+D,OAASlD,EAAEkD,OACF,IAAVyD,EACFxH,KAAK8D,MAAM9D,KAAK+D,QAAUyD,EAC1BxH,KAAK+D,cAEA,GAAIlD,IAAMb,KACf,KAAOuC,EAAI1B,EAAEkD,OAAQxB,IACnBvC,KAAK8D,MAAMvB,GAAK1B,EAAEiD,MAAMvB,GAI5B,OAAOvC,MAITwD,EAAGnD,UAAUgB,IAAM,SAAc6D,GAC/B,IAAIyD,EACJ,OAAqB,IAAjBzD,EAAIrB,UAAoC,IAAlB7D,KAAK6D,UAC7BqB,EAAIrB,SAAW,EACf8E,EAAM3I,KAAKoB,IAAI8D,GACfA,EAAIrB,UAAY,EACT8E,GACmB,IAAjBzD,EAAIrB,UAAoC,IAAlB7D,KAAK6D,UACpC7D,KAAK6D,SAAW,EAChB8E,EAAMzD,EAAI9D,IAAIpB,MACdA,KAAK6D,SAAW,EACT8E,GAGL3I,KAAK+D,OAASmB,EAAInB,OAAe/D,KAAK4G,QAAQoE,KAAK9F,GAEhDA,EAAI0B,QAAQoE,KAAKhL,OAI1BwD,EAAGnD,UAAU4K,KAAO,SAAe/F,GAEjC,GAAqB,IAAjBA,EAAIrB,SAAgB,CACtBqB,EAAIrB,SAAW,EACf,IAAIe,EAAI5E,KAAKgL,KAAK9F,GAElB,OADAA,EAAIrB,SAAW,EACRe,EAAEkC,YAGJ,GAAsB,IAAlB9G,KAAK6D,SAId,OAHA7D,KAAK6D,SAAW,EAChB7D,KAAKgL,KAAK9F,GACVlF,KAAK6D,SAAW,EACT7D,KAAK8G,YAId,IAWIjG,EAAGyG,EAXHvG,EAAMf,KAAKe,IAAImE,GAGnB,GAAY,IAARnE,EAIF,OAHAf,KAAK6D,SAAW,EAChB7D,KAAK+D,OAAS,EACd/D,KAAK8D,MAAM,GAAK,EACT9D,KAKLe,EAAM,GACRF,EAAIb,KACJsH,EAAIpC,IAEJrE,EAAIqE,EACJoC,EAAItH,MAIN,IADA,IAAIwH,EAAQ,EACHjF,EAAI,EAAGA,EAAI+E,EAAEvD,OAAQxB,IAE5BiF,GADA5C,GAAkB,EAAb/D,EAAEiD,MAAMvB,KAAwB,EAAb+E,EAAExD,MAAMvB,IAAUiF,IAC7B,GACbxH,KAAK8D,MAAMvB,GAAS,SAAJqC,EAElB,KAAiB,IAAV4C,GAAejF,EAAI1B,EAAEkD,OAAQxB,IAElCiF,GADA5C,GAAkB,EAAb/D,EAAEiD,MAAMvB,IAAUiF,IACV,GACbxH,KAAK8D,MAAMvB,GAAS,SAAJqC,EAIlB,GAAc,IAAV4C,GAAejF,EAAI1B,EAAEkD,QAAUlD,IAAMb,KACvC,KAAOuC,EAAI1B,EAAEkD,OAAQxB,IACnBvC,KAAK8D,MAAMvB,GAAK1B,EAAEiD,MAAMvB,GAU5B,OANAvC,KAAK+D,OAASpD,KAAKkB,IAAI7B,KAAK+D,OAAQxB,GAEhC1B,IAAMb,OACRA,KAAK6D,SAAW,GAGX7D,KAAKiG,SAIdzC,EAAGnD,UAAUe,IAAM,SAAc8D,GAC/B,OAAOlF,KAAK4G,QAAQqE,KAAK/F,IA+C3B,IAAIgG,EAAc,SAAsB9D,EAAMlC,EAAKmC,GACjD,IAIIE,EACA4D,EACAhC,EANAtI,EAAIuG,EAAKtD,MACTwD,EAAIpC,EAAIpB,MACRsH,EAAI/D,EAAIvD,MACRU,EAAI,EAIJ6G,EAAY,EAAPxK,EAAE,GACPyK,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3K,EAAE,GACP4K,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9K,EAAE,GACP+K,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPjL,EAAE,GACPkL,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPpL,EAAE,GACPqL,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPvL,EAAE,GACPwL,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP1L,EAAE,GACP2L,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7L,EAAE,GACP8L,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhM,EAAE,GACPiM,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnM,EAAE,GACPoM,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,GAEjBzH,EAAIxD,SAAWuD,EAAKvD,SAAWqB,EAAIrB,SACnCwD,EAAItD,OAAS,GAMb,IAAIkL,IAAQzK,GAJZ+C,EAAK5G,KAAKuO,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAMxK,KAAKuO,KAAK5D,EAAK+B,IACR1M,KAAKuO,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrD5I,IAFA2E,EAAKxI,KAAKuO,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAEN1H,EAAK5G,KAAKuO,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAMxK,KAAKuO,KAAKzD,EAAK4B,IACR1M,KAAKuO,KAAKxD,EAAK0B,GAAQ,EACpCjE,EAAKxI,KAAKuO,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQ3K,GAJZ+C,EAAMA,EAAK5G,KAAKuO,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK5D,EAAKkC,GAAQ,GACvB7M,KAAKuO,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrD/I,IAFA2E,EAAMA,EAAKxI,KAAKuO,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAEN5H,EAAK5G,KAAKuO,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAMxK,KAAKuO,KAAKtD,EAAKyB,IACR1M,KAAKuO,KAAKrD,EAAKuB,GAAQ,EACpCjE,EAAKxI,KAAKuO,KAAKrD,EAAKwB,GACpB9F,EAAMA,EAAK5G,KAAKuO,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKzD,EAAK+B,GAAQ,GACvB7M,KAAKuO,KAAKxD,EAAK6B,GAAQ,EACpCpE,EAAMA,EAAKxI,KAAKuO,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQ5K,GAJZ+C,EAAMA,EAAK5G,KAAKuO,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK5D,EAAKqC,GAAQ,GACvBhN,KAAKuO,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrDlJ,IAFA2E,EAAMA,EAAKxI,KAAKuO,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAEN7H,EAAK5G,KAAKuO,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAMxK,KAAKuO,KAAKnD,EAAKsB,IACR1M,KAAKuO,KAAKlD,EAAKoB,GAAQ,EACpCjE,EAAKxI,KAAKuO,KAAKlD,EAAKqB,GACpB9F,EAAMA,EAAK5G,KAAKuO,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKtD,EAAK4B,GAAQ,GACvB7M,KAAKuO,KAAKrD,EAAK0B,GAAQ,EACpCpE,EAAMA,EAAKxI,KAAKuO,KAAKrD,EAAK2B,GAAQ,EAClCjG,EAAMA,EAAK5G,KAAKuO,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKzD,EAAKkC,GAAQ,GACvBhN,KAAKuO,KAAKxD,EAAKgC,GAAQ,EACpCvE,EAAMA,EAAKxI,KAAKuO,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQ7K,GAJZ+C,EAAMA,EAAK5G,KAAKuO,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK5D,EAAKwC,GAAQ,GACvBnN,KAAKuO,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrDrJ,IAFA2E,EAAMA,EAAKxI,KAAKuO,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAEN9H,EAAK5G,KAAKuO,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAMxK,KAAKuO,KAAKhD,EAAKmB,IACR1M,KAAKuO,KAAK/C,EAAKiB,GAAQ,EACpCjE,EAAKxI,KAAKuO,KAAK/C,EAAKkB,GACpB9F,EAAMA,EAAK5G,KAAKuO,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKnD,EAAKyB,GAAQ,GACvB7M,KAAKuO,KAAKlD,EAAKuB,GAAQ,EACpCpE,EAAMA,EAAKxI,KAAKuO,KAAKlD,EAAKwB,GAAQ,EAClCjG,EAAMA,EAAK5G,KAAKuO,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKtD,EAAK+B,GAAQ,GACvBhN,KAAKuO,KAAKrD,EAAK6B,GAAQ,EACpCvE,EAAMA,EAAKxI,KAAKuO,KAAKrD,EAAK8B,GAAQ,EAClCpG,EAAMA,EAAK5G,KAAKuO,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKzD,EAAKqC,GAAQ,GACvBnN,KAAKuO,KAAKxD,EAAKmC,GAAQ,EACpC1E,EAAMA,EAAKxI,KAAKuO,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQ9K,GAJZ+C,EAAMA,EAAK5G,KAAKuO,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK5D,EAAK2C,IAAQ,GACvBtN,KAAKuO,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrDxJ,IAFA2E,EAAMA,EAAKxI,KAAKuO,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAK5G,KAAKuO,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAMxK,KAAKuO,KAAK7C,EAAKgB,IACR1M,KAAKuO,KAAK5C,EAAKc,GAAQ,EACpCjE,EAAKxI,KAAKuO,KAAK5C,EAAKe,GACpB9F,EAAMA,EAAK5G,KAAKuO,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKhD,EAAKsB,GAAQ,GACvB7M,KAAKuO,KAAK/C,EAAKoB,GAAQ,EACpCpE,EAAMA,EAAKxI,KAAKuO,KAAK/C,EAAKqB,GAAQ,EAClCjG,EAAMA,EAAK5G,KAAKuO,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKnD,EAAK4B,GAAQ,GACvBhN,KAAKuO,KAAKlD,EAAK0B,GAAQ,EACpCvE,EAAMA,EAAKxI,KAAKuO,KAAKlD,EAAK2B,GAAQ,EAClCpG,EAAMA,EAAK5G,KAAKuO,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKtD,EAAKkC,GAAQ,GACvBnN,KAAKuO,KAAKrD,EAAKgC,GAAQ,EACpC1E,EAAMA,EAAKxI,KAAKuO,KAAKrD,EAAKiC,GAAQ,EAClCvG,EAAMA,EAAK5G,KAAKuO,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKzD,EAAKwC,IAAQ,GACvBtN,KAAKuO,KAAKxD,EAAKsC,GAAQ,EACpC7E,EAAMA,EAAKxI,KAAKuO,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQ/K,GAJZ+C,EAAMA,EAAK5G,KAAKuO,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK5D,EAAK8C,IAAQ,GACvBzN,KAAKuO,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrD3J,IAFA2E,EAAMA,EAAKxI,KAAKuO,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENhI,EAAK5G,KAAKuO,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAMxK,KAAKuO,KAAK1C,EAAKa,IACR1M,KAAKuO,KAAKzC,EAAKW,GAAQ,EACpCjE,EAAKxI,KAAKuO,KAAKzC,EAAKY,GACpB9F,EAAMA,EAAK5G,KAAKuO,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK7C,EAAKmB,GAAQ,GACvB7M,KAAKuO,KAAK5C,EAAKiB,GAAQ,EACpCpE,EAAMA,EAAKxI,KAAKuO,KAAK5C,EAAKkB,GAAQ,EAClCjG,EAAMA,EAAK5G,KAAKuO,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKhD,EAAKyB,GAAQ,GACvBhN,KAAKuO,KAAK/C,EAAKuB,GAAQ,EACpCvE,EAAMA,EAAKxI,KAAKuO,KAAK/C,EAAKwB,GAAQ,EAClCpG,EAAMA,EAAK5G,KAAKuO,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKnD,EAAK+B,GAAQ,GACvBnN,KAAKuO,KAAKlD,EAAK6B,GAAQ,EACpC1E,EAAMA,EAAKxI,KAAKuO,KAAKlD,EAAK8B,GAAQ,EAClCvG,EAAMA,EAAK5G,KAAKuO,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKtD,EAAKqC,IAAQ,GACvBtN,KAAKuO,KAAKrD,EAAKmC,GAAQ,EACpC7E,EAAMA,EAAKxI,KAAKuO,KAAKrD,EAAKoC,IAAQ,EAClC1G,EAAMA,EAAK5G,KAAKuO,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKzD,EAAK2C,IAAQ,GACvBzN,KAAKuO,KAAKxD,EAAKyC,IAAQ,EACpChF,EAAMA,EAAKxI,KAAKuO,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQhL,GAJZ+C,EAAMA,EAAK5G,KAAKuO,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK5D,EAAKiD,IAAQ,GACvB5N,KAAKuO,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrD9J,IAFA2E,EAAMA,EAAKxI,KAAKuO,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAK5G,KAAKuO,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAMxK,KAAKuO,KAAKvC,EAAKU,IACR1M,KAAKuO,KAAKtC,EAAKQ,GAAQ,EACpCjE,EAAKxI,KAAKuO,KAAKtC,EAAKS,GACpB9F,EAAMA,EAAK5G,KAAKuO,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK1C,EAAKgB,GAAQ,GACvB7M,KAAKuO,KAAKzC,EAAKc,GAAQ,EACpCpE,EAAMA,EAAKxI,KAAKuO,KAAKzC,EAAKe,GAAQ,EAClCjG,EAAMA,EAAK5G,KAAKuO,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK7C,EAAKsB,GAAQ,GACvBhN,KAAKuO,KAAK5C,EAAKoB,GAAQ,EACpCvE,EAAMA,EAAKxI,KAAKuO,KAAK5C,EAAKqB,GAAQ,EAClCpG,EAAMA,EAAK5G,KAAKuO,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKhD,EAAK4B,GAAQ,GACvBnN,KAAKuO,KAAK/C,EAAK0B,GAAQ,EACpC1E,EAAMA,EAAKxI,KAAKuO,KAAK/C,EAAK2B,GAAQ,EAClCvG,EAAMA,EAAK5G,KAAKuO,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKnD,EAAKkC,IAAQ,GACvBtN,KAAKuO,KAAKlD,EAAKgC,GAAQ,EACpC7E,EAAMA,EAAKxI,KAAKuO,KAAKlD,EAAKiC,IAAQ,EAClC1G,EAAMA,EAAK5G,KAAKuO,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKtD,EAAKwC,IAAQ,GACvBzN,KAAKuO,KAAKrD,EAAKsC,IAAQ,EACpChF,EAAMA,EAAKxI,KAAKuO,KAAKrD,EAAKuC,IAAQ,EAClC7G,EAAMA,EAAK5G,KAAKuO,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKzD,EAAK8C,IAAQ,GACvB5N,KAAKuO,KAAKxD,EAAK4C,IAAQ,EACpCnF,EAAMA,EAAKxI,KAAKuO,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQjL,GAJZ+C,EAAMA,EAAK5G,KAAKuO,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK5D,EAAKoD,IAAQ,GACvB/N,KAAKuO,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrDjK,IAFA2E,EAAMA,EAAKxI,KAAKuO,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAK5G,KAAKuO,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAMxK,KAAKuO,KAAKpC,EAAKO,IACR1M,KAAKuO,KAAKnC,EAAKK,GAAQ,EACpCjE,EAAKxI,KAAKuO,KAAKnC,EAAKM,GACpB9F,EAAMA,EAAK5G,KAAKuO,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKvC,EAAKa,GAAQ,GACvB7M,KAAKuO,KAAKtC,EAAKW,GAAQ,EACpCpE,EAAMA,EAAKxI,KAAKuO,KAAKtC,EAAKY,GAAQ,EAClCjG,EAAMA,EAAK5G,KAAKuO,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK1C,EAAKmB,GAAQ,GACvBhN,KAAKuO,KAAKzC,EAAKiB,GAAQ,EACpCvE,EAAMA,EAAKxI,KAAKuO,KAAKzC,EAAKkB,GAAQ,EAClCpG,EAAMA,EAAK5G,KAAKuO,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK7C,EAAKyB,GAAQ,GACvBnN,KAAKuO,KAAK5C,EAAKuB,GAAQ,EACpC1E,EAAMA,EAAKxI,KAAKuO,KAAK5C,EAAKwB,GAAQ,EAClCvG,EAAMA,EAAK5G,KAAKuO,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKhD,EAAK+B,IAAQ,GACvBtN,KAAKuO,KAAK/C,EAAK6B,GAAQ,EACpC7E,EAAMA,EAAKxI,KAAKuO,KAAK/C,EAAK8B,IAAQ,EAClC1G,EAAMA,EAAK5G,KAAKuO,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKnD,EAAKqC,IAAQ,GACvBzN,KAAKuO,KAAKlD,EAAKmC,IAAQ,EACpChF,EAAMA,EAAKxI,KAAKuO,KAAKlD,EAAKoC,IAAQ,EAClC7G,EAAMA,EAAK5G,KAAKuO,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKtD,EAAK2C,IAAQ,GACvB5N,KAAKuO,KAAKrD,EAAKyC,IAAQ,EACpCnF,EAAMA,EAAKxI,KAAKuO,KAAKrD,EAAK0C,IAAQ,EAClChH,EAAMA,EAAK5G,KAAKuO,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKzD,EAAKiD,IAAQ,GACvB/N,KAAKuO,KAAKxD,EAAK+C,IAAQ,EACpCtF,EAAMA,EAAKxI,KAAKuO,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQlL,GAJZ+C,EAAMA,EAAK5G,KAAKuO,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK5D,EAAKuD,IAAQ,GACvBlO,KAAKuO,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrDpK,IAFA2E,EAAMA,EAAKxI,KAAKuO,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAK5G,KAAKuO,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAMxK,KAAKuO,KAAKjC,EAAKI,IACR1M,KAAKuO,KAAKhC,EAAKE,GAAQ,EACpCjE,EAAKxI,KAAKuO,KAAKhC,EAAKG,GACpB9F,EAAMA,EAAK5G,KAAKuO,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKpC,EAAKU,GAAQ,GACvB7M,KAAKuO,KAAKnC,EAAKQ,GAAQ,EACpCpE,EAAMA,EAAKxI,KAAKuO,KAAKnC,EAAKS,GAAQ,EAClCjG,EAAMA,EAAK5G,KAAKuO,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKvC,EAAKgB,GAAQ,GACvBhN,KAAKuO,KAAKtC,EAAKc,GAAQ,EACpCvE,EAAMA,EAAKxI,KAAKuO,KAAKtC,EAAKe,GAAQ,EAClCpG,EAAMA,EAAK5G,KAAKuO,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK1C,EAAKsB,GAAQ,GACvBnN,KAAKuO,KAAKzC,EAAKoB,GAAQ,EACpC1E,EAAMA,EAAKxI,KAAKuO,KAAKzC,EAAKqB,GAAQ,EAClCvG,EAAMA,EAAK5G,KAAKuO,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK7C,EAAK4B,IAAQ,GACvBtN,KAAKuO,KAAK5C,EAAK0B,GAAQ,EACpC7E,EAAMA,EAAKxI,KAAKuO,KAAK5C,EAAK2B,IAAQ,EAClC1G,EAAMA,EAAK5G,KAAKuO,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKhD,EAAKkC,IAAQ,GACvBzN,KAAKuO,KAAK/C,EAAKgC,IAAQ,EACpChF,EAAMA,EAAKxI,KAAKuO,KAAK/C,EAAKiC,IAAQ,EAClC7G,EAAMA,EAAK5G,KAAKuO,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKnD,EAAKwC,IAAQ,GACvB5N,KAAKuO,KAAKlD,EAAKsC,IAAQ,EACpCnF,EAAMA,EAAKxI,KAAKuO,KAAKlD,EAAKuC,IAAQ,EAClChH,EAAMA,EAAK5G,KAAKuO,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKtD,EAAK8C,IAAQ,GACvB/N,KAAKuO,KAAKrD,EAAK4C,IAAQ,EACpCtF,EAAMA,EAAKxI,KAAKuO,KAAKrD,EAAK6C,IAAQ,EAClCnH,EAAMA,EAAK5G,KAAKuO,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKzD,EAAKoD,IAAQ,GACvBlO,KAAKuO,KAAKxD,EAAKkD,IAAQ,EACpCzF,EAAMA,EAAKxI,KAAKuO,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQnL,GAJZ+C,EAAMA,EAAK5G,KAAKuO,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK5D,EAAK0D,IAAQ,GACvBrO,KAAKuO,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrDvK,IAFA2E,EAAMA,EAAKxI,KAAKuO,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENpI,EAAK5G,KAAKuO,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAMxK,KAAKuO,KAAKjC,EAAKO,IACR7M,KAAKuO,KAAKhC,EAAKK,GAAQ,EACpCpE,EAAKxI,KAAKuO,KAAKhC,EAAKM,GACpBjG,EAAMA,EAAK5G,KAAKuO,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKpC,EAAKa,GAAQ,GACvBhN,KAAKuO,KAAKnC,EAAKW,GAAQ,EACpCvE,EAAMA,EAAKxI,KAAKuO,KAAKnC,EAAKY,GAAQ,EAClCpG,EAAMA,EAAK5G,KAAKuO,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKvC,EAAKmB,GAAQ,GACvBnN,KAAKuO,KAAKtC,EAAKiB,GAAQ,EACpC1E,EAAMA,EAAKxI,KAAKuO,KAAKtC,EAAKkB,GAAQ,EAClCvG,EAAMA,EAAK5G,KAAKuO,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK1C,EAAKyB,IAAQ,GACvBtN,KAAKuO,KAAKzC,EAAKuB,GAAQ,EACpC7E,EAAMA,EAAKxI,KAAKuO,KAAKzC,EAAKwB,IAAQ,EAClC1G,EAAMA,EAAK5G,KAAKuO,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK7C,EAAK+B,IAAQ,GACvBzN,KAAKuO,KAAK5C,EAAK6B,IAAQ,EACpChF,EAAMA,EAAKxI,KAAKuO,KAAK5C,EAAK8B,IAAQ,EAClC7G,EAAMA,EAAK5G,KAAKuO,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKhD,EAAKqC,IAAQ,GACvB5N,KAAKuO,KAAK/C,EAAKmC,IAAQ,EACpCnF,EAAMA,EAAKxI,KAAKuO,KAAK/C,EAAKoC,IAAQ,EAClChH,EAAMA,EAAK5G,KAAKuO,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKnD,EAAK2C,IAAQ,GACvB/N,KAAKuO,KAAKlD,EAAKyC,IAAQ,EACpCtF,EAAMA,EAAKxI,KAAKuO,KAAKlD,EAAK0C,IAAQ,EAClCnH,EAAMA,EAAK5G,KAAKuO,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKtD,EAAKiD,IAAQ,GACvBlO,KAAKuO,KAAKrD,EAAK+C,IAAQ,EACpCzF,EAAMA,EAAKxI,KAAKuO,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAASpL,GAJb+C,EAAMA,EAAK5G,KAAKuO,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKzD,EAAKuD,IAAQ,GACvBrO,KAAKuO,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtDvK,IAFA2E,EAAMA,EAAKxI,KAAKuO,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEPrI,EAAK5G,KAAKuO,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAMxK,KAAKuO,KAAKjC,EAAKU,IACRhN,KAAKuO,KAAKhC,EAAKQ,GAAQ,EACpCvE,EAAKxI,KAAKuO,KAAKhC,EAAKS,GACpBpG,EAAMA,EAAK5G,KAAKuO,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKpC,EAAKgB,GAAQ,GACvBnN,KAAKuO,KAAKnC,EAAKc,GAAQ,EACpC1E,EAAMA,EAAKxI,KAAKuO,KAAKnC,EAAKe,GAAQ,EAClCvG,EAAMA,EAAK5G,KAAKuO,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKvC,EAAKsB,IAAQ,GACvBtN,KAAKuO,KAAKtC,EAAKoB,GAAQ,EACpC7E,EAAMA,EAAKxI,KAAKuO,KAAKtC,EAAKqB,IAAQ,EAClC1G,EAAMA,EAAK5G,KAAKuO,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK1C,EAAK4B,IAAQ,GACvBzN,KAAKuO,KAAKzC,EAAK0B,IAAQ,EACpChF,EAAMA,EAAKxI,KAAKuO,KAAKzC,EAAK2B,IAAQ,EAClC7G,EAAMA,EAAK5G,KAAKuO,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK7C,EAAKkC,IAAQ,GACvB5N,KAAKuO,KAAK5C,EAAKgC,IAAQ,EACpCnF,EAAMA,EAAKxI,KAAKuO,KAAK5C,EAAKiC,IAAQ,EAClChH,EAAMA,EAAK5G,KAAKuO,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKhD,EAAKwC,IAAQ,GACvB/N,KAAKuO,KAAK/C,EAAKsC,IAAQ,EACpCtF,EAAMA,EAAKxI,KAAKuO,KAAK/C,EAAKuC,IAAQ,EAClCnH,EAAMA,EAAK5G,KAAKuO,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKnD,EAAK8C,IAAQ,GACvBlO,KAAKuO,KAAKlD,EAAK4C,IAAQ,EACpCzF,EAAMA,EAAKxI,KAAKuO,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAASrL,GAJb+C,EAAMA,EAAK5G,KAAKuO,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKtD,EAAKoD,IAAQ,GACvBrO,KAAKuO,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtDvK,IAFA2E,EAAMA,EAAKxI,KAAKuO,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEPtI,EAAK5G,KAAKuO,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAMxK,KAAKuO,KAAKjC,EAAKa,IACRnN,KAAKuO,KAAKhC,EAAKW,GAAQ,EACpC1E,EAAKxI,KAAKuO,KAAKhC,EAAKY,GACpBvG,EAAMA,EAAK5G,KAAKuO,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKpC,EAAKmB,IAAQ,GACvBtN,KAAKuO,KAAKnC,EAAKiB,GAAQ,EACpC7E,EAAMA,EAAKxI,KAAKuO,KAAKnC,EAAKkB,IAAQ,EAClC1G,EAAMA,EAAK5G,KAAKuO,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKvC,EAAKyB,IAAQ,GACvBzN,KAAKuO,KAAKtC,EAAKuB,IAAQ,EACpChF,EAAMA,EAAKxI,KAAKuO,KAAKtC,EAAKwB,IAAQ,EAClC7G,EAAMA,EAAK5G,KAAKuO,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK1C,EAAK+B,IAAQ,GACvB5N,KAAKuO,KAAKzC,EAAK6B,IAAQ,EACpCnF,EAAMA,EAAKxI,KAAKuO,KAAKzC,EAAK8B,IAAQ,EAClChH,EAAMA,EAAK5G,KAAKuO,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK7C,EAAKqC,IAAQ,GACvB/N,KAAKuO,KAAK5C,EAAKmC,IAAQ,EACpCtF,EAAMA,EAAKxI,KAAKuO,KAAK5C,EAAKoC,IAAQ,EAClCnH,EAAMA,EAAK5G,KAAKuO,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKhD,EAAK2C,IAAQ,GACvBlO,KAAKuO,KAAK/C,EAAKyC,IAAQ,EACpCzF,EAAMA,EAAKxI,KAAKuO,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAAStL,GAJb+C,EAAMA,EAAK5G,KAAKuO,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKnD,EAAKiD,IAAQ,GACvBrO,KAAKuO,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtDvK,IAFA2E,EAAMA,EAAKxI,KAAKuO,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEPvI,EAAK5G,KAAKuO,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAMxK,KAAKuO,KAAKjC,EAAKgB,KACRtN,KAAKuO,KAAKhC,EAAKc,GAAQ,EACpC7E,EAAKxI,KAAKuO,KAAKhC,EAAKe,IACpB1G,EAAMA,EAAK5G,KAAKuO,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKpC,EAAKsB,IAAQ,GACvBzN,KAAKuO,KAAKnC,EAAKoB,IAAQ,EACpChF,EAAMA,EAAKxI,KAAKuO,KAAKnC,EAAKqB,IAAQ,EAClC7G,EAAMA,EAAK5G,KAAKuO,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKvC,EAAK4B,IAAQ,GACvB5N,KAAKuO,KAAKtC,EAAK0B,IAAQ,EACpCnF,EAAMA,EAAKxI,KAAKuO,KAAKtC,EAAK2B,IAAQ,EAClChH,EAAMA,EAAK5G,KAAKuO,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK1C,EAAKkC,IAAQ,GACvB/N,KAAKuO,KAAKzC,EAAKgC,IAAQ,EACpCtF,EAAMA,EAAKxI,KAAKuO,KAAKzC,EAAKiC,IAAQ,EAClCnH,EAAMA,EAAK5G,KAAKuO,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK7C,EAAKwC,IAAQ,GACvBlO,KAAKuO,KAAK5C,EAAKsC,IAAQ,EACpCzF,EAAMA,EAAKxI,KAAKuO,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAASvL,GAJb+C,EAAMA,EAAK5G,KAAKuO,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKhD,EAAK8C,IAAQ,GACvBrO,KAAKuO,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtDvK,IAFA2E,EAAMA,EAAKxI,KAAKuO,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEPxI,EAAK5G,KAAKuO,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAMxK,KAAKuO,KAAKjC,EAAKmB,KACRzN,KAAKuO,KAAKhC,EAAKiB,IAAQ,EACpChF,EAAKxI,KAAKuO,KAAKhC,EAAKkB,IACpB7G,EAAMA,EAAK5G,KAAKuO,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKpC,EAAKyB,IAAQ,GACvB5N,KAAKuO,KAAKnC,EAAKuB,IAAQ,EACpCnF,EAAMA,EAAKxI,KAAKuO,KAAKnC,EAAKwB,IAAQ,EAClChH,EAAMA,EAAK5G,KAAKuO,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKvC,EAAK+B,IAAQ,GACvB/N,KAAKuO,KAAKtC,EAAK6B,IAAQ,EACpCtF,EAAMA,EAAKxI,KAAKuO,KAAKtC,EAAK8B,IAAQ,EAClCnH,EAAMA,EAAK5G,KAAKuO,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK1C,EAAKqC,IAAQ,GACvBlO,KAAKuO,KAAKzC,EAAKmC,IAAQ,EACpCzF,EAAMA,EAAKxI,KAAKuO,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAASxL,GAJb+C,EAAMA,EAAK5G,KAAKuO,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK7C,EAAK2C,IAAQ,GACvBrO,KAAKuO,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtDvK,IAFA2E,EAAMA,EAAKxI,KAAKuO,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEPzI,EAAK5G,KAAKuO,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAMxK,KAAKuO,KAAKjC,EAAKsB,KACR5N,KAAKuO,KAAKhC,EAAKoB,IAAQ,EACpCnF,EAAKxI,KAAKuO,KAAKhC,EAAKqB,IACpBhH,EAAMA,EAAK5G,KAAKuO,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKpC,EAAK4B,IAAQ,GACvB/N,KAAKuO,KAAKnC,EAAK0B,IAAQ,EACpCtF,EAAMA,EAAKxI,KAAKuO,KAAKnC,EAAK2B,IAAQ,EAClCnH,EAAMA,EAAK5G,KAAKuO,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKvC,EAAKkC,IAAQ,GACvBlO,KAAKuO,KAAKtC,EAAKgC,IAAQ,EACpCzF,EAAMA,EAAKxI,KAAKuO,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAASzL,GAJb+C,EAAMA,EAAK5G,KAAKuO,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMxK,KAAKuO,KAAK1C,EAAKwC,IAAQ,GACvBrO,KAAKuO,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtDvK,IAFA2E,EAAMA,EAAKxI,KAAKuO,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAK5G,KAAKuO,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAMxK,KAAKuO,KAAKjC,EAAKyB,KACR/N,KAAKuO,KAAKhC,EAAKuB,IAAQ,EACpCtF,EAAKxI,KAAKuO,KAAKhC,EAAKwB,IACpBnH,EAAMA,EAAK5G,KAAKuO,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKpC,EAAK+B,IAAQ,GACvBlO,KAAKuO,KAAKnC,EAAK6B,IAAQ,EACpCzF,EAAMA,EAAKxI,KAAKuO,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAAS1L,GAJb+C,EAAMA,EAAK5G,KAAKuO,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKvC,EAAKqC,IAAQ,GACvBrO,KAAKuO,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtDvK,IAFA2E,EAAMA,EAAKxI,KAAKuO,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEP3I,EAAK5G,KAAKuO,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAMxK,KAAKuO,KAAKjC,EAAK4B,KACRlO,KAAKuO,KAAKhC,EAAK0B,IAAQ,EACpCzF,EAAKxI,KAAKuO,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAAS3L,GAJb+C,EAAMA,EAAK5G,KAAKuO,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMxK,KAAKuO,KAAKpC,EAAKkC,IAAQ,GACvBrO,KAAKuO,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtDvK,IAFA2E,EAAMA,EAAKxI,KAAKuO,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAAS5L,GAJb+C,EAAK5G,KAAKuO,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAMxK,KAAKuO,KAAKjC,EAAK+B,KACRrO,KAAKuO,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBAvK,IAFA2E,EAAKxI,KAAKuO,KAAKhC,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK6D,GACP7D,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,IAAN5L,IACF4G,EAAE,IAAM5G,EACR6C,EAAItD,UAECsD,GAiDT,SAASgJ,EAAYjJ,EAAMlC,EAAKmC,GAE9B,OADW,IAAIiJ,GACHC,KAAKnJ,EAAMlC,EAAKmC,GAsB9B,SAASiJ,EAAMjO,EAAGmO,GAChBxQ,KAAKqC,EAAIA,EACTrC,KAAKwQ,EAAIA,EAvEN7P,KAAKuO,OACRhE,EAAc/D,GAiDhB3D,EAAGnD,UAAUoQ,MAAQ,SAAgBvL,EAAKmC,GACxC,IACI7G,EAAMR,KAAK+D,OAASmB,EAAInB,OAW5B,OAVoB,KAAhB/D,KAAK+D,QAAgC,KAAfmB,EAAInB,OACtBmH,EAAYlL,KAAMkF,EAAKmC,GACpB7G,EAAM,GACT2G,EAAWnH,KAAMkF,EAAKmC,GACnB7G,EAAM,KArDnB,SAAmB4G,EAAMlC,EAAKmC,GAC5BA,EAAIxD,SAAWqB,EAAIrB,SAAWuD,EAAKvD,SACnCwD,EAAItD,OAASqD,EAAKrD,OAASmB,EAAInB,OAI/B,IAFA,IAAIyD,EAAQ,EACRkJ,EAAU,EACLnP,EAAI,EAAGA,EAAI8F,EAAItD,OAAS,EAAGxC,IAAK,CAGvC,IAAIkG,EAASiJ,EACbA,EAAU,EAGV,IAFA,IAAIhJ,EAAgB,SAARF,EACRG,EAAOhH,KAAKsE,IAAI1D,EAAG2D,EAAInB,OAAS,GAC3B+B,EAAInF,KAAKkB,IAAI,EAAGN,EAAI6F,EAAKrD,OAAS,GAAI+B,GAAK6B,EAAM7B,IAAK,CAC7D,IAAIvD,EAAIhB,EAAIuE,EAGRlB,GAFoB,EAAhBwC,EAAKtD,MAAMvB,KACI,EAAf2C,EAAIpB,MAAMgC,IAGdyB,EAAS,SAAJ3C,EAGT8C,EAAa,UADbH,EAAMA,EAAKG,EAAS,GAIpBgJ,IAFAjJ,GAHAA,EAAUA,GAAW7C,EAAI,SAAa,GAAM,IAGxB2C,IAAO,IAAO,KAEZ,GACtBE,GAAU,SAEZJ,EAAIvD,MAAMvC,GAAKmG,EACfF,EAAQC,EACRA,EAASiJ,EAQX,OANc,IAAVlJ,EACFH,EAAIvD,MAAMvC,GAAKiG,EAEfH,EAAItD,SAGCsD,EAAIpB,QAgBH0K,CAAS3Q,KAAMkF,EAAKmC,GAEpBgJ,EAAWrQ,KAAMkF,EAAKmC,IAchCiJ,EAAKjQ,UAAUuQ,QAAU,SAAkBC,GAGzC,IAFA,IAAI5H,EAAI,IAAI9D,MAAM0L,GACdC,EAAItN,EAAGnD,UAAU2I,WAAW6H,GAAK,EAC5BtO,EAAI,EAAGA,EAAIsO,EAAGtO,IACrB0G,EAAE1G,GAAKvC,KAAK+Q,OAAOxO,EAAGuO,EAAGD,GAG3B,OAAO5H,GAITqH,EAAKjQ,UAAU0Q,OAAS,SAAiB1O,EAAGyO,EAAGD,GAC7C,GAAU,IAANxO,GAAWA,IAAMwO,EAAI,EAAG,OAAOxO,EAGnC,IADA,IAAI2O,EAAK,EACAzO,EAAI,EAAGA,EAAIuO,EAAGvO,IACrByO,IAAW,EAAJ3O,IAAWyO,EAAIvO,EAAI,EAC1BF,IAAM,EAGR,OAAO2O,GAKTV,EAAKjQ,UAAU4Q,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAItO,EAAI,EAAGA,EAAIsO,EAAGtO,IACrB8O,EAAK9O,GAAK4O,EAAID,EAAI3O,IAClB+O,EAAK/O,GAAK6O,EAAIF,EAAI3O,KAItB+N,EAAKjQ,UAAUkR,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtElR,KAAKiR,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAI7O,EAAI,EAAGA,EAAI6O,EAAG7O,IAAM,EAM3B,IALA,IAAI8O,EAAI9O,GAAK,EAETwP,EAAQ7Q,KAAK8Q,IAAI,EAAI9Q,KAAK+Q,GAAKZ,GAC/Ba,EAAQhR,KAAKiR,IAAI,EAAIjR,KAAK+Q,GAAKZ,GAE1Be,EAAI,EAAGA,EAAIhB,EAAGgB,GAAKf,EAI1B,IAHA,IAAIgB,EAASN,EACTO,EAASJ,EAEJ7L,EAAI,EAAGA,EAAI9D,EAAG8D,IAAK,CAC1B,IAAIkM,EAAKX,EAAKQ,EAAI/L,GACdmM,EAAKX,EAAKO,EAAI/L,GAEdoM,EAAKb,EAAKQ,EAAI/L,EAAI9D,GAClBmQ,EAAKb,EAAKO,EAAI/L,EAAI9D,GAElBoQ,EAAKN,EAASI,EAAKH,EAASI,EAEhCA,EAAKL,EAASK,EAAKJ,EAASG,EAC5BA,EAAKE,EAELf,EAAKQ,EAAI/L,GAAKkM,EAAKE,EACnBZ,EAAKO,EAAI/L,GAAKmM,EAAKE,EAEnBd,EAAKQ,EAAI/L,EAAI9D,GAAKgQ,EAAKE,EACvBZ,EAAKO,EAAI/L,EAAI9D,GAAKiQ,EAAKE,EAGnBrM,IAAMgL,IACRsB,EAAKZ,EAAQM,EAASH,EAAQI,EAE9BA,EAASP,EAAQO,EAASJ,EAAQG,EAClCA,EAASM,KAOnB9B,EAAKjQ,UAAUgS,YAAc,SAAsB9R,EAAG+R,GACpD,IAAIzB,EAAqB,EAAjBlQ,KAAKkB,IAAIyQ,EAAG/R,GAChBgS,EAAU,EAAJ1B,EACNtO,EAAI,EACR,IAAKsO,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/BtO,IAGF,OAAO,GAAKA,EAAI,EAAIgQ,GAGtBjC,EAAKjQ,UAAUmS,UAAY,SAAoBrB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAItO,EAAI,EAAGA,EAAIsO,EAAI,EAAGtO,IAAK,CAC9B,IAAI0G,EAAIkI,EAAI5O,GAEZ4O,EAAI5O,GAAK4O,EAAIN,EAAItO,EAAI,GACrB4O,EAAIN,EAAItO,EAAI,GAAK0G,EAEjBA,EAAImI,EAAI7O,GAER6O,EAAI7O,IAAM6O,EAAIP,EAAItO,EAAI,GACtB6O,EAAIP,EAAItO,EAAI,IAAM0G,IAItBqH,EAAKjQ,UAAUoS,aAAe,SAAuBC,EAAI7B,GAEvD,IADA,IAAIrJ,EAAQ,EACHjF,EAAI,EAAGA,EAAIsO,EAAI,EAAGtO,IAAK,CAC9B,IAAIwD,EAAoC,KAAhCpF,KAAKgS,MAAMD,EAAG,EAAInQ,EAAI,GAAKsO,GACjClQ,KAAKgS,MAAMD,EAAG,EAAInQ,GAAKsO,GACvBrJ,EAEFkL,EAAGnQ,GAAS,SAAJwD,EAGNyB,EADEzB,EAAI,SACE,EAEAA,EAAI,SAAY,EAI5B,OAAO2M,GAGTpC,EAAKjQ,UAAUuS,WAAa,SAAqBF,EAAIlS,EAAK2Q,EAAKN,GAE7D,IADA,IAAIrJ,EAAQ,EACHjF,EAAI,EAAGA,EAAI/B,EAAK+B,IACvBiF,GAAyB,EAARkL,EAAGnQ,GAEpB4O,EAAI,EAAI5O,GAAa,KAARiF,EAAgBA,KAAkB,GAC/C2J,EAAI,EAAI5O,EAAI,GAAa,KAARiF,EAAgBA,KAAkB,GAIrD,IAAKjF,EAAI,EAAI/B,EAAK+B,EAAIsO,IAAKtO,EACzB4O,EAAI5O,GAAK,EAGXO,EAAiB,IAAV0E,GACP1E,EAA6B,KAAb,KAAR0E,KAGV8I,EAAKjQ,UAAUwS,KAAO,SAAehC,GAEnC,IADA,IAAIiC,EAAK,IAAI3N,MAAM0L,GACVtO,EAAI,EAAGA,EAAIsO,EAAGtO,IACrBuQ,EAAGvQ,GAAK,EAGV,OAAOuQ,GAGTxC,EAAKjQ,UAAUkQ,KAAO,SAAelO,EAAGmO,EAAGnJ,GACzC,IAAIwJ,EAAI,EAAI7Q,KAAKqS,YAAYhQ,EAAE0B,OAAQyM,EAAEzM,QAErCmN,EAAMlR,KAAK4Q,QAAQC,GAEnBkC,EAAI/S,KAAK6S,KAAKhC,GAEdM,EAAM,IAAIhM,MAAM0L,GAChBmC,EAAO,IAAI7N,MAAM0L,GACjBoC,EAAO,IAAI9N,MAAM0L,GAEjBqC,EAAO,IAAI/N,MAAM0L,GACjBsC,EAAQ,IAAIhO,MAAM0L,GAClBuC,EAAQ,IAAIjO,MAAM0L,GAElBwC,EAAOhM,EAAIvD,MACfuP,EAAKtP,OAAS8M,EAEd7Q,KAAK4S,WAAWvQ,EAAEyB,MAAOzB,EAAE0B,OAAQoN,EAAKN,GACxC7Q,KAAK4S,WAAWpC,EAAE1M,MAAO0M,EAAEzM,OAAQmP,EAAMrC,GAEzC7Q,KAAKuR,UAAUJ,EAAK4B,EAAGC,EAAMC,EAAMpC,EAAGK,GACtClR,KAAKuR,UAAU2B,EAAMH,EAAGI,EAAOC,EAAOvC,EAAGK,GAEzC,IAAK,IAAI3O,EAAI,EAAGA,EAAIsO,EAAGtO,IAAK,CAC1B,IAAI6P,EAAKY,EAAKzQ,GAAK4Q,EAAM5Q,GAAK0Q,EAAK1Q,GAAK6Q,EAAM7Q,GAC9C0Q,EAAK1Q,GAAKyQ,EAAKzQ,GAAK6Q,EAAM7Q,GAAK0Q,EAAK1Q,GAAK4Q,EAAM5Q,GAC/CyQ,EAAKzQ,GAAK6P,EAUZ,OAPApS,KAAKwS,UAAUQ,EAAMC,EAAMpC,GAC3B7Q,KAAKuR,UAAUyB,EAAMC,EAAMI,EAAMN,EAAGlC,EAAGK,GACvClR,KAAKwS,UAAUa,EAAMN,EAAGlC,GACxB7Q,KAAKyS,aAAaY,EAAMxC,GAExBxJ,EAAIxD,SAAWxB,EAAEwB,SAAW2M,EAAE3M,SAC9BwD,EAAItD,OAAS1B,EAAE0B,OAASyM,EAAEzM,OACnBsD,EAAIpB,SAIbzC,EAAGnD,UAAU2E,IAAM,SAAcE,GAC/B,IAAImC,EAAM,IAAI7D,EAAG,MAEjB,OADA6D,EAAIvD,MAAQ,IAAIqB,MAAMnF,KAAK+D,OAASmB,EAAInB,QACjC/D,KAAKyQ,MAAMvL,EAAKmC,IAIzB7D,EAAGnD,UAAUiT,KAAO,SAAepO,GACjC,IAAImC,EAAM,IAAI7D,EAAG,MAEjB,OADA6D,EAAIvD,MAAQ,IAAIqB,MAAMnF,KAAK+D,OAASmB,EAAInB,QACjCsM,EAAWrQ,KAAMkF,EAAKmC,IAI/B7D,EAAGnD,UAAU6O,KAAO,SAAehK,GACjC,OAAOlF,KAAK4G,QAAQ6J,MAAMvL,EAAKlF,OAGjCwD,EAAGnD,UAAUkG,MAAQ,SAAgBrB,GACnCpC,EAAsB,iBAARoC,GACdpC,EAAOoC,EAAM,UAIb,IADA,IAAIsC,EAAQ,EACHjF,EAAI,EAAGA,EAAIvC,KAAK+D,OAAQxB,IAAK,CACpC,IAAIwD,GAAqB,EAAhB/F,KAAK8D,MAAMvB,IAAU2C,EAC1BqC,GAAU,SAAJxB,IAA0B,SAARyB,GAC5BA,IAAU,GACVA,GAAUzB,EAAI,SAAa,EAE3ByB,GAASD,IAAO,GAChBvH,KAAK8D,MAAMvB,GAAU,SAALgF,EAQlB,OALc,IAAVC,IACFxH,KAAK8D,MAAMvB,GAAKiF,EAChBxH,KAAK+D,UAGA/D,MAGTwD,EAAGnD,UAAUkT,KAAO,SAAerO,GACjC,OAAOlF,KAAK4G,QAAQL,MAAMrB,IAI5B1B,EAAGnD,UAAUmT,IAAM,WACjB,OAAOxT,KAAKgF,IAAIhF,OAIlBwD,EAAGnD,UAAUoT,KAAO,WAClB,OAAOzT,KAAKkP,KAAKlP,KAAK4G,UAIxBpD,EAAGnD,UAAUoG,IAAM,SAAcvB,GAC/B,IAAIa,EAxxCN,SAAqBb,GAGnB,IAFA,IAAIa,EAAI,IAAIZ,MAAMD,EAAIzE,aAEbqK,EAAM,EAAGA,EAAM/E,EAAEhC,OAAQ+G,IAAO,CACvC,IAAI9E,EAAO8E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjB/E,EAAE+E,IAAQ5F,EAAIpB,MAAMkC,GAAQ,GAAK+E,KAAWA,EAG9C,OAAOhF,EA8wCC2N,CAAWxO,GACnB,GAAiB,IAAba,EAAEhC,OAAc,OAAO,IAAIP,EAAG,GAIlC,IADA,IAAImF,EAAM3I,KACDuC,EAAI,EAAGA,EAAIwD,EAAEhC,QACP,IAATgC,EAAExD,GADsBA,IAAKoG,EAAMA,EAAI6K,OAI7C,KAAMjR,EAAIwD,EAAEhC,OACV,IAAK,IAAI6E,EAAID,EAAI6K,MAAOjR,EAAIwD,EAAEhC,OAAQxB,IAAKqG,EAAIA,EAAE4K,MAClC,IAATzN,EAAExD,KAENoG,EAAMA,EAAI3D,IAAI4D,IAIlB,OAAOD,GAITnF,EAAGnD,UAAUsT,OAAS,SAAiBC,GACrC9Q,EAAuB,iBAAT8Q,GAAqBA,GAAQ,GAC3C,IAGIrR,EAHAqC,EAAIgP,EAAO,GACX5R,GAAK4R,EAAOhP,GAAK,GACjBiP,EAAa,WAAe,GAAKjP,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAI4C,EAAQ,EAEZ,IAAKjF,EAAI,EAAGA,EAAIvC,KAAK+D,OAAQxB,IAAK,CAChC,IAAIuR,EAAW9T,KAAK8D,MAAMvB,GAAKsR,EAC3BrP,GAAsB,EAAhBxE,KAAK8D,MAAMvB,IAAUuR,GAAalP,EAC5C5E,KAAK8D,MAAMvB,GAAKiC,EAAIgD,EACpBA,EAAQsM,IAAc,GAAKlP,EAGzB4C,IACFxH,KAAK8D,MAAMvB,GAAKiF,EAChBxH,KAAK+D,UAIT,GAAU,IAAN/B,EAAS,CACX,IAAKO,EAAIvC,KAAK+D,OAAS,EAAGxB,GAAK,EAAGA,IAChCvC,KAAK8D,MAAMvB,EAAIP,GAAKhC,KAAK8D,MAAMvB,GAGjC,IAAKA,EAAI,EAAGA,EAAIP,EAAGO,IACjBvC,KAAK8D,MAAMvB,GAAK,EAGlBvC,KAAK+D,QAAU/B,EAGjB,OAAOhC,KAAKiG,SAGdzC,EAAGnD,UAAU0T,MAAQ,SAAgBH,GAGnC,OADA9Q,EAAyB,IAAlB9C,KAAK6D,UACL7D,KAAK2T,OAAOC,IAMrBpQ,EAAGnD,UAAUyI,OAAS,SAAiB8K,EAAMI,EAAMC,GAEjD,IAAIC,EADJpR,EAAuB,iBAAT8Q,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAIpP,EAAIgP,EAAO,GACX5R,EAAIrB,KAAKsE,KAAK2O,EAAOhP,GAAK,GAAI5E,KAAK+D,QACnCoQ,EAAO,SAAc,WAAcvP,GAAMA,EACzCwP,EAAcH,EAMlB,GAJAC,GAAKlS,EACLkS,EAAIvT,KAAKkB,IAAI,EAAGqS,GAGZE,EAAa,CACf,IAAK,IAAI7R,EAAI,EAAGA,EAAIP,EAAGO,IACrB6R,EAAYtQ,MAAMvB,GAAKvC,KAAK8D,MAAMvB,GAEpC6R,EAAYrQ,OAAS/B,EAGvB,GAAU,IAANA,QAEG,GAAIhC,KAAK+D,OAAS/B,EAEvB,IADAhC,KAAK+D,QAAU/B,EACVO,EAAI,EAAGA,EAAIvC,KAAK+D,OAAQxB,IAC3BvC,KAAK8D,MAAMvB,GAAKvC,KAAK8D,MAAMvB,EAAIP,QAGjChC,KAAK8D,MAAM,GAAK,EAChB9D,KAAK+D,OAAS,EAGhB,IAAIyD,EAAQ,EACZ,IAAKjF,EAAIvC,KAAK+D,OAAS,EAAGxB,GAAK,IAAgB,IAAViF,GAAejF,GAAK2R,GAAI3R,IAAK,CAChE,IAAI+D,EAAuB,EAAhBtG,KAAK8D,MAAMvB,GACtBvC,KAAK8D,MAAMvB,GAAMiF,GAAU,GAAK5C,EAAO0B,IAAS1B,EAChD4C,EAAQlB,EAAO6N,EAajB,OATIC,GAAyB,IAAV5M,IACjB4M,EAAYtQ,MAAMsQ,EAAYrQ,UAAYyD,GAGxB,IAAhBxH,KAAK+D,SACP/D,KAAK8D,MAAM,GAAK,EAChB9D,KAAK+D,OAAS,GAGT/D,KAAKiG,SAGdzC,EAAGnD,UAAUgU,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADAnR,EAAyB,IAAlB9C,KAAK6D,UACL7D,KAAK8I,OAAO8K,EAAMI,EAAMC,IAIjCzQ,EAAGnD,UAAUiU,KAAO,SAAeV,GACjC,OAAO5T,KAAK4G,QAAQmN,MAAMH,IAG5BpQ,EAAGnD,UAAUkU,MAAQ,SAAgBX,GACnC,OAAO5T,KAAK4G,QAAQ+M,OAAOC,IAI7BpQ,EAAGnD,UAAU8B,KAAO,SAAeyR,GACjC,OAAO5T,KAAK4G,QAAQyN,MAAMT,IAG5BpQ,EAAGnD,UAAUmU,MAAQ,SAAgBZ,GACnC,OAAO5T,KAAK4G,QAAQkC,OAAO8K,IAI7BpQ,EAAGnD,UAAU4B,MAAQ,SAAgB6I,GACnChI,EAAsB,iBAARgI,GAAoBA,GAAO,GACzC,IAAIlG,EAAIkG,EAAM,GACV9I,GAAK8I,EAAMlG,GAAK,GAChBgE,EAAI,GAAKhE,EAGb,QAAI5E,KAAK+D,QAAU/B,OAGXhC,KAAK8D,MAAM9B,GAEL4G,IAIhBpF,EAAGnD,UAAUoU,OAAS,SAAiBb,GACrC9Q,EAAuB,iBAAT8Q,GAAqBA,GAAQ,GAC3C,IAAIhP,EAAIgP,EAAO,GACX5R,GAAK4R,EAAOhP,GAAK,GAIrB,GAFA9B,EAAyB,IAAlB9C,KAAK6D,SAAgB,2CAExB7D,KAAK+D,QAAU/B,EACjB,OAAOhC,KAQT,GALU,IAAN4E,GACF5C,IAEFhC,KAAK+D,OAASpD,KAAKsE,IAAIjD,EAAGhC,KAAK+D,QAErB,IAANa,EAAS,CACX,IAAIuP,EAAO,SAAc,WAAcvP,GAAMA,EAC7C5E,KAAK8D,MAAM9D,KAAK+D,OAAS,IAAMoQ,EAGjC,OAAOnU,KAAKiG,SAIdzC,EAAGnD,UAAUqU,MAAQ,SAAgBd,GACnC,OAAO5T,KAAK4G,QAAQ6N,OAAOb,IAI7BpQ,EAAGnD,UAAUoJ,MAAQ,SAAgBvE,GAGnC,OAFApC,EAAsB,iBAARoC,GACdpC,EAAOoC,EAAM,UACTA,EAAM,EAAUlF,KAAK2U,OAAOzP,GAGV,IAAlBlF,KAAK6D,SACa,IAAhB7D,KAAK+D,SAAiC,EAAhB/D,KAAK8D,MAAM,IAAUoB,GAC7ClF,KAAK8D,MAAM,GAAKoB,GAAuB,EAAhBlF,KAAK8D,MAAM,IAClC9D,KAAK6D,SAAW,EACT7D,OAGTA,KAAK6D,SAAW,EAChB7D,KAAK2U,MAAMzP,GACXlF,KAAK6D,SAAW,EACT7D,MAIFA,KAAKwG,OAAOtB,IAGrB1B,EAAGnD,UAAUmG,OAAS,SAAiBtB,GACrClF,KAAK8D,MAAM,IAAMoB,EAGjB,IAAK,IAAI3C,EAAI,EAAGA,EAAIvC,KAAK+D,QAAU/D,KAAK8D,MAAMvB,IAAM,SAAWA,IAC7DvC,KAAK8D,MAAMvB,IAAM,SACbA,IAAMvC,KAAK+D,OAAS,EACtB/D,KAAK8D,MAAMvB,EAAI,GAAK,EAEpBvC,KAAK8D,MAAMvB,EAAI,KAKnB,OAFAvC,KAAK+D,OAASpD,KAAKkB,IAAI7B,KAAK+D,OAAQxB,EAAI,GAEjCvC,MAITwD,EAAGnD,UAAUsU,MAAQ,SAAgBzP,GAGnC,GAFApC,EAAsB,iBAARoC,GACdpC,EAAOoC,EAAM,UACTA,EAAM,EAAG,OAAOlF,KAAKyJ,OAAOvE,GAEhC,GAAsB,IAAlBlF,KAAK6D,SAIP,OAHA7D,KAAK6D,SAAW,EAChB7D,KAAKyJ,MAAMvE,GACXlF,KAAK6D,SAAW,EACT7D,KAKT,GAFAA,KAAK8D,MAAM,IAAMoB,EAEG,IAAhBlF,KAAK+D,QAAgB/D,KAAK8D,MAAM,GAAK,EACvC9D,KAAK8D,MAAM,IAAM9D,KAAK8D,MAAM,GAC5B9D,KAAK6D,SAAW,OAGhB,IAAK,IAAItB,EAAI,EAAGA,EAAIvC,KAAK+D,QAAU/D,KAAK8D,MAAMvB,GAAK,EAAGA,IACpDvC,KAAK8D,MAAMvB,IAAM,SACjBvC,KAAK8D,MAAMvB,EAAI,IAAM,EAIzB,OAAOvC,KAAKiG,SAGdzC,EAAGnD,UAAUuU,KAAO,SAAe1P,GACjC,OAAOlF,KAAK4G,QAAQ6C,MAAMvE,IAG5B1B,EAAGnD,UAAU0B,KAAO,SAAemD,GACjC,OAAOlF,KAAK4G,QAAQ+N,MAAMzP,IAG5B1B,EAAGnD,UAAUwU,KAAO,WAGlB,OAFA7U,KAAK6D,SAAW,EAET7D,MAGTwD,EAAGnD,UAAUkJ,IAAM,WACjB,OAAOvJ,KAAK4G,QAAQiO,QAGtBrR,EAAGnD,UAAUyU,aAAe,SAAuB5P,EAAKF,EAAK+P,GAC3D,IACIxS,EAIAwD,EALAvF,EAAM0E,EAAInB,OAASgR,EAGvB/U,KAAK6G,QAAQrG,GAGb,IAAIgH,EAAQ,EACZ,IAAKjF,EAAI,EAAGA,EAAI2C,EAAInB,OAAQxB,IAAK,CAC/BwD,GAA6B,EAAxB/F,KAAK8D,MAAMvB,EAAIwS,IAAcvN,EAClC,IAAIlC,GAAwB,EAAfJ,EAAIpB,MAAMvB,IAAUyC,EAEjCwC,IADAzB,GAAa,SAART,IACS,KAAQA,EAAQ,SAAa,GAC3CtF,KAAK8D,MAAMvB,EAAIwS,GAAa,SAAJhP,EAE1B,KAAOxD,EAAIvC,KAAK+D,OAASgR,EAAOxS,IAE9BiF,GADAzB,GAA6B,EAAxB/F,KAAK8D,MAAMvB,EAAIwS,IAAcvN,IACrB,GACbxH,KAAK8D,MAAMvB,EAAIwS,GAAa,SAAJhP,EAG1B,GAAc,IAAVyB,EAAa,OAAOxH,KAAKiG,QAK7B,IAFAnD,GAAkB,IAAX0E,GACPA,EAAQ,EACHjF,EAAI,EAAGA,EAAIvC,KAAK+D,OAAQxB,IAE3BiF,GADAzB,IAAsB,EAAhB/F,KAAK8D,MAAMvB,IAAUiF,IACd,GACbxH,KAAK8D,MAAMvB,GAAS,SAAJwD,EAIlB,OAFA/F,KAAK6D,SAAW,EAET7D,KAAKiG,SAGdzC,EAAGnD,UAAU2U,SAAW,SAAmB9P,EAAK+P,GAC9C,IAAIF,GAAQ/U,KAAK+D,OAASmB,EAAInB,QAE1BlD,EAAIb,KAAK4G,QACTU,EAAIpC,EAGJgQ,EAA8B,EAAxB5N,EAAExD,MAAMwD,EAAEvD,OAAS,GAGf,KADdgR,EAAQ,GADM/U,KAAKgJ,WAAWkM,MAG5B5N,EAAIA,EAAEiN,MAAMQ,GACZlU,EAAE8S,OAAOoB,GACTG,EAA8B,EAAxB5N,EAAExD,MAAMwD,EAAEvD,OAAS,IAI3B,IACI6E,EADA0J,EAAIzR,EAAEkD,OAASuD,EAAEvD,OAGrB,GAAa,QAATkR,EAAgB,EAClBrM,EAAI,IAAIpF,EAAG,OACTO,OAASuO,EAAI,EACf1J,EAAE9E,MAAQ,IAAIqB,MAAMyD,EAAE7E,QACtB,IAAK,IAAIxB,EAAI,EAAGA,EAAIqG,EAAE7E,OAAQxB,IAC5BqG,EAAE9E,MAAMvB,GAAK,EAIjB,IAAI4S,EAAOtU,EAAE+F,QAAQkO,aAAaxN,EAAG,EAAGgL,GAClB,IAAlB6C,EAAKtR,WACPhD,EAAIsU,EACAvM,IACFA,EAAE9E,MAAMwO,GAAK,IAIjB,IAAK,IAAIxM,EAAIwM,EAAI,EAAGxM,GAAK,EAAGA,IAAK,CAC/B,IAAIsP,EAAmC,UAAL,EAAxBvU,EAAEiD,MAAMwD,EAAEvD,OAAS+B,KACE,EAA5BjF,EAAEiD,MAAMwD,EAAEvD,OAAS+B,EAAI,IAO1B,IAHAsP,EAAKzU,KAAKsE,IAAKmQ,EAAKF,EAAO,EAAG,UAE9BrU,EAAEiU,aAAaxN,EAAG8N,EAAItP,GACA,IAAfjF,EAAEgD,UACPuR,IACAvU,EAAEgD,SAAW,EACbhD,EAAEiU,aAAaxN,EAAG,EAAGxB,GAChBjF,EAAEkH,WACLlH,EAAEgD,UAAY,GAGd+E,IACFA,EAAE9E,MAAMgC,GAAKsP,GAajB,OAVIxM,GACFA,EAAE3C,QAEJpF,EAAEoF,QAGW,QAATgP,GAA4B,IAAVF,GACpBlU,EAAEiI,OAAOiM,GAGJ,CACLM,IAAKzM,GAAK,KACVvC,IAAKxF,IAQT2C,EAAGnD,UAAUiV,OAAS,SAAiBpQ,EAAK+P,EAAMM,GAGhD,OAFAzS,GAAQoC,EAAI6C,UAER/H,KAAK+H,SACA,CACLsN,IAAK,IAAI7R,EAAG,GACZ6C,IAAK,IAAI7C,EAAG,IAKM,IAAlBxD,KAAK6D,UAAmC,IAAjBqB,EAAIrB,UAC7B8E,EAAM3I,KAAK8J,MAAMwL,OAAOpQ,EAAK+P,GAEhB,QAATA,IACFI,EAAM1M,EAAI0M,IAAIvL,OAGH,QAATmL,IACF5O,EAAMsC,EAAItC,IAAIyD,MACVyL,GAA6B,IAAjBlP,EAAIxC,UAClBwC,EAAI2E,KAAK9F,IAIN,CACLmQ,IAAKA,EACLhP,IAAKA,IAIa,IAAlBrG,KAAK6D,UAAmC,IAAjBqB,EAAIrB,UAC7B8E,EAAM3I,KAAKsV,OAAOpQ,EAAI4E,MAAOmL,GAEhB,QAATA,IACFI,EAAM1M,EAAI0M,IAAIvL,OAGT,CACLuL,IAAKA,EACLhP,IAAKsC,EAAItC,MAI0B,IAAlCrG,KAAK6D,SAAWqB,EAAIrB,WACvB8E,EAAM3I,KAAK8J,MAAMwL,OAAOpQ,EAAI4E,MAAOmL,GAEtB,QAATA,IACF5O,EAAMsC,EAAItC,IAAIyD,MACVyL,GAA6B,IAAjBlP,EAAIxC,UAClBwC,EAAI4E,KAAK/F,IAIN,CACLmQ,IAAK1M,EAAI0M,IACThP,IAAKA,IAOLnB,EAAInB,OAAS/D,KAAK+D,QAAU/D,KAAKe,IAAImE,GAAO,EACvC,CACLmQ,IAAK,IAAI7R,EAAG,GACZ6C,IAAKrG,MAKU,IAAfkF,EAAInB,OACO,QAATkR,EACK,CACLI,IAAKrV,KAAKwV,KAAKtQ,EAAIpB,MAAM,IACzBuC,IAAK,MAII,QAAT4O,EACK,CACLI,IAAK,KACLhP,IAAK,IAAI7C,EAAGxD,KAAKgI,KAAK9C,EAAIpB,MAAM,MAI7B,CACLuR,IAAKrV,KAAKwV,KAAKtQ,EAAIpB,MAAM,IACzBuC,IAAK,IAAI7C,EAAGxD,KAAKgI,KAAK9C,EAAIpB,MAAM,MAI7B9D,KAAKgV,SAAS9P,EAAK+P,GAlF1B,IAAII,EAAKhP,EAAKsC,GAsFhBnF,EAAGnD,UAAUgV,IAAM,SAAcnQ,GAC/B,OAAOlF,KAAKsV,OAAOpQ,EAAK,OAAO,GAAOmQ,KAIxC7R,EAAGnD,UAAUgG,IAAM,SAAcnB,GAC/B,OAAOlF,KAAKsV,OAAOpQ,EAAK,OAAO,GAAOmB,KAGxC7C,EAAGnD,UAAUoV,KAAO,SAAevQ,GACjC,OAAOlF,KAAKsV,OAAOpQ,EAAK,OAAO,GAAMmB,KAIvC7C,EAAGnD,UAAUqV,SAAW,SAAmBxQ,GACzC,IAAIyQ,EAAK3V,KAAKsV,OAAOpQ,GAGrB,GAAIyQ,EAAGtP,IAAI0B,SAAU,OAAO4N,EAAGN,IAE/B,IAAIhP,EAA0B,IAApBsP,EAAGN,IAAIxR,SAAiB8R,EAAGtP,IAAI4E,KAAK/F,GAAOyQ,EAAGtP,IAEpDuP,EAAO1Q,EAAIsP,MAAM,GACjBqB,EAAK3Q,EAAI2D,MAAM,GACf9H,EAAMsF,EAAItF,IAAI6U,GAGlB,OAAI7U,EAAM,GAAY,IAAP8U,GAAoB,IAAR9U,EAAkB4U,EAAGN,IAGrB,IAApBM,EAAGN,IAAIxR,SAAiB8R,EAAGN,IAAIV,MAAM,GAAKgB,EAAGN,IAAI5L,MAAM,IAGhEjG,EAAGnD,UAAU2H,KAAO,SAAe9C,GACjCpC,EAAOoC,GAAO,UAId,IAHA,IAAI2M,GAAK,GAAK,IAAM3M,EAEhB4Q,EAAM,EACDvT,EAAIvC,KAAK+D,OAAS,EAAGxB,GAAK,EAAGA,IACpCuT,GAAOjE,EAAIiE,GAAuB,EAAhB9V,KAAK8D,MAAMvB,KAAW2C,EAG1C,OAAO4Q,GAITtS,EAAGnD,UAAU4H,MAAQ,SAAgB/C,GACnCpC,EAAOoC,GAAO,UAGd,IADA,IAAIsC,EAAQ,EACHjF,EAAIvC,KAAK+D,OAAS,EAAGxB,GAAK,EAAGA,IAAK,CACzC,IAAIwD,GAAqB,EAAhB/F,KAAK8D,MAAMvB,IAAkB,SAARiF,EAC9BxH,KAAK8D,MAAMvB,GAAMwD,EAAIb,EAAO,EAC5BsC,EAAQzB,EAAIb,EAGd,OAAOlF,KAAKiG,SAGdzC,EAAGnD,UAAUmV,KAAO,SAAetQ,GACjC,OAAOlF,KAAK4G,QAAQqB,MAAM/C,IAG5B1B,EAAGnD,UAAU0V,KAAO,SAAelE,GACjC/O,EAAsB,IAAf+O,EAAEhO,UACTf,GAAQ+O,EAAE9J,UAEV,IAAI1F,EAAIrC,KACJwQ,EAAIqB,EAAEjL,QAGRvE,EADiB,IAAfA,EAAEwB,SACAxB,EAAEoT,KAAK5D,GAEPxP,EAAEuE,QAaR,IATA,IAAIoP,EAAI,IAAIxS,EAAG,GACXyS,EAAI,IAAIzS,EAAG,GAGX0S,EAAI,IAAI1S,EAAG,GACX2S,EAAI,IAAI3S,EAAG,GAEXd,EAAI,EAEDL,EAAE+T,UAAY5F,EAAE4F,UACrB/T,EAAEyG,OAAO,GACT0H,EAAE1H,OAAO,KACPpG,EAMJ,IAHA,IAAI2T,EAAK7F,EAAE5J,QACP0P,EAAKjU,EAAEuE,SAEHvE,EAAE0F,UAAU,CAClB,IAAK,IAAIxF,EAAI,EAAGgU,EAAK,EAAyB,IAArBlU,EAAEyB,MAAM,GAAKyS,IAAahU,EAAI,KAAMA,EAAGgU,IAAO,GACvE,GAAIhU,EAAI,EAEN,IADAF,EAAEyG,OAAOvG,GACFA,KAAM,IACPyT,EAAEQ,SAAWP,EAAEO,WACjBR,EAAEhL,KAAKqL,GACPJ,EAAEhL,KAAKqL,IAGTN,EAAElN,OAAO,GACTmN,EAAEnN,OAAO,GAIb,IAAK,IAAIhD,EAAI,EAAG2Q,EAAK,EAAyB,IAArBjG,EAAE1M,MAAM,GAAK2S,IAAa3Q,EAAI,KAAMA,EAAG2Q,IAAO,GACvE,GAAI3Q,EAAI,EAEN,IADA0K,EAAE1H,OAAOhD,GACFA,KAAM,IACPoQ,EAAEM,SAAWL,EAAEK,WACjBN,EAAElL,KAAKqL,GACPF,EAAElL,KAAKqL,IAGTJ,EAAEpN,OAAO,GACTqN,EAAErN,OAAO,GAITzG,EAAEtB,IAAIyP,IAAM,GACdnO,EAAE4I,KAAKuF,GACPwF,EAAE/K,KAAKiL,GACPD,EAAEhL,KAAKkL,KAEP3F,EAAEvF,KAAK5I,GACP6T,EAAEjL,KAAK+K,GACPG,EAAElL,KAAKgL,IAIX,MAAO,CACLpV,EAAGqV,EACH5O,EAAG6O,EACHxT,IAAK6N,EAAEmD,OAAOjR,KAOlBc,EAAGnD,UAAUqW,OAAS,SAAiB7E,GACrC/O,EAAsB,IAAf+O,EAAEhO,UACTf,GAAQ+O,EAAE9J,UAEV,IAAIlH,EAAIb,KACJsH,EAAIuK,EAAEjL,QAGR/F,EADiB,IAAfA,EAAEgD,SACAhD,EAAE4U,KAAK5D,GAEPhR,EAAE+F,QAQR,IALA,IAuCI+B,EAvCAgO,EAAK,IAAInT,EAAG,GACZoT,EAAK,IAAIpT,EAAG,GAEZqT,EAAQvP,EAAEV,QAEP/F,EAAE+B,KAAK,GAAK,GAAK0E,EAAE1E,KAAK,GAAK,GAAG,CACrC,IAAK,IAAIL,EAAI,EAAGgU,EAAK,EAAyB,IAArB1V,EAAEiD,MAAM,GAAKyS,IAAahU,EAAI,KAAMA,EAAGgU,IAAO,GACvE,GAAIhU,EAAI,EAEN,IADA1B,EAAEiI,OAAOvG,GACFA,KAAM,GACPoU,EAAGH,SACLG,EAAG3L,KAAK6L,GAGVF,EAAG7N,OAAO,GAId,IAAK,IAAIhD,EAAI,EAAG2Q,EAAK,EAAyB,IAArBnP,EAAExD,MAAM,GAAK2S,IAAa3Q,EAAI,KAAMA,EAAG2Q,IAAO,GACvE,GAAI3Q,EAAI,EAEN,IADAwB,EAAEwB,OAAOhD,GACFA,KAAM,GACP8Q,EAAGJ,SACLI,EAAG5L,KAAK6L,GAGVD,EAAG9N,OAAO,GAIVjI,EAAEE,IAAIuG,IAAM,GACdzG,EAAEoK,KAAK3D,GACPqP,EAAG1L,KAAK2L,KAERtP,EAAE2D,KAAKpK,GACP+V,EAAG3L,KAAK0L,IAeZ,OATEhO,EADgB,IAAd9H,EAAE+B,KAAK,GACH+T,EAEAC,GAGAhU,KAAK,GAAK,GAChB+F,EAAIqC,KAAK6G,GAGJlJ,GAGTnF,EAAGnD,UAAUsC,IAAM,SAAcuC,GAC/B,GAAIlF,KAAK+H,SAAU,OAAO7C,EAAIqE,MAC9B,GAAIrE,EAAI6C,SAAU,OAAO/H,KAAKuJ,MAE9B,IAAI1I,EAAIb,KAAK4G,QACTU,EAAIpC,EAAI0B,QACZ/F,EAAEgD,SAAW,EACbyD,EAAEzD,SAAW,EAGb,IAAK,IAAIkR,EAAQ,EAAGlU,EAAEuV,UAAY9O,EAAE8O,SAAUrB,IAC5ClU,EAAEiI,OAAO,GACTxB,EAAEwB,OAAO,GAGX,OAAG,CACD,KAAOjI,EAAEuV,UACPvV,EAAEiI,OAAO,GAEX,KAAOxB,EAAE8O,UACP9O,EAAEwB,OAAO,GAGX,IAAIlE,EAAI/D,EAAEE,IAAIuG,GACd,GAAI1C,EAAI,EAAG,CAET,IAAIqE,EAAIpI,EACRA,EAAIyG,EACJA,EAAI2B,OACC,GAAU,IAANrE,GAAyB,IAAd0C,EAAE1E,KAAK,GAC3B,MAGF/B,EAAEoK,KAAK3D,GAGT,OAAOA,EAAEqM,OAAOoB,IAIlBvR,EAAGnD,UAAUyW,KAAO,SAAe5R,GACjC,OAAOlF,KAAK+V,KAAK7Q,GAAKrE,EAAE4U,KAAKvQ,IAG/B1B,EAAGnD,UAAU+V,OAAS,WACpB,OAA+B,IAAP,EAAhBpW,KAAK8D,MAAM,KAGrBN,EAAGnD,UAAUmW,MAAQ,WACnB,OAA+B,IAAP,EAAhBxW,KAAK8D,MAAM,KAIrBN,EAAGnD,UAAUwI,MAAQ,SAAgB3D,GACnC,OAAOlF,KAAK8D,MAAM,GAAKoB,GAIzB1B,EAAGnD,UAAU0W,MAAQ,SAAgBjM,GACnChI,EAAsB,iBAARgI,GACd,IAAIlG,EAAIkG,EAAM,GACV9I,GAAK8I,EAAMlG,GAAK,GAChBgE,EAAI,GAAKhE,EAGb,GAAI5E,KAAK+D,QAAU/B,EAGjB,OAFAhC,KAAK6G,QAAQ7E,EAAI,GACjBhC,KAAK8D,MAAM9B,IAAM4G,EACV5I,KAKT,IADA,IAAIwH,EAAQoB,EACHrG,EAAIP,EAAa,IAAVwF,GAAejF,EAAIvC,KAAK+D,OAAQxB,IAAK,CACnD,IAAIwD,EAAoB,EAAhB/F,KAAK8D,MAAMvB,GAEnBiF,GADAzB,GAAKyB,KACS,GACdzB,GAAK,SACL/F,KAAK8D,MAAMvB,GAAKwD,EAMlB,OAJc,IAAVyB,IACFxH,KAAK8D,MAAMvB,GAAKiF,EAChBxH,KAAK+D,UAEA/D,MAGTwD,EAAGnD,UAAU0H,OAAS,WACpB,OAAuB,IAAhB/H,KAAK+D,QAAkC,IAAlB/D,KAAK8D,MAAM,IAGzCN,EAAGnD,UAAUuC,KAAO,SAAesC,GACjC,IAOIyD,EAPA9E,EAAWqB,EAAM,EAErB,GAAsB,IAAlBlF,KAAK6D,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlB7D,KAAK6D,UAAkBA,EAAU,OAAO,EAK5C,GAHA7D,KAAKiG,QAGDjG,KAAK+D,OAAS,EAChB4E,EAAM,MACD,CACD9E,IACFqB,GAAOA,GAGTpC,EAAOoC,GAAO,SAAW,qBAEzB,IAAIa,EAAoB,EAAhB/F,KAAK8D,MAAM,GACnB6E,EAAM5C,IAAMb,EAAM,EAAIa,EAAIb,GAAO,EAAI,EAEvC,OAAsB,IAAlBlF,KAAK6D,SAA8B,GAAN8E,EAC1BA,GAOTnF,EAAGnD,UAAUU,IAAM,SAAcmE,GAC/B,GAAsB,IAAlBlF,KAAK6D,UAAmC,IAAjBqB,EAAIrB,SAAgB,OAAQ,EACvD,GAAsB,IAAlB7D,KAAK6D,UAAmC,IAAjBqB,EAAIrB,SAAgB,OAAO,EAEtD,IAAI8E,EAAM3I,KAAKgX,KAAK9R,GACpB,OAAsB,IAAlBlF,KAAK6D,SAA8B,GAAN8E,EAC1BA,GAITnF,EAAGnD,UAAU2W,KAAO,SAAe9R,GAEjC,GAAIlF,KAAK+D,OAASmB,EAAInB,OAAQ,OAAO,EACrC,GAAI/D,KAAK+D,OAASmB,EAAInB,OAAQ,OAAQ,EAGtC,IADA,IAAI4E,EAAM,EACDpG,EAAIvC,KAAK+D,OAAS,EAAGxB,GAAK,EAAGA,IAAK,CACzC,IAAI1B,EAAoB,EAAhBb,KAAK8D,MAAMvB,GACf+E,EAAmB,EAAfpC,EAAIpB,MAAMvB,GAElB,GAAI1B,IAAMyG,EAAV,CACIzG,EAAIyG,EACNqB,GAAO,EACE9H,EAAIyG,IACbqB,EAAM,GAER,OAEF,OAAOA,GAGTnF,EAAGnD,UAAU4W,IAAM,SAAc/R,GAC/B,OAA0B,IAAnBlF,KAAK4C,KAAKsC,IAGnB1B,EAAGnD,UAAU6W,GAAK,SAAahS,GAC7B,OAAyB,IAAlBlF,KAAKe,IAAImE,IAGlB1B,EAAGnD,UAAU8W,KAAO,SAAejS,GACjC,OAAOlF,KAAK4C,KAAKsC,IAAQ,GAG3B1B,EAAGnD,UAAU+W,IAAM,SAAclS,GAC/B,OAAOlF,KAAKe,IAAImE,IAAQ,GAG1B1B,EAAGnD,UAAUgX,IAAM,SAAcnS,GAC/B,OAA2B,IAApBlF,KAAK4C,KAAKsC,IAGnB1B,EAAGnD,UAAUiX,GAAK,SAAapS,GAC7B,OAA0B,IAAnBlF,KAAKe,IAAImE,IAGlB1B,EAAGnD,UAAUkX,KAAO,SAAerS,GACjC,OAAOlF,KAAK4C,KAAKsC,IAAQ,GAG3B1B,EAAGnD,UAAUmX,IAAM,SAActS,GAC/B,OAAOlF,KAAKe,IAAImE,IAAQ,GAG1B1B,EAAGnD,UAAUoX,IAAM,SAAcvS,GAC/B,OAA0B,IAAnBlF,KAAK4C,KAAKsC,IAGnB1B,EAAGnD,UAAUqX,GAAK,SAAaxS,GAC7B,OAAyB,IAAlBlF,KAAKe,IAAImE,IAOlB1B,EAAG/B,IAAM,SAAcyD,GACrB,OAAO,IAAIyS,EAAIzS,IAGjB1B,EAAGnD,UAAUuB,MAAQ,SAAgBgW,GAGnC,OAFA9U,GAAQ9C,KAAKyB,IAAK,yCAClBqB,EAAyB,IAAlB9C,KAAK6D,SAAgB,iCACrB+T,EAAIC,UAAU7X,MAAM8X,UAAUF,IAGvCpU,EAAGnD,UAAUwC,QAAU,WAErB,OADAC,EAAO9C,KAAKyB,IAAK,wDACVzB,KAAKyB,IAAIsW,YAAY/X,OAG9BwD,EAAGnD,UAAUyX,UAAY,SAAoBF,GAE3C,OADA5X,KAAKyB,IAAMmW,EACJ5X,MAGTwD,EAAGnD,UAAU2X,SAAW,SAAmBJ,GAEzC,OADA9U,GAAQ9C,KAAKyB,IAAK,yCACXzB,KAAK8X,UAAUF,IAGxBpU,EAAGnD,UAAU4X,OAAS,SAAiB/S,GAErC,OADApC,EAAO9C,KAAKyB,IAAK,sCACVzB,KAAKyB,IAAIJ,IAAIrB,KAAMkF,IAG5B1B,EAAGnD,UAAU6X,QAAU,SAAkBhT,GAEvC,OADApC,EAAO9C,KAAKyB,IAAK,uCACVzB,KAAKyB,IAAIuJ,KAAKhL,KAAMkF,IAG7B1B,EAAGnD,UAAU8X,OAAS,SAAiBjT,GAErC,OADApC,EAAO9C,KAAKyB,IAAK,sCACVzB,KAAKyB,IAAIL,IAAIpB,KAAMkF,IAG5B1B,EAAGnD,UAAU+X,QAAU,SAAkBlT,GAEvC,OADApC,EAAO9C,KAAKyB,IAAK,uCACVzB,KAAKyB,IAAIwJ,KAAKjL,KAAMkF,IAG7B1B,EAAGnD,UAAUgY,OAAS,SAAiBnT,GAErC,OADApC,EAAO9C,KAAKyB,IAAK,sCACVzB,KAAKyB,IAAI6W,IAAItY,KAAMkF,IAG5B1B,EAAGnD,UAAUkY,OAAS,SAAiBrT,GAGrC,OAFApC,EAAO9C,KAAKyB,IAAK,sCACjBzB,KAAKyB,IAAI+W,SAASxY,KAAMkF,GACjBlF,KAAKyB,IAAIuD,IAAIhF,KAAMkF,IAG5B1B,EAAGnD,UAAUoY,QAAU,SAAkBvT,GAGvC,OAFApC,EAAO9C,KAAKyB,IAAK,sCACjBzB,KAAKyB,IAAI+W,SAASxY,KAAMkF,GACjBlF,KAAKyB,IAAIyN,KAAKlP,KAAMkF,IAG7B1B,EAAGnD,UAAUmC,OAAS,WAGpB,OAFAM,EAAO9C,KAAKyB,IAAK,sCACjBzB,KAAKyB,IAAIiX,SAAS1Y,MACXA,KAAKyB,IAAI+R,IAAIxT,OAGtBwD,EAAGnD,UAAUsY,QAAU,WAGrB,OAFA7V,EAAO9C,KAAKyB,IAAK,uCACjBzB,KAAKyB,IAAIiX,SAAS1Y,MACXA,KAAKyB,IAAIgS,KAAKzT,OAIvBwD,EAAGnD,UAAUuY,QAAU,WAGrB,OAFA9V,EAAO9C,KAAKyB,IAAK,uCACjBzB,KAAKyB,IAAIiX,SAAS1Y,MACXA,KAAKyB,IAAIoX,KAAK7Y,OAGvBwD,EAAGnD,UAAUyY,QAAU,WAGrB,OAFAhW,EAAO9C,KAAKyB,IAAK,uCACjBzB,KAAKyB,IAAIiX,SAAS1Y,MACXA,KAAKyB,IAAIqV,KAAK9W,OAIvBwD,EAAGnD,UAAU0Y,OAAS,WAGpB,OAFAjW,EAAO9C,KAAKyB,IAAK,sCACjBzB,KAAKyB,IAAIiX,SAAS1Y,MACXA,KAAKyB,IAAIqI,IAAI9J,OAGtBwD,EAAGnD,UAAUiC,OAAS,SAAiB4C,GAGrC,OAFApC,EAAO9C,KAAKyB,MAAQyD,EAAIzD,IAAK,qBAC7BzB,KAAKyB,IAAIiX,SAAS1Y,MACXA,KAAKyB,IAAIgF,IAAIzG,KAAMkF,IAI5B,IAAI8T,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQC,EAAMzH,GAErB7R,KAAKsZ,KAAOA,EACZtZ,KAAK6R,EAAI,IAAIrO,EAAGqO,EAAG,IACnB7R,KAAKO,EAAIP,KAAK6R,EAAEpR,YAChBT,KAAKuB,EAAI,IAAIiC,EAAG,GAAGmQ,OAAO3T,KAAKO,GAAG0K,KAAKjL,KAAK6R,GAE5C7R,KAAKuZ,IAAMvZ,KAAKwZ,OAiDlB,SAASC,IACPJ,EAAOK,KACL1Z,KACA,OACA,2EA+DJ,SAAS2Z,IACPN,EAAOK,KACL1Z,KACA,OACA,kEAIJ,SAAS4Z,IACPP,EAAOK,KACL1Z,KACA,OACA,yDAIJ,SAAS6Z,IAEPR,EAAOK,KACL1Z,KACA,QACA,uEA8CJ,SAAS2X,EAAKrF,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAIwH,EAAQtW,EAAGuW,OAAOzH,GACtBtS,KAAKsS,EAAIwH,EAAMjI,EACf7R,KAAK8Z,MAAQA,OAEbhX,EAAOwP,EAAE2E,IAAI,GAAI,kCACjBjX,KAAKsS,EAAIA,EACTtS,KAAK8Z,MAAQ,KAkOjB,SAASE,EAAM1H,GACbqF,EAAI+B,KAAK1Z,KAAMsS,GAEftS,KAAK+U,MAAQ/U,KAAKsS,EAAE7R,YAChBT,KAAK+U,MAAQ,IAAO,IACtB/U,KAAK+U,OAAS,GAAM/U,KAAK+U,MAAQ,IAGnC/U,KAAK4E,EAAI,IAAIpB,EAAG,GAAGmQ,OAAO3T,KAAK+U,OAC/B/U,KAAK6V,GAAK7V,KAAKia,KAAKja,KAAK4E,EAAE4O,OAC3BxT,KAAKka,KAAOla,KAAK4E,EAAE8R,OAAO1W,KAAKsS,GAE/BtS,KAAKma,KAAOna,KAAKka,KAAKlV,IAAIhF,KAAK4E,GAAG+P,MAAM,GAAGU,IAAIrV,KAAKsS,GACpDtS,KAAKma,KAAOna,KAAKma,KAAK1E,KAAKzV,KAAK4E,GAChC5E,KAAKma,KAAOna,KAAK4E,EAAExD,IAAIpB,KAAKma,MA5a9Bd,EAAOhZ,UAAUmZ,KAAO,WACtB,IAAID,EAAM,IAAI/V,EAAG,MAEjB,OADA+V,EAAIzV,MAAQ,IAAIqB,MAAMxE,KAAKC,KAAKZ,KAAKO,EAAI,KAClCgZ,GAGTF,EAAOhZ,UAAU+Z,QAAU,SAAkBlV,GAG3C,IACImV,EADAzV,EAAIM,EAGR,GACElF,KAAKsa,MAAM1V,EAAG5E,KAAKuZ,KAGnBc,GADAzV,GADAA,EAAI5E,KAAKua,MAAM3V,IACToG,KAAKhL,KAAKuZ,MACP9Y,kBACF4Z,EAAOra,KAAKO,GAErB,IAAIQ,EAAMsZ,EAAOra,KAAKO,GAAK,EAAIqE,EAAEoS,KAAKhX,KAAK6R,GAgB3C,OAfY,IAAR9Q,GACF6D,EAAEd,MAAM,GAAK,EACbc,EAAEb,OAAS,GACFhD,EAAM,EACf6D,EAAEqG,KAAKjL,KAAK6R,QAEI2I,IAAZ5V,EAAEqB,MAEJrB,EAAEqB,QAGFrB,EAAE6V,SAIC7V,GAGTyU,EAAOhZ,UAAUia,MAAQ,SAAgBI,EAAOrT,GAC9CqT,EAAM5R,OAAO9I,KAAKO,EAAG,EAAG8G,IAG1BgS,EAAOhZ,UAAUka,MAAQ,SAAgBrV,GACvC,OAAOA,EAAIgK,KAAKlP,KAAKuB,IASvB2B,EAASuW,EAAMJ,GAEfI,EAAKpZ,UAAUia,MAAQ,SAAgBI,EAAOC,GAK5C,IAHA,IAEIC,EAASja,KAAKsE,IAAIyV,EAAM3W,OAAQ,GAC3BxB,EAAI,EAAGA,EAAIqY,EAAQrY,IAC1BoY,EAAO7W,MAAMvB,GAAKmY,EAAM5W,MAAMvB,GAIhC,GAFAoY,EAAO5W,OAAS6W,EAEZF,EAAM3W,QAAU,EAGlB,OAFA2W,EAAM5W,MAAM,GAAK,OACjB4W,EAAM3W,OAAS,GAKjB,IAAI8W,EAAOH,EAAM5W,MAAM,GAGvB,IAFA6W,EAAO7W,MAAM6W,EAAO5W,UAhBT,QAgBqB8W,EAE3BtY,EAAI,GAAIA,EAAImY,EAAM3W,OAAQxB,IAAK,CAClC,IAAIuY,EAAwB,EAAjBJ,EAAM5W,MAAMvB,GACvBmY,EAAM5W,MAAMvB,EAAI,KApBP,QAoBeuY,IAAgB,EAAMD,IAAS,GACvDA,EAAOC,EAETD,KAAU,GACVH,EAAM5W,MAAMvB,EAAI,IAAMsY,EACT,IAATA,GAAcH,EAAM3W,OAAS,GAC/B2W,EAAM3W,QAAU,GAEhB2W,EAAM3W,QAAU,GAIpB0V,EAAKpZ,UAAUka,MAAQ,SAAgBrV,GAErCA,EAAIpB,MAAMoB,EAAInB,QAAU,EACxBmB,EAAIpB,MAAMoB,EAAInB,OAAS,GAAK,EAC5BmB,EAAInB,QAAU,EAId,IADA,IAAIwD,EAAK,EACAhF,EAAI,EAAGA,EAAI2C,EAAInB,OAAQxB,IAAK,CACnC,IAAIwD,EAAmB,EAAfb,EAAIpB,MAAMvB,GAClBgF,GAAU,IAAJxB,EACNb,EAAIpB,MAAMvB,GAAU,SAALgF,EACfA,EAAS,GAAJxB,GAAawB,EAAK,SAAa,GAUtC,OANkC,IAA9BrC,EAAIpB,MAAMoB,EAAInB,OAAS,KACzBmB,EAAInB,SAC8B,IAA9BmB,EAAIpB,MAAMoB,EAAInB,OAAS,IACzBmB,EAAInB,UAGDmB,GASThC,EAASyW,EAAMN,GAQfnW,EAAS0W,EAAMP,GASfnW,EAAS2W,EAAQR,GAEjBQ,EAAOxZ,UAAUka,MAAQ,SAAgBrV,GAGvC,IADA,IAAIsC,EAAQ,EACHjF,EAAI,EAAGA,EAAI2C,EAAInB,OAAQxB,IAAK,CACnC,IAAI4G,EAA0B,IAAL,EAAfjE,EAAIpB,MAAMvB,IAAiBiF,EACjCD,EAAU,SAAL4B,EACTA,KAAQ,GAERjE,EAAIpB,MAAMvB,GAAKgF,EACfC,EAAQ2B,EAKV,OAHc,IAAV3B,IACFtC,EAAIpB,MAAMoB,EAAInB,UAAYyD,GAErBtC,GAIT1B,EAAGuW,OAAS,SAAgBT,GAE1B,GAAIN,EAAOM,GAAO,OAAON,EAAOM,GAEhC,IAAIQ,EACJ,GAAa,SAATR,EACFQ,EAAQ,IAAIL,OACP,GAAa,SAATH,EACTQ,EAAQ,IAAIH,OACP,GAAa,SAATL,EACTQ,EAAQ,IAAIF,MACP,IAAa,WAATN,EAGT,MAAM,IAAIrW,MAAM,iBAAmBqW,GAFnCQ,EAAQ,IAAID,EAMd,OAFAb,EAAOM,GAAQQ,EAERA,GAkBTnC,EAAItX,UAAUqY,SAAW,SAAmB7X,GAC1CiC,EAAsB,IAAfjC,EAAEgD,SAAgB,iCACzBf,EAAOjC,EAAEY,IAAK,oCAGhBkW,EAAItX,UAAUmY,SAAW,SAAmB3X,EAAGyG,GAC7CxE,EAAqC,IAA7BjC,EAAEgD,SAAWyD,EAAEzD,UAAiB,iCACxCf,EAAOjC,EAAEY,KAAOZ,EAAEY,MAAQ6F,EAAE7F,IAC1B,oCAGJkW,EAAItX,UAAU4Z,KAAO,SAAepZ,GAClC,OAAIb,KAAK8Z,MAAc9Z,KAAK8Z,MAAMM,QAAQvZ,GAAGiX,UAAU9X,MAChDa,EAAE4U,KAAKzV,KAAKsS,GAAGwF,UAAU9X,OAGlC2X,EAAItX,UAAUyJ,IAAM,SAAcjJ,GAChC,OAAIA,EAAEkH,SACGlH,EAAE+F,QAGJ5G,KAAKsS,EAAElR,IAAIP,GAAGiX,UAAU9X,OAGjC2X,EAAItX,UAAUgB,IAAM,SAAcR,EAAGyG,GACnCtH,KAAKwY,SAAS3X,EAAGyG,GAEjB,IAAIqB,EAAM9H,EAAEQ,IAAIiG,GAIhB,OAHIqB,EAAI5H,IAAIf,KAAKsS,IAAM,GACrB3J,EAAIsC,KAAKjL,KAAKsS,GAET3J,EAAImP,UAAU9X,OAGvB2X,EAAItX,UAAU2K,KAAO,SAAenK,EAAGyG,GACrCtH,KAAKwY,SAAS3X,EAAGyG,GAEjB,IAAIqB,EAAM9H,EAAEmK,KAAK1D,GAIjB,OAHIqB,EAAI5H,IAAIf,KAAKsS,IAAM,GACrB3J,EAAIsC,KAAKjL,KAAKsS,GAET3J,GAGTgP,EAAItX,UAAUe,IAAM,SAAcP,EAAGyG,GACnCtH,KAAKwY,SAAS3X,EAAGyG,GAEjB,IAAIqB,EAAM9H,EAAEO,IAAIkG,GAIhB,OAHIqB,EAAI/F,KAAK,GAAK,GAChB+F,EAAIqC,KAAKhL,KAAKsS,GAET3J,EAAImP,UAAU9X,OAGvB2X,EAAItX,UAAU4K,KAAO,SAAepK,EAAGyG,GACrCtH,KAAKwY,SAAS3X,EAAGyG,GAEjB,IAAIqB,EAAM9H,EAAEoK,KAAK3D,GAIjB,OAHIqB,EAAI/F,KAAK,GAAK,GAChB+F,EAAIqC,KAAKhL,KAAKsS,GAET3J,GAGTgP,EAAItX,UAAUiY,IAAM,SAAczX,EAAGqE,GAEnC,OADAlF,KAAK0Y,SAAS7X,GACPb,KAAKia,KAAKpZ,EAAE0T,MAAMrP,KAG3ByS,EAAItX,UAAU6O,KAAO,SAAerO,EAAGyG,GAErC,OADAtH,KAAKwY,SAAS3X,EAAGyG,GACVtH,KAAKia,KAAKpZ,EAAEqO,KAAK5H,KAG1BqQ,EAAItX,UAAU2E,IAAM,SAAcnE,EAAGyG,GAEnC,OADAtH,KAAKwY,SAAS3X,EAAGyG,GACVtH,KAAKia,KAAKpZ,EAAEmE,IAAIsC,KAGzBqQ,EAAItX,UAAUoT,KAAO,SAAe5S,GAClC,OAAOb,KAAKkP,KAAKrO,EAAGA,EAAE+F,UAGxB+Q,EAAItX,UAAUmT,IAAM,SAAc3S,GAChC,OAAOb,KAAKgF,IAAInE,EAAGA,IAGrB8W,EAAItX,UAAUwY,KAAO,SAAehY,GAClC,GAAIA,EAAEkH,SAAU,OAAOlH,EAAE+F,QAEzB,IAAImU,EAAO/a,KAAKsS,EAAEzJ,MAAM,GAIxB,GAHA/F,EAAOiY,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAItU,EAAMzG,KAAKsS,EAAEjR,IAAI,IAAImC,EAAG,IAAIsF,OAAO,GACvC,OAAO9I,KAAKyG,IAAI5F,EAAG4F,GAQrB,IAFA,IAAImC,EAAI5I,KAAKsS,EAAEvQ,KAAK,GAChBC,EAAI,GACA4G,EAAEb,UAA2B,IAAfa,EAAEC,MAAM,IAC5B7G,IACA4G,EAAEE,OAAO,GAEXhG,GAAQ8F,EAAEb,UAEV,IAAIiT,EAAM,IAAIxX,EAAG,GAAG5B,MAAM5B,MACtBib,EAAOD,EAAIjC,SAIXmC,EAAOlb,KAAKsS,EAAEvQ,KAAK,GAAG+G,OAAO,GAC7BqS,EAAInb,KAAKsS,EAAE7R,YAGf,IAFA0a,EAAI,IAAI3X,EAAG,EAAI2X,EAAIA,GAAGvZ,MAAM5B,MAEW,IAAhCA,KAAKyG,IAAI0U,EAAGD,GAAMna,IAAIka,IAC3BE,EAAEjD,QAAQ+C,GAOZ,IAJA,IAAIzW,EAAIxE,KAAKyG,IAAI0U,EAAGvS,GAChBhE,EAAI5E,KAAKyG,IAAI5F,EAAG+H,EAAEgM,KAAK,GAAG9L,OAAO,IACjCG,EAAIjJ,KAAKyG,IAAI5F,EAAG+H,GAChB0J,EAAItQ,EACc,IAAfiH,EAAElI,IAAIia,IAAY,CAEvB,IADA,IAAIzB,EAAMtQ,EACD1G,EAAI,EAAoB,IAAjBgX,EAAIxY,IAAIia,GAAYzY,IAClCgX,EAAMA,EAAI/W,SAEZM,EAAOP,EAAI+P,GACX,IAAIhL,EAAItH,KAAKyG,IAAIjC,EAAG,IAAIhB,EAAG,GAAGmQ,OAAOrB,EAAI/P,EAAI,IAE7CqC,EAAIA,EAAE2T,OAAOjR,GACb9C,EAAI8C,EAAE9E,SACNyG,EAAIA,EAAEsP,OAAO/T,GACb8N,EAAI/P,EAGN,OAAOqC,GAGT+S,EAAItX,UAAUyW,KAAO,SAAejW,GAClC,IAAIua,EAAMva,EAAE6V,OAAO1W,KAAKsS,GACxB,OAAqB,IAAjB8I,EAAIvX,UACNuX,EAAIvX,SAAW,EACR7D,KAAKia,KAAKmB,GAAKrC,UAEf/Y,KAAKia,KAAKmB,IAIrBzD,EAAItX,UAAUoG,IAAM,SAAc5F,EAAGqE,GACnC,GAAIA,EAAI6C,SAAU,OAAO,IAAIvE,EAAG,GAAG5B,MAAM5B,MACzC,GAAoB,IAAhBkF,EAAItC,KAAK,GAAU,OAAO/B,EAAE+F,QAEhC,IACIyU,EAAM,IAAIlW,MAAM,IACpBkW,EAAI,GAAK,IAAI7X,EAAG,GAAG5B,MAAM5B,MACzBqb,EAAI,GAAKxa,EACT,IAAK,IAAI0B,EAAI,EAAGA,EAAI8Y,EAAItX,OAAQxB,IAC9B8Y,EAAI9Y,GAAKvC,KAAKgF,IAAIqW,EAAI9Y,EAAI,GAAI1B,GAGhC,IAAI8H,EAAM0S,EAAI,GACVC,EAAU,EACVC,EAAa,EACbta,EAAQiE,EAAIzE,YAAc,GAK9B,IAJc,IAAVQ,IACFA,EAAQ,IAGLsB,EAAI2C,EAAInB,OAAS,EAAGxB,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAI+D,EAAOpB,EAAIpB,MAAMvB,GACZuD,EAAI7E,EAAQ,EAAG6E,GAAK,EAAGA,IAAK,CACnC,IAAIgF,EAAOxE,GAAQR,EAAK,EACpB6C,IAAQ0S,EAAI,KACd1S,EAAM3I,KAAKwT,IAAI7K,IAGL,IAARmC,GAAyB,IAAZwQ,GAKjBA,IAAY,EACZA,GAAWxQ,GA9BE,MA+BbyQ,GACwC,IAANhZ,GAAiB,IAANuD,KAE7C6C,EAAM3I,KAAKgF,IAAI2D,EAAK0S,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,EAajBta,EAAQ,GAGV,OAAO0H,GAGTgP,EAAItX,UAAUwX,UAAY,SAAoB3S,GAC5C,IAAIN,EAAIM,EAAIuQ,KAAKzV,KAAKsS,GAEtB,OAAO1N,IAAMM,EAAMN,EAAEgC,QAAUhC,GAGjC+S,EAAItX,UAAU0X,YAAc,SAAsB7S,GAChD,IAAIyD,EAAMzD,EAAI0B,QAEd,OADA+B,EAAIlH,IAAM,KACHkH,GAOTnF,EAAG9B,KAAO,SAAewD,GACvB,OAAO,IAAI8U,EAAK9U,IAmBlBhC,EAAS8W,EAAMrC,GAEfqC,EAAK3Z,UAAUwX,UAAY,SAAoB3S,GAC7C,OAAOlF,KAAKia,KAAK/U,EAAIqP,MAAMvU,KAAK+U,SAGlCiF,EAAK3Z,UAAU0X,YAAc,SAAsB7S,GACjD,IAAIN,EAAI5E,KAAKia,KAAK/U,EAAIF,IAAIhF,KAAKka,OAE/B,OADAtV,EAAEnD,IAAM,KACDmD,GAGToV,EAAK3Z,UAAU6O,KAAO,SAAerO,EAAGyG,GACtC,GAAIzG,EAAEkH,UAAYT,EAAES,SAGlB,OAFAlH,EAAEiD,MAAM,GAAK,EACbjD,EAAEkD,OAAS,EACJlD,EAGT,IAAIoI,EAAIpI,EAAEqO,KAAK5H,GACX9C,EAAIyE,EAAEyL,MAAM1U,KAAK+U,OAAO/P,IAAIhF,KAAKma,MAAM1F,OAAOzU,KAAK+U,OAAO/P,IAAIhF,KAAKsS,GACnEkJ,EAAIvS,EAAEgC,KAAKzG,GAAGsE,OAAO9I,KAAK+U,OAC1BpM,EAAM6S,EAQV,OANIA,EAAEza,IAAIf,KAAKsS,IAAM,EACnB3J,EAAM6S,EAAEvQ,KAAKjL,KAAKsS,GACTkJ,EAAE5Y,KAAK,GAAK,IACrB+F,EAAM6S,EAAExQ,KAAKhL,KAAKsS,IAGb3J,EAAImP,UAAU9X,OAGvBga,EAAK3Z,UAAU2E,IAAM,SAAcnE,EAAGyG,GACpC,GAAIzG,EAAEkH,UAAYT,EAAES,SAAU,OAAO,IAAIvE,EAAG,GAAGsU,UAAU9X,MAEzD,IAAIiJ,EAAIpI,EAAEmE,IAAIsC,GACV9C,EAAIyE,EAAEyL,MAAM1U,KAAK+U,OAAO/P,IAAIhF,KAAKma,MAAM1F,OAAOzU,KAAK+U,OAAO/P,IAAIhF,KAAKsS,GACnEkJ,EAAIvS,EAAEgC,KAAKzG,GAAGsE,OAAO9I,KAAK+U,OAC1BpM,EAAM6S,EAOV,OANIA,EAAEza,IAAIf,KAAKsS,IAAM,EACnB3J,EAAM6S,EAAEvQ,KAAKjL,KAAKsS,GACTkJ,EAAE5Y,KAAK,GAAK,IACrB+F,EAAM6S,EAAExQ,KAAKhL,KAAKsS,IAGb3J,EAAImP,UAAU9X,OAGvBga,EAAK3Z,UAAUyW,KAAO,SAAejW,GAGnC,OADUb,KAAKia,KAAKpZ,EAAE6V,OAAO1W,KAAKsS,GAAGtN,IAAIhF,KAAK6V,KACnCiC,UAAU9X,OAn3GzB,CAq3GoCE,EAAQF,Q","file":"yarn.miller-rabin.becc34fe6fa559c58c21.js","sourcesContent":["var bn = require('bn.js');\nvar brorand = require('brorand');\n\nfunction MillerRabin(rand) {\n  this.rand = rand || new brorand.Rand();\n}\nmodule.exports = MillerRabin;\n\nMillerRabin.create = function create(rand) {\n  return new MillerRabin(rand);\n};\n\nMillerRabin.prototype._randbelow = function _randbelow(n) {\n  var len = n.bitLength();\n  var min_bytes = Math.ceil(len / 8);\n\n  // Generage random bytes until a number less than n is found.\n  // This ensures that 0..n-1 have an equal probability of being selected.\n  do\n    var a = new bn(this.rand.generate(min_bytes));\n  while (a.cmp(n) >= 0);\n\n  return a;\n};\n\nMillerRabin.prototype._randrange = function _randrange(start, stop) {\n  // Generate a random number greater than or equal to start and less than stop.\n  var size = stop.sub(start);\n  return start.add(this._randbelow(size));\n};\n\nMillerRabin.prototype.test = function test(n, k, cb) {\n  var len = n.bitLength();\n  var red = bn.mont(n);\n  var rone = new bn(1).toRed(red);\n\n  if (!k)\n    k = Math.max(1, (len / 48) | 0);\n\n  // Find d and s, (n - 1) = (2 ^ s) * d;\n  var n1 = n.subn(1);\n  for (var s = 0; !n1.testn(s); s++) {}\n  var d = n.shrn(s);\n\n  var rn1 = n1.toRed(red);\n\n  var prime = true;\n  for (; k > 0; k--) {\n    var a = this._randrange(new bn(2), n1);\n    if (cb)\n      cb(a);\n\n    var x = a.toRed(red).redPow(d);\n    if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)\n      continue;\n\n    for (var i = 1; i < s; i++) {\n      x = x.redSqr();\n\n      if (x.cmp(rone) === 0)\n        return false;\n      if (x.cmp(rn1) === 0)\n        break;\n    }\n\n    if (i === s)\n      return false;\n  }\n\n  return prime;\n};\n\nMillerRabin.prototype.getDivisor = function getDivisor(n, k) {\n  var len = n.bitLength();\n  var red = bn.mont(n);\n  var rone = new bn(1).toRed(red);\n\n  if (!k)\n    k = Math.max(1, (len / 48) | 0);\n\n  // Find d and s, (n - 1) = (2 ^ s) * d;\n  var n1 = n.subn(1);\n  for (var s = 0; !n1.testn(s); s++) {}\n  var d = n.shrn(s);\n\n  var rn1 = n1.toRed(red);\n\n  for (; k > 0; k--) {\n    var a = this._randrange(new bn(2), n1);\n\n    var g = n.gcd(a);\n    if (g.cmpn(1) !== 0)\n      return g;\n\n    var x = a.toRed(red).redPow(d);\n    if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)\n      continue;\n\n    for (var i = 1; i < s; i++) {\n      x = x.redSqr();\n\n      if (x.cmp(rone) === 0)\n        return x.fromRed().subn(1).gcd(n);\n      if (x.cmp(rn1) === 0)\n        break;\n    }\n\n    if (i === s) {\n      x = x.redSqr();\n      return x.fromRed().subn(1).gcd(n);\n    }\n  }\n\n  return false;\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    if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n      Buffer = window.Buffer;\n    } else {\n      Buffer = require('buffer').Buffer;\n    }\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      this.negative = 1;\n    }\n\n    if (start < number.length) {\n      if (base === 16) {\n        this._parseHex(number, start, endian);\n      } else {\n        this._parseBase(number, base, start);\n        if (endian === 'le') {\n          this._initArray(this.toArray(), base, endian);\n        }\n      }\n    }\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 parseHex4Bits (string, index) {\n    var c = string.charCodeAt(index);\n    // 'A' - 'F'\n    if (c >= 65 && c <= 70) {\n      return c - 55;\n    // 'a' - 'f'\n    } else if (c >= 97 && c <= 102) {\n      return c - 87;\n    // '0' - '9'\n    } else {\n      return (c - 48) & 0xf;\n    }\n  }\n\n  function parseHexByte (string, lowerBound, index) {\n    var r = parseHex4Bits(string, index);\n    if (index - 1 >= lowerBound) {\n      r |= parseHex4Bits(string, index - 1) << 4;\n    }\n    return r;\n  }\n\n  BN.prototype._parseHex = function _parseHex (number, start, endian) {\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    // 24-bits chunks\n    var off = 0;\n    var j = 0;\n\n    var w;\n    if (endian === 'be') {\n      for (i = number.length - 1; i >= start; i -= 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    } else {\n      var parseLength = number.length - start;\n      for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    }\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    this.strip();\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"],"sourceRoot":""}