#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>

using namespace std;

long long MOD = 1e9+7;
int MAX_INT = 1e9;

int main(void){
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);

  int H, W, N;
  cin >> H >> W >> N;

  int max_len = max(H, W);
  if(N % max_len == 0) cout << (N / max_len) << endl;
  else cout << (N / max_len) + 1 << endl;

  return 0;
}

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

#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long double ld;
typedef long long ll;
const int MOD =  1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;


int main() {
    int h, w, n; cin >> h >> w >> n;

    int ans = IINF;
    for(int i = 0; i <= h; i++){
        for(int j = 0; j <= w; j++){
            int sum = i * h + j * w - i * j;
            if(sum >= n) ans = min(ans, i + j);
        }
    }
    cout << ans << endl;

    return 0;
}
