#pragma ide diagnostic ignored "misc-no-recursion"

#include "bits/stdc++.h"

using namespace std;
typedef long long ll;
typedef long double db;

#define TESTCASE 0

static constexpr int MAX_N = 5000;
static constexpr int INF = 1e9;

static pair<int, ll> advance(ll A, ll B, ll N) {
    ll p1 = 0, p2 = -1, c = 0;

    while (p1 != p2) {
        if (p1 >= N) return {INF, INF};
        if (p1 < p2) {
            p1 += A;
        } else {
            p2 += B;
        }
        c++;
    }

    return {p1, c};
}

static void solve([[maybe_unused]] int tc) {
    ll N, A, B;
    cin >> A >> B >> N;

    ll f = lcm(A, B);
    if (f > N) {
        ll ans = N / A + N / B;
        cout << ans + (f == N + 1) << endl;
        return;
    }

    auto c1 = advance(A, B, N);
    auto c2 = advance(B, A, N);

    vector <ll> dp(N, INF);
    dp[f - 1] = f / A + f / B;

    ll res = INF;
    for (int i = 0; i < N; i++) {
        int x1 = i + c1.first;
        if (x1 < N) {
            dp[x1] = min(dp[x1], dp[i] + c1.second);
        } else {
            res = min(res, dp[i] + (N - i - 1) / A + (N - i) / B);
        }
        int x2 = i + c2.first;
        if (x2 < N) {
            dp[x2] = min(dp[x2], dp[i] + c2.second);
        } else {
            res = min(res, dp[i] + (N - i - 1) / B + (N - i) / A);
        }
    }

cout << res << endl;
}

int main() {
    ios::sync_with_stdio(false);

    if (const char *f = getenv("REDIRECT_STDOUT"); f) {
        freopen(f, "w", stdout);
    }

    int T = 1;
#if TESTCASE
    cin >> T;
#endif

    for (int t = 1; t <= T; t++) {
        solve(t);
    }

    return 0;
}