void SelectSort(int a[],int n) {
int i,j,k,t;
for(j = 0; j <= n - 2; j++) { /*选择法排序*/
k = j;
for(i = j + 1;i < n; i++)
if(a[k] < a[i])k = i;
if(k != j) {
t = a[k];
a[k] = a[i];
a[i] = t;
}
}
}#include
using namespace std;
void main() {
int n,m = 0;
cin >> n;
int k = n;
while(k) {
m = 10 * m + k%10; //计算倒读的数m
k = k/10;
}
if(m == n)cout << "YES" << endl;
else cout << "NO" << endl;
}