。
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <algorithm>
#include <sstream>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
using namespace std;
typedef long long ll;
const int maxn = 100 + 7, INF = 0x7f7f7f7f, mod = 1e9 + 7;
char s[maxn];
int main() {
scanf("%s", &s);
int n = strlen(s);
n--;
while(s[n] == '0' && n) n--;
for(int i = 0, j = n; i <= j; ++i, --j) {
if(s[i] != s[j]) return 0*puts("NO");
}
return 0*puts("YES");
}