490 A. Team Olympiad Solution

#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int arr[n];
int t1=0,t2=0,t3=0;
int ans= 0;
long p1[10000],p2[10000],p3[10000];
for(int j ;j<n;j++)
cin>>arr[j];
int i;
int a=0,b=0,c=0;
for(i=0;i<n;i++)
{

if(arr[i]==1 )
{t1++;
p1[a]=i;a++;
}


else if(arr[i]==2 ){
t2++;
p2[b]=i;b++;}
else if(arr[i]==3  ){
t3++;
p3[c]=i;
c++;}
ans = min(t1,min(t2,t3));
}
cout<<ans<<endl;;
t1=0,t2=0,t3=0;
int k=0;
for(i=0;i<n;i++)
{
if(ans>=1) cout<<p1[i]+1<<" "<<p2[i]+1<<" " <<p3[i]+1<<" "<<endl;
 k++;

if(k==ans)break;
}



return 0;
}