#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
#define INF 1000000010
#define EPS 1e-9
#define F first
#define S second

#define debug(x) cout<<x<<endl;
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define lp(i,n) repi(i,0,n)
#define repn(i,n) for(int i=n;i>=0;i--)
#define int long long
#define endl "\n"

typedef pair<int,int> PII;
typedef pair<int,string> PIS;
typedef pair<string,int> PSI;


signed main(){
  cin.tie(0);	
  ios::sync_with_stdio(false);
  int n;
  cin>>n;
  int a[n],b[n];
  rep(i,n) cin>>a[i];
  rep(i,n) cin>>b[i];
  int ans=0;
  int mx=0;
  rep(i,n){
    mx=max(mx,a[i]);
    ans=max(ans,mx*b[i]);
    cout<<ans<<endl;
  }
  

  return 0;
}

#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;

int main() {
  int n;
  cin >> n;
  vector<P> x(n);
  bool ok = false;
  rep(i, n) cin >> x[i].first >> x[i].second;
  for (int i = 0; i < n; i++) {
    for (int j = i+1; j < n; j++) {
      for (int k = j+1; k < n; k++) {
        P a = P(x[i].first-x[j].first, x[i].second-x[j].second);
        P b = P(x[i].first-x[k].first, x[i].second-x[k].second);
        if (a.first*b.second == a.second*b.first) {
          ok = true;
          break;
        }
      }
    }
  }
  if (ok) cout << "Yes" << endl;
  else cout << "No" << endl;
  return 0;
}