#include <bits/stdc++.h>
const int inf = 1039074182;
using namespace std;
int n;
long long a[100005];
void fi() {
  cout << "sjfnb\n";
  exit(0);
}
void se() {
  cout << "cslnb\n";
  exit(0);
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    scanf("%I64d", a + i);
  }
  if (n == 1) {
    if (a[0] & 1) {
      fi();
    } else {
      se();
    }
  }
  sort(a, a + n);
  int equals = 0;
  for (int i = 0; i < n - 1; i++) {
    equals += (a[i] == a[i + 1]);
  }
  if (equals >= 2) se();
  for (int i = 0; i < n - 1; i++) {
    if (a[i] == a[i + 1] && (a[i] == 0 || (i && a[i] - 1 == a[i - 1]))) se();
  }
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    sum += a[i];
  }
  if ((sum - 1LL * n * (n - 1) / 2) & 1)
    fi();
  else
    se();
  return 0;
}
