#include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 1e+9 + 7;
const ll INF = LLONG_MAX;
const int N = (int)2e+5 + 8;
vector<pair<int, string>> taxi, pizza, girl;
int first(string x) {
  bool taxi = true;
  for (char i : x)
    if (i != '-' && i != x[0]) {
      taxi = false;
      break;
    }
  if (taxi) return 0;
  if ((x[0] > x[1]) && (x[1] > x[3]) && (x[3] > x[4]) && (x[4] > x[6]) &&
      (x[6] > x[7]))
    return 1;
  return 2;
}
void f2(vector<string> v) {
  for (int i = 0; i < v.size() - 1; i++) cout << v[i] << ", ";
  cout << v[v.size() - 1] << '.';
}
void MAIN(ll tc) {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int arr[3] = {0, 0, 0};
    int m;
    string name;
    cin >> m >> name;
    string no;
    for (int i = 0; i < m; i++) {
      cin >> no;
      arr[first(no)]++;
    }
    taxi.push_back({arr[0], name});
    pizza.push_back({arr[1], name});
    girl.push_back({arr[2], name});
  }
  vector<string> v;
  cout << "If you want to call a taxi, you should call: ";
  int h = 0;
  for (pair<int, string> p : taxi) h = max(h, p.first);
  for (pair<int, string> p : taxi)
    if (p.first == h) v.push_back(p.second);
  f2(v);
  cout << endl;
  cout << "If you want to order a pizza, you should call: ";
  h = 0;
  v.clear();
  for (pair<int, string> p : pizza) h = max(h, p.first);
  for (pair<int, string> p : pizza)
    if (p.first == h) v.push_back(p.second);
  f2(v);
  cout << endl;
  cout
      << "If you want to go to a cafe with a wonderful girl, you should call: ";
  h = 0;
  v.clear();
  for (pair<int, string> p : girl) h = max(h, p.first);
  for (pair<int, string> p : girl)
    if (p.first == h) v.push_back(p.second);
  f2(v);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  cout << fixed;
  cout << setprecision(10);
  int test_cases = 1;
  for (int i = 1; i <= test_cases; i++) {
    MAIN(i);
  }
}
