private static boolean isCompleteNumber(int inputNum) {
		if (inputNum == 1) {
			return true;
		}
		if (isPrime(inputNum)) {
			return false;
		}
		int temp = 0;
		for (int i = 1; i <= inputNum/2; i++) {
			if(inputNum % i == 0) {
				temp+=i;
			}
		}

		return temp == inputNum;
	}