#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long modexp(long long x, long long n) {
  if (n == 0) return 1;
  if (n % 2 == 0) {
    long long y = modexp(x, n / 2) % mod;
    return (y * y) % mod;
  }
  return (x * modexp(x, n - 1) % mod) % mod;
}
int main() {
  int n, a, b;
  cin >> n >> a >> b;
  int x = 0;
  int y = 0;
  int p = 100;
  int ax = 0;
  int ay = 0;
  int ans1 = 0;
  int aa = 4;
  int bb = 2;
  while (p--) {
    int ans = 0;
    if (ax == aa && ay == bb) break;
    ans1++;
    for (int i = 0; i <= 4 - ax; i++) {
      for (int j = 0; j <= 2 - ay; j++) {
        if (i * a + j * b <= n) {
          if (i * a + j * b > ans) {
            ans = i * a + j * b;
            x = i;
            y = j;
          }
        }
      }
    }
    ax += x;
    ay += y;
  }
  cout << ans1 << endl;
  return 0;
}
