public int find(int lower, int upper) {
		int count = 0;
		for (int i = lower; i <= upper; i++) {
			for (int j = upper; j >i; j--) {
				if (i <= 10 * j && j <= 10 * i) {
					count++;
					break;
				}
			}
		}
		return count;
	}