Directed Graphs and Network Flows · Easy problem

A digraph has vertices $1,\dots,5$ and arcs $1\to2$, $2\to3$, $3\to4$, $4\to5$ — a single directed path with no arc running backward. How many strongly connected components does it have?