#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int n, a, b, dp[1001][5][3];
int f(int x, int y, int z) {
  if (y + z == 0) return 0;
  if (dp[x][y][z] != -1) return dp[x][y][z];
  int ret = INF;
  if (x != n) ret = min(ret, f(n, y, z) + 1);
  if (a <= x && y > 0) ret = min(ret, f(x - a, y - 1, z));
  if (b <= x && z > 0) ret = min(ret, f(x - b, y, z - 1));
  return dp[x][y][z] = ret;
}
int main() {
  scanf("%d %d %d", &n, &a, &b);
  memset((dp), -1, sizeof(dp));
  int ans = f(0, 4, 2);
  printf("%d\n", ans);
  return 0;
}
