#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 100;
char s[N];
stack<char> st;
int main() {
  int i, j, n, ok;
  long long t;
  double ans, tmp, flag;
  scanf("%s", s + 1);
  n = strlen(s + 1);
  ans = tmp = 0;
  flag = 1;
  ok = 0;
  for (i = 1; i <= n; i++) {
    if (s[i] >= '0' && s[i] <= '9')
      tmp = tmp * 10 + (s[i] - '0');
    else if (s[i] == '.') {
      if ((i + 3 <= n && !(s[i + 3] >= '0' && s[i + 3] <= '9')) || i + 2 == n) {
        ans += tmp * flag;
        tmp = 0;
        flag = 0.01;
        ok = 1;
      } else
        continue;
    } else
      ans += tmp * flag, tmp = 0, flag = 1;
  }
  ans += tmp * flag;
  if (ok) {
    t = ans * 100 + 0.001;
    if (t % 100 == 0) {
      t = ans;
      goto ttt;
    }
    st.push(t % 10 + '0');
    t /= 10;
    st.push(t % 10 + '0');
    t /= 10;
    st.push('.');
    if (t == 0) st.push('0');
  } else
    t = ans;
ttt:
  int cnt = 0;
  while (t) {
    if (cnt && cnt % 3 == 0) st.push('.');
    st.push(t % 10 + '0');
    t /= 10;
    cnt++;
  }
  while (!st.empty()) {
    cout << st.top();
    st.pop();
  }
  cout << endl;
  return 0;
}
