#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define MV 200001
#define LMV 21
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define emp emplace
#define mp make_pair
#define ins insert
#define sz(x) (int)x.size()
#define whoami(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); whi(_it, args); }

void whi(istream_iterator<string> it) { cerr<<"\n"; }

template<typename T, typename... Args>
void whi(istream_iterator<string> it, T a, Args... args) { cerr<<*it<<" "<<a<<" "; whi(++it, args...); }

void FLASH() {ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}
void SETF() {cout.ios_base::setf(ios_base::fixed); cerr.ios_base::setf(ios_base::fixed);}
void UNSETF() {cout.ios_base::unsetf(ios_base::fixed); cerr.ios_base::unsetf(ios_base::fixed);}

typedef long long ll;
typedef long double ld;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<PII, int> PPII;
typedef pair<PLL, ll> PPLL;
typedef map<int, int> MII;

const int MOD = 1000000007;
const ll INF = 4e18;

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

struct h_llint {
  static uint64_t splitmix64(uint64_t x) {    // http://xorshift.di.unimi.it/splitmix64.c
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};

struct h_pair{
  size_t operator()(const PLL&x)const{
    return hash<ll>()(((ll)x.ff)^(((ll)x.ss)<<32));
  }
};

typedef map<ll, ll> MLL;
typedef map<PII, int> MPII;
typedef map<PLL, ll> MPLL;
typedef set<int> SI;
typedef set<ll> SL;
//ordered_set = order_of_key(.)
//ordered_set = find_by_order(.)
typedef ordered_set<int> OSI;
typedef ordered_set<ll> OSL;
typedef ordered_multiset<int> MOSI;
typedef ordered_multiset<ll> MOSL;
typedef unordered_map<ll, int, h_llint> UMLI;
typedef unordered_map<ll, ll, h_llint> UMLL;
typedef unordered_map<PLL, int, h_pair> UMPI;
typedef unordered_map<PLL, ll, h_pair> UMPL;

int ar[MV];
ll arr[MV];

void solve(int T)
{
	int n;
	cin>>n;
	ll zx = 1;
	for(ll i=2;i<=n;i++)
	zx = (zx * (i/__gcd(zx, i)));
	cout<<zx+1<<"\n";
	return;	
}

int main(void)
{
	FLASH();
	//freopen("cowjog.in", "r", stdin);
	//freopen("cowjog.out", "w", stdout);
	int T;
	T = 1;

#ifndef ONLINE_JUDGE
	time_t time_t1, time_t2;
	time_t1 = clock();
#endif

	//cin>>T;
	while(T--)
	solve(T);

#ifndef ONLINE_JUDGE
	time_t2 = clock();
	SETF();
	cerr<<"Time taken: "<<setprecision(7)<<(time_t2 - time_t1)/(double)CLOCKS_PER_SEC<<"\n";
	UNSETF();
#endif

	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<ll, ll>;
const ll INF = ll(1e18) + 5;
ll dp[int(1e5) * 2 + 5][2];

// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
int main() {
    ll N;
    cin >> N;
    vector<ll> maxV(N + 2, -INF);
    vector<ll> minV(N + 2, INF);
    rep(i, N) {
        ll X, C;
        cin >> X >> C;
        if (maxV[C] < X) {
            maxV[C] = X;
        }
        if (minV[C] > X) {
            minV[C] = X;
        }
    }

    maxV[N + 1] = 0;
    minV[N + 1] = 0;

    rep(i, N + 5) rep(j, 2) {
        dp[i][j] = INF;
    }
    dp[0][0] = 0;

    ll preMin = 0;
    ll preMax = 0;

    rep(i, N + 1) {
        if (maxV[i + 1] == -INF) {
            dp[i + 1][0] = dp[i][0];
            dp[i + 1][1] = dp[i][1];
            // cerr << "i= " << i << " dp[i+1][0]=" << dp[i + 1][0] << " dp[i+1][1]=" << dp[i + 1][1] << endl;
            continue;
        }
        ll cost = maxV[i + 1] - minV[i + 1];
        dp[i + 1][0] = min(dp[i][0] + abs(maxV[i + 1] - preMin) + cost, dp[i][1] + abs(maxV[i + 1] - preMax) + cost);
        dp[i + 1][1] = min(dp[i][0] + abs(minV[i + 1] - preMin) + cost, dp[i][1] + abs(minV[i + 1] - preMax) + cost);
        preMin = minV[i + 1];
        preMax = maxV[i + 1];
        // cerr << "i+1 =" << i + 1 << " dp[i+1][0]=" << dp[i + 1][0] << " dp[i+1][1]=" << dp[i + 1][1] << " cost=" << cost << endl;
    }

    cout << dp[N + 1][0] << endl;

    // Failed to predict input format
    return 0;
}
