#include <iostream>
#include <stack>
#include <algorithm>
using namespace std;
const int N = 100010;
int n,m;
struct node
{
int l,r;
bool operator < (const node & W) const
{
if(l!=W.l) return l<W.l;
else return r<W.r;
}
}a[N];
int main()
{
int n;
cin>>n;
for(int i = 1 ; i <= n ; i ++) cin>>a[i].l>>a[i].r;
sort(a+1,a+1+n);
double wait = 0;
int now = a[1].l+a[1].r;
for(int i = 2 ; i <= n ; i ++)
{
if(now<=a[i].l)
{
now = a[i].l+a[i].r;
}
else
{
wait += now - a[i].l;
now = now + a[i].r;
}
}
printf("%.2f",wait/n);
}