#include <bits/stdc++.h>
using namespace std;
const int kn = 2e5 + 5, N = 1e5 + 5;
const long long mod = 1e9 + 7, inf = 1e18;
long long n, a[kn], cac = 0, buoi, huhu = 0;
map<long long, long long> cnt;
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    cnt[a[i]]++;
    if (cnt[a[i]] == 2) {
      cac++;
      buoi = i;
    }
    if (a[i] == 0 && cnt[a[i]] == 2) {
      cout << "cslnb";
      return 0;
    }
    if (cnt[a[i]] > 2 || cac > 1) {
      cout << "cslnb";
      return 0;
    }
  }
  if (cac == 1) {
    if (cnt[a[buoi] - 1] == 1) {
      cout << "cslnb";
      return 0;
    }
    a[buoi]--;
    huhu = 1;
  }
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) {
    huhu += a[i] - (i - 1);
  }
  if (huhu % 2 == 0)
    cout << "cslnb";
  else
    cout << "sjfnb";
}
