#include <bits/stdc++.h>

typedef long long ll;
const int Maxn = 1e9;
const int N = 1e6 + 5;
int n, a, b, tis, ans = Maxn, f[N][2];

template <class T>
inline void CkMin(T &x, T y) {x > y ? x = y : 0;}

inline void calc(int pa, int pb, int a, int b, int &d, int &k)
{
	d = 0;
	while (pa != pb)
	{
		if (pa > pb)	
			std::swap(pa, pb), std::swap(a, b);
		pa += a;
		if (pa > n)
		{
			k = n + 1;
			return ;
		}
		++d;	
	}
	k = pa;
}

int main()
{
	std::cin >> a >> b >> n;
	long long lcm = 1ll * a * b / std::__gcd(a, b);
	if (lcm > n)
		std::cout << (n / a) + (n / b) << std::endl;
	else 
	{
		int k1, k2, d1, d2;
		calc(-1, 0, a, b, d1, k1);
		calc(-1, 0, b, a, d2, k2);
		
		for (int i = 1; i <= n + 1; ++i)
			f[i][0] = f[i][1] = Maxn;
		f[lcm][0] = f[lcm][1] = (lcm / a) + (lcm / b);
		for (int i = 1; i <= n; ++i)
		{
			int k, d;
			if (f[i][0] < Maxn)
			{
				if (k1 + i <= n)
				{
					CkMin(f[k1 + i][0], f[i][0] + d1);
					CkMin(f[k1 + i][1], f[i][0] + d1);
				}
				else 
					CkMin(ans, f[i][0] + (n - i) / b + (n - i + 1) / a);
			}
			if (f[i][1] < Maxn)
			{
				if (k2 + i <= n)
				{
					CkMin(f[k2 + i][0], f[i][1] + d2);
					CkMin(f[k2 + i][1], f[i][1] + d2);
				}
				else 
					CkMin(ans, f[i][1] + (n - i) / a + (n - i + 1) / b);
			}
		}
		std::cout << ans << std::endl;
	}
}