Fibonnaci + Prime number combined, Java

Language: Layout:

//'main' method must be in a class 'Rextester'.
//Compiler version 1.8.0_111

import java.util.*;
import java.lang.*;

class Rextester
{  
    static int fibonnaci(int num){
        int a = 0;
        int b = 1;
        int c = 0;
        int count=0;
        while(count!=num){
            c = a+b;
            a = b;
            b = c;
            count++;
        }
        return c;
    }
    static int nPrime(int num){
        int count=0;
        int i=2;
        while(count!=num){
            if(isPrime(i)){
                count++;
            }
            i++;
        }
        return i-1;
    }
    static boolean isPrime(int num){
        int x = (int)Math.floor(Math.sqrt(num));
        for(int i=2;i<=x;i++){
            if(num%i==0){
                return false;
            }
        }
        return true;
    }
    public static void main(String args[])
    {
        Scanner ssc = new Scanner(System.in);
        int num = ssc.nextInt();
        if(num%2!=0){
            System.out.println(num + "th no. is " +  fibonnaci(num/2));
        }
        else{
            System.out.println(num +  "th no. is:" + nPrime((num/2)));
        }
    }
}

[ + ] Show input
Compilation time: 0.74 sec, absolute running time: 0.17 sec, cpu time: 0.16 sec, memory peak: 20 Mb, absolute service time: 0,92 sec