#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int n;
  cin >> n;
  vector<long long int> a(n);
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  long long int countDouble = 0;
  long long int total = 0;
  for (long long int i = 1; i < n; i++) {
    if (a[i] == a[i - 1]) {
      countDouble++;
      if (i - 2 >= 0 && a[i - 1] - 1 == a[i - 2]) {
        cout << "cslnb" << endl;
        return 0;
      }
      if (a[i] == 0) {
        cout << "cslnb" << endl;
        return 0;
      }
    }
  }
  for (long long int i = 0; i < n; i++) {
    total += a[i];
  }
  if (countDouble >= 2) {
    cout << "cslnb" << endl;
    return 0;
  }
  long long int count = (n * (n - 1)) / 2;
  long long int diff = total - count;
  if (diff % 2 == 0) {
    cout << "cslnb" << endl;
  } else {
    cout << "sjfnb" << endl;
  }
  return 0;
}
