#include <bits/stdc++.h>
using namespace std;
long long a[100005];
int main() {
  long long n, ans = 0;
  scanf("%lld", &n);
  for (long long i = 0; i < n; i++) scanf("%lld", &a[i]);
  map<long long, long long> mp;
  sort(a, a + n);
  long long f = 0, x = 0;
  for (int i = 0; i < n; i++) {
    mp[a[i]]++;
    if (mp[0] == 2) {
      f = 1;
      break;
    }
    if (mp[a[i]] == 3) {
      f = 1;
      break;
    }
    if (mp[a[i]] == 2) {
      x++;
      if (x == 2) {
        f = 1;
        break;
      }
      if (mp[a[i] - 1]) {
        f = 1;
        break;
      }
    }
  }
  if (f == 1) {
    cout << "cslnb" << endl;
    return 0;
  }
  for (long long i = 0; i < n; i++) {
    if (a[i] >= i) ans += a[i] - i;
  }
  if (ans & 1)
    cout << "sjfnb" << endl;
  else
    cout << "cslnb" << endl;
  for (int i = 123; i < 97894323; i++)
    ;
  for (int i = 54632132; i > 321; i--)
    ;
  for (int i = 65498423; i > 23; i--)
    ;
  for (int i = 654; i < 65464789; i++)
    ;
  return 0;
}
