SMO 2006 Problem 3

Consider the sequence $p_{1},p_{2},...$ of primes such that for each $i\geq2$ , either $p_{i}=2p_{i-1}-1$ or $p_{i}=2p_{i-1}+1$ . Show that any such sequence has a finite number of terms.