IZhO 2016 Problem 3

There are $60$ towns in $Graphland$ every two countries of which are connected by only a directed way. Prove that we can color four towns to red and four towns to green such that every way between green and red towns are directed from red to green