{"version":3,"sources":["webpack:///./node_modules/public-encrypt/node_modules/bn.js/lib/bn.js","webpack:///./node_modules/public-encrypt/privateDecrypt.js","webpack:///./node_modules/public-encrypt/withPublic.js","webpack:///./node_modules/public-encrypt/browser.js","webpack:///./node_modules/public-encrypt/xor.js","webpack:///./node_modules/public-encrypt/publicEncrypt.js","webpack:///./node_modules/public-encrypt/mgf.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","len","Math","min","i","num","Array","isArray","max","left","right","cmp","_initNumber","_initArray","toString","replace","_parseHex","_parseBase","toArray","ceil","j","w","off","strip","parseLength","limbLen","limbPow","total","mod","word","imuln","_iaddn","pow","copy","dest","clone","_expand","size","_normSign","inspect","zeros","groupSizes","groupBases","toBitArray","bitLength","bit","wbit","smallMulTo","self","out","a","b","lo","carry","k","ncarry","rword","maxJ","padding","groupSize","groupBase","isZero","modn","idivn","toNumber","ret","toJSON","toBuffer","toArrayLike","ArrayType","byteLength","reqLength","littleEndian","res","q","andln","iushrn","clz32","_countBits","t","_zeroBits","hi","zeroBits","toTwos","width","abs","inotn","iaddn","fromTwos","testn","notn","ineg","isNeg","neg","iuor","ior","or","uor","iuand","iand","and","uand","iuxor","ixor","xor","uxor","bytesNeeded","bitsLeft","setn","iadd","isub","add","sub","comb10MulTo","mid","o","a0","al0","ah0","a1","al1","ah1","a2","al2","ah2","a3","al3","ah3","a4","al4","ah4","a5","al5","ah5","a6","al6","ah6","a7","al7","ah7","a8","al8","ah8","a9","al9","ah9","b0","bl0","bh0","b1","bl1","bh1","b2","bl2","bh2","b3","bl3","bh3","b4","bl4","bh4","b5","bl5","bh5","b6","bl6","bh6","b7","bl7","bh7","b8","bl8","bh8","b9","bl9","bh9","imul","w0","w1","w2","w3","w4","w5","w6","w7","w8","w9","w10","w11","w12","w13","w14","w15","w16","w17","w18","bigMulTo","hncarry","jumboMulTo","fftm","FFTM","mulp","x","y","mulTo","makeRBT","N","l","revBin","rb","permute","rbt","rws","iws","rtws","itws","transform","s","rtwdf","cos","PI","itwdf","sin","p","rtwdf_","itwdf_","re","ie","ro","io","rx","guessLen13b","n","m","odd","conjugate","normalize13b","ws","round","convert13b","stub","ph","_","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","muln","sqr","isqr","iushln","bits","carryMask","newCarry","ishln","hint","extended","h","mask","maskedWords","ishrn","shln","ushln","shrn","ushrn","imaskn","maskn","isubn","addn","subn","iabs","_ishlnsubmul","shift","_wordDiv","mode","bhi","bhiBits","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","acc","egcd","A","B","C","D","g","isEven","yp","xp","im","isOdd","jm","gcd","_invmp","x1","x2","delta","cmpn","invm","bincn","ucmp","gtn","gt","gten","gte","ltn","lt","lten","lte","eqn","eq","Red","toRed","ctx","convertTo","_forceRed","fromRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","shl","redMul","_verify2","redIMul","redSqr","_verify1","redISqr","redSqrt","sqrt","redInvm","redNeg","redPow","primes","k256","p224","p192","p25519","MPrime","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","windowSize","wnd","current","currentLen","mont","u","parseKeys","mgf","crt","createHash","withPublic","oaep","key","modulus","iHash","update","alloc","digest","hLen","maskedSeed","slice","maskedDb","seed","db","compare","pkcs1","reverse","p1","status","ps","from","dif","privateKey","enc","zBuffer","concat","paddedMsg","publicExponent","publicEncrypt","privateDecrypt","privateEncrypt","buf","publicDecrypt","randomBytes","mLen","hLen2","dblen","nonZero","allocUnsafe","cache","cur","publicKey","i2ops","writeUInt32BE"],"mappings":"wGAAA,2BACE,aAGA,SAASA,EAAQC,EAAKC,GACpB,IAAKD,EAAK,MAAM,IAAIE,MAAMD,GAAO,oBAKnC,SAASE,EAAUC,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAASC,UAAYH,EAAUG,UAC/BJ,EAAKI,UAAY,IAAID,EACrBH,EAAKI,UAAUC,YAAcL,EAK/B,SAASM,EAAIC,EAAQC,EAAMC,GACzB,GAAIH,EAAGI,KAAKH,GACV,OAAOA,EAGTI,KAAKC,SAAW,EAChBD,KAAKE,MAAQ,KACbF,KAAKG,OAAS,EAGdH,KAAKI,IAAM,KAEI,OAAXR,IACW,OAATC,GAA0B,OAATA,IACnBC,EAASD,EACTA,EAAO,IAGTG,KAAKK,MAAMT,GAAU,EAAGC,GAAQ,GAAIC,GAAU,OAYlD,IAAIQ,EATkB,kBAAXC,EACTA,EAAOC,QAAUb,EAEjBa,EAAQb,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGc,SAAW,GAGd,IAEIH,EADoB,qBAAXI,QAAmD,qBAAlBA,OAAOJ,OACxCI,OAAOJ,OAEP,EAAQ,IAAUA,OAE7B,MAAOK,IAgIT,SAASC,EAAeC,EAAQC,GAC9B,IAAIC,EAAIF,EAAOG,WAAWF,GAE1B,OAAIC,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,GAGHA,EAAI,GAAM,GAItB,SAASE,EAAcJ,EAAQK,EAAYJ,GACzC,IAAIK,EAAIP,EAAcC,EAAQC,GAI9B,OAHIA,EAAQ,GAAKI,IACfC,GAAKP,EAAcC,EAAQC,EAAQ,IAAM,GAEpCK,EA8CT,SAASC,EAAWC,EAAKC,EAAOC,EAAKC,GAGnC,IAFA,IAAIL,EAAI,EACJM,EAAMC,KAAKC,IAAIN,EAAIlB,OAAQoB,GACtBK,EAAIN,EAAOM,EAAIH,EAAKG,IAAK,CAChC,IAAIb,EAAIM,EAAIL,WAAWY,GAAK,GAE5BT,GAAKK,EAIHL,GADEJ,GAAK,GACFA,EAAI,GAAK,GAGLA,GAAK,GACTA,EAAI,GAAK,GAITA,EAGT,OAAOI,EAnNTxB,EAAGI,KAAO,SAAe8B,GACvB,OAAIA,aAAelC,GAIJ,OAARkC,GAA+B,kBAARA,GAC5BA,EAAInC,YAAYe,WAAad,EAAGc,UAAYqB,MAAMC,QAAQF,EAAI3B,QAGlEP,EAAGqC,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTvC,EAAGgC,IAAM,SAAcM,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTvC,EAAGF,UAAUY,MAAQ,SAAeT,EAAQC,EAAMC,GAChD,GAAsB,kBAAXF,EACT,OAAOI,KAAKoC,YAAYxC,EAAQC,EAAMC,GAGxC,GAAsB,kBAAXF,EACT,OAAOI,KAAKqC,WAAWzC,EAAQC,EAAMC,GAG1B,QAATD,IACFA,EAAO,IAETb,EAAOa,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAEnDD,EAASA,EAAO0C,WAAWC,QAAQ,OAAQ,IAC3C,IAAIjB,EAAQ,EACM,MAAd1B,EAAO,KACT0B,IACAtB,KAAKC,SAAW,GAGdqB,EAAQ1B,EAAOO,SACJ,KAATN,EACFG,KAAKwC,UAAU5C,EAAQ0B,EAAOxB,IAE9BE,KAAKyC,WAAW7C,EAAQC,EAAMyB,GACf,OAAXxB,GACFE,KAAKqC,WAAWrC,KAAK0C,UAAW7C,EAAMC,MAM9CH,EAAGF,UAAU2C,YAAc,SAAsBxC,EAAQC,EAAMC,GACzDF,EAAS,IACXI,KAAKC,SAAW,EAChBL,GAAUA,GAERA,EAAS,UACXI,KAAKE,MAAQ,CAAW,SAATN,GACfI,KAAKG,OAAS,GACLP,EAAS,kBAClBI,KAAKE,MAAQ,CACF,SAATN,EACCA,EAAS,SAAa,UAEzBI,KAAKG,OAAS,IAEdnB,EAAOY,EAAS,kBAChBI,KAAKE,MAAQ,CACF,SAATN,EACCA,EAAS,SAAa,SACvB,GAEFI,KAAKG,OAAS,GAGD,OAAXL,GAGJE,KAAKqC,WAAWrC,KAAK0C,UAAW7C,EAAMC,IAGxCH,EAAGF,UAAU4C,WAAa,SAAqBzC,EAAQC,EAAMC,GAG3D,GADAd,EAAgC,kBAAlBY,EAAOO,QACjBP,EAAOO,QAAU,EAGnB,OAFAH,KAAKE,MAAQ,CAAE,GACfF,KAAKG,OAAS,EACPH,KAGTA,KAAKG,OAASuB,KAAKiB,KAAK/C,EAAOO,OAAS,GACxCH,KAAKE,MAAQ,IAAI4B,MAAM9B,KAAKG,QAC5B,IAAK,IAAIyB,EAAI,EAAGA,EAAI5B,KAAKG,OAAQyB,IAC/B5B,KAAKE,MAAM0B,GAAK,EAGlB,IAAIgB,EAAGC,EACHC,EAAM,EACV,GAAe,OAAXhD,EACF,IAAK8B,EAAIhC,EAAOO,OAAS,EAAGyC,EAAI,EAAGhB,GAAK,EAAGA,GAAK,EAC9CiB,EAAIjD,EAAOgC,GAAMhC,EAAOgC,EAAI,IAAM,EAAMhC,EAAOgC,EAAI,IAAM,GACzD5B,KAAKE,MAAM0C,IAAOC,GAAKC,EAAO,SAC9B9C,KAAKE,MAAM0C,EAAI,GAAMC,IAAO,GAAKC,EAAQ,SACzCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPF,UAGC,GAAe,OAAX9C,EACT,IAAK8B,EAAI,EAAGgB,EAAI,EAAGhB,EAAIhC,EAAOO,OAAQyB,GAAK,EACzCiB,EAAIjD,EAAOgC,GAAMhC,EAAOgC,EAAI,IAAM,EAAMhC,EAAOgC,EAAI,IAAM,GACzD5B,KAAKE,MAAM0C,IAAOC,GAAKC,EAAO,SAC9B9C,KAAKE,MAAM0C,EAAI,GAAMC,IAAO,GAAKC,EAAQ,SACzCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPF,KAIN,OAAO5C,KAAK+C,SAyBdpD,EAAGF,UAAU+C,UAAY,SAAoB5C,EAAQ0B,EAAOxB,GAE1DE,KAAKG,OAASuB,KAAKiB,MAAM/C,EAAOO,OAASmB,GAAS,GAClDtB,KAAKE,MAAQ,IAAI4B,MAAM9B,KAAKG,QAC5B,IAAK,IAAIyB,EAAI,EAAGA,EAAI5B,KAAKG,OAAQyB,IAC/B5B,KAAKE,MAAM0B,GAAK,EAIlB,IAGIiB,EAHAC,EAAM,EACNF,EAAI,EAGR,GAAe,OAAX9C,EACF,IAAK8B,EAAIhC,EAAOO,OAAS,EAAGyB,GAAKN,EAAOM,GAAK,EAC3CiB,EAAI5B,EAAarB,EAAQ0B,EAAOM,IAAMkB,EACtC9C,KAAKE,MAAM0C,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACL5C,KAAKE,MAAM0C,IAAMC,IAAM,IAEvBC,GAAO,MAGN,CACL,IAAIE,EAAcpD,EAAOO,OAASmB,EAClC,IAAKM,EAAIoB,EAAc,IAAM,EAAI1B,EAAQ,EAAIA,EAAOM,EAAIhC,EAAOO,OAAQyB,GAAK,EAC1EiB,EAAI5B,EAAarB,EAAQ0B,EAAOM,IAAMkB,EACtC9C,KAAKE,MAAM0C,IAAU,SAAJC,EACbC,GAAO,IACTA,GAAO,GACPF,GAAK,EACL5C,KAAKE,MAAM0C,IAAMC,IAAM,IAEvBC,GAAO,EAKb9C,KAAK+C,SA2BPpD,EAAGF,UAAUgD,WAAa,SAAqB7C,EAAQC,EAAMyB,GAE3DtB,KAAKE,MAAQ,CAAE,GACfF,KAAKG,OAAS,EAGd,IAAK,IAAI8C,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWrD,EAClEoD,IAEFA,IACAC,EAAWA,EAAUrD,EAAQ,EAO7B,IALA,IAAIsD,EAAQvD,EAAOO,OAASmB,EACxB8B,EAAMD,EAAQF,EACd1B,EAAMG,KAAKC,IAAIwB,EAAOA,EAAQC,GAAO9B,EAErC+B,EAAO,EACFzB,EAAIN,EAAOM,EAAIL,EAAKK,GAAKqB,EAChCI,EAAOjC,EAAUxB,EAAQgC,EAAGA,EAAIqB,EAASpD,GAEzCG,KAAKsD,MAAMJ,GACPlD,KAAKE,MAAM,GAAKmD,EAAO,SACzBrD,KAAKE,MAAM,IAAMmD,EAEjBrD,KAAKuD,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAOjC,EAAUxB,EAAQgC,EAAGhC,EAAOO,OAAQN,GAEtC+B,EAAI,EAAGA,EAAIwB,EAAKxB,IACnB4B,GAAO3D,EAGTG,KAAKsD,MAAME,GACPxD,KAAKE,MAAM,GAAKmD,EAAO,SACzBrD,KAAKE,MAAM,IAAMmD,EAEjBrD,KAAKuD,OAAOF,GAIhBrD,KAAK+C,SAGPpD,EAAGF,UAAUgE,KAAO,SAAeC,GACjCA,EAAKxD,MAAQ,IAAI4B,MAAM9B,KAAKG,QAC5B,IAAK,IAAIyB,EAAI,EAAGA,EAAI5B,KAAKG,OAAQyB,IAC/B8B,EAAKxD,MAAM0B,GAAK5B,KAAKE,MAAM0B,GAE7B8B,EAAKvD,OAASH,KAAKG,OACnBuD,EAAKzD,SAAWD,KAAKC,SACrByD,EAAKtD,IAAMJ,KAAKI,KAGlBT,EAAGF,UAAUkE,MAAQ,WACnB,IAAIxC,EAAI,IAAIxB,EAAG,MAEf,OADAK,KAAKyD,KAAKtC,GACHA,GAGTxB,EAAGF,UAAUmE,QAAU,SAAkBC,GACvC,MAAO7D,KAAKG,OAAS0D,EACnB7D,KAAKE,MAAMF,KAAKG,UAAY,EAE9B,OAAOH,MAITL,EAAGF,UAAUsD,MAAQ,WACnB,MAAO/C,KAAKG,OAAS,GAAqC,IAAhCH,KAAKE,MAAMF,KAAKG,OAAS,GACjDH,KAAKG,SAEP,OAAOH,KAAK8D,aAGdnE,EAAGF,UAAUqE,UAAY,WAKvB,OAHoB,IAAhB9D,KAAKG,QAAkC,IAAlBH,KAAKE,MAAM,KAClCF,KAAKC,SAAW,GAEXD,MAGTL,EAAGF,UAAUsE,QAAU,WACrB,OAAQ/D,KAAKI,IAAM,UAAY,SAAWJ,KAAKsC,SAAS,IAAM,KAiChE,IAAI0B,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UAyM9D,SAASC,EAAYtC,GAGnB,IAFA,IAAIgB,EAAI,IAAIf,MAAMD,EAAIuC,aAEbC,EAAM,EAAGA,EAAMxB,EAAE1C,OAAQkE,IAAO,CACvC,IAAIvB,EAAOuB,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjBxB,EAAEwB,IAAQxC,EAAI3B,MAAM4C,GAAQ,GAAKwB,KAAWA,EAG9C,OAAOzB,EAmWT,SAAS0B,EAAYC,EAAM3C,EAAK4C,GAC9BA,EAAIxE,SAAW4B,EAAI5B,SAAWuE,EAAKvE,SACnC,IAAIwB,EAAO+C,EAAKrE,OAAS0B,EAAI1B,OAAU,EACvCsE,EAAItE,OAASsB,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIiD,EAAoB,EAAhBF,EAAKtE,MAAM,GACfyE,EAAmB,EAAf9C,EAAI3B,MAAM,GACdiB,EAAIuD,EAAIC,EAERC,EAAS,SAAJzD,EACL0D,EAAS1D,EAAI,SAAa,EAC9BsD,EAAIvE,MAAM,GAAK0E,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAIrD,EAAKqD,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAOvD,KAAKC,IAAImD,EAAGjD,EAAI1B,OAAS,GAC3ByC,EAAIlB,KAAKM,IAAI,EAAG8C,EAAIN,EAAKrE,OAAS,GAAIyC,GAAKqC,EAAMrC,IAAK,CAC7D,IAAIhB,EAAKkD,EAAIlC,EAAK,EAClB8B,EAAoB,EAAhBF,EAAKtE,MAAM0B,GACf+C,EAAmB,EAAf9C,EAAI3B,MAAM0C,GACdzB,EAAIuD,EAAIC,EAAIK,EACZD,GAAW5D,EAAI,SAAa,EAC5B6D,EAAY,SAAJ7D,EAEVsD,EAAIvE,MAAM4E,GAAa,EAARE,EACfH,EAAiB,EAATE,EAQV,OANc,IAAVF,EACFJ,EAAIvE,MAAM4E,GAAa,EAARD,EAEfJ,EAAItE,SAGCsE,EAAI1B,QAzlBbpD,EAAGF,UAAU6C,SAAW,SAAmBzC,EAAMqF,GAI/C,IAAIT,EACJ,GAJA5E,EAAOA,GAAQ,GACfqF,EAAoB,EAAVA,GAAe,EAGZ,KAATrF,GAAwB,QAATA,EAAgB,CACjC4E,EAAM,GAGN,IAFA,IAAI3B,EAAM,EACN+B,EAAQ,EACHjD,EAAI,EAAGA,EAAI5B,KAAKG,OAAQyB,IAAK,CACpC,IAAIiB,EAAI7C,KAAKE,MAAM0B,GACfyB,GAA+B,UAArBR,GAAKC,EAAO+B,IAAmBvC,SAAS,IACtDuC,EAAShC,IAAO,GAAKC,EAAQ,SAE3B2B,EADY,IAAVI,GAAejD,IAAM5B,KAAKG,OAAS,EAC/B6D,EAAM,EAAIX,EAAKlD,QAAUkD,EAAOoB,EAEhCpB,EAAOoB,EAEf3B,GAAO,EACHA,GAAO,KACTA,GAAO,GACPlB,KAGU,IAAViD,IACFJ,EAAMI,EAAMvC,SAAS,IAAMmC,GAE7B,MAAOA,EAAItE,OAAS+E,IAAY,EAC9BT,EAAM,IAAMA,EAKd,OAHsB,IAAlBzE,KAAKC,WACPwE,EAAM,IAAMA,GAEPA,EAGT,GAAI5E,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAIsF,EAAYlB,EAAWpE,GAEvBuF,EAAYlB,EAAWrE,GAC3B4E,EAAM,GACN,IAAI1D,EAAIf,KAAK2D,QACb5C,EAAEd,SAAW,EACb,OAAQc,EAAEsE,SAAU,CAClB,IAAIlE,EAAIJ,EAAEuE,KAAKF,GAAW9C,SAASzC,GACnCkB,EAAIA,EAAEwE,MAAMH,GAKVX,EAHG1D,EAAEsE,SAGClE,EAAIsD,EAFJT,EAAMmB,EAAYhE,EAAEhB,QAAUgB,EAAIsD,EAKxCzE,KAAKqF,WACPZ,EAAM,IAAMA,GAEd,MAAOA,EAAItE,OAAS+E,IAAY,EAC9BT,EAAM,IAAMA,EAKd,OAHsB,IAAlBzE,KAAKC,WACPwE,EAAM,IAAMA,GAEPA,EAGTzF,GAAO,EAAO,oCAGhBW,EAAGF,UAAU+F,SAAW,WACtB,IAAIC,EAAMzF,KAAKE,MAAM,GASrB,OARoB,IAAhBF,KAAKG,OACPsF,GAAuB,SAAhBzF,KAAKE,MAAM,GACO,IAAhBF,KAAKG,QAAkC,IAAlBH,KAAKE,MAAM,GAEzCuF,GAAO,iBAAoC,SAAhBzF,KAAKE,MAAM,GAC7BF,KAAKG,OAAS,GACvBnB,GAAO,EAAO,8CAEU,IAAlBgB,KAAKC,UAAmBwF,EAAMA,GAGxC9F,EAAGF,UAAUiG,OAAS,WACpB,OAAO1F,KAAKsC,SAAS,KAGvB3C,EAAGF,UAAUkG,SAAW,SAAmB7F,EAAQK,GAEjD,OADAnB,EAAyB,qBAAXsB,GACPN,KAAK4F,YAAYtF,EAAQR,EAAQK,IAG1CR,EAAGF,UAAUiD,QAAU,SAAkB5C,EAAQK,GAC/C,OAAOH,KAAK4F,YAAY9D,MAAOhC,EAAQK,IAGzCR,EAAGF,UAAUmG,YAAc,SAAsBC,EAAW/F,EAAQK,GAClE,IAAI2F,EAAa9F,KAAK8F,aAClBC,EAAY5F,GAAUuB,KAAKM,IAAI,EAAG8D,GACtC9G,EAAO8G,GAAcC,EAAW,yCAChC/G,EAAO+G,EAAY,EAAG,+BAEtB/F,KAAK+C,QACL,IAGI4B,EAAG/C,EAHHoE,EAA0B,OAAXlG,EACfmG,EAAM,IAAIJ,EAAUE,GAGpBG,EAAIlG,KAAK2D,QACb,GAAKqC,EAYE,CACL,IAAKpE,EAAI,GAAIsE,EAAEb,SAAUzD,IACvB+C,EAAIuB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETH,EAAIrE,GAAK+C,EAGX,KAAO/C,EAAImE,EAAWnE,IACpBqE,EAAIrE,GAAK,MArBM,CAEjB,IAAKA,EAAI,EAAGA,EAAImE,EAAYD,EAAYlE,IACtCqE,EAAIrE,GAAK,EAGX,IAAKA,EAAI,GAAIsE,EAAEb,SAAUzD,IACvB+C,EAAIuB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETH,EAAIF,EAAYnE,EAAI,GAAK+C,EAe7B,OAAOsB,GAGLvE,KAAK2E,MACP1G,EAAGF,UAAU6G,WAAa,SAAqBzD,GAC7C,OAAO,GAAKnB,KAAK2E,MAAMxD,IAGzBlD,EAAGF,UAAU6G,WAAa,SAAqBzD,GAC7C,IAAI0D,EAAI1D,EACJ1B,EAAI,EAiBR,OAhBIoF,GAAK,OACPpF,GAAK,GACLoF,KAAO,IAELA,GAAK,KACPpF,GAAK,EACLoF,KAAO,GAELA,GAAK,IACPpF,GAAK,EACLoF,KAAO,GAELA,GAAK,IACPpF,GAAK,EACLoF,KAAO,GAEFpF,EAAIoF,GAIf5G,EAAGF,UAAU+G,UAAY,SAAoB3D,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAI0D,EAAI1D,EACJ1B,EAAI,EAoBR,OAnBqB,KAAZ,KAAJoF,KACHpF,GAAK,GACLoF,KAAO,IAEU,KAAV,IAAJA,KACHpF,GAAK,EACLoF,KAAO,GAES,KAAT,GAAJA,KACHpF,GAAK,EACLoF,KAAO,GAES,KAAT,EAAJA,KACHpF,GAAK,EACLoF,KAAO,GAES,KAAT,EAAJA,IACHpF,IAEKA,GAITxB,EAAGF,UAAU2E,UAAY,WACvB,IAAIvB,EAAI7C,KAAKE,MAAMF,KAAKG,OAAS,GAC7BsG,EAAKzG,KAAKsG,WAAWzD,GACzB,OAA2B,IAAnB7C,KAAKG,OAAS,GAAUsG,GAiBlC9G,EAAGF,UAAUiH,SAAW,WACtB,GAAI1G,KAAKqF,SAAU,OAAO,EAG1B,IADA,IAAIlE,EAAI,EACCS,EAAI,EAAGA,EAAI5B,KAAKG,OAAQyB,IAAK,CACpC,IAAI+C,EAAI3E,KAAKwG,UAAUxG,KAAKE,MAAM0B,IAElC,GADAT,GAAKwD,EACK,KAANA,EAAU,MAEhB,OAAOxD,GAGTxB,EAAGF,UAAUqG,WAAa,WACxB,OAAOpE,KAAKiB,KAAK3C,KAAKoE,YAAc,IAGtCzE,EAAGF,UAAUkH,OAAS,SAAiBC,GACrC,OAAsB,IAAlB5G,KAAKC,SACAD,KAAK6G,MAAMC,MAAMF,GAAOG,MAAM,GAEhC/G,KAAK2D,SAGdhE,EAAGF,UAAUuH,SAAW,SAAmBJ,GACzC,OAAI5G,KAAKiH,MAAML,EAAQ,GACd5G,KAAKkH,KAAKN,GAAOG,MAAM,GAAGI,OAE5BnH,KAAK2D,SAGdhE,EAAGF,UAAU2H,MAAQ,WACnB,OAAyB,IAAlBpH,KAAKC,UAIdN,EAAGF,UAAU4H,IAAM,WACjB,OAAOrH,KAAK2D,QAAQwD,QAGtBxH,EAAGF,UAAU0H,KAAO,WAKlB,OAJKnH,KAAKqF,WACRrF,KAAKC,UAAY,GAGZD,MAITL,EAAGF,UAAU6H,KAAO,SAAezF,GACjC,MAAO7B,KAAKG,OAAS0B,EAAI1B,OACvBH,KAAKE,MAAMF,KAAKG,UAAY,EAG9B,IAAK,IAAIyB,EAAI,EAAGA,EAAIC,EAAI1B,OAAQyB,IAC9B5B,KAAKE,MAAM0B,GAAK5B,KAAKE,MAAM0B,GAAKC,EAAI3B,MAAM0B,GAG5C,OAAO5B,KAAK+C,SAGdpD,EAAGF,UAAU8H,IAAM,SAAc1F,GAE/B,OADA7C,EAA0C,KAAlCgB,KAAKC,SAAW4B,EAAI5B,WACrBD,KAAKsH,KAAKzF,IAInBlC,EAAGF,UAAU+H,GAAK,SAAa3F,GAC7B,OAAI7B,KAAKG,OAAS0B,EAAI1B,OAAeH,KAAK2D,QAAQ4D,IAAI1F,GAC/CA,EAAI8B,QAAQ4D,IAAIvH,OAGzBL,EAAGF,UAAUgI,IAAM,SAAc5F,GAC/B,OAAI7B,KAAKG,OAAS0B,EAAI1B,OAAeH,KAAK2D,QAAQ2D,KAAKzF,GAChDA,EAAI8B,QAAQ2D,KAAKtH,OAI1BL,EAAGF,UAAUiI,MAAQ,SAAgB7F,GAEnC,IAAI8C,EAEFA,EADE3E,KAAKG,OAAS0B,EAAI1B,OAChB0B,EAEA7B,KAGN,IAAK,IAAI4B,EAAI,EAAGA,EAAI+C,EAAExE,OAAQyB,IAC5B5B,KAAKE,MAAM0B,GAAK5B,KAAKE,MAAM0B,GAAKC,EAAI3B,MAAM0B,GAK5C,OAFA5B,KAAKG,OAASwE,EAAExE,OAETH,KAAK+C,SAGdpD,EAAGF,UAAUkI,KAAO,SAAe9F,GAEjC,OADA7C,EAA0C,KAAlCgB,KAAKC,SAAW4B,EAAI5B,WACrBD,KAAK0H,MAAM7F,IAIpBlC,EAAGF,UAAUmI,IAAM,SAAc/F,GAC/B,OAAI7B,KAAKG,OAAS0B,EAAI1B,OAAeH,KAAK2D,QAAQgE,KAAK9F,GAChDA,EAAI8B,QAAQgE,KAAK3H,OAG1BL,EAAGF,UAAUoI,KAAO,SAAehG,GACjC,OAAI7B,KAAKG,OAAS0B,EAAI1B,OAAeH,KAAK2D,QAAQ+D,MAAM7F,GACjDA,EAAI8B,QAAQ+D,MAAM1H,OAI3BL,EAAGF,UAAUqI,MAAQ,SAAgBjG,GAEnC,IAAI6C,EACAC,EACA3E,KAAKG,OAAS0B,EAAI1B,QACpBuE,EAAI1E,KACJ2E,EAAI9C,IAEJ6C,EAAI7C,EACJ8C,EAAI3E,MAGN,IAAK,IAAI4B,EAAI,EAAGA,EAAI+C,EAAExE,OAAQyB,IAC5B5B,KAAKE,MAAM0B,GAAK8C,EAAExE,MAAM0B,GAAK+C,EAAEzE,MAAM0B,GAGvC,GAAI5B,OAAS0E,EACX,KAAO9C,EAAI8C,EAAEvE,OAAQyB,IACnB5B,KAAKE,MAAM0B,GAAK8C,EAAExE,MAAM0B,GAM5B,OAFA5B,KAAKG,OAASuE,EAAEvE,OAETH,KAAK+C,SAGdpD,EAAGF,UAAUsI,KAAO,SAAelG,GAEjC,OADA7C,EAA0C,KAAlCgB,KAAKC,SAAW4B,EAAI5B,WACrBD,KAAK8H,MAAMjG,IAIpBlC,EAAGF,UAAUuI,IAAM,SAAcnG,GAC/B,OAAI7B,KAAKG,OAAS0B,EAAI1B,OAAeH,KAAK2D,QAAQoE,KAAKlG,GAChDA,EAAI8B,QAAQoE,KAAK/H,OAG1BL,EAAGF,UAAUwI,KAAO,SAAepG,GACjC,OAAI7B,KAAKG,OAAS0B,EAAI1B,OAAeH,KAAK2D,QAAQmE,MAAMjG,GACjDA,EAAI8B,QAAQmE,MAAM9H,OAI3BL,EAAGF,UAAUqH,MAAQ,SAAgBF,GACnC5H,EAAwB,kBAAV4H,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxBxG,KAAKiB,KAAKiE,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvB5G,KAAK4D,QAAQsE,GAETC,EAAW,GACbD,IAIF,IAAK,IAAItG,EAAI,EAAGA,EAAIsG,EAAatG,IAC/B5B,KAAKE,MAAM0B,GAAsB,UAAhB5B,KAAKE,MAAM0B,GAS9B,OALIuG,EAAW,IACbnI,KAAKE,MAAM0B,IAAM5B,KAAKE,MAAM0B,GAAM,UAAc,GAAKuG,GAIhDnI,KAAK+C,SAGdpD,EAAGF,UAAUyH,KAAO,SAAeN,GACjC,OAAO5G,KAAK2D,QAAQmD,MAAMF,IAI5BjH,EAAGF,UAAU2I,KAAO,SAAe/D,EAAKpF,GACtCD,EAAsB,kBAARqF,GAAoBA,GAAO,GAEzC,IAAIvB,EAAOuB,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARArE,KAAK4D,QAAQd,EAAM,GAGjB9C,KAAKE,MAAM4C,GADT7D,EACgBe,KAAKE,MAAM4C,GAAQ,GAAKwB,EAExBtE,KAAKE,MAAM4C,KAAS,GAAKwB,GAGtCtE,KAAK+C,SAIdpD,EAAGF,UAAU4I,KAAO,SAAexG,GACjC,IAAIV,EAkBAuD,EAAGC,EAfP,GAAsB,IAAlB3E,KAAKC,UAAmC,IAAjB4B,EAAI5B,SAI7B,OAHAD,KAAKC,SAAW,EAChBkB,EAAInB,KAAKsI,KAAKzG,GACd7B,KAAKC,UAAY,EACVD,KAAK8D,YAGP,GAAsB,IAAlB9D,KAAKC,UAAmC,IAAjB4B,EAAI5B,SAIpC,OAHA4B,EAAI5B,SAAW,EACfkB,EAAInB,KAAKsI,KAAKzG,GACdA,EAAI5B,SAAW,EACRkB,EAAE2C,YAKP9D,KAAKG,OAAS0B,EAAI1B,QACpBuE,EAAI1E,KACJ2E,EAAI9C,IAEJ6C,EAAI7C,EACJ8C,EAAI3E,MAIN,IADA,IAAI6E,EAAQ,EACHjD,EAAI,EAAGA,EAAI+C,EAAExE,OAAQyB,IAC5BT,GAAkB,EAAbuD,EAAExE,MAAM0B,KAAwB,EAAb+C,EAAEzE,MAAM0B,IAAUiD,EAC1C7E,KAAKE,MAAM0B,GAAS,SAAJT,EAChB0D,EAAQ1D,IAAM,GAEhB,KAAiB,IAAV0D,GAAejD,EAAI8C,EAAEvE,OAAQyB,IAClCT,GAAkB,EAAbuD,EAAExE,MAAM0B,IAAUiD,EACvB7E,KAAKE,MAAM0B,GAAS,SAAJT,EAChB0D,EAAQ1D,IAAM,GAIhB,GADAnB,KAAKG,OAASuE,EAAEvE,OACF,IAAV0E,EACF7E,KAAKE,MAAMF,KAAKG,QAAU0E,EAC1B7E,KAAKG,cAEA,GAAIuE,IAAM1E,KACf,KAAO4B,EAAI8C,EAAEvE,OAAQyB,IACnB5B,KAAKE,MAAM0B,GAAK8C,EAAExE,MAAM0B,GAI5B,OAAO5B,MAITL,EAAGF,UAAU8I,IAAM,SAAc1G,GAC/B,IAAIoE,EACJ,OAAqB,IAAjBpE,EAAI5B,UAAoC,IAAlBD,KAAKC,UAC7B4B,EAAI5B,SAAW,EACfgG,EAAMjG,KAAKwI,IAAI3G,GACfA,EAAI5B,UAAY,EACTgG,GACmB,IAAjBpE,EAAI5B,UAAoC,IAAlBD,KAAKC,UACpCD,KAAKC,SAAW,EAChBgG,EAAMpE,EAAI2G,IAAIxI,MACdA,KAAKC,SAAW,EACTgG,GAGLjG,KAAKG,OAAS0B,EAAI1B,OAAeH,KAAK2D,QAAQ0E,KAAKxG,GAEhDA,EAAI8B,QAAQ0E,KAAKrI,OAI1BL,EAAGF,UAAU6I,KAAO,SAAezG,GAEjC,GAAqB,IAAjBA,EAAI5B,SAAgB,CACtB4B,EAAI5B,SAAW,EACf,IAAIkB,EAAInB,KAAKqI,KAAKxG,GAElB,OADAA,EAAI5B,SAAW,EACRkB,EAAE2C,YAGJ,GAAsB,IAAlB9D,KAAKC,SAId,OAHAD,KAAKC,SAAW,EAChBD,KAAKqI,KAAKxG,GACV7B,KAAKC,SAAW,EACTD,KAAK8D,YAId,IAWIY,EAAGC,EAXHxC,EAAMnC,KAAKmC,IAAIN,GAGnB,GAAY,IAARM,EAIF,OAHAnC,KAAKC,SAAW,EAChBD,KAAKG,OAAS,EACdH,KAAKE,MAAM,GAAK,EACTF,KAKLmC,EAAM,GACRuC,EAAI1E,KACJ2E,EAAI9C,IAEJ6C,EAAI7C,EACJ8C,EAAI3E,MAIN,IADA,IAAI6E,EAAQ,EACHjD,EAAI,EAAGA,EAAI+C,EAAExE,OAAQyB,IAC5BT,GAAkB,EAAbuD,EAAExE,MAAM0B,KAAwB,EAAb+C,EAAEzE,MAAM0B,IAAUiD,EAC1CA,EAAQ1D,GAAK,GACbnB,KAAKE,MAAM0B,GAAS,SAAJT,EAElB,KAAiB,IAAV0D,GAAejD,EAAI8C,EAAEvE,OAAQyB,IAClCT,GAAkB,EAAbuD,EAAExE,MAAM0B,IAAUiD,EACvBA,EAAQ1D,GAAK,GACbnB,KAAKE,MAAM0B,GAAS,SAAJT,EAIlB,GAAc,IAAV0D,GAAejD,EAAI8C,EAAEvE,QAAUuE,IAAM1E,KACvC,KAAO4B,EAAI8C,EAAEvE,OAAQyB,IACnB5B,KAAKE,MAAM0B,GAAK8C,EAAExE,MAAM0B,GAU5B,OANA5B,KAAKG,OAASuB,KAAKM,IAAIhC,KAAKG,OAAQyB,GAEhC8C,IAAM1E,OACRA,KAAKC,SAAW,GAGXD,KAAK+C,SAIdpD,EAAGF,UAAU+I,IAAM,SAAc3G,GAC/B,OAAO7B,KAAK2D,QAAQ2E,KAAKzG,IA+C3B,IAAI4G,EAAc,SAAsBjE,EAAM3C,EAAK4C,GACjD,IAIIG,EACA8D,EACAjC,EANA/B,EAAIF,EAAKtE,MACTyE,EAAI9C,EAAI3B,MACRyI,EAAIlE,EAAIvE,MACRa,EAAI,EAIJ6H,EAAY,EAAPlE,EAAE,GACPmE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrE,EAAE,GACPsE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxE,EAAE,GACPyE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3E,EAAE,GACP4E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9E,EAAE,GACP+E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPjF,EAAE,GACPkF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPpF,EAAE,GACPqF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPvF,EAAE,GACPwF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP1F,EAAE,GACP2F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7F,EAAE,GACP8F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/F,EAAE,GACPgG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlG,EAAE,GACPmG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrG,EAAE,GACPsG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxG,EAAE,GACPyG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3G,EAAE,GACP4G,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAP9G,EAAE,GACP+G,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPjH,EAAE,GACPkH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPpH,EAAE,GACPqH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPvH,EAAE,GACPwH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP1H,EAAE,GACP2H,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjB5H,EAAIxE,SAAWuE,EAAKvE,SAAW4B,EAAI5B,SACnCwE,EAAItE,OAAS,GAEbyE,EAAKlD,KAAK8K,KAAK3D,EAAK8B,GACpBjC,EAAMhH,KAAK8K,KAAK3D,EAAK+B,GACrBlC,EAAOA,EAAMhH,KAAK8K,KAAK1D,EAAK6B,GAAQ,EACpClE,EAAK/E,KAAK8K,KAAK1D,EAAK8B,GACpB,IAAI6B,IAAQ1L,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAM+D,KAAO,IAAO,EAChDA,IAAM,SAEN7H,EAAKlD,KAAK8K,KAAKxD,EAAK2B,GACpBjC,EAAMhH,KAAK8K,KAAKxD,EAAK4B,GACrBlC,EAAOA,EAAMhH,KAAK8K,KAAKvD,EAAK0B,GAAQ,EACpClE,EAAK/E,KAAK8K,KAAKvD,EAAK2B,GACpBhG,EAAMA,EAAKlD,KAAK8K,KAAK3D,EAAKiC,GAAQ,EAClCpC,EAAOA,EAAMhH,KAAK8K,KAAK3D,EAAKkC,GAAQ,EACpCrC,EAAOA,EAAMhH,KAAK8K,KAAK1D,EAAKgC,GAAQ,EACpCrE,EAAMA,EAAK/E,KAAK8K,KAAK1D,EAAKiC,GAAQ,EAClC,IAAI2B,IAAQ3L,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAEN9H,EAAKlD,KAAK8K,KAAKrD,EAAKwB,GACpBjC,EAAMhH,KAAK8K,KAAKrD,EAAKyB,GACrBlC,EAAOA,EAAMhH,KAAK8K,KAAKpD,EAAKuB,GAAQ,EACpClE,EAAK/E,KAAK8K,KAAKpD,EAAKwB,GACpBhG,EAAMA,EAAKlD,KAAK8K,KAAKxD,EAAK8B,GAAQ,EAClCpC,EAAOA,EAAMhH,KAAK8K,KAAKxD,EAAK+B,GAAQ,EACpCrC,EAAOA,EAAMhH,KAAK8K,KAAKvD,EAAK6B,GAAQ,EACpCrE,EAAMA,EAAK/E,KAAK8K,KAAKvD,EAAK8B,GAAQ,EAClCnG,EAAMA,EAAKlD,KAAK8K,KAAK3D,EAAKoC,GAAQ,EAClCvC,EAAOA,EAAMhH,KAAK8K,KAAK3D,EAAKqC,GAAQ,EACpCxC,EAAOA,EAAMhH,KAAK8K,KAAK1D,EAAKmC,GAAQ,EACpCxE,EAAMA,EAAK/E,KAAK8K,KAAK1D,EAAKoC,GAAQ,EAClC,IAAIyB,IAAQ5L,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAKlD,KAAK8K,KAAKlD,EAAKqB,GACpBjC,EAAMhH,KAAK8K,KAAKlD,EAAKsB,GACrBlC,EAAOA,EAAMhH,KAAK8K,KAAKjD,EAAKoB,GAAQ,EACpClE,EAAK/E,KAAK8K,KAAKjD,EAAKqB,GACpBhG,EAAMA,EAAKlD,KAAK8K,KAAKrD,EAAK2B,GAAQ,EAClCpC,EAAOA,EAAMhH,KAAK8K,KAAKrD,EAAK4B,GAAQ,EACpCrC,EAAOA,EAAMhH,KAAK8K,KAAKpD,EAAK0B,GAAQ,EACpCrE,EAAMA,EAAK/E,KAAK8K,KAAKpD,EAAK2B,GAAQ,EAClCnG,EAAMA,EAAKlD,KAAK8K,KAAKxD,EAAKiC,GAAQ,EAClCvC,EAAOA,EAAMhH,KAAK8K,KAAKxD,EAAKkC,GAAQ,EACpCxC,EAAOA,EAAMhH,KAAK8K,KAAKvD,EAAKgC,GAAQ,EACpCxE,EAAMA,EAAK/E,KAAK8K,KAAKvD,EAAKiC,GAAQ,EAClCtG,EAAMA,EAAKlD,KAAK8K,KAAK3D,EAAKuC,GAAQ,EAClC1C,EAAOA,EAAMhH,KAAK8K,KAAK3D,EAAKwC,GAAQ,EACpC3C,EAAOA,EAAMhH,KAAK8K,KAAK1D,EAAKsC,GAAQ,EACpC3E,EAAMA,EAAK/E,KAAK8K,KAAK1D,EAAKuC,GAAQ,EAClC,IAAIuB,IAAQ7L,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENhI,EAAKlD,KAAK8K,KAAK/C,EAAKkB,GACpBjC,EAAMhH,KAAK8K,KAAK/C,EAAKmB,GACrBlC,EAAOA,EAAMhH,KAAK8K,KAAK9C,EAAKiB,GAAQ,EACpClE,EAAK/E,KAAK8K,KAAK9C,EAAKkB,GACpBhG,EAAMA,EAAKlD,KAAK8K,KAAKlD,EAAKwB,GAAQ,EAClCpC,EAAOA,EAAMhH,KAAK8K,KAAKlD,EAAKyB,GAAQ,EACpCrC,EAAOA,EAAMhH,KAAK8K,KAAKjD,EAAKuB,GAAQ,EACpCrE,EAAMA,EAAK/E,KAAK8K,KAAKjD,EAAKwB,GAAQ,EAClCnG,EAAMA,EAAKlD,KAAK8K,KAAKrD,EAAK8B,GAAQ,EAClCvC,EAAOA,EAAMhH,KAAK8K,KAAKrD,EAAK+B,GAAQ,EACpCxC,EAAOA,EAAMhH,KAAK8K,KAAKpD,EAAK6B,GAAQ,EACpCxE,EAAMA,EAAK/E,KAAK8K,KAAKpD,EAAK8B,GAAQ,EAClCtG,EAAMA,EAAKlD,KAAK8K,KAAKxD,EAAKoC,GAAQ,EAClC1C,EAAOA,EAAMhH,KAAK8K,KAAKxD,EAAKqC,GAAQ,EACpC3C,EAAOA,EAAMhH,KAAK8K,KAAKvD,EAAKmC,GAAQ,EACpC3E,EAAMA,EAAK/E,KAAK8K,KAAKvD,EAAKoC,GAAQ,EAClCzG,EAAMA,EAAKlD,KAAK8K,KAAK3D,EAAK0C,GAAQ,EAClC7C,EAAOA,EAAMhH,KAAK8K,KAAK3D,EAAK2C,IAAQ,EACpC9C,EAAOA,EAAMhH,KAAK8K,KAAK1D,EAAKyC,GAAQ,EACpC9E,EAAMA,EAAK/E,KAAK8K,KAAK1D,EAAK0C,IAAQ,EAClC,IAAIqB,IAAQ9L,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAKlD,KAAK8K,KAAK5C,EAAKe,GACpBjC,EAAMhH,KAAK8K,KAAK5C,EAAKgB,GACrBlC,EAAOA,EAAMhH,KAAK8K,KAAK3C,EAAKc,GAAQ,EACpClE,EAAK/E,KAAK8K,KAAK3C,EAAKe,GACpBhG,EAAMA,EAAKlD,KAAK8K,KAAK/C,EAAKqB,GAAQ,EAClCpC,EAAOA,EAAMhH,KAAK8K,KAAK/C,EAAKsB,GAAQ,EACpCrC,EAAOA,EAAMhH,KAAK8K,KAAK9C,EAAKoB,GAAQ,EACpCrE,EAAMA,EAAK/E,KAAK8K,KAAK9C,EAAKqB,GAAQ,EAClCnG,EAAMA,EAAKlD,KAAK8K,KAAKlD,EAAK2B,GAAQ,EAClCvC,EAAOA,EAAMhH,KAAK8K,KAAKlD,EAAK4B,GAAQ,EACpCxC,EAAOA,EAAMhH,KAAK8K,KAAKjD,EAAK0B,GAAQ,EACpCxE,EAAMA,EAAK/E,KAAK8K,KAAKjD,EAAK2B,GAAQ,EAClCtG,EAAMA,EAAKlD,KAAK8K,KAAKrD,EAAKiC,GAAQ,EAClC1C,EAAOA,EAAMhH,KAAK8K,KAAKrD,EAAKkC,GAAQ,EACpC3C,EAAOA,EAAMhH,KAAK8K,KAAKpD,EAAKgC,GAAQ,EACpC3E,EAAMA,EAAK/E,KAAK8K,KAAKpD,EAAKiC,GAAQ,EAClCzG,EAAMA,EAAKlD,KAAK8K,KAAKxD,EAAKuC,GAAQ,EAClC7C,EAAOA,EAAMhH,KAAK8K,KAAKxD,EAAKwC,IAAQ,EACpC9C,EAAOA,EAAMhH,KAAK8K,KAAKvD,EAAKsC,GAAQ,EACpC9E,EAAMA,EAAK/E,KAAK8K,KAAKvD,EAAKuC,IAAQ,EAClC5G,EAAMA,EAAKlD,KAAK8K,KAAK3D,EAAK6C,IAAQ,EAClChD,EAAOA,EAAMhH,KAAK8K,KAAK3D,EAAK8C,IAAQ,EACpCjD,EAAOA,EAAMhH,KAAK8K,KAAK1D,EAAK4C,IAAQ,EACpCjF,EAAMA,EAAK/E,KAAK8K,KAAK1D,EAAK6C,IAAQ,EAClC,IAAImB,IAAQ/L,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAKlD,KAAK8K,KAAKzC,EAAKY,GACpBjC,EAAMhH,KAAK8K,KAAKzC,EAAKa,GACrBlC,EAAOA,EAAMhH,KAAK8K,KAAKxC,EAAKW,GAAQ,EACpClE,EAAK/E,KAAK8K,KAAKxC,EAAKY,GACpBhG,EAAMA,EAAKlD,KAAK8K,KAAK5C,EAAKkB,GAAQ,EAClCpC,EAAOA,EAAMhH,KAAK8K,KAAK5C,EAAKmB,GAAQ,EACpCrC,EAAOA,EAAMhH,KAAK8K,KAAK3C,EAAKiB,GAAQ,EACpCrE,EAAMA,EAAK/E,KAAK8K,KAAK3C,EAAKkB,GAAQ,EAClCnG,EAAMA,EAAKlD,KAAK8K,KAAK/C,EAAKwB,GAAQ,EAClCvC,EAAOA,EAAMhH,KAAK8K,KAAK/C,EAAKyB,GAAQ,EACpCxC,EAAOA,EAAMhH,KAAK8K,KAAK9C,EAAKuB,GAAQ,EACpCxE,EAAMA,EAAK/E,KAAK8K,KAAK9C,EAAKwB,GAAQ,EAClCtG,EAAMA,EAAKlD,KAAK8K,KAAKlD,EAAK8B,GAAQ,EAClC1C,EAAOA,EAAMhH,KAAK8K,KAAKlD,EAAK+B,GAAQ,EACpC3C,EAAOA,EAAMhH,KAAK8K,KAAKjD,EAAK6B,GAAQ,EACpC3E,EAAMA,EAAK/E,KAAK8K,KAAKjD,EAAK8B,GAAQ,EAClCzG,EAAMA,EAAKlD,KAAK8K,KAAKrD,EAAKoC,GAAQ,EAClC7C,EAAOA,EAAMhH,KAAK8K,KAAKrD,EAAKqC,IAAQ,EACpC9C,EAAOA,EAAMhH,KAAK8K,KAAKpD,EAAKmC,GAAQ,EACpC9E,EAAMA,EAAK/E,KAAK8K,KAAKpD,EAAKoC,IAAQ,EAClC5G,EAAMA,EAAKlD,KAAK8K,KAAKxD,EAAK0C,IAAQ,EAClChD,EAAOA,EAAMhH,KAAK8K,KAAKxD,EAAK2C,IAAQ,EACpCjD,EAAOA,EAAMhH,KAAK8K,KAAKvD,EAAKyC,IAAQ,EACpCjF,EAAMA,EAAK/E,KAAK8K,KAAKvD,EAAK0C,IAAQ,EAClC/G,EAAMA,EAAKlD,KAAK8K,KAAK3D,EAAKgD,IAAQ,EAClCnD,EAAOA,EAAMhH,KAAK8K,KAAK3D,EAAKiD,IAAQ,EACpCpD,EAAOA,EAAMhH,KAAK8K,KAAK1D,EAAK+C,IAAQ,EACpCpF,EAAMA,EAAK/E,KAAK8K,KAAK1D,EAAKgD,IAAQ,EAClC,IAAIiB,IAAQhM,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAKlD,KAAK8K,KAAKtC,EAAKS,GACpBjC,EAAMhH,KAAK8K,KAAKtC,EAAKU,GACrBlC,EAAOA,EAAMhH,KAAK8K,KAAKrC,EAAKQ,GAAQ,EACpClE,EAAK/E,KAAK8K,KAAKrC,EAAKS,GACpBhG,EAAMA,EAAKlD,KAAK8K,KAAKzC,EAAKe,GAAQ,EAClCpC,EAAOA,EAAMhH,KAAK8K,KAAKzC,EAAKgB,GAAQ,EACpCrC,EAAOA,EAAMhH,KAAK8K,KAAKxC,EAAKc,GAAQ,EACpCrE,EAAMA,EAAK/E,KAAK8K,KAAKxC,EAAKe,GAAQ,EAClCnG,EAAMA,EAAKlD,KAAK8K,KAAK5C,EAAKqB,GAAQ,EAClCvC,EAAOA,EAAMhH,KAAK8K,KAAK5C,EAAKsB,GAAQ,EACpCxC,EAAOA,EAAMhH,KAAK8K,KAAK3C,EAAKoB,GAAQ,EACpCxE,EAAMA,EAAK/E,KAAK8K,KAAK3C,EAAKqB,GAAQ,EAClCtG,EAAMA,EAAKlD,KAAK8K,KAAK/C,EAAK2B,GAAQ,EAClC1C,EAAOA,EAAMhH,KAAK8K,KAAK/C,EAAK4B,GAAQ,EACpC3C,EAAOA,EAAMhH,KAAK8K,KAAK9C,EAAK0B,GAAQ,EACpC3E,EAAMA,EAAK/E,KAAK8K,KAAK9C,EAAK2B,GAAQ,EAClCzG,EAAMA,EAAKlD,KAAK8K,KAAKlD,EAAKiC,GAAQ,EAClC7C,EAAOA,EAAMhH,KAAK8K,KAAKlD,EAAKkC,IAAQ,EACpC9C,EAAOA,EAAMhH,KAAK8K,KAAKjD,EAAKgC,GAAQ,EACpC9E,EAAMA,EAAK/E,KAAK8K,KAAKjD,EAAKiC,IAAQ,EAClC5G,EAAMA,EAAKlD,KAAK8K,KAAKrD,EAAKuC,IAAQ,EAClChD,EAAOA,EAAMhH,KAAK8K,KAAKrD,EAAKwC,IAAQ,EACpCjD,EAAOA,EAAMhH,KAAK8K,KAAKpD,EAAKsC,IAAQ,EACpCjF,EAAMA,EAAK/E,KAAK8K,KAAKpD,EAAKuC,IAAQ,EAClC/G,EAAMA,EAAKlD,KAAK8K,KAAKxD,EAAK6C,IAAQ,EAClCnD,EAAOA,EAAMhH,KAAK8K,KAAKxD,EAAK8C,IAAQ,EACpCpD,EAAOA,EAAMhH,KAAK8K,KAAKvD,EAAK4C,IAAQ,EACpCpF,EAAMA,EAAK/E,KAAK8K,KAAKvD,EAAK6C,IAAQ,EAClClH,EAAMA,EAAKlD,KAAK8K,KAAK3D,EAAKmD,IAAQ,EAClCtD,EAAOA,EAAMhH,KAAK8K,KAAK3D,EAAKoD,IAAQ,EACpCvD,EAAOA,EAAMhH,KAAK8K,KAAK1D,EAAKkD,IAAQ,EACpCvF,EAAMA,EAAK/E,KAAK8K,KAAK1D,EAAKmD,IAAQ,EAClC,IAAIe,IAAQjM,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENpI,EAAKlD,KAAK8K,KAAKnC,EAAKM,GACpBjC,EAAMhH,KAAK8K,KAAKnC,EAAKO,GACrBlC,EAAOA,EAAMhH,KAAK8K,KAAKlC,EAAKK,GAAQ,EACpClE,EAAK/E,KAAK8K,KAAKlC,EAAKM,GACpBhG,EAAMA,EAAKlD,KAAK8K,KAAKtC,EAAKY,GAAQ,EAClCpC,EAAOA,EAAMhH,KAAK8K,KAAKtC,EAAKa,GAAQ,EACpCrC,EAAOA,EAAMhH,KAAK8K,KAAKrC,EAAKW,GAAQ,EACpCrE,EAAMA,EAAK/E,KAAK8K,KAAKrC,EAAKY,GAAQ,EAClCnG,EAAMA,EAAKlD,KAAK8K,KAAKzC,EAAKkB,GAAQ,EAClCvC,EAAOA,EAAMhH,KAAK8K,KAAKzC,EAAKmB,GAAQ,EACpCxC,EAAOA,EAAMhH,KAAK8K,KAAKxC,EAAKiB,GAAQ,EACpCxE,EAAMA,EAAK/E,KAAK8K,KAAKxC,EAAKkB,GAAQ,EAClCtG,EAAMA,EAAKlD,KAAK8K,KAAK5C,EAAKwB,GAAQ,EAClC1C,EAAOA,EAAMhH,KAAK8K,KAAK5C,EAAKyB,GAAQ,EACpC3C,EAAOA,EAAMhH,KAAK8K,KAAK3C,EAAKuB,GAAQ,EACpC3E,EAAMA,EAAK/E,KAAK8K,KAAK3C,EAAKwB,GAAQ,EAClCzG,EAAMA,EAAKlD,KAAK8K,KAAK/C,EAAK8B,GAAQ,EAClC7C,EAAOA,EAAMhH,KAAK8K,KAAK/C,EAAK+B,IAAQ,EACpC9C,EAAOA,EAAMhH,KAAK8K,KAAK9C,EAAK6B,GAAQ,EACpC9E,EAAMA,EAAK/E,KAAK8K,KAAK9C,EAAK8B,IAAQ,EAClC5G,EAAMA,EAAKlD,KAAK8K,KAAKlD,EAAKoC,IAAQ,EAClChD,EAAOA,EAAMhH,KAAK8K,KAAKlD,EAAKqC,IAAQ,EACpCjD,EAAOA,EAAMhH,KAAK8K,KAAKjD,EAAKmC,IAAQ,EACpCjF,EAAMA,EAAK/E,KAAK8K,KAAKjD,EAAKoC,IAAQ,EAClC/G,EAAMA,EAAKlD,KAAK8K,KAAKrD,EAAK0C,IAAQ,EAClCnD,EAAOA,EAAMhH,KAAK8K,KAAKrD,EAAK2C,IAAQ,EACpCpD,EAAOA,EAAMhH,KAAK8K,KAAKpD,EAAKyC,IAAQ,EACpCpF,EAAMA,EAAK/E,KAAK8K,KAAKpD,EAAK0C,IAAQ,EAClClH,EAAMA,EAAKlD,KAAK8K,KAAKxD,EAAKgD,IAAQ,EAClCtD,EAAOA,EAAMhH,KAAK8K,KAAKxD,EAAKiD,IAAQ,EACpCvD,EAAOA,EAAMhH,KAAK8K,KAAKvD,EAAK+C,IAAQ,EACpCvF,EAAMA,EAAK/E,KAAK8K,KAAKvD,EAAKgD,IAAQ,EAClCrH,EAAMA,EAAKlD,KAAK8K,KAAK3D,EAAKsD,IAAQ,EAClCzD,EAAOA,EAAMhH,KAAK8K,KAAK3D,EAAKuD,IAAQ,EACpC1D,EAAOA,EAAMhH,KAAK8K,KAAK1D,EAAKqD,IAAQ,EACpC1F,EAAMA,EAAK/E,KAAK8K,KAAK1D,EAAKsD,IAAQ,EAClC,IAAIa,IAAQlM,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENrI,EAAKlD,KAAK8K,KAAKhC,EAAKG,GACpBjC,EAAMhH,KAAK8K,KAAKhC,EAAKI,GACrBlC,EAAOA,EAAMhH,KAAK8K,KAAK/B,EAAKE,GAAQ,EACpClE,EAAK/E,KAAK8K,KAAK/B,EAAKG,GACpBhG,EAAMA,EAAKlD,KAAK8K,KAAKnC,EAAKS,GAAQ,EAClCpC,EAAOA,EAAMhH,KAAK8K,KAAKnC,EAAKU,GAAQ,EACpCrC,EAAOA,EAAMhH,KAAK8K,KAAKlC,EAAKQ,GAAQ,EACpCrE,EAAMA,EAAK/E,KAAK8K,KAAKlC,EAAKS,GAAQ,EAClCnG,EAAMA,EAAKlD,KAAK8K,KAAKtC,EAAKe,GAAQ,EAClCvC,EAAOA,EAAMhH,KAAK8K,KAAKtC,EAAKgB,GAAQ,EACpCxC,EAAOA,EAAMhH,KAAK8K,KAAKrC,EAAKc,GAAQ,EACpCxE,EAAMA,EAAK/E,KAAK8K,KAAKrC,EAAKe,GAAQ,EAClCtG,EAAMA,EAAKlD,KAAK8K,KAAKzC,EAAKqB,GAAQ,EAClC1C,EAAOA,EAAMhH,KAAK8K,KAAKzC,EAAKsB,GAAQ,EACpC3C,EAAOA,EAAMhH,KAAK8K,KAAKxC,EAAKoB,GAAQ,EACpC3E,EAAMA,EAAK/E,KAAK8K,KAAKxC,EAAKqB,GAAQ,EAClCzG,EAAMA,EAAKlD,KAAK8K,KAAK5C,EAAK2B,GAAQ,EAClC7C,EAAOA,EAAMhH,KAAK8K,KAAK5C,EAAK4B,IAAQ,EACpC9C,EAAOA,EAAMhH,KAAK8K,KAAK3C,EAAK0B,GAAQ,EACpC9E,EAAMA,EAAK/E,KAAK8K,KAAK3C,EAAK2B,IAAQ,EAClC5G,EAAMA,EAAKlD,KAAK8K,KAAK/C,EAAKiC,IAAQ,EAClChD,EAAOA,EAAMhH,KAAK8K,KAAK/C,EAAKkC,IAAQ,EACpCjD,EAAOA,EAAMhH,KAAK8K,KAAK9C,EAAKgC,IAAQ,EACpCjF,EAAMA,EAAK/E,KAAK8K,KAAK9C,EAAKiC,IAAQ,EAClC/G,EAAMA,EAAKlD,KAAK8K,KAAKlD,EAAKuC,IAAQ,EAClCnD,EAAOA,EAAMhH,KAAK8K,KAAKlD,EAAKwC,IAAQ,EACpCpD,EAAOA,EAAMhH,KAAK8K,KAAKjD,EAAKsC,IAAQ,EACpCpF,EAAMA,EAAK/E,KAAK8K,KAAKjD,EAAKuC,IAAQ,EAClClH,EAAMA,EAAKlD,KAAK8K,KAAKrD,EAAK6C,IAAQ,EAClCtD,EAAOA,EAAMhH,KAAK8K,KAAKrD,EAAK8C,IAAQ,EACpCvD,EAAOA,EAAMhH,KAAK8K,KAAKpD,EAAK4C,IAAQ,EACpCvF,EAAMA,EAAK/E,KAAK8K,KAAKpD,EAAK6C,IAAQ,EAClCrH,EAAMA,EAAKlD,KAAK8K,KAAKxD,EAAKmD,IAAQ,EAClCzD,EAAOA,EAAMhH,KAAK8K,KAAKxD,EAAKoD,IAAQ,EACpC1D,EAAOA,EAAMhH,KAAK8K,KAAKvD,EAAKkD,IAAQ,EACpC1F,EAAMA,EAAK/E,KAAK8K,KAAKvD,EAAKmD,IAAQ,EAClCxH,EAAMA,EAAKlD,KAAK8K,KAAK3D,EAAKyD,IAAQ,EAClC5D,EAAOA,EAAMhH,KAAK8K,KAAK3D,EAAK0D,IAAQ,EACpC7D,EAAOA,EAAMhH,KAAK8K,KAAK1D,EAAKwD,IAAQ,EACpC7F,EAAMA,EAAK/E,KAAK8K,KAAK1D,EAAKyD,IAAQ,EAClC,IAAIW,IAAQnM,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACrD3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENtI,EAAKlD,KAAK8K,KAAKhC,EAAKM,GACpBpC,EAAMhH,KAAK8K,KAAKhC,EAAKO,GACrBrC,EAAOA,EAAMhH,KAAK8K,KAAK/B,EAAKK,GAAQ,EACpCrE,EAAK/E,KAAK8K,KAAK/B,EAAKM,GACpBnG,EAAMA,EAAKlD,KAAK8K,KAAKnC,EAAKY,GAAQ,EAClCvC,EAAOA,EAAMhH,KAAK8K,KAAKnC,EAAKa,GAAQ,EACpCxC,EAAOA,EAAMhH,KAAK8K,KAAKlC,EAAKW,GAAQ,EACpCxE,EAAMA,EAAK/E,KAAK8K,KAAKlC,EAAKY,GAAQ,EAClCtG,EAAMA,EAAKlD,KAAK8K,KAAKtC,EAAKkB,GAAQ,EAClC1C,EAAOA,EAAMhH,KAAK8K,KAAKtC,EAAKmB,GAAQ,EACpC3C,EAAOA,EAAMhH,KAAK8K,KAAKrC,EAAKiB,GAAQ,EACpC3E,EAAMA,EAAK/E,KAAK8K,KAAKrC,EAAKkB,GAAQ,EAClCzG,EAAMA,EAAKlD,KAAK8K,KAAKzC,EAAKwB,GAAQ,EAClC7C,EAAOA,EAAMhH,KAAK8K,KAAKzC,EAAKyB,IAAQ,EACpC9C,EAAOA,EAAMhH,KAAK8K,KAAKxC,EAAKuB,GAAQ,EACpC9E,EAAMA,EAAK/E,KAAK8K,KAAKxC,EAAKwB,IAAQ,EAClC5G,EAAMA,EAAKlD,KAAK8K,KAAK5C,EAAK8B,IAAQ,EAClChD,EAAOA,EAAMhH,KAAK8K,KAAK5C,EAAK+B,IAAQ,EACpCjD,EAAOA,EAAMhH,KAAK8K,KAAK3C,EAAK6B,IAAQ,EACpCjF,EAAMA,EAAK/E,KAAK8K,KAAK3C,EAAK8B,IAAQ,EAClC/G,EAAMA,EAAKlD,KAAK8K,KAAK/C,EAAKoC,IAAQ,EAClCnD,EAAOA,EAAMhH,KAAK8K,KAAK/C,EAAKqC,IAAQ,EACpCpD,EAAOA,EAAMhH,KAAK8K,KAAK9C,EAAKmC,IAAQ,EACpCpF,EAAMA,EAAK/E,KAAK8K,KAAK9C,EAAKoC,IAAQ,EAClClH,EAAMA,EAAKlD,KAAK8K,KAAKlD,EAAK0C,IAAQ,EAClCtD,EAAOA,EAAMhH,KAAK8K,KAAKlD,EAAK2C,IAAQ,EACpCvD,EAAOA,EAAMhH,KAAK8K,KAAKjD,EAAKyC,IAAQ,EACpCvF,EAAMA,EAAK/E,KAAK8K,KAAKjD,EAAK0C,IAAQ,EAClCrH,EAAMA,EAAKlD,KAAK8K,KAAKrD,EAAKgD,IAAQ,EAClCzD,EAAOA,EAAMhH,KAAK8K,KAAKrD,EAAKiD,IAAQ,EACpC1D,EAAOA,EAAMhH,KAAK8K,KAAKpD,EAAK+C,IAAQ,EACpC1F,EAAMA,EAAK/E,KAAK8K,KAAKpD,EAAKgD,IAAQ,EAClCxH,EAAMA,EAAKlD,KAAK8K,KAAKxD,EAAKsD,IAAQ,EAClC5D,EAAOA,EAAMhH,KAAK8K,KAAKxD,EAAKuD,IAAQ,EACpC7D,EAAOA,EAAMhH,KAAK8K,KAAKvD,EAAKqD,IAAQ,EACpC7F,EAAMA,EAAK/E,KAAK8K,KAAKvD,EAAKsD,IAAQ,EAClC,IAAIY,IAASpM,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACtD3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEPvI,EAAKlD,KAAK8K,KAAKhC,EAAKS,GACpBvC,EAAMhH,KAAK8K,KAAKhC,EAAKU,GACrBxC,EAAOA,EAAMhH,KAAK8K,KAAK/B,EAAKQ,GAAQ,EACpCxE,EAAK/E,KAAK8K,KAAK/B,EAAKS,GACpBtG,EAAMA,EAAKlD,KAAK8K,KAAKnC,EAAKe,GAAQ,EAClC1C,EAAOA,EAAMhH,KAAK8K,KAAKnC,EAAKgB,GAAQ,EACpC3C,EAAOA,EAAMhH,KAAK8K,KAAKlC,EAAKc,GAAQ,EACpC3E,EAAMA,EAAK/E,KAAK8K,KAAKlC,EAAKe,GAAQ,EAClCzG,EAAMA,EAAKlD,KAAK8K,KAAKtC,EAAKqB,GAAQ,EAClC7C,EAAOA,EAAMhH,KAAK8K,KAAKtC,EAAKsB,IAAQ,EACpC9C,EAAOA,EAAMhH,KAAK8K,KAAKrC,EAAKoB,GAAQ,EACpC9E,EAAMA,EAAK/E,KAAK8K,KAAKrC,EAAKqB,IAAQ,EAClC5G,EAAMA,EAAKlD,KAAK8K,KAAKzC,EAAK2B,IAAQ,EAClChD,EAAOA,EAAMhH,KAAK8K,KAAKzC,EAAK4B,IAAQ,EACpCjD,EAAOA,EAAMhH,KAAK8K,KAAKxC,EAAK0B,IAAQ,EACpCjF,EAAMA,EAAK/E,KAAK8K,KAAKxC,EAAK2B,IAAQ,EAClC/G,EAAMA,EAAKlD,KAAK8K,KAAK5C,EAAKiC,IAAQ,EAClCnD,EAAOA,EAAMhH,KAAK8K,KAAK5C,EAAKkC,IAAQ,EACpCpD,EAAOA,EAAMhH,KAAK8K,KAAK3C,EAAKgC,IAAQ,EACpCpF,EAAMA,EAAK/E,KAAK8K,KAAK3C,EAAKiC,IAAQ,EAClClH,EAAMA,EAAKlD,KAAK8K,KAAK/C,EAAKuC,IAAQ,EAClCtD,EAAOA,EAAMhH,KAAK8K,KAAK/C,EAAKwC,IAAQ,EACpCvD,EAAOA,EAAMhH,KAAK8K,KAAK9C,EAAKsC,IAAQ,EACpCvF,EAAMA,EAAK/E,KAAK8K,KAAK9C,EAAKuC,IAAQ,EAClCrH,EAAMA,EAAKlD,KAAK8K,KAAKlD,EAAK6C,IAAQ,EAClCzD,EAAOA,EAAMhH,KAAK8K,KAAKlD,EAAK8C,IAAQ,EACpC1D,EAAOA,EAAMhH,KAAK8K,KAAKjD,EAAK4C,IAAQ,EACpC1F,EAAMA,EAAK/E,KAAK8K,KAAKjD,EAAK6C,IAAQ,EAClCxH,EAAMA,EAAKlD,KAAK8K,KAAKrD,EAAKmD,IAAQ,EAClC5D,EAAOA,EAAMhH,KAAK8K,KAAKrD,EAAKoD,IAAQ,EACpC7D,EAAOA,EAAMhH,KAAK8K,KAAKpD,EAAKkD,IAAQ,EACpC7F,EAAMA,EAAK/E,KAAK8K,KAAKpD,EAAKmD,IAAQ,EAClC,IAAIa,IAASrM,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACtD3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEPxI,EAAKlD,KAAK8K,KAAKhC,EAAKY,GACpB1C,EAAMhH,KAAK8K,KAAKhC,EAAKa,GACrB3C,EAAOA,EAAMhH,KAAK8K,KAAK/B,EAAKW,GAAQ,EACpC3E,EAAK/E,KAAK8K,KAAK/B,EAAKY,GACpBzG,EAAMA,EAAKlD,KAAK8K,KAAKnC,EAAKkB,GAAQ,EAClC7C,EAAOA,EAAMhH,KAAK8K,KAAKnC,EAAKmB,IAAQ,EACpC9C,EAAOA,EAAMhH,KAAK8K,KAAKlC,EAAKiB,GAAQ,EACpC9E,EAAMA,EAAK/E,KAAK8K,KAAKlC,EAAKkB,IAAQ,EAClC5G,EAAMA,EAAKlD,KAAK8K,KAAKtC,EAAKwB,IAAQ,EAClChD,EAAOA,EAAMhH,KAAK8K,KAAKtC,EAAKyB,IAAQ,EACpCjD,EAAOA,EAAMhH,KAAK8K,KAAKrC,EAAKuB,IAAQ,EACpCjF,EAAMA,EAAK/E,KAAK8K,KAAKrC,EAAKwB,IAAQ,EAClC/G,EAAMA,EAAKlD,KAAK8K,KAAKzC,EAAK8B,IAAQ,EAClCnD,EAAOA,EAAMhH,KAAK8K,KAAKzC,EAAK+B,IAAQ,EACpCpD,EAAOA,EAAMhH,KAAK8K,KAAKxC,EAAK6B,IAAQ,EACpCpF,EAAMA,EAAK/E,KAAK8K,KAAKxC,EAAK8B,IAAQ,EAClClH,EAAMA,EAAKlD,KAAK8K,KAAK5C,EAAKoC,IAAQ,EAClCtD,EAAOA,EAAMhH,KAAK8K,KAAK5C,EAAKqC,IAAQ,EACpCvD,EAAOA,EAAMhH,KAAK8K,KAAK3C,EAAKmC,IAAQ,EACpCvF,EAAMA,EAAK/E,KAAK8K,KAAK3C,EAAKoC,IAAQ,EAClCrH,EAAMA,EAAKlD,KAAK8K,KAAK/C,EAAK0C,IAAQ,EAClCzD,EAAOA,EAAMhH,KAAK8K,KAAK/C,EAAK2C,IAAQ,EACpC1D,EAAOA,EAAMhH,KAAK8K,KAAK9C,EAAKyC,IAAQ,EACpC1F,EAAMA,EAAK/E,KAAK8K,KAAK9C,EAAK0C,IAAQ,EAClCxH,EAAMA,EAAKlD,KAAK8K,KAAKlD,EAAKgD,IAAQ,EAClC5D,EAAOA,EAAMhH,KAAK8K,KAAKlD,EAAKiD,IAAQ,EACpC7D,EAAOA,EAAMhH,KAAK8K,KAAKjD,EAAK+C,IAAQ,EACpC7F,EAAMA,EAAK/E,KAAK8K,KAAKjD,EAAKgD,IAAQ,EAClC,IAAIc,IAAStM,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACtD3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEPzI,EAAKlD,KAAK8K,KAAKhC,EAAKe,GACpB7C,EAAMhH,KAAK8K,KAAKhC,EAAKgB,IACrB9C,EAAOA,EAAMhH,KAAK8K,KAAK/B,EAAKc,GAAQ,EACpC9E,EAAK/E,KAAK8K,KAAK/B,EAAKe,IACpB5G,EAAMA,EAAKlD,KAAK8K,KAAKnC,EAAKqB,IAAQ,EAClChD,EAAOA,EAAMhH,KAAK8K,KAAKnC,EAAKsB,IAAQ,EACpCjD,EAAOA,EAAMhH,KAAK8K,KAAKlC,EAAKoB,IAAQ,EACpCjF,EAAMA,EAAK/E,KAAK8K,KAAKlC,EAAKqB,IAAQ,EAClC/G,EAAMA,EAAKlD,KAAK8K,KAAKtC,EAAK2B,IAAQ,EAClCnD,EAAOA,EAAMhH,KAAK8K,KAAKtC,EAAK4B,IAAQ,EACpCpD,EAAOA,EAAMhH,KAAK8K,KAAKrC,EAAK0B,IAAQ,EACpCpF,EAAMA,EAAK/E,KAAK8K,KAAKrC,EAAK2B,IAAQ,EAClClH,EAAMA,EAAKlD,KAAK8K,KAAKzC,EAAKiC,IAAQ,EAClCtD,EAAOA,EAAMhH,KAAK8K,KAAKzC,EAAKkC,IAAQ,EACpCvD,EAAOA,EAAMhH,KAAK8K,KAAKxC,EAAKgC,IAAQ,EACpCvF,EAAMA,EAAK/E,KAAK8K,KAAKxC,EAAKiC,IAAQ,EAClCrH,EAAMA,EAAKlD,KAAK8K,KAAK5C,EAAKuC,IAAQ,EAClCzD,EAAOA,EAAMhH,KAAK8K,KAAK5C,EAAKwC,IAAQ,EACpC1D,EAAOA,EAAMhH,KAAK8K,KAAK3C,EAAKsC,IAAQ,EACpC1F,EAAMA,EAAK/E,KAAK8K,KAAK3C,EAAKuC,IAAQ,EAClCxH,EAAMA,EAAKlD,KAAK8K,KAAK/C,EAAK6C,IAAQ,EAClC5D,EAAOA,EAAMhH,KAAK8K,KAAK/C,EAAK8C,IAAQ,EACpC7D,EAAOA,EAAMhH,KAAK8K,KAAK9C,EAAK4C,IAAQ,EACpC7F,EAAMA,EAAK/E,KAAK8K,KAAK9C,EAAK6C,IAAQ,EAClC,IAAIe,IAASvM,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACtD3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAKlD,KAAK8K,KAAKhC,EAAKkB,IACpBhD,EAAMhH,KAAK8K,KAAKhC,EAAKmB,IACrBjD,EAAOA,EAAMhH,KAAK8K,KAAK/B,EAAKiB,IAAQ,EACpCjF,EAAK/E,KAAK8K,KAAK/B,EAAKkB,IACpB/G,EAAMA,EAAKlD,KAAK8K,KAAKnC,EAAKwB,IAAQ,EAClCnD,EAAOA,EAAMhH,KAAK8K,KAAKnC,EAAKyB,IAAQ,EACpCpD,EAAOA,EAAMhH,KAAK8K,KAAKlC,EAAKuB,IAAQ,EACpCpF,EAAMA,EAAK/E,KAAK8K,KAAKlC,EAAKwB,IAAQ,EAClClH,EAAMA,EAAKlD,KAAK8K,KAAKtC,EAAK8B,IAAQ,EAClCtD,EAAOA,EAAMhH,KAAK8K,KAAKtC,EAAK+B,IAAQ,EACpCvD,EAAOA,EAAMhH,KAAK8K,KAAKrC,EAAK6B,IAAQ,EACpCvF,EAAMA,EAAK/E,KAAK8K,KAAKrC,EAAK8B,IAAQ,EAClCrH,EAAMA,EAAKlD,KAAK8K,KAAKzC,EAAKoC,IAAQ,EAClCzD,EAAOA,EAAMhH,KAAK8K,KAAKzC,EAAKqC,IAAQ,EACpC1D,EAAOA,EAAMhH,KAAK8K,KAAKxC,EAAKmC,IAAQ,EACpC1F,EAAMA,EAAK/E,KAAK8K,KAAKxC,EAAKoC,IAAQ,EAClCxH,EAAMA,EAAKlD,KAAK8K,KAAK5C,EAAK0C,IAAQ,EAClC5D,EAAOA,EAAMhH,KAAK8K,KAAK5C,EAAK2C,IAAQ,EACpC7D,EAAOA,EAAMhH,KAAK8K,KAAK3C,EAAKyC,IAAQ,EACpC7F,EAAMA,EAAK/E,KAAK8K,KAAK3C,EAAK0C,IAAQ,EAClC,IAAIgB,IAASxM,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACtD3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEP3I,EAAKlD,KAAK8K,KAAKhC,EAAKqB,IACpBnD,EAAMhH,KAAK8K,KAAKhC,EAAKsB,IACrBpD,EAAOA,EAAMhH,KAAK8K,KAAK/B,EAAKoB,IAAQ,EACpCpF,EAAK/E,KAAK8K,KAAK/B,EAAKqB,IACpBlH,EAAMA,EAAKlD,KAAK8K,KAAKnC,EAAK2B,IAAQ,EAClCtD,EAAOA,EAAMhH,KAAK8K,KAAKnC,EAAK4B,IAAQ,EACpCvD,EAAOA,EAAMhH,KAAK8K,KAAKlC,EAAK0B,IAAQ,EACpCvF,EAAMA,EAAK/E,KAAK8K,KAAKlC,EAAK2B,IAAQ,EAClCrH,EAAMA,EAAKlD,KAAK8K,KAAKtC,EAAKiC,IAAQ,EAClCzD,EAAOA,EAAMhH,KAAK8K,KAAKtC,EAAKkC,IAAQ,EACpC1D,EAAOA,EAAMhH,KAAK8K,KAAKrC,EAAKgC,IAAQ,EACpC1F,EAAMA,EAAK/E,KAAK8K,KAAKrC,EAAKiC,IAAQ,EAClCxH,EAAMA,EAAKlD,KAAK8K,KAAKzC,EAAKuC,IAAQ,EAClC5D,EAAOA,EAAMhH,KAAK8K,KAAKzC,EAAKwC,IAAQ,EACpC7D,EAAOA,EAAMhH,KAAK8K,KAAKxC,EAAKsC,IAAQ,EACpC7F,EAAMA,EAAK/E,KAAK8K,KAAKxC,EAAKuC,IAAQ,EAClC,IAAIiB,IAASzM,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACtD3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP5I,EAAKlD,KAAK8K,KAAKhC,EAAKwB,IACpBtD,EAAMhH,KAAK8K,KAAKhC,EAAKyB,IACrBvD,EAAOA,EAAMhH,KAAK8K,KAAK/B,EAAKuB,IAAQ,EACpCvF,EAAK/E,KAAK8K,KAAK/B,EAAKwB,IACpBrH,EAAMA,EAAKlD,KAAK8K,KAAKnC,EAAK8B,IAAQ,EAClCzD,EAAOA,EAAMhH,KAAK8K,KAAKnC,EAAK+B,IAAQ,EACpC1D,EAAOA,EAAMhH,KAAK8K,KAAKlC,EAAK6B,IAAQ,EACpC1F,EAAMA,EAAK/E,KAAK8K,KAAKlC,EAAK8B,IAAQ,EAClCxH,EAAMA,EAAKlD,KAAK8K,KAAKtC,EAAKoC,IAAQ,EAClC5D,EAAOA,EAAMhH,KAAK8K,KAAKtC,EAAKqC,IAAQ,EACpC7D,EAAOA,EAAMhH,KAAK8K,KAAKrC,EAAKmC,IAAQ,EACpC7F,EAAMA,EAAK/E,KAAK8K,KAAKrC,EAAKoC,IAAQ,EAClC,IAAIkB,IAAS1M,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACtD3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEP7I,EAAKlD,KAAK8K,KAAKhC,EAAK2B,IACpBzD,EAAMhH,KAAK8K,KAAKhC,EAAK4B,IACrB1D,EAAOA,EAAMhH,KAAK8K,KAAK/B,EAAK0B,IAAQ,EACpC1F,EAAK/E,KAAK8K,KAAK/B,EAAK2B,IACpBxH,EAAMA,EAAKlD,KAAK8K,KAAKnC,EAAKiC,IAAQ,EAClC5D,EAAOA,EAAMhH,KAAK8K,KAAKnC,EAAKkC,IAAQ,EACpC7D,EAAOA,EAAMhH,KAAK8K,KAAKlC,EAAKgC,IAAQ,EACpC7F,EAAMA,EAAK/E,KAAK8K,KAAKlC,EAAKiC,IAAQ,EAClC,IAAImB,IAAS3M,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EACtD3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAEP9I,EAAKlD,KAAK8K,KAAKhC,EAAK8B,IACpB5D,EAAMhH,KAAK8K,KAAKhC,EAAK+B,IACrB7D,EAAOA,EAAMhH,KAAK8K,KAAK/B,EAAK6B,IAAQ,EACpC7F,EAAK/E,KAAK8K,KAAK/B,EAAK8B,IACpB,IAAIoB,IAAS5M,EAAI6D,EAAM,KAAa,KAAN8D,IAAiB,IAAO,EA0BtD,OAzBA3H,GAAO0F,GAAMiC,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK8D,GACP9D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAAN5M,IACF4H,EAAE,IAAM5H,EACR0D,EAAItE,UAECsE,GAQT,SAASmJ,EAAUpJ,EAAM3C,EAAK4C,GAC5BA,EAAIxE,SAAW4B,EAAI5B,SAAWuE,EAAKvE,SACnCwE,EAAItE,OAASqE,EAAKrE,OAAS0B,EAAI1B,OAI/B,IAFA,IAAI0E,EAAQ,EACRgJ,EAAU,EACL/I,EAAI,EAAGA,EAAIL,EAAItE,OAAS,EAAG2E,IAAK,CAGvC,IAAIC,EAAS8I,EACbA,EAAU,EAGV,IAFA,IAAI7I,EAAgB,SAARH,EACRI,EAAOvD,KAAKC,IAAImD,EAAGjD,EAAI1B,OAAS,GAC3ByC,EAAIlB,KAAKM,IAAI,EAAG8C,EAAIN,EAAKrE,OAAS,GAAIyC,GAAKqC,EAAMrC,IAAK,CAC7D,IAAIhB,EAAIkD,EAAIlC,EACR8B,EAAoB,EAAhBF,EAAKtE,MAAM0B,GACf+C,EAAmB,EAAf9C,EAAI3B,MAAM0C,GACdzB,EAAIuD,EAAIC,EAERC,EAAS,SAAJzD,EACT4D,EAAUA,GAAW5D,EAAI,SAAa,GAAM,EAC5CyD,EAAMA,EAAKI,EAAS,EACpBA,EAAa,SAALJ,EACRG,EAAUA,GAAUH,IAAO,IAAO,EAElCiJ,GAAW9I,IAAW,GACtBA,GAAU,SAEZN,EAAIvE,MAAM4E,GAAKE,EACfH,EAAQE,EACRA,EAAS8I,EAQX,OANc,IAAVhJ,EACFJ,EAAIvE,MAAM4E,GAAKD,EAEfJ,EAAItE,SAGCsE,EAAI1B,QAGb,SAAS+K,EAAYtJ,EAAM3C,EAAK4C,GAC9B,IAAIsJ,EAAO,IAAIC,EACf,OAAOD,EAAKE,KAAKzJ,EAAM3C,EAAK4C,GAsB9B,SAASuJ,EAAME,EAAGC,GAChBnO,KAAKkO,EAAIA,EACTlO,KAAKmO,EAAIA,EAvENzM,KAAK8K,OACR/D,EAAclE,GAiDhB5E,EAAGF,UAAU2O,MAAQ,SAAgBvM,EAAK4C,GACxC,IAAIwB,EACAxE,EAAMzB,KAAKG,OAAS0B,EAAI1B,OAW5B,OATE8F,EADkB,KAAhBjG,KAAKG,QAAgC,KAAf0B,EAAI1B,OACtBsI,EAAYzI,KAAM6B,EAAK4C,GACpBhD,EAAM,GACT8C,EAAWvE,KAAM6B,EAAK4C,GACnBhD,EAAM,KACTmM,EAAS5N,KAAM6B,EAAK4C,GAEpBqJ,EAAW9N,KAAM6B,EAAK4C,GAGvBwB,GAWT+H,EAAKvO,UAAU4O,QAAU,SAAkBC,GAGzC,IAFA,IAAI/H,EAAI,IAAIzE,MAAMwM,GACdC,EAAI5O,EAAGF,UAAU6G,WAAWgI,GAAK,EAC5B1M,EAAI,EAAGA,EAAI0M,EAAG1M,IACrB2E,EAAE3E,GAAK5B,KAAKwO,OAAO5M,EAAG2M,EAAGD,GAG3B,OAAO/H,GAITyH,EAAKvO,UAAU+O,OAAS,SAAiBN,EAAGK,EAAGD,GAC7C,GAAU,IAANJ,GAAWA,IAAMI,EAAI,EAAG,OAAOJ,EAGnC,IADA,IAAIO,EAAK,EACA7M,EAAI,EAAGA,EAAI2M,EAAG3M,IACrB6M,IAAW,EAAJP,IAAWK,EAAI3M,EAAI,EAC1BsM,IAAM,EAGR,OAAOO,GAKTT,EAAKvO,UAAUiP,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAI1M,EAAI,EAAGA,EAAI0M,EAAG1M,IACrBkN,EAAKlN,GAAKgN,EAAID,EAAI/M,IAClBmN,EAAKnN,GAAKiN,EAAIF,EAAI/M,KAItBoM,EAAKvO,UAAUuP,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtE3O,KAAK0O,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQxN,KAAKyN,IAAI,EAAIzN,KAAK0N,GAAKb,GAC/Bc,EAAQ3N,KAAK4N,IAAI,EAAI5N,KAAK0N,GAAKb,GAE1BgB,EAAI,EAAGA,EAAIjB,EAAGiB,GAAKhB,EAI1B,IAHA,IAAIiB,EAASN,EACTO,EAASJ,EAEJzM,EAAI,EAAGA,EAAIqM,EAAGrM,IAAK,CAC1B,IAAI8M,EAAKZ,EAAKS,EAAI3M,GACd+M,EAAKZ,EAAKQ,EAAI3M,GAEdgN,EAAKd,EAAKS,EAAI3M,EAAIqM,GAClBY,EAAKd,EAAKQ,EAAI3M,EAAIqM,GAElBa,EAAKN,EAASI,EAAKH,EAASI,EAEhCA,EAAKL,EAASK,EAAKJ,EAASG,EAC5BA,EAAKE,EAELhB,EAAKS,EAAI3M,GAAK8M,EAAKE,EACnBb,EAAKQ,EAAI3M,GAAK+M,EAAKE,EAEnBf,EAAKS,EAAI3M,EAAIqM,GAAKS,EAAKE,EACvBb,EAAKQ,EAAI3M,EAAIqM,GAAKU,EAAKE,EAGnBjN,IAAM2L,IACRuB,EAAKZ,EAAQM,EAASH,EAAQI,EAE9BA,EAASP,EAAQO,EAASJ,EAAQG,EAClCA,EAASM,KAOnB9B,EAAKvO,UAAUsQ,YAAc,SAAsBC,EAAGC,GACpD,IAAI3B,EAAqB,EAAjB5M,KAAKM,IAAIiO,EAAGD,GAChBE,EAAU,EAAJ5B,EACN1M,EAAI,EACR,IAAK0M,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/B1M,IAGF,OAAO,GAAKA,EAAI,EAAIsO,GAGtBlC,EAAKvO,UAAU0Q,UAAY,SAAoBvB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAI1M,EAAI,EAAGA,EAAI0M,EAAI,EAAG1M,IAAK,CAC9B,IAAI2E,EAAIqI,EAAIhN,GAEZgN,EAAIhN,GAAKgN,EAAIN,EAAI1M,EAAI,GACrBgN,EAAIN,EAAI1M,EAAI,GAAK2E,EAEjBA,EAAIsI,EAAIjN,GAERiN,EAAIjN,IAAMiN,EAAIP,EAAI1M,EAAI,GACtBiN,EAAIP,EAAI1M,EAAI,IAAM2E,IAItByH,EAAKvO,UAAU2Q,aAAe,SAAuBC,EAAI/B,GAEvD,IADA,IAAIzJ,EAAQ,EACHjD,EAAI,EAAGA,EAAI0M,EAAI,EAAG1M,IAAK,CAC9B,IAAIiB,EAAoC,KAAhCnB,KAAK4O,MAAMD,EAAG,EAAIzO,EAAI,GAAK0M,GACjC5M,KAAK4O,MAAMD,EAAG,EAAIzO,GAAK0M,GACvBzJ,EAEFwL,EAAGzO,GAAS,SAAJiB,EAGNgC,EADEhC,EAAI,SACE,EAEAA,EAAI,SAAY,EAI5B,OAAOwN,GAGTrC,EAAKvO,UAAU8Q,WAAa,SAAqBF,EAAI5O,EAAKmN,EAAKN,GAE7D,IADA,IAAIzJ,EAAQ,EACHjD,EAAI,EAAGA,EAAIH,EAAKG,IACvBiD,GAAyB,EAARwL,EAAGzO,GAEpBgN,EAAI,EAAIhN,GAAa,KAARiD,EAAgBA,KAAkB,GAC/C+J,EAAI,EAAIhN,EAAI,GAAa,KAARiD,EAAgBA,KAAkB,GAIrD,IAAKjD,EAAI,EAAIH,EAAKG,EAAI0M,IAAK1M,EACzBgN,EAAIhN,GAAK,EAGX5C,EAAiB,IAAV6F,GACP7F,EAA6B,MAAb,KAAR6F,KAGVmJ,EAAKvO,UAAU+Q,KAAO,SAAelC,GAEnC,IADA,IAAImC,EAAK,IAAI3O,MAAMwM,GACV1M,EAAI,EAAGA,EAAI0M,EAAG1M,IACrB6O,EAAG7O,GAAK,EAGV,OAAO6O,GAGTzC,EAAKvO,UAAUwO,KAAO,SAAeC,EAAGC,EAAG1J,GACzC,IAAI6J,EAAI,EAAItO,KAAK+P,YAAY7B,EAAE/N,OAAQgO,EAAEhO,QAErCwO,EAAM3O,KAAKqO,QAAQC,GAEnBoC,EAAI1Q,KAAKwQ,KAAKlC,GAEdM,EAAM,IAAI9M,MAAMwM,GAChBqC,EAAO,IAAI7O,MAAMwM,GACjBsC,EAAO,IAAI9O,MAAMwM,GAEjBuC,EAAO,IAAI/O,MAAMwM,GACjBwC,EAAQ,IAAIhP,MAAMwM,GAClByC,EAAQ,IAAIjP,MAAMwM,GAElB0C,EAAOvM,EAAIvE,MACf8Q,EAAK7Q,OAASmO,EAEdtO,KAAKuQ,WAAWrC,EAAEhO,MAAOgO,EAAE/N,OAAQyO,EAAKN,GACxCtO,KAAKuQ,WAAWpC,EAAEjO,MAAOiO,EAAEhO,OAAQ0Q,EAAMvC,GAEzCtO,KAAKgP,UAAUJ,EAAK8B,EAAGC,EAAMC,EAAMtC,EAAGK,GACtC3O,KAAKgP,UAAU6B,EAAMH,EAAGI,EAAOC,EAAOzC,EAAGK,GAEzC,IAAK,IAAI/M,EAAI,EAAGA,EAAI0M,EAAG1M,IAAK,CAC1B,IAAIkO,EAAKa,EAAK/O,GAAKkP,EAAMlP,GAAKgP,EAAKhP,GAAKmP,EAAMnP,GAC9CgP,EAAKhP,GAAK+O,EAAK/O,GAAKmP,EAAMnP,GAAKgP,EAAKhP,GAAKkP,EAAMlP,GAC/C+O,EAAK/O,GAAKkO,EAUZ,OAPA9P,KAAKmQ,UAAUQ,EAAMC,EAAMtC,GAC3BtO,KAAKgP,UAAU2B,EAAMC,EAAMI,EAAMN,EAAGpC,EAAGK,GACvC3O,KAAKmQ,UAAUa,EAAMN,EAAGpC,GACxBtO,KAAKoQ,aAAaY,EAAM1C,GAExB7J,EAAIxE,SAAWiO,EAAEjO,SAAWkO,EAAElO,SAC9BwE,EAAItE,OAAS+N,EAAE/N,OAASgO,EAAEhO,OACnBsE,EAAI1B,SAIbpD,EAAGF,UAAU+B,IAAM,SAAcK,GAC/B,IAAI4C,EAAM,IAAI9E,EAAG,MAEjB,OADA8E,EAAIvE,MAAQ,IAAI4B,MAAM9B,KAAKG,OAAS0B,EAAI1B,QACjCH,KAAKoO,MAAMvM,EAAK4C,IAIzB9E,EAAGF,UAAUwR,KAAO,SAAepP,GACjC,IAAI4C,EAAM,IAAI9E,EAAG,MAEjB,OADA8E,EAAIvE,MAAQ,IAAI4B,MAAM9B,KAAKG,OAAS0B,EAAI1B,QACjC2N,EAAW9N,KAAM6B,EAAK4C,IAI/B9E,EAAGF,UAAU+M,KAAO,SAAe3K,GACjC,OAAO7B,KAAK2D,QAAQyK,MAAMvM,EAAK7B,OAGjCL,EAAGF,UAAU6D,MAAQ,SAAgBzB,GACnC7C,EAAsB,kBAAR6C,GACd7C,EAAO6C,EAAM,UAIb,IADA,IAAIgD,EAAQ,EACHjD,EAAI,EAAGA,EAAI5B,KAAKG,OAAQyB,IAAK,CACpC,IAAIiB,GAAqB,EAAhB7C,KAAKE,MAAM0B,IAAUC,EAC1B+C,GAAU,SAAJ/B,IAA0B,SAARgC,GAC5BA,IAAU,GACVA,GAAUhC,EAAI,SAAa,EAE3BgC,GAASD,IAAO,GAChB5E,KAAKE,MAAM0B,GAAU,SAALgD,EAQlB,OALc,IAAVC,IACF7E,KAAKE,MAAM0B,GAAKiD,EAChB7E,KAAKG,UAGAH,MAGTL,EAAGF,UAAUyR,KAAO,SAAerP,GACjC,OAAO7B,KAAK2D,QAAQL,MAAMzB,IAI5BlC,EAAGF,UAAU0R,IAAM,WACjB,OAAOnR,KAAKwB,IAAIxB,OAIlBL,EAAGF,UAAU2R,KAAO,WAClB,OAAOpR,KAAKwM,KAAKxM,KAAK2D,UAIxBhE,EAAGF,UAAU+D,IAAM,SAAc3B,GAC/B,IAAIgB,EAAIsB,EAAWtC,GACnB,GAAiB,IAAbgB,EAAE1C,OAAc,OAAO,IAAIR,EAAG,GAIlC,IADA,IAAIsG,EAAMjG,KACD4B,EAAI,EAAGA,EAAIiB,EAAE1C,OAAQyB,IAAKqE,EAAMA,EAAIkL,MAC3C,GAAa,IAATtO,EAAEjB,GAAU,MAGlB,KAAMA,EAAIiB,EAAE1C,OACV,IAAK,IAAI+F,EAAID,EAAIkL,MAAOvP,EAAIiB,EAAE1C,OAAQyB,IAAKsE,EAAIA,EAAEiL,MAClC,IAATtO,EAAEjB,KAENqE,EAAMA,EAAIzE,IAAI0E,IAIlB,OAAOD,GAITtG,EAAGF,UAAU4R,OAAS,SAAiBC,GACrCtS,EAAuB,kBAATsS,GAAqBA,GAAQ,GAC3C,IAGI1P,EAHAT,EAAImQ,EAAO,GACXrC,GAAKqC,EAAOnQ,GAAK,GACjBoQ,EAAa,WAAe,GAAKpQ,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAI0D,EAAQ,EAEZ,IAAKjD,EAAI,EAAGA,EAAI5B,KAAKG,OAAQyB,IAAK,CAChC,IAAI4P,EAAWxR,KAAKE,MAAM0B,GAAK2P,EAC3BxQ,GAAsB,EAAhBf,KAAKE,MAAM0B,IAAU4P,GAAarQ,EAC5CnB,KAAKE,MAAM0B,GAAKb,EAAI8D,EACpBA,EAAQ2M,IAAc,GAAKrQ,EAGzB0D,IACF7E,KAAKE,MAAM0B,GAAKiD,EAChB7E,KAAKG,UAIT,GAAU,IAAN8O,EAAS,CACX,IAAKrN,EAAI5B,KAAKG,OAAS,EAAGyB,GAAK,EAAGA,IAChC5B,KAAKE,MAAM0B,EAAIqN,GAAKjP,KAAKE,MAAM0B,GAGjC,IAAKA,EAAI,EAAGA,EAAIqN,EAAGrN,IACjB5B,KAAKE,MAAM0B,GAAK,EAGlB5B,KAAKG,QAAU8O,EAGjB,OAAOjP,KAAK+C,SAGdpD,EAAGF,UAAUgS,MAAQ,SAAgBH,GAGnC,OADAtS,EAAyB,IAAlBgB,KAAKC,UACLD,KAAKqR,OAAOC,IAMrB3R,EAAGF,UAAU2G,OAAS,SAAiBkL,EAAMI,EAAMC,GAEjD,IAAIC,EADJ5S,EAAuB,kBAATsS,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAIvQ,EAAImQ,EAAO,GACXrC,EAAIvN,KAAKC,KAAK2P,EAAOnQ,GAAK,GAAInB,KAAKG,QACnC0R,EAAO,SAAc,WAAc1Q,GAAMA,EACzC2Q,EAAcH,EAMlB,GAJAC,GAAK3C,EACL2C,EAAIlQ,KAAKM,IAAI,EAAG4P,GAGZE,EAAa,CACf,IAAK,IAAIlQ,EAAI,EAAGA,EAAIqN,EAAGrN,IACrBkQ,EAAY5R,MAAM0B,GAAK5B,KAAKE,MAAM0B,GAEpCkQ,EAAY3R,OAAS8O,EAGvB,GAAU,IAANA,QAEG,GAAIjP,KAAKG,OAAS8O,EAEvB,IADAjP,KAAKG,QAAU8O,EACVrN,EAAI,EAAGA,EAAI5B,KAAKG,OAAQyB,IAC3B5B,KAAKE,MAAM0B,GAAK5B,KAAKE,MAAM0B,EAAIqN,QAGjCjP,KAAKE,MAAM,GAAK,EAChBF,KAAKG,OAAS,EAGhB,IAAI0E,EAAQ,EACZ,IAAKjD,EAAI5B,KAAKG,OAAS,EAAGyB,GAAK,IAAgB,IAAViD,GAAejD,GAAKgQ,GAAIhQ,IAAK,CAChE,IAAIyB,EAAuB,EAAhBrD,KAAKE,MAAM0B,GACtB5B,KAAKE,MAAM0B,GAAMiD,GAAU,GAAK1D,EAAOkC,IAASlC,EAChD0D,EAAQxB,EAAOwO,EAajB,OATIC,GAAyB,IAAVjN,IACjBiN,EAAY5R,MAAM4R,EAAY3R,UAAY0E,GAGxB,IAAhB7E,KAAKG,SACPH,KAAKE,MAAM,GAAK,EAChBF,KAAKG,OAAS,GAGTH,KAAK+C,SAGdpD,EAAGF,UAAUsS,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADA3S,EAAyB,IAAlBgB,KAAKC,UACLD,KAAKoG,OAAOkL,EAAMI,EAAMC,IAIjChS,EAAGF,UAAUuS,KAAO,SAAeV,GACjC,OAAOtR,KAAK2D,QAAQ8N,MAAMH,IAG5B3R,EAAGF,UAAUwS,MAAQ,SAAgBX,GACnC,OAAOtR,KAAK2D,QAAQ0N,OAAOC,IAI7B3R,EAAGF,UAAUyS,KAAO,SAAeZ,GACjC,OAAOtR,KAAK2D,QAAQoO,MAAMT,IAG5B3R,EAAGF,UAAU0S,MAAQ,SAAgBb,GACnC,OAAOtR,KAAK2D,QAAQyC,OAAOkL,IAI7B3R,EAAGF,UAAUwH,MAAQ,SAAgB5C,GACnCrF,EAAsB,kBAARqF,GAAoBA,GAAO,GACzC,IAAIlD,EAAIkD,EAAM,GACV4K,GAAK5K,EAAMlD,GAAK,GAChB+E,EAAI,GAAK/E,EAGb,GAAInB,KAAKG,QAAU8O,EAAG,OAAO,EAG7B,IAAIpM,EAAI7C,KAAKE,MAAM+O,GAEnB,SAAUpM,EAAIqD,IAIhBvG,EAAGF,UAAU2S,OAAS,SAAiBd,GACrCtS,EAAuB,kBAATsS,GAAqBA,GAAQ,GAC3C,IAAInQ,EAAImQ,EAAO,GACXrC,GAAKqC,EAAOnQ,GAAK,GAIrB,GAFAnC,EAAyB,IAAlBgB,KAAKC,SAAgB,2CAExBD,KAAKG,QAAU8O,EACjB,OAAOjP,KAQT,GALU,IAANmB,GACF8N,IAEFjP,KAAKG,OAASuB,KAAKC,IAAIsN,EAAGjP,KAAKG,QAErB,IAANgB,EAAS,CACX,IAAI0Q,EAAO,SAAc,WAAc1Q,GAAMA,EAC7CnB,KAAKE,MAAMF,KAAKG,OAAS,IAAM0R,EAGjC,OAAO7R,KAAK+C,SAIdpD,EAAGF,UAAU4S,MAAQ,SAAgBf,GACnC,OAAOtR,KAAK2D,QAAQyO,OAAOd,IAI7B3R,EAAGF,UAAUsH,MAAQ,SAAgBlF,GAGnC,OAFA7C,EAAsB,kBAAR6C,GACd7C,EAAO6C,EAAM,UACTA,EAAM,EAAU7B,KAAKsS,OAAOzQ,GAGV,IAAlB7B,KAAKC,SACa,IAAhBD,KAAKG,SAAiC,EAAhBH,KAAKE,MAAM,IAAU2B,GAC7C7B,KAAKE,MAAM,GAAK2B,GAAuB,EAAhB7B,KAAKE,MAAM,IAClCF,KAAKC,SAAW,EACTD,OAGTA,KAAKC,SAAW,EAChBD,KAAKsS,MAAMzQ,GACX7B,KAAKC,SAAW,EACTD,MAIFA,KAAKuD,OAAO1B,IAGrBlC,EAAGF,UAAU8D,OAAS,SAAiB1B,GACrC7B,KAAKE,MAAM,IAAM2B,EAGjB,IAAK,IAAID,EAAI,EAAGA,EAAI5B,KAAKG,QAAUH,KAAKE,MAAM0B,IAAM,SAAWA,IAC7D5B,KAAKE,MAAM0B,IAAM,SACbA,IAAM5B,KAAKG,OAAS,EACtBH,KAAKE,MAAM0B,EAAI,GAAK,EAEpB5B,KAAKE,MAAM0B,EAAI,KAKnB,OAFA5B,KAAKG,OAASuB,KAAKM,IAAIhC,KAAKG,OAAQyB,EAAI,GAEjC5B,MAITL,EAAGF,UAAU6S,MAAQ,SAAgBzQ,GAGnC,GAFA7C,EAAsB,kBAAR6C,GACd7C,EAAO6C,EAAM,UACTA,EAAM,EAAG,OAAO7B,KAAK+G,OAAOlF,GAEhC,GAAsB,IAAlB7B,KAAKC,SAIP,OAHAD,KAAKC,SAAW,EAChBD,KAAK+G,MAAMlF,GACX7B,KAAKC,SAAW,EACTD,KAKT,GAFAA,KAAKE,MAAM,IAAM2B,EAEG,IAAhB7B,KAAKG,QAAgBH,KAAKE,MAAM,GAAK,EACvCF,KAAKE,MAAM,IAAMF,KAAKE,MAAM,GAC5BF,KAAKC,SAAW,OAGhB,IAAK,IAAI2B,EAAI,EAAGA,EAAI5B,KAAKG,QAAUH,KAAKE,MAAM0B,GAAK,EAAGA,IACpD5B,KAAKE,MAAM0B,IAAM,SACjB5B,KAAKE,MAAM0B,EAAI,IAAM,EAIzB,OAAO5B,KAAK+C,SAGdpD,EAAGF,UAAU8S,KAAO,SAAe1Q,GACjC,OAAO7B,KAAK2D,QAAQoD,MAAMlF,IAG5BlC,EAAGF,UAAU+S,KAAO,SAAe3Q,GACjC,OAAO7B,KAAK2D,QAAQ2O,MAAMzQ,IAG5BlC,EAAGF,UAAUgT,KAAO,WAGlB,OAFAzS,KAAKC,SAAW,EAETD,MAGTL,EAAGF,UAAUoH,IAAM,WACjB,OAAO7G,KAAK2D,QAAQ8O,QAGtB9S,EAAGF,UAAUiT,aAAe,SAAuB7Q,EAAKL,EAAKmR,GAC3D,IACI/Q,EAIAiB,EALApB,EAAMI,EAAI1B,OAASwS,EAGvB3S,KAAK4D,QAAQnC,GAGb,IAAIoD,EAAQ,EACZ,IAAKjD,EAAI,EAAGA,EAAIC,EAAI1B,OAAQyB,IAAK,CAC/BiB,GAA6B,EAAxB7C,KAAKE,MAAM0B,EAAI+Q,IAAc9N,EAClC,IAAI3C,GAAwB,EAAfL,EAAI3B,MAAM0B,IAAUJ,EACjCqB,GAAa,SAARX,EACL2C,GAAShC,GAAK,KAAQX,EAAQ,SAAa,GAC3ClC,KAAKE,MAAM0B,EAAI+Q,GAAa,SAAJ9P,EAE1B,KAAOjB,EAAI5B,KAAKG,OAASwS,EAAO/Q,IAC9BiB,GAA6B,EAAxB7C,KAAKE,MAAM0B,EAAI+Q,IAAc9N,EAClCA,EAAQhC,GAAK,GACb7C,KAAKE,MAAM0B,EAAI+Q,GAAa,SAAJ9P,EAG1B,GAAc,IAAVgC,EAAa,OAAO7E,KAAK+C,QAK7B,IAFA/D,GAAkB,IAAX6F,GACPA,EAAQ,EACHjD,EAAI,EAAGA,EAAI5B,KAAKG,OAAQyB,IAC3BiB,IAAsB,EAAhB7C,KAAKE,MAAM0B,IAAUiD,EAC3BA,EAAQhC,GAAK,GACb7C,KAAKE,MAAM0B,GAAS,SAAJiB,EAIlB,OAFA7C,KAAKC,SAAW,EAETD,KAAK+C,SAGdpD,EAAGF,UAAUmT,SAAW,SAAmB/Q,EAAKgR,GAC9C,IAAIF,EAAQ3S,KAAKG,OAAS0B,EAAI1B,OAE1BuE,EAAI1E,KAAK2D,QACTgB,EAAI9C,EAGJiR,EAA8B,EAAxBnO,EAAEzE,MAAMyE,EAAExE,OAAS,GACzB4S,EAAU/S,KAAKsG,WAAWwM,GAC9BH,EAAQ,GAAKI,EACC,IAAVJ,IACFhO,EAAIA,EAAEsN,MAAMU,GACZjO,EAAE2M,OAAOsB,GACTG,EAA8B,EAAxBnO,EAAEzE,MAAMyE,EAAExE,OAAS,IAI3B,IACI+F,EADA+J,EAAIvL,EAAEvE,OAASwE,EAAExE,OAGrB,GAAa,QAAT0S,EAAgB,CAClB3M,EAAI,IAAIvG,EAAG,MACXuG,EAAE/F,OAAS8P,EAAI,EACf/J,EAAEhG,MAAQ,IAAI4B,MAAMoE,EAAE/F,QACtB,IAAK,IAAIyB,EAAI,EAAGA,EAAIsE,EAAE/F,OAAQyB,IAC5BsE,EAAEhG,MAAM0B,GAAK,EAIjB,IAAIoR,EAAOtO,EAAEf,QAAQ+O,aAAa/N,EAAG,EAAGsL,GAClB,IAAlB+C,EAAK/S,WACPyE,EAAIsO,EACA9M,IACFA,EAAEhG,MAAM+P,GAAK,IAIjB,IAAK,IAAIrN,EAAIqN,EAAI,EAAGrN,GAAK,EAAGA,IAAK,CAC/B,IAAIqQ,EAAmC,UAAL,EAAxBvO,EAAExE,MAAMyE,EAAExE,OAASyC,KACE,EAA5B8B,EAAExE,MAAMyE,EAAExE,OAASyC,EAAI,IAI1BqQ,EAAKvR,KAAKC,IAAKsR,EAAKH,EAAO,EAAG,UAE9BpO,EAAEgO,aAAa/N,EAAGsO,EAAIrQ,GACtB,MAAsB,IAAf8B,EAAEzE,SACPgT,IACAvO,EAAEzE,SAAW,EACbyE,EAAEgO,aAAa/N,EAAG,EAAG/B,GAChB8B,EAAEW,WACLX,EAAEzE,UAAY,GAGdiG,IACFA,EAAEhG,MAAM0C,GAAKqQ,GAajB,OAVI/M,GACFA,EAAEnD,QAEJ2B,EAAE3B,QAGW,QAAT8P,GAA4B,IAAVF,GACpBjO,EAAE0B,OAAOuM,GAGJ,CACLO,IAAKhN,GAAK,KACV9C,IAAKsB,IAQT/E,EAAGF,UAAU0T,OAAS,SAAiBtR,EAAKgR,EAAMO,GAGhD,OAFApU,GAAQ6C,EAAIwD,UAERrF,KAAKqF,SACA,CACL6N,IAAK,IAAIvT,EAAG,GACZyD,IAAK,IAAIzD,EAAG,IAKM,IAAlBK,KAAKC,UAAmC,IAAjB4B,EAAI5B,UAC7BgG,EAAMjG,KAAKqH,MAAM8L,OAAOtR,EAAKgR,GAEhB,QAATA,IACFK,EAAMjN,EAAIiN,IAAI7L,OAGH,QAATwL,IACFzP,EAAM6C,EAAI7C,IAAIiE,MACV+L,GAA6B,IAAjBhQ,EAAInD,UAClBmD,EAAIiF,KAAKxG,IAIN,CACLqR,IAAKA,EACL9P,IAAKA,IAIa,IAAlBpD,KAAKC,UAAmC,IAAjB4B,EAAI5B,UAC7BgG,EAAMjG,KAAKmT,OAAOtR,EAAIwF,MAAOwL,GAEhB,QAATA,IACFK,EAAMjN,EAAIiN,IAAI7L,OAGT,CACL6L,IAAKA,EACL9P,IAAK6C,EAAI7C,MAI0B,KAAlCpD,KAAKC,SAAW4B,EAAI5B,WACvBgG,EAAMjG,KAAKqH,MAAM8L,OAAOtR,EAAIwF,MAAOwL,GAEtB,QAATA,IACFzP,EAAM6C,EAAI7C,IAAIiE,MACV+L,GAA6B,IAAjBhQ,EAAInD,UAClBmD,EAAIkF,KAAKzG,IAIN,CACLqR,IAAKjN,EAAIiN,IACT9P,IAAKA,IAOLvB,EAAI1B,OAASH,KAAKG,QAAUH,KAAKmC,IAAIN,GAAO,EACvC,CACLqR,IAAK,IAAIvT,EAAG,GACZyD,IAAKpD,MAKU,IAAf6B,EAAI1B,OACO,QAAT0S,EACK,CACLK,IAAKlT,KAAKqT,KAAKxR,EAAI3B,MAAM,IACzBkD,IAAK,MAII,QAATyP,EACK,CACLK,IAAK,KACL9P,IAAK,IAAIzD,EAAGK,KAAKsF,KAAKzD,EAAI3B,MAAM,MAI7B,CACLgT,IAAKlT,KAAKqT,KAAKxR,EAAI3B,MAAM,IACzBkD,IAAK,IAAIzD,EAAGK,KAAKsF,KAAKzD,EAAI3B,MAAM,MAI7BF,KAAK4S,SAAS/Q,EAAKgR,GAlF1B,IAAIK,EAAK9P,EAAK6C,GAsFhBtG,EAAGF,UAAUyT,IAAM,SAAcrR,GAC/B,OAAO7B,KAAKmT,OAAOtR,EAAK,OAAO,GAAOqR,KAIxCvT,EAAGF,UAAU2D,IAAM,SAAcvB,GAC/B,OAAO7B,KAAKmT,OAAOtR,EAAK,OAAO,GAAOuB,KAGxCzD,EAAGF,UAAU6T,KAAO,SAAezR,GACjC,OAAO7B,KAAKmT,OAAOtR,EAAK,OAAO,GAAMuB,KAIvCzD,EAAGF,UAAU8T,SAAW,SAAmB1R,GACzC,IAAI2R,EAAKxT,KAAKmT,OAAOtR,GAGrB,GAAI2R,EAAGpQ,IAAIiC,SAAU,OAAOmO,EAAGN,IAE/B,IAAI9P,EAA0B,IAApBoQ,EAAGN,IAAIjT,SAAiBuT,EAAGpQ,IAAIkF,KAAKzG,GAAO2R,EAAGpQ,IAEpDqQ,EAAO5R,EAAIsQ,MAAM,GACjBuB,EAAK7R,EAAIsE,MAAM,GACfhE,EAAMiB,EAAIjB,IAAIsR,GAGlB,OAAItR,EAAM,GAAY,IAAPuR,GAAoB,IAARvR,EAAkBqR,EAAGN,IAGrB,IAApBM,EAAGN,IAAIjT,SAAiBuT,EAAGN,IAAIZ,MAAM,GAAKkB,EAAGN,IAAInM,MAAM,IAGhEpH,EAAGF,UAAU6F,KAAO,SAAezD,GACjC7C,EAAO6C,GAAO,UAId,IAHA,IAAI0N,GAAK,GAAK,IAAM1N,EAEhB8R,EAAM,EACD/R,EAAI5B,KAAKG,OAAS,EAAGyB,GAAK,EAAGA,IACpC+R,GAAOpE,EAAIoE,GAAuB,EAAhB3T,KAAKE,MAAM0B,KAAWC,EAG1C,OAAO8R,GAIThU,EAAGF,UAAU8F,MAAQ,SAAgB1D,GACnC7C,EAAO6C,GAAO,UAGd,IADA,IAAIgD,EAAQ,EACHjD,EAAI5B,KAAKG,OAAS,EAAGyB,GAAK,EAAGA,IAAK,CACzC,IAAIiB,GAAqB,EAAhB7C,KAAKE,MAAM0B,IAAkB,SAARiD,EAC9B7E,KAAKE,MAAM0B,GAAMiB,EAAIhB,EAAO,EAC5BgD,EAAQhC,EAAIhB,EAGd,OAAO7B,KAAK+C,SAGdpD,EAAGF,UAAU4T,KAAO,SAAexR,GACjC,OAAO7B,KAAK2D,QAAQ4B,MAAM1D,IAG5BlC,EAAGF,UAAUmU,KAAO,SAAerE,GACjCvQ,EAAsB,IAAfuQ,EAAEtP,UACTjB,GAAQuQ,EAAElK,UAEV,IAAI6I,EAAIlO,KACJmO,EAAIoB,EAAE5L,QAGRuK,EADiB,IAAfA,EAAEjO,SACAiO,EAAEoF,KAAK/D,GAEPrB,EAAEvK,QAIR,IAAIkQ,EAAI,IAAIlU,EAAG,GACXmU,EAAI,IAAInU,EAAG,GAGXoU,EAAI,IAAIpU,EAAG,GACXqU,EAAI,IAAIrU,EAAG,GAEXsU,EAAI,EAER,MAAO/F,EAAEgG,UAAY/F,EAAE+F,SACrBhG,EAAE9H,OAAO,GACT+H,EAAE/H,OAAO,KACP6N,EAGJ,IAAIE,EAAKhG,EAAExK,QACPyQ,EAAKlG,EAAEvK,QAEX,OAAQuK,EAAE7I,SAAU,CAClB,IAAK,IAAIzD,EAAI,EAAGyS,EAAK,EAAyB,KAArBnG,EAAEhO,MAAM,GAAKmU,IAAazS,EAAI,KAAMA,EAAGyS,IAAO,GACvE,GAAIzS,EAAI,EAAG,CACTsM,EAAE9H,OAAOxE,GACT,MAAOA,KAAM,GACPiS,EAAES,SAAWR,EAAEQ,WACjBT,EAAExL,KAAK8L,GACPL,EAAExL,KAAK8L,IAGTP,EAAEzN,OAAO,GACT0N,EAAE1N,OAAO,GAIb,IAAK,IAAIxD,EAAI,EAAG2R,EAAK,EAAyB,KAArBpG,EAAEjO,MAAM,GAAKqU,IAAa3R,EAAI,KAAMA,EAAG2R,IAAO,GACvE,GAAI3R,EAAI,EAAG,CACTuL,EAAE/H,OAAOxD,GACT,MAAOA,KAAM,GACPmR,EAAEO,SAAWN,EAAEM,WACjBP,EAAE1L,KAAK8L,GACPH,EAAE1L,KAAK8L,IAGTL,EAAE3N,OAAO,GACT4N,EAAE5N,OAAO,GAIT8H,EAAE/L,IAAIgM,IAAM,GACdD,EAAE5F,KAAK6F,GACP0F,EAAEvL,KAAKyL,GACPD,EAAExL,KAAK0L,KAEP7F,EAAE7F,KAAK4F,GACP6F,EAAEzL,KAAKuL,GACPG,EAAE1L,KAAKwL,IAIX,MAAO,CACLpP,EAAGqP,EACHpP,EAAGqP,EACHQ,IAAKrG,EAAEkD,OAAO4C,KAOlBtU,EAAGF,UAAUgV,OAAS,SAAiBlF,GACrCvQ,EAAsB,IAAfuQ,EAAEtP,UACTjB,GAAQuQ,EAAElK,UAEV,IAAIX,EAAI1E,KACJ2E,EAAI4K,EAAE5L,QAGRe,EADiB,IAAfA,EAAEzE,SACAyE,EAAE4O,KAAK/D,GAEP7K,EAAEf,QAGR,IAuCIsC,EAvCAyO,EAAK,IAAI/U,EAAG,GACZgV,EAAK,IAAIhV,EAAG,GAEZiV,EAAQjQ,EAAEhB,QAEd,MAAOe,EAAEmQ,KAAK,GAAK,GAAKlQ,EAAEkQ,KAAK,GAAK,EAAG,CACrC,IAAK,IAAIjT,EAAI,EAAGyS,EAAK,EAAyB,KAArB3P,EAAExE,MAAM,GAAKmU,IAAazS,EAAI,KAAMA,EAAGyS,IAAO,GACvE,GAAIzS,EAAI,EAAG,CACT8C,EAAE0B,OAAOxE,GACT,MAAOA,KAAM,EACP8S,EAAGJ,SACLI,EAAGrM,KAAKuM,GAGVF,EAAGtO,OAAO,GAId,IAAK,IAAIxD,EAAI,EAAG2R,EAAK,EAAyB,KAArB5P,EAAEzE,MAAM,GAAKqU,IAAa3R,EAAI,KAAMA,EAAG2R,IAAO,GACvE,GAAI3R,EAAI,EAAG,CACT+B,EAAEyB,OAAOxD,GACT,MAAOA,KAAM,EACP+R,EAAGL,SACLK,EAAGtM,KAAKuM,GAGVD,EAAGvO,OAAO,GAIV1B,EAAEvC,IAAIwC,IAAM,GACdD,EAAE4D,KAAK3D,GACP+P,EAAGpM,KAAKqM,KAERhQ,EAAE2D,KAAK5D,GACPiQ,EAAGrM,KAAKoM,IAeZ,OATEzO,EADgB,IAAdvB,EAAEmQ,KAAK,GACHH,EAEAC,EAGJ1O,EAAI4O,KAAK,GAAK,GAChB5O,EAAIoC,KAAKkH,GAGJtJ,GAGTtG,EAAGF,UAAU+U,IAAM,SAAc3S,GAC/B,GAAI7B,KAAKqF,SAAU,OAAOxD,EAAIgF,MAC9B,GAAIhF,EAAIwD,SAAU,OAAOrF,KAAK6G,MAE9B,IAAInC,EAAI1E,KAAK2D,QACTgB,EAAI9C,EAAI8B,QACZe,EAAEzE,SAAW,EACb0E,EAAE1E,SAAW,EAGb,IAAK,IAAI0S,EAAQ,EAAGjO,EAAEwP,UAAYvP,EAAEuP,SAAUvB,IAC5CjO,EAAE0B,OAAO,GACTzB,EAAEyB,OAAO,GAGX,EAAG,CACD,MAAO1B,EAAEwP,SACPxP,EAAE0B,OAAO,GAEX,MAAOzB,EAAEuP,SACPvP,EAAEyB,OAAO,GAGX,IAAIjF,EAAIuD,EAAEvC,IAAIwC,GACd,GAAIxD,EAAI,EAAG,CAET,IAAIoF,EAAI7B,EACRA,EAAIC,EACJA,EAAI4B,OACC,GAAU,IAANpF,GAAyB,IAAdwD,EAAEkQ,KAAK,GAC3B,MAGFnQ,EAAE4D,KAAK3D,SACA,GAET,OAAOA,EAAE0M,OAAOsB,IAIlBhT,EAAGF,UAAUqV,KAAO,SAAejT,GACjC,OAAO7B,KAAK4T,KAAK/R,GAAK6C,EAAE4O,KAAKzR,IAG/BlC,EAAGF,UAAUyU,OAAS,WACpB,OAA+B,KAAP,EAAhBlU,KAAKE,MAAM,KAGrBP,EAAGF,UAAU6U,MAAQ,WACnB,OAA+B,KAAP,EAAhBtU,KAAKE,MAAM,KAIrBP,EAAGF,UAAU0G,MAAQ,SAAgBtE,GACnC,OAAO7B,KAAKE,MAAM,GAAK2B,GAIzBlC,EAAGF,UAAUsV,MAAQ,SAAgB1Q,GACnCrF,EAAsB,kBAARqF,GACd,IAAIlD,EAAIkD,EAAM,GACV4K,GAAK5K,EAAMlD,GAAK,GAChB+E,EAAI,GAAK/E,EAGb,GAAInB,KAAKG,QAAU8O,EAGjB,OAFAjP,KAAK4D,QAAQqL,EAAI,GACjBjP,KAAKE,MAAM+O,IAAM/I,EACVlG,KAKT,IADA,IAAI6E,EAAQqB,EACHtE,EAAIqN,EAAa,IAAVpK,GAAejD,EAAI5B,KAAKG,OAAQyB,IAAK,CACnD,IAAIiB,EAAoB,EAAhB7C,KAAKE,MAAM0B,GACnBiB,GAAKgC,EACLA,EAAQhC,IAAM,GACdA,GAAK,SACL7C,KAAKE,MAAM0B,GAAKiB,EAMlB,OAJc,IAAVgC,IACF7E,KAAKE,MAAM0B,GAAKiD,EAChB7E,KAAKG,UAEAH,MAGTL,EAAGF,UAAU4F,OAAS,WACpB,OAAuB,IAAhBrF,KAAKG,QAAkC,IAAlBH,KAAKE,MAAM,IAGzCP,EAAGF,UAAUoV,KAAO,SAAehT,GACjC,IAOIoE,EAPAhG,EAAW4B,EAAM,EAErB,GAAsB,IAAlB7B,KAAKC,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBD,KAAKC,UAAkBA,EAAU,OAAO,EAK5C,GAHAD,KAAK+C,QAGD/C,KAAKG,OAAS,EAChB8F,EAAM,MACD,CACDhG,IACF4B,GAAOA,GAGT7C,EAAO6C,GAAO,SAAW,qBAEzB,IAAIgB,EAAoB,EAAhB7C,KAAKE,MAAM,GACnB+F,EAAMpD,IAAMhB,EAAM,EAAIgB,EAAIhB,GAAO,EAAI,EAEvC,OAAsB,IAAlB7B,KAAKC,SAA8B,GAANgG,EAC1BA,GAOTtG,EAAGF,UAAU0C,IAAM,SAAcN,GAC/B,GAAsB,IAAlB7B,KAAKC,UAAmC,IAAjB4B,EAAI5B,SAAgB,OAAQ,EACvD,GAAsB,IAAlBD,KAAKC,UAAmC,IAAjB4B,EAAI5B,SAAgB,OAAO,EAEtD,IAAIgG,EAAMjG,KAAKgV,KAAKnT,GACpB,OAAsB,IAAlB7B,KAAKC,SAA8B,GAANgG,EAC1BA,GAITtG,EAAGF,UAAUuV,KAAO,SAAenT,GAEjC,GAAI7B,KAAKG,OAAS0B,EAAI1B,OAAQ,OAAO,EACrC,GAAIH,KAAKG,OAAS0B,EAAI1B,OAAQ,OAAQ,EAGtC,IADA,IAAI8F,EAAM,EACDrE,EAAI5B,KAAKG,OAAS,EAAGyB,GAAK,EAAGA,IAAK,CACzC,IAAI8C,EAAoB,EAAhB1E,KAAKE,MAAM0B,GACf+C,EAAmB,EAAf9C,EAAI3B,MAAM0B,GAElB,GAAI8C,IAAMC,EAAV,CACID,EAAIC,EACNsB,GAAO,EACEvB,EAAIC,IACbsB,EAAM,GAER,OAEF,OAAOA,GAGTtG,EAAGF,UAAUwV,IAAM,SAAcpT,GAC/B,OAA0B,IAAnB7B,KAAK6U,KAAKhT,IAGnBlC,EAAGF,UAAUyV,GAAK,SAAarT,GAC7B,OAAyB,IAAlB7B,KAAKmC,IAAIN,IAGlBlC,EAAGF,UAAU0V,KAAO,SAAetT,GACjC,OAAO7B,KAAK6U,KAAKhT,IAAQ,GAG3BlC,EAAGF,UAAU2V,IAAM,SAAcvT,GAC/B,OAAO7B,KAAKmC,IAAIN,IAAQ,GAG1BlC,EAAGF,UAAU4V,IAAM,SAAcxT,GAC/B,OAA2B,IAApB7B,KAAK6U,KAAKhT,IAGnBlC,EAAGF,UAAU6V,GAAK,SAAazT,GAC7B,OAA0B,IAAnB7B,KAAKmC,IAAIN,IAGlBlC,EAAGF,UAAU8V,KAAO,SAAe1T,GACjC,OAAO7B,KAAK6U,KAAKhT,IAAQ,GAG3BlC,EAAGF,UAAU+V,IAAM,SAAc3T,GAC/B,OAAO7B,KAAKmC,IAAIN,IAAQ,GAG1BlC,EAAGF,UAAUgW,IAAM,SAAc5T,GAC/B,OAA0B,IAAnB7B,KAAK6U,KAAKhT,IAGnBlC,EAAGF,UAAUiW,GAAK,SAAa7T,GAC7B,OAAyB,IAAlB7B,KAAKmC,IAAIN,IAOlBlC,EAAGS,IAAM,SAAcyB,GACrB,OAAO,IAAI8T,EAAI9T,IAGjBlC,EAAGF,UAAUmW,MAAQ,SAAgBC,GAGnC,OAFA7W,GAAQgB,KAAKI,IAAK,yCAClBpB,EAAyB,IAAlBgB,KAAKC,SAAgB,iCACrB4V,EAAIC,UAAU9V,MAAM+V,UAAUF,IAGvClW,EAAGF,UAAUuW,QAAU,WAErB,OADAhX,EAAOgB,KAAKI,IAAK,wDACVJ,KAAKI,IAAI6V,YAAYjW,OAG9BL,EAAGF,UAAUsW,UAAY,SAAoBF,GAE3C,OADA7V,KAAKI,IAAMyV,EACJ7V,MAGTL,EAAGF,UAAUyW,SAAW,SAAmBL,GAEzC,OADA7W,GAAQgB,KAAKI,IAAK,yCACXJ,KAAK+V,UAAUF,IAGxBlW,EAAGF,UAAU0W,OAAS,SAAiBtU,GAErC,OADA7C,EAAOgB,KAAKI,IAAK,sCACVJ,KAAKI,IAAImI,IAAIvI,KAAM6B,IAG5BlC,EAAGF,UAAU2W,QAAU,SAAkBvU,GAEvC,OADA7C,EAAOgB,KAAKI,IAAK,uCACVJ,KAAKI,IAAIiI,KAAKrI,KAAM6B,IAG7BlC,EAAGF,UAAU4W,OAAS,SAAiBxU,GAErC,OADA7C,EAAOgB,KAAKI,IAAK,sCACVJ,KAAKI,IAAIoI,IAAIxI,KAAM6B,IAG5BlC,EAAGF,UAAU6W,QAAU,SAAkBzU,GAEvC,OADA7C,EAAOgB,KAAKI,IAAK,uCACVJ,KAAKI,IAAIkI,KAAKtI,KAAM6B,IAG7BlC,EAAGF,UAAU8W,OAAS,SAAiB1U,GAErC,OADA7C,EAAOgB,KAAKI,IAAK,sCACVJ,KAAKI,IAAIoW,IAAIxW,KAAM6B,IAG5BlC,EAAGF,UAAUgX,OAAS,SAAiB5U,GAGrC,OAFA7C,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAIsW,SAAS1W,KAAM6B,GACjB7B,KAAKI,IAAIoB,IAAIxB,KAAM6B,IAG5BlC,EAAGF,UAAUkX,QAAU,SAAkB9U,GAGvC,OAFA7C,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAIsW,SAAS1W,KAAM6B,GACjB7B,KAAKI,IAAIoM,KAAKxM,KAAM6B,IAG7BlC,EAAGF,UAAUmX,OAAS,WAGpB,OAFA5X,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAIyW,SAAS7W,MACXA,KAAKI,IAAI+Q,IAAInR,OAGtBL,EAAGF,UAAUqX,QAAU,WAGrB,OAFA9X,EAAOgB,KAAKI,IAAK,uCACjBJ,KAAKI,IAAIyW,SAAS7W,MACXA,KAAKI,IAAIgR,KAAKpR,OAIvBL,EAAGF,UAAUsX,QAAU,WAGrB,OAFA/X,EAAOgB,KAAKI,IAAK,uCACjBJ,KAAKI,IAAIyW,SAAS7W,MACXA,KAAKI,IAAI4W,KAAKhX,OAGvBL,EAAGF,UAAUwX,QAAU,WAGrB,OAFAjY,EAAOgB,KAAKI,IAAK,uCACjBJ,KAAKI,IAAIyW,SAAS7W,MACXA,KAAKI,IAAI0U,KAAK9U,OAIvBL,EAAGF,UAAUyX,OAAS,WAGpB,OAFAlY,EAAOgB,KAAKI,IAAK,sCACjBJ,KAAKI,IAAIyW,SAAS7W,MACXA,KAAKI,IAAIiH,IAAIrH,OAGtBL,EAAGF,UAAU0X,OAAS,SAAiBtV,GAGrC,OAFA7C,EAAOgB,KAAKI,MAAQyB,EAAIzB,IAAK,qBAC7BJ,KAAKI,IAAIyW,SAAS7W,MACXA,KAAKI,IAAIoD,IAAIxD,KAAM6B,IAI5B,IAAIuV,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQC,EAAMnI,GAErBvP,KAAK0X,KAAOA,EACZ1X,KAAKuP,EAAI,IAAI5P,EAAG4P,EAAG,IACnBvP,KAAKgQ,EAAIhQ,KAAKuP,EAAEnL,YAChBpE,KAAK8E,EAAI,IAAInF,EAAG,GAAG0R,OAAOrR,KAAKgQ,GAAG1H,KAAKtI,KAAKuP,GAE5CvP,KAAK2X,IAAM3X,KAAK4X,OAiDlB,SAASC,IACPJ,EAAOK,KACL9X,KACA,OACA,2EA+DJ,SAAS+X,IACPN,EAAOK,KACL9X,KACA,OACA,kEAIJ,SAASgY,IACPP,EAAOK,KACL9X,KACA,OACA,yDAIJ,SAASiY,IAEPR,EAAOK,KACL9X,KACA,QACA,uEA8CJ,SAAS2V,EAAK1F,GACZ,GAAiB,kBAANA,EAAgB,CACzB,IAAIiI,EAAQvY,EAAGwY,OAAOlI,GACtBjQ,KAAKiQ,EAAIiI,EAAM3I,EACfvP,KAAKkY,MAAQA,OAEblZ,EAAOiR,EAAEgF,IAAI,GAAI,kCACjBjV,KAAKiQ,EAAIA,EACTjQ,KAAKkY,MAAQ,KAkOjB,SAASE,EAAMnI,GACb0F,EAAImC,KAAK9X,KAAMiQ,GAEfjQ,KAAK2S,MAAQ3S,KAAKiQ,EAAE7L,YAChBpE,KAAK2S,MAAQ,KAAO,IACtB3S,KAAK2S,OAAS,GAAM3S,KAAK2S,MAAQ,IAGnC3S,KAAKmB,EAAI,IAAIxB,EAAG,GAAG0R,OAAOrR,KAAK2S,OAC/B3S,KAAK0T,GAAK1T,KAAKqY,KAAKrY,KAAKmB,EAAEgQ,OAC3BnR,KAAKsY,KAAOtY,KAAKmB,EAAEsT,OAAOzU,KAAKiQ,GAE/BjQ,KAAKuY,KAAOvY,KAAKsY,KAAK9W,IAAIxB,KAAKmB,GAAGmR,MAAM,GAAGY,IAAIlT,KAAKiQ,GACpDjQ,KAAKuY,KAAOvY,KAAKuY,KAAKjF,KAAKtT,KAAKmB,GAChCnB,KAAKuY,KAAOvY,KAAKmB,EAAEqH,IAAIxI,KAAKuY,MA5a9Bd,EAAOhY,UAAUmY,KAAO,WACtB,IAAID,EAAM,IAAIhY,EAAG,MAEjB,OADAgY,EAAIzX,MAAQ,IAAI4B,MAAMJ,KAAKiB,KAAK3C,KAAKgQ,EAAI,KAClC2H,GAGTF,EAAOhY,UAAU+Y,QAAU,SAAkB3W,GAG3C,IACI4W,EADAtX,EAAIU,EAGR,GACE7B,KAAK0Y,MAAMvX,EAAGnB,KAAK2X,KACnBxW,EAAInB,KAAK2Y,MAAMxX,GACfA,EAAIA,EAAEkH,KAAKrI,KAAK2X,KAChBc,EAAOtX,EAAEiD,kBACFqU,EAAOzY,KAAKgQ,GAErB,IAAI7N,EAAMsW,EAAOzY,KAAKgQ,GAAK,EAAI7O,EAAE6T,KAAKhV,KAAKuP,GAgB3C,OAfY,IAARpN,GACFhB,EAAEjB,MAAM,GAAK,EACbiB,EAAEhB,OAAS,GACFgC,EAAM,EACfhB,EAAEmH,KAAKtI,KAAKuP,QAEIqJ,IAAZzX,EAAE4B,MAEJ5B,EAAE4B,QAGF5B,EAAE0X,SAIC1X,GAGTsW,EAAOhY,UAAUiZ,MAAQ,SAAgBI,EAAOrU,GAC9CqU,EAAM1S,OAAOpG,KAAKgQ,EAAG,EAAGvL,IAG1BgT,EAAOhY,UAAUkZ,MAAQ,SAAgB9W,GACvC,OAAOA,EAAI2K,KAAKxM,KAAK8E,IASvB1F,EAASyY,EAAMJ,GAEfI,EAAKpY,UAAUiZ,MAAQ,SAAgBI,EAAOC,GAK5C,IAHA,IAAIlH,EAAO,QAEPmH,EAAStX,KAAKC,IAAImX,EAAM3Y,OAAQ,GAC3ByB,EAAI,EAAGA,EAAIoX,EAAQpX,IAC1BmX,EAAO7Y,MAAM0B,GAAKkX,EAAM5Y,MAAM0B,GAIhC,GAFAmX,EAAO5Y,OAAS6Y,EAEZF,EAAM3Y,QAAU,EAGlB,OAFA2Y,EAAM5Y,MAAM,GAAK,OACjB4Y,EAAM3Y,OAAS,GAKjB,IAAI8Y,EAAOH,EAAM5Y,MAAM,GAGvB,IAFA6Y,EAAO7Y,MAAM6Y,EAAO5Y,UAAY8Y,EAAOpH,EAElCjQ,EAAI,GAAIA,EAAIkX,EAAM3Y,OAAQyB,IAAK,CAClC,IAAIsX,EAAwB,EAAjBJ,EAAM5Y,MAAM0B,GACvBkX,EAAM5Y,MAAM0B,EAAI,KAAQsX,EAAOrH,IAAS,EAAMoH,IAAS,GACvDA,EAAOC,EAETD,KAAU,GACVH,EAAM5Y,MAAM0B,EAAI,IAAMqX,EACT,IAATA,GAAcH,EAAM3Y,OAAS,GAC/B2Y,EAAM3Y,QAAU,GAEhB2Y,EAAM3Y,QAAU,GAIpB0X,EAAKpY,UAAUkZ,MAAQ,SAAgB9W,GAErCA,EAAI3B,MAAM2B,EAAI1B,QAAU,EACxB0B,EAAI3B,MAAM2B,EAAI1B,OAAS,GAAK,EAC5B0B,EAAI1B,QAAU,EAId,IADA,IAAIyE,EAAK,EACAhD,EAAI,EAAGA,EAAIC,EAAI1B,OAAQyB,IAAK,CACnC,IAAIiB,EAAmB,EAAfhB,EAAI3B,MAAM0B,GAClBgD,GAAU,IAAJ/B,EACNhB,EAAI3B,MAAM0B,GAAU,SAALgD,EACfA,EAAS,GAAJ/B,GAAa+B,EAAK,SAAa,GAUtC,OANkC,IAA9B/C,EAAI3B,MAAM2B,EAAI1B,OAAS,KACzB0B,EAAI1B,SAC8B,IAA9B0B,EAAI3B,MAAM2B,EAAI1B,OAAS,IACzB0B,EAAI1B,UAGD0B,GASTzC,EAAS2Y,EAAMN,GAQfrY,EAAS4Y,EAAMP,GASfrY,EAAS6Y,EAAQR,GAEjBQ,EAAOxY,UAAUkZ,MAAQ,SAAgB9W,GAGvC,IADA,IAAIgD,EAAQ,EACHjD,EAAI,EAAGA,EAAIC,EAAI1B,OAAQyB,IAAK,CACnC,IAAI6E,EAA0B,IAAL,EAAf5E,EAAI3B,MAAM0B,IAAiBiD,EACjCD,EAAU,SAAL6B,EACTA,KAAQ,GAER5E,EAAI3B,MAAM0B,GAAKgD,EACfC,EAAQ4B,EAKV,OAHc,IAAV5B,IACFhD,EAAI3B,MAAM2B,EAAI1B,UAAY0E,GAErBhD,GAITlC,EAAGwY,OAAS,SAAgBT,GAE1B,GAAIN,EAAOM,GAAO,OAAON,EAAOM,GAEhC,IAAIQ,EACJ,GAAa,SAATR,EACFQ,EAAQ,IAAIL,OACP,GAAa,SAATH,EACTQ,EAAQ,IAAIH,OACP,GAAa,SAATL,EACTQ,EAAQ,IAAIF,MACP,IAAa,WAATN,EAGT,MAAM,IAAIvY,MAAM,iBAAmBuY,GAFnCQ,EAAQ,IAAID,EAMd,OAFAb,EAAOM,GAAQQ,EAERA,GAkBTvC,EAAIlW,UAAUoX,SAAW,SAAmBnS,GAC1C1F,EAAsB,IAAf0F,EAAEzE,SAAgB,iCACzBjB,EAAO0F,EAAEtE,IAAK,oCAGhBuV,EAAIlW,UAAUiX,SAAW,SAAmBhS,EAAGC,GAC7C3F,EAAqC,KAA7B0F,EAAEzE,SAAW0E,EAAE1E,UAAiB,iCACxCjB,EAAO0F,EAAEtE,KAAOsE,EAAEtE,MAAQuE,EAAEvE,IAC1B,oCAGJuV,EAAIlW,UAAU4Y,KAAO,SAAe3T,GAClC,OAAI1E,KAAKkY,MAAclY,KAAKkY,MAAMM,QAAQ9T,GAAGqR,UAAU/V,MAChD0E,EAAE4O,KAAKtT,KAAKiQ,GAAG8F,UAAU/V,OAGlC2V,EAAIlW,UAAU4H,IAAM,SAAc3C,GAChC,OAAIA,EAAEW,SACGX,EAAEf,QAGJ3D,KAAKiQ,EAAEzH,IAAI9D,GAAGqR,UAAU/V,OAGjC2V,EAAIlW,UAAU8I,IAAM,SAAc7D,EAAGC,GACnC3E,KAAK0W,SAAShS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAE6D,IAAI5D,GAIhB,OAHIsB,EAAI9D,IAAInC,KAAKiQ,IAAM,GACrBhK,EAAIqC,KAAKtI,KAAKiQ,GAEThK,EAAI8P,UAAU/V,OAGvB2V,EAAIlW,UAAU4I,KAAO,SAAe3D,EAAGC,GACrC3E,KAAK0W,SAAShS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAE2D,KAAK1D,GAIjB,OAHIsB,EAAI9D,IAAInC,KAAKiQ,IAAM,GACrBhK,EAAIqC,KAAKtI,KAAKiQ,GAEThK,GAGT0P,EAAIlW,UAAU+I,IAAM,SAAc9D,EAAGC,GACnC3E,KAAK0W,SAAShS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAE8D,IAAI7D,GAIhB,OAHIsB,EAAI4O,KAAK,GAAK,GAChB5O,EAAIoC,KAAKrI,KAAKiQ,GAEThK,EAAI8P,UAAU/V,OAGvB2V,EAAIlW,UAAU6I,KAAO,SAAe5D,EAAGC,GACrC3E,KAAK0W,SAAShS,EAAGC,GAEjB,IAAIsB,EAAMvB,EAAE4D,KAAK3D,GAIjB,OAHIsB,EAAI4O,KAAK,GAAK,GAChB5O,EAAIoC,KAAKrI,KAAKiQ,GAEThK,GAGT0P,EAAIlW,UAAU+W,IAAM,SAAc9R,EAAG7C,GAEnC,OADA7B,KAAK6W,SAASnS,GACP1E,KAAKqY,KAAK3T,EAAEuN,MAAMpQ,KAG3B8T,EAAIlW,UAAU+M,KAAO,SAAe9H,EAAGC,GAErC,OADA3E,KAAK0W,SAAShS,EAAGC,GACV3E,KAAKqY,KAAK3T,EAAE8H,KAAK7H,KAG1BgR,EAAIlW,UAAU+B,IAAM,SAAckD,EAAGC,GAEnC,OADA3E,KAAK0W,SAAShS,EAAGC,GACV3E,KAAKqY,KAAK3T,EAAElD,IAAImD,KAGzBgR,EAAIlW,UAAU2R,KAAO,SAAe1M,GAClC,OAAO1E,KAAKwM,KAAK9H,EAAGA,EAAEf,UAGxBgS,EAAIlW,UAAU0R,IAAM,SAAczM,GAChC,OAAO1E,KAAKwB,IAAIkD,EAAGA,IAGrBiR,EAAIlW,UAAUuX,KAAO,SAAetS,GAClC,GAAIA,EAAEW,SAAU,OAAOX,EAAEf,QAEzB,IAAIwV,EAAOnZ,KAAKiQ,EAAE9J,MAAM,GAIxB,GAHAnH,EAAOma,EAAO,IAAM,GAGP,IAATA,EAAY,CACd,IAAI3V,EAAMxD,KAAKiQ,EAAE1H,IAAI,IAAI5I,EAAG,IAAIyG,OAAO,GACvC,OAAOpG,KAAKwD,IAAIkB,EAAGlB,GAMrB,IAAI0C,EAAIlG,KAAKiQ,EAAEuC,KAAK,GAChBvD,EAAI,EACR,OAAQ/I,EAAEb,UAA2B,IAAfa,EAAEC,MAAM,GAC5B8I,IACA/I,EAAEE,OAAO,GAEXpH,GAAQkH,EAAEb,UAEV,IAAI+T,EAAM,IAAIzZ,EAAG,GAAGiW,MAAM5V,MACtBqZ,EAAOD,EAAIlC,SAIXoC,EAAOtZ,KAAKiQ,EAAEuC,KAAK,GAAGpM,OAAO,GAC7BmT,EAAIvZ,KAAKiQ,EAAE7L,YACfmV,EAAI,IAAI5Z,EAAG,EAAI4Z,EAAIA,GAAG3D,MAAM5V,MAE5B,MAAuC,IAAhCA,KAAKwD,IAAI+V,EAAGD,GAAMnX,IAAIkX,GAC3BE,EAAEnD,QAAQiD,GAGZ,IAAItY,EAAIf,KAAKwD,IAAI+V,EAAGrT,GAChB/E,EAAInB,KAAKwD,IAAIkB,EAAGwB,EAAEqM,KAAK,GAAGnM,OAAO,IACjCG,EAAIvG,KAAKwD,IAAIkB,EAAGwB,GAChB+J,EAAIhB,EACR,MAAsB,IAAf1I,EAAEpE,IAAIiX,GAAY,CAEvB,IADA,IAAIzB,EAAMpR,EACD3E,EAAI,EAAoB,IAAjB+V,EAAIxV,IAAIiX,GAAYxX,IAClC+V,EAAMA,EAAIf,SAEZ5X,EAAO4C,EAAIqO,GACX,IAAItL,EAAI3E,KAAKwD,IAAIzC,EAAG,IAAIpB,EAAG,GAAG0R,OAAOpB,EAAIrO,EAAI,IAE7CT,EAAIA,EAAEsV,OAAO9R,GACb5D,EAAI4D,EAAEiS,SACNrQ,EAAIA,EAAEkQ,OAAO1V,GACbkP,EAAIrO,EAGN,OAAOT,GAGTwU,EAAIlW,UAAUqV,KAAO,SAAepQ,GAClC,IAAI8U,EAAM9U,EAAE+P,OAAOzU,KAAKiQ,GACxB,OAAqB,IAAjBuJ,EAAIvZ,UACNuZ,EAAIvZ,SAAW,EACRD,KAAKqY,KAAKmB,GAAKtC,UAEflX,KAAKqY,KAAKmB,IAIrB7D,EAAIlW,UAAU+D,IAAM,SAAckB,EAAG7C,GACnC,GAAIA,EAAIwD,SAAU,OAAO,IAAI1F,EAAG,GAAGiW,MAAM5V,MACzC,GAAoB,IAAhB6B,EAAIgT,KAAK,GAAU,OAAOnQ,EAAEf,QAEhC,IAAI8V,EAAa,EACbC,EAAM,IAAI5X,MAAM,GAAK2X,GACzBC,EAAI,GAAK,IAAI/Z,EAAG,GAAGiW,MAAM5V,MACzB0Z,EAAI,GAAKhV,EACT,IAAK,IAAI9C,EAAI,EAAGA,EAAI8X,EAAIvZ,OAAQyB,IAC9B8X,EAAI9X,GAAK5B,KAAKwB,IAAIkY,EAAI9X,EAAI,GAAI8C,GAGhC,IAAIuB,EAAMyT,EAAI,GACVC,EAAU,EACVC,EAAa,EACbtY,EAAQO,EAAIuC,YAAc,GAK9B,IAJc,IAAV9C,IACFA,EAAQ,IAGLM,EAAIC,EAAI1B,OAAS,EAAGyB,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAIyB,EAAOxB,EAAI3B,MAAM0B,GACZgB,EAAItB,EAAQ,EAAGsB,GAAK,EAAGA,IAAK,CACnC,IAAIyB,EAAOhB,GAAQT,EAAK,EACpBqD,IAAQyT,EAAI,KACdzT,EAAMjG,KAAKmR,IAAIlL,IAGL,IAAR5B,GAAyB,IAAZsV,GAKjBA,IAAY,EACZA,GAAWtV,EACXuV,KACIA,IAAeH,GAAqB,IAAN7X,GAAiB,IAANgB,KAE7CqD,EAAMjG,KAAKwB,IAAIyE,EAAKyT,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,EAajBtY,EAAQ,GAGV,OAAO2E,GAGT0P,EAAIlW,UAAUqW,UAAY,SAAoBjU,GAC5C,IAAIV,EAAIU,EAAIyR,KAAKtT,KAAKiQ,GAEtB,OAAO9O,IAAMU,EAAMV,EAAEwC,QAAUxC,GAGjCwU,EAAIlW,UAAUwW,YAAc,SAAsBpU,GAChD,IAAIoE,EAAMpE,EAAI8B,QAEd,OADAsC,EAAI7F,IAAM,KACH6F,GAOTtG,EAAGka,KAAO,SAAehY,GACvB,OAAO,IAAIuW,EAAKvW,IAmBlBzC,EAASgZ,EAAMzC,GAEfyC,EAAK3Y,UAAUqW,UAAY,SAAoBjU,GAC7C,OAAO7B,KAAKqY,KAAKxW,EAAIoQ,MAAMjS,KAAK2S,SAGlCyF,EAAK3Y,UAAUwW,YAAc,SAAsBpU,GACjD,IAAIV,EAAInB,KAAKqY,KAAKxW,EAAIL,IAAIxB,KAAKsY,OAE/B,OADAnX,EAAEf,IAAM,KACDe,GAGTiX,EAAK3Y,UAAU+M,KAAO,SAAe9H,EAAGC,GACtC,GAAID,EAAEW,UAAYV,EAAEU,SAGlB,OAFAX,EAAExE,MAAM,GAAK,EACbwE,EAAEvE,OAAS,EACJuE,EAGT,IAAI6B,EAAI7B,EAAE8H,KAAK7H,GACX5D,EAAIwF,EAAE8L,MAAMrS,KAAK2S,OAAOnR,IAAIxB,KAAKuY,MAAMnG,OAAOpS,KAAK2S,OAAOnR,IAAIxB,KAAKiQ,GACnE6J,EAAIvT,EAAE+B,KAAKvH,GAAGqF,OAAOpG,KAAK2S,OAC1B1M,EAAM6T,EAQV,OANIA,EAAE3X,IAAInC,KAAKiQ,IAAM,EACnBhK,EAAM6T,EAAExR,KAAKtI,KAAKiQ,GACT6J,EAAEjF,KAAK,GAAK,IACrB5O,EAAM6T,EAAEzR,KAAKrI,KAAKiQ,IAGbhK,EAAI8P,UAAU/V,OAGvBoY,EAAK3Y,UAAU+B,IAAM,SAAckD,EAAGC,GACpC,GAAID,EAAEW,UAAYV,EAAEU,SAAU,OAAO,IAAI1F,EAAG,GAAGoW,UAAU/V,MAEzD,IAAIuG,EAAI7B,EAAElD,IAAImD,GACV5D,EAAIwF,EAAE8L,MAAMrS,KAAK2S,OAAOnR,IAAIxB,KAAKuY,MAAMnG,OAAOpS,KAAK2S,OAAOnR,IAAIxB,KAAKiQ,GACnE6J,EAAIvT,EAAE+B,KAAKvH,GAAGqF,OAAOpG,KAAK2S,OAC1B1M,EAAM6T,EAOV,OANIA,EAAE3X,IAAInC,KAAKiQ,IAAM,EACnBhK,EAAM6T,EAAExR,KAAKtI,KAAKiQ,GACT6J,EAAEjF,KAAK,GAAK,IACrB5O,EAAM6T,EAAEzR,KAAKrI,KAAKiQ,IAGbhK,EAAI8P,UAAU/V,OAGvBoY,EAAK3Y,UAAUqV,KAAO,SAAepQ,GAEnC,IAAIuB,EAAMjG,KAAKqY,KAAK3T,EAAE+P,OAAOzU,KAAKiQ,GAAGzO,IAAIxB,KAAK0T,KAC9C,OAAOzN,EAAI8P,UAAU/V,QAn3GzB,CAq3GoCO,EAAQP,Q,gDCr3G5C,IAAI+Z,EAAY,EAAQ,QACpBC,EAAM,EAAQ,QACdhS,EAAM,EAAQ,QACdrI,EAAK,EAAQ,QACbsa,EAAM,EAAQ,QACdC,EAAa,EAAQ,QACrBC,EAAa,EAAQ,QACrB7Z,EAAS,EAAQ,QAAeA,OAoCpC,SAAS8Z,EAAMC,EAAKnb,GAClB,IAAI4F,EAAIuV,EAAIC,QAAQxU,aAChByU,EAAQL,EAAW,QAAQM,OAAOla,EAAOma,MAAM,IAAIC,SACnDC,EAAOJ,EAAMpa,OACjB,GAAe,IAAXjB,EAAI,GACN,MAAM,IAAIC,MAAM,oBAElB,IAAIyb,EAAa1b,EAAI2b,MAAM,EAAGF,EAAO,GACjCG,EAAW5b,EAAI2b,MAAMF,EAAO,GAC5BI,EAAO/S,EAAI4S,EAAYZ,EAAIc,EAAUH,IACrCK,EAAKhT,EAAI8S,EAAUd,EAAIe,EAAMjW,EAAI6V,EAAO,IAC5C,GAAIM,EAAQV,EAAOS,EAAGH,MAAM,EAAGF,IAC7B,MAAM,IAAIxb,MAAM,oBAElB,IAAIyC,EAAI+Y,EACR,MAAiB,IAAVK,EAAGpZ,GACRA,IAEF,GAAgB,IAAZoZ,EAAGpZ,KACL,MAAM,IAAIzC,MAAM,oBAElB,OAAO6b,EAAGH,MAAMjZ,GAGlB,SAASsZ,EAAOb,EAAKnb,EAAKic,GACxB,IAAIC,EAAKlc,EAAI2b,MAAM,EAAG,GAClBjZ,EAAI,EACJyZ,EAAS,EACb,MAAoB,IAAbnc,EAAI0C,KACT,GAAIA,GAAK1C,EAAIiB,OAAQ,CACnBkb,IACA,MAGJ,IAAIC,EAAKpc,EAAI2b,MAAM,EAAGjZ,EAAI,GAQ1B,IAN4B,SAAvBwZ,EAAG9Y,SAAS,SAAsB6Y,GAAoC,SAAvBC,EAAG9Y,SAAS,QAAqB6Y,IACnFE,IAEEC,EAAGnb,OAAS,GACdkb,IAEEA,EACF,MAAM,IAAIlc,MAAM,oBAElB,OAAOD,EAAI2b,MAAMjZ,GAEnB,SAASqZ,EAASvW,EAAGC,GACnBD,EAAIpE,EAAOib,KAAK7W,GAChBC,EAAIrE,EAAOib,KAAK5W,GAChB,IAAI6W,EAAM,EACN/Z,EAAMiD,EAAEvE,OACRuE,EAAEvE,SAAWwE,EAAExE,SACjBqb,IACA/Z,EAAMC,KAAKC,IAAI+C,EAAEvE,OAAQwE,EAAExE,SAE7B,IAAIyB,GAAK,EACT,QAASA,EAAIH,EACX+Z,GAAQ9W,EAAE9C,GAAK+C,EAAE/C,GAEnB,OAAO4Z,EA9FTjb,EAAOC,QAAU,SAAyBib,EAAYC,EAAKP,GACzD,IAAIjW,EAEFA,EADEuW,EAAWvW,QACHuW,EAAWvW,QACZiW,EACC,EAEA,EAGZ,IAKIjc,EALAmb,EAAMN,EAAU0B,GAChB3W,EAAIuV,EAAIC,QAAQxU,aACpB,GAAI4V,EAAIvb,OAAS2E,GAAK,IAAInF,EAAG+b,GAAKvZ,IAAIkY,EAAIC,UAAY,EACpD,MAAM,IAAInb,MAAM,oBAIhBD,EADEic,EACIhB,EAAW,IAAIxa,EAAG+b,GAAMrB,GAExBJ,EAAIyB,EAAKrB,GAEjB,IAAIsB,EAAUrb,EAAOma,MAAM3V,EAAI5F,EAAIiB,QAEnC,GADAjB,EAAMoB,EAAOsb,OAAO,CAACD,EAASzc,GAAM4F,GACpB,IAAZI,EACF,OAAOkV,EAAKC,EAAKnb,GACZ,GAAgB,IAAZgG,EACT,OAAOgW,EAAMb,EAAKnb,EAAKic,GAClB,GAAgB,IAAZjW,EACT,OAAOhG,EAEP,MAAM,IAAIC,MAAM,qB,qBCvCpB,IAAIQ,EAAK,EAAQ,QACbW,EAAS,EAAQ,QAAeA,OAEpC,SAAS6Z,EAAY0B,EAAWxB,GAC9B,OAAO/Z,EAAOib,KAAKM,EAChBjG,MAAMjW,EAAGka,KAAKQ,EAAIC,UAClBnD,OAAO,IAAIxX,EAAG0a,EAAIyB,iBAClB9F,UACAtT,WAGLnC,EAAOC,QAAU2Z,G,qBCXjB3Z,EAAQub,cAAgB,EAAQ,QAChCvb,EAAQwb,eAAiB,EAAQ,QAEjCxb,EAAQyb,eAAiB,SAAyB5B,EAAK6B,GACrD,OAAO1b,EAAQub,cAAc1B,EAAK6B,GAAK,IAGzC1b,EAAQ2b,cAAgB,SAAwB9B,EAAK6B,GACnD,OAAO1b,EAAQwb,eAAe3B,EAAK6B,GAAK,K,qBCR1C3b,EAAOC,QAAU,SAAckE,EAAGC,GAChC,IAAIlD,EAAMiD,EAAEvE,OACRyB,GAAK,EACT,QAASA,EAAIH,EACXiD,EAAE9C,IAAM+C,EAAE/C,GAEZ,OAAO8C,I,qBCNT,IAAIqV,EAAY,EAAQ,QACpBqC,EAAc,EAAQ,QACtBlC,EAAa,EAAQ,QACrBF,EAAM,EAAQ,QACdhS,EAAM,EAAQ,QACdrI,EAAK,EAAQ,QACbwa,EAAa,EAAQ,QACrBF,EAAM,EAAQ,QACd3Z,EAAS,EAAQ,QAAeA,OAgCpC,SAAS8Z,EAAMC,EAAKnb,GAClB,IAAI4F,EAAIuV,EAAIC,QAAQxU,aAChBuW,EAAOnd,EAAIiB,OACXoa,EAAQL,EAAW,QAAQM,OAAOla,EAAOma,MAAM,IAAIC,SACnDC,EAAOJ,EAAMpa,OACbmc,EAAQ,EAAI3B,EAChB,GAAI0B,EAAOvX,EAAIwX,EAAQ,EACrB,MAAM,IAAInd,MAAM,oBAElB,IAAImc,EAAKhb,EAAOma,MAAM3V,EAAIuX,EAAOC,EAAQ,GACrCC,EAAQzX,EAAI6V,EAAO,EACnBI,EAAOqB,EAAYzB,GACnBG,EAAW9S,EAAI1H,EAAOsb,OAAO,CAACrB,EAAOe,EAAIhb,EAAOma,MAAM,EAAG,GAAIvb,GAAMqd,GAAQvC,EAAIe,EAAMwB,IACrF3B,EAAa5S,EAAI+S,EAAMf,EAAIc,EAAUH,IACzC,OAAO,IAAIhb,EAAGW,EAAOsb,OAAO,CAACtb,EAAOma,MAAM,GAAIG,EAAYE,GAAWhW,IAEvE,SAASoW,EAAOb,EAAKnb,EAAKic,GACxB,IAKIG,EALAe,EAAOnd,EAAIiB,OACX2E,EAAIuV,EAAIC,QAAQxU,aACpB,GAAIuW,EAAOvX,EAAI,GACb,MAAM,IAAI3F,MAAM,oBAQlB,OAJEmc,EADEH,EACG7a,EAAOma,MAAM3V,EAAIuX,EAAO,EAAG,KAE3BG,EAAQ1X,EAAIuX,EAAO,GAEnB,IAAI1c,EAAGW,EAAOsb,OAAO,CAACtb,EAAOib,KAAK,CAAC,EAAGJ,EAAU,EAAI,IAAKG,EAAIhb,EAAOma,MAAM,GAAIvb,GAAM4F,IAE7F,SAAS0X,EAAS/a,GAChB,IAIII,EAJA4C,EAAMnE,EAAOmc,YAAYhb,GACzBG,EAAI,EACJ8a,EAAQN,EAAkB,EAAN3a,GACpBkb,EAAM,EAEV,MAAO/a,EAAIH,EACLkb,IAAQD,EAAMvc,SAChBuc,EAAQN,EAAkB,EAAN3a,GACpBkb,EAAM,GAER9a,EAAM6a,EAAMC,KACR9a,IACF4C,EAAI7C,KAAOC,GAGf,OAAO4C,EA5ETlE,EAAOC,QAAU,SAAwBoc,EAAW1d,EAAKic,GACvD,IAAIjW,EAEFA,EADE0X,EAAU1X,QACF0X,EAAU1X,QACXiW,EACC,EAEA,EAEZ,IACIU,EADAxB,EAAMN,EAAU6C,GAEpB,GAAgB,IAAZ1X,EACF2W,EAAYzB,EAAKC,EAAKnb,QACjB,GAAgB,IAAZgG,EACT2W,EAAYX,EAAMb,EAAKnb,EAAKic,OACvB,IAAgB,IAAZjW,EAMT,MAAM,IAAI/F,MAAM,mBAJhB,GADA0c,EAAY,IAAIlc,EAAGT,GACf2c,EAAU1Z,IAAIkY,EAAIC,UAAY,EAChC,MAAM,IAAInb,MAAM,6BAKpB,OAAIgc,EACKlB,EAAI4B,EAAWxB,GAEfF,EAAW0B,EAAWxB,K,qBCpCjC,IAAIH,EAAa,EAAQ,QACrB5Z,EAAS,EAAQ,QAAeA,OAapC,SAASuc,EAAO9b,GACd,IAAI0D,EAAMnE,EAAOmc,YAAY,GAE7B,OADAhY,EAAIqY,cAAc/b,EAAG,GACd0D,EAdTlE,EAAOC,QAAU,SAAUua,EAAMtZ,GAC/B,IAEIV,EAFAwF,EAAIjG,EAAOma,MAAM,GACjB7Y,EAAI,EAER,MAAO2E,EAAEpG,OAASsB,EAChBV,EAAI8b,EAAMjb,KACV2E,EAAIjG,EAAOsb,OAAO,CAACrV,EAAG2T,EAAW,QAAQM,OAAOO,GAAMP,OAAOzZ,GAAG2Z,WAElE,OAAOnU,EAAEsU,MAAM,EAAGpZ","file":"js/account~2f944d6a.f48fd8f7.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\n    this.negative = 0;\n    this.words = null;\n    this.length = 0;\n\n    // Reduction context\n    this.red = null;\n\n    if (number !== null) {\n      if (base === 'le' || base === 'be') {\n        endian = base;\n        base = 10;\n      }\n\n      this._init(number || 0, base || 10, endian || 'be');\n    }\n  }\n  if (typeof module === 'object') {\n    module.exports = BN;\n  } else {\n    exports.BN = BN;\n  }\n\n  BN.BN = BN;\n  BN.wordSize = 26;\n\n  var Buffer;\n  try {\n    if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n      Buffer = window.Buffer;\n    } else {\n      Buffer = require('buffer').Buffer;\n    }\n  } catch (e) {\n  }\n\n  BN.isBN = function isBN (num) {\n    if (num instanceof BN) {\n      return true;\n    }\n\n    return num !== null && typeof num === 'object' &&\n      num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n  };\n\n  BN.max = function max (left, right) {\n    if (left.cmp(right) > 0) return left;\n    return right;\n  };\n\n  BN.min = function min (left, right) {\n    if (left.cmp(right) < 0) return left;\n    return right;\n  };\n\n  BN.prototype._init = function init (number, base, endian) {\n    if (typeof number === 'number') {\n      return this._initNumber(number, base, endian);\n    }\n\n    if (typeof number === 'object') {\n      return this._initArray(number, base, endian);\n    }\n\n    if (base === 'hex') {\n      base = 16;\n    }\n    assert(base === (base | 0) && base >= 2 && base <= 36);\n\n    number = number.toString().replace(/\\s+/g, '');\n    var start = 0;\n    if (number[0] === '-') {\n      start++;\n      this.negative = 1;\n    }\n\n    if (start < number.length) {\n      if (base === 16) {\n        this._parseHex(number, start, endian);\n      } else {\n        this._parseBase(number, base, start);\n        if (endian === 'le') {\n          this._initArray(this.toArray(), base, endian);\n        }\n      }\n    }\n  };\n\n  BN.prototype._initNumber = function _initNumber (number, base, endian) {\n    if (number < 0) {\n      this.negative = 1;\n      number = -number;\n    }\n    if (number < 0x4000000) {\n      this.words = [ number & 0x3ffffff ];\n      this.length = 1;\n    } else if (number < 0x10000000000000) {\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff\n      ];\n      this.length = 2;\n    } else {\n      assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff,\n        1\n      ];\n      this.length = 3;\n    }\n\n    if (endian !== 'le') return;\n\n    // Reverse the bytes\n    this._initArray(this.toArray(), base, endian);\n  };\n\n  BN.prototype._initArray = function _initArray (number, base, endian) {\n    // Perhaps a Uint8Array\n    assert(typeof number.length === 'number');\n    if (number.length <= 0) {\n      this.words = [ 0 ];\n      this.length = 1;\n      return this;\n    }\n\n    this.length = Math.ceil(number.length / 3);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    var j, w;\n    var off = 0;\n    if (endian === 'be') {\n      for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n        w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    } else if (endian === 'le') {\n      for (i = 0, j = 0; i < number.length; i += 3) {\n        w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    }\n    return this.strip();\n  };\n\n  function parseHex4Bits (string, index) {\n    var c = string.charCodeAt(index);\n    // 'A' - 'F'\n    if (c >= 65 && c <= 70) {\n      return c - 55;\n    // 'a' - 'f'\n    } else if (c >= 97 && c <= 102) {\n      return c - 87;\n    // '0' - '9'\n    } else {\n      return (c - 48) & 0xf;\n    }\n  }\n\n  function parseHexByte (string, lowerBound, index) {\n    var r = parseHex4Bits(string, index);\n    if (index - 1 >= lowerBound) {\n      r |= parseHex4Bits(string, index - 1) << 4;\n    }\n    return r;\n  }\n\n  BN.prototype._parseHex = function _parseHex (number, start, endian) {\n    // Create possibly bigger array to ensure that it fits the number\n    this.length = Math.ceil((number.length - start) / 6);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    // 24-bits chunks\n    var off = 0;\n    var j = 0;\n\n    var w;\n    if (endian === 'be') {\n      for (i = number.length - 1; i >= start; i -= 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    } else {\n      var parseLength = number.length - start;\n      for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    }\n\n    this.strip();\n  };\n\n  function parseBase (str, start, end, mul) {\n    var r = 0;\n    var len = Math.min(str.length, end);\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r *= mul;\n\n      // 'a'\n      if (c >= 49) {\n        r += c - 49 + 0xa;\n\n      // 'A'\n      } else if (c >= 17) {\n        r += c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        r += c;\n      }\n    }\n    return r;\n  }\n\n  BN.prototype._parseBase = function _parseBase (number, base, start) {\n    // Initialize as zero\n    this.words = [ 0 ];\n    this.length = 1;\n\n    // Find length of limb in base\n    for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n      limbLen++;\n    }\n    limbLen--;\n    limbPow = (limbPow / base) | 0;\n\n    var total = number.length - start;\n    var mod = total % limbLen;\n    var end = Math.min(total, total - mod) + start;\n\n    var word = 0;\n    for (var i = start; i < end; i += limbLen) {\n      word = parseBase(number, i, i + limbLen, base);\n\n      this.imuln(limbPow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    if (mod !== 0) {\n      var pow = 1;\n      word = parseBase(number, i, number.length, base);\n\n      for (i = 0; i < mod; i++) {\n        pow *= base;\n      }\n\n      this.imuln(pow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    this.strip();\n  };\n\n  BN.prototype.copy = function copy (dest) {\n    dest.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      dest.words[i] = this.words[i];\n    }\n    dest.length = this.length;\n    dest.negative = this.negative;\n    dest.red = this.red;\n  };\n\n  BN.prototype.clone = function clone () {\n    var r = new BN(null);\n    this.copy(r);\n    return r;\n  };\n\n  BN.prototype._expand = function _expand (size) {\n    while (this.length < size) {\n      this.words[this.length++] = 0;\n    }\n    return this;\n  };\n\n  // Remove leading `0` from `this`\n  BN.prototype.strip = function strip () {\n    while (this.length > 1 && this.words[this.length - 1] === 0) {\n      this.length--;\n    }\n    return this._normSign();\n  };\n\n  BN.prototype._normSign = function _normSign () {\n    // -0 = 0\n    if (this.length === 1 && this.words[0] === 0) {\n      this.negative = 0;\n    }\n    return this;\n  };\n\n  BN.prototype.inspect = function inspect () {\n    return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n  };\n\n  /*\n\n  var zeros = [];\n  var groupSizes = [];\n  var groupBases = [];\n\n  var s = '';\n  var i = -1;\n  while (++i < BN.wordSize) {\n    zeros[i] = s;\n    s += '0';\n  }\n  groupSizes[0] = 0;\n  groupSizes[1] = 0;\n  groupBases[0] = 0;\n  groupBases[1] = 0;\n  var base = 2 - 1;\n  while (++base < 36 + 1) {\n    var groupSize = 0;\n    var groupBase = 1;\n    while (groupBase < (1 << BN.wordSize) / base) {\n      groupBase *= base;\n      groupSize += 1;\n    }\n    groupSizes[base] = groupSize;\n    groupBases[base] = groupBase;\n  }\n\n  */\n\n  var zeros = [\n    '',\n    '0',\n    '00',\n    '000',\n    '0000',\n    '00000',\n    '000000',\n    '0000000',\n    '00000000',\n    '000000000',\n    '0000000000',\n    '00000000000',\n    '000000000000',\n    '0000000000000',\n    '00000000000000',\n    '000000000000000',\n    '0000000000000000',\n    '00000000000000000',\n    '000000000000000000',\n    '0000000000000000000',\n    '00000000000000000000',\n    '000000000000000000000',\n    '0000000000000000000000',\n    '00000000000000000000000',\n    '000000000000000000000000',\n    '0000000000000000000000000'\n  ];\n\n  var groupSizes = [\n    0, 0,\n    25, 16, 12, 11, 10, 9, 8,\n    8, 7, 7, 7, 7, 6, 6,\n    6, 6, 6, 6, 6, 5, 5,\n    5, 5, 5, 5, 5, 5, 5,\n    5, 5, 5, 5, 5, 5, 5\n  ];\n\n  var groupBases = [\n    0, 0,\n    33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n    43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n    16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n    6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n    24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n  ];\n\n  BN.prototype.toString = function toString (base, padding) {\n    base = base || 10;\n    padding = padding | 0 || 1;\n\n    var out;\n    if (base === 16 || base === 'hex') {\n      out = '';\n      var off = 0;\n      var carry = 0;\n      for (var i = 0; i < this.length; i++) {\n        var w = this.words[i];\n        var word = (((w << off) | carry) & 0xffffff).toString(16);\n        carry = (w >>> (24 - off)) & 0xffffff;\n        if (carry !== 0 || i !== this.length - 1) {\n          out = zeros[6 - word.length] + word + out;\n        } else {\n          out = word + out;\n        }\n        off += 2;\n        if (off >= 26) {\n          off -= 26;\n          i--;\n        }\n      }\n      if (carry !== 0) {\n        out = carry.toString(16) + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    if (base === (base | 0) && base >= 2 && base <= 36) {\n      // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n      var groupSize = groupSizes[base];\n      // var groupBase = Math.pow(base, groupSize);\n      var groupBase = groupBases[base];\n      out = '';\n      var c = this.clone();\n      c.negative = 0;\n      while (!c.isZero()) {\n        var r = c.modn(groupBase).toString(base);\n        c = c.idivn(groupBase);\n\n        if (!c.isZero()) {\n          out = zeros[groupSize - r.length] + r + out;\n        } else {\n          out = r + out;\n        }\n      }\n      if (this.isZero()) {\n        out = '0' + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    assert(false, 'Base should be between 2 and 36');\n  };\n\n  BN.prototype.toNumber = function toNumber () {\n    var ret = this.words[0];\n    if (this.length === 2) {\n      ret += this.words[1] * 0x4000000;\n    } else if (this.length === 3 && this.words[2] === 0x01) {\n      // NOTE: at this stage it is known that the top bit is set\n      ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n    } else if (this.length > 2) {\n      assert(false, 'Number can only safely store up to 53 bits');\n    }\n    return (this.negative !== 0) ? -ret : ret;\n  };\n\n  BN.prototype.toJSON = function toJSON () {\n    return this.toString(16);\n  };\n\n  BN.prototype.toBuffer = function toBuffer (endian, length) {\n    assert(typeof Buffer !== 'undefined');\n    return this.toArrayLike(Buffer, endian, length);\n  };\n\n  BN.prototype.toArray = function toArray (endian, length) {\n    return this.toArrayLike(Array, endian, length);\n  };\n\n  BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n    var byteLength = this.byteLength();\n    var reqLength = length || Math.max(1, byteLength);\n    assert(byteLength <= reqLength, 'byte array longer than desired length');\n    assert(reqLength > 0, 'Requested array length <= 0');\n\n    this.strip();\n    var littleEndian = endian === 'le';\n    var res = new ArrayType(reqLength);\n\n    var b, i;\n    var q = this.clone();\n    if (!littleEndian) {\n      // Assume big-endian\n      for (i = 0; i < reqLength - byteLength; i++) {\n        res[i] = 0;\n      }\n\n      for (i = 0; !q.isZero(); i++) {\n        b = q.andln(0xff);\n        q.iushrn(8);\n\n        res[reqLength - i - 1] = b;\n      }\n    } else {\n      for (i = 0; !q.isZero(); i++) {\n        b = q.andln(0xff);\n        q.iushrn(8);\n\n        res[i] = b;\n      }\n\n      for (; i < reqLength; i++) {\n        res[i] = 0;\n      }\n    }\n\n    return res;\n  };\n\n  if (Math.clz32) {\n    BN.prototype._countBits = function _countBits (w) {\n      return 32 - Math.clz32(w);\n    };\n  } else {\n    BN.prototype._countBits = function _countBits (w) {\n      var t = w;\n      var r = 0;\n      if (t >= 0x1000) {\n        r += 13;\n        t >>>= 13;\n      }\n      if (t >= 0x40) {\n        r += 7;\n        t >>>= 7;\n      }\n      if (t >= 0x8) {\n        r += 4;\n        t >>>= 4;\n      }\n      if (t >= 0x02) {\n        r += 2;\n        t >>>= 2;\n      }\n      return r + t;\n    };\n  }\n\n  BN.prototype._zeroBits = function _zeroBits (w) {\n    // Short-cut\n    if (w === 0) return 26;\n\n    var t = w;\n    var r = 0;\n    if ((t & 0x1fff) === 0) {\n      r += 13;\n      t >>>= 13;\n    }\n    if ((t & 0x7f) === 0) {\n      r += 7;\n      t >>>= 7;\n    }\n    if ((t & 0xf) === 0) {\n      r += 4;\n      t >>>= 4;\n    }\n    if ((t & 0x3) === 0) {\n      r += 2;\n      t >>>= 2;\n    }\n    if ((t & 0x1) === 0) {\n      r++;\n    }\n    return r;\n  };\n\n  // Return number of used bits in a BN\n  BN.prototype.bitLength = function bitLength () {\n    var w = this.words[this.length - 1];\n    var hi = this._countBits(w);\n    return (this.length - 1) * 26 + hi;\n  };\n\n  function toBitArray (num) {\n    var w = new Array(num.bitLength());\n\n    for (var bit = 0; bit < w.length; bit++) {\n      var off = (bit / 26) | 0;\n      var wbit = bit % 26;\n\n      w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n    }\n\n    return w;\n  }\n\n  // Number of trailing zero bits\n  BN.prototype.zeroBits = function zeroBits () {\n    if (this.isZero()) return 0;\n\n    var r = 0;\n    for (var i = 0; i < this.length; i++) {\n      var b = this._zeroBits(this.words[i]);\n      r += b;\n      if (b !== 26) break;\n    }\n    return r;\n  };\n\n  BN.prototype.byteLength = function byteLength () {\n    return Math.ceil(this.bitLength() / 8);\n  };\n\n  BN.prototype.toTwos = function toTwos (width) {\n    if (this.negative !== 0) {\n      return this.abs().inotn(width).iaddn(1);\n    }\n    return this.clone();\n  };\n\n  BN.prototype.fromTwos = function fromTwos (width) {\n    if (this.testn(width - 1)) {\n      return this.notn(width).iaddn(1).ineg();\n    }\n    return this.clone();\n  };\n\n  BN.prototype.isNeg = function isNeg () {\n    return this.negative !== 0;\n  };\n\n  // Return negative clone of `this`\n  BN.prototype.neg = function neg () {\n    return this.clone().ineg();\n  };\n\n  BN.prototype.ineg = function ineg () {\n    if (!this.isZero()) {\n      this.negative ^= 1;\n    }\n\n    return this;\n  };\n\n  // Or `num` with `this` in-place\n  BN.prototype.iuor = function iuor (num) {\n    while (this.length < num.length) {\n      this.words[this.length++] = 0;\n    }\n\n    for (var i = 0; i < num.length; i++) {\n      this.words[i] = this.words[i] | num.words[i];\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ior = function ior (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuor(num);\n  };\n\n  // Or `num` with `this`\n  BN.prototype.or = function or (num) {\n    if (this.length > num.length) return this.clone().ior(num);\n    return num.clone().ior(this);\n  };\n\n  BN.prototype.uor = function uor (num) {\n    if (this.length > num.length) return this.clone().iuor(num);\n    return num.clone().iuor(this);\n  };\n\n  // And `num` with `this` in-place\n  BN.prototype.iuand = function iuand (num) {\n    // b = min-length(num, this)\n    var b;\n    if (this.length > num.length) {\n      b = num;\n    } else {\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = this.words[i] & num.words[i];\n    }\n\n    this.length = b.length;\n\n    return this.strip();\n  };\n\n  BN.prototype.iand = function iand (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuand(num);\n  };\n\n  // And `num` with `this`\n  BN.prototype.and = function and (num) {\n    if (this.length > num.length) return this.clone().iand(num);\n    return num.clone().iand(this);\n  };\n\n  BN.prototype.uand = function uand (num) {\n    if (this.length > num.length) return this.clone().iuand(num);\n    return num.clone().iuand(this);\n  };\n\n  // Xor `num` with `this` in-place\n  BN.prototype.iuxor = function iuxor (num) {\n    // a.length > b.length\n    var a;\n    var b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = a.words[i] ^ b.words[i];\n    }\n\n    if (this !== a) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = a.length;\n\n    return this.strip();\n  };\n\n  BN.prototype.ixor = function ixor (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuxor(num);\n  };\n\n  // Xor `num` with `this`\n  BN.prototype.xor = function xor (num) {\n    if (this.length > num.length) return this.clone().ixor(num);\n    return num.clone().ixor(this);\n  };\n\n  BN.prototype.uxor = function uxor (num) {\n    if (this.length > num.length) return this.clone().iuxor(num);\n    return num.clone().iuxor(this);\n  };\n\n  // Not ``this`` with ``width`` bitwidth\n  BN.prototype.inotn = function inotn (width) {\n    assert(typeof width === 'number' && width >= 0);\n\n    var bytesNeeded = Math.ceil(width / 26) | 0;\n    var bitsLeft = width % 26;\n\n    // Extend the buffer with leading zeroes\n    this._expand(bytesNeeded);\n\n    if (bitsLeft > 0) {\n      bytesNeeded--;\n    }\n\n    // Handle complete words\n    for (var i = 0; i < bytesNeeded; i++) {\n      this.words[i] = ~this.words[i] & 0x3ffffff;\n    }\n\n    // Handle the residue\n    if (bitsLeft > 0) {\n      this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n    }\n\n    // And remove leading zeroes\n    return this.strip();\n  };\n\n  BN.prototype.notn = function notn (width) {\n    return this.clone().inotn(width);\n  };\n\n  // Set `bit` of `this`\n  BN.prototype.setn = function setn (bit, val) {\n    assert(typeof bit === 'number' && bit >= 0);\n\n    var off = (bit / 26) | 0;\n    var wbit = bit % 26;\n\n    this._expand(off + 1);\n\n    if (val) {\n      this.words[off] = this.words[off] | (1 << wbit);\n    } else {\n      this.words[off] = this.words[off] & ~(1 << wbit);\n    }\n\n    return this.strip();\n  };\n\n  // Add `num` to `this` in-place\n  BN.prototype.iadd = function iadd (num) {\n    var r;\n\n    // negative + positive\n    if (this.negative !== 0 && num.negative === 0) {\n      this.negative = 0;\n      r = this.isub(num);\n      this.negative ^= 1;\n      return this._normSign();\n\n    // positive + negative\n    } else if (this.negative === 0 && num.negative !== 0) {\n      num.negative = 0;\n      r = this.isub(num);\n      num.negative = 1;\n      return r._normSign();\n    }\n\n    // a.length > b.length\n    var a, b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n\n    this.length = a.length;\n    if (carry !== 0) {\n      this.words[this.length] = carry;\n      this.length++;\n    // Copy the rest of the words\n    } else if (a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    return this;\n  };\n\n  // Add `num` to `this`\n  BN.prototype.add = function add (num) {\n    var res;\n    if (num.negative !== 0 && this.negative === 0) {\n      num.negative = 0;\n      res = this.sub(num);\n      num.negative ^= 1;\n      return res;\n    } else if (num.negative === 0 && this.negative !== 0) {\n      this.negative = 0;\n      res = num.sub(this);\n      this.negative = 1;\n      return res;\n    }\n\n    if (this.length > num.length) return this.clone().iadd(num);\n\n    return num.clone().iadd(this);\n  };\n\n  // Subtract `num` from `this` in-place\n  BN.prototype.isub = function isub (num) {\n    // this - (-num) = this + num\n    if (num.negative !== 0) {\n      num.negative = 0;\n      var r = this.iadd(num);\n      num.negative = 1;\n      return r._normSign();\n\n    // -this - num = -(this + num)\n    } else if (this.negative !== 0) {\n      this.negative = 0;\n      this.iadd(num);\n      this.negative = 1;\n      return this._normSign();\n    }\n\n    // At this point both numbers are positive\n    var cmp = this.cmp(num);\n\n    // Optimization - zeroify\n    if (cmp === 0) {\n      this.negative = 0;\n      this.length = 1;\n      this.words[0] = 0;\n      return this;\n    }\n\n    // a > b\n    var a, b;\n    if (cmp > 0) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n\n    // Copy rest of the words\n    if (carry === 0 && i < a.length && a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = Math.max(this.length, i);\n\n    if (a !== this) {\n      this.negative = 1;\n    }\n\n    return this.strip();\n  };\n\n  // Subtract `num` from `this`\n  BN.prototype.sub = function sub (num) {\n    return this.clone().isub(num);\n  };\n\n  function smallMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    var len = (self.length + num.length) | 0;\n    out.length = len;\n    len = (len - 1) | 0;\n\n    // Peel one iteration (compiler can't do it, because of code complexity)\n    var a = self.words[0] | 0;\n    var b = num.words[0] | 0;\n    var r = a * b;\n\n    var lo = r & 0x3ffffff;\n    var carry = (r / 0x4000000) | 0;\n    out.words[0] = lo;\n\n    for (var k = 1; k < len; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = carry >>> 26;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = (k - j) | 0;\n        a = self.words[i] | 0;\n        b = num.words[j] | 0;\n        r = a * b + rword;\n        ncarry += (r / 0x4000000) | 0;\n        rword = r & 0x3ffffff;\n      }\n      out.words[k] = rword | 0;\n      carry = ncarry | 0;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry | 0;\n    } else {\n      out.length--;\n    }\n\n    return out.strip();\n  }\n\n  // TODO(indutny): it may be reasonable to omit it for users who don't need\n  // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n  // multiplication (like elliptic secp256k1).\n  var comb10MulTo = function comb10MulTo (self, num, out) {\n    var a = self.words;\n    var b = num.words;\n    var o = out.words;\n    var c = 0;\n    var lo;\n    var mid;\n    var hi;\n    var a0 = a[0] | 0;\n    var al0 = a0 & 0x1fff;\n    var ah0 = a0 >>> 13;\n    var a1 = a[1] | 0;\n    var al1 = a1 & 0x1fff;\n    var ah1 = a1 >>> 13;\n    var a2 = a[2] | 0;\n    var al2 = a2 & 0x1fff;\n    var ah2 = a2 >>> 13;\n    var a3 = a[3] | 0;\n    var al3 = a3 & 0x1fff;\n    var ah3 = a3 >>> 13;\n    var a4 = a[4] | 0;\n    var al4 = a4 & 0x1fff;\n    var ah4 = a4 >>> 13;\n    var a5 = a[5] | 0;\n    var al5 = a5 & 0x1fff;\n    var ah5 = a5 >>> 13;\n    var a6 = a[6] | 0;\n    var al6 = a6 & 0x1fff;\n    var ah6 = a6 >>> 13;\n    var a7 = a[7] | 0;\n    var al7 = a7 & 0x1fff;\n    var ah7 = a7 >>> 13;\n    var a8 = a[8] | 0;\n    var al8 = a8 & 0x1fff;\n    var ah8 = a8 >>> 13;\n    var a9 = a[9] | 0;\n    var al9 = a9 & 0x1fff;\n    var ah9 = a9 >>> 13;\n    var b0 = b[0] | 0;\n    var bl0 = b0 & 0x1fff;\n    var bh0 = b0 >>> 13;\n    var b1 = b[1] | 0;\n    var bl1 = b1 & 0x1fff;\n    var bh1 = b1 >>> 13;\n    var b2 = b[2] | 0;\n    var bl2 = b2 & 0x1fff;\n    var bh2 = b2 >>> 13;\n    var b3 = b[3] | 0;\n    var bl3 = b3 & 0x1fff;\n    var bh3 = b3 >>> 13;\n    var b4 = b[4] | 0;\n    var bl4 = b4 & 0x1fff;\n    var bh4 = b4 >>> 13;\n    var b5 = b[5] | 0;\n    var bl5 = b5 & 0x1fff;\n    var bh5 = b5 >>> 13;\n    var b6 = b[6] | 0;\n    var bl6 = b6 & 0x1fff;\n    var bh6 = b6 >>> 13;\n    var b7 = b[7] | 0;\n    var bl7 = b7 & 0x1fff;\n    var bh7 = b7 >>> 13;\n    var b8 = b[8] | 0;\n    var bl8 = b8 & 0x1fff;\n    var bh8 = b8 >>> 13;\n    var b9 = b[9] | 0;\n    var bl9 = b9 & 0x1fff;\n    var bh9 = b9 >>> 13;\n\n    out.negative = self.negative ^ num.negative;\n    out.length = 19;\n    /* k = 0 */\n    lo = Math.imul(al0, bl0);\n    mid = Math.imul(al0, bh0);\n    mid = (mid + Math.imul(ah0, bl0)) | 0;\n    hi = Math.imul(ah0, bh0);\n    var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n    w0 &= 0x3ffffff;\n    /* k = 1 */\n    lo = Math.imul(al1, bl0);\n    mid = Math.imul(al1, bh0);\n    mid = (mid + Math.imul(ah1, bl0)) | 0;\n    hi = Math.imul(ah1, bh0);\n    lo = (lo + Math.imul(al0, bl1)) | 0;\n    mid = (mid + Math.imul(al0, bh1)) | 0;\n    mid = (mid + Math.imul(ah0, bl1)) | 0;\n    hi = (hi + Math.imul(ah0, bh1)) | 0;\n    var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n    w1 &= 0x3ffffff;\n    /* k = 2 */\n    lo = Math.imul(al2, bl0);\n    mid = Math.imul(al2, bh0);\n    mid = (mid + Math.imul(ah2, bl0)) | 0;\n    hi = Math.imul(ah2, bh0);\n    lo = (lo + Math.imul(al1, bl1)) | 0;\n    mid = (mid + Math.imul(al1, bh1)) | 0;\n    mid = (mid + Math.imul(ah1, bl1)) | 0;\n    hi = (hi + Math.imul(ah1, bh1)) | 0;\n    lo = (lo + Math.imul(al0, bl2)) | 0;\n    mid = (mid + Math.imul(al0, bh2)) | 0;\n    mid = (mid + Math.imul(ah0, bl2)) | 0;\n    hi = (hi + Math.imul(ah0, bh2)) | 0;\n    var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n    w2 &= 0x3ffffff;\n    /* k = 3 */\n    lo = Math.imul(al3, bl0);\n    mid = Math.imul(al3, bh0);\n    mid = (mid + Math.imul(ah3, bl0)) | 0;\n    hi = Math.imul(ah3, bh0);\n    lo = (lo + Math.imul(al2, bl1)) | 0;\n    mid = (mid + Math.imul(al2, bh1)) | 0;\n    mid = (mid + Math.imul(ah2, bl1)) | 0;\n    hi = (hi + Math.imul(ah2, bh1)) | 0;\n    lo = (lo + Math.imul(al1, bl2)) | 0;\n    mid = (mid + Math.imul(al1, bh2)) | 0;\n    mid = (mid + Math.imul(ah1, bl2)) | 0;\n    hi = (hi + Math.imul(ah1, bh2)) | 0;\n    lo = (lo + Math.imul(al0, bl3)) | 0;\n    mid = (mid + Math.imul(al0, bh3)) | 0;\n    mid = (mid + Math.imul(ah0, bl3)) | 0;\n    hi = (hi + Math.imul(ah0, bh3)) | 0;\n    var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n    w3 &= 0x3ffffff;\n    /* k = 4 */\n    lo = Math.imul(al4, bl0);\n    mid = Math.imul(al4, bh0);\n    mid = (mid + Math.imul(ah4, bl0)) | 0;\n    hi = Math.imul(ah4, bh0);\n    lo = (lo + Math.imul(al3, bl1)) | 0;\n    mid = (mid + Math.imul(al3, bh1)) | 0;\n    mid = (mid + Math.imul(ah3, bl1)) | 0;\n    hi = (hi + Math.imul(ah3, bh1)) | 0;\n    lo = (lo + Math.imul(al2, bl2)) | 0;\n    mid = (mid + Math.imul(al2, bh2)) | 0;\n    mid = (mid + Math.imul(ah2, bl2)) | 0;\n    hi = (hi + Math.imul(ah2, bh2)) | 0;\n    lo = (lo + Math.imul(al1, bl3)) | 0;\n    mid = (mid + Math.imul(al1, bh3)) | 0;\n    mid = (mid + Math.imul(ah1, bl3)) | 0;\n    hi = (hi + Math.imul(ah1, bh3)) | 0;\n    lo = (lo + Math.imul(al0, bl4)) | 0;\n    mid = (mid + Math.imul(al0, bh4)) | 0;\n    mid = (mid + Math.imul(ah0, bl4)) | 0;\n    hi = (hi + Math.imul(ah0, bh4)) | 0;\n    var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n    w4 &= 0x3ffffff;\n    /* k = 5 */\n    lo = Math.imul(al5, bl0);\n    mid = Math.imul(al5, bh0);\n    mid = (mid + Math.imul(ah5, bl0)) | 0;\n    hi = Math.imul(ah5, bh0);\n    lo = (lo + Math.imul(al4, bl1)) | 0;\n    mid = (mid + Math.imul(al4, bh1)) | 0;\n    mid = (mid + Math.imul(ah4, bl1)) | 0;\n    hi = (hi + Math.imul(ah4, bh1)) | 0;\n    lo = (lo + Math.imul(al3, bl2)) | 0;\n    mid = (mid + Math.imul(al3, bh2)) | 0;\n    mid = (mid + Math.imul(ah3, bl2)) | 0;\n    hi = (hi + Math.imul(ah3, bh2)) | 0;\n    lo = (lo + Math.imul(al2, bl3)) | 0;\n    mid = (mid + Math.imul(al2, bh3)) | 0;\n    mid = (mid + Math.imul(ah2, bl3)) | 0;\n    hi = (hi + Math.imul(ah2, bh3)) | 0;\n    lo = (lo + Math.imul(al1, bl4)) | 0;\n    mid = (mid + Math.imul(al1, bh4)) | 0;\n    mid = (mid + Math.imul(ah1, bl4)) | 0;\n    hi = (hi + Math.imul(ah1, bh4)) | 0;\n    lo = (lo + Math.imul(al0, bl5)) | 0;\n    mid = (mid + Math.imul(al0, bh5)) | 0;\n    mid = (mid + Math.imul(ah0, bl5)) | 0;\n    hi = (hi + Math.imul(ah0, bh5)) | 0;\n    var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n    w5 &= 0x3ffffff;\n    /* k = 6 */\n    lo = Math.imul(al6, bl0);\n    mid = Math.imul(al6, bh0);\n    mid = (mid + Math.imul(ah6, bl0)) | 0;\n    hi = Math.imul(ah6, bh0);\n    lo = (lo + Math.imul(al5, bl1)) | 0;\n    mid = (mid + Math.imul(al5, bh1)) | 0;\n    mid = (mid + Math.imul(ah5, bl1)) | 0;\n    hi = (hi + Math.imul(ah5, bh1)) | 0;\n    lo = (lo + Math.imul(al4, bl2)) | 0;\n    mid = (mid + Math.imul(al4, bh2)) | 0;\n    mid = (mid + Math.imul(ah4, bl2)) | 0;\n    hi = (hi + Math.imul(ah4, bh2)) | 0;\n    lo = (lo + Math.imul(al3, bl3)) | 0;\n    mid = (mid + Math.imul(al3, bh3)) | 0;\n    mid = (mid + Math.imul(ah3, bl3)) | 0;\n    hi = (hi + Math.imul(ah3, bh3)) | 0;\n    lo = (lo + Math.imul(al2, bl4)) | 0;\n    mid = (mid + Math.imul(al2, bh4)) | 0;\n    mid = (mid + Math.imul(ah2, bl4)) | 0;\n    hi = (hi + Math.imul(ah2, bh4)) | 0;\n    lo = (lo + Math.imul(al1, bl5)) | 0;\n    mid = (mid + Math.imul(al1, bh5)) | 0;\n    mid = (mid + Math.imul(ah1, bl5)) | 0;\n    hi = (hi + Math.imul(ah1, bh5)) | 0;\n    lo = (lo + Math.imul(al0, bl6)) | 0;\n    mid = (mid + Math.imul(al0, bh6)) | 0;\n    mid = (mid + Math.imul(ah0, bl6)) | 0;\n    hi = (hi + Math.imul(ah0, bh6)) | 0;\n    var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n    w6 &= 0x3ffffff;\n    /* k = 7 */\n    lo = Math.imul(al7, bl0);\n    mid = Math.imul(al7, bh0);\n    mid = (mid + Math.imul(ah7, bl0)) | 0;\n    hi = Math.imul(ah7, bh0);\n    lo = (lo + Math.imul(al6, bl1)) | 0;\n    mid = (mid + Math.imul(al6, bh1)) | 0;\n    mid = (mid + Math.imul(ah6, bl1)) | 0;\n    hi = (hi + Math.imul(ah6, bh1)) | 0;\n    lo = (lo + Math.imul(al5, bl2)) | 0;\n    mid = (mid + Math.imul(al5, bh2)) | 0;\n    mid = (mid + Math.imul(ah5, bl2)) | 0;\n    hi = (hi + Math.imul(ah5, bh2)) | 0;\n    lo = (lo + Math.imul(al4, bl3)) | 0;\n    mid = (mid + Math.imul(al4, bh3)) | 0;\n    mid = (mid + Math.imul(ah4, bl3)) | 0;\n    hi = (hi + Math.imul(ah4, bh3)) | 0;\n    lo = (lo + Math.imul(al3, bl4)) | 0;\n    mid = (mid + Math.imul(al3, bh4)) | 0;\n    mid = (mid + Math.imul(ah3, bl4)) | 0;\n    hi = (hi + Math.imul(ah3, bh4)) | 0;\n    lo = (lo + Math.imul(al2, bl5)) | 0;\n    mid = (mid + Math.imul(al2, bh5)) | 0;\n    mid = (mid + Math.imul(ah2, bl5)) | 0;\n    hi = (hi + Math.imul(ah2, bh5)) | 0;\n    lo = (lo + Math.imul(al1, bl6)) | 0;\n    mid = (mid + Math.imul(al1, bh6)) | 0;\n    mid = (mid + Math.imul(ah1, bl6)) | 0;\n    hi = (hi + Math.imul(ah1, bh6)) | 0;\n    lo = (lo + Math.imul(al0, bl7)) | 0;\n    mid = (mid + Math.imul(al0, bh7)) | 0;\n    mid = (mid + Math.imul(ah0, bl7)) | 0;\n    hi = (hi + Math.imul(ah0, bh7)) | 0;\n    var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n    w7 &= 0x3ffffff;\n    /* k = 8 */\n    lo = Math.imul(al8, bl0);\n    mid = Math.imul(al8, bh0);\n    mid = (mid + Math.imul(ah8, bl0)) | 0;\n    hi = Math.imul(ah8, bh0);\n    lo = (lo + Math.imul(al7, bl1)) | 0;\n    mid = (mid + Math.imul(al7, bh1)) | 0;\n    mid = (mid + Math.imul(ah7, bl1)) | 0;\n    hi = (hi + Math.imul(ah7, bh1)) | 0;\n    lo = (lo + Math.imul(al6, bl2)) | 0;\n    mid = (mid + Math.imul(al6, bh2)) | 0;\n    mid = (mid + Math.imul(ah6, bl2)) | 0;\n    hi = (hi + Math.imul(ah6, bh2)) | 0;\n    lo = (lo + Math.imul(al5, bl3)) | 0;\n    mid = (mid + Math.imul(al5, bh3)) | 0;\n    mid = (mid + Math.imul(ah5, bl3)) | 0;\n    hi = (hi + Math.imul(ah5, bh3)) | 0;\n    lo = (lo + Math.imul(al4, bl4)) | 0;\n    mid = (mid + Math.imul(al4, bh4)) | 0;\n    mid = (mid + Math.imul(ah4, bl4)) | 0;\n    hi = (hi + Math.imul(ah4, bh4)) | 0;\n    lo = (lo + Math.imul(al3, bl5)) | 0;\n    mid = (mid + Math.imul(al3, bh5)) | 0;\n    mid = (mid + Math.imul(ah3, bl5)) | 0;\n    hi = (hi + Math.imul(ah3, bh5)) | 0;\n    lo = (lo + Math.imul(al2, bl6)) | 0;\n    mid = (mid + Math.imul(al2, bh6)) | 0;\n    mid = (mid + Math.imul(ah2, bl6)) | 0;\n    hi = (hi + Math.imul(ah2, bh6)) | 0;\n    lo = (lo + Math.imul(al1, bl7)) | 0;\n    mid = (mid + Math.imul(al1, bh7)) | 0;\n    mid = (mid + Math.imul(ah1, bl7)) | 0;\n    hi = (hi + Math.imul(ah1, bh7)) | 0;\n    lo = (lo + Math.imul(al0, bl8)) | 0;\n    mid = (mid + Math.imul(al0, bh8)) | 0;\n    mid = (mid + Math.imul(ah0, bl8)) | 0;\n    hi = (hi + Math.imul(ah0, bh8)) | 0;\n    var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n    w8 &= 0x3ffffff;\n    /* k = 9 */\n    lo = Math.imul(al9, bl0);\n    mid = Math.imul(al9, bh0);\n    mid = (mid + Math.imul(ah9, bl0)) | 0;\n    hi = Math.imul(ah9, bh0);\n    lo = (lo + Math.imul(al8, bl1)) | 0;\n    mid = (mid + Math.imul(al8, bh1)) | 0;\n    mid = (mid + Math.imul(ah8, bl1)) | 0;\n    hi = (hi + Math.imul(ah8, bh1)) | 0;\n    lo = (lo + Math.imul(al7, bl2)) | 0;\n    mid = (mid + Math.imul(al7, bh2)) | 0;\n    mid = (mid + Math.imul(ah7, bl2)) | 0;\n    hi = (hi + Math.imul(ah7, bh2)) | 0;\n    lo = (lo + Math.imul(al6, bl3)) | 0;\n    mid = (mid + Math.imul(al6, bh3)) | 0;\n    mid = (mid + Math.imul(ah6, bl3)) | 0;\n    hi = (hi + Math.imul(ah6, bh3)) | 0;\n    lo = (lo + Math.imul(al5, bl4)) | 0;\n    mid = (mid + Math.imul(al5, bh4)) | 0;\n    mid = (mid + Math.imul(ah5, bl4)) | 0;\n    hi = (hi + Math.imul(ah5, bh4)) | 0;\n    lo = (lo + Math.imul(al4, bl5)) | 0;\n    mid = (mid + Math.imul(al4, bh5)) | 0;\n    mid = (mid + Math.imul(ah4, bl5)) | 0;\n    hi = (hi + Math.imul(ah4, bh5)) | 0;\n    lo = (lo + Math.imul(al3, bl6)) | 0;\n    mid = (mid + Math.imul(al3, bh6)) | 0;\n    mid = (mid + Math.imul(ah3, bl6)) | 0;\n    hi = (hi + Math.imul(ah3, bh6)) | 0;\n    lo = (lo + Math.imul(al2, bl7)) | 0;\n    mid = (mid + Math.imul(al2, bh7)) | 0;\n    mid = (mid + Math.imul(ah2, bl7)) | 0;\n    hi = (hi + Math.imul(ah2, bh7)) | 0;\n    lo = (lo + Math.imul(al1, bl8)) | 0;\n    mid = (mid + Math.imul(al1, bh8)) | 0;\n    mid = (mid + Math.imul(ah1, bl8)) | 0;\n    hi = (hi + Math.imul(ah1, bh8)) | 0;\n    lo = (lo + Math.imul(al0, bl9)) | 0;\n    mid = (mid + Math.imul(al0, bh9)) | 0;\n    mid = (mid + Math.imul(ah0, bl9)) | 0;\n    hi = (hi + Math.imul(ah0, bh9)) | 0;\n    var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n    w9 &= 0x3ffffff;\n    /* k = 10 */\n    lo = Math.imul(al9, bl1);\n    mid = Math.imul(al9, bh1);\n    mid = (mid + Math.imul(ah9, bl1)) | 0;\n    hi = Math.imul(ah9, bh1);\n    lo = (lo + Math.imul(al8, bl2)) | 0;\n    mid = (mid + Math.imul(al8, bh2)) | 0;\n    mid = (mid + Math.imul(ah8, bl2)) | 0;\n    hi = (hi + Math.imul(ah8, bh2)) | 0;\n    lo = (lo + Math.imul(al7, bl3)) | 0;\n    mid = (mid + Math.imul(al7, bh3)) | 0;\n    mid = (mid + Math.imul(ah7, bl3)) | 0;\n    hi = (hi + Math.imul(ah7, bh3)) | 0;\n    lo = (lo + Math.imul(al6, bl4)) | 0;\n    mid = (mid + Math.imul(al6, bh4)) | 0;\n    mid = (mid + Math.imul(ah6, bl4)) | 0;\n    hi = (hi + Math.imul(ah6, bh4)) | 0;\n    lo = (lo + Math.imul(al5, bl5)) | 0;\n    mid = (mid + Math.imul(al5, bh5)) | 0;\n    mid = (mid + Math.imul(ah5, bl5)) | 0;\n    hi = (hi + Math.imul(ah5, bh5)) | 0;\n    lo = (lo + Math.imul(al4, bl6)) | 0;\n    mid = (mid + Math.imul(al4, bh6)) | 0;\n    mid = (mid + Math.imul(ah4, bl6)) | 0;\n    hi = (hi + Math.imul(ah4, bh6)) | 0;\n    lo = (lo + Math.imul(al3, bl7)) | 0;\n    mid = (mid + Math.imul(al3, bh7)) | 0;\n    mid = (mid + Math.imul(ah3, bl7)) | 0;\n    hi = (hi + Math.imul(ah3, bh7)) | 0;\n    lo = (lo + Math.imul(al2, bl8)) | 0;\n    mid = (mid + Math.imul(al2, bh8)) | 0;\n    mid = (mid + Math.imul(ah2, bl8)) | 0;\n    hi = (hi + Math.imul(ah2, bh8)) | 0;\n    lo = (lo + Math.imul(al1, bl9)) | 0;\n    mid = (mid + Math.imul(al1, bh9)) | 0;\n    mid = (mid + Math.imul(ah1, bl9)) | 0;\n    hi = (hi + Math.imul(ah1, bh9)) | 0;\n    var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n    w10 &= 0x3ffffff;\n    /* k = 11 */\n    lo = Math.imul(al9, bl2);\n    mid = Math.imul(al9, bh2);\n    mid = (mid + Math.imul(ah9, bl2)) | 0;\n    hi = Math.imul(ah9, bh2);\n    lo = (lo + Math.imul(al8, bl3)) | 0;\n    mid = (mid + Math.imul(al8, bh3)) | 0;\n    mid = (mid + Math.imul(ah8, bl3)) | 0;\n    hi = (hi + Math.imul(ah8, bh3)) | 0;\n    lo = (lo + Math.imul(al7, bl4)) | 0;\n    mid = (mid + Math.imul(al7, bh4)) | 0;\n    mid = (mid + Math.imul(ah7, bl4)) | 0;\n    hi = (hi + Math.imul(ah7, bh4)) | 0;\n    lo = (lo + Math.imul(al6, bl5)) | 0;\n    mid = (mid + Math.imul(al6, bh5)) | 0;\n    mid = (mid + Math.imul(ah6, bl5)) | 0;\n    hi = (hi + Math.imul(ah6, bh5)) | 0;\n    lo = (lo + Math.imul(al5, bl6)) | 0;\n    mid = (mid + Math.imul(al5, bh6)) | 0;\n    mid = (mid + Math.imul(ah5, bl6)) | 0;\n    hi = (hi + Math.imul(ah5, bh6)) | 0;\n    lo = (lo + Math.imul(al4, bl7)) | 0;\n    mid = (mid + Math.imul(al4, bh7)) | 0;\n    mid = (mid + Math.imul(ah4, bl7)) | 0;\n    hi = (hi + Math.imul(ah4, bh7)) | 0;\n    lo = (lo + Math.imul(al3, bl8)) | 0;\n    mid = (mid + Math.imul(al3, bh8)) | 0;\n    mid = (mid + Math.imul(ah3, bl8)) | 0;\n    hi = (hi + Math.imul(ah3, bh8)) | 0;\n    lo = (lo + Math.imul(al2, bl9)) | 0;\n    mid = (mid + Math.imul(al2, bh9)) | 0;\n    mid = (mid + Math.imul(ah2, bl9)) | 0;\n    hi = (hi + Math.imul(ah2, bh9)) | 0;\n    var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n    w11 &= 0x3ffffff;\n    /* k = 12 */\n    lo = Math.imul(al9, bl3);\n    mid = Math.imul(al9, bh3);\n    mid = (mid + Math.imul(ah9, bl3)) | 0;\n    hi = Math.imul(ah9, bh3);\n    lo = (lo + Math.imul(al8, bl4)) | 0;\n    mid = (mid + Math.imul(al8, bh4)) | 0;\n    mid = (mid + Math.imul(ah8, bl4)) | 0;\n    hi = (hi + Math.imul(ah8, bh4)) | 0;\n    lo = (lo + Math.imul(al7, bl5)) | 0;\n    mid = (mid + Math.imul(al7, bh5)) | 0;\n    mid = (mid + Math.imul(ah7, bl5)) | 0;\n    hi = (hi + Math.imul(ah7, bh5)) | 0;\n    lo = (lo + Math.imul(al6, bl6)) | 0;\n    mid = (mid + Math.imul(al6, bh6)) | 0;\n    mid = (mid + Math.imul(ah6, bl6)) | 0;\n    hi = (hi + Math.imul(ah6, bh6)) | 0;\n    lo = (lo + Math.imul(al5, bl7)) | 0;\n    mid = (mid + Math.imul(al5, bh7)) | 0;\n    mid = (mid + Math.imul(ah5, bl7)) | 0;\n    hi = (hi + Math.imul(ah5, bh7)) | 0;\n    lo = (lo + Math.imul(al4, bl8)) | 0;\n    mid = (mid + Math.imul(al4, bh8)) | 0;\n    mid = (mid + Math.imul(ah4, bl8)) | 0;\n    hi = (hi + Math.imul(ah4, bh8)) | 0;\n    lo = (lo + Math.imul(al3, bl9)) | 0;\n    mid = (mid + Math.imul(al3, bh9)) | 0;\n    mid = (mid + Math.imul(ah3, bl9)) | 0;\n    hi = (hi + Math.imul(ah3, bh9)) | 0;\n    var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n    w12 &= 0x3ffffff;\n    /* k = 13 */\n    lo = Math.imul(al9, bl4);\n    mid = Math.imul(al9, bh4);\n    mid = (mid + Math.imul(ah9, bl4)) | 0;\n    hi = Math.imul(ah9, bh4);\n    lo = (lo + Math.imul(al8, bl5)) | 0;\n    mid = (mid + Math.imul(al8, bh5)) | 0;\n    mid = (mid + Math.imul(ah8, bl5)) | 0;\n    hi = (hi + Math.imul(ah8, bh5)) | 0;\n    lo = (lo + Math.imul(al7, bl6)) | 0;\n    mid = (mid + Math.imul(al7, bh6)) | 0;\n    mid = (mid + Math.imul(ah7, bl6)) | 0;\n    hi = (hi + Math.imul(ah7, bh6)) | 0;\n    lo = (lo + Math.imul(al6, bl7)) | 0;\n    mid = (mid + Math.imul(al6, bh7)) | 0;\n    mid = (mid + Math.imul(ah6, bl7)) | 0;\n    hi = (hi + Math.imul(ah6, bh7)) | 0;\n    lo = (lo + Math.imul(al5, bl8)) | 0;\n    mid = (mid + Math.imul(al5, bh8)) | 0;\n    mid = (mid + Math.imul(ah5, bl8)) | 0;\n    hi = (hi + Math.imul(ah5, bh8)) | 0;\n    lo = (lo + Math.imul(al4, bl9)) | 0;\n    mid = (mid + Math.imul(al4, bh9)) | 0;\n    mid = (mid + Math.imul(ah4, bl9)) | 0;\n    hi = (hi + Math.imul(ah4, bh9)) | 0;\n    var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n    w13 &= 0x3ffffff;\n    /* k = 14 */\n    lo = Math.imul(al9, bl5);\n    mid = Math.imul(al9, bh5);\n    mid = (mid + Math.imul(ah9, bl5)) | 0;\n    hi = Math.imul(ah9, bh5);\n    lo = (lo + Math.imul(al8, bl6)) | 0;\n    mid = (mid + Math.imul(al8, bh6)) | 0;\n    mid = (mid + Math.imul(ah8, bl6)) | 0;\n    hi = (hi + Math.imul(ah8, bh6)) | 0;\n    lo = (lo + Math.imul(al7, bl7)) | 0;\n    mid = (mid + Math.imul(al7, bh7)) | 0;\n    mid = (mid + Math.imul(ah7, bl7)) | 0;\n    hi = (hi + Math.imul(ah7, bh7)) | 0;\n    lo = (lo + Math.imul(al6, bl8)) | 0;\n    mid = (mid + Math.imul(al6, bh8)) | 0;\n    mid = (mid + Math.imul(ah6, bl8)) | 0;\n    hi = (hi + Math.imul(ah6, bh8)) | 0;\n    lo = (lo + Math.imul(al5, bl9)) | 0;\n    mid = (mid + Math.imul(al5, bh9)) | 0;\n    mid = (mid + Math.imul(ah5, bl9)) | 0;\n    hi = (hi + Math.imul(ah5, bh9)) | 0;\n    var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n    w14 &= 0x3ffffff;\n    /* k = 15 */\n    lo = Math.imul(al9, bl6);\n    mid = Math.imul(al9, bh6);\n    mid = (mid + Math.imul(ah9, bl6)) | 0;\n    hi = Math.imul(ah9, bh6);\n    lo = (lo + Math.imul(al8, bl7)) | 0;\n    mid = (mid + Math.imul(al8, bh7)) | 0;\n    mid = (mid + Math.imul(ah8, bl7)) | 0;\n    hi = (hi + Math.imul(ah8, bh7)) | 0;\n    lo = (lo + Math.imul(al7, bl8)) | 0;\n    mid = (mid + Math.imul(al7, bh8)) | 0;\n    mid = (mid + Math.imul(ah7, bl8)) | 0;\n    hi = (hi + Math.imul(ah7, bh8)) | 0;\n    lo = (lo + Math.imul(al6, bl9)) | 0;\n    mid = (mid + Math.imul(al6, bh9)) | 0;\n    mid = (mid + Math.imul(ah6, bl9)) | 0;\n    hi = (hi + Math.imul(ah6, bh9)) | 0;\n    var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n    w15 &= 0x3ffffff;\n    /* k = 16 */\n    lo = Math.imul(al9, bl7);\n    mid = Math.imul(al9, bh7);\n    mid = (mid + Math.imul(ah9, bl7)) | 0;\n    hi = Math.imul(ah9, bh7);\n    lo = (lo + Math.imul(al8, bl8)) | 0;\n    mid = (mid + Math.imul(al8, bh8)) | 0;\n    mid = (mid + Math.imul(ah8, bl8)) | 0;\n    hi = (hi + Math.imul(ah8, bh8)) | 0;\n    lo = (lo + Math.imul(al7, bl9)) | 0;\n    mid = (mid + Math.imul(al7, bh9)) | 0;\n    mid = (mid + Math.imul(ah7, bl9)) | 0;\n    hi = (hi + Math.imul(ah7, bh9)) | 0;\n    var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n    w16 &= 0x3ffffff;\n    /* k = 17 */\n    lo = Math.imul(al9, bl8);\n    mid = Math.imul(al9, bh8);\n    mid = (mid + Math.imul(ah9, bl8)) | 0;\n    hi = Math.imul(ah9, bh8);\n    lo = (lo + Math.imul(al8, bl9)) | 0;\n    mid = (mid + Math.imul(al8, bh9)) | 0;\n    mid = (mid + Math.imul(ah8, bl9)) | 0;\n    hi = (hi + Math.imul(ah8, bh9)) | 0;\n    var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n    w17 &= 0x3ffffff;\n    /* k = 18 */\n    lo = Math.imul(al9, bl9);\n    mid = Math.imul(al9, bh9);\n    mid = (mid + Math.imul(ah9, bl9)) | 0;\n    hi = Math.imul(ah9, bh9);\n    var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n    w18 &= 0x3ffffff;\n    o[0] = w0;\n    o[1] = w1;\n    o[2] = w2;\n    o[3] = w3;\n    o[4] = w4;\n    o[5] = w5;\n    o[6] = w6;\n    o[7] = w7;\n    o[8] = w8;\n    o[9] = w9;\n    o[10] = w10;\n    o[11] = w11;\n    o[12] = w12;\n    o[13] = w13;\n    o[14] = w14;\n    o[15] = w15;\n    o[16] = w16;\n    o[17] = w17;\n    o[18] = w18;\n    if (c !== 0) {\n      o[19] = c;\n      out.length++;\n    }\n    return out;\n  };\n\n  // Polyfill comb\n  if (!Math.imul) {\n    comb10MulTo = smallMulTo;\n  }\n\n  function bigMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    out.length = self.length + num.length;\n\n    var carry = 0;\n    var hncarry = 0;\n    for (var k = 0; k < out.length - 1; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = hncarry;\n      hncarry = 0;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = k - j;\n        var a = self.words[i] | 0;\n        var b = num.words[j] | 0;\n        var r = a * b;\n\n        var lo = r & 0x3ffffff;\n        ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n        lo = (lo + rword) | 0;\n        rword = lo & 0x3ffffff;\n        ncarry = (ncarry + (lo >>> 26)) | 0;\n\n        hncarry += ncarry >>> 26;\n        ncarry &= 0x3ffffff;\n      }\n      out.words[k] = rword;\n      carry = ncarry;\n      ncarry = hncarry;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry;\n    } else {\n      out.length--;\n    }\n\n    return out.strip();\n  }\n\n  function jumboMulTo (self, num, out) {\n    var fftm = new FFTM();\n    return fftm.mulp(self, num, out);\n  }\n\n  BN.prototype.mulTo = function mulTo (num, out) {\n    var res;\n    var len = this.length + num.length;\n    if (this.length === 10 && num.length === 10) {\n      res = comb10MulTo(this, num, out);\n    } else if (len < 63) {\n      res = smallMulTo(this, num, out);\n    } else if (len < 1024) {\n      res = bigMulTo(this, num, out);\n    } else {\n      res = jumboMulTo(this, num, out);\n    }\n\n    return res;\n  };\n\n  // Cooley-Tukey algorithm for FFT\n  // slightly revisited to rely on looping instead of recursion\n\n  function FFTM (x, y) {\n    this.x = x;\n    this.y = y;\n  }\n\n  FFTM.prototype.makeRBT = function makeRBT (N) {\n    var t = new Array(N);\n    var l = BN.prototype._countBits(N) - 1;\n    for (var i = 0; i < N; i++) {\n      t[i] = this.revBin(i, l, N);\n    }\n\n    return t;\n  };\n\n  // Returns binary-reversed representation of `x`\n  FFTM.prototype.revBin = function revBin (x, l, N) {\n    if (x === 0 || x === N - 1) return x;\n\n    var rb = 0;\n    for (var i = 0; i < l; i++) {\n      rb |= (x & 1) << (l - i - 1);\n      x >>= 1;\n    }\n\n    return rb;\n  };\n\n  // Performs \"tweedling\" phase, therefore 'emulating'\n  // behaviour of the recursive algorithm\n  FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n    for (var i = 0; i < N; i++) {\n      rtws[i] = rws[rbt[i]];\n      itws[i] = iws[rbt[i]];\n    }\n  };\n\n  FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n    this.permute(rbt, rws, iws, rtws, itws, N);\n\n    for (var s = 1; s < N; s <<= 1) {\n      var l = s << 1;\n\n      var rtwdf = Math.cos(2 * Math.PI / l);\n      var itwdf = Math.sin(2 * Math.PI / l);\n\n      for (var p = 0; p < N; p += l) {\n        var rtwdf_ = rtwdf;\n        var itwdf_ = itwdf;\n\n        for (var j = 0; j < s; j++) {\n          var re = rtws[p + j];\n          var ie = itws[p + j];\n\n          var ro = rtws[p + j + s];\n          var io = itws[p + j + s];\n\n          var rx = rtwdf_ * ro - itwdf_ * io;\n\n          io = rtwdf_ * io + itwdf_ * ro;\n          ro = rx;\n\n          rtws[p + j] = re + ro;\n          itws[p + j] = ie + io;\n\n          rtws[p + j + s] = re - ro;\n          itws[p + j + s] = ie - io;\n\n          /* jshint maxdepth : false */\n          if (j !== l) {\n            rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n            itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n            rtwdf_ = rx;\n          }\n        }\n      }\n    }\n  };\n\n  FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n    var N = Math.max(m, n) | 1;\n    var odd = N & 1;\n    var i = 0;\n    for (N = N / 2 | 0; N; N = N >>> 1) {\n      i++;\n    }\n\n    return 1 << i + 1 + odd;\n  };\n\n  FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n    if (N <= 1) return;\n\n    for (var i = 0; i < N / 2; i++) {\n      var t = rws[i];\n\n      rws[i] = rws[N - i - 1];\n      rws[N - i - 1] = t;\n\n      t = iws[i];\n\n      iws[i] = -iws[N - i - 1];\n      iws[N - i - 1] = -t;\n    }\n  };\n\n  FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n    var carry = 0;\n    for (var i = 0; i < N / 2; i++) {\n      var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n        Math.round(ws[2 * i] / N) +\n        carry;\n\n      ws[i] = w & 0x3ffffff;\n\n      if (w < 0x4000000) {\n        carry = 0;\n      } else {\n        carry = w / 0x4000000 | 0;\n      }\n    }\n\n    return ws;\n  };\n\n  FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n    var carry = 0;\n    for (var i = 0; i < len; i++) {\n      carry = carry + (ws[i] | 0);\n\n      rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n      rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n    }\n\n    // Pad with zeroes\n    for (i = 2 * len; i < N; ++i) {\n      rws[i] = 0;\n    }\n\n    assert(carry === 0);\n    assert((carry & ~0x1fff) === 0);\n  };\n\n  FFTM.prototype.stub = function stub (N) {\n    var ph = new Array(N);\n    for (var i = 0; i < N; i++) {\n      ph[i] = 0;\n    }\n\n    return ph;\n  };\n\n  FFTM.prototype.mulp = function mulp (x, y, out) {\n    var N = 2 * this.guessLen13b(x.length, y.length);\n\n    var rbt = this.makeRBT(N);\n\n    var _ = this.stub(N);\n\n    var rws = new Array(N);\n    var rwst = new Array(N);\n    var iwst = new Array(N);\n\n    var nrws = new Array(N);\n    var nrwst = new Array(N);\n    var niwst = new Array(N);\n\n    var rmws = out.words;\n    rmws.length = N;\n\n    this.convert13b(x.words, x.length, rws, N);\n    this.convert13b(y.words, y.length, nrws, N);\n\n    this.transform(rws, _, rwst, iwst, N, rbt);\n    this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n    for (var i = 0; i < N; i++) {\n      var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n      iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n      rwst[i] = rx;\n    }\n\n    this.conjugate(rwst, iwst, N);\n    this.transform(rwst, iwst, rmws, _, N, rbt);\n    this.conjugate(rmws, _, N);\n    this.normalize13b(rmws, N);\n\n    out.negative = x.negative ^ y.negative;\n    out.length = x.length + y.length;\n    return out.strip();\n  };\n\n  // Multiply `this` by `num`\n  BN.prototype.mul = function mul (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return this.mulTo(num, out);\n  };\n\n  // Multiply employing FFT\n  BN.prototype.mulf = function mulf (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return jumboMulTo(this, num, out);\n  };\n\n  // In-place Multiplication\n  BN.prototype.imul = function imul (num) {\n    return this.clone().mulTo(num, this);\n  };\n\n  BN.prototype.imuln = function imuln (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n\n    // Carry\n    var carry = 0;\n    for (var i = 0; i < this.length; i++) {\n      var w = (this.words[i] | 0) * num;\n      var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n      carry >>= 26;\n      carry += (w / 0x4000000) | 0;\n      // NOTE: lo is 27bit maximum\n      carry += lo >>> 26;\n      this.words[i] = lo & 0x3ffffff;\n    }\n\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n\n    return this;\n  };\n\n  BN.prototype.muln = function muln (num) {\n    return this.clone().imuln(num);\n  };\n\n  // `this` * `this`\n  BN.prototype.sqr = function sqr () {\n    return this.mul(this);\n  };\n\n  // `this` * `this` in-place\n  BN.prototype.isqr = function isqr () {\n    return this.imul(this.clone());\n  };\n\n  // Math.pow(`this`, `num`)\n  BN.prototype.pow = function pow (num) {\n    var w = toBitArray(num);\n    if (w.length === 0) return new BN(1);\n\n    // Skip leading zeroes\n    var res = this;\n    for (var i = 0; i < w.length; i++, res = res.sqr()) {\n      if (w[i] !== 0) break;\n    }\n\n    if (++i < w.length) {\n      for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n        if (w[i] === 0) continue;\n\n        res = res.mul(q);\n      }\n    }\n\n    return res;\n  };\n\n  // Shift-left in-place\n  BN.prototype.iushln = function iushln (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n    var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n    var i;\n\n    if (r !== 0) {\n      var carry = 0;\n\n      for (i = 0; i < this.length; i++) {\n        var newCarry = this.words[i] & carryMask;\n        var c = ((this.words[i] | 0) - newCarry) << r;\n        this.words[i] = c | carry;\n        carry = newCarry >>> (26 - r);\n      }\n\n      if (carry) {\n        this.words[i] = carry;\n        this.length++;\n      }\n    }\n\n    if (s !== 0) {\n      for (i = this.length - 1; i >= 0; i--) {\n        this.words[i + s] = this.words[i];\n      }\n\n      for (i = 0; i < s; i++) {\n        this.words[i] = 0;\n      }\n\n      this.length += s;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ishln = function ishln (bits) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushln(bits);\n  };\n\n  // Shift-right in-place\n  // NOTE: `hint` is a lowest bit before trailing zeroes\n  // NOTE: if `extended` is present - it will be filled with destroyed bits\n  BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var h;\n    if (hint) {\n      h = (hint - (hint % 26)) / 26;\n    } else {\n      h = 0;\n    }\n\n    var r = bits % 26;\n    var s = Math.min((bits - r) / 26, this.length);\n    var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n    var maskedWords = extended;\n\n    h -= s;\n    h = Math.max(0, h);\n\n    // Extended mode, copy masked part\n    if (maskedWords) {\n      for (var i = 0; i < s; i++) {\n        maskedWords.words[i] = this.words[i];\n      }\n      maskedWords.length = s;\n    }\n\n    if (s === 0) {\n      // No-op, we should not move anything at all\n    } else if (this.length > s) {\n      this.length -= s;\n      for (i = 0; i < this.length; i++) {\n        this.words[i] = this.words[i + s];\n      }\n    } else {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    var carry = 0;\n    for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n      var word = this.words[i] | 0;\n      this.words[i] = (carry << (26 - r)) | (word >>> r);\n      carry = word & mask;\n    }\n\n    // Push carried bits as a mask\n    if (maskedWords && carry !== 0) {\n      maskedWords.words[maskedWords.length++] = carry;\n    }\n\n    if (this.length === 0) {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushrn(bits, hint, extended);\n  };\n\n  // Shift-left\n  BN.prototype.shln = function shln (bits) {\n    return this.clone().ishln(bits);\n  };\n\n  BN.prototype.ushln = function ushln (bits) {\n    return this.clone().iushln(bits);\n  };\n\n  // Shift-right\n  BN.prototype.shrn = function shrn (bits) {\n    return this.clone().ishrn(bits);\n  };\n\n  BN.prototype.ushrn = function ushrn (bits) {\n    return this.clone().iushrn(bits);\n  };\n\n  // Test if n bit is set\n  BN.prototype.testn = function testn (bit) {\n    assert(typeof bit === 'number' && bit >= 0);\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) return false;\n\n    // Check bit and return\n    var w = this.words[s];\n\n    return !!(w & q);\n  };\n\n  // Return only lowers bits of number (in-place)\n  BN.prototype.imaskn = function imaskn (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n\n    assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n    if (this.length <= s) {\n      return this;\n    }\n\n    if (r !== 0) {\n      s++;\n    }\n    this.length = Math.min(s, this.length);\n\n    if (r !== 0) {\n      var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n      this.words[this.length - 1] &= mask;\n    }\n\n    return this.strip();\n  };\n\n  // Return only lowers bits of number\n  BN.prototype.maskn = function maskn (bits) {\n    return this.clone().imaskn(bits);\n  };\n\n  // Add plain number `num` to `this`\n  BN.prototype.iaddn = function iaddn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.isubn(-num);\n\n    // Possible sign change\n    if (this.negative !== 0) {\n      if (this.length === 1 && (this.words[0] | 0) < num) {\n        this.words[0] = num - (this.words[0] | 0);\n        this.negative = 0;\n        return this;\n      }\n\n      this.negative = 0;\n      this.isubn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    // Add without checks\n    return this._iaddn(num);\n  };\n\n  BN.prototype._iaddn = function _iaddn (num) {\n    this.words[0] += num;\n\n    // Carry\n    for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n      this.words[i] -= 0x4000000;\n      if (i === this.length - 1) {\n        this.words[i + 1] = 1;\n      } else {\n        this.words[i + 1]++;\n      }\n    }\n    this.length = Math.max(this.length, i + 1);\n\n    return this;\n  };\n\n  // Subtract plain number `num` from `this`\n  BN.prototype.isubn = function isubn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.iaddn(-num);\n\n    if (this.negative !== 0) {\n      this.negative = 0;\n      this.iaddn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    this.words[0] -= num;\n\n    if (this.length === 1 && this.words[0] < 0) {\n      this.words[0] = -this.words[0];\n      this.negative = 1;\n    } else {\n      // Carry\n      for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n        this.words[i] += 0x4000000;\n        this.words[i + 1] -= 1;\n      }\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.addn = function addn (num) {\n    return this.clone().iaddn(num);\n  };\n\n  BN.prototype.subn = function subn (num) {\n    return this.clone().isubn(num);\n  };\n\n  BN.prototype.iabs = function iabs () {\n    this.negative = 0;\n\n    return this;\n  };\n\n  BN.prototype.abs = function abs () {\n    return this.clone().iabs();\n  };\n\n  BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n    var len = num.length + shift;\n    var i;\n\n    this._expand(len);\n\n    var w;\n    var carry = 0;\n    for (i = 0; i < num.length; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      var right = (num.words[i] | 0) * mul;\n      w -= right & 0x3ffffff;\n      carry = (w >> 26) - ((right / 0x4000000) | 0);\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n    for (; i < this.length - shift; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      carry = w >> 26;\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n\n    if (carry === 0) return this.strip();\n\n    // Subtraction overflow\n    assert(carry === -1);\n    carry = 0;\n    for (i = 0; i < this.length; i++) {\n      w = -(this.words[i] | 0) + carry;\n      carry = w >> 26;\n      this.words[i] = w & 0x3ffffff;\n    }\n    this.negative = 1;\n\n    return this.strip();\n  };\n\n  BN.prototype._wordDiv = function _wordDiv (num, mode) {\n    var shift = this.length - num.length;\n\n    var a = this.clone();\n    var b = num;\n\n    // Normalize\n    var bhi = b.words[b.length - 1] | 0;\n    var bhiBits = this._countBits(bhi);\n    shift = 26 - bhiBits;\n    if (shift !== 0) {\n      b = b.ushln(shift);\n      a.iushln(shift);\n      bhi = b.words[b.length - 1] | 0;\n    }\n\n    // Initialize quotient\n    var m = a.length - b.length;\n    var q;\n\n    if (mode !== 'mod') {\n      q = new BN(null);\n      q.length = m + 1;\n      q.words = new Array(q.length);\n      for (var i = 0; i < q.length; i++) {\n        q.words[i] = 0;\n      }\n    }\n\n    var diff = a.clone()._ishlnsubmul(b, 1, m);\n    if (diff.negative === 0) {\n      a = diff;\n      if (q) {\n        q.words[m] = 1;\n      }\n    }\n\n    for (var j = m - 1; j >= 0; j--) {\n      var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n        (a.words[b.length + j - 1] | 0);\n\n      // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n      // (0x7ffffff)\n      qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n      a._ishlnsubmul(b, qj, j);\n      while (a.negative !== 0) {\n        qj--;\n        a.negative = 0;\n        a._ishlnsubmul(b, 1, j);\n        if (!a.isZero()) {\n          a.negative ^= 1;\n        }\n      }\n      if (q) {\n        q.words[j] = qj;\n      }\n    }\n    if (q) {\n      q.strip();\n    }\n    a.strip();\n\n    // Denormalize\n    if (mode !== 'div' && shift !== 0) {\n      a.iushrn(shift);\n    }\n\n    return {\n      div: q || null,\n      mod: a\n    };\n  };\n\n  // NOTE: 1) `mode` can be set to `mod` to request mod only,\n  //       to `div` to request div only, or be absent to\n  //       request both div & mod\n  //       2) `positive` is true if unsigned mod is requested\n  BN.prototype.divmod = function divmod (num, mode, positive) {\n    assert(!num.isZero());\n\n    if (this.isZero()) {\n      return {\n        div: new BN(0),\n        mod: new BN(0)\n      };\n    }\n\n    var div, mod, res;\n    if (this.negative !== 0 && num.negative === 0) {\n      res = this.neg().divmod(num, mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.iadd(num);\n        }\n      }\n\n      return {\n        div: div,\n        mod: mod\n      };\n    }\n\n    if (this.negative === 0 && num.negative !== 0) {\n      res = this.divmod(num.neg(), mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      return {\n        div: div,\n        mod: res.mod\n      };\n    }\n\n    if ((this.negative & num.negative) !== 0) {\n      res = this.neg().divmod(num.neg(), mode);\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.isub(num);\n        }\n      }\n\n      return {\n        div: res.div,\n        mod: mod\n      };\n    }\n\n    // Both numbers are positive at this point\n\n    // Strip both numbers to approximate shift value\n    if (num.length > this.length || this.cmp(num) < 0) {\n      return {\n        div: new BN(0),\n        mod: this\n      };\n    }\n\n    // Very short reduction\n    if (num.length === 1) {\n      if (mode === 'div') {\n        return {\n          div: this.divn(num.words[0]),\n          mod: null\n        };\n      }\n\n      if (mode === 'mod') {\n        return {\n          div: null,\n          mod: new BN(this.modn(num.words[0]))\n        };\n      }\n\n      return {\n        div: this.divn(num.words[0]),\n        mod: new BN(this.modn(num.words[0]))\n      };\n    }\n\n    return this._wordDiv(num, mode);\n  };\n\n  // Find `this` / `num`\n  BN.prototype.div = function div (num) {\n    return this.divmod(num, 'div', false).div;\n  };\n\n  // Find `this` % `num`\n  BN.prototype.mod = function mod (num) {\n    return this.divmod(num, 'mod', false).mod;\n  };\n\n  BN.prototype.umod = function umod (num) {\n    return this.divmod(num, 'mod', true).mod;\n  };\n\n  // Find Round(`this` / `num`)\n  BN.prototype.divRound = function divRound (num) {\n    var dm = this.divmod(num);\n\n    // Fast case - exact division\n    if (dm.mod.isZero()) return dm.div;\n\n    var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n    var half = num.ushrn(1);\n    var r2 = num.andln(1);\n    var cmp = mod.cmp(half);\n\n    // Round down\n    if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n    // Round up\n    return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n  };\n\n  BN.prototype.modn = function modn (num) {\n    assert(num <= 0x3ffffff);\n    var p = (1 << 26) % num;\n\n    var acc = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      acc = (p * acc + (this.words[i] | 0)) % num;\n    }\n\n    return acc;\n  };\n\n  // In-place division by number\n  BN.prototype.idivn = function idivn (num) {\n    assert(num <= 0x3ffffff);\n\n    var carry = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var w = (this.words[i] | 0) + carry * 0x4000000;\n      this.words[i] = (w / num) | 0;\n      carry = w % num;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.divn = function divn (num) {\n    return this.clone().idivn(num);\n  };\n\n  BN.prototype.egcd = function egcd (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var x = this;\n    var y = p.clone();\n\n    if (x.negative !== 0) {\n      x = x.umod(p);\n    } else {\n      x = x.clone();\n    }\n\n    // A * x + B * y = x\n    var A = new BN(1);\n    var B = new BN(0);\n\n    // C * x + D * y = y\n    var C = new BN(0);\n    var D = new BN(1);\n\n    var g = 0;\n\n    while (x.isEven() && y.isEven()) {\n      x.iushrn(1);\n      y.iushrn(1);\n      ++g;\n    }\n\n    var yp = y.clone();\n    var xp = x.clone();\n\n    while (!x.isZero()) {\n      for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        x.iushrn(i);\n        while (i-- > 0) {\n          if (A.isOdd() || B.isOdd()) {\n            A.iadd(yp);\n            B.isub(xp);\n          }\n\n          A.iushrn(1);\n          B.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        y.iushrn(j);\n        while (j-- > 0) {\n          if (C.isOdd() || D.isOdd()) {\n            C.iadd(yp);\n            D.isub(xp);\n          }\n\n          C.iushrn(1);\n          D.iushrn(1);\n        }\n      }\n\n      if (x.cmp(y) >= 0) {\n        x.isub(y);\n        A.isub(C);\n        B.isub(D);\n      } else {\n        y.isub(x);\n        C.isub(A);\n        D.isub(B);\n      }\n    }\n\n    return {\n      a: C,\n      b: D,\n      gcd: y.iushln(g)\n    };\n  };\n\n  // This is reduced incarnation of the binary EEA\n  // above, designated to invert members of the\n  // _prime_ fields F(p) at a maximal speed\n  BN.prototype._invmp = function _invmp (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var a = this;\n    var b = p.clone();\n\n    if (a.negative !== 0) {\n      a = a.umod(p);\n    } else {\n      a = a.clone();\n    }\n\n    var x1 = new BN(1);\n    var x2 = new BN(0);\n\n    var delta = b.clone();\n\n    while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n      for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        a.iushrn(i);\n        while (i-- > 0) {\n          if (x1.isOdd()) {\n            x1.iadd(delta);\n          }\n\n          x1.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        b.iushrn(j);\n        while (j-- > 0) {\n          if (x2.isOdd()) {\n            x2.iadd(delta);\n          }\n\n          x2.iushrn(1);\n        }\n      }\n\n      if (a.cmp(b) >= 0) {\n        a.isub(b);\n        x1.isub(x2);\n      } else {\n        b.isub(a);\n        x2.isub(x1);\n      }\n    }\n\n    var res;\n    if (a.cmpn(1) === 0) {\n      res = x1;\n    } else {\n      res = x2;\n    }\n\n    if (res.cmpn(0) < 0) {\n      res.iadd(p);\n    }\n\n    return res;\n  };\n\n  BN.prototype.gcd = function gcd (num) {\n    if (this.isZero()) return num.abs();\n    if (num.isZero()) return this.abs();\n\n    var a = this.clone();\n    var b = num.clone();\n    a.negative = 0;\n    b.negative = 0;\n\n    // Remove common factor of two\n    for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n      a.iushrn(1);\n      b.iushrn(1);\n    }\n\n    do {\n      while (a.isEven()) {\n        a.iushrn(1);\n      }\n      while (b.isEven()) {\n        b.iushrn(1);\n      }\n\n      var r = a.cmp(b);\n      if (r < 0) {\n        // Swap `a` and `b` to make `a` always bigger than `b`\n        var t = a;\n        a = b;\n        b = t;\n      } else if (r === 0 || b.cmpn(1) === 0) {\n        break;\n      }\n\n      a.isub(b);\n    } while (true);\n\n    return b.iushln(shift);\n  };\n\n  // Invert number in the field F(num)\n  BN.prototype.invm = function invm (num) {\n    return this.egcd(num).a.umod(num);\n  };\n\n  BN.prototype.isEven = function isEven () {\n    return (this.words[0] & 1) === 0;\n  };\n\n  BN.prototype.isOdd = function isOdd () {\n    return (this.words[0] & 1) === 1;\n  };\n\n  // And first word and num\n  BN.prototype.andln = function andln (num) {\n    return this.words[0] & num;\n  };\n\n  // Increment at the bit position in-line\n  BN.prototype.bincn = function bincn (bit) {\n    assert(typeof bit === 'number');\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) {\n      this._expand(s + 1);\n      this.words[s] |= q;\n      return this;\n    }\n\n    // Add bit and propagate, if needed\n    var carry = q;\n    for (var i = s; carry !== 0 && i < this.length; i++) {\n      var w = this.words[i] | 0;\n      w += carry;\n      carry = w >>> 26;\n      w &= 0x3ffffff;\n      this.words[i] = w;\n    }\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n    return this;\n  };\n\n  BN.prototype.isZero = function isZero () {\n    return this.length === 1 && this.words[0] === 0;\n  };\n\n  BN.prototype.cmpn = function cmpn (num) {\n    var negative = num < 0;\n\n    if (this.negative !== 0 && !negative) return -1;\n    if (this.negative === 0 && negative) return 1;\n\n    this.strip();\n\n    var res;\n    if (this.length > 1) {\n      res = 1;\n    } else {\n      if (negative) {\n        num = -num;\n      }\n\n      assert(num <= 0x3ffffff, 'Number is too big');\n\n      var w = this.words[0] | 0;\n      res = w === num ? 0 : w < num ? -1 : 1;\n    }\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Compare two numbers and return:\n  // 1 - if `this` > `num`\n  // 0 - if `this` == `num`\n  // -1 - if `this` < `num`\n  BN.prototype.cmp = function cmp (num) {\n    if (this.negative !== 0 && num.negative === 0) return -1;\n    if (this.negative === 0 && num.negative !== 0) return 1;\n\n    var res = this.ucmp(num);\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Unsigned comparison\n  BN.prototype.ucmp = function ucmp (num) {\n    // At this point both numbers have the same sign\n    if (this.length > num.length) return 1;\n    if (this.length < num.length) return -1;\n\n    var res = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var a = this.words[i] | 0;\n      var b = num.words[i] | 0;\n\n      if (a === b) continue;\n      if (a < b) {\n        res = -1;\n      } else if (a > b) {\n        res = 1;\n      }\n      break;\n    }\n    return res;\n  };\n\n  BN.prototype.gtn = function gtn (num) {\n    return this.cmpn(num) === 1;\n  };\n\n  BN.prototype.gt = function gt (num) {\n    return this.cmp(num) === 1;\n  };\n\n  BN.prototype.gten = function gten (num) {\n    return this.cmpn(num) >= 0;\n  };\n\n  BN.prototype.gte = function gte (num) {\n    return this.cmp(num) >= 0;\n  };\n\n  BN.prototype.ltn = function ltn (num) {\n    return this.cmpn(num) === -1;\n  };\n\n  BN.prototype.lt = function lt (num) {\n    return this.cmp(num) === -1;\n  };\n\n  BN.prototype.lten = function lten (num) {\n    return this.cmpn(num) <= 0;\n  };\n\n  BN.prototype.lte = function lte (num) {\n    return this.cmp(num) <= 0;\n  };\n\n  BN.prototype.eqn = function eqn (num) {\n    return this.cmpn(num) === 0;\n  };\n\n  BN.prototype.eq = function eq (num) {\n    return this.cmp(num) === 0;\n  };\n\n  //\n  // A reduce context, could be using montgomery or something better, depending\n  // on the `m` itself.\n  //\n  BN.red = function red (num) {\n    return new Red(num);\n  };\n\n  BN.prototype.toRed = function toRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    assert(this.negative === 0, 'red works only with positives');\n    return ctx.convertTo(this)._forceRed(ctx);\n  };\n\n  BN.prototype.fromRed = function fromRed () {\n    assert(this.red, 'fromRed works only with numbers in reduction context');\n    return this.red.convertFrom(this);\n  };\n\n  BN.prototype._forceRed = function _forceRed (ctx) {\n    this.red = ctx;\n    return this;\n  };\n\n  BN.prototype.forceRed = function forceRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    return this._forceRed(ctx);\n  };\n\n  BN.prototype.redAdd = function redAdd (num) {\n    assert(this.red, 'redAdd works only with red numbers');\n    return this.red.add(this, num);\n  };\n\n  BN.prototype.redIAdd = function redIAdd (num) {\n    assert(this.red, 'redIAdd works only with red numbers');\n    return this.red.iadd(this, num);\n  };\n\n  BN.prototype.redSub = function redSub (num) {\n    assert(this.red, 'redSub works only with red numbers');\n    return this.red.sub(this, num);\n  };\n\n  BN.prototype.redISub = function redISub (num) {\n    assert(this.red, 'redISub works only with red numbers');\n    return this.red.isub(this, num);\n  };\n\n  BN.prototype.redShl = function redShl (num) {\n    assert(this.red, 'redShl works only with red numbers');\n    return this.red.shl(this, num);\n  };\n\n  BN.prototype.redMul = function redMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.mul(this, num);\n  };\n\n  BN.prototype.redIMul = function redIMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.imul(this, num);\n  };\n\n  BN.prototype.redSqr = function redSqr () {\n    assert(this.red, 'redSqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqr(this);\n  };\n\n  BN.prototype.redISqr = function redISqr () {\n    assert(this.red, 'redISqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.isqr(this);\n  };\n\n  // Square root over p\n  BN.prototype.redSqrt = function redSqrt () {\n    assert(this.red, 'redSqrt works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqrt(this);\n  };\n\n  BN.prototype.redInvm = function redInvm () {\n    assert(this.red, 'redInvm works only with red numbers');\n    this.red._verify1(this);\n    return this.red.invm(this);\n  };\n\n  // Return negative clone of `this` % `red modulo`\n  BN.prototype.redNeg = function redNeg () {\n    assert(this.red, 'redNeg works only with red numbers');\n    this.red._verify1(this);\n    return this.red.neg(this);\n  };\n\n  BN.prototype.redPow = function redPow (num) {\n    assert(this.red && !num.red, 'redPow(normalNum)');\n    this.red._verify1(this);\n    return this.red.pow(this, num);\n  };\n\n  // Prime numbers with efficient reduction\n  var primes = {\n    k256: null,\n    p224: null,\n    p192: null,\n    p25519: null\n  };\n\n  // Pseudo-Mersenne prime\n  function MPrime (name, p) {\n    // P = 2 ^ N - K\n    this.name = name;\n    this.p = new BN(p, 16);\n    this.n = this.p.bitLength();\n    this.k = new BN(1).iushln(this.n).isub(this.p);\n\n    this.tmp = this._tmp();\n  }\n\n  MPrime.prototype._tmp = function _tmp () {\n    var tmp = new BN(null);\n    tmp.words = new Array(Math.ceil(this.n / 13));\n    return tmp;\n  };\n\n  MPrime.prototype.ireduce = function ireduce (num) {\n    // Assumes that `num` is less than `P^2`\n    // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n    var r = num;\n    var rlen;\n\n    do {\n      this.split(r, this.tmp);\n      r = this.imulK(r);\n      r = r.iadd(this.tmp);\n      rlen = r.bitLength();\n    } while (rlen > this.n);\n\n    var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n    if (cmp === 0) {\n      r.words[0] = 0;\n      r.length = 1;\n    } else if (cmp > 0) {\n      r.isub(this.p);\n    } else {\n      if (r.strip !== undefined) {\n        // r is BN v4 instance\n        r.strip();\n      } else {\n        // r is BN v5 instance\n        r._strip();\n      }\n    }\n\n    return r;\n  };\n\n  MPrime.prototype.split = function split (input, out) {\n    input.iushrn(this.n, 0, out);\n  };\n\n  MPrime.prototype.imulK = function imulK (num) {\n    return num.imul(this.k);\n  };\n\n  function K256 () {\n    MPrime.call(\n      this,\n      'k256',\n      'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n  }\n  inherits(K256, MPrime);\n\n  K256.prototype.split = function split (input, output) {\n    // 256 = 9 * 26 + 22\n    var mask = 0x3fffff;\n\n    var outLen = Math.min(input.length, 9);\n    for (var i = 0; i < outLen; i++) {\n      output.words[i] = input.words[i];\n    }\n    output.length = outLen;\n\n    if (input.length <= 9) {\n      input.words[0] = 0;\n      input.length = 1;\n      return;\n    }\n\n    // Shift by 9 limbs\n    var prev = input.words[9];\n    output.words[output.length++] = prev & mask;\n\n    for (i = 10; i < input.length; i++) {\n      var next = input.words[i] | 0;\n      input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n      prev = next;\n    }\n    prev >>>= 22;\n    input.words[i - 10] = prev;\n    if (prev === 0 && input.length > 10) {\n      input.length -= 10;\n    } else {\n      input.length -= 9;\n    }\n  };\n\n  K256.prototype.imulK = function imulK (num) {\n    // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n    num.words[num.length] = 0;\n    num.words[num.length + 1] = 0;\n    num.length += 2;\n\n    // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n    var lo = 0;\n    for (var i = 0; i < num.length; i++) {\n      var w = num.words[i] | 0;\n      lo += w * 0x3d1;\n      num.words[i] = lo & 0x3ffffff;\n      lo = w * 0x40 + ((lo / 0x4000000) | 0);\n    }\n\n    // Fast length reduction\n    if (num.words[num.length - 1] === 0) {\n      num.length--;\n      if (num.words[num.length - 1] === 0) {\n        num.length--;\n      }\n    }\n    return num;\n  };\n\n  function P224 () {\n    MPrime.call(\n      this,\n      'p224',\n      'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n  }\n  inherits(P224, MPrime);\n\n  function P192 () {\n    MPrime.call(\n      this,\n      'p192',\n      'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n  }\n  inherits(P192, MPrime);\n\n  function P25519 () {\n    // 2 ^ 255 - 19\n    MPrime.call(\n      this,\n      '25519',\n      '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n  }\n  inherits(P25519, MPrime);\n\n  P25519.prototype.imulK = function imulK (num) {\n    // K = 0x13\n    var carry = 0;\n    for (var i = 0; i < num.length; i++) {\n      var hi = (num.words[i] | 0) * 0x13 + carry;\n      var lo = hi & 0x3ffffff;\n      hi >>>= 26;\n\n      num.words[i] = lo;\n      carry = hi;\n    }\n    if (carry !== 0) {\n      num.words[num.length++] = carry;\n    }\n    return num;\n  };\n\n  // Exported mostly for testing purposes, use plain name instead\n  BN._prime = function prime (name) {\n    // Cached version of prime\n    if (primes[name]) return primes[name];\n\n    var prime;\n    if (name === 'k256') {\n      prime = new K256();\n    } else if (name === 'p224') {\n      prime = new P224();\n    } else if (name === 'p192') {\n      prime = new P192();\n    } else if (name === 'p25519') {\n      prime = new P25519();\n    } else {\n      throw new Error('Unknown prime ' + name);\n    }\n    primes[name] = prime;\n\n    return prime;\n  };\n\n  //\n  // Base reduction engine\n  //\n  function Red (m) {\n    if (typeof m === 'string') {\n      var prime = BN._prime(m);\n      this.m = prime.p;\n      this.prime = prime;\n    } else {\n      assert(m.gtn(1), 'modulus must be greater than 1');\n      this.m = m;\n      this.prime = null;\n    }\n  }\n\n  Red.prototype._verify1 = function _verify1 (a) {\n    assert(a.negative === 0, 'red works only with positives');\n    assert(a.red, 'red works only with red numbers');\n  };\n\n  Red.prototype._verify2 = function _verify2 (a, b) {\n    assert((a.negative | b.negative) === 0, 'red works only with positives');\n    assert(a.red && a.red === b.red,\n      'red works only with red numbers');\n  };\n\n  Red.prototype.imod = function imod (a) {\n    if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n    return a.umod(this.m)._forceRed(this);\n  };\n\n  Red.prototype.neg = function neg (a) {\n    if (a.isZero()) {\n      return a.clone();\n    }\n\n    return this.m.sub(a)._forceRed(this);\n  };\n\n  Red.prototype.add = function add (a, b) {\n    this._verify2(a, b);\n\n    var res = a.add(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.iadd = function iadd (a, b) {\n    this._verify2(a, b);\n\n    var res = a.iadd(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.sub = function sub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.sub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.isub = function isub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.isub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.shl = function shl (a, num) {\n    this._verify1(a);\n    return this.imod(a.ushln(num));\n  };\n\n  Red.prototype.imul = function imul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.imul(b));\n  };\n\n  Red.prototype.mul = function mul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.mul(b));\n  };\n\n  Red.prototype.isqr = function isqr (a) {\n    return this.imul(a, a.clone());\n  };\n\n  Red.prototype.sqr = function sqr (a) {\n    return this.mul(a, a);\n  };\n\n  Red.prototype.sqrt = function sqrt (a) {\n    if (a.isZero()) return a.clone();\n\n    var mod3 = this.m.andln(3);\n    assert(mod3 % 2 === 1);\n\n    // Fast case\n    if (mod3 === 3) {\n      var pow = this.m.add(new BN(1)).iushrn(2);\n      return this.pow(a, pow);\n    }\n\n    // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n    //\n    // Find Q and S, that Q * 2 ^ S = (P - 1)\n    var q = this.m.subn(1);\n    var s = 0;\n    while (!q.isZero() && q.andln(1) === 0) {\n      s++;\n      q.iushrn(1);\n    }\n    assert(!q.isZero());\n\n    var one = new BN(1).toRed(this);\n    var nOne = one.redNeg();\n\n    // Find quadratic non-residue\n    // NOTE: Max is such because of generalized Riemann hypothesis.\n    var lpow = this.m.subn(1).iushrn(1);\n    var z = this.m.bitLength();\n    z = new BN(2 * z * z).toRed(this);\n\n    while (this.pow(z, lpow).cmp(nOne) !== 0) {\n      z.redIAdd(nOne);\n    }\n\n    var c = this.pow(z, q);\n    var r = this.pow(a, q.addn(1).iushrn(1));\n    var t = this.pow(a, q);\n    var m = s;\n    while (t.cmp(one) !== 0) {\n      var tmp = t;\n      for (var i = 0; tmp.cmp(one) !== 0; i++) {\n        tmp = tmp.redSqr();\n      }\n      assert(i < m);\n      var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n      r = r.redMul(b);\n      c = b.redSqr();\n      t = t.redMul(c);\n      m = i;\n    }\n\n    return r;\n  };\n\n  Red.prototype.invm = function invm (a) {\n    var inv = a._invmp(this.m);\n    if (inv.negative !== 0) {\n      inv.negative = 0;\n      return this.imod(inv).redNeg();\n    } else {\n      return this.imod(inv);\n    }\n  };\n\n  Red.prototype.pow = function pow (a, num) {\n    if (num.isZero()) return new BN(1).toRed(this);\n    if (num.cmpn(1) === 0) return a.clone();\n\n    var windowSize = 4;\n    var wnd = new Array(1 << windowSize);\n    wnd[0] = new BN(1).toRed(this);\n    wnd[1] = a;\n    for (var i = 2; i < wnd.length; i++) {\n      wnd[i] = this.mul(wnd[i - 1], a);\n    }\n\n    var res = wnd[0];\n    var current = 0;\n    var currentLen = 0;\n    var start = num.bitLength() % 26;\n    if (start === 0) {\n      start = 26;\n    }\n\n    for (i = num.length - 1; i >= 0; i--) {\n      var word = num.words[i];\n      for (var j = start - 1; j >= 0; j--) {\n        var bit = (word >> j) & 1;\n        if (res !== wnd[0]) {\n          res = this.sqr(res);\n        }\n\n        if (bit === 0 && current === 0) {\n          currentLen = 0;\n          continue;\n        }\n\n        current <<= 1;\n        current |= bit;\n        currentLen++;\n        if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n        res = this.mul(res, wnd[current]);\n        currentLen = 0;\n        current = 0;\n      }\n      start = 26;\n    }\n\n    return res;\n  };\n\n  Red.prototype.convertTo = function convertTo (num) {\n    var r = num.umod(this.m);\n\n    return r === num ? r.clone() : r;\n  };\n\n  Red.prototype.convertFrom = function convertFrom (num) {\n    var res = num.clone();\n    res.red = null;\n    return res;\n  };\n\n  //\n  // Montgomery method engine\n  //\n\n  BN.mont = function mont (num) {\n    return new Mont(num);\n  };\n\n  function Mont (m) {\n    Red.call(this, m);\n\n    this.shift = this.m.bitLength();\n    if (this.shift % 26 !== 0) {\n      this.shift += 26 - (this.shift % 26);\n    }\n\n    this.r = new BN(1).iushln(this.shift);\n    this.r2 = this.imod(this.r.sqr());\n    this.rinv = this.r._invmp(this.m);\n\n    this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n    this.minv = this.minv.umod(this.r);\n    this.minv = this.r.sub(this.minv);\n  }\n  inherits(Mont, Red);\n\n  Mont.prototype.convertTo = function convertTo (num) {\n    return this.imod(num.ushln(this.shift));\n  };\n\n  Mont.prototype.convertFrom = function convertFrom (num) {\n    var r = this.imod(num.mul(this.rinv));\n    r.red = null;\n    return r;\n  };\n\n  Mont.prototype.imul = function imul (a, b) {\n    if (a.isZero() || b.isZero()) {\n      a.words[0] = 0;\n      a.length = 1;\n      return a;\n    }\n\n    var t = a.imul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.mul = function mul (a, b) {\n    if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n    var t = a.mul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.invm = function invm (a) {\n    // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n    var res = this.imod(a._invmp(this.m).mul(this.r2));\n    return res._forceRed(this);\n  };\n})(typeof module === 'undefined' || module, this);\n","var parseKeys = require('parse-asn1')\nvar mgf = require('./mgf')\nvar xor = require('./xor')\nvar BN = require('bn.js')\nvar crt = require('browserify-rsa')\nvar createHash = require('create-hash')\nvar withPublic = require('./withPublic')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function privateDecrypt (privateKey, enc, reverse) {\n  var padding\n  if (privateKey.padding) {\n    padding = privateKey.padding\n  } else if (reverse) {\n    padding = 1\n  } else {\n    padding = 4\n  }\n\n  var key = parseKeys(privateKey)\n  var k = key.modulus.byteLength()\n  if (enc.length > k || new BN(enc).cmp(key.modulus) >= 0) {\n    throw new Error('decryption error')\n  }\n  var msg\n  if (reverse) {\n    msg = withPublic(new BN(enc), key)\n  } else {\n    msg = crt(enc, key)\n  }\n  var zBuffer = Buffer.alloc(k - msg.length)\n  msg = Buffer.concat([zBuffer, msg], k)\n  if (padding === 4) {\n    return oaep(key, msg)\n  } else if (padding === 1) {\n    return pkcs1(key, msg, reverse)\n  } else if (padding === 3) {\n    return msg\n  } else {\n    throw new Error('unknown padding')\n  }\n}\n\nfunction oaep (key, msg) {\n  var k = key.modulus.byteLength()\n  var iHash = createHash('sha1').update(Buffer.alloc(0)).digest()\n  var hLen = iHash.length\n  if (msg[0] !== 0) {\n    throw new Error('decryption error')\n  }\n  var maskedSeed = msg.slice(1, hLen + 1)\n  var maskedDb = msg.slice(hLen + 1)\n  var seed = xor(maskedSeed, mgf(maskedDb, hLen))\n  var db = xor(maskedDb, mgf(seed, k - hLen - 1))\n  if (compare(iHash, db.slice(0, hLen))) {\n    throw new Error('decryption error')\n  }\n  var i = hLen\n  while (db[i] === 0) {\n    i++\n  }\n  if (db[i++] !== 1) {\n    throw new Error('decryption error')\n  }\n  return db.slice(i)\n}\n\nfunction pkcs1 (key, msg, reverse) {\n  var p1 = msg.slice(0, 2)\n  var i = 2\n  var status = 0\n  while (msg[i++] !== 0) {\n    if (i >= msg.length) {\n      status++\n      break\n    }\n  }\n  var ps = msg.slice(2, i - 1)\n\n  if ((p1.toString('hex') !== '0002' && !reverse) || (p1.toString('hex') !== '0001' && reverse)) {\n    status++\n  }\n  if (ps.length < 8) {\n    status++\n  }\n  if (status) {\n    throw new Error('decryption error')\n  }\n  return msg.slice(i)\n}\nfunction compare (a, b) {\n  a = Buffer.from(a)\n  b = Buffer.from(b)\n  var dif = 0\n  var len = a.length\n  if (a.length !== b.length) {\n    dif++\n    len = Math.min(a.length, b.length)\n  }\n  var i = -1\n  while (++i < len) {\n    dif += (a[i] ^ b[i])\n  }\n  return dif\n}\n","var BN = require('bn.js')\nvar Buffer = require('safe-buffer').Buffer\n\nfunction withPublic (paddedMsg, key) {\n  return Buffer.from(paddedMsg\n    .toRed(BN.mont(key.modulus))\n    .redPow(new BN(key.publicExponent))\n    .fromRed()\n    .toArray())\n}\n\nmodule.exports = withPublic\n","exports.publicEncrypt = require('./publicEncrypt')\nexports.privateDecrypt = require('./privateDecrypt')\n\nexports.privateEncrypt = function privateEncrypt (key, buf) {\n  return exports.publicEncrypt(key, buf, true)\n}\n\nexports.publicDecrypt = function publicDecrypt (key, buf) {\n  return exports.privateDecrypt(key, buf, true)\n}\n","module.exports = function xor (a, b) {\n  var len = a.length\n  var i = -1\n  while (++i < len) {\n    a[i] ^= b[i]\n  }\n  return a\n}\n","var parseKeys = require('parse-asn1')\nvar randomBytes = require('randombytes')\nvar createHash = require('create-hash')\nvar mgf = require('./mgf')\nvar xor = require('./xor')\nvar BN = require('bn.js')\nvar withPublic = require('./withPublic')\nvar crt = require('browserify-rsa')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function publicEncrypt (publicKey, msg, reverse) {\n  var padding\n  if (publicKey.padding) {\n    padding = publicKey.padding\n  } else if (reverse) {\n    padding = 1\n  } else {\n    padding = 4\n  }\n  var key = parseKeys(publicKey)\n  var paddedMsg\n  if (padding === 4) {\n    paddedMsg = oaep(key, msg)\n  } else if (padding === 1) {\n    paddedMsg = pkcs1(key, msg, reverse)\n  } else if (padding === 3) {\n    paddedMsg = new BN(msg)\n    if (paddedMsg.cmp(key.modulus) >= 0) {\n      throw new Error('data too long for modulus')\n    }\n  } else {\n    throw new Error('unknown padding')\n  }\n  if (reverse) {\n    return crt(paddedMsg, key)\n  } else {\n    return withPublic(paddedMsg, key)\n  }\n}\n\nfunction oaep (key, msg) {\n  var k = key.modulus.byteLength()\n  var mLen = msg.length\n  var iHash = createHash('sha1').update(Buffer.alloc(0)).digest()\n  var hLen = iHash.length\n  var hLen2 = 2 * hLen\n  if (mLen > k - hLen2 - 2) {\n    throw new Error('message too long')\n  }\n  var ps = Buffer.alloc(k - mLen - hLen2 - 2)\n  var dblen = k - hLen - 1\n  var seed = randomBytes(hLen)\n  var maskedDb = xor(Buffer.concat([iHash, ps, Buffer.alloc(1, 1), msg], dblen), mgf(seed, dblen))\n  var maskedSeed = xor(seed, mgf(maskedDb, hLen))\n  return new BN(Buffer.concat([Buffer.alloc(1), maskedSeed, maskedDb], k))\n}\nfunction pkcs1 (key, msg, reverse) {\n  var mLen = msg.length\n  var k = key.modulus.byteLength()\n  if (mLen > k - 11) {\n    throw new Error('message too long')\n  }\n  var ps\n  if (reverse) {\n    ps = Buffer.alloc(k - mLen - 3, 0xff)\n  } else {\n    ps = nonZero(k - mLen - 3)\n  }\n  return new BN(Buffer.concat([Buffer.from([0, reverse ? 1 : 2]), ps, Buffer.alloc(1), msg], k))\n}\nfunction nonZero (len) {\n  var out = Buffer.allocUnsafe(len)\n  var i = 0\n  var cache = randomBytes(len * 2)\n  var cur = 0\n  var num\n  while (i < len) {\n    if (cur === cache.length) {\n      cache = randomBytes(len * 2)\n      cur = 0\n    }\n    num = cache[cur++]\n    if (num) {\n      out[i++] = num\n    }\n  }\n  return out\n}\n","var createHash = require('create-hash')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function (seed, len) {\n  var t = Buffer.alloc(0)\n  var i = 0\n  var c\n  while (t.length < len) {\n    c = i2ops(i++)\n    t = Buffer.concat([t, createHash('sha1').update(seed).update(c).digest()])\n  }\n  return t.slice(0, len)\n}\n\nfunction i2ops (c) {\n  var out = Buffer.allocUnsafe(4)\n  out.writeUInt32BE(c, 0)\n  return out\n}\n"],"sourceRoot":""}