#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define frfr  freopen("input.text","r",stdin); //freopen("output.txt","w",stdout)
#define LL long long int
#define ull unsigned long long int
#define wh int T;cin >> T;while(T--)
#define foro(i,n) for(int i=0;i<n;i++)
#define forn(i,k,n) for(int i=k;i<n;i++)
#define PB push_back
#define mod 1000000007 
#define UMP unordered_map<int,int>
#define MP map<int,int> 
#define stack stack<int>
#define stackL 	stack<LL>

void solve(){
	double n;
	cin >> n;
	double e = 0;
	double m = 0;
	double c=0;
	for(int i=0;i<n;i++){
		double x;
		cin >> x;
		x = abs(x);
		m +=x;
		e += x*x;
		c = max(c,x);
	}
	
	printf("%0.15f\n",m);
	printf("%0.15f\n",sqrt(e));
	printf("%0.15f",c);
	
}
int main()
{
   //IOS;
   //frfr;
   // wh{
	   solve();	
	//}
	
 return 0;	
}



#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define test int tt; cin>>tt; while(tt--)
#define ff first
#define ss second
#define pb push_back
#define mkp make_pair

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    cin>>n;

    string s[n];

    for(int i=0;i<n;i++)
        cin>>s[i];

    ll int ans=0;

    for(int i=0;i<n;i++)
    {
        if(s[i][0]=='O')
            ans+=(1ll<<(i+1));
    }

    cout<<ans+1<<endl;
}
