Problem:
Score : 800 points

Problem Statement

For a positive integer n, we denote the integer obtained by reversing the decimal notation of n (without leading zeroes) by rev(n). For example, rev(123) = 321 and rev(4000) = 4.

You are given a positive integer D. How many positive integers N satisfy rev(N) = N + D?

Constraints

D is an integer.

1 ≤ D < 10^9

Input

Input is given from Standard Input in the following format:

D

Output

Print the number of the positive integers N such that rev(N) = N + D.

Sample Input 1

63

Sample Output 1

2

There are two positive integers N such that rev(N) = N + 63: N = 18 and 29.

Sample Input 2

75

Sample Output 2

0

There are no positive integers N such that rev(N) = N + 75.

Sample Input 3

864197532

Sample Output 3

1920

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		FastScanner in = new FastScanner(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskF solver = new TaskF();
		solver.solve(1, in, out);
		out.close();
	}

	static class TaskF {
		int MAX_LEN;
		int[] a;
		int[] d;
		int[] sum;
		int ans;

		public void solve(int testNumber, FastScanner in, PrintWriter out) {
			char[] dc = in.next().toCharArray();
			MAX_LEN = dc.length + 3;
			ans = 0;
			a = new int[MAX_LEN];
			d = new int[MAX_LEN];
			sum = new int[MAX_LEN];
			for (int i = 0; i < dc.length; i++) {
				d[i] = dc[dc.length - i - 1] - '0';
			}
			Arrays.fill(a, -1);
			for (int len = Math.max(1, dc.length - 2); len < MAX_LEN; len++) {
				rec(0, 0, len);
			}
			out.println(ans);
		}

		private void rec(int i, int c, int n) {
			if (i == n) {
				if (c != 0) {
					return;
				}
				int carry = 0;
				Arrays.fill(sum, 0);
				for (int j = 0; j < MAX_LEN; j++) {
					int x = a[j] < 0 ? 0 : a[j];
					sum[j] = (x + d[j] + carry) % 10;
					carry = (x + d[j] + carry) / 10;
				}
				boolean ok = (carry == 0);
				for (int j = n; j < MAX_LEN && ok; j++) {
					if (sum[j] != 0) {
						ok = false;
					}
				}
				if (a[n - 1] == 0) {
					ok = false;
				}
				for (int j = 0; j < n && ok; j++) {
					if (a[j] < 0) {
						throw new AssertionError();
					}
					if (sum[j] != a[n - 1 - j]) {
						ok = false;
					}
				}
				if (ok) {
					++ans;
				}
				return;
			}
			int l = 0;
			int r = 9;
			if (a[i] >= 0) {
				l = a[i];
				r = a[i];
			}
			if (i == n - 1) {
				l = Math.max(l, 1);
			}
			for (int v = l; v <= r; v++) {
				a[i] = v;
				int x = (a[i] + d[i] + c) % 10;
				int y = (a[i] + d[i] + c) / 10;
				int old = a[n - i - 1];
				if (old < 0 || old == x) {
					a[n - i - 1] = x;
					rec(i + 1, y, n);
					a[n - i - 1] = old;
				}
				a[i] = -1;
			}
		}

	}

	static class FastScanner {
		private BufferedReader in;
		private StringTokenizer st;

		public FastScanner(InputStream stream) {
			in = new BufferedReader(new InputStreamReader(stream));
		}

		public String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					String rl = in.readLine();
					if (rl == null) {
						return null;
					}
					st = new StringTokenizer(rl);
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return st.nextToken();
		}

	}
}