#include <bits/stdc++.h>
void solve() {
  int n, m;
  std::map<int, int> num;
  for (int i = 0; i < 3; i++) num.insert(std::pair<int, int>((i + 1), -1));
  int s[5];
  int c[5];
  for (int i = 0; i < 5; i++) s[i] = c[i] = -1;
  for (int i = 0; i < m; i++) std::cin >> s[i] >> c[i];
}
int main() {
  solve();
  return 0;
}
