#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  const int mod = 998244353;
  string s;
  cin >> s;
  const int siz = 900000;
  long long ans = 0;
  for (auto c : s) ans = (ans * 10 + c - '0') % mod;
  ans = (ans + 1) % mod;
  vector<long long> p9(siz);
  p9[0] = 1;
  for (int i = 0; i < siz - 1; ++i) p9[i + 1] = p9[i] * 9 % mod;
  int flag = 1, k = s.size() - 1;
  for (char c : s)
  {
    if (c == '8')
    {
      flag = 0;
      ans = (ans - p9[k] * 8) % mod;      
      break;
    }
    else
    {
      ans = (ans - p9[k] * min(c - '0', 8)) % mod;
    }
    --k;
  }
  ans = (ans + mod - flag) % mod;
  cout << ans << endl;
}