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 <bits/stdc++.h>
using namespace std;

typedef complex<double> P;

const double eps = 0;//1e-8;

struct C {
  P p;
  double r;
  C() : p(P(0,0)), r(0) {}
  C(P p, double r) : p(p), r(r) {}
};

double cross(P a, P b) {
  return a.real()*b.imag() - a.imag()*b.real();
}

double dot(P a, P b) {
  return a.real()*b.real() + a.imag()*b.imag();
}

int ccw(P p, P a, P b) {
  a -= p;
  b -= p;
  if(cross(a,b) > eps) return 1;
  if(cross(a,b) < -eps) return -1;
  if(dot(a,b) < -eps) return 2;
  if(norm(b)-norm(a) > eps) return -2;
  return 0;
}

double getDistanceLP(P s1, P s2, P p) {
  return abs(cross(s2-s1,p-s1))/abs(s2-s1);
}

double getDistanceSP(P s1, P s2, P p) {
  if(dot(s2-s1, p-s1) < 0.0) return abs(p-s1);
  if(dot(s1-s2, p-s2) < 0.0) return abs(p-s2);
  return getDistanceLP(s1, s2, p);
}

bool involve(const C &c, const P &s1, const P &s2) {
  double dist = max(abs(c.p - s1), abs(c.p - s2));
  return c.r - dist > -eps;
}

bool involve(const vector<P> &g, const C &c) {
  int n = g.size();
  for(int i = 0; i < n; ++i) {
    P a = g[i], b = g[(i+1)%n];
    double dist = getDistanceLP(a,b,c.p);
    if(cross(b-a, c.p-a) > eps && dist - c.r > -eps) {
    } else {
      return false;
    }
  }
  return true;
}

bool involve(const C &c, const vector<P> &g) {
  int n = g.size();
  for(int i = 0; i < n; ++i) {
    P a = g[i], b = g[(i+1)%n];
    if(!involve(c, a, b)) return false;
  }
  return true;
}

bool isIntersect(const P &s1, const P &s2, const C &c) {
  if(involve(c, s1, s2)) return false;
  double dist = getDistanceSP(s1, s2, c.p);
  return c.r - dist > eps;
}

bool isIntersect(const vector<P> &g, const C &c) {
  int n = g.size();
  for(int i = 0; i < n; ++i) {
    P a = g[i], b = g[(i+1)%n];
    if(isIntersect(a,b,c)) return true;
  }
  return false;
}

int main() {
  vector<P> g(3);
  C c;
  while(1) {
    for(int i = 0; i < g.size(); ++i) {
      cin >> g[i].real() >> g[i].imag();
      if(g[0].real() == 0 && g[0].imag() == 0) return 0;
    }
    cin >> c.p.real() >> c.p.imag();
    cin >> c.r;
    if(involve(g,c)) cout << "a" << endl;
    else if(involve(c,g)) cout << "b" << endl;
    else if(isIntersect(g,c)) cout << "c" << endl;
    else cout << "d" << endl;
  }
  return 0;
}

C++: #include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <cstring>
#include <deque>
#include <cstdio>
#include <cmath>
#include <complex>
#include <iostream>
#include <iterator>

using namespace std;

#define reep(i,f,t) for(int i=f ; i<int(t) ; ++i)
#define rep(i,n) reep(i, 0, n) 

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

typedef vector<double> vd;
typedef vector<vd> vvd;

const double EPS = 1e-8;
const double INF = 1e12;

// ½ÊãÌ_ExNg
typedef complex<double> P;
namespace std{
	bool operator< (const P& a, const P& b){
		return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);
	}
}

// OÏ
double cross(const P& a, const P& b){
	return imag(conj(a)*b);
}

// àÏ
double dot(const P& a, const P& b){
	return real(conj(a)*b);
}

// ¼ü
struct L : public vector<P> {
	L(const P &a, const P &b){
		push_back(a);
		push_back(b);
	}
};

// ½p`
typedef vector<P> G;

// ~
struct C{
	P p;
	double r;
	C(const P& p, double r) : p(p), r(r) {}
};

int ccw(P a, P b, P c)
{
	b -= a;
	c -= a;
	if(cross(b, c) > 0)   return +1; // ½vñè
	if(cross(b, c) < 0)   return -1; // vñè
	if(dot(b, c) < 0)     return +2; // c--a--b
	if(norm(b) < norm(c)) return -2; // a--b--c
	return 0;
}

// üªÆ_Ìð·»è
bool intersectSP(const L& s, const P& p){
	return abs(s[0]-p) + abs(s[1]-p) - abs(s[1]-s[0]) < EPS;
}

// ¼üãÌ_ÌËe
P projection(const L& l, const P& p){
	double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);
	return l[0] + t*(l[0]-l[1]);
}

// üªÆ_Ì£
double distanceSP(const L& s, const P& p){
	const P r = projection(s, p);
	if(intersectSP(s, r)) return abs(r - p);
	return min(abs(s[0]-p), abs(s[1]-p));
}

char detect(const G& tri, const C& c)
{
	bool inner[3];
	rep(i, 3){
		inner[i] = abs(tri[i] - c.p) - EPS <= c.r;
	}
	if(inner[0] && inner[1] && inner[2])
		return 'b';
	if(inner[0] || inner[1] || inner[2])
		return 'c';
	
	rep(i, 3){
		L l(tri[i], tri[(i+1)%3]);
		if(distanceSP(l, c.p) - EPS <= c.r)
			return 'c';
	}
	
	int v = 0;
	rep(i, 3){
		int now = ccw(tri[i], tri[(i+1)%3], c.p);
		if(abs(now) == 2 || now * v < 0)
			return 'd';
		v = now;
	}
	
	return 'a';
}

int main()
{
	for(;;){
		G tri(3);
		rep(i, 3){
			scanf("%lf%lf", &tri[i].real(), &tri[i].imag());
			if(fabs(tri[i].real()) < EPS)
				break;
		}
		if(fabs(tri[0].real()) < EPS)
			break;
		
		P p;
		double r;
		scanf("%lf%lf%lf", &p.real(), &p.imag(), &r);
		printf("%c\n", detect(tri, C(p, r)));
	}

	return 0;
}