#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a, b;
  cin >> n >> a >> b;
  vector<int> v;
  v.push_back(a);
  v.push_back(a);
  v.push_back(a);
  v.push_back(a);
  v.push_back(b);
  v.push_back(b);
  sort(v.begin(), v.end());
  int ans = 1e9;
  do {
    int dp[7];
    dp[0] = 0;
    for (int i = 1; i <= 6; ++i) {
      dp[i] = 1e9;
      int sm = 0;
      for (int j = i; j >= 1; --j) {
        sm += v[j - 1];
        if (sm <= n) dp[i] = min(dp[i], 1 + dp[j - 1]);
      }
    }
    ans = min(ans, dp[6]);
  } while (next_permutation(v.begin(), v.end()));
  cout << ans;
}
