{
	int@n,@m;
	VI@a(n);

	VI a1=a;
	VI i1(n);
	rep(i,n) i1[i]=i;
	sortV(a1,i1);

	VI u,v;
	u.reserve(m);
	v.reserve(m);
	rep(m){
		int@ui,@vi;
		ui--; vi--;
		if(a[ui]<a[vi]){
			u.push_back(ui);
			v.push_back(vi);
		}
		if(a[vi]<a[ui]){
			u.push_back(vi);
			v.push_back(ui);
		}
	}

	graph g;
	g.setDirectEdge(n,u.size(),u.data(),v.data());

	int@k;
	VI b(n);
	rep(k){
		int@bk;
		b[bk-1]=1;
	}

	VI z;
	z.reserve(n);
	rep[i1](i,n){
		if(b[i]){
			z.push_back(i+1);
			rep[g.edge[i]](k,g.es[i]){
				b[k]^=1;
			}
		}
	}
	int zs=z.size();
	wtLn(zs,z(zs));
}