#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N];
int n;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  if (n == 1) {
    if (a[1] & 1)
      cout << "sjfnb" << endl;
    else
      cout << "cslnb" << endl;
    exit(0);
  }
  sort(a + 1, a + n + 1);
  int cnt = 0;
  for (int i = 1; i < n; i++)
    if (a[i] == a[i + 1]) ++cnt;
  if (cnt > 1 || (cnt == 1 && a[1] == a[2] && a[1] == 0)) {
    cout << "cslnb" << endl;
    exit(0);
  }
  bool ch = 0;
  for (int i = 1; i < n; i++)
    if (a[i] == a[i + 1]) --a[i], ch = 1;
  for (int i = 1; i < n; i++)
    if (a[i] == a[i + 1]) {
      cout << "cslnb" << endl;
      exit(0);
    }
  vector<int> b;
  for (int i = 1; i < n; i++) b.push_back(a[i + 1] - a[i]);
  long long tot = a[1];
  b[0] += a[1];
  for (int i = 0; i < b.size(); i++) {
    long long x = b[i] - 1;
    tot += x;
    if (i + 1 < b.size()) b[i + 1] += x;
  }
  if ((tot & 1) ^ ch)
    cout << "sjfnb" << endl;
  else
    cout << "cslnb" << endl;
  return 0;
}
