#include <bits/stdc++.h>
using namespace std;
void lc() { cout << endl; }
long long md(long long n) { return n % 998244353; }
bool isp(long long a[], long long n, long long x) {
  for (long long i = 0; i < n; i++)
    if (a[i] == x) return true;
  return false;
}
void solve() {
  long long n, r = 0;
  cin >> n;
  long long a[n];
  set<long long> st;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    st.insert(a[i]);
  }
  sort(a, a + n);
  if (st.size() < n - 1) {
    cout << "cslnb";
    return;
  }
  for (long long i = 0; i < n; i++) {
    if (a[i] >= i) r += (a[i] - i);
    if ((i > 0 and a[i] == a[i - 1] and isp(a, n, a[i] - 1)) or a[i] < i) {
      cout << "cslnb";
      return;
    }
  }
  if (r % 2)
    cout << "sjfnb";
  else
    cout << "cslnb";
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long t = 1;
  while (t--) {
    solve();
    lc();
  }
}
