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