#include<algorithm>
#include<vector>
#include<cstdio>
#include<map>
#include<cstring>
#include<iostream>
#include<cstdlib>
#include<iomanip>
#include<bitset>
#include<queue>
#include<cassert>
#include<stdlib.h>
#include<cmath>
#include<set>
//#define ll long long
#define ld long double
#define For(i,l,r) for(int i=(l);i<=(r);i++)
#define rof(i,r,l) for(int i=(r);i>=(l);i--)
#define db double
#define mem0(a) memset(a,0,sizeof(a))
#define ull unsigned long long
#define lowbit(t) (t&-t)
#define uint unsigned int
#define int long long
#define x1 alkjhfasdlkjfawlkf
#define x2 fsdouifiaojlfkwewj
#define y1 sdlkajfaskljfiowfw
#define y2 ajlfioueuoijwefoja
using namespace std;
const int N=1e6+10,inf=0x7fffffff,mod=998244353;
int k1,k2,n;
int dp[N];
int f(int x,int y){
    int i=min(x,y);
    if(x>n&&y>n)return 0;
    if(x!=y){
        int nx=(x<y)?x+k1:x,ny=(x>y)?y+k2:y;
        return f(nx,ny)+1;
    }
    if(dp[i]>=0)return dp[i];
    return dp[i]=min(f(x-1+k1,y),f(x,y-1+k2))+1;
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    cin>>k1>>k2>>n;
    For(i,1,n)dp[i]=-1;
    cout<<f(k1,k2)<<endl;
    return 0;
}
/*
 */