{"version":3,"sources":["webpack:///./node_modules/create-ecdh/browser.js","webpack:///./node_modules/create-ecdh/node_modules/bn.js/lib/bn.js"],"names":["BN","module","exports","curve","ECDH","aliases","secp256k1","name","byteLength","secp224r1","prime256v1","prime192v1","ed25519","secp384r1","secp521r1","this","curveType","elliptic","ec","keys","formatReturnValue","bn","enc","len","Array","isArray","toArray","buf","Buffer","length","zeros","fill","concat","toString","p224","p256","secp256r1","p192","secp192r1","p384","p521","prototype","generateKeys","format","genKeyPair","getPublicKey","computeSecret","other","inenc","isBuffer","keyFromPublic","getPublic","mul","getPrivate","getX","key","getPrivateKey","setPublicKey","pub","_importPublic","setPrivateKey","priv","_priv","_importPrivate","assert","val","msg","Error","inherits","ctor","superCtor","super_","TempCtor","constructor","number","base","endian","isBN","negative","words","red","_init","wordSize","window","e","parseHex4Bits","string","index","c","charCodeAt","parseHexByte","lowerBound","r","parseBase","str","start","end","Math","min","i","num","max","left","right","cmp","_initNumber","_initArray","replace","_parseHex","_parseBase","ceil","j","w","off","strip","limbLen","limbPow","total","mod","word","imuln","_iaddn","pow","copy","dest","clone","_expand","size","_normSign","inspect","groupSizes","groupBases","smallMulTo","self","out","a","b","lo","carry","k","ncarry","rword","maxJ","padding","groupSize","groupBase","isZero","modn","idivn","toNumber","ret","toJSON","toBuffer","toArrayLike","ArrayType","reqLength","littleEndian","res","q","andln","iushrn","clz32","_countBits","t","_zeroBits","bitLength","hi","zeroBits","toTwos","width","abs","inotn","iaddn","fromTwos","testn","notn","ineg","isNeg","neg","iuor","ior","or","uor","iuand","iand","and","uand","iuxor","ixor","xor","uxor","bytesNeeded","bitsLeft","setn","bit","wbit","iadd","isub","add","sub","comb10MulTo","mid","o","a0","al0","ah0","a1","al1","ah1","a2","al2","ah2","a3","al3","ah3","a4","al4","ah4","a5","al5","ah5","a6","al6","ah6","a7","al7","ah7","a8","al8","ah8","a9","al9","ah9","b0","bl0","bh0","b1","bl1","bh1","b2","bl2","bh2","b3","bl3","bh3","b4","bl4","bh4","b5","bl5","bh5","b6","bl6","bh6","b7","bl7","bh7","b8","bl8","bh8","b9","bl9","bh9","w0","imul","w1","w2","w3","w4","w5","w6","w7","w8","w9","w10","w11","w12","w13","w14","w15","w16","w17","w18","jumboMulTo","FFTM","mulp","x","y","mulTo","hncarry","bigMulTo","makeRBT","N","l","revBin","rb","permute","rbt","rws","iws","rtws","itws","transform","s","rtwdf","cos","PI","itwdf","sin","p","rtwdf_","itwdf_","re","ie","ro","io","rx","guessLen13b","n","m","odd","conjugate","normalize13b","ws","round","convert13b","stub","ph","_","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","muln","sqr","isqr","toBitArray","iushln","bits","carryMask","newCarry","ishln","hint","extended","h","mask","maskedWords","ishrn","shln","ushln","shrn","ushrn","imaskn","maskn","isubn","addn","subn","iabs","_ishlnsubmul","shift","_wordDiv","mode","bhi","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","acc","egcd","A","B","C","D","g","isEven","yp","xp","im","isOdd","jm","gcd","_invmp","x1","x2","delta","cmpn","invm","bincn","ucmp","gtn","gt","gten","gte","ltn","lt","lten","lte","eqn","eq","Red","toRed","ctx","convertTo","_forceRed","fromRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","shl","redMul","_verify2","redIMul","redSqr","_verify1","redISqr","redSqrt","sqrt","redInvm","redNeg","redPow","primes","k256","p25519","MPrime","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","mont","u"],"mappings":"+EAAA,kBAAe,EAAQ,KACnBA,EAAK,EAAQ,KAEjBC,EAAOC,QAAU,SAAqBC,GACpC,OAAO,IAAIC,EAAKD,IAGlB,IAAIE,EAAU,CACZC,UAAW,CACTC,KAAM,YACNC,WAAY,IAEdC,UAAW,CACTF,KAAM,OACNC,WAAY,IAEdE,WAAY,CACVH,KAAM,OACNC,WAAY,IAEdG,WAAY,CACVJ,KAAM,OACNC,WAAY,IAEdI,QAAS,CACPL,KAAM,UACNC,WAAY,IAEdK,UAAW,CACTN,KAAM,OACNC,WAAY,IAEdM,UAAW,CACTP,KAAM,OACNC,WAAY,KAUhB,SAASJ,EAAMD,GACbY,KAAKC,UAAYX,EAAQF,GACpBY,KAAKC,YACRD,KAAKC,UAAY,CACfT,KAAMJ,IAGVY,KAAKZ,MAAQ,IAAIc,EAASC,GAAGH,KAAKC,UAAUT,MAC5CQ,KAAKI,UAAO,EAwDd,SAASC,EAAmBC,EAAIC,EAAKC,GAC9BC,MAAMC,QAAQJ,KACjBA,EAAKA,EAAGK,WAEV,IAAIC,EAAM,IAAIC,EAAOP,GACrB,GAAIE,GAAOI,EAAIE,OAASN,EAAK,CAC3B,IAAIO,EAAQ,IAAIF,EAAOL,EAAMI,EAAIE,QACjCC,EAAMC,KAAK,GACXJ,EAAMC,EAAOI,OAAO,CAACF,EAAOH,IAE9B,OAAKL,EAGIK,EAAIM,SAASX,GAFbK,EAjFXtB,EAAQ6B,KAAO7B,EAAQI,UACvBJ,EAAQ8B,KAAO9B,EAAQ+B,UAAY/B,EAAQK,WAC3CL,EAAQgC,KAAOhC,EAAQiC,UAAYjC,EAAQM,WAC3CN,EAAQkC,KAAOlC,EAAQQ,UACvBR,EAAQmC,KAAOnC,EAAQS,UAavBV,EAAKqC,UAAUC,aAAe,SAAUpB,EAAKqB,GAE3C,OADA5B,KAAKI,KAAOJ,KAAKZ,MAAMyC,aAChB7B,KAAK8B,aAAavB,EAAKqB,IAGhCvC,EAAKqC,UAAUK,cAAgB,SAAUC,EAAOC,EAAO1B,GAOrD,OANA0B,EAAQA,GAAS,OACZpB,EAAOqB,SAASF,KACnBA,EAAQ,IAAInB,EAAOmB,EAAOC,IAIrB5B,EAFQL,KAAKZ,MAAM+C,cAAcH,GAAOI,YAC5BC,IAAIrC,KAAKI,KAAKkC,cAAcC,OACjBhC,EAAKP,KAAKC,UAAUR,aAGpDJ,EAAKqC,UAAUI,aAAe,SAAUvB,EAAKqB,GAC3C,IAAIY,EAAMxC,KAAKI,KAAKgC,UAAqB,eAAXR,GAAyB,GAQvD,MAPe,WAAXA,IACEY,EAAIA,EAAI1B,OAAS,GAAK,EACxB0B,EAAI,GAAK,EAETA,EAAI,GAAK,GAGNnC,EAAkBmC,EAAKjC,IAGhClB,EAAKqC,UAAUe,cAAgB,SAAUlC,GACvC,OAAOF,EAAkBL,KAAKI,KAAKkC,aAAc/B,IAGnDlB,EAAKqC,UAAUgB,aAAe,SAAUC,EAAKpC,GAM3C,OALAA,EAAMA,GAAO,OACRM,EAAOqB,SAASS,KACnBA,EAAM,IAAI9B,EAAO8B,EAAKpC,IAExBP,KAAKI,KAAKwC,cAAcD,GACjB3C,MAGTX,EAAKqC,UAAUmB,cAAgB,SAAUC,EAAMvC,GAC7CA,EAAMA,GAAO,OACRM,EAAOqB,SAASY,KACnBA,EAAO,IAAIjC,EAAOiC,EAAMvC,IAG1B,IAAIwC,EAAQ,IAAI9D,EAAG6D,GAInB,OAHAC,EAAQA,EAAM7B,SAAS,IACvBlB,KAAKI,KAAOJ,KAAKZ,MAAMyC,aACvB7B,KAAKI,KAAK4C,eAAeD,GAClB/C,Q,8CCzGT,2BACE,aAGA,SAASiD,EAAQC,EAAKC,GACpB,IAAKD,EAAK,MAAM,IAAIE,MAAMD,GAAO,oBAKnC,SAASE,EAAUC,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAAS/B,UAAY6B,EAAU7B,UAC/B4B,EAAK5B,UAAY,IAAI+B,EACrBH,EAAK5B,UAAUgC,YAAcJ,EAK/B,SAASrE,EAAI0E,EAAQC,EAAMC,GACzB,GAAI5E,EAAG6E,KAAKH,GACV,OAAOA,EAGT3D,KAAK+D,SAAW,EAChB/D,KAAKgE,MAAQ,KACbhE,KAAKc,OAAS,EAGdd,KAAKiE,IAAM,KAEI,OAAXN,IACW,OAATC,GAA0B,OAATA,IACnBC,EAASD,EACTA,EAAO,IAGT5D,KAAKkE,MAAMP,GAAU,EAAGC,GAAQ,GAAIC,GAAU,OAYlD,IAAIhD,EATkB,iBAAX3B,EACTA,EAAOC,QAAUF,EAEjBE,EAAQF,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGkF,SAAW,GAGd,IAEItD,EADoB,oBAAXuD,aAAmD,IAAlBA,OAAOvD,OACxCuD,OAAOvD,OAEP,EAAQ,KAAUA,OAE7B,MAAOwD,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,EAAKC,EAAOC,EAAK5C,GAGnC,IAFA,IAAIwC,EAAI,EACJrE,EAAM0E,KAAKC,IAAIJ,EAAIjE,OAAQmE,GACtBG,EAAIJ,EAAOI,EAAI5E,EAAK4E,IAAK,CAChC,IAAIX,EAAIM,EAAIL,WAAWU,GAAK,GAE5BP,GAAKxC,EAIHwC,GADEJ,GAAK,GACFA,EAAI,GAAK,GAGLA,GAAK,GACTA,EAAI,GAAK,GAITA,EAGT,OAAOI,EAnNT5F,EAAG6E,KAAO,SAAeuB,GACvB,OAAIA,aAAepG,GAIJ,OAARoG,GAA+B,iBAARA,GAC5BA,EAAI3B,YAAYS,WAAalF,EAAGkF,UAAY1D,MAAMC,QAAQ2E,EAAIrB,QAGlE/E,EAAGqG,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTvG,EAAGkG,IAAM,SAAcI,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTvG,EAAGyC,UAAUwC,MAAQ,SAAeP,EAAQC,EAAMC,GAChD,GAAsB,iBAAXF,EACT,OAAO3D,KAAK0F,YAAY/B,EAAQC,EAAMC,GAGxC,GAAsB,iBAAXF,EACT,OAAO3D,KAAK2F,WAAWhC,EAAQC,EAAMC,GAG1B,QAATD,IACFA,EAAO,IAETX,EAAOW,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAIoB,EAAQ,EACM,OAFlBrB,EAASA,EAAOzC,WAAW0E,QAAQ,OAAQ,KAEhC,KACTZ,IACAhF,KAAK+D,SAAW,GAGdiB,EAAQrB,EAAO7C,SACJ,KAAT8C,EACF5D,KAAK6F,UAAUlC,EAAQqB,EAAOnB,IAE9B7D,KAAK8F,WAAWnC,EAAQC,EAAMoB,GACf,OAAXnB,GACF7D,KAAK2F,WAAW3F,KAAKW,UAAWiD,EAAMC,MAM9C5E,EAAGyC,UAAUgE,YAAc,SAAsB/B,EAAQC,EAAMC,GACzDF,EAAS,IACX3D,KAAK+D,SAAW,EAChBJ,GAAUA,GAERA,EAAS,UACX3D,KAAKgE,MAAQ,CAAW,SAATL,GACf3D,KAAKc,OAAS,GACL6C,EAAS,kBAClB3D,KAAKgE,MAAQ,CACF,SAATL,EACCA,EAAS,SAAa,UAEzB3D,KAAKc,OAAS,IAEdmC,EAAOU,EAAS,kBAChB3D,KAAKgE,MAAQ,CACF,SAATL,EACCA,EAAS,SAAa,SACvB,GAEF3D,KAAKc,OAAS,GAGD,OAAX+C,GAGJ7D,KAAK2F,WAAW3F,KAAKW,UAAWiD,EAAMC,IAGxC5E,EAAGyC,UAAUiE,WAAa,SAAqBhC,EAAQC,EAAMC,GAG3D,GADAZ,EAAgC,iBAAlBU,EAAO7C,QACjB6C,EAAO7C,QAAU,EAGnB,OAFAd,KAAKgE,MAAQ,CAAE,GACfhE,KAAKc,OAAS,EACPd,KAGTA,KAAKc,OAASoE,KAAKa,KAAKpC,EAAO7C,OAAS,GACxCd,KAAKgE,MAAQ,IAAIvD,MAAMT,KAAKc,QAC5B,IAAK,IAAIsE,EAAI,EAAGA,EAAIpF,KAAKc,OAAQsE,IAC/BpF,KAAKgE,MAAMoB,GAAK,EAGlB,IAAIY,EAAGC,EACHC,EAAM,EACV,GAAe,OAAXrC,EACF,IAAKuB,EAAIzB,EAAO7C,OAAS,EAAGkF,EAAI,EAAGZ,GAAK,EAAGA,GAAK,EAC9Ca,EAAItC,EAAOyB,GAAMzB,EAAOyB,EAAI,IAAM,EAAMzB,EAAOyB,EAAI,IAAM,GACzDpF,KAAKgE,MAAMgC,IAAOC,GAAKC,EAAO,SAC9BlG,KAAKgE,MAAMgC,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,UAGC,GAAe,OAAXnC,EACT,IAAKuB,EAAI,EAAGY,EAAI,EAAGZ,EAAIzB,EAAO7C,OAAQsE,GAAK,EACzCa,EAAItC,EAAOyB,GAAMzB,EAAOyB,EAAI,IAAM,EAAMzB,EAAOyB,EAAI,IAAM,GACzDpF,KAAKgE,MAAMgC,IAAOC,GAAKC,EAAO,SAC9BlG,KAAKgE,MAAMgC,EAAI,GAAMC,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPF,KAIN,OAAOhG,KAAKmG,SAyBdlH,EAAGyC,UAAUmE,UAAY,SAAoBlC,EAAQqB,EAAOnB,GAE1D7D,KAAKc,OAASoE,KAAKa,MAAMpC,EAAO7C,OAASkE,GAAS,GAClDhF,KAAKgE,MAAQ,IAAIvD,MAAMT,KAAKc,QAC5B,IAAK,IAAIsE,EAAI,EAAGA,EAAIpF,KAAKc,OAAQsE,IAC/BpF,KAAKgE,MAAMoB,GAAK,EAIlB,IAGIa,EAHAC,EAAM,EACNF,EAAI,EAGR,GAAe,OAAXnC,EACF,IAAKuB,EAAIzB,EAAO7C,OAAS,EAAGsE,GAAKJ,EAAOI,GAAK,EAC3Ca,EAAItB,EAAahB,EAAQqB,EAAOI,IAAMc,EACtClG,KAAKgE,MAAMgC,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACLhG,KAAKgE,MAAMgC,IAAMC,IAAM,IAEvBC,GAAO,OAKX,IAAKd,GADazB,EAAO7C,OAASkE,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAOI,EAAIzB,EAAO7C,OAAQsE,GAAK,EAC1Ea,EAAItB,EAAahB,EAAQqB,EAAOI,IAAMc,EACtClG,KAAKgE,MAAMgC,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACLhG,KAAKgE,MAAMgC,IAAMC,IAAM,IAEvBC,GAAO,EAKblG,KAAKmG,SA2BPlH,EAAGyC,UAAUoE,WAAa,SAAqBnC,EAAQC,EAAMoB,GAE3DhF,KAAKgE,MAAQ,CAAE,GACfhE,KAAKc,OAAS,EAGd,IAAK,IAAIsF,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWzC,EAClEwC,IAEFA,IACAC,EAAWA,EAAUzC,EAAQ,EAO7B,IALA,IAAI0C,EAAQ3C,EAAO7C,OAASkE,EACxBuB,EAAMD,EAAQF,EACdnB,EAAMC,KAAKC,IAAImB,EAAOA,EAAQC,GAAOvB,EAErCwB,EAAO,EACFpB,EAAIJ,EAAOI,EAAIH,EAAKG,GAAKgB,EAChCI,EAAO1B,EAAUnB,EAAQyB,EAAGA,EAAIgB,EAASxC,GAEzC5D,KAAKyG,MAAMJ,GACPrG,KAAKgE,MAAM,GAAKwC,EAAO,SACzBxG,KAAKgE,MAAM,IAAMwC,EAEjBxG,KAAK0G,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAO1B,EAAUnB,EAAQyB,EAAGzB,EAAO7C,OAAQ8C,GAEtCwB,EAAI,EAAGA,EAAImB,EAAKnB,IACnBuB,GAAO/C,EAGT5D,KAAKyG,MAAME,GACP3G,KAAKgE,MAAM,GAAKwC,EAAO,SACzBxG,KAAKgE,MAAM,IAAMwC,EAEjBxG,KAAK0G,OAAOF,GAIhBxG,KAAKmG,SAGPlH,EAAGyC,UAAUkF,KAAO,SAAeC,GACjCA,EAAK7C,MAAQ,IAAIvD,MAAMT,KAAKc,QAC5B,IAAK,IAAIsE,EAAI,EAAGA,EAAIpF,KAAKc,OAAQsE,IAC/ByB,EAAK7C,MAAMoB,GAAKpF,KAAKgE,MAAMoB,GAE7ByB,EAAK/F,OAASd,KAAKc,OACnB+F,EAAK9C,SAAW/D,KAAK+D,SACrB8C,EAAK5C,IAAMjE,KAAKiE,KAGlBhF,EAAGyC,UAAUoF,MAAQ,WACnB,IAAIjC,EAAI,IAAI5F,EAAG,MAEf,OADAe,KAAK4G,KAAK/B,GACHA,GAGT5F,EAAGyC,UAAUqF,QAAU,SAAkBC,GACvC,KAAOhH,KAAKc,OAASkG,GACnBhH,KAAKgE,MAAMhE,KAAKc,UAAY,EAE9B,OAAOd,MAITf,EAAGyC,UAAUyE,MAAQ,WACnB,KAAOnG,KAAKc,OAAS,GAAqC,IAAhCd,KAAKgE,MAAMhE,KAAKc,OAAS,IACjDd,KAAKc,SAEP,OAAOd,KAAKiH,aAGdhI,EAAGyC,UAAUuF,UAAY,WAKvB,OAHoB,IAAhBjH,KAAKc,QAAkC,IAAlBd,KAAKgE,MAAM,KAClChE,KAAK+D,SAAW,GAEX/D,MAGTf,EAAGyC,UAAUwF,QAAU,WACrB,OAAQlH,KAAKiE,IAAM,UAAY,SAAWjE,KAAKkB,SAAS,IAAM,KAiChE,IAAIH,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,6BAGEoG,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,EAAMjC,EAAKkC,GAC9BA,EAAIxD,SAAWsB,EAAItB,SAAWuD,EAAKvD,SACnC,IAAIvD,EAAO8G,EAAKxG,OAASuE,EAAIvE,OAAU,EACvCyG,EAAIzG,OAASN,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIgH,EAAoB,EAAhBF,EAAKtD,MAAM,GACfyD,EAAmB,EAAfpC,EAAIrB,MAAM,GACda,EAAI2C,EAAIC,EAERC,EAAS,SAAJ7C,EACL8C,EAAS9C,EAAI,SAAa,EAC9B0C,EAAIvD,MAAM,GAAK0D,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAIpH,EAAKoH,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAO7C,KAAKC,IAAIyC,EAAGvC,EAAIvE,OAAS,GAC3BkF,EAAId,KAAKI,IAAI,EAAGsC,EAAIN,EAAKxG,OAAS,GAAIkF,GAAK+B,EAAM/B,IAAK,CAC7D,IAAIZ,EAAKwC,EAAI5B,EAAK,EAIlB6B,IADAhD,GAFA2C,EAAoB,EAAhBF,EAAKtD,MAAMoB,KACfqC,EAAmB,EAAfpC,EAAIrB,MAAMgC,IACF8B,GACG,SAAa,EAC5BA,EAAY,SAAJjD,EAEV0C,EAAIvD,MAAM4D,GAAa,EAARE,EACfH,EAAiB,EAATE,EAQV,OANc,IAAVF,EACFJ,EAAIvD,MAAM4D,GAAa,EAARD,EAEfJ,EAAIzG,SAGCyG,EAAIpB,QAzlBblH,EAAGyC,UAAUR,SAAW,SAAmB0C,EAAMoE,GAI/C,IAAIT,EACJ,GAHAS,EAAoB,EAAVA,GAAe,EAGZ,MAJbpE,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjC2D,EAAM,GAGN,IAFA,IAAIrB,EAAM,EACNyB,EAAQ,EACHvC,EAAI,EAAGA,EAAIpF,KAAKc,OAAQsE,IAAK,CACpC,IAAIa,EAAIjG,KAAKgE,MAAMoB,GACfoB,GAA+B,UAArBP,GAAKC,EAAOyB,IAAmBzG,SAAS,IAGpDqG,EADY,KADdI,EAAS1B,IAAO,GAAKC,EAAQ,WACVd,IAAMpF,KAAKc,OAAS,EAC/BC,EAAM,EAAIyF,EAAK1F,QAAU0F,EAAOe,EAEhCf,EAAOe,GAEfrB,GAAO,IACI,KACTA,GAAO,GACPd,KAMJ,IAHc,IAAVuC,IACFJ,EAAMI,EAAMzG,SAAS,IAAMqG,GAEtBA,EAAIzG,OAASkH,GAAY,GAC9BT,EAAM,IAAMA,EAKd,OAHsB,IAAlBvH,KAAK+D,WACPwD,EAAM,IAAMA,GAEPA,EAGT,GAAI3D,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAIqE,EAAYd,EAAWvD,GAEvBsE,EAAYd,EAAWxD,GAC3B2D,EAAM,GACN,IAAI9C,EAAIzE,KAAK8G,QAEb,IADArC,EAAEV,SAAW,GACLU,EAAE0D,UAAU,CAClB,IAAItD,EAAIJ,EAAE2D,KAAKF,GAAWhH,SAAS0C,GAMjC2D,GALF9C,EAAIA,EAAE4D,MAAMH,IAELC,SAGCtD,EAAI0C,EAFJxG,EAAMkH,EAAYpD,EAAE/D,QAAU+D,EAAI0C,EAQ5C,IAHIvH,KAAKmI,WACPZ,EAAM,IAAMA,GAEPA,EAAIzG,OAASkH,GAAY,GAC9BT,EAAM,IAAMA,EAKd,OAHsB,IAAlBvH,KAAK+D,WACPwD,EAAM,IAAMA,GAEPA,EAGTtE,GAAO,EAAO,oCAGhBhE,EAAGyC,UAAU4G,SAAW,WACtB,IAAIC,EAAMvI,KAAKgE,MAAM,GASrB,OARoB,IAAhBhE,KAAKc,OACPyH,GAAuB,SAAhBvI,KAAKgE,MAAM,GACO,IAAhBhE,KAAKc,QAAkC,IAAlBd,KAAKgE,MAAM,GAEzCuE,GAAO,iBAAoC,SAAhBvI,KAAKgE,MAAM,GAC7BhE,KAAKc,OAAS,GACvBmC,GAAO,EAAO,8CAEU,IAAlBjD,KAAK+D,UAAmBwE,EAAMA,GAGxCtJ,EAAGyC,UAAU8G,OAAS,WACpB,OAAOxI,KAAKkB,SAAS,KAGvBjC,EAAGyC,UAAU+G,SAAW,SAAmB5E,EAAQ/C,GAEjD,OADAmC,OAAyB,IAAXpC,GACPb,KAAK0I,YAAY7H,EAAQgD,EAAQ/C,IAG1C7B,EAAGyC,UAAUf,QAAU,SAAkBkD,EAAQ/C,GAC/C,OAAOd,KAAK0I,YAAYjI,MAAOoD,EAAQ/C,IAGzC7B,EAAGyC,UAAUgH,YAAc,SAAsBC,EAAW9E,EAAQ/C,GAClE,IAAIrB,EAAaO,KAAKP,aAClBmJ,EAAY9H,GAAUoE,KAAKI,IAAI,EAAG7F,GACtCwD,EAAOxD,GAAcmJ,EAAW,yCAChC3F,EAAO2F,EAAY,EAAG,+BAEtB5I,KAAKmG,QACL,IAGIsB,EAAGrC,EAHHyD,EAA0B,OAAXhF,EACfiF,EAAM,IAAIH,EAAUC,GAGpBG,EAAI/I,KAAK8G,QACb,GAAK+B,EAYE,CACL,IAAKzD,EAAI,GAAI2D,EAAEZ,SAAU/C,IACvBqC,EAAIsB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETH,EAAI1D,GAAKqC,EAGX,KAAOrC,EAAIwD,EAAWxD,IACpB0D,EAAI1D,GAAK,MArBM,CAEjB,IAAKA,EAAI,EAAGA,EAAIwD,EAAYnJ,EAAY2F,IACtC0D,EAAI1D,GAAK,EAGX,IAAKA,EAAI,GAAI2D,EAAEZ,SAAU/C,IACvBqC,EAAIsB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETH,EAAIF,EAAYxD,EAAI,GAAKqC,EAe7B,OAAOqB,GAGL5D,KAAKgE,MACPjK,EAAGyC,UAAUyH,WAAa,SAAqBlD,GAC7C,OAAO,GAAKf,KAAKgE,MAAMjD,IAGzBhH,EAAGyC,UAAUyH,WAAa,SAAqBlD,GAC7C,IAAImD,EAAInD,EACJpB,EAAI,EAiBR,OAhBIuE,GAAK,OACPvE,GAAK,GACLuE,KAAO,IAELA,GAAK,KACPvE,GAAK,EACLuE,KAAO,GAELA,GAAK,IACPvE,GAAK,EACLuE,KAAO,GAELA,GAAK,IACPvE,GAAK,EACLuE,KAAO,GAEFvE,EAAIuE,GAIfnK,EAAGyC,UAAU2H,UAAY,SAAoBpD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAImD,EAAInD,EACJpB,EAAI,EAoBR,OAnBqB,IAAZ,KAAJuE,KACHvE,GAAK,GACLuE,KAAO,IAEU,IAAV,IAAJA,KACHvE,GAAK,EACLuE,KAAO,GAES,IAAT,GAAJA,KACHvE,GAAK,EACLuE,KAAO,GAES,IAAT,EAAJA,KACHvE,GAAK,EACLuE,KAAO,GAES,IAAT,EAAJA,IACHvE,IAEKA,GAIT5F,EAAGyC,UAAU4H,UAAY,WACvB,IAAIrD,EAAIjG,KAAKgE,MAAMhE,KAAKc,OAAS,GAC7ByI,EAAKvJ,KAAKmJ,WAAWlD,GACzB,OAA2B,IAAnBjG,KAAKc,OAAS,GAAUyI,GAiBlCtK,EAAGyC,UAAU8H,SAAW,WACtB,GAAIxJ,KAAKmI,SAAU,OAAO,EAG1B,IADA,IAAItD,EAAI,EACCO,EAAI,EAAGA,EAAIpF,KAAKc,OAAQsE,IAAK,CACpC,IAAIqC,EAAIzH,KAAKqJ,UAAUrJ,KAAKgE,MAAMoB,IAElC,GADAP,GAAK4C,EACK,KAANA,EAAU,MAEhB,OAAO5C,GAGT5F,EAAGyC,UAAUjC,WAAa,WACxB,OAAOyF,KAAKa,KAAK/F,KAAKsJ,YAAc,IAGtCrK,EAAGyC,UAAU+H,OAAS,SAAiBC,GACrC,OAAsB,IAAlB1J,KAAK+D,SACA/D,KAAK2J,MAAMC,MAAMF,GAAOG,MAAM,GAEhC7J,KAAK8G,SAGd7H,EAAGyC,UAAUoI,SAAW,SAAmBJ,GACzC,OAAI1J,KAAK+J,MAAML,EAAQ,GACd1J,KAAKgK,KAAKN,GAAOG,MAAM,GAAGI,OAE5BjK,KAAK8G,SAGd7H,EAAGyC,UAAUwI,MAAQ,WACnB,OAAyB,IAAlBlK,KAAK+D,UAId9E,EAAGyC,UAAUyI,IAAM,WACjB,OAAOnK,KAAK8G,QAAQmD,QAGtBhL,EAAGyC,UAAUuI,KAAO,WAKlB,OAJKjK,KAAKmI,WACRnI,KAAK+D,UAAY,GAGZ/D,MAITf,EAAGyC,UAAU0I,KAAO,SAAe/E,GACjC,KAAOrF,KAAKc,OAASuE,EAAIvE,QACvBd,KAAKgE,MAAMhE,KAAKc,UAAY,EAG9B,IAAK,IAAIsE,EAAI,EAAGA,EAAIC,EAAIvE,OAAQsE,IAC9BpF,KAAKgE,MAAMoB,GAAKpF,KAAKgE,MAAMoB,GAAKC,EAAIrB,MAAMoB,GAG5C,OAAOpF,KAAKmG,SAGdlH,EAAGyC,UAAU2I,IAAM,SAAchF,GAE/B,OADApC,EAA0C,IAAlCjD,KAAK+D,SAAWsB,EAAItB,WACrB/D,KAAKoK,KAAK/E,IAInBpG,EAAGyC,UAAU4I,GAAK,SAAajF,GAC7B,OAAIrF,KAAKc,OAASuE,EAAIvE,OAAed,KAAK8G,QAAQuD,IAAIhF,GAC/CA,EAAIyB,QAAQuD,IAAIrK,OAGzBf,EAAGyC,UAAU6I,IAAM,SAAclF,GAC/B,OAAIrF,KAAKc,OAASuE,EAAIvE,OAAed,KAAK8G,QAAQsD,KAAK/E,GAChDA,EAAIyB,QAAQsD,KAAKpK,OAI1Bf,EAAGyC,UAAU8I,MAAQ,SAAgBnF,GAEnC,IAAIoC,EAEFA,EADEzH,KAAKc,OAASuE,EAAIvE,OAChBuE,EAEArF,KAGN,IAAK,IAAIoF,EAAI,EAAGA,EAAIqC,EAAE3G,OAAQsE,IAC5BpF,KAAKgE,MAAMoB,GAAKpF,KAAKgE,MAAMoB,GAAKC,EAAIrB,MAAMoB,GAK5C,OAFApF,KAAKc,OAAS2G,EAAE3G,OAETd,KAAKmG,SAGdlH,EAAGyC,UAAU+I,KAAO,SAAepF,GAEjC,OADApC,EAA0C,IAAlCjD,KAAK+D,SAAWsB,EAAItB,WACrB/D,KAAKwK,MAAMnF,IAIpBpG,EAAGyC,UAAUgJ,IAAM,SAAcrF,GAC/B,OAAIrF,KAAKc,OAASuE,EAAIvE,OAAed,KAAK8G,QAAQ2D,KAAKpF,GAChDA,EAAIyB,QAAQ2D,KAAKzK,OAG1Bf,EAAGyC,UAAUiJ,KAAO,SAAetF,GACjC,OAAIrF,KAAKc,OAASuE,EAAIvE,OAAed,KAAK8G,QAAQ0D,MAAMnF,GACjDA,EAAIyB,QAAQ0D,MAAMxK,OAI3Bf,EAAGyC,UAAUkJ,MAAQ,SAAgBvF,GAEnC,IAAImC,EACAC,EACAzH,KAAKc,OAASuE,EAAIvE,QACpB0G,EAAIxH,KACJyH,EAAIpC,IAEJmC,EAAInC,EACJoC,EAAIzH,MAGN,IAAK,IAAIoF,EAAI,EAAGA,EAAIqC,EAAE3G,OAAQsE,IAC5BpF,KAAKgE,MAAMoB,GAAKoC,EAAExD,MAAMoB,GAAKqC,EAAEzD,MAAMoB,GAGvC,GAAIpF,OAASwH,EACX,KAAOpC,EAAIoC,EAAE1G,OAAQsE,IACnBpF,KAAKgE,MAAMoB,GAAKoC,EAAExD,MAAMoB,GAM5B,OAFApF,KAAKc,OAAS0G,EAAE1G,OAETd,KAAKmG,SAGdlH,EAAGyC,UAAUmJ,KAAO,SAAexF,GAEjC,OADApC,EAA0C,IAAlCjD,KAAK+D,SAAWsB,EAAItB,WACrB/D,KAAK4K,MAAMvF,IAIpBpG,EAAGyC,UAAUoJ,IAAM,SAAczF,GAC/B,OAAIrF,KAAKc,OAASuE,EAAIvE,OAAed,KAAK8G,QAAQ+D,KAAKxF,GAChDA,EAAIyB,QAAQ+D,KAAK7K,OAG1Bf,EAAGyC,UAAUqJ,KAAO,SAAe1F,GACjC,OAAIrF,KAAKc,OAASuE,EAAIvE,OAAed,KAAK8G,QAAQ8D,MAAMvF,GACjDA,EAAIyB,QAAQ8D,MAAM5K,OAI3Bf,EAAGyC,UAAUkI,MAAQ,SAAgBF,GACnCzG,EAAwB,iBAAVyG,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxB9F,KAAKa,KAAK2D,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvB1J,KAAK+G,QAAQiE,GAETC,EAAW,GACbD,IAIF,IAAK,IAAI5F,EAAI,EAAGA,EAAI4F,EAAa5F,IAC/BpF,KAAKgE,MAAMoB,GAAsB,UAAhBpF,KAAKgE,MAAMoB,GAS9B,OALI6F,EAAW,IACbjL,KAAKgE,MAAMoB,IAAMpF,KAAKgE,MAAMoB,GAAM,UAAc,GAAK6F,GAIhDjL,KAAKmG,SAGdlH,EAAGyC,UAAUsI,KAAO,SAAeN,GACjC,OAAO1J,KAAK8G,QAAQ8C,MAAMF,IAI5BzK,EAAGyC,UAAUwJ,KAAO,SAAeC,EAAKjI,GACtCD,EAAsB,iBAARkI,GAAoBA,GAAO,GAEzC,IAAIjF,EAAOiF,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARAnL,KAAK+G,QAAQb,EAAM,GAGjBlG,KAAKgE,MAAMkC,GADThD,EACgBlD,KAAKgE,MAAMkC,GAAQ,GAAKkF,EAExBpL,KAAKgE,MAAMkC,KAAS,GAAKkF,GAGtCpL,KAAKmG,SAIdlH,EAAGyC,UAAU2J,KAAO,SAAehG,GACjC,IAAIR,EAkBA2C,EAAGC,EAfP,GAAsB,IAAlBzH,KAAK+D,UAAmC,IAAjBsB,EAAItB,SAI7B,OAHA/D,KAAK+D,SAAW,EAChBc,EAAI7E,KAAKsL,KAAKjG,GACdrF,KAAK+D,UAAY,EACV/D,KAAKiH,YAGP,GAAsB,IAAlBjH,KAAK+D,UAAmC,IAAjBsB,EAAItB,SAIpC,OAHAsB,EAAItB,SAAW,EACfc,EAAI7E,KAAKsL,KAAKjG,GACdA,EAAItB,SAAW,EACRc,EAAEoC,YAKPjH,KAAKc,OAASuE,EAAIvE,QACpB0G,EAAIxH,KACJyH,EAAIpC,IAEJmC,EAAInC,EACJoC,EAAIzH,MAIN,IADA,IAAI2H,EAAQ,EACHvC,EAAI,EAAGA,EAAIqC,EAAE3G,OAAQsE,IAC5BP,GAAkB,EAAb2C,EAAExD,MAAMoB,KAAwB,EAAbqC,EAAEzD,MAAMoB,IAAUuC,EAC1C3H,KAAKgE,MAAMoB,GAAS,SAAJP,EAChB8C,EAAQ9C,IAAM,GAEhB,KAAiB,IAAV8C,GAAevC,EAAIoC,EAAE1G,OAAQsE,IAClCP,GAAkB,EAAb2C,EAAExD,MAAMoB,IAAUuC,EACvB3H,KAAKgE,MAAMoB,GAAS,SAAJP,EAChB8C,EAAQ9C,IAAM,GAIhB,GADA7E,KAAKc,OAAS0G,EAAE1G,OACF,IAAV6G,EACF3H,KAAKgE,MAAMhE,KAAKc,QAAU6G,EAC1B3H,KAAKc,cAEA,GAAI0G,IAAMxH,KACf,KAAOoF,EAAIoC,EAAE1G,OAAQsE,IACnBpF,KAAKgE,MAAMoB,GAAKoC,EAAExD,MAAMoB,GAI5B,OAAOpF,MAITf,EAAGyC,UAAU6J,IAAM,SAAclG,GAC/B,IAAIyD,EACJ,OAAqB,IAAjBzD,EAAItB,UAAoC,IAAlB/D,KAAK+D,UAC7BsB,EAAItB,SAAW,EACf+E,EAAM9I,KAAKwL,IAAInG,GACfA,EAAItB,UAAY,EACT+E,GACmB,IAAjBzD,EAAItB,UAAoC,IAAlB/D,KAAK+D,UACpC/D,KAAK+D,SAAW,EAChB+E,EAAMzD,EAAImG,IAAIxL,MACdA,KAAK+D,SAAW,EACT+E,GAGL9I,KAAKc,OAASuE,EAAIvE,OAAed,KAAK8G,QAAQuE,KAAKhG,GAEhDA,EAAIyB,QAAQuE,KAAKrL,OAI1Bf,EAAGyC,UAAU4J,KAAO,SAAejG,GAEjC,GAAqB,IAAjBA,EAAItB,SAAgB,CACtBsB,EAAItB,SAAW,EACf,IAAIc,EAAI7E,KAAKqL,KAAKhG,GAElB,OADAA,EAAItB,SAAW,EACRc,EAAEoC,YAGJ,GAAsB,IAAlBjH,KAAK+D,SAId,OAHA/D,KAAK+D,SAAW,EAChB/D,KAAKqL,KAAKhG,GACVrF,KAAK+D,SAAW,EACT/D,KAAKiH,YAId,IAWIO,EAAGC,EAXHhC,EAAMzF,KAAKyF,IAAIJ,GAGnB,GAAY,IAARI,EAIF,OAHAzF,KAAK+D,SAAW,EAChB/D,KAAKc,OAAS,EACdd,KAAKgE,MAAM,GAAK,EACThE,KAKLyF,EAAM,GACR+B,EAAIxH,KACJyH,EAAIpC,IAEJmC,EAAInC,EACJoC,EAAIzH,MAIN,IADA,IAAI2H,EAAQ,EACHvC,EAAI,EAAGA,EAAIqC,EAAE3G,OAAQsE,IAE5BuC,GADA9C,GAAkB,EAAb2C,EAAExD,MAAMoB,KAAwB,EAAbqC,EAAEzD,MAAMoB,IAAUuC,IAC7B,GACb3H,KAAKgE,MAAMoB,GAAS,SAAJP,EAElB,KAAiB,IAAV8C,GAAevC,EAAIoC,EAAE1G,OAAQsE,IAElCuC,GADA9C,GAAkB,EAAb2C,EAAExD,MAAMoB,IAAUuC,IACV,GACb3H,KAAKgE,MAAMoB,GAAS,SAAJP,EAIlB,GAAc,IAAV8C,GAAevC,EAAIoC,EAAE1G,QAAU0G,IAAMxH,KACvC,KAAOoF,EAAIoC,EAAE1G,OAAQsE,IACnBpF,KAAKgE,MAAMoB,GAAKoC,EAAExD,MAAMoB,GAU5B,OANApF,KAAKc,OAASoE,KAAKI,IAAItF,KAAKc,OAAQsE,GAEhCoC,IAAMxH,OACRA,KAAK+D,SAAW,GAGX/D,KAAKmG,SAIdlH,EAAGyC,UAAU8J,IAAM,SAAcnG,GAC/B,OAAOrF,KAAK8G,QAAQwE,KAAKjG,IA+C3B,IAAIoG,EAAc,SAAsBnE,EAAMjC,EAAKkC,GACjD,IAIIG,EACAgE,EACAnC,EANA/B,EAAIF,EAAKtD,MACTyD,EAAIpC,EAAIrB,MACR2H,EAAIpE,EAAIvD,MACRS,EAAI,EAIJmH,EAAY,EAAPpE,EAAE,GACPqE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPvE,EAAE,GACPwE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP1E,EAAE,GACP2E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7E,EAAE,GACP8E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhF,EAAE,GACPiF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnF,EAAE,GACPoF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtF,EAAE,GACPuF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzF,EAAE,GACP0F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5F,EAAE,GACP6F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/F,EAAE,GACPgG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPjG,EAAE,GACPkG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPpG,EAAE,GACPqG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPvG,EAAE,GACPwG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP1G,EAAE,GACP2G,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7G,EAAE,GACP8G,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAPhH,EAAE,GACPiH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPnH,EAAE,GACPoH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPtH,EAAE,GACPuH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPzH,EAAE,GACP0H,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP5H,EAAE,GACP6H,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjB9H,EAAIxD,SAAWuD,EAAKvD,SAAWsB,EAAItB,SACnCwD,EAAIzG,OAAS,GAMb,IAAI0O,IAAQ/K,GAJZiD,EAAKxC,KAAKuK,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAMxG,KAAKuK,KAAK5D,EAAK+B,IACR1I,KAAKuK,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrDlJ,IAFA8E,EAAKrE,KAAKuK,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAEN9H,EAAKxC,KAAKuK,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAMxG,KAAKuK,KAAKzD,EAAK4B,IACR1I,KAAKuK,KAAKxD,EAAK0B,GAAQ,EACpCpE,EAAKrE,KAAKuK,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQjL,GAJZiD,EAAMA,EAAKxC,KAAKuK,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK5D,EAAKkC,GAAQ,GACvB7I,KAAKuK,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrDrJ,IAFA8E,EAAMA,EAAKrE,KAAKuK,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAENhI,EAAKxC,KAAKuK,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAMxG,KAAKuK,KAAKtD,EAAKyB,IACR1I,KAAKuK,KAAKrD,EAAKuB,GAAQ,EACpCpE,EAAKrE,KAAKuK,KAAKrD,EAAKwB,GACpBlG,EAAMA,EAAKxC,KAAKuK,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKzD,EAAK+B,GAAQ,GACvB7I,KAAKuK,KAAKxD,EAAK6B,GAAQ,EACpCvE,EAAMA,EAAKrE,KAAKuK,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQlL,GAJZiD,EAAMA,EAAKxC,KAAKuK,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK5D,EAAKqC,GAAQ,GACvBhJ,KAAKuK,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrDxJ,IAFA8E,EAAMA,EAAKrE,KAAKuK,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAKxC,KAAKuK,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAMxG,KAAKuK,KAAKnD,EAAKsB,IACR1I,KAAKuK,KAAKlD,EAAKoB,GAAQ,EACpCpE,EAAKrE,KAAKuK,KAAKlD,EAAKqB,GACpBlG,EAAMA,EAAKxC,KAAKuK,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKtD,EAAK4B,GAAQ,GACvB7I,KAAKuK,KAAKrD,EAAK0B,GAAQ,EACpCvE,EAAMA,EAAKrE,KAAKuK,KAAKrD,EAAK2B,GAAQ,EAClCrG,EAAMA,EAAKxC,KAAKuK,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKzD,EAAKkC,GAAQ,GACvBhJ,KAAKuK,KAAKxD,EAAKgC,GAAQ,EACpC1E,EAAMA,EAAKrE,KAAKuK,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQnL,GAJZiD,EAAMA,EAAKxC,KAAKuK,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK5D,EAAKwC,GAAQ,GACvBnJ,KAAKuK,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrD3J,IAFA8E,EAAMA,EAAKrE,KAAKuK,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAKxC,KAAKuK,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAMxG,KAAKuK,KAAKhD,EAAKmB,IACR1I,KAAKuK,KAAK/C,EAAKiB,GAAQ,EACpCpE,EAAKrE,KAAKuK,KAAK/C,EAAKkB,GACpBlG,EAAMA,EAAKxC,KAAKuK,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKnD,EAAKyB,GAAQ,GACvB7I,KAAKuK,KAAKlD,EAAKuB,GAAQ,EACpCvE,EAAMA,EAAKrE,KAAKuK,KAAKlD,EAAKwB,GAAQ,EAClCrG,EAAMA,EAAKxC,KAAKuK,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKtD,EAAK+B,GAAQ,GACvBhJ,KAAKuK,KAAKrD,EAAK6B,GAAQ,EACpC1E,EAAMA,EAAKrE,KAAKuK,KAAKrD,EAAK8B,GAAQ,EAClCxG,EAAMA,EAAKxC,KAAKuK,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKzD,EAAKqC,GAAQ,GACvBnJ,KAAKuK,KAAKxD,EAAKmC,GAAQ,EACpC7E,EAAMA,EAAKrE,KAAKuK,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQpL,GAJZiD,EAAMA,EAAKxC,KAAKuK,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK5D,EAAK2C,IAAQ,GACvBtJ,KAAKuK,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrD9J,IAFA8E,EAAMA,EAAKrE,KAAKuK,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAKxC,KAAKuK,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAMxG,KAAKuK,KAAK7C,EAAKgB,IACR1I,KAAKuK,KAAK5C,EAAKc,GAAQ,EACpCpE,EAAKrE,KAAKuK,KAAK5C,EAAKe,GACpBlG,EAAMA,EAAKxC,KAAKuK,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKhD,EAAKsB,GAAQ,GACvB7I,KAAKuK,KAAK/C,EAAKoB,GAAQ,EACpCvE,EAAMA,EAAKrE,KAAKuK,KAAK/C,EAAKqB,GAAQ,EAClCrG,EAAMA,EAAKxC,KAAKuK,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKnD,EAAK4B,GAAQ,GACvBhJ,KAAKuK,KAAKlD,EAAK0B,GAAQ,EACpC1E,EAAMA,EAAKrE,KAAKuK,KAAKlD,EAAK2B,GAAQ,EAClCxG,EAAMA,EAAKxC,KAAKuK,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKtD,EAAKkC,GAAQ,GACvBnJ,KAAKuK,KAAKrD,EAAKgC,GAAQ,EACpC7E,EAAMA,EAAKrE,KAAKuK,KAAKrD,EAAKiC,GAAQ,EAClC3G,EAAMA,EAAKxC,KAAKuK,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKzD,EAAKwC,IAAQ,GACvBtJ,KAAKuK,KAAKxD,EAAKsC,GAAQ,EACpChF,EAAMA,EAAKrE,KAAKuK,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQrL,GAJZiD,EAAMA,EAAKxC,KAAKuK,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK5D,EAAK8C,IAAQ,GACvBzJ,KAAKuK,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrDjK,IAFA8E,EAAMA,EAAKrE,KAAKuK,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENpI,EAAKxC,KAAKuK,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAMxG,KAAKuK,KAAK1C,EAAKa,IACR1I,KAAKuK,KAAKzC,EAAKW,GAAQ,EACpCpE,EAAKrE,KAAKuK,KAAKzC,EAAKY,GACpBlG,EAAMA,EAAKxC,KAAKuK,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK7C,EAAKmB,GAAQ,GACvB7I,KAAKuK,KAAK5C,EAAKiB,GAAQ,EACpCvE,EAAMA,EAAKrE,KAAKuK,KAAK5C,EAAKkB,GAAQ,EAClCrG,EAAMA,EAAKxC,KAAKuK,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKhD,EAAKyB,GAAQ,GACvBhJ,KAAKuK,KAAK/C,EAAKuB,GAAQ,EACpC1E,EAAMA,EAAKrE,KAAKuK,KAAK/C,EAAKwB,GAAQ,EAClCxG,EAAMA,EAAKxC,KAAKuK,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKnD,EAAK+B,GAAQ,GACvBnJ,KAAKuK,KAAKlD,EAAK6B,GAAQ,EACpC7E,EAAMA,EAAKrE,KAAKuK,KAAKlD,EAAK8B,GAAQ,EAClC3G,EAAMA,EAAKxC,KAAKuK,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKtD,EAAKqC,IAAQ,GACvBtJ,KAAKuK,KAAKrD,EAAKmC,GAAQ,EACpChF,EAAMA,EAAKrE,KAAKuK,KAAKrD,EAAKoC,IAAQ,EAClC9G,EAAMA,EAAKxC,KAAKuK,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKzD,EAAK2C,IAAQ,GACvBzJ,KAAKuK,KAAKxD,EAAKyC,IAAQ,EACpCnF,EAAMA,EAAKrE,KAAKuK,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQtL,GAJZiD,EAAMA,EAAKxC,KAAKuK,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK5D,EAAKiD,IAAQ,GACvB5J,KAAKuK,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrDpK,IAFA8E,EAAMA,EAAKrE,KAAKuK,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENrI,EAAKxC,KAAKuK,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAMxG,KAAKuK,KAAKvC,EAAKU,IACR1I,KAAKuK,KAAKtC,EAAKQ,GAAQ,EACpCpE,EAAKrE,KAAKuK,KAAKtC,EAAKS,GACpBlG,EAAMA,EAAKxC,KAAKuK,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK1C,EAAKgB,GAAQ,GACvB7I,KAAKuK,KAAKzC,EAAKc,GAAQ,EACpCvE,EAAMA,EAAKrE,KAAKuK,KAAKzC,EAAKe,GAAQ,EAClCrG,EAAMA,EAAKxC,KAAKuK,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK7C,EAAKsB,GAAQ,GACvBhJ,KAAKuK,KAAK5C,EAAKoB,GAAQ,EACpC1E,EAAMA,EAAKrE,KAAKuK,KAAK5C,EAAKqB,GAAQ,EAClCxG,EAAMA,EAAKxC,KAAKuK,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKhD,EAAK4B,GAAQ,GACvBnJ,KAAKuK,KAAK/C,EAAK0B,GAAQ,EACpC7E,EAAMA,EAAKrE,KAAKuK,KAAK/C,EAAK2B,GAAQ,EAClC3G,EAAMA,EAAKxC,KAAKuK,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKnD,EAAKkC,IAAQ,GACvBtJ,KAAKuK,KAAKlD,EAAKgC,GAAQ,EACpChF,EAAMA,EAAKrE,KAAKuK,KAAKlD,EAAKiC,IAAQ,EAClC9G,EAAMA,EAAKxC,KAAKuK,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKtD,EAAKwC,IAAQ,GACvBzJ,KAAKuK,KAAKrD,EAAKsC,IAAQ,EACpCnF,EAAMA,EAAKrE,KAAKuK,KAAKrD,EAAKuC,IAAQ,EAClCjH,EAAMA,EAAKxC,KAAKuK,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKzD,EAAK8C,IAAQ,GACvB5J,KAAKuK,KAAKxD,EAAK4C,IAAQ,EACpCtF,EAAMA,EAAKrE,KAAKuK,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQvL,GAJZiD,EAAMA,EAAKxC,KAAKuK,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK5D,EAAKoD,IAAQ,GACvB/J,KAAKuK,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrDvK,IAFA8E,EAAMA,EAAKrE,KAAKuK,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENtI,EAAKxC,KAAKuK,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAMxG,KAAKuK,KAAKpC,EAAKO,IACR1I,KAAKuK,KAAKnC,EAAKK,GAAQ,EACpCpE,EAAKrE,KAAKuK,KAAKnC,EAAKM,GACpBlG,EAAMA,EAAKxC,KAAKuK,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKvC,EAAKa,GAAQ,GACvB7I,KAAKuK,KAAKtC,EAAKW,GAAQ,EACpCvE,EAAMA,EAAKrE,KAAKuK,KAAKtC,EAAKY,GAAQ,EAClCrG,EAAMA,EAAKxC,KAAKuK,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK1C,EAAKmB,GAAQ,GACvBhJ,KAAKuK,KAAKzC,EAAKiB,GAAQ,EACpC1E,EAAMA,EAAKrE,KAAKuK,KAAKzC,EAAKkB,GAAQ,EAClCxG,EAAMA,EAAKxC,KAAKuK,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK7C,EAAKyB,GAAQ,GACvBnJ,KAAKuK,KAAK5C,EAAKuB,GAAQ,EACpC7E,EAAMA,EAAKrE,KAAKuK,KAAK5C,EAAKwB,GAAQ,EAClC3G,EAAMA,EAAKxC,KAAKuK,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKhD,EAAK+B,IAAQ,GACvBtJ,KAAKuK,KAAK/C,EAAK6B,GAAQ,EACpChF,EAAMA,EAAKrE,KAAKuK,KAAK/C,EAAK8B,IAAQ,EAClC9G,EAAMA,EAAKxC,KAAKuK,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKnD,EAAKqC,IAAQ,GACvBzJ,KAAKuK,KAAKlD,EAAKmC,IAAQ,EACpCnF,EAAMA,EAAKrE,KAAKuK,KAAKlD,EAAKoC,IAAQ,EAClCjH,EAAMA,EAAKxC,KAAKuK,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKtD,EAAK2C,IAAQ,GACvB5J,KAAKuK,KAAKrD,EAAKyC,IAAQ,EACpCtF,EAAMA,EAAKrE,KAAKuK,KAAKrD,EAAK0C,IAAQ,EAClCpH,EAAMA,EAAKxC,KAAKuK,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKzD,EAAKiD,IAAQ,GACvB/J,KAAKuK,KAAKxD,EAAK+C,IAAQ,EACpCzF,EAAMA,EAAKrE,KAAKuK,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQxL,GAJZiD,EAAMA,EAAKxC,KAAKuK,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK5D,EAAKuD,IAAQ,GACvBlK,KAAKuK,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrD1K,IAFA8E,EAAMA,EAAKrE,KAAKuK,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENvI,EAAKxC,KAAKuK,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAMxG,KAAKuK,KAAKjC,EAAKI,IACR1I,KAAKuK,KAAKhC,EAAKE,GAAQ,EACpCpE,EAAKrE,KAAKuK,KAAKhC,EAAKG,GACpBlG,EAAMA,EAAKxC,KAAKuK,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKpC,EAAKU,GAAQ,GACvB7I,KAAKuK,KAAKnC,EAAKQ,GAAQ,EACpCvE,EAAMA,EAAKrE,KAAKuK,KAAKnC,EAAKS,GAAQ,EAClCrG,EAAMA,EAAKxC,KAAKuK,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKvC,EAAKgB,GAAQ,GACvBhJ,KAAKuK,KAAKtC,EAAKc,GAAQ,EACpC1E,EAAMA,EAAKrE,KAAKuK,KAAKtC,EAAKe,GAAQ,EAClCxG,EAAMA,EAAKxC,KAAKuK,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK1C,EAAKsB,GAAQ,GACvBnJ,KAAKuK,KAAKzC,EAAKoB,GAAQ,EACpC7E,EAAMA,EAAKrE,KAAKuK,KAAKzC,EAAKqB,GAAQ,EAClC3G,EAAMA,EAAKxC,KAAKuK,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK7C,EAAK4B,IAAQ,GACvBtJ,KAAKuK,KAAK5C,EAAK0B,GAAQ,EACpChF,EAAMA,EAAKrE,KAAKuK,KAAK5C,EAAK2B,IAAQ,EAClC9G,EAAMA,EAAKxC,KAAKuK,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKhD,EAAKkC,IAAQ,GACvBzJ,KAAKuK,KAAK/C,EAAKgC,IAAQ,EACpCnF,EAAMA,EAAKrE,KAAKuK,KAAK/C,EAAKiC,IAAQ,EAClCjH,EAAMA,EAAKxC,KAAKuK,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKnD,EAAKwC,IAAQ,GACvB5J,KAAKuK,KAAKlD,EAAKsC,IAAQ,EACpCtF,EAAMA,EAAKrE,KAAKuK,KAAKlD,EAAKuC,IAAQ,EAClCpH,EAAMA,EAAKxC,KAAKuK,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKtD,EAAK8C,IAAQ,GACvB/J,KAAKuK,KAAKrD,EAAK4C,IAAQ,EACpCzF,EAAMA,EAAKrE,KAAKuK,KAAKrD,EAAK6C,IAAQ,EAClCvH,EAAMA,EAAKxC,KAAKuK,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKzD,EAAKoD,IAAQ,GACvBlK,KAAKuK,KAAKxD,EAAKkD,IAAQ,EACpC5F,EAAMA,EAAKrE,KAAKuK,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQzL,GAJZiD,EAAMA,EAAKxC,KAAKuK,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK5D,EAAK0D,IAAQ,GACvBrK,KAAKuK,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrD7K,IAFA8E,EAAMA,EAAKrE,KAAKuK,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENxI,EAAKxC,KAAKuK,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAMxG,KAAKuK,KAAKjC,EAAKO,IACR7I,KAAKuK,KAAKhC,EAAKK,GAAQ,EACpCvE,EAAKrE,KAAKuK,KAAKhC,EAAKM,GACpBrG,EAAMA,EAAKxC,KAAKuK,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKpC,EAAKa,GAAQ,GACvBhJ,KAAKuK,KAAKnC,EAAKW,GAAQ,EACpC1E,EAAMA,EAAKrE,KAAKuK,KAAKnC,EAAKY,GAAQ,EAClCxG,EAAMA,EAAKxC,KAAKuK,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKvC,EAAKmB,GAAQ,GACvBnJ,KAAKuK,KAAKtC,EAAKiB,GAAQ,EACpC7E,EAAMA,EAAKrE,KAAKuK,KAAKtC,EAAKkB,GAAQ,EAClC3G,EAAMA,EAAKxC,KAAKuK,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK1C,EAAKyB,IAAQ,GACvBtJ,KAAKuK,KAAKzC,EAAKuB,GAAQ,EACpChF,EAAMA,EAAKrE,KAAKuK,KAAKzC,EAAKwB,IAAQ,EAClC9G,EAAMA,EAAKxC,KAAKuK,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK7C,EAAK+B,IAAQ,GACvBzJ,KAAKuK,KAAK5C,EAAK6B,IAAQ,EACpCnF,EAAMA,EAAKrE,KAAKuK,KAAK5C,EAAK8B,IAAQ,EAClCjH,EAAMA,EAAKxC,KAAKuK,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKhD,EAAKqC,IAAQ,GACvB5J,KAAKuK,KAAK/C,EAAKmC,IAAQ,EACpCtF,EAAMA,EAAKrE,KAAKuK,KAAK/C,EAAKoC,IAAQ,EAClCpH,EAAMA,EAAKxC,KAAKuK,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKnD,EAAK2C,IAAQ,GACvB/J,KAAKuK,KAAKlD,EAAKyC,IAAQ,EACpCzF,EAAMA,EAAKrE,KAAKuK,KAAKlD,EAAK0C,IAAQ,EAClCvH,EAAMA,EAAKxC,KAAKuK,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKtD,EAAKiD,IAAQ,GACvBlK,KAAKuK,KAAKrD,EAAK+C,IAAQ,EACpC5F,EAAMA,EAAKrE,KAAKuK,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAAS1L,GAJbiD,EAAMA,EAAKxC,KAAKuK,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKzD,EAAKuD,IAAQ,GACvBrK,KAAKuK,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtD7K,IAFA8E,EAAMA,EAAKrE,KAAKuK,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEPzI,EAAKxC,KAAKuK,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAMxG,KAAKuK,KAAKjC,EAAKU,IACRhJ,KAAKuK,KAAKhC,EAAKQ,GAAQ,EACpC1E,EAAKrE,KAAKuK,KAAKhC,EAAKS,GACpBxG,EAAMA,EAAKxC,KAAKuK,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKpC,EAAKgB,GAAQ,GACvBnJ,KAAKuK,KAAKnC,EAAKc,GAAQ,EACpC7E,EAAMA,EAAKrE,KAAKuK,KAAKnC,EAAKe,GAAQ,EAClC3G,EAAMA,EAAKxC,KAAKuK,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKvC,EAAKsB,IAAQ,GACvBtJ,KAAKuK,KAAKtC,EAAKoB,GAAQ,EACpChF,EAAMA,EAAKrE,KAAKuK,KAAKtC,EAAKqB,IAAQ,EAClC9G,EAAMA,EAAKxC,KAAKuK,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK1C,EAAK4B,IAAQ,GACvBzJ,KAAKuK,KAAKzC,EAAK0B,IAAQ,EACpCnF,EAAMA,EAAKrE,KAAKuK,KAAKzC,EAAK2B,IAAQ,EAClCjH,EAAMA,EAAKxC,KAAKuK,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK7C,EAAKkC,IAAQ,GACvB5J,KAAKuK,KAAK5C,EAAKgC,IAAQ,EACpCtF,EAAMA,EAAKrE,KAAKuK,KAAK5C,EAAKiC,IAAQ,EAClCpH,EAAMA,EAAKxC,KAAKuK,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKhD,EAAKwC,IAAQ,GACvB/J,KAAKuK,KAAK/C,EAAKsC,IAAQ,EACpCzF,EAAMA,EAAKrE,KAAKuK,KAAK/C,EAAKuC,IAAQ,EAClCvH,EAAMA,EAAKxC,KAAKuK,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKnD,EAAK8C,IAAQ,GACvBlK,KAAKuK,KAAKlD,EAAK4C,IAAQ,EACpC5F,EAAMA,EAAKrE,KAAKuK,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAAS3L,GAJbiD,EAAMA,EAAKxC,KAAKuK,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKtD,EAAKoD,IAAQ,GACvBrK,KAAKuK,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtD7K,IAFA8E,EAAMA,EAAKrE,KAAKuK,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAKxC,KAAKuK,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAMxG,KAAKuK,KAAKjC,EAAKa,IACRnJ,KAAKuK,KAAKhC,EAAKW,GAAQ,EACpC7E,EAAKrE,KAAKuK,KAAKhC,EAAKY,GACpB3G,EAAMA,EAAKxC,KAAKuK,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKpC,EAAKmB,IAAQ,GACvBtJ,KAAKuK,KAAKnC,EAAKiB,GAAQ,EACpChF,EAAMA,EAAKrE,KAAKuK,KAAKnC,EAAKkB,IAAQ,EAClC9G,EAAMA,EAAKxC,KAAKuK,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKvC,EAAKyB,IAAQ,GACvBzJ,KAAKuK,KAAKtC,EAAKuB,IAAQ,EACpCnF,EAAMA,EAAKrE,KAAKuK,KAAKtC,EAAKwB,IAAQ,EAClCjH,EAAMA,EAAKxC,KAAKuK,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK1C,EAAK+B,IAAQ,GACvB5J,KAAKuK,KAAKzC,EAAK6B,IAAQ,EACpCtF,EAAMA,EAAKrE,KAAKuK,KAAKzC,EAAK8B,IAAQ,EAClCpH,EAAMA,EAAKxC,KAAKuK,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK7C,EAAKqC,IAAQ,GACvB/J,KAAKuK,KAAK5C,EAAKmC,IAAQ,EACpCzF,EAAMA,EAAKrE,KAAKuK,KAAK5C,EAAKoC,IAAQ,EAClCvH,EAAMA,EAAKxC,KAAKuK,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKhD,EAAK2C,IAAQ,GACvBlK,KAAKuK,KAAK/C,EAAKyC,IAAQ,EACpC5F,EAAMA,EAAKrE,KAAKuK,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAAS5L,GAJbiD,EAAMA,EAAKxC,KAAKuK,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKnD,EAAKiD,IAAQ,GACvBrK,KAAKuK,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtD7K,IAFA8E,EAAMA,EAAKrE,KAAKuK,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEP3I,EAAKxC,KAAKuK,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAMxG,KAAKuK,KAAKjC,EAAKgB,KACRtJ,KAAKuK,KAAKhC,EAAKc,GAAQ,EACpChF,EAAKrE,KAAKuK,KAAKhC,EAAKe,IACpB9G,EAAMA,EAAKxC,KAAKuK,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKpC,EAAKsB,IAAQ,GACvBzJ,KAAKuK,KAAKnC,EAAKoB,IAAQ,EACpCnF,EAAMA,EAAKrE,KAAKuK,KAAKnC,EAAKqB,IAAQ,EAClCjH,EAAMA,EAAKxC,KAAKuK,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKvC,EAAK4B,IAAQ,GACvB5J,KAAKuK,KAAKtC,EAAK0B,IAAQ,EACpCtF,EAAMA,EAAKrE,KAAKuK,KAAKtC,EAAK2B,IAAQ,EAClCpH,EAAMA,EAAKxC,KAAKuK,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK1C,EAAKkC,IAAQ,GACvB/J,KAAKuK,KAAKzC,EAAKgC,IAAQ,EACpCzF,EAAMA,EAAKrE,KAAKuK,KAAKzC,EAAKiC,IAAQ,EAClCvH,EAAMA,EAAKxC,KAAKuK,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK7C,EAAKwC,IAAQ,GACvBlK,KAAKuK,KAAK5C,EAAKsC,IAAQ,EACpC5F,EAAMA,EAAKrE,KAAKuK,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAAS7L,GAJbiD,EAAMA,EAAKxC,KAAKuK,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKhD,EAAK8C,IAAQ,GACvBrK,KAAKuK,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtD7K,IAFA8E,EAAMA,EAAKrE,KAAKuK,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP5I,EAAKxC,KAAKuK,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAMxG,KAAKuK,KAAKjC,EAAKmB,KACRzJ,KAAKuK,KAAKhC,EAAKiB,IAAQ,EACpCnF,EAAKrE,KAAKuK,KAAKhC,EAAKkB,IACpBjH,EAAMA,EAAKxC,KAAKuK,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKpC,EAAKyB,IAAQ,GACvB5J,KAAKuK,KAAKnC,EAAKuB,IAAQ,EACpCtF,EAAMA,EAAKrE,KAAKuK,KAAKnC,EAAKwB,IAAQ,EAClCpH,EAAMA,EAAKxC,KAAKuK,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKvC,EAAK+B,IAAQ,GACvB/J,KAAKuK,KAAKtC,EAAK6B,IAAQ,EACpCzF,EAAMA,EAAKrE,KAAKuK,KAAKtC,EAAK8B,IAAQ,EAClCvH,EAAMA,EAAKxC,KAAKuK,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK1C,EAAKqC,IAAQ,GACvBlK,KAAKuK,KAAKzC,EAAKmC,IAAQ,EACpC5F,EAAMA,EAAKrE,KAAKuK,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAAS9L,GAJbiD,EAAMA,EAAKxC,KAAKuK,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK7C,EAAK2C,IAAQ,GACvBrK,KAAKuK,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtD7K,IAFA8E,EAAMA,EAAKrE,KAAKuK,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEP7I,EAAKxC,KAAKuK,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAMxG,KAAKuK,KAAKjC,EAAKsB,KACR5J,KAAKuK,KAAKhC,EAAKoB,IAAQ,EACpCtF,EAAKrE,KAAKuK,KAAKhC,EAAKqB,IACpBpH,EAAMA,EAAKxC,KAAKuK,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKpC,EAAK4B,IAAQ,GACvB/J,KAAKuK,KAAKnC,EAAK0B,IAAQ,EACpCzF,EAAMA,EAAKrE,KAAKuK,KAAKnC,EAAK2B,IAAQ,EAClCvH,EAAMA,EAAKxC,KAAKuK,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKvC,EAAKkC,IAAQ,GACvBlK,KAAKuK,KAAKtC,EAAKgC,IAAQ,EACpC5F,EAAMA,EAAKrE,KAAKuK,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAAS/L,GAJbiD,EAAMA,EAAKxC,KAAKuK,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMxG,KAAKuK,KAAK1C,EAAKwC,IAAQ,GACvBrK,KAAKuK,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtD7K,IAFA8E,EAAMA,EAAKrE,KAAKuK,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP9I,EAAKxC,KAAKuK,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAMxG,KAAKuK,KAAKjC,EAAKyB,KACR/J,KAAKuK,KAAKhC,EAAKuB,IAAQ,EACpCzF,EAAKrE,KAAKuK,KAAKhC,EAAKwB,IACpBvH,EAAMA,EAAKxC,KAAKuK,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKpC,EAAK+B,IAAQ,GACvBlK,KAAKuK,KAAKnC,EAAK6B,IAAQ,EACpC5F,EAAMA,EAAKrE,KAAKuK,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAAShM,GAJbiD,EAAMA,EAAKxC,KAAKuK,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKvC,EAAKqC,IAAQ,GACvBrK,KAAKuK,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtD7K,IAFA8E,EAAMA,EAAKrE,KAAKuK,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEP/I,EAAKxC,KAAKuK,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAMxG,KAAKuK,KAAKjC,EAAK4B,KACRlK,KAAKuK,KAAKhC,EAAK0B,IAAQ,EACpC5F,EAAKrE,KAAKuK,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAASjM,GAJbiD,EAAMA,EAAKxC,KAAKuK,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMxG,KAAKuK,KAAKpC,EAAKkC,IAAQ,GACvBrK,KAAKuK,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtD7K,IAFA8E,EAAMA,EAAKrE,KAAKuK,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAASlM,GAJbiD,EAAKxC,KAAKuK,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAMxG,KAAKuK,KAAKjC,EAAK+B,KACRrK,KAAKuK,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBA7K,IAFA8E,EAAKrE,KAAKuK,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,IAANlM,IACFkH,EAAE,IAAMlH,EACR8C,EAAIzG,UAECyG,GAiDT,SAASqJ,EAAYtJ,EAAMjC,EAAKkC,GAE9B,OADW,IAAIsJ,GACHC,KAAKxJ,EAAMjC,EAAKkC,GAsB9B,SAASsJ,EAAME,EAAGC,GAChBhR,KAAK+Q,EAAIA,EACT/Q,KAAKgR,EAAIA,EAvEN9L,KAAKuK,OACRhE,EAAcpE,GAiDhBpI,EAAGyC,UAAUuP,MAAQ,SAAgB5L,EAAKkC,GACxC,IACI/G,EAAMR,KAAKc,OAASuE,EAAIvE,OAW5B,OAVoB,KAAhBd,KAAKc,QAAgC,KAAfuE,EAAIvE,OACtB2K,EAAYzL,KAAMqF,EAAKkC,GACpB/G,EAAM,GACT6G,EAAWrH,KAAMqF,EAAKkC,GACnB/G,EAAM,KArDnB,SAAmB8G,EAAMjC,EAAKkC,GAC5BA,EAAIxD,SAAWsB,EAAItB,SAAWuD,EAAKvD,SACnCwD,EAAIzG,OAASwG,EAAKxG,OAASuE,EAAIvE,OAI/B,IAFA,IAAI6G,EAAQ,EACRuJ,EAAU,EACLtJ,EAAI,EAAGA,EAAIL,EAAIzG,OAAS,EAAG8G,IAAK,CAGvC,IAAIC,EAASqJ,EACbA,EAAU,EAGV,IAFA,IAAIpJ,EAAgB,SAARH,EACRI,EAAO7C,KAAKC,IAAIyC,EAAGvC,EAAIvE,OAAS,GAC3BkF,EAAId,KAAKI,IAAI,EAAGsC,EAAIN,EAAKxG,OAAS,GAAIkF,GAAK+B,EAAM/B,IAAK,CAC7D,IAAIZ,EAAIwC,EAAI5B,EAGRnB,GAFoB,EAAhByC,EAAKtD,MAAMoB,KACI,EAAfC,EAAIrB,MAAMgC,IAGd0B,EAAS,SAAJ7C,EAGTiD,EAAa,UADbJ,EAAMA,EAAKI,EAAS,GAIpBoJ,IAFArJ,GAHAA,EAAUA,GAAWhD,EAAI,SAAa,GAAM,IAGxB6C,IAAO,IAAO,KAEZ,GACtBG,GAAU,SAEZN,EAAIvD,MAAM4D,GAAKE,EACfH,EAAQE,EACRA,EAASqJ,EAQX,OANc,IAAVvJ,EACFJ,EAAIvD,MAAM4D,GAAKD,EAEfJ,EAAIzG,SAGCyG,EAAIpB,QAgBHgL,CAASnR,KAAMqF,EAAKkC,GAEpBqJ,EAAW5Q,KAAMqF,EAAKkC,IAchCsJ,EAAKnP,UAAU0P,QAAU,SAAkBC,GAGzC,IAFA,IAAIjI,EAAI,IAAI3I,MAAM4Q,GACdC,EAAIrS,EAAGyC,UAAUyH,WAAWkI,GAAK,EAC5BjM,EAAI,EAAGA,EAAIiM,EAAGjM,IACrBgE,EAAEhE,GAAKpF,KAAKuR,OAAOnM,EAAGkM,EAAGD,GAG3B,OAAOjI,GAITyH,EAAKnP,UAAU6P,OAAS,SAAiBR,EAAGO,EAAGD,GAC7C,GAAU,IAANN,GAAWA,IAAMM,EAAI,EAAG,OAAON,EAGnC,IADA,IAAIS,EAAK,EACApM,EAAI,EAAGA,EAAIkM,EAAGlM,IACrBoM,IAAW,EAAJT,IAAWO,EAAIlM,EAAI,EAC1B2L,IAAM,EAGR,OAAOS,GAKTX,EAAKnP,UAAU+P,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAIjM,EAAI,EAAGA,EAAIiM,EAAGjM,IACrByM,EAAKzM,GAAKuM,EAAID,EAAItM,IAClB0M,EAAK1M,GAAKwM,EAAIF,EAAItM,KAItByL,EAAKnP,UAAUqQ,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtE1R,KAAKyR,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQ/M,KAAKgN,IAAI,EAAIhN,KAAKiN,GAAKb,GAC/Bc,EAAQlN,KAAKmN,IAAI,EAAInN,KAAKiN,GAAKb,GAE1BgB,EAAI,EAAGA,EAAIjB,EAAGiB,GAAKhB,EAI1B,IAHA,IAAIiB,EAASN,EACTO,EAASJ,EAEJpM,EAAI,EAAGA,EAAIgM,EAAGhM,IAAK,CAC1B,IAAIyM,EAAKZ,EAAKS,EAAItM,GACd0M,EAAKZ,EAAKQ,EAAItM,GAEd2M,EAAKd,EAAKS,EAAItM,EAAIgM,GAClBY,EAAKd,EAAKQ,EAAItM,EAAIgM,GAElBa,EAAKN,EAASI,EAAKH,EAASI,EAEhCA,EAAKL,EAASK,EAAKJ,EAASG,EAC5BA,EAAKE,EAELhB,EAAKS,EAAItM,GAAKyM,EAAKE,EACnBb,EAAKQ,EAAItM,GAAK0M,EAAKE,EAEnBf,EAAKS,EAAItM,EAAIgM,GAAKS,EAAKE,EACvBb,EAAKQ,EAAItM,EAAIgM,GAAKU,EAAKE,EAGnB5M,IAAMsL,IACRuB,EAAKZ,EAAQM,EAASH,EAAQI,EAE9BA,EAASP,EAAQO,EAASJ,EAAQG,EAClCA,EAASM,KAOnBhC,EAAKnP,UAAUoR,YAAc,SAAsBC,EAAGC,GACpD,IAAI3B,EAAqB,EAAjBnM,KAAKI,IAAI0N,EAAGD,GAChBE,EAAU,EAAJ5B,EACNjM,EAAI,EACR,IAAKiM,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/BjM,IAGF,OAAO,GAAKA,EAAI,EAAI6N,GAGtBpC,EAAKnP,UAAUwR,UAAY,SAAoBvB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAIjM,EAAI,EAAGA,EAAIiM,EAAI,EAAGjM,IAAK,CAC9B,IAAIgE,EAAIuI,EAAIvM,GAEZuM,EAAIvM,GAAKuM,EAAIN,EAAIjM,EAAI,GACrBuM,EAAIN,EAAIjM,EAAI,GAAKgE,EAEjBA,EAAIwI,EAAIxM,GAERwM,EAAIxM,IAAMwM,EAAIP,EAAIjM,EAAI,GACtBwM,EAAIP,EAAIjM,EAAI,IAAMgE,IAItByH,EAAKnP,UAAUyR,aAAe,SAAuBC,EAAI/B,GAEvD,IADA,IAAI1J,EAAQ,EACHvC,EAAI,EAAGA,EAAIiM,EAAI,EAAGjM,IAAK,CAC9B,IAAIa,EAAoC,KAAhCf,KAAKmO,MAAMD,EAAG,EAAIhO,EAAI,GAAKiM,GACjCnM,KAAKmO,MAAMD,EAAG,EAAIhO,GAAKiM,GACvB1J,EAEFyL,EAAGhO,GAAS,SAAJa,EAGN0B,EADE1B,EAAI,SACE,EAEAA,EAAI,SAAY,EAI5B,OAAOmN,GAGTvC,EAAKnP,UAAU4R,WAAa,SAAqBF,EAAI5S,EAAKmR,EAAKN,GAE7D,IADA,IAAI1J,EAAQ,EACHvC,EAAI,EAAGA,EAAI5E,EAAK4E,IACvBuC,GAAyB,EAARyL,EAAGhO,GAEpBuM,EAAI,EAAIvM,GAAa,KAARuC,EAAgBA,KAAkB,GAC/CgK,EAAI,EAAIvM,EAAI,GAAa,KAARuC,EAAgBA,KAAkB,GAIrD,IAAKvC,EAAI,EAAI5E,EAAK4E,EAAIiM,IAAKjM,EACzBuM,EAAIvM,GAAK,EAGXnC,EAAiB,IAAV0E,GACP1E,EAA6B,KAAb,KAAR0E,KAGVkJ,EAAKnP,UAAU6R,KAAO,SAAelC,GAEnC,IADA,IAAImC,EAAK,IAAI/S,MAAM4Q,GACVjM,EAAI,EAAGA,EAAIiM,EAAGjM,IACrBoO,EAAGpO,GAAK,EAGV,OAAOoO,GAGT3C,EAAKnP,UAAUoP,KAAO,SAAeC,EAAGC,EAAGzJ,GACzC,IAAI8J,EAAI,EAAIrR,KAAK8S,YAAY/B,EAAEjQ,OAAQkQ,EAAElQ,QAErC4Q,EAAM1R,KAAKoR,QAAQC,GAEnBoC,EAAIzT,KAAKuT,KAAKlC,GAEdM,EAAM,IAAIlR,MAAM4Q,GAChBqC,EAAO,IAAIjT,MAAM4Q,GACjBsC,EAAO,IAAIlT,MAAM4Q,GAEjBuC,EAAO,IAAInT,MAAM4Q,GACjBwC,EAAQ,IAAIpT,MAAM4Q,GAClByC,EAAQ,IAAIrT,MAAM4Q,GAElB0C,EAAOxM,EAAIvD,MACf+P,EAAKjT,OAASuQ,EAEdrR,KAAKsT,WAAWvC,EAAE/M,MAAO+M,EAAEjQ,OAAQ6Q,EAAKN,GACxCrR,KAAKsT,WAAWtC,EAAEhN,MAAOgN,EAAElQ,OAAQ8S,EAAMvC,GAEzCrR,KAAK+R,UAAUJ,EAAK8B,EAAGC,EAAMC,EAAMtC,EAAGK,GACtC1R,KAAK+R,UAAU6B,EAAMH,EAAGI,EAAOC,EAAOzC,EAAGK,GAEzC,IAAK,IAAItM,EAAI,EAAGA,EAAIiM,EAAGjM,IAAK,CAC1B,IAAIyN,EAAKa,EAAKtO,GAAKyO,EAAMzO,GAAKuO,EAAKvO,GAAK0O,EAAM1O,GAC9CuO,EAAKvO,GAAKsO,EAAKtO,GAAK0O,EAAM1O,GAAKuO,EAAKvO,GAAKyO,EAAMzO,GAC/CsO,EAAKtO,GAAKyN,EAUZ,OAPA7S,KAAKkT,UAAUQ,EAAMC,EAAMtC,GAC3BrR,KAAK+R,UAAU2B,EAAMC,EAAMI,EAAMN,EAAGpC,EAAGK,GACvC1R,KAAKkT,UAAUa,EAAMN,EAAGpC,GACxBrR,KAAKmT,aAAaY,EAAM1C,GAExB9J,EAAIxD,SAAWgN,EAAEhN,SAAWiN,EAAEjN,SAC9BwD,EAAIzG,OAASiQ,EAAEjQ,OAASkQ,EAAElQ,OACnByG,EAAIpB,SAIblH,EAAGyC,UAAUW,IAAM,SAAcgD,GAC/B,IAAIkC,EAAM,IAAItI,EAAG,MAEjB,OADAsI,EAAIvD,MAAQ,IAAIvD,MAAMT,KAAKc,OAASuE,EAAIvE,QACjCd,KAAKiR,MAAM5L,EAAKkC,IAIzBtI,EAAGyC,UAAUsS,KAAO,SAAe3O,GACjC,IAAIkC,EAAM,IAAItI,EAAG,MAEjB,OADAsI,EAAIvD,MAAQ,IAAIvD,MAAMT,KAAKc,OAASuE,EAAIvE,QACjC8P,EAAW5Q,KAAMqF,EAAKkC,IAI/BtI,EAAGyC,UAAU+N,KAAO,SAAepK,GACjC,OAAOrF,KAAK8G,QAAQmK,MAAM5L,EAAKrF,OAGjCf,EAAGyC,UAAU+E,MAAQ,SAAgBpB,GACnCpC,EAAsB,iBAARoC,GACdpC,EAAOoC,EAAM,UAIb,IADA,IAAIsC,EAAQ,EACHvC,EAAI,EAAGA,EAAIpF,KAAKc,OAAQsE,IAAK,CACpC,IAAIa,GAAqB,EAAhBjG,KAAKgE,MAAMoB,IAAUC,EAC1BqC,GAAU,SAAJzB,IAA0B,SAAR0B,GAC5BA,IAAU,GACVA,GAAU1B,EAAI,SAAa,EAE3B0B,GAASD,IAAO,GAChB1H,KAAKgE,MAAMoB,GAAU,SAALsC,EAQlB,OALc,IAAVC,IACF3H,KAAKgE,MAAMoB,GAAKuC,EAChB3H,KAAKc,UAGAd,MAGTf,EAAGyC,UAAUuS,KAAO,SAAe5O,GACjC,OAAOrF,KAAK8G,QAAQL,MAAMpB,IAI5BpG,EAAGyC,UAAUwS,IAAM,WACjB,OAAOlU,KAAKqC,IAAIrC,OAIlBf,EAAGyC,UAAUyS,KAAO,WAClB,OAAOnU,KAAKyP,KAAKzP,KAAK8G,UAIxB7H,EAAGyC,UAAUiF,IAAM,SAActB,GAC/B,IAAIY,EAxxCN,SAAqBZ,GAGnB,IAFA,IAAIY,EAAI,IAAIxF,MAAM4E,EAAIiE,aAEb6B,EAAM,EAAGA,EAAMlF,EAAEnF,OAAQqK,IAAO,CACvC,IAAIjF,EAAOiF,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjBlF,EAAEkF,IAAQ9F,EAAIrB,MAAMkC,GAAQ,GAAKkF,KAAWA,EAG9C,OAAOnF,EA8wCCmO,CAAW/O,GACnB,GAAiB,IAAbY,EAAEnF,OAAc,OAAO,IAAI7B,EAAG,GAIlC,IADA,IAAI6J,EAAM9I,KACDoF,EAAI,EAAGA,EAAIa,EAAEnF,QACP,IAATmF,EAAEb,GADsBA,IAAK0D,EAAMA,EAAIoL,OAI7C,KAAM9O,EAAIa,EAAEnF,OACV,IAAK,IAAIiI,EAAID,EAAIoL,MAAO9O,EAAIa,EAAEnF,OAAQsE,IAAK2D,EAAIA,EAAEmL,MAClC,IAATjO,EAAEb,KAEN0D,EAAMA,EAAIzG,IAAI0G,IAIlB,OAAOD,GAIT7J,EAAGyC,UAAU2S,OAAS,SAAiBC,GACrCrR,EAAuB,iBAATqR,GAAqBA,GAAQ,GAC3C,IAGIlP,EAHAP,EAAIyP,EAAO,GACXtC,GAAKsC,EAAOzP,GAAK,GACjB0P,EAAa,WAAe,GAAK1P,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAI8C,EAAQ,EAEZ,IAAKvC,EAAI,EAAGA,EAAIpF,KAAKc,OAAQsE,IAAK,CAChC,IAAIoP,EAAWxU,KAAKgE,MAAMoB,GAAKmP,EAC3B9P,GAAsB,EAAhBzE,KAAKgE,MAAMoB,IAAUoP,GAAa3P,EAC5C7E,KAAKgE,MAAMoB,GAAKX,EAAIkD,EACpBA,EAAQ6M,IAAc,GAAK3P,EAGzB8C,IACF3H,KAAKgE,MAAMoB,GAAKuC,EAChB3H,KAAKc,UAIT,GAAU,IAANkR,EAAS,CACX,IAAK5M,EAAIpF,KAAKc,OAAS,EAAGsE,GAAK,EAAGA,IAChCpF,KAAKgE,MAAMoB,EAAI4M,GAAKhS,KAAKgE,MAAMoB,GAGjC,IAAKA,EAAI,EAAGA,EAAI4M,EAAG5M,IACjBpF,KAAKgE,MAAMoB,GAAK,EAGlBpF,KAAKc,QAAUkR,EAGjB,OAAOhS,KAAKmG,SAGdlH,EAAGyC,UAAU+S,MAAQ,SAAgBH,GAGnC,OADArR,EAAyB,IAAlBjD,KAAK+D,UACL/D,KAAKqU,OAAOC,IAMrBrV,EAAGyC,UAAUuH,OAAS,SAAiBqL,EAAMI,EAAMC,GAEjD,IAAIC,EADJ3R,EAAuB,iBAATqR,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAI7P,EAAIyP,EAAO,GACXtC,EAAI9M,KAAKC,KAAKmP,EAAOzP,GAAK,GAAI7E,KAAKc,QACnC+T,EAAO,SAAc,WAAchQ,GAAMA,EACzCiQ,EAAcH,EAMlB,GAJAC,GAAK5C,EACL4C,EAAI1P,KAAKI,IAAI,EAAGsP,GAGZE,EAAa,CACf,IAAK,IAAI1P,EAAI,EAAGA,EAAI4M,EAAG5M,IACrB0P,EAAY9Q,MAAMoB,GAAKpF,KAAKgE,MAAMoB,GAEpC0P,EAAYhU,OAASkR,EAGvB,GAAU,IAANA,QAEG,GAAIhS,KAAKc,OAASkR,EAEvB,IADAhS,KAAKc,QAAUkR,EACV5M,EAAI,EAAGA,EAAIpF,KAAKc,OAAQsE,IAC3BpF,KAAKgE,MAAMoB,GAAKpF,KAAKgE,MAAMoB,EAAI4M,QAGjChS,KAAKgE,MAAM,GAAK,EAChBhE,KAAKc,OAAS,EAGhB,IAAI6G,EAAQ,EACZ,IAAKvC,EAAIpF,KAAKc,OAAS,EAAGsE,GAAK,IAAgB,IAAVuC,GAAevC,GAAKwP,GAAIxP,IAAK,CAChE,IAAIoB,EAAuB,EAAhBxG,KAAKgE,MAAMoB,GACtBpF,KAAKgE,MAAMoB,GAAMuC,GAAU,GAAK9C,EAAO2B,IAAS3B,EAChD8C,EAAQnB,EAAOqO,EAajB,OATIC,GAAyB,IAAVnN,IACjBmN,EAAY9Q,MAAM8Q,EAAYhU,UAAY6G,GAGxB,IAAhB3H,KAAKc,SACPd,KAAKgE,MAAM,GAAK,EAChBhE,KAAKc,OAAS,GAGTd,KAAKmG,SAGdlH,EAAGyC,UAAUqT,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADA1R,EAAyB,IAAlBjD,KAAK+D,UACL/D,KAAKiJ,OAAOqL,EAAMI,EAAMC,IAIjC1V,EAAGyC,UAAUsT,KAAO,SAAeV,GACjC,OAAOtU,KAAK8G,QAAQ2N,MAAMH,IAG5BrV,EAAGyC,UAAUuT,MAAQ,SAAgBX,GACnC,OAAOtU,KAAK8G,QAAQuN,OAAOC,IAI7BrV,EAAGyC,UAAUwT,KAAO,SAAeZ,GACjC,OAAOtU,KAAK8G,QAAQiO,MAAMT,IAG5BrV,EAAGyC,UAAUyT,MAAQ,SAAgBb,GACnC,OAAOtU,KAAK8G,QAAQmC,OAAOqL,IAI7BrV,EAAGyC,UAAUqI,MAAQ,SAAgBoB,GACnClI,EAAsB,iBAARkI,GAAoBA,GAAO,GACzC,IAAItG,EAAIsG,EAAM,GACV6G,GAAK7G,EAAMtG,GAAK,GAChBkE,EAAI,GAAKlE,EAGb,QAAI7E,KAAKc,QAAUkR,OAGXhS,KAAKgE,MAAMgO,GAELjJ,IAIhB9J,EAAGyC,UAAU0T,OAAS,SAAiBd,GACrCrR,EAAuB,iBAATqR,GAAqBA,GAAQ,GAC3C,IAAIzP,EAAIyP,EAAO,GACXtC,GAAKsC,EAAOzP,GAAK,GAIrB,GAFA5B,EAAyB,IAAlBjD,KAAK+D,SAAgB,2CAExB/D,KAAKc,QAAUkR,EACjB,OAAOhS,KAQT,GALU,IAAN6E,GACFmN,IAEFhS,KAAKc,OAASoE,KAAKC,IAAI6M,EAAGhS,KAAKc,QAErB,IAAN+D,EAAS,CACX,IAAIgQ,EAAO,SAAc,WAAchQ,GAAMA,EAC7C7E,KAAKgE,MAAMhE,KAAKc,OAAS,IAAM+T,EAGjC,OAAO7U,KAAKmG,SAIdlH,EAAGyC,UAAU2T,MAAQ,SAAgBf,GACnC,OAAOtU,KAAK8G,QAAQsO,OAAOd,IAI7BrV,EAAGyC,UAAUmI,MAAQ,SAAgBxE,GAGnC,OAFApC,EAAsB,iBAARoC,GACdpC,EAAOoC,EAAM,UACTA,EAAM,EAAUrF,KAAKsV,OAAOjQ,GAGV,IAAlBrF,KAAK+D,SACa,IAAhB/D,KAAKc,SAAiC,EAAhBd,KAAKgE,MAAM,IAAUqB,GAC7CrF,KAAKgE,MAAM,GAAKqB,GAAuB,EAAhBrF,KAAKgE,MAAM,IAClChE,KAAK+D,SAAW,EACT/D,OAGTA,KAAK+D,SAAW,EAChB/D,KAAKsV,MAAMjQ,GACXrF,KAAK+D,SAAW,EACT/D,MAIFA,KAAK0G,OAAOrB,IAGrBpG,EAAGyC,UAAUgF,OAAS,SAAiBrB,GACrCrF,KAAKgE,MAAM,IAAMqB,EAGjB,IAAK,IAAID,EAAI,EAAGA,EAAIpF,KAAKc,QAAUd,KAAKgE,MAAMoB,IAAM,SAAWA,IAC7DpF,KAAKgE,MAAMoB,IAAM,SACbA,IAAMpF,KAAKc,OAAS,EACtBd,KAAKgE,MAAMoB,EAAI,GAAK,EAEpBpF,KAAKgE,MAAMoB,EAAI,KAKnB,OAFApF,KAAKc,OAASoE,KAAKI,IAAItF,KAAKc,OAAQsE,EAAI,GAEjCpF,MAITf,EAAGyC,UAAU4T,MAAQ,SAAgBjQ,GAGnC,GAFApC,EAAsB,iBAARoC,GACdpC,EAAOoC,EAAM,UACTA,EAAM,EAAG,OAAOrF,KAAK6J,OAAOxE,GAEhC,GAAsB,IAAlBrF,KAAK+D,SAIP,OAHA/D,KAAK+D,SAAW,EAChB/D,KAAK6J,MAAMxE,GACXrF,KAAK+D,SAAW,EACT/D,KAKT,GAFAA,KAAKgE,MAAM,IAAMqB,EAEG,IAAhBrF,KAAKc,QAAgBd,KAAKgE,MAAM,GAAK,EACvChE,KAAKgE,MAAM,IAAMhE,KAAKgE,MAAM,GAC5BhE,KAAK+D,SAAW,OAGhB,IAAK,IAAIqB,EAAI,EAAGA,EAAIpF,KAAKc,QAAUd,KAAKgE,MAAMoB,GAAK,EAAGA,IACpDpF,KAAKgE,MAAMoB,IAAM,SACjBpF,KAAKgE,MAAMoB,EAAI,IAAM,EAIzB,OAAOpF,KAAKmG,SAGdlH,EAAGyC,UAAU6T,KAAO,SAAelQ,GACjC,OAAOrF,KAAK8G,QAAQ+C,MAAMxE,IAG5BpG,EAAGyC,UAAU8T,KAAO,SAAenQ,GACjC,OAAOrF,KAAK8G,QAAQwO,MAAMjQ,IAG5BpG,EAAGyC,UAAU+T,KAAO,WAGlB,OAFAzV,KAAK+D,SAAW,EAET/D,MAGTf,EAAGyC,UAAUiI,IAAM,WACjB,OAAO3J,KAAK8G,QAAQ2O,QAGtBxW,EAAGyC,UAAUgU,aAAe,SAAuBrQ,EAAKhD,EAAKsT,GAC3D,IACIvQ,EAIAa,EALAzF,EAAM6E,EAAIvE,OAAS6U,EAGvB3V,KAAK+G,QAAQvG,GAGb,IAAImH,EAAQ,EACZ,IAAKvC,EAAI,EAAGA,EAAIC,EAAIvE,OAAQsE,IAAK,CAC/Ba,GAA6B,EAAxBjG,KAAKgE,MAAMoB,EAAIuQ,IAAchO,EAClC,IAAInC,GAAwB,EAAfH,EAAIrB,MAAMoB,IAAU/C,EAEjCsF,IADA1B,GAAa,SAART,IACS,KAAQA,EAAQ,SAAa,GAC3CxF,KAAKgE,MAAMoB,EAAIuQ,GAAa,SAAJ1P,EAE1B,KAAOb,EAAIpF,KAAKc,OAAS6U,EAAOvQ,IAE9BuC,GADA1B,GAA6B,EAAxBjG,KAAKgE,MAAMoB,EAAIuQ,IAAchO,IACrB,GACb3H,KAAKgE,MAAMoB,EAAIuQ,GAAa,SAAJ1P,EAG1B,GAAc,IAAV0B,EAAa,OAAO3H,KAAKmG,QAK7B,IAFAlD,GAAkB,IAAX0E,GACPA,EAAQ,EACHvC,EAAI,EAAGA,EAAIpF,KAAKc,OAAQsE,IAE3BuC,GADA1B,IAAsB,EAAhBjG,KAAKgE,MAAMoB,IAAUuC,IACd,GACb3H,KAAKgE,MAAMoB,GAAS,SAAJa,EAIlB,OAFAjG,KAAK+D,SAAW,EAET/D,KAAKmG,SAGdlH,EAAGyC,UAAUkU,SAAW,SAAmBvQ,EAAKwQ,GAC9C,IAAIF,GAAQ3V,KAAKc,OAASuE,EAAIvE,QAE1B0G,EAAIxH,KAAK8G,QACTW,EAAIpC,EAGJyQ,EAA8B,EAAxBrO,EAAEzD,MAAMyD,EAAE3G,OAAS,GAGf,KADd6U,EAAQ,GADM3V,KAAKmJ,WAAW2M,MAG5BrO,EAAIA,EAAEwN,MAAMU,GACZnO,EAAE6M,OAAOsB,GACTG,EAA8B,EAAxBrO,EAAEzD,MAAMyD,EAAE3G,OAAS,IAI3B,IACIiI,EADAiK,EAAIxL,EAAE1G,OAAS2G,EAAE3G,OAGrB,GAAa,QAAT+U,EAAgB,EAClB9M,EAAI,IAAI9J,EAAG,OACT6B,OAASkS,EAAI,EACfjK,EAAE/E,MAAQ,IAAIvD,MAAMsI,EAAEjI,QACtB,IAAK,IAAIsE,EAAI,EAAGA,EAAI2D,EAAEjI,OAAQsE,IAC5B2D,EAAE/E,MAAMoB,GAAK,EAIjB,IAAI2Q,EAAOvO,EAAEV,QAAQ4O,aAAajO,EAAG,EAAGuL,GAClB,IAAlB+C,EAAKhS,WACPyD,EAAIuO,EACAhN,IACFA,EAAE/E,MAAMgP,GAAK,IAIjB,IAAK,IAAIhN,EAAIgN,EAAI,EAAGhN,GAAK,EAAGA,IAAK,CAC/B,IAAIgQ,EAAmC,UAAL,EAAxBxO,EAAExD,MAAMyD,EAAE3G,OAASkF,KACE,EAA5BwB,EAAExD,MAAMyD,EAAE3G,OAASkF,EAAI,IAO1B,IAHAgQ,EAAK9Q,KAAKC,IAAK6Q,EAAKF,EAAO,EAAG,UAE9BtO,EAAEkO,aAAajO,EAAGuO,EAAIhQ,GACA,IAAfwB,EAAEzD,UACPiS,IACAxO,EAAEzD,SAAW,EACbyD,EAAEkO,aAAajO,EAAG,EAAGzB,GAChBwB,EAAEW,WACLX,EAAEzD,UAAY,GAGdgF,IACFA,EAAE/E,MAAMgC,GAAKgQ,GAajB,OAVIjN,GACFA,EAAE5C,QAEJqB,EAAErB,QAGW,QAAT0P,GAA4B,IAAVF,GACpBnO,EAAEyB,OAAO0M,GAGJ,CACLM,IAAKlN,GAAK,KACVxC,IAAKiB,IAQTvI,EAAGyC,UAAUwU,OAAS,SAAiB7Q,EAAKwQ,EAAMM,GAGhD,OAFAlT,GAAQoC,EAAI8C,UAERnI,KAAKmI,SACA,CACL8N,IAAK,IAAIhX,EAAG,GACZsH,IAAK,IAAItH,EAAG,IAKM,IAAlBe,KAAK+D,UAAmC,IAAjBsB,EAAItB,UAC7B+E,EAAM9I,KAAKmK,MAAM+L,OAAO7Q,EAAKwQ,GAEhB,QAATA,IACFI,EAAMnN,EAAImN,IAAI9L,OAGH,QAAT0L,IACFtP,EAAMuC,EAAIvC,IAAI4D,MACVgM,GAA6B,IAAjB5P,EAAIxC,UAClBwC,EAAI8E,KAAKhG,IAIN,CACL4Q,IAAKA,EACL1P,IAAKA,IAIa,IAAlBvG,KAAK+D,UAAmC,IAAjBsB,EAAItB,UAC7B+E,EAAM9I,KAAKkW,OAAO7Q,EAAI8E,MAAO0L,GAEhB,QAATA,IACFI,EAAMnN,EAAImN,IAAI9L,OAGT,CACL8L,IAAKA,EACL1P,IAAKuC,EAAIvC,MAI0B,IAAlCvG,KAAK+D,SAAWsB,EAAItB,WACvB+E,EAAM9I,KAAKmK,MAAM+L,OAAO7Q,EAAI8E,MAAO0L,GAEtB,QAATA,IACFtP,EAAMuC,EAAIvC,IAAI4D,MACVgM,GAA6B,IAAjB5P,EAAIxC,UAClBwC,EAAI+E,KAAKjG,IAIN,CACL4Q,IAAKnN,EAAImN,IACT1P,IAAKA,IAOLlB,EAAIvE,OAASd,KAAKc,QAAUd,KAAKyF,IAAIJ,GAAO,EACvC,CACL4Q,IAAK,IAAIhX,EAAG,GACZsH,IAAKvG,MAKU,IAAfqF,EAAIvE,OACO,QAAT+U,EACK,CACLI,IAAKjW,KAAKoW,KAAK/Q,EAAIrB,MAAM,IACzBuC,IAAK,MAII,QAATsP,EACK,CACLI,IAAK,KACL1P,IAAK,IAAItH,EAAGe,KAAKoI,KAAK/C,EAAIrB,MAAM,MAI7B,CACLiS,IAAKjW,KAAKoW,KAAK/Q,EAAIrB,MAAM,IACzBuC,IAAK,IAAItH,EAAGe,KAAKoI,KAAK/C,EAAIrB,MAAM,MAI7BhE,KAAK4V,SAASvQ,EAAKwQ,GAlF1B,IAAII,EAAK1P,EAAKuC,GAsFhB7J,EAAGyC,UAAUuU,IAAM,SAAc5Q,GAC/B,OAAOrF,KAAKkW,OAAO7Q,EAAK,OAAO,GAAO4Q,KAIxChX,EAAGyC,UAAU6E,IAAM,SAAclB,GAC/B,OAAOrF,KAAKkW,OAAO7Q,EAAK,OAAO,GAAOkB,KAGxCtH,EAAGyC,UAAU2U,KAAO,SAAehR,GACjC,OAAOrF,KAAKkW,OAAO7Q,EAAK,OAAO,GAAMkB,KAIvCtH,EAAGyC,UAAU4U,SAAW,SAAmBjR,GACzC,IAAIkR,EAAKvW,KAAKkW,OAAO7Q,GAGrB,GAAIkR,EAAGhQ,IAAI4B,SAAU,OAAOoO,EAAGN,IAE/B,IAAI1P,EAA0B,IAApBgQ,EAAGN,IAAIlS,SAAiBwS,EAAGhQ,IAAI+E,KAAKjG,GAAOkR,EAAGhQ,IAEpDiQ,EAAOnR,EAAI8P,MAAM,GACjBsB,EAAKpR,EAAI2D,MAAM,GACfvD,EAAMc,EAAId,IAAI+Q,GAGlB,OAAI/Q,EAAM,GAAY,IAAPgR,GAAoB,IAARhR,EAAkB8Q,EAAGN,IAGrB,IAApBM,EAAGN,IAAIlS,SAAiBwS,EAAGN,IAAIX,MAAM,GAAKiB,EAAGN,IAAIpM,MAAM,IAGhE5K,EAAGyC,UAAU0G,KAAO,SAAe/C,GACjCpC,EAAOoC,GAAO,UAId,IAHA,IAAIiN,GAAK,GAAK,IAAMjN,EAEhBqR,EAAM,EACDtR,EAAIpF,KAAKc,OAAS,EAAGsE,GAAK,EAAGA,IACpCsR,GAAOpE,EAAIoE,GAAuB,EAAhB1W,KAAKgE,MAAMoB,KAAWC,EAG1C,OAAOqR,GAITzX,EAAGyC,UAAU2G,MAAQ,SAAgBhD,GACnCpC,EAAOoC,GAAO,UAGd,IADA,IAAIsC,EAAQ,EACHvC,EAAIpF,KAAKc,OAAS,EAAGsE,GAAK,EAAGA,IAAK,CACzC,IAAIa,GAAqB,EAAhBjG,KAAKgE,MAAMoB,IAAkB,SAARuC,EAC9B3H,KAAKgE,MAAMoB,GAAMa,EAAIZ,EAAO,EAC5BsC,EAAQ1B,EAAIZ,EAGd,OAAOrF,KAAKmG,SAGdlH,EAAGyC,UAAU0U,KAAO,SAAe/Q,GACjC,OAAOrF,KAAK8G,QAAQuB,MAAMhD,IAG5BpG,EAAGyC,UAAUiV,KAAO,SAAerE,GACjCrP,EAAsB,IAAfqP,EAAEvO,UACTd,GAAQqP,EAAEnK,UAEV,IAAI4I,EAAI/Q,KACJgR,EAAIsB,EAAExL,QAGRiK,EADiB,IAAfA,EAAEhN,SACAgN,EAAEsF,KAAK/D,GAEPvB,EAAEjK,QAaR,IATA,IAAI8P,EAAI,IAAI3X,EAAG,GACX4X,EAAI,IAAI5X,EAAG,GAGX6X,EAAI,IAAI7X,EAAG,GACX8X,EAAI,IAAI9X,EAAG,GAEX+X,EAAI,EAEDjG,EAAEkG,UAAYjG,EAAEiG,UACrBlG,EAAE9H,OAAO,GACT+H,EAAE/H,OAAO,KACP+N,EAMJ,IAHA,IAAIE,EAAKlG,EAAElK,QACPqQ,EAAKpG,EAAEjK,SAEHiK,EAAE5I,UAAU,CAClB,IAAK,IAAI/C,EAAI,EAAGgS,EAAK,EAAyB,IAArBrG,EAAE/M,MAAM,GAAKoT,IAAahS,EAAI,KAAMA,EAAGgS,IAAO,GACvE,GAAIhS,EAAI,EAEN,IADA2L,EAAE9H,OAAO7D,GACFA,KAAM,IACPwR,EAAES,SAAWR,EAAEQ,WACjBT,EAAEvL,KAAK6L,GACPL,EAAEvL,KAAK6L,IAGTP,EAAE3N,OAAO,GACT4N,EAAE5N,OAAO,GAIb,IAAK,IAAIjD,EAAI,EAAGsR,EAAK,EAAyB,IAArBtG,EAAEhN,MAAM,GAAKsT,IAAatR,EAAI,KAAMA,EAAGsR,IAAO,GACvE,GAAItR,EAAI,EAEN,IADAgL,EAAE/H,OAAOjD,GACFA,KAAM,IACP8Q,EAAEO,SAAWN,EAAEM,WACjBP,EAAEzL,KAAK6L,GACPH,EAAEzL,KAAK6L,IAGTL,EAAE7N,OAAO,GACT8N,EAAE9N,OAAO,GAIT8H,EAAEtL,IAAIuL,IAAM,GACdD,EAAEzF,KAAK0F,GACP4F,EAAEtL,KAAKwL,GACPD,EAAEvL,KAAKyL,KAEP/F,EAAE1F,KAAKyF,GACP+F,EAAExL,KAAKsL,GACPG,EAAEzL,KAAKuL,IAIX,MAAO,CACLrP,EAAGsP,EACHrP,EAAGsP,EACHQ,IAAKvG,EAAEqD,OAAO2C,KAOlB/X,EAAGyC,UAAU8V,OAAS,SAAiBlF,GACrCrP,EAAsB,IAAfqP,EAAEvO,UACTd,GAAQqP,EAAEnK,UAEV,IAAIX,EAAIxH,KACJyH,EAAI6K,EAAExL,QAGRU,EADiB,IAAfA,EAAEzD,SACAyD,EAAE6O,KAAK/D,GAEP9K,EAAEV,QAQR,IALA,IAuCIgC,EAvCA2O,EAAK,IAAIxY,EAAG,GACZyY,EAAK,IAAIzY,EAAG,GAEZ0Y,EAAQlQ,EAAEX,QAEPU,EAAEoQ,KAAK,GAAK,GAAKnQ,EAAEmQ,KAAK,GAAK,GAAG,CACrC,IAAK,IAAIxS,EAAI,EAAGgS,EAAK,EAAyB,IAArB5P,EAAExD,MAAM,GAAKoT,IAAahS,EAAI,KAAMA,EAAGgS,IAAO,GACvE,GAAIhS,EAAI,EAEN,IADAoC,EAAEyB,OAAO7D,GACFA,KAAM,GACPqS,EAAGJ,SACLI,EAAGpM,KAAKsM,GAGVF,EAAGxO,OAAO,GAId,IAAK,IAAIjD,EAAI,EAAGsR,EAAK,EAAyB,IAArB7P,EAAEzD,MAAM,GAAKsT,IAAatR,EAAI,KAAMA,EAAGsR,IAAO,GACvE,GAAItR,EAAI,EAEN,IADAyB,EAAEwB,OAAOjD,GACFA,KAAM,GACP0R,EAAGL,SACLK,EAAGrM,KAAKsM,GAGVD,EAAGzO,OAAO,GAIVzB,EAAE/B,IAAIgC,IAAM,GACdD,EAAE8D,KAAK7D,GACPgQ,EAAGnM,KAAKoM,KAERjQ,EAAE6D,KAAK9D,GACPkQ,EAAGpM,KAAKmM,IAeZ,OATE3O,EADgB,IAAdtB,EAAEoQ,KAAK,GACHH,EAEAC,GAGAE,KAAK,GAAK,GAChB9O,EAAIuC,KAAKiH,GAGJxJ,GAGT7J,EAAGyC,UAAU6V,IAAM,SAAclS,GAC/B,GAAIrF,KAAKmI,SAAU,OAAO9C,EAAIsE,MAC9B,GAAItE,EAAI8C,SAAU,OAAOnI,KAAK2J,MAE9B,IAAInC,EAAIxH,KAAK8G,QACTW,EAAIpC,EAAIyB,QACZU,EAAEzD,SAAW,EACb0D,EAAE1D,SAAW,EAGb,IAAK,IAAI4R,EAAQ,EAAGnO,EAAEyP,UAAYxP,EAAEwP,SAAUtB,IAC5CnO,EAAEyB,OAAO,GACTxB,EAAEwB,OAAO,GAGX,OAAG,CACD,KAAOzB,EAAEyP,UACPzP,EAAEyB,OAAO,GAEX,KAAOxB,EAAEwP,UACPxP,EAAEwB,OAAO,GAGX,IAAIpE,EAAI2C,EAAE/B,IAAIgC,GACd,GAAI5C,EAAI,EAAG,CAET,IAAIuE,EAAI5B,EACRA,EAAIC,EACJA,EAAI2B,OACC,GAAU,IAANvE,GAAyB,IAAd4C,EAAEmQ,KAAK,GAC3B,MAGFpQ,EAAE8D,KAAK7D,GAGT,OAAOA,EAAE4M,OAAOsB,IAIlB1W,EAAGyC,UAAUmW,KAAO,SAAexS,GACjC,OAAOrF,KAAK2W,KAAKtR,GAAKmC,EAAE6O,KAAKhR,IAG/BpG,EAAGyC,UAAUuV,OAAS,WACpB,OAA+B,IAAP,EAAhBjX,KAAKgE,MAAM,KAGrB/E,EAAGyC,UAAU2V,MAAQ,WACnB,OAA+B,IAAP,EAAhBrX,KAAKgE,MAAM,KAIrB/E,EAAGyC,UAAUsH,MAAQ,SAAgB3D,GACnC,OAAOrF,KAAKgE,MAAM,GAAKqB,GAIzBpG,EAAGyC,UAAUoW,MAAQ,SAAgB3M,GACnClI,EAAsB,iBAARkI,GACd,IAAItG,EAAIsG,EAAM,GACV6G,GAAK7G,EAAMtG,GAAK,GAChBkE,EAAI,GAAKlE,EAGb,GAAI7E,KAAKc,QAAUkR,EAGjB,OAFAhS,KAAK+G,QAAQiL,EAAI,GACjBhS,KAAKgE,MAAMgO,IAAMjJ,EACV/I,KAKT,IADA,IAAI2H,EAAQoB,EACH3D,EAAI4M,EAAa,IAAVrK,GAAevC,EAAIpF,KAAKc,OAAQsE,IAAK,CACnD,IAAIa,EAAoB,EAAhBjG,KAAKgE,MAAMoB,GAEnBuC,GADA1B,GAAK0B,KACS,GACd1B,GAAK,SACLjG,KAAKgE,MAAMoB,GAAKa,EAMlB,OAJc,IAAV0B,IACF3H,KAAKgE,MAAMoB,GAAKuC,EAChB3H,KAAKc,UAEAd,MAGTf,EAAGyC,UAAUyG,OAAS,WACpB,OAAuB,IAAhBnI,KAAKc,QAAkC,IAAlBd,KAAKgE,MAAM,IAGzC/E,EAAGyC,UAAUkW,KAAO,SAAevS,GACjC,IAOIyD,EAPA/E,EAAWsB,EAAM,EAErB,GAAsB,IAAlBrF,KAAK+D,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlB/D,KAAK+D,UAAkBA,EAAU,OAAO,EAK5C,GAHA/D,KAAKmG,QAGDnG,KAAKc,OAAS,EAChBgI,EAAM,MACD,CACD/E,IACFsB,GAAOA,GAGTpC,EAAOoC,GAAO,SAAW,qBAEzB,IAAIY,EAAoB,EAAhBjG,KAAKgE,MAAM,GACnB8E,EAAM7C,IAAMZ,EAAM,EAAIY,EAAIZ,GAAO,EAAI,EAEvC,OAAsB,IAAlBrF,KAAK+D,SAA8B,GAAN+E,EAC1BA,GAOT7J,EAAGyC,UAAU+D,IAAM,SAAcJ,GAC/B,GAAsB,IAAlBrF,KAAK+D,UAAmC,IAAjBsB,EAAItB,SAAgB,OAAQ,EACvD,GAAsB,IAAlB/D,KAAK+D,UAAmC,IAAjBsB,EAAItB,SAAgB,OAAO,EAEtD,IAAI+E,EAAM9I,KAAK+X,KAAK1S,GACpB,OAAsB,IAAlBrF,KAAK+D,SAA8B,GAAN+E,EAC1BA,GAIT7J,EAAGyC,UAAUqW,KAAO,SAAe1S,GAEjC,GAAIrF,KAAKc,OAASuE,EAAIvE,OAAQ,OAAO,EACrC,GAAId,KAAKc,OAASuE,EAAIvE,OAAQ,OAAQ,EAGtC,IADA,IAAIgI,EAAM,EACD1D,EAAIpF,KAAKc,OAAS,EAAGsE,GAAK,EAAGA,IAAK,CACzC,IAAIoC,EAAoB,EAAhBxH,KAAKgE,MAAMoB,GACfqC,EAAmB,EAAfpC,EAAIrB,MAAMoB,GAElB,GAAIoC,IAAMC,EAAV,CACID,EAAIC,EACNqB,GAAO,EACEtB,EAAIC,IACbqB,EAAM,GAER,OAEF,OAAOA,GAGT7J,EAAGyC,UAAUsW,IAAM,SAAc3S,GAC/B,OAA0B,IAAnBrF,KAAK4X,KAAKvS,IAGnBpG,EAAGyC,UAAUuW,GAAK,SAAa5S,GAC7B,OAAyB,IAAlBrF,KAAKyF,IAAIJ,IAGlBpG,EAAGyC,UAAUwW,KAAO,SAAe7S,GACjC,OAAOrF,KAAK4X,KAAKvS,IAAQ,GAG3BpG,EAAGyC,UAAUyW,IAAM,SAAc9S,GAC/B,OAAOrF,KAAKyF,IAAIJ,IAAQ,GAG1BpG,EAAGyC,UAAU0W,IAAM,SAAc/S,GAC/B,OAA2B,IAApBrF,KAAK4X,KAAKvS,IAGnBpG,EAAGyC,UAAU2W,GAAK,SAAahT,GAC7B,OAA0B,IAAnBrF,KAAKyF,IAAIJ,IAGlBpG,EAAGyC,UAAU4W,KAAO,SAAejT,GACjC,OAAOrF,KAAK4X,KAAKvS,IAAQ,GAG3BpG,EAAGyC,UAAU6W,IAAM,SAAclT,GAC/B,OAAOrF,KAAKyF,IAAIJ,IAAQ,GAG1BpG,EAAGyC,UAAU8W,IAAM,SAAcnT,GAC/B,OAA0B,IAAnBrF,KAAK4X,KAAKvS,IAGnBpG,EAAGyC,UAAU+W,GAAK,SAAapT,GAC7B,OAAyB,IAAlBrF,KAAKyF,IAAIJ,IAOlBpG,EAAGgF,IAAM,SAAcoB,GACrB,OAAO,IAAIqT,EAAIrT,IAGjBpG,EAAGyC,UAAUiX,MAAQ,SAAgBC,GAGnC,OAFA3V,GAAQjD,KAAKiE,IAAK,yCAClBhB,EAAyB,IAAlBjD,KAAK+D,SAAgB,iCACrB6U,EAAIC,UAAU7Y,MAAM8Y,UAAUF,IAGvC3Z,EAAGyC,UAAUqX,QAAU,WAErB,OADA9V,EAAOjD,KAAKiE,IAAK,wDACVjE,KAAKiE,IAAI+U,YAAYhZ,OAG9Bf,EAAGyC,UAAUoX,UAAY,SAAoBF,GAE3C,OADA5Y,KAAKiE,IAAM2U,EACJ5Y,MAGTf,EAAGyC,UAAUuX,SAAW,SAAmBL,GAEzC,OADA3V,GAAQjD,KAAKiE,IAAK,yCACXjE,KAAK8Y,UAAUF,IAGxB3Z,EAAGyC,UAAUwX,OAAS,SAAiB7T,GAErC,OADApC,EAAOjD,KAAKiE,IAAK,sCACVjE,KAAKiE,IAAIsH,IAAIvL,KAAMqF,IAG5BpG,EAAGyC,UAAUyX,QAAU,SAAkB9T,GAEvC,OADApC,EAAOjD,KAAKiE,IAAK,uCACVjE,KAAKiE,IAAIoH,KAAKrL,KAAMqF,IAG7BpG,EAAGyC,UAAU0X,OAAS,SAAiB/T,GAErC,OADApC,EAAOjD,KAAKiE,IAAK,sCACVjE,KAAKiE,IAAIuH,IAAIxL,KAAMqF,IAG5BpG,EAAGyC,UAAU2X,QAAU,SAAkBhU,GAEvC,OADApC,EAAOjD,KAAKiE,IAAK,uCACVjE,KAAKiE,IAAIqH,KAAKtL,KAAMqF,IAG7BpG,EAAGyC,UAAU4X,OAAS,SAAiBjU,GAErC,OADApC,EAAOjD,KAAKiE,IAAK,sCACVjE,KAAKiE,IAAIsV,IAAIvZ,KAAMqF,IAG5BpG,EAAGyC,UAAU8X,OAAS,SAAiBnU,GAGrC,OAFApC,EAAOjD,KAAKiE,IAAK,sCACjBjE,KAAKiE,IAAIwV,SAASzZ,KAAMqF,GACjBrF,KAAKiE,IAAI5B,IAAIrC,KAAMqF,IAG5BpG,EAAGyC,UAAUgY,QAAU,SAAkBrU,GAGvC,OAFApC,EAAOjD,KAAKiE,IAAK,sCACjBjE,KAAKiE,IAAIwV,SAASzZ,KAAMqF,GACjBrF,KAAKiE,IAAIwL,KAAKzP,KAAMqF,IAG7BpG,EAAGyC,UAAUiY,OAAS,WAGpB,OAFA1W,EAAOjD,KAAKiE,IAAK,sCACjBjE,KAAKiE,IAAI2V,SAAS5Z,MACXA,KAAKiE,IAAIiQ,IAAIlU,OAGtBf,EAAGyC,UAAUmY,QAAU,WAGrB,OAFA5W,EAAOjD,KAAKiE,IAAK,uCACjBjE,KAAKiE,IAAI2V,SAAS5Z,MACXA,KAAKiE,IAAIkQ,KAAKnU,OAIvBf,EAAGyC,UAAUoY,QAAU,WAGrB,OAFA7W,EAAOjD,KAAKiE,IAAK,uCACjBjE,KAAKiE,IAAI2V,SAAS5Z,MACXA,KAAKiE,IAAI8V,KAAK/Z,OAGvBf,EAAGyC,UAAUsY,QAAU,WAGrB,OAFA/W,EAAOjD,KAAKiE,IAAK,uCACjBjE,KAAKiE,IAAI2V,SAAS5Z,MACXA,KAAKiE,IAAI4T,KAAK7X,OAIvBf,EAAGyC,UAAUuY,OAAS,WAGpB,OAFAhX,EAAOjD,KAAKiE,IAAK,sCACjBjE,KAAKiE,IAAI2V,SAAS5Z,MACXA,KAAKiE,IAAIkG,IAAInK,OAGtBf,EAAGyC,UAAUwY,OAAS,SAAiB7U,GAGrC,OAFApC,EAAOjD,KAAKiE,MAAQoB,EAAIpB,IAAK,qBAC7BjE,KAAKiE,IAAI2V,SAAS5Z,MACXA,KAAKiE,IAAI0C,IAAI3G,KAAMqF,IAI5B,IAAI8U,EAAS,CACXC,KAAM,KACNjZ,KAAM,KACNG,KAAM,KACN+Y,OAAQ,MAIV,SAASC,EAAQ9a,EAAM8S,GAErBtS,KAAKR,KAAOA,EACZQ,KAAKsS,EAAI,IAAIrT,EAAGqT,EAAG,IACnBtS,KAAK+S,EAAI/S,KAAKsS,EAAEhJ,YAChBtJ,KAAK4H,EAAI,IAAI3I,EAAG,GAAGoV,OAAOrU,KAAK+S,GAAGzH,KAAKtL,KAAKsS,GAE5CtS,KAAKua,IAAMva,KAAKwa,OAiDlB,SAASC,IACPH,EAAOI,KACL1a,KACA,OACA,2EA+DJ,SAAS2a,IACPL,EAAOI,KACL1a,KACA,OACA,kEAIJ,SAAS4a,IACPN,EAAOI,KACL1a,KACA,OACA,yDAIJ,SAAS6a,IAEPP,EAAOI,KACL1a,KACA,QACA,uEA8CJ,SAAS0Y,EAAK1F,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAI8H,EAAQ7b,EAAG8b,OAAO/H,GACtBhT,KAAKgT,EAAI8H,EAAMxI,EACftS,KAAK8a,MAAQA,OAEb7X,EAAO+P,EAAEgF,IAAI,GAAI,kCACjBhY,KAAKgT,EAAIA,EACThT,KAAK8a,MAAQ,KAkOjB,SAASE,EAAMhI,GACb0F,EAAIgC,KAAK1a,KAAMgT,GAEfhT,KAAK2V,MAAQ3V,KAAKgT,EAAE1J,YAChBtJ,KAAK2V,MAAQ,IAAO,IACtB3V,KAAK2V,OAAS,GAAM3V,KAAK2V,MAAQ,IAGnC3V,KAAK6E,EAAI,IAAI5F,EAAG,GAAGoV,OAAOrU,KAAK2V,OAC/B3V,KAAKyW,GAAKzW,KAAKib,KAAKjb,KAAK6E,EAAEqP,OAC3BlU,KAAKkb,KAAOlb,KAAK6E,EAAE2S,OAAOxX,KAAKgT,GAE/BhT,KAAKmb,KAAOnb,KAAKkb,KAAK7Y,IAAIrC,KAAK6E,GAAGyQ,MAAM,GAAGW,IAAIjW,KAAKgT,GACpDhT,KAAKmb,KAAOnb,KAAKmb,KAAK9E,KAAKrW,KAAK6E,GAChC7E,KAAKmb,KAAOnb,KAAK6E,EAAE2G,IAAIxL,KAAKmb,MA5a9Bb,EAAO5Y,UAAU8Y,KAAO,WACtB,IAAID,EAAM,IAAItb,EAAG,MAEjB,OADAsb,EAAIvW,MAAQ,IAAIvD,MAAMyE,KAAKa,KAAK/F,KAAK+S,EAAI,KAClCwH,GAGTD,EAAO5Y,UAAU0Z,QAAU,SAAkB/V,GAG3C,IACIgW,EADAxW,EAAIQ,EAGR,GACErF,KAAKsb,MAAMzW,EAAG7E,KAAKua,KAGnBc,GADAxW,GADAA,EAAI7E,KAAKub,MAAM1W,IACTwG,KAAKrL,KAAKua,MACPjR,kBACF+R,EAAOrb,KAAK+S,GAErB,IAAItN,EAAM4V,EAAOrb,KAAK+S,GAAK,EAAIlO,EAAEkT,KAAK/X,KAAKsS,GAgB3C,OAfY,IAAR7M,GACFZ,EAAEb,MAAM,GAAK,EACba,EAAE/D,OAAS,GACF2E,EAAM,EACfZ,EAAEyG,KAAKtL,KAAKsS,QAEIkJ,IAAZ3W,EAAEsB,MAEJtB,EAAEsB,QAGFtB,EAAE4W,SAIC5W,GAGTyV,EAAO5Y,UAAU4Z,MAAQ,SAAgBI,EAAOnU,GAC9CmU,EAAMzS,OAAOjJ,KAAK+S,EAAG,EAAGxL,IAG1B+S,EAAO5Y,UAAU6Z,MAAQ,SAAgBlW,GACvC,OAAOA,EAAIoK,KAAKzP,KAAK4H,IASvBvE,EAASoX,EAAMH,GAEfG,EAAK/Y,UAAU4Z,MAAQ,SAAgBI,EAAOC,GAK5C,IAHA,IAEIC,EAAS1W,KAAKC,IAAIuW,EAAM5a,OAAQ,GAC3BsE,EAAI,EAAGA,EAAIwW,EAAQxW,IAC1BuW,EAAO3X,MAAMoB,GAAKsW,EAAM1X,MAAMoB,GAIhC,GAFAuW,EAAO7a,OAAS8a,EAEZF,EAAM5a,QAAU,EAGlB,OAFA4a,EAAM1X,MAAM,GAAK,OACjB0X,EAAM5a,OAAS,GAKjB,IAAI+a,EAAOH,EAAM1X,MAAM,GAGvB,IAFA2X,EAAO3X,MAAM2X,EAAO7a,UAhBT,QAgBqB+a,EAE3BzW,EAAI,GAAIA,EAAIsW,EAAM5a,OAAQsE,IAAK,CAClC,IAAI0W,EAAwB,EAAjBJ,EAAM1X,MAAMoB,GACvBsW,EAAM1X,MAAMoB,EAAI,KApBP,QAoBe0W,IAAgB,EAAMD,IAAS,GACvDA,EAAOC,EAETD,KAAU,GACVH,EAAM1X,MAAMoB,EAAI,IAAMyW,EACT,IAATA,GAAcH,EAAM5a,OAAS,GAC/B4a,EAAM5a,QAAU,GAEhB4a,EAAM5a,QAAU,GAIpB2Z,EAAK/Y,UAAU6Z,MAAQ,SAAgBlW,GAErCA,EAAIrB,MAAMqB,EAAIvE,QAAU,EACxBuE,EAAIrB,MAAMqB,EAAIvE,OAAS,GAAK,EAC5BuE,EAAIvE,QAAU,EAId,IADA,IAAI4G,EAAK,EACAtC,EAAI,EAAGA,EAAIC,EAAIvE,OAAQsE,IAAK,CACnC,IAAIa,EAAmB,EAAfZ,EAAIrB,MAAMoB,GAClBsC,GAAU,IAAJzB,EACNZ,EAAIrB,MAAMoB,GAAU,SAALsC,EACfA,EAAS,GAAJzB,GAAayB,EAAK,SAAa,GAUtC,OANkC,IAA9BrC,EAAIrB,MAAMqB,EAAIvE,OAAS,KACzBuE,EAAIvE,SAC8B,IAA9BuE,EAAIrB,MAAMqB,EAAIvE,OAAS,IACzBuE,EAAIvE,UAGDuE,GASThC,EAASsX,EAAML,GAQfjX,EAASuX,EAAMN,GASfjX,EAASwX,EAAQP,GAEjBO,EAAOnZ,UAAU6Z,MAAQ,SAAgBlW,GAGvC,IADA,IAAIsC,EAAQ,EACHvC,EAAI,EAAGA,EAAIC,EAAIvE,OAAQsE,IAAK,CACnC,IAAImE,EAA0B,IAAL,EAAflE,EAAIrB,MAAMoB,IAAiBuC,EACjCD,EAAU,SAAL6B,EACTA,KAAQ,GAERlE,EAAIrB,MAAMoB,GAAKsC,EACfC,EAAQ4B,EAKV,OAHc,IAAV5B,IACFtC,EAAIrB,MAAMqB,EAAIvE,UAAY6G,GAErBtC,GAITpG,EAAG8b,OAAS,SAAgBvb,GAE1B,GAAI2a,EAAO3a,GAAO,OAAO2a,EAAO3a,GAEhC,IAAIsb,EACJ,GAAa,SAATtb,EACFsb,EAAQ,IAAIL,OACP,GAAa,SAATjb,EACTsb,EAAQ,IAAIH,OACP,GAAa,SAATnb,EACTsb,EAAQ,IAAIF,MACP,IAAa,WAATpb,EAGT,MAAM,IAAI4D,MAAM,iBAAmB5D,GAFnCsb,EAAQ,IAAID,EAMd,OAFAV,EAAO3a,GAAQsb,EAERA,GAkBTpC,EAAIhX,UAAUkY,SAAW,SAAmBpS,GAC1CvE,EAAsB,IAAfuE,EAAEzD,SAAgB,iCACzBd,EAAOuE,EAAEvD,IAAK,oCAGhByU,EAAIhX,UAAU+X,SAAW,SAAmBjS,EAAGC,GAC7CxE,EAAqC,IAA7BuE,EAAEzD,SAAW0D,EAAE1D,UAAiB,iCACxCd,EAAOuE,EAAEvD,KAAOuD,EAAEvD,MAAQwD,EAAExD,IAC1B,oCAGJyU,EAAIhX,UAAUuZ,KAAO,SAAezT,GAClC,OAAIxH,KAAK8a,MAAc9a,KAAK8a,MAAMM,QAAQ5T,GAAGsR,UAAU9Y,MAChDwH,EAAE6O,KAAKrW,KAAKgT,GAAG8F,UAAU9Y,OAGlC0Y,EAAIhX,UAAUyI,IAAM,SAAc3C,GAChC,OAAIA,EAAEW,SACGX,EAAEV,QAGJ9G,KAAKgT,EAAExH,IAAIhE,GAAGsR,UAAU9Y,OAGjC0Y,EAAIhX,UAAU6J,IAAM,SAAc/D,EAAGC,GACnCzH,KAAKyZ,SAASjS,EAAGC,GAEjB,IAAIqB,EAAMtB,EAAE+D,IAAI9D,GAIhB,OAHIqB,EAAIrD,IAAIzF,KAAKgT,IAAM,GACrBlK,EAAIwC,KAAKtL,KAAKgT,GAETlK,EAAIgQ,UAAU9Y,OAGvB0Y,EAAIhX,UAAU2J,KAAO,SAAe7D,EAAGC,GACrCzH,KAAKyZ,SAASjS,EAAGC,GAEjB,IAAIqB,EAAMtB,EAAE6D,KAAK5D,GAIjB,OAHIqB,EAAIrD,IAAIzF,KAAKgT,IAAM,GACrBlK,EAAIwC,KAAKtL,KAAKgT,GAETlK,GAGT4P,EAAIhX,UAAU8J,IAAM,SAAchE,EAAGC,GACnCzH,KAAKyZ,SAASjS,EAAGC,GAEjB,IAAIqB,EAAMtB,EAAEgE,IAAI/D,GAIhB,OAHIqB,EAAI8O,KAAK,GAAK,GAChB9O,EAAIuC,KAAKrL,KAAKgT,GAETlK,EAAIgQ,UAAU9Y,OAGvB0Y,EAAIhX,UAAU4J,KAAO,SAAe9D,EAAGC,GACrCzH,KAAKyZ,SAASjS,EAAGC,GAEjB,IAAIqB,EAAMtB,EAAE8D,KAAK7D,GAIjB,OAHIqB,EAAI8O,KAAK,GAAK,GAChB9O,EAAIuC,KAAKrL,KAAKgT,GAETlK,GAGT4P,EAAIhX,UAAU6X,IAAM,SAAc/R,EAAGnC,GAEnC,OADArF,KAAK4Z,SAASpS,GACPxH,KAAKib,KAAKzT,EAAEyN,MAAM5P,KAG3BqT,EAAIhX,UAAU+N,KAAO,SAAejI,EAAGC,GAErC,OADAzH,KAAKyZ,SAASjS,EAAGC,GACVzH,KAAKib,KAAKzT,EAAEiI,KAAKhI,KAG1BiR,EAAIhX,UAAUW,IAAM,SAAcmF,EAAGC,GAEnC,OADAzH,KAAKyZ,SAASjS,EAAGC,GACVzH,KAAKib,KAAKzT,EAAEnF,IAAIoF,KAGzBiR,EAAIhX,UAAUyS,KAAO,SAAe3M,GAClC,OAAOxH,KAAKyP,KAAKjI,EAAGA,EAAEV,UAGxB4R,EAAIhX,UAAUwS,IAAM,SAAc1M,GAChC,OAAOxH,KAAKqC,IAAImF,EAAGA,IAGrBkR,EAAIhX,UAAUqY,KAAO,SAAevS,GAClC,GAAIA,EAAEW,SAAU,OAAOX,EAAEV,QAEzB,IAAIiV,EAAO/b,KAAKgT,EAAEhK,MAAM,GAIxB,GAHA/F,EAAO8Y,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAIpV,EAAM3G,KAAKgT,EAAEzH,IAAI,IAAItM,EAAG,IAAIgK,OAAO,GACvC,OAAOjJ,KAAK2G,IAAIa,EAAGb,GAQrB,IAFA,IAAIoC,EAAI/I,KAAKgT,EAAEwC,KAAK,GAChBxD,EAAI,GACAjJ,EAAEZ,UAA2B,IAAfY,EAAEC,MAAM,IAC5BgJ,IACAjJ,EAAEE,OAAO,GAEXhG,GAAQ8F,EAAEZ,UAEV,IAAI6T,EAAM,IAAI/c,EAAG,GAAG0Z,MAAM3Y,MACtBic,EAAOD,EAAI/B,SAIXiC,EAAOlc,KAAKgT,EAAEwC,KAAK,GAAGvM,OAAO,GAC7BkT,EAAInc,KAAKgT,EAAE1J,YAGf,IAFA6S,EAAI,IAAIld,EAAG,EAAIkd,EAAIA,GAAGxD,MAAM3Y,MAEW,IAAhCA,KAAK2G,IAAIwV,EAAGD,GAAMzW,IAAIwW,IAC3BE,EAAEhD,QAAQ8C,GAOZ,IAJA,IAAIxX,EAAIzE,KAAK2G,IAAIwV,EAAGpT,GAChBlE,EAAI7E,KAAK2G,IAAIa,EAAGuB,EAAEwM,KAAK,GAAGtM,OAAO,IACjCG,EAAIpJ,KAAK2G,IAAIa,EAAGuB,GAChBiK,EAAIhB,EACc,IAAf5I,EAAE3D,IAAIuW,IAAY,CAEvB,IADA,IAAIzB,EAAMnR,EACDhE,EAAI,EAAoB,IAAjBmV,EAAI9U,IAAIuW,GAAY5W,IAClCmV,EAAMA,EAAIZ,SAEZ1W,EAAOmC,EAAI4N,GACX,IAAIvL,EAAIzH,KAAK2G,IAAIlC,EAAG,IAAIxF,EAAG,GAAGoV,OAAOrB,EAAI5N,EAAI,IAE7CP,EAAIA,EAAE2U,OAAO/R,GACbhD,EAAIgD,EAAEkS,SACNvQ,EAAIA,EAAEoQ,OAAO/U,GACbuO,EAAI5N,EAGN,OAAOP,GAGT6T,EAAIhX,UAAUmW,KAAO,SAAerQ,GAClC,IAAI4U,EAAM5U,EAAEgQ,OAAOxX,KAAKgT,GACxB,OAAqB,IAAjBoJ,EAAIrY,UACNqY,EAAIrY,SAAW,EACR/D,KAAKib,KAAKmB,GAAKnC,UAEfja,KAAKib,KAAKmB,IAIrB1D,EAAIhX,UAAUiF,IAAM,SAAca,EAAGnC,GACnC,GAAIA,EAAI8C,SAAU,OAAO,IAAIlJ,EAAG,GAAG0Z,MAAM3Y,MACzC,GAAoB,IAAhBqF,EAAIuS,KAAK,GAAU,OAAOpQ,EAAEV,QAEhC,IACIuV,EAAM,IAAI5b,MAAM,IACpB4b,EAAI,GAAK,IAAIpd,EAAG,GAAG0Z,MAAM3Y,MACzBqc,EAAI,GAAK7U,EACT,IAAK,IAAIpC,EAAI,EAAGA,EAAIiX,EAAIvb,OAAQsE,IAC9BiX,EAAIjX,GAAKpF,KAAKqC,IAAIga,EAAIjX,EAAI,GAAIoC,GAGhC,IAAIsB,EAAMuT,EAAI,GACVC,EAAU,EACVC,EAAa,EACbvX,EAAQK,EAAIiE,YAAc,GAK9B,IAJc,IAAVtE,IACFA,EAAQ,IAGLI,EAAIC,EAAIvE,OAAS,EAAGsE,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAIoB,EAAOnB,EAAIrB,MAAMoB,GACZY,EAAIhB,EAAQ,EAAGgB,GAAK,EAAGA,IAAK,CACnC,IAAImF,EAAO3E,GAAQR,EAAK,EACpB8C,IAAQuT,EAAI,KACdvT,EAAM9I,KAAKkU,IAAIpL,IAGL,IAARqC,GAAyB,IAAZmR,GAKjBA,IAAY,EACZA,GAAWnR,GA9BE,MA+BboR,GACwC,IAANnX,GAAiB,IAANY,KAE7C8C,EAAM9I,KAAKqC,IAAIyG,EAAKuT,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,EAajBvX,EAAQ,GAGV,OAAO8D,GAGT4P,EAAIhX,UAAUmX,UAAY,SAAoBxT,GAC5C,IAAIR,EAAIQ,EAAIgR,KAAKrW,KAAKgT,GAEtB,OAAOnO,IAAMQ,EAAMR,EAAEiC,QAAUjC,GAGjC6T,EAAIhX,UAAUsX,YAAc,SAAsB3T,GAChD,IAAIyD,EAAMzD,EAAIyB,QAEd,OADAgC,EAAI7E,IAAM,KACH6E,GAOT7J,EAAGud,KAAO,SAAenX,GACvB,OAAO,IAAI2V,EAAK3V,IAmBlBhC,EAAS2X,EAAMtC,GAEfsC,EAAKtZ,UAAUmX,UAAY,SAAoBxT,GAC7C,OAAOrF,KAAKib,KAAK5V,EAAI4P,MAAMjV,KAAK2V,SAGlCqF,EAAKtZ,UAAUsX,YAAc,SAAsB3T,GACjD,IAAIR,EAAI7E,KAAKib,KAAK5V,EAAIhD,IAAIrC,KAAKkb,OAE/B,OADArW,EAAEZ,IAAM,KACDY,GAGTmW,EAAKtZ,UAAU+N,KAAO,SAAejI,EAAGC,GACtC,GAAID,EAAEW,UAAYV,EAAEU,SAGlB,OAFAX,EAAExD,MAAM,GAAK,EACbwD,EAAE1G,OAAS,EACJ0G,EAGT,IAAI4B,EAAI5B,EAAEiI,KAAKhI,GACXhD,EAAI2E,EAAEiM,MAAMrV,KAAK2V,OAAOtT,IAAIrC,KAAKmb,MAAM/F,OAAOpV,KAAK2V,OAAOtT,IAAIrC,KAAKgT,GACnEyJ,EAAIrT,EAAEkC,KAAK7G,GAAGwE,OAAOjJ,KAAK2V,OAC1B7M,EAAM2T,EAQV,OANIA,EAAEhX,IAAIzF,KAAKgT,IAAM,EACnBlK,EAAM2T,EAAEnR,KAAKtL,KAAKgT,GACTyJ,EAAE7E,KAAK,GAAK,IACrB9O,EAAM2T,EAAEpR,KAAKrL,KAAKgT,IAGblK,EAAIgQ,UAAU9Y,OAGvBgb,EAAKtZ,UAAUW,IAAM,SAAcmF,EAAGC,GACpC,GAAID,EAAEW,UAAYV,EAAEU,SAAU,OAAO,IAAIlJ,EAAG,GAAG6Z,UAAU9Y,MAEzD,IAAIoJ,EAAI5B,EAAEnF,IAAIoF,GACVhD,EAAI2E,EAAEiM,MAAMrV,KAAK2V,OAAOtT,IAAIrC,KAAKmb,MAAM/F,OAAOpV,KAAK2V,OAAOtT,IAAIrC,KAAKgT,GACnEyJ,EAAIrT,EAAEkC,KAAK7G,GAAGwE,OAAOjJ,KAAK2V,OAC1B7M,EAAM2T,EAOV,OANIA,EAAEhX,IAAIzF,KAAKgT,IAAM,EACnBlK,EAAM2T,EAAEnR,KAAKtL,KAAKgT,GACTyJ,EAAE7E,KAAK,GAAK,IACrB9O,EAAM2T,EAAEpR,KAAKrL,KAAKgT,IAGblK,EAAIgQ,UAAU9Y,OAGvBgb,EAAKtZ,UAAUmW,KAAO,SAAerQ,GAGnC,OADUxH,KAAKib,KAAKzT,EAAEgQ,OAAOxX,KAAKgT,GAAG3Q,IAAIrC,KAAKyW,KACnCqC,UAAU9Y,OAn3GzB,CAq3GoCd,EAAQc,Q","file":"yarn.create-ecdh.becc34fe6fa559c58c21.js","sourcesContent":["var elliptic = require('elliptic')\nvar BN = require('bn.js')\n\nmodule.exports = function createECDH (curve) {\n  return new ECDH(curve)\n}\n\nvar aliases = {\n  secp256k1: {\n    name: 'secp256k1',\n    byteLength: 32\n  },\n  secp224r1: {\n    name: 'p224',\n    byteLength: 28\n  },\n  prime256v1: {\n    name: 'p256',\n    byteLength: 32\n  },\n  prime192v1: {\n    name: 'p192',\n    byteLength: 24\n  },\n  ed25519: {\n    name: 'ed25519',\n    byteLength: 32\n  },\n  secp384r1: {\n    name: 'p384',\n    byteLength: 48\n  },\n  secp521r1: {\n    name: 'p521',\n    byteLength: 66\n  }\n}\n\naliases.p224 = aliases.secp224r1\naliases.p256 = aliases.secp256r1 = aliases.prime256v1\naliases.p192 = aliases.secp192r1 = aliases.prime192v1\naliases.p384 = aliases.secp384r1\naliases.p521 = aliases.secp521r1\n\nfunction ECDH (curve) {\n  this.curveType = aliases[curve]\n  if (!this.curveType) {\n    this.curveType = {\n      name: curve\n    }\n  }\n  this.curve = new elliptic.ec(this.curveType.name) // eslint-disable-line new-cap\n  this.keys = void 0\n}\n\nECDH.prototype.generateKeys = function (enc, format) {\n  this.keys = this.curve.genKeyPair()\n  return this.getPublicKey(enc, format)\n}\n\nECDH.prototype.computeSecret = function (other, inenc, enc) {\n  inenc = inenc || 'utf8'\n  if (!Buffer.isBuffer(other)) {\n    other = new Buffer(other, inenc)\n  }\n  var otherPub = this.curve.keyFromPublic(other).getPublic()\n  var out = otherPub.mul(this.keys.getPrivate()).getX()\n  return formatReturnValue(out, enc, this.curveType.byteLength)\n}\n\nECDH.prototype.getPublicKey = function (enc, format) {\n  var key = this.keys.getPublic(format === 'compressed', true)\n  if (format === 'hybrid') {\n    if (key[key.length - 1] % 2) {\n      key[0] = 7\n    } else {\n      key[0] = 6\n    }\n  }\n  return formatReturnValue(key, enc)\n}\n\nECDH.prototype.getPrivateKey = function (enc) {\n  return formatReturnValue(this.keys.getPrivate(), enc)\n}\n\nECDH.prototype.setPublicKey = function (pub, enc) {\n  enc = enc || 'utf8'\n  if (!Buffer.isBuffer(pub)) {\n    pub = new Buffer(pub, enc)\n  }\n  this.keys._importPublic(pub)\n  return this\n}\n\nECDH.prototype.setPrivateKey = function (priv, enc) {\n  enc = enc || 'utf8'\n  if (!Buffer.isBuffer(priv)) {\n    priv = new Buffer(priv, enc)\n  }\n\n  var _priv = new BN(priv)\n  _priv = _priv.toString(16)\n  this.keys = this.curve.genKeyPair()\n  this.keys._importPrivate(_priv)\n  return this\n}\n\nfunction formatReturnValue (bn, enc, len) {\n  if (!Array.isArray(bn)) {\n    bn = bn.toArray()\n  }\n  var buf = new Buffer(bn)\n  if (len && buf.length < len) {\n    var zeros = new Buffer(len - buf.length)\n    zeros.fill(0)\n    buf = Buffer.concat([zeros, buf])\n  }\n  if (!enc) {\n    return buf\n  } else {\n    return buf.toString(enc)\n  }\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":""}