#include <bits/stdc++.h>
using namespace std;
const long int mod = 1e9 + 7;
char S[1003];
void solve() {
  scanf("%s", S);
  long int st = 0, len = strlen(S);
  double ans = 0;
  while (st < len) {
    while (S[st] >= 'a' && S[st] <= 'z') st++;
    long int pr = 0;
    double toAdd = 0;
    while (st < len && (S[st] < 'a' || S[st] > 'z')) {
      if (S[st] == '.') {
        st++;
        continue;
      }
      pr *= 10;
      pr += S[st++] - '0';
    }
    toAdd = pr;
    if (S[st - 3] == '.') toAdd = (double)pr / 100;
    ans += toAdd;
  }
  long int nm = ans;
  ans -= nm;
  vector<char> my;
  long int done = 0;
  while (nm > 0) {
    if (done == 3) {
      my.push_back('.');
      done = 0;
    }
    my.push_back(nm % 10 + '0');
    done++;
    nm /= 10;
  }
  long int a = (ans + 1e-4) * 100;
  for (long int i = my.size() - 1; i >= 0; i--) printf("%c", my[i]);
  if (my.size() == 0) printf("0");
  if (a > 9) {
    printf(".%ld", a);
    return;
  }
  if (a > 0) printf(".0%ld", a);
  return;
}
int main() {
  long int T = 1;
  while (T--) {
    solve();
  }
  return 0;
}
