#include <bits/stdc++.h>
using namespace std;
const int inf = INT_MAX;
const long long int infl = LLONG_MAX;
int main() {
  std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  int n;
  cin >> n;
  int arr[n];
  long long int sum = 0;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    sum += arr[i];
  }
  sort(arr, arr + n);
  int c = 0;
  for (int i = 1; i < n; i++) {
    if (arr[i] == 0) {
      cout << "cslnb" << endl;
      return 0;
    }
    if (arr[i] == arr[i - 1]) {
      c++;
    }
  }
  if (c >= 2) {
    cout << "cslnb" << endl;
    return 0;
  }
  for (int i = 1; i < n - 1; i++) {
    if (arr[i] == arr[i + 1] && arr[i - 1] >= arr[i] - 1) {
      cout << "cslnb" << endl;
      return 0;
    }
  }
  long long int z = n * (n - 1);
  z /= 2;
  sum -= z;
  if (sum % 2 == 0) {
    cout << "cslnb" << endl;
  } else {
    cout << "sjfnb" << endl;
  }
  return 0;
}
