#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 5;
int n, a[N];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d", a + i);
  sort(a, a + n);
  for (int i = 0, eq = 0; i < n - 1; ++i) {
    if (a[i] == a[i + 1]) {
      if ((++eq) > 1 || (i > 0 && a[i] - 1 == a[i - 1]) || a[i] == 0) {
        puts("cslnb");
        return 0;
      }
    }
  }
  ll sum = 0;
  for (int i = 0; i < n; ++i) sum += a[i] - i;
  if ((sum & 1) == 0)
    puts("cslnb");
  else
    puts("sjfnb");
  return 0;
}
