#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
const int INF = (int)(1e9 + 1337);
const long long LINF = (long long)(2e18);
const double EPS = 1e-11;
const int MAXN = 200100;
string a;
void solve() {
  cin >> a;
  a += '#';
  int cur = 0;
  int sz = 0;
  long long sum = 0;
  for (int i = 0; i < a.size(); ++i) {
    if (a[i] >= '0' && a[i] <= '9') {
      cur *= 10;
      cur += a[i] - '0';
      sz++;
    } else if (a[i] == '.') {
      sz = 0;
    } else {
      if (sz != 2) cur *= 100;
      sum += cur;
      cur = 0;
      sz = 0;
    }
  }
  int kop = sum % 100;
  sum /= 100;
  string ans;
  if (sum == 0) ans = '0';
  int pr = 0;
  while (sum) {
    pr++;
    ans += (sum % 10) + '0';
    sum /= 10;
    if (sum && pr % 3 == 0) ans += '.';
  }
  reverse(ans.begin(), ans.end());
  cout << ans;
  if (kop) {
    if (kop >= 10)
      cout << '.' << kop;
    else
      cout << ".0" << kop;
  }
}
int main() {
  srand(1337);
  int ts = 1;
  for (int i = 0; i < ts; ++i) solve();
  return 0;
}
