Let M denote the order of the largest component in a random subgraph H of the n-cycle Cn, where H has the same vertex set as Cn and its edge set is defined by independently selecting, with the same constant probability, each of the edges of Cn. The probability that M is equal to k is known for k=1 and for . Here we obtain the exact result for k=2 and comment on the cases .