functionn(n){returnn>=0?n:-n}functiont(n){if("number"==typeofn&&(n=BigInt(n)),1n===n)return1;lett=1;do{t++}while((n>>=1n)>1n);returnt}functionr(n,t){if("number"==typeofn&&(n=BigInt(n)),"number"==typeoft&&(t=BigInt(t)),n<=0n||t<=0n)thrownewRangeError("a and b MUST be > 0");letr=0n,e=1n,o=1n,i=0n;for(;0n!==n;){constu=t/n,f=t%n,g=r-o*u,c=e-i*u;t=n,n=f,r=o,e=i,o=g,i=c}return{g:t,x:r,y:e}}functione(n,t){if("number"==typeofn&&(n=BigInt(n)),"number"==typeoft&&(t=BigInt(t)),t<=0n)thrownewRangeError("n must be > 0");constr=n%t;returnr<0n?r+t:r}functiono(n,t){consto=r(e(n,t),t);if(1n!==o.g)thrownewRangeError(`${n.toString()} does not have inverse modulo ${t.toString()}`);returne(o.x,t)}functioni(n,t,r){if(n.length!==t.length)thrownewRangeError("The remainders and modulos arrays should have the same length");consti=r??t.reduce(((n,t)=>n*t),1n);returnt.reduce(((t,r,u)=>{constf=i/r;returne(t+f*o(f,r)%i*n[u]%i,i)}),0n)}functionu(t,r){lete="number"==typeoft?BigInt(n(t)):n(t),o="number"==typeofr?BigInt(n(r)):n(r);if(0n===e)returno;if(0n===o)returne;leti=0n;for(;0n===(1n&(e|o));)e>>=1n,o>>=1n,i++;for(;0n===(1n&e);)e>>=1n;do{for(;0n===(1n&o);)o>>=1n;if(e>o){constn=e;e=o,o=n}o-=e}while(0n!==o);returne<<i}functionf(t,r){return"number"==typeoft&&(t=BigInt(t)),"number"==typeofr&&(r=BigInt(r)),0n===t&&0n===r?BigInt(0):n(t/u(t,r)*r)}functiong(n,t){returnn>=t?n:t}functionc(n,t){returnn>=t?t:n}functionm(n,t){constr=BigInt(t);returne(n.map((n=>BigInt(n)%r)).reduce(((n,t)=>n+t%r),0n),r)}functionp(n,t){constr=BigInt(t);returne(n.map((n=>BigInt(n)%r)).reduce(((n,t)=>n*t%r),1n),r)}functiona(n){returnn.map((n=>n[0]**(n[1]-1n)*(n[0]-1n))).reduce(((n,t)=>t*n),1n)}functions(t,r,u,f){if("number"==typeoft&&(t=BigInt(t)),"number"==typeofr&&(r=BigInt(r)),"number"==typeofu&&(u=BigInt(u)),u<=0n)thrownewRangeError("n must be > 0");if(1n===u)return0n;if(t=e(t,u),r<0n)returno(s(t,n(r),u,f),u);if(void0!==f)returnfunction(n,t,r,e){consto=e.map((n=>n[0]**n[1])),u=e.map((n=>a([n]))),f=u.map(((r,e)=>s(n,t%r,o[e])));returni(f,o,r)}(t,r,u,function(n){constt={};returnn.forEach((n=>{if("bigint"==typeofn||"number"==typeofn){constr=String(n);void0===t[r]?t[r]={p:BigInt(n),k:1n}:t[r].k+=1n}else{constr=String(n[0]);void0===t[r]?t[r]={p:BigInt(n[0]),k:BigInt(n[1])}:t[r].k+=BigInt(n[1])}})),Object.values(t).map((n=>[n.p,n.k]))}(f));letg=1n;for(;r>0;)r%2n===1n&&(g=g*t%u),r/=2n,t=t**2n%u;returng}export{nasabs,tasbitLength,iascrt,raseGcd,uasgcd,faslcm,gasmax,casmin,masmodAdd,oasmodInv,pasmodMultiply,sasmodPow,aasphi,eastoZn};