#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
const int INF = 1<<30; 
const int MOD = 1e9 + 7;
const int dy[] = {1, 0, -1, 0};
const int dx[] = {0, 1, 0, -1};
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    string s;
    vector<int> result(1010, 0);
    while(cin >> s)
    {
        int idx = -1;
        for(int i = 0; i < s.size(); i++) if(s[i] == ',') idx = i;
        if(idx == -1) break;
        int c = stoi(s.substr(0, idx));
        //int d = stoi(s.substr(idx + 1));
        result[c]++;
    }
    for(int i = 0; i < result.size(); i++)
    {
        if(result[i] >= 2) cout << i << " " << result[i] << endl;
    }
    return 0;
}


