{"version":3,"sources":["webpack:///./node_modules/browserify-sign/node_modules/bn.js/lib/bn.js"],"names":["assert","val","msg","Error","inherits","ctor","superCtor","super_","TempCtor","prototype","constructor","BN","number","base","endian","isBN","this","negative","words","length","red","_init","Buffer","module","exports","wordSize","window","e","parseHex4Bits","string","index","c","charCodeAt","parseHexByte","lowerBound","r","parseBase","str","start","end","mul","b","len","Math","min","i","move","dest","src","num","Array","isArray","max","left","right","cmp","_initNumber","_initArray","toString","replace","_parseHex","_parseBase","toArray","ceil","j","w","off","_strip","limbLen","limbPow","total","mod","word","imuln","_iaddn","pow","copy","_move","clone","_expand","size","_normSign","Symbol","for","inspect","zeros","groupSizes","groupBases","padding","out","carry","groupSize","groupBase","isZero","modrn","idivn","toNumber","ret","toJSON","toBuffer","toArrayLike","smallMulTo","self","a","lo","k","ncarry","rword","maxJ","ArrayType","byteLength","reqLength","res","allocUnsafe","allocate","_toArrayLikeLE","position","shift","_toArrayLikeBE","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","bigMulTo","hncarry","jumboMulTo","FFTM","x","y","mulTo","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","mulp","_","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","isNegNum","muln","sqr","isqr","toBitArray","q","iushln","bits","carryMask","newCarry","ishln","iushrn","hint","extended","h","mask","maskedWords","ishrn","shln","ushln","shrn","ushrn","imaskn","maskn","isubn","addn","subn","iabs","_ishlnsubmul","_wordDiv","mode","bhi","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","andln","acc","modn","egcd","A","B","C","D","g","isEven","yp","xp","im","isOdd","jm","gcd","_invmp","x1","x2","delta","cmpn","invm","bincn","ucmp","gtn","gt","gten","gte","ltn","lt","lten","lte","eqn","eq","Red","toRed","ctx","convertTo","_forceRed","fromRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","shl","redMul","_verify2","redIMul","redSqr","_verify1","redISqr","redSqrt","sqrt","redInvm","redNeg","redPow","primes","k256","p224","p192","p25519","MPrime","name","tmp","_tmp","K256","call","P224","P192","P25519","prime","_prime","Mont","imod","rinv","minv","ireduce","rlen","split","imulK","undefined","strip","input","output","outLen","prev","next","mod3","one","nOne","lpow","z","inv","wnd","current","currentLen","mont","u"],"mappings":"gFAAA,2BACE,aAGA,SAASA,EAAOC,EAAKC,GACnB,IAAKD,EAAK,MAAM,IAAIE,MAAMD,GAAO,mBACnC,CAIA,SAASE,EAASC,EAAMC,GACtBD,EAAKE,OAASD,EACd,IAAIE,EAAW,WAAa,EAC5BA,EAASC,UAAYH,EAAUG,UAC/BJ,EAAKI,UAAY,IAAID,EACrBH,EAAKI,UAAUC,YAAcL,CAC/B,CAIA,SAASM,EAAGC,EAAQC,EAAMC,GACxB,GAAIH,EAAGI,KAAKH,GACV,OAAOA,EAETI,KAAKC,SAAW,EAChBD,KAAKE,MAAQ,KACbF,KAAKG,OAAS,EAGdH,KAAKI,IAAM,KACI,OAAXR,IACW,OAATC,GAA0B,OAATA,IACnBC,EAASD,EACTA,EAAO,IAETG,KAAKK,MAAMT,GAAU,EAAGC,GAAQ,GAAIC,GAAU,MAElD,CAQA,IAAIQ,EAPkB,kBAAXC,EACTA,EAAOC,QAAUb,EAEjBa,EAAQb,GAAKA,EAEfA,EAAGA,GAAKA,EACRA,EAAGc,SAAW,GAEd,IAEIH,EADoB,qBAAXI,QAAmD,qBAAlBA,OAAOJ,OACxCI,OAAOJ,OAEP,EAAQ,KAAUA,MAE/B,CAAE,MAAOK,GAAI,CAwGb,SAASC,EAAcC,EAAQC,GAC7B,IAAIC,EAAIF,EAAOG,WAAWF,GAE1B,OAAIC,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,GAClBA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,QAEX/B,GAAO,EAAO,wBAA0B6B,EAE5C,CACA,SAASI,EAAaJ,EAAQK,EAAYJ,GACxC,IAAIK,EAAIP,EAAcC,EAAQC,GAI9B,OAHIA,EAAQ,GAAKI,IACfC,GAAKP,EAAcC,EAAQC,EAAQ,IAAM,GAEpCK,CACT,CAyCA,SAASC,EAAUC,EAAKC,EAAOC,EAAKC,GAIlC,IAHA,IAAIL,EAAI,EACJM,EAAI,EACJC,EAAMC,KAAKC,IAAIP,EAAIlB,OAAQoB,GACtBM,EAAIP,EAAOO,EAAIH,EAAKG,IAAK,CAChC,IAAId,EAAIM,EAAIL,WAAWa,GAAK,GAC5BV,GAAKK,EAIHC,EADEV,GAAK,GACHA,EAAI,GAAK,GAGJA,GAAK,GACVA,EAAI,GAAK,GAITA,EAEN/B,EAAO+B,GAAK,GAAKU,EAAID,EAAK,qBAC1BL,GAAKM,CACP,CACA,OAAON,CACT,CAiDA,SAASW,EAAKC,EAAMC,GAClBD,EAAK7B,MAAQ8B,EAAI9B,MACjB6B,EAAK5B,OAAS6B,EAAI7B,OAClB4B,EAAK9B,SAAW+B,EAAI/B,SACpB8B,EAAK3B,IAAM4B,EAAI5B,GACjB,CAiCA,GApRAT,EAAGI,KAAO,SAAckC,GACtB,OAAIA,aAAetC,GAGJ,OAARsC,GAA+B,kBAARA,GAAoBA,EAAIvC,YAAYe,WAAad,EAAGc,UAAYyB,MAAMC,QAAQF,EAAI/B,MAClH,EACAP,EAAGyC,IAAM,SAAaC,EAAMC,GAC1B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,CACT,EACA3C,EAAGiC,IAAM,SAAaS,EAAMC,GAC1B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,CACT,EACA3C,EAAGF,UAAUY,MAAQ,SAAcT,EAAQC,EAAMC,GAC/C,GAAsB,kBAAXF,EACT,OAAOI,KAAKwC,YAAY5C,EAAQC,EAAMC,GAExC,GAAsB,kBAAXF,EACT,OAAOI,KAAKyC,WAAW7C,EAAQC,EAAMC,GAE1B,QAATD,IACFA,EAAO,IAETb,EAAOa,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAEnD,IAAIyB,EAAQ,EACM,OAFlB1B,EAASA,EAAO8C,WAAWC,QAAQ,OAAQ,KAEhC,KACTrB,IACAtB,KAAKC,SAAW,GAEdqB,EAAQ1B,EAAOO,SACJ,KAATN,EACFG,KAAK4C,UAAUhD,EAAQ0B,EAAOxB,IAE9BE,KAAK6C,WAAWjD,EAAQC,EAAMyB,GACf,OAAXxB,GACFE,KAAKyC,WAAWzC,KAAK8C,UAAWjD,EAAMC,IAI9C,EACAH,EAAGF,UAAU+C,YAAc,SAAqB5C,EAAQC,EAAMC,GACxDF,EAAS,IACXI,KAAKC,SAAW,EAChBL,GAAUA,GAERA,EAAS,UACXI,KAAKE,MAAQ,CAAU,SAATN,GACdI,KAAKG,OAAS,GACLP,EAAS,kBAClBI,KAAKE,MAAQ,CAAU,SAATN,EAAoBA,EAAS,SAAY,UACvDI,KAAKG,OAAS,IAEdnB,EAAOY,EAAS,kBAChBI,KAAKE,MAAQ,CAAU,SAATN,EAAoBA,EAAS,SAAY,SAAW,GAClEI,KAAKG,OAAS,GAED,OAAXL,GAGJE,KAAKyC,WAAWzC,KAAK8C,UAAWjD,EAAMC,EACxC,EACAH,EAAGF,UAAUgD,WAAa,SAAoB7C,EAAQC,EAAMC,GAG1D,GADAd,EAAgC,kBAAlBY,EAAOO,QACjBP,EAAOO,QAAU,EAGnB,OAFAH,KAAKE,MAAQ,CAAC,GACdF,KAAKG,OAAS,EACPH,KAETA,KAAKG,OAASwB,KAAKoB,KAAKnD,EAAOO,OAAS,GACxCH,KAAKE,MAAQ,IAAIgC,MAAMlC,KAAKG,QAC5B,IAAK,IAAI0B,EAAI,EAAGA,EAAI7B,KAAKG,OAAQ0B,IAC/B7B,KAAKE,MAAM2B,GAAK,EAElB,IAAImB,EAAGC,EACHC,EAAM,EACV,GAAe,OAAXpD,EACF,IAAK+B,EAAIjC,EAAOO,OAAS,EAAG6C,EAAI,EAAGnB,GAAK,EAAGA,GAAK,EAC9CoB,EAAIrD,EAAOiC,GAAKjC,EAAOiC,EAAI,IAAM,EAAIjC,EAAOiC,EAAI,IAAM,GACtD7B,KAAKE,MAAM8C,IAAMC,GAAKC,EAAM,SAC5BlD,KAAKE,MAAM8C,EAAI,GAAKC,IAAM,GAAKC,EAAM,UACrCA,GAAO,KACI,KACTA,GAAO,GACPF,UAGC,GAAe,OAAXlD,EACT,IAAK+B,EAAI,EAAGmB,EAAI,EAAGnB,EAAIjC,EAAOO,OAAQ0B,GAAK,EACzCoB,EAAIrD,EAAOiC,GAAKjC,EAAOiC,EAAI,IAAM,EAAIjC,EAAOiC,EAAI,IAAM,GACtD7B,KAAKE,MAAM8C,IAAMC,GAAKC,EAAM,SAC5BlD,KAAKE,MAAM8C,EAAI,GAAKC,IAAM,GAAKC,EAAM,UACrCA,GAAO,KACI,KACTA,GAAO,GACPF,KAIN,OAAOhD,KAAKmD,QACd,EAuBAxD,EAAGF,UAAUmD,UAAY,SAAmBhD,EAAQ0B,EAAOxB,GAEzDE,KAAKG,OAASwB,KAAKoB,MAAMnD,EAAOO,OAASmB,GAAS,GAClDtB,KAAKE,MAAQ,IAAIgC,MAAMlC,KAAKG,QAC5B,IAAK,IAAI0B,EAAI,EAAGA,EAAI7B,KAAKG,OAAQ0B,IAC/B7B,KAAKE,MAAM2B,GAAK,EAIlB,IAEIoB,EAFAC,EAAM,EACNF,EAAI,EAER,GAAe,OAAXlD,EACF,IAAK+B,EAAIjC,EAAOO,OAAS,EAAG0B,GAAKP,EAAOO,GAAK,EAC3CoB,EAAIhC,EAAarB,EAAQ0B,EAAOO,IAAMqB,EACtClD,KAAKE,MAAM8C,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACLhD,KAAKE,MAAM8C,IAAMC,IAAM,IAEvBC,GAAO,OAKX,IAAKrB,GADajC,EAAOO,OAASmB,GACX,IAAM,EAAIA,EAAQ,EAAIA,EAAOO,EAAIjC,EAAOO,OAAQ0B,GAAK,EAC1EoB,EAAIhC,EAAarB,EAAQ0B,EAAOO,IAAMqB,EACtClD,KAAKE,MAAM8C,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACLhD,KAAKE,MAAM8C,IAAMC,IAAM,IAEvBC,GAAO,EAIblD,KAAKmD,QACP,EA0BAxD,EAAGF,UAAUoD,WAAa,SAAoBjD,EAAQC,EAAMyB,GAE1DtB,KAAKE,MAAQ,CAAC,GACdF,KAAKG,OAAS,EAGd,IAAK,IAAIiD,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWxD,EAClEuD,IAEFA,IACAC,EAAUA,EAAUxD,EAAO,EAK3B,IAJA,IAAIyD,EAAQ1D,EAAOO,OAASmB,EACxBiC,EAAMD,EAAQF,EACd7B,EAAMI,KAAKC,IAAI0B,EAAOA,EAAQC,GAAOjC,EACrCkC,EAAO,EACF3B,EAAIP,EAAOO,EAAIN,EAAKM,GAAKuB,EAChCI,EAAOpC,EAAUxB,EAAQiC,EAAGA,EAAIuB,EAASvD,GACzCG,KAAKyD,MAAMJ,GACPrD,KAAKE,MAAM,GAAKsD,EAAO,SACzBxD,KAAKE,MAAM,IAAMsD,EAEjBxD,KAAK0D,OAAOF,GAGhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAEV,IADAH,EAAOpC,EAAUxB,EAAQiC,EAAGjC,EAAOO,OAAQN,GACtCgC,EAAI,EAAGA,EAAI0B,EAAK1B,IACnB8B,GAAO9D,EAETG,KAAKyD,MAAME,GACP3D,KAAKE,MAAM,GAAKsD,EAAO,SACzBxD,KAAKE,MAAM,IAAMsD,EAEjBxD,KAAK0D,OAAOF,EAEhB,CACAxD,KAAKmD,QACP,EACAxD,EAAGF,UAAUmE,KAAO,SAAc7B,GAChCA,EAAK7B,MAAQ,IAAIgC,MAAMlC,KAAKG,QAC5B,IAAK,IAAI0B,EAAI,EAAGA,EAAI7B,KAAKG,OAAQ0B,IAC/BE,EAAK7B,MAAM2B,GAAK7B,KAAKE,MAAM2B,GAE7BE,EAAK5B,OAASH,KAAKG,OACnB4B,EAAK9B,SAAWD,KAAKC,SACrB8B,EAAK3B,IAAMJ,KAAKI,GAClB,EAOAT,EAAGF,UAAUoE,MAAQ,SAAe9B,GAClCD,EAAKC,EAAM/B,KACb,EACAL,EAAGF,UAAUqE,MAAQ,WACnB,IAAI3C,EAAI,IAAIxB,EAAG,MAEf,OADAK,KAAK4D,KAAKzC,GACHA,CACT,EACAxB,EAAGF,UAAUsE,QAAU,SAAiBC,GACtC,KAAOhE,KAAKG,OAAS6D,GACnBhE,KAAKE,MAAMF,KAAKG,UAAY,EAE9B,OAAOH,IACT,EAGAL,EAAGF,UAAU0D,OAAS,WACpB,KAAOnD,KAAKG,OAAS,GAAqC,IAAhCH,KAAKE,MAAMF,KAAKG,OAAS,IACjDH,KAAKG,SAEP,OAAOH,KAAKiE,WACd,EACAtE,EAAGF,UAAUwE,UAAY,WAKvB,OAHoB,IAAhBjE,KAAKG,QAAkC,IAAlBH,KAAKE,MAAM,KAClCF,KAAKC,SAAW,GAEXD,IACT,EAIsB,qBAAXkE,QAAgD,oBAAfA,OAAOC,IACjD,IACExE,EAAGF,UAAUyE,OAAOC,IAAI,+BAAiCC,CAC3D,CAAE,MAAOzD,GACPhB,EAAGF,UAAU2E,QAAUA,CACzB,MAEAzE,EAAGF,UAAU2E,QAAUA,EAEzB,SAASA,IACP,OAAQpE,KAAKI,IAAM,UAAY,SAAWJ,KAAK0C,SAAS,IAAM,GAChE,CA6BA,IAAI2B,EAAQ,CAAC,GAAI,IAAK,KAAM,MAAO,OAAQ,QAAS,SAAU,UAAW,WAAY,YAAa,aAAc,cAAe,eAAgB,gBAAiB,iBAAkB,kBAAmB,mBAAoB,oBAAqB,qBAAsB,sBAAuB,uBAAwB,wBAAyB,yBAA0B,0BAA2B,2BAA4B,6BACzZC,EAAa,CAAC,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAC/HC,EAAa,CAAC,EAAG,EAAG,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAAU,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAAS,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SAAU,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UACtW5E,EAAGF,UAAUiD,SAAW,SAAkB7C,EAAM2E,GAG9C,IAAIC,EACJ,GAFAD,EAAoB,EAAVA,GAAe,EAEZ,MAHb3E,EAAOA,GAAQ,KAGa,QAATA,EAAgB,CACjC4E,EAAM,GAGN,IAFA,IAAIvB,EAAM,EACNwB,EAAQ,EACH7C,EAAI,EAAGA,EAAI7B,KAAKG,OAAQ0B,IAAK,CACpC,IAAIoB,EAAIjD,KAAKE,MAAM2B,GACf2B,GAA6B,UAApBP,GAAKC,EAAMwB,IAAmBhC,SAAS,IACpDgC,EAAQzB,IAAM,GAAKC,EAAM,UACzBA,GAAO,IACI,KACTA,GAAO,GACPrB,KAGA4C,EADY,IAAVC,GAAe7C,IAAM7B,KAAKG,OAAS,EAC/BkE,EAAM,EAAIb,EAAKrD,QAAUqD,EAAOiB,EAEhCjB,EAAOiB,CAEjB,CAIA,IAHc,IAAVC,IACFD,EAAMC,EAAMhC,SAAS,IAAM+B,GAEtBA,EAAItE,OAASqE,IAAY,GAC9BC,EAAM,IAAMA,EAKd,OAHsB,IAAlBzE,KAAKC,WACPwE,EAAM,IAAMA,GAEPA,CACT,CACA,GAAI5E,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAI8E,EAAYL,EAAWzE,GAEvB+E,EAAYL,EAAW1E,GAC3B4E,EAAM,GACN,IAAI1D,EAAIf,KAAK8D,QAEb,IADA/C,EAAEd,SAAW,GACLc,EAAE8D,UAAU,CAClB,IAAI1D,EAAIJ,EAAE+D,MAAMF,GAAWlC,SAAS7C,GAKlC4E,GAJF1D,EAAIA,EAAEgE,MAAMH,IACLC,SAGC1D,EAAIsD,EAFJJ,EAAMM,EAAYxD,EAAEhB,QAAUgB,EAAIsD,CAI5C,CAIA,IAHIzE,KAAK6E,WACPJ,EAAM,IAAMA,GAEPA,EAAItE,OAASqE,IAAY,GAC9BC,EAAM,IAAMA,EAKd,OAHsB,IAAlBzE,KAAKC,WACPwE,EAAM,IAAMA,GAEPA,CACT,CACAzF,GAAO,EAAO,kCAChB,EACAW,EAAGF,UAAUuF,SAAW,WACtB,IAAIC,EAAMjF,KAAKE,MAAM,GASrB,OARoB,IAAhBF,KAAKG,OACP8E,GAAuB,SAAhBjF,KAAKE,MAAM,GACO,IAAhBF,KAAKG,QAAkC,IAAlBH,KAAKE,MAAM,GAEzC+E,GAAO,iBAAmC,SAAhBjF,KAAKE,MAAM,GAC5BF,KAAKG,OAAS,GACvBnB,GAAO,EAAO,8CAES,IAAlBgB,KAAKC,UAAkBgF,EAAMA,CACtC,EACAtF,EAAGF,UAAUyF,OAAS,WACpB,OAAOlF,KAAK0C,SAAS,GAAI,EAC3B,EACIpC,IACFX,EAAGF,UAAU0F,SAAW,SAAkBrF,EAAQK,GAChD,OAAOH,KAAKoF,YAAY9E,EAAQR,EAAQK,EAC1C,GAEFR,EAAGF,UAAUqD,QAAU,SAAiBhD,EAAQK,GAC9C,OAAOH,KAAKoF,YAAYlD,MAAOpC,EAAQK,EACzC,EA6cA,SAASkF,EAAWC,EAAMrD,EAAKwC,GAC7BA,EAAIxE,SAAWgC,EAAIhC,SAAWqF,EAAKrF,SACnC,IAAIyB,EAAM4D,EAAKnF,OAAS8B,EAAI9B,OAAS,EACrCsE,EAAItE,OAASuB,EACbA,EAAMA,EAAM,EAAI,EAGhB,IAAI6D,EAAoB,EAAhBD,EAAKpF,MAAM,GACfuB,EAAmB,EAAfQ,EAAI/B,MAAM,GACdiB,EAAIoE,EAAI9D,EACR+D,EAAS,SAAJrE,EACLuD,EAAQvD,EAAI,SAAY,EAC5BsD,EAAIvE,MAAM,GAAKsF,EACf,IAAK,IAAIC,EAAI,EAAGA,EAAI/D,EAAK+D,IAAK,CAM5B,IAHA,IAAIC,EAAShB,IAAU,GACnBiB,EAAgB,SAARjB,EACRkB,EAAOjE,KAAKC,IAAI6D,EAAGxD,EAAI9B,OAAS,GAC3B6C,EAAIrB,KAAKS,IAAI,EAAGqD,EAAIH,EAAKnF,OAAS,GAAI6C,GAAK4C,EAAM5C,IAAK,CAC7D,IAAInB,EAAI4D,EAAIzC,EAAI,EAIhB0C,IADAvE,GAFAoE,EAAoB,EAAhBD,EAAKpF,MAAM2B,KACfJ,EAAmB,EAAfQ,EAAI/B,MAAM8C,IACF2C,GACE,SAAY,EAC1BA,EAAY,SAAJxE,CACV,CACAsD,EAAIvE,MAAMuF,GAAa,EAARE,EACfjB,EAAiB,EAATgB,CACV,CAMA,OALc,IAAVhB,EACFD,EAAIvE,MAAMuF,GAAa,EAARf,EAEfD,EAAItE,SAECsE,EAAItB,QACb,CA1eAxD,EAAGF,UAAU2F,YAAc,SAAqBS,EAAW/F,EAAQK,GACjEH,KAAKmD,SACL,IAAI2C,EAAa9F,KAAK8F,aAClBC,EAAY5F,GAAUwB,KAAKS,IAAI,EAAG0D,GACtC9G,EAAO8G,GAAcC,EAAW,yCAChC/G,EAAO+G,EAAY,EAAG,+BACtB,IAAIC,EAZS,SAAkBH,EAAW7B,GAC1C,OAAI6B,EAAUI,YACLJ,EAAUI,YAAYjC,GAExB,IAAI6B,EAAU7B,EACvB,CAOYkC,CAASL,EAAWE,GAG9B,OADA/F,KAAK,gBADoB,OAAXF,EAAkB,KAAO,OACRkG,EAAKF,GAC7BE,CACT,EACArG,EAAGF,UAAU0G,eAAiB,SAAwBH,EAAKF,GAGzD,IAFA,IAAIM,EAAW,EACX1B,EAAQ,EACH7C,EAAI,EAAGwE,EAAQ,EAAGxE,EAAI7B,KAAKG,OAAQ0B,IAAK,CAC/C,IAAI2B,EAAOxD,KAAKE,MAAM2B,IAAMwE,EAAQ3B,EACpCsB,EAAII,KAAqB,IAAP5C,EACd4C,EAAWJ,EAAI7F,SACjB6F,EAAII,KAAc5C,GAAQ,EAAI,KAE5B4C,EAAWJ,EAAI7F,SACjB6F,EAAII,KAAc5C,GAAQ,GAAK,KAEnB,IAAV6C,GACED,EAAWJ,EAAI7F,SACjB6F,EAAII,KAAc5C,GAAQ,GAAK,KAEjCkB,EAAQ,EACR2B,EAAQ,IAER3B,EAAQlB,IAAS,GACjB6C,GAAS,EAEb,CACA,GAAID,EAAWJ,EAAI7F,OAEjB,IADA6F,EAAII,KAAc1B,EACX0B,EAAWJ,EAAI7F,QACpB6F,EAAII,KAAc,CAGxB,EACAzG,EAAGF,UAAU6G,eAAiB,SAAwBN,EAAKF,GAGzD,IAFA,IAAIM,EAAWJ,EAAI7F,OAAS,EACxBuE,EAAQ,EACH7C,EAAI,EAAGwE,EAAQ,EAAGxE,EAAI7B,KAAKG,OAAQ0B,IAAK,CAC/C,IAAI2B,EAAOxD,KAAKE,MAAM2B,IAAMwE,EAAQ3B,EACpCsB,EAAII,KAAqB,IAAP5C,EACd4C,GAAY,IACdJ,EAAII,KAAc5C,GAAQ,EAAI,KAE5B4C,GAAY,IACdJ,EAAII,KAAc5C,GAAQ,GAAK,KAEnB,IAAV6C,GACED,GAAY,IACdJ,EAAII,KAAc5C,GAAQ,GAAK,KAEjCkB,EAAQ,EACR2B,EAAQ,IAER3B,EAAQlB,IAAS,GACjB6C,GAAS,EAEb,CACA,GAAID,GAAY,EAEd,IADAJ,EAAII,KAAc1B,EACX0B,GAAY,GACjBJ,EAAII,KAAc,CAGxB,EACIzE,KAAK4E,MACP5G,EAAGF,UAAU+G,WAAa,SAAoBvD,GAC5C,OAAO,GAAKtB,KAAK4E,MAAMtD,EACzB,EAEAtD,EAAGF,UAAU+G,WAAa,SAAoBvD,GAC5C,IAAIwD,EAAIxD,EACJ9B,EAAI,EAiBR,OAhBIsF,GAAK,OACPtF,GAAK,GACLsF,KAAO,IAELA,GAAK,KACPtF,GAAK,EACLsF,KAAO,GAELA,GAAK,IACPtF,GAAK,EACLsF,KAAO,GAELA,GAAK,IACPtF,GAAK,EACLsF,KAAO,GAEFtF,EAAIsF,CACb,EAEF9G,EAAGF,UAAUiH,UAAY,SAAmBzD,GAE1C,GAAU,IAANA,EAAS,OAAO,GACpB,IAAIwD,EAAIxD,EACJ9B,EAAI,EAoBR,OAnBqB,KAAZ,KAAJsF,KACHtF,GAAK,GACLsF,KAAO,IAEU,KAAV,IAAJA,KACHtF,GAAK,EACLsF,KAAO,GAES,KAAT,GAAJA,KACHtF,GAAK,EACLsF,KAAO,GAES,KAAT,EAAJA,KACHtF,GAAK,EACLsF,KAAO,GAES,KAAT,EAAJA,IACHtF,IAEKA,CACT,EAGAxB,EAAGF,UAAUkH,UAAY,WACvB,IAAI1D,EAAIjD,KAAKE,MAAMF,KAAKG,OAAS,GAC7ByG,EAAK5G,KAAKwG,WAAWvD,GACzB,OAA2B,IAAnBjD,KAAKG,OAAS,GAAUyG,CAClC,EAYAjH,EAAGF,UAAUoH,SAAW,WACtB,GAAI7G,KAAK6E,SAAU,OAAO,EAE1B,IADA,IAAI1D,EAAI,EACCU,EAAI,EAAGA,EAAI7B,KAAKG,OAAQ0B,IAAK,CACpC,IAAIJ,EAAIzB,KAAK0G,UAAU1G,KAAKE,MAAM2B,IAElC,GADAV,GAAKM,EACK,KAANA,EAAU,KAChB,CACA,OAAON,CACT,EACAxB,EAAGF,UAAUqG,WAAa,WACxB,OAAOnE,KAAKoB,KAAK/C,KAAK2G,YAAc,EACtC,EACAhH,EAAGF,UAAUqH,OAAS,SAAgBC,GACpC,OAAsB,IAAlB/G,KAAKC,SACAD,KAAKgH,MAAMC,MAAMF,GAAOG,MAAM,GAEhClH,KAAK8D,OACd,EACAnE,EAAGF,UAAU0H,SAAW,SAAkBJ,GACxC,OAAI/G,KAAKoH,MAAML,EAAQ,GACd/G,KAAKqH,KAAKN,GAAOG,MAAM,GAAGI,OAE5BtH,KAAK8D,OACd,EACAnE,EAAGF,UAAU8H,MAAQ,WACnB,OAAyB,IAAlBvH,KAAKC,QACd,EAGAN,EAAGF,UAAU+H,IAAM,WACjB,OAAOxH,KAAK8D,QAAQwD,MACtB,EACA3H,EAAGF,UAAU6H,KAAO,WAIlB,OAHKtH,KAAK6E,WACR7E,KAAKC,UAAY,GAEZD,IACT,EAGAL,EAAGF,UAAUgI,KAAO,SAAcxF,GAChC,KAAOjC,KAAKG,OAAS8B,EAAI9B,QACvBH,KAAKE,MAAMF,KAAKG,UAAY,EAE9B,IAAK,IAAI0B,EAAI,EAAGA,EAAII,EAAI9B,OAAQ0B,IAC9B7B,KAAKE,MAAM2B,GAAK7B,KAAKE,MAAM2B,GAAKI,EAAI/B,MAAM2B,GAE5C,OAAO7B,KAAKmD,QACd,EACAxD,EAAGF,UAAUiI,IAAM,SAAazF,GAE9B,OADAjD,EAA0C,KAAlCgB,KAAKC,SAAWgC,EAAIhC,WACrBD,KAAKyH,KAAKxF,EACnB,EAGAtC,EAAGF,UAAUkI,GAAK,SAAY1F,GAC5B,OAAIjC,KAAKG,OAAS8B,EAAI9B,OAAeH,KAAK8D,QAAQ4D,IAAIzF,GAC/CA,EAAI6B,QAAQ4D,IAAI1H,KACzB,EACAL,EAAGF,UAAUmI,IAAM,SAAa3F,GAC9B,OAAIjC,KAAKG,OAAS8B,EAAI9B,OAAeH,KAAK8D,QAAQ2D,KAAKxF,GAChDA,EAAI6B,QAAQ2D,KAAKzH,KAC1B,EAGAL,EAAGF,UAAUoI,MAAQ,SAAe5F,GAElC,IAAIR,EAEFA,EADEzB,KAAKG,OAAS8B,EAAI9B,OAChB8B,EAEAjC,KAEN,IAAK,IAAI6B,EAAI,EAAGA,EAAIJ,EAAEtB,OAAQ0B,IAC5B7B,KAAKE,MAAM2B,GAAK7B,KAAKE,MAAM2B,GAAKI,EAAI/B,MAAM2B,GAG5C,OADA7B,KAAKG,OAASsB,EAAEtB,OACTH,KAAKmD,QACd,EACAxD,EAAGF,UAAUqI,KAAO,SAAc7F,GAEhC,OADAjD,EAA0C,KAAlCgB,KAAKC,SAAWgC,EAAIhC,WACrBD,KAAK6H,MAAM5F,EACpB,EAGAtC,EAAGF,UAAUsI,IAAM,SAAa9F,GAC9B,OAAIjC,KAAKG,OAAS8B,EAAI9B,OAAeH,KAAK8D,QAAQgE,KAAK7F,GAChDA,EAAI6B,QAAQgE,KAAK9H,KAC1B,EACAL,EAAGF,UAAUuI,KAAO,SAAc/F,GAChC,OAAIjC,KAAKG,OAAS8B,EAAI9B,OAAeH,KAAK8D,QAAQ+D,MAAM5F,GACjDA,EAAI6B,QAAQ+D,MAAM7H,KAC3B,EAGAL,EAAGF,UAAUwI,MAAQ,SAAehG,GAElC,IAAIsD,EACA9D,EACAzB,KAAKG,OAAS8B,EAAI9B,QACpBoF,EAAIvF,KACJyB,EAAIQ,IAEJsD,EAAItD,EACJR,EAAIzB,MAEN,IAAK,IAAI6B,EAAI,EAAGA,EAAIJ,EAAEtB,OAAQ0B,IAC5B7B,KAAKE,MAAM2B,GAAK0D,EAAErF,MAAM2B,GAAKJ,EAAEvB,MAAM2B,GAEvC,GAAI7B,OAASuF,EACX,KAAO1D,EAAI0D,EAAEpF,OAAQ0B,IACnB7B,KAAKE,MAAM2B,GAAK0D,EAAErF,MAAM2B,GAI5B,OADA7B,KAAKG,OAASoF,EAAEpF,OACTH,KAAKmD,QACd,EACAxD,EAAGF,UAAUyI,KAAO,SAAcjG,GAEhC,OADAjD,EAA0C,KAAlCgB,KAAKC,SAAWgC,EAAIhC,WACrBD,KAAKiI,MAAMhG,EACpB,EAGAtC,EAAGF,UAAU0I,IAAM,SAAalG,GAC9B,OAAIjC,KAAKG,OAAS8B,EAAI9B,OAAeH,KAAK8D,QAAQoE,KAAKjG,GAChDA,EAAI6B,QAAQoE,KAAKlI,KAC1B,EACAL,EAAGF,UAAU2I,KAAO,SAAcnG,GAChC,OAAIjC,KAAKG,OAAS8B,EAAI9B,OAAeH,KAAK8D,QAAQmE,MAAMhG,GACjDA,EAAI6B,QAAQmE,MAAMjI,KAC3B,EAGAL,EAAGF,UAAUwH,MAAQ,SAAeF,GAClC/H,EAAwB,kBAAV+H,GAAsBA,GAAS,GAC7C,IAAIsB,EAAsC,EAAxB1G,KAAKoB,KAAKgE,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvB/G,KAAK+D,QAAQsE,GACTC,EAAW,GACbD,IAIF,IAAK,IAAIxG,EAAI,EAAGA,EAAIwG,EAAaxG,IAC/B7B,KAAKE,MAAM2B,GAAsB,UAAhB7B,KAAKE,MAAM2B,GAS9B,OALIyG,EAAW,IACbtI,KAAKE,MAAM2B,IAAM7B,KAAKE,MAAM2B,GAAK,UAAa,GAAKyG,GAI9CtI,KAAKmD,QACd,EACAxD,EAAGF,UAAU4H,KAAO,SAAcN,GAChC,OAAO/G,KAAK8D,QAAQmD,MAAMF,EAC5B,EAGApH,EAAGF,UAAU8I,KAAO,SAAcC,EAAKvJ,GACrCD,EAAsB,kBAARwJ,GAAoBA,GAAO,GACzC,IAAItF,EAAMsF,EAAM,GAAK,EACjBC,EAAOD,EAAM,GAOjB,OANAxI,KAAK+D,QAAQb,EAAM,GAEjBlD,KAAKE,MAAMgD,GADTjE,EACgBe,KAAKE,MAAMgD,GAAO,GAAKuF,EAEvBzI,KAAKE,MAAMgD,KAAS,GAAKuF,GAEtCzI,KAAKmD,QACd,EAGAxD,EAAGF,UAAUiJ,KAAO,SAAczG,GAChC,IAAId,EAkBAoE,EAAG9D,EAfP,GAAsB,IAAlBzB,KAAKC,UAAmC,IAAjBgC,EAAIhC,SAI7B,OAHAD,KAAKC,SAAW,EAChBkB,EAAInB,KAAK2I,KAAK1G,GACdjC,KAAKC,UAAY,EACVD,KAAKiE,YAGP,GAAsB,IAAlBjE,KAAKC,UAAmC,IAAjBgC,EAAIhC,SAIpC,OAHAgC,EAAIhC,SAAW,EACfkB,EAAInB,KAAK2I,KAAK1G,GACdA,EAAIhC,SAAW,EACRkB,EAAE8C,YAKPjE,KAAKG,OAAS8B,EAAI9B,QACpBoF,EAAIvF,KACJyB,EAAIQ,IAEJsD,EAAItD,EACJR,EAAIzB,MAGN,IADA,IAAI0E,EAAQ,EACH7C,EAAI,EAAGA,EAAIJ,EAAEtB,OAAQ0B,IAC5BV,GAAkB,EAAboE,EAAErF,MAAM2B,KAAwB,EAAbJ,EAAEvB,MAAM2B,IAAU6C,EAC1C1E,KAAKE,MAAM2B,GAAS,SAAJV,EAChBuD,EAAQvD,IAAM,GAEhB,KAAiB,IAAVuD,GAAe7C,EAAI0D,EAAEpF,OAAQ0B,IAClCV,GAAkB,EAAboE,EAAErF,MAAM2B,IAAU6C,EACvB1E,KAAKE,MAAM2B,GAAS,SAAJV,EAChBuD,EAAQvD,IAAM,GAGhB,GADAnB,KAAKG,OAASoF,EAAEpF,OACF,IAAVuE,EACF1E,KAAKE,MAAMF,KAAKG,QAAUuE,EAC1B1E,KAAKG,cAEA,GAAIoF,IAAMvF,KACf,KAAO6B,EAAI0D,EAAEpF,OAAQ0B,IACnB7B,KAAKE,MAAM2B,GAAK0D,EAAErF,MAAM2B,GAG5B,OAAO7B,IACT,EAGAL,EAAGF,UAAUmJ,IAAM,SAAa3G,GAC9B,IAAI+D,EACJ,OAAqB,IAAjB/D,EAAIhC,UAAoC,IAAlBD,KAAKC,UAC7BgC,EAAIhC,SAAW,EACf+F,EAAMhG,KAAK6I,IAAI5G,GACfA,EAAIhC,UAAY,EACT+F,GACmB,IAAjB/D,EAAIhC,UAAoC,IAAlBD,KAAKC,UACpCD,KAAKC,SAAW,EAChB+F,EAAM/D,EAAI4G,IAAI7I,MACdA,KAAKC,SAAW,EACT+F,GAELhG,KAAKG,OAAS8B,EAAI9B,OAAeH,KAAK8D,QAAQ4E,KAAKzG,GAChDA,EAAI6B,QAAQ4E,KAAK1I,KAC1B,EAGAL,EAAGF,UAAUkJ,KAAO,SAAc1G,GAEhC,GAAqB,IAAjBA,EAAIhC,SAAgB,CACtBgC,EAAIhC,SAAW,EACf,IAAIkB,EAAInB,KAAK0I,KAAKzG,GAElB,OADAA,EAAIhC,SAAW,EACRkB,EAAE8C,WAGX,CAAO,GAAsB,IAAlBjE,KAAKC,SAId,OAHAD,KAAKC,SAAW,EAChBD,KAAK0I,KAAKzG,GACVjC,KAAKC,SAAW,EACTD,KAAKiE,YAId,IAWIsB,EAAG9D,EAXHc,EAAMvC,KAAKuC,IAAIN,GAGnB,GAAY,IAARM,EAIF,OAHAvC,KAAKC,SAAW,EAChBD,KAAKG,OAAS,EACdH,KAAKE,MAAM,GAAK,EACTF,KAKLuC,EAAM,GACRgD,EAAIvF,KACJyB,EAAIQ,IAEJsD,EAAItD,EACJR,EAAIzB,MAGN,IADA,IAAI0E,EAAQ,EACH7C,EAAI,EAAGA,EAAIJ,EAAEtB,OAAQ0B,IAE5B6C,GADAvD,GAAkB,EAAboE,EAAErF,MAAM2B,KAAwB,EAAbJ,EAAEvB,MAAM2B,IAAU6C,IAC7B,GACb1E,KAAKE,MAAM2B,GAAS,SAAJV,EAElB,KAAiB,IAAVuD,GAAe7C,EAAI0D,EAAEpF,OAAQ0B,IAElC6C,GADAvD,GAAkB,EAAboE,EAAErF,MAAM2B,IAAU6C,IACV,GACb1E,KAAKE,MAAM2B,GAAS,SAAJV,EAIlB,GAAc,IAAVuD,GAAe7C,EAAI0D,EAAEpF,QAAUoF,IAAMvF,KACvC,KAAO6B,EAAI0D,EAAEpF,OAAQ0B,IACnB7B,KAAKE,MAAM2B,GAAK0D,EAAErF,MAAM2B,GAO5B,OAJA7B,KAAKG,OAASwB,KAAKS,IAAIpC,KAAKG,OAAQ0B,GAChC0D,IAAMvF,OACRA,KAAKC,SAAW,GAEXD,KAAKmD,QACd,EAGAxD,EAAGF,UAAUoJ,IAAM,SAAa5G,GAC9B,OAAOjC,KAAK8D,QAAQ6E,KAAK1G,EAC3B,EA0CA,IAAI6G,EAAc,SAAqBxD,EAAMrD,EAAKwC,GAChD,IAIIe,EACAuD,EACAnC,EANArB,EAAID,EAAKpF,MACTuB,EAAIQ,EAAI/B,MACR8I,EAAIvE,EAAIvE,MACRa,EAAI,EAIJkI,EAAY,EAAP1D,EAAE,GACP2D,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7D,EAAE,GACP8D,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhE,EAAE,GACPiE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnE,EAAE,GACPoE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtE,EAAE,GACPuE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzE,EAAE,GACP0E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5E,EAAE,GACP6E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/E,EAAE,GACPgF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlF,EAAE,GACPmF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrF,EAAE,GACPsF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtJ,EAAE,GACPuJ,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzJ,EAAE,GACP0J,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5J,EAAE,GACP6J,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/J,EAAE,GACPgK,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlK,EAAE,GACPmK,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAPrK,EAAE,GACPsK,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPxK,EAAE,GACPyK,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP3K,EAAE,GACP4K,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP9K,EAAE,GACP+K,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPjL,EAAE,GACPkL,GAAW,KAALD,GACNE,GAAMF,KAAO,GACjBjI,EAAIxE,SAAWqF,EAAKrF,SAAWgC,EAAIhC,SACnCwE,EAAItE,OAAS,GAMb,IAAI0M,IAAM9L,GAJVyE,EAAK7D,KAAKmL,KAAK5D,EAAK8B,IAID,KAAa,MAFhCjC,GADAA,EAAMpH,KAAKmL,KAAK5D,EAAK+B,IACTtJ,KAAKmL,KAAK3D,EAAK6B,GAAO,KAES,IAAM,EACjDjK,IAFA6F,EAAKjF,KAAKmL,KAAK3D,EAAK8B,KAETlC,IAAQ,IAAM,IAAM8D,KAAO,IAAM,EAC5CA,IAAM,SAENrH,EAAK7D,KAAKmL,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKzD,EAAK4B,IACTtJ,KAAKmL,KAAKxD,EAAK0B,GAAO,EAClCpE,EAAKjF,KAAKmL,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAMhM,GAJVyE,EAAKA,EAAK7D,KAAKmL,KAAK5D,EAAKiC,GAAO,GAIb,KAAa,MAFhCpC,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK5D,EAAKkC,GAAO,GACtBzJ,KAAKmL,KAAK3D,EAAKgC,GAAO,KAES,IAAM,EACjDpK,IAFA6F,EAAKA,EAAKjF,KAAKmL,KAAK3D,EAAKiC,GAAO,IAErBrC,IAAQ,IAAM,IAAMgE,KAAO,IAAM,EAC5CA,IAAM,SAENvH,EAAK7D,KAAKmL,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKtD,EAAKyB,IACTtJ,KAAKmL,KAAKrD,EAAKuB,GAAO,EAClCpE,EAAKjF,KAAKmL,KAAKrD,EAAKwB,GACpBzF,EAAKA,EAAK7D,KAAKmL,KAAKzD,EAAK8B,GAAO,EAEhCpC,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKzD,EAAK+B,GAAO,GACtBzJ,KAAKmL,KAAKxD,EAAK6B,GAAO,EAClCvE,EAAKA,EAAKjF,KAAKmL,KAAKxD,EAAK8B,GAAO,EAKhC,IAAI4B,IAAMjM,GAJVyE,EAAKA,EAAK7D,KAAKmL,KAAK5D,EAAKoC,GAAO,GAIb,KAAa,MAFhCvC,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK5D,EAAKqC,GAAO,GACtB5J,KAAKmL,KAAK3D,EAAKmC,GAAO,KAES,IAAM,EACjDvK,IAFA6F,EAAKA,EAAKjF,KAAKmL,KAAK3D,EAAKoC,GAAO,IAErBxC,IAAQ,IAAM,IAAMiE,KAAO,IAAM,EAC5CA,IAAM,SAENxH,EAAK7D,KAAKmL,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKnD,EAAKsB,IACTtJ,KAAKmL,KAAKlD,EAAKoB,GAAO,EAClCpE,EAAKjF,KAAKmL,KAAKlD,EAAKqB,GACpBzF,EAAKA,EAAK7D,KAAKmL,KAAKtD,EAAK2B,GAAO,EAEhCpC,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKtD,EAAK4B,GAAO,GACtBzJ,KAAKmL,KAAKrD,EAAK0B,GAAO,EAClCvE,EAAKA,EAAKjF,KAAKmL,KAAKrD,EAAK2B,GAAO,EAChC5F,EAAKA,EAAK7D,KAAKmL,KAAKzD,EAAKiC,GAAO,EAEhCvC,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKzD,EAAKkC,GAAO,GACtB5J,KAAKmL,KAAKxD,EAAKgC,GAAO,EAClC1E,EAAKA,EAAKjF,KAAKmL,KAAKxD,EAAKiC,GAAO,EAKhC,IAAI0B,IAAMlM,GAJVyE,EAAKA,EAAK7D,KAAKmL,KAAK5D,EAAKuC,GAAO,GAIb,KAAa,MAFhC1C,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK5D,EAAKwC,GAAO,GACtB/J,KAAKmL,KAAK3D,EAAKsC,GAAO,KAES,IAAM,EACjD1K,IAFA6F,EAAKA,EAAKjF,KAAKmL,KAAK3D,EAAKuC,GAAO,IAErB3C,IAAQ,IAAM,IAAMkE,KAAO,IAAM,EAC5CA,IAAM,SAENzH,EAAK7D,KAAKmL,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKhD,EAAKmB,IACTtJ,KAAKmL,KAAK/C,EAAKiB,GAAO,EAClCpE,EAAKjF,KAAKmL,KAAK/C,EAAKkB,GACpBzF,EAAKA,EAAK7D,KAAKmL,KAAKnD,EAAKwB,GAAO,EAEhCpC,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKnD,EAAKyB,GAAO,GACtBzJ,KAAKmL,KAAKlD,EAAKuB,GAAO,EAClCvE,EAAKA,EAAKjF,KAAKmL,KAAKlD,EAAKwB,GAAO,EAChC5F,EAAKA,EAAK7D,KAAKmL,KAAKtD,EAAK8B,GAAO,EAEhCvC,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKtD,EAAK+B,GAAO,GACtB5J,KAAKmL,KAAKrD,EAAK6B,GAAO,EAClC1E,EAAKA,EAAKjF,KAAKmL,KAAKrD,EAAK8B,GAAO,EAChC/F,EAAKA,EAAK7D,KAAKmL,KAAKzD,EAAKoC,GAAO,EAEhC1C,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKzD,EAAKqC,GAAO,GACtB/J,KAAKmL,KAAKxD,EAAKmC,GAAO,EAClC7E,EAAKA,EAAKjF,KAAKmL,KAAKxD,EAAKoC,GAAO,EAKhC,IAAIwB,IAAMnM,GAJVyE,EAAKA,EAAK7D,KAAKmL,KAAK5D,EAAK0C,GAAO,GAIb,KAAa,MAFhC7C,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK5D,EAAK2C,IAAO,GACtBlK,KAAKmL,KAAK3D,EAAKyC,GAAO,KAES,IAAM,EACjD7K,IAFA6F,EAAKA,EAAKjF,KAAKmL,KAAK3D,EAAK0C,IAAO,IAErB9C,IAAQ,IAAM,IAAMmE,KAAO,IAAM,EAC5CA,IAAM,SAEN1H,EAAK7D,KAAKmL,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAK7C,EAAKgB,IACTtJ,KAAKmL,KAAK5C,EAAKc,GAAO,EAClCpE,EAAKjF,KAAKmL,KAAK5C,EAAKe,GACpBzF,EAAKA,EAAK7D,KAAKmL,KAAKhD,EAAKqB,GAAO,EAEhCpC,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKhD,EAAKsB,GAAO,GACtBzJ,KAAKmL,KAAK/C,EAAKoB,GAAO,EAClCvE,EAAKA,EAAKjF,KAAKmL,KAAK/C,EAAKqB,GAAO,EAChC5F,EAAKA,EAAK7D,KAAKmL,KAAKnD,EAAK2B,GAAO,EAEhCvC,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKnD,EAAK4B,GAAO,GACtB5J,KAAKmL,KAAKlD,EAAK0B,GAAO,EAClC1E,EAAKA,EAAKjF,KAAKmL,KAAKlD,EAAK2B,GAAO,EAChC/F,EAAKA,EAAK7D,KAAKmL,KAAKtD,EAAKiC,GAAO,EAEhC1C,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKtD,EAAKkC,GAAO,GACtB/J,KAAKmL,KAAKrD,EAAKgC,GAAO,EAClC7E,EAAKA,EAAKjF,KAAKmL,KAAKrD,EAAKiC,GAAO,EAChClG,EAAKA,EAAK7D,KAAKmL,KAAKzD,EAAKuC,GAAO,EAEhC7C,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKzD,EAAKwC,IAAO,GACtBlK,KAAKmL,KAAKxD,EAAKsC,GAAO,EAClChF,EAAKA,EAAKjF,KAAKmL,KAAKxD,EAAKuC,IAAO,EAKhC,IAAIsB,IAAMpM,GAJVyE,EAAKA,EAAK7D,KAAKmL,KAAK5D,EAAK6C,IAAO,GAIb,KAAa,MAFhChD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK5D,EAAK8C,IAAO,GACtBrK,KAAKmL,KAAK3D,EAAK4C,IAAO,KAES,IAAM,EACjDhL,IAFA6F,EAAKA,EAAKjF,KAAKmL,KAAK3D,EAAK6C,IAAO,IAErBjD,IAAQ,IAAM,IAAMoE,KAAO,IAAM,EAC5CA,IAAM,SAEN3H,EAAK7D,KAAKmL,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAK1C,EAAKa,IACTtJ,KAAKmL,KAAKzC,EAAKW,GAAO,EAClCpE,EAAKjF,KAAKmL,KAAKzC,EAAKY,GACpBzF,EAAKA,EAAK7D,KAAKmL,KAAK7C,EAAKkB,GAAO,EAEhCpC,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK7C,EAAKmB,GAAO,GACtBzJ,KAAKmL,KAAK5C,EAAKiB,GAAO,EAClCvE,EAAKA,EAAKjF,KAAKmL,KAAK5C,EAAKkB,GAAO,EAChC5F,EAAKA,EAAK7D,KAAKmL,KAAKhD,EAAKwB,GAAO,EAEhCvC,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKhD,EAAKyB,GAAO,GACtB5J,KAAKmL,KAAK/C,EAAKuB,GAAO,EAClC1E,EAAKA,EAAKjF,KAAKmL,KAAK/C,EAAKwB,GAAO,EAChC/F,EAAKA,EAAK7D,KAAKmL,KAAKnD,EAAK8B,GAAO,EAEhC1C,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKnD,EAAK+B,GAAO,GACtB/J,KAAKmL,KAAKlD,EAAK6B,GAAO,EAClC7E,EAAKA,EAAKjF,KAAKmL,KAAKlD,EAAK8B,GAAO,EAChClG,EAAKA,EAAK7D,KAAKmL,KAAKtD,EAAKoC,GAAO,EAEhC7C,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKtD,EAAKqC,IAAO,GACtBlK,KAAKmL,KAAKrD,EAAKmC,GAAO,EAClChF,EAAKA,EAAKjF,KAAKmL,KAAKrD,EAAKoC,IAAO,EAChCrG,EAAKA,EAAK7D,KAAKmL,KAAKzD,EAAK0C,IAAO,EAEhChD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKzD,EAAK2C,IAAO,GACtBrK,KAAKmL,KAAKxD,EAAKyC,IAAO,EAClCnF,EAAKA,EAAKjF,KAAKmL,KAAKxD,EAAK0C,IAAO,EAKhC,IAAIoB,IAAMrM,GAJVyE,EAAKA,EAAK7D,KAAKmL,KAAK5D,EAAKgD,IAAO,GAIb,KAAa,MAFhCnD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK5D,EAAKiD,IAAO,GACtBxK,KAAKmL,KAAK3D,EAAK+C,IAAO,KAES,IAAM,EACjDnL,IAFA6F,EAAKA,EAAKjF,KAAKmL,KAAK3D,EAAKgD,IAAO,IAErBpD,IAAQ,IAAM,IAAMqE,KAAO,IAAM,EAC5CA,IAAM,SAEN5H,EAAK7D,KAAKmL,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKvC,EAAKU,IACTtJ,KAAKmL,KAAKtC,EAAKQ,GAAO,EAClCpE,EAAKjF,KAAKmL,KAAKtC,EAAKS,GACpBzF,EAAKA,EAAK7D,KAAKmL,KAAK1C,EAAKe,GAAO,EAEhCpC,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK1C,EAAKgB,GAAO,GACtBzJ,KAAKmL,KAAKzC,EAAKc,GAAO,EAClCvE,EAAKA,EAAKjF,KAAKmL,KAAKzC,EAAKe,GAAO,EAChC5F,EAAKA,EAAK7D,KAAKmL,KAAK7C,EAAKqB,GAAO,EAEhCvC,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK7C,EAAKsB,GAAO,GACtB5J,KAAKmL,KAAK5C,EAAKoB,GAAO,EAClC1E,EAAKA,EAAKjF,KAAKmL,KAAK5C,EAAKqB,GAAO,EAChC/F,EAAKA,EAAK7D,KAAKmL,KAAKhD,EAAK2B,GAAO,EAEhC1C,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKhD,EAAK4B,GAAO,GACtB/J,KAAKmL,KAAK/C,EAAK0B,GAAO,EAClC7E,EAAKA,EAAKjF,KAAKmL,KAAK/C,EAAK2B,GAAO,EAChClG,EAAKA,EAAK7D,KAAKmL,KAAKnD,EAAKiC,GAAO,EAEhC7C,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKnD,EAAKkC,IAAO,GACtBlK,KAAKmL,KAAKlD,EAAKgC,GAAO,EAClChF,EAAKA,EAAKjF,KAAKmL,KAAKlD,EAAKiC,IAAO,EAChCrG,EAAKA,EAAK7D,KAAKmL,KAAKtD,EAAKuC,IAAO,EAEhChD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKtD,EAAKwC,IAAO,GACtBrK,KAAKmL,KAAKrD,EAAKsC,IAAO,EAClCnF,EAAKA,EAAKjF,KAAKmL,KAAKrD,EAAKuC,IAAO,EAChCxG,EAAKA,EAAK7D,KAAKmL,KAAKzD,EAAK6C,IAAO,EAEhCnD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKzD,EAAK8C,IAAO,GACtBxK,KAAKmL,KAAKxD,EAAK4C,IAAO,EAClCtF,EAAKA,EAAKjF,KAAKmL,KAAKxD,EAAK6C,IAAO,EAKhC,IAAIkB,IAAMtM,GAJVyE,EAAKA,EAAK7D,KAAKmL,KAAK5D,EAAKmD,IAAO,GAIb,KAAa,MAFhCtD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK5D,EAAKoD,IAAO,GACtB3K,KAAKmL,KAAK3D,EAAKkD,IAAO,KAES,IAAM,EACjDtL,IAFA6F,EAAKA,EAAKjF,KAAKmL,KAAK3D,EAAKmD,IAAO,IAErBvD,IAAQ,IAAM,IAAMsE,KAAO,IAAM,EAC5CA,IAAM,SAEN7H,EAAK7D,KAAKmL,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKpC,EAAKO,IACTtJ,KAAKmL,KAAKnC,EAAKK,GAAO,EAClCpE,EAAKjF,KAAKmL,KAAKnC,EAAKM,GACpBzF,EAAKA,EAAK7D,KAAKmL,KAAKvC,EAAKY,GAAO,EAEhCpC,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKvC,EAAKa,GAAO,GACtBzJ,KAAKmL,KAAKtC,EAAKW,GAAO,EAClCvE,EAAKA,EAAKjF,KAAKmL,KAAKtC,EAAKY,GAAO,EAChC5F,EAAKA,EAAK7D,KAAKmL,KAAK1C,EAAKkB,GAAO,EAEhCvC,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK1C,EAAKmB,GAAO,GACtB5J,KAAKmL,KAAKzC,EAAKiB,GAAO,EAClC1E,EAAKA,EAAKjF,KAAKmL,KAAKzC,EAAKkB,GAAO,EAChC/F,EAAKA,EAAK7D,KAAKmL,KAAK7C,EAAKwB,GAAO,EAEhC1C,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK7C,EAAKyB,GAAO,GACtB/J,KAAKmL,KAAK5C,EAAKuB,GAAO,EAClC7E,EAAKA,EAAKjF,KAAKmL,KAAK5C,EAAKwB,GAAO,EAChClG,EAAKA,EAAK7D,KAAKmL,KAAKhD,EAAK8B,GAAO,EAEhC7C,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKhD,EAAK+B,IAAO,GACtBlK,KAAKmL,KAAK/C,EAAK6B,GAAO,EAClChF,EAAKA,EAAKjF,KAAKmL,KAAK/C,EAAK8B,IAAO,EAChCrG,EAAKA,EAAK7D,KAAKmL,KAAKnD,EAAKoC,IAAO,EAEhChD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKnD,EAAKqC,IAAO,GACtBrK,KAAKmL,KAAKlD,EAAKmC,IAAO,EAClCnF,EAAKA,EAAKjF,KAAKmL,KAAKlD,EAAKoC,IAAO,EAChCxG,EAAKA,EAAK7D,KAAKmL,KAAKtD,EAAK0C,IAAO,EAEhCnD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKtD,EAAK2C,IAAO,GACtBxK,KAAKmL,KAAKrD,EAAKyC,IAAO,EAClCtF,EAAKA,EAAKjF,KAAKmL,KAAKrD,EAAK0C,IAAO,EAChC3G,EAAKA,EAAK7D,KAAKmL,KAAKzD,EAAKgD,IAAO,EAEhCtD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKzD,EAAKiD,IAAO,GACtB3K,KAAKmL,KAAKxD,EAAK+C,IAAO,EAClCzF,EAAKA,EAAKjF,KAAKmL,KAAKxD,EAAKgD,IAAO,EAKhC,IAAIgB,IAAMvM,GAJVyE,EAAKA,EAAK7D,KAAKmL,KAAK5D,EAAKsD,IAAO,GAIb,KAAa,MAFhCzD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK5D,EAAKuD,IAAO,GACtB9K,KAAKmL,KAAK3D,EAAKqD,IAAO,KAES,IAAM,EACjDzL,IAFA6F,EAAKA,EAAKjF,KAAKmL,KAAK3D,EAAKsD,IAAO,IAErB1D,IAAQ,IAAM,IAAMuE,KAAO,IAAM,EAC5CA,IAAM,SAEN9H,EAAK7D,KAAKmL,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKI,IACTtJ,KAAKmL,KAAKhC,EAAKE,GAAO,EAClCpE,EAAKjF,KAAKmL,KAAKhC,EAAKG,GACpBzF,EAAKA,EAAK7D,KAAKmL,KAAKpC,EAAKS,GAAO,EAEhCpC,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKpC,EAAKU,GAAO,GACtBzJ,KAAKmL,KAAKnC,EAAKQ,GAAO,EAClCvE,EAAKA,EAAKjF,KAAKmL,KAAKnC,EAAKS,GAAO,EAChC5F,EAAKA,EAAK7D,KAAKmL,KAAKvC,EAAKe,GAAO,EAEhCvC,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKvC,EAAKgB,GAAO,GACtB5J,KAAKmL,KAAKtC,EAAKc,GAAO,EAClC1E,EAAKA,EAAKjF,KAAKmL,KAAKtC,EAAKe,GAAO,EAChC/F,EAAKA,EAAK7D,KAAKmL,KAAK1C,EAAKqB,GAAO,EAEhC1C,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK1C,EAAKsB,GAAO,GACtB/J,KAAKmL,KAAKzC,EAAKoB,GAAO,EAClC7E,EAAKA,EAAKjF,KAAKmL,KAAKzC,EAAKqB,GAAO,EAChClG,EAAKA,EAAK7D,KAAKmL,KAAK7C,EAAK2B,GAAO,EAEhC7C,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK7C,EAAK4B,IAAO,GACtBlK,KAAKmL,KAAK5C,EAAK0B,GAAO,EAClChF,EAAKA,EAAKjF,KAAKmL,KAAK5C,EAAK2B,IAAO,EAChCrG,EAAKA,EAAK7D,KAAKmL,KAAKhD,EAAKiC,IAAO,EAEhChD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKhD,EAAKkC,IAAO,GACtBrK,KAAKmL,KAAK/C,EAAKgC,IAAO,EAClCnF,EAAKA,EAAKjF,KAAKmL,KAAK/C,EAAKiC,IAAO,EAChCxG,EAAKA,EAAK7D,KAAKmL,KAAKnD,EAAKuC,IAAO,EAEhCnD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKnD,EAAKwC,IAAO,GACtBxK,KAAKmL,KAAKlD,EAAKsC,IAAO,EAClCtF,EAAKA,EAAKjF,KAAKmL,KAAKlD,EAAKuC,IAAO,EAChC3G,EAAKA,EAAK7D,KAAKmL,KAAKtD,EAAK6C,IAAO,EAEhCtD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKtD,EAAK8C,IAAO,GACtB3K,KAAKmL,KAAKrD,EAAK4C,IAAO,EAClCzF,EAAKA,EAAKjF,KAAKmL,KAAKrD,EAAK6C,IAAO,EAChC9G,EAAKA,EAAK7D,KAAKmL,KAAKzD,EAAKmD,IAAO,EAEhCzD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKzD,EAAKoD,IAAO,GACtB9K,KAAKmL,KAAKxD,EAAKkD,IAAO,EAClC5F,EAAKA,EAAKjF,KAAKmL,KAAKxD,EAAKmD,IAAO,EAKhC,IAAIc,IAAMxM,GAJVyE,EAAKA,EAAK7D,KAAKmL,KAAK5D,EAAKyD,IAAO,GAIb,KAAa,MAFhC5D,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK5D,EAAK0D,IAAO,GACtBjL,KAAKmL,KAAK3D,EAAKwD,IAAO,KAES,IAAM,EACjD5L,IAFA6F,EAAKA,EAAKjF,KAAKmL,KAAK3D,EAAKyD,IAAO,IAErB7D,IAAQ,IAAM,IAAMwE,KAAO,IAAM,EAC5CA,IAAM,SAEN/H,EAAK7D,KAAKmL,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKO,IACTzJ,KAAKmL,KAAKhC,EAAKK,GAAO,EAClCvE,EAAKjF,KAAKmL,KAAKhC,EAAKM,GACpB5F,EAAKA,EAAK7D,KAAKmL,KAAKpC,EAAKY,GAAO,EAEhCvC,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKpC,EAAKa,GAAO,GACtB5J,KAAKmL,KAAKnC,EAAKW,GAAO,EAClC1E,EAAKA,EAAKjF,KAAKmL,KAAKnC,EAAKY,GAAO,EAChC/F,EAAKA,EAAK7D,KAAKmL,KAAKvC,EAAKkB,GAAO,EAEhC1C,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKvC,EAAKmB,GAAO,GACtB/J,KAAKmL,KAAKtC,EAAKiB,GAAO,EAClC7E,EAAKA,EAAKjF,KAAKmL,KAAKtC,EAAKkB,GAAO,EAChClG,EAAKA,EAAK7D,KAAKmL,KAAK1C,EAAKwB,GAAO,EAEhC7C,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK1C,EAAKyB,IAAO,GACtBlK,KAAKmL,KAAKzC,EAAKuB,GAAO,EAClChF,EAAKA,EAAKjF,KAAKmL,KAAKzC,EAAKwB,IAAO,EAChCrG,EAAKA,EAAK7D,KAAKmL,KAAK7C,EAAK8B,IAAO,EAEhChD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK7C,EAAK+B,IAAO,GACtBrK,KAAKmL,KAAK5C,EAAK6B,IAAO,EAClCnF,EAAKA,EAAKjF,KAAKmL,KAAK5C,EAAK8B,IAAO,EAChCxG,EAAKA,EAAK7D,KAAKmL,KAAKhD,EAAKoC,IAAO,EAEhCnD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKhD,EAAKqC,IAAO,GACtBxK,KAAKmL,KAAK/C,EAAKmC,IAAO,EAClCtF,EAAKA,EAAKjF,KAAKmL,KAAK/C,EAAKoC,IAAO,EAChC3G,EAAKA,EAAK7D,KAAKmL,KAAKnD,EAAK0C,IAAO,EAEhCtD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKnD,EAAK2C,IAAO,GACtB3K,KAAKmL,KAAKlD,EAAKyC,IAAO,EAClCzF,EAAKA,EAAKjF,KAAKmL,KAAKlD,EAAK0C,IAAO,EAChC9G,EAAKA,EAAK7D,KAAKmL,KAAKtD,EAAKgD,IAAO,EAEhCzD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKtD,EAAKiD,IAAO,GACtB9K,KAAKmL,KAAKrD,EAAK+C,IAAO,EAClC5F,EAAKA,EAAKjF,KAAKmL,KAAKrD,EAAKgD,IAAO,EAKhC,IAAIe,IAAOzM,GAJXyE,EAAKA,EAAK7D,KAAKmL,KAAKzD,EAAKsD,IAAO,GAIZ,KAAa,MAFjC5D,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKzD,EAAKuD,IAAO,GACtBjL,KAAKmL,KAAKxD,EAAKqD,IAAO,KAEU,IAAM,EAClD5L,IAFA6F,EAAKA,EAAKjF,KAAKmL,KAAKxD,EAAKsD,IAAO,IAErB7D,IAAQ,IAAM,IAAMyE,KAAQ,IAAM,EAC7CA,IAAO,SAEPhI,EAAK7D,KAAKmL,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKU,IACT5J,KAAKmL,KAAKhC,EAAKQ,GAAO,EAClC1E,EAAKjF,KAAKmL,KAAKhC,EAAKS,GACpB/F,EAAKA,EAAK7D,KAAKmL,KAAKpC,EAAKe,GAAO,EAEhC1C,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKpC,EAAKgB,GAAO,GACtB/J,KAAKmL,KAAKnC,EAAKc,GAAO,EAClC7E,EAAKA,EAAKjF,KAAKmL,KAAKnC,EAAKe,GAAO,EAChClG,EAAKA,EAAK7D,KAAKmL,KAAKvC,EAAKqB,GAAO,EAEhC7C,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKvC,EAAKsB,IAAO,GACtBlK,KAAKmL,KAAKtC,EAAKoB,GAAO,EAClChF,EAAKA,EAAKjF,KAAKmL,KAAKtC,EAAKqB,IAAO,EAChCrG,EAAKA,EAAK7D,KAAKmL,KAAK1C,EAAK2B,IAAO,EAEhChD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK1C,EAAK4B,IAAO,GACtBrK,KAAKmL,KAAKzC,EAAK0B,IAAO,EAClCnF,EAAKA,EAAKjF,KAAKmL,KAAKzC,EAAK2B,IAAO,EAChCxG,EAAKA,EAAK7D,KAAKmL,KAAK7C,EAAKiC,IAAO,EAEhCnD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK7C,EAAKkC,IAAO,GACtBxK,KAAKmL,KAAK5C,EAAKgC,IAAO,EAClCtF,EAAKA,EAAKjF,KAAKmL,KAAK5C,EAAKiC,IAAO,EAChC3G,EAAKA,EAAK7D,KAAKmL,KAAKhD,EAAKuC,IAAO,EAEhCtD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKhD,EAAKwC,IAAO,GACtB3K,KAAKmL,KAAK/C,EAAKsC,IAAO,EAClCzF,EAAKA,EAAKjF,KAAKmL,KAAK/C,EAAKuC,IAAO,EAChC9G,EAAKA,EAAK7D,KAAKmL,KAAKnD,EAAK6C,IAAO,EAEhCzD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKnD,EAAK8C,IAAO,GACtB9K,KAAKmL,KAAKlD,EAAK4C,IAAO,EAClC5F,EAAKA,EAAKjF,KAAKmL,KAAKlD,EAAK6C,IAAO,EAKhC,IAAIgB,IAAO1M,GAJXyE,EAAKA,EAAK7D,KAAKmL,KAAKtD,EAAKmD,IAAO,GAIZ,KAAa,MAFjC5D,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKtD,EAAKoD,IAAO,GACtBjL,KAAKmL,KAAKrD,EAAKkD,IAAO,KAEU,IAAM,EAClD5L,IAFA6F,EAAKA,EAAKjF,KAAKmL,KAAKrD,EAAKmD,IAAO,IAErB7D,IAAQ,IAAM,IAAM0E,KAAQ,IAAM,EAC7CA,IAAO,SAEPjI,EAAK7D,KAAKmL,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKa,IACT/J,KAAKmL,KAAKhC,EAAKW,GAAO,EAClC7E,EAAKjF,KAAKmL,KAAKhC,EAAKY,GACpBlG,EAAKA,EAAK7D,KAAKmL,KAAKpC,EAAKkB,GAAO,EAEhC7C,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKpC,EAAKmB,IAAO,GACtBlK,KAAKmL,KAAKnC,EAAKiB,GAAO,EAClChF,EAAKA,EAAKjF,KAAKmL,KAAKnC,EAAKkB,IAAO,EAChCrG,EAAKA,EAAK7D,KAAKmL,KAAKvC,EAAKwB,IAAO,EAEhChD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKvC,EAAKyB,IAAO,GACtBrK,KAAKmL,KAAKtC,EAAKuB,IAAO,EAClCnF,EAAKA,EAAKjF,KAAKmL,KAAKtC,EAAKwB,IAAO,EAChCxG,EAAKA,EAAK7D,KAAKmL,KAAK1C,EAAK8B,IAAO,EAEhCnD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK1C,EAAK+B,IAAO,GACtBxK,KAAKmL,KAAKzC,EAAK6B,IAAO,EAClCtF,EAAKA,EAAKjF,KAAKmL,KAAKzC,EAAK8B,IAAO,EAChC3G,EAAKA,EAAK7D,KAAKmL,KAAK7C,EAAKoC,IAAO,EAEhCtD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK7C,EAAKqC,IAAO,GACtB3K,KAAKmL,KAAK5C,EAAKmC,IAAO,EAClCzF,EAAKA,EAAKjF,KAAKmL,KAAK5C,EAAKoC,IAAO,EAChC9G,EAAKA,EAAK7D,KAAKmL,KAAKhD,EAAK0C,IAAO,EAEhCzD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKhD,EAAK2C,IAAO,GACtB9K,KAAKmL,KAAK/C,EAAKyC,IAAO,EAClC5F,EAAKA,EAAKjF,KAAKmL,KAAK/C,EAAK0C,IAAO,EAKhC,IAAIiB,IAAO3M,GAJXyE,EAAKA,EAAK7D,KAAKmL,KAAKnD,EAAKgD,IAAO,GAIZ,KAAa,MAFjC5D,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKnD,EAAKiD,IAAO,GACtBjL,KAAKmL,KAAKlD,EAAK+C,IAAO,KAEU,IAAM,EAClD5L,IAFA6F,EAAKA,EAAKjF,KAAKmL,KAAKlD,EAAKgD,IAAO,IAErB7D,IAAQ,IAAM,IAAM2E,KAAQ,IAAM,EAC7CA,IAAO,SAEPlI,EAAK7D,KAAKmL,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKgB,KACTlK,KAAKmL,KAAKhC,EAAKc,GAAO,EAClChF,EAAKjF,KAAKmL,KAAKhC,EAAKe,IACpBrG,EAAKA,EAAK7D,KAAKmL,KAAKpC,EAAKqB,IAAO,EAEhChD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKpC,EAAKsB,IAAO,GACtBrK,KAAKmL,KAAKnC,EAAKoB,IAAO,EAClCnF,EAAKA,EAAKjF,KAAKmL,KAAKnC,EAAKqB,IAAO,EAChCxG,EAAKA,EAAK7D,KAAKmL,KAAKvC,EAAK2B,IAAO,EAEhCnD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKvC,EAAK4B,IAAO,GACtBxK,KAAKmL,KAAKtC,EAAK0B,IAAO,EAClCtF,EAAKA,EAAKjF,KAAKmL,KAAKtC,EAAK2B,IAAO,EAChC3G,EAAKA,EAAK7D,KAAKmL,KAAK1C,EAAKiC,IAAO,EAEhCtD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK1C,EAAKkC,IAAO,GACtB3K,KAAKmL,KAAKzC,EAAKgC,IAAO,EAClCzF,EAAKA,EAAKjF,KAAKmL,KAAKzC,EAAKiC,IAAO,EAChC9G,EAAKA,EAAK7D,KAAKmL,KAAK7C,EAAKuC,IAAO,EAEhCzD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK7C,EAAKwC,IAAO,GACtB9K,KAAKmL,KAAK5C,EAAKsC,IAAO,EAClC5F,EAAKA,EAAKjF,KAAKmL,KAAK5C,EAAKuC,IAAO,EAKhC,IAAIkB,IAAO5M,GAJXyE,EAAKA,EAAK7D,KAAKmL,KAAKhD,EAAK6C,IAAO,GAIZ,KAAa,MAFjC5D,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKhD,EAAK8C,IAAO,GACtBjL,KAAKmL,KAAK/C,EAAK4C,IAAO,KAEU,IAAM,EAClD5L,IAFA6F,EAAKA,EAAKjF,KAAKmL,KAAK/C,EAAK6C,IAAO,IAErB7D,IAAQ,IAAM,IAAM4E,KAAQ,IAAM,EAC7CA,IAAO,SAEPnI,EAAK7D,KAAKmL,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKmB,KACTrK,KAAKmL,KAAKhC,EAAKiB,IAAO,EAClCnF,EAAKjF,KAAKmL,KAAKhC,EAAKkB,IACpBxG,EAAKA,EAAK7D,KAAKmL,KAAKpC,EAAKwB,IAAO,EAEhCnD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKpC,EAAKyB,IAAO,GACtBxK,KAAKmL,KAAKnC,EAAKuB,IAAO,EAClCtF,EAAKA,EAAKjF,KAAKmL,KAAKnC,EAAKwB,IAAO,EAChC3G,EAAKA,EAAK7D,KAAKmL,KAAKvC,EAAK8B,IAAO,EAEhCtD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKvC,EAAK+B,IAAO,GACtB3K,KAAKmL,KAAKtC,EAAK6B,IAAO,EAClCzF,EAAKA,EAAKjF,KAAKmL,KAAKtC,EAAK8B,IAAO,EAChC9G,EAAKA,EAAK7D,KAAKmL,KAAK1C,EAAKoC,IAAO,EAEhCzD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK1C,EAAKqC,IAAO,GACtB9K,KAAKmL,KAAKzC,EAAKmC,IAAO,EAClC5F,EAAKA,EAAKjF,KAAKmL,KAAKzC,EAAKoC,IAAO,EAKhC,IAAImB,IAAO7M,GAJXyE,EAAKA,EAAK7D,KAAKmL,KAAK7C,EAAK0C,IAAO,GAIZ,KAAa,MAFjC5D,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK7C,EAAK2C,IAAO,GACtBjL,KAAKmL,KAAK5C,EAAKyC,IAAO,KAEU,IAAM,EAClD5L,IAFA6F,EAAKA,EAAKjF,KAAKmL,KAAK5C,EAAK0C,IAAO,IAErB7D,IAAQ,IAAM,IAAM6E,KAAQ,IAAM,EAC7CA,IAAO,SAEPpI,EAAK7D,KAAKmL,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKsB,KACTxK,KAAKmL,KAAKhC,EAAKoB,IAAO,EAClCtF,EAAKjF,KAAKmL,KAAKhC,EAAKqB,IACpB3G,EAAKA,EAAK7D,KAAKmL,KAAKpC,EAAK2B,IAAO,EAEhCtD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKpC,EAAK4B,IAAO,GACtB3K,KAAKmL,KAAKnC,EAAK0B,IAAO,EAClCzF,EAAKA,EAAKjF,KAAKmL,KAAKnC,EAAK2B,IAAO,EAChC9G,EAAKA,EAAK7D,KAAKmL,KAAKvC,EAAKiC,IAAO,EAEhCzD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKvC,EAAKkC,IAAO,GACtB9K,KAAKmL,KAAKtC,EAAKgC,IAAO,EAClC5F,EAAKA,EAAKjF,KAAKmL,KAAKtC,EAAKiC,IAAO,EAKhC,IAAIoB,IAAO9M,GAJXyE,EAAKA,EAAK7D,KAAKmL,KAAK1C,EAAKuC,IAAO,GAIZ,KAAa,MAFjC5D,GADAA,EAAMA,EAAMpH,KAAKmL,KAAK1C,EAAKwC,IAAO,GACtBjL,KAAKmL,KAAKzC,EAAKsC,IAAO,KAEU,IAAM,EAClD5L,IAFA6F,EAAKA,EAAKjF,KAAKmL,KAAKzC,EAAKuC,IAAO,IAErB7D,IAAQ,IAAM,IAAM8E,KAAQ,IAAM,EAC7CA,IAAO,SAEPrI,EAAK7D,KAAKmL,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAKyB,KACT3K,KAAKmL,KAAKhC,EAAKuB,IAAO,EAClCzF,EAAKjF,KAAKmL,KAAKhC,EAAKwB,IACpB9G,EAAKA,EAAK7D,KAAKmL,KAAKpC,EAAK8B,IAAO,EAEhCzD,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKpC,EAAK+B,IAAO,GACtB9K,KAAKmL,KAAKnC,EAAK6B,IAAO,EAClC5F,EAAKA,EAAKjF,KAAKmL,KAAKnC,EAAK8B,IAAO,EAKhC,IAAIqB,IAAO/M,GAJXyE,EAAKA,EAAK7D,KAAKmL,KAAKvC,EAAKoC,IAAO,GAIZ,KAAa,MAFjC5D,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKvC,EAAKqC,IAAO,GACtBjL,KAAKmL,KAAKtC,EAAKmC,IAAO,KAEU,IAAM,EAClD5L,IAFA6F,EAAKA,EAAKjF,KAAKmL,KAAKtC,EAAKoC,IAAO,IAErB7D,IAAQ,IAAM,IAAM+E,KAAQ,IAAM,EAC7CA,IAAO,SAEPtI,EAAK7D,KAAKmL,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAK4B,KACT9K,KAAKmL,KAAKhC,EAAK0B,IAAO,EAClC5F,EAAKjF,KAAKmL,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAAOhN,GAJXyE,EAAKA,EAAK7D,KAAKmL,KAAKpC,EAAKiC,IAAO,GAIZ,KAAa,MAFjC5D,GADAA,EAAMA,EAAMpH,KAAKmL,KAAKpC,EAAKkC,IAAO,GACtBjL,KAAKmL,KAAKnC,EAAKgC,IAAO,KAEU,IAAM,EAClD5L,IAFA6F,EAAKA,EAAKjF,KAAKmL,KAAKnC,EAAKiC,IAAO,IAErB7D,IAAQ,IAAM,IAAMgF,KAAQ,IAAM,EAC7CA,IAAO,SAMP,IAAIC,IAAOjN,GAJXyE,EAAK7D,KAAKmL,KAAKjC,EAAK8B,KAIA,KAAa,MAFjC5D,GADAA,EAAMpH,KAAKmL,KAAKjC,EAAK+B,KACTjL,KAAKmL,KAAKhC,EAAK6B,IAAO,KAEU,IAAM,EA0BlD,OAzBA5L,IAFA6F,EAAKjF,KAAKmL,KAAKhC,EAAK8B,MAET7D,IAAQ,IAAM,IAAMiF,KAAQ,IAAM,EAC7CA,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,IAANjN,IACFiI,EAAE,IAAMjI,EACR0D,EAAItE,UAECsE,CACT,EAMA,SAASwJ,EAAS3I,EAAMrD,EAAKwC,GAC3BA,EAAIxE,SAAWgC,EAAIhC,SAAWqF,EAAKrF,SACnCwE,EAAItE,OAASmF,EAAKnF,OAAS8B,EAAI9B,OAG/B,IAFA,IAAIuE,EAAQ,EACRwJ,EAAU,EACLzI,EAAI,EAAGA,EAAIhB,EAAItE,OAAS,EAAGsF,IAAK,CAGvC,IAAIC,EAASwI,EACbA,EAAU,EAGV,IAFA,IAAIvI,EAAgB,SAARjB,EACRkB,EAAOjE,KAAKC,IAAI6D,EAAGxD,EAAI9B,OAAS,GAC3B6C,EAAIrB,KAAKS,IAAI,EAAGqD,EAAIH,EAAKnF,OAAS,GAAI6C,GAAK4C,EAAM5C,IAAK,CAC7D,IAAInB,EAAI4D,EAAIzC,EAGR7B,GAFoB,EAAhBmE,EAAKpF,MAAM2B,KACI,EAAfI,EAAI/B,MAAM8C,IAEdwC,EAAS,SAAJrE,EAGTwE,EAAa,UADbH,EAAKA,EAAKG,EAAQ,GAGlBuI,IADAxI,GAHAA,EAASA,GAAUvE,EAAI,SAAY,GAAK,IAGrBqE,IAAO,IAAM,KACV,GACtBE,GAAU,QACZ,CACAjB,EAAIvE,MAAMuF,GAAKE,EACfjB,EAAQgB,EACRA,EAASwI,CACX,CAMA,OALc,IAAVxJ,EACFD,EAAIvE,MAAMuF,GAAKf,EAEfD,EAAItE,SAECsE,EAAItB,QACb,CACA,SAASgL,EAAW7I,EAAMrD,EAAKwC,GAI7B,OAAOwJ,EAAS3I,EAAMrD,EAAKwC,EAC7B,CAmBA,SAAS2J,EAAKC,EAAGC,GACftO,KAAKqO,EAAIA,EACTrO,KAAKsO,EAAIA,CACX,CAlEK3M,KAAKmL,OACRhE,EAAczD,GA4ChB1F,EAAGF,UAAU8O,MAAQ,SAAetM,EAAKwC,GACvC,IACI/C,EAAM1B,KAAKG,OAAS8B,EAAI9B,OAU5B,OAToB,KAAhBH,KAAKG,QAAgC,KAAf8B,EAAI9B,OACtB2I,EAAY9I,KAAMiC,EAAKwC,GACpB/C,EAAM,GACT2D,EAAWrF,KAAMiC,EAAKwC,GACnB/C,EAAM,KACTuM,EAASjO,KAAMiC,EAAKwC,GAEpB0J,EAAWnO,KAAMiC,EAAKwC,EAGhC,EASA2J,EAAK3O,UAAU+O,QAAU,SAAiBC,GAGxC,IAFA,IAAIhI,EAAI,IAAIvE,MAAMuM,GACdC,EAAI/O,EAAGF,UAAU+G,WAAWiI,GAAK,EAC5B5M,EAAI,EAAGA,EAAI4M,EAAG5M,IACrB4E,EAAE5E,GAAK7B,KAAK2O,OAAO9M,EAAG6M,EAAGD,GAE3B,OAAOhI,CACT,EAGA2H,EAAK3O,UAAUkP,OAAS,SAAgBN,EAAGK,EAAGD,GAC5C,GAAU,IAANJ,GAAWA,IAAMI,EAAI,EAAG,OAAOJ,EAEnC,IADA,IAAIO,EAAK,EACA/M,EAAI,EAAGA,EAAI6M,EAAG7M,IACrB+M,IAAW,EAAJP,IAAUK,EAAI7M,EAAI,EACzBwM,IAAM,EAER,OAAOO,CACT,EAIAR,EAAK3O,UAAUoP,QAAU,SAAiBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACnE,IAAK,IAAI5M,EAAI,EAAGA,EAAI4M,EAAG5M,IACrBoN,EAAKpN,GAAKkN,EAAID,EAAIjN,IAClBqN,EAAKrN,GAAKmN,EAAIF,EAAIjN,GAEtB,EACAuM,EAAK3O,UAAU0P,UAAY,SAAmBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACrE9O,KAAK6O,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACxC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAI3B,IAHA,IAAIV,EAAIU,GAAK,EACTC,EAAQ1N,KAAK2N,IAAI,EAAI3N,KAAK4N,GAAKb,GAC/Bc,EAAQ7N,KAAK8N,IAAI,EAAI9N,KAAK4N,GAAKb,GAC1BgB,EAAI,EAAGA,EAAIjB,EAAGiB,GAAKhB,EAG1B,IAFA,IAAIiB,EAASN,EACTO,EAASJ,EACJxM,EAAI,EAAGA,EAAIoM,EAAGpM,IAAK,CAC1B,IAAI6M,EAAKZ,EAAKS,EAAI1M,GACd8M,EAAKZ,EAAKQ,EAAI1M,GACd+M,EAAKd,EAAKS,EAAI1M,EAAIoM,GAClBY,EAAKd,EAAKQ,EAAI1M,EAAIoM,GAClBa,EAAKN,EAASI,EAAKH,EAASI,EAChCA,EAAKL,EAASK,EAAKJ,EAASG,EAC5BA,EAAKE,EACLhB,EAAKS,EAAI1M,GAAK6M,EAAKE,EACnBb,EAAKQ,EAAI1M,GAAK8M,EAAKE,EACnBf,EAAKS,EAAI1M,EAAIoM,GAAKS,EAAKE,EACvBb,EAAKQ,EAAI1M,EAAIoM,GAAKU,EAAKE,EAGnBhN,IAAM0L,IACRuB,EAAKZ,EAAQM,EAASH,EAAQI,EAC9BA,EAASP,EAAQO,EAASJ,EAAQG,EAClCA,EAASM,EAEb,CAGN,EACA7B,EAAK3O,UAAUyQ,YAAc,SAAqBC,EAAGC,GACnD,IAAI3B,EAAqB,EAAjB9M,KAAKS,IAAIgO,EAAGD,GAChBE,EAAU,EAAJ5B,EACN5M,EAAI,EACR,IAAK4M,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/B5M,IAEF,OAAO,GAAKA,EAAI,EAAIwO,CACtB,EACAjC,EAAK3O,UAAU6Q,UAAY,SAAmBvB,EAAKC,EAAKP,GACtD,KAAIA,GAAK,GACT,IAAK,IAAI5M,EAAI,EAAGA,EAAI4M,EAAI,EAAG5M,IAAK,CAC9B,IAAI4E,EAAIsI,EAAIlN,GACZkN,EAAIlN,GAAKkN,EAAIN,EAAI5M,EAAI,GACrBkN,EAAIN,EAAI5M,EAAI,GAAK4E,EACjBA,EAAIuI,EAAInN,GACRmN,EAAInN,IAAMmN,EAAIP,EAAI5M,EAAI,GACtBmN,EAAIP,EAAI5M,EAAI,IAAM4E,CACpB,CACF,EACA2H,EAAK3O,UAAU8Q,aAAe,SAAsBC,EAAI/B,GAEtD,IADA,IAAI/J,EAAQ,EACH7C,EAAI,EAAGA,EAAI4M,EAAI,EAAG5M,IAAK,CAC9B,IAAIoB,EAAoC,KAAhCtB,KAAK8O,MAAMD,EAAG,EAAI3O,EAAI,GAAK4M,GAAc9M,KAAK8O,MAAMD,EAAG,EAAI3O,GAAK4M,GAAK/J,EAC7E8L,EAAG3O,GAAS,SAAJoB,EAENyB,EADEzB,EAAI,SACE,EAEAA,EAAI,SAAY,CAE5B,CACA,OAAOuN,CACT,EACApC,EAAK3O,UAAUiR,WAAa,SAAoBF,EAAI9O,EAAKqN,EAAKN,GAE5D,IADA,IAAI/J,EAAQ,EACH7C,EAAI,EAAGA,EAAIH,EAAKG,IACvB6C,GAAyB,EAAR8L,EAAG3O,GACpBkN,EAAI,EAAIlN,GAAa,KAAR6C,EACbA,KAAkB,GAClBqK,EAAI,EAAIlN,EAAI,GAAa,KAAR6C,EACjBA,KAAkB,GAIpB,IAAK7C,EAAI,EAAIH,EAAKG,EAAI4M,IAAK5M,EACzBkN,EAAIlN,GAAK,EAEX7C,EAAiB,IAAV0F,GACP1F,EAA6B,MAAb,KAAR0F,GACV,EACA0J,EAAK3O,UAAUkR,KAAO,SAAclC,GAElC,IADA,IAAImC,EAAK,IAAI1O,MAAMuM,GACV5M,EAAI,EAAGA,EAAI4M,EAAG5M,IACrB+O,EAAG/O,GAAK,EAEV,OAAO+O,CACT,EACAxC,EAAK3O,UAAUoR,KAAO,SAAcxC,EAAGC,EAAG7J,GACxC,IAAIgK,EAAI,EAAIzO,KAAKkQ,YAAY7B,EAAElO,OAAQmO,EAAEnO,QACrC2O,EAAM9O,KAAKwO,QAAQC,GACnBqC,EAAI9Q,KAAK2Q,KAAKlC,GACdM,EAAM,IAAI7M,MAAMuM,GAChBsC,EAAO,IAAI7O,MAAMuM,GACjBuC,EAAO,IAAI9O,MAAMuM,GACjBwC,EAAO,IAAI/O,MAAMuM,GACjByC,EAAQ,IAAIhP,MAAMuM,GAClB0C,EAAQ,IAAIjP,MAAMuM,GAClB2C,EAAO3M,EAAIvE,MACfkR,EAAKjR,OAASsO,EACdzO,KAAK0Q,WAAWrC,EAAEnO,MAAOmO,EAAElO,OAAQ4O,EAAKN,GACxCzO,KAAK0Q,WAAWpC,EAAEpO,MAAOoO,EAAEnO,OAAQ8Q,EAAMxC,GACzCzO,KAAKmP,UAAUJ,EAAK+B,EAAGC,EAAMC,EAAMvC,EAAGK,GACtC9O,KAAKmP,UAAU8B,EAAMH,EAAGI,EAAOC,EAAO1C,EAAGK,GACzC,IAAK,IAAIjN,EAAI,EAAGA,EAAI4M,EAAG5M,IAAK,CAC1B,IAAIoO,EAAKc,EAAKlP,GAAKqP,EAAMrP,GAAKmP,EAAKnP,GAAKsP,EAAMtP,GAC9CmP,EAAKnP,GAAKkP,EAAKlP,GAAKsP,EAAMtP,GAAKmP,EAAKnP,GAAKqP,EAAMrP,GAC/CkP,EAAKlP,GAAKoO,CACZ,CAOA,OANAjQ,KAAKsQ,UAAUS,EAAMC,EAAMvC,GAC3BzO,KAAKmP,UAAU4B,EAAMC,EAAMI,EAAMN,EAAGrC,EAAGK,GACvC9O,KAAKsQ,UAAUc,EAAMN,EAAGrC,GACxBzO,KAAKuQ,aAAaa,EAAM3C,GACxBhK,EAAIxE,SAAWoO,EAAEpO,SAAWqO,EAAErO,SAC9BwE,EAAItE,OAASkO,EAAElO,OAASmO,EAAEnO,OACnBsE,EAAItB,QACb,EAGAxD,EAAGF,UAAU+B,IAAM,SAAaS,GAC9B,IAAIwC,EAAM,IAAI9E,EAAG,MAEjB,OADA8E,EAAIvE,MAAQ,IAAIgC,MAAMlC,KAAKG,OAAS8B,EAAI9B,QACjCH,KAAKuO,MAAMtM,EAAKwC,EACzB,EAGA9E,EAAGF,UAAU4R,KAAO,SAAcpP,GAChC,IAAIwC,EAAM,IAAI9E,EAAG,MAEjB,OADA8E,EAAIvE,MAAQ,IAAIgC,MAAMlC,KAAKG,OAAS8B,EAAI9B,QACjCgO,EAAWnO,KAAMiC,EAAKwC,EAC/B,EAGA9E,EAAGF,UAAUqN,KAAO,SAAc7K,GAChC,OAAOjC,KAAK8D,QAAQyK,MAAMtM,EAAKjC,KACjC,EACAL,EAAGF,UAAUgE,MAAQ,SAAexB,GAClC,IAAIqP,EAAWrP,EAAM,EACjBqP,IAAUrP,GAAOA,GACrBjD,EAAsB,kBAARiD,GACdjD,EAAOiD,EAAM,UAIb,IADA,IAAIyC,EAAQ,EACH7C,EAAI,EAAGA,EAAI7B,KAAKG,OAAQ0B,IAAK,CACpC,IAAIoB,GAAqB,EAAhBjD,KAAKE,MAAM2B,IAAUI,EAC1BuD,GAAU,SAAJvC,IAA0B,SAARyB,GAC5BA,IAAU,GACVA,GAASzB,EAAI,SAAY,EAEzByB,GAASc,IAAO,GAChBxF,KAAKE,MAAM2B,GAAU,SAAL2D,CAClB,CAKA,OAJc,IAAVd,IACF1E,KAAKE,MAAM2B,GAAK6C,EAChB1E,KAAKG,UAEAmR,EAAWtR,KAAKsH,OAAStH,IAClC,EACAL,EAAGF,UAAU8R,KAAO,SAActP,GAChC,OAAOjC,KAAK8D,QAAQL,MAAMxB,EAC5B,EAGAtC,EAAGF,UAAU+R,IAAM,WACjB,OAAOxR,KAAKwB,IAAIxB,KAClB,EAGAL,EAAGF,UAAUgS,KAAO,WAClB,OAAOzR,KAAK8M,KAAK9M,KAAK8D,QACxB,EAGAnE,EAAGF,UAAUkE,IAAM,SAAa1B,GAC9B,IAAIgB,EAxrCN,SAAoBhB,GAElB,IADA,IAAIgB,EAAI,IAAIf,MAAMD,EAAI0E,aACb6B,EAAM,EAAGA,EAAMvF,EAAE9C,OAAQqI,IAAO,CACvC,IAAItF,EAAMsF,EAAM,GAAK,EACjBC,EAAOD,EAAM,GACjBvF,EAAEuF,GAAOvG,EAAI/B,MAAMgD,KAASuF,EAAO,CACrC,CACA,OAAOxF,CACT,CAgrCUyO,CAAWzP,GACnB,GAAiB,IAAbgB,EAAE9C,OAAc,OAAO,IAAIR,EAAG,GAIlC,IADA,IAAIqG,EAAMhG,KACD6B,EAAI,EAAGA,EAAIoB,EAAE9C,QACP,IAAT8C,EAAEpB,GADsBA,IAAKmE,EAAMA,EAAIwL,OAG7C,KAAM3P,EAAIoB,EAAE9C,OACV,IAAK,IAAIwR,EAAI3L,EAAIwL,MAAO3P,EAAIoB,EAAE9C,OAAQ0B,IAAK8P,EAAIA,EAAEH,MAClC,IAATvO,EAAEpB,KACNmE,EAAMA,EAAIxE,IAAImQ,IAGlB,OAAO3L,CACT,EAGArG,EAAGF,UAAUmS,OAAS,SAAgBC,GACpC7S,EAAuB,kBAAT6S,GAAqBA,GAAQ,GAC3C,IAGIhQ,EAHAV,EAAI0Q,EAAO,GACXzC,GAAKyC,EAAO1Q,GAAK,GACjB2Q,EAAY,WAAc,GAAK3Q,GAAK,GAAKA,EAE7C,GAAU,IAANA,EAAS,CACX,IAAIuD,EAAQ,EACZ,IAAK7C,EAAI,EAAGA,EAAI7B,KAAKG,OAAQ0B,IAAK,CAChC,IAAIkQ,EAAW/R,KAAKE,MAAM2B,GAAKiQ,EAC3B/Q,GAAqB,EAAhBf,KAAKE,MAAM2B,IAAUkQ,GAAY5Q,EAC1CnB,KAAKE,MAAM2B,GAAKd,EAAI2D,EACpBA,EAAQqN,IAAa,GAAK5Q,CAC5B,CACIuD,IACF1E,KAAKE,MAAM2B,GAAK6C,EAChB1E,KAAKG,SAET,CACA,GAAU,IAANiP,EAAS,CACX,IAAKvN,EAAI7B,KAAKG,OAAS,EAAG0B,GAAK,EAAGA,IAChC7B,KAAKE,MAAM2B,EAAIuN,GAAKpP,KAAKE,MAAM2B,GAEjC,IAAKA,EAAI,EAAGA,EAAIuN,EAAGvN,IACjB7B,KAAKE,MAAM2B,GAAK,EAElB7B,KAAKG,QAAUiP,CACjB,CACA,OAAOpP,KAAKmD,QACd,EACAxD,EAAGF,UAAUuS,MAAQ,SAAeH,GAGlC,OADA7S,EAAyB,IAAlBgB,KAAKC,UACLD,KAAK4R,OAAOC,EACrB,EAKAlS,EAAGF,UAAUwS,OAAS,SAAgBJ,EAAMK,EAAMC,GAEhD,IAAIC,EADJpT,EAAuB,kBAAT6S,GAAqBA,GAAQ,GAGzCO,EADEF,GACGA,EAAOA,EAAO,IAAM,GAErB,EAEN,IAAI/Q,EAAI0Q,EAAO,GACXzC,EAAIzN,KAAKC,KAAKiQ,EAAO1Q,GAAK,GAAInB,KAAKG,QACnCkS,EAAO,SAAY,WAAclR,GAAKA,EACtCmR,EAAcH,EAKlB,GAJAC,GAAKhD,EACLgD,EAAIzQ,KAAKS,IAAI,EAAGgQ,GAGZE,EAAa,CACf,IAAK,IAAIzQ,EAAI,EAAGA,EAAIuN,EAAGvN,IACrByQ,EAAYpS,MAAM2B,GAAK7B,KAAKE,MAAM2B,GAEpCyQ,EAAYnS,OAASiP,CACvB,CACA,GAAU,IAANA,QAEG,GAAIpP,KAAKG,OAASiP,EAEvB,IADApP,KAAKG,QAAUiP,EACVvN,EAAI,EAAGA,EAAI7B,KAAKG,OAAQ0B,IAC3B7B,KAAKE,MAAM2B,GAAK7B,KAAKE,MAAM2B,EAAIuN,QAGjCpP,KAAKE,MAAM,GAAK,EAChBF,KAAKG,OAAS,EAEhB,IAAIuE,EAAQ,EACZ,IAAK7C,EAAI7B,KAAKG,OAAS,EAAG0B,GAAK,IAAgB,IAAV6C,GAAe7C,GAAKuQ,GAAIvQ,IAAK,CAChE,IAAI2B,EAAuB,EAAhBxD,KAAKE,MAAM2B,GACtB7B,KAAKE,MAAM2B,GAAK6C,GAAS,GAAKvD,EAAIqC,IAASrC,EAC3CuD,EAAQlB,EAAO6O,CACjB,CAUA,OAPIC,GAAyB,IAAV5N,IACjB4N,EAAYpS,MAAMoS,EAAYnS,UAAYuE,GAExB,IAAhB1E,KAAKG,SACPH,KAAKE,MAAM,GAAK,EAChBF,KAAKG,OAAS,GAETH,KAAKmD,QACd,EACAxD,EAAGF,UAAU8S,MAAQ,SAAeV,EAAMK,EAAMC,GAG9C,OADAnT,EAAyB,IAAlBgB,KAAKC,UACLD,KAAKiS,OAAOJ,EAAMK,EAAMC,EACjC,EAGAxS,EAAGF,UAAU+S,KAAO,SAAcX,GAChC,OAAO7R,KAAK8D,QAAQkO,MAAMH,EAC5B,EACAlS,EAAGF,UAAUgT,MAAQ,SAAeZ,GAClC,OAAO7R,KAAK8D,QAAQ8N,OAAOC,EAC7B,EAGAlS,EAAGF,UAAUiT,KAAO,SAAcb,GAChC,OAAO7R,KAAK8D,QAAQyO,MAAMV,EAC5B,EACAlS,EAAGF,UAAUkT,MAAQ,SAAed,GAClC,OAAO7R,KAAK8D,QAAQmO,OAAOJ,EAC7B,EAGAlS,EAAGF,UAAU2H,MAAQ,SAAeoB,GAClCxJ,EAAsB,kBAARwJ,GAAoBA,GAAO,GACzC,IAAIrH,EAAIqH,EAAM,GACV4G,GAAK5G,EAAMrH,GAAK,GAChBwQ,EAAI,GAAKxQ,EAGb,QAAInB,KAAKG,QAAUiP,OAGXpP,KAAKE,MAAMkP,GACLuC,EAChB,EAGAhS,EAAGF,UAAUmT,OAAS,SAAgBf,GACpC7S,EAAuB,kBAAT6S,GAAqBA,GAAQ,GAC3C,IAAI1Q,EAAI0Q,EAAO,GACXzC,GAAKyC,EAAO1Q,GAAK,GAErB,GADAnC,EAAyB,IAAlBgB,KAAKC,SAAgB,2CACxBD,KAAKG,QAAUiP,EACjB,OAAOpP,KAMT,GAJU,IAANmB,GACFiO,IAEFpP,KAAKG,OAASwB,KAAKC,IAAIwN,EAAGpP,KAAKG,QACrB,IAANgB,EAAS,CACX,IAAIkR,EAAO,SAAY,WAAclR,GAAKA,EAC1CnB,KAAKE,MAAMF,KAAKG,OAAS,IAAMkS,CACjC,CACA,OAAOrS,KAAKmD,QACd,EAGAxD,EAAGF,UAAUoT,MAAQ,SAAehB,GAClC,OAAO7R,KAAK8D,QAAQ8O,OAAOf,EAC7B,EAGAlS,EAAGF,UAAUyH,MAAQ,SAAejF,GAGlC,OAFAjD,EAAsB,kBAARiD,GACdjD,EAAOiD,EAAM,UACTA,EAAM,EAAUjC,KAAK8S,OAAO7Q,GAGV,IAAlBjC,KAAKC,SACa,IAAhBD,KAAKG,SAAiC,EAAhBH,KAAKE,MAAM,KAAW+B,GAC9CjC,KAAKE,MAAM,GAAK+B,GAAuB,EAAhBjC,KAAKE,MAAM,IAClCF,KAAKC,SAAW,EACTD,OAETA,KAAKC,SAAW,EAChBD,KAAK8S,MAAM7Q,GACXjC,KAAKC,SAAW,EACTD,MAIFA,KAAK0D,OAAOzB,EACrB,EACAtC,EAAGF,UAAUiE,OAAS,SAAgBzB,GACpCjC,KAAKE,MAAM,IAAM+B,EAGjB,IAAK,IAAIJ,EAAI,EAAGA,EAAI7B,KAAKG,QAAUH,KAAKE,MAAM2B,IAAM,SAAWA,IAC7D7B,KAAKE,MAAM2B,IAAM,SACbA,IAAM7B,KAAKG,OAAS,EACtBH,KAAKE,MAAM2B,EAAI,GAAK,EAEpB7B,KAAKE,MAAM2B,EAAI,KAInB,OADA7B,KAAKG,OAASwB,KAAKS,IAAIpC,KAAKG,OAAQ0B,EAAI,GACjC7B,IACT,EAGAL,EAAGF,UAAUqT,MAAQ,SAAe7Q,GAGlC,GAFAjD,EAAsB,kBAARiD,GACdjD,EAAOiD,EAAM,UACTA,EAAM,EAAG,OAAOjC,KAAKkH,OAAOjF,GAChC,GAAsB,IAAlBjC,KAAKC,SAIP,OAHAD,KAAKC,SAAW,EAChBD,KAAKkH,MAAMjF,GACXjC,KAAKC,SAAW,EACTD,KAGT,GADAA,KAAKE,MAAM,IAAM+B,EACG,IAAhBjC,KAAKG,QAAgBH,KAAKE,MAAM,GAAK,EACvCF,KAAKE,MAAM,IAAMF,KAAKE,MAAM,GAC5BF,KAAKC,SAAW,OAGhB,IAAK,IAAI4B,EAAI,EAAGA,EAAI7B,KAAKG,QAAUH,KAAKE,MAAM2B,GAAK,EAAGA,IACpD7B,KAAKE,MAAM2B,IAAM,SACjB7B,KAAKE,MAAM2B,EAAI,IAAM,EAGzB,OAAO7B,KAAKmD,QACd,EACAxD,EAAGF,UAAUsT,KAAO,SAAc9Q,GAChC,OAAOjC,KAAK8D,QAAQoD,MAAMjF,EAC5B,EACAtC,EAAGF,UAAUuT,KAAO,SAAc/Q,GAChC,OAAOjC,KAAK8D,QAAQgP,MAAM7Q,EAC5B,EACAtC,EAAGF,UAAUwT,KAAO,WAElB,OADAjT,KAAKC,SAAW,EACTD,IACT,EACAL,EAAGF,UAAUuH,IAAM,WACjB,OAAOhH,KAAK8D,QAAQmP,MACtB,EACAtT,EAAGF,UAAUyT,aAAe,SAAsBjR,EAAKT,EAAK6E,GAC1D,IACIxE,EAEAoB,EAHAvB,EAAMO,EAAI9B,OAASkG,EAEvBrG,KAAK+D,QAAQrC,GAEb,IAAIgD,EAAQ,EACZ,IAAK7C,EAAI,EAAGA,EAAII,EAAI9B,OAAQ0B,IAAK,CAC/BoB,GAA6B,EAAxBjD,KAAKE,MAAM2B,EAAIwE,IAAc3B,EAClC,IAAIpC,GAAwB,EAAfL,EAAI/B,MAAM2B,IAAUL,EAEjCkD,IADAzB,GAAa,SAARX,IACS,KAAOA,EAAQ,SAAY,GACzCtC,KAAKE,MAAM2B,EAAIwE,GAAa,SAAJpD,CAC1B,CACA,KAAOpB,EAAI7B,KAAKG,OAASkG,EAAOxE,IAE9B6C,GADAzB,GAA6B,EAAxBjD,KAAKE,MAAM2B,EAAIwE,IAAc3B,IACrB,GACb1E,KAAKE,MAAM2B,EAAIwE,GAAa,SAAJpD,EAE1B,GAAc,IAAVyB,EAAa,OAAO1E,KAAKmD,SAK7B,IAFAnE,GAAkB,IAAX0F,GACPA,EAAQ,EACH7C,EAAI,EAAGA,EAAI7B,KAAKG,OAAQ0B,IAE3B6C,GADAzB,IAAsB,EAAhBjD,KAAKE,MAAM2B,IAAU6C,IACd,GACb1E,KAAKE,MAAM2B,GAAS,SAAJoB,EAGlB,OADAjD,KAAKC,SAAW,EACTD,KAAKmD,QACd,EACAxD,EAAGF,UAAU0T,SAAW,SAAkBlR,EAAKmR,GAC7C,IAAI/M,GAAQrG,KAAKG,OAAS8B,EAAI9B,QAC1BoF,EAAIvF,KAAK8D,QACTrC,EAAIQ,EAGJoR,EAA8B,EAAxB5R,EAAEvB,MAAMuB,EAAEtB,OAAS,GAGf,KADdkG,EAAQ,GADMrG,KAAKwG,WAAW6M,MAG5B5R,EAAIA,EAAEgR,MAAMpM,GACZd,EAAEqM,OAAOvL,GACTgN,EAA8B,EAAxB5R,EAAEvB,MAAMuB,EAAEtB,OAAS,IAI3B,IACIwR,EADAvB,EAAI7K,EAAEpF,OAASsB,EAAEtB,OAErB,GAAa,QAATiT,EAAgB,EAClBzB,EAAI,IAAIhS,EAAG,OACTQ,OAASiQ,EAAI,EACfuB,EAAEzR,MAAQ,IAAIgC,MAAMyP,EAAExR,QACtB,IAAK,IAAI0B,EAAI,EAAGA,EAAI8P,EAAExR,OAAQ0B,IAC5B8P,EAAEzR,MAAM2B,GAAK,CAEjB,CACA,IAAIyR,EAAO/N,EAAEzB,QAAQoP,aAAazR,EAAG,EAAG2O,GAClB,IAAlBkD,EAAKrT,WACPsF,EAAI+N,EACA3B,IACFA,EAAEzR,MAAMkQ,GAAK,IAGjB,IAAK,IAAIpN,EAAIoN,EAAI,EAAGpN,GAAK,EAAGA,IAAK,CAC/B,IAAIuQ,EAAmC,UAAL,EAAxBhO,EAAErF,MAAMuB,EAAEtB,OAAS6C,KAAmD,EAA5BuC,EAAErF,MAAMuB,EAAEtB,OAAS6C,EAAI,IAM3E,IAFAuQ,EAAK5R,KAAKC,IAAI2R,EAAKF,EAAM,EAAG,UAC5B9N,EAAE2N,aAAazR,EAAG8R,EAAIvQ,GACA,IAAfuC,EAAEtF,UACPsT,IACAhO,EAAEtF,SAAW,EACbsF,EAAE2N,aAAazR,EAAG,EAAGuB,GAChBuC,EAAEV,WACLU,EAAEtF,UAAY,GAGd0R,IACFA,EAAEzR,MAAM8C,GAAKuQ,EAEjB,CAUA,OATI5B,GACFA,EAAExO,SAEJoC,EAAEpC,SAGW,QAATiQ,GAA4B,IAAV/M,GACpBd,EAAE0M,OAAO5L,GAEJ,CACLmN,IAAK7B,GAAK,KACVpO,IAAKgC,EAET,EAMA5F,EAAGF,UAAUgU,OAAS,SAAgBxR,EAAKmR,EAAMM,GAE/C,OADA1U,GAAQiD,EAAI4C,UACR7E,KAAK6E,SACA,CACL2O,IAAK,IAAI7T,EAAG,GACZ4D,IAAK,IAAI5D,EAAG,IAIM,IAAlBK,KAAKC,UAAmC,IAAjBgC,EAAIhC,UAC7B+F,EAAMhG,KAAKwH,MAAMiM,OAAOxR,EAAKmR,GAChB,QAATA,IACFI,EAAMxN,EAAIwN,IAAIhM,OAEH,QAAT4L,IACF7P,EAAMyC,EAAIzC,IAAIiE,MACVkM,GAA6B,IAAjBnQ,EAAItD,UAClBsD,EAAImF,KAAKzG,IAGN,CACLuR,IAAKA,EACLjQ,IAAKA,IAGa,IAAlBvD,KAAKC,UAAmC,IAAjBgC,EAAIhC,UAC7B+F,EAAMhG,KAAKyT,OAAOxR,EAAIuF,MAAO4L,GAChB,QAATA,IACFI,EAAMxN,EAAIwN,IAAIhM,OAET,CACLgM,IAAKA,EACLjQ,IAAKyC,EAAIzC,MAG0B,KAAlCvD,KAAKC,SAAWgC,EAAIhC,WACvB+F,EAAMhG,KAAKwH,MAAMiM,OAAOxR,EAAIuF,MAAO4L,GACtB,QAATA,IACF7P,EAAMyC,EAAIzC,IAAIiE,MACVkM,GAA6B,IAAjBnQ,EAAItD,UAClBsD,EAAIoF,KAAK1G,IAGN,CACLuR,IAAKxN,EAAIwN,IACTjQ,IAAKA,IAOLtB,EAAI9B,OAASH,KAAKG,QAAUH,KAAKuC,IAAIN,GAAO,EACvC,CACLuR,IAAK,IAAI7T,EAAG,GACZ4D,IAAKvD,MAKU,IAAfiC,EAAI9B,OACO,QAATiT,EACK,CACLI,IAAKxT,KAAK2T,KAAK1R,EAAI/B,MAAM,IACzBqD,IAAK,MAGI,QAAT6P,EACK,CACLI,IAAK,KACLjQ,IAAK,IAAI5D,EAAGK,KAAK8E,MAAM7C,EAAI/B,MAAM,MAG9B,CACLsT,IAAKxT,KAAK2T,KAAK1R,EAAI/B,MAAM,IACzBqD,IAAK,IAAI5D,EAAGK,KAAK8E,MAAM7C,EAAI/B,MAAM,MAG9BF,KAAKmT,SAASlR,EAAKmR,GAtE1B,IAAII,EAAKjQ,EAAKyC,CAuEhB,EAGArG,EAAGF,UAAU+T,IAAM,SAAavR,GAC9B,OAAOjC,KAAKyT,OAAOxR,EAAK,OAAO,GAAOuR,GACxC,EAGA7T,EAAGF,UAAU8D,IAAM,SAAatB,GAC9B,OAAOjC,KAAKyT,OAAOxR,EAAK,OAAO,GAAOsB,GACxC,EACA5D,EAAGF,UAAUmU,KAAO,SAAc3R,GAChC,OAAOjC,KAAKyT,OAAOxR,EAAK,OAAO,GAAMsB,GACvC,EAGA5D,EAAGF,UAAUoU,SAAW,SAAkB5R,GACxC,IAAI6R,EAAK9T,KAAKyT,OAAOxR,GAGrB,GAAI6R,EAAGvQ,IAAIsB,SAAU,OAAOiP,EAAGN,IAC/B,IAAIjQ,EAA0B,IAApBuQ,EAAGN,IAAIvT,SAAiB6T,EAAGvQ,IAAIoF,KAAK1G,GAAO6R,EAAGvQ,IACpDwQ,EAAO9R,EAAI0Q,MAAM,GACjBqB,EAAK/R,EAAIgS,MAAM,GACf1R,EAAMgB,EAAIhB,IAAIwR,GAGlB,OAAIxR,EAAM,GAAY,IAAPyR,GAAoB,IAARzR,EAAkBuR,EAAGN,IAGrB,IAApBM,EAAGN,IAAIvT,SAAiB6T,EAAGN,IAAIV,MAAM,GAAKgB,EAAGN,IAAItM,MAAM,EAChE,EACAvH,EAAGF,UAAUqF,MAAQ,SAAe7C,GAClC,IAAIqP,EAAWrP,EAAM,EACjBqP,IAAUrP,GAAOA,GACrBjD,EAAOiD,GAAO,UAGd,IAFA,IAAIyN,GAAK,GAAK,IAAMzN,EAChBiS,EAAM,EACDrS,EAAI7B,KAAKG,OAAS,EAAG0B,GAAK,EAAGA,IACpCqS,GAAOxE,EAAIwE,GAAuB,EAAhBlU,KAAKE,MAAM2B,KAAWI,EAE1C,OAAOqP,GAAY4C,EAAMA,CAC3B,EAGAvU,EAAGF,UAAU0U,KAAO,SAAclS,GAChC,OAAOjC,KAAK8E,MAAM7C,EACpB,EAGAtC,EAAGF,UAAUsF,MAAQ,SAAe9C,GAClC,IAAIqP,EAAWrP,EAAM,EACjBqP,IAAUrP,GAAOA,GACrBjD,EAAOiD,GAAO,UAEd,IADA,IAAIyC,EAAQ,EACH7C,EAAI7B,KAAKG,OAAS,EAAG0B,GAAK,EAAGA,IAAK,CACzC,IAAIoB,GAAqB,EAAhBjD,KAAKE,MAAM2B,IAAkB,SAAR6C,EAC9B1E,KAAKE,MAAM2B,GAAKoB,EAAIhB,EAAM,EAC1ByC,EAAQzB,EAAIhB,CACd,CAEA,OADAjC,KAAKmD,SACEmO,EAAWtR,KAAKsH,OAAStH,IAClC,EACAL,EAAGF,UAAUkU,KAAO,SAAc1R,GAChC,OAAOjC,KAAK8D,QAAQiB,MAAM9C,EAC5B,EACAtC,EAAGF,UAAU2U,KAAO,SAAc1E,GAChC1Q,EAAsB,IAAf0Q,EAAEzP,UACTjB,GAAQ0Q,EAAE7K,UACV,IAAIwJ,EAAIrO,KACJsO,EAAIoB,EAAE5L,QAERuK,EADiB,IAAfA,EAAEpO,SACAoO,EAAEuF,KAAKlE,GAEPrB,EAAEvK,QAWR,IAPA,IAAIuQ,EAAI,IAAI1U,EAAG,GACX2U,EAAI,IAAI3U,EAAG,GAGX4U,EAAI,IAAI5U,EAAG,GACX6U,EAAI,IAAI7U,EAAG,GACX8U,EAAI,EACDpG,EAAEqG,UAAYpG,EAAEoG,UACrBrG,EAAE4D,OAAO,GACT3D,EAAE2D,OAAO,KACPwC,EAIJ,IAFA,IAAIE,EAAKrG,EAAExK,QACP8Q,EAAKvG,EAAEvK,SACHuK,EAAExJ,UAAU,CAClB,IAAK,IAAIhD,EAAI,EAAGgT,EAAK,EAAyB,KAArBxG,EAAEnO,MAAM,GAAK2U,IAAahT,EAAI,KAAMA,EAAGgT,IAAO,GACvE,GAAIhT,EAAI,EAEN,IADAwM,EAAE4D,OAAOpQ,GACFA,KAAM,IACPwS,EAAES,SAAWR,EAAEQ,WACjBT,EAAE3L,KAAKiM,GACPL,EAAE3L,KAAKiM,IAETP,EAAEpC,OAAO,GACTqC,EAAErC,OAAO,GAGb,IAAK,IAAIjP,EAAI,EAAG+R,EAAK,EAAyB,KAArBzG,EAAEpO,MAAM,GAAK6U,IAAa/R,EAAI,KAAMA,EAAG+R,IAAO,GACvE,GAAI/R,EAAI,EAEN,IADAsL,EAAE2D,OAAOjP,GACFA,KAAM,IACPuR,EAAEO,SAAWN,EAAEM,WACjBP,EAAE7L,KAAKiM,GACPH,EAAE7L,KAAKiM,IAETL,EAAEtC,OAAO,GACTuC,EAAEvC,OAAO,GAGT5D,EAAE9L,IAAI+L,IAAM,GACdD,EAAE1F,KAAK2F,GACP+F,EAAE1L,KAAK4L,GACPD,EAAE3L,KAAK6L,KAEPlG,EAAE3F,KAAK0F,GACPkG,EAAE5L,KAAK0L,GACPG,EAAE7L,KAAK2L,GAEX,CACA,MAAO,CACL/O,EAAGgP,EACH9S,EAAG+S,EACHQ,IAAK1G,EAAEsD,OAAO6C,GAElB,EAKA9U,EAAGF,UAAUwV,OAAS,SAAgBvF,GACpC1Q,EAAsB,IAAf0Q,EAAEzP,UACTjB,GAAQ0Q,EAAE7K,UACV,IAAIU,EAAIvF,KACJyB,EAAIiO,EAAE5L,QAERyB,EADiB,IAAfA,EAAEtF,SACAsF,EAAEqO,KAAKlE,GAEPnK,EAAEzB,QAKR,IAHA,IAgCIkC,EAhCAkP,EAAK,IAAIvV,EAAG,GACZwV,EAAK,IAAIxV,EAAG,GACZyV,EAAQ3T,EAAEqC,QACPyB,EAAE8P,KAAK,GAAK,GAAK5T,EAAE4T,KAAK,GAAK,GAAG,CACrC,IAAK,IAAIxT,EAAI,EAAGgT,EAAK,EAAyB,KAArBtP,EAAErF,MAAM,GAAK2U,IAAahT,EAAI,KAAMA,EAAGgT,IAAO,GACvE,GAAIhT,EAAI,EAEN,IADA0D,EAAE0M,OAAOpQ,GACFA,KAAM,GACPqT,EAAGJ,SACLI,EAAGxM,KAAK0M,GAEVF,EAAGjD,OAAO,GAGd,IAAK,IAAIjP,EAAI,EAAG+R,EAAK,EAAyB,KAArBtT,EAAEvB,MAAM,GAAK6U,IAAa/R,EAAI,KAAMA,EAAG+R,IAAO,GACvE,GAAI/R,EAAI,EAEN,IADAvB,EAAEwQ,OAAOjP,GACFA,KAAM,GACPmS,EAAGL,SACLK,EAAGzM,KAAK0M,GAEVD,EAAGlD,OAAO,GAGV1M,EAAEhD,IAAId,IAAM,GACd8D,EAAEoD,KAAKlH,GACPyT,EAAGvM,KAAKwM,KAER1T,EAAEkH,KAAKpD,GACP4P,EAAGxM,KAAKuM,GAEZ,CAUA,OAPElP,EADgB,IAAdT,EAAE8P,KAAK,GACHH,EAEAC,GAEAE,KAAK,GAAK,GAChBrP,EAAI0C,KAAKgH,GAEJ1J,CACT,EACArG,EAAGF,UAAUuV,IAAM,SAAa/S,GAC9B,GAAIjC,KAAK6E,SAAU,OAAO5C,EAAI+E,MAC9B,GAAI/E,EAAI4C,SAAU,OAAO7E,KAAKgH,MAC9B,IAAIzB,EAAIvF,KAAK8D,QACTrC,EAAIQ,EAAI6B,QACZyB,EAAEtF,SAAW,EACbwB,EAAExB,SAAW,EAGb,IAAK,IAAIoG,EAAQ,EAAGd,EAAEmP,UAAYjT,EAAEiT,SAAUrO,IAC5Cd,EAAE0M,OAAO,GACTxQ,EAAEwQ,OAAO,GAEX,OAAG,CACD,KAAO1M,EAAEmP,UACPnP,EAAE0M,OAAO,GAEX,KAAOxQ,EAAEiT,UACPjT,EAAEwQ,OAAO,GAEX,IAAI9Q,EAAIoE,EAAEhD,IAAId,GACd,GAAIN,EAAI,EAAG,CAET,IAAIsF,EAAIlB,EACRA,EAAI9D,EACJA,EAAIgF,CACN,MAAO,GAAU,IAANtF,GAAyB,IAAdM,EAAE4T,KAAK,GAC3B,MAEF9P,EAAEoD,KAAKlH,EACT,CACA,OAAOA,EAAEmQ,OAAOvL,EAClB,EAGA1G,EAAGF,UAAU6V,KAAO,SAAcrT,GAChC,OAAOjC,KAAKoU,KAAKnS,GAAKsD,EAAEqO,KAAK3R,EAC/B,EACAtC,EAAGF,UAAUiV,OAAS,WACpB,OAA+B,KAAP,EAAhB1U,KAAKE,MAAM,GACrB,EACAP,EAAGF,UAAUqV,MAAQ,WACnB,OAA+B,KAAP,EAAhB9U,KAAKE,MAAM,GACrB,EAGAP,EAAGF,UAAUwU,MAAQ,SAAehS,GAClC,OAAOjC,KAAKE,MAAM,GAAK+B,CACzB,EAGAtC,EAAGF,UAAU8V,MAAQ,SAAe/M,GAClCxJ,EAAsB,kBAARwJ,GACd,IAAIrH,EAAIqH,EAAM,GACV4G,GAAK5G,EAAMrH,GAAK,GAChBwQ,EAAI,GAAKxQ,EAGb,GAAInB,KAAKG,QAAUiP,EAGjB,OAFApP,KAAK+D,QAAQqL,EAAI,GACjBpP,KAAKE,MAAMkP,IAAMuC,EACV3R,KAKT,IADA,IAAI0E,EAAQiN,EACH9P,EAAIuN,EAAa,IAAV1K,GAAe7C,EAAI7B,KAAKG,OAAQ0B,IAAK,CACnD,IAAIoB,EAAoB,EAAhBjD,KAAKE,MAAM2B,GAEnB6C,GADAzB,GAAKyB,KACS,GACdzB,GAAK,SACLjD,KAAKE,MAAM2B,GAAKoB,CAClB,CAKA,OAJc,IAAVyB,IACF1E,KAAKE,MAAM2B,GAAK6C,EAChB1E,KAAKG,UAEAH,IACT,EACAL,EAAGF,UAAUoF,OAAS,WACpB,OAAuB,IAAhB7E,KAAKG,QAAkC,IAAlBH,KAAKE,MAAM,EACzC,EACAP,EAAGF,UAAU4V,KAAO,SAAcpT,GAChC,IAII+D,EAJA/F,EAAWgC,EAAM,EACrB,GAAsB,IAAlBjC,KAAKC,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBD,KAAKC,UAAkBA,EAAU,OAAO,EAG5C,GAFAD,KAAKmD,SAEDnD,KAAKG,OAAS,EAChB6F,EAAM,MACD,CACD/F,IACFgC,GAAOA,GAETjD,EAAOiD,GAAO,SAAW,qBACzB,IAAIgB,EAAoB,EAAhBjD,KAAKE,MAAM,GACnB8F,EAAM/C,IAAMhB,EAAM,EAAIgB,EAAIhB,GAAO,EAAI,CACvC,CACA,OAAsB,IAAlBjC,KAAKC,SAA8B,GAAN+F,EAC1BA,CACT,EAMArG,EAAGF,UAAU8C,IAAM,SAAaN,GAC9B,GAAsB,IAAlBjC,KAAKC,UAAmC,IAAjBgC,EAAIhC,SAAgB,OAAQ,EACvD,GAAsB,IAAlBD,KAAKC,UAAmC,IAAjBgC,EAAIhC,SAAgB,OAAO,EACtD,IAAI+F,EAAMhG,KAAKwV,KAAKvT,GACpB,OAAsB,IAAlBjC,KAAKC,SAA8B,GAAN+F,EAC1BA,CACT,EAGArG,EAAGF,UAAU+V,KAAO,SAAcvT,GAEhC,GAAIjC,KAAKG,OAAS8B,EAAI9B,OAAQ,OAAO,EACrC,GAAIH,KAAKG,OAAS8B,EAAI9B,OAAQ,OAAQ,EAEtC,IADA,IAAI6F,EAAM,EACDnE,EAAI7B,KAAKG,OAAS,EAAG0B,GAAK,EAAGA,IAAK,CACzC,IAAI0D,EAAoB,EAAhBvF,KAAKE,MAAM2B,GACfJ,EAAmB,EAAfQ,EAAI/B,MAAM2B,GAClB,GAAI0D,IAAM9D,EAAV,CACI8D,EAAI9D,EACNuE,GAAO,EACET,EAAI9D,IACbuE,EAAM,GAER,KANqB,CAOvB,CACA,OAAOA,CACT,EACArG,EAAGF,UAAUgW,IAAM,SAAaxT,GAC9B,OAA0B,IAAnBjC,KAAKqV,KAAKpT,EACnB,EACAtC,EAAGF,UAAUiW,GAAK,SAAYzT,GAC5B,OAAyB,IAAlBjC,KAAKuC,IAAIN,EAClB,EACAtC,EAAGF,UAAUkW,KAAO,SAAc1T,GAChC,OAAOjC,KAAKqV,KAAKpT,IAAQ,CAC3B,EACAtC,EAAGF,UAAUmW,IAAM,SAAa3T,GAC9B,OAAOjC,KAAKuC,IAAIN,IAAQ,CAC1B,EACAtC,EAAGF,UAAUoW,IAAM,SAAa5T,GAC9B,OAA2B,IAApBjC,KAAKqV,KAAKpT,EACnB,EACAtC,EAAGF,UAAUqW,GAAK,SAAY7T,GAC5B,OAA0B,IAAnBjC,KAAKuC,IAAIN,EAClB,EACAtC,EAAGF,UAAUsW,KAAO,SAAc9T,GAChC,OAAOjC,KAAKqV,KAAKpT,IAAQ,CAC3B,EACAtC,EAAGF,UAAUuW,IAAM,SAAa/T,GAC9B,OAAOjC,KAAKuC,IAAIN,IAAQ,CAC1B,EACAtC,EAAGF,UAAUwW,IAAM,SAAahU,GAC9B,OAA0B,IAAnBjC,KAAKqV,KAAKpT,EACnB,EACAtC,EAAGF,UAAUyW,GAAK,SAAYjU,GAC5B,OAAyB,IAAlBjC,KAAKuC,IAAIN,EAClB,EAMAtC,EAAGS,IAAM,SAAa6B,GACpB,OAAO,IAAIkU,EAAIlU,EACjB,EACAtC,EAAGF,UAAU2W,MAAQ,SAAeC,GAGlC,OAFArX,GAAQgB,KAAKI,IAAK,yCAClBpB,EAAyB,IAAlBgB,KAAKC,SAAgB,iCACrBoW,EAAIC,UAAUtW,MAAMuW,UAAUF,EACvC,EACA1W,EAAGF,UAAU+W,QAAU,WAErB,OADAxX,EAAOgB,KAAKI,IAAK,wDACVJ,KAAKI,IAAIqW,YAAYzW,KAC9B,EACAL,EAAGF,UAAU8W,UAAY,SAAmBF,GAE1C,OADArW,KAAKI,IAAMiW,EACJrW,IACT,EACAL,EAAGF,UAAUiX,SAAW,SAAkBL,GAExC,OADArX,GAAQgB,KAAKI,IAAK,yCACXJ,KAAKuW,UAAUF,EACxB,EACA1W,EAAGF,UAAUkX,OAAS,SAAgB1U,GAEpC,OADAjD,EAAOgB,KAAKI,IAAK,sCACVJ,KAAKI,IAAIwI,IAAI5I,KAAMiC,EAC5B,EACAtC,EAAGF,UAAUmX,QAAU,SAAiB3U,GAEtC,OADAjD,EAAOgB,KAAKI,IAAK,uCACVJ,KAAKI,IAAIsI,KAAK1I,KAAMiC,EAC7B,EACAtC,EAAGF,UAAUoX,OAAS,SAAgB5U,GAEpC,OADAjD,EAAOgB,KAAKI,IAAK,sCACVJ,KAAKI,IAAIyI,IAAI7I,KAAMiC,EAC5B,EACAtC,EAAGF,UAAUqX,QAAU,SAAiB7U,GAEtC,OADAjD,EAAOgB,KAAKI,IAAK,uCACVJ,KAAKI,IAAIuI,KAAK3I,KAAMiC,EAC7B,EACAtC,EAAGF,UAAUsX,OAAS,SAAgB9U,GAEpC,OADAjD,EAAOgB,KAAKI,IAAK,sCACVJ,KAAKI,IAAI4W,IAAIhX,KAAMiC,EAC5B,EACAtC,EAAGF,UAAUwX,OAAS,SAAgBhV,GAGpC,OAFAjD,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAI8W,SAASlX,KAAMiC,GACjBjC,KAAKI,IAAIoB,IAAIxB,KAAMiC,EAC5B,EACAtC,EAAGF,UAAU0X,QAAU,SAAiBlV,GAGtC,OAFAjD,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAI8W,SAASlX,KAAMiC,GACjBjC,KAAKI,IAAI0M,KAAK9M,KAAMiC,EAC7B,EACAtC,EAAGF,UAAU2X,OAAS,WAGpB,OAFApY,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAIiX,SAASrX,MACXA,KAAKI,IAAIoR,IAAIxR,KACtB,EACAL,EAAGF,UAAU6X,QAAU,WAGrB,OAFAtY,EAAOgB,KAAKI,IAAK,uCACjBJ,KAAKI,IAAIiX,SAASrX,MACXA,KAAKI,IAAIqR,KAAKzR,KACvB,EAGAL,EAAGF,UAAU8X,QAAU,WAGrB,OAFAvY,EAAOgB,KAAKI,IAAK,uCACjBJ,KAAKI,IAAIiX,SAASrX,MACXA,KAAKI,IAAIoX,KAAKxX,KACvB,EACAL,EAAGF,UAAUgY,QAAU,WAGrB,OAFAzY,EAAOgB,KAAKI,IAAK,uCACjBJ,KAAKI,IAAIiX,SAASrX,MACXA,KAAKI,IAAIkV,KAAKtV,KACvB,EAGAL,EAAGF,UAAUiY,OAAS,WAGpB,OAFA1Y,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAIiX,SAASrX,MACXA,KAAKI,IAAIoH,IAAIxH,KACtB,EACAL,EAAGF,UAAUkY,OAAS,SAAgB1V,GAGpC,OAFAjD,EAAOgB,KAAKI,MAAQ6B,EAAI7B,IAAK,qBAC7BJ,KAAKI,IAAIiX,SAASrX,MACXA,KAAKI,IAAIuD,IAAI3D,KAAMiC,EAC5B,EAGA,IAAI2V,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAOC,EAAMxI,GAEpB1P,KAAKkY,KAAOA,EACZlY,KAAK0P,EAAI,IAAI/P,EAAG+P,EAAG,IACnB1P,KAAKmQ,EAAInQ,KAAK0P,EAAE/I,YAChB3G,KAAKyF,EAAI,IAAI9F,EAAG,GAAGiS,OAAO5R,KAAKmQ,GAAGxH,KAAK3I,KAAK0P,GAC5C1P,KAAKmY,IAAMnY,KAAKoY,MAClB,CAwCA,SAASC,IACPJ,EAAOK,KAAKtY,KAAM,OAAQ,0EAC5B,CAwDA,SAASuY,IACPN,EAAOK,KAAKtY,KAAM,OAAQ,iEAC5B,CAEA,SAASwY,IACPP,EAAOK,KAAKtY,KAAM,OAAQ,wDAC5B,CAEA,SAASyY,IAEPR,EAAOK,KAAKtY,KAAM,QAAS,sEAC7B,CAyCA,SAASmW,EAAI/F,GACX,GAAiB,kBAANA,EAAgB,CACzB,IAAIsI,EAAQ/Y,EAAGgZ,OAAOvI,GACtBpQ,KAAKoQ,EAAIsI,EAAMhJ,EACf1P,KAAK0Y,MAAQA,CACf,MACE1Z,EAAOoR,EAAEqF,IAAI,GAAI,kCACjBzV,KAAKoQ,EAAIA,EACTpQ,KAAK0Y,MAAQ,IAEjB,CA0LA,SAASE,EAAKxI,GACZ+F,EAAImC,KAAKtY,KAAMoQ,GACfpQ,KAAKqG,MAAQrG,KAAKoQ,EAAEzJ,YAChB3G,KAAKqG,MAAQ,KAAO,IACtBrG,KAAKqG,OAAS,GAAKrG,KAAKqG,MAAQ,IAElCrG,KAAKmB,EAAI,IAAIxB,EAAG,GAAGiS,OAAO5R,KAAKqG,OAC/BrG,KAAKgU,GAAKhU,KAAK6Y,KAAK7Y,KAAKmB,EAAEqQ,OAC3BxR,KAAK8Y,KAAO9Y,KAAKmB,EAAE8T,OAAOjV,KAAKoQ,GAC/BpQ,KAAK+Y,KAAO/Y,KAAK8Y,KAAKtX,IAAIxB,KAAKmB,GAAG2R,MAAM,GAAGU,IAAIxT,KAAKoQ,GACpDpQ,KAAK+Y,KAAO/Y,KAAK+Y,KAAKnF,KAAK5T,KAAKmB,GAChCnB,KAAK+Y,KAAO/Y,KAAKmB,EAAE0H,IAAI7I,KAAK+Y,KAC9B,CArWAd,EAAOxY,UAAU2Y,KAAO,WACtB,IAAID,EAAM,IAAIxY,EAAG,MAEjB,OADAwY,EAAIjY,MAAQ,IAAIgC,MAAMP,KAAKoB,KAAK/C,KAAKmQ,EAAI,KAClCgI,CACT,EACAF,EAAOxY,UAAUuZ,QAAU,SAAiB/W,GAG1C,IACIgX,EADA9X,EAAIc,EAER,GACEjC,KAAKkZ,MAAM/X,EAAGnB,KAAKmY,KAGnBc,GADA9X,GADAA,EAAInB,KAAKmZ,MAAMhY,IACTuH,KAAK1I,KAAKmY,MACPxR,kBACFsS,EAAOjZ,KAAKmQ,GACrB,IAAI5N,EAAM0W,EAAOjZ,KAAKmQ,GAAK,EAAIhP,EAAEqU,KAAKxV,KAAK0P,GAe3C,OAdY,IAARnN,GACFpB,EAAEjB,MAAM,GAAK,EACbiB,EAAEhB,OAAS,GACFoC,EAAM,EACfpB,EAAEwH,KAAK3I,KAAK0P,QAEI0J,IAAZjY,EAAEkY,MAEJlY,EAAEkY,QAGFlY,EAAEgC,SAGChC,CACT,EACA8W,EAAOxY,UAAUyZ,MAAQ,SAAeI,EAAO7U,GAC7C6U,EAAMrH,OAAOjS,KAAKmQ,EAAG,EAAG1L,EAC1B,EACAwT,EAAOxY,UAAU0Z,MAAQ,SAAelX,GACtC,OAAOA,EAAI6K,KAAK9M,KAAKyF,EACvB,EAIArG,EAASiZ,EAAMJ,GACfI,EAAK5Y,UAAUyZ,MAAQ,SAAeI,EAAOC,GAI3C,IAFA,IAAIlH,EAAO,QACPmH,EAAS7X,KAAKC,IAAI0X,EAAMnZ,OAAQ,GAC3B0B,EAAI,EAAGA,EAAI2X,EAAQ3X,IAC1B0X,EAAOrZ,MAAM2B,GAAKyX,EAAMpZ,MAAM2B,GAGhC,GADA0X,EAAOpZ,OAASqZ,EACZF,EAAMnZ,QAAU,EAGlB,OAFAmZ,EAAMpZ,MAAM,GAAK,OACjBoZ,EAAMnZ,OAAS,GAKjB,IAAIsZ,EAAOH,EAAMpZ,MAAM,GAEvB,IADAqZ,EAAOrZ,MAAMqZ,EAAOpZ,UAAYsZ,EAAOpH,EAClCxQ,EAAI,GAAIA,EAAIyX,EAAMnZ,OAAQ0B,IAAK,CAClC,IAAI6X,EAAwB,EAAjBJ,EAAMpZ,MAAM2B,GACvByX,EAAMpZ,MAAM2B,EAAI,KAAO6X,EAAOrH,IAAS,EAAIoH,IAAS,GACpDA,EAAOC,CACT,CACAD,KAAU,GACVH,EAAMpZ,MAAM2B,EAAI,IAAM4X,EACT,IAATA,GAAcH,EAAMnZ,OAAS,GAC/BmZ,EAAMnZ,QAAU,GAEhBmZ,EAAMnZ,QAAU,CAEpB,EACAkY,EAAK5Y,UAAU0Z,MAAQ,SAAelX,GAEpCA,EAAI/B,MAAM+B,EAAI9B,QAAU,EACxB8B,EAAI/B,MAAM+B,EAAI9B,OAAS,GAAK,EAC5B8B,EAAI9B,QAAU,EAId,IADA,IAAIqF,EAAK,EACA3D,EAAI,EAAGA,EAAII,EAAI9B,OAAQ0B,IAAK,CACnC,IAAIoB,EAAmB,EAAfhB,EAAI/B,MAAM2B,GAClB2D,GAAU,IAAJvC,EACNhB,EAAI/B,MAAM2B,GAAU,SAAL2D,EACfA,EAAS,GAAJvC,GAAYuC,EAAK,SAAY,EACpC,CASA,OANkC,IAA9BvD,EAAI/B,MAAM+B,EAAI9B,OAAS,KACzB8B,EAAI9B,SAC8B,IAA9B8B,EAAI/B,MAAM+B,EAAI9B,OAAS,IACzB8B,EAAI9B,UAGD8B,CACT,EAIA7C,EAASmZ,EAAMN,GAIf7Y,EAASoZ,EAAMP,GAKf7Y,EAASqZ,EAAQR,GACjBQ,EAAOhZ,UAAU0Z,MAAQ,SAAelX,GAGtC,IADA,IAAIyC,EAAQ,EACH7C,EAAI,EAAGA,EAAII,EAAI9B,OAAQ0B,IAAK,CACnC,IAAI+E,EAA0B,IAAL,EAAf3E,EAAI/B,MAAM2B,IAAiB6C,EACjCc,EAAU,SAALoB,EACTA,KAAQ,GACR3E,EAAI/B,MAAM2B,GAAK2D,EACfd,EAAQkC,CACV,CAIA,OAHc,IAAVlC,IACFzC,EAAI/B,MAAM+B,EAAI9B,UAAYuE,GAErBzC,CACT,EAGAtC,EAAGgZ,OAAS,SAAeT,GAEzB,GAAIN,EAAOM,GAAO,OAAON,EAAOM,GAChC,IAAIQ,EACJ,GAAa,SAATR,EACFQ,EAAQ,IAAIL,OACP,GAAa,SAATH,EACTQ,EAAQ,IAAIH,OACP,GAAa,SAATL,EACTQ,EAAQ,IAAIF,MACP,IAAa,WAATN,EAGT,MAAM,IAAI/Y,MAAM,iBAAmB+Y,GAFnCQ,EAAQ,IAAID,CAGd,CAEA,OADAb,EAAOM,GAAQQ,EACRA,CACT,EAgBAvC,EAAI1W,UAAU4X,SAAW,SAAkB9R,GACzCvG,EAAsB,IAAfuG,EAAEtF,SAAgB,iCACzBjB,EAAOuG,EAAEnF,IAAK,kCAChB,EACA+V,EAAI1W,UAAUyX,SAAW,SAAkB3R,EAAG9D,GAC5CzC,EAAqC,KAA7BuG,EAAEtF,SAAWwB,EAAExB,UAAiB,iCACxCjB,EAAOuG,EAAEnF,KAAOmF,EAAEnF,MAAQqB,EAAErB,IAAK,kCACnC,EACA+V,EAAI1W,UAAUoZ,KAAO,SAActT,GACjC,OAAIvF,KAAK0Y,MAAc1Y,KAAK0Y,MAAMM,QAAQzT,GAAGgR,UAAUvW,OACvD8B,EAAKyD,EAAGA,EAAEqO,KAAK5T,KAAKoQ,GAAGmG,UAAUvW,OAC1BuF,EACT,EACA4Q,EAAI1W,UAAU+H,IAAM,SAAajC,GAC/B,OAAIA,EAAEV,SACGU,EAAEzB,QAEJ9D,KAAKoQ,EAAEvH,IAAItD,GAAGgR,UAAUvW,KACjC,EACAmW,EAAI1W,UAAUmJ,IAAM,SAAarD,EAAG9D,GAClCzB,KAAKkX,SAAS3R,EAAG9D,GACjB,IAAIuE,EAAMT,EAAEqD,IAAInH,GAIhB,OAHIuE,EAAIzD,IAAIvC,KAAKoQ,IAAM,GACrBpK,EAAI2C,KAAK3I,KAAKoQ,GAETpK,EAAIuQ,UAAUvW,KACvB,EACAmW,EAAI1W,UAAUiJ,KAAO,SAAcnD,EAAG9D,GACpCzB,KAAKkX,SAAS3R,EAAG9D,GACjB,IAAIuE,EAAMT,EAAEmD,KAAKjH,GAIjB,OAHIuE,EAAIzD,IAAIvC,KAAKoQ,IAAM,GACrBpK,EAAI2C,KAAK3I,KAAKoQ,GAETpK,CACT,EACAmQ,EAAI1W,UAAUoJ,IAAM,SAAatD,EAAG9D,GAClCzB,KAAKkX,SAAS3R,EAAG9D,GACjB,IAAIuE,EAAMT,EAAEsD,IAAIpH,GAIhB,OAHIuE,EAAIqP,KAAK,GAAK,GAChBrP,EAAI0C,KAAK1I,KAAKoQ,GAETpK,EAAIuQ,UAAUvW,KACvB,EACAmW,EAAI1W,UAAUkJ,KAAO,SAAcpD,EAAG9D,GACpCzB,KAAKkX,SAAS3R,EAAG9D,GACjB,IAAIuE,EAAMT,EAAEoD,KAAKlH,GAIjB,OAHIuE,EAAIqP,KAAK,GAAK,GAChBrP,EAAI0C,KAAK1I,KAAKoQ,GAETpK,CACT,EACAmQ,EAAI1W,UAAUuX,IAAM,SAAazR,EAAGtD,GAElC,OADAjC,KAAKqX,SAAS9R,GACPvF,KAAK6Y,KAAKtT,EAAEkN,MAAMxQ,GAC3B,EACAkU,EAAI1W,UAAUqN,KAAO,SAAcvH,EAAG9D,GAEpC,OADAzB,KAAKkX,SAAS3R,EAAG9D,GACVzB,KAAK6Y,KAAKtT,EAAEuH,KAAKrL,GAC1B,EACA0U,EAAI1W,UAAU+B,IAAM,SAAa+D,EAAG9D,GAElC,OADAzB,KAAKkX,SAAS3R,EAAG9D,GACVzB,KAAK6Y,KAAKtT,EAAE/D,IAAIC,GACzB,EACA0U,EAAI1W,UAAUgS,KAAO,SAAclM,GACjC,OAAOvF,KAAK8M,KAAKvH,EAAGA,EAAEzB,QACxB,EACAqS,EAAI1W,UAAU+R,IAAM,SAAajM,GAC/B,OAAOvF,KAAKwB,IAAI+D,EAAGA,EACrB,EACA4Q,EAAI1W,UAAU+X,KAAO,SAAcjS,GACjC,GAAIA,EAAEV,SAAU,OAAOU,EAAEzB,QACzB,IAAI6V,EAAO3Z,KAAKoQ,EAAE6D,MAAM,GAIxB,GAHAjV,EAAO2a,EAAO,IAAM,GAGP,IAATA,EAAY,CACd,IAAIhW,EAAM3D,KAAKoQ,EAAExH,IAAI,IAAIjJ,EAAG,IAAIsS,OAAO,GACvC,OAAOjS,KAAK2D,IAAI4B,EAAG5B,EACrB,CAOA,IAFA,IAAIgO,EAAI3R,KAAKoQ,EAAE4C,KAAK,GAChB5D,EAAI,GACAuC,EAAE9M,UAA2B,IAAf8M,EAAEsC,MAAM,IAC5B7E,IACAuC,EAAEM,OAAO,GAEXjT,GAAQ2S,EAAE9M,UACV,IAAI+U,EAAM,IAAIja,EAAG,GAAGyW,MAAMpW,MACtB6Z,EAAOD,EAAIlC,SAIXoC,EAAO9Z,KAAKoQ,EAAE4C,KAAK,GAAGf,OAAO,GAC7B8H,EAAI/Z,KAAKoQ,EAAEzJ,YAEf,IADAoT,EAAI,IAAIpa,EAAG,EAAIoa,EAAIA,GAAG3D,MAAMpW,MACW,IAAhCA,KAAK2D,IAAIoW,EAAGD,GAAMvX,IAAIsX,IAC3BE,EAAEnD,QAAQiD,GAMZ,IAJA,IAAI9Y,EAAIf,KAAK2D,IAAIoW,EAAGpI,GAChBxQ,EAAInB,KAAK2D,IAAI4B,EAAGoM,EAAEoB,KAAK,GAAGd,OAAO,IACjCxL,EAAIzG,KAAK2D,IAAI4B,EAAGoM,GAChBvB,EAAIhB,EACc,IAAf3I,EAAElE,IAAIqX,IAAY,CAEvB,IADA,IAAIzB,EAAM1R,EACD5E,EAAI,EAAoB,IAAjBsW,EAAI5V,IAAIqX,GAAY/X,IAClCsW,EAAMA,EAAIf,SAEZpY,EAAO6C,EAAIuO,GACX,IAAI3O,EAAIzB,KAAK2D,IAAI5C,EAAG,IAAIpB,EAAG,GAAGiS,OAAOxB,EAAIvO,EAAI,IAC7CV,EAAIA,EAAE8V,OAAOxV,GACbV,EAAIU,EAAE2V,SACN3Q,EAAIA,EAAEwQ,OAAOlW,GACbqP,EAAIvO,CACN,CACA,OAAOV,CACT,EACAgV,EAAI1W,UAAU6V,KAAO,SAAc/P,GACjC,IAAIyU,EAAMzU,EAAE0P,OAAOjV,KAAKoQ,GACxB,OAAqB,IAAjB4J,EAAI/Z,UACN+Z,EAAI/Z,SAAW,EACRD,KAAK6Y,KAAKmB,GAAKtC,UAEf1X,KAAK6Y,KAAKmB,EAErB,EACA7D,EAAI1W,UAAUkE,IAAM,SAAa4B,EAAGtD,GAClC,GAAIA,EAAI4C,SAAU,OAAO,IAAIlF,EAAG,GAAGyW,MAAMpW,MACzC,GAAoB,IAAhBiC,EAAIoT,KAAK,GAAU,OAAO9P,EAAEzB,QAChC,IACImW,EAAM,IAAI/X,MAAM,IACpB+X,EAAI,GAAK,IAAIta,EAAG,GAAGyW,MAAMpW,MACzBia,EAAI,GAAK1U,EACT,IAAK,IAAI1D,EAAI,EAAGA,EAAIoY,EAAI9Z,OAAQ0B,IAC9BoY,EAAIpY,GAAK7B,KAAKwB,IAAIyY,EAAIpY,EAAI,GAAI0D,GAEhC,IAAIS,EAAMiU,EAAI,GACVC,EAAU,EACVC,EAAa,EACb7Y,EAAQW,EAAI0E,YAAc,GAI9B,IAHc,IAAVrF,IACFA,EAAQ,IAELO,EAAII,EAAI9B,OAAS,EAAG0B,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAI2B,EAAOvB,EAAI/B,MAAM2B,GACZmB,EAAI1B,EAAQ,EAAG0B,GAAK,EAAGA,IAAK,CACnC,IAAIwF,EAAMhF,GAAQR,EAAI,EAClBgD,IAAQiU,EAAI,KACdjU,EAAMhG,KAAKwR,IAAIxL,IAEL,IAARwC,GAAyB,IAAZ0R,GAIjBA,IAAY,EACZA,GAAW1R,GA1BE,MA2Bb2R,GACwC,IAANtY,GAAiB,IAANmB,KAC7CgD,EAAMhG,KAAKwB,IAAIwE,EAAKiU,EAAIC,IACxBC,EAAa,EACbD,EAAU,IATRC,EAAa,CAUjB,CACA7Y,EAAQ,EACV,CACA,OAAO0E,CACT,EACAmQ,EAAI1W,UAAU6W,UAAY,SAAmBrU,GAC3C,IAAId,EAAIc,EAAI2R,KAAK5T,KAAKoQ,GACtB,OAAOjP,IAAMc,EAAMd,EAAE2C,QAAU3C,CACjC,EACAgV,EAAI1W,UAAUgX,YAAc,SAAqBxU,GAC/C,IAAI+D,EAAM/D,EAAI6B,QAEd,OADAkC,EAAI5F,IAAM,KACH4F,CACT,EAMArG,EAAGya,KAAO,SAAcnY,GACtB,OAAO,IAAI2W,EAAK3W,EAClB,EAcA7C,EAASwZ,EAAMzC,GACfyC,EAAKnZ,UAAU6W,UAAY,SAAmBrU,GAC5C,OAAOjC,KAAK6Y,KAAK5W,EAAIwQ,MAAMzS,KAAKqG,OAClC,EACAuS,EAAKnZ,UAAUgX,YAAc,SAAqBxU,GAChD,IAAId,EAAInB,KAAK6Y,KAAK5W,EAAIT,IAAIxB,KAAK8Y,OAE/B,OADA3X,EAAEf,IAAM,KACDe,CACT,EACAyX,EAAKnZ,UAAUqN,KAAO,SAAcvH,EAAG9D,GACrC,GAAI8D,EAAEV,UAAYpD,EAAEoD,SAGlB,OAFAU,EAAErF,MAAM,GAAK,EACbqF,EAAEpF,OAAS,EACJoF,EAET,IAAIkB,EAAIlB,EAAEuH,KAAKrL,GACXV,EAAI0F,EAAEoM,MAAM7S,KAAKqG,OAAO7E,IAAIxB,KAAK+Y,MAAMnG,OAAO5S,KAAKqG,OAAO7E,IAAIxB,KAAKoQ,GACnEiK,EAAI5T,EAAEkC,KAAK5H,GAAGkR,OAAOjS,KAAKqG,OAC1BL,EAAMqU,EAMV,OALIA,EAAE9X,IAAIvC,KAAKoQ,IAAM,EACnBpK,EAAMqU,EAAE1R,KAAK3I,KAAKoQ,GACTiK,EAAEhF,KAAK,GAAK,IACrBrP,EAAMqU,EAAE3R,KAAK1I,KAAKoQ,IAEbpK,EAAIuQ,UAAUvW,KACvB,EACA4Y,EAAKnZ,UAAU+B,IAAM,SAAa+D,EAAG9D,GACnC,GAAI8D,EAAEV,UAAYpD,EAAEoD,SAAU,OAAO,IAAIlF,EAAG,GAAG4W,UAAUvW,MACzD,IAAIyG,EAAIlB,EAAE/D,IAAIC,GACVV,EAAI0F,EAAEoM,MAAM7S,KAAKqG,OAAO7E,IAAIxB,KAAK+Y,MAAMnG,OAAO5S,KAAKqG,OAAO7E,IAAIxB,KAAKoQ,GACnEiK,EAAI5T,EAAEkC,KAAK5H,GAAGkR,OAAOjS,KAAKqG,OAC1BL,EAAMqU,EAMV,OALIA,EAAE9X,IAAIvC,KAAKoQ,IAAM,EACnBpK,EAAMqU,EAAE1R,KAAK3I,KAAKoQ,GACTiK,EAAEhF,KAAK,GAAK,IACrBrP,EAAMqU,EAAE3R,KAAK1I,KAAKoQ,IAEbpK,EAAIuQ,UAAUvW,KACvB,EACA4Y,EAAKnZ,UAAU6V,KAAO,SAAc/P,GAGlC,OADUvF,KAAK6Y,KAAKtT,EAAE0P,OAAOjV,KAAKoQ,GAAG5O,IAAIxB,KAAKgU,KACnCuC,UAAUvW,KACvB,CACD,CAnhGD,CAmhGoCO,EAAQP,K","file":"js/index~ecbe215e-e50a1c9b1e06d6a27b1b.chunk.js","sourcesContent":["(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    this.negative = 0;\n    this.words = null;\n    this.length = 0;\n\n    // Reduction context\n    this.red = null;\n    if (number !== null) {\n      if (base === 'le' || base === 'be') {\n        endian = base;\n        base = 10;\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  BN.BN = BN;\n  BN.wordSize = 26;\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  BN.isBN = function isBN(num) {\n    if (num instanceof BN) {\n      return true;\n    }\n    return num !== null && typeof num === 'object' && num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n  };\n  BN.max = function max(left, right) {\n    if (left.cmp(right) > 0) return left;\n    return right;\n  };\n  BN.min = function min(left, right) {\n    if (left.cmp(right) < 0) return left;\n    return right;\n  };\n  BN.prototype._init = function init(number, base, endian) {\n    if (typeof number === 'number') {\n      return this._initNumber(number, base, endian);\n    }\n    if (typeof number === 'object') {\n      return this._initArray(number, base, endian);\n    }\n    if (base === 'hex') {\n      base = 16;\n    }\n    assert(base === (base | 0) && base >= 2 && base <= 36);\n    number = number.toString().replace(/\\s+/g, '');\n    var start = 0;\n    if (number[0] === '-') {\n      start++;\n      this.negative = 1;\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  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 = [number & 0x3ffffff, number / 0x4000000 & 0x3ffffff];\n      this.length = 2;\n    } else {\n      assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n      this.words = [number & 0x3ffffff, number / 0x4000000 & 0x3ffffff, 1];\n      this.length = 3;\n    }\n    if (endian !== 'le') return;\n\n    // Reverse the bytes\n    this._initArray(this.toArray(), base, endian);\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    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    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  function parseHex4Bits(string, index) {\n    var c = string.charCodeAt(index);\n    // '0' - '9'\n    if (c >= 48 && c <= 57) {\n      return c - 48;\n      // 'A' - 'F'\n    } else if (c >= 65 && c <= 70) {\n      return c - 55;\n      // 'a' - 'f'\n    } else if (c >= 97 && c <= 102) {\n      return c - 87;\n    } else {\n      assert(false, 'Invalid character in ' + string);\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  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    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    this._strip();\n  };\n  function parseBase(str, start, end, mul) {\n    var r = 0;\n    var b = 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      r *= mul;\n\n      // 'a'\n      if (c >= 49) {\n        b = c - 49 + 0xa;\n\n        // 'A'\n      } else if (c >= 17) {\n        b = c - 17 + 0xa;\n\n        // '0' - '9'\n      } else {\n        b = c;\n      }\n      assert(c >= 0 && b < mul, 'Invalid character');\n      r += b;\n    }\n    return r;\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    var total = number.length - start;\n    var mod = total % limbLen;\n    var end = Math.min(total, total - mod) + start;\n    var word = 0;\n    for (var i = start; i < end; i += limbLen) {\n      word = parseBase(number, i, i + limbLen, base);\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    if (mod !== 0) {\n      var pow = 1;\n      word = parseBase(number, i, number.length, base);\n      for (i = 0; i < mod; i++) {\n        pow *= base;\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    this._strip();\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  function move(dest, src) {\n    dest.words = src.words;\n    dest.length = src.length;\n    dest.negative = src.negative;\n    dest.red = src.red;\n  }\n  BN.prototype._move = function _move(dest) {\n    move(dest, this);\n  };\n  BN.prototype.clone = function clone() {\n    var r = new BN(null);\n    this.copy(r);\n    return r;\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  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  // Check Symbol.for because not everywhere where Symbol defined\n  // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol#Browser_compatibility\n  if (typeof Symbol !== 'undefined' && typeof Symbol.for === 'function') {\n    try {\n      BN.prototype[Symbol.for('nodejs.util.inspect.custom')] = inspect;\n    } catch (e) {\n      BN.prototype.inspect = inspect;\n    }\n  } else {\n    BN.prototype.inspect = inspect;\n  }\n  function inspect() {\n    return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n  }\n\n  /*\n   var zeros = [];\n  var groupSizes = [];\n  var groupBases = [];\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  var zeros = ['', '0', '00', '000', '0000', '00000', '000000', '0000000', '00000000', '000000000', '0000000000', '00000000000', '000000000000', '0000000000000', '00000000000000', '000000000000000', '0000000000000000', '00000000000000000', '000000000000000000', '0000000000000000000', '00000000000000000000', '000000000000000000000', '0000000000000000000000', '00000000000000000000000', '000000000000000000000000', '0000000000000000000000000'];\n  var groupSizes = [0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5];\n  var groupBases = [0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632, 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149, 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176];\n  BN.prototype.toString = function toString(base, padding) {\n    base = base || 10;\n    padding = padding | 0 || 1;\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        off += 2;\n        if (off >= 26) {\n          off -= 26;\n          i--;\n        }\n        if (carry !== 0 || i !== this.length - 1) {\n          out = zeros[6 - word.length] + word + out;\n        } else {\n          out = word + out;\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    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.modrn(groupBase).toString(base);\n        c = c.idivn(groupBase);\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    assert(false, 'Base should be between 2 and 36');\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  BN.prototype.toJSON = function toJSON() {\n    return this.toString(16, 2);\n  };\n  if (Buffer) {\n    BN.prototype.toBuffer = function toBuffer(endian, length) {\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  var allocate = function allocate(ArrayType, size) {\n    if (ArrayType.allocUnsafe) {\n      return ArrayType.allocUnsafe(size);\n    }\n    return new ArrayType(size);\n  };\n  BN.prototype.toArrayLike = function toArrayLike(ArrayType, endian, length) {\n    this._strip();\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    var res = allocate(ArrayType, reqLength);\n    var postfix = endian === 'le' ? 'LE' : 'BE';\n    this['_toArrayLike' + postfix](res, byteLength);\n    return res;\n  };\n  BN.prototype._toArrayLikeLE = function _toArrayLikeLE(res, byteLength) {\n    var position = 0;\n    var carry = 0;\n    for (var i = 0, shift = 0; i < this.length; i++) {\n      var word = this.words[i] << shift | carry;\n      res[position++] = word & 0xff;\n      if (position < res.length) {\n        res[position++] = word >> 8 & 0xff;\n      }\n      if (position < res.length) {\n        res[position++] = word >> 16 & 0xff;\n      }\n      if (shift === 6) {\n        if (position < res.length) {\n          res[position++] = word >> 24 & 0xff;\n        }\n        carry = 0;\n        shift = 0;\n      } else {\n        carry = word >>> 24;\n        shift += 2;\n      }\n    }\n    if (position < res.length) {\n      res[position++] = carry;\n      while (position < res.length) {\n        res[position++] = 0;\n      }\n    }\n  };\n  BN.prototype._toArrayLikeBE = function _toArrayLikeBE(res, byteLength) {\n    var position = res.length - 1;\n    var carry = 0;\n    for (var i = 0, shift = 0; i < this.length; i++) {\n      var word = this.words[i] << shift | carry;\n      res[position--] = word & 0xff;\n      if (position >= 0) {\n        res[position--] = word >> 8 & 0xff;\n      }\n      if (position >= 0) {\n        res[position--] = word >> 16 & 0xff;\n      }\n      if (shift === 6) {\n        if (position >= 0) {\n          res[position--] = word >> 24 & 0xff;\n        }\n        carry = 0;\n        shift = 0;\n      } else {\n        carry = word >>> 24;\n        shift += 2;\n      }\n    }\n    if (position >= 0) {\n      res[position--] = carry;\n      while (position >= 0) {\n        res[position--] = 0;\n      }\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  BN.prototype._zeroBits = function _zeroBits(w) {\n    // Short-cut\n    if (w === 0) return 26;\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  function toBitArray(num) {\n    var w = new Array(num.bitLength());\n    for (var bit = 0; bit < w.length; bit++) {\n      var off = bit / 26 | 0;\n      var wbit = bit % 26;\n      w[bit] = num.words[off] >>> wbit & 0x01;\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    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  BN.prototype.byteLength = function byteLength() {\n    return Math.ceil(this.bitLength() / 8);\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  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  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  BN.prototype.ineg = function ineg() {\n    if (!this.isZero()) {\n      this.negative ^= 1;\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    for (var i = 0; i < num.length; i++) {\n      this.words[i] = this.words[i] | num.words[i];\n    }\n    return this._strip();\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  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    for (var i = 0; i < b.length; i++) {\n      this.words[i] = this.words[i] & num.words[i];\n    }\n    this.length = b.length;\n    return this._strip();\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  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    for (var i = 0; i < b.length; i++) {\n      this.words[i] = a.words[i] ^ b.words[i];\n    }\n    if (this !== a) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n    this.length = a.length;\n    return this._strip();\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  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    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    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  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    var off = bit / 26 | 0;\n    var wbit = bit % 26;\n    this._expand(off + 1);\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    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    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    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    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    if (this.length > num.length) return this.clone().iadd(num);\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    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    this.length = Math.max(this.length, i);\n    if (a !== this) {\n      this.negative = 1;\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  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    var lo = r & 0x3ffffff;\n    var carry = r / 0x4000000 | 0;\n    out.words[0] = lo;\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    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    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  function bigMulTo(self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    out.length = self.length + num.length;\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        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        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    return out._strip();\n  }\n  function jumboMulTo(self, num, out) {\n    // Temporary disable, see https://github.com/indutny/bn.js/issues/211\n    // var fftm = new FFTM();\n    // return fftm.mulp(self, num, out);\n    return bigMulTo(self, num, out);\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    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  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    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    var rb = 0;\n    for (var i = 0; i < l; i++) {\n      rb |= (x & 1) << l - i - 1;\n      x >>= 1;\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  FFTM.prototype.transform = function transform(rws, iws, rtws, itws, N, rbt) {\n    this.permute(rbt, rws, iws, rtws, itws, N);\n    for (var s = 1; s < N; s <<= 1) {\n      var l = s << 1;\n      var rtwdf = Math.cos(2 * Math.PI / l);\n      var itwdf = Math.sin(2 * Math.PI / l);\n      for (var p = 0; p < N; p += l) {\n        var rtwdf_ = rtwdf;\n        var itwdf_ = itwdf;\n        for (var j = 0; j < s; j++) {\n          var re = rtws[p + j];\n          var ie = itws[p + j];\n          var ro = rtws[p + j + s];\n          var io = itws[p + j + s];\n          var rx = rtwdf_ * ro - itwdf_ * io;\n          io = rtwdf_ * io + itwdf_ * ro;\n          ro = rx;\n          rtws[p + j] = re + ro;\n          itws[p + j] = ie + io;\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            itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n            rtwdf_ = rx;\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    return 1 << i + 1 + odd;\n  };\n  FFTM.prototype.conjugate = function conjugate(rws, iws, N) {\n    if (N <= 1) return;\n    for (var i = 0; i < N / 2; i++) {\n      var t = rws[i];\n      rws[i] = rws[N - i - 1];\n      rws[N - i - 1] = t;\n      t = iws[i];\n      iws[i] = -iws[N - i - 1];\n      iws[N - i - 1] = -t;\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 + Math.round(ws[2 * i] / N) + carry;\n      ws[i] = w & 0x3ffffff;\n      if (w < 0x4000000) {\n        carry = 0;\n      } else {\n        carry = w / 0x4000000 | 0;\n      }\n    }\n    return ws;\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      rws[2 * i] = carry & 0x1fff;\n      carry = carry >>> 13;\n      rws[2 * i + 1] = carry & 0x1fff;\n      carry = carry >>> 13;\n    }\n\n    // Pad with zeroes\n    for (i = 2 * len; i < N; ++i) {\n      rws[i] = 0;\n    }\n    assert(carry === 0);\n    assert((carry & ~0x1fff) === 0);\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    return ph;\n  };\n  FFTM.prototype.mulp = function mulp(x, y, out) {\n    var N = 2 * this.guessLen13b(x.length, y.length);\n    var rbt = this.makeRBT(N);\n    var _ = this.stub(N);\n    var rws = new Array(N);\n    var rwst = new Array(N);\n    var iwst = new Array(N);\n    var nrws = new Array(N);\n    var nrwst = new Array(N);\n    var niwst = new Array(N);\n    var rmws = out.words;\n    rmws.length = N;\n    this.convert13b(x.words, x.length, rws, N);\n    this.convert13b(y.words, y.length, nrws, N);\n    this.transform(rws, _, rwst, iwst, N, rbt);\n    this.transform(nrws, _, nrwst, niwst, N, rbt);\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    this.conjugate(rwst, iwst, N);\n    this.transform(rwst, iwst, rmws, _, N, rbt);\n    this.conjugate(rmws, _, N);\n    this.normalize13b(rmws, 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  BN.prototype.imuln = function imuln(num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -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    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n    return isNegNum ? this.ineg() : this;\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    if (++i < w.length) {\n      for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n        if (w[i] === 0) continue;\n        res = res.mul(q);\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    if (r !== 0) {\n      var carry = 0;\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      if (carry) {\n        this.words[i] = carry;\n        this.length++;\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      for (i = 0; i < s; i++) {\n        this.words[i] = 0;\n      }\n      this.length += s;\n    }\n    return this._strip();\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    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    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    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    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    if (this.length === 0) {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n    return this._strip();\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  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  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    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    assert(this.negative === 0, 'imaskn works only with positive numbers');\n    if (this.length <= s) {\n      return this;\n    }\n    if (r !== 0) {\n      s++;\n    }\n    this.length = Math.min(s, this.length);\n    if (r !== 0) {\n      var mask = 0x3ffffff ^ 0x3ffffff >>> r << r;\n      this.words[this.length - 1] &= mask;\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      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  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    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    if (this.negative !== 0) {\n      this.negative = 0;\n      this.iaddn(num);\n      this.negative = 1;\n      return this;\n    }\n    this.words[0] -= num;\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    return this._strip();\n  };\n  BN.prototype.addn = function addn(num) {\n    return this.clone().iaddn(num);\n  };\n  BN.prototype.subn = function subn(num) {\n    return this.clone().isubn(num);\n  };\n  BN.prototype.iabs = function iabs() {\n    this.negative = 0;\n    return this;\n  };\n  BN.prototype.abs = function abs() {\n    return this.clone().iabs();\n  };\n  BN.prototype._ishlnsubmul = function _ishlnsubmul(num, mul, shift) {\n    var len = num.length + shift;\n    var i;\n    this._expand(len);\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    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    return this._strip();\n  };\n  BN.prototype._wordDiv = function _wordDiv(num, mode) {\n    var shift = this.length - num.length;\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    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    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    for (var j = m - 1; j >= 0; j--) {\n      var qj = (a.words[b.length + j] | 0) * 0x4000000 + (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      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    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    if (this.isZero()) {\n      return {\n        div: new BN(0),\n        mod: new BN(0)\n      };\n    }\n    var div, mod, res;\n    if (this.negative !== 0 && num.negative === 0) {\n      res = this.neg().divmod(num, mode);\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.iadd(num);\n        }\n      }\n      return {\n        div: div,\n        mod: mod\n      };\n    }\n    if (this.negative === 0 && num.negative !== 0) {\n      res = this.divmod(num.neg(), mode);\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n      return {\n        div: div,\n        mod: res.mod\n      };\n    }\n    if ((this.negative & num.negative) !== 0) {\n      res = this.neg().divmod(num.neg(), mode);\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.isub(num);\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      if (mode === 'mod') {\n        return {\n          div: null,\n          mod: new BN(this.modrn(num.words[0]))\n        };\n      }\n      return {\n        div: this.divn(num.words[0]),\n        mod: new BN(this.modrn(num.words[0]))\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  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    var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\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  BN.prototype.modrn = function modrn(num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n    assert(num <= 0x3ffffff);\n    var p = (1 << 26) % num;\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    return isNegNum ? -acc : acc;\n  };\n\n  // WARNING: DEPRECATED\n  BN.prototype.modn = function modn(num) {\n    return this.modrn(num);\n  };\n\n  // In-place division by number\n  BN.prototype.idivn = function idivn(num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n    assert(num <= 0x3ffffff);\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    this._strip();\n    return isNegNum ? this.ineg() : this;\n  };\n  BN.prototype.divn = function divn(num) {\n    return this.clone().idivn(num);\n  };\n  BN.prototype.egcd = function egcd(p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n    var x = this;\n    var y = p.clone();\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    var g = 0;\n    while (x.isEven() && y.isEven()) {\n      x.iushrn(1);\n      y.iushrn(1);\n      ++g;\n    }\n    var yp = y.clone();\n    var xp = x.clone();\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          A.iushrn(1);\n          B.iushrn(1);\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          C.iushrn(1);\n          D.iushrn(1);\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    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    var a = this;\n    var b = p.clone();\n    if (a.negative !== 0) {\n      a = a.umod(p);\n    } else {\n      a = a.clone();\n    }\n    var x1 = new BN(1);\n    var x2 = new BN(0);\n    var delta = b.clone();\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          x1.iushrn(1);\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          x2.iushrn(1);\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    var res;\n    if (a.cmpn(1) === 0) {\n      res = x1;\n    } else {\n      res = x2;\n    }\n    if (res.cmpn(0) < 0) {\n      res.iadd(p);\n    }\n    return res;\n  };\n  BN.prototype.gcd = function gcd(num) {\n    if (this.isZero()) return num.abs();\n    if (num.isZero()) return this.abs();\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    do {\n      while (a.isEven()) {\n        a.iushrn(1);\n      }\n      while (b.isEven()) {\n        b.iushrn(1);\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      a.isub(b);\n    } while (true);\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  BN.prototype.isEven = function isEven() {\n    return (this.words[0] & 1) === 0;\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  BN.prototype.isZero = function isZero() {\n    return this.length === 1 && this.words[0] === 0;\n  };\n  BN.prototype.cmpn = function cmpn(num) {\n    var negative = num < 0;\n    if (this.negative !== 0 && !negative) return -1;\n    if (this.negative === 0 && negative) return 1;\n    this._strip();\n    var res;\n    if (this.length > 1) {\n      res = 1;\n    } else {\n      if (negative) {\n        num = -num;\n      }\n      assert(num <= 0x3ffffff, 'Number is too big');\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    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    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      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  BN.prototype.gtn = function gtn(num) {\n    return this.cmpn(num) === 1;\n  };\n  BN.prototype.gt = function gt(num) {\n    return this.cmp(num) === 1;\n  };\n  BN.prototype.gten = function gten(num) {\n    return this.cmpn(num) >= 0;\n  };\n  BN.prototype.gte = function gte(num) {\n    return this.cmp(num) >= 0;\n  };\n  BN.prototype.ltn = function ltn(num) {\n    return this.cmpn(num) === -1;\n  };\n  BN.prototype.lt = function lt(num) {\n    return this.cmp(num) === -1;\n  };\n  BN.prototype.lten = function lten(num) {\n    return this.cmpn(num) <= 0;\n  };\n  BN.prototype.lte = function lte(num) {\n    return this.cmp(num) <= 0;\n  };\n  BN.prototype.eqn = function eqn(num) {\n    return this.cmpn(num) === 0;\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  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  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  BN.prototype._forceRed = function _forceRed(ctx) {\n    this.red = ctx;\n    return this;\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  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  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  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  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  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  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  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  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  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  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  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    this.tmp = this._tmp();\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  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    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    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 a BN v4 instance\n        r.strip();\n      } else {\n        // r is a BN v5 instance\n        r._strip();\n      }\n    }\n    return r;\n  };\n  MPrime.prototype.split = function split(input, out) {\n    input.iushrn(this.n, 0, out);\n  };\n  MPrime.prototype.imulK = function imulK(num) {\n    return num.imul(this.k);\n  };\n  function K256() {\n    MPrime.call(this, 'k256', 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n  }\n  inherits(K256, MPrime);\n  K256.prototype.split = function split(input, output) {\n    // 256 = 9 * 26 + 22\n    var mask = 0x3fffff;\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    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    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  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  function P224() {\n    MPrime.call(this, 'p224', 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n  }\n  inherits(P224, MPrime);\n  function P192() {\n    MPrime.call(this, 'p192', 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n  }\n  inherits(P192, MPrime);\n  function P25519() {\n    // 2 ^ 255 - 19\n    MPrime.call(this, '25519', '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n  }\n  inherits(P25519, MPrime);\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      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    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    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  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  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, 'red works only with red numbers');\n  };\n  Red.prototype.imod = function imod(a) {\n    if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n    move(a, a.umod(this.m)._forceRed(this));\n    return a;\n  };\n  Red.prototype.neg = function neg(a) {\n    if (a.isZero()) {\n      return a.clone();\n    }\n    return this.m.sub(a)._forceRed(this);\n  };\n  Red.prototype.add = function add(a, b) {\n    this._verify2(a, b);\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  Red.prototype.iadd = function iadd(a, b) {\n    this._verify2(a, b);\n    var res = a.iadd(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res;\n  };\n  Red.prototype.sub = function sub(a, b) {\n    this._verify2(a, b);\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  Red.prototype.isub = function isub(a, b) {\n    this._verify2(a, b);\n    var res = a.isub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res;\n  };\n  Red.prototype.shl = function shl(a, num) {\n    this._verify1(a);\n    return this.imod(a.ushln(num));\n  };\n  Red.prototype.imul = function imul(a, b) {\n    this._verify2(a, b);\n    return this.imod(a.imul(b));\n  };\n  Red.prototype.mul = function mul(a, b) {\n    this._verify2(a, b);\n    return this.imod(a.mul(b));\n  };\n  Red.prototype.isqr = function isqr(a) {\n    return this.imul(a, a.clone());\n  };\n  Red.prototype.sqr = function sqr(a) {\n    return this.mul(a, a);\n  };\n  Red.prototype.sqrt = function sqrt(a) {\n    if (a.isZero()) return a.clone();\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    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    while (this.pow(z, lpow).cmp(nOne) !== 0) {\n      z.redIAdd(nOne);\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      r = r.redMul(b);\n      c = b.redSqr();\n      t = t.redMul(c);\n      m = i;\n    }\n    return r;\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  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    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    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    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        if (bit === 0 && current === 0) {\n          currentLen = 0;\n          continue;\n        }\n        current <<= 1;\n        current |= bit;\n        currentLen++;\n        if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n        res = this.mul(res, wnd[current]);\n        currentLen = 0;\n        current = 0;\n      }\n      start = 26;\n    }\n    return res;\n  };\n  Red.prototype.convertTo = function convertTo(num) {\n    var r = num.umod(this.m);\n    return r === num ? r.clone() : r;\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  function Mont(m) {\n    Red.call(this, m);\n    this.shift = this.m.bitLength();\n    if (this.shift % 26 !== 0) {\n      this.shift += 26 - this.shift % 26;\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    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  Mont.prototype.convertTo = function convertTo(num) {\n    return this.imod(num.ushln(this.shift));\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  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    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    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    return res._forceRed(this);\n  };\n  Mont.prototype.mul = function mul(a, b) {\n    if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\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    return res._forceRed(this);\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);"],"sourceRoot":""}