#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
const int M = 1e6 + 5;
const int INF = 0x3f3f3f3f;
const long long LL_MAX = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
inline long long read() {
  long long res = 0;
  bool f = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = 1;
    ch = getchar();
  }
  while (ch <= '9' && ch >= '0') {
    res = (res << 3) + (res << 1) + ch - '0';
    ch = getchar();
  }
  return f ? (~res + 1) : res;
}
long long a[N];
int n;
long long so() {
  int flag = 0;
  int cnt = -1;
  for (int i = 1; i < n; ++i) {
    if (a[i] == a[i + 1]) {
      if (a[i] == 0 || (i + 2 <= n && a[i + 2] == a[i])) return -1;
      flag++;
      cnt = i;
    }
  }
  if (cnt == -1) return 0;
  if (flag > 1) return -1;
  if (cnt == 1) return 0;
  if (a[cnt - 1] + 1 == a[cnt]) return -1;
  return 0;
}
int main() {
  n = read();
  long long ans = 0;
  for (int i = 1; i <= n; ++i) {
    a[i] = read();
    ans += a[i] - (i - 1);
  }
  sort(a + 1, a + 1 + n);
  long long tmp = so();
  if (n == 1) {
    if (a[1] % 2)
      puts("sjfnb");
    else
      puts("cslnb");
    return 0;
  }
  if (tmp == -1) {
    puts("cslnb");
    return 0;
  }
  if (ans % 2 == 0)
    puts("cslnb");
  else
    puts("sjfnb");
  return 0;
}
