#include <bits/stdc++.h>
const int N = 1e5 + 7;
using namespace std;
long long a[N];
int main() {
  int i, j, k, n, flag = 0, zero = 0, x;
  long long sum = 0;
  scanf("%d", &n);
  for (i = 0; i < n; i++) scanf("%lld", &a[i]), sum += a[i];
  sort(a, a + n);
  for (i = 0; i < n; i++) {
    if (a[i] == 0) zero++;
    if (i > 0 && a[i] == a[i - 1]) flag++, x = a[i];
  }
  if (zero > 1 || flag > 1) {
    printf("cslnb");
  } else {
    if (flag == 0) {
      long long dx = sum - (0 + n - 1) * n / 2;
      if (dx % 2 == 0)
        printf("cslnb");
      else
        printf("sjfnb");
    } else {
      int pan = 0;
      for (i = 0; i < n; i++)
        if (a[i] == x - 1) pan = 1;
      long long dx = sum - (0 + n - 1) * n / 2;
      if (pan == 0) {
        if (dx % 2 == 0)
          printf("cslnb");
        else
          printf("sjfnb");
      } else {
        printf("cslnb");
      }
    }
  }
}
