求条

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e4+5;
int a[N];
int flag[N];
signed main()
{
	cin.tie(0)->sync_with_stdio(0);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i];
	int cnt0=0,cnt1=0,cnt2=0;
	for(int i=1;i<=n;i++)
	{
		if(a[i]%3==0) cnt0++;
		if(a[i]%3==1) cnt1++;
		if(a[i]%3==2) cnt2++;
	}
	int id=1;
	if(cnt1>cnt2) swap(cnt1,cnt2),id=2;
	if(((cnt0==0)&&(cnt1!=0)&&(cnt2!=0))||cnt1+cnt2+1<cnt0) cout<<"No";
	else
	{
		cout<<"Yes"<<endl;
		if(cnt0==cnt1)
		{
			for(int i=1;i<=n;i++)
			{
				for(int j=1;j<=n;j++)
				{
					bool vis=0;
					if(i&1)
					{
						if(!flag[j]&&a[j]%3==id)
						{
							cout<<a[j]<<" ";
							flag[j]=1;
							vis=1;
							cnt1--;
							break;
						}
						if(!flag[j]&&a[j]%3!=0&&cnt1==0)
						{
							cout<<a[j]<<" ";
							flag[j]=1;
							vis=1;
							break;
						}
					}
					else
					{
						if(!flag[j]&&a[j]%3==0)
						{
							cout<<a[j]<<" ";
							flag[j]=1;
							vis=1;
							break;
						}
					}
				}
			}
			for(int i=1;i<=n;i++)
			{
				if(!flag[i]) cout<<a[i]<<" ";
			}
		}
		else
		{
			for(int i=1;i<=n;i++)
			{
				bool vis=0;
				for(int j=1;j<=n;j++)
				{
					if(!(i&1))
					{
						if(!flag[j]&&a[j]%3==id)
						{
							cout<<a[j]<<" ";
							flag[j]=1;
							vis=1;
							cnt1--;
							break;
						}
						
						if(!flag[j]&&a[j]%3!=0&&cnt1==0)
						{
							cout<<a[j]<<" ";
							flag[j]=1;
							vis=1;
							break;
						}
					}
					else
					{
						if(!flag[j]&&a[j]%3==0)
						{
							cout<<a[j]<<" ";
							flag[j]=1;
							vis=1;
							break;
						}
					}
				}
			}
			for(int i=1;i<=n;i++)
			{
				if(!flag[i])
				{
					if(a[i]%3==0) cout<<a[i]<<" ";
					flag[i]=1;
				}
			}
			for(int i=1;i<=n;i++)
			{
				if(!flag[i]) cout<<a[i]<<" ";
			}
		}
	}
	return 0;
}