#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#define MAX_SIZE 32000
using namespace std;
class Queue{
private:
double item[MAX_SIZE];
int rear;
int front;
public:
Queue();
void enqueue(double);
void display();
};
Queue::Queue(){
rear = -1;
front = 0;
}
void Queue::enqueue(double data){
item[++rear] = data;
}
void Queue::display(){
for(int i = rear; i >= front; i--)
printf("%.4lf\n", item[i]);
}
int main(){
Queue queue;
long long int n;
double root;
while(scanf("%lld", &n) != EOF){
root = sqrt(n);
queue.enqueue(root);
}
queue.display();
return 0;
}
I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPGNzdGRsaWI+CiNpbmNsdWRlPGNzdGRpbz4KI2luY2x1ZGU8Y21hdGg+CgojZGVmaW5lIE1BWF9TSVpFIDMyMDAwCgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKY2xhc3MgUXVldWV7CiAgICBwcml2YXRlOgogICAgICAgIGRvdWJsZSBpdGVtW01BWF9TSVpFXTsKICAgICAgICBpbnQgcmVhcjsKICAgICAgICBpbnQgZnJvbnQ7CgogICAgcHVibGljOgogICAgICAgIFF1ZXVlKCk7CiAgICAgICAgdm9pZCBlbnF1ZXVlKGRvdWJsZSk7CiAgICAgICAgdm9pZCBkaXNwbGF5KCk7Cn07CgpRdWV1ZTo6UXVldWUoKXsKICAgIHJlYXIgPSAtMTsKICAgIGZyb250ID0gMDsKfQoKdm9pZCBRdWV1ZTo6ZW5xdWV1ZShkb3VibGUgZGF0YSl7CiAgICBpdGVtWysrcmVhcl0gPSBkYXRhOwp9Cgp2b2lkIFF1ZXVlOjpkaXNwbGF5KCl7CiAgICBmb3IoaW50IGkgPSByZWFyOyBpID49IGZyb250OyBpLS0pCiAgICAgICAgcHJpbnRmKCIlLjRsZlxuIiwgaXRlbVtpXSk7Cn0KCgppbnQgbWFpbigpewogICAgUXVldWUgcXVldWU7CiAgICBsb25nIGxvbmcgaW50IG47CiAgICBkb3VibGUgcm9vdDsKCiAgICB3aGlsZShzY2FuZigiJWxsZCIsICZuKSAhPSBFT0YpewogICAgICAgIHJvb3QgPSBzcXJ0KG4pOwogICAgICAgIHF1ZXVlLmVucXVldWUocm9vdCk7CiAgICB9CgogICAgcXVldWUuZGlzcGxheSgpOwoKICAgIHJldHVybiAwOwp9Cg==