#include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T &a,T b){if(a>b)a=b;}
constexpr int INF=1000000000;
constexpr ll llINF=1000000000000000000;
constexpr int mod=1000000007;
constexpr double eps=1e-10;
const double pi=acos(-1);
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int Random(int mi,int ma){
    random_device rnd;
    mt19937 mt(rnd());//32bit
    //[mi,ma]
    uniform_int_distribution<int>engine(mi,ma);
    return engine(mt);
}
int gcd(int a,int b){
    if(b==0)return a;
    return gcd(b,a%b);
}
int lcm(int a,int b){
    return a/gcd(a,b)*b;
}
bool prime(int a){
    if(a==1)return false;
    for(int i=2;i*i<=a;i++){
        if(a%i==0)return false;
    }
    return true;
}
int modpow(int a,int b){
    if(b==0)return 1;
    if(b%2)return modpow(a,b-1)*a%mod;
    int memo=modpow(a,b/2);
    return memo*memo%mod;
}
vector<int>kaijo,invkaijo;
void init_fact(int n){
    kaijo.resize(n+1);
    invkaijo.resize(n+1);
    kaijo[0]=1;
    for(int i=1;i<=n;i++){
        kaijo[i]=kaijo[i-1]*i;
        kaijo[i]%=mod;
    }
    rep(i,n+1)invkaijo[i]=modpow(kaijo[i],mod-2);
}
int comb(int a,int b){
    if(a<b)return 0;
    if(a<0||b<0)return 0;
    return kaijo[a]*invkaijo[a-b]%mod*invkaijo[b]%mod;
}
int inv(int x){
    x=modpow(x,mod-2);
    return x;
}

int main(){
    cin.tie(0);ios::sync_with_stdio(false);
    int n;
    cin>>n;
    ll d[100010];
    rep(i,n)cin>>d[i];
    {
        ll sum=0;
        rep(i,n)sum+=abs(d[i]);
        printf("%lld\n",sum);
    }
    {
        ll sum=0;
        rep(i,n){
            sum+=d[i]*d[i];
        }
        if(sum==0)printf("%lld\n",(ll)0);
        else{
            double h=1e9,l=0;
            rep(i,1000){
                double mid=(l+h)/2;
                if(mid*mid>=(double)sum-eps)h=mid;
                else l=mid;
            }
            printf("%.12lf\n",h);
        }
    }
    {
        ll ans=0;
        rep(i,n)chmax(ans,abs(d[i]));
        printf("%lld\n",ans);
    }
    return 0;
}
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
using ll = long long;

int main() {
  int N,i;
  cin>>N;
  vector<ll> x(N);
  for (i=0;i<N;i++) {
    cin>>x[i];
    x[i] = abs(x[i]);
  }
  ll l1=0, l3=0;
  long double l2=0;
  for (i=0;i<N;i++) {
    l1 += x[i];
    l2 += x[i]*x[i];
    l3 = max(l3, x[i]);
  }
  cout<<l1<<endl;
  printf("%.15Lf\n", sqrt(l2));
  cout<<l3<<endl;
  return 0;
}
