#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
namespace mydef {
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
bool dbg = false;
}  // namespace mydef
using namespace mydef;
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define pi pair<int, int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define asn ans

template <typename T>
//pair<vector<T>, vector<int>> dijkstra(int s, vector<vector<pair<int, T>>>& G) {
vector<T> dijkstra(int s, vector<vector<pair<int, T>>>& G) {
    const T INF = numeric_limits<T>::max();
    using P = pair<T, int>;
    int N = G.size();
    vector<T> dist(N, INF);
    //vector<int> bef(N, -1);
    priority_queue<P, vector<P>, greater<P>> que;
    dist[s] = 0;
    que.emplace(dist[s], s);
    while (!que.empty()) {
        P p = que.top();
        que.pop();
        int now = p.second;
        if (dist[now] < p.first)
            continue;
        for (auto& p : G[now]) {
            int nxt = p.first;
            T cost = p.second;
            if (dist[nxt] > dist[now] + cost) {
                dist[nxt] = dist[now] + cost;
                //bef[nxt] = now;
                que.emplace(dist[nxt], nxt);
            }
        }
    }
    return dist;
    //return make_pair(dist, bef);
}

int K;
vvp G;

void solve() {
    G.resize(K);
    for (int i = 0; i < K; i++) {
        G[i].push_back({(i + 1) % K, 1});
        G[i].push_back({(i * 10) % K, 0});
    }
    auto v = dijkstra(1, G);
    cout << v[0] + 1 << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    cin >> K;

    solve();
    return 0;
}


Measured memory_bytes: 12088