Let $P_t$ denote the path on $t$ vertices. The $r$-coloured Ramsey number of $P_t$, denoted by $R_r(P_t)$, is the minimum integer $n$ such that whenever the complete graph on $n$ vertices is given an $r$-edge-colouring, there exists a monochromatic copy of $P_t$. In this note, we determine $R_r(P_5)$, which is approximately $3r$.