Intuitive explanation of Schoof's algorithm finding elliptic curve's order

For a given P, n and G where P=n\*G and finding n from P is DLP problem. We know it is hard to solve. How come they find n easily in case of G = (n-1)\*G, which is also curve's order. I'm wondering the intuition behind the algorithm for this specific case.