Problem: Vitya is studying in the third grade. During the last math lesson all the pupils wrote on arithmetic quiz. Vitya is a clever boy, so he managed to finish all the tasks pretty fast and Oksana Fillipovna gave him a new one, that is much harder.

Let's denote a flip operation of an integer as follows: number is considered in decimal notation and then reverted. If there are any leading zeroes afterwards, they are thrown away. For example, if we flip 123 the result is the integer 321, but flipping 130 we obtain 31, and by flipping 31 we come to 13.

Oksana Fillipovna picked some number a without leading zeroes, and flipped it to get number ar. Then she summed a and ar, and told Vitya the resulting value n. His goal is to find any valid a.

As Oksana Fillipovna picked some small integers as a and ar, Vitya managed to find the answer pretty fast and became interested in finding some general algorithm to deal with this problem. Now, he wants you to write the program that for given n finds any a without leading zeroes, such that a + ar = n or determine that such a doesn't exist.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 10100 000).

Output

If there is no such positive integer a without leading zeroes that a + ar = n then print 0. Otherwise, print any valid a. If there are many possible answers, you are allowed to pick any.

Examples

Input

4


Output

2


Input

11


Output

10


Input

5


Output

0


Input

33


Output

21

Note

In the first sample 4 = 2 + 2, a = 2 is the only possibility.

In the second sample 11 = 10 + 1, a = 10 — the only valid solution. Note, that a = 01 is incorrect, because a can't have leading zeroes.

It's easy to check that there is no suitable a in the third sample.

In the fourth sample 33 = 30 + 3 = 12 + 21, so there are three possibilities for a: a = 30, a = 12, a = 21. Any of these is considered to be correct answer.

Solution (in JAVA):

Solution:

import java.util.Scanner;

public class Solution {

    static int[] A;

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String s = in.next();
        if (s.equals("1")) {
            System.out.println(0);
            return;
        }
        A = new int[s.length()];
        for (int i = 0; i < A.length; i++) {
            A[i] = s.charAt(i) - '0';
        }
        if (A[0] == 1) {
            int[] Atemp = A.clone();
            solution = new int[A.length];
            solution[0] = 0;
            if (isPossible(1, A.length - 1, true)) {
                printSolution();
                return;
            }
            A = Atemp;
        }
        solution = new int[A.length];
        if (isPossible(0, A.length - 1, false)) {
            printSolution();
        } else {
            System.out.println("0");
        }
    }

    static int[] solution;

    public static void printSolution() {
        boolean zeroes = true;
        for (int i = 0; i < solution.length; i++) {
            if (solution[i] != 0) {
                zeroes = false;
            }
            if (!zeroes) {
                System.out.print(solution[i]);
            }
        }
        System.out.println();

    }

    public static boolean isPossible(int front, int end, boolean carry1) {
        if (front + 1 == end) {
            if (!carry1) {
                solution[end] = A[front] / 2;
                solution[front] = A[front] - A[front] / 2;
                return A[front] == A[end];
            }
            if (carry1) {
                solution[end] = A[end] / 2 + 5;
                solution[front] = A[end] - A[end] / 2 + 5;
                return (A[front] - 1) == A[end];
            }
        } else if (front == end) {
            solution[front] = ((carry1 ? 10 : 0) + A[front]) / 2;
            return (A[front] % 2 == 0);
        } else {
            if (carry1 && A[end] != 9) {
                A[end - 1]--;
                int index = end - 1;
                while (index >= front && A[index] == -1) {
                    A[index] = 9;
                    index--;
                    A[index]--;
                }
                if (index < front) {
                    return false;
                }
            }
            if ((A[end] + 1) % 10 == A[front]) {
                if (A[end] == 9 && !carry1) {
                    return false;
                }
                solution[end] = A[end] / 2;
                solution[front] = A[end] - A[end] / 2;
                if (A[end] == 0 && front == 0) {
                    //System.out.println("ASAHAHJKAS");
                    return false;
                }
                if (carry1 && A[end] != 9) {
                    solution[end] += 5;
                    solution[front] += 5;
                }
                boolean weirdCase = false;
                /*if(A[front]==0){
                 weirdCase = true;
                 }*/
                //System.out.println(A[2] + " " + A[3]);
                return isPossible(front + 1, end - 1, !weirdCase);
            } else if (A[front] == A[end]) {
                solution[end] = A[end] / 2;
                solution[front] = A[end] - A[end] / 2;
                if (carry1) {
                    solution[end] += 5;
                    solution[front] += 5;
                }
                return isPossible(front + 1, end - 1, false);
            } else {
                return false;
            }
        }
        return false;
    }

}