{"version":3,"sources":["webpack:///./node_modules/asn1.js/lib/asn1/constants/index.js","webpack:///./node_modules/asn1.js/lib/asn1/decoders/index.js","webpack:///./node_modules/asn1.js/lib/asn1/encoders/index.js","webpack:///./node_modules/asn1.js/lib/asn1/encoders/der.js","webpack:///./node_modules/asn1/lib/ber/index.js","webpack:///./node_modules/asn1.js/lib/asn1/base/index.js","webpack:///./node_modules/asn1.js/lib/asn1/base/buffer.js","webpack:///./node_modules/asn1/lib/index.js","webpack:///./node_modules/asn1.js/lib/asn1.js","webpack:///./node_modules/asn1.js/lib/asn1/base/node.js","webpack:///./node_modules/asn1.js/lib/asn1/encoders/pem.js","webpack:///./node_modules/asn1.js/lib/asn1/constants/der.js","webpack:///./node_modules/asn1/lib/ber/types.js","webpack:///./node_modules/asn1.js/lib/asn1/decoders/pem.js","webpack:///./node_modules/asn1/lib/ber/errors.js","webpack:///./node_modules/asn1.js/node_modules/bn.js/lib/bn.js","webpack:///./node_modules/asn1.js/lib/asn1/decoders/der.js","webpack:///./node_modules/asn1.js/lib/asn1/base/reporter.js","webpack:///./node_modules/asn1/lib/ber/writer.js","webpack:///./node_modules/asn1/lib/ber/reader.js","webpack:///./node_modules/asn1.js/lib/asn1/api.js"],"names":["constants","exports","_reverse","map","res","Object","keys","forEach","key","value","der","decoders","pem","encoders","inherits","Buffer","Node","DEREncoder","entity","this","enc","name","tree","DERNode","_init","body","parent","call","two","num","encodeTag","tag","primitive","cls","reporter","tagByName","hasOwnProperty","error","tagClassByName","module","prototype","encode","data","_encode","join","_encodeComposite","content","encodedTag","length","header","alloc","_createEncoderBuffer","lenOctets","i","j","_encodeStr","str","unused","buf","writeUInt16BE","charCodeAt","_isNumstr","_isPrintstr","test","_encodeObjid","id","values","relative","split","Array","isArray","slice","JSON","stringify","splice","size","ident","objid","offset","_encodeTime","time","date","Date","getUTCFullYear","getUTCMonth","getUTCDate","getUTCHours","getUTCMinutes","getUTCSeconds","_encodeNull","_encodeInt","isBuffer","numArray","toArray","sign","unshift","from","out","copy","_encodeBool","_use","obj","_getEncoder","_skipDefault","dataBuffer","state","_baseState","undefined","defaultBuffer","_encodeValue","errors","types","Reader","Writer","t","e","base","Reporter","DecoderBuffer","EncoderBuffer","options","item","isEncoderBuffer","byteLength","isDecoderBuffer","isCompatible","constructor","save","restore","isEmpty","readUInt8","skip","raw","fail","bytes","_reporterState","write","Ber","BerReader","BerWriter","asn1","bignum","define","assert","tags","methods","concat","overrided","children","args","reverseArgs","choice","optional","any","use","useDecoder","explicit","implicit","contains","_wrap","stateProps","clone","cstate","prop","method","push","apply","arguments","filter","child","equal","_useArgs","arg","Error","def","val","newKey","_decode","input","wrapResult","prevObj","result","present","prevKey","enterKey","_peekTag","isError","_decodeGeneric","_decodeChoice","enterObject","_decodeTag","start","track","path","_getUse","leaveObject","exitKey","leaveKey","_decodeList","_decodeStr","_decodeObjid","_decodeTime","_decodeNull","_decodeBool","_decodeInt","match","some","node","type","_encodeChoice","_encodePrimitive","PEMEncoder","p","toString","label","reverse","tagClass","0","1","2","3","EOC","Boolean","Integer","BitString","OctetString","Null","OID","ObjectDescriptor","External","Real","Enumeration","PDV","Utf8String","RelativeOID","Sequence","Set","NumericString","PrintableString","T61String","VideotexString","IA5String","UTCTime","GeneralizedTime","GraphicString","VisibleString","GeneralString","UniversalString","CharacterString","BMPString","Constructor","Context","DERDecoder","PEMDecoder","decode","lines","toUpperCase","re","end","base64","replace","newInvalidAsn1Error","msg","message","ctor","superCtor","super_","TempCtor","BN","number","endian","isBN","negative","words","red","wordSize","parseHex","r","len","Math","min","c","parseBase","mul","max","left","right","cmp","_initNumber","_initArray","_parseHex","_parseBase","strip","ceil","w","off","limbLen","limbPow","total","mod","word","imuln","_iaddn","pow","dest","_expand","_normSign","inspect","zeros","groupSizes","groupBases","toBitArray","bitLength","bit","wbit","smallMulTo","self","a","b","lo","carry","k","ncarry","rword","maxJ","padding","groupSize","groupBase","isZero","modn","idivn","toNumber","ret","toJSON","toBuffer","toArrayLike","ArrayType","reqLength","littleEndian","q","andln","iushrn","clz32","_countBits","_zeroBits","hi","zeroBits","toTwos","width","abs","inotn","iaddn","fromTwos","testn","notn","ineg","isNeg","neg","iuor","ior","or","uor","iuand","iand","and","uand","iuxor","ixor","xor","uxor","bytesNeeded","bitsLeft","setn","iadd","isub","add","sub","comb10MulTo","mid","o","a0","al0","ah0","a1","al1","ah1","a2","al2","ah2","a3","al3","ah3","a4","al4","ah4","a5","al5","ah5","a6","al6","ah6","a7","al7","ah7","a8","al8","ah8","a9","al9","ah9","b0","bl0","bh0","b1","bl1","bh1","b2","bl2","bh2","b3","bl3","bh3","b4","bl4","bh4","b5","bl5","bh5","b6","bl6","bh6","b7","bl7","bh7","b8","bl8","bh8","b9","bl9","bh9","imul","w0","w1","w2","w3","w4","w5","w6","w7","w8","w9","w10","w11","w12","w13","w14","w15","w16","w17","w18","bigMulTo","hncarry","jumboMulTo","fftm","FFTM","mulp","x","y","mulTo","makeRBT","N","l","revBin","rb","permute","rbt","rws","iws","rtws","itws","transform","s","rtwdf","cos","PI","itwdf","sin","rtwdf_","itwdf_","ie","ro","io","rx","guessLen13b","n","m","odd","conjugate","normalize13b","ws","round","convert13b","stub","ph","_","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","muln","sqr","isqr","iushln","bits","carryMask","newCarry","ishln","hint","extended","h","mask","maskedWords","ishrn","shln","ushln","shrn","ushrn","imaskn","maskn","isubn","addn","subn","iabs","_ishlnsubmul","shift","_wordDiv","mode","bhi","bhiBits","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","acc","egcd","A","B","C","D","g","isEven","yp","xp","im","isOdd","jm","gcd","_invmp","x1","x2","delta","cmpn","invm","bincn","ucmp","gtn","gt","gten","gte","ltn","lt","lten","lte","eqn","eq","Red","toRed","ctx","convertTo","_forceRed","fromRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","shl","redMul","_verify2","redIMul","redSqr","_verify1","redISqr","redSqrt","sqrt","redInvm","redNeg","redPow","primes","k256","p224","p192","p25519","MPrime","tmp","_tmp","K256","P224","P192","P25519","prime","_prime","Mont","imod","rinv","minv","ireduce","rlen","imulK","_strip","output","outLen","prev","next","mod3","one","nOne","lpow","z","inv","windowSize","wnd","current","currentLen","mont","u","derDecodeTag","oct","tagStr","derDecodeLen","buffer","decodedTag","_skipUntilEnd","decoder","possibleEnd","String","fromCharCode","readUInt16BE","numstr","printstr","identifiers","subident","first","second","year","mon","day","hour","sec","UTC","_getDecoder","ReporterError","rethrow","pathLen","index","now","err","inherited","elem","stack","partial","captureStackTrace","ASN1","DEFAULT_OPTS","growthFactor","merge","to","ok","getOwnPropertyNames","getOwnPropertyDescriptor","defineProperty","_buf","_size","_offset","_options","_seq","get","writeByte","TypeError","_ensure","writeInt","sz","writeNull","writeEnumeration","writeBoolean","writeString","writeLength","writeBuffer","writeStringArray","strings","writeOID","encodeOctet","octet","parseInt","startSequence","endSequence","seq","pop","_shift","_len","enumerable","readByte","peek","readLength","lenB","readSequence","readInt","_readTag","readBoolean","readEnumeration","readString","retbuf","readOID","byte","fb","api","Entity","_createNamed","Base","Generated","_initNamed"],"mappings":"0HAEA,MAAMA,EAAYC,EAGlBD,EAAUE,SAAW,SAAiBC,GACpC,MAAMC,EAAM,GAWZ,OATAC,OAAOC,KAAKH,GAAKI,SAAQ,SAASC,IAErB,EAANA,IAAYA,IACfA,GAAY,GAEd,MAAMC,EAAQN,EAAIK,GAClBJ,EAAIK,GAASD,KAGRJ,GAGTJ,EAAUU,IAAM,EAAQ,S,oCClBxB,MAAMC,EAAWV,EAEjBU,EAASD,IAAM,EAAQ,QACvBC,EAASC,IAAM,EAAQ,S,oCCHvB,MAAMC,EAAWZ,EAEjBY,EAASH,IAAM,EAAQ,QACvBG,EAASD,IAAM,EAAQ,S,kCCHvB,MAAME,EAAW,EAAQ,QACnBC,EAAS,EAAQ,QAAgBA,OACjCC,EAAO,EAAQ,QAGfN,EAAM,EAAQ,QAEpB,SAASO,EAAWC,GAClBC,KAAKC,IAAM,MACXD,KAAKE,KAAOH,EAAOG,KACnBF,KAAKD,OAASA,EAGdC,KAAKG,KAAO,IAAIC,EAChBJ,KAAKG,KAAKE,MAAMN,EAAOO,MAUzB,SAASF,EAAQG,GACfV,EAAKW,KAAKR,KAAM,MAAOO,GAmHzB,SAASE,EAAIC,GACX,OAAIA,EAAM,GACD,IAAMA,EAENA,EA4HX,SAASC,EAAUC,EAAKC,EAAWC,EAAKC,GACtC,IAAI9B,EAOJ,GALY,UAAR2B,EACFA,EAAM,MACS,UAARA,IACPA,EAAM,OAEJrB,EAAIyB,UAAUC,eAAeL,GAC/B3B,EAAMM,EAAIyB,UAAUJ,OACjB,IAAmB,kBAARA,IAA2B,EAANA,KAAaA,EAGhD,OAAOG,EAASG,MAAM,gBAAkBN,GAFxC3B,EAAM2B,EAIR,OAAI3B,GAAO,GACF8B,EAASG,MAAM,yCAEnBL,IACH5B,GAAO,IAETA,GAAQM,EAAI4B,eAAeL,GAAO,cAAgB,EAE3C7B,GAnRTmC,EAAOtC,QAAUgB,EAEjBA,EAAWuB,UAAUC,OAAS,SAAgBC,EAAMR,GAClD,OAAOf,KAAKG,KAAKqB,QAAQD,EAAMR,GAAUU,QAQ3C9B,EAASS,EAASP,GAElBO,EAAQiB,UAAUK,iBAAmB,SAAyBd,EAC5DC,EACAC,EACAa,GACA,MAAMC,EAAajB,EAAUC,EAAKC,EAAWC,EAAKd,KAAKe,UAGvD,GAAIY,EAAQE,OAAS,IAAM,CACzB,MAAMC,EAASlC,EAAOmC,MAAM,GAG5B,OAFAD,EAAO,GAAKF,EACZE,EAAO,GAAKH,EAAQE,OACb7B,KAAKgC,qBAAqB,CAAEF,EAAQH,IAK7C,IAAIM,EAAY,EAChB,IAAK,IAAIC,EAAIP,EAAQE,OAAQK,GAAK,IAAOA,IAAM,EAC7CD,IAEF,MAAMH,EAASlC,EAAOmC,MAAM,EAAQE,GACpCH,EAAO,GAAKF,EACZE,EAAO,GAAK,IAAOG,EAEnB,IAAK,IAAIC,EAAI,EAAID,EAAWE,EAAIR,EAAQE,OAAQM,EAAI,EAAGD,IAAKC,IAAM,EAChEL,EAAOI,GAAS,IAAJC,EAEd,OAAOnC,KAAKgC,qBAAqB,CAAEF,EAAQH,KAG7CvB,EAAQiB,UAAUe,WAAa,SAAmBC,EAAKzB,GACrD,GAAY,WAARA,EACF,OAAOZ,KAAKgC,qBAAqB,CAAe,EAAbK,EAAIC,OAAYD,EAAId,OAClD,GAAY,WAARX,EAAkB,CAC3B,MAAM2B,EAAM3C,EAAOmC,MAAmB,EAAbM,EAAIR,QAC7B,IAAK,IAAIK,EAAI,EAAGA,EAAIG,EAAIR,OAAQK,IAC9BK,EAAIC,cAAcH,EAAII,WAAWP,GAAQ,EAAJA,GAEvC,OAAOlC,KAAKgC,qBAAqBO,GAC5B,MAAY,WAAR3B,EACJZ,KAAK0C,UAAUL,GAIbrC,KAAKgC,qBAAqBK,GAHxBrC,KAAKe,SAASG,MAAM,kEAIZ,aAARN,EACJZ,KAAK2C,YAAYN,GAQfrC,KAAKgC,qBAAqBK,GAPxBrC,KAAKe,SAASG,MAAM,qNAQpB,OAAO0B,KAAKhC,IAEJ,YAARA,EADFZ,KAAKgC,qBAAqBK,GAI1BrC,KAAKe,SAASG,MAAM,4BAA8BN,EAC9B,iBAI/BR,EAAQiB,UAAUwB,aAAe,SAAqBC,EAAIC,EAAQC,GAChE,GAAkB,kBAAPF,EAAiB,CAC1B,IAAKC,EACH,OAAO/C,KAAKe,SAASG,MAAM,+CAC7B,IAAK6B,EAAO9B,eAAe6B,GACzB,OAAO9C,KAAKe,SAASG,MAAM,iCAC7B4B,EAAKC,EAAOD,GAAIG,MAAM,WACtB,IAAK,IAAIf,EAAI,EAAGA,EAAIY,EAAGjB,OAAQK,IAC7BY,EAAGZ,IAAM,OACN,GAAIgB,MAAMC,QAAQL,GAAK,CAC5BA,EAAKA,EAAGM,QACR,IAAK,IAAIlB,EAAI,EAAGA,EAAIY,EAAGjB,OAAQK,IAC7BY,EAAGZ,IAAM,EAGb,IAAKgB,MAAMC,QAAQL,GACjB,OAAO9C,KAAKe,SAASG,MAAM,kDACUmC,KAAKC,UAAUR,IAGtD,IAAKE,EAAU,CACb,GAAIF,EAAG,IAAM,GACX,OAAO9C,KAAKe,SAASG,MAAM,+BAC7B4B,EAAGS,OAAO,EAAG,EAAW,GAART,EAAG,GAAUA,EAAG,IAIlC,IAAIU,EAAO,EACX,IAAK,IAAItB,EAAI,EAAGA,EAAIY,EAAGjB,OAAQK,IAAK,CAClC,IAAIuB,EAAQX,EAAGZ,GACf,IAAKsB,IAAQC,GAAS,IAAMA,IAAU,EACpCD,IAGJ,MAAME,EAAQ9D,EAAOmC,MAAMyB,GAC3B,IAAIG,EAASD,EAAM7B,OAAS,EAC5B,IAAK,IAAIK,EAAIY,EAAGjB,OAAS,EAAGK,GAAK,EAAGA,IAAK,CACvC,IAAIuB,EAAQX,EAAGZ,GACfwB,EAAMC,KAAoB,IAARF,EAClB,OAAQA,IAAU,GAAK,EACrBC,EAAMC,KAAY,IAAgB,IAARF,EAG9B,OAAOzD,KAAKgC,qBAAqB0B,IAUnCtD,EAAQiB,UAAUuC,YAAc,SAAoBC,EAAMjD,GACxD,IAAIyB,EACJ,MAAMyB,EAAO,IAAIC,KAAKF,GA0BtB,MAxBY,YAARjD,EACFyB,EAAM,CACJ5B,EAAIqD,EAAKE,kBACTvD,EAAIqD,EAAKG,cAAgB,GACzBxD,EAAIqD,EAAKI,cACTzD,EAAIqD,EAAKK,eACT1D,EAAIqD,EAAKM,iBACT3D,EAAIqD,EAAKO,iBACT,KACA5C,KAAK,IACU,YAARb,EACTyB,EAAM,CACJ5B,EAAIqD,EAAKE,iBAAmB,KAC5BvD,EAAIqD,EAAKG,cAAgB,GACzBxD,EAAIqD,EAAKI,cACTzD,EAAIqD,EAAKK,eACT1D,EAAIqD,EAAKM,iBACT3D,EAAIqD,EAAKO,iBACT,KACA5C,KAAK,IAEPzB,KAAKe,SAASG,MAAM,YAAcN,EAAM,8BAGnCZ,KAAKoC,WAAWC,EAAK,WAG9BjC,EAAQiB,UAAUiD,YAAc,WAC9B,OAAOtE,KAAKgC,qBAAqB,KAGnC5B,EAAQiB,UAAUkD,WAAa,SAAmB7D,EAAKqC,GACrD,GAAmB,kBAARrC,EAAkB,CAC3B,IAAKqC,EACH,OAAO/C,KAAKe,SAASG,MAAM,+CAC7B,IAAK6B,EAAO9B,eAAeP,GACzB,OAAOV,KAAKe,SAASG,MAAM,+BACAmC,KAAKC,UAAU5C,IAE5CA,EAAMqC,EAAOrC,GAIf,GAAmB,kBAARA,IAAqBd,EAAO4E,SAAS9D,GAAM,CACpD,MAAM+D,EAAW/D,EAAIgE,WAChBhE,EAAIiE,MAAsB,IAAdF,EAAS,IACxBA,EAASG,QAAQ,GAEnBlE,EAAMd,EAAOiF,KAAKJ,GAGpB,GAAI7E,EAAO4E,SAAS9D,GAAM,CACxB,IAAI8C,EAAO9C,EAAImB,OACI,IAAfnB,EAAImB,QACN2B,IAEF,MAAMsB,EAAMlF,EAAOmC,MAAMyB,GAIzB,OAHA9C,EAAIqE,KAAKD,GACU,IAAfpE,EAAImB,SACNiD,EAAI,GAAK,GACJ9E,KAAKgC,qBAAqB8C,GAGnC,GAAIpE,EAAM,IACR,OAAOV,KAAKgC,qBAAqBtB,GAEnC,GAAIA,EAAM,IACR,OAAOV,KAAKgC,qBAAqB,CAAC,EAAGtB,IAEvC,IAAI8C,EAAO,EACX,IAAK,IAAItB,EAAIxB,EAAKwB,GAAK,IAAOA,IAAM,EAClCsB,IAEF,MAAMsB,EAAM,IAAI5B,MAAMM,GACtB,IAAK,IAAItB,EAAI4C,EAAIjD,OAAS,EAAGK,GAAK,EAAGA,IACnC4C,EAAI5C,GAAW,IAANxB,EACTA,IAAQ,EAMV,OAJY,IAAToE,EAAI,IACLA,EAAIF,QAAQ,GAGP5E,KAAKgC,qBAAqBpC,EAAOiF,KAAKC,KAG/C1E,EAAQiB,UAAU2D,YAAc,SAAoB1F,GAClD,OAAOU,KAAKgC,qBAAqB1C,EAAQ,IAAO,IAGlDc,EAAQiB,UAAU4D,KAAO,SAAalF,EAAQmF,GAG5C,MAFsB,oBAAXnF,IACTA,EAASA,EAAOmF,IACXnF,EAAOoF,YAAY,OAAOhF,MAGnCC,EAAQiB,UAAU+D,aAAe,SAAqBC,EAAYtE,EAAUR,GAC1E,MAAM+E,EAAQtF,KAAKuF,WACnB,IAAIrD,EACJ,GAAyB,OAArBoD,EAAM,WACR,OAAO,EAET,MAAM/D,EAAO8D,EAAW5D,OAIxB,QAH4B+D,IAAxBF,EAAMG,gBACRH,EAAMG,cAAgBzF,KAAK0F,aAAaJ,EAAM,WAAYvE,EAAUR,GAAQkB,QAE1EF,EAAKM,SAAWyD,EAAMG,cAAc5D,OACtC,OAAO,EAET,IAAKK,EAAE,EAAGA,EAAIX,EAAKM,OAAQK,IACzB,GAAIX,EAAKW,KAAOoD,EAAMG,cAAcvD,GAClC,OAAO,EAEX,OAAO,I,uBCvQT,IAAIyD,EAAS,EAAQ,QACjBC,EAAQ,EAAQ,QAEhBC,EAAS,EAAQ,QACjBC,EAAS,EAAQ,QAarB,IAAK,IAAIC,KART3E,EAAOtC,QAAU,CAEf+G,OAAQA,EAERC,OAAQA,GAIIF,EACRA,EAAM3E,eAAe8E,KACvB3E,EAAOtC,QAAQiH,GAAKH,EAAMG,IAE9B,IAAK,IAAIC,KAAKL,EACRA,EAAO1E,eAAe+E,KACxB5E,EAAOtC,QAAQkH,GAAKL,EAAOK,K,oCCvB/B,MAAMC,EAAOnH,EAEbmH,EAAKC,SAAW,EAAQ,QAAcA,SACtCD,EAAKE,cAAgB,EAAQ,QAAYA,cACzCF,EAAKG,cAAgB,EAAQ,QAAYA,cACzCH,EAAKpG,KAAO,EAAQ,S,kCCLpB,MAAMF,EAAW,EAAQ,QACnBuG,EAAW,EAAQ,QAAoBA,SACvCtG,EAAS,EAAQ,QAAgBA,OAEvC,SAASuG,EAAcF,EAAMI,GAC3BH,EAAS1F,KAAKR,KAAMqG,GACfzG,EAAO4E,SAASyB,IAKrBjG,KAAKiG,KAAOA,EACZjG,KAAK2D,OAAS,EACd3D,KAAK6B,OAASoE,EAAKpE,QANjB7B,KAAKkB,MAAM,oBA8Ef,SAASkF,EAAc9G,EAAOyB,GAC5B,GAAImC,MAAMC,QAAQ7D,GAChBU,KAAK6B,OAAS,EACd7B,KAAKV,MAAQA,EAAMN,KAAI,SAASsH,GAI9B,OAHKF,EAAcG,gBAAgBD,KACjCA,EAAO,IAAIF,EAAcE,EAAMvF,IACjCf,KAAK6B,QAAUyE,EAAKzE,OACbyE,IACNtG,WACE,GAAqB,kBAAVV,EAAoB,CACpC,KAAM,GAAKA,GAASA,GAAS,KAC3B,OAAOyB,EAASG,MAAM,gCACxBlB,KAAKV,MAAQA,EACbU,KAAK6B,OAAS,OACT,GAAqB,kBAAVvC,EAChBU,KAAKV,MAAQA,EACbU,KAAK6B,OAASjC,EAAO4G,WAAWlH,OAC3B,KAAIM,EAAO4E,SAASlF,GAIzB,OAAOyB,EAASG,MAAM,4BAA8B5B,GAHpDU,KAAKV,MAAQA,EACbU,KAAK6B,OAASvC,EAAMuC,QAzFxBlC,EAASwG,EAAeD,GACxBpH,EAAQqH,cAAgBA,EAExBA,EAAcM,gBAAkB,SAAyBlF,GACvD,GAAIA,aAAgB4E,EAClB,OAAO,EAIT,MAAMO,EAA+B,kBAATnF,GAC1B3B,EAAO4E,SAASjD,EAAK0E,OACK,kBAA1B1E,EAAKoF,YAAYzG,MACM,kBAAhBqB,EAAKoC,QACW,kBAAhBpC,EAAKM,QACS,oBAAdN,EAAKqF,MACY,oBAAjBrF,EAAKsF,SACY,oBAAjBtF,EAAKuF,SACc,oBAAnBvF,EAAKwF,WACS,oBAAdxF,EAAKyF,MACQ,oBAAbzF,EAAK0F,IAEd,OAAOP,GAGTP,EAAc9E,UAAUuF,KAAO,WAC7B,MAAO,CAAEjD,OAAQ3D,KAAK2D,OAAQ5C,SAAUmF,EAAS7E,UAAUuF,KAAKpG,KAAKR,QAGvEmG,EAAc9E,UAAUwF,QAAU,SAAiBD,GAEjD,MAAM3H,EAAM,IAAIkH,EAAcnG,KAAKiG,MAOnC,OANAhH,EAAI0E,OAASiD,EAAKjD,OAClB1E,EAAI4C,OAAS7B,KAAK2D,OAElB3D,KAAK2D,OAASiD,EAAKjD,OACnBuC,EAAS7E,UAAUwF,QAAQrG,KAAKR,KAAM4G,EAAK7F,UAEpC9B,GAGTkH,EAAc9E,UAAUyF,QAAU,WAChC,OAAO9G,KAAK2D,SAAW3D,KAAK6B,QAG9BsE,EAAc9E,UAAU0F,UAAY,SAAmBG,GACrD,OAAIlH,KAAK2D,OAAS,GAAK3D,KAAK6B,OACnB7B,KAAKiG,KAAKc,UAAU/G,KAAK2D,UAAU,GAEnC3D,KAAKkB,MAAMgG,GAAQ,0BAG9Bf,EAAc9E,UAAU2F,KAAO,SAAcG,EAAOD,GAClD,KAAMlH,KAAK2D,OAASwD,GAASnH,KAAK6B,QAChC,OAAO7B,KAAKkB,MAAMgG,GAAQ,yBAE5B,MAAMjI,EAAM,IAAIkH,EAAcnG,KAAKiG,MAQnC,OALAhH,EAAImI,eAAiBpH,KAAKoH,eAE1BnI,EAAI0E,OAAS3D,KAAK2D,OAClB1E,EAAI4C,OAAS7B,KAAK2D,OAASwD,EAC3BnH,KAAK2D,QAAUwD,EACRlI,GAGTkH,EAAc9E,UAAU4F,IAAM,SAAaL,GACzC,OAAO5G,KAAKiG,KAAK7C,MAAMwD,EAAOA,EAAKjD,OAAS3D,KAAK2D,OAAQ3D,KAAK6B,SA2BhE/C,EAAQsH,cAAgBA,EAExBA,EAAcG,gBAAkB,SAAyBhF,GACvD,GAAIA,aAAgB6E,EAClB,OAAO,EAIT,MAAMM,EAA+B,kBAATnF,GACA,kBAA1BA,EAAKoF,YAAYzG,MACM,kBAAhBqB,EAAKM,QACS,oBAAdN,EAAKE,KAEd,OAAOiF,GAGTN,EAAc/E,UAAUI,KAAO,SAAcqD,EAAKnB,GAMhD,OALKmB,IACHA,EAAMlF,EAAOmC,MAAM/B,KAAK6B,SACrB8B,IACHA,EAAS,GAES,IAAhB3D,KAAK6B,SAGLqB,MAAMC,QAAQnD,KAAKV,OACrBU,KAAKV,MAAMF,SAAQ,SAASkH,GAC1BA,EAAK7E,KAAKqD,EAAKnB,GACfA,GAAU2C,EAAKzE,WAGS,kBAAf7B,KAAKV,MACdwF,EAAInB,GAAU3D,KAAKV,MACU,kBAAfU,KAAKV,MACnBwF,EAAIuC,MAAMrH,KAAKV,MAAOqE,GACf/D,EAAO4E,SAASxE,KAAKV,QAC5BU,KAAKV,MAAMyF,KAAKD,EAAKnB,GACvBA,GAAU3D,KAAK6B,SAdRiD,I,uBCjIX,IAAIwC,EAAM,EAAQ,QAMlBlG,EAAOtC,QAAU,CAEfwI,IAAKA,EAELC,UAAWD,EAAIzB,OAEf2B,UAAWF,EAAIxB,S,oCCfjB,MAAM2B,EAAO3I,EAEb2I,EAAKC,OAAS,EAAQ,SAEtBD,EAAKE,OAAS,EAAQ,QAAcA,OACpCF,EAAKxB,KAAO,EAAQ,QACpBwB,EAAK5I,UAAY,EAAQ,QACzB4I,EAAKjI,SAAW,EAAQ,QACxBiI,EAAK/H,SAAW,EAAQ,S,kCCRxB,MAAMwG,EAAW,EAAQ,QAAoBA,SACvCE,EAAgB,EAAQ,QAAkBA,cAC1CD,EAAgB,EAAQ,QAAkBA,cAC1CyB,EAAS,EAAQ,QAGjBC,EAAO,CACX,MAAO,QAAS,MAAO,QAAS,QAAS,OACzC,UAAW,UAAW,QAAS,OAAQ,MAAO,UAC9C,SAAU,SAAU,UAAW,SAAU,WAAY,SAAU,YAC/D,SAAU,SAAU,WAAY,SAAU,SAAU,UAAW,YAI3DC,EAAU,CACd,MAAO,MAAO,MAAO,WAAY,WAAY,WAAY,MAAO,SAChE,MAAO,YACPC,OAAOF,GAGHG,EAAY,CAChB,WAAY,aAAc,OAC1B,aAAc,eAAgB,cAC9B,cAAe,aAAc,cAAe,cAE5C,mBAAoB,aAAc,eAAgB,cAClD,cAAe,aAAc,eAG/B,SAASnI,EAAKI,EAAKM,EAAQL,GACzB,MAAMoF,EAAQ,GACdtF,KAAKuF,WAAaD,EAElBA,EAAMpF,KAAOA,EACboF,EAAMrF,IAAMA,EAEZqF,EAAM/E,OAASA,GAAU,KACzB+E,EAAM2C,SAAW,KAGjB3C,EAAM1E,IAAM,KACZ0E,EAAM4C,KAAO,KACb5C,EAAM6C,YAAc,KACpB7C,EAAM8C,OAAS,KACf9C,EAAM+C,UAAW,EACjB/C,EAAMgD,KAAM,EACZhD,EAAMJ,KAAM,EACZI,EAAMiD,IAAM,KACZjD,EAAMkD,WAAa,KACnBlD,EAAMjG,IAAM,KACZiG,EAAM,WAAa,KACnBA,EAAMmD,SAAW,KACjBnD,EAAMoD,SAAW,KACjBpD,EAAMqD,SAAW,KAGZrD,EAAM/E,SACT+E,EAAM2C,SAAW,GACjBjI,KAAK4I,SAGTxH,EAAOtC,QAAUe,EAEjB,MAAMgJ,EAAa,CACjB,MAAO,SAAU,WAAY,MAAO,OAAQ,cAAe,SAC3D,WAAY,MAAO,MAAO,MAAO,aAAc,MAAO,UAAW,WACjE,WAAY,YAGdhJ,EAAKwB,UAAUyH,MAAQ,WACrB,MAAMxD,EAAQtF,KAAKuF,WACbwD,EAAS,GACfF,EAAWzJ,SAAQ,SAAS4J,GAC1BD,EAAOC,GAAQ1D,EAAM0D,MAEvB,MAAM/J,EAAM,IAAIe,KAAK2G,YAAYoC,EAAOxI,QAExC,OADAtB,EAAIsG,WAAawD,EACV9J,GAGTY,EAAKwB,UAAUuH,MAAQ,WACrB,MAAMtD,EAAQtF,KAAKuF,WACnBuC,EAAQ1I,SAAQ,SAAS6J,GACvBjJ,KAAKiJ,GAAU,WACb,MAAMH,EAAQ,IAAI9I,KAAK2G,YAAY3G,MAEnC,OADAsF,EAAM2C,SAASiB,KAAKJ,GACbA,EAAMG,GAAQE,MAAML,EAAOM,cAEnCpJ,OAGLH,EAAKwB,UAAUhB,MAAQ,SAAcC,GACnC,MAAMgF,EAAQtF,KAAKuF,WAEnBqC,EAAwB,OAAjBtC,EAAM/E,QACbD,EAAKE,KAAKR,MAGVsF,EAAM2C,SAAW3C,EAAM2C,SAASoB,QAAO,SAASC,GAC9C,OAAOA,EAAM/D,WAAWhF,SAAWP,OAClCA,MACH4H,EAAO2B,MAAMjE,EAAM2C,SAASpG,OAAQ,EAAG,sCAGzChC,EAAKwB,UAAUmI,SAAW,SAAiBtB,GACzC,MAAM5C,EAAQtF,KAAKuF,WAGb0C,EAAWC,EAAKmB,QAAO,SAASI,GACpC,OAAOA,aAAezJ,KAAK2G,cAC1B3G,MACHkI,EAAOA,EAAKmB,QAAO,SAASI,GAC1B,QAASA,aAAezJ,KAAK2G,eAC5B3G,MAEqB,IAApBiI,EAASpG,SACX+F,EAA0B,OAAnBtC,EAAM2C,UACb3C,EAAM2C,SAAWA,EAGjBA,EAAS7I,SAAQ,SAASkK,GACxBA,EAAM/D,WAAWhF,OAASP,OACzBA,OAEe,IAAhBkI,EAAKrG,SACP+F,EAAsB,OAAftC,EAAM4C,MACb5C,EAAM4C,KAAOA,EACb5C,EAAM6C,YAAcD,EAAKlJ,KAAI,SAASyK,GACpC,GAAmB,kBAARA,GAAoBA,EAAI9C,cAAgBzH,OACjD,OAAOuK,EAET,MAAMxK,EAAM,GAOZ,OANAC,OAAOC,KAAKsK,GAAKrK,SAAQ,SAASC,GAC5BA,IAAc,EAANA,KACVA,GAAO,GACT,MAAMC,EAAQmK,EAAIpK,GAClBJ,EAAIK,GAASD,KAERJ,OASb+I,EAAU5I,SAAQ,SAAS6J,GACzBpJ,EAAKwB,UAAU4H,GAAU,WACvB,MAAM3D,EAAQtF,KAAKuF,WACnB,MAAM,IAAImE,MAAMT,EAAS,kCAAoC3D,EAAMrF,SAQvE4H,EAAKzI,SAAQ,SAASwB,GACpBf,EAAKwB,UAAUT,GAAO,WACpB,MAAM0E,EAAQtF,KAAKuF,WACb2C,EAAOhF,MAAM7B,UAAU+B,MAAM5C,KAAK4I,WAOxC,OALAxB,EAAqB,OAAdtC,EAAM1E,KACb0E,EAAM1E,IAAMA,EAEZZ,KAAKwJ,SAAStB,GAEPlI,SAIXH,EAAKwB,UAAUkH,IAAM,SAAajC,GAChCsB,EAAOtB,GACP,MAAMhB,EAAQtF,KAAKuF,WAKnB,OAHAqC,EAAqB,OAAdtC,EAAMiD,KACbjD,EAAMiD,IAAMjC,EAELtG,MAGTH,EAAKwB,UAAUgH,SAAW,WACxB,MAAM/C,EAAQtF,KAAKuF,WAInB,OAFAD,EAAM+C,UAAW,EAEVrI,MAGTH,EAAKwB,UAAUsI,IAAM,SAAaC,GAChC,MAAMtE,EAAQtF,KAAKuF,WAMnB,OAJAqC,EAA4B,OAArBtC,EAAM,YACbA,EAAM,WAAasE,EACnBtE,EAAM+C,UAAW,EAEVrI,MAGTH,EAAKwB,UAAUoH,SAAW,SAAkB/H,GAC1C,MAAM4E,EAAQtF,KAAKuF,WAKnB,OAHAqC,EAA0B,OAAnBtC,EAAMmD,UAAwC,OAAnBnD,EAAMoD,UACxCpD,EAAMmD,SAAW/H,EAEVV,MAGTH,EAAKwB,UAAUqH,SAAW,SAAkBhI,GAC1C,MAAM4E,EAAQtF,KAAKuF,WAKnB,OAHAqC,EAA0B,OAAnBtC,EAAMmD,UAAwC,OAAnBnD,EAAMoD,UACxCpD,EAAMoD,SAAWhI,EAEVV,MAGTH,EAAKwB,UAAU6D,IAAM,WACnB,MAAMI,EAAQtF,KAAKuF,WACb2C,EAAOhF,MAAM7B,UAAU+B,MAAM5C,KAAK4I,WAOxC,OALA9D,EAAMJ,KAAM,EAEQ,IAAhBgD,EAAKrG,QACP7B,KAAKwJ,SAAStB,GAETlI,MAGTH,EAAKwB,UAAUhC,IAAM,SAAawK,GAChC,MAAMvE,EAAQtF,KAAKuF,WAKnB,OAHAqC,EAAqB,OAAdtC,EAAMjG,KACbiG,EAAMjG,IAAMwK,EAEL7J,MAGTH,EAAKwB,UAAUiH,IAAM,WACnB,MAAMhD,EAAQtF,KAAKuF,WAInB,OAFAD,EAAMgD,KAAM,EAELtI,MAGTH,EAAKwB,UAAU+G,OAAS,SAAgBlD,GACtC,MAAMI,EAAQtF,KAAKuF,WAQnB,OANAqC,EAAwB,OAAjBtC,EAAM8C,QACb9C,EAAM8C,OAASlD,EACflF,KAAKwJ,SAAStK,OAAOC,KAAK+F,GAAKlG,KAAI,SAASK,GAC1C,OAAO6F,EAAI7F,OAGNW,MAGTH,EAAKwB,UAAUsH,SAAW,SAAkBrC,GAC1C,MAAMhB,EAAQtF,KAAKuF,WAKnB,OAHAqC,EAAqB,OAAdtC,EAAMiD,KACbjD,EAAMqD,SAAWrC,EAEVtG,MAOTH,EAAKwB,UAAUyI,QAAU,SAAgBC,EAAO1D,GAC9C,MAAMf,EAAQtF,KAAKuF,WAGnB,GAAqB,OAAjBD,EAAM/E,OACR,OAAOwJ,EAAMC,WAAW1E,EAAM2C,SAAS,GAAG6B,QAAQC,EAAO1D,IAE3D,IAuCI4D,EAvCAC,EAAS5E,EAAM,WACf6E,GAAU,EAEVC,EAAU,KAKd,GAJkB,OAAd9E,EAAMjG,MACR+K,EAAUL,EAAMM,SAAS/E,EAAMjG,MAG7BiG,EAAM+C,SAAU,CAClB,IAAIzH,EAAM,KAQV,GAPuB,OAAnB0E,EAAMmD,SACR7H,EAAM0E,EAAMmD,SACc,OAAnBnD,EAAMoD,SACb9H,EAAM0E,EAAMoD,SACS,OAAdpD,EAAM1E,MACbA,EAAM0E,EAAM1E,KAEF,OAARA,GAAiB0E,EAAMgD,KAgBzB,GAFA6B,EAAUnK,KAAKsK,SAASP,EAAOnJ,EAAK0E,EAAMgD,KAEtCyB,EAAMQ,QAAQJ,GAChB,OAAOA,MAjBqB,CAE9B,MAAMvD,EAAOmD,EAAMnD,OACnB,IACuB,OAAjBtB,EAAM8C,OACRpI,KAAKwK,eAAelF,EAAM1E,IAAKmJ,EAAO1D,GAEtCrG,KAAKyK,cAAcV,EAAO1D,GAC5B8D,GAAU,EACV,MAAOnE,GACPmE,GAAU,EAEZJ,EAAMlD,QAAQD,IAclB,GAHItB,EAAMJ,KAAOiF,IACfF,EAAUF,EAAMW,eAEdP,EAAS,CAEX,GAAuB,OAAnB7E,EAAMmD,SAAmB,CAC3B,MAAMA,EAAWzI,KAAK2K,WAAWZ,EAAOzE,EAAMmD,UAC9C,GAAIsB,EAAMQ,QAAQ9B,GAChB,OAAOA,EACTsB,EAAQtB,EAGV,MAAMmC,EAAQb,EAAMpG,OAGpB,GAAkB,OAAd2B,EAAMiD,KAAiC,OAAjBjD,EAAM8C,OAAiB,CAC/C,IAAIxB,EACAtB,EAAMgD,MACR1B,EAAOmD,EAAMnD,QACf,MAAMtG,EAAON,KAAK2K,WAChBZ,EACmB,OAAnBzE,EAAMoD,SAAoBpD,EAAMoD,SAAWpD,EAAM1E,IACjD0E,EAAMgD,KAER,GAAIyB,EAAMQ,QAAQjK,GAChB,OAAOA,EAELgF,EAAMgD,IACR4B,EAASH,EAAM9C,IAAIL,GAEnBmD,EAAQzJ,EAkBZ,GAfI+F,GAAWA,EAAQwE,OAAuB,OAAdvF,EAAM1E,KACpCyF,EAAQwE,MAAMd,EAAMe,OAAQF,EAAOb,EAAMlI,OAAQ,UAE/CwE,GAAWA,EAAQwE,OAAuB,OAAdvF,EAAM1E,KACpCyF,EAAQwE,MAAMd,EAAMe,OAAQf,EAAMpG,OAAQoG,EAAMlI,OAAQ,WAGtDyD,EAAMgD,MAGR4B,EAD0B,OAAjB5E,EAAM8C,OACNpI,KAAKwK,eAAelF,EAAM1E,IAAKmJ,EAAO1D,GAEtCrG,KAAKyK,cAAcV,EAAO1D,IAGjC0D,EAAMQ,QAAQL,GAChB,OAAOA,EAYT,GATK5E,EAAMgD,KAAwB,OAAjBhD,EAAM8C,QAAsC,OAAnB9C,EAAM2C,UAC/C3C,EAAM2C,SAAS7I,SAAQ,SAAwBkK,GAG7CA,EAAMQ,QAAQC,EAAO1D,MAKrBf,EAAMqD,WAA2B,WAAdrD,EAAM1E,KAAkC,WAAd0E,EAAM1E,KAAmB,CACxE,MAAMW,EAAO,IAAI4E,EAAc+D,GAC/BA,EAASlK,KAAK+K,QAAQzF,EAAMqD,SAAUoB,EAAM3C,eAAelC,KACxD4E,QAAQvI,EAAM8E,IAcrB,OATIf,EAAMJ,KAAOiF,IACfD,EAASH,EAAMiB,YAAYf,IAGX,OAAd3E,EAAMjG,KAA4B,OAAX6K,IAA+B,IAAZC,EAEzB,OAAZC,GACPL,EAAMkB,QAAQb,GAFdL,EAAMmB,SAASd,EAAS9E,EAAMjG,IAAK6K,GAI9BA,GAGTrK,EAAKwB,UAAUmJ,eAAiB,SAAuB5J,EAAKmJ,EAAO1D,GACjE,MAAMf,EAAQtF,KAAKuF,WAEnB,MAAY,QAAR3E,GAAyB,QAARA,EACZ,KACG,UAARA,GAA2B,UAARA,EACdZ,KAAKmL,YAAYpB,EAAOnJ,EAAK0E,EAAM4C,KAAK,GAAI7B,GAC5C,OAAOzD,KAAKhC,GACZZ,KAAKoL,WAAWrB,EAAOnJ,EAAKyF,GACpB,UAARzF,GAAmB0E,EAAM4C,KACzBlI,KAAKqL,aAAatB,EAAOzE,EAAM4C,KAAK,GAAI5C,EAAM4C,KAAK,GAAI7B,GAC/C,UAARzF,EACAZ,KAAKqL,aAAatB,EAAO,KAAM,KAAM1D,GAC7B,YAARzF,GAA6B,YAARA,EACrBZ,KAAKsL,YAAYvB,EAAOnJ,EAAKyF,GACrB,UAARzF,EACAZ,KAAKuL,YAAYxB,EAAO1D,GAChB,SAARzF,EACAZ,KAAKwL,YAAYzB,EAAO1D,GAChB,YAARzF,EACAZ,KAAKoL,WAAWrB,EAAOnJ,EAAKyF,GACpB,QAARzF,GAAyB,SAARA,EACjBZ,KAAKyL,WAAW1B,EAAOzE,EAAM4C,MAAQ5C,EAAM4C,KAAK,GAAI7B,GAE3C,OAAdf,EAAMiD,IACDvI,KAAK+K,QAAQzF,EAAMiD,IAAKwB,EAAM3C,eAAelC,KACjD4E,QAAQC,EAAO1D,GAEX0D,EAAM7I,MAAM,gBAAkBN,IAIzCf,EAAKwB,UAAU0J,QAAU,SAAiBhL,EAAQmF,GAEhD,MAAMI,EAAQtF,KAAKuF,WASnB,OAPAD,EAAMkD,WAAaxI,KAAKiF,KAAKlF,EAAQmF,GACrC0C,EAA8C,OAAvCtC,EAAMkD,WAAWjD,WAAWhF,QACnC+E,EAAMkD,WAAalD,EAAMkD,WAAWjD,WAAW0C,SAAS,GACpD3C,EAAMoD,WAAapD,EAAMkD,WAAWjD,WAAWmD,WACjDpD,EAAMkD,WAAalD,EAAMkD,WAAWM,QACpCxD,EAAMkD,WAAWjD,WAAWmD,SAAWpD,EAAMoD,UAExCpD,EAAMkD,YAGf3I,EAAKwB,UAAUoJ,cAAgB,SAAsBV,EAAO1D,GAC1D,MAAMf,EAAQtF,KAAKuF,WACnB,IAAI2E,EAAS,KACTwB,GAAQ,EAmBZ,OAjBAxM,OAAOC,KAAKmG,EAAM8C,QAAQuD,MAAK,SAAStM,GACtC,MAAMuH,EAAOmD,EAAMnD,OACbgF,EAAOtG,EAAM8C,OAAO/I,GAC1B,IACE,MAAMC,EAAQsM,EAAK9B,QAAQC,EAAO1D,GAClC,GAAI0D,EAAMQ,QAAQjL,GAChB,OAAO,EAET4K,EAAS,CAAE2B,KAAMxM,EAAKC,MAAOA,GAC7BoM,GAAQ,EACR,MAAO1F,GAEP,OADA+D,EAAMlD,QAAQD,IACP,EAET,OAAO,IACN5G,MAEE0L,EAGExB,EAFEH,EAAM7I,MAAM,uBASvBrB,EAAKwB,UAAUW,qBAAuB,SAA6BT,GACjE,OAAO,IAAI6E,EAAc7E,EAAMvB,KAAKe,WAGtClB,EAAKwB,UAAUG,QAAU,SAAgBD,EAAMR,EAAUR,GACvD,MAAM+E,EAAQtF,KAAKuF,WACnB,GAAyB,OAArBD,EAAM,YAAuBA,EAAM,aAAe/D,EACpD,OAEF,MAAM2I,EAASlK,KAAK0F,aAAanE,EAAMR,EAAUR,GACjD,YAAeiF,IAAX0E,GAGAlK,KAAKoF,aAAa8E,EAAQnJ,EAAUR,QAHxC,EAMO2J,GAGTrK,EAAKwB,UAAUqE,aAAe,SAAgBnE,EAAMR,EAAUR,GAC5D,MAAM+E,EAAQtF,KAAKuF,WAGnB,GAAqB,OAAjBD,EAAM/E,OACR,OAAO+E,EAAM2C,SAAS,GAAGzG,QAAQD,EAAMR,GAAY,IAAImF,GAEzD,IAAIgE,EAAS,KAMb,GAHAlK,KAAKe,SAAWA,EAGZuE,EAAM+C,eAAqB7C,IAATjE,EAAoB,CACxC,GAAyB,OAArB+D,EAAM,WAGR,OAFA/D,EAAO+D,EAAM,WAMjB,IAAI3D,EAAU,KACVd,GAAY,EAChB,GAAIyE,EAAMgD,IAER4B,EAASlK,KAAKgC,qBAAqBT,QAC9B,GAAI+D,EAAM8C,OACf8B,EAASlK,KAAK8L,cAAcvK,EAAMR,QAC7B,GAAIuE,EAAMqD,SACfhH,EAAU3B,KAAK+K,QAAQzF,EAAMqD,SAAUpI,GAAQiB,QAAQD,EAAMR,GAC7DF,GAAY,OACP,GAAIyE,EAAM2C,SACftG,EAAU2D,EAAM2C,SAASjJ,KAAI,SAASsK,GACpC,GAA6B,UAAzBA,EAAM/D,WAAW3E,IACnB,OAAO0I,EAAM9H,QAAQ,KAAMT,EAAUQ,GAEvC,GAA6B,OAAzB+H,EAAM/D,WAAWlG,IACnB,OAAO0B,EAASG,MAAM,2BACxB,MAAMkJ,EAAUrJ,EAASsJ,SAASf,EAAM/D,WAAWlG,KAEnD,GAAoB,kBAATkC,EACT,OAAOR,EAASG,MAAM,2CAExB,MAAMjC,EAAMqK,EAAM9H,QAAQD,EAAK+H,EAAM/D,WAAWlG,KAAM0B,EAAUQ,GAGhE,OAFAR,EAASmK,SAASd,GAEXnL,IACNe,MAAMqJ,QAAO,SAASC,GACvB,OAAOA,KAET3H,EAAU3B,KAAKgC,qBAAqBL,QAEpC,GAAkB,UAAd2D,EAAM1E,KAAiC,UAAd0E,EAAM1E,IAAiB,CAElD,IAAM0E,EAAM4C,MAA8B,IAAtB5C,EAAM4C,KAAKrG,OAC7B,OAAOd,EAASG,MAAM,uBAAyBoE,EAAM1E,KAEvD,IAAKsC,MAAMC,QAAQ5B,GACjB,OAAOR,EAASG,MAAM,sCAExB,MAAMoI,EAAQtJ,KAAK8I,QACnBQ,EAAM/D,WAAWmD,SAAW,KAC5B/G,EAAU3B,KAAKgC,qBAAqBT,EAAKvC,KAAI,SAASsH,GACpD,MAAMhB,EAAQtF,KAAKuF,WAEnB,OAAOvF,KAAK+K,QAAQzF,EAAM4C,KAAK,GAAI3G,GAAMC,QAAQ8E,EAAMvF,KACtDuI,SACoB,OAAdhE,EAAMiD,IACf2B,EAASlK,KAAK+K,QAAQzF,EAAMiD,IAAKhI,GAAQiB,QAAQD,EAAMR,IAEvDY,EAAU3B,KAAK+L,iBAAiBzG,EAAM1E,IAAKW,GAC3CV,GAAY,GAKhB,IAAKyE,EAAMgD,KAAwB,OAAjBhD,EAAM8C,OAAiB,CACvC,MAAMxH,EAAyB,OAAnB0E,EAAMoD,SAAoBpD,EAAMoD,SAAWpD,EAAM1E,IACvDE,EAAyB,OAAnBwE,EAAMoD,SAAoB,YAAc,UAExC,OAAR9H,EACgB,OAAd0E,EAAMiD,KACRxH,EAASG,MAAM,wCAEC,OAAdoE,EAAMiD,MACR2B,EAASlK,KAAK0B,iBAAiBd,EAAKC,EAAWC,EAAKa,IAQ1D,OAHuB,OAAnB2D,EAAMmD,WACRyB,EAASlK,KAAK0B,iBAAiB4D,EAAMmD,UAAU,EAAO,UAAWyB,IAE5DA,GAGTrK,EAAKwB,UAAUyK,cAAgB,SAAsBvK,EAAMR,GACzD,MAAMuE,EAAQtF,KAAKuF,WAEbqG,EAAOtG,EAAM8C,OAAO7G,EAAKsK,MAO/B,OANKD,GACHhE,GACE,EACArG,EAAKsK,KAAO,iBACNxI,KAAKC,UAAUpE,OAAOC,KAAKmG,EAAM8C,UAEpCwD,EAAKpK,QAAQD,EAAKjC,MAAOyB,IAGlClB,EAAKwB,UAAU0K,iBAAmB,SAAyBnL,EAAKW,GAC9D,MAAM+D,EAAQtF,KAAKuF,WAEnB,GAAI,OAAO3C,KAAKhC,GACd,OAAOZ,KAAKoC,WAAWb,EAAMX,GAC1B,GAAY,UAARA,GAAmB0E,EAAM4C,KAChC,OAAOlI,KAAK6C,aAAatB,EAAM+D,EAAM6C,YAAY,GAAI7C,EAAM4C,KAAK,IAC7D,GAAY,UAARtH,EACP,OAAOZ,KAAK6C,aAAatB,EAAM,KAAM,MAClC,GAAY,YAARX,GAA6B,YAARA,EAC5B,OAAOZ,KAAK4D,YAAYrC,EAAMX,GAC3B,GAAY,UAARA,EACP,OAAOZ,KAAKsE,cACT,GAAY,QAAR1D,GAAyB,SAARA,EACxB,OAAOZ,KAAKuE,WAAWhD,EAAM+D,EAAM4C,MAAQ5C,EAAM6C,YAAY,IAC1D,GAAY,SAARvH,EACP,OAAOZ,KAAKgF,YAAYzD,GACrB,GAAY,YAARX,EACP,OAAOZ,KAAKoC,WAAWb,EAAMX,GAE7B,MAAM,IAAI8I,MAAM,oBAAsB9I,IAG1Cf,EAAKwB,UAAUqB,UAAY,SAAkBL,GAC3C,MAAO,YAAYO,KAAKP,IAG1BxC,EAAKwB,UAAUsB,YAAc,SAAoBN,GAC/C,MAAO,6BAA6BO,KAAKP,K,oCC1nB3C,MAAM1C,EAAW,EAAQ,QAEnBG,EAAa,EAAQ,QAE3B,SAASkM,EAAWjM,GAClBD,EAAWU,KAAKR,KAAMD,GACtBC,KAAKC,IAAM,MAEbN,EAASqM,EAAYlM,GACrBsB,EAAOtC,QAAUkN,EAEjBA,EAAW3K,UAAUC,OAAS,SAAgBC,EAAM8E,GAClD,MAAM9D,EAAMzC,EAAWuB,UAAUC,OAAOd,KAAKR,KAAMuB,GAE7C0K,EAAI1J,EAAI2J,SAAS,UACjBpH,EAAM,CAAE,cAAgBuB,EAAQ8F,MAAQ,SAC9C,IAAK,IAAIjK,EAAI,EAAGA,EAAI+J,EAAEpK,OAAQK,GAAK,GACjC4C,EAAIoE,KAAK+C,EAAE7I,MAAMlB,EAAGA,EAAI,KAE1B,OADA4C,EAAIoE,KAAK,YAAc7C,EAAQ8F,MAAQ,SAChCrH,EAAIrD,KAAK,Q,oCClBlB,SAAS2K,EAAQpN,GACf,MAAMC,EAAM,GAWZ,OATAC,OAAOC,KAAKH,GAAKI,SAAQ,SAASC,IAErB,EAANA,IAAYA,IACfA,GAAY,GAEd,MAAMC,EAAQN,EAAIK,GAClBJ,EAAIK,GAASD,KAGRJ,EAGTH,EAAQuN,SAAW,CACjBC,EAAG,YACHC,EAAG,cACHC,EAAG,UACHC,EAAG,WAEL3N,EAAQqC,eAAiBiL,EAAQtN,EAAQuN,UAEzCvN,EAAQ8B,IAAM,CACZ0L,EAAM,MACN,EAAM,OACN,EAAM,MACN,EAAM,SACN,EAAM,SACN,EAAM,QACN,EAAM,QACN,EAAM,UACN,EAAM,WACN,EAAM,OACN,GAAM,OACN,GAAM,QACN,GAAM,UACN,GAAM,cACN,GAAM,MACN,GAAM,MACN,GAAM,SACN,GAAM,WACN,GAAM,SACN,GAAM,WACN,GAAM,SACN,GAAM,UACN,GAAM,UACN,GAAM,WACN,GAAM,YACN,GAAM,SACN,GAAM,SACN,GAAM,UACN,GAAM,UAERxN,EAAQkC,UAAYoL,EAAQtN,EAAQ8B,M,qBCtDpCQ,EAAOtC,QAAU,CACf4N,IAAK,EACLC,QAAS,EACTC,QAAS,EACTC,UAAW,EACXC,YAAa,EACbC,KAAM,EACNC,IAAK,EACLC,iBAAkB,EAClBC,SAAU,EACVC,KAAM,EACNC,YAAa,GACbC,IAAK,GACLC,WAAY,GACZC,YAAa,GACbC,SAAU,GACVC,IAAK,GACLC,cAAe,GACfC,gBAAiB,GACjBC,UAAW,GACXC,eAAgB,GAChBC,UAAW,GACXC,QAAS,GACTC,gBAAiB,GACjBC,cAAe,GACfC,cAAe,GACfC,cAAe,GACfC,gBAAiB,GACjBC,gBAAiB,GACjBC,UAAW,GACXC,YAAa,GACbC,QAAS,M,oCChCX,MAAM7O,EAAW,EAAQ,QACnBC,EAAS,EAAQ,QAAgBA,OAEjC6O,EAAa,EAAQ,QAE3B,SAASC,EAAW3O,GAClB0O,EAAWjO,KAAKR,KAAMD,GACtBC,KAAKC,IAAM,MAEbN,EAAS+O,EAAYD,GACrBrN,EAAOtC,QAAU4P,EAEjBA,EAAWrN,UAAUsN,OAAS,SAAgBpN,EAAM8E,GAClD,MAAMuI,EAAQrN,EAAK2K,WAAWjJ,MAAM,YAE9BkJ,EAAQ9F,EAAQ8F,MAAM0C,cAEtBC,EAAK,kCACX,IAAIlE,GAAS,EACTmE,GAAO,EACX,IAAK,IAAI7M,EAAI,EAAGA,EAAI0M,EAAM/M,OAAQK,IAAK,CACrC,MAAMwJ,EAAQkD,EAAM1M,GAAGwJ,MAAMoD,GAC7B,GAAc,OAAVpD,GAGAA,EAAM,KAAOS,EAAjB,CAGA,IAAe,IAAXvB,EAIG,CACL,GAAiB,QAAbc,EAAM,GACR,MACFqD,EAAM7M,EACN,MAPA,GAAiB,UAAbwJ,EAAM,GACR,MACFd,EAAQ1I,GAQZ,IAAe,IAAX0I,IAAyB,IAATmE,EAClB,MAAM,IAAIrF,MAAM,8BAAgCyC,GAElD,MAAM6C,EAASJ,EAAMxL,MAAMwH,EAAQ,EAAGmE,GAAKtN,KAAK,IAEhDuN,EAAOC,QAAQ,kBAAmB,IAElC,MAAMlF,EAAQnK,EAAOiF,KAAKmK,EAAQ,UAClC,OAAOP,EAAWpN,UAAUsN,OAAOnO,KAAKR,KAAM+J,EAAO1D,K,qBC9CvDjF,EAAOtC,QAAU,CAEfoQ,oBAAqB,SAAUC,GAC7B,IAAInJ,EAAI,IAAI0D,MAGZ,OAFA1D,EAAE9F,KAAO,mBACT8F,EAAEoJ,QAAUD,GAAO,GACZnJ,K,uBCTX,2BACE,aAGA,SAAS4B,EAAQgC,EAAKuF,GACpB,IAAKvF,EAAK,MAAM,IAAIF,MAAMyF,GAAO,oBAKnC,SAASxP,EAAU0P,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAASnO,UAAYiO,EAAUjO,UAC/BgO,EAAKhO,UAAY,IAAImO,EACrBH,EAAKhO,UAAUsF,YAAc0I,EAK/B,SAASI,EAAIC,EAAQzJ,EAAM0J,GACzB,GAAIF,EAAGG,KAAKF,GACV,OAAOA,EAGT1P,KAAK6P,SAAW,EAChB7P,KAAK8P,MAAQ,KACb9P,KAAK6B,OAAS,EAGd7B,KAAK+P,IAAM,KAEI,OAAXL,IACW,OAATzJ,GAA0B,OAATA,IACnB0J,EAAS1J,EACTA,EAAO,IAGTjG,KAAKK,MAAMqP,GAAU,EAAGzJ,GAAQ,GAAI0J,GAAU,OAYlD,IAAI/P,EATkB,kBAAXwB,EACTA,EAAOtC,QAAU2Q,EAEjB3Q,EAAQ2Q,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGO,SAAW,GAGd,IACEpQ,EAAS,EAAQ,IAAUA,OAC3B,MAAOoG,IAoIT,SAASiK,EAAU5N,EAAKuI,EAAOmE,GAG7B,IAFA,IAAImB,EAAI,EACJC,EAAMC,KAAKC,IAAIhO,EAAIR,OAAQkN,GACtB7M,EAAI0I,EAAO1I,EAAIiO,EAAKjO,IAAK,CAChC,IAAIoO,EAAIjO,EAAII,WAAWP,GAAK,GAE5BgO,IAAM,EAIJA,GADEI,GAAK,IAAMA,GAAK,GACbA,EAAI,GAAK,GAGLA,GAAK,IAAMA,GAAK,GACpBA,EAAI,GAAK,GAIL,GAAJA,EAGT,OAAOJ,EAiCT,SAASK,EAAWlO,EAAKuI,EAAOmE,EAAKyB,GAGnC,IAFA,IAAIN,EAAI,EACJC,EAAMC,KAAKC,IAAIhO,EAAIR,OAAQkN,GACtB7M,EAAI0I,EAAO1I,EAAIiO,EAAKjO,IAAK,CAChC,IAAIoO,EAAIjO,EAAII,WAAWP,GAAK,GAE5BgO,GAAKM,EAIHN,GADEI,GAAK,GACFA,EAAI,GAAK,GAGLA,GAAK,GACTA,EAAI,GAAK,GAITA,EAGT,OAAOJ,EA5MTT,EAAGG,KAAO,SAAelP,GACvB,OAAIA,aAAe+O,GAIJ,OAAR/O,GAA+B,kBAARA,GAC5BA,EAAIiG,YAAYqJ,WAAaP,EAAGO,UAAY9M,MAAMC,QAAQzC,EAAIoP,QAGlEL,EAAGgB,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTlB,EAAGY,IAAM,SAAcK,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTlB,EAAGpO,UAAUhB,MAAQ,SAAeqP,EAAQzJ,EAAM0J,GAChD,GAAsB,kBAAXD,EACT,OAAO1P,KAAK6Q,YAAYnB,EAAQzJ,EAAM0J,GAGxC,GAAsB,kBAAXD,EACT,OAAO1P,KAAK8Q,WAAWpB,EAAQzJ,EAAM0J,GAG1B,QAAT1J,IACFA,EAAO,IAET2B,EAAO3B,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAEnDyJ,EAASA,EAAOxD,WAAW+C,QAAQ,OAAQ,IAC3C,IAAIrE,EAAQ,EACM,MAAd8E,EAAO,IACT9E,IAGW,KAAT3E,EACFjG,KAAK+Q,UAAUrB,EAAQ9E,GAEvB5K,KAAKgR,WAAWtB,EAAQzJ,EAAM2E,GAGd,MAAd8E,EAAO,KACT1P,KAAK6P,SAAW,GAGlB7P,KAAKiR,QAEU,OAAXtB,GAEJ3P,KAAK8Q,WAAW9Q,KAAK0E,UAAWuB,EAAM0J,IAGxCF,EAAGpO,UAAUwP,YAAc,SAAsBnB,EAAQzJ,EAAM0J,GACzDD,EAAS,IACX1P,KAAK6P,SAAW,EAChBH,GAAUA,GAERA,EAAS,UACX1P,KAAK8P,MAAQ,CAAW,SAATJ,GACf1P,KAAK6B,OAAS,GACL6N,EAAS,kBAClB1P,KAAK8P,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,UAEzB1P,KAAK6B,OAAS,IAEd+F,EAAO8H,EAAS,kBAChB1P,KAAK8P,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,SACvB,GAEF1P,KAAK6B,OAAS,GAGD,OAAX8N,GAGJ3P,KAAK8Q,WAAW9Q,KAAK0E,UAAWuB,EAAM0J,IAGxCF,EAAGpO,UAAUyP,WAAa,SAAqBpB,EAAQzJ,EAAM0J,GAG3D,GADA/H,EAAgC,kBAAlB8H,EAAO7N,QACjB6N,EAAO7N,QAAU,EAGnB,OAFA7B,KAAK8P,MAAQ,CAAE,GACf9P,KAAK6B,OAAS,EACP7B,KAGTA,KAAK6B,OAASuO,KAAKc,KAAKxB,EAAO7N,OAAS,GACxC7B,KAAK8P,MAAQ,IAAI5M,MAAMlD,KAAK6B,QAC5B,IAAK,IAAIK,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAC/BlC,KAAK8P,MAAM5N,GAAK,EAGlB,IAAIC,EAAGgP,EACHC,EAAM,EACV,GAAe,OAAXzB,EACF,IAAKzN,EAAIwN,EAAO7N,OAAS,EAAGM,EAAI,EAAGD,GAAK,EAAGA,GAAK,EAC9CiP,EAAIzB,EAAOxN,GAAMwN,EAAOxN,EAAI,IAAM,EAAMwN,EAAOxN,EAAI,IAAM,GACzDlC,KAAK8P,MAAM3N,IAAOgP,GAAKC,EAAO,SAC9BpR,KAAK8P,MAAM3N,EAAI,GAAMgP,IAAO,GAAKC,EAAQ,SACzCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPjP,UAGC,GAAe,OAAXwN,EACT,IAAKzN,EAAI,EAAGC,EAAI,EAAGD,EAAIwN,EAAO7N,OAAQK,GAAK,EACzCiP,EAAIzB,EAAOxN,GAAMwN,EAAOxN,EAAI,IAAM,EAAMwN,EAAOxN,EAAI,IAAM,GACzDlC,KAAK8P,MAAM3N,IAAOgP,GAAKC,EAAO,SAC9BpR,KAAK8P,MAAM3N,EAAI,GAAMgP,IAAO,GAAKC,EAAQ,SACzCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPjP,KAIN,OAAOnC,KAAKiR,SA2BdxB,EAAGpO,UAAU0P,UAAY,SAAoBrB,EAAQ9E,GAEnD5K,KAAK6B,OAASuO,KAAKc,MAAMxB,EAAO7N,OAAS+I,GAAS,GAClD5K,KAAK8P,MAAQ,IAAI5M,MAAMlD,KAAK6B,QAC5B,IAAK,IAAIK,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAC/BlC,KAAK8P,MAAM5N,GAAK,EAGlB,IAAIC,EAAGgP,EAEHC,EAAM,EACV,IAAKlP,EAAIwN,EAAO7N,OAAS,EAAGM,EAAI,EAAGD,GAAK0I,EAAO1I,GAAK,EAClDiP,EAAIlB,EAASP,EAAQxN,EAAGA,EAAI,GAC5BlC,KAAK8P,MAAM3N,IAAOgP,GAAKC,EAAO,SAE9BpR,KAAK8P,MAAM3N,EAAI,IAAMgP,IAAO,GAAKC,EAAO,QACxCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPjP,KAGAD,EAAI,IAAM0I,IACZuG,EAAIlB,EAASP,EAAQ9E,EAAO1I,EAAI,GAChClC,KAAK8P,MAAM3N,IAAOgP,GAAKC,EAAO,SAC9BpR,KAAK8P,MAAM3N,EAAI,IAAMgP,IAAO,GAAKC,EAAO,SAE1CpR,KAAKiR,SA2BPxB,EAAGpO,UAAU2P,WAAa,SAAqBtB,EAAQzJ,EAAM2E,GAE3D5K,KAAK8P,MAAQ,CAAE,GACf9P,KAAK6B,OAAS,EAGd,IAAK,IAAIwP,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWrL,EAClEoL,IAEFA,IACAC,EAAWA,EAAUrL,EAAQ,EAO7B,IALA,IAAIsL,EAAQ7B,EAAO7N,OAAS+I,EACxB4G,EAAMD,EAAQF,EACdtC,EAAMqB,KAAKC,IAAIkB,EAAOA,EAAQC,GAAO5G,EAErC6G,EAAO,EACFvP,EAAI0I,EAAO1I,EAAI6M,EAAK7M,GAAKmP,EAChCI,EAAOlB,EAAUb,EAAQxN,EAAGA,EAAImP,EAASpL,GAEzCjG,KAAK0R,MAAMJ,GACPtR,KAAK8P,MAAM,GAAK2B,EAAO,SACzBzR,KAAK8P,MAAM,IAAM2B,EAEjBzR,KAAK2R,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAOlB,EAAUb,EAAQxN,EAAGwN,EAAO7N,OAAQoE,GAEtC/D,EAAI,EAAGA,EAAIsP,EAAKtP,IACnB0P,GAAO3L,EAGTjG,KAAK0R,MAAME,GACP5R,KAAK8P,MAAM,GAAK2B,EAAO,SACzBzR,KAAK8P,MAAM,IAAM2B,EAEjBzR,KAAK2R,OAAOF,KAKlBhC,EAAGpO,UAAU0D,KAAO,SAAe8M,GACjCA,EAAK/B,MAAQ,IAAI5M,MAAMlD,KAAK6B,QAC5B,IAAK,IAAIK,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAC/B2P,EAAK/B,MAAM5N,GAAKlC,KAAK8P,MAAM5N,GAE7B2P,EAAKhQ,OAAS7B,KAAK6B,OACnBgQ,EAAKhC,SAAW7P,KAAK6P,SACrBgC,EAAK9B,IAAM/P,KAAK+P,KAGlBN,EAAGpO,UAAUyH,MAAQ,WACnB,IAAIoH,EAAI,IAAIT,EAAG,MAEf,OADAzP,KAAK+E,KAAKmL,GACHA,GAGTT,EAAGpO,UAAUyQ,QAAU,SAAkBtO,GACvC,MAAOxD,KAAK6B,OAAS2B,EACnBxD,KAAK8P,MAAM9P,KAAK6B,UAAY,EAE9B,OAAO7B,MAITyP,EAAGpO,UAAU4P,MAAQ,WACnB,MAAOjR,KAAK6B,OAAS,GAAqC,IAAhC7B,KAAK8P,MAAM9P,KAAK6B,OAAS,GACjD7B,KAAK6B,SAEP,OAAO7B,KAAK+R,aAGdtC,EAAGpO,UAAU0Q,UAAY,WAKvB,OAHoB,IAAhB/R,KAAK6B,QAAkC,IAAlB7B,KAAK8P,MAAM,KAClC9P,KAAK6P,SAAW,GAEX7P,MAGTyP,EAAGpO,UAAU2Q,QAAU,WACrB,OAAQhS,KAAK+P,IAAM,UAAY,SAAW/P,KAAKkM,SAAS,IAAM,KAiChE,IAAI+F,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UAyM9D,SAASC,EAAY1R,GAGnB,IAFA,IAAIyQ,EAAI,IAAIjO,MAAMxC,EAAI2R,aAEbC,EAAM,EAAGA,EAAMnB,EAAEtP,OAAQyQ,IAAO,CACvC,IAAIlB,EAAOkB,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjBnB,EAAEmB,IAAQ5R,EAAIoP,MAAMsB,GAAQ,GAAKmB,KAAWA,EAG9C,OAAOpB,EAmWT,SAASqB,EAAYC,EAAM/R,EAAKoE,GAC9BA,EAAI+K,SAAWnP,EAAImP,SAAW4C,EAAK5C,SACnC,IAAIM,EAAOsC,EAAK5Q,OAASnB,EAAImB,OAAU,EACvCiD,EAAIjD,OAASsO,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIuC,EAAoB,EAAhBD,EAAK3C,MAAM,GACf6C,EAAmB,EAAfjS,EAAIoP,MAAM,GACdI,EAAIwC,EAAIC,EAERC,EAAS,SAAJ1C,EACL2C,EAAS3C,EAAI,SAAa,EAC9BpL,EAAIgL,MAAM,GAAK8C,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAI3C,EAAK2C,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAO7C,KAAKC,IAAIyC,EAAGpS,EAAImB,OAAS,GAC3BM,EAAIiO,KAAKK,IAAI,EAAGqC,EAAIL,EAAK5Q,OAAS,GAAIM,GAAK8Q,EAAM9Q,IAAK,CAC7D,IAAID,EAAK4Q,EAAI3Q,EAAK,EAClBuQ,EAAoB,EAAhBD,EAAK3C,MAAM5N,GACfyQ,EAAmB,EAAfjS,EAAIoP,MAAM3N,GACd+N,EAAIwC,EAAIC,EAAIK,EACZD,GAAW7C,EAAI,SAAa,EAC5B8C,EAAY,SAAJ9C,EAEVpL,EAAIgL,MAAMgD,GAAa,EAARE,EACfH,EAAiB,EAATE,EAQV,OANc,IAAVF,EACF/N,EAAIgL,MAAMgD,GAAa,EAARD,EAEf/N,EAAIjD,SAGCiD,EAAImM,QAzlBbxB,EAAGpO,UAAU6K,SAAW,SAAmBjG,EAAMiN,GAI/C,IAAIpO,EACJ,GAJAmB,EAAOA,GAAQ,GACfiN,EAAoB,EAAVA,GAAe,EAGZ,KAATjN,GAAwB,QAATA,EAAgB,CACjCnB,EAAM,GAGN,IAFA,IAAIsM,EAAM,EACNyB,EAAQ,EACH3Q,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAAK,CACpC,IAAIiP,EAAInR,KAAK8P,MAAM5N,GACfuP,GAA+B,UAArBN,GAAKC,EAAOyB,IAAmB3G,SAAS,IACtD2G,EAAS1B,IAAO,GAAKC,EAAQ,SAE3BtM,EADY,IAAV+N,GAAe3Q,IAAMlC,KAAK6B,OAAS,EAC/BoQ,EAAM,EAAIR,EAAK5P,QAAU4P,EAAO3M,EAEhC2M,EAAO3M,EAEfsM,GAAO,EACHA,GAAO,KACTA,GAAO,GACPlP,KAGU,IAAV2Q,IACF/N,EAAM+N,EAAM3G,SAAS,IAAMpH,GAE7B,MAAOA,EAAIjD,OAASqR,IAAY,EAC9BpO,EAAM,IAAMA,EAKd,OAHsB,IAAlB9E,KAAK6P,WACP/K,EAAM,IAAMA,GAEPA,EAGT,GAAImB,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAIkN,EAAYjB,EAAWjM,GAEvBmN,EAAYjB,EAAWlM,GAC3BnB,EAAM,GACN,IAAIwL,EAAItQ,KAAK8I,QACbwH,EAAET,SAAW,EACb,OAAQS,EAAE+C,SAAU,CAClB,IAAInD,EAAII,EAAEgD,KAAKF,GAAWlH,SAASjG,GACnCqK,EAAIA,EAAEiD,MAAMH,GAKVtO,EAHGwL,EAAE+C,SAGCnD,EAAIpL,EAFJmN,EAAMkB,EAAYjD,EAAErO,QAAUqO,EAAIpL,EAKxC9E,KAAKqT,WACPvO,EAAM,IAAMA,GAEd,MAAOA,EAAIjD,OAASqR,IAAY,EAC9BpO,EAAM,IAAMA,EAKd,OAHsB,IAAlB9E,KAAK6P,WACP/K,EAAM,IAAMA,GAEPA,EAGT8C,GAAO,EAAO,oCAGhB6H,EAAGpO,UAAUmS,SAAW,WACtB,IAAIC,EAAMzT,KAAK8P,MAAM,GASrB,OARoB,IAAhB9P,KAAK6B,OACP4R,GAAuB,SAAhBzT,KAAK8P,MAAM,GACO,IAAhB9P,KAAK6B,QAAkC,IAAlB7B,KAAK8P,MAAM,GAEzC2D,GAAO,iBAAoC,SAAhBzT,KAAK8P,MAAM,GAC7B9P,KAAK6B,OAAS,GACvB+F,GAAO,EAAO,8CAEU,IAAlB5H,KAAK6P,UAAmB4D,EAAMA,GAGxChE,EAAGpO,UAAUqS,OAAS,WACpB,OAAO1T,KAAKkM,SAAS,KAGvBuD,EAAGpO,UAAUsS,SAAW,SAAmBhE,EAAQ9N,GAEjD,OADA+F,EAAyB,qBAAXhI,GACPI,KAAK4T,YAAYhU,EAAQ+P,EAAQ9N,IAG1C4N,EAAGpO,UAAUqD,QAAU,SAAkBiL,EAAQ9N,GAC/C,OAAO7B,KAAK4T,YAAY1Q,MAAOyM,EAAQ9N,IAGzC4N,EAAGpO,UAAUuS,YAAc,SAAsBC,EAAWlE,EAAQ9N,GAClE,IAAI2E,EAAaxG,KAAKwG,aAClBsN,EAAYjS,GAAUuO,KAAKK,IAAI,EAAGjK,GACtCoB,EAAOpB,GAAcsN,EAAW,yCAChClM,EAAOkM,EAAY,EAAG,+BAEtB9T,KAAKiR,QACL,IAGI0B,EAAGzQ,EAHH6R,EAA0B,OAAXpE,EACf1Q,EAAM,IAAI4U,EAAUC,GAGpBE,EAAIhU,KAAK8I,QACb,GAAKiL,EAYE,CACL,IAAK7R,EAAI,GAAI8R,EAAEX,SAAUnR,IACvByQ,EAAIqB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETjV,EAAIiD,GAAKyQ,EAGX,KAAOzQ,EAAI4R,EAAW5R,IACpBjD,EAAIiD,GAAK,MArBM,CAEjB,IAAKA,EAAI,EAAGA,EAAI4R,EAAYtN,EAAYtE,IACtCjD,EAAIiD,GAAK,EAGX,IAAKA,EAAI,GAAI8R,EAAEX,SAAUnR,IACvByQ,EAAIqB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETjV,EAAI6U,EAAY5R,EAAI,GAAKyQ,EAe7B,OAAO1T,GAGLmR,KAAK+D,MACP1E,EAAGpO,UAAU+S,WAAa,SAAqBjD,GAC7C,OAAO,GAAKf,KAAK+D,MAAMhD,IAGzB1B,EAAGpO,UAAU+S,WAAa,SAAqBjD,GAC7C,IAAIpL,EAAIoL,EACJjB,EAAI,EAiBR,OAhBInK,GAAK,OACPmK,GAAK,GACLnK,KAAO,IAELA,GAAK,KACPmK,GAAK,EACLnK,KAAO,GAELA,GAAK,IACPmK,GAAK,EACLnK,KAAO,GAELA,GAAK,IACPmK,GAAK,EACLnK,KAAO,GAEFmK,EAAInK,GAIf0J,EAAGpO,UAAUgT,UAAY,SAAoBlD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAIpL,EAAIoL,EACJjB,EAAI,EAoBR,OAnBqB,KAAZ,KAAJnK,KACHmK,GAAK,GACLnK,KAAO,IAEU,KAAV,IAAJA,KACHmK,GAAK,EACLnK,KAAO,GAES,KAAT,GAAJA,KACHmK,GAAK,EACLnK,KAAO,GAES,KAAT,EAAJA,KACHmK,GAAK,EACLnK,KAAO,GAES,KAAT,EAAJA,IACHmK,IAEKA,GAITT,EAAGpO,UAAUgR,UAAY,WACvB,IAAIlB,EAAInR,KAAK8P,MAAM9P,KAAK6B,OAAS,GAC7ByS,EAAKtU,KAAKoU,WAAWjD,GACzB,OAA2B,IAAnBnR,KAAK6B,OAAS,GAAUyS,GAiBlC7E,EAAGpO,UAAUkT,SAAW,WACtB,GAAIvU,KAAKqT,SAAU,OAAO,EAG1B,IADA,IAAInD,EAAI,EACChO,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAAK,CACpC,IAAIyQ,EAAI3S,KAAKqU,UAAUrU,KAAK8P,MAAM5N,IAElC,GADAgO,GAAKyC,EACK,KAANA,EAAU,MAEhB,OAAOzC,GAGTT,EAAGpO,UAAUmF,WAAa,WACxB,OAAO4J,KAAKc,KAAKlR,KAAKqS,YAAc,IAGtC5C,EAAGpO,UAAUmT,OAAS,SAAiBC,GACrC,OAAsB,IAAlBzU,KAAK6P,SACA7P,KAAK0U,MAAMC,MAAMF,GAAOG,MAAM,GAEhC5U,KAAK8I,SAGd2G,EAAGpO,UAAUwT,SAAW,SAAmBJ,GACzC,OAAIzU,KAAK8U,MAAML,EAAQ,GACdzU,KAAK+U,KAAKN,GAAOG,MAAM,GAAGI,OAE5BhV,KAAK8I,SAGd2G,EAAGpO,UAAU4T,MAAQ,WACnB,OAAyB,IAAlBjV,KAAK6P,UAIdJ,EAAGpO,UAAU6T,IAAM,WACjB,OAAOlV,KAAK8I,QAAQkM,QAGtBvF,EAAGpO,UAAU2T,KAAO,WAKlB,OAJKhV,KAAKqT,WACRrT,KAAK6P,UAAY,GAGZ7P,MAITyP,EAAGpO,UAAU8T,KAAO,SAAezU,GACjC,MAAOV,KAAK6B,OAASnB,EAAImB,OACvB7B,KAAK8P,MAAM9P,KAAK6B,UAAY,EAG9B,IAAK,IAAIK,EAAI,EAAGA,EAAIxB,EAAImB,OAAQK,IAC9BlC,KAAK8P,MAAM5N,GAAKlC,KAAK8P,MAAM5N,GAAKxB,EAAIoP,MAAM5N,GAG5C,OAAOlC,KAAKiR,SAGdxB,EAAGpO,UAAU+T,IAAM,SAAc1U,GAE/B,OADAkH,EAA0C,KAAlC5H,KAAK6P,SAAWnP,EAAImP,WACrB7P,KAAKmV,KAAKzU,IAInB+O,EAAGpO,UAAUgU,GAAK,SAAa3U,GAC7B,OAAIV,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAK8I,QAAQsM,IAAI1U,GAC/CA,EAAIoI,QAAQsM,IAAIpV,OAGzByP,EAAGpO,UAAUiU,IAAM,SAAc5U,GAC/B,OAAIV,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAK8I,QAAQqM,KAAKzU,GAChDA,EAAIoI,QAAQqM,KAAKnV,OAI1ByP,EAAGpO,UAAUkU,MAAQ,SAAgB7U,GAEnC,IAAIiS,EAEFA,EADE3S,KAAK6B,OAASnB,EAAImB,OAChBnB,EAEAV,KAGN,IAAK,IAAIkC,EAAI,EAAGA,EAAIyQ,EAAE9Q,OAAQK,IAC5BlC,KAAK8P,MAAM5N,GAAKlC,KAAK8P,MAAM5N,GAAKxB,EAAIoP,MAAM5N,GAK5C,OAFAlC,KAAK6B,OAAS8Q,EAAE9Q,OAET7B,KAAKiR,SAGdxB,EAAGpO,UAAUmU,KAAO,SAAe9U,GAEjC,OADAkH,EAA0C,KAAlC5H,KAAK6P,SAAWnP,EAAImP,WACrB7P,KAAKuV,MAAM7U,IAIpB+O,EAAGpO,UAAUoU,IAAM,SAAc/U,GAC/B,OAAIV,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAK8I,QAAQ0M,KAAK9U,GAChDA,EAAIoI,QAAQ0M,KAAKxV,OAG1ByP,EAAGpO,UAAUqU,KAAO,SAAehV,GACjC,OAAIV,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAK8I,QAAQyM,MAAM7U,GACjDA,EAAIoI,QAAQyM,MAAMvV,OAI3ByP,EAAGpO,UAAUsU,MAAQ,SAAgBjV,GAEnC,IAAIgS,EACAC,EACA3S,KAAK6B,OAASnB,EAAImB,QACpB6Q,EAAI1S,KACJ2S,EAAIjS,IAEJgS,EAAIhS,EACJiS,EAAI3S,MAGN,IAAK,IAAIkC,EAAI,EAAGA,EAAIyQ,EAAE9Q,OAAQK,IAC5BlC,KAAK8P,MAAM5N,GAAKwQ,EAAE5C,MAAM5N,GAAKyQ,EAAE7C,MAAM5N,GAGvC,GAAIlC,OAAS0S,EACX,KAAOxQ,EAAIwQ,EAAE7Q,OAAQK,IACnBlC,KAAK8P,MAAM5N,GAAKwQ,EAAE5C,MAAM5N,GAM5B,OAFAlC,KAAK6B,OAAS6Q,EAAE7Q,OAET7B,KAAKiR,SAGdxB,EAAGpO,UAAUuU,KAAO,SAAelV,GAEjC,OADAkH,EAA0C,KAAlC5H,KAAK6P,SAAWnP,EAAImP,WACrB7P,KAAK2V,MAAMjV,IAIpB+O,EAAGpO,UAAUwU,IAAM,SAAcnV,GAC/B,OAAIV,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAK8I,QAAQ8M,KAAKlV,GAChDA,EAAIoI,QAAQ8M,KAAK5V,OAG1ByP,EAAGpO,UAAUyU,KAAO,SAAepV,GACjC,OAAIV,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAK8I,QAAQ6M,MAAMjV,GACjDA,EAAIoI,QAAQ6M,MAAM3V,OAI3ByP,EAAGpO,UAAUsT,MAAQ,SAAgBF,GACnC7M,EAAwB,kBAAV6M,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxB3F,KAAKc,KAAKuD,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvBzU,KAAK8R,QAAQiE,GAETC,EAAW,GACbD,IAIF,IAAK,IAAI7T,EAAI,EAAGA,EAAI6T,EAAa7T,IAC/BlC,KAAK8P,MAAM5N,GAAsB,UAAhBlC,KAAK8P,MAAM5N,GAS9B,OALI8T,EAAW,IACbhW,KAAK8P,MAAM5N,IAAMlC,KAAK8P,MAAM5N,GAAM,UAAc,GAAK8T,GAIhDhW,KAAKiR,SAGdxB,EAAGpO,UAAU0T,KAAO,SAAeN,GACjC,OAAOzU,KAAK8I,QAAQ6L,MAAMF,IAI5BhF,EAAGpO,UAAU4U,KAAO,SAAe3D,EAAK1I,GACtChC,EAAsB,kBAAR0K,GAAoBA,GAAO,GAEzC,IAAIlB,EAAOkB,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARAtS,KAAK8R,QAAQV,EAAM,GAGjBpR,KAAK8P,MAAMsB,GADTxH,EACgB5J,KAAK8P,MAAMsB,GAAQ,GAAKmB,EAExBvS,KAAK8P,MAAMsB,KAAS,GAAKmB,GAGtCvS,KAAKiR,SAIdxB,EAAGpO,UAAU6U,KAAO,SAAexV,GACjC,IAAIwP,EAkBAwC,EAAGC,EAfP,GAAsB,IAAlB3S,KAAK6P,UAAmC,IAAjBnP,EAAImP,SAI7B,OAHA7P,KAAK6P,SAAW,EAChBK,EAAIlQ,KAAKmW,KAAKzV,GACdV,KAAK6P,UAAY,EACV7P,KAAK+R,YAGP,GAAsB,IAAlB/R,KAAK6P,UAAmC,IAAjBnP,EAAImP,SAIpC,OAHAnP,EAAImP,SAAW,EACfK,EAAIlQ,KAAKmW,KAAKzV,GACdA,EAAImP,SAAW,EACRK,EAAE6B,YAKP/R,KAAK6B,OAASnB,EAAImB,QACpB6Q,EAAI1S,KACJ2S,EAAIjS,IAEJgS,EAAIhS,EACJiS,EAAI3S,MAIN,IADA,IAAI6S,EAAQ,EACH3Q,EAAI,EAAGA,EAAIyQ,EAAE9Q,OAAQK,IAC5BgO,GAAkB,EAAbwC,EAAE5C,MAAM5N,KAAwB,EAAbyQ,EAAE7C,MAAM5N,IAAU2Q,EAC1C7S,KAAK8P,MAAM5N,GAAS,SAAJgO,EAChB2C,EAAQ3C,IAAM,GAEhB,KAAiB,IAAV2C,GAAe3Q,EAAIwQ,EAAE7Q,OAAQK,IAClCgO,GAAkB,EAAbwC,EAAE5C,MAAM5N,IAAU2Q,EACvB7S,KAAK8P,MAAM5N,GAAS,SAAJgO,EAChB2C,EAAQ3C,IAAM,GAIhB,GADAlQ,KAAK6B,OAAS6Q,EAAE7Q,OACF,IAAVgR,EACF7S,KAAK8P,MAAM9P,KAAK6B,QAAUgR,EAC1B7S,KAAK6B,cAEA,GAAI6Q,IAAM1S,KACf,KAAOkC,EAAIwQ,EAAE7Q,OAAQK,IACnBlC,KAAK8P,MAAM5N,GAAKwQ,EAAE5C,MAAM5N,GAI5B,OAAOlC,MAITyP,EAAGpO,UAAU+U,IAAM,SAAc1V,GAC/B,IAAIzB,EACJ,OAAqB,IAAjByB,EAAImP,UAAoC,IAAlB7P,KAAK6P,UAC7BnP,EAAImP,SAAW,EACf5Q,EAAMe,KAAKqW,IAAI3V,GACfA,EAAImP,UAAY,EACT5Q,GACmB,IAAjByB,EAAImP,UAAoC,IAAlB7P,KAAK6P,UACpC7P,KAAK6P,SAAW,EAChB5Q,EAAMyB,EAAI2V,IAAIrW,MACdA,KAAK6P,SAAW,EACT5Q,GAGLe,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAK8I,QAAQoN,KAAKxV,GAEhDA,EAAIoI,QAAQoN,KAAKlW,OAI1ByP,EAAGpO,UAAU8U,KAAO,SAAezV,GAEjC,GAAqB,IAAjBA,EAAImP,SAAgB,CACtBnP,EAAImP,SAAW,EACf,IAAIK,EAAIlQ,KAAKkW,KAAKxV,GAElB,OADAA,EAAImP,SAAW,EACRK,EAAE6B,YAGJ,GAAsB,IAAlB/R,KAAK6P,SAId,OAHA7P,KAAK6P,SAAW,EAChB7P,KAAKkW,KAAKxV,GACVV,KAAK6P,SAAW,EACT7P,KAAK+R,YAId,IAWIW,EAAGC,EAXH/B,EAAM5Q,KAAK4Q,IAAIlQ,GAGnB,GAAY,IAARkQ,EAIF,OAHA5Q,KAAK6P,SAAW,EAChB7P,KAAK6B,OAAS,EACd7B,KAAK8P,MAAM,GAAK,EACT9P,KAKL4Q,EAAM,GACR8B,EAAI1S,KACJ2S,EAAIjS,IAEJgS,EAAIhS,EACJiS,EAAI3S,MAIN,IADA,IAAI6S,EAAQ,EACH3Q,EAAI,EAAGA,EAAIyQ,EAAE9Q,OAAQK,IAC5BgO,GAAkB,EAAbwC,EAAE5C,MAAM5N,KAAwB,EAAbyQ,EAAE7C,MAAM5N,IAAU2Q,EAC1CA,EAAQ3C,GAAK,GACblQ,KAAK8P,MAAM5N,GAAS,SAAJgO,EAElB,KAAiB,IAAV2C,GAAe3Q,EAAIwQ,EAAE7Q,OAAQK,IAClCgO,GAAkB,EAAbwC,EAAE5C,MAAM5N,IAAU2Q,EACvBA,EAAQ3C,GAAK,GACblQ,KAAK8P,MAAM5N,GAAS,SAAJgO,EAIlB,GAAc,IAAV2C,GAAe3Q,EAAIwQ,EAAE7Q,QAAU6Q,IAAM1S,KACvC,KAAOkC,EAAIwQ,EAAE7Q,OAAQK,IACnBlC,KAAK8P,MAAM5N,GAAKwQ,EAAE5C,MAAM5N,GAU5B,OANAlC,KAAK6B,OAASuO,KAAKK,IAAIzQ,KAAK6B,OAAQK,GAEhCwQ,IAAM1S,OACRA,KAAK6P,SAAW,GAGX7P,KAAKiR,SAIdxB,EAAGpO,UAAUgV,IAAM,SAAc3V,GAC/B,OAAOV,KAAK8I,QAAQqN,KAAKzV,IA+C3B,IAAI4V,EAAc,SAAsB7D,EAAM/R,EAAKoE,GACjD,IAII8N,EACA2D,EACAjC,EANA5B,EAAID,EAAK3C,MACT6C,EAAIjS,EAAIoP,MACR0G,EAAI1R,EAAIgL,MACRQ,EAAI,EAIJmG,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,GAEjBpV,EAAI+K,SAAW4C,EAAK5C,SAAWnP,EAAImP,SACnC/K,EAAIjD,OAAS,GAEb+Q,EAAKxC,KAAKiK,KAAK3D,EAAK8B,GACpBjC,EAAMnG,KAAKiK,KAAK3D,EAAK+B,GACrBlC,EAAOA,EAAMnG,KAAKiK,KAAK1D,EAAK6B,GAAQ,EACpClE,EAAKlE,KAAKiK,KAAK1D,EAAK8B,GACpB,IAAI6B,IAAQhK,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrDjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAM+D,KAAO,IAAO,EAChDA,IAAM,SAEN1H,EAAKxC,KAAKiK,KAAKxD,EAAK2B,GACpBjC,EAAMnG,KAAKiK,KAAKxD,EAAK4B,GACrBlC,EAAOA,EAAMnG,KAAKiK,KAAKvD,EAAK0B,GAAQ,EACpClE,EAAKlE,KAAKiK,KAAKvD,EAAK2B,GACpB7F,EAAMA,EAAKxC,KAAKiK,KAAK3D,EAAKiC,GAAQ,EAClCpC,EAAOA,EAAMnG,KAAKiK,KAAK3D,EAAKkC,GAAQ,EACpCrC,EAAOA,EAAMnG,KAAKiK,KAAK1D,EAAKgC,GAAQ,EACpCrE,EAAMA,EAAKlE,KAAKiK,KAAK1D,EAAKiC,GAAQ,EAClC,IAAI2B,IAAQjK,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrDjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAEN3H,EAAKxC,KAAKiK,KAAKrD,EAAKwB,GACpBjC,EAAMnG,KAAKiK,KAAKrD,EAAKyB,GACrBlC,EAAOA,EAAMnG,KAAKiK,KAAKpD,EAAKuB,GAAQ,EACpClE,EAAKlE,KAAKiK,KAAKpD,EAAKwB,GACpB7F,EAAMA,EAAKxC,KAAKiK,KAAKxD,EAAK8B,GAAQ,EAClCpC,EAAOA,EAAMnG,KAAKiK,KAAKxD,EAAK+B,GAAQ,EACpCrC,EAAOA,EAAMnG,KAAKiK,KAAKvD,EAAK6B,GAAQ,EACpCrE,EAAMA,EAAKlE,KAAKiK,KAAKvD,EAAK8B,GAAQ,EAClChG,EAAMA,EAAKxC,KAAKiK,KAAK3D,EAAKoC,GAAQ,EAClCvC,EAAOA,EAAMnG,KAAKiK,KAAK3D,EAAKqC,GAAQ,EACpCxC,EAAOA,EAAMnG,KAAKiK,KAAK1D,EAAKmC,GAAQ,EACpCxE,EAAMA,EAAKlE,KAAKiK,KAAK1D,EAAKoC,GAAQ,EAClC,IAAIyB,IAAQlK,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrDjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAEN5H,EAAKxC,KAAKiK,KAAKlD,EAAKqB,GACpBjC,EAAMnG,KAAKiK,KAAKlD,EAAKsB,GACrBlC,EAAOA,EAAMnG,KAAKiK,KAAKjD,EAAKoB,GAAQ,EACpClE,EAAKlE,KAAKiK,KAAKjD,EAAKqB,GACpB7F,EAAMA,EAAKxC,KAAKiK,KAAKrD,EAAK2B,GAAQ,EAClCpC,EAAOA,EAAMnG,KAAKiK,KAAKrD,EAAK4B,GAAQ,EACpCrC,EAAOA,EAAMnG,KAAKiK,KAAKpD,EAAK0B,GAAQ,EACpCrE,EAAMA,EAAKlE,KAAKiK,KAAKpD,EAAK2B,GAAQ,EAClChG,EAAMA,EAAKxC,KAAKiK,KAAKxD,EAAKiC,GAAQ,EAClCvC,EAAOA,EAAMnG,KAAKiK,KAAKxD,EAAKkC,GAAQ,EACpCxC,EAAOA,EAAMnG,KAAKiK,KAAKvD,EAAKgC,GAAQ,EACpCxE,EAAMA,EAAKlE,KAAKiK,KAAKvD,EAAKiC,GAAQ,EAClCnG,EAAMA,EAAKxC,KAAKiK,KAAK3D,EAAKuC,GAAQ,EAClC1C,EAAOA,EAAMnG,KAAKiK,KAAK3D,EAAKwC,GAAQ,EACpC3C,EAAOA,EAAMnG,KAAKiK,KAAK1D,EAAKsC,GAAQ,EACpC3E,EAAMA,EAAKlE,KAAKiK,KAAK1D,EAAKuC,GAAQ,EAClC,IAAIuB,IAAQnK,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrDjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAEN7H,EAAKxC,KAAKiK,KAAK/C,EAAKkB,GACpBjC,EAAMnG,KAAKiK,KAAK/C,EAAKmB,GACrBlC,EAAOA,EAAMnG,KAAKiK,KAAK9C,EAAKiB,GAAQ,EACpClE,EAAKlE,KAAKiK,KAAK9C,EAAKkB,GACpB7F,EAAMA,EAAKxC,KAAKiK,KAAKlD,EAAKwB,GAAQ,EAClCpC,EAAOA,EAAMnG,KAAKiK,KAAKlD,EAAKyB,GAAQ,EACpCrC,EAAOA,EAAMnG,KAAKiK,KAAKjD,EAAKuB,GAAQ,EACpCrE,EAAMA,EAAKlE,KAAKiK,KAAKjD,EAAKwB,GAAQ,EAClChG,EAAMA,EAAKxC,KAAKiK,KAAKrD,EAAK8B,GAAQ,EAClCvC,EAAOA,EAAMnG,KAAKiK,KAAKrD,EAAK+B,GAAQ,EACpCxC,EAAOA,EAAMnG,KAAKiK,KAAKpD,EAAK6B,GAAQ,EACpCxE,EAAMA,EAAKlE,KAAKiK,KAAKpD,EAAK8B,GAAQ,EAClCnG,EAAMA,EAAKxC,KAAKiK,KAAKxD,EAAKoC,GAAQ,EAClC1C,EAAOA,EAAMnG,KAAKiK,KAAKxD,EAAKqC,GAAQ,EACpC3C,EAAOA,EAAMnG,KAAKiK,KAAKvD,EAAKmC,GAAQ,EACpC3E,EAAMA,EAAKlE,KAAKiK,KAAKvD,EAAKoC,GAAQ,EAClCtG,EAAMA,EAAKxC,KAAKiK,KAAK3D,EAAK0C,GAAQ,EAClC7C,EAAOA,EAAMnG,KAAKiK,KAAK3D,EAAK2C,IAAQ,EACpC9C,EAAOA,EAAMnG,KAAKiK,KAAK1D,EAAKyC,GAAQ,EACpC9E,EAAMA,EAAKlE,KAAKiK,KAAK1D,EAAK0C,IAAQ,EAClC,IAAIqB,IAAQpK,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrDjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAEN9H,EAAKxC,KAAKiK,KAAK5C,EAAKe,GACpBjC,EAAMnG,KAAKiK,KAAK5C,EAAKgB,GACrBlC,EAAOA,EAAMnG,KAAKiK,KAAK3C,EAAKc,GAAQ,EACpClE,EAAKlE,KAAKiK,KAAK3C,EAAKe,GACpB7F,EAAMA,EAAKxC,KAAKiK,KAAK/C,EAAKqB,GAAQ,EAClCpC,EAAOA,EAAMnG,KAAKiK,KAAK/C,EAAKsB,GAAQ,EACpCrC,EAAOA,EAAMnG,KAAKiK,KAAK9C,EAAKoB,GAAQ,EACpCrE,EAAMA,EAAKlE,KAAKiK,KAAK9C,EAAKqB,GAAQ,EAClChG,EAAMA,EAAKxC,KAAKiK,KAAKlD,EAAK2B,GAAQ,EAClCvC,EAAOA,EAAMnG,KAAKiK,KAAKlD,EAAK4B,GAAQ,EACpCxC,EAAOA,EAAMnG,KAAKiK,KAAKjD,EAAK0B,GAAQ,EACpCxE,EAAMA,EAAKlE,KAAKiK,KAAKjD,EAAK2B,GAAQ,EAClCnG,EAAMA,EAAKxC,KAAKiK,KAAKrD,EAAKiC,GAAQ,EAClC1C,EAAOA,EAAMnG,KAAKiK,KAAKrD,EAAKkC,GAAQ,EACpC3C,EAAOA,EAAMnG,KAAKiK,KAAKpD,EAAKgC,GAAQ,EACpC3E,EAAMA,EAAKlE,KAAKiK,KAAKpD,EAAKiC,GAAQ,EAClCtG,EAAMA,EAAKxC,KAAKiK,KAAKxD,EAAKuC,GAAQ,EAClC7C,EAAOA,EAAMnG,KAAKiK,KAAKxD,EAAKwC,IAAQ,EACpC9C,EAAOA,EAAMnG,KAAKiK,KAAKvD,EAAKsC,GAAQ,EACpC9E,EAAMA,EAAKlE,KAAKiK,KAAKvD,EAAKuC,IAAQ,EAClCzG,EAAMA,EAAKxC,KAAKiK,KAAK3D,EAAK6C,IAAQ,EAClChD,EAAOA,EAAMnG,KAAKiK,KAAK3D,EAAK8C,IAAQ,EACpCjD,EAAOA,EAAMnG,KAAKiK,KAAK1D,EAAK4C,IAAQ,EACpCjF,EAAMA,EAAKlE,KAAKiK,KAAK1D,EAAK6C,IAAQ,EAClC,IAAImB,IAAQrK,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrDjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAKxC,KAAKiK,KAAKzC,EAAKY,GACpBjC,EAAMnG,KAAKiK,KAAKzC,EAAKa,GACrBlC,EAAOA,EAAMnG,KAAKiK,KAAKxC,EAAKW,GAAQ,EACpClE,EAAKlE,KAAKiK,KAAKxC,EAAKY,GACpB7F,EAAMA,EAAKxC,KAAKiK,KAAK5C,EAAKkB,GAAQ,EAClCpC,EAAOA,EAAMnG,KAAKiK,KAAK5C,EAAKmB,GAAQ,EACpCrC,EAAOA,EAAMnG,KAAKiK,KAAK3C,EAAKiB,GAAQ,EACpCrE,EAAMA,EAAKlE,KAAKiK,KAAK3C,EAAKkB,GAAQ,EAClChG,EAAMA,EAAKxC,KAAKiK,KAAK/C,EAAKwB,GAAQ,EAClCvC,EAAOA,EAAMnG,KAAKiK,KAAK/C,EAAKyB,GAAQ,EACpCxC,EAAOA,EAAMnG,KAAKiK,KAAK9C,EAAKuB,GAAQ,EACpCxE,EAAMA,EAAKlE,KAAKiK,KAAK9C,EAAKwB,GAAQ,EAClCnG,EAAMA,EAAKxC,KAAKiK,KAAKlD,EAAK8B,GAAQ,EAClC1C,EAAOA,EAAMnG,KAAKiK,KAAKlD,EAAK+B,GAAQ,EACpC3C,EAAOA,EAAMnG,KAAKiK,KAAKjD,EAAK6B,GAAQ,EACpC3E,EAAMA,EAAKlE,KAAKiK,KAAKjD,EAAK8B,GAAQ,EAClCtG,EAAMA,EAAKxC,KAAKiK,KAAKrD,EAAKoC,GAAQ,EAClC7C,EAAOA,EAAMnG,KAAKiK,KAAKrD,EAAKqC,IAAQ,EACpC9C,EAAOA,EAAMnG,KAAKiK,KAAKpD,EAAKmC,GAAQ,EACpC9E,EAAMA,EAAKlE,KAAKiK,KAAKpD,EAAKoC,IAAQ,EAClCzG,EAAMA,EAAKxC,KAAKiK,KAAKxD,EAAK0C,IAAQ,EAClChD,EAAOA,EAAMnG,KAAKiK,KAAKxD,EAAK2C,IAAQ,EACpCjD,EAAOA,EAAMnG,KAAKiK,KAAKvD,EAAKyC,IAAQ,EACpCjF,EAAMA,EAAKlE,KAAKiK,KAAKvD,EAAK0C,IAAQ,EAClC5G,EAAMA,EAAKxC,KAAKiK,KAAK3D,EAAKgD,IAAQ,EAClCnD,EAAOA,EAAMnG,KAAKiK,KAAK3D,EAAKiD,IAAQ,EACpCpD,EAAOA,EAAMnG,KAAKiK,KAAK1D,EAAK+C,IAAQ,EACpCpF,EAAMA,EAAKlE,KAAKiK,KAAK1D,EAAKgD,IAAQ,EAClC,IAAIiB,IAAQtK,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrDjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENhI,EAAKxC,KAAKiK,KAAKtC,EAAKS,GACpBjC,EAAMnG,KAAKiK,KAAKtC,EAAKU,GACrBlC,EAAOA,EAAMnG,KAAKiK,KAAKrC,EAAKQ,GAAQ,EACpClE,EAAKlE,KAAKiK,KAAKrC,EAAKS,GACpB7F,EAAMA,EAAKxC,KAAKiK,KAAKzC,EAAKe,GAAQ,EAClCpC,EAAOA,EAAMnG,KAAKiK,KAAKzC,EAAKgB,GAAQ,EACpCrC,EAAOA,EAAMnG,KAAKiK,KAAKxC,EAAKc,GAAQ,EACpCrE,EAAMA,EAAKlE,KAAKiK,KAAKxC,EAAKe,GAAQ,EAClChG,EAAMA,EAAKxC,KAAKiK,KAAK5C,EAAKqB,GAAQ,EAClCvC,EAAOA,EAAMnG,KAAKiK,KAAK5C,EAAKsB,GAAQ,EACpCxC,EAAOA,EAAMnG,KAAKiK,KAAK3C,EAAKoB,GAAQ,EACpCxE,EAAMA,EAAKlE,KAAKiK,KAAK3C,EAAKqB,GAAQ,EAClCnG,EAAMA,EAAKxC,KAAKiK,KAAK/C,EAAK2B,GAAQ,EAClC1C,EAAOA,EAAMnG,KAAKiK,KAAK/C,EAAK4B,GAAQ,EACpC3C,EAAOA,EAAMnG,KAAKiK,KAAK9C,EAAK0B,GAAQ,EACpC3E,EAAMA,EAAKlE,KAAKiK,KAAK9C,EAAK2B,GAAQ,EAClCtG,EAAMA,EAAKxC,KAAKiK,KAAKlD,EAAKiC,GAAQ,EAClC7C,EAAOA,EAAMnG,KAAKiK,KAAKlD,EAAKkC,IAAQ,EACpC9C,EAAOA,EAAMnG,KAAKiK,KAAKjD,EAAKgC,GAAQ,EACpC9E,EAAMA,EAAKlE,KAAKiK,KAAKjD,EAAKiC,IAAQ,EAClCzG,EAAMA,EAAKxC,KAAKiK,KAAKrD,EAAKuC,IAAQ,EAClChD,EAAOA,EAAMnG,KAAKiK,KAAKrD,EAAKwC,IAAQ,EACpCjD,EAAOA,EAAMnG,KAAKiK,KAAKpD,EAAKsC,IAAQ,EACpCjF,EAAMA,EAAKlE,KAAKiK,KAAKpD,EAAKuC,IAAQ,EAClC5G,EAAMA,EAAKxC,KAAKiK,KAAKxD,EAAK6C,IAAQ,EAClCnD,EAAOA,EAAMnG,KAAKiK,KAAKxD,EAAK8C,IAAQ,EACpCpD,EAAOA,EAAMnG,KAAKiK,KAAKvD,EAAK4C,IAAQ,EACpCpF,EAAMA,EAAKlE,KAAKiK,KAAKvD,EAAK6C,IAAQ,EAClC/G,EAAMA,EAAKxC,KAAKiK,KAAK3D,EAAKmD,IAAQ,EAClCtD,EAAOA,EAAMnG,KAAKiK,KAAK3D,EAAKoD,IAAQ,EACpCvD,EAAOA,EAAMnG,KAAKiK,KAAK1D,EAAKkD,IAAQ,EACpCvF,EAAMA,EAAKlE,KAAKiK,KAAK1D,EAAKmD,IAAQ,EAClC,IAAIe,IAAQvK,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrDjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAKxC,KAAKiK,KAAKnC,EAAKM,GACpBjC,EAAMnG,KAAKiK,KAAKnC,EAAKO,GACrBlC,EAAOA,EAAMnG,KAAKiK,KAAKlC,EAAKK,GAAQ,EACpClE,EAAKlE,KAAKiK,KAAKlC,EAAKM,GACpB7F,EAAMA,EAAKxC,KAAKiK,KAAKtC,EAAKY,GAAQ,EAClCpC,EAAOA,EAAMnG,KAAKiK,KAAKtC,EAAKa,GAAQ,EACpCrC,EAAOA,EAAMnG,KAAKiK,KAAKrC,EAAKW,GAAQ,EACpCrE,EAAMA,EAAKlE,KAAKiK,KAAKrC,EAAKY,GAAQ,EAClChG,EAAMA,EAAKxC,KAAKiK,KAAKzC,EAAKkB,GAAQ,EAClCvC,EAAOA,EAAMnG,KAAKiK,KAAKzC,EAAKmB,GAAQ,EACpCxC,EAAOA,EAAMnG,KAAKiK,KAAKxC,EAAKiB,GAAQ,EACpCxE,EAAMA,EAAKlE,KAAKiK,KAAKxC,EAAKkB,GAAQ,EAClCnG,EAAMA,EAAKxC,KAAKiK,KAAK5C,EAAKwB,GAAQ,EAClC1C,EAAOA,EAAMnG,KAAKiK,KAAK5C,EAAKyB,GAAQ,EACpC3C,EAAOA,EAAMnG,KAAKiK,KAAK3C,EAAKuB,GAAQ,EACpC3E,EAAMA,EAAKlE,KAAKiK,KAAK3C,EAAKwB,GAAQ,EAClCtG,EAAMA,EAAKxC,KAAKiK,KAAK/C,EAAK8B,GAAQ,EAClC7C,EAAOA,EAAMnG,KAAKiK,KAAK/C,EAAK+B,IAAQ,EACpC9C,EAAOA,EAAMnG,KAAKiK,KAAK9C,EAAK6B,GAAQ,EACpC9E,EAAMA,EAAKlE,KAAKiK,KAAK9C,EAAK8B,IAAQ,EAClCzG,EAAMA,EAAKxC,KAAKiK,KAAKlD,EAAKoC,IAAQ,EAClChD,EAAOA,EAAMnG,KAAKiK,KAAKlD,EAAKqC,IAAQ,EACpCjD,EAAOA,EAAMnG,KAAKiK,KAAKjD,EAAKmC,IAAQ,EACpCjF,EAAMA,EAAKlE,KAAKiK,KAAKjD,EAAKoC,IAAQ,EAClC5G,EAAMA,EAAKxC,KAAKiK,KAAKrD,EAAK0C,IAAQ,EAClCnD,EAAOA,EAAMnG,KAAKiK,KAAKrD,EAAK2C,IAAQ,EACpCpD,EAAOA,EAAMnG,KAAKiK,KAAKpD,EAAKyC,IAAQ,EACpCpF,EAAMA,EAAKlE,KAAKiK,KAAKpD,EAAK0C,IAAQ,EAClC/G,EAAMA,EAAKxC,KAAKiK,KAAKxD,EAAKgD,IAAQ,EAClCtD,EAAOA,EAAMnG,KAAKiK,KAAKxD,EAAKiD,IAAQ,EACpCvD,EAAOA,EAAMnG,KAAKiK,KAAKvD,EAAK+C,IAAQ,EACpCvF,EAAMA,EAAKlE,KAAKiK,KAAKvD,EAAKgD,IAAQ,EAClClH,EAAMA,EAAKxC,KAAKiK,KAAK3D,EAAKsD,IAAQ,EAClCzD,EAAOA,EAAMnG,KAAKiK,KAAK3D,EAAKuD,IAAQ,EACpC1D,EAAOA,EAAMnG,KAAKiK,KAAK1D,EAAKqD,IAAQ,EACpC1F,EAAMA,EAAKlE,KAAKiK,KAAK1D,EAAKsD,IAAQ,EAClC,IAAIa,IAAQxK,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrDjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAKxC,KAAKiK,KAAKhC,EAAKG,GACpBjC,EAAMnG,KAAKiK,KAAKhC,EAAKI,GACrBlC,EAAOA,EAAMnG,KAAKiK,KAAK/B,EAAKE,GAAQ,EACpClE,EAAKlE,KAAKiK,KAAK/B,EAAKG,GACpB7F,EAAMA,EAAKxC,KAAKiK,KAAKnC,EAAKS,GAAQ,EAClCpC,EAAOA,EAAMnG,KAAKiK,KAAKnC,EAAKU,GAAQ,EACpCrC,EAAOA,EAAMnG,KAAKiK,KAAKlC,EAAKQ,GAAQ,EACpCrE,EAAMA,EAAKlE,KAAKiK,KAAKlC,EAAKS,GAAQ,EAClChG,EAAMA,EAAKxC,KAAKiK,KAAKtC,EAAKe,GAAQ,EAClCvC,EAAOA,EAAMnG,KAAKiK,KAAKtC,EAAKgB,GAAQ,EACpCxC,EAAOA,EAAMnG,KAAKiK,KAAKrC,EAAKc,GAAQ,EACpCxE,EAAMA,EAAKlE,KAAKiK,KAAKrC,EAAKe,GAAQ,EAClCnG,EAAMA,EAAKxC,KAAKiK,KAAKzC,EAAKqB,GAAQ,EAClC1C,EAAOA,EAAMnG,KAAKiK,KAAKzC,EAAKsB,GAAQ,EACpC3C,EAAOA,EAAMnG,KAAKiK,KAAKxC,EAAKoB,GAAQ,EACpC3E,EAAMA,EAAKlE,KAAKiK,KAAKxC,EAAKqB,GAAQ,EAClCtG,EAAMA,EAAKxC,KAAKiK,KAAK5C,EAAK2B,GAAQ,EAClC7C,EAAOA,EAAMnG,KAAKiK,KAAK5C,EAAK4B,IAAQ,EACpC9C,EAAOA,EAAMnG,KAAKiK,KAAK3C,EAAK0B,GAAQ,EACpC9E,EAAMA,EAAKlE,KAAKiK,KAAK3C,EAAK2B,IAAQ,EAClCzG,EAAMA,EAAKxC,KAAKiK,KAAK/C,EAAKiC,IAAQ,EAClChD,EAAOA,EAAMnG,KAAKiK,KAAK/C,EAAKkC,IAAQ,EACpCjD,EAAOA,EAAMnG,KAAKiK,KAAK9C,EAAKgC,IAAQ,EACpCjF,EAAMA,EAAKlE,KAAKiK,KAAK9C,EAAKiC,IAAQ,EAClC5G,EAAMA,EAAKxC,KAAKiK,KAAKlD,EAAKuC,IAAQ,EAClCnD,EAAOA,EAAMnG,KAAKiK,KAAKlD,EAAKwC,IAAQ,EACpCpD,EAAOA,EAAMnG,KAAKiK,KAAKjD,EAAKsC,IAAQ,EACpCpF,EAAMA,EAAKlE,KAAKiK,KAAKjD,EAAKuC,IAAQ,EAClC/G,EAAMA,EAAKxC,KAAKiK,KAAKrD,EAAK6C,IAAQ,EAClCtD,EAAOA,EAAMnG,KAAKiK,KAAKrD,EAAK8C,IAAQ,EACpCvD,EAAOA,EAAMnG,KAAKiK,KAAKpD,EAAK4C,IAAQ,EACpCvF,EAAMA,EAAKlE,KAAKiK,KAAKpD,EAAK6C,IAAQ,EAClClH,EAAMA,EAAKxC,KAAKiK,KAAKxD,EAAKmD,IAAQ,EAClCzD,EAAOA,EAAMnG,KAAKiK,KAAKxD,EAAKoD,IAAQ,EACpC1D,EAAOA,EAAMnG,KAAKiK,KAAKvD,EAAKkD,IAAQ,EACpC1F,EAAMA,EAAKlE,KAAKiK,KAAKvD,EAAKmD,IAAQ,EAClCrH,EAAMA,EAAKxC,KAAKiK,KAAK3D,EAAKyD,IAAQ,EAClC5D,EAAOA,EAAMnG,KAAKiK,KAAK3D,EAAK0D,IAAQ,EACpC7D,EAAOA,EAAMnG,KAAKiK,KAAK1D,EAAKwD,IAAQ,EACpC7F,EAAMA,EAAKlE,KAAKiK,KAAK1D,EAAKyD,IAAQ,EAClC,IAAIW,IAAQzK,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrDjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAKxC,KAAKiK,KAAKhC,EAAKM,GACpBpC,EAAMnG,KAAKiK,KAAKhC,EAAKO,GACrBrC,EAAOA,EAAMnG,KAAKiK,KAAK/B,EAAKK,GAAQ,EACpCrE,EAAKlE,KAAKiK,KAAK/B,EAAKM,GACpBhG,EAAMA,EAAKxC,KAAKiK,KAAKnC,EAAKY,GAAQ,EAClCvC,EAAOA,EAAMnG,KAAKiK,KAAKnC,EAAKa,GAAQ,EACpCxC,EAAOA,EAAMnG,KAAKiK,KAAKlC,EAAKW,GAAQ,EACpCxE,EAAMA,EAAKlE,KAAKiK,KAAKlC,EAAKY,GAAQ,EAClCnG,EAAMA,EAAKxC,KAAKiK,KAAKtC,EAAKkB,GAAQ,EAClC1C,EAAOA,EAAMnG,KAAKiK,KAAKtC,EAAKmB,GAAQ,EACpC3C,EAAOA,EAAMnG,KAAKiK,KAAKrC,EAAKiB,GAAQ,EACpC3E,EAAMA,EAAKlE,KAAKiK,KAAKrC,EAAKkB,GAAQ,EAClCtG,EAAMA,EAAKxC,KAAKiK,KAAKzC,EAAKwB,GAAQ,EAClC7C,EAAOA,EAAMnG,KAAKiK,KAAKzC,EAAKyB,IAAQ,EACpC9C,EAAOA,EAAMnG,KAAKiK,KAAKxC,EAAKuB,GAAQ,EACpC9E,EAAMA,EAAKlE,KAAKiK,KAAKxC,EAAKwB,IAAQ,EAClCzG,EAAMA,EAAKxC,KAAKiK,KAAK5C,EAAK8B,IAAQ,EAClChD,EAAOA,EAAMnG,KAAKiK,KAAK5C,EAAK+B,IAAQ,EACpCjD,EAAOA,EAAMnG,KAAKiK,KAAK3C,EAAK6B,IAAQ,EACpCjF,EAAMA,EAAKlE,KAAKiK,KAAK3C,EAAK8B,IAAQ,EAClC5G,EAAMA,EAAKxC,KAAKiK,KAAK/C,EAAKoC,IAAQ,EAClCnD,EAAOA,EAAMnG,KAAKiK,KAAK/C,EAAKqC,IAAQ,EACpCpD,EAAOA,EAAMnG,KAAKiK,KAAK9C,EAAKmC,IAAQ,EACpCpF,EAAMA,EAAKlE,KAAKiK,KAAK9C,EAAKoC,IAAQ,EAClC/G,EAAMA,EAAKxC,KAAKiK,KAAKlD,EAAK0C,IAAQ,EAClCtD,EAAOA,EAAMnG,KAAKiK,KAAKlD,EAAK2C,IAAQ,EACpCvD,EAAOA,EAAMnG,KAAKiK,KAAKjD,EAAKyC,IAAQ,EACpCvF,EAAMA,EAAKlE,KAAKiK,KAAKjD,EAAK0C,IAAQ,EAClClH,EAAMA,EAAKxC,KAAKiK,KAAKrD,EAAKgD,IAAQ,EAClCzD,EAAOA,EAAMnG,KAAKiK,KAAKrD,EAAKiD,IAAQ,EACpC1D,EAAOA,EAAMnG,KAAKiK,KAAKpD,EAAK+C,IAAQ,EACpC1F,EAAMA,EAAKlE,KAAKiK,KAAKpD,EAAKgD,IAAQ,EAClCrH,EAAMA,EAAKxC,KAAKiK,KAAKxD,EAAKsD,IAAQ,EAClC5D,EAAOA,EAAMnG,KAAKiK,KAAKxD,EAAKuD,IAAQ,EACpC7D,EAAOA,EAAMnG,KAAKiK,KAAKvD,EAAKqD,IAAQ,EACpC7F,EAAMA,EAAKlE,KAAKiK,KAAKvD,EAAKsD,IAAQ,EAClC,IAAIY,IAAS1K,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACtDjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEPpI,EAAKxC,KAAKiK,KAAKhC,EAAKS,GACpBvC,EAAMnG,KAAKiK,KAAKhC,EAAKU,GACrBxC,EAAOA,EAAMnG,KAAKiK,KAAK/B,EAAKQ,GAAQ,EACpCxE,EAAKlE,KAAKiK,KAAK/B,EAAKS,GACpBnG,EAAMA,EAAKxC,KAAKiK,KAAKnC,EAAKe,GAAQ,EAClC1C,EAAOA,EAAMnG,KAAKiK,KAAKnC,EAAKgB,GAAQ,EACpC3C,EAAOA,EAAMnG,KAAKiK,KAAKlC,EAAKc,GAAQ,EACpC3E,EAAMA,EAAKlE,KAAKiK,KAAKlC,EAAKe,GAAQ,EAClCtG,EAAMA,EAAKxC,KAAKiK,KAAKtC,EAAKqB,GAAQ,EAClC7C,EAAOA,EAAMnG,KAAKiK,KAAKtC,EAAKsB,IAAQ,EACpC9C,EAAOA,EAAMnG,KAAKiK,KAAKrC,EAAKoB,GAAQ,EACpC9E,EAAMA,EAAKlE,KAAKiK,KAAKrC,EAAKqB,IAAQ,EAClCzG,EAAMA,EAAKxC,KAAKiK,KAAKzC,EAAK2B,IAAQ,EAClChD,EAAOA,EAAMnG,KAAKiK,KAAKzC,EAAK4B,IAAQ,EACpCjD,EAAOA,EAAMnG,KAAKiK,KAAKxC,EAAK0B,IAAQ,EACpCjF,EAAMA,EAAKlE,KAAKiK,KAAKxC,EAAK2B,IAAQ,EAClC5G,EAAMA,EAAKxC,KAAKiK,KAAK5C,EAAKiC,IAAQ,EAClCnD,EAAOA,EAAMnG,KAAKiK,KAAK5C,EAAKkC,IAAQ,EACpCpD,EAAOA,EAAMnG,KAAKiK,KAAK3C,EAAKgC,IAAQ,EACpCpF,EAAMA,EAAKlE,KAAKiK,KAAK3C,EAAKiC,IAAQ,EAClC/G,EAAMA,EAAKxC,KAAKiK,KAAK/C,EAAKuC,IAAQ,EAClCtD,EAAOA,EAAMnG,KAAKiK,KAAK/C,EAAKwC,IAAQ,EACpCvD,EAAOA,EAAMnG,KAAKiK,KAAK9C,EAAKsC,IAAQ,EACpCvF,EAAMA,EAAKlE,KAAKiK,KAAK9C,EAAKuC,IAAQ,EAClClH,EAAMA,EAAKxC,KAAKiK,KAAKlD,EAAK6C,IAAQ,EAClCzD,EAAOA,EAAMnG,KAAKiK,KAAKlD,EAAK8C,IAAQ,EACpC1D,EAAOA,EAAMnG,KAAKiK,KAAKjD,EAAK4C,IAAQ,EACpC1F,EAAMA,EAAKlE,KAAKiK,KAAKjD,EAAK6C,IAAQ,EAClCrH,EAAMA,EAAKxC,KAAKiK,KAAKrD,EAAKmD,IAAQ,EAClC5D,EAAOA,EAAMnG,KAAKiK,KAAKrD,EAAKoD,IAAQ,EACpC7D,EAAOA,EAAMnG,KAAKiK,KAAKpD,EAAKkD,IAAQ,EACpC7F,EAAMA,EAAKlE,KAAKiK,KAAKpD,EAAKmD,IAAQ,EAClC,IAAIa,IAAS3K,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACtDjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEPrI,EAAKxC,KAAKiK,KAAKhC,EAAKY,GACpB1C,EAAMnG,KAAKiK,KAAKhC,EAAKa,GACrB3C,EAAOA,EAAMnG,KAAKiK,KAAK/B,EAAKW,GAAQ,EACpC3E,EAAKlE,KAAKiK,KAAK/B,EAAKY,GACpBtG,EAAMA,EAAKxC,KAAKiK,KAAKnC,EAAKkB,GAAQ,EAClC7C,EAAOA,EAAMnG,KAAKiK,KAAKnC,EAAKmB,IAAQ,EACpC9C,EAAOA,EAAMnG,KAAKiK,KAAKlC,EAAKiB,GAAQ,EACpC9E,EAAMA,EAAKlE,KAAKiK,KAAKlC,EAAKkB,IAAQ,EAClCzG,EAAMA,EAAKxC,KAAKiK,KAAKtC,EAAKwB,IAAQ,EAClChD,EAAOA,EAAMnG,KAAKiK,KAAKtC,EAAKyB,IAAQ,EACpCjD,EAAOA,EAAMnG,KAAKiK,KAAKrC,EAAKuB,IAAQ,EACpCjF,EAAMA,EAAKlE,KAAKiK,KAAKrC,EAAKwB,IAAQ,EAClC5G,EAAMA,EAAKxC,KAAKiK,KAAKzC,EAAK8B,IAAQ,EAClCnD,EAAOA,EAAMnG,KAAKiK,KAAKzC,EAAK+B,IAAQ,EACpCpD,EAAOA,EAAMnG,KAAKiK,KAAKxC,EAAK6B,IAAQ,EACpCpF,EAAMA,EAAKlE,KAAKiK,KAAKxC,EAAK8B,IAAQ,EAClC/G,EAAMA,EAAKxC,KAAKiK,KAAK5C,EAAKoC,IAAQ,EAClCtD,EAAOA,EAAMnG,KAAKiK,KAAK5C,EAAKqC,IAAQ,EACpCvD,EAAOA,EAAMnG,KAAKiK,KAAK3C,EAAKmC,IAAQ,EACpCvF,EAAMA,EAAKlE,KAAKiK,KAAK3C,EAAKoC,IAAQ,EAClClH,EAAMA,EAAKxC,KAAKiK,KAAK/C,EAAK0C,IAAQ,EAClCzD,EAAOA,EAAMnG,KAAKiK,KAAK/C,EAAK2C,IAAQ,EACpC1D,EAAOA,EAAMnG,KAAKiK,KAAK9C,EAAKyC,IAAQ,EACpC1F,EAAMA,EAAKlE,KAAKiK,KAAK9C,EAAK0C,IAAQ,EAClCrH,EAAMA,EAAKxC,KAAKiK,KAAKlD,EAAKgD,IAAQ,EAClC5D,EAAOA,EAAMnG,KAAKiK,KAAKlD,EAAKiD,IAAQ,EACpC7D,EAAOA,EAAMnG,KAAKiK,KAAKjD,EAAK+C,IAAQ,EACpC7F,EAAMA,EAAKlE,KAAKiK,KAAKjD,EAAKgD,IAAQ,EAClC,IAAIc,IAAS5K,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACtDjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEPtI,EAAKxC,KAAKiK,KAAKhC,EAAKe,GACpB7C,EAAMnG,KAAKiK,KAAKhC,EAAKgB,IACrB9C,EAAOA,EAAMnG,KAAKiK,KAAK/B,EAAKc,GAAQ,EACpC9E,EAAKlE,KAAKiK,KAAK/B,EAAKe,IACpBzG,EAAMA,EAAKxC,KAAKiK,KAAKnC,EAAKqB,IAAQ,EAClChD,EAAOA,EAAMnG,KAAKiK,KAAKnC,EAAKsB,IAAQ,EACpCjD,EAAOA,EAAMnG,KAAKiK,KAAKlC,EAAKoB,IAAQ,EACpCjF,EAAMA,EAAKlE,KAAKiK,KAAKlC,EAAKqB,IAAQ,EAClC5G,EAAMA,EAAKxC,KAAKiK,KAAKtC,EAAK2B,IAAQ,EAClCnD,EAAOA,EAAMnG,KAAKiK,KAAKtC,EAAK4B,IAAQ,EACpCpD,EAAOA,EAAMnG,KAAKiK,KAAKrC,EAAK0B,IAAQ,EACpCpF,EAAMA,EAAKlE,KAAKiK,KAAKrC,EAAK2B,IAAQ,EAClC/G,EAAMA,EAAKxC,KAAKiK,KAAKzC,EAAKiC,IAAQ,EAClCtD,EAAOA,EAAMnG,KAAKiK,KAAKzC,EAAKkC,IAAQ,EACpCvD,EAAOA,EAAMnG,KAAKiK,KAAKxC,EAAKgC,IAAQ,EACpCvF,EAAMA,EAAKlE,KAAKiK,KAAKxC,EAAKiC,IAAQ,EAClClH,EAAMA,EAAKxC,KAAKiK,KAAK5C,EAAKuC,IAAQ,EAClCzD,EAAOA,EAAMnG,KAAKiK,KAAK5C,EAAKwC,IAAQ,EACpC1D,EAAOA,EAAMnG,KAAKiK,KAAK3C,EAAKsC,IAAQ,EACpC1F,EAAMA,EAAKlE,KAAKiK,KAAK3C,EAAKuC,IAAQ,EAClCrH,EAAMA,EAAKxC,KAAKiK,KAAK/C,EAAK6C,IAAQ,EAClC5D,EAAOA,EAAMnG,KAAKiK,KAAK/C,EAAK8C,IAAQ,EACpC7D,EAAOA,EAAMnG,KAAKiK,KAAK9C,EAAK4C,IAAQ,EACpC7F,EAAMA,EAAKlE,KAAKiK,KAAK9C,EAAK6C,IAAQ,EAClC,IAAIe,IAAS7K,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACtDjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEPvI,EAAKxC,KAAKiK,KAAKhC,EAAKkB,IACpBhD,EAAMnG,KAAKiK,KAAKhC,EAAKmB,IACrBjD,EAAOA,EAAMnG,KAAKiK,KAAK/B,EAAKiB,IAAQ,EACpCjF,EAAKlE,KAAKiK,KAAK/B,EAAKkB,IACpB5G,EAAMA,EAAKxC,KAAKiK,KAAKnC,EAAKwB,IAAQ,EAClCnD,EAAOA,EAAMnG,KAAKiK,KAAKnC,EAAKyB,IAAQ,EACpCpD,EAAOA,EAAMnG,KAAKiK,KAAKlC,EAAKuB,IAAQ,EACpCpF,EAAMA,EAAKlE,KAAKiK,KAAKlC,EAAKwB,IAAQ,EAClC/G,EAAMA,EAAKxC,KAAKiK,KAAKtC,EAAK8B,IAAQ,EAClCtD,EAAOA,EAAMnG,KAAKiK,KAAKtC,EAAK+B,IAAQ,EACpCvD,EAAOA,EAAMnG,KAAKiK,KAAKrC,EAAK6B,IAAQ,EACpCvF,EAAMA,EAAKlE,KAAKiK,KAAKrC,EAAK8B,IAAQ,EAClClH,EAAMA,EAAKxC,KAAKiK,KAAKzC,EAAKoC,IAAQ,EAClCzD,EAAOA,EAAMnG,KAAKiK,KAAKzC,EAAKqC,IAAQ,EACpC1D,EAAOA,EAAMnG,KAAKiK,KAAKxC,EAAKmC,IAAQ,EACpC1F,EAAMA,EAAKlE,KAAKiK,KAAKxC,EAAKoC,IAAQ,EAClCrH,EAAMA,EAAKxC,KAAKiK,KAAK5C,EAAK0C,IAAQ,EAClC5D,EAAOA,EAAMnG,KAAKiK,KAAK5C,EAAK2C,IAAQ,EACpC7D,EAAOA,EAAMnG,KAAKiK,KAAK3C,EAAKyC,IAAQ,EACpC7F,EAAMA,EAAKlE,KAAKiK,KAAK3C,EAAK0C,IAAQ,EAClC,IAAIgB,IAAS9K,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACtDjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEPxI,EAAKxC,KAAKiK,KAAKhC,EAAKqB,IACpBnD,EAAMnG,KAAKiK,KAAKhC,EAAKsB,IACrBpD,EAAOA,EAAMnG,KAAKiK,KAAK/B,EAAKoB,IAAQ,EACpCpF,EAAKlE,KAAKiK,KAAK/B,EAAKqB,IACpB/G,EAAMA,EAAKxC,KAAKiK,KAAKnC,EAAK2B,IAAQ,EAClCtD,EAAOA,EAAMnG,KAAKiK,KAAKnC,EAAK4B,IAAQ,EACpCvD,EAAOA,EAAMnG,KAAKiK,KAAKlC,EAAK0B,IAAQ,EACpCvF,EAAMA,EAAKlE,KAAKiK,KAAKlC,EAAK2B,IAAQ,EAClClH,EAAMA,EAAKxC,KAAKiK,KAAKtC,EAAKiC,IAAQ,EAClCzD,EAAOA,EAAMnG,KAAKiK,KAAKtC,EAAKkC,IAAQ,EACpC1D,EAAOA,EAAMnG,KAAKiK,KAAKrC,EAAKgC,IAAQ,EACpC1F,EAAMA,EAAKlE,KAAKiK,KAAKrC,EAAKiC,IAAQ,EAClCrH,EAAMA,EAAKxC,KAAKiK,KAAKzC,EAAKuC,IAAQ,EAClC5D,EAAOA,EAAMnG,KAAKiK,KAAKzC,EAAKwC,IAAQ,EACpC7D,EAAOA,EAAMnG,KAAKiK,KAAKxC,EAAKsC,IAAQ,EACpC7F,EAAMA,EAAKlE,KAAKiK,KAAKxC,EAAKuC,IAAQ,EAClC,IAAIiB,IAAS/K,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACtDjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEPzI,EAAKxC,KAAKiK,KAAKhC,EAAKwB,IACpBtD,EAAMnG,KAAKiK,KAAKhC,EAAKyB,IACrBvD,EAAOA,EAAMnG,KAAKiK,KAAK/B,EAAKuB,IAAQ,EACpCvF,EAAKlE,KAAKiK,KAAK/B,EAAKwB,IACpBlH,EAAMA,EAAKxC,KAAKiK,KAAKnC,EAAK8B,IAAQ,EAClCzD,EAAOA,EAAMnG,KAAKiK,KAAKnC,EAAK+B,IAAQ,EACpC1D,EAAOA,EAAMnG,KAAKiK,KAAKlC,EAAK6B,IAAQ,EACpC1F,EAAMA,EAAKlE,KAAKiK,KAAKlC,EAAK8B,IAAQ,EAClCrH,EAAMA,EAAKxC,KAAKiK,KAAKtC,EAAKoC,IAAQ,EAClC5D,EAAOA,EAAMnG,KAAKiK,KAAKtC,EAAKqC,IAAQ,EACpC7D,EAAOA,EAAMnG,KAAKiK,KAAKrC,EAAKmC,IAAQ,EACpC7F,EAAMA,EAAKlE,KAAKiK,KAAKrC,EAAKoC,IAAQ,EAClC,IAAIkB,IAAShL,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACtDjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAKxC,KAAKiK,KAAKhC,EAAK2B,IACpBzD,EAAMnG,KAAKiK,KAAKhC,EAAK4B,IACrB1D,EAAOA,EAAMnG,KAAKiK,KAAK/B,EAAK0B,IAAQ,EACpC1F,EAAKlE,KAAKiK,KAAK/B,EAAK2B,IACpBrH,EAAMA,EAAKxC,KAAKiK,KAAKnC,EAAKiC,IAAQ,EAClC5D,EAAOA,EAAMnG,KAAKiK,KAAKnC,EAAKkC,IAAQ,EACpC7D,EAAOA,EAAMnG,KAAKiK,KAAKlC,EAAKgC,IAAQ,EACpC7F,EAAMA,EAAKlE,KAAKiK,KAAKlC,EAAKiC,IAAQ,EAClC,IAAImB,IAASjL,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACtDjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAEP3I,EAAKxC,KAAKiK,KAAKhC,EAAK8B,IACpB5D,EAAMnG,KAAKiK,KAAKhC,EAAK+B,IACrB7D,EAAOA,EAAMnG,KAAKiK,KAAK/B,EAAK6B,IAAQ,EACpC7F,EAAKlE,KAAKiK,KAAK/B,EAAK8B,IACpB,IAAIoB,IAASlL,EAAIsC,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EA0BtD,OAzBAjG,GAAOgE,GAAMiC,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK8D,GACP9D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAANlL,IACFkG,EAAE,IAAMlG,EACRxL,EAAIjD,UAECiD,GAQT,SAAS2W,EAAUhJ,EAAM/R,EAAKoE,GAC5BA,EAAI+K,SAAWnP,EAAImP,SAAW4C,EAAK5C,SACnC/K,EAAIjD,OAAS4Q,EAAK5Q,OAASnB,EAAImB,OAI/B,IAFA,IAAIgR,EAAQ,EACR6I,EAAU,EACL5I,EAAI,EAAGA,EAAIhO,EAAIjD,OAAS,EAAGiR,IAAK,CAGvC,IAAIC,EAAS2I,EACbA,EAAU,EAGV,IAFA,IAAI1I,EAAgB,SAARH,EACRI,EAAO7C,KAAKC,IAAIyC,EAAGpS,EAAImB,OAAS,GAC3BM,EAAIiO,KAAKK,IAAI,EAAGqC,EAAIL,EAAK5Q,OAAS,GAAIM,GAAK8Q,EAAM9Q,IAAK,CAC7D,IAAID,EAAI4Q,EAAI3Q,EACRuQ,EAAoB,EAAhBD,EAAK3C,MAAM5N,GACfyQ,EAAmB,EAAfjS,EAAIoP,MAAM3N,GACd+N,EAAIwC,EAAIC,EAERC,EAAS,SAAJ1C,EACT6C,EAAUA,GAAW7C,EAAI,SAAa,GAAM,EAC5C0C,EAAMA,EAAKI,EAAS,EACpBA,EAAa,SAALJ,EACRG,EAAUA,GAAUH,IAAO,IAAO,EAElC8I,GAAW3I,IAAW,GACtBA,GAAU,SAEZjO,EAAIgL,MAAMgD,GAAKE,EACfH,EAAQE,EACRA,EAAS2I,EAQX,OANc,IAAV7I,EACF/N,EAAIgL,MAAMgD,GAAKD,EAEf/N,EAAIjD,SAGCiD,EAAImM,QAGb,SAAS0K,EAAYlJ,EAAM/R,EAAKoE,GAC9B,IAAI8W,EAAO,IAAIC,EACf,OAAOD,EAAKE,KAAKrJ,EAAM/R,EAAKoE,GAsB9B,SAAS+W,EAAME,EAAGC,GAChBhc,KAAK+b,EAAIA,EACT/b,KAAKgc,EAAIA,EAvEN5L,KAAKiK,OACR/D,EAAc9D,GAiDhB/C,EAAGpO,UAAU4a,MAAQ,SAAgBvb,EAAKoE,GACxC,IAAI7F,EACAkR,EAAMnQ,KAAK6B,OAASnB,EAAImB,OAW5B,OATE5C,EADkB,KAAhBe,KAAK6B,QAAgC,KAAfnB,EAAImB,OACtByU,EAAYtW,KAAMU,EAAKoE,GACpBqL,EAAM,GACTqC,EAAWxS,KAAMU,EAAKoE,GACnBqL,EAAM,KACTsL,EAASzb,KAAMU,EAAKoE,GAEpB6W,EAAW3b,KAAMU,EAAKoE,GAGvB7F,GAWT4c,EAAKxa,UAAU6a,QAAU,SAAkBC,GAGzC,IAFA,IAAIpW,EAAI,IAAI7C,MAAMiZ,GACdC,EAAI3M,EAAGpO,UAAU+S,WAAW+H,GAAK,EAC5Bja,EAAI,EAAGA,EAAIia,EAAGja,IACrB6D,EAAE7D,GAAKlC,KAAKqc,OAAOna,EAAGka,EAAGD,GAG3B,OAAOpW,GAIT8V,EAAKxa,UAAUgb,OAAS,SAAiBN,EAAGK,EAAGD,GAC7C,GAAU,IAANJ,GAAWA,IAAMI,EAAI,EAAG,OAAOJ,EAGnC,IADA,IAAIO,EAAK,EACApa,EAAI,EAAGA,EAAIka,EAAGla,IACrBoa,IAAW,EAAJP,IAAWK,EAAIla,EAAI,EAC1B6Z,IAAM,EAGR,OAAOO,GAKTT,EAAKxa,UAAUkb,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAIja,EAAI,EAAGA,EAAIia,EAAGja,IACrBya,EAAKza,GAAKua,EAAID,EAAIta,IAClB0a,EAAK1a,GAAKwa,EAAIF,EAAIta,KAItB2Z,EAAKxa,UAAUwb,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtExc,KAAKuc,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQ3M,KAAK4M,IAAI,EAAI5M,KAAK6M,GAAKb,GAC/Bc,EAAQ9M,KAAK+M,IAAI,EAAI/M,KAAK6M,GAAKb,GAE1BnQ,EAAI,EAAGA,EAAIkQ,EAAGlQ,GAAKmQ,EAI1B,IAHA,IAAIgB,EAASL,EACTM,EAASH,EAEJ/a,EAAI,EAAGA,EAAI2a,EAAG3a,IAAK,CAC1B,IAAI2M,EAAK6N,EAAK1Q,EAAI9J,GACdmb,EAAKV,EAAK3Q,EAAI9J,GAEdob,EAAKZ,EAAK1Q,EAAI9J,EAAI2a,GAClBU,EAAKZ,EAAK3Q,EAAI9J,EAAI2a,GAElBW,EAAKL,EAASG,EAAKF,EAASG,EAEhCA,EAAKJ,EAASI,EAAKH,EAASE,EAC5BA,EAAKE,EAELd,EAAK1Q,EAAI9J,GAAK2M,EAAKyO,EACnBX,EAAK3Q,EAAI9J,GAAKmb,EAAKE,EAEnBb,EAAK1Q,EAAI9J,EAAI2a,GAAKhO,EAAKyO,EACvBX,EAAK3Q,EAAI9J,EAAI2a,GAAKQ,EAAKE,EAGnBrb,IAAMia,IACRqB,EAAKV,EAAQK,EAASF,EAAQG,EAE9BA,EAASN,EAAQM,EAASH,EAAQE,EAClCA,EAASK,KAOnB5B,EAAKxa,UAAUqc,YAAc,SAAsBC,EAAGC,GACpD,IAAIzB,EAAqB,EAAjB/L,KAAKK,IAAImN,EAAGD,GAChBE,EAAU,EAAJ1B,EACNja,EAAI,EACR,IAAKia,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/Bja,IAGF,OAAO,GAAKA,EAAI,EAAI2b,GAGtBhC,EAAKxa,UAAUyc,UAAY,SAAoBrB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAIja,EAAI,EAAGA,EAAIia,EAAI,EAAGja,IAAK,CAC9B,IAAI6D,EAAI0W,EAAIva,GAEZua,EAAIva,GAAKua,EAAIN,EAAIja,EAAI,GACrBua,EAAIN,EAAIja,EAAI,GAAK6D,EAEjBA,EAAI2W,EAAIxa,GAERwa,EAAIxa,IAAMwa,EAAIP,EAAIja,EAAI,GACtBwa,EAAIP,EAAIja,EAAI,IAAM6D,IAItB8V,EAAKxa,UAAU0c,aAAe,SAAuBC,EAAI7B,GAEvD,IADA,IAAItJ,EAAQ,EACH3Q,EAAI,EAAGA,EAAIia,EAAI,EAAGja,IAAK,CAC9B,IAAIiP,EAAoC,KAAhCf,KAAK6N,MAAMD,EAAG,EAAI9b,EAAI,GAAKia,GACjC/L,KAAK6N,MAAMD,EAAG,EAAI9b,GAAKia,GACvBtJ,EAEFmL,EAAG9b,GAAS,SAAJiP,EAGN0B,EADE1B,EAAI,SACE,EAEAA,EAAI,SAAY,EAI5B,OAAO6M,GAGTnC,EAAKxa,UAAU6c,WAAa,SAAqBF,EAAI7N,EAAKsM,EAAKN,GAE7D,IADA,IAAItJ,EAAQ,EACH3Q,EAAI,EAAGA,EAAIiO,EAAKjO,IACvB2Q,GAAyB,EAARmL,EAAG9b,GAEpBua,EAAI,EAAIva,GAAa,KAAR2Q,EAAgBA,KAAkB,GAC/C4J,EAAI,EAAIva,EAAI,GAAa,KAAR2Q,EAAgBA,KAAkB,GAIrD,IAAK3Q,EAAI,EAAIiO,EAAKjO,EAAIia,IAAKja,EACzBua,EAAIva,GAAK,EAGX0F,EAAiB,IAAViL,GACPjL,EAA6B,MAAb,KAARiL,KAGVgJ,EAAKxa,UAAU8c,KAAO,SAAehC,GAEnC,IADA,IAAIiC,EAAK,IAAIlb,MAAMiZ,GACVja,EAAI,EAAGA,EAAIia,EAAGja,IACrBkc,EAAGlc,GAAK,EAGV,OAAOkc,GAGTvC,EAAKxa,UAAUya,KAAO,SAAeC,EAAGC,EAAGlX,GACzC,IAAIqX,EAAI,EAAInc,KAAK0d,YAAY3B,EAAEla,OAAQma,EAAEna,QAErC2a,EAAMxc,KAAKkc,QAAQC,GAEnBkC,EAAIre,KAAKme,KAAKhC,GAEdM,EAAM,IAAIvZ,MAAMiZ,GAChBmC,EAAO,IAAIpb,MAAMiZ,GACjBoC,EAAO,IAAIrb,MAAMiZ,GAEjBqC,EAAO,IAAItb,MAAMiZ,GACjBsC,EAAQ,IAAIvb,MAAMiZ,GAClBuC,EAAQ,IAAIxb,MAAMiZ,GAElBwC,EAAO7Z,EAAIgL,MACf6O,EAAK9c,OAASsa,EAEdnc,KAAKke,WAAWnC,EAAEjM,MAAOiM,EAAEla,OAAQ4a,EAAKN,GACxCnc,KAAKke,WAAWlC,EAAElM,MAAOkM,EAAEna,OAAQ2c,EAAMrC,GAEzCnc,KAAK6c,UAAUJ,EAAK4B,EAAGC,EAAMC,EAAMpC,EAAGK,GACtCxc,KAAK6c,UAAU2B,EAAMH,EAAGI,EAAOC,EAAOvC,EAAGK,GAEzC,IAAK,IAAIta,EAAI,EAAGA,EAAIia,EAAGja,IAAK,CAC1B,IAAIub,EAAKa,EAAKpc,GAAKuc,EAAMvc,GAAKqc,EAAKrc,GAAKwc,EAAMxc,GAC9Cqc,EAAKrc,GAAKoc,EAAKpc,GAAKwc,EAAMxc,GAAKqc,EAAKrc,GAAKuc,EAAMvc,GAC/Coc,EAAKpc,GAAKub,EAUZ,OAPAzd,KAAK8d,UAAUQ,EAAMC,EAAMpC,GAC3Bnc,KAAK6c,UAAUyB,EAAMC,EAAMI,EAAMN,EAAGlC,EAAGK,GACvCxc,KAAK8d,UAAUa,EAAMN,EAAGlC,GACxBnc,KAAK+d,aAAaY,EAAMxC,GAExBrX,EAAI+K,SAAWkM,EAAElM,SAAWmM,EAAEnM,SAC9B/K,EAAIjD,OAASka,EAAEla,OAASma,EAAEna,OACnBiD,EAAImM,SAIbxB,EAAGpO,UAAUmP,IAAM,SAAc9P,GAC/B,IAAIoE,EAAM,IAAI2K,EAAG,MAEjB,OADA3K,EAAIgL,MAAQ,IAAI5M,MAAMlD,KAAK6B,OAASnB,EAAImB,QACjC7B,KAAKic,MAAMvb,EAAKoE,IAIzB2K,EAAGpO,UAAUud,KAAO,SAAele,GACjC,IAAIoE,EAAM,IAAI2K,EAAG,MAEjB,OADA3K,EAAIgL,MAAQ,IAAI5M,MAAMlD,KAAK6B,OAASnB,EAAImB,QACjC8Z,EAAW3b,KAAMU,EAAKoE,IAI/B2K,EAAGpO,UAAUgZ,KAAO,SAAe3Z,GACjC,OAAOV,KAAK8I,QAAQmT,MAAMvb,EAAKV,OAGjCyP,EAAGpO,UAAUqQ,MAAQ,SAAgBhR,GACnCkH,EAAsB,kBAARlH,GACdkH,EAAOlH,EAAM,UAIb,IADA,IAAImS,EAAQ,EACH3Q,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAAK,CACpC,IAAIiP,GAAqB,EAAhBnR,KAAK8P,MAAM5N,IAAUxB,EAC1BkS,GAAU,SAAJzB,IAA0B,SAAR0B,GAC5BA,IAAU,GACVA,GAAU1B,EAAI,SAAa,EAE3B0B,GAASD,IAAO,GAChB5S,KAAK8P,MAAM5N,GAAU,SAAL0Q,EAQlB,OALc,IAAVC,IACF7S,KAAK8P,MAAM5N,GAAK2Q,EAChB7S,KAAK6B,UAGA7B,MAGTyP,EAAGpO,UAAUwd,KAAO,SAAene,GACjC,OAAOV,KAAK8I,QAAQ4I,MAAMhR,IAI5B+O,EAAGpO,UAAUyd,IAAM,WACjB,OAAO9e,KAAKwQ,IAAIxQ,OAIlByP,EAAGpO,UAAU0d,KAAO,WAClB,OAAO/e,KAAKqa,KAAKra,KAAK8I,UAIxB2G,EAAGpO,UAAUuQ,IAAM,SAAclR,GAC/B,IAAIyQ,EAAIiB,EAAW1R,GACnB,GAAiB,IAAbyQ,EAAEtP,OAAc,OAAO,IAAI4N,EAAG,GAIlC,IADA,IAAIxQ,EAAMe,KACDkC,EAAI,EAAGA,EAAIiP,EAAEtP,OAAQK,IAAKjD,EAAMA,EAAI6f,MAC3C,GAAa,IAAT3N,EAAEjP,GAAU,MAGlB,KAAMA,EAAIiP,EAAEtP,OACV,IAAK,IAAImS,EAAI/U,EAAI6f,MAAO5c,EAAIiP,EAAEtP,OAAQK,IAAK8R,EAAIA,EAAE8K,MAClC,IAAT3N,EAAEjP,KAENjD,EAAMA,EAAIuR,IAAIwD,IAIlB,OAAO/U,GAITwQ,EAAGpO,UAAU2d,OAAS,SAAiBC,GACrCrX,EAAuB,kBAATqX,GAAqBA,GAAQ,GAC3C,IAGI/c,EAHAgO,EAAI+O,EAAO,GACXnC,GAAKmC,EAAO/O,GAAK,GACjBgP,EAAa,WAAe,GAAKhP,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAI2C,EAAQ,EAEZ,IAAK3Q,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAAK,CAChC,IAAIid,EAAWnf,KAAK8P,MAAM5N,GAAKgd,EAC3B5O,GAAsB,EAAhBtQ,KAAK8P,MAAM5N,IAAUid,GAAajP,EAC5ClQ,KAAK8P,MAAM5N,GAAKoO,EAAIuC,EACpBA,EAAQsM,IAAc,GAAKjP,EAGzB2C,IACF7S,KAAK8P,MAAM5N,GAAK2Q,EAChB7S,KAAK6B,UAIT,GAAU,IAANib,EAAS,CACX,IAAK5a,EAAIlC,KAAK6B,OAAS,EAAGK,GAAK,EAAGA,IAChClC,KAAK8P,MAAM5N,EAAI4a,GAAK9c,KAAK8P,MAAM5N,GAGjC,IAAKA,EAAI,EAAGA,EAAI4a,EAAG5a,IACjBlC,KAAK8P,MAAM5N,GAAK,EAGlBlC,KAAK6B,QAAUib,EAGjB,OAAO9c,KAAKiR,SAGdxB,EAAGpO,UAAU+d,MAAQ,SAAgBH,GAGnC,OADArX,EAAyB,IAAlB5H,KAAK6P,UACL7P,KAAKgf,OAAOC,IAMrBxP,EAAGpO,UAAU6S,OAAS,SAAiB+K,EAAMI,EAAMC,GAEjD,IAAIC,EADJ3X,EAAuB,kBAATqX,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAInP,EAAI+O,EAAO,GACXnC,EAAI1M,KAAKC,KAAK4O,EAAO/O,GAAK,GAAIlQ,KAAK6B,QACnC2d,EAAO,SAAc,WAActP,GAAMA,EACzCuP,EAAcH,EAMlB,GAJAC,GAAKzC,EACLyC,EAAInP,KAAKK,IAAI,EAAG8O,GAGZE,EAAa,CACf,IAAK,IAAIvd,EAAI,EAAGA,EAAI4a,EAAG5a,IACrBud,EAAY3P,MAAM5N,GAAKlC,KAAK8P,MAAM5N,GAEpCud,EAAY5d,OAASib,EAGvB,GAAU,IAANA,QAEG,GAAI9c,KAAK6B,OAASib,EAEvB,IADA9c,KAAK6B,QAAUib,EACV5a,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAC3BlC,KAAK8P,MAAM5N,GAAKlC,KAAK8P,MAAM5N,EAAI4a,QAGjC9c,KAAK8P,MAAM,GAAK,EAChB9P,KAAK6B,OAAS,EAGhB,IAAIgR,EAAQ,EACZ,IAAK3Q,EAAIlC,KAAK6B,OAAS,EAAGK,GAAK,IAAgB,IAAV2Q,GAAe3Q,GAAKqd,GAAIrd,IAAK,CAChE,IAAIuP,EAAuB,EAAhBzR,KAAK8P,MAAM5N,GACtBlC,KAAK8P,MAAM5N,GAAM2Q,GAAU,GAAK3C,EAAOuB,IAASvB,EAChD2C,EAAQpB,EAAO+N,EAajB,OATIC,GAAyB,IAAV5M,IACjB4M,EAAY3P,MAAM2P,EAAY5d,UAAYgR,GAGxB,IAAhB7S,KAAK6B,SACP7B,KAAK8P,MAAM,GAAK,EAChB9P,KAAK6B,OAAS,GAGT7B,KAAKiR,SAGdxB,EAAGpO,UAAUqe,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADA1X,EAAyB,IAAlB5H,KAAK6P,UACL7P,KAAKkU,OAAO+K,EAAMI,EAAMC,IAIjC7P,EAAGpO,UAAUse,KAAO,SAAeV,GACjC,OAAOjf,KAAK8I,QAAQsW,MAAMH,IAG5BxP,EAAGpO,UAAUue,MAAQ,SAAgBX,GACnC,OAAOjf,KAAK8I,QAAQkW,OAAOC,IAI7BxP,EAAGpO,UAAUwe,KAAO,SAAeZ,GACjC,OAAOjf,KAAK8I,QAAQ4W,MAAMT,IAG5BxP,EAAGpO,UAAUye,MAAQ,SAAgBb,GACnC,OAAOjf,KAAK8I,QAAQoL,OAAO+K,IAI7BxP,EAAGpO,UAAUyT,MAAQ,SAAgBxC,GACnC1K,EAAsB,kBAAR0K,GAAoBA,GAAO,GACzC,IAAIpC,EAAIoC,EAAM,GACVwK,GAAKxK,EAAMpC,GAAK,GAChB8D,EAAI,GAAK9D,EAGb,GAAIlQ,KAAK6B,QAAUib,EAAG,OAAO,EAG7B,IAAI3L,EAAInR,KAAK8P,MAAMgN,GAEnB,SAAU3L,EAAI6C,IAIhBvE,EAAGpO,UAAU0e,OAAS,SAAiBd,GACrCrX,EAAuB,kBAATqX,GAAqBA,GAAQ,GAC3C,IAAI/O,EAAI+O,EAAO,GACXnC,GAAKmC,EAAO/O,GAAK,GAIrB,GAFAtI,EAAyB,IAAlB5H,KAAK6P,SAAgB,2CAExB7P,KAAK6B,QAAUib,EACjB,OAAO9c,KAQT,GALU,IAANkQ,GACF4M,IAEF9c,KAAK6B,OAASuO,KAAKC,IAAIyM,EAAG9c,KAAK6B,QAErB,IAANqO,EAAS,CACX,IAAIsP,EAAO,SAAc,WAActP,GAAMA,EAC7ClQ,KAAK8P,MAAM9P,KAAK6B,OAAS,IAAM2d,EAGjC,OAAOxf,KAAKiR,SAIdxB,EAAGpO,UAAU2e,MAAQ,SAAgBf,GACnC,OAAOjf,KAAK8I,QAAQiX,OAAOd,IAI7BxP,EAAGpO,UAAUuT,MAAQ,SAAgBlU,GAGnC,OAFAkH,EAAsB,kBAARlH,GACdkH,EAAOlH,EAAM,UACTA,EAAM,EAAUV,KAAKigB,OAAOvf,GAGV,IAAlBV,KAAK6P,SACa,IAAhB7P,KAAK6B,SAAiC,EAAhB7B,KAAK8P,MAAM,IAAUpP,GAC7CV,KAAK8P,MAAM,GAAKpP,GAAuB,EAAhBV,KAAK8P,MAAM,IAClC9P,KAAK6P,SAAW,EACT7P,OAGTA,KAAK6P,SAAW,EAChB7P,KAAKigB,MAAMvf,GACXV,KAAK6P,SAAW,EACT7P,MAIFA,KAAK2R,OAAOjR,IAGrB+O,EAAGpO,UAAUsQ,OAAS,SAAiBjR,GACrCV,KAAK8P,MAAM,IAAMpP,EAGjB,IAAK,IAAIwB,EAAI,EAAGA,EAAIlC,KAAK6B,QAAU7B,KAAK8P,MAAM5N,IAAM,SAAWA,IAC7DlC,KAAK8P,MAAM5N,IAAM,SACbA,IAAMlC,KAAK6B,OAAS,EACtB7B,KAAK8P,MAAM5N,EAAI,GAAK,EAEpBlC,KAAK8P,MAAM5N,EAAI,KAKnB,OAFAlC,KAAK6B,OAASuO,KAAKK,IAAIzQ,KAAK6B,OAAQK,EAAI,GAEjClC,MAITyP,EAAGpO,UAAU4e,MAAQ,SAAgBvf,GAGnC,GAFAkH,EAAsB,kBAARlH,GACdkH,EAAOlH,EAAM,UACTA,EAAM,EAAG,OAAOV,KAAK4U,OAAOlU,GAEhC,GAAsB,IAAlBV,KAAK6P,SAIP,OAHA7P,KAAK6P,SAAW,EAChB7P,KAAK4U,MAAMlU,GACXV,KAAK6P,SAAW,EACT7P,KAKT,GAFAA,KAAK8P,MAAM,IAAMpP,EAEG,IAAhBV,KAAK6B,QAAgB7B,KAAK8P,MAAM,GAAK,EACvC9P,KAAK8P,MAAM,IAAM9P,KAAK8P,MAAM,GAC5B9P,KAAK6P,SAAW,OAGhB,IAAK,IAAI3N,EAAI,EAAGA,EAAIlC,KAAK6B,QAAU7B,KAAK8P,MAAM5N,GAAK,EAAGA,IACpDlC,KAAK8P,MAAM5N,IAAM,SACjBlC,KAAK8P,MAAM5N,EAAI,IAAM,EAIzB,OAAOlC,KAAKiR,SAGdxB,EAAGpO,UAAU6e,KAAO,SAAexf,GACjC,OAAOV,KAAK8I,QAAQ8L,MAAMlU,IAG5B+O,EAAGpO,UAAU8e,KAAO,SAAezf,GACjC,OAAOV,KAAK8I,QAAQmX,MAAMvf,IAG5B+O,EAAGpO,UAAU+e,KAAO,WAGlB,OAFApgB,KAAK6P,SAAW,EAET7P,MAGTyP,EAAGpO,UAAUqT,IAAM,WACjB,OAAO1U,KAAK8I,QAAQsX,QAGtB3Q,EAAGpO,UAAUgf,aAAe,SAAuB3f,EAAK8P,EAAK8P,GAC3D,IACIpe,EAIAiP,EALAhB,EAAMzP,EAAImB,OAASye,EAGvBtgB,KAAK8R,QAAQ3B,GAGb,IAAI0C,EAAQ,EACZ,IAAK3Q,EAAI,EAAGA,EAAIxB,EAAImB,OAAQK,IAAK,CAC/BiP,GAA6B,EAAxBnR,KAAK8P,MAAM5N,EAAIoe,IAAczN,EAClC,IAAIlC,GAAwB,EAAfjQ,EAAIoP,MAAM5N,IAAUsO,EACjCW,GAAa,SAARR,EACLkC,GAAS1B,GAAK,KAAQR,EAAQ,SAAa,GAC3C3Q,KAAK8P,MAAM5N,EAAIoe,GAAa,SAAJnP,EAE1B,KAAOjP,EAAIlC,KAAK6B,OAASye,EAAOpe,IAC9BiP,GAA6B,EAAxBnR,KAAK8P,MAAM5N,EAAIoe,IAAczN,EAClCA,EAAQ1B,GAAK,GACbnR,KAAK8P,MAAM5N,EAAIoe,GAAa,SAAJnP,EAG1B,GAAc,IAAV0B,EAAa,OAAO7S,KAAKiR,QAK7B,IAFArJ,GAAkB,IAAXiL,GACPA,EAAQ,EACH3Q,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAC3BiP,IAAsB,EAAhBnR,KAAK8P,MAAM5N,IAAU2Q,EAC3BA,EAAQ1B,GAAK,GACbnR,KAAK8P,MAAM5N,GAAS,SAAJiP,EAIlB,OAFAnR,KAAK6P,SAAW,EAET7P,KAAKiR,SAGdxB,EAAGpO,UAAUkf,SAAW,SAAmB7f,EAAK8f,GAC9C,IAAIF,EAAQtgB,KAAK6B,OAASnB,EAAImB,OAE1B6Q,EAAI1S,KAAK8I,QACT6J,EAAIjS,EAGJ+f,EAA8B,EAAxB9N,EAAE7C,MAAM6C,EAAE9Q,OAAS,GACzB6e,EAAU1gB,KAAKoU,WAAWqM,GAC9BH,EAAQ,GAAKI,EACC,IAAVJ,IACF3N,EAAIA,EAAEiN,MAAMU,GACZ5N,EAAEsM,OAAOsB,GACTG,EAA8B,EAAxB9N,EAAE7C,MAAM6C,EAAE9Q,OAAS,IAI3B,IACImS,EADA4J,EAAIlL,EAAE7Q,OAAS8Q,EAAE9Q,OAGrB,GAAa,QAAT2e,EAAgB,CAClBxM,EAAI,IAAIvE,EAAG,MACXuE,EAAEnS,OAAS+b,EAAI,EACf5J,EAAElE,MAAQ,IAAI5M,MAAM8Q,EAAEnS,QACtB,IAAK,IAAIK,EAAI,EAAGA,EAAI8R,EAAEnS,OAAQK,IAC5B8R,EAAElE,MAAM5N,GAAK,EAIjB,IAAIye,EAAOjO,EAAE5J,QAAQuX,aAAa1N,EAAG,EAAGiL,GAClB,IAAlB+C,EAAK9Q,WACP6C,EAAIiO,EACA3M,IACFA,EAAElE,MAAM8N,GAAK,IAIjB,IAAK,IAAIzb,EAAIyb,EAAI,EAAGzb,GAAK,EAAGA,IAAK,CAC/B,IAAIye,EAAmC,UAAL,EAAxBlO,EAAE5C,MAAM6C,EAAE9Q,OAASM,KACE,EAA5BuQ,EAAE5C,MAAM6C,EAAE9Q,OAASM,EAAI,IAI1Bye,EAAKxQ,KAAKC,IAAKuQ,EAAKH,EAAO,EAAG,UAE9B/N,EAAE2N,aAAa1N,EAAGiO,EAAIze,GACtB,MAAsB,IAAfuQ,EAAE7C,SACP+Q,IACAlO,EAAE7C,SAAW,EACb6C,EAAE2N,aAAa1N,EAAG,EAAGxQ,GAChBuQ,EAAEW,WACLX,EAAE7C,UAAY,GAGdmE,IACFA,EAAElE,MAAM3N,GAAKye,GAajB,OAVI5M,GACFA,EAAE/C,QAEJyB,EAAEzB,QAGW,QAATuP,GAA4B,IAAVF,GACpB5N,EAAEwB,OAAOoM,GAGJ,CACLO,IAAK7M,GAAK,KACVxC,IAAKkB,IAQTjD,EAAGpO,UAAUyf,OAAS,SAAiBpgB,EAAK8f,EAAMO,GAGhD,OAFAnZ,GAAQlH,EAAI2S,UAERrT,KAAKqT,SACA,CACLwN,IAAK,IAAIpR,EAAG,GACZ+B,IAAK,IAAI/B,EAAG,IAKM,IAAlBzP,KAAK6P,UAAmC,IAAjBnP,EAAImP,UAC7B5Q,EAAMe,KAAKkV,MAAM4L,OAAOpgB,EAAK8f,GAEhB,QAATA,IACFK,EAAM5hB,EAAI4hB,IAAI3L,OAGH,QAATsL,IACFhP,EAAMvS,EAAIuS,IAAI0D,MACV6L,GAA6B,IAAjBvP,EAAI3B,UAClB2B,EAAI0E,KAAKxV,IAIN,CACLmgB,IAAKA,EACLrP,IAAKA,IAIa,IAAlBxR,KAAK6P,UAAmC,IAAjBnP,EAAImP,UAC7B5Q,EAAMe,KAAK8gB,OAAOpgB,EAAIwU,MAAOsL,GAEhB,QAATA,IACFK,EAAM5hB,EAAI4hB,IAAI3L,OAGT,CACL2L,IAAKA,EACLrP,IAAKvS,EAAIuS,MAI0B,KAAlCxR,KAAK6P,SAAWnP,EAAImP,WACvB5Q,EAAMe,KAAKkV,MAAM4L,OAAOpgB,EAAIwU,MAAOsL,GAEtB,QAATA,IACFhP,EAAMvS,EAAIuS,IAAI0D,MACV6L,GAA6B,IAAjBvP,EAAI3B,UAClB2B,EAAI2E,KAAKzV,IAIN,CACLmgB,IAAK5hB,EAAI4hB,IACTrP,IAAKA,IAOL9Q,EAAImB,OAAS7B,KAAK6B,QAAU7B,KAAK4Q,IAAIlQ,GAAO,EACvC,CACLmgB,IAAK,IAAIpR,EAAG,GACZ+B,IAAKxR,MAKU,IAAfU,EAAImB,OACO,QAAT2e,EACK,CACLK,IAAK7gB,KAAKghB,KAAKtgB,EAAIoP,MAAM,IACzB0B,IAAK,MAII,QAATgP,EACK,CACLK,IAAK,KACLrP,IAAK,IAAI/B,EAAGzP,KAAKsT,KAAK5S,EAAIoP,MAAM,MAI7B,CACL+Q,IAAK7gB,KAAKghB,KAAKtgB,EAAIoP,MAAM,IACzB0B,IAAK,IAAI/B,EAAGzP,KAAKsT,KAAK5S,EAAIoP,MAAM,MAI7B9P,KAAKugB,SAAS7f,EAAK8f,GAlF1B,IAAIK,EAAKrP,EAAKvS,GAsFhBwQ,EAAGpO,UAAUwf,IAAM,SAAcngB,GAC/B,OAAOV,KAAK8gB,OAAOpgB,EAAK,OAAO,GAAOmgB,KAIxCpR,EAAGpO,UAAUmQ,IAAM,SAAc9Q,GAC/B,OAAOV,KAAK8gB,OAAOpgB,EAAK,OAAO,GAAO8Q,KAGxC/B,EAAGpO,UAAU4f,KAAO,SAAevgB,GACjC,OAAOV,KAAK8gB,OAAOpgB,EAAK,OAAO,GAAM8Q,KAIvC/B,EAAGpO,UAAU6f,SAAW,SAAmBxgB,GACzC,IAAIygB,EAAKnhB,KAAK8gB,OAAOpgB,GAGrB,GAAIygB,EAAG3P,IAAI6B,SAAU,OAAO8N,EAAGN,IAE/B,IAAIrP,EAA0B,IAApB2P,EAAGN,IAAIhR,SAAiBsR,EAAG3P,IAAI2E,KAAKzV,GAAOygB,EAAG3P,IAEpD4P,EAAO1gB,EAAIof,MAAM,GACjBuB,EAAK3gB,EAAIuT,MAAM,GACfrD,EAAMY,EAAIZ,IAAIwQ,GAGlB,OAAIxQ,EAAM,GAAY,IAAPyQ,GAAoB,IAARzQ,EAAkBuQ,EAAGN,IAGrB,IAApBM,EAAGN,IAAIhR,SAAiBsR,EAAGN,IAAIZ,MAAM,GAAKkB,EAAGN,IAAIjM,MAAM,IAGhEnF,EAAGpO,UAAUiS,KAAO,SAAe5S,GACjCkH,EAAOlH,GAAO,UAId,IAHA,IAAIuL,GAAK,GAAK,IAAMvL,EAEhB4gB,EAAM,EACDpf,EAAIlC,KAAK6B,OAAS,EAAGK,GAAK,EAAGA,IACpCof,GAAOrV,EAAIqV,GAAuB,EAAhBthB,KAAK8P,MAAM5N,KAAWxB,EAG1C,OAAO4gB,GAIT7R,EAAGpO,UAAUkS,MAAQ,SAAgB7S,GACnCkH,EAAOlH,GAAO,UAGd,IADA,IAAImS,EAAQ,EACH3Q,EAAIlC,KAAK6B,OAAS,EAAGK,GAAK,EAAGA,IAAK,CACzC,IAAIiP,GAAqB,EAAhBnR,KAAK8P,MAAM5N,IAAkB,SAAR2Q,EAC9B7S,KAAK8P,MAAM5N,GAAMiP,EAAIzQ,EAAO,EAC5BmS,EAAQ1B,EAAIzQ,EAGd,OAAOV,KAAKiR,SAGdxB,EAAGpO,UAAU2f,KAAO,SAAetgB,GACjC,OAAOV,KAAK8I,QAAQyK,MAAM7S,IAG5B+O,EAAGpO,UAAUkgB,KAAO,SAAetV,GACjCrE,EAAsB,IAAfqE,EAAE4D,UACTjI,GAAQqE,EAAEoH,UAEV,IAAI0I,EAAI/b,KACJgc,EAAI/P,EAAEnD,QAGRiT,EADiB,IAAfA,EAAElM,SACAkM,EAAEkF,KAAKhV,GAEP8P,EAAEjT,QAIR,IAAI0Y,EAAI,IAAI/R,EAAG,GACXgS,EAAI,IAAIhS,EAAG,GAGXiS,EAAI,IAAIjS,EAAG,GACXkS,EAAI,IAAIlS,EAAG,GAEXmS,EAAI,EAER,MAAO7F,EAAE8F,UAAY7F,EAAE6F,SACrB9F,EAAE7H,OAAO,GACT8H,EAAE9H,OAAO,KACP0N,EAGJ,IAAIE,EAAK9F,EAAElT,QACPiZ,EAAKhG,EAAEjT,QAEX,OAAQiT,EAAE1I,SAAU,CAClB,IAAK,IAAInR,EAAI,EAAG8f,EAAK,EAAyB,KAArBjG,EAAEjM,MAAM,GAAKkS,IAAa9f,EAAI,KAAMA,EAAG8f,IAAO,GACvE,GAAI9f,EAAI,EAAG,CACT6Z,EAAE7H,OAAOhS,GACT,MAAOA,KAAM,GACPsf,EAAES,SAAWR,EAAEQ,WACjBT,EAAEtL,KAAK4L,GACPL,EAAEtL,KAAK4L,IAGTP,EAAEtN,OAAO,GACTuN,EAAEvN,OAAO,GAIb,IAAK,IAAI/R,EAAI,EAAG+f,EAAK,EAAyB,KAArBlG,EAAElM,MAAM,GAAKoS,IAAa/f,EAAI,KAAMA,EAAG+f,IAAO,GACvE,GAAI/f,EAAI,EAAG,CACT6Z,EAAE9H,OAAO/R,GACT,MAAOA,KAAM,GACPuf,EAAEO,SAAWN,EAAEM,WACjBP,EAAExL,KAAK4L,GACPH,EAAExL,KAAK4L,IAGTL,EAAExN,OAAO,GACTyN,EAAEzN,OAAO,GAIT6H,EAAEnL,IAAIoL,IAAM,GACdD,EAAE5F,KAAK6F,GACPwF,EAAErL,KAAKuL,GACPD,EAAEtL,KAAKwL,KAEP3F,EAAE7F,KAAK4F,GACP2F,EAAEvL,KAAKqL,GACPG,EAAExL,KAAKsL,IAIX,MAAO,CACL/O,EAAGgP,EACH/O,EAAGgP,EACHQ,IAAKnG,EAAEgD,OAAO4C,KAOlBnS,EAAGpO,UAAU+gB,OAAS,SAAiBnW,GACrCrE,EAAsB,IAAfqE,EAAE4D,UACTjI,GAAQqE,EAAEoH,UAEV,IAAIX,EAAI1S,KACJ2S,EAAI1G,EAAEnD,QAGR4J,EADiB,IAAfA,EAAE7C,SACA6C,EAAEuO,KAAKhV,GAEPyG,EAAE5J,QAGR,IAuCI7J,EAvCAojB,EAAK,IAAI5S,EAAG,GACZ6S,EAAK,IAAI7S,EAAG,GAEZ8S,EAAQ5P,EAAE7J,QAEd,MAAO4J,EAAE8P,KAAK,GAAK,GAAK7P,EAAE6P,KAAK,GAAK,EAAG,CACrC,IAAK,IAAItgB,EAAI,EAAG8f,EAAK,EAAyB,KAArBtP,EAAE5C,MAAM,GAAKkS,IAAa9f,EAAI,KAAMA,EAAG8f,IAAO,GACvE,GAAI9f,EAAI,EAAG,CACTwQ,EAAEwB,OAAOhS,GACT,MAAOA,KAAM,EACPmgB,EAAGJ,SACLI,EAAGnM,KAAKqM,GAGVF,EAAGnO,OAAO,GAId,IAAK,IAAI/R,EAAI,EAAG+f,EAAK,EAAyB,KAArBvP,EAAE7C,MAAM,GAAKoS,IAAa/f,EAAI,KAAMA,EAAG+f,IAAO,GACvE,GAAI/f,EAAI,EAAG,CACTwQ,EAAEuB,OAAO/R,GACT,MAAOA,KAAM,EACPmgB,EAAGL,SACLK,EAAGpM,KAAKqM,GAGVD,EAAGpO,OAAO,GAIVxB,EAAE9B,IAAI+B,IAAM,GACdD,EAAEyD,KAAKxD,GACP0P,EAAGlM,KAAKmM,KAER3P,EAAEwD,KAAKzD,GACP4P,EAAGnM,KAAKkM,IAeZ,OATEpjB,EADgB,IAAdyT,EAAE8P,KAAK,GACHH,EAEAC,EAGJrjB,EAAIujB,KAAK,GAAK,GAChBvjB,EAAIiX,KAAKjK,GAGJhN,GAGTwQ,EAAGpO,UAAU8gB,IAAM,SAAczhB,GAC/B,GAAIV,KAAKqT,SAAU,OAAO3S,EAAIgU,MAC9B,GAAIhU,EAAI2S,SAAU,OAAOrT,KAAK0U,MAE9B,IAAIhC,EAAI1S,KAAK8I,QACT6J,EAAIjS,EAAIoI,QACZ4J,EAAE7C,SAAW,EACb8C,EAAE9C,SAAW,EAGb,IAAK,IAAIyQ,EAAQ,EAAG5N,EAAEmP,UAAYlP,EAAEkP,SAAUvB,IAC5C5N,EAAEwB,OAAO,GACTvB,EAAEuB,OAAO,GAGX,EAAG,CACD,MAAOxB,EAAEmP,SACPnP,EAAEwB,OAAO,GAEX,MAAOvB,EAAEkP,SACPlP,EAAEuB,OAAO,GAGX,IAAIhE,EAAIwC,EAAE9B,IAAI+B,GACd,GAAIzC,EAAI,EAAG,CAET,IAAInK,EAAI2M,EACRA,EAAIC,EACJA,EAAI5M,OACC,GAAU,IAANmK,GAAyB,IAAdyC,EAAE6P,KAAK,GAC3B,MAGF9P,EAAEyD,KAAKxD,SACA,GAET,OAAOA,EAAEqM,OAAOsB,IAIlB7Q,EAAGpO,UAAUohB,KAAO,SAAe/hB,GACjC,OAAOV,KAAKuhB,KAAK7gB,GAAKgS,EAAEuO,KAAKvgB,IAG/B+O,EAAGpO,UAAUwgB,OAAS,WACpB,OAA+B,KAAP,EAAhB7hB,KAAK8P,MAAM,KAGrBL,EAAGpO,UAAU4gB,MAAQ,WACnB,OAA+B,KAAP,EAAhBjiB,KAAK8P,MAAM,KAIrBL,EAAGpO,UAAU4S,MAAQ,SAAgBvT,GACnC,OAAOV,KAAK8P,MAAM,GAAKpP,GAIzB+O,EAAGpO,UAAUqhB,MAAQ,SAAgBpQ,GACnC1K,EAAsB,kBAAR0K,GACd,IAAIpC,EAAIoC,EAAM,GACVwK,GAAKxK,EAAMpC,GAAK,GAChB8D,EAAI,GAAK9D,EAGb,GAAIlQ,KAAK6B,QAAUib,EAGjB,OAFA9c,KAAK8R,QAAQgL,EAAI,GACjB9c,KAAK8P,MAAMgN,IAAM9I,EACVhU,KAKT,IADA,IAAI6S,EAAQmB,EACH9R,EAAI4a,EAAa,IAAVjK,GAAe3Q,EAAIlC,KAAK6B,OAAQK,IAAK,CACnD,IAAIiP,EAAoB,EAAhBnR,KAAK8P,MAAM5N,GACnBiP,GAAK0B,EACLA,EAAQ1B,IAAM,GACdA,GAAK,SACLnR,KAAK8P,MAAM5N,GAAKiP,EAMlB,OAJc,IAAV0B,IACF7S,KAAK8P,MAAM5N,GAAK2Q,EAChB7S,KAAK6B,UAEA7B,MAGTyP,EAAGpO,UAAUgS,OAAS,WACpB,OAAuB,IAAhBrT,KAAK6B,QAAkC,IAAlB7B,KAAK8P,MAAM,IAGzCL,EAAGpO,UAAUmhB,KAAO,SAAe9hB,GACjC,IAOIzB,EAPA4Q,EAAWnP,EAAM,EAErB,GAAsB,IAAlBV,KAAK6P,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlB7P,KAAK6P,UAAkBA,EAAU,OAAO,EAK5C,GAHA7P,KAAKiR,QAGDjR,KAAK6B,OAAS,EAChB5C,EAAM,MACD,CACD4Q,IACFnP,GAAOA,GAGTkH,EAAOlH,GAAO,SAAW,qBAEzB,IAAIyQ,EAAoB,EAAhBnR,KAAK8P,MAAM,GACnB7Q,EAAMkS,IAAMzQ,EAAM,EAAIyQ,EAAIzQ,GAAO,EAAI,EAEvC,OAAsB,IAAlBV,KAAK6P,SAA8B,GAAN5Q,EAC1BA,GAOTwQ,EAAGpO,UAAUuP,IAAM,SAAclQ,GAC/B,GAAsB,IAAlBV,KAAK6P,UAAmC,IAAjBnP,EAAImP,SAAgB,OAAQ,EACvD,GAAsB,IAAlB7P,KAAK6P,UAAmC,IAAjBnP,EAAImP,SAAgB,OAAO,EAEtD,IAAI5Q,EAAMe,KAAK2iB,KAAKjiB,GACpB,OAAsB,IAAlBV,KAAK6P,SAA8B,GAAN5Q,EAC1BA,GAITwQ,EAAGpO,UAAUshB,KAAO,SAAejiB,GAEjC,GAAIV,KAAK6B,OAASnB,EAAImB,OAAQ,OAAO,EACrC,GAAI7B,KAAK6B,OAASnB,EAAImB,OAAQ,OAAQ,EAGtC,IADA,IAAI5C,EAAM,EACDiD,EAAIlC,KAAK6B,OAAS,EAAGK,GAAK,EAAGA,IAAK,CACzC,IAAIwQ,EAAoB,EAAhB1S,KAAK8P,MAAM5N,GACfyQ,EAAmB,EAAfjS,EAAIoP,MAAM5N,GAElB,GAAIwQ,IAAMC,EAAV,CACID,EAAIC,EACN1T,GAAO,EACEyT,EAAIC,IACb1T,EAAM,GAER,OAEF,OAAOA,GAGTwQ,EAAGpO,UAAUuhB,IAAM,SAAcliB,GAC/B,OAA0B,IAAnBV,KAAKwiB,KAAK9hB,IAGnB+O,EAAGpO,UAAUwhB,GAAK,SAAaniB,GAC7B,OAAyB,IAAlBV,KAAK4Q,IAAIlQ,IAGlB+O,EAAGpO,UAAUyhB,KAAO,SAAepiB,GACjC,OAAOV,KAAKwiB,KAAK9hB,IAAQ,GAG3B+O,EAAGpO,UAAU0hB,IAAM,SAAcriB,GAC/B,OAAOV,KAAK4Q,IAAIlQ,IAAQ,GAG1B+O,EAAGpO,UAAU2hB,IAAM,SAActiB,GAC/B,OAA2B,IAApBV,KAAKwiB,KAAK9hB,IAGnB+O,EAAGpO,UAAU4hB,GAAK,SAAaviB,GAC7B,OAA0B,IAAnBV,KAAK4Q,IAAIlQ,IAGlB+O,EAAGpO,UAAU6hB,KAAO,SAAexiB,GACjC,OAAOV,KAAKwiB,KAAK9hB,IAAQ,GAG3B+O,EAAGpO,UAAU8hB,IAAM,SAAcziB,GAC/B,OAAOV,KAAK4Q,IAAIlQ,IAAQ,GAG1B+O,EAAGpO,UAAU+hB,IAAM,SAAc1iB,GAC/B,OAA0B,IAAnBV,KAAKwiB,KAAK9hB,IAGnB+O,EAAGpO,UAAUgiB,GAAK,SAAa3iB,GAC7B,OAAyB,IAAlBV,KAAK4Q,IAAIlQ,IAOlB+O,EAAGM,IAAM,SAAcrP,GACrB,OAAO,IAAI4iB,EAAI5iB,IAGjB+O,EAAGpO,UAAUkiB,MAAQ,SAAgBC,GAGnC,OAFA5b,GAAQ5H,KAAK+P,IAAK,yCAClBnI,EAAyB,IAAlB5H,KAAK6P,SAAgB,iCACrB2T,EAAIC,UAAUzjB,MAAM0jB,UAAUF,IAGvC/T,EAAGpO,UAAUsiB,QAAU,WAErB,OADA/b,EAAO5H,KAAK+P,IAAK,wDACV/P,KAAK+P,IAAI6T,YAAY5jB,OAG9ByP,EAAGpO,UAAUqiB,UAAY,SAAoBF,GAE3C,OADAxjB,KAAK+P,IAAMyT,EACJxjB,MAGTyP,EAAGpO,UAAUwiB,SAAW,SAAmBL,GAEzC,OADA5b,GAAQ5H,KAAK+P,IAAK,yCACX/P,KAAK0jB,UAAUF,IAGxB/T,EAAGpO,UAAUyiB,OAAS,SAAiBpjB,GAErC,OADAkH,EAAO5H,KAAK+P,IAAK,sCACV/P,KAAK+P,IAAIqG,IAAIpW,KAAMU,IAG5B+O,EAAGpO,UAAU0iB,QAAU,SAAkBrjB,GAEvC,OADAkH,EAAO5H,KAAK+P,IAAK,uCACV/P,KAAK+P,IAAImG,KAAKlW,KAAMU,IAG7B+O,EAAGpO,UAAU2iB,OAAS,SAAiBtjB,GAErC,OADAkH,EAAO5H,KAAK+P,IAAK,sCACV/P,KAAK+P,IAAIsG,IAAIrW,KAAMU,IAG5B+O,EAAGpO,UAAU4iB,QAAU,SAAkBvjB,GAEvC,OADAkH,EAAO5H,KAAK+P,IAAK,uCACV/P,KAAK+P,IAAIoG,KAAKnW,KAAMU,IAG7B+O,EAAGpO,UAAU6iB,OAAS,SAAiBxjB,GAErC,OADAkH,EAAO5H,KAAK+P,IAAK,sCACV/P,KAAK+P,IAAIoU,IAAInkB,KAAMU,IAG5B+O,EAAGpO,UAAU+iB,OAAS,SAAiB1jB,GAGrC,OAFAkH,EAAO5H,KAAK+P,IAAK,sCACjB/P,KAAK+P,IAAIsU,SAASrkB,KAAMU,GACjBV,KAAK+P,IAAIS,IAAIxQ,KAAMU,IAG5B+O,EAAGpO,UAAUijB,QAAU,SAAkB5jB,GAGvC,OAFAkH,EAAO5H,KAAK+P,IAAK,sCACjB/P,KAAK+P,IAAIsU,SAASrkB,KAAMU,GACjBV,KAAK+P,IAAIsK,KAAKra,KAAMU,IAG7B+O,EAAGpO,UAAUkjB,OAAS,WAGpB,OAFA3c,EAAO5H,KAAK+P,IAAK,sCACjB/P,KAAK+P,IAAIyU,SAASxkB,MACXA,KAAK+P,IAAI+O,IAAI9e,OAGtByP,EAAGpO,UAAUojB,QAAU,WAGrB,OAFA7c,EAAO5H,KAAK+P,IAAK,uCACjB/P,KAAK+P,IAAIyU,SAASxkB,MACXA,KAAK+P,IAAIgP,KAAK/e,OAIvByP,EAAGpO,UAAUqjB,QAAU,WAGrB,OAFA9c,EAAO5H,KAAK+P,IAAK,uCACjB/P,KAAK+P,IAAIyU,SAASxkB,MACXA,KAAK+P,IAAI4U,KAAK3kB,OAGvByP,EAAGpO,UAAUujB,QAAU,WAGrB,OAFAhd,EAAO5H,KAAK+P,IAAK,uCACjB/P,KAAK+P,IAAIyU,SAASxkB,MACXA,KAAK+P,IAAI0S,KAAKziB,OAIvByP,EAAGpO,UAAUwjB,OAAS,WAGpB,OAFAjd,EAAO5H,KAAK+P,IAAK,sCACjB/P,KAAK+P,IAAIyU,SAASxkB,MACXA,KAAK+P,IAAImF,IAAIlV,OAGtByP,EAAGpO,UAAUyjB,OAAS,SAAiBpkB,GAGrC,OAFAkH,EAAO5H,KAAK+P,MAAQrP,EAAIqP,IAAK,qBAC7B/P,KAAK+P,IAAIyU,SAASxkB,MACXA,KAAK+P,IAAI6B,IAAI5R,KAAMU,IAI5B,IAAIqkB,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQllB,EAAM+L,GAErBjM,KAAKE,KAAOA,EACZF,KAAKiM,EAAI,IAAIwD,EAAGxD,EAAG,IACnBjM,KAAK2d,EAAI3d,KAAKiM,EAAEoG,YAChBrS,KAAK8S,EAAI,IAAIrD,EAAG,GAAGuP,OAAOhf,KAAK2d,GAAGxH,KAAKnW,KAAKiM,GAE5CjM,KAAKqlB,IAAMrlB,KAAKslB,OAiDlB,SAASC,IACPH,EAAO5kB,KACLR,KACA,OACA,2EA+DJ,SAASwlB,IACPJ,EAAO5kB,KACLR,KACA,OACA,kEAIJ,SAASylB,IACPL,EAAO5kB,KACLR,KACA,OACA,yDAIJ,SAAS0lB,IAEPN,EAAO5kB,KACLR,KACA,QACA,uEA8CJ,SAASsjB,EAAK1F,GACZ,GAAiB,kBAANA,EAAgB,CACzB,IAAI+H,EAAQlW,EAAGmW,OAAOhI,GACtB5d,KAAK4d,EAAI+H,EAAM1Z,EACfjM,KAAK2lB,MAAQA,OAEb/d,EAAOgW,EAAEgF,IAAI,GAAI,kCACjB5iB,KAAK4d,EAAIA,EACT5d,KAAK2lB,MAAQ,KAkOjB,SAASE,EAAMjI,GACb0F,EAAI9iB,KAAKR,KAAM4d,GAEf5d,KAAKsgB,MAAQtgB,KAAK4d,EAAEvL,YAChBrS,KAAKsgB,MAAQ,KAAO,IACtBtgB,KAAKsgB,OAAS,GAAMtgB,KAAKsgB,MAAQ,IAGnCtgB,KAAKkQ,EAAI,IAAIT,EAAG,GAAGuP,OAAOhf,KAAKsgB,OAC/BtgB,KAAKqhB,GAAKrhB,KAAK8lB,KAAK9lB,KAAKkQ,EAAE4O,OAC3B9e,KAAK+lB,KAAO/lB,KAAKkQ,EAAEkS,OAAOpiB,KAAK4d,GAE/B5d,KAAKgmB,KAAOhmB,KAAK+lB,KAAKvV,IAAIxQ,KAAKkQ,GAAG+P,MAAM,GAAGY,IAAI7gB,KAAK4d,GACpD5d,KAAKgmB,KAAOhmB,KAAKgmB,KAAK/E,KAAKjhB,KAAKkQ,GAChClQ,KAAKgmB,KAAOhmB,KAAKkQ,EAAEmG,IAAIrW,KAAKgmB,MA5a9BZ,EAAO/jB,UAAUikB,KAAO,WACtB,IAAID,EAAM,IAAI5V,EAAG,MAEjB,OADA4V,EAAIvV,MAAQ,IAAI5M,MAAMkN,KAAKc,KAAKlR,KAAK2d,EAAI,KAClC0H,GAGTD,EAAO/jB,UAAU4kB,QAAU,SAAkBvlB,GAG3C,IACIwlB,EADAhW,EAAIxP,EAGR,GACEV,KAAKiD,MAAMiN,EAAGlQ,KAAKqlB,KACnBnV,EAAIlQ,KAAKmmB,MAAMjW,GACfA,EAAIA,EAAEgG,KAAKlW,KAAKqlB,KAChBa,EAAOhW,EAAEmC,kBACF6T,EAAOlmB,KAAK2d,GAErB,IAAI/M,EAAMsV,EAAOlmB,KAAK2d,GAAK,EAAIzN,EAAEyS,KAAK3iB,KAAKiM,GAgB3C,OAfY,IAAR2E,GACFV,EAAEJ,MAAM,GAAK,EACbI,EAAErO,OAAS,GACF+O,EAAM,EACfV,EAAEiG,KAAKnW,KAAKiM,QAEIzG,IAAZ0K,EAAEe,MAEJf,EAAEe,QAGFf,EAAEkW,SAIClW,GAGTkV,EAAO/jB,UAAU4B,MAAQ,SAAgB8G,EAAOjF,GAC9CiF,EAAMmK,OAAOlU,KAAK2d,EAAG,EAAG7Y,IAG1BsgB,EAAO/jB,UAAU8kB,MAAQ,SAAgBzlB,GACvC,OAAOA,EAAI2Z,KAAKra,KAAK8S,IASvBnT,EAAS4lB,EAAMH,GAEfG,EAAKlkB,UAAU4B,MAAQ,SAAgB8G,EAAOsc,GAK5C,IAHA,IAAI7G,EAAO,QAEP8G,EAASlW,KAAKC,IAAItG,EAAMlI,OAAQ,GAC3BK,EAAI,EAAGA,EAAIokB,EAAQpkB,IAC1BmkB,EAAOvW,MAAM5N,GAAK6H,EAAM+F,MAAM5N,GAIhC,GAFAmkB,EAAOxkB,OAASykB,EAEZvc,EAAMlI,QAAU,EAGlB,OAFAkI,EAAM+F,MAAM,GAAK,OACjB/F,EAAMlI,OAAS,GAKjB,IAAI0kB,EAAOxc,EAAM+F,MAAM,GAGvB,IAFAuW,EAAOvW,MAAMuW,EAAOxkB,UAAY0kB,EAAO/G,EAElCtd,EAAI,GAAIA,EAAI6H,EAAMlI,OAAQK,IAAK,CAClC,IAAIskB,EAAwB,EAAjBzc,EAAM+F,MAAM5N,GACvB6H,EAAM+F,MAAM5N,EAAI,KAAQskB,EAAOhH,IAAS,EAAM+G,IAAS,GACvDA,EAAOC,EAETD,KAAU,GACVxc,EAAM+F,MAAM5N,EAAI,IAAMqkB,EACT,IAATA,GAAcxc,EAAMlI,OAAS,GAC/BkI,EAAMlI,QAAU,GAEhBkI,EAAMlI,QAAU,GAIpB0jB,EAAKlkB,UAAU8kB,MAAQ,SAAgBzlB,GAErCA,EAAIoP,MAAMpP,EAAImB,QAAU,EACxBnB,EAAIoP,MAAMpP,EAAImB,OAAS,GAAK,EAC5BnB,EAAImB,QAAU,EAId,IADA,IAAI+Q,EAAK,EACA1Q,EAAI,EAAGA,EAAIxB,EAAImB,OAAQK,IAAK,CACnC,IAAIiP,EAAmB,EAAfzQ,EAAIoP,MAAM5N,GAClB0Q,GAAU,IAAJzB,EACNzQ,EAAIoP,MAAM5N,GAAU,SAAL0Q,EACfA,EAAS,GAAJzB,GAAayB,EAAK,SAAa,GAUtC,OANkC,IAA9BlS,EAAIoP,MAAMpP,EAAImB,OAAS,KACzBnB,EAAImB,SAC8B,IAA9BnB,EAAIoP,MAAMpP,EAAImB,OAAS,IACzBnB,EAAImB,UAGDnB,GASTf,EAAS6lB,EAAMJ,GAQfzlB,EAAS8lB,EAAML,GASfzlB,EAAS+lB,EAAQN,GAEjBM,EAAOrkB,UAAU8kB,MAAQ,SAAgBzlB,GAGvC,IADA,IAAImS,EAAQ,EACH3Q,EAAI,EAAGA,EAAIxB,EAAImB,OAAQK,IAAK,CACnC,IAAIoS,EAA0B,IAAL,EAAf5T,EAAIoP,MAAM5N,IAAiB2Q,EACjCD,EAAU,SAAL0B,EACTA,KAAQ,GAER5T,EAAIoP,MAAM5N,GAAK0Q,EACfC,EAAQyB,EAKV,OAHc,IAAVzB,IACFnS,EAAIoP,MAAMpP,EAAImB,UAAYgR,GAErBnS,GAIT+O,EAAGmW,OAAS,SAAgB1lB,GAE1B,GAAI6kB,EAAO7kB,GAAO,OAAO6kB,EAAO7kB,GAEhC,IAAIylB,EACJ,GAAa,SAATzlB,EACFylB,EAAQ,IAAIJ,OACP,GAAa,SAATrlB,EACTylB,EAAQ,IAAIH,OACP,GAAa,SAATtlB,EACTylB,EAAQ,IAAIF,MACP,IAAa,WAATvlB,EAGT,MAAM,IAAIwJ,MAAM,iBAAmBxJ,GAFnCylB,EAAQ,IAAID,EAMd,OAFAX,EAAO7kB,GAAQylB,EAERA,GAkBTrC,EAAIjiB,UAAUmjB,SAAW,SAAmB9R,GAC1C9K,EAAsB,IAAf8K,EAAE7C,SAAgB,iCACzBjI,EAAO8K,EAAE3C,IAAK,oCAGhBuT,EAAIjiB,UAAUgjB,SAAW,SAAmB3R,EAAGC,GAC7C/K,EAAqC,KAA7B8K,EAAE7C,SAAW8C,EAAE9C,UAAiB,iCACxCjI,EAAO8K,EAAE3C,KAAO2C,EAAE3C,MAAQ4C,EAAE5C,IAC1B,oCAGJuT,EAAIjiB,UAAUykB,KAAO,SAAepT,GAClC,OAAI1S,KAAK2lB,MAAc3lB,KAAK2lB,MAAMM,QAAQvT,GAAGgR,UAAU1jB,MAChD0S,EAAEuO,KAAKjhB,KAAK4d,GAAG8F,UAAU1jB,OAGlCsjB,EAAIjiB,UAAU6T,IAAM,SAAcxC,GAChC,OAAIA,EAAEW,SACGX,EAAE5J,QAGJ9I,KAAK4d,EAAEvH,IAAI3D,GAAGgR,UAAU1jB,OAGjCsjB,EAAIjiB,UAAU+U,IAAM,SAAc1D,EAAGC,GACnC3S,KAAKqkB,SAAS3R,EAAGC,GAEjB,IAAI1T,EAAMyT,EAAE0D,IAAIzD,GAIhB,OAHI1T,EAAI2R,IAAI5Q,KAAK4d,IAAM,GACrB3e,EAAIkX,KAAKnW,KAAK4d,GAET3e,EAAIykB,UAAU1jB,OAGvBsjB,EAAIjiB,UAAU6U,KAAO,SAAexD,EAAGC,GACrC3S,KAAKqkB,SAAS3R,EAAGC,GAEjB,IAAI1T,EAAMyT,EAAEwD,KAAKvD,GAIjB,OAHI1T,EAAI2R,IAAI5Q,KAAK4d,IAAM,GACrB3e,EAAIkX,KAAKnW,KAAK4d,GAET3e,GAGTqkB,EAAIjiB,UAAUgV,IAAM,SAAc3D,EAAGC,GACnC3S,KAAKqkB,SAAS3R,EAAGC,GAEjB,IAAI1T,EAAMyT,EAAE2D,IAAI1D,GAIhB,OAHI1T,EAAIujB,KAAK,GAAK,GAChBvjB,EAAIiX,KAAKlW,KAAK4d,GAET3e,EAAIykB,UAAU1jB,OAGvBsjB,EAAIjiB,UAAU8U,KAAO,SAAezD,EAAGC,GACrC3S,KAAKqkB,SAAS3R,EAAGC,GAEjB,IAAI1T,EAAMyT,EAAEyD,KAAKxD,GAIjB,OAHI1T,EAAIujB,KAAK,GAAK,GAChBvjB,EAAIiX,KAAKlW,KAAK4d,GAET3e,GAGTqkB,EAAIjiB,UAAU8iB,IAAM,SAAczR,EAAGhS,GAEnC,OADAV,KAAKwkB,SAAS9R,GACP1S,KAAK8lB,KAAKpT,EAAEkN,MAAMlf,KAG3B4iB,EAAIjiB,UAAUgZ,KAAO,SAAe3H,EAAGC,GAErC,OADA3S,KAAKqkB,SAAS3R,EAAGC,GACV3S,KAAK8lB,KAAKpT,EAAE2H,KAAK1H,KAG1B2Q,EAAIjiB,UAAUmP,IAAM,SAAckC,EAAGC,GAEnC,OADA3S,KAAKqkB,SAAS3R,EAAGC,GACV3S,KAAK8lB,KAAKpT,EAAElC,IAAImC,KAGzB2Q,EAAIjiB,UAAU0d,KAAO,SAAerM,GAClC,OAAO1S,KAAKqa,KAAK3H,EAAGA,EAAE5J,UAGxBwa,EAAIjiB,UAAUyd,IAAM,SAAcpM,GAChC,OAAO1S,KAAKwQ,IAAIkC,EAAGA,IAGrB4Q,EAAIjiB,UAAUsjB,KAAO,SAAejS,GAClC,GAAIA,EAAEW,SAAU,OAAOX,EAAE5J,QAEzB,IAAI2d,EAAOzmB,KAAK4d,EAAE3J,MAAM,GAIxB,GAHArM,EAAO6e,EAAO,IAAM,GAGP,IAATA,EAAY,CACd,IAAI7U,EAAM5R,KAAK4d,EAAExH,IAAI,IAAI3G,EAAG,IAAIyE,OAAO,GACvC,OAAOlU,KAAK4R,IAAIc,EAAGd,GAMrB,IAAIoC,EAAIhU,KAAK4d,EAAEuC,KAAK,GAChBrD,EAAI,EACR,OAAQ9I,EAAEX,UAA2B,IAAfW,EAAEC,MAAM,GAC5B6I,IACA9I,EAAEE,OAAO,GAEXtM,GAAQoM,EAAEX,UAEV,IAAIqT,EAAM,IAAIjX,EAAG,GAAG8T,MAAMvjB,MACtB2mB,EAAOD,EAAI7B,SAIX+B,EAAO5mB,KAAK4d,EAAEuC,KAAK,GAAGjM,OAAO,GAC7B2S,EAAI7mB,KAAK4d,EAAEvL,YACfwU,EAAI,IAAIpX,EAAG,EAAIoX,EAAIA,GAAGtD,MAAMvjB,MAE5B,MAAuC,IAAhCA,KAAK4R,IAAIiV,EAAGD,GAAMhW,IAAI+V,GAC3BE,EAAE9C,QAAQ4C,GAGZ,IAAIrW,EAAItQ,KAAK4R,IAAIiV,EAAG7S,GAChB9D,EAAIlQ,KAAK4R,IAAIc,EAAGsB,EAAEkM,KAAK,GAAGhM,OAAO,IACjCnO,EAAI/F,KAAK4R,IAAIc,EAAGsB,GAChB4J,EAAId,EACR,MAAsB,IAAf/W,EAAE6K,IAAI8V,GAAY,CAEvB,IADA,IAAIrB,EAAMtf,EACD7D,EAAI,EAAoB,IAAjBmjB,EAAIzU,IAAI8V,GAAYxkB,IAClCmjB,EAAMA,EAAId,SAEZ3c,EAAO1F,EAAI0b,GACX,IAAIjL,EAAI3S,KAAK4R,IAAItB,EAAG,IAAIb,EAAG,GAAGuP,OAAOpB,EAAI1b,EAAI,IAE7CgO,EAAIA,EAAEkU,OAAOzR,GACbrC,EAAIqC,EAAE4R,SACNxe,EAAIA,EAAEqe,OAAO9T,GACbsN,EAAI1b,EAGN,OAAOgO,GAGToT,EAAIjiB,UAAUohB,KAAO,SAAe/P,GAClC,IAAIoU,EAAMpU,EAAE0P,OAAOpiB,KAAK4d,GACxB,OAAqB,IAAjBkJ,EAAIjX,UACNiX,EAAIjX,SAAW,EACR7P,KAAK8lB,KAAKgB,GAAKjC,UAEf7kB,KAAK8lB,KAAKgB,IAIrBxD,EAAIjiB,UAAUuQ,IAAM,SAAcc,EAAGhS,GACnC,GAAIA,EAAI2S,SAAU,OAAO,IAAI5D,EAAG,GAAG8T,MAAMvjB,MACzC,GAAoB,IAAhBU,EAAI8hB,KAAK,GAAU,OAAO9P,EAAE5J,QAEhC,IAAIie,EAAa,EACbC,EAAM,IAAI9jB,MAAM,GAAK6jB,GACzBC,EAAI,GAAK,IAAIvX,EAAG,GAAG8T,MAAMvjB,MACzBgnB,EAAI,GAAKtU,EACT,IAAK,IAAIxQ,EAAI,EAAGA,EAAI8kB,EAAInlB,OAAQK,IAC9B8kB,EAAI9kB,GAAKlC,KAAKwQ,IAAIwW,EAAI9kB,EAAI,GAAIwQ,GAGhC,IAAIzT,EAAM+nB,EAAI,GACVC,EAAU,EACVC,EAAa,EACbtc,EAAQlK,EAAI2R,YAAc,GAK9B,IAJc,IAAVzH,IACFA,EAAQ,IAGL1I,EAAIxB,EAAImB,OAAS,EAAGK,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAIuP,EAAO/Q,EAAIoP,MAAM5N,GACZC,EAAIyI,EAAQ,EAAGzI,GAAK,EAAGA,IAAK,CACnC,IAAImQ,EAAOb,GAAQtP,EAAK,EACpBlD,IAAQ+nB,EAAI,KACd/nB,EAAMe,KAAK8e,IAAI7f,IAGL,IAARqT,GAAyB,IAAZ2U,GAKjBA,IAAY,EACZA,GAAW3U,EACX4U,KACIA,IAAeH,GAAqB,IAAN7kB,GAAiB,IAANC,KAE7ClD,EAAMe,KAAKwQ,IAAIvR,EAAK+nB,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,EAajBtc,EAAQ,GAGV,OAAO3L,GAGTqkB,EAAIjiB,UAAUoiB,UAAY,SAAoB/iB,GAC5C,IAAIwP,EAAIxP,EAAIugB,KAAKjhB,KAAK4d,GAEtB,OAAO1N,IAAMxP,EAAMwP,EAAEpH,QAAUoH,GAGjCoT,EAAIjiB,UAAUuiB,YAAc,SAAsBljB,GAChD,IAAIzB,EAAMyB,EAAIoI,QAEd,OADA7J,EAAI8Q,IAAM,KACH9Q,GAOTwQ,EAAG0X,KAAO,SAAezmB,GACvB,OAAO,IAAImlB,EAAKnlB,IAmBlBf,EAASkmB,EAAMvC,GAEfuC,EAAKxkB,UAAUoiB,UAAY,SAAoB/iB,GAC7C,OAAOV,KAAK8lB,KAAKplB,EAAIkf,MAAM5f,KAAKsgB,SAGlCuF,EAAKxkB,UAAUuiB,YAAc,SAAsBljB,GACjD,IAAIwP,EAAIlQ,KAAK8lB,KAAKplB,EAAI8P,IAAIxQ,KAAK+lB,OAE/B,OADA7V,EAAEH,IAAM,KACDG,GAGT2V,EAAKxkB,UAAUgZ,KAAO,SAAe3H,EAAGC,GACtC,GAAID,EAAEW,UAAYV,EAAEU,SAGlB,OAFAX,EAAE5C,MAAM,GAAK,EACb4C,EAAE7Q,OAAS,EACJ6Q,EAGT,IAAI3M,EAAI2M,EAAE2H,KAAK1H,GACXrC,EAAIvK,EAAEia,MAAMhgB,KAAKsgB,OAAO9P,IAAIxQ,KAAKgmB,MAAMjG,OAAO/f,KAAKsgB,OAAO9P,IAAIxQ,KAAK4d,GACnEwJ,EAAIrhB,EAAEoQ,KAAK7F,GAAG4D,OAAOlU,KAAKsgB,OAC1BrhB,EAAMmoB,EAQV,OANIA,EAAExW,IAAI5Q,KAAK4d,IAAM,EACnB3e,EAAMmoB,EAAEjR,KAAKnW,KAAK4d,GACTwJ,EAAE5E,KAAK,GAAK,IACrBvjB,EAAMmoB,EAAElR,KAAKlW,KAAK4d,IAGb3e,EAAIykB,UAAU1jB,OAGvB6lB,EAAKxkB,UAAUmP,IAAM,SAAckC,EAAGC,GACpC,GAAID,EAAEW,UAAYV,EAAEU,SAAU,OAAO,IAAI5D,EAAG,GAAGiU,UAAU1jB,MAEzD,IAAI+F,EAAI2M,EAAElC,IAAImC,GACVrC,EAAIvK,EAAEia,MAAMhgB,KAAKsgB,OAAO9P,IAAIxQ,KAAKgmB,MAAMjG,OAAO/f,KAAKsgB,OAAO9P,IAAIxQ,KAAK4d,GACnEwJ,EAAIrhB,EAAEoQ,KAAK7F,GAAG4D,OAAOlU,KAAKsgB,OAC1BrhB,EAAMmoB,EAOV,OANIA,EAAExW,IAAI5Q,KAAK4d,IAAM,EACnB3e,EAAMmoB,EAAEjR,KAAKnW,KAAK4d,GACTwJ,EAAE5E,KAAK,GAAK,IACrBvjB,EAAMmoB,EAAElR,KAAKlW,KAAK4d,IAGb3e,EAAIykB,UAAU1jB,OAGvB6lB,EAAKxkB,UAAUohB,KAAO,SAAe/P,GAEnC,IAAIzT,EAAMe,KAAK8lB,KAAKpT,EAAE0P,OAAOpiB,KAAK4d,GAAGpN,IAAIxQ,KAAKqhB,KAC9C,OAAOpiB,EAAIykB,UAAU1jB,QAt2GzB,CAw2GoCoB,EAAQpB,Q,2DCt2G5C,MAAML,EAAW,EAAQ,QAEnB+H,EAAS,EAAQ,SACjBvB,EAAgB,EAAQ,QAAkBA,cAC1CtG,EAAO,EAAQ,QAGfN,EAAM,EAAQ,QAEpB,SAASkP,EAAW1O,GAClBC,KAAKC,IAAM,MACXD,KAAKE,KAAOH,EAAOG,KACnBF,KAAKD,OAASA,EAGdC,KAAKG,KAAO,IAAIC,EAChBJ,KAAKG,KAAKE,MAAMN,EAAOO,MAczB,SAASF,EAAQG,GACfV,EAAKW,KAAKR,KAAM,MAAOO,GA8OzB,SAAS8mB,EAAa9kB,EAAK2E,GACzB,IAAItG,EAAM2B,EAAIwE,UAAUG,GACxB,GAAI3E,EAAIgI,QAAQ3J,GACd,OAAOA,EAET,MAAME,EAAMvB,EAAI8M,SAASzL,GAAO,GAC1BC,EAA6B,KAAV,GAAND,GAGnB,GAAqB,MAAV,GAANA,GAAsB,CACzB,IAAI0mB,EAAM1mB,EACVA,EAAM,EACN,MAAwB,OAAV,IAAN0mB,GAAsB,CAE5B,GADAA,EAAM/kB,EAAIwE,UAAUG,GAChB3E,EAAIgI,QAAQ+c,GACd,OAAOA,EAET1mB,IAAQ,EACRA,GAAa,IAAN0mB,QAGT1mB,GAAO,GAET,MAAM2mB,EAAShoB,EAAIqB,IAAIA,GAEvB,MAAO,CACLE,IAAKA,EACLD,UAAWA,EACXD,IAAKA,EACL2mB,OAAQA,GAIZ,SAASC,EAAajlB,EAAK1B,EAAWqG,GACpC,IAAIiJ,EAAM5N,EAAIwE,UAAUG,GACxB,GAAI3E,EAAIgI,QAAQ4F,GACd,OAAOA,EAGT,IAAKtP,GAAqB,MAARsP,EAChB,OAAO,KAGT,GAAqB,KAAV,IAANA,GAEH,OAAOA,EAIT,MAAMzP,EAAY,IAANyP,EACZ,GAAIzP,EAAM,EACR,OAAO6B,EAAIrB,MAAM,6BAEnBiP,EAAM,EACN,IAAK,IAAIjO,EAAI,EAAGA,EAAIxB,EAAKwB,IAAK,CAC5BiO,IAAQ,EACR,MAAMhO,EAAII,EAAIwE,UAAUG,GACxB,GAAI3E,EAAIgI,QAAQpI,GACd,OAAOA,EACTgO,GAAOhO,EAGT,OAAOgO,EAzTT/O,EAAOtC,QAAU2P,EAEjBA,EAAWpN,UAAUsN,OAAS,SAAgBpN,EAAM8E,GAKlD,OAJKF,EAAcM,gBAAgBlF,KACjCA,EAAO,IAAI4E,EAAc5E,EAAM8E,IAG1BrG,KAAKG,KAAK2J,QAAQvI,EAAM8E,IAQjC1G,EAASS,EAASP,GAElBO,EAAQiB,UAAUiJ,SAAW,SAAiBmd,EAAQ7mB,EAAK0H,GACzD,GAAImf,EAAO3gB,UACT,OAAO,EAET,MAAMxB,EAAQmiB,EAAO7gB,OACf8gB,EAAaL,EAAaI,EAAQ,wBAA0B7mB,EAAM,KACxE,OAAI6mB,EAAOld,QAAQmd,GACVA,GAETD,EAAO5gB,QAAQvB,GAERoiB,EAAW9mB,MAAQA,GAAO8mB,EAAWH,SAAW3mB,GACpD8mB,EAAWH,OAAS,OAAU3mB,GAAO0H,IAG1ClI,EAAQiB,UAAUsJ,WAAa,SAAmB8c,EAAQ7mB,EAAK0H,GAC7D,MAAMof,EAAaL,EAAaI,EAC9B,4BAA8B7mB,EAAM,KACtC,GAAI6mB,EAAOld,QAAQmd,GACjB,OAAOA,EAET,IAAIvX,EAAMqX,EAAaC,EACrBC,EAAW7mB,UACX,4BAA8BD,EAAM,KAGtC,GAAI6mB,EAAOld,QAAQ4F,GACjB,OAAOA,EAET,IAAK7H,GACDof,EAAW9mB,MAAQA,GACnB8mB,EAAWH,SAAW3mB,GACtB8mB,EAAWH,OAAS,OAAS3mB,EAC/B,OAAO6mB,EAAOvmB,MAAM,yBAA2BN,EAAM,KAGvD,GAAI8mB,EAAW7mB,WAAqB,OAARsP,EAC1B,OAAOsX,EAAOzgB,KAAKmJ,EAAK,6BAA+BvP,EAAM,KAG/D,MAAM0E,EAAQmiB,EAAO7gB,OACf3H,EAAMe,KAAK2nB,cACfF,EACA,2CAA6CznB,KAAKY,IAAM,KAC1D,OAAI6mB,EAAOld,QAAQtL,GACVA,GAETkR,EAAMsX,EAAO9jB,OAAS2B,EAAM3B,OAC5B8jB,EAAO5gB,QAAQvB,GACRmiB,EAAOzgB,KAAKmJ,EAAK,6BAA+BvP,EAAM,OAG/DR,EAAQiB,UAAUsmB,cAAgB,SAAsBF,EAAQvgB,GAC9D,OAAS,CACP,MAAMtG,EAAMymB,EAAaI,EAAQvgB,GACjC,GAAIugB,EAAOld,QAAQ3J,GACjB,OAAOA,EACT,MAAMuP,EAAMqX,EAAaC,EAAQ7mB,EAAIC,UAAWqG,GAChD,GAAIugB,EAAOld,QAAQ4F,GACjB,OAAOA,EAET,IAAIlR,EAOJ,GALEA,EADE2B,EAAIC,WAAqB,OAARsP,EACbsX,EAAOzgB,KAAKmJ,GAEZnQ,KAAK2nB,cAAcF,EAAQvgB,GAG/BugB,EAAOld,QAAQtL,GACjB,OAAOA,EAET,GAAmB,QAAf2B,EAAI2mB,OACN,QAINnnB,EAAQiB,UAAU8J,YAAc,SAAoBsc,EAAQ7mB,EAAKgnB,EAC/DvhB,GACA,MAAM6D,EAAS,GACf,OAAQud,EAAO3gB,UAAW,CACxB,MAAM+gB,EAAc7nB,KAAKsK,SAASmd,EAAQ,OAC1C,GAAIA,EAAOld,QAAQsd,GACjB,OAAOA,EAET,MAAM5oB,EAAM2oB,EAAQjZ,OAAO8Y,EAAQ,MAAOphB,GAC1C,GAAIohB,EAAOld,QAAQtL,IAAQ4oB,EACzB,MACF3d,EAAOhB,KAAKjK,GAEd,OAAOiL,GAGT9J,EAAQiB,UAAU+J,WAAa,SAAmBqc,EAAQ7mB,GACxD,GAAY,WAARA,EAAkB,CACpB,MAAM0B,EAASmlB,EAAO1gB,YACtB,OAAI0gB,EAAOld,QAAQjI,GACVA,EACF,CAAEA,OAAQA,EAAQf,KAAMkmB,EAAOxgB,OACjC,GAAY,WAARrG,EAAkB,CAC3B,MAAMqG,EAAMwgB,EAAOxgB,MACnB,GAAIA,EAAIpF,OAAS,IAAM,EACrB,OAAO4lB,EAAOvmB,MAAM,mDAEtB,IAAImB,EAAM,GACV,IAAK,IAAIH,EAAI,EAAGA,EAAI+E,EAAIpF,OAAS,EAAGK,IAClCG,GAAOylB,OAAOC,aAAa9gB,EAAI+gB,aAAiB,EAAJ9lB,IAE9C,OAAOG,EACF,GAAY,WAARzB,EAAkB,CAC3B,MAAMqnB,EAASR,EAAOxgB,MAAMiF,SAAS,SACrC,OAAKlM,KAAK0C,UAAUulB,GAIbA,EAHER,EAAOvmB,MAAM,0DAIjB,GAAY,WAARN,EACT,OAAO6mB,EAAOxgB,MACT,GAAY,YAARrG,EACT,OAAO6mB,EAAOxgB,MACT,GAAY,aAARrG,EAAoB,CAC7B,MAAMsnB,EAAWT,EAAOxgB,MAAMiF,SAAS,SACvC,OAAKlM,KAAK2C,YAAYulB,GAIfA,EAHET,EAAOvmB,MAAM,4DAIjB,MAAI,OAAO0B,KAAKhC,GACd6mB,EAAOxgB,MAAMiF,WAEbub,EAAOvmB,MAAM,4BAA8BN,EAAM,iBAI5DR,EAAQiB,UAAUgK,aAAe,SAAqBoc,EAAQ1kB,EAAQC,GACpE,IAAIkH,EACJ,MAAMie,EAAc,GACpB,IAAI1kB,EAAQ,EACR2kB,EAAW,EACf,OAAQX,EAAO3gB,UACbshB,EAAWX,EAAO1gB,YAClBtD,IAAU,EACVA,GAAoB,IAAX2kB,EACiB,KAAV,IAAXA,KACHD,EAAYjf,KAAKzF,GACjBA,EAAQ,GAGG,IAAX2kB,GACFD,EAAYjf,KAAKzF,GAEnB,MAAM4kB,EAASF,EAAY,GAAK,GAAM,EAChCG,EAASH,EAAY,GAAK,GAOhC,GAJEje,EADElH,EACOmlB,EAEA,CAACE,EAAOC,GAAQvgB,OAAOogB,EAAY/kB,MAAM,IAEhDL,EAAQ,CACV,IAAIsiB,EAAMtiB,EAAOmH,EAAOzI,KAAK,WACjB+D,IAAR6f,IACFA,EAAMtiB,EAAOmH,EAAOzI,KAAK,YACf+D,IAAR6f,IACFnb,EAASmb,GAGb,OAAOnb,GAGT9J,EAAQiB,UAAUiK,YAAc,SAAoBmc,EAAQ7mB,GAC1D,MAAMyB,EAAMolB,EAAOxgB,MAAMiF,WAEzB,IAAIqc,EACAC,EACAC,EACAC,EACArY,EACAsY,EACJ,GAAY,YAAR/nB,EACF2nB,EAAyB,EAAlBlmB,EAAIe,MAAM,EAAG,GACpBolB,EAAwB,EAAlBnmB,EAAIe,MAAM,EAAG,GACnBqlB,EAAwB,EAAlBpmB,EAAIe,MAAM,EAAG,GACnBslB,EAA0B,EAAnBrmB,EAAIe,MAAM,EAAG,IACpBiN,EAA0B,EAApBhO,EAAIe,MAAM,GAAI,IACpBulB,EAA0B,EAApBtmB,EAAIe,MAAM,GAAI,QACf,IAAY,YAARxC,EAYT,OAAO6mB,EAAOvmB,MAAM,YAAcN,EAAM,8BAXxC2nB,EAAyB,EAAlBlmB,EAAIe,MAAM,EAAG,GACpBolB,EAAwB,EAAlBnmB,EAAIe,MAAM,EAAG,GACnBqlB,EAAwB,EAAlBpmB,EAAIe,MAAM,EAAG,GACnBslB,EAAyB,EAAlBrmB,EAAIe,MAAM,EAAG,GACpBiN,EAAyB,EAAnBhO,EAAIe,MAAM,EAAG,IACnBulB,EAA0B,EAApBtmB,EAAIe,MAAM,GAAI,IAElBmlB,EADEA,EAAO,GACF,IAAOA,EAEP,KAAOA,EAKlB,OAAOxkB,KAAK6kB,IAAIL,EAAMC,EAAM,EAAGC,EAAKC,EAAMrY,EAAKsY,EAAK,IAGtDvoB,EAAQiB,UAAUkK,YAAc,WAC9B,OAAO,MAGTnL,EAAQiB,UAAUmK,YAAc,SAAoBic,GAClD,MAAMxoB,EAAMwoB,EAAO1gB,YACnB,OAAI0gB,EAAOld,QAAQtL,GACVA,EAEQ,IAARA,GAGXmB,EAAQiB,UAAUoK,WAAa,SAAmBgc,EAAQ1kB,GAExD,MAAMkE,EAAMwgB,EAAOxgB,MACnB,IAAIhI,EAAM,IAAIyI,EAAOT,GAKrB,OAHIlE,IACF9D,EAAM8D,EAAO9D,EAAIiN,SAAS,MAAQjN,GAE7BA,GAGTmB,EAAQiB,UAAU4D,KAAO,SAAalF,EAAQmF,GAG5C,MAFsB,oBAAXnF,IACTA,EAASA,EAAOmF,IACXnF,EAAO8oB,YAAY,OAAO1oB,O,kCCxQnC,MAAMR,EAAW,EAAQ,QAEzB,SAASuG,EAASG,GAChBrG,KAAKoH,eAAiB,CACpBlC,IAAK,KACL4F,KAAM,GACNzE,QAASA,GAAW,GACpBV,OAAQ,IA6FZ,SAASmjB,EAAche,EAAMqE,GAC3BnP,KAAK8K,KAAOA,EACZ9K,KAAK+oB,QAAQ5Z,GA5FfrQ,EAAQoH,SAAWA,EAEnBA,EAAS7E,UAAUkJ,QAAU,SAAiBrF,GAC5C,OAAOA,aAAe4jB,GAGxB5iB,EAAS7E,UAAUuF,KAAO,WACxB,MAAMtB,EAAQtF,KAAKoH,eAEnB,MAAO,CAAElC,IAAKI,EAAMJ,IAAK8jB,QAAS1jB,EAAMwF,KAAKjJ,SAG/CqE,EAAS7E,UAAUwF,QAAU,SAAiBtF,GAC5C,MAAM+D,EAAQtF,KAAKoH,eAEnB9B,EAAMJ,IAAM3D,EAAK2D,IACjBI,EAAMwF,KAAOxF,EAAMwF,KAAK1H,MAAM,EAAG7B,EAAKynB,UAGxC9iB,EAAS7E,UAAUgJ,SAAW,SAAkBhL,GAC9C,OAAOW,KAAKoH,eAAe0D,KAAK5B,KAAK7J,IAGvC6G,EAAS7E,UAAU4J,QAAU,SAAiBge,GAC5C,MAAM3jB,EAAQtF,KAAKoH,eAEnB9B,EAAMwF,KAAOxF,EAAMwF,KAAK1H,MAAM,EAAG6lB,EAAQ,IAG3C/iB,EAAS7E,UAAU6J,SAAW,SAAkB+d,EAAO5pB,EAAKC,GAC1D,MAAMgG,EAAQtF,KAAKoH,eAEnBpH,KAAKiL,QAAQge,GACK,OAAd3jB,EAAMJ,MACRI,EAAMJ,IAAI7F,GAAOC,IAGrB4G,EAAS7E,UAAUyJ,KAAO,WACxB,OAAO9K,KAAKoH,eAAe0D,KAAKrJ,KAAK,MAGvCyE,EAAS7E,UAAUqJ,YAAc,WAC/B,MAAMpF,EAAQtF,KAAKoH,eAEbmf,EAAOjhB,EAAMJ,IAEnB,OADAI,EAAMJ,IAAM,GACLqhB,GAGTrgB,EAAS7E,UAAU2J,YAAc,SAAqBub,GACpD,MAAMjhB,EAAQtF,KAAKoH,eAEb8hB,EAAM5jB,EAAMJ,IAElB,OADAI,EAAMJ,IAAMqhB,EACL2C,GAGThjB,EAAS7E,UAAUH,MAAQ,SAAeiO,GACxC,IAAIga,EACJ,MAAM7jB,EAAQtF,KAAKoH,eAEbgiB,EAAYja,aAAe2Z,EASjC,GAPEK,EADEC,EACIja,EAEA,IAAI2Z,EAAcxjB,EAAMwF,KAAK9L,KAAI,SAASqqB,GAC9C,MAAO,IAAMhmB,KAAKC,UAAU+lB,GAAQ,OACnC5nB,KAAK,IAAK0N,EAAIC,SAAWD,EAAKA,EAAIma,QAGlChkB,EAAMe,QAAQkjB,QACjB,MAAMJ,EAKR,OAHKC,GACH9jB,EAAMK,OAAOuD,KAAKigB,GAEbA,GAGTjjB,EAAS7E,UAAU2I,WAAa,SAAoBE,GAClD,MAAM5E,EAAQtF,KAAKoH,eACnB,OAAK9B,EAAMe,QAAQkjB,QAGZ,CACLrf,OAAQlK,KAAKuK,QAAQL,GAAU,KAAOA,EACtCvE,OAAQL,EAAMK,QAJPuE,GAYXvK,EAASmpB,EAAepf,OAExBof,EAAcznB,UAAU0nB,QAAU,SAAiB5Z,GAKjD,GAJAnP,KAAKoP,QAAUD,EAAM,SAAWnP,KAAK8K,MAAQ,aACzCpB,MAAM8f,mBACR9f,MAAM8f,kBAAkBxpB,KAAM8oB,IAE3B9oB,KAAKspB,MACR,IAEE,MAAM,IAAI5f,MAAM1J,KAAKoP,SACrB,MAAOpJ,GACPhG,KAAKspB,MAAQtjB,EAAEsjB,MAGnB,OAAOtpB,O,qBCvHT,IAAI4H,EAAS,EAAQ,QACjBhI,EAAS,EAAQ,QAAgBA,OACjC6pB,EAAO,EAAQ,QACf9jB,EAAS,EAAQ,QAKjBuJ,EAAsBvJ,EAAOuJ,oBAE7Bwa,EAAe,CACjBlmB,KAAM,KACNmmB,aAAc,GAMhB,SAASC,EAAM/kB,EAAMglB,GACnBjiB,EAAOkiB,GAAGjlB,GACV+C,EAAO2B,aAAa,EAAQ,UAC5B3B,EAAOkiB,GAAGD,GACVjiB,EAAO2B,aAAa,EAAM,UAE1B,IAAIpK,EAAOD,OAAO6qB,oBAAoBllB,GAStC,OARA1F,EAAKC,SAAQ,SAAUC,GACrB,IAAIwqB,EAAGxqB,GAAP,CAGA,IAAIC,EAAQJ,OAAO8qB,yBAAyBnlB,EAAMxF,GAClDH,OAAO+qB,eAAeJ,EAAIxqB,EAAKC,OAG1BuqB,EAOT,SAAS/jB,EAAOO,GACdA,EAAUujB,EAAMF,EAAcrjB,GAAW,IAEzCrG,KAAKkqB,KAAOtqB,EAAOmC,MAAMsE,EAAQ7C,MAAQ,MACzCxD,KAAKmqB,MAAQnqB,KAAKkqB,KAAKroB,OACvB7B,KAAKoqB,QAAU,EACfpqB,KAAKqqB,SAAWhkB,EAIhBrG,KAAKsqB,KAAO,GAGdprB,OAAO+qB,eAAenkB,EAAOzE,UAAW,SAAU,CAChDkpB,IAAK,WACH,GAAIvqB,KAAKsqB,KAAKzoB,OACZ,MAAMqN,EAAoBlP,KAAKsqB,KAAKzoB,OAAS,wBAE/C,OAAQ7B,KAAKkqB,KAAK9mB,MAAM,EAAGpD,KAAKoqB,YAIpCtkB,EAAOzE,UAAUmpB,UAAY,SAAU7X,GACrC,GAAmB,kBAAR,EACT,MAAM,IAAI8X,UAAU,6BAEtBzqB,KAAK0qB,QAAQ,GACb1qB,KAAKkqB,KAAKlqB,KAAKoqB,WAAazX,GAI9B7M,EAAOzE,UAAUspB,SAAW,SAAUzoB,EAAGtB,GACvC,GAAmB,kBAAR,EACT,MAAM,IAAI6pB,UAAU,6BACD,kBAAV,IACT7pB,EAAM6oB,EAAK7c,SAEb,IAAIge,EAAK,EAET,OAA8B,KAAhB,WAAJ1oB,KAAgD,WAAhB,WAAJA,KAC/B0oB,EAAK,EACVA,IACA1oB,IAAM,EAGR,GAAI0oB,EAAK,EACP,MAAM1b,EAAoB,mCAE5BlP,KAAK0qB,QAAQ,EAAIE,GACjB5qB,KAAKkqB,KAAKlqB,KAAKoqB,WAAaxpB,EAC5BZ,KAAKkqB,KAAKlqB,KAAKoqB,WAAaQ,EAE5B,MAAOA,KAAO,EACZ5qB,KAAKkqB,KAAKlqB,KAAKoqB,YAAmB,WAAJloB,KAAoB,GAClDA,IAAM,GAMV4D,EAAOzE,UAAUwpB,UAAY,WAC3B7qB,KAAKwqB,UAAUf,EAAK1c,MACpB/M,KAAKwqB,UAAU,IAIjB1kB,EAAOzE,UAAUypB,iBAAmB,SAAU5oB,EAAGtB,GAC/C,GAAmB,kBAAR,EACT,MAAM,IAAI6pB,UAAU,6BAItB,MAHqB,kBAAV,IACT7pB,EAAM6oB,EAAKrc,aAENpN,KAAK2qB,SAASzoB,EAAGtB,IAI1BkF,EAAOzE,UAAU0pB,aAAe,SAAUpY,EAAG/R,GAC3C,GAAmB,mBAAR,EACT,MAAM,IAAI6pB,UAAU,8BACD,kBAAV,IACT7pB,EAAM6oB,EAAK9c,SAEb3M,KAAK0qB,QAAQ,GACb1qB,KAAKkqB,KAAKlqB,KAAKoqB,WAAaxpB,EAC5BZ,KAAKkqB,KAAKlqB,KAAKoqB,WAAa,EAC5BpqB,KAAKkqB,KAAKlqB,KAAKoqB,WAAazX,EAAI,IAAO,GAIzC7M,EAAOzE,UAAU2pB,YAAc,SAAUlO,EAAGlc,GAC1C,GAAmB,kBAAR,EACT,MAAM,IAAI6pB,UAAU,0CAA4C,EAAM,KACnD,kBAAV,IACT7pB,EAAM6oB,EAAK3c,aAEb,IAAIqD,EAAMvQ,EAAO4G,WAAWsW,GAC5B9c,KAAKwqB,UAAU5pB,GACfZ,KAAKirB,YAAY9a,GACbA,IACFnQ,KAAK0qB,QAAQva,GACbnQ,KAAKkqB,KAAK7iB,MAAMyV,EAAG9c,KAAKoqB,SACxBpqB,KAAKoqB,SAAWja,IAKpBrK,EAAOzE,UAAU6pB,YAAc,SAAU3oB,EAAK3B,GAC5C,GAAqB,kBAAV,EACT,MAAM,IAAI6pB,UAAU,wBACtB,IAAK7qB,EAAO4E,SAASjC,GACnB,MAAM,IAAIkoB,UAAU,6BAEtBzqB,KAAKwqB,UAAU5pB,GACfZ,KAAKirB,YAAY1oB,EAAIV,QACrB7B,KAAK0qB,QAAQnoB,EAAIV,QACjBU,EAAIwC,KAAK/E,KAAKkqB,KAAMlqB,KAAKoqB,QAAS,EAAG7nB,EAAIV,QACzC7B,KAAKoqB,SAAW7nB,EAAIV,QAItBiE,EAAOzE,UAAU8pB,iBAAmB,SAAUC,GAC5C,IAAMA,aAAmBloB,MACvB,MAAM,IAAIunB,UAAU,qCAEtB,IAAIhY,EAAOzS,KACXorB,EAAQhsB,SAAQ,SAAU0d,GACxBrK,EAAKuY,YAAYlO,OAKrBhX,EAAOzE,UAAUgqB,SAAW,SAAUvO,EAAGlc,GACvC,GAAmB,kBAAR,EACT,MAAM,IAAI6pB,UAAU,6BAItB,GAHqB,kBAAV,IACT7pB,EAAM6oB,EAAKzc,MAER,yBAAyBpK,KAAKka,GACjC,MAAM,IAAIpT,MAAM,sCAElB,SAAS4hB,EAAYnkB,EAAOokB,GACtBA,EAAQ,IACRpkB,EAAM+B,KAAKqiB,GACJA,EAAQ,OACfpkB,EAAM+B,KAAMqiB,IAAU,EAAK,KAC3BpkB,EAAM+B,KAAa,IAARqiB,IACJA,EAAQ,SACjBpkB,EAAM+B,KAAMqiB,IAAU,GAAM,KAC5BpkB,EAAM+B,KAA8B,KAAvBqiB,IAAU,EAAK,MAC5BpkB,EAAM+B,KAAa,IAARqiB,IACFA,EAAQ,WACjBpkB,EAAM+B,KAAMqiB,IAAU,GAAM,KAC5BpkB,EAAM+B,KAA+B,KAAxBqiB,IAAU,GAAM,MAC7BpkB,EAAM+B,KAA8B,KAAvBqiB,IAAU,EAAK,MAC5BpkB,EAAM+B,KAAa,IAARqiB,KAEXpkB,EAAM+B,KAA+B,KAAxBqiB,IAAU,GAAM,MAC7BpkB,EAAM+B,KAA+B,KAAxBqiB,IAAU,GAAM,MAC7BpkB,EAAM+B,KAA+B,KAAxBqiB,IAAU,GAAM,MAC7BpkB,EAAM+B,KAA8B,KAAvBqiB,IAAU,EAAK,MAC5BpkB,EAAM+B,KAAa,IAARqiB,IAIf,IAAIlG,EAAMvI,EAAE7Z,MAAM,KACdkE,EAAQ,GACZA,EAAM+B,KAA4B,GAAvBsiB,SAASnG,EAAI,GAAI,IAAWmG,SAASnG,EAAI,GAAI,KACxDA,EAAIjiB,MAAM,GAAGhE,SAAQ,SAAUuT,GAC7B2Y,EAAYnkB,EAAOqkB,SAAS7Y,EAAG,QAGjC,IAAIF,EAAOzS,KACXA,KAAK0qB,QAAQ,EAAIvjB,EAAMtF,QACvB7B,KAAKwqB,UAAU5pB,GACfZ,KAAKirB,YAAY9jB,EAAMtF,QACvBsF,EAAM/H,SAAQ,SAAUuT,GACtBF,EAAK+X,UAAU7X,OAKnB7M,EAAOzE,UAAU4pB,YAAc,SAAU9a,GACvC,GAAqB,kBAAV,EACT,MAAM,IAAIsa,UAAU,6BAItB,GAFAzqB,KAAK0qB,QAAQ,GAETva,GAAO,IACTnQ,KAAKkqB,KAAKlqB,KAAKoqB,WAAaja,OACvB,GAAIA,GAAO,IAChBnQ,KAAKkqB,KAAKlqB,KAAKoqB,WAAa,IAC5BpqB,KAAKkqB,KAAKlqB,KAAKoqB,WAAaja,OACvB,GAAIA,GAAO,MAChBnQ,KAAKkqB,KAAKlqB,KAAKoqB,WAAa,IAC5BpqB,KAAKkqB,KAAKlqB,KAAKoqB,WAAaja,GAAO,EACnCnQ,KAAKkqB,KAAKlqB,KAAKoqB,WAAaja,MACvB,MAAIA,GAAO,UAMhB,MAAMjB,EAAoB,+BAL1BlP,KAAKkqB,KAAKlqB,KAAKoqB,WAAa,IAC5BpqB,KAAKkqB,KAAKlqB,KAAKoqB,WAAaja,GAAO,GACnCnQ,KAAKkqB,KAAKlqB,KAAKoqB,WAAaja,GAAO,EACnCnQ,KAAKkqB,KAAKlqB,KAAKoqB,WAAaja,IAMhCrK,EAAOzE,UAAUoqB,cAAgB,SAAU7qB,GACpB,kBAAV,IACTA,EAAM6oB,EAAKjc,SAAWic,EAAKlb,aAE7BvO,KAAKwqB,UAAU5pB,GACfZ,KAAKsqB,KAAKphB,KAAKlJ,KAAKoqB,SACpBpqB,KAAK0qB,QAAQ,GACb1qB,KAAKoqB,SAAW,GAIlBtkB,EAAOzE,UAAUqqB,YAAc,WAC7B,IAAIC,EAAM3rB,KAAKsqB,KAAKsB,MAChBhhB,EAAQ+gB,EAAM,EACdxb,EAAMnQ,KAAKoqB,QAAUxf,EAEzB,GAAIuF,GAAO,IACTnQ,KAAK6rB,OAAOjhB,EAAOuF,GAAM,GACzBnQ,KAAKkqB,KAAKyB,GAAOxb,OACZ,GAAIA,GAAO,IAChBnQ,KAAK6rB,OAAOjhB,EAAOuF,GAAM,GACzBnQ,KAAKkqB,KAAKyB,GAAO,IACjB3rB,KAAKkqB,KAAKyB,EAAM,GAAKxb,OAChB,GAAIA,GAAO,MAChBnQ,KAAKkqB,KAAKyB,GAAO,IACjB3rB,KAAKkqB,KAAKyB,EAAM,GAAKxb,GAAO,EAC5BnQ,KAAKkqB,KAAKyB,EAAM,GAAKxb,MAChB,MAAIA,GAAO,UAOhB,MAAMjB,EAAoB,qBAN1BlP,KAAK6rB,OAAOjhB,EAAOuF,EAAK,GACxBnQ,KAAKkqB,KAAKyB,GAAO,IACjB3rB,KAAKkqB,KAAKyB,EAAM,GAAKxb,GAAO,GAC5BnQ,KAAKkqB,KAAKyB,EAAM,GAAKxb,GAAO,EAC5BnQ,KAAKkqB,KAAKyB,EAAM,GAAKxb,IAOzBrK,EAAOzE,UAAUwqB,OAAS,SAAUjhB,EAAOuF,EAAKmQ,GAC9C1Y,EAAOkiB,QAAatkB,IAAVoF,GACVhD,EAAOkiB,QAAWtkB,IAAR2K,GACVvI,EAAOkiB,GAAGxJ,GAEVtgB,KAAKkqB,KAAKnlB,KAAK/E,KAAKkqB,KAAMtf,EAAQ0V,EAAO1V,EAAOA,EAAQuF,GACxDnQ,KAAKoqB,SAAW9J,GAGlBxa,EAAOzE,UAAUqpB,QAAU,SAAUva,GAGnC,GAFAvI,EAAOkiB,GAAG3Z,GAENnQ,KAAKmqB,MAAQnqB,KAAKoqB,QAAUja,EAAK,CACnC,IAAIya,EAAK5qB,KAAKmqB,MAAQnqB,KAAKqqB,SAASV,aAChCiB,EAAK5qB,KAAKoqB,QAAUja,IACtBya,GAAMza,GAER,IAAI5N,EAAM3C,EAAOmC,MAAM6oB,GAEvB5qB,KAAKkqB,KAAKnlB,KAAKxC,EAAK,EAAG,EAAGvC,KAAKoqB,SAC/BpqB,KAAKkqB,KAAO3nB,EACZvC,KAAKmqB,MAAQS,IAQjBxpB,EAAOtC,QAAUgH,G,qBC1TjB,IAAI8B,EAAS,EAAQ,QACjBhI,EAAS,EAAQ,QAAgBA,OAEjC6pB,EAAO,EAAQ,QACf9jB,EAAS,EAAQ,QAKjBuJ,EAAsBvJ,EAAOuJ,oBAMjC,SAASrJ,EAAOtE,GACd,IAAKA,IAAS3B,EAAO4E,SAASjD,GAC5B,MAAM,IAAIkpB,UAAU,8BAEtBzqB,KAAKkqB,KAAO3oB,EACZvB,KAAKmqB,MAAQ5oB,EAAKM,OAGlB7B,KAAK8rB,KAAO,EACZ9rB,KAAKoqB,QAAU,EAGjBlrB,OAAO+qB,eAAepkB,EAAOxE,UAAW,SAAU,CAChD0qB,YAAY,EACZxB,IAAK,WAAc,OAAQvqB,KAAS,QAGtCd,OAAO+qB,eAAepkB,EAAOxE,UAAW,SAAU,CAChD0qB,YAAY,EACZxB,IAAK,WAAc,OAAQvqB,KAAY,WAGzCd,OAAO+qB,eAAepkB,EAAOxE,UAAW,SAAU,CAChDkpB,IAAK,WAAc,OAAQvqB,KAAKmqB,MAAQnqB,KAAKoqB,WAG/ClrB,OAAO+qB,eAAepkB,EAAOxE,UAAW,SAAU,CAChDkpB,IAAK,WAAc,OAAQvqB,KAAKkqB,KAAK9mB,MAAMpD,KAAKoqB,YAWlDvkB,EAAOxE,UAAU2qB,SAAW,SAAUC,GACpC,GAAIjsB,KAAKmqB,MAAQnqB,KAAKoqB,QAAU,EAC9B,OAAO,KAET,IAAIzX,EAA8B,IAA1B3S,KAAKkqB,KAAKlqB,KAAKoqB,SAKvB,OAHK6B,IACHjsB,KAAKoqB,SAAW,GAEXzX,GAIT9M,EAAOxE,UAAU4qB,KAAO,WACtB,OAAOjsB,KAAKgsB,UAAS,IAevBnmB,EAAOxE,UAAU6qB,WAAa,SAAUvoB,GAItC,QAHe6B,IAAX7B,IACFA,EAAS3D,KAAKoqB,SAEZzmB,GAAU3D,KAAKmqB,MACjB,OAAO,KAET,IAAIgC,EAA6B,IAAtBnsB,KAAKkqB,KAAKvmB,KACrB,GAAa,OAATwoB,EACF,OAAO,KAET,GAAsB,OAAV,IAAPA,GAAuB,CAG1B,GAFAA,GAAQ,IAEK,IAATA,EACF,MAAMjd,EAAoB,mCAE5B,GAAIid,EAAO,EACT,MAAMjd,EAAoB,qBAE5B,GAAIlP,KAAKmqB,MAAQxmB,EAASwoB,EACxB,OAAO,KAETnsB,KAAK8rB,KAAO,EACZ,IAAK,IAAI5pB,EAAI,EAAGA,EAAIiqB,EAAMjqB,IACxBlC,KAAK8rB,MAAQ9rB,KAAK8rB,MAAQ,IAA4B,IAAtB9rB,KAAKkqB,KAAKvmB,WAI5C3D,KAAK8rB,KAAOK,EAGd,OAAOxoB,GAWTkC,EAAOxE,UAAU+qB,aAAe,SAAUxrB,GACxC,IAAI+qB,EAAM3rB,KAAKisB,OACf,GAAY,OAARN,EACF,OAAO,KACT,QAAYnmB,IAAR5E,GAAqBA,IAAQ+qB,EAC/B,MAAMzc,EAAoB,cAAgBtO,EAAIsL,SAAS,IAC7B,WAAayf,EAAIzf,SAAS,KAEtD,IAAIsK,EAAIxW,KAAKksB,WAAWlsB,KAAKoqB,QAAU,GACvC,OAAU,OAAN5T,EACK,MAETxW,KAAKoqB,QAAU5T,EACRmV,IAIT9lB,EAAOxE,UAAUgrB,QAAU,WACzB,OAAOrsB,KAAKssB,SAAS7C,EAAK7c,UAI5B/G,EAAOxE,UAAUkrB,YAAc,WAC7B,OAAwC,IAAhCvsB,KAAKssB,SAAS7C,EAAK9c,UAI7B9G,EAAOxE,UAAUmrB,gBAAkB,WACjC,OAAOxsB,KAAKssB,SAAS7C,EAAKrc,cAI5BvH,EAAOxE,UAAUorB,WAAa,SAAU7rB,EAAK8rB,GACtC9rB,IACHA,EAAM6oB,EAAK3c,aAEb,IAAI6F,EAAI3S,KAAKisB,OACb,GAAU,OAANtZ,EACF,OAAO,KAET,GAAIA,IAAM/R,EACR,MAAMsO,EAAoB,cAAgBtO,EAAIsL,SAAS,IAC7B,WAAayG,EAAEzG,SAAS,KAEpD,IAAIsK,EAAIxW,KAAKksB,WAAWlsB,KAAKoqB,QAAU,GAEvC,GAAU,OAAN5T,EACF,OAAO,KAET,GAAIxW,KAAK6B,OAAS7B,KAAKmqB,MAAQ3T,EAC7B,OAAO,KAIT,GAFAxW,KAAKoqB,QAAU5T,EAEK,IAAhBxW,KAAK6B,OACP,OAAO6qB,EAAS9sB,EAAOmC,MAAM,GAAK,GAEpC,IAAIM,EAAMrC,KAAKkqB,KAAK9mB,MAAMpD,KAAKoqB,QAASpqB,KAAKoqB,QAAUpqB,KAAK6B,QAG5D,OAFA7B,KAAKoqB,SAAWpqB,KAAK6B,OAEd6qB,EAASrqB,EAAMA,EAAI6J,SAAS,SAGrCrG,EAAOxE,UAAUsrB,QAAU,SAAU/rB,GAC9BA,IACHA,EAAM6oB,EAAKzc,KAEb,IAAI2F,EAAI3S,KAAKysB,WAAW7rB,GAAK,GAC7B,GAAU,OAAN+R,EACF,OAAO,KAKT,IAHA,IAAI5P,EAAS,GACTzD,EAAQ,EAEH4C,EAAI,EAAGA,EAAIyQ,EAAE9Q,OAAQK,IAAK,CACjC,IAAI0qB,EAAc,IAAPja,EAAEzQ,GAEb5C,IAAU,EACVA,GAAgB,IAAPstB,EACa,KAAV,IAAPA,KACH7pB,EAAOmG,KAAK5J,GACZA,EAAQ,GAQZ,OAJAA,EAAQyD,EAAOud,QACfvd,EAAO6B,QAAQtF,EAAQ,IACvByD,EAAO6B,QAAStF,EAAQ,IAAO,GAExByD,EAAOtB,KAAK,MAIrBoE,EAAOxE,UAAUirB,SAAW,SAAU1rB,GACpCgH,EAAOkiB,QAAWtkB,IAAR5E,GAEV,IAAI+R,EAAI3S,KAAKisB,OAEb,GAAU,OAANtZ,EACF,OAAO,KAET,GAAIA,IAAM/R,EACR,MAAMsO,EAAoB,cAAgBtO,EAAIsL,SAAS,IAC7B,WAAayG,EAAEzG,SAAS,KAEpD,IAAIsK,EAAIxW,KAAKksB,WAAWlsB,KAAKoqB,QAAU,GACvC,GAAU,OAAN5T,EACF,OAAO,KAET,GAAIxW,KAAK6B,OAAS,EAChB,MAAMqN,EAAoB,qBAAuBlP,KAAK6B,QAExD,GAAI7B,KAAK6B,OAAS7B,KAAKmqB,MAAQ3T,EAC7B,OAAO,KACTxW,KAAKoqB,QAAU5T,EAKf,IAHA,IAAIqW,EAAK7sB,KAAKkqB,KAAKlqB,KAAKoqB,SACpB9qB,EAAQ,EAEH4C,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAC/B5C,IAAU,EACVA,GAAsC,IAA5BU,KAAKkqB,KAAKlqB,KAAKoqB,WAM3B,OAHoB,OAAV,IAALyC,IAA6B,IAAN3qB,IAC1B5C,GAAU,GAAU,EAAJ4C,GAEX5C,GAAS,GAOlB8B,EAAOtC,QAAU+G,G,kCCnQjB,MAAMnG,EAAW,EAAQ,QACnBF,EAAW,EAAQ,QACnBG,EAAW,EAAQ,QAEnBmtB,EAAMhuB,EAMZ,SAASiuB,EAAO7sB,EAAMI,GACpBN,KAAKE,KAAOA,EACZF,KAAKM,KAAOA,EAEZN,KAAKR,SAAW,GAChBQ,KAAKN,SAAW,GATlBotB,EAAInlB,OAAS,SAAgBzH,EAAMI,GACjC,OAAO,IAAIysB,EAAO7sB,EAAMI,IAW1BysB,EAAO1rB,UAAU2rB,aAAe,SAAqBC,GACnD,MAAM/sB,EAAOF,KAAKE,KAElB,SAASgtB,EAAUntB,GACjBC,KAAKmtB,WAAWptB,EAAQG,GAO1B,OALAP,EAASutB,EAAWD,GACpBC,EAAU7rB,UAAU8rB,WAAa,SAAoBptB,EAAQG,GAC3D+sB,EAAKzsB,KAAKR,KAAMD,EAAQG,IAGnB,IAAIgtB,EAAUltB,OAGvB+sB,EAAO1rB,UAAUwnB,YAAc,SAAqB5oB,GAKlD,OAJAA,EAAMA,GAAO,MAERD,KAAKR,SAASyB,eAAehB,KAChCD,KAAKR,SAASS,GAAOD,KAAKgtB,aAAaxtB,EAASS,KAC3CD,KAAKR,SAASS,IAGvB8sB,EAAO1rB,UAAUsN,OAAS,SAAgBpN,EAAMtB,EAAKoG,GACnD,OAAOrG,KAAK6oB,YAAY5oB,GAAK0O,OAAOpN,EAAM8E,IAG5C0mB,EAAO1rB,UAAU8D,YAAc,SAAqBlF,GAKlD,OAJAA,EAAMA,GAAO,MAERD,KAAKN,SAASuB,eAAehB,KAChCD,KAAKN,SAASO,GAAOD,KAAKgtB,aAAattB,EAASO,KAC3CD,KAAKN,SAASO,IAGvB8sB,EAAO1rB,UAAUC,OAAS,SAAgBC,EAAMtB,EAAoBc,GAClE,OAAOf,KAAKmF,YAAYlF,GAAKqB,OAAOC,EAAMR","file":"js/chunk-vendors~6f58886a.2078632d.js","sourcesContent":["'use strict';\n\nconst constants = exports;\n\n// Helper\nconstants._reverse = function reverse(map) {\n  const res = {};\n\n  Object.keys(map).forEach(function(key) {\n    // Convert key to integer if it is stringified\n    if ((key | 0) == key)\n      key = key | 0;\n\n    const value = map[key];\n    res[value] = key;\n  });\n\n  return res;\n};\n\nconstants.der = require('./der');\n","'use strict';\n\nconst decoders = exports;\n\ndecoders.der = require('./der');\ndecoders.pem = require('./pem');\n","'use strict';\n\nconst encoders = exports;\n\nencoders.der = require('./der');\nencoders.pem = require('./pem');\n","'use strict';\n\nconst inherits = require('inherits');\nconst Buffer = require('safer-buffer').Buffer;\nconst Node = require('../base/node');\n\n// Import DER constants\nconst der = require('../constants/der');\n\nfunction DEREncoder(entity) {\n  this.enc = 'der';\n  this.name = entity.name;\n  this.entity = entity;\n\n  // Construct base tree\n  this.tree = new DERNode();\n  this.tree._init(entity.body);\n}\nmodule.exports = DEREncoder;\n\nDEREncoder.prototype.encode = function encode(data, reporter) {\n  return this.tree._encode(data, reporter).join();\n};\n\n// Tree methods\n\nfunction DERNode(parent) {\n  Node.call(this, 'der', parent);\n}\ninherits(DERNode, Node);\n\nDERNode.prototype._encodeComposite = function encodeComposite(tag,\n  primitive,\n  cls,\n  content) {\n  const encodedTag = encodeTag(tag, primitive, cls, this.reporter);\n\n  // Short form\n  if (content.length < 0x80) {\n    const header = Buffer.alloc(2);\n    header[0] = encodedTag;\n    header[1] = content.length;\n    return this._createEncoderBuffer([ header, content ]);\n  }\n\n  // Long form\n  // Count octets required to store length\n  let lenOctets = 1;\n  for (let i = content.length; i >= 0x100; i >>= 8)\n    lenOctets++;\n\n  const header = Buffer.alloc(1 + 1 + lenOctets);\n  header[0] = encodedTag;\n  header[1] = 0x80 | lenOctets;\n\n  for (let i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8)\n    header[i] = j & 0xff;\n\n  return this._createEncoderBuffer([ header, content ]);\n};\n\nDERNode.prototype._encodeStr = function encodeStr(str, tag) {\n  if (tag === 'bitstr') {\n    return this._createEncoderBuffer([ str.unused | 0, str.data ]);\n  } else if (tag === 'bmpstr') {\n    const buf = Buffer.alloc(str.length * 2);\n    for (let i = 0; i < str.length; i++) {\n      buf.writeUInt16BE(str.charCodeAt(i), i * 2);\n    }\n    return this._createEncoderBuffer(buf);\n  } else if (tag === 'numstr') {\n    if (!this._isNumstr(str)) {\n      return this.reporter.error('Encoding of string type: numstr supports ' +\n                                 'only digits and space');\n    }\n    return this._createEncoderBuffer(str);\n  } else if (tag === 'printstr') {\n    if (!this._isPrintstr(str)) {\n      return this.reporter.error('Encoding of string type: printstr supports ' +\n                                 'only latin upper and lower case letters, ' +\n                                 'digits, space, apostrophe, left and rigth ' +\n                                 'parenthesis, plus sign, comma, hyphen, ' +\n                                 'dot, slash, colon, equal sign, ' +\n                                 'question mark');\n    }\n    return this._createEncoderBuffer(str);\n  } else if (/str$/.test(tag)) {\n    return this._createEncoderBuffer(str);\n  } else if (tag === 'objDesc') {\n    return this._createEncoderBuffer(str);\n  } else {\n    return this.reporter.error('Encoding of string type: ' + tag +\n                               ' unsupported');\n  }\n};\n\nDERNode.prototype._encodeObjid = function encodeObjid(id, values, relative) {\n  if (typeof id === 'string') {\n    if (!values)\n      return this.reporter.error('string objid given, but no values map found');\n    if (!values.hasOwnProperty(id))\n      return this.reporter.error('objid not found in values map');\n    id = values[id].split(/[\\s.]+/g);\n    for (let i = 0; i < id.length; i++)\n      id[i] |= 0;\n  } else if (Array.isArray(id)) {\n    id = id.slice();\n    for (let i = 0; i < id.length; i++)\n      id[i] |= 0;\n  }\n\n  if (!Array.isArray(id)) {\n    return this.reporter.error('objid() should be either array or string, ' +\n                               'got: ' + JSON.stringify(id));\n  }\n\n  if (!relative) {\n    if (id[1] >= 40)\n      return this.reporter.error('Second objid identifier OOB');\n    id.splice(0, 2, id[0] * 40 + id[1]);\n  }\n\n  // Count number of octets\n  let size = 0;\n  for (let i = 0; i < id.length; i++) {\n    let ident = id[i];\n    for (size++; ident >= 0x80; ident >>= 7)\n      size++;\n  }\n\n  const objid = Buffer.alloc(size);\n  let offset = objid.length - 1;\n  for (let i = id.length - 1; i >= 0; i--) {\n    let ident = id[i];\n    objid[offset--] = ident & 0x7f;\n    while ((ident >>= 7) > 0)\n      objid[offset--] = 0x80 | (ident & 0x7f);\n  }\n\n  return this._createEncoderBuffer(objid);\n};\n\nfunction two(num) {\n  if (num < 10)\n    return '0' + num;\n  else\n    return num;\n}\n\nDERNode.prototype._encodeTime = function encodeTime(time, tag) {\n  let str;\n  const date = new Date(time);\n\n  if (tag === 'gentime') {\n    str = [\n      two(date.getUTCFullYear()),\n      two(date.getUTCMonth() + 1),\n      two(date.getUTCDate()),\n      two(date.getUTCHours()),\n      two(date.getUTCMinutes()),\n      two(date.getUTCSeconds()),\n      'Z'\n    ].join('');\n  } else if (tag === 'utctime') {\n    str = [\n      two(date.getUTCFullYear() % 100),\n      two(date.getUTCMonth() + 1),\n      two(date.getUTCDate()),\n      two(date.getUTCHours()),\n      two(date.getUTCMinutes()),\n      two(date.getUTCSeconds()),\n      'Z'\n    ].join('');\n  } else {\n    this.reporter.error('Encoding ' + tag + ' time is not supported yet');\n  }\n\n  return this._encodeStr(str, 'octstr');\n};\n\nDERNode.prototype._encodeNull = function encodeNull() {\n  return this._createEncoderBuffer('');\n};\n\nDERNode.prototype._encodeInt = function encodeInt(num, values) {\n  if (typeof num === 'string') {\n    if (!values)\n      return this.reporter.error('String int or enum given, but no values map');\n    if (!values.hasOwnProperty(num)) {\n      return this.reporter.error('Values map doesn\\'t contain: ' +\n                                 JSON.stringify(num));\n    }\n    num = values[num];\n  }\n\n  // Bignum, assume big endian\n  if (typeof num !== 'number' && !Buffer.isBuffer(num)) {\n    const numArray = num.toArray();\n    if (!num.sign && numArray[0] & 0x80) {\n      numArray.unshift(0);\n    }\n    num = Buffer.from(numArray);\n  }\n\n  if (Buffer.isBuffer(num)) {\n    let size = num.length;\n    if (num.length === 0)\n      size++;\n\n    const out = Buffer.alloc(size);\n    num.copy(out);\n    if (num.length === 0)\n      out[0] = 0;\n    return this._createEncoderBuffer(out);\n  }\n\n  if (num < 0x80)\n    return this._createEncoderBuffer(num);\n\n  if (num < 0x100)\n    return this._createEncoderBuffer([0, num]);\n\n  let size = 1;\n  for (let i = num; i >= 0x100; i >>= 8)\n    size++;\n\n  const out = new Array(size);\n  for (let i = out.length - 1; i >= 0; i--) {\n    out[i] = num & 0xff;\n    num >>= 8;\n  }\n  if(out[0] & 0x80) {\n    out.unshift(0);\n  }\n\n  return this._createEncoderBuffer(Buffer.from(out));\n};\n\nDERNode.prototype._encodeBool = function encodeBool(value) {\n  return this._createEncoderBuffer(value ? 0xff : 0);\n};\n\nDERNode.prototype._use = function use(entity, obj) {\n  if (typeof entity === 'function')\n    entity = entity(obj);\n  return entity._getEncoder('der').tree;\n};\n\nDERNode.prototype._skipDefault = function skipDefault(dataBuffer, reporter, parent) {\n  const state = this._baseState;\n  let i;\n  if (state['default'] === null)\n    return false;\n\n  const data = dataBuffer.join();\n  if (state.defaultBuffer === undefined)\n    state.defaultBuffer = this._encodeValue(state['default'], reporter, parent).join();\n\n  if (data.length !== state.defaultBuffer.length)\n    return false;\n\n  for (i=0; i < data.length; i++)\n    if (data[i] !== state.defaultBuffer[i])\n      return false;\n\n  return true;\n};\n\n// Utility methods\n\nfunction encodeTag(tag, primitive, cls, reporter) {\n  let res;\n\n  if (tag === 'seqof')\n    tag = 'seq';\n  else if (tag === 'setof')\n    tag = 'set';\n\n  if (der.tagByName.hasOwnProperty(tag))\n    res = der.tagByName[tag];\n  else if (typeof tag === 'number' && (tag | 0) === tag)\n    res = tag;\n  else\n    return reporter.error('Unknown tag: ' + tag);\n\n  if (res >= 0x1f)\n    return reporter.error('Multi-octet tag encoding unsupported');\n\n  if (!primitive)\n    res |= 0x20;\n\n  res |= (der.tagClassByName[cls || 'universal'] << 6);\n\n  return res;\n}\n","// Copyright 2011 Mark Cavage <mcavage@gmail.com> All rights reserved.\n\nvar errors = require('./errors');\nvar types = require('./types');\n\nvar Reader = require('./reader');\nvar Writer = require('./writer');\n\n\n// --- Exports\n\nmodule.exports = {\n\n  Reader: Reader,\n\n  Writer: Writer\n\n};\n\nfor (var t in types) {\n  if (types.hasOwnProperty(t))\n    module.exports[t] = types[t];\n}\nfor (var e in errors) {\n  if (errors.hasOwnProperty(e))\n    module.exports[e] = errors[e];\n}\n","'use strict';\n\nconst base = exports;\n\nbase.Reporter = require('./reporter').Reporter;\nbase.DecoderBuffer = require('./buffer').DecoderBuffer;\nbase.EncoderBuffer = require('./buffer').EncoderBuffer;\nbase.Node = require('./node');\n","'use strict';\n\nconst inherits = require('inherits');\nconst Reporter = require('../base/reporter').Reporter;\nconst Buffer = require('safer-buffer').Buffer;\n\nfunction DecoderBuffer(base, options) {\n  Reporter.call(this, options);\n  if (!Buffer.isBuffer(base)) {\n    this.error('Input not Buffer');\n    return;\n  }\n\n  this.base = base;\n  this.offset = 0;\n  this.length = base.length;\n}\ninherits(DecoderBuffer, Reporter);\nexports.DecoderBuffer = DecoderBuffer;\n\nDecoderBuffer.isDecoderBuffer = function isDecoderBuffer(data) {\n  if (data instanceof DecoderBuffer) {\n    return true;\n  }\n\n  // Or accept compatible API\n  const isCompatible = typeof data === 'object' &&\n    Buffer.isBuffer(data.base) &&\n    data.constructor.name === 'DecoderBuffer' &&\n    typeof data.offset === 'number' &&\n    typeof data.length === 'number' &&\n    typeof data.save === 'function' &&\n    typeof data.restore === 'function' &&\n    typeof data.isEmpty === 'function' &&\n    typeof data.readUInt8 === 'function' &&\n    typeof data.skip === 'function' &&\n    typeof data.raw === 'function';\n\n  return isCompatible;\n};\n\nDecoderBuffer.prototype.save = function save() {\n  return { offset: this.offset, reporter: Reporter.prototype.save.call(this) };\n};\n\nDecoderBuffer.prototype.restore = function restore(save) {\n  // Return skipped data\n  const res = new DecoderBuffer(this.base);\n  res.offset = save.offset;\n  res.length = this.offset;\n\n  this.offset = save.offset;\n  Reporter.prototype.restore.call(this, save.reporter);\n\n  return res;\n};\n\nDecoderBuffer.prototype.isEmpty = function isEmpty() {\n  return this.offset === this.length;\n};\n\nDecoderBuffer.prototype.readUInt8 = function readUInt8(fail) {\n  if (this.offset + 1 <= this.length)\n    return this.base.readUInt8(this.offset++, true);\n  else\n    return this.error(fail || 'DecoderBuffer overrun');\n};\n\nDecoderBuffer.prototype.skip = function skip(bytes, fail) {\n  if (!(this.offset + bytes <= this.length))\n    return this.error(fail || 'DecoderBuffer overrun');\n\n  const res = new DecoderBuffer(this.base);\n\n  // Share reporter state\n  res._reporterState = this._reporterState;\n\n  res.offset = this.offset;\n  res.length = this.offset + bytes;\n  this.offset += bytes;\n  return res;\n};\n\nDecoderBuffer.prototype.raw = function raw(save) {\n  return this.base.slice(save ? save.offset : this.offset, this.length);\n};\n\nfunction EncoderBuffer(value, reporter) {\n  if (Array.isArray(value)) {\n    this.length = 0;\n    this.value = value.map(function(item) {\n      if (!EncoderBuffer.isEncoderBuffer(item))\n        item = new EncoderBuffer(item, reporter);\n      this.length += item.length;\n      return item;\n    }, this);\n  } else if (typeof value === 'number') {\n    if (!(0 <= value && value <= 0xff))\n      return reporter.error('non-byte EncoderBuffer value');\n    this.value = value;\n    this.length = 1;\n  } else if (typeof value === 'string') {\n    this.value = value;\n    this.length = Buffer.byteLength(value);\n  } else if (Buffer.isBuffer(value)) {\n    this.value = value;\n    this.length = value.length;\n  } else {\n    return reporter.error('Unsupported type: ' + typeof value);\n  }\n}\nexports.EncoderBuffer = EncoderBuffer;\n\nEncoderBuffer.isEncoderBuffer = function isEncoderBuffer(data) {\n  if (data instanceof EncoderBuffer) {\n    return true;\n  }\n\n  // Or accept compatible API\n  const isCompatible = typeof data === 'object' &&\n    data.constructor.name === 'EncoderBuffer' &&\n    typeof data.length === 'number' &&\n    typeof data.join === 'function';\n\n  return isCompatible;\n};\n\nEncoderBuffer.prototype.join = function join(out, offset) {\n  if (!out)\n    out = Buffer.alloc(this.length);\n  if (!offset)\n    offset = 0;\n\n  if (this.length === 0)\n    return out;\n\n  if (Array.isArray(this.value)) {\n    this.value.forEach(function(item) {\n      item.join(out, offset);\n      offset += item.length;\n    });\n  } else {\n    if (typeof this.value === 'number')\n      out[offset] = this.value;\n    else if (typeof this.value === 'string')\n      out.write(this.value, offset);\n    else if (Buffer.isBuffer(this.value))\n      this.value.copy(out, offset);\n    offset += this.length;\n  }\n\n  return out;\n};\n","// Copyright 2011 Mark Cavage <mcavage@gmail.com> All rights reserved.\n\n// If you have no idea what ASN.1 or BER is, see this:\n// ftp://ftp.rsa.com/pub/pkcs/ascii/layman.asc\n\nvar Ber = require('./ber/index');\n\n\n\n// --- Exported API\n\nmodule.exports = {\n\n  Ber: Ber,\n\n  BerReader: Ber.Reader,\n\n  BerWriter: Ber.Writer\n\n};\n","'use strict';\n\nconst asn1 = exports;\n\nasn1.bignum = require('bn.js');\n\nasn1.define = require('./asn1/api').define;\nasn1.base = require('./asn1/base');\nasn1.constants = require('./asn1/constants');\nasn1.decoders = require('./asn1/decoders');\nasn1.encoders = require('./asn1/encoders');\n","'use strict';\n\nconst Reporter = require('../base/reporter').Reporter;\nconst EncoderBuffer = require('../base/buffer').EncoderBuffer;\nconst DecoderBuffer = require('../base/buffer').DecoderBuffer;\nconst assert = require('minimalistic-assert');\n\n// Supported tags\nconst tags = [\n  'seq', 'seqof', 'set', 'setof', 'objid', 'bool',\n  'gentime', 'utctime', 'null_', 'enum', 'int', 'objDesc',\n  'bitstr', 'bmpstr', 'charstr', 'genstr', 'graphstr', 'ia5str', 'iso646str',\n  'numstr', 'octstr', 'printstr', 't61str', 'unistr', 'utf8str', 'videostr'\n];\n\n// Public methods list\nconst methods = [\n  'key', 'obj', 'use', 'optional', 'explicit', 'implicit', 'def', 'choice',\n  'any', 'contains'\n].concat(tags);\n\n// Overrided methods list\nconst overrided = [\n  '_peekTag', '_decodeTag', '_use',\n  '_decodeStr', '_decodeObjid', '_decodeTime',\n  '_decodeNull', '_decodeInt', '_decodeBool', '_decodeList',\n\n  '_encodeComposite', '_encodeStr', '_encodeObjid', '_encodeTime',\n  '_encodeNull', '_encodeInt', '_encodeBool'\n];\n\nfunction Node(enc, parent, name) {\n  const state = {};\n  this._baseState = state;\n\n  state.name = name;\n  state.enc = enc;\n\n  state.parent = parent || null;\n  state.children = null;\n\n  // State\n  state.tag = null;\n  state.args = null;\n  state.reverseArgs = null;\n  state.choice = null;\n  state.optional = false;\n  state.any = false;\n  state.obj = false;\n  state.use = null;\n  state.useDecoder = null;\n  state.key = null;\n  state['default'] = null;\n  state.explicit = null;\n  state.implicit = null;\n  state.contains = null;\n\n  // Should create new instance on each method\n  if (!state.parent) {\n    state.children = [];\n    this._wrap();\n  }\n}\nmodule.exports = Node;\n\nconst stateProps = [\n  'enc', 'parent', 'children', 'tag', 'args', 'reverseArgs', 'choice',\n  'optional', 'any', 'obj', 'use', 'alteredUse', 'key', 'default', 'explicit',\n  'implicit', 'contains'\n];\n\nNode.prototype.clone = function clone() {\n  const state = this._baseState;\n  const cstate = {};\n  stateProps.forEach(function(prop) {\n    cstate[prop] = state[prop];\n  });\n  const res = new this.constructor(cstate.parent);\n  res._baseState = cstate;\n  return res;\n};\n\nNode.prototype._wrap = function wrap() {\n  const state = this._baseState;\n  methods.forEach(function(method) {\n    this[method] = function _wrappedMethod() {\n      const clone = new this.constructor(this);\n      state.children.push(clone);\n      return clone[method].apply(clone, arguments);\n    };\n  }, this);\n};\n\nNode.prototype._init = function init(body) {\n  const state = this._baseState;\n\n  assert(state.parent === null);\n  body.call(this);\n\n  // Filter children\n  state.children = state.children.filter(function(child) {\n    return child._baseState.parent === this;\n  }, this);\n  assert.equal(state.children.length, 1, 'Root node can have only one child');\n};\n\nNode.prototype._useArgs = function useArgs(args) {\n  const state = this._baseState;\n\n  // Filter children and args\n  const children = args.filter(function(arg) {\n    return arg instanceof this.constructor;\n  }, this);\n  args = args.filter(function(arg) {\n    return !(arg instanceof this.constructor);\n  }, this);\n\n  if (children.length !== 0) {\n    assert(state.children === null);\n    state.children = children;\n\n    // Replace parent to maintain backward link\n    children.forEach(function(child) {\n      child._baseState.parent = this;\n    }, this);\n  }\n  if (args.length !== 0) {\n    assert(state.args === null);\n    state.args = args;\n    state.reverseArgs = args.map(function(arg) {\n      if (typeof arg !== 'object' || arg.constructor !== Object)\n        return arg;\n\n      const res = {};\n      Object.keys(arg).forEach(function(key) {\n        if (key == (key | 0))\n          key |= 0;\n        const value = arg[key];\n        res[value] = key;\n      });\n      return res;\n    });\n  }\n};\n\n//\n// Overrided methods\n//\n\noverrided.forEach(function(method) {\n  Node.prototype[method] = function _overrided() {\n    const state = this._baseState;\n    throw new Error(method + ' not implemented for encoding: ' + state.enc);\n  };\n});\n\n//\n// Public methods\n//\n\ntags.forEach(function(tag) {\n  Node.prototype[tag] = function _tagMethod() {\n    const state = this._baseState;\n    const args = Array.prototype.slice.call(arguments);\n\n    assert(state.tag === null);\n    state.tag = tag;\n\n    this._useArgs(args);\n\n    return this;\n  };\n});\n\nNode.prototype.use = function use(item) {\n  assert(item);\n  const state = this._baseState;\n\n  assert(state.use === null);\n  state.use = item;\n\n  return this;\n};\n\nNode.prototype.optional = function optional() {\n  const state = this._baseState;\n\n  state.optional = true;\n\n  return this;\n};\n\nNode.prototype.def = function def(val) {\n  const state = this._baseState;\n\n  assert(state['default'] === null);\n  state['default'] = val;\n  state.optional = true;\n\n  return this;\n};\n\nNode.prototype.explicit = function explicit(num) {\n  const state = this._baseState;\n\n  assert(state.explicit === null && state.implicit === null);\n  state.explicit = num;\n\n  return this;\n};\n\nNode.prototype.implicit = function implicit(num) {\n  const state = this._baseState;\n\n  assert(state.explicit === null && state.implicit === null);\n  state.implicit = num;\n\n  return this;\n};\n\nNode.prototype.obj = function obj() {\n  const state = this._baseState;\n  const args = Array.prototype.slice.call(arguments);\n\n  state.obj = true;\n\n  if (args.length !== 0)\n    this._useArgs(args);\n\n  return this;\n};\n\nNode.prototype.key = function key(newKey) {\n  const state = this._baseState;\n\n  assert(state.key === null);\n  state.key = newKey;\n\n  return this;\n};\n\nNode.prototype.any = function any() {\n  const state = this._baseState;\n\n  state.any = true;\n\n  return this;\n};\n\nNode.prototype.choice = function choice(obj) {\n  const state = this._baseState;\n\n  assert(state.choice === null);\n  state.choice = obj;\n  this._useArgs(Object.keys(obj).map(function(key) {\n    return obj[key];\n  }));\n\n  return this;\n};\n\nNode.prototype.contains = function contains(item) {\n  const state = this._baseState;\n\n  assert(state.use === null);\n  state.contains = item;\n\n  return this;\n};\n\n//\n// Decoding\n//\n\nNode.prototype._decode = function decode(input, options) {\n  const state = this._baseState;\n\n  // Decode root node\n  if (state.parent === null)\n    return input.wrapResult(state.children[0]._decode(input, options));\n\n  let result = state['default'];\n  let present = true;\n\n  let prevKey = null;\n  if (state.key !== null)\n    prevKey = input.enterKey(state.key);\n\n  // Check if tag is there\n  if (state.optional) {\n    let tag = null;\n    if (state.explicit !== null)\n      tag = state.explicit;\n    else if (state.implicit !== null)\n      tag = state.implicit;\n    else if (state.tag !== null)\n      tag = state.tag;\n\n    if (tag === null && !state.any) {\n      // Trial and Error\n      const save = input.save();\n      try {\n        if (state.choice === null)\n          this._decodeGeneric(state.tag, input, options);\n        else\n          this._decodeChoice(input, options);\n        present = true;\n      } catch (e) {\n        present = false;\n      }\n      input.restore(save);\n    } else {\n      present = this._peekTag(input, tag, state.any);\n\n      if (input.isError(present))\n        return present;\n    }\n  }\n\n  // Push object on stack\n  let prevObj;\n  if (state.obj && present)\n    prevObj = input.enterObject();\n\n  if (present) {\n    // Unwrap explicit values\n    if (state.explicit !== null) {\n      const explicit = this._decodeTag(input, state.explicit);\n      if (input.isError(explicit))\n        return explicit;\n      input = explicit;\n    }\n\n    const start = input.offset;\n\n    // Unwrap implicit and normal values\n    if (state.use === null && state.choice === null) {\n      let save;\n      if (state.any)\n        save = input.save();\n      const body = this._decodeTag(\n        input,\n        state.implicit !== null ? state.implicit : state.tag,\n        state.any\n      );\n      if (input.isError(body))\n        return body;\n\n      if (state.any)\n        result = input.raw(save);\n      else\n        input = body;\n    }\n\n    if (options && options.track && state.tag !== null)\n      options.track(input.path(), start, input.length, 'tagged');\n\n    if (options && options.track && state.tag !== null)\n      options.track(input.path(), input.offset, input.length, 'content');\n\n    // Select proper method for tag\n    if (state.any) {\n      // no-op\n    } else if (state.choice === null) {\n      result = this._decodeGeneric(state.tag, input, options);\n    } else {\n      result = this._decodeChoice(input, options);\n    }\n\n    if (input.isError(result))\n      return result;\n\n    // Decode children\n    if (!state.any && state.choice === null && state.children !== null) {\n      state.children.forEach(function decodeChildren(child) {\n        // NOTE: We are ignoring errors here, to let parser continue with other\n        // parts of encoded data\n        child._decode(input, options);\n      });\n    }\n\n    // Decode contained/encoded by schema, only in bit or octet strings\n    if (state.contains && (state.tag === 'octstr' || state.tag === 'bitstr')) {\n      const data = new DecoderBuffer(result);\n      result = this._getUse(state.contains, input._reporterState.obj)\n        ._decode(data, options);\n    }\n  }\n\n  // Pop object\n  if (state.obj && present)\n    result = input.leaveObject(prevObj);\n\n  // Set key\n  if (state.key !== null && (result !== null || present === true))\n    input.leaveKey(prevKey, state.key, result);\n  else if (prevKey !== null)\n    input.exitKey(prevKey);\n\n  return result;\n};\n\nNode.prototype._decodeGeneric = function decodeGeneric(tag, input, options) {\n  const state = this._baseState;\n\n  if (tag === 'seq' || tag === 'set')\n    return null;\n  if (tag === 'seqof' || tag === 'setof')\n    return this._decodeList(input, tag, state.args[0], options);\n  else if (/str$/.test(tag))\n    return this._decodeStr(input, tag, options);\n  else if (tag === 'objid' && state.args)\n    return this._decodeObjid(input, state.args[0], state.args[1], options);\n  else if (tag === 'objid')\n    return this._decodeObjid(input, null, null, options);\n  else if (tag === 'gentime' || tag === 'utctime')\n    return this._decodeTime(input, tag, options);\n  else if (tag === 'null_')\n    return this._decodeNull(input, options);\n  else if (tag === 'bool')\n    return this._decodeBool(input, options);\n  else if (tag === 'objDesc')\n    return this._decodeStr(input, tag, options);\n  else if (tag === 'int' || tag === 'enum')\n    return this._decodeInt(input, state.args && state.args[0], options);\n\n  if (state.use !== null) {\n    return this._getUse(state.use, input._reporterState.obj)\n      ._decode(input, options);\n  } else {\n    return input.error('unknown tag: ' + tag);\n  }\n};\n\nNode.prototype._getUse = function _getUse(entity, obj) {\n\n  const state = this._baseState;\n  // Create altered use decoder if implicit is set\n  state.useDecoder = this._use(entity, obj);\n  assert(state.useDecoder._baseState.parent === null);\n  state.useDecoder = state.useDecoder._baseState.children[0];\n  if (state.implicit !== state.useDecoder._baseState.implicit) {\n    state.useDecoder = state.useDecoder.clone();\n    state.useDecoder._baseState.implicit = state.implicit;\n  }\n  return state.useDecoder;\n};\n\nNode.prototype._decodeChoice = function decodeChoice(input, options) {\n  const state = this._baseState;\n  let result = null;\n  let match = false;\n\n  Object.keys(state.choice).some(function(key) {\n    const save = input.save();\n    const node = state.choice[key];\n    try {\n      const value = node._decode(input, options);\n      if (input.isError(value))\n        return false;\n\n      result = { type: key, value: value };\n      match = true;\n    } catch (e) {\n      input.restore(save);\n      return false;\n    }\n    return true;\n  }, this);\n\n  if (!match)\n    return input.error('Choice not matched');\n\n  return result;\n};\n\n//\n// Encoding\n//\n\nNode.prototype._createEncoderBuffer = function createEncoderBuffer(data) {\n  return new EncoderBuffer(data, this.reporter);\n};\n\nNode.prototype._encode = function encode(data, reporter, parent) {\n  const state = this._baseState;\n  if (state['default'] !== null && state['default'] === data)\n    return;\n\n  const result = this._encodeValue(data, reporter, parent);\n  if (result === undefined)\n    return;\n\n  if (this._skipDefault(result, reporter, parent))\n    return;\n\n  return result;\n};\n\nNode.prototype._encodeValue = function encode(data, reporter, parent) {\n  const state = this._baseState;\n\n  // Decode root node\n  if (state.parent === null)\n    return state.children[0]._encode(data, reporter || new Reporter());\n\n  let result = null;\n\n  // Set reporter to share it with a child class\n  this.reporter = reporter;\n\n  // Check if data is there\n  if (state.optional && data === undefined) {\n    if (state['default'] !== null)\n      data = state['default'];\n    else\n      return;\n  }\n\n  // Encode children first\n  let content = null;\n  let primitive = false;\n  if (state.any) {\n    // Anything that was given is translated to buffer\n    result = this._createEncoderBuffer(data);\n  } else if (state.choice) {\n    result = this._encodeChoice(data, reporter);\n  } else if (state.contains) {\n    content = this._getUse(state.contains, parent)._encode(data, reporter);\n    primitive = true;\n  } else if (state.children) {\n    content = state.children.map(function(child) {\n      if (child._baseState.tag === 'null_')\n        return child._encode(null, reporter, data);\n\n      if (child._baseState.key === null)\n        return reporter.error('Child should have a key');\n      const prevKey = reporter.enterKey(child._baseState.key);\n\n      if (typeof data !== 'object')\n        return reporter.error('Child expected, but input is not object');\n\n      const res = child._encode(data[child._baseState.key], reporter, data);\n      reporter.leaveKey(prevKey);\n\n      return res;\n    }, this).filter(function(child) {\n      return child;\n    });\n    content = this._createEncoderBuffer(content);\n  } else {\n    if (state.tag === 'seqof' || state.tag === 'setof') {\n      // TODO(indutny): this should be thrown on DSL level\n      if (!(state.args && state.args.length === 1))\n        return reporter.error('Too many args for : ' + state.tag);\n\n      if (!Array.isArray(data))\n        return reporter.error('seqof/setof, but data is not Array');\n\n      const child = this.clone();\n      child._baseState.implicit = null;\n      content = this._createEncoderBuffer(data.map(function(item) {\n        const state = this._baseState;\n\n        return this._getUse(state.args[0], data)._encode(item, reporter);\n      }, child));\n    } else if (state.use !== null) {\n      result = this._getUse(state.use, parent)._encode(data, reporter);\n    } else {\n      content = this._encodePrimitive(state.tag, data);\n      primitive = true;\n    }\n  }\n\n  // Encode data itself\n  if (!state.any && state.choice === null) {\n    const tag = state.implicit !== null ? state.implicit : state.tag;\n    const cls = state.implicit === null ? 'universal' : 'context';\n\n    if (tag === null) {\n      if (state.use === null)\n        reporter.error('Tag could be omitted only for .use()');\n    } else {\n      if (state.use === null)\n        result = this._encodeComposite(tag, primitive, cls, content);\n    }\n  }\n\n  // Wrap in explicit\n  if (state.explicit !== null)\n    result = this._encodeComposite(state.explicit, false, 'context', result);\n\n  return result;\n};\n\nNode.prototype._encodeChoice = function encodeChoice(data, reporter) {\n  const state = this._baseState;\n\n  const node = state.choice[data.type];\n  if (!node) {\n    assert(\n      false,\n      data.type + ' not found in ' +\n            JSON.stringify(Object.keys(state.choice)));\n  }\n  return node._encode(data.value, reporter);\n};\n\nNode.prototype._encodePrimitive = function encodePrimitive(tag, data) {\n  const state = this._baseState;\n\n  if (/str$/.test(tag))\n    return this._encodeStr(data, tag);\n  else if (tag === 'objid' && state.args)\n    return this._encodeObjid(data, state.reverseArgs[0], state.args[1]);\n  else if (tag === 'objid')\n    return this._encodeObjid(data, null, null);\n  else if (tag === 'gentime' || tag === 'utctime')\n    return this._encodeTime(data, tag);\n  else if (tag === 'null_')\n    return this._encodeNull();\n  else if (tag === 'int' || tag === 'enum')\n    return this._encodeInt(data, state.args && state.reverseArgs[0]);\n  else if (tag === 'bool')\n    return this._encodeBool(data);\n  else if (tag === 'objDesc')\n    return this._encodeStr(data, tag);\n  else\n    throw new Error('Unsupported tag: ' + tag);\n};\n\nNode.prototype._isNumstr = function isNumstr(str) {\n  return /^[0-9 ]*$/.test(str);\n};\n\nNode.prototype._isPrintstr = function isPrintstr(str) {\n  return /^[A-Za-z0-9 '()+,-./:=?]*$/.test(str);\n};\n","'use strict';\n\nconst inherits = require('inherits');\n\nconst DEREncoder = require('./der');\n\nfunction PEMEncoder(entity) {\n  DEREncoder.call(this, entity);\n  this.enc = 'pem';\n}\ninherits(PEMEncoder, DEREncoder);\nmodule.exports = PEMEncoder;\n\nPEMEncoder.prototype.encode = function encode(data, options) {\n  const buf = DEREncoder.prototype.encode.call(this, data);\n\n  const p = buf.toString('base64');\n  const out = [ '-----BEGIN ' + options.label + '-----' ];\n  for (let i = 0; i < p.length; i += 64)\n    out.push(p.slice(i, i + 64));\n  out.push('-----END ' + options.label + '-----');\n  return out.join('\\n');\n};\n","'use strict';\n\n// Helper\nfunction reverse(map) {\n  const res = {};\n\n  Object.keys(map).forEach(function(key) {\n    // Convert key to integer if it is stringified\n    if ((key | 0) == key)\n      key = key | 0;\n\n    const value = map[key];\n    res[value] = key;\n  });\n\n  return res;\n}\n\nexports.tagClass = {\n  0: 'universal',\n  1: 'application',\n  2: 'context',\n  3: 'private'\n};\nexports.tagClassByName = reverse(exports.tagClass);\n\nexports.tag = {\n  0x00: 'end',\n  0x01: 'bool',\n  0x02: 'int',\n  0x03: 'bitstr',\n  0x04: 'octstr',\n  0x05: 'null_',\n  0x06: 'objid',\n  0x07: 'objDesc',\n  0x08: 'external',\n  0x09: 'real',\n  0x0a: 'enum',\n  0x0b: 'embed',\n  0x0c: 'utf8str',\n  0x0d: 'relativeOid',\n  0x10: 'seq',\n  0x11: 'set',\n  0x12: 'numstr',\n  0x13: 'printstr',\n  0x14: 't61str',\n  0x15: 'videostr',\n  0x16: 'ia5str',\n  0x17: 'utctime',\n  0x18: 'gentime',\n  0x19: 'graphstr',\n  0x1a: 'iso646str',\n  0x1b: 'genstr',\n  0x1c: 'unistr',\n  0x1d: 'charstr',\n  0x1e: 'bmpstr'\n};\nexports.tagByName = reverse(exports.tag);\n","// Copyright 2011 Mark Cavage <mcavage@gmail.com> All rights reserved.\n\n\nmodule.exports = {\n  EOC: 0,\n  Boolean: 1,\n  Integer: 2,\n  BitString: 3,\n  OctetString: 4,\n  Null: 5,\n  OID: 6,\n  ObjectDescriptor: 7,\n  External: 8,\n  Real: 9, // float\n  Enumeration: 10,\n  PDV: 11,\n  Utf8String: 12,\n  RelativeOID: 13,\n  Sequence: 16,\n  Set: 17,\n  NumericString: 18,\n  PrintableString: 19,\n  T61String: 20,\n  VideotexString: 21,\n  IA5String: 22,\n  UTCTime: 23,\n  GeneralizedTime: 24,\n  GraphicString: 25,\n  VisibleString: 26,\n  GeneralString: 28,\n  UniversalString: 29,\n  CharacterString: 30,\n  BMPString: 31,\n  Constructor: 32,\n  Context: 128\n};\n","'use strict';\n\nconst inherits = require('inherits');\nconst Buffer = require('safer-buffer').Buffer;\n\nconst DERDecoder = require('./der');\n\nfunction PEMDecoder(entity) {\n  DERDecoder.call(this, entity);\n  this.enc = 'pem';\n}\ninherits(PEMDecoder, DERDecoder);\nmodule.exports = PEMDecoder;\n\nPEMDecoder.prototype.decode = function decode(data, options) {\n  const lines = data.toString().split(/[\\r\\n]+/g);\n\n  const label = options.label.toUpperCase();\n\n  const re = /^-----(BEGIN|END) ([^-]+)-----$/;\n  let start = -1;\n  let end = -1;\n  for (let i = 0; i < lines.length; i++) {\n    const match = lines[i].match(re);\n    if (match === null)\n      continue;\n\n    if (match[2] !== label)\n      continue;\n\n    if (start === -1) {\n      if (match[1] !== 'BEGIN')\n        break;\n      start = i;\n    } else {\n      if (match[1] !== 'END')\n        break;\n      end = i;\n      break;\n    }\n  }\n  if (start === -1 || end === -1)\n    throw new Error('PEM section not found for: ' + label);\n\n  const base64 = lines.slice(start + 1, end).join('');\n  // Remove excessive symbols\n  base64.replace(/[^a-z0-9+/=]+/gi, '');\n\n  const input = Buffer.from(base64, 'base64');\n  return DERDecoder.prototype.decode.call(this, input, options);\n};\n","// Copyright 2011 Mark Cavage <mcavage@gmail.com> All rights reserved.\n\n\nmodule.exports = {\n\n  newInvalidAsn1Error: function (msg) {\n    var e = new Error();\n    e.name = 'InvalidAsn1Error';\n    e.message = msg || '';\n    return e;\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    Buffer = require('buffer').Buffer;\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    }\n\n    if (base === 16) {\n      this._parseHex(number, start);\n    } else {\n      this._parseBase(number, base, start);\n    }\n\n    if (number[0] === '-') {\n      this.negative = 1;\n    }\n\n    this.strip();\n\n    if (endian !== 'le') return;\n\n    this._initArray(this.toArray(), base, endian);\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 parseHex (str, start, end) {\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 <<= 4;\n\n      // 'a' - 'f'\n      if (c >= 49 && c <= 54) {\n        r |= c - 49 + 0xa;\n\n      // 'A' - 'F'\n      } else if (c >= 17 && c <= 22) {\n        r |= c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        r |= c & 0xf;\n      }\n    }\n    return r;\n  }\n\n  BN.prototype._parseHex = function _parseHex (number, start) {\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    var j, w;\n    // Scan 24-bit chunks and add them to the number\n    var off = 0;\n    for (i = number.length - 6, j = 0; i >= start; i -= 6) {\n      w = parseHex(number, i, i + 6);\n      this.words[j] |= (w << off) & 0x3ffffff;\n      // NOTE: `0x3fffff` is intentional here, 26bits max shift + 24bit hex limb\n      this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;\n      off += 24;\n      if (off >= 26) {\n        off -= 26;\n        j++;\n      }\n    }\n    if (i + 6 !== start) {\n      w = parseHex(number, start, i + 6);\n      this.words[j] |= (w << off) & 0x3ffffff;\n      this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;\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\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","'use strict';\n\nconst inherits = require('inherits');\n\nconst bignum = require('bn.js');\nconst DecoderBuffer = require('../base/buffer').DecoderBuffer;\nconst Node = require('../base/node');\n\n// Import DER constants\nconst der = require('../constants/der');\n\nfunction DERDecoder(entity) {\n  this.enc = 'der';\n  this.name = entity.name;\n  this.entity = entity;\n\n  // Construct base tree\n  this.tree = new DERNode();\n  this.tree._init(entity.body);\n}\nmodule.exports = DERDecoder;\n\nDERDecoder.prototype.decode = function decode(data, options) {\n  if (!DecoderBuffer.isDecoderBuffer(data)) {\n    data = new DecoderBuffer(data, options);\n  }\n\n  return this.tree._decode(data, options);\n};\n\n// Tree methods\n\nfunction DERNode(parent) {\n  Node.call(this, 'der', parent);\n}\ninherits(DERNode, Node);\n\nDERNode.prototype._peekTag = function peekTag(buffer, tag, any) {\n  if (buffer.isEmpty())\n    return false;\n\n  const state = buffer.save();\n  const decodedTag = derDecodeTag(buffer, 'Failed to peek tag: \"' + tag + '\"');\n  if (buffer.isError(decodedTag))\n    return decodedTag;\n\n  buffer.restore(state);\n\n  return decodedTag.tag === tag || decodedTag.tagStr === tag ||\n    (decodedTag.tagStr + 'of') === tag || any;\n};\n\nDERNode.prototype._decodeTag = function decodeTag(buffer, tag, any) {\n  const decodedTag = derDecodeTag(buffer,\n    'Failed to decode tag of \"' + tag + '\"');\n  if (buffer.isError(decodedTag))\n    return decodedTag;\n\n  let len = derDecodeLen(buffer,\n    decodedTag.primitive,\n    'Failed to get length of \"' + tag + '\"');\n\n  // Failure\n  if (buffer.isError(len))\n    return len;\n\n  if (!any &&\n      decodedTag.tag !== tag &&\n      decodedTag.tagStr !== tag &&\n      decodedTag.tagStr + 'of' !== tag) {\n    return buffer.error('Failed to match tag: \"' + tag + '\"');\n  }\n\n  if (decodedTag.primitive || len !== null)\n    return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n\n  // Indefinite length... find END tag\n  const state = buffer.save();\n  const res = this._skipUntilEnd(\n    buffer,\n    'Failed to skip indefinite length body: \"' + this.tag + '\"');\n  if (buffer.isError(res))\n    return res;\n\n  len = buffer.offset - state.offset;\n  buffer.restore(state);\n  return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n};\n\nDERNode.prototype._skipUntilEnd = function skipUntilEnd(buffer, fail) {\n  for (;;) {\n    const tag = derDecodeTag(buffer, fail);\n    if (buffer.isError(tag))\n      return tag;\n    const len = derDecodeLen(buffer, tag.primitive, fail);\n    if (buffer.isError(len))\n      return len;\n\n    let res;\n    if (tag.primitive || len !== null)\n      res = buffer.skip(len);\n    else\n      res = this._skipUntilEnd(buffer, fail);\n\n    // Failure\n    if (buffer.isError(res))\n      return res;\n\n    if (tag.tagStr === 'end')\n      break;\n  }\n};\n\nDERNode.prototype._decodeList = function decodeList(buffer, tag, decoder,\n  options) {\n  const result = [];\n  while (!buffer.isEmpty()) {\n    const possibleEnd = this._peekTag(buffer, 'end');\n    if (buffer.isError(possibleEnd))\n      return possibleEnd;\n\n    const res = decoder.decode(buffer, 'der', options);\n    if (buffer.isError(res) && possibleEnd)\n      break;\n    result.push(res);\n  }\n  return result;\n};\n\nDERNode.prototype._decodeStr = function decodeStr(buffer, tag) {\n  if (tag === 'bitstr') {\n    const unused = buffer.readUInt8();\n    if (buffer.isError(unused))\n      return unused;\n    return { unused: unused, data: buffer.raw() };\n  } else if (tag === 'bmpstr') {\n    const raw = buffer.raw();\n    if (raw.length % 2 === 1)\n      return buffer.error('Decoding of string type: bmpstr length mismatch');\n\n    let str = '';\n    for (let i = 0; i < raw.length / 2; i++) {\n      str += String.fromCharCode(raw.readUInt16BE(i * 2));\n    }\n    return str;\n  } else if (tag === 'numstr') {\n    const numstr = buffer.raw().toString('ascii');\n    if (!this._isNumstr(numstr)) {\n      return buffer.error('Decoding of string type: ' +\n                          'numstr unsupported characters');\n    }\n    return numstr;\n  } else if (tag === 'octstr') {\n    return buffer.raw();\n  } else if (tag === 'objDesc') {\n    return buffer.raw();\n  } else if (tag === 'printstr') {\n    const printstr = buffer.raw().toString('ascii');\n    if (!this._isPrintstr(printstr)) {\n      return buffer.error('Decoding of string type: ' +\n                          'printstr unsupported characters');\n    }\n    return printstr;\n  } else if (/str$/.test(tag)) {\n    return buffer.raw().toString();\n  } else {\n    return buffer.error('Decoding of string type: ' + tag + ' unsupported');\n  }\n};\n\nDERNode.prototype._decodeObjid = function decodeObjid(buffer, values, relative) {\n  let result;\n  const identifiers = [];\n  let ident = 0;\n  let subident = 0;\n  while (!buffer.isEmpty()) {\n    subident = buffer.readUInt8();\n    ident <<= 7;\n    ident |= subident & 0x7f;\n    if ((subident & 0x80) === 0) {\n      identifiers.push(ident);\n      ident = 0;\n    }\n  }\n  if (subident & 0x80)\n    identifiers.push(ident);\n\n  const first = (identifiers[0] / 40) | 0;\n  const second = identifiers[0] % 40;\n\n  if (relative)\n    result = identifiers;\n  else\n    result = [first, second].concat(identifiers.slice(1));\n\n  if (values) {\n    let tmp = values[result.join(' ')];\n    if (tmp === undefined)\n      tmp = values[result.join('.')];\n    if (tmp !== undefined)\n      result = tmp;\n  }\n\n  return result;\n};\n\nDERNode.prototype._decodeTime = function decodeTime(buffer, tag) {\n  const str = buffer.raw().toString();\n\n  let year;\n  let mon;\n  let day;\n  let hour;\n  let min;\n  let sec;\n  if (tag === 'gentime') {\n    year = str.slice(0, 4) | 0;\n    mon = str.slice(4, 6) | 0;\n    day = str.slice(6, 8) | 0;\n    hour = str.slice(8, 10) | 0;\n    min = str.slice(10, 12) | 0;\n    sec = str.slice(12, 14) | 0;\n  } else if (tag === 'utctime') {\n    year = str.slice(0, 2) | 0;\n    mon = str.slice(2, 4) | 0;\n    day = str.slice(4, 6) | 0;\n    hour = str.slice(6, 8) | 0;\n    min = str.slice(8, 10) | 0;\n    sec = str.slice(10, 12) | 0;\n    if (year < 70)\n      year = 2000 + year;\n    else\n      year = 1900 + year;\n  } else {\n    return buffer.error('Decoding ' + tag + ' time is not supported yet');\n  }\n\n  return Date.UTC(year, mon - 1, day, hour, min, sec, 0);\n};\n\nDERNode.prototype._decodeNull = function decodeNull() {\n  return null;\n};\n\nDERNode.prototype._decodeBool = function decodeBool(buffer) {\n  const res = buffer.readUInt8();\n  if (buffer.isError(res))\n    return res;\n  else\n    return res !== 0;\n};\n\nDERNode.prototype._decodeInt = function decodeInt(buffer, values) {\n  // Bigint, return as it is (assume big endian)\n  const raw = buffer.raw();\n  let res = new bignum(raw);\n\n  if (values)\n    res = values[res.toString(10)] || res;\n\n  return res;\n};\n\nDERNode.prototype._use = function use(entity, obj) {\n  if (typeof entity === 'function')\n    entity = entity(obj);\n  return entity._getDecoder('der').tree;\n};\n\n// Utility methods\n\nfunction derDecodeTag(buf, fail) {\n  let tag = buf.readUInt8(fail);\n  if (buf.isError(tag))\n    return tag;\n\n  const cls = der.tagClass[tag >> 6];\n  const primitive = (tag & 0x20) === 0;\n\n  // Multi-octet tag - load\n  if ((tag & 0x1f) === 0x1f) {\n    let oct = tag;\n    tag = 0;\n    while ((oct & 0x80) === 0x80) {\n      oct = buf.readUInt8(fail);\n      if (buf.isError(oct))\n        return oct;\n\n      tag <<= 7;\n      tag |= oct & 0x7f;\n    }\n  } else {\n    tag &= 0x1f;\n  }\n  const tagStr = der.tag[tag];\n\n  return {\n    cls: cls,\n    primitive: primitive,\n    tag: tag,\n    tagStr: tagStr\n  };\n}\n\nfunction derDecodeLen(buf, primitive, fail) {\n  let len = buf.readUInt8(fail);\n  if (buf.isError(len))\n    return len;\n\n  // Indefinite form\n  if (!primitive && len === 0x80)\n    return null;\n\n  // Definite form\n  if ((len & 0x80) === 0) {\n    // Short form\n    return len;\n  }\n\n  // Long form\n  const num = len & 0x7f;\n  if (num > 4)\n    return buf.error('length octect is too long');\n\n  len = 0;\n  for (let i = 0; i < num; i++) {\n    len <<= 8;\n    const j = buf.readUInt8(fail);\n    if (buf.isError(j))\n      return j;\n    len |= j;\n  }\n\n  return len;\n}\n","'use strict';\n\nconst inherits = require('inherits');\n\nfunction Reporter(options) {\n  this._reporterState = {\n    obj: null,\n    path: [],\n    options: options || {},\n    errors: []\n  };\n}\nexports.Reporter = Reporter;\n\nReporter.prototype.isError = function isError(obj) {\n  return obj instanceof ReporterError;\n};\n\nReporter.prototype.save = function save() {\n  const state = this._reporterState;\n\n  return { obj: state.obj, pathLen: state.path.length };\n};\n\nReporter.prototype.restore = function restore(data) {\n  const state = this._reporterState;\n\n  state.obj = data.obj;\n  state.path = state.path.slice(0, data.pathLen);\n};\n\nReporter.prototype.enterKey = function enterKey(key) {\n  return this._reporterState.path.push(key);\n};\n\nReporter.prototype.exitKey = function exitKey(index) {\n  const state = this._reporterState;\n\n  state.path = state.path.slice(0, index - 1);\n};\n\nReporter.prototype.leaveKey = function leaveKey(index, key, value) {\n  const state = this._reporterState;\n\n  this.exitKey(index);\n  if (state.obj !== null)\n    state.obj[key] = value;\n};\n\nReporter.prototype.path = function path() {\n  return this._reporterState.path.join('/');\n};\n\nReporter.prototype.enterObject = function enterObject() {\n  const state = this._reporterState;\n\n  const prev = state.obj;\n  state.obj = {};\n  return prev;\n};\n\nReporter.prototype.leaveObject = function leaveObject(prev) {\n  const state = this._reporterState;\n\n  const now = state.obj;\n  state.obj = prev;\n  return now;\n};\n\nReporter.prototype.error = function error(msg) {\n  let err;\n  const state = this._reporterState;\n\n  const inherited = msg instanceof ReporterError;\n  if (inherited) {\n    err = msg;\n  } else {\n    err = new ReporterError(state.path.map(function(elem) {\n      return '[' + JSON.stringify(elem) + ']';\n    }).join(''), msg.message || msg, msg.stack);\n  }\n\n  if (!state.options.partial)\n    throw err;\n\n  if (!inherited)\n    state.errors.push(err);\n\n  return err;\n};\n\nReporter.prototype.wrapResult = function wrapResult(result) {\n  const state = this._reporterState;\n  if (!state.options.partial)\n    return result;\n\n  return {\n    result: this.isError(result) ? null : result,\n    errors: state.errors\n  };\n};\n\nfunction ReporterError(path, msg) {\n  this.path = path;\n  this.rethrow(msg);\n}\ninherits(ReporterError, Error);\n\nReporterError.prototype.rethrow = function rethrow(msg) {\n  this.message = msg + ' at: ' + (this.path || '(shallow)');\n  if (Error.captureStackTrace)\n    Error.captureStackTrace(this, ReporterError);\n\n  if (!this.stack) {\n    try {\n      // IE only adds stack when thrown\n      throw new Error(this.message);\n    } catch (e) {\n      this.stack = e.stack;\n    }\n  }\n  return this;\n};\n","// Copyright 2011 Mark Cavage <mcavage@gmail.com> All rights reserved.\n\nvar assert = require('assert');\nvar Buffer = require('safer-buffer').Buffer;\nvar ASN1 = require('./types');\nvar errors = require('./errors');\n\n\n// --- Globals\n\nvar newInvalidAsn1Error = errors.newInvalidAsn1Error;\n\nvar DEFAULT_OPTS = {\n  size: 1024,\n  growthFactor: 8\n};\n\n\n// --- Helpers\n\nfunction merge(from, to) {\n  assert.ok(from);\n  assert.equal(typeof (from), 'object');\n  assert.ok(to);\n  assert.equal(typeof (to), 'object');\n\n  var keys = Object.getOwnPropertyNames(from);\n  keys.forEach(function (key) {\n    if (to[key])\n      return;\n\n    var value = Object.getOwnPropertyDescriptor(from, key);\n    Object.defineProperty(to, key, value);\n  });\n\n  return to;\n}\n\n\n\n// --- API\n\nfunction Writer(options) {\n  options = merge(DEFAULT_OPTS, options || {});\n\n  this._buf = Buffer.alloc(options.size || 1024);\n  this._size = this._buf.length;\n  this._offset = 0;\n  this._options = options;\n\n  // A list of offsets in the buffer where we need to insert\n  // sequence tag/len pairs.\n  this._seq = [];\n}\n\nObject.defineProperty(Writer.prototype, 'buffer', {\n  get: function () {\n    if (this._seq.length)\n      throw newInvalidAsn1Error(this._seq.length + ' unended sequence(s)');\n\n    return (this._buf.slice(0, this._offset));\n  }\n});\n\nWriter.prototype.writeByte = function (b) {\n  if (typeof (b) !== 'number')\n    throw new TypeError('argument must be a Number');\n\n  this._ensure(1);\n  this._buf[this._offset++] = b;\n};\n\n\nWriter.prototype.writeInt = function (i, tag) {\n  if (typeof (i) !== 'number')\n    throw new TypeError('argument must be a Number');\n  if (typeof (tag) !== 'number')\n    tag = ASN1.Integer;\n\n  var sz = 4;\n\n  while ((((i & 0xff800000) === 0) || ((i & 0xff800000) === 0xff800000 >> 0)) &&\n        (sz > 1)) {\n    sz--;\n    i <<= 8;\n  }\n\n  if (sz > 4)\n    throw newInvalidAsn1Error('BER ints cannot be > 0xffffffff');\n\n  this._ensure(2 + sz);\n  this._buf[this._offset++] = tag;\n  this._buf[this._offset++] = sz;\n\n  while (sz-- > 0) {\n    this._buf[this._offset++] = ((i & 0xff000000) >>> 24);\n    i <<= 8;\n  }\n\n};\n\n\nWriter.prototype.writeNull = function () {\n  this.writeByte(ASN1.Null);\n  this.writeByte(0x00);\n};\n\n\nWriter.prototype.writeEnumeration = function (i, tag) {\n  if (typeof (i) !== 'number')\n    throw new TypeError('argument must be a Number');\n  if (typeof (tag) !== 'number')\n    tag = ASN1.Enumeration;\n\n  return this.writeInt(i, tag);\n};\n\n\nWriter.prototype.writeBoolean = function (b, tag) {\n  if (typeof (b) !== 'boolean')\n    throw new TypeError('argument must be a Boolean');\n  if (typeof (tag) !== 'number')\n    tag = ASN1.Boolean;\n\n  this._ensure(3);\n  this._buf[this._offset++] = tag;\n  this._buf[this._offset++] = 0x01;\n  this._buf[this._offset++] = b ? 0xff : 0x00;\n};\n\n\nWriter.prototype.writeString = function (s, tag) {\n  if (typeof (s) !== 'string')\n    throw new TypeError('argument must be a string (was: ' + typeof (s) + ')');\n  if (typeof (tag) !== 'number')\n    tag = ASN1.OctetString;\n\n  var len = Buffer.byteLength(s);\n  this.writeByte(tag);\n  this.writeLength(len);\n  if (len) {\n    this._ensure(len);\n    this._buf.write(s, this._offset);\n    this._offset += len;\n  }\n};\n\n\nWriter.prototype.writeBuffer = function (buf, tag) {\n  if (typeof (tag) !== 'number')\n    throw new TypeError('tag must be a number');\n  if (!Buffer.isBuffer(buf))\n    throw new TypeError('argument must be a buffer');\n\n  this.writeByte(tag);\n  this.writeLength(buf.length);\n  this._ensure(buf.length);\n  buf.copy(this._buf, this._offset, 0, buf.length);\n  this._offset += buf.length;\n};\n\n\nWriter.prototype.writeStringArray = function (strings) {\n  if ((!strings instanceof Array))\n    throw new TypeError('argument must be an Array[String]');\n\n  var self = this;\n  strings.forEach(function (s) {\n    self.writeString(s);\n  });\n};\n\n// This is really to solve DER cases, but whatever for now\nWriter.prototype.writeOID = function (s, tag) {\n  if (typeof (s) !== 'string')\n    throw new TypeError('argument must be a string');\n  if (typeof (tag) !== 'number')\n    tag = ASN1.OID;\n\n  if (!/^([0-9]+\\.){3,}[0-9]+$/.test(s))\n    throw new Error('argument is not a valid OID string');\n\n  function encodeOctet(bytes, octet) {\n    if (octet < 128) {\n        bytes.push(octet);\n    } else if (octet < 16384) {\n        bytes.push((octet >>> 7) | 0x80);\n        bytes.push(octet & 0x7F);\n    } else if (octet < 2097152) {\n      bytes.push((octet >>> 14) | 0x80);\n      bytes.push(((octet >>> 7) | 0x80) & 0xFF);\n      bytes.push(octet & 0x7F);\n    } else if (octet < 268435456) {\n      bytes.push((octet >>> 21) | 0x80);\n      bytes.push(((octet >>> 14) | 0x80) & 0xFF);\n      bytes.push(((octet >>> 7) | 0x80) & 0xFF);\n      bytes.push(octet & 0x7F);\n    } else {\n      bytes.push(((octet >>> 28) | 0x80) & 0xFF);\n      bytes.push(((octet >>> 21) | 0x80) & 0xFF);\n      bytes.push(((octet >>> 14) | 0x80) & 0xFF);\n      bytes.push(((octet >>> 7) | 0x80) & 0xFF);\n      bytes.push(octet & 0x7F);\n    }\n  }\n\n  var tmp = s.split('.');\n  var bytes = [];\n  bytes.push(parseInt(tmp[0], 10) * 40 + parseInt(tmp[1], 10));\n  tmp.slice(2).forEach(function (b) {\n    encodeOctet(bytes, parseInt(b, 10));\n  });\n\n  var self = this;\n  this._ensure(2 + bytes.length);\n  this.writeByte(tag);\n  this.writeLength(bytes.length);\n  bytes.forEach(function (b) {\n    self.writeByte(b);\n  });\n};\n\n\nWriter.prototype.writeLength = function (len) {\n  if (typeof (len) !== 'number')\n    throw new TypeError('argument must be a Number');\n\n  this._ensure(4);\n\n  if (len <= 0x7f) {\n    this._buf[this._offset++] = len;\n  } else if (len <= 0xff) {\n    this._buf[this._offset++] = 0x81;\n    this._buf[this._offset++] = len;\n  } else if (len <= 0xffff) {\n    this._buf[this._offset++] = 0x82;\n    this._buf[this._offset++] = len >> 8;\n    this._buf[this._offset++] = len;\n  } else if (len <= 0xffffff) {\n    this._buf[this._offset++] = 0x83;\n    this._buf[this._offset++] = len >> 16;\n    this._buf[this._offset++] = len >> 8;\n    this._buf[this._offset++] = len;\n  } else {\n    throw newInvalidAsn1Error('Length too long (> 4 bytes)');\n  }\n};\n\nWriter.prototype.startSequence = function (tag) {\n  if (typeof (tag) !== 'number')\n    tag = ASN1.Sequence | ASN1.Constructor;\n\n  this.writeByte(tag);\n  this._seq.push(this._offset);\n  this._ensure(3);\n  this._offset += 3;\n};\n\n\nWriter.prototype.endSequence = function () {\n  var seq = this._seq.pop();\n  var start = seq + 3;\n  var len = this._offset - start;\n\n  if (len <= 0x7f) {\n    this._shift(start, len, -2);\n    this._buf[seq] = len;\n  } else if (len <= 0xff) {\n    this._shift(start, len, -1);\n    this._buf[seq] = 0x81;\n    this._buf[seq + 1] = len;\n  } else if (len <= 0xffff) {\n    this._buf[seq] = 0x82;\n    this._buf[seq + 1] = len >> 8;\n    this._buf[seq + 2] = len;\n  } else if (len <= 0xffffff) {\n    this._shift(start, len, 1);\n    this._buf[seq] = 0x83;\n    this._buf[seq + 1] = len >> 16;\n    this._buf[seq + 2] = len >> 8;\n    this._buf[seq + 3] = len;\n  } else {\n    throw newInvalidAsn1Error('Sequence too long');\n  }\n};\n\n\nWriter.prototype._shift = function (start, len, shift) {\n  assert.ok(start !== undefined);\n  assert.ok(len !== undefined);\n  assert.ok(shift);\n\n  this._buf.copy(this._buf, start + shift, start, start + len);\n  this._offset += shift;\n};\n\nWriter.prototype._ensure = function (len) {\n  assert.ok(len);\n\n  if (this._size - this._offset < len) {\n    var sz = this._size * this._options.growthFactor;\n    if (sz - this._offset < len)\n      sz += len;\n\n    var buf = Buffer.alloc(sz);\n\n    this._buf.copy(buf, 0, 0, this._offset);\n    this._buf = buf;\n    this._size = sz;\n  }\n};\n\n\n\n// --- Exported API\n\nmodule.exports = Writer;\n","// Copyright 2011 Mark Cavage <mcavage@gmail.com> All rights reserved.\n\nvar assert = require('assert');\nvar Buffer = require('safer-buffer').Buffer;\n\nvar ASN1 = require('./types');\nvar errors = require('./errors');\n\n\n// --- Globals\n\nvar newInvalidAsn1Error = errors.newInvalidAsn1Error;\n\n\n\n// --- API\n\nfunction Reader(data) {\n  if (!data || !Buffer.isBuffer(data))\n    throw new TypeError('data must be a node Buffer');\n\n  this._buf = data;\n  this._size = data.length;\n\n  // These hold the \"current\" state\n  this._len = 0;\n  this._offset = 0;\n}\n\nObject.defineProperty(Reader.prototype, 'length', {\n  enumerable: true,\n  get: function () { return (this._len); }\n});\n\nObject.defineProperty(Reader.prototype, 'offset', {\n  enumerable: true,\n  get: function () { return (this._offset); }\n});\n\nObject.defineProperty(Reader.prototype, 'remain', {\n  get: function () { return (this._size - this._offset); }\n});\n\nObject.defineProperty(Reader.prototype, 'buffer', {\n  get: function () { return (this._buf.slice(this._offset)); }\n});\n\n\n/**\n * Reads a single byte and advances offset; you can pass in `true` to make this\n * a \"peek\" operation (i.e., get the byte, but don't advance the offset).\n *\n * @param {Boolean} peek true means don't move offset.\n * @return {Number} the next byte, null if not enough data.\n */\nReader.prototype.readByte = function (peek) {\n  if (this._size - this._offset < 1)\n    return null;\n\n  var b = this._buf[this._offset] & 0xff;\n\n  if (!peek)\n    this._offset += 1;\n\n  return b;\n};\n\n\nReader.prototype.peek = function () {\n  return this.readByte(true);\n};\n\n\n/**\n * Reads a (potentially) variable length off the BER buffer.  This call is\n * not really meant to be called directly, as callers have to manipulate\n * the internal buffer afterwards.\n *\n * As a result of this call, you can call `Reader.length`, until the\n * next thing called that does a readLength.\n *\n * @return {Number} the amount of offset to advance the buffer.\n * @throws {InvalidAsn1Error} on bad ASN.1\n */\nReader.prototype.readLength = function (offset) {\n  if (offset === undefined)\n    offset = this._offset;\n\n  if (offset >= this._size)\n    return null;\n\n  var lenB = this._buf[offset++] & 0xff;\n  if (lenB === null)\n    return null;\n\n  if ((lenB & 0x80) === 0x80) {\n    lenB &= 0x7f;\n\n    if (lenB === 0)\n      throw newInvalidAsn1Error('Indefinite length not supported');\n\n    if (lenB > 4)\n      throw newInvalidAsn1Error('encoding too long');\n\n    if (this._size - offset < lenB)\n      return null;\n\n    this._len = 0;\n    for (var i = 0; i < lenB; i++)\n      this._len = (this._len << 8) + (this._buf[offset++] & 0xff);\n\n  } else {\n    // Wasn't a variable length\n    this._len = lenB;\n  }\n\n  return offset;\n};\n\n\n/**\n * Parses the next sequence in this BER buffer.\n *\n * To get the length of the sequence, call `Reader.length`.\n *\n * @return {Number} the sequence's tag.\n */\nReader.prototype.readSequence = function (tag) {\n  var seq = this.peek();\n  if (seq === null)\n    return null;\n  if (tag !== undefined && tag !== seq)\n    throw newInvalidAsn1Error('Expected 0x' + tag.toString(16) +\n                              ': got 0x' + seq.toString(16));\n\n  var o = this.readLength(this._offset + 1); // stored in `length`\n  if (o === null)\n    return null;\n\n  this._offset = o;\n  return seq;\n};\n\n\nReader.prototype.readInt = function () {\n  return this._readTag(ASN1.Integer);\n};\n\n\nReader.prototype.readBoolean = function () {\n  return (this._readTag(ASN1.Boolean) === 0 ? false : true);\n};\n\n\nReader.prototype.readEnumeration = function () {\n  return this._readTag(ASN1.Enumeration);\n};\n\n\nReader.prototype.readString = function (tag, retbuf) {\n  if (!tag)\n    tag = ASN1.OctetString;\n\n  var b = this.peek();\n  if (b === null)\n    return null;\n\n  if (b !== tag)\n    throw newInvalidAsn1Error('Expected 0x' + tag.toString(16) +\n                              ': got 0x' + b.toString(16));\n\n  var o = this.readLength(this._offset + 1); // stored in `length`\n\n  if (o === null)\n    return null;\n\n  if (this.length > this._size - o)\n    return null;\n\n  this._offset = o;\n\n  if (this.length === 0)\n    return retbuf ? Buffer.alloc(0) : '';\n\n  var str = this._buf.slice(this._offset, this._offset + this.length);\n  this._offset += this.length;\n\n  return retbuf ? str : str.toString('utf8');\n};\n\nReader.prototype.readOID = function (tag) {\n  if (!tag)\n    tag = ASN1.OID;\n\n  var b = this.readString(tag, true);\n  if (b === null)\n    return null;\n\n  var values = [];\n  var value = 0;\n\n  for (var i = 0; i < b.length; i++) {\n    var byte = b[i] & 0xff;\n\n    value <<= 7;\n    value += byte & 0x7f;\n    if ((byte & 0x80) === 0) {\n      values.push(value);\n      value = 0;\n    }\n  }\n\n  value = values.shift();\n  values.unshift(value % 40);\n  values.unshift((value / 40) >> 0);\n\n  return values.join('.');\n};\n\n\nReader.prototype._readTag = function (tag) {\n  assert.ok(tag !== undefined);\n\n  var b = this.peek();\n\n  if (b === null)\n    return null;\n\n  if (b !== tag)\n    throw newInvalidAsn1Error('Expected 0x' + tag.toString(16) +\n                              ': got 0x' + b.toString(16));\n\n  var o = this.readLength(this._offset + 1); // stored in `length`\n  if (o === null)\n    return null;\n\n  if (this.length > 4)\n    throw newInvalidAsn1Error('Integer too long: ' + this.length);\n\n  if (this.length > this._size - o)\n    return null;\n  this._offset = o;\n\n  var fb = this._buf[this._offset];\n  var value = 0;\n\n  for (var i = 0; i < this.length; i++) {\n    value <<= 8;\n    value |= (this._buf[this._offset++] & 0xff);\n  }\n\n  if ((fb & 0x80) === 0x80 && i !== 4)\n    value -= (1 << (i * 8));\n\n  return value >> 0;\n};\n\n\n\n// --- Exported API\n\nmodule.exports = Reader;\n","'use strict';\n\nconst encoders = require('./encoders');\nconst decoders = require('./decoders');\nconst inherits = require('inherits');\n\nconst api = exports;\n\napi.define = function define(name, body) {\n  return new Entity(name, body);\n};\n\nfunction Entity(name, body) {\n  this.name = name;\n  this.body = body;\n\n  this.decoders = {};\n  this.encoders = {};\n}\n\nEntity.prototype._createNamed = function createNamed(Base) {\n  const name = this.name;\n\n  function Generated(entity) {\n    this._initNamed(entity, name);\n  }\n  inherits(Generated, Base);\n  Generated.prototype._initNamed = function _initNamed(entity, name) {\n    Base.call(this, entity, name);\n  };\n\n  return new Generated(this);\n};\n\nEntity.prototype._getDecoder = function _getDecoder(enc) {\n  enc = enc || 'der';\n  // Lazily create decoder\n  if (!this.decoders.hasOwnProperty(enc))\n    this.decoders[enc] = this._createNamed(decoders[enc]);\n  return this.decoders[enc];\n};\n\nEntity.prototype.decode = function decode(data, enc, options) {\n  return this._getDecoder(enc).decode(data, options);\n};\n\nEntity.prototype._getEncoder = function _getEncoder(enc) {\n  enc = enc || 'der';\n  // Lazily create encoder\n  if (!this.encoders.hasOwnProperty(enc))\n    this.encoders[enc] = this._createNamed(encoders[enc]);\n  return this.encoders[enc];\n};\n\nEntity.prototype.encode = function encode(data, enc, /* internal */ reporter) {\n  return this._getEncoder(enc).encode(data, reporter);\n};\n"],"sourceRoot":""}