Sristan Thin is walking around the Cartesian plane. From any point \((x, y)\), Sristan can move to \((x+1, y)\) or \((x+1, y+3)\). How many paths can Sristan take from \((0, 0)\) to \((9, 9)\)?

Let's think step by step and output the final answer within \boxed{}.
user