#include #include namespace neguse {} using namespace std; using namespace atcoder; using namespace neguse; typedef long long ll; typedef long double ld; typedef pair pii; typedef pair pll; typedef vector vi; typedef vector vll; typedef vector vld; typedef vector vvi; typedef vector vvll; typedef vector vs; typedef vector vpii; typedef vector vpll; #define _overload3(_1,_2,_3,name,...) name #define _rep(i,n) repi(i,0,n) #define repi(i,a,b) for(int i=int(a);iint(b);--i) #define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep)(__VA_ARGS__) #define _each1(i,v) for(auto& i:v) #define _each2(i,j,v) for(auto& [i,j]:v) #define each(...) _overload3(__VA_ARGS__,_each2,_each1,)(__VA_ARGS__) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() #define SORT(x) sort(all(x)) #define RSORT(x) sort(rall(x)) #define REVERSE(x) reverse(all(x)) #define dump(x) cerr << #x << " = " << (x) << '\n' #define print(x) cout << (x) << '\n' #define yes(f) cout << ((f) ? "Yes" : "No") << '\n' #define ge(v, x) (int)(lower_bound(all(v), x) - v.begin()) #define gt(v, x) (int)(upper_bound(all(v), x) - v.begin()) #define le(v, x) (int)(upper_bound(all(v), x) - v.begin())-1 #define lt(v, x) (int)(lower_bound(all(v), x) - v.begin())-1 templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b istream& operator>>(istream& is, vector& vec) { for (T& x : vec) is >> x; return is; } template ostream& operator<<(ostream& os, const vector& vec) { for (const T& x : vec) os << x << ' '; return os; } using namespace neguse; int main() { int a, b, c, d; cin >> a >> b >> c >> d; int ans = 1e9; if (a != 0) chmin(ans, c / a); if (b != 0) chmin(ans, d / b); cout << ans << endl; return 0; }