#include <bits/stdc++.h>
using namespace std;
int sg(long long x) {
  if (x % 2 == 0)
    return 0;
  else
    return 1;
}
long long arr[100005];
int main() {
  int n, cnt = 0, ans = 0;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> arr[i];
  sort(arr + 1, arr + 1 + n);
  for (int i = 2; i <= n; i++)
    if (arr[i] == arr[i - 1]) {
      cnt++;
      arr[i - 1]--;
      if (arr[i - 1] < 0) cnt++;
      if (i > 2 && arr[i - 1] == arr[i - 2]) cnt++;
    }
  for (int i = 2; i <= n; i++)
    if (((i & 1) && (n & 1)) || (!(i & 1) && !(n & 1)))
      ans ^= sg(arr[i] - arr[i - 1] - 1);
  if (n & 1) ans ^= sg(arr[1]);
  if (cnt == 1)
    if (ans)
      ans = 0;
    else
      ans = 1;
  if (cnt >= 2)
    printf("cslnb\n");
  else if (!ans)
    printf("cslnb\n");
  else
    printf("sjfnb\n");
  return 0;
}
