// Decompiled by Jad v1.5.8e2. Copyright 2001 Pavel Kouznetsov.
// Jad home page: http://kpdus.tripod.com/jad.html
// Decompiler options: packimports(3) fieldsfirst ansi space 

import java.util.Random;
import javax.microedition.lcdui.Image;

public class u
{

	p char;
	int do;
	int byte;
	int int;
	public static final int case = 0;
	public static final int for = 1;
	public static final int new = 2;
	public static final int else = 3;
	public static final int if = 4;
	public static final int try = 5;
	public static final int a = 6;

	public u(p p1, int i, int j)
	{
		char = p1;
		do = i;
		byte = j;
		int = byte * 5;
	}

	static Image do(int i, p p1)
	{
		al al1 = new al(p1);
		Image image = al1.long(i);
		al1 = null;
		return image;
	}

	static int[] byte(int i, p p1)
	{
		al al1 = new al(p1);
		int ai[] = al1.b(i);
		al1 = null;
		return ai;
	}

	static int int(int i, p p1)
	{
		al al1 = new al(p1);
		int j = al1.byte(i);
		al1 = null;
		return j;
	}

	static String case(int i, p p1)
	{
		al al1 = new al(p1);
		String s = al1.void(i);
		al1 = null;
		return s;
	}

	static String goto(int i, p p1)
	{
		al al1 = new al(p1);
		String s = al1.goto(i);
		al1 = null;
		return s;
	}

	static int a(int i, int j, Random random, p p1)
	{
		int k = 0;
		int ai[] = a(i);
		if (ai == null)
			return 0;
		for (k = ai[GameMidlet.a(random, ai.length)]; try(k, p1) != j; k = ai[GameMidlet.a(random, ai.length)]);
		return k;
	}

	static boolean new(int i, p p1)
	{
		al al1 = new al(p1);
		boolean flag = al1.do(i);
		al1 = null;
		return flag;
	}

	static int for(int i, p p1)
	{
		al al1 = new al(p1);
		int j = al1.null(i);
		al1 = null;
		return j;
	}

	static void a(u u1, p p1)
	{
		al al1 = new al(p1);
		al1.if(u1, p1);
		al1 = null;
	}

	static void if(u u1, p p1)
	{
		al al1 = new al(p1);
		al1.a(u1, p1);
		al1 = null;
	}

	static boolean else(int i, p p1)
	{
		al al1 = new al(p1);
		boolean flag = al1.int(i);
		al1 = null;
		return flag;
	}

	static int char(int i, p p1)
	{
		al al1 = new al(p1);
		int j = al1.case(i);
		al1 = null;
		return j;
	}

	static int if(int i, p p1)
	{
		al al1 = new al(p1);
		int j = al1.if(i);
		al1 = null;
		return j;
	}

	static int a(int ai[], p p1)
	{
		al al1 = new al(p1);
		int ai1[][] = al1.a();
		al1 = null;
label0:
		for (int i = 0; i < ai1.length; i++)
		{
			int j = 0;
			do
			{
				if (j >= 4)
					continue label0;
				if (ai1[i][j] != -1)
				{
					boolean flag = false;
					int k = 0;
					do
					{
						if (k >= ai.length)
							break;
						if (ai[k] == ai1[i][j])
						{
							flag = true;
							break;
						}
						k++;
					} while (true);
					if (!flag)
						continue label0;
				}
				if (j == 3)
					return ai1[i][4];
				j++;
			} while (true);
		}

		return -1;
	}

	static int try(int i, p p1)
	{
		al al1 = new al(p1);
		int j = al1.for(i);
		al1 = null;
		return j;
	}

	static int[][] a(p p1)
	{
		al al1 = new al(p1);
		int ai[][] = al1.a();
		al1 = null;
		return ai;
	}

	static int a(int i, p p1)
	{
		al al1 = new al(p1);
		int j = al1.try(i);
		al1 = null;
		return j;
	}

	static int[] a(int i)
	{
		int ai[] = null;
		switch (i)
		{
		case 1: // '\001'
		case 3: // '\003'
		case 5: // '\005'
		case 7: // '\007'
		case 9: // '\t'
		case 11: // '\013'
		case 13: // '\r'
		case 15: // '\017'
		case 16: // '\020'
		case 17: // '\021'
		case 18: // '\022'
		case 19: // '\023'
		default:
			break;

		case 2: // '\002'
		case 4: // '\004'
		case 8: // '\b'
			ai = new int[8];
			for (int j = 0; j < ai.length; j++)
				ai[j] = i * 10 + j;

			break;

		case 6: // '\006'
			ai = new int[7];
			for (int k = 0; k < ai.length; k++)
				ai[k] = i * 10 + k;

			break;

		case 12: // '\f'
			ai = new int[11];
			for (int l = 0; l < ai.length; l++)
				ai[l] = i * 10 + l;

			break;

		case 10: // '\n'
			ai = new int[9];
			for (int i1 = 0; i1 < ai.length; i1++)
				ai[i1] = i * 10 + i1;

			break;

		case 0: // '\0'
			ai = new int[6];
			for (int j1 = 0; j1 < ai.length; j1++)
				ai[j1] = i * 10 + j1;

			break;

		case 14: // '\016'
			ai = new int[24];
			for (int k1 = 0; k1 < ai.length; k1++)
				ai[k1] = i * 10 + k1;

			break;

		case 20: // '\024'
			ai = new int[28];
			for (int l1 = 0; l1 < ai.length; l1++)
				ai[l1] = i * 10 + l1;

			break;
		}
		return ai;
	}
}