#include <bits/stdc++.h>
using namespace std;
int n, inv;
long long ans, a[100005];
int32_t main() {
  ios_base ::sync_with_stdio(0);
  cin.tie();
  cout.tie();
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, a + n + 1);
  for (int i = 2; i <= n; i++) {
    if (a[i] == a[i - 1] && a[i] != 0) {
      a[i - 1]--;
      inv = 1;
      break;
    }
  }
  for (int i = 2; i <= n; i++) {
    if (a[i] == a[i - 1]) {
      cout << "cslnb";
      return 0;
    }
  }
  for (int i = 1; i <= n; i++) ans += (a[i] - i - 1);
  ans %= 2;
  if (ans ^ inv)
    cout << "sjfnb";
  else
    cout << "cslnb";
}
