Directed Graphs and Network Flows · Hard problem

A graph has vertices $1,2,3,4$ and edges $12,23,34,41,13$. How many of the $2^5$ ways to orient its five edges give a strongly connected digraph?