A graph G has a (P-k1,P-k2)-partition if V(G) can be partitioned into two nonempty disjoint subsets V-1 and V-2 so that G[V-1] and G[V-2] are graphs whose components are paths of order at most k(1) and k(2), respectively. In this paper, we proved that every planar graph with girth at least six giving that i-cycle is not intersecting with j-cycle admits a (P-3, P-3)-partition, where i is an element of {6, 7} and j is an element of {6, 7, 8, 9).