#include <bits/stdc++.h>
using namespace std;
const int N = 200200;
const int mod = 1e9 + 7;
int n, a, b;
vector<int> q;
int main() {
  cin >> n >> a >> b;
  q.push_back(a);
  q.push_back(a);
  q.push_back(a);
  q.push_back(a);
  q.push_back(b);
  q.push_back(b);
  sort(q.begin(), q.end());
  int res = 1e9;
  do {
    int ans = 1, cur = n;
    for (int i = 0; i < q.size(); ++i)
      if (cur - q[i] >= 0)
        cur -= q[i];
      else
        ans++, cur = n - q[i];
    res = min(res, ans);
  } while (next_permutation(q.begin(), q.end()));
  cout << res;
  return 0;
}
