public boolean isPanlindrome(long num){
		if(num <= upper && quali[(int) num]) return true;
		ArrayList<Long> bits = new ArrayList<Long>();
		
		while(num > 0){
			bits.add(num % 10);
			num /= 10;
		}
		
		for(int i = 0; i < bits.size() / 2; i++){
			if(bits.get(i) != bits.get(bits.size() - 1 - i)) 
				return false;
		}
		return true;
	}