#include <iostream>

 #include <algorithm>

 #include <cstring>

 #include <cstdio>

 #include <cmath>

 #include <stack>

 #include <map>

 #include <queue>

 using namespace std;

 inline void solve(int n)

 {

     int temp1[], temp2[];

     for (int i = ; i <= ; ++ i)

     {

         int j = , temp = i, my_sum = ;

         while(temp)

         {

             temp1[j ++] = temp % ;

             my_sum += temp % ;

             temp /= ;

         }

         if (my_sum == n)

         {

             bool flag = true;

             for (int k = ; k <= j / ; ++ k)

             {

                 if (temp1[k] != temp1[j -  - k])

                 {

                     flag = false;

                     break;

                 }

             }

             if (flag) printf("%d\n", i);

         }

     }

     return ;

 }

 int main()

 {

     int n;

     scanf("%lld", &n);

     solve(n);

     return ;

 }