Clumsy Factorial LeetCode solution in Rust

1
impl Solution {
2
  pub fn clumsy(n: i32) -> i32 {
3
    if n == 1 {
4
      return 1;
5
    }
6
    if n == 2 {
7
      return 2;
8
    }
9
    if n == 3 {
10
      return 6;
11
    }
12
    if n == 4 {
13
      return 7;
14
    }
15
    if n % 4 == 1 {
16
      return n + 2;
17
    }
18
    if n % 4 == 2 {
19
      return n + 2;
20
    }
21
    if n % 4 == 3 {
22
      return n - 1;
23
    }
24
    return n + 1;
25
  }
26
}