#include <bits/stdc++.h>
using namespace std;
long long n, a[100005], nrm;
map<long long, long long> mm;
int main() {
  long long i, lastviz = -1, ok = 1, nrf = 0;
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
    mm[a[i]]++;
  }
  if (n == 1) {
    if (a[1] == 0) {
      cout << "cslnb";
      return 0;
    } else if (a[1] % 2 == 1) {
      cout << "sjfnb";
      return 0;
    } else {
      cout << "cslnb";
      return 0;
    }
  }
  for (auto it = mm.begin(); it != mm.end(); ++it)
    if (it->second >= 3)
      ok = 0;
    else if (it->second == 2) {
      nrf++;
      if ((it->first > 0) && (mm[it->first - 1])) ok = 0;
    }
  if (nrf >= 2) ok = 0;
  if (!ok) {
    cout << "cslnb";
    return 0;
  }
  sort(a + 1, a + n + 1);
  for (i = 1; i <= n; i++) {
    if (a[i] - (lastviz + 1) < 0) {
      cout << "cslnb";
      return 0;
    }
    nrm += (a[i] - (lastviz + 1));
    lastviz++;
  }
  if (nrm % 2 == 1) {
    cout << "sjfnb";
    return 0;
  } else {
    cout << "cslnb";
    return 0;
  }
  cout << nrm;
  return 0;
}
