/*
СТРОИМ СТЕНУ РАБОТЯГИ!
█▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄█
*/
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
    
     
     
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
/** Interface */
     
inline int readChar();
template <class T = int> inline T readInt(); 
template <class T> inline void writeInt( T x, char end = 0 );
inline void writeChar( int x ); 
inline void writeWord( const char *s );
     
/** Read */
     
static const int buf_size = 4096;
     
inline int getChar() {
    static char buf[buf_size];
    static int len = 0, pos = 0;
    if (pos == len) {
        pos = 0, len = fread(buf, 1, buf_size, stdin);
    }
    if (pos == len) {
        return -1;
    }
    return buf[pos++];
}
     
inline int readChar() {
    int c = getChar();
    while (c <= 32) {
        c = getChar();
    }
    return c;
}
     
template <class T>
inline T readInt() {
    int s = 1, c = readChar();
    T x = 0;
    if (c == '-')
        s = -1, c = getChar();
    while ('0' <= c && c <= '9')
        x = x * 10 + c - '0', c = getChar();
    return s == 1 ? x : -x;
}
     
/** Write */
     
static int write_pos = 0;
static char write_buf[buf_size];
     
inline void writeChar( int x ) {
    if (write_pos == buf_size)
        fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
    write_buf[write_pos++] = x;
}
     
template <class T> 
inline void writeInt( T x, char end ) {
    if (x < 0)
        writeChar('-'), x = -x;
     
    char s[24];
    int n = 0;
    while (x || !n)
        s[n++] = '0' + x % 10, x /= 10;
    while (n--)
        writeChar(s[n]);
    if (end)
        writeChar(end);
}
     
inline void writeWord( const char *s ) {     while (*s)
writeChar(*s++); }
     
struct Flusher {
    ~Flusher() {
        if (write_pos)
            fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
    }
} flusher;
   
   
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define next next228
#define rank rank228
#define prev prev228


string d;
bool needper[19];
int c[19];
long long dp[19][10][10][2][2];


int main() {
    cin >> d;
    reverse(all(d));
    long long ans = 0;
    for (int len = sz(d); len <= 19; len++) {
        for (int i = 0; i < len; i++) {
            c[i] = (i < sz(d) ? d[i] - '0': 0);
            for (int t = 0; t < 2; t++) {
                for (int t1 = 0; t1 < 2; t1++) {
                    for (int j = 0; j < 10; j++) {
                        for (int j1 = 0; j1 < 10; j1++) {
                            dp[i][j][j1][t][t1] = 0;
                        }
                    }
                }
            }
        }
        for (int i = 0; i < len / 2; i++) {
            for (int t = 0; t < 2; t++) {
                for (int t1 = 0; t1 < 2; t1++) {
                    if (i == 0) {
                        for (int j = 0; j < 10; j++) {
                            for (int j1 = 0; j1 < 10; j1++) {
                                dp[i][j][j1][t][t1] = 0;
                                if (i == 0 && (j == 0 || j1 == 0)) {
                                    continue;
                                }
                                if (t != 0) {
                                    continue;
                                }
                                if (j1 + c[len - i - 1] + t1 >= 10) {
                                    continue;
                                }
                                if ((j + c[i]) % 10 == j1 && (j1 + c[len - i - 1] + t1) % 10 == j) {
                                    dp[i][j][j1][t][t1]++;
                                }
                            }
                        }
                    } else {
                        for (int j = 0; j < 10; j++) {
                            for (int j1 = 0; j1 < 10; j1++) {
                                dp[i][j][j1][t][t1] = 0;
                                if ((j + c[i] + t) % 10 == j1 && (j1 + c[len - i - 1] + t1) % 10 == j) {
                                    int t2 = (j1 + c[len - i - 1] + t1) >= 10;
                                    for (int j2 = 0; j2 < 10; j2++) {
                                        for (int j3 = 0; j3 < 10; j3++) {
                                            for (int tprev = 0; tprev < 2; tprev++) {
                                                if (t) {
                                                    if (j2 + c[i - 1] + tprev >= 10) {
                                                        dp[i][j][j1][t][t1] += dp[i - 1][j2][j3][tprev][t2];
                                                    }
                                                } else {
                                                    if (j2 + c[i - 1] + tprev < 10) {
                                                        dp[i][j][j1][t][t1] += dp[i - 1][j2][j3][tprev][t2];
                                                    }
                                                }
                                            }
                                        }
                                    }
                                }
                            }
                        }
                    }
                }
            }
            if (len & 1) {
                if (len == 1) {
                    continue;
                }
                int i = len / 2 - 1;
                for (int t = 0; t < 2; t++) {
                    for (int t1 = 0; t1 < 2; t1++) {
                        for (int j = 0; j < 10; j++) {
                            for (int j1 = 0; j1 < 10; j1++) {
                                for (int ce = 0; ce < 10; ce++) {
                                    if (((int)((t + j + c[i]) >= 10) + ce + c[len / 2]) % 10 == ce) {
                                        int st = ((int)((t + j + c[i]) >= 10) + ce + c[len / 2]) >= 10;
                                        if (st && t1) { 
                                            ans += dp[i][j][j1][t][t1];
                                        }  else {
                                            if (!st && !t1) {
                                                ans += dp[i][j][j1][t][t1];
                                            }
                                        }
                                    }
                                }
                            }
                        }
                    }
                }
            } else {
                int i = len / 2 - 1;
                for (int t = 0; t < 2; t++) {
                    for (int t1 = 0; t1 < 2; t1++) {
                        for (int j = 0; j < 10; j++) {
                            for (int j1 = 0; j1 < 10; j1++) {
                                int tp = (j + c[i] + t) >= 10;
                                if (tp && !t1) {
                                    continue;
                                }
                                if (!tp && t1) {
                                    continue;
                                }
                                ans += dp[i][j][j1][t][t1];
                            }
                        }
                    }
                }
            }
        }  
    }
    cout << ans << endl;
    return 0;
}


Measured memory_bytes: 256