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

int gcd(int a,int b){ return !a?b:gcd(b%a,a); }

const int inf = 3e6;

int n,A,B,ans;
int nex1,nex0;

signed main()
{
	ios_base::sync_with_stdio(false);
	
	cin>>A>>B>>n;
	int d=gcd(A,B);
	
	if(d!=1)
	{
		ans= n/A+ n/B;
		ll lcm= 1LL*A*B/d;
		if( lcm<=n && (n+1)%A==0 && (n+1)%B==0 ) ans++;
	}
	else
	{
		int tmpa=A,tmpb=B;
		while( tmpa<inf && tmpb<inf && (nex1&nex0)==0 )
		{
			if(tmpa+1==tmpb && nex1==0) nex1=tmpa;
			if(tmpa-1==tmpb && nex0==0) nex0=tmpa;
			
			if(tmpa<tmpb) tmpa+=A;
			else tmpb+=B;
		}
		if(nex0==0) nex0=inf;
		if(nex1==0) nex1=inf;
		//                    B   A
		int push= nex1<nex0 ? 1 : 0;
		int use= (push==0)? (B-n%B-1) : (A-n%A-1);
		
		tmpa=A,tmpb=B;
		ans=2;
		while( min(tmpa,tmpb)<=n )
		{
			if(tmpa<tmpb) 
			{
				tmpa+=A;
				if(tmpa<=n) ans++;
			}
			else 
			{
				tmpb+=B;
				if(tmpb<=n) ans++;
			}
			if(tmpa==tmpb)
			{
				if(use)
				{
					use--;
					if(push==0) tmpb--;
					else tmpa--;
				}
				else
				{
					if(push==0) tmpa--;
					else tmpb--;
				}
			}
		}
	}
	
	cout<<ans<<endl;
	
	return 0;
}