#include<cstdio>
#include<iostream>
#include<algorithm>
#define int long long
#define RI register int
#define CI const int&
using namespace std;
const int N=1e6+5,INF=1e9;
int n,A,B,f[N],x_1,y_1,x_2,y_2,ans;
signed main()
{
    scanf("%lld%lld%lld",&A,&B,&n);
    int lcm=A*B/__gcd(A,B);
    if (n<lcm) return printf("%lld",n/A+n/B),0;
    for (RI i=0;i<=n;++i) f[i]=INF; ans=INF;
    f[lcm]=lcm/A+lcm/B;
    x_1=y_1=-1;
    for (RI i=1;B*i+1<=n;++i)
    if ((B*i+1)%A==0) { x_1=(B*i+1)/A; y_1=i; break; }
    x_2=y_2=-1;
    for (RI i=1;A*i+1<=n;++i)
    if ((A*i+1)%B==0) { y_2=(A*i+1)/B; x_2=i; break; }
    for (RI i=lcm;i<=n;++i)
    {
        if (f[i]==INF) continue;
        if (x_1!=-1&&i+B*y_1<=n) f[i+B*y_1]=min(f[i+B*y_1],f[i]+x_1+y_1);
        else ans=min(ans,f[i]+(n-i)/B+(n-i+1)/A);
        if (x_2!=-1&&i+A*x_2<=n) f[i+A*x_2]=min(f[i+A*x_2],f[i]+x_2+y_2);
        else ans=min(ans,f[i]+(n-i)/A+(n-i+1)/B);
    }
    return printf("%lld",ans),0;
}