#include <bits/stdc++.h>
const int N = 1e3 + 10;
int T, n, m, x, y, z, ans = 10;
int len[10][10], vis[10][10][10];
void dfs(int aa, int bb, int cc) {
  if (vis[aa][bb][cc] || cc > 6) return;
  vis[aa][bb][cc] = -1;
  if (aa + bb == 0) {
    ans = ans < cc ? ans : cc;
    return;
  }
  for (int i = 0; i <= aa; i++)
    for (int j = 0; j <= bb; j++) {
      if (x < len[i][j]) continue;
      dfs(aa - i, bb - j, cc + 1);
    }
}
int main() {
  scanf("%d%d%d", &x, &y, &z);
  for (int i = 0; i <= 4; i++) {
    for (int j = 0; j <= 2; j++) {
      len[i][j] = y * i + z * j;
    }
  }
  dfs(4, 2, 0);
  printf("%d\n", ans);
  return 0;
}
