import?java.io.*;

public?class?PrimitiveRoot?{
	public?void?f（int?input）{
		int?tempit;
		for?（temp=2;temp			int[]?j=new?int[input];????
		????boolean?flag=true;
			for?（t=0j[0]=1i=1;i				j[i]=（j[i-1]*temp）%input;
				if?（（j[i]==1）&&（i					flag=false;??//flag=false則不是原根
					break;
					}
				}//原根的判斷
			
			if?（（flag）&&（j[i-1]==1））{
				System.out.println（“temp=“+tem