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