#include <bits/stdc++.h>
using namespace std;
int n, a[100005];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, a + n + 1);
  int idx = 0;
  for (int i = 1; i < n; i++) {
    if (a[i] == a[i + 1]) {
      if (idx == 0)
        idx = i;
      else {
        cout << "cslnb\n";
        return 0;
      }
    }
  }
  if (idx == 1 && a[1] == 0 || idx > 1 && a[idx - 1] + 1 == a[idx]) {
    cout << "cslnb\n";
    return 0;
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    ans = (ans + a[i] - (i - 1)) % 2;
  }
  if (ans == 0)
    cout << "cslnb\n";
  else
    cout << "sjfnb\n";
  return 0;
}
