#include<bits/stdc++.h>
using namespace std;

void solve(int t){
    int k,j,n;
    cin>>k>>j>>n;
    
    int lcm = k*j/__gcd(k,j);
    
    if(k<j)swap(k,j);
    
    int res=1e7;
    
    for(int st=max(1,k-100);st<=k;st++){
        for(int st2=max(1,j-100);st2<=j;st2++){
            for(int par=0;par<2;par++){
                int ans=0;
                
                int pos1=st,pos2=st2;
                int cont=0;
                
                while(pos1<=n || pos2<=n){
                    if(pos1<pos2){
                        ans++;
                        pos1+=k;
                    }else if(pos2<pos1){
                        ans++;
                        pos2+=j;
                    }else{
                        ans+=2;
                        
                        if(par==3)pos1--;
                        else if(par==4)pos2--;
                        else if(cont%2==par){
                            pos1--;
                        }else{
                            pos2--;
                        }
                        cont++;
                        
                        pos1+=k;
                        pos2+=j;
                    }
                }
                
                res=min(ans,res);
            }
            //cout<<ans<<"\n";
        }
    }
    cout<<res<<"\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int t=1;
    //cin>>t;
    for(int i=1;i<=t;i++)solve(i);
    
    return 0;
}