#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a, b, jwb = 0, tmpjwb = INT_MAX;
  cin >> n >> a >> b;
  if (b > a && b + a + a <= n) {
    tmpjwb = 2;
  }
  multiset<int> s;
  for (int i = 0; i < 4; ++i) s.insert(a);
  for (int i = 0; i < 2; ++i) s.insert(b);
  while (!s.empty()) {
    ++jwb;
    int tmp = 0;
    auto it = s.end();
    --it;
    while (it != s.begin() && tmp < n) {
      if ((*it) + tmp <= n) {
        tmp += (*it);
        auto it2 = it;
        ++it;
        s.erase(it2);
      }
      --it;
    }
    if ((*it) + tmp <= n) {
      tmp += (*it);
      s.erase(s.begin());
    }
  }
  cout << min(jwb, tmpjwb) << endl;
  return 0;
}
