#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int w = 1, d = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') d = d * 10 + ch - '0', ch = getchar();
  return w * d;
}
const int N = 1e5 + 7;
int a[N];
int n, tot, firt[10], kla;
int main() {
  n = read();
  int flag = 0;
  for (register int i = 1; i <= n; i++) a[i] = read();
  if (n == 1) {
    if (a[1] % 2 == 0)
      cout << "cslnb";
    else
      cout << "sjfnb";
    return 0;
  }
  sort(a + 1, a + 1 + n);
  for (int i = 1; i <= n; i++) {
    if (a[i] == a[i + 1]) {
      firt[++kla] = i;
    }
    if (a[i] == a[i + 1] && a[i + 1] == a[i + 2] || (kla == 2)) {
      flag = 1;
      break;
    }
    if (a[i] + 1 == a[i + 1] && a[i + 1] == a[i + 2]) {
      flag = 1;
      break;
    }
  }
  if (flag || (a[1] == 0 && a[2] == 0)) {
    cout << "cslnb";
    return 0;
  }
  int k = 0, lm = 1;
  long long ans = 0;
  while (lm <= n) {
    if (kla) {
      ans += (a[kla] - a[kla - 1] - 1);
      a[kla] = a[kla - 1] + 1;
      kla = 0;
    } else {
      ans += (a[lm] - k);
      k++;
      lm++;
    }
  }
  if (ans % 2)
    cout << "sjfnb";
  else
    cout << "cslnb";
}
