#include <bits/stdc++.h>
using namespace std;
int modpow(int x, int n, int m) {
  if (n == 0) return 1 % m;
  long long u = modpow(x, n / 2, m);
  u = (u * u) % m;
  if (n % 2 == 1) u = (u * x) % m;
  return u;
}
int main() {
  int n, a, b;
  cin >> n >> a >> b;
  if (4 * a + 2 * b <= n) {
    cout << 1;
    return 0;
  }
  if (2 * a + b <= n) {
    cout << 2;
    return 0;
  }
  if (a + b <= n && 2 * a <= n) {
    cout << 3;
    return 0;
  }
  int arr[6] = {a, a, a, a, b, b};
  sort(arr, arr + 6);
  int n2 = n;
  int count = 0;
  int sum = 5;
  while (sum != 0) {
    sort(arr, arr + 6);
    for (int i = 5; i >= 0; i--) {
      if (n2 - arr[i] >= 0) {
        n2 = n2 - arr[i];
        arr[i] = 0;
      }
    }
    sum = arr[0] + arr[1] + arr[2] + arr[3] + arr[4] + arr[5];
    n2 = n;
    count++;
  }
  cout << count;
}
