#include <iostream>

#include <cstdio>

#include <fstream>

#include <algorithm>

#include <cmath>

#include <deque>

#include <vector>

#include <queue>

#include <string>

#include <cstring>

#include <map>

#include <stack>

#include <set>

#define LL long long

#define ULL unsigned long long

#define rep(i,j,k) for(int i=j;i<=k;i++)

#define dep(i,j,k) for(int i=k;i>=j;i--)

#define INF 0x3f3f3f3f

#define mem(i,j) memset(i,j,sizeof(i))

#define make(i,j) make_pair(i,j)

#define pb push_back

#define Pi acos(-1.0)

using namespace std;

const int N = 2e5 + ;

LL a[N];

int main() {

        int n;

        scanf("%d", &n);

        LL sum = ;

        rep(i, , n) scanf("%I64d", &a[i]), sum += a[i];

        if(n == ){

            if(a[] %  == ) puts("cslnb");

            else puts("sjfnb"); return ;

        }

        sort(a + , a +  + n);

        int cnt = ;

        rep(i, , n) {

            if(a[i] == a[i - ]) {

                cnt++;

                if(i >  && a[i - ] +  == a[i]) {

                    puts("cslnb"); return ;

                }

            }

        }

        if(cnt >=  || n >=  && a[] == ) {

                puts("cslnb"); return ;

        }

        sum -= n * (n - ) / ; ///0 + 1 + 2 + 3 + ……+ （n - 1） = n * ( n - 1) / 2;

        if(sum %  == ) {

            puts("cslnb");

        }

        else {

            puts("sjfnb");

        }

        return ;

}