#include <bits/stdc++.h>
using namespace std;
char s[1111];
long long len;
long long sol(long long& a) {
  for (; s[a] <= 'z' && s[a] >= 'a'; a++)
    ;
  long long g = 0;
  long long i = 0;
  while (a < len && (s[a] < 'a' || s[a] > 'z')) {
    if (s[a] == '.') {
      i = 0;
      a++;
      continue;
    }
    i++;
    g *= 10;
    g += s[a] - '0';
    a++;
  }
  if (i != 2) {
    g *= 100;
  }
  return g;
}
int main() {
  long long a, b, c, d, e, f, g, h;
  while (~scanf("%s", s)) {
    len = strlen(s);
    d = 0;
    g = 0;
    while (d < len) {
      g += sol(d);
    }
    if (g < 100) {
      printf("0.%.2lld\n", g);
    } else {
      stack<char> sta;
      if (g % 100) {
        sta.push('0' + g % 10);
        g /= 10;
        sta.push('0' + g % 10);
        g /= 10;
        sta.push('.');
      } else {
        g /= 100;
      }
      d = 0;
      while (g) {
        sta.push(g % 10 + '0');
        g /= 10;
        d++;
        if (d == 3) {
          d = 0;
          if (g) sta.push('.');
        }
      }
      while (!sta.empty()) {
        printf("%c", sta.top());
        sta.pop();
      }
      printf("\n");
    }
  }
  return 0;
}
