#include <bits/stdc++.h>
using namespace std;
template <typename T>
using min_queue = priority_queue<T, vector<T>, greater<T> >;
const long long MOD = 1e9 + 7;
int n, a, b;
vector<int> x;
bool check(int k) {
  vector<int> l(k);
  for (int y : x) {
    sort(l.begin(), l.end());
    if (l[0] + y > n) return 0;
    l[0] += y;
  }
  return 1;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> a >> b;
  for (int i = 0; i < 4; i++) x.push_back(a);
  for (int i = 0; i < 2; i++) x.push_back(b);
  sort(x.rbegin(), x.rend());
  for (int k = 1; k <= 6; k++) {
    if (check(k)) {
      cout << k << '\n';
      return 0;
    }
  }
  return 0;
}
