개발이 하고 싶어요

# Double Cola

Sheldon, Leonard, Penny, Rajesh and Howard are in the queue for a "Double Cola" drink vending machine; there are no other people in the queue. The first one in the queue (Sheldon) buys a can, drinks it and doubles! The resulting two Sheldons go to the end of the queue. Then the next in the queue (Leonard) buys a can, drinks it and gets to the end of the queue as two Leonards, and so on.

For example, Penny drinks the third can of cola and the queue will look like this:

Rajesh, Howard, Sheldon, Sheldon, Leonard, Leonard, Penny, Penny

Write a program that will return the name of the person who will drink the n-th cola.

Note that in the very beginning the queue looks like that:

Sheldon, Leonard, Penny, Rajesh, Howard

##Input

The input data consist of an array which contains at least 1 name, and single integer n.

(1 ≤ n ≤ 1000000000).

##Output / Examples Return the single line — the name of the person who drinks the n-th can of cola. The cans are numbered starting from 1. Please note that you should spell the names like this: "Sheldon", "Leonard", "Penny", "Rajesh", "Howard" (without the quotes). In that order precisely the friends are in the queue initially.

 string[] names = new string[] { "Sheldon", "Leonard", "Penny", "Rajesh", "Howard" };

 int n = 1;

 Line.WhoIsNext(names, n) --> "Sheldon"

 int n = 6;

 Line.WhoIsNext(names, n) --> "Sheldon"

 int n = 52;

 Line.WhoIsNext(names, n) --> "Penny"

 int n = 7230702951;

 Line.WhoIsNext(names, n) --> "Leonard"

public class Line {
   public static String WhoIsNext(String[] names, int n){
        int overlap = 1;
        int initial = names.length;
    		if(n < initial) {
		        return names[n-1];
	        } else {
        
            while(overlap*initialt;n){
                n-=overlap*initial;
                overlap*=2;
              }
        }
        
        return names[(n-1)/overlap];
    		
   }
}