(Shortest Path)

Let G be a directed graph whose vertex set is the set of numbers from 1 to 99. There is an edge from a vertex i to a vertex j if and only if either j = i + 1 or j = 3i. What is the minimum number of edges in a path in G from vertex 1 to vertex 99?