Search is not available for this dataset
name
stringlengths 2
88
| description
stringlengths 31
8.62k
| public_tests
dict | private_tests
dict | solution_type
stringclasses 2
values | programming_language
stringclasses 5
values | solution
stringlengths 1
983k
|
|---|---|---|---|---|---|---|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
long[] a_ = new long[n];
for(int i = 0; i < n; i++){
a_[i] = scan.nextLong();
}
int count = 0;
long[] sum_ = new long[n];
//i % 2 == 1 : sum_[i] <= -1
if(a_[0] > 0){
sum_[0] = a_[0];
for(int i = 1; i < n;){
sum_[i] = sum_[i-1] + a_[i];
if(i % 2 != 0){
if(sum_[i] < 0){
//OK
i++;
}else{
if(sum_[i-1] > 1){
sum_[i-1]--;
}else{
a_[i]--;
}
count++;
}
}else{
if(sum_[i] > 0){
//OK
i++;
}else{
if(sum_[i-1] < -1){
sum_[i-1]++;
}else{
a_[i]++;
}
count++;
}
}if(count == 10)break;
}
}else{
sum_[0] = a_[0];
for(int i = 1; i < n;){
sum_[i] = sum_[i-1] + a_[i];
if(i % 2 != 0){
if(sum_[i] > 0){
//OK
i++;
}else{
if(sum_[i-1] < -1){
sum_[i-1]++;
}else{
a_[i]++;
}
count++;
}
}else{
if(sum_[i] < 0){
//OK
i++;
}else{
if(sum_[i-1] > 1){
sum_[i-1]--;
}else{
a_[i]--;
}
count++;
}
}
}
}
System.out.println(count);
}
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.util.StringJoiner;
class Main {
static PrintWriter out;
static InputReader sc;
static final int MOD = (int) 1e9 + 7;
public static void main(String[] args) {
sc = new InputReader(System.in);
out = new PrintWriter(System.out);
solve();
out.flush();
}
static void solve() {
int N = sc.nextInt();
int[] a = sc.nextIntArray(N);
int c1 = 0;
int c2 = 0;
int sum = 0;
int c = 1;
for (int i = 0; i < N; i++) {
sum += a[i];
if (sum * c <= 0) {
c1 += Math.abs(sum) + 1;
sum = c;
}
c *= -1;
}
sum = 0;
c = -1;
for (int i = 0; i < N; i++) {
sum += a[i];
if (sum * c <= 0) {
c2 += Math.abs(sum) + 1;
sum = c;
}
c *= -1;
}
out.println(Math.min(c1, c2));
}
static void debug(Object... args) {
StringJoiner j = new StringJoiner(" ");
for (Object arg : args) {
Class<?> type = arg.getClass();
if (!type.isArray()) {
j.add(arg.toString());
} else if (type.getComponentType().isArray()) {
for (Object o : (Object[]) arg) {
debug(o);
}
} else if (arg instanceof int[]) {
j.add(Arrays.toString((int[]) arg));
} else if (arg instanceof long[]) {
j.add(Arrays.toString((long[]) arg));
} else if (arg instanceof double[]) {
j.add(Arrays.toString((double[]) arg));
} else if (arg instanceof char[]) {
j.add(Arrays.toString((char[]) arg));
} else if (arg instanceof boolean[]) {
j.add(Arrays.toString((boolean[]) arg));
} else if (arg instanceof Object[]) {
j.add(Arrays.toString((Object[]) arg));
} else {
j.add(arg.toString());
}
}
System.err.println(j.toString());
}
static class InputReader {
private InputStream in;
private byte[] buffer = new byte[1024];
private int curbuf;
private int lenbuf;
public InputReader(InputStream in) {
this.in = in;
this.curbuf = this.lenbuf = 0;
}
public boolean hasNextByte() {
if (this.curbuf >= this.lenbuf) {
this.curbuf = 0;
try {
this.lenbuf = this.in.read(this.buffer);
} catch (IOException e) {
throw new InputMismatchException();
}
if (this.lenbuf <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (this.hasNextByte()) {
return this.buffer[this.curbuf++];
} else {
return -1;
}
}
private boolean isSpaceChar(int c) {
return !(c >= 33 && c <= 126);
}
private void skip() {
while (this.hasNextByte() && this.isSpaceChar(this.buffer[this.curbuf])) {
this.curbuf++;
}
}
public boolean hasNext() {
this.skip();
return this.hasNextByte();
}
public String next() {
if (!this.hasNext()) {
throw new NoSuchElementException();
}
StringBuilder sb = new StringBuilder();
int b = this.readByte();
while (!this.isSpaceChar(b)) {
sb.appendCodePoint(b);
b = this.readByte();
}
return sb.toString();
}
public int nextInt() {
if (!this.hasNext()) {
throw new NoSuchElementException();
}
int c = this.readByte();
while (this.isSpaceChar(c)) {
c = this.readByte();
}
boolean minus = false;
if (c == '-') {
minus = true;
c = this.readByte();
}
int res = 0;
do {
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
res = res * 10 + c - '0';
c = this.readByte();
} while (!this.isSpaceChar(c));
return minus ? -res : res;
}
public long nextLong() {
if (!this.hasNext()) {
throw new NoSuchElementException();
}
int c = this.readByte();
while (this.isSpaceChar(c)) {
c = this.readByte();
}
boolean minus = false;
if (c == '-') {
minus = true;
c = this.readByte();
}
long res = 0;
do {
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
res = res * 10 + c - '0';
c = this.readByte();
} while (!this.isSpaceChar(c));
return minus ? -res : res;
}
public double nextDouble() {
return Double.parseDouble(this.next());
}
public int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = this.nextInt();
}
return a;
}
public long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = this.nextLong();
}
return a;
}
public char[][] nextCharMap(int n, int m) {
char[][] map = new char[n][m];
for (int i = 0; i < n; i++) {
map[i] = this.next().toCharArray();
}
return map;
}
}
} |
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Pradyumn Agrawal coderbond007
*/
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
FastReader in = new FastReader(inputStream);
PrintWriter out = new PrintWriter(outputStream);
TaskC solver = new TaskC();
solver.solve(1, in, out);
out.close();
}
static class TaskC {
public void solve(int testNumber, FastReader in, PrintWriter out) {
int n = in.nextInt();
int[] a = in.nextIntArray(n);
long[] sum = new long[n];
long ret = 0;
for (int i = 0; i < n; i++) {
sum[i] += a[i];
if (i != 0) sum[i] += sum[i - 1];
if (sum[i] == 0) {
if (i - 1 >= 0) {
if (sum[i - 1] > 0) {
sum[i] = -1;
ret++;
} else if (sum[i - 1] < 0) {
sum[i] = 1;
ret++;
}
}
} else {
if (sum[i] > 0) {
if (i - 1 >= 0 && sum[i - 1] > 0) {
ret += sum[i] + 1;
sum[i] = -1;
}
} else if (sum[i] < 0) {
if (i - 1 >= 0 && sum[i - 1] < 0) {
ret += -sum[i] + 1;
sum[i] = 1;
}
}
}
}
out.println(ret);
}
}
static class FastReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int pnumChars;
private FastReader.SpaceCharFilter filter;
public FastReader(InputStream stream) {
this.stream = stream;
}
public int read() {
if (pnumChars == -1) {
throw new InputMismatchException();
}
if (curChar >= pnumChars) {
curChar = 0;
try {
pnumChars = stream.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (pnumChars <= 0) {
return -1;
}
}
return buf[curChar++];
}
public int nextInt() {
int c = read();
while (isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
int res = 0;
do {
if (c == ',') {
c = read();
}
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public int[] nextIntArray(int n) {
int[] array = new int[n];
for (int i = 0; i < n; i++) {
array[i] = nextInt();
}
return array;
}
public boolean isSpaceChar(int c) {
if (filter != null) {
return filter.isSpaceChar(c);
}
return isWhitespace(c);
}
public static boolean isWhitespace(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public interface SpaceCharFilter {
public boolean isSpaceChar(int ch);
}
}
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int oo = 1e9 + 7;
const int mod = 1e9 + 7, maxn = 100100;
const long double PI = acos(-1);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
ll sum = 0, ans = 0, res = 0, signal;
cin >> n;
vector<int> v(n);
for (auto& x : v) cin >> x;
signal = 1;
for (int i = 0; i < n; i++) {
sum += v[i];
if (signal * sum <= 0) {
ans += abs(sum) + 1;
sum = signal;
}
signal *= -1;
}
signal = -1;
sum = 0;
for (int i = 0; i < n; i++) {
sum += v[i];
if (signal * sum <= 0) {
res += abs(sum + 1);
sum = signal;
}
signal *= -1;
}
cout << min(ans, res) << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | # vim: fileencoding=utf-8
def main():
n = int(input())
a = list(map(int, input().split()))
ans = 0
p = 0
q = 0
flg = 0
if a[0] == 0:
if a[1] > 0:
flg = -1
else:
flg = 1
ans = 1
elif a[0] > 0:
p = a[0]
flg = 1
else:
q = abs(a[0])
flg = -1
for i in a[1:]:
# print(i, p, q, ans)
if i > 0:
p += i
elif i < 0:
q += abs(i)
if flg == 1:
if p >= q:
t = p - q + 1
ans += t
q += t
flg = -1
elif flg == -1:
if q >= p:
t = q - p + 1
ans += t
p += t
flg = 1
print(ans)
if __name__ == "__main__":
main()
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
vector<long long int> A(N), a(N), b(N);
for (int i = 0; i < N; i++) cin >> A[i];
for (int i = 0; i < N; i++) a[i] = A[i];
for (int i = 0; i < N; i++) b[i] = A[i];
long long int cnt1 = 0, cnt2 = 0;
long long int M1 = 0, M2 = 0;
for (int i = 0; i < N; i++) {
if (M1 + a[i] > 1) {
if (i % 2 == 0) {
;
} else {
cnt1 = abs(1 - (M1 + a[i]));
a[i] = 1 - (M1 + a[i]);
}
} else if (M1 + a[i] < -1) {
if (i % 2 == 1) {
;
} else {
cnt1 = abs(-1 - (M1 + a[i]));
a[i] = -1 - (M1 + a[i]);
}
} else if (M1 + a[i] == 0) {
if (i % 2 == 0) {
cnt1 = abs(1 - (M1 + a[i]));
a[i] = 1 - (M1 + a[i]);
} else {
cnt1 = abs(-1 - (M1 + a[i]));
a[i] = -1 - (M1 + a[i]);
}
}
M1 += a[i];
}
for (int i = 0; i < N; i++) {
if (M2 + b[i] > 1) {
if (i % 2 == 1) {
;
} else {
cnt2 = abs(1 - (M2 + b[i]));
b[i] = 1 - (M2 + b[i]);
}
} else if (M2 + b[i] < -1) {
if (i % 2 == 0) {
;
} else {
cnt2 = abs(-1 - (M2 + b[i]));
b[i] = -1 - (M2 + b[i]);
}
} else if (M2 + b[i] == 0) {
if (i % 2 == 1) {
cnt2 = abs(1 - (M2 + b[i]));
b[i] = 1 - (M2 + b[i]);
} else {
cnt2 = abs(-1 - (M2 + b[i]));
b[i] = -1 - (M2 + b[i]);
}
}
M2 += b[i];
}
long long int ans = min(cnt1, cnt2);
cout << ans;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
int calc(bool firstPositive, const int a[], int n) {
bool positive = firstPositive;
int cost = 0;
long sum = 0;
for (int i = 0; i < n; ++i) {
int v = a[i];
bool sumpos = (sum + v) >= 0;
if (sumpos != positive) {
while (((sum + v) >= 0) == sumpos) {
v += sumpos ? -1 : 1;
++cost;
}
}
if ((sum + v) == 0) {
v += sumpos ? -1 : 1;
++cost;
}
sum += v;
positive = !positive;
}
return cost;
}
int main(int argc, char *argv[]) {
int n;
std::cin >> n;
int a[1 << 20];
for (int i = 0; i < n; ++i) {
std::cin >> a[i];
}
std::cout << std::min(calc(true, a, n), calc(false, a, n)) << std::endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
constexpr int INF = 100000000;
constexpr long long LINF = 10000000000000000ll;
constexpr int MOD = static_cast<int>(1e9 + 7);
constexpr double EPS = 1e-9;
int n;
long long a[100000];
void init() {}
void solve() {
long long ans = 0;
long long prev = a[0];
if (prev == 0) {
if (a[1] >= 0) {
prev = -1;
} else {
prev = 1;
}
ans++;
}
for (long long i = static_cast<long long>(1); i < static_cast<long long>(n);
i++) {
long long s = prev + a[i];
if (s * prev >= 0) {
long long op = abs(prev) + 1;
long long ns = prev + (prev > 0 ? -op : op);
ans += abs(ns - s);
s = ns;
}
prev = s;
}
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
for (long long i = 0ll; i < static_cast<long long>(n); i++) cin >> a[i];
solve();
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> list(n);
for (int i = 0; i < n; i++) {
cin >> list.at(i);
}
long long int count = 0, sum = 0;
bool flag = true;
for (int i = 0; i < n; i++) {
if (flag) {
sum = list.at(i);
if (sum == 0) {
if (i == 0) {
count += 1;
} else {
count += 2;
}
} else {
flag = false;
if (i != 0) {
sum = sum / abs(sum) * (abs(sum) - 1);
}
}
} else {
long long int temp_sum = sum;
sum += list.at(i);
if (sum * temp_sum >= 0) {
count += abs(sum) + 1;
if (temp_sum > 0) {
sum = -1;
} else {
sum = 1;
}
}
}
}
cout << count << endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
int main() {
size_t N;
std::cin >> N;
std::vector<int64_t> A(N);
for (size_t n = 0; n < N; ++n) {
std::cin >> A[n];
}
int64_t a[2] = {0, 0};
for (size_t i = 0; i < 2; ++i) {
int64_t c = 0;
if (i == 0) {
a[i] = 0;
c = A[0];
} else {
a[i] = abs(A[0]) + 1;
c = (A[0] < 0) ? 1 : -1;
}
for (size_t n = 1; n < N; ++n) {
if (c < 0) {
if (c + A[n] <= 0) {
a[i] += -(c + A[n]) + 1;
c = 1;
} else {
c += A[n];
}
} else {
if (c + A[n] >= 0) {
a[i] += c + A[n] + 1;
c = -1;
} else {
c += A[n];
}
}
}
}
std::cout << std::min(a[0], a[1]) << std::endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long a[100010];
long long sum = 0, cnt = 0, sum2 = 0, cnt2 = 0;
for (int i = 0; i < n; i++) cin >> a[i];
bool nextpo = false, nextpo2 = false;
bool nextne = false, nextne2 = false;
sum = a[0];
if (sum < 0) {
nextpo = true;
nextne2 = true;
cnt2 += abs(sum2) + 1;
sum2 += abs(sum2) + 1;
} else if (sum > 0) {
nextne = true;
nextpo2 = true;
cnt2 += sum2 + 1;
sum2 -= sum2 + 1;
}
for (int i = 1; i < n; i++) {
if (nextpo) {
nextpo = false;
nextne = true;
sum += a[i];
if (sum == 0) {
sum++;
cnt++;
} else if (sum < 0) {
cnt += abs(sum) + 1;
sum += abs(sum) + 1;
}
} else if (nextne) {
nextpo = true;
nextne = false;
sum += a[i];
if (sum == 0) {
sum--;
cnt++;
} else if (sum > 0) {
cnt += sum + 1;
sum -= sum + 1;
}
}
}
for (int i = 1; i < n; i++) {
if (nextpo2) {
nextpo2 = false;
nextne2 = true;
sum2 += a[i];
if (sum2 == 0) {
sum2++;
cnt2++;
} else if (sum2 < 0) {
cnt2 += abs(sum2) + 1;
sum2 += abs(sum2) + 1;
}
} else if (nextne2) {
nextpo2 = true;
nextne2 = false;
sum2 += a[i];
if (sum2 == 0) {
sum2--;
cnt2++;
} else if (sum2 > 0) {
cnt2 += sum2 + 1;
sum2 -= sum2 + 1;
}
}
}
cout << min(cnt, cnt2) << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int, int>, int>;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
long long gcd(long long a, long long b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
cout << fixed << setprecision(15);
long long N;
cin >> N;
vector<long long> A(N);
long long total = 0;
for (long long i = 0; i < (long long)(N); ++i) {
cin >> A[i];
}
long long check;
if (A[0] > 0) check = 0;
if (A[0] < 0) check = 1;
long long ans = 0;
for (long long i = 0; i < (long long)(N); ++i) {
total += A[i];
if (i % 2 == check) {
if (total > 0)
continue;
else {
ans += abs(total - 1);
total = 1;
}
} else {
if (total < 0)
continue;
else {
ans += abs(total + 1);
total = -1;
}
}
}
cout << ans << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100000];
int pos[100000], neg[100000];
int pans = 0, nans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (a[0] > 0) {
neg[0] = -1;
pos[0] = a[0];
nans += abs(a[0]) + 1;
} else if (a[0] == 0) {
pos[0] = 1;
neg[0] = -1;
pans = nans = 1;
} else {
pos[0] = 1;
neg[0] = a[0];
pans += abs(a[0]) + 1;
}
for (int i = 1; i < n; i++) {
neg[i] = neg[i - 1] + a[i];
pos[i] = pos[i - 1] + a[i];
if (i % 2 == 0) {
if (neg[i] >= 0) {
nans += abs(neg[i]) + 1;
neg[i] = -1;
}
if (pos[i] <= 0) {
pans += abs(pos[i]) + 1;
pos[i] = 1;
}
} else {
if (neg[i] <= 0) {
nans += abs(neg[i]) + 1;
neg[i] = 1;
}
if (pos[i] >= 0) {
pans += abs(pos[i]) + 1;
pos[i] = -1;
}
}
}
cout << min(pans, nans) << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
int a[100010];
int main() {
int n, i, j, k;
long long s, x, y;
while (scanf("%d", &n) != EOF) {
for (i = 0; i < n; i++) scanf("%d", &a[i]);
s = 0;
x = a[0];
for (i = 1; i < n; i++) {
y = x;
x = x + a[i];
if (x * y < 0) continue;
if (y < 0) {
s = s - x + 1;
x = 1;
} else if (y > 0) {
s = s + x + 1;
x = -1;
}
}
printf("%lld\n", s);
}
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < (int)(n); i++) cin >> a[i];
int sum = a[0];
int count = 0;
if (a[0] > 0) {
for (int i = 1; i < n; i++) {
if (i % 2 == 0) {
while (sum + a[i] <= 0) {
a[i] += 1;
count++;
}
sum += a[i];
} else {
while (sum + a[i] >= 0) {
a[i]--;
count++;
}
sum += a[i];
}
}
}
if (a[0] < 0) {
for (int i = 1; i < n; i++) {
if (i % 2 == 0) {
while (sum + a[i] >= 0) {
a[i]--;
count++;
}
sum += a[i];
} else {
while (sum + a[i] <= 0) {
a[i]++;
count++;
}
sum += a[i];
}
}
}
cout << count << endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python2 | n=int(raw_input())
a=map(int,raw_input().split(' '))
p_s=a[0]
c=0
for i in range(1,n):
s=p_s+a[i]
if s==0:
if i==n-1:
a[i]+=1
c+=1
else:
if a[i]>=0:
a[i]+=1
c+=1
else:
a[i]-=1
c+=1
s=p_s+a[i]
if p_s*s>=0:
if p_s>0:
c+=abs(p_s*-1 - 1 - a[i])
a[i]=p_s*-1 - 1
else:
c+=abs(p_s*-1 + 1 - a[i])
a[i]=p_s*-1 + 1
p_s=p_s+a[i]
print c |
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include<iostream>
#include<string>
#include<vector>
#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<numeric>
#include<iomanip>
#include<deque>
#include<tuple>
#include<queue>
#include<map>
#include <cstdint>
#include <boost/multiprecision/cpp_int.hpp>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define Endl endl
#define F first
#define S second
namespace mp = boost::multiprecision;
using cpp_int = mp::cpp_int;
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll>sum(n),b(n);
rep(i, n) {
int a;
cin >> a;
b[i] = a;
}
ll count = 0;
sum[0] = b[0];
// cout << sum[0] << endl;
FOR(i,1, n) {
sum[i] = sum[i - 1] + b[i];
if (sum[i - 1] > 0) {
if (sum[i] >= 0) {
count += sum[i] + 1;
sum[i] = -1;
}
}
else if (sum[i - 1] < 0) {
if (sum[i] <= 0) {
count += abs(sum[i]) + 1;
sum[i] = 1;
}
}
else if (sum[i - 1] == 0) {
if (sum[i] > 1) {
sum[i]--;
count++;
}
else if(sum[i]<-1){
sum[i]++;
count++;
}
else if (sum[i] == -1 or sum[i]==1) {
count+=2;
}
else if (sum[i] == 0) {
sum[i] = 1;
count += 2;
}
}
}
cout << count << endl;
} |
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < (n); i++) {
cin >> a[i];
b[i] = a[i];
}
long long ansa = 0, ansb = 0;
if (a[0] <= 0) {
ansa = 1 - a[0];
a[0] = 1;
}
for (int i = (1); i < (n); i++) {
a[i] += a[i - 1];
if (i % 2 == 0 and a[i] <= 0) {
ansa += 1 - a[i];
a[i] = 1;
} else if (i % 2 == 1 and a[i] >= 0) {
ansa += a[i] + 1;
a[i] = -1;
}
}
if (b[0] >= 0) {
ansb = b[0] + 1;
b[0] = -1;
}
for (int i = (1); i < (n); i++) {
b[i] += b[i - 1];
if (i % 2 == 1 and b[i] <= 0) {
ansb += 1 - b[i];
b[i] = 1;
} else if (i % 2 == 0 and b[i] >= 0) {
ansb += b[i] + 1;
b[i] = -1;
}
}
cout << ansa << endl << ansb << endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
int sum = 0, ans1 = 0, ans2 = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (i % 2 == 0) {
if (sum <= 0) {
ans1 += abs(1 - sum);
sum = 1;
}
} else {
if (sum >= 0) {
ans1 += abs(-1 - sum);
sum = -1;
}
}
}
sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (i % 2 != 0) {
if (sum <= 0) {
ans2 += abs(1 - sum);
sum = 1;
}
} else {
if (sum >= 0) {
ans2 += abs(-1 - sum);
sum = -1;
}
}
}
cout << min(ans1, ans2) << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
int n;
int a[100000];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
int total = a[0];
int ans = 0;
if (a[0] > 0) {
for (int i = 1; i < n; i++) {
total += a[i];
if (i % 2 == 0 && total <= 0) {
while (total <= 0) {
total++;
ans++;
}
} else if (i % 2 != 0 && total >= 0) {
while (total >= 0) {
total--;
ans++;
}
}
}
} else if (a[0] < 0) {
for (int i = 1; i < n; i++) {
total += a[i];
if (i % 2 != 0 && total <= 0) {
while (total <= 0) {
total++;
ans++;
}
} else if (i % 2 == 0 && total >= 0) {
while (total >= 0) {
total--;
ans++;
}
}
}
}
cout << ans << endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, a = 0, b = 0, cnta = 0, cntb = 0, i, ans;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &d);
a += d;
b += d;
if (i % 2) {
if (a > -1) {
cnta += a + 1;
a = -1;
}
if (b < 1) {
cntb += 1 - b;
b = 1;
}
} else {
if (b > -1) {
cntb += b + 1;
b = -1;
}
if (a < 1) {
cnta += 1 - a;
a = 1;
}
}
}
ans = (cnta > cntb) ? cnta : cntb;
printf("%d\n", ans);
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
long long a[100010];
int n;
unsigned long long solve() {
unsigned long long sum = 0;
long long oo = a[0], flag;
if (a[0] > 0)
flag = 1;
else if (a[0] < 0)
flag = -1;
for (int i = 1; i < n; i++) {
oo += a[i];
if (flag == 1) {
if (oo >= 0) {
sum += oo + 1;
oo = -1;
}
}
if (flag == -1) {
if (oo <= 0) {
sum += 0 - oo + 1;
oo = 1;
}
}
flag = -flag;
}
return sum;
}
int main() {
while (scanf("%d", &n) != EOF) {
unsigned long long sum;
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
if (a[0] == 0) {
a[0] = 1;
unsigned long long sum1 = solve();
a[0] = -1;
unsigned long long sum2 = solve();
sum = min(sum1, sum2) + 1;
} else {
unsigned long long sum1 = solve();
sum = sum1;
}
printf("%lld\n", sum);
}
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int inf = 1e9 + 1000;
long long infi = 1e18 + 100;
long long n;
long long a[100005];
int main() {
cin >> n;
for (int i = 0; i <= (int)(n - 1); i++) cin >> a[i];
long long ans = 0;
long long sum = 0;
long long ans1 = 0;
long long sum1 = 0;
if (a[0] < 0) {
sum = 1;
ans = 1 - a[0];
sum1 = a[0];
ans1 = 0;
} else if (a[0] > 0) {
sum = a[0];
ans = 0;
sum1 = -1;
ans1 = a[0] + 1;
} else {
sum = 1;
ans = 1;
sum1 = -1;
ans1 = 1;
}
for (int i = 1; i <= (int)(n - 1); i++) {
long long p = sum;
long long q = sum1;
sum += a[i];
sum1 += a[i];
if (p > 0 && sum >= 0) {
ans += (1 + sum);
sum = -1;
}
if (p < 0 && sum <= 0) {
ans += (1 - sum);
sum = 1;
}
if (q > 0 && sum1 >= 0) {
ans1 += (1 + sum1);
sum1 = -1;
}
if (q < 0 && sum1 <= 0) {
ans1 += (1 - sum1);
sum = 1;
}
}
if (ans < ans1)
cout << ans << endl;
else
cout << ans1 << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
int main() {
int n;
cin >> n;
vi s(n, 0);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (i == 0) {
s[i] = a;
} else {
s[i] = s[i - 1] + a;
}
}
vi ans(2, 0);
for (int i = 0; i < 2; i++) {
int tmp = 0;
for (int j = 0; j < n; j++) {
int sum = s[j] + tmp;
if ((i + j) % 2) {
if (sum <= 0) {
tmp += 1 - sum;
ans[i] += abs(1 - sum);
}
} else {
if (sum >= 0) {
tmp += -1 - sum;
ans[i] += abs(-1 - sum);
}
}
}
}
cout << min(ans[0], ans[1]) << endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | n=int(input())
a=list(map(lambda x: int(x), input().split()))
idx=0
ans=0
sum_last=0
for i in a:
if i!=0:
break
idx+=1
if idx==n:
ans=2*n-1
elif idx>0:
ans=2*n-1
if a[idx]>0:
sum_last=-1
else:
sum_last=1
else:
sum_last=a[0]
ans=0
idx=1
for i in a[idx:]:
sum_cur=sum_last+i
if sum_cur*sum_last>=0:
ans+=abs(sum_cur)+1
if sum_last>0:
sum_last=-1
else:
sum_last=1
else:
sum_last=sum_cur
print(ans) |
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
import java.util.Arrays;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] a = new int [n];
for(int i = 0;i < n;i++){
a[i] = sc.nextInt();
}
int[] sum = new int[n];
sum[0] = a[0];
int count = 0;
if(sum[0] == 0){
count++;
}
count = Math.min(solve1(sum,a,count),solve2(sum,a,count));
System.out.println(count);
}
public static int solve1(int[] sum,int[] a,int count){
for(int i = 0;i < sum.length-1;i++){
sum[i+1] = sum[i] + a[i+1];
if((i+1) % 2 == 1){
while(sum[i+1] >= 0){
sum[i+1]--;
count++;
}
}
if((i+1) % 2 == 0){
while(sum[i+1] <= 0){
sum[i+1]++;
count++;
}
}
}
return count;
}
public static int solve2(int[] sum,int[] a,int count){
for(int i = 0;i < sum.length-1;i++){
sum[i+1] = sum[i] + a[i+1];
if((i+1) % 2 == 1){
while(sum[i+1] <= 0){
sum[i+1]++;
count++;
}
}
if((i+1) % 2 == 0){
while(sum[i+1] >= 0){
sum[i+1]--;
count++;
}
}
}
return count;
}
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
ll n;
cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; i++) cin >> a[i];
vector<ll> sums(n + 1, 0);
for (ll i = 0; i < n; i++) sums[i] = sums[i] + a[i];
ll ans = 0;
for (ll i = 1; i <= n; i++) {
if (a[i + 1] * a[i] >= 0) {
ans += (a[i + 1] + 1);
a[i + 1] -= (a[i + 1] + 1);
}
}
cout << ans << endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int a[100001];
int main() {
long long n, ai;
cin >> n;
cin >> ai;
a[0] = ai;
long long sum = ai, sum1 = -1;
long long ans = 0, ans1 = 1000100010001000;
bool flag = false;
if (sum == 0) sum = 1, ans = 1, ans1 = 1, flag = true;
for (int i = (1); i < (n); ++i) {
cin >> ai;
a[i] = ai;
if (sum > 0) {
if (sum < -ai)
sum += ai;
else {
ans += ai + sum + 1;
sum = -1;
}
} else {
if (-sum < ai)
sum += ai;
else {
ans += -sum + 1 - ai;
sum = 1;
}
}
}
if (flag) {
for (int i = (1); i < (n); ++i) {
ai = a[i];
if (sum1 > 0) {
if (sum1 < -ai)
sum1 += ai;
else {
ans1 += ai + sum1 + 1;
sum1 = -1;
}
} else {
if (-sum1 < ai)
sum1 += ai;
else {
ans1 += -sum1 + 1 - ai;
sum1 = 1;
}
}
}
}
cout << min(ans, ans1) << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | /**
* purpose : ABC 59 C
* author : kyomukyomupurin
* created : 2018-10-22 02:22:55
**/
#include <bits/stdc++.h>
using namespace std;
#define int64 long long
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N; cin >> N;
int a[N] = {};
for (int i = 0; i < N; ++i) cin >> a[i];
// i(odd) > 0
int sum1 = 0; int cost1 = 0;
for (int i = 0; i < N; ++i) {
sum1 += a[i];
if (i % 2 == 1 && sum1 <= 0) {
cost1 += -1 * sum1 + 1; sum1 = 1;
}
else if (i % 2 == 0 && sum1 >= 0) {
cost1 += sum1 + 1; sum1 = -1;
}
}
//i(even) > 0
int sum2 = 0; int cost2 = 0;
for (int i = 0; i < N; ++i) {
sum2 += a[i];
if (i % 2 == 0 && sum2 <= 0){
cost2 += -1 * sum2 + 1; sum2 = 1;
}
else if (i % 2 == 1 && sum2 >= 0){
cost2 += sum2 + 1; sum2 = 1;
}
}
cout << min(cost1, cost2) << '\n';
return 0;
} |
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int sum = 0;
for (long long i = 0; i < n; i++) {
int x;
cin >> x;
sum += x;
a[i] = sum;
}
int f = (a[0] > 0 ? 1 : -1);
long long int ans = 0;
long long int fix = 0;
for (long long i = 0; i < n; i++) {
if (f == 1) {
if (a[i] + fix <= 0) {
ans += 1 - (fix + a[i]);
fix += 1 - (fix + a[i]);
}
f = -1;
cout << a[i] + fix << endl;
} else {
if (a[i] + fix >= 0) {
ans += (fix + a[i]) + 1;
fix -= ((fix + a[i]) + 1);
}
f = 1;
cout << a[i] + fix << endl;
}
}
cout << ans << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using String = std::string;
using llong = long long;
using boolean = bool;
using Pii = std::pair<int, int>;
using Vi = std::vector<int>;
using Vii = std::vector<Pii>;
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
constexpr int INF = 0x3f3f3f3f;
constexpr llong LINF = 0x3f3f3f3f3f3f3f3fLL;
namespace {
template <class A, class B>
A power(llong x, llong n, llong mod) {
llong ans = 1;
while (n > 0) {
if (n & 1) ans = (ans * x) % mod;
x = (x * x) % mod;
n >>= 1;
}
return ans;
}
template <class A, class B>
A power(A x, B n) {
return power(x, n, 1000000007);
}
template <class A>
A gcd(A x, A y) {
return x % y ? gcd(y, x % y) : y;
}
template <class A, class B>
A lcm(A x, B y) {
return (x / gcd(x, y) * y);
}
template <class A>
inline A abs(A n) {
return (n < 0) ? -n : n;
}
template <class A, class B>
inline bool chmax(A &a, const B &b) {
return b > a ? a = b, true : false;
}
template <class A, class B>
inline bool chmin(A &a, const B &b) {
return b < a ? a = b, true : false;
}
inline boolean isMovable(int x, int y, int w, int h) {
return (x >= 0 && y >= 0 && x < w && y < h);
}
} // namespace
namespace Rlyeh {
int a[100100], left;
int cnt, tmp;
signed call_of_Cthulhu(signed datum) {
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
left += a[0];
if (left <= 0) {
cnt += 1 - left;
left = 1;
}
for (int i = 1; i < n; i++) {
left += a[i];
if (i & 1) {
if (0 <= left) {
cnt += 1 + left;
left = -1;
}
} else {
if (left <= 0) {
cnt += 1 - left;
left = 1;
}
}
}
left = a[0];
if (0 <= left) {
tmp += left + 1;
left = -1;
}
for (int i = 1; i < n; i++) {
left += a[i];
if (i & 1) {
if (left <= 0) {
tmp += 1 - left;
left = 1;
}
} else {
if (0 <= left) {
tmp += 1 + left;
left = -1;
}
}
}
std::cout << std::min(tmp, cnt) << '\n';
return 0;
}
} // namespace Rlyeh
signed main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int main_result = Rlyeh::call_of_Cthulhu(114514);
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
vector<int> a;
int N;
signed main() {
cin >> N;
for (int i = 0; i < (int)(N); i++) {
int t;
cin >> t;
a.push_back((t));
}
int res = 0;
int cnt = 0;
int sum = 0;
for (int i = 0; i < (int)(N); i++) {
sum += a[i];
if (sum < 0) {
cnt += -sum + 1;
sum = 1;
}
i++;
if (i == N) break;
sum += a[i];
if (sum > 0) {
cnt += sum + 1;
sum = -1;
}
}
res = cnt;
sum = 0;
cnt = 0;
for (int i = 0; i < (int)(N); i++) {
sum += a[i];
if (sum >= 0) {
cnt += sum + 1;
sum = -1;
}
i++;
if (i == N) break;
sum += a[i];
if (sum <= 0) {
cnt += -sum + 1;
sum = 1;
}
}
res = min(res, cnt);
cout << res << endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
int main() {
int n;
cin >> n;
vi a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vi s(n, 0);
int ans[2] = {};
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++) {
if (j == 0) {
s[j] = a[j];
} else {
s[j] = s[j - 1] + a[j];
}
}
int tmp = 0;
for (int j = 0; j < n; j++) {
s[j] += tmp;
if ((i + j) % 2) {
if (s[j] <= 0) {
while (s[j] < 1) {
s[j]++;
tmp++;
ans[i]++;
}
}
} else {
if (s[j] >= 0) {
while (s[j] > -1) {
s[j]--;
tmp--;
ans[i]++;
}
}
}
}
}
cout << min(ans[0], ans[1]) << endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int x, y;
cin >> x >> y;
if (abs(x - y) <= 1)
cout << "Brown" << endl;
else
cout << "Alice" << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
vector<int> sum;
long ans(bool plus_is_even) {
long diff = 0;
long ans = 0;
for (int i = 0; i < sum.size(); i++) {
long cur = sum[i] + diff;
if ((i % 2 == 0) == plus_is_even && cur <= 0) {
diff += 1 - cur;
ans += 1 - cur;
} else if ((i % 2 == 1) == plus_is_even && cur >= 0) {
diff += -1 - cur;
ans += 1 + cur;
}
}
return ans;
}
int main() {
int n;
cin >> n;
sum.resize(n);
cin >> sum[0];
for (int i = 1; i < sum.size(); i++) {
int tmp;
cin >> tmp;
sum[i] = sum[i - 1] + tmp;
}
long even = ans(true);
long odd = ans(false);
cout << (even < odd ? even : odd) << endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
int N;
cin >> N;
ll a;
ll s = 0;
ll old_s = 0;
ll count = 0;
for (int i = 0; i < N; i++) {
cin >> a;
old_s = s;
if (i != 0 and old_s == 0 and a != 0) {
if (a > 0) {
s = -1;
} else {
s = 1;
}
}
s += a;
if (s == 0) {
if (old_s > 0) {
s--;
count++;
} else if (old_s == 0) {
count++;
} else {
s++;
count++;
}
}
if (s > 0 and old_s > 0) {
count += s + 1;
s = -1;
} else if (s < 0 and old_s < 0) {
count += abs(s) + 1;
s = 1;
}
}
cout << count << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
long n = 0;
long sum[2] = {0, 0}, ans[2] = {0, 0};
long hoge, foo;
long flag[2] = {0, 1};
scanf("%d", &n);
int in[n];
for (int i = 0; i < n; i++) {
scanf("%ld", &in[i]);
}
for (int i = 0; i < n; i++) {
long tmp[2];
tmp[0] = in[i];
tmp[1] = tmp[0];
if (i == 0) {
sum[0] = tmp[0];
sum[1] = tmp[1];
continue;
}
long foo[2] = {tmp[0], tmp[0]};
for (int j = 0; j < 2; j++) {
if (sum[j] + tmp[j] <= 0 && !flag[j]) {
tmp[j] = abs(sum[j]) + 1;
ans[j] += abs(sum[j] - foo[j]) + 1;
sum[j] += tmp[j];
flag[j] = 1;
} else if (sum[j] + tmp[j] > 0 && !flag[j]) {
flag[j] = 1;
sum[j] += tmp[j];
} else if (sum[j] + tmp[j] < 0 && flag[j]) {
sum[j] += tmp[j];
flag[j] = 0;
} else if (sum[j] + tmp[j] >= 0 && flag[j]) {
tmp[j] = -1 * (abs(sum[j]) + 1);
ans[j] += abs(sum[j]) + abs(foo[j]) + 1;
sum[j] += tmp[j];
flag[j] = 0;
} else
printf("ogehogeho");
}
}
printf("%ld\n", ans[0] < ans[1] ? ans[0] : ans[1]);
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
long long a[100010];
int main() {
int n;
while (scanf("%d", &n) != EOF) {
unsigned long long sum = 0;
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
int tmp = -1;
int flagg = 0;
for (int i = 0; i < n; i++) {
if (a[i] != 0) {
tmp = i;
flagg = 1;
break;
}
}
if (!flagg) {
printf("%d\n", (n - 1) * 2 + 1);
continue;
}
if (tmp != 0 && a[tmp] > 0) {
if (tmp % 2)
a[0] = -1;
else
a[0] = 1;
sum++;
} else if (tmp != 0 && a[tmp] < 0) {
if (tmp % 2)
a[0] = 1;
else
a[0] = -1;
sum++;
}
long long oo = a[0], flag;
if (a[0] > 0)
flag = 1;
else if (a[0] < 0)
flag = -1;
for (int i = 1; i < n; i++) {
oo += a[i];
if (flag == 1) {
if (oo >= 0) {
sum += oo + 1;
oo = -1;
}
flag = -1;
} else if (flag == -1) {
if (oo <= 0) {
sum += 0 - oo + 1;
oo = 1;
}
flag = 1;
}
}
printf("%lld\n", sum);
}
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[100001];
for (int i = 0; i < n; i++) cin >> a[i];
int sum;
sum = 0;
int ret1 = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (i % 2 == 0 && sum <= 0) {
ret1 += abs(sum) + 1;
sum = 1;
} else if (i % 2 == 1 && sum >= 0) {
ret1 += abs(sum) + 1;
sum = -1;
}
}
sum = 0;
int ret2 = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (i % 2 == 0 && sum >= 0) {
ret2 += abs(sum) + 1;
sum = -1;
} else if (i % 2 == 1 && sum <= 0) {
ret2 += abs(sum) + 1;
sum = 1;
}
}
cout << min(ret1, ret2) << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
int calc(bool firstPositive, int a[], int n) {
bool positive = firstPositive;
int cost = 0;
long long sum = 0;
for (int i = 0; i < n; ++i) {
bool sumpos = (sum + a[i]) >= 0;
if (sumpos != positive) {
while (((sum + a[i]) >= 0) == sumpos) {
a[i] += sumpos ? -1 : 1;
++cost;
}
}
if ((sum + a[i]) == 0) {
a[i] += sumpos ? -1 : 1;
++cost;
}
sum += a[i];
positive = !positive;
}
return cost;
}
int main(int argc, char *argv[]) {
int n;
std::cin >> n;
int a[1 << 11], b[1 << 11];
for (int i = 0; i < n; ++i) {
std::cin >> a[i];
b[i] = a[i];
}
std::cout << std::min(calc(true, a, n), calc(false, b, n)) << std::endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #!/usr/bin/env ruby
STDIN.gets.chomp.to_i
array = STDIN.gets.chomp.split(' ').map(&:to_i)
def get_answer(first, array)
ans = 0
sum = first
array.each do |a|
if sum >= 0
if sum + a < 0
sum += a
else
ans += (-1 - (sum + a)).abs
sum = -1
end
else # sumがマイナス
if sum + a > 0
sum += a
else
ans += (1 - (sum + a)).abs
sum = 1
end
end
#puts "#{i}: sum = #{sum}, ans = #{ans}"
end
return ans
end
first = array.shift
if first == 0
ans = [get_answer(1, array), get_answer(1, array)].min
else
ans = get_answer(first, array)
end
puts ans
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i_i = pair<int, int>;
using ll_ll = pair<ll, ll>;
using d_ll = pair<double, ll>;
using ll_d = pair<ll, double>;
using d_d = pair<double, double>;
template <class T>
using vec = vector<T>;
static constexpr ll LL_INF = 1LL << 60;
static constexpr int I_INF = 1 << 28;
static constexpr double PI =
static_cast<double>(3.14159265358979323846264338327950288);
static constexpr double EPS = numeric_limits<double>::epsilon();
static map<type_index, const char* const> scanType = {{typeid(int), "%d"},
{typeid(ll), "%lld"},
{typeid(double), "%lf"},
{typeid(char), "%c"}};
template <class T>
static void scan(vector<T>& v);
[[maybe_unused]] static void scan(vector<string>& v, bool isWord = true);
template <class T>
static inline bool chmax(T& a, T b);
template <class T>
static inline bool chmin(T& a, T b);
template <class T>
static inline T gcd(T a, T b);
template <class T>
static inline T lcm(T a, T b);
template <class A, size_t N, class T>
static void Fill(A (&arr)[N], const T& val);
template <class T>
T mod(T a, T m);
template <class Monoid>
struct SegmentTree {
using F = function<Monoid(Monoid, Monoid)>;
int sz;
vector<Monoid> seg;
const F f;
const Monoid M1;
SegmentTree(int n, const F f, const Monoid& M1) : f(f), M1(M1) {
sz = 1;
while (sz < n) sz <<= 1;
seg.assign(2 * sz, M1);
}
void set(int k, const Monoid& x) { seg[k + sz] = x; }
void build() {
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
void update(int k, const Monoid& x) {
k += sz;
seg[k] = x;
while (k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1) L = f(L, seg[a++]);
if (b & 1) R = f(seg[--b], R);
}
return f(L, R);
}
Monoid operator[](const int& k) const { return seg[k + sz]; }
template <class C>
int find_subtree(int a, const C& check, Monoid& M, bool type) {
while (a < sz) {
Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
if (check(nxt))
a = 2 * a + type;
else
M = nxt, a = 2 * a + 1 - type;
}
return a - sz;
}
template <class C>
int find_first(int a, const C& check) {
Monoid L = M1;
if (a <= 0) {
if (check(f(L, seg[1]))) return find_subtree(1, check, L, false);
return -1;
}
int b = sz;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1) {
Monoid nxt = f(L, seg[a]);
if (check(nxt)) return find_subtree(a, check, L, false);
L = nxt;
++a;
}
}
return -1;
}
template <class C>
int find_last(int b, const C& check) {
Monoid R = M1;
if (b >= sz) {
if (check(f(seg[1], R))) return find_subtree(1, check, R, true);
return -1;
}
int a = sz;
for (b += sz; a < b; a >>= 1, b >>= 1) {
if (b & 1) {
Monoid nxt = f(seg[--b], R);
if (check(nxt)) return find_subtree(b, check, R, true);
R = nxt;
}
}
return -1;
}
};
int main(int argc, char* argv[]) {
ll n;
cin >> n;
vec<ll> a(n);
scan(a);
SegmentTree<ll> seg(
n, [](ll x, ll y) { return x + y; }, 0LL);
for (int i = (0); i < (n); i++) {
seg.set(i, a[i]);
}
seg.build();
ll ans = 0;
bool next_sign = (a[0] > 0) ? false : true;
if (a[0] == 0) seg.update(0, -1LL);
for (int i = (2); i < (n + 1); i++) {
ll sum = seg.query(0, i);
if ((next_sign && sum > 0) || (!next_sign && sum < 0)) {
next_sign = !next_sign;
continue;
}
ll to = (next_sign) ? 1 : -1;
ll diff = abs(sum - to);
ans += diff;
seg.update(i - 1, seg[i - 1] + (to - sum));
next_sign = !next_sign;
}
((cout) << (ans) << (endl));
return 0;
}
template <class T>
static void scan(vector<T>& v) {
auto tFormat = scanType[typeid(T)];
for (T& n : v) {
scanf(tFormat, &n);
}
}
static void scan(vector<string>& v, bool isWord) {
if (isWord) {
for (auto& n : v) {
cin >> n;
}
return;
}
int i = 0, size = v.size();
string s;
getline(cin, s);
if (s.size() != 0) {
i++;
v[0] = s;
}
for (; i < size; ++i) {
getline(cin, v[i]);
}
}
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline T gcd(T a, T b) {
return __gcd(a, b);
}
template <class T>
inline T lcm(T a, T b) {
T c = min(a, b), d = max(a, b);
return c * (d / gcd(c, d));
}
template <class A, size_t N, class T>
void Fill(A (&arr)[N], const T& val) {
std::fill((T*)arr, (T*)(arr + N), val);
}
template <class T>
T mod(T a, T m) {
return (a % m + m) % m;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #include <bits/stdc++.h>
int in(void) {
int i;
scanf("%d", &i);
return i;
}
long long llin(void) {
long long i;
scanf("%lld", &i);
return i;
}
void chin(char s[]) { scanf("%s", s); }
void print(int a) { printf("%d\n", a); }
void llprint(long long a) { printf("%lld\n", a); }
void print2(int a, int b) { printf("%d %d\n", a, b); }
long long max(long long a, long long b) { return a > b ? a : b; }
long long min(long long a, long long b) { return a < b ? a : b; }
int main(void) {
long long n = llin(), a[100000], i, ans = 0, sum = 0;
for (i = 0; i < n; i++) {
a[i] = llin();
}
for (i = 0; i < n; i++) {
sum += a[i];
if (sum == 0) {
if (sum - a[i] < 0) {
sum = 1;
ans++;
} else {
sum = -1;
ans++;
}
} else if (sum - a[i] < 0 && sum < 0) {
ans += fabs(1 - sum);
sum = 1;
} else if (sum - a[i] > 0 && sum > 0) {
ans += fabs(1 + sum);
sum = -1;
}
}
llprint(ans);
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
std::vector<int> seq, sum;
int main() {
int n;
std::cin >> n;
seq.resize(n);
sum.resize(n);
std::cin >> seq[0];
sum[0] = seq[0];
for (int i = 1; i < n; i++) {
std::cin >> seq[i];
sum[i] = sum[i - 1] + seq[i];
}
bool is_plus = true;
long ans = 0;
long dif = 0;
if (sum[0] <= 0) {
dif = 1 - sum[0];
ans = dif;
}
for (int i = 1; i < sum.size(); i++) {
if (is_plus && sum[i] + dif >= 0) {
long tmp = -(sum[i] + dif) - 1;
dif += tmp;
ans += (tmp < 0 ? -tmp : tmp);
} else if (!is_plus && sum[i] + dif <= 0) {
long tmp = 1 - (sum[i] + dif);
dif += tmp;
ans += (tmp < 0 ? -tmp : tmp);
}
is_plus = !is_plus;
}
long ya = ans;
ans = 0;
is_plus = false;
if (sum[0] >= 0) {
dif = -1 - sum[0];
ans = -dif;
} else {
dif = 0;
}
for (int i = 1; i < sum.size(); i++) {
if (is_plus && sum[i] + dif >= 0) {
long tmp = -(sum[i] + dif) - 1;
dif += tmp;
ans += (tmp < 0 ? -tmp : tmp);
} else if (!is_plus && sum[i] + dif <= 0) {
long tmp = 1 - (sum[i] + dif);
dif += tmp;
ans += (tmp < 0 ? -tmp : tmp);
}
is_plus = !is_plus;
}
std::cout << (ya < ans ? ya : ans) << std::endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | N = int(input())
a =list(map(int,input().split()))
a1=[0]*N
a2=[0]*N
s1 =a[0]
s2 =a[0]
#正の数から始まるパターン
c1 = 0
if s1 ==0:
s1 = 1
c1 = 1
elif s1 <0:
a1[0]=1
c1 = -s1+1
for i in range(1,N):
if s1*(s1+a[i])>=0 and s1>0:
a1[i] = -(s1+1)
c1 +=a[i]-a1[i]
elif s1*(s1+a[i])>=0 and s1<0:
a1[i] = -s1+1
c1 +=a1[i]-a[i]
else:
a1[i]=a[i]
s1 = s1+a1[i]
#負の数から始まるパターン
c2=0
if s2 ==0:
s2 = 1
c2 =1
elif s2 >0:
a2[0]=-1
c2 = s2+1
for i in range(1,N):
if s2*(s2+a[i])>=0 and s2>0:
a2[i] = -(s2+1)
c2 +=a[i]-a2[i]
elif s2*(s2+a[i])>=0 and s2<0:
a2[i] = -s2+1
c2 +=a2[i]-a[i]
else:
a2[i]=a[i]
s2 = s2+a2[i]
print(min(c1,c2)) |
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Linq;
using System.Text;
class Program
{
static int n;
static int[] a;
public static void Main(string[] args)
{
n = Input.NextInt();
var a = Input.LineInt();
int minmove = int.MaxValue;
minmove = Calc(a);
for (int i = 0; i < a.Length; i++)
{
a[i] = -a[i];
}
minmove = Math.Min(minmove, Calc(a));
Console.WriteLine(minmove);
}
private static int Calc(int[] a)
{
int curr = 0;
int move = 0;
for (int i = 0; i < a.Length; i++)
{
int dif = 0;
switch (i % 2)
{
case 0:
{
var newc = curr + a[i];
dif = newc <= 0 ? 1 - newc : 0;
}
break;
case 1:
{
var newc = curr + a[i];
dif = newc >= 0 ? -1 - newc : 0;
}
break;
}
curr += a[i] + dif;
move += Math.Abs(dif);
}
return move;
}
}
public static class Input
{
private static Queue<string> q = new Queue<string>();
private static void Confirm() { if (q.Count == 0) foreach (var s in Console.ReadLine().Split(' ')) q.Enqueue(s); }
public static int NextInt() { Confirm(); return int.Parse(q.Dequeue()); }
public static long NextLong() { Confirm(); return long.Parse(q.Dequeue()); }
public static string NextString() { Confirm(); return q.Dequeue(); }
public static double NextDouble() { Confirm(); return double.Parse(q.Dequeue()); }
public static int[] LineInt() { return Console.ReadLine().Split(' ').Select(int.Parse).ToArray(); }
public static long[] LineLong() { return Console.ReadLine().Split(' ').Select(long.Parse).ToArray(); }
public static string[] LineString() { return Console.ReadLine().Split(' ').ToArray(); }
public static double[] LineDouble() { return Console.ReadLine().Split(' ').Select(double.Parse).ToArray(); }
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n, a[];
long count = 0, sum = 0, presum;
n = sc.nextInt();
a = new int[n];
for(int i = 0; i < n; ++i)a[i] = sc.nextInt();
sc.close();
presum = -a[0];
for(int i: a) {
sum += (long)i;
while(sum * presum > 0) {
if(presum > 0) sum--;
else sum++;
++count;
}
if(sum == 0) {
if(presum > 0)sum--;
else sum++;
++count;
}
presum = sum;
}
System.out.println(count);
}
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
long long cnt = 0;
long long tot = a.at(0);
long long k = 1;
if (a.at(0) == 0) {
k = -1;
for (long long i = 1; i < n; i++) {
if (a.at(i) != 0) {
k = i;
break;
}
}
if (k == -1) {
cout << (long long)(1 + 2 * (n - 1)) << endl;
return 0;
}
if (a.at(k) > 0) {
tot = -1;
cnt = 1 + 2 * (k - 1);
} else {
tot = 1;
cnt = 1 + 2 * (k - 1);
}
}
for (long long i = k; i < n; i++) {
long long after;
if (tot < 0) {
after = max(1 - tot, a.at(i));
cnt += abs(after - a.at(i));
}
if (tot > 0) {
after = min(-1 - tot, a.at(i));
cnt += abs(after - a.at(i));
}
tot += after;
}
cout << cnt << endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long a[100010];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
long long sum = 0, an = 0;
sum = a[0];
for (int i = 1; i < N; i++) {
if (sum > 0) {
if (sum + a[i] >= 0) {
an += abs(a[i] - (-1 - sum));
sum = -1;
} else {
sum += a[i];
}
} else {
if (sum + a[i] <= 0) {
an += abs(a[i] - (1 - sum));
sum = 1;
} else {
sum += a[i];
}
}
}
sum = -a[0];
long long an2 = abs(2 * a[0]);
for (int i = 1; i < N; i++) {
if (sum > 0) {
if (sum + a[i] >= 0) {
an2 += abs(a[i] - (-1 - sum));
sum = -1;
} else {
sum += a[i];
}
} else {
if (sum + a[i] <= 0) {
an2 += abs(a[i] - (1 - sum));
sum = 1;
} else {
sum += a[i];
}
}
}
cout << min(an, an2);
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 0;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-') f = 1;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = (x << 1) + (x << 3) + ch - 48;
return f ? -x : x;
}
inline void write(int x) {
if (x < 10)
putchar(x + 48);
else
write(x / 10), putchar(x % 10 + 48);
}
inline void writeln(int x) {
if (x < 0) putchar('-'), x = -x;
write(x);
putchar('\n');
}
int n, a[100005];
inline int work() {
int sum = 0, ans = 0;
for (int i = 1; i <= n; i++) {
sum += a[i];
if (i & 1) {
if (sum <= 0) ans += abs(sum - 1), sum = 1;
} else {
if (sum >= 0) ans += abs(sum + 1), sum = -1;
}
}
return ans;
}
int main() {
n = read();
int ans1, ans2;
for (int i = 1; i <= n; i++) a[i] = read();
ans1 = work();
for (int i = 1; i <= n; i++) a[i] = -a[i];
ans2 = work();
writeln(min(ans1, ans2));
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | // This code is generated by [cargo-atcoder](https://github.com/tanakh/cargo-atcoder)
// Original source code:
/*
#![allow(unused_imports)]
use itertools::Itertools;
use proconio::{input, marker::*};
use std::cmp::*;
use std::collections::*;
use superslice::*;
fn main() {
input! {
n: usize,
a: [isize;n],
}
let mut ans: isize = 0;
let mut cur = 0;
let mut positive = a[0] > 0;
for i in a {
cur = i + cur;
if cur <= 0 && positive {
let op = -cur + 1;
cur += op;
ans += op;
} else if cur >= 0 && !positive {
let op = -cur - 1;
cur += op;
ans += op.abs();
}
positive = !positive;
}
println!("{}", ans);
}
*/
fn main() {
let exe = "/tmp/bin31EF0C8A";
std::io::Write::write_all(&mut std::fs::File::create(exe).unwrap(), &decode(BIN)).unwrap();
std::fs::set_permissions(exe, std::os::unix::fs::PermissionsExt::from_mode(0o755)).unwrap();
std::process::exit(std::process::Command::new(exe).status().unwrap().code().unwrap())
}
fn decode(v: &str) -> Vec<u8> {
let mut ret = vec![];
let mut buf = 0;
let mut tbl = vec![64; 256];
for i in 0..64 { tbl[TBL[i] as usize] = i as u8; }
for (i, c) in v.bytes().filter_map(|c| { let c = tbl[c as usize]; if c < 64 { Some(c) } else { None } }).enumerate() {
match i % 4 {
0 => buf = c << 2,
1 => { ret.push(buf | c >> 4); buf = c << 4; }
2 => { ret.push(buf | c >> 2); buf = c << 6; }
3 => ret.push(buf | c),
_ => unreachable!(),
}
}
ret
}
const TBL: &'static [u8] = b"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
const BIN: &'static str = "
f0VMRgIBAQAAAAAAAAAAAAIAPgABAAAAWK5BAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAEAAOAADAEAA
AAAAAAEAAAAFAAAAAAAAAAAAAAAAAEAAAAAAAAAAQAAAAAAAn7cBAAAAAACftwEAAAAAAAAAIAAAAAAA
AQAAAAYAAAAAAAAAAAAAAADAQQAAAAAAAMBBAAAAAAAAAAAAAAAAACjdIQAAAAAAABAAAAAAAABR5XRk
BgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAANw7hWlVUFgh
UAkNFgAAAAAghgMAIIYDAJABAACWAAAAAgAAAPv7If9/RUxGAgEBAAIAPgANEANADxvybRYFAGCCAwAT
gR27ezgABgUPAA4rBQAALSFP2EAHUGADANvs+84gADcGJWoXB2PCPjshmBct6DIAN8EGsm4HAwQ3MC3k
d5ewyDV/5XRkN8wYhDwh2wdDvAkACmwz2AQ3UQYAAAgLdvIQAFJvp2AICfvAFQAHgQAAAAAAAJAA/8Be
AwAMpgEAAkkNAP//B/JQWMMAQVdBVjHAQVVBVEmDzP9VU0m3t///if5Mic9OjSwCSIPsSEiJNCQDTCQI
E+FMm/tvdwco8q4OVCQYSIuUJIA9E/f+j7xtD8gNjCSIRCQgSPfQSo0cIP/b299BHCtNjXsBE1wkEAT+
6A0BkqxIhcBa+zX3dH5Mi0AEKonHOmDvuXbXC1hJAcUHKllL2rZ9axsPidHzpATBEnSAtrVt+wnOAu8X
2QoRtH62+247SI05PEVCxgQYAGFh7ENuG+zZhD6LjKD6H+6mb/9v70GJxILSg8RIRIngW11BXEEDXkFf
m393/8NVTI0NNu8CTA3/7gYVIAoDNYJvDb93DUG4cAGM5VMOCBQFhGj2thW6I1wYMhPfUAJtQQcbe7d7
bAwEUS4kGIl8JAz1BPZnd+32KAayGIsUpHVIMe0xa9vt3edd4/y//y7k8BUAllx793Y7VwOLN40F7rCG
iw3Re2pv3317RTHJFz1HCADeAlCCZpAXB4B/37bfbg50CQg4/yUufCJkPDwlYP9+M2NvAAF1HAtoIN/G
QAgB/10z5i0nBrnIAGZID27BZGYPuLmx2H8EMhzpZxEfhHh7PMYPVRAO8IHsyHtjc0djBTg9tAQJiwWl
Cn233f6D+AMPhbYIThAcFDv/FcZ77LHbhIcLC4sEh+sWuHZmLyw5wBRkSIkge/v9OxIPlcCKSwiEyVMJ
lhicJLgyHuFvoYjIwH6DwxBiACzc9/ax0Qc0UH9YNdIPhC27/R0FOB6J1oA4K3UOKcb/FAtu4QeDwQEx
/7oKP0D2t29t2GYu3AdPOf50NNMEOb/R/e0Pthha0IP7CQ+HM0Ui8En34LLG7aXuAg+ADUcFxonYRscB
lvu38PvGc8zpEkjHAAjKD+/A88hw7+9biQhNhfZvBOS5F0CCYxnb+uE+18eVFnb4nOHfeS3gld5BJC51
jo7KTAzTxSIk+JYKy96e7esloN+Fxcbu3t50iQwkB8QISYBNOfVksSB0ERZRvBeVEA3eUqSFIZgpMaAH
D9t/EBM+igiA+St0JgQtUQT9wuyObEKD+gEbZXQdSAHCvt+/sRDAG4nX62eQsQEcdefjPiSjHRofv64x
DyVc+C0v+jkDnC8cODD/4d//CJNIa8kKQLYD8AiWidssSCnZcc/p1j4tew/R4wHXUE8h24dcxxCDwk76
2NtvMgKeidI30XHQTsaxS4UQt4uE/oC8FoAxYDwAdVRvNPfjEOHPPOs2QbyUagJHSE+ZPRbrwA8VCAJb
w9l4tccwkCJ3jZ9R51fFSYs87gyfw0mB3bb3wecDuGBbwF2J2u83Cm/b9QL+uu6A8g8gfy9nu8bb9sKf
KkkpXdNMiVW+DowvfHpJCXU560OdRI3tbxzFVJjBCMv2wzYWfe26LWE2lMaj/zh0DLUc39CLBCYIidPr
jIgPumDPtiTnunaNLTWo8snZk8AnZg6wINcCSY8cIz3HhAYAAMEWaaTDwFHefcXUBhY+PI2YyB2DO19j
RuYt1oU8jonDEUzLYyNtsdsDzccEKAJSCDDk1wWbNoEeQBVIAVtq20KTYBLmB8ggTGdgu7RKbDiDK+1n
Fw5Jb297P0zrXSsD6H5zCEhk2AKl7QhCDEM0olxuySAXyEyMTGB7+0tr/1A4aAMBihhgCl1n6nFhZAZk
LANKsr/LxvAI2kQzBe9i2xaytwFQBHQkYN1fsW4sNiWL44AnA9gN6bDrMA8Q1Q8pTNDu286efRHoC2gE
4AdwEwLZbuQdFgF4C1FznW0QS/ZCmhtyQNzud+4wgpcA2xwPC0j/aIh9gW4rFOYKrgMvUV2D3eyhVEBY
obYHjgkMD4lnxFsyXcOgyQbb9GacBj6dYHN8fzdoj7F9dmoVHmcGdB92uyMJUKwuAkkJT7xjhcCML+1+
XQY4FQcZ+gFAiLSvIPzGPpHKAtlQvVgFboshD4Qb1SMChxCEr1CwcBaWhCdnDxYhBcplDojrGUgOhGE1
BANYpYU8+mHvkwzvNvuyAYiUklN0ya/BzmIw6zYIrqmrKbiwQklEqZga2vZPQwjjMdLrsRVcY40oRTsW
Gz6iso8fYDp0bsfbD1BggU++xjCGTF1rbju8JSAXjTsRL51B05XcBg2+jf9IhKzyDsxf3n0/G4nc+LsL
+P//kDB+bLljlL8NBEd+KYP4JrHwsfcNGg9XqhGOkEEG+QewoJB5PkdkgKcEYFD4kGH2QMc6akBLUSvQ
3s7BONg1UWDmQX5+G+Ftjfk4vwu23s5B/9a/Bz1sX8AMfikwEF0gbWsb7cg5URA24/apvu5vy4xy9hcY
AnRVvgAdvyC6oddHH7q5It64SEX7JjObKXLTq4IQUHZ4g7EYAAEgPedZ3GLgulY1LDxkPamTxBF2y78E
Fw5y0A1i5cf+NMcAbWFpbssPKAVTp+6VXGz4Qzh80UwG3IfA9rD86BcpB9BiKAMCR3KS/AybYoCai0Ks
IPIjvWOf3rolMI5jRQx4CAInDWvFZiN8pDjHKEttCAyZqZ+nVau4FcMxG1XO9IwZmPBsOE3MWIW3biEI
bVVje3tudBS2QFcDayC2KJQJQbXD78d7+NXsQyBJNX8H2ovWBEF9zhxSsAtPbyQdxHRW3yK7cQjppAtn
kuPTXj4w+J7cyLRd7PdEUHV1aakgW4ZkW/iMZh+s3WrPbBoLm+siD7A1cbItC/EQL5YKkS7NImiXB7/K
LS755MiBaZppCL5Gxq/bMOGyRzc4L9Cr95CTW5xJbjgMihzl2eVzI9ECHG++R0DY3F2QhsS/BLdXKqA6
5MixxnfhY/pjGKQ5dkKlitBQk24m5GRstxmApj/Z8p6TCZkQ2aMnG55KS81vAAQBW47sDumsDwvkUDE2
r1Fcqek9aREvjCL/VfqNXJ3ASfMdyeLW6P9vDotuMInpQPbFBBoHg8nxow3dUkswFn7KGHQKsJrt2dqY
pAMaBEy3blXqVZl8j8Hpqb39NwcPjVAwjXBXPCy2wkADsXA4F39C0EGIUP+7A82EoRsNItB11GZ2tw+w
c7+WKc+G/4EJcy1DGLvtqUTEYLkClN9j0/HmtjHjKFl2iWswJJgFe3aDeL6AHTasz6Qf4HvP0gCm+4sG
ni6NdRwP5GEBCf7IdhiNBhykrA/xC5vNNVKGNt2k50QF4NdNu8JRabxEJAG4OnRRLLRdPHN7dEcJkhCL
tfZYmgDADAzAISunSDx9+QN0KxM4mldpawu0CATcGAQvKGG8TixbBGBM2BITGAETI/iMPRX7FkxBJyge
KCiTE9gmwQeMTCkEfjNtmzNhholDEA8oX9vBBhsoIigyEUNxEY4JbLdLcBFTiIubySttOt0Q9fMQNA79
4UFyQBhsBBn5DREGBosAOShuahgNsw4pjOYd4BsGuRK2D/AVwNDuBZBB4DYvhlgfjkhHJ1tqB0bDkIQg
IRkaUHY3YcBA/1gsRYnOAv34NsfEWsoCmjBoi2r2dO+9exBCKA9QCzgQG+dsMzBCagsgFxg206Zjtos5
bEEIBBBATBCDMa20GqPqwgbfhnUSgHiAdVODQzuwa9W+VI8Vx40ei+32oQiqEo0IeSADcR5gcFm8BY9Y
I28BwAGLn8AQ8AU6wwLgCNxwVpPir0QMhEOr/LrtFcVFA2wBDBOQg5G7CfCl3QsL+WIj14K7AQRsyK6Y
YL/ZyN3ZNCHCC1erAsohsEt3IcyLeJ1wiQyWjsTkFo18q70YAV7tDoRlIOQTd8TLhjyEKb8d60ieDcgz
WwJUl6rBNtrWlWxBFmz17IQJkAGMf4ngUOIkfA16qgIC1voPO9t9kwLz4GgVkDMteOySK7slihRXnogj
gEy2mQLG8QSPx1YqyYuMbQKcPkj3hG9DsY4Z3QiMcOgQMcFNiBSHgwVHgR8X2udT/QQ0FJCMMdPYbUh3
hckM4qb+9yoIdRYovnab7znnXBBZOgVGXFQ1NcW+804Y/UlU24sZHR5mfANIQc9AOLuDcg1VAxZYGgnO
gHOxYHXHgDEJBhsBC8BbkPGy9+d6SjbiVdzCXSA5XcDkFaTpUSUnAhvfdQLIWwh50V8avqgCsUoyyMDI
F2ySb0K/GNiUR4dwOFjKdSHFFkCo/W13bTXwv1K6Kv9QGCAEiHRdo7ABzViWj/GKMShbCVBBgwQucYT8
7xGchf8C8PzFGmGcCFCEb0SJtGedpGByHBa3EpLkAfKS2eZegDBCToG8PKdppwMhhbQjD3Ag4wh9y1Mm
Nr5y6wIgA0wQA0gYQmt+0DDnjVR8BEaH7IcxsCEQ/1EYhY2MsLMD1iSgOWg1C2ietpADGTwC7FFIGRMB
w6QDgwmNw2avj+pWYkK3i2CLR4NAR2jA+NMYZ5AYBr8mtpgXX6fbFioccQZWNMAnKTD/ILFtJvAC5kTa
5MkwgqmY9SpbJ7C5rXU4RDARQAULQeOP1g5FFQ9+CqUCnD/Yn/A3LAoqGEWE/2YB7Ug563u/1N0Pgguv
SQGPKet1mukYOqaTqGF3WLyPV140cgzjRCQo0cU9aHcEasP1Kh4wKd7GJh52sTB1Ri1HGMgQi/AwMChA
O0Iz4ITPOxFQTXy68L3Bdp2APFOEToQeh8BuuwRnGAN3c0coTzHvDcGCwB7pFcqZAgeD0ObJHdIl2kyL
gTsAC7FnMXVkoDlkbUvYtnGLBGDLFu4Cng32ueLRPptOgwcVa2TDvmeVNmjuX/uD0GywlSpaSY1AAaJC
Q/8PT40UNE2NTv8x25xBmKAg9e0MHER5I+tH/9jsS+T1IwFJOd47Ioel3z54JonPNiwcg8fQ+wqdwcKC
3RqowxrsD6KwvTVG0DzZdBF0BLL/9r9bjAJAfBwBg+c/icqD4mT533YmTDnQ/lvR2nQmFvCMg+U/wecG
Ce/+f3neGPByIS8Ag+A/6ynB4gbrEjHty94e5k8gc98TDAnXh/62rfByLOtufVYHFxIk1wnHc8xurQaE
EQC7nyvSxxMvc0Q1GO8g5OFvh1sN+f4BMBnMSDE9vLsHMEGAs78PjxT3MMMBHobksjD4IYcNt2l0IRx0
HAncCgFzv9+6hiqgOzwcwH0VNqCQIBu8UfcFV/IbJNiJ2U2tRbYbCnUTd/sWpdh0A0rt9Uv/6fq20Lan
6C8pA3gXHF0EakHBjQXWz4otNHw56XQ7WiklONex6NsP7yp0kvhJ9+JvJWrN1Cp2fQ9e+iUEYewBx3PA
dt8D76BYrJr/kJTBTSnCC7XG/kkzCD7IdReIt7D92P7MMEuNDDyzCwqODZbL/r49MDM4hMAk4wSK0Ddp
GA0vdQxG4QzoHVaeSGw4ZoeFFfPuMM1emC3sBCYcfQBoG+BbwoumoaoNENZ4i+B4MqhBigsRlrtpWwhN
+fzZM0j32gXtqa5p3hWJRK5/Soy3ctGFDlQ8Ak8nJB+j48ILP990Szt+AegClLtsH5sKwJJHJywB1R4T
hrtw3XQqti4dmXMjz9JsHwzR2Q7h66oRG6RxbcxoRhsLbz93ucHgMMeNR5f4m3z2Qu1/f41Pn7ip/wAq
GnIRDArtMPK/uMkZteadZMR+388PdlPpCzHtSevE/iHbjUsMc7jrLjHJH0se2Sgt7ODHCc822AQKEN8v
iPfW8Gw7AdCv2B2KDhWICe6ebe8cnLqu+SgPg3oc69G2KAyhn7MLQvEEmrCNuu1gtPm14dqXid2WXeuZ
AZVDwJ086ZTRB81sruMXIHJTzSw1hFz47kJsynTit01B6IH5XyQYIDwaAjUj47RRQdgGO9ew/4VgOOrA
xL/qlW4cjPxWKCwCRQBOG4z2/gsfPDwueBM4ZFTjFo8JZDi7dAthXceYrAFb/Eki0qBVzPDDAuTSHSJq
iRVKoScQWhcFWrMCMWVdbDbnbp4CcpOMDMgCAgDEYJfAhv7qIyczkK/AfRdSB00BGWBFksH2amNMhQ04
yuE1bPQNZLhZAANcWOjF4FjVUpbJHnWQ2q0HuCBeai+9xCvZXch0SMfgSQ/uZtqAR5PCPzPB/wA1loZR
fzsKMS0XG7gPdB8SDQLVUrt0R9d16iUERNiD40cBy9Me7kq1IKaYsxByWDZgFV6qBtnvmndK811QQ44b
ID0BH8XvxK1A283UywPGA9vEitu7cxQIcMBOCXsJyr3tWtUejTd2yJPndg3R9Ct9uLxhV3OogS9YWAJe
y4L3nAMC2wIl2vqQLMK6XUu3NTl/AZxA7cuAobbOucGd8p3PFBynETjsbcNFjW0Cm/5dS7jBQSp+cOsb
kBNiYxPLAftk3/aAX2BrV3Y0b4nzSf/DbW/8u3pAdBNNOdxyDnoEMTpCXJ9YYPsjIy8Z4LHYFBk+CV9C
AzAZayH8QWzhBltzSWVbyi/ATG+5gCVaaIkujrYwWWi5c8fJTD58CwvbOe/5bzZuOtF/TsCEsOtu+wF7
dwTbRtGlhyDd6ao/BReuEIYa+Yla9cIL2I1I8B/Pd2s+CGFDw98FBD6NPmSZ5MLF1c92yg59YABlZsbU
xm9AFi8a/2tzlC8sAW1Ln0wCECstCkBDk3jCaGEgYACPQEXoHIyDzC/dW6926JaI3cbg3cOq4ReWLSGH
4Vw0LLow0kNt91sM0n0D0FoUaL1FyC/0YVtgq3Ui+so1YveWiEBHG9QZMMfHg33YGpboHPCiI+cgJtu7
LZbSFzs/WSbUweEhyHIh7U76GB7X+gEgaQJ5F7QBvQloA9L6/80VkR2atCm18vU5GNIyyFwKOfbYxknc
bXQSikMRHU+KLWthAvA5cmEbfxxq1Qh0F1/EM9zGIctBBU5vKIPBPSw2hcfwJScJR8TGwWI59hlD1glJ
6Ah+KyWLVvc2BWRhByUisCIM20FvwCUijS1crhwFRgZdA2Obd8FVS+kBGkF1bRZ3Ez1TUPsVETDIM4Cc
LBsVQvNKnhwE8K3prSAjB2RSRtitxZMB+Qy9TFSsqXkGkJqRR3Q+Bntyti2EKHN0YSRtMrbbxVGrdE8N
kLQkUOO9gww8ebSj0C6Dne24I8rr7S01TycqEV7CfQ1vsCsdEPNDdUAWWgUweAy01eRJHKwMjo1ydo17
4CHyXo2QbCwYREYPCm91bskh68ChoQG3FfR8CO04Xx59AtqNRv8FOgRdNC7KlWz8tIFwWXUnG8bB4wbf
BKu3XMiWBnIMALYWBHYRJu98IcJKf/b2m8EqQITteA9myonvLXPS69xI4jS0decYG3pwwrx0q9U7xaeA
/aio6xCv3GUPgMIRllAYuS8OuQorXuXPGUUv+VwZGTLrK2G7StYuwiAZ4wyk22Ifv5wl7cb5JV4HHSsM
oW8SK98yeipft0oroGt1LmdD+GnDwDHSwu8SAMgJ0MFg4cL0QN5NHdBblIVDKVyvK3URbXBr1lb+E5Vd
AzHwbYFCqXpK5PFXtb290fYUC41qRP0SMY1ydf4ac2ILXbh2wqnUg/r7H2/I1p7ZFr+MCxrJygTbgXAN
uuPYO4hd2A+Abf4B6HOpMw1mrcE9MBskRDZiofaB4QD4D1kAALkvEXuME0TBPQcMQAjPNwNwGBPTmC3B
6YXW0KUG2/B/hC3nsKNvd/uNFTaMAim2NMT+A4UqODfYQXyNDSmpNgzxDqPBj04wBttDHIWjsV2CKBxc
DOTdToZhnp3x14qW3wcl540DgYCU/09iEIQ2A8GJ6c/jUgXBIUmUjVFFwG/7pTn/eBiJ/ooktikhrmMI
8DQ2fwdNKAJvN5YCcQjmPzbQif3hbtSWjj//RB29S0T/4fjYGgjFQScj5gZECc4U4NtwH0VCH0k5su3f
B3jnHes8MfaNwEOj3i18d7zB5fPufHVJ61yUJ9vLXBxBc74dDCu3bLTG6z4xNCXl5jFh25B6Cf6B/ozN
Zq+JVpW6KnRwl/sz6uBUjqX+qSEmdIA8S8NhbEegRAOa30AJxQxYKC2wxaQY3E5kwSQQ9qAmGBkUIneR
ikEHM1NKCBY9OaxhkptLMH5+yZMPC8Pdtx+JJ4kMuyH1L4kCYFAeeHnrEIqlUUgCcJ4+DgmxUEh26x4R
OIaI0b0zH3wb1hCk+tZ0BNrrAjHAbEO8XkLtjUSbiATfEzkJrTgJEAtEACIr3A8MdePxVa6jhaEERhaC
JFt8Ky5UX/VX/T89E5wN/EX0FX4E5JFGML4rtoneTDXb7A5/7InvDPSwLVgjvAkTxgmCSMDbVd1CI/X2
KGITC0J2QkSAhSBfgG8VJsJQocp02yaIE1GLPgJG1OYoNF40GzTX8QMlBGOX/hjDL8M/UdtSd1NEUEzX
AvZQqhj0FwdmGRdwwwZmGHg95lQnNhfRcP91HQm68AH2W1fsAoPGURXHAgVYOIC/xCGLcxCHrrZGBuIN
ktqYJGHxcNttgHxIdSMhPCS/CNC5IFjGydd8jOqc6YDWsqpQ0EW8gFif7+JbDLgKdEcZqSjGRxi43RaO
CMFP7H8Q/OyDDh5dbwRhCLgVBohwTIni24SHrdgdx0H0MQYoAIfrdidAAEjGAE5HS0ORLOJdQAZAGP/g
L7aNNUdxaCM5AkEftIuGU4nyrugqvhlFwuhI/1f8b1zXigtGizcul8cd7PaFNZl/UP8Xl1nDTyaBRpYP
L1CsuNThh+BHAMdHPB2sblH+dRIoL2UEO37XY1BgLzBEil85iiCjSPRuoS+NawZJvgA+l9y6hP1Eidnr
IJ+cKcKJDyLFpx2phdJ2Ly3VUShd+FFHSItn6GXx22gYfw/nbi7sl+If0bhJNYlPKEWjJEUrd6kUpOmJ
zINWVnsrWb/x+XRZKA5VMLWjHF8oLJx4wNao+fMn3BPttgUF1f1MJft0BEtszdGNY8tuIxsxP4C7FFsH
5YAJ2iDbxf62OEB2/XRFTY1lIEVdACKXba606zUHcBL7S3dkK7WptEnrE/Q//dqtH51zwDvKQf3rHxnc
XBckWhzKHhOB+kcNbQg31Q9Xz2AzxELhE/Ft2yCDC2xfxfkgdw1gzrej9oYDaFDoLWDnu+63b98MbBnN
we0GKetIwesEGfAT3AH9chm+roP7DPBkwO1JJOsdzzV+oYFPNGPsMwQ/L1LG7rbVbQ895gS4xhd0NTdO
bH+L/rppSYs08kxzzg9faMXbQel4T2XbdXSARsLB+H84AHQVV+sYz8OlBj9sOfKmKDkB3G6cVHxBswGx
AU0tRQHwricEmgYIDj1uPm4T8j2QBj1DEgWzeNYcgY8KATyfGUusil8JgZGPSEjuSgJD2V+jRCQgIk8G
i9YoX6VoeiULRee31tq6riEwjFqQT2gP+BkwEUvZIKg6i7YeXWNetSBy930v7B8oDjAaczsjORvsLFsC
eUhkTDDYseBMoGACdzj0NbAngTGM0nBJuMR7weNWQbsnD2UQJ9v/Z0/7MTUSSbhLWYY41sVtNEx20ChA
IemQAgD/h9AWf1/d6gtpwjiJ8SnMt7a/tb8B6AJpwHsUDwgRa/hkKfkTyd+FG6a3QGZCDxz9Ckktdwsi
fMP8dHLtjWDD9QUXd6/FY34vH4ZtmbDCQsjKE8qdYqS7uU+ACQxKPUz+95e6GVc0Cn2cwjBCiBQcE9bw
7nX/6yC4Sn+16+KJGTUu3Cc7BFBz/k6NBCnFGry6v7njTSnZW69SJzyC1oueL9SwewgJUq8oT4WjelLd
ndkICwk6Ix+JfF1Ew7ATbgh/XEoZXBg+QJ9bcrCML+nUz38LB5tpxfMC1apcb6jRf/Z0UkSLQzBFU20B
RYXJLxSJp7rLQX2HRPJN4xts/wH5QfbABHRAMOpA5HR4SSjobmmp/7PlcgP+A3NuTZ8ucX6Phe2oM2Zm
M4nY3q2HZ08BVUYtckE0oJ0/dcDYKwU/oGG1M5rWQqHvXF036inFNdxBtAEEW4NYODVqi0M8KO8eogcn
qvpTNBkx9lGCdmNaSDMp4sMxOxZv7QVRgPUNWQe1EJwrJweLD25Nd7sQTwMcbtkHAuEDYuNArjvrCwET
DwbpEu62hbgPbOxF6AN2D3Dd1Ld7694Ec/M4VeMDcuQfEuTtCdt1m2bjGNti3AjlhtviAyF2W3D746YE
ENxOkepCIVoZf+0BzhXY8OvqBNMy3B50IWtaoMGfjwwXgOHAo1aAtwywOTQmxhFu1XWEbaOF5WvhQPHB
1Shx4UBfOHFPCVMIiBvecF1Cz3Y+TAh1eIBeWOj1CAfKJjg8AwagFf63D0XIYFubNNz2hpoGSGMEgVrI
NfcFwsNTJdVEoXdIIJyCw3yxtWW99uhKGTSibd32k8cGMHOKfYgNtkHCVv4GAdCE7g6SnMCn4n9r4W63
faftPf2nNUevSNHtGC4Z1B3R6sRIPwpbLDTs/3QapzA08iAY/1xHq+hwOsKLazRdpN6BBQ/4f97q2pYc
TE4cW6+DxwH8cNAwQ8K0Nb9i360AKcn/U23qava5P+etpSxJ0e/CpZCfS61WMhSLEXvJDMSwNBdXfJDU
zNl1QXhrQb/fVnPfSU8Pe9LDVUrt0LDw0esRAYmEin2ICK1ooVo45MGrQoyGXcNEn0J7VqXDzkXw4nQT
h2AEwA2cIXVqIGyt+mcZ/zUK72YtAvJbTpyvGASDGVNPn6vYgAKf+jnBajIYIGIoJMggYPAFZjUjqEwP
DIJVTEw1VWIwqXgwOFB5hAUMT3+R+eQoZAoeDRYCRiNPUtZwaGHZAvf9vgfq2AJHsar4iYQOATgY7R84
iVk7rMc2tcU/OH1PjQw3lnWjxgEJkaMDmf9C7+OFrg6NV3MH53gVSPjABx7gxso4WDnFXYjtTa85ynRK
IF+OxwLghdgMw376IOIfPNQ66pY9TRtESxqJL4QDtzlBHGv7RAnbPstvozwCOx1IQQKD4BrkCv0c6zrN
ZdIFoATBQz20AB720BNF/so6c8UBiP1utdOJ2I11OIm06PZGDFrTCcMbgfuohMTDBDujv5YWahOFMknp
6vn0/hrdbv1J0tM3jOksgwPCUo1NKHQjYdJB62BOYPChYPkIZ9DDGij6RjkHBVzE2ogSBm8EnvygAEcM
RHpMerAVPE9UevrwepxA0z3/3wcC5/96AAS67hM6Bu//oL0LmcLf6vqBtmRG/zi2Iuf/24IvPxwygOP/
gPuAK8cndFB3MADwdeQyKYdtgQsMi0XbOe6DEWiWhwITE1RG8jXE0lBzE/hLgf4SbjhYbzq2DDrXPX/W
VmrRu8pC8Ye2AYy5BEeWtw9S9NAA3owKaXiYbcHQHig3/0T3DOfJkw9E/3gHeQ9597ANhP7Pv15P2wfr
zglNAuNPXhMeBkImAKHrT8YwduLGpgHYZPAs8wzCHc8hMf9PPsmDclAKK0x532or8Tn6T9bwEcBBi02N
2mKJOGsDy81R1Q1cQ4OL03YMirifFoqeyOEBxesQBMARzRhywOjLdukMxnJAbxi0fSAD/weB7UUoTHXQ
50G2AetKRYtlNDMwgWEbL9EZEBzbgNQuTRdtKETgQMqND8PP2nQINM7mzwMDRIk1SjCyVm42rRm7W8BF
8QP4Tf9UhS2BYW2hNqK+kOD/4J+B7NgPTirOFMA0yBaxwakC9JUPAfyojTaVckWk/9/xuFoSdQflRTHA
79RS31j/BjwHv38anVAQvIZ3LAF0FkxlPSlxiea+23Xd6wYwTVuJvD8U3QMGTGuogw2+mFsh+gRDJobX
6k1SuW5syNGI8AGEPLGTou8EgCiwnLhrHHZrgPLPPhw58QjK3n57+D9R8Q0N1nQIdgmNF8B8TsRrlQig
1DhktwboHDaxMVVOAf/ddnstFr8xfRQcQr/6qXuDK0j7wnXj60XQeiM+F+AanfqWyy+ogN9uCRIMB68R
hNJ4ExSpBlgeDCgQwLJw29g9PfhF9xFxAQDSYLtRtQxLEEQsUd3gCW6cwQJBpsgkg+a3tsZH11CjDvn8
+HRoxauGDgAIG+DqBkoVZ3lzQQnKuiVwF6dyMSPwByAJd3aB5hw5Y+YSH/IiK74jQUFqdRB7A7bcwrpu
6wQMG0SaJ6x59ocsch6+Ag0ACBA+enSMWx++BIfeAHw14YmzV3RAhEwncYkDZzJD8k1YOkjFEyAMke0B
ABcNK7tigfrOth8DEHg/oGkgDMgJoAGM63p2WNSMjZgmcS4ZkgGBgQVQAvUkJgWckC6B2DKcSJzjIkf5
DSvuDkwkEIfDf/FJzoYlnMYGexKoZJaHBSgtkE8GkgMDAyctHRA+JI2EJMBL9/BiEZOSh34pJB+WzYCZ
T2wATwa5hDCAiNAsARtkULKfDFjIkwTfLG+ARVIEXwIowcA/yRHtaFvf+y1+JUYorB1P4H4OEbDzxCi+
tDtQB4szPHFH/BoUqm36ZAlpj63u3KZ2GIu5oQxEisVI3dhUVAl0pesn33pZ7CjMid5MQUiKj+3a7H/w
RyhndZi+XIgcb3SF7mNEhcB0uGXY7f3L9UG8i7K6VcA3xnbHc1paIHZ7QbUEHL59WWmygEutVXXxEpuA
3U0/ugegg576Cw9Chua9tTaAAvIMV17x0+psS5svvQ+NSjDGV5kKH/HabWgAAx9AnT6+e8OG/E3/DAO+
daoLIUIDmyAbEiIGGWqHvy2q+0EXKvNJjUHs1UlO+ChOd3PHK9wIMgjxKCDxGDAgjH1tkwIdKPFUI+wo
XgotdAqGONjDW1Orw+nGCEyu3hGPBoU36WzvD0U+wAUD/MAwqPZC3QxC/N56D6ggCkMspflEv5KDQ5wq
fwIATwjRmj/hn84pxoTYhuQPt8b+E/afEWLkmwQKcQafJaeSkfnRr34QXWHJBq6srnY7Q/yjVBwHpPFD
w9tMjRl8RZM6osgf4LZBC12I4TtRMMhWtFDG6PmxytlPTcjRwdfS6z5LUsmBDZA/N4ZoyIrsdzyCEbOi
j+wZePAdIxeBxGbD5sduF2ERyUKT0ELCBbnkMmKrfW0GCAVLyQFBkVWBpIBANu/Bqr63WH3xSLgaINqq
ZBWvxvW7izBAEIKSWHawuhTichDwRdoMcIOF7XoYAyqDWu8539wJxFI0+/xGWqjVsaPii2L3WlfBFr1R
V2CLVQhlsQ1oqierRpMOUP9hesGOGMowvT0/dW5Tt7b4h0TpBoiLD/x+8dTtlz1G6GY/oXUp/Wgp2A52
Ot78Rri/uQYHGzXhQoVENAh1CsKtEmweBIt1FZAYbSAEtARvRzcGQeDwuQGiSBgSkTQjX9haRC7gJh0y
yYYPGh+RJhnAX+Agyi5jXWwSToTZUKThBANMlADLzN5bahB+Qf9UDAgOVMv9IhGophphpDBcgVlwFCE6
+AtoGhzZKxA4UTMJDR9ErOt6Xyh/3CA0NEXjxGeWIHLeI0RIlGox20yBms1V7K88H2iJH3V9e2TfTTnl
czWBdB13i1QdGMWt60d+wxCIyFPrOwDD0i/yOet2MuuAi8nmAfuaaggQIT7B5QRV+JnNLQAtCIp1AjRC
oq0GErVYZIoBPXDZJhnOq3pY7CRSrRMQDx8A1oEMb0elyfKiMuhgem/feRwAOUCpeT+Nve5glI9QQbh+
eAz+Szr3g/kedx+6dFUdmmzgVoCRRIt5zLpusfYSz+RKyEBcdQeLC+HVAgociaEuEb69RGz+AOxnch24
HnW7holGgI9AJkmHS4Zu2LpyPLmCcLsEF/CppgJMHttLFMKtALdpweBGFeEbjTtOW3UeEV+L8PBK8csu
YBPRvXzLBMHwFuuID8tKscoBIGBFa4nCQbS96E1uK0G76QeBJxwwUAjWymVuBh1JKhUL7bf0/xQIRTgG
TY12AnUzC8JESwceIGh87volAWaHOfLwaI36D9kZLMj8Jn6/Szg0E3XtubF3TNBNOc51sfZu2y12zl8V
gliwVQVGgwKBIXj16o1Z1CRUe1r6ftkp0XknNEssw4lLSwfNLXXif8QIIicO2NvvdgIJ2iIPiCE0AVPB
db8tDnb2ucXUAvVR0eaCAeTIQSODHIMtgzyQMaYAKpAHeTKVz7Nrg/qEkH0yIQkg6yXM/Qs8e3gHyMao
IFjrYI2GEP7ydmtLej0ESnJTDOIF/TeXbavDCwxGHxQfDAD2RrksOV4xBw5yLvptx4XSJTJ9PR6KdCAY
xJ/bzylZKXIVCstICnYKQb4RN15WeusXHcgBD72obRs3i/EcgAIFBxoD2Ch0/beYV8T0W+1/TwiJdxDG
RxQF2mMFZolHFb9Ggg8pRxcqXky8ImLUo1SeYrQW8FKxTgBMidZDDhPyTYEiH75bDWT3mVEkLA4lAUjI
D9gztYhEdiKiILUk/zue2rBwYd0LbboLRuCaFxaETx/2gw6siMRAlf+MfsgDMfQFRSkjJ1hxGAVFOPCn
hlUcSF6pgRTLqig1vzoVBOzseG/s/yhYrDB5s7fz///gyWEEDxgFUcu+DYEOC30hIwBzBDhksAKPWCgL
gHywXRJwAo9ITInGd1ssYE8DSWfH/+EHEAgC7+5NldNADiBxdO9IDgiB73aeTIQc73N3uXNKJQ9AT4c8
A5gQ3zjVUjZN8REsQtS9+fYo3MixgmVW0GTYB75xR9AaeUEQgEN1POtwANvJgm8B7nvsg5z8DPk57mSW
nggONnMHYDt0NlQ8A84GupqggPNssO+ULHE8WQcVoSIVPAuYUjooIghwKicNxlNBBCjUCmkBhkQNMEHC
CToJUMRPrDAzJpAJToCNIC60iDSjznQmxUCCXmsOAQov0LDuWOLI6VL1L9yR40k2d0nGcsd3bSABOmFf
80GwMENIUD7JaCRQnzxSd5/ow6gnTZGfjQw+MaLBpjgp+iTvBF2AvsLyUZ8BCqtWNIFPAVmWFrkbVEMB
TbODbjIq0eHvr/YfzSo6oEyc61UbUQmiSr8z3fs9iG8S4kn/xaQXUO2kRrD9YOmqUNwcys7Z7Wmr1+53
UTs54giAfAnbS5wuhlFsum4jxNjKEg+71sYsGQhIUAH+S7AEPSP/jTxP/4EEvbCPZo49AQpPWBbjhI74
7rLq/vDuL1Ag6bcPQYoUHp46fcHG2Lc0iCmot1CGWhjwJdEPdBPUiltDcmdKfKhhQPpeTAHLP/POO374
KiR/93YVzksx/xWSBP1ec6Fvbb7RGgpgxQGYAynCMcDkCCErv89QDIMVhyPIzJBQQU+npw4VGI5wxhoQ
I3Vn5XFJnv22YIKpm+wFwwjDdQw6AL/dCXZXQ1Yuv35QTC/5Pvyj2HUrhNtDTjwgSCvVHBB9D9BXC25L
Ld2pqesCbiQiSQWmla5RbDj3ZzHSJxE8BGDIO9yUO9wjrIBEup//gngHeftBtQHgGkSIa4B0S/AIxkMJ
S9h0eEC4FrbjxuLPwkTb/zdsiwOLUDCKSwn2wgR1dYGE7m49uvMNvj1r238GD0TxEooNFABwygIDAGJV
3fagAbogVBFewBeITWzVQBiKkAIbKwgAdpymGjb8RkCB/0H/VhiCVCnNAVsATSUxRHwDsARvJKVLD6si
EbzHEEAggLX2S0ViD1tyNECKcDgZ6q6J2wACSBByYBVkQIgwBXQOpykwOisewaFmEWDbEIu8bhojALlW
Texrxdy7JYJYif8vuYu9iJAdQL2d2V/xLVWLrzWIe/BA+NhoocXEpq/iNVBiUD9zBAvb/T5QBBFzFVIE
iBS6AW1tFWMPWcMUidMIvhB11SIhNoDtycCITLasa9wVJD/cLgWcLrZb+9Q93HMwJxrhDyfgWLONfYnB
Nj8OgAU2bNuWPAa6AyASHfAsyIUtOQw7BpGEljwHugRf220hAn96BgJOEANWPoQJDZ5UdKg1LhkUJxqB
UAhzLpor4n1IQ59AwyLeP+lPj4gQkNBfPyJK2FAwn4OJRCKsIIQcCxif0y06retR+0DrkYAdjvWFV5de
WHrpSH1TCBIw9sHQRC1KFaFl5+yJGjnSqHvUBnzy4FlCahBW1UlCciekn1eVQaCkv5F0qnjSMgOLSKCS
yfQuUMigjrupMyWkoI0VRKCQKELsSP4IikSQXcCAzRYlxEkyVW91Gwu3UkC2iRxqT2sQwLMOBP7xaFvQ
wmBC1B+uYtfqxS/Ldih54d5IwxBPj1cghosOwUVXi+KngziDQSGMDxnVe4AeEbMKeld8CBK9Qii+Iucc
W5xTQNdA7YQIRUoaNGii0wjAJuKvRC1EvDhA6yIbtZ+MvwHjTCtkgSf0B0egfupATLtbSXJRB5QA6WYu
bGgEHXYXo51ZTFuqkBAPDk4kfAE3oEZrxgK28owRbRSV4XBHBaW6AOh0R3LkaC6gTvIeNd9H9EL0RAnA
dj4fQu8jakTZduUdLcptFPTAa4VRlKpkRvZe5lq18xXFFT1zwvQGcKAxHSox7QloA0ZP6BJtx8iiDcg/
BCwqcABPifv8Ux/gfCPHW0TBSmMEuCfArUy0LkiLQGCicVJ9CRBUXDLwoRF6wVjS2kVb1MW+/QGjSDtc
JHQVD4MRogUB4DuwDjYg3ZvTHUw7ZCAWQiFhAD/IIEgDXCQIOq4rJOOJ3unMKSx7gMcDvhwyMD6MkLBE
61KKM/M2jyjRNYhNHxxxAWPYSQFa7FgiqE2cUKb4fN5aoR4USYxNrOqS7ne/A0+2wx7Ps4TaURCqjquz
ZQxQF3Xroocgq24oF90RgNtvtQEUty7cLWxD0JQCjxjT6PsPjaEWqpWxl688roT6o5OoBlpAs6JYxe82
C5C7gYH9f7ghxz5YXLsCEAAIC3sjAA1YuyTbNhMobANCBLZtPE4+nlVwK09YX7d1kKF66LM2qSxi8DgJ
3/XrdCdzC6h/Gv0loYbI7/JIFbDwg5griwHe8N0NCASXourWiLKAhBB/A4BTFukgmyL/4L7JOqxVcId4
CVgQbUkAn49w+zaQmKbP1j4BdAcFGwZvdH4Qak2LD7k7GHwE6AS3cw6ITLkxuNQu+VzmXYH5s7AR0OAx
wepAIsrWMlhos3sEWdLXBSY463+53E649oF7YUkgqVj/4TjELTgW+yzLDA/gicpHPcEyKMvKVJI5bNuO
xus3HRIa8CkMIMmFLTgGdoGpzsNIDFI3LC5EwIIvtKtykASxfIkRLB9jNJCKP2byEBs1REkpdMRLNSEy
8C2DdbONitRBQYYZuQeAbdsUaV7WHBckV+h2a9C82XVXwAMRR/sMggXNR4VXMGYLoDu7ezgBASpltL03
wEK42KpmkcNSwwkJC74XOOZyOyXzv5fAFWwaCEC9TSkKAa6Kzh0HYEvUqFymXzb+G2ivEjVDHDdBOBwv
csx1tYJWBg5AG1DalrgozUk66ANFVL+sCzASDulAcr/rHOsCZreQDnABhL7BHR072QGhu63tvSDAuaCL
PIOsKC6fKEEb+K/gifFMKelhjRwmC/a2MfUg43NeKZ8UtxREbhQfd4c5lLQZMF3Cn9CZnAHsplvWPNBA
nxt1Abl9bzVg257tHKK+6UwPqw20/UbxTQ9H6QrlEGYp5xaUPuABpWas0Qai/b19GEBPjXxpuzKciD6U
s6fT/6WhCeIVnh0J2u8ldKWKheZg7n5Q9dar3xKDBLZhJOPlbQib4IscrGMhwBVbsCEYAo8EEW5yNAG4
uzIfYBJmr4/HVYa3NA/9zT1Wa6eKtkr5JNgjMSaCXwdze+r30J07HATDKdabKWYEBBcdxdy2AeBAyCgU
UXkVf+ETSwQHQgQ3cpl1J6BpcGNW6ixCwNCWqBI42v4zilh2wjJCudKDQmEIG75fjtrZWwU8X3fSlCnG
O+LaTraAP88p+6bTdaegq3XRmUvzZMKCjc/iOs/uBbZNLugX0M8Gc83Id8XdLM/oG8jnoAfPxbmIN5cd
Me2DhV5JOdGG9yBc8NFN7k1MiWzwHOEFDrlkSYP+zmNW1gF9PJD5uFXX4Q6ADd7zRTH2bzFi/MTjpyWS
/CrB7gLV7xkoTJKcRu1/ESfDZcOr5ZQV/1Ejj90RydsV5wdvHb9XEkFAqMl/XV1TQaNjKecKPDJmIr4P
Ce89GAPrumcbCgL3GfRR6gO4Bbeu8lH7A/P9dO1Ot4UeiVrz5fL95wdW4HVP13QPw8Yc9usM7mPPWNMc
6OlQBccKBBszFTzPqQ4HGTfYwS4GddvKbfklde87XfBUyWHBiljH3dN1gyD+YMQg5ssQzOHLtXMcW1bN
dKr+kl3BWfFhfHpj61TOPWNn6NIKAtpmA36zkwtCvFCkBxMleIa3c8cLb+xc1nDbaRWIjDXd8/Np9c5H
AdCN4CL+VOlR652L6J46b9Qs1ZY589h0z7rjNeK0VsEUyOvI2NjxivGNdB6Y+LZgBI3Hn04wegHgsZwP
q/IZdfBJrIgA9NuHSGPbfuNMoQ0CfT4AB/Ep4TExCJamUdfvw0Y2Dvb+g+YB+2XbLffSxM4eCH9P6rkH
HMBIbi2RT//txpYKihfa5QosFw3ZgvEJ7S8YA0sBxrMKAvUvUDCesWcFxQoEzS8j2GVbDgcZBnUvHGku
AMLHY6zsrHtWjWU3Z3To1gonPIxnAt4vjE5EdHCVvIxOL0hOdIwRHpxU3oZU6i+49VaAZs51BDDrGuCj
qdgz+e5ELzka28Yr9C/6HcovfGdkohsJOwcQF110sXsae0JjFbajsWJDIMtrAUMwB8WA3OVzOFNAF6pB
G2qoJ8hzwktgog5rIe5zV4bxwcGFYn6QB1138fX5F/Zkrs439bIII2STBHRp4ku5EJIZIHPAYxPFSVGK
XbQswg6pOtF59xahGXBZDGZfPToIG2JJB3YIxWiM87mrNlog1RWOWW5p3wf87RwEdlABhNt5C0JE88Kw
DzwUo/KfaJgj8fsvPedNlgRCigwTgPkCVGdbbL/tUud0TQQE6GjCHjSJXoIK2aAp17kpOzCwwQDOqj3L
ioLfNvYJgPvwMo0I9C1nq/3Fdox0aSM+kB9nyOltW4vsDUMdXgTt+SyDjW0lPxygaF0lDBXnHFkagbtB
sL0/+oXtP+4VLbWzTXrhBT7bd7eoaczAAjFmnIDBcBQwJPm22HIzfiHgT4TbjjUVMocZww96Agu0ZRg2
uhdjOdUW40tLTAQCuzBu2dgF6M6TbtuKGyWA+22DZJDuaOEpAwNugiPdaV2XBI1rKwt3Ersl7MvowHIi
lAjj/jgANmxk7hwmlMRGpHt1XmYD6wcBrnpWB2lUNwj1VmiEfwLHQAjzLQjTwidNdzzufHjZUjYYKTnG
dGmMQok2ASZplk51sm9biYg4CAJwCOtgHiaMLUCz/aqglHVjx8YVlidYCFxHBk/du7GKXLQ4OnMH62kG
cr9t2+hkdmwEMAJ4UQ4PVHZVMYCZXDkBz+6+k8Bdwykqd/x3OHNyJgjxXGBvA8inkwE8gE1XiaxWAvHH
SInWrp90KzhFPS9C8WEjwBXYeExghreGaPA/B2TxSfdrkQ4Gy8BMyHNrw3bUFGzDF1ZXu4AAVAbaUITe
UBvrcZBmkDnQW9WzdnAtGnhYISnc+0n9wfbBB3QSm9By5ekfDXihAbW7IxGLTAYbYvdfmAsMBkyF2XTp
IHO7D4A8AYh89gYAeLEzwnXxz9SATgG/jNtxetq0dDG+VsxAa7/RbWMmamgXhs8lLqHv1zUtsyeAxWoM
SNqNU6snnSLRQIqazeS4sWl0Qtt1UavFcK/TUza7SGLpTCntdHnBIne3MWuXKeXgLaB0cby5RyOQvAgT
kHIgSS1GmwrlCXotSXdsKXl/XAKps033pA7XdXzBA3NuvX5fg2S7VjZIcHNC2o/k6SQCST2NSx8N95L5
lnANLBtu0+sThmiKJ7USaHUFOb5dqCddFesXFVcQlDtFTAD/3wQGswLrArMDD7dMJApm2oeBYiFEBndw
Vgp6aUSIPYhfEeQMKCoNwRIiBBWXoEWXHvnEDB2PSbRpXQ9c4/JUCWhF45CFBLy0p963TPC/ak8ScOxs
8hFJuWkdB1WJ5JCAAl/hzvd28thkKdlDikQ8BQlLHAEJ6I3HXUgKCVggTS5dAmJtcpFU8zyIv/hAXIhU
PFD/6x/JJ2AQTLZcXFT2r2iwcf6SQA+ZxscGkSXgBDxkCQUEnIDd+WLqZ2QCBYyTXzBb0UW4QZdoIotO
shB1D19622wABiB1dEjQgPpkLW7Rd8FdnpKNFLtrymQoyMDN2A8NDddThEEkLbltRwNHj/Z4blI/S/Rl
FHOQicHtwOSQHcXoBHB5V9cYxQYtWtWsyYQNG58/N27IKBKsdvxRHBLQqmSZ91z47pSsuSYFPApzCARr
RAxdkg0LJhVc/1LXJckoPgDSBAyrimR3C1TJV5VmAlJyQgUyq19BRIDOGv4YT5bohxQ8jTXpYUoNlqKw
RRwcBojGsXsK2AMJMRAgc2Be1Bd/eAVMAOPnMgrcB4vqUoyAfClNbxXeNAh0PAmddTJILfZLwbDoQDAE
Np513Rhhug5Ga98MDXjQG4SKY5TQcGMgAJykXt8YxYYCRR/v70UupOBh9//g9SczZAf6vAUqGR9AmgfI
DONNCM0D7Dv3ogkZJ18EbUjDIqDvmpYcmIo3/D7vzqDUyIAUrWgDrqRbFd2QpIWPDA/PKcf+x+8lKdiO
3xP/T2BAYyPweQoHD3IgKQhPn1AZ0IBcBxkL4jNIwQhQyrTrkksK7v4FaFBQB0i7P+QJ99bB7h9h+WPw
CI8yAn+LX3Tu1gBjfwFeCCRGF3eYb4Oo/SLk5oPFiBB1C0aGmbMPFw+rUifACoyAnCQJq4SSB/K/Xcxg
YMZiEN/fKMAPgG8BN0GAPphy80UEq3r2LF37hrGkXEjtXE1RGEa6YUAl9xkgRcGqG02b/CIX9TbRHwcA
VnzhEIoxgeDrFrhds3xRnN+Jbu4t2zl0JkbSdQLQS6obt6hfAZdFqAN1HlEfuJ5q+5JmicOIlRhHKIAB
8CIB6KRgw7YqIr8fD5dAtLtQoXMsT/8aAlHrFUEKMm9qRI2szxtuULoMMuQKECAB0WtBew8CKY89gA4W
Mn04VF0qYgQzcbgNInInESqHYRZtxVsX0A97HWoRNaIOfVJqpN3LtrUDDY91C+kSur/08GuTfRWDCSNX
vkXVKAaJF+pFXS037EG8bQfke78AIChaFkkeuhdRexHoB+YWHYpczhteI5YBGzu/KFooMSfEum0fiv9A
EAMAz0Ag6FDBIoJSe9/jKc+NtcevOAijDHRfWYwKTGd7RWttdhXAFgi6CDiohRdE/yuIseTYXagTv0hz
tAjN/YVK43IoBYE+AgBzRfQ3X+FgEMa1OBATiUMZiUscQa/wRXrH0MwBG/1YQBFDMMZDgEUDwgkb4ykz
ji5UdgAfkgiJBWEMsT0yqAnN5gYf5LgZATkIEcs9HAhBoBxRm5sFFRCo6KONVPSCLYwsmELRIADyAakh
aAZ1GKnJYqFcFXqhvqoG4CmS0kn2FDmKXmlNOf50RxkA/pp3Kusj/ywoFtYgnhoSD0XAX4HBt60FcNP5
Qh93X58kggYOloJ84zioXFctTh75wbxgQ2Q82nRTh9uoMAH+dtwCHm6NavVW56QHo8NUbHYBqEiLKGnC
ETD4d3zuz0C1R9uLAo/3/4pWom/2IMhIU3NQTXsAgeTmBmsxqIdBMMe+CCq3Fc6iQA0+n4xiXdCRAHzz
RkBIe9trCKSEEiCOrVmBDGEH6zxFWYrRFyyOSO6va4D4oJ98iO4CI+CQbOPcQqiDaLaBGPULSBtAKwSG
H9w5GEQLv9NZeDxhrINGEKDehw3VBUT0pCJnjbQN+ECczeIeATqW4EWMdRcBP+zp+CgFDdGWA+1FFPjt
C4T2nnjNfqm9gCP2eiwwI4Mev+53PA81ejkaApZ1rJOMsUWq8WbgEFz3jTBA3G1DCP8QBT0YrqJDR40l
XGe6uwS0dAYfQf/UkwUxa47ZizhkCktVHe6SbHx1zOnmWPYJkh9EeXd3IsSGTVF/z4NJVA/D+HPok/u6
CYcpAtFAlEiwGByn6FBqOwWwJAQ9kTganeMQbPaLrGaiJFKxgY3uqKc0SfS272yC2RkaiCC0d8Mlk+LD
h9+LVFgx2yegZAHfegkZVK8+NBCkAHdFVXI/hAsEEDxbJOs3kqIemdbWSItnNmOwX9ZMi0nHAl2xEOFu
eUyJ8n06lNUj+JgpTtXr37g0COI0winaSepJD0OAYbmq1bJgij4EpqZ7fQQWsC3V/7AEhiN/1UwGEmNK
L3Kcohu8UQMbxBE7ADZj0ys5+xQ89rB/36iYp1QkMPAFgGRNQ0tJAdYSCAWI5x7yYgjbK88wMVTMgK+J
BDDLOD3SpsgBZObrBimoXlDb9HLzw7kAHjHfAbQ71mUEaUAFfXkleNbJFxB4isQ52DYXIzktrl9+UP4G
VDCAhoomiNg2DVK8DtNbcAJNQrxydIm8GJiFCEYBd8MxYdAqt8PHpiWgRs+FHpcbuRtQuUcQBATHJQwU
g0fM/dYAVKALKm7O+pjQCLpZbNB1qlXd3QLF+QgNjCTwxeCEl+pmx7cBk3SX4NAUioxYFGYMjnhFGBgQ
3Xp5ThI//pACHm0C/zK8gxyhAqABFCfYloSJdCgDTBXDCGpoSfKIYlU3kVgPKCYLzcU6zJAHZQSfUNi2
L05mYPPMAeVhT4jamrYZF5y9WSAEsZ18C/AwA0l2u3C7IUFQB1FQtXloA2FwXWhX0NtxB4lpcF50JTdm
xjrmw5zbCBKubwQ6AoEJ6QS8HQGD4I1l2IrffcQWgEIHXTDiVJ2EDa9GAY1+G9NYCaFY2eK3lmenGMDE
eYtdph80wnY3Mdstev6zXodBlNcrYDAp6hRGDwmqY/ZReFeYeL4EpKgnEfMiPgckqEjw4b8oAS8bBlIz
xVZeWAB/Om7yIjQ9690csDl7sJ1eDPVeSYBojia3/CP5JSPqGfN0eckeK3gFUEI9MFQ15Z4iGZJb/Ksp
4g7CBoFAvi4Z2SH7JQG/CJa/SKeXNcdeWFmAVvgkp783KnekIhxH/1ufIL9hT1jYIgDzJ4nfSRstuKGI
twUIqtlDZIIbUTwF7d2OPdItaRAK0gO/GFL0/kMfUEd0IUgYvn4y2G8CNR9ACCDTdRG/GEQFR8iuDwKM
vwF2QDDxF0YIQcZGEAz+BPptO0EQEQNOFEG8Av3qCFhxfYFP7gfgAXUiZ5MAI4nYQVgvKal/Ai0//yVY
/yK/+pawQogRL7hWjaWiEti3xQYbTsMf9LCibz+APwJzCFuJ+6oFokFfbD5i8BwU6jQFNGt1Ntd0E/fj
fS94y74NhdL+IgBSTzfZug9JHyQQLnQJ7dWNT6qDe4R0Cr0QFdi0mZlSBgVoCA4Bjk3WaD5TfivECNAJ
ShEhL9WjK0yBiS/H7GpJgRk7DwVwAPCoed91UIq6cQYSbvkJwoI4Bpg73K9EqwnFv+Q3ekCd8/u9XA9F
IBagp8eYhY9IDMFnXwxICA+GDRBEigChvxkAEhhBjUe+PBcpjhSF2hr8B+s0uhsDIRdyhclNyzDWfUOS
QVHGUOM9uEGwagnaAXMmp2s9qA0yqx7uAaid3YSvGylfCl/sw4oaQeeF6elRVGxb2GFQUWFYt+1MUEKD
MhABRQBhY12ztQ1heHke+oAWYFiLdRs4YQphIrrZLX3/xU1ih9tY51rfM/xi8xSIUU6itqC2EAMWbwjg
bDtWgKhGQ0YKqEaK74bblkFi8THAoI0eISOYAFDDD7bbS58QUb88GXYdgMefA//avifiGkG/poMrQCj1
PKm6TcpsQbbzinHaQA4lY4ayDdCSHBJjh+UKJ+GuhgG9Sf/GAohk0A0KYXq+dCOpeEnQVRi1uU+N8gzZ
IYpxIqwBIA4GRwNQhmO7zW01SPHuJBRLp0sITRC/23YKdghFHId0ix/sVWxgUGzzTMHAjgWqqMxcAN6v
FgeurOlhY0QYGhs45/Xei98HdiyKnMw4AGSIfU6+BGh3EAYDThASi3MYhHCQAhGNDH9sBBe0i9tCPuao
6UoGHW75GGCwABrVuILo9G+RC4C+D41NMI1VV4BtgVoe0ckC0gL9jiyBxb7RuNSkaokgv4FfNIF28IqC
GNJO14SwLAnUcnz0PiTsiE6VUz7pJwA0wlt2Qbs+S88S0IjROf6hSFBu0Mf4OoD6Xw17jUrQc3IeMNt/
2QefGnMFgMKp6w8Mv8YK3sakixDjidFQfhkK3pdl9+MPgBW6xumebg9zqhGLZ7iBf8jXCGJiKdCNetBA
YGbbGvljIAifZPVNOtsQDb8KZdecIt0Y6mll4CAXYr1AIdBzphneQbljf0N6ZupmBDg8ZYfdtpfmRo1w
/hyNUMn6ZAQE287MtmMOC79iBGHGx9muoDUttPfhZGG/dIaIZ8bFc6XreunQUAutMZsFuA6xcCnXrP8I
rMhNwsLqi4fewRiLUyDwOBdAABdUhESFAyKSI/dXpvYrwDRZoYpx2NWlqhtUdPf4/zOWADC0qgzXMAGA
7ZH8hBcysghHioTdDKRM4VF8lCiBZ1uWvDCCUggmTA07NjDOY5ecDwgOYHeFTXUZZudLWXHIFvaXVKVI
SBdrBSxRT+C3yVXtWbbhjWzz7oCk7dIIe0UAA01/TxOKBkFrZYEnWKp4Kk8IeB2yRgAjhTVLNJCWEfOp
GMSwgcIVIWwIJOGKcez8COxinb2DO5Z0Ny2DOcBYrQmwnk5EeobMQSODIQPXjf1C/UGD/0NIpAlTE0wJ
h+yIyTZgR0Bu8UpyD4LfpjYEKTImNbjPdErTMctAwDAOx1Q6DM2IGMupgcek2QYCFKnp6VJGsiEQ/QiA
rOqLMAq38rqOxi2AkYfGIEpce4bsW1nIHwYH5gEdwgvrFqAMXQjJet7A7DkwQOCQSsJJZuxIIIDpCYo4
xKgCCZ/WkVCPAB1yaLkniIVV/e03AgBMdk9JBK2wN+hkKYng0pDu9ww0NqFcRxcJNj78YiV4q1uQ03ew
bUyJ8rZtAgEc8EXyE9JFtpvrsHR4CRRWQVT7ABxCKQ0cDDcThlSbuv/rFHlKN7QDclLNKbM44UoUkOpK
AgCwg1YGjyTMaEgswHJAmFDsW80CItXj+rCihEUPHiVcbEQbTpZR3cT2Ao7JdhsIBtF1dRIQ794mRhVB
sgEYdwrrf6Go7AyKIndM5FHXsH8IBNA8CXdqJkA3Q6DYwGanCl9bQKlqK+rlCGDItsGAw5r7KxkHf7Dt
fHAxGNMR2esn0qhhd7dWD0F3X3UIJBeCpu5UAcJyHVYGynZVUzOCEb98QIquaEZWAUxhUsWnSIlMg7J9
m2Bh00LLF4zWgBF2iF47kApbsApYo2iIjha1GtEKggwQ9dZuH27LhNJMjJcMFBADG9hADoqmYPfbCsdC
o7d3RpruM0Usb58ptkH0IPrCF1+SUv917FsG1NhFrSBNOzWFCWKjcTTSLgRNsBXQpCK7dB3bBejbe/N5
jc4cERnLES22bR/DQBqCE2cVOaonAMVc90V0BpoI/01Bhba5Wx9mWP94wU1Fida+P2BBfBoBv35m/vcC
DxtQ27YS0RjJBVYEprdtR8LAAY/OQNt1MPI4Om7bi0xPDwJfCI53RluJhRTzFBvIYAXfcyvcKjcXZ0TH
ujIYH0iN0BgBcVgAqyAIcjmGHZwUQJVnw6ULf+xAE+aBD0gCsv3YEO4XkboAD62n8ABaogaUTWfI245V
RS7gjmwURV60a2o15QJNJEUIz0URTmv+lSZoBrGLhssx9t+LBiSBM7P53a9YVCFMjlnGkCA+EqjyD8J0
QaIWRLBiYWsimgQ8O6k7GlCBIkbA/L4HohO9NjYZRi4QzSKJNus/JBBdgNCJwTPMmYDKxfMUNWA3EJ1z
yirqideSgahj7HUyjjFmwTYsiHY3KuoJ+iGVzh4RbXTcb8CEsSJu8CzWtEjdGhYuvMHRQ+scEXUVVXtQ
w4qM6VkgiBW9kWIx9oKx43MZ/W7gARe1BBc8+1lZGLi8AgkgQeL9AB3suIAZCEH1QboarYCGSRUf1KEQ
bi74g8oBQbzss70BPx/qA9Tq+EFoTA+6N5aKQ7/+dQ9G8wcaMPsbXEPy8wJ1O0w5wcB2469AA4aNQp/7
cjcG0A5FrUw5GFWAWigwGdDR/UV4E5r35XErG//2wgFkxxaYOtoINnPJJp0W2ok0GPzH+dp7K6oIdnck
u6CR8Xhr6H/E/+gl42a67FuKdWw6gQLsVyn5MVbDtDAWdnQ74XHpR8P3LGzU60hGD5JqgwPQYd13Ue3N
zaA9EiuRbthE7WaCf2EJgXwfNQAuWHMXLSVxCHcRdT0A2LBJBuOu2IE51qFIdiOfRvaPmSL0QpHEi1S0
RIkD6EuQo4C+yHfiSYPaMCHJE5HbdNJBuBCPjEg/kY8GgI4W0CF8bfdoiGYb/InHucr+XBEbBT0qyH3j
/QY1lvq7D+qgDgLvlQLDI4n4E/tQc7EEcgVemGL1I7jHVz5/d+PYAtFrHJ8lMKiwNYqNbCbuY0S4oy1s
vfg27xw3BLgC9SFTwShHq47QAjoYAkGiQjpoVEmof8RSVAORiAqBLwZgKAlpt2YDOAM2NDsmgYncwCYZ
LgRfBoYJVMXY724JBOpIAsVHQUEPH31BnHwkFN4YX9HdAasiiwO5FNvuYYkgFtfJBAkLYveUxd6x66LY
2v6Jap73jT0d3yJJgDjswAh1IhJMSKiCFVwV/0QbXtHdoPtI+KDpGRRBtLT5AZfYllgCJzNIPklvrU2I
O/FrEASxF6dMPD/EcxCzFZcjgiq3AN6uJjnpN6Q8Lkam6gUXrZWD/YKNWgbRlmQglta5dpqQcwlcIC4Z
mmrDDpUlOglVA3vL6tsZPjiQvhuABtGjVgbPj/cSdENLwEP2wXYauQ1u0QAaKvpLk9kvKG8ETHQzBZZv
SoIgtuG4zEPN6eQmXZt9AUMQGOMYtGwbXCHxgA12HJY+wNwhSvvnzWmEYFR/d5brrjHArzUqugHdeD6T
dEdlA0zQOpWPamin95D9ar8NOiylt1AOj+jHaSGimWqv5ygUWhMIiAXrfKygHYMw272x/ZLMFUu4kwzJ
JLiKij0EhCBGC8SvireBSAiKRD5bMKERdygk3wRM7JgQsJF7/cyQhEJha+vPjB3GhjRUJjg3JjLYhCA8
z7zqMsmQTOrv78GCyAX2ETAJTwW/6X8uFxj6WROWVI1a23bhhwVtWp8Hdlq/gPuAag+IAdPMfGAJX7De
QtN/BQNYsnVgfoENOZV0lwJjrrLBgnOoZKYIkANI2H9EOFgdSP+nX/gPkwAcp0//lwVqAr/gkDUsKXR4
rHJIosQkwYnn0zwgMTJgX8+UxOtcJ1BKoKYelwt1F3MggJVcEHZZ3DFgDcjIHhgMAiaLEDQQPz3D1hLa
yk0zNgkhhxzSz908HL6QDjIMc6bZ4HCVpEP6kNW464rS/1NCIIpwlooOv6IgAZDvCxj0QmOn1hINh0Gt
4hDgEY0NQZ+lRcM5mohXN3IkmgUebD4exAMBBrueOognxCXftwSmqcjuWkLfD+ZBdTM7sIFAZ/zEOKaM
SPar3A8SLNgh2+A2BKf0Tro5iggPiRYadFIDCC+Re3ZI/0xMdT8BqJAwaOAgGzASldHlcUzyxVqADzSe
LB0waOtajKoKrRvYUjBAiEP2nN6NFTZibEvZ2CLp0ScDtb9uYSP3Z1AZnMiwE/F0M70GlFosvkKx+hoF
JPJNdvecsxCBNQILaRwD5BmyA/w4EPIBBuzIBkEyLU8pyI5swAsbKJpbTlh09v84La7qndcFtEREmU6E
Lfqw0slqnPfqC2rEA4taCuqd3FNs4HojHlX/882NLKh5JTwc2ZF1b4yAghBcQljYkUf+qZEQlvBLNNGp
vBDqgTikDxmkiYVQY5xHOBgZSqg25J6TChnjkOxaTomkTtM26e6iXyA2ny3dNRA3NIQcQJ789k6xpJSI
wbQv7BfFYN2fBPefW9ikOiSfxBP3Eg1StQ0TSPKyNqQ6nWETCvfTfbPl/8dOY43ru+w23Y/Q6zENTusj
CD82M9nhILrrGuoNDK+VQU+YArY1AnYIu/kgeTLJ0O66qA0wSP+wuqgGiUfNMcANnSo5SOwxFCsOncqq
L4vaMU1uEEkPi1oE7BVN63kIQixy/UsisHRZVANLnwVoNkCgYUN/LQCCQdsEX8VeJaC9jyjhYhdbDx0B
dGXFJKVVW7HAomGETmCL6Eb2UxhrTBziEScgjQ/AqShE1J08gBZOMxhBCWIcKig5KHiDUH8bSKSYE74x
wBXyHORhBm4uMKMHIAhtlTEuCNWCTWXLFXwpZFALDa0tg8ZmUK1m/bECg9oiLbE+LINaF7ExpA9LBQSJ
hyIBEuiRFb5GM+GSTGAQtk91LUcQo+rHBHXCtgFCZTBCVxQRTN/S9e10wOCQNTQyL6cvcXvBjfV11AIN
RIXvdX42scFUtKgM5auJ2TBtvyMRRMhUoOESUZYvNVQ063MxlRZVdaC5L4B1F4kWLSLYNRnk9GVAoLKH
T4Nlu1B3H6CtP7yM4AKLIAEDqexf7bknBp+FeWJ4cdXAPk4hdLqXhVy4JNx1dj6tS3U4eBP9ugs94aH2
iwMaQ1+hcoTdIYYeue20MWMTQox/octFhOR0L5kilEFwyKIyEKPV5BmyJ82h1CtyA0d4CSxho2RerjGr
5AECYaNcwgBeyKPVo9U/CwSM2mHhSzRchGigJDQS0F3AWOKLqBgJMzwN4Ze8BTFEKXsgkQ7Zz/BY9R0N
oLU0zRsgYMGIHaVyEEMoM0AiULwGwmAJhgI6iMMXeLqAVtEdrJW4XwVf6didQVxm2AGlaxiDcBAohbRs
S6hbkIG2pBZ9CUDGQSgCwv9RbSvwqMBAE/DQ1mxEHWBwBJyEUfAZS1wkMMdZ0B+iJC2wMAL84wZ0smen
oZZJiYdhAgALfeQsiGUJHo2CFXtGpLHpHZKDgx2ss6fWXJkWQimhgPGJxv/rJtRG0gQw0TW4I17YMOYv
HDY5kgGjA1LKJ4bR0mQdsxTKDzAyHe/pbYsrhvUeWCN0DCpTyQbGMI8uRoy/klSys8Z1P3ZggMALji4L
iMA3jJsP0bpk1SH7zDY85iqVbLlPLTxlJUhVSu7DMvgqAMR8cECG9EIDa9DlMe2DBbJ2vyOlUSalR5gR
1hiuVk15fJhDqHrJ5qap+sEIYGXzNtkSesmVLaalLaQYwa+sI6eGSIXXWEjOXroDS+i7Fmoc+7JMPAJL
pUHEO+SuDezAXnj+DWIHCYyxcDp4V44dDAJ+QfbEAXQX7eks2GFP12/Q7R6l0msWgDeEqBbUDST4MaGk
+0yJ73sJOF36FaUDkwQkoU8kHQniYA2Lc+8eYBuAInVe8Posv4DAQXU/FFOQ6x8gjL0tqwstd8crAi0a
bUlNIru3sqpcBVCNCcRrMZEaIxywkmAQENsUBvzpp9YUCRJpG4jtARQ59UA8MSw2DetfdQ0TLeuBlFmc
LAb1/AQxlJMBOeSnyRgKZzGbxXNykEyQcA3hAYtejK3rUNGQdKSBzVXrNU0iMZDgsCtd6ULwlLDBxl7g
hZDkFMMqTKfsyIIENWqfxzApKBLR4okhCWhxmCtbEOBYI35Mic3BISsNtj7FKm3QLmU4J54byFkEoDfI
WmwiyCJb9FlVC49IifmTSeggBHRxAEpbtTDkTHVB8R8/TNRKfwtm38ipsU11At4qALBoSYRD8XY7i1Tw
CxJ1NFwT3WBNUaHGsk9TT23CWCwTyQ24E4ZVrHYcq9xZWB5SXyuPSlAjdDlkQM4K/xoL1WxWcHMp+2/D
PivYR3AX97rrDRY4GMBT2SVki0fYIfBI2ugopeCuUSuBaN+APYog0mhDvTCgg5cpf3QOThGJOnQVGfjb
NyDiKUGLbjAp3XNISceRbRQuq4VGiMMGsM1f6xcYaqHYSrllVKt9/x4iV68WWWHOnJ48qwVjGI1cDKoe
BktUwkuyKI8RIfhGIn59TslDsGv9fXJvFoEYMIABkJoqDhjVr+sptiEh2OLDQfMT8+aQQwiH/P6gHqNy
bK3Vd7EcSgg6UeqH7BUeciWT/v/CFQhBkEn+gxhCQg5dKSw0BhCKv4O5GVpFK/CtWdGOQKkV+iAurN7g
E5gscFAqQnVHp4ALQyZRHCSsqIGl30XcK69dNVM7Owv4gZv+TDnRBa0TQlpxqLeDgQpJjUJGykC1D9Gv
Yj7a7U0Vht4GdYoEC8D8BpSAQeV1BJg8EXcuELxQSDVVJvq/AsuoByuTFZIKTGwuiHQfJydwxwkY2Yzc
A3DcBgPj5prVYGVEJB8sSNy5AjaDrutJ4iDgkmcsjLklSGEw4EAGRedM1anwgXExwC856XY5zhbxM2Av
8q9QjXIJexjkDnKfCAFyvw2AE3oaG9XWZWsOcBTt7nAJIOqDPLuHsyNw4kwlA4cA6TYMk0hGFzErIc9m
LoMhBNqwslZQ/S9fFvUSQQsx0h+NLBHQwwgQSu9LrhBQAm7JbBBnDrw0dDvGSXSNddAjWvDXxtTQDNQG
csehAxVrEeMxLJQdgk7RidO+d6zCQKjMsht8PYLDbHQRCqk0CL5AqwowlgHRdApxI3DByScBjWoSfqVG
nqwtr0PDwDJoMX8Ni4X9DpuAr5smrQixk1THNOke8MvaqhLwIzGwr2pkTVw2LCXskB0lLnp1dE8NBDwA
Mfo+Xk9FLAB+WDRjMYQPEfGxBOwbjAwIhcLQb0KAA4oS8PEGiYS4Q3QkiEyGhbHAiQvomTAETVW3BCf3
2EQ7YavgbzR5Les8AfdU/0KoUKptgzKwQHAu0YShVW8JmznXv+GsPaORLHjjwwGNd9CDCBp2DdnWqrDI
ywNEdbdHodZ0TiVLASECQSOqbXlB279tu9gYWEgkIEVEIQsaCngQR9vh+wiWKCfJXz8gOoLnDk1nH2NG
dcCaqLfDR3e4WWzDEcinRRg+wOyte3PBFwwM0YnPmhbV+13rr8zrMTH/QGdFtMe6HxIv0Qn5JIpgI3Az
bU6jgIBNLzISjE2KYL6rEL+PIEsRr75gjsUbBAY9EyNFxL/A4NdCqRi+OyzgU/J2vjMQAgCfBQwZjD/p
Rj4YZN8/NEkRGDTwCdPGPwWcLIDyrA9DBrFh5EE/NGZJnjTGgg8psDsMOj40P/FKHSPaMWlhPxczrv60
yUBESzDnBCQhEIdApQhXCYNixhCmQIrFZAFOKF1J6BcQjVazC5GG0AaTR2w+kR0sURSDQfZr9tEJi34q
tBk9dn+JA4t+OXV4NbT0gdtchBQidh7Frj24a3U9uno5ifccsnhYNnUjPWkfJYJDEq+zmzIL4MayDjR6
AMMvoBhEBIsHKejLL8sxwP852cHgoR9atBzjGxRQSyXQtAwHMQsGdScHw8xeNhVFLSBQBw1SPAMu37MB
DLMZRkjmtqDZFLv01kQ9DHW0WoQf5/HIggbZswcCN+wIN6jMD1+1YIQL2pliWwiDho9BMFZMF1lduna5
srgUsQnBTYsMaKVPSU84gH9Byb8A0AA0oK+LBrZdPEpXXk8gB19igk8LFRLOybheZEcKligYwTnYEbSI
rYCnzkJRwQtjlUY2TCg7UAoK1KIHCbvwxoGosfTm0HRTILoBsCnw9cZMd/RATu/HLDp9/3Qr3O8CbkBc
OfkBRDjLdegEbHW9gmXy+IPnbYEKFYhfVGf22wB3qLYMTMv+EIi1vEHi2FbQXijfHXd1uBHsBZ5IvQEA
9a/FdQU9ouoXRB9EN1VZff0B24UF3UZwBw/zDBw5ACNEbEvYkNTVC+JGoN/cuM4F4QppFK0JBitogd3N
xU/flsYeRgozv3ZK1TfiERaIQQIxxjHJNPdjwq/OHbha3gZANOQ7j97phQhEg0THZxlCsaBuRkU89ckI
RZsh2whD3FG5Y7+3vfy/HcUHGF5Y3Xco6x9fMcApa8EoUSuzdwvRUKN98U+NJJ5l92Ww0ADRN+MDXMdk
337qusxyVbYFDbiwSYAaSDt8KAzE2CQYNqBCZ2N/26PVM93/FRfGInVPfRUCUcy5NwdX+/UwWIHuTIuI
STdyoEbRZtwGTCnmJmfmTUsRswrFIqVECk4G0RU7k7fsWzAuBN9iKyw8UHAq4g9IA/CaKB4j4cU0vxwF
CjYo7/vfwiUcDVAvL+o4w09QMGS0Ay3vh00RJuUIarZdriGCA8ZakDq3/LMeKGVo8CwGwLmVZhswNdF+
HFyEIGIQb0jpaNhxcMlD78gBwSnCMbqPpsjLH80dwSkb1U2WwelZdtb3M4hOxg+HKOsQf9gwLKKFP60B
z6ERcSCBtHUFQ3rhMDv+RTEfgEoGVyMnXAjyPZZFHCHu6kLsUc49STnw/IjgFlvzC10gy1So0aMW9q+1
rNqwrV2CEQmafwFqdH+0gEHGRUFFwhgtBpEBaNAgVO6IxRIwHkEA69tIEDGqwB5AEAxoNIhDdSCPIIfb
sYIxzEmGviMQA2zVsfBBigw4w3fac+rBYOHDEnc5HrnXinvIYwDgUCJY/gGgfSU4/+HAPL1XTbn2tg9M
1gpAKjc2LOBgGrrWPQqA3rGCpj/pJr1gBLEPZR+LxgL3gkuTYuPxYzAS/DBFddrdN9G+khDEsCUzEGeI
EcQTkREkRFxy2Dx8cXFFDwGMZwcevJBD1gpP0jaR/BfWznO8VkcKzrvvwVqyPVEKzkiJ/lIhueSwVj3b
24a35JKioh1nBJvE37zgRu4xyUgz8ZGmKBVHMLwHjVi2QKoDrNssBUFYikrDMApbJB5tOBZILnsFu4BR
AcGBD5FVE1lkJEEUC2RsZccY2ZPPs2amwLllVRYPAQ+8PAf9hgC0MQ9q9+Gr7LCYZwanZDRYCJDBHbCM
Jse7G//BWHQ4k5OwSU8WHIP5/wUXZr8JNTNE+P8JKtBHoazkDWlhEb8FS0UUvZhGTw6kLSSQD9BwdUZV
m0ApFcBAnDAojb4jA2xgl7nAuYS+YH90Vg6RVXUHJRJJyC1EfEt1fEYSXcBGUQUsYtFDYxEjwXVbBjfb
Q0JS0BLRKN/GHraQzyd25ucBSMsolszdSntYyCAeuMzXrOyAFWIjCxgAWW13A/brpJ1/Wkx1eRF+WKLQ
1Zw/0HbBsF9NNnYf6MYDXLmGIr4RXdGxGlIdOW44ODIgZ/caC3Ms+JI7i/PHY6L35nAbhhU4i++8ohVD
KmoiNATolDAAZsr/DbiKU5s1bBBOCkoRyOa/Bf0FgKU3QooEDk2vrmKh38VXNjcBar+GaBjluj1AKUVG
/Figz8KgvzRNoha24HYULhb+DToagbpWTFG/BtBUzCYsz8FfI4M9wdhpRxDm4wYjgNjTctsZhYSyCJoR
tYl0s8eOEHSmsDnKRdZM4LUgRWIKe6B4or2YCo4pKtgLse/TfAb/FjB4im4FRInA2sPi1cL7WmK3EzuM
DJCqhteZAo8xdQ3db2FALy5QQrwWGUiIQQ+gKXQwERCtQA0KQleOF6EPleypYRanCZVIUcM2pA+ToYuG
HEY0KP8wIAIFJgPpCQCdEL1mkO8G9IgaGVporKKlxxNEQF0wKlgxBo1AXRXtw48ctGABDcGzklHFflaV
i6wkmAdMAF2ipVtC/9SiUlSgw0U8g+CsXZzqDBr10ylX7YICwy5MsAC6w3MQzaVMU13QBkFQaFt4kIpw
QQVfqIugUeZgqMcHFkZj3Rvd3AlJTaAJIWByKr8B2cG2LZRKZQNXwaYp0AhaOnPjLOvxqlCxRBTLpy+2
F86fSJ9zO0gNC/iuIO52L85ELg9BOoVCVOgWg3TgJHGEIj7Zy1JysetnTy4MgC7eX/Ub+wT9RsQioDnW
U5b2YdMdrB6QzqRgNwl02xoWe3YDnN2LrNq3N01oOyzA7qlSFM2dRGDhA4qKdnQZTFpFRKK3oTQOAd3D
BAozHQg2XlLvAcYdyj0tFa1bRMEAMEQgmBWMGoAFIALCsRajcFKBcwnO/M0zxBZjMvIKvWsaqBlx4w7b
HDJGi+gPFw+E0u/EXoH9Bp4kogfFvbhacoi4jJyQiFbB3LhCeyNBZNjFEwbRQQHXQzDFh2tGNPoYeeU/
ifhSd6GoRTU6cdxsRTHiG3PS5fd9xEYE3XNBHFOQOiDoCGtNOsNUQ9HJOXfGp8VDwfdII8I76ahFd0K7
dFnDQHO54AwjLyJiJywoMf8TSNjuBKblRwn9IDAMQcqguKCMgwDQYgQvqQxsBTH/KfUKf7iAh3XKciGS
rBAwOsbzk84gfohwD3Pfq2+0JLCP7ciC30k2K6ME7pCOJkIrgjxu4eCgp94oNx2BxpjjjVus0+ua3s5m
D0daiEhiWnE50RTcgmI7LxwxxcEYaxoMyewZdP62m7QXA17zw3Ky2kiJlCSIDbQwCs57i5DtjEnweBMo
8vkCYtgZ6lxANAQtQAZYQ9BY6hZhEXqCWjDo3UEqCqkCfLgFUtOyMQGoUED58LqiVEH17yRsNiQV7F/I
KiMXXRW8eCtU+v6gF9hgg/8M3sVAdNlEwx0LWnbRzaia4YQRz8p0PTtDEuUiqU/IelVwqXTwthhsCr4B
iU9HGVjSRJ2shutRT8iPH7MTCeqA/cS8OWeSqIfe1shguZAoc2Ul/2ERcRI1XysbRCN7jy6KA09BmOhz
Pr30VFmIVxBfH+XrgegUg1Lca1qkeUJmzwczCgTwFSAmPXIPYAh2UnANiJDGAwHfiqWfAzVfWk/p/lLV
S19OZgnBdH4lTdHsnwHcPVpOAAAOGXe7ExOXyZYoAQkCEuPX9rstdA1BgTtfTk4yyaEMEV9ALNkES3AL
UpQNw/xiQdv99tm9BMoEdHmrewS/f3LRzt02GRmQIQP9AwNkaT4DdEIDO0MYGZAC/gI44nYwugs2AoBN
ATgB40qgWgpwK4+mUxBbzxGVYy1GFftAAXnv6fGICIgdREvtdbZVABZKHYuPy7Z0rkUtCUX8G8wq7Cci
BvFRXwo4A2jJKgYXZTViN6rBJHEkV58QgvgGDYn+jXqzwHZqdsiOH78eQWYLE27jAdh04tZam6BMjiMI
VHnCqYgGbhTXdEBWLQmq0RHd7645p7qGGz4v3Rs2FmqBxwJc5t8b8qmI7wk2RhxURpaIDCRgF9bsIYjJ
PXe4+pZCUGIXfsetFR1sLZa5I0WlJAyN9sCQI6jWRdxGBUuR55LqPWODsGMax6FLwMh8sV1XA0WJ7kOM
dR0azOUCStRHvCA2Q5Vsf/IXrT7agHW/H9xNukbySTF+JxmIc9M9HUhBiJE+4Nktg+XU6iLNFwtbGlE+
cJjZmtVJ9E08d/0Ptm095izygXWC60cx7U2J1tktIJJBW+YMHwpw3S/QyLjw/yP7ZX+RxynyCfrwyKvr
Gp7wY1OVxYnXCPpFjPTYjQd/7Mwty0Jy5Ij0EqAF1Ql5pQhjqfp1X1KQTtvB+DD+QYpDAjzJjWsC61sE
kUpKIx5otZesWCMzdA43iAjSZHK/O1IGZMh+Fcs+YwEBMZBmQAH/LaSS686GREBA8UogP64ISFF81Vyg
CwZMAJQrJKJX1YXpIB6AF8QFSXYvJATRiibhvzjF2CDbeHMhMyJMhz6oYlXyVAUxqxgRgRgDT8g1GRZZ
Bc8TKLa60EkOE/jOSQ9BMSKeigtNN5ysY9DMQbXNxngPhk7g5CBGLAgaR1+wgplJUpfN1oA0hFYDA90R
dksIVmPKWjMlNsJUHm775zw6x40SYu5J7WV9uekQinBKTT8khWNJB84BznMRiogBpVDOyHLYzhQjJxbi
uKGIBz8pV8+D/y6Cu86YZ7ZNKfJ4s9sdDk0KNss287oKbKMi9sZ0D6goLuh0uLDEwRRUuz/8v7pnFR+N
R4ovnh7re1bdxWGQ8cNzP6jNwR0ttqIueF3HvUHRSvyNQd+D+A/FB7stUTqTjhrgEcC/DH/pbXsacskU
pQcjdrtvxoP5B3K5E0cCDxf6r9DfC4xAwU8v4QHuQCfcyYPmO3TffQYKTPEP6cEZRXxj/kcZWH22UGAi
32nXOph1mUjfCfGa2QNPH5XMpLGCvNdGc4BtIt/mDCXt4m0XLBEr8QkVAccF0EcWad85LkiJnOExiYRO
VW66Fj5ht8XDI8YBjYlvCLVf5Xa57AdHGEcgZygDdzCCtoWAV5/NEi+BI6QEt6zr5JWK+pIREnsBiPiW
4Pr3iSoWtuOQVOcSCdccaEFcAFl5p6gChlUVonmSBEESfg0EDIwANwKUOyCBPTs9WeyyP7BAPT+nIgAN
SSHIZbMBHRMQJLInWNjehwZAegEPmGxIm1DQDNhvGQYLf+y9QCQs2YFIQjgCShgBnyQF8EBhJATftKkF
IBhkZSVIKYJjFex0DVK8TQriXFwEPSGupIAuRIR0JrO3v9u5sNtAYA0VSa8g/xU8GbDb+60F6xwluDUa
Rc++0ehSESxkxmUBZEd9e60xCh55KAwlMP3f7NZ6KBWC484PKRQYR0BEuIt+GBFMdH8EJK6BaBgA0PsI
RqB4AnUReQpZAR0sS9Xsr5AwAhhuAQQJqA8fdbACugiNSMfRHWyFCBfFiVJZuyoJRHw50Uy5InYUinVm
EyugCQX0glFE+grHQwjnUlEjwp2ELxXFiIZ7AxWxYRT0zx45PQB6BfQAAX5Uny0wNMzrUwwF3KrcU8Rl
oGR+Bl9IARUsccgCAhGDnHwjCSIYxIRKSIYviDEgID4cH0S0Fpgy+u3CQ65oFxQn8sAz+Iz4IqwiAEXV
pkgPOEkPDFadG9Z8OCj4oKrWIuPmHn4Bpq76aDlLLTEBK9UTokk300O49fcsCrcFHBQj010xkyjMSHQW
CBCAvtlbq3Ygd8x7oHAPSI2L2u8rAD0GxaDMqyKi/d4hvwC5H/+qCHVRNXGFXxu/iWUjRbwHa78w/6pm
sDFXxIg2ZiBqKtdV0JyZItjuCQ6gA9OZFL4BPGPdydmfGXTUjOZvF2xskLGrF3iXRsIsq+kG4XxKFpBo
a3p42djdkBu/UFNjkNWVMYDeio4z4AFNoomGjng3cHtoikA2908iVGAwxkA4AEXaVOVub2APiVA8bFhA
IUAWiACJSYBGIOjHSXsBl54QCNoIWDfXjOCMPaAAGaFy4pFBsU+/MCuCI4G4RJVB3EQQBLL7AYIHrBkG
xwVMBVkVDCtm9HCDFcFY5ElvJWSygjsDAYhZBAAQTkJvLTlIniJ22xwnkEPOfnQzzQSHQk4hyp3hnUAe
ciV4tPoo5Ao5TkvkkAHkenw1kFPICc8DzJxkHJKhE79QDOtUMXsp2FBTKroRAagoHl/S/ijeWMfD8Zuf
CnmAuKy3KBi+L6FmjUGxsA9gQ4of7KCzgRTGlnsYQXFpDFgQKkCoy+3k9nMwCfanTGQzjkEo3GTd/9cN
QBdAEBYQZTKBDi4tMKk7Jf4fWxjlEATN1opY/hbnww6KEEZv9gXbQhEtCCpvFyL6tDXszNdY6Un/tA3R
p8S02KtVJU1jdeTCEefR/uYxV3G4ifymZ5YwCvB2RCDYnCEdg9jJuhxtHnVqGm5y7ggBXDHS75ZYjMLN
PR/wcbDdR8WcczId6y030DZCDgi1HtX2VrB1ZrTldUML7wT/tRn5wc0B7E05/NS3fFtx585FLqxYnbAt
QllSLc7YOChVWIizVx6A2TF3a5XOPFZ+ED8ckpd9DTDeH4fufqVTyClkYlGm7+QA22wdQ+slNxlgwQ52
dW0zdGTml2IE8W5H17hyYEy3EWSC9kpZlHEDiu+FwC/GnesX8KqIVNUzhStwI9bQINpYCEB0KOIFEaST
CNznBB7pmFTD9IYVhJ0QnTAq0b4BIxEdGO2QnNGsAwIEMjXg54D4ohgI/tsIhsTAcLeHSUWPQ8Mqt+iR
7toNiwogSUhjfcdIMshC0fffHPj/rPpKDtq7+OcBP0gmLOL4L/kV0EW0n/wxQtFkb/4f/5VQNBYx1x8S
BZM8f+cB/i/ghKIX2s0j/xL1T6Iv2uKLCEyN8RIFFyDmicgewO54AInBF9XrPzl9UMzo8O+d5hSu4rJA
TlY3UtQ1BhidGEDUlN2QVXB1vjn4JAZIFB1/RMFSQKj6BjbA9h6HFdkL2fJ7QSah6IzmAdv+IB8JRdch
+gGFVTQsUm9DHqGIj/X5AYhYCuSBlyI/3AcQO9SF0mWUz8IAaoK3lzBlBXT3i09JVCQIFq+Ckv01UJci
AFngGBdGQY+oqFD0FMDNr/tQVOBl/11kSMhmCmL/sAyJBCXpfv8CdlnBZ0OiYAhxyGCwRhFv6zBIEcuC
Mgp3BPHo40zpKfXWAQEkiaIAJuhHuwjX3S6kbYigVwmaRpFA8yifFGAC4O3dXwgLdWNs/dCSngCclrcm
gD0xbgefwjsW3VJQBRoOLfvVrwEeVSAMidXfGxJFjyR5sAHlEfHEhmaGjf/d511ASeLsIaB+8spgczEW
BLtwFRj8rnheCUA8tmBgD5VCCzkQHwOSPEhMCB28/pUiHz6LJCQ7PSOjCvWfS5pjfxg92vf0v5UpogBS
RQsqBG6p6DA6ZkGhELX1houCuw2wJLA3dUCY/PcBHREsIUYXvz5ZHaMP3YWfTOAevw8TsJCAxcFoo4uA
bw8KrP+OTiLfXfL3/9NIuWSXsKLBLfpw2ZQQEdR1PGpEExpoxUYpTC6EiF5GSnVQfJCIGuDHWVNkH+xX
8DHbtt7oT44CPs4HyMnz+OqAcmIQdKJdyICwvF/QXK2oNolu7Vi9iXpR/KVEwXUE/K2pwsQdCBjvAXMx
MfZaYEgRdFveDaGgrVgIqD78j4Vmfd4o65NIiyC5Cd8NP6iBRc+NvvYBCtCJoBMB0q/GIAUQNBAvDUhA
TBigIDR4X/AWD70xrbJDkKtymnY7FIwGCAeUBmF411XbcCDlfEC1vHDFQy+NWetorXDomoCV7XYVJSkX
cDwRawDSeFkxHL8KaEEH1sf/EycewRJJJjGkE5zYQZ7BMe2EkgA6wUkrQBUAqqlqVByEF/Q2oOTmPiN9
OOnOPUHaZTgxLbygXWyuRNGXBxVPx6aATESZdgxjQacNbVqTDM/b9fCFW0UPjsSLiPUsbhHpukn4Bgt2
ILoOHnXAJJsfVL5fhwgaBlKkIkJDmlTQ0wFSGUGiKMLWfNwm2TPg2D14fJqdTXGcQlaNRNAwj5B8eLAx
PuGYvyHioh47vyEGoF7I3qFeuIOHsXBJwjl9Ff91ft6WManrLH+KBVOQP4K634i9OfkBGs0ueR75ATZr
bn8EGYA2vWTSAdBJOiAVnG/iINCRRkbB1+snRaYKV4KlA6hTG/+bL6hBZ1XbwA+31wYJYEhUDMc4Y4eC
ijGUoGv3XCJVn1dtxgMTvH6DUAR6N5iEi7xBG97OPIXuB7MFMOL6wEPESBoxkFhjG9Fm8xVnBAnQX/se
UE659CmKs0EA6oYE9q/zAYwifGNvF4A/MCDsT/S1tfDDJwUvkmBDCMYyC8bokwB+EYlLFH0I+CEV8Y9E
iVwkaBhBnBB2YTPaYQURaWYnB3JC4Fg7fSmUAsRCXiUYlJZwjBELs9+r7BMK/8fVdBCBP2Z1bGx0CBUd
ohtKUAdhgPsFwIUWdNRziLbT3aLRXp0KQU6snRkRDSIFT4+mMLhay2656tyqq3jbBtcPm6QCDokvUIhq
GgAuQDUwID+roknzCBAA6hyKUbHAd+o8A3cKPPAGFDUUPb3DQxiUKyhldra9QboQXKGaMJgIfEEtizCk
rxyRrCiST7sZbAU3c/eABYSGZMCAj58CCBZLqEkBjAAFrKCvmzwvAQkjvoYxmSIA/6AVDBIs9DlWPCRG
iYC25PgxI/EUA4jfOPXlIS5VtUkYE4twjqCZoFrr5H1G1NYsseVDMQb3hSAl/1Yoip4vDR5FlwR1K1th
A1EpiD92a65QNMlHP/+ZKOL7AMNume3YliyKRi0YXJMTrw7S7MXkfbMTjA2BW/9iFCRsPDGfT3Dpimny
ZSuRRJEMLIoiVZFjHRVXziUVjNGyYsgujFELKxIGPy8oCAIRYSAfwrPldxCwEwoARA0LiDh0g7mIdc8a
OAsMGAGoINcqBN/YkEHXYE5wEnjxg/hRc4tqCUBM2GIU0ZJQT//VmooGaWFAL+NIcFAuoOn+hTcIR2NE
JGQKFh8DgJv0EZgiAP8Iz3GDKn2KGI1D/U5cUQEagXdE6AJID0KVd93bwYjI54cXhgV4L4SDjHazwA+6
oY6VJwgGyHPulFXDnLkQuLVQG2BTk3vQUkVYw+dhHQ12I2jkmaQr+4iKIElsGA/KsEJMbj9mCQA/hkgv
QqxwfxSOxgJ2QH9erNeF9A0IPiuESMrKigc51pbNliJUkY3xVO9TDT8+QHJbzQpbeJY2/XF2rNWvL7j/
AH+gg4hCLdq/ZMJFTJDXb4MeoXir2MnrEYdm8IZcQxvB4CC5l57dOuhjiZTYWA8ff4H58gvY90xVf01M
hZQEppAX1ZVmP01gVT/GBwPDnxgHFR96qfF0eKMqE0/210m9yY0tsVZQ0AA35G5otuLFJahvnXIm6yF4
ixhwhKhPk+9sDOnEJaBgXVk3Ihcx1gWx6rCK1arMAnpU8YokpF1zQR8X6eLBbzZ1U/FTQaMQxgZTg8aK
eunQvxz/lDrxA1AP6gDEBabsWIx0Yw4MCo8AGCITJzv8kyvp7zgmZBeNyT1GytfHD1TPJHR1pw3YigUX
TbzESFZAEA5SCShdnGx7DIlQFBERDQwkFgMjBPVgnAKLDJ9OKFUo4AGJVj6vvsVegBzB4yAeDh5IifBZ
LKwAHlpOWcyA1K6/HCUBhYRQfwPQo2iU5UutAFPGGQ9jEKqvpINK4FI12YmIZjAk4eJteB+MyOsigHw8
pOthqEk4WLjMki/rus+ONgDHXjbrRwcKJAZsEEYHNqAremETchJb+sh7JL5I8mFfeImyIIRZEho7I18N
X6EZLuFBW0FcA10UJLpnSUsYA6Y6XCTx1TugAN6wK4CjT/+N6wyE2wYjeQ8CQacGTJxKmARQoopyFYXk
Dw8iFx9sgopH8gwikQk6rGhMNaDDEFZlfQXRh1VUzBFskiJSJVNW/5JhUHEMqVcQb0AOq4hPEHQGp5hI
V9jHqmAhAe3rTVJ0r7/RK/3Y4LHqNxvofIBuA0B0qg8ITvKweKPC1oQIikMPUK+wGHsOaJELKDcIS14J
tkbAgAYG2++KaMBNMHnoDE6iYJBiDLoPXawGCuUM3L3t/+4piM6zCBgfwegGJB8MwL7bRriINPE/A86A
Kw1jBfEjvetpr3Nee2+0LCZgDwzgJjszD2wkCmcNMw65kMPengM1HhIM8CkM4oEc2DYOD7khCVBE73kx
qWCEk3AyT2YehBCpEKMzNJA0yclDKpAgMIQKVhYPP8ICeQI2hiL/ECC8R4sfz/+AETLJj49ISB0LX+0M
P+QBsCjvY4Ui/hJ1ALEQKoP/bncdsLtKtCpaL7xIY5u2W8U0uhP/5ojDXrAPWZZt+8OxConIBwkCCwYH
cVmWZQQDBQ0IwwpWIEG/lYBgh1m/gQB9tdupQBR3BVAKVA2MPlkJtFz//1ngC3AE1cp2LqGKG/jefSI/
A0GaZEgIAy9lQT2EOAFowy9/ELAiv1RgigejAkcF3arAhde0uwAuvwSlsIwEr4OTyvRIG74WG6mT+OlO
jUAnoHgNuuBJ0fL0WQ05q4ofCjryUE1QAaLN9vK7IzxEi8d6Cjp2/iIakLjMyecWsaDNXHqvIAXw6CUR
YGXPqioUO//DVsgioABQPeyg+srFvXmWQiLIuUGydqmgFbUJTnjxNvQy2BHaJr8mWuLiiyOCQAF7dXof
7xvqMKqrEGutjEMNg1Cj9NxsFPbY2Njthzfxnm/v6zE+BwjIEG4i62h2wk2FHTKxrUgfZChUPfC78hi+
30Uwohsk8RxJweYguGseqtys/0wJYmCKBqgOF0hmM9th7DgdEwUN6CYaVawjButvg1QPfVT0aYVKplVd
M1Vj/MX9dyUFxW8h1HVJ2WFznsix1xCkK355t4sCzIA/6OuEQb0BDJUUHW83mxsx20o2WNERXdBXQHJI
f1BqCAA8n2CdJsU3iZ4AiMyiCRGDJHdkRXGrH4IikYYmC4DWKLY8HBLEuhGlaG1oxdhZANEHRAYDcshh
LWiAB02AIUWBeqApTrps8YFMeH83cLG1prN0F9CCpRWUohmuV/YbmQBMKfeserRdMkVdaHRyIKkYUex2
JutqIgYAMXIgAR7JgTc74WLdsFKg05RrglkG+WkOBj9bDOKJqIyoMAoKUiV/FodE5WtDCLwsJKIeAAIT
E91CUn7wz+IJEZSQ6s2BthPi1WUP+O5eLQsangiwGcNfxigSfDrwK5W0IOKMgt8HagMb5JxvTvU5ZAEP
DTsT9gepDa4O1ffwCDKLVhhuDTSgFbmBBBQiiLGgh1yJjLmNIkhAzZO5jGHBtrrIFzxAwZeWHFWARz8B
dQbeAErwfOsh9xVnhyFSwA8bWP8IVjZ0nXqLPdXyCSYLqTVPnoyCELWHIrOKOoA4Wfz25YgAJKgOA7EQ
0oJkAZBH3aQZR/71dAsLXFwK6Bow3kUGTJvDdUXLru9lR1J0+0RjuxIGDgBkrcb34b489okrqK2LnHJM
i7zrYBgA0PlwBLuCeOBgELaHdLB7IAZU7KMKZEDUE50Xnmdgg/gqys4HFGCbRZCiJLyTFh1Una88CSAJ
MAAORXXBXIq6w9kHWlcYpYXQCg3DiEVH989Z+B6ECBARsYM4Ab6tgsYjg/UI1pAguDd2Eu7avlzZzwXs
+ATHwhP1/MYiazN3Q/wpFcodicG6vHZ0GPg8Liq4gNCde9hixg9Nd4W9xkjHhytmRRC95zmKAhXslEjD
UezYlYxLERzYGIiqEVWLA8Dsl6LwzgsABzhclMAwCFBNx/Bsw8IXhJ/T1IQiAASF/wQWFiNbmk8IC4gP
uaw/QTugUzTQif+IekpWFpMcV0Vde6dMGa8ON9Wwe9BIjWT5OI4Ygy4hBJsRIGXGQqMQxIhEYIjYCXfC
DR8ftN5Nbg0VH0GLLromNF4QcBiJDx0dbGVJZwUcFsNcputDZzi8CBNNOzVBGyxexEJFPQTPteRDJHhI
ieEoVk8oGAZU5CCxdRWVJFWzMop6SRA9iecUNUYSKlt+qO6wICkNVIQKpUgRnbejmaoJPPYS3QEA0EG4
HA8HdYwRUVit+uVlaCNcJOuIqkihmj1GpTBadFgNagatSATqVGNsuKAYfez6yPyNehOoRuZ7eeVgFlCr
bwC0qYpkGCn3VYuIILcqAPXbCEgMsQ+jzXIisN8NqKHkSItvAdlJUMRPdvrYIXPeTTnUDaiFqnhAzEPU
jXgAn3FzN6gJ6lnn/U1YCWKDGqnIfpgcHgDa7mb+dNxM7zD7XTJ8wFpyqetQeaY58o2NUI06EC/GDIi+
+w7W1x5//ZlUMUwIdNJMA2BBaig2ixSo7ZhwM4IvTIk6s/1Ad5TKUDFe4EyLVOqFKgg7MRLrEAnVL4wv
yESJyy+oJhV0IBVcMxiMR5Qi2RwLWqgywiz9W6harKg7Cti2H04ywn/7/Em5Aq8pAGqzIFEPQlCCOi1M
J0UUPUC1CMPmUNSilpXyoiZAbYBExAF1RPTyu96OAdD3ljYcOBnrMiYp6ihFwZHG+6JugJX+6yjnwTXo
LkAtxucMGA/enRQ1XXbmJwnOifUjFBEpj+z9xEYSqjTIKrlC9YQQI/sMucwyQtUSEMy5IRntMNlgE2lf
4BjG43huaWbYDFWhaUMJm98w/lDFPgklSAHHBfuBjbDgQCRz2zHJIwg2loUfZykMjI6mkyNwK2dqG2cQ
3UMXHGhaqHiL/Nbrp/yQUwmjg/5IS8gDwQBGPkvW7UYuqF0Yyfx8mTtP7iADkOsLryyAYTvXWaMQ4S/5
JixAtzC5DGfjcHig6sdltkRBBCRBkG/AHwgMsFSmW1JFOk30DCgCcc9UeAK+AwbgZpBjPK4SDCR/I4Ni
qYXbQggDShB6D3bJVzVwK9PPRFVMfzEEKl3CMf5vkO4QHU7wVjVqVr1jBRnq6DX8tJFB6Is7i3sV6IAf
sRDb6FZdwwgDVEjPzhNw045ig/7wNZ7YX/YqoNTyua4JrOKn6OlFlgEB4aEb+8hYCMnqgD4vGuq0QR1E
eKQk6GDASQzVG/wMB7IBRS90AmU3C6Am3wFFBzGDzlDGcQYG/Co3yNdHFyGZoAeMVXGBlMABp8G30Cp6
1rXAAQkHVaB7swJBtqVsVNsEnAFVrFK0n36jHky5sQaA+QYO/8ds2xXA63b0KToDaaKwEJBov287pIjY
ZhEFQviqIgXww20YUO2W/QcDTxAjcOiAKr5AH7eZ3LdiH6RPC+hwKBznNmLbtqYpB0kqB3uLxTd7dDBI
iyUtr2FJQfVNBhBRoBlshGYemomKic1uBDH5A4iNQb1A70pCVh8PKFiI2UnEKD4CT7tmvwL/RIiM7wSI
YnahZo8oCIiStVSxwX+0YjkJkN0MwMp6FIgBAoMNdg8QXRCcEDB2sAJ4DxByXTADlITL5VUgTRBFALkX
itFQ0wULs4P5JlyIZwmMQSQ5yHWHg8UvMXRQsP88k2hHwZooaB3juQHXAwGLzOQ7ic2iaDAfi/pF7EsV
F/d1LOlCJd2BFy/iJ2BtBlDPGFhlJqPWgBv0l3uHigb2sNk2EOkoYHV+XB6ylRIsMGZ1YjgCQPknSBN1
U2ABQARur8LuRbqKoej1dTP0hANUB3/Z9AsmLxkocAGrbrAFVY7we/gCAYN8/LwCxIzo4HQoYEIsvwJm
PJ5uAqLgKk1vCBOe1BTyZrdYxKJcQ7Avm0zA8IJ8H0zJGrhFQKlrmXUuJ+wJbgUHpZDg9jp0SohoL2Ep
SShNUa5qXyA78bNZU/GsAQgIsQS8GzsYAX2+/f9RpukfFEGswc0G4l0N1a/S9ucDgcTIAcjDC6NHNyw3
fyCDDDIPYHB64yPIAMGK2QOA+z07kEFlDyggDyimOpKGMGVk8GokNbVs4BwgTMCQvnr2IRcxcmw/XDqN
WkQk+QRAiARJNKrOAcAQSjUgGoQjuARzoAeKRPdWXpQDD5IFBnRCFJsgL8D27fClDsCUR/ZAArgF8CUq
VsIrLUTTAaOihQUfVGJAbLD33rbC4yeepqD/FlYj4q0BqBTFAVwvdecLiMGIRfGPYqETsQHWwXz1PvCw
YN9v18UvxnVO7wBYgIp0NCQudULACupPonQX6zr/CLoJ4u5v9nXRLTG2lQor/T/NQfyK4ghBRyn9DI7Y
xS/lA8wgdkdjXR0HZAj7Bzkdvi9gRCSWCAkBhxcKTlFnv4naKFWFhpBkAwHZHA2NABUvAZF6XcQ3IE0P
RPnZvYLbFbwAn713KuIqFGOs6Ak32MiNbV83v4nWlgwH8lDYBkvx+3wPtlB0Gf0BykLs4+0ByLbFd1bO
zGkb9i/4qLi5boD6Bklt6BHg9tF0JzQyuYcd9LTEhSIetLOz/+bBgujiQHgET7Zf7GFRD4bcjUtFPPBh
ty+i+YcTBfybU7bFtgLVm5XqmyIPNwob50q5nAHXU4MKAJ9uJgbMCM2QZfsNKMyk4wMgQbIGunZ2JF7D
TwOoTQa8RUB18uwxuqw9X7c2X1uqcgJUJbFRwgRL2J/tUAa3TJHrsbkGvakFOBbhWxPgi1IfBIUjiHK4
2CmIzWsj8cwtfgfIQQK6dOs2RiJ2x5GLSTRxAe/xC0E4Akj/6yDEprAaGwLOJUFtNCN5ZDwLEQ9cZVIX
HGpAuEZxLDsIXkS0pX43GgG7P3RLad2NQBhFHWv3SinqYDFuMSxF9gOUhI+zCnA52dW5LYoSBK/Fl7Uk
9HUZ61JPUhh0BsArgju1uKpQV/AVq8931TGpsNQKQjhqzdbKcaQZwr5E1twM23eLa3QIB+I0RxsVYxuC
eynHgejhUYp4WxATKjxwgqIEdDLy+jhCDQRMnzcsEq9ibJhkVU35BH5cAgSxgttnQiMMHhABGIRhR4Bg
boXADSBR9aIFJZqiisWMS4dT824EqgPACy7HAQBYnBDVyN2MCD8INCw0ZQVd5///FQSCADvmFQLxB94F
lG3kIBDJiN3nGXywIrWJw4nYBCSqIUzDwyVBuBxA5+Y5ChFnpfiSJPgcK4IaiP3G9GV3RZIKkohQgH8C
VHoFj5dTXaQC//iKVxCNSvt5uRGLwgVUUy9wnMUOVyFHGYzHdEYQC7hgthBhO3WjwO2xAeZjFBU3/+I1
IHpET7NBAi4V9HNTe1tBu0hlEELr2VAbKzYd2UB4ARn4pEwhf50xCCAh68wCAA4C2HKttYOBLQyKREEc
+FpqEW85ASK0cIobS2EAcN36fBb9YaPgRYjBnwgMWcOwASok9fYTAggxwFm/oPQCNSlOikY5HY8FdaPK
xwZrAQ2g7WJXBBONfgclQrcFGaI+Os9ICeZ3CwhHxMwGHbwrRLz9QYpNOoD5Ohrrw9CLwW4PWiCPS3S0
GXKhFfx0qzjId6cXIQyMjraK9uH/4RiQ+uxbUFMR5XQXKl1wQm8aBKlMv3ICBNHug2BKkLSMDMoT4pBA
H4t1X+IHsG2orwxNYPfavwcvKa88Kv8gC+2JU0QTAimzAnfcouLkB4DCHtKD4p+OATXqxDnWgA7yCxWx
D2mF0jY5+pwI4EheDAU5m/0tdh0MGtnZdAmAOS4NyWZpyXRdEIfkQOXFAECLk7vrv0QJmihIvcOL3q9N
3r5sWwK7Gs0fkN/wjI2Cjn10DX+5IGrUKxALsMa+Sd2FClyACQgGIJm4qicAak3hxcC1FXDLMkMEUfsJ
Tw6xQYpOIjBU9I3ZsOx+BedELYMcCmBxChRQm8E2HzH/3IUhvSAeAE+CGgpA8EsZDpa3GYH7LgRjAG9l
dAW9UFzVWDFShWDjEGCSqnr1vVwdQQwECeP7aqUifrwPCp2FI1jT1v8DXTL9yFHQdDTgua/Zcn5hgYLh
2g5jtDjwCnu2pAgv6yssvCKO5AJNWgUQK2gRogUAfrCVrfwcqCQDObLY/+MsIZgxpFYU8LEcGySOBHq4
8YolLKv9aI293f/lj4NYaSnCgu4MjyinTAFzWYlVCC+1C5MTfEYIDjVBiE4F2N2AGAhFEQRNIWd9LIrd
RhkETim/RjjrISGCINAJCH2Ac10EbYNFi/9OSoB1FtCcaOlNVBG+xwPLfokOegC7TmZWEM2a/RFwviBi
GPIw65oR+4thc0YNGunXzxeLAMG/FUOnwVHNCWh6X3tongWrqd8+GJE+60xikGjOJVJq4eovO1V12rZQ
61EEklxhTQKOGMgRNlICDkKyAh8xdFcjVZAQLf/HIxsY1gACt+UmyEYGy4iaZyhtGkgYFEPvSiBijAL0
9qBJxEpxj3xVsNuVRu7GQe/YpmwZQA8fIMpVkUDTKezsARIoHi4/LEYwkjCbQyoWAhGIUdEtJPJfOIIg
EWM8MH+cfAG4T3+gEB8LgvNfwIM9nm2OHFkAgoCtAALYAHzGbvR4bVxyZMiCgIcAoNj2V5OQk1fJZKAM
C6ziMKL/yCXg2Fc0VQwKdCqAEsWKbdT4qO0sh0kOxhEWcIMEXfh+CAaRhoJmKatVzIhCVS/fBRdgF93j
dxjvgz+jB8YsWLTQRyB6Ii5PgZgUkbIxAggRHDptQxKFrCgPPfV0LtX9z71twxF7kOoW8n5rvAESFR7o
s7yknhJnX4nDQL3RgXczCHV0R+UiDtDy66UoFuoBEzAEuqOojYrgieBBWOIA1BwU9623LWXUP5FYgCRa
SlEC6sVJwYe7wDZmKDdddOg7eAK2WCsLpezuZahci29vfNum7RAPF+YdEyMoM/pRG3YHEvuoE0zqyGoS
sQUL1MRfTrD0XnYsyRMws18IddNgVM9Acj3DbL5q2FjJCEdh9bCxyfY2HKZRbyBG9VLv6Qxq7XZcZeAO
KkL2FbJrh6jYLLujHAcwqq11Tn6Rh2vAIEQ9YkNZfYp2XxmBFesRJ25q+wiAh/h0PSdjsuoElKNLDFbc
AJEhb26JLA6huIMLrXwOpEMQATnRYQAL8O/BSiiePQ3MQHC3jyUPFnBaNbSEDVZhItmoCJ4jIrOMKfex
bUWGCiQWNmeSV9Ipiv9pOPBT5box1XMTqAEUVOBeuhCSwPAbsT1GOyizNUDWwx9TgaK7L6f4wXBbw7YB
3AENPHa7ASui3YUsUBUQxZaiSUEN0EDRByuTBQ1eIj4hWoACg0xiIkEJqwBLhRzYEv9iQwF/w5b9BaPA
AQBF/D7j3A90hLCKCx9oKmgI0HA/JH8IDbGte4j67ocDDcQ2ISckTBlHwgDuVPsEGJpaQasNEzUEgEs0
gJQ8jW4gwYVYK/N9dDq/kYPG4ItDWif5olK0Acv/LTJ6twlVxfAldeHrEn/1vwAw0sHnBE0B900p5xMl
clSvLcR6eyxox/BCTY1kdXXqSCPdDgtP96XhaBuKSzoFkWndPUl6sG4eQmccPWhpPQRFC8gUvAwKAaCQ
/c+qHU/EQW/2fiA9VhCx/5/ywwEnxSEFALGOHYgVFaFP5QQoATGAqgWT2lCn29MoTQ+KIRDAHS3ZYnFC
VeRtIGx8dIyFBtBQQbw4RcJbAwVm3QLL6zjP21YASOcQ1xnDkIgm0InW+k+xdVF100ScIB3rigYrUXGQ
TYduNQTucR6kg7ltW6A83s8+2BP6Fla03aICj4nRDv7IfQt0OP/nTbnppxwVdCigtVyA6L91xihW1UGz
BUGNRff6Nnrrd4YdF8xBk1xlGH1rEh8TF+gfl+p0TUQKJlS0NGnDgi2qmi3KVOBqI76nTUMeQ2Y6ENF9
AkTnP31BVQ0VvexBCf2+Op5FQFPdTDSD4mGmDPw66z+6i0Jreivid72b6xQxeOk527YiLnOxDArFoqyI
dy92NpQW9zHSiEjVtlkqHwnFqfwN2G7gZpDUhzBBv3QSfVJHtryWDRWjEw1VvF9BsAW4F8YVWHA1ws+i
TooKRepwE7ZDSO4C70tYkgTRVk4W6eFRQwf0eeuCMsV2v4AE5osY2q8aKSd7QeRiKmc9ZzO0mTgjao9n
Z2SR7T1BviOqbm0JZEK+PHIqRbWQkXJyBCyINpaqAVo3WRBtPmNahhssiLpGSJ0eAVqDasM2IHkiYqy8
bW8UtQTBK+hzQGPoCeAfEFvAg/AcUTxEKFoFOjoDLBaQh5ShksPCiwAEGl0NtwmihUzoxTH/NCZ+P0Ft
MA24sKNaAeAlugEbbjgSUgL0FkTtwzn4VR2tmo5oJOBtC54xyU/L4X9sgr8sD1JFOCwpde1oLSJOvBtw
dw9qxwCaoHBPWatHf3e3Is2wVhV7sWgFrrL5YaBwtGirE20VVGrsVMWIMvcA3pb8NAFMngoh2CJB9Hne
4Hm3wlTb2td/0ggWjOsebpdmCe83eczd/L+dVg/kyJjjAhsLOrKQA3Jl3DamALJJRGePP9/kJCcvLbKo
wbKxIxNyUrQaeDDbcJAM2HQp1+bQlnZLnbqoAWp2HFRLhZGbLIi6Vw0gcpMFu0kNFkRusrw7Db0siH4M
LzTg/rwNFkRuIhi9FgCAWdkLy0hkeQDGa66HZGMwnwdSwQpfs1hDQK4EjmcSMaBAkOUsuc1iKrpBZWpT
/+VGHfuTANvrXb51RQPrieDbu4tZjQydRzDt0+2DsAHxokTlxrpAY1FGQrbrAXUKticGSAzZRhGzIxHE
QvlYs7G/Wn+ld757VAIV0PK5YhJHB5vHDkZfWC9sJCCgHQ0MxQwirRcqWJwKtKEB1EMAiQ4FBLAMllAu
kAXRD1G6WiLiol6ggA+9AQBoFkHIukXCQcCC7swRffCsn8X/7iCEMHjhoJps60D4CYMfLCH5KxYxtbqw
ZBNIqby56wJICQFdfYnIskZEu4hXUCJOiOjpQhU0i5MVRcpkB74wohrYJQEO5oHqBzxGtt4HUBJqAkQI
f6zqUgVO+rYH0kT1SFSDAR6v6BUxIbVAuW8UYSpY/ot3BIJQRBcsDMrQh8cufCA8AHhZA+0OoyCbYjgV
w1FFoaIZTIkSPga0aUk2l1giAHo7SojoA/VUKROCJlDhCIShUnWmIKG5OVO1Af9fkQ9ntKG7yFcBXLh1
uRZ9quwu0Y+c+xSWzv/iG1aVvu5Y0BAHH8sQeiwRG5BnwBBXEhMy5DuyIyMhBRANqOorB+a5C8bpmmLn
uAu5FUl8DawFyZrnC26JGzzNZB0ZZg1SQRcR6nvwRMENDBOzeT5Tnw0JKPi4YZ8UQAoXBdW4RYm+JoCz
uQ0OM4QgQTXCYJATPhX/1s+cGBzJgRwiVQEQgCgklwERE6JBgF6vQi2qJPzYiwIwq4hANBGsIgJQ8ahK
FmVDvW2MX0APKUp0BLoidvCATwKPXAKsIS5LAAequQ9dKLYhQeMUSCwIOAxAMJ4JcAyXEdchWN4CFxio
ojsBXIT7JGRSOlLAwghiFdQHEYeaWVaeu21lNisYJSYuXggDALEkohD4EM2RnuqKuHYgVhItrGIJ6u4c
6ZIUcTMrDbQFHDowdb3NfC2DqhPC5yKBikAfPyiGFcVfpCgOrBdm34ri7qoh0sqwAUgRsELfbTFZUEyA
/1g9C2YE9WEi4JUhwhSWigAvmEFcLqmgR/SE4XA5XlnUNgNQP/FUZFETIAk/KGiQou4gSABdQysVe4VA
MfgzexWJWyIkbB9W1FYQqU2LNj1Dc5M9UhPHQwiNQyJUeHAWBOpBUBfENhohGwcwPuF8hIOKUwhYgo0k
ePD6/8DvRN3vdwha/iPcBaFiAsIxDSeIgv7iAwzAni6yJP9TmOf9kMNc0Xz+GK4bIIeKWr/RT1YQY1F1
WA8aBIJTSLivw0XVQoKfhQsVg9GLaUUI3YIKjYZld8EuwEDxoZshTQH81CUq9rARY1ThqOE7KCdWwVPB
bdk60fewCg5bWZJ76TFnYKECu10kI5nsA8BGMcpYIFp4Xgkx6Z1ZcK+CwSp7Z6shZ0PIl1ltL0CA2Nba
Nxx1M2XHVtHmIu4PRfCBKlbV45rJAKtgtxUihzHAfghhRDSvOovatgD1Xy8pWOBH4Q2lEEk7OhIl5vxQ
gIMp+QEoG3pSNCc08fFbJrmMNTSKLjj2DP8lYYsUVZMeG4JFbfhEJ6QfKCKWFAuYALON6D2wqCOXcyl/
5T9qixa1A80U2g3aGR6hW+t0SXc/J7AMWNSzoXMtieiL6rKBPQ5OJotqEI6K6JcNZEDoNw9nolhUnqh3
qBUADzlJ6kd9I65zQ0wBHSgbEBcuBFBWAGUAcLAinrknO2odV394BvAAxfwn5AAxSYtthzgIY8nwLyd3
V+CwAMKBVixRuyoIYMcFXlZOnAwHS3I3QipXdqgLVodFiwdKbPcVbQ1lGx7raTsCNckh7lYxvmw3hlsN
8t8e6207PNmSIbJ3dH5JaBg2cL+TdU1UCPsWXWAsA/kQAetPQ9oedmRudVd7dE0/bZkbD6eIjUr/O0mD
8YpGzdf/VdLKiiD+BhIYRQz3FREtrIovCNUFGB9PLyb/rQGf8YPMcxRvEfsAPBiJzx9s6LAhSAUeJr8E
KNEElndUwtUSfWCj/XC9G0/G0CY6SsYpl78QIBdNIb9QIdsWCmBSUqdOO1k1EwjGDmZ/UABSwWEVj7g/
WEhUDMMvAp6wqA9klAF9RDEkgGOIcQZ1AhgYTyEsKiJEKRnBKSh3FYV5gBb0hAcreVZ8yYqFmS0dhxhJ
VLwOqopRQfKRnFwhEGaoASAPrEbbdq8kaaIiQSCELCBI/z9gO2gdLwcCBngQ/YOBAjZSaCEf+8EiWmy9
BitJQfZGmvQXEaMZD04BLGyxGe3emytHicMGLD+2SlUGG9j4qrM+i0QXIhOS0BBGyEQNUqxMe4mIvzXS
HE40QYpWOJOI7l4NpBhEiFQY1SOkrh5D70SxwyhoEJMwyUdSsWqkAcMRuBkQ3bC1UKpeeunDZKDoJkde
hesTiSQ8m0U/GCaJ2AjAsIXvdeXFqAUo7A3Cg0DEJKcBoMJF9oQYpB7rsPEL8iLsD7byK0JjZSMEG+7u
X2zy6iHysJNyo6NngLBEI6S6F6IXBrDkZaa7kPJUEkAfAS1p2lbyALeUASxyPgiQAB+KpQGvki9C35MB
dadSUQuQAd/4cHkYYlbCEMMuvYA+Wyu7CyAvDBWxhQTPEnxJRf2VskWTAQCQ322EfBTPkgGnbQmpqI7f
EKOiQCrK19+3MAB5d6MBo3PQRe2Aai6iA5EBVMhXSd9hpQGCFtWDnFMwEHysnygVzYM8EtBfANNHIMZH
KAL9sAJgEQ9fBhQkj55NIlPIByB2TSJZsQIgyU0iL0kUC+S4qgG//MGAauABMc2LN6iDJIpj+jIJumAP
IG0fewc9kAF/LyKJYr+/j4liSyGvjb9IFG8JEKKLD78sQB4EeaBoANotpYO/MbI7jiAPQKK/YaKIyYoD
iwfiSEAKHrpXPyb8TwrUaEQh8x1gYEQXUKqIQgtCDwsItoq9O0CaA7Y0wBj9gBDIZgEcbKg6GMIGkOdk
D1oxngHkO1IYDEUJ7wgbQHeVHDHIZwawChgNE7sIe4QNBiz3p5AD9hVv6hj2bBWB7IAdhIk861YVyae8
NtmAHetAFbxBKhUD8jwDsQUU/IOMgJqmDXQQIA4E2B8wlEUwf1UEMYZE/hIBB4mOnTXuNDbiz4BdMkwn
dRCIaAYRUHchEH8R9aMWgvRKmrNXRGBDkTq3w366BAJe9BBFUoyFfJGxjtamKU0kBYKbqYDMU4pcR7HQ
keo32nazjAFDCug3rSAIxgIW3xqdNgSjJkmZpK83qQesgQXqBNsEv5+lrCJYRsR1HPtQN78p6UeZkDxD
IuibEN+VBA6oBEkpcKKk6w4QfzYDMRktZG3kKkwS5y9oKUy5dH0SCe9tRm6xWDMepRa6B3aRKpouJfR4
CWyjit3zWAjyLsb1BLYBkMkG8wO2qYLv05jzv9CXHeCKRwFv83iYAbQrlBWxYmZCqGJkBaxg3Kr1rU1R
XhAdKQMBhYg1Atr/AGhNtCtBgH4RAC3kgQDBnG/2moAD5g4cIx0Iol5qgUttxV5utuvrPXWAwz4TmxjQ
hdAG0m1LJxUMLcBmgho26nkLTSL+U5L/FXpGIgD7AAFMBc6vLjEpYBhBUG1JuJtrItAPMj0diAxTfFYF
2wE4wpgwiCdQLCIeRQ3xGlPyOcmJtzrEj9hQtTtL9zjs/gg5GdU5sw+Rwg+AohnE9iHH1dLi7FH9unRf
gHAvHBDiLtAVC0XCOXf7uio23zm6V0jBLR1BqxeF9o/dj4pX6OQVbxUxFOzbvsAppE8rB4IOpAziRo52
ZoYFIW5B2StFhsdZwd1eiywkcOFsiRCE6cqKdPi0bhAO1gdqLnRhifAXD7t1EJDHCt1DvXRDIIJBbAcr
kLG1yOWGKwZbDXTPbQaH0thHWj2woCCEQZZMYRAxkpiQCg4ZVU8kRGFUcZADWkRPEPIIeUlELkQiBE2I
j8cj7iDo3EyTx0MoIRq2RDCnQ1VqIRY4O7BD3AB+mAMIXNFDIgAKagIpX8y3QFX7A/9TdH2yDFlUcG9D
IlYsoFk7kO1kgiA14kaVF/t1MP52/wsR0t51Bk05ZSh2EApycQJVjgCg1xaKloAdWEQwEDuJCtAAFsfB
2P7/PBbzQQ8HcTyyBEvuVlA79kUoULu6EjBJEWvQJvUETcTQq1dLw+2lOBivPEl5OEnHW4ciYhCx9Qq1
BwHHGuIVtaUi+wNHp4WAWrLs3Hb0WIkKehw314oGbk8AvBAG6wwG2ld/QVSKqh1LRpJigboW6sjIPcFI
8RKVyvNfCEkP1IAQLKcpGt6AxpZ4WLJDGAHpWWyA8Ak4GNlEwW1pJNSbQtR6inAnYXqERzwUbRu/9YHh
ov/ltksRJRpl3v9BEa1vOx4JZzveydeqWgl0mwG/AhDhdUM/zyoIg9hBiPD5CXUTcmN1Ix9uRaymESDd
kgnIHybQ20IXRUV9fRDvhQUA9yUylykKQgWo5BhIAD1ePdJAVLKqr/v7eNw1jR2n1qQWO4sFvw9jxSDi
hS39Pg3I0Yjay7plEbTbAKE+v5s/AToJtGZC8Qw/BSbkEQpxBj0iBIaClvwo6D9xNEFHQBoM7xymohMB
yECggKVwB8ILdlLRdt4HM6uvOGhIRQMnRGASCamrR1TUXoOnjQhLRRCeQR1ADP1RcJTbZhkIUE5A+3SH
KLSDHBSLc6xzAKaLOXsri04q6gYgDyM/I/GuYsCLOIUoBfB0bqnoFfkYEI/bYBJUlM649caGKcZRRulm
99CngNo4DxlFOoA2nhQVRT5/QGtRmIzRRSvwEWhZmmdIICNJTAhPaCi6In1+XHSKRkw4nD6it5vpWNxE
BQ1kPd5wGzAQ/AJ4opw4W6g4Y4d2wxoVUfABWJ2duH87CCGgk31LrEZaJAR0AAT/UfFIKKIPH5CTwIT/
/HatPvYvAO7jCR0ggHs4AnQfBVQ8sOI5APdADMQEtmfeQTwePZ+jKjdS0qo4XIACQWAkn66SUeGKC82W
UfGWAIlj3icnkiobWz5ShVHvYjZndZjrn89FB4u2sm66QZZRHAoy2qqioYIhlBUeLuoFiXojkQLxgdRC
Rm/GQxmIOgXw+0MYPAIgQoXr4hQ5gqth6FpQiCAVIwAK2j0DOUFIQUGeoAIfMM8zTAH+rViVa6GL6oSn
CRisrmc8hBTUFHfUqyWDMsHvIKo2bVuHFB9NiIs4UY2KF1Z0orGD76bbF5j6HuIglUGB5i+8ABDvSQnW
eAE7RYQRWOAIb0A+8/zyyF4oxEKp94UPD4XP9M4FxPe4QFzrHQfUtkjv3MRJYSSIJ/tWTQH3HkG0A3OX
WCBaP2lrpCn9whAFY/C+e0Ddg0U8GjtJAbr+7qE9fvpfO8AsRVNBpGcBfQdY/qM7f0cd3Z1C2PSKBTMA
QdYBvC2KhBcLQo3I7mMM+poqtQTEgA1oOq2QKDY9SCC9knE3LqADO0MkSfZqCHYEJD0yNkVC07SBlRAO
nREUQ3ErtaLNnwe0AgJYiAXxsWCPRbI3kcHuCA75RIgn9wUH8ESJdwF7TTCIRwciWRSXbiBmEgVvCKJH
2ggKD5Gd+TehKGEFzc1GFkMaNqfj1RzrKCaaOHgzHDKClgRgKEBOWBwPH68gOw/klRzrOj9MITuxIEgg
8kToKYDPL/VyMNVuFZ0ByAaZNzJIl+x2HOTugAtV1NVDAypEKF0pCFO9Kft2TdrA3iIBsCnB1xs6TAER
sX0oO0UgSNsAmlig1FNG+H2jD8BBJkR+I/k5UzA4xgbAULc1n7r0olSwePVgdGJNBxJPfET30tdN1yB9
AiKmhDlQh8R3xDleweogicHa8L4KChRw1AgLBuWgWpRlanoCsEToiUTDdSmDqF0jZ0SLELoAOFAxYq2o
Tpd0dBB33t4HBGwC8oXBm4q+EDlVdH4I62pqIEQRRQEUxMhJUaY5b9wJFYcbZVedGBxcJqvSRQw4MupV
dRhwuO//TKLet9JPOCIAZJI7FlYAoTgGj1YtjCOfNXHfQRCkFmxfEzRlv1hRUMBIWCoGBE+m+6ooFeQC
fUSRCt6nAh8BtOEsoAYgTzUrcWFRtUnbf++sBatVwio9MMNhOyzPL0kbtbF1dNRNR0E6MEosQDCMF6dO
wneE6gzmRnwhKPFRgVs4ShVqRC0NMQAwRmwU8hjdmKQ26EeUKdilSxB0dUpyaKP+qGc/G334SghMYv9M
A6Ino7UBQzysVB21DT6cQSnoE9USIAdlDxEjaMmC4sD7uIoNm033CfgdFuCxWFHPN1rrW0vUJqHPTEEE
iwWwQfAJi1IDeQsQ6ih4kBGIF7+FCdwUfrZWBIlGAcCGBBDsZgDqWFhcIRwyVQvJD0AIezjFKEZGgn1B
RFNFC5i4RU+G95sT/0V8GIw/fBBFgGWfYdmLCQ9I+QDLeKPaBKJJBz/R6JINilFGCYApogFkzvFFguik
rRbg7BAg+gYIZk8ZF3EhBSzP/wgJIzzHMMgB7w2EsS64QH9b9HAwoRHS940Ros9sfnkcJJCtgDFW140U
p99p6UUS4g+E2UirSIlsD6KG98dzAkiLbUdIwgGEN5xsJDhHdAdD51rPCNbraHmMg/m2AGD1GxsnNjAY
AfsqTIl8e0ki+KUo+TLrckgDQmxgr8Cblo6HMQII9fsxNAV9AGdC9CkaQewIQ0ovKH7EwpAoqOaLZ3zi
F4vGAGlJzMQQQDHHSLVIzBRTJ+lZAyQ0NUpNiocFdIlmoowDi0SXHZCM+DMrPJuQeFhBQmpv0yQFdBML
bA3QKgZQx4EHKPkrp8HJNBsNHCRtADUTarasTECygCYfCTs3JQU2KndcgyeSR34ReJwnKL4QBtUERGf8
5AIvgWKr6IkdQJCSOIEwjwgLKEl/TAKCABTfERWJwyzXJgjik7rcYxAcjjMiE8UpsjeKQ/zFJIqlaZVx
VSygR8uwGqnAVIaPQYmqQSKVUEY3ZkTBUKGzLxbQZQSPMLWgpSBPAUvqfiigk/AstRYyvEy9QB5yLLWA
im6KYgFdduoxK6y1yTibih5DaA8BbbiwwyYYssAoktFwYLcw6TMPGmQBzQ230Ed6xXcX/kyX6yBkXV0W
x2RfYCFLqgFhey6rr+KFqnUNAetvFr+sCbbzuwCrBjt1VevGCDqAVL3rPWKHnEgn2DHNCj8qmsmMhApe
XDEQNAyAIv/AAkqAMU9lAC2F/SxP0EGAFxgx1A4xIB8AFk8BTh4W0CFQMU/QQzhU5C8z2i9CTgEWTyYs
yQAgpP8vYJAFNC9Pj8IC2r1cT1MrAAYgER/JK+SQz+DOLSH+jhzA3cAGFfYuJMiQBLCoLc/A5JAA3LcH
z+BkSi6Z0NDAhLwCmcDBLQOjCsjI35MinqIIGZRYGoNIFdFSLxLQ7KZlEkUxkd6jCmbwUkYBPOkKElTs
wC84h37NEatTvAMJVT61ImqgfglWy9cDINkbvvkWxVblZpARyGVEfTBT3M5Z1QdUF+kFiaMeUWMSIKNx
+GLsdujw/LEeeXwii9AY0HD1vp94mKSoD1LC1ezrjHdRy/gGqof/BCFsGxjoS16Etw9VjMFwWPBMeHko
FYoAYy1GV3uakLgQYBMseheCk9igQjR6IjhVQcD/C6GAJXA/5vhi1qC6jWUwZjB1DOIbypXDikU4PlWZ
OwBmRRixTSi6WBjUdV0PwkljAJQAv9FxWoLYjkgEOfA3p3mxyd6qYdUPtkpqLhCyPmDGdb/rNC9ScACe
mlXIE8UqGAHxh0goWYjdmIFUHOKjTIsG7Mcs1ip1N/sSwJoHDPofxkUZ9gFqVhUvAtUJZ/C2Kr4IvSoB
aQgStb0e6mERfntR3MGyikTZZBwMfFG8BEpGwWpbxkMEZi7fjGBI2FEG71sNSQXvDLQOlSFQ/esXEfXA
hp8469IiQcTJLSQBv6hWnTZrdEmH4GqBoAbX4VLVQTAUKydXhB0wyRHzFAxgWlJwU8kZPgGqkIo+RE5F
6xLfOjYFaehRR4toXAg+wZCgxyFXGTx08SKj0wHMYFzWIxFih0EovBvCoeIhxFczsA1ECNpwpTdVMdkm
jB8AnGEpsR+AZJSMLBRh90ahdTnJdC85V03CC9kJGZAxwCp0GAA8G01e4ijjGPFbNtaFIFRMkbARvIWV
6Qx4CCP1kFWKPaiFOqYByYqaIzYh7RaAQ+PBOCIahGBy5EiX2yKUIwc2MIr4LusCyJORg6zFIgTQPOsl
GXe+IhcIFTBghIRpNoN6S0HbZwEtC6CWAPGnIiJt6uTZwQpAACn5flAACLYMH0bBGNSz7IfXXmgCEgU0
zShLSFEnAkXoELFLfk8B//9AdmuoiAX0aOAHIHYQrAMLblaZDrYlCR0Q+BgAAdgIG8EkijAEvD8jnISq
eG2GAqMOpACaJCqHfcgJec4ZoTmIfC2houYPGl6fEip6shnknSTgyYpHOE2/FfMhdOBQ0GNNg8Mw8keO
sKkWlUS7L4LwIEQlkCPZIYlawpeuP2YBGIvgST4EaB7WjCTYIByyKLdYGsazqBZyA9mPccIJxAJAr3R8
JDAhAyIIPQ8MWrgE4gf2cMat2JNLdVpTMuwo4yUIeML0M7qLHZON2jUFEUOCx06AiISFTSBAH5oCsOdN
ACA2gcidcXEN3V+Au7vM5GUrQAEGPfVDaNYvUUmNCXdY6z5fLfG6hj/TJ7yH1wMv6NndJ0mJ7gnKQ+/x
IxpVdTIKDcXdCCK2Wio/zm0BrOBIQKfrLA++v+0lE1XtM3URuIa9zCp6qGUH74DZsRsnJXf0BXD72F1R
I/S9mkiJaqIWGOH8ARw5aSwONRKRI2pNfAEgtgIZSU1qqxYwiXr31QZgCtiTJBxii1AdNQwNQFSIFqkb
FBBPdVXFZlrQVoC7n8bwIm9vLTDBkO+4ttKgO3iJTCR0U0x8TSn3LgIcNU+bZ2JhUPB1I+s+LzYF4QgI
VnQlAMBtzyJ0HQdvo+ioMlFYDxncsQJuRoVL69GQqR88wg1gQwoB9VisSOLTEkIQsekKmOlYpgL0lhWt
Bc7YCekfU6p5GXtEC4QorhaQKjJPr2GokFTRDK9mBA+JT1RTrCI6uIlPjUMPmfAStL2hSllIKcQW5Bna
gScgJVkiDmcRuYI3LvcpoGNsFGzqZeDi+pgUDA/mYKcgTKIgu4EVQaTqRdX+MFLIiNjLISKLVqyoJQcQ
FeqsiBggzjCRSwaJ3yBgID1CgigWwSJZJVHF3rgIMN+gF9yCXzAmKovilCm/GiNVdEZ0/9GWkAQPoiGP
iZAXRg2A/iJdLnAsiBioDUUADbUkFZwgZE1SAbdwkAJ1Y5y2EwBTfaMkRqmAdgr9OKJBJhkZfUV9xHbR
kkXfXSBvIHQ7Ae4HMckWbACw7F1GTfMOQIu+WIKujlqcwe4WJ1UQNhi5m0XnAGBYUBkDHH2KYtFJksp3
OxG1maLSNaiMsKplxXTUE6IHvA4EJOiFgRCjv0SJ9ySBiruBrCAiJkmogxR6z2xvELFpi1tFyRtctxw5
Al14VucYFDEUsQNYBUx7diPIKuDIvBPVE0wX0iPdI28VCBQ66EEQd3TY/JDAHiKHkTyF6kt3AbzURrGA
4/+2GC6AkAG/HyQAXhgjXzGaALyQgRB0E6viIUiWel8HIQHwVkgCMcBtYQAkeZB4oRkR8GlkNJG8QEYE
PPAdIiwKQgbAGJnBADgj/QijADTNSHI4Ew8RDIBPIHQ6soQU1RQRQDcG1IN4RR8/L9RIALgIWsZDUsOW
hUPSXsLiyIYjs0V0zBFCIEgGwAwFB5owH1UCISjwrFBCYSeUVUEpGGv749UFIhZFyw++e9hURCEQXnRE
sCyqpwddHqpUPTA/awuhgE2c2NGNf6WGLELVoy2ANirEEECwVxQdqUEMpvRlYNxBPAk++WCcAmD8eAM7
VzCWYOxioRRMi8Cvd0ddFRhdSGPIvvsxwH0BxQ8bAm8pC+qwAXhUPCxh7BvQjgS6YQxm6k0IXKhWEDiJ
wp1kG4Ld3x+RXL6LQ/lNs7Oq1EPuS1/RRLSMqKLbSwT9NlXv/QUtX/vOKuIYYnRh3O+yH3vg7SdPdVzH
QzhELYqYRS/mzXao334BEGA/Tz5NrdBAvmAQHy9ECwQsQxSqjbuBigLQqmV+AWThBBQH653RvQAYGsSV
wAJwFbHlU1EFFG8uS5WJzU0Ku7b7UV9s3QeLhgYTWyRNAlUQgB+LtQGIrecp4JeJ8oBgCB9X36TtA2Cz
H18Ji1M4Wo3sVhHkEVtfhkX4kFv/UyhbVieOxiEo2WF+AooLEAaJ9KjaFvVoM1BOJgpADJq1/khBt92J
y+xSGWp4D+oUPxy+PcMfBCCLEEZoIEoQ/+4b1OZI9vgjuIEoHkmMgx0sRnm5N+vLh8JmRRzHA9k45xzB
d2aQmNVpmDN+f79toEQ8uil4DiuJ0FtdRACphtbOh0h9UqXupApihbf/0yC0IguKAyN/WFP44xZRpInK
QGNsSSgUwVpNMZm7uOLmgHlsq0wdwwiKXUEcJJgIl4uFT6oUlukZEfErNVAI60bQjthQEbBQGDxEZJ4t
CCAoxQjqIvQIMB5QB6OoCBlQQMKvxtiZw5BVR1SJzznShT3F0aZYrwjM1irCHVAmLyWQwyIMCH8bVH6F
pGrhL9A5R7dGEc9DD5fRAkLCt55dxsNmfxciwnIBA0asiHcTNcIPkyUfegUswo2PrxjrjF8jsgAQAAA6
zblQ/D5soojHRC1kQAjwAM1iNgim+Ag3UCEgfkxosqZaAIgW1yw0d4OIbWZlnGd6VAgEX9yggq4UBw5m
760otoMM6IjGdDcSBcr2di8Phy4XfJ/Yu8X2zg+3VCxmzwRWHjrsIJ6wNnXJRF3qSQtABlp7EetJQ3EL
FicHhfgZRvRDrw3og+f44Vi9aMNFiin5OXy2jpvogcF3wekDDkFJ0ILGMSDsZbxj4tvfCg7nOfp3dEUV
HHeJ6wEW6N4Z0dPjC+AK/+W48CBiwBbkkE2X6LeAy2FB98MAmXVH4qVSVTC8RAnZ2+BuASP/XXd2TZ1V
9lctYHtBgzocKiEL0G6hIrxa0AxSt9Ydtnv6Jk8hfCfv5mbwqApWfy0GRsclx0RPkC+4hQYgvcIGQb+D
h28V+f4JdEEHdHbC3YC6ncP/9sABmFIj7H6ZaCOLrYXDlKApY1T8sV/R6oXQdfoLaHMRH6qkUmVHVT+t
Xe9+AyFbAABLVHUARWt6jaGwhOoNdXTIMf8vYHuhqAejSonZ7tpv9ZcA4kQpydPiSZ10K4Xao6GxwmYc
vQy3ZaLVb88Piddx99ch+I0dcDfYgJ9IGXLlOipc+2YsN/fSQSECGNGY7bbRSRikRZYCxn9/FA6D/hAN
Zhy4AA5qcIDBeJAHc7DLWfBIdc/AxEG8D5zVGn7fmA/aCaBCFGUk+IPvSGFofxO4eZC6AZ2JOgNEmPNN
qGHrYlQHINCURvMatIWvYx2g7cKc0Lj7+Bby0jvIa8BUdGPuaYEguszUJQUk4lQEX4PGQ0SpYgtCxoQC
qnUAz0s1dFTz3Yy3AXuFuvOwzW50AGGpKv//4m+3RK0fYgv4+AH7IBTwbbfISxmLWNB7kIV26EyzWrCN
dWdDg2i8v7OUo0Hbu/FtRQnhOfhzZvi8AXoHfAcFs7d96IM/AFlB4HYhaPffJ39PGE0AFMSFQX9mchRH
h4odf2DIcyxzvEc3Py4j0nTnol8BEWZ/hga9hkcGXhrNITi24YcBOahIO0NzBRsPtocRHmsEuJbghfBj
7Pf3YLdWmA11+vnsMfbaxrG3hXc5BKhMiRRnVKLcHhvb7GGBccC/BpABOx4WI+blDWWe8cCNd6Zg/Er/
IcgBwqByB2TO9itYePbEEA+E5MFmDQlbrVGBe4Hh/zipldSEDUt7OzsPgl8B7d7+pWeqjUhHzgHGC2hs
K2ISir+NECpsUTz7dCQIrWmrNzCwAYVNK02JmEdlRLfgAMtpufp6hxWxFA8vGxxtA0CF0xdzCC8eK2AD
EoIMMwKKLBAvqA9J2wXqtgJ2QotIgEAoECWxZKKB2BC/DQUwLCp8yRCxGNkx0iaDURkYCP+fBFsVr6jE
g1UOFVyiJNYB9V4eEGyl1bnvHl/BJCq1qTgQHzh44pDbTPEJiADoJzBM8KOvwJANBAt1cQIdUbDRAxUP
iNAi9MMIDm2dhNYHDbO/sEoLa8EI9kMBIBhbSF4UDf+6EUIIIYQQQkHIpot63NgFKVzR6GJD2e0fRFTi
BUgpBjnRNVeQiYjvzcUgBf/2wwN0H4nBDxMUbelBgnmDYhwVsSuiHHXrIOJWAwC74XgSgCWIMfIYdndE
sUAhwjYptej2Ljv6A7FRixPnu7UKFRzymBgDQqjghpw/CUSNYN9CERSo0AMphG3tzzpYa7CD6AycKfco
giW7owHD/02u+2/btQEDK1DB4AgJxQ//CPa2gGvICGXQM2Y5xcmxdwtuhwLFijnQD4faYBv2FzJMKeoP
He0bqviqk+/cAev4uQ0LoO3HjzDbjnS9SNimAmiJwfqIYI0KP/qNOFIpmxFqBujrLrQdt2qzSODB7c0B
PlaycONwAYP8DSZuwuuW4uH7HcEPVESU2gZu6EbENtiKKLSPSe0FwaUqGp0Kzx+DnqpBqSM7K1HqvbAV
0RC/wLXB6g4L4Cq6FPgez2DybAEgZs3RHucpIAowxkXwYFF1/g7Yx0EIBF/hJ4t5EMZBrJX5mCkKCvnJ
lZnsKzE7TUsSledQcXto+n3Vq2b07UVxM5naDIiKFHLSORONEQ1hBnQOc3JiCa4QUFpEuz8IbsqD5T3q
D6WZ6zoIg1hQ8VcbSMiJhCRmEdthoV0Ag+Jnw1evUAMnZyMsBqjjFlkGnJyMLAfXVgl0cjKyCMtaDDnX
YEIT3hbjtgEl16UKHbe08RgbELY2gpWhITCPFAIWO6BkczHAAO/bV6beEs21Yv2D5kqS0AR0nwuvWwXr
nHvoG/oCVCcgqQwb1k2eA/dcrg0boZs8B/RTsw5Zrvu6AemzDx5dJ/EilPBjCVkPeSrsjHAkwzNdkcIR
XObIWFeiLTn1vOH5gN0wEMFSdEO3XkiJ9dmAtTgRSrNRF3DYsbuzEnQTk+4Ms19EuE4V/dZa+4jYLr4T
1UwNBJP46Atl0akc/RHNBW2YRHoEQTTgUNZ8AFxEG6QIJEGJwiv0uFFdgHYR/RUVIOsUBUCDtlow4KCw
YbxnwQ+GH0vt0Q27hR7EIO6SNLP+Cxtutiu3NE5m98YAEDPQYIMC4fLmqQWAuC1I78znBzBbaontQSn8
MO22/iaMBWDdr7kQdGQRrnOnCRI2FhuGprrWAffhwgfppe4pxpkIqgs58Y+NeHt0kOoIic5vAcbpDbYL
TWpGkpUBwbLYrgbEjOBmSojgINpvKNLyE26NTQ4vVe0CVLopwbHNvuBamsYDOc5agQX0GFsVO//YrIP+
PBMEnA+mNwjqRvFducaIDohOQkYDiH7WKiFbjQWOdQg9Iz4eh5MoQWx4ITCEPm+LA1Sg1Eg+YHURm3IQ
EI0MQ2XhxFJfyuI24kP7CxUUgOUQdTmN5JzMQoGgVj7EszcapERwWmwkCNZSPxMQF3BBiFUr8E20VZ/F
d6vrg21swXDoQkeBwi+mVh1QoVxVMKnp0MJVhAhVU3B7v6VzvXwU0HUAAIB7q39gm3YIb3aQgfoAAe2f
RLE9eVwLCMNzLoGDiFDY6v7vq20v4N7086vOichy7tg/TrfzJfLmBXLhjU72nwvMNsCG9PnyEG/wACaJ
fug5wmIJCAKwQf+DasmoX1ao33eYeK/Bg9ftc9L2wgRWebBloIJOY5wCbBv+uylFABB4q00BxclwcLMd
RfG5YAW82PbBLjZehYsrQTnIBczulgx16TnKD6iAdsNzi/fehS6A2H0TdzFKeHYN7oahY1y8RRnftg4R
tVWOdHJNeTXYKU6v1GI7do6qpSAMtI33RupXFqpCC6fPJnLoYYCmug7o4ejS2wX3AEolDvhL7w34bAAU
qYo4RAqtx2ju66Xrq3JqBTnYgHjua+GwdLikSAWsvCXx6xQnqBnp8atho9AA+reRzSXuO5hlOe7mTmfB
iYOwsHHB3x3rdO8QNlYgDN8RCRYEdPB8MgMRM1G6td4j0o0dE2BQa9BaH5N+CuXeRbep0DrSBuoBIep2
6UCkr5l4YPs099GCsHSNeZj3kryiBwwQB39G4FHFhViKTLQXHESRA5IURAUmtUKs+AgVGv2WBmHtTnIZ
xA0EYNutFnrQSIPgQu+vtt1qd0EE8UJXgAE20AtAfN+mNSHosfhiNiiBNR5YKQYYdvu5cQqNQQYBAA32
2zU4D5EEEcZBFUEDB+eeHesCAE6ICDZ4AQmDdnfoY4gPm0Y7CGueSJ4MbgXu6+c8RNXpl+EhA/bsBgsD
ugKBmgIgglEpTI9Z8A8kgLh4E67IFY5DBda+L2HwurTGTLc8NaoHTwVwTEXgXHCkf42QPDFVI5oKZxnO
T++2MEc8OCocJLMBkAOgarNDeqGol8b9D4WxKrgjvjhTQB9ECPzR7dgtIMHi8AnKKuh1wO8btTmBVq8V
AABvEEGDINF7AGD5mBtBivZ29FBfAYMVqxO5sC1e53VEsTXORQNzIhDdbrfbCGvyBGPzFmv0BFv1DlN0
d0u79gRL9zj4B0P6QQz9ti2wM50HU/5E9RfwBW2jbMvs6ALlCesJ921LbR3aOEPyETj4DUpcogBTRAOD
tgii2wn5NXtXzqkPAPgZ+dMDFG7bNpsY8XP8SMgC0Ru35nbbe/9Kxw0B/gccBgHKQaPWdiIB1wYP3x8W
wARbwxgldeTgBFHguHGAAxE9oP42LSDeQffnruzY7g30acLx/xApxyX34xIgDheaKTGB+TkAFj4ZdSd1
1CbZRfXwBNf4Dzh3UlELsLLoCs+nhZ8qYN3g8EmJkCogwgEQQf+jiCUYB9p3TiC63a4QCG/yBGfzCPSF
im4JlPUMX2gz7HaHV0MLV/kET/pDB/QRQrdH+zf8R9sB2FLRmrtGDBozOArXht0CxQM5yj39iTY1OMPD
A0Q60jIgi8iFBs3QT385V6Au1z08bATILsA28AvQfdATNlQBpzl8OncsDNA3Qp2L3YMi5FoV8d603hUm
chGGUK6qUnQ9EDR3wmDablxJ/0zPk4TdC1Cg/c1y5okfiwk7InRVvoWE9+ZjQLFrYk74D+EQ3SBsC+zo
FMCLMZPPqAs0gER+VZTA0KBldD3HoIMdFDjeqIhzTYSgFSkODXaebBg0AN+LD6yuN0S/Bv5mQ87+v4EN
YkAvBkH+AHjNpkL8Q/waZi6DLUwGHEU5qBWMwPgHTJ0YKABQB5JDWAeBGRwK7AwdTdeAajYyQvxt5xp7
a1AZDQd0fOXX3LcB2c4nbo9zj+ydTbZ0/iOKPjkQqxG0pJ3KVAQuV4nRVu7bblNDCwkJ6R1tsTPUgUai
Y3xmkP/NafEtuLXUVQpuBJnGDDHbBVwAln88weO2IGDDKoMJXfVBXQaoz6jJtFwNOpO7QXDVJm4EpXQv
KiT00W6sDTeJ2M7vH2m8A+KMJ1B0EBOJywoWFD6JGFuNZkegJwT/TYnP+/1Vik0OqFN1UOw4QMRLtRpA
pCSQEkGq4oFh04xcB/HkdRxaeBaGywwAEKwNoCEKE25W+Ud1D1oxpCqbuU6/7MYiSlSh0sxBWkFbdW5B
MKhcEyWLRENFByGWe9wtmaIHt9t2GLuWBoJu8dfTTzHkxxh7qIoN4t4UYoSqiF2UgcSp4QBiFAyn6BIw
Kb2pixBqqWjr2gQDeHZwRJ0o6CuUEBrwXC19CJgbTjX57iqBt3gSHCi37kHUL7T+JDcbSBAM0Zo8MDBp
IODk6zA8FDggXysImohQVhxAg5PtBQ0bQDCF32722M+UJFASPkA+D1jdgsGHAmLaZojpgbxFv+iPoH9F
TEZ0P1CSZNiOIdwN///TMk16oOd9C+HbjaRgAgAAKx6vtuGiIj+ItCFFedgEMvBmJxACVxRIBviZ+BTV
RTcGPDJ9XBpaVdEjC4FFrKh4o2QMZoPmaNsG+gGGDD9ARAVk1CHKQVTYM41bQOF+QYH8//9Dw8Ko4FnV
dAkSfXdAccHxxjjzVkAAYjRcKjItAIiFpguNxRgYWwBPy0hQMwZAuffwe15aZnqY5xAhPyUhgIA7zxC9
qFrof4jDMSqVAEggvjvYNgMNIzhcWFBYYzceBA2bQVyZ7hFXwgM9QFqgIB+WVF8w72M6iBcb0o/D+DOq
whmjnzrebLCK8p1XVnkYDcw2uVjSe1i+dVtAuDIXB7OJoNoNwRI8I4Om8Q4gbOCIAPZ8oDro515FtHVC
uSjgk+gEDYg0aDHAn3D0Cn8oHIfCzKgmfTGghzCGqhhVGtoWUTSCcGDQdWRUcQAdwWAB7kDKMooRbMC6
HcwpsAtzwSJepJkWMQY7gzgQRAg5lAwnQMlXwY0DxQyqp0ysLgkBbAGlTJ52QyiKUyMIAl7ARMwPL1+L
RQQhHokoKAGBJDfFe4NXWO9ExokH6NfQQiFIl2D2g2cfoGgif2h3NSYY/wOCYR2/6SEA6wnnodQC9EuL
NNTfcVmIJ9SgAlDigPFuUPEoDe913wlwuCcqC/37zMz1qHuNPShCuWSc3Br7Vj/zpg+X65LAOMKP5CTP
gT1PMwsPY59eySiClFM4FT8xdOmrikECxVY5dAhPuMNPoX7sizdMi7LyDEIzi4swi4v9NIFuwERjnRWD
vJF2B4iFlA3oASCI7dKMAwfTUChiVGN8GqPsOOeD3+cvtAwDkWGJ6iGBL4AiElC8Mn4tEVAWq1ABtMSz
TDQQCYM/JWcboB+hhckrsIBn4WKjQHqj6ADrA9YB+aOdOv4qTcHlBRUsAg2oydcPIAv4FT/SztXoC+oR
CAOsf1VEibTkor4ISAwIHy8c6xYGg/jkf8l3fQQBagNEe6EK4V8B02xGrDwXFusCeIHii00hVRj/ilAV
LME1BBAsAKIgBSFYLpD1IwbA71lezYXbHPCe7GU8SIvU+AG+JAACt6wCzhvQ2K85sEjRyUeAwNJnnwJB
WUFagkiLrMwB8Kkae4N9MdsgjsJ/iRUECbCBqAL4p05eg2yYVF0EjmyJz/4STXqNNkk5VSAPgyxNEC9I
0KyJEaGuHNiMiImnr8htCE+BX0FYMWeAZ3y4SDIlSBSD0gIvBTSHcBDrF59gIhocgKh3KiBYFJ+CYUA5
h63aoHoI73AN8tbX+45Df72LBAGn34nyRTWMb6696T3A2CYvlXB1gKwhPaQhaosx0o1JFwAgEVwBlIXB
qYgMLhOmZumAXXVgZNhYAFyDwNPuQeCjJW6dphSE0k5FbSIUG/Z908Kf3zCS6AChSAQQ2D146fFDWAH8
XSKaQejGWFqbrAMwlG1I4ISHgzWy23FC/0gcqIRiSEWSE4TrhkRNX3gVhJmhhEPhTykEE07EAS5EF4E6
fiAgj7yvwwfcSPwbuSenAFMQltNIfHzUi0C7SPVwqgt0k2BMGvePjUbdIOhJBuvYUf7JBgxViE8z3N+o
1eGOtUnx60M5wHXg0AHL6ElrxEwDcC8DBE31aIrhAca2YZPuw5GCSDMYIKBwncEnWwfUmyzK6wgQSAMY
2wbb70050CSOwnRCaeB06I0LXCqkd+CnegZpxc9Q49mLCk7qhI9UBLdPbG4DzGvAfgHYMxHQFY6JkPcF
ZCo4S4Ajots7/AudTQPTohDtdDnJOg/MVIVcoXAsR2wRAHAhs38II9dTBJZKKY6VgGFD+4VFx/qBWwkj
ZcrM/yMHIBDh2166SOKNh/GDvCSwHogVMZwkzOJC0MB5bRtMV8LCq7hyIVLCg5+KZjbtNS5a8Lio+KAZ
5aTnvgRsBU/bE3RRSIv/jaDNYy6qFA+J10DA7wQlbhT9RI1PMI13q/8JwVIuKsNG8eAxqoitBNBwLxhy
Ci5RILaqR/4R0Qjf3UGIeAGTjCdlgv6POct1rz8W1//falYvni5kZWJmx0AEdWfGQAioIQqpvUDaA0Ez
QmBUtAi3BDTxhdnSYEcAkXRZkuxgEBshqIjDcauDVE2DXo6a/V2vbhr2OGoBavnYmATNHAUhBmMVMHPS
CaBMhw3VpyQwehwZhcDJpAi6Y6kPiRTUdoUQwVXhrKmhEcLHRZrkr1ksFggltWfA7wUxTLaPvzCIWCBw
jlFciMNbO4t01bGIGXMYjwwQceBZzpBKXhZ0AwqNlEFXRIPFk+sN/g3QqB8oW2wHAFOJ8lgRDH/YKFgh
0VlXj9qDvMICiWepdWb1VuEQYQRSW1ZhwggLUM5cTSLAA7qHtIsNNwOORezIa7DQkF698ICNLpROAb2A
3AcdtlJnoC0iBFAMXumJG0UkPC10YJNndwMQQ4PO//15WOdYehBLDAMyOBgc9HbrFET/MhBBniy3gi9R
YUQzNJHVd+fEsd9h69Zp99bxRDtj9kaaEjuqr74RKKCTEXCKigLgwEGJMdIv6FoCli5xn881FnHroYn0
GtgGUzQXtG2Jar7tF4wMA7UEdEBTTEbCTwravU+B+kC1ddBmiwgNBTcI0IujCNBNDMKReprkaAIM8iFg
YAJe/u4xIO4iRXU8RddgJKtW+g+LLHAKgEMnTEiwWyDfGona1oIJPxuHjn9Ii6UxrAUp9+dRgVipQSnL
CZcqLlQcwCAxdELtqwhG6uWM8e4+0PACLvoFg4gAL+vWg4dByGKBimnThcGCNGlp7bCATFC1ZB/PqlRV
g4x9OKSiNxNIBaiCjSuaUE3y7QbXYFDAI0ROU4/whhNKgzwwp4xGSPmwTSL4SoscMNkRTZ2sCJ4qjdnS
+wtykJ5AGIuys9ABDQ8scE5zMB52QDUHIvTUIlWE33539QduDYYCH4XAUFB1Kv+KhXJUyY9Jjwg/mpfv
y4nhazwU7JPQeYxAjfhIi7Fu3SAVq4vLSr4zEMTC2zDQDAQxQnEzCzWiA/qzrYF0soPV/qA1i3K5iete
1IRH9SNfQcED2ggYROIJroiplQAEMD6cxEH6GHTGQiN0TPABdRANjhAXFwn84RXHLnYJgzvaglPAxzHg
0uKH6Bu1Q59OiRQzZoesnXWjM0rHXad1iLgKYnOb+eWf4Al8EV4W4rq0EIhRFKjd46AIEvQQAGxIpARu
0XQkSFRDqxWGrmlwePfofQvcbYA1TwIgzoPN/1CcnI19hAMhqAaImLEHlp14FBpoB3UmKBfVbA9IDygi
jweUJFAzjUku4gHIzBsLpHYwkhRorIsho4QnhD7qvrQTWkmJxKDdsMJsnfYB2aXpgnYie0k2jKsv6wGb
uegkH3SwSP4oYEcUzY17GyADvYMt24PuuWPMihh63MVII2G7AwT2bozKfqAVFbF76oW1eyPOQAIvDYbq
D28DFjqHaU8569yxGT3ewIT0VQPV///2R+B7BMDmli3sPgJgBA2LpfltEjD7omBKJgmCxKOIWG0ujgEE
K7qnfQhTxO0kArqWVTB5WFBsVOtRwkp7h1HsdfVZ7wKw9S3QoYbieJBcmxCfoN4USlL8g3fSwuIYSHWS
oyrGKQDUeyDEZkEIVx0gghJWKKAMQxgQA2ToiL+QPIkgbvJQXrgHHJCIEWlxXl9MyLFPCoigNTXETBLb
q6K1pPCmogOzF1pZNKRHGOkX5wUicQEA7kTeiGuw2SJAqU+EixDNAuCLCSvAj4Sp2AHo/FMQND2qSoGp
h1GIlwoFNvZLi3rxURElwpZSoBCBE1yYhgAqQSXb5x5QsZHXUxhXiAUX9Pd8oHkVkYKGGBA1ql2CZtcx
g/pKwINhNy5rMDzEtEXjAQ2NN2rRARDt8FvgOwPRUhMsHLBzIaDhgdAwhXSm8wQYQOCo1j2/iJrxVCQI
K8eJEAsnImV3nxUlRJiR6NL//0P3KAhB/J/EgExwLqJbCqTBggFitlSUiDzJf0AuEvipiJRBVkwlwG5F
RE4xyY1YROpTTZJBKVCrihjQuBwVR7WjGKJbSeiIH40U60yJsQNUKWwAhkUFZwkyVRXV76hBC7qRVFMI
+xgRHU0cIN9EfYTIFdV1NKNRuU3UGlrRYx+KEixjNVSjdCuwoIVQ2SdH1S1QBAAwmbSKE8CFLeu273sj
8SJ9FQE3QvYARhSnBRHRN2NYtGMtkh+PLy2KcmFIQ1NIHvh4DHZkXjwxw3UYNxOh4cnDbGxY5/9r2I8U
cHMBPE8CZKMYoYaPb/UC/QJsBABwZO5yKE2LEKWiNu9ACJvCrr0RLUwB6CMMiXDgN4SiNEwDkCR0qwOz
jAKojZhbgwATKp8DPTmK3GMJD0PzPg/qHm4BhjnwzAgU2GoTaBGtiFlkP0cR/Ep0G+pQKcOIj4h2HuuC
T+7Jw96AYwXru9mZV5AVsCEYkywPgIKGp0/MH/MBDdtxbsuJ1WcQjIhLFHQXf1tAiJJ3T1463gWCJRff
kEk+RHU7cZPM3SPRQwiDBSSoME1bQgJ6CLcxwG/Q7QvV3jsGchAERggWsKBZaGcfgQVyEBiRqEIWdDkH
7QWF4TL/VFDCu5rBit/9+gNkJCALF6g1PPV0HqZAHtlM8FH0S7XoBxtJOfR0ToKFqDh1gUWihwfOksOD
/N1TKopNH91MibJoCABxiE6nbPdbtoQNpxgBUoBWoslQVTfhdRrdjl0eOfUhdtyOaQhuAkVPgt/rzX/I
0AYGehW9whMq4qf08THAwN10E0VeRCtP5we+yFCggkTUfFEtygWrrRjRu22qU4iBxCr/dIrOGnTU7+FT
9FWUzfKLVgQK1yaq0rl2KFXBKSCWmwOYp+hWjYtDEnM4+GIcOFC9W+82CzYgOsUpJz0Fg4BPP/b6vqKH
ZIsWV81cPRGdaQkTkH1DSI3CRP0jBUkDbeK6JVcA+GkYT83i3dkkg3pJPjnad8tkG1SuKqUIfQerqLEd
W23HRitgWdEIANJPcIQfCw9yOGl3NrovPBFnOTZyLHcl9BC4HYMCzEIoE0EoYERHzjSfTML/xgJSNPMv
TyBeIftPHotGFDlHFDnvFjCgwTeQTzu6gVjVAllMFzHAA9QAAe8xRMQA4jZN1IWCXi9xBcv89a7QR/CI
1eqEywWUexhKuU2PhwI42yyrqgBJT6p0AXo6WsH6n0hU0AI8+qLvvvTWdjo0eBhyNAUgchPrLOruNoPf
EnchBSB2Gy0e2WuCGF858nKb1Fkd44toECiJ6SzZh7aGGlgEIAN1y6S6JtqXTIz5hQlnjYnCVEBXgd3a
haOLUsuLCD+FwG6OiJgfZUcTQW8zdarDnwrpFqKASQDPCloE0G5iakDEIx6THi1oC40RGCx6bPAmewbg
TDteTbygGOONINO5ICvKbHAFZWl/Lf37IpIV8ec+JLwBK5kYCDoqFBqqECh/ozVVmBGVaRTTYSBVNYDm
L7+/Y0EE4UUYOhJMWkABGqizSbRaWCCb6CAQneHuKg7w/UWJxZmp6ngB9KvKyKAagzUwSvDYeguWU1US
YAhEMxBiEFWAvOsMEgYbdlUY+ff4L0CVh3WiRDlAEHWcVISxqEbdJyWkallKvzvpV9utTY2HNywx21y5
F11X5EPiDLkDFEAUOmnI6AzNVwJH7M10CMV0QsJqBYhCdrq8f6KWZb4ouEzecCnGwA5PVHW4ARVmLS/M
2rBAqIobEOvaj6pgYXDrzA+D3W3fYTnGdg8HOGQgMcBHKQkNRBsAAZRHF7iQJICfq9dQJgJMEw5SFXVM
qHahlYzoegzqMIIiV99TqRPOCB37C2/Yo6Cu8Jps82wKBQ2LanqLVQCNCUzSJYv6CA/KVz8IfWfNEQtI
QBA3SJMKikVr1y4sanMPSEh+kHTmCOlPAhRLHKgVohDT8VdIQLIuZsKZTy02YTdFA1UBdyEdV1QHAt9W
le2BUlBVSYL8bh8UW0DGGVfowFvES7OD4H91SQnFUDVBtHMHcEG72algzkOIhjyDoYAL2/s/Ym28y0Vq
ubchatT3TwElNU0QRZgxcZO/BMQy2ltMV7FE2IF9D+0TkI8yJRPIQlwHyRX6FJCD5UA2MO9883ZgwIFj
D5bCTAnohNJ0YRtAcuiwQEQVsYFHvwNqFb9KU3RqfijJUUPYdWn+e0ZbnZsMX1QwjH+UzFuJwF/CWUQ0
EyP5X8sIKkQDA70hKhkN7YcjA3Zotk4BqRNPmzEKQvVcWw+3b89TEA+I9aGcJbSrJqtcvP8QX9/2Q6h6
ofR3SRkICqD5s+2iLECefA4MnzwPh95noKjcaChcDqrvjNYUQsrvdLzbZtsrDxWXdyoXOTb27B8Mdj2B
/wEfYZ/UR6wcUeu22BlHVoIFLA6+S7ZP6J7IUAcMTSSR7hnbGxOQzJ85FYqAbL+MSKB8MAQ7CJSDDdWf
LYfIR8YOBD+0dIP/BiAc9sjk7McDLsBXZytgtqwgfwch2A3JllACvHMyTQFuGbvxIXbrUh//DlCsJznZ
8qEMApCcTOspgBdtCJ8gY3aMsSZy7/MyAInAKmV1gkjbT46q2bOhvgFVXTIFdRkTBaYDqXeBZlMINHBD
2Ea6QPcBBAgDXO5dCAitwbfwNA6IBuF9MulTLxEwIYddKf8SMwTAsITZi5Nfx/tssLOBeR8EDkLHCGMF
EAfGGwyhlDD8rA8AF9tKxSsDW9ePVGCKBNeiMIBYqoLZOgAIARInqg8BX3wyAU80AMSpxlcy7QAxTBG4
iYieKgbvcBhchINqphSQ7gB3E8SzW4nHixJgu6bqkBRzGDadka/wYLyELZrM2g8fAJwlhIERt8aQJDBm
AHeRZ0MJJxcBNwkOnRgABITe/1nGYQwsK08IH2C0qgL7H4PtIsH2vbO2M7uA0EhkZy8Ef5mhQ2z3Lggg
dFTCFzeewAm/4HNTSQHBmbhVSwiMkxSQZ0mg0ke+J9D2+QISBaufEhgKQswQCbc2UzvGBrLp66hRxklR
vjEhgMORl/+MABZ6gwdVBVzVABBlcHZdFnUgeHMMigO0AG34cKoF4IDPfYIFUIkyIY5xqyj8fxhApew2
4R0gX/4kEIyNbKABCAEAVMYSfBZVqgGYfEHvBNAvKKRLkgoUtYjVo+5g1wgBHXVi8wwcHVIDRsHmnjSB
DUgUdMT3EByBYYMbMBB/6zFsG3sI//gbkgwIVXKwGLtAdPgSCLQHorq9Y8XlaxB2dp/uBN5MRFGJpQZW
HEWIQqkgpCYJwe5R1NG3nXxb7L8BMaRycxiLBO6D+BEPUJ8Leox3l0cKZOkFIi4fdal+EXWjB6BaC5GL
AVgvoIbdkHWVanoVxEsU7yh3jCrIUKqPplhsi8rQGVtQCFEuAgAdpVwDCNAxgG4VfgxuoobYg4locD6+
6AuxCxUsBguLhAl6BNCwUBEPhhhBPDDpf++YEbtox6I8i0eifDHACghSAC06/t7Cp8Aio0yDHAOKvYfN
Crkw6Q0nIiBgf+twRYXAIBvMEEPeOikAJocc1tA7eCEYEB1CsiKvMgnDJsxEw1McMYNsQrAgU9+nbALQ
kjj4TmhY2bk0iCoc2FAcK72l9hsYhACC4SJ4oMRIFa+mwjRiDMJAvbn4TxQcAdQByAnHX4iNAIaEHKhQ
UUyLQZpmEZYTKIbOQbEgB9pTWJW9MenBlNw9Pl1Bg37QY1iD1e5NcnZGEE0BO+2DEgfsIOCnrClEAU9Z
RITgIMfOwwbpoYCii6p4CAU8AI6Vxk4AIvMpEogoIkEccqyKIB2EHIuEshCTBilehMpSpGoGJIq5BsGJ
qg8hhg3WIHwMxQ/ZfhsoRQnBzKeWG1S2n1RBkKdsfjYKBBDdgEaER3U5dYEiR9wSlMGSUMRb3yyLlHOq
FmsLkJy/+dXe2wunJ4H9//kqKBI0EefQROgimAigcOEBMCGihTBs0Qt2FdJ4VUuAdS8YQbGmfQ93wGB8
kf8W1Xe/Grb0QTnJz/0YwZ7EJHpdpeG7I4zwAbxkpLxH/yIYbAIRHpABYNPAXx1GEOYCY1UPGEiPqVeB
wFWC8Rv/r2iYvTnCD4MSAU8BR/wpcONUi0dgSTRgRdEgTveCP4OoO9FJAwwk0FkFkeH/WIZU0GcgTCRA
b4CjYCOXx6ZBEeiByqnf+8BHC8Ctp0/GSwJjl8THIqzECm6iJHAx7YINIOsrBZueBIcDdRWiIAMwqDpC
9g9EnxTYAMBhOW+BAd6AFnhrjRztJ9EtNt92QRxNs1BFoNvwR2h8GAQs/3W8dAW22UmTWll54l+RO/jt
twNmR3Q8dpIGbnQHPQc3daBQkOxjdHWZSItwZQUkmm0Cf20QtdBD4ehN74kI1vtVqM53jjEEg4HaEfkP
oyPUg2DmR8GnDWvMQVDWCPgx4zK4LGaQkYhP2RFO+g9vQrQYj//QJHoA0C40qT80Fqy2It9Cjh0rA4AW
z1ixBRBLSDcFQ+Lx11VTJNboDABqQBNMBugUuD8FKLMCegDfFzOoeBLDslcYRhBvCfoSTMYksWkW8ADF
OABo56AYvyivfNauHpQCrhGt/D9njIQY2HaDg8Qh330QGixIvmQhMWAEy0jPQQyBoAqxAb8gwG+r/KNl
hU0dgldAukhM4oj9DB0uBv8irnWMxadjmIsdrsxHrdzfMbaDA648CFiNcAEPsMRAgopc74XdV8ik9T+r
zEUYRgZHd8Y03ZFPYVePTLThwhuQRyBCCzAEd/90OBgF4E5KkV5fwHsCTxWDfcSrDEZyEMFMGQ6NB49g
AwiUU46AYY/AhbBQdIJ9J0TwnWj8AYGrpLHmsGrvXNtgvMP97o7wgzgVr5BWLIXJYrCqaIQSfeKFPsgu
70F1jzkSZLKvWVAwwv+0pExrIhQUiKcSwA4aAItJyfZJVyqIR9e51I02LGCZvGXVQQOeALXrzT+qRfYs
MgQLkWFiuWfdBxgS5lNt+iSgXsIGeyhuLGZUYaJAb1fQlsCqDJNwtrgyHkKI+6pFlN4Hm0Ux//Qzi1zg
s6h4TmiNDZbgADSAaaiygAjPoNPsr/CrvWhgXgpGV1+vPPoIJYewRHYtMDXCLDZUrmzDYBxBHWYUP1dQ
0J0zKcI9q1yQtGThIsoJjgoJBbElpw73SRB79kQkeIWJBjpfIGWRrrkLRtQMm6mLN7poHap7gsoMioKX
7DQkdqbuIaqdqyOhb4F73rtfzA4y2atcyUgs6aWAo9kgBzEmnNmAtYAZD0gEIRQdgsVMSKE4EHyMqv5U
eFpSwn4THyityV+EYD8ELIgSiUYQI6KRLLp/HZGNgAgZwYoCUcRivCkE56iI8ICSGHROfWBPmASbABhA
CAcIDDLIEBggaXgMYiEqSFc1IT2KUFUQiC9gR7aSMPi6j/FlfSItkuxfi1UMQ1IjVttpDokEQDqy+hDm
IsBowz33Ra7zZudLxpTxq1ygZKTHX8D+6kQTRYX2LBvaGSYIZjZ1tWL2F7f+AVFfcAjpKDdEZaIKpTtW
ME+i4heJr2cdVjjOOjpIU0TCWUYuSfAtVYyCTkgrskoULwReNSU69yJgZCiisLg4RPSzSl6og1xRi1vy
HSoaw554CsDoCFC7MdKmFhEXcvAA+Mt0AgEDiysQIbgVZrAfR3cgwihowejrsg5dELGPue8O7gkYGfgB
lLJh5bAUz0F+sgR+NbIcOJDB6Fbeg/6wK8EowhkQiDfLyEQE7q+IwKOA0RpVCggEEH98BYG7oGmNBBh2
LqODAHavfJqxyWhmAqdfl6EZDdKxhk++l1AhhDFs9hidq/U1JhA3n7e80WD0YWqvfkTLRehYxJ7MrIDX
ukw61GAjz8r4APAyfBauClh/X47ohF8w/2J4AZ6wII4xIf3RjaxRM+rOo1aGdu+CMQK6H53h1hAQk4IR
pblc1V8w6kMZkrWhSZJqi3Id2r5ZqKk+dX4YFcH4GsYEoXgsIsd2PVOE+AIElRh2KetflLnAxGltMCrV
7vf4cwwodwYFIHdXRwfdIuo52u9Ywh77yeC3dDQ7Q+gPghE5Q/COt2gvLgkVVwhFB3J2sE9mt2tn6xhE
0wDwuzt2Ei7odww0dgbqSUAfydyAteEAtU2KVQmEHjoqMOsU4A7uCUvQEAacYAV32I6ggUMQOLMYW9UJ
UXAztTtwQhhmumg7Mjg6BcmqXSBTEJFt2oJQfqVCxnJwX/UAVmHWdj6IOBZV/FWbF+swb9EArFqfMKuo
BSs+U2SASByXIWww7mqNU8JzGImijQdRtEnqUGQgyNXDqkhHw3VLHwSjVRXKADBJDcYYXbRNfN43VrCp
U+sjR013GGALRVX3wCRhNCEby3gBSXJDviDASUMIcAXBiqBYNzAmsEnveantbw2awWzXuotgQBGxJxQU
t7M7aEcAM2w8ObVKI0GRoCtCuVTIqIIIj7ooGEiy/Md1gmaz8hCviaJFNeLoDi1gaSBwOEhnMygDIMcz
QbeM+okMoF1BeXg0vjRg4kF15my8JIbtIl45KAFXcg+I0B0B0SgQc0BCsMOCjCwYFN8YMKA4IAFexyfg
FYe2qorEESJHbXW81AoSzYImfBXUFhMC124Ct2abTPpauEsnfxQ2DCiCABV1ImJQBPAAwFVkr+xwJDyY
FIKYLQHRpoiYKOmJ2oo3iYgwXg/HMkvHxJXcxE/4tVwYsCcQFkAAFbOLuCRa4ehfRDdK2BM+VjUByf/Q
mxQHafgLEv8wuELQVnVTnS90e7w4wBgQDdFye41ErNQAZEnYCqBQRHpm5XX8EHUDFy0C12wkIGICk1De
xQjAj6qH1fbFAo+Ll4AHHPR8LQE/Kv4WlFUtAC9NiexhYLCRvsIhQ25Ew+CjjmnAAoAJScKSUpKQOAgF
LNkwAV9gE0a8OAEmQA+DDDLIEFAYWAwyyCAgYCii4gmDaPqabCLFQ8Ghu3x2OqlmFzpIjYHErEPoJCJ8
x+vIAJxQvASRnujgjNoDZbR7jwJSEN0evRna7GCVIfWSmmwO2AMbtldPvlUvkiGsC1G8J7aOxAAZwJd0
Bzo3hP8sjXL/SIs1NzLEJzBsEFnImaq8WNTYgx+8KMcmIMJHogDITAOEnYA3GYq4zMePgDlVLYB2Hgju
H3uLOPOgSSnxRMqAPgAVLLpmCIkRJ0eEKlUm56yqAQUFr7mnS0UY578Bxv0qdwx+akk51bwxPg0E3wHm
QjG1owyaFN8x9pcgU34ERUtq/3ZnRwabMsCsgH0Rv6BnFOETi7TwerwfCFQlg+YCWdT3MTDnSFlICjCq
DTu++kEJrxSRA5k1wj1sEoLeSRoRm7zpYDXSSC+8kb6cNQGzZuloj0jJGoZo0llcUI0hCBYWpMOY+AGK
dFqoA5u4eKh4Ew17UHRxTKFpSK/9mpUcaUgmXnqNVQGWBBwv1o4FFCQotTHghjgkmFwkWKfkIyHZm7wH
RgSLjPFsU0TeOAi1uuWxsg4B4H0MInIQtqwB1TPqAEK+UGC4BcLX6N3ZPeESTfq9RkSLjdB1uIGDVdEl
FNjYDMFRw+4YdEMudD6EDYd/RkMpZDFjCM0YHekE644r69lyUkWgerpb6eZuFxkc7xKHFbb0knbfsLsv
xkS4V8+sgDAteuuQHZDdLLk6ieumIklM0pR04FjApyfczAOMDznKdLqB4Em3CUAIvgGWSSk0tWDH1b6O
GQhxD8EJJwSPAif4ITU6FGtnb1S5LsLCAzB5KHYpV8BHqSvYePUbwpIRBxOfHx4GQQxUOdGMdXCfy8e2
K6crttKvjCc2vZbTNP0AANQ3ISBT2Mc9GAEPYbxGw73Lv3jH6oAblEFzKFFh7B6hDUzC+CO7ZO6Jb4Eo
WTgV3t2ScLgPVi4BK8PiqoONsci+a7sjYgVEDBzPOMhZuy2LvFT/g7yaCvpNuQ7HLVZCQgWJinj/pKh4
ckBIAGywSEUManeIJ1oYSS4IImY9YxZMt4Msw/PZkMmIunMAHgcMruDBfA8t4H787Mc5yDbBjRrCDjwM
x8E08RDEhoHyLQ+HMPa7UVj/4jI8AiNcGb/H/rXDsjwDDXg8BM/CPPnDJtswvAu/fA5cz9iFuU0wSAHS
Hry0nlGHcOKl4ErHoBMkiSDkv6Q7YYYFO5xMTkCRNhWESYu0UZwwNEMByRp1PXx3QKxI9/YSROPIA2Ku
ygzNPfyEOoNlMCgzTJpyFZ3gRK1eJ0WRAH4wmSx2rNQMQZo2uP9kbYsE8B0pyHr3FhWbfS5ZeXh3ifx4
6sQLWHffXbAAFKXehgLQK7oIOBaJKDCiwgEZH3vFn0Bwg+0BdfNGPoowWRQfhMtuhRmUvzrFizHSmxRV
wI31kncg3yeJ1jHSlvf3HMONKFK8FlwB8FoLh2eI16wfGNICBmEIIh9BeAhBaIb/IBtYWqRaxkjeiv8B
7BZGj66/32CXCoYLTO4BGmInZnB8Kgkfh6gIjZ34CjQQmoQ4Qwj7mn2sGbdNQoA4AAjBILgjTMHrEIcl
gRAGH+5gD7ghK3v2bMx3wZZ9SInFDAlwgDgvcSSoCb4pxw+s2sQgv0BAx0zpkPiDxK58JFBIicW7w4pw
jgUt6QShiGaK4ETic1ALUsarxBtRS7coqXwoAfqIgEHjuFCQBruQYYw8TEaksoZ0PAG4fDiwtyZpsIo9
ARCJDRMm9SMyry6D4iBEgLzZPYtsxKMYA+IwFzCKL0Le3OoicQBgWCexiWg7BYvcx8N0SBURr//PILYJ
EQYU/pPMFAyAZTmNqD1IVekNjdI8KEOck1jvAv3OGCyrRR84Pcb4wBOnWHdpVvBLDthlzPgLAAEJRcOA
CHvLAT4LinUFSBtpDYIXENgFA4bVx1ZgNlCq9R89VVCQYExopXoQbATb9xdWl9UHKVjAB7tWl8pdR7OO
iZS7CX1lYjWjxwwIEAyCww5AfULAvHr96zfoFkAP71MKVFXVGBQO+Z5UwKJJNGn2Osi2hoJ9xt1Ii0Nc
yI7bvrkWHLDpo7FDGEiLM8gEcPO6FCGisTA18eVhwCCMWUy6VOYuCB3ASMEc2iuq4EAAr4igCRN04hCE
CNBfLqWqkahIh2Uww6bsMNsgWSgqBmPBBBAeRXRrODoLgEX98A0CVDRMSQ8g/b4H9AloWQlwLLPj0BXh
QLEMz7huGHRGkxjNdSx4d4KUnGaynF5f+whnAdB7YBqPT0CEESzGU0H8sLjhTY1e0lwkSBTE/Y1FWRwB
HMsec11xiWWxewTCHcMbcP/sYfE0Tj1HwsP4gxTFpiBdQoVYfAsfsUifA4AmpprALHjnJYQywyIUkFoR
Jgv6vZDwweZFuoP/gxX0AHcmCXJBbizoHHcq+kcDBoGBQvR8mRURB4OfuAEBpKCExP+FimEBTzKGF5yq
T8G6kiI6QdHIwksJqAHkt3Mp7iC6YMSAUwAc6xQ2qJOITxxTLQV9BSKGGjiKjgCaVFJXJvEiepVNPSaC
dhAUtPB0y4iBQUWpT/akeIiN5yX/1SEGMCFCVr8K3sEOidCygezfOhgFkc1giYRcDAQICU9EBIIHxgKX
R1GnA9svEjAEqH6NFS4XAQDlnEHdB/FwNtD9MIWBeARAFQWkCCFOSYSCBhafFPHNKGhMb4vgNtiGSCAF
yZEugDqbggADiGuY0rcKOAZEx428gIgQx/SNrFJNVkERyVogUgwYFI1IPkazCkqBkiEiQRxYD7gCBmIk
Ax+xEMH+PUg5xnPOf0iLWahBCoLOxfAy2CFMLl34D8CYsAgOAAGWEBhSBAwD6KQhRQQa62UDEjM4iaPX
zjrAsIABWsjeOAngIsXSlqJcJBQAxwDGIUXXzeEQIhSM0zksWIo96KaGKu2KJRD4CK4KWw22HwG5DAJP
MTe0tIwoKsIgeIyIGDtBXHEpxvAUwqGgm4zz8FYgsYsd7DuIEQNei4wHUYzYVdDIibTsAbFtNgcPMDaO
epGbQGj9tKiAwWAnaGABgw321Q+gJ6ixhZ+a9Kx0WJAelBJfhQlEW0ymgyQpqtjDASI8os0oNm3rCQ8X
j2y3hI8KdesUdalELPJQ4QFWVhGeQIXOmYrPoIEED5wkAENtSA+YNJUYTQ8IQKzq2r54l+VkdMCKms4B
KDJEBaM45SBE0IJQWcaIQboHOEDYRVAfitgqKxFVCAbrglVIHCgkWBhskMEHYGg0EO2J3DN2VVATqUET
oV0HAYoUBxxIySAS0QUnSBFwQSwMAq06KBW5O2mkQCccu+XUkIuECFD/zkzOeGJYO8ACBUAUPBDEB/e0
3RCKYM5a/NBbjJjU1ovC5w5Iwy8IBBUd0UBbSVtRJy8CMnsmQM9g0coECyLVD/oL5VshIHUDwRX1hf6D
sQBcEH3gFCWjD4CWPBZcKCJYAtuLrAG3KGaXSzHtirOKnscDTHfneXZTPZgPjXBIQjushIoBHHLZ7iL1
SkIkd3OEhn1nbsarJpJMfNZDRBWcz8HjBc6CYEXuTIiS4kYQCSQx9iM1wjJih4A2VQ6chhAVcu3AMA4B
p+/N0LAHF+hTEhN4rGAIveecJECKClHKxfqiUUClMJeD1A0hXZNwojgMMshgD3hAgCEFrINIARn62GcF
pOJrhCSYD5SwPinqhCSgAkhBqprqh9YH6UAaqeeY0HxmRSly0KoVcAYBwfxnOE1ogln+awNbj6prFf8Y
RPyAdgCAWDERjRwAVIV9kJL4MFbxKDTPBEURxkhCu0vyw8miwxgN6aXvE4jZYSaUNh0gHqxhLgDGdKcK
eOlfpA9mkEWJLN6GRN4EBDhsrKjvv0nZYNdUxaXbYdAJi5rNCntetqcWi1iEZoJ5MDvrGevxum/uGkOC
6Ae6zgGgVzuYVcsGk8OZLkbLYiAAJvYtGcOa9Mxdi4x7+rVLDlhN3vbOa1hN8pCcRsXe+WSzKGImwgYE
oeC+iFpYuGrAS0wTsiZqCABlrQpmXQuhGI5oD9ZWgLEdYDsScKktSZwNeAeACCUzAjdSsmgIGLmngGgI
ingIaOwDQAgAAiZAnDxnJ4oLSBBQtyB08hhYUAlgdV1ELBSETpV1qm2E6AnrRO/RKRFHwJGJDTDQOAKC
HMAJX/WaOkjBw+3ObS5aGzuKwzL1XD6DwQC7We0g68AbjxfRT0AsIFhvL/QDwENrQfSJ1kQxIH5BNYnL
tBG4KtHFTUQENBK/uvUCoep4fNLx9WXFY4XeRTGjRQh0ZWjwoINEZFQAcT7XVMZLNzGICEBbyMOIYKHq
IjTE4fg6AikLx27YGruhqIO/98yLfQhigLsFEILryq9lqIoTd1TBTtYFx6Un664/MDPmYh8TH4tEgBPA
WUGInx9MAAbA7FpTEJCICADERxsSSJ1bw89I/gGHhhRR0wFWNaCD1ffXjI+iYsFdBB0Z0XSLApZ2r/bo
TYt6A6jt4zh0IJ8EISoGChKieAcRM4hy/4jwGxBVlsrmTo1kPRGpyhUJ2lM0SRVf5geAv3DVRNdO4341
LkVgKnDhdCwMgYMK2zmoQRXHZXQdH5UK2qLuC1+tbleaX/BbiFNe8Me/BYWDSWSFTDssJHK2FNSrqloZ
8KOICvdedCiluYAYYUO3pwG4NdifNqDlc0ckQMFGMB36SwtUioyErQGFJCp2Fb0kWKdNKamiBpZQJLHF
5DQFdBRy1IwYi6CABPKnA+6EuIs0JDH6O4uG9AJE7gH2SAHbKmBU3R7rvd/owhhfzLXw9P+3U+mdMAAK
VatjPrYCqnTBKHkNDwLVsXDXi0YCMCzejsHdMcAR4ryE2dbkNYWg8rbYJqDlvZgGT/LXEnafUYWIBusZ
f+mss6Wos4U2jPddN8L25SwPuCeOFLwR5nQLqMFMhNrE+bptD4Hq+b3l3Na1iMMe7FIOfDHALKQg3gZe
SnWTISCFsCAA74uNhxhmlZZFbQIaQRaLOHYN7AMAbUGHyNX9d7JZEKevVIuNDjC4AOp1adsCH1hA1Oji
RAAA2F3RYCe5ynTZiS4EFCGIMwVxAVpbves33Ks9CGcF2ZKbTxXUHXYILIrpfsZud1lEXxG1icow2s2S
nagmiizWozoAAanfiC9VD4oQ4o1V6EQSHk5Wl/ye0cY2FQ8FXEtNHrIPKEXfVNpZgBkbwcjoQ9WxEaX2
RV+ET20TG9BwV3Z/b3coA+q4BMtvMGc9RzhSRzegg63XT89Xkl9YRO1GtEwYmm9oA9TH2Br4MHh7ibeA
AAqKkVSt9oBVzZ+gVTHAERSzLynvh7gAJkDwkWtIDUlduiNBe1kLL0YQCtCkOWlOGNgg4E6ak+Yo6DDw
OJYmO2n4QG9VlYfuYrGKdIR4g8cQiMJb8AykTlhmX/BUdYmA7xYyISjA/f43jRV6MQY19BQDiaK2iQKN
ukgr5PaQIW9PnzJyIE/RFqQKIRMgF6a0CTlyMuJUBAEqbqWSVm8CVd4o+qtW5XYMCw+WwEhUkah3xFHF
GuvDkC9WJgOuCmomr+go4IMCcMwQdQXx5dtAg43x1ul1KYufkNF1blOC6Bij1K8qh9DCNVFh//CAplsB
MZ5S74xQK4aCsepd2Lp/HEYxIgTpIInQc5/uYrdqBJHf66b/AbchAmX+IpULBPFD99xsUtkHYwSyIui2
WA30JA9dIRmyS9cQD52SIRmSh3FbGZIhGUUwG4UckiEG8RXJkAzJ3MeyDMmQDJ2Ic5AMyZBfS8mQDMk3
Iw+G5EIO+xTo1ciGbEgzP6AfZEiGbIwPeGSGZEiGUDwoYwxkSDQ+EYe7VR873bgNRZs7z+hQRLGAL1dI
YK5DFDfsB4MMMshYYGhwAMXJIHiXy4LqnV+XZ5+wwV7Yl5APVxA3KAdBBhlkIBg4cqRXkDC893wUeY4c
OYkS+ixcErcCBskLXoy7lxCQHw/eRFR9FGGkCEhLp0cPDDLINgdQWGAyyCCDaHB4FkKbcIcPBw822AvZ
D5BHEDcoB8gggwwgGDjISQgyMA9sE+Q5cuR5EQotTBF7YUcgL06LVTVwBS2C+EGKjoq6K9/KECIowobA
uQfBNYnuX1p/g/p/fyvpHEzvWrYNAKbT4gXT6wTR7Tdb2XUkTAkmwQdRVWI7dSp+NF0KKLZnXUcog+GL
TQC9P/lGddO0isDuCb6bw00TtQlgGNP2b+TI9RAGLHgNid8xwLshqAVWSAccz0wBMGdMlBBIdEsGCkzr
sa8XCrQY0UHYPAzdD18C1kyLHv7iHImPDSJMUbisiAAiahSslFzRBBCtDOgWs/3hb0GD4nCA+iAS4Ux2
NgpAoS+f7eJMCFDgXDB1K01gqmhQPeKtHsBFUAXjr2tU/EDPhNJ06XsqjzGyexB04bG1iYjSDf8PyTcG
QOcrv3pCuIyA3w8FDhhRkG8FYUagkc5Tshh3VKVQEITPWcYqARO0hrGHDznTrqibC+wNpgpoNwze+XCp
6qN/meJFawpgYRCO9usq59Th5MsLWwHXBe7n8nUt4Mm6KDIJQTSRi1VRtFSCAsdCNg8ZAi4A0VQB/XVJ
OLaj+MOInVwR8O2YnG0MB50YVeA0Ak5CBG9TAqYGgoHWgEeRs4DB38SvUWKw5MiTabUO1iki3GZAP08E
Qc9CQH4/vLaQD0ljD7ktFQ1+KxP8SwFFF8YYTPNFvHkvimaHUIfRJxtE1BnAK1Fg1+jhBkHw0+cNY4C6
292hCfgueNj6QHQNbV9RMx/t0EwOsq0Oi2uPArC/gDnWVFWXh890ECmb9ORd5Q0PzwYbOXv/L5J0/w2H
bMtOKC9hPj9OTp5nMfUPHIOEoNpUQE/ZPKm/jIYfDl+APWanIfqL4FKtD/JjpyE3kS4UDTs9pKYdYQiq
5Sn7xvdCRd0FOyABK4gFMQkMQgcjb4nlTfyKBUATSdV4uDngkbh1Wkn9hGf29KNgq2Pe3kAQYEf6PVtp
ioyEWePUJRByFdFB/3wEuoBgcMz7xwSWXnfk3BtxisOax1ZLELCfho9WFwA3GhruidmUC9CEE+uET/6Y
o4JDAceTGQA96B/TpepiSWJHnizf7wIcpNdy5vbXkDdBy4LgUOvJDyfkCbvb67kPMOupOOsTtpSQmZ+J
DyAFC4INjeOs/5ADixUFDxC9FoSYhKQSv0IObBI+D4g7sAhAU09wDyEZkiFoYE1AFJBY94RGguAYXc4M
bwoMjsAxV2wmya4KnTACYJCOLwTLOEDqJtiIqBav14SmkQBHzNUO20rwDC4FJUBAFv/gEWNlFN99McaI
EGh3IlFQqqIJ0rAN37AFkwHtXRnAJWvVwyNyNhg/CXKKPVZDgCG+Xy8qOAAH9KnEiQ5b7c5pKLe3t4dw
+5jfbmA8AWdbJXJsGbh0aCZvmYMWJAgzUpjo6ZGCA+u1nz3Uo48heSEPyqNYDrIFecipo5+jP5IcyZBM
iDJnioohk12KisJCf6QgKBHQsvwg2P2274K9PQRDui0hoN1DkosITW5794AgGSPvggYEnT1+bkXRKsf3
XgJEPPA3SF4EiEEYRIAPFhI7jnHqfFbcDaesgw8hb4tmBMYIMB77I3FwPK3olHZoPEAJNDxQJoKexwdk
PDDqzDBEdrgxqa8EC/sJiacCLyODEQCJD4jyB39G/ODfngdNAdw8EHWlLgRNzHJhv/CA+//AIXQkidjD
TO32iFKXK0EI/YHiINB5EJrnBNcGBI4diYGnqgrnzdJD4PaTre4itee0h8nJgU1ZL3edIycHyL4pGmki
JScnbY6oB8NBJ+v/q3ABFltsUMXr5Dj4A3pncTvnZEluDjgo15fiDgoz0+ZNX9PvsNjQFjf4Jwn0N7Eq
IFkylUxsVWNTB9FBcuLI7o0273XEm42AJgnYSHDANdEG/yGbxmgVDZDhAAIidob5D2QPBA6HLayB32MP
x9XC2diwRMi0Tc1FzpgNQsR5x/onGlGvKLFdu3+7Ju/AoNPgxZhJCcQreNkBwsVws2jMIAr2ABF/xG2V
sBKOJ+uf+G4nAErsEwH0EucVEIwoBxoDow3ARwh0xo1gtIMx67x4y3LUCEZ4zHhqNGAfFOeMTfB8PRrd
pZQPiR8fhEeLIzyjB0dBf0sUCF+MQMEBhQU/IMOH2CVLRIEo6itVNCBEPgwCpg8yWiIXWA5BMm0w2tof
W28yK99/A0YLSNwv86bpME0K1gxGM8D6NWpwkaDBVVwQjkpQuUeMM97DsPfFdb7pMXOmF3SIp1gQpSZo
LWr3PoTP0HR0WShQ/+kIX4lEmkGlTWNahZE8dAnDldqiLGvEttNL2N0g9klQLTOs9r9TC7+gzepmYPjD
0AUPMwsujAh9CAeEjlieBlYsBFiBJbTkLR9WPz2pYAA43u1uCsa6uAx5CH7PDU9FmYr4Z0HKtAgB37Ts
/GaDfvkKKQoHBBDZKBr7v41lsOsWgflQ5XRkMxRQLPyGCEE5Xhh2Wr7LVYCCIPtoArozUZkO0YsKFTuI
OrLNwEkDome7EMZ6KBl3OWMBgIaCl5/xaW3dsH+WxkAg8nS0SyEIsn2FmypaLlQOd6ZOewCi6+10K/Qn
rIsYiqagWhWFxGhgUAwQPcBus6hPGjHAFztz0B2LcoQ25UhSi0MBrao/tvd7QjsArObM/exoF723XUSh
TbAYSgjpEO9YdAXgHV2/AgYCD2DHPS/ZuugzmzwnJ93EHt+gCecioyqGT/YgAVGyAe7+DOFijMN6j4fu
YcnyabgZOUKP/u6Mf4+EI7QKjTHbj+6kIXlAJO34R45saBBwbhwvAZ8GnJwNCY9PHhB51zAA4Y9sUy9j
1Qh0qZohgdRkKLcnBHQ3n9jwVIoVuNZr4YKP7e0GVe22me5zbDN1yzICaggD7gei22IQOFoYcokViyUU
sQR8QAGsEhdPYGGxLxF6yfB+MPYVMhu0C3WLOCmq4sWBN+kTMhR0Py89QVFMngbohQjlwfgFOnqxbdHB
5mb3AnU7DyheAEKLVciDcLsnUfOJwWbSkdY+FQYIOvRNuN5ew6txWLgtEA3qjmww3e+GAcpIA03ADcxt
73Ajx04SB2l5p4oaO4mTUJEFc+9dh7YHsfvGQhgDGf9zCBoEiK3qDBu2QqLbgWB2QigG3hkwFXXRdAMx
M/cyUlA9NB3H8vHz9O+u6E4Ek40EDxDyAYs5WxQ4Qrnx3HXzg1XMVdTn/ToQ2iFpE1R5BVQYgBKgHEXv
Uvl0CpAhRRtFOCK3QTUDxyhWU/NjvA3BYpC4EUkCh0EjioAF3fIMJguPQRULtB6/42KBN9hd0+1f63Ut
ytxslww+d8FbNDnIVy0YLMGoETQs6Aj8gsiPM3i0zABHGItH/X3+AO8ZQwD+hEXJiACVRB8PDGF/6sMv
BNJwQIoB334ELgy4ZI9xOaPSMcAfmhQFv1tIYiie9J9PBoPOvKIJ3MvJeUlcEhBySSa+cxW1K/8rSv9F
ichQiq8M48l41mW6hVl040mGHeAXTBATbiUcbFosCyLUxLbwCnBKvsy4Bwn3JL70BFi+JA/CQKaEH18p
lBO2A+F+XFsBs8NbJI6w4cp1xgnXdltw/woYoY5wIf1bMhj//IAIv0pbSYH8/gnEF/8L8vUlRIhiMgBB
mrYLtXp6TSnwnULLQkhYLyjbxc3wYJFjmvTiQVPqgrnDGlHjDL7j0eYWoCrj4ALrNisuQLB1JrLEcC0Y
2/vaZI4/2ojHYak33CY2xxh7o7gF/HXalS8NRqvkyLH82lcXyfsNgmpy05Pz+Lu41cEldZZMolIDNoPq
KOq7u0LcOHcRctJLYwyUxWDUdLeFAXcXMKjo27912DpH1QJg636IShjr4S8w4lCIaHvbFtFa0CnxFBul
ii4UkzByGpONgI7VgPl097FMdqsKtklUj3n/4T6mhUxfGeui41yc8bMOKGgFTh7dOXLkyNT9aPtpFuv6
1gCJ5Bz/dEI5ORk5CPslNqgaeygZBA3IFS3xw2AHR5o9Gi26MSaIaEehTZq9QgKfI9U+eHDgIfby9tE+
so1sDkCOCFBLgPkwe3byRZlBFNyL+pklAT4brGsO+gD27oIghJnKyesgY4kLMSdDWP962/TQ0sjSgOPb
aNkPdEEt+E3p29dzZ8eIQOIiDRxuHUarhCef+UspnW4cO4Dj0fVMBsv/kLWKILZj6Q5EI0eenF/DvPnd
FD9nRwkjd6svQlCeJycneZr8+HQsBJFI8wwWAH8tYRDc9XxNZ3aXtvqE9nkDdAlbSiCm9DWMsSaCY3Jj
vA9p5GzyFfljmGkwduzhImPvBPVFiwuxGIUCSwgMwQWgCJrryExkcJ2GSbrDn65grFtxdHnI5XoD0sK3
0wI503VorOnzf8LY2InHbEpNYwhlI0eeHQy+3/pW+HdHCc+RE9n3XWXJnJzFoHGnQhMkjTKInJZpPCTx
CA+NRgROSESL3yPRQDbI00k5xPn5G+hMRcNtMHt0Edh0SxQHyAw3iwOE3kC46D9ITInI93CLFgGjcIne
GhkgV5Vbm4gGGoIa/k7w1u14LDLBdcT0TRhvoIqiL6i3c0kB3Ez31woEj3yEEp5cLPYBf998KB0aZ65u
KVz3NLCOHIAmVdDdfTFtRahJm8SG4IU5TaB1m7hJCCDXAWEHCTNEhVj/ZwpHOPix21wHdQMviUdU+IOG
GISiLwzzbpHie/8VZlcFTZhQm6PtZt6cGwxZmAh4t1IpE1WQtqBm7ZueGTz/dEXMnADFYi61n5iBfG/P
dDA4kHQiwhm67sW6RMgmI4oomqAcItXBfPkcP5UNH90RnD3/j6n0vZ6jHT2jPp/6hJgghZ8viPr5FRGF
0HM0z6JCJoDB2p+fodggzA7jGBsQ/xtvBBh17spgCHfsTDtgEHNHwQJbr1jrBscso1KuWli7qjH6EfRn
bwGAiAJGfzw1kf0AATZgAJuWQVwXOS36EnJyUjPN/dFUQQcvL9JSsKGAcJFTQYS6apQjee19sBo2NCBo
H3WgdqgCVKOquwgI+LPqZcgXOeV2LkFEcFEUiHilhYAKQWep+AZUg4UfVnXIiwbVz93ojiqbJDMpNnfS
+qgqVwIl+EutBIJfAfNCCwAcmLWZoG+i6pbHP5fAQSDHAZfYWFeJ4Umi64/VAhoCj6mQKp5tmlxz649P
sdAKEBaxx7h4uBuG1eq4db4VZwZUmwLqTxhvoGJCLQxc0XQktoX4Qf2OuWmpuYB6uQP4Kg1AmXpjFLmU
BFBJiL+2CEcYe0SJyrTyhPjB/3OS/bi0/8ysDZ95/6IInYqubRpWHDlygfb48xkPgmHFplr/8wB/BaYI
CvSAakOsrH66+9+qENQxxwIAfQURYiEJcC4Q1INCiahqdrLKpC858yhL9TGA5n7/ifqs01CF+KjixdIX
EqJUQ+za0S72FswQ7Wl6BExjeYmE7AIPRIukIq6sQKOaAw7gXOZnmtMqlWjDhaWabZh7kOuSRqYIboXT
52J8iK2pqgMqePuGHaz4OMY0//bAAM5A5E6pvDhCV3Raxf9sVPL0I2xFElr/8lqu7MFBiA2O/DT/KYCo
JPAC9ccAAnJWjymU6k2GWLsM9Mf8D0kBBXh8cGbmGx2oD3QdG7q0Q7hPe+JjFNQ6uwQKPXCWSuCict3/
q8HHJdcnJSk53xj76AqwFUXYV++4KoKO9mAPgqjYBRVBGN6AeABAzRUmceAGdBe7GW3IHWRMKeMaruIr
KC5MgMYE+sCJeBb7Is8NG9+JqFFv67VjcsmOfAwEgYsLL1GxZDe/D7coDwFGiFVxUDG7ErABUX5R+HBF
kAvc6EF0l1hh/iku6SO8AJeHE1+i+elNQquOATr9ZPymw+7OMsL+KEg501W1Vw2iMnyxEjqCxTZ2v+kw
c6453GAuqnhv+CUALDI+rSalMNwAo1OlFqVhgSpc1GNq5MItWRw782sMjvDkgggtOa8LbpyMnLnFLmx3
X7qCgJyAz2lOTkbGKRJ0NVZ9TUNAvpiQDMSemYBYn/87a/ILUJWMB//vQRuQYzv6Co3H88EMjn9doKbY
TQ8eDTQPbggn8ZeDFhXz2FUxiMHr/jvk4N0LBpGK2mDdRXsEDruLTZgnRRBFMcAmdisiN0gCSBkudfA1
YkEvSOnphlFPii7G/gAnCtABIZ/XU/AKwxugC429sO2Ehn4flkgSyI2oDYt1igSUiN2NoAq5RPcMgCNa
DUjWqlRbON9HTFtgoxVl6lZI6rMFml5gk8BJI5beCB9TRLWAvqBybkBwI2gvd8fBSYShlpZghjzwNkE1
0BCXyHXg//7xQiU/PIAqDwo8wAcRZzxAYO+xIyKIeUSIhYt4irWYgesOBhy1EFWAcVBoiU0QT3bkm7bR
Emcqhi0rGtSrAhh1RInAv/+IQHGsZ0Cq9k8UwRaQU8QX8AqKI7QCHJE4DAcAZevH0W5XCzzUfzImF+IW
AZcF/9a6sOSioFlfTDBGG0tWL9X3sMRYEfUgAgIYnOMjlsCwUwS/PUaHO1GPY+pWDZvtH0jBWe8IcDUV
7U+IFAZcZ5WYIwglcPwtOhUaQb1YEHggnmqhqtdm74gsJNUuRroL7yyCFPAQASGHDlJ9EHhwGInwFgIQ
popwA3wdRXkWDHaqooMLL5XAS8Ds4ewPr0LhZBsBs8KWlZDVyMWELZpMvbYzUIK62n0EBkcMhYxMtwMl
BXbD3utFDx+/QgWLrOkSYG9OrwQkRkMJAlbxmE0Ft2XwGBQVEiS/I0IIIy/kLwIDxq42LxQgL/ePoHDa
SC/OOce0hVGi8TMw/Y58ZDPGg+a/6TBmLodCToR/ICkablDIRSAxCrkI5BlHQZATgRwY5BOtPQJroTB/
vygqYRR46zTWyTgQKwUQ2KLgQFM+nUJQEThgEujhUpSBHZ2JEOcJ8kAmrDmQsWKCNKQ5ofkWSbFgDbBA
D25NCIpkJsHNXNToiFP4gR0Qpeh7ym0TEFaJYoFTwAZZz9kqhjEVwCiUEKzXlxYgbHEfEpCPSBeB0SiP
OY+AUNlRHH8YfH2TroA1kJK/mAkYW4XvQ3+DIWupxvCPksMAGtkIfxyMKmeKg0tgCFMXWyANvowwHeGs
XsViR0r4B4NggmrojQf+MJQNWRfsh5CjsE6AfxdcD0JQiIRSf6OI+jCygH8VQooWdcnveeFLgMdelZdz
f0wJygFm/0BGAhscSTn3V0ZBpIvFjH3BtpvKDr93LSsRzm8dAnkBEc4gSQagOhXTkJYAw2Fv1hnwKlCz
wQiH3yeCFyhwrjj/idCARkUSlREQTAKW7dzsrCDhgo8VvT0KPS4RvHAsV9IE1iWA7HAEH1UBjqiZoolu
onS6i1AE/10egRVIuh8UzxEYh0Aa3x8KGQp5FpJkCOQFFu8WDCNoBHIZpo8Iwt1vBCgOTAkJdW3S6oRd
SMNlHC/DkGQUwa4CuBhfAf+oiorHQvgD1A1VPA3CEiB16F8KCFdGSpDHhIKIdlbEIAF8iQvBzRGv8hsk
QHXAIBgsguMRD8FZyYat/4fGpUBihA+fW5J6BOGblrDIIQzcSAKt4kdbRiKp5njxH6NPSMQnXYt9CInw
T0u1YCMNsbqrxOyxjwBZHAU8UBXbPDAHoY7Vbqxp3VpzsONOj9VSDf/heUL8AAdhiwHXx5E1IewESDIY
rVwOalm1GzcnHGD/wLhVjXTLicE/G8LIxq/Hwz8xUEELVhdZRkUuoYc9wTsbSbuz1AIODrUyhGwQFg5J
u0G8MSiDYABUr0esLewpSQn6fyt/2DCIHBxbRX8rUAgr22hwS4Jcwc2fwdoCWd93wt8NGMRIArVzwkKO
nZ3bY2AEDUWLIaqBcA+3Bg5eUhyhWbX64Qdr3z1oyRG1jPqnW/guUJ48EP4OjQGAFkgjVPESfqQ58jB/
x1hw7w8chwGDHdLUAlmABZ5QotJYbAIc4u7qPSyG0SWiYAJIKexfVJXXooucBbgPOqD6e4wFsAeJXAIq
AmE0u4ynSFuuQW7DKG9mq++wUAgCGaE5Zngwg9GhNsD3FS2i0+wwD+cl5QcG7yr/JP+J8KnHDBk0dix4
2aeqx8DCt5JtY2AsTAznYgGxRScf8c1iQdpOc//lmwLZDUpwx2AEw0uCLggv69EjDHZEhy1XzjjYK2Bg
YGNQEIEgJ0AkUe4ed4dQCqgvJh1CZkJgCIOQj84fGIwE2ikfkSKCTWAfsAeMbSFDNBq1kUiLB1CshLUP
67EoeNnxtaDojbIR1gOxkB26sGDR7jQnIXd3vws5YK0fH6SmEhYSTywywiQAeKgPL4NFMgGoRYS2QwsH
A0AIYbvIgz/sPAvBWh+4MmLSM8PbZlgKgWCvv69pkUELLf9z0kBoKDEPd04JaVVehTJ8mSp1QwM1JR0D
bpDHQCCyYCgVRqRHWm81VecYXt3ug4he5kp1GKrHFglw7EYgBUlmKGUIDyGfLx7sTQnITyAsEl4fTP9P
MhQyFQJlyEDIFAQckBbJFHQSogMGpJcelA4ZkL5f0A/KxiID2sJvKpfKAYdBEoZ70hyJjv9RaBfkQYbE
DBr6bwEPBIPP5b5QVbKTr4H/SQCkedbZFEm95lPELBjAX5ERkvjgvqfbgiIOG4YD9ccE7IQJMOiUAVNd
6kslQ/YEBmKnXoeFnADj5gnmCDuiFiYKUAkr5R9EC5BFP/4mgDpWfhNieyv0/lEVNSDcAEk1SQJhVrAq
AtA3ABsgcSFD38fCYSGZf1EPJkKFghWFCxTAE3qLvBuJNCWcANtQAghwGt84fncUcBSh0U4h9QLjCAkV
EC5UtArYQTBAADwp4TFHBLc8PdXhK4ywCqNJf72SzTMTQbdH9eJEBqsCIQ4ML6s25T8a/dY9UNQELDlS
GnHvsupYU7dNKTPXOE8u5OwmKUe42dYxiJdVOPzTH4AIc2Epjl4h9WF9exk4DXdhWBCrV92nChBJ4Ihm
NDBqiwy2IC0VhmMPBRB9NWHAUgnhV3uVmMO4hwiBAOUP4UgnjCHTIkolMelsNohwd7Uss0EoCdD7SF4P
hJZ1ZYjk/vndkCOpYWV65oYtzB0huM/k3Qt2gCwPZdtzFdhG36yAvp1LwATQ7ECALRiFWYXLEOpiB0iL
LV6AqEQ7iBpO5FzeeIGikks8SyEAyCUEQLix+AgAkg3m1w0zVeE3fYzC6CXKEB7gAAAqLpksVgzPlbUC
ORlItZUAZ11Co+1sHqAh+EKh+P91mq/rYAMjR1vE1qViupAlDrxLWwAnh+PwnJx0K0eYeTqCRlggh+mE
THhYCTkMIhb2YARhYGoiciEaFqIkKCkDnBhLRTQ6AYDZXcZQEAzjBxp+BGeDPRlXDywHGAKO9UKGBXRJ
QyrSCTnWy0C4z0O56o3A4shKSQvdEwikedIzFmfZQIGdsUYLM3tnAmmeHa4zj9hHSIE8GXpz2r6T7zIS
H0A5Gqg/NM+GwHQFM27XRsURDoHRR6L+zYSNYlj0/86iwrETcibpp0ddyNhu0Hc2EHMzBMU+QgBIgOoP
CeJHQY9BV8Mizqq+VkmNeQi61FWPYITM9XkQS8RDYE0zyRaDCgMHegYV4B77gRgSAACBwSAJ8TGgKDbt
RIlFvKx46wTi2MdFyKSGqkZ8UghJA2z3gm4VxUFRSkFQxVbUzZifAEpEEtEVvYm8Xl+1VUbcW23dRWrh
MFVtK0UYLbHupQJ0EFNMoVIuYGEQ0VpZ8QVsAasftg8FNKJgwoR07SrqVf4VvzFAvABeKAcTYwS6FSgo
WQRH8k0AeONbdw8IR1iIAs9Gv+LeRzaMPZ3OGMIK3zvniYTgWEvVyz+kOCFjVwS5RW2s6MlYV6Hrpv91
IAWHiclh1RRU+AIBHBFIjY0Rk6gym9zhp4oNKnWoskWYTKkA8QRqkKB1IRGxonJVo7EyAkOSrwUBWxTC
yG8FHT+bAiNcJl1mRYBMwkDhbZwA3YiYX0BbDWzYWGRFbTdOFVxcZY4SrbkFXlEvxHgGCkWjulvYRakn
IfjWIvgJ3ohFj8CNUBCbHHAFAVRgKj5zJ4QqRQRfcMLjgEnR6S2wBLGeAarVOpUXRAb+Q4B9jwxQG1th
9oazJwxIiz6vjwHFSaiowK8CQenGtghaItRWPA9AI81I9yg0CVAEMGTpCA0FMERoI816kqAjHJrKt7vl
6cIDAsE/NQrKykCXqhSvD7807DDYLiU/J2MOlzCbFV8OX7dfI2phH4yXLNXaBhRqMmt+Ih7QAbrIHEA0
A0RX7S0DdkW0JlAKJZCJtFWn6uNFm+EQAC5RIQnYN+CH/VktK/RIOd9TN0mJ8TYABIleN1VD4SUUx/ru
ywOZyQAj+2EdquR7JZxmLp9nBbyOoAwaoP/YNNmGPNsn+xvQcUaXXwTe3NMtUJ2I5pOM8BahK8Au/+Oc
01VMIICtHSkIH4D4EwexQkaejIyjhF31yBaIUcBA/36QYaGEDd16JW22+wWZyWxIi5FFqJKKUlQ9AHYS
u2pG7DZFoDck7ne/AhSFWlc1JPgN1zgFv+a2ydFotBqusoWY5IwWo+jkBtgDESMiR8KsGwTBuNA8DJan
3BwsWU83+EnH6UHPBqyO2soiLcdO4+rZaST/LwrLATJ2wCj9xy8ebMDqyYmqyi7NLxG+U/Lu4oO9xwAR
t1hFuc/OZ8BOSCqACLGL0647IDXgBib+TywbD6ELkrtAdI8FSwkwbbkIRDA2TwH6QzisDg092wAAB3rJ
kCVdAnemILgOqv8KELz2xbaKsRANU2p8eABbNjMudk0B6lUqXPSDaG+OUHQ1n1Xt1hH4PESZzggBLLKE
ibHa2FpAtfsYvyTiFFuGJG5IiwxDjlhp7c7IqahUNHmKATsJYBjvwxYEhNkbCwB47dMtI1nINgAon9M3
XDQYAJ1+eKjBBaEL4JVOLp8C1DAkP0cywnl4WooGRcA/4EAbEVSMXMqwW6Aid9zKwCkMpULZkWcEl84U
SiawEDcCOuGwAro4jTHZRxCH5bBuEWk6Up31jUkKwfopLHLAAVDLT8Q7V8GF/9PuTFEmaBGqSQD5nAB2
Q3ArMU4QSesCqpGvSdrpLFmLUdjmR607YI/ovjBRDOvkBogUBxZtQZTYN6lupESJyXzDMzWnGKyC18if
4LOPgMe3+cJNCcI3hGdDg8UpDM9Xil1WQRfiwMXFisCrF9H3aWHFcnJ6cpzakH7usc5GK2gXCbhiB/sy
bRcpPA28bAW0VUpdEFiIgHVsrYLPaxERMZyh7BHmWArja5LLPLpiIGA22XxsfF6A1bGW1z1r08VWAJYc
62HDa2Le2S5CsspcEyp0Cd1JHjKsKQjcVUGIsUXA4rD//9R+9UX8WAH17NgSAADFwockUWsufB2nOm40
UrxDmoD9bK0XC9Ujoi/AW/YAx+LU//alwHmFGxiDOHuFEA24rVJ2QdSg9OG9GBqiGusPAFaMXObwrqjq
vvksdRnGgyREURPiAUnqBtgwHwS9cKyNtUDKVQFEUPh1AGKrdPnJCrjxnnR1whYi6UEcLIqzCOHQAiLU
r+MC9XSjxFg8x4MBXQsWjQkcLhCK3FbZBBQ/HSsQ+4mDuOmrvoPAnJycnA1oyJDQs7NnX2uF9YPYGkAN
KOWCk/BI/gUOWFVPeC2aX//QNvAVCK0VNEOVKK2KhMXf5i4EhEMHJ71GJggbpz45L+xZzCANQBUObT9V
y4q2M/Uk5qwt+qz2kIjbAUhhhOuvIBy5bns1MCoBaNhwD9RWoSwflhogPIJIQWaHCTdplQ/CSE8EMVMQ
EEAbhBYhslNYNGKmm4uU8L0QNDkQs4wKYIS4aJMYIZwXQo8vmVoJJxx7i/Avu/if2Fqko3AYEltaKAjC
hjYNAO8sc4QgHKBXIwLhV4XDOC3UicBb326pMC0Bwp1YWuEuGBgFu746LxNPSAXBKEsAj0FHNB5jOd70
0wDZhYyCABod5TgDxRP1exgNA0SlripcWRCViUejqiGgSbWNoqgAym4pDlMQMAIRT04pxlCNqBkIih6o
/24QEYPbn+L4fVJ7KMfXaCsAKfoQiE64CAEBR7jg7ghKxs0WyI2KqSAE9CoCSINqRfAs/BGHgdUGLlV3
RTHjuqGArgvLtewoA0BEIB5mF/EEhgNW79PgO8ASOyh/UnUdE8H3QLKXi35YMH3S+BS5LkNTCcns0gMD
OtL/vtkA/aFaIcAXvr0XG9CqOPjgWp3bfvHEuPwFx646y1mFDwD8QN1gU7gdlNUB1LtNHB3VBknHxP9k
KACGt2NGt6BW7KTqA71oC/jAkYA4hqFJoR2cXDiRTBbfCUmQLAMqmt0/A4hGVa70KtpAURMoAyB+nLD1
Of4vO+86gBVskYPGbzo24xIKuj/ud/2hhEBs9TFqQ/LfQlCytyhIOfdN22RQqoCIvzhCB7Uv/zdGudGQ
4IkI0wIE1hhBcAXSn9dlLqgBOzGPlBYwRo2dVGbVT/r3TJ7sOTn89pdMOf7QFhZLV/UdKksYixFzUBDY
irFvs8GWN0SNaZAfTqIYdipacVm9aobcKRmvOovgbEdOG3BZUYSq30OK5SF31i5v5gmwfVfk0UDWQY1N
AnARUlE5+q460+SdWYn6wtqrg+lOSe8YcEE3IKOLTKoKDiWiNcBscPdYmYmppTIsSc34VrTdaKkAksAa
6OAMJAPYwBuWlGaIIoA2FbQBv+44AIX41jm8lw5iB6IyPS08cxFU2xsxPw08U/Y3mBIIDtNo+BJgg1ty
JXhayw1kE3ZEEAOWlbKXjAE2kBuTzjWIEI+hMstHIKMtwDcsN2QbycMcARIJJexkh/cQu/cYxjtkt8Ai
uUAI3kiZKJvMFGw4QsNYKWtgs2AjKidCgjeSLSohgwZ2hC6CiSf32le9RsLuJUiLAEEOGO8CFK4jCf5A
8Eys+5K1iRQyIInBidutHkWRggZYHRRoWYcX0H9ewgYs68Cjc0NYWMCvHccxMiBPjC7u7WZC+lKzkEg5
+IdoDeQ5kurt5WA8B0RXbC6DMD4TM75mL4IE1rC+l2c+x1oKnzL+1swDAyZ0P6QBMsiLDkYFB0uIFJAu
n0llz5Zt2BYmEg+3JVisIHoPvuwmwoOUHbYSDfYBS8MSI7qAtkfVB/UCLQXEMSAa2Q4E9VPJlgJoCMcR
bSNjWxX5MdUcJUDELSBKQjg3BhvDgT7QdVLbAfJ37H5hiFJA6+sraOs7QmDrc3O3ucwRC9kFMOvTIOvN
bm7uNhfHBVjrwVDru0jrtW5ubm4o668I66kQ66MY6513H9heEuuYBJK0648TcOuJdD9wdwV464NhPTim
CCByyCGHKFhQyCGHHEhACGCDHHIQGAIHh41N6oKALhxwCHhhwjAiTw5RJWgAQDcA2TArfBp+ywdS5C+z
gfEcJcsXKCIuggobo8Woz60qhsGD/VWvBWywFZlKXK4YTIdTTmizZYOU9AnKTQEoXOk+eGws2fX26ixl
EAsIv+dga0lx9pfl9cAtQcLnmuYTQcCuCGv6EechNqIfX83OkTYQNniM2er1cey+A9JoionYBzT56i5x
DHiO17Z7Mt60cDiEYx5v0Acx0oJhjx3SOiIZCBjsUIA15A6SyGFjQYUacAggSRdLdig1CHpv8uwy4CW3
rbN6tM8YQ8YSRK9/DjvksAgQWF9QO+SQwwhIQBgsyGTBBhIHsq+wExx2r9CvJPaGTDbkr3siOWyQyVci
Ioyv4pBDDq+vr/hFKwEv/IsBKvixKNECPRx2SkEJoqbKJaYRgtgUekEIS1VwgurRW12gdhPgwYYeDKcf
idFGEJ/JGehIi4fYKEFwwx/3E0AcCwJXBBBirBgGlv8sI0cYq3fLf+vHbD0I9VH1ZjU1rbJVuEVCJ1q6
O1IXGfgdPexCjcsA7L6MIu2LRjitPLSG7GFAp0YwDyBIhmRIKAjsQoZkEBgGDiAMEhRvhuqwIfu+E0Av
cD94D+kIS5X/Kxe+sxgxBsABxbEfzdnBooedPPnfRmhPDMmQDWAPWFCBDMmQSEBhniyi/73A7IIOeAtQ
kAhjzhbCUNHYGYkTFZhwH6a1iBkNHUygB9xhRkFYwRIQ+Z0oqAYJ3o0htfoJWkQxNHqxwNm7LSyLhSs6
Q79fwQZRvVuF/x1NkmJBQwFJ8g0sgng7aImFUGhztmN2hXAKj4V4CiA0J81JUBg4MBBJc9KcKEBAGJw0
J81IIFAoeM5MdNJYcOgKaOakOWlIYGBYB8DCkTAGSDkAwhFam1UVZxgOJYFbANyFCAZo8gZCdyMqKkUP
j+BzYG3AVtFrUOAbqO6ugEJ43MeFgCNkihqBAL3sbNWocBQvgSwGMwGnQESODMGv/UGcQYNTR0GUFFYB
D+EZHPYTS9EUOzxcHihC4vqDilUDtZOf7yGgNsIdkCAgYgtBt8QQKCEni6Ww7rnBu/ckyhV4wsnJyVkN
cBA4ycnJyRhQIEDJycnJKBAwiMnJyck4GEAgycnJyUgoUDDJycnJWGBgSMnJycloaHBYG4TPyXiAi7Wb
gBTEuyCGpcSBxNgTE4AWUgu/whBGwuSQZT9tacfhHSFM6MxAFFl8YxSxQHrHbj+ksBeMJG+zMSqGkgMb
Zh9wWGQoGUoIYEqGkqEwKKFkKBkgGBlKhpJoEFAGA2QoQFuAwQZeTTCAVcZbV3JZpIc/SElgKggHff62
O6sR0XtOKI1wCifNSXMIeChAIHPSnDRQMBBANCfNSRhIIFAoSXPSnFgwYGCcNCfNaEhwaHj0U9XDLLdj
rbTVBYENtQHoS7c/FQkiNnN2GI/BLnn237W7dggo7+uWnXQceCDCt7XCPOuWPHZAt7XCdlCWPOuWt7XC
dmDrgj3rrLXCdni3EVieCZ87PERcUhqeYFpmnZNunrV2CIQn3RBhnrV2MGEt4Um3nrV2SGEOS3jSnrV2
WGEIk24Jz552cFaetSGTEJCNPVglB4BMMGAAeVjCaPU9SIpkCplQKMmAsGRY0WgKuQJhPUiw5CJkIFAK
YcmA0WA9CEizmCgx1pCCQUAgvOhYCIcQJ1BTICxhwPlQ5yc0CAEpJScwEhbClNl4PdwKpClkcGgaC3KB
EEh4noQTwitGMDmFEC4EFgmMFwwhB5YgniBCIAByUKsXcmCjnihAIDIYIUrIhRxYngh42IIySOmeQjoh
HRAWhXAL4WlRWZ61GMpYAdgJhTieiylkEpZ4WBICGKwIQCQIFgQUnmdPsKMYQ+WNHEN6T/V8gqQ9h6IY
zDXdKIvoWqIAUzRCig/Qsb0tU7f0rLs2GUCXL6sAkxYeYshzcjRlSG0UtIxf0L8FvOBX/nQF9yLaBbzP
NbiPdE8QAr6AyaoYxZew3QVEiczwdUYItwGxOxbIewhUPnwAZlA1fBGGhAIYkM8DDbcQBRz/UCaDbAAb
KOiD8Prr0tptFfXXVXBNQU4Gg+rriheLDsbposgFteulK2xn2G1YSIkHi1+uh5+ATYkKN3ZYCJJfBpGC
G1SuVxnmi2/LBlUJft2LiyzLsiyLi4uLiwMAcN9nOF/Dw9jxgAhBdblMctgU1QkxePOrIreLIM9KIWEr
gG4gsYM8wmYK4FbVbI0ERbygXo8FLUx4faEIMO5G+yV3CV0gwFRY7twgC6IdAZDr4+vcHEUF3y7OS9jB
oOBpBU89YPcDiAgFCwt1Fs8e6wAoGHwFKbI1D0Q7vo+78A3UOiES1QaJnTJIgn8J+P/Gikb/LAY8L3Xy
6+0DgE8CRQKinGQUBTyh6NpOs+gNIIZq5Hh1HanoEKAoOSaHDQEcdQuO2ADwVMCLim8yhor4eHhl0d9A
FEzQCL7nBZAIIlifXCKYBFDtoAWo3nbKDwWPAYgAHJerPXRUtyjgxyH2RNgGIDmJ8PAbnm0dSB7/wx8D
deTHBe0Ps4jITi1nW7274wt76Mav/WEdrxjdOx2oLdtdQb0Gcwj/vQjr7x9BEa6qG4RjxmIAUMMGMcJc
w4gmQPUg/NLqAYCt699r7n9EQaH91gFaVa4JCArOl/3RKAoxZjCyMxPVQiwMFrSLq6qhAujePCB2z/hU
JAio/+Bmvj1QtBshN/0pjAxwCIAdCCns1RqodkBCdfcxSM6CahL16D/gDIieKEHvn5uoyvF1EecvPXXF
2IXCB0pG7usGzNJJiuoQrwz7CX8bIjybOL8Gr2jrMf8GAPC74Z9NgkkhEpBLgoYwAmkIlhxEMCEuQwsI
xxaXQRe4DY1dgt5BJJpjeDi4gxTVJ9gFv9gIwx57sCA+CLgOGfS/CX1yQPXZv38JpHVB4euiaAEs+lWN
xkTRLkOSCZy5lnWsmHLeMf+BbEcumEHA7hbPKwZ2GgW3RNTrKMabUN1VCBLospJToBUAT4dQEyhuVWFU
+nUQgL67JU/JrEEAPQR1NRUEhyA9MGBYEfGoENKPYJAIfBhuOPvh7WPTRTVqAEUO/r8CspH9v7UC2Bn4
Wll4Fw+64xNzEWLHeFF0jrhI5wyoaCAprN/auFGFDwDwCHeMotgIv/if3zgBECNU99+JONw6JlXio0kX
uUwzSNcgg/IicECGgohxiw0lEVWGgiJfB/gbUdcC1HTEp8EHTOQI4kF0iq0CTFFYPSUKmqJJEcHP4ELQ
pXSZixHLBnXdbbQgxmQVCgJ1FQHAW0EvIau9o4IKbPvSRMRENFe4K0EQTRqnb0BEB6v/adnrwnCIig1x
s4urqCESRPwqZiiIR6g7XCQIClYAyf+iAcWXqFIDRxBIsKD4gP846xJInFQnQRDn55GmpVOST9OjcAAI
QhVXM4C4kO+JGR92FABZUTYDaAi34EUQoVNUuIgoEhWnVwEY2P0FttxCFXRBIJhU90JFI4JMLvj2r/9M
Y+hJweQDTWiLBd1GP0+NPAYxqhij5lQBxn6p4kGHB5aNXwR0Jn+5vAI4+xS6vt6IXSDOLvk1uikX1t9L
9fsCsExtt3zGEABGVpFdqglBxuw5xVTR5/4RVYtBiymhVoSgL7aIxa5wDGXYgBDAcwBOFGzuHYU80BNU
Bm2tFpTTlhQ6QQtbwWKEYpyhOoDont89/4x3tqE3KFyjKfsRdAebkjx/8naJdO4TVDXPloJBxwAcNx1p
6g6gJhd8A/w4GJYigRAnLlH4wl4cZG0APZBBvFzeQ9d9HvAFxyM/Cb0FiAQBxB8kBhCfIL5TENTOgqot
9WQxUAEdQScoXxgoaPtB5eX+A8g43hY6/wggBwoMLwHN7XarQHMKB/ANJAAVWA/h3UcEESZBucqDvoFn
wIIBw8iI6N/a9OtyROE11g3EGI0sJAWLS7XDIPuNU+9PcyEEK3iHU+kMb2jJUQRfnf5hf4kncsAiIQXR
MyEA74dkfHiLayVVoQITMUCIiuAvhzE2gM+BTyjOV1NGJIKHH89XeSAvkMwNRFecxmAnAFlgzADODshJ
DlhbWO9W3NrIGEBAzz35SI4wz6AN0bOjMzwPfAF/LPLvkZBXxgNXBc+Zs7bIaCM9zx/aMQOKFaop6FNV
syJuqLsAVAQZG0oQEBTEhB6JURiGPAjYseDi1ckBtshwtGh4w9rV0UbJA1a/IZIVtYDVDK/sm5Mx18LC
FfkwIQDrPAxjNytYeAERsCqABBF/ylSMB0n80iguReGChfXn/iLC0IqRIwjiBjsHO0UMAfQMvkD0G5mk
NiEAI9QQqDi9GV8ICFb/3yNFCKjOCuAYVFtc08gCTBG8KknQIeldNkUADxRb7JWKKEBtq4LgJUwnAcHg
AwKATc0/pmPHtEu/QRQg2AHDKeNACKCCFzKDyOiHA1hSMH70jXMERx+z0rACqR8nAIoRxXXjLlFssZfQ
LyEAaAPGd7I9COwCXGxYijcwD0Y0dgW6NQsrbz2pNWMPm7AhXv5bBY8qdWzbELDb/LFctFB1RAS3VOFB
87FpC/YcGidbFmIqt/QJYVMAzDUh+4hgF4TA+JddpB9n3ffH6DJGA0JDhCKYAUbGQbg07jvoSEEMtItW
rDCIagJnSTgRtEVRWf6hgjbJVBwLx4kiCoWOnS20UVRIgAJ2E5WBG44xwv1bgRlRfA9CxYlEFE0fFT1j
3K5ZzKaLAEkO7HQkGD8G7hZ7BHRDP/2JDLCcoahJyjcfhnLIZjixr1SKiiGhoVLiLPvC1rA+g8kCWiVf
Jwhi1jBYxXE/BSgF1YMrPMgIxhg+mCxF0ZGAWEGXFdkHI1T1mwM5GNXr0LC+HIiHBVJCFQfru1EsP5iF
YMEKVEfEfSswuJFHAaaj8HISe+lIC564CtPggwkFdWPhlozDXvMvaTP0YpP8GBsLXTNWFiIGBT8wXcFF
70g1ig8+PS8G2DcUAUZEJBBIi9cDAN5tCMcYErb0FgWuHSEWCAhJOzQgiptHs06ACzIG9DReHVkR3IrE
OP/ALFLRYXxbBw8WyMm4XMaGMqhqAfuNCjIMAQJTNywkH7AY1JGIYOCggeffp5HtWAbmKV1nFStZiJWy
YTiWvz9rgwix/8NIuN/vwYpRAV7KBPETVC8CX2wIYvVYxAJkCc8IhvCsXRwA2FHRGwdVT8ErIS7+qJo9
Bx5IIxvtwhsPEF+dD7zbqWw8IMQCQcOJXHdjvixaL2C4CcHlXyR8LggxtyPRqE6qdC0QbwTiwFoCZDDu
iQJRQ6/GrQp+bTjh0FtJhYtYoOo2id9t7EwIMfhdQDnrsWFHf5UGbYDBlDcVNwsYtFEhNwxVAxtQGC/b
4B8+KPjHgANcECRifxgWoAHAJjGBYEUEWycQqVV0GOG5Iprlkyrg4QhTie6YLaCO7RO1AmOqCe2XWHAE
6Cq9EIFoGCTMKuip96xskAiAj/UgLKL4dIlodl8cNguRoOLA92MIFhA9pDsNYtMjYxMgegKlY29aUky6
AS8HKl2SUTU1wN0/6DNrAoZBU34QjUbUgxfqVAUAdHYiWnfH8JncKSEYQgrH7p412SQVwRKLFcMYRfh8
MgUBw5mzKeQgcpOsCkkRLymAMC1jsZaAIUIHCWshchXEDxvXwBHYQXVV+CUpw4sHIhBqMNBpO3YXFHyJ
BBQSjVCcJKq4cDtUDHYuR7EJLsCuPDNOKfJLkItjkoPKlnFXwW5XE08U2ksIbVl8fuDBFARK0tmD+ScA
OG4ov2I6i+BbBRC72znBDrZTQmLsswhx1kgrXfCBn5jARwE6m41j4Hw5ZAOfEapMOUwkGCoWRSOVOjqF
qwJGMnv3VFHDRtJBz3mrHQjq9KYHiczqRpBrcQggPUcNEOITde4S2nhFPdcBUGGXyJgiyDNkGz1WI2zv
6TzlP2G+qTc5q0NkK6RT87ZDbMKJaId7rgECvtiM/4VN9BuIMpzVC8+D+QGh4QgLY0IZAg8QdkUEFQGp
Dy0ocPBEAm90CHoRALehigsT+KbT4CgtYrA0ZoQLGLyBLsZmJ81rYK0dWychImhIEe+xFlK3Tychzhsj
9shgOSx12Ok6SIIWI2D447JfMugCZ6j4iBGNhH3YicGETCQchsMgwI3B5CZJ3QZskh8OneHRJsoWIHAK
4yjhdQ21Byx2I2Ix2wYTYL8/vE4ZWoH+WTZhc+lO+IkZV7O5PwBMYTHsBQioDbSnw3aI9thcg8HBF0hj
7PEm8ccADGppBGyEAB89YijuGMYFXzDeCuEHI0uOdhNWj4U9+HTWsNUFqnCIf/DuxuKLQkAfinymG9AM
XxSD5pzd7RIEuMaoGwH0HGjBMAKCcO8EImRFX6d4gHxwZmx4Von9BPD9CB85wutlARw2sG9ecOPgw+S6
KmqmhElv/hIQZyJlw33wQfbHAWtqAygzPm8ffztSQLtJgf1jl2YsDMY+gWfFSYJMOe59JBxUCapeXzwQ
YyvFz0KT3QTBQxA/aUAXUCyzTfZovxE+bJNgEWXfB/ZwZsOsAnjCuyBbZOXPQjOiGEiM3ETqFR9mfEnh
uRWGijLYnjqw6VTSQzneK0C3Kvizc5978BC0Ihj79URsoRE3EPBPVDGaUQkyojaoCrMaTAgKLqQAAP0a
tdpsMVaP7znezoLdULRlfExkYSQoQZQEFZKkiLaA7uy/05CKeo1T8O/m7LAgUNejhki7wwgxOhCeZcwF
1ZYU0Rx/LHwJS1KPcyi3C3EgErd+79khgUNVr34uArsGW4RN+H8y46QICo9G5LrBACgkdHcRqgno/ge4
xXcfRK4IDEgTF0XdQ13HNaa6sUYJulIDemxHrNgigFvA9LnEz35x0rimDwUsUqxaw7EfjwQIQffBFnQN
MEWw8Wt1Yesah/7wgn1YDMZ2FhuRX1qo7oPn/1v2bInVicskg6BW2Pf+nUQFnTzGn8lMi4wFxfkXi4Y8
7ALVL4pj1Uxj00y4CY5tARfBZc+FBLxEQI0S2i+D+yCxbgdQAvfYY/RriIB9b69bXemxU5S6ouSKmhd3
YNAtYa0inZnrY3QlKiif5plHMZhUAeanDCBahHzdlUtAFA0UGGAWET2c4HTkfFtgRQdcQJYgq4hICLuy
uBk+7CHErJq5iTTyQ1Uf9bgLajS8BxVM2AgvGCPqREciNjH/AZAD7O16PqNVGRxEDxrk/tJwwVNlmDq9
2JjoSScVOhAjaLlsSXSS4mPzhIcfIlSQ/Alo06MiiATOggiOVQ0y/VUBwBM9pDBY/i2gjvYCapk+AXZ8
jU//DjwBgiAF7SwKG1GJpERjUrWRISJbfMi3t6B3sBCDPYX8AHU2CNAmJPo2OPG4jwP8wVpsFs6F084A
dn/uxwWhK1r2g4sFEHUFuUGEpGOxMUvQE0RTGt0GyMGijnVm56zVMAjtgigbcwjqkbtVsmHEg4gK/CoC
dKUE0et8AYBrSEHwXbVQNUQCDlSFL/ouMosaBOsHMdLl8dqy6Elj/ealfPYFARvodX0akBvMADAUL4Lv
lhYq+AbTUT++O6hdrCBLSkhJMMEp+uEITjtikyroVEHshIlHiqWkSEpqOjEcosNYePbrhFX9OFgtID4L
po1H4BzUDy7bdg0H/z93x2k+R8eQZou6/1qWvnAiiFJ5gX8Q//yAdKkwdw0j6xH2RwjWbWEbnhA1gLiD
IBGGqEIcrgIgQmLtRjhSUCK5Jlnims14i3uJtCR9B90hVl3/x8dfv0JqgEuVqd5rEHkExG9Dh2Q/gcRP
w5A4mirWdg9rLf9qmisWUQmNEtTfGtjZ9zF0hmP66zC+AaOLgiREqOrqo6DP+AWJ/uykjLhiQHIFNUxq
qOAq4Ci1ALUAPBhcU2zABQA4cKGKpTHtI959hDcAPT4ks2wMicUb8BIhABQxyMMZ5BIJ2DipNhtvBG4/
SYwRXQSK9YcLb8AHjw+oq0EmQx9DKHQdW5CAChc4RQAIqu9dZw6pYltw67xLHSjeUq7LUIdIZMe6LmT7
SgdHicVG+CiAwx//8EioaKwizA4XRAzbDl1M7XZnUVRzr8avKcYAWheE8y9QKCdUYCJ4LjiARdFgByjd
DgahgkZ0fktAnbXfglIDLoknUfSq6CCjhKIhFdHASGD4UdCptOp0NxHULAh2kI6COjngKYgTIGKkHKxC
EU2ALPAOA6otB7zf4FRBKgLhEASpkldpYFFFF00wBHUSRbuSh3D/wweAIUWspSKodozT14N64VdBN/qT
ICRDKC/4QVVdJgxIhO5ZOjqsAoX/vNe+ADTsTKqv19FDVoO7kJwq+iSn5XgWYgnqBhFpLf+F2lREaUUp
T+vqzQqGgqNxSS7BhSKVAWMoVCzrwSqAJr7qh0tQ1aBI/xYBEaQXgO2d685anE0WRV3+uKf1o0sQD7/T
2+pJdYIRKuL18/YuVIUr3DeLgWyQkzNL9s/GekHUI8HcbdBFjwlEyK0GsErQisgRA+/wAJYwOSP1XwEl
JGhXHwCCdUPgISEAF1jd123EBWEPWhhQCOmpR4GwhOfiTOQAciQYiYBwjAg+g+4JJgJxSYrgS3sNNpwA
NoJWQwC2L7u6xW0JN8FTA0JtCusjBXUpMUIIfkodZT8X1c1w2ieLWItagCZfKBUi4gUPtw5T2XaVTb4l
SEq2qawVUStKAnhDEaEHw4tK5PtoK7evAQ4qEMf+wloTK90A2z/DEIPACKBDVRyIAmd3KxjbKMvQ8XWI
eewPQ/8CqBsA1/GDwEWOXmsW6+xQUd8KUeULObwRg+ow375VBPR3Jj3MAAx3FGts/T/08PaBxnw58n8H
a8AKAdA4RBvt6AK+/8HM68wNB1HHjkxEzNZ10foaS41Y+sMXgRaxPf0OFHV1OdF9cRtAWvYYoYp3vNMp
y7om/TH4LCD/gfsAbZrYgILcHNNKSQDapwIgj4cXIFLsC5oYLoQpqH5//HF8gesQ6+AkrAoImBbFgSKW
FJa5Ua5hUZhEyDVuCzodH9uszwZVQA7oGljsCDb6yUe92cDbpNvQA0HH0KgN3dsehArYXXQR1wXcmTBn
Cu4l4Os4GgoXvuMBRYXkD7rgC3K7FDQgHBUVsx6IcFWRk5Bpo1eFKNfF+wd2CXiHmuwQaqcRHdH7v//I
WV5pknNbAtcUa4cz6YQ6uhu88IPnWw9F2AJ7FRl537flTm4GIv8YRHpFomhBBINEjIo6I75cWjBsVPL5
fLD+xE9F/U1xk1lJY9V2UhRiWyeE3g+GuRcbQz83QlFVzN0/8AAKP8P2IML8JshN2x/ce+h9fGpoyccu
IdgLQfz/wFha2e7ZydvpegJ0BP+FRUAQtHKD8gcoPtE6YYh2BwhrwEfw2QW/m4MJsNmWMlSuRBO+/A6w
+/ARHXc2uA+LBYgmKdjYnwqoGpfYyev1PmtfWPiAOC11PcqE2OLewm0HUWv4WwPrBNzC3upMMAvYxTsE
Npkrb0wFRYkX3QzB+FMdWpTAqZhtcIdW1dcDENMhzHM7WMh0AyD6CQwLxuLWsG0/ekbKCmg9cP5LsGAo
hluIcjUsQASGGXFzQe0FiC/UIMH6H4AIg+K0t28ExMIrP0GNVw8G/tlKP+huWV5mgF7qe4A3XVSVAoTu
XLprtwvs2WwF21xsB15EiGpvG1g0YyPaZAMKDAaGAS/8O29CAYgK2Mp1HTwPmsG8RbtBaYTJjnd/BUXY
tptcfN1CAsYhLhx7dOH7u+fC67B1+d3YAUg2DLoLLyxAhn/Z9UwpH2NK4YCKywXnF6HUlm5+ncqoQXRN
7V0SNY1cKwIj9ModfX/7VgVXw00p07gcK0aNPCtFDSEJ/vvjCDhO/QvMKetDJRNGAjMwZhTR5AABtFJ8
WwwNOXtVKc5xiwDQwsw/ido2rD1AB0SyPWaBcQBouJjQJpNMOUzvfYytV6n+2IkL2A1TCAQtPIps0Byl
ABSDqkrGoQQdgzwVtGtRHcTTNNfJ9kmGCIWIK1/KxQ4lDgjC33wewp2IhSDqBEFwxBJVxvzF+Bs7Ou3f
R97pp9vqetJ10ARUjkGgi2C4/ZLLcWzIuwDKmjtjfk9bAdA28x3OAn70DRX1/A9OzrP9dxiLFwVoHVT9
71ZT7iCqAl1h84lXsamiBd7jYIlFBdrbBnXtDAtBgzJNvhFRtwl+7gQgd/ApziDYKgjcrQ/4rqvkidqN
Qx25CSyi07cC1gNEjVgBDQvxWoL+ndyViRb1tgsfd7x4vyRdgIWROvfZcuo8z9/uRivpDnD/SEy+qNNQ
aAiI/vUxiVHxRhV6H4s6AGiuDGoMJVrc8CXvxoly/EtMIf7i7eEOiM3cg31QVbzrokUU8rcHKJoKNGE2
IuP+ZgSwYQBE1dXjRqEGzFSCwf6JgZZ4azl6D0/y57I8FFDOvXcfhNLCrFVRE/yh9XMknhAFFHqwo7iv
aiWi2qrf+0cYdrAUAe8IfkH/o9qDhdL0rlpyVV1pe5XAQYfA4A5nbtvCUn4xx9sTwash0VS5DiK2K4OP
G8BWKGMr+gL+tgTQCg+Cyo13FkXc6nlkekACnAIavyAGmffxVGp1IWyMhlpV1iiA15S+fvHR0KDi92v2
CnOLObAAYFuoMbrS4tNtgoYGu0GIxiV5THW4VJ0ZqMiB/kDwpf9S0DnNcw72QfwBw9st2ZZYwm10rwZq
tQcq0SW6319JOcNyD3UXQtnoRHX3sy3xthAdmyXH2AmVTdZGJf6pEvYIvdS6Zu76wQU239/p+4UvvCd6
BnU4OetPAa0xgTn/yXYgWLhwdh+q6QQMBJGIxkefzXYLxz72AQgbG0L/LtlbRQCOqsoZpohoBtp1pg1E
WGfQejZruNToUejUh8N+GkV7g074/HwuqTX91t5EzynD7RDvAv/L9sIIbTCCmzA/bXYViwi7IqhUqjHJ
ZKhHOIRWdWnB6+/aIGiCr2MbySg0ddvHIFZmdZnzywIMxxpCuMvB+8s2tcal7RzbVAbsSDlTU7zRLFHa
6y+KK8FowebaYxPZJcicBRG0qGNoM4DC+wUXt64PgOVOjdPCsAGJEr0KemWTsL8RW4URuml/KcI509yN
2hOOddzVGAGOwqF3zIilTHUeuAuCFdXZwsjEwCRDoTdFLepFvE/I62YZpoOtgTyqe3uJGcSgwd5EgX52
bseNglMpwoh/CJtBCcL9xgAw6+1BKC/CrYO2bYgDXwIDwCuYdnNQitrSE0D/bZ9dIhgAOcNvRQHZwCTb
YBXog8EpArPglMmJwevACDSAESp/uA0JvDTBg39MZgoCLnG47Ug7BzY2YSPze0gTbB9AEYXf7UwSd0vI
t1hUvPGNRwkN30k5u0AFG7MNfHYZ3q0GAgbzsgztxK1b4EcIxnqDaTALVwmhg4gD7/4EDYxR+JiO666F
2/4sdMFjxE1CNZOQ3Xu6AXi3rpcefE0eQCh+PHcuxDaCFAl0z+h2JargEE7zzAvuRBCSYuPTwJ/9YWVj
0oPrCWi7jVMJRSQMJlQ9e2IPFx9ATAbn7KOKbvTmkPBN/lULFNsbHbDospE5AyYK9+X7obCwCEh9C/l2
T5twEYB5ycYBIdiD3iS0/36UgiE86IXbbQA2BOCtizWSj/Mo+9TFAiZnCR6JzhtrmkHHGTm2AtDttnsi
2Cm8w9R8W/GCxG/YEun5EgA/ouJALKojLOTK+DUwGiDgomJId7FRAxoAY31F5YKiED1gYAVbFx2eoAoR
rBEzIVUFhj12eIICtixshInqAVAvDc4KGhAA4HhqSFG89LWigMGIcpWWFUUShAtVNWmQAeAUUkDvTOI7
QQHcQdrBiYotEUEn+CZMQKAjIDwldBzqPwEK+nDr5YB4ASUoapOKBRPYVuCwGXBoJeRYPXWu0E1RWxg0
d8UUL4CaYvEFFaIRmENAhCcXTEz2MWIr9smqKX3yRQe+33a8VH3G6zBBjHcZawIkdRNVcVJVlRQ7WIBh
irz/xMv/QO2tYg02vokoG1sF24tjREMI2On8e4FbdfkfxID6Kl9/s+sVBbgFEQ1z8GVvwMduO9PiOQnV
685xSAFIFI1sfy8wg/lyPzlwH7AITnfHhJdA3BA1ag8GMbN64W1YH/3B4gT2vBcAKLRCOFAvFoHEdgys
JkaGvf4/6FJQFHQt4osPDfiMAbvKVxALho5OohHtVrZK4XcVc9tOCFQ6qmOxeSCBKQj4j81FQfff6xW9
dVC1MD5BwsfYbsQ+WIay+8TJ/2fqd8zwW40u9YChrf+AhuhE23bJAjIZA+gs5opIArnO5Tm5W8iW20xj
jEvIj40QTFTPTWPNdDIbVhVHFhgEFcGWrFHUTQoBUCFY6uxNtWqwu9A9E5sbSWPDYtLv2kHDKBSBi4CH
QA/Chfoxyd0Qg+qtAmIvWjkPh4llCXoEBI1M7GLrbb61a9I6aUGMAfoRtRERJAKJpQhoW6Z36rVItESO
wpUxu6sGG0UbuCB4aukOgK+I3gnSGLTdeKksQok0s8Hj9ANFcQjCp2gZ5AIm7jl6iqpF7Osy/VZMzag/
wgKHW/NQEQEGgKFAbF3RdjC4s7pMSAH1U1tQ6wvwDR0PI+eFyelAqcMAYIMWp6nA3y5A63EDUBzfRRfD
ieglqwDYAYH3xUF+2xbtRc8Zv8Y38IVGMgA6IN+KJtxrRdH6GFixC7YCm4sLz0rBiIJRCk5BAMxukyDp
ew5rI5uyEIMPlLhHVM/vY8TTEo0eQF21EJL5DfvNBOy3QsiDzQgou2fETY9MjbTNNS1/g+EtwBBNF9Ar
cYAJaOvHiMslzgQl+m9RBQocPkGIHuvktAjfQRSijR3riQAUmLml4oOGBggTDMGJKprWBEFYO9AFPgGH
E6jgPpVsbN+IwlxRoAAXE1N0wd4Kj1wW6+dJXY1we6+SszTVwUzYLd4N5cIPjBagSgFcvpEjSvs299i7
AQtLIgDe7g+6N13suuULElQ5cieJ6Aov6OZYYKkjiUTdTAsAnm3Q6wp9D4mbE1XBJki0jwFtMIwf+URT
AdwH+YsTNQwHcKMmCnRG9sKboiIYpc8FOnMVYaogSgA3SlSYqGUrhNIEK4p+JYVXoAxfKES8LslMKfD4
7G4tCGmKTcjbhU3b0b2HgeVMmHbDQbnOQWAbO6w6iCG/OzDsW4JAvCo3ZabRRQtBtjg2YFgAtYvNqOsZ
+VrXiGCuTE2gdG4hiEDCGpi+7A4oHgG3D0nxQm4JiD2O3OlfBiHMHoKCeVgA4xaBk22swZjdhyx6HtTA
sLJ7fBw0CAS502s4RKAkBCtjHyy2RjX38WiGxoszfCi2SeYJSASDw8Cpqk/TqJbDqBL8yojZmEztXCjc
AQwmGevBIBrkJHyA4v+hgGCRSwZDUfwEVK6J6UTArS3id2/DNlhalDhQchkh4UOXsFQFm4dT60fEsKUO
2+kM9REPEw16FwD0pbsGe0GFL3/pTM0p2MNGhmCFCoUZMWhkKtpQEYrA0RGtiKE+NFKFiSBANraLCwSN
FFm+IIaNAXwMPVgi05l4ULUY+1BUyLUIQaYVLh6GfMGXNTCOUO1eQPAfu762w5D4weji7DwkTInqnkNG
DtlJIAAgAUOsWTTcNgoBbJhBIn+BOTDQSNDHIC1JdxhowB9hQos0gOduIvAEFVzPJr1E9JbDwCASCnXZ
Yi5IVWtLF+BCm90TdOw6ZO50644xSESyXUsbzP9csB/PLYH9enfjrdfsjWjDqQemRTH235TtmBE3MXcx
3aCqwCF+wD9iS1FAvd/qXnTJblRYGFp6OgHWYgJV7U9ysPlQRU2d2S+bJKwCmHJ/oZZEQGOlFbx4kFrL
CwCIQWDTAMATMHzWakJEXzBMugggVy7ckkNEDnqpTTQcFSc4wsdL86WH1DO6HUb56KiO74jgrGJJtW2F
gUaFAjhVgQm0FQaKAJ1mvQKbOAAEQxx/RlQ4IODg38EoB/AWtIN9YIbFUkAY4edYVTHSVChQIKmKbSBt
LVhUJDaqDTNmHA8KV1EQmqBos4ZZ+XWT3kfNNjQPC1/Y9BGYagmoPLsgaO4HSVVIQUkNkLOxOIlzAOJ9
BoJvbsa6L6valyjhRdoLRMNGuFCzX8F0CGr/gcSiGgh1WO+ORdUwt36Ln1ARAQovwnABKlsbi2/Du0Fb
Ye8ZOX1H6KVeAW3BTjv8V7ptCloBKxxrCMgDvtaqVYms6AciFQHJJk06JbRZQSxixpiAWoLXVTg4BJbo
RQWzioi1oaqCyWqF9mgLCEPGbtGtok5gqXXFBI86qsdXjZCoMbhUbrk6SEQeTVXMMFH++AF08Kj6MP8V
5Oy1T6S5CqhQwCEElgYAxGIYFdAAAtIHNxBQUZUb69URbUG2MV6sejRbo7sBy4KASQ8hUn1VNdWnABZQ
rWA7Jhc3IMJ970nRCtSv31FQCYJMI+waqHBz74sceA9QFLwFAP/NTqofW6CZiOUy5evAMdsV1HRKlWaQ
dIuJ6BKXDpDdxwc2gnhBfPZ1H+tf1SpGFJpGr4EATkV947AQrl4iZRLiMQQiuBzzw0ff4NhGYfEudHrK
1km4Ad8i2mAATaKk+gd2aqJFNRQ1M1loEWzrJMAfgAAPvEWUWIshTw1JSblSFc8aqQDrG2cXCsULMoZM
99AAQN1gJhuFCI8AxO41VXfdsQKK2tCoimSvegkqShXx2hZQV0R/z79qBxVuH+jBARbVNgLu6bbfQgW4
b7UqNCjBGjj6OMF1KdVYR6miZn8SyHUW9sKiOtit1zcxwO8pyKDg8BNXjVQX/zDhUCwZn32QkCMC4kJF
/jnOsBARlHYn7aF6E4IkYCpTghGehESM/Ew2Uoy9IpEQ82/ZIFDvHukI1wMZvYtqNvAHV/bDB3VFYQgL
5r9ib/ACsFBzE9fPSbqFKQKSVvxFwQUKVkwx0fuwEV0QIVTKayn6CzaiDVsFCUrQdf/Yr4ohFIl0v4UH
WxTOizpzN8MItxTzMc+dyoDM99eKhXZrCQ8J+jgz1xYK4Lmvm+wSiLpjxzfDAQ90BMHxEwo6K95A1QjD
CqIBn1cQujf+FjjCdRyEPwbrIDAcYRZVP9gb0HTqKdDvkJKiSo80AwgGx0zPHggoOe/FajnYauAKgnIx
5mJUsQHZdTA4clEVDB3PeiCAsc3uxeSWiITNRSF//8gFCwCZHFjIXqCRHf8ARI9jgUcYv3qAPw56UdAU
sb3rBYA4CWeLqEvYKqigjxBcRGgYwki+mUwCkZhENC6OhfLNR+AKCXt3EBoHTYARVEd2E+8xYVfQwrV1
997Ssir4xuuYX4f1aJhxXb5cT43fFEFL5MFxlcBFhMEzgvjGdD7VdCHrON9Qe0sQjsYfFIevO1CtHx5B
GZTu7RBQvD5MjUYKUTRaw04B7NBf+RsRh4AziDrzxCB0BBz9kIoOyFALz8Lw1SwIWqLYX8LPMIQivlOJ
9d5QYIrqr44VX4cIpZqO3BQR/1Rj+ghyFPfBs1b8cXQMpJQLdfSaIGYEtnHiQB1uF3kFpBl1+wXFCwgc
hF9VKtAOmSNgl8FS9AveFv/986R9R4sIClA5Mu4aWFaVOMBlfnd4rRAE7+1wQIg34TECtW9Va3ZjZokt
TnTbreoX/YR2VQwDC/mN6kYQPHZJDNc1L90HSA3xHnY7DwMXEdN1b9/hBOkWPnYkEh8DJ8/zfU0vNxnB
BMnR2b2R2F590Q8T+BGxVZzdBNF1C9mrf8OJzl0qs6eD4l9wRyogQL+r0c7r34sFxwpyASCa4JDuv4DY
ZiYAeA+xF5YUG3jwg7WNgrIYSNDf2DXejYolLSUPOUtg/86JlzqjS33fUzjwBMEHaoliQJleuwKABkXv
LKkAllriIlDQgCdADZFc3iwHWGqBF0ZMBUmQdpttj+BlAFpFsQdbN0Sl20G2dcHo0XkzuATo130h8F09
fnQjgmAQoCkIbsMAYPcJFqUZBJEpoILSj32Fye3xoXdRfkPwU7hlQ9P/0Ns7uLwYTQQKixc5O1DzkLrU
UGqlN8PvfE2FCyxB637wyLvTEsmCvr2xvda8BZM5w3UaYE1FOHhZznmCw27f6c/gDOvgOQhV96axb4PP
ZItHDBVdx+vYRPlvDLO47Lh7K0Dt8AkZawf/QwjWIsAHMRG6mcT7scPWBQqLUwz3whjqv05LzMkkV5E1
6+daKxwAjopG9C0GKWAMEPpkggMibt2LBhu/Dah4IdRKEHnnROwLqAIlwJgHqa0QR/y+xJZjYSBnZ6Um
j0FWinAJG/KNQtVoxgT0MxrYk6gyHj+J0NtnRAGOJZW6WNSEoALWZLEN3bEOieggE37dWL0ECEvEhwf7
ddxQuAOplf92ouCF4gzM9gYP1S1RLIBRMP8gEQtoBbi+wA/PRjQMJQw7QTjUW7w2ApZRnt+BegjaJGhz
VCkWdhg6qViIaRBa83rYURy6+sJJyxrEgYgO/kU6rFBwAUTnNGKojkH/61NNjWcgXJKNK4hGhSL2/76R
LoEYRAKcbwtAUHUPgfJ1BhIo2HhQR0UosHu+tURPCG+S2Z4UHcCHYDMxnJNdLOALcLC/H593uiwBdQwq
YhMo5BIKV7GLqfABohF9FbOPsfZEHKuIgRmrPYmGAeDNQctaqI6KvgtB98T7m81UCxDlxcVbrqFE14te
Cn2KAQgkuSDgUYmsWqk5uvZ/DG/wh/HxIVIBoItFlX873CyEKBwRXJVyOWY7EyNddbjlNdZAhTLoqhPG
KUnciiIvbyAsUl2Fhj45LcOLgSg2gCjeEwJTFMRoUEy6QYiuCCMo+qrCFupHSUQ4CFEQAyPbYkU02BBO
2VpCpfYa7D7CwQSN4YpJ1DOKCxUccoBuE+v3hFhDIxSWjpjCteAJXerFReHsRXyWL+x0DAjRdQTIfQM2
Fd1tb7F6FH3ix1KAi4D0ShTDRBWn693pEJjsCjt6MVBunVRF5th1voPYg0WK8CoQvgMPQldFd+t8Sx19
tBon6A5E6NssSx8xMGL8F3URxzYOCHBTfUSJ6G5VTAE+ARiIton96kG0OrWJ9O81UE8IQhMJi1UReOMV
+oPJvgHqqqlF6uR0LwGK13IuQ2UqmWDtC0C3wXoYDokJ63bMIIpRVM3BgfjecRLrzC4ayRAKMlCInFEF
T9sPAE4IISy9g5BIiWrRDM0UYICiZhgCwdq8uQFVCCxErypDaxTEkgAm9KQw2rXDA4WTBrXHBwy4ULBF
iv5IdhVV4IaCVB91DtfgBd3+IIAJxjGtN8OIuIcvg06LgIi+/xAgiNBKbgAczjYUy2y2uIit83RvIALB
FT79IAuQBHFCQD/KIk74SMPp+CAAAdiC9u8veYsVtxGNDRD5BrgAUAq1YjzxvQSu20UdKr4YGokFlSgO
QPwhiRzxrbFVVFjmGk3nOUEx1y140SWYHBiRwQE9llrjuJUCalVhCRBFU4OaxL7ngzkKjotouZ8ycKPY
AnYEl4cp3TSxImob4M2INV4KgNkEEfKMOcR1ghKGosDp9o65KO+qPSUGI0lQC8bYCnqYkwjgqUOAUDUH
cgaLCgQCXChRwRdmQO0x9scLKDaPmN9bLwIG62BXBAjrHCeIhtAyOeIHqB9YZScJeYP4rxJvE/aayesP
PMv59sQI2UjC9imRmkUwCwVtEBuAi/fQLIAi6iYO+HFDIEmDDVXNLUeNeyaoROOTZ4POIdcodUED6hno
UrhFGwrH99rABER2DURdnXTp4CENI0krtCyILQYRVf9urG5zySB1ZUGA4QR1Nyp4iWhBKh5yB1Trai/u
03iJCUKRtkjGCwf7F1jwB/bwDwVL6yjHQxQCNqDe2N/t6VURA0m8RInZHAq4I6slE0G0Ewp7UU2oEIx8
6oDUTHUyoaxZtIjdKk513is4BNCIKiD6lqvFWDIG5vy4cwFsjRAC5w3gqttGUP3nYIHlC/cQxnPfZnVb
wz80Q9cGP3vE4mLadGwbRMz/ixL9FAuv3yNcO0o4/Zn/+02BKGAHp85GJ7E2AR1AFfxn6cFXixFlkp+p
XAgEjXGYiFMgSDsurVcEKGRMUqHXsN1+WDgTD3YlfnJ9idatSnzBCC9XFAB5FHXfAdgXx0c+LUDmm5Yw
LERkySjJdXCkAiX2ZQ+B+TP9CRfl0Zx3/8HXF23Cs2/pCz3RuINNELqHI1VGnCvgCmcEEhu59tAOCW5F
ylv4EdG4JXUeqoAJxYE74uTyjbiQuAu5qE37uBH7n3LDN4Bo/bNCIIHLAcGBqo07gDQFIii0IEUQXhU6
frvRs4HhrQnZtEp4w3ANTUIc2wxWANjNwA3mDHVFEpHrOPAiaFDAP2QHWxTQyRXOS2wcPkYEN/fWgeas
rgc/x8B2rA8FQHzLm017pfZRB+u91aivSxCrYLCcT0ob3oi2IANyJnIgdHNx+AMWc1AMHUd0PTVCgQyH
X7iYW1vSxyCZBU/YdxMeMSRgEARjDYIynKm1G5XMVAQQp4QIuETeifakoIhx+wKdYR9/BLZLdAKPFTXq
rYG6iu+H5pg7dTjBni7gABRuFM+sEYvq+A83RxMKiUfAnguJy4PjjlWJtq4RRRuB41wA8CEORdiFAoIF
ogJFBgBwYGV50RXwDtaFoKfzixMFNChwxmPUMeFTh4HFEqIGobB1F81w+Ouh20B0qYMGYELEEk0etgJO
aoWht+vxho+lHvjYXbvHdeDrhAWCwIYZfZSBIBjCjFsWRbTt6yGHJUqEjYI3FZUbgls3BcE3jft/BcHr
zSJW7h90Nx6hDwWReA1r8FPxKrI9FBzAWQGDkPRCBTHAQ9uqEAADK8HgYSRKC7j81BQQOAJ0nkVWQASe
fhaezuxvOlKsEy8SF4sTXDQjHohYgBTr9w8KCmKzGSzfCBdYCEAZgeJ7+gV12LGVpOH4BAQbM0RtG+AB
hekm30EVgPrByWEABLGrixd92p5O3n+Qf3k9rnQWWsGAUupjbKMjjeHMycPRw0SWGgHBh2BPUQGqwsCA
v2rUWCx8jXH/dcH2gTcwVcNWCNZ4OoGEW0BZaOmnwIBpQikwBGgwX7EaRkcKx+KsQfgIMaytg/9OGvWA
wAGRmYHF79gnQjtAiHpIMcAs2FgiyJBc+l4ywLUSu9uJMoXVJEQDxDGYn8HSHxGA28L0ARUFqromXEJa
Cgq5caF0wOHr4HkzBfJUKtc1csMf6gdfo9/ldsAN3wrqL4sF2fggToWMDgMMToBowYDSwywYoRoEr0E3
8BNFQYDxrg4GAWK/A/JaQGMQBYj89YoPw3df0UT4el49/wFVGdJ7+gXVAnJh/8LVTUUr5N8PJfBRgSBa
uORxgSBamed0FQ0I1SP8+3UTeUOiGfxQ0uO4T2xvbdGy1fQmYYA7L4qIIVSqGAWieD4Sb300OQh6qvzN
pEgziHABqpYZqFjUuCcwaQoCtVEFCOQ9FMChU9yJh4Al2CvRasr3toNiHxDdwuXHFqkRFiomLQqZ5FBj
yhQ6BkTTcT/+rTzDC12DK+pKlscFNfCBgD4CsUMAahHbPT2nEbjawi7aba4JglYQOVtrWxhYFI19TIOw
KIMSohJBsQb2QsRNvUi3CFVTvvuhBWr0+6mLHfwGfPEIHS3lvoQHIF73mKKLLkEhwwYpVopXFRv3KPk1
ENyos4PFgvgDqAu1En1XVRDUUa5bOG2G0lC6QlGM3TDdSqPYfthasCJDFSB6KddHIRREuwYTqqgVERSq
ai9d8k8orgV33ToQ3wTRCpReizCD/lSuAk+S2UGoApz+Rm+NNY9bvf9S2WqJAtrxfOIvUPFCrQ01gf5R
gIOALgN1IkjSVgCwDMVidihqUQDvgf5gR0xQiIXv889D1S/UAl0TA0cg651fuVtT5gcrBQVxYUVhybA1
IBpKQSv1CjjZ3u5C7Q3GChHPMDjdhBeeBdj3jBXB51kDgLUjq/fYbezYDaQqFaUUyFEFgyVaAkrDck3Y
y8jAnXUuRC97NoQG2wtcV39YbwiiPGgp4LFjMj2BBoQQ915oocAbWmCmdT2+60aKysY9PhN2HkG6IpCj
wamrhWC9LOpf0DH/uAnGohlDvCKeB6G4C0pHcQkAgoFybWCjqQDvEM2ElqooGVykOe6ZooOAh2sLUkTg
LmKAP4Gh0VLEwvc366d20AFrB+qlN8OwsKBjm54dpCRYuOdzujzxGxCBxWz5kMYHLw1ciejtqG3woqZi
iZAnyBZMtw1VYN8iBAJ5QYhdaAERoNaJ8jQQdLvIzcwAdEtH0KKCHVEB9+Lw13VQrWHxNbkbxgQHDYCI
VGebd0tB7Y1B/yBGwSONBJK3jYLgAcApLDAtQohnoEvRNAd/3fP/bOjdoiBVATA4VeNYH7aJ91vKTQ11
CoBCexkcfK1XX/LbM/YxBIAFHe9fcCzgRGhZpoxqhB8UKjVauP2IClYJK97tFF+URlG4VV5tqAIOdFiB
5keNbZgdpzUmM/BSu0u1ClwyDQ0QvgCpMQi+EDDTGdGbiI5BcNPmHjnWcAyCx5UPQ95Bid45/oFBI6ak
gwXL9IckCkMABOGMkwHQnwUZN8EIQXQ8MkiNCk4v0GWAaYH4AW9VDVVV67kJiEHtTC3TpaGpCXQmIlUl
QccJKl+pEStJkCIUBW3HK73+bi7mK+Hevlb0YjQKSLtdLAphRolVyjU+Av4qehdXpe1mjlQlI4dxMcBg
OFjAFwyQVUq/Y324cvfdmiHokznHU6ekKirCCK37M1YQsTnXEYyfHbRJuWCHDWQgFhBvFE+NfDcyC119
GB2nuPYYNCGoVlWo65tzNAQRLZKjNoAgUlCK7SKqGy4DePAOiVNFlyLAX7d78PgoChhnu/e473YCbFJm
kDWNLwLiMwWQPc5Ujl4Y2wsIXBCwUdHwEyhU0Ch15X0zCBaJ+D9B2J6wAIJPMwgxwCMM5MIXFhOnlqLC
BrdsjJvoHRdcC8FenuhmaH8VYxAEpT9QpbhBWAnw1FsiCrV2yV95wx4mUQBl+jLNFXglAxkhUKiUyVps
IJRLTUQUwAYV7g+F6BV1qlOupo+iOFB8tLGihrbBReGhMLiCrRvR3dkwHNj/boMVNfC3Ffvdg4DtGf0r
eFle6yxE6yQ2+ahg6188t9F0Gt3YZhSAQLdNlCHeZg0FiRefKGBzInssvFvDRJ0VQN3sqT/6E6UCsLla
i4uPjOEFKJg1UCUsiA9oFEu/VNdQrHWpWSkirJcHAXyxi8R6gcNAWw0OLaW8p9MrU7ii6ASY4sQu2lqo
KAGcdQsgiCERKCLR7JdMuuIecyw3lLEQQITUxOZP9MFg/sWW9q3PW4ACXbi2EYjJL28Q9NTLCQKj678K
FiGow12SYhO8DY2HB8FzJjAotpKoSpUT+gC1On94WkMGQEM4A21jkYCVxX94oKXWiy+A15q98KZxGBDw
Qb4UhyiuqsBUmZk6IAAF1OVJS9VIGGOHZC0BujgVt9RVe3imvO4gwBDLcr2E46+mzljdA1NgxxOxRNde
Q0pTJ1JAAeBGcCeDC1P9AlVusUUIHkwICOtF4d2qf1UIcytEtKIWe+BoY4EW/KHNhkWRoNht7UUIx6oW
etGBRNEoTFmLN4jgANmFCdC6wKugidRyqAjKwbeqN8ggiQfT3aiihcZHi0cQSndSnHNH7kelRwSUcCXN
sdFUyaqHJ1VTF2tGpajt+hQehA0nHXQZnNoBW11cQyKgxbk/IFKHSIRj/wUFoQmV7l+3Aur00EVz84F5
1ojiRQm55yrgWcW4EKxOTQFLGOpH1/8Mu+5YRW6tlTWLDnXZUIhOEN2LMkUGGlIniFVRsKp/KWqKPrR5
E44FKyomVZHEbgcQHGqluG5ggSOAjXmQeWNTpjIUQyWKGAWxAxO/yh83WsRoSmBqJl5qTArqX3Uik9CQ
msWesckhLLN1AMBfKAR0EkoN2P0DuAR9ulpFwusVFnUQ1LNXt39E72wWRMImAJMUmsNMQ0RFgJhIVFAi
gA3XKIAHqgr5kSJi0QhlHxC7FQBS7oscAAai+ICrPcciMBi0d8NSKCQgzQsDZ60mX8KAkROtJjBXow5g
LsEEmAsOXhCrPQPDBeweFdEOuJ5NUbhgYJ5sNe7sjdS+aXvMBquu2iJcVwAJ2EnHM7qj7BW/0k0KWWBE
qTsAYv/iWqeCeDgVDjv9MNbUpAcklSnAotqmoIREdE7GGwHfhWnH6ps98rhwBESA5N4HwsG+1asldSiF
7R91HULdbRDguGAWaeboAwuYa4FMBYz2BUWYemExDwntkPjAQ1TEIVKwemPHh4ikdRG2r6yHICDcG9EX
C+i3EVHG09Apdebs74itLM24TYscAE2F2yJdAljgRepLKNpJuUhRbSkgCxQiQ0tSaVkv3yJFCqo2LVM2
6xpg7BhF9/gCLXRpgS+IqwF9OUuhEm5hIKcCGJzFTb+iqN1WA2onaqqDxLMQH3Xg0q9fjIA3o/kJiKBU
LmB6wA/9CP4+kkUC5OsiF/sEeEXRjSicCQU3At4viN1Y+DUAvLtQH2gDEBoGdF12neneLgT78KlvdFoI
/C7q7YA4IHXRipTCWjmi4OjCjSDqror4UDHAUG0xwM9JAxCngn4Brp7fSBQsBFuFfyYDgIdnDl/R4QVX
wg+4BFEETeBE0BVdfMNaoGAAIIao3gXADijmuOscFLQiYH8jG6iAFpdQD4ZRFaYOEsJ9W6KgA/oPCaP2
c9zf8UYA7r4GBL6jxnPPZlV8gQtgfwajx0GLNw2+agZdMQwXyQEFrwGk0qoAhQ7EyCQtihZ2l21BtjyF
JnBpie7b5yHrCB8FKuCNx/ZGAqUtgLZvG0YEZiUXZkocFAWiGh0He4jB98HV3LYDThmDTQJqDC9ui40O
Btg0BnGi6EwkysWHRzivYSJG5yhgQ8CxwX/fAvDBabHCM7X6oACKcBsHibAMgVzUl9kbLYDfm8Li7ELw
sbFZuAGFsap4INhK/vcd4FZQlcQQ+Qa8VBHcToCDgUcBuDTgsU9EiA8kjY4A7t2NIFzHsnYIMtf7bdsy
nMEvDCzgiAqJwTy/ReIv4T+IQgK0GoCISgHrsE1FulM9AO13Nmh35GVkEvADuASJ8U30Id/v4T81TwEN
BgLrD2JCwWAMVLrBERrWBcQ0R1MUgSACKykESSD44qirbi6BYAknEhIAu4cqXd8OUFsYgmYRP+eewCUQ
yQ5CscssBRwImPI9G+zBLoggABE9Jd4LWwyAF8+y2MzpVVUqXl2C44H7uhdjdQkCgezDhWGI/WDvgesL
G3fkTCncF8iIIt44xMnDlchCdlkABAcAITl58gEAEgAkhuywyf/+B4AAwDYkB+YzA4ABZzY5ZEMKAD8A
BwvJkBz/IgAyZCcPAgAhBw8yJIMMDhwPyMnDQgADACD//wscYUEpIHdoZW4gc2xpY2luZyBgAf//T9gC
ATdhbHJlYWR5IGJvcnJvd2VkY29ube1t+25lY3RpBiAYc2V0Owt03f8vsB5uBCBmb3VuZFBlcm1pc3Mf
RP9vv20aaS9BZGRyThxBdmFpbGFibGXrgN1g3QKIKgPbBzUDcjXbwZZ/JQeYhgOBiGm6woMHvIz9KgMR
OKZpmqasRU+SnwZZLpsBFJZvk4WsdgRYwAsDfhPu2e0QRaQDL6MH/KV7NF3XdQPsCwAHMQOcPNs1TdNO
RY/wHxq6A7JpmmY0TmiC48uFvZLNgHnQ5swPJS+w3R4nIcwredAlm213qwdy3AOTJuFgt0N2zBff3QMo
3ivruiNbA5wnGgfLA+RgzbIO5Ey2B9TlyZMH2QMM41bikQXAvkdANwNd17nNAnfmc0uEA4MPlM523WAb
Rhc4A2fjD+Blu67rB08PeAfIA6bjRzvbdd1yA5UPax9d5hO3D9Zsu67xA6ULhPUDuncHC3L2CwNa9geK
A20GsAOiE3IkAjJY0216SQNrgAe+rNAgCwOqAwGwb/KxAQsIN/YCeWQDuQZrAg+VPbBFF2sCP8GaZns0
NwM3PzoHZIMdYAM9BzQXAtkANkIrRUdZCOzAA1onA0PWHBVISxNODdiAdQNRD1QLV7DLZdMDQcRGJUcR
RQv0TLO9FUsD9t0L2XWdK5IDB68DQQs6TAttrjtdB3wDbP4jT+y6z2wDEwtAB1oDCVC2XYG6DFHyB2hU
AxQ7ebbrB/IPZ1ILH1JxA6b7zLJwU0cLvgd5053sun8DfgtCU9EHh53t3G0DXAOkW4MD9GAP72uaZtsL
BmEDGmUQmxPYIMuupwNXXSaUC2CPAAsD9FwTNE3nXl9j1wOBkqPTNE3TtMXR3+2maZZN+wlkFyUzzbJp
mkFPW193eJE2TdM0qsPc9Q54aZqmWSdAVG2GpmmappyyyN70/9/E/y9ydXN0Yy9iOGPvMDA0MDdhNGM1
NmEzYqW3/+1kYTESNjA1YzZmYzE2ADU1NKiixRbtL3NyLD9iGvybi9YRC0gFbW9kLnJzZov230zzLiB0
byBsb2NrB2h2e4ttIFdkZjsgcBdhcw2thdu2Ly1qbhgxErNb/BZeZ3JhbS6VSWYRsW1fF0Z1I3ArdEZs
LYZ9a2REY3VyLBy9wm3tFpR1Zwg/YDsd1m3hl3NgPVBacP9vB7aOdEhmJG0gPGh0dHBzOi8vrW3b22dp
GnViLjZtsnRfO27D2hada7dIlnMv392+xzVzPi7dYmUvY9FjYXBhY2zb4hfvb3bnZtV3+vaCKxQl4TZh
d18XZde5vyfvv71V82IEdHJhtEDoZToK388wCgkdILe/thU+7BUfKGJ5FdtPiPtf2A5leA1yCiJCb3g8
QW55Pt2sof9QtyAnTnVsRblyb8IPNTSLRqdUaW1TI6MR9k91dI/XZCNsZI83D7OHDXYg0wMPLSAA0Aqb
4zw6OgwEbRyecXahsJE6WHdjIA0+4WHYljkWcs06guF7C21wrutgFQ92dLRGR0PVbyx5IRf7LTRqVG+w
cithdDDB4bYBZvttEAbZWoejQqW6SHMwjWxzF8VmaWF0ZDCw5jadV20CIGgeMi44e9kXai6cZ2U4btwc
DWd9D0DabHli2K9QeH58jwZjaGYSNva6nWSsYy6r9pYq3OFndYxHc6vIwmzCsSEhYAq3wKw5N7K3fNVb
fhGsKUe1WW1bbo2NrqhQb4xl4sJyeal0GZGd7S3ARb+Mt382Mjk5ZGI5CTgyM/MwLjQum6SNsTEucyFy
xQEApkqGKgACnSGZSAMECguFgD1VyXi60Dg1OBm+YjutgXVYiHZybp797VVotBzDNEc1GC7Dq3TuP6Ve
A791b0gxMAAxMDIwM1nftl9gNTBNNzA4MDkQMQAyMTMx29pf4DQxNVkxNzE4MTkiEDIAtYULfzMyNDI1
MrM3Mq45NLX/t60iEDMANDM1MzYzNzM4MzlGWKBtrTQiEDQAjza11toXkDQ4NDlYRjQi1n6BthA1AKc3
NTg1OWpYG2ittUY0IhC8NzbWWmvtODY5fGpYRjQitdbethA3ADg3OY58amhba61YRjQiEDgA13Vd1y+i
OX45Wjk2ORKE2QgB9+gyFqO0Nf1uJ9ojwQoNLxI5ZxEPTKYGZi0ucgEObcdMES8tDFsuAF2vYI2EZ9Jl
/8ABh2A8VIG2Ca3UERFGpAd5W2uRloxp+CSSJiAH+cC+KXpgTGZtdAQPyLhR/BUbGQMSF5QOFksLHGA8
BhNgB90IA4wr+wwdHBgaGwXAncj4vxAECwAJABQADboPErAP2YQOHx5JRmYdDw/shD2KPh5LUw1nIyYb
O7BCDj0FIw91DuwD2wItH4JOPA5jBgd7KAZaDYE2CsI+YRMv2AATAAiH/7vLfkMAcgCJDgcDfQUYPwA3
hwlAZDUhkgXbQe4HzBFJAAwAMABcB99FRf8Zd3EAYEc1RIg5EWUsUZmiGu5ef1AW+u3/v/CdKjoEOISI
XytraV1PXYSAKmgUElAk7DsAF19Mzw4zxVd/D1kGJm7fLvuEG/htShwsJAJ8AFIA//+NxHsGd0gEfih2
J2wpACJbDmENVt/9HfxwYgSFIHj0eh55AVQAMx+Gc1gATbhh+/ZFbwtqCjJsTAD4ipeKij5CiImMnw3H
QQYZ7EAHtr+EM+LJ+APwB0cHeYw4uSUAHgA4eOzZYCeAfw+ABsD/ec+GDfaA/1CASCgBIIfwbLCAD6MG
/H/vBgWMeGF5gAmSZ9EgtjV+B6IyQLIDG+z+DyDnMNpc4h32A8DRAIRccMAiXgiDB+Aj8Aw++wT8rDBg
DME9Bx4ggEXkkUHA/iH+uWG/gbNgRAhoSWe3cod0Au2J+dvJgM8Y7LP4B+C8Dz8h5Dw7kR7pbQPnExDA
n586IWAH4cD779PAP1grAwWMEI74n7APL1n/AwDA///RC6FvwoMXAV13GsKzgAdAo3JO1YzBntEMH/gP
FxgxbhKOETXDAfwfYZw90gsXwB8fa4DvH38fCN9ILxGGOQL1AiYwgieM2zt+ZrQf/G0DACjvBjsYdfDP
nKA29//9IUZjxtkQA5l4C0QT7GODDMDyB4cBBA4Y2WBnHBAInxAgFMEI7w/S8JryH9/g//6hunD2bEvn
IC/IMxawIAwSn2mA9z+hQP+DcPazyIDTQAIXUDlYOzv2CdH9Zv5I+HkXwOAL6cEG/gf/fwAmYCc8woAw
mQOAbtOHV0F69t2Qan/lH/ifDvmllRDOIIinPLBQPjQEYbRHQP55vxF/g50w253BT9AEoMMHPtiEoPiS
B//7viEaLNgR8fwAoC//z9gek2FDKvtRAP8wwCJgAI3//zdm4hIDBQUGBgMHBggICREKHAsZDBQs8C/8
DRIODQ8EzRISEwkWAReTAv///0sEGgccAh0BHxYgAysELAItCy4BMAMxAjIBp6r///8CqQKqBKsI+gL7
Bf0E/gP/Ca14eYuNojBXb/R/id+QHB3dDg9LTPv8fz9cXfHt//9fteKEjY6RkqmxurvFxsnK3uTlqQQR
EimtW+Bvpzc6Oz1JSpqOHLQd3WK39sbKzs8cGw0OHRxFRre//bYdXrSEkZudyRoNESlFSVcOjZFbW7a7
qSzFyd8r8BETEoC/3f7/gYSyvL6/1dfw8YOFi6SmCsXHMNrbSJi9////283GCElOT1dZXl+Jjo+xtre/
wcbH1xEWF1tc9veiVL8UZw1tcd7fQtu3/9Yztl99fq6vu7z6HB4fRkc0WP4L2/9aXF5+f7XF1NXcWPU2
j3R1lpcvXybb/7/d16evR8fP19+aQJeYMI8fwMHO/y5aty9VxVsHtycv7u9MNz3rX2r7P0JFkJFgU9DI
ydDR2NnnAv//rb8gXyKC3wSCgBsEBhGBrA6AqzUeFYDgAxkWFv6lCB4vBDQEBwMBkgeQUNHC/yXrB1UI
AgQcCgkDCKUD/aWK/pgMBAUD0A4VBToDEfu3uLQlBT5XB2wVDVAEQwMtN3+r/0JRBg8MOgQdJV8NBGol
gMgFF779woKwvwaC/QNZJAsXCRThDGob7W/tBgoGEg8rBUYKLARQBTF7t7G1CwcRC9usGh9BTARJ7bsA
anQTAzwHOAgm/9vf/oL/ERgILxEUIBAhD4CMuZcZCxWIlAUvBW9A9Lc7ew4YCYCwMGbWGgwX/m+lBfYC
tgUkDJvGCtIwEPADN21to/8JgVwUgLgIgMd9BFtNRr3d/gsVBnQLHgNaBFk3gxjaFglIsLX/vx2KBquk
DBcEMaEEgdomB0dFpW5vt78YbRB4KCoGjICNAr4DG44NAP+/o9v4AeMCrgIKBQsCEAERBBIFExEU/3+h
8QIVAheoKAUdCCQBagNrArwC0QLUxo3//wzVCdYC1wLaAeAF4QLoAu4gKPkGrPgLX/gMJzs+po+enp9k
CTY9PlbzvPGNXpgEFBjqVle9NSbgEodoj2RsIp5+fS0ufKPRXAQ0GxyoqcIJN+FvhRbRqN9EZmmPkm9f
57/w/39aYpqbJyhVnaCho6SnqK26vMRLDBUdOj/qb/z/RVGmp8zNoAcZGiIlPj/2BCAjJSYob/TxX0U6
SEpMUFNVVllg8GZrc3jj9v94fX+KpKqvsMDQDHJEy8w6XiJ7C7/QUOmIZZ8vLoCCHaQP9gss/BwEJAke
BY9ERCqAqgYkDnzhwv8EKAg0CwGAkIFnFgpGmDkDY/hGhS8aMBYFIS5lQDgES63wrVCjdeQHQCAn6Ou/
1FvpAzoFywgHUEneDTMHLghsbK30CoEmHzVEToYbTr+9ERHsQw4Z2QZHCScJRmG78HULP0F9OwUNUXVm
u73wrSmAi2AgqgqApplFCxW3f2N7DRM5KTY3EIDAPGRTDISgRW5b47cbHlMdOYEHVq1HYgMOv7CR2y0G
JBkZ/jINg5tmC9v/b1OAxIq8hC+P0YJHobmCGyrLYNs3CtsmCi8oxKdbZUsEEhH/xv+FQMaX+AiC86UN
gR8x4wQIgYyJBGuFIPrtBQ0DxhCTYID2HKm/3fhuF0aAmshXCViHgUcDhUKruN0WfoVQK4DVLRpQgXDl
AYX7bxsXedcpOgoOgxFETD2AwjzEv33bfgRVBRs0Hg6zZAxWCk9dAz05Hd1to7UNDVfEBk+D1hMLcJtK
jQXJGSQEOLywLRVeGB5Sd3gXphEEBF+CvwEDDQaFamJFbiA8Pf+fe/C+KJgLAFplcm9Ob25lU/1Wrf5v
bWVzaGlte2d1MTI4aQVv9coDhINvbG3eeluIfjB5QiAtPghfWk5VVC+oxV09cKp5MZxrwUsGBrxyA6dj
Q5xqrKxCdcDajrWzCk0iDSB7UXuIBf9fzwogfSgKYXR0ZW1wdBULPsAETVl1cCcE+G0beJ51oHVzaXpl
Stse/IZwPHJuHsBzCW0sOFXY4DqI2d+2bWhr9y6ZX195KCk9QajbHmxvM3k7A6XC6AqrBMgB7cKIZETt
Ty6jRXYFAj/BICpGs8MTPgeNCTvia9NFqVA0SW4qhfhCtAfRaWREaQTF/hSGVR0uVXRmOB3AtyyMG18p
X2UPXwtCA2ubd7V7QFvYJfZlYUxkNDHHhXhxOXRhIUZiQQL9IFVURi04PdZao5UMCigLUTgVAmWGU0bD
GAh0oQIGbHOCEeJArw4D3WJvgxGpYbxJTyD7g60AIzrEOva//f86XyRTUEJQUkZMVEdUTAdQQ0AqJjw+
KCxqVhhhFA0tvbRttnXtbmfRcDEBNvRCreP2x2FjhT9bXW97Y5R1Vn/pn/E6I30s8nU2NHUzMps2dTgw
eF/b7hVgd3YwcycuACGZ7Vu2ZmFmaWxpCmkVj2a6Imk4LmAgte1SoUhs/SArAj2SbS9cuA5hZnUtIotu
KHANeW+ut34Eey4Qdm0uHgFfUlKLsdS2XwNBhqtzoYBABzpEMyzWaG2L1Qdj4Qh5YgumwYL5cIn8bNkj
TA3OZs9uK41Gg9onH5qdsTaiFUvpYdCOZWjsWiO3c5xveRqgdQUJ36thP15/vCTnYWw4YE9wEmtt+9Zx
qXdyYXBwYIs9SBgR6Gtg+2ArwNnW0EorRm0cL35FRoHSXxsBzci1FmtpMopCSI+lM9FufWW6fga25k5p
bvWn+G5aCwh0oiAZparYVCNauywPcXUWXBtDGPVE4flzCgVaidETMxo+tbDmoTDMQngvi35g62Vk6XIk
AHJ3yzaBhsBU5yGstea2KHRESUEBI7ZtLBZlCXcebApy7Lnu1pQGdCCuZBkYieZ2HxT6a6x3aLMOQ2Eh
CI0uaI53W2tfdAkKzujZcmZpbWWN/7dJrr4KUlVTVF9CQUNLVDFi0If2Q0UwPB4eZD70CkuIPQkpC8Rh
46bb8WVnb2J1ZolyRoKpvZIsWBUG2F0ovLBSPTHkPnZpsRkctERuovBAYYaFAu5nSwM7bIgTs8miYeUK
TRRH2zK45JqEIDG/J1bYbm1pjWQsZxPd2vaKYCVOdpX3c2Xio9SWVv4SQF+oZG9Hjl9zvnJ0Xx1ISAzK
rgOPYXprP2vBd24+1VJuYWxqhncIa2UPRCIYpwgn1AS7MCbRrgtIaEVUcqFVaG/bp3JFawnTKN5n1KN2
KEA8Ojp/LeMCi/4nEnpF9wIDJycsN27gI53RxRZOVDlM2lMdhFpoYQdnEWR1Rop12HVnIEkL6nUzAnYK
sqt6rSRcrC8bs/wAaWuhfNkhrzAQIQwL0ts8Ao6EDSO7FkKGoRIGjDhWwW3tBGBgeedotgaEd3pCeW9w
vJmRgRkvWsnpxm6Jh55aHQ5kOWnmQg2LNecL0ArYpjZwXBR0ZUqYFZxOkGKDwKKD0hAHwxdz4bC7zfk5
aXAUZHJzfg0LVhDFFIhgGTDLnomkgUAYFyC92F0IRDJmL2RwgTAMgSSdJUbFtoJVd3A+J+AhfA1mCSgE
ICmRQKxDj1JEjx4CDtpuGCuPdHIQHuEsynLMdXJlw7KqoQ1akSKPmhGHjRcghS5i8BCvXHhQAT+GwAvF
ZGVkiZtudXEIawKC3XJvDazY48OiGeRgTGCAp0yiUaLRTmAoBuJULVV4o6UOZ2h0Cw4gMt7s7hEZYCwK
FAv2cCJYtKedACXHw++CJaqeSEh1CmVPfWFKRqz13e17qRdONMbFdEg5vGVztgxGQsY0WSHWLlqebmdE
76q1SwxyUG+BK6s5aEPVk6y0f5glrFTZnj9Xk/v7b25PT3NtcvRD+zYmG2Fvbe9VVEVAQwc2YzJ0UnMQ
c/aMywqbDkGlTm8TLRWJGLQ2VSc1jbQmQgdQBkEfRanD00geVz5Cl1xjSJ0GSWhoFyU1wKlXnyJJswUs
rNNP1sffCgzrDbAtQmRvd27C+hZGyCJvTJCygNHeTpFByAxCT/zGrMPgdGj6ZS1Y7AKcVoPnbGWMLPaG
hTaPa1s3904V7nNkPU9uh57hUdWxCHJ0aCttH2UlLnNfsLIjPH1w8mVkeQ242I7mX2F/X6nMJvwS0ALc
VPpfTUFTS8Lql3joNU5OSU5HMw3MVhZPRcdE17ZA6E9ORahwX/RSAjM0BFNCoTqgNaMTawluDmyN5rcJ
cDlyNAm5Yg8CLbJ3lAJYsDfajv6tE01OKHm+U0lHUElQRb3bZA3YDl8CTimptoRSlxFFCrxrkWixCrAL
m8BqHG5edmUxhjgIQjA2GF+oOMwQRLKREAphEQYhISeiFhJYs7tsaXRzVY9GLVazOvoUmczUrOlmL/wA
DpUHUBrsQLsSJSfQsWC6nGJqVWcuMABEqlsIkDxjeQYME3oxtTNf8FGycHbgXmxcwrYYb1puNEcHvmoO
1TD1ZZeGobllNEEHpKcKNpjBZb04cNAm8E0TenPHGK8WKXCCR35fBawVFERgbNiN7R/6bQFsIKUhC8RS
jX2Ur5iarisRjwc+AzcwsGesaSkuXV8At+tmYxDeaZdPAFMgUkHicyThxkcHDDwALlYuPo2t28Z1inU4
ZC1kACwr1GLfVQARX1/rZw5QKLRCCRektM5ONvazLxcvMC8AiS/wp8LIIZFzAFpMSQ4FsAMdo/HEFqAV
gWveZPwRwiZ0KnOlL2YqvCTMLZoLJysYPVJzbW6ECa7rachlJghwwutMDM0IIOEU5YLNFgArJYENLOB/
qyb//yeyAJYwB3csYQ7uulEJmRnEbQeP9P////9qcDWlY+mjlWSeMojbDqS43Hke6dXgiNnSlytMtgm9
fP////+xfgctuOeRHb+QZBC3HfIgsGpIcbnz3kG+hH3U2hrr5P/////dbVG11PTHhdODVphsE8Coa2R6
+WL97Mllik9cARTZbP/Cf4EGsD0P+vUNCI3I7jteEGlM5EH/////YNVycWei0eQDPEfUBEv9hQ3Sa7UK
pfqotTVsmLJC1sn/////u9tA+bys42zYMnVc30XPDdbcWT3Rq6ww2SY6AN5RgFH/////18gWYdC/tfS0
ISPEs1aZlbrPD6W9uJ64AigIiAVfstn//wL/DMYk6Quxh3zGEUxoWKsdYcE9LWa2kEHc/////3YGcdsB
vCDSmCoQ1e+JhbFxH7W2BqXkv58z1LjooskH/xcg4Hg0+QaoCZYYmA7huw1qQPxv/H8tPW0Il1WRAVxj
5vRRa2v//6W//hzYMGWFTn3y7ZUGbHulARvB9AiCV8QP//////XG2bBlUOm3Euq4vot8iLn83x3dYkkt
2hXzfNOMZUzU/28s/PtYYbJNziw6gbyj4jC71EGl30rX////25XYYcTRpPv01tNq6WlD/NluNEaIZ63Q
uGDacy3/////BETlHQMzX0wKqsl8Dd08cQVQqkECJxAQC76GIAzJJbX//7/0aFezhbQJ1Ga5n+Rhzg75
3l6YydkpIpjQsLRUxP//qNfHFz2zWYENtC47XL23rWy6////Lwe47bazv5oM4rYDmtKxdDlH1eqvd9Kd
FSbbBIP/////FtxzEgtj44Q7ZJQ+am0NqFpqegvPDuSd/wmTJ64ACrEb////ngd9RJMP8NKjCIdo8gEe
/sIGaV1XYvfLdoD//2/8cTZsGecG33Yb1P7gK9OJWnraEMxK3Wdv37n/////+fnvvo5DvrcX1Y6wYOij
1tZ+k9GhxMLYOFLy30/xZ7v/////0WdXvKbdBrU/SzaySNorDdhMGwqv9koDNmB6BEHD72D/////31Xf
Z6jvjm4xeb5pRoyzYcsag2a8oNJvJTbiaFKVdwz/////zANHC7u5FgIiLyYFVb47usUoC72yklq0KwRq
s1yn/9f/////wjHP0LWLntksHa7eW7DCZJsm8mPsnKNqdQqTbQKpBgn/////nD82DuuFZwdyE1cABYJK
v5UUerjiriuxezgbtgybjtL/////kg2+1eW379x8Id/bC9TS04ZC4tTx+LPdaG6D2h/NFr6/8Uv/gVsm
ufbhd7DaR7cY5lp9cGoP/8p/4///OwZmXAsBEf+eZY9prmL40/9rYcRsFnjiCqCA////7tIN11SDBE7C
swM5YSZnp/cWYNBNR2lJ2////9+JSmrRrtxa1tlmC99A8DvYN1OuvKnFnrvef8+yR//////p/7UwHPK9
vYrCusowk7NTpqO0JAU20LqTBtfNKVfeVP////+/Z9kjLnpms7hKYcQCG2hdlCtvKje+C7ShjgzDG98F
Wv/fLvWN7wIt1BAIABgIBAgUCAwIHAgCCNL///8SCAoIGggGCBYIDggeCAEIEQgJCBkIBQgVCK6K7P//
HQgDCBMICwgbCAcIFwgPCB8IPw0g+qkNUA4QDuX/27f2DXAOMAE8DWAOIBESAA6ADkAOUBLtb//tBA1Y
HQ4AEhQNeA44ERIMDWgOKCG3//9vJw6IDkgOYBICDVQOFA4cDxINdA40IRIKa/+39g1kDiQxNw6EDkQO
WBIGDVwdiHsDaH8SFg18Djwxb2wOLEH92/9bRw6MDkwOaBIBDVIOFBoPEQ1yDjL7v7W/QRIJDWIOIlFX
DoIOQg5UEgUNWh0u0Np/DgQSFQ16DjpRZn8OKvT//9ZhZw6KDkoOZBIDDVYOFg4eDxMNdg7/1r61tjyu
DWYOJnF3DoYORg5cEu1v/+0HDV4dDgwSFw1+Dj5xEg8Nbg4ugd397W9yDo4OTg5s5w1RDhEOGf9xDjHf
2hKugf8IIZGXDoEOQdfubt0OUv9ZHQ4C/3kOOZH/fPe3dmkOKaGnDokOSQ5i/1UOFQ4db+2u3XUONaH/
ZQ4lsbcOhQ5rd7fuRQ5a/10dDgr/fQ49sf+++1u7bQ4twS4OjQ5NDmr/Uw4TDhu3dtducw4zwf9jDiPR
1w6Dtbtb9w5DDlb/Wx0OBv97DjvR3/2t3f9rDivh5w6LDksOZv9XDhcOH1u7azd3Djfh/2cOJ/H3Drtr
rfuHDkcOXv9fHez/fw4/8f+3wl3/bw4vAQcOjw5PDm4SkAKR/////wKSApMClAKVApYClwKYApkCmgKb
ApwCnQKeAp8CoAKh3wX8/wKiAqMCpAKlAqYCpwKoBQKrAqwCS/z//60CrgKvArACsQKyArMCtAK1ArYC
twJuuf7/AvACugK7kr0CvgK/AsACwQLCAsMC+P//t4DFAsYCxwLIAskCygLLAswCzQLOAs8C0A3AfwG6
0gLTAtQC1QK+2Pz///8C2QLaAtsC3ALdAt4C3wLgAuEC4gLjAuQC5QLmAucBQLwA2OkC6v//rb/L7ALt
Au4CwPAC8QLyAvMC9AL1AvYC9wLR/xbw+AL5AqEC/AL9Av4C/wIo2IaCfz5lAAuhYQVYTWKPDSXaDA0b
cw1HCnrYgR0wsy56QHpBddmFXXpCekNte8TZY64AcmUHJSoFYESjsmF0pJ9XRICzR2lBTPXBqH8ARFdB
UkYgdaYATEVCaMmAWlBuGjAE6A1pNjRft1phjgxVaCc3GJEwvbdzDQuj7ztrX0ZPUk2vcDP21SxhM5Kb
AOgt7FJuJzNldDJCuFauykZ2EXaAYBW7629yrRIWRsEglAJJKhbZN4WoVKRmLzz2prg73PRlclLDQVRf
HBStELFfGbtHpGiHbUBlN2bLeloBVti71w2EIoEd4B0dsNkT4G4+ZWQqgw4rhlULfmkqTGCAqxxZUMJO
7m4u5cJ+Uan+NwAANwJLIYQHKzTbQnRs08/SA7ajupNN02c5tNErH0gFEF7ADxv6EwgzhuKtI2wWazxu
EWVr7duYyDjA4KD9Lcfg2LtWqtM6IF9VCF9Cd8BhMKIot7A9JXCJBmzCKQpnLyDirblDJJKQ3jJBl8AU
kWlzb0h14SReYm/2b20lAVrrujIsGHQhwxEqEtlSbQpXPdq/9HfqcD0weCVseDkvYthbsI5zmHNkYRRE
rgS53OKmYCGwIcWn4IQBdrCQZWSPF+wveztHI0lQKGspID0+IIErfQlaMoZ4ODZf0aCIVa5S3kS/trkG
ZphIXwI6YV31YO4gLQepLi4vWy0q2QscFIUu98bDHgZSRi5o3AB0cvyA18JHYeF1w2JPZAHp1cgvh0/M
VGddQV9TU1KbKf5XZEVIX1BFX2kbbEAzIkCPw6xqBPtCYSAZFuhboWFgMC1KkQNzmaZZNmF4ZGNikKB1
rosPA2IbPqBgG0ILFDim6W4tPAIxMAMxMjzfb5ozNDUAeG1tMAQxMvM8z/MzNDU2N43NYs84OSwyMzG1
i42NNDE1MTZVMOnTLLsCUwMw6yAQlYiCTQDw6oym6z7TA9AjsAegA5CdpmmagHBgUEDXNF3XMzAHIAMQ
APA3TfM1XeAD0MBD6enp90zTNOnp6R8vhGAMLKMtG+zZrpvIHxhjKOurOOtzBmua7kgDUFjIr9hg3dnB
u+jqx/gDCNe5r3vdkAPg3wP4E+wb7jNN0wMQGCAjmAOapmmaoKiwuMDQ44EJ92cDIFJrlV3GAohzHKZH
PYT2cG8QcYwZJhM56p9vGNnjlERvJrSsBaQKYC8m8SDs+C9hbHkzbBjKL2APQO0zA1zYzrAw7q8P0O4D
UDciWNPAQB+KVU5EDdr2V0lORGdSBd7uANYWjFN3X18JE2hYql9KX+UoErYGv1w2/WdOCgpkDgKPWiYR
X8zvrhVE3FuE8MsDmqZpmmRURDQkFNN03WcjBAf0A+TUMNM0TcS0lKSHspd1JGVwhCkKrxYhAw0aXrWF
JXsHJhA6N6KEuWIeN2uFLlaVCAdMhQrwaDYSXEJDDBaDlJU6GeRvGw9IB1VGLmVoGXLxSxJ3cV9oZOyg
OPJ+ztTU3/NH9EMDD1j1wbruwgNoF9gDWB9+puu6zAdnF1oDTg8k9S3Q5sID21H2S/bQsweeH2NiHgAG
LT6daiQ0I3MfIJ3RJPoEKCltbQpPYG2AJw0pQ0lFEAQqBBGSsGAxA1kS8RevMnjoMZ8zB0R3Bg/EAtFm
hXIG4XdgYMhrIDwgMjU1sUpGk3gmICIQkCcgFsOnOStVdrtVmgv+/639A3WDDdn+D8wHvwMRDigLgUMD
qem2b2Bl///u/wfhA9VdN2SfD0UDU8PYK8kdHvRgH0ZERT+l4vCdQEsAE2lHjAZD4HGSvAAnmigEKUFx
ZBthBDAuLzGa7XYKqAOP0gQDwbHrLuxnD2IFAzcXJgPNthusoR+VEz4GAy4f64bsMw8uA7IXBAPgRxWs
Eh8HSW6hgJ0syihpDKhuwFToMCf3n0NGQaUqAAWdexMwWqB9wjHJp3e2cmWxVx3nJzKEBDIENDcWbBkE
2jwqwIyWamV0HYwIvCDkLq31u8DeYGJPCgAAMigkqexln2osdmQpdwmwrkxZUWV4CAwLYTJ4z3dAygZv
tmZpbuAqC2XhR3OpLEZwb8xIZMFaZP9URSm7IAs/Ms/hLSFkMrAtQW0YZAFvPV9jgg3AKF8fKrZKBjAX
dTxQLUAIHyrxAYyqPJlpfQu5uBWWCDxw8mA+MIQi8Ch+MCnMA0JHNlh+IqdfvwUBll0oCl4SWcKYY2a/
ylYZy0EfMpQAW0IyiALbCITXt2aPhJBWljriBcIGIMd3MwXIljJvkrjgMIAFbyg1y5Y9sBUKCnc6hUAe
YHcKAGEDbJXqMnKMl0oI30RrMBLYCDJrAxhkgYfrwQu4UfVlZ++QLUuETJdC7bJkcChML0FUBAtt9kNI
NjQzMc9f4GxhfJkKv99kYoDEypU32yjYSjYjWHALkcHuJZcrCgBSUgYBg4glpWjbyhsQbQELYcMgZLXd
FSXsSGAOKEpG2MGGHfElZBpHh4E9aB1yyFtYKVpzF0tTGhdcgcOvKcWQKCkGBGxkodHucFChCx0gKCS3
0O2OEzAyWBoMARdcA7dZNk2M1BwChAQDB2vINE0DBAQ/nANpus2yHAaUFAcHBwgVbJadAwwJfDwKIS+7
UkcDLAus//6Ott0EpFssDANUxzNbR7tEBycNAw4DEQ/WdRf2Lg4DmB8YAwMfCDpuDENOJ3TebkoBreDa
dQUDgkFAIpav1QnECY3fLhWoYJWvugAJqwOQspgUhBgtfmbsBTAk5M59iC9CwOcrzKZpuo0GdAO8ZFSQ
RhaSzB/397UXFoQ6OgrDVF5qQK3ERV7urg5SmyHCEjqslCH9TGfoQyIXAzQPZCODdd2FA/QXFAMkH6I9
2yy3JAPZJqBPJw8wI90C0YUDpy4AA2i77LqzJh9TJ2cDzihgJw903YU9/CID4hvYA8RtIwneUyf//78K
aUVAgiPaYWy8vH6kZe0DT1BfZmLENJkIB23lyG6FFm5Cdxt4E0E6BLBlG5scA7BiZBy3xsDqAa9dApPJ
MEt3levIhzrEirSIQzfY2e0A6SzrWjMDEwcAA9M0nWHsMmcDsqDGNNvuZOksFAutMQObj9M0TdN8YUst
GHQLVED+lesD09M0TdPAqJCFeqZZNk1nVOUvXUrNsmmacDcW+i7ewjZN1zXJD60DkYOuLqiSi0qVMxyq
ZByvLccDxo6OphqECyQvQTET0zRNd6gDopyWkJruM01ybCNUA4qEaZqmaX54Zra803TdsuYw3AfUA8vC
DdY0TbmMg3ojsDcYTdcHpwOelXMSA2NnNk3o8Roylx00r1/XNJ0DCwI4Ey+vM03TdWcjsweqA6GYAnVd
1zX5FyYHEQNfC4XTNE3XB30DdEc+Nem6s00swzIj+AvvA+amaZqm3bGokZoGiYBB2yQgoAPDKHyN60oB
w+mxp/wDpmmapuzczLysmu5nmpyMI6w1DzU10zRNZwNsXAwcIlaHACLgiCVMtHx/pzokaNiQs3tBdsQS
EeR04T492roApQkMKWOpSYR6xCv65xdNiiDUbgEUkQiCDCBFsKIhptNdB1sgIXCYOBc2nWHXbQNYBzgD
uDl/A3h1Xdc1yBc4BxgD+BvYXfe67h8D+A9YIwvWB0CXXSuIQ8EDAkJjQV02WwO7QAMlhj/nPtgtFZ0j
qTUKA2s8qWLnakc7nwOOOp6OanBdH6E3GUaRNgawhFJ+l2USbDEIUoQXUzZLYF3yZBw3T3TosAQAZfFN
SBY1vUUQnGBgg4Y/hleiGBnhItEPNykMBAMX+jMpYjN4AGFkIic0L4mFBa+BU2kWCQjYemXHdA+dxZBM
VUWDUKMRI4oPe6dDdZssWR/iLyV2L40EaAe5AEE1d2+jUtM7cwcDZCkKe+N/ZJ8gISIjJCQlJVEnJygA
BmmapikqKywtFWSQQS4vg5d9Rt9//P8Au2Rz2GwjoGOAYwsDwjZNcyJLcJZkG+7YHNgD4gxlJzBYKxwt
W9kCIAh4eLPov9AAupBJTkYATkFOAKFaqFC+tzMtEu3D61wiGyj+God4OxmwwbrKAxUHhwPKdgAbCDoT
uXU31vSwVWdidwd2f667sFeGdi+aJ0NXe3bAuikXo1+1dwfUdn8ZzMALf3R7A4+/cdmmoJZwEzBBMzQ1
Nje28MZLv0FCQ59GGQDyGQCCCQeAHPHuNoQnbgv/GREKH+w9m/8DCgcAARsJCxgGCwYzOe9lBxYADjkK
DR/A/pqiDeQJFgkADh/ZgE1ZAAwLEwSYwg47CQwcDDkQA0DAKNH2FHbYWA85EBwQObCTDdgSCxEECRIc
S2F33QIaCRoaGkIfYFfZCQkAABQLsMNONhcECRQcFDmdbMCmFgsVBAkWCnbNhhwIqoBfG/y6EZnAA4AP
TShWTiJ4GQDngD+BclVPmkls31BBIXIVcc+iBzcqTpVvbSIYxKCe9gASO8SAeOByZRVle/otMkTrCXR0
eQBQSNQhg3AATwuheq9qPh+hxwhunTMgTWNoX29yVLJkBJcZI1HvCcAARiEuAGIIdaBWrLsh4kFFkB8w
QJ2qmDllYkR37K6DdmnFTywD4MWITMY7rKgt1cdzDTiggRK0DyZtGahlh0wlo8rEtkX2coV5lDArOiSZ
AIUXqo3AK5FDTXMtAXeCZm5CP/EKs9ltLYJseeFaTwAOQwp9DVhYFb/tAEPpVEDYYIInZXI6QC1sWHws
ogdE+28ASHp9y6iSuYMMPaIeWNQAQUQAQkIQbslzxC9P3HUbFgcbw29yEC9owV5VWhcRBCNk3xlpcmVk
LwIiJuwlxElzDlQSESI4uAh0VLMgRbQXMH4FI2IITaNN2BCstAhNc3TxC/oFvfNnAFOGaWOnKEaDFhLu
HwDcZIfKJFQILPaIlkd5snb83M4OQoNOb4lkFWNy2ZewKwSfcyDWQmFkHlGI2hsx6d4YT8KTkkJhZB5G
aWyRh/ctC3ugczo+ACRjYGFZFDOqIJ0lpBPVHnXgf2NAjTnoY+czUKTTQpvYJONlLFmIriMmY/psEkYu
ZEAwhJyGwZ0mUccI2sO1zXTSNEmoM2ZRCQ1wH9ptcefrFyMgwm7TiEERbFmkaMclNAvS45uZZC7gsDB7
RuUCTKmcawwLEIDTY4SFgNbRXdRs/yEc7BBRoQBGfnE4wWG6BxncQtWCaFvpdIKxjCbcFGluBL+2hGCD
oU3wm3MiUDhOd3Imz1Wy2SFgTR4ECxtIghZhs9gkcFM0RBmFyRJ2Tg0+ZhawIYXsaWx5K5sc1cFiDQg9
AEGN1gJYHmqBPCANS9Jya/4P/vXsAGtfbicAQ0UdRlZE6GxZEIh+S2zxw5JVHWlzhBNUbWBVmVUMgA4i
LR9kGzGEasJhKhAEgIC7D8tOL8LkT1IdWZFpYBUZ1GVqRDpuZEmvLBACtpfEUXUPYR4RdGnG9St1bYxg
EY4yAFf2EvxUbe1gTdBpaCYgigDwhos0CmCjCYknVP8Z/f+tCJkDEUscDBAECx0SHidobv7//784cWIg
BQYPExQVGggWBygkFxgJCg4bHyUjg4J9JoX//6UbPD0+P0NHSk1YWVpbXF1eX2BQo12qQMuNamv1ueol
UX95ent8SADhZmQn4MJ/KoB7X192ZDFfYxBvBCdTwGJOTlVYTVE38V8yLja7GwM7Nza5XWoTxNToVZQy
B9bpus5tYtTLhOoHG+QH7Nk2tWzE8jzNlPYHfO1rmqaklMSsF/cHlwwtm9zk+RTQBv3/TdMsu2QHxBO0
9MwEW7dplhTkpBQMDxUHLDRN0zQkRERcZNM0TdN0hIyUpBaCNk2kvFQYfw3t2k3nDwckJBn9nwdUGk/3
ms4/B5R0HweMHrlu0yz09CwOnx9vbJZN0wf0XKQkxMQo5DZNs9zk9DQqH3Zu0zX+tAeU1Cx/B5Qv53au
638QLzBPBzQ0JwdN0zRNVHR0jOSkbZrOfQ81NweE1LQ26Rq6z18vO4cRBz1fEU3nNp0HxBQ+hwck9J1r
2DT0JBIfP+cHhNCmaZZAfMSU1ETO3b5Syw9FBxwTdwftCkGbNCRP+weEUq7buc9XF1QnBxRWTxSX03SN
oFcrB4RkYdN0bjRYtwfUpARat1z3NJ0H5PRb7xWPaTq36QdEBFz3BxR0pmk6t5RnNwe0vNS63Wua1OTs
NwcEFjdo0zRN56cHVFS0jBrOfU3UpB9pPwfAoJ3rOicXF3WnB8R66xp2pbsHZIB/GG+Rn+t2jp0HtJJX
B6SU9xmPbud2rptHBzSdFweUoRed2xm6GlenLwfUqDcHFLlN57q4hxsnBzQkuY99bmfYBxS6Nwe0vicX
vyybztC3HH8HHKTBbNu5TdPUhOTDrwckxO9r2DSdB3Ts9MtnHU/TNJ2hzLcHlGSkm+65TXwEzY8fB6xE
zulct3M3B2TQjx4vB1Smc5um5HQ00S8HRK7bGb6sF9LPB2TULx+vNE3TdAds1ITknNO5TdP0tATVzwcU
btM0TeQ0/FQUIDc1ndt0B0QU158HVJSxaZruFwfE5Nw02KZzm84PB4QMIc8HJDM07Nw02ecHVN3PIQcH
z+3cpqT04DcHBOE3FzRN57rmZyI/B1y0dL26ndsE568H1PFXI3fO7dzO1wf0988HFPhPB5umaZo0xFTk
dAQk6dymc0cHJKT5Vwf00O3cppQU/CcHZP1XJZaCOtdX/h8HpOus3HbX7gcECf4fB1QK/j8mT56tgOkH
PKIHXAxrmqZZjMS01MwX02zd7Q4HHCdfEQdsZE3TNE2EdJzUzPQ6t9007AQS/qcoLwccrt0VbgQT/gcH
NBX+pwfb5zbLlBa8tBiPJxkH/Dad2zR0FCkfByykGzRNVygTB7R8xK/p3NeUDx0/B9TUD9zOddsg/u8q
LyLHBwQjJ3TdpukHVLy0JR8rZyhtmq5QxwfUnLQrznXdzq8HBCx3LL8tbwfYFe7cNDP/B6Q1/scHJDbT
dK5rLy33N18HpHRN05VqJDg7BzS8hLmu2zTUdDlvLmdALzRNZ9gHREN/B2TExHSuodvsLidEHy/vBzTY
NJ3btEZXB8SMNEgZum5nVwf0SR8wz0p3znVf0we01A9LFzGPB5qmc5tsVEw3B3SklGmapmm8tNTk7Gc4
0LDEUfcyL38H2HSuYVRiFzMfB4xEebqdoWuvNd96Jwd0e6c22zRN50cHTMRklHzXZ9g0nQfk3CR9xwdN
07lNRBQ37wcshER7btM0pFxUfmcPB7fp3Ka0BH+XB5QsOE/czm06B0QUgC8HRIFnDd2m6QfU3ISCJzkf
g2mapnP3B5SM1MTQbTq3JISHB4Q0OkeFNWyazjcHxNREhp8713U713eLxweUkA88P5JPOtd1Owdkm+89
F7BPB+QZuu5r3A+x/z4Hu1c2naHbB4S8Nz8XByxEvume2zmnBwTArxcH1NdtmqbE9NQUQCfBl5qmaToH
VFRkdLR0z7BplATCFx8H9Nu5btN0HEEXw38HRMU3ndu5rkIfxjcHZMc3B0RNZ2i6yJdCy08HxAxXwLmO
Qz/Nbwd3Nzq3aToHpHwUz6cHVAqYpmnMlOxXGnau629EV9YvB/TXX0R1LWfoP9kPB98fRbFzO9dH4o8H
dOOHB5Tp6DaAzncHVE/UByRtOncDGwRGPwc8xBVdib4Szw8Y4wfUbVXXoBnfByTX9BK5W9UHRKMsR78r
RHsS4lxH1AF6UgPu7C8EzxsMBwiQARccAxAtu9Co4IdXAACuA4AcSi7wF7L9LojRe0EOEEIOGAIgAfxv
yygwDjhHDoACgweMBms3+gIeBI8DhqMKBhQX3G1sbDAgICwQDghBJtGjMSpahGXbNqzbN8kDCEJPHyhJ
oGHb7S8FjASOA49FiQIQQT+a4jPPQqCnxE3sGIyY3T8IAI/M3A1IZyK7Fxss24IN1gP0L8sXAhhpO9i2
e7ABg6sCswtBnrAB60u26wYkCLAvTAKfiGGXs5icmiggQZeEy+5hJ1w3yO6KBidATsghkAOhBC6bs7Ym
T6wI9UoT5IQcQtABaBLgG4QL0N/8Twhr2wHYvyvwImYcFxAQvhsUvyAI/f8B9w2ETfc3LBcYmwAHFxCe
sDhwBgKMBUencxHRXBQvUmi6wbZTiH5fdBfQFwDpLqx8jBfYQEiaZqTgFJB0TQXc6BcS2CA0zdTwB99F
dw8DCzbsLxdXBLYEwrMDX6MCVwJAdoGcEFZNAkB/2AnfHVRPQAv9/05XUBekJ01zbHh2cABj/ZHdG4R/
FyUBMAMgAQ4ITS67gf8f8AwyAHch7JL/FxgNp2T/LoFtuhcQ+APPkbcEMmHPMwVQAz7FBtigARlnFzwE
YTSguh8QSw91wzgjDHwIOUNousGGC7d0N8B3yC5CQAf/FygRCJvuW8+kF5CiBJ+wIeQEVARszQY4nqV/
DAV/F81gl94VZ03gARck4E33LYwZZ5c8F+hNO7AhhAFnYJdglSGQ/QJgAwgBl2cpCMvupGfQGn9nZBVr
6YPDA45yXq4JQcOOdVBOC8AQ63at/zcYG7cCz2v2WC/WA6gBTwECVQdXCLvtOgSfEB0nvQLHIaQLa5BX
fwCBsft4T89UT4Afz7LL7mtHdB+QIGYDz+Oyu0c3zwPtAtAg/xtJ3yUv0CP9/xr/F2iaAaTY1OBkCZrD
zkdgF+w4n3UN8myEF4ABBBCwpnsD1hcQRxwDF6i1exhgxzc8H7glMISwEC8EN3CwC+SENkYEcE/C2ILm
jAgfpU8LbEI4sIdbTnLZHcKwAWfcT2grygBjZOx3Zh4QbgV2e//B2nYLDAgsLz63oOkGgXk3JBcwCMG6
bsgPPBAoF81frOuGkmlsDMgvQV/ri4QbfB3/JC3fYphImPf/eSkg8RA+IQH/IKi+SCT/Cy734J4VU1dA
cBz73J8sLRC6FwWfEcC2QHhh15gDUSbHeIHAWCHAASdECXtPbh2fMWfnAAJrHAai7AZheD9kH6AyNt3D
wIfvfBeoPgkFdgIEp44Inm33EINfR8xHmDtPD7sLyVEDNYMGjEfxAjiedWRBMGcMCs+RWNZGH1oH37Ke
wYEs0vggQZ+wEd0bJP834D8mkd0agr+Cgy0fASf6dZbNbOhBXo8C9Y0wrMGOVD4vlL6F0cAnNG8/rORA
oOkXGKUHMOkiDWuaNv8noK3hhqyYP+wXUxcVKZmwJ6cgQ65s23cwRSfRZ8ZAmi4G/yfo+AIva+RAzMZA
XJfRXQwG/zewRv2QNN2Ur4wXqAk7EjLNpKCPvBf4wnummE8vokMNBlRYb+rLMwP6CM1BDAYQ/9EFgy+v
UccvUEC3QIOfBAfwFxGQNN2QRxwX+AM1QzbYNC8LF0zobLqHkC8nZBfgRgAMCBwJ70ntbBtsbCAmN5x/
UjfY47ApfStGnzcw2kUY/zcgUkfSdANCR+wXKCO7BXoDVP/PQBdVCmS9CFl/A3974S7k1gVCHGsUdzaL
CUE1v1xXyIXUZUhccAIvYGQwYTWyNWBXj7CW3ZQ3gF7lt4AFQhhMWBhOWGeKwNQmc1JPvVbWZSBjkQUX
ZDZh72UawwRhRkUgAbZM2XEUQUcpdoMOjpNT71Bob2AvwOoiEafyAr/1CtsdRSYDOhq8CQUCH2HdA0IB
r8AYYbcaAmFPx6BpE1GkwHgnATCwmzD3LBfIeeeMw7gyp1Ambw8Jj4yPUAJON1AAl0Kgod18T2h7Bwb/
IexCGIAnHdawIYRuJgOOkoDC0MH3wR/sb4GHAkgQW0hnv2YsG5LgAshlUP8LBx0As4Mf7+8guQAbXP9y
IV12T1iHYwUfQNiFgAzWokBtDgF7YV8DcgMQAsEPCwB0T3/cX2gjxEm4TALvUALxmHxL4rCUCUpJ5xRg
wQZ9t44vD99IpJAT0g3/exdGu0/wnKcc/xckToCm+OTXWouye+B1AsTK35wfyJ0JXBj86Q0DMp2Hkjiy
OxF7MAA+/y+InoJJA+GXBN/n6VjQ9ODojbHdAb48DKMLQjk3FF4J8B0g4KL9/3DXAlsIBITDL0Zt/yEh
wC43GKMnTwAJuu5kECAXX1/FbiiZCrRPMKUeArPAb7dvzBK8CNY5nxcOZ2JqLCZN4KVoUehOUsCq7wQT
n6ddR6UkX/9IF0xoui8gZzQXgHElpCGM/+C3FsZuGf83yK4HYWy6L2+EF9B2AKdigwHbYLZ+H28Id2Wx
+z+sJyivN8S/ugsLuhdXb9wXaO5rYGFPB/QXk0xZm2AjAQdAmXaTcSRAZzRcULBaKmOjvwJnR7uAkTJn
/0cosscWrFBnn/RbVjTNF6GNH5w4TaY7sJMCSz+8H2juwOqSSkgX3AQbMCbEmLLvj/QXToDUppCVAXdN
AbvqEUgPv+CzxAdI8f3/gAEXA08BY3PYhOhwN3wotV8ITVgE31IX001ZDGnftDdAUMcjIa/MFa+1SCjY
la/kL69NB7Du/Bc4LxQWX7Wx+RZSfxcsKLVGg01Jb0QvEp+BwLNDXBZffwDfTTckcHCvjC+IM5BBuJAB
UEckA3YDNn/EN5C2t5nuAQn/F7iWDxiAf/8Xtwz46Mr3JEi3t2RN8yUXPDhFLzMkTTdUF3ASbGiaEU14
g9/jCAHWpnv7hBfwFwRPoAsMOAOjp+AktexO19RPwLsZh8KgTTfsF8hyA8c7YRxkkDADqJAC/wawBAQP
EK/bdEPSBUc8FwhuBbdgJ2QI8ALgttsNAlzw94xPKMRnmi5WC/8XICeW6YYEN7wXOB8SdUMaP2pHxth0
MQr/J2DQCgmJjpDPBDfE2wKjBCQmA/YFDQM2hOoEl1R4wCEGC7bOb+0P3gw3JHjsSAVDDgj/J2OBYGCI
z4c/IYaQC2Gg95qgZbU7KXfMT2jU9yj5kvSDAlUnH+yETHJyDBoWVLAjLMgsP0wfJnBJcDoAX3PPKavp
Pn9sH4jv72JgHZBaAsnwAQzYvf83QNU/9zDCgHEHX9w3mQCBTVgVAufXrePDINcsG5/XT7VhathHAd+g
a4IVu28ga3dUJ1DYEugqmzd3DP+iafMFT6Qw2RcIQsgJMMd7B1wIuhNP9E/wR14CEB5eFreQAVBrRJNw
g9oCLiMCUzwsHGx4/+QY4683wSISjCc4d0g0ktxHbD970UJgKOQX/wTQYMSuMBeJABd12KZ7k6Ms/x+g
AAGvXcZIDXAH5DhwJZfdJH/UL3DlsgDYDRgxpyf8JwjmhO67kBdMqx0E5r+jQ0YprwL5rqabUSD/T+AZ
J0CoBI/GAoeDXSQC/0+g6Y+SaLorzBfYC4empKYb5BfQVT917gkLiW2PFB4EiNUFo+qnH1G4Mgq2hP8f
hz2ErDtMF/h/j2RIsSvTF/DHP2Un3YOGTd6A/ye49AIEdlcvAg8WAti9aIU4/0+Y7Bp+iaxvJwQfH+2L
RSKhJ/8nsasZscjvjw8CTUMG351HRBcQ8P3/V7dcNyTRdBdYFId0F+4orExgp6w3xSJh0Tjyp/9uSCDT
FzAv3BfUbrKaKOSvMGbdAULaMGT3BPvw85cY1HTfpxwX+NkPrJWcXFDM/wuwll03oPbu/8XuKKmuX6RP
QPjTxRJhB/83aHiTTUlHeitM/8CAboNHkCddn5MmMCYjdkbwMJLdAydUT6D6GfGwD19gg0XdASmyG1IM
YP8/wPwErhDgvwCfZ2YCCNAtfkSxgMSy+U/kMP3dB4kYSl5gAjRXTXeVcMD/V1wn6OuMByAAHwOiB0A3
CSEXrE+IAqy6VPMyBae7hxRylgSn/E94BgZTUixiD5DP1BsJTwMtAlc/wOoNev9IqAj+34WV6aZsL/jf
srqLGKcACv7fBFamm7wXKN+OrEx37C943wRICYMb1HAK/k//BiFkuheor7FFdJH/N2DvXYQUQwgfwD9J
wRDCiKfARwArbt+knxJPYQJ3u2+FPBQC7/RPkBR4BIQqB9dUkK6hz5gXWRcIEj1PRx7tDAcZNd0JdzQn
0KbnwGELLYBtbmZvCPHdkV9kL1AV/v8fh0ZW0118F1gdJ6whUYTR3Si4GwymwI+8PzgX/k33DSS/V9QX
MGlYwimhAd8C5rlYwMA6ZkAN19hGYXgUJr83wD/YNVwjSnxRm40EwbChYFUOXYYGeXZCRPhEk3IKb+aD
E9gXRgteF0gLJ8Fw7CZ8Z7gZJ1+wK7W/jmeNA0UtejWGBfSA3X6wBmBGKENASQtUmmayhZBPzMhgJqSZ
SGJBUwGPI9sQRk9c//YzSLdw2E+ejYwDRCsK1hbehk+hSk9ND9ifDIcLWQoOKEYRRAtqu0liYRBffF8Y
Giu4ZCxGbyOlVWzP4HYgUkMYQ1YLVwpFmO6hZVGftDcwpdoGYn9FAoousDTdINALVYfUH8AcdMEKnhBX
/xfIHcGR1BH/KF/+TXckEHccF9gmmy4kEf8X8NwEIJNMGB9JRCYwXiCwA24BCUEodk11f4RPgB8zyYVQ
j7dCQRdC7K7XAnMKRb5W7gBtZRRa/1eZ7ML4OLb8/wLHRKdF4nUBJk69AtZLgCIlsK4XYBO2ay+Yp84P
T0X30tw2Chmw98gDQ2mE8AADvQoRvwOCDdB/AC+nz8MARsdED0UCGZ4tpGoXp7QB//ypbNM/UFoWp0wO
8Ah3DrjrbhuUXP8JSQdCDwJMCrq2MUAI2QNcImDBuq7rKk0HQSpSB30PD9J1YzpHCGEQSwO+A8EO1nUJ
TxFnMgJKEI4F7LBoM3chMx0BsG6wwUVJM14Hc2a3m+seA/UCCUcRDYgJUJAJLfbdbQuYB6AJUlDKNhy6
gWywai5qLHMbVQPrDmtajdgIYmsddsC+io1EIgNBEUGazQzSUE9HA6iwDfa7abjACW4tHgKObDDIYIPN
SA9rALhQDAaHjIj4Q3h8nVy32gCMD4avnIivltBHbgpLbFvXCbFHGDjFQApILmxtG79QFlhiYC8wZrpD
X8AiRnz/V4BLJd2A/0gBrxOAW4F2uAHR+BbIAUpBsxmnA9jgADYSGDfPAo60F2lPhBDoF0boL2RSA9h3
BFBF/v8612+1000IEv8vYNdFAwund6wXrBECTVjB3ycEI+k6ZRFEA9h3kw/0BOBF/v9Pj2g0BCarClIL
bxFbUBeXAC80GwS+h/dnCt9DV0QfXUiApiAe/xcoANIMIHQwFxI0zYw4Fb+k80zWdBdApK9IQXvBmewC
Z7BL/y9AQwamwFdWui8ItGlrF8v8J+gujTBoWt8DMGj0lawRRkpknzQcYf1CVxBH/v+Dn0EsZV2KtShQ
n/+6kTVdP2BH/xeYphsyaC9vpBewYDCUwSoBH1MewFaWHgKfIUf9SGDZRTAR/0+QSIWwTcKBWB9SHndB
TdHQHsMfxgBAMui6z0l/JJDwL6OfNkIWJwJpWCBZ2D2sBKE/dE9QSUgyCEvPd0XxyKJU3uxYRgvja7ol
/z/AWRBxj4cTuu1OKFi2w9fUQGK7ELZKHzv/TCRdEhZLyVcPRFd0W3Ug/+EIN0V8Y82UXkQsRzdHlDTN
hUQgVjSMLdlnbzdMeklouiX/N0iPV6OGA4xFR18JRFkktLAJRBD/5CJpuk+Iq4BqJWyFwEGnINSZxv8x
H096R+vupoVnT/dNC0YFSgtgA2+yyhcRSb9UA8q6FXU3MC++BF8IRHjHpQOqAQrYyMFtSHdqDkaNZwr7
CNZlzEq3K6xXCCHVsJhPLwWXDjbUEsd7Axun2C12A8mAAk4HEQKEEAFoYinPiKqQTgip7m6YB6ACXRxR
xtc03XcDPkZKNUFBa1xOKiTfOhVSN1Swul0CSIBUpzECPw1aQwEnI0p1CazrmkRNB0EReYouu8cICqz/
X2BWiAhvAGFCRgdKqu6ha55nRU0HQQeiCBhsELpHEGsYeg9HEEK/QRdgNp8CpPsMMth+LUpjugEVeAnB
BmNTt2QzUgndGr9eryMVj8IWAS49/QIHsBvc2wNGwANaBw8DAlSJDum6hwNkCyJHKmbyxR6k6whKEF4D
hAMJ6b67rRFlyAfQA1wm/hRNO14VrF0m//TIckEqCAY338KSnl7/DHNXz9ZCq0SNh2jAISy27XBWBUEM
RjI03wijU/9vlEDAGELY/QkvQecZdoXb4XMEch2ABL5S7m7bIJAEfpgLoARuHdUM1gqrfDcEkCy4VTjQ
fOdIdTWQn0+EXB7VXQITSJ9UT3BAk8UShygvZhI03YEfdB+AjF9AtjAAUM0BwYLL7oPPxE/AfrUBN6L4
y7dEjwOOBK2MBosY3G5FAyZCDAdCH8aCxe70L1CA/y9IINUXWEGwAkQMB89guy4qj9gnBgBXaZpvNkEj
HzzICJlmQiZFXLgbLAIBgD9LH0y2bC58CIENP0qTdd2EnB/4Pw4fRyRNMyG86Exkd9jLZUWDA7/cHxiB
HUiaK/xIHDfuIYG9A/qo/B9HPB+wfCfEWIHXRB9GSRgFYeNp4EZK/wyMaLonUIxX66BQKPDt6o9xMeka
BuNEjwTDlC+wjbccsjkCSV4lZIIwKrJIBjdoVIYR/zjfh4uQEH4TAAK5gP8fd6IFstiD/x/bDYRlyITT
dx4CsGvbml7SPwQ5j4UnNjjIJQTpQw+fakXw7ht3NC+QiP7/QOxgPA5Zt1nGuQa26U7/H7AjAnd2oRYt
iIXaArfnIX0XY/8nuIr+/0JfTfe5LZ97IUecH+hYtmh0IEMoRWWquiH9REwL/ycgzZjAWGdrX3iQwEw3
INf0L2C/wgxPNf86Dx+APd0bLP8foAVvk++s101vbnVxSqWqO0D/L7D/7IQX2IEBLwLXE1AGyC4J0P83
CJIH8s1V1GCT/v9MSNkJ3SFROF/SaDhtV3Vot694lDcDC9bHuwdPcnBwWgn6u9Ivw8bMzc7PeFUQCxwS
1CBrTWLDdRPG/0LMQs1CzkLPQcZfZFfgIUu2Ve+ej1aq3cOyQ4f3lC9QnQ07JbQv9wKZKQhsuhP/J/gZ
Bscx5iYL505Y4EktIHaHJ+wv6KP3EroDhCEXRy/zuQsAhl8vHDwPB8WTbQcC30IvTriusHtIBjB3TC8Y
xmOksUmfL0Zvb4FvYDw7SwYCU5BnsoBtuoQ3sNAIZ5exm7BuRGdEl7QvUM8JCxg0XwM3L8v3kKSVsk/k
L9LZ+IZdCU/RwFcMCNyC6vAIG0ELdwWJJQxJp0aG3SGKHv8vKN5/wG9LSOfvZCVTCxhUwo6xQgvu/44k
Lrs3EOA1D69J7FihChRp8wLBG0XdF7+kLyCfnGiM9X1AUS9OJ3RxAAATxGn4AgAAAAAAAED/mBcAAIcG
AAACAAAAfkFykAADAODhQgAgg5x9YOwHbHqDDDLIiJOgrQsyyCC8ywAgJ+wjgNlBByDbe/Lkyd8Q3pDZ
MNovWLCDBQdQT3c/wQYbbBcQB0BPnj3Y2ZAuJ9AP4IBjPwNA7GCDzS+PCAcQLhfXDnb2lL03SBfnCgMC
0w1ydgCivhcMCQMFIGcvbLDW5z3XDwGeHeTkv74X6gI38798ZEHOFwZH8L9C/pI9IceN2EJ3AHC1QsgW
dsLHWNR3h+zsBfZgM/fQLRfwB2CDnR0WwDcbHzEP2IUdwhgn2pdJH0FODjZqD/m/HWEJe7AF49B0QHcH
7CAT8lAuQGBSwUdnBxvsUCdR+6LCFyBCNtgg4g8S5zzjYcMA/zAqB9TDgwx2IXfaDyK8dvawIO9yCsP8
F7CzgwwWEsQPDTdssEGGeDonC/cXwgs70Udj3Kckzp69sMQfUwj3n9AXDoY02DAvDwRXzVEWMg9XVwUA
1gxgF2gOt04OMthFDyY4vwjKFsJBa8RXf2wwBjlql9cCF8C6IRtxJ1DgJBfs7IMZRHtQyxcalwgDWDcD
Dxc5G5C+kDHCPx8of41sYQfR3pcf4wJ5JG9Y1Bjv++zZIYBPF9BVB6BWQC8GG5IJCOAf8I6MycEHwFdv
ftZd2EFv0fcQFBUXIEPIAD4/rDssyK1fnQMRp2QvsoNux0BwH+FFVljgH7BzNw4WwgZ0fxdggIZhZ88H
0tK/RyeYsAuEhyl/gJegF7AHGWywB8DQ7UAfs2cHm+APAO4HGdNnAgdrsEZH3RPQgG8GO+sFoDaHjTdR
BhuswRco3/gXUw0I3RAWAxMXAciCMGTXUFc3DcaD7nQDHCeXT0c2gYMX3AObF1SCMYA0MW0bYRzsyBdy
52TcJwiBYHCD34cHO3v2AE0X59U3QxYeAwg5wmb/NyBBBhtkbsMXJJGQHoQZN/DXQO9HFgySLw+/c0hz
ZLME7xcqERjsNQMwFh8XLcDC4hBf3C+DDdaRD5BPHg8yQo4sCP8XNBFkCBk2OC8sHiUHxNmXewG9QHgC
N8DkL9AjFxLPnjfQJAcN3OcrQo4sGA8XMCAnBxky29syZ4c02P3PKxfXDxUC6RAW1zDpZ0KwIPTAEPcH
vBhksNlB1wdAALDBhrI3YF+wBw4WrFDAbwew63WB9cI3MO1fIOzkYIMvoAfg74AvGWywIaAXsAfAFshk
BY/tLNgjBD8g8DcHhiQGGbBYxxWhQ2IwFw+32e+SGAkLfxeMwwY7gR9Od/ZPFjbYC1D///+3nR3syCdA
P8D5B89kDAmDX1i3MK9nBxtsL0BfQ9g3SgNY02AfgrchF47ZL4Q0FC+W2P/ZC6MXwdiPiwPTRrAL6ffY
pwIDdyHx7BHg0Bdt2Z/IYIN079+hFyMO2SA1CmuHL+zZHUktBBe/2wvSYIMfEQ/7o9fqhdEjHNsPJ9vB
zobAX3IXZS8GsAGDGZ8JF3BjIXSwF7jbf9dIg/UIoCWXJu/Inkg6KUFXkCVBr0V2EJhAH6AqJ4vsRPbQ
KkGXYC8f4AI72NArrzFBhzIXGLzAn4YDh5QMBjuDA+/jFx+3yAhlMJcP0RMe2VeRA4/J3I5sxpAnAuMv
lwJ7ZEEXqwQv1RBm9bkEbycWwsOGzwdgMkcXCY8s/5A074AX2YuENoeANB9wVk8OJdA7Et6fheyMFwUB
0ygXsClsGB+PRE8X0kEu55/eL/SkRzaJARsXLgJfO3uEwY9wTmfwB8FCCQcwUAcf7KxRsPAHuAe+d2QL
BBgTN8cpKSR0JefPWDwbpFkPXAc236fkyIJdjO8XqBlAmiHpCfUeVgGkHids31EQLgQ3MbcsDtKRZygT
tt+n6YQFL8vfH53gPwYbrAtZ/0YXJUhwsEGEM2vg78QJIU554P+C4MEjLCGnADCMJ5wUg3ejD9hXA/Dk
2bOZD9KfB3CN9pBnJ8RZV2p/UgfAnT0bhGKX1wfXmBe2bLCzg0fgjgfEP+AfGwQOG7BfZKdfDydPnj2V
oAebbGhVwTvjyZNowlKQASfUT8mTZwfwogccmUCMe2Hw5OJsxaK3QGYPhE+ePbKTB3JsgGpjP07Ys+CR
D2NBF7yfGywYTyeev1ezF+QgZwc7mgdWtFLBDnbyRZM+F3CPB5A92JNoMKHHZUIAAARCYQcCL1+DMGWM
TxYni5u8sCeAgwfggACEI+wIBVerDwcb7CJmL1AHIJIQbCqEYwf/AACzB4V54K6fAAAAAAAAgAT/AAAA
AAEAAFSuAQBQUuivAgAAVVNRUkgB/lZIif5Iidcx2zHJSIPN/+hQAAAAAdt0AvPDix5Ig+78EduKFvPD
SI0EL4P5BYoQdiFIg/38dxuD6QSLEEiDwASD6QSJF0iNfwRz74PBBIoQdBBI/8CIF4PpAYoQSI1/AXXw
88P8QVtBgPgCD4WHAAAA6whI/8aIF0j/x4oWAdt1CoseSIPu/BHbihZy5o1BAUH/0xHAAdt1CoseSIPu
/BHbihZz64PoA3IXweAID7bSCdBI/8aD8P8PhDwAAABIY+iNQQFB/9MRyUH/0xHJdRiJwYPAAkH/0xHJ
Adt1CIseSIPu/BHbc+1Igf0A8///EcHoMP///+uDV15ZSInwSCnIWkgp11mJOVtdw2geAAAAWujDAAAA
UFJPVF9FWEVDfFBST1RfV1JJVEUgZmFpbGVkLgoACgAkSW5mbzogVGhpcyBmaWxlIGlzIHBhY2tlZCB3
aXRoIHRoZSBVUFggZXhlY3V0YWJsZSBwYWNrZXIgaHR0cDovL3VweC5zZi5uZXQgJAoAJElkOiBVUFgg
My45NiBDb3B5cmlnaHQgKEMpIDE5OTYtMjAyMCB0aGUgVVBYIFRlYW0uIEFsbCBSaWdodHMgUmVzZXJ2
ZWQuICQKAJBqDlpXXusBXmoCX2oBWA8Fan9fajxYDwVfKfZqAlgPBYXAeNxQSI23DwAAAK2D4P5BicZW
W62SSAHarUGVrUkB9UiNjfX///9EizlMKflFKfdfSCnKUlBJKc1XUU0pyUGDyP9qIkFaUl5qA1op/2oJ
WA8FSQHGSIlEJBBIl0SLRCQIahJBWkyJ7moJWA8FSItUJBhZUUgBwkgpyEmJxEgB6FBIJQDw//9QSCnC
UkiJ3q1QSInhSo0UI0mJ1a1QrUGQSIn3Xv/VWV5fXWoFWmoKWA8FQf/lXeg8////L3Byb2Mvc2VsZi9l
eGUAAAEAAA8IAABsBgAAAkkNAP///+XoSgCD+Ul1RFNXSI1MN/1eVlvrL0g5znMyVl7/+///rDyAcgo8
j3cGgH7+D3QGLOg8AXfkGxZWrSjQdf//v//fXw/IKfgB2KsSA6zr31vDWEFWQVdQSInmSIHs/u3/2wAQ
WVRfagpZ80ilSIM+AAV1+EmJ/kirtnSzywz8Cgz2/wL+327/9U0p/Lr/DzdXXox77WpZWA8FhcB5Bdtv
/98Oag9Ykf1JjX3/sACqGnQO//OkO+//b9v2A8cHIAA9OD4M5/hMiflIKeGJyDFv21v++IPwCIPgCMdv
Jgg4d/hI/+3/78HpA4mNZwj8S40MJotD/CMBSAHBQVleX/ft1r5Yrwh3ueJQM+jorAUL+/8/doHECBJE
JCBbRSnJQYnYagJBWmoBWr7atu7d9moA2wmfid9qAwZfogv+27ff/f9m+LAJQMoPtsASSD0A8P//cgSa
pvvfgcj/w7A86wKwDAMDAguh4aZpCgEA686GUUe23b99F0yLR7eNSv9zCr9/EujFQP/bv7XfP/n/dBFB
U4v/yUn/wIgGB8bb23fb6+m6V+IXWMNBVXHVQVQEzH54a7dVrP1TA+aD7ChaD4Tmdf/e4EQvJBC6DAmJ
7+iWUYv2f2G70hCLFBRbdRWB/lVQWCF1ES8b7LvufQAwtSbrBIX2dYBELnth+785xnfyicJIOxN36wpI
OAhzbEnrtu52VCR9i32sTAhEUBgSmvu6bcL/1VLGXkhfHO3/rd0udbi3IRmEyQ+VwjHATYXkB1/YXvjA
hcJ0HV3+AAJfdyU5M3UPbbdtayNOGgTJNXsIRNRzb83WQBTeRUWMDYnytwI229d9xujb/rpUWwMdU9BI
/Y/w1m4YA+kUJcQoW11BXEFdw4Xtv6MVS9F0NkD2xwF1MC0PullzN/zwTDnBdBJJAQ+Uh9+GNbrbxggz
BwJPCDLJ4HB0F74exxDr0E9XuPkAkb/h0uDNW/1VU1JoTANvIGZrHbftg38QfYnSMLkEADyquw3bQmqJ
60AQPEwXIA+/jb39t1c4D0TIdoQkoCHuO83/Mdsx2wq/8P+DwSLfAP/KeCGbmBYh7nb7bUbKOehID0ID
A0ZFOcMKtsfCt9gsxjjr2x7lPOLr8N922gnDEQbjEPbBEHQFxtZ42w7rE7HtdQ7sXsdeo/GNwhBXb0XI
RTGkaxaa+7Yx0iDe6HT9PhyfBG5/tpUloxzR/kkp7mYjfzi2GW4x1m6EooNxfL4z/I32AHQiFwEGdRtJ
i1VhEreh9HswvgO+AfINd+lhKdrLLjwhQIVWNElJEro/ZZckdUI0SQNXIOhzOEmDfZwdDxoFUF8TNt7/
PCcES4tFEEGLTQTBbd++600gtBhAYlFzS/CD4Qe6xEL7W/exWCUo8uXB4QLTbB8kbB/bhxqDZAkHkFAr
4Lb3t20Y6uPsKwi5MvMwCPzx7PYbnSnos3UHrjyxEvu2fXRKGKYQXMFT54PKAiDb7q4wvBjoNPyTOcTt
JXUNbZIBGS7gSDgou839PVRQwkDofCkJbGL33SMtdWeR9rsCskgIiQ5249bp/H88BHTzql+E3NuxPeeY
3/tauLz/AaptvHfjI+1IugkDDtCFbTu2e5TBVSgDTaU7FMfe8A3NCkqNHDD52PfYJf34A8P4LcJ3OYUY
XDEMdC0FvViH7v+5Ij26j7Bwm/vJ/VjoWvuvOMN0N5CFxxEOt60DrFoMErqgkS3CY28b3+heJtt0E6gR
kuBu4Nox9mX+6J7uOgZrcxs36DUoTnQwE63CP/Y2+AHoSQHETDudLy+We+4nTCkGNZ0aovEIvwigQcj6
a3W9/7h7e8up6LdHONDFODkMD4xeqbWT9MdLME3teerJ9NtkaBDwQV5BX7KqAkvdQsXO+VWsTQijmbY/
1UyNbUBTIMO5Px9i33ibxBgEPo28JIDj2DZ32IYgxtuYOCnCu9sW+DUwgAQUfL6DwAwQttK2+xDonJ1B
U1XhWGPYu1v32ifxjjcodejQ7b4J4HZsY03CGfem6H4SHG41aFMoKX04dPBJGw54848APwN1cvBCu7TN
Px59EE5R6PD5d+n77TyleBe6AARG7rPo6xRBdwhvSD0PVb0RSeg2w6/tSkFQQwLA7Fd3cw1ElNRJc1UX
viBwDW6whve1xYw4hiw0NN9XDFZFCdsJ3AuCcTJILeBKAABAhEcgAQAA/wDwCQAADgAAAAIAAADJqKqS
AAAAQlEJAAAA/0gEAABZAQAAAgAAAO3///9HQ0M6IChHTlUpIDYuNC4wAAAuc2hzdHJ0YWIJ31zz9mlu
aXQFdGV4ZgwFcm9kYZb9f2saB2VoX2ZyYW1lX2hkcg23137mKx50YnNzBQsxZWyxNntzNQxnb3QRBRxD
gLXtY29tMG4TAAtgD9Z0AwEGD5ABQAchG7KzDwMvAQ/BBhmyET+goChkyCbshrICLxA/FwJssIcmtEIH
An+DHRZsHRNlQD9AyC7sIItkLyA/WbCHZCXMGEMHeWTILuy8CS8EPzNZmzzkcIgiBz9syC7syD0vCD89
f1mwBxsDWEBqYwc/WLCL7DAAv0RTPyWDDHKAcIhyYYcNSn8AP4AhuUgOuBNXYIO1yTh+Bz8B/1rIDlsH
XD94RfaszT8HEdgBf54dbNhi/w/ggT/YgYJdZM8RSBs/Z39hHDYSZz8RfwGkAwsHA1dAKGOw6T9wvwAA
AAAAACAB/wAAAABVUFghAAAAAABVUFghDRYCCm5lvhQ10qpbSAQAAFkBAAAghgMASQ0AnvQAAAA=
";
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | n = int(input())
numbers = list(map(int, input().split()))
counter = 0
sum_in = 0
sum_in1 = numbers[0]
key = numbers[0]
if key >= 0:
for i in range(len(numbers)):
sum_in += numbers[i]
if i % 2 == 0:
if sum_in <= 0:
sub = abs(sum_in) + 1
sum_in += sub
numbers[i] += sub
counter += sub
else:
if sum_in >= 0:
sub = abs(sum_in) + 1
sum_in -= sub
numbers[i] -= sub
counter += sub
else:
for i in range(len(numbers)):
sum_in += numbers[i]
if i % 2 != 0:
if sum_in <= 0:
sub = abs(sum_in) + 1
sum_in += sub
numbers[i] += sub
counter += sub
else:
if sum_in >= 0:
sub = abs(sum_in) + 1
sum_in -= sub
numbers[i] -= sub
counter += sub
print(counter) |
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
int main() {
int N;
std::cin >> N;
long a[N];
for (int i = 0; i < N; i++) std::cin >> a[i];
int sum = a[0];
int ans = 0;
for (int i = 1; i < N; i++) {
if (sum + a[i] > 0 && sum > 0) {
ans += std::abs(sum + a[i]) + 1;
sum = -1;
} else if (sum + a[i] < 0 && sum < 0) {
ans += std::abs(sum + a[i]) + 1;
sum = 1;
} else
sum += a[i];
std::cerr << "ans: " << ans << std::endl;
std::cerr << "sum: " << sum << std::endl;
}
if (sum == 0) ans++;
std::cout << ans << std::endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const double PI = 3.141592653589;
const long long LMAX = 1000000000000001;
long long gcd(long long a, long long b) {
if (a < b) swap(a, b);
while ((a % b) != 0) {
a = b;
b = a % b;
}
return b;
}
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
bool f[] = {1, 0};
long long ans = LMAX;
for (int j = 0; j < 2; j++) {
long long sum = 0;
long long c = 0;
bool F = f[j];
for (int i = 0; i < n; i++) {
if (F) {
if (sum + a[i] < 0)
sum += a[i];
else {
c += abs(sum + a[i]) + 1;
sum = -1;
}
} else {
if (sum + a[i] > 0)
sum += a[i];
else {
c += abs(sum + a[i]) + 1;
sum = 1;
}
}
}
ans = min(ans, c);
}
cout << ans << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
using namespace std;
using Graph = vector<vector<int64_t>>;
const double pi = M_PI;
const int64_t MOD = 1000000007;
int64_t calc(const vector<int64_t> &a, int64_t n, int64_t tem) {
int64_t ans = 0;
if (tem == 0) {
if (0 <= a[1]) {
tem = -1LL;
ans++;
} else {
tem = 1LL;
ans++;
}
}
for (int i = 1; i < n; i++) {
if ((0 < tem + a[i] && tem < 0) || (tem + a[i] < 0 && 0 < tem)) {
tem += a[i];
} else {
if (0 <= tem + a[i] && 0 <= tem) {
ans += abs(-1LL - (tem + a[i]));
tem = -1LL;
} else {
ans += abs(1LL - (tem + a[i]));
tem = 1LL;
}
}
}
return ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int64_t n;
cin >> n;
vector<int64_t> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int64_t aa = a[0], bb, ansdel;
if (a[0] != 1LL) {
if (0 <= a[0]) {
bb = -1LL;
} else {
bb = 1LL;
}
ansdel = abs(a[0]) + 1LL;
}
int64_t ans = min(calc(a, n, aa), calc(a, n, bb) + ansdel);
cout << ans << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | def f():
for i in a[1:]:
if c > 0:
if c + i >= 0:
cost += c + i + 1
c = -1
else:
c += i
else:
if c + i <= 0:
cost += 1 - c - i
c = 1
else:
c += i
n = int(input())
a = list(map(int, input().split()))
cost = (a[0] == 0)
c = a[0] + (a[0] == 0)
f()
tmp = cost
cost = 0
if a[0] >= 0:
cost = a[0] + 1
c = -1
else:
cost = -a[0] + 1
c = 1
f()
print(min(cost, tmp))
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | import Control.Applicative
import Data.List
main = do
_ <- getLine
as <- (map read) . words <$> getLine
print $ minimum
[sum $ zipWith (\a b -> abs (a-b)) (f 0 as True) as,
sum $ zipWith (\a b -> abs (a-b)) (f 0 as False) as]
where
f _ [] _ = []
f ps (x:xs) m =
if ps * (ps+x) < 0 then
x : (f (ps+x) xs m)
else
if ps > 0 then
(-ps-1) : (f (-1) xs m)
else if ps < 0 then
(-ps+1) : (f 1 xs m)
else
if x /= 0 then
x : (f x xs m)
else
if m then
1 : (f 1 xs m)
else
(-1) : (f (-1) xs m)
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int INF = 1e7;
int main() {
int a = 0;
int b = 0;
int n;
cin >> n;
vector<int> v(n);
vector<int> s(n);
for (int i = 0; i < (n); ++i) {
cin >> v[i];
}
s[0] = v[0];
for (int i = 0; i < (n); ++i) {
if (i > 0) {
s[i] = s[i - 1] + v[i];
}
if (i % 2 == 0) {
if (s[i] <= 0) {
a += 1 - s[i];
s[i] = 1;
}
} else {
if (s[i] >= 0) {
a += s[i] + 1;
s[i] = -1;
}
}
}
s[0] = v[0];
for (int i = 0; i < (n); ++i) {
if (i > 0) {
s[i] = s[i - 1] + v[i];
}
if (i % 2 == 0) {
if (s[i] >= 0) {
b += s[i] + 1;
s[i] = -1;
}
} else {
if (s[i] <= 0) {
b += 1 - s[i];
s[i] = 1;
}
}
}
cout << min(a, b) << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
int calc(bool firstPositive, const int a[], int n) {
bool positive = firstPositive;
int cost = 0;
long sum = 0;
for (int i = 0; i < n; ++i) {
int v = a[i];
if (((sum + v) >= 0) != positive) {
cost += abs(a[i]) + 1;
v = positive ? 1 : -1;
}
if ((sum + v) == 0) {
v += positive ? 1 : -1;
++cost;
}
sum += v;
positive = !positive;
std::cout << a[i] << "\t" << v << "\t" << sum << " " << cost << std::endl;
}
return cost;
}
int main(int argc, char *argv[]) {
int n;
std::cin >> n;
int a[1 << 20];
for (int i = 0; i < n; ++i) {
std::cin >> a[i];
}
std::cout << std::min(calc(true, a, n), calc(false, a, n)) << std::endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
bool code(long long int n) {
if (n < 0)
return 1;
else if (n > 0)
return 0;
}
int main() {
int n;
long long int sum = 0;
long long int ans = 0;
long long int ans2 = 0;
cin >> n;
vector<long long int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sum = a.at(0);
if (sum != 0) {
for (int i = 1; i < n; i++) {
if (sum + a.at(i) == 0) {
ans++;
if (sum > 0)
sum = -1;
else if (sum < 0)
sum = 1;
} else if (code(sum + a.at(i)) == code(sum)) {
ans += abs(sum + a.at(i)) + 1;
if (sum > 0)
sum = -1;
else if (sum < 0)
sum = 1;
} else {
sum = a.at(i) + sum;
}
}
cout << ans << endl;
return 0;
} else if (a.at(0) == 0) {
sum = -1;
ans = 1;
for (int i = 1; i < n; i++) {
if (sum + a.at(i) == 0) {
ans++;
if (sum > 0)
sum = -1;
else if (sum < 0)
sum = 1;
} else if (code(sum + a.at(i)) == code(sum)) {
ans += abs(sum + a.at(i)) + 1;
if (sum > 0)
sum = -1;
else if (sum < 0)
sum = 1;
} else {
sum = a.at(i) + sum;
}
}
sum = 1;
ans2 = 1;
for (int i = 1; i < n; i++) {
if (sum + a.at(i) == 0) {
ans2++;
if (sum > 0)
sum = -1;
else if (sum < 0)
sum = 1;
} else if (code(sum + a.at(i)) == code(sum)) {
ans2 += abs(sum + a.at(i)) + 1;
if (sum > 0)
sum = -1;
else if (sum < 0)
sum = 1;
} else {
sum = a.at(i) + sum;
}
}
cout << min(ans, ans2) << endl;
}
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | n = int(input())
a = list(map(int,input().split()))
ttl = a[0]
cst = 0
if a[0]>0:
flg = 1
elif a[0]<0:
flg = -1
for i in range(1,n):
ttl += a[i]
if ttl*flg < 0:
flg *= -1
else:
if flg > 0:
memo = abs(ttl)+1
ttl -= memo
cst += memo
elif flg < 0:
memo = abs(ttl)+1
ttl += memo
cst += memo
flg *= -1
ttl = a[0]
cst2 = 0
if a[0]>0:
flg = -1
cst2 += abs(ttl)+1
ttl += 0-ttl-1
elif a[0]<0:
flg = 1
cst2 += abs(ttl)+1
ttl += 0-ttl+1
for i in range(1,n):
ttl += a[i]
if ttl*flg < 0:
flg *= -1
else:
if flg > 0:
memo = abs(ttl)+1
ttl -= memo
cst2 += memo
elif flg < 0:
memo = abs(ttl)+1
ttl += memo
cst2 += memo
flg *= -1
print(min(cst,cst2))
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | using System;
using System.Collections;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using System.Threading.Tasks;
namespace AtCorder
{
public class Program
{
const long MOD = 1000000007;
static void Main(string[] args)
{
var cin = new Scanner2();
int n = cin.Int();
long[] a = cin.ArrayLong(n);
long current = a[0];
long ans1 = 0;
if (current == 0) {
current = 1;
ans1 += 1;
}
for (int i = 1; i < n; i++) {
long next = current + a[i];
if (current * next < 0) {
current = next;
continue;
}
long temp = current * a[i];
if (temp > 0) {
ans1 += Math.Abs(a[i]) + Math.Abs(current) + 1;
current = current > 0 ? - 1 : 1;
} else if (temp < 0) {
ans1 += Math.Abs(current + a[i]) + 1;
current = current > 0 ? -1 : 1;
} else {
ans1 += Math.Abs(current) + 1;
current = current > 0 ? -1 : 1;
}
}
current = a[0];
long ans2 = 0;
if (current == 0) {
current = -1;
ans2 += 1;
}
for (int i = 1; i < n; i++) {
long next = current + a[i];
if (current * next < 0) {
current = next;
continue;
}
long temp = current * a[i];
if (temp > 0) {
ans2 += Math.Abs(a[i]) + Math.Abs(current) + 1;
current = current > 0 ? -1 : 1;
} else if (temp < 0) {
ans2 += Math.Abs(current + a[i]) + 1;
current = current > 0 ? -1 : 1;
} else {
ans2 += Math.Abs(current) + 1;
current = current > 0 ? -1 : 1;
}
}
Console.WriteLine(Math.Min(ans1, ans2));
}
}
public class Scanner2
{
private readonly char[] delimiter_ = new char[] { ' ' };
private readonly string filePath_;
private string[] buf_;
private int index_;
Func<string> reader_;
public Scanner2(string file = "")
{
if (string.IsNullOrWhiteSpace(file)) {
reader_ = Console.ReadLine;
} else {
filePath_ = file;
var fs = new StreamReader(file);
reader_ = fs.ReadLine;
}
buf_ = new string[0];
index_ = 0;
}
public string Next()
{
if (index_ < buf_.Length) {
return buf_[index_++];
}
string st = reader_();
while (st == "") {
st = reader_();
}
buf_ = st.Split(delimiter_, StringSplitOptions.RemoveEmptyEntries);
if (buf_.Length == 0) {
return Next();
}
index_ = 0;
return buf_[index_++];
}
public int Int() => int.Parse(Next());
public long Long() => long.Parse(Next());
public double Double() => double.Parse(Next());
public int[] ArrayInt(int N, int add = 0)
{
int[] Array = new int[N];
for (int i = 0; i < N; i++) {
Array[i] = Int() + add;
}
return Array;
}
public long[] ArrayLong(int N, long add = 0)
{
long[] Array = new long[N];
for (int i = 0; i < N; i++) {
Array[i] = Long() + add;
}
return Array;
}
public double[] ArrayDouble(int N, double add = 0)
{
double[] Array = new double[N];
for (int i = 0; i < N; i++) {
Array[i] = Double() + add;
}
return Array;
}
public void Save(string text)
{
if (string.IsNullOrWhiteSpace(filePath_)) {
return;
}
File.WriteAllText(filePath_ + "_output.txt", text);
}
}
} |
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | if __name__ == '__main__':
n = int(input())
a0 = input().split()
a = [int(i) for i in a0]
s1 = 0
s2 = 0
m1 = 0
m2 = 0
o = 1
e = -1
for i in a:
s1 += i
if s1 == 0:
m1 += 1
elif o * s1 < 0:
m1 += abs(s1) + 1
s1 = o
o *= -1
s2 += i
if s2 == 0:
m2 += 1
elif e * s2 < 0:
m2 += abs(s2) + 1
s2 = e
e *= -1
print(min(m1, m2)) |
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool is_even(int n) { return (n % 2 == 0); }
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
ll sum;
int p1_ans = 0;
sum = 0;
for (int i = 0; i < n; i++) {
ll n = a.at(i);
sum += n;
if (is_even(i)) {
if (sum <= 0) {
ll diff = 1 - sum;
p1_ans += diff;
sum += diff;
}
} else {
if (sum >= 0) {
ll diff = sum - (-1);
p1_ans += diff;
sum -= diff;
}
}
}
int p2_ans = 0;
sum = 0;
for (int i = 0; i < n; i++) {
ll n = a.at(i);
sum += n;
if (is_even(i)) {
if (sum >= 0) {
ll diff = sum - (-1);
p2_ans += diff;
sum -= diff;
}
} else {
if (sum <= 0) {
ll diff = 1 - sum;
p2_ans += diff;
sum += diff;
}
}
}
cout << min(p1_ans, p2_ans) << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int n;
long long a[100100];
int main() {
cin >> n;
for (long long i = 1; i < n + 1; i++) cin >> a[i];
long long check = 0;
long long ans = 0;
for (long long i = 1; i < n + 1; i++) {
check += a[i];
if (i % 2 != 0 && check <= 0) {
ans += abs(1 - check);
check = 1;
} else if (i % 2 == 0 && check >= 0) {
ans += abs(check + 1);
check = -1;
}
}
check = 0;
long long tmp = 0;
for (long long i = 1; i < n + 1; i++) {
check += a[i];
if (i % 2 != 0 && check >= 0) {
tmp += abs(check + 1);
check = -1;
} else if (i % 2 == 0 && check <= 0) {
tmp += abs(1 - check);
check = -1;
}
}
cout << min(tmp, ans) << endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | import sys
# -*- coding: utf-8 -*-
# 整数の入力
n = int(input())
a = list(map(int, input().split()))
b = a[:]
# 無変更チェック
counter_1=0
S=int(a[0])
for i in range(1,n):
if S<0 and S+int(a[i])<=0:
break
elif S>0 and S+int(a[i])>=0:
break
S+=int(a[i])
if i==n-1:
print(counter_1)
sys.exit()
# a[0]を1に変えた場合の計算
counter_1=abs(int(b[0])-1)
b[0]=1
S=b[0]
for i in range(1,n):
if S<0 and S+int(b[i])<=0:
counter_1+=-S-int(b[i])+1
b[i]=-S+1
elif S>0 and S+int(b[i])>=0:
counter_1+=S+int(b[i])+1
b[i]=-S-1
S+=int(b[i])
# a[0]を-1に変えた場合の計算
counter_2=abs(int(a[0])+1)
a[0]=-1
S=a[0]
for i in range(1,n):
if S<0 and S+int(a[i])<=0:
counter_2+=-S-int(a[i])+1
a[i]=-S+1
elif S>0 and S+int(a[i])>=0:
counter_2+=S+int(a[i])+1
a[i]=-S-1
S+=int(a[i])
print(min(counter_1,counter_2)) |
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T1, class T2>
ostream& operator<<(ostream& s, pair<T1, T2> P) {
return s << '<' << P.first << ", " << P.second << '>';
}
template <class T>
ostream& operator<<(ostream& s, vector<T> P) {
for (int i = 0; i < P.size(); ++i) {
if (i > 0) {
s << " ";
}
s << P[i];
}
return s;
}
template <class T>
ostream& operator<<(ostream& s, vector<vector<T> > P) {
for (int i = 0; i < P.size(); ++i) {
s << endl << P[i];
}
return s << endl;
}
template <class T>
ostream& operator<<(ostream& s, set<T> P) {
for (__typeof__((P).begin()) it = (P).begin(); it != (P).end(); ++it) {
s << "<" << *it << "> ";
}
return s << endl;
}
template <class T1, class T2>
ostream& operator<<(ostream& s, map<T1, T2> P) {
for (__typeof__((P).begin()) it = (P).begin(); it != (P).end(); ++it) {
s << "<" << it->first << "->" << it->second << "> ";
}
return s << endl;
}
int main() {
long long n;
long long a[100010];
vector<long long> v;
vector<long long> w;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long sum = 0;
long long cnt = 0;
if (a[0] != 0) {
v.push_back(sum = a[0]);
for (int i = 1; i < n; i++) {
sum += a[i];
v.push_back(sum);
if (v[i] == 0 && v[i - 1] > 0) {
v[i] = sum - 1;
sum = -1;
cnt++;
}
if (v[i] == 0 && v[i - 1] < 0) {
v[i] = sum + 1;
sum = 1;
cnt++;
}
if (v[i - 1] > 0 && v[i] > 0) {
cnt += v[i] + 1;
v[i] = -1;
sum = -1;
}
if (v[i - 1] < 0 && v[i] < 0) {
cnt += 1 - v[i];
v[i] = 1;
sum = 1;
}
}
cout << cnt << endl;
} else {
long long cnt1 = 1, cnt2 = 1;
v.push_back(-1);
sum = 1;
for (int i = 1; i < n; i++) {
sum += a[i];
v.push_back(sum);
if (v[i] == 0 && v[i - 1] > 0) {
v[i] = sum - 1;
sum = -1;
cnt1++;
}
if (v[i] == 0 && v[i - 1] < 0) {
v[i] = sum + 1;
sum = 1;
cnt1++;
}
if (v[i - 1] > 0 && v[i] > 0) {
cnt1 += v[i] + 1;
v[i] = -1;
sum = -1;
}
if (v[i - 1] < 0 && v[i] < 0) {
cnt1 += 1 - v[i];
v[i] = 1;
sum = 1;
}
}
w.push_back(1);
sum = 1;
for (int i = 1; i < n; i++) {
sum += a[i];
w.push_back(sum);
if (w[i] == 0 && w[i - 1] > 0) {
w[i] = sum - 1;
sum = -1;
cnt2++;
}
if (w[i] == 0 && w[i - 1] < 0) {
w[i] = sum + 1;
sum = 1;
cnt2++;
}
if (w[i - 1] > 0 && w[i] > 0) {
cnt2 += w[i] + 1;
w[i] = -1;
sum = -1;
}
if (w[i - 1] < 0 && w[i] < 0) {
cnt2 += 1 - w[i];
w[i] = 1;
sum = 1;
}
}
cout << min(cnt1, cnt2) << endl;
}
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | N = int(input())
A = tuple(map(int, input().split(' ')))
cs = A[0]
ans1 = 0
for na in A[1:]:
if cs >= 0:
cs += na
if cs < 0:
continue
ans1 += abs(cs) + 1
cs = -1
else:
cs += na
if cs > 0:
continue
ans1 += abs(cs) + 1
cs = 1
if A[0] > 0:
cs = -1
else:
cs = 1
ans2 = abs(A[0]) + 1
for na in A[1:]:
if cs >= 0:
cs += na
if cs < 0:
continue
ans2 += abs(cs) + 1
cs = -1
else:
cs += na
if cs > 0:
continue
ans2 += abs(cs) + 1
cs = 1
print(min(ans1, ans2))
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | N = int(input())
A = list(map(int,input().split()))
ans = 0
s = A[0]
if s > 0:
flag = 1
elif s < 0:
flag = -1
elif if A[1] < 0:
flag = 1
ans += 1
else:
flag = -1
ans += 1
for i in range(1,N):
s += A[i]
if flag == 1 and s >= 0:
ans += s + 1
s = -1
elif flag == -1 and s <= 0:
ans += 1 - s
s = 1
flag *= -1
print(ans)
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | // Original: https://github.com/tanakh/competitive-rs
#[allow(unused_macros)]
macro_rules! input {
(source = $s:expr, $($r:tt)*) => {
let mut iter = $s.split_whitespace();
let mut next = || { iter.next().unwrap() };
input_inner!{next, $($r)*}
};
($($r:tt)*) => {
let stdin = std::io::stdin();
let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
let mut next = move || -> String{
bytes
.by_ref()
.map(|r|r.unwrap() as char)
.skip_while(|c|c.is_whitespace())
.take_while(|c|!c.is_whitespace())
.collect()
};
input_inner!{next, $($r)*}
};
}
#[allow(unused_macros)]
macro_rules! input_inner {
($next:expr) => {};
($next:expr, ) => {};
($next:expr, $var:ident : $t:tt $($r:tt)*) => {
let $var = read_value!($next, $t);
input_inner!{$next $($r)*}
};
($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
let mut $var = read_value!($next, $t);
input_inner!{$next $($r)*}
};
}
#[allow(unused_macros)]
macro_rules! read_value {
($next:expr, ( $($t:tt),* )) => {
( $(read_value!($next, $t)),* )
};
($next:expr, [ $t:tt ; $len:expr ]) => {
(0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
};
($next:expr, chars) => {
read_value!($next, String).chars().collect::<Vec<char>>()
};
($next:expr, bytes) => {
read_value!($next, String).into_bytes()
};
($next:expr, usize1) => {
read_value!($next, usize) - 1
};
($next:expr, $t:ty) => {
$next().parse::<$t>().expect("Parse error")
};
}
/** Example:
* input!(n: usize, s: chars, vs: [i64; n], ts: [(i64, f64); n]);
* usize型の変数n, String型(実際は文字配列型)のs, Vector<i64>型のvs, tuple配列のtsに読み込まれる。
*/
fn main() {
input!(n: usize, vs: [i64; n]);
let mut odd = 0;
let mut even = 0;
let mut sum = 0;
for i in 0..n {
sum += vs[i];
if i % 2 == 0 {
if sum <= 0 {
let diff = 1 + sum.abs();
even += diff;
sum += diff;
}
} else {
if sum > 0 {
let diff = 1 + sum.abs();
even += diff;
sum -= diff;
}
}
}
sum = 0;
for i in 0..n {
sum += vs[i];
if i % 2 != 0 {
if sum <= 0 {
let diff = 1 + sum.abs();
odd += diff;
sum += diff;
}
} else {
if sum > 0 {
let diff = 1 + sum.abs();
odd += diff;
sum -= diff;
}
}
}
use std::cmp;
println!("{}", cmp::min(odd, even));
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | n = int(input())
a = list(map(int, input().split()))
i = 0
sum_before = 0
sum_after = 0
count = 0
if a[0] == 0:
if sum(a) > 0:
a[0] = 1
else:
a[0] = -1
count += 1
while i < n:
sum_after = sum_before + a[i]
if sum_after * sum_before > 0 or sum_after == 0:
if sum_after < 0:
a[i] = a[i] - sum_after + 1
elif sum_after > 0:
a[i] = a[i] - sum_after - 1
elif sum_before < 0:
a[i] += 1
else:
a[i] -= 1
count += abs(sum_after) + 1
sum_after = sum_before + a[i]
i += 1
sum_before = sum_after
print(count)
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | java | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] a = new int[n];
for(int i =0; i<n; i++) {
a[i] = sc.nextInt();
}
int num1 = 0;
int tmp1 = 0;
//+-+-
for(int i=0; i<n; i++) {
tmp1 += a[i];
if(i % 2 == 0) {
if(tmp1 <= 0) {
num1 += Math.abs(tmp1) + 1;
tmp1 += Math.abs(tmp1) + 1;
}
} else {
if(tmp1 >= 0) {
num1 += Math.abs(tmp1) + 1;
tmp1 -= Math.abs(tmp1) + 1;
}
}
}
int num2 = 0;
int tmp2 = 0;
//-+-+
for(int i=0; i<n; i++) {
tmp2 += a[i];
if(i % 2 == 0) {
if(tmp2 >= 0) {
num2 += Math.abs(tmp2) + 1;
tmp2 -= Math.abs(tmp2) + 1;
}
} else {
if(tmp2 <= 0) {
num2 += Math.abs(tmp2) + 1;
tmp2 += Math.abs(tmp2) + 1;
}
}
}
System.out.println(Math.min(num1,num2));
}
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <iostream>
#include <vector>
using namespace std;
#define int long long
int main() {
int N; cin >> N;
vector<int> S(N + 1);
S[0] = 0;
for (int i = 1; i <= N; ++i) {
cin >> S[i];
S[i] += S[i - 1];
}
int ians = (1 << 30);
for (int j = -1; j <= 1; j += 2) {
vector<int> S_(S);
int ans = 0;
int add = 0;
int sign = j;
for (int i = 1; i <= N; ++i) {
S_[i] += add;
int sign_i = ((S_[i] >> 31) << 1) + 1;
if (S_[i] == 0) {
ans += 1;
add += -sign;
S_[i] += -sign;
}
else if (sign_i == sign) {
ans += abs(-sign_i - S_[i]);
add += -sign_i - S_[i];
S_[i] = -sign_i;
}
sign = -sign;
}
ians = min(ans, ians);
}
cout << ians << endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | n = int(input())
A = list(map(int, input().split()))
ans = 0
total = A[0]
if A[0] == 0:
ans += 1
total = -A[1] // A[1]
for i in range(1, len(A)):
print(total, ans, A[i], total + A[i])
if total > 0:
if total + A[i] >= 0:
ans += total + A[i] + 1
print("1 ans +=", total + A[i] + 1)
total = -1
else:
total += A[i]
else:
if total + A[i] <= 0:
ans += 1 - (total + A[i])
print("2 ans +=", 1 - (total + A[i]))
total = 1
else:
total += A[i]
print(ans)
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
long long gcm(long long a, long long b);
long long lcm(long long a, long long b);
long long fac(long long a);
int main() {
long long n;
cin >> n;
long long nowsum = 0;
long long ans = 0;
bool plus = false;
bool minus = false;
for (int i = 0; i < n; i++) {
long long a;
cin >> a;
nowsum += a;
if (i == 0) {
if (nowsum >= 0)
plus = true;
else
minus = true;
} else {
if (plus) {
if (i % 2 == 0) {
if (nowsum <= 0) {
ans += abs(nowsum - a - 1) - a;
nowsum = 1;
}
} else {
if (nowsum >= 0) {
ans += a + abs(nowsum - a + 1);
nowsum = -1;
}
}
} else if (minus) {
if (i % 2 == 0) {
if (nowsum >= 0) {
ans += a + abs(nowsum - a + 1);
nowsum = -1;
}
} else {
if (nowsum <= 0) {
ans += abs(nowsum - a - 1) - a;
nowsum = 1;
}
}
}
}
}
cout << ans << endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> a(N);
for (int i = 0; i < N; i++) cin >> a[i];
int initial_sign[2] = {-1, 1};
vector<int> res(2);
for (int i = 0; i < 2; i++) {
long long cumsum = 0;
long long current_sign = initial_sign[i];
for (int j = 0; j < N; j++) {
cumsum += a[j];
if (cumsum * current_sign <= 0) {
res[i] += abs(cumsum - current_sign);
cumsum = current_sign;
}
current_sign = -1 * current_sign;
}
}
cout << min(res[0], res[1]);
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | import sys
input = sys.stdin.readline
N = int(input())
a = list(map(int, input().split()))
res = -max(0, ~a[0])
sm = 1
if a[0] > 1: sm = a[0]
for i in range(1, N):
if sm > 0:
res += max(0, a[i] + sm + 1)
sm = min(-1, sm + a[i])
else:
res += -min(0, sm - a[i] + 1)
sm = max(1, sm + a[i])
#print(res, sm)
res2 = max(0, a[0] + 1)
sm = -1
if a[0] < -1: sm = a[0]
for i in range(1, N):
if sm > 0:
res2 += max(0, a[i] + sm + 1)
sm = min(-1, sm + a[i])
else:
res2 += -min(0, sm - a[i] + 1)
sm = max(1, sm + a[i])
print(min(res, res2)) |
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1050000000;
constexpr ll LONGINF = 1050000000000000000;
const int nCk_MAX = 510000;
struct all_init {
all_init() {
cout.tie(nullptr);
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
};
} ALL_INIT;
struct edge {
int from, to;
ll cost;
ll capa;
edge(int s, int d) : from(s), to(d) {
cost = 0;
capa = 0;
}
edge(int s, int d, ll w) : from(s), to(d), cost(w) { capa = 0; }
edge(int s, int d, ll x, ll y) : from(s), to(d), cost(x), capa(y) {}
bool operator<(const edge &x) const { return cost < x.cost; }
};
using graph = vector<vector<edge>>;
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T>
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &Vec) {
for (T &x : Vec) {
is >> x;
}
return is;
}
template <typename V, typename H>
void resize(vector<V> &vec, const H head) {
vec.resize(head);
}
template <typename V, typename H, typename... T>
void resize(vector<V> &vec, const H &head, const T... tail) {
vec.resize(head);
for (auto &v : vec) {
resize(v, tail...);
}
}
int dx[] = {0, 1, -1, 0, 1, -1, 1, -1};
int dy[] = {1, 0, 0, -1, 1, -1, -1, 1};
ll PowMod(ll n, ll k, ll mod) {
ll r = 1;
for (; k > 0; k >>= 1) {
if (k & 1) {
r = (r * n) % mod;
}
n = (n * n) % mod;
}
return r;
}
ll Gcd(ll a, ll b) { return b != 0 ? Gcd(b, a % b) : a; }
ll Lcm(ll a, ll b) { return a / Gcd(a, b) * b; }
vector<string> split(string s, string t) {
vector<string> v;
int p = s.find(t);
if (p != s.npos) {
v.push_back(s.substr(0, p));
s = s.substr(p + t.size());
}
v.push_back(s);
return v;
}
vector<int> Lis(const vector<int> &a) {
const int n = a.size();
vector<int> A(n, INF);
vector<int> id(n);
for (int i = 0; i < n; ++i) {
id[i] = distance(A.begin(), upper_bound(A.begin(), A.end(), a[i]));
A[id[i]] = a[i];
}
int m = *max_element(id.begin(), id.end());
vector<int> b(m + 1);
for (int i = n - 1; i >= 0; --i)
if (id[i] == m) b[m--] = a[i];
return b;
}
bool isPrime(ll n) {
if (n < 2) return false;
for (ll i = 2; i * i <= n; i++)
if (!(n % i)) return false;
return true;
}
ll MergeCount(vector<int> &a) {
ll count = 0;
int n = a.size();
if (n > 1) {
vector<int> b(a.begin(), a.begin() + n / 2);
vector<int> c(a.begin() + n / 2, a.end());
count += MergeCount(b);
count += MergeCount(c);
for (int i = 0, j = 0, k = 0; i < n; ++i)
if (k == c.size())
a[i] = b[j++];
else if (j == b.size())
a[i] = c[k++];
else if (b[j] <= c[k])
a[i] = b[j++];
else {
a[i] = c[k++];
count += n / 2 - j;
}
}
return count;
}
bool WarshallFloyd(vector<vector<ll>> &c) {
int V = c.size();
for (int i = 0; i < V; i++) {
c[i][i] = 0;
}
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
for (int k = 0; k < V; k++) {
if (c[j][k] > c[j][i] + c[i][k]) {
c[j][k] = c[j][i] + c[i][k];
}
}
}
}
for (int i = 0; i < V; i++) {
if (c[i][i] < 0) {
return false;
}
}
return true;
}
vector<ll> Dijkstra(int i, vector<vector<edge>> graph) {
int n = graph.size();
vector<ll> d(n, LONGINF);
d[i] = 0;
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
q;
q.push(make_pair(0, i));
while (!q.empty()) {
pair<ll, int> p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first) {
continue;
}
for (auto x : graph[v]) {
if (d[x.to] > d[v] + x.cost) {
d[x.to] = d[v] + x.cost;
q.push(make_pair(d[x.to], x.to));
}
}
}
return d;
}
bool BellmanFord(int start, int V, int E, vector<edge> Edge, vector<ll> &d) {
resize(d, V);
fill(d.begin(), d.end(), LONGINF);
d[start] = 0;
vector<bool> t(V, false);
for (int i = 0; i < V - 1; i++) {
for (int j = 0; j < E; j++) {
edge e = Edge[j];
if (d[e.from] == LONGINF) {
continue;
}
if (d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
}
}
}
for (int i = 0; i < V; i++) {
for (int j = 0; j < E; j++) {
edge e = Edge[j];
if (d[e.from] == LONGINF) {
continue;
}
if (d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
t[e.to] = true;
}
if (t[e.from]) {
t[e.to] = true;
}
}
}
if (t[V - 1]) {
return false;
}
return true;
}
bool TopologicalSort(const vector<vector<edge>> &g, vector<int> &ans) {
int n = g.size(), k = 0;
vector<int> ord(n), in(n);
for (auto &es : g) {
for (auto &e : es) {
in[e.to]++;
}
}
queue<int> q;
for (int i = 0; i < n; ++i) {
if (in[i] == 0) q.push(i);
}
while (!q.empty()) {
int v = q.front();
q.pop();
ord[k++] = v;
for (auto &e : g[v]) {
if (--in[e.to] == 0) q.push(e.to);
}
}
ans = ord;
if (*max_element(in.begin(), in.end()) == 0) {
return true;
}
return false;
}
vector<int> ArticulationNode(const vector<vector<edge>> &g) {
int n = g.size(), idx;
vector<int> low(n), ord(n), art;
function<void(int)> DFS = [&](int v) {
low[v] = ord[v] = ++idx;
for (auto &e : g[v]) {
int w = e.to;
if (ord[w] == 0) {
DFS(w);
low[v] = min(low[v], low[w]);
if ((ord[v] == 1 && ord[w] != 2) || (ord[v] != 1 && low[w] >= ord[v])) {
art.push_back(v);
}
} else {
low[v] = min(low[v], ord[w]);
}
}
};
for (int u = 0; u < n; u++) {
if (ord[u] == 0) {
idx = 0;
DFS(u);
}
}
sort(art.begin(), art.end());
art.erase(unique(art.begin(), art.end()), art.end());
return art;
}
vector<vector<edge>> to_roottree(const vector<vector<edge>> &g, int r) {
int n = g.size();
vector<vector<edge>> G(n);
vector<int> ord(n, -1);
queue<int> q;
q.push(r);
int k = 0;
while (q.size()) {
int u = q.front();
q.pop();
for (auto &e : g[u]) {
int v = e.to;
if (ord[v] == -1) {
ord[v] = k;
k++;
q.push(v);
G[u].emplace_back(e);
}
}
}
return G;
}
edge TreeDiameter(const vector<vector<edge>> &g) {
int start = 0;
static const auto bfs = [](const vector<vector<edge>> &g, int s,
queue<int> &q, vector<ll> &dist) {
while (!q.empty()) {
q.pop();
}
q.push(s);
int n = g.size();
dist.assign(n, LONGINF);
dist[s] = 0;
while (q.size()) {
int u = q.front();
q.pop();
for (auto &e : g[u]) {
int v = e.to;
if (dist[v] == LONGINF) {
dist[v] = dist[u] + e.cost;
q.push(v);
}
}
}
return dist;
};
vector<ll> dist;
queue<int> q;
bfs(g, start, q, dist);
int n = g.size(), u = -1, v = -1;
for (int i = 0; i < n; i++)
if (dist[i] != LONGINF && (u == -1 || dist[i] > dist[u])) u = i;
bfs(g, u, q, dist);
for (int i = 0; i < n; i++)
if (dist[i] != LONGINF && (v == -1 || dist[i] > dist[v])) v = i;
ll d = dist[v];
if (u > v) swap(u, v);
return edge(u, v, d);
}
void add_edge(vector<vector<edge>> &g, int a, int b, ll cost, ll cap) {
g[a].emplace_back(a, b, cost, cap);
g[b].emplace_back(b, a, cost, cap);
}
pair<vector<int>, vector<edge>> bridge(const vector<vector<edge>> &g) {
const int n = g.size();
int idx = 0, s = 0, t = 0, k = 0;
vector<int> ord(n, -1), onS(n), stk(n), roots(n), cmp(n);
vector<edge> brdg;
function<void(int, int)> dfs = [&](int v, int u) {
ord[v] = idx++;
stk[s++] = v;
onS[v] = true;
roots[t++] = v;
for (auto &e : g[v]) {
int w = e.to;
if (ord[w] == -1) {
dfs(w, v);
} else if (u != w && onS[w]) {
while (ord[roots[t - 1]] > ord[w]) {
--t;
}
}
}
if (v == roots[t - 1]) {
brdg.emplace_back(u, v, 0);
while (1) {
int w = stk[--s];
onS[w] = false;
cmp[w] = k;
if (v == w) break;
}
--t;
++k;
}
};
for (int u = 0; u < n; u++) {
if (ord[u] == -1) {
dfs(u, n);
brdg.pop_back();
}
}
return make_pair(cmp, brdg);
}
class UnionFind {
private:
std::vector<int> parent;
std::vector<int> height;
std::vector<int> m_size;
int forest_num;
public:
UnionFind(int size_) : parent(size_), height(size_, 0), m_size(size_, 1) {
forest_num = size_;
for (int i = 0; i < size_; ++i) parent[i] = i;
}
void init(int size_) {
parent.resize(size_);
height.resize(size_, 0);
m_size.resize(size_, 1);
forest_num = size_;
for (int i = 0; i < size_; ++i) parent[i] = i;
}
int find(int x) {
if (parent[x] == x) return x;
return parent[x] = find(parent[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
int t = size(x) + size(y);
m_size[x] = m_size[y] = t;
if (height[x] < height[y])
parent[x] = y;
else
parent[y] = x;
if (height[x] == height[y]) ++height[x];
forest_num--;
}
bool same(int x, int y) { return find(x) == find(y); }
int size(int x) {
if (parent[x] == x) return m_size[x];
return size(parent[x] = find(parent[x]));
}
int forest() { return forest_num; }
};
class Dinic {
private:
int n, s, t;
vector<int> level, prog, que;
vector<vector<ll>> cap, flow;
vector<vector<int>> g;
ll inf;
public:
Dinic(const vector<vector<edge>> &graph)
: n(graph.size()),
cap(n, vector<ll>(n)),
flow(n, vector<ll>(n)),
g(n, vector<int>()),
inf(LONGINF) {
for (int i = 0; i < n; i++) {
for (auto &e : graph[i]) {
int u = e.from, v = e.to;
ll c = e.capa;
cap[u][v] += c;
cap[v][u] += c;
flow[v][u] += c;
g[u].push_back(v);
g[v].push_back(u);
}
}
}
inline ll residue(int u, int v) { return cap[u][v] - flow[u][v]; }
ll solve(int s_, int t_) {
this->t = t_, this->s = s_;
que.resize(n + 1);
ll res = 0;
while (levelize()) {
prog.assign(n, 0);
res += augment(s, inf);
}
return res;
}
bool levelize() {
int l = 0, r = 0;
level.assign(n, -1);
level[s] = 0;
que[r++] = s;
while (l != r) {
int v = que[l++];
if (v == t) break;
for (const int &d : g[v])
if (level[d] == -1 && residue(v, d) != 0) {
level[d] = level[v] + 1;
que[r++] = d;
}
}
return level[t] != -1;
}
ll augment(int v, ll lim) {
ll res = 0;
if (v == t) return lim;
for (int &i = prog[v]; i < (int)g[v].size(); i++) {
const int &d = g[v][i];
if (residue(v, d) == 0 || level[v] >= level[d]) continue;
const ll aug = augment(d, min(lim, residue(v, d)));
flow[v][d] += aug;
flow[d][v] -= aug;
res += aug;
lim -= aug;
if (lim == 0) break;
}
return res;
}
};
class MinimumCostFlow {
private:
using Flow = ll;
using Cost = ll;
struct Edge {
int d;
Flow c, f;
Cost w;
int r, is_r;
Edge(int d_, Flow c_, Flow f_, Cost w_, int r_, bool is_r_)
: d(d_), c(c_), f(f_), w(w_), r(r_), is_r(is_r_) {}
};
int n;
vector<vector<Edge>> g;
public:
MinimumCostFlow(int n_) : n(n_), g(vector<vector<Edge>>(n_)) {}
void add_edge(int src, int dst, Flow cap, Cost cost) {
int rsrc = g[dst].size();
int rdst = g[src].size();
g[src].emplace_back(dst, cap, 0, cost, rsrc, false);
g[dst].emplace_back(src, cap, cap, -cost, rdst, true);
}
Cost solve(int s, int t, Flow f) {
Cost res = 0;
vector<Cost> h(n + 10), dist(n);
vector<int> prevv(n + 10), preve(n + 10);
using pcv = pair<Cost, int>;
priority_queue<pcv, vector<pcv>, greater<pcv>> q;
fill(h.begin(), h.end(), 0);
while (f > 0) {
fill(dist.begin(), dist.end(), LONGINF);
dist[s] = 0;
q.emplace(0, s);
while (q.size()) {
Cost cd;
int v;
tie(cd, v) = q.top();
q.pop();
if (dist[v] < cd) continue;
for (int i = 0; i < (int)(g[v].size()); ++i) {
Edge &e = g[v][i];
if (residue(e) == 0) continue;
if (dist[e.d] + h[e.d] > cd + h[v] + e.w) {
dist[e.d] = dist[v] + e.w + h[v] - h[e.d];
prevv[e.d] = v;
preve[e.d] = i;
q.emplace(dist[e.d], e.d);
}
}
}
if (dist[t] == LONGINF) return -1;
for (int i = 0; i < n; ++i) h[i] += dist[i];
Flow d = f;
for (int v = t; v != s; v = prevv[v]) {
chmin(d, residue(g[prevv[v]][preve[v]]));
}
f -= d;
res += d * h[t];
for (int v = t; v != s; v = prevv[v]) {
Edge &e = g[prevv[v]][preve[v]];
e.f += d;
g[v][e.r].f -= d;
}
}
return res;
}
Flow residue(const Edge &e) { return e.c - e.f; }
void show() {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < (int)(g[i].size()); ++j) {
Edge &e = g[i][j];
if (e.is_r) continue;
cout << i << "->" << e.d << "(flow:" << e.f << ")" << endl;
}
}
}
};
class BipartiteMatching {
private:
int V;
vector<int> match;
vector<bool> used;
vector<vector<int>> g;
vector<pair<int, int>> match_pair;
bool dfs(int v) {
used[v] = true;
for (int i = 0; i < (int)g[v].size(); i++) {
int u = g[v][i];
int w = match[u];
if (w < 0 || !used[w] && dfs(w)) {
match[v] = u;
match[u] = v;
match_pair.emplace_back(make_pair(u, v));
return true;
}
}
return false;
}
public:
BipartiteMatching(int n) {
V = n;
resize(match, n);
resize(used, n);
resize(g, n);
}
void add_edge(int u, int v) {
g[u].emplace_back(v);
g[v].emplace_back(u);
}
int MatchingSolve() {
int res = 0;
fill(match.begin(), match.end(), -1);
for (int v = 0; v < V; v++) {
if (match[v] < 0) {
fill(used.begin(), used.end(), false);
if (dfs(v)) {
res++;
}
}
}
return res;
}
vector<pair<int, int>> get_pair() {
for (auto x : match_pair) {
cout << x.first << " " << x.second << endl;
}
return match_pair;
}
};
class Lca {
private:
int n;
int log2_n;
vector<vector<int>> parent;
vector<int> depth;
void dfs(const vector<vector<edge>> &g, int v, int p, int d) {
parent[0][v] = p;
depth[v] = d;
for (auto &e : g[v]) {
if (e.to != p) {
dfs(g, e.to, v, d + 1);
}
}
}
public:
Lca(const vector<vector<edge>> &g, int root) {
n = g.size();
log2_n = (int)log2(n) + 1;
resize(parent, log2_n, n);
resize(depth, n);
dfs(g, root, -1, 0);
for (int k = 0; k + 1 < log2_n; k++) {
for (int v = 0; v < (int)g.size(); v++) {
if (parent[k][v] < 0) {
parent[k + 1][v] = -1;
} else {
parent[k + 1][v] = parent[k][parent[k][v]];
}
}
}
}
int get_lca(int u, int v) {
if (depth[u] > depth[v]) {
swap(u, v);
}
for (int k = 0; k < log2_n; k++) {
if ((depth[v] - depth[u]) >> k & 1) {
v = parent[k][v];
}
}
if (u == v) {
return u;
}
for (int k = log2_n - 1; k >= 0; k--) {
if (parent[k][u] != parent[k][v]) {
u = parent[k][u];
v = parent[k][v];
}
}
return parent[0][u];
}
int get_depth(int v) { return depth[v]; }
};
int main() {
int n;
cin >> n;
vector<int> a(n);
cin >> a;
int ans = INF;
int sum = 0;
int k = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (i & 1) {
if (sum >= 0) {
k += (sum + 1);
sum = -1;
}
} else {
if (sum <= 0) {
k += (1 - sum);
sum = 1;
}
}
}
chmin(ans, k);
k = 0;
sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (!(i & 1)) {
if (sum >= 0) {
k += (sum + 1);
sum = -1;
}
} else {
if (sum <= 0) {
k += (1 - sum);
sum = 1;
}
}
}
chmin(ans, k);
cout << ans << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int mpow(int base, int exp);
void ipgraph(int m);
void dfs(int u, int par);
const int mod = 1000000007;
const int N = 3e5, M = N;
vector<int> g[N];
long long a[N];
char f(string s) {
char x = s[0];
return x - 'a' + 'A';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i, n, k, j;
cin >> n;
for (i = 0; i < n; i++) cin >> a[i];
long long ans = 0;
long long pre = a[0], to;
for (i = 1; 1 < n ? i < n : i > n; 1 < n ? i += 1 : i -= 1) {
to = pre + a[i];
long long need = abs(pre) + 1;
if (pre > 0) need = -need;
if (to * pre >= 0) {
pre += need;
ans += abs(need - a[i]);
} else
pre = to;
}
cout << ans << endl;
return 0;
}
int mpow(int base, int exp) {
base %= mod;
int result = 1;
while (exp > 0) {
if (exp & 1) result = ((long long)result * base) % mod;
base = ((long long)base * base) % mod;
exp >>= 1;
}
return result;
}
void ipgraph(int m) {
int i, u, v;
for (i = 0; i < m; i++) {
cin >> u >> v;
u++, v++;
g[u - 1].push_back(v - 1);
g[v - 1].push_back(u - 1);
}
}
void dfs(int u, int par) {
for (int v : g[u]) {
if (v == par) continue;
dfs(v, u);
}
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int n;
cin >> n;
vector<long long int> a(n);
for (int i = 0; i < (n); i++) {
cin >> a[i];
}
long long int oddcount = 0, evencount = 0;
long long int oddsum = 0, evensum = 0;
bool oddplus = true, evenplus = false;
for (int i = 0; i < (n); i++) {
oddsum += a[i];
evensum += a[i];
if (oddplus && oddsum <= 0) {
oddcount += 1 - oddsum;
oddsum = 1;
} else if (!oddplus && oddsum >= 0) {
oddcount += 1 + oddsum;
oddsum = -1;
}
if (evenplus && evensum <= 0) {
evencount += 1 - evensum;
evensum = 1;
} else if (!evenplus && evensum >= 0) {
evencount += 1 + evensum;
evensum = -1;
}
oddplus = !oddplus;
evenplus = !evenplus;
}
cout << fmin(oddcount, evencount) << endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int MAX = 1e6;
int arr[MAX], arr2[MAX], n;
int status(int a) {
if (a < 0)
return 1;
else if (a > 0)
return 0;
else
return 2;
}
long long int solve() {
long long int cnt = 0;
arr2[0] = arr[0];
for (int i = 1; i < n; i++) {
arr2[i] = arr[i];
if (status(arr2[i - 1]) == status(arr2[i])) {
cnt += abs(arr2[i] * 2);
arr2[i] *= -1;
}
}
long long int sum = arr2[0], f = 0;
if (arr2[0] < 0)
f = 1;
else
f = 0;
for (int i = 1; i < n; i++) {
f ^= 1;
sum += arr2[i];
if (status(sum) != f) {
cnt += abs(sum) + 1;
if (f)
sum = -1;
else
sum = 1;
}
}
return cnt;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
if (!arr[0]) {
arr[0] = 1;
long long int x = solve() + 1;
arr[0] = -1;
long long int y = solve() + 1;
cout << min(x, y) << endl;
} else
cout << solve() << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | N=gets.to_i
list=gets.split(" ").map(&:to_i)
sum = 0
res = 0
def sign(i)
if (i>0) then
1
elsif i < 0 then
-1
else
0
end
end
if(list[0] == 0) then
temp = 0
flag= true
(N-1).times{|i|
temp += list[i+1]
if(temp != 0 && flag) then
res +=1
if((i+1)%2 == 0) then
list[0] = sign(list[i+1])
else
list[0] = -sign(list[i+1])
end
flag = false
end
if(i == N-2 && flag) then
res += 1
list[0]=1
end
}
end
N.times{|i|
before_sum = sum
sum += list[i]
if (sum*before_sum> 0) then
if(sum > 0) then
res += (sum+1)
sum = -1
else
res += (-sum+1)
sum = 1
end
elsif sum*before_sum==0 then
if(before_sum < 0 )then
res += 1
sum = 1
elsif(before_sum > 0) then
sum = -1
res += 1
end
end
}
puts(res)
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | // AtCoder-Template.cpp : このファイルには 'main' 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <iostream>
#include <algorithm>
#include <bitset>
#include <bits/stdc+++.h>
using namespace std;
using ll = long long;
#define FOR(i,N) for(auto i=0; i<N; ++i)
/* clang-format off */
template <class T> inline void chmin(T& a, const T& b) { if (b < a) a = b; }
/* clang-format on */
int main() {
ll N; cin >> N; vector<ll> A(N); FOR(i, N) cin >> A[i];
ll ans = 0;
auto getSign = [](auto a) { if (a > 0) return 1; else return -1; };
auto reverseSign = [&](auto a) { return -1 * getSign(a); };
ll accumu = A[0];
if (accumu <= 0) {
ans += abs(accumu) + 1;
accumu = 1;
}
FOR(i, N - 1) {
accumu += A[i + 1];
if (i + 1 >= 1 and !( ((i+1)%2 == 0) ? accumu > 0 : accumu < 0) ) {
ans += abs(accumu) + 1;
accumu = reverseSign(accumu);
}
;
}
// --------------------------
accumu = A[0];
ll tmp = 0;
if (accumu >= 0) {
tmp += abs(accumu) + 1;
accumu = -1;
}
FOR(i, N - 1) {
accumu += A[i + 1];
if (i + 1 >= 1 and !(((i+1)% 2 == 1) ? accumu > 0 : accumu < 0)) {
tmp += abs(accumu) + 1;
accumu = reverseSign(accumu);
}
}
chmin(ans, tmp);
cout << ans << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | import sys
input = sys.stdin.readline
n = int(input())
s = list(map(int, input().split()))
l = [0] * (n + 1)
l[0] = 0
for i in range(1, n + 1):
l[i] = l[i - 1] + s[i - 1]
count = 0
for i in range(1, n):
subl = l[i:i + 2]
if 0 in subl:
if subl[0] > 0:
count += 1
l[i + 1] = -1
else:
count += 1
l[i + 1] = 1
if subl[0] * subl[1] > 0:
t = subl[1]
m = True
if t > 0:
t = 1 + t
else:
t = 1 - t
m = False
count += t
for j in range(i + 1, n + 1):
if m:
l[j] -= t
else:
l[j] += t
print(count) |
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | n = int(input())
al = list(map(int, input().split()))
m = n//2
mm = n % 2
temp = al[0]
res = 0
if temp > 0 and mm ==1:
for i in range(1,m+1):
temp +=al[i*2-1]
if temp <0:
pass
else:
res += temp+1
temp = -1
temp +=al[i*2]
if temp >0:
pass
else:
res +=1-temp
temp = 1
print(res)
exit()
if temp > 0 and mm ==0:
for i in range(1,m):
temp +=al[i*2-1]
if temp <0:
pass
else:
res += temp+1
temp = -1
temp +=al[i*2]
if temp >0:
pass
else:
res +=1-temp
temp = 1
temp += al[n-1]
if temp <0:
pass
else:
res += temp+1
temp = -1
print(res)
exit()
if temp < 0 and mm ==1:
for i in range(1,m+1):
temp +=al[i*2-1]
if temp >0:
pass
else:
res += 1-temp
temp = 1
temp +=al[i*2]
if temp <0:
pass
else:
res +=temp+1
temp = -1
print(res)
exit()
if temp < 0 and mm ==0:
for i in range(1,m):
temp +=al[i*2-1]
if temp >0:
pass
else:
res += 1-temp
temp = 1
temp +=al[i*2]
if temp <0:
pass
else:
res +=temp+1
temp = -1
temp += al[n-1]
if temp >0:
pass
else:
res += 1-temp
temp = 1
print(res)
exit() |
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | import copy
import sys
write = sys.stdout.write
n = int(input())
A = list(map(int,input().split())) # +, -, +, ...
B = copy.deepcopy(A) #-, +, -, ...
sumA = []
sumB = []
cntA = 0
cntB = 0
if A[0] == 0:
A[0] += 1
B[0] -= 1
elif A[0] > 0:
cntB += (B[0]+1)
B[0] = -1
else:
cntA += abs(A[0])+1
A[0] = 1
sumA.append(A[0])
sumB.append(B[0])
#write("cntA : " + str(cntA) + " cntB : " + str(cntB) + "\n")
for i in range(1, n):
tempA = sumA[i-1] + A[i]
tempB = sumB[i-1] + B[i]
if i%2 == 1: #Aは-, Bは+
if tempA == 0:
#A[i] -= 1
cntA += 1
sumA.append(-1)
elif tempA > 0:
#A[i] -= abs(tempA) + 1
cntA += abs(tempA) + 1
sumA.append(-1)
else:
sumA.append(tempA)
if tempB == 0:
#B[i] += 1
cntB += 1
sumB.append(1)
elif tempB < 0:
#B[i] += abs(tempB) + 1
cntB += abs(tempB) + 1
sumB.append(1)
else:
sumB.append(tempB)
else: #Aは+, Bは-
if tempA == 0:
cntA += 1
sumA.append(1)
elif tempA < 0:
cntA += abs(tempA) + 1
sumA.append(1)
else:
sumA.append(tempA)
if tempB == 0:
#B[i] -= 1
cntB += 1
sumB.append(-1)
elif tempB > 0:
#B[i] -= abs(tempB) + 1
cntB += abs(tempB) + 1
sumB.append(-1)
else:
sumB.append(tempB)
#write("cntA : " + str(cntA) + " cntB : " + str(cntB) + "\n")
#条件を満たしていなければREを吐く
if sumA[i]*sumA[i-1] >= 0 or sumB[i]*sumB[i-1] >= 0:
re = []
re[1] = "fuck"
print(str(min(cntA, cntB))) |
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | n = int(input())
a = list(map(int, input().split()))
ans = 0
tmp = a[0]
for i in range(n-1):
if (tmp > 0):
while not (-tmp > a[i+1]):
n = -tmp - a[i+1] - 1
a[i+1] += n
ans += -n
else:
while not (-tmp < a[i+1]):
n = -tmp - a[i+1] + 1
a[i+1] += n
ans += n
tmp += a[i+1]
print(ans)
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<long long> S;
vector<long long> A;
bool is_plus;
int ans = 0;
long long sum = 0;
cin >> n;
S.push_back(0);
for (int i = 0; i < n; i++) {
long long a;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < n; i++) {
if (!i) {
sum = A[i];
continue;
}
bool is_plus = sum > 0;
sum += A[i];
if (sum == 0) {
ans += 1;
sum = is_plus ? -1 : 1;
} else if (is_plus == (sum > 0)) {
ans += abs(sum) + 1;
sum = is_plus ? -1 : 1;
}
}
cout << ans << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | from sys import stdin
if __name__ == "__main__":
_in = [_.rstrip() for _ in stdin.readlines()]
n = int(_in[0]) # type:int
a_arr = list(map(int,_in[1].split(' '))) # type:list(int)
# vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
cnt = 0
sum_ = 0
for i in range(0,n):
if i==0:
if a_arr[0]==0:
while a_arr[i]==0:
i+=1
else:
if a_arr[i+1]>0:
sum_ = (-1)**i
cnt += 1
else:
sum_ = (-1)**(i+1)
cnt += 1
else:
sum_ = a_arr[i]
else:
if sum_<0:
if sum_+a_arr[i]<=0:
cnt += 1-(sum_+a_arr[i])
sum_ = 1
else:
sum_ = sum_+a_arr[i]
else:
if sum_+a_arr[i]>=0:
cnt += 1+(sum_+a_arr[i])
sum_ = -1
else:
sum_ = sum_+a_arr[i]
# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
print(cnt)
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
const long long INF = 300000000;
const long long MOD = 1000000007;
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
long long a[100100];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
long long ans = INF;
for (int i = 0; i < 2; ++i) {
long long count = 0;
int su = 0;
for (int j = 0; j < n; ++j) {
su += a[j];
if (i == 0) {
if (j % 2 == 0 && su <= 0) {
count += abs(-su + 1);
su = 1;
} else if (j % 2 == 1 && su >= 0) {
count += abs(-su - 1);
su = 1;
}
}
if (i == 1) {
if (j % 2 == 1 && su <= 0) {
count += abs(-su + 1);
su = 1;
} else if (j % 2 == 0 && su >= 0) {
count += abs(-su - 1);
su = 1;
}
}
}
ans = min(ans, count);
}
cout << ans << endl;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | from sys import stdin
import sys
import math
n = int(input())
a = list(map(int, stdin.readline().rstrip().split()))
pair = 0
odd = 0
for i in range(0, len(a), 2):
pair += a[i]
for i in range(1, len(a), 2):
odd += a[i]
#print(odd)
#print(pair)
count = 0
current_sum = 0
for i in range(len(a)):
## odd
if i % 2 == 1 and odd > pair:
if current_sum + a[i] < 1:
diff = 1 - (current_sum + a[i])
a[i] += diff
count += diff
## odd
elif i % 2 == 1 and odd < pair:
if current_sum + a[i] > -1:
diff = -1 - (current_sum + a[i])
a[i] += diff
count += -1 * diff
## pair
elif i % 2 == 0 and odd > pair:
if current_sum + a[i] > -1:
diff = -1 - (current_sum + a[i])
a[i] += diff
count += -1 * diff
elif i % 2 == 0 and odd < pair:
if current_sum + a[i] < 1:
diff = 1 - (current_sum + a[i])
a[i] += diff
count += diff
else:
print("error")
current_sum += a[i]
print(count)
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | N = int(input())
A = list(map(int,input().split()))
tot = 0
cnt = 0
for i in range(N):
tot += A[i]
if i%2==0:
if tot<0:
cnt += abs(tot)+1
tot = 1
if i%2==1:
if tot>0:
cnt += tot+1
tot = -1
cmin = cnt
cnt = 0
tot = 0
for i in range(N):
tot += A[i]
if i%2==0:
if tot>0:
cnt += tot+1
tot = -1
else:
if tot<0:
cnt += abs(tot)+1
tot = 1
cmin = min(cmin,cnt)
print(cmin) |
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | n = int(input())
array = list(map(int, input().split()))
total = 0
flag = -1
minus = 0
for tmp in range(len(array)):
total += array[tmp]
if total * flag <= 0:
minus += abs(total*flag)+1
total = flag
flag *= -1
total = 0
flag = 1
plus = 0
for tmp in range(len(array)):
total += array[tmp]
if total * flag <= 0:
plus += abs(total*flag)+1
total = flag
flag *= -1
print(min(minus, plus))
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
struct __ {
__() {
ios_base::Init i;
ios_base::sync_with_stdio(0);
cin.tie(0);
}
} __;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
int cnt = 0;
if (v[0] <= 0) {
v[0] = 1;
cnt += 1 + abs(v[0]);
}
long long ans = v[0];
for (int i = 1; i < n; ++i) {
ans += v[i];
if (i % 2 == 0 && ans <= 0) {
int x = min(1 + abs(ans), abs(ans - v[i]) - 1);
cnt += 1 + abs(ans);
v[i] = v[i] + (1 + abs(ans) - x);
v[i - 1] = v[i - 1] - x;
ans = 1;
}
if (i % 2 == 1 && ans >= 0) {
int x = min(1 + ans, ans - v[i] - 1);
v[i] = v[i] - (1 + ans - x);
v[i - 1] = v[i - 1] - x;
cnt += 1 + ans;
ans = -1;
}
}
cout << cnt;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> v(n), s(n, 0);
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> v[i];
sum += v[i];
s[i] = sum;
}
vector<ll> sc = s;
ll c = 0;
ll ans = 0;
if (s[0] == 0) s[0]++, c++, ans++;
for (int i = 1; i < n; i++) {
s[i] += c;
if (s[i - 1] * s[i] > 0) {
ans += abs(s[i]);
c -= s[i];
s[i] -= s[i];
}
if (s[i] == 0) {
if (s[i - 1] < 0) s[i]++, c++, ans++;
if (s[i - 1] > 0) s[i]--, c--, ans++;
}
}
s = sc;
c = 0;
ll ans2 = 0;
ans2 += abs(s[0]);
c -= s[0];
s[0] -= s[0];
if (s[0] == 0) s[0]--, c--, ans2++;
for (int i = 1; i < n; i++) {
s[i] += c;
if (s[i - 1] * s[i] > 0) {
ans2 += abs(s[i]);
c -= s[i];
s[i] -= s[i];
}
if (s[i] == 0) {
if (s[i - 1] < 0) s[i]++, c++, ans2++;
if (s[i - 1] > 0) s[i]--, c--, ans2++;
}
}
ans = min(ans, ans2);
cout << ans << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long n = 0, a[100000] = {}, b = 0;
cin >> n;
for (int i = 0; i < (int)n; ++i) {
cin >> a[i];
}
int count_p = 0, count_q = 0;
for (int i = 0; i < (int)n; ++i) {
b = a[i];
if (i % 2 == 0) {
if (b >= 0) {
count_p += abs(-1 - b);
b = -1;
}
} else {
if (b <= 0) {
count_p += abs(1 - b);
b = 1;
}
}
}
for (int i = 0; i < (int)n; ++i) {
b += a[i];
if (i % 2 == 0) {
if (b <= 0) {
count_q += abs(1 - b);
b = 1;
}
} else {
if (b >= 0) {
count_q += abs(-1 - b);
b = -1;
}
}
}
cout << std::min(count_p, count_q) << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | python3 | # -*- coding: utf-8 -*-
import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
A = list(map(int,readline().split()))
S1 = np.cumsum(A)
S2 = np.cumsum(A)
ans1 = 0
ans2 = 0
# 偶数項-,奇数項を+にする
for i in range(N):
if i & 1:
if S1[i] >= 0:
ans1 += S1[i]+1
S1 -= S1[i]+1
if S2[i] <= 0:
ans2 += 1-S2[i]
S2 += 1-S2[i]
else:
if S1[i] <= 0:
ans1 += 1-S1[i]
S1 += 1-S1[i]
if S2[i] >= 0:
ans2 += S2[i]+1
S2 -= S2[i]+1
print(min(ans1,ans2)) |
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
#include <boost/range/irange.hpp>
#include <boost/range/adaptors.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long int;
int main() {
ll n;
cin >> n;
ll count{0}, s_now{0}, s_prev{0};
vector<ll> as(n, 0);
for (auto &&i: irange(0LL, n)){
cin >> as.at(i);
}
bool flag{false};
bool direction;
for (auto &&i: irange(0LL, n)){
if (as.at(i)!=0){
direction = (i%2 != 0);
flag = true;
break;
}
}
if (!flag)return as.size();
if (as.at(0)==0){
count++;
s_prev = direction ? 1 : -1;
} else {
s_prev = as.at(0);
}
for (auto &&i: irange(1LL, n)){
// cout << "old s: " << s_prev;
s_now = s_prev + as.at(i);
// cout << " new s: " << s_now << endl;
if (s_prev * s_now >= 0){
// cout << "kakikae because: " << s_prev * s_now << endl;
ll target = s_prev < 0 ? 1 : -1;
// cout << "from: " << s_now << " to: " << target << endl;
count += abs(target - s_now);
// cout << "count: " << count << endl;
s_now = target;
}
s_prev = s_now;
}
cout << count;
return 0;
} |
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | cpp | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (a[0] < 0) {
for (int i = 0; i < n; i++) {
a[i] *= -1;
}
}
int64_t ans1 = 0;
int64_t sum1 = 0;
for (int i = 0; i < n; i++) {
sum1 += a[i];
if (i % 2 == 0) {
if (sum1 <= 0) {
ans1 += 1 - sum1;
sum1 = 1;
}
} else {
if (sum1 >= 0) {
ans1 += sum1 + 1;
sum1 = -1;
}
}
}
int64_t ans2 = 0;
int64_t sum2 = 0;
for (int i = 0; i < n; i++) {
sum2 += a[i];
if (i % 2 == 0) {
if (sum2 <= 0) {
ans2 += 1 - sum2;
sum2 = 1;
}
} else {
if (sum2 >= 0) {
ans2 += sum2 + 1;
sum2 = -1;
}
}
}
cout << min(ans1, ans2) << endl;
return 0;
}
|
p03739 AtCoder Beginner Contest 059 - Sequence | You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one.
At least how many operations are necessary to satisfy the following conditions?
* For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.
* For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.
Constraints
* 2 ≤ n ≤ 10^5
* |a_i| ≤ 10^9
* Each a_i is an integer.
Input
Input is given from Standard Input in the following format:
n
a_1 a_2 ... a_n
Output
Print the minimum necessary count of operations.
Examples
Input
4
1 -3 1 0
Output
4
Input
5
3 -6 4 -5 7
Output
0
Input
6
-1 4 3 2 -5 4
Output
8 | {
"input": [
"5\n3 -6 4 -5 7",
"4\n1 -3 1 0",
"6\n-1 4 3 2 -5 4"
],
"output": [
"0",
"4",
"8"
]
} | {
"input": [],
"output": []
} | IN-CORRECT | UNKNOWN | #include <bits/stdc++.h>
int main(void) {
long long int a[100000];
int i, n;
long long int sum = 0, check = 0, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
for (i = 0; i < n; i++) {
sum += a[i];
switch (check) {
case 1:
if (sum >= 0) {
count += sum + 1;
sum = -1;
}
break;
case -1:
if (sum <= 0) {
count += 1 - sum;
sum = -1;
}
break;
default:
break;
}
if (sum > 0) {
check = 1;
} else {
check = -1;
}
}
printf("%lld", count);
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.