const rl =require("readline").createInterface({input: process.stdin });var iter = rl[Symbol.asyncIterator]();constreadline=async()=>(await iter.next()).value;void(asyncfunction(){// Write your code here// x^3 = a ,即 fx = x^3 -a// 牛顿迭代公式 下一次近似解 xn+1 = xn- f(x)/f'(x)while((line =awaitreadline())){let tokens = line.split(" ");const a =parseFloat(tokens[0]);let x = a /3;// 设定一个初始x值const tolerance =1e-6;// 设置一个精度while(Math.abs(a - x * x * x)> tolerance){const fx = x * x * x - a;
x = x - fx /(3* x * x);}
console.log(parseFloat(x.toFixed(1)))}})();