9. TBQ - How many different ways?

Neeraj wants to climb an \(8\)-step staircase. His playful rule is that he can take either \(1\) step or \(2\) steps at a time. For example, one of his paths is \(1\), \(2\), \(2\), \(1\), \(2\). In how many different ways can he reach these top?