#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
void solve();
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout << fixed << setprecision(10);
  long long t = 1;
  while (t--) solve();
  return 0;
}
void solve() {
  long long n;
  cin >> n;
  vector<long long> a(n);
  for (long long i = 0; i < (long long)n; i++) cin >> a[i];
  sort((a).begin(), (a).end());
  if (n == 1 && a[0] == 0) {
    cout << "cslnb"
         << "\n";
    return;
  }
  if (n == 2 && a[0] == 0 && a[1] == 1) {
    cout << "cslnb"
         << "\n";
    return;
  }
  if (n > 1 && a[0] == 0 && a[1] == 0) {
    cout << "cslnb"
         << "\n";
    return;
  }
  long long c = 0;
  long long num = -1;
  for (long long i = 1; i < (long long)n; i++) {
    if (a[i] == a[i - 1]) {
      c++;
      num = a[i];
    }
  }
  long long p = 0;
  if (c > 1) {
    cout << "cslnb"
         << "\n";
    return;
  }
  if (c == 1) {
    if (binary_search((a).begin(), (a).end(), num - 1)) {
      cout << "cslnb"
           << "\n";
      return;
    }
    a[lower_bound((a).begin(), (a).end(), num) - a.begin()]--;
    p = 1;
  }
  long long s = accumulate((a).begin(), (a).end(), (long long)0);
  long long d = (n * (n - 1)) / 2;
  long long ss = s - d;
  if (ss % 2 == p) {
    cout << "cslnb"
         << "\n";
    return;
  } else {
    cout << "sjfnb"
         << "\n";
    return;
  }
}
