#include <bits/stdc++.h>
using namespace std;
int read(){
	char c=getchar();int x=0;
	while(c<48||c>57) c=getchar();
	do x=(x<<1)+(x<<3)+(c^48),c=getchar();
	while(c>=48&&c<=57);
	return x;
}
int n,a,b,tx,ty,ta,tb,g;
int exgcd(int a,int b,int &x,int &y){
	if(!b){x=1;y=0;return a;}
	int d=exgcd(b,a%b,y,x);
	y-=(a/b)*x;
	return d;
}
map<pair<int,int>,int> mp;
typedef long long ll;
int jump(int u,int v){
	if((v-u)%g) return 0x3f3f3f3f;
	ll x=(ll)tx*(v-u)/g;
	ll y=(ll)ty*(v-u)/g;
	int sx=x%tb;
	if(sx<=0) sx+=tb;
	int sy=y%ta;
	if(sy>=0) sy-=ta;
	return max(v+b*-sy,u+a*sx);
}
int dp(int u,int v){
	if(mp.find({u,v})!=mp.end()) return mp[{u,v}];
	int x=jump(u,v);
	if(x>n) return mp[{u,v}]=(n-u)/a+(n-v)/b+2;
	return mp[{u,v}]=min(dp(x-1,x)+(x-u-2)/a+(x-v-1)/b,dp(x,x-1)+(x-u-1)/a+(x-v-2)/b)+2;
}
int main(){
	a=read();b=read();n=read();
	g=exgcd(a,b,tx,ty);ta=a/g;tb=b/g;
	printf("%d\n",dp(0,0)-2);
	//for(auto cur:mp) printf("%d %d %d\n",cur.first.first,cur.first.second,cur.second);
	return 0;
}