#include <bits/stdc++.h>
using namespace std;

#define int long long

int lcm(int x, int y) {
	return x*y/__gcd(x, y);
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, a, b; cin >> a >> b >> n;
	if (a == 2 && b == 2) {
		cout << n << '\n';
		return 0;
	}

	int lc = lcm(a, b);
	if (n <= lc) {
		cout << n/a + n/b << '\n';
		return 0;
	}

	priority_queue<tuple<int, int, int>> pq; // 0 = 'AB', 1 = 'BA'
	pq.push({-(lc/a + lc/b), lc, 0}); 
	pq.push({-(lc/a + lc/b), lc, 1});

	vector<vector<int>> vis(n+1, vector<int>(2));

	int ans = n;
	while (pq.size()) {
		auto [dis, u, st] = pq.top(); pq.pop();
		if (vis[u][st]) continue;
		vis[u][st] = 1;

		int curA = u, curB = u;
		if (st) curB--; else curA--;

		int ds = -dis;
		while (1) {
			int nxtA = curA + a;
			int nxtB = curB + b;
			if (nxtA > n && nxtB > n) {
				ans = min(ans, ds);
				break;
			}
			if (nxtA < nxtB) {
				ds++; curA = nxtA;
				continue;
			}
			if (nxtA > nxtB) {
				ds++; curB = nxtB;
				continue;
			}
			if (nxtA == nxtB) {
				pq.push({-(ds+2), nxtA, 0});
				pq.push({-(ds+2), nxtA, 1});
				break;
			}
		}
	}
	cout << ans << '\n';

	return 0;
}