Bipartite Graphs and Matchings · Easy problem

Five buoys are anchored so that buoy $i$ can be linked by a cable to buoys $i-1$ and $i+1$ around a circle ($1,2,3,4,5$ arranged in the cycle $1\text{-}2\text{-}3\text{-}4\text{-}5\text{-}1$). What is the maximum number of cables that can be installed at once if no buoy may hold more than one cable?