#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, a[N], t[N], w = 1, sum = 1, all;
long long tot, val;
bool check;
int main() {
  scanf("%d", &n);
  for (register int i = 1; i <= n; i++) scanf("%d", &a[i]), tot += a[i];
  sort(a + 1, a + n + 1);
  for (register int i = 1; i <= n; i++) t[i] = a[i];
  for (register int i = 2; i <= n; i++)
    if (t[i] - t[i - 1]) t[++w] = t[i];
  if (!tot) {
    printf("cslnb\n");
    return 0;
  }
  for (register int i = 2; i <= n; i++) {
    if (a[i] == a[i - 1]) {
      sum++;
      if (sum == 2) {
        if (all) {
          printf("cslnb\n");
          return 0;
        } else if (!a[i]) {
          printf("cslnb\n");
          return 0;
        } else {
          int pos = lower_bound(t + 1, t + w + 1, a[i]) - t;
          if (pos != 1) {
            if (t[pos - 1] + 1 == a[i]) {
              printf("cslnb\n");
              return 0;
            }
          }
        }
      }
      if (sum == 3) {
        printf("cslnb\n");
        return 0;
      }
    } else if (sum != 1)
      all++, sum = 1;
  }
  for (register int i = 1; i < n; i++)
    if (a[i] == a[i + 1]) {
      a[i]--;
      check = true;
      break;
    }
  for (register int i = 1; i <= n; i++) val += a[i] - (i - 1);
  val += check;
  if (val & 1)
    printf("sjfnb\n");
  else
    printf("cslnb\n");
  return 0;
}
