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

int gcd(int a, int b) {
    if(b == 0) return a;
    return gcd(b, a % b);;
}
int dp[2000006] = {};
int main() {
    cin.tie(0)->sync_with_stdio(0);

    int a,b,n; cin >> a >> b >> n;

    if(gcd(a,b) > 1) {
        int ans1 = n/a + (n+1)/b;
        int ans2 = (n+1)/a + n/b;
        cout << min(ans1, ans2) << endl;
        return 0;
    }
    
    int jumpa = 0;
    int jumpb = 0;
    for(int i = 1; i < b; i++) {
        if((i * a - 1) % b == 0) jumpa = (i * a - 1);
    }
    for(int i = 1; i < a; i++)  {
        if((i * b - 1) % a == 0) jumpb = (i * b - 1);
    }


    for(int i = n; i >= 0; i--)  {
        int ja = min(n - i, jumpa);
        int jb = min(n - i, jumpb);
        int v1 = 1 + ja/a + 1 + (ja - 1)/b + dp[i + jumpa];
        int v2 = 1 + jb/b + 1 + (jb - 1)/a + dp[i + jumpb];
      //  cout << v1 << " " << v2 << endl;
        dp[i] = min(v1, v2);
    }

    
   int ans = 1e8;

//    for(int i = 0; i <= n; i++) {
//        cout << dp[i] << " ";
//    }
//    cout << endl;

   for(int i = 1; i <= a * b; i++) {
    //   cout << (i-1)/a << " " << (i-1)/b << " " << dp[i] << endl;
       ans = min(ans, (i-1)/a + (i-1)/b + dp[i]);
   }

   cout << ans << endl;




    
}