#include <bits/stdc++.h>
using namespace std;
const int maxn = 505;
vector<int> g[maxn * maxn];
int a[maxn * maxn];
int pos(int x, int y) { return x * maxn + y; }
void add(int x1, int y1, int x2, int y2) {
  int u = pos(x1, y1);
  int v = pos(x2, y2);
  g[u].push_back(v);
}
int vis[maxn * maxn];
void dfs(int u) {
  if (vis[u]) return;
  vis[u] = 1;
  for (int v : g[u]) {
    if (a[v]) dfs(v);
  }
  return;
}
int b[maxn * maxn];
int black;
int d3;
int flag = 0;
void DFS(int u, int f) {
  if (vis[u] == 2) {
    flag = 1;
    return;
  }
  vis[u] = 2;
  if (a[u]) black++;
  for (int v : g[u]) {
    if (v == f) continue;
    if (b[v]) DFS(v, u);
  }
  if (a[u] == 0) {
    int cnt = 0;
    for (int v : g[u]) {
      if (a[v] == 1) cnt++;
    }
    if (cnt == 3) d3 = 1;
  }
  return;
}
queue<int> q;
int main() {
  for (int i = 1; i <= 500; ++i) {
    for (int j = 1; j <= 500; ++j) {
      add(i, j, i - 1, j);
      add(i, j, i + 1, j);
      if (i % 2)
        add(i, j, i + 1, j - 1);
      else
        add(i, j, i - 1, j + 1);
    }
  }
  int n;
  scanf("%d", &n);
  for (int i = (0); i < (n); ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    x++;
    y++;
    a[pos(x, y)] = 1;
    q.push(pos(x, y));
    b[pos(x, y)] = 1;
  }
  int num = 0;
  for (int i = (1); i < (501); ++i)
    for (int j = (1); j < (501); ++j)
      if (vis[pos(i, j)] == 0 && a[pos(i, j)] == 1) dfs(pos(i, j)), num++;
  while (q.size()) {
    int u = q.front();
    q.pop();
    for (int v : g[u]) {
      if (b[v]) continue;
      int cnt = 0;
      for (int to : g[v]) {
        if (b[to]) cnt++;
      }
      if (cnt >= 2) {
        b[v] = 1;
        q.push(v);
      }
    }
  }
  int t = 0, z = 0;
  for (int i = (1); i < (501); ++i)
    for (int j = (1); j < (501); ++j)
      if (vis[pos(i, j)] != 2 && b[pos(i, j)] == 1) {
        d3 = 0;
        black = 0;
        DFS(pos(i, j), pos(i, j)), t++;
        if (d3 && black == 3) z++;
      }
  if (flag) {
    puts("SICK");
    return 0;
  } else {
    puts("RECOVERED");
    int ans = n + 2 * (num - 1 - (t - 1) - z);
    cout << ans << endl;
  }
}
