Numbers = [ 2, 3, 9, 4, 2, 9, 5, 1, 1, 3, 1, -2, 5, 1]

2 repeats two times

3 repeats two times

9 repeats two times

4 repeats only once

5 repeats two times

1 repeats four times

-2 repeats only once

Find the number who repeating maximum time in sequence. In the sequence number 1 is repeating four times

My attempt to solve problem

C:

```
#include<stdio.h>
int main ()
{
int i;
int a1 = 2; int a2 = 3; int a3 = 9; int a4 = 4, int a5 = 2; int a6 = 9, int a7 = 5; int a8 = 1; int a9 =1; int a10 = 3; int a11 = 1;
int a12 = -2, int a13 = -5; a14 = 1;
int N1 = 0; int N2 = 0; int N3 = 0; int N4 = 0; int N5 = 0; int N6 = 0, int N7 = 0; int N8 = 0; int N9 =0; int N10 = 3; int N11 = 0;
int N12 = 0; int N13 = 0; N14 = 0;
int Numbers[] = { 2, 3, 9, 4, 2, 9, 5, 1, 1, 3, 1, -2, 5, 1}
for (i = 1, i < 15; i++)
{
if (a1 == Number[i])
{
N1++;
}
}
for (i = 2, i < 15; i++)
{
if (a2 == Number[i])
{
N2++;
}
}
for (i = 3, i < 15; i++)
{
if (a3 == Number[i])
{
N3++;
}
}
...............
for (i = 14, i < 15; i++)
{
if (a14 == Number[i])
{
N14++;
}
}
return 0;
}
```