#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct point{
	int x,y;
};
const int mxn=1000010;
int inf;
int i,j,k;
int x,y,z,xx,xy,xz,yx,yy,yz;
point px,py,pz;
int m,n,p;
int ma,mb;
int f[mxn],g[mxn];
int ans;
int gcd(int x,int y){
	int z;
	while(y){
		x%=y;
		z=x;
		x=y;
		y=z;
	}
	return x;
}
int lcm(int x,int y){
	return x/gcd(x,y)*y;
}
point sol(int a,int b,int c){
	if(b==0){
		return (point){c/a,0};
	}
	if(a==0){
		return (point){0,c/b};
	}
	point px=sol(b,a%b,c);
	return (point){px.y,px.x-a/b*px.y};
}
int main(){
	scanf("%d%d%d",&ma,&mb,&n);
	memset(f,0x3f,sizeof(f));
	memset(g,0x3f,sizeof(g));
	ans=inf=f[0];
	if(gcd(ma,mb)!=1){
		if(n>=lcm(ma,mb)){
			ans=min(n/ma+(n+1)/mb,(n+1)/ma+n/mb);
		}else{
			ans=n/ma+n/mb;
		}
		printf("%d\n",ans);
		return 0;
	}
	x=lcm(ma,mb);
	if(x>n){
		ans=n/ma+n/mb;
		printf("%d\n",ans);
		return 0;
	}
	f[x]=x/ma+x/mb;
	g[x]=f[x];
	f[0]=g[0]=0;
	for(i=1;i<=n;i++){
		px=sol(-ma,mb,1);
		x=(px.x%mb+mb)%mb*ma;
		y=i+x;
		if(y<=n){
			z=f[i]+x/ma+(x+1)/mb;
			f[y]=min(f[y],z);
			g[y]=min(g[y],z);
		}else{
			ans=min(ans,f[i]+(n-i)/ma+(n-i+1)/mb);
		}
		px=sol(-mb,ma,1);
		x=(px.x%ma+ma)%ma*mb;
		y=i+x;
		if(y<=n){
			z=g[i]+(x+1)/ma+x/mb;
			f[y]=min(f[y],z);
			g[y]=min(g[y],z);
		}else{
			ans=min(ans,g[i]+(n-i+1)/ma+(n-i)/mb);
		}
	}
	/*for(i=0;i<=n;i++){
		x=f[i]+(n-i)/ma+(n-i+1)/mb;
		y=g[i]+(n-i+1)/ma+(n-i)/mb;
		ans=min(ans,min(x,y));
		//if(f[i]<inf||g[i]<inf)printf("<>%d %d %d\n",i,f[i],g[i]);
	}*/
	printf("%d\n",ans);
	return 0;
}