AvoidingZeroes

#include <bits/stdc++.h>
#define MOD 1000000007
#define test int t; cin>>t; while(t--)
#define init(arr,val) memset(arr,val,sizeof(arr))
#define loop(i,a,b) for(int i=a;i<b;i++)
#define loopr(i,a,b) for(int i=a;i>=b;i--)
#define loops(i,a,b,step) for(int i=a;i<b;i+=step)
#define looprs(i,a,b,step) for(int i=a;i>=b;i-=step)
#define ull unsigned long long int
#define ll long long int
#define P pair
#define PLL pair<long long, long long>
#define PII pair<int, int>
#define PUU pair<unsigned long long int, unsigned long long int>
#define L list
#define V vector
#define D deque
#define ST set
#define MS multiset
#define M map
#define UM unordered_map
#define mp make_pair
#define pb push_back
#define pf push_front
#define MM multimap
#define F first
#define S second
#define IT iterator
#define RIT reverse_iterator
#define FAST ios_base::sync_with_stdio(false);cin.tie();cout.tie();
#define FILE_READ_IN freopen("input.txt","r",stdin);
#define FILE_READ_OUT freopen("output.txt","w",stdout);
#define all(a) a.begin(),a.end()
using namespace std;
// For ordered_set
const ll maxn = 1e5;
const ll inf = 1e9;
const double pi = acos(-1);

void solve(){
ll n;
cin>>n;
vector<ll>v(n);
vector<ll>g;
vector<ll>l;
vector<ll>e;
ll sum=0;
for(ll i =0;i<n;i++){
    cin>>v[i];
    sum+=v[i];

   if(v[i]>0)g.pb(v[i]);
   else if (v[i]==0)e.pb(v[i]);
   else l.pb(v[i]);
  
}

if(sum!=0){
    cout<<"YES"<<endl;

    if(sum>0){
         for(auto el:g) cout<<el<<" ";

    for(auto el:e) cout<<el<<" ";

    for(auto el:l) cout<<el<<" ";
    }
    else{
         for(auto el:l) cout<<el<<" ";
         

    for(auto el:e) cout<<el<<" ";

for(auto el:g) cout<<el<<" ";
   
    }

   

    cout<<endl;

   
}
else{
    cout<<"NO"<<endl;
}

}

int main(){
   int t = 0;
   cin >> t;
   while(t--){
       solve();
   }
   return 0;
}