#include <bits/stdc++.h>
using namespace std;
long long a[1000001];
map<long long, long long> fr;
int main() {
  long long n, i, ok = -1, nr = 0, act;
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
    fr[a[i]]++;
    if (fr[a[i]] >= 2) {
      nr++;
      ok = a[i];
    }
  }
  if (nr >= 2 || ok == 0 || (ok > 0 && fr[ok - 1] >= 1)) {
    cout << "cslnb" << '\n';
    return 0;
  }
  sort(a + 1, a + n + 1);
  act = 0;
  for (i = 1; i <= n; i++) {
    act = act + a[i] - i + 1;
  }
  if (act % 2 == 1)
    cout << "sjfnb" << '\n';
  else
    cout << "cslnb" << '\n';
  return 0;
}
