#include <bits/stdc++.h>
inline int sbt(int x) { return __builtin_popcount(x); }
using namespace std;
int dp[1013][6][6];
int sum, n, a, b;
int kohli(int left, int completed_a, int completed_b) {
  if (completed_a == 4 && completed_b == 2) return 1;
  if (dp[left][completed_a][completed_b] != -1)
    return dp[left][completed_a][completed_b];
  int mini = INT_MAX;
  if (left >= a && completed_a <= 3)
    mini = kohli(left - a, completed_a + 1, completed_b);
  if (left >= b && completed_b <= 1)
    mini = min(mini, kohli(left - b, completed_a, completed_b + 1));
  if (mini == INT_MAX) mini = 1 + kohli(sum, completed_a, completed_b);
  return (dp[left][completed_a][completed_b] = mini);
}
int main() {
  cin.sync_with_stdio(false);
  cout.sync_with_stdio(false);
  cin >> n >> a >> b;
  sum = n;
  memset(dp, -1, sizeof(dp));
  cout << kohli(n, 0, 0);
  return 0;
}
