#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  auto A = vector<int>(n);
  for (auto& x : A) cin >> x;
  sort(A.begin(), A.end());
  long long cnt = 0;
  auto same = false;
  for (auto i = 0; i < A.size(); ++i) {
    if (A[i] < i || i > 0 && A[i - 1] == A[i] && same ||
        i > 1 && A[i - 1] == A[i] && A[i - 2] + 1 == A[i - 1]) {
      cout << "cslnb" << endl;
      return;
    }
    if (i > 0 && A[i - 1] == A[i]) same = true;
    cnt += A[i] - i;
  }
  if (cnt % 2)
    cout << "sjfnb" << endl;
  else
    cout << "cslnb" << endl;
}
int main() {
  cin.sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
}
