#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 1e9
#define All(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;


int main() {
  int h,w,n;
  cin>>h>>w>>n;
  if(w>h)swap(w,h);
  int ans=ceil((double)n/h);
  cout<<ans<<endl;
  
  
  


  return 0;
}

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const double EPS = 1e-9;

int main(){
	int l[10], v[2];
	while(scanf("%d,", &l[0])!=EOF){
		for(int i=1; i<10; i++){
			scanf("%d,", &l[i]);
		}
		scanf("%d,%d", &v[0], &v[1]);
		
		int total=0;
		for(int i=0; i<10; i++){
			total += l[i];
		}
		
		double t = (double)total/(v[0]+v[1]);
		double d = v[0]*t -EPS;
		int sum=0;
		for(int i=0; i<10; i++){
			sum += l[i];
			if(sum > d){
				cout << i+1 << endl;
				break;
			}
		}
	}
    return 0;
}