#include<cstdio>

 #include<iostream>

 #include<cmath>

 #include<algorithm>

 #include<cstring>

 #include<cstdlib>

 #include<cctype>

 #include<vector>

 #include<stack>

 #include<queue>

 using namespace std;

 #define enter puts("")

 #define space putchar(' ')

 #define Mem(a, x) memset(a, x, sizeof(a))

 #define rg register

 typedef long long ll;

 typedef double db;

 const int INF = 0x3f3f3f3f;

 const db eps = 1e-;

 const db Pi = acos(-1.0);

 //const int maxn = ;

 inline ll read()

 {

   ll ans = ;

   char ch = getchar(), last = ' ';

   while(!isdigit(ch)) {last = ch; ch = getchar();}

   while(isdigit(ch)) {ans = ans *  + ch - ''; ch = getchar();}

   if(last == '-') ans = -ans;

   return ans;

 }

 inline void write(ll x)

 {

   if(x < ) x = -x, putchar('-');

   if(x >= ) write(x / );

   putchar(x %  + '');

 }

 db S, r;

 db calc(db r)

 {

   db l = (S - Pi * r * r) / (Pi * r);

   db h = sqrt(l * l - r * r);

   return Pi * r * r * h / 3.00;

 }

 int main()

 {

   while(scanf("%lf", &S) != EOF)

   {

       db L = , R = sqrt(S / Pi);

       for(int i = ; i <= ; ++i)

         {

           db m1 = L + (R - L) / 3.00;

           db m2 = R - (R - L) / 3.00;

           if(calc(m1) <= calc(m2)) L = m1, r = m2;

           else R = m2, r = m1;

         }

       db l = (S - Pi * r * r) / (Pi * r);

       db h = sqrt(l * l - r * r);

       db V = Pi * r * r * h / 3.00;

       printf("%.2f\n%.2f\n%.2f\n", V, h, r);

     }

   return ;

 }