class Solution {

 public:

     bool isPalindrome(int x) {

         int result = ;

         int y = x;

         if(x ==  || x < )

         {

             return false;

         }

         if(abs(x) < )

         {

            while(x != )

            {

               result = result *  + x % ;

               x = x / ;

            }

        }

        else

        {

            int a[] = {,,,,,,,,,};

            int i = ;

            int flag = abs(x);

            while(flag != )

            {

                if((flag % ) > a[i])

                {

                     return ;

                }

                else if((flag % ) < a[i])

                {

                    while(x != )

                    {

                        result = result *  + x % ;

                        x = x / ;

                    }

                    if(result == y)

                    {

                         return true;

                    }

               }

               flag /= ;

               i++;

             }

         }

         if(result == y)

         {

             return true;

         }

         return false;

     }

 };