#include <bits/stdc++.h>
using namespace std;
int main() {
  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(0);
  long long n, i, j;
  cin >> n;
  long long a[n];
  long long sum = 0;
  map<long long, long long> m;
  map<long long, long long>::iterator it;
  for (i = 0; i < n; i++) {
    cin >> a[i];
    m[a[i]]++;
    sum += a[i];
  }
  if (n == 1) {
    if (a[0] % 2 == 0) {
      cout << "cslnb";
    } else {
      cout << "sjfnb";
    }
    return 0;
  }
  long long cur;
  long long moves = 0;
  long long cnt_g2 = 0;
  long long val_g2;
  for (it = m.begin(); it != m.end(); it++) {
    cur = it->first;
    if (it->second == 2) {
      cnt_g2++;
      val_g2 = cur;
      if (m.find(cur - 1) != m.end()) {
        cout << "cslnb";
        return 0;
      }
    } else if (it->second > 2) {
      cout << "cslnb";
      return 0;
    }
  }
  if (cnt_g2 > 1) {
    cout << "cslnb";
    return 0;
  } else if (cnt_g2 == 1) {
    if (val_g2 == 0) {
      cout << "cslnb";
      return 0;
    }
  }
  long long req_sum = (n * (n - 1)) / 2;
  moves += sum - req_sum;
  if (moves <= 0) {
    cout << "cslnb";
    return 0;
  }
  if (moves % 2 != 0) {
    cout << "sjfnb";
  } else {
    cout << "cslnb";
  }
}
