#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  map<int, int> mp;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    mp[a[i]]++;
  }
  sort(a.begin(), a.end());
  int cnt = 0;
  map<int, int>::iterator it;
  for (it = mp.begin(); it != mp.end(); it++) {
    if (it->second > 2) {
      cout << "cslnb" << endl;
      return 0;
    } else if (it->second == 2) {
      if (mp[it->first - 1] > 0) {
        cout << "cslnb" << endl;
        return 0;
      }
      if (it->first == 0) {
        cout << "cslnb" << endl;
        return 0;
      }
      cnt++;
    }
  }
  if (cnt >= 2) {
    cout << "cslnb" << endl;
    return 0;
  }
  int sum = 0;
  for (int i = 0; i < n; i++) sum += a[i];
  sum -= ((n * (n - 1)) / 2);
  if (sum % 2)
    cout << "sjfnb\n";
  else
    cout << "cslnb\n";
  return 0;
}
