#include <bits/stdc++.h>
using namespace std;
const int N = 2000010, M = 2 * N;
const int mod = 1e9 + 7;
int f[7];
int main() {
  ios::sync_with_stdio(false);
  cin.tie();
  cout.tie(0);
  int n;
  int a, b;
  cin >> n >> a >> b;
  f[0] = f[1] = b;
  f[2] = f[3] = f[4] = f[5] = a;
  sort(f, f + 6);
  int ans = 6;
  do {
    int sum = n, t = 1;
    for (int i = 0; i < 6; i++) {
      if (sum < f[i]) {
        t++;
        sum = n - f[i];
      } else
        sum -= f[i];
    }
    ans = min(ans, t);
  } while (next_permutation(f, f + 6));
  cout << ans;
  return 0;
}
