12. Master Number

package Mathods;

import java.util.Scanner;

public class MasterNumbers {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = Integer.parseInt(scanner.nextLine());
		for (int i = 1; i <= n; i++) {
			if (IsPalindrome(i) && SumOfDigits(i) && ContainsEvenDigit(i)) {
				System.out.println(i);
			}
		}
	}

	static boolean IsPalindrome(int num) {

		String val = String.valueOf(num);
		String reverse = "";
		for (int i = val.length() - 1; i >= 0; i--) {
			reverse = reverse + val.charAt(i);
		}
		if (val.equals(reverse)) {
			return true;
		} else {
			return false;
		}
	}

	static boolean SumOfDigits(int num) {
		String val = Integer.toString(num);
		int num1 = 0;
	int sum=0;
		for (int i = 0; i < val.length(); i++) {
			num1 = num % 10;
			num = num / 10;
			sum+=num1;
		}
		if (sum % 7 == 0) {
			return true;
		} else {
			return false;
		}
	}

	static boolean ContainsEvenDigit(int num) {
		boolean isTrue = false;
		String val = Integer.toString(num);
		for (int i = 0; i < val.length(); i++) {
			//     int currentDigit = int.Parse(str[i].ToString());
			char a = val.charAt(i);
			switch (a) {
			case '0':
			case '2':
			case '4':
			case '6':
			case '8':
				isTrue = true;
				break;
			}
			if(isTrue) {
				break;
			}
		}
		if (isTrue) {
			return true;
		} else {
			return false;
		}

	}
}