#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
 
using namespace std;
 
#define rep(i,n) for(int i=0; i<(n); i++)
#define repc(i,s,e) for(int i=(s); i<(e); i++)
#define pb(n) push_back((n))
#define mp(n,m) make_pair((n),(m))
#define all(r) r.begin(),r.end()
#define fi first
#define se second
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
 
 
 
const int INF = 1000000;


vector<string> split(const string &s, char c = ' '){
	vector<string> ret;
	stringstream ss(s);
	string t;
	while(getline(ss,t,c)){
		ret.pb(t);
	}
	return ret;
}


int main(){
	map<int,int> m;
	set<int> s1, s2;
	string s;
	bool f = true;
	while(getline(cin,s)){
		if(s ==""){
			f = false;
			continue;
		}
		vector<string> v = split(s,',');
		int a = atoi(v[0].c_str());
		m[a]++;
		if(f) s1.insert(a);
		else s2.insert(a);
	}

	for(auto it = m.begin(); it != m.end(); it++){
		if(s1.count(it -> fi) && s2.count(it -> fi)) cout<<it->fi<<" "<<it->se<<endl;
	}
}