1(function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c="function"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error("Cannot find module '"+i+"'");throw a.code="MODULE_NOT_FOUND",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u="function"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){
   2(function (Buffer){
   3
   4            exports.code = Buffer.from("AGFzbQEAAAABbA5gAn9/AGABfwBgAX8Bf2ACf38Bf2ADf39/AX9gA39/fwBgA39+fwBgAn9+AGAEf39/fwBgBX9/f39/AGAFf39/f38Bf2AHf39/f39/fwF/YAl/f39/f39/f38Bf2ALf39/f39/f39/f38BfwIQAQNlbnYGbWVtb3J5AgDoBwPDAcEBAAECAQMDBAQFAAAGBwgFBQUAAAUAAAAAAgABBQgIAAIFBQAABQAAAAACAAEFCAgAAgUAAAICAQADAAUABQAAAAgBAgACBQgJCAAFCQMABQUFBQACBQUIAAgCAQEABQUABQUAAAAAAwAICAIBAAMABQAFAAAACAECAAIFCAkIAAUJAAIBAQAFAAUFAAAAAwAICAACAQEABQUABQUAAAAAAwAICAUAAAAACAgFAAAAAAAAAAAAAAAAAAAAAAQKCwwNBQf5E7EBCGludF9jb3B5AAAIaW50X3plcm8AAQdpbnRfb25lAAMKaW50X2lzWmVybwACBmludF9lcQAEB2ludF9ndGUABQdpbnRfYWRkAAYHaW50X3N1YgAHB2ludF9tdWwACAppbnRfc3F1YXJlAAkNaW50X3NxdWFyZU9sZAAKB2ludF9kaXYADQ5pbnRfaW52ZXJzZU1vZAAOB2YxbV9hZGQADwdmMW1fc3ViABAHZjFtX25lZwARDmYxbV9pc05lZ2F0aXZlABgLZjFtX21SZWR1Y3QAEgdmMW1fbXVsABMKZjFtX3NxdWFyZQAUDWYxbV9zcXVhcmVPbGQAFRJmMW1fZnJvbU1vbnRnb21lcnkAFxBmMW1fdG9Nb250Z29tZXJ5ABYLZjFtX2ludmVyc2UAGQhmMW1fY29weQAACGYxbV96ZXJvAAEKZjFtX2lzWmVybwACBmYxbV9lcQAEB2YxbV9vbmUAGghmMW1fbG9hZAAbD2YxbV90aW1lc1NjYWxhcgAcB2YxbV9leHAAHQhmMW1fc3FydAAeDGYxbV9pc1NxdWFyZQAfB2ZybV9hZGQAIAdmcm1fc3ViACEHZnJtX25lZwAiDmZybV9pc05lZ2F0aXZlACkLZnJtX21SZWR1Y3QAIwdmcm1fbXVsACQKZnJtX3NxdWFyZQAlDWZybV9zcXVhcmVPbGQAJhJmcm1fZnJvbU1vbnRnb21lcnkAKBBmcm1fdG9Nb250Z29tZXJ5ACcLZnJtX2ludmVyc2UAKghmcm1fY29weQAACGZybV96ZXJvAAEKZnJtX2lzWmVybwACBmZybV9lcQAEB2ZybV9vbmUAKwhmcm1fbG9hZAAsD2ZybV90aW1lc1NjYWxhcgAtB2ZybV9leHAALghmcm1fc3FydAAvDGZybV9pc1NxdWFyZQAwBmZyX2FkZAAgBmZyX3N1YgAhBmZyX25lZwAiBmZyX211bAAxCWZyX3NxdWFyZQAyCmZyX2ludmVyc2UAMw1mcl9pc05lZ2F0aXZlADQHZnJfY29weQAAB2ZyX3plcm8AAQZmcl9vbmUAKwlmcl9pc1plcm8AAgVmcl9lcQAECmcxbV9pc1plcm8ANQZnMW1fZXEAOAhnMW1fY29weQA3CGcxbV96ZXJvADYKZzFtX2RvdWJsZQA5B2cxbV9hZGQAOgdnMW1fbmVnADsHZzFtX3N1YgA8EmcxbV9mcm9tTW9udGdvbWVyeQA9EGcxbV90b01vbnRnb21lcnkAPgpnMW1fYWZmaW5lAD8PZzFtX3RpbWVzU2NhbGFyAEAMZzFtX211bHRpZXhwAEcNZzFtX211bHRpZXhwMgBLB2ZmdF9mZnQAVAhmZnRfaWZmdABVEWZmdF90b01vbnRnb21lcnlOAFETZmZ0X2Zyb21Nb250Z29tZXJ5TgBQFGZmdF9jb3B5TkludGVybGVhdmVkAE8IZmZ0X211bE4AVghwb2xfemVybwBXD3BvbF9jb25zdHJ1Y3RMQwBYCmYybV9pc1plcm8AWQhmMm1femVybwBaB2YybV9vbmUAWwhmMm1fY29weQBcB2YybV9tdWwAXQhmMm1fbXVsMQBeCmYybV9zcXVhcmUAXwdmMm1fYWRkAGAHZjJtX3N1YgBhB2YybV9uZWcAYg1mMm1fY29uanVnYXRlAGMSZjJtX2Zyb21Nb250Z29tZXJ5AGUQZjJtX3RvTW9udGdvbWVyeQBkBmYybV9lcQBmC2YybV9pbnZlcnNlAGcHZjJtX2V4cABpD2YybV90aW1lc1NjYWxhcgBoCmcybV9pc1plcm8AagZnMm1fZXEAbQhnMm1fY29weQBsCGcybV96ZXJvAGsKZzJtX2RvdWJsZQBuB2cybV9hZGQAbwdnMm1fbmVnAHAHZzJtX3N1YgBxEmcybV9mcm9tTW9udGdvbWVyeQByEGcybV90b01vbnRnb21lcnkAcwpnMm1fYWZmaW5lAHQPZzJtX3RpbWVzU2NhbGFyAHUMZzJtX211bHRpZXhwAHwNZzJtX211bHRpZXhwMgCAAQpmNm1faXNaZXJvAIIBCGY2bV96ZXJvAIMBB2Y2bV9vbmUAhAEIZjZtX2NvcHkAhQEHZjZtX211bACGAQpmNm1fc3F1YXJlAIcBB2Y2bV9hZGQAiAEHZjZtX3N1YgCJAQdmNm1fbmVnAIoBEmY2bV9mcm9tTW9udGdvbWVyeQCMARBmNm1fdG9Nb250Z29tZXJ5AIsBBmY2bV9lcQCNAQtmNm1faW52ZXJzZQCOAQdmNm1fZXhwAJABD2Y2bV90aW1lc1NjYWxhcgCPAQpmdG1faXNaZXJvAJIBCGZ0bV96ZXJvAJMBB2Z0bV9vbmUAlAEIZnRtX2NvcHkAlQEHZnRtX211bACWAQhmdG1fbXVsMQCXAQpmdG1fc3F1YXJlAJgBB2Z0bV9hZGQAmQEHZnRtX3N1YgCaAQdmdG1fbmVnAJsBDWZ0bV9jb25qdWdhdGUAnAESZnRtX2Zyb21Nb250Z29tZXJ5AJ4BEGZ0bV90b01vbnRnb21lcnkAnQEGZnRtX2VxAJ8BC2Z0bV9pbnZlcnNlAKABB2Z0bV9leHAAogEPZnRtX3RpbWVzU2NhbGFyAKEBFGJuMTI4X19mcm9iZW5pdXNNYXAwAKsBFGJuMTI4X19mcm9iZW5pdXNNYXAxAKwBFGJuMTI4X19mcm9iZW5pdXNNYXAyAK0BFGJuMTI4X19mcm9iZW5pdXNNYXAzAK4BFGJuMTI4X19mcm9iZW5pdXNNYXA0AK8BFGJuMTI4X19mcm9iZW5pdXNNYXA1ALABFGJuMTI4X19mcm9iZW5pdXNNYXA2ALEBFGJuMTI4X19mcm9iZW5pdXNNYXA3ALIBFGJuMTI4X19mcm9iZW5pdXNNYXA4ALMBFGJuMTI4X19mcm9iZW5pdXNNYXA5ALQBEGJuMTI4X3BhaXJpbmdFcTEAuwEQYm4xMjhfcGFpcmluZ0VxMgC8ARBibjEyOF9wYWlyaW5nRXEzAL0BEGJuMTI4X3BhaXJpbmdFcTQAvgEQYm4xMjhfcGFpcmluZ0VxNQC/AQ1ibjEyOF9wYWlyaW5nAMABD2JuMTI4X3ByZXBhcmVHMQClAQ9ibjEyOF9wcmVwYXJlRzIApwEQYm4xMjhfbWlsbGVyTG9vcACqARlibjEyOF9maW5hbEV4cG9uZW50aWF0aW9uALoBHGJuMTI4X2ZpbmFsRXhwb25lbnRpYXRpb25PbGQAtQEPYm4xMjhfX211bEJ5MDI0AKgBEmJuMTI4X19tdWxCeTAyNE9sZACpARdibjEyOF9fY3ljbG90b21pY1NxdWFyZQC3ARdibjEyOF9fY3ljbG90b21pY0V4cF93MAC4AQqv3gLBASoAIAEgACkDADcDACABIAApAwg3AwggASAAKQMQNwMQIAEgACkDGDcDGAseACAAQgA3AwAgAEIANwMIIABCADcDECAAQgA3AxgLMwAgACkDGFAEQCAAKQMQUARAIAApAwhQBEAgACkDAFAPBUEADwsFQQAPCwVBAA8LQQAPCx4AIABCATcDACAAQgA3AwggAEIANwMQIABCADcDGAtHACAAKQMYIAEpAxhRBEAgACkDECABKQMQUQRAIAApAwggASkDCFEEQCAAKQMAIAEpAwBRDwVBAA8LBUEADwsFQQAPC0EADwt9ACAAKQMYIAEpAxhUBEBBAA8FIAApAxggASkDGFYEQEEBDwUgACkDECABKQMQVARAQQAPBSAAKQMQIAEpAxBWBEBBAQ8FIAApAwggASkDCFQEQEEADwUgACkDCCABKQMIVgRAQQEPBSAAKQMAIAEpAwBaDwsLCwsLC0EADwvUAQEBfiAANQIAIAE1AgB8IQMgAiADPgIAIAA1AgQgATUCBHwgA0IgiHwhAyACIAM+AgQgADUCCCABNQIIfCADQiCIfCEDIAIgAz4CCCAANQIMIAE1Agx8IANCIIh8IQMgAiADPgIMIAA1AhAgATUCEHwgA0IgiHwhAyACIAM+AhAgADUCFCABNQIUfCADQiCIfCEDIAIgAz4CFCAANQIYIAE1Ahh8IANCIIh8IQMgAiADPgIYIAA1AhwgATUCHHwgA0IgiHwhAyACIAM+AhwgA0IgiKcLjAIBAX4gADUCACABNQIAfSEDIAIgA0L/////D4M+AgAgADUCBCABNQIEfSADQiCHfCEDIAIgA0L/////D4M+AgQgADUCCCABNQIIfSADQiCHfCEDIAIgA0L/////D4M+AgggADUCDCABNQIMfSADQiCHfCEDIAIgA0L/////D4M+AgwgADUCECABNQIQfSADQiCHfCEDIAIgA0L/////D4M+AhAgADUCFCABNQIUfSADQiCHfCEDIAIgA0L/////D4M+AhQgADUCGCABNQIYfSADQiCHfCEDIAIgA0L/////D4M+AhggADUCHCABNQIcfSADQiCHfCEDIAIgA0L/////D4M+AhwgA0Igh6cLjxASAX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+IANC/////w+DIAA1AgAiBSABNQIAIgZ+fCEDIAQgA0IgiHwhBCACIAM+AgAgBEIgiCEDIARC/////w+DIAUgATUCBCIIfnwhBCADIARCIIh8IQMgBEL/////D4MgADUCBCIHIAZ+fCEEIAMgBEIgiHwhAyACIAQ+AgQgA0IgiCEEIANC/////w+DIAUgATUCCCIKfnwhAyAEIANCIIh8IQQgA0L/////D4MgByAIfnwhAyAEIANCIIh8IQQgA0L/////D4MgADUCCCIJIAZ+fCEDIAQgA0IgiHwhBCACIAM+AgggBEIgiCEDIARC/////w+DIAUgATUCDCIMfnwhBCADIARCIIh8IQMgBEL/////D4MgByAKfnwhBCADIARCIIh8IQMgBEL/////D4MgCSAIfnwhBCADIARCIIh8IQMgBEL/////D4MgADUCDCILIAZ+fCEEIAMgBEIgiHwhAyACIAQ+AgwgA0IgiCEEIANC/////w+DIAUgATUCECIOfnwhAyAEIANCIIh8IQQgA0L/////D4MgByAMfnwhAyAEIANCIIh8IQQgA0L/////D4MgCSAKfnwhAyAEIANCIIh8IQQgA0L/////D4MgCyAIfnwhAyAEIANCIIh8IQQgA0L/////D4MgADUCECINIAZ+fCEDIAQgA0IgiHwhBCACIAM+AhAgBEIgiCEDIARC/////w+DIAUgATUCFCIQfnwhBCADIARCIIh8IQMgBEL/////D4MgByAOfnwhBCADIARCIIh8IQMgBEL/////D4MgCSAMfnwhBCADIARCIIh8IQMgBEL/////D4MgCyAKfnwhBCADIARCIIh8IQMgBEL/////D4MgDSAIfnwhBCADIARCIIh8IQMgBEL/////D4MgADUCFCIPIAZ+fCEEIAMgBEIgiHwhAyACIAQ+AhQgA0IgiCEEIANC/////w+DIAUgATUCGCISfnwhAyAEIANCIIh8IQQgA0L/////D4MgByAQfnwhAyAEIANCIIh8IQQgA0L/////D4MgCSAOfnwhAyAEIANCIIh8IQQgA0L/////D4MgCyAMfnwhAyAEIANCIIh8IQQgA0L/////D4MgDSAKfnwhAyAEIANCIIh8IQQgA0L/////D4MgDyAIfnwhAyAEIANCIIh8IQQgA0L/////D4MgADUCGCIRIAZ+fCEDIAQgA0IgiHwhBCACIAM+AhggBEIgiCEDIARC/////w+DIAUgATUCHCIUfnwhBCADIARCIIh8IQMgBEL/////D4MgByASfnwhBCADIARCIIh8IQMgBEL/////D4MgCSAQfnwhBCADIARCIIh8IQMgBEL/////D4MgCyAOfnwhBCADIARCIIh8IQMgBEL/////D4MgDSAMfnwhBCADIARCIIh8IQMgBEL/////D4MgDyAKfnwhBCADIARCIIh8IQMgBEL/////D4MgESAIfnwhBCADIARCIIh8IQMgBEL/////D4MgADUCHCITIAZ+fCEEIAMgBEIgiHwhAyACIAQ+AhwgA0IgiCEEIANC/////w+DIAcgFH58IQMgBCADQiCIfCEEIANC/////w+DIAkgEn58IQMgBCADQiCIfCEEIANC/////w+DIAsgEH58IQMgBCADQiCIfCEEIANC/////w+DIA0gDn58IQMgBCADQiCIfCEEIANC/////w+DIA8gDH58IQMgBCADQiCIfCEEIANC/////w+DIBEgCn58IQMgBCADQiCIfCEEIANC/////w+DIBMgCH58IQMgBCADQiCIfCEEIAIgAz4CICAEQiCIIQMgBEL/////D4MgCSAUfnwhBCADIARCIIh8IQMgBEL/////D4MgCyASfnwhBCADIARCIIh8IQMgBEL/////D4MgDSAQfnwhBCADIARCIIh8IQMgBEL/////D4MgDyAOfnwhBCADIARCIIh8IQMgBEL/////D4MgESAMfnwhBCADIARCIIh8IQMgBEL/////D4MgEyAKfnwhBCADIARCIIh8IQMgAiAEPgIkIANCIIghBCADQv////8PgyALIBR+fCEDIAQgA0IgiHwhBCADQv////8PgyANIBJ+fCEDIAQgA0IgiHwhBCADQv////8PgyAPIBB+fCEDIAQgA0IgiHwhBCADQv////8PgyARIA5+fCEDIAQgA0IgiHwhBCADQv////8PgyATIAx+fCEDIAQgA0IgiHwhBCACIAM+AiggBEIgiCEDIARC/////w+DIA0gFH58IQQgAyAEQiCIfCEDIARC/////w+DIA8gEn58IQQgAyAEQiCIfCEDIARC/////w+DIBEgEH58IQQgAyAEQiCIfCEDIARC/////w+DIBMgDn58IQQgAyAEQiCIfCEDIAIgBD4CLCADQiCIIQQgA0L/////D4MgDyAUfnwhAyAEIANCIIh8IQQgA0L/////D4MgESASfnwhAyAEIANCIIh8IQQgA0L/////D4MgEyAQfnwhAyAEIANCIIh8IQQgAiADPgIwIARCIIghAyAEQv////8PgyARIBR+fCEEIAMgBEIgiHwhAyAEQv////8PgyATIBJ+fCEEIAMgBEIgiHwhAyACIAQ+AjQgA0IgiCEEIANC/////w+DIBMgFH58IQMgBCADQiCIfCEEIAIgAz4COCAEQiCIIQMgAiAEPgI8C4wSDAF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfkIAIQJCACEDIAJC/////w+DQgGGIQIgA0IBhiACQiCIfCEDIAJC/////w+DIAA1AgAiBiAGfnwhAiADIAJCIIh8IQMgASACPgIAIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyAGIAA1AgQiB358IQIgAyACQiCIfCEDIAJC/////w+DQgGGIQIgA0IBhiACQiCIfCEDIAJC/////w+DIARC/////w+DfCECIAMgAkIgiHwgBXwhAyABIAI+AgQgAyEEIARCIIghBUIAIQJCACEDIAJC/////w+DIAYgADUCCCIIfnwhAiADIAJCIIh8IQMgAkL/////D4NCAYYhAiADQgGGIAJCIIh8IQMgAkL/////D4MgByAHfnwhAiADIAJCIIh8IQMgAkL/////D4MgBEL/////D4N8IQIgAyACQiCIfCAFfCEDIAEgAj4CCCADIQQgBEIgiCEFQgAhAkIAIQMgAkL/////D4MgBiAANQIMIgl+fCECIAMgAkIgiHwhAyACQv////8PgyAHIAh+fCECIAMgAkIgiHwhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgASACPgIMIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyAGIAA1AhAiCn58IQIgAyACQiCIfCEDIAJC/////w+DIAcgCX58IQIgAyACQiCIfCEDIAJC/////w+DQgGGIQIgA0IBhiACQiCIfCEDIAJC/////w+DIAggCH58IQIgAyACQiCIfCEDIAJC/////w+DIARC/////w+DfCECIAMgAkIgiHwgBXwhAyABIAI+AhAgAyEEIARCIIghBUIAIQJCACEDIAJC/////w+DIAYgADUCFCILfnwhAiADIAJCIIh8IQMgAkL/////D4MgByAKfnwhAiADIAJCIIh8IQMgAkL/////D4MgCCAJfnwhAiADIAJCIIh8IQMgAkL/////D4NCAYYhAiADQgGGIAJCIIh8IQMgAkL/////D4MgBEL/////D4N8IQIgAyACQiCIfCAFfCEDIAEgAj4CFCADIQQgBEIgiCEFQgAhAkIAIQMgAkL/////D4MgBiAANQIYIgx+fCECIAMgAkIgiHwhAyACQv////8PgyAHIAt+fCECIAMgAkIgiHwhAyACQv////8PgyAIIAp+fCECIAMgAkIgiHwhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyAJIAl+fCECIAMgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgASACPgIYIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyAGIAA1AhwiDX58IQIgAyACQiCIfCEDIAJC/////w+DIAcgDH58IQIgAyACQiCIfCEDIAJC/////w+DIAggC358IQIgAyACQiCIfCEDIAJC/////w+DIAkgCn58IQIgAyACQiCIfCEDIAJC/////w+DQgGGIQIgA0IBhiACQiCIfCEDIAJC/////w+DIARC/////w+DfCECIAMgAkIgiHwgBXwhAyABIAI+AhwgAyEEIARCIIghBUIAIQJCACEDIAJC/////w+DIAcgDX58IQIgAyACQiCIfCEDIAJC/////w+DIAggDH58IQIgAyACQiCIfCEDIAJC/////w+DIAkgC358IQIgAyACQiCIfCEDIAJC/////w+DQgGGIQIgA0IBhiACQiCIfCEDIAJC/////w+DIAogCn58IQIgAyACQiCIfCEDIAJC/////w+DIARC/////w+DfCECIAMgAkIgiHwgBXwhAyABIAI+AiAgAyEEIARCIIghBUIAIQJCACEDIAJC/////w+DIAggDX58IQIgAyACQiCIfCEDIAJC/////w+DIAkgDH58IQIgAyACQiCIfCEDIAJC/////w+DIAogC358IQIgAyACQiCIfCEDIAJC/////w+DQgGGIQIgA0IBhiACQiCIfCEDIAJC/////w+DIARC/////w+DfCECIAMgAkIgiHwgBXwhAyABIAI+AiQgAyEEIARCIIghBUIAIQJCACEDIAJC/////w+DIAkgDX58IQIgAyACQiCIfCEDIAJC/////w+DIAogDH58IQIgAyACQiCIfCEDIAJC/////w+DQgGGIQIgA0IBhiACQiCIfCEDIAJC/////w+DIAsgC358IQIgAyACQiCIfCEDIAJC/////w+DIARC/////w+DfCECIAMgAkIgiHwgBXwhAyABIAI+AiggAyEEIARCIIghBUIAIQJCACEDIAJC/////w+DIAogDX58IQIgAyACQiCIfCEDIAJC/////w+DIAsgDH58IQIgAyACQiCIfCEDIAJC/////w+DQgGGIQIgA0IBhiACQiCIfCEDIAJC/////w+DIARC/////w+DfCECIAMgAkIgiHwgBXwhAyABIAI+AiwgAyEEIARCIIghBUIAIQJCACEDIAJC/////w+DIAsgDX58IQIgAyACQiCIfCEDIAJC/////w+DQgGGIQIgA0IBhiACQiCIfCEDIAJC/////w+DIAwgDH58IQIgAyACQiCIfCEDIAJC/////w+DIARC/////w+DfCECIAMgAkIgiHwgBXwhAyABIAI+AjAgAyEEIARCIIghBUIAIQJCACEDIAJC/////w+DIAwgDX58IQIgAyACQiCIfCEDIAJC/////w+DQgGGIQIgA0IBhiACQiCIfCEDIAJC/////w+DIARC/////w+DfCECIAMgAkIgiHwgBXwhAyABIAI+AjQgAyEEIARCIIghBUIAIQJCACEDIAJC/////w+DQgGGIQIgA0IBhiACQiCIfCEDIAJC/////w+DIA0gDX58IQIgAyACQiCIfCEDIAJC/////w+DIARC/////w+DfCECIAMgAkIgiHwgBXwhAyABIAI+AjggAyEEIARCIIghBSABIAQ+AjwLCgAgACAAIAEQCAu2AQEBfiAANQAAIAF+IQMgAiADPgAAIAA1AAQgAX4gA0IgiHwhAyACIAM+AAQgADUACCABfiADQiCIfCEDIAIgAz4ACCAANQAMIAF+IANCIIh8IQMgAiADPgAMIAA1ABAgAX4gA0IgiHwhAyACIAM+ABAgADUAFCABfiADQiCIfCEDIAIgAz4AFCAANQAYIAF+IANCIIh8IQMgAiADPgAYIAA1ABwgAX4gA0IgiHwhAyACIAM+ABwLTgIBfgF/IAAhAyADNQAAIAF8IQIgAyACPgAAIAJCIIghAgJAA0AgAlANASADQQRqIQMgAzUAACACfCECIAMgAj4AACACQiCIIQIMAAsLC7ACBwF/AX8BfwF/AX4BfgF/IAIEQCACIQUFQegAIQULIAMEQCADIQQFQYgBIQQLIAAgBBAAIAFByAAQACAFEAFBqAEQAUEfIQZBHyEHAkADQEHIACAHai0AACAHQQNGcg0BIAdBAWshBwwACwtByAAgB2pBA2s1AABCAXwhCCAIQgFRBEBCAEIAgBoLAkADQAJAA0AgBCAGai0AACAGQQdGcg0BIAZBAWshBgwACwsgBCAGakEHaykAACEJIAkgCIAhCSAGIAdrQQRrIQoCQANAIAlCgICAgHCDUCAKQQBOcQ0BIAlCCIghCSAKQQFqIQoMAAsLIAlQBEAgBEHIABAFRQ0CQgEhCUEAIQoLQcgAIAlByAEQCyAEQcgBIAprIAQQBxogBSAKaiAJEAwMAAsLC7UCCwF/AX8BfwF/AX8BfwF/AX8BfwF/AX9B6AEhA0HoARABQQAhC0GIAiEFIAFBiAIQAEGoAiEEQagCEANBACEMQcgCIQggAEHIAhAAQegCIQZBiAMhB0HoAyEKAkADQCAIEAINASAFIAggBiAHEA0gBiAEQagDEAggCwRAIAwEQEGoAyADEAUEQEGoAyADIAoQBxpBACENBSADQagDIAoQBxpBASENCwVBqAMgAyAKEAYaQQEhDQsFIAwEQEGoAyADIAoQBhpBACENBSADQagDEAUEQCADQagDIAoQBxpBACENBUGoAyADIAoQBxpBASENCwsLIAMhCSAEIQMgCiEEIAkhCiAMIQsgDSEMIAUhCSAIIQUgByEIIAkhBwwACwsgCwRAIAEgAyACEAcaBSADIAIQAAsLLAAgACABIAIQBgRAIAJBiAQgAhAHGgUgAkGIBBAFBEAgAkGIBCACEAcaCwsLFwAgACABIAIQBwRAIAJBiAQgAhAGGgsLCwBBiAUgACABEBALnBEDAX4BfgF+QonHmaQOIQJCACEDIAA1AgAgAn5C/////w+DIQQgADUCACADQiCIfEGIBDUCACAEfnwhAyAAIAM+AgAgADUCBCADQiCIfEGIBDUCBCAEfnwhAyAAIAM+AgQgADUCCCADQiCIfEGIBDUCCCAEfnwhAyAAIAM+AgggADUCDCADQiCIfEGIBDUCDCAEfnwhAyAAIAM+AgwgADUCECADQiCIfEGIBDUCECAEfnwhAyAAIAM+AhAgADUCFCADQiCIfEGIBDUCFCAEfnwhAyAAIAM+AhQgADUCGCADQiCIfEGIBDUCGCAEfnwhAyAAIAM+AhggADUCHCADQiCIfEGIBDUCHCAEfnwhAyAAIAM+AhxB6AYgA0IgiD4CAEIAIQMgADUCBCACfkL/////D4MhBCAANQIEIANCIIh8QYgENQIAIAR+fCEDIAAgAz4CBCAANQIIIANCIIh8QYgENQIEIAR+fCEDIAAgAz4CCCAANQIMIANCIIh8QYgENQIIIAR+fCEDIAAgAz4CDCAANQIQIANCIIh8QYgENQIMIAR+fCEDIAAgAz4CECAANQIUIANCIIh8QYgENQIQIAR+fCEDIAAgAz4CFCAANQIYIANCIIh8QYgENQIUIAR+fCEDIAAgAz4CGCAANQIcIANCIIh8QYgENQIYIAR+fCEDIAAgAz4CHCAANQIgIANCIIh8QYgENQIcIAR+fCEDIAAgAz4CIEHoBiADQiCIPgIEQgAhAyAANQIIIAJ+Qv////8PgyEEIAA1AgggA0IgiHxBiAQ1AgAgBH58IQMgACADPgIIIAA1AgwgA0IgiHxBiAQ1AgQgBH58IQMgACADPgIMIAA1AhAgA0IgiHxBiAQ1AgggBH58IQMgACADPgIQIAA1AhQgA0IgiHxBiAQ1AgwgBH58IQMgACADPgIUIAA1AhggA0IgiHxBiAQ1AhAgBH58IQMgACADPgIYIAA1AhwgA0IgiHxBiAQ1AhQgBH58IQMgACADPgIcIAA1AiAgA0IgiHxBiAQ1AhggBH58IQMgACADPgIgIAA1AiQgA0IgiHxBiAQ1AhwgBH58IQMgACADPgIkQegGIANCIIg+AghCACEDIAA1AgwgAn5C/////w+DIQQgADUCDCADQiCIfEGIBDUCACAEfnwhAyAAIAM+AgwgADUCECADQiCIfEGIBDUCBCAEfnwhAyAAIAM+AhAgADUCFCADQiCIfEGIBDUCCCAEfnwhAyAAIAM+AhQgADUCGCADQiCIfEGIBDUCDCAEfnwhAyAAIAM+AhggADUCHCADQiCIfEGIBDUCECAEfnwhAyAAIAM+AhwgADUCICADQiCIfEGIBDUCFCAEfnwhAyAAIAM+AiAgADUCJCADQiCIfEGIBDUCGCAEfnwhAyAAIAM+AiQgADUCKCADQiCIfEGIBDUCHCAEfnwhAyAAIAM+AihB6AYgA0IgiD4CDEIAIQMgADUCECACfkL/////D4MhBCAANQIQIANCIIh8QYgENQIAIAR+fCEDIAAgAz4CECAANQIUIANCIIh8QYgENQIEIAR+fCEDIAAgAz4CFCAANQIYIANCIIh8QYgENQIIIAR+fCEDIAAgAz4CGCAANQIcIANCIIh8QYgENQIMIAR+fCEDIAAgAz4CHCAANQIgIANCIIh8QYgENQIQIAR+fCEDIAAgAz4CICAANQIkIANCIIh8QYgENQIUIAR+fCEDIAAgAz4CJCAANQIoIANCIIh8QYgENQIYIAR+fCEDIAAgAz4CKCAANQIsIANCIIh8QYgENQIcIAR+fCEDIAAgAz4CLEHoBiADQiCIPgIQQgAhAyAANQIUIAJ+Qv////8PgyEEIAA1AhQgA0IgiHxBiAQ1AgAgBH58IQMgACADPgIUIAA1AhggA0IgiHxBiAQ1AgQgBH58IQMgACADPgIYIAA1AhwgA0IgiHxBiAQ1AgggBH58IQMgACADPgIcIAA1AiAgA0IgiHxBiAQ1AgwgBH58IQMgACADPgIgIAA1AiQgA0IgiHxBiAQ1AhAgBH58IQMgACADPgIkIAA1AiggA0IgiHxBiAQ1AhQgBH58IQMgACADPgIoIAA1AiwgA0IgiHxBiAQ1AhggBH58IQMgACADPgIsIAA1AjAgA0IgiHxBiAQ1AhwgBH58IQMgACADPgIwQegGIANCIIg+AhRCACEDIAA1AhggAn5C/////w+DIQQgADUCGCADQiCIfEGIBDUCACAEfnwhAyAAIAM+AhggADUCHCADQiCIfEGIBDUCBCAEfnwhAyAAIAM+AhwgADUCICADQiCIfEGIBDUCCCAEfnwhAyAAIAM+AiAgADUCJCADQiCIfEGIBDUCDCAEfnwhAyAAIAM+AiQgADUCKCADQiCIfEGIBDUCECAEfnwhAyAAIAM+AiggADUCLCADQiCIfEGIBDUCFCAEfnwhAyAAIAM+AiwgADUCMCADQiCIfEGIBDUCGCAEfnwhAyAAIAM+AjAgADUCNCADQiCIfEGIBDUCHCAEfnwhAyAAIAM+AjRB6AYgA0IgiD4CGEIAIQMgADUCHCACfkL/////D4MhBCAANQIcIANCIIh8QYgENQIAIAR+fCEDIAAgAz4CHCAANQIgIANCIIh8QYgENQIEIAR+fCEDIAAgAz4CICAANQIkIANCIIh8QYgENQIIIAR+fCEDIAAgAz4CJCAANQIoIANCIIh8QYgENQIMIAR+fCEDIAAgAz4CKCAANQIsIANCIIh8QYgENQIQIAR+fCEDIAAgAz4CLCAANQIwIANCIIh8QYgENQIUIAR+fCEDIAAgAz4CMCAANQI0IANCIIh8QYgENQIYIAR+fCEDIAAgAz4CNCAANQI4IANCIIh8QYgENQIcIAR+fCEDIAAgAz4COEHoBiADQiCIPgIcQegGIABBIGogARAPC74fIwF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX5CiceZpA4hBSADQv////8PgyAANQIAIgYgATUCACIHfnwhAyAEIANCIIh8IQQgA0L/////D4MgBX5C/////w+DIQggA0L/////D4NBADUCiAQiCSAIfnwhAyAEIANCIIh8IQQgBEIgiCEDIARC/////w+DIAYgATUCBCILfnwhBCADIARCIIh8IQMgBEL/////D4MgADUCBCIKIAd+fCEEIAMgBEIgiHwhAyAEQv////8Pg0EANQKMBCINIAh+fCEEIAMgBEIgiHwhAyAEQv////8PgyAFfkL/////D4MhDCAEQv////8PgyAJIAx+fCEEIAMgBEIgiHwhAyADQiCIIQQgA0L/////D4MgBiABNQIIIg9+fCEDIAQgA0IgiHwhBCADQv////8PgyAKIAt+fCEDIAQgA0IgiHwhBCADQv////8PgyAANQIIIg4gB358IQMgBCADQiCIfCEEIANC/////w+DIA0gDH58IQMgBCADQiCIfCEEIANC/////w+DQQA1ApAEIhEgCH58IQMgBCADQiCIfCEEIANC/////w+DIAV+Qv////8PgyEQIANC/////w+DIAkgEH58IQMgBCADQiCIfCEEIARCIIghAyAEQv////8PgyAGIAE1AgwiE358IQQgAyAEQiCIfCEDIARC/////w+DIAogD358IQQgAyAEQiCIfCEDIARC/////w+DIA4gC358IQQgAyAEQiCIfCEDIARC/////w+DIAA1AgwiEiAHfnwhBCADIARCIIh8IQMgBEL/////D4MgDSAQfnwhBCADIARCIIh8IQMgBEL/////D4MgESAMfnwhBCADIARCIIh8IQMgBEL/////D4NBADUClAQiFSAIfnwhBCADIARCIIh8IQMgBEL/////D4MgBX5C/////w+DIRQgBEL/////D4MgCSAUfnwhBCADIARCIIh8IQMgA0IgiCEEIANC/////w+DIAYgATUCECIXfnwhAyAEIANCIIh8IQQgA0L/////D4MgCiATfnwhAyAEIANCIIh8IQQgA0L/////D4MgDiAPfnwhAyAEIANCIIh8IQQgA0L/////D4MgEiALfnwhAyAEIANCIIh8IQQgA0L/////D4MgADUCECIWIAd+fCEDIAQgA0IgiHwhBCADQv////8PgyANIBR+fCEDIAQgA0IgiHwhBCADQv////8PgyARIBB+fCEDIAQgA0IgiHwhBCADQv////8PgyAVIAx+fCEDIAQgA0IgiHwhBCADQv////8Pg0EANQKYBCIZIAh+fCEDIAQgA0IgiHwhBCADQv////8PgyAFfkL/////D4MhGCADQv////8PgyAJIBh+fCEDIAQgA0IgiHwhBCAEQiCIIQMgBEL/////D4MgBiABNQIUIht+fCEEIAMgBEIgiHwhAyAEQv////8PgyAKIBd+fCEEIAMgBEIgiHwhAyAEQv////8PgyAOIBN+fCEEIAMgBEIgiHwhAyAEQv////8PgyASIA9+fCEEIAMgBEIgiHwhAyAEQv////8PgyAWIAt+fCEEIAMgBEIgiHwhAyAEQv////8PgyAANQIUIhogB358IQQgAyAEQiCIfCEDIARC/////w+DIA0gGH58IQQgAyAEQiCIfCEDIARC/////w+DIBEgFH58IQQgAyAEQiCIfCEDIARC/////w+DIBUgEH58IQQgAyAEQiCIfCEDIARC/////w+DIBkgDH58IQQgAyAEQiCIfCEDIARC/////w+DQQA1ApwEIh0gCH58IQQgAyAEQiCIfCEDIARC/////w+DIAV+Qv////8PgyEcIARC/////w+DIAkgHH58IQQgAyAEQiCIfCEDIANCIIghBCADQv////8PgyAGIAE1AhgiH358IQMgBCADQiCIfCEEIANC/////w+DIAogG358IQMgBCADQiCIfCEEIANC/////w+DIA4gF358IQMgBCADQiCIfCEEIANC/////w+DIBIgE358IQMgBCADQiCIfCEEIANC/////w+DIBYgD358IQMgBCADQiCIfCEEIANC/////w+DIBogC358IQMgBCADQiCIfCEEIANC/////w+DIAA1AhgiHiAHfnwhAyAEIANCIIh8IQQgA0L/////D4MgDSAcfnwhAyAEIANCIIh8IQQgA0L/////D4MgESAYfnwhAyAEIANCIIh8IQQgA0L/////D4MgFSAUfnwhAyAEIANCIIh8IQQgA0L/////D4MgGSAQfnwhAyAEIANCIIh8IQQgA0L/////D4MgHSAMfnwhAyAEIANCIIh8IQQgA0L/////D4NBADUCoAQiISAIfnwhAyAEIANCIIh8IQQgA0L/////D4MgBX5C/////w+DISAgA0L/////D4MgCSAgfnwhAyAEIANCIIh8IQQgBEIgiCEDIARC/////w+DIAYgATUCHCIjfnwhBCADIARCIIh8IQMgBEL/////D4MgCiAffnwhBCADIARCIIh8IQMgBEL/////D4MgDiAbfnwhBCADIARCIIh8IQMgBEL/////D4MgEiAXfnwhBCADIARCIIh8IQMgBEL/////D4MgFiATfnwhBCADIARCIIh8IQMgBEL/////D4MgGiAPfnwhBCADIARCIIh8IQMgBEL/////D4MgHiALfnwhBCADIARCIIh8IQMgBEL/////D4MgADUCHCIiIAd+fCEEIAMgBEIgiHwhAyAEQv////8PgyANICB+fCEEIAMgBEIgiHwhAyAEQv////8PgyARIBx+fCEEIAMgBEIgiHwhAyAEQv////8PgyAVIBh+fCEEIAMgBEIgiHwhAyAEQv////8PgyAZIBR+fCEEIAMgBEIgiHwhAyAEQv////8PgyAdIBB+fCEEIAMgBEIgiHwhAyAEQv////8PgyAhIAx+fCEEIAMgBEIgiHwhAyAEQv////8Pg0EANQKkBCIlIAh+fCEEIAMgBEIgiHwhAyAEQv////8PgyAFfkL/////D4MhJCAEQv////8PgyAJICR+fCEEIAMgBEIgiHwhAyADQiCIIQQgA0L/////D4MgCiAjfnwhAyAEIANCIIh8IQQgA0L/////D4MgDiAffnwhAyAEIANCIIh8IQQgA0L/////D4MgEiAbfnwhAyAEIANCIIh8IQQgA0L/////D4MgFiAXfnwhAyAEIANCIIh8IQQgA0L/////D4MgGiATfnwhAyAEIANCIIh8IQQgA0L/////D4MgHiAPfnwhAyAEIANCIIh8IQQgA0L/////D4MgIiALfnwhAyAEIANCIIh8IQQgA0L/////D4MgDSAkfnwhAyAEIANCIIh8IQQgA0L/////D4MgESAgfnwhAyAEIANCIIh8IQQgA0L/////D4MgFSAcfnwhAyAEIANCIIh8IQQgA0L/////D4MgGSAYfnwhAyAEIANCIIh8IQQgA0L/////D4MgHSAUfnwhAyAEIANCIIh8IQQgA0L/////D4MgISAQfnwhAyAEIANCIIh8IQQgA0L/////D4MgJSAMfnwhAyAEIANCIIh8IQQgAiADPgIAIARCIIghAyAEQv////8PgyAOICN+fCEEIAMgBEIgiHwhAyAEQv////8PgyASIB9+fCEEIAMgBEIgiHwhAyAEQv////8PgyAWIBt+fCEEIAMgBEIgiHwhAyAEQv////8PgyAaIBd+fCEEIAMgBEIgiHwhAyAEQv////8PgyAeIBN+fCEEIAMgBEIgiHwhAyAEQv////8PgyAiIA9+fCEEIAMgBEIgiHwhAyAEQv////8PgyARICR+fCEEIAMgBEIgiHwhAyAEQv////8PgyAVICB+fCEEIAMgBEIgiHwhAyAEQv////8PgyAZIBx+fCEEIAMgBEIgiHwhAyAEQv////8PgyAdIBh+fCEEIAMgBEIgiHwhAyAEQv////8PgyAhIBR+fCEEIAMgBEIgiHwhAyAEQv////8PgyAlIBB+fCEEIAMgBEIgiHwhAyACIAQ+AgQgA0IgiCEEIANC/////w+DIBIgI358IQMgBCADQiCIfCEEIANC/////w+DIBYgH358IQMgBCADQiCIfCEEIANC/////w+DIBogG358IQMgBCADQiCIfCEEIANC/////w+DIB4gF358IQMgBCADQiCIfCEEIANC/////w+DICIgE358IQMgBCADQiCIfCEEIANC/////w+DIBUgJH58IQMgBCADQiCIfCEEIANC/////w+DIBkgIH58IQMgBCADQiCIfCEEIANC/////w+DIB0gHH58IQMgBCADQiCIfCEEIANC/////w+DICEgGH58IQMgBCADQiCIfCEEIANC/////w+DICUgFH58IQMgBCADQiCIfCEEIAIgAz4CCCAEQiCIIQMgBEL/////D4MgFiAjfnwhBCADIARCIIh8IQMgBEL/////D4MgGiAffnwhBCADIARCIIh8IQMgBEL/////D4MgHiAbfnwhBCADIARCIIh8IQMgBEL/////D4MgIiAXfnwhBCADIARCIIh8IQMgBEL/////D4MgGSAkfnwhBCADIARCIIh8IQMgBEL/////D4MgHSAgfnwhBCADIARCIIh8IQMgBEL/////D4MgISAcfnwhBCADIARCIIh8IQMgBEL/////D4MgJSAYfnwhBCADIARCIIh8IQMgAiAEPgIMIANCIIghBCADQv////8PgyAaICN+fCEDIAQgA0IgiHwhBCADQv////8PgyAeIB9+fCEDIAQgA0IgiHwhBCADQv////8PgyAiIBt+fCEDIAQgA0IgiHwhBCADQv////8PgyAdICR+fCEDIAQgA0IgiHwhBCADQv////8PgyAhICB+fCEDIAQgA0IgiHwhBCADQv////8PgyAlIBx+fCEDIAQgA0IgiHwhBCACIAM+AhAgBEIgiCEDIARC/////w+DIB4gI358IQQgAyAEQiCIfCEDIARC/////w+DICIgH358IQQgAyAEQiCIfCEDIARC/////w+DICEgJH58IQQgAyAEQiCIfCEDIARC/////w+DICUgIH58IQQgAyAEQiCIfCEDIAIgBD4CFCADQiCIIQQgA0L/////D4MgIiAjfnwhAyAEIANCIIh8IQQgA0L/////D4MgJSAkfnwhAyAEIANCIIh8IQQgAiADPgIYIARCIIghAyACIAQ+AhwgA6cEQCACQYgEIAIQBxoFIAJBiAQQBQRAIAJBiAQgAhAHGgsLC7shHQF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX5CiceZpA4hBkIAIQJCACEDIAJC/////w+DQgGGIQIgA0IBhiACQiCIfCEDIAJC/////w+DIAA1AgAiByAHfnwhAiADIAJCIIh8IQMgAkL/////D4MgBn5C/////w+DIQggAkL/////D4NBADUCiAQiCSAIfnwhAiADIAJCIIh8IQMgAyEEIARCIIghBUIAIQJCACEDIAJC/////w+DIAcgADUCBCIKfnwhAiADIAJCIIh8IQMgAkL/////D4NCAYYhAiADQgGGIAJCIIh8IQMgAkL/////D4MgBEL/////D4N8IQIgAyACQiCIfCAFfCEDIAJC/////w+DQQA1AowEIgwgCH58IQIgAyACQiCIfCEDIAJC/////w+DIAZ+Qv////8PgyELIAJC/////w+DIAkgC358IQIgAyACQiCIfCEDIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyAHIAA1AggiDX58IQIgAyACQiCIfCEDIAJC/////w+DQgGGIQIgA0IBhiACQiCIfCEDIAJC/////w+DIAogCn58IQIgAyACQiCIfCEDIAJC/////w+DIARC/////w+DfCECIAMgAkIgiHwgBXwhAyACQv////8PgyAMIAt+fCECIAMgAkIgiHwhAyACQv////8Pg0EANQKQBCIPIAh+fCECIAMgAkIgiHwhAyACQv////8PgyAGfkL/////D4MhDiACQv////8PgyAJIA5+fCECIAMgAkIgiHwhAyADIQQgBEIgiCEFQgAhAkIAIQMgAkL/////D4MgByAANQIMIhB+fCECIAMgAkIgiHwhAyACQv////8PgyAKIA1+fCECIAMgAkIgiHwhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgAkL/////D4MgDCAOfnwhAiADIAJCIIh8IQMgAkL/////D4MgDyALfnwhAiADIAJCIIh8IQMgAkL/////D4NBADUClAQiEiAIfnwhAiADIAJCIIh8IQMgAkL/////D4MgBn5C/////w+DIREgAkL/////D4MgCSARfnwhAiADIAJCIIh8IQMgAyEEIARCIIghBUIAIQJCACEDIAJC/////w+DIAcgADUCECITfnwhAiADIAJCIIh8IQMgAkL/////D4MgCiAQfnwhAiADIAJCIIh8IQMgAkL/////D4NCAYYhAiADQgGGIAJCIIh8IQMgAkL/////D4MgDSANfnwhAiADIAJCIIh8IQMgAkL/////D4MgBEL/////D4N8IQIgAyACQiCIfCAFfCEDIAJC/////w+DIAwgEX58IQIgAyACQiCIfCEDIAJC/////w+DIA8gDn58IQIgAyACQiCIfCEDIAJC/////w+DIBIgC358IQIgAyACQiCIfCEDIAJC/////w+DQQA1ApgEIhUgCH58IQIgAyACQiCIfCEDIAJC/////w+DIAZ+Qv////8PgyEUIAJC/////w+DIAkgFH58IQIgAyACQiCIfCEDIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyAHIAA1AhQiFn58IQIgAyACQiCIfCEDIAJC/////w+DIAogE358IQIgAyACQiCIfCEDIAJC/////w+DIA0gEH58IQIgAyACQiCIfCEDIAJC/////w+DQgGGIQIgA0IBhiACQiCIfCEDIAJC/////w+DIARC/////w+DfCECIAMgAkIgiHwgBXwhAyACQv////8PgyAMIBR+fCECIAMgAkIgiHwhAyACQv////8PgyAPIBF+fCECIAMgAkIgiHwhAyACQv////8PgyASIA5+fCECIAMgAkIgiHwhAyACQv////8PgyAVIAt+fCECIAMgAkIgiHwhAyACQv////8Pg0EANQKcBCIYIAh+fCECIAMgAkIgiHwhAyACQv////8PgyAGfkL/////D4MhFyACQv////8PgyAJIBd+fCECIAMgAkIgiHwhAyADIQQgBEIgiCEFQgAhAkIAIQMgAkL/////D4MgByAANQIYIhl+fCECIAMgAkIgiHwhAyACQv////8PgyAKIBZ+fCECIAMgAkIgiHwhAyACQv////8PgyANIBN+fCECIAMgAkIgiHwhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyAQIBB+fCECIAMgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgAkL/////D4MgDCAXfnwhAiADIAJCIIh8IQMgAkL/////D4MgDyAUfnwhAiADIAJCIIh8IQMgAkL/////D4MgEiARfnwhAiADIAJCIIh8IQMgAkL/////D4MgFSAOfnwhAiADIAJCIIh8IQMgAkL/////D4MgGCALfnwhAiADIAJCIIh8IQMgAkL/////D4NBADUCoAQiGyAIfnwhAiADIAJCIIh8IQMgAkL/////D4MgBn5C/////w+DIRogAkL/////D4MgCSAafnwhAiADIAJCIIh8IQMgAyEEIARCIIghBUIAIQJCACEDIAJC/////w+DIAcgADUCHCIcfnwhAiADIAJCIIh8IQMgAkL/////D4MgCiAZfnwhAiADIAJCIIh8IQMgAkL/////D4MgDSAWfnwhAiADIAJCIIh8IQMgAkL/////D4MgECATfnwhAiADIAJCIIh8IQMgAkL/////D4NCAYYhAiADQgGGIAJCIIh8IQMgAkL/////D4MgBEL/////D4N8IQIgAyACQiCIfCAFfCEDIAJC/////w+DIAwgGn58IQIgAyACQiCIfCEDIAJC/////w+DIA8gF358IQIgAyACQiCIfCEDIAJC/////w+DIBIgFH58IQIgAyACQiCIfCEDIAJC/////w+DIBUgEX58IQIgAyACQiCIfCEDIAJC/////w+DIBggDn58IQIgAyACQiCIfCEDIAJC/////w+DIBsgC358IQIgAyACQiCIfCEDIAJC/////w+DQQA1AqQEIh4gCH58IQIgAyACQiCIfCEDIAJC/////w+DIAZ+Qv////8PgyEdIAJC/////w+DIAkgHX58IQIgAyACQiCIfCEDIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyAKIBx+fCECIAMgAkIgiHwhAyACQv////8PgyANIBl+fCECIAMgAkIgiHwhAyACQv////8PgyAQIBZ+fCECIAMgAkIgiHwhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyATIBN+fCECIAMgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgAkL/////D4MgDCAdfnwhAiADIAJCIIh8IQMgAkL/////D4MgDyAafnwhAiADIAJCIIh8IQMgAkL/////D4MgEiAXfnwhAiADIAJCIIh8IQMgAkL/////D4MgFSAUfnwhAiADIAJCIIh8IQMgAkL/////D4MgGCARfnwhAiADIAJCIIh8IQMgAkL/////D4MgGyAOfnwhAiADIAJCIIh8IQMgAkL/////D4MgHiALfnwhAiADIAJCIIh8IQMgASACPgIAIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyANIBx+fCECIAMgAkIgiHwhAyACQv////8PgyAQIBl+fCECIAMgAkIgiHwhAyACQv////8PgyATIBZ+fCECIAMgAkIgiHwhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgAkL/////D4MgDyAdfnwhAiADIAJCIIh8IQMgAkL/////D4MgEiAafnwhAiADIAJCIIh8IQMgAkL/////D4MgFSAXfnwhAiADIAJCIIh8IQMgAkL/////D4MgGCAUfnwhAiADIAJCIIh8IQMgAkL/////D4MgGyARfnwhAiADIAJCIIh8IQMgAkL/////D4MgHiAOfnwhAiADIAJCIIh8IQMgASACPgIEIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyAQIBx+fCECIAMgAkIgiHwhAyACQv////8PgyATIBl+fCECIAMgAkIgiHwhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyAWIBZ+fCECIAMgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgAkL/////D4MgEiAdfnwhAiADIAJCIIh8IQMgAkL/////D4MgFSAafnwhAiADIAJCIIh8IQMgAkL/////D4MgGCAXfnwhAiADIAJCIIh8IQMgAkL/////D4MgGyAUfnwhAiADIAJCIIh8IQMgAkL/////D4MgHiARfnwhAiADIAJCIIh8IQMgASACPgIIIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyATIBx+fCECIAMgAkIgiHwhAyACQv////8PgyAWIBl+fCECIAMgAkIgiHwhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgAkL/////D4MgFSAdfnwhAiADIAJCIIh8IQMgAkL/////D4MgGCAafnwhAiADIAJCIIh8IQMgAkL/////D4MgGyAXfnwhAiADIAJCIIh8IQMgAkL/////D4MgHiAUfnwhAiADIAJCIIh8IQMgASACPgIMIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyAWIBx+fCECIAMgAkIgiHwhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyAZIBl+fCECIAMgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgAkL/////D4MgGCAdfnwhAiADIAJCIIh8IQMgAkL/////D4MgGyAafnwhAiADIAJCIIh8IQMgAkL/////D4MgHiAXfnwhAiADIAJCIIh8IQMgASACPgIQIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyAZIBx+fCECIAMgAkIgiHwhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgAkL/////D4MgGyAdfnwhAiADIAJCIIh8IQMgAkL/////D4MgHiAafnwhAiADIAJCIIh8IQMgASACPgIUIAMhBCAEQiCIIQVCACECQgAhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyAcIBx+fCECIAMgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgAkL/////D4MgHiAdfnwhAiADIAJCIIh8IQMgASACPgIYIAMhBCAEQiCIIQUgASAEPgIcIAWnBEAgAUGIBCABEAcaBSABQYgEEAUEQCABQYgEIAEQBxoLCwsKACAAIAAgARATCwsAIABByAQgARATCxUAIABB6AoQAEGICxABQegKIAEQEgsSACAAQagLEBdBqAsoAgBBAXELFwAgACABEBcgAUGIBCABEA4gASABEBYLCQBB6AQgABAAC8sBBAF/AX8BfwF/IAIQAUEgIQUgACEDAkADQCAFIAFLDQEgBUEgRgRAQcgLEBoFQcgLQcgEQcgLEBMLIANByAtB6AsQEyACQegLIAIQDyADQSBqIQMgBUEgaiEFDAALCyABQSBwIQQgBEUEQA8LQegLEAFBACEGAkADQCAGIARGDQEgBiADLQAAOgDoCyADQQFqIQMgBkEBaiEGDAALCyAFQSBGBEBByAsQGgVByAtByARByAsQEwtB6AtByAtB6AsQEyACQegLIAIQDwscACABIAJBiAwQG0GIDEGIDBAWIABBiAwgAxATC6cCAgF/AX8gAEGoDBAAIAMQGiACIQQCQANAIARBAWshBCABIARqLQAAIQUgAyADEBQgBUGAAU8EQCAFQYABayEFQagMIAMgAxATCyADIAMQFCAFQcAATwRAIAVBwABrIQVBqAwgAyADEBMLIAMgAxAUIAVBIE8EQCAFQSBrIQVBqAwgAyADEBMLIAMgAxAUIAVBEE8EQCAFQRBrIQVBqAwgAyADEBMLIAMgAxAUIAVBCE8EQCAFQQhrIQVBqAwgAyADEBMLIAMgAxAUIAVBBE8EQCAFQQRrIQVBqAwgAyADEBMLIAMgAxAUIAVBAk8EQCAFQQJrIQVBqAwgAyADEBMLIAMgAxAUIAVBAU8EQCAFQQFrIQVBqAwgAyADEBMLIARFDQEMAAsLC94BAwF/AX8BfyAAEAIEQCABEAEPC0EBIQJBqAZByAwQACAAQYgGQSBB6AwQHSAAQcgGQSBBiA0QHQJAA0BB6AxB6AQQBA0BQegMQagNEBRBASEDAkADQEGoDUHoBBAEDQFBqA1BqA0QFCADQQFqIQMMAAsLQcgMQcgNEAAgAiADa0EBayEEAkADQCAERQ0BQcgNQcgNEBQgBEEBayEEDAALCyADIQJByA1ByAwQFEHoDEHIDEHoDBATQYgNQcgNQYgNEBMMAAsLQYgNEBgEQEGIDSABEBEFQYgNIAEQAAsLIAAgABACBEBBAQ8LIABBqAVBIEHoDRAdQegNQegEEAQLLAAgACABIAIQBgRAIAJBiA4gAhAHGgUgAkGIDhAFBEAgAkGIDiACEAcaCwsLFwAgACABIAIQBwRAIAJBiA4gAhAGGgsLCwBBiA8gACABECELnBEDAX4BfgF+Qv////8OIQJCACEDIAA1AgAgAn5C/////w+DIQQgADUCACADQiCIfEGIDjUCACAEfnwhAyAAIAM+AgAgADUCBCADQiCIfEGIDjUCBCAEfnwhAyAAIAM+AgQgADUCCCADQiCIfEGIDjUCCCAEfnwhAyAAIAM+AgggADUCDCADQiCIfEGIDjUCDCAEfnwhAyAAIAM+AgwgADUCECADQiCIfEGIDjUCECAEfnwhAyAAIAM+AhAgADUCFCADQiCIfEGIDjUCFCAEfnwhAyAAIAM+AhQgADUCGCADQiCIfEGIDjUCGCAEfnwhAyAAIAM+AhggADUCHCADQiCIfEGIDjUCHCAEfnwhAyAAIAM+AhxB6BAgA0IgiD4CAEIAIQMgADUCBCACfkL/////D4MhBCAANQIEIANCIIh8QYgONQIAIAR+fCEDIAAgAz4CBCAANQIIIANCIIh8QYgONQIEIAR+fCEDIAAgAz4CCCAANQIMIANCIIh8QYgONQIIIAR+fCEDIAAgAz4CDCAANQIQIANCIIh8QYgONQIMIAR+fCEDIAAgAz4CECAANQIUIANCIIh8QYgONQIQIAR+fCEDIAAgAz4CFCAANQIYIANCIIh8QYgONQIUIAR+fCEDIAAgAz4CGCAANQIcIANCIIh8QYgONQIYIAR+fCEDIAAgAz4CHCAANQIgIANCIIh8QYgONQIcIAR+fCEDIAAgAz4CIEHoECADQiCIPgIEQgAhAyAANQIIIAJ+Qv////8PgyEEIAA1AgggA0IgiHxBiA41AgAgBH58IQMgACADPgIIIAA1AgwgA0IgiHxBiA41AgQgBH58IQMgACADPgIMIAA1AhAgA0IgiHxBiA41AgggBH58IQMgACADPgIQIAA1AhQgA0IgiHxBiA41AgwgBH58IQMgACADPgIUIAA1AhggA0IgiHxBiA41AhAgBH58IQMgACADPgIYIAA1AhwgA0IgiHxBiA41AhQgBH58IQMgACADPgIcIAA1AiAgA0IgiHxBiA41AhggBH58IQMgACADPgIgIAA1AiQgA0IgiHxBiA41AhwgBH58IQMgACADPgIkQegQIANCIIg+AghCACEDIAA1AgwgAn5C/////w+DIQQgADUCDCADQiCIfEGIDjUCACAEfnwhAyAAIAM+AgwgADUCECADQiCIfEGIDjUCBCAEfnwhAyAAIAM+AhAgADUCFCADQiCIfEGIDjUCCCAEfnwhAyAAIAM+AhQgADUCGCADQiCIfEGIDjUCDCAEfnwhAyAAIAM+AhggADUCHCADQiCIfEGIDjUCECAEfnwhAyAAIAM+AhwgADUCICADQiCIfEGIDjUCFCAEfnwhAyAAIAM+AiAgADUCJCADQiCIfEGIDjUCGCAEfnwhAyAAIAM+AiQgADUCKCADQiCIfEGIDjUCHCAEfnwhAyAAIAM+AihB6BAgA0IgiD4CDEIAIQMgADUCECACfkL/////D4MhBCAANQIQIANCIIh8QYgONQIAIAR+fCEDIAAgAz4CECAANQIUIANCIIh8QYgONQIEIAR+fCEDIAAgAz4CFCAANQIYIANCIIh8QYgONQIIIAR+fCEDIAAgAz4CGCAANQIcIANCIIh8QYgONQIMIAR+fCEDIAAgAz4CHCAANQIgIANCIIh8QYgONQIQIAR+fCEDIAAgAz4CICAANQIkIANCIIh8QYgONQIUIAR+fCEDIAAgAz4CJCAANQIoIANCIIh8QYgONQIYIAR+fCEDIAAgAz4CKCAANQIsIANCIIh8QYgONQIcIAR+fCEDIAAgAz4CLEHoECADQiCIPgIQQgAhAyAANQIUIAJ+Qv////8PgyEEIAA1AhQgA0IgiHxBiA41AgAgBH58IQMgACADPgIUIAA1AhggA0IgiHxBiA41AgQgBH58IQMgACADPgIYIAA1AhwgA0IgiHxBiA41AgggBH58IQMgACADPgIcIAA1AiAgA0IgiHxBiA41AgwgBH58IQMgACADPgIgIAA1AiQgA0IgiHxBiA41AhAgBH58IQMgACADPgIkIAA1AiggA0IgiHxBiA41AhQgBH58IQMgACADPgIoIAA1AiwgA0IgiHxBiA41AhggBH58IQMgACADPgIsIAA1AjAgA0IgiHxBiA41AhwgBH58IQMgACADPgIwQegQIANCIIg+AhRCACEDIAA1AhggAn5C/////w+DIQQgADUCGCADQiCIfEGIDjUCACAEfnwhAyAAIAM+AhggADUCHCADQiCIfEGIDjUCBCAEfnwhAyAAIAM+AhwgADUCICADQiCIfEGIDjUCCCAEfnwhAyAAIAM+AiAgADUCJCADQiCIfEGIDjUCDCAEfnwhAyAAIAM+AiQgADUCKCADQiCIfEGIDjUCECAEfnwhAyAAIAM+AiggADUCLCADQiCIfEGIDjUCFCAEfnwhAyAAIAM+AiwgADUCMCADQiCIfEGIDjUCGCAEfnwhAyAAIAM+AjAgADUCNCADQiCIfEGIDjUCHCAEfnwhAyAAIAM+AjRB6BAgA0IgiD4CGEIAIQMgADUCHCACfkL/////D4MhBCAANQIcIANCIIh8QYgONQIAIAR+fCEDIAAgAz4CHCAANQIgIANCIIh8QYgONQIEIAR+fCEDIAAgAz4CICAANQIkIANCIIh8QYgONQIIIAR+fCEDIAAgAz4CJCAANQIoIANCIIh8QYgONQIMIAR+fCEDIAAgAz4CKCAANQIsIANCIIh8QYgONQIQIAR+fCEDIAAgAz4CLCAANQIwIANCIIh8QYgONQIUIAR+fCEDIAAgAz4CMCAANQI0IANCIIh8QYgONQIYIAR+fCEDIAAgAz4CNCAANQI4IANCIIh8QYgONQIcIAR+fCEDIAAgAz4COEHoECADQiCIPgIcQegQIABBIGogARAgC74fIwF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX5C/////w4hBSADQv////8PgyAANQIAIgYgATUCACIHfnwhAyAEIANCIIh8IQQgA0L/////D4MgBX5C/////w+DIQggA0L/////D4NBADUCiA4iCSAIfnwhAyAEIANCIIh8IQQgBEIgiCEDIARC/////w+DIAYgATUCBCILfnwhBCADIARCIIh8IQMgBEL/////D4MgADUCBCIKIAd+fCEEIAMgBEIgiHwhAyAEQv////8Pg0EANQKMDiINIAh+fCEEIAMgBEIgiHwhAyAEQv////8PgyAFfkL/////D4MhDCAEQv////8PgyAJIAx+fCEEIAMgBEIgiHwhAyADQiCIIQQgA0L/////D4MgBiABNQIIIg9+fCEDIAQgA0IgiHwhBCADQv////8PgyAKIAt+fCEDIAQgA0IgiHwhBCADQv////8PgyAANQIIIg4gB358IQMgBCADQiCIfCEEIANC/////w+DIA0gDH58IQMgBCADQiCIfCEEIANC/////w+DQQA1ApAOIhEgCH58IQMgBCADQiCIfCEEIANC/////w+DIAV+Qv////8PgyEQIANC/////w+DIAkgEH58IQMgBCADQiCIfCEEIARCIIghAyAEQv////8PgyAGIAE1AgwiE358IQQgAyAEQiCIfCEDIARC/////w+DIAogD358IQQgAyAEQiCIfCEDIARC/////w+DIA4gC358IQQgAyAEQiCIfCEDIARC/////w+DIAA1AgwiEiAHfnwhBCADIARCIIh8IQMgBEL/////D4MgDSAQfnwhBCADIARCIIh8IQMgBEL/////D4MgESAMfnwhBCADIARCIIh8IQMgBEL/////D4NBADUClA4iFSAIfnwhBCADIARCIIh8IQMgBEL/////D4MgBX5C/////w+DIRQgBEL/////D4MgCSAUfnwhBCADIARCIIh8IQMgA0IgiCEEIANC/////w+DIAYgATUCECIXfnwhAyAEIANCIIh8IQQgA0L/////D4MgCiATfnwhAyAEIANCIIh8IQQgA0L/////D4MgDiAPfnwhAyAEIANCIIh8IQQgA0L/////D4MgEiALfnwhAyAEIANCIIh8IQQgA0L/////D4MgADUCECIWIAd+fCEDIAQgA0IgiHwhBCADQv////8PgyANIBR+fCEDIAQgA0IgiHwhBCADQv////8PgyARIBB+fCEDIAQgA0IgiHwhBCADQv////8PgyAVIAx+fCEDIAQgA0IgiHwhBCADQv////8Pg0EANQKYDiIZIAh+fCEDIAQgA0IgiHwhBCADQv////8PgyAFfkL/////D4MhGCADQv////8PgyAJIBh+fCEDIAQgA0IgiHwhBCAEQiCIIQMgBEL/////D4MgBiABNQIUIht+fCEEIAMgBEIgiHwhAyAEQv////8PgyAKIBd+fCEEIAMgBEIgiHwhAyAEQv////8PgyAOIBN+fCEEIAMgBEIgiHwhAyAEQv////8PgyASIA9+fCEEIAMgBEIgiHwhAyAEQv////8PgyAWIAt+fCEEIAMgBEIgiHwhAyAEQv////8PgyAANQIUIhogB358IQQgAyAEQiCIfCEDIARC/////w+DIA0gGH58IQQgAyAEQiCIfCEDIARC/////w+DIBEgFH58IQQgAyAEQiCIfCEDIARC/////w+DIBUgEH58IQQgAyAEQiCIfCEDIARC/////w+DIBkgDH58IQQgAyAEQiCIfCEDIARC/////w+DQQA1ApwOIh0gCH58IQQgAyAEQiCIfCEDIARC/////w+DIAV+Qv////8PgyEcIARC/////w+DIAkgHH58IQQgAyAEQiCIfCEDIANCIIghBCADQv////8PgyAGIAE1AhgiH358IQMgBCADQiCIfCEEIANC/////w+DIAogG358IQMgBCADQiCIfCEEIANC/////w+DIA4gF358IQMgBCADQiCIfCEEIANC/////w+DIBIgE358IQMgBCADQiCIfCEEIANC/////w+DIBYgD358IQMgBCADQiCIfCEEIANC/////w+DIBogC358IQMgBCADQiCIfCEEIANC/////w+DIAA1AhgiHiAHfnwhAyAEIANCIIh8IQQgA0L/////D4MgDSAcfnwhAyAEIANCIIh8IQQgA0L/////D4MgESAYfnwhAyAEIANCIIh8IQQgA0L/////D4MgFSAUfnwhAyAEIANCIIh8IQQgA0L/////D4MgGSAQfnwhAyAEIANCIIh8IQQgA0L/////D4MgHSAMfnwhAyAEIANCIIh8IQQgA0L/////D4NBADUCoA4iISAIfnwhAyAEIANCIIh8IQQgA0L/////D4MgBX5C/////w+DISAgA0L/////D4MgCSAgfnwhAyAEIANCIIh8IQQgBEIgiCEDIARC/////w+DIAYgATUCHCIjfnwhBCADIARCIIh8IQMgBEL/////D4MgCiAffnwhBCADIARCIIh8IQMgBEL/////D4MgDiAbfnwhBCADIARCIIh8IQMgBEL/////D4MgEiAXfnwhBCADIARCIIh8IQMgBEL/////D4MgFiATfnwhBCADIARCIIh8IQMgBEL/////D4MgGiAPfnwhBCADIARCIIh8IQMgBEL/////D4MgHiALfnwhBCADIARCIIh8IQMgBEL/////D4MgADUCHCIiIAd+fCEEIAMgBEIgiHwhAyAEQv////8PgyANICB+fCEEIAMgBEIgiHwhAyAEQv////8PgyARIBx+fCEEIAMgBEIgiHwhAyAEQv////8PgyAVIBh+fCEEIAMgBEIgiHwhAyAEQv////8PgyAZIBR+fCEEIAMgBEIgiHwhAyAEQv////8PgyAdIBB+fCEEIAMgBEIgiHwhAyAEQv////8PgyAhIAx+fCEEIAMgBEIgiHwhAyAEQv////8Pg0EANQKkDiIlIAh+fCEEIAMgBEIgiHwhAyAEQv////8PgyAFfkL/////D4MhJCAEQv////8PgyAJICR+fCEEIAMgBEIgiHwhAyADQiCIIQQgA0L/////D4MgCiAjfnwhAyAEIANCIIh8IQQgA0L/////D4MgDiAffnwhAyAEIANCIIh8IQQgA0L/////D4MgEiAbfnwhAyAEIANCIIh8IQQgA0L/////D4MgFiAXfnwhAyAEIANCIIh8IQQgA0L/////D4MgGiATfnwhAyAEIANCIIh8IQQgA0L/////D4MgHiAPfnwhAyAEIANCIIh8IQQgA0L/////D4MgIiALfnwhAyAEIANCIIh8IQQgA0L/////D4MgDSAkfnwhAyAEIANCIIh8IQQgA0L/////D4MgESAgfnwhAyAEIANCIIh8IQQgA0L/////D4MgFSAcfnwhAyAEIANCIIh8IQQgA0L/////D4MgGSAYfnwhAyAEIANCIIh8IQQgA0L/////D4MgHSAUfnwhAyAEIANCIIh8IQQgA0L/////D4MgISAQfnwhAyAEIANCIIh8IQQgA0L/////D4MgJSAMfnwhAyAEIANCIIh8IQQgAiADPgIAIARCIIghAyAEQv////8PgyAOICN+fCEEIAMgBEIgiHwhAyAEQv////8PgyASIB9+fCEEIAMgBEIgiHwhAyAEQv////8PgyAWIBt+fCEEIAMgBEIgiHwhAyAEQv////8PgyAaIBd+fCEEIAMgBEIgiHwhAyAEQv////8PgyAeIBN+fCEEIAMgBEIgiHwhAyAEQv////8PgyAiIA9+fCEEIAMgBEIgiHwhAyAEQv////8PgyARICR+fCEEIAMgBEIgiHwhAyAEQv////8PgyAVICB+fCEEIAMgBEIgiHwhAyAEQv////8PgyAZIBx+fCEEIAMgBEIgiHwhAyAEQv////8PgyAdIBh+fCEEIAMgBEIgiHwhAyAEQv////8PgyAhIBR+fCEEIAMgBEIgiHwhAyAEQv////8PgyAlIBB+fCEEIAMgBEIgiHwhAyACIAQ+AgQgA0IgiCEEIANC/////w+DIBIgI358IQMgBCADQiCIfCEEIANC/////w+DIBYgH358IQMgBCADQiCIfCEEIANC/////w+DIBogG358IQMgBCADQiCIfCEEIANC/////w+DIB4gF358IQMgBCADQiCIfCEEIANC/////w+DICIgE358IQMgBCADQiCIfCEEIANC/////w+DIBUgJH58IQMgBCADQiCIfCEEIANC/////w+DIBkgIH58IQMgBCADQiCIfCEEIANC/////w+DIB0gHH58IQMgBCADQiCIfCEEIANC/////w+DICEgGH58IQMgBCADQiCIfCEEIANC/////w+DICUgFH58IQMgBCADQiCIfCEEIAIgAz4CCCAEQiCIIQMgBEL/////D4MgFiAjfnwhBCADIARCIIh8IQMgBEL/////D4MgGiAffnwhBCADIARCIIh8IQMgBEL/////D4MgHiAbfnwhBCADIARCIIh8IQMgBEL/////D4MgIiAXfnwhBCADIARCIIh8IQMgBEL/////D4MgGSAkfnwhBCADIARCIIh8IQMgBEL/////D4MgHSAgfnwhBCADIARCIIh8IQMgBEL/////D4MgISAcfnwhBCADIARCIIh8IQMgBEL/////D4MgJSAYfnwhBCADIARCIIh8IQMgAiAEPgIMIANCIIghBCADQv////8PgyAaICN+fCEDIAQgA0IgiHwhBCADQv////8PgyAeIB9+fCEDIAQgA0IgiHwhBCADQv////8PgyAiIBt+fCEDIAQgA0IgiHwhBCADQv////8PgyAdICR+fCEDIAQgA0IgiHwhBCADQv////8PgyAhICB+fCEDIAQgA0IgiHwhBCADQv////8PgyAlIBx+fCEDIAQgA0IgiHwhBCACIAM+AhAgBEIgiCEDIARC/////w+DIB4gI358IQQgAyAEQiCIfCEDIARC/////w+DICIgH358IQQgAyAEQiCIfCEDIARC/////w+DICEgJH58IQQgAyAEQiCIfCEDIARC/////w+DICUgIH58IQQgAyAEQiCIfCEDIAIgBD4CFCADQiCIIQQgA0L/////D4MgIiAjfnwhAyAEIANCIIh8IQQgA0L/////D4MgJSAkfnwhAyAEIANCIIh8IQQgAiADPgIYIARCIIghAyACIAQ+AhwgA6cEQCACQYgOIAIQBxoFIAJBiA4QBQRAIAJBiA4gAhAHGgsLC7shHQF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX4BfgF+AX5C/////w4hBkIAIQJCACEDIAJC/////w+DQgGGIQIgA0IBhiACQiCIfCEDIAJC/////w+DIAA1AgAiByAHfnwhAiADIAJCIIh8IQMgAkL/////D4MgBn5C/////w+DIQggAkL/////D4NBADUCiA4iCSAIfnwhAiADIAJCIIh8IQMgAyEEIARCIIghBUIAIQJCACEDIAJC/////w+DIAcgADUCBCIKfnwhAiADIAJCIIh8IQMgAkL/////D4NCAYYhAiADQgGGIAJCIIh8IQMgAkL/////D4MgBEL/////D4N8IQIgAyACQiCIfCAFfCEDIAJC/////w+DQQA1AowOIgwgCH58IQIgAyACQiCIfCEDIAJC/////w+DIAZ+Qv////8PgyELIAJC/////w+DIAkgC358IQIgAyACQiCIfCEDIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyAHIAA1AggiDX58IQIgAyACQiCIfCEDIAJC/////w+DQgGGIQIgA0IBhiACQiCIfCEDIAJC/////w+DIAogCn58IQIgAyACQiCIfCEDIAJC/////w+DIARC/////w+DfCECIAMgAkIgiHwgBXwhAyACQv////8PgyAMIAt+fCECIAMgAkIgiHwhAyACQv////8Pg0EANQKQDiIPIAh+fCECIAMgAkIgiHwhAyACQv////8PgyAGfkL/////D4MhDiACQv////8PgyAJIA5+fCECIAMgAkIgiHwhAyADIQQgBEIgiCEFQgAhAkIAIQMgAkL/////D4MgByAANQIMIhB+fCECIAMgAkIgiHwhAyACQv////8PgyAKIA1+fCECIAMgAkIgiHwhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgAkL/////D4MgDCAOfnwhAiADIAJCIIh8IQMgAkL/////D4MgDyALfnwhAiADIAJCIIh8IQMgAkL/////D4NBADUClA4iEiAIfnwhAiADIAJCIIh8IQMgAkL/////D4MgBn5C/////w+DIREgAkL/////D4MgCSARfnwhAiADIAJCIIh8IQMgAyEEIARCIIghBUIAIQJCACEDIAJC/////w+DIAcgADUCECITfnwhAiADIAJCIIh8IQMgAkL/////D4MgCiAQfnwhAiADIAJCIIh8IQMgAkL/////D4NCAYYhAiADQgGGIAJCIIh8IQMgAkL/////D4MgDSANfnwhAiADIAJCIIh8IQMgAkL/////D4MgBEL/////D4N8IQIgAyACQiCIfCAFfCEDIAJC/////w+DIAwgEX58IQIgAyACQiCIfCEDIAJC/////w+DIA8gDn58IQIgAyACQiCIfCEDIAJC/////w+DIBIgC358IQIgAyACQiCIfCEDIAJC/////w+DQQA1ApgOIhUgCH58IQIgAyACQiCIfCEDIAJC/////w+DIAZ+Qv////8PgyEUIAJC/////w+DIAkgFH58IQIgAyACQiCIfCEDIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyAHIAA1AhQiFn58IQIgAyACQiCIfCEDIAJC/////w+DIAogE358IQIgAyACQiCIfCEDIAJC/////w+DIA0gEH58IQIgAyACQiCIfCEDIAJC/////w+DQgGGIQIgA0IBhiACQiCIfCEDIAJC/////w+DIARC/////w+DfCECIAMgAkIgiHwgBXwhAyACQv////8PgyAMIBR+fCECIAMgAkIgiHwhAyACQv////8PgyAPIBF+fCECIAMgAkIgiHwhAyACQv////8PgyASIA5+fCECIAMgAkIgiHwhAyACQv////8PgyAVIAt+fCECIAMgAkIgiHwhAyACQv////8Pg0EANQKcDiIYIAh+fCECIAMgAkIgiHwhAyACQv////8PgyAGfkL/////D4MhFyACQv////8PgyAJIBd+fCECIAMgAkIgiHwhAyADIQQgBEIgiCEFQgAhAkIAIQMgAkL/////D4MgByAANQIYIhl+fCECIAMgAkIgiHwhAyACQv////8PgyAKIBZ+fCECIAMgAkIgiHwhAyACQv////8PgyANIBN+fCECIAMgAkIgiHwhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyAQIBB+fCECIAMgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgAkL/////D4MgDCAXfnwhAiADIAJCIIh8IQMgAkL/////D4MgDyAUfnwhAiADIAJCIIh8IQMgAkL/////D4MgEiARfnwhAiADIAJCIIh8IQMgAkL/////D4MgFSAOfnwhAiADIAJCIIh8IQMgAkL/////D4MgGCALfnwhAiADIAJCIIh8IQMgAkL/////D4NBADUCoA4iGyAIfnwhAiADIAJCIIh8IQMgAkL/////D4MgBn5C/////w+DIRogAkL/////D4MgCSAafnwhAiADIAJCIIh8IQMgAyEEIARCIIghBUIAIQJCACEDIAJC/////w+DIAcgADUCHCIcfnwhAiADIAJCIIh8IQMgAkL/////D4MgCiAZfnwhAiADIAJCIIh8IQMgAkL/////D4MgDSAWfnwhAiADIAJCIIh8IQMgAkL/////D4MgECATfnwhAiADIAJCIIh8IQMgAkL/////D4NCAYYhAiADQgGGIAJCIIh8IQMgAkL/////D4MgBEL/////D4N8IQIgAyACQiCIfCAFfCEDIAJC/////w+DIAwgGn58IQIgAyACQiCIfCEDIAJC/////w+DIA8gF358IQIgAyACQiCIfCEDIAJC/////w+DIBIgFH58IQIgAyACQiCIfCEDIAJC/////w+DIBUgEX58IQIgAyACQiCIfCEDIAJC/////w+DIBggDn58IQIgAyACQiCIfCEDIAJC/////w+DIBsgC358IQIgAyACQiCIfCEDIAJC/////w+DQQA1AqQOIh4gCH58IQIgAyACQiCIfCEDIAJC/////w+DIAZ+Qv////8PgyEdIAJC/////w+DIAkgHX58IQIgAyACQiCIfCEDIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyAKIBx+fCECIAMgAkIgiHwhAyACQv////8PgyANIBl+fCECIAMgAkIgiHwhAyACQv////8PgyAQIBZ+fCECIAMgAkIgiHwhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyATIBN+fCECIAMgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgAkL/////D4MgDCAdfnwhAiADIAJCIIh8IQMgAkL/////D4MgDyAafnwhAiADIAJCIIh8IQMgAkL/////D4MgEiAXfnwhAiADIAJCIIh8IQMgAkL/////D4MgFSAUfnwhAiADIAJCIIh8IQMgAkL/////D4MgGCARfnwhAiADIAJCIIh8IQMgAkL/////D4MgGyAOfnwhAiADIAJCIIh8IQMgAkL/////D4MgHiALfnwhAiADIAJCIIh8IQMgASACPgIAIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyANIBx+fCECIAMgAkIgiHwhAyACQv////8PgyAQIBl+fCECIAMgAkIgiHwhAyACQv////8PgyATIBZ+fCECIAMgAkIgiHwhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgAkL/////D4MgDyAdfnwhAiADIAJCIIh8IQMgAkL/////D4MgEiAafnwhAiADIAJCIIh8IQMgAkL/////D4MgFSAXfnwhAiADIAJCIIh8IQMgAkL/////D4MgGCAUfnwhAiADIAJCIIh8IQMgAkL/////D4MgGyARfnwhAiADIAJCIIh8IQMgAkL/////D4MgHiAOfnwhAiADIAJCIIh8IQMgASACPgIEIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyAQIBx+fCECIAMgAkIgiHwhAyACQv////8PgyATIBl+fCECIAMgAkIgiHwhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyAWIBZ+fCECIAMgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgAkL/////D4MgEiAdfnwhAiADIAJCIIh8IQMgAkL/////D4MgFSAafnwhAiADIAJCIIh8IQMgAkL/////D4MgGCAXfnwhAiADIAJCIIh8IQMgAkL/////D4MgGyAUfnwhAiADIAJCIIh8IQMgAkL/////D4MgHiARfnwhAiADIAJCIIh8IQMgASACPgIIIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyATIBx+fCECIAMgAkIgiHwhAyACQv////8PgyAWIBl+fCECIAMgAkIgiHwhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgAkL/////D4MgFSAdfnwhAiADIAJCIIh8IQMgAkL/////D4MgGCAafnwhAiADIAJCIIh8IQMgAkL/////D4MgGyAXfnwhAiADIAJCIIh8IQMgAkL/////D4MgHiAUfnwhAiADIAJCIIh8IQMgASACPgIMIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyAWIBx+fCECIAMgAkIgiHwhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyAZIBl+fCECIAMgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgAkL/////D4MgGCAdfnwhAiADIAJCIIh8IQMgAkL/////D4MgGyAafnwhAiADIAJCIIh8IQMgAkL/////D4MgHiAXfnwhAiADIAJCIIh8IQMgASACPgIQIAMhBCAEQiCIIQVCACECQgAhAyACQv////8PgyAZIBx+fCECIAMgAkIgiHwhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgAkL/////D4MgGyAdfnwhAiADIAJCIIh8IQMgAkL/////D4MgHiAafnwhAiADIAJCIIh8IQMgASACPgIUIAMhBCAEQiCIIQVCACECQgAhAyACQv////8Pg0IBhiECIANCAYYgAkIgiHwhAyACQv////8PgyAcIBx+fCECIAMgAkIgiHwhAyACQv////8PgyAEQv////8Pg3whAiADIAJCIIh8IAV8IQMgAkL/////D4MgHiAdfnwhAiADIAJCIIh8IQMgASACPgIYIAMhBCAEQiCIIQUgASAEPgIcIAWnBEAgAUGIDiABEAcaBSABQYgOEAUEQCABQYgOIAEQBxoLCwsKACAAIAAgARAkCwsAIABByA4gARAkCxUAIABB6BQQAEGIFRABQegUIAEQIwsSACAAQagVEChBqBUoAgBBAXELFwAgACABECggAUGIDiABEA4gASABECcLCQBB6A4gABAAC8sBBAF/AX8BfwF/IAIQAUEgIQUgACEDAkADQCAFIAFLDQEgBUEgRgRAQcgVECsFQcgVQcgOQcgVECQLIANByBVB6BUQJCACQegVIAIQICADQSBqIQMgBUEgaiEFDAALCyABQSBwIQQgBEUEQA8LQegVEAFBACEGAkADQCAGIARGDQEgBiADLQAAOgDoFSADQQFqIQMgBkEBaiEGDAALCyAFQSBGBEBByBUQKwVByBVByA5ByBUQJAtB6BVByBVB6BUQJCACQegVIAIQIAscACABIAJBiBYQLEGIFkGIFhAnIABBiBYgAxAkC6cCAgF/AX8gAEGoFhAAIAMQKyACIQQCQANAIARBAWshBCABIARqLQAAIQUgAyADECUgBUGAAU8EQCAFQYABayEFQagWIAMgAxAkCyADIAMQJSAFQcAATwRAIAVBwABrIQVBqBYgAyADECQLIAMgAxAlIAVBIE8EQCAFQSBrIQVBqBYgAyADECQLIAMgAxAlIAVBEE8EQCAFQRBrIQVBqBYgAyADECQLIAMgAxAlIAVBCE8EQCAFQQhrIQVBqBYgAyADECQLIAMgAxAlIAVBBE8EQCAFQQRrIQVBqBYgAyADECQLIAMgAxAlIAVBAk8EQCAFQQJrIQVBqBYgAyADECQLIAMgAxAlIAVBAU8EQCAFQQFrIQVBqBYgAyADECQLIARFDQEMAAsLC94BAwF/AX8BfyAAEAIEQCABEAEPC0EcIQJBqBBByBYQACAAQYgQQSBB6BYQLiAAQcgQQSBBiBcQLgJAA0BB6BZB6A4QBA0BQegWQagXECVBASEDAkADQEGoF0HoDhAEDQFBqBdBqBcQJSADQQFqIQMMAAsLQcgWQcgXEAAgAiADa0EBayEEAkADQCAERQ0BQcgXQcgXECUgBEEBayEEDAALCyADIQJByBdByBYQJUHoFkHIFkHoFhAkQYgXQcgXQYgXECQMAAsLQYgXECkEQEGIFyABECIFQYgXIAEQAAsLIAAgABACBEBBAQ8LIABBqA9BIEHoFxAuQegXQegOEAQLFQAgACABQYgYECRBiBhByA4gAhAkCwoAIAAgACABEDELCwAgAEGIDiABEA4LCQAgAEHIDxAFCwoAIABBwABqEAILFQAgABABIABBIGoQGiAAQcAAahABCyIAIAAgARAAIABBIGogAUEgahAAIABBwABqIAFBwABqEAALmAECAX8BfyAAQcAAaiECIAFBwABqIQMgABA1BEAgARA1DwsgARA1BEBBAA8LIAJBqBgQFCADQcgYEBQgAEHIGEHoGBATIAFBqBhBiBkQEyACQagYQagZEBMgA0HIGEHIGRATIABBIGpByBlB6BkQEyABQSBqQagZQYgaEBNB6BhBiBkQBARAQegZQYgaEAQEQEEBDwsLQQAPC/YBACAAEDUEQCAAIAEQNw8LIABBqBoQFCAAQSBqQcgaEBRByBpB6BoQFCAAQcgaQYgbEA9BiBtBiBsQFEGIG0GoGkGIGxAQQYgbQegaQYgbEBBBiBtBiBtBiBsQD0GoGkGoGkGoGxAPQagbQagaQagbEA9BqBtByBsQFCAAQSBqIABBwABqQegbEBNBiBtBiBsgARAPQcgbIAEgARAQQegaQegaQYgcEA9BiBxBiBxBiBwQD0GIHEGIHEGIHBAPQYgbIAEgAUEgahAQIAFBIGpBqBsgAUEgahATIAFBIGpBiBwgAUEgahAQQegbQegbIAFBwABqEA8LnAMCAX8BfyAAQcAAaiEDIAFBwABqIQQgABA1BEAgASACEDcPCyABEDUEQCAAIAIQNw8LIANBqBwQFCAEQcgcEBQgAEHIHEHoHBATIAFBqBxBiB0QEyADQagcQagdEBMgBEHIHEHIHRATIABBIGpByB1B6B0QEyABQSBqQagdQYgeEBNB6BxBiB0QBARAQegdQYgeEAQEQCAAIAIQOQ8LC0GIHUHoHEGoHhAQQYgeQegdQcgeEBBBqB5BqB5B6B4QD0HoHkHoHhAUQageQegeQYgfEBNByB5ByB5BqB8QD0HoHEHoHkHoHxATQagfQcgfEBRB6B9B6B9BiCAQD0HIH0GIHyACEBAgAkGIICACEBBB6B1BiB9BqCAQE0GoIEGoIEGoIBAPQegfIAIgAkEgahAQIAJBIGpBqB8gAkEgahATIAJBIGpBqCAgAkEgahAQIAMgBCACQcAAahAPIAJBwABqIAJBwABqEBQgAkHAAGpBqBwgAkHAAGoQECACQcAAakHIHCACQcAAahAQIAJBwABqQageIAJBwABqEBMLIgAgACABEAAgAEEgaiABQSBqEBEgAEHAAGogAUHAAGoQAAsSACABQcggEDsgAEHIICACEDoLIgAgACABEBcgAEEgaiABQSBqEBcgAEHAAGogAUHAAGoQFwsiACAAIAEQFiAAQSBqIAFBIGoQFiAAQcAAaiABQcAAahAWC0wAIAAQNQRAIAEQNgUgAEHAAGpBqCEQGUGoIUHIIRAUQaghQcghQeghEBMgAEHIISABEBMgAEEgakHoISABQSBqEBMgAUHAAGoQGgsLpwICAX8BfyAAQYgiEDcgAxA2IAIhBAJAA0AgBEEBayEEIAEgBGotAAAhBSADIAMQOSAFQYABTwRAIAVBgAFrIQVBiCIgAyADEDoLIAMgAxA5IAVBwABPBEAgBUHAAGshBUGIIiADIAMQOgsgAyADEDkgBUEgTwRAIAVBIGshBUGIIiADIAMQOgsgAyADEDkgBUEQTwRAIAVBEGshBUGIIiADIAMQOgsgAyADEDkgBUEITwRAIAVBCGshBUGIIiADIAMQOgsgAyADEDkgBUEETwRAIAVBBGshBUGIIiADIAMQOgsgAyADEDkgBUECTwRAIAVBAmshBUGIIiADIAMQOgsgAyADEDkgBUEBTwRAIAVBAWshBUGIIiADIAMQOgsgBEUNAQwACwsLKwIBfwF/IABBBXZBAnQhAUEBIABBH3F0IQIgASABKALo4gEgAnI2AujiAQskAgF/AX8gAEEFdkECdCEBQQEgAEEfcXQhAiABKALo4gEgAnELoAEEAX8BfwF/AX8gACECQegiEDZBACEEAkADQCAEIAFGDQFB6CJBASAEdEHgAGxqIQMgAhACIQUgAiADEAAgAkEgaiECIANBIGohAyACIAMQACACQSBqIQIgA0EgaiEDIAUEQCADEAEFIAMQGgsgBEEBaiEEDAALC0Ho4gFCl4KEgBA3AwBB8OIBQgE3AwBB+OIBQgE3AwBBgOMBQgA3AwALQAMBfwF/AX9B6CIgAEHgAGxqIQEgABBCRQRAIAAtAIjjARBEIQIgAC0AiOUBEEQhAyACIAMgARA6IAAQQQsgAQulAQQBfwF/AX4BfkEAIQMCQANAIANBIEYNAUIAIQZBACEEAkADQCAEIAFGDQEgACAEQSBsIANqajEAACEFIAUgBUIchoRCj4CAgPABgyEFIAUgBUIOhoRCg4CMgLCAwAGDIQUgBSAFQgeGhEKBgoSIkKDAgAGDIQUgBiAFIASthoQhBiAEQQFqIQQMAAsLIAIgA0EIbGogBjcDACADQQFqIQMMAAsLC0sBAX8gACACQYjnARBFIAMQNiABIAIQQ0EAIQQCQANAIARBgAJGDQEgAyADEDkgA0GH6QEgBGstAAAQRCADEDogBEEBaiEEDAALCwt+BAF/AX8BfwF/IAAhBSABIQYgBSACIANuIANsQSBsaiEIAkADQCAFIAhGDQEgBSAGIANBiOkBEEZBiOkBIAQgBBA6IAVBICADbGohBSAGQcAAIANsaiEGDAALCyACIANwIQcgBwRAIAUgBiAHQYjpARBGQYjpASAEIAQQOgsLTgIBfwF/IAAgAkHo6QEQRSABIAIQQ0EAIQQCQANAIARBgAJGDQEgAyAEQeAAbGohBSAFQefrASAEay0AABBEIAUQOiAEQQFqIQQMAAsLCykBAX9BACECAkADQCACIAFGDQEgACACQeAAbGoQNiACQQFqIQIMAAsLC0gCAX8BfyAAIQQgBCACEDcgBEHgAGohBEEBIQMCQANAIAMgAUYNASACIAIQOSAEIAIgAhA6IARB4ABqIQQgA0EBaiEDDAALCwuKAQQBfwF/AX8Bf0Ho6wFBgAIQSSAAIQUgASEGIAUgAiADbiADbEEgbGohCAJAA0AgBSAIRg0BIAUgBiADQejrARBIIAVBICADbGohBSAGQcAAIANsaiEGDAALCyACIANwIQcgBwRAIAUgBiAHQejrARBIC0Ho6wFBgAJB6KsDEEpB6KsDIAQgBBA6C0YAIABB/wFxLQCIuwNBGHQgAEEIdkH/AXEtAIi7A0EQdGogAEEQdkH/AXEtAIi7A0EIdCAAQRh2Qf8BcS0AiLsDamogAXcLZwUBfwF/AX8BfwF/QQEgAXQhAkEAIQMCQANAIAMgAkYNASAAIANBIGxqIQUgAyABEEwhBCAAIARBIGxqIQYgAyAESQRAIAVBiL0DEAAgBiAFEABBiL0DIAYQAAsgA0EBaiEDDAALCwvvAQkBfwF/AX8BfwF/AX8BfwF/AX8gACABEE1BASABdCEIQQEhAwJAA0AgAyABSw0BQQEgA3QhBkHIrAMgA0EgbGohCUEAIQQCQANAIAQgCE8NASACBEAgCUEgakGovQMQAAVBqL0DECsLIAZBAXYhB0EAIQUCQANAIAUgB08NASAAIAQgBWpBIGxqIQogCiAHQSBsaiELQai9AyALQci9AxAkIApB6L0DEABB6L0DQci9AyAKECBB6L0DQci9AyALECFBqL0DIAlBqL0DECQgBUEBaiEFDAALCyAEIAZqIQQMAAsLIANBAWohAwwACwsLPgMBfwF/AX8gACEDIAEhBCAAIAJBIGxqIQUCQANAIAMgBUYNASADIAQQACADQSBqIQMgBEHAAGohBAwACwsLPQMBfwF/AX8gACEDIAEhBCAAIAJBIGxqIQUCQANAIAMgBUYNASADIAQQKCADQSBqIQMgBEEgaiEEDAALCws9AwF/AX8BfyAAIQMgASEEIAAgAkEgbGohBQJAA0AgAyAFRg0BIAMgBBAnIANBIGohAyAEQSBqIQQMAAsLC5YBBwF/AX8BfwF/AX8BfwF/QQEgAXQhAkHoswMgAUEgbGohBCACQQFrIQZBASEFIAJBAXYhAwJAA0AgBSADRg0BIAAgBUEgbGohByAAIAIgBWtBIGxqIQggB0GIvgMQACAIIAQgBxAkQYi+AyAEIAgQJCAFQQFqIQUMAAsLIAAgBCAAECQgACADQSBsaiEIIAggBCAIECQLQwIBfwF/IABBAXYhAkEAIQECQANAIAJFDQEgAkEBdiECIAFBAWohAQwACwsgAEEBIAF0RwRAAAsgAUEcSwRAAAsgAQsSAQF/IAEQUyEDIAAgAyACEE4LGAEBfyABEFMhAyAAIAMgAhBOIAAgAxBSC0wEAX8BfwF/AX8gACEEIAEhBSADIQYgACACQSBsaiEHAkADQCAEIAdGDQEgBCAFIAYQJCAEQSBqIQQgBUEgaiEFIAZBIGohBgwACwsLLgIBfwF/IAAhAyAAIAFBIGxqIQICQANAIAMgAkYNASADEAEgA0EgaiEDDAALCwuOAQYBfwF/AX8BfwF/AX9BACEEIAAhBiABIQcCQANAIAQgAkYNASAGKAIAIQkgBkEEaiEGQQAhBQJAA0AgBSAJRg0BIAMgBigCAEEgbGohCCAGQQRqIQYgByAGQai+AxAkQai+AyAIIAgQICAGQSBqIQYgBUEBaiEFDAALCyAHQSBqIQcgBEEBaiEEDAALCwsOACAAEAIgAEEgahACcQsNACAAEAEgAEEgahABCw0AIAAQGiAAQSBqEAELFAAgACABEAAgAEEgaiABQSBqEAALdQAgACABQci+AxATIABBIGogAUEgakHovgMQEyAAIABBIGpBiL8DEA8gASABQSBqQai/AxAPQYi/A0GovwNBiL8DEBNB6L4DIAIQEUHIvgMgAiACEA9ByL4DQei+AyACQSBqEA9BiL8DIAJBIGogAkEgahAQCxgAIAAgASACEBMgAEEgaiABIAJBIGoQEwtwACAAIABBIGpByL8DEBMgACAAQSBqQei/AxAPIABBIGpBiMADEBEgAEGIwANBiMADEA9ByL8DQajAAxARQajAA0HIvwNBqMADEA9B6L8DQYjAAyABEBMgAUGowAMgARAQQci/A0HIvwMgAUEgahAPCxsAIAAgASACEA8gAEEgaiABQSBqIAJBIGoQDwsbACAAIAEgAhAQIABBIGogAUEgaiACQSBqEBALFAAgACABEBEgAEEgaiABQSBqEBELFAAgACABEAAgAEEgaiABQSBqEBELFAAgACABEBYgAEEgaiABQSBqEBYLFAAgACABEBcgAEEgaiABQSBqEBcLFQAgACABEAQgAEEgaiABQSBqEARxC10AIABByMADEBQgAEEgakHowAMQFEHowANBiMEDEBFByMADQYjBA0GIwQMQEEGIwQNBqMEDEBkgAEGowQMgARATIABBIGpBqMEDIAFBIGoQEyABQSBqIAFBIGoQEQscACAAIAEgAiADEBwgAEEgaiABIAIgA0EgahAcC7ACAgF/AX8gAEHIwQMQXCADEFsgAiEEAkADQCAEQQFrIQQgASAEai0AACEFIAMgAxBfIAVBgAFPBEAgBUGAAWshBUHIwQMgAyADEF0LIAMgAxBfIAVBwABPBEAgBUHAAGshBUHIwQMgAyADEF0LIAMgAxBfIAVBIE8EQCAFQSBrIQVByMEDIAMgAxBdCyADIAMQXyAFQRBPBEAgBUEQayEFQcjBAyADIAMQXQsgAyADEF8gBUEITwRAIAVBCGshBUHIwQMgAyADEF0LIAMgAxBfIAVBBE8EQCAFQQRrIQVByMEDIAMgAxBdCyADIAMQXyAFQQJPBEAgBUECayEFQcjBAyADIAMQXQsgAyADEF8gBUEBTwRAIAVBAWshBUHIwQMgAyADEF0LIARFDQEMAAsLCwoAIABBgAFqEFkLFgAgABBaIABBwABqEFsgAEGAAWoQWgskACAAIAEQXCAAQcAAaiABQcAAahBcIABBgAFqIAFBgAFqEFwLrAECAX8BfyAAQYABaiECIAFBgAFqIQMgABBqBEAgARBqDwsgARBqBEBBAA8LIAJBiMIDEF8gA0HIwgMQXyAAQcjCA0GIwwMQXSABQYjCA0HIwwMQXSACQYjCA0GIxAMQXSADQcjCA0HIxAMQXSAAQcAAakHIxANBiMUDEF0gAUHAAGpBiMQDQcjFAxBdQYjDA0HIwwMQZgRAQYjFA0HIxQMQZgRAQQEPCwtBAA8LqAIAIAAQagRAIAAgARBsDwsgAEGIxgMQXyAAQcAAakHIxgMQX0HIxgNBiMcDEF8gAEHIxgNByMcDEGBByMcDQcjHAxBfQcjHA0GIxgNByMcDEGFByMcDQYjHA0HIxwMQYUHIxwNByMcDQcjHAxBgQYjGA0GIxgNBiMgDEGBBiMgDQYjGA0GIyAMQYEGIyANByMgDEF8gAEHAAGogAEGAAWpBiMkDEF1ByMcDQcjHAyABEGBByMgDIAEgARBhQYjHA0GIxwNByMkDEGBByMkDQcjJA0HIyQMQYEHIyQNByMkDQcjJAxBgQcjHAyABIAFBwABqEGEgAUHAAGpBiMgDIAFBwABqEF0gAUHAAGpByMkDIAFBwABqEGFBiMkDQYjJAyABQYABahBgC90DAgF/AX8gAEGAAWohAyABQYABaiEEIAAQagRAIAEgAhBsDwsgARBqBEAgACACEGwPCyADQYjKAxBfIARByMoDEF8gAEHIygNBiMsDEF0gAUGIygNByMsDEF0gA0GIygNBiMwDEF0gBEHIygNByMwDEF0gAEHAAGpByMwDQYjNAxBdIAFBwABqQYjMA0HIzQMQXUGIywNByMsDEGYEQEGIzQNByM0DEGYEQCAAIAIQbg8LC0HIywNBiMsDQYjOAxBhQcjNA0GIzQNByM4DEGFBiM4DQYjOA0GIzwMQYEGIzwNBiM8DEF9BiM4DQYjPA0HIzwMQXUHIzgNByM4DQYjQAxBgQYjLA0GIzwNBiNEDEF1BiNADQcjQAxBfQYjRA0GI0QNByNEDEGBByNADQcjPAyACEGEgAkHI0QMgAhBhQYjNA0HIzwNBiNIDEF1BiNIDQYjSA0GI0gMQYEGI0QMgAiACQcAAahBhIAJBwABqQYjQAyACQcAAahBdIAJBwABqQYjSAyACQcAAahBhIAMgBCACQYABahBgIAJBgAFqIAJBgAFqEF8gAkGAAWpBiMoDIAJBgAFqEGEgAkGAAWpByMoDIAJBgAFqEGEgAkGAAWpBiM4DIAJBgAFqEF0LJAAgACABEFwgAEHAAGogAUHAAGoQYiAAQYABaiABQYABahBcCxQAIAFByNIDEHAgAEHI0gMgAhBvCyQAIAAgARBlIABBwABqIAFBwABqEGUgAEGAAWogAUGAAWoQZQskACAAIAEQZCAAQcAAaiABQcAAahBkIABBgAFqIAFBgAFqEGQLVgAgABBqBEAgARBrBSAAQYABakGI1AMQZ0GI1ANByNQDEF9BiNQDQcjUA0GI1QMQXSAAQcjUAyABEF0gAEHAAGpBiNUDIAFBwABqEF0gAUGAAWoQWwsLsAICAX8BfyAAQcjVAxBsIAMQayACIQQCQANAIARBAWshBCABIARqLQAAIQUgAyADEG4gBUGAAU8EQCAFQYABayEFQcjVAyADIAMQbwsgAyADEG4gBUHAAE8EQCAFQcAAayEFQcjVAyADIAMQbwsgAyADEG4gBUEgTwRAIAVBIGshBUHI1QMgAyADEG8LIAMgAxBuIAVBEE8EQCAFQRBrIQVByNUDIAMgAxBvCyADIAMQbiAFQQhPBEAgBUEIayEFQcjVAyADIAMQbwsgAyADEG4gBUEETwRAIAVBBGshBUHI1QMgAyADEG8LIAMgAxBuIAVBAk8EQCAFQQJrIQVByNUDIAMgAxBvCyADIAMQbiAFQQFPBEAgBUEBayEFQcjVAyADIAMQbwsgBEUNAQwACwsLKwIBfwF/IABBBXZBAnQhAUEBIABBH3F0IQIgASABKAKI1wYgAnI2AojXBgskAgF/AX8gAEEFdkECdCEBQQEgAEEfcXQhAiABKAKI1wYgAnELpgEEAX8BfwF/AX8gACECQYjXAxBrQQAhBAJAA0AgBCABRg0BQYjXA0EBIAR0QcABbGohAyACEFkhBSACIAMQXCACQcAAaiECIANBwABqIQMgAiADEFwgAkHAAGohAiADQcAAaiEDIAUEQCADEFoFIAMQWwsgBEEBaiEEDAALC0GI1wZCl4KEgBA3AwBBkNcGQgE3AwBBmNcGQgE3AwBBoNcGQgA3AwALQQMBfwF/AX9BiNcDIABBwAFsaiEBIAAQd0UEQCAALQCo1wYQeSECIAAtAKjZBhB5IQMgAiADIAEQbyAAEHYLIAELpQEEAX8BfwF+AX5BACEDAkADQCADQSBGDQFCACEGQQAhBAJAA0AgBCABRg0BIAAgBEEgbCADamoxAAAhBSAFIAVCHIaEQo+AgIDwAYMhBSAFIAVCDoaEQoOAjICwgMABgyEFIAUgBUIHhoRCgYKEiJCgwIABgyEFIAYgBSAErYaEIQYgBEEBaiEEDAALCyACIANBCGxqIAY3AwAgA0EBaiEDDAALCwtLAQF/IAAgAkGo2wYQeiADEGsgASACEHhBACEEAkADQCAEQYACRg0BIAMgAxBuIANBp90GIARrLQAAEHkgAxBvIARBAWohBAwACwsLfgQBfwF/AX8BfyAAIQUgASEGIAUgAiADbiADbEEgbGohCAJAA0AgBSAIRg0BIAUgBiADQajdBhB7QajdBiAEIAQQbyAFQSAgA2xqIQUgBkGAASADbGohBgwACwsgAiADcCEHIAcEQCAFIAYgB0Go3QYQe0Go3QYgBCAEEG8LC04CAX8BfyAAIAJB6N4GEHogASACEHhBACEEAkADQCAEQYACRg0BIAMgBEHAAWxqIQUgBUHn4AYgBGstAAAQeSAFEG8gBEEBaiEEDAALCwspAQF/QQAhAgJAA0AgAiABRg0BIAAgAkHAAWxqEGsgAkEBaiECDAALCwtIAgF/AX8gACEEIAQgAhBsIARBwAFqIQRBASEDAkADQCADIAFGDQEgAiACEG4gBCACIAIQbyAEQcABaiEEIANBAWohAwwACwsLigEEAX8BfwF/AX9B6OAGQYACEH4gACEFIAEhBiAFIAIgA24gA2xBIGxqIQgCQANAIAUgCEYNASAFIAYgA0Ho4AYQfSAFQSAgA2xqIQUgBkGAASADbGohBgwACwsgAiADcCEHIAcEQCAFIAYgB0Ho4AYQfQtB6OAGQYACQejgCRB/QejgCSAEIAQQbwsMAEHo6QkgACABEF0LGAAgABBZIABBwABqEFlxIABBgAFqEFlxCxYAIAAQWiAAQcAAahBaIABBgAFqEFoLFgAgABBbIABBwABqEFogAEGAAWoQWgskACAAIAEQXCAAQcAAaiABQcAAahBcIABBgAFqIAFBgAFqEFwL0AIAIAAgAUGo6wkQXSAAQcAAaiABQcAAakHo6wkQXSAAQYABaiABQYABakGo7AkQXSAAIABBwABqQejsCRBgIAEgAUHAAGpBqO0JEGAgACAAQYABakHo7QkQYCABIAFBgAFqQajuCRBgIABBwABqIABBgAFqQejuCRBgIAFBwABqIAFBgAFqQajvCRBgQajrCUHo6wlB6O8JEGBBqOsJQajsCUGo8AkQYEHo6wlBqOwJQejwCRBgQejuCUGo7wkgAhBdIAJB6PAJIAIQYSACIAIQgQFBqOsJIAIgAhBgQejsCUGo7QkgAkHAAGoQXSACQcAAakHo7wkgAkHAAGoQYUGo7AlBqPEJEIEBIAJBwABqQajxCSACQcAAahBgQejtCUGo7gkgAkGAAWoQXSACQYABakGo8AkgAkGAAWoQYSACQYABakHo6wkgAkGAAWoQYAvyAQAgAEHo8QkQXyAAIABBwABqQajyCRBdQajyCUGo8glB6PIJEGAgACAAQcAAakGo8wkQYUGo8wkgAEGAAWpBqPMJEGBBqPMJQajzCRBfIABBwABqIABBgAFqQejzCRBdQejzCUHo8wlBqPQJEGAgAEGAAWpB6PQJEF9BqPQJIAEQgQFB6PEJIAEgARBgQej0CSABQcAAahCBAUHo8gkgAUHAAGogAUHAAGoQYEHo8QlB6PQJIAFBgAFqEGBBqPQJIAFBgAFqIAFBgAFqEGFBqPMJIAFBgAFqIAFBgAFqEGBB6PIJIAFBgAFqIAFBgAFqEGALMgAgACABIAIQYCAAQcAAaiABQcAAaiACQcAAahBgIABBgAFqIAFBgAFqIAJBgAFqEGALMgAgACABIAIQYSAAQcAAaiABQcAAaiACQcAAahBhIABBgAFqIAFBgAFqIAJBgAFqEGELJAAgACABEGIgAEHAAGogAUHAAGoQYiAAQYABaiABQYABahBiCyQAIAAgARBkIABBwABqIAFBwABqEGQgAEGAAWogAUGAAWoQZAskACAAIAEQZSAAQcAAaiABQcAAahBlIABBgAFqIAFBgAFqEGULJgAgACABEGYgAEHAAGogAUHAAGoQZnEgAEGAAWogAUGAAWoQZnELmQIAIABBqPUJEF8gAEHAAGpB6PUJEF8gAEGAAWpBqPYJEF8gACAAQcAAakHo9gkQXSAAIABBgAFqQaj3CRBdIABBwABqIABBgAFqQej3CRBdQej3CUGo+AkQgQFBqPUJQaj4CUGo+AkQYUGo9glB6PgJEIEBQej4CUHo9glB6PgJEGFB6PUJQaj3CUGo+QkQYSAAQYABakHo+AlB6PkJEF0gAEHAAGpBqPkJQaj6CRBdQej5CUGo+glB6PkJEGBB6PkJQej5CRCBASAAQaj4CUGo+gkQXUGo+glB6PkJQej5CRBgQej5CUHo+QkQZ0Ho+QlBqPgJIAEQXUHo+QlB6PgJIAFBwABqEF1B6PkJQaj5CSABQYABahBdCzAAIAAgASACIAMQaCAAQcAAaiABIAIgA0HAAGoQaCAAQYABaiABIAIgA0GAAWoQaAvCAgIBfwF/IABB6PoJEIUBIAMQhAEgAiEEAkADQCAEQQFrIQQgASAEai0AACEFIAMgAxCHASAFQYABTwRAIAVBgAFrIQVB6PoJIAMgAxCGAQsgAyADEIcBIAVBwABPBEAgBUHAAGshBUHo+gkgAyADEIYBCyADIAMQhwEgBUEgTwRAIAVBIGshBUHo+gkgAyADEIYBCyADIAMQhwEgBUEQTwRAIAVBEGshBUHo+gkgAyADEIYBCyADIAMQhwEgBUEITwRAIAVBCGshBUHo+gkgAyADEIYBCyADIAMQhwEgBUEETwRAIAVBBGshBUHo+gkgAyADEIYBCyADIAMQhwEgBUECTwRAIAVBAmshBUHo+gkgAyADEIYBCyADIAMQhwEgBUEBTwRAIAVBAWshBUHo+gkgAyADEIYBCyAERQ0BDAALCwsoAEHo6QkgAEGAAWogARBdIAAgAUHAAGoQXCAAQcAAaiABQYABahBcCxEAIAAQggEgAEHAAWoQggFxCxAAIAAQgwEgAEHAAWoQgwELEAAgABCEASAAQcABahCDAQsYACAAIAEQhQEgAEHAAWogAUHAAWoQhQELhQEAIAAgAUGo/AkQhgEgAEHAAWogAUHAAWpB6P0JEIYBIAAgAEHAAWpBqP8JEIgBIAEgAUHAAWpB6IAKEIgBQaj/CUHogApBqP8JEIYBQej9CSACEJEBQaj8CSACIAIQiAFBqPwJQej9CSACQcABahCIAUGo/wkgAkHAAWogAkHAAWoQiQELHAAgACABIAIQhgEgAEHAAWogASACQcABahCGAQt9ACAAIABBwAFqQaiCChCGASAAIABBwAFqQeiDChCIASAAQcABakGohQoQkQEgAEGohQpBqIUKEIgBQaiCCkHohgoQkQFB6IYKQaiCCkHohgoQiAFB6IMKQaiFCiABEIYBIAFB6IYKIAEQiQFBqIIKQaiCCiABQcABahCIAQsgACAAIAEgAhCIASAAQcABaiABQcABaiACQcABahCIAQsgACAAIAEgAhCJASAAQcABaiABQcABaiACQcABahCJAQsYACAAIAEQigEgAEHAAWogAUHAAWoQigELGAAgACABEIUBIABBwAFqIAFBwAFqEIoBCxgAIAAgARCLASAAQcABaiABQcABahCLAQsYACAAIAEQjAEgAEHAAWogAUHAAWoQjAELGQAgACABEI0BIABBwAFqIAFBwAFqEI0BcQtqACAAQaiIChCHASAAQcABakHoiQoQhwFB6IkKQaiLChCRAUGoiApBqIsKQaiLChCJAUGoiwpB6IwKEI4BIABB6IwKIAEQhgEgAEHAAWpB6IwKIAFBwAFqEIYBIAFBwAFqIAFBwAFqEIoBCyAAIAAgASACIAMQjwEgAEHAAWogASACIANBwAFqEI8BC8ICAgF/AX8gAEGojgoQlQEgAxCUASACIQQCQANAIARBAWshBCABIARqLQAAIQUgAyADEJgBIAVBgAFPBEAgBUGAAWshBUGojgogAyADEJYBCyADIAMQmAEgBUHAAE8EQCAFQcAAayEFQaiOCiADIAMQlgELIAMgAxCYASAFQSBPBEAgBUEgayEFQaiOCiADIAMQlgELIAMgAxCYASAFQRBPBEAgBUEQayEFQaiOCiADIAMQlgELIAMgAxCYASAFQQhPBEAgBUEIayEFQaiOCiADIAMQlgELIAMgAxCYASAFQQRPBEAgBUEEayEFQaiOCiADIAMQlgELIAMgAxCYASAFQQJPBEAgBUECayEFQaiOCiADIAMQlgELIAMgAxCYASAFQQFPBEAgBUEBayEFQaiOCiADIAMQlgELIARFDQEMAAsLC8wCACAAIAFBgAFqIAJBwABqEF0gASACQcAAaiACQcAAahBhIABBwABqIAFBgAFqQfCtCxBdIAFBwABqQfCtC0HwrQsQYSACQcAAakGwrgsQX0HwrQtB8K4LEF8gAkHAAGpBsK4LQbCvCxBdIAFBsK4LQfCvCxBdQfCvC0HwrwtB8LALEGAgAUGAAWpB8K4LQbCwCxBdQbCvC0GwsAtBsLALEGBBsLALQfCwC0GwsAsQYSACQcAAakGwsAsgARBdQbCvCyABQcAAaiABQcAAahBdQfCvC0GwsAtB8LALEGFB8K0LQfCwC0HwsAsQXUHwsAsgAUHAAGogAUHAAGoQYSABQYABakGwrwsgAUGAAWoQXSACQcAAaiAAQcAAakHwsAsQXUHwrQsgACACEF0gAkHwsAsgAhBhIAJB6OkJIAIQXUHwrQsgAkGAAWoQYguOAwAgAEHAAGpBqOoJQbCxCxBdIABBsLELQbCxCxBdIABBwABqQfCxCxBfIABBgAFqQbCyCxBfQbCyC0GwsgtB8LILEGBB8LILQbCyC0HwsgsQYEHo6glB8LILQbCzCxBdQbCzC0GwswtB8LMLEGBBsLMLQfCzC0HwswsQYEHwsQtB8LMLQbC0CxBgQbC0C0Go6glBsLQLEF1B8LELQbCyC0HwtgsQYCAAQcAAaiAAQYABakHwtAsQYEHwtAtB8LQLEF9B8LQLQfC2C0HwtAsQYUGwswtB8LELQbC1CxBhIABB8LULEF9BsLMLQbC2CxBfQfCxC0HwswtB8LYLEGFBsLELQfC2CyAAEF1BsLYLQbC2C0HwtgsQYEGwtgtB8LYLQfC2CxBgQbC0CyAAQcAAahBfIABBwABqQfC2CyAAQcAAahBhQfCxC0HwtAsgAEGAAWoQXUHo6QlBsLULIAEQXUHwtAsgAUHAAGoQYkHwtQtB8LULIAFBgAFqEGBB8LULIAFBgAFqIAFBgAFqEGALCAAgACABED8LQAAgACABEGNBsLcLIAEgARBdIABBwABqIAFBwABqEGNB8LcLIAFBwABqIAFBwABqEF0gAEGAAWogAUGAAWoQYwvIAQIBfwF/IAAgAUEAahB0IAFBAGpBsLgLEFwgAUHAAGpB8LgLEFxBsLkLEFsgAUHAAWohAkE/IQMCQANAQbC4CyACEKQBIAJBwAFqIQIgAywAqJEKBEAgAUEAakGwuAsgAhCjASACQcABaiECCyADRQ0BIANBAWshAwwACwsgAUEAakHwuQsQpgFB8LkLQbC7CxCmAUHwuwtB8LsLEGJB8LkLQbC4CyACEKMBIAJBwAFqIQJBsLsLQbC4CyACEKMBIAJBwAFqIQILggUAIAMgAEHwvwsQXSADQYABaiACQbDACxBdIANBgAJqIAFB8MALEF0gAyADQYACakHwvQsQYCADIANBgAFqQbC9CxBgIANBwABqIANBwAFqQbC+CxBgQbC+CyADQcACakGwvgsQYCADQcAAaiACQbDBCxBdQbDBC0HwwAtB8L4LEGBB6OkJQfC+C0GwvwsQXUGwvwtB8L8LIAMQYCADQcACaiABQfC+CxBdQbDBC0HwvgtBsMELEGBB8L4LQbDAC0HwvgsQYEHo6QlB8L4LQbC/CxBdIANBwABqIABB8L4LEF1BsMELQfC+C0GwwQsQYEGwvwtB8L4LIANBwABqEGAgACACQfC8CxBgQbC9C0HwvAtB8L4LEF1B8L8LQbDAC0HwwQsQYEHwvgtB8MELQfC+CxBhIANBwAFqIAFBsL8LEF1BsMELQbC/C0GwwQsQYCADQYABaiADQYACakHwvAsQYEHwvgtBsL8LIANBgAFqEGAgAiABQbC9CxBgQbC9C0HwvAtB8L4LEF1BsMALQfDAC0HwwQsQYEHwvgtB8MELQfC+CxBhQejpCUHwvgtBsL8LEF0gA0HAAWogAEHwvgsQXUGwwQtB8L4LQbDBCxBgQbC/C0HwvgsgA0HAAWoQYCADQcACaiACQfC+CxBdQbDBC0HwvgtBsMELEGBB6OkJQfC+C0GwvwsQXSAAIAFB8LwLEGBB8L0LQfC8C0HwvgsQXUHwvwtB8MALQfDBCxBgQfC+C0HwwQtB8L4LEGFBsL8LQfC+CyADQYACahBgIAAgAkHwvAsQYEHwvAsgAUHwvAsQYEGwvgtB8LwLQfC+CxBdQfC+C0GwwQsgA0HAAmoQYQs3ACAAQbDCCxBcQfDCCxBaIAJBsMMLEFxB8MMLEFogAUGwxAsQXEHwxAsQWkGwwgsgAyADEJYBC5QCAgF/AX8gAhCUASABQcABaiEDQT8hBAJAA0AgAiACEJgBIANBwABqIABBIGpBsMULEF4gA0GAAWogAEHwxQsQXiADQbDFC0HwxQsgAhCoASADQcABaiEDIAQsAKiRCgRAIANBwABqIABBIGpBsMULEF4gA0GAAWogAEHwxQsQXiADQbDFC0HwxQsgAhCoASADQcABaiEDCyAERQ0BIARBAWshBAwACwsgA0HAAGogAEEgakGwxQsQXiADQYABaiAAQfDFCxBeIANBsMULQfDFCyACEKgBIANBwAFqIQMgA0HAAGogAEEgakGwxQsQXiADQYABaiAAQfDFCxBeIANBsMULQfDFCyACEKgBIANBwAFqIQMLZgAgAEGwxgsgARBdIABBwABqQfDGCyABQcAAahBdIABBgAFqQbDHCyABQYABahBdIABBwAFqQfDHCyABQcABahBdIABBgAJqQbDICyABQYACahBdIABBwAJqQfDICyABQcACahBdC4QCACAAIAEQACAAQSBqIAFBIGoQESABQbDJCyABEF0gAEHAAGogAUHAAGoQACAAQeAAaiABQeAAahARIAFBwABqQfDJCyABQcAAahBdIABBgAFqIAFBgAFqEAAgAEGgAWogAUGgAWoQESABQYABakGwygsgAUGAAWoQXSAAQcABaiABQcABahAAIABB4AFqIAFB4AFqEBEgAUHAAWpB8MoLIAFBwAFqEF0gAEGAAmogAUGAAmoQACAAQaACaiABQaACahARIAFBgAJqQbDLCyABQYACahBdIABBwAJqIAFBwAJqEAAgAEHgAmogAUHgAmoQESABQcACakHwywsgAUHAAmoQXQtmACAAQbDMCyABEF0gAEHAAGpB8MwLIAFBwABqEF0gAEGAAWpBsM0LIAFBgAFqEF0gAEHAAWpB8M0LIAFBwAFqEF0gAEGAAmpBsM4LIAFBgAJqEF0gAEHAAmpB8M4LIAFBwAJqEF0LhAIAIAAgARAAIABBIGogAUEgahARIAFBsM8LIAEQXSAAQcAAaiABQcAAahAAIABB4ABqIAFB4ABqEBEgAUHAAGpB8M8LIAFBwABqEF0gAEGAAWogAUGAAWoQACAAQaABaiABQaABahARIAFBgAFqQbDQCyABQYABahBdIABBwAFqIAFBwAFqEAAgAEHgAWogAUHgAWoQESABQcABakHw0AsgAUHAAWoQXSAAQYACaiABQYACahAAIABBoAJqIAFBoAJqEBEgAUGAAmpBsNELIAFBgAJqEF0gAEHAAmogAUHAAmoQACAAQeACaiABQeACahARIAFBwAJqQfDRCyABQcACahBdC2YAIABBsNILIAEQXSAAQcAAakHw0gsgAUHAAGoQXSAAQYABakGw0wsgAUGAAWoQXSAAQcABakHw0wsgAUHAAWoQXSAAQYACakGw1AsgAUGAAmoQXSAAQcACakHw1AsgAUHAAmoQXQuEAgAgACABEAAgAEEgaiABQSBqEBEgAUGw1QsgARBdIABBwABqIAFBwABqEAAgAEHgAGogAUHgAGoQESABQcAAakHw1QsgAUHAAGoQXSAAQYABaiABQYABahAAIABBoAFqIAFBoAFqEBEgAUGAAWpBsNYLIAFBgAFqEF0gAEHAAWogAUHAAWoQACAAQeABaiABQeABahARIAFBwAFqQfDWCyABQcABahBdIABBgAJqIAFBgAJqEAAgAEGgAmogAUGgAmoQESABQYACakGw1wsgAUGAAmoQXSAAQcACaiABQcACahAAIABB4AJqIAFB4AJqEBEgAUHAAmpB8NcLIAFBwAJqEF0LZgAgAEGw2AsgARBdIABBwABqQfDYCyABQcAAahBdIABBgAFqQbDZCyABQYABahBdIABBwAFqQfDZCyABQcABahBdIABBgAJqQbDaCyABQYACahBdIABBwAJqQfDaCyABQcACahBdC4QCACAAIAEQACAAQSBqIAFBIGoQESABQbDbCyABEF0gAEHAAGogAUHAAGoQACAAQeAAaiABQeAAahARIAFBwABqQfDbCyABQcAAahBdIABBgAFqIAFBgAFqEAAgAEGgAWogAUGgAWoQESABQYABakGw3AsgAUGAAWoQXSAAQcABaiABQcABahAAIABB4AFqIAFB4AFqEBEgAUHAAWpB8NwLIAFBwAFqEF0gAEGAAmogAUGAAmoQACAAQaACaiABQaACahARIAFBgAJqQbDdCyABQYACahBdIABBwAJqIAFBwAJqEAAgAEHgAmogAUHgAmoQESABQcACakHw3QsgAUHAAmoQXQtmACAAQbDeCyABEF0gAEHAAGpB8N4LIAFBwABqEF0gAEGAAWpBsN8LIAFBgAFqEF0gAEHAAWpB8N8LIAFBwAFqEF0gAEGAAmpBsOALIAFBgAJqEF0gAEHAAmpB8OALIAFBwAJqEF0LhAIAIAAgARAAIABBIGogAUEgahARIAFBsOELIAEQXSAAQcAAaiABQcAAahAAIABB4ABqIAFB4ABqEBEgAUHAAGpB8OELIAFBwABqEF0gAEGAAWogAUGAAWoQACAAQaABaiABQaABahARIAFBgAFqQbDiCyABQYABahBdIABBwAFqIAFBwAFqEAAgAEHgAWogAUHgAWoQESABQcABakHw4gsgAUHAAWoQXSAAQYACaiABQYACahAAIABBoAJqIAFBoAJqEBEgAUGAAmpBsOMLIAFBgAJqEF0gAEHAAmogAUHAAmoQACAAQeACaiABQeACahARIAFBwAJqQfDjCyABQcACahBdCxAAIABBsOQLQeACIAEQogELSAAgAEGQ5wsQhQEgAEHAAWpB0OgLEIoBIABBkOoLEKABQZDnC0GQ6gtBkO0LEJYBQZDtC0GQ8AsQrQFBkO0LQZDwCyABEJYBC9YFACAAIABBgAJqQZD2CxBdIABBgAJqQejpCUGQ8wsQXSAAQZDzC0GQ8wsQYCAAIABBgAJqQdD2CxBgQdD2C0GQ8wtBkPMLEF1B6OkJQZD2C0HQ9gsQXUGQ9gtB0PYLQdD2CxBgQZDzC0HQ9gtBkPMLEGFBkPYLQZD2C0HQ8wsQYCAAQcABaiAAQYABakGQ9gsQXSAAQYABakHo6QlBkPQLEF0gAEHAAWpBkPQLQZD0CxBgIABBwAFqIABBgAFqQdD2CxBgQdD2C0GQ9AtBkPQLEF1B6OkJQZD2C0HQ9gsQXUGQ9gtB0PYLQdD2CxBgQZD0C0HQ9gtBkPQLEGFBkPYLQZD2C0HQ9AsQYCAAQcAAaiAAQcACakGQ9gsQXSAAQcACakHo6QlBkPULEF0gAEHAAGpBkPULQZD1CxBgIABBwABqIABBwAJqQdD2CxBgQdD2C0GQ9QtBkPULEF1B6OkJQZD2C0HQ9gsQXUGQ9gtB0PYLQdD2CxBgQZD1C0HQ9gtBkPULEGFBkPYLQZD2C0HQ9QsQYEGQ8wsgACABEGEgASABIAEQYEGQ8wsgASABEGBB0PMLIABBgAJqIAFBgAJqEGAgAUGAAmogAUGAAmogAUGAAmoQYEHQ8wsgAUGAAmogAUGAAmoQYEHQ9QtB6OkJQdD2CxBdQdD2CyAAQcABaiABQcABahBgIAFBwAFqIAFBwAFqIAFBwAFqEGBB0PYLIAFBwAFqIAFBwAFqEGBBkPULIABBgAFqIAFBgAFqEGEgAUGAAWogAUGAAWogAUGAAWoQYEGQ9QsgAUGAAWogAUGAAWoQYEGQ9AsgAEHAAGogAUHAAGoQYSABQcAAaiABQcAAaiABQcAAahBgQZD0CyABQcAAaiABQcAAahBgQdD0CyAAQcACaiABQcACahBgIAFBwAJqIAFBwAJqIAFBwAJqEGBB0PQLIAFBwAJqIAFBwAJqEGALhQECAX8BfyAAQfD3CxCcASABEJQBQT4sAJD3CyICBEAgAkEBRgRAIAEgACABEJYBBSABQfD3CyABEJYBCwtBPSEDAkADQCABIAEQtwEgAywAkPcLIgIEQCACQQFGBEAgASAAIAEQlgEFIAFB8PcLIAEQlgELCyADRQ0BIANBAWshAwwACwsLtQIAIABB8PoLELgBQfD6C0Hw+gsQnAFB8PoLQfD9CxC3AUHw/QtB8IAMELcBQfCADEHw/QtB8IMMEJYBQfCDDEHwhgwQuAFB8IYMQfCGDBCcAUHwhgxB8IkMELcBQfCJDEHwjAwQuAFB8IwMQfCMDBCcAUHwgwxB8I8MEJwBQfCMDEHwkgwQnAFB8JIMQfCGDEHwlQwQlgFB8JUMQfCPDEHwmAwQlgFB8JgMQfD9C0HwmwwQlgFB8JgMQfCGDEHwngwQlgFB8J4MIABB8KEMEJYBQfCbDEHwpAwQrAFB8KQMQfChDEHwpwwQlgFB8JgMQfCqDBCtAUHwqgxB8KcMQfCtDBCWASAAQfCwDBCcAUHwsAxB8JsMQfCzDBCWAUHwswxB8LYMEK4BQfC2DEHwrQwgARCWAQsUACAAQfC5DBC2AUHwuQwgARC5AQtNAEHwvAwQlAEgAEHwkQoQpQEgAUGwkwoQpwFB8JEKQbCTCkHwvwwQqgFB8LwMQfC/DEHwvAwQlgFB8LwMQfC8DBC6AUHwvAwgAhCfAQt9AEHwwgwQlAEgAEHwkQoQpQEgAUGwkwoQpwFB8JEKQbCTCkHwxQwQqgFB8MIMQfDFDEHwwgwQlgEgAkHwkQoQpQEgA0GwkwoQpwFB8JEKQbCTCkHwxQwQqgFB8MIMQfDFDEHwwgwQlgFB8MIMQfDCDBC6AUHwwgwgBBCfAQutAQBB8MgMEJQBIABB8JEKEKUBIAFBsJMKEKcBQfCRCkGwkwpB8MsMEKoBQfDIDEHwywxB8MgMEJYBIAJB8JEKEKUBIANBsJMKEKcBQfCRCkGwkwpB8MsMEKoBQfDIDEHwywxB8MgMEJYBIARB8JEKEKUBIAVBsJMKEKcBQfCRCkGwkwpB8MsMEKoBQfDIDEHwywxB8MgMEJYBQfDIDEHwyAwQugFB8MgMIAYQnwEL3QEAQfDODBCUASAAQfCRChClASABQbCTChCnAUHwkQpBsJMKQfDRDBCqAUHwzgxB8NEMQfDODBCWASACQfCRChClASADQbCTChCnAUHwkQpBsJMKQfDRDBCqAUHwzgxB8NEMQfDODBCWASAEQfCRChClASAFQbCTChCnAUHwkQpBsJMKQfDRDBCqAUHwzgxB8NEMQfDODBCWASAGQfCRChClASAHQbCTChCnAUHwkQpBsJMKQfDRDBCqAUHwzgxB8NEMQfDODBCWAUHwzgxB8M4MELoBQfDODCAIEJ8BC40CAEHw1AwQlAEgAEHwkQoQpQEgAUGwkwoQpwFB8JEKQbCTCkHw1wwQqgFB8NQMQfDXDEHw1AwQlgEgAkHwkQoQpQEgA0GwkwoQpwFB8JEKQbCTCkHw1wwQqgFB8NQMQfDXDEHw1AwQlgEgBEHwkQoQpQEgBUGwkwoQpwFB8JEKQbCTCkHw1wwQqgFB8NQMQfDXDEHw1AwQlgEgBkHwkQoQpQEgB0GwkwoQpwFB8JEKQbCTCkHw1wwQqgFB8NQMQfDXDEHw1AwQlgEgCEHwkQoQpQEgCUGwkwoQpwFB8JEKQbCTCkHw1wwQqgFB8NQMQfDXDEHw1AwQlgFB8NQMQfDUDBC6AUHw1AwgChCfAQssACAAQfCRChClASABQbCTChCnAUHwkQpBsJMKQfDaDBCqAUHw2gwgAhC6AQsLmlBqAEEACwTwLgMAAEEICyABAADwk/XhQ5FwuXlI6DMoXViBgbZFULgpoDHhck5kMABBKAsgAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQYgECyBH/XzYFowgPI3KcWiRaoGXXViBgbZFULgpoDHhck5kMABBqAQLIJ0Nj8WNQ13TPQvH9SjreAosRnl4b6NuZi/fB5rBdwoOAEHIBAsgifqKU1v8LPP7AUXUERnntfZ/QQr/HqtHHzW4ynGf2AYAQegECyCdDY/FjUNd0z0Lx/Uo63gKLEZ5eG+jbmYv3weawXcKDgBBiAULIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEGoBQsgo34+bAtGEJ5G5Ti0SLXAyy6swEDbIijcFNCYcDknMhgAQcgFCyCkfj5sC0YQnkblOLRItcDLLqzAQNsiKNwU0JhwOScyGABB6AULINcorVCpyhd6uSFV4XrBah+E0mtpTupLM46dF85EZx8qAEGIBgsgo34+bAtGEJ5G5Ti0SLXAyy6swEDbIijcFNCYcDknMhgAQagGCyCq7+0SiUjDaE+/qnJofwiNMRIICUei4VH6wClHsdZZIgBByAYLIFI/H7YFIwhPo3IcWqRa4GUXVmCgbREUbgpoTLicExkMAEGIDgsgAQAA8JP14UORcLl5SOgzKF1YgYG2RVC4KaAx4XJOZDAAQagOCyD7//9PHDSWrCnNYJ+Vdvw2LkZ5eG+jbmYv3weawXcKDgBByA4LIKdtIa5F5rgb41lc47E6/lOFgLtTPYNJjKVETn+x0BYCAEHoDgsg+///Txw0lqwpzWCflXb8Ni5GeXhvo25mL98HmsF3Cg4AQYgPCyAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABBqA8LIAAAAPjJ+vChSLjcPCT0GZQurMBA2yIo3BTQmHA5JzIYAEHIDwsgAQAA+Mn68KFIuNw8JPQZlC6swEDbIijcFNCYcDknMhgAQegPCyDm//+f+Q4NGz+RKqOjaLrqiQbd2Hbr2EfDu/UgVQjQFQBBiBALID9ZHz4UCZebh4Q+g9KFFRhoWwSFmwIaEy7nRAYDAAAAAEGoEAsgnD3RgFVzbmPW/0UkdPMrotgDsh7AKkVW5/ljKZTvYBgAQcgQCyCgrA8fioTLzUNCn0HpwgoMtC2Cwk0BjQmXcyKDAQAAAABBiOMBC4ACAAAAAgAEBAYACAgKCAwMDAAQEBIQFBQUEBgYGBgYGBwAICAiICQkJCAoKCgoKCgsIDAwMDAwMDQwMDA4MDg4OABAQEJAREREQEhISEhISExAUFBQUFBQVFBQUFhQWFhYQGBgYGBgYGRgYGBoYGhoaGBgYHBgcHBwYHBwcHBwcHgAgICCgISEhICIiIiIiIiMgJCQkJCQkJSQkJCYkJiYmICgoKCgoKCkoKCgqKCoqKigoKCwoLCwsKCwsLCwsLC4gMDAwMDAwMTAwMDIwMjIyMDAwNDA0NDQwNDQ0NDQ0NjAwMDgwODg4MDg4ODg4ODowODg4ODg4PDg4ODw4PDw8ABBiOUBC4ACAAAAAQABAgEAAQIBBAECAwABAgEEAQIDCAECAwQFBgMAAQIBBAECAwgBAgMEBQYDEAECAwQFBgMICQoDDAUGBwABAgEEAQIDCAECAwQFBgMQAQIDBAUGAwgJCgMMBQYHIAECAwQFBgMICQoDDAUGBxAREgMUBQYHGAkKCwwNDgcAAQIBBAECAwgBAgMEBQYDEAECAwQFBgMICQoDDAUGByABAgMEBQYDCAkKAwwFBgcQERIDFAUGBxgJCgsMDQ4HQAECAwQFBgMICQoDDAUGBxAREgMUBQYHGAkKCwwNDgcgISIDJAUGBygJCgsMDQ4HMBESExQVFgcYGRoLHA0ODwBByKwDC6AH+///Txw0lqwpzWCflXb8Ni5GeXhvo25mL98HmsF3Cg4GAACgd8FLl2ejWNqycTfxLhIICUei4VH6wClHsdZZIovv3J6XPXV/IJFHsSwXP19ubAl0eWKxjc8IwTk1ezcrP3ytteJKrfi+hcuD/8ZgLfcplF0r/XbZqdmaP+d8QCQDjy90fH229Mxo0GPcLRtoalf7G++85Yz+PLbSUSl8FmRMV7+x9xQi8n0x9y8j+SjNda2wqIR15QNtF9xZ+4Erv2GPgeUDkI7C/vibNL+bjE5TAT/N7txTPKop5WuWkCaxe4EmMMR5CvB9U5l8zLJ73uZBAtUnyrZM8DI2P7N6AMxKooM/uK+iblNdUtlV8pIZ3YYCCGZ1XkklLcWmsXsY3iOkIuc7U5wNbt98Ep0qZAXAmkBGdbwNglA9so1M8ACEEQwotLP0HiwqXq7C1HrPGGWjxWw7BriMwN9lucRII7LPT66JIedIB1r4jTz7AwoKLpvqNYpN/3cdnM0ujKko09vssy9S1B2t81XQkyoiaOhV1bNmfZy+RviUYbj2khvWTqB5vtxMiYcH00Rq3myVX8Hb1yu2oVlOb4CaEOTrErjqBU3HoBO6FjGrEWNdAS5aoKWMLJIDtdqU4/7XFb4GVLj9WwX3ToDy6s5AcWunesuJ/rJoWsn8xwbE8TUcRh0zdDk5WeezR9EkHA2SOjptQ1/3dFESNKFW1WruAR+CG3zcBBLYuAXaQY0wBuYqMkgsiZ6EJ441NZLVLdb7yg8EhAtwCS/GZiVghr+gdjoYM/FYUFdZjznZNM3ROc4ubQU2eqLmt6OeBLzbPgUD5uvv1J7OOlq0JIReeYimkIN8KBqTjapl1DLanI+AYYX2aSaFsMjkRqt7JBoC1oGHZjsNPC8y9ZIh6ien6Y9l6YQYsWnAU6C8I4Y6pjnhJfDzjxLyGu+8biKOm2BrQN+r8UWePbun1VfSjVO8o4J4A5M4CgCRnsAEJEhusiUAWceRdQ0Rvl46eScCpKhMqcHDpmQBMNBP2Gm9IscsFlLPJkoOYOmn80XXfnL7XCf7abKnUhbiB1xX//oOQMWaj0tJcyNVN63nge2reao5Lk0IuOXGGv4giskilKKgnVyTZcpi1HP3gkXUbkq64baCOgzAFPwoZwKJgBRkWYdJA8DktXg6Sn6xplLdTwBJEurmZd0XRSicPdGAVXNuY9b/RSR08yui2AOyHsAqRVbn+WMplO9gGABB6LMDC6AH+///Txw0lqwpzWCflXb8Ni5GeXhvo25mL98HmsF3Cg7+//8f2BQ8eN0ejQxvL5ivRU/9/JJ0X4+sv5w9GmM3H////w9sCh68bo9GhrcXzNeip35+SbqvR9Zfzh6NsZsPAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAABBiLsDC4ACAIBAwCCgYOAQkFDQMLBw8AiISMgoqGjoGJhY2Di4ePgEhETEJKRk5BSUVNQ0tHT0DIxMzCysbOwcnFzcPLx8/AKCQsIiomLiEpJS0jKycvIKikrKKqpq6hqaWto6unr6BoZGxiamZuYWllbWNrZ29g6OTs4urm7uHp5e3j6+fv4BgUHBIaFh4RGRUdExsXHxCYlJySmpaekZmVnZObl5+QWFRcUlpWXlFZVV1TW1dfUNjU3NLa1t7R2dXd09vX39A4NDwyOjY+MTk1PTM7Nz8wuLS8srq2vrG5tb2zu7e/sHh0fHJ6dn5xeXV9c3t3f3D49Pzy+vb+8fn1/fP79//wBBqNcGC4ACAAAAAgAEBAYACAgKCAwMDAAQEBIQFBQUEBgYGBgYGBwAICAiICQkJCAoKCgoKCgsIDAwMDAwMDQwMDA4MDg4OABAQEJAREREQEhISEhISExAUFBQUFBQVFBQUFhQWFhYQGBgYGBgYGRgYGBoYGhoaGBgYHBgcHBwYHBwcHBwcHgAgICCgISEhICIiIiIiIiMgJCQkJCQkJSQkJCYkJiYmICgoKCgoKCkoKCgqKCoqKigoKCwoLCwsKCwsLCwsLC4gMDAwMDAwMTAwMDIwMjIyMDAwNDA0NDQwNDQ0NDQ0NjAwMDgwODg4MDg4ODg4ODowODg4ODg4PDg4ODw4PDw8ABBqNkGC4ACAAAAAQABAgEAAQIBBAECAwABAgEEAQIDCAECAwQFBgMAAQIBBAECAwgBAgMEBQYDEAECAwQFBgMICQoDDAUGBwABAgEEAQIDCAECAwQFBgMQAQIDBAUGAwgJCgMMBQYHIAECAwQFBgMICQoDDAUGBxAREgMUBQYHGAkKCwwNDgcAAQIBBAECAwgBAgMEBQYDEAECAwQFBgMICQoDDAUGByABAgMEBQYDCAkKAwwFBgcQERIDFAUGBxgJCgsMDQ4HQAECAwQFBgMICQoDDAUGBxAREgMUBQYHGAkKCwwNDgcgISIDJAUGBygJCgsMDQ4HMBESExQVFgcYGRoLHA0ODwBBqOIJC2CdDY/FjUNd0z0Lx/Uo63gKLEZ5eG+jbmYv3weawXcKDjobHosbh7qmexaO61HW8RRYjPLw3kbdzF6+DzSD7xQcnQ2PxY1DXdM9C8f1KOt4CixGeXhvo25mL98HmsF3Cg4AQYjjCQtgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACdDY/FjUNd0z0Lx/Uo63gKLEZ5eG+jbmYv3weawXcKDgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEHo4wkLwAEmILwC0bWDjnIBe0k1Gevc3xqBl0cmuPs7UJavQThXGUBhTKh9c7SvxNgCWFrdQ2CGL6BS/FDpCWt76jqD8P4U9ulriJ36nWF4m571l9J//v59GyNiGp7/BkKerut+/SjuVhjHVlsJZLs8fTIi+VfcdhA1M741+VWCZP2T5qCkDZ0Nj8WNQ13TPQvH9SjreAosRnl4b6NuZi/fB5rBdwoOAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQajlCQvAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACdDY/FjUNd0z0Lx/Uo63gKLEZ5eG+jbmYv3weawXcKDgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABB6OYJC4ADnQ2PxY1DXdM9C8f1KOt4CixGeXhvo25mL98HmsF3Cg4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEHo6QkLQPd/DUHORwb2EdAb001vPS/RxkA5fjNDKVeY46fomJUdnQ2PxY1DXdM9C8f1KOt4CixGeXhvo25mL98HmsF3Cg4AQajqCQtAcgUGT9Lnvoflahwv3Sr90ERP/fySdF+PrL+cPRpjNx8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABB6OoJC0CoArh34zj5O11TMzYnGwsCYFJ1SfDttyZtqIRDMsYUJWf/3NHM7Oc4Pg3Ok32z8GWqAKwi3dBJ102NaErOuUEBAEGokQoLQQAAAAEAAQABAQEAAQEBAAAAAQEAAQEBAAABAQEBAQABAQAAAQEBAAAAAAAAAQEBAAEAAAEBAQEAAQABAQEAAAEBAEGwtwsLQDCrY0UQO3e1VGSqqciRfzSRCS4kJ3EAeuwUghHYvFYZV0eqoB6fhG5BkfiJbXscqjrK4PrNE+e2w+uCTrtPaSYAQfC3CwtAKbY2KQzdu+TLujPhYvEwu2ZTZPm20akx3fgApb5wNSXHd/5f5HzXodvRJngR/a8Ha9x+uye9Fm3M/t6FAiCHLABBsMYLC0CdDY/FjUNd0z0Lx/Uo63gKLEZ5eG+jbmYv3weawXcKDgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEHwxgsLQJ0Nj8WNQ13TPQvH9SjreAosRnl4b6NuZi/fB5rBdwoOAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQbDHCwtAnQ2PxY1DXdM9C8f1KOt4CixGeXhvo25mL98HmsF3Cg4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABB8McLC0CdDY/FjUNd0z0Lx/Uo63gKLEZ5eG+jbmYv3weawXcKDgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEGwyAsLQJ0Nj8WNQ13TPQvH9SjreAosRnl4b6NuZi/fB5rBdwoOAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQfDICwtAnQ2PxY1DXdM9C8f1KOt4CixGeXhvo25mL98HmsF3Cg4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABBsMkLC0CdDY/FjUNd0z0Lx/Uo63gKLEZ5eG+jbmYv3weawXcKDgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEHwyQsLQDCrY0UQO3e1VGSqqciRfzSRCS4kJ3EAeuwUghHYvFYZV0eqoB6fhG5BkfiJbXscqjrK4PrNE+e2w+uCTrtPaSYAQbDKCwtAkr46hH/XYXP7ETQn0yu7pZkjPksxH5Sc7NOfu92c3xVJydhLFf3dXWBbRKSlKctiudJ9DAqHvDf98HExnQqDJABB8MoLC0AHSRQzlqabr4q3r4dzHWvKhyCK8F7tvRF8Oh8adU3zAnItSUwjriKiW+FdVqQCD9Amyd9TovMv3FGVibMWV6cQAEGwywsLQCm2NikM3bvky7oz4WLxMLtmU2T5ttGpMd34AKW+cDUlx3f+X+R816Hb0SZ4Ef2vB2vcfrsnvRZtzP7ehQIghywAQfDLCwtA5w9pQS9pcMkLS2knITRA4uhZxINr5r4yQYiwCu28qhKpv65AI11IDVfML6sYNBkF9RBJiguksNNaktI1teshLwBBsMwLC0CdDY/FjUNd0z0Lx/Uo63gKLEZ5eG+jbmYv3weawXcKDgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEHwzAsLQJwL6BOOyFAzuVZe23xVzn1KVhW2uLQBYOAXAgIX5oImAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQbDNCwtAVeGC1xEMk3EjM77/fJS7pkQUdNREMzCqQ0lZJg0/OywAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABB8M0LC0DyG/oABYCNymmXs2gU1sXwGEQNrXESIA7mVti6ZQ8pBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEGwzgsLQKrv7RKJSMNoT7+qcmh/CI0xEggJR6LhUfrAKUex1lkiAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQfDOCwtAq/GUxIjDzwjUcxONFBWzGRMCbMv9kE5YSYgv31to4QkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABBsM8LC0CdDY/FjUNd0z0Lx/Uo63gKLEZ5eG+jbmYv3weawXcKDgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEHwzwsLQK1rrRb3Iq/JsmKmSip4EbP0x0jiZK/uGYKfQ+N3PicgrJPO92AowKxMa6d7gdUzOWeEbESLGOZpVcwXRG0DRgoAQbDQCwtA32Jne6WTikTf6v0o9S3Wv3rUmw7Q9VjYWOx2NE09sAbRNsm89NoZK58p9FZ6TqWh8a7eWuDuM7WyoN2EK4EMFwBB8NALC0B92UZOGBZTNp9tydSeEvcKtQkQyi+nnWUjDaKDiW0RCDkZnMP3St+xf79ziocCnz3gCq+MkiAim6ZU8O8VRWgmAEGw0QsLQB5HRq8Kr2RXwQ8+hy55UNz2BB2I/3OmhkynMDy03S4LgIV+eDIPSZqx+Erwf23Rj/J7AsaOiDlLXaFSW3Au3QMAQfDRCwtAn1XPdSJLvOAP5lTBRbk4wl59mpKlgjmAfqPk9y0FzhWnmTe/ve8oLXMH1ho8fgmbW1NKrxNBLZhjYAXjkYnhJABBsNILC0CdDY/FjUNd0z0Lx/Uo63gKLEZ5eG+jbmYv3weawXcKDgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEHw0gsLQFXhgtcRDJNxIzO+/3yUu6ZEFHTURDMwqkNJWSYNPzssAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQbDTCwtAnAvoE47IUDO5Vl7bfFXOfUpWFba4tAFg4BcCAhfmgiYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABB8NMLC0CcC+gTjshQM7lWXtt8Vc59SlYVtri0AWDgFwICF+aCJgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEGw1AsLQJ0Nj8WNQ13TPQvH9SjreAosRnl4b6NuZi/fB5rBdwoOAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQfDUCwtAVeGC1xEMk3EjM77/fJS7pkQUdNREMzCqQ0lZJg0/OywAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABBsNULC0CdDY/FjUNd0z0Lx/Uo63gKLEZ5eG+jbmYv3weawXcKDgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEHw1QsLQLHj6FQmuhr5Es6S3C/LcUc134v84Gqx3OSLnc2VoUonix+BGK5Q/FyMmEPLM4SySxlitcMTX9NPOojIL71JGTAAQbDWCwtA1tva2PEgNISyzT8YyRDwMUlgpye1MGND5N8a8Ud01BN0+leoI0BJ7xoQq9UCXZIqEC+mm4IVsIOjrhMMHRE5JQBB8NYLC0B2kDIbgm+3hhS2GU0r9YtALemF2dC531On0oJpFCAeBcfrUnfUnLwPJN4VNOP/j225Qc848CzyvlS/Zjz/7cAVAEGw1wsLQCm2NikM3bvky7oz4WLxMLtmU2T5ttGpMd34AKW+cDUlx3f+X+R816Hb0SZ4Ef2vB2vcfrsnvRZtzP7ehQIghywAQfDXCwtAuEVmNPPhSxcEm+uZJIX433Uj1g46nHpNPRs07UBIIwNF1wVXsR4BXKkFGNi0tHEtxJqCpr7izHwybmSOT+wjJgBBsNgLC0CdDY/FjUNd0z0Lx/Uo63gKLEZ5eG+jbmYv3weawXcKDgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEHw2AsLQJ0Nj8WNQ13TPQvH9SjreAosRnl4b6NuZi/fB5rBdwoOAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQbDZCwtAnQ2PxY1DXdM9C8f1KOt4CixGeXhvo25mL98HmsF3Cg4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABB8NkLC0Cq7+0SiUjDaE+/qnJofwiNMRIICUei4VH6wClHsdZZIgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEGw2gsLQKrv7RKJSMNoT7+qcmh/CI0xEggJR6LhUfrAKUex1lkiAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQfDaCwtAqu/tEolIw2hPv6pyaH8IjTESCAlHouFR+sApR7HWWSIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABBsNsLC0CdDY/FjUNd0z0Lx/Uo63gKLEZ5eG+jbmYv3weawXcKDgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEHw2wsLQDCrY0UQO3e1VGSqqciRfzSRCS4kJ3EAeuwUghHYvFYZV0eqoB6fhG5BkfiJbXscqjrK4PrNE+e2w+uCTrtPaSYAQbDcCwtAkr46hH/XYXP7ETQn0yu7pZkjPksxH5Sc7NOfu92c3xVJydhLFf3dXWBbRKSlKctiudJ9DAqHvDf98HExnQqDJABB8NwLC0BAtGilgOWEjAITwuAdTRbN1Tf3kFdYkqatZRLH/QBxLdXPM4zz3f2ZMekTEu1ncsc2j6EtFFIg3NcKqC1c97wfAEGw3QsLQB5HRq8Kr2RXwQ8+hy55UNz2BB2I/3OmhkynMDy03S4LgIV+eDIPSZqx+Erwf23Rj/J7AsaOiDlLXaFSW3Au3QMAQfDdCwtAYO0Tl+cisHKBfwhBcDZBtXT+vP1KX5GF6BeB1oWRuR2ePc6X8y7YLjb+Qb14NmiSaEc496qhn+TODV+rvWJCAQBBsN4LC0CdDY/FjUNd0z0Lx/Uo63gKLEZ5eG+jbmYv3weawXcKDgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEHw3gsLQJwL6BOOyFAzuVZe23xVzn1KVhW2uLQBYOAXAgIX5oImAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQbDfCwtAVeGC1xEMk3EjM77/fJS7pkQUdNREMzCqQ0lZJg0/OywAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABB8N8LC0BV4YLXEQyTcSMzvv98lLumRBR01EQzMKpDSVkmDT87LAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEGw4AsLQJ0Nj8WNQ13TPQvH9SjreAosRnl4b6NuZi/fB5rBdwoOAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQfDgCwtAnAvoE47IUDO5Vl7bfFXOfUpWFba4tAFg4BcCAhfmgiYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABBsOELC0CdDY/FjUNd0z0Lx/Uo63gKLEZ5eG+jbmYv3weawXcKDgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEHw4QsLQK1rrRb3Iq/JsmKmSip4EbP0x0jiZK/uGYKfQ+N3PicgrJPO92AowKxMa6d7gdUzOWeEbESLGOZpVcwXRG0DRgoAQbDiCwtA32Jne6WTikTf6v0o9S3Wv3rUmw7Q9VjYWOx2NE09sAbRNsm89NoZK58p9FZ6TqWh8a7eWuDuM7WyoN2EK4EMFwBB8OILC0DKIzaK/nXNBe5cqJPyV4qMqE5xt4aeslIGk49d6eBSKA7k4BQfQUGKDQv+3Qlo4ll9TdL0IyUuHYNLQfFcCfwJAEGw4wsLQCm2NikM3bvky7oz4WLxMLtmU2T5ttGpMd34AKW+cDUlx3f+X+R816Hb0SZ4Ef2vB2vcfrsnvRZtzP7ehQIghywAQfDjCwtAqKetYvRAZFt95BynS7FI1f7a5u4QwxY4q/xM6URJlhqgY0UZWZz3DhrDm01V7Hf8AQU30qIEIyDGPyz+4MSCCwBBsOQLC+ACIPGGymRLloakI0Xlt++kQLtK6JZ4qX+DGLmyubYCETbaklbz3oHewGDHw6boxwS+f7tw1cn5ZtdBGFaDTZcwwqNpvsNoFrpblGJSEMQROH8cp93afe66KQCpXRSNO4G/LJo/Qt+6G2RezOpE6rQLqHzj/RRIZmXN0pECWLlkA0rd8CYIsd+T7iRHUcWN20JrhTcPC0PPELsWQoBvQE5JQPuq86wH4c9Vh67r4IDsiCCgN6MR0D5qhJVROh5KWqRIFg7F32hFZuXrxAxMKUFqq9rHaNIC1tCCisQ87ZpEaGb8XQGyD81iUNGz3bGoQCl/SGQiKjq29XeuQ+RhE3jw/sjG1YgOh3f5qmtnH6ZkA3mj3q3OLueHWHAbmqBj5XcTssPYG+7vVAz32CTVWtHDPl06OLJmVPHawP6Uu3MK4+Hiez9fAXEcav+xaWO/Qy2EvCB9EN/a/SBwyW1LLwAAAABBkPcLCz8BAAAA/wAAAAABAAEAAAAAAQAAAQD/AAEAAQABAAABAAAAAQD/AP8A/wABAAEAAP8AAQABAP8AAAEAAQAAAAEAQdD3Cwsg8QlpSrSS6UQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=", "base64");
   5            exports.pq = 520;
   6            exports.pr = 1800;
   7            exports.pG1gen = 160040;
   8            exports.pG1zero = 160136;
   9            exports.pG2gen = 160232;
  10            exports.pG2zero = 160424;
  11            exports.pOneT = 160616;
  12            exports.prePSize = undefined;
  13            exports.preQSize = undefined;
  14        
  15}).call(this,require("buffer").Buffer)
  16},{"buffer":9}],2:[function(require,module,exports){
  17/*
  18    Copyright 2019 0KIMS association.
  19
  20    This file is part of wasmsnark (Web Assembly zkSnark Prover).
  21
  22    wasmsnark is a free software: you can redistribute it and/or modify it
  23    under the terms of the GNU General Public License as published by
  24    the Free Software Foundation, either version 3 of the License, or
  25    (at your option) any later version.
  26
  27    wasmsnark is distributed in the hope that it will be useful, but WITHOUT
  28    ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
  29    or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
  30    License for more details.
  31
  32    You should have received a copy of the GNU General Public License
  33    along with wasmsnark. If not, see <https://www.gnu.org/licenses/>.
  34*/
  35
  36/* globals window */
  37
  38const buildBn128 = require("./src/bn128.js");
  39
  40buildBn128().then( (bn128) => {
  41    window.bn128 = bn128;
  42    window.groth16GenProof = function(witness, provingKey, cb) {
  43
  44        const p = bn128.groth16GenProof(witness, provingKey);
  45
  46        if (cb) {
  47            p.then( (proof) => {
  48                cb(null, proof);
  49            }, (err) => {
  50                cb(err);
  51            });
  52        } else {
  53            return p;
  54        }
  55    };
  56
  57    window.groth16Verify = function(verificationKey, input, proof, cb) {
  58
  59        const p = bn128.groth16Verify(verificationKey, input, proof);
  60
  61        if (cb) {
  62            p.then( (proof) => {
  63                cb(null, proof);
  64            }, (err) => {
  65                cb(err);
  66            });
  67        } else {
  68            return p;
  69        }
  70    };
  71});
  72
  73
  74
  75},{"./src/bn128.js":13}],3:[function(require,module,exports){
  76(function (global){
  77'use strict';
  78
  79var objectAssign = require('object-assign');
  80
  81// compare and isBuffer taken from https://github.com/feross/buffer/blob/680e9e5e488f22aac27599a57dc844a6315928dd/index.js
  82// original notice:
  83
  84/*!
  85 * The buffer module from node.js, for the browser.
  86 *
  87 * @author   Feross Aboukhadijeh <feross@feross.org> <http://feross.org>
  88 * @license  MIT
  89 */
  90function compare(a, b) {
  91  if (a === b) {
  92    return 0;
  93  }
  94
  95  var x = a.length;
  96  var y = b.length;
  97
  98  for (var i = 0, len = Math.min(x, y); i < len; ++i) {
  99    if (a[i] !== b[i]) {
 100      x = a[i];
 101      y = b[i];
 102      break;
 103    }
 104  }
 105
 106  if (x < y) {
 107    return -1;
 108  }
 109  if (y < x) {
 110    return 1;
 111  }
 112  return 0;
 113}
 114function isBuffer(b) {
 115  if (global.Buffer && typeof global.Buffer.isBuffer === 'function') {
 116    return global.Buffer.isBuffer(b);
 117  }
 118  return !!(b != null && b._isBuffer);
 119}
 120
 121// based on node assert, original notice:
 122// NB: The URL to the CommonJS spec is kept just for tradition.
 123//     node-assert has evolved a lot since then, both in API and behavior.
 124
 125// http://wiki.commonjs.org/wiki/Unit_Testing/1.0
 126//
 127// THIS IS NOT TESTED NOR LIKELY TO WORK OUTSIDE V8!
 128//
 129// Originally from narwhal.js (http://narwhaljs.org)
 130// Copyright (c) 2009 Thomas Robinson <280north.com>
 131//
 132// Permission is hereby granted, free of charge, to any person obtaining a copy
 133// of this software and associated documentation files (the 'Software'), to
 134// deal in the Software without restriction, including without limitation the
 135// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
 136// sell copies of the Software, and to permit persons to whom the Software is
 137// furnished to do so, subject to the following conditions:
 138//
 139// The above copyright notice and this permission notice shall be included in
 140// all copies or substantial portions of the Software.
 141//
 142// THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 143// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 144// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 145// AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
 146// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
 147// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 148
 149var util = require('util/');
 150var hasOwn = Object.prototype.hasOwnProperty;
 151var pSlice = Array.prototype.slice;
 152var functionsHaveNames = (function () {
 153  return function foo() {}.name === 'foo';
 154}());
 155function pToString (obj) {
 156  return Object.prototype.toString.call(obj);
 157}
 158function isView(arrbuf) {
 159  if (isBuffer(arrbuf)) {
 160    return false;
 161  }
 162  if (typeof global.ArrayBuffer !== 'function') {
 163    return false;
 164  }
 165  if (typeof ArrayBuffer.isView === 'function') {
 166    return ArrayBuffer.isView(arrbuf);
 167  }
 168  if (!arrbuf) {
 169    return false;
 170  }
 171  if (arrbuf instanceof DataView) {
 172    return true;
 173  }
 174  if (arrbuf.buffer && arrbuf.buffer instanceof ArrayBuffer) {
 175    return true;
 176  }
 177  return false;
 178}
 179// 1. The assert module provides functions that throw
 180// AssertionError's when particular conditions are not met. The
 181// assert module must conform to the following interface.
 182
 183var assert = module.exports = ok;
 184
 185// 2. The AssertionError is defined in assert.
 186// new assert.AssertionError({ message: message,
 187//                             actual: actual,
 188//                             expected: expected })
 189
 190var regex = /\s*function\s+([^\(\s]*)\s*/;
 191// based on https://github.com/ljharb/function.prototype.name/blob/adeeeec8bfcc6068b187d7d9fb3d5bb1d3a30899/implementation.js
 192function getName(func) {
 193  if (!util.isFunction(func)) {
 194    return;
 195  }
 196  if (functionsHaveNames) {
 197    return func.name;
 198  }
 199  var str = func.toString();
 200  var match = str.match(regex);
 201  return match && match[1];
 202}
 203assert.AssertionError = function AssertionError(options) {
 204  this.name = 'AssertionError';
 205  this.actual = options.actual;
 206  this.expected = options.expected;
 207  this.operator = options.operator;
 208  if (options.message) {
 209    this.message = options.message;
 210    this.generatedMessage = false;
 211  } else {
 212    this.message = getMessage(this);
 213    this.generatedMessage = true;
 214  }
 215  var stackStartFunction = options.stackStartFunction || fail;
 216  if (Error.captureStackTrace) {
 217    Error.captureStackTrace(this, stackStartFunction);
 218  } else {
 219    // non v8 browsers so we can have a stacktrace
 220    var err = new Error();
 221    if (err.stack) {
 222      var out = err.stack;
 223
 224      // try to strip useless frames
 225      var fn_name = getName(stackStartFunction);
 226      var idx = out.indexOf('\n' + fn_name);
 227      if (idx >= 0) {
 228        // once we have located the function frame
 229        // we need to strip out everything before it (and its line)
 230        var next_line = out.indexOf('\n', idx + 1);
 231        out = out.substring(next_line + 1);
 232      }
 233
 234      this.stack = out;
 235    }
 236  }
 237};
 238
 239// assert.AssertionError instanceof Error
 240util.inherits(assert.AssertionError, Error);
 241
 242function truncate(s, n) {
 243  if (typeof s === 'string') {
 244    return s.length < n ? s : s.slice(0, n);
 245  } else {
 246    return s;
 247  }
 248}
 249function inspect(something) {
 250  if (functionsHaveNames || !util.isFunction(something)) {
 251    return util.inspect(something);
 252  }
 253  var rawname = getName(something);
 254  var name = rawname ? ': ' + rawname : '';
 255  return '[Function' +  name + ']';
 256}
 257function getMessage(self) {
 258  return truncate(inspect(self.actual), 128) + ' ' +
 259         self.operator + ' ' +
 260         truncate(inspect(self.expected), 128);
 261}
 262
 263// At present only the three keys mentioned above are used and
 264// understood by the spec. Implementations or sub modules can pass
 265// other keys to the AssertionError's constructor - they will be
 266// ignored.
 267
 268// 3. All of the following functions must throw an AssertionError
 269// when a corresponding condition is not met, with a message that
 270// may be undefined if not provided.  All assertion methods provide
 271// both the actual and expected values to the assertion error for
 272// display purposes.
 273
 274function fail(actual, expected, message, operator, stackStartFunction) {
 275  throw new assert.AssertionError({
 276    message: message,
 277    actual: actual,
 278    expected: expected,
 279    operator: operator,
 280    stackStartFunction: stackStartFunction
 281  });
 282}
 283
 284// EXTENSION! allows for well behaved errors defined elsewhere.
 285assert.fail = fail;
 286
 287// 4. Pure assertion tests whether a value is truthy, as determined
 288// by !!guard.
 289// assert.ok(guard, message_opt);
 290// This statement is equivalent to assert.equal(true, !!guard,
 291// message_opt);. To test strictly for the value true, use
 292// assert.strictEqual(true, guard, message_opt);.
 293
 294function ok(value, message) {
 295  if (!value) fail(value, true, message, '==', assert.ok);
 296}
 297assert.ok = ok;
 298
 299// 5. The equality assertion tests shallow, coercive equality with
 300// ==.
 301// assert.equal(actual, expected, message_opt);
 302
 303assert.equal = function equal(actual, expected, message) {
 304  if (actual != expected) fail(actual, expected, message, '==', assert.equal);
 305};
 306
 307// 6. The non-equality assertion tests for whether two objects are not equal
 308// with != assert.notEqual(actual, expected, message_opt);
 309
 310assert.notEqual = function notEqual(actual, expected, message) {
 311  if (actual == expected) {
 312    fail(actual, expected, message, '!=', assert.notEqual);
 313  }
 314};
 315
 316// 7. The equivalence assertion tests a deep equality relation.
 317// assert.deepEqual(actual, expected, message_opt);
 318
 319assert.deepEqual = function deepEqual(actual, expected, message) {
 320  if (!_deepEqual(actual, expected, false)) {
 321    fail(actual, expected, message, 'deepEqual', assert.deepEqual);
 322  }
 323};
 324
 325assert.deepStrictEqual = function deepStrictEqual(actual, expected, message) {
 326  if (!_deepEqual(actual, expected, true)) {
 327    fail(actual, expected, message, 'deepStrictEqual', assert.deepStrictEqual);
 328  }
 329};
 330
 331function _deepEqual(actual, expected, strict, memos) {
 332  // 7.1. All identical values are equivalent, as determined by ===.
 333  if (actual === expected) {
 334    return true;
 335  } else if (isBuffer(actual) && isBuffer(expected)) {
 336    return compare(actual, expected) === 0;
 337
 338  // 7.2. If the expected value is a Date object, the actual value is
 339  // equivalent if it is also a Date object that refers to the same time.
 340  } else if (util.isDate(actual) && util.isDate(expected)) {
 341    return actual.getTime() === expected.getTime();
 342
 343  // 7.3 If the expected value is a RegExp object, the actual value is
 344  // equivalent if it is also a RegExp object with the same source and
 345  // properties (`global`, `multiline`, `lastIndex`, `ignoreCase`).
 346  } else if (util.isRegExp(actual) && util.isRegExp(expected)) {
 347    return actual.source === expected.source &&
 348           actual.global === expected.global &&
 349           actual.multiline === expected.multiline &&
 350           actual.lastIndex === expected.lastIndex &&
 351           actual.ignoreCase === expected.ignoreCase;
 352
 353  // 7.4. Other pairs that do not both pass typeof value == 'object',
 354  // equivalence is determined by ==.
 355  } else if ((actual === null || typeof actual !== 'object') &&
 356             (expected === null || typeof expected !== 'object')) {
 357    return strict ? actual === expected : actual == expected;
 358
 359  // If both values are instances of typed arrays, wrap their underlying
 360  // ArrayBuffers in a Buffer each to increase performance
 361  // This optimization requires the arrays to have the same type as checked by
 362  // Object.prototype.toString (aka pToString). Never perform binary
 363  // comparisons for Float*Arrays, though, since e.g. +0 === -0 but their
 364  // bit patterns are not identical.
 365  } else if (isView(actual) && isView(expected) &&
 366             pToString(actual) === pToString(expected) &&
 367             !(actual instanceof Float32Array ||
 368               actual instanceof Float64Array)) {
 369    return compare(new Uint8Array(actual.buffer),
 370                   new Uint8Array(expected.buffer)) === 0;
 371
 372  // 7.5 For all other Object pairs, including Array objects, equivalence is
 373  // determined by having the same number of owned properties (as verified
 374  // with Object.prototype.hasOwnProperty.call), the same set of keys
 375  // (although not necessarily the same order), equivalent values for every
 376  // corresponding key, and an identical 'prototype' property. Note: this
 377  // accounts for both named and indexed properties on Arrays.
 378  } else if (isBuffer(actual) !== isBuffer(expected)) {
 379    return false;
 380  } else {
 381    memos = memos || {actual: [], expected: []};
 382
 383    var actualIndex = memos.actual.indexOf(actual);
 384    if (actualIndex !== -1) {
 385      if (actualIndex === memos.expected.indexOf(expected)) {
 386        return true;
 387      }
 388    }
 389
 390    memos.actual.push(actual);
 391    memos.expected.push(expected);
 392
 393    return objEquiv(actual, expected, strict, memos);
 394  }
 395}
 396
 397function isArguments(object) {
 398  return Object.prototype.toString.call(object) == '[object Arguments]';
 399}
 400
 401function objEquiv(a, b, strict, actualVisitedObjects) {
 402  if (a === null || a === undefined || b === null || b === undefined)
 403    return false;
 404  // if one is a primitive, the other must be same
 405  if (util.isPrimitive(a) || util.isPrimitive(b))
 406    return a === b;
 407  if (strict && Object.getPrototypeOf(a) !== Object.getPrototypeOf(b))
 408    return false;
 409  var aIsArgs = isArguments(a);
 410  var bIsArgs = isArguments(b);
 411  if ((aIsArgs && !bIsArgs) || (!aIsArgs && bIsArgs))
 412    return false;
 413  if (aIsArgs) {
 414    a = pSlice.call(a);
 415    b = pSlice.call(b);
 416    return _deepEqual(a, b, strict);
 417  }
 418  var ka = objectKeys(a);
 419  var kb = objectKeys(b);
 420  var key, i;
 421  // having the same number of owned properties (keys incorporates
 422  // hasOwnProperty)
 423  if (ka.length !== kb.length)
 424    return false;
 425  //the same set of keys (although not necessarily the same order),
 426  ka.sort();
 427  kb.sort();
 428  //~~~cheap key test
 429  for (i = ka.length - 1; i >= 0; i--) {
 430    if (ka[i] !== kb[i])
 431      return false;
 432  }
 433  //equivalent values for every corresponding key, and
 434  //~~~possibly expensive deep test
 435  for (i = ka.length - 1; i >= 0; i--) {
 436    key = ka[i];
 437    if (!_deepEqual(a[key], b[key], strict, actualVisitedObjects))
 438      return false;
 439  }
 440  return true;
 441}
 442
 443// 8. The non-equivalence assertion tests for any deep inequality.
 444// assert.notDeepEqual(actual, expected, message_opt);
 445
 446assert.notDeepEqual = function notDeepEqual(actual, expected, message) {
 447  if (_deepEqual(actual, expected, false)) {
 448    fail(actual, expected, message, 'notDeepEqual', assert.notDeepEqual);
 449  }
 450};
 451
 452assert.notDeepStrictEqual = notDeepStrictEqual;
 453function notDeepStrictEqual(actual, expected, message) {
 454  if (_deepEqual(actual, expected, true)) {
 455    fail(actual, expected, message, 'notDeepStrictEqual', notDeepStrictEqual);
 456  }
 457}
 458
 459
 460// 9. The strict equality assertion tests strict equality, as determined by ===.
 461// assert.strictEqual(actual, expected, message_opt);
 462
 463assert.strictEqual = function strictEqual(actual, expected, message) {
 464  if (actual !== expected) {
 465    fail(actual, expected, message, '===', assert.strictEqual);
 466  }
 467};
 468
 469// 10. The strict non-equality assertion tests for strict inequality, as
 470// determined by !==.  assert.notStrictEqual(actual, expected, message_opt);
 471
 472assert.notStrictEqual = function notStrictEqual(actual, expected, message) {
 473  if (actual === expected) {
 474    fail(actual, expected, message, '!==', assert.notStrictEqual);
 475  }
 476};
 477
 478function expectedException(actual, expected) {
 479  if (!actual || !expected) {
 480    return false;
 481  }
 482
 483  if (Object.prototype.toString.call(expected) == '[object RegExp]') {
 484    return expected.test(actual);
 485  }
 486
 487  try {
 488    if (actual instanceof expected) {
 489      return true;
 490    }
 491  } catch (e) {
 492    // Ignore.  The instanceof check doesn't work for arrow functions.
 493  }
 494
 495  if (Error.isPrototypeOf(expected)) {
 496    return false;
 497  }
 498
 499  return expected.call({}, actual) === true;
 500}
 501
 502function _tryBlock(block) {
 503  var error;
 504  try {
 505    block();
 506  } catch (e) {
 507    error = e;
 508  }
 509  return error;
 510}
 511
 512function _throws(shouldThrow, block, expected, message) {
 513  var actual;
 514
 515  if (typeof block !== 'function') {
 516    throw new TypeError('"block" argument must be a function');
 517  }
 518
 519  if (typeof expected === 'string') {
 520    message = expected;
 521    expected = null;
 522  }
 523
 524  actual = _tryBlock(block);
 525
 526  message = (expected && expected.name ? ' (' + expected.name + ').' : '.') +
 527            (message ? ' ' + message : '.');
 528
 529  if (shouldThrow && !actual) {
 530    fail(actual, expected, 'Missing expected exception' + message);
 531  }
 532
 533  var userProvidedMessage = typeof message === 'string';
 534  var isUnwantedException = !shouldThrow && util.isError(actual);
 535  var isUnexpectedException = !shouldThrow && actual && !expected;
 536
 537  if ((isUnwantedException &&
 538      userProvidedMessage &&
 539      expectedException(actual, expected)) ||
 540      isUnexpectedException) {
 541    fail(actual, expected, 'Got unwanted exception' + message);
 542  }
 543
 544  if ((shouldThrow && actual && expected &&
 545      !expectedException(actual, expected)) || (!shouldThrow && actual)) {
 546    throw actual;
 547  }
 548}
 549
 550// 11. Expected to throw an error:
 551// assert.throws(block, Error_opt, message_opt);
 552
 553assert.throws = function(block, /*optional*/error, /*optional*/message) {
 554  _throws(true, block, error, message);
 555};
 556
 557// EXTENSION! This is annoying to write outside this module.
 558assert.doesNotThrow = function(block, /*optional*/error, /*optional*/message) {
 559  _throws(false, block, error, message);
 560};
 561
 562assert.ifError = function(err) { if (err) throw err; };
 563
 564// Expose a strict only variant of assert
 565function strict(value, message) {
 566  if (!value) fail(value, true, message, '==', strict);
 567}
 568assert.strict = objectAssign(strict, assert, {
 569  equal: assert.strictEqual,
 570  deepEqual: assert.deepStrictEqual,
 571  notEqual: assert.notStrictEqual,
 572  notDeepEqual: assert.notDeepStrictEqual
 573});
 574assert.strict.strict = assert.strict;
 575
 576var objectKeys = Object.keys || function (obj) {
 577  var keys = [];
 578  for (var key in obj) {
 579    if (hasOwn.call(obj, key)) keys.push(key);
 580  }
 581  return keys;
 582};
 583
 584}).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
 585},{"object-assign":11,"util/":6}],4:[function(require,module,exports){
 586if (typeof Object.create === 'function') {
 587  // implementation from standard node.js 'util' module
 588  module.exports = function inherits(ctor, superCtor) {
 589    ctor.super_ = superCtor
 590    ctor.prototype = Object.create(superCtor.prototype, {
 591      constructor: {
 592        value: ctor,
 593        enumerable: false,
 594        writable: true,
 595        configurable: true
 596      }
 597    });
 598  };
 599} else {
 600  // old school shim for old browsers
 601  module.exports = function inherits(ctor, superCtor) {
 602    ctor.super_ = superCtor
 603    var TempCtor = function () {}
 604    TempCtor.prototype = superCtor.prototype
 605    ctor.prototype = new TempCtor()
 606    ctor.prototype.constructor = ctor
 607  }
 608}
 609
 610},{}],5:[function(require,module,exports){
 611module.exports = function isBuffer(arg) {
 612  return arg && typeof arg === 'object'
 613    && typeof arg.copy === 'function'
 614    && typeof arg.fill === 'function'
 615    && typeof arg.readUInt8 === 'function';
 616}
 617},{}],6:[function(require,module,exports){
 618(function (process,global){
 619// Copyright Joyent, Inc. and other Node contributors.
 620//
 621// Permission is hereby granted, free of charge, to any person obtaining a
 622// copy of this software and associated documentation files (the
 623// "Software"), to deal in the Software without restriction, including
 624// without limitation the rights to use, copy, modify, merge, publish,
 625// distribute, sublicense, and/or sell copies of the Software, and to permit
 626// persons to whom the Software is furnished to do so, subject to the
 627// following conditions:
 628//
 629// The above copyright notice and this permission notice shall be included
 630// in all copies or substantial portions of the Software.
 631//
 632// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
 633// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 634// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
 635// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
 636// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
 637// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
 638// USE OR OTHER DEALINGS IN THE SOFTWARE.
 639
 640var formatRegExp = /%[sdj%]/g;
 641exports.format = function(f) {
 642  if (!isString(f)) {
 643    var objects = [];
 644    for (var i = 0; i < arguments.length; i++) {
 645      objects.push(inspect(arguments[i]));
 646    }
 647    return objects.join(' ');
 648  }
 649
 650  var i = 1;
 651  var args = arguments;
 652  var len = args.length;
 653  var str = String(f).replace(formatRegExp, function(x) {
 654    if (x === '%%') return '%';
 655    if (i >= len) return x;
 656    switch (x) {
 657      case '%s': return String(args[i++]);
 658      case '%d': return Number(args[i++]);
 659      case '%j':
 660        try {
 661          return JSON.stringify(args[i++]);
 662        } catch (_) {
 663          return '[Circular]';
 664        }
 665      default:
 666        return x;
 667    }
 668  });
 669  for (var x = args[i]; i < len; x = args[++i]) {
 670    if (isNull(x) || !isObject(x)) {
 671      str += ' ' + x;
 672    } else {
 673      str += ' ' + inspect(x);
 674    }
 675  }
 676  return str;
 677};
 678
 679
 680// Mark that a method should not be used.
 681// Returns a modified function which warns once by default.
 682// If --no-deprecation is set, then it is a no-op.
 683exports.deprecate = function(fn, msg) {
 684  // Allow for deprecating things in the process of starting up.
 685  if (isUndefined(global.process)) {
 686    return function() {
 687      return exports.deprecate(fn, msg).apply(this, arguments);
 688    };
 689  }
 690
 691  if (process.noDeprecation === true) {
 692    return fn;
 693  }
 694
 695  var warned = false;
 696  function deprecated() {
 697    if (!warned) {
 698      if (process.throwDeprecation) {
 699        throw new Error(msg);
 700      } else if (process.traceDeprecation) {
 701        console.trace(msg);
 702      } else {
 703        console.error(msg);
 704      }
 705      warned = true;
 706    }
 707    return fn.apply(this, arguments);
 708  }
 709
 710  return deprecated;
 711};
 712
 713
 714var debugs = {};
 715var debugEnviron;
 716exports.debuglog = function(set) {
 717  if (isUndefined(debugEnviron))
 718    debugEnviron = process.env.NODE_DEBUG || '';
 719  set = set.toUpperCase();
 720  if (!debugs[set]) {
 721    if (new RegExp('\\b' + set + '\\b', 'i').test(debugEnviron)) {
 722      var pid = process.pid;
 723      debugs[set] = function() {
 724        var msg = exports.format.apply(exports, arguments);
 725        console.error('%s %d: %s', set, pid, msg);
 726      };
 727    } else {
 728      debugs[set] = function() {};
 729    }
 730  }
 731  return debugs[set];
 732};
 733
 734
 735/**
 736 * Echos the value of a value. Trys to print the value out
 737 * in the best way possible given the different types.
 738 *
 739 * @param {Object} obj The object to print out.
 740 * @param {Object} opts Optional options object that alters the output.
 741 */
 742/* legacy: obj, showHidden, depth, colors*/
 743function inspect(obj, opts) {
 744  // default options
 745  var ctx = {
 746    seen: [],
 747    stylize: stylizeNoColor
 748  };
 749  // legacy...
 750  if (arguments.length >= 3) ctx.depth = arguments[2];
 751  if (arguments.length >= 4) ctx.colors = arguments[3];
 752  if (isBoolean(opts)) {
 753    // legacy...
 754    ctx.showHidden = opts;
 755  } else if (opts) {
 756    // got an "options" object
 757    exports._extend(ctx, opts);
 758  }
 759  // set default options
 760  if (isUndefined(ctx.showHidden)) ctx.showHidden = false;
 761  if (isUndefined(ctx.depth)) ctx.depth = 2;
 762  if (isUndefined(ctx.colors)) ctx.colors = false;
 763  if (isUndefined(ctx.customInspect)) ctx.customInspect = true;
 764  if (ctx.colors) ctx.stylize = stylizeWithColor;
 765  return formatValue(ctx, obj, ctx.depth);
 766}
 767exports.inspect = inspect;
 768
 769
 770// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics
 771inspect.colors = {
 772  'bold' : [1, 22],
 773  'italic' : [3, 23],
 774  'underline' : [4, 24],
 775  'inverse' : [7, 27],
 776  'white' : [37, 39],
 777  'grey' : [90, 39],
 778  'black' : [30, 39],
 779  'blue' : [34, 39],
 780  'cyan' : [36, 39],
 781  'green' : [32, 39],
 782  'magenta' : [35, 39],
 783  'red' : [31, 39],
 784  'yellow' : [33, 39]
 785};
 786
 787// Don't use 'blue' not visible on cmd.exe
 788inspect.styles = {
 789  'special': 'cyan',
 790  'number': 'yellow',
 791  'boolean': 'yellow',
 792  'undefined': 'grey',
 793  'null': 'bold',
 794  'string': 'green',
 795  'date': 'magenta',
 796  // "name": intentionally not styling
 797  'regexp': 'red'
 798};
 799
 800
 801function stylizeWithColor(str, styleType) {
 802  var style = inspect.styles[styleType];
 803
 804  if (style) {
 805    return '\u001b[' + inspect.colors[style][0] + 'm' + str +
 806           '\u001b[' + inspect.colors[style][1] + 'm';
 807  } else {
 808    return str;
 809  }
 810}
 811
 812
 813function stylizeNoColor(str, styleType) {
 814  return str;
 815}
 816
 817
 818function arrayToHash(array) {
 819  var hash = {};
 820
 821  array.forEach(function(val, idx) {
 822    hash[val] = true;
 823  });
 824
 825  return hash;
 826}
 827
 828
 829function formatValue(ctx, value, recurseTimes) {
 830  // Provide a hook for user-specified inspect functions.
 831  // Check that value is an object with an inspect function on it
 832  if (ctx.customInspect &&
 833      value &&
 834      isFunction(value.inspect) &&
 835      // Filter out the util module, it's inspect function is special
 836      value.inspect !== exports.inspect &&
 837      // Also filter out any prototype objects using the circular check.
 838      !(value.constructor && value.constructor.prototype === value)) {
 839    var ret = value.inspect(recurseTimes, ctx);
 840    if (!isString(ret)) {
 841      ret = formatValue(ctx, ret, recurseTimes);
 842    }
 843    return ret;
 844  }
 845
 846  // Primitive types cannot have properties
 847  var primitive = formatPrimitive(ctx, value);
 848  if (primitive) {
 849    return primitive;
 850  }
 851
 852  // Look up the keys of the object.
 853  var keys = Object.keys(value);
 854  var visibleKeys = arrayToHash(keys);
 855
 856  if (ctx.showHidden) {
 857    keys = Object.getOwnPropertyNames(value);
 858  }
 859
 860  // IE doesn't make error fields non-enumerable
 861  // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx
 862  if (isError(value)
 863      && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {
 864    return formatError(value);
 865  }
 866
 867  // Some type of object without properties can be shortcutted.
 868  if (keys.length === 0) {
 869    if (isFunction(value)) {
 870      var name = value.name ? ': ' + value.name : '';
 871      return ctx.stylize('[Function' + name + ']', 'special');
 872    }
 873    if (isRegExp(value)) {
 874      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');
 875    }
 876    if (isDate(value)) {
 877      return ctx.stylize(Date.prototype.toString.call(value), 'date');
 878    }
 879    if (isError(value)) {
 880      return formatError(value);
 881    }
 882  }
 883
 884  var base = '', array = false, braces = ['{', '}'];
 885
 886  // Make Array say that they are Array
 887  if (isArray(value)) {
 888    array = true;
 889    braces = ['[', ']'];
 890  }
 891
 892  // Make functions say that they are functions
 893  if (isFunction(value)) {
 894    var n = value.name ? ': ' + value.name : '';
 895    base = ' [Function' + n + ']';
 896  }
 897
 898  // Make RegExps say that they are RegExps
 899  if (isRegExp(value)) {
 900    base = ' ' + RegExp.prototype.toString.call(value);
 901  }
 902
 903  // Make dates with properties first say the date
 904  if (isDate(value)) {
 905    base = ' ' + Date.prototype.toUTCString.call(value);
 906  }
 907
 908  // Make error with message first say the error
 909  if (isError(value)) {
 910    base = ' ' + formatError(value);
 911  }
 912
 913  if (keys.length === 0 && (!array || value.length == 0)) {
 914    return braces[0] + base + braces[1];
 915  }
 916
 917  if (recurseTimes < 0) {
 918    if (isRegExp(value)) {
 919      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');
 920    } else {
 921      return ctx.stylize('[Object]', 'special');
 922    }
 923  }
 924
 925  ctx.seen.push(value);
 926
 927  var output;
 928  if (array) {
 929    output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);
 930  } else {
 931    output = keys.map(function(key) {
 932      return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);
 933    });
 934  }
 935
 936  ctx.seen.pop();
 937
 938  return reduceToSingleString(output, base, braces);
 939}
 940
 941
 942function formatPrimitive(ctx, value) {
 943  if (isUndefined(value))
 944    return ctx.stylize('undefined', 'undefined');
 945  if (isString(value)) {
 946    var simple = '\'' + JSON.stringify(value).replace(/^"|"$/g, '')
 947                                             .replace(/'/g, "\\'")
 948                                             .replace(/\\"/g, '"') + '\'';
 949    return ctx.stylize(simple, 'string');
 950  }
 951  if (isNumber(value))
 952    return ctx.stylize('' + value, 'number');
 953  if (isBoolean(value))
 954    return ctx.stylize('' + value, 'boolean');
 955  // For some reason typeof null is "object", so special case here.
 956  if (isNull(value))
 957    return ctx.stylize('null', 'null');
 958}
 959
 960
 961function formatError(value) {
 962  return '[' + Error.prototype.toString.call(value) + ']';
 963}
 964
 965
 966function formatArray(ctx, value, recurseTimes, visibleKeys, keys) {
 967  var output = [];
 968  for (var i = 0, l = value.length; i < l; ++i) {
 969    if (hasOwnProperty(value, String(i))) {
 970      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,
 971          String(i), true));
 972    } else {
 973      output.push('');
 974    }
 975  }
 976  keys.forEach(function(key) {
 977    if (!key.match(/^\d+$/)) {
 978      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,
 979          key, true));
 980    }
 981  });
 982  return output;
 983}
 984
 985
 986function formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {
 987  var name, str, desc;
 988  desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };
 989  if (desc.get) {
 990    if (desc.set) {
 991      str = ctx.stylize('[Getter/Setter]', 'special');
 992    } else {
 993      str = ctx.stylize('[Getter]', 'special');
 994    }
 995  } else {
 996    if (desc.set) {
 997      str = ctx.stylize('[Setter]', 'special');
 998    }
 999  }
1000  if (!hasOwnProperty(visibleKeys, key)) {
1001    name = '[' + key + ']';
1002  }
1003  if (!str) {
1004    if (ctx.seen.indexOf(desc.value) < 0) {
1005      if (isNull(recurseTimes)) {
1006        str = formatValue(ctx, desc.value, null);
1007      } else {
1008        str = formatValue(ctx, desc.value, recurseTimes - 1);
1009      }
1010      if (str.indexOf('\n') > -1) {
1011        if (array) {
1012          str = str.split('\n').map(function(line) {
1013            return '  ' + line;
1014          }).join('\n').substr(2);
1015        } else {
1016          str = '\n' + str.split('\n').map(function(line) {
1017            return '   ' + line;
1018          }).join('\n');
1019        }
1020      }
1021    } else {
1022      str = ctx.stylize('[Circular]', 'special');
1023    }
1024  }
1025  if (isUndefined(name)) {
1026    if (array && key.match(/^\d+$/)) {
1027      return str;
1028    }
1029    name = JSON.stringify('' + key);
1030    if (name.match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)) {
1031      name = name.substr(1, name.length - 2);
1032      name = ctx.stylize(name, 'name');
1033    } else {
1034      name = name.replace(/'/g, "\\'")
1035                 .replace(/\\"/g, '"')
1036                 .replace(/(^"|"$)/g, "'");
1037      name = ctx.stylize(name, 'string');
1038    }
1039  }
1040
1041  return name + ': ' + str;
1042}
1043
1044
1045function reduceToSingleString(output, base, braces) {
1046  var numLinesEst = 0;
1047  var length = output.reduce(function(prev, cur) {
1048    numLinesEst++;
1049    if (cur.indexOf('\n') >= 0) numLinesEst++;
1050    return prev + cur.replace(/\u001b\[\d\d?m/g, '').length + 1;
1051  }, 0);
1052
1053  if (length > 60) {
1054    return braces[0] +
1055           (base === '' ? '' : base + '\n ') +
1056           ' ' +
1057           output.join(',\n  ') +
1058           ' ' +
1059           braces[1];
1060  }
1061
1062  return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];
1063}
1064
1065
1066// NOTE: These type checking functions intentionally don't use `instanceof`
1067// because it is fragile and can be easily faked with `Object.create()`.
1068function isArray(ar) {
1069  return Array.isArray(ar);
1070}
1071exports.isArray = isArray;
1072
1073function isBoolean(arg) {
1074  return typeof arg === 'boolean';
1075}
1076exports.isBoolean = isBoolean;
1077
1078function isNull(arg) {
1079  return arg === null;
1080}
1081exports.isNull = isNull;
1082
1083function isNullOrUndefined(arg) {
1084  return arg == null;
1085}
1086exports.isNullOrUndefined = isNullOrUndefined;
1087
1088function isNumber(arg) {
1089  return typeof arg === 'number';
1090}
1091exports.isNumber = isNumber;
1092
1093function isString(arg) {
1094  return typeof arg === 'string';
1095}
1096exports.isString = isString;
1097
1098function isSymbol(arg) {
1099  return typeof arg === 'symbol';
1100}
1101exports.isSymbol = isSymbol;
1102
1103function isUndefined(arg) {
1104  return arg === void 0;
1105}
1106exports.isUndefined = isUndefined;
1107
1108function isRegExp(re) {
1109  return isObject(re) && objectToString(re) === '[object RegExp]';
1110}
1111exports.isRegExp = isRegExp;
1112
1113function isObject(arg) {
1114  return typeof arg === 'object' && arg !== null;
1115}
1116exports.isObject = isObject;
1117
1118function isDate(d) {
1119  return isObject(d) && objectToString(d) === '[object Date]';
1120}
1121exports.isDate = isDate;
1122
1123function isError(e) {
1124  return isObject(e) &&
1125      (objectToString(e) === '[object Error]' || e instanceof Error);
1126}
1127exports.isError = isError;
1128
1129function isFunction(arg) {
1130  return typeof arg === 'function';
1131}
1132exports.isFunction = isFunction;
1133
1134function isPrimitive(arg) {
1135  return arg === null ||
1136         typeof arg === 'boolean' ||
1137         typeof arg === 'number' ||
1138         typeof arg === 'string' ||
1139         typeof arg === 'symbol' ||  // ES6 symbol
1140         typeof arg === 'undefined';
1141}
1142exports.isPrimitive = isPrimitive;
1143
1144exports.isBuffer = require('./support/isBuffer');
1145
1146function objectToString(o) {
1147  return Object.prototype.toString.call(o);
1148}
1149
1150
1151function pad(n) {
1152  return n < 10 ? '0' + n.toString(10) : n.toString(10);
1153}
1154
1155
1156var months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep',
1157              'Oct', 'Nov', 'Dec'];
1158
1159// 26 Feb 16:19:34
1160function timestamp() {
1161  var d = new Date();
1162  var time = [pad(d.getHours()),
1163              pad(d.getMinutes()),
1164              pad(d.getSeconds())].join(':');
1165  return [d.getDate(), months[d.getMonth()], time].join(' ');
1166}
1167
1168
1169// log is just a thin wrapper to console.log that prepends a timestamp
1170exports.log = function() {
1171  console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments));
1172};
1173
1174
1175/**
1176 * Inherit the prototype methods from one constructor into another.
1177 *
1178 * The Function.prototype.inherits from lang.js rewritten as a standalone
1179 * function (not on Function.prototype). NOTE: If this file is to be loaded
1180 * during bootstrapping this function needs to be rewritten using some native
1181 * functions as prototype setup using normal JavaScript does not work as
1182 * expected during bootstrapping (see mirror.js in r114903).
1183 *
1184 * @param {function} ctor Constructor function which needs to inherit the
1185 *     prototype.
1186 * @param {function} superCtor Constructor function to inherit prototype from.
1187 */
1188exports.inherits = require('inherits');
1189
1190exports._extend = function(origin, add) {
1191  // Don't do anything if add isn't an object
1192  if (!add || !isObject(add)) return origin;
1193
1194  var keys = Object.keys(add);
1195  var i = keys.length;
1196  while (i--) {
1197    origin[keys[i]] = add[keys[i]];
1198  }
1199  return origin;
1200};
1201
1202function hasOwnProperty(obj, prop) {
1203  return Object.prototype.hasOwnProperty.call(obj, prop);
1204}
1205
1206}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
1207},{"./support/isBuffer":5,"_process":12,"inherits":4}],7:[function(require,module,exports){
1208'use strict'
1209
1210exports.byteLength = byteLength
1211exports.toByteArray = toByteArray
1212exports.fromByteArray = fromByteArray
1213
1214var lookup = []
1215var revLookup = []
1216var Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array
1217
1218var code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'
1219for (var i = 0, len = code.length; i < len; ++i) {
1220  lookup[i] = code[i]
1221  revLookup[code.charCodeAt(i)] = i
1222}
1223
1224// Support decoding URL-safe base64 strings, as Node.js does.
1225// See: https://en.wikipedia.org/wiki/Base64#URL_applications
1226revLookup['-'.charCodeAt(0)] = 62
1227revLookup['_'.charCodeAt(0)] = 63
1228
1229function getLens (b64) {
1230  var len = b64.length
1231
1232  if (len % 4 > 0) {
1233    throw new Error('Invalid string. Length must be a multiple of 4')
1234  }
1235
1236  // Trim off extra bytes after placeholder bytes are found
1237  // See: https://github.com/beatgammit/base64-js/issues/42
1238  var validLen = b64.indexOf('=')
1239  if (validLen === -1) validLen = len
1240
1241  var placeHoldersLen = validLen === len
1242    ? 0
1243    : 4 - (validLen % 4)
1244
1245  return [validLen, placeHoldersLen]
1246}
1247
1248// base64 is 4/3 + up to two characters of the original data
1249function byteLength (b64) {
1250  var lens = getLens(b64)
1251  var validLen = lens[0]
1252  var placeHoldersLen = lens[1]
1253  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen
1254}
1255
1256function _byteLength (b64, validLen, placeHoldersLen) {
1257  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen
1258}
1259
1260function toByteArray (b64) {
1261  var tmp
1262  var lens = getLens(b64)
1263  var validLen = lens[0]
1264  var placeHoldersLen = lens[1]
1265
1266  var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))
1267
1268  var curByte = 0
1269
1270  // if there are placeholders, only get up to the last complete 4 chars
1271  var len = placeHoldersLen > 0
1272    ? validLen - 4
1273    : validLen
1274
1275  var i
1276  for (i = 0; i < len; i += 4) {
1277    tmp =
1278      (revLookup[b64.charCodeAt(i)] << 18) |
1279      (revLookup[b64.charCodeAt(i + 1)] << 12) |
1280      (revLookup[b64.charCodeAt(i + 2)] << 6) |
1281      revLookup[b64.charCodeAt(i + 3)]
1282    arr[curByte++] = (tmp >> 16) & 0xFF
1283    arr[curByte++] = (tmp >> 8) & 0xFF
1284    arr[curByte++] = tmp & 0xFF
1285  }
1286
1287  if (placeHoldersLen === 2) {
1288    tmp =
1289      (revLookup[b64.charCodeAt(i)] << 2) |
1290      (revLookup[b64.charCodeAt(i + 1)] >> 4)
1291    arr[curByte++] = tmp & 0xFF
1292  }
1293
1294  if (placeHoldersLen === 1) {
1295    tmp =
1296      (revLookup[b64.charCodeAt(i)] << 10) |
1297      (revLookup[b64.charCodeAt(i + 1)] << 4) |
1298      (revLookup[b64.charCodeAt(i + 2)] >> 2)
1299    arr[curByte++] = (tmp >> 8) & 0xFF
1300    arr[curByte++] = tmp & 0xFF
1301  }
1302
1303  return arr
1304}
1305
1306function tripletToBase64 (num) {
1307  return lookup[num >> 18 & 0x3F] +
1308    lookup[num >> 12 & 0x3F] +
1309    lookup[num >> 6 & 0x3F] +
1310    lookup[num & 0x3F]
1311}
1312
1313function encodeChunk (uint8, start, end) {
1314  var tmp
1315  var output = []
1316  for (var i = start; i < end; i += 3) {
1317    tmp =
1318      ((uint8[i] << 16) & 0xFF0000) +
1319      ((uint8[i + 1] << 8) & 0xFF00) +
1320      (uint8[i + 2] & 0xFF)
1321    output.push(tripletToBase64(tmp))
1322  }
1323  return output.join('')
1324}
1325
1326function fromByteArray (uint8) {
1327  var tmp
1328  var len = uint8.length
1329  var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes
1330  var parts = []
1331  var maxChunkLength = 16383 // must be multiple of 3
1332
1333  // go through the array every three bytes, we'll deal with trailing stuff later
1334  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {
1335    parts.push(encodeChunk(
1336      uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)
1337    ))
1338  }
1339
1340  // pad the end with zeros, but make sure to not forget the extra bytes
1341  if (extraBytes === 1) {
1342    tmp = uint8[len - 1]
1343    parts.push(
1344      lookup[tmp >> 2] +
1345      lookup[(tmp << 4) & 0x3F] +
1346      '=='
1347    )
1348  } else if (extraBytes === 2) {
1349    tmp = (uint8[len - 2] << 8) + uint8[len - 1]
1350    parts.push(
1351      lookup[tmp >> 10] +
1352      lookup[(tmp >> 4) & 0x3F] +
1353      lookup[(tmp << 2) & 0x3F] +
1354      '='
1355    )
1356  }
1357
1358  return parts.join('')
1359}
1360
1361},{}],8:[function(require,module,exports){
1362var bigInt = (function (undefined) {
1363    "use strict";
1364
1365    var BASE = 1e7,
1366        LOG_BASE = 7,
1367        MAX_INT = 9007199254740992,
1368        MAX_INT_ARR = smallToArray(MAX_INT),
1369        DEFAULT_ALPHABET = "0123456789abcdefghijklmnopqrstuvwxyz";
1370
1371    var supportsNativeBigInt = typeof BigInt === "function";
1372
1373    function Integer(v, radix, alphabet, caseSensitive) {
1374        if (typeof v === "undefined") return Integer[0];
1375        if (typeof radix !== "undefined") return +radix === 10 && !alphabet ? parseValue(v) : parseBase(v, radix, alphabet, caseSensitive);
1376        return parseValue(v);
1377    }
1378
1379    function BigInteger(value, sign) {
1380        this.value = value;
1381        this.sign = sign;
1382        this.isSmall = false;
1383    }
1384    BigInteger.prototype = Object.create(Integer.prototype);
1385
1386    function SmallInteger(value) {
1387        this.value = value;
1388        this.sign = value < 0;
1389        this.isSmall = true;
1390    }
1391    SmallInteger.prototype = Object.create(Integer.prototype);
1392
1393    function NativeBigInt(value) {
1394        this.value = value;
1395    }
1396    NativeBigInt.prototype = Object.create(Integer.prototype);
1397
1398    function isPrecise(n) {
1399        return -MAX_INT < n && n < MAX_INT;
1400    }
1401
1402    function smallToArray(n) { // For performance reasons doesn't reference BASE, need to change this function if BASE changes
1403        if (n < 1e7)
1404            return [n];
1405        if (n < 1e14)
1406            return [n % 1e7, Math.floor(n / 1e7)];
1407        return [n % 1e7, Math.floor(n / 1e7) % 1e7, Math.floor(n / 1e14)];
1408    }
1409
1410    function arrayToSmall(arr) { // If BASE changes this function may need to change
1411        trim(arr);
1412        var length = arr.length;
1413        if (length < 4 && compareAbs(arr, MAX_INT_ARR) < 0) {
1414            switch (length) {
1415                case 0: return 0;
1416                case 1: return arr[0];
1417                case 2: return arr[0] + arr[1] * BASE;
1418                default: return arr[0] + (arr[1] + arr[2] * BASE) * BASE;
1419            }
1420        }
1421        return arr;
1422    }
1423
1424    function trim(v) {
1425        var i = v.length;
1426        while (v[--i] === 0);
1427        v.length = i + 1;
1428    }
1429
1430    function createArray(length) { // function shamelessly stolen from Yaffle's library https://github.com/Yaffle/BigInteger
1431        var x = new Array(length);
1432        var i = -1;
1433        while (++i < length) {
1434            x[i] = 0;
1435        }
1436        return x;
1437    }
1438
1439    function truncate(n) {
1440        if (n > 0) return Math.floor(n);
1441        return Math.ceil(n);
1442    }
1443
1444    function add(a, b) { // assumes a and b are arrays with a.length >= b.length
1445        var l_a = a.length,
1446            l_b = b.length,
1447            r = new Array(l_a),
1448            carry = 0,
1449            base = BASE,
1450            sum, i;
1451        for (i = 0; i < l_b; i++) {
1452            sum = a[i] + b[i] + carry;
1453            carry = sum >= base ? 1 : 0;
1454            r[i] = sum - carry * base;
1455        }
1456        while (i < l_a) {
1457            sum = a[i] + carry;
1458            carry = sum === base ? 1 : 0;
1459            r[i++] = sum - carry * base;
1460        }
1461        if (carry > 0) r.push(carry);
1462        return r;
1463    }
1464
1465    function addAny(a, b) {
1466        if (a.length >= b.length) return add(a, b);
1467        return add(b, a);
1468    }
1469
1470    function addSmall(a, carry) { // assumes a is array, carry is number with 0 <= carry < MAX_INT
1471        var l = a.length,
1472            r = new Array(l),
1473            base = BASE,
1474            sum, i;
1475        for (i = 0; i < l; i++) {
1476            sum = a[i] - base + carry;
1477            carry = Math.floor(sum / base);
1478            r[i] = sum - carry * base;
1479            carry += 1;
1480        }
1481        while (carry > 0) {
1482            r[i++] = carry % base;
1483            carry = Math.floor(carry / base);
1484        }
1485        return r;
1486    }
1487
1488    BigInteger.prototype.add = function (v) {
1489        var n = parseValue(v);
1490        if (this.sign !== n.sign) {
1491            return this.subtract(n.negate());
1492        }
1493        var a = this.value, b = n.value;
1494        if (n.isSmall) {
1495            return new BigInteger(addSmall(a, Math.abs(b)), this.sign);
1496        }
1497        return new BigInteger(addAny(a, b), this.sign);
1498    };
1499    BigInteger.prototype.plus = BigInteger.prototype.add;
1500
1501    SmallInteger.prototype.add = function (v) {
1502        var n = parseValue(v);
1503        var a = this.value;
1504        if (a < 0 !== n.sign) {
1505            return this.subtract(n.negate());
1506        }
1507        var b = n.value;
1508        if (n.isSmall) {
1509            if (isPrecise(a + b)) return new SmallInteger(a + b);
1510            b = smallToArray(Math.abs(b));
1511        }
1512        return new BigInteger(addSmall(b, Math.abs(a)), a < 0);
1513    };
1514    SmallInteger.prototype.plus = SmallInteger.prototype.add;
1515
1516    NativeBigInt.prototype.add = function (v) {
1517        return new NativeBigInt(this.value + parseValue(v).value);
1518    }
1519    NativeBigInt.prototype.plus = NativeBigInt.prototype.add;
1520
1521    function subtract(a, b) { // assumes a and b are arrays with a >= b
1522        var a_l = a.length,
1523            b_l = b.length,
1524            r = new Array(a_l),
1525            borrow = 0,
1526            base = BASE,
1527            i, difference;
1528        for (i = 0; i < b_l; i++) {
1529            difference = a[i] - borrow - b[i];
1530            if (difference < 0) {
1531                difference += base;
1532                borrow = 1;
1533            } else borrow = 0;
1534            r[i] = difference;
1535        }
1536        for (i = b_l; i < a_l; i++) {
1537            difference = a[i] - borrow;
1538            if (difference < 0) difference += base;
1539            else {
1540                r[i++] = difference;
1541                break;
1542            }
1543            r[i] = difference;
1544        }
1545        for (; i < a_l; i++) {
1546            r[i] = a[i];
1547        }
1548        trim(r);
1549        return r;
1550    }
1551
1552    function subtractAny(a, b, sign) {
1553        var value;
1554        if (compareAbs(a, b) >= 0) {
1555            value = subtract(a, b);
1556        } else {
1557            value = subtract(b, a);
1558            sign = !sign;
1559        }
1560        value = arrayToSmall(value);
1561        if (typeof value === "number") {
1562            if (sign) value = -value;
1563            return new SmallInteger(value);
1564        }
1565        return new BigInteger(value, sign);
1566    }
1567
1568    function subtractSmall(a, b, sign) { // assumes a is array, b is number with 0 <= b < MAX_INT
1569        var l = a.length,
1570            r = new Array(l),
1571            carry = -b,
1572            base = BASE,
1573            i, difference;
1574        for (i = 0; i < l; i++) {
1575            difference = a[i] + carry;
1576            carry = Math.floor(difference / base);
1577            difference %= base;
1578            r[i] = difference < 0 ? difference + base : difference;
1579        }
1580        r = arrayToSmall(r);
1581        if (typeof r === "number") {
1582            if (sign) r = -r;
1583            return new SmallInteger(r);
1584        } return new BigInteger(r, sign);
1585    }
1586
1587    BigInteger.prototype.subtract = function (v) {
1588        var n = parseValue(v);
1589        if (this.sign !== n.sign) {
1590            return this.add(n.negate());
1591        }
1592        var a = this.value, b = n.value;
1593        if (n.isSmall)
1594            return subtractSmall(a, Math.abs(b), this.sign);
1595        return subtractAny(a, b, this.sign);
1596    };
1597    BigInteger.prototype.minus = BigInteger.prototype.subtract;
1598
1599    SmallInteger.prototype.subtract = function (v) {
1600        var n = parseValue(v);
1601        var a = this.value;
1602        if (a < 0 !== n.sign) {
1603            return this.add(n.negate());
1604        }
1605        var b = n.value;
1606        if (n.isSmall) {
1607            return new SmallInteger(a - b);
1608        }
1609        return subtractSmall(b, Math.abs(a), a >= 0);
1610    };
1611    SmallInteger.prototype.minus = SmallInteger.prototype.subtract;
1612
1613    NativeBigInt.prototype.subtract = function (v) {
1614        return new NativeBigInt(this.value - parseValue(v).value);
1615    }
1616    NativeBigInt.prototype.minus = NativeBigInt.prototype.subtract;
1617
1618    BigInteger.prototype.negate = function () {
1619        return new BigInteger(this.value, !this.sign);
1620    };
1621    SmallInteger.prototype.negate = function () {
1622        var sign = this.sign;
1623        var small = new SmallInteger(-this.value);
1624        small.sign = !sign;
1625        return small;
1626    };
1627    NativeBigInt.prototype.negate = function () {
1628        return new NativeBigInt(-this.value);
1629    }
1630
1631    BigInteger.prototype.abs = function () {
1632        return new BigInteger(this.value, false);
1633    };
1634    SmallInteger.prototype.abs = function () {
1635        return new SmallInteger(Math.abs(this.value));
1636    };
1637    NativeBigInt.prototype.abs = function () {
1638        return new NativeBigInt(this.value >= 0 ? this.value : -this.value);
1639    }
1640
1641
1642    function multiplyLong(a, b) {
1643        var a_l = a.length,
1644            b_l = b.length,
1645            l = a_l + b_l,
1646            r = createArray(l),
1647            base = BASE,
1648            product, carry, i, a_i, b_j;
1649        for (i = 0; i < a_l; ++i) {
1650            a_i = a[i];
1651            for (var j = 0; j < b_l; ++j) {
1652                b_j = b[j];
1653                product = a_i * b_j + r[i + j];
1654                carry = Math.floor(product / base);
1655                r[i + j] = product - carry * base;
1656                r[i + j + 1] += carry;
1657            }
1658        }
1659        trim(r);
1660        return r;
1661    }
1662
1663    function multiplySmall(a, b) { // assumes a is array, b is number with |b| < BASE
1664        var l = a.length,
1665            r = new Array(l),
1666            base = BASE,
1667            carry = 0,
1668            product, i;
1669        for (i = 0; i < l; i++) {
1670            product = a[i] * b + carry;
1671            carry = Math.floor(product / base);
1672            r[i] = product - carry * base;
1673        }
1674        while (carry > 0) {
1675            r[i++] = carry % base;
1676            carry = Math.floor(carry / base);
1677        }
1678        return r;
1679    }
1680
1681    function shiftLeft(x, n) {
1682        var r = [];
1683        while (n-- > 0) r.push(0);
1684        return r.concat(x);
1685    }
1686
1687    function multiplyKaratsuba(x, y) {
1688        var n = Math.max(x.length, y.length);
1689
1690        if (n <= 30) return multiplyLong(x, y);
1691        n = Math.ceil(n / 2);
1692
1693        var b = x.slice(n),
1694            a = x.slice(0, n),
1695            d = y.slice(n),
1696            c = y.slice(0, n);
1697
1698        var ac = multiplyKaratsuba(a, c),
1699            bd = multiplyKaratsuba(b, d),
1700            abcd = multiplyKaratsuba(addAny(a, b), addAny(c, d));
1701
1702        var product = addAny(addAny(ac, shiftLeft(subtract(subtract(abcd, ac), bd), n)), shiftLeft(bd, 2 * n));
1703        trim(product);
1704        return product;
1705    }
1706
1707    // The following function is derived from a surface fit of a graph plotting the performance difference
1708    // between long multiplication and karatsuba multiplication versus the lengths of the two arrays.
1709    function useKaratsuba(l1, l2) {
1710        return -0.012 * l1 - 0.012 * l2 + 0.000015 * l1 * l2 > 0;
1711    }
1712
1713    BigInteger.prototype.multiply = function (v) {
1714        var n = parseValue(v),
1715            a = this.value, b = n.value,
1716            sign = this.sign !== n.sign,
1717            abs;
1718        if (n.isSmall) {
1719            if (b === 0) return Integer[0];
1720            if (b === 1) return this;
1721            if (b === -1) return this.negate();
1722            abs = Math.abs(b);
1723            if (abs < BASE) {
1724                return new BigInteger(multiplySmall(a, abs), sign);
1725            }
1726            b = smallToArray(abs);
1727        }
1728        if (useKaratsuba(a.length, b.length)) // Karatsuba is only faster for certain array sizes
1729            return new BigInteger(multiplyKaratsuba(a, b), sign);
1730        return new BigInteger(multiplyLong(a, b), sign);
1731    };
1732
1733    BigInteger.prototype.times = BigInteger.prototype.multiply;
1734
1735    function multiplySmallAndArray(a, b, sign) { // a >= 0
1736        if (a < BASE) {
1737            return new BigInteger(multiplySmall(b, a), sign);
1738        }
1739        return new BigInteger(multiplyLong(b, smallToArray(a)), sign);
1740    }
1741    SmallInteger.prototype._multiplyBySmall = function (a) {
1742        if (isPrecise(a.value * this.value)) {
1743            return new SmallInteger(a.value * this.value);
1744        }
1745        return multiplySmallAndArray(Math.abs(a.value), smallToArray(Math.abs(this.value)), this.sign !== a.sign);
1746    };
1747    BigInteger.prototype._multiplyBySmall = function (a) {
1748        if (a.value === 0) return Integer[0];
1749        if (a.value === 1) return this;
1750        if (a.value === -1) return this.negate();
1751        return multiplySmallAndArray(Math.abs(a.value), this.value, this.sign !== a.sign);
1752    };
1753    SmallInteger.prototype.multiply = function (v) {
1754        return parseValue(v)._multiplyBySmall(this);
1755    };
1756    SmallInteger.prototype.times = SmallInteger.prototype.multiply;
1757
1758    NativeBigInt.prototype.multiply = function (v) {
1759        return new NativeBigInt(this.value * parseValue(v).value);
1760    }
1761    NativeBigInt.prototype.times = NativeBigInt.prototype.multiply;
1762
1763    function square(a) {
1764        //console.assert(2 * BASE * BASE < MAX_INT);
1765        var l = a.length,
1766            r = createArray(l + l),
1767            base = BASE,
1768            product, carry, i, a_i, a_j;
1769        for (i = 0; i < l; i++) {
1770            a_i = a[i];
1771            carry = 0 - a_i * a_i;
1772            for (var j = i; j < l; j++) {
1773                a_j = a[j];
1774                product = 2 * (a_i * a_j) + r[i + j] + carry;
1775                carry = Math.floor(product / base);
1776                r[i + j] = product - carry * base;
1777            }
1778            r[i + l] = carry;
1779        }
1780        trim(r);
1781        return r;
1782    }
1783
1784    BigInteger.prototype.square = function () {
1785        return new BigInteger(square(this.value), false);
1786    };
1787
1788    SmallInteger.prototype.square = function () {
1789        var value = this.value * this.value;
1790        if (isPrecise(value)) return new SmallInteger(value);
1791        return new BigInteger(square(smallToArray(Math.abs(this.value))), false);
1792    };
1793
1794    NativeBigInt.prototype.square = function (v) {
1795        return new NativeBigInt(this.value * this.value);
1796    }
1797
1798    function divMod1(a, b) { // Left over from previous version. Performs faster than divMod2 on smaller input sizes.
1799        var a_l = a.length,
1800            b_l = b.length,
1801            base = BASE,
1802            result = createArray(b.length),
1803            divisorMostSignificantDigit = b[b_l - 1],
1804            // normalization
1805            lambda = Math.ceil(base / (2 * divisorMostSignificantDigit)),
1806            remainder = multiplySmall(a, lambda),
1807            divisor = multiplySmall(b, lambda),
1808            quotientDigit, shift, carry, borrow, i, l, q;
1809        if (remainder.length <= a_l) remainder.push(0);
1810        divisor.push(0);
1811        divisorMostSignificantDigit = divisor[b_l - 1];
1812        for (shift = a_l - b_l; shift >= 0; shift--) {
1813            quotientDigit = base - 1;
1814            if (remainder[shift + b_l] !== divisorMostSignificantDigit) {
1815                quotientDigit = Math.floor((remainder[shift + b_l] * base + remainder[shift + b_l - 1]) / divisorMostSignificantDigit);
1816            }
1817            // quotientDigit <= base - 1
1818            carry = 0;
1819            borrow = 0;
1820            l = divisor.length;
1821            for (i = 0; i < l; i++) {
1822                carry += quotientDigit * divisor[i];
1823                q = Math.floor(carry / base);
1824                borrow += remainder[shift + i] - (carry - q * base);
1825                carry = q;
1826                if (borrow < 0) {
1827                    remainder[shift + i] = borrow + base;
1828                    borrow = -1;
1829                } else {
1830                    remainder[shift + i] = borrow;
1831                    borrow = 0;
1832                }
1833            }
1834            while (borrow !== 0) {
1835                quotientDigit -= 1;
1836                carry = 0;
1837                for (i = 0; i < l; i++) {
1838                    carry += remainder[shift + i] - base + divisor[i];
1839                    if (carry < 0) {
1840                        remainder[shift + i] = carry + base;
1841                        carry = 0;
1842                    } else {
1843                        remainder[shift + i] = carry;
1844                        carry = 1;
1845                    }
1846                }
1847                borrow += carry;
1848            }
1849            result[shift] = quotientDigit;
1850        }
1851        // denormalization
1852        remainder = divModSmall(remainder, lambda)[0];
1853        return [arrayToSmall(result), arrayToSmall(remainder)];
1854    }
1855
1856    function divMod2(a, b) { // Implementation idea shamelessly stolen from Silent Matt's library http://silentmatt.com/biginteger/
1857        // Performs faster than divMod1 on larger input sizes.
1858        var a_l = a.length,
1859            b_l = b.length,
1860            result = [],
1861            part = [],
1862            base = BASE,
1863            guess, xlen, highx, highy, check;
1864        while (a_l) {
1865            part.unshift(a[--a_l]);
1866            trim(part);
1867            if (compareAbs(part, b) < 0) {
1868                result.push(0);
1869                continue;
1870            }
1871            xlen = part.length;
1872            highx = part[xlen - 1] * base + part[xlen - 2];
1873            highy = b[b_l - 1] * base + b[b_l - 2];
1874            if (xlen > b_l) {
1875                highx = (highx + 1) * base;
1876            }
1877            guess = Math.ceil(highx / highy);
1878            do {
1879                check = multiplySmall(b, guess);
1880                if (compareAbs(check, part) <= 0) break;
1881                guess--;
1882            } while (guess);
1883            result.push(guess);
1884            part = subtract(part, check);
1885        }
1886        result.reverse();
1887        return [arrayToSmall(result), arrayToSmall(part)];
1888    }
1889
1890    function divModSmall(value, lambda) {
1891        var length = value.length,
1892            quotient = createArray(length),
1893            base = BASE,
1894            i, q, remainder, divisor;
1895        remainder = 0;
1896        for (i = length - 1; i >= 0; --i) {
1897            divisor = remainder * base + value[i];
1898            q = truncate(divisor / lambda);
1899            remainder = divisor - q * lambda;
1900            quotient[i] = q | 0;
1901        }
1902        return [quotient, remainder | 0];
1903    }
1904
1905    function divModAny(self, v) {
1906        var value, n = parseValue(v);
1907        if (supportsNativeBigInt) {
1908            return [new NativeBigInt(self.value / n.value), new NativeBigInt(self.value % n.value)];
1909        }
1910        var a = self.value, b = n.value;
1911        var quotient;
1912        if (b === 0) throw new Error("Cannot divide by zero");
1913        if (self.isSmall) {
1914            if (n.isSmall) {
1915                return [new SmallInteger(truncate(a / b)), new SmallInteger(a % b)];
1916            }
1917            return [Integer[0], self];
1918        }
1919        if (n.isSmall) {
1920            if (b === 1) return [self, Integer[0]];
1921            if (b == -1) return [self.negate(), Integer[0]];
1922            var abs = Math.abs(b);
1923            if (abs < BASE) {
1924                value = divModSmall(a, abs);
1925                quotient = arrayToSmall(value[0]);
1926                var remainder = value[1];
1927                if (self.sign) remainder = -remainder;
1928                if (typeof quotient === "number") {
1929                    if (self.sign !== n.sign) quotient = -quotient;
1930                    return [new SmallInteger(quotient), new SmallInteger(remainder)];
1931                }
1932                return [new BigInteger(quotient, self.sign !== n.sign), new SmallInteger(remainder)];
1933            }
1934            b = smallToArray(abs);
1935        }
1936        var comparison = compareAbs(a, b);
1937        if (comparison === -1) return [Integer[0], self];
1938        if (comparison === 0) return [Integer[self.sign === n.sign ? 1 : -1], Integer[0]];
1939
1940        // divMod1 is faster on smaller input sizes
1941        if (a.length + b.length <= 200)
1942            value = divMod1(a, b);
1943        else value = divMod2(a, b);
1944
1945        quotient = value[0];
1946        var qSign = self.sign !== n.sign,
1947            mod = value[1],
1948            mSign = self.sign;
1949        if (typeof quotient === "number") {
1950            if (qSign) quotient = -quotient;
1951            quotient = new SmallInteger(quotient);
1952        } else quotient = new BigInteger(quotient, qSign);
1953        if (typeof mod === "number") {
1954            if (mSign) mod = -mod;
1955            mod = new SmallInteger(mod);
1956        } else mod = new BigInteger(mod, mSign);
1957        return [quotient, mod];
1958    }
1959
1960    BigInteger.prototype.divmod = function (v) {
1961        var result = divModAny(this, v);
1962        return {
1963            quotient: result[0],
1964            remainder: result[1]
1965        };
1966    };
1967    NativeBigInt.prototype.divmod = SmallInteger.prototype.divmod = BigInteger.prototype.divmod;
1968
1969
1970    BigInteger.prototype.divide = function (v) {
1971        return divModAny(this, v)[0];
1972    };
1973    NativeBigInt.prototype.over = NativeBigInt.prototype.divide = function (v) {
1974        return new NativeBigInt(this.value / parseValue(v).value);
1975    };
1976    SmallInteger.prototype.over = SmallInteger.prototype.divide = BigInteger.prototype.over = BigInteger.prototype.divide;
1977
1978    BigInteger.prototype.mod = function (v) {
1979        return divModAny(this, v)[1];
1980    };
1981    NativeBigInt.prototype.mod = NativeBigInt.prototype.remainder = function (v) {
1982        return new NativeBigInt(this.value % parseValue(v).value);
1983    };
1984    SmallInteger.prototype.remainder = SmallInteger.prototype.mod = BigInteger.prototype.remainder = BigInteger.prototype.mod;
1985
1986    BigInteger.prototype.pow = function (v) {
1987        var n = parseValue(v),
1988            a = this.value,
1989            b = n.value,
1990            value, x, y;
1991        if (b === 0) return Integer[1];
1992        if (a === 0) return Integer[0];
1993        if (a === 1) return Integer[1];
1994        if (a === -1) return n.isEven() ? Integer[1] : Integer[-1];
1995        if (n.sign) {
1996            return Integer[0];
1997        }
1998        if (!n.isSmall) throw new Error("The exponent " + n.toString() + " is too large.");
1999        if (this.isSmall) {
2000            if (isPrecise(value = Math.pow(a, b)))
2001                return new SmallInteger(truncate(value));
2002        }
2003        x = this;
2004        y = Integer[1];
2005        while (true) {
2006            if (b & 1 === 1) {
2007                y = y.times(x);
2008                --b;
2009            }
2010            if (b === 0) break;
2011            b /= 2;
2012            x = x.square();
2013        }
2014        return y;
2015    };
2016    SmallInteger.prototype.pow = BigInteger.prototype.pow;
2017
2018    NativeBigInt.prototype.pow = function (v) {
2019        var n = parseValue(v);
2020        var a = this.value, b = n.value;
2021        var _0 = BigInt(0), _1 = BigInt(1), _2 = BigInt(2);
2022        if (b === _0) return Integer[1];
2023        if (a === _0) return Integer[0];
2024        if (a === _1) return Integer[1];
2025        if (a === BigInt(-1)) return n.isEven() ? Integer[1] : Integer[-1];
2026        if (n.isNegative()) return new NativeBigInt(_0);
2027        var x = this;
2028        var y = Integer[1];
2029        while (true) {
2030            if ((b & _1) === _1) {
2031                y = y.times(x);
2032                --b;
2033            }
2034            if (b === _0) break;
2035            b /= _2;
2036            x = x.square();
2037        }
2038        return y;
2039    }
2040
2041    BigInteger.prototype.modPow = function (exp, mod) {
2042        exp = parseValue(exp);
2043        mod = parseValue(mod);
2044        if (mod.isZero()) throw new Error("Cannot take modPow with modulus 0");
2045        var r = Integer[1],
2046            base = this.mod(mod);
2047        if (exp.isNegative()) {
2048            exp = exp.multiply(Integer[-1]);
2049            base = base.modInv(mod);
2050        }
2051        while (exp.isPositive()) {
2052            if (base.isZero()) return Integer[0];
2053            if (exp.isOdd()) r = r.multiply(base).mod(mod);
2054            exp = exp.divide(2);
2055            base = base.square().mod(mod);
2056        }
2057        return r;
2058    };
2059    NativeBigInt.prototype.modPow = SmallInteger.prototype.modPow = BigInteger.prototype.modPow;
2060
2061    function compareAbs(a, b) {
2062        if (a.length !== b.length) {
2063            return a.length > b.length ? 1 : -1;
2064        }
2065        for (var i = a.length - 1; i >= 0; i--) {
2066            if (a[i] !== b[i]) return a[i] > b[i] ? 1 : -1;
2067        }
2068        return 0;
2069    }
2070
2071    BigInteger.prototype.compareAbs = function (v) {
2072        var n = parseValue(v),
2073            a = this.value,
2074            b = n.value;
2075        if (n.isSmall) return 1;
2076        return compareAbs(a, b);
2077    };
2078    SmallInteger.prototype.compareAbs = function (v) {
2079        var n = parseValue(v),
2080            a = Math.abs(this.value),
2081            b = n.value;
2082        if (n.isSmall) {
2083            b = Math.abs(b);
2084            return a === b ? 0 : a > b ? 1 : -1;
2085        }
2086        return -1;
2087    };
2088    NativeBigInt.prototype.compareAbs = function (v) {
2089        var a = this.value;
2090        var b = parseValue(v).value;
2091        a = a >= 0 ? a : -a;
2092        b = b >= 0 ? b : -b;
2093        return a === b ? 0 : a > b ? 1 : -1;
2094    }
2095
2096    BigInteger.prototype.compare = function (v) {
2097        // See discussion about comparison with Infinity:
2098        // https://github.com/peterolson/BigInteger.js/issues/61
2099        if (v === Infinity) {
2100            return -1;
2101        }
2102        if (v === -Infinity) {
2103            return 1;
2104        }
2105
2106        var n = parseValue(v),
2107            a = this.value,
2108            b = n.value;
2109        if (this.sign !== n.sign) {
2110            return n.sign ? 1 : -1;
2111        }
2112        if (n.isSmall) {
2113            return this.sign ? -1 : 1;
2114        }
2115        return compareAbs(a, b) * (this.sign ? -1 : 1);
2116    };
2117    BigInteger.prototype.compareTo = BigInteger.prototype.compare;
2118
2119    SmallInteger.prototype.compare = function (v) {
2120        if (v === Infinity) {
2121            return -1;
2122        }
2123        if (v === -Infinity) {
2124            return 1;
2125        }
2126
2127        var n = parseValue(v),
2128            a = this.value,
2129            b = n.value;
2130        if (n.isSmall) {
2131            return a == b ? 0 : a > b ? 1 : -1;
2132        }
2133        if (a < 0 !== n.sign) {
2134            return a < 0 ? -1 : 1;
2135        }
2136        return a < 0 ? 1 : -1;
2137    };
2138    SmallInteger.prototype.compareTo = SmallInteger.prototype.compare;
2139
2140    NativeBigInt.prototype.compare = function (v) {
2141        if (v === Infinity) {
2142            return -1;
2143        }
2144        if (v === -Infinity) {
2145            return 1;
2146        }
2147        var a = this.value;
2148        var b = parseValue(v).value;
2149        return a === b ? 0 : a > b ? 1 : -1;
2150    }
2151    NativeBigInt.prototype.compareTo = NativeBigInt.prototype.compare;
2152
2153    BigInteger.prototype.equals = function (v) {
2154        return this.compare(v) === 0;
2155    };
2156    NativeBigInt.prototype.eq = NativeBigInt.prototype.equals = SmallInteger.prototype.eq = SmallInteger.prototype.equals = BigInteger.prototype.eq = BigInteger.prototype.equals;
2157
2158    BigInteger.prototype.notEquals = function (v) {
2159        return this.compare(v) !== 0;
2160    };
2161    NativeBigInt.prototype.neq = NativeBigInt.prototype.notEquals = SmallInteger.prototype.neq = SmallInteger.prototype.notEquals = BigInteger.prototype.neq = BigInteger.prototype.notEquals;
2162
2163    BigInteger.prototype.greater = function (v) {
2164        return this.compare(v) > 0;
2165    };
2166    NativeBigInt.prototype.gt = NativeBigInt.prototype.greater = SmallInteger.prototype.gt = SmallInteger.prototype.greater = BigInteger.prototype.gt = BigInteger.prototype.greater;
2167
2168    BigInteger.prototype.lesser = function (v) {
2169        return this.compare(v) < 0;
2170    };
2171    NativeBigInt.prototype.lt = NativeBigInt.prototype.lesser = SmallInteger.prototype.lt = SmallInteger.prototype.lesser = BigInteger.prototype.lt = BigInteger.prototype.lesser;
2172
2173    BigInteger.prototype.greaterOrEquals = function (v) {
2174        return this.compare(v) >= 0;
2175    };
2176    NativeBigInt.prototype.geq = NativeBigInt.prototype.greaterOrEquals = SmallInteger.prototype.geq = SmallInteger.prototype.greaterOrEquals = BigInteger.prototype.geq = BigInteger.prototype.greaterOrEquals;
2177
2178    BigInteger.prototype.lesserOrEquals = function (v) {
2179        return this.compare(v) <= 0;
2180    };
2181    NativeBigInt.prototype.leq = NativeBigInt.prototype.lesserOrEquals = SmallInteger.prototype.leq = SmallInteger.prototype.lesserOrEquals = BigInteger.prototype.leq = BigInteger.prototype.lesserOrEquals;
2182
2183    BigInteger.prototype.isEven = function () {
2184        return (this.value[0] & 1) === 0;
2185    };
2186    SmallInteger.prototype.isEven = function () {
2187        return (this.value & 1) === 0;
2188    };
2189    NativeBigInt.prototype.isEven = function () {
2190        return (this.value & BigInt(1)) === BigInt(0);
2191    }
2192
2193    BigInteger.prototype.isOdd = function () {
2194        return (this.value[0] & 1) === 1;
2195    };
2196    SmallInteger.prototype.isOdd = function () {
2197        return (this.value & 1) === 1;
2198    };
2199    NativeBigInt.prototype.isOdd = function () {
2200        return (this.value & BigInt(1)) === BigInt(1);
2201    }
2202
2203    BigInteger.prototype.isPositive = function () {
2204        return !this.sign;
2205    };
2206    SmallInteger.prototype.isPositive = function () {
2207        return this.value > 0;
2208    };
2209    NativeBigInt.prototype.isPositive = SmallInteger.prototype.isPositive;
2210
2211    BigInteger.prototype.isNegative = function () {
2212        return this.sign;
2213    };
2214    SmallInteger.prototype.isNegative = function () {
2215        return this.value < 0;
2216    };
2217    NativeBigInt.prototype.isNegative = SmallInteger.prototype.isNegative;
2218
2219    BigInteger.prototype.isUnit = function () {
2220        return false;
2221    };
2222    SmallInteger.prototype.isUnit = function () {
2223        return Math.abs(this.value) === 1;
2224    };
2225    NativeBigInt.prototype.isUnit = function () {
2226        return this.abs().value === BigInt(1);
2227    }
2228
2229    BigInteger.prototype.isZero = function () {
2230        return false;
2231    };
2232    SmallInteger.prototype.isZero = function () {
2233        return this.value === 0;
2234    };
2235    NativeBigInt.prototype.isZero = function () {
2236        return this.value === BigInt(0);
2237    }
2238
2239    BigInteger.prototype.isDivisibleBy = function (v) {
2240        var n = parseValue(v);
2241        if (n.isZero()) return false;
2242        if (n.isUnit()) return true;
2243        if (n.compareAbs(2) === 0) return this.isEven();
2244        return this.mod(n).isZero();
2245    };
2246    NativeBigInt.prototype.isDivisibleBy = SmallInteger.prototype.isDivisibleBy = BigInteger.prototype.isDivisibleBy;
2247
2248    function isBasicPrime(v) {
2249        var n = v.abs();
2250        if (n.isUnit()) return false;
2251        if (n.equals(2) || n.equals(3) || n.equals(5)) return true;
2252        if (n.isEven() || n.isDivisibleBy(3) || n.isDivisibleBy(5)) return false;
2253        if (n.lesser(49)) return true;
2254        // we don't know if it's prime: let the other functions figure it out
2255    }
2256
2257    function millerRabinTest(n, a) {
2258        var nPrev = n.prev(),
2259            b = nPrev,
2260            r = 0,
2261            d, t, i, x;
2262        while (b.isEven()) b = b.divide(2), r++;
2263        next: for (i = 0; i < a.length; i++) {
2264            if (n.lesser(a[i])) continue;
2265            x = bigInt(a[i]).modPow(b, n);
2266            if (x.isUnit() || x.equals(nPrev)) continue;
2267            for (d = r - 1; d != 0; d--) {
2268                x = x.square().mod(n);
2269                if (x.isUnit()) return false;
2270                if (x.equals(nPrev)) continue next;
2271            }
2272            return false;
2273        }
2274        return true;
2275    }
2276
2277    // Set "strict" to true to force GRH-supported lower bound of 2*log(N)^2
2278    BigInteger.prototype.isPrime = function (strict) {
2279        var isPrime = isBasicPrime(this);
2280        if (isPrime !== undefined) return isPrime;
2281        var n = this.abs();
2282        var bits = n.bitLength();
2283        if (bits <= 64)
2284            return millerRabinTest(n, [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]);
2285        var logN = Math.log(2) * bits.toJSNumber();
2286        var t = Math.ceil((strict === true) ? (2 * Math.pow(logN, 2)) : logN);
2287        for (var a = [], i = 0; i < t; i++) {
2288            a.push(bigInt(i + 2));
2289        }
2290        return millerRabinTest(n, a);
2291    };
2292    NativeBigInt.prototype.isPrime = SmallInteger.prototype.isPrime = BigInteger.prototype.isPrime;
2293
2294    BigInteger.prototype.isProbablePrime = function (iterations, rng) {
2295        var isPrime = isBasicPrime(this);
2296        if (isPrime !== undefined) return isPrime;
2297        var n = this.abs();
2298        var t = iterations === undefined ? 5 : iterations;
2299        for (var a = [], i = 0; i < t; i++) {
2300            a.push(bigInt.randBetween(2, n.minus(2), rng));
2301        }
2302        return millerRabinTest(n, a);
2303    };
2304    NativeBigInt.prototype.isProbablePrime = SmallInteger.prototype.isProbablePrime = BigInteger.prototype.isProbablePrime;
2305
2306    BigInteger.prototype.modInv = function (n) {
2307        var t = bigInt.zero, newT = bigInt.one, r = parseValue(n), newR = this.abs(), q, lastT, lastR;
2308        while (!newR.isZero()) {
2309            q = r.divide(newR);
2310            lastT = t;
2311            lastR = r;
2312            t = newT;
2313            r = newR;
2314            newT = lastT.subtract(q.multiply(newT));
2315            newR = lastR.subtract(q.multiply(newR));
2316        }
2317        if (!r.isUnit()) throw new Error(this.toString() + " and " + n.toString() + " are not co-prime");
2318        if (t.compare(0) === -1) {
2319            t = t.add(n);
2320        }
2321        if (this.isNegative()) {
2322            return t.negate();
2323        }
2324        return t;
2325    };
2326
2327    NativeBigInt.prototype.modInv = SmallInteger.prototype.modInv = BigInteger.prototype.modInv;
2328
2329    BigInteger.prototype.next = function () {
2330        var value = this.value;
2331        if (this.sign) {
2332            return subtractSmall(value, 1, this.sign);
2333        }
2334        return new BigInteger(addSmall(value, 1), this.sign);
2335    };
2336    SmallInteger.prototype.next = function () {
2337        var value = this.value;
2338        if (value + 1 < MAX_INT) return new SmallInteger(value + 1);
2339        return new BigInteger(MAX_INT_ARR, false);
2340    };
2341    NativeBigInt.prototype.next = function () {
2342        return new NativeBigInt(this.value + BigInt(1));
2343    }
2344
2345    BigInteger.prototype.prev = function () {
2346        var value = this.value;
2347        if (this.sign) {
2348            return new BigInteger(addSmall(value, 1), true);
2349        }
2350        return subtractSmall(value, 1, this.sign);
2351    };
2352    SmallInteger.prototype.prev = function () {
2353        var value = this.value;
2354        if (value - 1 > -MAX_INT) return new SmallInteger(value - 1);
2355        return new BigInteger(MAX_INT_ARR, true);
2356    };
2357    NativeBigInt.prototype.prev = function () {
2358        return new NativeBigInt(this.value - BigInt(1));
2359    }
2360
2361    var powersOfTwo = [1];
2362    while (2 * powersOfTwo[powersOfTwo.length - 1] <= BASE) powersOfTwo.push(2 * powersOfTwo[powersOfTwo.length - 1]);
2363    var powers2Length = powersOfTwo.length, highestPower2 = powersOfTwo[powers2Length - 1];
2364
2365    function shift_isSmall(n) {
2366        return Math.abs(n) <= BASE;
2367    }
2368
2369    BigInteger.prototype.shiftLeft = function (v) {
2370        var n = parseValue(v).toJSNumber();
2371        if (!shift_isSmall(n)) {
2372            throw new Error(String(n) + " is too large for shifting.");
2373        }
2374        if (n < 0) return this.shiftRight(-n);
2375        var result = this;
2376        if (result.isZero()) return result;
2377        while (n >= powers2Length) {
2378            result = result.multiply(highestPower2);
2379            n -= powers2Length - 1;
2380        }
2381        return result.multiply(powersOfTwo[n]);
2382    };
2383    NativeBigInt.prototype.shiftLeft = SmallInteger.prototype.shiftLeft = BigInteger.prototype.shiftLeft;
2384
2385    BigInteger.prototype.shiftRight = function (v) {
2386        var remQuo;
2387        var n = parseValue(v).toJSNumber();
2388        if (!shift_isSmall(n)) {
2389            throw new Error(String(n) + " is too large for shifting.");
2390        }
2391        if (n < 0) return this.shiftLeft(-n);
2392        var result = this;
2393        while (n >= powers2Length) {
2394            if (result.isZero() || (result.isNegative() && result.isUnit())) return result;
2395            remQuo = divModAny(result, highestPower2);
2396            result = remQuo[1].isNegative() ? remQuo[0].prev() : remQuo[0];
2397            n -= powers2Length - 1;
2398        }
2399        remQuo = divModAny(result, powersOfTwo[n]);
2400        return remQuo[1].isNegative() ? remQuo[0].prev() : remQuo[0];
2401    };
2402    NativeBigInt.prototype.shiftRight = SmallInteger.prototype.shiftRight = BigInteger.prototype.shiftRight;
2403
2404    function bitwise(x, y, fn) {
2405        y = parseValue(y);
2406        var xSign = x.isNegative(), ySign = y.isNegative();
2407        var xRem = xSign ? x.not() : x,
2408            yRem = ySign ? y.not() : y;
2409        var xDigit = 0, yDigit = 0;
2410        var xDivMod = null, yDivMod = null;
2411        var result = [];
2412        while (!xRem.isZero() || !yRem.isZero()) {
2413            xDivMod = divModAny(xRem, highestPower2);
2414            xDigit = xDivMod[1].toJSNumber();
2415            if (xSign) {
2416                xDigit = highestPower2 - 1 - xDigit; // two's complement for negative numbers
2417            }
2418
2419            yDivMod = divModAny(yRem, highestPower2);
2420            yDigit = yDivMod[1].toJSNumber();
2421            if (ySign) {
2422                yDigit = highestPower2 - 1 - yDigit; // two's complement for negative numbers
2423            }
2424
2425            xRem = xDivMod[0];
2426            yRem = yDivMod[0];
2427            result.push(fn(xDigit, yDigit));
2428        }
2429        var sum = fn(xSign ? 1 : 0, ySign ? 1 : 0) !== 0 ? bigInt(-1) : bigInt(0);
2430        for (var i = result.length - 1; i >= 0; i -= 1) {
2431            sum = sum.multiply(highestPower2).add(bigInt(result[i]));
2432        }
2433        return sum;
2434    }
2435
2436    BigInteger.prototype.not = function () {
2437        return this.negate().prev();
2438    };
2439    NativeBigInt.prototype.not = SmallInteger.prototype.not = BigInteger.prototype.not;
2440
2441    BigInteger.prototype.and = function (n) {
2442        return bitwise(this, n, function (a, b) { return a & b; });
2443    };
2444    NativeBigInt.prototype.and = SmallInteger.prototype.and = BigInteger.prototype.and;
2445
2446    BigInteger.prototype.or = function (n) {
2447        return bitwise(this, n, function (a, b) { return a | b; });
2448    };
2449    NativeBigInt.prototype.or = SmallInteger.prototype.or = BigInteger.prototype.or;
2450
2451    BigInteger.prototype.xor = function (n) {
2452        return bitwise(this, n, function (a, b) { return a ^ b; });
2453    };
2454    NativeBigInt.prototype.xor = SmallInteger.prototype.xor = BigInteger.prototype.xor;
2455
2456    var LOBMASK_I = 1 << 30, LOBMASK_BI = (BASE & -BASE) * (BASE & -BASE) | LOBMASK_I;
2457    function roughLOB(n) { // get lowestOneBit (rough)
2458        // SmallInteger: return Min(lowestOneBit(n), 1 << 30)
2459        // BigInteger: return Min(lowestOneBit(n), 1 << 14) [BASE=1e7]
2460        var v = n.value,
2461            x = typeof v === "number" ? v | LOBMASK_I :
2462                typeof v === "bigint" ? v | BigInt(LOBMASK_I) :
2463                    v[0] + v[1] * BASE | LOBMASK_BI;
2464        return x & -x;
2465    }
2466
2467    function integerLogarithm(value, base) {
2468        if (base.compareTo(value) <= 0) {
2469            var tmp = integerLogarithm(value, base.square(base));
2470            var p = tmp.p;
2471            var e = tmp.e;
2472            var t = p.multiply(base);
2473            return t.compareTo(value) <= 0 ? { p: t, e: e * 2 + 1 } : { p: p, e: e * 2 };
2474        }
2475        return { p: bigInt(1), e: 0 };
2476    }
2477
2478    BigInteger.prototype.bitLength = function () {
2479        var n = this;
2480        if (n.compareTo(bigInt(0)) < 0) {
2481            n = n.negate().subtract(bigInt(1));
2482        }
2483        if (n.compareTo(bigInt(0)) === 0) {
2484            return bigInt(0);
2485        }
2486        return bigInt(integerLogarithm(n, bigInt(2)).e).add(bigInt(1));
2487    }
2488    NativeBigInt.prototype.bitLength = SmallInteger.prototype.bitLength = BigInteger.prototype.bitLength;
2489
2490    function max(a, b) {
2491        a = parseValue(a);
2492        b = parseValue(b);
2493        return a.greater(b) ? a : b;
2494    }
2495    function min(a, b) {
2496        a = parseValue(a);
2497        b = parseValue(b);
2498        return a.lesser(b) ? a : b;
2499    }
2500    function gcd(a, b) {
2501        a = parseValue(a).abs();
2502        b = parseValue(b).abs();
2503        if (a.equals(b)) return a;
2504        if (a.isZero()) return b;
2505        if (b.isZero()) return a;
2506        var c = Integer[1], d, t;
2507        while (a.isEven() && b.isEven()) {
2508            d = min(roughLOB(a), roughLOB(b));
2509            a = a.divide(d);
2510            b = b.divide(d);
2511            c = c.multiply(d);
2512        }
2513        while (a.isEven()) {
2514            a = a.divide(roughLOB(a));
2515        }
2516        do {
2517            while (b.isEven()) {
2518                b = b.divide(roughLOB(b));
2519            }
2520            if (a.greater(b)) {
2521                t = b; b = a; a = t;
2522            }
2523            b = b.subtract(a);
2524        } while (!b.isZero());
2525        return c.isUnit() ? a : a.multiply(c);
2526    }
2527    function lcm(a, b) {
2528        a = parseValue(a).abs();
2529        b = parseValue(b).abs();
2530        return a.divide(gcd(a, b)).multiply(b);
2531    }
2532    function randBetween(a, b, rng) {
2533        a = parseValue(a);
2534        b = parseValue(b);
2535        var usedRNG = rng || Math.random;
2536        var low = min(a, b), high = max(a, b);
2537        var range = high.subtract(low).add(1);
2538        if (range.isSmall) return low.add(Math.floor(usedRNG() * range));
2539        var digits = toBase(range, BASE).value;
2540        var result = [], restricted = true;
2541        for (var i = 0; i < digits.length; i++) {
2542            var top = restricted ? digits[i] : BASE;
2543            var digit = truncate(usedRNG() * top);
2544            result.push(digit);
2545            if (digit < top) restricted = false;
2546        }
2547        return low.add(Integer.fromArray(result, BASE, false));
2548    }
2549
2550    var parseBase = function (text, base, alphabet, caseSensitive) {
2551        alphabet = alphabet || DEFAULT_ALPHABET;
2552        text = String(text);
2553        if (!caseSensitive) {
2554            text = text.toLowerCase();
2555            alphabet = alphabet.toLowerCase();
2556        }
2557        var length = text.length;
2558        var i;
2559        var absBase = Math.abs(base);
2560        var alphabetValues = {};
2561        for (i = 0; i < alphabet.length; i++) {
2562            alphabetValues[alphabet[i]] = i;
2563        }
2564        for (i = 0; i < length; i++) {
2565            var c = text[i];
2566            if (c === "-") continue;
2567            if (c in alphabetValues) {
2568                if (alphabetValues[c] >= absBase) {
2569                    if (c === "1" && absBase === 1) continue;
2570                    throw new Error(c + " is not a valid digit in base " + base + ".");
2571                }
2572            }
2573        }
2574        base = parseValue(base);
2575        var digits = [];
2576        var isNegative = text[0] === "-";
2577        for (i = isNegative ? 1 : 0; i < text.length; i++) {
2578            var c = text[i];
2579            if (c in alphabetValues) digits.push(parseValue(alphabetValues[c]));
2580            else if (c === "<") {
2581                var start = i;
2582                do { i++; } while (text[i] !== ">" && i < text.length);
2583                digits.push(parseValue(text.slice(start + 1, i)));
2584            }
2585            else throw new Error(c + " is not a valid character");
2586        }
2587        return parseBaseFromArray(digits, base, isNegative);
2588    };
2589
2590    function parseBaseFromArray(digits, base, isNegative) {
2591        var val = Integer[0], pow = Integer[1], i;
2592        for (i = digits.length - 1; i >= 0; i--) {
2593            val = val.add(digits[i].times(pow));
2594            pow = pow.times(base);
2595        }
2596        return isNegative ? val.negate() : val;
2597    }
2598
2599    function stringify(digit, alphabet) {
2600        alphabet = alphabet || DEFAULT_ALPHABET;
2601        if (digit < alphabet.length) {
2602            return alphabet[digit];
2603        }
2604        return "<" + digit + ">";
2605    }
2606
2607    function toBase(n, base) {
2608        base = bigInt(base);
2609        if (base.isZero()) {
2610            if (n.isZero()) return { value: [0], isNegative: false };
2611            throw new Error("Cannot convert nonzero numbers to base 0.");
2612        }
2613        if (base.equals(-1)) {
2614            if (n.isZero()) return { value: [0], isNegative: false };
2615            if (n.isNegative())
2616                return {
2617                    value: [].concat.apply([], Array.apply(null, Array(-n.toJSNumber()))
2618                        .map(Array.prototype.valueOf, [1, 0])
2619                    ),
2620                    isNegative: false
2621                };
2622
2623            var arr = Array.apply(null, Array(n.toJSNumber() - 1))
2624                .map(Array.prototype.valueOf, [0, 1]);
2625            arr.unshift([1]);
2626            return {
2627                value: [].concat.apply([], arr),
2628                isNegative: false
2629            };
2630        }
2631
2632        var neg = false;
2633        if (n.isNegative() && base.isPositive()) {
2634            neg = true;
2635            n = n.abs();
2636        }
2637        if (base.isUnit()) {
2638            if (n.isZero()) return { value: [0], isNegative: false };
2639
2640            return {
2641                value: Array.apply(null, Array(n.toJSNumber()))
2642                    .map(Number.prototype.valueOf, 1),
2643                isNegative: neg
2644            };
2645        }
2646        var out = [];
2647        var left = n, divmod;
2648        while (left.isNegative() || left.compareAbs(base) >= 0) {
2649            divmod = left.divmod(base);
2650            left = divmod.quotient;
2651            var digit = divmod.remainder;
2652            if (digit.isNegative()) {
2653                digit = base.minus(digit).abs();
2654                left = left.next();
2655            }
2656            out.push(digit.toJSNumber());
2657        }
2658        out.push(left.toJSNumber());
2659        return { value: out.reverse(), isNegative: neg };
2660    }
2661
2662    function toBaseString(n, base, alphabet) {
2663        var arr = toBase(n, base);
2664        return (arr.isNegative ? "-" : "") + arr.value.map(function (x) {
2665            return stringify(x, alphabet);
2666        }).join('');
2667    }
2668
2669    BigInteger.prototype.toArray = function (radix) {
2670        return toBase(this, radix);
2671    };
2672
2673    SmallInteger.prototype.toArray = function (radix) {
2674        return toBase(this, radix);
2675    };
2676
2677    NativeBigInt.prototype.toArray = function (radix) {
2678        return toBase(this, radix);
2679    };
2680
2681    BigInteger.prototype.toString = function (radix, alphabet) {
2682        if (radix === undefined) radix = 10;
2683        if (radix !== 10) return toBaseString(this, radix, alphabet);
2684        var v = this.value, l = v.length, str = String(v[--l]), zeros = "0000000", digit;
2685        while (--l >= 0) {
2686            digit = String(v[l]);
2687            str += zeros.slice(digit.length) + digit;
2688        }
2689        var sign = this.sign ? "-" : "";
2690        return sign + str;
2691    };
2692
2693    SmallInteger.prototype.toString = function (radix, alphabet) {
2694        if (radix === undefined) radix = 10;
2695        if (radix != 10) return toBaseString(this, radix, alphabet);
2696        return String(this.value);
2697    };
2698
2699    NativeBigInt.prototype.toString = SmallInteger.prototype.toString;
2700
2701    NativeBigInt.prototype.toJSON = BigInteger.prototype.toJSON = SmallInteger.prototype.toJSON = function () { return this.toString(); }
2702
2703    BigInteger.prototype.valueOf = function () {
2704        return parseInt(this.toString(), 10);
2705    };
2706    BigInteger.prototype.toJSNumber = BigInteger.prototype.valueOf;
2707
2708    SmallInteger.prototype.valueOf = function () {
2709        return this.value;
2710    };
2711    SmallInteger.prototype.toJSNumber = SmallInteger.prototype.valueOf;
2712    NativeBigInt.prototype.valueOf = NativeBigInt.prototype.toJSNumber = function () {
2713        return parseInt(this.toString(), 10);
2714    }
2715
2716    function parseStringValue(v) {
2717        if (isPrecise(+v)) {
2718            var x = +v;
2719            if (x === truncate(x))
2720                return supportsNativeBigInt ? new NativeBigInt(BigInt(x)) : new SmallInteger(x);
2721            throw new Error("Invalid integer: " + v);
2722        }
2723        var sign = v[0] === "-";
2724        if (sign) v = v.slice(1);
2725        var split = v.split(/e/i);
2726        if (split.length > 2) throw new Error("Invalid integer: " + split.join("e"));
2727        if (split.length === 2) {
2728            var exp = split[1];
2729            if (exp[0] === "+") exp = exp.slice(1);
2730            exp = +exp;
2731            if (exp !== truncate(exp) || !isPrecise(exp)) throw new Error("Invalid integer: " + exp + " is not a valid exponent.");
2732            var text = split[0];
2733            var decimalPlace = text.indexOf(".");
2734            if (decimalPlace >= 0) {
2735                exp -= text.length - decimalPlace - 1;
2736                text = text.slice(0, decimalPlace) + text.slice(decimalPlace + 1);
2737            }
2738            if (exp < 0) throw new Error("Cannot include negative exponent part for integers");
2739            text += (new Array(exp + 1)).join("0");
2740            v = text;
2741        }
2742        var isValid = /^([0-9][0-9]*)$/.test(v);
2743        if (!isValid) throw new Error("Invalid integer: " + v);
2744        if (supportsNativeBigInt) {
2745            return new NativeBigInt(BigInt(sign ? "-" + v : v));
2746        }
2747        var r = [], max = v.length, l = LOG_BASE, min = max - l;
2748        while (max > 0) {
2749            r.push(+v.slice(min, max));
2750            min -= l;
2751            if (min < 0) min = 0;
2752            max -= l;
2753        }
2754        trim(r);
2755        return new BigInteger(r, sign);
2756    }
2757
2758    function parseNumberValue(v) {
2759        if (supportsNativeBigInt) {
2760            return new NativeBigInt(BigInt(v));
2761        }
2762        if (isPrecise(v)) {
2763            if (v !== truncate(v)) throw new Error(v + " is not an integer.");
2764            return new SmallInteger(v);
2765        }
2766        return parseStringValue(v.toString());
2767    }
2768
2769    function parseValue(v) {
2770        if (typeof v === "number") {
2771            return parseNumberValue(v);
2772        }
2773        if (typeof v === "string") {
2774            return parseStringValue(v);
2775        }
2776        if (typeof v === "bigint") {
2777            return new NativeBigInt(v);
2778        }
2779        return v;
2780    }
2781    // Pre-define numbers in range [-999,999]
2782    for (var i = 0; i < 1000; i++) {
2783        Integer[i] = parseValue(i);
2784        if (i > 0) Integer[-i] = parseValue(-i);
2785    }
2786    // Backwards compatibility
2787    Integer.one = Integer[1];
2788    Integer.zero = Integer[0];
2789    Integer.minusOne = Integer[-1];
2790    Integer.max = max;
2791    Integer.min = min;
2792    Integer.gcd = gcd;
2793    Integer.lcm = lcm;
2794    Integer.isInstance = function (x) { return x instanceof BigInteger || x instanceof SmallInteger || x instanceof NativeBigInt; };
2795    Integer.randBetween = randBetween;
2796
2797    Integer.fromArray = function (digits, base, isNegative) {
2798        return parseBaseFromArray(digits.map(parseValue), parseValue(base || 10), isNegative);
2799    };
2800
2801    return Integer;
2802})();
2803
2804// Node.js check
2805if (typeof module !== "undefined" && module.hasOwnProperty("exports")) {
2806    module.exports = bigInt;
2807}
2808
2809//amd check
2810if (typeof define === "function" && define.amd) {
2811    define( function () {
2812        return bigInt;
2813    });
2814}
2815
2816},{}],9:[function(require,module,exports){
2817(function (Buffer){
2818/*!
2819 * The buffer module from node.js, for the browser.
2820 *
2821 * @author   Feross Aboukhadijeh <https://feross.org>
2822 * @license  MIT
2823 */
2824/* eslint-disable no-proto */
2825
2826'use strict'
2827
2828var base64 = require('base64-js')
2829var ieee754 = require('ieee754')
2830var customInspectSymbol =
2831  (typeof Symbol === 'function' && typeof Symbol.for === 'function')
2832    ? Symbol.for('nodejs.util.inspect.custom')
2833    : null
2834
2835exports.Buffer = Buffer
2836exports.SlowBuffer = SlowBuffer
2837exports.INSPECT_MAX_BYTES = 50
2838
2839var K_MAX_LENGTH = 0x7fffffff
2840exports.kMaxLength = K_MAX_LENGTH
2841
2842/**
2843 * If `Buffer.TYPED_ARRAY_SUPPORT`:
2844 *   === true    Use Uint8Array implementation (fastest)
2845 *   === false   Print warning and recommend using `buffer` v4.x which has an Object
2846 *               implementation (most compatible, even IE6)
2847 *
2848 * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,
2849 * Opera 11.6+, iOS 4.2+.
2850 *
2851 * We report that the browser does not support typed arrays if the are not subclassable
2852 * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`
2853 * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support
2854 * for __proto__ and has a buggy typed array implementation.
2855 */
2856Buffer.TYPED_ARRAY_SUPPORT = typedArraySupport()
2857
2858if (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&
2859    typeof console.error === 'function') {
2860  console.error(
2861    'This browser lacks typed array (Uint8Array) support which is required by ' +
2862    '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'
2863  )
2864}
2865
2866function typedArraySupport () {
2867  // Can typed array instances can be augmented?
2868  try {
2869    var arr = new Uint8Array(1)
2870    var proto = { foo: function () { return 42 } }
2871    Object.setPrototypeOf(proto, Uint8Array.prototype)
2872    Object.setPrototypeOf(arr, proto)
2873    return arr.foo() === 42
2874  } catch (e) {
2875    return false
2876  }
2877}
2878
2879Object.defineProperty(Buffer.prototype, 'parent', {
2880  enumerable: true,
2881  get: function () {
2882    if (!Buffer.isBuffer(this)) return undefined
2883    return this.buffer
2884  }
2885})
2886
2887Object.defineProperty(Buffer.prototype, 'offset', {
2888  enumerable: true,
2889  get: function () {
2890    if (!Buffer.isBuffer(this)) return undefined
2891    return this.byteOffset
2892  }
2893})
2894
2895function createBuffer (length) {
2896  if (length > K_MAX_LENGTH) {
2897    throw new RangeError('The value "' + length + '" is invalid for option "size"')
2898  }
2899  // Return an augmented `Uint8Array` instance
2900  var buf = new Uint8Array(length)
2901  Object.setPrototypeOf(buf, Buffer.prototype)
2902  return buf
2903}
2904
2905/**
2906 * The Buffer constructor returns instances of `Uint8Array` that have their
2907 * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of
2908 * `Uint8Array`, so the returned instances will have all the node `Buffer` methods
2909 * and the `Uint8Array` methods. Square bracket notation works as expected -- it
2910 * returns a single octet.
2911 *
2912 * The `Uint8Array` prototype remains unmodified.
2913 */
2914
2915function Buffer (arg, encodingOrOffset, length) {
2916  // Common case.
2917  if (typeof arg === 'number') {
2918    if (typeof encodingOrOffset === 'string') {
2919      throw new TypeError(
2920        'The "string" argument must be of type string. Received type number'
2921      )
2922    }
2923    return allocUnsafe(arg)
2924  }
2925  return from(arg, encodingOrOffset, length)
2926}
2927
2928// Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97
2929if (typeof Symbol !== 'undefined' && Symbol.species != null &&
2930    Buffer[Symbol.species] === Buffer) {
2931  Object.defineProperty(Buffer, Symbol.species, {
2932    value: null,
2933    configurable: true,
2934    enumerable: false,
2935    writable: false
2936  })
2937}
2938
2939Buffer.poolSize = 8192 // not used by this implementation
2940
2941function from (value, encodingOrOffset, length) {
2942  if (typeof value === 'string') {
2943    return fromString(value, encodingOrOffset)
2944  }
2945
2946  if (ArrayBuffer.isView(value)) {
2947    return fromArrayLike(value)
2948  }
2949
2950  if (value == null) {
2951    throw new TypeError(
2952      'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +
2953      'or Array-like Object. Received type ' + (typeof value)
2954    )
2955  }
2956
2957  if (isInstance(value, ArrayBuffer) ||
2958      (value && isInstance(value.buffer, ArrayBuffer))) {
2959    return fromArrayBuffer(value, encodingOrOffset, length)
2960  }
2961
2962  if (typeof SharedArrayBuffer !== 'undefined' &&
2963      (isInstance(value, SharedArrayBuffer) ||
2964      (value && isInstance(value.buffer, SharedArrayBuffer)))) {
2965    return fromArrayBuffer(value, encodingOrOffset, length)
2966  }
2967
2968  if (typeof value === 'number') {
2969    throw new TypeError(
2970      'The "value" argument must not be of type number. Received type number'
2971    )
2972  }
2973
2974  var valueOf = value.valueOf && value.valueOf()
2975  if (valueOf != null && valueOf !== value) {
2976    return Buffer.from(valueOf, encodingOrOffset, length)
2977  }
2978
2979  var b = fromObject(value)
2980  if (b) return b
2981
2982  if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&
2983      typeof value[Symbol.toPrimitive] === 'function') {
2984    return Buffer.from(
2985      value[Symbol.toPrimitive]('string'), encodingOrOffset, length
2986    )
2987  }
2988
2989  throw new TypeError(
2990    'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +
2991    'or Array-like Object. Received type ' + (typeof value)
2992  )
2993}
2994
2995/**
2996 * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError
2997 * if value is a number.
2998 * Buffer.from(str[, encoding])
2999 * Buffer.from(array)
3000 * Buffer.from(buffer)
3001 * Buffer.from(arrayBuffer[, byteOffset[, length]])
3002 **/
3003Buffer.from = function (value, encodingOrOffset, length) {
3004  return from(value, encodingOrOffset, length)
3005}
3006
3007// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:
3008// https://github.com/feross/buffer/pull/148
3009Object.setPrototypeOf(Buffer.prototype, Uint8Array.prototype)
3010Object.setPrototypeOf(Buffer, Uint8Array)
3011
3012function assertSize (size) {
3013  if (typeof size !== 'number') {
3014    throw new TypeError('"size" argument must be of type number')
3015  } else if (size < 0) {
3016    throw new RangeError('The value "' + size + '" is invalid for option "size"')
3017  }
3018}
3019
3020function alloc (size, fill, encoding) {
3021  assertSize(size)
3022  if (size <= 0) {
3023    return createBuffer(size)
3024  }
3025  if (fill !== undefined) {
3026    // Only pay attention to encoding if it's a string. This
3027    // prevents accidentally sending in a number that would
3028    // be interpretted as a start offset.
3029    return typeof encoding === 'string'
3030      ? createBuffer(size).fill(fill, encoding)
3031      : createBuffer(size).fill(fill)
3032  }
3033  return createBuffer(size)
3034}
3035
3036/**
3037 * Creates a new filled Buffer instance.
3038 * alloc(size[, fill[, encoding]])
3039 **/
3040Buffer.alloc = function (size, fill, encoding) {
3041  return alloc(size, fill, encoding)
3042}
3043
3044function allocUnsafe (size) {
3045  assertSize(size)
3046  return createBuffer(size < 0 ? 0 : checked(size) | 0)
3047}
3048
3049/**
3050 * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.
3051 * */
3052Buffer.allocUnsafe = function (size) {
3053  return allocUnsafe(size)
3054}
3055/**
3056 * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.
3057 */
3058Buffer.allocUnsafeSlow = function (size) {
3059  return allocUnsafe(size)
3060}
3061
3062function fromString (string, encoding) {
3063  if (typeof encoding !== 'string' || encoding === '') {
3064    encoding = 'utf8'
3065  }
3066
3067  if (!Buffer.isEncoding(encoding)) {
3068    throw new TypeError('Unknown encoding: ' + encoding)
3069  }
3070
3071  var length = byteLength(string, encoding) | 0
3072  var buf = createBuffer(length)
3073
3074  var actual = buf.write(string, encoding)
3075
3076  if (actual !== length) {
3077    // Writing a hex string, for example, that contains invalid characters will
3078    // cause everything after the first invalid character to be ignored. (e.g.
3079    // 'abxxcd' will be treated as 'ab')
3080    buf = buf.slice(0, actual)
3081  }
3082
3083  return buf
3084}
3085
3086function fromArrayLike (array) {
3087  var length = array.length < 0 ? 0 : checked(array.length) | 0
3088  var buf = createBuffer(length)
3089  for (var i = 0; i < length; i += 1) {
3090    buf[i] = array[i] & 255
3091  }
3092  return buf
3093}
3094
3095function fromArrayBuffer (array, byteOffset, length) {
3096  if (byteOffset < 0 || array.byteLength < byteOffset) {
3097    throw new RangeError('"offset" is outside of buffer bounds')
3098  }
3099
3100  if (array.byteLength < byteOffset + (length || 0)) {
3101    throw new RangeError('"length" is outside of buffer bounds')
3102  }
3103
3104  var buf
3105  if (byteOffset === undefined && length === undefined) {
3106    buf = new Uint8Array(array)
3107  } else if (length === undefined) {
3108    buf = new Uint8Array(array, byteOffset)
3109  } else {
3110    buf = new Uint8Array(array, byteOffset, length)
3111  }
3112
3113  // Return an augmented `Uint8Array` instance
3114  Object.setPrototypeOf(buf, Buffer.prototype)
3115
3116  return buf
3117}
3118
3119function fromObject (obj) {
3120  if (Buffer.isBuffer(obj)) {
3121    var len = checked(obj.length) | 0
3122    var buf = createBuffer(len)
3123
3124    if (buf.length === 0) {
3125      return buf
3126    }
3127
3128    obj.copy(buf, 0, 0, len)
3129    return buf
3130  }
3131
3132  if (obj.length !== undefined) {
3133    if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {
3134      return createBuffer(0)
3135    }
3136    return fromArrayLike(obj)
3137  }
3138
3139  if (obj.type === 'Buffer' && Array.isArray(obj.data)) {
3140    return fromArrayLike(obj.data)
3141  }
3142}
3143
3144function checked (length) {
3145  // Note: cannot use `length < K_MAX_LENGTH` here because that fails when
3146  // length is NaN (which is otherwise coerced to zero.)
3147  if (length >= K_MAX_LENGTH) {
3148    throw new RangeError('Attempt to allocate Buffer larger than maximum ' +
3149                         'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')
3150  }
3151  return length | 0
3152}
3153
3154function SlowBuffer (length) {
3155  if (+length != length) { // eslint-disable-line eqeqeq
3156    length = 0
3157  }
3158  return Buffer.alloc(+length)
3159}
3160
3161Buffer.isBuffer = function isBuffer (b) {
3162  return b != null && b._isBuffer === true &&
3163    b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false
3164}
3165
3166Buffer.compare = function compare (a, b) {
3167  if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)
3168  if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)
3169  if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {
3170    throw new TypeError(
3171      'The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array'
3172    )
3173  }
3174
3175  if (a === b) return 0
3176
3177  var x = a.length
3178  var y = b.length
3179
3180  for (var i = 0, len = Math.min(x, y); i < len; ++i) {
3181    if (a[i] !== b[i]) {
3182      x = a[i]
3183      y = b[i]
3184      break
3185    }
3186  }
3187
3188  if (x < y) return -1
3189  if (y < x) return 1
3190  return 0
3191}
3192
3193Buffer.isEncoding = function isEncoding (encoding) {
3194  switch (String(encoding).toLowerCase()) {
3195    case 'hex':
3196    case 'utf8':
3197    case 'utf-8':
3198    case 'ascii':
3199    case 'latin1':
3200    case 'binary':
3201    case 'base64':
3202    case 'ucs2':
3203    case 'ucs-2':
3204    case 'utf16le':
3205    case 'utf-16le':
3206      return true
3207    default:
3208      return false
3209  }
3210}
3211
3212Buffer.concat = function concat (list, length) {
3213  if (!Array.isArray(list)) {
3214    throw new TypeError('"list" argument must be an Array of Buffers')
3215  }
3216
3217  if (list.length === 0) {
3218    return Buffer.alloc(0)
3219  }
3220
3221  var i
3222  if (length === undefined) {
3223    length = 0
3224    for (i = 0; i < list.length; ++i) {
3225      length += list[i].length
3226    }
3227  }
3228
3229  var buffer = Buffer.allocUnsafe(length)
3230  var pos = 0
3231  for (i = 0; i < list.length; ++i) {
3232    var buf = list[i]
3233    if (isInstance(buf, Uint8Array)) {
3234      buf = Buffer.from(buf)
3235    }
3236    if (!Buffer.isBuffer(buf)) {
3237      throw new TypeError('"list" argument must be an Array of Buffers')
3238    }
3239    buf.copy(buffer, pos)
3240    pos += buf.length
3241  }
3242  return buffer
3243}
3244
3245function byteLength (string, encoding) {
3246  if (Buffer.isBuffer(string)) {
3247    return string.length
3248  }
3249  if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {
3250    return string.byteLength
3251  }
3252  if (typeof string !== 'string') {
3253    throw new TypeError(
3254      'The "string" argument must be one of type string, Buffer, or ArrayBuffer. ' +
3255      'Received type ' + typeof string
3256    )
3257  }
3258
3259  var len = string.length
3260  var mustMatch = (arguments.length > 2 && arguments[2] === true)
3261  if (!mustMatch && len === 0) return 0
3262
3263  // Use a for loop to avoid recursion
3264  var loweredCase = false
3265  for (;;) {
3266    switch (encoding) {
3267      case 'ascii':
3268      case 'latin1':
3269      case 'binary':
3270        return len
3271      case 'utf8':
3272      case 'utf-8':
3273        return utf8ToBytes(string).length
3274      case 'ucs2':
3275      case 'ucs-2':
3276      case 'utf16le':
3277      case 'utf-16le':
3278        return len * 2
3279      case 'hex':
3280        return len >>> 1
3281      case 'base64':
3282        return base64ToBytes(string).length
3283      default:
3284        if (loweredCase) {
3285          return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8
3286        }
3287        encoding = ('' + encoding).toLowerCase()
3288        loweredCase = true
3289    }
3290  }
3291}
3292Buffer.byteLength = byteLength
3293
3294function slowToString (encoding, start, end) {
3295  var loweredCase = false
3296
3297  // No need to verify that "this.length <= MAX_UINT32" since it's a read-only
3298  // property of a typed array.
3299
3300  // This behaves neither like String nor Uint8Array in that we set start/end
3301  // to their upper/lower bounds if the value passed is out of range.
3302  // undefined is handled specially as per ECMA-262 6th Edition,
3303  // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.
3304  if (start === undefined || start < 0) {
3305    start = 0
3306  }
3307  // Return early if start > this.length. Done here to prevent potential uint32
3308  // coercion fail below.
3309  if (start > this.length) {
3310    return ''
3311  }
3312
3313  if (end === undefined || end > this.length) {
3314    end = this.length
3315  }
3316
3317  if (end <= 0) {
3318    return ''
3319  }
3320
3321  // Force coersion to uint32. This will also coerce falsey/NaN values to 0.
3322  end >>>= 0
3323  start >>>= 0
3324
3325  if (end <= start) {
3326    return ''
3327  }
3328
3329  if (!encoding) encoding = 'utf8'
3330
3331  while (true) {
3332    switch (encoding) {
3333      case 'hex':
3334        return hexSlice(this, start, end)
3335
3336      case 'utf8':
3337      case 'utf-8':
3338        return utf8Slice(this, start, end)
3339
3340      case 'ascii':
3341        return asciiSlice(this, start, end)
3342
3343      case 'latin1':
3344      case 'binary':
3345        return latin1Slice(this, start, end)
3346
3347      case 'base64':
3348        return base64Slice(this, start, end)
3349
3350      case 'ucs2':
3351      case 'ucs-2':
3352      case 'utf16le':
3353      case 'utf-16le':
3354        return utf16leSlice(this, start, end)
3355
3356      default:
3357        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)
3358        encoding = (encoding + '').toLowerCase()
3359        loweredCase = true
3360    }
3361  }
3362}
3363
3364// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)
3365// to detect a Buffer instance. It's not possible to use `instanceof Buffer`
3366// reliably in a browserify context because there could be multiple different
3367// copies of the 'buffer' package in use. This method works even for Buffer
3368// instances that were created from another copy of the `buffer` package.
3369// See: https://github.com/feross/buffer/issues/154
3370Buffer.prototype._isBuffer = true
3371
3372function swap (b, n, m) {
3373  var i = b[n]
3374  b[n] = b[m]
3375  b[m] = i
3376}
3377
3378Buffer.prototype.swap16 = function swap16 () {
3379  var len = this.length
3380  if (len % 2 !== 0) {
3381    throw new RangeError('Buffer size must be a multiple of 16-bits')
3382  }
3383  for (var i = 0; i < len; i += 2) {
3384    swap(this, i, i + 1)
3385  }
3386  return this
3387}
3388
3389Buffer.prototype.swap32 = function swap32 () {
3390  var len = this.length
3391  if (len % 4 !== 0) {
3392    throw new RangeError('Buffer size must be a multiple of 32-bits')
3393  }
3394  for (var i = 0; i < len; i += 4) {
3395    swap(this, i, i + 3)
3396    swap(this, i + 1, i + 2)
3397  }
3398  return this
3399}
3400
3401Buffer.prototype.swap64 = function swap64 () {
3402  var len = this.length
3403  if (len % 8 !== 0) {
3404    throw new RangeError('Buffer size must be a multiple of 64-bits')
3405  }
3406  for (var i = 0; i < len; i += 8) {
3407    swap(this, i, i + 7)
3408    swap(this, i + 1, i + 6)
3409    swap(this, i + 2, i + 5)
3410    swap(this, i + 3, i + 4)
3411  }
3412  return this
3413}
3414
3415Buffer.prototype.toString = function toString () {
3416  var length = this.length
3417  if (length === 0) return ''
3418  if (arguments.length === 0) return utf8Slice(this, 0, length)
3419  return slowToString.apply(this, arguments)
3420}
3421
3422Buffer.prototype.toLocaleString = Buffer.prototype.toString
3423
3424Buffer.prototype.equals = function equals (b) {
3425  if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')
3426  if (this === b) return true
3427  return Buffer.compare(this, b) === 0
3428}
3429
3430Buffer.prototype.inspect = function inspect () {
3431  var str = ''
3432  var max = exports.INSPECT_MAX_BYTES
3433  str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()
3434  if (this.length > max) str += ' ... '
3435  return '<Buffer ' + str + '>'
3436}
3437if (customInspectSymbol) {
3438  Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect
3439}
3440
3441Buffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {
3442  if (isInstance(target, Uint8Array)) {
3443    target = Buffer.from(target, target.offset, target.byteLength)
3444  }
3445  if (!Buffer.isBuffer(target)) {
3446    throw new TypeError(
3447      'The "target" argument must be one of type Buffer or Uint8Array. ' +
3448      'Received type ' + (typeof target)
3449    )
3450  }
3451
3452  if (start === undefined) {
3453    start = 0
3454  }
3455  if (end === undefined) {
3456    end = target ? target.length : 0
3457  }
3458  if (thisStart === undefined) {
3459    thisStart = 0
3460  }
3461  if (thisEnd === undefined) {
3462    thisEnd = this.length
3463  }
3464
3465  if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {
3466    throw new RangeError('out of range index')
3467  }
3468
3469  if (thisStart >= thisEnd && start >= end) {
3470    return 0
3471  }
3472  if (thisStart >= thisEnd) {
3473    return -1
3474  }
3475  if (start >= end) {
3476    return 1
3477  }
3478
3479  start >>>= 0
3480  end >>>= 0
3481  thisStart >>>= 0
3482  thisEnd >>>= 0
3483
3484  if (this === target) return 0
3485
3486  var x = thisEnd - thisStart
3487  var y = end - start
3488  var len = Math.min(x, y)
3489
3490  var thisCopy = this.slice(thisStart, thisEnd)
3491  var targetCopy = target.slice(start, end)
3492
3493  for (var i = 0; i < len; ++i) {
3494    if (thisCopy[i] !== targetCopy[i]) {
3495      x = thisCopy[i]
3496      y = targetCopy[i]
3497      break
3498    }
3499  }
3500
3501  if (x < y) return -1
3502  if (y < x) return 1
3503  return 0
3504}
3505
3506// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,
3507// OR the last index of `val` in `buffer` at offset <= `byteOffset`.
3508//
3509// Arguments:
3510// - buffer - a Buffer to search
3511// - val - a string, Buffer, or number
3512// - byteOffset - an index into `buffer`; will be clamped to an int32
3513// - encoding - an optional encoding, relevant is val is a string
3514// - dir - true for indexOf, false for lastIndexOf
3515function bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {
3516  // Empty buffer means no match
3517  if (buffer.length === 0) return -1
3518
3519  // Normalize byteOffset
3520  if (typeof byteOffset === 'string') {
3521    encoding = byteOffset
3522    byteOffset = 0
3523  } else if (byteOffset > 0x7fffffff) {
3524    byteOffset = 0x7fffffff
3525  } else if (byteOffset < -0x80000000) {
3526    byteOffset = -0x80000000
3527  }
3528  byteOffset = +byteOffset // Coerce to Number.
3529  if (numberIsNaN(byteOffset)) {
3530    // byteOffset: it it's undefined, null, NaN, "foo", etc, search whole buffer
3531    byteOffset = dir ? 0 : (buffer.length - 1)
3532  }
3533
3534  // Normalize byteOffset: negative offsets start from the end of the buffer
3535  if (byteOffset < 0) byteOffset = buffer.length + byteOffset
3536  if (byteOffset >= buffer.length) {
3537    if (dir) return -1
3538    else byteOffset = buffer.length - 1
3539  } else if (byteOffset < 0) {
3540    if (dir) byteOffset = 0
3541    else return -1
3542  }
3543
3544  // Normalize val
3545  if (typeof val === 'string') {
3546    val = Buffer.from(val, encoding)
3547  }
3548
3549  // Finally, search either indexOf (if dir is true) or lastIndexOf
3550  if (Buffer.isBuffer(val)) {
3551    // Special case: looking for empty string/buffer always fails
3552    if (val.length === 0) {
3553      return -1
3554    }
3555    return arrayIndexOf(buffer, val, byteOffset, encoding, dir)
3556  } else if (typeof val === 'number') {
3557    val = val & 0xFF // Search for a byte value [0-255]
3558    if (typeof Uint8Array.prototype.indexOf === 'function') {
3559      if (dir) {
3560        return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)
3561      } else {
3562        return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)
3563      }
3564    }
3565    return arrayIndexOf(buffer, [val], byteOffset, encoding, dir)
3566  }
3567
3568  throw new TypeError('val must be string, number or Buffer')
3569}
3570
3571function arrayIndexOf (arr, val, byteOffset, encoding, dir) {
3572  var indexSize = 1
3573  var arrLength = arr.length
3574  var valLength = val.length
3575
3576  if (encoding !== undefined) {
3577    encoding = String(encoding).toLowerCase()
3578    if (encoding === 'ucs2' || encoding === 'ucs-2' ||
3579        encoding === 'utf16le' || encoding === 'utf-16le') {
3580      if (arr.length < 2 || val.length < 2) {
3581        return -1
3582      }
3583      indexSize = 2
3584      arrLength /= 2
3585      valLength /= 2
3586      byteOffset /= 2
3587    }
3588  }
3589
3590  function read (buf, i) {
3591    if (indexSize === 1) {
3592      return buf[i]
3593    } else {
3594      return buf.readUInt16BE(i * indexSize)
3595    }
3596  }
3597
3598  var i
3599  if (dir) {
3600    var foundIndex = -1
3601    for (i = byteOffset; i < arrLength; i++) {
3602      if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {
3603        if (foundIndex === -1) foundIndex = i
3604        if (i - foundIndex + 1 === valLength) return foundIndex * indexSize
3605      } else {
3606        if (foundIndex !== -1) i -= i - foundIndex
3607        foundIndex = -1
3608      }
3609    }
3610  } else {
3611    if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength
3612    for (i = byteOffset; i >= 0; i--) {
3613      var found = true
3614      for (var j = 0; j < valLength; j++) {
3615        if (read(arr, i + j) !== read(val, j)) {
3616          found = false
3617          break
3618        }
3619      }
3620      if (found) return i
3621    }
3622  }
3623
3624  return -1
3625}
3626
3627Buffer.prototype.includes = function includes (val, byteOffset, encoding) {
3628  return this.indexOf(val, byteOffset, encoding) !== -1
3629}
3630
3631Buffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {
3632  return bidirectionalIndexOf(this, val, byteOffset, encoding, true)
3633}
3634
3635Buffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {
3636  return bidirectionalIndexOf(this, val, byteOffset, encoding, false)
3637}
3638
3639function hexWrite (buf, string, offset, length) {
3640  offset = Number(offset) || 0
3641  var remaining = buf.length - offset
3642  if (!length) {
3643    length = remaining
3644  } else {
3645    length = Number(length)
3646    if (length > remaining) {
3647      length = remaining
3648    }
3649  }
3650
3651  var strLen = string.length
3652
3653  if (length > strLen / 2) {
3654    length = strLen / 2
3655  }
3656  for (var i = 0; i < length; ++i) {
3657    var parsed = parseInt(string.substr(i * 2, 2), 16)
3658    if (numberIsNaN(parsed)) return i
3659    buf[offset + i] = parsed
3660  }
3661  return i
3662}
3663
3664function utf8Write (buf, string, offset, length) {
3665  return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)
3666}
3667
3668function asciiWrite (buf, string, offset, length) {
3669  return blitBuffer(asciiToBytes(string), buf, offset, length)
3670}
3671
3672function latin1Write (buf, string, offset, length) {
3673  return asciiWrite(buf, string, offset, length)
3674}
3675
3676function base64Write (buf, string, offset, length) {
3677  return blitBuffer(base64ToBytes(string), buf, offset, length)
3678}
3679
3680function ucs2Write (buf, string, offset, length) {
3681  return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)
3682}
3683
3684Buffer.prototype.write = function write (string, offset, length, encoding) {
3685  // Buffer#write(string)
3686  if (offset === undefined) {
3687    encoding = 'utf8'
3688    length = this.length
3689    offset = 0
3690  // Buffer#write(string, encoding)
3691  } else if (length === undefined && typeof offset === 'string') {
3692    encoding = offset
3693    length = this.length
3694    offset = 0
3695  // Buffer#write(string, offset[, length][, encoding])
3696  } else if (isFinite(offset)) {
3697    offset = offset >>> 0
3698    if (isFinite(length)) {
3699      length = length >>> 0
3700      if (encoding === undefined) encoding = 'utf8'
3701    } else {
3702      encoding = length
3703      length = undefined
3704    }
3705  } else {
3706    throw new Error(
3707      'Buffer.write(string, encoding, offset[, length]) is no longer supported'
3708    )
3709  }
3710
3711  var remaining = this.length - offset
3712  if (length === undefined || length > remaining) length = remaining
3713
3714  if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {
3715    throw new RangeError('Attempt to write outside buffer bounds')
3716  }
3717
3718  if (!encoding) encoding = 'utf8'
3719
3720  var loweredCase = false
3721  for (;;) {
3722    switch (encoding) {
3723      case 'hex':
3724        return hexWrite(this, string, offset, length)
3725
3726      case 'utf8':
3727      case 'utf-8':
3728        return utf8Write(this, string, offset, length)
3729
3730      case 'ascii':
3731        return asciiWrite(this, string, offset, length)
3732
3733      case 'latin1':
3734      case 'binary':
3735        return latin1Write(this, string, offset, length)
3736
3737      case 'base64':
3738        // Warning: maxLength not taken into account in base64Write
3739        return base64Write(this, string, offset, length)
3740
3741      case 'ucs2':
3742      case 'ucs-2':
3743      case 'utf16le':
3744      case 'utf-16le':
3745        return ucs2Write(this, string, offset, length)
3746
3747      default:
3748        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)
3749        encoding = ('' + encoding).toLowerCase()
3750        loweredCase = true
3751    }
3752  }
3753}
3754
3755Buffer.prototype.toJSON = function toJSON () {
3756  return {
3757    type: 'Buffer',
3758    data: Array.prototype.slice.call(this._arr || this, 0)
3759  }
3760}
3761
3762function base64Slice (buf, start, end) {
3763  if (start === 0 && end === buf.length) {
3764    return base64.fromByteArray(buf)
3765  } else {
3766    return base64.fromByteArray(buf.slice(start, end))
3767  }
3768}
3769
3770function utf8Slice (buf, start, end) {
3771  end = Math.min(buf.length, end)
3772  var res = []
3773
3774  var i = start
3775  while (i < end) {
3776    var firstByte = buf[i]
3777    var codePoint = null
3778    var bytesPerSequence = (firstByte > 0xEF) ? 4
3779      : (firstByte > 0xDF) ? 3
3780        : (firstByte > 0xBF) ? 2
3781          : 1
3782
3783    if (i + bytesPerSequence <= end) {
3784      var secondByte, thirdByte, fourthByte, tempCodePoint
3785
3786      switch (bytesPerSequence) {
3787        case 1:
3788          if (firstByte < 0x80) {
3789            codePoint = firstByte
3790          }
3791          break
3792        case 2:
3793          secondByte = buf[i + 1]
3794          if ((secondByte & 0xC0) === 0x80) {
3795            tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)
3796            if (tempCodePoint > 0x7F) {
3797              codePoint = tempCodePoint
3798            }
3799          }
3800          break
3801        case 3:
3802          secondByte = buf[i + 1]
3803          thirdByte = buf[i + 2]
3804          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {
3805            tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)
3806            if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {
3807              codePoint = tempCodePoint
3808            }
3809          }
3810          break
3811        case 4:
3812          secondByte = buf[i + 1]
3813          thirdByte = buf[i + 2]
3814          fourthByte = buf[i + 3]
3815          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {
3816            tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)
3817            if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {
3818              codePoint = tempCodePoint
3819            }
3820          }
3821      }
3822    }
3823
3824    if (codePoint === null) {
3825      // we did not generate a valid codePoint so insert a
3826      // replacement char (U+FFFD) and advance only 1 byte
3827      codePoint = 0xFFFD
3828      bytesPerSequence = 1
3829    } else if (codePoint > 0xFFFF) {
3830      // encode to utf16 (surrogate pair dance)
3831      codePoint -= 0x10000
3832      res.push(codePoint >>> 10 & 0x3FF | 0xD800)
3833      codePoint = 0xDC00 | codePoint & 0x3FF
3834    }
3835
3836    res.push(codePoint)
3837    i += bytesPerSequence
3838  }
3839
3840  return decodeCodePointsArray(res)
3841}
3842
3843// Based on http://stackoverflow.com/a/22747272/680742, the browser with
3844// the lowest limit is Chrome, with 0x10000 args.
3845// We go 1 magnitude less, for safety
3846var MAX_ARGUMENTS_LENGTH = 0x1000
3847
3848function decodeCodePointsArray (codePoints) {
3849  var len = codePoints.length
3850  if (len <= MAX_ARGUMENTS_LENGTH) {
3851    return String.fromCharCode.apply(String, codePoints) // avoid extra slice()
3852  }
3853
3854  // Decode in chunks to avoid "call stack size exceeded".
3855  var res = ''
3856  var i = 0
3857  while (i < len) {
3858    res += String.fromCharCode.apply(
3859      String,
3860      codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)
3861    )
3862  }
3863  return res
3864}
3865
3866function asciiSlice (buf, start, end) {
3867  var ret = ''
3868  end = Math.min(buf.length, end)
3869
3870  for (var i = start; i < end; ++i) {
3871    ret += String.fromCharCode(buf[i] & 0x7F)
3872  }
3873  return ret
3874}
3875
3876function latin1Slice (buf, start, end) {
3877  var ret = ''
3878  end = Math.min(buf.length, end)
3879
3880  for (var i = start; i < end; ++i) {
3881    ret += String.fromCharCode(buf[i])
3882  }
3883  return ret
3884}
3885
3886function hexSlice (buf, start, end) {
3887  var len = buf.length
3888
3889  if (!start || start < 0) start = 0
3890  if (!end || end < 0 || end > len) end = len
3891
3892  var out = ''
3893  for (var i = start; i < end; ++i) {
3894    out += hexSliceLookupTable[buf[i]]
3895  }
3896  return out
3897}
3898
3899function utf16leSlice (buf, start, end) {
3900  var bytes = buf.slice(start, end)
3901  var res = ''
3902  for (var i = 0; i < bytes.length; i += 2) {
3903    res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256))
3904  }
3905  return res
3906}
3907
3908Buffer.prototype.slice = function slice (start, end) {
3909  var len = this.length
3910  start = ~~start
3911  end = end === undefined ? len : ~~end
3912
3913  if (start < 0) {
3914    start += len
3915    if (start < 0) start = 0
3916  } else if (start > len) {
3917    start = len
3918  }
3919
3920  if (end < 0) {
3921    end += len
3922    if (end < 0) end = 0
3923  } else if (end > len) {
3924    end = len
3925  }
3926
3927  if (end < start) end = start
3928
3929  var newBuf = this.subarray(start, end)
3930  // Return an augmented `Uint8Array` instance
3931  Object.setPrototypeOf(newBuf, Buffer.prototype)
3932
3933  return newBuf
3934}
3935
3936/*
3937 * Need to make sure that buffer isn't trying to write out of bounds.
3938 */
3939function checkOffset (offset, ext, length) {
3940  if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')
3941  if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')
3942}
3943
3944Buffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {
3945  offset = offset >>> 0
3946  byteLength = byteLength >>> 0
3947  if (!noAssert) checkOffset(offset, byteLength, this.length)
3948
3949  var val = this[offset]
3950  var mul = 1
3951  var i = 0
3952  while (++i < byteLength && (mul *= 0x100)) {
3953    val += this[offset + i] * mul
3954  }
3955
3956  return val
3957}
3958
3959Buffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {
3960  offset = offset >>> 0
3961  byteLength = byteLength >>> 0
3962  if (!noAssert) {
3963    checkOffset(offset, byteLength, this.length)
3964  }
3965
3966  var val = this[offset + --byteLength]
3967  var mul = 1
3968  while (byteLength > 0 && (mul *= 0x100)) {
3969    val += this[offset + --byteLength] * mul
3970  }
3971
3972  return val
3973}
3974
3975Buffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {
3976  offset = offset >>> 0
3977  if (!noAssert) checkOffset(offset, 1, this.length)
3978  return this[offset]
3979}
3980
3981Buffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {
3982  offset = offset >>> 0
3983  if (!noAssert) checkOffset(offset, 2, this.length)
3984  return this[offset] | (this[offset + 1] << 8)
3985}
3986
3987Buffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {
3988  offset = offset >>> 0
3989  if (!noAssert) checkOffset(offset, 2, this.length)
3990  return (this[offset] << 8) | this[offset + 1]
3991}
3992
3993Buffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {
3994  offset = offset >>> 0
3995  if (!noAssert) checkOffset(offset, 4, this.length)
3996
3997  return ((this[offset]) |
3998      (this[offset + 1] << 8) |
3999      (this[offset + 2] << 16)) +
4000      (this[offset + 3] * 0x1000000)
4001}
4002
4003Buffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {
4004  offset = offset >>> 0
4005  if (!noAssert) checkOffset(offset, 4, this.length)
4006
4007  return (this[offset] * 0x1000000) +
4008    ((this[offset + 1] << 16) |
4009    (this[offset + 2] << 8) |
4010    this[offset + 3])
4011}
4012
4013Buffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {
4014  offset = offset >>> 0
4015  byteLength = byteLength >>> 0
4016  if (!noAssert) checkOffset(offset, byteLength, this.length)
4017
4018  var val = this[offset]
4019  var mul = 1
4020  var i = 0
4021  while (++i < byteLength && (mul *= 0x100)) {
4022    val += this[offset + i] * mul
4023  }
4024  mul *= 0x80
4025
4026  if (val >= mul) val -= Math.pow(2, 8 * byteLength)
4027
4028  return val
4029}
4030
4031Buffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {
4032  offset = offset >>> 0
4033  byteLength = byteLength >>> 0
4034  if (!noAssert) checkOffset(offset, byteLength, this.length)
4035
4036  var i = byteLength
4037  var mul = 1
4038  var val = this[offset + --i]
4039  while (i > 0 && (mul *= 0x100)) {
4040    val += this[offset + --i] * mul
4041  }
4042  mul *= 0x80
4043
4044  if (val >= mul) val -= Math.pow(2, 8 * byteLength)
4045
4046  return val
4047}
4048
4049Buffer.prototype.readInt8 = function readInt8 (offset, noAssert) {
4050  offset = offset >>> 0
4051  if (!noAssert) checkOffset(offset, 1, this.length)
4052  if (!(this[offset] & 0x80)) return (this[offset])
4053  return ((0xff - this[offset] + 1) * -1)
4054}
4055
4056Buffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {
4057  offset = offset >>> 0
4058  if (!noAssert) checkOffset(offset, 2, this.length)
4059  var val = this[offset] | (this[offset + 1] << 8)
4060  return (val & 0x8000) ? val | 0xFFFF0000 : val
4061}
4062
4063Buffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {
4064  offset = offset >>> 0
4065  if (!noAssert) checkOffset(offset, 2, this.length)
4066  var val = this[offset + 1] | (this[offset] << 8)
4067  return (val & 0x8000) ? val | 0xFFFF0000 : val
4068}
4069
4070Buffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {
4071  offset = offset >>> 0
4072  if (!noAssert) checkOffset(offset, 4, this.length)
4073
4074  return (this[offset]) |
4075    (this[offset + 1] << 8) |
4076    (this[offset + 2] << 16) |
4077    (this[offset + 3] << 24)
4078}
4079
4080Buffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {
4081  offset = offset >>> 0
4082  if (!noAssert) checkOffset(offset, 4, this.length)
4083
4084  return (this[offset] << 24) |
4085    (this[offset + 1] << 16) |
4086    (this[offset + 2] << 8) |
4087    (this[offset + 3])
4088}
4089
4090Buffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {
4091  offset = offset >>> 0
4092  if (!noAssert) checkOffset(offset, 4, this.length)
4093  return ieee754.read(this, offset, true, 23, 4)
4094}
4095
4096Buffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {
4097  offset = offset >>> 0
4098  if (!noAssert) checkOffset(offset, 4, this.length)
4099  return ieee754.read(this, offset, false, 23, 4)
4100}
4101
4102Buffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {
4103  offset = offset >>> 0
4104  if (!noAssert) checkOffset(offset, 8, this.length)
4105  return ieee754.read(this, offset, true, 52, 8)
4106}
4107
4108Buffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {
4109  offset = offset >>> 0
4110  if (!noAssert) checkOffset(offset, 8, this.length)
4111  return ieee754.read(this, offset, false, 52, 8)
4112}
4113
4114function checkInt (buf, value, offset, ext, max, min) {
4115  if (!Buffer.isBuffer(buf)) throw new TypeError('"buffer" argument must be a Buffer instance')
4116  if (value > max || value < min) throw new RangeError('"value" argument is out of bounds')
4117  if (offset + ext > buf.length) throw new RangeError('Index out of range')
4118}
4119
4120Buffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {
4121  value = +value
4122  offset = offset >>> 0
4123  byteLength = byteLength >>> 0
4124  if (!noAssert) {
4125    var maxBytes = Math.pow(2, 8 * byteLength) - 1
4126    checkInt(this, value, offset, byteLength, maxBytes, 0)
4127  }
4128
4129  var mul = 1
4130  var i = 0
4131  this[offset] = value & 0xFF
4132  while (++i < byteLength && (mul *= 0x100)) {
4133    this[offset + i] = (value / mul) & 0xFF
4134  }
4135
4136  return offset + byteLength
4137}
4138
4139Buffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {
4140  value = +value
4141  offset = offset >>> 0
4142  byteLength = byteLength >>> 0
4143  if (!noAssert) {
4144    var maxBytes = Math.pow(2, 8 * byteLength) - 1
4145    checkInt(this, value, offset, byteLength, maxBytes, 0)
4146  }
4147
4148  var i = byteLength - 1
4149  var mul = 1
4150  this[offset + i] = value & 0xFF
4151  while (--i >= 0 && (mul *= 0x100)) {
4152    this[offset + i] = (value / mul) & 0xFF
4153  }
4154
4155  return offset + byteLength
4156}
4157
4158Buffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {
4159  value = +value
4160  offset = offset >>> 0
4161  if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)
4162  this[offset] = (value & 0xff)
4163  return offset + 1
4164}
4165
4166Buffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {
4167  value = +value
4168  offset = offset >>> 0
4169  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)
4170  this[offset] = (value & 0xff)
4171  this[offset + 1] = (value >>> 8)
4172  return offset + 2
4173}
4174
4175Buffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {
4176  value = +value
4177  offset = offset >>> 0
4178  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)
4179  this[offset] = (value >>> 8)
4180  this[offset + 1] = (value & 0xff)
4181  return offset + 2
4182}
4183
4184Buffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {
4185  value = +value
4186  offset = offset >>> 0
4187  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)
4188  this[offset + 3] = (value >>> 24)
4189  this[offset + 2] = (value >>> 16)
4190  this[offset + 1] = (value >>> 8)
4191  this[offset] = (value & 0xff)
4192  return offset + 4
4193}
4194
4195Buffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {
4196  value = +value
4197  offset = offset >>> 0
4198  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)
4199  this[offset] = (value >>> 24)
4200  this[offset + 1] = (value >>> 16)
4201  this[offset + 2] = (value >>> 8)
4202  this[offset + 3] = (value & 0xff)
4203  return offset + 4
4204}
4205
4206Buffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {
4207  value = +value
4208  offset = offset >>> 0
4209  if (!noAssert) {
4210    var limit = Math.pow(2, (8 * byteLength) - 1)
4211
4212    checkInt(this, value, offset, byteLength, limit - 1, -limit)
4213  }
4214
4215  var i = 0
4216  var mul = 1
4217  var sub = 0
4218  this[offset] = value & 0xFF
4219  while (++i < byteLength && (mul *= 0x100)) {
4220    if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {
4221      sub = 1
4222    }
4223    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF
4224  }
4225
4226  return offset + byteLength
4227}
4228
4229Buffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {
4230  value = +value
4231  offset = offset >>> 0
4232  if (!noAssert) {
4233    var limit = Math.pow(2, (8 * byteLength) - 1)
4234
4235    checkInt(this, value, offset, byteLength, limit - 1, -limit)
4236  }
4237
4238  var i = byteLength - 1
4239  var mul = 1
4240  var sub = 0
4241  this[offset + i] = value & 0xFF
4242  while (--i >= 0 && (mul *= 0x100)) {
4243    if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {
4244      sub = 1
4245    }
4246    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF
4247  }
4248
4249  return offset + byteLength
4250}
4251
4252Buffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {
4253  value = +value
4254  offset = offset >>> 0
4255  if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)
4256  if (value < 0) value = 0xff + value + 1
4257  this[offset] = (value & 0xff)
4258  return offset + 1
4259}
4260
4261Buffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {
4262  value = +value
4263  offset = offset >>> 0
4264  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)
4265  this[offset] = (value & 0xff)
4266  this[offset + 1] = (value >>> 8)
4267  return offset + 2
4268}
4269
4270Buffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {
4271  value = +value
4272  offset = offset >>> 0
4273  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)
4274  this[offset] = (value >>> 8)
4275  this[offset + 1] = (value & 0xff)
4276  return offset + 2
4277}
4278
4279Buffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {
4280  value = +value
4281  offset = offset >>> 0
4282  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)
4283  this[offset] = (value & 0xff)
4284  this[offset + 1] = (value >>> 8)
4285  this[offset + 2] = (value >>> 16)
4286  this[offset + 3] = (value >>> 24)
4287  return offset + 4
4288}
4289
4290Buffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {
4291  value = +value
4292  offset = offset >>> 0
4293  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)
4294  if (value < 0) value = 0xffffffff + value + 1
4295  this[offset] = (value >>> 24)
4296  this[offset + 1] = (value >>> 16)
4297  this[offset + 2] = (value >>> 8)
4298  this[offset + 3] = (value & 0xff)
4299  return offset + 4
4300}
4301
4302function checkIEEE754 (buf, value, offset, ext, max, min) {
4303  if (offset + ext > buf.length) throw new RangeError('Index out of range')
4304  if (offset < 0) throw new RangeError('Index out of range')
4305}
4306
4307function writeFloat (buf, value, offset, littleEndian, noAssert) {
4308  value = +value
4309  offset = offset >>> 0
4310  if (!noAssert) {
4311    checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)
4312  }
4313  ieee754.write(buf, value, offset, littleEndian, 23, 4)
4314  return offset + 4
4315}
4316
4317Buffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {
4318  return writeFloat(this, value, offset, true, noAssert)
4319}
4320
4321Buffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {
4322  return writeFloat(this, value, offset, false, noAssert)
4323}
4324
4325function writeDouble (buf, value, offset, littleEndian, noAssert) {
4326  value = +value
4327  offset = offset >>> 0
4328  if (!noAssert) {
4329    checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)
4330  }
4331  ieee754.write(buf, value, offset, littleEndian, 52, 8)
4332  return offset + 8
4333}
4334
4335Buffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {
4336  return writeDouble(this, value, offset, true, noAssert)
4337}
4338
4339Buffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {
4340  return writeDouble(this, value, offset, false, noAssert)
4341}
4342
4343// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)
4344Buffer.prototype.copy = function copy (target, targetStart, start, end) {
4345  if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')
4346  if (!start) start = 0
4347  if (!end && end !== 0) end = this.length
4348  if (targetStart >= target.length) targetStart = target.length
4349  if (!targetStart) targetStart = 0
4350  if (end > 0 && end < start) end = start
4351
4352  // Copy 0 bytes; we're done
4353  if (end === start) return 0
4354  if (target.length === 0 || this.length === 0) return 0
4355
4356  // Fatal error conditions
4357  if (targetStart < 0) {
4358    throw new RangeError('targetStart out of bounds')
4359  }
4360  if (start < 0 || start >= this.length) throw new RangeError('Index out of range')
4361  if (end < 0) throw new RangeError('sourceEnd out of bounds')
4362
4363  // Are we oob?
4364  if (end > this.length) end = this.length
4365  if (target.length - targetStart < end - start) {
4366    end = target.length - targetStart + start
4367  }
4368
4369  var len = end - start
4370
4371  if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {
4372    // Use built-in when available, missing from IE11
4373    this.copyWithin(targetStart, start, end)
4374  } else if (this === target && start < targetStart && targetStart < end) {
4375    // descending copy from end
4376    for (var i = len - 1; i >= 0; --i) {
4377      target[i + targetStart] = this[i + start]
4378    }
4379  } else {
4380    Uint8Array.prototype.set.call(
4381      target,
4382      this.subarray(start, end),
4383      targetStart
4384    )
4385  }
4386
4387  return len
4388}
4389
4390// Usage:
4391//    buffer.fill(number[, offset[, end]])
4392//    buffer.fill(buffer[, offset[, end]])
4393//    buffer.fill(string[, offset[, end]][, encoding])
4394Buffer.prototype.fill = function fill (val, start, end, encoding) {
4395  // Handle string cases:
4396  if (typeof val === 'string') {
4397    if (typeof start === 'string') {
4398      encoding = start
4399      start = 0
4400      end = this.length
4401    } else if (typeof end === 'string') {
4402      encoding = end
4403      end = this.length
4404    }
4405    if (encoding !== undefined && typeof encoding !== 'string') {
4406      throw new TypeError('encoding must be a string')
4407    }
4408    if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {
4409      throw new TypeError('Unknown encoding: ' + encoding)
4410    }
4411    if (val.length === 1) {
4412      var code = val.charCodeAt(0)
4413      if ((encoding === 'utf8' && code < 128) ||
4414          encoding === 'latin1') {
4415        // Fast path: If `val` fits into a single byte, use that numeric value.
4416        val = code
4417      }
4418    }
4419  } else if (typeof val === 'number') {
4420    val = val & 255
4421  } else if (typeof val === 'boolean') {
4422    val = Number(val)
4423  }
4424
4425  // Invalid ranges are not set to a default, so can range check early.
4426  if (start < 0 || this.length < start || this.length < end) {
4427    throw new RangeError('Out of range index')
4428  }
4429
4430  if (end <= start) {
4431    return this
4432  }
4433
4434  start = start >>> 0
4435  end = end === undefined ? this.length : end >>> 0
4436
4437  if (!val) val = 0
4438
4439  var i
4440  if (typeof val === 'number') {
4441    for (i = start; i < end; ++i) {
4442      this[i] = val
4443    }
4444  } else {
4445    var bytes = Buffer.isBuffer(val)
4446      ? val
4447      : Buffer.from(val, encoding)
4448    var len = bytes.length
4449    if (len === 0) {
4450      throw new TypeError('The value "' + val +
4451        '" is invalid for argument "value"')
4452    }
4453    for (i = 0; i < end - start; ++i) {
4454      this[i + start] = bytes[i % len]
4455    }
4456  }
4457
4458  return this
4459}
4460
4461// HELPER FUNCTIONS
4462// ================
4463
4464var INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g
4465
4466function base64clean (str) {
4467  // Node takes equal signs as end of the Base64 encoding
4468  str = str.split('=')[0]
4469  // Node strips out invalid characters like \n and \t from the string, base64-js does not
4470  str = str.trim().replace(INVALID_BASE64_RE, '')
4471  // Node converts strings with length < 2 to ''
4472  if (str.length < 2) return ''
4473  // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not
4474  while (str.length % 4 !== 0) {
4475    str = str + '='
4476  }
4477  return str
4478}
4479
4480function utf8ToBytes (string, units) {
4481  units = units || Infinity
4482  var codePoint
4483  var length = string.length
4484  var leadSurrogate = null
4485  var bytes = []
4486
4487  for (var i = 0; i < length; ++i) {
4488    codePoint = string.charCodeAt(i)
4489
4490    // is surrogate component
4491    if (codePoint > 0xD7FF && codePoint < 0xE000) {
4492      // last char was a lead
4493      if (!leadSurrogate) {
4494        // no lead yet
4495        if (codePoint > 0xDBFF) {
4496          // unexpected trail
4497          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
4498          continue
4499        } else if (i + 1 === length) {
4500          // unpaired lead
4501          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
4502          continue
4503        }
4504
4505        // valid lead
4506        leadSurrogate = codePoint
4507
4508        continue
4509      }
4510
4511      // 2 leads in a row
4512      if (codePoint < 0xDC00) {
4513        if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
4514        leadSurrogate = codePoint
4515        continue
4516      }
4517
4518      // valid surrogate pair
4519      codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000
4520    } else if (leadSurrogate) {
4521      // valid bmp char, but last char was a lead
4522      if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
4523    }
4524
4525    leadSurrogate = null
4526
4527    // encode utf8
4528    if (codePoint < 0x80) {
4529      if ((units -= 1) < 0) break
4530      bytes.push(codePoint)
4531    } else if (codePoint < 0x800) {
4532      if ((units -= 2) < 0) break
4533      bytes.push(
4534        codePoint >> 0x6 | 0xC0,
4535        codePoint & 0x3F | 0x80
4536      )
4537    } else if (codePoint < 0x10000) {
4538      if ((units -= 3) < 0) break
4539      bytes.push(
4540        codePoint >> 0xC | 0xE0,
4541        codePoint >> 0x6 & 0x3F | 0x80,
4542        codePoint & 0x3F | 0x80
4543      )
4544    } else if (codePoint < 0x110000) {
4545      if ((units -= 4) < 0) break
4546      bytes.push(
4547        codePoint >> 0x12 | 0xF0,
4548        codePoint >> 0xC & 0x3F | 0x80,
4549        codePoint >> 0x6 & 0x3F | 0x80,
4550        codePoint & 0x3F | 0x80
4551      )
4552    } else {
4553      throw new Error('Invalid code point')
4554    }
4555  }
4556
4557  return bytes
4558}
4559
4560function asciiToBytes (str) {
4561  var byteArray = []
4562  for (var i = 0; i < str.length; ++i) {
4563    // Node's code seems to be doing this and not & 0x7F..
4564    byteArray.push(str.charCodeAt(i) & 0xFF)
4565  }
4566  return byteArray
4567}
4568
4569function utf16leToBytes (str, units) {
4570  var c, hi, lo
4571  var byteArray = []
4572  for (var i = 0; i < str.length; ++i) {
4573    if ((units -= 2) < 0) break
4574
4575    c = str.charCodeAt(i)
4576    hi = c >> 8
4577    lo = c % 256
4578    byteArray.push(lo)
4579    byteArray.push(hi)
4580  }
4581
4582  return byteArray
4583}
4584
4585function base64ToBytes (str) {
4586  return base64.toByteArray(base64clean(str))
4587}
4588
4589function blitBuffer (src, dst, offset, length) {
4590  for (var i = 0; i < length; ++i) {
4591    if ((i + offset >= dst.length) || (i >= src.length)) break
4592    dst[i + offset] = src[i]
4593  }
4594  return i
4595}
4596
4597// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass
4598// the `instanceof` check but they should be treated as of that type.
4599// See: https://github.com/feross/buffer/issues/166
4600function isInstance (obj, type) {
4601  return obj instanceof type ||
4602    (obj != null && obj.constructor != null && obj.constructor.name != null &&
4603      obj.constructor.name === type.name)
4604}
4605function numberIsNaN (obj) {
4606  // For IE11 support
4607  return obj !== obj // eslint-disable-line no-self-compare
4608}
4609
4610// Create lookup table for `toString('hex')`
4611// See: https://github.com/feross/buffer/issues/219
4612var hexSliceLookupTable = (function () {
4613  var alphabet = '0123456789abcdef'
4614  var table = new Array(256)
4615  for (var i = 0; i < 16; ++i) {
4616    var i16 = i * 16
4617    for (var j = 0; j < 16; ++j) {
4618      table[i16 + j] = alphabet[i] + alphabet[j]
4619    }
4620  }
4621  return table
4622})()
4623
4624}).call(this,require("buffer").Buffer)
4625},{"base64-js":7,"buffer":9,"ieee754":10}],10:[function(require,module,exports){
4626exports.read = function (buffer, offset, isLE, mLen, nBytes) {
4627  var e, m
4628  var eLen = (nBytes * 8) - mLen - 1
4629  var eMax = (1 << eLen) - 1
4630  var eBias = eMax >> 1
4631  var nBits = -7
4632  var i = isLE ? (nBytes - 1) : 0
4633  var d = isLE ? -1 : 1
4634  var s = buffer[offset + i]
4635
4636  i += d
4637
4638  e = s & ((1 << (-nBits)) - 1)
4639  s >>= (-nBits)
4640  nBits += eLen
4641  for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}
4642
4643  m = e & ((1 << (-nBits)) - 1)
4644  e >>= (-nBits)
4645  nBits += mLen
4646  for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}
4647
4648  if (e === 0) {
4649    e = 1 - eBias
4650  } else if (e === eMax) {
4651    return m ? NaN : ((s ? -1 : 1) * Infinity)
4652  } else {
4653    m = m + Math.pow(2, mLen)
4654    e = e - eBias
4655  }
4656  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)
4657}
4658
4659exports.write = function (buffer, value, offset, isLE, mLen, nBytes) {
4660  var e, m, c
4661  var eLen = (nBytes * 8) - mLen - 1
4662  var eMax = (1 << eLen) - 1
4663  var eBias = eMax >> 1
4664  var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)
4665  var i = isLE ? 0 : (nBytes - 1)
4666  var d = isLE ? 1 : -1
4667  var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0
4668
4669  value = Math.abs(value)
4670
4671  if (isNaN(value) || value === Infinity) {
4672    m = isNaN(value) ? 1 : 0
4673    e = eMax
4674  } else {
4675    e = Math.floor(Math.log(value) / Math.LN2)
4676    if (value * (c = Math.pow(2, -e)) < 1) {
4677      e--
4678      c *= 2
4679    }
4680    if (e + eBias >= 1) {
4681      value += rt / c
4682    } else {
4683      value += rt * Math.pow(2, 1 - eBias)
4684    }
4685    if (value * c >= 2) {
4686      e++
4687      c /= 2
4688    }
4689
4690    if (e + eBias >= eMax) {
4691      m = 0
4692      e = eMax
4693    } else if (e + eBias >= 1) {
4694      m = ((value * c) - 1) * Math.pow(2, mLen)
4695      e = e + eBias
4696    } else {
4697      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)
4698      e = 0
4699    }
4700  }
4701
4702  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}
4703
4704  e = (e << mLen) | m
4705  eLen += mLen
4706  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}
4707
4708  buffer[offset + i - d] |= s * 128
4709}
4710
4711},{}],11:[function(require,module,exports){
4712/*
4713object-assign
4714(c) Sindre Sorhus
4715@license MIT
4716*/
4717
4718'use strict';
4719/* eslint-disable no-unused-vars */
4720var getOwnPropertySymbols = Object.getOwnPropertySymbols;
4721var hasOwnProperty = Object.prototype.hasOwnProperty;
4722var propIsEnumerable = Object.prototype.propertyIsEnumerable;
4723
4724function toObject(val) {
4725	if (val === null || val === undefined) {
4726		throw new TypeError('Object.assign cannot be called with null or undefined');
4727	}
4728
4729	return Object(val);
4730}
4731
4732function shouldUseNative() {
4733	try {
4734		if (!Object.assign) {
4735			return false;
4736		}
4737
4738		// Detect buggy property enumeration order in older V8 versions.
4739
4740		// https://bugs.chromium.org/p/v8/issues/detail?id=4118
4741		var test1 = new String('abc');  // eslint-disable-line no-new-wrappers
4742		test1[5] = 'de';
4743		if (Object.getOwnPropertyNames(test1)[0] === '5') {
4744			return false;
4745		}
4746
4747		// https://bugs.chromium.org/p/v8/issues/detail?id=3056
4748		var test2 = {};
4749		for (var i = 0; i < 10; i++) {
4750			test2['_' + String.fromCharCode(i)] = i;
4751		}
4752		var order2 = Object.getOwnPropertyNames(test2).map(function (n) {
4753			return test2[n];
4754		});
4755		if (order2.join('') !== '0123456789') {
4756			return false;
4757		}
4758
4759		// https://bugs.chromium.org/p/v8/issues/detail?id=3056
4760		var test3 = {};
4761		'abcdefghijklmnopqrst'.split('').forEach(function (letter) {
4762			test3[letter] = letter;
4763		});
4764		if (Object.keys(Object.assign({}, test3)).join('') !==
4765				'abcdefghijklmnopqrst') {
4766			return false;
4767		}
4768
4769		return true;
4770	} catch (err) {
4771		// We don't expect any of the above to throw, but better to be safe.
4772		return false;
4773	}
4774}
4775
4776module.exports = shouldUseNative() ? Object.assign : function (target, source) {
4777	var from;
4778	var to = toObject(target);
4779	var symbols;
4780
4781	for (var s = 1; s < arguments.length; s++) {
4782		from = Object(arguments[s]);
4783
4784		for (var key in from) {
4785			if (hasOwnProperty.call(from, key)) {
4786				to[key] = from[key];
4787			}
4788		}
4789
4790		if (getOwnPropertySymbols) {
4791			symbols = getOwnPropertySymbols(from);
4792			for (var i = 0; i < symbols.length; i++) {
4793				if (propIsEnumerable.call(from, symbols[i])) {
4794					to[symbols[i]] = from[symbols[i]];
4795				}
4796			}
4797		}
4798	}
4799
4800	return to;
4801};
4802
4803},{}],12:[function(require,module,exports){
4804// shim for using process in browser
4805var process = module.exports = {};
4806
4807// cached from whatever global is present so that test runners that stub it
4808// don't break things.  But we need to wrap it in a try catch in case it is
4809// wrapped in strict mode code which doesn't define any globals.  It's inside a
4810// function because try/catches deoptimize in certain engines.
4811
4812var cachedSetTimeout;
4813var cachedClearTimeout;
4814
4815function defaultSetTimout() {
4816    throw new Error('setTimeout has not been defined');
4817}
4818function defaultClearTimeout () {
4819    throw new Error('clearTimeout has not been defined');
4820}
4821(function () {
4822    try {
4823        if (typeof setTimeout === 'function') {
4824            cachedSetTimeout = setTimeout;
4825        } else {
4826            cachedSetTimeout = defaultSetTimout;
4827        }
4828    } catch (e) {
4829        cachedSetTimeout = defaultSetTimout;
4830    }
4831    try {
4832        if (typeof clearTimeout === 'function') {
4833            cachedClearTimeout = clearTimeout;
4834        } else {
4835            cachedClearTimeout = defaultClearTimeout;
4836        }
4837    } catch (e) {
4838        cachedClearTimeout = defaultClearTimeout;
4839    }
4840} ())
4841function runTimeout(fun) {
4842    if (cachedSetTimeout === setTimeout) {
4843        //normal enviroments in sane situations
4844        return setTimeout(fun, 0);
4845    }
4846    // if setTimeout wasn't available but was latter defined
4847    if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {
4848        cachedSetTimeout = setTimeout;
4849        return setTimeout(fun, 0);
4850    }
4851    try {
4852        // when when somebody has screwed with setTimeout but no I.E. maddness
4853        return cachedSetTimeout(fun, 0);
4854    } catch(e){
4855        try {
4856            // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally
4857            return cachedSetTimeout.call(null, fun, 0);
4858        } catch(e){
4859            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error
4860            return cachedSetTimeout.call(this, fun, 0);
4861        }
4862    }
4863
4864
4865}
4866function runClearTimeout(marker) {
4867    if (cachedClearTimeout === clearTimeout) {
4868        //normal enviroments in sane situations
4869        return clearTimeout(marker);
4870    }
4871    // if clearTimeout wasn't available but was latter defined
4872    if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {
4873        cachedClearTimeout = clearTimeout;
4874        return clearTimeout(marker);
4875    }
4876    try {
4877        // when when somebody has screwed with setTimeout but no I.E. maddness
4878        return cachedClearTimeout(marker);
4879    } catch (e){
4880        try {
4881            // When we are in I.E. but the script has been evaled so I.E. doesn't  trust the global object when called normally
4882            return cachedClearTimeout.call(null, marker);
4883        } catch (e){
4884            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.
4885            // Some versions of I.E. have different rules for clearTimeout vs setTimeout
4886            return cachedClearTimeout.call(this, marker);
4887        }
4888    }
4889
4890
4891
4892}
4893var queue = [];
4894var draining = false;
4895var currentQueue;
4896var queueIndex = -1;
4897
4898function cleanUpNextTick() {
4899    if (!draining || !currentQueue) {
4900        return;
4901    }
4902    draining = false;
4903    if (currentQueue.length) {
4904        queue = currentQueue.concat(queue);
4905    } else {
4906        queueIndex = -1;
4907    }
4908    if (queue.length) {
4909        drainQueue();
4910    }
4911}
4912
4913function drainQueue() {
4914    if (draining) {
4915        return;
4916    }
4917    var timeout = runTimeout(cleanUpNextTick);
4918    draining = true;
4919
4920    var len = queue.length;
4921    while(len) {
4922        currentQueue = queue;
4923        queue = [];
4924        while (++queueIndex < len) {
4925            if (currentQueue) {
4926                currentQueue[queueIndex].run();
4927            }
4928        }
4929        queueIndex = -1;
4930        len = queue.length;
4931    }
4932    currentQueue = null;
4933    draining = false;
4934    runClearTimeout(timeout);
4935}
4936
4937process.nextTick = function (fun) {
4938    var args = new Array(arguments.length - 1);
4939    if (arguments.length > 1) {
4940        for (var i = 1; i < arguments.length; i++) {
4941            args[i - 1] = arguments[i];
4942        }
4943    }
4944    queue.push(new Item(fun, args));
4945    if (queue.length === 1 && !draining) {
4946        runTimeout(drainQueue);
4947    }
4948};
4949
4950// v8 likes predictible objects
4951function Item(fun, array) {
4952    this.fun = fun;
4953    this.array = array;
4954}
4955Item.prototype.run = function () {
4956    this.fun.apply(null, this.array);
4957};
4958process.title = 'browser';
4959process.browser = true;
4960process.env = {};
4961process.argv = [];
4962process.version = ''; // empty string to avoid regexp issues
4963process.versions = {};
4964
4965function noop() {}
4966
4967process.on = noop;
4968process.addListener = noop;
4969process.once = noop;
4970process.off = noop;
4971process.removeListener = noop;
4972process.removeAllListeners = noop;
4973process.emit = noop;
4974process.prependListener = noop;
4975process.prependOnceListener = noop;
4976
4977process.listeners = function (name) { return [] }
4978
4979process.binding = function (name) {
4980    throw new Error('process.binding is not supported');
4981};
4982
4983process.cwd = function () { return '/' };
4984process.chdir = function (dir) {
4985    throw new Error('process.chdir is not supported');
4986};
4987process.umask = function() { return 0; };
4988
4989},{}],13:[function(require,module,exports){
4990(function (process){
4991/*
4992    Copyright 2019 0KIMS association.
4993
4994    This file is part of wasmsnark (Web Assembly zkSnark Prover).
4995
4996    wasmsnark is a free software: you can redistribute it and/or modify it
4997    under the terms of the GNU General Public License as published by
4998    the Free Software Foundation, either version 3 of the License, or
4999    (at your option) any later version.
5000
5001    wasmsnark is distributed in the hope that it will be useful, but WITHOUT
5002    ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
5003    or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
5004    License for more details.
5005
5006    You should have received a copy of the GNU General Public License
5007    along with wasmsnark. If not, see <https://www.gnu.org/licenses/>.
5008*/
5009
5010const bigInt = require("big-integer");
5011const bn128_wasm = require("../build/bn128_wasm.js");
5012const assert = require("assert");
5013const utils = require("./utils");
5014
5015const SIZEF1 = 32;
5016const inBrowser = (typeof window !== "undefined");
5017let NodeWorker;
5018let NodeCrypto;
5019if (!inBrowser) {
5020    NodeWorker = require("worker_threads").Worker;
5021    NodeCrypto = require("crypto");
5022}
5023
5024
5025class Deferred {
5026    constructor() {
5027        this.promise = new Promise((resolve, reject)=> {
5028            this.reject = reject;
5029            this.resolve = resolve;
5030        });
5031    }
5032}
5033
5034/*
5035function delay(ms) {
5036    return new Promise(resolve => setTimeout(resolve, ms));
5037}
5038*/
5039
5040function thread(self) {
5041    let instance;
5042    let memory;
5043    let i32;
5044
5045    async function init(data) {
5046        const code = new Uint8Array(data.code);
5047        const wasmModule = await WebAssembly.compile(code);
5048        memory = new WebAssembly.Memory({initial:data.init});
5049        i32 = new Uint32Array(memory.buffer);
5050
5051        instance = await WebAssembly.instantiate(wasmModule, {
5052            env: {
5053                "memory": memory
5054            }
5055        });
5056    }
5057
5058    function alloc(length) {
5059        while (i32[0] & 3) i32[0]++;  // Return always aligned pointers
5060        const res = i32[0];
5061        i32[0] += length;
5062        while (i32[0] > memory.buffer.byteLength) {
5063            memory.grow(100);
5064        }
5065        i32 = new Uint32Array(memory.buffer);
5066        return res;
5067    }
5068
5069    function putBin(b) {
5070        const p = alloc(b.byteLength);
5071        const s32 = new Uint32Array(b);
5072        i32.set(s32, p/4);
5073        return p;
5074    }
5075
5076    function getBin(p, l) {
5077        return memory.buffer.slice(p, p+l);
5078    }
5079
5080    self.onmessage = function(e) {
5081        let data;
5082        if (e.data) {
5083            data = e.data;
5084        } else {
5085            data = e;
5086        }
5087
5088        if (data.command == "INIT") {
5089            init(data).then(function() {
5090                self.postMessage(data.result);
5091            });
5092        } else if (data.command == "G1_MULTIEXP") {
5093
5094            const oldAlloc = i32[0];
5095            const pScalars = putBin(data.scalars);
5096            const pPoints = putBin(data.points);
5097            const pRes = alloc(96);
5098            instance.exports.g1m_zero(pRes);
5099            instance.exports.g1m_multiexp2(pScalars, pPoints, data.n, 7, pRes);
5100
5101            data.result = getBin(pRes, 96);
5102            i32[0] = oldAlloc;
5103            self.postMessage(data.result, [data.result]);
5104        } else if (data.command == "G2_MULTIEXP") {
5105
5106            const oldAlloc = i32[0];
5107            const pScalars = putBin(data.scalars);
5108            const pPoints = putBin(data.points);
5109            const pRes = alloc(192);
5110            instance.exports.g2m_zero(pRes);
5111            instance.exports.g2m_multiexp(pScalars, pPoints, data.n, 7, pRes);
5112
5113            data.result = getBin(pRes, 192);
5114            i32[0] = oldAlloc;
5115            self.postMessage(data.result, [data.result]);
5116        } else if (data.command == "CALC_H") {
5117            const oldAlloc = i32[0];
5118            const pSignals = putBin(data.signals);
5119            const pPolsA = putBin(data.polsA);
5120            const pPolsB = putBin(data.polsB);
5121            const nSignals = data.nSignals;
5122            const domainSize = data.domainSize;
5123            const pSignalsM = alloc(nSignals*32);
5124            const pPolA = alloc(domainSize*32);
5125            const pPolB = alloc(domainSize*32);
5126            const pPolA2 = alloc(domainSize*32*2);
5127            const pPolB2 = alloc(domainSize*32*2);
5128
5129            instance.exports.fft_toMontgomeryN(pSignals, pSignalsM, nSignals);
5130
5131            instance.exports.pol_zero(pPolA, domainSize);
5132            instance.exports.pol_zero(pPolB, domainSize);
5133
5134            instance.exports.pol_constructLC(pPolsA, pSignalsM, nSignals, pPolA);
5135            instance.exports.pol_constructLC(pPolsB, pSignalsM, nSignals, pPolB);
5136
5137            instance.exports.fft_copyNInterleaved(pPolA, pPolA2, domainSize);
5138            instance.exports.fft_copyNInterleaved(pPolB, pPolB2, domainSize);
5139
5140            instance.exports.fft_ifft(pPolA, domainSize, 0);
5141            instance.exports.fft_ifft(pPolB, domainSize, 0);
5142            instance.exports.fft_fft(pPolA, domainSize, 1);
5143            instance.exports.fft_fft(pPolB, domainSize, 1);
5144
5145            instance.exports.fft_copyNInterleaved(pPolA, pPolA2+32, domainSize);
5146            instance.exports.fft_copyNInterleaved(pPolB, pPolB2+32, domainSize);
5147
5148            instance.exports.fft_mulN(pPolA2, pPolB2, domainSize*2, pPolA2);
5149
5150            instance.exports.fft_ifft(pPolA2, domainSize*2, 0);
5151
5152            instance.exports.fft_fromMontgomeryN(pPolA2+domainSize*32, pPolA2+domainSize*32, domainSize);
5153
5154            data.result = getBin(pPolA2+domainSize*32, domainSize*32);
5155            i32[0] = oldAlloc;
5156            self.postMessage(data.result, [data.result]);
5157        } else if (data.command == "TERMINATE") {
5158            process.exit();
5159        }
5160    };
5161}
5162
5163async function build() {
5164
5165    const bn128 = new Bn128();
5166
5167    bn128.q = bigInt("21888242871839275222246405745257275088696311157297823662689037894645226208583");
5168    bn128.r = bigInt("21888242871839275222246405745257275088548364400416034343698204186575808495617");
5169    bn128.n64 = Math.floor((bn128.q.minus(1).bitLength() - 1)/64) +1;
5170    bn128.n32 = bn128.n64*2;
5171    bn128.n8 = bn128.n64*8;
5172
5173    bn128.memory = new WebAssembly.Memory({initial:5000});
5174    bn128.i32 = new Uint32Array(bn128.memory.buffer);
5175
5176    const wasmModule = await WebAssembly.compile(bn128_wasm.code);
5177
5178    bn128.instance = await WebAssembly.instantiate(wasmModule, {
5179        env: {
5180            "memory": bn128.memory
5181        }
5182    });
5183
5184    bn128.pq = bn128_wasm.pq;
5185    bn128.pr = bn128_wasm.pr;
5186    bn128.pG1gen = bn128_wasm.pG1gen;
5187    bn128.pG1zero = bn128_wasm.pG1zero;
5188    bn128.pG2gen = bn128_wasm.pG2gen;
5189    bn128.pG2zero = bn128_wasm.pG2zero;
5190    bn128.pOneT = bn128_wasm.pOneT;
5191
5192    bn128.pr0 = bn128.alloc(192);
5193    bn128.pr1 = bn128.alloc(192);
5194
5195    bn128.workers = [];
5196    bn128.pendingDeferreds = [];
5197    bn128.working = [];
5198
5199    let concurrency;
5200
5201    if ((typeof(navigator) === "object") && navigator.hardwareConcurrency) {
5202        concurrency = navigator.hardwareConcurrency;
5203    } else {
5204        concurrency = 8;
5205    }
5206
5207    function getOnMsg(i) {
5208        return function(e) {
5209            let data;
5210            if ((e)&&(e.data)) {
5211                data = e.data;
5212            } else {
5213                data = e;
5214            }
5215
5216            bn128.working[i]=false;
5217            bn128.pendingDeferreds[i].resolve(data);
5218            bn128.processWorks();
5219        };
5220    }
5221
5222    for (let i = 0; i<concurrency; i++) {
5223
5224        if (inBrowser) {
5225            const blob = new Blob(["(", thread.toString(), ")(self);"], { type: "text/javascript" });
5226            const url = URL.createObjectURL(blob);
5227
5228            bn128.workers[i] = new Worker(url);
5229
5230            bn128.workers[i].onmessage = getOnMsg(i);
5231
5232        } else {
5233            bn128.workers[i] = new NodeWorker("(" + thread.toString()+ ")(require('worker_threads').parentPort);", {eval: true});
5234
5235            bn128.workers[i].on("message", getOnMsg(i));
5236        }
5237
5238        bn128.working[i]=false;
5239    }
5240
5241    const initPromises = [];
5242    for (let i=0; i<bn128.workers.length;i++) {
5243        const copyCode = bn128_wasm.code.buffer.slice(0);
5244        initPromises.push(bn128.postAction(i, {
5245            command: "INIT",
5246            init: 5000,
5247            code: copyCode
5248
5249        }, [copyCode]));
5250    }
5251
5252    await Promise.all(initPromises);
5253
5254    return bn128;
5255}
5256
5257class Bn128 {
5258    constructor() {
5259        this.actionQueue = [];
5260    }
5261
5262    postAction(workerId, e, transfers, _deferred) {
5263        assert(this.working[workerId] == false);
5264        this.working[workerId] = true;
5265
5266        this.pendingDeferreds[workerId] = _deferred ? _deferred : new Deferred();
5267        this.workers[workerId].postMessage(e, transfers);
5268
5269        return this.pendingDeferreds[workerId].promise;
5270    }
5271
5272    processWorks() {
5273        for (let i=0; (i<this.workers.length)&&(this.actionQueue.length > 0); i++) {
5274            if (this.working[i] == false) {
5275                const work = this.actionQueue.shift();
5276                this.postAction(i, work.data, work.transfers, work.deferred);
5277            }
5278        }
5279    }
5280
5281    queueAction(actionData, transfers) {
5282        const d = new Deferred();
5283        this.actionQueue.push({
5284            data: actionData,
5285            transfers: transfers,
5286            deferred: d
5287        });
5288        this.processWorks();
5289        return d.promise;
5290    }
5291
5292    alloc(length) {
5293        while (this.i32[0] & 3) this.i32[0]++;  // Return always aligned pointers
5294        const res = this.i32[0];
5295        this.i32[0] += length;
5296        return res;
5297    }
5298
5299
5300    putBin(p, b) {
5301        const s32 = new Uint32Array(b);
5302        this.i32.set(s32, p/4);
5303    }
5304
5305    getBin(p, l) {
5306        return this.memory.buffer.slice(p, p+l);
5307    }
5308
5309    bin2int(b) {
5310        const i32 = new Uint32Array(b);
5311        let acc = bigInt(i32[7]);
5312        for (let i=6; i>=0; i--) {
5313            acc = acc.shiftLeft(32);
5314            acc = acc.add(i32[i]);
5315        }
5316        return acc.toString();
5317    }
5318
5319    bin2g1(b) {
5320        return [
5321            this.bin2int(b.slice(0,32)),
5322            this.bin2int(b.slice(32,64)),
5323            this.bin2int(b.slice(64,96)),
5324        ];
5325    }
5326    bin2g2(b) {
5327        return [
5328            [
5329                this.bin2int(b.slice(0,32)),
5330                this.bin2int(b.slice(32,64))
5331            ],
5332            [
5333                this.bin2int(b.slice(64,96)),
5334                this.bin2int(b.slice(96,128))
5335            ],
5336            [
5337                this.bin2int(b.slice(128,160)),
5338                this.bin2int(b.slice(160,192))
5339            ],
5340        ];
5341    }
5342
5343    async g1_multiexp(scalars, points) {
5344        const nPoints = scalars.byteLength /32;
5345        const nPointsPerThread = Math.floor(nPoints / this.workers.length);
5346        const opPromises = [];
5347        for (let i=0; i<this.workers.length; i++) {
5348            const th_nPoints =
5349                i < this.workers.length -1 ?
5350                    nPointsPerThread :
5351                    nPoints - (nPointsPerThread * (this.workers.length -1));
5352            const scalars_th = scalars.slice(i*nPointsPerThread*32, i*nPointsPerThread*32 + th_nPoints*32);
5353            const points_th = points.slice(i*nPointsPerThread*64, i*nPointsPerThread*64 + th_nPoints*64);
5354            opPromises.push(
5355                this.queueAction({
5356                    command: "G1_MULTIEXP",
5357                    scalars: scalars_th,
5358                    points: points_th,
5359                    n: th_nPoints
5360                }, [scalars_th, points_th])
5361            );
5362        }
5363
5364        const results = await Promise.all(opPromises);
5365
5366        this.instance.exports.g1m_zero(this.pr0);
5367        for (let i=0; i<results.length; i++) {
5368            this.putBin(this.pr1, results[i]);
5369            this.instance.exports.g1m_add(this.pr0, this.pr1, this.pr0);
5370        }
5371
5372        return this.getBin(this.pr0, 96);
5373    }
5374
5375    async g2_multiexp(scalars, points) {
5376        const nPoints = scalars.byteLength /32;
5377        const nPointsPerThread = Math.floor(nPoints / this.workers.length);
5378        const opPromises = [];
5379        for (let i=0; i<this.workers.length; i++) {
5380            const th_nPoints =
5381                i < this.workers.length -1 ?
5382                    nPointsPerThread :
5383                    nPoints - (nPointsPerThread * (this.workers.length -1));
5384            const scalars_th = scalars.slice(i*nPointsPerThread*32, i*nPointsPerThread*32 + th_nPoints*32);
5385            const points_th = points.slice(i*nPointsPerThread*128, i*nPointsPerThread*128 + th_nPoints*128);
5386            opPromises.push(
5387                this.queueAction({
5388                    command: "G2_MULTIEXP",
5389                    scalars: scalars_th,
5390                    points: points_th,
5391                    n: th_nPoints
5392                }, [scalars_th, points_th])
5393            );
5394        }
5395
5396        const results = await Promise.all(opPromises);
5397
5398        this.instance.exports.g2m_zero(this.pr0);
5399        for (let i=0; i<results.length; i++) {
5400            this.putBin(this.pr1, results[i]);
5401            this.instance.exports.g2m_add(this.pr0, this.pr1, this.pr0);
5402        }
5403
5404        return this.getBin(this.pr0, 192);
5405    }
5406
5407    g1_affine(p) {
5408        this.putBin(this.pr0, p);
5409        this.instance.exports.g1m_affine(this.pr0, this.pr0);
5410        return this.getBin(this.pr0, 96);
5411    }
5412
5413    g2_affine(p) {
5414        this.putBin(this.pr0, p);
5415        this.instance.exports.g2m_affine(this.pr0, this.pr0);
5416        return this.getBin(this.pr0, 192);
5417    }
5418
5419    g1_fromMontgomery(p) {
5420        this.putBin(this.pr0, p);
5421        this.instance.exports.g1m_fromMontgomery(this.pr0, this.pr0);
5422        return this.getBin(this.pr0, 96);
5423    }
5424
5425    g2_fromMontgomery(p) {
5426        this.putBin(this.pr0, p);
5427        this.instance.exports.g2m_fromMontgomery(this.pr0, this.pr0);
5428        return this.getBin(this.pr0, 192);
5429    }
5430
5431    loadPoint1(b) {
5432        const p = this.alloc(96);
5433        this.putBin(p, b);
5434        this.instance.exports.f1m_one(p+64);
5435        return p;
5436    }
5437
5438    loadPoint2(b) {
5439        const p = this.alloc(192);
5440        this.putBin(p, b);
5441        this.instance.exports.f2m_one(p+128);
5442        return p;
5443    }
5444
5445
5446    setInt(pos, _a, _size) {
5447        const n32 = _size ? (((_size - 1)>>2)+1) : SIZEF1 >> 2;
5448        const a = bigInt(_a);
5449        if (pos & 0x7) throw new Error("Pointer must be aligned");
5450        for (let i=0; i<n32; i++) {
5451            this.i32[(pos>>2)+i] = a.shiftRight(i*32).and(0xFFFFFFFF).toJSNumber();
5452        }
5453    }
5454
5455    setF1(p, e) {
5456        const n32 = (SIZEF1 >> 2);
5457        let arr;
5458        if (Array.isArray(e)) {
5459            if (e.length == n32 ) {
5460                arr = e;
5461            } else if (e.length == 3) {
5462                arr = e[2].slice(0);
5463                // Remove
5464                while (arr[arr.length-1] <0) arr.pop();
5465                // Fill it with zeros
5466                const filledElements = arr.length;
5467                arr.length = n32;
5468                arr.fill(0, filledElements, n32);
5469            } else {
5470                throw new Error("Invalid format");
5471            }
5472            this.i32.set(Uint32Array.from(arr), p >> 2);
5473        } else {
5474            this.setInt(p, e);
5475        }
5476    }
5477
5478
5479    setF2(p, e) {
5480        this.setF1(p, e[0]);
5481        this.setF1(p + SIZEF1, e[1]);
5482    }
5483
5484    setF6(p, e) {
5485        this.setF2(p, e[0]);
5486        this.setF2(p+2*SIZEF1, e[1]);
5487        this.setF2(p+4*SIZEF1, e[2]);
5488    }
5489
5490    setF12(p, e) {
5491        this.setF6(p, e[0]);
5492        this.setF6(p + 6*SIZEF1, e[1]);
5493    }
5494
5495    setG1Affine(p, e) {
5496        this.setF1(p, e[0]);
5497        this.setF1(p + SIZEF1, e[1]);
5498        this.setF1(p + 2*SIZEF1, 1);
5499    }
5500
5501    setG2Affine(p, e) {
5502        this.setF2(p, e[0]);
5503        this.setF2(p + SIZEF1*2, e[1]);
5504        this.setF2(p + SIZEF1*4, [1, 0]);
5505    }
5506
5507    getF1(p) {
5508        this.instance.exports.f1m_fromMontgomery(p, p);
5509        const r = this.bin2int(this.i32.slice(p>>2, (p+SIZEF1)>>2)).toString();
5510        this.instance.exports.f1m_toMontgomery(p, p);
5511    }
5512
5513    getF2(p) {
5514        return [
5515            this.getF1(p),
5516            this.getF1(p+SIZEF1)
5517        ];
5518    }
5519
5520    getF6(p) {
5521        return [
5522            this.getF2(p),
5523            this.getF2(p+2*SIZEF1),
5524            this.getF2(p+4*SIZEF1)
5525        ];
5526    }
5527
5528    getF12(p) {
5529        return [
5530            this.getF6(p),
5531            this.getF6(p+6*SIZEF1),
5532        ];
5533    }
5534
5535    getG1(p) {
5536        return [
5537            this.getF1(p),
5538            this.getF1(p+SIZEF1),
5539            this.getF1(p+2*SIZEF1)
5540        ];
5541    }
5542
5543    getG2(p) {
5544        return [
5545            this.getF2(p),
5546            this.getF2(p+2*SIZEF1),
5547            this.getF2(p+4*SIZEF1)
5548        ];
5549    }
5550
5551
5552    terminate() {
5553        for (let i=0; i<this.workers.length; i++) {
5554            this.workers[i].postMessage({command: "TERMINATE"});
5555        }
5556    }
5557
5558
5559    async calcH(signals, polsA, polsB, nSignals, domainSize) {
5560        return this.queueAction({
5561            command: "CALC_H",
5562            signals: signals,
5563            polsA: polsA,
5564            polsB: polsB,
5565            nSignals: nSignals,
5566            domainSize: domainSize
5567        }, [signals, polsA, polsB]);
5568    }
5569
5570    async groth16GenProof(signals, pkey) {
5571        const pkey32 = new Uint32Array(pkey);
5572        const nSignals = pkey32[0];
5573        const nPublic = pkey32[1];
5574        const domainSize = pkey32[2];
5575        const pPolsA = pkey32[3];
5576        const pPolsB = pkey32[4];
5577        const pPointsA = pkey32[5];
5578        const pPointsB1 = pkey32[6];
5579        const pPointsB2 = pkey32[7];
5580        const pPointsC = pkey32[8];
5581        const pHExps = pkey32[9];
5582        const polsA = pkey.slice(pPolsA, pPolsA + pPolsB);
5583        const polsB = pkey.slice(pPolsB, pPolsB + pPointsA);
5584        const pointsA = pkey.slice(pPointsA, pPointsA + nSignals*64);
5585        const pointsB1 = pkey.slice(pPointsB1, pPointsB1 + nSignals*64);
5586        const pointsB2 = pkey.slice(pPointsB2, pPointsB2 + nSignals*128);
5587        const pointsC = pkey.slice(pPointsC, pPointsC + (nSignals-nPublic-1)*64);
5588        const pointsHExps = pkey.slice(pHExps, pHExps + domainSize*64);
5589
5590        const alfa1 = pkey.slice(10*4, 10*4 + 64);
5591        const beta1 = pkey.slice(10*4 + 64, 10*4 + 128);
5592        const delta1 = pkey.slice(10*4 + 128, 10*4 + 192);
5593        const beta2 = pkey.slice(10*4 + 192, 10*4 + 320);
5594        const delta2 = pkey.slice(10*4 + 320, 10*4 + 448);
5595
5596
5597        const pH = this.calcH(signals.slice(0), polsA, polsB, nSignals, domainSize).then( (h) => {
5598/* Debug code to print the result of h
5599            for (let i=0; i<domainSize; i++) {
5600                const a = this.bin2int(h.slice(i*32, i*32+32));
5601                console.log(i + " -> " + a.toString());
5602            }
5603*/
5604            return this.g1_multiexp(h, pointsHExps);
5605        });
5606
5607        const pA = this.g1_multiexp(signals.slice(0), pointsA);
5608        const pB1 = this.g1_multiexp(signals.slice(0), pointsB1);
5609        const pB2 = this.g2_multiexp(signals.slice(0), pointsB2);
5610        const pC = this.g1_multiexp(signals.slice((nPublic+1)*32), pointsC);
5611
5612        const res = await Promise.all([pA, pB1, pB2, pC, pH]);
5613
5614        const pi_a = this.alloc(96);
5615        const pi_b = this.alloc(192);
5616        const pi_c = this.alloc(96);
5617        const pib1 = this.alloc(96);
5618
5619
5620        this.putBin(pi_a, res[0]);
5621        this.putBin(pib1, res[1]);
5622        this.putBin(pi_b, res[2]);
5623        this.putBin(pi_c, res[3]);
5624
5625        const pAlfa1 = this.loadPoint1(alfa1);
5626        const pBeta1 = this.loadPoint1(beta1);
5627        const pDelta1 = this.loadPoint1(delta1);
5628        const pBeta2 = this.loadPoint2(beta2);
5629        const pDelta2 = this.loadPoint2(delta2);
5630
5631
5632        let rnd = new Uint32Array(8);
5633
5634        const aux1 = this.alloc(96);
5635        const aux2 = this.alloc(192);
5636
5637        const pr = this.alloc(32);
5638        const ps = this.alloc(32);
5639
5640        if (inBrowser) {
5641            window.crypto.getRandomValues(rnd);
5642            this.putBin(pr, rnd);
5643
5644            window.crypto.getRandomValues(rnd);
5645            this.putBin(ps, rnd);
5646        } else {
5647            const br = NodeCrypto.randomBytes(32);
5648            this.putBin(pr, br);
5649            const bs = NodeCrypto.randomBytes(32);
5650            this.putBin(ps, bs);
5651        }
5652
5653/// Uncoment it to debug and check it works
5654//        this.instance.exports.f1m_zero(pr);
5655//        this.instance.exports.f1m_zero(ps);
5656
5657        // pi_a = pi_a + Alfa1 + r*Delta1
5658        this.instance.exports.g1m_add(pAlfa1, pi_a, pi_a);
5659        this.instance.exports.g1m_timesScalar(pDelta1, pr, 32, aux1);
5660        this.instance.exports.g1m_add(aux1, pi_a, pi_a);
5661
5662        // pi_b = pi_b + Beta2 + s*Delta2
5663        this.instance.exports.g2m_add(pBeta2, pi_b, pi_b);
5664        this.instance.exports.g2m_timesScalar(pDelta2, ps, 32, aux2);
5665        this.instance.exports.g2m_add(aux2, pi_b, pi_b);
5666
5667        // pib1 = pib1 + Beta1 + s*Delta1
5668        this.instance.exports.g1m_add(pBeta1, pib1, pib1);
5669        this.instance.exports.g1m_timesScalar(pDelta1, ps, 32, aux1);
5670        this.instance.exports.g1m_add(aux1, pib1, pib1);
5671
5672
5673        // pi_c = pi_c + pH
5674        this.putBin(aux1, res[4]);
5675        this.instance.exports.g1m_add(aux1, pi_c, pi_c);
5676
5677
5678        // pi_c = pi_c + s*pi_a
5679        this.instance.exports.g1m_timesScalar(pi_a, ps, 32, aux1);
5680        this.instance.exports.g1m_add(aux1, pi_c, pi_c);
5681
5682        // pi_c = pi_c + r*pib1
5683        this.instance.exports.g1m_timesScalar(pib1, pr, 32, aux1);
5684        this.instance.exports.g1m_add(aux1, pi_c, pi_c);
5685
5686        // pi_c = pi_c - r*s*delta1
5687        const prs = this.alloc(64);
5688        this.instance.exports.int_mul(pr, ps, prs);
5689        this.instance.exports.g1m_timesScalar(pDelta1, prs, 64, aux1);
5690        this.instance.exports.g1m_neg(aux1, aux1);
5691        this.instance.exports.g1m_add(aux1, pi_c, pi_c);
5692
5693        this.instance.exports.g1m_affine(pi_a, pi_a);
5694        this.instance.exports.g2m_affine(pi_b, pi_b);
5695        this.instance.exports.g1m_affine(pi_c, pi_c);
5696
5697        this.instance.exports.g1m_fromMontgomery(pi_a, pi_a);
5698        this.instance.exports.g2m_fromMontgomery(pi_b, pi_b);
5699        this.instance.exports.g1m_fromMontgomery(pi_c, pi_c);
5700
5701        return {
5702            pi_a: this.bin2g1(this.getBin(pi_a, 96)),
5703            pi_b: this.bin2g2(this.getBin(pi_b, 192)),
5704            pi_c: this.bin2g1(this.getBin(pi_c, 96)),
5705        };
5706
5707    }
5708
5709    async groth16Verify(verificationKey, input, proof) {
5710
5711        if (input) {
5712            if  ((!Array.isArray(input))||(utils.isOcamNum(input))) input = [input];
5713        } else {
5714            input = [];
5715        }
5716
5717        const oldAlloc = this.i32[0];
5718
5719        const pA = this.alloc(SIZEF1*3);
5720        const pB = this.alloc(SIZEF1*6);
5721        const pAlfaBeta = this.alloc(SIZEF1*12);
5722        const pIC = this.alloc(SIZEF1*3);
5723        const pICaux = this.alloc(SIZEF1*3);
5724        const pICr = this.alloc(SIZEF1);
5725        const pC = this.alloc(SIZEF1*3);
5726        const pDelta2 = this.alloc(SIZEF1*6);
5727        const pGamma2 = this.alloc(SIZEF1*6);
5728        const pAlfa1 = this.alloc(SIZEF1*3);
5729        const pBeta2 = this.alloc(SIZEF1*6);
5730
5731        // 1.- start the all precompute G2
5732        this.setG1Affine(pA, proof.pi_a);
5733        this.instance.exports.g1m_toMontgomery(pA, pA);
5734
5735        this.setG2Affine(pB, proof.pi_b);
5736        this.instance.exports.g2m_toMontgomery(pB, pB);
5737
5738        this.setG1Affine(pC, proof.pi_c);
5739        this.instance.exports.g1m_toMontgomery(pC, pC);
5740
5741        this.setG2Affine(pDelta2, verificationKey.vk_delta_2);
5742        this.instance.exports.g2m_toMontgomery(pDelta2, pDelta2);
5743
5744        this.setG2Affine(pGamma2, verificationKey.vk_gamma_2);
5745        this.instance.exports.g2m_toMontgomery(pGamma2, pGamma2);
5746
5747        this.setF12(pAlfaBeta, verificationKey.vk_alfabeta_12);
5748        this.instance.exports.ftm_toMontgomery(pAlfaBeta, pAlfaBeta);
5749
5750        this.setG1Affine(pAlfa1, verificationKey.vk_alfa_1);
5751        this.instance.exports.g1m_toMontgomery(pAlfa1, pAlfa1);
5752
5753        this.setG2Affine(pBeta2, verificationKey.vk_beta_2);
5754        this.instance.exports.g2m_toMontgomery(pBeta2, pBeta2);
5755
5756        this.setG1Affine(pIC, verificationKey.IC[0]);
5757        this.instance.exports.g1m_toMontgomery(pIC, pIC);
5758        for (let i=0; i<input.length; i++) {
5759            this.setG1Affine(pICaux, verificationKey.IC[i+1]);
5760            this.instance.exports.g1m_toMontgomery(pICaux, pICaux);
5761
5762            this.setF1(pICr, input[i]);
5763            if (this.instance.exports.int_gte(pICr, this.pr)) return false;
5764            this.instance.exports.g1m_timesScalar(pICaux, pICr, SIZEF1, pICaux);
5765
5766            this.instance.exports.g1m_add(pICaux, pIC, pIC);
5767        }
5768        this.instance.exports.g1m_affine(pIC, pIC);
5769
5770        this.instance.exports.g1m_neg(pIC, pIC);
5771        this.instance.exports.g1m_neg(pC, pC);
5772        this.instance.exports.g1m_neg(pAlfa1, pAlfa1);
5773        const valid = this.instance.exports.bn128_pairingEq4(pA, pB, pIC, pGamma2, pC, pDelta2, pAlfa1, pBeta2, this.pOneT);
5774//        const valid = this.instance.exports.bn128_pairingEq3(pA, pB, pIC, pGamma2, pC, pDelta2, pAlfaBeta);
5775
5776        this.i32[0] = oldAlloc;
5777        return (valid==1);
5778    }
5779
5780
5781}
5782
5783module.exports = build;
5784
5785}).call(this,require('_process'))
5786},{"../build/bn128_wasm.js":1,"./utils":14,"_process":12,"assert":3,"big-integer":8,"crypto":undefined,"worker_threads":undefined}],14:[function(require,module,exports){
5787/*
5788    Copyright 2019 0KIMS association.
5789
5790    This file is part of wasmsnark (Web Assembly zkSnark Prover).
5791
5792    wasmsnark is a free software: you can redistribute it and/or modify it
5793    under the terms of the GNU General Public License as published by
5794    the Free Software Foundation, either version 3 of the License, or
5795    (at your option) any later version.
5796
5797    wasmsnark is distributed in the hope that it will be useful, but WITHOUT
5798    ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
5799    or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
5800    License for more details.
5801
5802    You should have received a copy of the GNU General Public License
5803    along with wasmsnark. If not, see <https://www.gnu.org/licenses/>.
5804*/
5805
5806const bigInt = require("big-integer");
5807
5808exports.bigInt2BytesLE = function bigInt2BytesLE(_a, len) {
5809    const b = Array(len);
5810    let v = bigInt(_a);
5811    for (let i=0; i<len; i++) {
5812        b[i] = v.and(0xFF).toJSNumber();
5813        v = v.shiftRight(8);
5814    }
5815    return b;
5816};
5817
5818exports.bigInt2U32LE = function bigInt2BytesLE(_a, len) {
5819    const b = Array(len);
5820    let v = bigInt(_a);
5821    for (let i=0; i<len; i++) {
5822        b[i] = v.and(0xFFFFFFFF).toJSNumber();
5823        v = v.shiftRight(32);
5824    }
5825    return b;
5826};
5827
5828exports.isOcamNum = function(a) {
5829    if (!Array.isArray(a)) return false;
5830    if (a.length != 3) return false;
5831    if (typeof a[0] !== "number") return false;
5832    if (typeof a[1] !== "number") return false;
5833    if (!Array.isArray(a[2])) return false;
5834    return true;
5835}
5836
5837
5838
5839},{"big-integer":8}]},{},[2]);