#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define MAXN 1100000
using namespace std;
int a,b,n;
int cnt;
int A,B;
int dp[2][MAXN];
int f[MAXN];
int c[MAXN];
int main(){
    cin>>a>>b>>n;
    A=B=n;

    for(int i=-1+a,j=0+b;min(i,j)<=n;){
        int u=min(i,j);
        dp[0][u]=1;
        if(i==j){
            dp[0][u]++;
            A=u;
            break;
        }
        if(i<j)i+=a;
        else j+=b;
    }

    for(int i=-1+b,j=0+a;min(i,j)<=n;){
        int u=min(i,j);
        dp[1][u]=1;
        if(i==j){
            dp[1][u]++;
            B=u;
            break;
        }
        if(i<j)i+=b;
        else j+=a;
    }

    for(int i=1;i<=n;i++){
        dp[0][i]+=dp[0][i-1];
        dp[1][i]+=dp[1][i-1];
    }

    for(int i=n;i>=1;i--){
        f[i]=n;
        if(i+A-1>n){
            f[i]=min(f[i],dp[0][n-i+1]);
            //cout<<i<<"!"<<endl;
        }
        else f[i]=min(f[i],dp[0][A]+f[i+A]);
        if(i+B-1>n)f[i]=min(f[i],dp[1][n-i+1]);
        else f[i]=min(f[i],dp[1][B]+f[i+B]);
    }
    int SUM=n;
    for(int i=a;i<=n;i+=a)c[i]=1;
    for(int i=b;i<=n;i+=b){
        if(c[i]){
            c[i]++;
            SUM=i;break;
        }
        c[i]=1;
    }
    int ans=0;
    for(int i=1;i<=SUM;i++){
        ans+=c[i];
    }//cout<<ans<<endl;
    //cout<<A<<endl;
    //cout<<dp[0][2]<<" "<<f[7]<<endl;
    printf("%d\n",ans+f[SUM+1]);

    return 0;
}