#include using namespace std; #define inf INT_MAX #define INF LLONG_MAX #define ll long long #define ull unsigned long long #define M (int)(1e9+7) #define P pair #define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++) #define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--) #define rep(i,n) FOR(i,0,n) #define rrep(i,n) RFOR(i,n,0) #define all(a) a.begin(),a.end() const int vx[4] = {0,1,0,-1}; const int vy[4] = {1,0,-1,0}; #define F first #define S second #define PB push_back #define EB emplace_back #define int ll #define vi vector #define IP pair #define PI pair #define PP pair #define Yes(f){cout<<(f?"Yes":"No")<= 0 ? y % M : (M - (-y) % M) % M) {} Mint &operator+=(const Mint &p) { if((x += p.x) >= M) x -= M; return *this; } Mint &operator-=(const Mint &p) { if((x += M - p.x) >= M) x -= M; return *this; } Mint &operator*=(const Mint &p) { x = (int) (1LL * x * p.x % M); return *this; } Mint &operator/=(const Mint &p) { *this *= p.inverse(); return *this; } Mint operator-() const { return Mint(-x); } Mint operator+(const Mint &p) const { return Mint(*this) += p; } Mint operator-(const Mint &p) const { return Mint(*this) -= p; } Mint operator*(const Mint &p) const { return Mint(*this) *= p; } Mint operator/(const Mint &p) const { return Mint(*this) /= p; } bool operator==(const Mint &p) const { return x == p.x; } bool operator!=(const Mint &p) const { return x != p.x; } Mint inverse() const { int a = x, b = M, u = 1, v = 0, t; while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return Mint(u); } Mint power(int n) const { Mint ret(1), mul(x); while(n > 0) { if(n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const Mint &p) { return os << p.x; } friend istream &operator>>(istream &is, Mint &a) { int t; is >> t; a = Mint(t); return (is); } }; using mint = Mint; signed main(){ cin.tie(0); ios::sync_with_stdio(false); cout<>n; Mint ans=0; rep(i,n){ int c,d; cin>>c>>d; ans+=(((c+1)/2)%M)*(d%M); } cout<