#include<iostream>
#include<stdio.h>
#include<bitset>
#include<vector>
#include<math.h>
#define N 10000000
using namespace std;
bitset <N> bits ;
int primes[N]	;
void precomputation(){
    for(int i = 2; i < N; i += 2)	primes[i] = 2 ;
	int sq=sqrt(N-1);
    for(int i = 3; i < N; i += 2)
            if (!bits[i]){
                primes[i] = i   ;
                if(i<=sq) for(int j = i * i; j < N; j += 2 * i)
                    if (!bits[j]){
                        primes[j] = i ;
                        bits[j] = 1 ;
                        
                    }
            }
    cout << "success" << endl	;
}

/*long long int exponent (int base, int exp){
    long long int res;
    if (exp == 0)
        return 1;
    res = exponent(base, exp/2) ;
    if (exp%2 == 0)
        return (res * res);
    return (base * res * res) ;
}


long long int factor (long long int n)  {
    long long res = 1  ;
    int count;
    while(n > 1){
        count = 0   ;
        int i = primes[n]    ;
        while(n % i == 0){
            n /= i  ;
            count++ ;
        }
        res *= (exponent(i, count+1) - 1)  / (i - 1)  ;
        cout << endl	;
    }
    return res  ;
}*/
int main(){

    ios_base::sync_with_stdio(false)    ;   cin.tie(0)  ;
    precomputation()    ;
    cout << "success" << endl	;
    
    
    /*int t;
    long long int   n   ;
    cin >> t    ;
    while(t--){
        cin >> n    ;
        //cout <<  factor(n) - n  << "\n";
    }*/
    return 0    ;
}