#include <bits/stdc++.h>
using namespace std;
long long int a[500008];
int main() {
  long long int t = 1;
  int tt = 1;
  long long int n;
  while (tt--) {
    long long int m, k;
    long long int a, b;
    cin >> n;
    cin >> a >> b;
    vector<long long int> v;
    long long int res[8];
    for (int i = 1; i <= 4; i++) res[i] = a;
    res[5] = b;
    res[6] = b;
    for (int i = 1; i <= 6; i++) v.push_back(i);
    long long int ans = INT_MAX;
    do {
      long long int i = 0;
      long long int cnt = 0;
      while (i < v.size()) {
        long long int x = 0;
        cnt++;
        while (x <= n && i < v.size()) {
          if (x + res[v[i]] > n) break;
          x += res[v[i]];
          i++;
        }
      }
      ans = min(ans, cnt);
    } while (next_permutation(v.begin(), v.end()));
    cout << ans << endl;
  }
}
