#include<stdio.h>
#include<algorithm>
using namespace std;
struct xy {int x, y;}a[121];
bool sort_x(xy a, xy b) {
if (a.x != b.x)return a.x < b.x;
return a.y < b.y;
}
int main() {
int n, i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d%d", &a[i].x, &a[i].y);
sort(a, a + n, sort_x);
int ET = 0;
for (i = 0; i < n; i++) {
if (ET < a[i].x)ET = a[i].x;
ET += a[i].y;
}
printf("%d", ET);
return 0;
}
I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGU8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwpzdHJ1Y3QgeHkge2ludCB4LCB5O31hWzEyMV07CmJvb2wgc29ydF94KHh5IGEsIHh5IGIpIHsKCWlmIChhLnggIT0gYi54KXJldHVybiBhLnggPCBiLng7CglyZXR1cm4gYS55IDwgYi55Owp9CmludCBtYWluKCkgewoJaW50IG4sIGksIGo7CglzY2FuZigiJWQiLCAmbik7Cglmb3IgKGkgPSAwOyBpIDwgbjsgaSsrKSBzY2FuZigiJWQlZCIsICZhW2ldLngsICZhW2ldLnkpOwoJc29ydChhLCBhICsgbiwgc29ydF94KTsKCWludCBFVCA9IDA7Cglmb3IgKGkgPSAwOyBpIDwgbjsgaSsrKSB7CgkJaWYgKEVUIDwgYVtpXS54KUVUID0gYVtpXS54OwoJCUVUICs9IGFbaV0ueTsKCX0KCXByaW50ZigiJWQiLCBFVCk7CglyZXR1cm4gMDsKfQ==