/*
TASK: N23
LANG: C++
*/

/*#include <iostream>
#include <string>
#include <cmath>

 using namespace std;

 int main(){
    long long t;
    int a[20], s, k1;
    cin >> k1; k1 = pow((double)2, k1);
    for(t = k1; ; t+=k1){
        long long k = t; s = 0;
        //cout << k << '\n';
        while( k > 0 ){
            a[s++] = k%10;
            k /= 10;
        }
        //for(int i = 0; i < s; ++i) cout << a[i];
        bool f = true;
        for(int i = 0; i < s; ++i){
            if( a[i] != 2 && a[i] != 3 )
                f = false;
        }
        if( f ){ cout << t << '\n'; break; }
    }
    return 0;
 }
*/

#include <iostream>
 
 using namespace std;

 int main(){
    long long t[] = {2, 32, 32, 32, 32, 23232, 223232, 223232, 223232, 223232, 223232, 32223232};
    int n; cin >> n;
    if( n-1 <= 11 ) cout << t[n-1] << '\n';
    else cout << "NO\n";
    return 0;
 }
