#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
long long arr[MAX];
map<int, int> cnt;
int main() {
  int n;
  scanf("%d", &n);
  long long sum = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &arr[i]);
    cnt[arr[i]]++;
  }
  sort(arr + 1, arr + n + 1);
  int cn = 0;
  bool flg = false;
  int val = -1;
  if (cnt[0] >= 2) {
    flg = true;
  }
  for (auto x : cnt) {
    if (x.second > 2) {
      flg = true;
    } else if (x.second == 2) {
      cn++;
      val = x.first;
    }
  }
  if (cn > 1) {
    flg = true;
  } else if (cn == 1) {
    if (cnt[val - 1]) {
      flg = true;
    }
  }
  for (int i = 1; i <= n; i++) {
    sum += arr[i] - i - 1;
  }
  if (flg) {
    printf("cslnb\n");
  } else {
    if ((sum % 2) == 0) {
      printf("cslnb\n");
    } else {
      printf("sjfnb\n");
    }
  }
  return 0;
}
