#include <bits/stdc++.h>
using namespace std;
int a[100001];
map<int, int> used;
int main() {
  int n, p, k1 = 0;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (!used[a[i]])
      used[a[i]] = 1;
    else
      used[a[i]]++;
    if (used[a[i]] == 3) {
      cout << "cslnb";
      return 0;
    }
    if (used[a[i]] == 2) {
      k1++;
      p = i;
    }
  }
  if (n == 1) {
    if (a[0] % 2 == 1)
      cout << "sjfnb";
    else
      cout << "cslnb";
    return 0;
  }
  if (k1 > 1) {
    cout << "cslnb";
    return 0;
  }
  int k = 0;
  if (k1) {
    if (a[p]) {
      a[p]--;
      if (used[a[p]]) {
        cout << "cslnb";
        return 0;
      } else
        k++;
    } else {
      cout << "cslnb";
      return 0;
    }
  }
  sort(a, a + n);
  if (a[0] > 0) {
    k += a[0];
    k %= 2;
    a[0] = 0;
  }
  for (int i = 0; i < n - 1; i++) {
    k += a[i + 1] - a[i] - 1;
    k %= 2;
    a[i + 1] = a[i] + 1;
  }
  k %= 2;
  if (k == 1)
    cout << "sjfnb";
  else
    cout << "cslnb";
  return 0;
}
