#include <bits/stdc++.h>
using namespace std;
void merge(int arr[], int l, int m, int r) {
  int i, j, k;
  int n1 = m - l + 1;
  int n2 = r - m;
  int L[n1], R[n2];
  for (i = 0; i < n1; i++) L[i] = arr[l + i];
  for (j = 0; j < n2; j++) R[j] = arr[m + 1 + j];
  i = 0;
  j = 0;
  k = l;
  while (i < n1 && j < n2) {
    if (L[i] <= R[j]) {
      arr[k] = L[i];
      i++;
    } else {
      arr[k] = R[j];
      j++;
    }
    k++;
  }
  while (i < n1) {
    arr[k] = L[i];
    i++;
    k++;
  }
  while (j < n2) {
    arr[k] = R[j];
    j++;
    k++;
  }
}
void mergeSort(int arr[], int l, int r) {
  if (l < r) {
    int m = l + (r - l) / 2;
    mergeSort(arr, l, m);
    mergeSort(arr, m + 1, r);
    merge(arr, l, m, r);
  }
}
int main() {
  int t = 0;
  int n, arr[1001][3], arrfin[1000];
  cin >> n;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 2; j++) {
      cin >> arr[i][j];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 1; j++) {
      if (arr[i][j] == arr[i][j + 1]) {
        continue;
      } else {
        cout << "rated" << endl;
        return 0;
      }
    }
  }
  for (int x = 0; x < n; x++) {
    arrfin[t] = arr[x][0];
    t++;
  }
  int s = n - 1;
  mergeSort(arrfin, 0, n - 1);
  for (int g = 0; g < n; g++) {
    if (arr[g][0] == arrfin[s]) {
      s--;
    } else {
      cout << "unrated" << endl;
      return 0;
    }
  }
  cout << "maybe" << endl;
  return 0;
}
