public static int problem1a2(int[]A) {
		for (int i=0;;++i) {
			if (A[i]==i+1) continue;
			else {
				while (A[i]!=i+1) {
					int tmp=A[i];
					if (tmp==A[tmp-1]) return tmp;
					A[i]=A[tmp-1];
					A[tmp-1]=tmp;
				}
			}
		}
	}