function nthRoot(value, k = 2) {
  let o = 0;
  let x = value;
  let limit = 100000;

  while (x ** k !== k && x !== o && --limit) {
    o = x;
    x = ((k - 1) * x + value / x ** (k - 1)) / k;
  }
  console.log(100000 - limit);
  return x;
}


function nthRootBig(value, k = 2n) {
  let o = 0n;
  let x = value;
  let limit = 1000000;

  while (x ** k !== k && x !== o && --limit) {
    o = x;
    x = ((k - 1n) * x + value / x ** (k - 1n)) / k;
  }
  console.log(10000000 - limit);
  return x;
}