#include <bits/stdc++.h>

using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b)    for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n)       For(i, 0, n)
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }

void coY() {cout <<"Yes"<<endl;}
void coN(){cout <<"No"<<endl;}
 
//Write From this Line


const int dy[] = {0,0,1,-1};
const int dx[] = {1,-1,0,0};
//const ll mod = 1e9+7;
//const ll mod = 998244353;
const double PI=3.14159265358979323846;
const int INF = 1001001001;
int main()
{
	int n;
	cin >> n;
	vector<int> a(n);
	rep(i, n)cin>>a[i];
	vector<int> b(n);
	rep(i, n)cin>>b[i];
	// a君は，勝つことが出来るものの内最小のものを出せばいい．
	SORT(a);
	int ans = 0;
	// bは順番が決まっている．
	multiset<int> s;
	rep(i,n){
		s.insert(b[i]);
		auto it = s.lower_bound(a[i]);

		int length = distance(s.begin(),it);
		//auto it = lower_bound(s.begin(),s.end(),a[i]);
		//int ind = (it - s.begin());
		//debug(ind);
		ans += length;
	}
	cout << ans << endl;
}