Go: package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"strconv"
	"strings"
)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	for scanner.Scan() {
		buf0 := strings.Split(scanner.Text(), " ")
		input0 := make([]int, 2)
		for i := range input0 {
			input0[i], _ = strconv.Atoi(buf0[i])
		}
		if input0[0] == 0 && input0[1] == 0 {
			break
		}
		a, b := input0[0], input0[1]
		scanner.Scan()
		buf1 := strings.Split(scanner.Text(), " ")
		input1 := make([]int, 2)
		for i := range input1 {
			input1[i], _ = strconv.Atoi(buf1[i])
		}
		c, d := input1[0], input1[1]
		scanner.Scan()
		buf2 := strings.Split(scanner.Text(), " ")
		input2 := make([]int, 2)
		for i := range input2 {
			input2[i], _ = strconv.Atoi(buf2[i])
		}
		e, f := input2[0], input2[1]
		scanner.Scan()
		buf3 := strings.Split(scanner.Text(), " ")
		input3 := make([]int, 2)
		for i := range input3 {
			input3[i], _ = strconv.Atoi(buf3[i])
		}
		g, h := input3[0], input3[1]
		scanner.Scan()
		r, _ := strconv.Atoi(scanner.Text())
		if (a-g)*(a-g)+(b-h)*(b-h) <= r*r && (c-g)*(c-g)+(d-h)*(d-h) <= r*r && (e-g)*(e-g)+(f-h)*(f-h) <= r*r {
			fmt.Println("b")
		} else if dist(a, b, c, d, g, h) > float64(r)-0.000001 && dist(a, b, e, f, g, h) > float64(r)-0.000001 && dist(e, f, c, d, g, h) > float64(r)-0.000001 && inclusive(a, b, c, d, e, f, g, h) {
			fmt.Println("a")
		} else if CL_intersect(a, b, c, d, g, h, r) || CL_intersect(a, b, e, f, g, h, r) || CL_intersect(e, f, c, d, g, h, r) {
			fmt.Println("c")
		} else {
			fmt.Println("d")
		}
	}
}

func CL_intersect(ax, ay, bx, by, cx, cy, r int) bool {
	acx := cx - ax
	acy := cy - ay
	bcx := cx - bx
	bcy := cy - by
	abx := bx - ax
	aby := by - ay
	if acx*acx+acy*acy >= r*r || bcx*bcx+bcy*bcy >= r*r {
		if abx*acx+aby*acy < 0 {
			if acx*acx+acy*acy <= r*r {
				return true
			}
		} else {
			if abx*acx+aby*acy > abx*abx+aby*aby {
				if bcx*bcx+bcy*bcy <= r*r {
					return true
				}
			} else if acx*acx+acy*acy-(abx*acx+aby*acy)*(abx*acx+aby*acy)/(abx*abx+aby*aby) <= r*r {
				return true
			}
		}
	}
	return false
}

func inclusive(ax, ay, bx, by, cx, cy, px, py int) bool {
	ok1 := true
	ok2 := true
	if (bx-ax)*(py-ay)-(px-ax)*(by-ay) < 0 {
		ok1 = false
	}
	if (bx-ax)*(py-ay)-(px-ax)*(by-ay) > 0 {
		ok2 = false
	}
	if (cx-bx)*(py-by)-(px-bx)*(cy-by) < 0 {
		ok1 = false
	}
	if (cx-bx)*(py-by)-(px-bx)*(cy-by) > 0 {
		ok2 = false
	}
	if (ax-cx)*(py-cy)-(px-cx)*(ay-cy) < 0 {
		ok1 = false
	}
	if (ax-cx)*(py-cy)-(px-cx)*(ay-cy) > 0 {
		ok2 = false
	}
	return ok1 || ok2
}

func dist(ax, ay, bx, by, px, py int) float64 {
	dx := float64(bx - ax)
	dy := float64(by - ay)
	A := float64(dx*dx + dy*dy)
	B := dx*float64(ax-px) + dy*float64(ay-py)
	t := -B / A
	if t < 0 {
		t = 0
	}
	if t > 1 {
		t = 1
	}
	tx := float64(ax) + dx*t
	ty := float64(ay) + dy*t
	return math.Sqrt((float64(px)-tx)*(float64(px)-tx) + (float64(py)-ty)*(float64(py)-ty))
}

C++: #include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <bitset>
#include <queue>
#include <stack>
#include <utility>
#include <complex>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cctype>
using namespace std;
 
#define rep(i,n) for(int i=0; i<n; i++)
#define repa(i,s,e) for(int i=s; i<=e; i++)
#define repd(i,s,e) for(int i=s; i>=e; i--)

typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long long ll;

typedef complex<int> P;

int x, y, r;
P tri[3];
pair<P,int> circle;

int cross(P e1, P e2) {
	return e1.real() * e2.imag() - e1.imag() * e2.real();
}

bool inc() {
	P e0 = tri[0] - circle.first;
	P e1 = tri[1] - circle.first;
	P e2 = tri[2] - circle.first;
	int d0 = cross(e0, e1);
	int d1 = cross(e1, e2);
	int d2 = cross(e2, e0);
	if(d0 * d1 >= 0 && d1 * d2 >= 0 && d2 * d0 >= 0) return true;
	return false;
}

int norm2(P p) {
	return p.real() * p.real() + p.imag() * p.imag();
}

void dist2(P p1, P p2, P p, int& nm, int& de) {
	int a = p2.imag() - p1.imag();
	int b = -(p2.real() - p1.real());
	int c = - a * p1.real() - b * p1.imag();
	nm = a * p.real() + b * p.imag() + c;
	nm = nm * nm;
	de = a * a + b * b;
	if(de == 0) {
		nm = norm2(p1 - p);
		de = 1;
	}
}


void solve() {
	bool iscin = inc();
	int r2 = circle.second * circle.second;
	vector<pii> d(6);
	dist2(tri[0], tri[1], circle.first, d[0].first, d[0].second);
	dist2(tri[1], tri[2], circle.first, d[1].first, d[1].second);
	dist2(tri[2], tri[0], circle.first, d[2].first, d[2].second);
	if(iscin && (d[0].first >= r2 * d[0].second) &&
		        (d[1].first >= r2 * d[1].second) &&
		        (d[2].first >= r2 * d[2].second)) {
		cout << "a" << endl;
		return;
	}

	d[3].first = norm2(tri[0] - circle.first); d[3].second = 1;
	d[4].first = norm2(tri[1] - circle.first); d[4].second = 1;
	d[5].first = norm2(tri[2] - circle.first); d[5].second = 1;
	if(d[3].first <= r2 && d[4].first <= r2 && d[5].first <= r2) {
		cout << "b" << endl;
		return;
	}

	bool inter = false;
	rep(i,6) {
		if(d[i].first <= r2 * d[i].second) {
			inter = true;
			break;
		}
	}

	if(inter) {
		cout << "c" << endl;
		return;
	}

	cout << "d" << endl;
}

int main() {
	while( 1 ) {
		scanf("%d%d", &x, &y);
		if(x == 0 && y == 0) break;
		tri[0] = P(x, y);

		scanf("%d%d", &x, &y);
		tri[1] = P(x, y);
		
		scanf("%d%d", &x, &y);
		tri[2] = P(x, y);
		
		scanf("%d%d%d", &x, &y, &r);
		circle.first = P(x, y);
		circle.second = r;

		solve();
	}
}

C++: #include <iostream>
#include <complex>
#include <cmath>
using namespace std;

#define rep(i, n) for(int i = 0; i < n; i++)
typedef complex<double> xy_t;
typedef pair<xy_t, xy_t> line;
const double EPS = 1e-12;

double cross(const xy_t &a, const xy_t &b){
  return imag(conj(a) * b);
}

double dot(const xy_t &a, const xy_t &b){
  return real(conj(a) * b);
}

xy_t projection(const line &l, const xy_t &p){
  double t = dot(l.second - l.first, p - l.first) / norm(l.second - l.first);
  return l.first + t * (l.second - l.first);
}

bool intersectSP(const line &l, const xy_t &p){
  return abs(p - l.first) + abs(p - l.second) < abs(l.first - l.second) + EPS;
}

double distanceSP(const line &l, const xy_t &p){
  xy_t r = projection(l, p);
  if(intersectSP(l, r)) return abs(r - p);
  else return min(abs(l.first - p), abs(l.second - p));
}

int ccw(xy_t a, xy_t b, xy_t c){
  b -= a, c -= a;
  if(cross(b, c) > 0) return 1;
  if(cross(b, c) < 0) return -1;
  if(dot(b, c) < 0) return 2;
  if(norm(b) < norm(c)) return -2;
  return 0;
}
 
xy_t p[3];
line l[3];
xy_t c;
double r;


int main(){
  int x, y;
  int c1, c2;
  while(cin >> x>> y && (x || y)){
    p[0] = xy_t(x, y);
    for(int i = 1; i < 3; i++) {
      cin >> x >> y;
      p[i] = xy_t(x, y);
    }
    cin >> x >> y;
    cin >> r;
    c = xy_t(x, y);
    
    rep(i, 3) l[i] = line(p[i], p[(i+1)%3]);
    c1 = 0, c2 = 0;
    int cnt = 0;

    rep(i, 3){
      int d = ccw(p[i], p[(i+1)%3], c);
      if(d > 0) c1++;
      if(d < 0) c2++;
    }
    bool circle_in[3];
    rep(i, 3){
      if(distanceSP(l[i], c) < r + EPS) cnt++;
      if(distanceSP(l[i], c) > r - EPS){
	circle_in[i] = true;
      }else{
	circle_in[i] = false;
      }
    }
    
    bool t_in[3];
    rep(i, 3){
      if(abs(c - p[i]) < r + EPS){
	t_in[i] = true;
	cnt++;
      }else{
	t_in[i] = false;
      }
    }
    if(circle_in[0] && circle_in[1] && circle_in[2] && max(c1, c2) == 3){
      cout << 'a' << endl;
    }else if(t_in[0] && t_in[1] && t_in[2]) {
      cout << 'b' << endl;
    }else if(cnt > 0){
      cout << 'c' << endl;
    }else{
      cout << 'd' << endl;
    }
  }
  return 0;
}