#include <bits/stdc++.h>

using namespace std;

using LL = long long;

LL gcd(LL a, LL b)
{
    if (b == 0)
        return a;
    return gcd(b, a % b);
}

LL lcm(LL a, LL b)
{
    return a / gcd(a, b) * b;
}

LL exgcd(LL a, LL b, LL &x, LL &y)
{
    if (b == 0)
    {
        x = 1;
        y = 0;
        return a;
    }
    LL d = exgcd(b, a % b, y, x);
    y -= a / b * x;
    return d;
}

int a, b;
LL x, y;
int dp_[1000009][3];

int& dp(int x, int y)
{
    return dp_[x][y + 1];
}

int f(int r, int n)
{
    auto &cur = dp(n, r);
    if (cur != -1)
        return cur;
    int nxt;
    if (r == 0)
    {
        nxt = a * b;
        if (nxt > n)
            return cur = n / a + n / b;
        n -= a * b;
        return cur = a + b + min(f(1, n), f(-1, n));
    }
    if (r == 1)
    {
        int t = (a - y) % a;
        int nxt = t * b;
        if (nxt > n)
            return cur = (n + 1) / a + n / b;
        n -= nxt;
        return cur = (nxt + 1) / a + t + min(f(1, n), f(-1, n));
    }
    else
    {
        int t = (b - x) % b;
        int nxt = t * a;
        if (nxt > n)
            return cur = (n + 1) / b + n / a;
        n -= nxt;
        return cur = (nxt + 1) / b + t + min(f(1, n), f(-1, n));
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    memset(dp_, -1, sizeof(dp_));

    int n;
    cin >> a >> b >> n;
    if (lcm(a, b) > n)
    {
        int ans = n / a + n / b;
        cout << ans << '\n';
        return 0;
    }
    LL d = gcd(a, b);
    if (d > 1)
    {
        int ans = min(n / a + (n + 1) / b, (n + 1) / a + n / b);
        cout << ans << '\n';
        return 0;
    }
    exgcd(a, b, x, y);
    cout << f(0, n) << '\n';
}