#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int n, x, y, d[2], c[2];
int f[N];
int Dp(int n) {
    if (n < x && n < y) return 0;
    if (f[n]) return f[n];
    f[n] = 1e9;
    int tx = x, ty = y;
    for (int r = 0; r < 2; ++r) {
        if (d[r] >= n) {
            f[n] = min(f[n], n / tx + (n + 1) / ty); 
        } else {
            f[n] = min(f[n], Dp(n - d[r]) + c[r]);
        }
        swap(tx, ty);
    }
    return f[n];
}
int main() {
    scanf("%d%d%d", &x, &y, &n);
    long long tmp = 1ll * x * y / __gcd(x, y);
    if (tmp >= n) { printf("%d\n", n / x + n / y); return 0; }
    // puts("here");
    for (int r = 0; r < 2; ++r) {
        d[r] = 0;
        int lx = 0, ly = -1;
        if (r) swap(lx, ly);
        while (d[r] <= n) {
            ++d[r];
            if (d[r] - lx == x) ++c[r], lx = d[r];
            if (d[r] - ly == y) ++c[r], ly = d[r];
            if (lx == ly) break;
        }
    }
    // printf("%d %d\n%d %d\n", d[0], c[0], d[1], c[1]);
    int ans = Dp(n - tmp) + (tmp / x) + (tmp / y);
    printf("%d\n", ans);
    return 0;
}