Solution of URI 2006 :: Identifying Tea

Before seeing the solution make sure that you tried enough. Don’t paste the whole code, just find out the logic. If you stuck in trouble, just inform me on comment.

/**Bismillahir Rahamnir Rahim.**/

#include <stdio.h>
int main()
{
    int n, m , i, cnt=0;
    scanf("%d", &n);
    for(i=0; i<5; i++)
    {
        scanf("%d", &m);
        if(m==n) cnt++;
    }
    printf("%d\n", cnt);
    return 0;
}