#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
template <class T, class U>
inline void checkmin(T &x, U y) {
  if (y < x) x = y;
}
template <class T, class U>
inline void checkmax(T &x, U y) {
  if (y > x) x = y;
}
template <class T, class U>
inline bool ifmax(T &x, U y) {
  if (y > x) return x = y, true;
  return false;
}
template <class T, class U>
inline bool ifmin(T &x, U y) {
  if (y < x) return x = y, true;
  return false;
}
template <class T>
inline void sort(T &a) {
  sort(a.begin(), a.end());
}
template <class T>
inline void rsort(T &a) {
  sort(a.rbegin(), a.rend());
}
template <class T>
inline void reverse(T &a) {
  reverse(a.begin(), a.end());
}
template <class T, class U>
inline istream &operator>>(istream &str, pair<T, U> &p) {
  return str >> p.first >> p.second;
}
template <class T>
inline istream &operator>>(istream &str, vector<T> &a) {
  for (auto &i : a) str >> i;
  return str;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cout << fixed << setprecision(12);
  ;
  srand(94385);
  long long n;
  cin >> n;
  vector<long long> c(n);
  cin >> c;
  sort(c);
  int flag = 0;
  for (int i = 1; i < n; ++i)
    if (c[i] > 0 && c[i - 1] == c[i]) {
      --c[i - 1];
      flag = 1;
      break;
    }
  for (int i = 1; i < n; ++i)
    if (c[i - 1] == c[i]) {
      cout << "cslnb";
      return 0;
    }
  long long sum = n * (n - 1) / 2;
  for (auto i : c) sum += i;
  if ((sum + flag) % 2 == 1)
    cout << "sjfnb";
  else
    cout << "cslnb";
  return 0;
}
