#include <bits/stdc++.h>
using namespace std;
using uint = unsigned;
using lint = long long;
using ulint = unsigned long long;
using ldouble = long double;
using point = complex<double>;
using doublex = complex<ldouble>;
const double E = 1e-9, pi = 2 * acos(0);
const ldouble PI = 2 * acosl(0);
bool solve(int testNumber) {
  string str;
  if (!(cin >> str)) return false;
  int pos = 0;
  int i = 0, f = 0;
  while (pos < (int)str.size()) {
    while (!isdigit(str[pos])) pos++;
    int x = 0, y = 0;
    int dot = -1;
    while (pos < (int)str.size() and !isalpha(str[pos])) {
      if (str[pos] == '.')
        dot = 0;
      else {
        x = 10 * x + str[pos] - '0';
        if (dot != -1) dot++;
      }
      pos++;
    }
    assert(dot == -1 or dot == 2 or dot == 3);
    if (dot == 2) {
      y = x % 100;
      x /= 100;
    }
    i += x;
    f += y;
    i += f / 100;
    f %= 100;
  }
  string output;
  if (f) {
    output.push_back(f % 10 + '0');
    output.push_back(f / 10 + '0');
    output.push_back('.');
  }
  if (!i) output.push_back('0');
  for (int it = 0; i; it++) {
    output.push_back(i % 10 + '0');
    i /= 10;
    if (it % 3 == 2 and i) output.push_back('.');
  }
  reverse(output.begin(), output.end());
  printf("%s\n", output.c_str());
  return true;
}
void init() {}
int main() {
  init();
  for (int i = 1; solve(i); i++)
    ;
  return 0;
}
