#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> a;
unordered_map<int, int> mp;
int b;
int main(int argc, char* argv[]) {
  ios::sync_with_stdio(false);
  cin >> n;
  a.resize(n);
  long long total = 0;
  int zero_cnt = 0;
  int two_cnt = 0;
  for (int i = 0; i < n; ++i) {
    cin >> b;
    a[i] = b;
    if (b == 0) {
      ++zero_cnt;
    }
    ++mp[b];
    total += b;
  }
  if (total == 0) {
    cout << "cslnb" << endl;
    return 0;
  }
  if (zero_cnt > 1) {
    cout << "cslnb" << endl;
    return 0;
  }
  unordered_set<int> used;
  for (int i = 0; i < n; ++i) {
    if (mp[a[i]] > 2) {
      cout << "cslnb" << endl;
      return 0;
    } else if (mp[a[i]] == 2) {
      used.insert(a[i]);
      if (mp[a[i] - 1] > 0) {
        cout << "cslnb" << endl;
        return 0;
      }
    }
  }
  if (used.size() > 1) {
    cout << "cslnb" << endl;
    return 0;
  }
  int n1 = n - max(zero_cnt - 1, 0);
  long long seq_sum = (long long)(n1 - 1) * n1 / 2;
  long long diff = total - seq_sum;
  if (diff & 1) {
    cout << "sjfnb" << endl;
  } else {
    cout << "cslnb" << endl;
  }
  return 0;
}
