#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf = 0x3f3f3f3f;
long long a[maxn];
set<long long> s;
int main() {
  long long n;
  scanf("%lld", &n);
  long long sum = 0, flag = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
    sum += a[i];
  }
  sort(a + 1, a + 1 + n);
  for (int i = 1; i <= n; i++) {
    if (s.count(a[i]) && flag < 2) {
      flag++;
      if (a[i] == 0) flag++;
      if (s.count(a[i] - 1)) flag++;
    } else
      s.insert(a[i]);
  }
  if (flag >= 2)
    cout << "cslnb" << endl;
  else {
    long long temp = n * (n - 1) / 2;
    sum -= temp;
    if (sum & 1)
      cout << "sjfnb" << endl;
    else
      cout << "cslnb" << endl;
  }
  return 0;
}
