#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 100005;
int main() {
  long long n, sum = 0;
  int a;
  bool flag = 0;
  int f = 0;
  map<int, int> mp;
  scanf("%lld", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a);
    sum += a;
    if (mp.count(a))
      mp[a]++;
    else
      mp[a] = 1;
  }
  for (auto it = mp.begin(); it != mp.end(); it++) {
    if (it->second >= 3) {
      flag = 1;
      break;
    }
    if (it->second == 2 && mp.count(it->first - 1)) {
      flag = 1;
      break;
    }
    if (it->second == 2) f++;
  }
  sum -= (n * (n - 1) / 2);
  if (flag || mp[0] >= 2 || f >= 2) {
    printf("cslnb\n");
    return 0;
  }
  if (sum % 2 == 0)
    printf("cslnb\n");
  else
    printf("sjfnb\n");
  return 0;
}
