#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long N = 3e5 + 5;
long long gcd(long long n, long long m) {
  if (n == 0)
    return m;
  else {
    return gcd(m % n, n);
  }
}
long long a[N];
vector<long long> vp;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long n;
  cin >> n;
  long long sum = 0;
  map<long long, long long> mp;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
    sum += a[i];
    mp[a[i]]++;
  }
  long long cnt = 0;
  for (auto it : mp) {
    if (it.second >= 3) {
      cout << "cslnb" << endl;
      return 0;
    }
    if (it.second == 2) {
      if (it.first == 0) {
        cout << "cslnb" << endl;
        return 0;
      }
      cnt++;
    }
  }
  if (sum == 0 || cnt >= 2) {
    cout << "cslnb" << endl;
    return 0;
  }
  for (auto it : mp) {
    if (it.second == 2) {
      if (mp[it.first - 1] > 0) {
        cout << "cslnb" << endl;
        return 0;
      }
    }
  }
  sort(a + 1, a + n + 1);
  long long cnt1 = 0;
  long long sum1 = 0;
  for (long long i = 1; i <= n; i++) {
    sum1 += a[i] - (i - 1);
  }
  if (sum1 % 2) {
    cout << "sjfnb" << endl;
  } else {
    cout << "cslnb" << endl;
  }
}
