#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 200005;
int n, a[N], d = 0, d0 = 0;
long long s = 0;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) {
    s += a[i];
    if (i > 1 && a[i] == a[i - 1]) {
      if (a[i] == 0) d0++;
      d++;
      if (i > 2 && a[i - 2] + 1 == a[i - 1]) d0++;
    }
  }
  if (s == 0 || d > 1 || d0) {
    cout << "cslnb";
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    s -= (i - 1);
  }
  if (s % 2)
    cout << "sjfnb";
  else
    cout << "cslnb";
  return 0;
}
