#include <bits/stdc++.h>
using namespace std;
long long tot;
int n;
int a[123123];
int main() {
  int i, j, pd = 0;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + n + 1), a[0] = -1;
  for (i = 1; i <= n; i++) {
    if (i > 1 && a[i] == a[i - 1]) {
      pd++;
      if (a[i - 1] == a[i - 2] + 1) {
        printf("cslnb");
        return 0;
      }
    }
    if (a[i] - i + 1 < 0) {
      printf("cslnb\n");
      return 0;
    }
    tot += a[i] - i + 1;
  }
  if (pd > 1) {
    printf("cslnb\n");
    return 0;
  }
  if ((tot % 2) > 0)
    printf("sjfnb\n");
  else
    printf("cslnb\n");
}
