A graph G is strongly connected if for all u, v there is a path from u to v and a path from v to u.
The strong components of a digraph are the maximally strong connected subgraphs
Suppose two vertices x and y , y(suppose 12) is divisivle by x(suppose 2)
x(2)-------->y(12)
But from y(12) we cannot reach x(2) as 2 is not divisible by 12.
So, all the vertices are strongly connected components.
Answer should be 11.