#include <bits/stdc++.h>
#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
    #include <filesystem>
    namespace fs = std::filesystem;
#else
    #define DBG(X)
    #define SAY(X)
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 1,-1, 1,-1};
int dy[]={0, 1, 0, -1, 1, 1,-1,-1};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
static mt19937 _g(time(nullptr));
 
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const map<T, S> p) { for (auto el : p) cout << "[" << el.first << ";" << el.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

ll K;
void input(){
    fast_io();
    #ifdef __LOCAL
        fs::path __p = __FILE__;
        fs::path __input, __output;
        __input = __output = __p.parent_path();
        __input += string("/input/") + string(__p.stem()) + string(".txt");
        __output += string("/output/") + string(__p.stem()) + string(".txt");
        freopen(__input.c_str(), "r", stdin);
        freopen(__output.c_str(), "w", stdout);
    #endif
    cin >> K;
}

int calc(string x){
    int res=0;
    for (int i = 0; i < x.length(); i++) res += x[i]-'0';
    return res;
}

int calc(ll x){
    string s=to_string(x);
    return calc(s);
}

map< ll, int > prime_factor(ll n) {
  map< ll, int > ret;
  for(ll i = 2; i * i <= n; i++) {
    while(n % i == 0) {
      ret[i]++;
      n /= i;
    }
  }
  if(n != 1) ret[n] = 1;
  return ret;
}


int wrong_solve(){
    auto pf=prime_factor(K);
    bool isone=true;
    for(auto p:pf){
        if(p.first==2 || p.first==5) continue;
        else isone=false;
    }

    if(isone) {cout << 1 << endl; return 0;}
    if(pf[2]) K >>= pf[2];
    if(pf[5]) K /= pow(5,pf[5]);
    DBG(K)
    int ans=1e9;
    // for (ll i = 1; i <= 1000000; i++)
    for (ll i = 1; i <= 100; i++)
    {
        DBG(i*K)
        DBG(calc(i*K))
        ans = min(ans,calc(i*K));
    }
    cout << ans << endl;
    
    return 0;
}   


int bfs(int K){
    deque<pii> dq;
    dq.emplace_back(0,1);
    vector<bool> used(K,false);
    vector<int> dist(K,100);
    while(!dq.empty()){
        int di,x;
        tie(di,x) = dq.front();
        dq.pop_front();
        if(used[x]) continue;
        used[x] = true;
        dist[x] = di;
        if(x==0) break;
        dq.emplace_front(di,(x*10)%K);
        dq.emplace_back(di+1,(x+1)%K);
    }
    return dist[0];
}

int solve(){
    auto pf=prime_factor(K);
    bool isone=true;
    for(auto p:pf){
        if(p.first==2 || p.first==5) continue;
        else isone=false;
    }

    if(isone) {cout << 1 << endl; return 0;}
    if(pf[2]) K >>= pf[2];
    if(pf[5]) K /= pow(5,pf[5]);
    DBG(K)
    cout << (bfs(K)+1) << endl;
    
    return 0;
}   

int main()
{
    input();
    solve();
    // test();
    return 0;
}


Measured memory_bytes: 1536