#include <vector>
#include <queue>
#include <list>
#include <iostream>
#include <array>
#include <string>
#include <numeric>
#include <algorithm>
#include <cmath>

using namespace std;

using ll = long long;

int main()
{
    int k, j, n;
    cin >> k >> j >> n;
    auto findRes = [&k, &j, &n]()
    {
        int res = 0;
        int cnt1 = 0, cnt2 = 0;
        for (int i = 0; i < n; ++i)
        {
            ++cnt1;
            ++cnt2;
            if (cnt1 == j && cnt2 == k)
            {
                res += 2;
                cnt1 = 1;
                cnt2 = 0;
            }
            if (cnt1 == j)
            {
                ++res;
                cnt1 = 0;
            }
            if (cnt2 == k)
            {
                ++res;
                cnt2 = 0;
            }
        }
        return res;
    };
    int res1 = findRes();
    swap(k, j);
    cout << min(findRes(), res1);
    return 0;
}