#include <bits/stdc++.h>
using namespace std;
int n;
int arr[100100];
int getNext(int a) {
  for (int i = a; i <= n; i++)
    if (arr[i] != arr[a]) return i - 1;
  return n;
}
int cal() {
  if (n == 1) return arr[1] % 2;
  sort(arr + 1, arr + n + 1);
  if (arr[1] == 0 && arr[2] == 0) return 0;
  int f1 = 0;
  for (int i = 1; i <= n; i++) {
    int idx = getNext(i);
    int uu = idx - i + 1;
    if (uu >= 3) return 0;
    if (uu == 2 && i != 1 && arr[i - 1] + 1 == arr[i]) return 0;
    if (uu == 2) f1++;
    i = idx;
  }
  if (f1 >= 2) return 0;
  int sum = arr[1];
  arr[1] = 0;
  for (int i = 2; i <= n; i++) {
    int uu = arr[i - 1] + 1;
    int vv = arr[i] - uu;
    sum = (sum + vv) % 2;
    arr[i] = uu;
  }
  return (sum % 2);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &arr[i]);
  }
  if (cal())
    printf("sjfnb\n");
  else
    printf("cslnb\n");
  return 0;
}
