#include<bits/stdc++.h> 
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define f(x, m) for(auto x : m)
#define cpu() ios::sync_with_stdio(false); cin.tie(nullptr)
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int ,int>>
#define vll vector<pair<ll ,ll>>
#define all(v) v.begin(),v.end()
#define sor(a) sort( a.begin(), a.end() )
#define ros(a) sort( a.rbegin(), a.rend())
#define prec(n) fixed << setprecision(n)
#define ff first
#define ss second
#define print(x) for(auto it : x) cout << it << " ";
#define debug(x) cerr << #x << " is " << x << endl;
#define rq(x, y) range_query(1, 0, n, x, y)
#define ru(x, y, val) range_update(1, 0, n, x, y, val)
typedef long long ll;
using namespace std;
// using namespace __gnu_pbds;
#define dbg(args...){ string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {cout << "NEXT\n"; }
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << ", ";
err(++it, args...);
}
template<typename... T>
void rd(T& ... args){
  ((cin >> args), ...);
}
template<typename... T>
void ps(T ... args){
  ((cout << args << ' '), ...);
  cout << '\n';
}
// using ordered_set = tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update>;
const ll MOD = 1e9 + 7, MOD1 = 998244353LL, MAX = 2e5 + 5;
const char nl = '\n';      
const int INF = 2e9 + 5; 
int n;
void solve(){
  cin >> n;
  cout << 100 - (n % 100) << '\n'; 
}
int main(){
  cpu();
  int __ = 1;
  // cin >> __;
  while(__--){
    solve();
  }
  return 0;
}
#include<bits/stdc++.h>
#define pb push_back
#define mod 1000000007
#define endl '\n'
using namespace std;
#define ll long long int
ll ceil_div(ll a, ll b) {
    return (a + b - 1) / b;
} 
ll maxi(ll a,ll b){
   return (a>b)?a:b;
}
ll mini(ll a,ll b){
   return (a<b)?a:b;
}
long double nthRoot(ll A, ll N) 
{ 
   long double xPre = rand() % 10; 
  
    
    long double eps = 1e-3; 
  
    
    long double delX = INT_MAX; 
  
   
    long double xK; 
  
   
    while (delX > eps) 
    { 
        xK = ((N - 1.0) * xPre + 
              (long double)A/pow(xPre, N-1)) / (long double)N; 
        delX = abs(xK - xPre); 
        xPre = xK; 
    } 
  
    return xK; 
}
ll powe(ll x, unsigned ll y) 
{ 
    ll res = 1;      // Initialize result 
  
     // Update x if it is more than or  
                // equal to p 
  
    while (y > 0) 
    { 
        // If y is odd, multiply x with result 
        if (y & 1) 
            res = (res*x); 
  
        // y must be even now 
        y = y>>1; // y = y/2 
        x = (x*x);   
    } 
    return res; 
} 
bool isInteger( long double value )
{
    long double flr = floor( value + 1e-5 );
    long double diff = value - flr;
    return diff < 1e-5;
}
void solve(){
	 ll n;
	 cin>>n;
	 ll arr[n];
	 ll i;
	 ll x=0,y=0;
	 for(i=0;i<n;i++){
		 cin>>arr[i];
		 x+=abs(arr[i]);
		 y+=abs(arr[i])*abs(arr[i]);
		 arr[i]=abs(arr[i]);
     }
     cout<<x<<endl;
     cout<<fixed<<setprecision(15)<<(long double)sqrt(y)<<endl;
     cout<<*max_element(arr,arr+n);
}
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    ll t=1;
   // cin>>t;
    while(t--){
		solve();
	}
}

