/*#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")*/
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;

#define amen ;
#define vec vector
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define Str(x) to_string(x)
#define len(s) (int)s.size()
#define int long long
typedef long long ll;
typedef double d;
typedef long double lld;
typedef string str;
typedef unsigned long long ull;


main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    //  SLOW CODE
    int n;
    cin >> n;
    vector <pair<int, int> > v(n);
    vector <int> dp(n, 0);
    for (int i = 0; i < n;  i++)
    {
        cin >> v[i].first >> v[i].second;
    }
    sort(all(v));
    //reverse(all(v));
    for (int i = 0; i < n; i++)
    {
        int h = v[i].first, w = v[i].second;
        dp[i] = h * w + (i ? dp[i-1] : 0);
        for (int j = i - 1; j >= 0; j--)
        {
            dp[i] = min(dp[i], dp[j] + w * h);
            h = max(h, v[j].first);
            w = max(w, v[j].second);
        }
    }
    int ans = dp[n-1];
    fill(all(dp), 0);
    for (auto &it : v)
        swap(it.first, it.second);
    sort(all(v));
    for (int i = 0; i < n; i++)
    {
        int h = v[i].first, w = v[i].second;
        dp[i] = h * w + (i ? dp[i-1] : 0);
        for (int j = i - 1; j >= 0; j--)
        {
            dp[i] = min(dp[i], dp[j] + w * h);
            h = max(h, v[j].first);
            w = max(w, v[j].second);
        }
    }
    cout << min(ans, dp[n-1]);
    return 0;
}