public static int maxRight() {
		int arr[] = new int[1001];
		for (int i = 1; i <= 1000; i++) {
			for (int j = 1; j < 1000; j++) {
				if (i + j + Math.sqrt(i * i + j * j) > 1000) {
					break;
				}
				if (Math.sqrt(i * i + j * j) % 1 == 0)
					arr[i + j + (int) Math.sqrt(i * i + j * j)]++;

			}
		}
		int max = 0;
		int no = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] > max) {
				no = i;
				max = arr[i];
			}
		}
		return no;
	}