#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define replr(i, l, r) for (int i = (l); i < (r); ++i)
const int mod = 1e9 + 7;
int main() {
    string s;
    cin >> s;
    vector<double> A;
    double x = 0;
    s += ',';
    rep(i, s.size()) {
        if (s[i] == ',')
            A.push_back(x), x = 0;
        else
            x = x * 10 + (s[i] - '0');
    }
    double sum = 0;
    rep(i, A.size()) sum += A[i];

    double ave = sum / double(A.size());
    printf("合計点:%d\n平均点:%.1f\n", int(sum), ave);
    return 0;
}