function Aff(n1) 
{
	if (n1>0) n=n1;
	if (n>max) n=0;
	document.tree.moi.options[0].text=i[n][0];
	document.tree.moi.options[1].text=i[n][3]!=""?"Naissance: " + i[n][3]:"";
	document.tree.moi.options[2].text=i[n][4]!=""?"Décès: " + i[n][4]:"";
	x=0;
	nu=0;
	for (j=1;j<=umax;j++) {c=0;if (u[j][0]==n) c=u[j][1];if (u[j][1]==n) c=u[j][0];
		if (c>0) 
		{
			document.tree.uni.options[x].value=c;
			document.tree.uni.options[x].text=i[c][0];
			x++;
			nu=j;
		 }
}
for (j=x;j<15;j++)
{
	document.tree.uni.options[j].value=0;
	document.tree.uni.options[j].text="";
}
document.tree.uni.selectedIndex=-1;
document.tree.moi.options[3].text=u[nu][2]!=""?"Mariage: " + u[nu][2]:"";
x=0;
for (j=1;j<=max;j++)
	if ((j!=n)&&(((i[j][1]==i[n][1])&&(i[j][1]!=0))||((i[j][2]==i[n][2])&&(i[j][2]!=0)))) 
	{
		document.tree.fs.options[x].value=j;
		document.tree.fs.options[x].text=i[j][0];
		x++;
	}
for (j=x;j<15;j++)
{
	document.tree.fs.options[j].value=0;
	document.tree.fs.options[j].text="";
}
document.tree.fs.selectedIndex=-1;
x=0;
for (j=1;j<=max;j++)
	if ((i[j][1]==n)||(i[j][2]==n))  
	{
		document.tree.enf.options[x].value=j;
		document.tree.enf.options[x].text=i[j][0];
		x++;
	}
for (j=x;j<15;j++)
{
	document.tree.enf.options[j].value=0;
	document.tree.enf.options[j].text="";
}
document.tree.enf.selectedIndex=-1;
document.tree.am.value=i[n][0];
document.tree.p.value=i[i[n][1]][0];
document.tree.pp.value=i[i[i[n][1]][1]][0];
document.tree.pm.value=i[i[i[n][1]][2]][0];
document.tree.m.value=i[i[n][2]][0];
document.tree.mp.value=i[i[i[n][2]][1]][0];
document.tree.mm.value= i[i[i[n][2]][2]][0];
}