**Not A Homework Question, We Are Still Studying Loops At School**
encountered in a programming challenge ...
**Start**
The number 666 is considered to be the occult "number of the beast"
and is a well used number in all major apocalypse themed blockbuster movies. However the
number 666 can't always be used in the script so numbers such as 1666 are used instead. Let us call the numbers containing at least three contiguous sixes beastly
numbers. The first few beastly numbers are 666, 1666, 2666,
3666, 4666, 5666... 

Given a 1-based index `n`, my program should return the `n`th beastly number.

**Definition**

* Class: `ApocalypseSomeday`
* Method: `getNth`
	+ Parameters: `int`
	+ Returns: `int`
	+ Method signature: `int getNth(int n)` (be sure your method is public)

**Constraints**

* `n` will be between `1` and `10000`, inclusive

**Examples**

1. 2 returns: 1666
2. 3 returns: 2666
3. 6 returns: 5666
4. 187 returns: 66666
5. 500 returns: 166699

Not a problem given by a teacher. I found it in a programming challenge C++. My progress so far

```
public class ApocalypseSomeday
{
  public int getNth(int n)
  {
       int i = 0, j = 0,k = 0;
       int s = 1,c = 1;
       int r = 666;
       while (s < n)
       {
            k = 0;
            while ((c % 10000) == 6666 && s < n && k < 10000)
            {
                r = c * 10000 - 6000 + k;
                k++;
                s++;
            }

```