#include <bits/stdc++.h>
#define x first
#define y second
#define int long long
using namespace std;
typedef pair<int, int>PII;
typedef long long LL;
const int N = 1e5+10,M=2e6+10,INF=1e10;

void solve()
{
    int a,b,n;
    cin>>a>>b>>n;
    if(__gcd(a,b)>1)
    {
        int ans = n/a+n/b;
        if((n+1)%a==0&&(n+1)%b==0&&a*b/(__gcd(a,b))<=n)   ans++;
        cout<<ans<<endl;
        return;
    }
    int ans=0,sa=0,sb=0;
    vector<int>dp(n+1,n+1);
    bool ok = true;
    for(int i=1;i<=n;i++)
    {
        if(i-sa==a)sa+=a,ans++;
        if(i-sb==b)sb+=b,ans++;
        if(sa&&sa==sb)
        {
            dp[sa]=ans;
            ok=false;
            break;
        }
    }
    if(ok)
    {
        cout<<ans<<endl;
        return;
    }
    int t1=0,t2=0;
    while(true)
    {
        t1+=a;
        if((t1+1)%b==0) break;
    }
    while(true)
    {
        t2+=b;
        if((t2+1)%a==0) break;
    }
    ans=n+1;
    for(int i=1;i<=n;i++)
    {
        if(i+t1>n)
        {
            int t = (n-i)/a+(n-i+1)/b;
            ans=min(ans,dp[i]+t);
        }
        else    dp[i+t1]=min(dp[i+t1],dp[i]+t1/a+(t1+1)/b);
        if(i+t2>n)
        {
            int t = (n-i)/b+(n-i+1)/a;
            ans=min(ans,dp[i]+t);
        }
        else    dp[i+t2]=min(dp[i+t2],dp[i]+t2/b+(t2+1)/a);
        
    }
    cout<<ans<<endl;
}

signed main() 
{
	int T=1;
	//cin>>T;
	while(T--)
	{
		solve();
	}
	return 0;
}