#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define pll pair<ll,ll>
#define rep(i,n) for(ll i=0;i<n;i++)
#define mod 1000000007
#define INF 10000000000000000
#define F first
#define S second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pie 3.141592653589793238462643383279
#define PYES cout<<"YES"<<endl
#define PNO cout<<"NO"<<endl
#define SB(a) sort(a.begin(),a.end(),greater<int>());
#define SS(a) sort(a.begin(),a.end());
#define vll vector<ll>
#define vpll vector<pll> 
vector<bool> prime;
vector<ll> fact,inv,primes,factors;
void fast()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
}
void factorize(ll a)
{
	factors.clear();
	for(ll i=1;i*i<=a;i++)
	{
		if (i*i==a) factors.pb(i);
		else if (a%i==0)
		{
			factors.pb(i);
			factors.pb(a/i);
		}
	}
	sort(factors.begin(),factors.end());
}
ll power(ll a,ll b)
{
	if(a==1||b==0)	return 1;
	ll c=power(a,b/2);
	ll res=1;
	res=c*c;
	if(res>=mod)	res%=mod;
	if(b%2)	res*=a;
	if(res>=mod)	res%=mod;
	return res;
}
ll modInv(int a)
{
	return power(a,mod-2);
}
void factorial(ll n)
{
	fact.resize(n+1);
	fact[0]=1;
	for(ll i=1;i<=n;i++)
	{
		fact[i]=fact[i-1]*i;
		if(fact[i]>=mod)	fact[i]%=mod;
	}
}
void InvFactorial(ll n)
{
	inv.resize(n+1);
	inv[0]=1;
	for(ll i=1;i<=n;i++)	inv[i]=modInv(fact[i]);
}
ll ncr(ll n,ll r)
{
	if(n<r||n<0||r<0)	return 0;
	ll b=inv[n-r];
	ll c=inv[r];
	ll a=fact[n]*b;
	if(a>=mod)	a%=mod;
	a*=c;
	if(a>=mod)	a%=mod;
	return a;
}
void remove_duplicates(vector<pair<ll,ll> > &v)
{
	sort(v.begin(),v.end());
	ll _size=unique(v.begin(),v.end())-v.begin();
	v.resize(_size);
}
unsigned ll gcd(unsigned ll u, unsigned ll v)
{
    if(u==0||v==0) return max(u,v);
    unsigned ll shift=__builtin_ctz(u|v);
	u>>=__builtin_ctz(u);
    do{
    	v>>=__builtin_ctz(v);
    	if(u>v)	swap(u,v);
    	v-=u;
    }while(v!=0);
    return u<<shift;
}
void sieve(int n)
{
    prime.assign(n+1,1);
	prime[1]=false;
    for(ll p=2;p*p<=n;p++) if(prime[p])	for(ll i=p*p;i<=n;i+=p)	prime[i]=false;
    for(ll i=2;i<n+1;i++) if(prime[i]) primes.push_back(i);
}
ll size(ll l)
{
	ll p=l;
	ll count=0;
	while(p) p/=10,count++;
	return count;
}
//--------------------------------------------------------------------------------------------------------------------------------------------------
// Always remember: if (condition) if (condition) statement; This doesn't work !!
// Always increase boundaries for global or frequency questions
// pow((int)10,i) doesn't work sometimes. It is better to use multiple of 10 in arrays. Always remember this.
// delete values when defining global if there are multiple testcases
// don't try to be smart and make stupid mistakes
void solve()
{
	ll n;
	cin>>n;
	vll a(n);
	a[0]=10;
	a[1]=15;
	a[2]=6;
	ll p=20,q=45;
	ll b=2;
	for(ll i=3;i<n;i++)
	{
		if (b==2)
		{
			if ((i-1)*6<=10000) a[i]=(i-1)*6;
			else b=1;
		}
		if (b==1)
		{
			if (p<=10000)
			{
				if (p%3) a[i]+=p,p+=10;
				else a[i]+=p+10,p+=20;
			}
			else b=0;
		}
		if (b==0)
		{
			a[i]=q,q+=30;
		}
	}
	for(auto &i: a) cout<<i<<' '; 
}
signed main()
{
	fast();
	ll T=1;
	//cin>>T;
	for(ll i=1;i<=T;i++) solve();
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve()
{
    int n;
    cin>>n;
    string s=to_string(n);
    string t=s;
    reverse(t.begin(),t.end());
    if(s==t)
        cout<<"Yes\n";
    else{
        int count=0;
        for(int i=0;i<t.length();i++){
            if(t[i]=='0')
                count++;
            else
                break;
        }
        for(int i=0;i<count;i++){
            t+='0';
        }
        string p=t;
        reverse(p.begin(),p.end());
        if(p==t)
            cout<<"Yes\n";
        else
            cout<<"No\n";
    }
}
int main()
{
    ios::sync_with_stdio(0);
	cin.tie(0);
    solve();
    return 0;
}
