#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
int c[100005]; 
int main()
{
	int n,i=0,maax=0,j,k,x=0,y;
	while(scanf("%d",&c[i])!=EOF)
	 i++;
	n=i;
	sort(c+n,c);
	for(i=0;i<=n-1;i++)
	{
		if(c[i]==0)
		 continue;
		k=1,y=c[i],c[i]=0;
		for(j=i+1;j<=n-1;j++)
		 if(y>=c[j])
		  k++,y=c[j],c[j]=0;
		maax=max(maax,k);
		x++;
	}
	cout<<maax<<' '<<x+1<<endl;
	return 0;
}
``````cpp
#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
int c[100005]; 
int main()
{
	int n,i=0,maax=0,j,k,x=0,y;
	while(scanf("%d",&c[i])!=EOF)
	 i++;
	n=i;
	sort(c+n,c);
	for(i=0;i<=n-1;i++)
	{
		if(c[i]==0)
		 continue;
		k=1,y=c[i],c[i]=0;
		for(j=i+1;j<=n-1;j++)
		 if(y>=c[j])
		  k++,y=c[j],c[j]=0;
		maax=max(maax,k);
		x++;
	}
	cout<<maax<<' '<<x+1<<endl;
	return 0;
}