#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <iostream>
#include <fstream>
#include <queue>
 
#define rep(i, l, r) for(int i = l; i <= r; i++)
#define down(i, l, r) for(int i = l; i >= r; i--)
#define MS 234567
#define MAX 1037471823
 
using namespace std;
 
int n, am, as, x, y, a, b, k[MS], t[MS], d[MS], q;
 
void Build(int o, int l, int r)
{
	if (l != r)
	{
		Build(o*2, l, (l+r)/2); Build(o*2+1, (l+r)/2+1, r);
		k[o] = max(k[o*2], k[o*2+1]);
	}
	else k[o] = d[l];
}
 
void Q(int o, int l, int r)
{
	if (l == r && (x >= t[l] || t[r] >= y)) return;
	if (x < t[l] && t[r] < y) { as += r-l+1; am = max(am, k[o]); return; }
	if (x <= t[(l+r)/2]) Q(o*2, l, (l+r)/2);
	if (y > t[(l+r)/2]) Q(o*2+1, (l+r)/2+1, r);
}
 
int QP(int x)
{
	int l = 1, r = n;
	while (l != r)
	{
		if (x <= t[(l+r)/2]) r = (l+r)/2; else l = (l+r)/2+1;
	}
	if (x != t[l]) return 0; else return l;
}
 
int main()
{
	scanf("%d", &n);
	rep(i, 1, n) scanf("%d%d", &t[i], &d[i]); Build(1, 1, n);
	scanf("%d", &q);
	rep(i, 1, q) 
	{
		scanf("%d%d", &x, &y);
		if (x > y) { printf("false\n"); continue; }
		if (x == y) { printf("maybe\n"); continue; }
		as = am = 0; Q(1, 1, n); a = QP(x); b = QP(y);
		if (a != 0 && b != 0 && d[a] >= d[b] && am < d[b] && as == y-x-1) printf("true\n");
		else if ((a != 0 && b != 0 && d[a] < d[b]) || (b != 0 && am >= d[b]) || (a != 0 && d[a] <= am)) printf("false\n"); 
		else printf("maybe\n");
	}
	return 0;
}

I2luY2x1ZGUgPGNzdHJpbmc+CiNpbmNsdWRlIDxjbWF0aD4KI2luY2x1ZGUgPGFsZ29yaXRobT4KI2luY2x1ZGUgPGNzdGRsaWI+CiNpbmNsdWRlIDxjc3RkaW8+CiNpbmNsdWRlIDxpb3N0cmVhbT4KI2luY2x1ZGUgPGZzdHJlYW0+CiNpbmNsdWRlIDxxdWV1ZT4KCiNkZWZpbmUgcmVwKGksIGwsIHIpIGZvcihpbnQgaSA9IGw7IGkgPD0gcjsgaSsrKQojZGVmaW5lIGRvd24oaSwgbCwgcikgZm9yKGludCBpID0gbDsgaSA+PSByOyBpLS0pCiNkZWZpbmUgTVMgMjM0NTY3CiNkZWZpbmUgTUFYIDEwMzc0NzE4MjMKCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbiwgYW0sIGFzLCB4LCB5LCBhLCBiLCBrW01TXSwgdFtNU10sIGRbTVNdLCBxOwoKdm9pZCBCdWlsZChpbnQgbywgaW50IGwsIGludCByKQp7CglpZiAobCAhPSByKQoJewoJCUJ1aWxkKG8qMiwgbCwgKGwrcikvMik7IEJ1aWxkKG8qMisxLCAobCtyKS8yKzEsIHIpOwoJCWtbb10gPSBtYXgoa1tvKjJdLCBrW28qMisxXSk7Cgl9CgllbHNlIGtbb10gPSBkW2xdOwp9Cgp2b2lkIFEoaW50IG8sIGludCBsLCBpbnQgcikKewoJaWYgKGwgPT0gciAmJiAoeCA+PSB0W2xdIHx8IHRbcl0gPj0geSkpIHJldHVybjsKCWlmICh4IDwgdFtsXSAmJiB0W3JdIDwgeSkgeyBhcyArPSByLWwrMTsgYW0gPSBtYXgoYW0sIGtbb10pOyByZXR1cm47IH0KCWlmICh4IDw9IHRbKGwrcikvMl0pIFEobyoyLCBsLCAobCtyKS8yKTsKCWlmICh5ID4gdFsobCtyKS8yXSkgUShvKjIrMSwgKGwrcikvMisxLCByKTsKfQoKaW50IFFQKGludCB4KQp7CglpbnQgbCA9IDEsIHIgPSBuOwoJd2hpbGUgKGwgIT0gcikKCXsKCQlpZiAoeCA8PSB0WyhsK3IpLzJdKSByID0gKGwrcikvMjsgZWxzZSBsID0gKGwrcikvMisxOwoJfQoJaWYgKHggIT0gdFtsXSkgcmV0dXJuIDA7IGVsc2UgcmV0dXJuIGw7Cn0KCmludCBtYWluKCkKewoJc2NhbmYoIiVkIiwgJm4pOwoJcmVwKGksIDEsIG4pIHNjYW5mKCIlZCVkIiwgJnRbaV0sICZkW2ldKTsgQnVpbGQoMSwgMSwgbik7CglzY2FuZigiJWQiLCAmcSk7CglyZXAoaSwgMSwgcSkgCgl7CgkJc2NhbmYoIiVkJWQiLCAmeCwgJnkpOwoJCWlmICh4ID4geSkgeyBwcmludGYoImZhbHNlXG4iKTsgY29udGludWU7IH0KCQlpZiAoeCA9PSB5KSB7IHByaW50ZigibWF5YmVcbiIpOyBjb250aW51ZTsgfQoJCWFzID0gYW0gPSAwOyBRKDEsIDEsIG4pOyBhID0gUVAoeCk7IGIgPSBRUCh5KTsKCQlpZiAoYSAhPSAwICYmIGIgIT0gMCAmJiBkW2FdID49IGRbYl0gJiYgYW0gPCBkW2JdICYmIGFzID09IHkteC0xKSBwcmludGYoInRydWVcbiIpOwoJCWVsc2UgaWYgKChhICE9IDAgJiYgYiAhPSAwICYmIGRbYV0gPCBkW2JdKSB8fCAoYiAhPSAwICYmIGFtID49IGRbYl0pIHx8IChhICE9IDAgJiYgZFthXSA8PSBhbSkpIHByaW50ZigiZmFsc2VcbiIpOyAKCQllbHNlIHByaW50ZigibWF5YmVcbiIpOwoJfQoJcmV0dXJuIDA7Cn0=

NgoyMDAyIDQ5MjAKMjAwMyA1OTAxCjIwMDQgMjgzMgoyMDA1IDM4OTAKMjAwNyA1NjA5CjIwMDggMzAyNAo1CjIwMDIgMjAwNQoyMDAzIDIwMDUKMjAwMiAyMDA3CjIwMDMgMjAwNwoyMDA1IDIwMDg=

6
2002 4920
2003 5901
2004 2832
2005 3890
2007 5609
2008 3024
5
2002 2005
2003 2005
2002 2007
2003 2007
2005 2008