Integer Replacement LeetCode solution in JavaScript

1
var integerReplacement = function (n) {
2
  let count = 0;
3
  while (n > 1) {
4
    if (n % 2 === 0) {
5
      n /= 2;
6
    } else {
7
      if (n !== 3 && (n + 1) % 4 === 0) {
8
        n++;
9
      } else {
10
        n--;
11
      }
12
    }
13
    count++;
14
  }
15
  return count;
16
};