#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, sets = 0;
  cin >> n;
  vector<long long int> a(n);
  long long int pos = -1;
  unordered_map<int, int> mp;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    mp[a[i]]++;
    if (mp[a[i]] == 2) {
      sets++;
      pos = i;
    }
    if (mp[a[i]] > 2) {
      cout << "cslnb";
      return;
    }
    if (sets > 1) {
      cout << "cslnb";
      return;
    }
  }
  if (pos != -1 && mp[a[pos] - 1] > 0) {
    cout << "cslnb";
    return;
  }
  if (mp[0] >= 2) {
    cout << "cslnb";
    return;
  }
  sort(a.begin(), a.end());
  long long int ans = 0, k = 0;
  for (long long i = 0; i < n; i++) {
    ans += (a[i] - (i));
  }
  if (ans % 2 == 1) {
    cout << "sjfnb";
  } else {
    cout << "cslnb";
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int TC;
  TC = 1;
  for (int t = 0; t < TC; t++) solve();
  cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
       << "ms\n";
  return 0;
}
