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