UIU Long Recursion

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

void solve(){
    freopen("input.txt", "r", stdin);
    ll n;
    vector<int> a;
    while(cin >> n){
        a.push_back(n);
    }
    cout << fixed << setprecision(4);
    reverse(a.begin(), a.end());
    for(int i = 0; i < a.size(); i++){
        cout << sqrt(a[i]) << '\n';
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    
    return 0;
}