public int findPeakElement(int[] num){
		int fore = -9999999, next=-9999999;
		for(int i = 0; i < num.length; i++){
			if(i+1 == num.length)
				next = -999999;
			else next = num[i+1];
			if(num[i] >= fore && num[i] >= next)
				return i;
		}
		return 0;
	}