#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
bitset<9000> vis1[9000], vis2[9000], vis3[9000];
int l, r, ans, a[10005];
inline bool dfs(int x, int y)
{
  if (vis3[x][y])
    return 1;
  if (vis2[x][y])
    return vis1[x][y];
  if (!x || !y)
    return 0;
  vis2[x][y] = vis3[x][y] = 1;
  int x1 = x, y1 = y;
  if (x < y)
    x = a[x];
  else
    y = a[y];
  if (x < y)
    y -= x;
  else
    x -= y;
  vis1[x1][y1] = dfs(x, y);
  vis3[x1][y1] = 0;
  return vis1[x1][y1];
}
signed main()
{
#ifndef ONLINE_JUDGE
  freopen("data/data.in", "r", stdin);
  // freopen("data/data.out", "w", stdout);
#endif
  std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  for (int i = 1; i < 10000; i++)
  {
    string s = to_string(i);
    reverse(s.begin(), s.end());
    a[i] = stoi(s);
  }
  l = 5000, r = 5000;
  for (int i = 1; i <= l; i++)
    for (int j = 1; j <= r; j++)
      ans += dfs(i, j);
  cout << ans;
  exit(0);
}