#include <bits/stdc++.h>
using namespace std;
long long int ans = 0;
long long int cnt = 0;
long long int n;
long long int arr[100009];
long long int m, k;
bool cons() {
  for (int i = 0; i < n - 1; ++i) {
    if (arr[i] == arr[i + 1]) {
      arr[i]--;
      return true;
    }
  }
  return false;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> arr[i];
  }
  sort(arr, arr + n);
  int w = 0;
  if (cons()) {
    w = 1;
    if (cons()) {
      cout << "cslnb" << endl;
      return 0;
    }
  }
  if (arr[1] == 0 && n >= 2) {
    cout << "cslnb" << endl;
    return 0;
  }
  for (int i = 0; i < n; i++) {
    if (i % 2 == 0 && arr[i] % 2 == 1) w = 1 - w;
    if (i % 2 == 1 && arr[i] % 2 == 0) w = 1 - w;
  }
  if (w)
    cout << "sjfnb" << endl;
  else
    cout << "cslnb" << endl;
  return 0;
}
