#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<map>
using namespace std;
#define N 3
struct stu {
char Name[10];
int BeginHour;
int BeginMin;
int EndHour;
int EndMin;
}Stu[100];
void qufen(char* a) {
for (int i = 0; a[i] != NULL; i++) {
if (a[i] >= 'A'&&a[i] <= 'Z') {
a[i] -= 'A' - 'a';
}
}
}
int main() {
//2017 Problems A
/*int count, num[1000], m, n, medium;
cin >> count;
for (int i = 0; i < count; i++) {
cin >> num[i];
}
sort(num, num + count);
medium = num[(count - 1) / 2];
for (int i = ((count - 1) / 2) - 1;; i--) {
if (num[i] != medium) {
m = i;
break;
}
}
for (int i = ((count - 1) / 2) + 1;; i++) {
if (num[i] != medium) {
n = i;
break;
}
}
m = m + 1;
n = count - n;
if (m == n) {
cout << medium << endl;
}
else {
cout << -1 << endl;
}*/
//2017 Problems B
/*char str[100], strs[100][100], temstr[100];
scanf_s("%s", str, sizeof(str));
bool flag;
cin >> flag;
int count;
cin >> count;
for (int i = 0; i < count; i++) {
scanf_s("%s", strs[i], sizeof(strs[i]));
}
if (flag == 1) {
for (int i = 0; i < count; i++) {
if (strstr(strs[i], str)) {
cout << strs[i] << endl;
}
}
}
if (flag == 0) {
qufen(str);
for (int i = 0; i < count; i++) {
strcpy_s(temstr, strs[i]);
qufen(temstr);
if (strstr(temstr, str)) {
cout << strs[i] << endl;
}
}
}*/
//2017 Problems C
/*map<string, int> timeStu;
int hour, min;
int sum = 0;
for (int i = 0; i < N; i++) {
scanf_s("%s %d:%d %d:%d", Stu[i].Name, sizeof(Stu[i].Name), &Stu[i].BeginHour, &Stu[i].BeginMin, &Stu[i].EndHour, &Stu[i].EndMin);
//printf("%s %d:%d %d:%d", Stu[i].Name, Stu[i].BeginHour, Stu[i].BeginMin, Stu[i].EndHour, Stu[i].EndMin);
hour = Stu[i].EndHour - Stu[i].BeginHour;
sum = hour * 60;
min = Stu[i].EndMin - Stu[i].BeginMin;
sum += min;
timeStu[Stu[i].Name] += sum;
sum = 0;
}
map<string, int>::iterator it = timeStu.begin();
for (; it != timeStu.end(); it++) {
cout << it->first << " " << it->second << endl;
}*/
return 0;
}