#include <bits/stdc++.h>   using namespace std;   const int MAX_MEM = (int)1e8;   int mpos = 0;   char mem[MAX_MEM];   inline void *operator new(size_t n) {     char *res = mem + mpos;     mpos += n;     return (void *)res;   }   inline void operator delete(void *) {}   struct __io_dev {     __io_dev(const bool &__fastio = false) {       if (__fastio) ios_base::sync_with_stdio(false), cin.tie(nullptr);       srand(time(nullptr));       if (!string(  ).empty())         freopen(                             .in ,              r , stdin),             freopen(                                     .out ,                  w , stdout);     }     ~__io_dev() { fprintf(stderr,  %.6f ms n , 1e3 * clock() / CLOCKS_PER_SEC); }   } __io(false);   const long long inf = (long long)1e+9 + 7ll;   const long long linf = (long long)1e+18 + 7ll;   const long double eps = (long double)1e-9;   const long double pi = acosl((long double)-1.0);   const int alph = 26;   const int maxs = 512l;   static char buff[(int)2e6 + 17];   long long __p[3] = {29ll, 31ll, 33ll};   long long __mod[3] = {inf, inf + 2ll, 14881337ll};   const int maxn = (int)2e5 + 17;   int n;   string s;   long long R, K;   void print(int R, int K) {     string r;     int cnt = 0;     for (; R > 0; R /= 10) {       r.push_back(char( 0  + R % 10));       ++cnt;       if (cnt % 3 == 0) r.push_back( . );     }     if (r.back() ==  . ) r.pop_back();     if (((int)(r.size())) == 0) r.push_back( 0 );     reverse(r.begin(), r.end());     printf( %s , r.c_str());     if (K != 0) printf( .%.2d , K);   }   int main() {     scanf( %s , buff);     s = string(buff);     n = ((int)(s.size()));     for (int i = 0; i < n; ++i)       if (!( a  <= s[i] && s[i] <=  z )) {         int r = i;         string t =   ;         for (; r < n && !( a  <= s[r] && s[r] <=  z ); ++r) t += s[r];         if (((int)(t.size())) >= 3 && t[((int)(t.size())) - 3] ==  . ) {           K += 10 * (t[((int)(t.size())) - 2] -  0 ) + t[((int)(t.size())) - 1] -                 0 ;           int cursize = ((int)(t.size()));           t.resize(cursize - 3);         }         long long cur = 0;         for (auto c : t)           if ( 0  <= c && c <=  9 ) cur = cur * 10ll + c -  0 ;         R += cur;         i = r - 1;       }     R += K / 100;     K %= 100;     print(R, K);     return 0;   }   