#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100002;
int n;
int arr[MAXN];
bool checkFirstMove(long long int& turno) {
  int idx;
  int iguales = 0;
  for (int i = 1; i < n; ++i) {
    if (arr[i] == arr[i - 1]) {
      iguales++;
      idx = i - 1;
    }
  }
  if (!iguales) return false;
  if (iguales > 1 || arr[idx] == 0 ||
      ((idx > 0 && arr[idx - 1] + 1 == arr[idx]))) {
    cout << "cslnb\n";
    return true;
  }
  turno++;
  arr[idx]--;
  return false;
}
void solve() {
  long long int turno = 0;
  if (checkFirstMove(turno)) return;
  for (int i = 0; i < n; ++i) {
    turno += arr[i] - i;
  }
  if (turno & 1) {
    cout << "sjfnb\n";
  } else {
    cout << "cslnb\n";
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  if (fopen("case.in", "r")) freopen("case.in", "r", stdin);
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> arr[i];
  }
  sort(arr, arr + n);
  solve();
  return 0;
}
