#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
int n, s, t;
vector<pair<int, int> > G[100010];
int d[100010];
bool vis[100010];
priority_queue<pair<int, int> > pq;
void dijkstra() {
    d[s] = 0;
    pq.push({0, s});
    while (!pq.empty()) {
        int t = pq.top().second;
        pq.pop();
        if (vis[t]) continue;
        vis[t] = true;
        for (int i = 0; i < G[t].size(); i++) {
            int v = G[t][i].first, w = G[t][i].second;
            if (d[v] > d[t] + w) {
                d[v] = d[t] + w;
                pq.push({-d[v], v});
            }
        }
    }
}
int main() {
    scanf("%d", &n);
    s = n;
    t = 0;
    for (int i = 0; i < n; i++) {
        d[i] = 1e9;
        for (int j = 0; j < 10; j++) {
            G[i].push_back({(i * 10 + j) % n, j * j});
            // printf("%d %d %d\n", i, (i * 10 + j) % n, j * j);
        }
    }
    for (int j = 1; j < 10; j++) {
        G[s].push_back({j % n, j * j});
        // printf("%d %d %d\n", s, j % n, j * j);
    }
    dijkstra();
    printf("%d\n", d[0]);
    return 0;
}