#include <bits/stdc++.h>
using namespace std;
const long long MAX_N = 1e5 + 5;
long long n, ans;
long long Arr[MAX_N], Brr[MAX_N], ind;
unordered_map<int, int> cnt;
int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> Arr[i];
  sort(Arr, Arr + n);
  int id = -1;
  for (int i = 0; i < n; i++) {
    cnt[Arr[i]]++;
    if (cnt[Arr[i]] == 3) {
      cout << "cslnb\n";
      return 0;
    }
    if (cnt[Arr[i]] == 2) {
      if (id != -1) {
        cout << "cslnb\n";
        return 0;
      }
      id = Arr[i];
    }
  }
  bool f = true;
  long long sum = 0;
  if (id != -1) {
    if (id == 0 || cnt[id - 1]) {
      cout << "cslnb\n";
      return 0;
    }
    cnt[id]--;
    cnt[id - 1]++;
    sum = 1;
    f ^= 1;
  }
  for (int i = 0; i < n; i++) sum = (sum + (Arr[i] - i)) % 2;
  sum = (sum % 2 + 2) % 2;
  if (sum % 2 == 0)
    cout << (f ? "cslnb" : "sjfnb");
  else
    cout << (f ? "sjfnb" : "cslnb");
  return 0;
}
