Problem Statement 
 Rabbit Hanako has N cards numbered 1 through N. Each card's number is written on its front side. The back side of each card is colored red if the number is prime, and blue if it is not prime.
Cat Taro has chosen a subset of these cards and arranged them face down in a row. The cards are sorted in increasing order from left to right. He wants Hanako to guess the numbers written on the cards. Hanako can only see the colored back side of each card. You are given a String colors, where the ith character is 'R' if the ith card from the left is red, and 'B' if it is blue.
Return a int[] containing exactly K elements, where K is the number of characters in colors. The ith element of the return must be the number written on the ith card if it can be uniquely determined. Otherwise, the ith element must be 1. It is guaranteed that there exists at least one sequence that matches colors.


Definition 
 Class:  ColorfulCards  Method:  theCards  Parameters:  int, String  Returns:  int[]  Method signature:  int[] theCards(int N, String colors)  (be sure your method is public) 




Notes 
  A positive integer number is called prime if it has exactly two divisors, 1 and itself. By convention, 1 is not considered to be a prime number. 

Constraints 
  N will be between 1 and 1,000, inclusive. 
  colors will contain between 1 and 50 characters, inclusive. 
  Each character in colors will be 'R' or 'B'. 
  There will exist at least one sequence that matches colors. 

Examples 
0)  
  Returns: {2, 3, 5 }  The numbers written on these cards are primes less than or equal to 5, so the only possibility is {2, 3, 5}.



1)  
  Returns: {1, 4, 6 }  The numbers written on these cards are not primes less than or equal to 7, so the only possibility is {1, 4, 6}.



2)  
  Returns: {1, 4, 5 }  There are two possibilities:
{2, 4, 5}
{3, 4, 5}



3)  
 58  "RBRRBRBBRBRRBBRRBBBRRBBBRR" 
 Returns:
{1, 1, 1, 1, 1, 1, 1, 1, 17, 18, 19, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 47, 53 }  

4)  
 495  "RBRRBRBBRBRRBBRRBBBRRBBBRR" 
 Returns:
{1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 }  
