{"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/aws-sign2/index.js","webpack:///./node_modules/aws4/lru.js","webpack:///./node_modules/asn1.js/lib/asn1/base/buffer.js","webpack:///./node_modules/asn1/lib/index.js","webpack:///./node_modules/aws4/aws4.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/assert-plus/assert.js","webpack:///./node_modules/asn1.js/lib/asn1/api.js","webpack:///./node_modules/assert/assert.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","crypto","parse","authorization","options","hmacSha1","createHmac","secret","update","message","digest","stringToSign","signQuery","queryStringToSign","headers","amazonHeaders","r","verb","md5","contentType","toUTCString","resource","canonicalizeHeaders","fields","len","field","val","toLowerCase","indexOf","push","sort","canonicalizeResource","url","path","pathname","query","encodeURIComponent","LruCache","capacity","create","list","DoublyLinkedList","firstNode","lastNode","DoublyLinkedNode","prev","next","get","node","used","set","prune","moveToFront","pop","remove","item","isEncoderBuffer","byteLength","isDecoderBuffer","isCompatible","constructor","save","restore","isEmpty","readUInt8","skip","raw","fail","bytes","_reporterState","write","Ber","BerReader","BerWriter","querystring","lru","credentialsCache","hmac","string","encoding","hash","createHash","encodeRfc3986","urlEncodedString","replace","c","toString","toUpperCase","encodeRfc3986Full","HEADERS_TO_IGNORE","RequestSigner","request","credentials","hostParts","service","region","matchHost","hostname","host","Host","defaultCredentials","method","createHost","port","isCodeCommitGit","match","reverse","isSingleRegion","subdomain","prepareRequest","parsePath","parsedPath","sessionToken","datetime","getDateTime","accessKeyId","credentialString","signedHeaders","doNotModifyHeaders","Authorization","signature","authHeader","formatPath","toISOString","getDate","substr","kDate","kRegion","kService","cacheKey","secretAccessKey","kCredentials","canonicalString","bodyHash","pathStr","queryStr","normalizePath","decodePath","doNotEncodePath","decodeSlashesInPath","firstValOnly","reducedQuery","reduce","encodedQueryPieces","piece","decodeURIComponent","canonicalHeaders","trimAll","trim","filter","a","b","env","AWS_ACCESS_KEY_ID","AWS_ACCESS_KEY","AWS_SECRET_ACCESS_KEY","AWS_SECRET_KEY","AWS_SESSION_TOKEN","encodeURI","decodeURI","queryIx","aws4","asn1","bignum","define","assert","tags","methods","concat","overrided","children","args","reverseArgs","choice","optional","any","use","useDecoder","explicit","implicit","contains","_wrap","stateProps","clone","cstate","prop","apply","arguments","child","equal","_useArgs","arg","Error","def","newKey","_decode","input","wrapResult","prevObj","result","present","prevKey","enterKey","_peekTag","isError","_decodeGeneric","_decodeChoice","enterObject","_decodeTag","start","track","_getUse","leaveObject","exitKey","leaveKey","_decodeList","_decodeStr","_decodeObjid","_decodeTime","_decodeNull","_decodeBool","_decodeInt","some","type","_encodeChoice","_encodePrimitive","PEMEncoder","p","label","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","re","end","base64","newInvalidAsn1Error","msg","ctor","superCtor","super_","TempCtor","BN","number","endian","isBN","negative","words","red","wordSize","window","parseHex4Bits","index","parseHexByte","lowerBound","parseBase","mul","Math","min","max","left","right","cmp","_initNumber","_initArray","_parseHex","_parseBase","ceil","w","off","strip","parseLength","limbLen","limbPow","total","mod","word","imuln","_iaddn","pow","dest","_expand","_normSign","inspect","zeros","groupSizes","groupBases","toBitArray","bitLength","bit","wbit","smallMulTo","self","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","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","now","err","inherited","elem","stack","partial","captureStackTrace","ASN1","DEFAULT_OPTS","growthFactor","merge","to","ok","getOwnPropertyNames","getOwnPropertyDescriptor","defineProperty","_buf","_size","_offset","_options","_seq","writeByte","TypeError","_ensure","writeInt","sz","writeNull","writeEnumeration","writeBoolean","writeString","writeLength","writeBuffer","writeStringArray","strings","writeOID","encodeOctet","octet","parseInt","startSequence","endSequence","seq","_shift","_len","enumerable","readByte","peek","readLength","lenB","readSequence","readInt","_readTag","readBoolean","readEnumeration","readString","retbuf","readOID","byte","fb","Stream","util","UUID_REGEXP","_capitalize","charAt","_toss","expected","oper","actual","AssertionError","format","operator","stackStartFunction","caller","_getClass","noop","bool","check","func","object","isNaN","finite","isFinite","array","stream","regexp","RegExp","uuid","_setExports","ndebug","NODE_NDEBUG","api","Entity","_createNamed","Base","Generated","_initNamed","objectAssign","compare","global","_isBuffer","hasOwn","pSlice","functionsHaveNames","pToString","isView","arrbuf","ArrayBuffer","DataView","regex","getName","isFunction","truncate","something","rawname","getMessage","_deepEqual","strict","memos","isDate","getTime","isRegExp","source","multiline","lastIndex","ignoreCase","Float32Array","Float64Array","Uint8Array","actualIndex","objEquiv","isArguments","actualVisitedObjects","isPrimitive","getPrototypeOf","aIsArgs","bIsArgs","ka","objectKeys","kb","notDeepStrictEqual","expectedException","isPrototypeOf","_tryBlock","block","_throws","shouldThrow","userProvidedMessage","isUnwantedException","isUnexpectedException","generatedMessage","fn_name","idx","next_line","substring","notEqual","deepEqual","deepStrictEqual","notDeepEqual","strictEqual","notStrictEqual","throws","doesNotThrow","ifError"],"mappings":"oHAEA,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;;;;;;;;;;;;;;;;ACcpB,IAAIwG,EAAS,EAAQ,QACjBC,EAAQ,EAAQ,QAAOA,MAOvBnH,EACF,CAAE,MACA,WACA,UACA,eACA,aACA,SACA,iBACA,UACA,WACA,UACA,YACA,aACA,WACA,WAYJ,SAASoH,EAAeC,GACtB,MAAO,OAASA,EAAQnH,IAAM,IAAMsF,EAAK6B,GAc3C,SAASC,EAAUD,GACjB,OAAOH,EAAOK,WAAW,OAAQF,EAAQG,QAAQC,OAAOJ,EAAQK,SAASC,OAAO,UAalF,SAASnC,EAAM6B,GAEb,OADAA,EAAQK,QAAUE,EAAaP,GACxBC,EAASD,GAclB,SAASQ,EAAWR,GAElB,OADAA,EAAQK,QAAUI,EAAkBT,GAC7BC,EAASD,GAqBlB,SAASO,EAAcP,GACrB,IAAIU,EAAUV,EAAQW,eAAiB,GACnCD,IAASA,GAAW,MACxB,IAAIE,EACF,CAAEZ,EAAQa,KACRb,EAAQc,IACRd,EAAQe,YACRf,EAAQ1C,KAAO0C,EAAQ1C,KAAK0D,cAAgB,GAC5CN,EAAUV,EAAQiB,UAEtB,OAAOL,EAAE3F,KAAK,MAkBhB,SAASwF,EAAmBT,GAC1B,MAAO,YAAcA,EAAQ1C,KAAO,KAAO0C,EAAQiB,SAkBrD,SAASC,EAAqBR,GAI5B,IAHA,IAAI3E,EAAM,GACNoF,EAASzI,OAAOC,KAAK+H,GAEhBhF,EAAI,EAAG0F,EAAMD,EAAO9F,OAAQK,EAAI0F,IAAO1F,EAAG,CACjD,IAAI2F,EAAQF,EAAOzF,GACf4F,EAAMZ,EAAQW,GACdA,EAAQA,EAAME,cAEd,IAAMF,EAAMG,QAAQ,UACxBzF,EAAI0F,KAAKJ,EAAQ,IAAMC,GAEzB,OAAOvF,EAAI2F,OAAOzG,KAAK,MAezB,SAAS0G,EAAsBV,GAC7B,IAAIW,EAAM9B,EAAMmB,GAAU,GACtBY,EAAOD,EAAIE,SACX/F,EAAM,GASV,OANArD,OAAOC,KAAKiJ,EAAIG,OAAOnJ,SAAQ,SAASC,GACtC,IAAMF,EAAK6I,QAAQ3I,GAAnB,CACA,IAAIyI,EAAM,IAAMM,EAAIG,MAAMlJ,GAAO,GAAK,IAAMmJ,mBAAmBJ,EAAIG,MAAMlJ,IACzEkD,EAAI0F,KAAK5I,EAAMyI,OAGVO,GAAQ9F,EAAIV,OAAS,IAAMU,EAAI2F,OAAOzG,KAAK,KAAO,IAtJ3DL,EAAOtC,QAAUyH,EACjBnF,EAAOtC,QAAQyH,cAAgBA,EAc/BnF,EAAOtC,QAAQ2H,SAAWA,EAc1BrF,EAAOtC,QAAQ6F,KAAOA,EAgBtBvD,EAAOtC,QAAQkI,UAAWA,EA+B1B5F,EAAOtC,QAAQiI,aAAeA,EAmB9B3F,EAAOtC,QAAQmI,kBAAoBA,EA8BnC7F,EAAOtC,QAAQ4I,oBAAsBA,EA2BrCtG,EAAOtC,QAAQqJ,qBAAuBA,G,qBC/MtC,SAASM,EAASjF,GAChBxD,KAAK0I,SAAkB,EAAPlF,EAChBxD,KAAKhB,IAAME,OAAOyJ,OAAO,MACzB3I,KAAK4I,KAAO,IAAIC,EAsClB,SAASA,IACP7I,KAAK8I,UAAY,KACjB9I,KAAK+I,SAAW,KA2ClB,SAASC,EAAiB3J,EAAKyI,GAC7B9H,KAAKX,IAAMA,EACXW,KAAK8H,IAAMA,EACX9H,KAAKiJ,KAAO,KACZjJ,KAAKkJ,KAAO,KA9Fd9H,EAAOtC,QAAU,SAAS0E,GACxB,OAAO,IAAIiF,EAASjF,IAStBiF,EAASpH,UAAU8H,IAAM,SAAS9J,GAChC,IAAI+J,EAAOpJ,KAAKhB,IAAIK,GACpB,GAAY,MAAR+J,EAEJ,OADApJ,KAAKqJ,KAAKD,GACHA,EAAKtB,KAGdW,EAASpH,UAAUiI,IAAM,SAASjK,EAAKyI,GACrC,IAAIsB,EAAOpJ,KAAKhB,IAAIK,GACpB,GAAY,MAAR+J,EACFA,EAAKtB,IAAMA,MACN,CAEL,GADK9H,KAAK0I,UAAU1I,KAAKuJ,SACpBvJ,KAAK0I,SAAU,OAAO,EAC3BU,EAAO,IAAIJ,EAAiB3J,EAAKyI,GACjC9H,KAAKhB,IAAIK,GAAO+J,EAChBpJ,KAAK0I,WAGP,OADA1I,KAAKqJ,KAAKD,IACH,GAGTX,EAASpH,UAAUgI,KAAO,SAASD,GACjCpJ,KAAK4I,KAAKY,YAAYJ,IAGxBX,EAASpH,UAAUkI,MAAQ,WACzB,IAAIH,EAAOpJ,KAAK4I,KAAKa,MACT,MAARL,WACKpJ,KAAKhB,IAAIoK,EAAK/J,KACrBW,KAAK0I,aAUTG,EAAiBxH,UAAUmI,YAAc,SAASJ,GAC5CpJ,KAAK8I,WAAaM,IAEtBpJ,KAAK0J,OAAON,GAEU,MAAlBpJ,KAAK8I,WACP9I,KAAK8I,UAAYM,EACjBpJ,KAAK+I,SAAWK,EAChBA,EAAKH,KAAO,KACZG,EAAKF,KAAO,OAEZE,EAAKH,KAAO,KACZG,EAAKF,KAAOlJ,KAAK8I,UACjBM,EAAKF,KAAKD,KAAOG,EACjBpJ,KAAK8I,UAAYM,KAIrBP,EAAiBxH,UAAUoI,IAAM,WAC/B,IAAIV,EAAW/I,KAAK+I,SAIpB,OAHgB,MAAZA,GACF/I,KAAK0J,OAAOX,GAEPA,GAGTF,EAAiBxH,UAAUqI,OAAS,SAASN,GACvCpJ,KAAK8I,WAAaM,EACpBpJ,KAAK8I,UAAYM,EAAKF,KACA,MAAbE,EAAKH,OACdG,EAAKH,KAAKC,KAAOE,EAAKF,MAEpBlJ,KAAK+I,UAAYK,EACnBpJ,KAAK+I,SAAWK,EAAKH,KACC,MAAbG,EAAKF,OACdE,EAAKF,KAAKD,KAAOG,EAAKH,Q,kCCnF1B,MAAMtJ,EAAW,EAAQ,QACnBuG,EAAW,EAAQ,QAAoBA,SACvCtG,EAAS,EAAQ,QAAgBA,OAEvC,SAASuG,EAAcF,EAAMO,GAC3BN,EAAS1F,KAAKR,KAAMwG,GACf5G,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,SAAS2K,GAI9B,OAHKvD,EAAcwD,gBAAgBD,KACjCA,EAAO,IAAIvD,EAAcuD,EAAM5I,IACjCf,KAAK6B,QAAU8H,EAAK9H,OACb8H,IACN3J,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,EAAOiK,WAAWvK,OAC3B,KAAIM,EAAO4E,SAASlF,GAIzB,OAAOyB,EAASG,MAAM,4BAA8B5B,GAHpDU,KAAKV,MAAQA,EACbU,KAAK6B,OAASvC,EAAMuC,QAzFxBlC,EAASwG,EAAeD,GACxBpH,EAAQqH,cAAgBA,EAExBA,EAAc2D,gBAAkB,SAAyBvI,GACvD,GAAIA,aAAgB4E,EAClB,OAAO,EAIT,MAAM4D,EAA+B,kBAATxI,GAC1B3B,EAAO4E,SAASjD,EAAK0E,OACK,kBAA1B1E,EAAKyI,YAAY9J,MACM,kBAAhBqB,EAAKoC,QACW,kBAAhBpC,EAAKM,QACS,oBAAdN,EAAK0I,MACY,oBAAjB1I,EAAK2I,SACY,oBAAjB3I,EAAK4I,SACc,oBAAnB5I,EAAK6I,WACS,oBAAd7I,EAAK8I,MACQ,oBAAb9I,EAAK+I,IAEd,OAAOP,GAGT5D,EAAc9E,UAAU4I,KAAO,WAC7B,MAAO,CAAEtG,OAAQ3D,KAAK2D,OAAQ5C,SAAUmF,EAAS7E,UAAU4I,KAAKzJ,KAAKR,QAGvEmG,EAAc9E,UAAU6I,QAAU,SAAiBD,GAEjD,MAAMhL,EAAM,IAAIkH,EAAcnG,KAAKiG,MAOnC,OANAhH,EAAI0E,OAASsG,EAAKtG,OAClB1E,EAAI4C,OAAS7B,KAAK2D,OAElB3D,KAAK2D,OAASsG,EAAKtG,OACnBuC,EAAS7E,UAAU6I,QAAQ1J,KAAKR,KAAMiK,EAAKlJ,UAEpC9B,GAGTkH,EAAc9E,UAAU8I,QAAU,WAChC,OAAOnK,KAAK2D,SAAW3D,KAAK6B,QAG9BsE,EAAc9E,UAAU+I,UAAY,SAAmBG,GACrD,OAAIvK,KAAK2D,OAAS,GAAK3D,KAAK6B,OACnB7B,KAAKiG,KAAKmE,UAAUpK,KAAK2D,UAAU,GAEnC3D,KAAKkB,MAAMqJ,GAAQ,0BAG9BpE,EAAc9E,UAAUgJ,KAAO,SAAcG,EAAOD,GAClD,KAAMvK,KAAK2D,OAAS6G,GAASxK,KAAK6B,QAChC,OAAO7B,KAAKkB,MAAMqJ,GAAQ,yBAE5B,MAAMtL,EAAM,IAAIkH,EAAcnG,KAAKiG,MAQnC,OALAhH,EAAIwL,eAAiBzK,KAAKyK,eAE1BxL,EAAI0E,OAAS3D,KAAK2D,OAClB1E,EAAI4C,OAAS7B,KAAK2D,OAAS6G,EAC3BxK,KAAK2D,QAAU6G,EACRvL,GAGTkH,EAAc9E,UAAUiJ,IAAM,SAAaL,GACzC,OAAOjK,KAAKiG,KAAK7C,MAAM6G,EAAOA,EAAKtG,OAAS3D,KAAK2D,OAAQ3D,KAAK6B,SA2BhE/C,EAAQsH,cAAgBA,EAExBA,EAAcwD,gBAAkB,SAAyBrI,GACvD,GAAIA,aAAgB6E,EAClB,OAAO,EAIT,MAAM2D,EAA+B,kBAATxI,GACA,kBAA1BA,EAAKyI,YAAY9J,MACM,kBAAhBqB,EAAKM,QACS,oBAAdN,EAAKE,KAEd,OAAOsI,GAGT3D,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,SAASuK,GAC1BA,EAAKlI,KAAKqD,EAAKnB,GACfA,GAAUgG,EAAK9H,WAGS,kBAAf7B,KAAKV,MACdwF,EAAInB,GAAU3D,KAAKV,MACU,kBAAfU,KAAKV,MACnBwF,EAAI4F,MAAM1K,KAAKV,MAAOqE,GACf/D,EAAO4E,SAASxE,KAAKV,QAC5BU,KAAKV,MAAMyF,KAAKD,EAAKnB,GACvBA,GAAU3D,KAAK6B,SAdRiD,I,uBCjIX,IAAI6F,EAAM,EAAQ,QAMlBvJ,EAAOtC,QAAU,CAEf6L,IAAKA,EAELC,UAAWD,EAAI9E,OAEfgF,UAAWF,EAAI7E,S,wBCjBjB,oBACIsC,EAAM,EAAQ,QACd0C,EAAc,EAAQ,QACtBzE,EAAS,EAAQ,QACjB0E,EAAM,EAAQ,QACdC,EAAmBD,EAAI,KAI3B,SAASE,EAAK5L,EAAK6L,EAAQC,GACzB,OAAO9E,EAAOK,WAAW,SAAUrH,GAAKuH,OAAOsE,EAAQ,QAAQpE,OAAOqE,GAGxE,SAASC,EAAKF,EAAQC,GACpB,OAAO9E,EAAOgF,WAAW,UAAUzE,OAAOsE,EAAQ,QAAQpE,OAAOqE,GAInE,SAASG,EAAcC,GACrB,OAAOA,EAAiBC,QAAQ,YAAY,SAASC,GACnD,MAAO,IAAMA,EAAEhJ,WAAW,GAAGiJ,SAAS,IAAIC,iBAI9C,SAASC,EAAkBvJ,GACzB,OAAOiJ,EAAc9C,mBAAmBnG,IAO1C,IAAIwJ,EAAoB,CACtB,eAAiB,EACjB,YAAc,EACd,mBAAmB,EACnB,cAAc,EACd,QAAU,EACV,qBAAqB,EACrB,OAAS,GAKX,SAASC,EAAcC,EAASC,GAEP,kBAAZD,IAAsBA,EAAU3D,EAAI9B,MAAMyF,IAErD,IAAI7E,EAAU6E,EAAQ7E,QAAW6E,EAAQ7E,SAAW,GAChD+E,IAAcjM,KAAKkM,UAAYlM,KAAKmM,SAAWnM,KAAKoM,UAAUL,EAAQM,UAAYN,EAAQO,MAAQpF,EAAQqF,MAAQrF,EAAQoF,MAE9HtM,KAAK+L,QAAUA,EACf/L,KAAKgM,YAAcA,GAAehM,KAAKwM,qBAEvCxM,KAAKkM,QAAUH,EAAQG,SAAWD,EAAU,IAAM,GAClDjM,KAAKmM,OAASJ,EAAQI,QAAUF,EAAU,IAAM,YAG3B,UAAjBjM,KAAKkM,UAAqBlM,KAAKkM,QAAU,QAExCH,EAAQU,QAAUV,EAAQzL,OAC7ByL,EAAQU,OAAS,QAEdvF,EAAQqF,MAASrF,EAAQoF,OAC5BpF,EAAQqF,KAAOR,EAAQM,UAAYN,EAAQO,MAAQtM,KAAK0M,aAGpDX,EAAQY,OACVzF,EAAQqF,MAAQ,IAAMR,EAAQY,OAE7BZ,EAAQM,UAAaN,EAAQO,OAChCP,EAAQM,SAAWnF,EAAQqF,MAAQrF,EAAQoF,MAE7CtM,KAAK4M,gBAAmC,eAAjB5M,KAAKkM,SAA+C,QAAnBH,EAAQU,OAGlEX,EAAczK,UAAU+K,UAAY,SAASE,GAC3C,IAAIO,GAASP,GAAQ,IAAIO,MAAM,mDAC3BZ,GAAaY,GAAS,IAAIzJ,MAAM,EAAG,GAQvC,GAHqB,OAAjB6I,EAAU,KACZA,EAAYA,EAAUa,WAEJ,MAAhBb,EAAU,GACZA,EAAU,GAAK,KACfA,EAAU,GAAK,iBAEf,IAAK,IAAI/J,EAAI,EAAGA,EAAI,EAAGA,IACrB,GAAI,OAAOU,KAAKqJ,EAAU/J,IAAK,CAC7B+J,EAAU,GAAKA,EAAU/J,GAAGkB,MAAM,GAClC6I,EAAU,GAAK,KACf,MAKN,OAAOA,GAITH,EAAczK,UAAU0L,eAAiB,WAEvC,MAAI,CAAC,KAAM,OAAO/E,QAAQhI,KAAKkM,UAAY,GAAqB,cAAhBlM,KAAKmM,QAE9C,CAAC,aAAc,KAAM,UAAW,MAAO,eAAgB,OAC3DnE,QAAQhI,KAAKkM,UAAY,GAG9BJ,EAAczK,UAAUqL,WAAa,WACnC,IAAIP,EAASnM,KAAK+M,iBAAmB,GAAK,IAAM/M,KAAKmM,OACjDa,EAA6B,QAAjBhN,KAAKkM,QAAoB,QAAUlM,KAAKkM,QACxD,OAAOc,EAAYb,EAAS,kBAG9BL,EAAczK,UAAU4L,eAAiB,WACvCjN,KAAKkN,YAEL,IAAuD3E,EAAnDwD,EAAU/L,KAAK+L,QAAS7E,EAAU6E,EAAQ7E,QAE1C6E,EAAQ/E,WAEVhH,KAAKmN,WAAW5E,MAAQA,EAAQvI,KAAKmN,WAAW5E,OAAS,GAErDvI,KAAKgM,YAAYoB,eACnB7E,EAAM,wBAA0BvI,KAAKgM,YAAYoB,cAE9B,OAAjBpN,KAAKkM,SAAqB3D,EAAM,mBAClCA,EAAM,iBAAmB,OAEvBA,EAAM,cACRvI,KAAKqN,SAAW9E,EAAM,cAEtBA,EAAM,cAAgBvI,KAAKsN,cAE7B/E,EAAM,mBAAqB,mBAC3BA,EAAM,oBAAsBvI,KAAKgM,YAAYuB,YAAc,IAAMvN,KAAKwN,mBACtEjF,EAAM,uBAAyBvI,KAAKyN,kBAI/B1B,EAAQ2B,oBAAuB1N,KAAK4M,mBACnCb,EAAQzL,MAAS4G,EAAQ,iBAAoBA,EAAQ,kBACvDA,EAAQ,gBAAkB,qDAExB6E,EAAQzL,MAAS4G,EAAQ,mBAAsBA,EAAQ,oBACzDA,EAAQ,kBAAoBtH,EAAOiK,WAAWkC,EAAQzL,QAEpDN,KAAKgM,YAAYoB,cAAiBlG,EAAQ,yBAA4BA,EAAQ,0BAChFA,EAAQ,wBAA0BlH,KAAKgM,YAAYoB,cAEhC,OAAjBpN,KAAKkM,SAAqBhF,EAAQ,yBAA4BA,EAAQ,0BACxEA,EAAQ,wBAA0BkE,EAAKpL,KAAK+L,QAAQzL,MAAQ,GAAI,QAE9D4G,EAAQ,eAAiBA,EAAQ,cACnClH,KAAKqN,SAAWnG,EAAQ,eAAiBA,EAAQ,cAEjDA,EAAQ,cAAgBlH,KAAKsN,sBAG1BpG,EAAQyG,qBACRzG,EAAQX,gBAInBuF,EAAczK,UAAUsD,KAAO,WAW7B,OAVK3E,KAAKmN,YAAYnN,KAAKiN,iBAEvBjN,KAAK+L,QAAQ/E,UACfhH,KAAKmN,WAAW5E,MAAM,mBAAqBvI,KAAK4N,YAEhD5N,KAAK+L,QAAQ7E,QAAQyG,cAAgB3N,KAAK6N,aAG5C7N,KAAK+L,QAAQ1D,KAAOrI,KAAK8N,aAElB9N,KAAK+L,SAGdD,EAAczK,UAAUiM,YAAc,WACpC,IAAKtN,KAAKqN,SAAU,CAClB,IAAInG,EAAUlH,KAAK+L,QAAQ7E,QACzBpD,EAAO,IAAIC,KAAKmD,EAAQnD,MAAQmD,EAAQpD,MAAQ,IAAIC,MAEtD/D,KAAKqN,SAAWvJ,EAAKiK,cAAcvC,QAAQ,iBAAkB,IAGzDxL,KAAK4M,kBAAiB5M,KAAKqN,SAAWrN,KAAKqN,SAASjK,MAAM,GAAI,IAEpE,OAAOpD,KAAKqN,UAGdvB,EAAczK,UAAU2M,QAAU,WAChC,OAAOhO,KAAKsN,cAAcW,OAAO,EAAG,IAGtCnC,EAAczK,UAAUwM,WAAa,WACnC,MAAO,CACL,+BAAiC7N,KAAKgM,YAAYuB,YAAc,IAAMvN,KAAKwN,mBAC3E,iBAAmBxN,KAAKyN,gBACxB,aAAezN,KAAK4N,aACpBnM,KAAK,OAGTqK,EAAczK,UAAUuM,UAAY,WAClC,IAEIM,EAAOC,EAASC,EAFhBtK,EAAO9D,KAAKgO,UACZK,EAAW,CAACrO,KAAKgM,YAAYsC,gBAAiBxK,EAAM9D,KAAKmM,OAAQnM,KAAKkM,SAASzK,OACrD8M,EAAevD,EAAiB7B,IAAIkF,GAQlE,OAPKE,IACHL,EAAQjD,EAAK,OAASjL,KAAKgM,YAAYsC,gBAAiBxK,GACxDqK,EAAUlD,EAAKiD,EAAOlO,KAAKmM,QAC3BiC,EAAWnD,EAAKkD,EAASnO,KAAKkM,SAC9BqC,EAAetD,EAAKmD,EAAU,gBAC9BpD,EAAiB1B,IAAI+E,EAAUE,IAE1BtD,EAAKsD,EAAcvO,KAAK+G,eAAgB,QAGjD+E,EAAczK,UAAU0F,aAAe,WACrC,MAAO,CACL,mBACA/G,KAAKsN,cACLtN,KAAKwN,mBACLpC,EAAKpL,KAAKwO,kBAAmB,QAC7B/M,KAAK,OAGTqK,EAAczK,UAAUmN,gBAAkB,WACnCxO,KAAKmN,YAAYnN,KAAKiN,iBAE3B,IAQIwB,EARAC,EAAU1O,KAAKmN,WAAW9E,KAC1BE,EAAQvI,KAAKmN,WAAW5E,MACxBrB,EAAUlH,KAAK+L,QAAQ7E,QACvByH,EAAW,GACXC,EAAiC,OAAjB5O,KAAKkM,QACrB2C,EAA8B,OAAjB7O,KAAKkM,SAAoBlM,KAAK+L,QAAQ+C,gBACnDC,EAAuC,OAAjB/O,KAAKkM,QAC3B8C,EAAgC,OAAjBhP,KAAKkM,QAYxB,GAREuC,EADmB,OAAjBzO,KAAKkM,SAAoBlM,KAAK+L,QAAQ/E,UAC7B,mBACFhH,KAAK4M,gBACH,GAEA1F,EAAQ,yBAA2BA,EAAQ,yBACpDkE,EAAKpL,KAAK+L,QAAQzL,MAAQ,GAAI,OAG9BiI,EAAO,CACT,IAAI0G,EAAe/P,OAAOC,KAAKoJ,GAAO2G,QAAO,SAAShK,EAAK7F,GACzD,OAAKA,GACL6F,EAAI0G,EAAkBvM,IAAS6D,MAAMC,QAAQoF,EAAMlJ,KAChD2P,EAAezG,EAAMlJ,GAAK,GAD8BkJ,EAAMlJ,GAE1D6F,GAHUA,IAIhB,IACCiK,EAAqB,GACzBjQ,OAAOC,KAAK8P,GAAc/G,OAAO9I,SAAQ,SAASC,GAC3C6D,MAAMC,QAAQ8L,EAAa5P,IAG9B4P,EAAa5P,GAAKL,IAAI4M,GAAmB1D,OACtC9I,SAAQ,SAAS0I,GAAOqH,EAAmBlH,KAAK5I,EAAM,IAAMyI,MAH/DqH,EAAmBlH,KAAK5I,EAAM,IAAMuM,EAAkBqD,EAAa5P,QAMvEsP,EAAWQ,EAAmB1N,KAAK,KAiBrC,MAfgB,MAAZiN,IACEE,IAAeF,EAAUA,EAAQlD,QAAQ,UAAW,MACxDkD,EAAUA,EAAQzL,MAAM,KAAKiM,QAAO,SAAS7G,EAAM+G,GAOjD,OANIR,GAA2B,OAAVQ,EACnB/G,EAAKoB,MACKmF,GAA2B,MAAVQ,IACvBP,IAAYO,EAAQC,mBAAmBD,EAAM5D,QAAQ,MAAO,OAChEnD,EAAKJ,KAAK2D,EAAkBwD,KAEvB/G,IACN,IAAI5G,KAAK,KACO,MAAfiN,EAAQ,KAAYA,EAAU,IAAMA,GACpCK,IAAqBL,EAAUA,EAAQlD,QAAQ,OAAQ,OAGtD,CACLxL,KAAK+L,QAAQU,QAAU,MACvBiC,EACAC,EACA3O,KAAKsP,mBAAqB,KAC1BtP,KAAKyN,gBACLgB,GACAhN,KAAK,OAGTqK,EAAczK,UAAUiO,iBAAmB,WACzC,IAAIpI,EAAUlH,KAAK+L,QAAQ7E,QAC3B,SAASqI,EAAQzN,GACf,OAAOA,EAAO4J,WAAW8D,OAAOhE,QAAQ,OAAQ,KAElD,OAAOtM,OAAOC,KAAK+H,GAChBuI,QAAO,SAASpQ,GAAO,OAA+C,MAAxCwM,EAAkBxM,EAAI0I,kBACpDG,MAAK,SAASwH,EAAGC,GAAK,OAAOD,EAAE3H,cAAgB4H,EAAE5H,eAAiB,EAAI,KACtE/I,KAAI,SAASK,GAAO,OAAOA,EAAI0I,cAAgB,IAAMwH,EAAQrI,EAAQ7H,OACrEoC,KAAK,OAGVqK,EAAczK,UAAUoM,cAAgB,WACtC,OAAOvO,OAAOC,KAAKa,KAAK+L,QAAQ7E,SAC7BlI,KAAI,SAASK,GAAO,OAAOA,EAAI0I,iBAC/B0H,QAAO,SAASpQ,GAAO,OAAiC,MAA1BwM,EAAkBxM,MAChD6I,OACAzG,KAAK,MAGVqK,EAAczK,UAAUmM,iBAAmB,WACzC,MAAO,CACLxN,KAAKgO,UACLhO,KAAKmM,OACLnM,KAAKkM,QACL,gBACAzK,KAAK,MAGTqK,EAAczK,UAAUmL,mBAAqB,WAC3C,IAAIoD,EAAM,0+BACV,MAAO,CACLrC,YAAaqC,EAAIC,mBAAqBD,EAAIE,eAC1CxB,gBAAiBsB,EAAIG,uBAAyBH,EAAII,eAClD5C,aAAcwC,EAAIK,oBAItBnE,EAAczK,UAAU6L,UAAY,WAClC,IAAI7E,EAAOrI,KAAK+L,QAAQ1D,MAAQ,IAK5B,qCAAqCzF,KAAKyF,KAC5CA,EAAO6H,UAAUC,UAAU9H,KAG7B,IAAI+H,EAAU/H,EAAKL,QAAQ,KACvBO,EAAQ,KAER6H,GAAW,IACb7H,EAAQuC,EAAYxE,MAAM+B,EAAKjF,MAAMgN,EAAU,IAC/C/H,EAAOA,EAAKjF,MAAM,EAAGgN,IAGvBpQ,KAAKmN,WAAa,CAChB9E,KAAMA,EACNE,MAAOA,IAIXuD,EAAczK,UAAUyM,WAAa,WACnC,IAAIzF,EAAOrI,KAAKmN,WAAW9E,KACvBE,EAAQvI,KAAKmN,WAAW5E,MAE5B,OAAKA,GAGY,MAAbA,EAAM,YAAoBA,EAAM,IAE7BF,EAAO,IAAMiD,EAAcR,EAAYxH,UAAUiF,KALrCF,GAQrBgI,EAAKvE,cAAgBA,EAErBuE,EAAK1L,KAAO,SAASoH,EAASC,GAC5B,OAAO,IAAIF,EAAcC,EAASC,GAAarH,U,iECjXjD,MAAM2L,EAAOxR,EAEbwR,EAAKC,OAAS,EAAQ,SAEtBD,EAAKE,OAAS,EAAQ,QAAcA,OACpCF,EAAKrK,KAAO,EAAQ,QACpBqK,EAAKzR,UAAY,EAAQ,QACzByR,EAAK9Q,SAAW,EAAQ,QACxB8Q,EAAK5Q,SAAW,EAAQ,S,kCCRxB,MAAMwG,EAAW,EAAQ,QAAoBA,SACvCE,EAAgB,EAAQ,QAAkBA,cAC1CD,EAAgB,EAAQ,QAAkBA,cAC1CsK,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,SAAShR,EAAKI,EAAKM,EAAQL,GACzB,MAAMoF,EAAQ,GACdtF,KAAKuF,WAAaD,EAElBA,EAAMpF,KAAOA,EACboF,EAAMrF,IAAMA,EAEZqF,EAAM/E,OAASA,GAAU,KACzB+E,EAAMwL,SAAW,KAGjBxL,EAAM1E,IAAM,KACZ0E,EAAMyL,KAAO,KACbzL,EAAM0L,YAAc,KACpB1L,EAAM2L,OAAS,KACf3L,EAAM4L,UAAW,EACjB5L,EAAM6L,KAAM,EACZ7L,EAAMJ,KAAM,EACZI,EAAM8L,IAAM,KACZ9L,EAAM+L,WAAa,KACnB/L,EAAMjG,IAAM,KACZiG,EAAM,WAAa,KACnBA,EAAMgM,SAAW,KACjBhM,EAAMiM,SAAW,KACjBjM,EAAMkM,SAAW,KAGZlM,EAAM/E,SACT+E,EAAMwL,SAAW,GACjB9Q,KAAKyR,SAGTrQ,EAAOtC,QAAUe,EAEjB,MAAM6R,EAAa,CACjB,MAAO,SAAU,WAAY,MAAO,OAAQ,cAAe,SAC3D,WAAY,MAAO,MAAO,MAAO,aAAc,MAAO,UAAW,WACjE,WAAY,YAGd7R,EAAKwB,UAAUsQ,MAAQ,WACrB,MAAMrM,EAAQtF,KAAKuF,WACbqM,EAAS,GACfF,EAAWtS,SAAQ,SAASyS,GAC1BD,EAAOC,GAAQvM,EAAMuM,MAEvB,MAAM5S,EAAM,IAAIe,KAAKgK,YAAY4H,EAAOrR,QAExC,OADAtB,EAAIsG,WAAaqM,EACV3S,GAGTY,EAAKwB,UAAUoQ,MAAQ,WACrB,MAAMnM,EAAQtF,KAAKuF,WACnBoL,EAAQvR,SAAQ,SAASqN,GACvBzM,KAAKyM,GAAU,WACb,MAAMkF,EAAQ,IAAI3R,KAAKgK,YAAYhK,MAEnC,OADAsF,EAAMwL,SAAS7I,KAAK0J,GACbA,EAAMlF,GAAQqF,MAAMH,EAAOI,cAEnC/R,OAGLH,EAAKwB,UAAUhB,MAAQ,SAAcC,GACnC,MAAMgF,EAAQtF,KAAKuF,WAEnBkL,EAAwB,OAAjBnL,EAAM/E,QACbD,EAAKE,KAAKR,MAGVsF,EAAMwL,SAAWxL,EAAMwL,SAASrB,QAAO,SAASuC,GAC9C,OAAOA,EAAMzM,WAAWhF,SAAWP,OAClCA,MACHyQ,EAAOwB,MAAM3M,EAAMwL,SAASjP,OAAQ,EAAG,sCAGzChC,EAAKwB,UAAU6Q,SAAW,SAAiBnB,GACzC,MAAMzL,EAAQtF,KAAKuF,WAGbuL,EAAWC,EAAKtB,QAAO,SAAS0C,GACpC,OAAOA,aAAenS,KAAKgK,cAC1BhK,MACH+Q,EAAOA,EAAKtB,QAAO,SAAS0C,GAC1B,QAASA,aAAenS,KAAKgK,eAC5BhK,MAEqB,IAApB8Q,EAASjP,SACX4O,EAA0B,OAAnBnL,EAAMwL,UACbxL,EAAMwL,SAAWA,EAGjBA,EAAS1R,SAAQ,SAAS4S,GACxBA,EAAMzM,WAAWhF,OAASP,OACzBA,OAEe,IAAhB+Q,EAAKlP,SACP4O,EAAsB,OAAfnL,EAAMyL,MACbzL,EAAMyL,KAAOA,EACbzL,EAAM0L,YAAcD,EAAK/R,KAAI,SAASmT,GACpC,GAAmB,kBAARA,GAAoBA,EAAInI,cAAgB9K,OACjD,OAAOiT,EAET,MAAMlT,EAAM,GAOZ,OANAC,OAAOC,KAAKgT,GAAK/S,SAAQ,SAASC,GAC5BA,IAAc,EAANA,KACVA,GAAO,GACT,MAAMC,EAAQ6S,EAAI9S,GAClBJ,EAAIK,GAASD,KAERJ,OASb4R,EAAUzR,SAAQ,SAASqN,GACzB5M,EAAKwB,UAAUoL,GAAU,WACvB,MAAMnH,EAAQtF,KAAKuF,WACnB,MAAM,IAAI6M,MAAM3F,EAAS,kCAAoCnH,EAAMrF,SAQvEyQ,EAAKtR,SAAQ,SAASwB,GACpBf,EAAKwB,UAAUT,GAAO,WACpB,MAAM0E,EAAQtF,KAAKuF,WACbwL,EAAO7N,MAAM7B,UAAU+B,MAAM5C,KAAKuR,WAOxC,OALAtB,EAAqB,OAAdnL,EAAM1E,KACb0E,EAAM1E,IAAMA,EAEZZ,KAAKkS,SAASnB,GAEP/Q,SAIXH,EAAKwB,UAAU+P,IAAM,SAAazH,GAChC8G,EAAO9G,GACP,MAAMrE,EAAQtF,KAAKuF,WAKnB,OAHAkL,EAAqB,OAAdnL,EAAM8L,KACb9L,EAAM8L,IAAMzH,EAEL3J,MAGTH,EAAKwB,UAAU6P,SAAW,WACxB,MAAM5L,EAAQtF,KAAKuF,WAInB,OAFAD,EAAM4L,UAAW,EAEVlR,MAGTH,EAAKwB,UAAUgR,IAAM,SAAavK,GAChC,MAAMxC,EAAQtF,KAAKuF,WAMnB,OAJAkL,EAA4B,OAArBnL,EAAM,YACbA,EAAM,WAAawC,EACnBxC,EAAM4L,UAAW,EAEVlR,MAGTH,EAAKwB,UAAUiQ,SAAW,SAAkB5Q,GAC1C,MAAM4E,EAAQtF,KAAKuF,WAKnB,OAHAkL,EAA0B,OAAnBnL,EAAMgM,UAAwC,OAAnBhM,EAAMiM,UACxCjM,EAAMgM,SAAW5Q,EAEVV,MAGTH,EAAKwB,UAAUkQ,SAAW,SAAkB7Q,GAC1C,MAAM4E,EAAQtF,KAAKuF,WAKnB,OAHAkL,EAA0B,OAAnBnL,EAAMgM,UAAwC,OAAnBhM,EAAMiM,UACxCjM,EAAMiM,SAAW7Q,EAEVV,MAGTH,EAAKwB,UAAU6D,IAAM,WACnB,MAAMI,EAAQtF,KAAKuF,WACbwL,EAAO7N,MAAM7B,UAAU+B,MAAM5C,KAAKuR,WAOxC,OALAzM,EAAMJ,KAAM,EAEQ,IAAhB6L,EAAKlP,QACP7B,KAAKkS,SAASnB,GAET/Q,MAGTH,EAAKwB,UAAUhC,IAAM,SAAaiT,GAChC,MAAMhN,EAAQtF,KAAKuF,WAKnB,OAHAkL,EAAqB,OAAdnL,EAAMjG,KACbiG,EAAMjG,IAAMiT,EAELtS,MAGTH,EAAKwB,UAAU8P,IAAM,WACnB,MAAM7L,EAAQtF,KAAKuF,WAInB,OAFAD,EAAM6L,KAAM,EAELnR,MAGTH,EAAKwB,UAAU4P,OAAS,SAAgB/L,GACtC,MAAMI,EAAQtF,KAAKuF,WAQnB,OANAkL,EAAwB,OAAjBnL,EAAM2L,QACb3L,EAAM2L,OAAS/L,EACflF,KAAKkS,SAAShT,OAAOC,KAAK+F,GAAKlG,KAAI,SAASK,GAC1C,OAAO6F,EAAI7F,OAGNW,MAGTH,EAAKwB,UAAUmQ,SAAW,SAAkB7H,GAC1C,MAAMrE,EAAQtF,KAAKuF,WAKnB,OAHAkL,EAAqB,OAAdnL,EAAM8L,KACb9L,EAAMkM,SAAW7H,EAEV3J,MAOTH,EAAKwB,UAAUkR,QAAU,SAAgBC,EAAOhM,GAC9C,MAAMlB,EAAQtF,KAAKuF,WAGnB,GAAqB,OAAjBD,EAAM/E,OACR,OAAOiS,EAAMC,WAAWnN,EAAMwL,SAAS,GAAGyB,QAAQC,EAAOhM,IAE3D,IAuCIkM,EAvCAC,EAASrN,EAAM,WACfsN,GAAU,EAEVC,EAAU,KAKd,GAJkB,OAAdvN,EAAMjG,MACRwT,EAAUL,EAAMM,SAASxN,EAAMjG,MAG7BiG,EAAM4L,SAAU,CAClB,IAAItQ,EAAM,KAQV,GAPuB,OAAnB0E,EAAMgM,SACR1Q,EAAM0E,EAAMgM,SACc,OAAnBhM,EAAMiM,SACb3Q,EAAM0E,EAAMiM,SACS,OAAdjM,EAAM1E,MACbA,EAAM0E,EAAM1E,KAEF,OAARA,GAAiB0E,EAAM6L,KAgBzB,GAFAyB,EAAU5S,KAAK+S,SAASP,EAAO5R,EAAK0E,EAAM6L,KAEtCqB,EAAMQ,QAAQJ,GAChB,OAAOA,MAjBqB,CAE9B,MAAM3I,EAAOuI,EAAMvI,OACnB,IACuB,OAAjB3E,EAAM2L,OACRjR,KAAKiT,eAAe3N,EAAM1E,IAAK4R,EAAOhM,GAEtCxG,KAAKkT,cAAcV,EAAOhM,GAC5BoM,GAAU,EACV,MAAO5M,GACP4M,GAAU,EAEZJ,EAAMtI,QAAQD,IAclB,GAHI3E,EAAMJ,KAAO0N,IACfF,EAAUF,EAAMW,eAEdP,EAAS,CAEX,GAAuB,OAAnBtN,EAAMgM,SAAmB,CAC3B,MAAMA,EAAWtR,KAAKoT,WAAWZ,EAAOlN,EAAMgM,UAC9C,GAAIkB,EAAMQ,QAAQ1B,GAChB,OAAOA,EACTkB,EAAQlB,EAGV,MAAM+B,EAAQb,EAAM7O,OAGpB,GAAkB,OAAd2B,EAAM8L,KAAiC,OAAjB9L,EAAM2L,OAAiB,CAC/C,IAAIhH,EACA3E,EAAM6L,MACRlH,EAAOuI,EAAMvI,QACf,MAAM3J,EAAON,KAAKoT,WAChBZ,EACmB,OAAnBlN,EAAMiM,SAAoBjM,EAAMiM,SAAWjM,EAAM1E,IACjD0E,EAAM6L,KAER,GAAIqB,EAAMQ,QAAQ1S,GAChB,OAAOA,EAELgF,EAAM6L,IACRwB,EAASH,EAAMlI,IAAIL,GAEnBuI,EAAQlS,EAkBZ,GAfIkG,GAAWA,EAAQ8M,OAAuB,OAAdhO,EAAM1E,KACpC4F,EAAQ8M,MAAMd,EAAMnK,OAAQgL,EAAOb,EAAM3Q,OAAQ,UAE/C2E,GAAWA,EAAQ8M,OAAuB,OAAdhO,EAAM1E,KACpC4F,EAAQ8M,MAAMd,EAAMnK,OAAQmK,EAAM7O,OAAQ6O,EAAM3Q,OAAQ,WAGtDyD,EAAM6L,MAGRwB,EAD0B,OAAjBrN,EAAM2L,OACNjR,KAAKiT,eAAe3N,EAAM1E,IAAK4R,EAAOhM,GAEtCxG,KAAKkT,cAAcV,EAAOhM,IAGjCgM,EAAMQ,QAAQL,GAChB,OAAOA,EAYT,GATKrN,EAAM6L,KAAwB,OAAjB7L,EAAM2L,QAAsC,OAAnB3L,EAAMwL,UAC/CxL,EAAMwL,SAAS1R,SAAQ,SAAwB4S,GAG7CA,EAAMO,QAAQC,EAAOhM,MAKrBlB,EAAMkM,WAA2B,WAAdlM,EAAM1E,KAAkC,WAAd0E,EAAM1E,KAAmB,CACxE,MAAMW,EAAO,IAAI4E,EAAcwM,GAC/BA,EAAS3S,KAAKuT,QAAQjO,EAAMkM,SAAUgB,EAAM/H,eAAevF,KACxDqN,QAAQhR,EAAMiF,IAcrB,OATIlB,EAAMJ,KAAO0N,IACfD,EAASH,EAAMgB,YAAYd,IAGX,OAAdpN,EAAMjG,KAA4B,OAAXsT,IAA+B,IAAZC,EAEzB,OAAZC,GACPL,EAAMiB,QAAQZ,GAFdL,EAAMkB,SAASb,EAASvN,EAAMjG,IAAKsT,GAI9BA,GAGT9S,EAAKwB,UAAU4R,eAAiB,SAAuBrS,EAAK4R,EAAOhM,GACjE,MAAMlB,EAAQtF,KAAKuF,WAEnB,MAAY,QAAR3E,GAAyB,QAARA,EACZ,KACG,UAARA,GAA2B,UAARA,EACdZ,KAAK2T,YAAYnB,EAAO5R,EAAK0E,EAAMyL,KAAK,GAAIvK,GAC5C,OAAO5D,KAAKhC,GACZZ,KAAK4T,WAAWpB,EAAO5R,EAAK4F,GACpB,UAAR5F,GAAmB0E,EAAMyL,KACzB/Q,KAAK6T,aAAarB,EAAOlN,EAAMyL,KAAK,GAAIzL,EAAMyL,KAAK,GAAIvK,GAC/C,UAAR5F,EACAZ,KAAK6T,aAAarB,EAAO,KAAM,KAAMhM,GAC7B,YAAR5F,GAA6B,YAARA,EACrBZ,KAAK8T,YAAYtB,EAAO5R,EAAK4F,GACrB,UAAR5F,EACAZ,KAAK+T,YAAYvB,EAAOhM,GAChB,SAAR5F,EACAZ,KAAKgU,YAAYxB,EAAOhM,GAChB,YAAR5F,EACAZ,KAAK4T,WAAWpB,EAAO5R,EAAK4F,GACpB,QAAR5F,GAAyB,SAARA,EACjBZ,KAAKiU,WAAWzB,EAAOlN,EAAMyL,MAAQzL,EAAMyL,KAAK,GAAIvK,GAE3C,OAAdlB,EAAM8L,IACDpR,KAAKuT,QAAQjO,EAAM8L,IAAKoB,EAAM/H,eAAevF,KACjDqN,QAAQC,EAAOhM,GAEXgM,EAAMtR,MAAM,gBAAkBN,IAIzCf,EAAKwB,UAAUkS,QAAU,SAAiBxT,EAAQmF,GAEhD,MAAMI,EAAQtF,KAAKuF,WASnB,OAPAD,EAAM+L,WAAarR,KAAKiF,KAAKlF,EAAQmF,GACrCuL,EAA8C,OAAvCnL,EAAM+L,WAAW9L,WAAWhF,QACnC+E,EAAM+L,WAAa/L,EAAM+L,WAAW9L,WAAWuL,SAAS,GACpDxL,EAAMiM,WAAajM,EAAM+L,WAAW9L,WAAWgM,WACjDjM,EAAM+L,WAAa/L,EAAM+L,WAAWM,QACpCrM,EAAM+L,WAAW9L,WAAWgM,SAAWjM,EAAMiM,UAExCjM,EAAM+L,YAGfxR,EAAKwB,UAAU6R,cAAgB,SAAsBV,EAAOhM,GAC1D,MAAMlB,EAAQtF,KAAKuF,WACnB,IAAIoN,EAAS,KACT9F,GAAQ,EAmBZ,OAjBA3N,OAAOC,KAAKmG,EAAM2L,QAAQiD,MAAK,SAAS7U,GACtC,MAAM4K,EAAOuI,EAAMvI,OACbb,EAAO9D,EAAM2L,OAAO5R,GAC1B,IACE,MAAMC,EAAQ8J,EAAKmJ,QAAQC,EAAOhM,GAClC,GAAIgM,EAAMQ,QAAQ1T,GAChB,OAAO,EAETqT,EAAS,CAAEwB,KAAM9U,EAAKC,MAAOA,GAC7BuN,GAAQ,EACR,MAAO7G,GAEP,OADAwM,EAAMtI,QAAQD,IACP,EAET,OAAO,IACNjK,MAEE6M,EAGE8F,EAFEH,EAAMtR,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,MAAMoR,EAAS3S,KAAK0F,aAAanE,EAAMR,EAAUR,GACjD,YAAeiF,IAAXmN,GAGA3S,KAAKoF,aAAauN,EAAQ5R,EAAUR,QAHxC,EAMOoS,GAGT9S,EAAKwB,UAAUqE,aAAe,SAAgBnE,EAAMR,EAAUR,GAC5D,MAAM+E,EAAQtF,KAAKuF,WAGnB,GAAqB,OAAjBD,EAAM/E,OACR,OAAO+E,EAAMwL,SAAS,GAAGtP,QAAQD,EAAMR,GAAY,IAAImF,GAEzD,IAAIyM,EAAS,KAMb,GAHA3S,KAAKe,SAAWA,EAGZuE,EAAM4L,eAAqB1L,IAATjE,EAAoB,CACxC,GAAyB,OAArB+D,EAAM,WAGR,OAFA/D,EAAO+D,EAAM,WAMjB,IAAI3D,EAAU,KACVd,GAAY,EAChB,GAAIyE,EAAM6L,IAERwB,EAAS3S,KAAKgC,qBAAqBT,QAC9B,GAAI+D,EAAM2L,OACf0B,EAAS3S,KAAKoU,cAAc7S,EAAMR,QAC7B,GAAIuE,EAAMkM,SACf7P,EAAU3B,KAAKuT,QAAQjO,EAAMkM,SAAUjR,GAAQiB,QAAQD,EAAMR,GAC7DF,GAAY,OACP,GAAIyE,EAAMwL,SACfnP,EAAU2D,EAAMwL,SAAS9R,KAAI,SAASgT,GACpC,GAA6B,UAAzBA,EAAMzM,WAAW3E,IACnB,OAAOoR,EAAMxQ,QAAQ,KAAMT,EAAUQ,GAEvC,GAA6B,OAAzByQ,EAAMzM,WAAWlG,IACnB,OAAO0B,EAASG,MAAM,2BACxB,MAAM2R,EAAU9R,EAAS+R,SAASd,EAAMzM,WAAWlG,KAEnD,GAAoB,kBAATkC,EACT,OAAOR,EAASG,MAAM,2CAExB,MAAMjC,EAAM+S,EAAMxQ,QAAQD,EAAKyQ,EAAMzM,WAAWlG,KAAM0B,EAAUQ,GAGhE,OAFAR,EAAS2S,SAASb,GAEX5T,IACNe,MAAMyP,QAAO,SAASuC,GACvB,OAAOA,KAETrQ,EAAU3B,KAAKgC,qBAAqBL,QAEpC,GAAkB,UAAd2D,EAAM1E,KAAiC,UAAd0E,EAAM1E,IAAiB,CAElD,IAAM0E,EAAMyL,MAA8B,IAAtBzL,EAAMyL,KAAKlP,OAC7B,OAAOd,EAASG,MAAM,uBAAyBoE,EAAM1E,KAEvD,IAAKsC,MAAMC,QAAQ5B,GACjB,OAAOR,EAASG,MAAM,sCAExB,MAAM8Q,EAAQhS,KAAK2R,QACnBK,EAAMzM,WAAWgM,SAAW,KAC5B5P,EAAU3B,KAAKgC,qBAAqBT,EAAKvC,KAAI,SAAS2K,GACpD,MAAMrE,EAAQtF,KAAKuF,WAEnB,OAAOvF,KAAKuT,QAAQjO,EAAMyL,KAAK,GAAIxP,GAAMC,QAAQmI,EAAM5I,KACtDiR,SACoB,OAAd1M,EAAM8L,IACfuB,EAAS3S,KAAKuT,QAAQjO,EAAM8L,IAAK7Q,GAAQiB,QAAQD,EAAMR,IAEvDY,EAAU3B,KAAKqU,iBAAiB/O,EAAM1E,IAAKW,GAC3CV,GAAY,GAKhB,IAAKyE,EAAM6L,KAAwB,OAAjB7L,EAAM2L,OAAiB,CACvC,MAAMrQ,EAAyB,OAAnB0E,EAAMiM,SAAoBjM,EAAMiM,SAAWjM,EAAM1E,IACvDE,EAAyB,OAAnBwE,EAAMiM,SAAoB,YAAc,UAExC,OAAR3Q,EACgB,OAAd0E,EAAM8L,KACRrQ,EAASG,MAAM,wCAEC,OAAdoE,EAAM8L,MACRuB,EAAS3S,KAAK0B,iBAAiBd,EAAKC,EAAWC,EAAKa,IAQ1D,OAHuB,OAAnB2D,EAAMgM,WACRqB,EAAS3S,KAAK0B,iBAAiB4D,EAAMgM,UAAU,EAAO,UAAWqB,IAE5DA,GAGT9S,EAAKwB,UAAU+S,cAAgB,SAAsB7S,EAAMR,GACzD,MAAMuE,EAAQtF,KAAKuF,WAEb6D,EAAO9D,EAAM2L,OAAO1P,EAAK4S,MAO/B,OANK/K,GACHqH,GACE,EACAlP,EAAK4S,KAAO,iBACN9Q,KAAKC,UAAUpE,OAAOC,KAAKmG,EAAM2L,UAEpC7H,EAAK5H,QAAQD,EAAKjC,MAAOyB,IAGlClB,EAAKwB,UAAUgT,iBAAmB,SAAyBzT,EAAKW,GAC9D,MAAM+D,EAAQtF,KAAKuF,WAEnB,GAAI,OAAO3C,KAAKhC,GACd,OAAOZ,KAAKoC,WAAWb,EAAMX,GAC1B,GAAY,UAARA,GAAmB0E,EAAMyL,KAChC,OAAO/Q,KAAK6C,aAAatB,EAAM+D,EAAM0L,YAAY,GAAI1L,EAAMyL,KAAK,IAC7D,GAAY,UAARnQ,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,EAAMyL,MAAQzL,EAAM0L,YAAY,IAC1D,GAAY,SAARpQ,EACP,OAAOZ,KAAKgF,YAAYzD,GACrB,GAAY,YAARX,EACP,OAAOZ,KAAKoC,WAAWb,EAAMX,GAE7B,MAAM,IAAIwR,MAAM,oBAAsBxR,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,SAASwU,EAAWvU,GAClBD,EAAWU,KAAKR,KAAMD,GACtBC,KAAKC,IAAM,MAEbN,EAAS2U,EAAYxU,GACrBsB,EAAOtC,QAAUwV,EAEjBA,EAAWjT,UAAUC,OAAS,SAAgBC,EAAMiF,GAClD,MAAMjE,EAAMzC,EAAWuB,UAAUC,OAAOd,KAAKR,KAAMuB,GAE7CgT,EAAIhS,EAAImJ,SAAS,UACjB5G,EAAM,CAAE,cAAgB0B,EAAQgO,MAAQ,SAC9C,IAAK,IAAItS,EAAI,EAAGA,EAAIqS,EAAE1S,OAAQK,GAAK,GACjC4C,EAAImD,KAAKsM,EAAEnR,MAAMlB,EAAGA,EAAI,KAE1B,OADA4C,EAAImD,KAAK,YAAczB,EAAQgO,MAAQ,SAChC1P,EAAIrD,KAAK,Q,oCClBlB,SAASqL,EAAQ9N,GACf,MAAMC,EAAM,GAWZ,OATAC,OAAOC,KAAKH,GAAKI,SAAQ,SAASC,IAErB,EAANA,IAAYA,IACfA,GAAY,GAEd,MAAMC,EAAQN,EAAIK,GAClBJ,EAAIK,GAASD,KAGRJ,EAGTH,EAAQ2V,SAAW,CACjBC,EAAG,YACHC,EAAG,cACHC,EAAG,UACHC,EAAG,WAEL/V,EAAQqC,eAAiB2L,EAAQhO,EAAQ2V,UAEzC3V,EAAQ8B,IAAM,CACZ8T,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,UAER5V,EAAQkC,UAAY8L,EAAQhO,EAAQ8B,M,qBCtDpCQ,EAAOtC,QAAU,CACfgW,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,MAAMjX,EAAW,EAAQ,QACnBC,EAAS,EAAQ,QAAgBA,OAEjCiX,EAAa,EAAQ,QAE3B,SAASC,EAAW/W,GAClB8W,EAAWrW,KAAKR,KAAMD,GACtBC,KAAKC,IAAM,MAEbN,EAASmX,EAAYD,GACrBzV,EAAOtC,QAAUgY,EAEjBA,EAAWzV,UAAU0V,OAAS,SAAgBxV,EAAMiF,GAClD,MAAMwQ,EAAQzV,EAAKmK,WAAWzI,MAAM,YAE9BuR,EAAQhO,EAAQgO,MAAM7I,cAEtBsL,EAAK,kCACX,IAAI5D,GAAS,EACT6D,GAAO,EACX,IAAK,IAAIhV,EAAI,EAAGA,EAAI8U,EAAMnV,OAAQK,IAAK,CACrC,MAAM2K,EAAQmK,EAAM9U,GAAG2K,MAAMoK,GAC7B,GAAc,OAAVpK,GAGAA,EAAM,KAAO2H,EAAjB,CAGA,IAAe,IAAXnB,EAIG,CACL,GAAiB,QAAbxG,EAAM,GACR,MACFqK,EAAMhV,EACN,MAPA,GAAiB,UAAb2K,EAAM,GACR,MACFwG,EAAQnR,GAQZ,IAAe,IAAXmR,IAAyB,IAAT6D,EAClB,MAAM,IAAI9E,MAAM,8BAAgCoC,GAElD,MAAM2C,EAASH,EAAM5T,MAAMiQ,EAAQ,EAAG6D,GAAKzV,KAAK,IAEhD0V,EAAO3L,QAAQ,kBAAmB,IAElC,MAAMgH,EAAQ5S,EAAOiF,KAAKsS,EAAQ,UAClC,OAAON,EAAWxV,UAAU0V,OAAOvW,KAAKR,KAAMwS,EAAOhM,K,qBC9CvDpF,EAAOtC,QAAU,CAEfsY,oBAAqB,SAAUC,GAC7B,IAAIrR,EAAI,IAAIoM,MAGZ,OAFApM,EAAE9F,KAAO,mBACT8F,EAAEa,QAAUwQ,GAAO,GACZrR,K,uBCTX,2BACE,aAGA,SAASyK,EAAQ3I,EAAKuP,GACpB,IAAKvP,EAAK,MAAM,IAAIsK,MAAMiF,GAAO,oBAKnC,SAAS1X,EAAU2X,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAASpW,UAAYkW,EAAUlW,UAC/BiW,EAAKjW,UAAY,IAAIoW,EACrBH,EAAKjW,UAAU2I,YAAcsN,EAK/B,SAASI,EAAIC,EAAQ1R,EAAM2R,GACzB,GAAIF,EAAGG,KAAKF,GACV,OAAOA,EAGT3X,KAAK8X,SAAW,EAChB9X,KAAK+X,MAAQ,KACb/X,KAAK6B,OAAS,EAGd7B,KAAKgY,IAAM,KAEI,OAAXL,IACW,OAAT1R,GAA0B,OAATA,IACnB2R,EAAS3R,EACTA,EAAO,IAGTjG,KAAKK,MAAMsX,GAAU,EAAG1R,GAAQ,GAAI2R,GAAU,OAYlD,IAAIhY,EATkB,kBAAXwB,EACTA,EAAOtC,QAAU4Y,EAEjB5Y,EAAQ4Y,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGO,SAAW,GAGd,IAEIrY,EADoB,qBAAXsY,QAAmD,qBAAlBA,OAAOtY,OACxCsY,OAAOtY,OAEP,EAAQ,IAAUA,OAE7B,MAAOoG,IAgIT,SAASmS,EAAejN,EAAQkN,GAC9B,IAAI3M,EAAIP,EAAOzI,WAAW2V,GAE1B,OAAI3M,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,GAGHA,EAAI,GAAM,GAItB,SAAS4M,EAAcnN,EAAQoN,EAAYF,GACzC,IAAIhR,EAAI+Q,EAAcjN,EAAQkN,GAI9B,OAHIA,EAAQ,GAAKE,IACflR,GAAK+Q,EAAcjN,EAAQkN,EAAQ,IAAM,GAEpChR,EA8CT,SAASmR,EAAWlW,EAAKgR,EAAO6D,EAAKsB,GAGnC,IAFA,IAAIpR,EAAI,EACJQ,EAAM6Q,KAAKC,IAAIrW,EAAIR,OAAQqV,GACtBhV,EAAImR,EAAOnR,EAAI0F,EAAK1F,IAAK,CAChC,IAAIuJ,EAAIpJ,EAAII,WAAWP,GAAK,GAE5BkF,GAAKoR,EAIHpR,GADEqE,GAAK,GACFA,EAAI,GAAK,GAGLA,GAAK,GACTA,EAAI,GAAK,GAITA,EAGT,OAAOrE,EAnNTsQ,EAAGG,KAAO,SAAenX,GACvB,OAAIA,aAAegX,GAIJ,OAARhX,GAA+B,kBAARA,GAC5BA,EAAIsJ,YAAYiO,WAAaP,EAAGO,UAAY/U,MAAMC,QAAQzC,EAAIqX,QAGlEL,EAAGiB,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTnB,EAAGgB,IAAM,SAAcE,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTnB,EAAGrW,UAAUhB,MAAQ,SAAesX,EAAQ1R,EAAM2R,GAChD,GAAsB,kBAAXD,EACT,OAAO3X,KAAK+Y,YAAYpB,EAAQ1R,EAAM2R,GAGxC,GAAsB,kBAAXD,EACT,OAAO3X,KAAKgZ,WAAWrB,EAAQ1R,EAAM2R,GAG1B,QAAT3R,IACFA,EAAO,IAETwK,EAAOxK,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAEnD0R,EAASA,EAAOjM,WAAWF,QAAQ,OAAQ,IAC3C,IAAI6H,EAAQ,EACM,MAAdsE,EAAO,KACTtE,IACArT,KAAK8X,SAAW,GAGdzE,EAAQsE,EAAO9V,SACJ,KAAToE,EACFjG,KAAKiZ,UAAUtB,EAAQtE,EAAOuE,IAE9B5X,KAAKkZ,WAAWvB,EAAQ1R,EAAMoN,GACf,OAAXuE,GACF5X,KAAKgZ,WAAWhZ,KAAK0E,UAAWuB,EAAM2R,MAM9CF,EAAGrW,UAAU0X,YAAc,SAAsBpB,EAAQ1R,EAAM2R,GACzDD,EAAS,IACX3X,KAAK8X,SAAW,EAChBH,GAAUA,GAERA,EAAS,UACX3X,KAAK+X,MAAQ,CAAW,SAATJ,GACf3X,KAAK6B,OAAS,GACL8V,EAAS,kBAClB3X,KAAK+X,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,UAEzB3X,KAAK6B,OAAS,IAEd4O,EAAOkH,EAAS,kBAChB3X,KAAK+X,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,SACvB,GAEF3X,KAAK6B,OAAS,GAGD,OAAX+V,GAGJ5X,KAAKgZ,WAAWhZ,KAAK0E,UAAWuB,EAAM2R,IAGxCF,EAAGrW,UAAU2X,WAAa,SAAqBrB,EAAQ1R,EAAM2R,GAG3D,GADAnH,EAAgC,kBAAlBkH,EAAO9V,QACjB8V,EAAO9V,QAAU,EAGnB,OAFA7B,KAAK+X,MAAQ,CAAE,GACf/X,KAAK6B,OAAS,EACP7B,KAGTA,KAAK6B,OAAS4W,KAAKU,KAAKxB,EAAO9V,OAAS,GACxC7B,KAAK+X,MAAQ,IAAI7U,MAAMlD,KAAK6B,QAC5B,IAAK,IAAIK,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAC/BlC,KAAK+X,MAAM7V,GAAK,EAGlB,IAAIC,EAAGiX,EACHC,EAAM,EACV,GAAe,OAAXzB,EACF,IAAK1V,EAAIyV,EAAO9V,OAAS,EAAGM,EAAI,EAAGD,GAAK,EAAGA,GAAK,EAC9CkX,EAAIzB,EAAOzV,GAAMyV,EAAOzV,EAAI,IAAM,EAAMyV,EAAOzV,EAAI,IAAM,GACzDlC,KAAK+X,MAAM5V,IAAOiX,GAAKC,EAAO,SAC9BrZ,KAAK+X,MAAM5V,EAAI,GAAMiX,IAAO,GAAKC,EAAQ,SACzCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPlX,UAGC,GAAe,OAAXyV,EACT,IAAK1V,EAAI,EAAGC,EAAI,EAAGD,EAAIyV,EAAO9V,OAAQK,GAAK,EACzCkX,EAAIzB,EAAOzV,GAAMyV,EAAOzV,EAAI,IAAM,EAAMyV,EAAOzV,EAAI,IAAM,GACzDlC,KAAK+X,MAAM5V,IAAOiX,GAAKC,EAAO,SAC9BrZ,KAAK+X,MAAM5V,EAAI,GAAMiX,IAAO,GAAKC,EAAQ,SACzCA,GAAO,GACHA,GAAO,KACTA,GAAO,GACPlX,KAIN,OAAOnC,KAAKsZ,SAyBd5B,EAAGrW,UAAU4X,UAAY,SAAoBtB,EAAQtE,EAAOuE,GAE1D5X,KAAK6B,OAAS4W,KAAKU,MAAMxB,EAAO9V,OAASwR,GAAS,GAClDrT,KAAK+X,MAAQ,IAAI7U,MAAMlD,KAAK6B,QAC5B,IAAK,IAAIK,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAC/BlC,KAAK+X,MAAM7V,GAAK,EAIlB,IAGIkX,EAHAC,EAAM,EACNlX,EAAI,EAGR,GAAe,OAAXyV,EACF,IAAK1V,EAAIyV,EAAO9V,OAAS,EAAGK,GAAKmR,EAAOnR,GAAK,EAC3CkX,EAAIf,EAAaV,EAAQtE,EAAOnR,IAAMmX,EACtCrZ,KAAK+X,MAAM5V,IAAU,SAAJiX,EACbC,GAAO,IACTA,GAAO,GACPlX,GAAK,EACLnC,KAAK+X,MAAM5V,IAAMiX,IAAM,IAEvBC,GAAO,MAGN,CACL,IAAIE,EAAc5B,EAAO9V,OAASwR,EAClC,IAAKnR,EAAIqX,EAAc,IAAM,EAAIlG,EAAQ,EAAIA,EAAOnR,EAAIyV,EAAO9V,OAAQK,GAAK,EAC1EkX,EAAIf,EAAaV,EAAQtE,EAAOnR,IAAMmX,EACtCrZ,KAAK+X,MAAM5V,IAAU,SAAJiX,EACbC,GAAO,IACTA,GAAO,GACPlX,GAAK,EACLnC,KAAK+X,MAAM5V,IAAMiX,IAAM,IAEvBC,GAAO,EAKbrZ,KAAKsZ,SA2BP5B,EAAGrW,UAAU6X,WAAa,SAAqBvB,EAAQ1R,EAAMoN,GAE3DrT,KAAK+X,MAAQ,CAAE,GACf/X,KAAK6B,OAAS,EAGd,IAAK,IAAI2X,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWxT,EAClEuT,IAEFA,IACAC,EAAWA,EAAUxT,EAAQ,EAO7B,IALA,IAAIyT,EAAQ/B,EAAO9V,OAASwR,EACxBsG,EAAMD,EAAQF,EACdtC,EAAMuB,KAAKC,IAAIgB,EAAOA,EAAQC,GAAOtG,EAErCuG,EAAO,EACF1X,EAAImR,EAAOnR,EAAIgV,EAAKhV,GAAKsX,EAChCI,EAAOrB,EAAUZ,EAAQzV,EAAGA,EAAIsX,EAASvT,GAEzCjG,KAAK6Z,MAAMJ,GACPzZ,KAAK+X,MAAM,GAAK6B,EAAO,SACzB5Z,KAAK+X,MAAM,IAAM6B,EAEjB5Z,KAAK8Z,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAOrB,EAAUZ,EAAQzV,EAAGyV,EAAO9V,OAAQoE,GAEtC/D,EAAI,EAAGA,EAAIyX,EAAKzX,IACnB6X,GAAO9T,EAGTjG,KAAK6Z,MAAME,GACP/Z,KAAK+X,MAAM,GAAK6B,EAAO,SACzB5Z,KAAK+X,MAAM,IAAM6B,EAEjB5Z,KAAK8Z,OAAOF,GAIhB5Z,KAAKsZ,SAGP5B,EAAGrW,UAAU0D,KAAO,SAAeiV,GACjCA,EAAKjC,MAAQ,IAAI7U,MAAMlD,KAAK6B,QAC5B,IAAK,IAAIK,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAC/B8X,EAAKjC,MAAM7V,GAAKlC,KAAK+X,MAAM7V,GAE7B8X,EAAKnY,OAAS7B,KAAK6B,OACnBmY,EAAKlC,SAAW9X,KAAK8X,SACrBkC,EAAKhC,IAAMhY,KAAKgY,KAGlBN,EAAGrW,UAAUsQ,MAAQ,WACnB,IAAIvK,EAAI,IAAIsQ,EAAG,MAEf,OADA1X,KAAK+E,KAAKqC,GACHA,GAGTsQ,EAAGrW,UAAU4Y,QAAU,SAAkBzW,GACvC,MAAOxD,KAAK6B,OAAS2B,EACnBxD,KAAK+X,MAAM/X,KAAK6B,UAAY,EAE9B,OAAO7B,MAIT0X,EAAGrW,UAAUiY,MAAQ,WACnB,MAAOtZ,KAAK6B,OAAS,GAAqC,IAAhC7B,KAAK+X,MAAM/X,KAAK6B,OAAS,GACjD7B,KAAK6B,SAEP,OAAO7B,KAAKka,aAGdxC,EAAGrW,UAAU6Y,UAAY,WAKvB,OAHoB,IAAhBla,KAAK6B,QAAkC,IAAlB7B,KAAK+X,MAAM,KAClC/X,KAAK8X,SAAW,GAEX9X,MAGT0X,EAAGrW,UAAU8Y,QAAU,WACrB,OAAQna,KAAKgY,IAAM,UAAY,SAAWhY,KAAK0L,SAAS,IAAM,KAiChE,IAAI0O,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,EAAY7Z,GAGnB,IAFA,IAAI0Y,EAAI,IAAIlW,MAAMxC,EAAI8Z,aAEbC,EAAM,EAAGA,EAAMrB,EAAEvX,OAAQ4Y,IAAO,CACvC,IAAIpB,EAAOoB,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjBrB,EAAEqB,IAAQ/Z,EAAIqX,MAAMsB,GAAQ,GAAKqB,KAAWA,EAG9C,OAAOtB,EAmWT,SAASuB,EAAYC,EAAMla,EAAKoE,GAC9BA,EAAIgT,SAAWpX,EAAIoX,SAAW8C,EAAK9C,SACnC,IAAIlQ,EAAOgT,EAAK/Y,OAASnB,EAAImB,OAAU,EACvCiD,EAAIjD,OAAS+F,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAI8H,EAAoB,EAAhBkL,EAAK7C,MAAM,GACfpI,EAAmB,EAAfjP,EAAIqX,MAAM,GACd3Q,EAAIsI,EAAIC,EAERkL,EAAS,SAAJzT,EACL0T,EAAS1T,EAAI,SAAa,EAC9BtC,EAAIiT,MAAM,GAAK8C,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAInT,EAAKmT,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAOzC,KAAKC,IAAIqC,EAAGra,EAAImB,OAAS,GAC3BM,EAAIsW,KAAKE,IAAI,EAAGoC,EAAIH,EAAK/Y,OAAS,GAAIM,GAAK+Y,EAAM/Y,IAAK,CAC7D,IAAID,EAAK6Y,EAAI5Y,EAAK,EAClBuN,EAAoB,EAAhBkL,EAAK7C,MAAM7V,GACfyN,EAAmB,EAAfjP,EAAIqX,MAAM5V,GACdiF,EAAIsI,EAAIC,EAAIsL,EACZD,GAAW5T,EAAI,SAAa,EAC5B6T,EAAY,SAAJ7T,EAEVtC,EAAIiT,MAAMgD,GAAa,EAARE,EACfH,EAAiB,EAATE,EAQV,OANc,IAAVF,EACFhW,EAAIiT,MAAMgD,GAAa,EAARD,EAEfhW,EAAIjD,SAGCiD,EAAIwU,QAzlBb5B,EAAGrW,UAAUqK,SAAW,SAAmBzF,EAAMkV,GAI/C,IAAIrW,EACJ,GAJAmB,EAAOA,GAAQ,GACfkV,EAAoB,EAAVA,GAAe,EAGZ,KAATlV,GAAwB,QAATA,EAAgB,CACjCnB,EAAM,GAGN,IAFA,IAAIuU,EAAM,EACNyB,EAAQ,EACH5Y,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAAK,CACpC,IAAIkX,EAAIpZ,KAAK+X,MAAM7V,GACf0X,GAA+B,UAArBR,GAAKC,EAAOyB,IAAmBpP,SAAS,IACtDoP,EAAS1B,IAAO,GAAKC,EAAQ,SAE3BvU,EADY,IAAVgW,GAAe5Y,IAAMlC,KAAK6B,OAAS,EAC/BuY,EAAM,EAAIR,EAAK/X,QAAU+X,EAAO9U,EAEhC8U,EAAO9U,EAEfuU,GAAO,EACHA,GAAO,KACTA,GAAO,GACPnX,KAGU,IAAV4Y,IACFhW,EAAMgW,EAAMpP,SAAS,IAAM5G,GAE7B,MAAOA,EAAIjD,OAASsZ,IAAY,EAC9BrW,EAAM,IAAMA,EAKd,OAHsB,IAAlB9E,KAAK8X,WACPhT,EAAM,IAAMA,GAEPA,EAGT,GAAImB,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAImV,EAAYf,EAAWpU,GAEvBoV,EAAYf,EAAWrU,GAC3BnB,EAAM,GACN,IAAI2G,EAAIzL,KAAK2R,QACblG,EAAEqM,SAAW,EACb,OAAQrM,EAAE6P,SAAU,CAClB,IAAIlU,EAAIqE,EAAE8P,KAAKF,GAAW3P,SAASzF,GACnCwF,EAAIA,EAAE+P,MAAMH,GAKVvW,EAHG2G,EAAE6P,SAGClU,EAAItC,EAFJsV,EAAMgB,EAAYhU,EAAEvF,QAAUuF,EAAItC,EAKxC9E,KAAKsb,WACPxW,EAAM,IAAMA,GAEd,MAAOA,EAAIjD,OAASsZ,IAAY,EAC9BrW,EAAM,IAAMA,EAKd,OAHsB,IAAlB9E,KAAK8X,WACPhT,EAAM,IAAMA,GAEPA,EAGT2L,GAAO,EAAO,oCAGhBiH,EAAGrW,UAAUoa,SAAW,WACtB,IAAIC,EAAM1b,KAAK+X,MAAM,GASrB,OARoB,IAAhB/X,KAAK6B,OACP6Z,GAAuB,SAAhB1b,KAAK+X,MAAM,GACO,IAAhB/X,KAAK6B,QAAkC,IAAlB7B,KAAK+X,MAAM,GAEzC2D,GAAO,iBAAoC,SAAhB1b,KAAK+X,MAAM,GAC7B/X,KAAK6B,OAAS,GACvB4O,GAAO,EAAO,8CAEU,IAAlBzQ,KAAK8X,UAAmB4D,EAAMA,GAGxChE,EAAGrW,UAAUsa,OAAS,WACpB,OAAO3b,KAAK0L,SAAS,KAGvBgM,EAAGrW,UAAUua,SAAW,SAAmBhE,EAAQ/V,GAEjD,OADA4O,EAAyB,qBAAX7Q,GACPI,KAAK6b,YAAYjc,EAAQgY,EAAQ/V,IAG1C6V,EAAGrW,UAAUqD,QAAU,SAAkBkT,EAAQ/V,GAC/C,OAAO7B,KAAK6b,YAAY3Y,MAAO0U,EAAQ/V,IAGzC6V,EAAGrW,UAAUwa,YAAc,SAAsBC,EAAWlE,EAAQ/V,GAClE,IAAIgI,EAAa7J,KAAK6J,aAClBkS,EAAYla,GAAU4W,KAAKE,IAAI,EAAG9O,GACtC4G,EAAO5G,GAAckS,EAAW,yCAChCtL,EAAOsL,EAAY,EAAG,+BAEtB/b,KAAKsZ,QACL,IAGI3J,EAAGzN,EAHH8Z,EAA0B,OAAXpE,EACf3Y,EAAM,IAAI6c,EAAUC,GAGpBE,EAAIjc,KAAK2R,QACb,GAAKqK,EAYE,CACL,IAAK9Z,EAAI,GAAI+Z,EAAEX,SAAUpZ,IACvByN,EAAIsM,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETld,EAAIiD,GAAKyN,EAGX,KAAOzN,EAAI6Z,EAAW7Z,IACpBjD,EAAIiD,GAAK,MArBM,CAEjB,IAAKA,EAAI,EAAGA,EAAI6Z,EAAYlS,EAAY3H,IACtCjD,EAAIiD,GAAK,EAGX,IAAKA,EAAI,GAAI+Z,EAAEX,SAAUpZ,IACvByN,EAAIsM,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAETld,EAAI8c,EAAY7Z,EAAI,GAAKyN,EAe7B,OAAO1Q,GAGLwZ,KAAK2D,MACP1E,EAAGrW,UAAUgb,WAAa,SAAqBjD,GAC7C,OAAO,GAAKX,KAAK2D,MAAMhD,IAGzB1B,EAAGrW,UAAUgb,WAAa,SAAqBjD,GAC7C,IAAIrT,EAAIqT,EACJhS,EAAI,EAiBR,OAhBIrB,GAAK,OACPqB,GAAK,GACLrB,KAAO,IAELA,GAAK,KACPqB,GAAK,EACLrB,KAAO,GAELA,GAAK,IACPqB,GAAK,EACLrB,KAAO,GAELA,GAAK,IACPqB,GAAK,EACLrB,KAAO,GAEFqB,EAAIrB,GAIf2R,EAAGrW,UAAUib,UAAY,SAAoBlD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAIrT,EAAIqT,EACJhS,EAAI,EAoBR,OAnBqB,KAAZ,KAAJrB,KACHqB,GAAK,GACLrB,KAAO,IAEU,KAAV,IAAJA,KACHqB,GAAK,EACLrB,KAAO,GAES,KAAT,GAAJA,KACHqB,GAAK,EACLrB,KAAO,GAES,KAAT,EAAJA,KACHqB,GAAK,EACLrB,KAAO,GAES,KAAT,EAAJA,IACHqB,IAEKA,GAITsQ,EAAGrW,UAAUmZ,UAAY,WACvB,IAAIpB,EAAIpZ,KAAK+X,MAAM/X,KAAK6B,OAAS,GAC7B0a,EAAKvc,KAAKqc,WAAWjD,GACzB,OAA2B,IAAnBpZ,KAAK6B,OAAS,GAAU0a,GAiBlC7E,EAAGrW,UAAUmb,SAAW,WACtB,GAAIxc,KAAKsb,SAAU,OAAO,EAG1B,IADA,IAAIlU,EAAI,EACClF,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAAK,CACpC,IAAIyN,EAAI3P,KAAKsc,UAAUtc,KAAK+X,MAAM7V,IAElC,GADAkF,GAAKuI,EACK,KAANA,EAAU,MAEhB,OAAOvI,GAGTsQ,EAAGrW,UAAUwI,WAAa,WACxB,OAAO4O,KAAKU,KAAKnZ,KAAKwa,YAAc,IAGtC9C,EAAGrW,UAAUob,OAAS,SAAiBC,GACrC,OAAsB,IAAlB1c,KAAK8X,SACA9X,KAAK2c,MAAMC,MAAMF,GAAOG,MAAM,GAEhC7c,KAAK2R,SAGd+F,EAAGrW,UAAUyb,SAAW,SAAmBJ,GACzC,OAAI1c,KAAK+c,MAAML,EAAQ,GACd1c,KAAKgd,KAAKN,GAAOG,MAAM,GAAGI,OAE5Bjd,KAAK2R,SAGd+F,EAAGrW,UAAU6b,MAAQ,WACnB,OAAyB,IAAlBld,KAAK8X,UAIdJ,EAAGrW,UAAU8b,IAAM,WACjB,OAAOnd,KAAK2R,QAAQsL,QAGtBvF,EAAGrW,UAAU4b,KAAO,WAKlB,OAJKjd,KAAKsb,WACRtb,KAAK8X,UAAY,GAGZ9X,MAIT0X,EAAGrW,UAAU+b,KAAO,SAAe1c,GACjC,MAAOV,KAAK6B,OAASnB,EAAImB,OACvB7B,KAAK+X,MAAM/X,KAAK6B,UAAY,EAG9B,IAAK,IAAIK,EAAI,EAAGA,EAAIxB,EAAImB,OAAQK,IAC9BlC,KAAK+X,MAAM7V,GAAKlC,KAAK+X,MAAM7V,GAAKxB,EAAIqX,MAAM7V,GAG5C,OAAOlC,KAAKsZ,SAGd5B,EAAGrW,UAAUgc,IAAM,SAAc3c,GAE/B,OADA+P,EAA0C,KAAlCzQ,KAAK8X,SAAWpX,EAAIoX,WACrB9X,KAAKod,KAAK1c,IAInBgX,EAAGrW,UAAUic,GAAK,SAAa5c,GAC7B,OAAIV,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAK2R,QAAQ0L,IAAI3c,GAC/CA,EAAIiR,QAAQ0L,IAAIrd,OAGzB0X,EAAGrW,UAAUkc,IAAM,SAAc7c,GAC/B,OAAIV,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAK2R,QAAQyL,KAAK1c,GAChDA,EAAIiR,QAAQyL,KAAKpd,OAI1B0X,EAAGrW,UAAUmc,MAAQ,SAAgB9c,GAEnC,IAAIiP,EAEFA,EADE3P,KAAK6B,OAASnB,EAAImB,OAChBnB,EAEAV,KAGN,IAAK,IAAIkC,EAAI,EAAGA,EAAIyN,EAAE9N,OAAQK,IAC5BlC,KAAK+X,MAAM7V,GAAKlC,KAAK+X,MAAM7V,GAAKxB,EAAIqX,MAAM7V,GAK5C,OAFAlC,KAAK6B,OAAS8N,EAAE9N,OAET7B,KAAKsZ,SAGd5B,EAAGrW,UAAUoc,KAAO,SAAe/c,GAEjC,OADA+P,EAA0C,KAAlCzQ,KAAK8X,SAAWpX,EAAIoX,WACrB9X,KAAKwd,MAAM9c,IAIpBgX,EAAGrW,UAAUqc,IAAM,SAAchd,GAC/B,OAAIV,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAK2R,QAAQ8L,KAAK/c,GAChDA,EAAIiR,QAAQ8L,KAAKzd,OAG1B0X,EAAGrW,UAAUsc,KAAO,SAAejd,GACjC,OAAIV,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAK2R,QAAQ6L,MAAM9c,GACjDA,EAAIiR,QAAQ6L,MAAMxd,OAI3B0X,EAAGrW,UAAUuc,MAAQ,SAAgBld,GAEnC,IAAIgP,EACAC,EACA3P,KAAK6B,OAASnB,EAAImB,QACpB6N,EAAI1P,KACJ2P,EAAIjP,IAEJgP,EAAIhP,EACJiP,EAAI3P,MAGN,IAAK,IAAIkC,EAAI,EAAGA,EAAIyN,EAAE9N,OAAQK,IAC5BlC,KAAK+X,MAAM7V,GAAKwN,EAAEqI,MAAM7V,GAAKyN,EAAEoI,MAAM7V,GAGvC,GAAIlC,OAAS0P,EACX,KAAOxN,EAAIwN,EAAE7N,OAAQK,IACnBlC,KAAK+X,MAAM7V,GAAKwN,EAAEqI,MAAM7V,GAM5B,OAFAlC,KAAK6B,OAAS6N,EAAE7N,OAET7B,KAAKsZ,SAGd5B,EAAGrW,UAAUwc,KAAO,SAAend,GAEjC,OADA+P,EAA0C,KAAlCzQ,KAAK8X,SAAWpX,EAAIoX,WACrB9X,KAAK4d,MAAMld,IAIpBgX,EAAGrW,UAAUyc,IAAM,SAAcpd,GAC/B,OAAIV,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAK2R,QAAQkM,KAAKnd,GAChDA,EAAIiR,QAAQkM,KAAK7d,OAG1B0X,EAAGrW,UAAU0c,KAAO,SAAerd,GACjC,OAAIV,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAK2R,QAAQiM,MAAMld,GACjDA,EAAIiR,QAAQiM,MAAM5d,OAI3B0X,EAAGrW,UAAUub,MAAQ,SAAgBF,GACnCjM,EAAwB,kBAAViM,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxBvF,KAAKU,KAAKuD,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvB1c,KAAKia,QAAQ+D,GAETC,EAAW,GACbD,IAIF,IAAK,IAAI9b,EAAI,EAAGA,EAAI8b,EAAa9b,IAC/BlC,KAAK+X,MAAM7V,GAAsB,UAAhBlC,KAAK+X,MAAM7V,GAS9B,OALI+b,EAAW,IACbje,KAAK+X,MAAM7V,IAAMlC,KAAK+X,MAAM7V,GAAM,UAAc,GAAK+b,GAIhDje,KAAKsZ,SAGd5B,EAAGrW,UAAU2b,KAAO,SAAeN,GACjC,OAAO1c,KAAK2R,QAAQiL,MAAMF,IAI5BhF,EAAGrW,UAAU6c,KAAO,SAAezD,EAAK3S,GACtC2I,EAAsB,kBAARgK,GAAoBA,GAAO,GAEzC,IAAIpB,EAAOoB,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARAza,KAAKia,QAAQZ,EAAM,GAGjBrZ,KAAK+X,MAAMsB,GADTvR,EACgB9H,KAAK+X,MAAMsB,GAAQ,GAAKqB,EAExB1a,KAAK+X,MAAMsB,KAAS,GAAKqB,GAGtC1a,KAAKsZ,SAId5B,EAAGrW,UAAU8c,KAAO,SAAezd,GACjC,IAAI0G,EAkBAsI,EAAGC,EAfP,GAAsB,IAAlB3P,KAAK8X,UAAmC,IAAjBpX,EAAIoX,SAI7B,OAHA9X,KAAK8X,SAAW,EAChB1Q,EAAIpH,KAAKoe,KAAK1d,GACdV,KAAK8X,UAAY,EACV9X,KAAKka,YAGP,GAAsB,IAAlBla,KAAK8X,UAAmC,IAAjBpX,EAAIoX,SAIpC,OAHApX,EAAIoX,SAAW,EACf1Q,EAAIpH,KAAKoe,KAAK1d,GACdA,EAAIoX,SAAW,EACR1Q,EAAE8S,YAKPla,KAAK6B,OAASnB,EAAImB,QACpB6N,EAAI1P,KACJ2P,EAAIjP,IAEJgP,EAAIhP,EACJiP,EAAI3P,MAIN,IADA,IAAI8a,EAAQ,EACH5Y,EAAI,EAAGA,EAAIyN,EAAE9N,OAAQK,IAC5BkF,GAAkB,EAAbsI,EAAEqI,MAAM7V,KAAwB,EAAbyN,EAAEoI,MAAM7V,IAAU4Y,EAC1C9a,KAAK+X,MAAM7V,GAAS,SAAJkF,EAChB0T,EAAQ1T,IAAM,GAEhB,KAAiB,IAAV0T,GAAe5Y,EAAIwN,EAAE7N,OAAQK,IAClCkF,GAAkB,EAAbsI,EAAEqI,MAAM7V,IAAU4Y,EACvB9a,KAAK+X,MAAM7V,GAAS,SAAJkF,EAChB0T,EAAQ1T,IAAM,GAIhB,GADApH,KAAK6B,OAAS6N,EAAE7N,OACF,IAAViZ,EACF9a,KAAK+X,MAAM/X,KAAK6B,QAAUiZ,EAC1B9a,KAAK6B,cAEA,GAAI6N,IAAM1P,KACf,KAAOkC,EAAIwN,EAAE7N,OAAQK,IACnBlC,KAAK+X,MAAM7V,GAAKwN,EAAEqI,MAAM7V,GAI5B,OAAOlC,MAIT0X,EAAGrW,UAAUgd,IAAM,SAAc3d,GAC/B,IAAIzB,EACJ,OAAqB,IAAjByB,EAAIoX,UAAoC,IAAlB9X,KAAK8X,UAC7BpX,EAAIoX,SAAW,EACf7Y,EAAMe,KAAKse,IAAI5d,GACfA,EAAIoX,UAAY,EACT7Y,GACmB,IAAjByB,EAAIoX,UAAoC,IAAlB9X,KAAK8X,UACpC9X,KAAK8X,SAAW,EAChB7Y,EAAMyB,EAAI4d,IAAIte,MACdA,KAAK8X,SAAW,EACT7Y,GAGLe,KAAK6B,OAASnB,EAAImB,OAAe7B,KAAK2R,QAAQwM,KAAKzd,GAEhDA,EAAIiR,QAAQwM,KAAKne,OAI1B0X,EAAGrW,UAAU+c,KAAO,SAAe1d,GAEjC,GAAqB,IAAjBA,EAAIoX,SAAgB,CACtBpX,EAAIoX,SAAW,EACf,IAAI1Q,EAAIpH,KAAKme,KAAKzd,GAElB,OADAA,EAAIoX,SAAW,EACR1Q,EAAE8S,YAGJ,GAAsB,IAAlBla,KAAK8X,SAId,OAHA9X,KAAK8X,SAAW,EAChB9X,KAAKme,KAAKzd,GACVV,KAAK8X,SAAW,EACT9X,KAAKka,YAId,IAWIxK,EAAGC,EAXHmJ,EAAM9Y,KAAK8Y,IAAIpY,GAGnB,GAAY,IAARoY,EAIF,OAHA9Y,KAAK8X,SAAW,EAChB9X,KAAK6B,OAAS,EACd7B,KAAK+X,MAAM,GAAK,EACT/X,KAKL8Y,EAAM,GACRpJ,EAAI1P,KACJ2P,EAAIjP,IAEJgP,EAAIhP,EACJiP,EAAI3P,MAIN,IADA,IAAI8a,EAAQ,EACH5Y,EAAI,EAAGA,EAAIyN,EAAE9N,OAAQK,IAC5BkF,GAAkB,EAAbsI,EAAEqI,MAAM7V,KAAwB,EAAbyN,EAAEoI,MAAM7V,IAAU4Y,EAC1CA,EAAQ1T,GAAK,GACbpH,KAAK+X,MAAM7V,GAAS,SAAJkF,EAElB,KAAiB,IAAV0T,GAAe5Y,EAAIwN,EAAE7N,OAAQK,IAClCkF,GAAkB,EAAbsI,EAAEqI,MAAM7V,IAAU4Y,EACvBA,EAAQ1T,GAAK,GACbpH,KAAK+X,MAAM7V,GAAS,SAAJkF,EAIlB,GAAc,IAAV0T,GAAe5Y,EAAIwN,EAAE7N,QAAU6N,IAAM1P,KACvC,KAAOkC,EAAIwN,EAAE7N,OAAQK,IACnBlC,KAAK+X,MAAM7V,GAAKwN,EAAEqI,MAAM7V,GAU5B,OANAlC,KAAK6B,OAAS4W,KAAKE,IAAI3Y,KAAK6B,OAAQK,GAEhCwN,IAAM1P,OACRA,KAAK8X,SAAW,GAGX9X,KAAKsZ,SAId5B,EAAGrW,UAAUid,IAAM,SAAc5d,GAC/B,OAAOV,KAAK2R,QAAQyM,KAAK1d,IA+C3B,IAAI6d,EAAc,SAAsB3D,EAAMla,EAAKoE,GACjD,IAII+V,EACA2D,EACAjC,EANA7M,EAAIkL,EAAK7C,MACTpI,EAAIjP,EAAIqX,MACR0G,EAAI3Z,EAAIiT,MACRtM,EAAI,EAIJiT,EAAY,EAAPhP,EAAE,GACPiP,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnP,EAAE,GACPoP,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtP,EAAE,GACPuP,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzP,EAAE,GACP0P,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5P,EAAE,GACP6P,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/P,EAAE,GACPgQ,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlQ,EAAE,GACPmQ,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrQ,EAAE,GACPsQ,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxQ,EAAE,GACPyQ,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3Q,EAAE,GACP4Q,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7Q,EAAE,GACP8Q,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhR,EAAE,GACPiR,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnR,EAAE,GACPoR,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtR,EAAE,GACPuR,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzR,EAAE,GACP0R,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAP5R,EAAE,GACP6R,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP/R,EAAE,GACPgS,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPlS,EAAE,GACPmS,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPrS,EAAE,GACPsS,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPxS,EAAE,GACPyS,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjBrd,EAAIgT,SAAW8C,EAAK9C,SAAWpX,EAAIoX,SACnChT,EAAIjD,OAAS,GAEbgZ,EAAKpC,KAAK6J,KAAK3D,EAAK8B,GACpBjC,EAAM/F,KAAK6J,KAAK3D,EAAK+B,GACrBlC,EAAOA,EAAM/F,KAAK6J,KAAK1D,EAAK6B,GAAQ,EACpClE,EAAK9D,KAAK6J,KAAK1D,EAAK8B,GACpB,IAAI6B,IAAQ9W,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrD/S,GAAO8Q,GAAMiC,IAAQ,IAAO,IAAM+D,KAAO,IAAO,EAChDA,IAAM,SAEN1H,EAAKpC,KAAK6J,KAAKxD,EAAK2B,GACpBjC,EAAM/F,KAAK6J,KAAKxD,EAAK4B,GACrBlC,EAAOA,EAAM/F,KAAK6J,KAAKvD,EAAK0B,GAAQ,EACpClE,EAAK9D,KAAK6J,KAAKvD,EAAK2B,GACpB7F,EAAMA,EAAKpC,KAAK6J,KAAK3D,EAAKiC,GAAQ,EAClCpC,EAAOA,EAAM/F,KAAK6J,KAAK3D,EAAKkC,GAAQ,EACpCrC,EAAOA,EAAM/F,KAAK6J,KAAK1D,EAAKgC,GAAQ,EACpCrE,EAAMA,EAAK9D,KAAK6J,KAAK1D,EAAKiC,GAAQ,EAClC,IAAI2B,IAAQ/W,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrD/S,GAAO8Q,GAAMiC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAEN3H,EAAKpC,KAAK6J,KAAKrD,EAAKwB,GACpBjC,EAAM/F,KAAK6J,KAAKrD,EAAKyB,GACrBlC,EAAOA,EAAM/F,KAAK6J,KAAKpD,EAAKuB,GAAQ,EACpClE,EAAK9D,KAAK6J,KAAKpD,EAAKwB,GACpB7F,EAAMA,EAAKpC,KAAK6J,KAAKxD,EAAK8B,GAAQ,EAClCpC,EAAOA,EAAM/F,KAAK6J,KAAKxD,EAAK+B,GAAQ,EACpCrC,EAAOA,EAAM/F,KAAK6J,KAAKvD,EAAK6B,GAAQ,EACpCrE,EAAMA,EAAK9D,KAAK6J,KAAKvD,EAAK8B,GAAQ,EAClChG,EAAMA,EAAKpC,KAAK6J,KAAK3D,EAAKoC,GAAQ,EAClCvC,EAAOA,EAAM/F,KAAK6J,KAAK3D,EAAKqC,GAAQ,EACpCxC,EAAOA,EAAM/F,KAAK6J,KAAK1D,EAAKmC,GAAQ,EACpCxE,EAAMA,EAAK9D,KAAK6J,KAAK1D,EAAKoC,GAAQ,EAClC,IAAIyB,IAAQhX,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrD/S,GAAO8Q,GAAMiC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAEN5H,EAAKpC,KAAK6J,KAAKlD,EAAKqB,GACpBjC,EAAM/F,KAAK6J,KAAKlD,EAAKsB,GACrBlC,EAAOA,EAAM/F,KAAK6J,KAAKjD,EAAKoB,GAAQ,EACpClE,EAAK9D,KAAK6J,KAAKjD,EAAKqB,GACpB7F,EAAMA,EAAKpC,KAAK6J,KAAKrD,EAAK2B,GAAQ,EAClCpC,EAAOA,EAAM/F,KAAK6J,KAAKrD,EAAK4B,GAAQ,EACpCrC,EAAOA,EAAM/F,KAAK6J,KAAKpD,EAAK0B,GAAQ,EACpCrE,EAAMA,EAAK9D,KAAK6J,KAAKpD,EAAK2B,GAAQ,EAClChG,EAAMA,EAAKpC,KAAK6J,KAAKxD,EAAKiC,GAAQ,EAClCvC,EAAOA,EAAM/F,KAAK6J,KAAKxD,EAAKkC,GAAQ,EACpCxC,EAAOA,EAAM/F,KAAK6J,KAAKvD,EAAKgC,GAAQ,EACpCxE,EAAMA,EAAK9D,KAAK6J,KAAKvD,EAAKiC,GAAQ,EAClCnG,EAAMA,EAAKpC,KAAK6J,KAAK3D,EAAKuC,GAAQ,EAClC1C,EAAOA,EAAM/F,KAAK6J,KAAK3D,EAAKwC,GAAQ,EACpC3C,EAAOA,EAAM/F,KAAK6J,KAAK1D,EAAKsC,GAAQ,EACpC3E,EAAMA,EAAK9D,KAAK6J,KAAK1D,EAAKuC,GAAQ,EAClC,IAAIuB,IAAQjX,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrD/S,GAAO8Q,GAAMiC,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAEN7H,EAAKpC,KAAK6J,KAAK/C,EAAKkB,GACpBjC,EAAM/F,KAAK6J,KAAK/C,EAAKmB,GACrBlC,EAAOA,EAAM/F,KAAK6J,KAAK9C,EAAKiB,GAAQ,EACpClE,EAAK9D,KAAK6J,KAAK9C,EAAKkB,GACpB7F,EAAMA,EAAKpC,KAAK6J,KAAKlD,EAAKwB,GAAQ,EAClCpC,EAAOA,EAAM/F,KAAK6J,KAAKlD,EAAKyB,GAAQ,EACpCrC,EAAOA,EAAM/F,KAAK6J,KAAKjD,EAAKuB,GAAQ,EACpCrE,EAAMA,EAAK9D,KAAK6J,KAAKjD,EAAKwB,GAAQ,EAClChG,EAAMA,EAAKpC,KAAK6J,KAAKrD,EAAK8B,GAAQ,EAClCvC,EAAOA,EAAM/F,KAAK6J,KAAKrD,EAAK+B,GAAQ,EACpCxC,EAAOA,EAAM/F,KAAK6J,KAAKpD,EAAK6B,GAAQ,EACpCxE,EAAMA,EAAK9D,KAAK6J,KAAKpD,EAAK8B,GAAQ,EAClCnG,EAAMA,EAAKpC,KAAK6J,KAAKxD,EAAKoC,GAAQ,EAClC1C,EAAOA,EAAM/F,KAAK6J,KAAKxD,EAAKqC,GAAQ,EACpC3C,EAAOA,EAAM/F,KAAK6J,KAAKvD,EAAKmC,GAAQ,EACpC3E,EAAMA,EAAK9D,KAAK6J,KAAKvD,EAAKoC,GAAQ,EAClCtG,EAAMA,EAAKpC,KAAK6J,KAAK3D,EAAK0C,GAAQ,EAClC7C,EAAOA,EAAM/F,KAAK6J,KAAK3D,EAAK2C,IAAQ,EACpC9C,EAAOA,EAAM/F,KAAK6J,KAAK1D,EAAKyC,GAAQ,EACpC9E,EAAMA,EAAK9D,KAAK6J,KAAK1D,EAAK0C,IAAQ,EAClC,IAAIqB,IAAQlX,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrD/S,GAAO8Q,GAAMiC,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAEN9H,EAAKpC,KAAK6J,KAAK5C,EAAKe,GACpBjC,EAAM/F,KAAK6J,KAAK5C,EAAKgB,GACrBlC,EAAOA,EAAM/F,KAAK6J,KAAK3C,EAAKc,GAAQ,EACpClE,EAAK9D,KAAK6J,KAAK3C,EAAKe,GACpB7F,EAAMA,EAAKpC,KAAK6J,KAAK/C,EAAKqB,GAAQ,EAClCpC,EAAOA,EAAM/F,KAAK6J,KAAK/C,EAAKsB,GAAQ,EACpCrC,EAAOA,EAAM/F,KAAK6J,KAAK9C,EAAKoB,GAAQ,EACpCrE,EAAMA,EAAK9D,KAAK6J,KAAK9C,EAAKqB,GAAQ,EAClChG,EAAMA,EAAKpC,KAAK6J,KAAKlD,EAAK2B,GAAQ,EAClCvC,EAAOA,EAAM/F,KAAK6J,KAAKlD,EAAK4B,GAAQ,EACpCxC,EAAOA,EAAM/F,KAAK6J,KAAKjD,EAAK0B,GAAQ,EACpCxE,EAAMA,EAAK9D,KAAK6J,KAAKjD,EAAK2B,GAAQ,EAClCnG,EAAMA,EAAKpC,KAAK6J,KAAKrD,EAAKiC,GAAQ,EAClC1C,EAAOA,EAAM/F,KAAK6J,KAAKrD,EAAKkC,GAAQ,EACpC3C,EAAOA,EAAM/F,KAAK6J,KAAKpD,EAAKgC,GAAQ,EACpC3E,EAAMA,EAAK9D,KAAK6J,KAAKpD,EAAKiC,GAAQ,EAClCtG,EAAMA,EAAKpC,KAAK6J,KAAKxD,EAAKuC,GAAQ,EAClC7C,EAAOA,EAAM/F,KAAK6J,KAAKxD,EAAKwC,IAAQ,EACpC9C,EAAOA,EAAM/F,KAAK6J,KAAKvD,EAAKsC,GAAQ,EACpC9E,EAAMA,EAAK9D,KAAK6J,KAAKvD,EAAKuC,IAAQ,EAClCzG,EAAMA,EAAKpC,KAAK6J,KAAK3D,EAAK6C,IAAQ,EAClChD,EAAOA,EAAM/F,KAAK6J,KAAK3D,EAAK8C,IAAQ,EACpCjD,EAAOA,EAAM/F,KAAK6J,KAAK1D,EAAK4C,IAAQ,EACpCjF,EAAMA,EAAK9D,KAAK6J,KAAK1D,EAAK6C,IAAQ,EAClC,IAAImB,IAAQnX,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrD/S,GAAO8Q,GAAMiC,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAKpC,KAAK6J,KAAKzC,EAAKY,GACpBjC,EAAM/F,KAAK6J,KAAKzC,EAAKa,GACrBlC,EAAOA,EAAM/F,KAAK6J,KAAKxC,EAAKW,GAAQ,EACpClE,EAAK9D,KAAK6J,KAAKxC,EAAKY,GACpB7F,EAAMA,EAAKpC,KAAK6J,KAAK5C,EAAKkB,GAAQ,EAClCpC,EAAOA,EAAM/F,KAAK6J,KAAK5C,EAAKmB,GAAQ,EACpCrC,EAAOA,EAAM/F,KAAK6J,KAAK3C,EAAKiB,GAAQ,EACpCrE,EAAMA,EAAK9D,KAAK6J,KAAK3C,EAAKkB,GAAQ,EAClChG,EAAMA,EAAKpC,KAAK6J,KAAK/C,EAAKwB,GAAQ,EAClCvC,EAAOA,EAAM/F,KAAK6J,KAAK/C,EAAKyB,GAAQ,EACpCxC,EAAOA,EAAM/F,KAAK6J,KAAK9C,EAAKuB,GAAQ,EACpCxE,EAAMA,EAAK9D,KAAK6J,KAAK9C,EAAKwB,GAAQ,EAClCnG,EAAMA,EAAKpC,KAAK6J,KAAKlD,EAAK8B,GAAQ,EAClC1C,EAAOA,EAAM/F,KAAK6J,KAAKlD,EAAK+B,GAAQ,EACpC3C,EAAOA,EAAM/F,KAAK6J,KAAKjD,EAAK6B,GAAQ,EACpC3E,EAAMA,EAAK9D,KAAK6J,KAAKjD,EAAK8B,GAAQ,EAClCtG,EAAMA,EAAKpC,KAAK6J,KAAKrD,EAAKoC,GAAQ,EAClC7C,EAAOA,EAAM/F,KAAK6J,KAAKrD,EAAKqC,IAAQ,EACpC9C,EAAOA,EAAM/F,KAAK6J,KAAKpD,EAAKmC,GAAQ,EACpC9E,EAAMA,EAAK9D,KAAK6J,KAAKpD,EAAKoC,IAAQ,EAClCzG,EAAMA,EAAKpC,KAAK6J,KAAKxD,EAAK0C,IAAQ,EAClChD,EAAOA,EAAM/F,KAAK6J,KAAKxD,EAAK2C,IAAQ,EACpCjD,EAAOA,EAAM/F,KAAK6J,KAAKvD,EAAKyC,IAAQ,EACpCjF,EAAMA,EAAK9D,KAAK6J,KAAKvD,EAAK0C,IAAQ,EAClC5G,EAAMA,EAAKpC,KAAK6J,KAAK3D,EAAKgD,IAAQ,EAClCnD,EAAOA,EAAM/F,KAAK6J,KAAK3D,EAAKiD,IAAQ,EACpCpD,EAAOA,EAAM/F,KAAK6J,KAAK1D,EAAK+C,IAAQ,EACpCpF,EAAMA,EAAK9D,KAAK6J,KAAK1D,EAAKgD,IAAQ,EAClC,IAAIiB,IAAQpX,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrD/S,GAAO8Q,GAAMiC,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENhI,EAAKpC,KAAK6J,KAAKtC,EAAKS,GACpBjC,EAAM/F,KAAK6J,KAAKtC,EAAKU,GACrBlC,EAAOA,EAAM/F,KAAK6J,KAAKrC,EAAKQ,GAAQ,EACpClE,EAAK9D,KAAK6J,KAAKrC,EAAKS,GACpB7F,EAAMA,EAAKpC,KAAK6J,KAAKzC,EAAKe,GAAQ,EAClCpC,EAAOA,EAAM/F,KAAK6J,KAAKzC,EAAKgB,GAAQ,EACpCrC,EAAOA,EAAM/F,KAAK6J,KAAKxC,EAAKc,GAAQ,EACpCrE,EAAMA,EAAK9D,KAAK6J,KAAKxC,EAAKe,GAAQ,EAClChG,EAAMA,EAAKpC,KAAK6J,KAAK5C,EAAKqB,GAAQ,EAClCvC,EAAOA,EAAM/F,KAAK6J,KAAK5C,EAAKsB,GAAQ,EACpCxC,EAAOA,EAAM/F,KAAK6J,KAAK3C,EAAKoB,GAAQ,EACpCxE,EAAMA,EAAK9D,KAAK6J,KAAK3C,EAAKqB,GAAQ,EAClCnG,EAAMA,EAAKpC,KAAK6J,KAAK/C,EAAK2B,GAAQ,EAClC1C,EAAOA,EAAM/F,KAAK6J,KAAK/C,EAAK4B,GAAQ,EACpC3C,EAAOA,EAAM/F,KAAK6J,KAAK9C,EAAK0B,GAAQ,EACpC3E,EAAMA,EAAK9D,KAAK6J,KAAK9C,EAAK2B,GAAQ,EAClCtG,EAAMA,EAAKpC,KAAK6J,KAAKlD,EAAKiC,GAAQ,EAClC7C,EAAOA,EAAM/F,KAAK6J,KAAKlD,EAAKkC,IAAQ,EACpC9C,EAAOA,EAAM/F,KAAK6J,KAAKjD,EAAKgC,GAAQ,EACpC9E,EAAMA,EAAK9D,KAAK6J,KAAKjD,EAAKiC,IAAQ,EAClCzG,EAAMA,EAAKpC,KAAK6J,KAAKrD,EAAKuC,IAAQ,EAClChD,EAAOA,EAAM/F,KAAK6J,KAAKrD,EAAKwC,IAAQ,EACpCjD,EAAOA,EAAM/F,KAAK6J,KAAKpD,EAAKsC,IAAQ,EACpCjF,EAAMA,EAAK9D,KAAK6J,KAAKpD,EAAKuC,IAAQ,EAClC5G,EAAMA,EAAKpC,KAAK6J,KAAKxD,EAAK6C,IAAQ,EAClCnD,EAAOA,EAAM/F,KAAK6J,KAAKxD,EAAK8C,IAAQ,EACpCpD,EAAOA,EAAM/F,KAAK6J,KAAKvD,EAAK4C,IAAQ,EACpCpF,EAAMA,EAAK9D,KAAK6J,KAAKvD,EAAK6C,IAAQ,EAClC/G,EAAMA,EAAKpC,KAAK6J,KAAK3D,EAAKmD,IAAQ,EAClCtD,EAAOA,EAAM/F,KAAK6J,KAAK3D,EAAKoD,IAAQ,EACpCvD,EAAOA,EAAM/F,KAAK6J,KAAK1D,EAAKkD,IAAQ,EACpCvF,EAAMA,EAAK9D,KAAK6J,KAAK1D,EAAKmD,IAAQ,EAClC,IAAIe,IAAQrX,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrD/S,GAAO8Q,GAAMiC,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAKpC,KAAK6J,KAAKnC,EAAKM,GACpBjC,EAAM/F,KAAK6J,KAAKnC,EAAKO,GACrBlC,EAAOA,EAAM/F,KAAK6J,KAAKlC,EAAKK,GAAQ,EACpClE,EAAK9D,KAAK6J,KAAKlC,EAAKM,GACpB7F,EAAMA,EAAKpC,KAAK6J,KAAKtC,EAAKY,GAAQ,EAClCpC,EAAOA,EAAM/F,KAAK6J,KAAKtC,EAAKa,GAAQ,EACpCrC,EAAOA,EAAM/F,KAAK6J,KAAKrC,EAAKW,GAAQ,EACpCrE,EAAMA,EAAK9D,KAAK6J,KAAKrC,EAAKY,GAAQ,EAClChG,EAAMA,EAAKpC,KAAK6J,KAAKzC,EAAKkB,GAAQ,EAClCvC,EAAOA,EAAM/F,KAAK6J,KAAKzC,EAAKmB,GAAQ,EACpCxC,EAAOA,EAAM/F,KAAK6J,KAAKxC,EAAKiB,GAAQ,EACpCxE,EAAMA,EAAK9D,KAAK6J,KAAKxC,EAAKkB,GAAQ,EAClCnG,EAAMA,EAAKpC,KAAK6J,KAAK5C,EAAKwB,GAAQ,EAClC1C,EAAOA,EAAM/F,KAAK6J,KAAK5C,EAAKyB,GAAQ,EACpC3C,EAAOA,EAAM/F,KAAK6J,KAAK3C,EAAKuB,GAAQ,EACpC3E,EAAMA,EAAK9D,KAAK6J,KAAK3C,EAAKwB,GAAQ,EAClCtG,EAAMA,EAAKpC,KAAK6J,KAAK/C,EAAK8B,GAAQ,EAClC7C,EAAOA,EAAM/F,KAAK6J,KAAK/C,EAAK+B,IAAQ,EACpC9C,EAAOA,EAAM/F,KAAK6J,KAAK9C,EAAK6B,GAAQ,EACpC9E,EAAMA,EAAK9D,KAAK6J,KAAK9C,EAAK8B,IAAQ,EAClCzG,EAAMA,EAAKpC,KAAK6J,KAAKlD,EAAKoC,IAAQ,EAClChD,EAAOA,EAAM/F,KAAK6J,KAAKlD,EAAKqC,IAAQ,EACpCjD,EAAOA,EAAM/F,KAAK6J,KAAKjD,EAAKmC,IAAQ,EACpCjF,EAAMA,EAAK9D,KAAK6J,KAAKjD,EAAKoC,IAAQ,EAClC5G,EAAMA,EAAKpC,KAAK6J,KAAKrD,EAAK0C,IAAQ,EAClCnD,EAAOA,EAAM/F,KAAK6J,KAAKrD,EAAK2C,IAAQ,EACpCpD,EAAOA,EAAM/F,KAAK6J,KAAKpD,EAAKyC,IAAQ,EACpCpF,EAAMA,EAAK9D,KAAK6J,KAAKpD,EAAK0C,IAAQ,EAClC/G,EAAMA,EAAKpC,KAAK6J,KAAKxD,EAAKgD,IAAQ,EAClCtD,EAAOA,EAAM/F,KAAK6J,KAAKxD,EAAKiD,IAAQ,EACpCvD,EAAOA,EAAM/F,KAAK6J,KAAKvD,EAAK+C,IAAQ,EACpCvF,EAAMA,EAAK9D,KAAK6J,KAAKvD,EAAKgD,IAAQ,EAClClH,EAAMA,EAAKpC,KAAK6J,KAAK3D,EAAKsD,IAAQ,EAClCzD,EAAOA,EAAM/F,KAAK6J,KAAK3D,EAAKuD,IAAQ,EACpC1D,EAAOA,EAAM/F,KAAK6J,KAAK1D,EAAKqD,IAAQ,EACpC1F,EAAMA,EAAK9D,KAAK6J,KAAK1D,EAAKsD,IAAQ,EAClC,IAAIa,IAAQtX,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrD/S,GAAO8Q,GAAMiC,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAKpC,KAAK6J,KAAKhC,EAAKG,GACpBjC,EAAM/F,KAAK6J,KAAKhC,EAAKI,GACrBlC,EAAOA,EAAM/F,KAAK6J,KAAK/B,EAAKE,GAAQ,EACpClE,EAAK9D,KAAK6J,KAAK/B,EAAKG,GACpB7F,EAAMA,EAAKpC,KAAK6J,KAAKnC,EAAKS,GAAQ,EAClCpC,EAAOA,EAAM/F,KAAK6J,KAAKnC,EAAKU,GAAQ,EACpCrC,EAAOA,EAAM/F,KAAK6J,KAAKlC,EAAKQ,GAAQ,EACpCrE,EAAMA,EAAK9D,KAAK6J,KAAKlC,EAAKS,GAAQ,EAClChG,EAAMA,EAAKpC,KAAK6J,KAAKtC,EAAKe,GAAQ,EAClCvC,EAAOA,EAAM/F,KAAK6J,KAAKtC,EAAKgB,GAAQ,EACpCxC,EAAOA,EAAM/F,KAAK6J,KAAKrC,EAAKc,GAAQ,EACpCxE,EAAMA,EAAK9D,KAAK6J,KAAKrC,EAAKe,GAAQ,EAClCnG,EAAMA,EAAKpC,KAAK6J,KAAKzC,EAAKqB,GAAQ,EAClC1C,EAAOA,EAAM/F,KAAK6J,KAAKzC,EAAKsB,GAAQ,EACpC3C,EAAOA,EAAM/F,KAAK6J,KAAKxC,EAAKoB,GAAQ,EACpC3E,EAAMA,EAAK9D,KAAK6J,KAAKxC,EAAKqB,GAAQ,EAClCtG,EAAMA,EAAKpC,KAAK6J,KAAK5C,EAAK2B,GAAQ,EAClC7C,EAAOA,EAAM/F,KAAK6J,KAAK5C,EAAK4B,IAAQ,EACpC9C,EAAOA,EAAM/F,KAAK6J,KAAK3C,EAAK0B,GAAQ,EACpC9E,EAAMA,EAAK9D,KAAK6J,KAAK3C,EAAK2B,IAAQ,EAClCzG,EAAMA,EAAKpC,KAAK6J,KAAK/C,EAAKiC,IAAQ,EAClChD,EAAOA,EAAM/F,KAAK6J,KAAK/C,EAAKkC,IAAQ,EACpCjD,EAAOA,EAAM/F,KAAK6J,KAAK9C,EAAKgC,IAAQ,EACpCjF,EAAMA,EAAK9D,KAAK6J,KAAK9C,EAAKiC,IAAQ,EAClC5G,EAAMA,EAAKpC,KAAK6J,KAAKlD,EAAKuC,IAAQ,EAClCnD,EAAOA,EAAM/F,KAAK6J,KAAKlD,EAAKwC,IAAQ,EACpCpD,EAAOA,EAAM/F,KAAK6J,KAAKjD,EAAKsC,IAAQ,EACpCpF,EAAMA,EAAK9D,KAAK6J,KAAKjD,EAAKuC,IAAQ,EAClC/G,EAAMA,EAAKpC,KAAK6J,KAAKrD,EAAK6C,IAAQ,EAClCtD,EAAOA,EAAM/F,KAAK6J,KAAKrD,EAAK8C,IAAQ,EACpCvD,EAAOA,EAAM/F,KAAK6J,KAAKpD,EAAK4C,IAAQ,EACpCvF,EAAMA,EAAK9D,KAAK6J,KAAKpD,EAAK6C,IAAQ,EAClClH,EAAMA,EAAKpC,KAAK6J,KAAKxD,EAAKmD,IAAQ,EAClCzD,EAAOA,EAAM/F,KAAK6J,KAAKxD,EAAKoD,IAAQ,EACpC1D,EAAOA,EAAM/F,KAAK6J,KAAKvD,EAAKkD,IAAQ,EACpC1F,EAAMA,EAAK9D,KAAK6J,KAAKvD,EAAKmD,IAAQ,EAClCrH,EAAMA,EAAKpC,KAAK6J,KAAK3D,EAAKyD,IAAQ,EAClC5D,EAAOA,EAAM/F,KAAK6J,KAAK3D,EAAK0D,IAAQ,EACpC7D,EAAOA,EAAM/F,KAAK6J,KAAK1D,EAAKwD,IAAQ,EACpC7F,EAAMA,EAAK9D,KAAK6J,KAAK1D,EAAKyD,IAAQ,EAClC,IAAIW,IAAQvX,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACrD/S,GAAO8Q,GAAMiC,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAKpC,KAAK6J,KAAKhC,EAAKM,GACpBpC,EAAM/F,KAAK6J,KAAKhC,EAAKO,GACrBrC,EAAOA,EAAM/F,KAAK6J,KAAK/B,EAAKK,GAAQ,EACpCrE,EAAK9D,KAAK6J,KAAK/B,EAAKM,GACpBhG,EAAMA,EAAKpC,KAAK6J,KAAKnC,EAAKY,GAAQ,EAClCvC,EAAOA,EAAM/F,KAAK6J,KAAKnC,EAAKa,GAAQ,EACpCxC,EAAOA,EAAM/F,KAAK6J,KAAKlC,EAAKW,GAAQ,EACpCxE,EAAMA,EAAK9D,KAAK6J,KAAKlC,EAAKY,GAAQ,EAClCnG,EAAMA,EAAKpC,KAAK6J,KAAKtC,EAAKkB,GAAQ,EAClC1C,EAAOA,EAAM/F,KAAK6J,KAAKtC,EAAKmB,GAAQ,EACpC3C,EAAOA,EAAM/F,KAAK6J,KAAKrC,EAAKiB,GAAQ,EACpC3E,EAAMA,EAAK9D,KAAK6J,KAAKrC,EAAKkB,GAAQ,EAClCtG,EAAMA,EAAKpC,KAAK6J,KAAKzC,EAAKwB,GAAQ,EAClC7C,EAAOA,EAAM/F,KAAK6J,KAAKzC,EAAKyB,IAAQ,EACpC9C,EAAOA,EAAM/F,KAAK6J,KAAKxC,EAAKuB,GAAQ,EACpC9E,EAAMA,EAAK9D,KAAK6J,KAAKxC,EAAKwB,IAAQ,EAClCzG,EAAMA,EAAKpC,KAAK6J,KAAK5C,EAAK8B,IAAQ,EAClChD,EAAOA,EAAM/F,KAAK6J,KAAK5C,EAAK+B,IAAQ,EACpCjD,EAAOA,EAAM/F,KAAK6J,KAAK3C,EAAK6B,IAAQ,EACpCjF,EAAMA,EAAK9D,KAAK6J,KAAK3C,EAAK8B,IAAQ,EAClC5G,EAAMA,EAAKpC,KAAK6J,KAAK/C,EAAKoC,IAAQ,EAClCnD,EAAOA,EAAM/F,KAAK6J,KAAK/C,EAAKqC,IAAQ,EACpCpD,EAAOA,EAAM/F,KAAK6J,KAAK9C,EAAKmC,IAAQ,EACpCpF,EAAMA,EAAK9D,KAAK6J,KAAK9C,EAAKoC,IAAQ,EAClC/G,EAAMA,EAAKpC,KAAK6J,KAAKlD,EAAK0C,IAAQ,EAClCtD,EAAOA,EAAM/F,KAAK6J,KAAKlD,EAAK2C,IAAQ,EACpCvD,EAAOA,EAAM/F,KAAK6J,KAAKjD,EAAKyC,IAAQ,EACpCvF,EAAMA,EAAK9D,KAAK6J,KAAKjD,EAAK0C,IAAQ,EAClClH,EAAMA,EAAKpC,KAAK6J,KAAKrD,EAAKgD,IAAQ,EAClCzD,EAAOA,EAAM/F,KAAK6J,KAAKrD,EAAKiD,IAAQ,EACpC1D,EAAOA,EAAM/F,KAAK6J,KAAKpD,EAAK+C,IAAQ,EACpC1F,EAAMA,EAAK9D,KAAK6J,KAAKpD,EAAKgD,IAAQ,EAClCrH,EAAMA,EAAKpC,KAAK6J,KAAKxD,EAAKsD,IAAQ,EAClC5D,EAAOA,EAAM/F,KAAK6J,KAAKxD,EAAKuD,IAAQ,EACpC7D,EAAOA,EAAM/F,KAAK6J,KAAKvD,EAAKqD,IAAQ,EACpC7F,EAAMA,EAAK9D,KAAK6J,KAAKvD,EAAKsD,IAAQ,EAClC,IAAIY,IAASxX,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACtD/S,GAAO8Q,GAAMiC,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEPpI,EAAKpC,KAAK6J,KAAKhC,EAAKS,GACpBvC,EAAM/F,KAAK6J,KAAKhC,EAAKU,GACrBxC,EAAOA,EAAM/F,KAAK6J,KAAK/B,EAAKQ,GAAQ,EACpCxE,EAAK9D,KAAK6J,KAAK/B,EAAKS,GACpBnG,EAAMA,EAAKpC,KAAK6J,KAAKnC,EAAKe,GAAQ,EAClC1C,EAAOA,EAAM/F,KAAK6J,KAAKnC,EAAKgB,GAAQ,EACpC3C,EAAOA,EAAM/F,KAAK6J,KAAKlC,EAAKc,GAAQ,EACpC3E,EAAMA,EAAK9D,KAAK6J,KAAKlC,EAAKe,GAAQ,EAClCtG,EAAMA,EAAKpC,KAAK6J,KAAKtC,EAAKqB,GAAQ,EAClC7C,EAAOA,EAAM/F,KAAK6J,KAAKtC,EAAKsB,IAAQ,EACpC9C,EAAOA,EAAM/F,KAAK6J,KAAKrC,EAAKoB,GAAQ,EACpC9E,EAAMA,EAAK9D,KAAK6J,KAAKrC,EAAKqB,IAAQ,EAClCzG,EAAMA,EAAKpC,KAAK6J,KAAKzC,EAAK2B,IAAQ,EAClChD,EAAOA,EAAM/F,KAAK6J,KAAKzC,EAAK4B,IAAQ,EACpCjD,EAAOA,EAAM/F,KAAK6J,KAAKxC,EAAK0B,IAAQ,EACpCjF,EAAMA,EAAK9D,KAAK6J,KAAKxC,EAAK2B,IAAQ,EAClC5G,EAAMA,EAAKpC,KAAK6J,KAAK5C,EAAKiC,IAAQ,EAClCnD,EAAOA,EAAM/F,KAAK6J,KAAK5C,EAAKkC,IAAQ,EACpCpD,EAAOA,EAAM/F,KAAK6J,KAAK3C,EAAKgC,IAAQ,EACpCpF,EAAMA,EAAK9D,KAAK6J,KAAK3C,EAAKiC,IAAQ,EAClC/G,EAAMA,EAAKpC,KAAK6J,KAAK/C,EAAKuC,IAAQ,EAClCtD,EAAOA,EAAM/F,KAAK6J,KAAK/C,EAAKwC,IAAQ,EACpCvD,EAAOA,EAAM/F,KAAK6J,KAAK9C,EAAKsC,IAAQ,EACpCvF,EAAMA,EAAK9D,KAAK6J,KAAK9C,EAAKuC,IAAQ,EAClClH,EAAMA,EAAKpC,KAAK6J,KAAKlD,EAAK6C,IAAQ,EAClCzD,EAAOA,EAAM/F,KAAK6J,KAAKlD,EAAK8C,IAAQ,EACpC1D,EAAOA,EAAM/F,KAAK6J,KAAKjD,EAAK4C,IAAQ,EACpC1F,EAAMA,EAAK9D,KAAK6J,KAAKjD,EAAK6C,IAAQ,EAClCrH,EAAMA,EAAKpC,KAAK6J,KAAKrD,EAAKmD,IAAQ,EAClC5D,EAAOA,EAAM/F,KAAK6J,KAAKrD,EAAKoD,IAAQ,EACpC7D,EAAOA,EAAM/F,KAAK6J,KAAKpD,EAAKkD,IAAQ,EACpC7F,EAAMA,EAAK9D,KAAK6J,KAAKpD,EAAKmD,IAAQ,EAClC,IAAIa,IAASzX,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACtD/S,GAAO8Q,GAAMiC,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEPrI,EAAKpC,KAAK6J,KAAKhC,EAAKY,GACpB1C,EAAM/F,KAAK6J,KAAKhC,EAAKa,GACrB3C,EAAOA,EAAM/F,KAAK6J,KAAK/B,EAAKW,GAAQ,EACpC3E,EAAK9D,KAAK6J,KAAK/B,EAAKY,GACpBtG,EAAMA,EAAKpC,KAAK6J,KAAKnC,EAAKkB,GAAQ,EAClC7C,EAAOA,EAAM/F,KAAK6J,KAAKnC,EAAKmB,IAAQ,EACpC9C,EAAOA,EAAM/F,KAAK6J,KAAKlC,EAAKiB,GAAQ,EACpC9E,EAAMA,EAAK9D,KAAK6J,KAAKlC,EAAKkB,IAAQ,EAClCzG,EAAMA,EAAKpC,KAAK6J,KAAKtC,EAAKwB,IAAQ,EAClChD,EAAOA,EAAM/F,KAAK6J,KAAKtC,EAAKyB,IAAQ,EACpCjD,EAAOA,EAAM/F,KAAK6J,KAAKrC,EAAKuB,IAAQ,EACpCjF,EAAMA,EAAK9D,KAAK6J,KAAKrC,EAAKwB,IAAQ,EAClC5G,EAAMA,EAAKpC,KAAK6J,KAAKzC,EAAK8B,IAAQ,EAClCnD,EAAOA,EAAM/F,KAAK6J,KAAKzC,EAAK+B,IAAQ,EACpCpD,EAAOA,EAAM/F,KAAK6J,KAAKxC,EAAK6B,IAAQ,EACpCpF,EAAMA,EAAK9D,KAAK6J,KAAKxC,EAAK8B,IAAQ,EAClC/G,EAAMA,EAAKpC,KAAK6J,KAAK5C,EAAKoC,IAAQ,EAClCtD,EAAOA,EAAM/F,KAAK6J,KAAK5C,EAAKqC,IAAQ,EACpCvD,EAAOA,EAAM/F,KAAK6J,KAAK3C,EAAKmC,IAAQ,EACpCvF,EAAMA,EAAK9D,KAAK6J,KAAK3C,EAAKoC,IAAQ,EAClClH,EAAMA,EAAKpC,KAAK6J,KAAK/C,EAAK0C,IAAQ,EAClCzD,EAAOA,EAAM/F,KAAK6J,KAAK/C,EAAK2C,IAAQ,EACpC1D,EAAOA,EAAM/F,KAAK6J,KAAK9C,EAAKyC,IAAQ,EACpC1F,EAAMA,EAAK9D,KAAK6J,KAAK9C,EAAK0C,IAAQ,EAClCrH,EAAMA,EAAKpC,KAAK6J,KAAKlD,EAAKgD,IAAQ,EAClC5D,EAAOA,EAAM/F,KAAK6J,KAAKlD,EAAKiD,IAAQ,EACpC7D,EAAOA,EAAM/F,KAAK6J,KAAKjD,EAAK+C,IAAQ,EACpC7F,EAAMA,EAAK9D,KAAK6J,KAAKjD,EAAKgD,IAAQ,EAClC,IAAIc,IAAS1X,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACtD/S,GAAO8Q,GAAMiC,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEPtI,EAAKpC,KAAK6J,KAAKhC,EAAKe,GACpB7C,EAAM/F,KAAK6J,KAAKhC,EAAKgB,IACrB9C,EAAOA,EAAM/F,KAAK6J,KAAK/B,EAAKc,GAAQ,EACpC9E,EAAK9D,KAAK6J,KAAK/B,EAAKe,IACpBzG,EAAMA,EAAKpC,KAAK6J,KAAKnC,EAAKqB,IAAQ,EAClChD,EAAOA,EAAM/F,KAAK6J,KAAKnC,EAAKsB,IAAQ,EACpCjD,EAAOA,EAAM/F,KAAK6J,KAAKlC,EAAKoB,IAAQ,EACpCjF,EAAMA,EAAK9D,KAAK6J,KAAKlC,EAAKqB,IAAQ,EAClC5G,EAAMA,EAAKpC,KAAK6J,KAAKtC,EAAK2B,IAAQ,EAClCnD,EAAOA,EAAM/F,KAAK6J,KAAKtC,EAAK4B,IAAQ,EACpCpD,EAAOA,EAAM/F,KAAK6J,KAAKrC,EAAK0B,IAAQ,EACpCpF,EAAMA,EAAK9D,KAAK6J,KAAKrC,EAAK2B,IAAQ,EAClC/G,EAAMA,EAAKpC,KAAK6J,KAAKzC,EAAKiC,IAAQ,EAClCtD,EAAOA,EAAM/F,KAAK6J,KAAKzC,EAAKkC,IAAQ,EACpCvD,EAAOA,EAAM/F,KAAK6J,KAAKxC,EAAKgC,IAAQ,EACpCvF,EAAMA,EAAK9D,KAAK6J,KAAKxC,EAAKiC,IAAQ,EAClClH,EAAMA,EAAKpC,KAAK6J,KAAK5C,EAAKuC,IAAQ,EAClCzD,EAAOA,EAAM/F,KAAK6J,KAAK5C,EAAKwC,IAAQ,EACpC1D,EAAOA,EAAM/F,KAAK6J,KAAK3C,EAAKsC,IAAQ,EACpC1F,EAAMA,EAAK9D,KAAK6J,KAAK3C,EAAKuC,IAAQ,EAClCrH,EAAMA,EAAKpC,KAAK6J,KAAK/C,EAAK6C,IAAQ,EAClC5D,EAAOA,EAAM/F,KAAK6J,KAAK/C,EAAK8C,IAAQ,EACpC7D,EAAOA,EAAM/F,KAAK6J,KAAK9C,EAAK4C,IAAQ,EACpC7F,EAAMA,EAAK9D,KAAK6J,KAAK9C,EAAK6C,IAAQ,EAClC,IAAIe,IAAS3X,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACtD/S,GAAO8Q,GAAMiC,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEPvI,EAAKpC,KAAK6J,KAAKhC,EAAKkB,IACpBhD,EAAM/F,KAAK6J,KAAKhC,EAAKmB,IACrBjD,EAAOA,EAAM/F,KAAK6J,KAAK/B,EAAKiB,IAAQ,EACpCjF,EAAK9D,KAAK6J,KAAK/B,EAAKkB,IACpB5G,EAAMA,EAAKpC,KAAK6J,KAAKnC,EAAKwB,IAAQ,EAClCnD,EAAOA,EAAM/F,KAAK6J,KAAKnC,EAAKyB,IAAQ,EACpCpD,EAAOA,EAAM/F,KAAK6J,KAAKlC,EAAKuB,IAAQ,EACpCpF,EAAMA,EAAK9D,KAAK6J,KAAKlC,EAAKwB,IAAQ,EAClC/G,EAAMA,EAAKpC,KAAK6J,KAAKtC,EAAK8B,IAAQ,EAClCtD,EAAOA,EAAM/F,KAAK6J,KAAKtC,EAAK+B,IAAQ,EACpCvD,EAAOA,EAAM/F,KAAK6J,KAAKrC,EAAK6B,IAAQ,EACpCvF,EAAMA,EAAK9D,KAAK6J,KAAKrC,EAAK8B,IAAQ,EAClClH,EAAMA,EAAKpC,KAAK6J,KAAKzC,EAAKoC,IAAQ,EAClCzD,EAAOA,EAAM/F,KAAK6J,KAAKzC,EAAKqC,IAAQ,EACpC1D,EAAOA,EAAM/F,KAAK6J,KAAKxC,EAAKmC,IAAQ,EACpC1F,EAAMA,EAAK9D,KAAK6J,KAAKxC,EAAKoC,IAAQ,EAClCrH,EAAMA,EAAKpC,KAAK6J,KAAK5C,EAAK0C,IAAQ,EAClC5D,EAAOA,EAAM/F,KAAK6J,KAAK5C,EAAK2C,IAAQ,EACpC7D,EAAOA,EAAM/F,KAAK6J,KAAK3C,EAAKyC,IAAQ,EACpC7F,EAAMA,EAAK9D,KAAK6J,KAAK3C,EAAK0C,IAAQ,EAClC,IAAIgB,IAAS5X,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACtD/S,GAAO8Q,GAAMiC,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEPxI,EAAKpC,KAAK6J,KAAKhC,EAAKqB,IACpBnD,EAAM/F,KAAK6J,KAAKhC,EAAKsB,IACrBpD,EAAOA,EAAM/F,KAAK6J,KAAK/B,EAAKoB,IAAQ,EACpCpF,EAAK9D,KAAK6J,KAAK/B,EAAKqB,IACpB/G,EAAMA,EAAKpC,KAAK6J,KAAKnC,EAAK2B,IAAQ,EAClCtD,EAAOA,EAAM/F,KAAK6J,KAAKnC,EAAK4B,IAAQ,EACpCvD,EAAOA,EAAM/F,KAAK6J,KAAKlC,EAAK0B,IAAQ,EACpCvF,EAAMA,EAAK9D,KAAK6J,KAAKlC,EAAK2B,IAAQ,EAClClH,EAAMA,EAAKpC,KAAK6J,KAAKtC,EAAKiC,IAAQ,EAClCzD,EAAOA,EAAM/F,KAAK6J,KAAKtC,EAAKkC,IAAQ,EACpC1D,EAAOA,EAAM/F,KAAK6J,KAAKrC,EAAKgC,IAAQ,EACpC1F,EAAMA,EAAK9D,KAAK6J,KAAKrC,EAAKiC,IAAQ,EAClCrH,EAAMA,EAAKpC,KAAK6J,KAAKzC,EAAKuC,IAAQ,EAClC5D,EAAOA,EAAM/F,KAAK6J,KAAKzC,EAAKwC,IAAQ,EACpC7D,EAAOA,EAAM/F,KAAK6J,KAAKxC,EAAKsC,IAAQ,EACpC7F,EAAMA,EAAK9D,KAAK6J,KAAKxC,EAAKuC,IAAQ,EAClC,IAAIiB,IAAS7X,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACtD/S,GAAO8Q,GAAMiC,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEPzI,EAAKpC,KAAK6J,KAAKhC,EAAKwB,IACpBtD,EAAM/F,KAAK6J,KAAKhC,EAAKyB,IACrBvD,EAAOA,EAAM/F,KAAK6J,KAAK/B,EAAKuB,IAAQ,EACpCvF,EAAK9D,KAAK6J,KAAK/B,EAAKwB,IACpBlH,EAAMA,EAAKpC,KAAK6J,KAAKnC,EAAK8B,IAAQ,EAClCzD,EAAOA,EAAM/F,KAAK6J,KAAKnC,EAAK+B,IAAQ,EACpC1D,EAAOA,EAAM/F,KAAK6J,KAAKlC,EAAK6B,IAAQ,EACpC1F,EAAMA,EAAK9D,KAAK6J,KAAKlC,EAAK8B,IAAQ,EAClCrH,EAAMA,EAAKpC,KAAK6J,KAAKtC,EAAKoC,IAAQ,EAClC5D,EAAOA,EAAM/F,KAAK6J,KAAKtC,EAAKqC,IAAQ,EACpC7D,EAAOA,EAAM/F,KAAK6J,KAAKrC,EAAKmC,IAAQ,EACpC7F,EAAMA,EAAK9D,KAAK6J,KAAKrC,EAAKoC,IAAQ,EAClC,IAAIkB,IAAS9X,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACtD/S,GAAO8Q,GAAMiC,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAKpC,KAAK6J,KAAKhC,EAAK2B,IACpBzD,EAAM/F,KAAK6J,KAAKhC,EAAK4B,IACrB1D,EAAOA,EAAM/F,KAAK6J,KAAK/B,EAAK0B,IAAQ,EACpC1F,EAAK9D,KAAK6J,KAAK/B,EAAK2B,IACpBrH,EAAMA,EAAKpC,KAAK6J,KAAKnC,EAAKiC,IAAQ,EAClC5D,EAAOA,EAAM/F,KAAK6J,KAAKnC,EAAKkC,IAAQ,EACpC7D,EAAOA,EAAM/F,KAAK6J,KAAKlC,EAAKgC,IAAQ,EACpC7F,EAAMA,EAAK9D,KAAK6J,KAAKlC,EAAKiC,IAAQ,EAClC,IAAImB,IAAS/X,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EACtD/S,GAAO8Q,GAAMiC,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAEP3I,EAAKpC,KAAK6J,KAAKhC,EAAK8B,IACpB5D,EAAM/F,KAAK6J,KAAKhC,EAAK+B,IACrB7D,EAAOA,EAAM/F,KAAK6J,KAAK/B,EAAK6B,IAAQ,EACpC7F,EAAK9D,KAAK6J,KAAK/B,EAAK8B,IACpB,IAAIoB,IAAShY,EAAIoP,EAAM,KAAa,KAAN2D,IAAiB,IAAO,EA0BtD,OAzBA/S,GAAO8Q,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,IAANhY,IACFgT,EAAE,IAAMhT,EACR3G,EAAIjD,UAECiD,GAQT,SAAS4e,EAAU9I,EAAMla,EAAKoE,GAC5BA,EAAIgT,SAAWpX,EAAIoX,SAAW8C,EAAK9C,SACnChT,EAAIjD,OAAS+Y,EAAK/Y,OAASnB,EAAImB,OAI/B,IAFA,IAAIiZ,EAAQ,EACR6I,EAAU,EACL5I,EAAI,EAAGA,EAAIjW,EAAIjD,OAAS,EAAGkZ,IAAK,CAGvC,IAAIC,EAAS2I,EACbA,EAAU,EAGV,IAFA,IAAI1I,EAAgB,SAARH,EACRI,EAAOzC,KAAKC,IAAIqC,EAAGra,EAAImB,OAAS,GAC3BM,EAAIsW,KAAKE,IAAI,EAAGoC,EAAIH,EAAK/Y,OAAS,GAAIM,GAAK+Y,EAAM/Y,IAAK,CAC7D,IAAID,EAAI6Y,EAAI5Y,EACRuN,EAAoB,EAAhBkL,EAAK7C,MAAM7V,GACfyN,EAAmB,EAAfjP,EAAIqX,MAAM5V,GACdiF,EAAIsI,EAAIC,EAERkL,EAAS,SAAJzT,EACT4T,EAAUA,GAAW5T,EAAI,SAAa,GAAM,EAC5CyT,EAAMA,EAAKI,EAAS,EACpBA,EAAa,SAALJ,EACRG,EAAUA,GAAUH,IAAO,IAAO,EAElC8I,GAAW3I,IAAW,GACtBA,GAAU,SAEZlW,EAAIiT,MAAMgD,GAAKE,EACfH,EAAQE,EACRA,EAAS2I,EAQX,OANc,IAAV7I,EACFhW,EAAIiT,MAAMgD,GAAKD,EAEfhW,EAAIjD,SAGCiD,EAAIwU,QAGb,SAASsK,EAAYhJ,EAAMla,EAAKoE,GAC9B,IAAI+e,EAAO,IAAIC,EACf,OAAOD,EAAKE,KAAKnJ,EAAMla,EAAKoE,GAsB9B,SAASgf,EAAME,EAAGC,GAChBjkB,KAAKgkB,EAAIA,EACThkB,KAAKikB,EAAIA,EAvENxL,KAAK6J,OACR/D,EAAc5D,GAiDhBjD,EAAGrW,UAAU6iB,MAAQ,SAAgBxjB,EAAKoE,GACxC,IAAI7F,EACA2I,EAAM5H,KAAK6B,OAASnB,EAAImB,OAW5B,OATE5C,EADkB,KAAhBe,KAAK6B,QAAgC,KAAfnB,EAAImB,OACtB0c,EAAYve,KAAMU,EAAKoE,GACpB8C,EAAM,GACT+S,EAAW3a,KAAMU,EAAKoE,GACnB8C,EAAM,KACT8b,EAAS1jB,KAAMU,EAAKoE,GAEpB8e,EAAW5jB,KAAMU,EAAKoE,GAGvB7F,GAWT6kB,EAAKziB,UAAU8iB,QAAU,SAAkBC,GAGzC,IAFA,IAAIre,EAAI,IAAI7C,MAAMkhB,GACdC,EAAI3M,EAAGrW,UAAUgb,WAAW+H,GAAK,EAC5BliB,EAAI,EAAGA,EAAIkiB,EAAGliB,IACrB6D,EAAE7D,GAAKlC,KAAKskB,OAAOpiB,EAAGmiB,EAAGD,GAG3B,OAAOre,GAIT+d,EAAKziB,UAAUijB,OAAS,SAAiBN,EAAGK,EAAGD,GAC7C,GAAU,IAANJ,GAAWA,IAAMI,EAAI,EAAG,OAAOJ,EAGnC,IADA,IAAIO,EAAK,EACAriB,EAAI,EAAGA,EAAImiB,EAAGniB,IACrBqiB,IAAW,EAAJP,IAAWK,EAAIniB,EAAI,EAC1B8hB,IAAM,EAGR,OAAOO,GAKTT,EAAKziB,UAAUmjB,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAIliB,EAAI,EAAGA,EAAIkiB,EAAGliB,IACrB0iB,EAAK1iB,GAAKwiB,EAAID,EAAIviB,IAClB2iB,EAAK3iB,GAAKyiB,EAAIF,EAAIviB,KAItB4hB,EAAKziB,UAAUyjB,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtEzkB,KAAKwkB,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQvM,KAAKwM,IAAI,EAAIxM,KAAKyM,GAAKb,GAC/Bc,EAAQ1M,KAAK2M,IAAI,EAAI3M,KAAKyM,GAAKb,GAE1B9P,EAAI,EAAGA,EAAI6P,EAAG7P,GAAK8P,EAI1B,IAHA,IAAIgB,EAASL,EACTM,EAASH,EAEJhjB,EAAI,EAAGA,EAAI4iB,EAAG5iB,IAAK,CAC1B,IAAI8U,EAAK2N,EAAKrQ,EAAIpS,GACdojB,EAAKV,EAAKtQ,EAAIpS,GAEdqjB,EAAKZ,EAAKrQ,EAAIpS,EAAI4iB,GAClBU,EAAKZ,EAAKtQ,EAAIpS,EAAI4iB,GAElBW,EAAKL,EAASG,EAAKF,EAASG,EAEhCA,EAAKJ,EAASI,EAAKH,EAASE,EAC5BA,EAAKE,EAELd,EAAKrQ,EAAIpS,GAAK8U,EAAKuO,EACnBX,EAAKtQ,EAAIpS,GAAKojB,EAAKE,EAEnBb,EAAKrQ,EAAIpS,EAAI4iB,GAAK9N,EAAKuO,EACvBX,EAAKtQ,EAAIpS,EAAI4iB,GAAKQ,EAAKE,EAGnBtjB,IAAMkiB,IACRqB,EAAKV,EAAQK,EAASF,EAAQG,EAE9BA,EAASN,EAAQM,EAASH,EAAQE,EAClCA,EAASK,KAOnB5B,EAAKziB,UAAUskB,YAAc,SAAsBC,EAAGC,GACpD,IAAIzB,EAAqB,EAAjB3L,KAAKE,IAAIkN,EAAGD,GAChBE,EAAU,EAAJ1B,EACNliB,EAAI,EACR,IAAKkiB,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/BliB,IAGF,OAAO,GAAKA,EAAI,EAAI4jB,GAGtBhC,EAAKziB,UAAU0kB,UAAY,SAAoBrB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAIliB,EAAI,EAAGA,EAAIkiB,EAAI,EAAGliB,IAAK,CAC9B,IAAI6D,EAAI2e,EAAIxiB,GAEZwiB,EAAIxiB,GAAKwiB,EAAIN,EAAIliB,EAAI,GACrBwiB,EAAIN,EAAIliB,EAAI,GAAK6D,EAEjBA,EAAI4e,EAAIziB,GAERyiB,EAAIziB,IAAMyiB,EAAIP,EAAIliB,EAAI,GACtByiB,EAAIP,EAAIliB,EAAI,IAAM6D,IAItB+d,EAAKziB,UAAU2kB,aAAe,SAAuBC,EAAI7B,GAEvD,IADA,IAAItJ,EAAQ,EACH5Y,EAAI,EAAGA,EAAIkiB,EAAI,EAAGliB,IAAK,CAC9B,IAAIkX,EAAoC,KAAhCX,KAAKyN,MAAMD,EAAG,EAAI/jB,EAAI,GAAKkiB,GACjC3L,KAAKyN,MAAMD,EAAG,EAAI/jB,GAAKkiB,GACvBtJ,EAEFmL,EAAG/jB,GAAS,SAAJkX,EAGN0B,EADE1B,EAAI,SACE,EAEAA,EAAI,SAAY,EAI5B,OAAO6M,GAGTnC,EAAKziB,UAAU8kB,WAAa,SAAqBF,EAAIre,EAAK8c,EAAKN,GAE7D,IADA,IAAItJ,EAAQ,EACH5Y,EAAI,EAAGA,EAAI0F,EAAK1F,IACvB4Y,GAAyB,EAARmL,EAAG/jB,GAEpBwiB,EAAI,EAAIxiB,GAAa,KAAR4Y,EAAgBA,KAAkB,GAC/C4J,EAAI,EAAIxiB,EAAI,GAAa,KAAR4Y,EAAgBA,KAAkB,GAIrD,IAAK5Y,EAAI,EAAI0F,EAAK1F,EAAIkiB,IAAKliB,EACzBwiB,EAAIxiB,GAAK,EAGXuO,EAAiB,IAAVqK,GACPrK,EAA6B,MAAb,KAARqK,KAGVgJ,EAAKziB,UAAU+kB,KAAO,SAAehC,GAEnC,IADA,IAAIiC,EAAK,IAAInjB,MAAMkhB,GACVliB,EAAI,EAAGA,EAAIkiB,EAAGliB,IACrBmkB,EAAGnkB,GAAK,EAGV,OAAOmkB,GAGTvC,EAAKziB,UAAU0iB,KAAO,SAAeC,EAAGC,EAAGnf,GACzC,IAAIsf,EAAI,EAAIpkB,KAAK2lB,YAAY3B,EAAEniB,OAAQoiB,EAAEpiB,QAErC4iB,EAAMzkB,KAAKmkB,QAAQC,GAEnBkC,EAAItmB,KAAKomB,KAAKhC,GAEdM,EAAM,IAAIxhB,MAAMkhB,GAChBmC,EAAO,IAAIrjB,MAAMkhB,GACjBoC,EAAO,IAAItjB,MAAMkhB,GAEjBqC,EAAO,IAAIvjB,MAAMkhB,GACjBsC,EAAQ,IAAIxjB,MAAMkhB,GAClBuC,EAAQ,IAAIzjB,MAAMkhB,GAElBwC,EAAO9hB,EAAIiT,MACf6O,EAAK/kB,OAASuiB,EAEdpkB,KAAKmmB,WAAWnC,EAAEjM,MAAOiM,EAAEniB,OAAQ6iB,EAAKN,GACxCpkB,KAAKmmB,WAAWlC,EAAElM,MAAOkM,EAAEpiB,OAAQ4kB,EAAMrC,GAEzCpkB,KAAK8kB,UAAUJ,EAAK4B,EAAGC,EAAMC,EAAMpC,EAAGK,GACtCzkB,KAAK8kB,UAAU2B,EAAMH,EAAGI,EAAOC,EAAOvC,EAAGK,GAEzC,IAAK,IAAIviB,EAAI,EAAGA,EAAIkiB,EAAGliB,IAAK,CAC1B,IAAIwjB,EAAKa,EAAKrkB,GAAKwkB,EAAMxkB,GAAKskB,EAAKtkB,GAAKykB,EAAMzkB,GAC9CskB,EAAKtkB,GAAKqkB,EAAKrkB,GAAKykB,EAAMzkB,GAAKskB,EAAKtkB,GAAKwkB,EAAMxkB,GAC/CqkB,EAAKrkB,GAAKwjB,EAUZ,OAPA1lB,KAAK+lB,UAAUQ,EAAMC,EAAMpC,GAC3BpkB,KAAK8kB,UAAUyB,EAAMC,EAAMI,EAAMN,EAAGlC,EAAGK,GACvCzkB,KAAK+lB,UAAUa,EAAMN,EAAGlC,GACxBpkB,KAAKgmB,aAAaY,EAAMxC,GAExBtf,EAAIgT,SAAWkM,EAAElM,SAAWmM,EAAEnM,SAC9BhT,EAAIjD,OAASmiB,EAAEniB,OAASoiB,EAAEpiB,OACnBiD,EAAIwU,SAIb5B,EAAGrW,UAAUmX,IAAM,SAAc9X,GAC/B,IAAIoE,EAAM,IAAI4S,EAAG,MAEjB,OADA5S,EAAIiT,MAAQ,IAAI7U,MAAMlD,KAAK6B,OAASnB,EAAImB,QACjC7B,KAAKkkB,MAAMxjB,EAAKoE,IAIzB4S,EAAGrW,UAAUwlB,KAAO,SAAenmB,GACjC,IAAIoE,EAAM,IAAI4S,EAAG,MAEjB,OADA5S,EAAIiT,MAAQ,IAAI7U,MAAMlD,KAAK6B,OAASnB,EAAImB,QACjC+hB,EAAW5jB,KAAMU,EAAKoE,IAI/B4S,EAAGrW,UAAUihB,KAAO,SAAe5hB,GACjC,OAAOV,KAAK2R,QAAQuS,MAAMxjB,EAAKV,OAGjC0X,EAAGrW,UAAUwY,MAAQ,SAAgBnZ,GACnC+P,EAAsB,kBAAR/P,GACd+P,EAAO/P,EAAM,UAIb,IADA,IAAIoa,EAAQ,EACH5Y,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAAK,CACpC,IAAIkX,GAAqB,EAAhBpZ,KAAK+X,MAAM7V,IAAUxB,EAC1Bma,GAAU,SAAJzB,IAA0B,SAAR0B,GAC5BA,IAAU,GACVA,GAAU1B,EAAI,SAAa,EAE3B0B,GAASD,IAAO,GAChB7a,KAAK+X,MAAM7V,GAAU,SAAL2Y,EAQlB,OALc,IAAVC,IACF9a,KAAK+X,MAAM7V,GAAK4Y,EAChB9a,KAAK6B,UAGA7B,MAGT0X,EAAGrW,UAAUylB,KAAO,SAAepmB,GACjC,OAAOV,KAAK2R,QAAQkI,MAAMnZ,IAI5BgX,EAAGrW,UAAU0lB,IAAM,WACjB,OAAO/mB,KAAKwY,IAAIxY,OAIlB0X,EAAGrW,UAAU2lB,KAAO,WAClB,OAAOhnB,KAAKsiB,KAAKtiB,KAAK2R,UAIxB+F,EAAGrW,UAAU0Y,IAAM,SAAcrZ,GAC/B,IAAI0Y,EAAImB,EAAW7Z,GACnB,GAAiB,IAAb0Y,EAAEvX,OAAc,OAAO,IAAI6V,EAAG,GAIlC,IADA,IAAIzY,EAAMe,KACDkC,EAAI,EAAGA,EAAIkX,EAAEvX,OAAQK,IAAKjD,EAAMA,EAAI8nB,MAC3C,GAAa,IAAT3N,EAAElX,GAAU,MAGlB,KAAMA,EAAIkX,EAAEvX,OACV,IAAK,IAAIoa,EAAIhd,EAAI8nB,MAAO7kB,EAAIkX,EAAEvX,OAAQK,IAAK+Z,EAAIA,EAAE8K,MAClC,IAAT3N,EAAElX,KAENjD,EAAMA,EAAIuZ,IAAIyD,IAIlB,OAAOhd,GAITyY,EAAGrW,UAAU4lB,OAAS,SAAiBC,GACrCzW,EAAuB,kBAATyW,GAAqBA,GAAQ,GAC3C,IAGIhlB,EAHAkF,EAAI8f,EAAO,GACXnC,GAAKmC,EAAO9f,GAAK,GACjB+f,EAAa,WAAe,GAAK/f,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAI0T,EAAQ,EAEZ,IAAK5Y,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAAK,CAChC,IAAIklB,EAAWpnB,KAAK+X,MAAM7V,GAAKilB,EAC3B1b,GAAsB,EAAhBzL,KAAK+X,MAAM7V,IAAUklB,GAAahgB,EAC5CpH,KAAK+X,MAAM7V,GAAKuJ,EAAIqP,EACpBA,EAAQsM,IAAc,GAAKhgB,EAGzB0T,IACF9a,KAAK+X,MAAM7V,GAAK4Y,EAChB9a,KAAK6B,UAIT,GAAU,IAANkjB,EAAS,CACX,IAAK7iB,EAAIlC,KAAK6B,OAAS,EAAGK,GAAK,EAAGA,IAChClC,KAAK+X,MAAM7V,EAAI6iB,GAAK/kB,KAAK+X,MAAM7V,GAGjC,IAAKA,EAAI,EAAGA,EAAI6iB,EAAG7iB,IACjBlC,KAAK+X,MAAM7V,GAAK,EAGlBlC,KAAK6B,QAAUkjB,EAGjB,OAAO/kB,KAAKsZ,SAGd5B,EAAGrW,UAAUgmB,MAAQ,SAAgBH,GAGnC,OADAzW,EAAyB,IAAlBzQ,KAAK8X,UACL9X,KAAKinB,OAAOC,IAMrBxP,EAAGrW,UAAU8a,OAAS,SAAiB+K,EAAMI,EAAMC,GAEjD,IAAIC,EADJ/W,EAAuB,kBAATyW,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAIlgB,EAAI8f,EAAO,GACXnC,EAAItM,KAAKC,KAAKwO,EAAO9f,GAAK,GAAIpH,KAAK6B,QACnC4lB,EAAO,SAAc,WAAcrgB,GAAMA,EACzCsgB,EAAcH,EAMlB,GAJAC,GAAKzC,EACLyC,EAAI/O,KAAKE,IAAI,EAAG6O,GAGZE,EAAa,CACf,IAAK,IAAIxlB,EAAI,EAAGA,EAAI6iB,EAAG7iB,IACrBwlB,EAAY3P,MAAM7V,GAAKlC,KAAK+X,MAAM7V,GAEpCwlB,EAAY7lB,OAASkjB,EAGvB,GAAU,IAANA,QAEG,GAAI/kB,KAAK6B,OAASkjB,EAEvB,IADA/kB,KAAK6B,QAAUkjB,EACV7iB,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAC3BlC,KAAK+X,MAAM7V,GAAKlC,KAAK+X,MAAM7V,EAAI6iB,QAGjC/kB,KAAK+X,MAAM,GAAK,EAChB/X,KAAK6B,OAAS,EAGhB,IAAIiZ,EAAQ,EACZ,IAAK5Y,EAAIlC,KAAK6B,OAAS,EAAGK,GAAK,IAAgB,IAAV4Y,GAAe5Y,GAAKslB,GAAItlB,IAAK,CAChE,IAAI0X,EAAuB,EAAhB5Z,KAAK+X,MAAM7V,GACtBlC,KAAK+X,MAAM7V,GAAM4Y,GAAU,GAAK1T,EAAOwS,IAASxS,EAChD0T,EAAQlB,EAAO6N,EAajB,OATIC,GAAyB,IAAV5M,IACjB4M,EAAY3P,MAAM2P,EAAY7lB,UAAYiZ,GAGxB,IAAhB9a,KAAK6B,SACP7B,KAAK+X,MAAM,GAAK,EAChB/X,KAAK6B,OAAS,GAGT7B,KAAKsZ,SAGd5B,EAAGrW,UAAUsmB,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADA9W,EAAyB,IAAlBzQ,KAAK8X,UACL9X,KAAKmc,OAAO+K,EAAMI,EAAMC,IAIjC7P,EAAGrW,UAAUumB,KAAO,SAAeV,GACjC,OAAOlnB,KAAK2R,QAAQ0V,MAAMH,IAG5BxP,EAAGrW,UAAUwmB,MAAQ,SAAgBX,GACnC,OAAOlnB,KAAK2R,QAAQsV,OAAOC,IAI7BxP,EAAGrW,UAAUymB,KAAO,SAAeZ,GACjC,OAAOlnB,KAAK2R,QAAQgW,MAAMT,IAG5BxP,EAAGrW,UAAU0mB,MAAQ,SAAgBb,GACnC,OAAOlnB,KAAK2R,QAAQwK,OAAO+K,IAI7BxP,EAAGrW,UAAU0b,MAAQ,SAAgBtC,GACnChK,EAAsB,kBAARgK,GAAoBA,GAAO,GACzC,IAAIrT,EAAIqT,EAAM,GACVsK,GAAKtK,EAAMrT,GAAK,GAChB6U,EAAI,GAAK7U,EAGb,GAAIpH,KAAK6B,QAAUkjB,EAAG,OAAO,EAG7B,IAAI3L,EAAIpZ,KAAK+X,MAAMgN,GAEnB,SAAU3L,EAAI6C,IAIhBvE,EAAGrW,UAAU2mB,OAAS,SAAiBd,GACrCzW,EAAuB,kBAATyW,GAAqBA,GAAQ,GAC3C,IAAI9f,EAAI8f,EAAO,GACXnC,GAAKmC,EAAO9f,GAAK,GAIrB,GAFAqJ,EAAyB,IAAlBzQ,KAAK8X,SAAgB,2CAExB9X,KAAK6B,QAAUkjB,EACjB,OAAO/kB,KAQT,GALU,IAANoH,GACF2d,IAEF/kB,KAAK6B,OAAS4W,KAAKC,IAAIqM,EAAG/kB,KAAK6B,QAErB,IAANuF,EAAS,CACX,IAAIqgB,EAAO,SAAc,WAAcrgB,GAAMA,EAC7CpH,KAAK+X,MAAM/X,KAAK6B,OAAS,IAAM4lB,EAGjC,OAAOznB,KAAKsZ,SAId5B,EAAGrW,UAAU4mB,MAAQ,SAAgBf,GACnC,OAAOlnB,KAAK2R,QAAQqW,OAAOd,IAI7BxP,EAAGrW,UAAUwb,MAAQ,SAAgBnc,GAGnC,OAFA+P,EAAsB,kBAAR/P,GACd+P,EAAO/P,EAAM,UACTA,EAAM,EAAUV,KAAKkoB,OAAOxnB,GAGV,IAAlBV,KAAK8X,SACa,IAAhB9X,KAAK6B,SAAiC,EAAhB7B,KAAK+X,MAAM,IAAUrX,GAC7CV,KAAK+X,MAAM,GAAKrX,GAAuB,EAAhBV,KAAK+X,MAAM,IAClC/X,KAAK8X,SAAW,EACT9X,OAGTA,KAAK8X,SAAW,EAChB9X,KAAKkoB,MAAMxnB,GACXV,KAAK8X,SAAW,EACT9X,MAIFA,KAAK8Z,OAAOpZ,IAGrBgX,EAAGrW,UAAUyY,OAAS,SAAiBpZ,GACrCV,KAAK+X,MAAM,IAAMrX,EAGjB,IAAK,IAAIwB,EAAI,EAAGA,EAAIlC,KAAK6B,QAAU7B,KAAK+X,MAAM7V,IAAM,SAAWA,IAC7DlC,KAAK+X,MAAM7V,IAAM,SACbA,IAAMlC,KAAK6B,OAAS,EACtB7B,KAAK+X,MAAM7V,EAAI,GAAK,EAEpBlC,KAAK+X,MAAM7V,EAAI,KAKnB,OAFAlC,KAAK6B,OAAS4W,KAAKE,IAAI3Y,KAAK6B,OAAQK,EAAI,GAEjClC,MAIT0X,EAAGrW,UAAU6mB,MAAQ,SAAgBxnB,GAGnC,GAFA+P,EAAsB,kBAAR/P,GACd+P,EAAO/P,EAAM,UACTA,EAAM,EAAG,OAAOV,KAAK6c,OAAOnc,GAEhC,GAAsB,IAAlBV,KAAK8X,SAIP,OAHA9X,KAAK8X,SAAW,EAChB9X,KAAK6c,MAAMnc,GACXV,KAAK8X,SAAW,EACT9X,KAKT,GAFAA,KAAK+X,MAAM,IAAMrX,EAEG,IAAhBV,KAAK6B,QAAgB7B,KAAK+X,MAAM,GAAK,EACvC/X,KAAK+X,MAAM,IAAM/X,KAAK+X,MAAM,GAC5B/X,KAAK8X,SAAW,OAGhB,IAAK,IAAI5V,EAAI,EAAGA,EAAIlC,KAAK6B,QAAU7B,KAAK+X,MAAM7V,GAAK,EAAGA,IACpDlC,KAAK+X,MAAM7V,IAAM,SACjBlC,KAAK+X,MAAM7V,EAAI,IAAM,EAIzB,OAAOlC,KAAKsZ,SAGd5B,EAAGrW,UAAU8mB,KAAO,SAAeznB,GACjC,OAAOV,KAAK2R,QAAQkL,MAAMnc,IAG5BgX,EAAGrW,UAAU+mB,KAAO,SAAe1nB,GACjC,OAAOV,KAAK2R,QAAQuW,MAAMxnB,IAG5BgX,EAAGrW,UAAUgnB,KAAO,WAGlB,OAFAroB,KAAK8X,SAAW,EAET9X,MAGT0X,EAAGrW,UAAUsb,IAAM,WACjB,OAAO3c,KAAK2R,QAAQ0W,QAGtB3Q,EAAGrW,UAAUinB,aAAe,SAAuB5nB,EAAK8X,EAAK+P,GAC3D,IACIrmB,EAIAkX,EALAxR,EAAMlH,EAAImB,OAAS0mB,EAGvBvoB,KAAKia,QAAQrS,GAGb,IAAIkT,EAAQ,EACZ,IAAK5Y,EAAI,EAAGA,EAAIxB,EAAImB,OAAQK,IAAK,CAC/BkX,GAA6B,EAAxBpZ,KAAK+X,MAAM7V,EAAIqmB,IAAczN,EAClC,IAAIjC,GAAwB,EAAfnY,EAAIqX,MAAM7V,IAAUsW,EACjCY,GAAa,SAARP,EACLiC,GAAS1B,GAAK,KAAQP,EAAQ,SAAa,GAC3C7Y,KAAK+X,MAAM7V,EAAIqmB,GAAa,SAAJnP,EAE1B,KAAOlX,EAAIlC,KAAK6B,OAAS0mB,EAAOrmB,IAC9BkX,GAA6B,EAAxBpZ,KAAK+X,MAAM7V,EAAIqmB,IAAczN,EAClCA,EAAQ1B,GAAK,GACbpZ,KAAK+X,MAAM7V,EAAIqmB,GAAa,SAAJnP,EAG1B,GAAc,IAAV0B,EAAa,OAAO9a,KAAKsZ,QAK7B,IAFA7I,GAAkB,IAAXqK,GACPA,EAAQ,EACH5Y,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAC3BkX,IAAsB,EAAhBpZ,KAAK+X,MAAM7V,IAAU4Y,EAC3BA,EAAQ1B,GAAK,GACbpZ,KAAK+X,MAAM7V,GAAS,SAAJkX,EAIlB,OAFApZ,KAAK8X,SAAW,EAET9X,KAAKsZ,SAGd5B,EAAGrW,UAAUmnB,SAAW,SAAmB9nB,EAAK+nB,GAC9C,IAAIF,EAAQvoB,KAAK6B,OAASnB,EAAImB,OAE1B6N,EAAI1P,KAAK2R,QACThC,EAAIjP,EAGJgoB,EAA8B,EAAxB/Y,EAAEoI,MAAMpI,EAAE9N,OAAS,GACzB8mB,EAAU3oB,KAAKqc,WAAWqM,GAC9BH,EAAQ,GAAKI,EACC,IAAVJ,IACF5Y,EAAIA,EAAEkY,MAAMU,GACZ7Y,EAAEuX,OAAOsB,GACTG,EAA8B,EAAxB/Y,EAAEoI,MAAMpI,EAAE9N,OAAS,IAI3B,IACIoa,EADA4J,EAAInW,EAAE7N,OAAS8N,EAAE9N,OAGrB,GAAa,QAAT4mB,EAAgB,CAClBxM,EAAI,IAAIvE,EAAG,MACXuE,EAAEpa,OAASgkB,EAAI,EACf5J,EAAElE,MAAQ,IAAI7U,MAAM+Y,EAAEpa,QACtB,IAAK,IAAIK,EAAI,EAAGA,EAAI+Z,EAAEpa,OAAQK,IAC5B+Z,EAAElE,MAAM7V,GAAK,EAIjB,IAAI0mB,EAAOlZ,EAAEiC,QAAQ2W,aAAa3Y,EAAG,EAAGkW,GAClB,IAAlB+C,EAAK9Q,WACPpI,EAAIkZ,EACA3M,IACFA,EAAElE,MAAM8N,GAAK,IAIjB,IAAK,IAAI1jB,EAAI0jB,EAAI,EAAG1jB,GAAK,EAAGA,IAAK,CAC/B,IAAI0mB,EAAmC,UAAL,EAAxBnZ,EAAEqI,MAAMpI,EAAE9N,OAASM,KACE,EAA5BuN,EAAEqI,MAAMpI,EAAE9N,OAASM,EAAI,IAI1B0mB,EAAKpQ,KAAKC,IAAKmQ,EAAKH,EAAO,EAAG,UAE9BhZ,EAAE4Y,aAAa3Y,EAAGkZ,EAAI1mB,GACtB,MAAsB,IAAfuN,EAAEoI,SACP+Q,IACAnZ,EAAEoI,SAAW,EACbpI,EAAE4Y,aAAa3Y,EAAG,EAAGxN,GAChBuN,EAAE4L,WACL5L,EAAEoI,UAAY,GAGdmE,IACFA,EAAElE,MAAM5V,GAAK0mB,GAajB,OAVI5M,GACFA,EAAE3C,QAEJ5J,EAAE4J,QAGW,QAATmP,GAA4B,IAAVF,GACpB7Y,EAAEyM,OAAOoM,GAGJ,CACLO,IAAK7M,GAAK,KACVtC,IAAKjK,IAQTgI,EAAGrW,UAAU0nB,OAAS,SAAiBroB,EAAK+nB,EAAMO,GAGhD,OAFAvY,GAAQ/P,EAAI4a,UAERtb,KAAKsb,SACA,CACLwN,IAAK,IAAIpR,EAAG,GACZiC,IAAK,IAAIjC,EAAG,IAKM,IAAlB1X,KAAK8X,UAAmC,IAAjBpX,EAAIoX,UAC7B7Y,EAAMe,KAAKmd,MAAM4L,OAAOroB,EAAK+nB,GAEhB,QAATA,IACFK,EAAM7pB,EAAI6pB,IAAI3L,OAGH,QAATsL,IACF9O,EAAM1a,EAAI0a,IAAIwD,MACV6L,GAA6B,IAAjBrP,EAAI7B,UAClB6B,EAAIwE,KAAKzd,IAIN,CACLooB,IAAKA,EACLnP,IAAKA,IAIa,IAAlB3Z,KAAK8X,UAAmC,IAAjBpX,EAAIoX,UAC7B7Y,EAAMe,KAAK+oB,OAAOroB,EAAIyc,MAAOsL,GAEhB,QAATA,IACFK,EAAM7pB,EAAI6pB,IAAI3L,OAGT,CACL2L,IAAKA,EACLnP,IAAK1a,EAAI0a,MAI0B,KAAlC3Z,KAAK8X,SAAWpX,EAAIoX,WACvB7Y,EAAMe,KAAKmd,MAAM4L,OAAOroB,EAAIyc,MAAOsL,GAEtB,QAATA,IACF9O,EAAM1a,EAAI0a,IAAIwD,MACV6L,GAA6B,IAAjBrP,EAAI7B,UAClB6B,EAAIyE,KAAK1d,IAIN,CACLooB,IAAK7pB,EAAI6pB,IACTnP,IAAKA,IAOLjZ,EAAImB,OAAS7B,KAAK6B,QAAU7B,KAAK8Y,IAAIpY,GAAO,EACvC,CACLooB,IAAK,IAAIpR,EAAG,GACZiC,IAAK3Z,MAKU,IAAfU,EAAImB,OACO,QAAT4mB,EACK,CACLK,IAAK9oB,KAAKipB,KAAKvoB,EAAIqX,MAAM,IACzB4B,IAAK,MAII,QAAT8O,EACK,CACLK,IAAK,KACLnP,IAAK,IAAIjC,EAAG1X,KAAKub,KAAK7a,EAAIqX,MAAM,MAI7B,CACL+Q,IAAK9oB,KAAKipB,KAAKvoB,EAAIqX,MAAM,IACzB4B,IAAK,IAAIjC,EAAG1X,KAAKub,KAAK7a,EAAIqX,MAAM,MAI7B/X,KAAKwoB,SAAS9nB,EAAK+nB,GAlF1B,IAAIK,EAAKnP,EAAK1a,GAsFhByY,EAAGrW,UAAUynB,IAAM,SAAcpoB,GAC/B,OAAOV,KAAK+oB,OAAOroB,EAAK,OAAO,GAAOooB,KAIxCpR,EAAGrW,UAAUsY,IAAM,SAAcjZ,GAC/B,OAAOV,KAAK+oB,OAAOroB,EAAK,OAAO,GAAOiZ,KAGxCjC,EAAGrW,UAAU6nB,KAAO,SAAexoB,GACjC,OAAOV,KAAK+oB,OAAOroB,EAAK,OAAO,GAAMiZ,KAIvCjC,EAAGrW,UAAU8nB,SAAW,SAAmBzoB,GACzC,IAAI0oB,EAAKppB,KAAK+oB,OAAOroB,GAGrB,GAAI0oB,EAAGzP,IAAI2B,SAAU,OAAO8N,EAAGN,IAE/B,IAAInP,EAA0B,IAApByP,EAAGN,IAAIhR,SAAiBsR,EAAGzP,IAAIyE,KAAK1d,GAAO0oB,EAAGzP,IAEpD0P,EAAO3oB,EAAIqnB,MAAM,GACjBuB,EAAK5oB,EAAIwb,MAAM,GACfpD,EAAMa,EAAIb,IAAIuQ,GAGlB,OAAIvQ,EAAM,GAAY,IAAPwQ,GAAoB,IAARxQ,EAAkBsQ,EAAGN,IAGrB,IAApBM,EAAGN,IAAIhR,SAAiBsR,EAAGN,IAAIZ,MAAM,GAAKkB,EAAGN,IAAIjM,MAAM,IAGhEnF,EAAGrW,UAAUka,KAAO,SAAe7a,GACjC+P,EAAO/P,GAAO,UAId,IAHA,IAAI6T,GAAK,GAAK,IAAM7T,EAEhB6oB,EAAM,EACDrnB,EAAIlC,KAAK6B,OAAS,EAAGK,GAAK,EAAGA,IACpCqnB,GAAOhV,EAAIgV,GAAuB,EAAhBvpB,KAAK+X,MAAM7V,KAAWxB,EAG1C,OAAO6oB,GAIT7R,EAAGrW,UAAUma,MAAQ,SAAgB9a,GACnC+P,EAAO/P,GAAO,UAGd,IADA,IAAIoa,EAAQ,EACH5Y,EAAIlC,KAAK6B,OAAS,EAAGK,GAAK,EAAGA,IAAK,CACzC,IAAIkX,GAAqB,EAAhBpZ,KAAK+X,MAAM7V,IAAkB,SAAR4Y,EAC9B9a,KAAK+X,MAAM7V,GAAMkX,EAAI1Y,EAAO,EAC5Boa,EAAQ1B,EAAI1Y,EAGd,OAAOV,KAAKsZ,SAGd5B,EAAGrW,UAAU4nB,KAAO,SAAevoB,GACjC,OAAOV,KAAK2R,QAAQ6J,MAAM9a,IAG5BgX,EAAGrW,UAAUmoB,KAAO,SAAejV,GACjC9D,EAAsB,IAAf8D,EAAEuD,UACTrH,GAAQ8D,EAAE+G,UAEV,IAAI0I,EAAIhkB,KACJikB,EAAI1P,EAAE5C,QAGRqS,EADiB,IAAfA,EAAElM,SACAkM,EAAEkF,KAAK3U,GAEPyP,EAAErS,QAIR,IAAI8X,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,EAAEtS,QACPqY,EAAKhG,EAAErS,QAEX,OAAQqS,EAAE1I,SAAU,CAClB,IAAK,IAAIpZ,EAAI,EAAG+nB,EAAK,EAAyB,KAArBjG,EAAEjM,MAAM,GAAKkS,IAAa/nB,EAAI,KAAMA,EAAG+nB,IAAO,GACvE,GAAI/nB,EAAI,EAAG,CACT8hB,EAAE7H,OAAOja,GACT,MAAOA,KAAM,GACPunB,EAAES,SAAWR,EAAEQ,WACjBT,EAAEtL,KAAK4L,GACPL,EAAEtL,KAAK4L,IAGTP,EAAEtN,OAAO,GACTuN,EAAEvN,OAAO,GAIb,IAAK,IAAIha,EAAI,EAAGgoB,EAAK,EAAyB,KAArBlG,EAAElM,MAAM,GAAKoS,IAAahoB,EAAI,KAAMA,EAAGgoB,IAAO,GACvE,GAAIhoB,EAAI,EAAG,CACT8hB,EAAE9H,OAAOha,GACT,MAAOA,KAAM,GACPwnB,EAAEO,SAAWN,EAAEM,WACjBP,EAAExL,KAAK4L,GACPH,EAAExL,KAAK4L,IAGTL,EAAExN,OAAO,GACTyN,EAAEzN,OAAO,GAIT6H,EAAElL,IAAImL,IAAM,GACdD,EAAE5F,KAAK6F,GACPwF,EAAErL,KAAKuL,GACPD,EAAEtL,KAAKwL,KAEP3F,EAAE7F,KAAK4F,GACP2F,EAAEvL,KAAKqL,GACPG,EAAExL,KAAKsL,IAIX,MAAO,CACLha,EAAGia,EACHha,EAAGia,EACHQ,IAAKnG,EAAEgD,OAAO4C,KAOlBnS,EAAGrW,UAAUgpB,OAAS,SAAiB9V,GACrC9D,EAAsB,IAAf8D,EAAEuD,UACTrH,GAAQ8D,EAAE+G,UAEV,IAAI5L,EAAI1P,KACJ2P,EAAI4E,EAAE5C,QAGRjC,EADiB,IAAfA,EAAEoI,SACApI,EAAEwZ,KAAK3U,GAEP7E,EAAEiC,QAGR,IAuCI1S,EAvCAqrB,EAAK,IAAI5S,EAAG,GACZ6S,EAAK,IAAI7S,EAAG,GAEZ8S,EAAQ7a,EAAEgC,QAEd,MAAOjC,EAAE+a,KAAK,GAAK,GAAK9a,EAAE8a,KAAK,GAAK,EAAG,CACrC,IAAK,IAAIvoB,EAAI,EAAG+nB,EAAK,EAAyB,KAArBva,EAAEqI,MAAM,GAAKkS,IAAa/nB,EAAI,KAAMA,EAAG+nB,IAAO,GACvE,GAAI/nB,EAAI,EAAG,CACTwN,EAAEyM,OAAOja,GACT,MAAOA,KAAM,EACPooB,EAAGJ,SACLI,EAAGnM,KAAKqM,GAGVF,EAAGnO,OAAO,GAId,IAAK,IAAIha,EAAI,EAAGgoB,EAAK,EAAyB,KAArBxa,EAAEoI,MAAM,GAAKoS,IAAahoB,EAAI,KAAMA,EAAGgoB,IAAO,GACvE,GAAIhoB,EAAI,EAAG,CACTwN,EAAEwM,OAAOha,GACT,MAAOA,KAAM,EACPooB,EAAGL,SACLK,EAAGpM,KAAKqM,GAGVD,EAAGpO,OAAO,GAIVzM,EAAEoJ,IAAInJ,IAAM,GACdD,EAAE0O,KAAKzO,GACP2a,EAAGlM,KAAKmM,KAER5a,EAAEyO,KAAK1O,GACP6a,EAAGnM,KAAKkM,IAeZ,OATErrB,EADgB,IAAdyQ,EAAE+a,KAAK,GACHH,EAEAC,EAGJtrB,EAAIwrB,KAAK,GAAK,GAChBxrB,EAAIkf,KAAK5J,GAGJtV,GAGTyY,EAAGrW,UAAU+oB,IAAM,SAAc1pB,GAC/B,GAAIV,KAAKsb,SAAU,OAAO5a,EAAIic,MAC9B,GAAIjc,EAAI4a,SAAU,OAAOtb,KAAK2c,MAE9B,IAAIjN,EAAI1P,KAAK2R,QACThC,EAAIjP,EAAIiR,QACZjC,EAAEoI,SAAW,EACbnI,EAAEmI,SAAW,EAGb,IAAK,IAAIyQ,EAAQ,EAAG7Y,EAAEoa,UAAYna,EAAEma,SAAUvB,IAC5C7Y,EAAEyM,OAAO,GACTxM,EAAEwM,OAAO,GAGX,EAAG,CACD,MAAOzM,EAAEoa,SACPpa,EAAEyM,OAAO,GAEX,MAAOxM,EAAEma,SACPna,EAAEwM,OAAO,GAGX,IAAI/U,EAAIsI,EAAEoJ,IAAInJ,GACd,GAAIvI,EAAI,EAAG,CAET,IAAIrB,EAAI2J,EACRA,EAAIC,EACJA,EAAI5J,OACC,GAAU,IAANqB,GAAyB,IAAduI,EAAE8a,KAAK,GAC3B,MAGF/a,EAAE0O,KAAKzO,SACA,GAET,OAAOA,EAAEsX,OAAOsB,IAIlB7Q,EAAGrW,UAAUqpB,KAAO,SAAehqB,GACjC,OAAOV,KAAKwpB,KAAK9oB,GAAKgP,EAAEwZ,KAAKxoB,IAG/BgX,EAAGrW,UAAUyoB,OAAS,WACpB,OAA+B,KAAP,EAAhB9pB,KAAK+X,MAAM,KAGrBL,EAAGrW,UAAU6oB,MAAQ,WACnB,OAA+B,KAAP,EAAhBlqB,KAAK+X,MAAM,KAIrBL,EAAGrW,UAAU6a,MAAQ,SAAgBxb,GACnC,OAAOV,KAAK+X,MAAM,GAAKrX,GAIzBgX,EAAGrW,UAAUspB,MAAQ,SAAgBlQ,GACnChK,EAAsB,kBAARgK,GACd,IAAIrT,EAAIqT,EAAM,GACVsK,GAAKtK,EAAMrT,GAAK,GAChB6U,EAAI,GAAK7U,EAGb,GAAIpH,KAAK6B,QAAUkjB,EAGjB,OAFA/kB,KAAKia,QAAQ8K,EAAI,GACjB/kB,KAAK+X,MAAMgN,IAAM9I,EACVjc,KAKT,IADA,IAAI8a,EAAQmB,EACH/Z,EAAI6iB,EAAa,IAAVjK,GAAe5Y,EAAIlC,KAAK6B,OAAQK,IAAK,CACnD,IAAIkX,EAAoB,EAAhBpZ,KAAK+X,MAAM7V,GACnBkX,GAAK0B,EACLA,EAAQ1B,IAAM,GACdA,GAAK,SACLpZ,KAAK+X,MAAM7V,GAAKkX,EAMlB,OAJc,IAAV0B,IACF9a,KAAK+X,MAAM7V,GAAK4Y,EAChB9a,KAAK6B,UAEA7B,MAGT0X,EAAGrW,UAAUia,OAAS,WACpB,OAAuB,IAAhBtb,KAAK6B,QAAkC,IAAlB7B,KAAK+X,MAAM,IAGzCL,EAAGrW,UAAUopB,KAAO,SAAe/pB,GACjC,IAOIzB,EAPA6Y,EAAWpX,EAAM,EAErB,GAAsB,IAAlBV,KAAK8X,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlB9X,KAAK8X,UAAkBA,EAAU,OAAO,EAK5C,GAHA9X,KAAKsZ,QAGDtZ,KAAK6B,OAAS,EAChB5C,EAAM,MACD,CACD6Y,IACFpX,GAAOA,GAGT+P,EAAO/P,GAAO,SAAW,qBAEzB,IAAI0Y,EAAoB,EAAhBpZ,KAAK+X,MAAM,GACnB9Y,EAAMma,IAAM1Y,EAAM,EAAI0Y,EAAI1Y,GAAO,EAAI,EAEvC,OAAsB,IAAlBV,KAAK8X,SAA8B,GAAN7Y,EAC1BA,GAOTyY,EAAGrW,UAAUyX,IAAM,SAAcpY,GAC/B,GAAsB,IAAlBV,KAAK8X,UAAmC,IAAjBpX,EAAIoX,SAAgB,OAAQ,EACvD,GAAsB,IAAlB9X,KAAK8X,UAAmC,IAAjBpX,EAAIoX,SAAgB,OAAO,EAEtD,IAAI7Y,EAAMe,KAAK4qB,KAAKlqB,GACpB,OAAsB,IAAlBV,KAAK8X,SAA8B,GAAN7Y,EAC1BA,GAITyY,EAAGrW,UAAUupB,KAAO,SAAelqB,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,IAAIwN,EAAoB,EAAhB1P,KAAK+X,MAAM7V,GACfyN,EAAmB,EAAfjP,EAAIqX,MAAM7V,GAElB,GAAIwN,IAAMC,EAAV,CACID,EAAIC,EACN1Q,GAAO,EACEyQ,EAAIC,IACb1Q,EAAM,GAER,OAEF,OAAOA,GAGTyY,EAAGrW,UAAUwpB,IAAM,SAAcnqB,GAC/B,OAA0B,IAAnBV,KAAKyqB,KAAK/pB,IAGnBgX,EAAGrW,UAAUypB,GAAK,SAAapqB,GAC7B,OAAyB,IAAlBV,KAAK8Y,IAAIpY,IAGlBgX,EAAGrW,UAAU0pB,KAAO,SAAerqB,GACjC,OAAOV,KAAKyqB,KAAK/pB,IAAQ,GAG3BgX,EAAGrW,UAAU2pB,IAAM,SAActqB,GAC/B,OAAOV,KAAK8Y,IAAIpY,IAAQ,GAG1BgX,EAAGrW,UAAU4pB,IAAM,SAAcvqB,GAC/B,OAA2B,IAApBV,KAAKyqB,KAAK/pB,IAGnBgX,EAAGrW,UAAU6pB,GAAK,SAAaxqB,GAC7B,OAA0B,IAAnBV,KAAK8Y,IAAIpY,IAGlBgX,EAAGrW,UAAU8pB,KAAO,SAAezqB,GACjC,OAAOV,KAAKyqB,KAAK/pB,IAAQ,GAG3BgX,EAAGrW,UAAU+pB,IAAM,SAAc1qB,GAC/B,OAAOV,KAAK8Y,IAAIpY,IAAQ,GAG1BgX,EAAGrW,UAAUgqB,IAAM,SAAc3qB,GAC/B,OAA0B,IAAnBV,KAAKyqB,KAAK/pB,IAGnBgX,EAAGrW,UAAUiqB,GAAK,SAAa5qB,GAC7B,OAAyB,IAAlBV,KAAK8Y,IAAIpY,IAOlBgX,EAAGM,IAAM,SAActX,GACrB,OAAO,IAAI6qB,EAAI7qB,IAGjBgX,EAAGrW,UAAUmqB,MAAQ,SAAgBC,GAGnC,OAFAhb,GAAQzQ,KAAKgY,IAAK,yCAClBvH,EAAyB,IAAlBzQ,KAAK8X,SAAgB,iCACrB2T,EAAIC,UAAU1rB,MAAM2rB,UAAUF,IAGvC/T,EAAGrW,UAAUuqB,QAAU,WAErB,OADAnb,EAAOzQ,KAAKgY,IAAK,wDACVhY,KAAKgY,IAAI6T,YAAY7rB,OAG9B0X,EAAGrW,UAAUsqB,UAAY,SAAoBF,GAE3C,OADAzrB,KAAKgY,IAAMyT,EACJzrB,MAGT0X,EAAGrW,UAAUyqB,SAAW,SAAmBL,GAEzC,OADAhb,GAAQzQ,KAAKgY,IAAK,yCACXhY,KAAK2rB,UAAUF,IAGxB/T,EAAGrW,UAAU0qB,OAAS,SAAiBrrB,GAErC,OADA+P,EAAOzQ,KAAKgY,IAAK,sCACVhY,KAAKgY,IAAIqG,IAAIre,KAAMU,IAG5BgX,EAAGrW,UAAU2qB,QAAU,SAAkBtrB,GAEvC,OADA+P,EAAOzQ,KAAKgY,IAAK,uCACVhY,KAAKgY,IAAImG,KAAKne,KAAMU,IAG7BgX,EAAGrW,UAAU4qB,OAAS,SAAiBvrB,GAErC,OADA+P,EAAOzQ,KAAKgY,IAAK,sCACVhY,KAAKgY,IAAIsG,IAAIte,KAAMU,IAG5BgX,EAAGrW,UAAU6qB,QAAU,SAAkBxrB,GAEvC,OADA+P,EAAOzQ,KAAKgY,IAAK,uCACVhY,KAAKgY,IAAIoG,KAAKpe,KAAMU,IAG7BgX,EAAGrW,UAAU8qB,OAAS,SAAiBzrB,GAErC,OADA+P,EAAOzQ,KAAKgY,IAAK,sCACVhY,KAAKgY,IAAIoU,IAAIpsB,KAAMU,IAG5BgX,EAAGrW,UAAUgrB,OAAS,SAAiB3rB,GAGrC,OAFA+P,EAAOzQ,KAAKgY,IAAK,sCACjBhY,KAAKgY,IAAIsU,SAAStsB,KAAMU,GACjBV,KAAKgY,IAAIQ,IAAIxY,KAAMU,IAG5BgX,EAAGrW,UAAUkrB,QAAU,SAAkB7rB,GAGvC,OAFA+P,EAAOzQ,KAAKgY,IAAK,sCACjBhY,KAAKgY,IAAIsU,SAAStsB,KAAMU,GACjBV,KAAKgY,IAAIsK,KAAKtiB,KAAMU,IAG7BgX,EAAGrW,UAAUmrB,OAAS,WAGpB,OAFA/b,EAAOzQ,KAAKgY,IAAK,sCACjBhY,KAAKgY,IAAIyU,SAASzsB,MACXA,KAAKgY,IAAI+O,IAAI/mB,OAGtB0X,EAAGrW,UAAUqrB,QAAU,WAGrB,OAFAjc,EAAOzQ,KAAKgY,IAAK,uCACjBhY,KAAKgY,IAAIyU,SAASzsB,MACXA,KAAKgY,IAAIgP,KAAKhnB,OAIvB0X,EAAGrW,UAAUsrB,QAAU,WAGrB,OAFAlc,EAAOzQ,KAAKgY,IAAK,uCACjBhY,KAAKgY,IAAIyU,SAASzsB,MACXA,KAAKgY,IAAI4U,KAAK5sB,OAGvB0X,EAAGrW,UAAUwrB,QAAU,WAGrB,OAFApc,EAAOzQ,KAAKgY,IAAK,uCACjBhY,KAAKgY,IAAIyU,SAASzsB,MACXA,KAAKgY,IAAI0S,KAAK1qB,OAIvB0X,EAAGrW,UAAUyrB,OAAS,WAGpB,OAFArc,EAAOzQ,KAAKgY,IAAK,sCACjBhY,KAAKgY,IAAIyU,SAASzsB,MACXA,KAAKgY,IAAImF,IAAInd,OAGtB0X,EAAGrW,UAAU0rB,OAAS,SAAiBrsB,GAGrC,OAFA+P,EAAOzQ,KAAKgY,MAAQtX,EAAIsX,IAAK,qBAC7BhY,KAAKgY,IAAIyU,SAASzsB,MACXA,KAAKgY,IAAI+B,IAAI/Z,KAAMU,IAI5B,IAAIssB,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQntB,EAAMqU,GAErBvU,KAAKE,KAAOA,EACZF,KAAKuU,EAAI,IAAImD,EAAGnD,EAAG,IACnBvU,KAAK4lB,EAAI5lB,KAAKuU,EAAEiG,YAChBxa,KAAK+a,EAAI,IAAIrD,EAAG,GAAGuP,OAAOjnB,KAAK4lB,GAAGxH,KAAKpe,KAAKuU,GAE5CvU,KAAKstB,IAAMttB,KAAKutB,OAiDlB,SAASC,IACPH,EAAO7sB,KACLR,KACA,OACA,2EA+DJ,SAASytB,IACPJ,EAAO7sB,KACLR,KACA,OACA,kEAIJ,SAAS0tB,IACPL,EAAO7sB,KACLR,KACA,OACA,yDAIJ,SAAS2tB,IAEPN,EAAO7sB,KACLR,KACA,QACA,uEA8CJ,SAASurB,EAAK1F,GACZ,GAAiB,kBAANA,EAAgB,CACzB,IAAI+H,EAAQlW,EAAGmW,OAAOhI,GACtB7lB,KAAK6lB,EAAI+H,EAAMrZ,EACfvU,KAAK4tB,MAAQA,OAEbnd,EAAOoV,EAAEgF,IAAI,GAAI,kCACjB7qB,KAAK6lB,EAAIA,EACT7lB,KAAK4tB,MAAQ,KAkOjB,SAASE,EAAMjI,GACb0F,EAAI/qB,KAAKR,KAAM6lB,GAEf7lB,KAAKuoB,MAAQvoB,KAAK6lB,EAAErL,YAChBxa,KAAKuoB,MAAQ,KAAO,IACtBvoB,KAAKuoB,OAAS,GAAMvoB,KAAKuoB,MAAQ,IAGnCvoB,KAAKoH,EAAI,IAAIsQ,EAAG,GAAGuP,OAAOjnB,KAAKuoB,OAC/BvoB,KAAKspB,GAAKtpB,KAAK+tB,KAAK/tB,KAAKoH,EAAE2f,OAC3B/mB,KAAKguB,KAAOhuB,KAAKoH,EAAEijB,OAAOrqB,KAAK6lB,GAE/B7lB,KAAKiuB,KAAOjuB,KAAKguB,KAAKxV,IAAIxY,KAAKoH,GAAG8gB,MAAM,GAAGY,IAAI9oB,KAAK6lB,GACpD7lB,KAAKiuB,KAAOjuB,KAAKiuB,KAAK/E,KAAKlpB,KAAKoH,GAChCpH,KAAKiuB,KAAOjuB,KAAKoH,EAAEkX,IAAIte,KAAKiuB,MA5a9BZ,EAAOhsB,UAAUksB,KAAO,WACtB,IAAID,EAAM,IAAI5V,EAAG,MAEjB,OADA4V,EAAIvV,MAAQ,IAAI7U,MAAMuV,KAAKU,KAAKnZ,KAAK4lB,EAAI,KAClC0H,GAGTD,EAAOhsB,UAAU6sB,QAAU,SAAkBxtB,GAG3C,IACIytB,EADA/mB,EAAI1G,EAGR,GACEV,KAAKiD,MAAMmE,EAAGpH,KAAKstB,KACnBlmB,EAAIpH,KAAKouB,MAAMhnB,GACfA,EAAIA,EAAE+W,KAAKne,KAAKstB,KAChBa,EAAO/mB,EAAEoT,kBACF2T,EAAOnuB,KAAK4lB,GAErB,IAAI9M,EAAMqV,EAAOnuB,KAAK4lB,GAAK,EAAIxe,EAAEwjB,KAAK5qB,KAAKuU,GAgB3C,OAfY,IAARuE,GACF1R,EAAE2Q,MAAM,GAAK,EACb3Q,EAAEvF,OAAS,GACFiX,EAAM,EACf1R,EAAEgX,KAAKpe,KAAKuU,QAEI/O,IAAZ4B,EAAEkS,MAEJlS,EAAEkS,QAGFlS,EAAEinB,SAICjnB,GAGTimB,EAAOhsB,UAAU4B,MAAQ,SAAgBuP,EAAO1N,GAC9C0N,EAAM2J,OAAOnc,KAAK4lB,EAAG,EAAG9gB,IAG1BuoB,EAAOhsB,UAAU+sB,MAAQ,SAAgB1tB,GACvC,OAAOA,EAAI4hB,KAAKtiB,KAAK+a,IASvBpb,EAAS6tB,EAAMH,GAEfG,EAAKnsB,UAAU4B,MAAQ,SAAgBuP,EAAO8b,GAK5C,IAHA,IAAI7G,EAAO,QAEP8G,EAAS9V,KAAKC,IAAIlG,EAAM3Q,OAAQ,GAC3BK,EAAI,EAAGA,EAAIqsB,EAAQrsB,IAC1BosB,EAAOvW,MAAM7V,GAAKsQ,EAAMuF,MAAM7V,GAIhC,GAFAosB,EAAOzsB,OAAS0sB,EAEZ/b,EAAM3Q,QAAU,EAGlB,OAFA2Q,EAAMuF,MAAM,GAAK,OACjBvF,EAAM3Q,OAAS,GAKjB,IAAIoH,EAAOuJ,EAAMuF,MAAM,GAGvB,IAFAuW,EAAOvW,MAAMuW,EAAOzsB,UAAYoH,EAAOwe,EAElCvlB,EAAI,GAAIA,EAAIsQ,EAAM3Q,OAAQK,IAAK,CAClC,IAAIgH,EAAwB,EAAjBsJ,EAAMuF,MAAM7V,GACvBsQ,EAAMuF,MAAM7V,EAAI,KAAQgH,EAAOue,IAAS,EAAMxe,IAAS,GACvDA,EAAOC,EAETD,KAAU,GACVuJ,EAAMuF,MAAM7V,EAAI,IAAM+G,EACT,IAATA,GAAcuJ,EAAM3Q,OAAS,GAC/B2Q,EAAM3Q,QAAU,GAEhB2Q,EAAM3Q,QAAU,GAIpB2rB,EAAKnsB,UAAU+sB,MAAQ,SAAgB1tB,GAErCA,EAAIqX,MAAMrX,EAAImB,QAAU,EACxBnB,EAAIqX,MAAMrX,EAAImB,OAAS,GAAK,EAC5BnB,EAAImB,QAAU,EAId,IADA,IAAIgZ,EAAK,EACA3Y,EAAI,EAAGA,EAAIxB,EAAImB,OAAQK,IAAK,CACnC,IAAIkX,EAAmB,EAAf1Y,EAAIqX,MAAM7V,GAClB2Y,GAAU,IAAJzB,EACN1Y,EAAIqX,MAAM7V,GAAU,SAAL2Y,EACfA,EAAS,GAAJzB,GAAayB,EAAK,SAAa,GAUtC,OANkC,IAA9Bna,EAAIqX,MAAMrX,EAAImB,OAAS,KACzBnB,EAAImB,SAC8B,IAA9BnB,EAAIqX,MAAMrX,EAAImB,OAAS,IACzBnB,EAAImB,UAGDnB,GASTf,EAAS8tB,EAAMJ,GAQf1tB,EAAS+tB,EAAML,GASf1tB,EAASguB,EAAQN,GAEjBM,EAAOtsB,UAAU+sB,MAAQ,SAAgB1tB,GAGvC,IADA,IAAIoa,EAAQ,EACH5Y,EAAI,EAAGA,EAAIxB,EAAImB,OAAQK,IAAK,CACnC,IAAIqa,EAA0B,IAAL,EAAf7b,EAAIqX,MAAM7V,IAAiB4Y,EACjCD,EAAU,SAAL0B,EACTA,KAAQ,GAER7b,EAAIqX,MAAM7V,GAAK2Y,EACfC,EAAQyB,EAKV,OAHc,IAAVzB,IACFpa,EAAIqX,MAAMrX,EAAImB,UAAYiZ,GAErBpa,GAITgX,EAAGmW,OAAS,SAAgB3tB,GAE1B,GAAI8sB,EAAO9sB,GAAO,OAAO8sB,EAAO9sB,GAEhC,IAAI0tB,EACJ,GAAa,SAAT1tB,EACF0tB,EAAQ,IAAIJ,OACP,GAAa,SAATttB,EACT0tB,EAAQ,IAAIH,OACP,GAAa,SAATvtB,EACT0tB,EAAQ,IAAIF,MACP,IAAa,WAATxtB,EAGT,MAAM,IAAIkS,MAAM,iBAAmBlS,GAFnC0tB,EAAQ,IAAID,EAMd,OAFAX,EAAO9sB,GAAQ0tB,EAERA,GAkBTrC,EAAIlqB,UAAUorB,SAAW,SAAmB/c,GAC1Ce,EAAsB,IAAff,EAAEoI,SAAgB,iCACzBrH,EAAOf,EAAEsI,IAAK,oCAGhBuT,EAAIlqB,UAAUirB,SAAW,SAAmB5c,EAAGC,GAC7Cc,EAAqC,KAA7Bf,EAAEoI,SAAWnI,EAAEmI,UAAiB,iCACxCrH,EAAOf,EAAEsI,KAAOtI,EAAEsI,MAAQrI,EAAEqI,IAC1B,oCAGJuT,EAAIlqB,UAAU0sB,KAAO,SAAere,GAClC,OAAI1P,KAAK4tB,MAAc5tB,KAAK4tB,MAAMM,QAAQxe,GAAGic,UAAU3rB,MAChD0P,EAAEwZ,KAAKlpB,KAAK6lB,GAAG8F,UAAU3rB,OAGlCurB,EAAIlqB,UAAU8b,IAAM,SAAczN,GAChC,OAAIA,EAAE4L,SACG5L,EAAEiC,QAGJ3R,KAAK6lB,EAAEvH,IAAI5O,GAAGic,UAAU3rB,OAGjCurB,EAAIlqB,UAAUgd,IAAM,SAAc3O,EAAGC,GACnC3P,KAAKssB,SAAS5c,EAAGC,GAEjB,IAAI1Q,EAAMyQ,EAAE2O,IAAI1O,GAIhB,OAHI1Q,EAAI6Z,IAAI9Y,KAAK6lB,IAAM,GACrB5mB,EAAImf,KAAKpe,KAAK6lB,GAET5mB,EAAI0sB,UAAU3rB,OAGvBurB,EAAIlqB,UAAU8c,KAAO,SAAezO,EAAGC,GACrC3P,KAAKssB,SAAS5c,EAAGC,GAEjB,IAAI1Q,EAAMyQ,EAAEyO,KAAKxO,GAIjB,OAHI1Q,EAAI6Z,IAAI9Y,KAAK6lB,IAAM,GACrB5mB,EAAImf,KAAKpe,KAAK6lB,GAET5mB,GAGTssB,EAAIlqB,UAAUid,IAAM,SAAc5O,EAAGC,GACnC3P,KAAKssB,SAAS5c,EAAGC,GAEjB,IAAI1Q,EAAMyQ,EAAE4O,IAAI3O,GAIhB,OAHI1Q,EAAIwrB,KAAK,GAAK,GAChBxrB,EAAIkf,KAAKne,KAAK6lB,GAET5mB,EAAI0sB,UAAU3rB,OAGvBurB,EAAIlqB,UAAU+c,KAAO,SAAe1O,EAAGC,GACrC3P,KAAKssB,SAAS5c,EAAGC,GAEjB,IAAI1Q,EAAMyQ,EAAE0O,KAAKzO,GAIjB,OAHI1Q,EAAIwrB,KAAK,GAAK,GAChBxrB,EAAIkf,KAAKne,KAAK6lB,GAET5mB,GAGTssB,EAAIlqB,UAAU+qB,IAAM,SAAc1c,EAAGhP,GAEnC,OADAV,KAAKysB,SAAS/c,GACP1P,KAAK+tB,KAAKre,EAAEmY,MAAMnnB,KAG3B6qB,EAAIlqB,UAAUihB,KAAO,SAAe5S,EAAGC,GAErC,OADA3P,KAAKssB,SAAS5c,EAAGC,GACV3P,KAAK+tB,KAAKre,EAAE4S,KAAK3S,KAG1B4b,EAAIlqB,UAAUmX,IAAM,SAAc9I,EAAGC,GAEnC,OADA3P,KAAKssB,SAAS5c,EAAGC,GACV3P,KAAK+tB,KAAKre,EAAE8I,IAAI7I,KAGzB4b,EAAIlqB,UAAU2lB,KAAO,SAAetX,GAClC,OAAO1P,KAAKsiB,KAAK5S,EAAGA,EAAEiC,UAGxB4Z,EAAIlqB,UAAU0lB,IAAM,SAAcrX,GAChC,OAAO1P,KAAKwY,IAAI9I,EAAGA,IAGrB6b,EAAIlqB,UAAUurB,KAAO,SAAeld,GAClC,GAAIA,EAAE4L,SAAU,OAAO5L,EAAEiC,QAEzB,IAAI6c,EAAOxuB,KAAK6lB,EAAE3J,MAAM,GAIxB,GAHAzL,EAAO+d,EAAO,IAAM,GAGP,IAATA,EAAY,CACd,IAAIzU,EAAM/Z,KAAK6lB,EAAExH,IAAI,IAAI3G,EAAG,IAAIyE,OAAO,GACvC,OAAOnc,KAAK+Z,IAAIrK,EAAGqK,GAMrB,IAAIkC,EAAIjc,KAAK6lB,EAAEuC,KAAK,GAChBrD,EAAI,EACR,OAAQ9I,EAAEX,UAA2B,IAAfW,EAAEC,MAAM,GAC5B6I,IACA9I,EAAEE,OAAO,GAEX1L,GAAQwL,EAAEX,UAEV,IAAImT,EAAM,IAAI/W,EAAG,GAAG8T,MAAMxrB,MACtB0uB,EAAOD,EAAI3B,SAIX6B,EAAO3uB,KAAK6lB,EAAEuC,KAAK,GAAGjM,OAAO,GAC7ByS,EAAI5uB,KAAK6lB,EAAErL,YACfoU,EAAI,IAAIlX,EAAG,EAAIkX,EAAIA,GAAGpD,MAAMxrB,MAE5B,MAAuC,IAAhCA,KAAK+Z,IAAI6U,EAAGD,GAAM7V,IAAI4V,GAC3BE,EAAE5C,QAAQ0C,GAGZ,IAAIjjB,EAAIzL,KAAK+Z,IAAI6U,EAAG3S,GAChB7U,EAAIpH,KAAK+Z,IAAIrK,EAAGuM,EAAEkM,KAAK,GAAGhM,OAAO,IACjCpW,EAAI/F,KAAK+Z,IAAIrK,EAAGuM,GAChB4J,EAAId,EACR,MAAsB,IAAfhf,EAAE+S,IAAI2V,GAAY,CAEvB,IADA,IAAInB,EAAMvnB,EACD7D,EAAI,EAAoB,IAAjBorB,EAAIxU,IAAI2V,GAAYvsB,IAClCorB,EAAMA,EAAId,SAEZ/b,EAAOvO,EAAI2jB,GACX,IAAIlW,EAAI3P,KAAK+Z,IAAItO,EAAG,IAAIiM,EAAG,GAAGuP,OAAOpB,EAAI3jB,EAAI,IAE7CkF,EAAIA,EAAEilB,OAAO1c,GACblE,EAAIkE,EAAE6c,SACNzmB,EAAIA,EAAEsmB,OAAO5gB,GACboa,EAAI3jB,EAGN,OAAOkF,GAGTmkB,EAAIlqB,UAAUqpB,KAAO,SAAehb,GAClC,IAAImf,EAAMnf,EAAE2a,OAAOrqB,KAAK6lB,GACxB,OAAqB,IAAjBgJ,EAAI/W,UACN+W,EAAI/W,SAAW,EACR9X,KAAK+tB,KAAKc,GAAK/B,UAEf9sB,KAAK+tB,KAAKc,IAIrBtD,EAAIlqB,UAAU0Y,IAAM,SAAcrK,EAAGhP,GACnC,GAAIA,EAAI4a,SAAU,OAAO,IAAI5D,EAAG,GAAG8T,MAAMxrB,MACzC,GAAoB,IAAhBU,EAAI+pB,KAAK,GAAU,OAAO/a,EAAEiC,QAEhC,IAAImd,EAAa,EACbC,EAAM,IAAI7rB,MAAM,GAAK4rB,GACzBC,EAAI,GAAK,IAAIrX,EAAG,GAAG8T,MAAMxrB,MACzB+uB,EAAI,GAAKrf,EACT,IAAK,IAAIxN,EAAI,EAAGA,EAAI6sB,EAAIltB,OAAQK,IAC9B6sB,EAAI7sB,GAAKlC,KAAKwY,IAAIuW,EAAI7sB,EAAI,GAAIwN,GAGhC,IAAIzQ,EAAM8vB,EAAI,GACVC,EAAU,EACVC,EAAa,EACb5b,EAAQ3S,EAAI8Z,YAAc,GAK9B,IAJc,IAAVnH,IACFA,EAAQ,IAGLnR,EAAIxB,EAAImB,OAAS,EAAGK,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAI0X,EAAOlZ,EAAIqX,MAAM7V,GACZC,EAAIkR,EAAQ,EAAGlR,GAAK,EAAGA,IAAK,CACnC,IAAIsY,EAAOb,GAAQzX,EAAK,EACpBlD,IAAQ8vB,EAAI,KACd9vB,EAAMe,KAAK+mB,IAAI9nB,IAGL,IAARwb,GAAyB,IAAZuU,GAKjBA,IAAY,EACZA,GAAWvU,EACXwU,KACIA,IAAeH,GAAqB,IAAN5sB,GAAiB,IAANC,KAE7ClD,EAAMe,KAAKwY,IAAIvZ,EAAK8vB,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,EAajB5b,EAAQ,GAGV,OAAOpU,GAGTssB,EAAIlqB,UAAUqqB,UAAY,SAAoBhrB,GAC5C,IAAI0G,EAAI1G,EAAIwoB,KAAKlpB,KAAK6lB,GAEtB,OAAOze,IAAM1G,EAAM0G,EAAEuK,QAAUvK,GAGjCmkB,EAAIlqB,UAAUwqB,YAAc,SAAsBnrB,GAChD,IAAIzB,EAAMyB,EAAIiR,QAEd,OADA1S,EAAI+Y,IAAM,KACH/Y,GAOTyY,EAAGwX,KAAO,SAAexuB,GACvB,OAAO,IAAIotB,EAAKptB,IAmBlBf,EAASmuB,EAAMvC,GAEfuC,EAAKzsB,UAAUqqB,UAAY,SAAoBhrB,GAC7C,OAAOV,KAAK+tB,KAAKrtB,EAAImnB,MAAM7nB,KAAKuoB,SAGlCuF,EAAKzsB,UAAUwqB,YAAc,SAAsBnrB,GACjD,IAAI0G,EAAIpH,KAAK+tB,KAAKrtB,EAAI8X,IAAIxY,KAAKguB,OAE/B,OADA5mB,EAAE4Q,IAAM,KACD5Q,GAGT0mB,EAAKzsB,UAAUihB,KAAO,SAAe5S,EAAGC,GACtC,GAAID,EAAE4L,UAAY3L,EAAE2L,SAGlB,OAFA5L,EAAEqI,MAAM,GAAK,EACbrI,EAAE7N,OAAS,EACJ6N,EAGT,IAAI3J,EAAI2J,EAAE4S,KAAK3S,GACXlE,EAAI1F,EAAEkiB,MAAMjoB,KAAKuoB,OAAO/P,IAAIxY,KAAKiuB,MAAMjG,OAAOhoB,KAAKuoB,OAAO/P,IAAIxY,KAAK6lB,GACnEsJ,EAAIppB,EAAEqY,KAAK3S,GAAG0Q,OAAOnc,KAAKuoB,OAC1BtpB,EAAMkwB,EAQV,OANIA,EAAErW,IAAI9Y,KAAK6lB,IAAM,EACnB5mB,EAAMkwB,EAAE/Q,KAAKpe,KAAK6lB,GACTsJ,EAAE1E,KAAK,GAAK,IACrBxrB,EAAMkwB,EAAEhR,KAAKne,KAAK6lB,IAGb5mB,EAAI0sB,UAAU3rB,OAGvB8tB,EAAKzsB,UAAUmX,IAAM,SAAc9I,EAAGC,GACpC,GAAID,EAAE4L,UAAY3L,EAAE2L,SAAU,OAAO,IAAI5D,EAAG,GAAGiU,UAAU3rB,MAEzD,IAAI+F,EAAI2J,EAAE8I,IAAI7I,GACVlE,EAAI1F,EAAEkiB,MAAMjoB,KAAKuoB,OAAO/P,IAAIxY,KAAKiuB,MAAMjG,OAAOhoB,KAAKuoB,OAAO/P,IAAIxY,KAAK6lB,GACnEsJ,EAAIppB,EAAEqY,KAAK3S,GAAG0Q,OAAOnc,KAAKuoB,OAC1BtpB,EAAMkwB,EAOV,OANIA,EAAErW,IAAI9Y,KAAK6lB,IAAM,EACnB5mB,EAAMkwB,EAAE/Q,KAAKpe,KAAK6lB,GACTsJ,EAAE1E,KAAK,GAAK,IACrBxrB,EAAMkwB,EAAEhR,KAAKne,KAAK6lB,IAGb5mB,EAAI0sB,UAAU3rB,OAGvB8tB,EAAKzsB,UAAUqpB,KAAO,SAAehb,GAEnC,IAAIzQ,EAAMe,KAAK+tB,KAAKre,EAAE2a,OAAOrqB,KAAK6lB,GAAGrN,IAAIxY,KAAKspB,KAC9C,OAAOrqB,EAAI0sB,UAAU3rB,QAn3GzB,CAq3GoCoB,EAAQpB,Q,2DCn3G5C,MAAML,EAAW,EAAQ,QAEnB4Q,EAAS,EAAQ,SACjBpK,EAAgB,EAAQ,QAAkBA,cAC1CtG,EAAO,EAAQ,QAGfN,EAAM,EAAQ,QAEpB,SAASsX,EAAW9W,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,SAAS6uB,EAAa7sB,EAAKgI,GACzB,IAAI3J,EAAM2B,EAAI6H,UAAUG,GACxB,GAAIhI,EAAIyQ,QAAQpS,GACd,OAAOA,EAET,MAAME,EAAMvB,EAAIkV,SAAS7T,GAAO,GAC1BC,EAA6B,KAAV,GAAND,GAGnB,GAAqB,MAAV,GAANA,GAAsB,CACzB,IAAIyuB,EAAMzuB,EACVA,EAAM,EACN,MAAwB,OAAV,IAANyuB,GAAsB,CAE5B,GADAA,EAAM9sB,EAAI6H,UAAUG,GAChBhI,EAAIyQ,QAAQqc,GACd,OAAOA,EAETzuB,IAAQ,EACRA,GAAa,IAANyuB,QAGTzuB,GAAO,GAET,MAAM0uB,EAAS/vB,EAAIqB,IAAIA,GAEvB,MAAO,CACLE,IAAKA,EACLD,UAAWA,EACXD,IAAKA,EACL0uB,OAAQA,GAIZ,SAASC,EAAahtB,EAAK1B,EAAW0J,GACpC,IAAI3C,EAAMrF,EAAI6H,UAAUG,GACxB,GAAIhI,EAAIyQ,QAAQpL,GACd,OAAOA,EAGT,IAAK/G,GAAqB,MAAR+G,EAChB,OAAO,KAGT,GAAqB,KAAV,IAANA,GAEH,OAAOA,EAIT,MAAMlH,EAAY,IAANkH,EACZ,GAAIlH,EAAM,EACR,OAAO6B,EAAIrB,MAAM,6BAEnB0G,EAAM,EACN,IAAK,IAAI1F,EAAI,EAAGA,EAAIxB,EAAKwB,IAAK,CAC5B0F,IAAQ,EACR,MAAMzF,EAAII,EAAI6H,UAAUG,GACxB,GAAIhI,EAAIyQ,QAAQ7Q,GACd,OAAOA,EACTyF,GAAOzF,EAGT,OAAOyF,EAzTTxG,EAAOtC,QAAU+X,EAEjBA,EAAWxV,UAAU0V,OAAS,SAAgBxV,EAAMiF,GAKlD,OAJKL,EAAc2D,gBAAgBvI,KACjCA,EAAO,IAAI4E,EAAc5E,EAAMiF,IAG1BxG,KAAKG,KAAKoS,QAAQhR,EAAMiF,IAQjC7G,EAASS,EAASP,GAElBO,EAAQiB,UAAU0R,SAAW,SAAiByc,EAAQ5uB,EAAKuQ,GACzD,GAAIqe,EAAOrlB,UACT,OAAO,EAET,MAAM7E,EAAQkqB,EAAOvlB,OACfwlB,EAAaL,EAAaI,EAAQ,wBAA0B5uB,EAAM,KACxE,OAAI4uB,EAAOxc,QAAQyc,GACVA,GAETD,EAAOtlB,QAAQ5E,GAERmqB,EAAW7uB,MAAQA,GAAO6uB,EAAWH,SAAW1uB,GACpD6uB,EAAWH,OAAS,OAAU1uB,GAAOuQ,IAG1C/Q,EAAQiB,UAAU+R,WAAa,SAAmBoc,EAAQ5uB,EAAKuQ,GAC7D,MAAMse,EAAaL,EAAaI,EAC9B,4BAA8B5uB,EAAM,KACtC,GAAI4uB,EAAOxc,QAAQyc,GACjB,OAAOA,EAET,IAAI7nB,EAAM2nB,EAAaC,EACrBC,EAAW5uB,UACX,4BAA8BD,EAAM,KAGtC,GAAI4uB,EAAOxc,QAAQpL,GACjB,OAAOA,EAET,IAAKuJ,GACDse,EAAW7uB,MAAQA,GACnB6uB,EAAWH,SAAW1uB,GACtB6uB,EAAWH,OAAS,OAAS1uB,EAC/B,OAAO4uB,EAAOtuB,MAAM,yBAA2BN,EAAM,KAGvD,GAAI6uB,EAAW5uB,WAAqB,OAAR+G,EAC1B,OAAO4nB,EAAOnlB,KAAKzC,EAAK,6BAA+BhH,EAAM,KAG/D,MAAM0E,EAAQkqB,EAAOvlB,OACfhL,EAAMe,KAAK0vB,cACfF,EACA,2CAA6CxvB,KAAKY,IAAM,KAC1D,OAAI4uB,EAAOxc,QAAQ/T,GACVA,GAET2I,EAAM4nB,EAAO7rB,OAAS2B,EAAM3B,OAC5B6rB,EAAOtlB,QAAQ5E,GACRkqB,EAAOnlB,KAAKzC,EAAK,6BAA+BhH,EAAM,OAG/DR,EAAQiB,UAAUquB,cAAgB,SAAsBF,EAAQjlB,GAC9D,OAAS,CACP,MAAM3J,EAAMwuB,EAAaI,EAAQjlB,GACjC,GAAIilB,EAAOxc,QAAQpS,GACjB,OAAOA,EACT,MAAMgH,EAAM2nB,EAAaC,EAAQ5uB,EAAIC,UAAW0J,GAChD,GAAIilB,EAAOxc,QAAQpL,GACjB,OAAOA,EAET,IAAI3I,EAOJ,GALEA,EADE2B,EAAIC,WAAqB,OAAR+G,EACb4nB,EAAOnlB,KAAKzC,GAEZ5H,KAAK0vB,cAAcF,EAAQjlB,GAG/BilB,EAAOxc,QAAQ/T,GACjB,OAAOA,EAET,GAAmB,QAAf2B,EAAI0uB,OACN,QAINlvB,EAAQiB,UAAUsS,YAAc,SAAoB6b,EAAQ5uB,EAAK+uB,EAC/DnpB,GACA,MAAMmM,EAAS,GACf,OAAQ6c,EAAOrlB,UAAW,CACxB,MAAMylB,EAAc5vB,KAAK+S,SAASyc,EAAQ,OAC1C,GAAIA,EAAOxc,QAAQ4c,GACjB,OAAOA,EAET,MAAM3wB,EAAM0wB,EAAQ5Y,OAAOyY,EAAQ,MAAOhpB,GAC1C,GAAIgpB,EAAOxc,QAAQ/T,IAAQ2wB,EACzB,MACFjd,EAAO1K,KAAKhJ,GAEd,OAAO0T,GAGTvS,EAAQiB,UAAUuS,WAAa,SAAmB4b,EAAQ5uB,GACxD,GAAY,WAARA,EAAkB,CACpB,MAAM0B,EAASktB,EAAOplB,YACtB,OAAIolB,EAAOxc,QAAQ1Q,GACVA,EACF,CAAEA,OAAQA,EAAQf,KAAMiuB,EAAOllB,OACjC,GAAY,WAAR1J,EAAkB,CAC3B,MAAM0J,EAAMklB,EAAOllB,MACnB,GAAIA,EAAIzI,OAAS,IAAM,EACrB,OAAO2tB,EAAOtuB,MAAM,mDAEtB,IAAImB,EAAM,GACV,IAAK,IAAIH,EAAI,EAAGA,EAAIoI,EAAIzI,OAAS,EAAGK,IAClCG,GAAOwtB,OAAOC,aAAaxlB,EAAIylB,aAAiB,EAAJ7tB,IAE9C,OAAOG,EACF,GAAY,WAARzB,EAAkB,CAC3B,MAAMovB,EAASR,EAAOllB,MAAMoB,SAAS,SACrC,OAAK1L,KAAK0C,UAAUstB,GAIbA,EAHER,EAAOtuB,MAAM,0DAIjB,GAAY,WAARN,EACT,OAAO4uB,EAAOllB,MACT,GAAY,YAAR1J,EACT,OAAO4uB,EAAOllB,MACT,GAAY,aAAR1J,EAAoB,CAC7B,MAAMqvB,EAAWT,EAAOllB,MAAMoB,SAAS,SACvC,OAAK1L,KAAK2C,YAAYstB,GAIfA,EAHET,EAAOtuB,MAAM,4DAIjB,MAAI,OAAO0B,KAAKhC,GACd4uB,EAAOllB,MAAMoB,WAEb8jB,EAAOtuB,MAAM,4BAA8BN,EAAM,iBAI5DR,EAAQiB,UAAUwS,aAAe,SAAqB2b,EAAQzsB,EAAQC,GACpE,IAAI2P,EACJ,MAAMud,EAAc,GACpB,IAAIzsB,EAAQ,EACR0sB,EAAW,EACf,OAAQX,EAAOrlB,UACbgmB,EAAWX,EAAOplB,YAClB3G,IAAU,EACVA,GAAoB,IAAX0sB,EACiB,KAAV,IAAXA,KACHD,EAAYjoB,KAAKxE,GACjBA,EAAQ,GAGG,IAAX0sB,GACFD,EAAYjoB,KAAKxE,GAEnB,MAAM2sB,EAASF,EAAY,GAAK,GAAM,EAChCG,EAASH,EAAY,GAAK,GAOhC,GAJEvd,EADE3P,EACOktB,EAEA,CAACE,EAAOC,GAAQzf,OAAOsf,EAAY9sB,MAAM,IAEhDL,EAAQ,CACV,IAAIuqB,EAAMvqB,EAAO4P,EAAOlR,KAAK,WACjB+D,IAAR8nB,IACFA,EAAMvqB,EAAO4P,EAAOlR,KAAK,YACf+D,IAAR8nB,IACF3a,EAAS2a,GAGb,OAAO3a,GAGTvS,EAAQiB,UAAUyS,YAAc,SAAoB0b,EAAQ5uB,GAC1D,MAAMyB,EAAMmtB,EAAOllB,MAAMoB,WAEzB,IAAI4kB,EACAC,EACAC,EACAC,EACA/X,EACAgY,EACJ,GAAY,YAAR9vB,EACF0vB,EAAyB,EAAlBjuB,EAAIe,MAAM,EAAG,GACpBmtB,EAAwB,EAAlBluB,EAAIe,MAAM,EAAG,GACnBotB,EAAwB,EAAlBnuB,EAAIe,MAAM,EAAG,GACnBqtB,EAA0B,EAAnBpuB,EAAIe,MAAM,EAAG,IACpBsV,EAA0B,EAApBrW,EAAIe,MAAM,GAAI,IACpBstB,EAA0B,EAApBruB,EAAIe,MAAM,GAAI,QACf,IAAY,YAARxC,EAYT,OAAO4uB,EAAOtuB,MAAM,YAAcN,EAAM,8BAXxC0vB,EAAyB,EAAlBjuB,EAAIe,MAAM,EAAG,GACpBmtB,EAAwB,EAAlBluB,EAAIe,MAAM,EAAG,GACnBotB,EAAwB,EAAlBnuB,EAAIe,MAAM,EAAG,GACnBqtB,EAAyB,EAAlBpuB,EAAIe,MAAM,EAAG,GACpBsV,EAAyB,EAAnBrW,EAAIe,MAAM,EAAG,IACnBstB,EAA0B,EAApBruB,EAAIe,MAAM,GAAI,IAElBktB,EADEA,EAAO,GACF,IAAOA,EAEP,KAAOA,EAKlB,OAAOvsB,KAAK4sB,IAAIL,EAAMC,EAAM,EAAGC,EAAKC,EAAM/X,EAAKgY,EAAK,IAGtDtwB,EAAQiB,UAAU0S,YAAc,WAC9B,OAAO,MAGT3T,EAAQiB,UAAU2S,YAAc,SAAoBwb,GAClD,MAAMvwB,EAAMuwB,EAAOplB,YACnB,OAAIolB,EAAOxc,QAAQ/T,GACVA,EAEQ,IAARA,GAGXmB,EAAQiB,UAAU4S,WAAa,SAAmBub,EAAQzsB,GAExD,MAAMuH,EAAMklB,EAAOllB,MACnB,IAAIrL,EAAM,IAAIsR,EAAOjG,GAKrB,OAHIvH,IACF9D,EAAM8D,EAAO9D,EAAIyM,SAAS,MAAQzM,GAE7BA,GAGTmB,EAAQiB,UAAU4D,KAAO,SAAalF,EAAQmF,GAG5C,MAFsB,oBAAXnF,IACTA,EAASA,EAAOmF,IACXnF,EAAO6wB,YAAY,OAAOzwB,O,kCCxQnC,MAAMR,EAAW,EAAQ,QAEzB,SAASuG,EAASM,GAChBxG,KAAKyK,eAAiB,CACpBvF,IAAK,KACLmD,KAAM,GACN7B,QAASA,GAAW,GACpBb,OAAQ,IA6FZ,SAASkrB,EAAcxoB,EAAMgP,GAC3BrX,KAAKqI,KAAOA,EACZrI,KAAK8wB,QAAQzZ,GA5FfvY,EAAQoH,SAAWA,EAEnBA,EAAS7E,UAAU2R,QAAU,SAAiB9N,GAC5C,OAAOA,aAAe2rB,GAGxB3qB,EAAS7E,UAAU4I,KAAO,WACxB,MAAM3E,EAAQtF,KAAKyK,eAEnB,MAAO,CAAEvF,IAAKI,EAAMJ,IAAK6rB,QAASzrB,EAAM+C,KAAKxG,SAG/CqE,EAAS7E,UAAU6I,QAAU,SAAiB3I,GAC5C,MAAM+D,EAAQtF,KAAKyK,eAEnBnF,EAAMJ,IAAM3D,EAAK2D,IACjBI,EAAM+C,KAAO/C,EAAM+C,KAAKjF,MAAM,EAAG7B,EAAKwvB,UAGxC7qB,EAAS7E,UAAUyR,SAAW,SAAkBzT,GAC9C,OAAOW,KAAKyK,eAAepC,KAAKJ,KAAK5I,IAGvC6G,EAAS7E,UAAUoS,QAAU,SAAiB2E,GAC5C,MAAM9S,EAAQtF,KAAKyK,eAEnBnF,EAAM+C,KAAO/C,EAAM+C,KAAKjF,MAAM,EAAGgV,EAAQ,IAG3ClS,EAAS7E,UAAUqS,SAAW,SAAkB0E,EAAO/Y,EAAKC,GAC1D,MAAMgG,EAAQtF,KAAKyK,eAEnBzK,KAAKyT,QAAQ2E,GACK,OAAd9S,EAAMJ,MACRI,EAAMJ,IAAI7F,GAAOC,IAGrB4G,EAAS7E,UAAUgH,KAAO,WACxB,OAAOrI,KAAKyK,eAAepC,KAAK5G,KAAK,MAGvCyE,EAAS7E,UAAU8R,YAAc,WAC/B,MAAM7N,EAAQtF,KAAKyK,eAEbxB,EAAO3D,EAAMJ,IAEnB,OADAI,EAAMJ,IAAM,GACL+D,GAGT/C,EAAS7E,UAAUmS,YAAc,SAAqBvK,GACpD,MAAM3D,EAAQtF,KAAKyK,eAEbumB,EAAM1rB,EAAMJ,IAElB,OADAI,EAAMJ,IAAM+D,EACL+nB,GAGT9qB,EAAS7E,UAAUH,MAAQ,SAAemW,GACxC,IAAI4Z,EACJ,MAAM3rB,EAAQtF,KAAKyK,eAEbymB,EAAY7Z,aAAewZ,EASjC,GAPEI,EADEC,EACI7Z,EAEA,IAAIwZ,EAAcvrB,EAAM+C,KAAKrJ,KAAI,SAASmyB,GAC9C,MAAO,IAAM9tB,KAAKC,UAAU6tB,GAAQ,OACnC1vB,KAAK,IAAK4V,EAAIxQ,SAAWwQ,EAAKA,EAAI+Z,QAGlC9rB,EAAMkB,QAAQ6qB,QACjB,MAAMJ,EAKR,OAHKC,GACH5rB,EAAMK,OAAOsC,KAAKgpB,GAEbA,GAGT/qB,EAAS7E,UAAUoR,WAAa,SAAoBE,GAClD,MAAMrN,EAAQtF,KAAKyK,eACnB,OAAKnF,EAAMkB,QAAQ6qB,QAGZ,CACL1e,OAAQ3S,KAAKgT,QAAQL,GAAU,KAAOA,EACtChN,OAAQL,EAAMK,QAJPgN,GAYXhT,EAASkxB,EAAeze,OAExBye,EAAcxvB,UAAUyvB,QAAU,SAAiBzZ,GAKjD,GAJArX,KAAK6G,QAAUwQ,EAAM,SAAWrX,KAAKqI,MAAQ,aACzC+J,MAAMkf,mBACRlf,MAAMkf,kBAAkBtxB,KAAM6wB,IAE3B7wB,KAAKoxB,MACR,IAEE,MAAM,IAAIhf,MAAMpS,KAAK6G,SACrB,MAAOb,GACPhG,KAAKoxB,MAAQprB,EAAEorB,MAGnB,OAAOpxB,O,qBCvHT,IAAIyQ,EAAS,EAAQ,QACjB7Q,EAAS,EAAQ,QAAgBA,OACjC2xB,EAAO,EAAQ,QACf5rB,EAAS,EAAQ,QAKjByR,EAAsBzR,EAAOyR,oBAE7Boa,EAAe,CACjBhuB,KAAM,KACNiuB,aAAc,GAMhB,SAASC,EAAM7sB,EAAM8sB,GACnBlhB,EAAOmhB,GAAG/sB,GACV4L,EAAOwB,aAAa,EAAQ,UAC5BxB,EAAOmhB,GAAGD,GACVlhB,EAAOwB,aAAa,EAAM,UAE1B,IAAI9S,EAAOD,OAAO2yB,oBAAoBhtB,GAStC,OARA1F,EAAKC,SAAQ,SAAUC,GACrB,IAAIsyB,EAAGtyB,GAAP,CAGA,IAAIC,EAAQJ,OAAO4yB,yBAAyBjtB,EAAMxF,GAClDH,OAAO6yB,eAAeJ,EAAItyB,EAAKC,OAG1BqyB,EAOT,SAAS7rB,EAAOU,GACdA,EAAUkrB,EAAMF,EAAchrB,GAAW,IAEzCxG,KAAKgyB,KAAOpyB,EAAOmC,MAAMyE,EAAQhD,MAAQ,MACzCxD,KAAKiyB,MAAQjyB,KAAKgyB,KAAKnwB,OACvB7B,KAAKkyB,QAAU,EACflyB,KAAKmyB,SAAW3rB,EAIhBxG,KAAKoyB,KAAO,GAGdlzB,OAAO6yB,eAAejsB,EAAOzE,UAAW,SAAU,CAChD8H,IAAK,WACH,GAAInJ,KAAKoyB,KAAKvwB,OACZ,MAAMuV,EAAoBpX,KAAKoyB,KAAKvwB,OAAS,wBAE/C,OAAQ7B,KAAKgyB,KAAK5uB,MAAM,EAAGpD,KAAKkyB,YAIpCpsB,EAAOzE,UAAUgxB,UAAY,SAAU1iB,GACrC,GAAmB,kBAAR,EACT,MAAM,IAAI2iB,UAAU,6BAEtBtyB,KAAKuyB,QAAQ,GACbvyB,KAAKgyB,KAAKhyB,KAAKkyB,WAAaviB,GAI9B7J,EAAOzE,UAAUmxB,SAAW,SAAUtwB,EAAGtB,GACvC,GAAmB,kBAAR,EACT,MAAM,IAAI0xB,UAAU,6BACD,kBAAV,IACT1xB,EAAM2wB,EAAKvc,SAEb,IAAIyd,EAAK,EAET,OAA8B,KAAhB,WAAJvwB,KAAgD,WAAhB,WAAJA,KAC/BuwB,EAAK,EACVA,IACAvwB,IAAM,EAGR,GAAIuwB,EAAK,EACP,MAAMrb,EAAoB,mCAE5BpX,KAAKuyB,QAAQ,EAAIE,GACjBzyB,KAAKgyB,KAAKhyB,KAAKkyB,WAAatxB,EAC5BZ,KAAKgyB,KAAKhyB,KAAKkyB,WAAaO,EAE5B,MAAOA,KAAO,EACZzyB,KAAKgyB,KAAKhyB,KAAKkyB,YAAmB,WAAJhwB,KAAoB,GAClDA,IAAM,GAMV4D,EAAOzE,UAAUqxB,UAAY,WAC3B1yB,KAAKqyB,UAAUd,EAAKpc,MACpBnV,KAAKqyB,UAAU,IAIjBvsB,EAAOzE,UAAUsxB,iBAAmB,SAAUzwB,EAAGtB,GAC/C,GAAmB,kBAAR,EACT,MAAM,IAAI0xB,UAAU,6BAItB,MAHqB,kBAAV,IACT1xB,EAAM2wB,EAAK/b,aAENxV,KAAKwyB,SAAStwB,EAAGtB,IAI1BkF,EAAOzE,UAAUuxB,aAAe,SAAUjjB,EAAG/O,GAC3C,GAAmB,mBAAR,EACT,MAAM,IAAI0xB,UAAU,8BACD,kBAAV,IACT1xB,EAAM2wB,EAAKxc,SAEb/U,KAAKuyB,QAAQ,GACbvyB,KAAKgyB,KAAKhyB,KAAKkyB,WAAatxB,EAC5BZ,KAAKgyB,KAAKhyB,KAAKkyB,WAAa,EAC5BlyB,KAAKgyB,KAAKhyB,KAAKkyB,WAAaviB,EAAI,IAAO,GAIzC7J,EAAOzE,UAAUwxB,YAAc,SAAU9N,EAAGnkB,GAC1C,GAAmB,kBAAR,EACT,MAAM,IAAI0xB,UAAU,0CAA4C,EAAM,KACnD,kBAAV,IACT1xB,EAAM2wB,EAAKrc,aAEb,IAAItN,EAAMhI,EAAOiK,WAAWkb,GAC5B/kB,KAAKqyB,UAAUzxB,GACfZ,KAAK8yB,YAAYlrB,GACbA,IACF5H,KAAKuyB,QAAQ3qB,GACb5H,KAAKgyB,KAAKtnB,MAAMqa,EAAG/kB,KAAKkyB,SACxBlyB,KAAKkyB,SAAWtqB,IAKpB9B,EAAOzE,UAAU0xB,YAAc,SAAUxwB,EAAK3B,GAC5C,GAAqB,kBAAV,EACT,MAAM,IAAI0xB,UAAU,wBACtB,IAAK1yB,EAAO4E,SAASjC,GACnB,MAAM,IAAI+vB,UAAU,6BAEtBtyB,KAAKqyB,UAAUzxB,GACfZ,KAAK8yB,YAAYvwB,EAAIV,QACrB7B,KAAKuyB,QAAQhwB,EAAIV,QACjBU,EAAIwC,KAAK/E,KAAKgyB,KAAMhyB,KAAKkyB,QAAS,EAAG3vB,EAAIV,QACzC7B,KAAKkyB,SAAW3vB,EAAIV,QAItBiE,EAAOzE,UAAU2xB,iBAAmB,SAAUC,GAC5C,IAAMA,aAAmB/vB,MACvB,MAAM,IAAIovB,UAAU,qCAEtB,IAAI1X,EAAO5a,KACXizB,EAAQ7zB,SAAQ,SAAU2lB,GACxBnK,EAAKiY,YAAY9N,OAKrBjf,EAAOzE,UAAU6xB,SAAW,SAAUnO,EAAGnkB,GACvC,GAAmB,kBAAR,EACT,MAAM,IAAI0xB,UAAU,6BAItB,GAHqB,kBAAV,IACT1xB,EAAM2wB,EAAKnc,MAER,yBAAyBxS,KAAKmiB,GACjC,MAAM,IAAI3S,MAAM,sCAElB,SAAS+gB,EAAY3oB,EAAO4oB,GACtBA,EAAQ,IACR5oB,EAAMvC,KAAKmrB,GACJA,EAAQ,OACf5oB,EAAMvC,KAAMmrB,IAAU,EAAK,KAC3B5oB,EAAMvC,KAAa,IAARmrB,IACJA,EAAQ,SACjB5oB,EAAMvC,KAAMmrB,IAAU,GAAM,KAC5B5oB,EAAMvC,KAA8B,KAAvBmrB,IAAU,EAAK,MAC5B5oB,EAAMvC,KAAa,IAARmrB,IACFA,EAAQ,WACjB5oB,EAAMvC,KAAMmrB,IAAU,GAAM,KAC5B5oB,EAAMvC,KAA+B,KAAxBmrB,IAAU,GAAM,MAC7B5oB,EAAMvC,KAA8B,KAAvBmrB,IAAU,EAAK,MAC5B5oB,EAAMvC,KAAa,IAARmrB,KAEX5oB,EAAMvC,KAA+B,KAAxBmrB,IAAU,GAAM,MAC7B5oB,EAAMvC,KAA+B,KAAxBmrB,IAAU,GAAM,MAC7B5oB,EAAMvC,KAA+B,KAAxBmrB,IAAU,GAAM,MAC7B5oB,EAAMvC,KAA8B,KAAvBmrB,IAAU,EAAK,MAC5B5oB,EAAMvC,KAAa,IAARmrB,IAIf,IAAI9F,EAAMvI,EAAE9hB,MAAM,KACduH,EAAQ,GACZA,EAAMvC,KAA4B,GAAvBorB,SAAS/F,EAAI,GAAI,IAAW+F,SAAS/F,EAAI,GAAI,KACxDA,EAAIlqB,MAAM,GAAGhE,SAAQ,SAAUuQ,GAC7BwjB,EAAY3oB,EAAO6oB,SAAS1jB,EAAG,QAGjC,IAAIiL,EAAO5a,KACXA,KAAKuyB,QAAQ,EAAI/nB,EAAM3I,QACvB7B,KAAKqyB,UAAUzxB,GACfZ,KAAK8yB,YAAYtoB,EAAM3I,QACvB2I,EAAMpL,SAAQ,SAAUuQ,GACtBiL,EAAKyX,UAAU1iB,OAKnB7J,EAAOzE,UAAUyxB,YAAc,SAAUlrB,GACvC,GAAqB,kBAAV,EACT,MAAM,IAAI0qB,UAAU,6BAItB,GAFAtyB,KAAKuyB,QAAQ,GAET3qB,GAAO,IACT5H,KAAKgyB,KAAKhyB,KAAKkyB,WAAatqB,OACvB,GAAIA,GAAO,IAChB5H,KAAKgyB,KAAKhyB,KAAKkyB,WAAa,IAC5BlyB,KAAKgyB,KAAKhyB,KAAKkyB,WAAatqB,OACvB,GAAIA,GAAO,MAChB5H,KAAKgyB,KAAKhyB,KAAKkyB,WAAa,IAC5BlyB,KAAKgyB,KAAKhyB,KAAKkyB,WAAatqB,GAAO,EACnC5H,KAAKgyB,KAAKhyB,KAAKkyB,WAAatqB,MACvB,MAAIA,GAAO,UAMhB,MAAMwP,EAAoB,+BAL1BpX,KAAKgyB,KAAKhyB,KAAKkyB,WAAa,IAC5BlyB,KAAKgyB,KAAKhyB,KAAKkyB,WAAatqB,GAAO,GACnC5H,KAAKgyB,KAAKhyB,KAAKkyB,WAAatqB,GAAO,EACnC5H,KAAKgyB,KAAKhyB,KAAKkyB,WAAatqB,IAMhC9B,EAAOzE,UAAUiyB,cAAgB,SAAU1yB,GACpB,kBAAV,IACTA,EAAM2wB,EAAK3b,SAAW2b,EAAK5a,aAE7B3W,KAAKqyB,UAAUzxB,GACfZ,KAAKoyB,KAAKnqB,KAAKjI,KAAKkyB,SACpBlyB,KAAKuyB,QAAQ,GACbvyB,KAAKkyB,SAAW,GAIlBpsB,EAAOzE,UAAUkyB,YAAc,WAC7B,IAAIC,EAAMxzB,KAAKoyB,KAAK3oB,MAChB4J,EAAQmgB,EAAM,EACd5rB,EAAM5H,KAAKkyB,QAAU7e,EAEzB,GAAIzL,GAAO,IACT5H,KAAKyzB,OAAOpgB,EAAOzL,GAAM,GACzB5H,KAAKgyB,KAAKwB,GAAO5rB,OACZ,GAAIA,GAAO,IAChB5H,KAAKyzB,OAAOpgB,EAAOzL,GAAM,GACzB5H,KAAKgyB,KAAKwB,GAAO,IACjBxzB,KAAKgyB,KAAKwB,EAAM,GAAK5rB,OAChB,GAAIA,GAAO,MAChB5H,KAAKgyB,KAAKwB,GAAO,IACjBxzB,KAAKgyB,KAAKwB,EAAM,GAAK5rB,GAAO,EAC5B5H,KAAKgyB,KAAKwB,EAAM,GAAK5rB,MAChB,MAAIA,GAAO,UAOhB,MAAMwP,EAAoB,qBAN1BpX,KAAKyzB,OAAOpgB,EAAOzL,EAAK,GACxB5H,KAAKgyB,KAAKwB,GAAO,IACjBxzB,KAAKgyB,KAAKwB,EAAM,GAAK5rB,GAAO,GAC5B5H,KAAKgyB,KAAKwB,EAAM,GAAK5rB,GAAO,EAC5B5H,KAAKgyB,KAAKwB,EAAM,GAAK5rB,IAOzB9B,EAAOzE,UAAUoyB,OAAS,SAAUpgB,EAAOzL,EAAK2gB,GAC9C9X,EAAOmhB,QAAapsB,IAAV6N,GACV5C,EAAOmhB,QAAWpsB,IAARoC,GACV6I,EAAOmhB,GAAGrJ,GAEVvoB,KAAKgyB,KAAKjtB,KAAK/E,KAAKgyB,KAAM3e,EAAQkV,EAAOlV,EAAOA,EAAQzL,GACxD5H,KAAKkyB,SAAW3J,GAGlBziB,EAAOzE,UAAUkxB,QAAU,SAAU3qB,GAGnC,GAFA6I,EAAOmhB,GAAGhqB,GAEN5H,KAAKiyB,MAAQjyB,KAAKkyB,QAAUtqB,EAAK,CACnC,IAAI6qB,EAAKzyB,KAAKiyB,MAAQjyB,KAAKmyB,SAASV,aAChCgB,EAAKzyB,KAAKkyB,QAAUtqB,IACtB6qB,GAAM7qB,GAER,IAAIrF,EAAM3C,EAAOmC,MAAM0wB,GAEvBzyB,KAAKgyB,KAAKjtB,KAAKxC,EAAK,EAAG,EAAGvC,KAAKkyB,SAC/BlyB,KAAKgyB,KAAOzvB,EACZvC,KAAKiyB,MAAQQ,IAQjBrxB,EAAOtC,QAAUgH,G,qBC1TjB,IAAI2K,EAAS,EAAQ,QACjB7Q,EAAS,EAAQ,QAAgBA,OAEjC2xB,EAAO,EAAQ,QACf5rB,EAAS,EAAQ,QAKjByR,EAAsBzR,EAAOyR,oBAMjC,SAASvR,EAAOtE,GACd,IAAKA,IAAS3B,EAAO4E,SAASjD,GAC5B,MAAM,IAAI+wB,UAAU,8BAEtBtyB,KAAKgyB,KAAOzwB,EACZvB,KAAKiyB,MAAQ1wB,EAAKM,OAGlB7B,KAAK0zB,KAAO,EACZ1zB,KAAKkyB,QAAU,EAGjBhzB,OAAO6yB,eAAelsB,EAAOxE,UAAW,SAAU,CAChDsyB,YAAY,EACZxqB,IAAK,WAAc,OAAQnJ,KAAS,QAGtCd,OAAO6yB,eAAelsB,EAAOxE,UAAW,SAAU,CAChDsyB,YAAY,EACZxqB,IAAK,WAAc,OAAQnJ,KAAY,WAGzCd,OAAO6yB,eAAelsB,EAAOxE,UAAW,SAAU,CAChD8H,IAAK,WAAc,OAAQnJ,KAAKiyB,MAAQjyB,KAAKkyB,WAG/ChzB,OAAO6yB,eAAelsB,EAAOxE,UAAW,SAAU,CAChD8H,IAAK,WAAc,OAAQnJ,KAAKgyB,KAAK5uB,MAAMpD,KAAKkyB,YAWlDrsB,EAAOxE,UAAUuyB,SAAW,SAAUC,GACpC,GAAI7zB,KAAKiyB,MAAQjyB,KAAKkyB,QAAU,EAC9B,OAAO,KAET,IAAIviB,EAA8B,IAA1B3P,KAAKgyB,KAAKhyB,KAAKkyB,SAKvB,OAHK2B,IACH7zB,KAAKkyB,SAAW,GAEXviB,GAIT9J,EAAOxE,UAAUwyB,KAAO,WACtB,OAAO7zB,KAAK4zB,UAAS,IAevB/tB,EAAOxE,UAAUyyB,WAAa,SAAUnwB,GAItC,QAHe6B,IAAX7B,IACFA,EAAS3D,KAAKkyB,SAEZvuB,GAAU3D,KAAKiyB,MACjB,OAAO,KAET,IAAI8B,EAA6B,IAAtB/zB,KAAKgyB,KAAKruB,KACrB,GAAa,OAATowB,EACF,OAAO,KAET,GAAsB,OAAV,IAAPA,GAAuB,CAG1B,GAFAA,GAAQ,IAEK,IAATA,EACF,MAAM3c,EAAoB,mCAE5B,GAAI2c,EAAO,EACT,MAAM3c,EAAoB,qBAE5B,GAAIpX,KAAKiyB,MAAQtuB,EAASowB,EACxB,OAAO,KAET/zB,KAAK0zB,KAAO,EACZ,IAAK,IAAIxxB,EAAI,EAAGA,EAAI6xB,EAAM7xB,IACxBlC,KAAK0zB,MAAQ1zB,KAAK0zB,MAAQ,IAA4B,IAAtB1zB,KAAKgyB,KAAKruB,WAI5C3D,KAAK0zB,KAAOK,EAGd,OAAOpwB,GAWTkC,EAAOxE,UAAU2yB,aAAe,SAAUpzB,GACxC,IAAI4yB,EAAMxzB,KAAK6zB,OACf,GAAY,OAARL,EACF,OAAO,KACT,QAAYhuB,IAAR5E,GAAqBA,IAAQ4yB,EAC/B,MAAMpc,EAAoB,cAAgBxW,EAAI8K,SAAS,IAC7B,WAAa8nB,EAAI9nB,SAAS,KAEtD,IAAI+S,EAAIze,KAAK8zB,WAAW9zB,KAAKkyB,QAAU,GACvC,OAAU,OAANzT,EACK,MAETze,KAAKkyB,QAAUzT,EACR+U,IAIT3tB,EAAOxE,UAAU4yB,QAAU,WACzB,OAAOj0B,KAAKk0B,SAAS3C,EAAKvc,UAI5BnP,EAAOxE,UAAU8yB,YAAc,WAC7B,OAAwC,IAAhCn0B,KAAKk0B,SAAS3C,EAAKxc,UAI7BlP,EAAOxE,UAAU+yB,gBAAkB,WACjC,OAAOp0B,KAAKk0B,SAAS3C,EAAK/b,cAI5B3P,EAAOxE,UAAUgzB,WAAa,SAAUzzB,EAAK0zB,GACtC1zB,IACHA,EAAM2wB,EAAKrc,aAEb,IAAIvF,EAAI3P,KAAK6zB,OACb,GAAU,OAANlkB,EACF,OAAO,KAET,GAAIA,IAAM/O,EACR,MAAMwW,EAAoB,cAAgBxW,EAAI8K,SAAS,IAC7B,WAAaiE,EAAEjE,SAAS,KAEpD,IAAI+S,EAAIze,KAAK8zB,WAAW9zB,KAAKkyB,QAAU,GAEvC,GAAU,OAANzT,EACF,OAAO,KAET,GAAIze,KAAK6B,OAAS7B,KAAKiyB,MAAQxT,EAC7B,OAAO,KAIT,GAFAze,KAAKkyB,QAAUzT,EAEK,IAAhBze,KAAK6B,OACP,OAAOyyB,EAAS10B,EAAOmC,MAAM,GAAK,GAEpC,IAAIM,EAAMrC,KAAKgyB,KAAK5uB,MAAMpD,KAAKkyB,QAASlyB,KAAKkyB,QAAUlyB,KAAK6B,QAG5D,OAFA7B,KAAKkyB,SAAWlyB,KAAK6B,OAEdyyB,EAASjyB,EAAMA,EAAIqJ,SAAS,SAGrC7F,EAAOxE,UAAUkzB,QAAU,SAAU3zB,GAC9BA,IACHA,EAAM2wB,EAAKnc,KAEb,IAAIzF,EAAI3P,KAAKq0B,WAAWzzB,GAAK,GAC7B,GAAU,OAAN+O,EACF,OAAO,KAKT,IAHA,IAAI5M,EAAS,GACTzD,EAAQ,EAEH4C,EAAI,EAAGA,EAAIyN,EAAE9N,OAAQK,IAAK,CACjC,IAAIsyB,EAAc,IAAP7kB,EAAEzN,GAEb5C,IAAU,EACVA,GAAgB,IAAPk1B,EACa,KAAV,IAAPA,KACHzxB,EAAOkF,KAAK3I,GACZA,EAAQ,GAQZ,OAJAA,EAAQyD,EAAOwlB,QACfxlB,EAAO6B,QAAQtF,EAAQ,IACvByD,EAAO6B,QAAStF,EAAQ,IAAO,GAExByD,EAAOtB,KAAK,MAIrBoE,EAAOxE,UAAU6yB,SAAW,SAAUtzB,GACpC6P,EAAOmhB,QAAWpsB,IAAR5E,GAEV,IAAI+O,EAAI3P,KAAK6zB,OAEb,GAAU,OAANlkB,EACF,OAAO,KAET,GAAIA,IAAM/O,EACR,MAAMwW,EAAoB,cAAgBxW,EAAI8K,SAAS,IAC7B,WAAaiE,EAAEjE,SAAS,KAEpD,IAAI+S,EAAIze,KAAK8zB,WAAW9zB,KAAKkyB,QAAU,GACvC,GAAU,OAANzT,EACF,OAAO,KAET,GAAIze,KAAK6B,OAAS,EAChB,MAAMuV,EAAoB,qBAAuBpX,KAAK6B,QAExD,GAAI7B,KAAK6B,OAAS7B,KAAKiyB,MAAQxT,EAC7B,OAAO,KACTze,KAAKkyB,QAAUzT,EAKf,IAHA,IAAIgW,EAAKz0B,KAAKgyB,KAAKhyB,KAAKkyB,SACpB5yB,EAAQ,EAEH4C,EAAI,EAAGA,EAAIlC,KAAK6B,OAAQK,IAC/B5C,IAAU,EACVA,GAAsC,IAA5BU,KAAKgyB,KAAKhyB,KAAKkyB,WAM3B,OAHoB,OAAV,IAALuC,IAA6B,IAANvyB,IAC1B5C,GAAU,GAAU,EAAJ4C,GAEX5C,GAAS,GAOlB8B,EAAOtC,QAAU+G,G,sBCrQjB,YAGA,IAAI4K,EAAS,EAAQ,QACjBikB,EAAS,EAAQ,QAAUA,OAC3BC,EAAO,EAAQ,QAMfC,EAAc,gFAKlB,SAASC,EAAYxyB,GACjB,OAAQA,EAAIyyB,OAAO,GAAGnpB,cAAgBtJ,EAAIe,MAAM,GAGpD,SAAS2xB,EAAM70B,EAAM80B,EAAUC,EAAM9iB,EAAK+iB,GACtC,MAAM,IAAIzkB,EAAO0kB,eAAe,CAC5BtuB,QAAS8tB,EAAKS,OAAO,sBAAuBl1B,EAAM80B,GAClDE,YAAoB1vB,IAAX0vB,SAA+B,EAAQA,EAAO/iB,GACvD6iB,SAAUA,EACVK,SAAUJ,GAAQ,MAClBK,mBAAoBP,EAAMQ,SAIlC,SAASC,EAAUrjB,GACf,OAAQjT,OAAOmC,UAAUqK,SAASlL,KAAK2R,GAAK/O,MAAM,GAAI,GAG1D,SAASqyB,KAOT,IAAI7vB,EAAQ,CACR8vB,KAAM,CACFC,MAAO,SAAUxjB,GAAO,MAAwB,mBAAV,IAE1CyjB,KAAM,CACFD,MAAO,SAAUxjB,GAAO,MAAwB,oBAAV,IAE1CjH,OAAQ,CACJyqB,MAAO,SAAUxjB,GAAO,MAAwB,kBAAV,IAE1C0jB,OAAQ,CACJF,MAAO,SAAUxjB,GACb,MAAwB,kBAAV,GAA8B,OAARA,IAG5CwF,OAAQ,CACJge,MAAO,SAAUxjB,GACb,MAAwB,kBAAV,IAAuB2jB,MAAM3jB,KAGnD4jB,OAAQ,CACJJ,MAAO,SAAUxjB,GACb,MAAwB,kBAAV,IAAuB2jB,MAAM3jB,IAAQ6jB,SAAS7jB,KAGpEqd,OAAQ,CACJmG,MAAO,SAAUxjB,GAAO,OAAOvS,EAAO4E,SAAS2N,IAC/CkjB,SAAU,mBAEdY,MAAO,CACHN,MAAO,SAAUxjB,GAAO,OAAOjP,MAAMC,QAAQgP,IAC7CkjB,SAAU,iBAEda,OAAQ,CACJP,MAAO,SAAUxjB,GAAO,OAAOA,aAAeuiB,GAC9CW,SAAU,aACVH,OAAQM,GAEZ1xB,KAAM,CACF6xB,MAAO,SAAUxjB,GAAO,OAAOA,aAAepO,MAC9CsxB,SAAU,aACVH,OAAQM,GAEZW,OAAQ,CACJR,MAAO,SAAUxjB,GAAO,OAAOA,aAAeikB,QAC9Cf,SAAU,aACVH,OAAQM,GAEZa,KAAM,CACFV,MAAO,SAAUxjB,GACb,MAAwB,kBAAV,GAAsByiB,EAAYhyB,KAAKuP,IAEzDkjB,SAAU,WAIlB,SAASiB,EAAYC,GACjB,IACIzxB,EADA3F,EAAOD,OAAOC,KAAKyG,GA6GvB,OAxGId,EADA,0+BAAY0xB,YACNf,EAEA,SAAUtjB,EAAKkF,GACZlF,GACD4iB,EAAM1d,EAAK,OAAQlF,IAM/BhT,EAAKC,SAAQ,SAAU2b,GACnB,GAAIwb,EACAzxB,EAAIiW,GAAK0a,MADb,CAIA,IAAIthB,EAAOvO,EAAMmV,GACjBjW,EAAIiW,GAAK,SAAU5I,EAAKkF,GACflD,EAAKwhB,MAAMxjB,IACZ4iB,EAAM1d,EAAK0D,EAAG5G,EAAKkhB,SAAUljB,EAAKgC,EAAK+gB,aAMnD/1B,EAAKC,SAAQ,SAAU2b,GACnB,IAAI7a,EAAO,WAAa20B,EAAY9Z,GACpC,GAAIwb,EACAzxB,EAAI5E,GAAQu1B,MADhB,CAIA,IAAIthB,EAAOvO,EAAMmV,GACjBjW,EAAI5E,GAAQ,SAAUiS,EAAKkF,QACX7R,IAAR2M,GAA6B,OAARA,IAGpBgC,EAAKwhB,MAAMxjB,IACZ4iB,EAAM1d,EAAK0D,EAAG5G,EAAKkhB,SAAUljB,EAAKgC,EAAK+gB,cAMnD/1B,EAAKC,SAAQ,SAAU2b,GACnB,IAAI7a,EAAO,UAAY20B,EAAY9Z,GACnC,GAAIwb,EACAzxB,EAAI5E,GAAQu1B,MADhB,CAIA,IAAIthB,EAAOvO,EAAMmV,GACbia,EAAW,IAAMja,EAAI,IACzBjW,EAAI5E,GAAQ,SAAUiS,EAAKkF,GAIvB,IAAInV,EACJ,IAJKgB,MAAMC,QAAQgP,IACf4iB,EAAM1d,EAAK2d,EAAU7gB,EAAKkhB,SAAUljB,EAAKgC,EAAK+gB,QAG7ChzB,EAAI,EAAGA,EAAIiQ,EAAItQ,OAAQK,IACnBiS,EAAKwhB,MAAMxjB,EAAIjQ,KAChB6yB,EAAM1d,EAAK2d,EAAU7gB,EAAKkhB,SAAUljB,EAAKgC,EAAK+gB,aAO9D/1B,EAAKC,SAAQ,SAAU2b,GACnB,IAAI7a,EAAO,kBAAoB20B,EAAY9Z,GAC3C,GAAIwb,EACAzxB,EAAI5E,GAAQu1B,MADhB,CAIA,IAAIthB,EAAOvO,EAAMmV,GACbia,EAAW,IAAMja,EAAI,IACzBjW,EAAI5E,GAAQ,SAAUiS,EAAKkF,GAOvB,IAAInV,EANJ,QAAYsD,IAAR2M,GAA6B,OAARA,EAOzB,IAJKjP,MAAMC,QAAQgP,IACf4iB,EAAM1d,EAAK2d,EAAU7gB,EAAKkhB,SAAUljB,EAAKgC,EAAK+gB,QAG7ChzB,EAAI,EAAGA,EAAIiQ,EAAItQ,OAAQK,IACnBiS,EAAKwhB,MAAMxjB,EAAIjQ,KAChB6yB,EAAM1d,EAAK2d,EAAU7gB,EAAKkhB,SAAUljB,EAAKgC,EAAK+gB,aAO9Dh2B,OAAOC,KAAKsR,GAAQrR,SAAQ,SAAU2b,GAM9BjW,EAAIiW,GALE,mBAANA,GAIAwb,EACSd,EAJAhlB,EAAOsK,MAWxBjW,EAAIwxB,YAAcA,EAEXxxB,EAGX1D,EAAOtC,QAAUw3B,EAAY,0+BAAYE,e,+DChNzC,MAAM92B,EAAW,EAAQ,QACnBF,EAAW,EAAQ,QACnBG,EAAW,EAAQ,QAEnB82B,EAAM33B,EAMZ,SAAS43B,EAAOx2B,EAAMI,GACpBN,KAAKE,KAAOA,EACZF,KAAKM,KAAOA,EAEZN,KAAKR,SAAW,GAChBQ,KAAKN,SAAW,GATlB+2B,EAAIjmB,OAAS,SAAgBtQ,EAAMI,GACjC,OAAO,IAAIo2B,EAAOx2B,EAAMI,IAW1Bo2B,EAAOr1B,UAAUs1B,aAAe,SAAqBC,GACnD,MAAM12B,EAAOF,KAAKE,KAElB,SAAS22B,EAAU92B,GACjBC,KAAK82B,WAAW/2B,EAAQG,GAO1B,OALAP,EAASk3B,EAAWD,GACpBC,EAAUx1B,UAAUy1B,WAAa,SAAoB/2B,EAAQG,GAC3D02B,EAAKp2B,KAAKR,KAAMD,EAAQG,IAGnB,IAAI22B,EAAU72B,OAGvB02B,EAAOr1B,UAAUuvB,YAAc,SAAqB3wB,GAKlD,OAJAA,EAAMA,GAAO,MAERD,KAAKR,SAASyB,eAAehB,KAChCD,KAAKR,SAASS,GAAOD,KAAK22B,aAAan3B,EAASS,KAC3CD,KAAKR,SAASS,IAGvBy2B,EAAOr1B,UAAU0V,OAAS,SAAgBxV,EAAMtB,EAAKuG,GACnD,OAAOxG,KAAK4wB,YAAY3wB,GAAK8W,OAAOxV,EAAMiF,IAG5CkwB,EAAOr1B,UAAU8D,YAAc,SAAqBlF,GAKlD,OAJAA,EAAMA,GAAO,MAERD,KAAKN,SAASuB,eAAehB,KAChCD,KAAKN,SAASO,GAAOD,KAAK22B,aAAaj3B,EAASO,KAC3CD,KAAKN,SAASO,IAGvBy2B,EAAOr1B,UAAUC,OAAS,SAAgBC,EAAMtB,EAAoBc,GAClE,OAAOf,KAAKmF,YAAYlF,GAAKqB,OAAOC,EAAMR,K,mCCvD5C,YAEA,IAAIg2B,EAAe,EAAQ;;;;;;GAW3B,SAASC,EAAQtnB,EAAGC,GAClB,GAAID,IAAMC,EACR,OAAO,EAMT,IAHA,IAAIqU,EAAItU,EAAE7N,OACNoiB,EAAItU,EAAE9N,OAEDK,EAAI,EAAG0F,EAAM6Q,KAAKC,IAAIsL,EAAGC,GAAI/hB,EAAI0F,IAAO1F,EAC/C,GAAIwN,EAAExN,KAAOyN,EAAEzN,GAAI,CACjB8hB,EAAItU,EAAExN,GACN+hB,EAAItU,EAAEzN,GACN,MAIJ,OAAI8hB,EAAIC,GACE,EAENA,EAAID,EACC,EAEF,EAET,SAASxf,EAASmL,GAChB,OAAIsnB,EAAOr3B,QAA4C,oBAA3Bq3B,EAAOr3B,OAAO4E,SACjCyyB,EAAOr3B,OAAO4E,SAASmL,KAEjB,MAALA,IAAaA,EAAEunB,WA+B3B,IAAIvC,EAAO,EAAQ,QACfwC,EAASj4B,OAAOmC,UAAUJ,eAC1Bm2B,EAASl0B,MAAM7B,UAAU+B,MACzBi0B,EAAsB,WACxB,MAAkC,QAA3B,aAAkBn3B,KADF,GAGzB,SAASo3B,EAAWpyB,GAClB,OAAOhG,OAAOmC,UAAUqK,SAASlL,KAAK0E,GAExC,SAASqyB,EAAOC,GACd,OAAIhzB,EAASgzB,KAGqB,oBAAvBP,EAAOQ,cAGgB,oBAAvBA,YAAYF,OACdE,YAAYF,OAAOC,KAEvBA,IAGDA,aAAkBE,aAGlBF,EAAOhI,QAAUgI,EAAOhI,kBAAkBiI,gBAShD,IAAIhnB,EAASrP,EAAOtC,QAAU8yB,EAO1B+F,EAAQ,8BAEZ,SAASC,EAAQhC,GACf,GAAKjB,EAAKkD,WAAWjC,GAArB,CAGA,GAAIyB,EACF,OAAOzB,EAAK11B,KAEd,IAAImC,EAAMuzB,EAAKlqB,WACXmB,EAAQxK,EAAIwK,MAAM8qB,GACtB,OAAO9qB,GAASA,EAAM,IAyCxB,SAASirB,EAAS/S,EAAGa,GACnB,MAAiB,kBAANb,EACFA,EAAEljB,OAAS+jB,EAAIb,EAAIA,EAAE3hB,MAAM,EAAGwiB,GAE9Bb,EAGX,SAAS5K,EAAQ4d,GACf,GAAIV,IAAuB1C,EAAKkD,WAAWE,GACzC,OAAOpD,EAAKxa,QAAQ4d,GAEtB,IAAIC,EAAUJ,EAAQG,GAClB73B,EAAO83B,EAAU,KAAOA,EAAU,GACtC,MAAO,YAAe93B,EAAO,IAE/B,SAAS+3B,EAAWrd,GAClB,OAAOkd,EAAS3d,EAAQS,EAAKsa,QAAS,KAAO,IACtCta,EAAKya,SAAW,IAChByC,EAAS3d,EAAQS,EAAKoa,UAAW,KAc1C,SAASzqB,EAAK2qB,EAAQF,EAAUnuB,EAASwuB,EAAUC,GACjD,MAAM,IAAI7kB,EAAO0kB,eAAe,CAC9BtuB,QAASA,EACTquB,OAAQA,EACRF,SAAUA,EACVK,SAAUA,EACVC,mBAAoBA,IAcxB,SAAS1D,EAAGtyB,EAAOuH,GACZvH,GAAOiL,EAAKjL,GAAO,EAAMuH,EAAS,KAAM4J,EAAOmhB,IAoCtD,SAASsG,EAAWhD,EAAQF,EAAUmD,EAAQC,GAE5C,GAAIlD,IAAWF,EACb,OAAO,EACF,GAAIxwB,EAAS0wB,IAAW1wB,EAASwwB,GACtC,OAAqC,IAA9BgC,EAAQ9B,EAAQF,GAIlB,GAAIL,EAAK0D,OAAOnD,IAAWP,EAAK0D,OAAOrD,GAC5C,OAAOE,EAAOoD,YAActD,EAASsD,UAKhC,GAAI3D,EAAK4D,SAASrD,IAAWP,EAAK4D,SAASvD,GAChD,OAAOE,EAAOsD,SAAWxD,EAASwD,QAC3BtD,EAAO+B,SAAWjC,EAASiC,QAC3B/B,EAAOuD,YAAczD,EAASyD,WAC9BvD,EAAOwD,YAAc1D,EAAS0D,WAC9BxD,EAAOyD,aAAe3D,EAAS2D,WAIjC,GAAgB,OAAXzD,GAAqC,kBAAXA,GACb,OAAbF,GAAyC,kBAAbA,EASjC,IAAIuC,EAAOrC,IAAWqC,EAAOvC,IACzBsC,EAAUpC,KAAYoC,EAAUtC,MAC9BE,aAAkB0D,cAClB1D,aAAkB2D,cAC7B,OACoD,IAD7C7B,EAAQ,IAAI8B,WAAW5D,EAAO1F,QACtB,IAAIsJ,WAAW9D,EAASxF,SAQlC,GAAIhrB,EAAS0wB,KAAY1wB,EAASwwB,GACvC,OAAO,EAEPoD,EAAQA,GAAS,CAAClD,OAAQ,GAAIF,SAAU,IAExC,IAAI+D,EAAcX,EAAMlD,OAAOltB,QAAQktB,GACvC,OAAqB,IAAjB6D,GACEA,IAAgBX,EAAMpD,SAAShtB,QAAQgtB,KAK7CoD,EAAMlD,OAAOjtB,KAAKitB,GAClBkD,EAAMpD,SAAS/sB,KAAK+sB,GAEbgE,EAAS9D,EAAQF,EAAUmD,EAAQC,IApC1C,OAAOD,EAASjD,IAAWF,EAAWE,GAAUF,EAwCpD,SAASiE,EAAYpD,GACnB,MAAiD,sBAA1C32B,OAAOmC,UAAUqK,SAASlL,KAAKq1B,GAGxC,SAASmD,EAAStpB,EAAGC,EAAGwoB,EAAQe,GAC9B,GAAU,OAANxpB,QAAoBlK,IAANkK,GAAyB,OAANC,QAAoBnK,IAANmK,EACjD,OAAO,EAET,GAAIglB,EAAKwE,YAAYzpB,IAAMilB,EAAKwE,YAAYxpB,GAC1C,OAAOD,IAAMC,EACf,GAAIwoB,GAAUj5B,OAAOk6B,eAAe1pB,KAAOxQ,OAAOk6B,eAAezpB,GAC/D,OAAO,EACT,IAAI0pB,EAAUJ,EAAYvpB,GACtB4pB,EAAUL,EAAYtpB,GAC1B,GAAK0pB,IAAYC,IAAcD,GAAWC,EACxC,OAAO,EACT,GAAID,EAGF,OAFA3pB,EAAI0nB,EAAO52B,KAAKkP,GAChBC,EAAIynB,EAAO52B,KAAKmP,GACTuoB,EAAWxoB,EAAGC,EAAGwoB,GAE1B,IAEI94B,EAAK6C,EAFLq3B,EAAKC,EAAW9pB,GAChB+pB,EAAKD,EAAW7pB,GAIpB,GAAI4pB,EAAG13B,SAAW43B,EAAG53B,OACnB,OAAO,EAKT,IAHA03B,EAAGrxB,OACHuxB,EAAGvxB,OAEEhG,EAAIq3B,EAAG13B,OAAS,EAAGK,GAAK,EAAGA,IAC9B,GAAIq3B,EAAGr3B,KAAOu3B,EAAGv3B,GACf,OAAO,EAIX,IAAKA,EAAIq3B,EAAG13B,OAAS,EAAGK,GAAK,EAAGA,IAE9B,GADA7C,EAAMk6B,EAAGr3B,IACJg2B,EAAWxoB,EAAErQ,GAAMsQ,EAAEtQ,GAAM84B,EAAQe,GACtC,OAAO,EAEX,OAAO,EAaT,SAASQ,EAAmBxE,EAAQF,EAAUnuB,GACxCqxB,EAAWhD,EAAQF,GAAU,IAC/BzqB,EAAK2qB,EAAQF,EAAUnuB,EAAS,qBAAsB6yB,GAuB1D,SAASC,EAAkBzE,EAAQF,GACjC,IAAKE,IAAWF,EACd,OAAO,EAGT,GAAgD,mBAA5C91B,OAAOmC,UAAUqK,SAASlL,KAAKw0B,GACjC,OAAOA,EAASpyB,KAAKsyB,GAGvB,IACE,GAAIA,aAAkBF,EACpB,OAAO,EAET,MAAOhvB,IAIT,OAAIoM,MAAMwnB,cAAc5E,KAIa,IAA9BA,EAASx0B,KAAK,GAAI00B,GAG3B,SAAS2E,EAAUC,GACjB,IAAI54B,EACJ,IACE44B,IACA,MAAO9zB,GACP9E,EAAQ8E,EAEV,OAAO9E,EAGT,SAAS64B,EAAQC,EAAaF,EAAO9E,EAAUnuB,GAC7C,IAAIquB,EAEJ,GAAqB,oBAAV4E,EACT,MAAM,IAAIxH,UAAU,uCAGE,kBAAb0C,IACTnuB,EAAUmuB,EACVA,EAAW,MAGbE,EAAS2E,EAAUC,GAEnBjzB,GAAWmuB,GAAYA,EAAS90B,KAAO,KAAO80B,EAAS90B,KAAO,KAAO,MAC1D2G,EAAU,IAAMA,EAAU,KAEjCmzB,IAAgB9E,GAClB3qB,EAAK2qB,EAAQF,EAAU,6BAA+BnuB,GAGxD,IAAIozB,EAAyC,kBAAZpzB,EAC7BqzB,GAAuBF,GAAerF,EAAK3hB,QAAQkiB,GACnDiF,GAAyBH,GAAe9E,IAAWF,EASvD,IAPKkF,GACDD,GACAN,EAAkBzE,EAAQF,IAC1BmF,IACF5vB,EAAK2qB,EAAQF,EAAU,yBAA2BnuB,GAG/CmzB,GAAe9E,GAAUF,IACzB2E,EAAkBzE,EAAQF,KAAgBgF,GAAe9E,EAC5D,MAAMA,EAmBV,SAASiD,EAAO74B,EAAOuH,GAChBvH,GAAOiL,EAAKjL,GAAO,EAAMuH,EAAS,KAAMsxB,GA3W/C1nB,EAAO0kB,eAAiB,SAAwB3uB,GAC9CxG,KAAKE,KAAO,iBACZF,KAAKk1B,OAAS1uB,EAAQ0uB,OACtBl1B,KAAKg1B,SAAWxuB,EAAQwuB,SACxBh1B,KAAKq1B,SAAW7uB,EAAQ6uB,SACpB7uB,EAAQK,SACV7G,KAAK6G,QAAUL,EAAQK,QACvB7G,KAAKo6B,kBAAmB,IAExBp6B,KAAK6G,QAAUoxB,EAAWj4B,MAC1BA,KAAKo6B,kBAAmB,GAE1B,IAAI9E,EAAqB9uB,EAAQ8uB,oBAAsB/qB,EACvD,GAAI6H,MAAMkf,kBACRlf,MAAMkf,kBAAkBtxB,KAAMs1B,OACzB,CAEL,IAAIrE,EAAM,IAAI7e,MACd,GAAI6e,EAAIG,MAAO,CACb,IAAItsB,EAAMmsB,EAAIG,MAGViJ,EAAUzC,EAAQtC,GAClBgF,EAAMx1B,EAAIkD,QAAQ,KAAOqyB,GAC7B,GAAIC,GAAO,EAAG,CAGZ,IAAIC,EAAYz1B,EAAIkD,QAAQ,KAAMsyB,EAAM,GACxCx1B,EAAMA,EAAI01B,UAAUD,EAAY,GAGlCv6B,KAAKoxB,MAAQtsB,KAMnB6vB,EAAKh1B,SAAS8Q,EAAO0kB,eAAgB/iB,OA6CrC3B,EAAOlG,KAAOA,EAYdkG,EAAOmhB,GAAKA,EAMZnhB,EAAOwB,MAAQ,SAAeijB,EAAQF,EAAUnuB,GAC1CquB,GAAUF,GAAUzqB,EAAK2qB,EAAQF,EAAUnuB,EAAS,KAAM4J,EAAOwB,QAMvExB,EAAOgqB,SAAW,SAAkBvF,EAAQF,EAAUnuB,GAChDquB,GAAUF,GACZzqB,EAAK2qB,EAAQF,EAAUnuB,EAAS,KAAM4J,EAAOgqB,WAOjDhqB,EAAOiqB,UAAY,SAAmBxF,EAAQF,EAAUnuB,GACjDqxB,EAAWhD,EAAQF,GAAU,IAChCzqB,EAAK2qB,EAAQF,EAAUnuB,EAAS,YAAa4J,EAAOiqB,YAIxDjqB,EAAOkqB,gBAAkB,SAAyBzF,EAAQF,EAAUnuB,GAC7DqxB,EAAWhD,EAAQF,GAAU,IAChCzqB,EAAK2qB,EAAQF,EAAUnuB,EAAS,kBAAmB4J,EAAOkqB,kBAuH9DlqB,EAAOmqB,aAAe,SAAsB1F,EAAQF,EAAUnuB,GACxDqxB,EAAWhD,EAAQF,GAAU,IAC/BzqB,EAAK2qB,EAAQF,EAAUnuB,EAAS,eAAgB4J,EAAOmqB,eAI3DnqB,EAAOipB,mBAAqBA,EAW5BjpB,EAAOoqB,YAAc,SAAqB3F,EAAQF,EAAUnuB,GACtDquB,IAAWF,GACbzqB,EAAK2qB,EAAQF,EAAUnuB,EAAS,MAAO4J,EAAOoqB,cAOlDpqB,EAAOqqB,eAAiB,SAAwB5F,EAAQF,EAAUnuB,GAC5DquB,IAAWF,GACbzqB,EAAK2qB,EAAQF,EAAUnuB,EAAS,MAAO4J,EAAOqqB,iBA+ElDrqB,EAAOsqB,OAAS,SAASjB,EAAmB54B,EAAmB2F,GAC7DkzB,GAAQ,EAAMD,EAAO54B,EAAO2F,IAI9B4J,EAAOuqB,aAAe,SAASlB,EAAmB54B,EAAmB2F,GACnEkzB,GAAQ,EAAOD,EAAO54B,EAAO2F,IAG/B4J,EAAOwqB,QAAU,SAAShK,GAAO,GAAIA,EAAK,MAAMA,GAMhDxgB,EAAO0nB,OAASpB,EAAaoB,EAAQ1nB,EAAQ,CAC3CwB,MAAOxB,EAAOoqB,YACdH,UAAWjqB,EAAOkqB,gBAClBF,SAAUhqB,EAAOqqB,eACjBF,aAAcnqB,EAAOipB,qBAEvBjpB,EAAO0nB,OAAOA,OAAS1nB,EAAO0nB,OAE9B,IAAIqB,EAAat6B,OAAOC,MAAQ,SAAU+F,GACxC,IAAI/F,EAAO,GACX,IAAK,IAAIE,KAAO6F,EACViyB,EAAO32B,KAAK0E,EAAK7F,IAAMF,EAAK8I,KAAK5I,GAEvC,OAAOF,K","file":"js/account~15ae29a2.114d7982.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","\n/*!\n *  Copyright 2010 LearnBoost <dev@learnboost.com>\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Module dependencies.\n */\n\nvar crypto = require('crypto')\n  , parse = require('url').parse\n  ;\n\n/**\n * Valid keys.\n */\n\nvar keys = \n  [ 'acl'\n  , 'location'\n  , 'logging'\n  , 'notification'\n  , 'partNumber'\n  , 'policy'\n  , 'requestPayment'\n  , 'torrent'\n  , 'uploadId'\n  , 'uploads'\n  , 'versionId'\n  , 'versioning'\n  , 'versions'\n  , 'website'\n  ]\n\n/**\n * Return an \"Authorization\" header value with the given `options`\n * in the form of \"AWS <key>:<signature>\"\n *\n * @param {Object} options\n * @return {String}\n * @api private\n */\n\nfunction authorization (options) {\n  return 'AWS ' + options.key + ':' + sign(options)\n}\n\nmodule.exports = authorization\nmodule.exports.authorization = authorization\n\n/**\n * Simple HMAC-SHA1 Wrapper\n *\n * @param {Object} options\n * @return {String}\n * @api private\n */ \n\nfunction hmacSha1 (options) {\n  return crypto.createHmac('sha1', options.secret).update(options.message).digest('base64')\n}\n\nmodule.exports.hmacSha1 = hmacSha1\n\n/**\n * Create a base64 sha1 HMAC for `options`. \n * \n * @param {Object} options\n * @return {String}\n * @api private\n */\n\nfunction sign (options) {\n  options.message = stringToSign(options)\n  return hmacSha1(options)\n}\nmodule.exports.sign = sign\n\n/**\n * Create a base64 sha1 HMAC for `options`. \n *\n * Specifically to be used with S3 presigned URLs\n * \n * @param {Object} options\n * @return {String}\n * @api private\n */\n\nfunction signQuery (options) {\n  options.message = queryStringToSign(options)\n  return hmacSha1(options)\n}\nmodule.exports.signQuery= signQuery\n\n/**\n * Return a string for sign() with the given `options`.\n *\n * Spec:\n * \n *    <verb>\\n\n *    <md5>\\n\n *    <content-type>\\n\n *    <date>\\n\n *    [headers\\n]\n *    <resource>\n *\n * @param {Object} options\n * @return {String}\n * @api private\n */\n\nfunction stringToSign (options) {\n  var headers = options.amazonHeaders || ''\n  if (headers) headers += '\\n'\n  var r = \n    [ options.verb\n    , options.md5\n    , options.contentType\n    , options.date ? options.date.toUTCString() : ''\n    , headers + options.resource\n    ]\n  return r.join('\\n')\n}\nmodule.exports.stringToSign = stringToSign\n\n/**\n * Return a string for sign() with the given `options`, but is meant exclusively\n * for S3 presigned URLs\n *\n * Spec:\n * \n *    <date>\\n\n *    <resource>\n *\n * @param {Object} options\n * @return {String}\n * @api private\n */\n\nfunction queryStringToSign (options){\n  return 'GET\\n\\n\\n' + options.date + '\\n' + options.resource\n}\nmodule.exports.queryStringToSign = queryStringToSign\n\n/**\n * Perform the following:\n *\n *  - ignore non-amazon headers\n *  - lowercase fields\n *  - sort lexicographically\n *  - trim whitespace between \":\"\n *  - join with newline\n *\n * @param {Object} headers\n * @return {String}\n * @api private\n */\n\nfunction canonicalizeHeaders (headers) {\n  var buf = []\n    , fields = Object.keys(headers)\n    ;\n  for (var i = 0, len = fields.length; i < len; ++i) {\n    var field = fields[i]\n      , val = headers[field]\n      , field = field.toLowerCase()\n      ;\n    if (0 !== field.indexOf('x-amz')) continue\n    buf.push(field + ':' + val)\n  }\n  return buf.sort().join('\\n')\n}\nmodule.exports.canonicalizeHeaders = canonicalizeHeaders\n\n/**\n * Perform the following:\n *\n *  - ignore non sub-resources\n *  - sort lexicographically\n *\n * @param {String} resource\n * @return {String}\n * @api private\n */\n\nfunction canonicalizeResource (resource) {\n  var url = parse(resource, true)\n    , path = url.pathname\n    , buf = []\n    ;\n\n  Object.keys(url.query).forEach(function(key){\n    if (!~keys.indexOf(key)) return\n    var val = '' == url.query[key] ? '' : '=' + encodeURIComponent(url.query[key])\n    buf.push(key + val)\n  })\n\n  return path + (buf.length ? '?' + buf.sort().join('&') : '')\n}\nmodule.exports.canonicalizeResource = canonicalizeResource\n","module.exports = function(size) {\n  return new LruCache(size)\n}\n\nfunction LruCache(size) {\n  this.capacity = size | 0\n  this.map = Object.create(null)\n  this.list = new DoublyLinkedList()\n}\n\nLruCache.prototype.get = function(key) {\n  var node = this.map[key]\n  if (node == null) return undefined\n  this.used(node)\n  return node.val\n}\n\nLruCache.prototype.set = function(key, val) {\n  var node = this.map[key]\n  if (node != null) {\n    node.val = val\n  } else {\n    if (!this.capacity) this.prune()\n    if (!this.capacity) return false\n    node = new DoublyLinkedNode(key, val)\n    this.map[key] = node\n    this.capacity--\n  }\n  this.used(node)\n  return true\n}\n\nLruCache.prototype.used = function(node) {\n  this.list.moveToFront(node)\n}\n\nLruCache.prototype.prune = function() {\n  var node = this.list.pop()\n  if (node != null) {\n    delete this.map[node.key]\n    this.capacity++\n  }\n}\n\n\nfunction DoublyLinkedList() {\n  this.firstNode = null\n  this.lastNode = null\n}\n\nDoublyLinkedList.prototype.moveToFront = function(node) {\n  if (this.firstNode == node) return\n\n  this.remove(node)\n\n  if (this.firstNode == null) {\n    this.firstNode = node\n    this.lastNode = node\n    node.prev = null\n    node.next = null\n  } else {\n    node.prev = null\n    node.next = this.firstNode\n    node.next.prev = node\n    this.firstNode = node\n  }\n}\n\nDoublyLinkedList.prototype.pop = function() {\n  var lastNode = this.lastNode\n  if (lastNode != null) {\n    this.remove(lastNode)\n  }\n  return lastNode\n}\n\nDoublyLinkedList.prototype.remove = function(node) {\n  if (this.firstNode == node) {\n    this.firstNode = node.next\n  } else if (node.prev != null) {\n    node.prev.next = node.next\n  }\n  if (this.lastNode == node) {\n    this.lastNode = node.prev\n  } else if (node.next != null) {\n    node.next.prev = node.prev\n  }\n}\n\n\nfunction DoublyLinkedNode(key, val) {\n  this.key = key\n  this.val = val\n  this.prev = null\n  this.next = null\n}\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","var aws4 = exports,\n    url = require('url'),\n    querystring = require('querystring'),\n    crypto = require('crypto'),\n    lru = require('./lru'),\n    credentialsCache = lru(1000)\n\n// http://docs.amazonwebservices.com/general/latest/gr/signature-version-4.html\n\nfunction hmac(key, string, encoding) {\n  return crypto.createHmac('sha256', key).update(string, 'utf8').digest(encoding)\n}\n\nfunction hash(string, encoding) {\n  return crypto.createHash('sha256').update(string, 'utf8').digest(encoding)\n}\n\n// This function assumes the string has already been percent encoded\nfunction encodeRfc3986(urlEncodedString) {\n  return urlEncodedString.replace(/[!'()*]/g, function(c) {\n    return '%' + c.charCodeAt(0).toString(16).toUpperCase()\n  })\n}\n\nfunction encodeRfc3986Full(str) {\n  return encodeRfc3986(encodeURIComponent(str))\n}\n\n// A bit of a combination of:\n// https://github.com/aws/aws-sdk-java-v2/blob/dc695de6ab49ad03934e1b02e7263abbd2354be0/core/auth/src/main/java/software/amazon/awssdk/auth/signer/internal/AbstractAws4Signer.java#L59\n// https://github.com/aws/aws-sdk-js/blob/18cb7e5b463b46239f9fdd4a65e2ff8c81831e8f/lib/signers/v4.js#L191-L199\n// https://github.com/mhart/aws4fetch/blob/b3aed16b6f17384cf36ea33bcba3c1e9f3bdfefd/src/main.js#L25-L34\nvar HEADERS_TO_IGNORE = {\n  'authorization': true,\n  'connection': true,\n  'x-amzn-trace-id': true,\n  'user-agent': true,\n  'expect': true,\n  'presigned-expires': true,\n  'range': true,\n}\n\n// request: { path | body, [host], [method], [headers], [service], [region] }\n// credentials: { accessKeyId, secretAccessKey, [sessionToken] }\nfunction RequestSigner(request, credentials) {\n\n  if (typeof request === 'string') request = url.parse(request)\n\n  var headers = request.headers = (request.headers || {}),\n      hostParts = (!this.service || !this.region) && this.matchHost(request.hostname || request.host || headers.Host || headers.host)\n\n  this.request = request\n  this.credentials = credentials || this.defaultCredentials()\n\n  this.service = request.service || hostParts[0] || ''\n  this.region = request.region || hostParts[1] || 'us-east-1'\n\n  // SES uses a different domain from the service name\n  if (this.service === 'email') this.service = 'ses'\n\n  if (!request.method && request.body)\n    request.method = 'POST'\n\n  if (!headers.Host && !headers.host) {\n    headers.Host = request.hostname || request.host || this.createHost()\n\n    // If a port is specified explicitly, use it as is\n    if (request.port)\n      headers.Host += ':' + request.port\n  }\n  if (!request.hostname && !request.host)\n    request.hostname = headers.Host || headers.host\n\n  this.isCodeCommitGit = this.service === 'codecommit' && request.method === 'GIT'\n}\n\nRequestSigner.prototype.matchHost = function(host) {\n  var match = (host || '').match(/([^\\.]+)\\.(?:([^\\.]*)\\.)?amazonaws\\.com(\\.cn)?$/)\n  var hostParts = (match || []).slice(1, 3)\n\n  // ES's hostParts are sometimes the other way round, if the value that is expected\n  // to be region equals ‘es’ switch them back\n  // e.g. search-cluster-name-aaaa00aaaa0aaa0aaaaaaa0aaa.us-east-1.es.amazonaws.com\n  if (hostParts[1] === 'es')\n    hostParts = hostParts.reverse()\n\n  if (hostParts[1] == 's3') {\n    hostParts[0] = 's3'\n    hostParts[1] = 'us-east-1'\n  } else {\n    for (var i = 0; i < 2; i++) {\n      if (/^s3-/.test(hostParts[i])) {\n        hostParts[1] = hostParts[i].slice(3)\n        hostParts[0] = 's3'\n        break\n      }\n    }\n  }\n\n  return hostParts\n}\n\n// http://docs.aws.amazon.com/general/latest/gr/rande.html\nRequestSigner.prototype.isSingleRegion = function() {\n  // Special case for S3 and SimpleDB in us-east-1\n  if (['s3', 'sdb'].indexOf(this.service) >= 0 && this.region === 'us-east-1') return true\n\n  return ['cloudfront', 'ls', 'route53', 'iam', 'importexport', 'sts']\n    .indexOf(this.service) >= 0\n}\n\nRequestSigner.prototype.createHost = function() {\n  var region = this.isSingleRegion() ? '' : '.' + this.region,\n      subdomain = this.service === 'ses' ? 'email' : this.service\n  return subdomain + region + '.amazonaws.com'\n}\n\nRequestSigner.prototype.prepareRequest = function() {\n  this.parsePath()\n\n  var request = this.request, headers = request.headers, query\n\n  if (request.signQuery) {\n\n    this.parsedPath.query = query = this.parsedPath.query || {}\n\n    if (this.credentials.sessionToken)\n      query['X-Amz-Security-Token'] = this.credentials.sessionToken\n\n    if (this.service === 's3' && !query['X-Amz-Expires'])\n      query['X-Amz-Expires'] = 86400\n\n    if (query['X-Amz-Date'])\n      this.datetime = query['X-Amz-Date']\n    else\n      query['X-Amz-Date'] = this.getDateTime()\n\n    query['X-Amz-Algorithm'] = 'AWS4-HMAC-SHA256'\n    query['X-Amz-Credential'] = this.credentials.accessKeyId + '/' + this.credentialString()\n    query['X-Amz-SignedHeaders'] = this.signedHeaders()\n\n  } else {\n\n    if (!request.doNotModifyHeaders && !this.isCodeCommitGit) {\n      if (request.body && !headers['Content-Type'] && !headers['content-type'])\n        headers['Content-Type'] = 'application/x-www-form-urlencoded; charset=utf-8'\n\n      if (request.body && !headers['Content-Length'] && !headers['content-length'])\n        headers['Content-Length'] = Buffer.byteLength(request.body)\n\n      if (this.credentials.sessionToken && !headers['X-Amz-Security-Token'] && !headers['x-amz-security-token'])\n        headers['X-Amz-Security-Token'] = this.credentials.sessionToken\n\n      if (this.service === 's3' && !headers['X-Amz-Content-Sha256'] && !headers['x-amz-content-sha256'])\n        headers['X-Amz-Content-Sha256'] = hash(this.request.body || '', 'hex')\n\n      if (headers['X-Amz-Date'] || headers['x-amz-date'])\n        this.datetime = headers['X-Amz-Date'] || headers['x-amz-date']\n      else\n        headers['X-Amz-Date'] = this.getDateTime()\n    }\n\n    delete headers.Authorization\n    delete headers.authorization\n  }\n}\n\nRequestSigner.prototype.sign = function() {\n  if (!this.parsedPath) this.prepareRequest()\n\n  if (this.request.signQuery) {\n    this.parsedPath.query['X-Amz-Signature'] = this.signature()\n  } else {\n    this.request.headers.Authorization = this.authHeader()\n  }\n\n  this.request.path = this.formatPath()\n\n  return this.request\n}\n\nRequestSigner.prototype.getDateTime = function() {\n  if (!this.datetime) {\n    var headers = this.request.headers,\n      date = new Date(headers.Date || headers.date || new Date)\n\n    this.datetime = date.toISOString().replace(/[:\\-]|\\.\\d{3}/g, '')\n\n    // Remove the trailing 'Z' on the timestamp string for CodeCommit git access\n    if (this.isCodeCommitGit) this.datetime = this.datetime.slice(0, -1)\n  }\n  return this.datetime\n}\n\nRequestSigner.prototype.getDate = function() {\n  return this.getDateTime().substr(0, 8)\n}\n\nRequestSigner.prototype.authHeader = function() {\n  return [\n    'AWS4-HMAC-SHA256 Credential=' + this.credentials.accessKeyId + '/' + this.credentialString(),\n    'SignedHeaders=' + this.signedHeaders(),\n    'Signature=' + this.signature(),\n  ].join(', ')\n}\n\nRequestSigner.prototype.signature = function() {\n  var date = this.getDate(),\n      cacheKey = [this.credentials.secretAccessKey, date, this.region, this.service].join(),\n      kDate, kRegion, kService, kCredentials = credentialsCache.get(cacheKey)\n  if (!kCredentials) {\n    kDate = hmac('AWS4' + this.credentials.secretAccessKey, date)\n    kRegion = hmac(kDate, this.region)\n    kService = hmac(kRegion, this.service)\n    kCredentials = hmac(kService, 'aws4_request')\n    credentialsCache.set(cacheKey, kCredentials)\n  }\n  return hmac(kCredentials, this.stringToSign(), 'hex')\n}\n\nRequestSigner.prototype.stringToSign = function() {\n  return [\n    'AWS4-HMAC-SHA256',\n    this.getDateTime(),\n    this.credentialString(),\n    hash(this.canonicalString(), 'hex'),\n  ].join('\\n')\n}\n\nRequestSigner.prototype.canonicalString = function() {\n  if (!this.parsedPath) this.prepareRequest()\n\n  var pathStr = this.parsedPath.path,\n      query = this.parsedPath.query,\n      headers = this.request.headers,\n      queryStr = '',\n      normalizePath = this.service !== 's3',\n      decodePath = this.service === 's3' || this.request.doNotEncodePath,\n      decodeSlashesInPath = this.service === 's3',\n      firstValOnly = this.service === 's3',\n      bodyHash\n\n  if (this.service === 's3' && this.request.signQuery) {\n    bodyHash = 'UNSIGNED-PAYLOAD'\n  } else if (this.isCodeCommitGit) {\n    bodyHash = ''\n  } else {\n    bodyHash = headers['X-Amz-Content-Sha256'] || headers['x-amz-content-sha256'] ||\n      hash(this.request.body || '', 'hex')\n  }\n\n  if (query) {\n    var reducedQuery = Object.keys(query).reduce(function(obj, key) {\n      if (!key) return obj\n      obj[encodeRfc3986Full(key)] = !Array.isArray(query[key]) ? query[key] :\n        (firstValOnly ? query[key][0] : query[key])\n      return obj\n    }, {})\n    var encodedQueryPieces = []\n    Object.keys(reducedQuery).sort().forEach(function(key) {\n      if (!Array.isArray(reducedQuery[key])) {\n        encodedQueryPieces.push(key + '=' + encodeRfc3986Full(reducedQuery[key]))\n      } else {\n        reducedQuery[key].map(encodeRfc3986Full).sort()\n          .forEach(function(val) { encodedQueryPieces.push(key + '=' + val) })\n      }\n    })\n    queryStr = encodedQueryPieces.join('&')\n  }\n  if (pathStr !== '/') {\n    if (normalizePath) pathStr = pathStr.replace(/\\/{2,}/g, '/')\n    pathStr = pathStr.split('/').reduce(function(path, piece) {\n      if (normalizePath && piece === '..') {\n        path.pop()\n      } else if (!normalizePath || piece !== '.') {\n        if (decodePath) piece = decodeURIComponent(piece.replace(/\\+/g, ' '))\n        path.push(encodeRfc3986Full(piece))\n      }\n      return path\n    }, []).join('/')\n    if (pathStr[0] !== '/') pathStr = '/' + pathStr\n    if (decodeSlashesInPath) pathStr = pathStr.replace(/%2F/g, '/')\n  }\n\n  return [\n    this.request.method || 'GET',\n    pathStr,\n    queryStr,\n    this.canonicalHeaders() + '\\n',\n    this.signedHeaders(),\n    bodyHash,\n  ].join('\\n')\n}\n\nRequestSigner.prototype.canonicalHeaders = function() {\n  var headers = this.request.headers\n  function trimAll(header) {\n    return header.toString().trim().replace(/\\s+/g, ' ')\n  }\n  return Object.keys(headers)\n    .filter(function(key) { return HEADERS_TO_IGNORE[key.toLowerCase()] == null })\n    .sort(function(a, b) { return a.toLowerCase() < b.toLowerCase() ? -1 : 1 })\n    .map(function(key) { return key.toLowerCase() + ':' + trimAll(headers[key]) })\n    .join('\\n')\n}\n\nRequestSigner.prototype.signedHeaders = function() {\n  return Object.keys(this.request.headers)\n    .map(function(key) { return key.toLowerCase() })\n    .filter(function(key) { return HEADERS_TO_IGNORE[key] == null })\n    .sort()\n    .join(';')\n}\n\nRequestSigner.prototype.credentialString = function() {\n  return [\n    this.getDate(),\n    this.region,\n    this.service,\n    'aws4_request',\n  ].join('/')\n}\n\nRequestSigner.prototype.defaultCredentials = function() {\n  var env = process.env\n  return {\n    accessKeyId: env.AWS_ACCESS_KEY_ID || env.AWS_ACCESS_KEY,\n    secretAccessKey: env.AWS_SECRET_ACCESS_KEY || env.AWS_SECRET_KEY,\n    sessionToken: env.AWS_SESSION_TOKEN,\n  }\n}\n\nRequestSigner.prototype.parsePath = function() {\n  var path = this.request.path || '/'\n\n  // S3 doesn't always encode characters > 127 correctly and\n  // all services don't encode characters > 255 correctly\n  // So if there are non-reserved chars (and it's not already all % encoded), just encode them all\n  if (/[^0-9A-Za-z;,/?:@&=+$\\-_.!~*'()#%]/.test(path)) {\n    path = encodeURI(decodeURI(path))\n  }\n\n  var queryIx = path.indexOf('?'),\n      query = null\n\n  if (queryIx >= 0) {\n    query = querystring.parse(path.slice(queryIx + 1))\n    path = path.slice(0, queryIx)\n  }\n\n  this.parsedPath = {\n    path: path,\n    query: query,\n  }\n}\n\nRequestSigner.prototype.formatPath = function() {\n  var path = this.parsedPath.path,\n      query = this.parsedPath.query\n\n  if (!query) return path\n\n  // Services don't support empty query string keys\n  if (query[''] != null) delete query['']\n\n  return path + '?' + encodeRfc3986(querystring.stringify(query))\n}\n\naws4.RequestSigner = RequestSigner\n\naws4.sign = function(request, credentials) {\n  return new RequestSigner(request, credentials).sign()\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    if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n      Buffer = window.Buffer;\n    } else {\n      Buffer = require('buffer').Buffer;\n    }\n  } catch (e) {\n  }\n\n  BN.isBN = function isBN (num) {\n    if (num instanceof BN) {\n      return true;\n    }\n\n    return num !== null && typeof num === 'object' &&\n      num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n  };\n\n  BN.max = function max (left, right) {\n    if (left.cmp(right) > 0) return left;\n    return right;\n  };\n\n  BN.min = function min (left, right) {\n    if (left.cmp(right) < 0) return left;\n    return right;\n  };\n\n  BN.prototype._init = function init (number, base, endian) {\n    if (typeof number === 'number') {\n      return this._initNumber(number, base, endian);\n    }\n\n    if (typeof number === 'object') {\n      return this._initArray(number, base, endian);\n    }\n\n    if (base === 'hex') {\n      base = 16;\n    }\n    assert(base === (base | 0) && base >= 2 && base <= 36);\n\n    number = number.toString().replace(/\\s+/g, '');\n    var start = 0;\n    if (number[0] === '-') {\n      start++;\n      this.negative = 1;\n    }\n\n    if (start < number.length) {\n      if (base === 16) {\n        this._parseHex(number, start, endian);\n      } else {\n        this._parseBase(number, base, start);\n        if (endian === 'le') {\n          this._initArray(this.toArray(), base, endian);\n        }\n      }\n    }\n  };\n\n  BN.prototype._initNumber = function _initNumber (number, base, endian) {\n    if (number < 0) {\n      this.negative = 1;\n      number = -number;\n    }\n    if (number < 0x4000000) {\n      this.words = [ number & 0x3ffffff ];\n      this.length = 1;\n    } else if (number < 0x10000000000000) {\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff\n      ];\n      this.length = 2;\n    } else {\n      assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff,\n        1\n      ];\n      this.length = 3;\n    }\n\n    if (endian !== 'le') return;\n\n    // Reverse the bytes\n    this._initArray(this.toArray(), base, endian);\n  };\n\n  BN.prototype._initArray = function _initArray (number, base, endian) {\n    // Perhaps a Uint8Array\n    assert(typeof number.length === 'number');\n    if (number.length <= 0) {\n      this.words = [ 0 ];\n      this.length = 1;\n      return this;\n    }\n\n    this.length = Math.ceil(number.length / 3);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    var j, w;\n    var off = 0;\n    if (endian === 'be') {\n      for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n        w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    } else if (endian === 'le') {\n      for (i = 0, j = 0; i < number.length; i += 3) {\n        w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    }\n    return this.strip();\n  };\n\n  function parseHex4Bits (string, index) {\n    var c = string.charCodeAt(index);\n    // 'A' - 'F'\n    if (c >= 65 && c <= 70) {\n      return c - 55;\n    // 'a' - 'f'\n    } else if (c >= 97 && c <= 102) {\n      return c - 87;\n    // '0' - '9'\n    } else {\n      return (c - 48) & 0xf;\n    }\n  }\n\n  function parseHexByte (string, lowerBound, index) {\n    var r = parseHex4Bits(string, index);\n    if (index - 1 >= lowerBound) {\n      r |= parseHex4Bits(string, index - 1) << 4;\n    }\n    return r;\n  }\n\n  BN.prototype._parseHex = function _parseHex (number, start, endian) {\n    // Create possibly bigger array to ensure that it fits the number\n    this.length = Math.ceil((number.length - start) / 6);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    // 24-bits chunks\n    var off = 0;\n    var j = 0;\n\n    var w;\n    if (endian === 'be') {\n      for (i = number.length - 1; i >= start; i -= 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    } else {\n      var parseLength = number.length - start;\n      for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    }\n\n    this.strip();\n  };\n\n  function parseBase (str, start, end, mul) {\n    var r = 0;\n    var len = Math.min(str.length, end);\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r *= mul;\n\n      // 'a'\n      if (c >= 49) {\n        r += c - 49 + 0xa;\n\n      // 'A'\n      } else if (c >= 17) {\n        r += c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        r += c;\n      }\n    }\n    return r;\n  }\n\n  BN.prototype._parseBase = function _parseBase (number, base, start) {\n    // Initialize as zero\n    this.words = [ 0 ];\n    this.length = 1;\n\n    // Find length of limb in base\n    for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n      limbLen++;\n    }\n    limbLen--;\n    limbPow = (limbPow / base) | 0;\n\n    var total = number.length - start;\n    var mod = total % limbLen;\n    var end = Math.min(total, total - mod) + start;\n\n    var word = 0;\n    for (var i = start; i < end; i += limbLen) {\n      word = parseBase(number, i, i + limbLen, base);\n\n      this.imuln(limbPow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    if (mod !== 0) {\n      var pow = 1;\n      word = parseBase(number, i, number.length, base);\n\n      for (i = 0; i < mod; i++) {\n        pow *= base;\n      }\n\n      this.imuln(pow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    this.strip();\n  };\n\n  BN.prototype.copy = function copy (dest) {\n    dest.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      dest.words[i] = this.words[i];\n    }\n    dest.length = this.length;\n    dest.negative = this.negative;\n    dest.red = this.red;\n  };\n\n  BN.prototype.clone = function clone () {\n    var r = new BN(null);\n    this.copy(r);\n    return r;\n  };\n\n  BN.prototype._expand = function _expand (size) {\n    while (this.length < size) {\n      this.words[this.length++] = 0;\n    }\n    return this;\n  };\n\n  // Remove leading `0` from `this`\n  BN.prototype.strip = function strip () {\n    while (this.length > 1 && this.words[this.length - 1] === 0) {\n      this.length--;\n    }\n    return this._normSign();\n  };\n\n  BN.prototype._normSign = function _normSign () {\n    // -0 = 0\n    if (this.length === 1 && this.words[0] === 0) {\n      this.negative = 0;\n    }\n    return this;\n  };\n\n  BN.prototype.inspect = function inspect () {\n    return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n  };\n\n  /*\n\n  var zeros = [];\n  var groupSizes = [];\n  var groupBases = [];\n\n  var s = '';\n  var i = -1;\n  while (++i < BN.wordSize) {\n    zeros[i] = s;\n    s += '0';\n  }\n  groupSizes[0] = 0;\n  groupSizes[1] = 0;\n  groupBases[0] = 0;\n  groupBases[1] = 0;\n  var base = 2 - 1;\n  while (++base < 36 + 1) {\n    var groupSize = 0;\n    var groupBase = 1;\n    while (groupBase < (1 << BN.wordSize) / base) {\n      groupBase *= base;\n      groupSize += 1;\n    }\n    groupSizes[base] = groupSize;\n    groupBases[base] = groupBase;\n  }\n\n  */\n\n  var zeros = [\n    '',\n    '0',\n    '00',\n    '000',\n    '0000',\n    '00000',\n    '000000',\n    '0000000',\n    '00000000',\n    '000000000',\n    '0000000000',\n    '00000000000',\n    '000000000000',\n    '0000000000000',\n    '00000000000000',\n    '000000000000000',\n    '0000000000000000',\n    '00000000000000000',\n    '000000000000000000',\n    '0000000000000000000',\n    '00000000000000000000',\n    '000000000000000000000',\n    '0000000000000000000000',\n    '00000000000000000000000',\n    '000000000000000000000000',\n    '0000000000000000000000000'\n  ];\n\n  var groupSizes = [\n    0, 0,\n    25, 16, 12, 11, 10, 9, 8,\n    8, 7, 7, 7, 7, 6, 6,\n    6, 6, 6, 6, 6, 5, 5,\n    5, 5, 5, 5, 5, 5, 5,\n    5, 5, 5, 5, 5, 5, 5\n  ];\n\n  var groupBases = [\n    0, 0,\n    33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n    43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n    16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n    6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n    24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n  ];\n\n  BN.prototype.toString = function toString (base, padding) {\n    base = base || 10;\n    padding = padding | 0 || 1;\n\n    var out;\n    if (base === 16 || base === 'hex') {\n      out = '';\n      var off = 0;\n      var carry = 0;\n      for (var i = 0; i < this.length; i++) {\n        var w = this.words[i];\n        var word = (((w << off) | carry) & 0xffffff).toString(16);\n        carry = (w >>> (24 - off)) & 0xffffff;\n        if (carry !== 0 || i !== this.length - 1) {\n          out = zeros[6 - word.length] + word + out;\n        } else {\n          out = word + out;\n        }\n        off += 2;\n        if (off >= 26) {\n          off -= 26;\n          i--;\n        }\n      }\n      if (carry !== 0) {\n        out = carry.toString(16) + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    if (base === (base | 0) && base >= 2 && base <= 36) {\n      // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n      var groupSize = groupSizes[base];\n      // var groupBase = Math.pow(base, groupSize);\n      var groupBase = groupBases[base];\n      out = '';\n      var c = this.clone();\n      c.negative = 0;\n      while (!c.isZero()) {\n        var r = c.modn(groupBase).toString(base);\n        c = c.idivn(groupBase);\n\n        if (!c.isZero()) {\n          out = zeros[groupSize - r.length] + r + out;\n        } else {\n          out = r + out;\n        }\n      }\n      if (this.isZero()) {\n        out = '0' + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    assert(false, 'Base should be between 2 and 36');\n  };\n\n  BN.prototype.toNumber = function toNumber () {\n    var ret = this.words[0];\n    if (this.length === 2) {\n      ret += this.words[1] * 0x4000000;\n    } else if (this.length === 3 && this.words[2] === 0x01) {\n      // NOTE: at this stage it is known that the top bit is set\n      ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n    } else if (this.length > 2) {\n      assert(false, 'Number can only safely store up to 53 bits');\n    }\n    return (this.negative !== 0) ? -ret : ret;\n  };\n\n  BN.prototype.toJSON = function toJSON () {\n    return this.toString(16);\n  };\n\n  BN.prototype.toBuffer = function toBuffer (endian, length) {\n    assert(typeof Buffer !== 'undefined');\n    return this.toArrayLike(Buffer, endian, length);\n  };\n\n  BN.prototype.toArray = function toArray (endian, length) {\n    return this.toArrayLike(Array, endian, length);\n  };\n\n  BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n    var byteLength = this.byteLength();\n    var reqLength = length || Math.max(1, byteLength);\n    assert(byteLength <= reqLength, 'byte array longer than desired length');\n    assert(reqLength > 0, 'Requested array length <= 0');\n\n    this.strip();\n    var littleEndian = endian === 'le';\n    var res = new ArrayType(reqLength);\n\n    var b, i;\n    var q = this.clone();\n    if (!littleEndian) {\n      // Assume big-endian\n      for (i = 0; i < reqLength - byteLength; i++) {\n        res[i] = 0;\n      }\n\n      for (i = 0; !q.isZero(); i++) {\n        b = q.andln(0xff);\n        q.iushrn(8);\n\n        res[reqLength - i - 1] = b;\n      }\n    } else {\n      for (i = 0; !q.isZero(); i++) {\n        b = q.andln(0xff);\n        q.iushrn(8);\n\n        res[i] = b;\n      }\n\n      for (; i < reqLength; i++) {\n        res[i] = 0;\n      }\n    }\n\n    return res;\n  };\n\n  if (Math.clz32) {\n    BN.prototype._countBits = function _countBits (w) {\n      return 32 - Math.clz32(w);\n    };\n  } else {\n    BN.prototype._countBits = function _countBits (w) {\n      var t = w;\n      var r = 0;\n      if (t >= 0x1000) {\n        r += 13;\n        t >>>= 13;\n      }\n      if (t >= 0x40) {\n        r += 7;\n        t >>>= 7;\n      }\n      if (t >= 0x8) {\n        r += 4;\n        t >>>= 4;\n      }\n      if (t >= 0x02) {\n        r += 2;\n        t >>>= 2;\n      }\n      return r + t;\n    };\n  }\n\n  BN.prototype._zeroBits = function _zeroBits (w) {\n    // Short-cut\n    if (w === 0) return 26;\n\n    var t = w;\n    var r = 0;\n    if ((t & 0x1fff) === 0) {\n      r += 13;\n      t >>>= 13;\n    }\n    if ((t & 0x7f) === 0) {\n      r += 7;\n      t >>>= 7;\n    }\n    if ((t & 0xf) === 0) {\n      r += 4;\n      t >>>= 4;\n    }\n    if ((t & 0x3) === 0) {\n      r += 2;\n      t >>>= 2;\n    }\n    if ((t & 0x1) === 0) {\n      r++;\n    }\n    return r;\n  };\n\n  // Return number of used bits in a BN\n  BN.prototype.bitLength = function bitLength () {\n    var w = this.words[this.length - 1];\n    var hi = this._countBits(w);\n    return (this.length - 1) * 26 + hi;\n  };\n\n  function toBitArray (num) {\n    var w = new Array(num.bitLength());\n\n    for (var bit = 0; bit < w.length; bit++) {\n      var off = (bit / 26) | 0;\n      var wbit = bit % 26;\n\n      w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n    }\n\n    return w;\n  }\n\n  // Number of trailing zero bits\n  BN.prototype.zeroBits = function zeroBits () {\n    if (this.isZero()) return 0;\n\n    var r = 0;\n    for (var i = 0; i < this.length; i++) {\n      var b = this._zeroBits(this.words[i]);\n      r += b;\n      if (b !== 26) break;\n    }\n    return r;\n  };\n\n  BN.prototype.byteLength = function byteLength () {\n    return Math.ceil(this.bitLength() / 8);\n  };\n\n  BN.prototype.toTwos = function toTwos (width) {\n    if (this.negative !== 0) {\n      return this.abs().inotn(width).iaddn(1);\n    }\n    return this.clone();\n  };\n\n  BN.prototype.fromTwos = function fromTwos (width) {\n    if (this.testn(width - 1)) {\n      return this.notn(width).iaddn(1).ineg();\n    }\n    return this.clone();\n  };\n\n  BN.prototype.isNeg = function isNeg () {\n    return this.negative !== 0;\n  };\n\n  // Return negative clone of `this`\n  BN.prototype.neg = function neg () {\n    return this.clone().ineg();\n  };\n\n  BN.prototype.ineg = function ineg () {\n    if (!this.isZero()) {\n      this.negative ^= 1;\n    }\n\n    return this;\n  };\n\n  // Or `num` with `this` in-place\n  BN.prototype.iuor = function iuor (num) {\n    while (this.length < num.length) {\n      this.words[this.length++] = 0;\n    }\n\n    for (var i = 0; i < num.length; i++) {\n      this.words[i] = this.words[i] | num.words[i];\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ior = function ior (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuor(num);\n  };\n\n  // Or `num` with `this`\n  BN.prototype.or = function or (num) {\n    if (this.length > num.length) return this.clone().ior(num);\n    return num.clone().ior(this);\n  };\n\n  BN.prototype.uor = function uor (num) {\n    if (this.length > num.length) return this.clone().iuor(num);\n    return num.clone().iuor(this);\n  };\n\n  // And `num` with `this` in-place\n  BN.prototype.iuand = function iuand (num) {\n    // b = min-length(num, this)\n    var b;\n    if (this.length > num.length) {\n      b = num;\n    } else {\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = this.words[i] & num.words[i];\n    }\n\n    this.length = b.length;\n\n    return this.strip();\n  };\n\n  BN.prototype.iand = function iand (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuand(num);\n  };\n\n  // And `num` with `this`\n  BN.prototype.and = function and (num) {\n    if (this.length > num.length) return this.clone().iand(num);\n    return num.clone().iand(this);\n  };\n\n  BN.prototype.uand = function uand (num) {\n    if (this.length > num.length) return this.clone().iuand(num);\n    return num.clone().iuand(this);\n  };\n\n  // Xor `num` with `this` in-place\n  BN.prototype.iuxor = function iuxor (num) {\n    // a.length > b.length\n    var a;\n    var b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = a.words[i] ^ b.words[i];\n    }\n\n    if (this !== a) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = a.length;\n\n    return this.strip();\n  };\n\n  BN.prototype.ixor = function ixor (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuxor(num);\n  };\n\n  // Xor `num` with `this`\n  BN.prototype.xor = function xor (num) {\n    if (this.length > num.length) return this.clone().ixor(num);\n    return num.clone().ixor(this);\n  };\n\n  BN.prototype.uxor = function uxor (num) {\n    if (this.length > num.length) return this.clone().iuxor(num);\n    return num.clone().iuxor(this);\n  };\n\n  // Not ``this`` with ``width`` bitwidth\n  BN.prototype.inotn = function inotn (width) {\n    assert(typeof width === 'number' && width >= 0);\n\n    var bytesNeeded = Math.ceil(width / 26) | 0;\n    var bitsLeft = width % 26;\n\n    // Extend the buffer with leading zeroes\n    this._expand(bytesNeeded);\n\n    if (bitsLeft > 0) {\n      bytesNeeded--;\n    }\n\n    // Handle complete words\n    for (var i = 0; i < bytesNeeded; i++) {\n      this.words[i] = ~this.words[i] & 0x3ffffff;\n    }\n\n    // Handle the residue\n    if (bitsLeft > 0) {\n      this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n    }\n\n    // And remove leading zeroes\n    return this.strip();\n  };\n\n  BN.prototype.notn = function notn (width) {\n    return this.clone().inotn(width);\n  };\n\n  // Set `bit` of `this`\n  BN.prototype.setn = function setn (bit, val) {\n    assert(typeof bit === 'number' && bit >= 0);\n\n    var off = (bit / 26) | 0;\n    var wbit = bit % 26;\n\n    this._expand(off + 1);\n\n    if (val) {\n      this.words[off] = this.words[off] | (1 << wbit);\n    } else {\n      this.words[off] = this.words[off] & ~(1 << wbit);\n    }\n\n    return this.strip();\n  };\n\n  // Add `num` to `this` in-place\n  BN.prototype.iadd = function iadd (num) {\n    var r;\n\n    // negative + positive\n    if (this.negative !== 0 && num.negative === 0) {\n      this.negative = 0;\n      r = this.isub(num);\n      this.negative ^= 1;\n      return this._normSign();\n\n    // positive + negative\n    } else if (this.negative === 0 && num.negative !== 0) {\n      num.negative = 0;\n      r = this.isub(num);\n      num.negative = 1;\n      return r._normSign();\n    }\n\n    // a.length > b.length\n    var a, b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n\n    this.length = a.length;\n    if (carry !== 0) {\n      this.words[this.length] = carry;\n      this.length++;\n    // Copy the rest of the words\n    } else if (a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    return this;\n  };\n\n  // Add `num` to `this`\n  BN.prototype.add = function add (num) {\n    var res;\n    if (num.negative !== 0 && this.negative === 0) {\n      num.negative = 0;\n      res = this.sub(num);\n      num.negative ^= 1;\n      return res;\n    } else if (num.negative === 0 && this.negative !== 0) {\n      this.negative = 0;\n      res = num.sub(this);\n      this.negative = 1;\n      return res;\n    }\n\n    if (this.length > num.length) return this.clone().iadd(num);\n\n    return num.clone().iadd(this);\n  };\n\n  // Subtract `num` from `this` in-place\n  BN.prototype.isub = function isub (num) {\n    // this - (-num) = this + num\n    if (num.negative !== 0) {\n      num.negative = 0;\n      var r = this.iadd(num);\n      num.negative = 1;\n      return r._normSign();\n\n    // -this - num = -(this + num)\n    } else if (this.negative !== 0) {\n      this.negative = 0;\n      this.iadd(num);\n      this.negative = 1;\n      return this._normSign();\n    }\n\n    // At this point both numbers are positive\n    var cmp = this.cmp(num);\n\n    // Optimization - zeroify\n    if (cmp === 0) {\n      this.negative = 0;\n      this.length = 1;\n      this.words[0] = 0;\n      return this;\n    }\n\n    // a > b\n    var a, b;\n    if (cmp > 0) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n\n    // Copy rest of the words\n    if (carry === 0 && i < a.length && a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = Math.max(this.length, i);\n\n    if (a !== this) {\n      this.negative = 1;\n    }\n\n    return this.strip();\n  };\n\n  // Subtract `num` from `this`\n  BN.prototype.sub = function sub (num) {\n    return this.clone().isub(num);\n  };\n\n  function smallMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    var len = (self.length + num.length) | 0;\n    out.length = len;\n    len = (len - 1) | 0;\n\n    // Peel one iteration (compiler can't do it, because of code complexity)\n    var a = self.words[0] | 0;\n    var b = num.words[0] | 0;\n    var r = a * b;\n\n    var lo = r & 0x3ffffff;\n    var carry = (r / 0x4000000) | 0;\n    out.words[0] = lo;\n\n    for (var k = 1; k < len; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = carry >>> 26;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = (k - j) | 0;\n        a = self.words[i] | 0;\n        b = num.words[j] | 0;\n        r = a * b + rword;\n        ncarry += (r / 0x4000000) | 0;\n        rword = r & 0x3ffffff;\n      }\n      out.words[k] = rword | 0;\n      carry = ncarry | 0;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry | 0;\n    } else {\n      out.length--;\n    }\n\n    return out.strip();\n  }\n\n  // TODO(indutny): it may be reasonable to omit it for users who don't need\n  // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n  // multiplication (like elliptic secp256k1).\n  var comb10MulTo = function comb10MulTo (self, num, out) {\n    var a = self.words;\n    var b = num.words;\n    var o = out.words;\n    var c = 0;\n    var lo;\n    var mid;\n    var hi;\n    var a0 = a[0] | 0;\n    var al0 = a0 & 0x1fff;\n    var ah0 = a0 >>> 13;\n    var a1 = a[1] | 0;\n    var al1 = a1 & 0x1fff;\n    var ah1 = a1 >>> 13;\n    var a2 = a[2] | 0;\n    var al2 = a2 & 0x1fff;\n    var ah2 = a2 >>> 13;\n    var a3 = a[3] | 0;\n    var al3 = a3 & 0x1fff;\n    var ah3 = a3 >>> 13;\n    var a4 = a[4] | 0;\n    var al4 = a4 & 0x1fff;\n    var ah4 = a4 >>> 13;\n    var a5 = a[5] | 0;\n    var al5 = a5 & 0x1fff;\n    var ah5 = a5 >>> 13;\n    var a6 = a[6] | 0;\n    var al6 = a6 & 0x1fff;\n    var ah6 = a6 >>> 13;\n    var a7 = a[7] | 0;\n    var al7 = a7 & 0x1fff;\n    var ah7 = a7 >>> 13;\n    var a8 = a[8] | 0;\n    var al8 = a8 & 0x1fff;\n    var ah8 = a8 >>> 13;\n    var a9 = a[9] | 0;\n    var al9 = a9 & 0x1fff;\n    var ah9 = a9 >>> 13;\n    var b0 = b[0] | 0;\n    var bl0 = b0 & 0x1fff;\n    var bh0 = b0 >>> 13;\n    var b1 = b[1] | 0;\n    var bl1 = b1 & 0x1fff;\n    var bh1 = b1 >>> 13;\n    var b2 = b[2] | 0;\n    var bl2 = b2 & 0x1fff;\n    var bh2 = b2 >>> 13;\n    var b3 = b[3] | 0;\n    var bl3 = b3 & 0x1fff;\n    var bh3 = b3 >>> 13;\n    var b4 = b[4] | 0;\n    var bl4 = b4 & 0x1fff;\n    var bh4 = b4 >>> 13;\n    var b5 = b[5] | 0;\n    var bl5 = b5 & 0x1fff;\n    var bh5 = b5 >>> 13;\n    var b6 = b[6] | 0;\n    var bl6 = b6 & 0x1fff;\n    var bh6 = b6 >>> 13;\n    var b7 = b[7] | 0;\n    var bl7 = b7 & 0x1fff;\n    var bh7 = b7 >>> 13;\n    var b8 = b[8] | 0;\n    var bl8 = b8 & 0x1fff;\n    var bh8 = b8 >>> 13;\n    var b9 = b[9] | 0;\n    var bl9 = b9 & 0x1fff;\n    var bh9 = b9 >>> 13;\n\n    out.negative = self.negative ^ num.negative;\n    out.length = 19;\n    /* k = 0 */\n    lo = Math.imul(al0, bl0);\n    mid = Math.imul(al0, bh0);\n    mid = (mid + Math.imul(ah0, bl0)) | 0;\n    hi = Math.imul(ah0, bh0);\n    var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n    w0 &= 0x3ffffff;\n    /* k = 1 */\n    lo = Math.imul(al1, bl0);\n    mid = Math.imul(al1, bh0);\n    mid = (mid + Math.imul(ah1, bl0)) | 0;\n    hi = Math.imul(ah1, bh0);\n    lo = (lo + Math.imul(al0, bl1)) | 0;\n    mid = (mid + Math.imul(al0, bh1)) | 0;\n    mid = (mid + Math.imul(ah0, bl1)) | 0;\n    hi = (hi + Math.imul(ah0, bh1)) | 0;\n    var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n    w1 &= 0x3ffffff;\n    /* k = 2 */\n    lo = Math.imul(al2, bl0);\n    mid = Math.imul(al2, bh0);\n    mid = (mid + Math.imul(ah2, bl0)) | 0;\n    hi = Math.imul(ah2, bh0);\n    lo = (lo + Math.imul(al1, bl1)) | 0;\n    mid = (mid + Math.imul(al1, bh1)) | 0;\n    mid = (mid + Math.imul(ah1, bl1)) | 0;\n    hi = (hi + Math.imul(ah1, bh1)) | 0;\n    lo = (lo + Math.imul(al0, bl2)) | 0;\n    mid = (mid + Math.imul(al0, bh2)) | 0;\n    mid = (mid + Math.imul(ah0, bl2)) | 0;\n    hi = (hi + Math.imul(ah0, bh2)) | 0;\n    var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n    w2 &= 0x3ffffff;\n    /* k = 3 */\n    lo = Math.imul(al3, bl0);\n    mid = Math.imul(al3, bh0);\n    mid = (mid + Math.imul(ah3, bl0)) | 0;\n    hi = Math.imul(ah3, bh0);\n    lo = (lo + Math.imul(al2, bl1)) | 0;\n    mid = (mid + Math.imul(al2, bh1)) | 0;\n    mid = (mid + Math.imul(ah2, bl1)) | 0;\n    hi = (hi + Math.imul(ah2, bh1)) | 0;\n    lo = (lo + Math.imul(al1, bl2)) | 0;\n    mid = (mid + Math.imul(al1, bh2)) | 0;\n    mid = (mid + Math.imul(ah1, bl2)) | 0;\n    hi = (hi + Math.imul(ah1, bh2)) | 0;\n    lo = (lo + Math.imul(al0, bl3)) | 0;\n    mid = (mid + Math.imul(al0, bh3)) | 0;\n    mid = (mid + Math.imul(ah0, bl3)) | 0;\n    hi = (hi + Math.imul(ah0, bh3)) | 0;\n    var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n    w3 &= 0x3ffffff;\n    /* k = 4 */\n    lo = Math.imul(al4, bl0);\n    mid = Math.imul(al4, bh0);\n    mid = (mid + Math.imul(ah4, bl0)) | 0;\n    hi = Math.imul(ah4, bh0);\n    lo = (lo + Math.imul(al3, bl1)) | 0;\n    mid = (mid + Math.imul(al3, bh1)) | 0;\n    mid = (mid + Math.imul(ah3, bl1)) | 0;\n    hi = (hi + Math.imul(ah3, bh1)) | 0;\n    lo = (lo + Math.imul(al2, bl2)) | 0;\n    mid = (mid + Math.imul(al2, bh2)) | 0;\n    mid = (mid + Math.imul(ah2, bl2)) | 0;\n    hi = (hi + Math.imul(ah2, bh2)) | 0;\n    lo = (lo + Math.imul(al1, bl3)) | 0;\n    mid = (mid + Math.imul(al1, bh3)) | 0;\n    mid = (mid + Math.imul(ah1, bl3)) | 0;\n    hi = (hi + Math.imul(ah1, bh3)) | 0;\n    lo = (lo + Math.imul(al0, bl4)) | 0;\n    mid = (mid + Math.imul(al0, bh4)) | 0;\n    mid = (mid + Math.imul(ah0, bl4)) | 0;\n    hi = (hi + Math.imul(ah0, bh4)) | 0;\n    var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n    w4 &= 0x3ffffff;\n    /* k = 5 */\n    lo = Math.imul(al5, bl0);\n    mid = Math.imul(al5, bh0);\n    mid = (mid + Math.imul(ah5, bl0)) | 0;\n    hi = Math.imul(ah5, bh0);\n    lo = (lo + Math.imul(al4, bl1)) | 0;\n    mid = (mid + Math.imul(al4, bh1)) | 0;\n    mid = (mid + Math.imul(ah4, bl1)) | 0;\n    hi = (hi + Math.imul(ah4, bh1)) | 0;\n    lo = (lo + Math.imul(al3, bl2)) | 0;\n    mid = (mid + Math.imul(al3, bh2)) | 0;\n    mid = (mid + Math.imul(ah3, bl2)) | 0;\n    hi = (hi + Math.imul(ah3, bh2)) | 0;\n    lo = (lo + Math.imul(al2, bl3)) | 0;\n    mid = (mid + Math.imul(al2, bh3)) | 0;\n    mid = (mid + Math.imul(ah2, bl3)) | 0;\n    hi = (hi + Math.imul(ah2, bh3)) | 0;\n    lo = (lo + Math.imul(al1, bl4)) | 0;\n    mid = (mid + Math.imul(al1, bh4)) | 0;\n    mid = (mid + Math.imul(ah1, bl4)) | 0;\n    hi = (hi + Math.imul(ah1, bh4)) | 0;\n    lo = (lo + Math.imul(al0, bl5)) | 0;\n    mid = (mid + Math.imul(al0, bh5)) | 0;\n    mid = (mid + Math.imul(ah0, bl5)) | 0;\n    hi = (hi + Math.imul(ah0, bh5)) | 0;\n    var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n    w5 &= 0x3ffffff;\n    /* k = 6 */\n    lo = Math.imul(al6, bl0);\n    mid = Math.imul(al6, bh0);\n    mid = (mid + Math.imul(ah6, bl0)) | 0;\n    hi = Math.imul(ah6, bh0);\n    lo = (lo + Math.imul(al5, bl1)) | 0;\n    mid = (mid + Math.imul(al5, bh1)) | 0;\n    mid = (mid + Math.imul(ah5, bl1)) | 0;\n    hi = (hi + Math.imul(ah5, bh1)) | 0;\n    lo = (lo + Math.imul(al4, bl2)) | 0;\n    mid = (mid + Math.imul(al4, bh2)) | 0;\n    mid = (mid + Math.imul(ah4, bl2)) | 0;\n    hi = (hi + Math.imul(ah4, bh2)) | 0;\n    lo = (lo + Math.imul(al3, bl3)) | 0;\n    mid = (mid + Math.imul(al3, bh3)) | 0;\n    mid = (mid + Math.imul(ah3, bl3)) | 0;\n    hi = (hi + Math.imul(ah3, bh3)) | 0;\n    lo = (lo + Math.imul(al2, bl4)) | 0;\n    mid = (mid + Math.imul(al2, bh4)) | 0;\n    mid = (mid + Math.imul(ah2, bl4)) | 0;\n    hi = (hi + Math.imul(ah2, bh4)) | 0;\n    lo = (lo + Math.imul(al1, bl5)) | 0;\n    mid = (mid + Math.imul(al1, bh5)) | 0;\n    mid = (mid + Math.imul(ah1, bl5)) | 0;\n    hi = (hi + Math.imul(ah1, bh5)) | 0;\n    lo = (lo + Math.imul(al0, bl6)) | 0;\n    mid = (mid + Math.imul(al0, bh6)) | 0;\n    mid = (mid + Math.imul(ah0, bl6)) | 0;\n    hi = (hi + Math.imul(ah0, bh6)) | 0;\n    var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n    w6 &= 0x3ffffff;\n    /* k = 7 */\n    lo = Math.imul(al7, bl0);\n    mid = Math.imul(al7, bh0);\n    mid = (mid + Math.imul(ah7, bl0)) | 0;\n    hi = Math.imul(ah7, bh0);\n    lo = (lo + Math.imul(al6, bl1)) | 0;\n    mid = (mid + Math.imul(al6, bh1)) | 0;\n    mid = (mid + Math.imul(ah6, bl1)) | 0;\n    hi = (hi + Math.imul(ah6, bh1)) | 0;\n    lo = (lo + Math.imul(al5, bl2)) | 0;\n    mid = (mid + Math.imul(al5, bh2)) | 0;\n    mid = (mid + Math.imul(ah5, bl2)) | 0;\n    hi = (hi + Math.imul(ah5, bh2)) | 0;\n    lo = (lo + Math.imul(al4, bl3)) | 0;\n    mid = (mid + Math.imul(al4, bh3)) | 0;\n    mid = (mid + Math.imul(ah4, bl3)) | 0;\n    hi = (hi + Math.imul(ah4, bh3)) | 0;\n    lo = (lo + Math.imul(al3, bl4)) | 0;\n    mid = (mid + Math.imul(al3, bh4)) | 0;\n    mid = (mid + Math.imul(ah3, bl4)) | 0;\n    hi = (hi + Math.imul(ah3, bh4)) | 0;\n    lo = (lo + Math.imul(al2, bl5)) | 0;\n    mid = (mid + Math.imul(al2, bh5)) | 0;\n    mid = (mid + Math.imul(ah2, bl5)) | 0;\n    hi = (hi + Math.imul(ah2, bh5)) | 0;\n    lo = (lo + Math.imul(al1, bl6)) | 0;\n    mid = (mid + Math.imul(al1, bh6)) | 0;\n    mid = (mid + Math.imul(ah1, bl6)) | 0;\n    hi = (hi + Math.imul(ah1, bh6)) | 0;\n    lo = (lo + Math.imul(al0, bl7)) | 0;\n    mid = (mid + Math.imul(al0, bh7)) | 0;\n    mid = (mid + Math.imul(ah0, bl7)) | 0;\n    hi = (hi + Math.imul(ah0, bh7)) | 0;\n    var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n    w7 &= 0x3ffffff;\n    /* k = 8 */\n    lo = Math.imul(al8, bl0);\n    mid = Math.imul(al8, bh0);\n    mid = (mid + Math.imul(ah8, bl0)) | 0;\n    hi = Math.imul(ah8, bh0);\n    lo = (lo + Math.imul(al7, bl1)) | 0;\n    mid = (mid + Math.imul(al7, bh1)) | 0;\n    mid = (mid + Math.imul(ah7, bl1)) | 0;\n    hi = (hi + Math.imul(ah7, bh1)) | 0;\n    lo = (lo + Math.imul(al6, bl2)) | 0;\n    mid = (mid + Math.imul(al6, bh2)) | 0;\n    mid = (mid + Math.imul(ah6, bl2)) | 0;\n    hi = (hi + Math.imul(ah6, bh2)) | 0;\n    lo = (lo + Math.imul(al5, bl3)) | 0;\n    mid = (mid + Math.imul(al5, bh3)) | 0;\n    mid = (mid + Math.imul(ah5, bl3)) | 0;\n    hi = (hi + Math.imul(ah5, bh3)) | 0;\n    lo = (lo + Math.imul(al4, bl4)) | 0;\n    mid = (mid + Math.imul(al4, bh4)) | 0;\n    mid = (mid + Math.imul(ah4, bl4)) | 0;\n    hi = (hi + Math.imul(ah4, bh4)) | 0;\n    lo = (lo + Math.imul(al3, bl5)) | 0;\n    mid = (mid + Math.imul(al3, bh5)) | 0;\n    mid = (mid + Math.imul(ah3, bl5)) | 0;\n    hi = (hi + Math.imul(ah3, bh5)) | 0;\n    lo = (lo + Math.imul(al2, bl6)) | 0;\n    mid = (mid + Math.imul(al2, bh6)) | 0;\n    mid = (mid + Math.imul(ah2, bl6)) | 0;\n    hi = (hi + Math.imul(ah2, bh6)) | 0;\n    lo = (lo + Math.imul(al1, bl7)) | 0;\n    mid = (mid + Math.imul(al1, bh7)) | 0;\n    mid = (mid + Math.imul(ah1, bl7)) | 0;\n    hi = (hi + Math.imul(ah1, bh7)) | 0;\n    lo = (lo + Math.imul(al0, bl8)) | 0;\n    mid = (mid + Math.imul(al0, bh8)) | 0;\n    mid = (mid + Math.imul(ah0, bl8)) | 0;\n    hi = (hi + Math.imul(ah0, bh8)) | 0;\n    var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n    w8 &= 0x3ffffff;\n    /* k = 9 */\n    lo = Math.imul(al9, bl0);\n    mid = Math.imul(al9, bh0);\n    mid = (mid + Math.imul(ah9, bl0)) | 0;\n    hi = Math.imul(ah9, bh0);\n    lo = (lo + Math.imul(al8, bl1)) | 0;\n    mid = (mid + Math.imul(al8, bh1)) | 0;\n    mid = (mid + Math.imul(ah8, bl1)) | 0;\n    hi = (hi + Math.imul(ah8, bh1)) | 0;\n    lo = (lo + Math.imul(al7, bl2)) | 0;\n    mid = (mid + Math.imul(al7, bh2)) | 0;\n    mid = (mid + Math.imul(ah7, bl2)) | 0;\n    hi = (hi + Math.imul(ah7, bh2)) | 0;\n    lo = (lo + Math.imul(al6, bl3)) | 0;\n    mid = (mid + Math.imul(al6, bh3)) | 0;\n    mid = (mid + Math.imul(ah6, bl3)) | 0;\n    hi = (hi + Math.imul(ah6, bh3)) | 0;\n    lo = (lo + Math.imul(al5, bl4)) | 0;\n    mid = (mid + Math.imul(al5, bh4)) | 0;\n    mid = (mid + Math.imul(ah5, bl4)) | 0;\n    hi = (hi + Math.imul(ah5, bh4)) | 0;\n    lo = (lo + Math.imul(al4, bl5)) | 0;\n    mid = (mid + Math.imul(al4, bh5)) | 0;\n    mid = (mid + Math.imul(ah4, bl5)) | 0;\n    hi = (hi + Math.imul(ah4, bh5)) | 0;\n    lo = (lo + Math.imul(al3, bl6)) | 0;\n    mid = (mid + Math.imul(al3, bh6)) | 0;\n    mid = (mid + Math.imul(ah3, bl6)) | 0;\n    hi = (hi + Math.imul(ah3, bh6)) | 0;\n    lo = (lo + Math.imul(al2, bl7)) | 0;\n    mid = (mid + Math.imul(al2, bh7)) | 0;\n    mid = (mid + Math.imul(ah2, bl7)) | 0;\n    hi = (hi + Math.imul(ah2, bh7)) | 0;\n    lo = (lo + Math.imul(al1, bl8)) | 0;\n    mid = (mid + Math.imul(al1, bh8)) | 0;\n    mid = (mid + Math.imul(ah1, bl8)) | 0;\n    hi = (hi + Math.imul(ah1, bh8)) | 0;\n    lo = (lo + Math.imul(al0, bl9)) | 0;\n    mid = (mid + Math.imul(al0, bh9)) | 0;\n    mid = (mid + Math.imul(ah0, bl9)) | 0;\n    hi = (hi + Math.imul(ah0, bh9)) | 0;\n    var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n    w9 &= 0x3ffffff;\n    /* k = 10 */\n    lo = Math.imul(al9, bl1);\n    mid = Math.imul(al9, bh1);\n    mid = (mid + Math.imul(ah9, bl1)) | 0;\n    hi = Math.imul(ah9, bh1);\n    lo = (lo + Math.imul(al8, bl2)) | 0;\n    mid = (mid + Math.imul(al8, bh2)) | 0;\n    mid = (mid + Math.imul(ah8, bl2)) | 0;\n    hi = (hi + Math.imul(ah8, bh2)) | 0;\n    lo = (lo + Math.imul(al7, bl3)) | 0;\n    mid = (mid + Math.imul(al7, bh3)) | 0;\n    mid = (mid + Math.imul(ah7, bl3)) | 0;\n    hi = (hi + Math.imul(ah7, bh3)) | 0;\n    lo = (lo + Math.imul(al6, bl4)) | 0;\n    mid = (mid + Math.imul(al6, bh4)) | 0;\n    mid = (mid + Math.imul(ah6, bl4)) | 0;\n    hi = (hi + Math.imul(ah6, bh4)) | 0;\n    lo = (lo + Math.imul(al5, bl5)) | 0;\n    mid = (mid + Math.imul(al5, bh5)) | 0;\n    mid = (mid + Math.imul(ah5, bl5)) | 0;\n    hi = (hi + Math.imul(ah5, bh5)) | 0;\n    lo = (lo + Math.imul(al4, bl6)) | 0;\n    mid = (mid + Math.imul(al4, bh6)) | 0;\n    mid = (mid + Math.imul(ah4, bl6)) | 0;\n    hi = (hi + Math.imul(ah4, bh6)) | 0;\n    lo = (lo + Math.imul(al3, bl7)) | 0;\n    mid = (mid + Math.imul(al3, bh7)) | 0;\n    mid = (mid + Math.imul(ah3, bl7)) | 0;\n    hi = (hi + Math.imul(ah3, bh7)) | 0;\n    lo = (lo + Math.imul(al2, bl8)) | 0;\n    mid = (mid + Math.imul(al2, bh8)) | 0;\n    mid = (mid + Math.imul(ah2, bl8)) | 0;\n    hi = (hi + Math.imul(ah2, bh8)) | 0;\n    lo = (lo + Math.imul(al1, bl9)) | 0;\n    mid = (mid + Math.imul(al1, bh9)) | 0;\n    mid = (mid + Math.imul(ah1, bl9)) | 0;\n    hi = (hi + Math.imul(ah1, bh9)) | 0;\n    var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n    w10 &= 0x3ffffff;\n    /* k = 11 */\n    lo = Math.imul(al9, bl2);\n    mid = Math.imul(al9, bh2);\n    mid = (mid + Math.imul(ah9, bl2)) | 0;\n    hi = Math.imul(ah9, bh2);\n    lo = (lo + Math.imul(al8, bl3)) | 0;\n    mid = (mid + Math.imul(al8, bh3)) | 0;\n    mid = (mid + Math.imul(ah8, bl3)) | 0;\n    hi = (hi + Math.imul(ah8, bh3)) | 0;\n    lo = (lo + Math.imul(al7, bl4)) | 0;\n    mid = (mid + Math.imul(al7, bh4)) | 0;\n    mid = (mid + Math.imul(ah7, bl4)) | 0;\n    hi = (hi + Math.imul(ah7, bh4)) | 0;\n    lo = (lo + Math.imul(al6, bl5)) | 0;\n    mid = (mid + Math.imul(al6, bh5)) | 0;\n    mid = (mid + Math.imul(ah6, bl5)) | 0;\n    hi = (hi + Math.imul(ah6, bh5)) | 0;\n    lo = (lo + Math.imul(al5, bl6)) | 0;\n    mid = (mid + Math.imul(al5, bh6)) | 0;\n    mid = (mid + Math.imul(ah5, bl6)) | 0;\n    hi = (hi + Math.imul(ah5, bh6)) | 0;\n    lo = (lo + Math.imul(al4, bl7)) | 0;\n    mid = (mid + Math.imul(al4, bh7)) | 0;\n    mid = (mid + Math.imul(ah4, bl7)) | 0;\n    hi = (hi + Math.imul(ah4, bh7)) | 0;\n    lo = (lo + Math.imul(al3, bl8)) | 0;\n    mid = (mid + Math.imul(al3, bh8)) | 0;\n    mid = (mid + Math.imul(ah3, bl8)) | 0;\n    hi = (hi + Math.imul(ah3, bh8)) | 0;\n    lo = (lo + Math.imul(al2, bl9)) | 0;\n    mid = (mid + Math.imul(al2, bh9)) | 0;\n    mid = (mid + Math.imul(ah2, bl9)) | 0;\n    hi = (hi + Math.imul(ah2, bh9)) | 0;\n    var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n    w11 &= 0x3ffffff;\n    /* k = 12 */\n    lo = Math.imul(al9, bl3);\n    mid = Math.imul(al9, bh3);\n    mid = (mid + Math.imul(ah9, bl3)) | 0;\n    hi = Math.imul(ah9, bh3);\n    lo = (lo + Math.imul(al8, bl4)) | 0;\n    mid = (mid + Math.imul(al8, bh4)) | 0;\n    mid = (mid + Math.imul(ah8, bl4)) | 0;\n    hi = (hi + Math.imul(ah8, bh4)) | 0;\n    lo = (lo + Math.imul(al7, bl5)) | 0;\n    mid = (mid + Math.imul(al7, bh5)) | 0;\n    mid = (mid + Math.imul(ah7, bl5)) | 0;\n    hi = (hi + Math.imul(ah7, bh5)) | 0;\n    lo = (lo + Math.imul(al6, bl6)) | 0;\n    mid = (mid + Math.imul(al6, bh6)) | 0;\n    mid = (mid + Math.imul(ah6, bl6)) | 0;\n    hi = (hi + Math.imul(ah6, bh6)) | 0;\n    lo = (lo + Math.imul(al5, bl7)) | 0;\n    mid = (mid + Math.imul(al5, bh7)) | 0;\n    mid = (mid + Math.imul(ah5, bl7)) | 0;\n    hi = (hi + Math.imul(ah5, bh7)) | 0;\n    lo = (lo + Math.imul(al4, bl8)) | 0;\n    mid = (mid + Math.imul(al4, bh8)) | 0;\n    mid = (mid + Math.imul(ah4, bl8)) | 0;\n    hi = (hi + Math.imul(ah4, bh8)) | 0;\n    lo = (lo + Math.imul(al3, bl9)) | 0;\n    mid = (mid + Math.imul(al3, bh9)) | 0;\n    mid = (mid + Math.imul(ah3, bl9)) | 0;\n    hi = (hi + Math.imul(ah3, bh9)) | 0;\n    var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n    w12 &= 0x3ffffff;\n    /* k = 13 */\n    lo = Math.imul(al9, bl4);\n    mid = Math.imul(al9, bh4);\n    mid = (mid + Math.imul(ah9, bl4)) | 0;\n    hi = Math.imul(ah9, bh4);\n    lo = (lo + Math.imul(al8, bl5)) | 0;\n    mid = (mid + Math.imul(al8, bh5)) | 0;\n    mid = (mid + Math.imul(ah8, bl5)) | 0;\n    hi = (hi + Math.imul(ah8, bh5)) | 0;\n    lo = (lo + Math.imul(al7, bl6)) | 0;\n    mid = (mid + Math.imul(al7, bh6)) | 0;\n    mid = (mid + Math.imul(ah7, bl6)) | 0;\n    hi = (hi + Math.imul(ah7, bh6)) | 0;\n    lo = (lo + Math.imul(al6, bl7)) | 0;\n    mid = (mid + Math.imul(al6, bh7)) | 0;\n    mid = (mid + Math.imul(ah6, bl7)) | 0;\n    hi = (hi + Math.imul(ah6, bh7)) | 0;\n    lo = (lo + Math.imul(al5, bl8)) | 0;\n    mid = (mid + Math.imul(al5, bh8)) | 0;\n    mid = (mid + Math.imul(ah5, bl8)) | 0;\n    hi = (hi + Math.imul(ah5, bh8)) | 0;\n    lo = (lo + Math.imul(al4, bl9)) | 0;\n    mid = (mid + Math.imul(al4, bh9)) | 0;\n    mid = (mid + Math.imul(ah4, bl9)) | 0;\n    hi = (hi + Math.imul(ah4, bh9)) | 0;\n    var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n    w13 &= 0x3ffffff;\n    /* k = 14 */\n    lo = Math.imul(al9, bl5);\n    mid = Math.imul(al9, bh5);\n    mid = (mid + Math.imul(ah9, bl5)) | 0;\n    hi = Math.imul(ah9, bh5);\n    lo = (lo + Math.imul(al8, bl6)) | 0;\n    mid = (mid + Math.imul(al8, bh6)) | 0;\n    mid = (mid + Math.imul(ah8, bl6)) | 0;\n    hi = (hi + Math.imul(ah8, bh6)) | 0;\n    lo = (lo + Math.imul(al7, bl7)) | 0;\n    mid = (mid + Math.imul(al7, bh7)) | 0;\n    mid = (mid + Math.imul(ah7, bl7)) | 0;\n    hi = (hi + Math.imul(ah7, bh7)) | 0;\n    lo = (lo + Math.imul(al6, bl8)) | 0;\n    mid = (mid + Math.imul(al6, bh8)) | 0;\n    mid = (mid + Math.imul(ah6, bl8)) | 0;\n    hi = (hi + Math.imul(ah6, bh8)) | 0;\n    lo = (lo + Math.imul(al5, bl9)) | 0;\n    mid = (mid + Math.imul(al5, bh9)) | 0;\n    mid = (mid + Math.imul(ah5, bl9)) | 0;\n    hi = (hi + Math.imul(ah5, bh9)) | 0;\n    var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n    w14 &= 0x3ffffff;\n    /* k = 15 */\n    lo = Math.imul(al9, bl6);\n    mid = Math.imul(al9, bh6);\n    mid = (mid + Math.imul(ah9, bl6)) | 0;\n    hi = Math.imul(ah9, bh6);\n    lo = (lo + Math.imul(al8, bl7)) | 0;\n    mid = (mid + Math.imul(al8, bh7)) | 0;\n    mid = (mid + Math.imul(ah8, bl7)) | 0;\n    hi = (hi + Math.imul(ah8, bh7)) | 0;\n    lo = (lo + Math.imul(al7, bl8)) | 0;\n    mid = (mid + Math.imul(al7, bh8)) | 0;\n    mid = (mid + Math.imul(ah7, bl8)) | 0;\n    hi = (hi + Math.imul(ah7, bh8)) | 0;\n    lo = (lo + Math.imul(al6, bl9)) | 0;\n    mid = (mid + Math.imul(al6, bh9)) | 0;\n    mid = (mid + Math.imul(ah6, bl9)) | 0;\n    hi = (hi + Math.imul(ah6, bh9)) | 0;\n    var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n    w15 &= 0x3ffffff;\n    /* k = 16 */\n    lo = Math.imul(al9, bl7);\n    mid = Math.imul(al9, bh7);\n    mid = (mid + Math.imul(ah9, bl7)) | 0;\n    hi = Math.imul(ah9, bh7);\n    lo = (lo + Math.imul(al8, bl8)) | 0;\n    mid = (mid + Math.imul(al8, bh8)) | 0;\n    mid = (mid + Math.imul(ah8, bl8)) | 0;\n    hi = (hi + Math.imul(ah8, bh8)) | 0;\n    lo = (lo + Math.imul(al7, bl9)) | 0;\n    mid = (mid + Math.imul(al7, bh9)) | 0;\n    mid = (mid + Math.imul(ah7, bl9)) | 0;\n    hi = (hi + Math.imul(ah7, bh9)) | 0;\n    var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n    w16 &= 0x3ffffff;\n    /* k = 17 */\n    lo = Math.imul(al9, bl8);\n    mid = Math.imul(al9, bh8);\n    mid = (mid + Math.imul(ah9, bl8)) | 0;\n    hi = Math.imul(ah9, bh8);\n    lo = (lo + Math.imul(al8, bl9)) | 0;\n    mid = (mid + Math.imul(al8, bh9)) | 0;\n    mid = (mid + Math.imul(ah8, bl9)) | 0;\n    hi = (hi + Math.imul(ah8, bh9)) | 0;\n    var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n    w17 &= 0x3ffffff;\n    /* k = 18 */\n    lo = Math.imul(al9, bl9);\n    mid = Math.imul(al9, bh9);\n    mid = (mid + Math.imul(ah9, bl9)) | 0;\n    hi = Math.imul(ah9, bh9);\n    var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n    w18 &= 0x3ffffff;\n    o[0] = w0;\n    o[1] = w1;\n    o[2] = w2;\n    o[3] = w3;\n    o[4] = w4;\n    o[5] = w5;\n    o[6] = w6;\n    o[7] = w7;\n    o[8] = w8;\n    o[9] = w9;\n    o[10] = w10;\n    o[11] = w11;\n    o[12] = w12;\n    o[13] = w13;\n    o[14] = w14;\n    o[15] = w15;\n    o[16] = w16;\n    o[17] = w17;\n    o[18] = w18;\n    if (c !== 0) {\n      o[19] = c;\n      out.length++;\n    }\n    return out;\n  };\n\n  // Polyfill comb\n  if (!Math.imul) {\n    comb10MulTo = smallMulTo;\n  }\n\n  function bigMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    out.length = self.length + num.length;\n\n    var carry = 0;\n    var hncarry = 0;\n    for (var k = 0; k < out.length - 1; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = hncarry;\n      hncarry = 0;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = k - j;\n        var a = self.words[i] | 0;\n        var b = num.words[j] | 0;\n        var r = a * b;\n\n        var lo = r & 0x3ffffff;\n        ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n        lo = (lo + rword) | 0;\n        rword = lo & 0x3ffffff;\n        ncarry = (ncarry + (lo >>> 26)) | 0;\n\n        hncarry += ncarry >>> 26;\n        ncarry &= 0x3ffffff;\n      }\n      out.words[k] = rword;\n      carry = ncarry;\n      ncarry = hncarry;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry;\n    } else {\n      out.length--;\n    }\n\n    return out.strip();\n  }\n\n  function jumboMulTo (self, num, out) {\n    var fftm = new FFTM();\n    return fftm.mulp(self, num, out);\n  }\n\n  BN.prototype.mulTo = function mulTo (num, out) {\n    var res;\n    var len = this.length + num.length;\n    if (this.length === 10 && num.length === 10) {\n      res = comb10MulTo(this, num, out);\n    } else if (len < 63) {\n      res = smallMulTo(this, num, out);\n    } else if (len < 1024) {\n      res = bigMulTo(this, num, out);\n    } else {\n      res = jumboMulTo(this, num, out);\n    }\n\n    return res;\n  };\n\n  // Cooley-Tukey algorithm for FFT\n  // slightly revisited to rely on looping instead of recursion\n\n  function FFTM (x, y) {\n    this.x = x;\n    this.y = y;\n  }\n\n  FFTM.prototype.makeRBT = function makeRBT (N) {\n    var t = new Array(N);\n    var l = BN.prototype._countBits(N) - 1;\n    for (var i = 0; i < N; i++) {\n      t[i] = this.revBin(i, l, N);\n    }\n\n    return t;\n  };\n\n  // Returns binary-reversed representation of `x`\n  FFTM.prototype.revBin = function revBin (x, l, N) {\n    if (x === 0 || x === N - 1) return x;\n\n    var rb = 0;\n    for (var i = 0; i < l; i++) {\n      rb |= (x & 1) << (l - i - 1);\n      x >>= 1;\n    }\n\n    return rb;\n  };\n\n  // Performs \"tweedling\" phase, therefore 'emulating'\n  // behaviour of the recursive algorithm\n  FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n    for (var i = 0; i < N; i++) {\n      rtws[i] = rws[rbt[i]];\n      itws[i] = iws[rbt[i]];\n    }\n  };\n\n  FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n    this.permute(rbt, rws, iws, rtws, itws, N);\n\n    for (var s = 1; s < N; s <<= 1) {\n      var l = s << 1;\n\n      var rtwdf = Math.cos(2 * Math.PI / l);\n      var itwdf = Math.sin(2 * Math.PI / l);\n\n      for (var p = 0; p < N; p += l) {\n        var rtwdf_ = rtwdf;\n        var itwdf_ = itwdf;\n\n        for (var j = 0; j < s; j++) {\n          var re = rtws[p + j];\n          var ie = itws[p + j];\n\n          var ro = rtws[p + j + s];\n          var io = itws[p + j + s];\n\n          var rx = rtwdf_ * ro - itwdf_ * io;\n\n          io = rtwdf_ * io + itwdf_ * ro;\n          ro = rx;\n\n          rtws[p + j] = re + ro;\n          itws[p + j] = ie + io;\n\n          rtws[p + j + s] = re - ro;\n          itws[p + j + s] = ie - io;\n\n          /* jshint maxdepth : false */\n          if (j !== l) {\n            rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n            itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n            rtwdf_ = rx;\n          }\n        }\n      }\n    }\n  };\n\n  FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n    var N = Math.max(m, n) | 1;\n    var odd = N & 1;\n    var i = 0;\n    for (N = N / 2 | 0; N; N = N >>> 1) {\n      i++;\n    }\n\n    return 1 << i + 1 + odd;\n  };\n\n  FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n    if (N <= 1) return;\n\n    for (var i = 0; i < N / 2; i++) {\n      var t = rws[i];\n\n      rws[i] = rws[N - i - 1];\n      rws[N - i - 1] = t;\n\n      t = iws[i];\n\n      iws[i] = -iws[N - i - 1];\n      iws[N - i - 1] = -t;\n    }\n  };\n\n  FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n    var carry = 0;\n    for (var i = 0; i < N / 2; i++) {\n      var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n        Math.round(ws[2 * i] / N) +\n        carry;\n\n      ws[i] = w & 0x3ffffff;\n\n      if (w < 0x4000000) {\n        carry = 0;\n      } else {\n        carry = w / 0x4000000 | 0;\n      }\n    }\n\n    return ws;\n  };\n\n  FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n    var carry = 0;\n    for (var i = 0; i < len; i++) {\n      carry = carry + (ws[i] | 0);\n\n      rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n      rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n    }\n\n    // Pad with zeroes\n    for (i = 2 * len; i < N; ++i) {\n      rws[i] = 0;\n    }\n\n    assert(carry === 0);\n    assert((carry & ~0x1fff) === 0);\n  };\n\n  FFTM.prototype.stub = function stub (N) {\n    var ph = new Array(N);\n    for (var i = 0; i < N; i++) {\n      ph[i] = 0;\n    }\n\n    return ph;\n  };\n\n  FFTM.prototype.mulp = function mulp (x, y, out) {\n    var N = 2 * this.guessLen13b(x.length, y.length);\n\n    var rbt = this.makeRBT(N);\n\n    var _ = this.stub(N);\n\n    var rws = new Array(N);\n    var rwst = new Array(N);\n    var iwst = new Array(N);\n\n    var nrws = new Array(N);\n    var nrwst = new Array(N);\n    var niwst = new Array(N);\n\n    var rmws = out.words;\n    rmws.length = N;\n\n    this.convert13b(x.words, x.length, rws, N);\n    this.convert13b(y.words, y.length, nrws, N);\n\n    this.transform(rws, _, rwst, iwst, N, rbt);\n    this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n    for (var i = 0; i < N; i++) {\n      var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n      iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n      rwst[i] = rx;\n    }\n\n    this.conjugate(rwst, iwst, N);\n    this.transform(rwst, iwst, rmws, _, N, rbt);\n    this.conjugate(rmws, _, N);\n    this.normalize13b(rmws, N);\n\n    out.negative = x.negative ^ y.negative;\n    out.length = x.length + y.length;\n    return out.strip();\n  };\n\n  // Multiply `this` by `num`\n  BN.prototype.mul = function mul (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return this.mulTo(num, out);\n  };\n\n  // Multiply employing FFT\n  BN.prototype.mulf = function mulf (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return jumboMulTo(this, num, out);\n  };\n\n  // In-place Multiplication\n  BN.prototype.imul = function imul (num) {\n    return this.clone().mulTo(num, this);\n  };\n\n  BN.prototype.imuln = function imuln (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n\n    // Carry\n    var carry = 0;\n    for (var i = 0; i < this.length; i++) {\n      var w = (this.words[i] | 0) * num;\n      var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n      carry >>= 26;\n      carry += (w / 0x4000000) | 0;\n      // NOTE: lo is 27bit maximum\n      carry += lo >>> 26;\n      this.words[i] = lo & 0x3ffffff;\n    }\n\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n\n    return this;\n  };\n\n  BN.prototype.muln = function muln (num) {\n    return this.clone().imuln(num);\n  };\n\n  // `this` * `this`\n  BN.prototype.sqr = function sqr () {\n    return this.mul(this);\n  };\n\n  // `this` * `this` in-place\n  BN.prototype.isqr = function isqr () {\n    return this.imul(this.clone());\n  };\n\n  // Math.pow(`this`, `num`)\n  BN.prototype.pow = function pow (num) {\n    var w = toBitArray(num);\n    if (w.length === 0) return new BN(1);\n\n    // Skip leading zeroes\n    var res = this;\n    for (var i = 0; i < w.length; i++, res = res.sqr()) {\n      if (w[i] !== 0) break;\n    }\n\n    if (++i < w.length) {\n      for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n        if (w[i] === 0) continue;\n\n        res = res.mul(q);\n      }\n    }\n\n    return res;\n  };\n\n  // Shift-left in-place\n  BN.prototype.iushln = function iushln (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n    var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n    var i;\n\n    if (r !== 0) {\n      var carry = 0;\n\n      for (i = 0; i < this.length; i++) {\n        var newCarry = this.words[i] & carryMask;\n        var c = ((this.words[i] | 0) - newCarry) << r;\n        this.words[i] = c | carry;\n        carry = newCarry >>> (26 - r);\n      }\n\n      if (carry) {\n        this.words[i] = carry;\n        this.length++;\n      }\n    }\n\n    if (s !== 0) {\n      for (i = this.length - 1; i >= 0; i--) {\n        this.words[i + s] = this.words[i];\n      }\n\n      for (i = 0; i < s; i++) {\n        this.words[i] = 0;\n      }\n\n      this.length += s;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ishln = function ishln (bits) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushln(bits);\n  };\n\n  // Shift-right in-place\n  // NOTE: `hint` is a lowest bit before trailing zeroes\n  // NOTE: if `extended` is present - it will be filled with destroyed bits\n  BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var h;\n    if (hint) {\n      h = (hint - (hint % 26)) / 26;\n    } else {\n      h = 0;\n    }\n\n    var r = bits % 26;\n    var s = Math.min((bits - r) / 26, this.length);\n    var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n    var maskedWords = extended;\n\n    h -= s;\n    h = Math.max(0, h);\n\n    // Extended mode, copy masked part\n    if (maskedWords) {\n      for (var i = 0; i < s; i++) {\n        maskedWords.words[i] = this.words[i];\n      }\n      maskedWords.length = s;\n    }\n\n    if (s === 0) {\n      // No-op, we should not move anything at all\n    } else if (this.length > s) {\n      this.length -= s;\n      for (i = 0; i < this.length; i++) {\n        this.words[i] = this.words[i + s];\n      }\n    } else {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    var carry = 0;\n    for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n      var word = this.words[i] | 0;\n      this.words[i] = (carry << (26 - r)) | (word >>> r);\n      carry = word & mask;\n    }\n\n    // Push carried bits as a mask\n    if (maskedWords && carry !== 0) {\n      maskedWords.words[maskedWords.length++] = carry;\n    }\n\n    if (this.length === 0) {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushrn(bits, hint, extended);\n  };\n\n  // Shift-left\n  BN.prototype.shln = function shln (bits) {\n    return this.clone().ishln(bits);\n  };\n\n  BN.prototype.ushln = function ushln (bits) {\n    return this.clone().iushln(bits);\n  };\n\n  // Shift-right\n  BN.prototype.shrn = function shrn (bits) {\n    return this.clone().ishrn(bits);\n  };\n\n  BN.prototype.ushrn = function ushrn (bits) {\n    return this.clone().iushrn(bits);\n  };\n\n  // Test if n bit is set\n  BN.prototype.testn = function testn (bit) {\n    assert(typeof bit === 'number' && bit >= 0);\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) return false;\n\n    // Check bit and return\n    var w = this.words[s];\n\n    return !!(w & q);\n  };\n\n  // Return only lowers bits of number (in-place)\n  BN.prototype.imaskn = function imaskn (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n\n    assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n    if (this.length <= s) {\n      return this;\n    }\n\n    if (r !== 0) {\n      s++;\n    }\n    this.length = Math.min(s, this.length);\n\n    if (r !== 0) {\n      var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n      this.words[this.length - 1] &= mask;\n    }\n\n    return this.strip();\n  };\n\n  // Return only lowers bits of number\n  BN.prototype.maskn = function maskn (bits) {\n    return this.clone().imaskn(bits);\n  };\n\n  // Add plain number `num` to `this`\n  BN.prototype.iaddn = function iaddn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.isubn(-num);\n\n    // Possible sign change\n    if (this.negative !== 0) {\n      if (this.length === 1 && (this.words[0] | 0) < num) {\n        this.words[0] = num - (this.words[0] | 0);\n        this.negative = 0;\n        return this;\n      }\n\n      this.negative = 0;\n      this.isubn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    // Add without checks\n    return this._iaddn(num);\n  };\n\n  BN.prototype._iaddn = function _iaddn (num) {\n    this.words[0] += num;\n\n    // Carry\n    for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n      this.words[i] -= 0x4000000;\n      if (i === this.length - 1) {\n        this.words[i + 1] = 1;\n      } else {\n        this.words[i + 1]++;\n      }\n    }\n    this.length = Math.max(this.length, i + 1);\n\n    return this;\n  };\n\n  // Subtract plain number `num` from `this`\n  BN.prototype.isubn = function isubn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.iaddn(-num);\n\n    if (this.negative !== 0) {\n      this.negative = 0;\n      this.iaddn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    this.words[0] -= num;\n\n    if (this.length === 1 && this.words[0] < 0) {\n      this.words[0] = -this.words[0];\n      this.negative = 1;\n    } else {\n      // Carry\n      for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n        this.words[i] += 0x4000000;\n        this.words[i + 1] -= 1;\n      }\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.addn = function addn (num) {\n    return this.clone().iaddn(num);\n  };\n\n  BN.prototype.subn = function subn (num) {\n    return this.clone().isubn(num);\n  };\n\n  BN.prototype.iabs = function iabs () {\n    this.negative = 0;\n\n    return this;\n  };\n\n  BN.prototype.abs = function abs () {\n    return this.clone().iabs();\n  };\n\n  BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n    var len = num.length + shift;\n    var i;\n\n    this._expand(len);\n\n    var w;\n    var carry = 0;\n    for (i = 0; i < num.length; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      var right = (num.words[i] | 0) * mul;\n      w -= right & 0x3ffffff;\n      carry = (w >> 26) - ((right / 0x4000000) | 0);\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n    for (; i < this.length - shift; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      carry = w >> 26;\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n\n    if (carry === 0) return this.strip();\n\n    // Subtraction overflow\n    assert(carry === -1);\n    carry = 0;\n    for (i = 0; i < this.length; i++) {\n      w = -(this.words[i] | 0) + carry;\n      carry = w >> 26;\n      this.words[i] = w & 0x3ffffff;\n    }\n    this.negative = 1;\n\n    return this.strip();\n  };\n\n  BN.prototype._wordDiv = function _wordDiv (num, mode) {\n    var shift = this.length - num.length;\n\n    var a = this.clone();\n    var b = num;\n\n    // Normalize\n    var bhi = b.words[b.length - 1] | 0;\n    var bhiBits = this._countBits(bhi);\n    shift = 26 - bhiBits;\n    if (shift !== 0) {\n      b = b.ushln(shift);\n      a.iushln(shift);\n      bhi = b.words[b.length - 1] | 0;\n    }\n\n    // Initialize quotient\n    var m = a.length - b.length;\n    var q;\n\n    if (mode !== 'mod') {\n      q = new BN(null);\n      q.length = m + 1;\n      q.words = new Array(q.length);\n      for (var i = 0; i < q.length; i++) {\n        q.words[i] = 0;\n      }\n    }\n\n    var diff = a.clone()._ishlnsubmul(b, 1, m);\n    if (diff.negative === 0) {\n      a = diff;\n      if (q) {\n        q.words[m] = 1;\n      }\n    }\n\n    for (var j = m - 1; j >= 0; j--) {\n      var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n        (a.words[b.length + j - 1] | 0);\n\n      // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n      // (0x7ffffff)\n      qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n      a._ishlnsubmul(b, qj, j);\n      while (a.negative !== 0) {\n        qj--;\n        a.negative = 0;\n        a._ishlnsubmul(b, 1, j);\n        if (!a.isZero()) {\n          a.negative ^= 1;\n        }\n      }\n      if (q) {\n        q.words[j] = qj;\n      }\n    }\n    if (q) {\n      q.strip();\n    }\n    a.strip();\n\n    // Denormalize\n    if (mode !== 'div' && shift !== 0) {\n      a.iushrn(shift);\n    }\n\n    return {\n      div: q || null,\n      mod: a\n    };\n  };\n\n  // NOTE: 1) `mode` can be set to `mod` to request mod only,\n  //       to `div` to request div only, or be absent to\n  //       request both div & mod\n  //       2) `positive` is true if unsigned mod is requested\n  BN.prototype.divmod = function divmod (num, mode, positive) {\n    assert(!num.isZero());\n\n    if (this.isZero()) {\n      return {\n        div: new BN(0),\n        mod: new BN(0)\n      };\n    }\n\n    var div, mod, res;\n    if (this.negative !== 0 && num.negative === 0) {\n      res = this.neg().divmod(num, mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.iadd(num);\n        }\n      }\n\n      return {\n        div: div,\n        mod: mod\n      };\n    }\n\n    if (this.negative === 0 && num.negative !== 0) {\n      res = this.divmod(num.neg(), mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      return {\n        div: div,\n        mod: res.mod\n      };\n    }\n\n    if ((this.negative & num.negative) !== 0) {\n      res = this.neg().divmod(num.neg(), mode);\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.isub(num);\n        }\n      }\n\n      return {\n        div: res.div,\n        mod: mod\n      };\n    }\n\n    // Both numbers are positive at this point\n\n    // Strip both numbers to approximate shift value\n    if (num.length > this.length || this.cmp(num) < 0) {\n      return {\n        div: new BN(0),\n        mod: this\n      };\n    }\n\n    // Very short reduction\n    if (num.length === 1) {\n      if (mode === 'div') {\n        return {\n          div: this.divn(num.words[0]),\n          mod: null\n        };\n      }\n\n      if (mode === 'mod') {\n        return {\n          div: null,\n          mod: new BN(this.modn(num.words[0]))\n        };\n      }\n\n      return {\n        div: this.divn(num.words[0]),\n        mod: new BN(this.modn(num.words[0]))\n      };\n    }\n\n    return this._wordDiv(num, mode);\n  };\n\n  // Find `this` / `num`\n  BN.prototype.div = function div (num) {\n    return this.divmod(num, 'div', false).div;\n  };\n\n  // Find `this` % `num`\n  BN.prototype.mod = function mod (num) {\n    return this.divmod(num, 'mod', false).mod;\n  };\n\n  BN.prototype.umod = function umod (num) {\n    return this.divmod(num, 'mod', true).mod;\n  };\n\n  // Find Round(`this` / `num`)\n  BN.prototype.divRound = function divRound (num) {\n    var dm = this.divmod(num);\n\n    // Fast case - exact division\n    if (dm.mod.isZero()) return dm.div;\n\n    var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n    var half = num.ushrn(1);\n    var r2 = num.andln(1);\n    var cmp = mod.cmp(half);\n\n    // Round down\n    if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n    // Round up\n    return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n  };\n\n  BN.prototype.modn = function modn (num) {\n    assert(num <= 0x3ffffff);\n    var p = (1 << 26) % num;\n\n    var acc = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      acc = (p * acc + (this.words[i] | 0)) % num;\n    }\n\n    return acc;\n  };\n\n  // In-place division by number\n  BN.prototype.idivn = function idivn (num) {\n    assert(num <= 0x3ffffff);\n\n    var carry = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var w = (this.words[i] | 0) + carry * 0x4000000;\n      this.words[i] = (w / num) | 0;\n      carry = w % num;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.divn = function divn (num) {\n    return this.clone().idivn(num);\n  };\n\n  BN.prototype.egcd = function egcd (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var x = this;\n    var y = p.clone();\n\n    if (x.negative !== 0) {\n      x = x.umod(p);\n    } else {\n      x = x.clone();\n    }\n\n    // A * x + B * y = x\n    var A = new BN(1);\n    var B = new BN(0);\n\n    // C * x + D * y = y\n    var C = new BN(0);\n    var D = new BN(1);\n\n    var g = 0;\n\n    while (x.isEven() && y.isEven()) {\n      x.iushrn(1);\n      y.iushrn(1);\n      ++g;\n    }\n\n    var yp = y.clone();\n    var xp = x.clone();\n\n    while (!x.isZero()) {\n      for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        x.iushrn(i);\n        while (i-- > 0) {\n          if (A.isOdd() || B.isOdd()) {\n            A.iadd(yp);\n            B.isub(xp);\n          }\n\n          A.iushrn(1);\n          B.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        y.iushrn(j);\n        while (j-- > 0) {\n          if (C.isOdd() || D.isOdd()) {\n            C.iadd(yp);\n            D.isub(xp);\n          }\n\n          C.iushrn(1);\n          D.iushrn(1);\n        }\n      }\n\n      if (x.cmp(y) >= 0) {\n        x.isub(y);\n        A.isub(C);\n        B.isub(D);\n      } else {\n        y.isub(x);\n        C.isub(A);\n        D.isub(B);\n      }\n    }\n\n    return {\n      a: C,\n      b: D,\n      gcd: y.iushln(g)\n    };\n  };\n\n  // This is reduced incarnation of the binary EEA\n  // above, designated to invert members of the\n  // _prime_ fields F(p) at a maximal speed\n  BN.prototype._invmp = function _invmp (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var a = this;\n    var b = p.clone();\n\n    if (a.negative !== 0) {\n      a = a.umod(p);\n    } else {\n      a = a.clone();\n    }\n\n    var x1 = new BN(1);\n    var x2 = new BN(0);\n\n    var delta = b.clone();\n\n    while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n      for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        a.iushrn(i);\n        while (i-- > 0) {\n          if (x1.isOdd()) {\n            x1.iadd(delta);\n          }\n\n          x1.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        b.iushrn(j);\n        while (j-- > 0) {\n          if (x2.isOdd()) {\n            x2.iadd(delta);\n          }\n\n          x2.iushrn(1);\n        }\n      }\n\n      if (a.cmp(b) >= 0) {\n        a.isub(b);\n        x1.isub(x2);\n      } else {\n        b.isub(a);\n        x2.isub(x1);\n      }\n    }\n\n    var res;\n    if (a.cmpn(1) === 0) {\n      res = x1;\n    } else {\n      res = x2;\n    }\n\n    if (res.cmpn(0) < 0) {\n      res.iadd(p);\n    }\n\n    return res;\n  };\n\n  BN.prototype.gcd = function gcd (num) {\n    if (this.isZero()) return num.abs();\n    if (num.isZero()) return this.abs();\n\n    var a = this.clone();\n    var b = num.clone();\n    a.negative = 0;\n    b.negative = 0;\n\n    // Remove common factor of two\n    for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n      a.iushrn(1);\n      b.iushrn(1);\n    }\n\n    do {\n      while (a.isEven()) {\n        a.iushrn(1);\n      }\n      while (b.isEven()) {\n        b.iushrn(1);\n      }\n\n      var r = a.cmp(b);\n      if (r < 0) {\n        // Swap `a` and `b` to make `a` always bigger than `b`\n        var t = a;\n        a = b;\n        b = t;\n      } else if (r === 0 || b.cmpn(1) === 0) {\n        break;\n      }\n\n      a.isub(b);\n    } while (true);\n\n    return b.iushln(shift);\n  };\n\n  // Invert number in the field F(num)\n  BN.prototype.invm = function invm (num) {\n    return this.egcd(num).a.umod(num);\n  };\n\n  BN.prototype.isEven = function isEven () {\n    return (this.words[0] & 1) === 0;\n  };\n\n  BN.prototype.isOdd = function isOdd () {\n    return (this.words[0] & 1) === 1;\n  };\n\n  // And first word and num\n  BN.prototype.andln = function andln (num) {\n    return this.words[0] & num;\n  };\n\n  // Increment at the bit position in-line\n  BN.prototype.bincn = function bincn (bit) {\n    assert(typeof bit === 'number');\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) {\n      this._expand(s + 1);\n      this.words[s] |= q;\n      return this;\n    }\n\n    // Add bit and propagate, if needed\n    var carry = q;\n    for (var i = s; carry !== 0 && i < this.length; i++) {\n      var w = this.words[i] | 0;\n      w += carry;\n      carry = w >>> 26;\n      w &= 0x3ffffff;\n      this.words[i] = w;\n    }\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n    return this;\n  };\n\n  BN.prototype.isZero = function isZero () {\n    return this.length === 1 && this.words[0] === 0;\n  };\n\n  BN.prototype.cmpn = function cmpn (num) {\n    var negative = num < 0;\n\n    if (this.negative !== 0 && !negative) return -1;\n    if (this.negative === 0 && negative) return 1;\n\n    this.strip();\n\n    var res;\n    if (this.length > 1) {\n      res = 1;\n    } else {\n      if (negative) {\n        num = -num;\n      }\n\n      assert(num <= 0x3ffffff, 'Number is too big');\n\n      var w = this.words[0] | 0;\n      res = w === num ? 0 : w < num ? -1 : 1;\n    }\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Compare two numbers and return:\n  // 1 - if `this` > `num`\n  // 0 - if `this` == `num`\n  // -1 - if `this` < `num`\n  BN.prototype.cmp = function cmp (num) {\n    if (this.negative !== 0 && num.negative === 0) return -1;\n    if (this.negative === 0 && num.negative !== 0) return 1;\n\n    var res = this.ucmp(num);\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Unsigned comparison\n  BN.prototype.ucmp = function ucmp (num) {\n    // At this point both numbers have the same sign\n    if (this.length > num.length) return 1;\n    if (this.length < num.length) return -1;\n\n    var res = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var a = this.words[i] | 0;\n      var b = num.words[i] | 0;\n\n      if (a === b) continue;\n      if (a < b) {\n        res = -1;\n      } else if (a > b) {\n        res = 1;\n      }\n      break;\n    }\n    return res;\n  };\n\n  BN.prototype.gtn = function gtn (num) {\n    return this.cmpn(num) === 1;\n  };\n\n  BN.prototype.gt = function gt (num) {\n    return this.cmp(num) === 1;\n  };\n\n  BN.prototype.gten = function gten (num) {\n    return this.cmpn(num) >= 0;\n  };\n\n  BN.prototype.gte = function gte (num) {\n    return this.cmp(num) >= 0;\n  };\n\n  BN.prototype.ltn = function ltn (num) {\n    return this.cmpn(num) === -1;\n  };\n\n  BN.prototype.lt = function lt (num) {\n    return this.cmp(num) === -1;\n  };\n\n  BN.prototype.lten = function lten (num) {\n    return this.cmpn(num) <= 0;\n  };\n\n  BN.prototype.lte = function lte (num) {\n    return this.cmp(num) <= 0;\n  };\n\n  BN.prototype.eqn = function eqn (num) {\n    return this.cmpn(num) === 0;\n  };\n\n  BN.prototype.eq = function eq (num) {\n    return this.cmp(num) === 0;\n  };\n\n  //\n  // A reduce context, could be using montgomery or something better, depending\n  // on the `m` itself.\n  //\n  BN.red = function red (num) {\n    return new Red(num);\n  };\n\n  BN.prototype.toRed = function toRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    assert(this.negative === 0, 'red works only with positives');\n    return ctx.convertTo(this)._forceRed(ctx);\n  };\n\n  BN.prototype.fromRed = function fromRed () {\n    assert(this.red, 'fromRed works only with numbers in reduction context');\n    return this.red.convertFrom(this);\n  };\n\n  BN.prototype._forceRed = function _forceRed (ctx) {\n    this.red = ctx;\n    return this;\n  };\n\n  BN.prototype.forceRed = function forceRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    return this._forceRed(ctx);\n  };\n\n  BN.prototype.redAdd = function redAdd (num) {\n    assert(this.red, 'redAdd works only with red numbers');\n    return this.red.add(this, num);\n  };\n\n  BN.prototype.redIAdd = function redIAdd (num) {\n    assert(this.red, 'redIAdd works only with red numbers');\n    return this.red.iadd(this, num);\n  };\n\n  BN.prototype.redSub = function redSub (num) {\n    assert(this.red, 'redSub works only with red numbers');\n    return this.red.sub(this, num);\n  };\n\n  BN.prototype.redISub = function redISub (num) {\n    assert(this.red, 'redISub works only with red numbers');\n    return this.red.isub(this, num);\n  };\n\n  BN.prototype.redShl = function redShl (num) {\n    assert(this.red, 'redShl works only with red numbers');\n    return this.red.shl(this, num);\n  };\n\n  BN.prototype.redMul = function redMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.mul(this, num);\n  };\n\n  BN.prototype.redIMul = function redIMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.imul(this, num);\n  };\n\n  BN.prototype.redSqr = function redSqr () {\n    assert(this.red, 'redSqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqr(this);\n  };\n\n  BN.prototype.redISqr = function redISqr () {\n    assert(this.red, 'redISqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.isqr(this);\n  };\n\n  // Square root over p\n  BN.prototype.redSqrt = function redSqrt () {\n    assert(this.red, 'redSqrt works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqrt(this);\n  };\n\n  BN.prototype.redInvm = function redInvm () {\n    assert(this.red, 'redInvm works only with red numbers');\n    this.red._verify1(this);\n    return this.red.invm(this);\n  };\n\n  // Return negative clone of `this` % `red modulo`\n  BN.prototype.redNeg = function redNeg () {\n    assert(this.red, 'redNeg works only with red numbers');\n    this.red._verify1(this);\n    return this.red.neg(this);\n  };\n\n  BN.prototype.redPow = function redPow (num) {\n    assert(this.red && !num.red, 'redPow(normalNum)');\n    this.red._verify1(this);\n    return this.red.pow(this, num);\n  };\n\n  // Prime numbers with efficient reduction\n  var primes = {\n    k256: null,\n    p224: null,\n    p192: null,\n    p25519: null\n  };\n\n  // Pseudo-Mersenne prime\n  function MPrime (name, p) {\n    // P = 2 ^ N - K\n    this.name = name;\n    this.p = new BN(p, 16);\n    this.n = this.p.bitLength();\n    this.k = new BN(1).iushln(this.n).isub(this.p);\n\n    this.tmp = this._tmp();\n  }\n\n  MPrime.prototype._tmp = function _tmp () {\n    var tmp = new BN(null);\n    tmp.words = new Array(Math.ceil(this.n / 13));\n    return tmp;\n  };\n\n  MPrime.prototype.ireduce = function ireduce (num) {\n    // Assumes that `num` is less than `P^2`\n    // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n    var r = num;\n    var rlen;\n\n    do {\n      this.split(r, this.tmp);\n      r = this.imulK(r);\n      r = r.iadd(this.tmp);\n      rlen = r.bitLength();\n    } while (rlen > this.n);\n\n    var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n    if (cmp === 0) {\n      r.words[0] = 0;\n      r.length = 1;\n    } else if (cmp > 0) {\n      r.isub(this.p);\n    } else {\n      if (r.strip !== undefined) {\n        // r is BN v4 instance\n        r.strip();\n      } else {\n        // r is BN v5 instance\n        r._strip();\n      }\n    }\n\n    return r;\n  };\n\n  MPrime.prototype.split = function split (input, out) {\n    input.iushrn(this.n, 0, out);\n  };\n\n  MPrime.prototype.imulK = function imulK (num) {\n    return num.imul(this.k);\n  };\n\n  function K256 () {\n    MPrime.call(\n      this,\n      'k256',\n      'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n  }\n  inherits(K256, MPrime);\n\n  K256.prototype.split = function split (input, output) {\n    // 256 = 9 * 26 + 22\n    var mask = 0x3fffff;\n\n    var outLen = Math.min(input.length, 9);\n    for (var i = 0; i < outLen; i++) {\n      output.words[i] = input.words[i];\n    }\n    output.length = outLen;\n\n    if (input.length <= 9) {\n      input.words[0] = 0;\n      input.length = 1;\n      return;\n    }\n\n    // Shift by 9 limbs\n    var prev = input.words[9];\n    output.words[output.length++] = prev & mask;\n\n    for (i = 10; i < input.length; i++) {\n      var next = input.words[i] | 0;\n      input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n      prev = next;\n    }\n    prev >>>= 22;\n    input.words[i - 10] = prev;\n    if (prev === 0 && input.length > 10) {\n      input.length -= 10;\n    } else {\n      input.length -= 9;\n    }\n  };\n\n  K256.prototype.imulK = function imulK (num) {\n    // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n    num.words[num.length] = 0;\n    num.words[num.length + 1] = 0;\n    num.length += 2;\n\n    // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n    var lo = 0;\n    for (var i = 0; i < num.length; i++) {\n      var w = num.words[i] | 0;\n      lo += w * 0x3d1;\n      num.words[i] = lo & 0x3ffffff;\n      lo = w * 0x40 + ((lo / 0x4000000) | 0);\n    }\n\n    // Fast length reduction\n    if (num.words[num.length - 1] === 0) {\n      num.length--;\n      if (num.words[num.length - 1] === 0) {\n        num.length--;\n      }\n    }\n    return num;\n  };\n\n  function P224 () {\n    MPrime.call(\n      this,\n      'p224',\n      'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n  }\n  inherits(P224, MPrime);\n\n  function P192 () {\n    MPrime.call(\n      this,\n      'p192',\n      'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n  }\n  inherits(P192, MPrime);\n\n  function P25519 () {\n    // 2 ^ 255 - 19\n    MPrime.call(\n      this,\n      '25519',\n      '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n  }\n  inherits(P25519, MPrime);\n\n  P25519.prototype.imulK = function imulK (num) {\n    // K = 0x13\n    var carry = 0;\n    for (var i = 0; i < num.length; i++) {\n      var hi = (num.words[i] | 0) * 0x13 + carry;\n      var lo = hi & 0x3ffffff;\n      hi >>>= 26;\n\n      num.words[i] = lo;\n      carry = hi;\n    }\n    if (carry !== 0) {\n      num.words[num.length++] = carry;\n    }\n    return num;\n  };\n\n  // Exported mostly for testing purposes, use plain name instead\n  BN._prime = function prime (name) {\n    // Cached version of prime\n    if (primes[name]) return primes[name];\n\n    var prime;\n    if (name === 'k256') {\n      prime = new K256();\n    } else if (name === 'p224') {\n      prime = new P224();\n    } else if (name === 'p192') {\n      prime = new P192();\n    } else if (name === 'p25519') {\n      prime = new P25519();\n    } else {\n      throw new Error('Unknown prime ' + name);\n    }\n    primes[name] = prime;\n\n    return prime;\n  };\n\n  //\n  // Base reduction engine\n  //\n  function Red (m) {\n    if (typeof m === 'string') {\n      var prime = BN._prime(m);\n      this.m = prime.p;\n      this.prime = prime;\n    } else {\n      assert(m.gtn(1), 'modulus must be greater than 1');\n      this.m = m;\n      this.prime = null;\n    }\n  }\n\n  Red.prototype._verify1 = function _verify1 (a) {\n    assert(a.negative === 0, 'red works only with positives');\n    assert(a.red, 'red works only with red numbers');\n  };\n\n  Red.prototype._verify2 = function _verify2 (a, b) {\n    assert((a.negative | b.negative) === 0, 'red works only with positives');\n    assert(a.red && a.red === b.red,\n      'red works only with red numbers');\n  };\n\n  Red.prototype.imod = function imod (a) {\n    if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n    return a.umod(this.m)._forceRed(this);\n  };\n\n  Red.prototype.neg = function neg (a) {\n    if (a.isZero()) {\n      return a.clone();\n    }\n\n    return this.m.sub(a)._forceRed(this);\n  };\n\n  Red.prototype.add = function add (a, b) {\n    this._verify2(a, b);\n\n    var res = a.add(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.iadd = function iadd (a, b) {\n    this._verify2(a, b);\n\n    var res = a.iadd(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.sub = function sub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.sub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.isub = function isub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.isub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.shl = function shl (a, num) {\n    this._verify1(a);\n    return this.imod(a.ushln(num));\n  };\n\n  Red.prototype.imul = function imul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.imul(b));\n  };\n\n  Red.prototype.mul = function mul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.mul(b));\n  };\n\n  Red.prototype.isqr = function isqr (a) {\n    return this.imul(a, a.clone());\n  };\n\n  Red.prototype.sqr = function sqr (a) {\n    return this.mul(a, a);\n  };\n\n  Red.prototype.sqrt = function sqrt (a) {\n    if (a.isZero()) return a.clone();\n\n    var mod3 = this.m.andln(3);\n    assert(mod3 % 2 === 1);\n\n    // Fast case\n    if (mod3 === 3) {\n      var pow = this.m.add(new BN(1)).iushrn(2);\n      return this.pow(a, pow);\n    }\n\n    // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n    //\n    // Find Q and S, that Q * 2 ^ S = (P - 1)\n    var q = this.m.subn(1);\n    var s = 0;\n    while (!q.isZero() && q.andln(1) === 0) {\n      s++;\n      q.iushrn(1);\n    }\n    assert(!q.isZero());\n\n    var one = new BN(1).toRed(this);\n    var nOne = one.redNeg();\n\n    // Find quadratic non-residue\n    // NOTE: Max is such because of generalized Riemann hypothesis.\n    var lpow = this.m.subn(1).iushrn(1);\n    var z = this.m.bitLength();\n    z = new BN(2 * z * z).toRed(this);\n\n    while (this.pow(z, lpow).cmp(nOne) !== 0) {\n      z.redIAdd(nOne);\n    }\n\n    var c = this.pow(z, q);\n    var r = this.pow(a, q.addn(1).iushrn(1));\n    var t = this.pow(a, q);\n    var m = s;\n    while (t.cmp(one) !== 0) {\n      var tmp = t;\n      for (var i = 0; tmp.cmp(one) !== 0; i++) {\n        tmp = tmp.redSqr();\n      }\n      assert(i < m);\n      var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n      r = r.redMul(b);\n      c = b.redSqr();\n      t = t.redMul(c);\n      m = i;\n    }\n\n    return r;\n  };\n\n  Red.prototype.invm = function invm (a) {\n    var inv = a._invmp(this.m);\n    if (inv.negative !== 0) {\n      inv.negative = 0;\n      return this.imod(inv).redNeg();\n    } else {\n      return this.imod(inv);\n    }\n  };\n\n  Red.prototype.pow = function pow (a, num) {\n    if (num.isZero()) return new BN(1).toRed(this);\n    if (num.cmpn(1) === 0) return a.clone();\n\n    var windowSize = 4;\n    var wnd = new Array(1 << windowSize);\n    wnd[0] = new BN(1).toRed(this);\n    wnd[1] = a;\n    for (var i = 2; i < wnd.length; i++) {\n      wnd[i] = this.mul(wnd[i - 1], a);\n    }\n\n    var res = wnd[0];\n    var current = 0;\n    var currentLen = 0;\n    var start = num.bitLength() % 26;\n    if (start === 0) {\n      start = 26;\n    }\n\n    for (i = num.length - 1; i >= 0; i--) {\n      var word = num.words[i];\n      for (var j = start - 1; j >= 0; j--) {\n        var bit = (word >> j) & 1;\n        if (res !== wnd[0]) {\n          res = this.sqr(res);\n        }\n\n        if (bit === 0 && current === 0) {\n          currentLen = 0;\n          continue;\n        }\n\n        current <<= 1;\n        current |= bit;\n        currentLen++;\n        if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n        res = this.mul(res, wnd[current]);\n        currentLen = 0;\n        current = 0;\n      }\n      start = 26;\n    }\n\n    return res;\n  };\n\n  Red.prototype.convertTo = function convertTo (num) {\n    var r = num.umod(this.m);\n\n    return r === num ? r.clone() : r;\n  };\n\n  Red.prototype.convertFrom = function convertFrom (num) {\n    var res = num.clone();\n    res.red = null;\n    return res;\n  };\n\n  //\n  // Montgomery method engine\n  //\n\n  BN.mont = function mont (num) {\n    return new Mont(num);\n  };\n\n  function Mont (m) {\n    Red.call(this, m);\n\n    this.shift = this.m.bitLength();\n    if (this.shift % 26 !== 0) {\n      this.shift += 26 - (this.shift % 26);\n    }\n\n    this.r = new BN(1).iushln(this.shift);\n    this.r2 = this.imod(this.r.sqr());\n    this.rinv = this.r._invmp(this.m);\n\n    this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n    this.minv = this.minv.umod(this.r);\n    this.minv = this.r.sub(this.minv);\n  }\n  inherits(Mont, Red);\n\n  Mont.prototype.convertTo = function convertTo (num) {\n    return this.imod(num.ushln(this.shift));\n  };\n\n  Mont.prototype.convertFrom = function convertFrom (num) {\n    var r = this.imod(num.mul(this.rinv));\n    r.red = null;\n    return r;\n  };\n\n  Mont.prototype.imul = function imul (a, b) {\n    if (a.isZero() || b.isZero()) {\n      a.words[0] = 0;\n      a.length = 1;\n      return a;\n    }\n\n    var t = a.imul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.mul = function mul (a, b) {\n    if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n    var t = a.mul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.invm = function invm (a) {\n    // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n    var res = this.imod(a._invmp(this.m).mul(this.r2));\n    return res._forceRed(this);\n  };\n})(typeof module === 'undefined' || module, this);\n","'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","// Copyright (c) 2012, Mark Cavage. All rights reserved.\n// Copyright 2015 Joyent, Inc.\n\nvar assert = require('assert');\nvar Stream = require('stream').Stream;\nvar util = require('util');\n\n\n///--- Globals\n\n/* JSSTYLED */\nvar UUID_REGEXP = /^[a-fA-F0-9]{8}-[a-fA-F0-9]{4}-[a-fA-F0-9]{4}-[a-fA-F0-9]{4}-[a-fA-F0-9]{12}$/;\n\n\n///--- Internal\n\nfunction _capitalize(str) {\n    return (str.charAt(0).toUpperCase() + str.slice(1));\n}\n\nfunction _toss(name, expected, oper, arg, actual) {\n    throw new assert.AssertionError({\n        message: util.format('%s (%s) is required', name, expected),\n        actual: (actual === undefined) ? typeof (arg) : actual(arg),\n        expected: expected,\n        operator: oper || '===',\n        stackStartFunction: _toss.caller\n    });\n}\n\nfunction _getClass(arg) {\n    return (Object.prototype.toString.call(arg).slice(8, -1));\n}\n\nfunction noop() {\n    // Why even bother with asserts?\n}\n\n\n///--- Exports\n\nvar types = {\n    bool: {\n        check: function (arg) { return typeof (arg) === 'boolean'; }\n    },\n    func: {\n        check: function (arg) { return typeof (arg) === 'function'; }\n    },\n    string: {\n        check: function (arg) { return typeof (arg) === 'string'; }\n    },\n    object: {\n        check: function (arg) {\n            return typeof (arg) === 'object' && arg !== null;\n        }\n    },\n    number: {\n        check: function (arg) {\n            return typeof (arg) === 'number' && !isNaN(arg);\n        }\n    },\n    finite: {\n        check: function (arg) {\n            return typeof (arg) === 'number' && !isNaN(arg) && isFinite(arg);\n        }\n    },\n    buffer: {\n        check: function (arg) { return Buffer.isBuffer(arg); },\n        operator: 'Buffer.isBuffer'\n    },\n    array: {\n        check: function (arg) { return Array.isArray(arg); },\n        operator: 'Array.isArray'\n    },\n    stream: {\n        check: function (arg) { return arg instanceof Stream; },\n        operator: 'instanceof',\n        actual: _getClass\n    },\n    date: {\n        check: function (arg) { return arg instanceof Date; },\n        operator: 'instanceof',\n        actual: _getClass\n    },\n    regexp: {\n        check: function (arg) { return arg instanceof RegExp; },\n        operator: 'instanceof',\n        actual: _getClass\n    },\n    uuid: {\n        check: function (arg) {\n            return typeof (arg) === 'string' && UUID_REGEXP.test(arg);\n        },\n        operator: 'isUUID'\n    }\n};\n\nfunction _setExports(ndebug) {\n    var keys = Object.keys(types);\n    var out;\n\n    /* re-export standard assert */\n    if (process.env.NODE_NDEBUG) {\n        out = noop;\n    } else {\n        out = function (arg, msg) {\n            if (!arg) {\n                _toss(msg, 'true', arg);\n            }\n        };\n    }\n\n    /* standard checks */\n    keys.forEach(function (k) {\n        if (ndebug) {\n            out[k] = noop;\n            return;\n        }\n        var type = types[k];\n        out[k] = function (arg, msg) {\n            if (!type.check(arg)) {\n                _toss(msg, k, type.operator, arg, type.actual);\n            }\n        };\n    });\n\n    /* optional checks */\n    keys.forEach(function (k) {\n        var name = 'optional' + _capitalize(k);\n        if (ndebug) {\n            out[name] = noop;\n            return;\n        }\n        var type = types[k];\n        out[name] = function (arg, msg) {\n            if (arg === undefined || arg === null) {\n                return;\n            }\n            if (!type.check(arg)) {\n                _toss(msg, k, type.operator, arg, type.actual);\n            }\n        };\n    });\n\n    /* arrayOf checks */\n    keys.forEach(function (k) {\n        var name = 'arrayOf' + _capitalize(k);\n        if (ndebug) {\n            out[name] = noop;\n            return;\n        }\n        var type = types[k];\n        var expected = '[' + k + ']';\n        out[name] = function (arg, msg) {\n            if (!Array.isArray(arg)) {\n                _toss(msg, expected, type.operator, arg, type.actual);\n            }\n            var i;\n            for (i = 0; i < arg.length; i++) {\n                if (!type.check(arg[i])) {\n                    _toss(msg, expected, type.operator, arg, type.actual);\n                }\n            }\n        };\n    });\n\n    /* optionalArrayOf checks */\n    keys.forEach(function (k) {\n        var name = 'optionalArrayOf' + _capitalize(k);\n        if (ndebug) {\n            out[name] = noop;\n            return;\n        }\n        var type = types[k];\n        var expected = '[' + k + ']';\n        out[name] = function (arg, msg) {\n            if (arg === undefined || arg === null) {\n                return;\n            }\n            if (!Array.isArray(arg)) {\n                _toss(msg, expected, type.operator, arg, type.actual);\n            }\n            var i;\n            for (i = 0; i < arg.length; i++) {\n                if (!type.check(arg[i])) {\n                    _toss(msg, expected, type.operator, arg, type.actual);\n                }\n            }\n        };\n    });\n\n    /* re-export built-in assertions */\n    Object.keys(assert).forEach(function (k) {\n        if (k === 'AssertionError') {\n            out[k] = assert[k];\n            return;\n        }\n        if (ndebug) {\n            out[k] = noop;\n            return;\n        }\n        out[k] = assert[k];\n    });\n\n    /* export ourselves (for unit tests _only_) */\n    out._setExports = _setExports;\n\n    return out;\n}\n\nmodule.exports = _setExports(process.env.NODE_NDEBUG);\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","'use strict';\n\nvar objectAssign = require('object-assign');\n\n// compare and isBuffer taken from https://github.com/feross/buffer/blob/680e9e5e488f22aac27599a57dc844a6315928dd/index.js\n// original notice:\n\n/*!\n * The buffer module from node.js, for the browser.\n *\n * @author   Feross Aboukhadijeh <feross@feross.org> <http://feross.org>\n * @license  MIT\n */\nfunction compare(a, b) {\n  if (a === b) {\n    return 0;\n  }\n\n  var x = a.length;\n  var y = b.length;\n\n  for (var i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i];\n      y = b[i];\n      break;\n    }\n  }\n\n  if (x < y) {\n    return -1;\n  }\n  if (y < x) {\n    return 1;\n  }\n  return 0;\n}\nfunction isBuffer(b) {\n  if (global.Buffer && typeof global.Buffer.isBuffer === 'function') {\n    return global.Buffer.isBuffer(b);\n  }\n  return !!(b != null && b._isBuffer);\n}\n\n// based on node assert, original notice:\n// NB: The URL to the CommonJS spec is kept just for tradition.\n//     node-assert has evolved a lot since then, both in API and behavior.\n\n// http://wiki.commonjs.org/wiki/Unit_Testing/1.0\n//\n// THIS IS NOT TESTED NOR LIKELY TO WORK OUTSIDE V8!\n//\n// Originally from narwhal.js (http://narwhaljs.org)\n// Copyright (c) 2009 Thomas Robinson <280north.com>\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the 'Software'), to\n// deal in the Software without restriction, including without limitation the\n// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n// sell copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\n// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nvar util = require('util/');\nvar hasOwn = Object.prototype.hasOwnProperty;\nvar pSlice = Array.prototype.slice;\nvar functionsHaveNames = (function () {\n  return function foo() {}.name === 'foo';\n}());\nfunction pToString (obj) {\n  return Object.prototype.toString.call(obj);\n}\nfunction isView(arrbuf) {\n  if (isBuffer(arrbuf)) {\n    return false;\n  }\n  if (typeof global.ArrayBuffer !== 'function') {\n    return false;\n  }\n  if (typeof ArrayBuffer.isView === 'function') {\n    return ArrayBuffer.isView(arrbuf);\n  }\n  if (!arrbuf) {\n    return false;\n  }\n  if (arrbuf instanceof DataView) {\n    return true;\n  }\n  if (arrbuf.buffer && arrbuf.buffer instanceof ArrayBuffer) {\n    return true;\n  }\n  return false;\n}\n// 1. The assert module provides functions that throw\n// AssertionError's when particular conditions are not met. The\n// assert module must conform to the following interface.\n\nvar assert = module.exports = ok;\n\n// 2. The AssertionError is defined in assert.\n// new assert.AssertionError({ message: message,\n//                             actual: actual,\n//                             expected: expected })\n\nvar regex = /\\s*function\\s+([^\\(\\s]*)\\s*/;\n// based on https://github.com/ljharb/function.prototype.name/blob/adeeeec8bfcc6068b187d7d9fb3d5bb1d3a30899/implementation.js\nfunction getName(func) {\n  if (!util.isFunction(func)) {\n    return;\n  }\n  if (functionsHaveNames) {\n    return func.name;\n  }\n  var str = func.toString();\n  var match = str.match(regex);\n  return match && match[1];\n}\nassert.AssertionError = function AssertionError(options) {\n  this.name = 'AssertionError';\n  this.actual = options.actual;\n  this.expected = options.expected;\n  this.operator = options.operator;\n  if (options.message) {\n    this.message = options.message;\n    this.generatedMessage = false;\n  } else {\n    this.message = getMessage(this);\n    this.generatedMessage = true;\n  }\n  var stackStartFunction = options.stackStartFunction || fail;\n  if (Error.captureStackTrace) {\n    Error.captureStackTrace(this, stackStartFunction);\n  } else {\n    // non v8 browsers so we can have a stacktrace\n    var err = new Error();\n    if (err.stack) {\n      var out = err.stack;\n\n      // try to strip useless frames\n      var fn_name = getName(stackStartFunction);\n      var idx = out.indexOf('\\n' + fn_name);\n      if (idx >= 0) {\n        // once we have located the function frame\n        // we need to strip out everything before it (and its line)\n        var next_line = out.indexOf('\\n', idx + 1);\n        out = out.substring(next_line + 1);\n      }\n\n      this.stack = out;\n    }\n  }\n};\n\n// assert.AssertionError instanceof Error\nutil.inherits(assert.AssertionError, Error);\n\nfunction truncate(s, n) {\n  if (typeof s === 'string') {\n    return s.length < n ? s : s.slice(0, n);\n  } else {\n    return s;\n  }\n}\nfunction inspect(something) {\n  if (functionsHaveNames || !util.isFunction(something)) {\n    return util.inspect(something);\n  }\n  var rawname = getName(something);\n  var name = rawname ? ': ' + rawname : '';\n  return '[Function' +  name + ']';\n}\nfunction getMessage(self) {\n  return truncate(inspect(self.actual), 128) + ' ' +\n         self.operator + ' ' +\n         truncate(inspect(self.expected), 128);\n}\n\n// At present only the three keys mentioned above are used and\n// understood by the spec. Implementations or sub modules can pass\n// other keys to the AssertionError's constructor - they will be\n// ignored.\n\n// 3. All of the following functions must throw an AssertionError\n// when a corresponding condition is not met, with a message that\n// may be undefined if not provided.  All assertion methods provide\n// both the actual and expected values to the assertion error for\n// display purposes.\n\nfunction fail(actual, expected, message, operator, stackStartFunction) {\n  throw new assert.AssertionError({\n    message: message,\n    actual: actual,\n    expected: expected,\n    operator: operator,\n    stackStartFunction: stackStartFunction\n  });\n}\n\n// EXTENSION! allows for well behaved errors defined elsewhere.\nassert.fail = fail;\n\n// 4. Pure assertion tests whether a value is truthy, as determined\n// by !!guard.\n// assert.ok(guard, message_opt);\n// This statement is equivalent to assert.equal(true, !!guard,\n// message_opt);. To test strictly for the value true, use\n// assert.strictEqual(true, guard, message_opt);.\n\nfunction ok(value, message) {\n  if (!value) fail(value, true, message, '==', assert.ok);\n}\nassert.ok = ok;\n\n// 5. The equality assertion tests shallow, coercive equality with\n// ==.\n// assert.equal(actual, expected, message_opt);\n\nassert.equal = function equal(actual, expected, message) {\n  if (actual != expected) fail(actual, expected, message, '==', assert.equal);\n};\n\n// 6. The non-equality assertion tests for whether two objects are not equal\n// with != assert.notEqual(actual, expected, message_opt);\n\nassert.notEqual = function notEqual(actual, expected, message) {\n  if (actual == expected) {\n    fail(actual, expected, message, '!=', assert.notEqual);\n  }\n};\n\n// 7. The equivalence assertion tests a deep equality relation.\n// assert.deepEqual(actual, expected, message_opt);\n\nassert.deepEqual = function deepEqual(actual, expected, message) {\n  if (!_deepEqual(actual, expected, false)) {\n    fail(actual, expected, message, 'deepEqual', assert.deepEqual);\n  }\n};\n\nassert.deepStrictEqual = function deepStrictEqual(actual, expected, message) {\n  if (!_deepEqual(actual, expected, true)) {\n    fail(actual, expected, message, 'deepStrictEqual', assert.deepStrictEqual);\n  }\n};\n\nfunction _deepEqual(actual, expected, strict, memos) {\n  // 7.1. All identical values are equivalent, as determined by ===.\n  if (actual === expected) {\n    return true;\n  } else if (isBuffer(actual) && isBuffer(expected)) {\n    return compare(actual, expected) === 0;\n\n  // 7.2. If the expected value is a Date object, the actual value is\n  // equivalent if it is also a Date object that refers to the same time.\n  } else if (util.isDate(actual) && util.isDate(expected)) {\n    return actual.getTime() === expected.getTime();\n\n  // 7.3 If the expected value is a RegExp object, the actual value is\n  // equivalent if it is also a RegExp object with the same source and\n  // properties (`global`, `multiline`, `lastIndex`, `ignoreCase`).\n  } else if (util.isRegExp(actual) && util.isRegExp(expected)) {\n    return actual.source === expected.source &&\n           actual.global === expected.global &&\n           actual.multiline === expected.multiline &&\n           actual.lastIndex === expected.lastIndex &&\n           actual.ignoreCase === expected.ignoreCase;\n\n  // 7.4. Other pairs that do not both pass typeof value == 'object',\n  // equivalence is determined by ==.\n  } else if ((actual === null || typeof actual !== 'object') &&\n             (expected === null || typeof expected !== 'object')) {\n    return strict ? actual === expected : actual == expected;\n\n  // If both values are instances of typed arrays, wrap their underlying\n  // ArrayBuffers in a Buffer each to increase performance\n  // This optimization requires the arrays to have the same type as checked by\n  // Object.prototype.toString (aka pToString). Never perform binary\n  // comparisons for Float*Arrays, though, since e.g. +0 === -0 but their\n  // bit patterns are not identical.\n  } else if (isView(actual) && isView(expected) &&\n             pToString(actual) === pToString(expected) &&\n             !(actual instanceof Float32Array ||\n               actual instanceof Float64Array)) {\n    return compare(new Uint8Array(actual.buffer),\n                   new Uint8Array(expected.buffer)) === 0;\n\n  // 7.5 For all other Object pairs, including Array objects, equivalence is\n  // determined by having the same number of owned properties (as verified\n  // with Object.prototype.hasOwnProperty.call), the same set of keys\n  // (although not necessarily the same order), equivalent values for every\n  // corresponding key, and an identical 'prototype' property. Note: this\n  // accounts for both named and indexed properties on Arrays.\n  } else if (isBuffer(actual) !== isBuffer(expected)) {\n    return false;\n  } else {\n    memos = memos || {actual: [], expected: []};\n\n    var actualIndex = memos.actual.indexOf(actual);\n    if (actualIndex !== -1) {\n      if (actualIndex === memos.expected.indexOf(expected)) {\n        return true;\n      }\n    }\n\n    memos.actual.push(actual);\n    memos.expected.push(expected);\n\n    return objEquiv(actual, expected, strict, memos);\n  }\n}\n\nfunction isArguments(object) {\n  return Object.prototype.toString.call(object) == '[object Arguments]';\n}\n\nfunction objEquiv(a, b, strict, actualVisitedObjects) {\n  if (a === null || a === undefined || b === null || b === undefined)\n    return false;\n  // if one is a primitive, the other must be same\n  if (util.isPrimitive(a) || util.isPrimitive(b))\n    return a === b;\n  if (strict && Object.getPrototypeOf(a) !== Object.getPrototypeOf(b))\n    return false;\n  var aIsArgs = isArguments(a);\n  var bIsArgs = isArguments(b);\n  if ((aIsArgs && !bIsArgs) || (!aIsArgs && bIsArgs))\n    return false;\n  if (aIsArgs) {\n    a = pSlice.call(a);\n    b = pSlice.call(b);\n    return _deepEqual(a, b, strict);\n  }\n  var ka = objectKeys(a);\n  var kb = objectKeys(b);\n  var key, i;\n  // having the same number of owned properties (keys incorporates\n  // hasOwnProperty)\n  if (ka.length !== kb.length)\n    return false;\n  //the same set of keys (although not necessarily the same order),\n  ka.sort();\n  kb.sort();\n  //~~~cheap key test\n  for (i = ka.length - 1; i >= 0; i--) {\n    if (ka[i] !== kb[i])\n      return false;\n  }\n  //equivalent values for every corresponding key, and\n  //~~~possibly expensive deep test\n  for (i = ka.length - 1; i >= 0; i--) {\n    key = ka[i];\n    if (!_deepEqual(a[key], b[key], strict, actualVisitedObjects))\n      return false;\n  }\n  return true;\n}\n\n// 8. The non-equivalence assertion tests for any deep inequality.\n// assert.notDeepEqual(actual, expected, message_opt);\n\nassert.notDeepEqual = function notDeepEqual(actual, expected, message) {\n  if (_deepEqual(actual, expected, false)) {\n    fail(actual, expected, message, 'notDeepEqual', assert.notDeepEqual);\n  }\n};\n\nassert.notDeepStrictEqual = notDeepStrictEqual;\nfunction notDeepStrictEqual(actual, expected, message) {\n  if (_deepEqual(actual, expected, true)) {\n    fail(actual, expected, message, 'notDeepStrictEqual', notDeepStrictEqual);\n  }\n}\n\n\n// 9. The strict equality assertion tests strict equality, as determined by ===.\n// assert.strictEqual(actual, expected, message_opt);\n\nassert.strictEqual = function strictEqual(actual, expected, message) {\n  if (actual !== expected) {\n    fail(actual, expected, message, '===', assert.strictEqual);\n  }\n};\n\n// 10. The strict non-equality assertion tests for strict inequality, as\n// determined by !==.  assert.notStrictEqual(actual, expected, message_opt);\n\nassert.notStrictEqual = function notStrictEqual(actual, expected, message) {\n  if (actual === expected) {\n    fail(actual, expected, message, '!==', assert.notStrictEqual);\n  }\n};\n\nfunction expectedException(actual, expected) {\n  if (!actual || !expected) {\n    return false;\n  }\n\n  if (Object.prototype.toString.call(expected) == '[object RegExp]') {\n    return expected.test(actual);\n  }\n\n  try {\n    if (actual instanceof expected) {\n      return true;\n    }\n  } catch (e) {\n    // Ignore.  The instanceof check doesn't work for arrow functions.\n  }\n\n  if (Error.isPrototypeOf(expected)) {\n    return false;\n  }\n\n  return expected.call({}, actual) === true;\n}\n\nfunction _tryBlock(block) {\n  var error;\n  try {\n    block();\n  } catch (e) {\n    error = e;\n  }\n  return error;\n}\n\nfunction _throws(shouldThrow, block, expected, message) {\n  var actual;\n\n  if (typeof block !== 'function') {\n    throw new TypeError('\"block\" argument must be a function');\n  }\n\n  if (typeof expected === 'string') {\n    message = expected;\n    expected = null;\n  }\n\n  actual = _tryBlock(block);\n\n  message = (expected && expected.name ? ' (' + expected.name + ').' : '.') +\n            (message ? ' ' + message : '.');\n\n  if (shouldThrow && !actual) {\n    fail(actual, expected, 'Missing expected exception' + message);\n  }\n\n  var userProvidedMessage = typeof message === 'string';\n  var isUnwantedException = !shouldThrow && util.isError(actual);\n  var isUnexpectedException = !shouldThrow && actual && !expected;\n\n  if ((isUnwantedException &&\n      userProvidedMessage &&\n      expectedException(actual, expected)) ||\n      isUnexpectedException) {\n    fail(actual, expected, 'Got unwanted exception' + message);\n  }\n\n  if ((shouldThrow && actual && expected &&\n      !expectedException(actual, expected)) || (!shouldThrow && actual)) {\n    throw actual;\n  }\n}\n\n// 11. Expected to throw an error:\n// assert.throws(block, Error_opt, message_opt);\n\nassert.throws = function(block, /*optional*/error, /*optional*/message) {\n  _throws(true, block, error, message);\n};\n\n// EXTENSION! This is annoying to write outside this module.\nassert.doesNotThrow = function(block, /*optional*/error, /*optional*/message) {\n  _throws(false, block, error, message);\n};\n\nassert.ifError = function(err) { if (err) throw err; };\n\n// Expose a strict only variant of assert\nfunction strict(value, message) {\n  if (!value) fail(value, true, message, '==', strict);\n}\nassert.strict = objectAssign(strict, assert, {\n  equal: assert.strictEqual,\n  deepEqual: assert.deepStrictEqual,\n  notEqual: assert.notStrictEqual,\n  notDeepEqual: assert.notDeepStrictEqual\n});\nassert.strict.strict = assert.strict;\n\nvar objectKeys = Object.keys || function (obj) {\n  var keys = [];\n  for (var key in obj) {\n    if (hasOwn.call(obj, key)) keys.push(key);\n  }\n  return keys;\n};\n"],"sourceRoot":""}