Program recherche_major;
Type tab=array [1..25] of integer;
Var
t:tab;
p, n:integer;
(********************************************)
Procedure saisie(var n:integer;var t:tab);
Var i:integer;
Begin
Repeat
Write('n = ');
Readln(n);
Until n in [5..25];
Writeln ('Saisir les ', n, ' éléments de T');
For i := 1 To n Do 
Readln (T[i]);
End;
(*******************************************)
Function major_existe(n:integer;t:tab;var p:integer):boolean;
Var i,j,occ:integer;
Begin major_existe:=false;
For i:=1 to n do
Begin occ:=0;
For j:=1 to n do 
If t[i]=t[j] Then occ:=occ+1;
If occ > (n div 2) Then 
Begin major_existe:=true;
p:=i;
End;
End;
End;
(********************P.P*********************)
Begin saisie(n,t);
If major_existe(n,t,p)
Then
Writeln (t[p],' est majoritaire')
Else
Writeln ('pas d''élément majoritaire');
End.