#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353;
long long mod1 = 1e9 + 7;
const int N = 1e5 + 10;
long long n, a[N], c = 0;
string s[2] = {"cslnb", "sjfnb"};
string func() {
  if (c > 1 || c == n) return s[0];
  long long sum = 0;
  int j = -1, counter = 0;
  for (int i = 0; i < n - 1; i++)
    if (a[i] == a[i + 1]) counter++, j = i;
  if (counter > 1) return s[0];
  if (counter == 1 && j > 0 && a[j - 1] + 1 == a[j]) return s[0];
  for (int i = 0; i < n; i++) sum += a[i];
  sum -= ((n * (n - 1)) / 2);
  if (sum % 2) return s[1];
  return s[0];
}
int main() {
  cin.tie(NULL);
  cout.tie(NULL);
  ios_base::sync_with_stdio(false);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++)
    if (a[i] == 0) c++;
  sort(a, a + n);
  cout << func();
  return 0;
}
