//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  return a < b ? b - a : a - b;
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a)
    a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b)
    a = b;
}
template <class F> class rec_lambda {
  F f;

public:
  rec_lambda(F &&f) : f(std::move(f)) {}
  template <class... Args> auto operator()(Args &&... args) const {
    return f(*this, std::forward<Args>(args)...);
  }
};
template <class F> auto make_rec(F &&f) { return rec_lambda<F>(std::move(f)); }
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}

} // namespace n91

#include <deque>

namespace n91 {

void main_() {
  /*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  const usize n = scan<usize>();
  std::vector<u64> a(n + 1);
  for (const usize i : rep(0, n)) {
    std::cin >> a[i];
  }
  a[n] = 0;
  const usize A = *std::max_element(a.begin(), a.end());
  for (const usize i : revrep(0, n)) {
    a[i] += a[i + 1];
  }
  const auto next = [&](std::deque<usize> &rle, u64 &sum) -> bool {
    if (rle.size() == 2) {
      return false;
    }
    usize t0 = rle[0];
    usize t1 = rle[1];
    sum -= a[t0] - a[t0 + t1];
    sum += a[t0 + t1] - a[t0 + t1 + 1];
    if (rle.size() >= 4 && rle[2] == 1) {
      rle[3] += 1;
      rle.pop_front();
      rle.pop_front();
      rle.pop_front();
      rle.push_front(t0 + 1);
      if (t1 != 1) {
        sum += a[0] - a[t1 - 1];
        rle.push_front(t1 - 1);
        rle.push_front(0);
      }
    } else {
      rle.pop_front();
      rle.pop_front();
      rle[0] -= 1;
      if (rle[0] == 0) {
        rle.pop_front();
      }
      rle.push_front(1);
      rle.push_front(t0 + 1);
      if (t1 != 1) {
        sum += a[0] - a[t1 - 1];
        rle.push_front(t1 - 1);
        rle.push_front(0);
      }
    }
    return true;
  };
  std::vector<int> oc;
  u64 ans = -static_cast<u64>(1);
  for (const usize k : rep(1, n + 1)) {
    std::deque<usize> deq;
    if (k != n) {
      deq.push_front(n - k);
    }
    deq.push_front(k);
    deq.push_front(0);
    u64 sum = a[0] - a[k];
    oc.resize(A * k + 1);
    do {
      if (oc[sum] != 0) {
        ans = sum;
        break;
      }
      oc[sum] = 1;
    } while (next(deq, sum));
    if (ans != -static_cast<u64>(1)) {
      break;
    }
  }
  if (ans == -static_cast<u64>(1)) {
    std::cout << "No\n";
    return;
  }
  std::cout << "Yes\n";
  std::vector<int> b(n, 0);
  int state = 0;
  for (const usize k : rep(1, n + 1)) {
    std::deque<usize> deq;
    if (k != n) {
      deq.push_front(n - k);
    }
    deq.push_front(k);
    deq.push_front(0);
    u64 sum = a[0] - a[k];
    do {
      if (sum == ans) {
        if (state == 0) {
          state = 1;
          usize i = 0;
          bool f = false;
          for (const auto e : deq) {
            if (f) {
              for (const usize j : rep(i, i + e)) {
                b[j] += 1;
              }
            }
            i += e;
            f = !f;
          }
        } else if (state == 1) {
          state = 2;
          usize i = 0;
          bool f = false;
          for (const auto e : deq) {
            if (f) {
              for (const usize j : rep(i, i + e)) {
                b[j] -= 1;
              }
            }
            i += e;
            f = !f;
          }
        }
      }
    } while (next(deq, sum));
    if (state == 2) {
      break;
    }
  }
  for (const usize i : rep(0, n)) {
    if (i)
      std::cout << " ";
    std::cout << i64(b[i]) * i64(a[i] - a[i + 1]);
  }
  std::cout << "\n";
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}