awfafg

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
    int n, min=10000000, ans;
    cin  >> n;
    vector <pair <int, int>> a(n);
    for (int i = 0; i<n; i++) {
        int x1, x2;
        cin >> x1 >> x2;
        a[i]= {x1, x2};
    }
    sort(a.begin(), a.end());
    vector <int> p(n);
    int cnt=0;
    for (auto c : a) {
        p[cnt]=c.first;
        cnt++;
    }
    for (int i = 0; i<n-1; i++) {
        if (p[i+1]-p[i]<min) min=p[i+1]-p[i];
    }
    for (int i = 0; i<n-1; i++) {
        if (p[i+1]-p[i]==min) ans=a[i].second+a[i+1].second;
    } cout << ans;
}