#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long calc(vector<int> v, int n) {
  long long rekt = 0;
  int cur = n;
  for (int i = 0; i < v.size(); ++i) {
    if (cur < v[i]) {
      rekt++;
      cur = n - v[i];
    } else {
      cur -= v[i];
    }
  }
  return rekt;
}
int main() {
  int n, a, b;
  cin >> n >> a >> b;
  vector<int> v;
  for (int i = 1; i <= 4; ++i) v.push_back(a);
  for (int i = 1; i <= 2; ++i) v.push_back(b);
  sort(v.begin(), v.end());
  long long ans = (long long)1e14;
  do {
    ans = min(ans, calc(v, n));
  } while (next_permutation(v.begin(), v.end()));
  cout << 1 + ans << endl;
  return 0;
}
