// Binary Search » Step 2 » E.Equation
// solution by "for"
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
ios::sync_with_stdio(false); cin.tie(nullptr);
double n; cin>>n;
double l=0,r=n,mid;
for(int i=0;i<80;i++){
mid=(l+r)/2.0;
if(mid*mid+sqrt(mid)>n) r=mid;
else l=mid;
}
cout<<fixed<<setprecision(12)<<l;
}
Ly8gQmluYXJ5IFNlYXJjaCDCuyBTdGVwIDIgwrsgRS5FcXVhdGlvbgovLyBzb2x1dGlvbiBieSAiZm9yIgojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPgojZGVmaW5lIGludCBsb25nIGxvbmcKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKc2lnbmVkIG1haW4oKXsKCWlvczo6c3luY193aXRoX3N0ZGlvKGZhbHNlKTsgY2luLnRpZShudWxscHRyKTsKCWRvdWJsZSBuOyBjaW4+Pm47Cglkb3VibGUgbD0wLHI9bixtaWQ7Cglmb3IoaW50IGk9MDtpPDgwO2krKyl7CgkJbWlkPShsK3IpLzIuMDsKCQlpZihtaWQqbWlkK3NxcnQobWlkKT5uKSByPW1pZDsKCQllbHNlIGw9bWlkOwoJfQoJY291dDw8Zml4ZWQ8PHNldHByZWNpc2lvbigxMik8PGw7Cn0K