#include<bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <atcoder/all>
#include <atcoder/dsu>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
#include <atcoder/modint>
#include <atcoder/scc>
#include <chrono>
#include <random>
#include <cassert>
#ifndef templete
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()

//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
using namespace atcoder;
//using atmint = modint998244353;
using atmint = modint;
using Graph = vector<vector<int>>;
using P = pair<long long,long long>;
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }

//---------------------------------------------------------------------------------------------------

template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator
    T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}
    // combination of paris for n com.aCb(h+w-2,h-1);
}; 
//typedef ModInt<1000000007> mint;
typedef ModInt<998244353> mint; 
//typedef ModInt<1000000000> mint; 
Comb<mint, 2010101> com;
//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));
//vector dp(n+1,vector<ll>(n+1,0));
  std::random_device seed_gen;
  std::mt19937 engine(seed_gen());
string ye = "Yes"; string no = "No"; string draw = "Draw";

#endif // templete
//---------------------------------------------------------------------------------------------------

void _main() {
  ll n;
  cin >> n;
  vector<string>a(n);
  rep(i,0,n)cin >> a[i];
  vector<ll>sign(n,0);
  ll tot1 = 0;
  ll tot2 = 0;
  rep(i,0,n){
    if(a[i][0] == '-'){
        sign[i] = 1;
        reverse(all(a[i]));
        a[i].pop_back();
        reverse(all(a[i]));
    }
    ll pos = -1;
    rep(j,0,a[i].size())if(a[i][j] == '.')pos = j;
    ll under = a[i].size() - pos - 1;
    if(pos == -1){
        a[i] += '.';
        under = 0;
    }
    //cout << a[i] << endl;
    rep(j,0,10-under)a[i] += '0';
    ll need = 22 - a[i].size();
    reverse(all(a[i]));
    rep(j,0,need)a[i] += '0';
    reverse(all(a[i]));
   // cout << a[i] << endl;
    
    string s1 = "";
    rep(j,0,11)s1 += a[i][j];
     string s2 = "";
    rep(j,12,22)s2 += a[i][j];
    //cout << s1 << " " << s2 << endl;
    ll s1val = stoll(s1);
    if(sign[i])s1val *= -1;
    tot1 += s1val;
    
    ll s2val = stoll(s2);
    if(sign[i])s2val *= -1;
    tot2 += s2val;
    
  }

  
  ll div = tot2 / ll(10000000000);
  tot2 %= 10000000000;
  tot1 += div;
  if(tot2 == 0){
  cout << tot1;
  cout << ".";
  rep(i,0,10)cout << '0';
  cout << endl;
  }else if((tot1 >= 0 && tot2 >= 0) ||(tot1 < 0 && tot2 < 0)){
  cout << tot1;
  cout << ".";
  if(tot2 < 0)tot2 *= -1;
  string tot2str = to_string(tot2); 
  reverse(all(tot2str));
  while(tot2str.size() != 10)tot2str += '0';
  reverse(all(tot2str));
  cout << tot2str << endl;
  }else{
   if(tot1 < 0){
   tot1 += 1;
   tot2 = ll(10000000000) - tot2;
   cout << tot1;
  cout << ".";
  string tot2str = to_string(tot2);
  reverse(all(tot2str));
  while(tot2str.size() != 10)tot2str += '0';
  reverse(all(tot2str));
  cout << tot2str << endl;
   }else{
   tot1 -= 1;
   tot2 *= -1;
   tot2 = ll(10000000000) - tot2;
   cout << tot1;
  cout << ".";
  string tot2str = to_string(tot2);
  reverse(all(tot2str));
  while(tot2str.size() != 10)tot2str += '0';
  reverse(all(tot2str));
  cout << tot2str << endl;
   }


  }
}