1
class Solution {
2
  public int rotatedDigits(int n) {
3
    int ans = 0;
4
    for (int i = 1; i <= n; i++) {
5
      int k = i;
6
      boolean bool1 = true;
7
      boolean bool2 = false;
8
      while (k > 0) {
9
        int m = k % 10;
10
        if (m == 3 || m == 4 || m == 7) {
11
          bool1 = false;
12
          break;
13
        } else if (m == 2 || m == 5 || m == 6 || m == 9) {
14
          bool2 = true;
15
        }
16
        k /= 10;
17
      }
18
      if (bool1 && bool2) {
19
        ans++;
20
      }
21
    }
22
    return ans;
23
  }
24
}