#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
#include <queue>
#include <stack>
#include <functional>
#include <map>
#include <set>
#include <bitset>
#include <ctime>
#include <cassert>
#include <complex>

const int INF = 0x3f3f3f3f;
const long long INFLL = 0x3f3f3f3f3f3f3f3fll;
#define memset0(x) memset(x, 0, sizeof(x))
#define memsetM1(x) memset(x, -1, sizeof(x))
#define memsetINF(x) memset(x, INF, sizeof(x))

using namespace std;

using ll = long long;
ll cross(ll x1, ll y1, ll x2, ll y2)
{
	return x1 * y2 - x2 * y1;
}

bool judge(const pair<int, int>& p1, const pair<int, int>& p2, const pair<int, int>& p3)
{
	auto p12x = p2.first - p1.first;
	auto p12y = p2.second - p1.second;
	auto p23x = p3.first - p2.first;
	auto p23y = p3.second - p2.second;
	return cross(p12x, p12y, p23x, p23y) <= 0;
}

double getY(int x, const pair<int, int>& a, const pair<int, int> b)
{
	double k = (b.second - a.second) / (b.first - a.first);
	return k * (x - a.first) + a.second;
}

int main()
{
	int n;
	cin >> n;
	vector<int> l(n), r(n);
	for (auto& i : l)
	{
		cin >> i;
	}
	for (auto& i : r)
	{
		cin >> i;
	}
	vector<pair<int, int>> points(n);
	int pIndex = 0;
	for (int i = 0; i < n; i++)
	{
		while (pIndex >= 2 && judge(points[pIndex - 2], points[pIndex - 1], { i, r[i] }))
		{
			pIndex--;
		}
		points[pIndex++] = { i, r[i] };
	}
	int sIndex = 0;
	bool hasAns = true;
	for (int i = 0; i < n; i++)
	{
		if (points[sIndex + 1].first < i)
		{
			sIndex++;
		}
		double y = getY(i, points[sIndex], points[sIndex + 1]);
		if (y < l[i])
		{
			hasAns = false;
			break;
		}
	}
	if (hasAns)
	{
		cout << "Yes" << endl;
	}
	else
	{
		cout << "No" << endl;
	}
	return 0;
}