#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e5 + 10;
int n;
long long a[maxN];
map<int, int> cnt;
int main() {
  ios::sync_with_stdio(0);
  cin >> n;
  int couple = 0;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    if (cnt[a[i]] >= 1) couple++;
    cnt[a[i]]++;
  }
  if (couple > 1) {
    cout << "cslnb";
    return 0;
  }
  int turn = 0;
  if (couple == 1) {
    for (int i = 1; i <= n; ++i)
      if (cnt[a[i]] == 2) {
        if (a[i] == 0 || cnt[a[i] - 1]) {
          cout << "cslnb";
          return 0;
        } else {
          a[i]--;
          turn ^= 1;
          break;
        }
      }
  }
  long long sum = 0;
  for (int i = 1; i <= n; ++i) sum += a[i];
  sum -= n * (n - 1) / 2;
  if (sum % 2 == 0) turn ^= 1;
  cout << (turn ? "cslnb" : "sjfnb");
  return 0;
}
