// Arup Guha
// 7/21/2015
// Solution to 2010 UCF Fall Locals Problem: Shortcut

import java.util.*;

public class shortcut {

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);
		double[][] vals = getInput(stdin);
		int loop = 1;

		// Process each case.
		while (!zero(vals)) {

			// Get line segs.
			int n = stdin.nextInt();
			double[][] pts = new double[n+2][2];
			for (int i=1; i<=n; i++)
				for (int j=0; j<2; j++)
					pts[i][j] = stdin.nextDouble();
			pts[0] = Arrays.copyOf(vals[1],2);
			pts[n+1] = Arrays.copyOf(vals[2],2);

			// Evaluate both.
			double straight = getStraight(pts);
			double circle = getCircle(vals);
			//System.out.println(straight+" "+circle);

			// Output result.
			if (circle <= straight+1e-9)
				System.out.println("Case #"+loop+": Stick to the Circle.\n");
			else
				System.out.println("Case #"+loop+": Watch out for squirrels!\n");

			// Go to next case.
			loop++;
			vals = getInput(stdin);
		}
	}

	// Reads in the circle input for one case and returns it in a 2d double array.
	public static double[][] getInput(Scanner stdin) {
		double[][] inp = new double[3][2];
		for (int i=0; i<3; i++)
			for (int j=0; j<2; j++)
				inp[i][j] = stdin.nextDouble();
		return inp;
	}

	// Returns true iff each entry of arr is 0.
	public static boolean zero(double[][] arr) {
		for (int i=0; i<arr.length; i++)
			for (int j=0; j<arr[i].length; j++)
				if (Math.abs(arr[i][j]) > 1e-9)
					return false;
		return true;
	}

	// Sums and returns distance of each segment in adjacent pairs of pts.
	public static double getStraight(double[][] pts) {
		double res = 0;
		for (int i=0; i<pts.length-1; i++)
			res += dist(pts[i], pts[i+1]);
		return res;
	}

	// Returns the circle distance desired.
	public static double getCircle(double[][] vals) {

		// Need these distances and angles.
		double r = dist(vals[0], vals[1]);
		double angleStart = angle(vals[0], vals[1]);
		double angleEnd = angle(vals[0], vals[2]);

		// Always go counter-clockwise...it's in the directions.
		if (angleStart < angleEnd) return (angleEnd-angleStart)*r;
		return (2*Math.PI + angleEnd - angleStart)*r;
	}

	// Returns the distance between pt1 and pt2.
	public static double dist(double[] pt1, double[] pt2) {
		return Math.sqrt( Math.pow(pt1[0]-pt2[0],2) + Math.pow(pt1[1]-pt2[1],2) );
	}

	// Returns the angle from pt1 to pt2 as defined by atan2.
	public static double angle(double[] pt1, double[] pt2) {
		return Math.atan2(pt2[1]-pt1[1], pt2[0]-pt1[0]);
	}
}