#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop_opt(on)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using ld = long double;
const int mod = 1000000007;
const int hnum = 998244353;
const ld PI = acos(-1);
long long qpow(long long x, long long powcnt, long long tomod) {
  long long res = 1;
  for (; powcnt; powcnt >>= 1, x = (x * x) % tomod)
    if (1 & powcnt) res = (res * x) % tomod;
  return (res % tomod);
}
long long inv(long long x) { return qpow(x, mod - 2, mod); }
long long n, a, b;
void solve() {
  cin >> n >> a >> b;
  vector<long long> v = {a, a, b, b, a, a};
  sort((v).begin(), (v).end());
  long long ans = 1e9;
  do {
    long long cnt = 1, now = n;
    for (auto i : v) {
      if (i > now)
        cnt++, now = n - i;
      else
        now -= i;
    }
    ans = min(ans, cnt);
  } while (next_permutation((v).begin(), (v).end()));
  cout << ans << '\n';
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long t = 1;
  while (t--) solve();
}
