int y=0;

h=8;l=8;

if (Check(x, y , h, l, field)==countOfStone) 	{

public class Main {

	public static void main(String[] args) {
		 Island	i= new Island();
		i.Trying();
		 

	}

}

public class Island {
	int[][]  field = new int[8][8];
	int countOfStone;
	int maxX=0;
	int maxY=0;
	int maxL=0;
	int maxH=0;
	int maxS=0;
	public Island(){
		field[0][0]=1;
		field[0][1]=1;
		field[1][2]=1;
		field[1][7]=1;
		countOfStone = CountOfStone(field);
		
 	}
	public int CountOfStone(int[][] f){
		int count=0;
		for (int i=0;  i<=7 ; i++){
			for (int j=0;  j<=7;j++){
				if (f[i][j]==1) {count++;}
			}
		}
		
		return count;
	}
	public int Check(int x, int y , int i, int j, int[][] massive){
	
		int i1;
		int j1;
		int c;
		int[][] m = new int [8][8]; 
		//m=massive;
		System.out.print("test2");
		for (i1=0; i1<=7; i1++) {
			for (j1=0; j1<=7; j1++) {
				m[i1][j1]=massive[i1][j1];
			}
		}
		
		
		for (i1=x; i1<=i; i1++) {
			for (j1=x; j1<=j; j1++) {
				m[i1][j1]=2;
			}
		}
		PrintX(m);
		return (CountOfStone(massive));
	}
	public void PrintX(int[][] f){
		
		
		int i1;
		int j1;
		int c;
		
		System.out.print("test");
		for (i1=0; i1<=7; i1++) {
			for (j1=0; j1<=7; j1++) {
				System.out.print(f[i1][j1]  + " ");
			}
			System.out.println();
		}
		System.out.println();
		
	}
	
	public void Trying(){
		boolean result=false;
		int[][] f = field ; 
		int x=0;
		int y=0;
		int h=8;
		int l=8;
		
		do {
		do {
			h=8;l=8;
			do {
				do {

					if (x+h<=8 && y+l<=8 && x-h>0 && y-l>0) {

					if (Check(x, y , h, l, field)==countOfStone) 	{

						System.out.print("x="+x + ":"+ "y="+y +" h="+h +", l="+ l );System.out.println();
					if (maxS<h*l) {
						maxS=h*l; maxX=x;maxY=y;maxH=h;maxL=l;}														
					}								
					} 								
					h--;
				} while (!(result || h==0));
				h=7;l--;
			} while (!(result || l==0));
				
			
			x++;
		
		} while (!(result || x==8));
		x=7;y++;
		} while (!(result || y==8));
		
		System.out.println(maxX + "|" +maxY+ "|" +maxH+ "|" +maxL);			
	}
}