#include <bits/stdc++.h>
using namespace std;
const int dir[2][3][2] = {{{1, 0}, {-1, 0}, {1, -1}},
                          {{1, 0}, {-1, 0}, {-1, 1}}};
int n, cnt[505][505], P[20000005][2], ans;
int flg[505][505], A[505][505], vis[505][505];
void Dfs(int x, int y, int px, int py) {
  vis[x][y] = 1;
  for (int k = 0; k < 3; k++) {
    int nx = x + dir[x & 1][k][0];
    int ny = y + dir[x & 1][k][1];
    if (nx >= 0 && ny >= 0 && (nx != px || ny != py))
      if (flg[nx][ny]) {
        if (vis[nx][ny]) {
          puts("SICK");
          exit(0);
        }
        Dfs(nx, ny, x, y);
      }
  }
}
int Check(int x, int y) {
  for (int k = 0; k < 3; k++) {
    int nx = x + dir[x & 1][k][0], ny = y + dir[x & 1][k][1];
    if (nx < 0 || ny < 0) return 0;
    if (!flg[nx][ny] || !A[nx][ny]) return 0;
    for (int l = 0; l < 3; l++) {
      int nx0 = nx + dir[nx & 1][l][0], ny0 = ny + dir[nx & 1][l][1];
      if (nx0 >= 0 && ny0 >= 0 && (nx0 != x || ny0 != y))
        if (flg[nx0][ny0]) return 0;
    }
  }
  return 1;
}
int main() {
  scanf("%d", &n);
  int t = 0, w = 0;
  for (int i = 1; i <= n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    x += 4, y += 2;
    A[x][y] = 1;
    flg[x][y] = 1;
    w++;
    P[w][0] = x;
    P[w][1] = y;
  }
  for (int x = 0; x < 505; x++)
    for (int y = 0; y < 505; y++)
      if (flg[x][y]) {
        for (int k = 0; k < 3; k++) {
          int nx = x + dir[x & 1][k][0], ny = y + dir[x & 1][k][1];
          if (nx >= 0 && ny >= 0) ans += (flg[x][y] != flg[nx][ny]);
        }
      }
  while (t < w) {
    t++;
    int x = P[t][0], y = P[t][1];
    for (int k = 0; k < 3; k++) {
      int nx = x + dir[x & 1][k][0];
      int ny = y + dir[x & 1][k][1];
      if (nx >= 0 && ny >= 0) {
        cnt[nx][ny]++;
        if (!flg[nx][ny] && cnt[nx][ny] >= 2) {
          flg[nx][ny] = 1, w++;
          P[w][0] = nx;
          P[w][1] = ny;
        }
      }
    }
  }
  for (int i = 0; i < 505; i++)
    for (int j = 0; j < 505; j++)
      if (!vis[i][j] && flg[i][j]) Dfs(i, j, -1, -1), ans -= 2;
  for (int i = 0; i < 505; i++)
    for (int j = 0; j < 505; j++)
      if (flg[i][j] && !A[i][j]) ans -= Check(i, j) * 2;
  puts("RECOVERED");
  printf("%d\n", ans);
}
