#include<bits/stdc++.h>

using namespace std;

#define gc c=getchar()
#define r(x) read(x)
#define ll long long

template<typename T>
inline void read(T &x){
	x=0;T k=1;char gc;
	while(!isdigit(c)){if(c=='-')k=-1;gc;}
	while(isdigit(c)){x=x*10+c-'0';gc;}x*=k;
}

const int N = 1e6 + 7;

int F[N][2];

void exgcd(int a, int b, int &x, int &y){
    if(!b){
        x = 1;
        y = 0;
    }
    else{
        exgcd(b, a % b, y, x);
        y -= a / b * x;
    }
}

const int INF = 1e9;

inline int f(int n, int a, int b, int x, int y, bool t){
	int &ans = F[n][t];
	if(~ans) return F[n][t];
	ans = INF;
	if(t == 0){
		ll d0 = a * x;
		if(d0 > n + 1){
			ans = min(ans, (n + 1) / a + n / b);
		}
		else{
			ans = min(ans, (int)(d0 / a + (d0 - 1) / b) + min(f(n - (d0 - 1), a, b, x, y, 0), f(n - (d0 - 1), a, b, x, y, 1)));
		}
	}
	else{
		ll d1 = b * y;
		if(d1 > n + 1){
			ans = min(ans, (n + 1) / b + n / a);
		}
		else{
			ans = min(ans, (int)(d1 / b + (d1 - 1) / a) + min(f(n - (d1 - 1), a, b, x, y, 0), f(n - (d1 - 1), a, b, x, y, 1)));
		}
	}
	return ans;
}

int main(){
	// freopen(".in","r",stdin);
	// freopen(".out","w",stdout);
	int a, b, n; cin >> a >> b >> n;
	int g = __gcd(a, b);
	ll lcm = (ll) a * b / g;
	if(lcm > n){
		cout << n / a + n / b << endl;
	}
	else{
		if(g != 1){
			cout << lcm / a + lcm / b + min((n - lcm) / a + (n - lcm + 1) / b, (n - lcm + 1) / a + (n - lcm) / b) << endl;
		}
		else{
			int x, y;
			exgcd(a, b, x, y); // a * x + b * y = 1
			x = (x % b + b) % b;
			y = (y % a + a) % a;
			ll d = max(a * x, b * y);
			memset(F, -1, sizeof(F));
			cout << lcm / a + lcm / b + min(f(n - lcm, a, b, x, y, 0), f(n - lcm, a, b, x, y, 1)) << endl;
		}
	}
	return 0;
}