// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

LL D;
vector<LL> A;
LL sum[20];

LL dfs(int cur, LL val)
{
    if (cur < 0) {
        return (val == 0);
    }
    if (val > sum[cur+1] * 9 || val < -sum[cur+1] * 9)
        return 0;

    LL ret = 0;
    for (int i = 0; i <= 9; ++i) {
        int t = 9 - i + (cur != SZ(A) - 1);
        // printf("i=%d\n", i);
        ret += dfs(cur - 1, val - A[cur] * i) * t;
    }
    for (int i = 1; i <= 9; ++i) {
        int t = 10 - i;
        ret += dfs(cur - 1, val + A[cur] * i) * t;
    }
    return ret;
}

void solve()
{
    LL pow10[19];
    pow10[0] = 1;
    for (int i = 1; i < 19; ++i) {
        pow10[i] = pow10[i-1] * 10;
    }

    LL ans = 0;

    for (int d = 2; d <= 18; ++d) {
        A.clear();
        for (int j = d - 1, k = 0; j > k; --j, ++k) {
            A.push_back(pow10[j] - pow10[k]);
        }
        std::reverse(ALL(A));
        sum[0] = 0;
        for (int i = 0; i < SZ(A); ++i) {
            sum[i+1] = sum[i] + A[i];
        }

        LL cur = dfs(SZ(A) - 1, D);
        if (d & 1) cur *= 10;
        // printf("%d: %lld\n", d, cur);
        ans += cur;
    }

    printf("%lld\n", ans);
}

int main()
{
#ifdef __DEBUG
    freopen("F.in", "r", stdin);
    freopen("F.out", "w", stdout);
#endif

    read(D);
    solve();

    return 0;
}

// 塞翁失马，焉知非福。


Measured memory_bytes: 256