// Arup Guha
// 7/12/06
// Solution to BHCSI 2005 Practice Contest Question Doom

import java.util.*;
import java.io.*;

public class doom {
	
	// A doom object just represents a single circle from the problem.
	public int x;
	public int y;
	public int r;
	
	// Standard constructor.
	public doom(int myx, int myy, int myr) {
		x=myx;
		y=myy;
		r=myr;
	}
	
	public static void main(String[] args) throws IOException {
		
		Scanner fin = new Scanner(new File("doom.in"));
		
		// Read in the number of circles.
		int numcircles = fin.nextInt();
		
		// Allocate space to store all the circle information.
		doom[] allcircles = new doom[numcircles];
		
		// Read in all the circle information.
		for (int i=0; i<numcircles; i++) {
			int x = fin.nextInt();
			int y = fin.nextInt();
			int r = fin.nextInt();
			allcircles[i] = new doom(x,y,r);
		}
		
		int numsteps = fin.nextInt();
		
		// Process each step.
		for (int i=0; i<numsteps; i++) {
			
			int x = fin.nextInt();
			int y = fin.nextInt();
			
			// Print out the appropriate message based on whether
			// this step is within a circle or not.
			if (trapped(allcircles, x, y))
				System.out.println("You die here, Dr. Jones.");
			else
				System.out.println("Okie dokie, Dr. Jones.");
		}
		
	}
	
	// This method returns true if and only if (x,y) lies within one
	// of the circles stored in the circles array.
	public static boolean trapped(doom[] circles, int x, int y) {
		
		for (int i=0; i<circles.length; i++){
			if (Math.pow(circles[i].x-x,2)+Math.pow(circles[i].y-y,2) 
			    < Math.pow(circles[i].r,2) )
			    return true;
		}
		return false;
	}
}