#include <bits/stdc++.h>
using namespace std;
long long a[100005];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + n + 1);
  long long play = 0;
  long long sum = 0;
  int k = 0;
  for (int i = 1; i <= n; i++) {
    if (k > 1) {
      cout << "cslnb" << endl;
      return 0;
    }
    if (a[i] == 0) {
      k++;
      continue;
    }
    if (a[i] == a[i + 1]) {
      if (play == 1) {
        cout << "cslnb" << endl;
        return 0;
      } else {
        if ((a[i] > a[i - 1] + 1) || (k == 0 && i == 1)) {
          play = 1;
          a[i]--;
        } else {
          cout << "cslnb" << endl;
          return 0;
        }
      }
    }
    if (k > 0) {
      sum += (a[i] - (long long)(i - k));
    } else {
      sum += (a[i] - (long long)(i - k - 1));
    }
  }
  if ((play + sum) % 2 == 0) {
    cout << "cslnb" << endl;
  } else {
    cout << "sjfnb" << endl;
  }
  return 0;
}
