#include <bits/stdc++.h>
using namespace std;
int read() {
  int x = 0;
  bool flg = false;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') flg = true;
  for (; isdigit(ch); ch = getchar()) x = (x << 3) + (x << 1) + (ch ^ 48);
  return flg ? -x : x;
}
int n, a[100010];
bool check() {
  long long z = a[1];
  for (int i(2), _i(n); i <= _i; i++) z += a[i] - i + 1;
  return z & 1;
}
bool solve() {
  n = read();
  for (int i(1), _i(n); i <= _i; i++) a[i] = read();
  if (n == 1) {
    return a[1] & 1 ? 1 : 0;
  }
  sort(a + 1, a + n + 1);
  int p = -1;
  for (int i(2), _i(n); i <= _i; i++) {
    if (a[i] ^ a[i - 1]) continue;
    if (~p) return 0;
    p = i - 1;
  }
  if (~p) {
    if (p > 1 && a[p] - 1 == a[p - 1]) return 0;
    if (!a[p]) return 0;
    --a[p];
    return check() ^ 1;
  }
  return check();
}
int main() {
  for (int T = 1; T--;) puts(solve() ? "sjfnb" : "cslnb");
  return 0;
}
