#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n;
  cin >> n;
  map<long long, long long> m;
  vector<long long> v;
  long long tmp, cnt = 0, num;
  bool b = 0;
  for (int c1 = 0; c1 < n; c1++) {
    cin >> tmp;
    v.push_back(tmp);
    m[tmp]++;
    if (m[tmp] == 2) {
      cnt++;
      num = tmp;
    }
    if (m[0] >= 2 || cnt > 1 || m[tmp] > 2) b = 1;
  }
  for (auto it : m) {
    if (it.second >= 2 && m[it.first - 1] >= 1) {
      b = 1;
      break;
    }
  }
  if (b) {
    cout << "cslnb" << endl;
    return 0;
  }
  sort(v.begin(), v.end());
  long long sum = 0;
  for (int c1 = 0; c1 < n; c1++) {
    sum += v[c1] - c1;
  }
  if (sum & 1) {
    cout << "sjfnb" << endl;
  } else {
    cout << "cslnb" << endl;
  }
  return 0;
}
