#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1000;
map<int, int> v;
int a[N];
int n;
int main() {
  int f = 0, k = 0;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    v[a[i]]++;
    if (v[a[i]] > 2) f = 1;
    if (v[a[i]] == 2) {
      if (k == 0)
        k = a[i];
      else
        f = 1;
    }
  }
  if (v[0]) {
    if (v[0] > 1) f = 1;
  }
  for (int i = 1; i <= n; i++) {
    if (v[a[i]] > 1) {
      if (v[a[i] - 1]) f = 1;
    }
  }
  if (f)
    printf("cslnb\n");
  else {
    long long sum = 0;
    sort(a + 1, a + 1 + n);
    for (int i = 1; i <= n; i++) sum += (long long)(a[i] - i + 1);
    if (sum % 2)
      printf("sjfnb\n");
    else
      printf("cslnb\n");
  }
  return 0;
}
