{"version":3,"sources":["webpack:///./node_modules/diffie-hellman/lib/generatePrime.js","webpack:///./node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js","webpack:///./node_modules/diffie-hellman/browser.js","webpack:///./node_modules/diffie-hellman/lib/dh.js"],"names":["randomBytes","module","exports","findPrime","simpleSieve","fermatTest","BN","TWENTYFOUR","millerRabin","ONE","TWO","FIVE","TEN","THREE","ELEVEN","FOUR","primes","_getPrimes","res","i","k","sqrt","Math","ceil","j","p","length","modn","cmpn","red","mont","toRed","redPow","subn","fromRed","bits","gen","num","n2","bitLength","ishrn","isEven","iadd","testn","cmp","mod","shrn","test","assert","val","msg","Error","inherits","ctor","superCtor","super_","TempCtor","prototype","constructor","number","base","endian","isBN","this","negative","words","_init","Buffer","wordSize","window","e","parseHex4Bits","string","index","c","charCodeAt","parseHexByte","lowerBound","r","parseBase","str","start","end","mul","len","min","Array","isArray","max","left","right","_initNumber","_initArray","toString","replace","_parseHex","_parseBase","toArray","w","off","strip","limbLen","limbPow","total","word","imuln","_iaddn","pow","copy","dest","clone","_expand","size","_normSign","inspect","zeros","groupSizes","groupBases","smallMulTo","self","out","a","b","lo","carry","ncarry","rword","maxJ","padding","groupSize","groupBase","isZero","idivn","toNumber","ret","toJSON","toBuffer","toArrayLike","ArrayType","byteLength","reqLength","littleEndian","q","andln","iushrn","clz32","_countBits","t","_zeroBits","hi","zeroBits","toTwos","width","abs","inotn","iaddn","fromTwos","notn","ineg","isNeg","neg","iuor","ior","or","uor","iuand","iand","and","uand","iuxor","ixor","xor","uxor","bytesNeeded","bitsLeft","setn","bit","wbit","isub","add","sub","comb10MulTo","mid","o","a0","al0","ah0","a1","al1","ah1","a2","al2","ah2","a3","al3","ah3","a4","al4","ah4","a5","al5","ah5","a6","al6","ah6","a7","al7","ah7","a8","al8","ah8","a9","al9","ah9","b0","bl0","bh0","b1","bl1","bh1","b2","bl2","bh2","b3","bl3","bh3","b4","bl4","bh4","b5","bl5","bh5","b6","bl6","bh6","b7","bl7","bh7","b8","bl8","bh8","b9","bl9","bh9","w0","imul","w1","w2","w3","w4","w5","w6","w7","w8","w9","w10","w11","w12","w13","w14","w15","w16","w17","w18","jumboMulTo","FFTM","mulp","x","y","mulTo","hncarry","bigMulTo","makeRBT","N","l","revBin","rb","permute","rbt","rws","iws","rtws","itws","transform","s","rtwdf","cos","PI","itwdf","sin","rtwdf_","itwdf_","re","ie","ro","io","rx","guessLen13b","n","m","odd","conjugate","normalize13b","ws","round","convert13b","stub","ph","_","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","muln","sqr","isqr","toBitArray","iushln","carryMask","newCarry","ishln","hint","extended","h","mask","maskedWords","shln","ushln","ushrn","imaskn","maskn","isubn","addn","iabs","_ishlnsubmul","shift","_wordDiv","mode","bhi","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","acc","egcd","A","B","C","D","g","yp","xp","im","isOdd","jm","gcd","_invmp","x1","x2","delta","invm","bincn","ucmp","gtn","gt","gten","gte","ltn","lt","lten","lte","eqn","eq","Red","ctx","convertTo","_forceRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","shl","redMul","_verify2","redIMul","redSqr","_verify1","redISqr","redSqrt","redInvm","redNeg","k256","p224","p192","p25519","MPrime","name","tmp","_tmp","K256","call","P224","P192","P25519","prime","_prime","Mont","imod","rinv","minv","ireduce","rlen","split","imulK","undefined","_strip","input","output","outLen","prev","next","mod3","one","nOne","lpow","z","inv","wnd","current","currentLen","u","DH","ENCODINGS","DiffieHellmanGroup","createDiffieHellmanGroup","getDiffieHellman","createDiffieHellman","DiffieHellman","enc","generator","genc","isBuffer","generatePrime","SEVEN","setPublicKey","pub","_pub","setPrivateKey","priv","_priv","primeCache","malleable","setGenerator","__prime","_primeLen","_primeCode","formatReturnValue","bn","buf","Object","defineProperty","enumerable","get","hex","join","rem","error","checkPrime","__gen","generateKeys","_gen","getPublicKey","computeSecret","other","secret","getPrime","front","fill","concat","getPrivateKey","getGenerator"],"mappings":"8EAAA,IAAIA,EAAc,EAAQ,KAC1BC,EAAOC,QAAUC,EACjBA,EAAUC,YAAcA,EACxBD,EAAUE,WAAaA,EACvB,IAAIC,EAAK,EAAQ,KACbC,EAAa,IAAID,EAAG,IAEpBE,EAAc,IADA,EAAQ,MAEtBC,EAAM,IAAIH,EAAG,GACbI,EAAM,IAAIJ,EAAG,GACbK,EAAO,IAAIL,EAAG,GAGdM,GAFU,IAAIN,EAAG,IACT,IAAIA,EAAG,GACT,IAAIA,EAAG,KACbO,EAAQ,IAAIP,EAAG,GAEfQ,GADQ,IAAIR,EAAG,GACN,IAAIA,EAAG,KAChBS,EAAO,IAAIT,EAAG,GAEdU,GADS,IAAIV,EAAG,IACP,MAEb,SAASW,IACP,GAAe,OAAXD,EACF,OAAOA,EAET,IACIE,EAAM,GACVA,EAAI,GAAK,EACT,IAAK,IAAIC,EAAI,EAAGC,EAAI,EAAGA,EAHX,QAGsBA,GAAK,EAAG,CAExC,IADA,IAAIC,EAAOC,KAAKC,KAAKD,KAAKD,KAAKD,IACtBI,EAAI,EAAGA,EAAIL,GAAKD,EAAIM,IAAMH,GAC7BD,EAAIF,EAAIM,IAAO,EADoBA,KAIrCL,IAAMK,GAAKN,EAAIM,IAAMH,IAGzBH,EAAIC,KAAOC,GAGb,OADAJ,EAASE,EACFA,EAGT,SAASd,EAAYqB,GAGnB,IAFA,IAAIT,EAASC,IAEJE,EAAI,EAAGA,EAAIH,EAAOU,OAAQP,IACjC,GAA0B,IAAtBM,EAAEE,KAAKX,EAAOG,IAChB,OAA0B,IAAtBM,EAAEG,KAAKZ,EAAOG,IAOtB,OAAO,EAGT,SAASd,EAAWoB,GAClB,IAAII,EAAMvB,EAAGwB,KAAKL,GAClB,OAA8D,IAAvDf,EAAIqB,MAAMF,GAAKG,OAAOP,EAAEQ,KAAK,IAAIC,UAAUN,KAAK,GAGzD,SAASzB,EAAUgC,EAAMC,GACvB,GAAID,EAAO,GAET,OACS,IAAI7B,EADD,IAAR8B,GAAqB,IAARA,EACD,CAAC,IAAM,KAEP,CAAC,IAAM,KAKzB,IAAIC,EAAKC,EAET,IAJAF,EAAM,IAAI9B,EAAG8B,KAIA,CAEX,IADAC,EAAM,IAAI/B,EAAGN,EAAYsB,KAAKC,KAAKY,EAAO,KACnCE,EAAIE,YAAcJ,GACvBE,EAAIG,MAAM,GAQZ,GANIH,EAAII,UACNJ,EAAIK,KAAKjC,GAEN4B,EAAIM,MAAM,IACbN,EAAIK,KAAKhC,GAEN0B,EAAIQ,IAAIlC,IAIN,IAAK0B,EAAIQ,IAAIjC,GAClB,KAAO0B,EAAIQ,IAAIjC,GAAKgC,IAAI/B,IACtBwB,EAAIK,KAAK3B,QALX,KAAOsB,EAAIQ,IAAItC,GAAYqC,IAAI9B,IAC7BuB,EAAIK,KAAK3B,GAQb,GAAIX,EADJkC,EAAKD,EAAIS,KAAK,KACS1C,EAAYiC,IACjChC,EAAWiC,IAAOjC,EAAWgC,IAC7B7B,EAAYuC,KAAKT,IAAO9B,EAAYuC,KAAKV,GACzC,OAAOA,K,qBCpGb,2BACE,aAGA,SAASW,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,SAAS/C,EAAIqD,EAAQC,EAAMC,GACzB,GAAIvD,EAAGwD,KAAKH,GACV,OAAOA,EAGTI,KAAKC,SAAW,EAChBD,KAAKE,MAAQ,KACbF,KAAKrC,OAAS,EAGdqC,KAAKlC,IAAM,KAEI,OAAX8B,IACW,OAATC,GAA0B,OAATA,IACnBC,EAASD,EACTA,EAAO,IAGTG,KAAKG,MAAMP,GAAU,EAAGC,GAAQ,GAAIC,GAAU,OAYlD,IAAIM,EATkB,iBAAXlE,EACTA,EAAOC,QAAUI,EAEjBJ,EAAQI,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAG8D,SAAW,GAGd,IAEID,EADoB,oBAAXE,aAAmD,IAAlBA,OAAOF,OACxCE,OAAOF,OAEP,EAAQ,KAAUA,OAE7B,MAAOG,IAgIT,SAASC,EAAeC,EAAQC,GAC9B,IAAIC,EAAIF,EAAOG,WAAWF,GAE1B,OAAIC,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,GAGHA,EAAI,GAAM,GAItB,SAASE,EAAcJ,EAAQK,EAAYJ,GACzC,IAAIK,EAAIP,EAAcC,EAAQC,GAI9B,OAHIA,EAAQ,GAAKI,IACfC,GAAKP,EAAcC,EAAQC,EAAQ,IAAM,GAEpCK,EA8CT,SAASC,EAAWC,EAAKC,EAAOC,EAAKC,GAGnC,IAFA,IAAIL,EAAI,EACJM,EAAM9D,KAAK+D,IAAIL,EAAItD,OAAQwD,GACtB/D,EAAI8D,EAAO9D,EAAIiE,EAAKjE,IAAK,CAChC,IAAIuD,EAAIM,EAAIL,WAAWxD,GAAK,GAE5B2D,GAAKK,EAIHL,GADEJ,GAAK,GACFA,EAAI,GAAK,GAGLA,GAAK,GACTA,EAAI,GAAK,GAITA,EAGT,OAAOI,EAnNTxE,EAAGwD,KAAO,SAAezB,GACvB,OAAIA,aAAe/B,GAIJ,OAAR+B,GAA+B,iBAARA,GAC5BA,EAAIqB,YAAYU,WAAa9D,EAAG8D,UAAYkB,MAAMC,QAAQlD,EAAI4B,QAGlE3D,EAAGkF,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAK7C,IAAI8C,GAAS,EAAUD,EACzBC,GAGTpF,EAAG+E,IAAM,SAAcI,EAAMC,GAC3B,OAAID,EAAK7C,IAAI8C,GAAS,EAAUD,EACzBC,GAGTpF,EAAGmD,UAAUS,MAAQ,SAAeP,EAAQC,EAAMC,GAChD,GAAsB,iBAAXF,EACT,OAAOI,KAAK4B,YAAYhC,EAAQC,EAAMC,GAGxC,GAAsB,iBAAXF,EACT,OAAOI,KAAK6B,WAAWjC,EAAQC,EAAMC,GAG1B,QAATD,IACFA,EAAO,IAETZ,EAAOY,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAIqB,EAAQ,EACM,OAFlBtB,EAASA,EAAOkC,WAAWC,QAAQ,OAAQ,KAEhC,KACTb,IACAlB,KAAKC,SAAW,GAGdiB,EAAQtB,EAAOjC,SACJ,KAATkC,EACFG,KAAKgC,UAAUpC,EAAQsB,EAAOpB,IAE9BE,KAAKiC,WAAWrC,EAAQC,EAAMqB,GACf,OAAXpB,GACFE,KAAK6B,WAAW7B,KAAKkC,UAAWrC,EAAMC,MAM9CvD,EAAGmD,UAAUkC,YAAc,SAAsBhC,EAAQC,EAAMC,GACzDF,EAAS,IACXI,KAAKC,SAAW,EAChBL,GAAUA,GAERA,EAAS,UACXI,KAAKE,MAAQ,CAAW,SAATN,GACfI,KAAKrC,OAAS,GACLiC,EAAS,kBAClBI,KAAKE,MAAQ,CACF,SAATN,EACCA,EAAS,SAAa,UAEzBI,KAAKrC,OAAS,IAEdsB,EAAOW,EAAS,kBAChBI,KAAKE,MAAQ,CACF,SAATN,EACCA,EAAS,SAAa,SACvB,GAEFI,KAAKrC,OAAS,GAGD,OAAXmC,GAGJE,KAAK6B,WAAW7B,KAAKkC,UAAWrC,EAAMC,IAGxCvD,EAAGmD,UAAUmC,WAAa,SAAqBjC,EAAQC,EAAMC,GAG3D,GADAb,EAAgC,iBAAlBW,EAAOjC,QACjBiC,EAAOjC,QAAU,EAGnB,OAFAqC,KAAKE,MAAQ,CAAE,GACfF,KAAKrC,OAAS,EACPqC,KAGTA,KAAKrC,OAASJ,KAAKC,KAAKoC,EAAOjC,OAAS,GACxCqC,KAAKE,MAAQ,IAAIqB,MAAMvB,KAAKrC,QAC5B,IAAK,IAAIP,EAAI,EAAGA,EAAI4C,KAAKrC,OAAQP,IAC/B4C,KAAKE,MAAM9C,GAAK,EAGlB,IAAIK,EAAG0E,EACHC,EAAM,EACV,GAAe,OAAXtC,EACF,IAAK1C,EAAIwC,EAAOjC,OAAS,EAAGF,EAAI,EAAGL,GAAK,EAAGA,GAAK,EAC9C+E,EAAIvC,EAAOxC,GAAMwC,EAAOxC,EAAI,IAAM,EAAMwC,EAAOxC,EAAI,IAAM,GACzD4C,KAAKE,MAAMzC,IAAO0E,GAAKC,EAAO,SAC9BpC,KAAKE,MAAMzC,EAAI,GAAM0E,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACP3E,UAGC,GAAe,OAAXqC,EACT,IAAK1C,EAAI,EAAGK,EAAI,EAAGL,EAAIwC,EAAOjC,OAAQP,GAAK,EACzC+E,EAAIvC,EAAOxC,GAAMwC,EAAOxC,EAAI,IAAM,EAAMwC,EAAOxC,EAAI,IAAM,GACzD4C,KAAKE,MAAMzC,IAAO0E,GAAKC,EAAO,SAC9BpC,KAAKE,MAAMzC,EAAI,GAAM0E,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACP3E,KAIN,OAAOuC,KAAKqC,SAyBd9F,EAAGmD,UAAUsC,UAAY,SAAoBpC,EAAQsB,EAAOpB,GAE1DE,KAAKrC,OAASJ,KAAKC,MAAMoC,EAAOjC,OAASuD,GAAS,GAClDlB,KAAKE,MAAQ,IAAIqB,MAAMvB,KAAKrC,QAC5B,IAAK,IAAIP,EAAI,EAAGA,EAAI4C,KAAKrC,OAAQP,IAC/B4C,KAAKE,MAAM9C,GAAK,EAIlB,IAGI+E,EAHAC,EAAM,EACN3E,EAAI,EAGR,GAAe,OAAXqC,EACF,IAAK1C,EAAIwC,EAAOjC,OAAS,EAAGP,GAAK8D,EAAO9D,GAAK,EAC3C+E,EAAItB,EAAajB,EAAQsB,EAAO9D,IAAMgF,EACtCpC,KAAKE,MAAMzC,IAAU,SAAJ0E,EACbC,GAAO,IACTA,GAAO,GACP3E,GAAK,EACLuC,KAAKE,MAAMzC,IAAM0E,IAAM,IAEvBC,GAAO,OAKX,IAAKhF,GADawC,EAAOjC,OAASuD,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAO9D,EAAIwC,EAAOjC,OAAQP,GAAK,EAC1E+E,EAAItB,EAAajB,EAAQsB,EAAO9D,IAAMgF,EACtCpC,KAAKE,MAAMzC,IAAU,SAAJ0E,EACbC,GAAO,IACTA,GAAO,GACP3E,GAAK,EACLuC,KAAKE,MAAMzC,IAAM0E,IAAM,IAEvBC,GAAO,EAKbpC,KAAKqC,SA2BP9F,EAAGmD,UAAUuC,WAAa,SAAqBrC,EAAQC,EAAMqB,GAE3DlB,KAAKE,MAAQ,CAAE,GACfF,KAAKrC,OAAS,EAGd,IAAK,IAAI2E,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAW1C,EAClEyC,IAEFA,IACAC,EAAWA,EAAU1C,EAAQ,EAO7B,IALA,IAAI2C,EAAQ5C,EAAOjC,OAASuD,EACxBpC,EAAM0D,EAAQF,EACdnB,EAAM5D,KAAK+D,IAAIkB,EAAOA,EAAQ1D,GAAOoC,EAErCuB,EAAO,EACFrF,EAAI8D,EAAO9D,EAAI+D,EAAK/D,GAAKkF,EAChCG,EAAOzB,EAAUpB,EAAQxC,EAAGA,EAAIkF,EAASzC,GAEzCG,KAAK0C,MAAMH,GACPvC,KAAKE,MAAM,GAAKuC,EAAO,SACzBzC,KAAKE,MAAM,IAAMuC,EAEjBzC,KAAK2C,OAAOF,GAIhB,GAAY,IAAR3D,EAAW,CACb,IAAI8D,EAAM,EAGV,IAFAH,EAAOzB,EAAUpB,EAAQxC,EAAGwC,EAAOjC,OAAQkC,GAEtCzC,EAAI,EAAGA,EAAI0B,EAAK1B,IACnBwF,GAAO/C,EAGTG,KAAK0C,MAAME,GACP5C,KAAKE,MAAM,GAAKuC,EAAO,SACzBzC,KAAKE,MAAM,IAAMuC,EAEjBzC,KAAK2C,OAAOF,GAIhBzC,KAAKqC,SAGP9F,EAAGmD,UAAUmD,KAAO,SAAeC,GACjCA,EAAK5C,MAAQ,IAAIqB,MAAMvB,KAAKrC,QAC5B,IAAK,IAAIP,EAAI,EAAGA,EAAI4C,KAAKrC,OAAQP,IAC/B0F,EAAK5C,MAAM9C,GAAK4C,KAAKE,MAAM9C,GAE7B0F,EAAKnF,OAASqC,KAAKrC,OACnBmF,EAAK7C,SAAWD,KAAKC,SACrB6C,EAAKhF,IAAMkC,KAAKlC,KAGlBvB,EAAGmD,UAAUqD,MAAQ,WACnB,IAAIhC,EAAI,IAAIxE,EAAG,MAEf,OADAyD,KAAK6C,KAAK9B,GACHA,GAGTxE,EAAGmD,UAAUsD,QAAU,SAAkBC,GACvC,KAAOjD,KAAKrC,OAASsF,GACnBjD,KAAKE,MAAMF,KAAKrC,UAAY,EAE9B,OAAOqC,MAITzD,EAAGmD,UAAU2C,MAAQ,WACnB,KAAOrC,KAAKrC,OAAS,GAAqC,IAAhCqC,KAAKE,MAAMF,KAAKrC,OAAS,IACjDqC,KAAKrC,SAEP,OAAOqC,KAAKkD,aAGd3G,EAAGmD,UAAUwD,UAAY,WAKvB,OAHoB,IAAhBlD,KAAKrC,QAAkC,IAAlBqC,KAAKE,MAAM,KAClCF,KAAKC,SAAW,GAEXD,MAGTzD,EAAGmD,UAAUyD,QAAU,WACrB,OAAQnD,KAAKlC,IAAM,UAAY,SAAWkC,KAAK8B,SAAS,IAAM,KAiChE,IAAIsB,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UAsjB9D,SAASC,EAAYC,EAAMlF,EAAKmF,GAC9BA,EAAIxD,SAAW3B,EAAI2B,SAAWuD,EAAKvD,SACnC,IAAIoB,EAAOmC,EAAK7F,OAASW,EAAIX,OAAU,EACvC8F,EAAI9F,OAAS0D,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIqC,EAAoB,EAAhBF,EAAKtD,MAAM,GACfyD,EAAmB,EAAfrF,EAAI4B,MAAM,GACda,EAAI2C,EAAIC,EAERC,EAAS,SAAJ7C,EACL8C,EAAS9C,EAAI,SAAa,EAC9B0C,EAAIvD,MAAM,GAAK0D,EAEf,IAAK,IAAIvG,EAAI,EAAGA,EAAIgE,EAAKhE,IAAK,CAM5B,IAHA,IAAIyG,EAASD,IAAU,GACnBE,EAAgB,SAARF,EACRG,EAAOzG,KAAK+D,IAAIjE,EAAGiB,EAAIX,OAAS,GAC3BF,EAAIF,KAAKkE,IAAI,EAAGpE,EAAImG,EAAK7F,OAAS,GAAIF,GAAKuG,EAAMvG,IAAK,CAC7D,IAAIL,EAAKC,EAAII,EAAK,EAIlBqG,IADA/C,GAFA2C,EAAoB,EAAhBF,EAAKtD,MAAM9C,KACfuG,EAAmB,EAAfrF,EAAI4B,MAAMzC,IACFsG,GACG,SAAa,EAC5BA,EAAY,SAAJhD,EAEV0C,EAAIvD,MAAM7C,GAAa,EAAR0G,EACfF,EAAiB,EAATC,EAQV,OANc,IAAVD,EACFJ,EAAIvD,MAAM7C,GAAa,EAARwG,EAEfJ,EAAI9F,SAGC8F,EAAIpB,QAzlBb9F,EAAGmD,UAAUoC,SAAW,SAAmBjC,EAAMoE,GAI/C,IAAIR,EACJ,GAHAQ,EAAoB,EAAVA,GAAe,EAGZ,MAJbpE,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjC4D,EAAM,GAGN,IAFA,IAAIrB,EAAM,EACNyB,EAAQ,EACHzG,EAAI,EAAGA,EAAI4C,KAAKrC,OAAQP,IAAK,CACpC,IAAI+E,EAAInC,KAAKE,MAAM9C,GACfqF,GAA+B,UAArBN,GAAKC,EAAOyB,IAAmB/B,SAAS,IAGpD2B,EADY,KADdI,EAAS1B,IAAO,GAAKC,EAAQ,WACVhF,IAAM4C,KAAKrC,OAAS,EAC/ByF,EAAM,EAAIX,EAAK9E,QAAU8E,EAAOgB,EAEhChB,EAAOgB,GAEfrB,GAAO,IACI,KACTA,GAAO,GACPhF,KAMJ,IAHc,IAAVyG,IACFJ,EAAMI,EAAM/B,SAAS,IAAM2B,GAEtBA,EAAI9F,OAASsG,GAAY,GAC9BR,EAAM,IAAMA,EAKd,OAHsB,IAAlBzD,KAAKC,WACPwD,EAAM,IAAMA,GAEPA,EAGT,GAAI5D,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAIqE,EAAYb,EAAWxD,GAEvBsE,EAAYb,EAAWzD,GAC3B4D,EAAM,GACN,IAAI9C,EAAIX,KAAK+C,QAEb,IADApC,EAAEV,SAAW,GACLU,EAAEyD,UAAU,CAClB,IAAIrD,EAAIJ,EAAE/C,KAAKuG,GAAWrC,SAASjC,GAMjC4D,GALF9C,EAAIA,EAAE0D,MAAMF,IAELC,SAGCrD,EAAI0C,EAFJL,EAAMc,EAAYnD,EAAEpD,QAAUoD,EAAI0C,EAQ5C,IAHIzD,KAAKoE,WACPX,EAAM,IAAMA,GAEPA,EAAI9F,OAASsG,GAAY,GAC9BR,EAAM,IAAMA,EAKd,OAHsB,IAAlBzD,KAAKC,WACPwD,EAAM,IAAMA,GAEPA,EAGTxE,GAAO,EAAO,oCAGhB1C,EAAGmD,UAAU4E,SAAW,WACtB,IAAIC,EAAMvE,KAAKE,MAAM,GASrB,OARoB,IAAhBF,KAAKrC,OACP4G,GAAuB,SAAhBvE,KAAKE,MAAM,GACO,IAAhBF,KAAKrC,QAAkC,IAAlBqC,KAAKE,MAAM,GAEzCqE,GAAO,iBAAoC,SAAhBvE,KAAKE,MAAM,GAC7BF,KAAKrC,OAAS,GACvBsB,GAAO,EAAO,8CAEU,IAAlBe,KAAKC,UAAmBsE,EAAMA,GAGxChI,EAAGmD,UAAU8E,OAAS,WACpB,OAAOxE,KAAK8B,SAAS,KAGvBvF,EAAGmD,UAAU+E,SAAW,SAAmB3E,EAAQnC,GAEjD,OADAsB,OAAyB,IAAXmB,GACPJ,KAAK0E,YAAYtE,EAAQN,EAAQnC,IAG1CpB,EAAGmD,UAAUwC,QAAU,SAAkBpC,EAAQnC,GAC/C,OAAOqC,KAAK0E,YAAYnD,MAAOzB,EAAQnC,IAGzCpB,EAAGmD,UAAUgF,YAAc,SAAsBC,EAAW7E,EAAQnC,GAClE,IAAIiH,EAAa5E,KAAK4E,aAClBC,EAAYlH,GAAUJ,KAAKkE,IAAI,EAAGmD,GACtC3F,EAAO2F,GAAcC,EAAW,yCAChC5F,EAAO4F,EAAY,EAAG,+BAEtB7E,KAAKqC,QACL,IAGIsB,EAAGvG,EAHH0H,EAA0B,OAAXhF,EACf3C,EAAM,IAAIwH,EAAUE,GAGpBE,EAAI/E,KAAK+C,QACb,GAAK+B,EAYE,CACL,IAAK1H,EAAI,GAAI2H,EAAEX,SAAUhH,IACvBuG,EAAIoB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAET9H,EAAIC,GAAKuG,EAGX,KAAOvG,EAAIyH,EAAWzH,IACpBD,EAAIC,GAAK,MArBM,CAEjB,IAAKA,EAAI,EAAGA,EAAIyH,EAAYD,EAAYxH,IACtCD,EAAIC,GAAK,EAGX,IAAKA,EAAI,GAAI2H,EAAEX,SAAUhH,IACvBuG,EAAIoB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAET9H,EAAI0H,EAAYzH,EAAI,GAAKuG,EAe7B,OAAOxG,GAGLI,KAAK2H,MACP3I,EAAGmD,UAAUyF,WAAa,SAAqBhD,GAC7C,OAAO,GAAK5E,KAAK2H,MAAM/C,IAGzB5F,EAAGmD,UAAUyF,WAAa,SAAqBhD,GAC7C,IAAIiD,EAAIjD,EACJpB,EAAI,EAiBR,OAhBIqE,GAAK,OACPrE,GAAK,GACLqE,KAAO,IAELA,GAAK,KACPrE,GAAK,EACLqE,KAAO,GAELA,GAAK,IACPrE,GAAK,EACLqE,KAAO,GAELA,GAAK,IACPrE,GAAK,EACLqE,KAAO,GAEFrE,EAAIqE,GAIf7I,EAAGmD,UAAU2F,UAAY,SAAoBlD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAIiD,EAAIjD,EACJpB,EAAI,EAoBR,OAnBqB,IAAZ,KAAJqE,KACHrE,GAAK,GACLqE,KAAO,IAEU,IAAV,IAAJA,KACHrE,GAAK,EACLqE,KAAO,GAES,IAAT,GAAJA,KACHrE,GAAK,EACLqE,KAAO,GAES,IAAT,EAAJA,KACHrE,GAAK,EACLqE,KAAO,GAES,IAAT,EAAJA,IACHrE,IAEKA,GAITxE,EAAGmD,UAAUlB,UAAY,WACvB,IAAI2D,EAAInC,KAAKE,MAAMF,KAAKrC,OAAS,GAC7B2H,EAAKtF,KAAKmF,WAAWhD,GACzB,OAA2B,IAAnBnC,KAAKrC,OAAS,GAAU2H,GAiBlC/I,EAAGmD,UAAU6F,SAAW,WACtB,GAAIvF,KAAKoE,SAAU,OAAO,EAG1B,IADA,IAAIrD,EAAI,EACC3D,EAAI,EAAGA,EAAI4C,KAAKrC,OAAQP,IAAK,CACpC,IAAIuG,EAAI3D,KAAKqF,UAAUrF,KAAKE,MAAM9C,IAElC,GADA2D,GAAK4C,EACK,KAANA,EAAU,MAEhB,OAAO5C,GAGTxE,EAAGmD,UAAUkF,WAAa,WACxB,OAAOrH,KAAKC,KAAKwC,KAAKxB,YAAc,IAGtCjC,EAAGmD,UAAU8F,OAAS,SAAiBC,GACrC,OAAsB,IAAlBzF,KAAKC,SACAD,KAAK0F,MAAMC,MAAMF,GAAOG,MAAM,GAEhC5F,KAAK+C,SAGdxG,EAAGmD,UAAUmG,SAAW,SAAmBJ,GACzC,OAAIzF,KAAKpB,MAAM6G,EAAQ,GACdzF,KAAK8F,KAAKL,GAAOG,MAAM,GAAGG,OAE5B/F,KAAK+C,SAGdxG,EAAGmD,UAAUsG,MAAQ,WACnB,OAAyB,IAAlBhG,KAAKC,UAId1D,EAAGmD,UAAUuG,IAAM,WACjB,OAAOjG,KAAK+C,QAAQgD,QAGtBxJ,EAAGmD,UAAUqG,KAAO,WAKlB,OAJK/F,KAAKoE,WACRpE,KAAKC,UAAY,GAGZD,MAITzD,EAAGmD,UAAUwG,KAAO,SAAe5H,GACjC,KAAO0B,KAAKrC,OAASW,EAAIX,QACvBqC,KAAKE,MAAMF,KAAKrC,UAAY,EAG9B,IAAK,IAAIP,EAAI,EAAGA,EAAIkB,EAAIX,OAAQP,IAC9B4C,KAAKE,MAAM9C,GAAK4C,KAAKE,MAAM9C,GAAKkB,EAAI4B,MAAM9C,GAG5C,OAAO4C,KAAKqC,SAGd9F,EAAGmD,UAAUyG,IAAM,SAAc7H,GAE/B,OADAW,EAA0C,IAAlCe,KAAKC,SAAW3B,EAAI2B,WACrBD,KAAKkG,KAAK5H,IAInB/B,EAAGmD,UAAU0G,GAAK,SAAa9H,GAC7B,OAAI0B,KAAKrC,OAASW,EAAIX,OAAeqC,KAAK+C,QAAQoD,IAAI7H,GAC/CA,EAAIyE,QAAQoD,IAAInG,OAGzBzD,EAAGmD,UAAU2G,IAAM,SAAc/H,GAC/B,OAAI0B,KAAKrC,OAASW,EAAIX,OAAeqC,KAAK+C,QAAQmD,KAAK5H,GAChDA,EAAIyE,QAAQmD,KAAKlG,OAI1BzD,EAAGmD,UAAU4G,MAAQ,SAAgBhI,GAEnC,IAAIqF,EAEFA,EADE3D,KAAKrC,OAASW,EAAIX,OAChBW,EAEA0B,KAGN,IAAK,IAAI5C,EAAI,EAAGA,EAAIuG,EAAEhG,OAAQP,IAC5B4C,KAAKE,MAAM9C,GAAK4C,KAAKE,MAAM9C,GAAKkB,EAAI4B,MAAM9C,GAK5C,OAFA4C,KAAKrC,OAASgG,EAAEhG,OAETqC,KAAKqC,SAGd9F,EAAGmD,UAAU6G,KAAO,SAAejI,GAEjC,OADAW,EAA0C,IAAlCe,KAAKC,SAAW3B,EAAI2B,WACrBD,KAAKsG,MAAMhI,IAIpB/B,EAAGmD,UAAU8G,IAAM,SAAclI,GAC/B,OAAI0B,KAAKrC,OAASW,EAAIX,OAAeqC,KAAK+C,QAAQwD,KAAKjI,GAChDA,EAAIyE,QAAQwD,KAAKvG,OAG1BzD,EAAGmD,UAAU+G,KAAO,SAAenI,GACjC,OAAI0B,KAAKrC,OAASW,EAAIX,OAAeqC,KAAK+C,QAAQuD,MAAMhI,GACjDA,EAAIyE,QAAQuD,MAAMtG,OAI3BzD,EAAGmD,UAAUgH,MAAQ,SAAgBpI,GAEnC,IAAIoF,EACAC,EACA3D,KAAKrC,OAASW,EAAIX,QACpB+F,EAAI1D,KACJ2D,EAAIrF,IAEJoF,EAAIpF,EACJqF,EAAI3D,MAGN,IAAK,IAAI5C,EAAI,EAAGA,EAAIuG,EAAEhG,OAAQP,IAC5B4C,KAAKE,MAAM9C,GAAKsG,EAAExD,MAAM9C,GAAKuG,EAAEzD,MAAM9C,GAGvC,GAAI4C,OAAS0D,EACX,KAAOtG,EAAIsG,EAAE/F,OAAQP,IACnB4C,KAAKE,MAAM9C,GAAKsG,EAAExD,MAAM9C,GAM5B,OAFA4C,KAAKrC,OAAS+F,EAAE/F,OAETqC,KAAKqC,SAGd9F,EAAGmD,UAAUiH,KAAO,SAAerI,GAEjC,OADAW,EAA0C,IAAlCe,KAAKC,SAAW3B,EAAI2B,WACrBD,KAAK0G,MAAMpI,IAIpB/B,EAAGmD,UAAUkH,IAAM,SAActI,GAC/B,OAAI0B,KAAKrC,OAASW,EAAIX,OAAeqC,KAAK+C,QAAQ4D,KAAKrI,GAChDA,EAAIyE,QAAQ4D,KAAK3G,OAG1BzD,EAAGmD,UAAUmH,KAAO,SAAevI,GACjC,OAAI0B,KAAKrC,OAASW,EAAIX,OAAeqC,KAAK+C,QAAQ2D,MAAMpI,GACjDA,EAAIyE,QAAQ2D,MAAM1G,OAI3BzD,EAAGmD,UAAUiG,MAAQ,SAAgBF,GACnCxG,EAAwB,iBAAVwG,GAAsBA,GAAS,GAE7C,IAAIqB,EAAsC,EAAxBvJ,KAAKC,KAAKiI,EAAQ,IAChCsB,EAAWtB,EAAQ,GAGvBzF,KAAKgD,QAAQ8D,GAETC,EAAW,GACbD,IAIF,IAAK,IAAI1J,EAAI,EAAGA,EAAI0J,EAAa1J,IAC/B4C,KAAKE,MAAM9C,GAAsB,UAAhB4C,KAAKE,MAAM9C,GAS9B,OALI2J,EAAW,IACb/G,KAAKE,MAAM9C,IAAM4C,KAAKE,MAAM9C,GAAM,UAAc,GAAK2J,GAIhD/G,KAAKqC,SAGd9F,EAAGmD,UAAUoG,KAAO,SAAeL,GACjC,OAAOzF,KAAK+C,QAAQ4C,MAAMF,IAI5BlJ,EAAGmD,UAAUsH,KAAO,SAAeC,EAAK/H,GACtCD,EAAsB,iBAARgI,GAAoBA,GAAO,GAEzC,IAAI7E,EAAO6E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARAjH,KAAKgD,QAAQZ,EAAM,GAGjBpC,KAAKE,MAAMkC,GADTlD,EACgBc,KAAKE,MAAMkC,GAAQ,GAAK8E,EAExBlH,KAAKE,MAAMkC,KAAS,GAAK8E,GAGtClH,KAAKqC,SAId9F,EAAGmD,UAAUf,KAAO,SAAeL,GACjC,IAAIyC,EAkBA2C,EAAGC,EAfP,GAAsB,IAAlB3D,KAAKC,UAAmC,IAAjB3B,EAAI2B,SAI7B,OAHAD,KAAKC,SAAW,EAChBc,EAAIf,KAAKmH,KAAK7I,GACd0B,KAAKC,UAAY,EACVD,KAAKkD,YAGP,GAAsB,IAAlBlD,KAAKC,UAAmC,IAAjB3B,EAAI2B,SAIpC,OAHA3B,EAAI2B,SAAW,EACfc,EAAIf,KAAKmH,KAAK7I,GACdA,EAAI2B,SAAW,EACRc,EAAEmC,YAKPlD,KAAKrC,OAASW,EAAIX,QACpB+F,EAAI1D,KACJ2D,EAAIrF,IAEJoF,EAAIpF,EACJqF,EAAI3D,MAIN,IADA,IAAI6D,EAAQ,EACHzG,EAAI,EAAGA,EAAIuG,EAAEhG,OAAQP,IAC5B2D,GAAkB,EAAb2C,EAAExD,MAAM9C,KAAwB,EAAbuG,EAAEzD,MAAM9C,IAAUyG,EAC1C7D,KAAKE,MAAM9C,GAAS,SAAJ2D,EAChB8C,EAAQ9C,IAAM,GAEhB,KAAiB,IAAV8C,GAAezG,EAAIsG,EAAE/F,OAAQP,IAClC2D,GAAkB,EAAb2C,EAAExD,MAAM9C,IAAUyG,EACvB7D,KAAKE,MAAM9C,GAAS,SAAJ2D,EAChB8C,EAAQ9C,IAAM,GAIhB,GADAf,KAAKrC,OAAS+F,EAAE/F,OACF,IAAVkG,EACF7D,KAAKE,MAAMF,KAAKrC,QAAUkG,EAC1B7D,KAAKrC,cAEA,GAAI+F,IAAM1D,KACf,KAAO5C,EAAIsG,EAAE/F,OAAQP,IACnB4C,KAAKE,MAAM9C,GAAKsG,EAAExD,MAAM9C,GAI5B,OAAO4C,MAITzD,EAAGmD,UAAU0H,IAAM,SAAc9I,GAC/B,IAAInB,EACJ,OAAqB,IAAjBmB,EAAI2B,UAAoC,IAAlBD,KAAKC,UAC7B3B,EAAI2B,SAAW,EACf9C,EAAM6C,KAAKqH,IAAI/I,GACfA,EAAI2B,UAAY,EACT9C,GACmB,IAAjBmB,EAAI2B,UAAoC,IAAlBD,KAAKC,UACpCD,KAAKC,SAAW,EAChB9C,EAAMmB,EAAI+I,IAAIrH,MACdA,KAAKC,SAAW,EACT9C,GAGL6C,KAAKrC,OAASW,EAAIX,OAAeqC,KAAK+C,QAAQpE,KAAKL,GAEhDA,EAAIyE,QAAQpE,KAAKqB,OAI1BzD,EAAGmD,UAAUyH,KAAO,SAAe7I,GAEjC,GAAqB,IAAjBA,EAAI2B,SAAgB,CACtB3B,EAAI2B,SAAW,EACf,IAAIc,EAAIf,KAAKrB,KAAKL,GAElB,OADAA,EAAI2B,SAAW,EACRc,EAAEmC,YAGJ,GAAsB,IAAlBlD,KAAKC,SAId,OAHAD,KAAKC,SAAW,EAChBD,KAAKrB,KAAKL,GACV0B,KAAKC,SAAW,EACTD,KAAKkD,YAId,IAWIQ,EAAGC,EAXH9E,EAAMmB,KAAKnB,IAAIP,GAGnB,GAAY,IAARO,EAIF,OAHAmB,KAAKC,SAAW,EAChBD,KAAKrC,OAAS,EACdqC,KAAKE,MAAM,GAAK,EACTF,KAKLnB,EAAM,GACR6E,EAAI1D,KACJ2D,EAAIrF,IAEJoF,EAAIpF,EACJqF,EAAI3D,MAIN,IADA,IAAI6D,EAAQ,EACHzG,EAAI,EAAGA,EAAIuG,EAAEhG,OAAQP,IAE5ByG,GADA9C,GAAkB,EAAb2C,EAAExD,MAAM9C,KAAwB,EAAbuG,EAAEzD,MAAM9C,IAAUyG,IAC7B,GACb7D,KAAKE,MAAM9C,GAAS,SAAJ2D,EAElB,KAAiB,IAAV8C,GAAezG,EAAIsG,EAAE/F,OAAQP,IAElCyG,GADA9C,GAAkB,EAAb2C,EAAExD,MAAM9C,IAAUyG,IACV,GACb7D,KAAKE,MAAM9C,GAAS,SAAJ2D,EAIlB,GAAc,IAAV8C,GAAezG,EAAIsG,EAAE/F,QAAU+F,IAAM1D,KACvC,KAAO5C,EAAIsG,EAAE/F,OAAQP,IACnB4C,KAAKE,MAAM9C,GAAKsG,EAAExD,MAAM9C,GAU5B,OANA4C,KAAKrC,OAASJ,KAAKkE,IAAIzB,KAAKrC,OAAQP,GAEhCsG,IAAM1D,OACRA,KAAKC,SAAW,GAGXD,KAAKqC,SAId9F,EAAGmD,UAAU2H,IAAM,SAAc/I,GAC/B,OAAO0B,KAAK+C,QAAQoE,KAAK7I,IA+C3B,IAAIgJ,EAAc,SAAsB9D,EAAMlF,EAAKmF,GACjD,IAIIG,EACA2D,EACAjC,EANA5B,EAAIF,EAAKtD,MACTyD,EAAIrF,EAAI4B,MACRsH,EAAI/D,EAAIvD,MACRS,EAAI,EAIJ8G,EAAY,EAAP/D,EAAE,GACPgE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,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,EAAP5F,EAAE,GACP6F,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,GAAMF,IAAO,GACbG,GAAY,EAAP3G,EAAE,GACP4G,GAAW,KAALD,GACNE,GAAMF,KAAO,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,GAEjBzH,EAAIxD,SAAWuD,EAAKvD,SAAW3B,EAAI2B,SACnCwD,EAAI9F,OAAS,GAMb,IAAI0N,IAAQ1K,GAJZiD,EAAKrG,KAAK+N,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAMhK,KAAK+N,KAAK5D,EAAK+B,IACRlM,KAAK+N,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrD7I,IAFA2E,EAAK/H,KAAK+N,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAENzH,EAAKrG,KAAK+N,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAMhK,KAAK+N,KAAKzD,EAAK4B,IACRlM,KAAK+N,KAAKxD,EAAK0B,GAAQ,EACpClE,EAAK/H,KAAK+N,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQ5K,GAJZiD,EAAMA,EAAKrG,KAAK+N,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK5D,EAAKkC,GAAQ,GACvBrM,KAAK+N,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrDhJ,IAFA2E,EAAMA,EAAK/H,KAAK+N,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAEN3H,EAAKrG,KAAK+N,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAMhK,KAAK+N,KAAKtD,EAAKyB,IACRlM,KAAK+N,KAAKrD,EAAKuB,GAAQ,EACpClE,EAAK/H,KAAK+N,KAAKrD,EAAKwB,GACpB7F,EAAMA,EAAKrG,KAAK+N,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKzD,EAAK+B,GAAQ,GACvBrM,KAAK+N,KAAKxD,EAAK6B,GAAQ,EACpCrE,EAAMA,EAAK/H,KAAK+N,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQ7K,GAJZiD,EAAMA,EAAKrG,KAAK+N,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK5D,EAAKqC,GAAQ,GACvBxM,KAAK+N,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrDnJ,IAFA2E,EAAMA,EAAK/H,KAAK+N,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAEN5H,EAAKrG,KAAK+N,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAMhK,KAAK+N,KAAKnD,EAAKsB,IACRlM,KAAK+N,KAAKlD,EAAKoB,GAAQ,EACpClE,EAAK/H,KAAK+N,KAAKlD,EAAKqB,GACpB7F,EAAMA,EAAKrG,KAAK+N,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKtD,EAAK4B,GAAQ,GACvBrM,KAAK+N,KAAKrD,EAAK0B,GAAQ,EACpCrE,EAAMA,EAAK/H,KAAK+N,KAAKrD,EAAK2B,GAAQ,EAClChG,EAAMA,EAAKrG,KAAK+N,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKzD,EAAKkC,GAAQ,GACvBxM,KAAK+N,KAAKxD,EAAKgC,GAAQ,EACpCxE,EAAMA,EAAK/H,KAAK+N,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQ9K,GAJZiD,EAAMA,EAAKrG,KAAK+N,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK5D,EAAKwC,GAAQ,GACvB3M,KAAK+N,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrDtJ,IAFA2E,EAAMA,EAAK/H,KAAK+N,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAEN7H,EAAKrG,KAAK+N,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAMhK,KAAK+N,KAAKhD,EAAKmB,IACRlM,KAAK+N,KAAK/C,EAAKiB,GAAQ,EACpClE,EAAK/H,KAAK+N,KAAK/C,EAAKkB,GACpB7F,EAAMA,EAAKrG,KAAK+N,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKnD,EAAKyB,GAAQ,GACvBrM,KAAK+N,KAAKlD,EAAKuB,GAAQ,EACpCrE,EAAMA,EAAK/H,KAAK+N,KAAKlD,EAAKwB,GAAQ,EAClChG,EAAMA,EAAKrG,KAAK+N,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKtD,EAAK+B,GAAQ,GACvBxM,KAAK+N,KAAKrD,EAAK6B,GAAQ,EACpCxE,EAAMA,EAAK/H,KAAK+N,KAAKrD,EAAK8B,GAAQ,EAClCnG,EAAMA,EAAKrG,KAAK+N,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKzD,EAAKqC,GAAQ,GACvB3M,KAAK+N,KAAKxD,EAAKmC,GAAQ,EACpC3E,EAAMA,EAAK/H,KAAK+N,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQ/K,GAJZiD,EAAMA,EAAKrG,KAAK+N,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK5D,EAAK2C,IAAQ,GACvB9M,KAAK+N,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrDzJ,IAFA2E,EAAMA,EAAK/H,KAAK+N,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAEN9H,EAAKrG,KAAK+N,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAMhK,KAAK+N,KAAK7C,EAAKgB,IACRlM,KAAK+N,KAAK5C,EAAKc,GAAQ,EACpClE,EAAK/H,KAAK+N,KAAK5C,EAAKe,GACpB7F,EAAMA,EAAKrG,KAAK+N,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKhD,EAAKsB,GAAQ,GACvBrM,KAAK+N,KAAK/C,EAAKoB,GAAQ,EACpCrE,EAAMA,EAAK/H,KAAK+N,KAAK/C,EAAKqB,GAAQ,EAClChG,EAAMA,EAAKrG,KAAK+N,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKnD,EAAK4B,GAAQ,GACvBxM,KAAK+N,KAAKlD,EAAK0B,GAAQ,EACpCxE,EAAMA,EAAK/H,KAAK+N,KAAKlD,EAAK2B,GAAQ,EAClCnG,EAAMA,EAAKrG,KAAK+N,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKtD,EAAKkC,GAAQ,GACvB3M,KAAK+N,KAAKrD,EAAKgC,GAAQ,EACpC3E,EAAMA,EAAK/H,KAAK+N,KAAKrD,EAAKiC,GAAQ,EAClCtG,EAAMA,EAAKrG,KAAK+N,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKzD,EAAKwC,IAAQ,GACvB9M,KAAK+N,KAAKxD,EAAKsC,GAAQ,EACpC9E,EAAMA,EAAK/H,KAAK+N,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQhL,GAJZiD,EAAMA,EAAKrG,KAAK+N,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK5D,EAAK8C,IAAQ,GACvBjN,KAAK+N,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrD5J,IAFA2E,EAAMA,EAAK/H,KAAK+N,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAKrG,KAAK+N,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAMhK,KAAK+N,KAAK1C,EAAKa,IACRlM,KAAK+N,KAAKzC,EAAKW,GAAQ,EACpClE,EAAK/H,KAAK+N,KAAKzC,EAAKY,GACpB7F,EAAMA,EAAKrG,KAAK+N,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK7C,EAAKmB,GAAQ,GACvBrM,KAAK+N,KAAK5C,EAAKiB,GAAQ,EACpCrE,EAAMA,EAAK/H,KAAK+N,KAAK5C,EAAKkB,GAAQ,EAClChG,EAAMA,EAAKrG,KAAK+N,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKhD,EAAKyB,GAAQ,GACvBxM,KAAK+N,KAAK/C,EAAKuB,GAAQ,EACpCxE,EAAMA,EAAK/H,KAAK+N,KAAK/C,EAAKwB,GAAQ,EAClCnG,EAAMA,EAAKrG,KAAK+N,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKnD,EAAK+B,GAAQ,GACvB3M,KAAK+N,KAAKlD,EAAK6B,GAAQ,EACpC3E,EAAMA,EAAK/H,KAAK+N,KAAKlD,EAAK8B,GAAQ,EAClCtG,EAAMA,EAAKrG,KAAK+N,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKtD,EAAKqC,IAAQ,GACvB9M,KAAK+N,KAAKrD,EAAKmC,GAAQ,EACpC9E,EAAMA,EAAK/H,KAAK+N,KAAKrD,EAAKoC,IAAQ,EAClCzG,EAAMA,EAAKrG,KAAK+N,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKzD,EAAK2C,IAAQ,GACvBjN,KAAK+N,KAAKxD,EAAKyC,IAAQ,EACpCjF,EAAMA,EAAK/H,KAAK+N,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQjL,GAJZiD,EAAMA,EAAKrG,KAAK+N,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK5D,EAAKiD,IAAQ,GACvBpN,KAAK+N,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrD/J,IAFA2E,EAAMA,EAAK/H,KAAK+N,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENhI,EAAKrG,KAAK+N,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAMhK,KAAK+N,KAAKvC,EAAKU,IACRlM,KAAK+N,KAAKtC,EAAKQ,GAAQ,EACpClE,EAAK/H,KAAK+N,KAAKtC,EAAKS,GACpB7F,EAAMA,EAAKrG,KAAK+N,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK1C,EAAKgB,GAAQ,GACvBrM,KAAK+N,KAAKzC,EAAKc,GAAQ,EACpCrE,EAAMA,EAAK/H,KAAK+N,KAAKzC,EAAKe,GAAQ,EAClChG,EAAMA,EAAKrG,KAAK+N,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK7C,EAAKsB,GAAQ,GACvBxM,KAAK+N,KAAK5C,EAAKoB,GAAQ,EACpCxE,EAAMA,EAAK/H,KAAK+N,KAAK5C,EAAKqB,GAAQ,EAClCnG,EAAMA,EAAKrG,KAAK+N,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKhD,EAAK4B,GAAQ,GACvB3M,KAAK+N,KAAK/C,EAAK0B,GAAQ,EACpC3E,EAAMA,EAAK/H,KAAK+N,KAAK/C,EAAK2B,GAAQ,EAClCtG,EAAMA,EAAKrG,KAAK+N,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKnD,EAAKkC,IAAQ,GACvB9M,KAAK+N,KAAKlD,EAAKgC,GAAQ,EACpC9E,EAAMA,EAAK/H,KAAK+N,KAAKlD,EAAKiC,IAAQ,EAClCzG,EAAMA,EAAKrG,KAAK+N,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKtD,EAAKwC,IAAQ,GACvBjN,KAAK+N,KAAKrD,EAAKsC,IAAQ,EACpCjF,EAAMA,EAAK/H,KAAK+N,KAAKrD,EAAKuC,IAAQ,EAClC5G,EAAMA,EAAKrG,KAAK+N,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKzD,EAAK8C,IAAQ,GACvBpN,KAAK+N,KAAKxD,EAAK4C,IAAQ,EACpCpF,EAAMA,EAAK/H,KAAK+N,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQlL,GAJZiD,EAAMA,EAAKrG,KAAK+N,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK5D,EAAKoD,IAAQ,GACvBvN,KAAK+N,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrDlK,IAFA2E,EAAMA,EAAK/H,KAAK+N,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAKrG,KAAK+N,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAMhK,KAAK+N,KAAKpC,EAAKO,IACRlM,KAAK+N,KAAKnC,EAAKK,GAAQ,EACpClE,EAAK/H,KAAK+N,KAAKnC,EAAKM,GACpB7F,EAAMA,EAAKrG,KAAK+N,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKvC,EAAKa,GAAQ,GACvBrM,KAAK+N,KAAKtC,EAAKW,GAAQ,EACpCrE,EAAMA,EAAK/H,KAAK+N,KAAKtC,EAAKY,GAAQ,EAClChG,EAAMA,EAAKrG,KAAK+N,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK1C,EAAKmB,GAAQ,GACvBxM,KAAK+N,KAAKzC,EAAKiB,GAAQ,EACpCxE,EAAMA,EAAK/H,KAAK+N,KAAKzC,EAAKkB,GAAQ,EAClCnG,EAAMA,EAAKrG,KAAK+N,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK7C,EAAKyB,GAAQ,GACvB3M,KAAK+N,KAAK5C,EAAKuB,GAAQ,EACpC3E,EAAMA,EAAK/H,KAAK+N,KAAK5C,EAAKwB,GAAQ,EAClCtG,EAAMA,EAAKrG,KAAK+N,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKhD,EAAK+B,IAAQ,GACvB9M,KAAK+N,KAAK/C,EAAK6B,GAAQ,EACpC9E,EAAMA,EAAK/H,KAAK+N,KAAK/C,EAAK8B,IAAQ,EAClCzG,EAAMA,EAAKrG,KAAK+N,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKnD,EAAKqC,IAAQ,GACvBjN,KAAK+N,KAAKlD,EAAKmC,IAAQ,EACpCjF,EAAMA,EAAK/H,KAAK+N,KAAKlD,EAAKoC,IAAQ,EAClC5G,EAAMA,EAAKrG,KAAK+N,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKtD,EAAK2C,IAAQ,GACvBpN,KAAK+N,KAAKrD,EAAKyC,IAAQ,EACpCpF,EAAMA,EAAK/H,KAAK+N,KAAKrD,EAAK0C,IAAQ,EAClC/G,EAAMA,EAAKrG,KAAK+N,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKzD,EAAKiD,IAAQ,GACvBvN,KAAK+N,KAAKxD,EAAK+C,IAAQ,EACpCvF,EAAMA,EAAK/H,KAAK+N,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQnL,GAJZiD,EAAMA,EAAKrG,KAAK+N,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK5D,EAAKuD,IAAQ,GACvB1N,KAAK+N,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrDrK,IAFA2E,EAAMA,EAAK/H,KAAK+N,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAKrG,KAAK+N,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAMhK,KAAK+N,KAAKjC,EAAKI,IACRlM,KAAK+N,KAAKhC,EAAKE,GAAQ,EACpClE,EAAK/H,KAAK+N,KAAKhC,EAAKG,GACpB7F,EAAMA,EAAKrG,KAAK+N,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKpC,EAAKU,GAAQ,GACvBrM,KAAK+N,KAAKnC,EAAKQ,GAAQ,EACpCrE,EAAMA,EAAK/H,KAAK+N,KAAKnC,EAAKS,GAAQ,EAClChG,EAAMA,EAAKrG,KAAK+N,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKvC,EAAKgB,GAAQ,GACvBxM,KAAK+N,KAAKtC,EAAKc,GAAQ,EACpCxE,EAAMA,EAAK/H,KAAK+N,KAAKtC,EAAKe,GAAQ,EAClCnG,EAAMA,EAAKrG,KAAK+N,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK1C,EAAKsB,GAAQ,GACvB3M,KAAK+N,KAAKzC,EAAKoB,GAAQ,EACpC3E,EAAMA,EAAK/H,KAAK+N,KAAKzC,EAAKqB,GAAQ,EAClCtG,EAAMA,EAAKrG,KAAK+N,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK7C,EAAK4B,IAAQ,GACvB9M,KAAK+N,KAAK5C,EAAK0B,GAAQ,EACpC9E,EAAMA,EAAK/H,KAAK+N,KAAK5C,EAAK2B,IAAQ,EAClCzG,EAAMA,EAAKrG,KAAK+N,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKhD,EAAKkC,IAAQ,GACvBjN,KAAK+N,KAAK/C,EAAKgC,IAAQ,EACpCjF,EAAMA,EAAK/H,KAAK+N,KAAK/C,EAAKiC,IAAQ,EAClC5G,EAAMA,EAAKrG,KAAK+N,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKnD,EAAKwC,IAAQ,GACvBpN,KAAK+N,KAAKlD,EAAKsC,IAAQ,EACpCpF,EAAMA,EAAK/H,KAAK+N,KAAKlD,EAAKuC,IAAQ,EAClC/G,EAAMA,EAAKrG,KAAK+N,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKtD,EAAK8C,IAAQ,GACvBvN,KAAK+N,KAAKrD,EAAK4C,IAAQ,EACpCvF,EAAMA,EAAK/H,KAAK+N,KAAKrD,EAAK6C,IAAQ,EAClClH,EAAMA,EAAKrG,KAAK+N,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKzD,EAAKoD,IAAQ,GACvB1N,KAAK+N,KAAKxD,EAAKkD,IAAQ,EACpC1F,EAAMA,EAAK/H,KAAK+N,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQpL,GAJZiD,EAAMA,EAAKrG,KAAK+N,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK5D,EAAK0D,IAAQ,GACvB7N,KAAK+N,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrDxK,IAFA2E,EAAMA,EAAK/H,KAAK+N,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAKrG,KAAK+N,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAMhK,KAAK+N,KAAKjC,EAAKO,IACRrM,KAAK+N,KAAKhC,EAAKK,GAAQ,EACpCrE,EAAK/H,KAAK+N,KAAKhC,EAAKM,GACpBhG,EAAMA,EAAKrG,KAAK+N,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKpC,EAAKa,GAAQ,GACvBxM,KAAK+N,KAAKnC,EAAKW,GAAQ,EACpCxE,EAAMA,EAAK/H,KAAK+N,KAAKnC,EAAKY,GAAQ,EAClCnG,EAAMA,EAAKrG,KAAK+N,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKvC,EAAKmB,GAAQ,GACvB3M,KAAK+N,KAAKtC,EAAKiB,GAAQ,EACpC3E,EAAMA,EAAK/H,KAAK+N,KAAKtC,EAAKkB,GAAQ,EAClCtG,EAAMA,EAAKrG,KAAK+N,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK1C,EAAKyB,IAAQ,GACvB9M,KAAK+N,KAAKzC,EAAKuB,GAAQ,EACpC9E,EAAMA,EAAK/H,KAAK+N,KAAKzC,EAAKwB,IAAQ,EAClCzG,EAAMA,EAAKrG,KAAK+N,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK7C,EAAK+B,IAAQ,GACvBjN,KAAK+N,KAAK5C,EAAK6B,IAAQ,EACpCjF,EAAMA,EAAK/H,KAAK+N,KAAK5C,EAAK8B,IAAQ,EAClC5G,EAAMA,EAAKrG,KAAK+N,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKhD,EAAKqC,IAAQ,GACvBpN,KAAK+N,KAAK/C,EAAKmC,IAAQ,EACpCpF,EAAMA,EAAK/H,KAAK+N,KAAK/C,EAAKoC,IAAQ,EAClC/G,EAAMA,EAAKrG,KAAK+N,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKnD,EAAK2C,IAAQ,GACvBvN,KAAK+N,KAAKlD,EAAKyC,IAAQ,EACpCvF,EAAMA,EAAK/H,KAAK+N,KAAKlD,EAAK0C,IAAQ,EAClClH,EAAMA,EAAKrG,KAAK+N,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKtD,EAAKiD,IAAQ,GACvB1N,KAAK+N,KAAKrD,EAAK+C,IAAQ,EACpC1F,EAAMA,EAAK/H,KAAK+N,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAASrL,GAJbiD,EAAMA,EAAKrG,KAAK+N,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKzD,EAAKuD,IAAQ,GACvB7N,KAAK+N,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtDxK,IAFA2E,EAAMA,EAAK/H,KAAK+N,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEPpI,EAAKrG,KAAK+N,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAMhK,KAAK+N,KAAKjC,EAAKU,IACRxM,KAAK+N,KAAKhC,EAAKQ,GAAQ,EACpCxE,EAAK/H,KAAK+N,KAAKhC,EAAKS,GACpBnG,EAAMA,EAAKrG,KAAK+N,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKpC,EAAKgB,GAAQ,GACvB3M,KAAK+N,KAAKnC,EAAKc,GAAQ,EACpC3E,EAAMA,EAAK/H,KAAK+N,KAAKnC,EAAKe,GAAQ,EAClCtG,EAAMA,EAAKrG,KAAK+N,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKvC,EAAKsB,IAAQ,GACvB9M,KAAK+N,KAAKtC,EAAKoB,GAAQ,EACpC9E,EAAMA,EAAK/H,KAAK+N,KAAKtC,EAAKqB,IAAQ,EAClCzG,EAAMA,EAAKrG,KAAK+N,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK1C,EAAK4B,IAAQ,GACvBjN,KAAK+N,KAAKzC,EAAK0B,IAAQ,EACpCjF,EAAMA,EAAK/H,KAAK+N,KAAKzC,EAAK2B,IAAQ,EAClC5G,EAAMA,EAAKrG,KAAK+N,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK7C,EAAKkC,IAAQ,GACvBpN,KAAK+N,KAAK5C,EAAKgC,IAAQ,EACpCpF,EAAMA,EAAK/H,KAAK+N,KAAK5C,EAAKiC,IAAQ,EAClC/G,EAAMA,EAAKrG,KAAK+N,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKhD,EAAKwC,IAAQ,GACvBvN,KAAK+N,KAAK/C,EAAKsC,IAAQ,EACpCvF,EAAMA,EAAK/H,KAAK+N,KAAK/C,EAAKuC,IAAQ,EAClClH,EAAMA,EAAKrG,KAAK+N,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKnD,EAAK8C,IAAQ,GACvB1N,KAAK+N,KAAKlD,EAAK4C,IAAQ,EACpC1F,EAAMA,EAAK/H,KAAK+N,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAAStL,GAJbiD,EAAMA,EAAKrG,KAAK+N,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKtD,EAAKoD,IAAQ,GACvB7N,KAAK+N,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtDxK,IAFA2E,EAAMA,EAAK/H,KAAK+N,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEPrI,EAAKrG,KAAK+N,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAMhK,KAAK+N,KAAKjC,EAAKa,IACR3M,KAAK+N,KAAKhC,EAAKW,GAAQ,EACpC3E,EAAK/H,KAAK+N,KAAKhC,EAAKY,GACpBtG,EAAMA,EAAKrG,KAAK+N,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKpC,EAAKmB,IAAQ,GACvB9M,KAAK+N,KAAKnC,EAAKiB,GAAQ,EACpC9E,EAAMA,EAAK/H,KAAK+N,KAAKnC,EAAKkB,IAAQ,EAClCzG,EAAMA,EAAKrG,KAAK+N,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKvC,EAAKyB,IAAQ,GACvBjN,KAAK+N,KAAKtC,EAAKuB,IAAQ,EACpCjF,EAAMA,EAAK/H,KAAK+N,KAAKtC,EAAKwB,IAAQ,EAClC5G,EAAMA,EAAKrG,KAAK+N,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK1C,EAAK+B,IAAQ,GACvBpN,KAAK+N,KAAKzC,EAAK6B,IAAQ,EACpCpF,EAAMA,EAAK/H,KAAK+N,KAAKzC,EAAK8B,IAAQ,EAClC/G,EAAMA,EAAKrG,KAAK+N,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK7C,EAAKqC,IAAQ,GACvBvN,KAAK+N,KAAK5C,EAAKmC,IAAQ,EACpCvF,EAAMA,EAAK/H,KAAK+N,KAAK5C,EAAKoC,IAAQ,EAClClH,EAAMA,EAAKrG,KAAK+N,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKhD,EAAK2C,IAAQ,GACvB1N,KAAK+N,KAAK/C,EAAKyC,IAAQ,EACpC1F,EAAMA,EAAK/H,KAAK+N,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAASvL,GAJbiD,EAAMA,EAAKrG,KAAK+N,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKnD,EAAKiD,IAAQ,GACvB7N,KAAK+N,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtDxK,IAFA2E,EAAMA,EAAK/H,KAAK+N,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEPtI,EAAKrG,KAAK+N,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAMhK,KAAK+N,KAAKjC,EAAKgB,KACR9M,KAAK+N,KAAKhC,EAAKc,GAAQ,EACpC9E,EAAK/H,KAAK+N,KAAKhC,EAAKe,IACpBzG,EAAMA,EAAKrG,KAAK+N,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKpC,EAAKsB,IAAQ,GACvBjN,KAAK+N,KAAKnC,EAAKoB,IAAQ,EACpCjF,EAAMA,EAAK/H,KAAK+N,KAAKnC,EAAKqB,IAAQ,EAClC5G,EAAMA,EAAKrG,KAAK+N,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKvC,EAAK4B,IAAQ,GACvBpN,KAAK+N,KAAKtC,EAAK0B,IAAQ,EACpCpF,EAAMA,EAAK/H,KAAK+N,KAAKtC,EAAK2B,IAAQ,EAClC/G,EAAMA,EAAKrG,KAAK+N,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK1C,EAAKkC,IAAQ,GACvBvN,KAAK+N,KAAKzC,EAAKgC,IAAQ,EACpCvF,EAAMA,EAAK/H,KAAK+N,KAAKzC,EAAKiC,IAAQ,EAClClH,EAAMA,EAAKrG,KAAK+N,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK7C,EAAKwC,IAAQ,GACvB1N,KAAK+N,KAAK5C,EAAKsC,IAAQ,EACpC1F,EAAMA,EAAK/H,KAAK+N,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAASxL,GAJbiD,EAAMA,EAAKrG,KAAK+N,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKhD,EAAK8C,IAAQ,GACvB7N,KAAK+N,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtDxK,IAFA2E,EAAMA,EAAK/H,KAAK+N,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEPvI,EAAKrG,KAAK+N,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAMhK,KAAK+N,KAAKjC,EAAKmB,KACRjN,KAAK+N,KAAKhC,EAAKiB,IAAQ,EACpCjF,EAAK/H,KAAK+N,KAAKhC,EAAKkB,IACpB5G,EAAMA,EAAKrG,KAAK+N,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKpC,EAAKyB,IAAQ,GACvBpN,KAAK+N,KAAKnC,EAAKuB,IAAQ,EACpCpF,EAAMA,EAAK/H,KAAK+N,KAAKnC,EAAKwB,IAAQ,EAClC/G,EAAMA,EAAKrG,KAAK+N,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKvC,EAAK+B,IAAQ,GACvBvN,KAAK+N,KAAKtC,EAAK6B,IAAQ,EACpCvF,EAAMA,EAAK/H,KAAK+N,KAAKtC,EAAK8B,IAAQ,EAClClH,EAAMA,EAAKrG,KAAK+N,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK1C,EAAKqC,IAAQ,GACvB1N,KAAK+N,KAAKzC,EAAKmC,IAAQ,EACpC1F,EAAMA,EAAK/H,KAAK+N,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAASzL,GAJbiD,EAAMA,EAAKrG,KAAK+N,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK7C,EAAK2C,IAAQ,GACvB7N,KAAK+N,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtDxK,IAFA2E,EAAMA,EAAK/H,KAAK+N,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEPxI,EAAKrG,KAAK+N,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAMhK,KAAK+N,KAAKjC,EAAKsB,KACRpN,KAAK+N,KAAKhC,EAAKoB,IAAQ,EACpCpF,EAAK/H,KAAK+N,KAAKhC,EAAKqB,IACpB/G,EAAMA,EAAKrG,KAAK+N,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKpC,EAAK4B,IAAQ,GACvBvN,KAAK+N,KAAKnC,EAAK0B,IAAQ,EACpCvF,EAAMA,EAAK/H,KAAK+N,KAAKnC,EAAK2B,IAAQ,EAClClH,EAAMA,EAAKrG,KAAK+N,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKvC,EAAKkC,IAAQ,GACvB1N,KAAK+N,KAAKtC,EAAKgC,IAAQ,EACpC1F,EAAMA,EAAK/H,KAAK+N,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAAS1L,GAJbiD,EAAMA,EAAKrG,KAAK+N,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMhK,KAAK+N,KAAK1C,EAAKwC,IAAQ,GACvB7N,KAAK+N,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtDxK,IAFA2E,EAAMA,EAAK/H,KAAK+N,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEPzI,EAAKrG,KAAK+N,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAMhK,KAAK+N,KAAKjC,EAAKyB,KACRvN,KAAK+N,KAAKhC,EAAKuB,IAAQ,EACpCvF,EAAK/H,KAAK+N,KAAKhC,EAAKwB,IACpBlH,EAAMA,EAAKrG,KAAK+N,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKpC,EAAK+B,IAAQ,GACvB1N,KAAK+N,KAAKnC,EAAK6B,IAAQ,EACpC1F,EAAMA,EAAK/H,KAAK+N,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAAS3L,GAJbiD,EAAMA,EAAKrG,KAAK+N,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKvC,EAAKqC,IAAQ,GACvB7N,KAAK+N,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtDxK,IAFA2E,EAAMA,EAAK/H,KAAK+N,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAKrG,KAAK+N,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAMhK,KAAK+N,KAAKjC,EAAK4B,KACR1N,KAAK+N,KAAKhC,EAAK0B,IAAQ,EACpC1F,EAAK/H,KAAK+N,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAAS5L,GAJbiD,EAAMA,EAAKrG,KAAK+N,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMhK,KAAK+N,KAAKpC,EAAKkC,IAAQ,GACvB7N,KAAK+N,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtDxK,IAFA2E,EAAMA,EAAK/H,KAAK+N,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAAS7L,GAJbiD,EAAKrG,KAAK+N,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAMhK,KAAK+N,KAAKjC,EAAK+B,KACR7N,KAAK+N,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBAxK,IAFA2E,EAAK/H,KAAK+N,KAAKhC,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK6D,GACP7D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAAN7L,IACF6G,EAAE,IAAM7G,EACR8C,EAAI9F,UAEC8F,GAiDT,SAASgJ,EAAYjJ,EAAMlF,EAAKmF,GAE9B,OADW,IAAIiJ,GACHC,KAAKnJ,EAAMlF,EAAKmF,GAsB9B,SAASiJ,EAAME,EAAGC,GAChB7M,KAAK4M,EAAIA,EACT5M,KAAK6M,EAAIA,EAvENtP,KAAK+N,OACRhE,EAAc/D,GAiDhBhH,EAAGmD,UAAUoN,MAAQ,SAAgBxO,EAAKmF,GACxC,IACIpC,EAAMrB,KAAKrC,OAASW,EAAIX,OAW5B,OAVoB,KAAhBqC,KAAKrC,QAAgC,KAAfW,EAAIX,OACtB2J,EAAYtH,KAAM1B,EAAKmF,GACpBpC,EAAM,GACTkC,EAAWvD,KAAM1B,EAAKmF,GACnBpC,EAAM,KArDnB,SAAmBmC,EAAMlF,EAAKmF,GAC5BA,EAAIxD,SAAW3B,EAAI2B,SAAWuD,EAAKvD,SACnCwD,EAAI9F,OAAS6F,EAAK7F,OAASW,EAAIX,OAI/B,IAFA,IAAIkG,EAAQ,EACRkJ,EAAU,EACL1P,EAAI,EAAGA,EAAIoG,EAAI9F,OAAS,EAAGN,IAAK,CAGvC,IAAIyG,EAASiJ,EACbA,EAAU,EAGV,IAFA,IAAIhJ,EAAgB,SAARF,EACRG,EAAOzG,KAAK+D,IAAIjE,EAAGiB,EAAIX,OAAS,GAC3BF,EAAIF,KAAKkE,IAAI,EAAGpE,EAAImG,EAAK7F,OAAS,GAAIF,GAAKuG,EAAMvG,IAAK,CAC7D,IAAIL,EAAIC,EAAII,EAGRsD,GAFoB,EAAhByC,EAAKtD,MAAM9C,KACI,EAAfkB,EAAI4B,MAAMzC,IAGdmG,EAAS,SAAJ7C,EAGTgD,EAAa,UADbH,EAAMA,EAAKG,EAAS,GAIpBgJ,IAFAjJ,GAHAA,EAAUA,GAAW/C,EAAI,SAAa,GAAM,IAGxB6C,IAAO,IAAO,KAEZ,GACtBE,GAAU,SAEZL,EAAIvD,MAAM7C,GAAK0G,EACfF,EAAQC,EACRA,EAASiJ,EAQX,OANc,IAAVlJ,EACFJ,EAAIvD,MAAM7C,GAAKwG,EAEfJ,EAAI9F,SAGC8F,EAAIpB,QAgBH2K,CAAShN,KAAM1B,EAAKmF,GAEpBgJ,EAAWzM,KAAM1B,EAAKmF,IAchCiJ,EAAKhN,UAAUuN,QAAU,SAAkBC,GAGzC,IAFA,IAAI9H,EAAI,IAAI7D,MAAM2L,GACdC,EAAI5Q,EAAGmD,UAAUyF,WAAW+H,GAAK,EAC5B9P,EAAI,EAAGA,EAAI8P,EAAG9P,IACrBgI,EAAEhI,GAAK4C,KAAKoN,OAAOhQ,EAAG+P,EAAGD,GAG3B,OAAO9H,GAITsH,EAAKhN,UAAU0N,OAAS,SAAiBR,EAAGO,EAAGD,GAC7C,GAAU,IAANN,GAAWA,IAAMM,EAAI,EAAG,OAAON,EAGnC,IADA,IAAIS,EAAK,EACAjQ,EAAI,EAAGA,EAAI+P,EAAG/P,IACrBiQ,IAAW,EAAJT,IAAWO,EAAI/P,EAAI,EAC1BwP,IAAM,EAGR,OAAOS,GAKTX,EAAKhN,UAAU4N,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAI9P,EAAI,EAAGA,EAAI8P,EAAG9P,IACrBsQ,EAAKtQ,GAAKoQ,EAAID,EAAInQ,IAClBuQ,EAAKvQ,GAAKqQ,EAAIF,EAAInQ,KAItBsP,EAAKhN,UAAUkO,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtEvN,KAAKsN,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQvQ,KAAKwQ,IAAI,EAAIxQ,KAAKyQ,GAAKb,GAC/Bc,EAAQ1Q,KAAK2Q,IAAI,EAAI3Q,KAAKyQ,GAAKb,GAE1BzP,EAAI,EAAGA,EAAIwP,EAAGxP,GAAKyP,EAI1B,IAHA,IAAIgB,EAASL,EACTM,EAASH,EAEJxQ,EAAI,EAAGA,EAAIoQ,EAAGpQ,IAAK,CAC1B,IAAI4Q,EAAKX,EAAKhQ,EAAID,GACd6Q,EAAKX,EAAKjQ,EAAID,GAEd8Q,EAAKb,EAAKhQ,EAAID,EAAIoQ,GAClBW,EAAKb,EAAKjQ,EAAID,EAAIoQ,GAElBY,EAAKN,EAASI,EAAKH,EAASI,EAEhCA,EAAKL,EAASK,EAAKJ,EAASG,EAC5BA,EAAKE,EAELf,EAAKhQ,EAAID,GAAK4Q,EAAKE,EACnBZ,EAAKjQ,EAAID,GAAK6Q,EAAKE,EAEnBd,EAAKhQ,EAAID,EAAIoQ,GAAKQ,EAAKE,EACvBZ,EAAKjQ,EAAID,EAAIoQ,GAAKS,EAAKE,EAGnB/Q,IAAM0P,IACRsB,EAAKX,EAAQK,EAASF,EAAQG,EAE9BA,EAASN,EAAQM,EAASH,EAAQE,EAClCA,EAASM,KAOnB/B,EAAKhN,UAAUgP,YAAc,SAAsBC,EAAGC,GACpD,IAAI1B,EAAqB,EAAjB3P,KAAKkE,IAAImN,EAAGD,GAChBE,EAAU,EAAJ3B,EACN9P,EAAI,EACR,IAAK8P,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/B9P,IAGF,OAAO,GAAKA,EAAI,EAAIyR,GAGtBnC,EAAKhN,UAAUoP,UAAY,SAAoBtB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAI9P,EAAI,EAAGA,EAAI8P,EAAI,EAAG9P,IAAK,CAC9B,IAAIgI,EAAIoI,EAAIpQ,GAEZoQ,EAAIpQ,GAAKoQ,EAAIN,EAAI9P,EAAI,GACrBoQ,EAAIN,EAAI9P,EAAI,GAAKgI,EAEjBA,EAAIqI,EAAIrQ,GAERqQ,EAAIrQ,IAAMqQ,EAAIP,EAAI9P,EAAI,GACtBqQ,EAAIP,EAAI9P,EAAI,IAAMgI,IAItBsH,EAAKhN,UAAUqP,aAAe,SAAuBC,EAAI9B,GAEvD,IADA,IAAIrJ,EAAQ,EACHzG,EAAI,EAAGA,EAAI8P,EAAI,EAAG9P,IAAK,CAC9B,IAAI+E,EAAoC,KAAhC5E,KAAK0R,MAAMD,EAAG,EAAI5R,EAAI,GAAK8P,GACjC3P,KAAK0R,MAAMD,EAAG,EAAI5R,GAAK8P,GACvBrJ,EAEFmL,EAAG5R,GAAS,SAAJ+E,EAGN0B,EADE1B,EAAI,SACE,EAEAA,EAAI,SAAY,EAI5B,OAAO6M,GAGTtC,EAAKhN,UAAUwP,WAAa,SAAqBF,EAAI3N,EAAKmM,EAAKN,GAE7D,IADA,IAAIrJ,EAAQ,EACHzG,EAAI,EAAGA,EAAIiE,EAAKjE,IACvByG,GAAyB,EAARmL,EAAG5R,GAEpBoQ,EAAI,EAAIpQ,GAAa,KAARyG,EAAgBA,KAAkB,GAC/C2J,EAAI,EAAIpQ,EAAI,GAAa,KAARyG,EAAgBA,KAAkB,GAIrD,IAAKzG,EAAI,EAAIiE,EAAKjE,EAAI8P,IAAK9P,EACzBoQ,EAAIpQ,GAAK,EAGX6B,EAAiB,IAAV4E,GACP5E,EAA6B,KAAb,KAAR4E,KAGV6I,EAAKhN,UAAUyP,KAAO,SAAejC,GAEnC,IADA,IAAIkC,EAAK,IAAI7N,MAAM2L,GACV9P,EAAI,EAAGA,EAAI8P,EAAG9P,IACrBgS,EAAGhS,GAAK,EAGV,OAAOgS,GAGT1C,EAAKhN,UAAUiN,KAAO,SAAeC,EAAGC,EAAGpJ,GACzC,IAAIyJ,EAAI,EAAIlN,KAAK0O,YAAY9B,EAAEjP,OAAQkP,EAAElP,QAErC4P,EAAMvN,KAAKiN,QAAQC,GAEnBmC,EAAIrP,KAAKmP,KAAKjC,GAEdM,EAAM,IAAIjM,MAAM2L,GAChBoC,EAAO,IAAI/N,MAAM2L,GACjBqC,EAAO,IAAIhO,MAAM2L,GAEjBsC,EAAO,IAAIjO,MAAM2L,GACjBuC,EAAQ,IAAIlO,MAAM2L,GAClBwC,EAAQ,IAAInO,MAAM2L,GAElByC,EAAOlM,EAAIvD,MACfyP,EAAKhS,OAASuP,EAEdlN,KAAKkP,WAAWtC,EAAE1M,MAAO0M,EAAEjP,OAAQ6P,EAAKN,GACxClN,KAAKkP,WAAWrC,EAAE3M,MAAO2M,EAAElP,OAAQ6R,EAAMtC,GAEzClN,KAAK4N,UAAUJ,EAAK6B,EAAGC,EAAMC,EAAMrC,EAAGK,GACtCvN,KAAK4N,UAAU4B,EAAMH,EAAGI,EAAOC,EAAOxC,EAAGK,GAEzC,IAAK,IAAInQ,EAAI,EAAGA,EAAI8P,EAAG9P,IAAK,CAC1B,IAAIqR,EAAKa,EAAKlS,GAAKqS,EAAMrS,GAAKmS,EAAKnS,GAAKsS,EAAMtS,GAC9CmS,EAAKnS,GAAKkS,EAAKlS,GAAKsS,EAAMtS,GAAKmS,EAAKnS,GAAKqS,EAAMrS,GAC/CkS,EAAKlS,GAAKqR,EAUZ,OAPAzO,KAAK8O,UAAUQ,EAAMC,EAAMrC,GAC3BlN,KAAK4N,UAAU0B,EAAMC,EAAMI,EAAMN,EAAGnC,EAAGK,GACvCvN,KAAK8O,UAAUa,EAAMN,EAAGnC,GACxBlN,KAAK+O,aAAaY,EAAMzC,GAExBzJ,EAAIxD,SAAW2M,EAAE3M,SAAW4M,EAAE5M,SAC9BwD,EAAI9F,OAASiP,EAAEjP,OAASkP,EAAElP,OACnB8F,EAAIpB,SAIb9F,EAAGmD,UAAU0B,IAAM,SAAc9C,GAC/B,IAAImF,EAAM,IAAIlH,EAAG,MAEjB,OADAkH,EAAIvD,MAAQ,IAAIqB,MAAMvB,KAAKrC,OAASW,EAAIX,QACjCqC,KAAK8M,MAAMxO,EAAKmF,IAIzBlH,EAAGmD,UAAUkQ,KAAO,SAAetR,GACjC,IAAImF,EAAM,IAAIlH,EAAG,MAEjB,OADAkH,EAAIvD,MAAQ,IAAIqB,MAAMvB,KAAKrC,OAASW,EAAIX,QACjC8O,EAAWzM,KAAM1B,EAAKmF,IAI/BlH,EAAGmD,UAAU4L,KAAO,SAAehN,GACjC,OAAO0B,KAAK+C,QAAQ+J,MAAMxO,EAAK0B,OAGjCzD,EAAGmD,UAAUgD,MAAQ,SAAgBpE,GACnCW,EAAsB,iBAARX,GACdW,EAAOX,EAAM,UAIb,IADA,IAAIuF,EAAQ,EACHzG,EAAI,EAAGA,EAAI4C,KAAKrC,OAAQP,IAAK,CACpC,IAAI+E,GAAqB,EAAhBnC,KAAKE,MAAM9C,IAAUkB,EAC1BsF,GAAU,SAAJzB,IAA0B,SAAR0B,GAC5BA,IAAU,GACVA,GAAU1B,EAAI,SAAa,EAE3B0B,GAASD,IAAO,GAChB5D,KAAKE,MAAM9C,GAAU,SAALwG,EAQlB,OALc,IAAVC,IACF7D,KAAKE,MAAM9C,GAAKyG,EAChB7D,KAAKrC,UAGAqC,MAGTzD,EAAGmD,UAAUmQ,KAAO,SAAevR,GACjC,OAAO0B,KAAK+C,QAAQL,MAAMpE,IAI5B/B,EAAGmD,UAAUoQ,IAAM,WACjB,OAAO9P,KAAKoB,IAAIpB,OAIlBzD,EAAGmD,UAAUqQ,KAAO,WAClB,OAAO/P,KAAKsL,KAAKtL,KAAK+C,UAIxBxG,EAAGmD,UAAUkD,IAAM,SAActE,GAC/B,IAAI6D,EAxxCN,SAAqB7D,GAGnB,IAFA,IAAI6D,EAAI,IAAIZ,MAAMjD,EAAIE,aAEbyI,EAAM,EAAGA,EAAM9E,EAAExE,OAAQsJ,IAAO,CACvC,IAAI7E,EAAO6E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjB9E,EAAE8E,IAAQ3I,EAAI4B,MAAMkC,GAAQ,GAAK8E,KAAWA,EAG9C,OAAO/E,EA8wCC6N,CAAW1R,GACnB,GAAiB,IAAb6D,EAAExE,OAAc,OAAO,IAAIpB,EAAG,GAIlC,IADA,IAAIY,EAAM6C,KACD5C,EAAI,EAAGA,EAAI+E,EAAExE,QACP,IAATwE,EAAE/E,GADsBA,IAAKD,EAAMA,EAAI2S,OAI7C,KAAM1S,EAAI+E,EAAExE,OACV,IAAK,IAAIoH,EAAI5H,EAAI2S,MAAO1S,EAAI+E,EAAExE,OAAQP,IAAK2H,EAAIA,EAAE+K,MAClC,IAAT3N,EAAE/E,KAEND,EAAMA,EAAIiE,IAAI2D,IAIlB,OAAO5H,GAITZ,EAAGmD,UAAUuQ,OAAS,SAAiB7R,GACrCa,EAAuB,iBAATb,GAAqBA,GAAQ,GAC3C,IAGIhB,EAHA2D,EAAI3C,EAAO,GACXyP,GAAKzP,EAAO2C,GAAK,GACjBmP,EAAa,WAAe,GAAKnP,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAI8C,EAAQ,EAEZ,IAAKzG,EAAI,EAAGA,EAAI4C,KAAKrC,OAAQP,IAAK,CAChC,IAAI+S,EAAWnQ,KAAKE,MAAM9C,GAAK8S,EAC3BvP,GAAsB,EAAhBX,KAAKE,MAAM9C,IAAU+S,GAAapP,EAC5Cf,KAAKE,MAAM9C,GAAKuD,EAAIkD,EACpBA,EAAQsM,IAAc,GAAKpP,EAGzB8C,IACF7D,KAAKE,MAAM9C,GAAKyG,EAChB7D,KAAKrC,UAIT,GAAU,IAANkQ,EAAS,CACX,IAAKzQ,EAAI4C,KAAKrC,OAAS,EAAGP,GAAK,EAAGA,IAChC4C,KAAKE,MAAM9C,EAAIyQ,GAAK7N,KAAKE,MAAM9C,GAGjC,IAAKA,EAAI,EAAGA,EAAIyQ,EAAGzQ,IACjB4C,KAAKE,MAAM9C,GAAK,EAGlB4C,KAAKrC,QAAUkQ,EAGjB,OAAO7N,KAAKqC,SAGd9F,EAAGmD,UAAU0Q,MAAQ,SAAgBhS,GAGnC,OADAa,EAAyB,IAAlBe,KAAKC,UACLD,KAAKiQ,OAAO7R,IAMrB7B,EAAGmD,UAAUuF,OAAS,SAAiB7G,EAAMiS,EAAMC,GAEjD,IAAIC,EADJtR,EAAuB,iBAATb,GAAqBA,GAAQ,GAGzCmS,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAItP,EAAI3C,EAAO,GACXyP,EAAItQ,KAAK+D,KAAKlD,EAAO2C,GAAK,GAAIf,KAAKrC,QACnC6S,EAAO,SAAc,WAAczP,GAAMA,EACzC0P,EAAcH,EAMlB,GAJAC,GAAK1C,EACL0C,EAAIhT,KAAKkE,IAAI,EAAG8O,GAGZE,EAAa,CACf,IAAK,IAAIrT,EAAI,EAAGA,EAAIyQ,EAAGzQ,IACrBqT,EAAYvQ,MAAM9C,GAAK4C,KAAKE,MAAM9C,GAEpCqT,EAAY9S,OAASkQ,EAGvB,GAAU,IAANA,QAEG,GAAI7N,KAAKrC,OAASkQ,EAEvB,IADA7N,KAAKrC,QAAUkQ,EACVzQ,EAAI,EAAGA,EAAI4C,KAAKrC,OAAQP,IAC3B4C,KAAKE,MAAM9C,GAAK4C,KAAKE,MAAM9C,EAAIyQ,QAGjC7N,KAAKE,MAAM,GAAK,EAChBF,KAAKrC,OAAS,EAGhB,IAAIkG,EAAQ,EACZ,IAAKzG,EAAI4C,KAAKrC,OAAS,EAAGP,GAAK,IAAgB,IAAVyG,GAAezG,GAAKmT,GAAInT,IAAK,CAChE,IAAIqF,EAAuB,EAAhBzC,KAAKE,MAAM9C,GACtB4C,KAAKE,MAAM9C,GAAMyG,GAAU,GAAK9C,EAAO0B,IAAS1B,EAChD8C,EAAQpB,EAAO+N,EAajB,OATIC,GAAyB,IAAV5M,IACjB4M,EAAYvQ,MAAMuQ,EAAY9S,UAAYkG,GAGxB,IAAhB7D,KAAKrC,SACPqC,KAAKE,MAAM,GAAK,EAChBF,KAAKrC,OAAS,GAGTqC,KAAKqC,SAGd9F,EAAGmD,UAAUjB,MAAQ,SAAgBL,EAAMiS,EAAMC,GAG/C,OADArR,EAAyB,IAAlBe,KAAKC,UACLD,KAAKiF,OAAO7G,EAAMiS,EAAMC,IAIjC/T,EAAGmD,UAAUgR,KAAO,SAAetS,GACjC,OAAO4B,KAAK+C,QAAQqN,MAAMhS,IAG5B7B,EAAGmD,UAAUiR,MAAQ,SAAgBvS,GACnC,OAAO4B,KAAK+C,QAAQkN,OAAO7R,IAI7B7B,EAAGmD,UAAUX,KAAO,SAAeX,GACjC,OAAO4B,KAAK+C,QAAQtE,MAAML,IAG5B7B,EAAGmD,UAAUkR,MAAQ,SAAgBxS,GACnC,OAAO4B,KAAK+C,QAAQkC,OAAO7G,IAI7B7B,EAAGmD,UAAUd,MAAQ,SAAgBqI,GACnChI,EAAsB,iBAARgI,GAAoBA,GAAO,GACzC,IAAIlG,EAAIkG,EAAM,GACV4G,GAAK5G,EAAMlG,GAAK,GAChBgE,EAAI,GAAKhE,EAGb,QAAIf,KAAKrC,QAAUkQ,OAGX7N,KAAKE,MAAM2N,GAEL9I,IAIhBxI,EAAGmD,UAAUmR,OAAS,SAAiBzS,GACrCa,EAAuB,iBAATb,GAAqBA,GAAQ,GAC3C,IAAI2C,EAAI3C,EAAO,GACXyP,GAAKzP,EAAO2C,GAAK,GAIrB,GAFA9B,EAAyB,IAAlBe,KAAKC,SAAgB,2CAExBD,KAAKrC,QAAUkQ,EACjB,OAAO7N,KAQT,GALU,IAANe,GACF8M,IAEF7N,KAAKrC,OAASJ,KAAK+D,IAAIuM,EAAG7N,KAAKrC,QAErB,IAANoD,EAAS,CACX,IAAIyP,EAAO,SAAc,WAAczP,GAAMA,EAC7Cf,KAAKE,MAAMF,KAAKrC,OAAS,IAAM6S,EAGjC,OAAOxQ,KAAKqC,SAId9F,EAAGmD,UAAUoR,MAAQ,SAAgB1S,GACnC,OAAO4B,KAAK+C,QAAQ8N,OAAOzS,IAI7B7B,EAAGmD,UAAUkG,MAAQ,SAAgBtH,GAGnC,OAFAW,EAAsB,iBAARX,GACdW,EAAOX,EAAM,UACTA,EAAM,EAAU0B,KAAK+Q,OAAOzS,GAGV,IAAlB0B,KAAKC,SACa,IAAhBD,KAAKrC,SAAiC,EAAhBqC,KAAKE,MAAM,IAAU5B,GAC7C0B,KAAKE,MAAM,GAAK5B,GAAuB,EAAhB0B,KAAKE,MAAM,IAClCF,KAAKC,SAAW,EACTD,OAGTA,KAAKC,SAAW,EAChBD,KAAK+Q,MAAMzS,GACX0B,KAAKC,SAAW,EACTD,MAIFA,KAAK2C,OAAOrE,IAGrB/B,EAAGmD,UAAUiD,OAAS,SAAiBrE,GACrC0B,KAAKE,MAAM,IAAM5B,EAGjB,IAAK,IAAIlB,EAAI,EAAGA,EAAI4C,KAAKrC,QAAUqC,KAAKE,MAAM9C,IAAM,SAAWA,IAC7D4C,KAAKE,MAAM9C,IAAM,SACbA,IAAM4C,KAAKrC,OAAS,EACtBqC,KAAKE,MAAM9C,EAAI,GAAK,EAEpB4C,KAAKE,MAAM9C,EAAI,KAKnB,OAFA4C,KAAKrC,OAASJ,KAAKkE,IAAIzB,KAAKrC,OAAQP,EAAI,GAEjC4C,MAITzD,EAAGmD,UAAUqR,MAAQ,SAAgBzS,GAGnC,GAFAW,EAAsB,iBAARX,GACdW,EAAOX,EAAM,UACTA,EAAM,EAAG,OAAO0B,KAAK4F,OAAOtH,GAEhC,GAAsB,IAAlB0B,KAAKC,SAIP,OAHAD,KAAKC,SAAW,EAChBD,KAAK4F,MAAMtH,GACX0B,KAAKC,SAAW,EACTD,KAKT,GAFAA,KAAKE,MAAM,IAAM5B,EAEG,IAAhB0B,KAAKrC,QAAgBqC,KAAKE,MAAM,GAAK,EACvCF,KAAKE,MAAM,IAAMF,KAAKE,MAAM,GAC5BF,KAAKC,SAAW,OAGhB,IAAK,IAAI7C,EAAI,EAAGA,EAAI4C,KAAKrC,QAAUqC,KAAKE,MAAM9C,GAAK,EAAGA,IACpD4C,KAAKE,MAAM9C,IAAM,SACjB4C,KAAKE,MAAM9C,EAAI,IAAM,EAIzB,OAAO4C,KAAKqC,SAGd9F,EAAGmD,UAAUsR,KAAO,SAAe1S,GACjC,OAAO0B,KAAK+C,QAAQ6C,MAAMtH,IAG5B/B,EAAGmD,UAAUxB,KAAO,SAAeI,GACjC,OAAO0B,KAAK+C,QAAQgO,MAAMzS,IAG5B/B,EAAGmD,UAAUuR,KAAO,WAGlB,OAFAjR,KAAKC,SAAW,EAETD,MAGTzD,EAAGmD,UAAUgG,IAAM,WACjB,OAAO1F,KAAK+C,QAAQkO,QAGtB1U,EAAGmD,UAAUwR,aAAe,SAAuB5S,EAAK8C,EAAK+P,GAC3D,IACI/T,EAIA+E,EALAd,EAAM/C,EAAIX,OAASwT,EAGvBnR,KAAKgD,QAAQ3B,GAGb,IAAIwC,EAAQ,EACZ,IAAKzG,EAAI,EAAGA,EAAIkB,EAAIX,OAAQP,IAAK,CAC/B+E,GAA6B,EAAxBnC,KAAKE,MAAM9C,EAAI+T,IAActN,EAClC,IAAIlC,GAAwB,EAAfrD,EAAI4B,MAAM9C,IAAUgE,EAEjCyC,IADA1B,GAAa,SAARR,IACS,KAAQA,EAAQ,SAAa,GAC3C3B,KAAKE,MAAM9C,EAAI+T,GAAa,SAAJhP,EAE1B,KAAO/E,EAAI4C,KAAKrC,OAASwT,EAAO/T,IAE9ByG,GADA1B,GAA6B,EAAxBnC,KAAKE,MAAM9C,EAAI+T,IAActN,IACrB,GACb7D,KAAKE,MAAM9C,EAAI+T,GAAa,SAAJhP,EAG1B,GAAc,IAAV0B,EAAa,OAAO7D,KAAKqC,QAK7B,IAFApD,GAAkB,IAAX4E,GACPA,EAAQ,EACHzG,EAAI,EAAGA,EAAI4C,KAAKrC,OAAQP,IAE3ByG,GADA1B,IAAsB,EAAhBnC,KAAKE,MAAM9C,IAAUyG,IACd,GACb7D,KAAKE,MAAM9C,GAAS,SAAJ+E,EAIlB,OAFAnC,KAAKC,SAAW,EAETD,KAAKqC,SAGd9F,EAAGmD,UAAU0R,SAAW,SAAmB9S,EAAK+S,GAC9C,IAAIF,GAAQnR,KAAKrC,OAASW,EAAIX,QAE1B+F,EAAI1D,KAAK+C,QACTY,EAAIrF,EAGJgT,EAA8B,EAAxB3N,EAAEzD,MAAMyD,EAAEhG,OAAS,GAGf,KADdwT,EAAQ,GADMnR,KAAKmF,WAAWmM,MAG5B3N,EAAIA,EAAEgN,MAAMQ,GACZzN,EAAEuM,OAAOkB,GACTG,EAA8B,EAAxB3N,EAAEzD,MAAMyD,EAAEhG,OAAS,IAI3B,IACIoH,EADA6J,EAAIlL,EAAE/F,OAASgG,EAAEhG,OAGrB,GAAa,QAAT0T,EAAgB,EAClBtM,EAAI,IAAIxI,EAAG,OACToB,OAASiR,EAAI,EACf7J,EAAE7E,MAAQ,IAAIqB,MAAMwD,EAAEpH,QACtB,IAAK,IAAIP,EAAI,EAAGA,EAAI2H,EAAEpH,OAAQP,IAC5B2H,EAAE7E,MAAM9C,GAAK,EAIjB,IAAImU,EAAO7N,EAAEX,QAAQmO,aAAavN,EAAG,EAAGiL,GAClB,IAAlB2C,EAAKtR,WACPyD,EAAI6N,EACAxM,IACFA,EAAE7E,MAAM0O,GAAK,IAIjB,IAAK,IAAInR,EAAImR,EAAI,EAAGnR,GAAK,EAAGA,IAAK,CAC/B,IAAI+T,EAAmC,UAAL,EAAxB9N,EAAExD,MAAMyD,EAAEhG,OAASF,KACE,EAA5BiG,EAAExD,MAAMyD,EAAEhG,OAASF,EAAI,IAO1B,IAHA+T,EAAKjU,KAAK+D,IAAKkQ,EAAKF,EAAO,EAAG,UAE9B5N,EAAEwN,aAAavN,EAAG6N,EAAI/T,GACA,IAAfiG,EAAEzD,UACPuR,IACA9N,EAAEzD,SAAW,EACbyD,EAAEwN,aAAavN,EAAG,EAAGlG,GAChBiG,EAAEU,WACLV,EAAEzD,UAAY,GAGd8E,IACFA,EAAE7E,MAAMzC,GAAK+T,GAajB,OAVIzM,GACFA,EAAE1C,QAEJqB,EAAErB,QAGW,QAATgP,GAA4B,IAAVF,GACpBzN,EAAEuB,OAAOkM,GAGJ,CACLM,IAAK1M,GAAK,KACVjG,IAAK4E,IAQTnH,EAAGmD,UAAUgS,OAAS,SAAiBpT,EAAK+S,EAAMM,GAGhD,OAFA1S,GAAQX,EAAI8F,UAERpE,KAAKoE,SACA,CACLqN,IAAK,IAAIlV,EAAG,GACZuC,IAAK,IAAIvC,EAAG,IAKM,IAAlByD,KAAKC,UAAmC,IAAjB3B,EAAI2B,UAC7B9C,EAAM6C,KAAKiG,MAAMyL,OAAOpT,EAAK+S,GAEhB,QAATA,IACFI,EAAMtU,EAAIsU,IAAIxL,OAGH,QAAToL,IACFvS,EAAM3B,EAAI2B,IAAImH,MACV0L,GAA6B,IAAjB7S,EAAImB,UAClBnB,EAAIH,KAAKL,IAIN,CACLmT,IAAKA,EACL3S,IAAKA,IAIa,IAAlBkB,KAAKC,UAAmC,IAAjB3B,EAAI2B,UAC7B9C,EAAM6C,KAAK0R,OAAOpT,EAAI2H,MAAOoL,GAEhB,QAATA,IACFI,EAAMtU,EAAIsU,IAAIxL,OAGT,CACLwL,IAAKA,EACL3S,IAAK3B,EAAI2B,MAI0B,IAAlCkB,KAAKC,SAAW3B,EAAI2B,WACvB9C,EAAM6C,KAAKiG,MAAMyL,OAAOpT,EAAI2H,MAAOoL,GAEtB,QAATA,IACFvS,EAAM3B,EAAI2B,IAAImH,MACV0L,GAA6B,IAAjB7S,EAAImB,UAClBnB,EAAIqI,KAAK7I,IAIN,CACLmT,IAAKtU,EAAIsU,IACT3S,IAAKA,IAOLR,EAAIX,OAASqC,KAAKrC,QAAUqC,KAAKnB,IAAIP,GAAO,EACvC,CACLmT,IAAK,IAAIlV,EAAG,GACZuC,IAAKkB,MAKU,IAAf1B,EAAIX,OACO,QAAT0T,EACK,CACLI,IAAKzR,KAAK4R,KAAKtT,EAAI4B,MAAM,IACzBpB,IAAK,MAII,QAATuS,EACK,CACLI,IAAK,KACL3S,IAAK,IAAIvC,EAAGyD,KAAKpC,KAAKU,EAAI4B,MAAM,MAI7B,CACLuR,IAAKzR,KAAK4R,KAAKtT,EAAI4B,MAAM,IACzBpB,IAAK,IAAIvC,EAAGyD,KAAKpC,KAAKU,EAAI4B,MAAM,MAI7BF,KAAKoR,SAAS9S,EAAK+S,GAlF1B,IAAII,EAAK3S,EAAK3B,GAsFhBZ,EAAGmD,UAAU+R,IAAM,SAAcnT,GAC/B,OAAO0B,KAAK0R,OAAOpT,EAAK,OAAO,GAAOmT,KAIxClV,EAAGmD,UAAUZ,IAAM,SAAcR,GAC/B,OAAO0B,KAAK0R,OAAOpT,EAAK,OAAO,GAAOQ,KAGxCvC,EAAGmD,UAAUmS,KAAO,SAAevT,GACjC,OAAO0B,KAAK0R,OAAOpT,EAAK,OAAO,GAAMQ,KAIvCvC,EAAGmD,UAAUoS,SAAW,SAAmBxT,GACzC,IAAIyT,EAAK/R,KAAK0R,OAAOpT,GAGrB,GAAIyT,EAAGjT,IAAIsF,SAAU,OAAO2N,EAAGN,IAE/B,IAAI3S,EAA0B,IAApBiT,EAAGN,IAAIxR,SAAiB8R,EAAGjT,IAAIqI,KAAK7I,GAAOyT,EAAGjT,IAEpDkT,EAAO1T,EAAIsS,MAAM,GACjBqB,EAAK3T,EAAI0G,MAAM,GACfnG,EAAMC,EAAID,IAAImT,GAGlB,OAAInT,EAAM,GAAY,IAAPoT,GAAoB,IAARpT,EAAkBkT,EAAGN,IAGrB,IAApBM,EAAGN,IAAIxR,SAAiB8R,EAAGN,IAAIV,MAAM,GAAKgB,EAAGN,IAAI7L,MAAM,IAGhErJ,EAAGmD,UAAU9B,KAAO,SAAeU,GACjCW,EAAOX,GAAO,UAId,IAHA,IAAIZ,GAAK,GAAK,IAAMY,EAEhB4T,EAAM,EACD9U,EAAI4C,KAAKrC,OAAS,EAAGP,GAAK,EAAGA,IACpC8U,GAAOxU,EAAIwU,GAAuB,EAAhBlS,KAAKE,MAAM9C,KAAWkB,EAG1C,OAAO4T,GAIT3V,EAAGmD,UAAU2E,MAAQ,SAAgB/F,GACnCW,EAAOX,GAAO,UAGd,IADA,IAAIuF,EAAQ,EACHzG,EAAI4C,KAAKrC,OAAS,EAAGP,GAAK,EAAGA,IAAK,CACzC,IAAI+E,GAAqB,EAAhBnC,KAAKE,MAAM9C,IAAkB,SAARyG,EAC9B7D,KAAKE,MAAM9C,GAAM+E,EAAI7D,EAAO,EAC5BuF,EAAQ1B,EAAI7D,EAGd,OAAO0B,KAAKqC,SAGd9F,EAAGmD,UAAUkS,KAAO,SAAetT,GACjC,OAAO0B,KAAK+C,QAAQsB,MAAM/F,IAG5B/B,EAAGmD,UAAUyS,KAAO,SAAezU,GACjCuB,EAAsB,IAAfvB,EAAEuC,UACThB,GAAQvB,EAAE0G,UAEV,IAAIwI,EAAI5M,KACJ6M,EAAInP,EAAEqF,QAGR6J,EADiB,IAAfA,EAAE3M,SACA2M,EAAEiF,KAAKnU,GAEPkP,EAAE7J,QAaR,IATA,IAAIqP,EAAI,IAAI7V,EAAG,GACX8V,EAAI,IAAI9V,EAAG,GAGX+V,EAAI,IAAI/V,EAAG,GACXgW,EAAI,IAAIhW,EAAG,GAEXiW,EAAI,EAED5F,EAAElO,UAAYmO,EAAEnO,UACrBkO,EAAE3H,OAAO,GACT4H,EAAE5H,OAAO,KACPuN,EAMJ,IAHA,IAAIC,EAAK5F,EAAE9J,QACP2P,EAAK9F,EAAE7J,SAEH6J,EAAExI,UAAU,CAClB,IAAK,IAAIhH,EAAI,EAAGuV,EAAK,EAAyB,IAArB/F,EAAE1M,MAAM,GAAKyS,IAAavV,EAAI,KAAMA,EAAGuV,IAAO,GACvE,GAAIvV,EAAI,EAEN,IADAwP,EAAE3H,OAAO7H,GACFA,KAAM,IACPgV,EAAEQ,SAAWP,EAAEO,WACjBR,EAAEzT,KAAK8T,GACPJ,EAAElL,KAAKuL,IAGTN,EAAEnN,OAAO,GACToN,EAAEpN,OAAO,GAIb,IAAK,IAAIxH,EAAI,EAAGoV,EAAK,EAAyB,IAArBhG,EAAE3M,MAAM,GAAK2S,IAAapV,EAAI,KAAMA,EAAGoV,IAAO,GACvE,GAAIpV,EAAI,EAEN,IADAoP,EAAE5H,OAAOxH,GACFA,KAAM,IACP6U,EAAEM,SAAWL,EAAEK,WACjBN,EAAE3T,KAAK8T,GACPF,EAAEpL,KAAKuL,IAGTJ,EAAErN,OAAO,GACTsN,EAAEtN,OAAO,GAIT2H,EAAE/N,IAAIgO,IAAM,GACdD,EAAEzF,KAAK0F,GACPuF,EAAEjL,KAAKmL,GACPD,EAAElL,KAAKoL,KAEP1F,EAAE1F,KAAKyF,GACP0F,EAAEnL,KAAKiL,GACPG,EAAEpL,KAAKkL,IAIX,MAAO,CACL3O,EAAG4O,EACH3O,EAAG4O,EACHO,IAAKjG,EAAEoD,OAAOuC,KAOlBjW,EAAGmD,UAAUqT,OAAS,SAAiBrV,GACrCuB,EAAsB,IAAfvB,EAAEuC,UACThB,GAAQvB,EAAE0G,UAEV,IAAIV,EAAI1D,KACJ2D,EAAIjG,EAAEqF,QAGRW,EADiB,IAAfA,EAAEzD,SACAyD,EAAEmO,KAAKnU,GAEPgG,EAAEX,QAQR,IALA,IAuCI5F,EAvCA6V,EAAK,IAAIzW,EAAG,GACZ0W,EAAK,IAAI1W,EAAG,GAEZ2W,EAAQvP,EAAEZ,QAEPW,EAAE7F,KAAK,GAAK,GAAK8F,EAAE9F,KAAK,GAAK,GAAG,CACrC,IAAK,IAAIT,EAAI,EAAGuV,EAAK,EAAyB,IAArBjP,EAAExD,MAAM,GAAKyS,IAAavV,EAAI,KAAMA,EAAGuV,IAAO,GACvE,GAAIvV,EAAI,EAEN,IADAsG,EAAEuB,OAAO7H,GACFA,KAAM,GACP4V,EAAGJ,SACLI,EAAGrU,KAAKuU,GAGVF,EAAG/N,OAAO,GAId,IAAK,IAAIxH,EAAI,EAAGoV,EAAK,EAAyB,IAArBlP,EAAEzD,MAAM,GAAK2S,IAAapV,EAAI,KAAMA,EAAGoV,IAAO,GACvE,GAAIpV,EAAI,EAEN,IADAkG,EAAEsB,OAAOxH,GACFA,KAAM,GACPwV,EAAGL,SACLK,EAAGtU,KAAKuU,GAGVD,EAAGhO,OAAO,GAIVvB,EAAE7E,IAAI8E,IAAM,GACdD,EAAEyD,KAAKxD,GACPqP,EAAG7L,KAAK8L,KAERtP,EAAEwD,KAAKzD,GACPuP,EAAG9L,KAAK6L,IAeZ,OATE7V,EADgB,IAAduG,EAAE7F,KAAK,GACHmV,EAEAC,GAGApV,KAAK,GAAK,GAChBV,EAAIwB,KAAKjB,GAGJP,GAGTZ,EAAGmD,UAAUoT,IAAM,SAAcxU,GAC/B,GAAI0B,KAAKoE,SAAU,OAAO9F,EAAIoH,MAC9B,GAAIpH,EAAI8F,SAAU,OAAOpE,KAAK0F,MAE9B,IAAIhC,EAAI1D,KAAK+C,QACTY,EAAIrF,EAAIyE,QACZW,EAAEzD,SAAW,EACb0D,EAAE1D,SAAW,EAGb,IAAK,IAAIkR,EAAQ,EAAGzN,EAAEhF,UAAYiF,EAAEjF,SAAUyS,IAC5CzN,EAAEuB,OAAO,GACTtB,EAAEsB,OAAO,GAGX,OAAG,CACD,KAAOvB,EAAEhF,UACPgF,EAAEuB,OAAO,GAEX,KAAOtB,EAAEjF,UACPiF,EAAEsB,OAAO,GAGX,IAAIlE,EAAI2C,EAAE7E,IAAI8E,GACd,GAAI5C,EAAI,EAAG,CAET,IAAIqE,EAAI1B,EACRA,EAAIC,EACJA,EAAIyB,OACC,GAAU,IAANrE,GAAyB,IAAd4C,EAAE9F,KAAK,GAC3B,MAGF6F,EAAEyD,KAAKxD,GAGT,OAAOA,EAAEsM,OAAOkB,IAIlB5U,EAAGmD,UAAUyT,KAAO,SAAe7U,GACjC,OAAO0B,KAAKmS,KAAK7T,GAAKoF,EAAEmO,KAAKvT,IAG/B/B,EAAGmD,UAAUhB,OAAS,WACpB,OAA+B,IAAP,EAAhBsB,KAAKE,MAAM,KAGrB3D,EAAGmD,UAAUkT,MAAQ,WACnB,OAA+B,IAAP,EAAhB5S,KAAKE,MAAM,KAIrB3D,EAAGmD,UAAUsF,MAAQ,SAAgB1G,GACnC,OAAO0B,KAAKE,MAAM,GAAK5B,GAIzB/B,EAAGmD,UAAU0T,MAAQ,SAAgBnM,GACnChI,EAAsB,iBAARgI,GACd,IAAIlG,EAAIkG,EAAM,GACV4G,GAAK5G,EAAMlG,GAAK,GAChBgE,EAAI,GAAKhE,EAGb,GAAIf,KAAKrC,QAAUkQ,EAGjB,OAFA7N,KAAKgD,QAAQ6K,EAAI,GACjB7N,KAAKE,MAAM2N,IAAM9I,EACV/E,KAKT,IADA,IAAI6D,EAAQkB,EACH3H,EAAIyQ,EAAa,IAAVhK,GAAezG,EAAI4C,KAAKrC,OAAQP,IAAK,CACnD,IAAI+E,EAAoB,EAAhBnC,KAAKE,MAAM9C,GAEnByG,GADA1B,GAAK0B,KACS,GACd1B,GAAK,SACLnC,KAAKE,MAAM9C,GAAK+E,EAMlB,OAJc,IAAV0B,IACF7D,KAAKE,MAAM9C,GAAKyG,EAChB7D,KAAKrC,UAEAqC,MAGTzD,EAAGmD,UAAU0E,OAAS,WACpB,OAAuB,IAAhBpE,KAAKrC,QAAkC,IAAlBqC,KAAKE,MAAM,IAGzC3D,EAAGmD,UAAU7B,KAAO,SAAeS,GACjC,IAOInB,EAPA8C,EAAW3B,EAAM,EAErB,GAAsB,IAAlB0B,KAAKC,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBD,KAAKC,UAAkBA,EAAU,OAAO,EAK5C,GAHAD,KAAKqC,QAGDrC,KAAKrC,OAAS,EAChBR,EAAM,MACD,CACD8C,IACF3B,GAAOA,GAGTW,EAAOX,GAAO,SAAW,qBAEzB,IAAI6D,EAAoB,EAAhBnC,KAAKE,MAAM,GACnB/C,EAAMgF,IAAM7D,EAAM,EAAI6D,EAAI7D,GAAO,EAAI,EAEvC,OAAsB,IAAlB0B,KAAKC,SAA8B,GAAN9C,EAC1BA,GAOTZ,EAAGmD,UAAUb,IAAM,SAAcP,GAC/B,GAAsB,IAAlB0B,KAAKC,UAAmC,IAAjB3B,EAAI2B,SAAgB,OAAQ,EACvD,GAAsB,IAAlBD,KAAKC,UAAmC,IAAjB3B,EAAI2B,SAAgB,OAAO,EAEtD,IAAI9C,EAAM6C,KAAKqT,KAAK/U,GACpB,OAAsB,IAAlB0B,KAAKC,SAA8B,GAAN9C,EAC1BA,GAITZ,EAAGmD,UAAU2T,KAAO,SAAe/U,GAEjC,GAAI0B,KAAKrC,OAASW,EAAIX,OAAQ,OAAO,EACrC,GAAIqC,KAAKrC,OAASW,EAAIX,OAAQ,OAAQ,EAGtC,IADA,IAAIR,EAAM,EACDC,EAAI4C,KAAKrC,OAAS,EAAGP,GAAK,EAAGA,IAAK,CACzC,IAAIsG,EAAoB,EAAhB1D,KAAKE,MAAM9C,GACfuG,EAAmB,EAAfrF,EAAI4B,MAAM9C,GAElB,GAAIsG,IAAMC,EAAV,CACID,EAAIC,EACNxG,GAAO,EACEuG,EAAIC,IACbxG,EAAM,GAER,OAEF,OAAOA,GAGTZ,EAAGmD,UAAU4T,IAAM,SAAchV,GAC/B,OAA0B,IAAnB0B,KAAKnC,KAAKS,IAGnB/B,EAAGmD,UAAU6T,GAAK,SAAajV,GAC7B,OAAyB,IAAlB0B,KAAKnB,IAAIP,IAGlB/B,EAAGmD,UAAU8T,KAAO,SAAelV,GACjC,OAAO0B,KAAKnC,KAAKS,IAAQ,GAG3B/B,EAAGmD,UAAU+T,IAAM,SAAcnV,GAC/B,OAAO0B,KAAKnB,IAAIP,IAAQ,GAG1B/B,EAAGmD,UAAUgU,IAAM,SAAcpV,GAC/B,OAA2B,IAApB0B,KAAKnC,KAAKS,IAGnB/B,EAAGmD,UAAUiU,GAAK,SAAarV,GAC7B,OAA0B,IAAnB0B,KAAKnB,IAAIP,IAGlB/B,EAAGmD,UAAUkU,KAAO,SAAetV,GACjC,OAAO0B,KAAKnC,KAAKS,IAAQ,GAG3B/B,EAAGmD,UAAUmU,IAAM,SAAcvV,GAC/B,OAAO0B,KAAKnB,IAAIP,IAAQ,GAG1B/B,EAAGmD,UAAUoU,IAAM,SAAcxV,GAC/B,OAA0B,IAAnB0B,KAAKnC,KAAKS,IAGnB/B,EAAGmD,UAAUqU,GAAK,SAAazV,GAC7B,OAAyB,IAAlB0B,KAAKnB,IAAIP,IAOlB/B,EAAGuB,IAAM,SAAcQ,GACrB,OAAO,IAAI0V,EAAI1V,IAGjB/B,EAAGmD,UAAU1B,MAAQ,SAAgBiW,GAGnC,OAFAhV,GAAQe,KAAKlC,IAAK,yCAClBmB,EAAyB,IAAlBe,KAAKC,SAAgB,iCACrBgU,EAAIC,UAAUlU,MAAMmU,UAAUF,IAGvC1X,EAAGmD,UAAUvB,QAAU,WAErB,OADAc,EAAOe,KAAKlC,IAAK,wDACVkC,KAAKlC,IAAIsW,YAAYpU,OAG9BzD,EAAGmD,UAAUyU,UAAY,SAAoBF,GAE3C,OADAjU,KAAKlC,IAAMmW,EACJjU,MAGTzD,EAAGmD,UAAU2U,SAAW,SAAmBJ,GAEzC,OADAhV,GAAQe,KAAKlC,IAAK,yCACXkC,KAAKmU,UAAUF,IAGxB1X,EAAGmD,UAAU4U,OAAS,SAAiBhW,GAErC,OADAW,EAAOe,KAAKlC,IAAK,sCACVkC,KAAKlC,IAAIsJ,IAAIpH,KAAM1B,IAG5B/B,EAAGmD,UAAU6U,QAAU,SAAkBjW,GAEvC,OADAW,EAAOe,KAAKlC,IAAK,uCACVkC,KAAKlC,IAAIa,KAAKqB,KAAM1B,IAG7B/B,EAAGmD,UAAU8U,OAAS,SAAiBlW,GAErC,OADAW,EAAOe,KAAKlC,IAAK,sCACVkC,KAAKlC,IAAIuJ,IAAIrH,KAAM1B,IAG5B/B,EAAGmD,UAAU+U,QAAU,SAAkBnW,GAEvC,OADAW,EAAOe,KAAKlC,IAAK,uCACVkC,KAAKlC,IAAIqJ,KAAKnH,KAAM1B,IAG7B/B,EAAGmD,UAAUgV,OAAS,SAAiBpW,GAErC,OADAW,EAAOe,KAAKlC,IAAK,sCACVkC,KAAKlC,IAAI6W,IAAI3U,KAAM1B,IAG5B/B,EAAGmD,UAAUkV,OAAS,SAAiBtW,GAGrC,OAFAW,EAAOe,KAAKlC,IAAK,sCACjBkC,KAAKlC,IAAI+W,SAAS7U,KAAM1B,GACjB0B,KAAKlC,IAAIsD,IAAIpB,KAAM1B,IAG5B/B,EAAGmD,UAAUoV,QAAU,SAAkBxW,GAGvC,OAFAW,EAAOe,KAAKlC,IAAK,sCACjBkC,KAAKlC,IAAI+W,SAAS7U,KAAM1B,GACjB0B,KAAKlC,IAAIwN,KAAKtL,KAAM1B,IAG7B/B,EAAGmD,UAAUqV,OAAS,WAGpB,OAFA9V,EAAOe,KAAKlC,IAAK,sCACjBkC,KAAKlC,IAAIkX,SAAShV,MACXA,KAAKlC,IAAIgS,IAAI9P,OAGtBzD,EAAGmD,UAAUuV,QAAU,WAGrB,OAFAhW,EAAOe,KAAKlC,IAAK,uCACjBkC,KAAKlC,IAAIkX,SAAShV,MACXA,KAAKlC,IAAIiS,KAAK/P,OAIvBzD,EAAGmD,UAAUwV,QAAU,WAGrB,OAFAjW,EAAOe,KAAKlC,IAAK,uCACjBkC,KAAKlC,IAAIkX,SAAShV,MACXA,KAAKlC,IAAIR,KAAK0C,OAGvBzD,EAAGmD,UAAUyV,QAAU,WAGrB,OAFAlW,EAAOe,KAAKlC,IAAK,uCACjBkC,KAAKlC,IAAIkX,SAAShV,MACXA,KAAKlC,IAAIqV,KAAKnT,OAIvBzD,EAAGmD,UAAU0V,OAAS,WAGpB,OAFAnW,EAAOe,KAAKlC,IAAK,sCACjBkC,KAAKlC,IAAIkX,SAAShV,MACXA,KAAKlC,IAAImI,IAAIjG,OAGtBzD,EAAGmD,UAAUzB,OAAS,SAAiBK,GAGrC,OAFAW,EAAOe,KAAKlC,MAAQQ,EAAIR,IAAK,qBAC7BkC,KAAKlC,IAAIkX,SAAShV,MACXA,KAAKlC,IAAI8E,IAAI5C,KAAM1B,IAI5B,IAAIrB,EAAS,CACXoY,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQC,EAAMhY,GAErBsC,KAAK0V,KAAOA,EACZ1V,KAAKtC,EAAI,IAAInB,EAAGmB,EAAG,IACnBsC,KAAK2O,EAAI3O,KAAKtC,EAAEc,YAChBwB,KAAK3C,EAAI,IAAId,EAAG,GAAG0T,OAAOjQ,KAAK2O,GAAGxH,KAAKnH,KAAKtC,GAE5CsC,KAAK2V,IAAM3V,KAAK4V,OAiDlB,SAASC,IACPJ,EAAOK,KACL9V,KACA,OACA,2EA+DJ,SAAS+V,IACPN,EAAOK,KACL9V,KACA,OACA,kEAIJ,SAASgW,IACPP,EAAOK,KACL9V,KACA,OACA,yDAIJ,SAASiW,IAEPR,EAAOK,KACL9V,KACA,QACA,uEA8CJ,SAASgU,EAAKpF,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAIsH,EAAQ3Z,EAAG4Z,OAAOvH,GACtB5O,KAAK4O,EAAIsH,EAAMxY,EACfsC,KAAKkW,MAAQA,OAEbjX,EAAO2P,EAAE0E,IAAI,GAAI,kCACjBtT,KAAK4O,EAAIA,EACT5O,KAAKkW,MAAQ,KAkOjB,SAASE,EAAMxH,GACboF,EAAI8B,KAAK9V,KAAM4O,GAEf5O,KAAKmR,MAAQnR,KAAK4O,EAAEpQ,YAChBwB,KAAKmR,MAAQ,IAAO,IACtBnR,KAAKmR,OAAS,GAAMnR,KAAKmR,MAAQ,IAGnCnR,KAAKe,EAAI,IAAIxE,EAAG,GAAG0T,OAAOjQ,KAAKmR,OAC/BnR,KAAKiS,GAAKjS,KAAKqW,KAAKrW,KAAKe,EAAE+O,OAC3B9P,KAAKsW,KAAOtW,KAAKe,EAAEgS,OAAO/S,KAAK4O,GAE/B5O,KAAKuW,KAAOvW,KAAKsW,KAAKlV,IAAIpB,KAAKe,GAAGgQ,MAAM,GAAGU,IAAIzR,KAAK4O,GACpD5O,KAAKuW,KAAOvW,KAAKuW,KAAK1E,KAAK7R,KAAKe,GAChCf,KAAKuW,KAAOvW,KAAKe,EAAEsG,IAAIrH,KAAKuW,MA5a9Bd,EAAO/V,UAAUkW,KAAO,WACtB,IAAID,EAAM,IAAIpZ,EAAG,MAEjB,OADAoZ,EAAIzV,MAAQ,IAAIqB,MAAMhE,KAAKC,KAAKwC,KAAK2O,EAAI,KAClCgH,GAGTF,EAAO/V,UAAU8W,QAAU,SAAkBlY,GAG3C,IACImY,EADA1V,EAAIzC,EAGR,GACE0B,KAAK0W,MAAM3V,EAAGf,KAAK2V,KAGnBc,GADA1V,GADAA,EAAIf,KAAK2W,MAAM5V,IACTpC,KAAKqB,KAAK2V,MACPnX,kBACFiY,EAAOzW,KAAK2O,GAErB,IAAI9P,EAAM4X,EAAOzW,KAAK2O,GAAK,EAAI5N,EAAEsS,KAAKrT,KAAKtC,GAgB3C,OAfY,IAARmB,GACFkC,EAAEb,MAAM,GAAK,EACba,EAAEpD,OAAS,GACFkB,EAAM,EACfkC,EAAEoG,KAAKnH,KAAKtC,QAEIkZ,IAAZ7V,EAAEsB,MAEJtB,EAAEsB,QAGFtB,EAAE8V,SAIC9V,GAGT0U,EAAO/V,UAAUgX,MAAQ,SAAgBI,EAAOrT,GAC9CqT,EAAM7R,OAAOjF,KAAK2O,EAAG,EAAGlL,IAG1BgS,EAAO/V,UAAUiX,MAAQ,SAAgBrY,GACvC,OAAOA,EAAIgN,KAAKtL,KAAK3C,IASvBgC,EAASwW,EAAMJ,GAEfI,EAAKnW,UAAUgX,MAAQ,SAAgBI,EAAOC,GAK5C,IAHA,IAEIC,EAASzZ,KAAK+D,IAAIwV,EAAMnZ,OAAQ,GAC3BP,EAAI,EAAGA,EAAI4Z,EAAQ5Z,IAC1B2Z,EAAO7W,MAAM9C,GAAK0Z,EAAM5W,MAAM9C,GAIhC,GAFA2Z,EAAOpZ,OAASqZ,EAEZF,EAAMnZ,QAAU,EAGlB,OAFAmZ,EAAM5W,MAAM,GAAK,OACjB4W,EAAMnZ,OAAS,GAKjB,IAAIsZ,EAAOH,EAAM5W,MAAM,GAGvB,IAFA6W,EAAO7W,MAAM6W,EAAOpZ,UAhBT,QAgBqBsZ,EAE3B7Z,EAAI,GAAIA,EAAI0Z,EAAMnZ,OAAQP,IAAK,CAClC,IAAI8Z,EAAwB,EAAjBJ,EAAM5W,MAAM9C,GACvB0Z,EAAM5W,MAAM9C,EAAI,KApBP,QAoBe8Z,IAAgB,EAAMD,IAAS,GACvDA,EAAOC,EAETD,KAAU,GACVH,EAAM5W,MAAM9C,EAAI,IAAM6Z,EACT,IAATA,GAAcH,EAAMnZ,OAAS,GAC/BmZ,EAAMnZ,QAAU,GAEhBmZ,EAAMnZ,QAAU,GAIpBkY,EAAKnW,UAAUiX,MAAQ,SAAgBrY,GAErCA,EAAI4B,MAAM5B,EAAIX,QAAU,EACxBW,EAAI4B,MAAM5B,EAAIX,OAAS,GAAK,EAC5BW,EAAIX,QAAU,EAId,IADA,IAAIiG,EAAK,EACAxG,EAAI,EAAGA,EAAIkB,EAAIX,OAAQP,IAAK,CACnC,IAAI+E,EAAmB,EAAf7D,EAAI4B,MAAM9C,GAClBwG,GAAU,IAAJzB,EACN7D,EAAI4B,MAAM9C,GAAU,SAALwG,EACfA,EAAS,GAAJzB,GAAayB,EAAK,SAAa,GAUtC,OANkC,IAA9BtF,EAAI4B,MAAM5B,EAAIX,OAAS,KACzBW,EAAIX,SAC8B,IAA9BW,EAAI4B,MAAM5B,EAAIX,OAAS,IACzBW,EAAIX,UAGDW,GASTe,EAAS0W,EAAMN,GAQfpW,EAAS2W,EAAMP,GASfpW,EAAS4W,EAAQR,GAEjBQ,EAAOvW,UAAUiX,MAAQ,SAAgBrY,GAGvC,IADA,IAAIuF,EAAQ,EACHzG,EAAI,EAAGA,EAAIkB,EAAIX,OAAQP,IAAK,CACnC,IAAIkI,EAA0B,IAAL,EAAfhH,EAAI4B,MAAM9C,IAAiByG,EACjCD,EAAU,SAAL0B,EACTA,KAAQ,GAERhH,EAAI4B,MAAM9C,GAAKwG,EACfC,EAAQyB,EAKV,OAHc,IAAVzB,IACFvF,EAAI4B,MAAM5B,EAAIX,UAAYkG,GAErBvF,GAIT/B,EAAG4Z,OAAS,SAAgBT,GAE1B,GAAIzY,EAAOyY,GAAO,OAAOzY,EAAOyY,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,IAAItW,MAAM,iBAAmBsW,GAFnCQ,EAAQ,IAAID,EAMd,OAFAhZ,EAAOyY,GAAQQ,EAERA,GAkBTlC,EAAItU,UAAUsV,SAAW,SAAmBtR,GAC1CzE,EAAsB,IAAfyE,EAAEzD,SAAgB,iCACzBhB,EAAOyE,EAAE5F,IAAK,oCAGhBkW,EAAItU,UAAUmV,SAAW,SAAmBnR,EAAGC,GAC7C1E,EAAqC,IAA7ByE,EAAEzD,SAAW0D,EAAE1D,UAAiB,iCACxChB,EAAOyE,EAAE5F,KAAO4F,EAAE5F,MAAQ6F,EAAE7F,IAC1B,oCAGJkW,EAAItU,UAAU2W,KAAO,SAAe3S,GAClC,OAAI1D,KAAKkW,MAAclW,KAAKkW,MAAMM,QAAQ9S,GAAGyQ,UAAUnU,MAChD0D,EAAEmO,KAAK7R,KAAK4O,GAAGuF,UAAUnU,OAGlCgU,EAAItU,UAAUuG,IAAM,SAAcvC,GAChC,OAAIA,EAAEU,SACGV,EAAEX,QAGJ/C,KAAK4O,EAAEvH,IAAI3D,GAAGyQ,UAAUnU,OAGjCgU,EAAItU,UAAU0H,IAAM,SAAc1D,EAAGC,GACnC3D,KAAK6U,SAASnR,EAAGC,GAEjB,IAAIxG,EAAMuG,EAAE0D,IAAIzD,GAIhB,OAHIxG,EAAI0B,IAAImB,KAAK4O,IAAM,GACrBzR,EAAIgK,KAAKnH,KAAK4O,GAETzR,EAAIgX,UAAUnU,OAGvBgU,EAAItU,UAAUf,KAAO,SAAe+E,EAAGC,GACrC3D,KAAK6U,SAASnR,EAAGC,GAEjB,IAAIxG,EAAMuG,EAAE/E,KAAKgF,GAIjB,OAHIxG,EAAI0B,IAAImB,KAAK4O,IAAM,GACrBzR,EAAIgK,KAAKnH,KAAK4O,GAETzR,GAGT6W,EAAItU,UAAU2H,IAAM,SAAc3D,EAAGC,GACnC3D,KAAK6U,SAASnR,EAAGC,GAEjB,IAAIxG,EAAMuG,EAAE2D,IAAI1D,GAIhB,OAHIxG,EAAIU,KAAK,GAAK,GAChBV,EAAIwB,KAAKqB,KAAK4O,GAETzR,EAAIgX,UAAUnU,OAGvBgU,EAAItU,UAAUyH,KAAO,SAAezD,EAAGC,GACrC3D,KAAK6U,SAASnR,EAAGC,GAEjB,IAAIxG,EAAMuG,EAAEyD,KAAKxD,GAIjB,OAHIxG,EAAIU,KAAK,GAAK,GAChBV,EAAIwB,KAAKqB,KAAK4O,GAETzR,GAGT6W,EAAItU,UAAUiV,IAAM,SAAcjR,EAAGpF,GAEnC,OADA0B,KAAKgV,SAAStR,GACP1D,KAAKqW,KAAK3S,EAAEiN,MAAMrS,KAG3B0V,EAAItU,UAAU4L,KAAO,SAAe5H,EAAGC,GAErC,OADA3D,KAAK6U,SAASnR,EAAGC,GACV3D,KAAKqW,KAAK3S,EAAE4H,KAAK3H,KAG1BqQ,EAAItU,UAAU0B,IAAM,SAAcsC,EAAGC,GAEnC,OADA3D,KAAK6U,SAASnR,EAAGC,GACV3D,KAAKqW,KAAK3S,EAAEtC,IAAIuC,KAGzBqQ,EAAItU,UAAUqQ,KAAO,SAAerM,GAClC,OAAO1D,KAAKsL,KAAK5H,EAAGA,EAAEX,UAGxBiR,EAAItU,UAAUoQ,IAAM,SAAcpM,GAChC,OAAO1D,KAAKoB,IAAIsC,EAAGA,IAGrBsQ,EAAItU,UAAUpC,KAAO,SAAeoG,GAClC,GAAIA,EAAEU,SAAU,OAAOV,EAAEX,QAEzB,IAAIoU,EAAOnX,KAAK4O,EAAE5J,MAAM,GAIxB,GAHA/F,EAAOkY,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAIvU,EAAM5C,KAAK4O,EAAExH,IAAI,IAAI7K,EAAG,IAAI0I,OAAO,GACvC,OAAOjF,KAAK4C,IAAIc,EAAGd,GAQrB,IAFA,IAAImC,EAAI/E,KAAK4O,EAAE1Q,KAAK,GAChB2P,EAAI,GACA9I,EAAEX,UAA2B,IAAfW,EAAEC,MAAM,IAC5B6I,IACA9I,EAAEE,OAAO,GAEXhG,GAAQ8F,EAAEX,UAEV,IAAIgT,EAAM,IAAI7a,EAAG,GAAGyB,MAAMgC,MACtBqX,EAAOD,EAAIhC,SAIXkC,EAAOtX,KAAK4O,EAAE1Q,KAAK,GAAG+G,OAAO,GAC7BsS,EAAIvX,KAAK4O,EAAEpQ,YAGf,IAFA+Y,EAAI,IAAIhb,EAAG,EAAIgb,EAAIA,GAAGvZ,MAAMgC,MAEW,IAAhCA,KAAK4C,IAAI2U,EAAGD,GAAMzY,IAAIwY,IAC3BE,EAAEhD,QAAQ8C,GAOZ,IAJA,IAAI1W,EAAIX,KAAK4C,IAAI2U,EAAGxS,GAChBhE,EAAIf,KAAK4C,IAAIc,EAAGqB,EAAEiM,KAAK,GAAG/L,OAAO,IACjCG,EAAIpF,KAAK4C,IAAIc,EAAGqB,GAChB6J,EAAIf,EACc,IAAfzI,EAAEvG,IAAIuY,IAAY,CAEvB,IADA,IAAIzB,EAAMvQ,EACDhI,EAAI,EAAoB,IAAjBuY,EAAI9W,IAAIuY,GAAYha,IAClCuY,EAAMA,EAAIZ,SAEZ9V,EAAO7B,EAAIwR,GACX,IAAIjL,EAAI3D,KAAK4C,IAAIjC,EAAG,IAAIpE,EAAG,GAAG0T,OAAOrB,EAAIxR,EAAI,IAE7C2D,EAAIA,EAAE6T,OAAOjR,GACbhD,EAAIgD,EAAEoR,SACN3P,EAAIA,EAAEwP,OAAOjU,GACbiO,EAAIxR,EAGN,OAAO2D,GAGTiT,EAAItU,UAAUyT,KAAO,SAAezP,GAClC,IAAI8T,EAAM9T,EAAEqP,OAAO/S,KAAK4O,GACxB,OAAqB,IAAjB4I,EAAIvX,UACNuX,EAAIvX,SAAW,EACRD,KAAKqW,KAAKmB,GAAKpC,UAEfpV,KAAKqW,KAAKmB,IAIrBxD,EAAItU,UAAUkD,IAAM,SAAcc,EAAGpF,GACnC,GAAIA,EAAI8F,SAAU,OAAO,IAAI7H,EAAG,GAAGyB,MAAMgC,MACzC,GAAoB,IAAhB1B,EAAIT,KAAK,GAAU,OAAO6F,EAAEX,QAEhC,IACI0U,EAAM,IAAIlW,MAAM,IACpBkW,EAAI,GAAK,IAAIlb,EAAG,GAAGyB,MAAMgC,MACzByX,EAAI,GAAK/T,EACT,IAAK,IAAItG,EAAI,EAAGA,EAAIqa,EAAI9Z,OAAQP,IAC9Bqa,EAAIra,GAAK4C,KAAKoB,IAAIqW,EAAIra,EAAI,GAAIsG,GAGhC,IAAIvG,EAAMsa,EAAI,GACVC,EAAU,EACVC,EAAa,EACbzW,EAAQ5C,EAAIE,YAAc,GAK9B,IAJc,IAAV0C,IACFA,EAAQ,IAGL9D,EAAIkB,EAAIX,OAAS,EAAGP,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAIqF,EAAOnE,EAAI4B,MAAM9C,GACZK,EAAIyD,EAAQ,EAAGzD,GAAK,EAAGA,IAAK,CACnC,IAAIwJ,EAAOxE,GAAQhF,EAAK,EACpBN,IAAQsa,EAAI,KACdta,EAAM6C,KAAK8P,IAAI3S,IAGL,IAAR8J,GAAyB,IAAZyQ,GAKjBA,IAAY,EACZA,GAAWzQ,GA9BE,MA+Bb0Q,GACwC,IAANva,GAAiB,IAANK,KAE7CN,EAAM6C,KAAKoB,IAAIjE,EAAKsa,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,EAajBzW,EAAQ,GAGV,OAAO/D,GAGT6W,EAAItU,UAAUwU,UAAY,SAAoB5V,GAC5C,IAAIyC,EAAIzC,EAAIuT,KAAK7R,KAAK4O,GAEtB,OAAO7N,IAAMzC,EAAMyC,EAAEgC,QAAUhC,GAGjCiT,EAAItU,UAAU0U,YAAc,SAAsB9V,GAChD,IAAInB,EAAMmB,EAAIyE,QAEd,OADA5F,EAAIW,IAAM,KACHX,GAOTZ,EAAGwB,KAAO,SAAeO,GACvB,OAAO,IAAI8X,EAAK9X,IAmBlBe,EAAS+W,EAAMpC,GAEfoC,EAAK1W,UAAUwU,UAAY,SAAoB5V,GAC7C,OAAO0B,KAAKqW,KAAK/X,EAAIqS,MAAM3Q,KAAKmR,SAGlCiF,EAAK1W,UAAU0U,YAAc,SAAsB9V,GACjD,IAAIyC,EAAIf,KAAKqW,KAAK/X,EAAI8C,IAAIpB,KAAKsW,OAE/B,OADAvV,EAAEjD,IAAM,KACDiD,GAGTqV,EAAK1W,UAAU4L,KAAO,SAAe5H,EAAGC,GACtC,GAAID,EAAEU,UAAYT,EAAES,SAGlB,OAFAV,EAAExD,MAAM,GAAK,EACbwD,EAAE/F,OAAS,EACJ+F,EAGT,IAAI0B,EAAI1B,EAAE4H,KAAK3H,GACXhD,EAAIyE,EAAE0L,MAAM9Q,KAAKmR,OAAO/P,IAAIpB,KAAKuW,MAAM1F,OAAO7Q,KAAKmR,OAAO/P,IAAIpB,KAAK4O,GACnEgJ,EAAIxS,EAAE+B,KAAKxG,GAAGsE,OAAOjF,KAAKmR,OAC1BhU,EAAMya,EAQV,OANIA,EAAE/Y,IAAImB,KAAK4O,IAAM,EACnBzR,EAAMya,EAAEzQ,KAAKnH,KAAK4O,GACTgJ,EAAE/Z,KAAK,GAAK,IACrBV,EAAMya,EAAEjZ,KAAKqB,KAAK4O,IAGbzR,EAAIgX,UAAUnU,OAGvBoW,EAAK1W,UAAU0B,IAAM,SAAcsC,EAAGC,GACpC,GAAID,EAAEU,UAAYT,EAAES,SAAU,OAAO,IAAI7H,EAAG,GAAG4X,UAAUnU,MAEzD,IAAIoF,EAAI1B,EAAEtC,IAAIuC,GACVhD,EAAIyE,EAAE0L,MAAM9Q,KAAKmR,OAAO/P,IAAIpB,KAAKuW,MAAM1F,OAAO7Q,KAAKmR,OAAO/P,IAAIpB,KAAK4O,GACnEgJ,EAAIxS,EAAE+B,KAAKxG,GAAGsE,OAAOjF,KAAKmR,OAC1BhU,EAAMya,EAOV,OANIA,EAAE/Y,IAAImB,KAAK4O,IAAM,EACnBzR,EAAMya,EAAEzQ,KAAKnH,KAAK4O,GACTgJ,EAAE/Z,KAAK,GAAK,IACrBV,EAAMya,EAAEjZ,KAAKqB,KAAK4O,IAGbzR,EAAIgX,UAAUnU,OAGvBoW,EAAK1W,UAAUyT,KAAO,SAAezP,GAGnC,OADU1D,KAAKqW,KAAK3S,EAAEqP,OAAO/S,KAAK4O,GAAGxN,IAAIpB,KAAKiS,KACnCkC,UAAUnU,OAn3GzB,CAq3GoC9D,EAAQ8D,Q,2CCr3G5C,kBAAoB,EAAQ,KACxB/C,EAAS,EAAQ,KAEjB4a,EAAK,EAAQ,KASjB,IAAIC,EAAY,CACd,QAAU,EAAM,KAAO,EAAM,QAAU,GA2BzC3b,EAAQ4b,mBAAqB5b,EAAQ6b,yBAA2B7b,EAAQ8b,iBAnCxE,SAA2BnZ,GACzB,IAAIoX,EAAQ,IAAI9V,EAAOnD,EAAO6B,GAAKoX,MAAO,OACtC7X,EAAM,IAAI+B,EAAOnD,EAAO6B,GAAKT,IAAK,OAEtC,OAAO,IAAIwZ,EAAG3B,EAAO7X,IAgCvBlC,EAAQ+b,oBAAsB/b,EAAQgc,cAzBtC,SAASD,EAAqBhC,EAAOkC,EAAKC,EAAWC,GACnD,OAAIlY,EAAOmY,SAASH,SAA2BxB,IAAnBkB,EAAUM,GAC7BF,EAAoBhC,EAAO,SAAUkC,EAAKC,IAGnDD,EAAMA,GAAO,SACbE,EAAOA,GAAQ,SACfD,EAAYA,GAAa,IAAIjY,EAAO,CAAC,IAEhCA,EAAOmY,SAASF,KACnBA,EAAY,IAAIjY,EAAOiY,EAAWC,IAGf,iBAAVpC,EACF,IAAI2B,EAAGW,EAActC,EAAOmC,GAAYA,GAAW,IAGvDjY,EAAOmY,SAASrC,KACnBA,EAAQ,IAAI9V,EAAO8V,EAAOkC,IAGrB,IAAIP,EAAG3B,EAAOmC,GAAW,Q,85NCrClC,kBAAS,EAAQ,KAEb5b,EAAc,IADA,EAAQ,MAEtBD,EAAa,IAAID,EAAG,IACpBQ,EAAS,IAAIR,EAAG,IAChBM,EAAM,IAAIN,EAAG,IACbO,EAAQ,IAAIP,EAAG,GACfkc,EAAQ,IAAIlc,EAAG,GACfU,EAAS,EAAQ,KACjBhB,EAAc,EAAQ,KAG1B,SAASyc,EAAaC,EAAKP,GAMzB,OALAA,EAAMA,GAAO,OACRhY,EAAOmY,SAASI,KACnBA,EAAM,IAAIvY,EAAOuY,EAAKP,IAExBpY,KAAK4Y,KAAO,IAAIrc,EAAGoc,GACZ3Y,KAGT,SAAS6Y,EAAcC,EAAMV,GAM3B,OALAA,EAAMA,GAAO,OACRhY,EAAOmY,SAASO,KACnBA,EAAO,IAAI1Y,EAAO0Y,EAAMV,IAE1BpY,KAAK+Y,MAAQ,IAAIxc,EAAGuc,GACb9Y,KAjBT9D,EAAOC,QAAU0b,EAoBjB,IAAImB,EAAa,GAsDjB,SAASnB,EAAG3B,EAAOmC,EAAWY,GAC5BjZ,KAAKkZ,aAAab,GAClBrY,KAAKmZ,QAAU,IAAI5c,EAAG2Z,GACtBlW,KAAKmW,OAAS5Z,EAAGwB,KAAKiC,KAAKmZ,SAC3BnZ,KAAKoZ,UAAYlD,EAAMvY,OACvBqC,KAAK4Y,UAAOhC,EACZ5W,KAAK+Y,WAAQnC,EACb5W,KAAKqZ,gBAAazC,EACdqC,GACFjZ,KAAK0Y,aAAeA,EACpB1Y,KAAK6Y,cAAgBA,GAErB7Y,KAAKqZ,WAAa,EA4DtB,SAASC,EAAkBC,EAAInB,GAC7B,IAAIoB,EAAM,IAAIpZ,EAAOmZ,EAAGrX,WACxB,OAAKkW,EAGIoB,EAAI1X,SAASsW,GAFboB,EA5DXC,OAAOC,eAAe7B,EAAGnY,UAAW,cAAe,CACjDia,YAAY,EACZC,IAAK,WAIH,MAH+B,iBAApB5Z,KAAKqZ,aACdrZ,KAAKqZ,WAxEX,SAAoBnD,EAAOmC,GACzB,IAAIha,EAAMga,EAAUvW,SAAS,OACzB+X,EAAM,CAACxb,EAAK6X,EAAMpU,SAAS,KAAKgY,KAAK,KACzC,GAAID,KAAOb,EACT,OAAOA,EAAWa,GAEpB,IAyBIE,EAzBAC,EAAQ,EAEZ,GAAI9D,EAAMxX,WACPzB,EAAOZ,cACPY,EAAOX,WAAW4Z,KAClBzZ,EAAYuC,KAAKkX,GAclB,OAZA8D,GAAS,EAKPA,GAHU,OAAR3b,GAAwB,OAARA,EAGT,EAIA,EAEX2a,EAAWa,GAAOG,EACXA,EAOT,OALKvd,EAAYuC,KAAKkX,EAAMnX,KAAK,MAE/Bib,GAAS,GAGH3b,GACN,IAAK,KACC6X,EAAMpX,IAAItC,GAAYqC,IAAI9B,KAE5Bid,GAAS,GAEX,MACF,IAAK,MACHD,EAAM7D,EAAMpX,IAAIjC,IACRgC,IAAI/B,IAAUid,EAAIlb,IAAI4Z,KAE5BuB,GAAS,GAEX,MACF,QACEA,GAAS,EAGb,OADAhB,EAAWa,GAAOG,EACXA,EAsBeC,CAAWja,KAAKmZ,QAASnZ,KAAKka,QAE3Cla,KAAKqZ,cAGhBxB,EAAGnY,UAAUya,aAAe,WAK1B,OAJKna,KAAK+Y,QACR/Y,KAAK+Y,MAAQ,IAAIxc,EAAGN,EAAY+D,KAAKoZ,aAEvCpZ,KAAK4Y,KAAO5Y,KAAKoa,KAAKpc,MAAMgC,KAAKmW,QAAQlY,OAAO+B,KAAK+Y,OAAO5a,UACrD6B,KAAKqa,gBAGdxC,EAAGnY,UAAU4a,cAAgB,SAAUC,GAGrC,IAAIC,GADJD,GADAA,EAAQ,IAAIhe,EAAGge,IACDvc,MAAMgC,KAAKmW,SACNlY,OAAO+B,KAAK+Y,OAAO5a,UAClCsF,EAAM,IAAIrD,EAAOoa,EAAOtY,WACxBgU,EAAQlW,KAAKya,WACjB,GAAIhX,EAAI9F,OAASuY,EAAMvY,OAAQ,CAC7B,IAAI+c,EAAQ,IAAIta,EAAO8V,EAAMvY,OAAS8F,EAAI9F,QAC1C+c,EAAMC,KAAK,GACXlX,EAAMrD,EAAOwa,OAAO,CAACF,EAAOjX,IAE9B,OAAOA,GAGToU,EAAGnY,UAAU2a,aAAe,SAAsBjC,GAChD,OAAOkB,EAAkBtZ,KAAK4Y,KAAMR,IAGtCP,EAAGnY,UAAUmb,cAAgB,SAAuBzC,GAClD,OAAOkB,EAAkBtZ,KAAK+Y,MAAOX,IAGvCP,EAAGnY,UAAU+a,SAAW,SAAUrC,GAChC,OAAOkB,EAAkBtZ,KAAKmZ,QAASf,IAGzCP,EAAGnY,UAAUob,aAAe,SAAU1C,GACpC,OAAOkB,EAAkBtZ,KAAKoa,KAAMhC,IAGtCP,EAAGnY,UAAUwZ,aAAe,SAAU7a,EAAK+Z,GAOzC,OANAA,EAAMA,GAAO,OACRhY,EAAOmY,SAASla,KACnBA,EAAM,IAAI+B,EAAO/B,EAAK+Z,IAExBpY,KAAKka,MAAQ7b,EACb2B,KAAKoa,KAAO,IAAI7d,EAAG8B,GACZ2B,Q","file":"yarn.diffie-hellman.becc34fe6fa559c58c21.js","sourcesContent":["var randomBytes = require('randombytes');\nmodule.exports = findPrime;\nfindPrime.simpleSieve = simpleSieve;\nfindPrime.fermatTest = fermatTest;\nvar BN = require('bn.js');\nvar TWENTYFOUR = new BN(24);\nvar MillerRabin = require('miller-rabin');\nvar millerRabin = new MillerRabin();\nvar ONE = new BN(1);\nvar TWO = new BN(2);\nvar FIVE = new BN(5);\nvar SIXTEEN = new BN(16);\nvar EIGHT = new BN(8);\nvar TEN = new BN(10);\nvar THREE = new BN(3);\nvar SEVEN = new BN(7);\nvar ELEVEN = new BN(11);\nvar FOUR = new BN(4);\nvar TWELVE = new BN(12);\nvar primes = null;\n\nfunction _getPrimes() {\n  if (primes !== null)\n    return primes;\n\n  var limit = 0x100000;\n  var res = [];\n  res[0] = 2;\n  for (var i = 1, k = 3; k < limit; k += 2) {\n    var sqrt = Math.ceil(Math.sqrt(k));\n    for (var j = 0; j < i && res[j] <= sqrt; j++)\n      if (k % res[j] === 0)\n        break;\n\n    if (i !== j && res[j] <= sqrt)\n      continue;\n\n    res[i++] = k;\n  }\n  primes = res;\n  return res;\n}\n\nfunction simpleSieve(p) {\n  var primes = _getPrimes();\n\n  for (var i = 0; i < primes.length; i++)\n    if (p.modn(primes[i]) === 0) {\n      if (p.cmpn(primes[i]) === 0) {\n        return true;\n      } else {\n        return false;\n      }\n    }\n\n  return true;\n}\n\nfunction fermatTest(p) {\n  var red = BN.mont(p);\n  return TWO.toRed(red).redPow(p.subn(1)).fromRed().cmpn(1) === 0;\n}\n\nfunction findPrime(bits, gen) {\n  if (bits < 16) {\n    // this is what openssl does\n    if (gen === 2 || gen === 5) {\n      return new BN([0x8c, 0x7b]);\n    } else {\n      return new BN([0x8c, 0x27]);\n    }\n  }\n  gen = new BN(gen);\n\n  var num, n2;\n\n  while (true) {\n    num = new BN(randomBytes(Math.ceil(bits / 8)));\n    while (num.bitLength() > bits) {\n      num.ishrn(1);\n    }\n    if (num.isEven()) {\n      num.iadd(ONE);\n    }\n    if (!num.testn(1)) {\n      num.iadd(TWO);\n    }\n    if (!gen.cmp(TWO)) {\n      while (num.mod(TWENTYFOUR).cmp(ELEVEN)) {\n        num.iadd(FOUR);\n      }\n    } else if (!gen.cmp(FIVE)) {\n      while (num.mod(TEN).cmp(THREE)) {\n        num.iadd(FOUR);\n      }\n    }\n    n2 = num.shrn(1);\n    if (simpleSieve(n2) && simpleSieve(num) &&\n      fermatTest(n2) && fermatTest(num) &&\n      millerRabin.test(n2) && millerRabin.test(num)) {\n      return num;\n    }\n  }\n\n}\n","(function (module, exports) {\n  'use strict';\n\n  // Utils\n  function assert (val, msg) {\n    if (!val) throw new Error(msg || 'Assertion failed');\n  }\n\n  // Could use `inherits` module, but don't want to move from single file\n  // architecture yet.\n  function inherits (ctor, superCtor) {\n    ctor.super_ = superCtor;\n    var TempCtor = function () {};\n    TempCtor.prototype = superCtor.prototype;\n    ctor.prototype = new TempCtor();\n    ctor.prototype.constructor = ctor;\n  }\n\n  // BN\n\n  function BN (number, base, endian) {\n    if (BN.isBN(number)) {\n      return number;\n    }\n\n    this.negative = 0;\n    this.words = null;\n    this.length = 0;\n\n    // Reduction context\n    this.red = null;\n\n    if (number !== null) {\n      if (base === 'le' || base === 'be') {\n        endian = base;\n        base = 10;\n      }\n\n      this._init(number || 0, base || 10, endian || 'be');\n    }\n  }\n  if (typeof module === 'object') {\n    module.exports = BN;\n  } else {\n    exports.BN = BN;\n  }\n\n  BN.BN = BN;\n  BN.wordSize = 26;\n\n  var Buffer;\n  try {\n    if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n      Buffer = window.Buffer;\n    } else {\n      Buffer = require('buffer').Buffer;\n    }\n  } catch (e) {\n  }\n\n  BN.isBN = function isBN (num) {\n    if (num instanceof BN) {\n      return true;\n    }\n\n    return num !== null && typeof num === 'object' &&\n      num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n  };\n\n  BN.max = function max (left, right) {\n    if (left.cmp(right) > 0) return left;\n    return right;\n  };\n\n  BN.min = function min (left, right) {\n    if (left.cmp(right) < 0) return left;\n    return right;\n  };\n\n  BN.prototype._init = function init (number, base, endian) {\n    if (typeof number === 'number') {\n      return this._initNumber(number, base, endian);\n    }\n\n    if (typeof number === 'object') {\n      return this._initArray(number, base, endian);\n    }\n\n    if (base === 'hex') {\n      base = 16;\n    }\n    assert(base === (base | 0) && base >= 2 && base <= 36);\n\n    number = number.toString().replace(/\\s+/g, '');\n    var start = 0;\n    if (number[0] === '-') {\n      start++;\n      this.negative = 1;\n    }\n\n    if (start < number.length) {\n      if (base === 16) {\n        this._parseHex(number, start, endian);\n      } else {\n        this._parseBase(number, base, start);\n        if (endian === 'le') {\n          this._initArray(this.toArray(), base, endian);\n        }\n      }\n    }\n  };\n\n  BN.prototype._initNumber = function _initNumber (number, base, endian) {\n    if (number < 0) {\n      this.negative = 1;\n      number = -number;\n    }\n    if (number < 0x4000000) {\n      this.words = [ number & 0x3ffffff ];\n      this.length = 1;\n    } else if (number < 0x10000000000000) {\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff\n      ];\n      this.length = 2;\n    } else {\n      assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff,\n        1\n      ];\n      this.length = 3;\n    }\n\n    if (endian !== 'le') return;\n\n    // Reverse the bytes\n    this._initArray(this.toArray(), base, endian);\n  };\n\n  BN.prototype._initArray = function _initArray (number, base, endian) {\n    // Perhaps a Uint8Array\n    assert(typeof number.length === 'number');\n    if (number.length <= 0) {\n      this.words = [ 0 ];\n      this.length = 1;\n      return this;\n    }\n\n    this.length = Math.ceil(number.length / 3);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    var j, w;\n    var off = 0;\n    if (endian === 'be') {\n      for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n        w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    } else if (endian === 'le') {\n      for (i = 0, j = 0; i < number.length; i += 3) {\n        w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    }\n    return this.strip();\n  };\n\n  function parseHex4Bits (string, index) {\n    var c = string.charCodeAt(index);\n    // 'A' - 'F'\n    if (c >= 65 && c <= 70) {\n      return c - 55;\n    // 'a' - 'f'\n    } else if (c >= 97 && c <= 102) {\n      return c - 87;\n    // '0' - '9'\n    } else {\n      return (c - 48) & 0xf;\n    }\n  }\n\n  function parseHexByte (string, lowerBound, index) {\n    var r = parseHex4Bits(string, index);\n    if (index - 1 >= lowerBound) {\n      r |= parseHex4Bits(string, index - 1) << 4;\n    }\n    return r;\n  }\n\n  BN.prototype._parseHex = function _parseHex (number, start, endian) {\n    // Create possibly bigger array to ensure that it fits the number\n    this.length = Math.ceil((number.length - start) / 6);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    // 24-bits chunks\n    var off = 0;\n    var j = 0;\n\n    var w;\n    if (endian === 'be') {\n      for (i = number.length - 1; i >= start; i -= 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    } else {\n      var parseLength = number.length - start;\n      for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    }\n\n    this.strip();\n  };\n\n  function parseBase (str, start, end, mul) {\n    var r = 0;\n    var len = Math.min(str.length, end);\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r *= mul;\n\n      // 'a'\n      if (c >= 49) {\n        r += c - 49 + 0xa;\n\n      // 'A'\n      } else if (c >= 17) {\n        r += c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        r += c;\n      }\n    }\n    return r;\n  }\n\n  BN.prototype._parseBase = function _parseBase (number, base, start) {\n    // Initialize as zero\n    this.words = [ 0 ];\n    this.length = 1;\n\n    // Find length of limb in base\n    for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n      limbLen++;\n    }\n    limbLen--;\n    limbPow = (limbPow / base) | 0;\n\n    var total = number.length - start;\n    var mod = total % limbLen;\n    var end = Math.min(total, total - mod) + start;\n\n    var word = 0;\n    for (var i = start; i < end; i += limbLen) {\n      word = parseBase(number, i, i + limbLen, base);\n\n      this.imuln(limbPow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    if (mod !== 0) {\n      var pow = 1;\n      word = parseBase(number, i, number.length, base);\n\n      for (i = 0; i < mod; i++) {\n        pow *= base;\n      }\n\n      this.imuln(pow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    this.strip();\n  };\n\n  BN.prototype.copy = function copy (dest) {\n    dest.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      dest.words[i] = this.words[i];\n    }\n    dest.length = this.length;\n    dest.negative = this.negative;\n    dest.red = this.red;\n  };\n\n  BN.prototype.clone = function clone () {\n    var r = new BN(null);\n    this.copy(r);\n    return r;\n  };\n\n  BN.prototype._expand = function _expand (size) {\n    while (this.length < size) {\n      this.words[this.length++] = 0;\n    }\n    return this;\n  };\n\n  // Remove leading `0` from `this`\n  BN.prototype.strip = function strip () {\n    while (this.length > 1 && this.words[this.length - 1] === 0) {\n      this.length--;\n    }\n    return this._normSign();\n  };\n\n  BN.prototype._normSign = function _normSign () {\n    // -0 = 0\n    if (this.length === 1 && this.words[0] === 0) {\n      this.negative = 0;\n    }\n    return this;\n  };\n\n  BN.prototype.inspect = function inspect () {\n    return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n  };\n\n  /*\n\n  var zeros = [];\n  var groupSizes = [];\n  var groupBases = [];\n\n  var s = '';\n  var i = -1;\n  while (++i < BN.wordSize) {\n    zeros[i] = s;\n    s += '0';\n  }\n  groupSizes[0] = 0;\n  groupSizes[1] = 0;\n  groupBases[0] = 0;\n  groupBases[1] = 0;\n  var base = 2 - 1;\n  while (++base < 36 + 1) {\n    var groupSize = 0;\n    var groupBase = 1;\n    while (groupBase < (1 << BN.wordSize) / base) {\n      groupBase *= base;\n      groupSize += 1;\n    }\n    groupSizes[base] = groupSize;\n    groupBases[base] = groupBase;\n  }\n\n  */\n\n  var zeros = [\n    '',\n    '0',\n    '00',\n    '000',\n    '0000',\n    '00000',\n    '000000',\n    '0000000',\n    '00000000',\n    '000000000',\n    '0000000000',\n    '00000000000',\n    '000000000000',\n    '0000000000000',\n    '00000000000000',\n    '000000000000000',\n    '0000000000000000',\n    '00000000000000000',\n    '000000000000000000',\n    '0000000000000000000',\n    '00000000000000000000',\n    '000000000000000000000',\n    '0000000000000000000000',\n    '00000000000000000000000',\n    '000000000000000000000000',\n    '0000000000000000000000000'\n  ];\n\n  var groupSizes = [\n    0, 0,\n    25, 16, 12, 11, 10, 9, 8,\n    8, 7, 7, 7, 7, 6, 6,\n    6, 6, 6, 6, 6, 5, 5,\n    5, 5, 5, 5, 5, 5, 5,\n    5, 5, 5, 5, 5, 5, 5\n  ];\n\n  var groupBases = [\n    0, 0,\n    33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n    43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n    16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n    6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n    24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n  ];\n\n  BN.prototype.toString = function toString (base, padding) {\n    base = base || 10;\n    padding = padding | 0 || 1;\n\n    var out;\n    if (base === 16 || base === 'hex') {\n      out = '';\n      var off = 0;\n      var carry = 0;\n      for (var i = 0; i < this.length; i++) {\n        var w = this.words[i];\n        var word = (((w << off) | carry) & 0xffffff).toString(16);\n        carry = (w >>> (24 - off)) & 0xffffff;\n        if (carry !== 0 || i !== this.length - 1) {\n          out = zeros[6 - word.length] + word + out;\n        } else {\n          out = word + out;\n        }\n        off += 2;\n        if (off >= 26) {\n          off -= 26;\n          i--;\n        }\n      }\n      if (carry !== 0) {\n        out = carry.toString(16) + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    if (base === (base | 0) && base >= 2 && base <= 36) {\n      // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n      var groupSize = groupSizes[base];\n      // var groupBase = Math.pow(base, groupSize);\n      var groupBase = groupBases[base];\n      out = '';\n      var c = this.clone();\n      c.negative = 0;\n      while (!c.isZero()) {\n        var r = c.modn(groupBase).toString(base);\n        c = c.idivn(groupBase);\n\n        if (!c.isZero()) {\n          out = zeros[groupSize - r.length] + r + out;\n        } else {\n          out = r + out;\n        }\n      }\n      if (this.isZero()) {\n        out = '0' + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    assert(false, 'Base should be between 2 and 36');\n  };\n\n  BN.prototype.toNumber = function toNumber () {\n    var ret = this.words[0];\n    if (this.length === 2) {\n      ret += this.words[1] * 0x4000000;\n    } else if (this.length === 3 && this.words[2] === 0x01) {\n      // NOTE: at this stage it is known that the top bit is set\n      ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n    } else if (this.length > 2) {\n      assert(false, 'Number can only safely store up to 53 bits');\n    }\n    return (this.negative !== 0) ? -ret : ret;\n  };\n\n  BN.prototype.toJSON = function toJSON () {\n    return this.toString(16);\n  };\n\n  BN.prototype.toBuffer = function toBuffer (endian, length) {\n    assert(typeof Buffer !== 'undefined');\n    return this.toArrayLike(Buffer, endian, length);\n  };\n\n  BN.prototype.toArray = function toArray (endian, length) {\n    return this.toArrayLike(Array, endian, length);\n  };\n\n  BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n    var byteLength = this.byteLength();\n    var reqLength = length || Math.max(1, byteLength);\n    assert(byteLength <= reqLength, 'byte array longer than desired length');\n    assert(reqLength > 0, 'Requested array length <= 0');\n\n    this.strip();\n    var littleEndian = endian === 'le';\n    var res = new ArrayType(reqLength);\n\n    var b, i;\n    var q = this.clone();\n    if (!littleEndian) {\n      // Assume big-endian\n      for (i = 0; i < reqLength - byteLength; i++) {\n        res[i] = 0;\n      }\n\n      for (i = 0; !q.isZero(); i++) {\n        b = q.andln(0xff);\n        q.iushrn(8);\n\n        res[reqLength - i - 1] = b;\n      }\n    } else {\n      for (i = 0; !q.isZero(); i++) {\n        b = q.andln(0xff);\n        q.iushrn(8);\n\n        res[i] = b;\n      }\n\n      for (; i < reqLength; i++) {\n        res[i] = 0;\n      }\n    }\n\n    return res;\n  };\n\n  if (Math.clz32) {\n    BN.prototype._countBits = function _countBits (w) {\n      return 32 - Math.clz32(w);\n    };\n  } else {\n    BN.prototype._countBits = function _countBits (w) {\n      var t = w;\n      var r = 0;\n      if (t >= 0x1000) {\n        r += 13;\n        t >>>= 13;\n      }\n      if (t >= 0x40) {\n        r += 7;\n        t >>>= 7;\n      }\n      if (t >= 0x8) {\n        r += 4;\n        t >>>= 4;\n      }\n      if (t >= 0x02) {\n        r += 2;\n        t >>>= 2;\n      }\n      return r + t;\n    };\n  }\n\n  BN.prototype._zeroBits = function _zeroBits (w) {\n    // Short-cut\n    if (w === 0) return 26;\n\n    var t = w;\n    var r = 0;\n    if ((t & 0x1fff) === 0) {\n      r += 13;\n      t >>>= 13;\n    }\n    if ((t & 0x7f) === 0) {\n      r += 7;\n      t >>>= 7;\n    }\n    if ((t & 0xf) === 0) {\n      r += 4;\n      t >>>= 4;\n    }\n    if ((t & 0x3) === 0) {\n      r += 2;\n      t >>>= 2;\n    }\n    if ((t & 0x1) === 0) {\n      r++;\n    }\n    return r;\n  };\n\n  // Return number of used bits in a BN\n  BN.prototype.bitLength = function bitLength () {\n    var w = this.words[this.length - 1];\n    var hi = this._countBits(w);\n    return (this.length - 1) * 26 + hi;\n  };\n\n  function toBitArray (num) {\n    var w = new Array(num.bitLength());\n\n    for (var bit = 0; bit < w.length; bit++) {\n      var off = (bit / 26) | 0;\n      var wbit = bit % 26;\n\n      w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n    }\n\n    return w;\n  }\n\n  // Number of trailing zero bits\n  BN.prototype.zeroBits = function zeroBits () {\n    if (this.isZero()) return 0;\n\n    var r = 0;\n    for (var i = 0; i < this.length; i++) {\n      var b = this._zeroBits(this.words[i]);\n      r += b;\n      if (b !== 26) break;\n    }\n    return r;\n  };\n\n  BN.prototype.byteLength = function byteLength () {\n    return Math.ceil(this.bitLength() / 8);\n  };\n\n  BN.prototype.toTwos = function toTwos (width) {\n    if (this.negative !== 0) {\n      return this.abs().inotn(width).iaddn(1);\n    }\n    return this.clone();\n  };\n\n  BN.prototype.fromTwos = function fromTwos (width) {\n    if (this.testn(width - 1)) {\n      return this.notn(width).iaddn(1).ineg();\n    }\n    return this.clone();\n  };\n\n  BN.prototype.isNeg = function isNeg () {\n    return this.negative !== 0;\n  };\n\n  // Return negative clone of `this`\n  BN.prototype.neg = function neg () {\n    return this.clone().ineg();\n  };\n\n  BN.prototype.ineg = function ineg () {\n    if (!this.isZero()) {\n      this.negative ^= 1;\n    }\n\n    return this;\n  };\n\n  // Or `num` with `this` in-place\n  BN.prototype.iuor = function iuor (num) {\n    while (this.length < num.length) {\n      this.words[this.length++] = 0;\n    }\n\n    for (var i = 0; i < num.length; i++) {\n      this.words[i] = this.words[i] | num.words[i];\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ior = function ior (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuor(num);\n  };\n\n  // Or `num` with `this`\n  BN.prototype.or = function or (num) {\n    if (this.length > num.length) return this.clone().ior(num);\n    return num.clone().ior(this);\n  };\n\n  BN.prototype.uor = function uor (num) {\n    if (this.length > num.length) return this.clone().iuor(num);\n    return num.clone().iuor(this);\n  };\n\n  // And `num` with `this` in-place\n  BN.prototype.iuand = function iuand (num) {\n    // b = min-length(num, this)\n    var b;\n    if (this.length > num.length) {\n      b = num;\n    } else {\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = this.words[i] & num.words[i];\n    }\n\n    this.length = b.length;\n\n    return this.strip();\n  };\n\n  BN.prototype.iand = function iand (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuand(num);\n  };\n\n  // And `num` with `this`\n  BN.prototype.and = function and (num) {\n    if (this.length > num.length) return this.clone().iand(num);\n    return num.clone().iand(this);\n  };\n\n  BN.prototype.uand = function uand (num) {\n    if (this.length > num.length) return this.clone().iuand(num);\n    return num.clone().iuand(this);\n  };\n\n  // Xor `num` with `this` in-place\n  BN.prototype.iuxor = function iuxor (num) {\n    // a.length > b.length\n    var a;\n    var b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = a.words[i] ^ b.words[i];\n    }\n\n    if (this !== a) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = a.length;\n\n    return this.strip();\n  };\n\n  BN.prototype.ixor = function ixor (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuxor(num);\n  };\n\n  // Xor `num` with `this`\n  BN.prototype.xor = function xor (num) {\n    if (this.length > num.length) return this.clone().ixor(num);\n    return num.clone().ixor(this);\n  };\n\n  BN.prototype.uxor = function uxor (num) {\n    if (this.length > num.length) return this.clone().iuxor(num);\n    return num.clone().iuxor(this);\n  };\n\n  // Not ``this`` with ``width`` bitwidth\n  BN.prototype.inotn = function inotn (width) {\n    assert(typeof width === 'number' && width >= 0);\n\n    var bytesNeeded = Math.ceil(width / 26) | 0;\n    var bitsLeft = width % 26;\n\n    // Extend the buffer with leading zeroes\n    this._expand(bytesNeeded);\n\n    if (bitsLeft > 0) {\n      bytesNeeded--;\n    }\n\n    // Handle complete words\n    for (var i = 0; i < bytesNeeded; i++) {\n      this.words[i] = ~this.words[i] & 0x3ffffff;\n    }\n\n    // Handle the residue\n    if (bitsLeft > 0) {\n      this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n    }\n\n    // And remove leading zeroes\n    return this.strip();\n  };\n\n  BN.prototype.notn = function notn (width) {\n    return this.clone().inotn(width);\n  };\n\n  // Set `bit` of `this`\n  BN.prototype.setn = function setn (bit, val) {\n    assert(typeof bit === 'number' && bit >= 0);\n\n    var off = (bit / 26) | 0;\n    var wbit = bit % 26;\n\n    this._expand(off + 1);\n\n    if (val) {\n      this.words[off] = this.words[off] | (1 << wbit);\n    } else {\n      this.words[off] = this.words[off] & ~(1 << wbit);\n    }\n\n    return this.strip();\n  };\n\n  // Add `num` to `this` in-place\n  BN.prototype.iadd = function iadd (num) {\n    var r;\n\n    // negative + positive\n    if (this.negative !== 0 && num.negative === 0) {\n      this.negative = 0;\n      r = this.isub(num);\n      this.negative ^= 1;\n      return this._normSign();\n\n    // positive + negative\n    } else if (this.negative === 0 && num.negative !== 0) {\n      num.negative = 0;\n      r = this.isub(num);\n      num.negative = 1;\n      return r._normSign();\n    }\n\n    // a.length > b.length\n    var a, b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n\n    this.length = a.length;\n    if (carry !== 0) {\n      this.words[this.length] = carry;\n      this.length++;\n    // Copy the rest of the words\n    } else if (a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    return this;\n  };\n\n  // Add `num` to `this`\n  BN.prototype.add = function add (num) {\n    var res;\n    if (num.negative !== 0 && this.negative === 0) {\n      num.negative = 0;\n      res = this.sub(num);\n      num.negative ^= 1;\n      return res;\n    } else if (num.negative === 0 && this.negative !== 0) {\n      this.negative = 0;\n      res = num.sub(this);\n      this.negative = 1;\n      return res;\n    }\n\n    if (this.length > num.length) return this.clone().iadd(num);\n\n    return num.clone().iadd(this);\n  };\n\n  // Subtract `num` from `this` in-place\n  BN.prototype.isub = function isub (num) {\n    // this - (-num) = this + num\n    if (num.negative !== 0) {\n      num.negative = 0;\n      var r = this.iadd(num);\n      num.negative = 1;\n      return r._normSign();\n\n    // -this - num = -(this + num)\n    } else if (this.negative !== 0) {\n      this.negative = 0;\n      this.iadd(num);\n      this.negative = 1;\n      return this._normSign();\n    }\n\n    // At this point both numbers are positive\n    var cmp = this.cmp(num);\n\n    // Optimization - zeroify\n    if (cmp === 0) {\n      this.negative = 0;\n      this.length = 1;\n      this.words[0] = 0;\n      return this;\n    }\n\n    // a > b\n    var a, b;\n    if (cmp > 0) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n\n    // Copy rest of the words\n    if (carry === 0 && i < a.length && a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = Math.max(this.length, i);\n\n    if (a !== this) {\n      this.negative = 1;\n    }\n\n    return this.strip();\n  };\n\n  // Subtract `num` from `this`\n  BN.prototype.sub = function sub (num) {\n    return this.clone().isub(num);\n  };\n\n  function smallMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    var len = (self.length + num.length) | 0;\n    out.length = len;\n    len = (len - 1) | 0;\n\n    // Peel one iteration (compiler can't do it, because of code complexity)\n    var a = self.words[0] | 0;\n    var b = num.words[0] | 0;\n    var r = a * b;\n\n    var lo = r & 0x3ffffff;\n    var carry = (r / 0x4000000) | 0;\n    out.words[0] = lo;\n\n    for (var k = 1; k < len; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = carry >>> 26;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = (k - j) | 0;\n        a = self.words[i] | 0;\n        b = num.words[j] | 0;\n        r = a * b + rword;\n        ncarry += (r / 0x4000000) | 0;\n        rword = r & 0x3ffffff;\n      }\n      out.words[k] = rword | 0;\n      carry = ncarry | 0;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry | 0;\n    } else {\n      out.length--;\n    }\n\n    return out.strip();\n  }\n\n  // TODO(indutny): it may be reasonable to omit it for users who don't need\n  // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n  // multiplication (like elliptic secp256k1).\n  var comb10MulTo = function comb10MulTo (self, num, out) {\n    var a = self.words;\n    var b = num.words;\n    var o = out.words;\n    var c = 0;\n    var lo;\n    var mid;\n    var hi;\n    var a0 = a[0] | 0;\n    var al0 = a0 & 0x1fff;\n    var ah0 = a0 >>> 13;\n    var a1 = a[1] | 0;\n    var al1 = a1 & 0x1fff;\n    var ah1 = a1 >>> 13;\n    var a2 = a[2] | 0;\n    var al2 = a2 & 0x1fff;\n    var ah2 = a2 >>> 13;\n    var a3 = a[3] | 0;\n    var al3 = a3 & 0x1fff;\n    var ah3 = a3 >>> 13;\n    var a4 = a[4] | 0;\n    var al4 = a4 & 0x1fff;\n    var ah4 = a4 >>> 13;\n    var a5 = a[5] | 0;\n    var al5 = a5 & 0x1fff;\n    var ah5 = a5 >>> 13;\n    var a6 = a[6] | 0;\n    var al6 = a6 & 0x1fff;\n    var ah6 = a6 >>> 13;\n    var a7 = a[7] | 0;\n    var al7 = a7 & 0x1fff;\n    var ah7 = a7 >>> 13;\n    var a8 = a[8] | 0;\n    var al8 = a8 & 0x1fff;\n    var ah8 = a8 >>> 13;\n    var a9 = a[9] | 0;\n    var al9 = a9 & 0x1fff;\n    var ah9 = a9 >>> 13;\n    var b0 = b[0] | 0;\n    var bl0 = b0 & 0x1fff;\n    var bh0 = b0 >>> 13;\n    var b1 = b[1] | 0;\n    var bl1 = b1 & 0x1fff;\n    var bh1 = b1 >>> 13;\n    var b2 = b[2] | 0;\n    var bl2 = b2 & 0x1fff;\n    var bh2 = b2 >>> 13;\n    var b3 = b[3] | 0;\n    var bl3 = b3 & 0x1fff;\n    var bh3 = b3 >>> 13;\n    var b4 = b[4] | 0;\n    var bl4 = b4 & 0x1fff;\n    var bh4 = b4 >>> 13;\n    var b5 = b[5] | 0;\n    var bl5 = b5 & 0x1fff;\n    var bh5 = b5 >>> 13;\n    var b6 = b[6] | 0;\n    var bl6 = b6 & 0x1fff;\n    var bh6 = b6 >>> 13;\n    var b7 = b[7] | 0;\n    var bl7 = b7 & 0x1fff;\n    var bh7 = b7 >>> 13;\n    var b8 = b[8] | 0;\n    var bl8 = b8 & 0x1fff;\n    var bh8 = b8 >>> 13;\n    var b9 = b[9] | 0;\n    var bl9 = b9 & 0x1fff;\n    var bh9 = b9 >>> 13;\n\n    out.negative = self.negative ^ num.negative;\n    out.length = 19;\n    /* k = 0 */\n    lo = Math.imul(al0, bl0);\n    mid = Math.imul(al0, bh0);\n    mid = (mid + Math.imul(ah0, bl0)) | 0;\n    hi = Math.imul(ah0, bh0);\n    var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n    w0 &= 0x3ffffff;\n    /* k = 1 */\n    lo = Math.imul(al1, bl0);\n    mid = Math.imul(al1, bh0);\n    mid = (mid + Math.imul(ah1, bl0)) | 0;\n    hi = Math.imul(ah1, bh0);\n    lo = (lo + Math.imul(al0, bl1)) | 0;\n    mid = (mid + Math.imul(al0, bh1)) | 0;\n    mid = (mid + Math.imul(ah0, bl1)) | 0;\n    hi = (hi + Math.imul(ah0, bh1)) | 0;\n    var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n    w1 &= 0x3ffffff;\n    /* k = 2 */\n    lo = Math.imul(al2, bl0);\n    mid = Math.imul(al2, bh0);\n    mid = (mid + Math.imul(ah2, bl0)) | 0;\n    hi = Math.imul(ah2, bh0);\n    lo = (lo + Math.imul(al1, bl1)) | 0;\n    mid = (mid + Math.imul(al1, bh1)) | 0;\n    mid = (mid + Math.imul(ah1, bl1)) | 0;\n    hi = (hi + Math.imul(ah1, bh1)) | 0;\n    lo = (lo + Math.imul(al0, bl2)) | 0;\n    mid = (mid + Math.imul(al0, bh2)) | 0;\n    mid = (mid + Math.imul(ah0, bl2)) | 0;\n    hi = (hi + Math.imul(ah0, bh2)) | 0;\n    var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n    w2 &= 0x3ffffff;\n    /* k = 3 */\n    lo = Math.imul(al3, bl0);\n    mid = Math.imul(al3, bh0);\n    mid = (mid + Math.imul(ah3, bl0)) | 0;\n    hi = Math.imul(ah3, bh0);\n    lo = (lo + Math.imul(al2, bl1)) | 0;\n    mid = (mid + Math.imul(al2, bh1)) | 0;\n    mid = (mid + Math.imul(ah2, bl1)) | 0;\n    hi = (hi + Math.imul(ah2, bh1)) | 0;\n    lo = (lo + Math.imul(al1, bl2)) | 0;\n    mid = (mid + Math.imul(al1, bh2)) | 0;\n    mid = (mid + Math.imul(ah1, bl2)) | 0;\n    hi = (hi + Math.imul(ah1, bh2)) | 0;\n    lo = (lo + Math.imul(al0, bl3)) | 0;\n    mid = (mid + Math.imul(al0, bh3)) | 0;\n    mid = (mid + Math.imul(ah0, bl3)) | 0;\n    hi = (hi + Math.imul(ah0, bh3)) | 0;\n    var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n    w3 &= 0x3ffffff;\n    /* k = 4 */\n    lo = Math.imul(al4, bl0);\n    mid = Math.imul(al4, bh0);\n    mid = (mid + Math.imul(ah4, bl0)) | 0;\n    hi = Math.imul(ah4, bh0);\n    lo = (lo + Math.imul(al3, bl1)) | 0;\n    mid = (mid + Math.imul(al3, bh1)) | 0;\n    mid = (mid + Math.imul(ah3, bl1)) | 0;\n    hi = (hi + Math.imul(ah3, bh1)) | 0;\n    lo = (lo + Math.imul(al2, bl2)) | 0;\n    mid = (mid + Math.imul(al2, bh2)) | 0;\n    mid = (mid + Math.imul(ah2, bl2)) | 0;\n    hi = (hi + Math.imul(ah2, bh2)) | 0;\n    lo = (lo + Math.imul(al1, bl3)) | 0;\n    mid = (mid + Math.imul(al1, bh3)) | 0;\n    mid = (mid + Math.imul(ah1, bl3)) | 0;\n    hi = (hi + Math.imul(ah1, bh3)) | 0;\n    lo = (lo + Math.imul(al0, bl4)) | 0;\n    mid = (mid + Math.imul(al0, bh4)) | 0;\n    mid = (mid + Math.imul(ah0, bl4)) | 0;\n    hi = (hi + Math.imul(ah0, bh4)) | 0;\n    var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n    w4 &= 0x3ffffff;\n    /* k = 5 */\n    lo = Math.imul(al5, bl0);\n    mid = Math.imul(al5, bh0);\n    mid = (mid + Math.imul(ah5, bl0)) | 0;\n    hi = Math.imul(ah5, bh0);\n    lo = (lo + Math.imul(al4, bl1)) | 0;\n    mid = (mid + Math.imul(al4, bh1)) | 0;\n    mid = (mid + Math.imul(ah4, bl1)) | 0;\n    hi = (hi + Math.imul(ah4, bh1)) | 0;\n    lo = (lo + Math.imul(al3, bl2)) | 0;\n    mid = (mid + Math.imul(al3, bh2)) | 0;\n    mid = (mid + Math.imul(ah3, bl2)) | 0;\n    hi = (hi + Math.imul(ah3, bh2)) | 0;\n    lo = (lo + Math.imul(al2, bl3)) | 0;\n    mid = (mid + Math.imul(al2, bh3)) | 0;\n    mid = (mid + Math.imul(ah2, bl3)) | 0;\n    hi = (hi + Math.imul(ah2, bh3)) | 0;\n    lo = (lo + Math.imul(al1, bl4)) | 0;\n    mid = (mid + Math.imul(al1, bh4)) | 0;\n    mid = (mid + Math.imul(ah1, bl4)) | 0;\n    hi = (hi + Math.imul(ah1, bh4)) | 0;\n    lo = (lo + Math.imul(al0, bl5)) | 0;\n    mid = (mid + Math.imul(al0, bh5)) | 0;\n    mid = (mid + Math.imul(ah0, bl5)) | 0;\n    hi = (hi + Math.imul(ah0, bh5)) | 0;\n    var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n    w5 &= 0x3ffffff;\n    /* k = 6 */\n    lo = Math.imul(al6, bl0);\n    mid = Math.imul(al6, bh0);\n    mid = (mid + Math.imul(ah6, bl0)) | 0;\n    hi = Math.imul(ah6, bh0);\n    lo = (lo + Math.imul(al5, bl1)) | 0;\n    mid = (mid + Math.imul(al5, bh1)) | 0;\n    mid = (mid + Math.imul(ah5, bl1)) | 0;\n    hi = (hi + Math.imul(ah5, bh1)) | 0;\n    lo = (lo + Math.imul(al4, bl2)) | 0;\n    mid = (mid + Math.imul(al4, bh2)) | 0;\n    mid = (mid + Math.imul(ah4, bl2)) | 0;\n    hi = (hi + Math.imul(ah4, bh2)) | 0;\n    lo = (lo + Math.imul(al3, bl3)) | 0;\n    mid = (mid + Math.imul(al3, bh3)) | 0;\n    mid = (mid + Math.imul(ah3, bl3)) | 0;\n    hi = (hi + Math.imul(ah3, bh3)) | 0;\n    lo = (lo + Math.imul(al2, bl4)) | 0;\n    mid = (mid + Math.imul(al2, bh4)) | 0;\n    mid = (mid + Math.imul(ah2, bl4)) | 0;\n    hi = (hi + Math.imul(ah2, bh4)) | 0;\n    lo = (lo + Math.imul(al1, bl5)) | 0;\n    mid = (mid + Math.imul(al1, bh5)) | 0;\n    mid = (mid + Math.imul(ah1, bl5)) | 0;\n    hi = (hi + Math.imul(ah1, bh5)) | 0;\n    lo = (lo + Math.imul(al0, bl6)) | 0;\n    mid = (mid + Math.imul(al0, bh6)) | 0;\n    mid = (mid + Math.imul(ah0, bl6)) | 0;\n    hi = (hi + Math.imul(ah0, bh6)) | 0;\n    var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n    w6 &= 0x3ffffff;\n    /* k = 7 */\n    lo = Math.imul(al7, bl0);\n    mid = Math.imul(al7, bh0);\n    mid = (mid + Math.imul(ah7, bl0)) | 0;\n    hi = Math.imul(ah7, bh0);\n    lo = (lo + Math.imul(al6, bl1)) | 0;\n    mid = (mid + Math.imul(al6, bh1)) | 0;\n    mid = (mid + Math.imul(ah6, bl1)) | 0;\n    hi = (hi + Math.imul(ah6, bh1)) | 0;\n    lo = (lo + Math.imul(al5, bl2)) | 0;\n    mid = (mid + Math.imul(al5, bh2)) | 0;\n    mid = (mid + Math.imul(ah5, bl2)) | 0;\n    hi = (hi + Math.imul(ah5, bh2)) | 0;\n    lo = (lo + Math.imul(al4, bl3)) | 0;\n    mid = (mid + Math.imul(al4, bh3)) | 0;\n    mid = (mid + Math.imul(ah4, bl3)) | 0;\n    hi = (hi + Math.imul(ah4, bh3)) | 0;\n    lo = (lo + Math.imul(al3, bl4)) | 0;\n    mid = (mid + Math.imul(al3, bh4)) | 0;\n    mid = (mid + Math.imul(ah3, bl4)) | 0;\n    hi = (hi + Math.imul(ah3, bh4)) | 0;\n    lo = (lo + Math.imul(al2, bl5)) | 0;\n    mid = (mid + Math.imul(al2, bh5)) | 0;\n    mid = (mid + Math.imul(ah2, bl5)) | 0;\n    hi = (hi + Math.imul(ah2, bh5)) | 0;\n    lo = (lo + Math.imul(al1, bl6)) | 0;\n    mid = (mid + Math.imul(al1, bh6)) | 0;\n    mid = (mid + Math.imul(ah1, bl6)) | 0;\n    hi = (hi + Math.imul(ah1, bh6)) | 0;\n    lo = (lo + Math.imul(al0, bl7)) | 0;\n    mid = (mid + Math.imul(al0, bh7)) | 0;\n    mid = (mid + Math.imul(ah0, bl7)) | 0;\n    hi = (hi + Math.imul(ah0, bh7)) | 0;\n    var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n    w7 &= 0x3ffffff;\n    /* k = 8 */\n    lo = Math.imul(al8, bl0);\n    mid = Math.imul(al8, bh0);\n    mid = (mid + Math.imul(ah8, bl0)) | 0;\n    hi = Math.imul(ah8, bh0);\n    lo = (lo + Math.imul(al7, bl1)) | 0;\n    mid = (mid + Math.imul(al7, bh1)) | 0;\n    mid = (mid + Math.imul(ah7, bl1)) | 0;\n    hi = (hi + Math.imul(ah7, bh1)) | 0;\n    lo = (lo + Math.imul(al6, bl2)) | 0;\n    mid = (mid + Math.imul(al6, bh2)) | 0;\n    mid = (mid + Math.imul(ah6, bl2)) | 0;\n    hi = (hi + Math.imul(ah6, bh2)) | 0;\n    lo = (lo + Math.imul(al5, bl3)) | 0;\n    mid = (mid + Math.imul(al5, bh3)) | 0;\n    mid = (mid + Math.imul(ah5, bl3)) | 0;\n    hi = (hi + Math.imul(ah5, bh3)) | 0;\n    lo = (lo + Math.imul(al4, bl4)) | 0;\n    mid = (mid + Math.imul(al4, bh4)) | 0;\n    mid = (mid + Math.imul(ah4, bl4)) | 0;\n    hi = (hi + Math.imul(ah4, bh4)) | 0;\n    lo = (lo + Math.imul(al3, bl5)) | 0;\n    mid = (mid + Math.imul(al3, bh5)) | 0;\n    mid = (mid + Math.imul(ah3, bl5)) | 0;\n    hi = (hi + Math.imul(ah3, bh5)) | 0;\n    lo = (lo + Math.imul(al2, bl6)) | 0;\n    mid = (mid + Math.imul(al2, bh6)) | 0;\n    mid = (mid + Math.imul(ah2, bl6)) | 0;\n    hi = (hi + Math.imul(ah2, bh6)) | 0;\n    lo = (lo + Math.imul(al1, bl7)) | 0;\n    mid = (mid + Math.imul(al1, bh7)) | 0;\n    mid = (mid + Math.imul(ah1, bl7)) | 0;\n    hi = (hi + Math.imul(ah1, bh7)) | 0;\n    lo = (lo + Math.imul(al0, bl8)) | 0;\n    mid = (mid + Math.imul(al0, bh8)) | 0;\n    mid = (mid + Math.imul(ah0, bl8)) | 0;\n    hi = (hi + Math.imul(ah0, bh8)) | 0;\n    var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n    w8 &= 0x3ffffff;\n    /* k = 9 */\n    lo = Math.imul(al9, bl0);\n    mid = Math.imul(al9, bh0);\n    mid = (mid + Math.imul(ah9, bl0)) | 0;\n    hi = Math.imul(ah9, bh0);\n    lo = (lo + Math.imul(al8, bl1)) | 0;\n    mid = (mid + Math.imul(al8, bh1)) | 0;\n    mid = (mid + Math.imul(ah8, bl1)) | 0;\n    hi = (hi + Math.imul(ah8, bh1)) | 0;\n    lo = (lo + Math.imul(al7, bl2)) | 0;\n    mid = (mid + Math.imul(al7, bh2)) | 0;\n    mid = (mid + Math.imul(ah7, bl2)) | 0;\n    hi = (hi + Math.imul(ah7, bh2)) | 0;\n    lo = (lo + Math.imul(al6, bl3)) | 0;\n    mid = (mid + Math.imul(al6, bh3)) | 0;\n    mid = (mid + Math.imul(ah6, bl3)) | 0;\n    hi = (hi + Math.imul(ah6, bh3)) | 0;\n    lo = (lo + Math.imul(al5, bl4)) | 0;\n    mid = (mid + Math.imul(al5, bh4)) | 0;\n    mid = (mid + Math.imul(ah5, bl4)) | 0;\n    hi = (hi + Math.imul(ah5, bh4)) | 0;\n    lo = (lo + Math.imul(al4, bl5)) | 0;\n    mid = (mid + Math.imul(al4, bh5)) | 0;\n    mid = (mid + Math.imul(ah4, bl5)) | 0;\n    hi = (hi + Math.imul(ah4, bh5)) | 0;\n    lo = (lo + Math.imul(al3, bl6)) | 0;\n    mid = (mid + Math.imul(al3, bh6)) | 0;\n    mid = (mid + Math.imul(ah3, bl6)) | 0;\n    hi = (hi + Math.imul(ah3, bh6)) | 0;\n    lo = (lo + Math.imul(al2, bl7)) | 0;\n    mid = (mid + Math.imul(al2, bh7)) | 0;\n    mid = (mid + Math.imul(ah2, bl7)) | 0;\n    hi = (hi + Math.imul(ah2, bh7)) | 0;\n    lo = (lo + Math.imul(al1, bl8)) | 0;\n    mid = (mid + Math.imul(al1, bh8)) | 0;\n    mid = (mid + Math.imul(ah1, bl8)) | 0;\n    hi = (hi + Math.imul(ah1, bh8)) | 0;\n    lo = (lo + Math.imul(al0, bl9)) | 0;\n    mid = (mid + Math.imul(al0, bh9)) | 0;\n    mid = (mid + Math.imul(ah0, bl9)) | 0;\n    hi = (hi + Math.imul(ah0, bh9)) | 0;\n    var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n    w9 &= 0x3ffffff;\n    /* k = 10 */\n    lo = Math.imul(al9, bl1);\n    mid = Math.imul(al9, bh1);\n    mid = (mid + Math.imul(ah9, bl1)) | 0;\n    hi = Math.imul(ah9, bh1);\n    lo = (lo + Math.imul(al8, bl2)) | 0;\n    mid = (mid + Math.imul(al8, bh2)) | 0;\n    mid = (mid + Math.imul(ah8, bl2)) | 0;\n    hi = (hi + Math.imul(ah8, bh2)) | 0;\n    lo = (lo + Math.imul(al7, bl3)) | 0;\n    mid = (mid + Math.imul(al7, bh3)) | 0;\n    mid = (mid + Math.imul(ah7, bl3)) | 0;\n    hi = (hi + Math.imul(ah7, bh3)) | 0;\n    lo = (lo + Math.imul(al6, bl4)) | 0;\n    mid = (mid + Math.imul(al6, bh4)) | 0;\n    mid = (mid + Math.imul(ah6, bl4)) | 0;\n    hi = (hi + Math.imul(ah6, bh4)) | 0;\n    lo = (lo + Math.imul(al5, bl5)) | 0;\n    mid = (mid + Math.imul(al5, bh5)) | 0;\n    mid = (mid + Math.imul(ah5, bl5)) | 0;\n    hi = (hi + Math.imul(ah5, bh5)) | 0;\n    lo = (lo + Math.imul(al4, bl6)) | 0;\n    mid = (mid + Math.imul(al4, bh6)) | 0;\n    mid = (mid + Math.imul(ah4, bl6)) | 0;\n    hi = (hi + Math.imul(ah4, bh6)) | 0;\n    lo = (lo + Math.imul(al3, bl7)) | 0;\n    mid = (mid + Math.imul(al3, bh7)) | 0;\n    mid = (mid + Math.imul(ah3, bl7)) | 0;\n    hi = (hi + Math.imul(ah3, bh7)) | 0;\n    lo = (lo + Math.imul(al2, bl8)) | 0;\n    mid = (mid + Math.imul(al2, bh8)) | 0;\n    mid = (mid + Math.imul(ah2, bl8)) | 0;\n    hi = (hi + Math.imul(ah2, bh8)) | 0;\n    lo = (lo + Math.imul(al1, bl9)) | 0;\n    mid = (mid + Math.imul(al1, bh9)) | 0;\n    mid = (mid + Math.imul(ah1, bl9)) | 0;\n    hi = (hi + Math.imul(ah1, bh9)) | 0;\n    var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n    w10 &= 0x3ffffff;\n    /* k = 11 */\n    lo = Math.imul(al9, bl2);\n    mid = Math.imul(al9, bh2);\n    mid = (mid + Math.imul(ah9, bl2)) | 0;\n    hi = Math.imul(ah9, bh2);\n    lo = (lo + Math.imul(al8, bl3)) | 0;\n    mid = (mid + Math.imul(al8, bh3)) | 0;\n    mid = (mid + Math.imul(ah8, bl3)) | 0;\n    hi = (hi + Math.imul(ah8, bh3)) | 0;\n    lo = (lo + Math.imul(al7, bl4)) | 0;\n    mid = (mid + Math.imul(al7, bh4)) | 0;\n    mid = (mid + Math.imul(ah7, bl4)) | 0;\n    hi = (hi + Math.imul(ah7, bh4)) | 0;\n    lo = (lo + Math.imul(al6, bl5)) | 0;\n    mid = (mid + Math.imul(al6, bh5)) | 0;\n    mid = (mid + Math.imul(ah6, bl5)) | 0;\n    hi = (hi + Math.imul(ah6, bh5)) | 0;\n    lo = (lo + Math.imul(al5, bl6)) | 0;\n    mid = (mid + Math.imul(al5, bh6)) | 0;\n    mid = (mid + Math.imul(ah5, bl6)) | 0;\n    hi = (hi + Math.imul(ah5, bh6)) | 0;\n    lo = (lo + Math.imul(al4, bl7)) | 0;\n    mid = (mid + Math.imul(al4, bh7)) | 0;\n    mid = (mid + Math.imul(ah4, bl7)) | 0;\n    hi = (hi + Math.imul(ah4, bh7)) | 0;\n    lo = (lo + Math.imul(al3, bl8)) | 0;\n    mid = (mid + Math.imul(al3, bh8)) | 0;\n    mid = (mid + Math.imul(ah3, bl8)) | 0;\n    hi = (hi + Math.imul(ah3, bh8)) | 0;\n    lo = (lo + Math.imul(al2, bl9)) | 0;\n    mid = (mid + Math.imul(al2, bh9)) | 0;\n    mid = (mid + Math.imul(ah2, bl9)) | 0;\n    hi = (hi + Math.imul(ah2, bh9)) | 0;\n    var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n    w11 &= 0x3ffffff;\n    /* k = 12 */\n    lo = Math.imul(al9, bl3);\n    mid = Math.imul(al9, bh3);\n    mid = (mid + Math.imul(ah9, bl3)) | 0;\n    hi = Math.imul(ah9, bh3);\n    lo = (lo + Math.imul(al8, bl4)) | 0;\n    mid = (mid + Math.imul(al8, bh4)) | 0;\n    mid = (mid + Math.imul(ah8, bl4)) | 0;\n    hi = (hi + Math.imul(ah8, bh4)) | 0;\n    lo = (lo + Math.imul(al7, bl5)) | 0;\n    mid = (mid + Math.imul(al7, bh5)) | 0;\n    mid = (mid + Math.imul(ah7, bl5)) | 0;\n    hi = (hi + Math.imul(ah7, bh5)) | 0;\n    lo = (lo + Math.imul(al6, bl6)) | 0;\n    mid = (mid + Math.imul(al6, bh6)) | 0;\n    mid = (mid + Math.imul(ah6, bl6)) | 0;\n    hi = (hi + Math.imul(ah6, bh6)) | 0;\n    lo = (lo + Math.imul(al5, bl7)) | 0;\n    mid = (mid + Math.imul(al5, bh7)) | 0;\n    mid = (mid + Math.imul(ah5, bl7)) | 0;\n    hi = (hi + Math.imul(ah5, bh7)) | 0;\n    lo = (lo + Math.imul(al4, bl8)) | 0;\n    mid = (mid + Math.imul(al4, bh8)) | 0;\n    mid = (mid + Math.imul(ah4, bl8)) | 0;\n    hi = (hi + Math.imul(ah4, bh8)) | 0;\n    lo = (lo + Math.imul(al3, bl9)) | 0;\n    mid = (mid + Math.imul(al3, bh9)) | 0;\n    mid = (mid + Math.imul(ah3, bl9)) | 0;\n    hi = (hi + Math.imul(ah3, bh9)) | 0;\n    var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n    w12 &= 0x3ffffff;\n    /* k = 13 */\n    lo = Math.imul(al9, bl4);\n    mid = Math.imul(al9, bh4);\n    mid = (mid + Math.imul(ah9, bl4)) | 0;\n    hi = Math.imul(ah9, bh4);\n    lo = (lo + Math.imul(al8, bl5)) | 0;\n    mid = (mid + Math.imul(al8, bh5)) | 0;\n    mid = (mid + Math.imul(ah8, bl5)) | 0;\n    hi = (hi + Math.imul(ah8, bh5)) | 0;\n    lo = (lo + Math.imul(al7, bl6)) | 0;\n    mid = (mid + Math.imul(al7, bh6)) | 0;\n    mid = (mid + Math.imul(ah7, bl6)) | 0;\n    hi = (hi + Math.imul(ah7, bh6)) | 0;\n    lo = (lo + Math.imul(al6, bl7)) | 0;\n    mid = (mid + Math.imul(al6, bh7)) | 0;\n    mid = (mid + Math.imul(ah6, bl7)) | 0;\n    hi = (hi + Math.imul(ah6, bh7)) | 0;\n    lo = (lo + Math.imul(al5, bl8)) | 0;\n    mid = (mid + Math.imul(al5, bh8)) | 0;\n    mid = (mid + Math.imul(ah5, bl8)) | 0;\n    hi = (hi + Math.imul(ah5, bh8)) | 0;\n    lo = (lo + Math.imul(al4, bl9)) | 0;\n    mid = (mid + Math.imul(al4, bh9)) | 0;\n    mid = (mid + Math.imul(ah4, bl9)) | 0;\n    hi = (hi + Math.imul(ah4, bh9)) | 0;\n    var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n    w13 &= 0x3ffffff;\n    /* k = 14 */\n    lo = Math.imul(al9, bl5);\n    mid = Math.imul(al9, bh5);\n    mid = (mid + Math.imul(ah9, bl5)) | 0;\n    hi = Math.imul(ah9, bh5);\n    lo = (lo + Math.imul(al8, bl6)) | 0;\n    mid = (mid + Math.imul(al8, bh6)) | 0;\n    mid = (mid + Math.imul(ah8, bl6)) | 0;\n    hi = (hi + Math.imul(ah8, bh6)) | 0;\n    lo = (lo + Math.imul(al7, bl7)) | 0;\n    mid = (mid + Math.imul(al7, bh7)) | 0;\n    mid = (mid + Math.imul(ah7, bl7)) | 0;\n    hi = (hi + Math.imul(ah7, bh7)) | 0;\n    lo = (lo + Math.imul(al6, bl8)) | 0;\n    mid = (mid + Math.imul(al6, bh8)) | 0;\n    mid = (mid + Math.imul(ah6, bl8)) | 0;\n    hi = (hi + Math.imul(ah6, bh8)) | 0;\n    lo = (lo + Math.imul(al5, bl9)) | 0;\n    mid = (mid + Math.imul(al5, bh9)) | 0;\n    mid = (mid + Math.imul(ah5, bl9)) | 0;\n    hi = (hi + Math.imul(ah5, bh9)) | 0;\n    var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n    w14 &= 0x3ffffff;\n    /* k = 15 */\n    lo = Math.imul(al9, bl6);\n    mid = Math.imul(al9, bh6);\n    mid = (mid + Math.imul(ah9, bl6)) | 0;\n    hi = Math.imul(ah9, bh6);\n    lo = (lo + Math.imul(al8, bl7)) | 0;\n    mid = (mid + Math.imul(al8, bh7)) | 0;\n    mid = (mid + Math.imul(ah8, bl7)) | 0;\n    hi = (hi + Math.imul(ah8, bh7)) | 0;\n    lo = (lo + Math.imul(al7, bl8)) | 0;\n    mid = (mid + Math.imul(al7, bh8)) | 0;\n    mid = (mid + Math.imul(ah7, bl8)) | 0;\n    hi = (hi + Math.imul(ah7, bh8)) | 0;\n    lo = (lo + Math.imul(al6, bl9)) | 0;\n    mid = (mid + Math.imul(al6, bh9)) | 0;\n    mid = (mid + Math.imul(ah6, bl9)) | 0;\n    hi = (hi + Math.imul(ah6, bh9)) | 0;\n    var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n    w15 &= 0x3ffffff;\n    /* k = 16 */\n    lo = Math.imul(al9, bl7);\n    mid = Math.imul(al9, bh7);\n    mid = (mid + Math.imul(ah9, bl7)) | 0;\n    hi = Math.imul(ah9, bh7);\n    lo = (lo + Math.imul(al8, bl8)) | 0;\n    mid = (mid + Math.imul(al8, bh8)) | 0;\n    mid = (mid + Math.imul(ah8, bl8)) | 0;\n    hi = (hi + Math.imul(ah8, bh8)) | 0;\n    lo = (lo + Math.imul(al7, bl9)) | 0;\n    mid = (mid + Math.imul(al7, bh9)) | 0;\n    mid = (mid + Math.imul(ah7, bl9)) | 0;\n    hi = (hi + Math.imul(ah7, bh9)) | 0;\n    var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n    w16 &= 0x3ffffff;\n    /* k = 17 */\n    lo = Math.imul(al9, bl8);\n    mid = Math.imul(al9, bh8);\n    mid = (mid + Math.imul(ah9, bl8)) | 0;\n    hi = Math.imul(ah9, bh8);\n    lo = (lo + Math.imul(al8, bl9)) | 0;\n    mid = (mid + Math.imul(al8, bh9)) | 0;\n    mid = (mid + Math.imul(ah8, bl9)) | 0;\n    hi = (hi + Math.imul(ah8, bh9)) | 0;\n    var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n    w17 &= 0x3ffffff;\n    /* k = 18 */\n    lo = Math.imul(al9, bl9);\n    mid = Math.imul(al9, bh9);\n    mid = (mid + Math.imul(ah9, bl9)) | 0;\n    hi = Math.imul(ah9, bh9);\n    var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n    w18 &= 0x3ffffff;\n    o[0] = w0;\n    o[1] = w1;\n    o[2] = w2;\n    o[3] = w3;\n    o[4] = w4;\n    o[5] = w5;\n    o[6] = w6;\n    o[7] = w7;\n    o[8] = w8;\n    o[9] = w9;\n    o[10] = w10;\n    o[11] = w11;\n    o[12] = w12;\n    o[13] = w13;\n    o[14] = w14;\n    o[15] = w15;\n    o[16] = w16;\n    o[17] = w17;\n    o[18] = w18;\n    if (c !== 0) {\n      o[19] = c;\n      out.length++;\n    }\n    return out;\n  };\n\n  // Polyfill comb\n  if (!Math.imul) {\n    comb10MulTo = smallMulTo;\n  }\n\n  function bigMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    out.length = self.length + num.length;\n\n    var carry = 0;\n    var hncarry = 0;\n    for (var k = 0; k < out.length - 1; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = hncarry;\n      hncarry = 0;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = k - j;\n        var a = self.words[i] | 0;\n        var b = num.words[j] | 0;\n        var r = a * b;\n\n        var lo = r & 0x3ffffff;\n        ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n        lo = (lo + rword) | 0;\n        rword = lo & 0x3ffffff;\n        ncarry = (ncarry + (lo >>> 26)) | 0;\n\n        hncarry += ncarry >>> 26;\n        ncarry &= 0x3ffffff;\n      }\n      out.words[k] = rword;\n      carry = ncarry;\n      ncarry = hncarry;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry;\n    } else {\n      out.length--;\n    }\n\n    return out.strip();\n  }\n\n  function jumboMulTo (self, num, out) {\n    var fftm = new FFTM();\n    return fftm.mulp(self, num, out);\n  }\n\n  BN.prototype.mulTo = function mulTo (num, out) {\n    var res;\n    var len = this.length + num.length;\n    if (this.length === 10 && num.length === 10) {\n      res = comb10MulTo(this, num, out);\n    } else if (len < 63) {\n      res = smallMulTo(this, num, out);\n    } else if (len < 1024) {\n      res = bigMulTo(this, num, out);\n    } else {\n      res = jumboMulTo(this, num, out);\n    }\n\n    return res;\n  };\n\n  // Cooley-Tukey algorithm for FFT\n  // slightly revisited to rely on looping instead of recursion\n\n  function FFTM (x, y) {\n    this.x = x;\n    this.y = y;\n  }\n\n  FFTM.prototype.makeRBT = function makeRBT (N) {\n    var t = new Array(N);\n    var l = BN.prototype._countBits(N) - 1;\n    for (var i = 0; i < N; i++) {\n      t[i] = this.revBin(i, l, N);\n    }\n\n    return t;\n  };\n\n  // Returns binary-reversed representation of `x`\n  FFTM.prototype.revBin = function revBin (x, l, N) {\n    if (x === 0 || x === N - 1) return x;\n\n    var rb = 0;\n    for (var i = 0; i < l; i++) {\n      rb |= (x & 1) << (l - i - 1);\n      x >>= 1;\n    }\n\n    return rb;\n  };\n\n  // Performs \"tweedling\" phase, therefore 'emulating'\n  // behaviour of the recursive algorithm\n  FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n    for (var i = 0; i < N; i++) {\n      rtws[i] = rws[rbt[i]];\n      itws[i] = iws[rbt[i]];\n    }\n  };\n\n  FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n    this.permute(rbt, rws, iws, rtws, itws, N);\n\n    for (var s = 1; s < N; s <<= 1) {\n      var l = s << 1;\n\n      var rtwdf = Math.cos(2 * Math.PI / l);\n      var itwdf = Math.sin(2 * Math.PI / l);\n\n      for (var p = 0; p < N; p += l) {\n        var rtwdf_ = rtwdf;\n        var itwdf_ = itwdf;\n\n        for (var j = 0; j < s; j++) {\n          var re = rtws[p + j];\n          var ie = itws[p + j];\n\n          var ro = rtws[p + j + s];\n          var io = itws[p + j + s];\n\n          var rx = rtwdf_ * ro - itwdf_ * io;\n\n          io = rtwdf_ * io + itwdf_ * ro;\n          ro = rx;\n\n          rtws[p + j] = re + ro;\n          itws[p + j] = ie + io;\n\n          rtws[p + j + s] = re - ro;\n          itws[p + j + s] = ie - io;\n\n          /* jshint maxdepth : false */\n          if (j !== l) {\n            rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n            itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n            rtwdf_ = rx;\n          }\n        }\n      }\n    }\n  };\n\n  FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n    var N = Math.max(m, n) | 1;\n    var odd = N & 1;\n    var i = 0;\n    for (N = N / 2 | 0; N; N = N >>> 1) {\n      i++;\n    }\n\n    return 1 << i + 1 + odd;\n  };\n\n  FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n    if (N <= 1) return;\n\n    for (var i = 0; i < N / 2; i++) {\n      var t = rws[i];\n\n      rws[i] = rws[N - i - 1];\n      rws[N - i - 1] = t;\n\n      t = iws[i];\n\n      iws[i] = -iws[N - i - 1];\n      iws[N - i - 1] = -t;\n    }\n  };\n\n  FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n    var carry = 0;\n    for (var i = 0; i < N / 2; i++) {\n      var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n        Math.round(ws[2 * i] / N) +\n        carry;\n\n      ws[i] = w & 0x3ffffff;\n\n      if (w < 0x4000000) {\n        carry = 0;\n      } else {\n        carry = w / 0x4000000 | 0;\n      }\n    }\n\n    return ws;\n  };\n\n  FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n    var carry = 0;\n    for (var i = 0; i < len; i++) {\n      carry = carry + (ws[i] | 0);\n\n      rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n      rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n    }\n\n    // Pad with zeroes\n    for (i = 2 * len; i < N; ++i) {\n      rws[i] = 0;\n    }\n\n    assert(carry === 0);\n    assert((carry & ~0x1fff) === 0);\n  };\n\n  FFTM.prototype.stub = function stub (N) {\n    var ph = new Array(N);\n    for (var i = 0; i < N; i++) {\n      ph[i] = 0;\n    }\n\n    return ph;\n  };\n\n  FFTM.prototype.mulp = function mulp (x, y, out) {\n    var N = 2 * this.guessLen13b(x.length, y.length);\n\n    var rbt = this.makeRBT(N);\n\n    var _ = this.stub(N);\n\n    var rws = new Array(N);\n    var rwst = new Array(N);\n    var iwst = new Array(N);\n\n    var nrws = new Array(N);\n    var nrwst = new Array(N);\n    var niwst = new Array(N);\n\n    var rmws = out.words;\n    rmws.length = N;\n\n    this.convert13b(x.words, x.length, rws, N);\n    this.convert13b(y.words, y.length, nrws, N);\n\n    this.transform(rws, _, rwst, iwst, N, rbt);\n    this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n    for (var i = 0; i < N; i++) {\n      var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n      iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n      rwst[i] = rx;\n    }\n\n    this.conjugate(rwst, iwst, N);\n    this.transform(rwst, iwst, rmws, _, N, rbt);\n    this.conjugate(rmws, _, N);\n    this.normalize13b(rmws, N);\n\n    out.negative = x.negative ^ y.negative;\n    out.length = x.length + y.length;\n    return out.strip();\n  };\n\n  // Multiply `this` by `num`\n  BN.prototype.mul = function mul (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return this.mulTo(num, out);\n  };\n\n  // Multiply employing FFT\n  BN.prototype.mulf = function mulf (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return jumboMulTo(this, num, out);\n  };\n\n  // In-place Multiplication\n  BN.prototype.imul = function imul (num) {\n    return this.clone().mulTo(num, this);\n  };\n\n  BN.prototype.imuln = function imuln (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n\n    // Carry\n    var carry = 0;\n    for (var i = 0; i < this.length; i++) {\n      var w = (this.words[i] | 0) * num;\n      var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n      carry >>= 26;\n      carry += (w / 0x4000000) | 0;\n      // NOTE: lo is 27bit maximum\n      carry += lo >>> 26;\n      this.words[i] = lo & 0x3ffffff;\n    }\n\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n\n    return this;\n  };\n\n  BN.prototype.muln = function muln (num) {\n    return this.clone().imuln(num);\n  };\n\n  // `this` * `this`\n  BN.prototype.sqr = function sqr () {\n    return this.mul(this);\n  };\n\n  // `this` * `this` in-place\n  BN.prototype.isqr = function isqr () {\n    return this.imul(this.clone());\n  };\n\n  // Math.pow(`this`, `num`)\n  BN.prototype.pow = function pow (num) {\n    var w = toBitArray(num);\n    if (w.length === 0) return new BN(1);\n\n    // Skip leading zeroes\n    var res = this;\n    for (var i = 0; i < w.length; i++, res = res.sqr()) {\n      if (w[i] !== 0) break;\n    }\n\n    if (++i < w.length) {\n      for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n        if (w[i] === 0) continue;\n\n        res = res.mul(q);\n      }\n    }\n\n    return res;\n  };\n\n  // Shift-left in-place\n  BN.prototype.iushln = function iushln (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n    var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n    var i;\n\n    if (r !== 0) {\n      var carry = 0;\n\n      for (i = 0; i < this.length; i++) {\n        var newCarry = this.words[i] & carryMask;\n        var c = ((this.words[i] | 0) - newCarry) << r;\n        this.words[i] = c | carry;\n        carry = newCarry >>> (26 - r);\n      }\n\n      if (carry) {\n        this.words[i] = carry;\n        this.length++;\n      }\n    }\n\n    if (s !== 0) {\n      for (i = this.length - 1; i >= 0; i--) {\n        this.words[i + s] = this.words[i];\n      }\n\n      for (i = 0; i < s; i++) {\n        this.words[i] = 0;\n      }\n\n      this.length += s;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ishln = function ishln (bits) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushln(bits);\n  };\n\n  // Shift-right in-place\n  // NOTE: `hint` is a lowest bit before trailing zeroes\n  // NOTE: if `extended` is present - it will be filled with destroyed bits\n  BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var h;\n    if (hint) {\n      h = (hint - (hint % 26)) / 26;\n    } else {\n      h = 0;\n    }\n\n    var r = bits % 26;\n    var s = Math.min((bits - r) / 26, this.length);\n    var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n    var maskedWords = extended;\n\n    h -= s;\n    h = Math.max(0, h);\n\n    // Extended mode, copy masked part\n    if (maskedWords) {\n      for (var i = 0; i < s; i++) {\n        maskedWords.words[i] = this.words[i];\n      }\n      maskedWords.length = s;\n    }\n\n    if (s === 0) {\n      // No-op, we should not move anything at all\n    } else if (this.length > s) {\n      this.length -= s;\n      for (i = 0; i < this.length; i++) {\n        this.words[i] = this.words[i + s];\n      }\n    } else {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    var carry = 0;\n    for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n      var word = this.words[i] | 0;\n      this.words[i] = (carry << (26 - r)) | (word >>> r);\n      carry = word & mask;\n    }\n\n    // Push carried bits as a mask\n    if (maskedWords && carry !== 0) {\n      maskedWords.words[maskedWords.length++] = carry;\n    }\n\n    if (this.length === 0) {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushrn(bits, hint, extended);\n  };\n\n  // Shift-left\n  BN.prototype.shln = function shln (bits) {\n    return this.clone().ishln(bits);\n  };\n\n  BN.prototype.ushln = function ushln (bits) {\n    return this.clone().iushln(bits);\n  };\n\n  // Shift-right\n  BN.prototype.shrn = function shrn (bits) {\n    return this.clone().ishrn(bits);\n  };\n\n  BN.prototype.ushrn = function ushrn (bits) {\n    return this.clone().iushrn(bits);\n  };\n\n  // Test if n bit is set\n  BN.prototype.testn = function testn (bit) {\n    assert(typeof bit === 'number' && bit >= 0);\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) return false;\n\n    // Check bit and return\n    var w = this.words[s];\n\n    return !!(w & q);\n  };\n\n  // Return only lowers bits of number (in-place)\n  BN.prototype.imaskn = function imaskn (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n\n    assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n    if (this.length <= s) {\n      return this;\n    }\n\n    if (r !== 0) {\n      s++;\n    }\n    this.length = Math.min(s, this.length);\n\n    if (r !== 0) {\n      var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n      this.words[this.length - 1] &= mask;\n    }\n\n    return this.strip();\n  };\n\n  // Return only lowers bits of number\n  BN.prototype.maskn = function maskn (bits) {\n    return this.clone().imaskn(bits);\n  };\n\n  // Add plain number `num` to `this`\n  BN.prototype.iaddn = function iaddn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.isubn(-num);\n\n    // Possible sign change\n    if (this.negative !== 0) {\n      if (this.length === 1 && (this.words[0] | 0) < num) {\n        this.words[0] = num - (this.words[0] | 0);\n        this.negative = 0;\n        return this;\n      }\n\n      this.negative = 0;\n      this.isubn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    // Add without checks\n    return this._iaddn(num);\n  };\n\n  BN.prototype._iaddn = function _iaddn (num) {\n    this.words[0] += num;\n\n    // Carry\n    for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n      this.words[i] -= 0x4000000;\n      if (i === this.length - 1) {\n        this.words[i + 1] = 1;\n      } else {\n        this.words[i + 1]++;\n      }\n    }\n    this.length = Math.max(this.length, i + 1);\n\n    return this;\n  };\n\n  // Subtract plain number `num` from `this`\n  BN.prototype.isubn = function isubn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.iaddn(-num);\n\n    if (this.negative !== 0) {\n      this.negative = 0;\n      this.iaddn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    this.words[0] -= num;\n\n    if (this.length === 1 && this.words[0] < 0) {\n      this.words[0] = -this.words[0];\n      this.negative = 1;\n    } else {\n      // Carry\n      for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n        this.words[i] += 0x4000000;\n        this.words[i + 1] -= 1;\n      }\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.addn = function addn (num) {\n    return this.clone().iaddn(num);\n  };\n\n  BN.prototype.subn = function subn (num) {\n    return this.clone().isubn(num);\n  };\n\n  BN.prototype.iabs = function iabs () {\n    this.negative = 0;\n\n    return this;\n  };\n\n  BN.prototype.abs = function abs () {\n    return this.clone().iabs();\n  };\n\n  BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n    var len = num.length + shift;\n    var i;\n\n    this._expand(len);\n\n    var w;\n    var carry = 0;\n    for (i = 0; i < num.length; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      var right = (num.words[i] | 0) * mul;\n      w -= right & 0x3ffffff;\n      carry = (w >> 26) - ((right / 0x4000000) | 0);\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n    for (; i < this.length - shift; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      carry = w >> 26;\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n\n    if (carry === 0) return this.strip();\n\n    // Subtraction overflow\n    assert(carry === -1);\n    carry = 0;\n    for (i = 0; i < this.length; i++) {\n      w = -(this.words[i] | 0) + carry;\n      carry = w >> 26;\n      this.words[i] = w & 0x3ffffff;\n    }\n    this.negative = 1;\n\n    return this.strip();\n  };\n\n  BN.prototype._wordDiv = function _wordDiv (num, mode) {\n    var shift = this.length - num.length;\n\n    var a = this.clone();\n    var b = num;\n\n    // Normalize\n    var bhi = b.words[b.length - 1] | 0;\n    var bhiBits = this._countBits(bhi);\n    shift = 26 - bhiBits;\n    if (shift !== 0) {\n      b = b.ushln(shift);\n      a.iushln(shift);\n      bhi = b.words[b.length - 1] | 0;\n    }\n\n    // Initialize quotient\n    var m = a.length - b.length;\n    var q;\n\n    if (mode !== 'mod') {\n      q = new BN(null);\n      q.length = m + 1;\n      q.words = new Array(q.length);\n      for (var i = 0; i < q.length; i++) {\n        q.words[i] = 0;\n      }\n    }\n\n    var diff = a.clone()._ishlnsubmul(b, 1, m);\n    if (diff.negative === 0) {\n      a = diff;\n      if (q) {\n        q.words[m] = 1;\n      }\n    }\n\n    for (var j = m - 1; j >= 0; j--) {\n      var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n        (a.words[b.length + j - 1] | 0);\n\n      // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n      // (0x7ffffff)\n      qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n      a._ishlnsubmul(b, qj, j);\n      while (a.negative !== 0) {\n        qj--;\n        a.negative = 0;\n        a._ishlnsubmul(b, 1, j);\n        if (!a.isZero()) {\n          a.negative ^= 1;\n        }\n      }\n      if (q) {\n        q.words[j] = qj;\n      }\n    }\n    if (q) {\n      q.strip();\n    }\n    a.strip();\n\n    // Denormalize\n    if (mode !== 'div' && shift !== 0) {\n      a.iushrn(shift);\n    }\n\n    return {\n      div: q || null,\n      mod: a\n    };\n  };\n\n  // NOTE: 1) `mode` can be set to `mod` to request mod only,\n  //       to `div` to request div only, or be absent to\n  //       request both div & mod\n  //       2) `positive` is true if unsigned mod is requested\n  BN.prototype.divmod = function divmod (num, mode, positive) {\n    assert(!num.isZero());\n\n    if (this.isZero()) {\n      return {\n        div: new BN(0),\n        mod: new BN(0)\n      };\n    }\n\n    var div, mod, res;\n    if (this.negative !== 0 && num.negative === 0) {\n      res = this.neg().divmod(num, mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.iadd(num);\n        }\n      }\n\n      return {\n        div: div,\n        mod: mod\n      };\n    }\n\n    if (this.negative === 0 && num.negative !== 0) {\n      res = this.divmod(num.neg(), mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      return {\n        div: div,\n        mod: res.mod\n      };\n    }\n\n    if ((this.negative & num.negative) !== 0) {\n      res = this.neg().divmod(num.neg(), mode);\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.isub(num);\n        }\n      }\n\n      return {\n        div: res.div,\n        mod: mod\n      };\n    }\n\n    // Both numbers are positive at this point\n\n    // Strip both numbers to approximate shift value\n    if (num.length > this.length || this.cmp(num) < 0) {\n      return {\n        div: new BN(0),\n        mod: this\n      };\n    }\n\n    // Very short reduction\n    if (num.length === 1) {\n      if (mode === 'div') {\n        return {\n          div: this.divn(num.words[0]),\n          mod: null\n        };\n      }\n\n      if (mode === 'mod') {\n        return {\n          div: null,\n          mod: new BN(this.modn(num.words[0]))\n        };\n      }\n\n      return {\n        div: this.divn(num.words[0]),\n        mod: new BN(this.modn(num.words[0]))\n      };\n    }\n\n    return this._wordDiv(num, mode);\n  };\n\n  // Find `this` / `num`\n  BN.prototype.div = function div (num) {\n    return this.divmod(num, 'div', false).div;\n  };\n\n  // Find `this` % `num`\n  BN.prototype.mod = function mod (num) {\n    return this.divmod(num, 'mod', false).mod;\n  };\n\n  BN.prototype.umod = function umod (num) {\n    return this.divmod(num, 'mod', true).mod;\n  };\n\n  // Find Round(`this` / `num`)\n  BN.prototype.divRound = function divRound (num) {\n    var dm = this.divmod(num);\n\n    // Fast case - exact division\n    if (dm.mod.isZero()) return dm.div;\n\n    var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n    var half = num.ushrn(1);\n    var r2 = num.andln(1);\n    var cmp = mod.cmp(half);\n\n    // Round down\n    if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n    // Round up\n    return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n  };\n\n  BN.prototype.modn = function modn (num) {\n    assert(num <= 0x3ffffff);\n    var p = (1 << 26) % num;\n\n    var acc = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      acc = (p * acc + (this.words[i] | 0)) % num;\n    }\n\n    return acc;\n  };\n\n  // In-place division by number\n  BN.prototype.idivn = function idivn (num) {\n    assert(num <= 0x3ffffff);\n\n    var carry = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var w = (this.words[i] | 0) + carry * 0x4000000;\n      this.words[i] = (w / num) | 0;\n      carry = w % num;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.divn = function divn (num) {\n    return this.clone().idivn(num);\n  };\n\n  BN.prototype.egcd = function egcd (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var x = this;\n    var y = p.clone();\n\n    if (x.negative !== 0) {\n      x = x.umod(p);\n    } else {\n      x = x.clone();\n    }\n\n    // A * x + B * y = x\n    var A = new BN(1);\n    var B = new BN(0);\n\n    // C * x + D * y = y\n    var C = new BN(0);\n    var D = new BN(1);\n\n    var g = 0;\n\n    while (x.isEven() && y.isEven()) {\n      x.iushrn(1);\n      y.iushrn(1);\n      ++g;\n    }\n\n    var yp = y.clone();\n    var xp = x.clone();\n\n    while (!x.isZero()) {\n      for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        x.iushrn(i);\n        while (i-- > 0) {\n          if (A.isOdd() || B.isOdd()) {\n            A.iadd(yp);\n            B.isub(xp);\n          }\n\n          A.iushrn(1);\n          B.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        y.iushrn(j);\n        while (j-- > 0) {\n          if (C.isOdd() || D.isOdd()) {\n            C.iadd(yp);\n            D.isub(xp);\n          }\n\n          C.iushrn(1);\n          D.iushrn(1);\n        }\n      }\n\n      if (x.cmp(y) >= 0) {\n        x.isub(y);\n        A.isub(C);\n        B.isub(D);\n      } else {\n        y.isub(x);\n        C.isub(A);\n        D.isub(B);\n      }\n    }\n\n    return {\n      a: C,\n      b: D,\n      gcd: y.iushln(g)\n    };\n  };\n\n  // This is reduced incarnation of the binary EEA\n  // above, designated to invert members of the\n  // _prime_ fields F(p) at a maximal speed\n  BN.prototype._invmp = function _invmp (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var a = this;\n    var b = p.clone();\n\n    if (a.negative !== 0) {\n      a = a.umod(p);\n    } else {\n      a = a.clone();\n    }\n\n    var x1 = new BN(1);\n    var x2 = new BN(0);\n\n    var delta = b.clone();\n\n    while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n      for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        a.iushrn(i);\n        while (i-- > 0) {\n          if (x1.isOdd()) {\n            x1.iadd(delta);\n          }\n\n          x1.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        b.iushrn(j);\n        while (j-- > 0) {\n          if (x2.isOdd()) {\n            x2.iadd(delta);\n          }\n\n          x2.iushrn(1);\n        }\n      }\n\n      if (a.cmp(b) >= 0) {\n        a.isub(b);\n        x1.isub(x2);\n      } else {\n        b.isub(a);\n        x2.isub(x1);\n      }\n    }\n\n    var res;\n    if (a.cmpn(1) === 0) {\n      res = x1;\n    } else {\n      res = x2;\n    }\n\n    if (res.cmpn(0) < 0) {\n      res.iadd(p);\n    }\n\n    return res;\n  };\n\n  BN.prototype.gcd = function gcd (num) {\n    if (this.isZero()) return num.abs();\n    if (num.isZero()) return this.abs();\n\n    var a = this.clone();\n    var b = num.clone();\n    a.negative = 0;\n    b.negative = 0;\n\n    // Remove common factor of two\n    for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n      a.iushrn(1);\n      b.iushrn(1);\n    }\n\n    do {\n      while (a.isEven()) {\n        a.iushrn(1);\n      }\n      while (b.isEven()) {\n        b.iushrn(1);\n      }\n\n      var r = a.cmp(b);\n      if (r < 0) {\n        // Swap `a` and `b` to make `a` always bigger than `b`\n        var t = a;\n        a = b;\n        b = t;\n      } else if (r === 0 || b.cmpn(1) === 0) {\n        break;\n      }\n\n      a.isub(b);\n    } while (true);\n\n    return b.iushln(shift);\n  };\n\n  // Invert number in the field F(num)\n  BN.prototype.invm = function invm (num) {\n    return this.egcd(num).a.umod(num);\n  };\n\n  BN.prototype.isEven = function isEven () {\n    return (this.words[0] & 1) === 0;\n  };\n\n  BN.prototype.isOdd = function isOdd () {\n    return (this.words[0] & 1) === 1;\n  };\n\n  // And first word and num\n  BN.prototype.andln = function andln (num) {\n    return this.words[0] & num;\n  };\n\n  // Increment at the bit position in-line\n  BN.prototype.bincn = function bincn (bit) {\n    assert(typeof bit === 'number');\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) {\n      this._expand(s + 1);\n      this.words[s] |= q;\n      return this;\n    }\n\n    // Add bit and propagate, if needed\n    var carry = q;\n    for (var i = s; carry !== 0 && i < this.length; i++) {\n      var w = this.words[i] | 0;\n      w += carry;\n      carry = w >>> 26;\n      w &= 0x3ffffff;\n      this.words[i] = w;\n    }\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n    return this;\n  };\n\n  BN.prototype.isZero = function isZero () {\n    return this.length === 1 && this.words[0] === 0;\n  };\n\n  BN.prototype.cmpn = function cmpn (num) {\n    var negative = num < 0;\n\n    if (this.negative !== 0 && !negative) return -1;\n    if (this.negative === 0 && negative) return 1;\n\n    this.strip();\n\n    var res;\n    if (this.length > 1) {\n      res = 1;\n    } else {\n      if (negative) {\n        num = -num;\n      }\n\n      assert(num <= 0x3ffffff, 'Number is too big');\n\n      var w = this.words[0] | 0;\n      res = w === num ? 0 : w < num ? -1 : 1;\n    }\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Compare two numbers and return:\n  // 1 - if `this` > `num`\n  // 0 - if `this` == `num`\n  // -1 - if `this` < `num`\n  BN.prototype.cmp = function cmp (num) {\n    if (this.negative !== 0 && num.negative === 0) return -1;\n    if (this.negative === 0 && num.negative !== 0) return 1;\n\n    var res = this.ucmp(num);\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Unsigned comparison\n  BN.prototype.ucmp = function ucmp (num) {\n    // At this point both numbers have the same sign\n    if (this.length > num.length) return 1;\n    if (this.length < num.length) return -1;\n\n    var res = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var a = this.words[i] | 0;\n      var b = num.words[i] | 0;\n\n      if (a === b) continue;\n      if (a < b) {\n        res = -1;\n      } else if (a > b) {\n        res = 1;\n      }\n      break;\n    }\n    return res;\n  };\n\n  BN.prototype.gtn = function gtn (num) {\n    return this.cmpn(num) === 1;\n  };\n\n  BN.prototype.gt = function gt (num) {\n    return this.cmp(num) === 1;\n  };\n\n  BN.prototype.gten = function gten (num) {\n    return this.cmpn(num) >= 0;\n  };\n\n  BN.prototype.gte = function gte (num) {\n    return this.cmp(num) >= 0;\n  };\n\n  BN.prototype.ltn = function ltn (num) {\n    return this.cmpn(num) === -1;\n  };\n\n  BN.prototype.lt = function lt (num) {\n    return this.cmp(num) === -1;\n  };\n\n  BN.prototype.lten = function lten (num) {\n    return this.cmpn(num) <= 0;\n  };\n\n  BN.prototype.lte = function lte (num) {\n    return this.cmp(num) <= 0;\n  };\n\n  BN.prototype.eqn = function eqn (num) {\n    return this.cmpn(num) === 0;\n  };\n\n  BN.prototype.eq = function eq (num) {\n    return this.cmp(num) === 0;\n  };\n\n  //\n  // A reduce context, could be using montgomery or something better, depending\n  // on the `m` itself.\n  //\n  BN.red = function red (num) {\n    return new Red(num);\n  };\n\n  BN.prototype.toRed = function toRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    assert(this.negative === 0, 'red works only with positives');\n    return ctx.convertTo(this)._forceRed(ctx);\n  };\n\n  BN.prototype.fromRed = function fromRed () {\n    assert(this.red, 'fromRed works only with numbers in reduction context');\n    return this.red.convertFrom(this);\n  };\n\n  BN.prototype._forceRed = function _forceRed (ctx) {\n    this.red = ctx;\n    return this;\n  };\n\n  BN.prototype.forceRed = function forceRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    return this._forceRed(ctx);\n  };\n\n  BN.prototype.redAdd = function redAdd (num) {\n    assert(this.red, 'redAdd works only with red numbers');\n    return this.red.add(this, num);\n  };\n\n  BN.prototype.redIAdd = function redIAdd (num) {\n    assert(this.red, 'redIAdd works only with red numbers');\n    return this.red.iadd(this, num);\n  };\n\n  BN.prototype.redSub = function redSub (num) {\n    assert(this.red, 'redSub works only with red numbers');\n    return this.red.sub(this, num);\n  };\n\n  BN.prototype.redISub = function redISub (num) {\n    assert(this.red, 'redISub works only with red numbers');\n    return this.red.isub(this, num);\n  };\n\n  BN.prototype.redShl = function redShl (num) {\n    assert(this.red, 'redShl works only with red numbers');\n    return this.red.shl(this, num);\n  };\n\n  BN.prototype.redMul = function redMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.mul(this, num);\n  };\n\n  BN.prototype.redIMul = function redIMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.imul(this, num);\n  };\n\n  BN.prototype.redSqr = function redSqr () {\n    assert(this.red, 'redSqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqr(this);\n  };\n\n  BN.prototype.redISqr = function redISqr () {\n    assert(this.red, 'redISqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.isqr(this);\n  };\n\n  // Square root over p\n  BN.prototype.redSqrt = function redSqrt () {\n    assert(this.red, 'redSqrt works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqrt(this);\n  };\n\n  BN.prototype.redInvm = function redInvm () {\n    assert(this.red, 'redInvm works only with red numbers');\n    this.red._verify1(this);\n    return this.red.invm(this);\n  };\n\n  // Return negative clone of `this` % `red modulo`\n  BN.prototype.redNeg = function redNeg () {\n    assert(this.red, 'redNeg works only with red numbers');\n    this.red._verify1(this);\n    return this.red.neg(this);\n  };\n\n  BN.prototype.redPow = function redPow (num) {\n    assert(this.red && !num.red, 'redPow(normalNum)');\n    this.red._verify1(this);\n    return this.red.pow(this, num);\n  };\n\n  // Prime numbers with efficient reduction\n  var primes = {\n    k256: null,\n    p224: null,\n    p192: null,\n    p25519: null\n  };\n\n  // Pseudo-Mersenne prime\n  function MPrime (name, p) {\n    // P = 2 ^ N - K\n    this.name = name;\n    this.p = new BN(p, 16);\n    this.n = this.p.bitLength();\n    this.k = new BN(1).iushln(this.n).isub(this.p);\n\n    this.tmp = this._tmp();\n  }\n\n  MPrime.prototype._tmp = function _tmp () {\n    var tmp = new BN(null);\n    tmp.words = new Array(Math.ceil(this.n / 13));\n    return tmp;\n  };\n\n  MPrime.prototype.ireduce = function ireduce (num) {\n    // Assumes that `num` is less than `P^2`\n    // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n    var r = num;\n    var rlen;\n\n    do {\n      this.split(r, this.tmp);\n      r = this.imulK(r);\n      r = r.iadd(this.tmp);\n      rlen = r.bitLength();\n    } while (rlen > this.n);\n\n    var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n    if (cmp === 0) {\n      r.words[0] = 0;\n      r.length = 1;\n    } else if (cmp > 0) {\n      r.isub(this.p);\n    } else {\n      if (r.strip !== undefined) {\n        // r is BN v4 instance\n        r.strip();\n      } else {\n        // r is BN v5 instance\n        r._strip();\n      }\n    }\n\n    return r;\n  };\n\n  MPrime.prototype.split = function split (input, out) {\n    input.iushrn(this.n, 0, out);\n  };\n\n  MPrime.prototype.imulK = function imulK (num) {\n    return num.imul(this.k);\n  };\n\n  function K256 () {\n    MPrime.call(\n      this,\n      'k256',\n      'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n  }\n  inherits(K256, MPrime);\n\n  K256.prototype.split = function split (input, output) {\n    // 256 = 9 * 26 + 22\n    var mask = 0x3fffff;\n\n    var outLen = Math.min(input.length, 9);\n    for (var i = 0; i < outLen; i++) {\n      output.words[i] = input.words[i];\n    }\n    output.length = outLen;\n\n    if (input.length <= 9) {\n      input.words[0] = 0;\n      input.length = 1;\n      return;\n    }\n\n    // Shift by 9 limbs\n    var prev = input.words[9];\n    output.words[output.length++] = prev & mask;\n\n    for (i = 10; i < input.length; i++) {\n      var next = input.words[i] | 0;\n      input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n      prev = next;\n    }\n    prev >>>= 22;\n    input.words[i - 10] = prev;\n    if (prev === 0 && input.length > 10) {\n      input.length -= 10;\n    } else {\n      input.length -= 9;\n    }\n  };\n\n  K256.prototype.imulK = function imulK (num) {\n    // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n    num.words[num.length] = 0;\n    num.words[num.length + 1] = 0;\n    num.length += 2;\n\n    // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n    var lo = 0;\n    for (var i = 0; i < num.length; i++) {\n      var w = num.words[i] | 0;\n      lo += w * 0x3d1;\n      num.words[i] = lo & 0x3ffffff;\n      lo = w * 0x40 + ((lo / 0x4000000) | 0);\n    }\n\n    // Fast length reduction\n    if (num.words[num.length - 1] === 0) {\n      num.length--;\n      if (num.words[num.length - 1] === 0) {\n        num.length--;\n      }\n    }\n    return num;\n  };\n\n  function P224 () {\n    MPrime.call(\n      this,\n      'p224',\n      'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n  }\n  inherits(P224, MPrime);\n\n  function P192 () {\n    MPrime.call(\n      this,\n      'p192',\n      'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n  }\n  inherits(P192, MPrime);\n\n  function P25519 () {\n    // 2 ^ 255 - 19\n    MPrime.call(\n      this,\n      '25519',\n      '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n  }\n  inherits(P25519, MPrime);\n\n  P25519.prototype.imulK = function imulK (num) {\n    // K = 0x13\n    var carry = 0;\n    for (var i = 0; i < num.length; i++) {\n      var hi = (num.words[i] | 0) * 0x13 + carry;\n      var lo = hi & 0x3ffffff;\n      hi >>>= 26;\n\n      num.words[i] = lo;\n      carry = hi;\n    }\n    if (carry !== 0) {\n      num.words[num.length++] = carry;\n    }\n    return num;\n  };\n\n  // Exported mostly for testing purposes, use plain name instead\n  BN._prime = function prime (name) {\n    // Cached version of prime\n    if (primes[name]) return primes[name];\n\n    var prime;\n    if (name === 'k256') {\n      prime = new K256();\n    } else if (name === 'p224') {\n      prime = new P224();\n    } else if (name === 'p192') {\n      prime = new P192();\n    } else if (name === 'p25519') {\n      prime = new P25519();\n    } else {\n      throw new Error('Unknown prime ' + name);\n    }\n    primes[name] = prime;\n\n    return prime;\n  };\n\n  //\n  // Base reduction engine\n  //\n  function Red (m) {\n    if (typeof m === 'string') {\n      var prime = BN._prime(m);\n      this.m = prime.p;\n      this.prime = prime;\n    } else {\n      assert(m.gtn(1), 'modulus must be greater than 1');\n      this.m = m;\n      this.prime = null;\n    }\n  }\n\n  Red.prototype._verify1 = function _verify1 (a) {\n    assert(a.negative === 0, 'red works only with positives');\n    assert(a.red, 'red works only with red numbers');\n  };\n\n  Red.prototype._verify2 = function _verify2 (a, b) {\n    assert((a.negative | b.negative) === 0, 'red works only with positives');\n    assert(a.red && a.red === b.red,\n      'red works only with red numbers');\n  };\n\n  Red.prototype.imod = function imod (a) {\n    if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n    return a.umod(this.m)._forceRed(this);\n  };\n\n  Red.prototype.neg = function neg (a) {\n    if (a.isZero()) {\n      return a.clone();\n    }\n\n    return this.m.sub(a)._forceRed(this);\n  };\n\n  Red.prototype.add = function add (a, b) {\n    this._verify2(a, b);\n\n    var res = a.add(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.iadd = function iadd (a, b) {\n    this._verify2(a, b);\n\n    var res = a.iadd(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.sub = function sub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.sub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.isub = function isub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.isub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.shl = function shl (a, num) {\n    this._verify1(a);\n    return this.imod(a.ushln(num));\n  };\n\n  Red.prototype.imul = function imul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.imul(b));\n  };\n\n  Red.prototype.mul = function mul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.mul(b));\n  };\n\n  Red.prototype.isqr = function isqr (a) {\n    return this.imul(a, a.clone());\n  };\n\n  Red.prototype.sqr = function sqr (a) {\n    return this.mul(a, a);\n  };\n\n  Red.prototype.sqrt = function sqrt (a) {\n    if (a.isZero()) return a.clone();\n\n    var mod3 = this.m.andln(3);\n    assert(mod3 % 2 === 1);\n\n    // Fast case\n    if (mod3 === 3) {\n      var pow = this.m.add(new BN(1)).iushrn(2);\n      return this.pow(a, pow);\n    }\n\n    // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n    //\n    // Find Q and S, that Q * 2 ^ S = (P - 1)\n    var q = this.m.subn(1);\n    var s = 0;\n    while (!q.isZero() && q.andln(1) === 0) {\n      s++;\n      q.iushrn(1);\n    }\n    assert(!q.isZero());\n\n    var one = new BN(1).toRed(this);\n    var nOne = one.redNeg();\n\n    // Find quadratic non-residue\n    // NOTE: Max is such because of generalized Riemann hypothesis.\n    var lpow = this.m.subn(1).iushrn(1);\n    var z = this.m.bitLength();\n    z = new BN(2 * z * z).toRed(this);\n\n    while (this.pow(z, lpow).cmp(nOne) !== 0) {\n      z.redIAdd(nOne);\n    }\n\n    var c = this.pow(z, q);\n    var r = this.pow(a, q.addn(1).iushrn(1));\n    var t = this.pow(a, q);\n    var m = s;\n    while (t.cmp(one) !== 0) {\n      var tmp = t;\n      for (var i = 0; tmp.cmp(one) !== 0; i++) {\n        tmp = tmp.redSqr();\n      }\n      assert(i < m);\n      var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n      r = r.redMul(b);\n      c = b.redSqr();\n      t = t.redMul(c);\n      m = i;\n    }\n\n    return r;\n  };\n\n  Red.prototype.invm = function invm (a) {\n    var inv = a._invmp(this.m);\n    if (inv.negative !== 0) {\n      inv.negative = 0;\n      return this.imod(inv).redNeg();\n    } else {\n      return this.imod(inv);\n    }\n  };\n\n  Red.prototype.pow = function pow (a, num) {\n    if (num.isZero()) return new BN(1).toRed(this);\n    if (num.cmpn(1) === 0) return a.clone();\n\n    var windowSize = 4;\n    var wnd = new Array(1 << windowSize);\n    wnd[0] = new BN(1).toRed(this);\n    wnd[1] = a;\n    for (var i = 2; i < wnd.length; i++) {\n      wnd[i] = this.mul(wnd[i - 1], a);\n    }\n\n    var res = wnd[0];\n    var current = 0;\n    var currentLen = 0;\n    var start = num.bitLength() % 26;\n    if (start === 0) {\n      start = 26;\n    }\n\n    for (i = num.length - 1; i >= 0; i--) {\n      var word = num.words[i];\n      for (var j = start - 1; j >= 0; j--) {\n        var bit = (word >> j) & 1;\n        if (res !== wnd[0]) {\n          res = this.sqr(res);\n        }\n\n        if (bit === 0 && current === 0) {\n          currentLen = 0;\n          continue;\n        }\n\n        current <<= 1;\n        current |= bit;\n        currentLen++;\n        if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n        res = this.mul(res, wnd[current]);\n        currentLen = 0;\n        current = 0;\n      }\n      start = 26;\n    }\n\n    return res;\n  };\n\n  Red.prototype.convertTo = function convertTo (num) {\n    var r = num.umod(this.m);\n\n    return r === num ? r.clone() : r;\n  };\n\n  Red.prototype.convertFrom = function convertFrom (num) {\n    var res = num.clone();\n    res.red = null;\n    return res;\n  };\n\n  //\n  // Montgomery method engine\n  //\n\n  BN.mont = function mont (num) {\n    return new Mont(num);\n  };\n\n  function Mont (m) {\n    Red.call(this, m);\n\n    this.shift = this.m.bitLength();\n    if (this.shift % 26 !== 0) {\n      this.shift += 26 - (this.shift % 26);\n    }\n\n    this.r = new BN(1).iushln(this.shift);\n    this.r2 = this.imod(this.r.sqr());\n    this.rinv = this.r._invmp(this.m);\n\n    this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n    this.minv = this.minv.umod(this.r);\n    this.minv = this.r.sub(this.minv);\n  }\n  inherits(Mont, Red);\n\n  Mont.prototype.convertTo = function convertTo (num) {\n    return this.imod(num.ushln(this.shift));\n  };\n\n  Mont.prototype.convertFrom = function convertFrom (num) {\n    var r = this.imod(num.mul(this.rinv));\n    r.red = null;\n    return r;\n  };\n\n  Mont.prototype.imul = function imul (a, b) {\n    if (a.isZero() || b.isZero()) {\n      a.words[0] = 0;\n      a.length = 1;\n      return a;\n    }\n\n    var t = a.imul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.mul = function mul (a, b) {\n    if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n    var t = a.mul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.invm = function invm (a) {\n    // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n    var res = this.imod(a._invmp(this.m).mul(this.r2));\n    return res._forceRed(this);\n  };\n})(typeof module === 'undefined' || module, this);\n","var generatePrime = require('./lib/generatePrime')\nvar primes = require('./lib/primes.json')\n\nvar DH = require('./lib/dh')\n\nfunction getDiffieHellman (mod) {\n  var prime = new Buffer(primes[mod].prime, 'hex')\n  var gen = new Buffer(primes[mod].gen, 'hex')\n\n  return new DH(prime, gen)\n}\n\nvar ENCODINGS = {\n  'binary': true, 'hex': true, 'base64': true\n}\n\nfunction createDiffieHellman (prime, enc, generator, genc) {\n  if (Buffer.isBuffer(enc) || ENCODINGS[enc] === undefined) {\n    return createDiffieHellman(prime, 'binary', enc, generator)\n  }\n\n  enc = enc || 'binary'\n  genc = genc || 'binary'\n  generator = generator || new Buffer([2])\n\n  if (!Buffer.isBuffer(generator)) {\n    generator = new Buffer(generator, genc)\n  }\n\n  if (typeof prime === 'number') {\n    return new DH(generatePrime(prime, generator), generator, true)\n  }\n\n  if (!Buffer.isBuffer(prime)) {\n    prime = new Buffer(prime, enc)\n  }\n\n  return new DH(prime, generator, true)\n}\n\nexports.DiffieHellmanGroup = exports.createDiffieHellmanGroup = exports.getDiffieHellman = getDiffieHellman\nexports.createDiffieHellman = exports.DiffieHellman = createDiffieHellman\n","var BN = require('bn.js');\nvar MillerRabin = require('miller-rabin');\nvar millerRabin = new MillerRabin();\nvar TWENTYFOUR = new BN(24);\nvar ELEVEN = new BN(11);\nvar TEN = new BN(10);\nvar THREE = new BN(3);\nvar SEVEN = new BN(7);\nvar primes = require('./generatePrime');\nvar randomBytes = require('randombytes');\nmodule.exports = DH;\n\nfunction setPublicKey(pub, enc) {\n  enc = enc || 'utf8';\n  if (!Buffer.isBuffer(pub)) {\n    pub = new Buffer(pub, enc);\n  }\n  this._pub = new BN(pub);\n  return this;\n}\n\nfunction setPrivateKey(priv, enc) {\n  enc = enc || 'utf8';\n  if (!Buffer.isBuffer(priv)) {\n    priv = new Buffer(priv, enc);\n  }\n  this._priv = new BN(priv);\n  return this;\n}\n\nvar primeCache = {};\nfunction checkPrime(prime, generator) {\n  var gen = generator.toString('hex');\n  var hex = [gen, prime.toString(16)].join('_');\n  if (hex in primeCache) {\n    return primeCache[hex];\n  }\n  var error = 0;\n\n  if (prime.isEven() ||\n    !primes.simpleSieve ||\n    !primes.fermatTest(prime) ||\n    !millerRabin.test(prime)) {\n    //not a prime so +1\n    error += 1;\n\n    if (gen === '02' || gen === '05') {\n      // we'd be able to check the generator\n      // it would fail so +8\n      error += 8;\n    } else {\n      //we wouldn't be able to test the generator\n      // so +4\n      error += 4;\n    }\n    primeCache[hex] = error;\n    return error;\n  }\n  if (!millerRabin.test(prime.shrn(1))) {\n    //not a safe prime\n    error += 2;\n  }\n  var rem;\n  switch (gen) {\n    case '02':\n      if (prime.mod(TWENTYFOUR).cmp(ELEVEN)) {\n        // unsuidable generator\n        error += 8;\n      }\n      break;\n    case '05':\n      rem = prime.mod(TEN);\n      if (rem.cmp(THREE) && rem.cmp(SEVEN)) {\n        // prime mod 10 needs to equal 3 or 7\n        error += 8;\n      }\n      break;\n    default:\n      error += 4;\n  }\n  primeCache[hex] = error;\n  return error;\n}\n\nfunction DH(prime, generator, malleable) {\n  this.setGenerator(generator);\n  this.__prime = new BN(prime);\n  this._prime = BN.mont(this.__prime);\n  this._primeLen = prime.length;\n  this._pub = undefined;\n  this._priv = undefined;\n  this._primeCode = undefined;\n  if (malleable) {\n    this.setPublicKey = setPublicKey;\n    this.setPrivateKey = setPrivateKey;\n  } else {\n    this._primeCode = 8;\n  }\n}\nObject.defineProperty(DH.prototype, 'verifyError', {\n  enumerable: true,\n  get: function () {\n    if (typeof this._primeCode !== 'number') {\n      this._primeCode = checkPrime(this.__prime, this.__gen);\n    }\n    return this._primeCode;\n  }\n});\nDH.prototype.generateKeys = function () {\n  if (!this._priv) {\n    this._priv = new BN(randomBytes(this._primeLen));\n  }\n  this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed();\n  return this.getPublicKey();\n};\n\nDH.prototype.computeSecret = function (other) {\n  other = new BN(other);\n  other = other.toRed(this._prime);\n  var secret = other.redPow(this._priv).fromRed();\n  var out = new Buffer(secret.toArray());\n  var prime = this.getPrime();\n  if (out.length < prime.length) {\n    var front = new Buffer(prime.length - out.length);\n    front.fill(0);\n    out = Buffer.concat([front, out]);\n  }\n  return out;\n};\n\nDH.prototype.getPublicKey = function getPublicKey(enc) {\n  return formatReturnValue(this._pub, enc);\n};\n\nDH.prototype.getPrivateKey = function getPrivateKey(enc) {\n  return formatReturnValue(this._priv, enc);\n};\n\nDH.prototype.getPrime = function (enc) {\n  return formatReturnValue(this.__prime, enc);\n};\n\nDH.prototype.getGenerator = function (enc) {\n  return formatReturnValue(this._gen, enc);\n};\n\nDH.prototype.setGenerator = function (gen, enc) {\n  enc = enc || 'utf8';\n  if (!Buffer.isBuffer(gen)) {\n    gen = new Buffer(gen, enc);\n  }\n  this.__gen = gen;\n  this._gen = new BN(gen);\n  return this;\n};\n\nfunction formatReturnValue(bn, enc) {\n  var buf = new Buffer(bn.toArray());\n  if (!enc) {\n    return buf;\n  } else {\n    return buf.toString(enc);\n  }\n}\n"],"sourceRoot":""}