#include <iostream>
#include <vector>
#include <map>
#include <stack>
#include <list>
#include <queue>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <math.h>

#define DEBUG 0
#define NITENKAN(a, b) sqrt(((a.first - b.first) * (a.first - b.first)) + ((a.second - b.second) * (a.second - b.second)))

using namespace std;

bool checkFound(pair<double, double> taro, pair<double, double> oni, pair<pair<double, double>, double> syougai){
	double ac = NITENKAN(syougai.first, oni);
	double ab = NITENKAN(taro, oni);
	double bc = NITENKAN(syougai.first, taro);

	double SOnaiseki =  (taro.first - oni.first) * (syougai.first.first - oni.first) + (taro.second - oni.second) * (syougai.first.second - oni.second);
	double TOnaiseki =  (oni.first - taro.first) * (syougai.first.first - taro.first) + (oni.second - taro.second) * (syougai.first.second - taro.second);
	double SOcosSita = SOnaiseki / (ab * ac);
	double TOcosSita = TOnaiseki / (ab * bc);
	
	if(SOcosSita < 0 || TOcosSita < 0){
		return true;
	}
	//垂線部分の高さ成分
	double SOt = SOnaiseki / (ab * ab);//ac * (1 - cosSita);//(sita * 3.14 / 180.0));
	double TOt = TOnaiseki / (ab * ab);//ac * (1 - cosSita);//(sita * 3.14 / 180.0));
	double SOhc = ac - (SOt * ab);
	double TOhc = bc - (TOt * ab);
	double gaiseki = (syougai.first.first - oni.first) * (taro.second - oni.second) - (taro.first - oni.first) * (syougai.first.second - oni.second);
	double hc = gaiseki / ab;

#if DEBUG
	cout << "SOcosSita1 : " << SOcosSita << endl;
	cout << "TOcosSita2 : " << TOcosSita << endl;
	cout << "SOt : " << SOt << endl;
	cout << "TOt : " << TOt << endl;
	cout << "syougai.second : " << syougai.second << endl;
	cout << "SOhc : " << SOhc << endl;
	cout << "TOhc : " << TOhc << endl;
	cout << "gaiseki : " << gaiseki << endl;
	cout << "hc : " << hc << endl;
#endif
	if(hc < 0) hc *= -1;

	if(hc >= syougai.second){
		return true;
	}
	else{
		return false;
	}
}

int main(){
	int n = 0;

	while(cin >> n && n != 0){
		int m = 0;
		bool danger = false;
		vector<pair<pair<double, double>, double> > syougai(n);

		for(int i = 0; i < n; i++){
			cin >> syougai[i].first.first >> syougai[i].first.second >> syougai[i].second;
		}
		
		cin >> m;
		vector<pair<double, double> > taro(m);
		vector<pair<double, double> > oni(m);
		for(int j = 0; j < m; j++){
			//cinと比較、結果出力を書く
			cin >> taro[j].first >> taro[j].second >> oni[j].first >> oni[j].second;

			//太郎と鬼の現在位置における各障害物の影響を見る
			for(int l = 0; l < n; l++){
				//二人共円内
				if((NITENKAN(taro[j], syougai[l].first) < syougai[l].second) && (NITENKAN(oni[j], syougai[l].first) < syougai[l].second)){
					/*//円内に円がある可能性があるので他の障害物の影響を見る
					for(int a = l + 1; a < n; a++){
						danger = checkFound(taro[j], oni[j], syougai[a]);
						//障害物により安全とわかった段階で抜ける
						if(!danger){
							break;
						}
					}
					*/
					danger = true;
				}
				//二人共円外
				else if((NITENKAN(taro[j], syougai[l].first) > syougai[l].second) &&  (NITENKAN(oni[j], syougai[l].first) > syougai[l].second)){
					danger = checkFound(taro[j], oni[j], syougai[l]);
				}
				else{
					danger = false;
				}
				if(!danger){
					break;		
				}
			}

			if(!danger){
				cout << "Safe" << endl;
			}
			else{
				cout << "Danger" << endl;
			}

		}
	}
}