#include using namespace std; #define all(v) (v).begin(),(v).end() #define pb emplace_back #define rep(i, n) for(int i=0;i<(n);i++) #define foa(e, v) for(auto& e : v) #define dout(a) cout< using pqr = priority_queue, greater>; template inline bool chmax(T1 &a, T2 b) { bool compare = a < b; if(compare) a = b; return compare; } template inline bool chmin(T1 &a, T2 b) { bool compare = a > b; if(compare) a = b; return compare; } template inline T back(std::set &s) { return *s.rbegin(); } template inline T back(std::multiset &s) { return *s.rbegin(); } template inline T pop_back(std::set &s) { auto it = prev(s.end()); T val = *it; s.erase(it); return val; } template inline T pop_back(std::multiset &s) { auto it = prev(s.end()); T val = *it; s.erase(it); return val; } const int dy[8] = {-1, 0, 0, 1, 1, -1, 1, -1}; const int dx[8] = {0, -1, 1, 0, -1, -1, 1, 1}; const ll MOD7 = 1000000007, MOD998 = 998244353, INF = (3LL << 59); const int inf = 1 << 30; const char br = '\n'; void solve() { ll c; cin >> c; Int C = 1000000000000000LL; C *= c; ll m = 1000000000000LL; for(ll i = 0; i < 10000; i ++) { Int a = i; Int b = a * a * a * a * a + a * m; if(b > C) { string s = ""; i --; while(i) { s += char('0' + (i % 10)); i /= 10; } while((int)s.size() <= 3) s += "0"; reverse(all(s)); if((int)s.size() == 4) { cout << s[0] << "." << s.substr(1, 3) << endl; } else { cout << s.substr(0, 2) << "." << s.substr(2, 3) << endl; } return; } } } int main() { cin.tie(0); ios::sync_with_stdio(false); int testcase = 1; // cin >> testcase; while(testcase --) solve(); return 0; }