#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> a(n);
  map<long long int, long long int> cnt;
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
    cnt[a[i]]++;
  }
  if (cnt[0] > 1) {
    cout << "cslnb";
    return;
  }
  long long int c2 = 0;
  for (auto x : cnt) {
    if (x.second > 2) {
      cout << "cslnb";
      return;
    }
    if (x.second > 1) {
      c2++;
    }
  }
  if (c2 > 1) {
    cout << "cslnb";
    return;
  }
  for (auto x : cnt) {
    if (x.second == 2) {
      if (cnt[x.first - 1] > 0) {
        cout << "cslnb";
        return;
      }
    }
  }
  long long int sm = 0;
  sort((a).begin(), (a).end());
  for (long long int i = 0; i < n; i++) {
    if (a[i] - i >= 0) {
      sm += a[i] - i;
    }
  }
  if (sm & 1) {
    cout << "sjfnb";
  } else {
    cout << "cslnb";
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int test_cases;
  test_cases = 1;
  while (test_cases--) {
    solve();
    cout << "\n";
  }
  return 0;
}
