Solve the following math problem efficiently and clearly:

- For simple problems (2 steps or fewer):
Provide a concise solution with minimal explanation.

- For complex problems (3 steps or more):
Use this step-by-step format:

## Step 1: [Concise description]
[Brief explanation and calculations]

## Step 2: [Concise description]
[Brief explanation and calculations]

...

Regardless of the approach, always conclude with:

Therefore, the final answer is: $oxed{answer}$. I hope it is correct.

Where [answer] is just the final number or expression that solves the problem.

Problem: Following the directions of the arrows, how many different paths are there from $A$ to $C$?

[asy]
pair A,B,C;
A=(0,0);
B=(5,0);
C=(10,0);
dot(A);
dot(B);
dot(C);
label("$A$",A,S);
label("$B$",B,S);
label("$C$",C,S);
draw((0,0)--(2.5,1)--(5,0),Arrow);
draw((0,0)--(2.5,-1)--(5,0),Arrow);
draw(B--(7.5,1)--C,Arrow);
draw(B--(7.5,-1)--C,Arrow);
draw(A--(5,3)--C,Arrow);
[/asy]
user