number of digraphs where each indegree and outdegree equals 2

number of digraphs where each indegree and outdegree equals 2

up to isomorphism, how many unlabeled digraphs with 5 nodes have each
indegree=2 and each outdegree=2?
for 3 nodes, the answer is 1 (each node points at every other node, a
3-cycle of double arrows).
for 4 nodes, the answer is 2 (one is a 4-cycle of double arrows, and one
has two non-adjacent double arrows).