#include <iostream>
using namespace std;

const int MOD = 1000000007;
int main(){

    int m; cin >> m;
    int x[m], y[m];
    int64_t answer = 0;
    int best_x = 0;
    int best_y = 0;
    int64_t sum_x = 0;
    int64_t sum_y = 0;
    for(int i=0; i<m; i++){


        int val_x, val_y; cin >> val_x >> val_y;
        x[i] = val_x;
        y[i] = val_y;

        if(i==0){
            best_x = val_x;
            best_y = val_y;
        }

        bool calculate_again = false;

        sum_x += val_x;
        if( abs(sum_x - ((i+1)*best_x)) <= abs(sum_x - ((i+1)*val_x)) ){
                best_x = val_x;
                calculate_again = true;
        }

        sum_y += val_y;
        if( abs(sum_y - ((i+1)*best_y)) <= abs(sum_y - ((i+1)*val_y)) ){
                best_y = val_y;
                calculate_again = true;
        }
        if(calculate_again){
            answer = 0;
            for(int j=0; j<i; j++){
                answer += ( (abs(x[j] - best_x)) * (abs(y[j] - best_y)) );
                answer %= MOD;
            }

        }

        cout << (answer % MOD) << endl;

    }

}