#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }



template<class T> struct Edge {
    int from, to;
    T cost;
    Edge(int f, int t, T c) : from(f), to(t), cost(c) {}
    friend bool operator < (const Edge &e1, const Edge &e2) {return e1.cost < e2.cost;}
    friend bool operator > (const Edge &e1, const Edge &e2) {return e1.cost > e2.cost;}
    friend ostream& operator << (ostream& s, const Edge<T>& E) {
        return s << E.from << "->" << E.to << '(' << E.cost << ')';
    }
};

const int MAX_V = 210000;
template<class T> struct Graph {
    int V;
    vector<Edge<T> > list[MAX_V];
    
    Graph(int n = 0) : V(n) {}
    void init(int n = 0) {V = n; for (int i = 0; i < MAX_V; ++i) list[i].clear();}
    inline vector<Edge<T> >& operator [] (int i) {return list[i];}
    
    void direct(int f, int t, T c) {
        list[f].push_back(Edge<T>(f,t,c));
    }
    
    friend ostream& operator << (ostream& s, const Graph& G) {
        s << endl; for (int i = 0; i < G.V; ++i) {s << i << " : " << G.list[i] << endl;}return s;
    }
};

Graph<int> G;





int K;
const int INF = 1<<29;
int dp[MAX_V];

int solve() {
    if (K == 1) return 1;
    
    G.init(MAX_V);
    for (int i = 1; i < K; ++i) {
        for (int j = 0; j <= 9; ++j) {
            G.direct(i, (i * 10 + j) % K, j);
        }
    }
    
    for (int i = 0; i < MAX_V; ++i) dp[i] = INF;
    priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > que;
    for (int i = 1; i <= 9; ++i) {
        dp[i] = i;
        que.push(make_pair(i, i));
    }
    while (!que.empty()) {
        pair<int, int> cur = que.top();
        que.pop();
        if (cur.first > dp[cur.second]) continue;
        for (auto e : G[cur.second]) {
            if (chmin(dp[e.to], dp[cur.second] + e.cost)) {
                que.push(make_pair(dp[e.to], e.to));
            }
        }
    }
    return dp[0];
}

int main() {
    while (cin >> K) {
        while (K % 2 == 0) K /= 2;
        while (K % 5 == 0) K /= 5;
        cout << solve() << endl;
    }
}


















Measured memory_bytes: 28532