#include <bits/stdc++.h>
using namespace std;
long long a[100002];
long long n;
map<long long, long long> mp;
bool F() {
  for (long long i = 0; i < n; i++) {
    if (mp[i] != 1) return false;
  }
  return true;
}
int main() {
  scanf("%lld", &n);
  for (long long i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
    mp[a[i]]++;
  }
  bool flag = false;
  long long cnt = 0;
  for (auto it = mp.begin(); it != mp.end(); it++) {
    pair<long long, long long> tmp = (*it);
    if (tmp.second > 2) flag = true;
    if (tmp.second == 2) cnt++;
  }
  if (flag || cnt > 1 || F()) {
    cout << "cslnb" << endl;
    return 0;
  }
  bool f = false;
  for (long long i = 1; i <= n; i++) {
    if (mp[a[i]] == 2) {
      f = true;
      if (a[i] == 0)
        flag = true;
      else if (mp[a[i] - 1])
        flag = true;
      else {
        a[i]--;
      }
      break;
    }
  }
  if (flag) {
    cout << "cslnb" << endl;
    return 0;
  }
  sort(a + 1, a + n + 1);
  cnt = 0;
  for (long long i = 0; i < n; i++) {
    cnt += (a[i + 1] - i);
  }
  if (!f) cnt--;
  if (cnt % 2)
    cout << "cslnb" << endl;
  else
    cout << "sjfnb" << endl;
  return 0;
}
