#include <bits/stdc++.h>
using namespace std;
long long solve() {
  long long n;
  cin >> n;
  vector<long long> a(n);
  for (long long i = 0; i < n; i++) cin >> a[i];
  sort(a.begin(), a.end());
  map<long long, long long> make_pair;
  for (long long i = 0; i < n; i++) make_pair[a[i]]++;
  long long cnttwo = 0;
  if (make_pair[0] > 1) {
    cout << "cslnb" << endl;
    return 0;
  }
  for (auto i : make_pair) {
    if (i.second > 2) {
      cout << "cslnb" << endl;
      return 0;
    }
    if (i.second == 2) cnttwo++;
    if (cnttwo > 1) {
      cout << "cslnb" << endl;
      return 0;
    }
    if (i.second == 2 && make_pair[i.first - 1] > 0) {
      cout << "cslnb" << endl;
      return 0;
    }
  }
  long long ans = 0;
  for (long long i = 0; i < n; i++) ans += max((long long)0, a[i] - i);
  if (ans % 2)
    cout << "sjfnb" << endl;
  else
    cout << "cslnb" << endl;
  return 0;
}
signed main() {
  long long t;
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
