1
# Runtime: 226 ms (Top 14.46%) | Memory: 13.9 MB (Top 71.45%)
2
class Solution:
3
    def rotatedDigits(self, n: int) -> int:
4
        d = {0: 0, 1: 1, 2: 5, 3: None, 4: None, 5: 2, 6: 9, 7: None, 8: 8, 9: 6}
5
        res = 0
6
        for i in range(n + 1):
7
            t = i
8
            pos = 0
9
            temp = 0
10
            status = True
11
            while t > 0:
12
                r = d[
13
                    t % 10
14
                ]  # Every Digit Rotation Is Must, We Don't Have Choice To Leave It Without Rotating
15
                if r is None:
16
                    status = False
17
                    break
18

19
                temp += (10**pos) * r
20
                pos += 1
21
                t = t // 10
22

23
            if temp != i and status:
24
                res += 1
25
        return res