**What is your hint or solution suggestion?**

```
function hailstoneSequence() {
var res = [], n =27, c1 = [], c2 = [351,77031];
/*You already know c2 from Wikipedia page, and its max arr
length... Please don't make the poor machine do it again... */
c1.push(n);
/*While Res Loop Collatz 1*/
while(n != 1){
n = (n%2== 0) ? (n/2): (3*n + 1);
c1.push(n);
}//End of c1
var newC1 = [c1[0], c1[1], c1[2], c1[3],
c1[c1.length-4], c1[c1.length-3], c1[c1.length-2],
c1[c1.length-1] ];
c1 = newC1;
console.log(`The final c1 matrix before c2 data is ${c1}.\n`);
res.push(c1);
res.push(c2);
console.log(`Final Collatz result matrix is ${res}.\n`);
return res;
} /*My 1st Ancient Egyptian Spoiler Tag... Sorry*/
```

**Challenge:** Hailstone sequence

**Link to the challenge:**