#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000 * 1000 * 1000 + 7;
const double PI = acos(-1.0);
long long gcd(long long a, long long b) {
  long long m;
  while (b) {
    m = a % b;
    a = b;
    b = m;
  }
  return a;
}
int solve() {
  string s;
  cin >> s;
  long long total = 0;
  int n = s.size();
  for (int i = 0; i < n; ++i) {
    if (s[i] >= '0' && s[i] <= '9') {
      int j = i;
      long long u = 0;
      int dot = -1;
      while (s[j] >= '0' && s[j] <= '9' || s[j] == '.') {
        if (s[j] == '.')
          dot = j;
        else
          u = u * 10 + (s[j] - '0');
        ++j;
      }
      if (dot == -1 || j - dot != 3) u = u * 100;
      total += u;
      i = j - 1;
    }
  }
  s.clear();
  if (total % 100 != 0) {
    s += total % 10 + '0';
    total /= 10;
    s += total % 10 + '0';
    total /= 10;
    s += '.';
  } else {
    total /= 100;
  }
  int j = 0;
  do {
    ++j;
    s += total % 10 + '0';
    if (j == 3) s += '.', j = 0;
  } while (total /= 10);
  if (s.back() == '.') s.pop_back();
  reverse(s.begin(), s.end());
  cout << s << endl;
  return 0;
}
int main() { solve(); }
