#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a,b,n;
ll gcd(ll x,ll y){
	if(y==0) return x;
	return gcd(y,x%y);
}
ll dp[1000001];
int main(){
	ios::sync_with_stdio(false);cin.tie(0);
	cin >> a >> b >> n;
	ll g=gcd(a,b);
	if(g>1){
		ll ans=n/a+n/b;
		if((n+1)%a==0 && (n+1)%b==0){
			if(n>=a*b/g){
				ans++;
			}
		}
		return cout << ans << '\n',0;
	}
	ll fk=a;
	while(fk%b!=b-1) fk+=a;
	ll gk=b;
	while(gk%a!=a-1) gk+=b;
	ll sx=0,sy=0;
	ll ans=0;
	bool fun=false;
	for(int i=1; i<=n ;i++) dp[i]=n+1;
	while(sx+a<=n && sy+b<=n){
		if(sx+a!=sy+b){
			ans++;
			if(sx+a<sy+b) sx+=a;
			else sy+=b;
			continue;
		}
		dp[sx+a]=ans+2;
		fun=true;
		break;
	}
	if(!fun){
		while(sx+a<=n){
			ans++;sx+=a;
		}
		while(sy+b<=n){
			ans++;sy+=b;
		}
		cout << ans << '\n';
		return 0;
	}
	ans=1e9;
	for(int i=1; i<=n ;i++){
		if(dp[i]<=n){
			if(i+fk>n){
				ans=min(ans,dp[i]+(n-i)/a+(n-i+1)/b);
			}
			else dp[i+fk]=min(dp[i]+fk/a+(fk+1)/b,dp[i+fk]);
			if(i+gk>n){
				ans=min(ans,dp[i]+(n-i)/b+(n-i+1)/a);
			}
			else dp[i+gk]=min(dp[i]+gk/b+(gk+1)/a,dp[i+gk]);
		}
	}
	cout << ans << '\n';
}