Count the ways up the stairs

You climb a staircase of n steps, taking **1 or 2 steps** at a time. Write a recursive method counting the distinct ways to exactly reach the top: process(int n) with bases ways(0) = 1 and ways(1) = 1 (the answer is Fibonacci-shaped). Example: n = 5 → 8.