#include<bits/stdc++.h>
#define f1(i, n) for(ll i=1;i<=n;++i)
#define f0(i, n) for(ll i=0;i<n;++i)
#define ull unsigned long long
#define ll long long
#define rev(a) reverse(a.begin(),a.end())
#define all(x) x.begin(),x.end()
#define so(A, n) sort(A+1, A+n+1)
using namespace std;
const int maxn = 200010;
const int N = 2e5 + 5;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin >> n;
ll A[n + 5];
f1(i, n) {
cin >> A[i];
A[i] = abs(A[i]);
}
A[0] = LLONG_MIN;
for (int i = 1; i < n; ++i) {
if (A[i] > A[i + 1]) {
A[i] = -1ll * A[i];
if (A[i] < A[i - 1]) {
cout << "No";
return 0;
}
}
}
cout << "Yes" << endl;
for (int i = 1; i <= n; ++i) {
cout << A[i] << " ";
}
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KI2RlZmluZSBmMShpLCBuKSBmb3IobGwgaT0xO2k8PW47KytpKQojZGVmaW5lIGYwKGksIG4pIGZvcihsbCBpPTA7aTxuOysraSkKI2RlZmluZSB1bGwgdW5zaWduZWQgbG9uZyBsb25nCiNkZWZpbmUgbGwgbG9uZyBsb25nCiNkZWZpbmUgcmV2KGEpIHJldmVyc2UoYS5iZWdpbigpLGEuZW5kKCkpCiNkZWZpbmUgYWxsKHgpIHguYmVnaW4oKSx4LmVuZCgpCiNkZWZpbmUgc28oQSwgbikgc29ydChBKzEsIEErbisxKQp1c2luZyBuYW1lc3BhY2Ugc3RkOwpjb25zdCBpbnQgbWF4biA9IDIwMDAxMDsKY29uc3QgaW50IE4gPSAyZTUgKyA1OwoKaW50IG1haW4oKQp7Cglpb3NfYmFzZTo6c3luY193aXRoX3N0ZGlvKDApOyBjaW4udGllKDApOyBjb3V0LnRpZSgwKTsKCWludCBuOwoJY2luID4+IG47CglsbCBBW24gKyA1XTsKCWYxKGksIG4pIHsKCQljaW4gPj4gQVtpXTsKCQlBW2ldID0gYWJzKEFbaV0pOwoJfQoJQVswXSA9IExMT05HX01JTjsKCWZvciAoaW50IGkgPSAxOyBpIDwgbjsgKytpKSB7CgkJaWYgKEFbaV0gPiBBW2kgKyAxXSkgewoJCQlBW2ldID0gLTFsbCAqIEFbaV07CgkJCWlmIChBW2ldIDwgQVtpIC0gMV0pIHsKCQkJCWNvdXQgPDwgIk5vIjsKCQkJCXJldHVybiAwOwoJCQl9CgkJfQoJfQoJY291dCA8PCAiWWVzIiA8PCBlbmRsOwoJZm9yIChpbnQgaSA9IDE7IGkgPD0gbjsgKytpKSB7CgkJY291dCA8PCBBW2ldIDw8ICIgIjsKCX0KCglyZXR1cm4gMDsKfQoKCg==