#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


constexpr int INF = 1001001001;

int main() {
  int A, B, N;
  for (; ~scanf("%d%d%d", &A, &B, &N); ) {
    int c, d;
    for (c = 0; c <= N; ++c) if ((c + 1) % A == 0 && c % B == 0) break;
    for (d = 0; d <= N; ++d) if ((d + 1) % B == 0 && d % A == 0) break;
    
    // dp[i]: hit at day i
    vector<int> dp(N + 1, INF);
    for (int i = N; i >= 1; --i) {
      // A zurasu
      if (i + c <= N) {
        chmin(dp[i], (c + 1) / A + c / B + dp[i + c]);
      } else {
        chmin(dp[i], (N-i + 1) / A + (N-i) / B);
      }
      // B zurasu
      if (i + d <= N) {
        chmin(dp[i], d / A + (d + 1) / B + dp[i + d]);
      } else {
        chmin(dp[i], (N-i) / A + (N-i + 1) / B);
      }
    }
// cerr<<"dp = "<<dp<<endl;
    
    int ans = N / A + N / B;
    for (int i = 1; i <= N; ++i) {
      if (i % A == 0 && i % B == 0) {
        ans = i / A + i / B + dp[i];
        break;
      }
    }
    printf("%d\n", ans);
  }
  return 0;
}