#include <bits/stdc++.h>
using namespace std;
int num[100010];
int num1[100010];
int a[100010];
int main() {
  int n;
  cin >> n;
  int flag = 0;
  for (int i = 1; i <= n; i++) {
    cin >> num[i];
    num1[i] = num[i];
  }
  sort(num + 1, num + n + 1);
  sort(num1 + 1, num1 + n + 1);
  int tim = 0;
  for (int i = 1; i < n; i++) {
    int t = num[i + 1] - num[i];
    if (t == 0) tim++;
  }
  if (tim >= 2) flag = 1;
  for (int i = 1; i < n; i++) {
    if (num1[i] == num1[i + 1]) {
      num1[i]--;
      break;
    }
  }
  sort(num1 + 1, num1 + n + 1);
  for (int i = 1; i < n; i++) {
    if (num1[i] == num1[i + 1] || num1[i] == -1) {
      flag = 1;
      break;
    }
  }
  if (flag == 1)
    cout << "cslnb" << endl;
  else {
    long long sum = 0;
    for (int i = 1; i <= n; i++) sum += num[i];
    long long s = n * (n - 1) / 2;
    if ((sum - s) % 2 == 0)
      cout << "cslnb" << endl;
    else
      cout << "sjfnb" << endl;
  }
  return 0;
}
