#include <bits/stdc++.h>
using namespace std;
queue<int> q;
void bfs(int m);
int m, n, a, b, s, h, num1, num2;
int main() {
  while (cin >> m >> a >> b) {
    n = 0;
    s = (2 * a + b) * 2;
    num1 = 4;
    num2 = 2;
    bfs(m);
    cout << n << endl;
  }
  return 0;
}
void bfs(int m) {
  while (s > 0) {
    q.push(m);
    while (!q.empty()) {
      h = q.front();
      q.pop();
      if (h >= a && num1 != 0) {
        h = h - a;
        num1--;
      }
      if (h >= b && num2 != 0) {
        h = h - b;
        num2--;
      }
      if ((h >= a && num1 != 0) || (h >= b && num2 != 0)) {
        q.push(h);
      }
    }
    s = a * num1 + b * num2;
    n++;
  }
}
