#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool read(T &ret) {
  char c;
  int sgn;
  if (c = getchar(), c == EOF) return false;
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  sgn = (c == '-') ? -1 : 1;
  ret = (c == '-') ? 0 : (c - '0');
  while (c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + (c - '0');
  ret *= sgn;
  return true;
}
template <class T>
inline void output(T answer) {
  if (answer < 0) {
    putchar('-');
    answer = -answer;
  }
  if (answer >= 10) output(answer / 10);
  putchar(answer % 10 + '0');
  return;
}
inline long long qmul(long long, long long, long long);
inline long long qpow_qmul(long long, long long, long long);
inline long long mul(long long, long long, long long);
inline long long qpow(long long, long long, long long);
inline long long gcd(long long, long long);
inline long long qpow_mul(long long, long long, long long);
const int N = 1e5 + 5;
const int M = 65;
const long long INF = 1e9 + 7;
const long long mod = 1e9 + 7;
const double PI = acos(-1.0);
const double esp = 1e-7;
const int MAXN = 1e5 + 5;
long long a[N], num[N];
map<long long, int> book;
int main() {
  int n, flag = 0, cnt = 0, zero = 0;
  scanf("%d", &n);
  book.clear();
  for (int i = 1; i <= n; i++) {
    scanf("%I64d", &a[i]);
    book[a[i]]++;
    zero += (a[i] == 0);
    if (book[a[i]] > 2) flag = 1;
  }
  if (zero >= 2) {
    printf("cslnb\n");
    return 0;
  }
  if (n == 2) {
    if (a[1] == a[2] && a[1] == 0) {
      printf("cslnb\n");
      return 0;
    }
  }
  if (n == 1) {
    if (a[1] & 1)
      printf("sjfnb\n");
    else
      printf("cslnb\n");
  } else {
    if (flag)
      printf("cslnb\n");
    else {
      long long v, sum = 0;
      for (map<long long, int>::iterator it = book.begin(); it != book.end();
           it++) {
        if (it->second == 2) v = it->first, cnt++;
      }
      if (cnt > 1)
        printf("cslnb\n");
      else {
        if (cnt == 1) {
          if (v == 0) {
            printf("cslnb\n");
            return 0;
          }
          if (book[v - 1] >= 1)
            printf("cslnb\n");
          else {
            book[v - 1]++;
            book[v]--;
            sum++;
            int tot = 0;
            for (map<long long, int>::iterator it = book.begin();
                 it != book.end(); it++) {
              for (int j = 1; j <= it->second; j++) num[++tot] = it->first;
            }
            long long init = 0;
            for (int i = 1; i <= tot; i++) {
              sum += num[i] - init;
              init++;
            }
            if (sum & 1)
              printf("sjfnb\n");
            else
              printf("cslnb\n");
          }
        } else {
          int tot = 0;
          for (map<long long, int>::iterator it = book.begin();
               it != book.end(); it++) {
            for (int j = 1; j <= it->second; j++) num[++tot] = it->first;
          }
          long long init = 0;
          for (int i = 1; i <= tot; i++) {
            sum += num[i] - init;
            init++;
          }
          if (sum & 1)
            printf("sjfnb\n");
          else
            printf("cslnb\n");
        }
      }
    }
  }
  return 0;
}
inline long long mul(long long a, long long b, long long mod) {
  long long L = a * (b >> 25ll) % mod * (1ll << 25) % mod;
  long long R = a * (b & ((1ll << 25) - 1)) % mod;
  return (L + R) % mod;
}
inline long long qpow_mul(long long x, long long n, long long mod) {
  long long ans = 1, a = x % mod;
  while (n) {
    if (n & 1) {
      ans = mul(ans, a, mod);
    }
    a = mul(a, a, mod);
    n >>= 1;
  }
  return ans;
}
inline long long qmul(long long a, long long b, long long mod) {
  long long ans = 0, x = a;
  while (b) {
    if (b & 1) {
      ans = (ans + x % mod) % mod;
    }
    x = x * 2 % mod;
    b >>= 1;
  }
  return ans % mod;
}
inline long long qpow_qmul(long long x, long long n, long long mod) {
  long long ans = 1, a = x % mod;
  while (n) {
    if (n & 1) {
      ans = qmul(ans, a, mod);
    }
    a = qmul(a, a, mod);
    n >>= 1;
  }
  return ans;
}
inline long long qpow(long long x, long long n, long long mod) {
  long long ans = 1, a = x;
  while (n) {
    if (n & 1) {
      ans = ans * a % mod;
    }
    a = a * a % mod;
    n >>= 1;
  }
  return ans;
}
inline long long gcd(long long m, long long n) {
  return n == 0 ? m : gcd(n, m % n);
}
