/*                         اللهم لا سهل الا ما جعلته سهلا وانت تجعل الحزن ان شأت سهلا                           */
#include <iostream>
#include<cmath>
#include <sstream>
#include<algorithm>
#include<string>
#include<limits.h>
#include<list>
#include <iomanip>
#include<utility>
#include <cctype>
#include <vector>
#include <set>
#include<unordered_set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#define getline(s) getline(cin >> ws ,s)
#define ll long long
#define sz(s)   (int)(s.size())
const int M = 2 * 1e5 + 5;
#define PI 3.14159
#define ull unsigned long long
#define all(s) s.begin(), s.end()
#define Mod  1'000'000'007
#define to_binary(bin) stoll(bin, nullptr, 10)
#define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
//punshback;
// freopen("equal.in", "r", stdin);
/* #ifndef ONLINE_JUDGE
        freopen("machines.in", "r", stdin), freopen("standard output", "w", stdout);
 #endif*/
//    ll res = stoi(s) + stoi(m);
// t.erase(remove(t.begin(), t.end(), '0'), t.end());

using namespace std;
vector < ll > prime_factorization(ll n){
    vector < ll > factors;
    while(n % 2 == 0) factors.push_back(2), n /= 2;
    for(int i = 3; i <= sqrt(n); i += 2)
        while(n % i == 0) factors.push_back(i), n /= i;
    if(n > 2) factors.push_back(n);
    return factors;
}

int main() {
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    ll n, k, l, c, d, p, nl, np;
    cin >> n >> k >> l >> c >> d >> p >> nl >> np;
    ll tost = (k * l) / n;
    ll bottle = c * d;
    ll gram = p / np;
    ll mint = min({tost , bottle , gram}) / n;
    cout << mint;


    return 0;
}












//   string half = s.substr(0, s.length()/2);
//            string otherHalf = s.substr(s.length()/2);
//  if (ceil((double)sqrt(n)) == floor((double)sqrt(n))) {
//        cout << "perfect square";
//    }
// last digit % 10
//
// how to find second diagonal (i + j) == (n - 1)
// how to find main diaganol i == j
//
//cout << (mp.count(any number thar check is here or not ) ? "found\n" : "not found \n");
// vector < vector < int > > grid (n,vector<int>(m));
// cout<<fixed<<setprecision(6);
//transform(all(s), s.begin(), ::towlower);
//  std::next_permutation(s.begin(), s.end()) ;
//    test = min(test, 26 - test);
//     return  cout<<"NO",0 ;
//   if (i % 3 != 0 and i % 10 != 3)vec.push_back(i);
//        reverse(vec.begin() + m, vec.begin() + s + 1  );