#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
  ll su = 0;
  ll n;
  cin >> n;
  ll ar[n];
  for (ll i = 0; i < n; i++) {
    cin >> ar[i];
    su += ar[i];
  }
  ll c1 = 0, c2 = 0, cx = 0;
  sort(ar, ar + n);
  ll fl = 1;
  for (ll i = 0; i < n - 1; i++) {
    if (ar[i] == ar[i + 1]) {
      if (c1 == 0 && i && ar[i - 1] < ar[i] - 1) {
        c1 = 1;
        ar[i]--;
      } else if (c1 == 0 && i == 0 && ar[0]) {
        c1 = 1;
        ar[0]--;
      } else {
        fl = 0;
        break;
      }
    }
  }
  if (!fl || !su) {
    cout << "cslnb\n";
    return 0;
  }
  ll xx = (n * (n - 1)) / 2;
  if ((su - xx) & 1) {
    cout << "sjfnb\n";
  } else {
    cout << "cslnb\n";
  }
  return 0;
}
