#include <bits/stdc++.h>
const int maxn = 100010;
using namespace std;
long long x[maxn];
int n;
bool check() {
  int jud = 0;
  int cun = -1;
  for (int i = 1; i < n; i++) {
    if (x[i] == x[i + 1]) jud++;
    if (jud == 1 && cun == -1) cun = i;
    if (jud >= 2) return false;
  }
  if (jud == 1) {
    if (x[cun] == 0 || x[cun] - 1 == x[cun - 1]) return false;
  }
  return true;
}
int main() {
  int i, j;
  cin >> n;
  for (i = 1; i <= n; i++) scanf("%lld", &x[i]);
  sort(x + 1, x + 1 + n);
  x[0] = -1;
  if (!check()) {
    cout << "cslnb" << endl;
    return 0;
  }
  long long ex = 0;
  for (i = 1; i <= n; i++) ex = (ex + x[i] - (i - 1)) % 2;
  if (ex == 1)
    cout << "sjfnb" << endl;
  else
    cout << "cslnb" << endl;
  return 0;
}
