import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.TreeSet;

public class Main {
	public static void main(String[] args) {
		new Main().run();
	}
	
	void f(long[][] query,long[] ans) {
		int N=ans.length;
		class State implements Comparable<State> {
			long pos;
			long height;
			public State(long pos,long height) {
				this.pos=pos;
				this.height=height;
			}
			public int compareTo(State o) {
				return Long.compare(pos, o.pos);
			};
		}
		TreeSet<State> tree=new TreeSet<>();
		tree.add(new State(0, 99999));
		tree.add(new State(99999,0));
		for (int i=0;i<N;++i) {
			State add=new State(query[i][0],query[i][1]);
			if (tree.ceiling(add).height>=add.height) continue;
			while (tree.floor(add).height<=add.height) {
				State rm=tree.floor(add);
				tree.remove(rm);
				ans[i]-=(rm.pos-tree.floor(rm).pos)*(rm.height-tree.ceiling(rm).height);
			}
			long gain=(query[i][0]-tree.floor(add).pos)*(query[i][1]-tree.ceiling(add).height);
			ans[i]+=gain;
			tree.add(add);
		}
	}
	
	void run() {
		FastScanner sc=new FastScanner();
		int N=sc.nextInt();
		long[] ans=new long[N];
		long[][] v1=new long[N][2];
		long[][] v2=new long[N][2];
		long[][] in=new long[N][2];
		for (int i=0;i<N;++i) {
			v2[i][0]=sc.nextLong();
			v2[i][1]=sc.nextLong();
			v1[i][0]=sc.nextLong();
			v1[i][1]=sc.nextLong();
		}
		for (int s0=-1;s0<=1;s0+=2) {
			for (int s1=-1;s1<=1;s1+=2) {
				for (int i=0;i<N;++i) {
					if (s0==1) {
						in[i][0]=v1[i][0];
					} else {
						in[i][0]=-v2[i][0];
					}
					if (s1==1) {
						in[i][1]=v1[i][1];
					} else {
						in[i][1]=-v2[i][1];
					}
				}
				f(in, ans);
			}
		}
		PrintWriter pw=new PrintWriter(System.out);
		for (int i=0;i<N;++i) {
			pw.println(ans[i]);
		}
		pw.flush();
	}

	void tr(Object...o) {System.out.println(Arrays.deepToString(o));}
}

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
        	ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    
    public double nextDouble() { return Double.parseDouble(next());}
}