#include <string>
#include <iostream>
#include <algorithm>

// convert a string to a number
unsigned long long str2num(const std::string& x)
{
  // process string from left to right
  unsigned long long result = 0;
  for (auto c : x)
  {
      // shift digits
      result *= 10;
      // add new digit on the right-hand side
      result += c - '0'; // was ASCII
  }
  return result;
}

int main()
{
  // available digits
  std::string pan = "0123456789"; // unlike other problems, zero is allowed this time

  // remove a few digits if test case requires this
  unsigned int maxDigit;
  std::cin >> maxDigit;
  pan.erase(maxDigit + 1);

  // all divisors
  const unsigned int primes[] = { 2,3,5,7,11,13,17 };

  // result
  unsigned long long sum = 0;

  // look at all permutations
  do
  {
    // let's assume it's a great number ;-)
    bool ok = true;

    // check each 3-digit substring for divisibility
    for (unsigned int i = 0; i + 2 < maxDigit; i++)
    {
      // check pan[1..3] against primes[0],
      // check pan[2..4] against primes[1],
      // check pan[3..5] against primes[2] ...
      std::string check = pan.substr(i + 1, 3);
      if (str2num(check) % primes[i] != 0)
      {
        // nope ...
        ok = false;
        break;
      }
    }

    // passed all tests, it's great indeed !
    if (ok)
      sum += str2num(pan);
  } while (std::next_permutation(pan.begin(), pan.end()));

  std::cout << sum << std::endl;
  return 0;
1. }

from itertools import permutations
 
def Substring_Divisibility(n):
  ### This part takes so much time
  permStr = []
  for i in permutations(range(0,n+1)):
    s = ''.join(map(str,i)) 
    permStr.append(s)
  ### __________________
  
  total = 0
  for s in permStr:
    if len(s[1:4]) == 3: 
      if int(s[1:4])%2 == 0: pass
      else: continue
    else: 
      pass

    if len(s[2:5]) == 3: 
      if int(s[2:5])%3 == 0: pass
      else: continue
    else: 
      pass

    if len(s[3:6]) == 3: 
      if int(s[3:6])%5 == 0: pass
      else: continue
    else: 
      pass

    if len(s[4:7]) == 3: 
      if int(s[4:7])%7 == 0: pass
      else: continue
    else: 
      pass

    if len(s[5:8]) == 3: 
      if int(s[5:8])%11 == 0: pass
      else: continue
    else: 
      pass

    if len(s[6:9]) == 3: 
      if int(s[6:9])%13 == 0: pass
      else: continue
    else: 
      pass

    if len(s[7:10]) == 3: 
      if int(s[7:10])%17 == 0: pass
      else: continue
    else: 
      pass
      
    total += int(s)
      
  return total

if __name__ == '__main__':
  n = int(input())
  print(Substring_Divisibility(n))

#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define debug(x) cout << #x << " = " << x << endl
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
inline ll Mod(ll x, ll mod) { return x % mod >= 0 ? x % mod : x % mod + mod; }

ll sum[10] = {0};
int nums[] = {2, 3, 5, 7, 11, 13, 17};

bool is_strange(string s)
{
    int y = s.length();
    for (int i = 1; i <= y - 3; i++)
    {
        int p = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
        if (p % nums[i - 1] != 0)
            return 0;
    }
    return 1;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    string ss[] = {"0", "1", "2", "3", "4", "5", "6", "7", "8", "9"};
    string s = "012";
    for (int i = 3; i <= 9; i++)
    {
        s += ss[i];
        if (is_strange(s))
        {
            string p = s;
            if (s[0] == '0')
            {
                int y = s.length();
                p = s.substr(1, y - 1);
            }
            sum[i] += (stoll(p));
        }

        while (next_permutation(all(s)))
        {
            if (is_strange(s))
            {
                string p = s;
                if (s[0] == '0')
                {
                    int y = s.length();
                    p = s.substr(1, y - 1);
                }
                sum[i] += (stoll(p));
                //cout << p << " " << flush ;
            }
        }
    }
    int n;
    cin >> n;
    cout << sum[n];
}