#include <bits/stdc++.h>
using namespace std;
int n;
int a[100005];
int tp, flag, cnt;
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    tp ^= a[i] % 2;
  }
  a[0] = -1;
  sort(a + 1, a + 1 + n);
  for (int i = 1; i < n; i++) {
    cnt += (a[i] == a[i + 1]);
    if (a[i] == a[i + 1]) flag |= (a[i - 1] + 1 == a[i]);
  }
  if (cnt > 1 || flag || tp ^ (n * (n - 1) / 2 % 2) == 0)
    puts("cslnb");
  else
    puts("sjfnb");
}
