#include<bits/stdc++.h>
using namespace std;
#define ll                long long
#define all(x)            (x).begin(),(x).end()
#define sz(x)             (ll)((x).size())
#define GCD(m,n)          __gcd(m,n)
#define LCM(m,n)          ((m*n)/GCD(m,n))
#define PI                3.141592653589793238462

//max element of a vector = *max_element (first_index, last_index);
// s.find_first_of('')

ll sign(ll x){
	return (x>0)-(x<0);
}

bool isPrime(int n)
{
    if (n <= 1)
        return false;
    for (int i = 2; i < n; i++)
        if (n % i == 0)
            return false;
    return true;
}


ll power(ll a,ll b,ll mod){
    if(b==0){
        return 1;
    }
    ll x=power(a,b/2,mod);
    x=(x*x)%mod;
    if(b%2){
        x=(x*a)%mod;
    }
    return x;
}

bool isPalindrome(string str){
	ll l = 0;
	ll h = str.length()-1;

	while(h>l){
		if(str[l++]!=str[h--]){
			return false;
		}
	}
	return true;
}


void kickstart(ll test){
	cout << "Case #" << test << ": ";
	cout << "\n";
}

ll gcd(ll x, ll y) {
	return y == 0 ? x : gcd(y, x % y);
}

float distance(int x1, int y1, int x2, int y2)
{
    return sqrt(pow(x2 - x1, 2) +
                pow(y2 - y1, 2) * 1.0);
}

bool isPerfectSquare(ll x)
{
    if (x >= 0) {
        ll sr = sqrt(x);
        return (sr * sr == x);
    }
    return false;
}
 

const ll MOD=1e9+7;

int main(){
	
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);

	string s;
	cin>>s;
	ll n = s.length();
	ll cnt = 0;
	for(ll i=n-1;i>=0;i--){
		if(s[i]=='0')
			cnt++;
		else
			break;
	}

	string s1 = s.substr(0,n-cnt);

	// for(ll i=0;i<cnt;i++){
	// 	s.insert(0,1,'0');
	// }

	// cout<<s1<<" ";

	if(isPalindrome(s1))
		cout<<"Yes";
	else
		cout<<"No";
	return 0;
}


#include<bits/stdc++.h>
using namespace std;
#define ll long long 
#define ld long double
#define MOD 998244353
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t--)
#define bi begin()
#define ei end()
#define fi first 
#define se second  
#define foe(i,a,b) for(ll i=a;i<b;i++)
#define rfoe(i,a,b) for(ll i=a;i>=0;i--)
#define sz(s) s.size() 
#define mem(a,s) memset(a,s,sizeof(a)) 
#define all(v) v.bi,v.ei
#define MAX             8000000000000000064LL
#define MIN            -8000000000000000064LL   

typedef pair<ll,ll> pii;

ll add(ll a, ll b){return (a%MOD + b%MOD + ((MAX)/MOD)*MOD)%MOD;}
ll sub(ll a, ll b){return (a%MOD - b%MOD + ((MAX)/MOD)*MOD)%MOD;}
ll mul(ll a, ll b){return ((a%MOD)*(b%MOD) + ((MAX)/MOD)*MOD)%MOD;}
long long binpow(long long a, long long b)
{
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = res*a;
        a = a*a;
        b >>= 1;
    }
    return res;
}
 bool prime[10000009]={false};
//     // set<ll>s1;
    void Sieve() 
    {  
        ll n=10000009;
        prime[0]=prime[1]=true;
        // s[0]=0;
        // s[1]=1;
        // s.pb(1);
        // t.insert(1);
        for (int p=2; p*p<=n; p++) 
        { 
        
        if(prime[p]==false)
        {
            //    s.pb(p);
            for(ll j=p*p;j<=n;j+=p)
            {
                prime[j]=true;
            }    
        }
        } 
        for(ll i=2;i<n;i++)
        {
            if(prime[i])
            {
                // s.pb(i);
                // s1.insert(i);
            }
        }
} 
ll lcm(ll a,ll b){return(a*b)/__gcd(a,b);}
ll fact[1000007 ]={0};
ll expo(ll x, ll y) {ll res=1;x=x%MOD;while(y>0){if(y&1)res=(1ll*res*x)%MOD;
y=y>>1;x=(1ll*x*x)%MOD;} return res;}
void facto() {fact[0]=1;fact[1]=1;for(ll i=2;i<1000007;i++)fact[i]=(fact[i-1]*i)%MOD;}
ll ncr(ll n,ll r) {ll res=1; res=fact[n]; res=(res*(expo(fact[r],MOD-2)))%MOD; res=(res*(expo(fact[n-r],MOD-2)))%MOD; return res;}
ll npr(ll n,ll r) {facto(); ll res=1; res=fact[n]; res=(res*(expo(fact[n-r],MOD-2)))%MOD; return res; }
int const N=5005;
ll const INF = 2e18+5;
ll dx[8]={0,0,1,-1,1,1,-1,-1};
ll dy[8]={1,-1,0,0,-1,1,-1,1};


void solve()
{
   ll x;
   cin>>x;
   x = x>=0 ? x:0;
   cout<<x<<"\n"; 
}

int main()
{
    fast
    // facto();
    // Sieve();
    // ct    
    { 
        solve();
    }
}