#include <bits/stdc++.h>
using namespace std;
int n, a, b, ans = 6;
int len[15], last[15];
void dfs(int x, int va) {
  if (x == 7) {
    ans = min(ans, va);
    return;
  }
  for (int i = 1; i <= va; i++) {
    if (last[i] >= len[x]) {
      last[i] -= len[x];
      dfs(x + 1, va);
      last[i] += len[x];
    }
  }
  last[va + 1] = n - len[x];
  dfs(x + 1, va + 1);
}
int main() {
  scanf("%d%d%d", &n, &a, &b);
  for (int i = 1; i <= 4; i++) len[i] = a;
  for (int i = 5; i <= 6; i++) len[i] = b;
  dfs(1, 0);
  printf("%d", ans);
}
