Zhejiang University is about to celebrate her 122th anniversary in 2019. To prepare for the celebration, the alumni association （校友会） has gathered the ID's of all her alumni. Now your job is to write a program to count the number of alumni among all the people who come to the celebration.

## Input Specification:

Each input file contains one test case. For each case, the first part is about the information of all the alumni. Given in the first line is a positive integer N (≤$10^5$). Then N lines follow, each contains an ID number of an alumnus. An ID number is a string of 18 digits or the letter X. It is guaranteed that all the ID's are distinct.

The next part gives the information of all the people who come to the celebration. Again given in the first line is a positive integer M (≤$10^5$). Then M lines follow, each contains an ID number of a guest. It is guaranteed that all the ID's are distinct.

## Output Specification:

First print in a line the number of alumni among all the people who come to the celebration. Then in the second line, print the ID of the oldest alumnus -- notice that the 7th - 14th digits of the ID gives one's birth date. If no alumnus comes, output the ID of the oldest guest instead. It is guaranteed that such an alumnus or guest is unique.

## Sample Input:

5
372928196906118710
610481197806202213
440684198612150417
13072819571002001X
150702193604190912
6
530125197901260019
150702193604190912
220221196701020034
610481197806202213
440684198612150417
370205198709275042

## Sample Output:

3
150702193604190912

## 解答

#include<iostream>
#include<unordered_map>
#include<string>
#include<set>

using namespace std;

struct info {
string id;
bool operator < (const info &other) const {
if (id.substr(6, 4) != other.id.substr(6, 4))  return id.substr(6, 4) < other.id.substr(6, 4);
else if (id.substr(10, 2) != other.id.substr(10, 2))  return id.substr(10, 2) < other.id.substr(10, 2);
else return id.substr(12, 2) < other.id.substr(12, 2);
}
};

int main()
{
int n, m;
string str;
unordered_map<string, bool> mp1, mp2;
set<info> ans1, ans2;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
cin >> str;
mp1[str] = true;
}
scanf("%d", &m);
for (int i = 0; i < m; i++) {
cin >> str;
ans1.insert({ str });
if (mp1.find(str) != mp1.end()) ans2.insert({ str });
}
if (ans2.empty()) printf("0\n%s", ans1.begin()->id.c_str()); // 坑点1 要输出0
else printf("%d\n%s", ans2.size(), ans2.begin()->id.c_str());
return 0;
}