In mathematics country 1,2,3,4....,8,9 are nine cities. Cities which form a no. that is divisible by 3 are connected by air planes. (e.g. cities 1 & 2 form no. 12 which divisible by 3 then 1 is connected to city 2). Find the total no. of ways you can go to 8 if you are allowed to break the journeys.