import java.util.Queue;

 import java.util.LinkedList;

 class Solution {

     /**

      * @param k: The number k.

      * @return: The kth prime number as description.

      */

     public long kthPrimeNumber(int k) {

         long[] relust = new long[k];

         relust[0] = 3;

         relust[1] = 5;

         relust[2] = 7;

         int a = 0;

         int b = 0;

         int c = 0;

         for (int i=3;i<k ;i++ ) {

             long temp = judge(relust[a]*3,relust[b]*5,relust[c]*7);

             relust[i] = temp;

             while(relust[a]*3 <= temp)a++;

             while(relust[b]*5 <= temp)b++;

             while(relust[c]*7 <= temp)c++;

         }

         return relust[k-1];

     }

     public long judge(long a,long b,long c) {

         long min = Math.min(a,b);

         min = Math.min(min,c);

         return min;

     }

 };