#include <bits/stdc++.h>
using namespace std;
int n;
vector<long long> v;
long long turns = 0, maxx = -1;
bool opt(long long a, long long b) { return a > b; }
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  v.resize(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  sort(v.begin(), v.end(), opt);
  int bn = 0;
  for (int i = 0; i < n; i++) {
    int j;
    for (j = i; j < n; j++)
      if (v[j] != v[i]) break;
    if (j - i > 1) bn += j - i;
    i = j - 1;
  }
  if (bn > 2) {
    cout << "cslnb";
    return 0;
  }
  if (bn == 2)
    for (int i = 0; i < n - 1; i++)
      if (v[i] == v[i + 1]) {
        long long nex = -1;
        if (i + 2 < n) nex = v[i + 2];
        if (v[i] - nex == 1) {
          cout << "cslnb";
          return 0;
        }
        turns += v[i] - (nex + 1);
        v[i] -= v[i] - (nex + 1);
        break;
      }
  sort(v.begin(), v.end(), opt);
  for (int i = n - 1; i >= 0; i--)
    if (v[i] > 0 && v[i] > maxx + 1) {
      turns += v[i] - (maxx + 1);
      v[i] -= v[i] - (maxx + 1);
      maxx = v[i];
    } else
      maxx = v[i];
  if (turns % 2 == 0)
    cout << "cslnb";
  else
    cout << "sjfnb";
  return 0;
}
