#include <bits/stdc++.h>
using namespace std;
struct comp {
  bool operator()(int a, int b) { return a > b; }
};
int main() {
  int n, val;
  vector<int> data;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &val);
    data.push_back(val);
  }
  sort(data.begin(), data.end());
  int eqCount = 0;
  bool valid = true;
  for (int i = 0; i <= n - 2; i++)
    if (data[i] == data[i + 1]) {
      eqCount++;
      if (eqCount > 1 || data[i] == 0 || (i > 0 && data[i] - 1 == data[i - 1]))
        valid = false;
    }
  if (valid) {
    long long maxMove = 0;
    for (int i = 0; i <= n - 1; i++) maxMove += data[i] - i;
    if (maxMove % 2 == 0)
      printf("cslnb\n");
    else
      printf("sjfnb\n");
  } else {
    printf("cslnb\n");
  }
  return 0;
}
