#include <bits/stdc++.h>
const int MAXN = 1e5;
long long a[MAXN];
int main() {
  std::ios::sync_with_stdio(false);
  std::cout.tie(nullptr);
  std::cin.tie(nullptr);
  long long n;
  std::cin >> n;
  for (int i = 0; i < n; i++) std::cin >> a[i];
  std::sort(a, a + n);
  long long moves = 0;
  for (int i = 0; i < n - 1; i++)
    if (a[i] == a[i + 1]) {
      if (a[i] == 0 || moves == 1 || (i != 0 && a[i] - 1 == a[i - 1])) {
        std::cout << "cslnb\n";
        return 0;
      }
      a[i]--;
      moves = 1;
    }
  for (long long i = 0; i < n; i++) moves += a[i] - i;
  if (moves % 2 == 0)
    std::cout << "cslnb\n";
  else
    std::cout << "sjfnb\n";
  return 0;
}
