#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  long long N, a, b;
  cin >> N >> a >> b;
  vector<long long> A;
  A.push_back(a);
  A.push_back(a);
  A.push_back(a);
  A.push_back(a);
  A.push_back(b);
  A.push_back(b);
  sort(A.begin(), A.end());
  long long res = 100000;
  long long k = 0;
  long long tres;
  do {
    k = 0;
    tres = 1;
    for (long long i = 0; i < A.size(); i++) {
      k += A[i];
      if (k > N) {
        k = A[i];
        tres++;
      }
    }
    res = min(res, tres);
  } while (next_permutation(A.begin(), A.end()));
  cout << res << endl;
}
