/*
TASK: minjumps
LANG: C++
*/
#include<iostream.h>
long a,b,n,br,i;
long walker(long i)
{
  if(i==n) return br;
  else
  { br++;
    walker(i+a);
    walker(i-a);
    walker(i+b);
    walker(i-b);
  }
}
int main()
{ cin>>a>>b>>n;
  cout<<walker(0)<<endl;
  return 0;
}
