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 | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long curr, ans = 0;
cin >> curr;
for (int i = 1; i < n; ++i) {
long long t;
cin >> t;
if (curr > 0 && t + curr < 0) {
curr += t;
continue;
}
if (curr < 0 && t + curr > 0) {
curr += t;
continue;
} else {
if (curr > 0 && t + curr > 0) {
int t1 = -1 - (curr);
int t2 = t1 - t;
ans += abs(t2);
curr = -1;
continue;
}
if (curr < 0 && t + curr < 0) {
int t1 = 1 - (curr);
int t2 = t1 - t;
ans += abs(t2);
curr = 1;
continue;
}
if (!(t + curr)) {
if (curr > 0) {
ans += 1;
curr = -1;
} else if (curr < 0) {
ans += 1;
curr = 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 | n = int(input())
a = [int(i) for i in input().split()]
s0 = a[0]
count=0
if a[0]==0:
s0+=1
count+=1
for i in range(1,n):
s1 = s0+a[i]
if s0*s1>=0:
if s1>0:
a[i]-=(abs(s1)+1)
count+=(abs(s1)+1)
elif s1<0:
a[i]+=(abs(s1)+1)
count+=(abs(s1)+1)
elif s1==0:
if s0>0:
a[i]-=1
count+=1
elif s0<0:
a[i]+=1
count+=1
s0 += 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 | cpp | #include <bits/stdc++.h>
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
void OutputError(std::string s) {
cerr << "\033[93m" << s << "\033[m" << endl;
return;
}
int64_t Solve(std::vector<int64_t> a, int n, bool is_plus) {
int64_t result = 0;
int64_t cum = 0;
for (int i = 0; i < n; i++) {
cum += a[i];
if (is_plus) {
if (cum >= 0) {
result += cum + 1;
cum = -1;
is_plus = false;
} else {
is_plus = false;
}
} else {
if (cum > 0) {
is_plus = true;
} else {
result += (-cum) + 1;
cum = 1;
is_plus = true;
}
}
}
return result;
}
int main(void) {
cout << std::fixed << std::setprecision(10);
cin.tie(0);
std::ios::sync_with_stdio(false);
int n;
cin >> n;
std::vector<int64_t> a(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int64_t result = 0;
if (a[0] > 0) {
result = Solve(a, n, false);
} else if (a[0] < 0) {
result = Solve(a, n, true);
} else {
a[0] = 1;
result = Solve(a, n, false);
a[0] = -1;
result = std::min(result, Solve(a, n, true));
}
cout << result << 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 | java | import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static int[][] map;
static int[][] label;
static ArrayList<String> list;
static int M;
static int N;
static int T;
static int P;
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
long sum = scanner.nextLong();
long ans = 0;
boolean sign = true;
if(sum < 0)sign = false;
for (int i = 0; i < n - 1; i++) {
sum += scanner.nextLong();
// System.out.println(sum);
if(sign){
if(sum > 0){
ans += sum + 1;
sum = -1;
}
sign = false;
}else{
if(sum < 0){
ans -= sum - 1;
sum = 1;
}
sign = true;
}
}
System.out.println(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 long long mod = 1000000007;
const long long LINF = 1LL << 60;
const int INF = 1 << 30;
int main() {
long long n, l;
cin >> n;
vector<long long> a(n);
cin >> a[0];
for (long long i = 1; i < n; i++) {
cin >> l;
a[i] = a[i - 1] + l;
}
long long tmp = 0;
long long count = 0;
for (long long i = 0; i < n - 1; i++) {
if (i == 0 && a[i] == 0) {
if (a[i + 1] != 0) {
tmp += -1 * a[i + 1] / abs(a[i + 1]);
} else {
tmp = 1;
}
}
if ((a[i] + tmp) * (a[i + 1] + tmp) >= 0) {
if ((a[i + 1] + tmp) <= 0) {
count += abs(a[i + 1] + tmp - 1);
tmp -= (a[i + 1] + tmp - 1);
} else {
count += abs(a[i] + tmp + 1);
tmp -= (a[i] + tmp + 1);
}
}
}
if (a[n - 1] + tmp == 0) {
count++;
}
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 | python3 | n=int(input())
p=list(map(int,input().split()))
stack=[0]*(n+1)
ans=0
if p[0]==0:
p[0]=1
ans+=1
stack[1]=1
else:
stack[1]=p[0]
for i in range(1,n):
if i%2==1:
if p[i]+p[i-1]+stack[i-1]>=0:
p[i]-=(p[i]+p[i-1]+stack[i-1])+1
ans+=(p[i]+p[i-1]+stack[i-1])+1
else:
if p[i]+p[i-1]+stack[i-1]<=0:
p[i]+=-(p[i]+p[i-1]+stack[i-1])+1
ans+=-(p[i]+p[i-1]+stack[i-1])+1
stack=p[i]+p[i-1]+stack[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;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
long long sum = a[0];
long long cnt = 0;
if (sum == 0) {
int ind = 1;
for (int i = 0; i < n; i++) {
if (a[i] != 0) ind = i;
break;
}
if (a[ind] > 0)
sum = (ind % 2 == 0 ? -1 : 1);
else
sum = (ind % 2 == 0 ? 1 : -1);
cnt++;
}
cout << sum << endl;
for (int i = 1; i < n; i++) {
long long nsum = sum + a[i];
if (sum > 0 && nsum < 0 || sum < 0 && nsum > 0) {
sum = nsum;
continue;
}
sum = (sum > 0 ? -1 : 1);
cnt += (nsum == 0 ? 1 : abs(nsum) + 1);
cout << i << " " << nsum << endl;
}
cout << cnt << 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;
vector<int> a(N + 10);
long calc(long s) {
long sum = 0, res = 0;
for (int i = 0; i < N; i++, s *= -1) {
sum += a[i];
if (sum * s > 0) {
continue;
}
res += abs(sum - s);
sum += s * abs(sum - s);
}
return res;
}
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
cout << min(calc(1), calc(-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;
int check(long long int a) {
if (a > 0) return 1;
if (a < 0) return 2;
return 0;
}
int main() {
long long int sum, n, i, cnt = 0;
cin >> n;
long long int x, a[n];
for (i = 0; i < n; i++) cin >> a[i];
sum = a[0];
if (sum == 0) cnt++, sum++;
for (i = 1; i < n; i++) {
if (check(sum + a[i]) == check(sum)) {
if (sum < 0) {
x = 1 - sum;
cnt += (x - a[i]);
sum = 1;
} else {
x = -1 - sum;
cnt += (a[i] - x);
sum = -1;
}
} else
sum += a[i];
if (sum == 0) cnt++, sum = 1;
}
cout << cnt;
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<int> a(n + 1);
for (int i = 1; i <= n; i++) cin >> a[i];
vector<int> a1;
a1 = a;
int sum1 = 0, ans1 = 0;
for (int i = 1; i <= n; i++) {
sum1 += a1[i];
if (i == 1 && sum1 > 0)
continue;
else if (i == 1) {
int plus = 1 - sum1;
sum1 += plus;
ans1 += plus;
}
if (i % 2 == 0 && sum1 < 0)
continue;
else if (i % 2 == 0) {
int minus = 1 + sum1;
sum1 -= minus;
ans1 += minus;
} else if (sum1 > 0)
continue;
else {
int plus = 1 - sum1;
sum1 += plus;
ans1 += plus;
}
}
vector<int> a2;
a2 = a;
int sum2 = 0, ans2 = 0;
for (int i = 1; i <= n; i++) {
sum2 += a2[i];
if (i == 1 && sum2 < 0)
continue;
else if (i == 1) {
int minus = 1 + sum2;
sum2 -= minus;
ans2 += minus;
}
if (i % 2 == 0 && sum2 > 0)
continue;
else if (i % 2 == 0) {
int plus = 1 - sum2;
sum2 += plus;
ans2 += plus;
} else if (sum2 < 0)
continue;
else {
int minus = 1 + sum2;
sum2 -= minus;
ans2 += minus;
}
}
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 | python3 | def solve():
n = int(input())
a = list(map(int, input().split()))
i = 0
sum = 0
ans = 0
for i in range(n-1):
sum += a[i]
if sum > 0 and sum+a[i+1] > 0:
while sum + a[i+1] >= 0:
a[i+1] -= 1
ans += 1
elif sum < 0 and sum+a[i+1] < 0:
while sum + a[i+1] <= 0:
a[i+1] += 1
ans += 1
print(ans)
#print(a)
if __name__ == "__main__":
solve()
|
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);
for (int i = 0; i < n; ++i) cin >> a[i];
int ans1 = 0, ans2 = 0, sum = 0;
for (int i = 0; i < n; ++i) {
sum += a[i];
if (i % 2 == 0 && sum <= 0) {
ans1 += 1 - sum;
sum = 1;
} else if (i % 2 == 1 && sum >= 0) {
ans1 += 1 + sum;
sum = -1;
}
}
sum = 0;
for (int i = 0; i < n; ++i) {
sum += a[i];
if (i % 2 == 1 && sum <= 0) {
ans2 += 1 - sum;
sum = 1;
} else if (i % 2 == 0 && sum >= 0) {
ans2 += 1 + sum;
sum = -1;
}
}
cout << min(ans1, ans2) << 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;
void sum(int* N, int* S, int n);
void add(int* S, int n, int del, int k);
int main() {
int *N, *S;
int count_eve = 0, count_odd = 0, n;
int j = 0, k = 0;
cin >> n;
N = new int[n];
S = new int[n];
for (int i = 0; i < n; i++) {
cin >> N[i];
}
sum(N, S, n);
int del1 = 0, del2 = 0;
while (j != n) {
if (j % 2 == 0 && S[j] + del1 <= 0) {
count_eve += abs(S[j] + del1) + 1;
del1 += abs(S[j] + del1) + 1;
} else if (j % 2 == 1 && S[j] + del1 >= 0) {
count_eve += abs(S[j] + del1) + 1;
del1 += -abs(S[j] + del1) - 1;
}
j++;
}
sum(N, S, n);
while (k != n) {
if (k % 2 == 0 && S[k] + del2 >= 0) {
count_odd += abs(S[k] + del2) + 1;
del2 += -abs(S[k] + del2) - 1;
} else if (k % 2 == 1 && S[k] + del2 <= 0) {
count_odd += abs(S[k] + del2) + 1;
del2 += abs(S[k] + del2) + 1;
}
k++;
}
cout << min(count_eve, count_odd) << endl;
delete[] N;
delete[] S;
return 0;
}
void sum(int* N, int* S, int n) {
S[0] = N[0];
for (int i = 1; i < n; i++) S[i] = S[i - 1] + N[i];
}
void add(int* S, int n, int del, int k) {
for (int i = k; i < n + 1; i++) S[i] += del;
}
|
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 | gets
seq = gets.split.map(&:to_i)
def foo(seq)
cnt = 0
sum = seq.shift
seq.each{|a|
if sum < 0
if sum + a > 0
sum += a
else
cnt += 1 - (sum + a)
sum = 1
end
else
if sum + a < 0
sum += a
else
cnt += 1 + (sum + a)
sum = -1
end
end
}
return cnt
end
zero_cnt = 0
while seq.shift == 0
zero_cnt += 1
end
p (zero_cnt * 2) - 1 + foo(seq)
|
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 <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define MOD 1000000007
# define INF (1 < <29)
#define MODSET(d) if ((d) >= MOD) d %= MOD;
#define MODNEGSET(d) if ((d) < 0) d = ((d % MOD) + MOD) % MOD;
#define MODADDSET(d) if ((d) >= MOD) d -= MOD;
#define MODADDWHILESET(d) while ((d) >= MOD) d -= MOD;
//defines
#define FILE_IO freopen("in.txt","r",stdin); freopen("out.txt","w",stdout);
#define sc1(a,type) type a; cin>>a;
#define sc2(a,b,type) type a,b; cin>>a>>b;
#define sc3(a, b, c,type) type a,b,c; cin>>a>>b>>c;
#define sc4(a, b, c, d,type) type a ,b,c,d; cin>>a>>b>>c>>d;
#define nl cout<<"\n";
#define foreach(v, c) for(__typeof( (c).begin()) v = (c).begin(); v != (c).end(); ++v)
#define revforeach(v, c) for(__typeof( (c).rbegin()) v = (c).rbegin(); v != (c).rend(); ++v)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);
#define re(i,b) for(int i=0;i<int(b);i++)
#define re1(i,b) for(int i=1;i<=int(b);i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(),c.rend()
#define mpresent(container, element) (container.find(element) != container.end()) //for map,set..etc (returns true/false value)
#define vpresent(container, element) (find(all(container),element) != container.end()) //for vectors,strings,list,deque (returns true/false value)
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define ins insert
#define F first
#define S second
#define clr clear()
#define sz(x) ((int)x.size())
#define dt distance
#define test(t) int t; cin>>t; while(t--)
#define csb(i) __builtin_popcount(i)
#define csbll(i) __builtin_popcountll(i)
#define clz(x) __builtin_clz(x)
#define clzl(x) __builtin_clzl(x)
#define cp(x) __builtin_parity(x)
#define adv(v,num) advance(v,num)//used for lists and other structures that use iterators,when you can't access elements randomly ( iterator moves num positions)
#define mod 1000000007
#define MAX_ARR 1000000
#define v2d(rowsize,colsize,type,name) vector<vector<type>> name(rowsize,vector<type>(colsize));
#define digits_in(i) (ll)log10(i)+1 // gives no of digits in a number
#define sqr(x) (x)*(x)
//does not apply for i==0 , add an excetion contition for n==0 ( cust return count 1 for that inseted of using this function)
//typedef
typedef string str;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<str> vs;
typedef vector<char> vc;
typedef pair<int,int> pii;
typedef pair<str,int> psi;
typedef pair<int,str> pis;
typedef vector<pii> vii;
typedef map<int,int> mii;
typedef map<ll,ll> mll;
typedef map<str,int> msi;
typedef map<char,int> mci;
typedef map<int,str> mis;
typedef unordered_map<int,int> umii;
typedef unordered_map<str,int> umsi;
typedef unordered_map<int,str> umis;
typedef unordered_map<str,str> umss;
typedef unordered_map<char,int> umci;
typedef set<str> ss;
typedef set<int> si;
typedef unordered_set<str> uss;
typedef unordered_set<int> usi;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
// #ifndef ONLINE_JUDGE
// #include "debug.h"
// #else
// #define debug(args...)
// #endif
int main(){fastio
// #ifndef ONLINE_JUDGE
// FILE_IO
// #endif
vll v;
test(t){
int temp;cin>>temp;
v.pb(temp);
}
vll v1(all(v));
ll ct=0;
re(i,sz(v)-1){
// debug(v[i] ,v[i]+v[i+1]);
if( (v[i]<0 && v[i]+v[i+1]<0) || (v[i]>0 && v[i]+v[i+1]>0 || v[i]+v[i+1]==0) ){
if( v[i]>0 && v[i]+v[i+1]>0){
ct+=v[i]+v[i+1]+1;
}
else if(v[i]<0 && v[i]+v[i+1]<0 ){
ct+=llabs(v[i]+v[i+1])+1;
}
else{
ct+=1;
}
v[i+1]= v[i]>0?-1:1;
}
else{
v[i+1]+=v[i];
}
// debug(ct);
}
cout<<ct;
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 <iostream>
#include <algorithm>
using namespace std;
int main(void){
int n;
cin>>n;
vector<int> a(n);
cin>>a[0];
for(int i=1;i<n;i++){
cin>>a[i];
a[i]+=a[i-1];
}
if(a[0]<0){
for(int i=0;i<n;i++){
a[i]*=-1;
}
}
int ans=0,def=0;
if(a[0]==0){
ans++;
def++;
}
for(int i=1;i<n;i++){
if(i%2==0&&a[i]+def<=0){
ans+=1-(a[i]+def);
def+=1-(a[i]+def);
}
else if(i%2==1&&a[i]+def>=0){
ans+=a[i]+def+1;
def-=a[i]+def+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;
const long long MAXN = 100 * 1000 + 10;
int main() {
long long n, f = 0, z = 0, s = 0, sum = 0;
cin >> n;
long long b[n];
for (long long i = 0; i < n; i++) {
cin >> b[i];
if (i % 2 == 0) {
f += b[i];
} else {
z += b[i];
}
}
if (f > z) {
if (b[0] <= 0) {
s += -1 * b[0] + 1;
b[0] = 1;
}
} else {
if (b[0] >= 0) {
s += b[0] + 1;
b[0] = -1;
}
}
for (long long i = 0; i < n - 1; i++) {
sum += b[i];
if (sum < 0 && sum + b[i + 1] < 0) {
s += -1 * (sum + b[i + 1]);
b[i + 1] += -1 * (sum + b[i + 1]);
} else if (sum > 0 && sum + b[i + 1] >= 0) {
s += sum + b[i + 1];
b[i + 1] -= sum + b[i + 1];
}
if (sum + b[i + 1] == 0) {
if (sum < 0) {
b[i + 1] += 1;
} else {
b[i + 1] -= 1;
}
s++;
}
}
cout << s;
}
|
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>
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1e9;
int guki(int a) {
if (a % 2 == 0)
return 0;
else
return 1;
}
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0, ans = 0, a;
cin >> a;
sum += a;
if (a < 0) {
for (int i = 1; i < N; i++) {
cin >> a;
sum += a;
if ((i % 2 == 0) && (0 <= sum)) {
int x = abs(sum + 1);
sum -= x;
ans += abs(x);
} else if ((i % 2 == 1) && (sum <= 0)) {
int x = abs(1 - sum);
sum += x;
ans += abs(x);
}
}
} else {
for (int i = 1; i < N; i++) {
cin >> a;
sum += a;
if ((i % 2 == 0) && (sum <= 0)) {
int x = abs(1 - sum);
sum += x;
ans += abs(x);
} else if ((i % 2 == 1) && (0 <= sum)) {
int x = abs(sum + 1);
sum -= x;
ans += abs(x);
}
}
}
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() {
long long int n, s;
long long int count = 0;
vector<long long int> a;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> s;
a.emplace_back(s);
}
int sum = a[0];
for (int i = 0; i < n - 1; ++i) {
if (i > 0) {
sum = sum + a[i];
}
if (sum * (sum + a[i + 1]) >= 0 && abs(sum) >= abs(sum + a[i + 1])) {
count = count + abs(sum + a[i + 1]) + 1;
if (sum + a[i + 1] < 0) {
sum = sum + abs(sum + a[i + 1]) + 1;
} else {
if (sum > 0 && sum + a[i + 1] == 0) {
sum = sum - 1;
}
if (sum < 0 && sum + a[i + 1] == 0) {
sum = sum + 1;
} else {
sum = sum - abs(sum + a[i + 1]) - 1;
}
}
}
if (sum * (sum + a[i + 1]) >= 0 && abs(sum) < abs(sum + a[i + 1])) {
count = count + abs(sum) + 1;
if (sum < 0) {
sum = sum + abs(sum) + 1;
} else {
sum = sum - abs(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>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
bool flag = true;
for (int i = 0; i < n; i++) cin >> a.at(i);
int cnt = 0, cnt1 = 0, sum = 0;
for (int i = 0; i < n; i++) {
sum += a.at(i);
if (i % 2 == 0) {
if (sum < 0)
continue;
else {
cnt += abs(sum + 1);
sum = -1;
}
} else {
if (sum > 0)
continue;
else {
cnt += abs(sum - 1);
sum = 1;
}
}
}
sum = 0;
for (int i = 0; i < n; i++) {
sum += a.at(i);
if (i % 2 != 0) {
if (sum < 0)
continue;
else {
cnt1 += abs(sum + 1);
sum = -1;
}
} else {
if (sum > 0)
continue;
else {
cnt1 += abs(sum - 1);
sum = 1;
}
}
}
cout << min(cnt1, cnt) << 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;
vector<int64_t> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int64_t ans = 10000000000;
int64_t sum = 0;
int64_t cnt = 0;
for (int i = 0; i < N; i++) {
sum += vec.at(i);
if (i % 2 == 0) {
if (sum > 0) {
continue;
} else {
cnt += abs(sum) + 1;
sum = 1;
}
} else {
if (sum < 0) {
continue;
} else {
cnt += sum + 1;
sum = -1;
}
}
}
ans = min(ans, cnt);
cnt = 0;
sum = 0;
for (int i = 0; i < N; i++) {
sum += vec.at(i);
if (i % 2 != 0) {
if (sum > 0) {
continue;
} else {
cnt += abs(sum) + 1;
sum = 1;
}
} else {
if (sum < 0) {
continue;
} else {
cnt += sum + 1;
sum = -1;
}
}
}
ans = min(ans, cnt);
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 | import sys
input = sys.stdin.readline
def main():
n = int(input())
a_list = list(map(int, input().split()))
a_sum = a_list[0]
if a_list[0] > 0:
sign = "plus"
else:
sign = "minus"
ans1 = 0
for i in range(1, n):
if sign == "plus":
sign = "minus"
if a_sum + a_list[i] == 0:
ans1 += 1
a_sum = -1
elif a_sum + a_list[i] > 0:
ans1 += a_sum + 1 + a_list[i]
a_sum = -1
else:
a_sum += a_list[i]
elif sign == "minus":
sign = "plus"
if a_sum + a_list[i] == 0:
ans1 += 1
a_sum = 1
elif a_sum + a_list[i] < 0:
ans1 += -1 * a_sum + 1 + -1 * a_list[i]
a_sum = 1
else:
a_sum += a_list[i]
a_sum = a_list[0]
if a_list[0] > 0:
sign = "plus"
else:
sign = "minus"
ans2 = 0
for i in range(0, n):
if sign == "plus":
sign = "minus"
if a_sum + a_list[i] == 0:
ans2 += 1
a_sum = -1
elif a_sum + a_list[i] > 0:
ans2 += a_sum + 1 + a_list[i]
a_sum = -1
else:
a_sum += a_list[i]
elif sign == "minus":
sign = "plus"
if a_sum + a_list[i] == 0:
ans2 += 1
a_sum = 1
elif a_sum + a_list[i] < 0:
ans2 += -1 * a_sum + 1 + -1 * a_list[i]
a_sum = 1
else:
a_sum += a_list[i]
print(min(ans1, ans2))
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;
const long long INF = (1ll << 60);
const long long MOD = (long long)1e9 + 7;
signed main() {
long long n;
long long aa[100001];
long long a[100001];
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> aa[i];
a[i] = aa[i];
}
long long mn = INF;
{
long long cnt;
long long sum;
if (a[0] > 0) {
cnt = 0;
} else {
cnt = 1 - a[0];
a[0] = 1;
}
sum = 0;
for (long long i = 1; i < n; i++) {
if (i % 2 == 0) {
if (sum + a[i - 1] + a[i] <= 0) {
while (sum + a[i - 1] + a[i] <= 0) {
a[i - 1]++;
cnt++;
}
}
} else {
if (sum + a[i - 1] + a[i] >= 0) {
while (sum + a[i - 1] + a[i] >= 0) {
a[i - 1]--;
cnt++;
}
}
}
sum += a[i - 1];
}
mn = min(mn, cnt);
}
for (long long i = 0; i < n; i++) a[i] = aa[i];
{
long long cnt;
long long sum;
if (a[0] < 0) {
cnt = 0;
} else {
cnt = a[0] + 1;
a[0] = -1;
}
sum = 0;
for (long long i = 1; i < n; i++) {
if (i % 2 == 0) {
if (sum + a[i - 1] + a[i] >= 0) {
while (sum + a[i - 1] + a[i] >= 0) {
a[i - 1]--;
cnt++;
}
}
} else {
if (sum + a[i - 1] + a[i] <= 0) {
while (sum + a[i - 1] + a[i] <= 0) {
a[i - 1]++;
cnt++;
}
}
}
sum += a[i - 1];
}
mn = min(mn, cnt);
}
cout << mn << 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;
vector<int> T;
cin >> N;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
T.push_back(tmp);
}
int ans = 0;
int sum = 0;
bool pre_pm;
sum = T.at(0);
if (sum > 0) {
pre_pm = true;
} else if (sum < 0) {
pre_pm = false;
} else {
ans++;
sum++;
pre_pm = true;
}
for (int i = 1; i < N; i++) {
if (pre_pm) {
sum += T.at(i);
while (0 <= sum) {
sum--;
ans++;
}
pre_pm = false;
} else {
sum += T.at(i);
while (sum <= 0) {
sum++;
ans++;
}
pre_pm = true;
}
}
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 n;
long long a[100010], sum[100010], ans;
long long delta;
int main() {
scanf("%d", &n);
sum[0] = 0LL;
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
sum[i] = sum[i - 1] + a[i];
}
ans = 0LL;
delta = 0LL;
for (int i = 2; i <= n; i++) {
sum[i] += delta;
if (sum[i - 1] < 0) {
if (sum[i] <= 0) {
ans += 1 - sum[i];
delta += 1 - sum[i];
sum[i] = 1;
}
} else if (sum[i] >= 0) {
ans += sum[i] + 1;
delta -= sum[i] + 1;
sum[i] = -1;
}
}
printf("%lld\n", 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 | java | import java.io.IOException;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException{
Sequence solver = new Sequence();
solver.readInput();
solver.solve();
solver.writeOutput();
}
static class Sequence {
private int n;
private int a[];
private int output;
private Scanner scanner;
public Sequence() {
this.scanner = new Scanner(System.in);
}
public void readInput() {
n = Integer.parseInt(scanner.next());
a = new int[n];
for(int i=0; i<n; i++) {
a[i] = Integer.parseInt(scanner.next());
}
}
private int count(boolean sign) {
long count=0;
int sum=0;
for(int i=0; i<n; i++) {
sum += a[i];
if((i%2==0) == sign) {
// a[i]までの合計を正にするとき
if(sum<=0) {
count += Math.abs(sum)+1;
sum = 1;
}
} else {
// a[i]までの合計を負にするとき
if(0<=sum) {
count += Math.abs(sum)+1;
sum = -1;
}
}
}
return count;
}
public void solve() {
output = Math.min(this.count(true), this.count(false));
}
public void writeOutput() {
System.out.println(output);
}
}
} |
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 argc, const char* argv[]) {
int n;
cin >> n;
int a[10010];
for (int i = 0; i < n; ++i) cin >> a[i];
long long int res = 0;
bool plus = false;
long long int sum = a[0];
if (a[0] > 0)
plus = true;
else if (a[0] < 0)
plus = false;
int j = 1;
while (sum == 0) {
if (a[j] > 0) {
++res;
sum = (j % 2 == 0) ? 1 : -1;
plus = (j % 2 == 0) ? true : false;
} else if (a[j] < 0) {
++res;
sum = (j % 2 == 0) ? -1 : 1;
plus = (j % 2 == 0) ? false : true;
}
++j;
if (j == n) {
cout << 1 + 2 * (n - 1) << endl;
}
}
for (int i = 0; i < n - 1; ++i) {
if (sum + a[i + 1] > 0) {
if (plus == true) {
res += sum + a[i + 1] + 1;
sum = -1;
plus = false;
} else {
sum += a[i + 1];
plus = true;
}
} else if (sum + a[i + 1] < 0) {
if (plus == false) {
res += -(sum + a[i + 1] - 1);
sum = 1;
plus = true;
} else {
sum += a[i + 1];
plus = false;
}
} else if (sum + a[i + 1] == 0) {
if (plus == true) {
++res;
sum = -1;
} else {
++res;
sum = 1;
}
}
}
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 | python3 | n = int(input())
a = list(map(int, input().split()))
a1 = [a[0]] * n
a2 = [-a[0]] * n
b = a[0]
b1 = a2[0]
ans = 0
ans1 = abs(a[0] * 2)
def f(x):
if x == 0:
return 0
else:
return x // abs(x)
for i in range(1, n):
if a1[i - 1] * a[i] >= 0:
a1[i] = -a[i]
else:
a1[i] = a[i]
if b * (b + a[i]) >= 0:
a1[i] = -f(a1[i - 1]) - b
if b + a1[i] == 0:
a1[i] += f(a1[i])
ans += abs(a1[i] - a[i])
b += a1[i]
for i in range(1, n):
if a2[i - 1] * a[i] >= 0:
a2[i] = -a[i]
else:
a2[i] = a[i]
if b * (b + a[i]) >= 0:
a2[i] = -f(a2[i - 1]) - b1
if b1 + a2[i] == 0:
a2[i] += f(a2[i])
ans1 += abs(a2[i] - a[i])
b1 += a2[i]
print(min(ans1, 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 | python3 | # coding: utf-8
n=int(input())
A=list(map(int,input().split()))
S1=0
cost1=0
for i in range(n):
if i%2==0:
if S1+A[i]>0:
S1+=A[i]
else:
cost1+=abs(S1+A[i])+1
S1=1
else:
if S1+A[i]<0:
S1+=A[i]
else:
cost1+=abs(S1+A[i])+1
S1=-1
S2=0
cost2=0
for i in range(n):
if i%2==0:
if S2+A[i]<0:
S2+=A[i]
else:
cost2+=abs(S2+A[i])+1
S2=-1
else:
if S2+A[i]>0:
S2+=A[i]
else:
cost2+=abs(S2+A[i])+1
S=1
print(min(cost1,cost2)) |
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], 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;
long long int sum = arr[0], f = 0;
if (arr[0] < 0)
f = 1;
else
f = 0;
for (int i = 1; i < n; i++) {
f ^= 1;
int add = arr[i];
if (status(arr[i]) != f) add = 0, cnt += abs(arr[i]);
sum += add;
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 | main :: IO ()
main = do
_ <- readLn :: IO Int
as <- (map read . words) <$> getLine
print $ solve as
-- |
--
-- >>> solve [1, -3, 1, 0]
-- 4
--
-- >>> solve [3, -6, 4, -5, 7]
-- 0
--
-- >>> solve [-1, 4, 3, 2, -5, 4]
-- 8
solve :: [Int] -> Int
solve [] = 0
solve (a0:as) = min x y
where
x = solve' (0, 1, a0, as)
y = solve' (0, -1, a0, as)
solve' :: (Int, Int, Int, [Int]) -> Int
solve' (x, _, _, []) = x
solve' (x, u, s, a0:as) = solve' (x + abs k, -u, s' + k, as)
where
s' = s + a0
k = if u * s' <= 0 then u - s' else 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, x, a[100001], ans = 0;
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; a[i] == 0; ++i) {
ans++;
x = i + 1;
}
int sum1 = a[x], sum2 = a[x];
for (int i = x + 1; i < n; i++) {
sum2 += a[i];
if (sum2 >= 0 && sum1 > 0) {
ans += abs(sum2) + 1;
a[i] = a[i] - abs(sum2) - 1;
sum2 = sum2 - abs(sum2) - 1;
}
if (sum2 <= 0 && sum1 < 0) {
ans += abs(sum2) + 1;
a[i] = a[i] + abs(sum2) + 1;
sum2 = sum2 + abs(sum2) + 1;
}
sum1 = sum2;
}
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 | UNKNOWN | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace AtCoder
{
class Program
{
static void Main(string[] args)
{
int n = int.Parse(Console.ReadLine());
long[] a = new long[n];
long[] sum = new long[n];
string[] lines = Console.ReadLine().Split(' ');
for (int i = 0; i < n; i++)
{
a[i] = long.Parse(lines[i]);
}
long ans1 = 0;
long ans2 = 0;
int sign = 1;
sum[0] = a[0];
for (int i = 1; i < n; i++)
{
sum[i] = sum[i - 1] + a[i];
if (sign > 0)
{
if (sum[i] >= 0)
{
ans1 += 1 + Math.Abs(sum[i]);
sum[i] = -1;
}
}
else
{
if (sum[i] <= 0)
{
ans1 += 1 + Math.Abs(sum[i]);
sum[i] = 1;
}
}
sign = -sign;
}
sign = -1;
sum[0] = a[0];
for (int i = 1; i < n; i++)
{
sum[i] = sum[i - 1] + a[i];
if (sign > 0)
{
if (sum[i] >= 0)
{
ans2 += 1 + Math.Abs(sum[i]);
sum[i] = -1;
}
}
else
{
if (sum[i] <= 0)
{
ans2 += 1 + Math.Abs(sum[i]);
sum[i] = 1;
}
}
sign = -sign;
}
Console.WriteLine(Math.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>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < (int)(n); i++) cin >> a[i];
vector<long long> cusum(n);
cusum[0] = a[0];
for (int i = 1; i < n; i++) {
cusum[i] = cusum[i - 1] + a[i];
}
int tc = 2;
long long ans = 1e18;
while (tc--) {
long long sum = 0;
long long tmp = 0;
for (int i = 0; i < n; i++) {
long long x = cusum[i] + sum;
if (x > 0) {
if ((tc && i % 2 == 0) || (tc == 0 && i % 2 == 1)) {
continue;
} else {
tmp += x + 1;
sum -= (x + 1);
}
} else {
if ((tc && i % 2 == 0) || (tc == 0 && i % 2 == 1)) {
tmp += ((-1) * x + 1);
sum += ((-1) * x + 1);
} else {
continue;
}
}
}
ans = min(ans, tmp);
}
cout << ans << '\n';
}
|
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) {
int n, i, check = 0;
long long int a, count = 0, sum = 0;
scanf("%d", &n);
scanf("%lld", &a);
for (i = 0; i < n; i++) {
scanf("%lld", &a);
if (i == 0 && a == 0) {
count = 1;
sum = 1;
check = 1;
continue;
}
sum += a;
if (check == 1 && sum >= 0) {
count += (1 + sum);
sum = -1;
} else if (check == -1 && sum <= 0) {
count += (1 - sum);
sum = 1;
}
if (sum >= 0) {
check = 1;
} else {
check = -1;
}
}
printf("%lld", 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 | UNKNOWN | n = gets.strip.to_i
a = gets.strip.split.map(&:to_i)
cum_a = [a.first]
(1..n-1).to_a.each do |index|
cum_a[index] = cum_a[index-1]+a[index]
end
# mins first
minus_first_result = 0
tmp = cum_a.dup
(0..n-1).to_a.each do |index|
current_count=0
if index.even? && tmp[index]>=0
current_count = (tmp[index]+1)
tmp = tmp.map {|x| x-current_count }
elsif index.odd? && tmp[index]<=0
current_count = (-1*tmp[index]+1)
tmp = tmp.map {|x| x+current_count }
end
minus_first_result += current_count
end
plus_first_result = 0
tmp = cum_a.dup
(0..n-1).to_a.each do |index|
current_count=0
if index.even? && tmp[index]<=0
current_count = (-1*tmp[index]+1)
tmp = tmp.map {|x| x+current_count }
elsif index.odd? && tmp[index]>=0
current_count = (tmp[index]+1)
tmp = tmp.map {|x| x-current_count }
end
plus_first_result += current_count
end
p [plus_first_result, minus_first_result].min
|
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 N = 123456;
long long a[N];
long long p[N];
signed main() {
long long n;
scanf("%lld", &n);
for (long long i = 0; i < n; i++) {
scanf("%lld", &a[i]);
p[i] = a[i];
}
if (a[0] == 0) {
long long mins = 123456789;
a[0] = 1;
long long h = 1;
long long s = a[0];
long long q = 0;
if (s > 0)
q = 1;
else
q = 0;
for (long long i = 1; i < n; i++) {
s += a[i];
if (s == 0) {
if (q == 0) {
h++;
a[i]++;
s++;
q = 1;
} else {
h++;
a[i]--;
s--;
q = 0;
}
} else if (s < 0) {
long long foo = abs(s);
if (q == 0) {
h += (foo + 1);
a[i] += (foo + 1);
s += (foo + 1);
q = 1;
} else {
q = 0;
}
} else {
long long foo = (s);
if (q == 1) {
h += (foo + 1);
a[i] -= (foo + 1);
s -= (foo + 1);
q = 0;
} else {
q = 1;
}
}
}
mins = min(mins, h);
for (long long i = 0; i < n; i++) {
a[i] = p[i];
}
a[0] = -1;
h = 1;
s = a[0];
q = 0;
if (s > 0)
q = 1;
else
q = 0;
for (long long i = 1; i < n; i++) {
s += a[i];
if (s == 0) {
if (q == 0) {
h++;
a[i]++;
s++;
q = 1;
} else {
h++;
a[i]--;
s--;
q = 0;
}
} else if (s < 0) {
long long foo = abs(s);
if (q == 0) {
h += (foo + 1);
a[i] += (foo + 1);
s += (foo + 1);
q = 1;
} else {
q = 0;
}
} else {
long long foo = (s);
if (q == 1) {
h += (foo + 1);
a[i] -= (foo + 1);
s -= (foo + 1);
q = 0;
} else {
q = 1;
}
}
}
mins = min(mins, h);
printf("%lld\n", mins);
} else {
long long h = 0;
long long s = a[0];
long long q = 0;
if (s > 0)
q = 1;
else
q = 0;
for (long long i = 1; i < n; i++) {
s += a[i];
if (s == 0) {
if (q == 0) {
h++;
a[i]++;
s++;
q = 1;
} else {
h++;
a[i]--;
s--;
q = 0;
}
} else if (s < 0) {
long long foo = abs(s);
if (q == 0) {
h += (foo + 1);
a[i] += (foo + 1);
s += (foo + 1);
q = 1;
} else {
q = 0;
}
} else {
long long foo = (s);
if (q == 1) {
h += (foo + 1);
a[i] -= (foo + 1);
s -= (foo + 1);
q = 0;
} else {
q = 1;
}
}
}
printf("%lld\n", h);
}
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 = [int(i) for i in input().split()]
ans = 0
tmp = a[0]
for i in range(1,n):
#print(tmp,ans)
if tmp > 0:
if tmp + a[i] >= 0:
ans += tmp + a[i] + 1
tmp = -1
else:
tmp += a[i]
else:
if tmp + a[i] <= 0:
ans += abs(tmp + a[i]) + 1
tmp = 1
else:
tmp += a[i]
#print(ans)
ans2 = 0
tmp = -a[0]
ans2 += abs(a[0])*2
for i in range(1,n):
#print(tmp,ans)
if tmp > 0:
if tmp + a[i] >= 0:
ans2 += tmp + a[i] + 1
tmp = -1
else:
tmp += a[i]
else:
if tmp + a[i] <= 0:
ans2 += abs(tmp + a[i]) + 1
tmp = 1
else:
tmp += a[i]
print(min(ans,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()))
tmp_sum = a[0]
cnt = 0
if a[0] >= 0:
for i in range(1,n):
tmp_sum += a[i]
if i % 2 != 0:
if tmp_sum >= 0:
cnt += tmp_sum + 1
tmp_sum -= tmp_sum + 1
elif i % 2 == 0:
if tmp_sum <= 0:
cnt += abs(tmp_sum) + 1
tmp_sum += abs(tmp_sum) + 1
elif a[0] < 0:
for i in range(1,n):
tmp_sum += a[i]
if i % 2 != 0:
if tmp_sum <= 0:
cnt += abs(tmp_sum) + 1
tmp_sum += abs(tmp_sum) + 1
elif i % 2 == 0:
if tmp_sum >= 0:
cnt += tmp_sum + 1
tmp_sum -= tmp_sum + 1
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 | python3 | from itertools import accumulate
import copy
def sol(acmA, sign=1):
add = 0
ans = 0
for i in range(1,N):
acmA[i] += add
if sign == 1:
if (i%2==0 and acmA[i-1]<0 and 0<acmA[i]) or (i%2==1 and 0<acmA[i-1] and acmA[i]<0) :continue
else:
if (i%2==1 and acmA[i-1]<0 and 0<acmA[i]) or (i%2==0 and 0<acmA[i-1] and acmA[i]<0) :continue
tmp_add = -acmA[i]-1 if acmA[i] > 0 else -acmA[i]+1
#print(i, tmp_add, acmA[i])
acmA[i] += tmp_add
add += tmp_add
ans +=abs(tmp_add)
return ans
N = int(input())
A = list(map(int,input().split()))
acmA = list(accumulate(A))
acmA2 = copy.deepcopy(acmA)
print(min(sol(acmA, 1),sol(acmA2,-1)))
#print(acmA) |
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 int n, buf, max, ans;
int flg, flg1;
ans = 0;
max = 0;
buf = 0;
cin >> n;
vector<long long int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
if (i == 0 && a[i] == 0) {
if (a[1] < 0) {
a[i] = 1;
ans = 1;
} else if (a[1] > 0) {
a[i] = -1;
ans = 1;
}
}
buf += a[i];
if (i == 0) {
if (a[i] < 0) flg = -1;
if (a[i] > 0) flg = 1;
} else {
if (buf < 0) flg = -1;
if (buf > 0) flg = 1;
}
if (i != 0) {
if (flg == flg1) {
if (buf > 0) {
ans += ((buf) > 0 ? (buf) : (buf * -1)) + 1;
buf = -1;
flg = -1;
} else if (buf < 0) {
ans += ((buf) > 0 ? (buf) : (buf * -1)) + 1;
buf = 1;
flg = 1;
} else if (buf == 0) {
ans += 1;
if (flg1 == 1) flg = -1;
if (flg1 == -1) flg = 1;
}
}
}
flg1 = flg;
}
max = ans;
ans = 0;
for (int i = 0; i < n; i++) {
if (i == 0) {
if (a[0] > 0) {
ans += ((buf) > 0 ? (buf) : (buf * -1)) + 1;
buf = 1;
} else if (a[0] < 0) {
ans += ((buf) > 0 ? (buf) : (buf * -1)) + 1;
buf = -1;
}
} else {
buf += a[i];
}
if (i == 0) {
if (a[i] < 0) flg = -1;
if (a[i] > 0) flg = 1;
} else {
if (buf < 0) flg = -1;
if (buf > 0) flg = 1;
}
if (i != 0) {
if (flg == flg1) {
if (buf > 0) {
ans += ((buf) > 0 ? (buf) : (buf * -1)) + 1;
buf = -1;
flg = -1;
} else if (buf < 0) {
ans += ((buf) > 0 ? (buf) : (buf * -1)) + 1;
buf = 1;
flg = 1;
} else if (buf == 0) {
ans += 1;
if (flg1 == 1) flg = -1;
if (flg1 == -1) flg = 1;
}
}
}
flg1 = flg;
}
if (ans < max) max = ans;
cout << max << 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())
lst1 = list(map(int,input().split()))
odd = sum(lst1[::2])
even = sum(lst1[1::2])
if odd < even:
need = "-"
else:
need = "+"
ans = 0
now = 0#現在のi迄の和
for i in range(n):
if lst1[i] < 0:
if need == "-":
if abs(now) >= abs(lst1[i]):
ans += abs(now+lst1[i])+1
now = -1
else:
now += lst1[i]
need = "+"
else: #need == "+"
ans += abs(now)-lst1[i] + 1
now = 1
need = "-"
else:
if need == "+":
if abs(now) >= abs(lst1[i]):
ans += abs(now+lst1[i])+1
now = 1
else:
now += lst1[i]
need = "-"
else: #need == "-"
ans += abs(now)+lst1[i]+1
now = -1
need = "+"
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;
long long count = 0;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
long long su = A[0];
bool plus = A[0] > 0;
for (int i = 1; i < N; i++) {
plus = !plus;
su += A[i];
if (plus) {
if (su <= 0) {
count += -1 * su + 1;
su = 1;
}
} else {
if (su >= 0) {
count += su + 1;
su = -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>
auto calc(std::vector<int64_t>& vec, int64_t sum) -> uint64_t {
uint64_t result = 0;
bool is_sum_negative = sum < 0;
for (int i = 1; i < vec.size(); ++i) {
sum += vec[i];
auto tmp = std::abs(sum) + 1;
if (is_sum_negative) {
if (sum <= 0) {
sum += tmp;
result += tmp;
assert(sum == 1);
}
} else {
if (sum >= 0) {
sum -= tmp;
result += tmp;
assert(sum == -1);
}
}
is_sum_negative = !is_sum_negative;
}
return result;
}
int main(int argc, char const* argv[]) {
uint64_t n;
std::cin >> n;
auto vec = std::vector<int64_t>(n);
for (auto& v : vec) {
std::cin >> v;
}
int64_t sum = vec[0];
auto result_0 = std::numeric_limits<uint64_t>::max();
auto result_1 = result_0;
if (sum == 0) {
sum = -1;
result_0 = 1;
result_0 += calc(vec, sum);
sum = 1;
result_1 = 1;
result_1 += calc(vec, sum);
}
auto result = std::min(result_0, result_1);
result = std::min(result, calc(vec, sum));
std::cout << result << 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 mod = 1e9 + 7;
const int INF = 1 << 30;
const int MAX_N = 100003;
long long a[MAX_N];
int main() {
int N;
cin >> N;
long long S = 0, ans = 0;
int flag = 0;
for (int i = 0; i < N; i++) cin >> a[i];
for (int i = 0; i < N; i++) {
if (a[i] > 0) {
if (i % 2)
flag = -1;
else
flag = 1;
break;
} else if (a[i] < 0) {
if (i % 2)
flag = 1;
else
flag = -1;
break;
}
}
if (!flag) {
cout << N << endl;
return 0;
}
for (int i = 0; i < N; i++) {
S += a[i];
if (flag == 1) {
flag = -1;
if (S > 0)
continue;
else {
ans += 1 - S;
S = 1;
}
} else {
flag = 1;
if (S < 0)
continue;
else {
ans += S + 1;
S = -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 | UNKNOWN | // This code is generated by [cargo-atcoder](https://github.com/tanakh/cargo-atcoder)
// Original source code:
/*
use competitive::prelude::*;
fn main() {
input! {
n: usize,
a: [i64; n]
}
let mut ans = 0i64;
let mut sum = 0i64;
let first_sign = if a[0] >= 0 { 1 } else { 0 };
for i in 0..a.len() {
let sign = (i + first_sign) % 2;
sum += a[i];
if sign == 1 && sum <= 0{
ans -= sum - 1;
sum = 1;
} else if sign == 0 && sum >= 0{
ans += sum + 1;
sum = -1;
}
}
println!("{}", ans);
}
*/
fn main() {
let exe = "/tmp/binC9743EE5";
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 = "
f0VMRgIBAQAAAAAAAAAAAAIAPgABAAAAYLBBAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAEAAOAADAEAA
AAAAAAEAAAAFAAAAAAAAAAAAAAAAAEAAAAAAAAAAQAAAAAAAp7kBAAAAAACnuQEAAAAAAAAAIAAAAAAA
AQAAAAYAAAAAAAAAAAAAAADAQQAAAAAAAMBBAAAAAAAAAAAAAAAAACjtIQAAAAAAABAAAAAAAABR5XRk
BgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAANw7hWlVUFgh
VAkNFgAAAAAglgMAIJYDAJABAACWAAAAAgAAAPv7If9/RUxGAgEBAAIAPgANEANADxvybRYFAGCSAwAT
gR27ezgABgUPAA4rBQAALSFP2EAHUGoDANvs+84gADcGDXYXB2PCPjshuBstCDcAN8EGsm4HAwQ3MC3k
d5ewyDV/5XRkNywhhDwh2wdDFAoACmwz2AQ3UQYAAAgLdvIQAFJvp2AICfvgGQAHgQAAAAAAAJAA/8Bo
AwDOpwEAAkkNAP//B/JQWMMAQVdBVjHAQVVBVEmDzP9VU0m3t///if5Mic9OjSwCSIPsSEiJNCQDTCQI
E+FMm/tvdwco8q4OVCQYSIuUJIA9E/f+j7xtD8gNjCSIRCQgSPfQSo0cIP/b299BHCtNjXsBE1wkEAT+
6A0BnkxIhcBa+zX3dH5Mi0AEKonHOmDvuXbXC1hJAcUHKllL2rZ9axsPidHzpATBEnSAtrVt+wnOAu8X
2QoRtH62+247SI05PEVCxgQYAGFtjENuG+zZhD6LjKD6H+6mb/+370GJxIKM1cRIRIngW11BXEEDXkFf
zcd2/8NVTI0NlvcCTA1fBhWAEgM1W8Pv2+L2DUG4cAGM5VMOCBQFvW2F7mR0I1wYMhPfUAJ44Xbf7Z4H
d6wEXM4kGIl8JAwMXZX92V37BJYoBr24ixSwFUgx7fZ2e7cx513j/L//LuTwFQABklz27u12VwOLN40F
jryGiw3Zi2q//f32RTHJFz2nBgAAXyJmkBcHgH8IAO3b9tt0CQg4/yU2jCJkPDwlYP8A3G9m7AF1HAto
IN/GQAgBLfu/a8YnDrnIAGZID27BZGYPfwQyGTc3FhzxZxEfhA87wtsjDe+B7LBiBTk89t8bm7MECIsF
pgqD+AMPhbUm7LvtB0UQHBQ7/xXPi4YLyWGP3QuLBIbrFrh1wN8xe2ETZEiJIBEPlcCKS2GEbewIhMlT
ihicuIjHe3uEB4PDEGEALrwr0g+ECN3+jXYEcRATidaAOCt1Dh/G/wW38IMUg8EBMf+vCjU1t9/+sOTP
SDn+dDLEBDkPthhL0IPj/Y33+wkPhy4S4En34A+AC/PGvnF7xInYP8cBhMRzzulNx3e0fzefGAi6D+/A
87itTYXkb8O9Y2l4uRc/6eE/DBccywg+x4QG+IkdzZVt59AlCEUUxkQo+5satmQ7TP8oVPgx2+smZi6c
S2+vDQfgdolNAH3FxsLY3QhJgkw542WGQrzj7b+wbRQQ/ooIgPkrdBYELbaw4y11cR6D+nEVtE4LC7P3
QACxARAoU3Q8AeG70LbCEMAUL+tKH76P4XcJ2zVmH/IsA4wf4/+FdjwwaiD/CXdQSGvJCnBKiZ/tkv2t
xjkp+XHa6z0v1gHWtg+5rEA/xhCDwj769/YbWRELdonSLNFx278ZDhF+MSwPC0G+OQuhjEc4suCEgLzp
AHUyQvEZMAYSyRrrFNdweIS/FTF2r0hFd/0YhaUPB7JJiwaKSMHoj932tz+sMfYx0usbskSvKfEpb/wI
X9RIC0k513Q6IDwQSV648O0DNNYawgFA9oV0BW32ftNtWdv8CnXeeNnHN2xrruy6xnv/OXXGeBXKZDs8
aZAsbG8jDpiZ7Rn5+d8CoMcHqI3xTjLMLcDq9nT2u/QiMb/+uMhbgz/4zRRj12OxSPxdfUyL/RzmKHAj
U+0gAlII1wUbYSiGjYEeOBXahULkQAFqzInmB7VtdwZyTFZ88Fgv0me4x/7Ogg5LXOtdSccHy4t3COcX
aGwjOjkMRzcNuW8McoF8bkyMTLa3v5Rr/1A4aAcBihhQ9l33BtxRiQwkBlQsAzwEdXLWDZD9XUQvBVBv
13Cx2JG9BHQkUNkzg9tdgaa7gCMDdC0ZB/J+WLqtFbaIPXBliTEDTXEjxL4Ox3S/eCiGxA0HBUzjWS1U
yeCB3TSHk4HEAlsqsG33DCyUUgWpOuC/eAvEXgS9qIY14Y59N0CHegZ0mVy8Lt3vtytMCVvM84XAagWj
FQaDXde2gDdcJJcgO9rAg5vc7h0LbjvVvhhqOVG86R6uKx4TF8cRMgjGY7cPEM0PKRddN9jZQUy78AtY
oGATIGE3cqchAWgLU4NsIDYhWMppG7U7w9uoQjBVzADj7Hlfa1LZBgwsyyMOHBqDhMEPCz89+O5I308B
q/n//1Mwbb8NBI8UgwtdJoVHqgtzD3QHtoVXExHFwBEHsDLIIIOgkIDs83Qv9gRgUEDHOunsE+0EAqCb
Xus4SRe2Vns1kW3DaX6NZTi/wH5hhAsk3kFB/9a/BwyTImxffikwEBCDrWNrC7oQNtz2B4Sp3a/7hvYt
AnRVvgAdvyC6AwS52UycviLuuD2lKRrwwTeZ0/aCEEQAunZ4g2EgPUdZVt3thg4YVAgaPUmIC38yOMK/
BBe2g0ELjccAbWFfrPzYaW7LDygFk7TuQzjYGo4NddocTgb86OsOa3sXKQfQVyiSA0MI3JL1CvtXNYAg
MNYtMNYIxoXAjmOeDMbg+/F4CAKQC72kOJUoMFOLzUttn09VgcmAvAsLmAT7hA8X5JY4TYM7AFjdwmEZ
1wMkVWN7e1va3m5udBQvQyDwCyivCUG1w293eyDM3qxDIEk1f1trjdYEQX3bfBwmA9iFj2+ujR1khrbf
ImODCDMWijE6l0drnk928aYwYWmMicOl8IZ1YlOQJRPWw/jBzz5Iu2rYTIMJ++siD4nDBTnrYBIKUUYK
T4506Zd65tSZ+XsIvlNH7pJGxqvkdDM5ufQ2KHd4/iiAONs8dw8K6hw+2wLLvkdAmh2hPOGs+b4BEBpy
bHdJKijRcNh2yTP2wgqI2klJJjLJ2G4ZzrM4vxCWfGcTAoJgOCcfaLQskF87Z0xzZHdJz1A2WLzJaVMT
70kRONwiT1XqhRwdg+yJ820q/vYl/m8Oi25Qiek6xQR0HQeDyQiJS1Ds+MUmtn7KmHQKyuixSTTM9gMa
BBYs3KjQo+nX38HpUnv7L/cPjVAwjXBXPCy2wkADoZ5wTfxC0EGIUBTAA4TIagMXO8B11AZYv9vtbkfm
Kc+G/4EJcy2p1c5gbYcwdrkClN9aNOgofzbazVl2iWvTFJhdw76Av1ewZx05LM+/0gAB6zhIfz37iwaO
DjRRAQnwJF4aTrh2GE0sDkFrDAxjLe5R0Oc0r5t2mwXCUV9MNCQBuCpom4jVdFHDYHRHCWvbkViXEH8A
yCKLwCH5tMEWK/mrKwM4SDUT7alwRwgEfAS0la20LyhRBGAOUGDbDvBbQHMMcAeM7FswTS0xJygeKCgm
J09glDwpjCkI/GbamzNRholDEA8oT7eDDTYoIigyEUNxEUsdE9hucBFTiIuLwA9W2nS6RfMQJA1N0UHk
gDDYBBlJDQ9WDBYBcuB/WjEaZh0pjNYd4BsMciVsD/AVwNDdCyCD4DYvSA2xPhxHJ1taByCphiEJIRka
b7sbEOBVUFgsRYnOAn58m2PEWsoCmjBoi2p7uvfeexBCKA9QCzgQG52zMRpCXyAXGEJNm462izlsQQgE
hBUMEIMtJLQK88INLtWGQYB4cHUMSjuwu9RDPDHAjxQRfR7E7fahCKoQ2gh5IANxKNjBBNgzB2bhAggB
i8lgMLAQuQgkI3DDCYnirEkchDAUr/Lrtg9CA2kBDBHdfkXugtQ46KgLhHUjuyi4XXFsyKuVkBX2spG7
szwhwgtquALKIWCX7kLJi3iacIkMk4BIuC2njypYe/Bidp4U4Xnhh8VWoRFWIQj0UoC8LMgiAOgub22N
5NkCVKK3kmwgY1ujQRMEIPUB+NgJE4x8ieANjbcCJqHBSQLZ+vwC80t2tvvgaBXzOy147N/ZSq6sZJ6b
mR6PADICw1Nqxhg9JxeLO+hmbMOjhG9ACIyEiHXMbeUQMdTQDm5CgwVH524L/LhT/QQxEt2JSHeFyVAX
M/0MEyyj/hYoznWPgquNmxBZOk/wnnMFRlxUQxismppi/UZU2ItC7uB9uEhBieEKbw1YA+scEM4WWBo8
c5CDdQ0wSLgHAQvAl70dswAAAhPESjZdhF+CjGPZ4e7pTkpOBDbcewKRtxDyX3Ia3LUCIpVkkMDIq9gk
34SpGNiURw7hcLDKdSHCE0BQ+9vubTUzylK6Kv9QGCBgFem6jbABx1joxitGiRclVQa4xBE+UEGD/OwP
7H//AhdrhBHq7AhQfm91koLxRIm0bxkVAQfIS54PKOR0ceY5BfKSOFK0f7SEFNIKIA+irCMMfUlh/Qda
bl1JEANIGDAuMEZozY1UfARDsB7A+pD9EP9RGIKNjCSgM6wDdnZxOgtom71gEePCko2b6QHAETEKKaHA
xMLggG1EAI9FCQ41d0m37+JXgrbdAj9ROha318R2kOQW0RxfqtsWsgbY4Cw1dC8cIFQkts3E8ALuOdrk
pfaEFvf7LBk4LTtTrRKJM5oFZCT/gnaAMTUVIzUVsgLYnzBCd6wTLDFFhP9jvf/dPwHlSDnrD4ILsEkB
7Ugp63Wa6Rh6A82wOndhPjFXOEmLDu24tRoDQyjD6zuaEGMTxxl1RhNHGLQBBZiNFzCj/w8jN8HRN6IU
hlxa2shBdK7BA4Rhu33H1yv/ajcVfxgDd4U00Om0Ryhk5PJEk5vjDxdvFTenogcdPz67g8wlR9FwTDsr
dWHpNiz28EtQMGGuimCfa9DmkrQ2EEaSvVDs+KYHN6YCAI/YEagDHWAVLDdc/iA0S6dyLHFJjUABQkP/
x5lPjRQ3TY1O/zHbdkFysGLhwgyiyXk9TW/Y7Fe8xv9zOd4+KMNX3D54JonPPCQfAgp9CULG7hjYwxkc
PxbXxO2t0DzZdBF3BB9vAkCh/f9/fB8Bg+c/icqD4h+A+d92Jkw50HQmFjp5+29FAoPlP8HnBgnvGPBy
IZj7/+UvAIPgP+spweIG6xIx7U8gwi97e3PfEwwJ14dyLOtud5X627ZWBxcSJNcJx+b0Mje7hBEAu88r
c0RSCw4NahBz2zL8/dGkEWiD/gEvF/xIh3f3IDNJQYCyvw+PFPAN4FjGSWbPHs8ow92ODSF0Ifl0HAlB
ugoBud9v3YYrvTw8H8B9FTe9kCDf6PaCG1gLgD+3idlNidYiW6H5gHf7FaQNm27AT8NL/9AAwuMpEYJw
iPihQb1037aFaAhFAmZPOel0OxgpOygCLSU4jq8si9pBpW+S6En34jRxLI3vDbpdtMWJQ4PFscVzzIm3
Icy2jcCAvwMJLCQW/jdi/yntD5TBTSnuSSnzlH5s4YUgyHUXh+7LSUuNDC970FvYzgsKjg2rM6RZLvso
hMAkzAQYdi9C3w0sY1feHLw7jAKnqKOdhRLHbGHjQetQ5AQfIVsqFHgUJITSJumoaBOgK9P7GzDpGFIJ
YHw0fNxT/QFPNA3GT0SrxvbS4NGD4dT6TwTtC+2WZCnvAkA533Q5H9vY4aA+mHHB4BL4IbZt20ZYNiHy
HuoC+iHtjcby2nQ3FjNhMcHhH8MiZ7vIcnQ9bv81aCcn23PKHwwd0nBisV3ZaeEgyAmrzJeMQxFTdVcM
CH+T3gi2i1ZogD5FO2phIfzpqtl599rD2DBtiQ6ExVhfX9jOwgHH0g9WSkgOSAHQ6R2bbbHYRSt4LtuL
9o0Nd41Hf//bOZ+4qf8AHnl7oW0acsMMv7jJGXa23R7DxrKQREZIdE2k7XS4RH4BRY/a4I9W3pptSSQs
1SDddFNhabYDKZZQHwzRFsbcUtZahR/hP1V7eFgQMEh3txnHmia8+zUiG4eEG6wx7VcOkO2QxbAmDMke
aaFFS2PgzccJz1L2ckv/XzXYohGyf3SxPNqz4hBNuqKpvghPnhwEU7yhpKGMofAOgyBnuDO35k7cugJ1
ZHM59h5YdAZ+uRFxtxThgfpfJMFYE+iJMYoQKU2y0ABzRGrrOen2agh3/4JQxAGUbpPpgvrvTx4ZdTa9
2/Tr7ipMkGkDchpvAsDDfYvPaodkIzEEMA38wFYFjAGTJInO/Yhg/LZuEx5cvy67HsKIvfQcyHx8/z8J
gDuF0/eCkw5MInhwLdb49wFAhPZHH7KJ8ThJGSFEHglBZ70kIJN1sWjTAmwC7mQNPAJ0CwMkbsf+6za2
ncEjCB/2JcCQDsqWwbOFLgKCg+YdBq7fJeA5wJ4gEOIhg2OjKcjmDf469++BGewgIyAjKVywO2wbL+Ih
1ggYHbmEwtueGR+ZzySwNhlgNXEIjXeTXOOG7SWLHw2JuPUYFg3CACTmSGt+sHIVzBT1II64CACMbTGD
A5fIEjm0VBttPvCtR+zC1BLcze82wf8A5O0Yu21ZCuT//ys2BwwC0MAFHCK2deaKBLC7VLqntuiJsAHN
5CDW3whJiCNBA0P9NZgTzko6EwJVA3jXMm2FAqP2MUCA/t9AOAgfqSKqOSRqWnYE10AD+SFbJH4heOIk
HJFbJJPTwOOJjkmCg2mgh9Z3TEDBJSVzrRe83d4REHJXgUfv9Md3Tt8p061a84oGPAFqq1aibarvs9TL
A8YD4d2Z4tvE9AhwwE4JHV2rCnQJyu7NO3by+4O3yAT3dg243zH/VnOpUQOR6gw8YjjSkdhFuwX6Mamv
OcK7H5SGjWlwAThAzIBtDW1rJr/J/znPFCwSncPU68WGbpv+TpB+WCJM2+lY6x9wsbSDNq9yAf1063y7
tUnWVzYUKw/VSf/F29/BD9QwdBP2cg5CigQTOkZMwwbbCIOuSfBa6EDky2jgF24rKxEiPLqxdbgHynR7
rw3QUcGzsXUtJxw+0cvZFMdfuFSkHz4EOcj4/3RGhLF8Gwo70X/rCra5T8D9MkiLvEXIqqx2aAiGIS6v
P5gatoVh1yoFw7+xLZ1vUUiPOc93Zk0Bwj/JEcIHnwQ6nsIwfMgyw9PPdsmjMOyxsXfmXOsZZnRCS8by
rfiZ36+qFyLQxd2wKBgD6THDRcCg7U/P+hahWxj8vyjtbb/t2aFbKNbg7cW68SM/pewB/ez10YP5Hnky
WYcDv7gBwLwhAAIrIZDx1LZArdxu/abNdINSoRNEKZXnEhRWso4ECcZnzawWpq/ILUtZxF1ySK9yOGRN
T4OxB2LAgSTM0x4W6YQUeXPIdSMpOcBG0mwLJ1ToTTnvQtNDaiwRlk1C0NA+CSPhgFOxUBN0sOWwwhZJ
5zZBBExwI8PG4wQcL8VJ4JZ7Fkwl1Al9c03qV3wshBdzihtUJjQrO3RJnsXWOt+EtytZgVof/OTTLlkD
tyaNQymLNizs0QnBHOTctoBbYuy3BcYGOcOP960DGa5N6q7CEj1TUH4UEeS5krOxK5yXQudKTg6GcmyV
nAzIUkZbSDkZkM9BTFQwHtZtnisWR3RxDQkn954defi1dF4j87VPp5CxXSHNDTi8I9Z3vPdkOiK8n8v2
JETrMMj2uiMTvCIprhBC+q67orABFqUPgPtDdT06k4PQQt7MMYqY8LTkyXKYWpgEjMDGxj+lMYTbeBbN
0wR1ij39TksZJvWjcw9UqSU6YREpgK/Q5GqjQ13vPS98tpUyY6dUiwfxg7aN1oAZmKY1DA97cmAKbb4U
yhg+Mt9SMjAYP3c5qNjDPkvyanRFZoBsD+se7y9z0CIM70YpyCKZRuYSJYdik7XyJ6uFps6uEAPpTIlU
RqmqZHHSjxTaD4IDOCqwHerqcv/pEOAowilH7zbWdSdkKB7B5eWVjknwhqQGcgwt17XQgsEoKqkhc0rs
Es3Q3hox5tGJ3yw0tb39c9Pr3SLBdBcaeqHCBg8LjN3xHxeqArvJmoFYZhCZTXQlUxG6aCo7wigu4SXf
Q88oIBgx6yoYG7I97MIfc+CfDJcWWmz3J0q1J1YkWx3lrDRkpHnv/CoeoYuu/z4RUUC3AeGGNgkzCxsr
dRIrUHhidsL+D28DGgO8iVYLUznOdFjmsm21cAiNahH9tzEHn3uhxO0ac1fCqVxfD3YfULb2zBYWv20L
GsmO2B5EaA261di7iPD34g+ArAcB6HOoMyVmrcQ9OhskVVZb8faB4QD4D4H5AO+5O4S3iD1EwT0HFUAI
z+u8QXziPY93MCbB6QahdtVWUsFwtjQAXKrEd/4Ceywh+pKWEjfYRGUM8fyjwdrtdok2c9uRdEEFexAG
fD79pDotSyiJxipRIF+VGCBPnkeVL5VN0AULRjc9EXPuA5HcDogRdRQLibA33uS6CBYcnDGAycCImiAk
zR2p7j8MgCchketn0zC1syzbcysiDA/gODxYs40xPw6AITEiugPJYdv2NRsSGPAnDOlBLmw2IiO6BAOd
ogMY36kgip6d/YLK2VWU6V0HJWWwJAJm4uGtlhWg+zIO79MmYMY5yB5UjVEIhge/VTl//3gYif4ZnWMI
8cQrQXNWb85sJ5auTSgCcVg20EsbmBp4BC//BUTjB+0TYUtEGrYBQe5L7q2H6hxECc4fDELEbkl8H0mB
Hes8d08ni7NDd7yw7nx1SetOL4vUXEVIQXO+LjdIjccdK+s++SHmMS0YcAmSgf6bzaa23bBmryp0FWfY
/nGQ2gR2idEkKlwGaiIS6GMoLrEdiRbjQN1ACcU6jNi1l8VkOd8+HAItK85kvRVBkfgCi8aJHCS4OnLY
C0XtdRBESX5/kw8RtkfctLKikgsY8MmqkrKSAl1XkCEisR2clK4DAt0uQ3BAA1BIRx4tYMgEn8cWMAZP
oAOmn3QERwYWvenrAuSBxIgAJVhBpIODEGwd6KneKBGBMGfAsQAHFNJtsO1Jll9DRVYrsgGIbQt4DLog
H1K8DZVVuTQVSx4gviv23nIWmwSlVw6GiGANGoEOyUrDlueuKLkyIszZ7T1FVFe6AlIyDIjByf+D7BAH
hm77UCCLPgJGw+YS1LfCozSnQPqDxBjDCwhJjW/Dfy/AttEWRFBP1wL2A4hRD9cHLNkFb65gxgBOPdZi
MxUNN9f/dR0CugEBt+6uYPYzvl8jdccCBbQxMgR/IYtzENfZrWAiWp+WViQPtzuaWYAKAHUjITwkvgju
QYNFj0xhtwPoDqc4xsWqUJAUryAWn5/xriFuOnRHOUKpKMZHGBK7DVcYOE/sfxANF4GaCB4ELrg7InzB
TPeJapvHQYTwsEW9MQYoAI1y3e5AAEjGAE5HS/arWMK7QAZAGP/gX4Ej28aaaCM5AkEfyW4fCU9Q/xdn
WcMfCwZxZA9VYFQTLkFHv0enR0DHcQI0ivk11TAA/Y4bkFdQ7DDRRIpXOd8uGLhSvaqpU36rBkm7AD6w
VIxUKkQUI7RLDAlPi7QpyvE2mYoShnA1MM4u1KwhQIVVKItvTaAWla+Jb9wojC2R7nGMqqSNdUtx4wa9
dygzTQDJFAoI8G0L9YMsD9k66d6x9nRUKAJVtuKW7yG+9YnLg+MdSiBKbsVmoOtJbyA2E1rshaW+itJb
Puj0xnhE7BadbCQgKVaih74GMXj1+EnbaqIfd7bB41/2A/Q93dpqD3PCE+7atOsoFfq2DSvjBw0SGtor
poSxuBKB+g9vD1cG29Y7AutMKfvu0whfXCcu8MLOaSB3CnWj8zVcvrfELxyLgCwLTD8wmniJ04d77gZC
dQZPbG1h/WVkNGrO//G2E38c6Tk/RYTSdVwBb4ftgH84eRV6bQjrGNEWs4E/FGDKvdVwoze4OQGcQTRA
tgGB2J4ADi8wl8jdljT9NZA9W1DpBjBYO+oS4dG+E088pP8TVu9IuGSXsHDZlBARL15B/tsPBMs20AWD
xmgfqkjhNj+xQv77dQxofxZ7mEWsDfkG2IfCFTqc5JxgbStlHZAvLVDQi2J0jh9BSge5YmeJeHEmv/3/
W9d1Adp0KmuucAgNe11FgqaldwjTwycQxwKyE0c5vghVhKRkP593pPusSDYPRcesDBUlBolGdqE60cOf
SDiLZkMxqLEZsGyaQEPCvw9oJ8VDEugrEO4j4eBABiY7zjnFDwYlDAkFLkUjAAUBWhhYsIouRvFCGLAS
YF1EEM6PHVPoNGV1C4Fsr3/4qROAXbJsgg1eTvHunXWCVB8oDoINa0QjniFbVq6CTEwO+0BCUonGfi54
33DAfyhJI4s3QbsnD//sGbclECf+NBUSSbhLWYY4EAzQ9dbFbTRxKlU/fakFPYnwdxvqC2nC/kIb/TiJ
8Sl9t6HoAmnAexS+3f7WDwgRa/hkKfkTyUEDBEFmQomIfBcaHP0KSQASdAF3w/x0QvUF1LDtJeJ3r1Vj
fi8fwkLQhm2ZyMoTyumpl1wx0t25twxKPUz+qTvc/d80Cn0YgMIwQogUHBP/6yD4SsmONbx/tevisHM1
BFBzX0OuxP5OBimFueNNUIMD3SnZW3xV9xmciFlTZCIBCfgILyiyOJzF5ARDI910q00GF+FOdmiPoSlk
AP9nEwdDkNWSw6+JEwvblsvOAsd/zGejjboBlXRSRGdF4Itf31EaAUWFybjCQb06AP2/0TRE6E0B8UH2
wAR0QNACDdHWd8D/8uVWYAew4wPdc3AaSEQntIE010gdNmxvAdixNldBAVVGLcrAzlTfP3XAW1qL+OUa
bjZqUkTQv9iKUeHBjEG1AahRNJ6zOHQSrNdAfWBJ4ExF8k+BLdbc6GNoWTnoRiN0Q23gDJwFJYmkDSTN
zLMtBxU1jY+mu10gQE8DIG7ZBwLXnXW34QNi4wsBEw8G6RJdCApB6yuQ2+hb93a3A3YPcN3UBHPzOFnj
A3LbNLvd5B8S5O0J4xjbYtwIW4LbruWK2+ID++OOBBBa0Vqx3E4gGQ61VtSC78z78Cps+No1rCF0IQRP
DRZadW8XSxHATsABm6OA5CbGiOGNFl6e1XXlbuHw8UyJLFSL0Tc4PbkE4Y2FDeNzCLn3Ns92O1O9sEW6
CHVzvA/OMVg8A6Bw6xDboMgxiQbe0NS2rGYOSGMEgduEI9wa6D/1RUI3Vny8iAsBbhQkT2V0aCWFta0h
bN23SMdDVDBnxnEBxRNyAkuOx4j9dLdrQFOOOASZSNHtCTAAvxXGAUnR7o602C8koAhvxf90GpWaWmhh
BVSiIFLoKGa353JCb2tUi54jkHEJVlLq78iWrCQZTFsof51ATQIfSRA4se+2FeH/Vf9Tbepq9qQZc7it
x+80JJ/CpVcyFOtOBGNUTRmOPVx0x/J9dTPN0MIog3nHrz7bCjdadA9M6tLmfO3rAxfC1gDZDuiOw0xt
LKlmP/nOPg07ApjTcnQTd4VihMCMm3VahXclbVcZY1tMlMHXjBqP829ICpoggZ+VAWAd0EDK7wgIQNcw
ghqS1mEwJIL0/+8wmAUd8dnvkEMhB3Y+ZT6tq2WF/2HWAkWPFpb3/X4HieEWDqhGqS51Dt+M4GC0Own8
PiwaDdNC/zr9T40MN3d1CCFIwtEB+f8C7xx4c/WNV+MR23gVCurY7Xg9XDrmUTxFv0zQjdgaeEwgR7LH
AhGmemvLfvqJ2sloxK27pEZNHEYlthoVDcDBJZ7jPwwigvw64kQJ2Ko9HkpBttwSzB2ewGcKylAdwcNF
d7oHFDvoZK6vFDxzwybQiRnUYr/DkXU0jSElwdY2gITQJRs9AhaFIJ88H0stajP/Loqv+b1jS21s/aL5
0wzpKTY4IHRKTSh0IxdOLB20Dhbw2xb5Go1wFj0o+oY7BwhQwEWsEgYPwOTJBwq3wGSDbIOBUnTudAc3
kN2v5wSa7t8HAuevegQg0HUTOgbvr7HtXcjC3+r6BLR+Au2jXEIi568cMoDjsy1YWP9UgIvHJ27KdAOw
8HXkPk5Ni0WGw1aU2ruDEYUo0SwNE1VW8VXiG3lpE/pMMe3JXj1Kbgl/Jz1Wgft9GZuCMdfaQ/FIBEgW
D9tb2KAPQowKOvh5GM+zEGtEOEXO7R5F5MmTgiaCLoK5ooSAP0/98CF8Dzys3yBPBDIk2yeD0E48Tf3x
debU9WjhoPBMAcVBTUB8kBs0tr226DmtgsDdChBH9usNBsKAgVaHAoCOhRZSBotfjALb7dJ0GLR9IANF
KE11kIb9rQ7nQfLrSkWLZVQbDTgDs/+RGZQuDozesU0XXShYr8U5LmQEj//28TAlgVlBj5iDsbvUNupF
8QP4Tf8JhS2BYW1xNpF6yOr/4G+B7NiEAs8xipSyiYxBxDawwKk13wGDckWwxYONRP+rLbgto9pMiI7A
j2qpbyz7BjsHv38aPVB6Fxq7bAF0QT1IPSnYNveNz3Xd6wYwTcJbvB+g7qE/TGuotg3rVqBugp/mFeCN
9+o7whvbTcjRh/ABQYsEgCiqSEXssJRimOEGOPuqQUC/CBcMMXLK0TGoOdZeq/T2dAh2CY0XwHwIndS3
XXcqbhw2PHQxVU4BdnstZP8WvzF9FBzemivdQr/6SFCvdePrig546kXQehqonWy3hHwRM0MSDAevEV81
tEAuEyEMyBBuG8+gvjtAeEf3EXEBtqtaFgDS+NsQRCwGFtjAUZzBAn/indYDcYPIJIPmNVCoqYa3tg75
/Ph0DgAIu2ADaMEomEEtEIVqcEFGNzEo113AIx10ByAJHFjQnUU+H/IiQRRqBWrudRB7HBbAuoV1hXcb
RJongMWaZ+8Gch6+Ag0ACBA+qUfHuB++BIfeACz6sqifOHRAhCTQt9ATJ/Gj8k1YIAzXBTlIxO0BcXAQ
kSzqZLwFePfV2S4GdxugAQ6ICNCEGaHriRU/pCqTsTcjAFSDxCQ4BZwwxCJxIAFArxtDkJNLnNA3IOPF
CpYA48ogSvILAgLD3/FL8iWhlMYGlnvsESWwxwWANpBPBpIDAwN/NhsQPiSNhCTAS1eHxSomLX5iST4s
m4CZT2wAnQxyCTCAiCgnA8mEnwQENxUwICQPaceH2HeLN9KJx1Y5rD9HExYL7/QSHtSGNip+8kYosHjI
+gQLEbABu4sruwj0t/55jUX3Lx53IUG9dENJW0DgPn1+FW5G7th/ixqD/Vx1CEGJ7QyJ76bg8bOKTohF
LoH9tA2xtP3FRAEi6Q3phvUuNABXkc0MPortknsAZTcGNFoBEVj6dqEURjgKEVICdTtL+khx4y4IRjpJ
+SUBCGrEA/tGRDH2/znz6Tr2HxiXN0A4LAh1hC53rvsmml7XhnWqD7fNb/xfg/Y+AL4tjG9o7LtvMpRI
Gdop+XkmNETK6v2fcEyARmKD53/B5wiPwbcFu1kJ3z+IIDQ3ZIvdmvJ1wCz+cuJYYcnJAtBF4siVHDkA
jPmLOEvgQR6mAFMx9r9Bngxl361CjGSfTMjRjQkf6yTc/1LPDngH2MeoAFbrXo2FEP7ydmsb8T0ESXJR
DOIF/dxctq3CCwxEHxQfDADVG+WyN14xIA5yLJVoX6iM7v49Hrgw1/hz+7kWKVkpchUKy0gKdgq7XGB3
EHJDByvIAWW9+KTdhQtg9xwq7wIHB7uJtyVKRWF8Bb0tUgJ8Bbd7SesrX9vLVOIh9EGB/RxGFz0fMUzN
CAQ5vWRCAzea6MG+XHLYm0SFFoHYxg5/R1Hc4FWLbUuyo8a6D3tjBBtbwA/Vvn0k9uuvb76cI2iqe/Kl
Aw1doYkN494E+B1H/gG3Zorf6mCo5wI23+DNL4350+oZD41KMMZX7Ui3BfUKHfFJe0VuPBPLBuMDvnUV
bqjs4EgiUiBv60yGR0MdHFO+39IMZNdAZTwOpgBayJEd3nyWVDy7L0WELVrzSYn+E0b8QSNAF7tG13MB
lkB38XsyI2mxVpBBBhgofqxnQQ9UJAjzdAoWjhIYaDgUBW/eYBsEm94R6Wk1FhQsn/Xy9xI9vFNQqBCN
R9cPqCAKHGSQ4kg81flIrAj06JVUhK8vbDwhxcjPzinG4cZSbENSz/4T9s9IMfJNBApxBs+SU8nI+dHZ
g4qusOQG4qy+u50pftNUHAfU9EjT20yNi6dqAspiyK/cFmohXRjhO1EwWao2WlYc+XHK7oAJGdHBZ9Lr
PkoObMhLkD83AENSlax3KyZVDS2TrEmxKlYER2ybIMOhw3YRqkejlxU7dtBH0iPVgp0GSg7IJQjelQSk
KlhV9hUJRhh/+RtMbS8Ni3ogA2Ju5eAEKL6lRopnviwgX3GpzjhY42AD4gD1A0gYrAmJTJwEMEieiUxI
irfIANsCahBIqLbbkfNMel5yGAMqwaUuVOmlOcZ+R/AluEEnwUznBCTBGbFUtwADVQiCsRYqEDTiTS2C
Q0sHRsSlb0K/pblbobowa1x6CTiInLfAffESNA1KCKwNzEd8AYl2FRQo8C9Ch4LooBPtaka6ECizFMpf
/+LPVI1UkTtend0XtIhca/c4KyO/uveBA/xICJ4Zi1NLzlR7ALeQSnSlUvLhA/igTXFNf0hL4Nhnd+YE
Ne0CTDA2S2wMYW4LVzA6jiRiVYyQv6h8Y3+J8kqDfKUAAUfsdQjDFoCE1Ex1ajcCwQQxzQiiTAzAHhay
z+J0RN7Yg3ryRAJ1LjyiibiQR4F1kHSrJQcWIl7GkgjeWiEWTKUYX5BXCF+5GC+9AcGAnhxMXAi4nUho
SAgJokqywGBadk1a05IC2GgABrU5XBEKQOzPWUz0TDnzd7C2Ac09wT9ipEuYATXg8iUQSyUYcno4RrAa
EPNJ3ET0scAuKT/4iBM1k/EO7OXE4JZBjBRGa+HbbgGBbniNdFImPC9kIO6K3v9UL7vl5cK+ljnjczCp
SS0QSW67Bpwt/6l0yFfrNV/D3yoSOdh2LOsJNiQKIbPZPGA4weMEHQAdCFPRKjyIqTdX1Q8sYMRo9D3/
KyMMTthlXtkNhI/3KqMWclw1P6MOYPBOVWnqfT8DJC8qaX0zR8kBkH08kFDaGg/Egf8sFVeXBsWOX20B
mypbBMFPT1UAtg6iQsYBHi7b1XXUbHHg2d+Id32DCeACrnEpBLQGYbN9iv+D/kl3e0iNt+tPLQwf63ZN
8AAcc3UYQy2EBhAFgWutMGJaUm92h12QCcYuJndhdIUCAIfdZwDUOXdjEGOH75Qe/9cE8BYPo/gPksBZ
Ipe/AbkBhuADCRJKAA7kcyAOAAETgudARgIYOhhIwDK8H5Z6UQQe700jWDTArqa6CyngnwN5LiwfDg7I
AYwZj45Q5Vw0kANbe9/I4oAwj3b/TybCOHqPd6N6wKoHIKyNz/ICiwZYDyHxjGhGHwWNNMVkgUWHUcU4
AIJnQN9IElDHfC4UDItGMih86e62gT8DSTPH/+F/eMmCwAGJVGqJNqHgU0OX8HNru7MbSOQFsf8VQAsl
LoYMdtkjAIMCn1jI2e+LyGgScAKfFEgKQjJIvzRHYMevzIYC+S0sBCBkEC/PK3BsDHnPfJmzAhe9KU2J
xNB9OYpwU9Z1QUGIabYnwEY/uY9UNhwXlwCa2iRX3n+LV8ABYKFuAxFH3Ueezu7ePlcwZgs4AQEqWxS9
P8Bg4YTJSLjZSp4J28L43jjmcjslU88aCFUFwgG6y0qUIaKcfTqJYF+I/jnlc182HX9pAdo1phw0OBwv
csx1a5CjBtTj+igNtgZwzUl3A0U0L/uIVgju6UByv5pi9sbrHD+NcAGOnsGdDXbAHaG7rbkH7Yt8XYu9
DnUorC6fiBw9qChymaagVFtrwA8A+JksWBMGXimfFDoXFbkUH3celMLiCaLpn9DAx+676ZK5jkCfG3UB
uXiJD9g2nu0cok056bQm2JZ4RvFNuOkK5ff9aguNW3glTEUtW5Z6Vd+7JzwkfRigi2X7qC1JPnTWAupp
6CD40/8VRjgZ2u8l0G2NauaSSfVQ9SJe/Lv5/AS2VoQx0kFoQ9g1WO1YgcAVu7cNQRSPBBFl4HIyH1Vy
0tBAuWavX8cP/WxdGd7NPVaa+ST1CgzWXngjMXP9hg3FJsr30Gsp1pvb7nAIKWQEFwHgQMgHdRBzKBQR
eTdjAH9hBAdCBDdymXUn5uqZqmlwLELA0C+MjaIVfnOKQi6WnbC00oPL3cEYwlTu2scx0pQp28DafMY7
VkJfzyl1RWwn+6bTLNGw9roHeUvzzyw6yYVMWM/u6Bm5wLYX0M93xWO3YK7dLM80ie/PxWVBaCCFg8Lb
QrvPVb7A0TFH0U3uMDQDDK0cbPAejix8uXQUzv5YtpD5gNZU7ONatZbhDlGB35HJWs8xg+D5o1ritI78
KmsC97kKGtTOnFQnw+9G7Vsjq+U+dhP8dBUvaHbbFRcHbx3/ZwMgIHxXyT+Nb9cRsA8BP+cKPA8JGzLm
qO8dGAMKruu6ZwL3GfRR6gPyUaiyUbf7A/P9CO1rutvvOvPl8g8Q5wdW4A/Dxhys6bqn9usM7hzo6VAC
nrFnBccKBM9gl405vw4HGQZ1na4b7NvKbfkl8FTJusG692HBiljHIP5gxNq57ukg5ssQzBxbVs2IDwuR
vjT+klbczgzRkw9YZ3Po0hece8YKAtpmA0LsZo79ZifUBxMluAtv7LoNb+dc1nDbaRXz82n1FxEZa85H
AXD3hG4EVOlR6zpv1CxZtzNV1XY58+M14rReBZvuVsEUyOvIAQOgBDuNdB5BdVjbhGInP04wnBGvX+IP
q645wXXwSdtVE6pIX0ssgIkvNQ0Ccp6Ys+EtzdJ0MVHX78f+ZONgC6MB+1s7LfeecZBv0uoB6WUt0WXY
zsBI789sF9pbML7d5QosFwntLxgDwHi2IQoC9S8z9mwpUAXFCgS7bAvGzS8OBxkGdc0FYAQvwsfUE6Ij
WQzXWpd4xs4c0+jWCgLey3jCwy+8ZESkZC/BCVfJiGR0VN4FyBjhhlTqL7yxFW9mznUE8hoz+TH241Gd
QA85JC8BXI1t+h3KL1TEF8vXhfo7BxB7GhB00UV7QmMVQ+W2i+3yC2vQQzAHczi2RQjcU0AXiidQAxoZ
weVzWEtgnDyraMxzLQVX3p9vGB+QZ10X9loOVHcXX86X9SIlI2niAHNkl7YpEDA0KpK5QxPPWjGBDL4z
r5aww4C59xYMg1U0WO//SfpB2FBHdgjFXexNiyABuFAhinRobgFv1H68HY99AtocBHZhhNt5vmqw4gvr
Iq/Cg/JEHdgHn134I+e2t9/f9kKKDBOA+QJUXLsIA3RNBAQjKLD96F4jHjTZgMAGJ3gp17mJAM5WCO7A
qj3LigmyMgWA3zbtCPQtXQuivb/Yuok1hD6QH10o6Q2xbWuRQx1eBO0/npFlkIV9oL19W8IFcWkavT8b
uBsE+oXtP7NNRX0P4gCA4ZWslGJvf8jnMPyAwXAUMHIzfvaW5Nsh4E+EDb8Phxlh2Gw7ww96Agu6F1qM
/5ZjOdZJjUwEArswbgvB3a0mhdtu24obVYCSQbqz+21CKQMDOmYiJr5Ul41r2Jd9I5/9C3cS6MByIpTY
yHZLCOP+OO59Jkj3AGyUdV9mA6AfBsVIsl61Scc0XrE99gZAqlYSdRVbBImGR2YwVCR7Rxgq1o2CW2h1
XoyGBa8ZbwslCnaJuQgCcAjrfktAsmAen/2rXwGxY2MTlRX3J1gIYO4rertHBk8QXNg4Ots2evdzB+tp
BnJkdmwFMAJ4UQxg5m8OD1R2XDkBu+8kRcFdwykqd/x3OhfYszhzciZvAxYFizrzx5SeEKghSnLW/4jB
gA5QcIvbFqDb/3EGEn4QAwlHseiFPT5cMABV0AEuLgEMQvHb6woMtHIPwE8Hk2CwbHjxSfebwEzIo9YF
HelhU6bBaoiAAEJvagqEBoAb63GQllk7bSjAOdCgLRon9W/0eFhEUCnB9sEHdBLL0ELQcu9y5ekfDesz
dv/thUCLTAauCwwGTIXZdOkgc7sg8tn/z4A8BgB4sTPCdfGF4BSwP++cHaenTeR0Me5W/HBhNmYotk/R
aNeGXyX6fl3TLl2zJ4DFX5xIarV60hm9ItFAisqOG7s2/XRCC3VR28Vw3z1ls0t4YulMKe10eXJ3GzPx
aycp5eAtoHRx5h6tKOvsCBO1SG3ykHIgChUJJN2xJaopeX9cAjbds7apDgd1fMEDc259DZLNvbuGNkiP
5Nv0cHO6aAIkST2NkvmW2ksfDaANLBueuye199PrE4YSmHUFGni+XnikCxXrF0iJVxDc6ztFmqL/7wQG
swLrArMDD7dMJApmWova4SrYAwa9n0SIbVsrXnCIXxGDDBIhRAcn0K0cIUcWwweIBKFoVAywHzEYBxIv
OERlE1/RVrnUbfmjI1DP4ihd4LBc+bgvRQZwB41uEIA4xD8E+gB1POtwn00B7k0p7CAnP1NpOe5cdqKD
zdx+B2A7dDbBk4CTtrraWHZngx0CalE8OQcVKzoCmaG8ZfqXYAh1k4hkJBAQ7wQUi1yfA8EqiAWfukEI
eBBsVKMHUsBjbGZ0TjeBFNCA6cRigBIEoz8Pz0sBX//+/3QmWw4BCup2HFgAYsg/Y7Wgb0DDLz6D/BBy
kDoCPg7wxm3PEfAQkC8+DrgNhc7Joed2sv1GUsFmNy9uc5ESFBgGv0kTAj4C2uLW3kATyHIw32WMCgFT
dQyC+GVOAXJChaIpD+EKEwU114wfch80ewgoKTr2StgWohR/Wd0S4rT9zgjVGBdkraTpg2hR+yNknByd
sKnZP0G5ZZFNOeIIlxgBL6EuhmUs2xAjGBtDz/u0MAJ2fiwZ3Fsj4En/jTzfD3QDI+CFZo49AQrfhk3o
CY74vpOyuz+8Oy9j4Om3D0GKFB6eOlS+L9jYJDSD6ai3ECWRdBQLoa+0/n0EFC7PZ0gf914NlwEbK8sP
8847C1MZAf7FztWFIBkB/lg4K+Dh93YVzgudoYYLyQjvbQHYxQLxDoABFSnCMcD/R8gRQs9jzMjTQSAO
zNBjzhW6qqfTGI5wxjTlYaSCkXFJtsCbfLv7bewFwwjDdQwJdldDVi6/flDwC2JDd4nqUXUrR74RaB5E
/CBID49dW8t+D+s7V6KplQIkoyABIecTzChIA2SsQ8yCQenkEbc6JTHZ4RLmMpBQ9Ff1a8EECYH+6xZA
iJ2bFLD5BJ0JMWGDE13irFnDD4H+x8S3C7h/6AYkHwzAiDZL5j8DzoAOKCR/MgW6Agu191a2ATA2xA8M
4DBFD2ys6j2/BT0Guhz2FpIDKBIM8DMMD+TAhkAGB7qAhhWSBC+321bBT6QGAk4QA1YghDNdFH8wCRnU
BQz9FbYZAugFnIgTkASqgINow/9U8S6Mjj/pYBWR0JJfEEIJN2jCQD/DiURCRISQQ3MYxqpYYb93+/FE
VIgtEx1U0dAvWWsIxkMJQNjQ0jKC4upZxqWIVnxu1NCAqlTj/4tQUIpLCfbCBHV191zI3UE3WZFxtjWG
cgZAcVtasPF2woDKAiLGgoI4+p2iCBSR8ErbQM46QOIXhUMxHkIU4XwCAI2uaNkdv1HRGmf/Qf9WGABq
c8C2oHrTJTEXcWvhG0kDpcYfDz2JFoZwEEApMw/xsG0X+otIVEhwWBkAAkgxKL7QVFBPEFhAiZGwcCgR
xDSXtIAivEOtOm4u4kC9PXsn+6SK888WIwBRXCRw1LglizDAhp1hexYEAHcaOUMdLPaqBoHYuMJfxLdf
i4A1QG8LhCW8X0GJxekg1M+dOwNCy0DSR2vtCLGgxfFaUwjvnOBCo1D/rUQxkhE6gApTkXCxQnjGyNRw
8v8pyrJwJ4RZSXxrw0G/kXBCfZ5vrzIDi6R5poRIfVRUUKSQkwmMlKyEl1EtURV9dkI4IUx1G0j3baSp
4lZYR1xrENwUCwbG7LvdjhJWfzWLRuh2SN0OgCiZEE+sV3/VGADfIJIQq+IBo0aa3nM47xUpIQUPPeLd
j0N5RYt6VkIoviKK+BCEmThx2BU9IeqsCGNxt5kKbtE6EJEUBpAAPcpAyLMaGQCS7zaUVAHaKsVtshZ8
qKFNXQxIbVyvdbBdatd0VRxFuMVGJsIRf3MsfaFGxOkZ7/3fdk/ggLpNunRPPU3pH1GbESIhR8jolDx3
IfByREnrOXjZU46IkNVOd7H2FdwigesV29VDdjwiXnO8KLzrIPaWEeEbJCAVAvgwoodxkpAZxQF6M70G
jZMBefItQb90U78ULSDAcAyPn6MYK3SaRRUZRJtsuwgPdBVIFW/kOnKK/SKGaQEAG6AFbh8jbqU66EGh
CLYv6q71FUBfVUH8QkXNXyjFDAdFOAJNOYziGzIS8XJFSYH5qI1jRRxyNn/odATbA1oRFYhCTy1o7DdE
OCwKdeZ6d0rABryOz7s4WVCk3RG/C8nNsChLYHgFfmHAAF08knruKhzuO4oXGPop6YxveTQBTDHwf9i+
4kd5Cccwcl6D5X/B5Qhjt4NEEwn9LHnXIUEP7GQUpG9/1Bxh5IFcIESmAEO2kB5PMe0P3xQkJyeQYf1g
mSITcuSRYSJjCexA5iiu0XgH+oziHcWuXetlQa84YBQHV0GwSUEZxQGjsTtBshQvozgvRLMiQbSM4mS0
FkG1Utu3i3rIcXUuyKW9c5FoJeDwHEkFgiFA7MEovWIlD68fwI05QEwJiVx7+IoKEQoX2rfGBkVLJtt6
vMN0ARu1GF4PXh5GTdVevAneFnMjyHb2xnQRGUIaNuAJvIxi80yJ3lVqYHwrHLMF6ybvtpKKLhn+IinJ
ppGKIug3uFAQK50qXjzGUnFJt2LDHKuzJknFBQgerLMkXQAMxKP4MvkBTYWhuBGA268nARqWNsUrBzlD
0MkCKtOlosUbWw+NSDAiInoAmIo8ITvWhlR8YpGzIguvLMhxqg+b740UZGS7/Yy7QmGLBe9rTAZqKQMR
KZ3T6ItbXYAei35JKYwPvwtAfjnq62yMZSfwoA8/InMGYX8aA6lC1AY/2gB/ErZnBzHbSAHePdgyFAHI
1YfIBKwgEhaqyMiFVNEiaDCKPgiRQMgLOoToMIE4uiqOQTAGXxyKw6BD8c+XzoMGdrAKpgAY6ATiF3CA
agBYEAO6fVOEX4M+AXQHBX4QYBg1WgxEGPvIQSahKQRzSBhGAzIvBIloCEYoKXogfhS8sGtUTuRJIDNY
/+GEUHAlPAQFEgqG0QXBPLmwCRkEBTYGDG4YBeutqGJHMwhp8WaQF83RrF/ykK/feNtiEHUlAAYgdXSt
0ID6ZH+JrU9UdFl+khDKweoMa8pHcAzqZCjIKQFYoW34uOFBZnctuST70AR0Yl27pKI/c5CP0sDkkE3F
6ARweVfXIBVdLDzVrMmEDWlxPzdgSCoSrHYOiagjjWdZ9yV3SiqsuSYFPg2UuPBzCAQwJAwISUkpBWOT
gld51yVtJKn4IgQMq8vJSCqS3VcyagJSqxh2BBiQP0b8z0rVBr2WMvITgguUni/3G8HwvwqOvbDKdaIR
SbkcVvDJyR2RVgK/4e1OPpHYZCnZQ8Y8BbCCjvMJS8fHvazgiRixTS69WKnJKRtWwTx3P7CCvIhUPAgT
/+sfX8EgEUy2vOaPapaEVUI0wkOahgu1mcZKPAkreAW7+WLnaMS/gwJCJzBb0K4GEQkaGH8cmDQ3Glym
ZA101OEoc+QI+wnBBngRYZ+rYr2qj47/VAu05/LYde8iBGVovIB8KYoydDy9objVOYZ1MmH2QFAE3Q0i
SWN+dQ5GMgTtRnpnuAwNGWUYqd5gitBwhF6hCwOBb9cPtjwgAkL120pJi0F3wtXkY0YFGRk8QJ4h3AwD
UmDfAdIItDMJGZERaR5fYQR/TFEKtpo3kg/xyII2f85EeCaCtlcSSw9UTZDIWPjIP88px+vHf0aSiO3f
E/8/gAAWNDZ5Cgc/JQeSiD+ZU5wFDcgHGTsIHT+DREDKtOvhg2K55JKIU0AHCQDG7g/31sHuH2FmZoAY
wqOMf0hidGd0P8B/SY1eCCQsg5CgM7qCCEXmgwvxIkaMhIbCkDNz9qsPJ8gkCUBegRGrhmEkglDybWLf
W+0VEPLfkTeAH9BWPD6QejO3YAG81rxLHl/UbW8YSO20CFEYGumGFNr3GSDEEKKBlQcXer84EqdqjNEQ
ijEUPHCrl12zrFFXwc19/y3bOXQmIqKXAb/SdRvknGHAYgcE93UeJR9RtV9yzmeJw4hcX4EU8DYVxCjl
VlKwYLcqWl6/Hw/LIr5YLXofg/D9BlIVCRMjABCA/1DMbN0I+R9SEByMCbO97efCg3sovwptELFttwUq
xfAUaAjbEIKfRbAKPvP/JZYTFkKUhAC/XgYUqquy5OCpTkUmkB3WEKJeoQFi32I9xK5wfqSj+B0wBt8g
Xim2cQeMRw/VQYDaox3yfr572bpC8ocDDY98sekSQbKPtd6/PBUDEiNPOkB8KEUdIA/V8nuDO2VD/EGU
vwAgKNoR9ojaXoJJHroQB0S5jqgOTkSNHaF6hse/KFqoqBbVgDGTpKJu26cnQBADAMdAIIazYBCqwGEg
ztq6oI5pGWxsiQcT2hvriPZQ1x+jCPvUhvtp/FNa55QVMBai6dw2CC8UPVBTIGN3jsw9G79IgyS5BNU4
80gWvolCb77GnUVgEMYNOBgbiUMZXuMh6olLHLLHKNzvLxigiAsRQzDGQ0AmRHBZmhATQURFOSCcsLwp
UY5MthCE+/EhiQW7FP89jAaQg+BaP41OixCCnAAU1ESqj+LwfCz4vEE4SJEbPn8sXVfCC8hKENldEAoG
1CAQOQzSzYBgD+CgCkhQg/BvCWr3iqQ8AAF8dCryJQ8Qa72mhlSUZEyZD849QTh3kginVPYVVXidm4OI
FrlcjG0Ih1jqIRUVIaLExw6oz/AeEPp1KfaNoKOaIDDIRQN7D6juEVUQBE3TvAwLapDnIKAwA7cE8AUM
QOtQEFsAP8iAUE2LdWhacPr6TlBQEWB+YOwi2qizcDN0JcU+YlU9RsCesQYC0wj3rwm1CAGrv+kWjWXY
mMMFB4yo9L8oWG1YWMXyOl5F4yEJ4BIEID1/EgzEBmLsOVc93r4jQ/ZLAt0BvwhOv2BJFLJIEH/1V1OU
GQLnudxYw6iGFQYPbfVMxoYR18d1AQBlQAO0HQIycAlGcQI1FtFoLwioKkXsiPk0JLtAP2gATEgQgNwB
fYAk33/BSNCIXqCAwh93T8GCFuyinjKElKVAESHYrtnfOqChqAdQOClkEw2RIhBnDQgBsQ/FxncsJFjh
EgI2mISb/4mbXzPBnXVMOfumeB99GGEjfEVeqkRCgypCMo01uIyAchvSLwwOG2ZQDniEoEyOquznNtcN
lB79TkjrNz8XW8khzA15Q3URqLa3kEqxQBhEsYe2cyyy310SNiDSMEo0fwPQQIiM39aHohZhKfxA5TWl
2p+oi4AwTQH+Cmb7FYBuA20gK4CBzF36DG9pZe+HCcctaCWKVHX9NAZIuP+o8vsBRpxIgxLJViy04oI8
SYZYqjsG0b98ghtBgASDTD+v8VrtYBxBzoctNB1+3YNdHgKMgLy9On0zUb03HkUI/xAFfNDduEU1q2Pu
T3QHP0OL6iCSSwWLLBJ2uLAk6unB77SJbffLX4KnJVXMTRDugdlJ4O64dUx5HcAPvhhmIM91XRFYvGFB
DxNggM4Ltuk7ESVcB/hMxHUKRjSzgWvJL2KO5wIPHEK6hXb6xucmIngvV1+qtn4frTP5ci1OPyZiz7VN
7wXvb1qDdt147eoFGv/T6wSxFuHwTpeBk9oRtAxVtnlh2I2w2u7LigwITML0DegRio9JD0PcAdDCUGDG
IfyFJ5eEsXsGQYgG6x0fxo2vKgXadzwKmGwDMnxJAd8yc/1tRIQxWh5sWAkmfGxCjdZ0UkkBeWsQJBKB
nziPCANhWSwg2XbskKhglQhR6wNsMMlRtbkByEA1CIKn7jc7xiE6EEqEwyUQFutIXQizPJWE1Cn5gRFu
6vh15+vrQxb9ZbcCgeMeLZrj6An2100G0YXWwzvrGruGRRipIZINoVsIiEoRoRhgGe0WhLZAOxZEeQgj
dNaO3FkQB4xBID9ZzrUQdcxBVUHwFVVHR5BAQXnPB6B4YELHPHx3YYT+noN/EMJ/9RXukUNAYKGnePrx
D5okCsxM35EaVtUyPFUMBociBhjVDAhYVV8c/SL+IEkFTxx0TFZ+BcQKZ1g9gDgXVAlldzMIVWMFpBkG
SXMMHslaWBECJD7CX3S/xxUyCEV1IL8iVb0Qqpm+Aej+YmDyM7cFEmtmCW5UtdT5Bfen9ki3he4QCtwD
vxhSlKAzOt8HUCFcsN+GXNVDhTkfQAggCBn8ZL51Eb8Ypz0BPAJGF/87hP6tjgxGCEHGRhAMTEEQHnjF
bREDThSHJsvjkPqnX4A/AnMIHkh0m6lWhGw9AkZciclIiEadEzWs1Nt6S+5vL4ElUC9bOggj4gl0Ba+o
8YPfxwiJ4iN/PlwPC7+UGhLFn3YeVGMFZvuPlTrRBV0PRR/v9lUtRCsQKIYNgCnYYruKwuAlNgckGEE9
vjwXI0WJdpMaaxn17sJAgjr5d4XJTXVNxJDLpEFRxrpRsI1QAewJewFzdD+IdjQNxIlpHu4FtbP7is0b
KV8KfVhVIwpBqYwH6YptC5tRYVBRYazbfi0OQolUEAFFAGGfrtlaDWF4eR76izTRsHZ2GzhfCmGrdrML
P//FTWKNg4223+ZgSPZi8xSLplFOrS2qBqUWQQic7mfbsc6oZENGCqhkSY1BYgCfggr2cYurNEJGMA9Q
w/YHhBb4UUe/PBl2FJZ9H/Xtx58D/xpBv62DK0BLIxCwKPVdhp+0o4QnVXmNVmPJIZmQ0tKOApdqCC0K
AfdJ/yqEnYTGAo6BehmwARdTdCNoGJfZIQF4y1KcjVYiAkfyDL4BAwzN7aoOjINGNa0kFCvUbrhLp/N2
CqOaHAbWEfGNl90fUFjATsVseUyqKhUM7LDMXFnFkfp4s6w1g8Qx7Z6iXladkbwNAAC7S/1kjpo5EAYD
ThCEZ/QkdItzGHWULHyNmaAliLoNU02P5IDj31GKXLgYfNUkgkzRteh1oTAEj00PjQVqES/XjVVXreA7
EgK2yQLSkMW7pYII9NG44160gR2ngcEVkaUalFG0SaAJ5uOELR4WdiSYTpFMU2gT9eHJ4lZ1uz6RblCx
GEo5/hw+xrugqQ46gPpf95mNStD+y3aDgXIeB58acwWAwqnrD/XWntkMv4ouEOOJ0fe+NAIOfmH34w+A
FdE43dMuC3OqDalnuA/5GsF9XmIp7o3MbFvjetBA9WMgCJ9kvklnGxANvwZl19LpRip4aWXgHBDrBSrf
0HOmFR4L0rvaQblm5mYEODxtL83HZY1pjXD+HI1QyfqdmW27ZAQEYw4Lv2IEszdxtmHGx3n06En34WT9
EuUMh2eKxXOl63pRLLSG6S1sBXAJ19BGDqv/CPbITdQG3LHBwr0Yi1MrRECEYkajRETaKBPOrkBTCJsm
FHZVicSJSgDdsNhUdA4ZvzaKehLxdAzTmNCt9pn8hBepxwPdhCNEQODqZ0/kJUBLFI+gh2PJIeP/4A06
T8/WsGMDZZ+cDxwAcAD7/k11GWj7TkmKQ7aZlVT9Syi6WCtgUU3iubaSC2jP441s9Vt+WoKlEXlFgU3f
LKhLfUF5UaS7xHsWTXUIB4B0MoRvGcEhSk7B2QThBtJ1E7wPSGgVsFHkVSJsCCRhw/H9COxinb2DO5mR
OMSJW0MW6wmxSxBPguSAWbKCTR6CCHRjtyn/Q0LBCVNulxAO2ek1u0o9LCUNUiOvnfY1kzbaeAQpznQO
eDB9GAcZysdTTInwVIeLJC+pgMeBIM2+NsZzqenjUfiEMZINCH8KtBgCAV8p2nlaRjfAhvxMWcCeIXvz
5h/KB+ZVADoQHgAZhi1fb39wZ/3LiP9XbyFEiHwkILoBH6H7SNg5rEInCClT3p4IF0CAdSBC/m43w+c/
A8+APSG6AqauQLGmpE+nImWbanmhUSBbRMG6J5/GU+BgIfnAHgRgIroDIxGx2HRNPjCiIGTAZmMLDDxI
Ipg0sg8jugSpT8Qh4cL9N11zSxIDY4Bb/pIVEtgEPTaP6pEqRqmbcmi5ABo6EhX57UxCwbawVNH2VSow
5FPoZCnuB+oiFJQsVAkegzCUa0n8YhNCgVQNcHewevKaynXbNvBF8hPSsIB4UJFtKwJWQVS6+1SHFw2a
DB8T/+sUzYZUm4pWOo8p6gNyVtEgYE0CADiEELDOJhdKr4qwkkPd9qGAIxCVOSxfctQRCYpAMwHtjhqU
TnfJdhsIgtqsbzYIdXUSQxU5It4VIxh3Cut/Khj2f9kid0xBigQIBNA8CXdqJhVLmOpLN2SpCipBbQi/
K0rZlngjdQiAw5z7KxkbRU0MfnB403c78RMT2esn1FYPQXf2jhp2X3UIJDQBwnIJB1hAL8FWu8p2EeST
AtgqXUAmNAbBB7JMgUxYWJgEw6TTNMs9oN4O0ZP2gJFEewSvCltRCrANKFNyrNEaqEEFGRC1FqI+XMmE
0jqTt80QAShA0APMRtCqNkEB99t3FavCsWXTjL8DYje28NMp1kEXX9Oxq+p7/3XsjRgkIE0WVQmgLfWJ
wEKuiHIW0O1S1BWjIkt0HXu2LUG/83mUIFwRGcsftdVi28NAGoIT89YWdPcM4EfaXCQ4/u6OHnFc3lyN
WP94ASs0BS7ziUG2tfb9fBoBv35m/vcCDxLRGJvaItrJBdsEwMABtuMdQO+F23UwEZJsT0AFANoPAozU
RuRKRM5JEHtuewmyknMbyCvcKutajOg3kSMyGB8EHEIQ3xhwWMRhKyCPKCSiIBXhriAV5VkLhixvgI/I
dUjqdv2DXgGPCqasoK5LsI/5aItNEsjUWFCEbkCVIzqebalFXkSK8E37RTDh1bv+ScSGnpSVps0x9u8K
lIyiM5OfIkCF+xM6lXlRSIB2xpgSTwgCxUY/QQKTUVSgATw7x2gNUG07GsCD4x9FH1Br2jY2KJpRfRlG
SRQ1EN026z88wWugy2QzxesTtsE1KGpUJS3H2MHeKuqJ15J1Mo4xZu1uRlHBNirqCfohQLQJRErcUfw7
e2/AhCyJfLRI0Ih/Yy/B0ZSc6xzXLgVL0BVVn36pRijQxXco21mCzYvAcxnisaRg4DsIBW/OBLUE67iA
CXhS0AcQuLwCekG91bGChg1BpboaBX9rmBYf1JwIg8oBQbwCGMLN77O9AT+1uhVVh9oNASs3ckHcCw9D
+FJqRvv2l7h0BxpD+vYCdWtMOcHAxl+DYpiGjUKf+z2gWu1yZwZM/MW2UKAYIhnQHdgW2osdjPflEBPV
x22Uop3SCEH0u+Otoft5TClYxNjoJeNmusUR4bbQEIEjlgxMbIHZS6/2wgFq/AhmLcVOdnOZVnGtJSj5
q2FamFcVfnM64N46THH391Nq63TDD5KHxwA6YN0Lwe0gad93E2grfpSD/n8PhwmBBQOqFG9ZO6AawhdS
JVs9AFPtOITYr0mAOdZHXBSHcUh2JJ9GlKZq+8dDmc2LVLREiQNI1ZhE9FKid+JJDFIJiG0TmeRSLgUb
UTqEP68GAvjMNgAdbffcice6jQY0BYr+OypvG4aKyB2WiRO7D+o4EojeoA4Cn/iFgEZgOmsywS2aoQVh
mURXPuNwgE+Pd+PZnyVtNIpeMLhsJq0avFWu9/ZEr3QIxjvaAe0cNwS4AgAuMIwNrTZSlfB90UkCdpDa
Q4hAtfZAB/FpUrpAgS8nMYCtSN84RhnAGbA0O5hhsYoGNhkuV5RhVgBy/2ADCboqSAKfR0HhGzICnJzm
G8ChRDzf7+3FuqDddTMTmb5wDCI1YPERqP7QmYJouEFSwwQa/IgSsE1gLYt/7pI2N3UbSXQUayCMEqKO
vtFQxRkMg5McQnRyn20fDBYwYEHuDRlNckI0gGMvDB/YgBAiDTMOugOIDqFn1JjNuQxADmxAXA05DjoA
DfkPugRGEEDM0B6bB1xgKeLQbuiCuoAYdmAUXIESYAAciaoyvD8q2uEiQoD7SA82XM0EU+n54bYttqCf
8TMoPkBvaJPiJtFrEASPF7TzU1yHcxCRFcMne+h3A1oKBjnpN5zBbu0QrXn1CSJHAg72I5Y7Bq+eZCCe
kFjn2mlzCVwgLhkWoA07nSU6CTIDXjLg2xk+OJCgG7GwIN6AQb8+7i9E1wSvS8BD1MF2GuJCJXC5/Ar6
S32I8lZzBEx0M+OebwBiG55KwQzvzenkk+bZh3dDEBjGfLS2Da4Uz4ANdhyWPjDniC3bFsPNaRCCwR93
luuuMcB/NYq6BV14PnV0R2ULDFEBdnFqGFHlkP1q+kVBF7QscdW0A1vtcWkB5y8UYA21Aj0TXKygu0cE
sR1R/ZrMmWQQZhVLuLgQZJIhioo2sIeARgvESAji7hD0ikQ+2ygk3wQ2Eia0Kux7/aoMEwLMa9gQktBb
zzRUEISxwyY4NyY8kkkGm8+86uq5QCYZ7+/2BygIEfPP/YSYhOl/LvWeVI1aiLYjHLtYWp8HwIDww1ha
v4D7gNObAe0UQHzBQktGLOHTf1dgpzJiAH5WnwIYMbAhY1UAyVU2qGSmBwsBctgdSP/06Y8Ip1/4D5P/
nwUhK4TjagIiKUmIf8R0eI5ySInns8C+RYs8J6+UxOtcJz0uY2RQSgt1F+SCEF1TIGpZQEYGrNwxHhhm
iAFrDAIQqz0JbWUDw00zNkMOaWsJz908SAeZkBwMc6bZIX1IX+BwldW464rSQUU40v9TnooOnRBqld9B
r9YC+AIS8A0QWXpIVFDvjUXDOTUjNvGiiEnNOAEGDOQISmoiiZNLigd/O7+32V1LyK6pD+ZBdTM7NpDo
DI6iOJQUyR60HA/yO2Qb3A02BK/0Tu46iuFh0QL4dFID4YVyD3ZI/ypMdT8BFRIWDb4gCUaoQq/DcSxY
C/Bh8jSmLP0waNciQLQKTRvYUhyyX1IwpN6NjTdFQCnbQiLp0RY2whr1tfcRT/frZ1AZpMgzTwbxbAt7
VFoaAAVxsrsn9aSzEPk2Agv7OY7ksFkPEN3TdmAjeQEhpU9HNmADoQutKHujPnNkEJELrsi2iMgJpddZ
TlEfNohSyWqk92BUi7DIC2oKyA1cr3il3AYeVUZCdaD/07OOzFDsJYZcLoAUO0PyyBDuONn+S3ghLKnD
NdH1wEgIqTisDzFOXhj3rIlHOBvywqgY96aTCnYtZVT3TomsTi+QcUgHOOk2HEB+1Kctu/E3pvxAKymV
wcJ+VOyXYLunBPfNqkPyp1unxPHUYFWL9w3xSGvDqiPUpWHxCvfdN1su/8dOY43rTQDTHYw30OsxDS+H
g/ADtiA3uusa6hY9zWQNDCoCmCHsvlY1+SDxM8k2wAjY0O5I/yQe6aiSus0xwA1I7CoYpdEUKw6j2io5
pcoxL1qsqi9uEEmzFYxyD6Mv63n9LRlVCEIiAy2iYbB0pwVoQ0XbNkBiLQRfxUYVIoI7Di2/axRtFzVl
xUkBx3OlwKhhD1VbhDAB6kawAVMYq5WMiltDBCSrA72KQ4BdwQovoIUYQQ05t2GGoUB4SKyYE2YwGPW+
McD38m5WyUEeLjCrB9gEgtAxLmXLtYBULRVeDRaVQhaQLZAtsmhsZv2UqCWwqC2UFxDqw7KUMawPZGTV
VlACAdAYhAx6ejSztgjCkBOlOqMJLNrt6nQFBHUywATTt7AjV9L17XQ4ZE1BwTIvHzEcYz0wcXXUAu7q
OgW7F4XvdX42sAy+35HYIk7ZEUTIVKgqGpi24RJRlutHxJc62TGVFlV1dbeaDNDciRYt5PRls05B7ECo
soFQcIHDp3cfqK0/iyABJxwrUn40sewGpyFf7bmFeWJ4cdV1wD5OdLqXhVx2Pj24JNytS3U4eBPhqYb9
ugv2iwMaQ1+pch5/hN0jme3oMmOpy0WE5HSoE0KML5kiJjOhgt1A80Or1X0hz5A9qdQrBAM4wktgYatk
Xo8yXiUPEGGrXKvVFhbwQqvVHSEqYNRh4XReF3SQFBLRCF0vMAaheDM85jF8Q/glRCl7IJFY9aJD9jMd
Dai1NC0fgwhYMN2l44OIRQwAomGRKF4J5hdGrGKpksevBC6LqDu4XwVfDWYs6hbpHZBoaxgeUMQgHLys
S7B4owy0mn3p8cb/UZIUREBtxlCoVZSPrQGI1ixVzWBwBNAEEInxADAfooQBl+QtQpNFiAwAvGevC6OV
oKEOAofLEsIZtu7kHvaMWAHNpLHpHTtYBSuSs6/WXAHjBwehFkKJxv+NpFNC65Yw0bBhTKg1uOYvRgdS
vHI2GVLKpckkAycds4o6DKMUyu8D65TFbIEDLSMYxrDedAwqU48EINnALkaVXmD8lbPGdT92by9hBQME
C3nZRwS+D9G6zDY8WkgCDl4stjwUAHCfZSUpVTLDMvgqAMR8cECG9EIDa9DlMe2DBbJ2vyOtUSatR5ir
TQCgVoBMmAC85AjmrqkFrGxI6vNCLzkYUXYurqUt+JU1W6Qjr4ZIhSYACyu1sn0sZA1QS7u6jDwCW6gQ
jEulojvkXro2sAN4/g1icB0kMMY6eFeOQWOQIPj2xAF0F8bKFDvs+5AJdB7tpdKfFsAbQhCU1AYS/Fh+
rPtMie97EJwu/RWtA5MEJKGSdBb0L2Cyc+/yAPsC817wjC39BQQOdT8UU5DrLfoAYeyrCy13+ywCA9ho
S00iu3PVLVICgceREiyJeBoBEICfA1YQ6a/WPWCbwhQJEmkUYX0TsTn1HjwxX3UNE8WAxaYt64GU9Yc8
i5P8BDGUr8kYs3gyIApzcpBg8SxmTJBwXow0sCE8retQ0c3rGZKOVes1TUICbCWsEgPpwTmFFDzGXsKk
K7JgISRMBEXikT3HK2qnx9GQNZgE5nEw4JEEz5gD+UyJISsNEM22PtEuZcFXKzgnphswkCMN/yzSIgli
ZAR/BSahg1AEdHEASsDCkE9MdUHxH0p/CwsfTGbfyLGxTXUqBbDUAmhJdAD0C95D8XY7EnU0YA1Ri/wT
vsaywlgs3U9TTxPJDbhVrHZtExy0HFlU54KGWH9KUJAziIcjdDnhGptBHBkLcyndb88gdjVHcBfZuusS
8NSwDRbZJUQIPBIOi0faySmlKyMaduCuv52oYFGSeAFJtoBDP66IRJ2ef3QOdNW3b0SnGSkpQYtuMCnd
W6Jc8HNIScerlUaIDWC7I0BI6xcYSwpwy4ZhVKtQqAU6GzhZYYrgjzNSoQsAs21IFfsgULOmQIgsJDwS
9qwO36eyHmXgGxncYekoqSJ+qgZUjGnrU0ZwkISzjG2Lqo6MoBjP6MECdEKP6ynlw0awDRkz8xPzeZUz
hxz8/nLgRPxIjdV3sesilLwFEKwGoEiJxxnBNiAJ4Q7qmK5kkkPnF/7/CDLJQ70X/kjIASOUyypSRtVD
UWYub1VrmAq5MM1gajgKqREGYAQmiyNutR6wUGrRwhD4QnVHZnccln5LHRlJZdwrt511UwfuogZ7Oz5M
OdFF3g6G4LVTQnqnCkmNQgJ+xKGGEbeiYYoyObCRVwPevgSGdYoEC8FBAU21i2JTvwSYPBF3Y6j2JtpG
PVhxvwLTFX4OjHBBpFsfyGfOZmcgknC2HANwwDUX0Aom1WBzB4YpFkWjNoPVwoLxK0l7IAhcxhn3JsxI
RtgKEhxFJ/jVdFHAghLzdvwk2Co5Di8yt5CNcga5g1Ercp8IQYS+xh5yvw0bFdalDFCb4GsucAlQPLuv
CSqzn7Di7SUD0n2Bguu08etGF9JCns0ALrsiBBawsmYWqC9hOmBQ8Asx0r8sEUUfxgIq70u3D64UUWr+
p3UVIYqXhsZJdI110Dct+Gvf1NAM1AZyx+EpiLUI4zEsFT0ITJQ6awPaKHCL50jqFowIHrpbTIQKRTsF
h6lUCtyooBF4k3QKUuCCFOknIcZKreKNar/Si4NwGTwSw90kTUAs7CABQrfbJoidrFrtBzTpHrUAkEDw
8CQDwMiWV01cdsgO2DYsPy56dXRPQBwiErGKjapN+OteA1jCB+AptWPKuUTsRgaEGMXC0AdBiw2vQjA6
EglxAYN0JMiGhfENjInFieiZMEEXALcEJ/fYyTtYAvpLVHkt6zwB9zT/agR9Is+5Km9xq4k3fMHlBK8J
pznX+A1n7aORLHjjwwGNd9CDjKDha9nWqgjLA8GLAnd71nROJUsBIYfBi4KtQdtBia/rYkt4SCQgRUcL
QpcKTAV0WUQJucOegsl/PyBNZwGApuAfg0Z3XFQHrMNHd7iIupfFNqdFGD5zwRcMgA/M3gzRic+a27gM
BgBvoQH/QCMFt8e6HxIv0Qn5JIH5A4sQPI1OvzIAxBYE+r4sAPGbWxC3/1++2ATEmGBYtCP8WsixhYzJ
qRi+UwYPGGFydr5dLVwZvJASRABf6T4YZAVvXzQYNPBGSQnUxl8CUhhcA0CGFXAS8qYRdFQMGcRBQDRL
8gwM50B8ESndYdAxPjRA8UqKr0kLgyRAF9foSVWkPksHBCTDIA6LRQh3wCLgjBCmX6NiMVnAjiidEvoF
hM1Wu0vRIbTBZEdsPtEHjUqFg4GWa3TCol/2KrxZfXZ/9sCiX3l1eHW8XjUDtxmKNCJ2HmugXXtwdT26
ejmJ9zhk8TBWdSNjXSALFYck77vb4g5CwI1lNHoAwy9BsaAIazgI1ZdvyzHAPznZDtJB+1q8IhQbvEyB
WiqBRzFHWjCoO8PMXnYVCGgBgUcNpXgGXC+zAUy7WYYgWSNuWT21C/TWBPUwtbyafh/nEjoJBjD+Rzfs
CHG7R3ewzA9frA0jWkni2WKP2kIYNIEwViu8yOq6drm6jD1NVMQmBIsMACh9Zf+Af0HJPAWwW1LSIMDL
CleDBrZdXk8gB19i3jOgAfBpzsnAnsZBstsBhRg52BExCsUCp85ilQMQLxH+TCg7cKJwgmAHMR+xtPDG
o3Tm0HRTKfDOqLgAxMZMb8dud/RALDq9/3QrQFw5KNxvCDkBRDjLdegE2KJyveXyKOfEApWCmJ9UAxDt
A4y+TEg6bVFsv4i9/EFeqN/B3iCOHXd1v0i9AQDFqYob9a/FK9gQQBeXRBjdAO2sR6pb5QACP/MMVtAW
xRw5y9hwgm4RMNQQ39yQKwGcmIYUigU6U40J3c3FdhgZLM/fCjOUhYqFavM3wZiweIQCMcYxya/OyHfY
/R3Amt4NAI/e6SoGoWLEx72I2xHnx/9GRTyNFW2GCcnbCEPKPftifLcdvx0lBykBiK53KI9gNIoMKQuz
BNG+tXcL8U+NJJ4JqGMrUAplN+Pi1HVhoVzHZMxyVbYFAbF/+w3A8GY8Gkg7fCQYNmr7CqLH8tUz3Y3w
2IVvzSJ1r/8BPZc0KmLOB1f7dQbrMgAQbepy4NnbjBsGTCnmJmdcJCAKK4ilig0ijMWTVLEVOxPALEGC
sUxWm0liKwcqttgsPOgD0AuIp4rBFcUHC0VLwRkcz/vwiQ0bLzZQLwHqOMNVDRmtTwMt7x82BeEtCGq+
na6akEMXDhg6wDx0RvAsdsB4YHdjwLk10UtmiFFRun5c72HHkYo+cMlD78gBPpqmo8EpwsjLH803Wcbo
HcEpwelZtJKxY3bAKQ+HKIFYFWdU/4W/6EGwYa0Bz4H0wkOBlHUwO/5FMVB92IYfRP4nvowR5Htsfxwh
7uqE2KOcPUk58PzxAi228wtoQYB9rctUqBb2r7VdgpxUwbARCUq8gBrdC1XGRUFFwhhRsVTUTYbaO2Kx
hdQwHkEA6xAUC4DbgEGwCob9S07VgRS/ICfHCkYiDEnGxmNVx8JvEANBigw4w3fac4UPS7Dqwbc5HsIX
ipcwgYN7UK8URAIW7OhXgQyKrv/hALXXBb88xZdPTNYKAQdrykAqNxrDFo4VtGF9CuY/6SOIVfEmz6UW
uO8FH4JLk6IL3A814zEwRXXwHYhhx6A30cZlMxEEO6PGhRM52GeI0REkfHzCsWAkoiUKpwfWFvgg3sR8
idI2znOQQ5n8xJZHyCVD1grOfX3sEL4tRv5SlgwbPS4ZspYKPeLiP2x4Sx1nxSAYLjHJohBsEkgzFQ7E
R5qHMMRHjVjsKdoCqxssijgVBGHDMG2IKGyROBZILmTtFexBAcHBD2SxRVZNZIFlPlMskMfzZqYEYGRP
wLllT9BWWTzEfAcxYvYbAk9q9+Fna6WywwanZIBkS4OFAB2wG//BaHK8wVh0OJOTNmmpZBxM/wUX7Deh
BnNE+P8JBfoo1OzkDakWMbZAi0Wq2IbkQNoSJJAP0AC0CfRwdWkVccKgCPPNxmOwgV0C+cC5hIL90Q1W
DpFVdQcltxX0+RJJS3UsRhLBDcFLB8F2YhFDdVsSIxQjBjcbQ9GQQhbQKJ/PlsYetid25ucBzN0eSMso
invBDGpYSCIXrPbsZQauCxgAWeukndVtdwN/Wkx1eRF+nD8fWKLQ0HbBsF/oxgO2GZd4XPXAviIaUoSi
KzodOa44NxRHBuQaC3MsFF9yJzPHY6L35nAbxLACJy+8ohVsWEBNdARoyooSRsWPqAFX8bt1bBDUWUGD
eCbIogtELAQ3dA5N1VUsFP/FV3Y37St+8AHINEi6DClFiB9LVGLCoMd00cIW3E12FC4W/g1wcATacgJM
kcdoElcxm7DPwV8Yjwz2BGlHEObjBnLbLgJiTxmFhHIZgB4BRGHHinpFhpA5ylqwomNFFkyCCjzRXvB7
mAqOKeyFGFXf03wG/xZ8RTcVBUSJwPrDC+87GOLIAbcTO4wMABpeV5kCjzF1b2FAEC8vLkiIQd1QQrwW
T6AwQBAZKWsKQgN1QK4XoeypYQ1PFqcJlVTDNpWkD5OhQKogGCvEBtVZ0R84mxEnBAi9ZpA+BHBgr8hZ
1En0IBWchXUN4RMKCo0BOzg5D/TxJJZSfLdY7clVMYCF/fisG4JQwF/0jUL/nkPBLoIXOEwfGEBbgmxI
BCflioWCFhrxdxh+OoUFy2RM4xPNzUwUDUB0QngQYAPoOwaSidZLqBWOZkXxxkigIQaGAQsb3X/kgWpp
xwlJVXNFCuuvVtEGUWjLZW37IcAZr9FzS0gPC2QCFHefxtcCMA9BOnVwow2iaXQ7AeuoSaK6YcvrrwE2
o4CmtItgqkkA4N0DnHKa62of/S6Mit6P9VbMUqwb+wTHOdZjSTge1XZh0x3XV3A3CXTLA5zN2JCoeIus
22cguD4KJMk1T2GDaMKJL38DJwcq3vTN1x7OeESKUB56KAH8LTjJQDeOBd/vBArrCJ8Bxh3KRQWXihZG
hMFMLAJOEkCJtLfdOFUxufM58RajgScJ1xMJMvIKceMzxL1rGg7bHDIPN6gZRi+E0uzMKiSBgHkYrfYJ
FTEASYi4AgxQcSQ6AAiryhzeY0GMS7hk2ADpEzooYNrnQz/Fh2tjxB8jeeU/ifiD4Hc6RFMNFUBHUhuN
WKBic/LlBBHu+4jdc0EcTpCTdUDQa0jPwzl3sagGoMbMxUMjSkTvynvpqGJ1OaA4mUBzv9TOgOKFIzH/
y+UsjITtPQn9G5OEMSYU/JOEugyjEMVTnExRBi5+LCnoWiR0bD+KynINAbnz3iIe2G5P1s4oc9dHxbaP
5vNjtEh/3UejCJ6zJjQrUAJ3GEJAMZdGt3BwzhgnHVJbvETIwPHT653wrxo70kZSTV450TtrYIwZusEx
PAx8/NtN2uIZdAcDTu3Lpa84I6hRknlINEYwIyFQ3hZVkq0ZG/LpCAU9wIkjZBgDT9DAKJEGj3RaddIx
duB0EWWQUAeQFbXBQcBVzkYFZQrAM3xdUQiiq/DKGbJZB9DrMq/IHxixEUTheP9E+mi4BXbOg//c3qBq
zfAyIF/KdA0rIYtyEakvUacjiMhMGBHEN2AvRBlSQrqok2brSy/IPfxjdgnqcL3MzOtTmMgJO5NFPbwi
emBR5jAx/zuB+tisaEMe0K8xIPc2CF9AGggjtdOhaHwL3oUOrwBO2WdVRKGaquBxFetb0VDcGjsHNV9a
6RLGfhtP8fFOZgnBL6+KvOgVwL0G1luBI5PHw1kAQb0DPRfRhQPQAZR/A1mvZRG2CumZbg9mEFpUfr66
VqmAkze6w39vd6ha5cnPHUsMTrbswHwmQlzN4SvrZlRvvnuCGwIsXMwmZC8CX8Xxzd8OYYgN6890aw+B
+VpO1owtFDpfbIWHOP+L7F6wAS3OCZLPw0GBP18Oe38LHE4o0ozpEfUC4dmQ/RPWizwdanWVPBcZkCEC
/hEYoTCh9C8CgtNF2M3Zun9/QBUF2imC5tKGBCyDbORkwuUE1xa3gAzZF9MLfgQ97MjI/AR1FWTXkLEB
ipdPkE20405Iqm5A+THAT7UAtcAmEUoFM6p4/3ZAAXnv6aAAq3XcagiqdQFIVVvsuwDFbYgQ1CQ5/0Ub
tSRF8dSYyyeKSMRTDwooJqAlg8YXVVSK3ajB1HEkV79BKOIbvYn+jXpGSxDh2dF+Hw+AF5MBo9nGhNgj
X9Za01sTVJPoLpXCFNfFiqKBdPBW8mSKKjXN755WU10jt80+LyMbNsa3wGmDDObPy/IcBCq+JdBGHFQJ
k3UUnetN+tY9dy7YQxFP+pZ+c42gwdCdMw0jRSHZCi1VJAzNgOKDI1jWSx9BWjLSpOrSB5F0MDYIS8DI
bAKJaMV2Da5DjHUdGrRszIAhN3wgb/LW/WqeTI12PvTcTbpG8lQVAAKPaPjOMgPDPR1IoC5ExFgf7YPl
xOpdkeaLKxpRPsVJRTzMbPRNPHfD9vbBTnaBdYLrR8xNidZBYaciTnO+c6EqwnW70NGo8P8jcL9sQHb6
8NGb6xqehB8bAmWJ1wj6RQdL/9Nub+zUmxRyNEGKRwI83TsQFKQbWG8CO+BJL8nxo9NB1V9ShaR3AXMU
6RCinDRN00IBHQH/d4OFKp50U5JS0jIWa1gzgDMDBatrp3ILNwPzaI0N0jdAG3bxHbbAhRE5V2ryUjnK
cZGoWGlHTitaEpVcI0vfv6rXSj9FnVwkYJqsgBjqjcEYQW4Z2yQh6haVq3jZdioADQGvPrG/ihhkCwQc
LnroRXBHD7AwmFUQCAe+wCDkms8WT6vocaua1ZsOBQ/OST4AKAVNkU0j0bGo5dSqW9bFBmCqZEyF+9HQ
sbAlEuDuMgIFfXEIVfw3TIn2mT/CsKSDotaoTPHYCMeiCfrwa7sjGStUceWWI+JxExTfZefwz4P/olR3
nRZXNE0p8u8agM+CZdQcSSYYHIOzgpRU2M8KWi3CP5/GdTPrQITQDmNvWRDIJxTl2LBnXUCCnDJ0DzAX
tphwPi5BUhQauz/0rIhe+suNRyIF/NVnL1om60UPATgWhWb61lEcALisMBoleD32F1rNx0GNQd+D+A8l
KOvYfDFkQQ/Qb0/y1kgVP+Gh7oPmAmoldztQqxp6cFRh0e4LwdOY+8aeQxlQYhnlqXSypYLa1zp3xRVs
ePap8XZzWUnVNrDTyU5WQnO9qyEuSObkN+2pJwALwNvxCRUBz40ZVGhvsIDPy4IxCypaEKqLCw7bbo4D
GcC/EBocpbNv/dgLI1TVLA/Gg/kHF0b46Ahj6ye7wFVooKFjA0pYnkDHeDVsO5ZTYKVwMANQqs2IuyCG
JuOBxMjJOLCQ6UxLGYaiDV7Ub4gwEcLqa0eY52zHIVXM52IJ1zMEgO6HjT2TryKcwi4Filk1rj8hBQSr
hOkpZxQxaX/OVQSAd3Q961s9ZK8icsxRgbtuDd9XkctmBz1CExBJLEiwsN58ZW8MICYbQJBIFhGDFBCZ
OFtCX0b5OL4CJxDYYAM5BEM41PbKkh1AZFq+AT0PsAhYPyUEAEIWAV8CRbtauGQVJUjNUEErImXWZhTR
slwsBO4yIGrotSKPJjODiAvnsAhgY80GbPf2abYg/xUjJuscJbi2bTRPNTroqhsbxmXbay16AWTRCh55
KN3am+oMJTCdKBVC5rwPKRQ31O+bGEdAGBFMFH8EJDWkqAjG8GNFvFBLAnURvAogOggQNN6sIREwki/+
AMECOmaQvxgkiG6ojUhH2bZBmIr3wAhSq5JVxFlM2SliU7HaHGp1ZsYgigSRBk5VB5ICx0OYNDR9Kn0R
QzNzewOwBypGta8eRJ0g+tk9AAF+Rh8mAmYBi3uIPjbE5QF0vahj4kG+LwT/0AICHIBlFfSSGA8L/+IA
QYjOsiJoEQX+AhWtiNZu3UfCXXjIpAfysFqzRQKKwTHV3nbbDgZBEjtB30ygUNCKsoJ7+OCqcvHWteqg
OYhWxJtLLWG00dyuVU/E3BNI5QVMFEj3BIAM3C0xpNkTgMxOtpOydgyQgL4gRxSbqTIFr/krJ5DHAHqi
9wSzIgbQ2+w4Fgg3siK+e9uiSA2JB2u/MGYMoAEZLFgdyq0NOyBqSSLRsbknmCrxA9xpFAY52SI/Gdd0
6MZ2ByhDb0+yF3hgZ2NP3WdG+ix8FCEBme7mi4iLiFCc7NhQU5uxkN5lx0hAb0ED4wGFeCcBhWFDcHto
IADAbO6fFGAwxkA4AEXaVHcBKNBPbaVYQCEiWiBCSCJrgEFTMbDZbgEsiJYf6NumN1UpOGMPsQAZiQJ6
JAAts78weMFIAMTxFQT+IwQFWvwBAGGMChaWf+8FtgUnBTFEWFZED1I0aaYiqR/JkFwDSGimIvKwbyAl
dH7b+8gp5AHNBOqlIQPIUAF4XCETyFxOa+RKHoWapXwKeYA83frPA0MyFHLspDO/RgSPjFAMKdgZKCZF
cVwnb6wdL7xfkf6zQXJY1gdF+S+YWEEziB8woB/84EMQYRTGdnsYxFZQrCg5iARBlu1QCTA+JuvebvUT
kVRB/9cNQBdAFJMV5BBRDncMIlr/PiVGHyRRxSKsr/Avo2LOJR+vIgDDAFphVa+elo3aYWedb+zM4KJP
3wJl7En/xLThe4UpaDslJU1zdzYoasr7YOZfrnfMAB1nZjAh6Sl72K9fbCFOTBylrR51ahoUIWAQXlyF
m9wEU3iuIh8GoLFIgHFsXUIOsN0Vah3rLTdAArHUNrUe9GZEqWpB8eV1Q9fJo+C/NsHNAexNOfwhAviW
b+fORS6sWPbAbrHJUmWtzuEIs6JVYSFnHpA7xtytVb48Vn4QPxwgk7zs207eH1futqxim0JOIYmt7x0j
B9hme+slN1F1Awt2sG0zdGTmlxSLiHdH4IhyYGz7flsXxv43kZSFwC/GJ6OiCHz86xdB5isGwo3A1ghY
amEA0RXd4plBOqtiM+cEYyNYFeafRPQYWBUfFYylIoSh6MKqY5AsH7AgGNFyNbimIokRFhRwt6BeEQxj
9v0PM4Mq4t2LMPbBIArj2Y2iL9RjDcdI99+sHSRokPj/J+OLamFlFKyOAZmwiLPP+L/5QUfRIi/8GEWT
EO/+r0bRWMT/wdevFUzyVOnoAf4zil4Y7+OdszY+o4L/7+Oyi7aN4AbEosFIicgdD8Co3onBF9WKGR3Y
6z858N9VXLaHTuZATlY3xgChwuJOGBuSoLpA1DB1vgCjgrJK+N3YCojEf3j67Bo+Kt6HoZO/4sJMUtEN
e/bnAWv+PpKKgmf++gEJalhAUi+oKBELNXgRNdV6whAkBkETAnbQoprAbWuUn+dJEcFO0o0i3VXKiOLk
PE9Q1SoXT0dYHNmxQRrGlfhtnhtClSNaZhtiFpWrNWB8WRAk9P81OJ+qYDwYMkiJ4ciFelHCT/wHWwBb
wYn91gGRi4GXBdRJFCRaZG8E9QJqLCRAH7ItPQEMif0CdhZENwqXX58iHkMyKEJoBoCEFEEIlvUxiEbg
7EIoDaLZelVjY08MbEGXIhe9IOz0YwsxIatotDo9rhH60SWrpoenykAse9tlgigcTeZlCAt1YyJL6Dmh
LylrJF87+BTugD0oOy/mWJkFETVsmXIOCcpTicPUY8tMPPEkf7ABh9mGEBwRhjhPDCnq5u3J2e1UkjiJ
8u9YrLEi2AD73/sBRNzEiXDv6kwkeORAeAk++ZwuAyEF0CVFaLFIwoPEOPLQnSI2Huvhs3E9HaoH96A9
YfegljTH8ZGdKVZQAawS7ijaCNwqOiwCNmgVtRTLWrBFcLcBXXVAmIP3AbWDgmWsvb8P0CerIxOHpoLp
K78P+AIWQq6HBDCIWIBJDyvH6gkamOluINVIQgWBirn94qYWLup1PCRkCpdV0YRMM/h1BjirolAqx4cQ
DwOKUzMx2zz/wT6E5/ZPlTdSS9+jlctiDHiAnBB0sOoSNNWFX9mkw6NHVSIg1goK3Luos0TBdQTMoPrb
rcJ4CBjvAXMxMfaiBeBDbA1K4SYIj4UNK2xmggwqPvznNuuTSIsouQkIxum7Yc+VPfYBCtCVCrFk9DBg
5FgkSSSBiocYOZjXxK8LOEshMa3tPBRkgsIQt6IIxs4sUWGcDpcwvOtiaCDuXEC1xMtZ69kf3aFo6wR8
exXvmykOoAlI4miWRsQTsXBZbxwcFPSvqnDH/xJJE02YiO9v4pgzJ01wYjHtwsArQKoL6ARDQBvbRNSL
mvT/FzhzH0VvfzeIYDcwIrdxui2vp2GfcAcF/ICtB6SGAXb02uBucAUlmc7k7AnCOypyfsaLBQj1KyR+
drcJRwYK9/QHug6m1DF2wFpRpIV1UqK7ijiU1tfVAQmGNIMTHgjsrAagxAaQL216PjsWbpc5926jQjAx
wONdkABpheqXvyHnA6gHG58eO78hLG1dQSFQxyFtDQQc48SbdH1+dWMZs4p+tilZ/grqeooFqIOIq474
ATS75EFz+AEza+TDCmqpq/nUAQo6SQcSo3TrHjE60siv3OsdeUYC0dnoorYPOET0LCJaiceeC2eLACqd
FlamYAAWDO1hQcbAq7zsIDzES8DnB4u8PPWGje2F5AhfBSfr9kG8aBOI+pIx7f0Q9gQeawMECctJgzfr
8CTt2LC9hjIE5z7z/TnHkb6xjyLwgD8wIehL8IKFrQO7KCMJmg8OxiVinwyoC70RiUsU3QyiphEHxzIC
foJ8QuBga6M2AABRxG6QVngVHT7kQOCBse6bcgJkW8ir3ZvTA/Q/dkfOBf3s03QQgT9mdWxsdGTYJmwe
7RerZl6F6EQbFwXrMDsEroLMlVsLYtyiRXF8rqT2XJmoDUSQ6+vVVVMYXcl4+waAInRu9yeiDxYWAA/r
SGaxAdBMJTBe9xTAkNXGIKUA1H538vyK3zwDdwo8AktFNRR9ncMjGIgicOEVXf8QcuJHUTGRTbmhoo69
E56wCDBmLpCAODBfXE8XJkUx7wAQfwX1bgbegAVslyIZRA1k5ghQoq9ITBj8fSyIersM31CGSaAiwGFE
y7+vGMQINBzbCGuAYsCKh53t6EGIxXYknu843O4yGFhEtUIsQnCu60V1zTY8SMfBx0NwXwgi4dr/ViiK
nnoFdWkvBHUrIxNRSipEu2O4QkU/d5mLhmokKL6g7didGAfpyQjsARncqu1tcNuIV9Mm/2IUJCidsSFO
PEl7UJFPUKmFE5mO7AZG5R5z0WSURMGSQxDEwoqAfz8eVgUfC/vFdxBgBPEQoBMKsmRLFjVIFRoYIHRV
ELQExyGDMNJQagTHYAwAvrFOcBJ42YagD2JqqUBVwxYLilCv79VRUtE2SEAvImTTMFGNoqieqDcIR1NE
JFQKFo8GgS1Xn5UwP7H0GwCvihiNQ/0wyO2iwlGb+AJIohowBYsjdGz3drAg8GQXhgWYL4TADxUKo926
mZZ+5sx9Ec0QtbJQityrGgjkTy9VNblWovDUJQehxNbRYKFWTIgYDxDaFJOZUDcJAPtFiBX2BQWDfViE
YEHINX8gGBoLXte5OwrpADUrB7eUFQ9yAZ74nSJhyMYYpD9TDT9BILmt5gpbaL457Tg71mq/L7j/AH/Q
UUShzdy/oFogJnIjwh6jeNE3dnjJ6xGIu3Amz0PtweAgOzg0gaPQc9hbsO89c4N/gflMVX9NIS/kF0yt
m/2cfxAoSE/4xgcDw2YABwgAPxiqYgGIVIJ4k3UF1LMhvcmNgAsU4C1xu7/SLmvUlwpoxuK9cibrIdSv
4hL2ixgz+EywLjgWRPKkaTcigtgWUMnqsEX0GOua1arMihD9Ina5SCkC8sIPFHXNYW82dXIQx+BNxcYG
8/KwvxwNUJuLqIdBSvLgREa6kfgFU+zjDAo8AIkBGyTtJCvPGrKLEpQwEgbNoDqLE/+aM3XiJT7+/w3Q
kghIOEAQDtn2DWo0CYMMiVAUERENFdWKKN6pqAcrhpwCiwyV4hIAH04BiVZQRgixAHgB/MHjIO6Jgg2o
id/wnqsAFws5jYROWSSDvxwlIChkhZ+pgxZMr0inxhzBpVaA72YQSijgV9LQUjXRkSIvAajJmSBh9AIO
VhvegHw8pPRBkvSZkWd0Ei/0az3j6mwQRroHCtEHNsgrE3ISBlpbusujSPJhYSRfcJFZEhq+lCA7I18N
GS7hhF9BW0FcJLpnoQNdSUsYA5ZcJPEU2DuQKDabozre7wod6wy4LUEEed5BpwZMhBkERZxyihFQSK4P
XHxw6f+CikfiDBIm6DCgqEzVDkMYUKWlBR0GVIHspZS2s7HAEI9/pz8TgCElQGBvd0AyCrpXEMOv0P+F
UB+40QBwyYvt71UUKYsFbx8xgQxGrxBICugMTmfYx+gFwUItz8TXm6xf0Sv9Nw+wwSNc8VyAbgPaTuEo
4FTyYQxIvFRkCIpD/3vEhFdI/pCYFA1SUc7/CTYGm4yABHvvMHmgE1aF43MPDlIQB0RY9ql5prIq8rlp
AjgAOSy5RVgVk2DvFYyOxLnqizNQHuE0wTMxcDJPDxAPQjg9hKMzXJea5OQhUpcgMBIEKwuv/2GBPAEu
jiL/CBDeI4sf1P/ACJlklpYkpI4UL/XsL/IASBCPW40if4k6ALEQyoP/bncdsMUdXYIC2SHMJWM0uvub
tlvA/+aIw06wD8OxConIB2VZlm0JAgsGBwRQcVmWAwUNCMMnKFZgH5X7q4hgv8uNQBR3GQQ9taVJ+lQJ
AQ2MPiRX//9ZboAvwMPKdtrehiIhuSSAnwM8RkGSCNdUJDgrFsYhAWgfr4I4QQObAhwEbFeKB6AXXtMO
X7sAM78EpdiTvA5OAsr9JRu+FqRO4hO+dpRAJ5CCZ0VvoA2S/TYU/SjoODka+zCIm+0YsfubI2REizBA
dGwpaSIacLgtIlT1jMmtXAEzxc86siXRYjqyC6Nq7Ej/w1YIXRaB6qsnhkKcXe1M4NyeqaBOXPrM6iZQ
ynQATyZaAnayEeUKI3V6H1AnEKr21ZNApKCDs/0UqmMjwUjj/UvGS+8gIEPY6zE+lmZtEhwS6HSxDNuz
jrBIH/mbC9QY97sIhqIbJPn8ScHmILg3oNzYa2xZTIUCcgNTvBSfOP8XGuwwm9kOOB07BTXQTZSIgiMG
628HqR76VP1GhUq2fZJ3zVV9sMWddyUFdUl2v4VQ6WFznkPrK6AHOfZ+ed+S6OuEuxHgxVGVhcMbMdtV
S+V4SjZPbMSIIkgBLsSzAhde6EjHBwv6Ij4AiE1EJIovg6pAhS6KIhkBJKPxdsOC2DSjnboRhTsjgIdo
bWhxB0QOOaQYBv9ogDCsaEAHIYJJtwl6bOmJTFtrCt7fPa0ws3QX0KpK0Qy0kBauV8gbuQAaskCXrHdD
XzJF+mh0b/8VV4FBxe7rZyIGAAFYgxDgwYk3nYN8sW7Ql2hmDgYICq5V/2ZYlTCIhySoXxFpkEVzs4Wk
GEhqUOoHbVFn4uDIiSFBkZDDr+eEeDX47k4IiIIAhtgZDwRbCSxPSvCrqjGKO6W00gGYKjgHzLCjdrC1
TgU5ZDP+948Q8NC5Db4O4otWGKJgRQ9+DexRVMOw/7AOFDOih2KJjFfsQSKCh4SUJMgXycEYFjxQPYgP
3qJqmwF1BozQUFWC6zHmf0KkgGP+WP+4aUbkevSLPeWiGYbyZEH0Fcku8M2OIoJSEnjDkQy86jCgKWUA
xBAkYkCi9RgdaNKMBwXNdxsbrgHnKIJc7mUGY1esgEx7vgePetHY7hZSdBIGDgBknYMrWzCor9G+wOpV
bCv2i5xyXbzkPPCdQRRwBGAgtoGHDRW3dLBdYLPAE50bIsoXnndg+KDKEB2XFEWQooNwJLFBna+boxY8
CSBFdaDC0KDObhl4IUmvVxilhaa20x3QCg2pvwQ4gbqkEAgA8IihotiRxTgBI33wxs53cAjWgBLe2rZF
cADPXA/0xyz74ALCC/7sxiJrE07nhhXKVlTBuryG9EWHATsBPNDpe53xw826a1eMvcZIx4cEoobAIcgC
66toZ668SEwVDgG6Y1NQD2zYGIgBDlatqtrAChumDYV3AAc4B5XA2n7CLE4v8tPsiyIAtoRdEASF/+8E
mh8sLEZfyZyqFRJEv6Id0Mif4In/ATolKQajrbm+CsHiKg3982EJBxbPBJ4COAqSBFAYTUaLwTF4RyCF
zJjuhI2FVGCYDS8nxCo+sBP+TUGLLhIf3Dq6JjReED0djDgs4DBtWfNcUlBPIGbrCLqXKGcISzXTwEWL
CFQLTQQm1RAJCsB5SNQQOflmTyggVLiiaiFQ7lF0KGpTMvuRpKiOEonn2liQovprAX7ZDfBeCHdUhNt0
JGgLZDCqdy0NoNwBDhxxQrWPAQPl/ySL7DFCH81IxTBqdDOqHdUVSEwLXNBCUIwYjUH90YAn2AEFRoSj
Gou2e2wLVbEetTxgVXQRrIA22Cn3N1SjKgBqCCWo30xMsQ+jzXIigYP9bkD+SItvAdlJAw0gfrLYIXPe
TTnUuG1BbVQizCMLI1SPAN/Bcze3AQJUQ9QGTTgJqN3FEjV+aByG/nTcgD0FtEzvsPtaZwBq+HKp61B5
kFc63dgI1RD/xgyI1x7iu+9gfwaZVDFMCHTSTAMDFqSGZoskqIKqO6M2L0xf6TVA+jnkhOdEVBLrEBKq
v7DfAchEicvvGEyI6CA1N1xBICgy6doLWqjywkZdd6BaNRS6ggqhhxMq8sJ/BGpIQWxbuQKvKcGqXAG5
D61BNUNVOrIIqJYUPaPmpapJUF+ywXQ8RKRBDRUdspveYwX0PQY2HDiZ60mKOooydcGhHqoboMbX/uso
p8G7S1DLNabnDBgPMeIBIajJ0s6J9bYTEJGvLLU0VB3DqIgquYzqh2SISAQMuYxkjMoNEIy5VTLaYdlg
E2l2xAgI4WlmTY1i3FAVQ9ZMid8+WBh/qNYlSAHHBcr9wEbgQCRz2zHJIxGxkSyvZylgYHQ0MiNwK2dV
2ziJnUMXHGhELdULzNbrp0yQo6mE0YtIS+g+S66DYADWrRjJhGpH1AV8eYmcvfXUUI26xyyAG7ZznaMQ
4S8CJiwMEnQhk2cGSIADAMAjWEDoADNilkCollWQDH4FSFBnCDc6SC2vUEAOLIA/YwQBq6I8X2rhtstD
g0IIA0oQeg8MXKBYlsnTz0RVVDpXCgxLMQchOmIIj27wdscKIN01ahnq6IPQrXo18Ys7q3sRC8EjFSyH
0ug4hgT4dl3D79g4NKAyRSJgauscEJ0OSFTydHtAUNluCelFLFbxU6sBCw3RCLyNfWTJFoA+LxoWtKQk
6P6gDiJg0EksB7IBQ47qDUUvdAJlcs7QnVABsaAHxlQGyNcxiQYMRxchqbRFUDewB4iiAYB6jACn0dYN
991WtV8BCbICsQazpqYFbMGIUAd6rHxUih7H4C/YSfH7GM31gPkGogjhP+AkgrZIT1evH1TNKMZeECEV
cKqMOgMgwA3rKYR7Oe0cBVwUKTqT4grrqh5YFP+LrE4R2yy+cPjDGWIMqoRBAUHVo8IEc97rzoLBYkns
H3+HuC220S97KAcPKQfuua11UQwL9CoLuXCznwz2CCxMiWSJQYnPiGYA4O57zsZJNx8PKEtSAbNcDX6b
fQCAeYhleTG7dLYMiGiI5AuIZ9CO2GCqtGM4FQxjEU7qACm0rxQPwSpgsBBeECaAA2gCS/CpgGMB610w
nhI21FBKTVhFANTEQ0dR7gWDCq7qZ0sd+Qm4QbEC62bxiwhQTHRV2xGsedjufG4oaB0ICEUvZFa8AecC
grke/zukH3bsWQ6Nqjn3EpzpRqR7MCHvAixgstjmuRhYdWEoUAZcKiU7NF+C58u3BLSv+n8rSJRABDhG
tnVwoH24IBS+fml8G2YqIN9XPBuBseE96zz5BnUziwbjRdWPuCgo/HHyMouAAXBTidlBjaUYRc5n9HAR
iY9JZ4DgPaSnQ5rxmtICkBVdLyAcmADlFI9b91nEoryP3AvLTB9MqCDITN2oNmgVV7Tq6ASqOxoBEXhf
/5ewl025PnRKLU0PSBW0LAIYswGypuJZOBKEZLwbdxAK+r79/wSm6R/UrliD/QZ98NIVF3J1Ruczt9gB
QR5eSHc5rDuPBhlkkA9wgACALR5B1hT/A+t7Ky0GdDA4DwALa9izKCAPKDAAuU98UepMA0CItnr6aiRj
NyFnMT3+AEOKzkSITCT/sOtiK20DSbkLD0o82+gJj7oNxE1yDcHEQJNVROJ7Aw+SBgakglsdCmnhAiDI
YSJii9nxZVQoqhGy4AkEv0WGjS2j0gFPRnWjGr733iZUdahi76BqEdHC+a/eOgIaUx1VAVEvdecU3aUg
/oDCT/JYBHBXXwHevyuoHhq2iIJvqsVVsNB2r1egEZEXpRUNJbtVtwAuD00I+7HpFr0dScl0Kw6RZn/2
CEQNYMHrFDEBvCQC7wH3EZb4TCxloJf9TZXhF+FJKf5QKgz8mXSErlqKxQseEZ/owMNSOf+daCtIEG2n
RQtgViGjiKUB/48OmuGuwGAMhMky5g4RYIKNXE5Jsodj0NcYvCW4JfsBvn1FtfALdylFAuHJh64tRrVr
D4aBzeBQd/fYFBxg6UCKJw+2wJEMukDRiFAJsQHgP/co6ntJQKJAd1SXDDJhSoDL2alGIyF6ywexi8N2
PCBH1xG+EFwFKGH07KC/dwpywLMxL3XQNXPEIlgDBi0i2QjaGq/IkY9UMdDwgU8jLWq3G3S1au5E9IrY
H//mYQ/BmmsAXI9MWQ59RHGqYfCoQWA/qJpNvTK5ScDmC8gIRkrBBNgtIWFPCPQOcva7A/sJn2OoEQ7Y
uQYAACoswLEEVItSrHKuIBxU5eUibFZAuy1jvwNkArp06zb+i9BiEbtJNHEBbjHdoKIUsizrGhDDMIUb
AjlPUVSMgKGzAQA2uggvS6ouAWBXwIeQSj0B4raqugqGidzxLKWkIi8lS+wSLVT0L8j/dV0sVlR7KepI
VP9VcDE2GpirlNJGawETIFWgLGEQ9X0p+XUZylePZgDALxh0caC7WxQcFvXOAWrVdPC4kKQKcoX2RG5i
HG7V2QOcksbhIr2rABk051PCQCDyLx1zBcs69XQ00nUIw63rfz50FutcgPIa0h0UUgwqw46IlXVIYFdF
Y7tDKcezu+Cqi1GKv9SlDTfowIuP1TbnTNOHgUdyl9GC0jDS1yTP5c8YTDIgeEGAGcxohMG/V9GbEA87
GPENGowAePiojNAAABEEL2Dn3VgAicAL08YBACxOAIDIZozAHwwaFjRYBWrm/woGwYD/DokKg/iJ4QWZ
dLwwiCTFwL8MPggUq4nDidinmMQQpsP2MCPCgAnaiTi9UIo4+CVg30yJtHxeAn6rxvFtIwgogREgBb8o
zt/wFnYIhAJ4UqLHwLXAsCli0p8UAb5QPC5c/y1BggMBhgcEKF4/ssFBFvBwjLp0Oc7ZFKGDE7zAzpry
uQUXmrhRAhgTKjJ0WxItRD8SdXEuKWnAf2v1TTnLQVU7LnVfQYpAEHwwdrAUPLrBPGVF0YD66mDIGLjQ
iknPQNF3qzcy0TsCTvhjZXUe6yG5A47Qf1C11B4Xw68DPS7QAxaKLhwFmHAB4hAXV4lfnQSiC2J3GMIR
R6pHiB1iTzDZiUdAGEIQkZivQbywov+Af/9C1Oivv574ilcQjUr7FmBsBygPhxGLP3BaEYaijBeCW+za
vgYPx3TnthBKbW4xkZwmsmMU5QMdBZWnLXgQCMGlQscuxXNTq6WC3ytzEELrJY1Bm65QXEB4ATn4KeSv
c0kxCCAh68zAEAGbAnKt1Vho5Cj0RQqVrUbx7tJ8OQEiufOwQC6gikD9+j8WIL58FkWIwW8ISVnDkQBv
37ABEwIIMcBZzwsfA6IZ/opGOap1Cp7VC4zHBgXRF79HW6EaZI2IBG4TvH23ey1WsQHuPV8Giks6gPkt
GOvQRd0ZVZ9DPHRA/LES/hd0ujjId7ZAkyBywukHLSJaKs1Pjbk+QPhlFnsICIYEFwpQ0zoEj+2Ip1rj
snIQBMZuCxO0TAEHbauGQPwe8BbvZpCYMBfRteWCiLIgQuwJ0IogWGlJok9FbgVOBCQagtykUg1dMMeR
TgAPcxAp+darDaLtGRWdO48IfAtZfA8VXPnaP5F7d8+4AoB7Ihef7RA8Az4tQYwdbDw1PAYbuPZkm3j5
2oTATRjTukj73OwjXpbbPQ1kHWsaSrAVJ9bwcn70NGxBw83+/zgJCK6wx5JMYOsqKwIg3lJI+wvqwCdu
ROajwq+1LIgM2btUc//lKh+iRqOIgePDbJD4G+UYnLj7lCV47IZGA9Pp/+GMg8AEAA3FRk7BKQLIJxAZ
DLVRNU3btHHjiU4IXX4Qj0adQxEDVLsbcEshbEYZBE4ppnqjoqKfRjjrrAgAB4EIyhkO3iSi18DAgUNH
xbqFVNSHxQMAClURQGZ85uGj5SjtKF8IjlFQ9xgEVurrmIv90JCFVBc86dcSE55vFr4VZslkQIOpmnpv
vWTvZ8+C1KQooz7rTCVKVTVYNFEl0Qp7YGOSCFDrUU2wIZDkAt1SRMBAjgKQcBCSHjN0Mi8zWErSAsCt
mC6WAAHNAm4ogGIYPIDOcYoqUSyfhScgWrgCFJ+ULQuI2L8fOYASyCCDhZ09QQIoHi4/RQpGMjCrxcIg
gkOYErmFALJfwaKGEMTYYslDwCxfj6CxIjjPEF8QyJEQ8IM9tnOSgBuBieetANbaX3OODAkBkoCHABtg
kkugkFNXyUjRO1A1C+kUHQJ0yCUAsSo41vMMCnQqOjshoEXEl0kOhQCeasYRFqnIbCNE7t+GqUWdpQRV
zJBdc4MIT/JMi1fkP0s0uAFiB8byjSIUyYJQHk/iMYgJYkFScyJUwcoCQxEdgITvgW5b9S4CPc0sz3sL
NckBSkZlXj9HiAdqcvUEjh5ZbiNqVF7zNikSKxmSnx9HfFqqhmdxgtvvHv24F24BrcDwFrE9WzvCbE0Q
o8MfcK7hRQLHCNMVkRE7fpM7SB0T4hyYG8RmZzByJE4WiYNVwQtfxwAIqUAXdsC6CDkBy/1yoX1sZBuS
cSzL7dMpmt9KhlPLxHDtdnKQQe+PcsUfG6wKzKS+yKmH7JLbj3FybWXtcDJkRwhbQynDR8L5Vo80W/+q
DnKScRRww2+XcBHFetsHCHVtKhqCbHhotv/ECmpRij5mb1QuiBb+4LkFFIJXrNu/7aZHBYjFD5F2gCRB
iKNX5PrFScHlA7PsVhE0xEaYO8RdBCDc9qjuZ0NwcL5tw1inI7oe3yQzBzhKAnALOHZv7aJIgQuVCMjN
3g2xFZHK3TCw2Ba4ZEZWPzIA1hQENl8x7T6CscvfclAe6xWCJftAUj1vlR+mjqUoL2MtS1k3+KZyx0ho
SMHhBMQkDsESLm4DfA4m+gGpiIVQ2xBAjgUwcmq6Ql4gH1zD//95ZIQgIS+IaM/FMaI67xAMHAayW1kc
aGhoUQAMohSIhdEdGswPCy9gQ4cLD7YqgSFB5WDhMH/2TPBhZrzcB3DvCHKAOkS10CRFPykwUTGA0Ast
duwCK4ntMQRPvIiOC/AvTY1n+PtNLzqhGQwBb9gbRXQTkSoQ/9DYdKMye+/wTZjh6wQUkgoPqaAWzk1N
fA4Cbvdq9f9LD0guAUQd8C1gdhB17FBoIpfeIP1Lo4TsbpBNPz4lcDAgrGPfbi7pgbxfbSFQjbU+rWTI
KTWNpmykOclDIc9xbhcODIpwhmwwDyo7WTfFE5g9SG7yH1x0pSGHpEDAbL0yJN1ZuDIlGpo85GBdRrQP
bCHPAtpzk9rCEmqxh+hWgiPra3Ppew+QAxn2c7dlwIdCTiGCYZFlGQ9JAegFlmXRipTVEJD/WACbPqFv
+X4gb4geoYCSCMAB1DPokACxnik/FS+qGPZEGfQIHB9V6wFP2KDcSFMpHUYQhxTJGO5dcIhiBRoBY0Qc
iuhqr0WwjN9KMwLiicrrOgC13YAyZKSJ2gTAawyiCR+rRKxmqAVxidN6gAUe9MHa8h+RPUG4XL0exY4o
NwikjFpQbaEFzivWSMR321zpAtRIBf5+vy5qirV82vmoKE5tpKBuNGkBfCdwKwxU/NKyBUGNQsPEO35v
hCmD+lxkJFkEJCdQDwYVn/10TS2IBlKDBASxRQDn4AcV2/cfQx5DHXV7CuqLqt7pdk1BTV5+Onh0S+DZ
BAhUOus+onjYLoKJ/UJ3vWVNVNyb6xQ2+Tlk2xbFc7EMCsKhi0Xx7nY2kyM3MdKRKYZBcTvCAtJBUsW7
zOXeD9OHMOozjkGbQb1aDQKjAb3tMjezKrkXKMKOWnoSu6JMO4RtI+TWENBH1gJohTZh10pYTBgQglqI
5tNNFUWjXXIlLp3kW4CVhgbaXQN3my2ZXVqK4elU7N3ahM9aLrhuqZGAoPu9NSkzifc2jhYbe1Y/NkG+
Jb8FlyCHpEs8cuyhqISMHHJyVw2Ri+i12nMPg4rtJhEq0Irgp0IB2AUGDSuTxLpEVKByVkQ4ggYVLXiN
VLwDNhP4BylxSD0uirZJYQtige+KoKPek41NwwFFOMDD2PAUCXXtuSdg73cPEOSWHI/R11pBxUI0safm
yncpCPeA6mU8HaoGtBBVx3qmMgF4ujeoaOSA8Q+Imuxrh4agFNp2CiGRWkQved4Bhsmg4o17f3/B5pl9
Y7y3/jd5zOktJALKBWUPZMxd5/upqeBlkANyPqYAU2QbGRRP7xXk5GEB55SpoGRCjpwoqrmrGpIBO3Z4
MON0Kd/muQsTDtDHOnRqdpCo2Gg1/IJ7OZADOYKCgrlkQC7QgoK9hoiZZCuHZBdGAOMu9PFrrIGckp/k
21/oWNP2sgTP85lQLjyxA4LRChCsPYS2t0JBC83/5zF98Ffxx3brXwl1tQPrVTFScOxCCHadAHDX0zjo
FlH7D41PMDJvwFd04ZYp/rRCwSfrAepBbF/fSAzZN4Znx4L6QvFbifI1FJs92yK3VnsCFBIlJH7N96oJ
3EGvMehg8Xcg8Cj9lgwIeBUn5wAMq+AYE1gCSzYO7gTeouiPCPpyXyIEwVtIQhSFuQE0qWBkC2UEPSBR
TlQkKCtCAZyvw/COwBAGPyhc60CoREgYfKBe2yJxZb8MuqBLufiJwesCnBLiBvyJyIG+pgpqSBStq6qB
fQ4lAQ6KCH7BA2OzhjtZJEGREDEfgEvFgHiItgf1GFUkh2MBKm9EMSFVZUCJF/jiiYheq4t3BKyKF1uA
h1xdSPThbXgr/PhIWQOIFUEoKlnBLIo2SUNNDfwhihANFpddIgCURdElSgMVmkQlYNrOINrNCoimK/AO
gAudhzDyY1MBUKJwDz0JVTXUnk4YuTm7C/XjFp3NFJbu/+IbNpUAOEI0EKsri2kO2GfKLBEQ7bYSkQ3Z
AfOUMrkhPjMg35sQDXwLhuma6mtbHBUAfA1CQ8ma5wtuHxuf8x047Py1DVKXDRepPhPVRHANDEbTPM8W
DaYJKI7JnkHACtcFa0XVhHq6DA1PDiCyIoJFooFyQE54BfbMnBg6WlxyJAcBEAEVBeOQidgnVSWjmI+8
WVAUapgKeEARkIDEwJCKYbQ1H4DgAQNuDylVvNsYSnQEuoBCYAcPuEPXYGeELO4juh2CixLcYcMOI4oP
AS0IwDDDJQMIDhHXoj6KGC2bEHsCR8SCC46sUoCmHIX6pRX0EC0J91m8YaBqQmkS28g1FNtgKwQmLmIZ
RXdeCAMQuJojPQvaILVyCFsSSNCyINrR2CWDWlEzwbQAiPwA77RagBUNLJCvsqgEMhCPimFUMR+higOh
12afbIi4KiG9rQEIVghVnwxYCQvtb1jPgllEJZUusOCKcFCGejOgmFEo5oDOqIAIxxhXUpWM9i/JUhWE
glnWLwQGgxreIF3BCDjWjIt7ZdGrA597FcHwFdGHRC0GEJlNizYCRawoLPMfiGBuso1DIlRsjBTP+Hle
HRsXMIWBGVF6KAAsvQZfjwBYWMiCAy0O//we1S3vdwhK/i+sjKpmAbK3HAgKFv58e7rINgMMJP9YqOf9
DjNRA2z+GGiAHELCXoqRKnd9T2VYFsEpK+9IuHEQkqoKLyo4GAGRiy9oNCyYdd1ld8Euh74VVMAdO00B
/LxsxB3UMPoGTDnh1OGILQA4O9ptHCSID9k60ZNdtu4hQZJ76THrTV19AXwGNCNGJAKSICaXIFp7QQzy
vNVdcGc5G0I+q89dpS9AxLbWDjccdTNlx1DbQgGXPA9FIBYAW4DjakgQ/4NCWlwiADHAfgOMgAGvVQ1E
GwUQSS9upagmHWdhSTsIXAQXOXV55qg54QfEATPfL/Hxk+LGE2QydqJlADlRNyLWMryXBFtcQBu2JUI4
ZRoz5l0VCAbtkVUIfwkFdWUmy4DjP4DLikaFgIDOAimKBofWi3cFPatvADdxg3MqyZYMCMjYOhIKepYG
AzO8ZEsGZNjYNDNc98oHlfAIcSZc9i26+eRzIwH3D4L2+TBy9tH5Jlby//glRNwmivJoW/wIY/+2NKW6
9UmLXcOxIQDCpzgzNBrMWh6wH3GwUTN8malaTiAJRQVowYqT8VIvdVvph52qakWESuaGsN0Yo2Ye6207
OWAUqUv1Nr4Q8oy1DTsqcYUGI+z9WneQuyoKPG4DdQhGuQxhb6YyBwHrU0e1NR1WikB/dL1d7oiI0D99
kVkB+EnGqaAx8vth94NxoSKEZVn0EIogSQFpw6hikKAB9KpWBhS8BiCPwg/zU3kiIwDf1lgiko/kITNU
Iv9TIgDesSHEphXdBiUFgCPf37GQAggcFfBhVY8ElAHoA4ghQEqI4ITqpLEYLyG478KBQN6NXsWNby+C
VxE2+1uk6Al1aoyJHY9DxcBilBiarqQqXopRwSEj+UhOENqlARqQB1arDKzDRJKqaNkgwYwMCoLvX8IG
2hgiBwL5eBAAiyBgA3BrOg9GcYMibCQImTcpQZ+CGN32Rp0ZEpUBOABi96ZsoTcnicMGODwGG9hLzsKn
tj6LtyJHVXWTEEbhSFZB2ogCFH8Tw4tOVEGKVlg0CnqzGwRWMF5AiYRJBR2w34iUYKmgjQLcImAUG0Yp
iLCTfCQVY5OiAcOBm0QBhc1BA+BFWukCFgAcBF5sNswRXEUTiT8YJgvfSXiJ2CV15eKoIihBKGAICaTY
DAbhJaQBwMIsipXwIuHrsA4Ptg/CWEpO4EiA7gvYEkYImUwPsEH1EHl+od1HckBYomHnF9xJo5QSClis
IF8lEA8BOWmgbSUP8ZIBLHLkgwCBD2uiAfkq+SIZkgEipQFhRLUAz4gPl4diVsIQxjq9COizFasLIDsM
SRRbyI8SfOKREdVff5EBAJDP2kbIRwmRAaeO3JYwos8Qo9cnCoyoz1igdgsDkAGjc9A6okZUmwqlkAHP
IBXyVQ6jAQmiRPHcPK8AXAQfKBVtg1yEFPS380cgxkcoAh0JBAhY/8iXUQWPplEi8hTyAX5RImFRInmM
AkiPGKcBipHFAn8gULWM/+CMipH+AT3dizeoCj76DyBtiR+LF2eOASKjYmCP/4qWQoaNr1S8LYz/ELKL
DwEyEWD/nY+KbmGlk789/wGQCZCMnw3FJNCLBzJIWT9EQCB2Zj8MbxcKVGpxA21QxogpYCBQNzi2C0YP
BooNO0DQGBxAmgONgBC8pOfIJgVqGLQ7wgaQD6oxohhAngHkDJUJsO8IGweVbDEKGA3IZwZdE8tW3hF2
hCxHkDoYCAfsgUZsFdGIPPawATvrVhUZvOtAFQzYZAMMQSoVAWoOyPMFFEyjDRQMkghEwcCCOAhPUsFQ
Uq9VLjoSxBgS4kH+7aAbJIRCPW+AdRC7kOaAiLiiBhB/6kEiqBHENW6XitVDuygFx4CNE4KGFRvWugTW
yMixLrpsKXKivc1VQL4kBRxTaKGfq4qMikPqibOGRNAv4UO98IoFrAKvGkMwegElNb6Y1K+YC1hgQ7n6
BP6/DrWMDu+h9C2Ofajpvygp/K+WkKxHKugbAf4glQToqARJ+aAvBCdd94KvNgMxgZpoIWsjTBLnL1oK
Uw6/QknvzVhDLKggoTOGuvasUbMHLuP0eAnzk21E7FgI8tDG9dOUwEpByvNBDdgL8jXKl/PP9GUHaCG/
8+CVAaEIJRSBBygkFLRGInxxK5ehyU2eXhAMBRSCHYgF6iGgpRVNXitAsHYDexEALZwSA3kgvxqY4WBA
qOKLBk6eAF3gEr3FXm4QHNYES+c9epcY0IoC1APVEF4BbWAtChUtEGyOqIYneQujeIt4xQdKIgAbBHAE
NU7/IHhQpMJrKC7xYWBdTfAHMkYRuJs9HXgMvCdQU3wBRNLYLGIWU/KwiElbRdmJh7sq3gU9Orc7SwiL
CDlJxET8QUXDScT2/g+Rwg+AIcfVPjsAfKgKdF+QcA+wozg/8BUD1MXdhidFS0WH30XKwZuAVOGeTCUd
+O3bfcQYbGcVMcAptE+s+MG+KweSDkk5xXZmgCF+RYRWI0nZ+AjIBV7v7bLicVbhbIkQtIM1YbrwtAdq
LnRAsBuEYYnoF+sRRGwP+23VR710QwcrymUigmNZK0nEVqhJWw1aitg9t9LIS1I9sAE0GMRCAOqLIQwi
Virs4pBU0GaQbxxIUkEPA/9IIm/IQ8gTQUgiJkgiDzUhFu+zyFA3FHTcTMPHQyjRsA2asj9HVVALEcJL
AEPsFcAPMyhcyUciAF8VTWDvzAD/Coi7b1MuSYt9smdHIvaBZMhnLO1kSIkgFZdqaa5FS3Uw+98iqo2B
3nUGTTllKHYQCmhzELBycXBMLmKh2qA0WD4wD7GTAvEAFv9IdhyM7SbzQQ8HcUjCBEfnlpyhABNQu7qg
RDIomwrVQTSqqE9PUhyM+jaJw/9IWcwAsYj2OEnHWyH2KOBQT5caYAXU/tpIKfNJA0fSFdAtMhAc54rh
YAX00QzEd0VL7bYt2kae2AZNyMhIxdtWLErBFzADXwhJA0KwIG+nKRoXHltSiFjCQcYPAeksNkB4CTgY
2QDitrQk1JtC1HxQuJMRcoR3PAtQYwMFgeGi9LZBiQJUFd7x+7pC3xyLHglnRxZfK8JEOfubAT9bhCd1
Qz8qogiD+bGDEOEJdRNyY3UjH92KWE0RIN3dCcgPM4i3QhdFUH1998IIgBCbJSqXQQUBiLgMrICeIbZB
NSSiglC/S/2dVHyNHZdI/A47iwWvsWIU8Q+FPf0B7ijFSuoYukUAAbHPKmi3Ss+bSwqsCUQEiE4CDEsO
+SW/CXleQSIEKOBDSkATxR9vt4cDcKIJ/xy25nXUVjwHEgsZiYCdAbUHM+unOGKAVdAwovYaEENHt40I
gvAMqIEVRAzcNtsqcUkZCEhOOwGEo4BkgwMw3accFItzi4lUN2CdeyuLIA8jtAJ2Bn8biym9KL5V8SgF
gHQpRJQzRd6PivE2mOTOuPVRELCxYUbpZvc44/Ld4EnORTp2FEU+f7vQum9AEyhpKw4rTUQRaFmaZ0gg
I0lMCE/ogCQifX5VdJiATjiUQqJJo4U7Ehtv/aA9zgY+BbwGp6KsOFvGDgEAq7MaDYYA8XYM9pkBqdAp
rIIrAAQMepFVnL9QkxwYQCMf/OAOOQl2pULbCdsL1AJdIEQCdB8FOQD0QKAAREwcFBPYnv5BPB49n2jQ
3EgCojgIdYmgQhCf1mxbGgLQ7QCBYwBaAtD+i52cyDtTQko2Z74wKr51mOufkL+LbhDgRHSQdE2miYZR
YaKfxIyKBiAlHqpSu6IXI0tOVm/vC8QHxkMZqEMYPAIgqOpEwE6Vu1rwA2VbT06vPCXYPQPoIwB5TVhB
Ta5CUMuIr7jXUlXgAf6tDeqEwGA9Y9a/381AhBQbol5dJCWD3cHvm7aliiC3FB9FiIs4AtBbVXZ0orGz
b4AriI9pweIg8f42EDaB5i9JCdZ4jsALBSQ7RYRvTE5GHIEF8/zyTrkHv4/shYUPD4XPSTnvuExsUNti
0esdP9zESU92qUw4FAH3HkG0A0sEnFEKTvNrAGLsEqQp/fDOe7BImDs8GjtJAbq0xyeo/uFXP8AsrKDP
PUVjQQdoA6O7k/SbP39O6PSKBW0At1TxqEHWtFELY9I9gKMMNCoxYINQtWA6vYpNDxBYIL0icejADoxn
OyRJqh2BKft0BTeaph1spkUILxAOnREUUt1MF0NFEbEHtAK/sjcIeE1wYcHuCA4H8I9F+USIJ0SJdwG7
l273BU0wiEcHIiBmEgVvCKIKSRXSAvEhWBiOpiE0GSAdoxK0OSyux56SoNA9ZJY4ADyiZUQ1HKATFocE
LQ8frxh5JQeQP+M+S1yqEsgDGT+hDwLGac//9XItqgQRvQNtBICpi5lrHA/dyCDk7oALAypQAZEDgjTa
ExGuuuZ2TSnQNhQFYCnBaYRQSsLER6n1NVHxtYkLjTkjD0b4fQDRp+hZoFCORvE9WwNig1PAUNUwIZde
lAywePVgdGLpQOJJfFEH0tdNpE9ApNfmfD1QkPiOGDleweogicHaE0SL4vCg9M2iXtQITYWgaWzbZVD4
jG0I03UpAQB2Jc9EixBkAE4EMCUBqtONpnQQdy73RAFbAvLlwZuAb0SOVUd+COtqgQDEqggWIqIpN55Q
UW/urIpDK2WHlRiIA9BtQW0DXWEOg4MFMDgycLgcT6iC72UVRxCgYEL1ZIDHeBlBnHHXizivMQsrWBhx
cLIiCFJsjyiIUpA2KDhA5IOtAtocR9hVGwIQ0xsxIF7Xkh4BxGIgYsNJQW81K1X5E0QLq1/psLAWLCo9
MBMPh+3PL0kbtU3sCoKtYxBBOjBKLLoIHMn4TgEgI3xHqkpSjCEo8VYDQbiFLGpELQbaECEAjBTqOmF0
oUnoU8Ip2KXRwq6IOWgBLv41+6MBY31WH0xiE5iqwJ7gj1uSquABT+M+vC0R1VFeIR0HkIJjABERADJK
FfDawAjyonAVGwmIHT5kFfxN9Dd662nfgH6J2kxBFIsJi1IDKgxEObOTvVUArvK7i3QkggzR8BJAZENS
W5hg6zuLD0OMTFZsWAXxBIlGAZ90oI6FBWovFCK6kIRNTihARhVLEZIOklNSSogokiyeJkQ0jIpNjCYF
BCAPxdCEh6CZ+RCwi9HsMXo3ZVTpInbDkuKMU1Ltoo+IrnV0EBg+noQjKTVS/hYoFvYQgW/JERcMkLAC
Tw4ICSMY39gB/2CMHYBlf3sEwcGMbSXzB52OR4g+s/kbJLCXjRQCxlhdt9956VVDej8Q6VTLSInHpXk2
vGNcSIttSVTjMIURUQDQselc6+toiYyDdXInRaksUnw2KhjJTld7WUvY+wV5MutySANBm5aEgIIQjotE
B6Ni+zJ0QhA7Ak0kKVNWRihwMoJCUIZRm0Cf+ARBxgB5VeoxRyxY5hTcFEmtSUFDbkWgS5w6VmSadg+J
7IA8pEP4iOA3K8RDKrpTVsJpm1jYhH+7JHwNiAQNpKAvRwU1TSHnSClIFYMIIEczRezcgfGsdVqdLKaI
JIPWEItJAZOoXD9mlMQReLKGJIoslgUlIaLISChKJYM/KhMP4mifJngG0A0cYxDHNyJxiqyISIpDqNji
VCzblQo6AM2h+6oNFUXgDQdBgMEoagRBtVCKF0CcICroMoI3zjXbM98weZAnKeUBV/oBWDgp6CQ8Djas
WM3lHZCHHP2G64biNVKQK5Yr/uUSzg6oI9Nn/wU9XNgmGP8tktBwIOcw2zP/GCQFzQ3nH+l0CvGq7lin
6yB1dUlB92RfYKkGhJEhey67pLeqLnVNAetvDy9rgm3zuwCrBjt1VYIOINXrxs3rPdghJ7JX0DXFCgeg
ZrKMhBqOoBlEvVQYs1JQAqxhfyFoKQTtPH8OArwoEDXUBjXkoZKCfwFaKQo6jAoxegiHSn/cMzPSM8gp
QAp/TjAZAIRU/zMPkoImM38BWcijkIhsb3svkIeAEe/gO3Ikr8YxwL2+BgIeAvgV5jKXMYAbGRLvwJcl
JZMcQu/g0CCTTMnQwMABmZBXuTHIeGhgEL/0SAbQBCD98Wiqhwh1L2USKShWgiaRDk9UM3jiRQE8wsBC
kyJiL7Kb79CveV+sAwlhTqUJiMAA1WKic6g+QbgtaWK8AtU2EFcyxMICRqoF/SCWVSQrC2+oH3HCUV98
ruD8VrHwJAjo8BGx8NbYcYsiddc1X2y/cmIMIUNSwVDGbj8InPBMQ3EoLTouLBQBN0swVSswEhsnJFoX
ZNokWoIIWHAi37EEDi+0H8ZCVXsERUJfEN9BszCdlcOKRTjMKIBjMWFgsiykNwA1TSh1Xb8BYAEcqqE3
VCLGNhxxSOM58DaIvQRAAZeQ1Q+20oDFlkktxXWaTwgZwTXPOmGi4KUgUna1h0goXFTBKPE+wQDhxhy8
ozDgFxgV8XU8VyQIYBu0xnjVHvHgU8Cib+jPLmNBbAS3EnMaJimYUQS2Fv+WRXXrGht/XczrcMGgDhbv
ikR8sxGK212sSywksoURSFFjsQ1KMQ3VBHGwOt6sul0WzkcEIh/0GAwRcGTPLOskcVkqyVZ00nzdXimK
k4EqEmWnWxWphCRZuAMkINgAgId8wRAJqqbeiRwBJj2ONmMgiwP7SwpuqmCouj0BqQXVh0g9VOsTsSlI
hz/oQTeLaAmGEdVsCNcRUHxr6mLETEqxAYZI1iMUfNxgQYdBKK1XxSRdKmLwsVS06YRhpAJhQeOJgpHP
3XvRSkYTslktHyyNUkEyFIRaEzLC7sl0L0hjCueQMZ6NELLAKgUKXtosLRuMADPWlBZiROEgFpGp6QbE
RvAMeAjHAC+gEm9ypDYspziTeoBvrScYWFFwMNdzpJYIkYFbHijZgUBANnSfGSA4kOaUJxeEDOonjMON
BWFnAUdcEsTbC30nInQBDmogAfY2AgiWkAhDBGNQz4mw13VoCFhA0JQoomFQnYjBtbssIPioCf//Hhlz
ihgQEYEHwbquP+AHAws1W7IKYmJwrRD4ABHsYBgAASRVsREKBRu8P9AcO1lJ8IL/BCkqF6HghBkAg8cZ
AEdOyC8IeuAfj+AWBoxNhhXOJqLHkhUhM4PDMGFo4gOPXH2VMdkHEvVyaYoDZgHdEBCkYk0EwZPwt9Yt
jCTY4EA4JNOsH4gDABEJIX+KZFGduVA+EE5iISco7zACCgJIQK81Bi3cxwf2OcY9ZewZ9VYXHUwtwksq
CNHE+xkiix3zGGo1CSKGEJQQIEhEDSI/dAWc7LBPSgAgAM0icmdA2YmdB8Qut19ERgYrQPDFL+Hq9UPZ
HQl3WOs+4nUPBs/n/9MnHG5nt4RbZwMnge4JykMFdIei7+wyCojYjmjmVWXKP8EjcYMubQH61ussfttL
SJ8TVe0zdRGKh2okv71FB366wAy/1yXXmokF0EFX1MUGL9eNmkg0IHgGBbuIQHXgZdlt3BX8oZ4aTQzB
5wRJ1SEoDniYAb+ougr325AsJLxgiwRdNayNRNSCFimbCaoNdNXFkgFmY6wFAnfG8CJvb49sgQmGuD9S
TNAbtRvVdFOaUE0p91MBjhoPKzfEtzB4dSPrPr8bTLc920G2dCUidB0Hb6NoqIMFeFW/fQXcjKBuRoWz
69GQBZWI8MJgQwoB9YbEFgxBZXPpCgJIWEH4SM8ZjnToFR8cAhXHTut2GcMcToVE1BREDyEVdYELrFhf
B80IDlRTPN9XUHRwjUMPOvDqGNB2C8spxBbk2SLnPoC1wYsO2xlFDufu9xTUQyLoSPRl4IJqYxhUH+Zg
n4IwodC7hYXMHVSRqv4Q3yUghayIIlhawaBachDYqk4IiiADMBi5ZDCPIGAoDdIjDKYpJ1kggBBU7Agw
HwWB6/SLBZBxRW5UPGpvqpP/0RTAM6pHkFAMsKqaRe/yQqg0QUHiaN6OABQDqF1FABWdDAhsAWkEl3Ab
fE2gs3VjCBFTBmx9XkDQWsNoesMdOMgkI2NyfUV92C5aMkV/XSBvLG4ngK4HMclghQCWHWj2TZ2UaBeL
DjOuaTD6GexuUHBVEDYYuXEuAIbFRQC7T1Q0RYZJQsrqQ4Shd/wdaUoGWdWsdGShOsADXA/9IGBVEFjV
u2gra/chBCUiAAahhFX+GcXNQcTBuGev3r8IjsSmZwKvVoygGcjYASQcs3McY5kjEzIYrhWGcUd3IDzo
ypySJiMiwRVYEULnbNQYRk60axgAEhYEjwBeGJH/E2rRvJCBjCwQdBPqIRgBKGpqEMBbDdNIAjHAAZDk
hf9+dVHAp4WBZHSOWRTwZMxYIiIsCBkAAxh5A+CsKo0Ig9A0IwVyOBMPMAA+BLJ0OpICVUdBcUD3O6ng
Ea0jSqQISI0QgOzGKQxJBQtDDGnFC6kPCIZxDDH2DokBBu9eVTwrwSuS4EJsx7G2CAqUsfvjtRw0gtWV
D75QqohBaFjqI3YQyXREl12iDCyj4T9wqgYn7vZoB6YMUdeSnwxZrCpjLYAMXoghQEBkJBSmAZ+OdIP9
VWx86Ww82MDYn5JsnIP9BJaMYqy03FVseDMIw+x7rsi+QCh2Z1T49x16ydWr6qmr6vzakQB2vG2Mmmys
ZjeoYKEsTYWJ+ZvajcCJwp3fH5z8h1CL2VlVskP5pEPuKFrCpjtrSDP67SLoe0vL/QUta5sFxTEKAnRh
/djBnTzv7VdPdVzHQzg9oyCSRP81FM32os+1EN/PPk2txUC+YBAfA0RbBGzTFGqNu6GKQnALPXsBZOFU
FAfrnXG9ABgaxCXAXRBQonWA3c5TUdwU5InNTfEo7LbuawzdB404BhNbJFqygEGAw1/nU1GN2ing3O8i
PQTD7hOk/+CPKNoHwF8Ji1M4WiEb2S1EEVtfW1QMi/D/UyhbVicKHI0DeWF+XkVxI6iJ9AhQVNuiE1BO
yEQBiJNF/kF0uwklAl25angP8cPhi4o9wx8EwIsQEboMBZwP7hs5kj2+1CO4gSge42AHi0lGebk368uH
bBYVB8cD1jjOEHwnZpCY1fmY9/fbdjOr5Dy6KXgOK4nQW11taO3sRACHSH1SpcZ5YoW3QTDTILQiigOp
Cj9Y41JRKbNEicpAFMFa+G8MSU0xmeJmoCpLg2yrTICKXZitQRwkeKKCwzhP6YliFwcASBdQCACAs4A7
UIsVtE1aCBi8CEZAmGcgKMx0rKBtCDCziVBMFYNVuVAGFW6MLdyQVR+v7CkWShA50TZYrxTukC4IzCgm
FmGwEo8lCH8bkQGDHCzhr4Di2a7QOUdDD5ezy/jWMQJCwsNmfxci8W7i1sJyAQNGJcIPkyUKRphAz43D
Z/xSwl8jsgAQAAA6zThwi1i5hoX2gdlh8G0tb+AI8Hz4CAjiNYsnTBALAeHJU4AR27REkzRmcTxnBRDv
BgpUCAQUbJ+4cxQH/maDDOi2t3svbcZ0NxIvD4cuF3wtti9Qn84Pt1QsZr/xhMXeBFYeOjZ1yUQwsFQD
7epwfREFi60KqkkXf8VJvAeF+AfHTOCD5/h04QAE5Iop+U10rE7JfIHBDMGN31vH6QMOQUnQhdK9cVxj
vcW3/4nx0+c5+nd0RRUcd4nrCdHT40UswM0L92P/yMBWEBcOduSQTVCh4BL9YUH3wwAudUd1FGzxUrxE
Cdks+r1tcEd7d3ZNnVX2QYM6rRqtqhyOrQuh3QZQPFrQDFJraK07bPomTyF8J+8CI0woj/pQxxgYHQNE
T5Av5Ba6gG3CBkG/Dh6+Ac3+CXRBB3R9cCYgtqmfkAyY9gi7n5lzw4uthcOUQInaX9sBiD/R6oXQdfqN
FERmIn5R8nDn5T/rXQvgAywFS1R1AEVrRb2htXqNoXV0yDH/bxUVls8HQ0qJ2epvAG062vZEKcnT4kmP
hn7fnXQrhcJmc7ytDLcavz1rZQ+J13H31yH4jb8bEIUo/2Ryrn0zuOU6LDf30kEhAhjMdgtAYUkYpEWW
sR+gaAJug/4QDWAwnvG8uAAOapAHc7A8Uh0cy8/AxEG8D4bfdxZlmA/aCaBCFOA7UrRlJAl0HxO4ok4A
/nmQugHEmLoIVWeTTainINBt4WvYlEbzYx2g7cKcPr6FBtDy0jvIa8Ctgi7uVHRj7szUiFcUfKUFJIPG
Y4iFJYiixhVJ33brIk9LNUUAKAF7hQNVRzVag7Co1NrsRqkq///iH2J2+3Ybm/j4AfsgyEsZi1jOBAHf
0HuQk1rGW2iHsI11Z7+zlN82NIgzQUUJ4Tn4c2beNr4b+LwBeknkfeiDPwCgDRXMWRH33waB26U3f08Y
TQB/ZvxFERdyFEcNyHMsEekTd3O8RwBQdOeiX8Mfl18BEXIfRwZeGonb8EPDSIMhATmoSDtDcwUbCI81
HA+2BLiW4IXwY7Bbq8OM95gNdfr52NvCe4wx9tp3OQSoTIkUY2Nh43L0ouwbgXHAvw+LsdsGkAEWhQ1x
PlMw/h3xwI1K/yHIAcKgclh49j8HbvbEEA+E5MFmDQkAhHsp64Hh/ziEDUuti5V7OzsPgl/3duPUlamN
SEfOAcYLYkAoRnSXjRBoMfuBKnQkCK12CptYqOcwK02JmMEBYANHZYuBYoNuabn6xA8vBwv1DhscY1MX
K2ADbXMILxKNrAOqgg8eApXMSdsBG0DNzjRIcFR1W1BAKBBBbGVhCEUfKmQ3AcG8yTHSJlgVxGKDH69R
GRifSMTBJUrwTAHAVSTWAfUFUepVHtVSFQYKjrAV0MErGDmUdAdEPHiQ26E4BiGCpEyQFn70FJ0EC4ER
0QMRRQEiwlqEfrhW+ggOeT2E1gdh9hcWSgtrwQj2QwEgGFuLouG/SLoRQgghhBBCQciiehQa2wUpXP1i
gA9EidPk4gXMBdWCwBo1FcJURE8NwQguvef2wwOPicGP2tKhihPieYNiiGJXKDIcdevErQaZcI3heBIA
SxBj9hgmd4pigVaCNikUwe3dm/oDsVGLE5Bzt3djwwSDwJgYA0I/nW/b3glEjWD9ierKAymE3bb2Z1h3
UIPoDJwp96MBw20UwZL/TUUBNdf9twMrUMHgCAnFD/8IyDd7W8AIZdAzZjnFyYeL2LsFAsWKOdAPh9oy
DWtVxB8PqDgBsR3tgFACatuG6mnrGAiCn9vHmtDbjoBdiICEbaiJwfo1iAjWH/pL1NGIIxF1pui3duLX
XXAV4MHtzQE+e/eVLJSCLQ0mm/C6peLh+x3BD1Qr0baBbuhG6UU0gBo2eOAfSe0FnQpBqcElLx+DIzsV
0T6qK+HqEAaxvbAfwLXB6g4U+Fhus43WAPo18s0c+R4qogDD58Y8WFXdlf4O6MdBCNVX+AmLeRDGQayV
+SUOi0VqlTtNDy2TfUsSlef6fdVuLipuq2b0+doMiCbagwo+FI3k5KRzEQ1hBmJ/6BzmCa4QUAh6aoPl
RDeCdj3qD1BAiGHmugZyUPFXGyQXEnIiZhEAg+LLdlhoZ8NXr1ADBsvJ2QiogxZZBgcsJycjd1YJCAWd
nIxrWgzkOueeo4ShFuOlCh2t/Tagt7TxGIUilaEO6AaEITCPFARzlamAxTHAAN4B3fv2Es21Yv2D5kqf
Cx66JDREWwUb+gJU58A65ycgqQwb98+BdZNcrg0b9FNuQOgmsw5Z6bNYguu+Dx5dJ/EiWckwJfwPhMrs
M12RlSgjHMIRXOYtNwwy1jn1vOEQwVJ0Qy1OPmC3XkiJ9RFK7G42YLNRF7MSdBOTQwQcdu4Ms19nFMQL
6hQkHS9obTt+fEwNBGW0TeKj0am8/ZhEE1E0FwoELCoQ0YB8mNUO6lpwAZrQMoCZtt14A+SNFe1t0+sU
WjDgZ1RAg6DRD4WwYbyGH0vtG9ENux7EIO6SNF62ArP+Cyu3NE5m98YAEDPhLdBgg/LmqUjv7YWguMzn
B69BKfwwuVtqie22/iaMBRB0ZKZg3a8Rrn9HCRI2uiOKG4bWAffhf2MP0ktdmQiqCznxj414CPboINWJ
zg8BxukNbRea1EaSlQHBsthdDYgZ4EZKehDBRbTI0hoT3RqbHC9V7QJUuinBYpt9wVqaxgM5zlqBBekx
FoqO/9hMg/4PegYiOEZ3CDeoXwoZxogOiE5FRgNaiJhtBgJbg3JEM+omxh1HdDEhMIRY2D5voNRIeIsD
PmCbclBUdX+NDEPhxAYU/8riNvtbFGXidYDlEHU5jeRCi6BDnLc+NxqkzMREcFpsJP0cULMI1qFwQYjA
N9FKVVWfxXer64MwHNqwbURHgcIvpgdUKFdWVTQ5tHAVYekIVVNwmwkoHL2mfNDANvd+dQAAgHt2CG9i
e1b/dpCB+gAB7YT8CwihsD+Jf37Oger+7wXcexSL9POrx+m27c6JyHLu8yXy5gWB2Qb7foGNTvbAhvQe
wORz+fIQNYLAJaJlOcKwEgDaAPL/vybeoFpWOK/Bg9cA4vcd7X9y9sIEVoTuxy5sOYOcAilFABBLTReM
bcMBxcl8ELMdBbxxAUw7CH+WDWNIK3a3DHZBOcgMdek5yg/iGy5gI4v33jnCF0Hs/nFIdzFKhBbg68LQ
MVxcRRlkDhHdKiedck3V2CnC6PRK7cd2jqqlCsJA2/dG6ldqiyoUes+2cioeBmi6Dujhd+mto85KJQ74
S+8N+JY9RmPTKZjORO7rpeurctABbXJECO5rYelwCzRIBay8JfFOUDPC6+nxO0ahqShQt5HNMMtywiXu
7uZOB2Fhd2fBfWHfHeuAj6xAGBIQ3yJw8W0RCXzXjQBoaw1R3iPSClozUe0TYB/dQm2hO+IKqdA60r6W
excG6gEh6naZeADSpQOR+zT3jXmYUUQLwveSvAZAHzBPf+ZJFEIUCc5MA0lWiPXCABREBfgIFRpBWN+k
/U65xFaFiqUNBJ9ItTuw7YPgQu+vQQTxQptaA25XgAE7CzUh6DgE8X2x+GLWOOeiBNYpBmEK4GDY7Y1B
BgEADQ+s22/XkQQRxkEVQQMHAgBOu517dogINngBCYOIDxZ75nS3u0M7CHc+SJ7r5zwJBqT7TPIwagsG
A0AEw0O6AoFR4B80EYlMJIC4eBOvCh6zrsgi4HUrHL60xky3OEVBwjzNdABgKlAkKLngGAAfjZA8RjQV
wDFnGc5PS9iDisw4KnIE9HQcJE8KExsBFQL3G/2RqBjSD4WxGkJA3BEfRAj8QNroduzB4vAJyirodTmB
ikXFjVavFaUSvQe0PQBg96RoPwiYgpRQXzqRuxEBg7AtXhVbU7HnzkUDc3a7XQOSEAhr8gRj8xZr9Le0
2+0EW/UOU/YES/c4+AcCO8NuQ/oWS/2dB1P+RMq2bNv1F/AF7OgC5bbU1jYJ6wkd2jhD8i0gcN8ROPgN
BRu7rcREA4MJ+TV7+xTOTDUDfBn5VRcUdtu22Rjxc/xIyALRG3v/uzW320rHDQH+BxwGAcoiCBq1tgHX
Bg/f/7AAjh7DGCWBhLhxgHAIoAIDtF5QfxstIN5B9+d7dmz3hvRpwvH/ECnHJffjEhCHC00pMYH5OQAL
nwxVJ4F0Jtk0fngWd/gPOIOcSLmYBdUCCs8ncOEHKtjg8EmJARASvKSIQWS2B9pu1wDFd14QCG/yBKjo
bt1n8wj0A1/1DF/DbndYSFdDC1f5BE/6Qx8hdDsHR/s3/EfbAdgVrblLRgwaMzgK2C1QLGcDCco9/YmD
MzxsNgNEOtIyIIto0AxdyE9/OVeg3cPDVi4EyC7ANvAL0HRAVHJ9j9N836eIJzqCzOhMi92DkPlzFbLe
TY1MVJjIVOZQJgBK0c0QNBfCYNpuXEn/TM+ThN0LUKhdzXLmiR+LCTsidFW+hYT35mOKomtiTvgP4UHY
ShRyIhTAixdoALsxk89EflWUwEHL6FA9xzsocKCg3qiIc00rUhwGhK12njAoBEBdi11viNgPvwb+ZkPO
/hvEgFi/LwZB7ZpNA/5C/EP8Gn4s5jJoFMwcRVrBCGw5+AdMPYEWAIUHMkN1EJiBHArsDHSNqIYdtjJC
nau91/xrUCANB4Bz3wa0HOXZzicOj3N3Ntlej3T+Iyo+q0DUsjn5nVQELhBXidFWblNDyu4LCQnpHUai
Y9t5UTPUfGaQ/80LFLGBadRVlgRlNLoFmcYMj39wAReALMHjKqoNItiDCZz1ElSXI0+oyZkjoOU6nkxB
cDXtojZxdC8qJPTHidgStXBjzu8fKFBJQc94dBATiTAtoGBB4RhbjWYj0FJC/y7P+/3FJgPVVVMIUOw4
AHIQS69E8YlgAHRRwdNGroF45HUc/HgWhmWGAAp2DdAVhYluBvnVPXIAJpebubIbixxOSlSh3mwFQYj+
QVpBW3VcYRUdhLgli0SWh3yKHtxezdt2GLtBLeJnFtffXDY9EFBDJw2C3gHFLowUbpSBxKkxCgYCgUcJ
mEEV1qkAtXV0ixDaBAN4DhV0tSZwK5TAeK42og0ImBt8dxUNThG3eBIcKM4V6JovtPkLJNGaPLc3G0gQ
MDDg5OsMaTA8FDggBd8biJhQi0gwHEDYg5PtDRtAMIXPh99u9pQkUBI+QD4PWAJij92CwdpmiOmBvKB/
RUzARb/oRnQ/UGphDY4htALaMk0L4dvYhkDnjaRgAgAAK+6iIn0eTz8YAXQhD5tAxkXIZicQAooCySDQ
n6K66Bk3BjzCiPxDiYAaI6uB4BJtVEVkDMokUG3bQL/zkaw/QEQFZNT7vyAK2CSUwkGB/P//Q1VvQIU0
wnQJHIeIJ6KJFys4h2OrICVAOjLQQEAMLauN4BkFsMUY10hQfg9jCcMGQF5aZoY4ELAZH+cQAXg7Qatk
BW/ohipwBeSBUXE4RgBIIL7YQbpIFlw4WFBYGLvxIA2bQVyZjqK6Eh49QFpADZAPyx8wx2AMHcSL0o+M
+KPFCQTkn+vyG282WC1XVnm5WONAFWfSi8y+uo0gnDKxB7OJK+qG4BI8I49rKYtUQMSb3KMK3ohAOqJ1
Ep1V/EK5KJ2INAQ0CmBJ7xOOTh8oHJNiMaAJ1aSgh8DQVRUB/ixwzKCKRlAmRiogRgCzAOBOVBNblzIG
rAsWix3MKbAs4hXBC6RfM4gzFxYxEEQClGywCDmUV1EBdMpwjQNMBXCJYH/feEwNgypmPqkBEzHbIwgC
DzNfYoOheItFBPwljMS8N3gVN1jvRMaJB30NbVE6SJdg9o9fUGxLZwMKaEc1jP8Fwf5d3f/pIQDrCedQ
agF6S4s0Rd9xIuIJ3VkCmKzijJGJC1U87Z913ypRAhzuC/37zOtR4RZFXgFqZJz3rX6Y3POmD5frksA4
wj3zwB61qk8z412nVzJJDyiONFN8qfnYOBV90UGDxsVWOXQkWAbhCX+hioyLN0yLsouHIQVkADCnCXST
i8BEY520O0DstYO8hZQN6AFtl2aMIAMH01AoYlSMT2MUUjjnj3/nlmEgcgdeieok8AWQIhJQvMavJSJQ
FqtQAbR4lolGEAmO3+RsA5QfoYXJK7DwLFyso0CGQx1gPQRKAflDU8dPEK3B5QUVLAIoMfm6DyAL+FyR
dq62wwvqEQgDrOqLcKGKtIm0SAyosS5BJp9Wg/jkN7T3wotpd30EAaEKBTxcAWYzIlXMFxbbWxGf64tN
xFUY/0ngUKSqCIoCUcVgFUKLDtKEYM+Q9VleRgSAEZB7rPA92ct4SIvU+AG+JAACd0kQnBvQiOl9cmAx
oteAwKTPPgVBWUFagkiLrMyAT1AwwIN92QZxDFKLKQUECQ1FFYjoRyZ00IyCW+3nDL9E0yAEKXqNNkk5
VSAPEjTrs4MsTRCJEVE2I+ILrilHr8JTIAfIX0FYMRkfbhtnSDIlSBRLAQ3gj3KHABCIBofA6xefgKgI
BhSYd69FFS4ox+qLCobeL3BvOWqJi/JDHIsEAfHN+nqn34nyrl3bJKqG6a+VcDSkBxh1jExqLySkh4sx
0o01v1kBwQGKSZTcpmbphS6L/XVgZNi4BoEdc4lz7kHgS9w6ATYUhNJORcWGtUdtHMKfJDqACN+hSAR2
Dx6M6fFDWAGgZhAE/Og6ANONKVhalG1ICyK+yeCEh0FmesFa2Egc1YhQRAotE5Bw3ZBNX3gVQ5gwM5Th
TymHYMKD/y5+VO1iRbAgm00K3tfhDvwbuSfqU4Ch1mOLQDAkPj67SPVwqugWu0lMGvfxMkkG0aiXCom2
Uf7J3IChCk8z3JpVSf0btTrx60M5wHXgSWvECTpgGUwDcPXYCBC0aEhSOJNogLFt7sORIkhwAwQclgxF
wdSjaAHgyuuQwgaNIPi9GE050CSaYi9cKtsGaeB06KR34Bn6jQunegZp2YsKSDnq+8RWjIT0bgPMa8B+
AV0QcAHYmYlTwTFHMPea6xAU3dxjOfl6C51NA4VopxszOck6D8xQ7QoVEywMD7BFAsCxgH8IjVxPFPZK
KY5UAoYN+5Dlx/oHbiWMZcrM/yMfgECEe166SIO8izcexiSwHpO1MZwkzHmKC0EDPRtMXQkLr5hyIVLC
Dn4qmjadNQZX8GAo6IMZ5aRW+xKwFN/bE3RRSItj/jeCNi6qFA+J10DA7wREHUU3il+Nd1sJQ5XhEsFG
8eCvVghoKapw3xiUaBXEcnqqfINCVJ0tQYh4AfoDRSNSLO85y3WvWZ2UCUMW1y8q/H+rni5kZWJmx0AE
dWfGQKlCBB0A1uIwBaZgwM4i3BLQ8YXZ0sAhgkZ01uDAIDZCOIjDcVYHo5qD7po6/bpe3TT2OGoBavnY
mAiaGQqxBkEoaOaiCSgOu6hPMIW8qYXAyQYFDcepD4medDlCiOAq4ayp0Ajh40Wa5K8WC4SSWbVn4HeC
GNy2m1+HPCwQcPiYlRbQB6pv8L4vBAlFFQj3PDfgB7ZA6l5MKfCUQVcYgTeKU/O+dQHNqGGiaLAfKL9t
ggAHsp0ADP1ho2Ah0VlXm3qDvAgLJJ6pdWb1VoRDhBFSW1aGCSMsUG5cTYoAD+iTVIsNN7GIpghrUNDA
+WXAm/69lCTYAShyH3S2UmegLSQORDEUhzwQiRvFLXRgk14DdwNDg87//f/9zrH0IEsMAzI4MDjo7esU
RP8yEEGeLG4F36DxRDM0kdV354ljv8Pr1mn31vFEOxKM2fswXpRKr74RgYJORnCWKikEcKAFtC90LQFb
rnGfzzUWuPXQRPQa2AZTNBcQbWu3vkyLBYwMA28tAQ3jTEbCT4H6QMKTgna1ddBJlqjQvQaDCwgI0E2a
AQbhSORoAgzyXpEQMDD+7qsYEHdFdTxFZ/pEMJJVD4sQFjoBpd/s3w0k2C0alXrWQcGEn4eaH0iLpaAY
1oKn51GOQKxUucsJl8AgIxW3KMF0QurlgfYREMzx7i5kH2h4+gWDiAAv69ZimsHDIIGWCdOCwmBBaWnt
sFVNUTUOb4m2qEEb9d3AWKgw4ZCKYo3ykACKFS8S4V01ZOh1SoM8MKciuPAdl+YPKMccMAqesE1pEU0q
mXmeFZ0kgvsL4ZdSLHBykLPQAU5zMDy1gQ8edkxD+lGE3/51AlRuXEQClzyFAHDXiMcLdSr/pmKhTEmP
SZf0I8KP78uJ4Ws8hSwNBPskQJmYSIux0Yhh3NqkAD60vjMQ0D2qhbcMBDFCcTN0rF6oEbOtgf6gNTyi
kx2XErmJ6/XQ9qImIwAIGEWECh5EWQ4ST3CVAAQw+hh0h/DhJMZCI3RMDbAOVA9Q9xfVixQUHy52CScZ
K/jgY9Hg0tdAQ3eIvlGfTokUM2ajccjaWTNKx12ndYhgg11Eaonls2TAExiJ7hbiurQhEKMoqN3jQBEk
6BAAapFICdxhdCRIVENWKwxdaXB49+j6FrjbgDVPAiDOg83/UDk5G/uEAyGoBoiYYg8sO3gUGmgH60xQ
LtVMD0gHX1BEHpQkULYBYpBcxNRsG5MJxw5GkmislsGj6r6N8ITQtBNaSYnEoD2fG1aY9gHZpTYJV9BO
JJhLL+hiPWAzJB90sEj+UEPtiM2Ne0BMrLgBMi3bg+4Yeg+C3N+qmGVII06AYsN2bphqfnv3RkAjXV5A
Ai8NLHQKa5KKD5MJTzm8gd8G69yxkJRVA9X//yKAM3r2R+aCCMB3Fi2MDR4VdAd7RYuHim0S8EomCVgr
gsQBHS66JI4BBKd9CAJUU8TtWpZVMAnr7BhRbFHC3HX1WYd2h1HvAoiRuIyIT/B9CGJ/GBQiT2lh8U38
gxhIdVLBuDueo3QkCHsIASE2C1cdIBWUsEKgDBzCgBgE6JPA+IXkSW7KTV64B+KARIxpcV5fZUKOfQqU
QDU1nEyQ2F4VRaTwpgUcmL1aWTSkEUZqL7EF4m027kTebLYI0JQLqU9cixAzAvgiCStgP2EqdkDo/FMQ
TY+qEoEJh1HipUYB9/ZLi3o8BUUJUoZSKETgRFyYhoBKUAnb5wdUbIyXUxgnYsEFvfd8oHlFpKALqBA1
BZSgWdcxGHajDHUuazA8NB4APMRwjVHQTls3avBbxFIT0Q07LBywc3gg9AWBMIV0piC4VGXzynSeRc14
jJ1UJAgrE5GyX2eJEHefJHopiufS//9DED8RZvefxIBMloIIVjBowSWii+iCAWI8yaBYKBV/hVVQJIE/
VEFWTCU+BewCbjHJjU2d4QGNRaQpULiKMQCKHOWihwAFO1tJ6GZIH51RAClUKWwmVcBHFWSWtDCYqk+l
qbSgRhT1+xHR0RQcIN9EiExUjQ111IHbRE2jGlrRYyhKsFCZNVSCFkJ9o3Qr2fULgsEnzu8FmRPAhUe4
Leu2nyPxKoIdFQEARhR7N0KnWLRj9gUR0Tctnb+PXFBhYy9IQyQx2JUormRp3DEnD+Pjw3UYNxNsLFXn
1gWEhv9r2I886SOoIRTBb88awShGb/UCAABAhSgvJag2vZAoTYvvQAg7rr1RBQ1MAegjDISiNMKJcOBM
A5CrA7M3JIwCqIsAE3SNmCoZitxjWwM9CQ9D8z4ebgEZ7xY58MwIm8AR6hTYrQJwWWRVse1XSnQbCQBQ
CtiIqLPKgl6KiK9P7ooF67uwIcnD2VlUGJ7MhqeQFJ9PzB81x6uA83/LnMQtAoZnHnQXREkIRg93JOsi
IE89U17b8W4Fp9+QSXGfbN1E9SGqI6FDCEMYLGDQTVu3qBYG0DHA/82Cbl/eOwZyEARGCGiDsIAFZx+g
CyyQGJE5B5cEFbLtb1QMpigMUDrf4RHe1f36A2QkIAv1dB6mVbhArUAe2Uzw4BZUbFWESesL/lHRTtU5
xHRFkogeHjjDg5zdU4OANn3dTImyaAi7jehVMA4SEbGEpYP+AVK5qgpYP9fbsUs04XUeOfUhdtyOaehJ
UKMIbt/rzdzAwKLfehV9UhCUIldB9DQjKFq+4NRNd1S+RCtP5we+yAAFKkjVfBbVolw7nZpEz1HQU9Eq
KTprYP901O9P0VfRdM3yi1ybqIZWBNK5dihVLCBYKpsDfIoa+EGLQzBTOMaBA3X4vVvvs2ABIrrFKVOQ
CGgn/z/vK3rY9mSLFlfNXNGZlqA9E5B9Q0goTNQfIwVJA21bcgXQ4vRpGE/enU2izYN6ST452nfLtkHl
KiqFCH2woBpLHVsNApYVfcdGCADSR/ixkP8Pcjhpdzb7wkMBFzk2cix3JfTbkQKiEFxCKBNBRnTkjCg0
n0zC/ywgRQPzL08Vsv9kIB6LRhQ5RxQ5AQMa7O83kE8biFVtOwJZTBcxQA0QoMDvUIQgPg42TXSp4PVC
6AXL/PXk9BE8YtXqhMsF5R4GSrlNjwECzjaMq6oASc8qXYDeOlrB+p8GRJSCnDrguy891nY6NHgYcjQF
IHIT6yy6u00AHxJ3IQUgdhuLR/aaghhfOfJym3VWx3iLaBAoieks2aGtoQZYBCADdcvakIn2ouyM+Ruj
B1GUqpGNTcRbu3A0EYtSy4sIP4XNRBGzwB9pR22mTtUTQbOfCulFMAngFs9EqwAKJ+IloHgRXrOjBW1B
jREYLEIA3MR7BuBMsTHeqMdNvCDTuSArE1GuiMr531QRzwYt/fvnIFXEgQ4QF9BQJWE6ECjCjFChf6OV
KQOrqaOk04DmLx2CYAi/MwEaOxcnOhJMqLNYIFpASZvoKg60WiAQnfA4BeHu/UWJxZmUgzWp6qvKxjBK
C5agGvAzVRJVgNh6YAhEMxBMBhtiFEt2VRj5FZEMEvcYVfwN86JEOUAQdZzbtSwqwt0nSqvtElK/rU2N
hzcr8p30LDHbXLlD4p+0i64MuQMUyOgMzXRLEXszEHQIxXRCwoqQncBqurxZ5tsIqCi4TN5iDCxqDk92
1gKXVHW4L8za4C2AQMHWZtraH/btwuDrzA9HmDnGdg8HtDHY3ThkIDHARykAAQKY0EAkRxcCGwVJnw5N
DquggWoxRBioYEL1oSzowwiKZMJXb044gahTffsLb4K6wqfYpgzzbApRTQutxY0AjQlkUb9hTAgPyles
OUK6PwgLSEBBsajvEDdIa0VtbhK3D0hIHCHdhX6QTwIUEEsRzktNRZJ1Qa3xV2bCmQm7QQJPRQNVAXeE
KGixIR1fAF1UDTVVQK0BV7aC/G4oVlRbVhlXbxG3CEngf3VJCcXVEdECcwdkQWangkGeQ4gquKOA3oP7
P1go4KYOdstF4NQIM/ducDZMASU1MXFGuyOif79bTFex7MCcW594E5CPkglkIkJchX6EnMdLkIPlQDZv
EyhwMGNjD5bCthDEN0wJ6ITSEuiwEBtIF0BHv1rFL1BGU3RqfijJ6F7agFH+e0Zb6YesMIx/Q1+UbFuJ
wF9JRTRQcCO8KkQDwl/LA70gGa0KPYeHZjuieksBqRNBqH5gT/xbD7dv4AExRs/1MXbV5Cjzq1y8/xB+
CLWEX3qtlHdJtl302xkICqvMQKocDgyiaEd9qtwTqnwZbWTnGA6s/NxCyjtR9Yk+p1yvOf1j22w3dyoX
Oax2PYH/AR8W28aeYat0OEwcGUdW9ilq3YIFzA7oqmhQtl0hyQciTarEGxNvrPvGKmyQqzkVqixIiCAg
26wcMATDDgJlI9WqzYcy8pGxBD9UFIP/BoQWhIM9jMcDLqtgV6zybAXMIH8HIVAEuyHZArxz8kkBbiNj
Nz5261If/w5QTKw42SUsAhLskOspAbxoQ58gY2TH+DVy7/Op0gCJwCpbVieIa0+h4aiaPb4BVS3iBUGX
EwWIIPW2IAEINHAI21h3QPcBtKQIA1zbaCxhrSIh8DSD8PHcDjKSDC8RkMMuRCn/EjMEwuxFmMCTX8f7
2NlAWHkfBA6RAgg24se5hFLCs8YyqJysD1xsKzHFKwNb11KBiQKEd4iIMz6t0IA6ptAADwFYQRJffDKI
MOUuYAxIWFeMWxSmcpTGAomnikFFz3DhoBqiGKYUkN0EMRfus1uJx4uuqTrAEpAUcxg2jAEh2Kkxry1s
2oGQEB4PHwARt8YMgLPGkHeRKOGEBBcBN4CA8GwJDql+/4yBBQMpK09WVcA4CB/LXSQYjB/2vbO2iexs
sDO7gC8Ef4jtHhqZLgggdFTCCRs3dBc34HNT+sGZFJCewLhVSwhn0PaMk0msckf5AhIFEAm+J6uqsoKq
t6LgQsw2UzvrqDQ2kLqURlFRvjSsqoeUN2bPEIQAbh7FVeUgXNUAZXB2AF0WdXhzDCWKA7Rt+HCLBWwq
ik1uw0kXqCJYctx/GN6r4BhAsYzv/sgGahMkEAEIATsExdgAVMZKJUC/SLCkHEEor+sRq7FHQgqOYDpq
KGrX8vMMHIyCEQId5p6I4qQGNIHEwwYbkPAQGzAQ9xA4An/rMf/4G17sApHtsKwIVXT4Egj2jsFiVAfF
5WsQdnafQUWJ6u4ESaWAeHPFBlYcRRS7RyEKJtTRt6kcUcEkBFuvtFXsv5tzGIsE7oP4EUutl6gVPBdH
Cq2oFypYYKmFEXWjVAeEKdC/BUTBsBuQdZVqCl6iOJd/KHeMAZGhA8/gWNgWlaHpWxAIUUC3yXb8CC4V
fgxENOgI/q4mcAoW7ME+vugLBm7Y2IULi4QJUBG4IhARo3gweiN2JoJAx63ci6QA3jFHrhwxwA29hRUQ
p8A3i4iOIuyD/gpPsfcwuTDpDSfrcEgEBOxFhcAgjnqDGWI6KQAm5JDDGjt4IRgQqENIVq8yCXbYhJnD
UxwxIFNykE0I36c4l00AWnhONAUNKzuIKhwEG4pjvbGWGxiEFUAwXGigAwCX6YZq6qUB4gxipLn42AAP
QRwByFHHL8QiiIa6qFBRTCBNs4iLlhMoQOCg2CAH2pMebHBelaB8PT5htdkbXUGDftV0TUQ0QY9yATu+
UdsJXYMSsz0FlkEBs4roA08gPIcCZhHDUvAAGKSLqniOCYggFEXABHEYOykSiHJ0kKKIdcyLhBoMKoKy
HoSqSUBMyvGPqkqRirlvWIMYBCF8DA6gGDbFD9fHXrbfCcHMszYbVIP6Ag0Mft2ARrY2CgQkR3U56kYH
FKD93ZTBJKuIt98si5QTES3WFpCcv/mo9t4e5yeB/f/5KhCRoKlH0EQWoouw1GBw4QEwbEjDhAg3eFXA
LthV64B1sh1fZGxCz3f/FnV4EDAYd78ZRMM2gFz9GCDYk5h6XbGBu2CEET68JKS8R/9YBINNER6QXyEA
bBodRhDmUGCs6hhIj7VXNxC4SvEb/znCD0G7DbODEgFPIFwSNZAjflb9i0dgSTRBkKhoTrdS8CcBSNFJ
Awwk4Qw6qyD/WCAiRojgTG1g4AFFE8JJoAj0QMq1f/tFDRDkrbFIGDsETj7ExyJMJIFbEsQKMe2CSeAH
EbjrK4cYVdDxA3UVg6cDVgBDqOoPRP+iWGADITlvgWfNd4A/+Y0c7Sd2QRz8UHSLTbNQRfh8GAR2Eug2
LP91vHSTWll5+22BbeJfkQNmR3Q8dpIG+9gOfm50Bz0HN3WgdHWZSItwiSYUJG0CLnBZAX9DwOgQwXq/
rfjvVbRud44yUDsRMRH5EDQcglaj5gFxhHpHwbNsb7AgYoJQ6SyPGZfBZpCRiE8PyY5w0i8/tBiP/9Ak
qkMUfDTfJYUFqwUsP44dVCuLig/HY8UCFEg311VTJKgVDInWQOCikwijTD8BGKBTBShJzCDo39fDJcyi
4r332/qmWUG8EhkWYhiTxPAAxTgAUKKdg24ouxwCYli7eq4RuZw/fJ8xEth2g30QGiwRDBKHSL5kgobE
gMtIz4IEMSTKwEMw3vpvtxfb62VXQDN0vKm6SEwDdS4G/yKOYSL2uhWMix26bNgOFp9HuXwDudwIWAgE
Y8eNcAHA/J9foa0I7jn1P7fdGRd2zEUYRjTdkU9hVwtvGByPTJBHIEILMIKi04YEd/90TsATfkTNkV5f
FYN9MBPwnsS2rEYZDtiAHESNCJQj8MEjU46FsFB8J2DYdIJ9aPwBOewJETm3Cu9cIzxprNtgXMODOBW7
RF+/uzBWLIXJYrxK4oXdIxqhPsjOORJkivB7ULKv/7Skgl8Bri+CicA4UUGEEj0oHgE7yfZJ17CAXSH5
1KVcZVuBCtrVYc0MWBgwWB3l9utmkSGRYQcYEhIWyz3mU236BsGoB/R78mHALgIU/G+1rEJX0JaTcLaI
+zG4Mh615ZTe/zUEm0X0MyZwWACCBFNRljgAjSDpqCwgwjOg34yv8GovGpheCkZXX/DoscmvEUrkdi0w
Cn6z2FS6DMMLu7yAKgypXFcKojvnucI9tvyQaMnCRRcJjgoTCmJLpw73kyD27EQkeIWJBjpfQcoiXbkL
RqkZNlOLN7poHQxV9xGV6oKXjNKQ+EzuIT2re4+EvgVlW1+2/DA7yGTJSCzppQKOZoMHMSacGWcD1gIP
SAQhTFJ0CBZIoargQPAx/lR4WkgJ+00fKLlpX4SC/RCwiBKJRhAji0ay6H8dkY2KCCJkBAJGEYtxrQTn
kqIiwgMYdE59gz1hsisAGEAIBxAgMMggGCBp4DGIhSpIVzXhOZpRQUGIH2BHlpIw+LqPyyJ6Ii2eH6RG
rOKLVQzbaQ6AdGSHifoQ5iJGG+4NhUmu82bnMqaMB7b8oGSkAvZXX8dEE0WF9iyYIJjtG7d6NlXsB9pm
tf7BzXAI6SigylDFqlDFL24FO1YwibsHdXSQnr1WOFNEwllGW6oYnS5Jgk5IK0WJYve+F07lNvdeBIwM
orCzXBePqHNeVH4aw6iDW/KeeFhQHSoOIRdywOgx0qbwAPgVA0YRmIuFGZ1ReBCwHzB6CG5HdyDC67IJ
YQBaDsg+/IAuiO4JlL4BID+MDOWwvaR+NXSJiue9vDh+g/7hDMhgsCsQiCqCYBQ3wNdl5GCv0ZIQCAQQ
iFV/fIGbogrZjQQYdqODAAV2uxyaaGYCLrynXxkN0smXvSZPvpcjmAuKiRidTCBCCKs36MPqa5+3XGq7
HkSIPaPBy0XMuCDXRp7RsboMN8r4APAVsKjBMhx/v2AsXF+O/2J4AWNC0AmesI3R1J1BHI2so1aGdhB0
o2bvH53hBSMEI5YQpblg1CEmXEMZFuWqv5LBQUkd2n3qJNW+WX4YFcH48VhQUxrGIsd2PYUICEJTNS4Y
JPoYdinrLf/DbbX7PWUw+HMMKHcGBSB3QbeISld6Odp+MvjR71jCwxQ0O0PoD4It2ovHETlD8C4JFR3s
k+NXCEUHZsMLZ+sY/O6OnETTdhIu6HcMNHYGEtBHACncIGgzqHrBgbIJEJ4NG4tDEA6u4O4GiglL0Jxg
BdQdtouJQxA4Uxhwuht1QjPA53BoOzLfQBhmODogUwJFyaoQkTBYtWkLpULGcnBhV33VA9Z2Pog4m6ol
RfUX6zAvGhENwJ/biASTir4crjZFBpchjVPCpM4G43MYiaKNB1BkikBFmyDIuxIAPKzDdUt1Y3wQjMoA
MF20piY1GE183lMU3VjB6yNHTXdVbGCALffAJMt4AQCH0YRJckkoDvmCQwhwWJtUcKwWQADveRkMYwKp
7WyWANqg15e1QCJiTygUw1M7wo4AZmw8OcDq26g6EjSNQrkIBhIVEjSyddYjIGzyAKgRoiCiCugELlG0
Di04SGd4BiwNMyhBwywrKATk+jl5QQygltPCIjRg4nXmbLxeHSSG7TkoAVdyAdGCD4jQKBBzQIw4QrDD
LBgU3yABhxiwoCvHtkcn4BWqim2CxBEidch0JgIKEs18FUzUFrOHbgL6EkXMnlrrJ8sLiiDAMhVCiBgU
AfBAdBWZr3WLDoRg0FCLFy0BaEcUEygBidrFm0TEMF4PY5mlY8ShfMRP+MAO2BOI/BZAABW/cBGXRA1B
X0QJe8JnNxYyAcn/0JvAkIYN0cKy/zC2qncB0SQvdHu8OMaAaIDRcnuZCxEtCNVHxSLSI2IKZuWoGwCF
dRctApiE4odnbCQg3sVUPRQTCNX2VdQqeFWjQbn4CCaNfC0BPxup4i/VLQAvTYnsrsIh7BoGBkNujpfB
YEmYaBgCklKhADAhkizZiBcSBzABXzgBBhlswiZADxBQGWSQQRhYIGGQQQZgKGj6aEhVBCbsQqR4u3x2
OkiNgRVFJ9XErBNqCJ3Mx+u8nBEZgASR2gNRxxMdZbR7j2K5GSIgRDD1YcsOVpKmDA5XuoA9sE++VS9R
vJAhGcIntsD470gMl3QHLI1y/0iLBqFzQzU3MsRZyD14AsOZqse/vCSKRY0oxyYAhKoifMhMA4SdwADa
AX4B0y+AOR4ILeJUte7zoLpmH+lJKfFjaoA+AAiJERoAECwnhkHBEaHnrK8UhipFOeeD3+kCPQHG/WpJ
OdX3gsodx9E+0pDFdwPB0bWjMfaXIJIagyZTfv92wWZV0XLARfjZkayAfRHKs4u08Eko6Bl6x7+pmsJA
ENTQMCeL+j7nSFlICsqaMmHUZEGarzUEKSIHwt6ke9gkSboRp1xILwXEwWpckco8gDbpI+uLSDhN4hpD
NOmsXFCNIQQLC1LDmPgARTotqAObuEC8iYZ4e1B0cUyFpiE1+NqalRxpIDW80Y1VX8YEHKjujkBQkKC1
x4Ab4sSYXCRYp6dckY+EZAdGpIuMwLNNEd44CLXGhaBYWR2SMH1iVhSZTAIQ1UGIX8nwYLgFwu/o3dk9
4RJN+sjmRIuN0HW4gYNV0SUU2NgMwVHD7hh0Qy50PoQNh39GQylkMWMIzRgd6QTrjivr2XKSqil4xfu/
IOaru8hg7xKH1ZS7SbvKJS9Pw/fPnjWZFnpquHHE2klDdsAsieumlHTCjSQx4Fj6A4wPmwB8ejnKdMYh
QAh2DJ50vgGWSSnVyi4ZQkBTCwhxD48DFJxwAif4C3URDuk5+G/CAzB5uQKmyihHqSuMOLBL2Hj1GxOf
cWAQlh/FcJ9+UQw50cvTViuMJ4x1pytWNsk20yBT0q80/QAA1NgPYTchxz3H5sPJa+qAGAG/G5QeoXjH
QXMoUQ1MwvgCUcL4LQTuWXAfEt84FX7dFisBKxtjJeHD4si+a8WeggbGkkAqjPXIUCfDVP+o34SDg7y5
DtLNMCoSXSf7PiWAAdET6kD/SAAWKYKBLgp39ESXArBGCCJm8YJhBO+DyGTEnizPk7pzAIau4GwezSsA
LQ/24wPgOcg2zS0arjwMEC8FH8fMMD2yKu9GxRfvh1j/4jL9+8PYPAIj/LXPUjwDDc4YPAQbWsP4z83c
+RcLyxxtGjZJCPzPMEgBQMtiEa4ejDqEh9nPgqXgSk4w4fDTQKmXvyTdhRkFO+xOQIq0qSBJi7RRRBla
GAFNGr43IB7urEj39hJEMVflHuPIDM09ncGyAfwwKDNMik5wQppEraIYAZn9DztW6pMwpKxBmja4/2QC
+A4WbSnIevc+l6xFFhV5eHeJ4gWszfx4d9+KilJ1Xd4VXQRYxgI4FokVGSDgKNOKP4Fgr3CD7QF182Gy
KPZGPh+EywozKBW/OsXN4oDdizHSjYu8bG8riIaS/9KWFKk7kPf3HLwWM8ThRlwB8FrXrFCioMMfIiZg
EIYiH0GGhIcQhP8gG1ha3kSqZYyK/xjAbmGPrst/Cwd2qWBM7gEaHJ0KYgYqY2Gq1+gfnVXLoIHQl0iU
JAj7otk/zLdK0uKAOAAIEAyCO0zB6xCH0hIIYR/uKwf2gAt79mzMSHAXbNmJxQwJcIA4LxJHgpq+CdKv
v8yqTQxAQMdM6R4gIkiurMUinCMkuwUtiOjZsOmKTIsiEt/B1+pIUsarUdiIWrcoOXyRPiJgEJO4UKTB
LqRhjDxMRqmsIR08Abh8sMmtCWmwSjoQTJjUY4kjMq+CEAE2LoO82T0EFQEixmNnRU1JGAII3OrVsGAU
IidE1B3gWiPcxzqEqIiz8v9nENsEEQYU/p8IBsCybDmNB0DFAKHHxDmJWtI8WO+MwYIyAk1FHxGxGuM4
Fph3DJjVE/3HZ8xwyQEb+AsAAQg0oWgYe8siwCdRfwUgGGm4QfAC2AVWYGjAsPo2UKr1iqJB4DgWqgfB
dqEE2/d1WX1QFylYwAd1qdxlu0ezjomU0FcmZrs1o8cAwSCYDMOIJwSMDrx6/eu6AQEfD1NTF1RVNQaF
A/meVLBoEk1p9jrIraFgH9J9SItDXMiOFUULzNtI6eC9gMBF9LFjZ5AJ87owNZFhLFZEqAvsuh4OAwZU
5kifvKEAXBDaKwcTJgDE9OJBiAALopoupRqJigSHZTBsyg6j2yBZKCoQFEwwEB4REQKe4cMLrHoADa2n
wExJO8IVJIKZN04B5SIvkRXhQO0sv4OxDBh0RtDPuJMYzXh3gm51lJxmvjxeX8OEwyz7ygy+Pz4BhxEs
0fNBTY3Qw+KGXtJcJEgU0J3iCNAV3jsec10si93LcQTCHc67cB4Wu0n/FMrdR85jSFFsyvggXULFt/Ax
hbFInwOAxgnMgoempyKEMixCAalaESag3ws5sMHmRcYjWEEPsP93JgnhxoI+chx3KvpHAxAYaEShfFB0
MGiZn7gBACkoYRT/oWJYQE8y4QWnak/BupKIXlW01GK1AmoAubdzO4guWCnEgFMAHOu8wCSiFE9V0nUt
C/oKRFYaOFQUTQQ0UlckXETtlTM9JtAOgsK08HTLNDCoSKlPe1J8BJ/nJf/VIQOYECFWvwXvYAeJ0LKB
7N8djIJIzWCJhC4GBgUpTyICwQPGApcB1NMB2y9UwwKifycGFAEAOBnUfQDxcDbQ/RiIR8AwQBVAihBS
TkkqaGBRn98EiEaZTAWL4INtiBQgBdUxLoApCDBgOohrmIAjRLTeV2eNvIgIcaz0jaxSZEAUqXP6xYBQ
0SBNSDQJoiQ+ISISxGGSWA9qIEYSuAMfFLCfhIhwAdofSItZkIIgRM7FFLAKYPAZJIYwCHmLZdoBl0UQ
lhAAQ4qAA+iHNKSIGutliXBAYgaj19mhVwQIFlrIIqzpSQDF3jZEYBQhCHAMYEXX2YHTCiFCwTksWKrY
g26GKo2KJQOBj+AKWw12HAG5wiDwFDe0tIx44gIjDIyIMYIpxmTE2AnwFMLz3wkF3fBWILGIEQOIXuxg
XouMB1GzYcQGx4m07AfcDIhtDzA2QGgGc9SL/bQnaLBHBQxg1Q9ITRhsoCeoPayBKLbwdFiQHpQSWxH7
qzBMpoPDASLFhiQFs23rCZZQtBkPF48e6pHtCnXrFHWp4QETiIhFVkXgwSrC2jmKz5wkAAETNJBDNJVV
vQ3pGE0P2r54WBEBiJflmmCUjA7ZoSg4WlCGqOVASBcsCOkHOBHbGDFA2EUqK5Ao6hfhVQjoMthgXRwo
JFgHYHsGgw1oNBB2VVATgqA9kalBE7ogtGsyFAccSMknSIUBRCIRAiIXLoitO7dcB6VppEDUkIuEDOuE
YwhQ/85MO4LYGU/AAgVABxGMggf3tM6TuhtCWvzcdovCgWCLEecOSBV1MowFHeBbLwyWtBUCMnvR0G4C
9NWkCwvWhagXqX5b4Rx1hYIYCK7+g32IBeB94ICh3MGoKBkWsjHjQhGri6yX9Ay4RUsx7ccDTOpRnFV3
55jgyLObD41wSEI7rHLZIiFUDO4iO6tXEndzbsa3IiI07MaSTCvisx4VnM/B4wXugnAWBEyICYiHFDck
MfYjmyeEqA/LgDbb9RYIcOA0cu2nuACGce/N6EOAhj1TshO9UsZjBeecJEDFENFdiPox2x5EsEHqhl2T
cKI4D0EGGWR4QIDSkALWSAEZ+uJSRLMCa5nC+hl0i++JhCSgAkGielLq6xInpANpSdap55gVpcgd3BzQ
qg4FBJsV/AiaYBY4hP5rA+paRRNb/xhEvQDgo/xYAQdVFKARhV0riFUjkPEbkYQk8dqkRbuHMSKMS/LD
Demls8OSRe8mlDZYwyYQHS4A0r9APMZ0p6QPZpBFiSzehthYQPBE3gQI77+riglwSdmlmxXArtth26kL
XhaxFjW2hGbWM04tgnnr8bpv0Q9gdu4autmhhKiGETH8xa5uEAaTw5kgAOldjJYm9i3X/YuMe5oyhjX6
td4hlxyw9toLnNOwmuRGxd75SyAUvOyLdMK+iFqgeMmAWEwBgEImJt4Fa8FEDa2hGI4wVsGsaA8dYLPB
2go7EnCpeAdGqiWJgAglsmiebUbgCBgIMHgTNPZrOIIAAiZAinlOnrMLSBBQGIpbEDpYUAlgdfQuIhaE
TnV1CetEUNU2Qu/RKRETRurIzTABHQJfhwU5gPWa7dpldJCCDS4aGPXadxSHXD6DwSDrwBuwAHazjxfc
72+HgFhAL2uI6AeAQfSJ1kSgYkD8pYnLtEbwaiEzzhP10Uj86gKs6nh80vGIlxWPhd5FMaNFCNDgQaEZ
RGTifK7LVFTGSzfREYC2AmjDiELVVRC0xOEEUhbA+MduQ1EHdZgXv/fMdwsgdot9CGKC68qvgnInAHcR
sWAn+8dlJ+uuPx8smBlzEx9LREEDwAngiJ/AYMOrIGxaUxATEhEBxEdbakMCqcPPSP4B+NCQgHMB4OAu
q54gMv2PBAsFtOAdGdG2r1S6VQFW6E3tg0W9AeM4dCCfCgiCREBSL1G8oZOIcv+IljnHdVTlCvjmTo1k
PQmaDAqI2o/mX7jqKQdE107jInBAwH41ILqtApZxdDj4ZcaoVUBPdB1fLURUqo6gEK1uV5pf8FuIU17w
x78FhYNJZFVMOywkcrYB1auqWrHwoyIg9150KKW5gBhhQ/enAbg12J82oOVzRyRAwUYwHfqCClSKHISt
u4reha8kJFinTSkA1UoVUA64DqAeR4SHJIAENAWMGPKEuKOgIYs0JDECRAPu+juL7gGq25Da9jfbHuu9
40sFjN/MtfD0/7dqFV0YU+mdMGOVDkChPsEoOtZCRMkNcOMruPtBoEYCO8wxwBHuXIQR1Nsx2eKENYWg
8u7TFtuVvZgGT/JRhYgGFPVawusZf+nYnnW2s4U2LPfwzA+4BLHrRieOFFwR8eydNghcq1O6+b3tIVC9
8XzWtVILcdiDDhwxwCykSrUBxNvAkyEghbAgAHhfbKEVZpWWgGoT0EEWiziwa2C/oHjhh8jhnb+TzYKn
r1SLjQ51aYbBAVExAugRsKyqfX9AFJu3J7Z02YlbLCBiLsN+YIBZVBdM6+/AvZwLN5tPFYrcYYcsiul+
s9u9rP810SCJyjDoklW7WTImiiziQ1QHICDfiOml6hCw4o1V6FaISMLDl5yeBdDYJo8FnEtNwbIPuCY1
sVTaWaWAGRvI6EP20NWxEUVfhE9wVy5EExt2f293PG8wVccl2ANnPUc4Uke7AR1s10/PV5JfWAMgajdi
Z5pvaANQPcbW+DB4e4m3gFUxThl9RABvS4o9YKBVMcAR7+QaxeyHuAAmSA3QDhB8SV3bC5qT7kgvRhAK
0BjYpDlpTiDgKOhOmpPmMPA4+ECsoqXJb1WVh3QWvLtYhHiDxxAMpKpusPBZ+GZfTBqvE3Cfx54p4QYV
Oi41tA0KqqUK4QLSCvlALTaRIW+ZkJMuT1+RZAHICxkK5pCOnEzIdKIUBAFbqWRClm8Civ6IoFWW5XYM
VSSqNwsPlsB3scY6EsTDkC9WJiEKWlQmYvigwIDoAMxdQTwKdWtAY9w2ROl1VQifkNF1OsboYG5fdK8q
h9BNVJgg/8BAQIyncKZS74xgrPpWUCtd2Lp/HAhBuqFGIInQc5+tGkGM7pHf7YqA2Oum/xX+InAheMCV
C+hyFZktUkH8B2MEsq30sksi+OQSAQBd19APDMmFHF0TRzGQDMmQGwXJkA3Z8F/bD8YMyZAMsZyHIRvZ
kHK/D5IhGZJIMx9cyCEZC/cR45AMyZDPu8mQDMmolfMMyZAMYEw4kAzJkCQQZEgu5PwQ6PTTGGMMPhE7
1EMdihhjBRI7sRD1guIZL1dI90EGGczsB1hgOBlkkGhweJdlvbOK/5dn3w32QrYPkFcQNygyyCCDByAY
OCO9ggwwvPc8cqQSkRHf97opCi3kORwPt5AgBQyS9x8QAC8hD+nkRoqA1DURS6dHIINsEw8HUFiDDDLI
YGhweCG0CSeHDwcPg72QbQ+QRxA3KAwyyGAHIBg4nIQggzAPLBA8T0aOOQ7KDA577AjkhY6LVTWuoEUw
+EF0RFQXK+psEEARNlTAuQfBSXT/Uix/g/p/fyvpHOzv0bK9xE3BSdPiBdPro4huv1vZdSRMCSbBB5WN
qhLbKn40Z42oUrFdRzX+m4uPbz/5RnXLnIrAww3I7gm+ELUJYBjTtQ1W9m/kxig4DYnfMcC7NSmoBUgH
vAbPTEEHTFQNChhIdEtM67GvAhcKtNFB2DwM1rndD19Mix7+7byJjw1siKwiDhTOJLYAtNFcUxcDLod3
QdEW0HCA+iASfLbP9uzsdjYKQO3sCFDr/EH1hL4wdStNYO5NRZUKqB7z8QMBBwjPhNJ06cjurVF7KhB0
4bH1iVgEPMZI0g2/DN8yAibfJ79630VBCuEMBRrp7IC/BaFTchh3CeZsBFRlWYYTjD2Egg85065IAEGj
NZsL7Df4H21wst75f5nuFk2NawqwMAhH9usq59Th5OWFrQDXBe7n8nUtZA0VmeDWQTRC0WyJDvpUNorb
QscPGUE5f2j9dZLwrAH8A50cDvBybIGKfwud2CYJBbQjVevUTyAYKjpTAgmA2IBBd4UgZE+IUcjJycgi
aXWWRdjNCKdPBEHPEALy+xRWkA9JYw/IbaloHisT/EsBgLowxkzzRbx5L1A0OwwX0SdVgqLOwCtRgNHD
GwVkf9PnDWN0Ybe7oQn4LnjY+kB038fC27qiYrbt0EwOa5JtHRaPAtC/gHOsqYpnh880DSM76cldpQoP
Jc8GGzl7/y9SdP8KQ7aATS9hPicnz7N/MbUMHENEUW0qIE/k3NRfRle/Dl+APcarIcMi+Nb6D/IFvKsh
N2OkC0U7PWSm5ZGgcnfE+8YFmyA6GLkbv4gFkQlvieUAmmAQTfxJ1QGPVCx4uHVaSQVbxc39hGf2Y97p
7qEf3kAQW2kh5SyEWagAgx3vdCVBs+gKgkN8cCz7WHrdEcfwfBsxisOaG6vbEsf1iYaP2vUJqwuA7onZ
lKgFaMLrhE/+mNQRxSqH9B+xDIAe03VSdbEkR54s39f0dwEOcub215A3UOvJE7aDll/b67kPMCkhT8jr
qTjrmZ8YGyZsiQ8gje9Mvw4sVjSLBQ8QhkRUQqeBTaLXEr8+DxYBSMiIU09DMmQHcA9oYIgCMiRYYx2j
CSeFXY4J05uDI3CMB1csI8luB52MABgkji/0Mg4Q6iZ0G+AIXVAnhMyVC6XKNBLbSoKMAp7BQEAW/+Df
ESJirH1oOiHGGHciUdJQ4RteCLV7CAHtXRnAJWvVRM4Go8M/SXJKaggwZD2+XwUH4MAv9Kk40WFL7c5p
KLf29hCO+5jfbmA8AWeOLQP3WyV0aCZv2YOCBGFGEpg9UnDA6Ou1nz00qCQv5CGPKqgYC7cgDzkJqP+n
P/KnJC/kIein8goVQw45x6e9FYWFRI+kjr26UBJ0OjW9PcTFIRDsQ7otkouMhIA2SHobx3YIgmTv7QO4
bUHBRifJBl4CEvHA30heBIhBGESAD3FYSOw49hxWnAqnsQ4+hG+LZgTGCDCPxI/EcDyt9DR2aDys89Q8
EMHvsVARBDwwB/WsyJFjNEqCr8QHOwXiQ0LiXCCDiLIE+HcEQH+eB00B3DwQdaUvvBE/LgRNzID7/8Ah
dCSilFzYidjDDAh0uz2XK0EI/XkQmmNHoDjypNfJgadquL0BgQfnjZOtrh9gk/QQtfNUh5kvAXJycndd
fmxA4slp2gZHLS84SKTkTif3nw0K9WCrcAHF61DHYovkOPgD8wToncUSSQ44KNeFgJoKndM0saEttvcF
7zf4Jwn0AUGyYDcy2KrGIoFTB9FBhYgbmXI273WqOGBx7AXNgJvmBTWRA4oGbCT/HpuQw3xjtOEAAg8E
D9ZAETsEDt9jD2zYwxbHdUTItCFi4WxNzUXOeccXFcwG+icRXRONqF3vwKDTZ7jdv+DFmEkJxCt42bNo
BAeICRAgf5VwVLDEbSfrPgOohJ/F96RJCFTxNZQShwcYXQpic0cIdKMd1BjGMfdceEYwagTLeMwB+5Cj
eBTzLE3oLlWj8HyUD4kWv+EZ7dGERwdHgX9LEQ5YHNQEX0UCS/AhdslmHUSBKPXLDQiRz1UMAqYPjJbI
BVgOQTIbjLa2H1tvMivf34DRQkjcL/Om9II1g9HQTTPA+jUa2oyoYVVcEKNGVK5HLDP3MOy9xXW+6TFz
phd04ikWhKUmaC3avQ8hz9B0dFkoUP+O0Lkg5JpBpU1jGMlDl1oJw5XaskZsW6LTS9jdIPYR1TLDrPaZ
WvidX9KH9gZg+MPwVnGYCy7sBSh+CAeEjlheA1bsAFiBJbTk7RtWPz2pYAA43vkOFfy6uAx5CH7PDfjv
izIV8WdBWrQKAbG/+Jxmg34YABpN/d+agIvteWWw6xaB+VDldGR+RxWNGLR6QTleGHZaQRAoFr7L+zmq
akHISUQdAd0O0YsKks3YoqAdwEkDYHoo+rag8XcZOTcWAGiCl5/xaZbGKtkSUSZ0S1PFP6JIiX2oQVSu
G1RxDnemWXQr9GrtAYgnPIsYFTEouoIVxBCIoIFBPXcAu01vGjHAF4tyhBTuzEE25UhSi4COglYQUlAK
cEI7rPJs/fiN6L3tIqFNsBhKCOkQg8eiK+AaXX//AHPdH0Dz7wToMwJdZB6fhjwnJ2DJ50RBK4GvjMP2
lZIB+p4Meo+HNGyKRrT4OUKP/hHaZPn6LH8KjSCSR8Ix24/6RDa0kDz5mBBwLhmGhCNH7/1fA48PgHBO
zh7QOY/oC2UYbKs9CZ8hFcSqEYHUZN6OUG+VAqsQX/v0ihUYlFuvhQvt7QZVc1sDQbtsM9WezzICah+I
brcIA2IQOFoYcokVEUvA7+uTIXiqoawS8QQWRkEvUXrvA2N/yRXyF7TLKYs4KQ9eHAg36RNfRIYC94s9
oZNrntoAvUUlwfgFOsHmQC+2LWb3AnU76gHFC0KLVcgTAW73JPOJwWYyltbVp8IE3vRNuN3ba3hxWLgt
EA1Kk4YBgg2m+8pIA03ADSxt+xDkydhJB6l5p0r7AX7iJFRz+v2HxkIYuu1B7AMZ/3MIGgwbHQFiq7ZC
okIo3XYgmAbeGTADMU1FXTQz9zIdx1CioA/y/YyLtkULaN+FfQ8QBY4QPaGLObn9fHW2UfQW84Pn/SQB
EB2SdjR0SHkFVBiAylH0rhJS+XQKkCG0UYQDIkdBM3CMUlZT/wO8DSwGiVsRSQKHQSMIWNAd/awmC48V
tECrHr/jgZcNCg1f7et1LcqXDD5i3HfBWzQYLMFsOchXqBE0CPyCLSzIj3N4tGEsPsaMiw09+wDvFkMW
JSMewPoAlUQ9MIQRf+rDw0mK0wfR334ELiX7w0kMORP8cjHAHxXc3cKaSGIongIAPxkMOhMcogncy/ay
Kj7JeTTfOcIr8J2raP8rSv9FiciDUnxl48l41mXj0S3MokmGHeAXTIWYcCscbFosC/ARoSa2CnBKvsy4
PEi4J77/pFi+JA8fFwYyJV8plH5cn7AdCFsBs8NbynXGj3qEDQkXd1sw/ABPwgh1hPlb8hT/+VsARPhV
SYH8/gnii99c8vPFRIhiMgBBTduFWnp6TSnwnULLQiSsFxRrxRlus0hjmjeCQVMwd1ij6lHjrL7j2NwC
VCrj4ALr2zYrXlncdSayxPvaZKXCuRmOP9o3VVQfh9wmNsw5GTnWr3baVfsGF01ulTyJ+NOT/quDrajZ
5TWWTKK7u5tjEjZh6kLcOHcRctJLDUZN/2MMlEwB4f/hhQF3F1BfE0RQ2DrnW/eDBPWIShjr4S8w4lDb
2xYAFtFa0CnxFBtxoQBEczByGkJAH74GD4D5DEADUdy1jaLaSVSD+VTNdNOXPhnrouMB65zxBciRI7uW
3V51lPoo+BLJc+QpE6v3HHLkmQH/Qsj35fcoGRk59hJoBHZncHYNiC2xJtoGujF2FDoMJk2avUICh+0D
iFhw4CCpRrbN1AKSIQVxDkAuv9jb2QhQ1ID5MAiZgXSdHWFG/7MNS5lswpIAn2vO9gD2mRh3QRDKyesg
J+mxxIVDWP962/SAFmhpZOPbaNn4TTnpuqDp224SSEZGjjzc9t0RXxyxY5RIKYDj0bbTDYAACcv/kGPp
ORm5xQ5fsnODfJTwPDmd//V3q3JycnZvQhA5WohEMnK8dLB5YSGDDGEQD4UcTZYqagFntgPgiKWtdAlb
Srt5VqpSQXVjfPgjY2cc1fUPEGNYaWMPF0kwY+8E9UXFKBSwiwtLCC4ARYgMmuvITIPrNAxJusOfBWPd
InF0ecjlkBa+dXrTAjnTdWis6fPGxk4cf8dsSk1jCBk59hBlTHK+n/cWlPA8OTeZ9F1lHHlydglCItP0
5A+NMoiMVmk8JPEID41GBE5IRIuCItFANsjTq7t9lEopBMCF5G3woE23RLF0EQfIDPeL6A2EiwPoP0hM
icgoahFA96MMkCtYVN6VWwMNQY2bGv5OdjwWRPwywXXE9E0Yi6Ja62+ginOhR9EXVEz3fIBrBYKEEp4U
Lhb7f+scKB0a7jNXt1z3NLCOHIB9MW1CE6LoRahJ2znElyLiTaDNi0W4ScRW1wFhBwnIymfmmiEqCkc4
B3UBzdHcAy8HVOBniIZYHw4M8//uFim+FQZXBU2YZra1OdrqPBsMWZjy0BN9EwHvVZC2nhk8/3RFis3c
rMyckp+Y+d6eAXQwOJB0IsIZ3Yt1A0TIJiOKKIhUh3WaoHy8P2gjR3CVnPiU9Bht+Kn0vanenwIGJOrn
j3aYgImfFXGJ0HM0mQA+Kk/B2kCrggqfNt94+y75wCAYGwQYde7KYAh37FpgI/pMO2AQc5lY6wZRUSyA
hx/BMnKnu/Sn9Kcao28BQDw1UfoAsIkoYAGWQVwnZwMGF3ktEvMdaDeQ+c0FnS8CRkMUb9JwjkjBhpFT
QYR5gOiqUe19sABo2NBoH3Wgdqi6AEEpBlRlyAUC/qwXOeV2LkGIohCBqElEKCgEVAhnOW9AFSLDVnXI
i/3cjY4GjiqbJDMpNnfSgQBwVQLFQlUJ4/ieP6UAcAzzmFU3iLYLmZbHBvWEQSCX2Figx1eJ4Umi648C
GgIBjyqebdWpmlxz64/QChCQTxaxuBuGsce41eq4db4VVJsCeGfqTxhiQi0S7AxcdCQWqAX4QQkutaJ6
0bkpubEVmXrJ+CpjFLmUiL+2XeRQCEcYe0SJykL84EO0AgsTkglYtLFFiC0ObLQIQpqA+gy0CD0nbXHk
yLEaQfO48NkLFZtqWYL/8AA4iiiEfzSqDbEWrH66B39VsMUqdFyoFUSIHdWNcC5BBQ8KiahgdrLKZi85
8yhbRWWg81z/4qMu1Yn6rNPixdJUUxUUF3DazBASotEu7WnsAvYWegRMY3kPRIusQImEpKOaXOYirqNn
mtMgoA7gKqWtEm3YYph7kOuShdDIFMHT52J8R2wNAHcqePs4DdtmxcY0RZbAAJyByE6pvHCEruhaxf9s
VLLxR9iKJFr/71puCvZgmxCOj9T/KXJyMnLCXTNUhlgAArsM9Hxw6k3HB69JAWbmGx0bBXgdqLq0Q7g6
uw90TzviYwQKPTBcVJGi8v+45FoJqyclKTnfFaAB/BgG9AxXBR3t0e+4YA+CqIEqggDoXovqK7CAeCZx
C/sM6C52bcgdZEwp4xpdxVdQLkyAiY0J9IF4FgbCzw1rvwdRsW/rjowMvUt25ASBiwsvCaAPtwdExJIo
D8GqBRgEUDG7CrlJgCGi+NyJBUcR+GH+KXgUxG4uLAxcv9tnanmi+ekbqQlbCW+RZYT4psL+KEg507VX
7WFVMklEsRLqGPI1dr9zBK45cIM5qotv+CUCsMj4rSalU8FwA4ylFqWLI1xw1JSKauT772slR7glDE7t
5G8IcwEVoW5ALrMtCT0s8EEMHy4zAxGQQC8pK4CS0NLvKNM0BGRs7CkWvpgExGrXkAwIZJ9yMjLW/2k7
Kxy5GLQBeboHjcd/Mx/M4F2gpthND/Hg0UBuCCfxPjhoUXPYKQnbGIMYvOTg3dq7YBCpYN1Fi02zR+Cw
mCdFEEUxwCZmlyJySKJIGS5YB18jQS9I6ekuYhj1pMYJoCeqAB0Qn9dT8KkwvAELjb2w7YRIbej3YRLI
jagNi3WKjaACDAHVCrluqsIRLQ1IlWqjsWACGUxbbLSiTONWSOq2QNMLYJPASSOW3ggfFNGiYPIbVTVa
Lcgzd2npBgTHwUlghjwNQRhq8DaXyG8RVQN14Gc/PICH+gB/2BqqPLwdB/kQ7D32AhzCiHlEiIWLeFCx
FjPrDgYcaoGCCnEJaBJbA552pLQW0RLOVAxbKxrUVwUw6kSJwL//IgLFM0Bq809YRfBAUwy3hCxEUeAC
J4nUJBgME0QF68fRblcLPNR/MiYjghYBlwWP1rqw5ICiaV9MMEYbS1Yv1fewxBCQ7SECJDxT5xjPiCUE
v5FnY8FZPcaqVg1b6u8FFAYfSHA11elcJXBPiGeVmPwtv1gjCDoVEHgMwbgIwHRlKytYSKpddLoL7ywE
KeAhAcGHEKT6IHhwGInwFiJcCqqlZh0FeUEosKkWg0gc30vA7LVIQS/h7A9kGxDAr0JTwpbFhC3hlZDV
mkxsM9XNvd4F8ko1pkcYChmZtwPlwG7YOyLrRQ8fv0IFi1QC7K2sTq8EJEbFY84FP0NNBfdlREgIWPAk
MMKYEV8vgLHriOQvNi8fwC+eNpLA948vzjkO0RbGDZwJ+jMweiDykTPGg+aPDgG2jCCxf4EcCjkrySYO
kEMhF9Ek5+Qo5CLhhEchnAgfTf9NAq9HYH+/KOs0YkUljNYFUWAYBxDYnZgoOLDHnUISB1QEDujhnasU
ZWCJEOcJOY48kAmQ8WJh9qwgDWkWSUBZLFgDD24mehOIImGIejMXNVP4gXtYB0Qpym0TgTaEVaJTwGqG
1SCrefH1FcAPhRKC15cfHhhtAcKTkI8ojw6FcRHZDyW8mwSEyn+ugLGFwe41MSAyv4WWipmA70N/xvAj
DNrCfy/DnAFoZH+Kg4FwMKpLYAgNFU9dbL6MMB0CqIWzekdK+AfoJINgqA0H/gHCUDaMh5B/kRwKOSL8
I/JGVggKo4CXjKgRf+LveVWpaFHhS5cnBHjsc39MCcpGJryxOMDsSTn3V0aM2SGIdH3Bv3cvwHZTLSsd
bm8dbqeiQyAr6dMY7FBVNW/WGMESYBnwKocFDmo23yeuSELwAjj/idCVwBLQqBHt3FQQgknsj1iTMBHx
vT0VelwivHAsV9IJrEsAfHAEHxSFHVGZjTWnIIkmukBQBP9eugJ5BFYfIG/kRWAcJn8fIjIsFPIiJwTv
5BDICyGsJUbfRtAIjwQoGZAQhLvsCQl1bdLDXdUJu2Unz8OQArhASQKKGK94Av4BKsdC+AMNwq6ou6ix
IHXoRlkRf6ExVpDHhIIgAXxHvCLaiQvyG2CwBDckQHWC4xElGwKDD03/iREGZ4fGD5/qEZQC4TBwb0mb
lrBIAq3ipJojh4dbOO4fo590GYlPi30IifALtiART5RRuh77CLAcZFknpTxQB3s8MMp1EUXWHWmlGkLt
c3DgTv88Ax6r3XkC+QDXDjFJBuMgNS2MrVyrdoMADjcnKAD/t6pRLXTLicEY2RgYP6/Hw4I2rEM/KBdZ
ilxCoYc9wZJ2Z4071AIOGlUyICwcNoRJu0G8waCi2DEoj1vYUwZHSQn6fythEDlYfyf7RaIQVrB/27kC
5yr1KM0FspYEn9/iA4K1d8Lf8lXOzgYMc8LbY2AEQDghxw1Fiw+3BklxZMO1Z1m63gegJUd4K9y1TPf9
u0D1p548EP4agE0BC6QRqoDxEn7SHHkYfwdZMOwPjsOAQR3S1IEswAKeUKLSLDYBDqLr6j0sw+gSUWAC
SCmAKaJK1+f6e+wWDAW4D4wFsAeJXAK7jBqg+gKnSFvDKGE0rm8IAkFuZmvsGYPRsFChOWahNsD37DB4
MBUtD+cl/qiq0+Vm/4nwJqoODKnHBSRDBo3Zp6rHEbDwrW1jYCxMDOf0WEBsJx/xAiwTlJrFgv/lm3BE
BbIbx2AEw8MlQQcm6NHhmQI2wmBtV85gAoSDvWBjUBAkpRAIchHrHhj8dAioL+fiZpCP0BYCQ84fKQLD
YCQfkR9bERFssKM0JTxgbBq1kUiLtQ/LPoJiS/G1HohFwWDljbEwdpeNsB26NCctF2uFBYt3vx+QWMgB
K0RPYjeVsCwyJilI0BIgzP8vLNDCYJEvRcIgoe0HA0AITyxsF6EIPBdhWrAPV0bSM9t7Zq8DIYVAv99Q
0iKDe/9zqqSB0DEPd1WcEtJehdxk+DJ1QwM1kMdAILRKOgayYCgVEY1Ij281FeQYXti73Qde5kp1GKrH
RiAFST4tEuBmKGUvKoy8EB5CTQnITyrsKkBYJP9PKWQoZAIlEcgrkAQpvFJIi+QrFBJf0QEDlyo0X9AJ
hwxID8rGv4NEBgw0lxIdlQMOhnv/UTSkORJo1+BBBg2JGfpvzzsZsAtADV6vgf9JaZ40DyOCVH3jUwsG
MABfkSQ+ODG+p3uCw4ZhhAP1xwTsAgy6iJQBU8mQPWEd6g+mYkchJ8BSXqPjwo7oYQkhJkpQCdECpDnr
4UWGjtUHP/5+HwJLbH7/qI8/NeDYAEnB3ioCuECYFdA340yADZDfxz8K4bCQUa8mPaFCwYULi7xtCuAJ
G4k0UAIIuBJOgHDa2zggCL87CqERTyH1wt8uIISEClQwI2wO7EAAPOLUTnWVpFUYDytJfxEhzZNuMkeM
td9E5QarAg5MP1IvqzYavdM9ENEactItOTHsKSLzCxl5Mnfm0AfJycjI+E2ZdLxmZybk3evOvd3hWPUK
qRk4GRdXAg/Dgt2niGZkUIBINLZ7gFFbIC0FUH2/qnAdNSFNe5WYBJBKCMO4DDlECOXP3bNBOmHTLeol
iHBJiElnd7Us0KybDUL7SF5liOQNeyC0/rnaZe6AHEl65i1Yz2QxbGHk3Q9mXbADJdhzFYC+bME2+p1L
wATQGIU7YAcCWYXLSIst1IBQF16AqE6VJNpBdBzbSwAILxF/SyEAuLIBuYSx+ObXXYCKUpg2iVCGEvWG
3RAenGSxEkYqDM/JQHLJlbW18BISyJWjrdzgG0SNLyoG+P91mo4cgYav6FuE02XZwLsEmimQWwAnyUlX
4ofjKwdYhAUCzzk6h+lMtkBFCf4MtoIwMCb2aiINC1EwciQoKQMlKJoQnEKTcSiMAYDQ1wzjsCdPdgcm
HiT3JcwPAo61YZTRtElD6s4JOdbLQHjMQ3nnjcDiyIpJy9kTzTNTBQkzJ9ZAOydDICI7Z2mOPQLuSDNP
1UeBPBkCujPXk+8ySBIrQHnPhkC+2nQ/RTMu1MEMgTRGEaKjGFaxvsr0/+yEHGHKoubl50ddnA2EcIjV
brMzxAASIPQ+6vhRkBAPj0FXVb1ggsPtjXkIwQhFnLrUzPWIh6oeeUBNFQYgljPJBz32LQZ6BoEYEgAA
gcEgQFEqwAk21gniY+1EiUW84tiN+Fjxx0XIpFIISQNsgooNVfdBUaibBV2qQVCYnwwreoutSkSJvF5f
tdq6JaJVRkVq4TBVSwW4t20rRRgtdBCComPdU0yhUi5aWQNWwcJuH4MUrIBSJ8INv4BGhFUvpGp/gBcK
XTFABxNjBLpKFgEvFUcTAB4K41t3lqKAfA8I/0YCYs8Rv6Lbnc4c6wi7osrbwvvjS5XIZCyRED9XBBmL
FCf5RW1XoeCQFT3rpv+JyVigDqRh1QEcMhRU2FGNjZsNEZOofCp1auGniqiyRZhMqZByAPEEoHUhVUMR
saJDkhWxMgKvP0EBS/TIOwIu/G1vBR0mXWZFgEycwA3CQOHdiJhsFV9AW9hYZEVRbTdOXFxljhKturkF
Ts/EeAZb2EUiCkWjqSebIfjW+AneiEWPwBxwfPpUEK7/AXMzJOCowFQqwmKpCL7jgEnR6T4B/FtgCarV
OpVDgH2PDA0niAxQq7MyVLfC7KxIiz6vjwHAE4qTBe8CQVrxCcXfM3RWMtxBWzPUQZ1QfEJcM6RBXTQj
HWFDq5BEaOPJelpYEnSEx7d74ulCeEAgPzXKxsob6FKVrw+/LjDfgoYdBidjDuwSZrNfDl+3HzxSASzB
AjhqOQqgRAfkiAd0QLrIHBDNAJFX7S2ATREtJlC6JZAtwan6ieNFw+EEgBsUsQnYN/hhfxYtN5RIOd9T
N0mJ8Q0AQSJeN5V4CcWxQ/quyANZxsh+WEcAauF7MTxmLp9ZAa/jQAwaoP9NtiHP2Nsn+wZ0nBGXXwTe
3AtUJ+LT5pOM8EXoCnAu/+OcFRMIoNONRwrCR4D4EwfxQoAnI2OjRF21xUDAxqKn4KNxoYhR/4QNQRdk
ekKFMQ3JbKrq3+5Ii5FFqGk3oHYSxLdRtIdFoGWOQFGoZndajVPwK1c1MJi/5kar0XC2ya6yhWgxGo2Y
6OQGInJEztgDwhCMGzE80DwMlpL1tEGn2Df4SYDVk8HHKZrHIj2lZOztxMcO/0GenIyML8p3vd7fEDkZ
QMlqSs6CBP8vrig3wveDvccApG/OIfYWqffA7kiL064GTAUQtiZydwek/k83uw9AdI8FCCZ0QUsJMG0I
JxehS0+sDrIkQH8N/dcAAAddAQAvGQJ3plUEwTXSChC8srEvtrEQDVMKfNMuoscD2HZNAeqDLtdS4Whv
kEjtERwLiNb+A9ysNjSdATeywi6aQLU4BeFiu4dbVaouiYYwXMMw5Ihp7c7IlopKRXmKGIAFgSgnFgLC
7I0LAHjt0y2RLGQbADQ/0zcaDIDOXH54qMEF2wVwlU4uZl8C1HAhP0cywnl4WooGRcA/4EALFFSM/Mqw
W6Aid9zKwDSspULZkWcEl84USiawEDcCOuGwAro4jTHZRxCH5bBuEWkwUp31jUkKwfopOAJqGRS0KrgQ
GLT/0+41CWDnTFEyCPluCC5CnCsxTqAiEsAQSa9GYR+34XXGrAjmPaJnLUetvjBRHFjsgAzr5AZtQaS6
IVKUpESJyXywCmLfwzM11z4CnmLIn8e3+Z4Ngc/CTQnCg8U0rFkF3RDPVxfiAq8qdsDFF9EVyxUr93J6
EQC7hXIaM1FqQ/pwisMIFwm4Ygd71A0XNNwNvGwFtFVKXRBYIgLWba2CUgsRRcRwhuwR5mMpjK+Sy9y6
YhyFiNlkbBxeYzpgdaw9a5PCViHALIAlx2si28pMtouQXBM2FAlMvPuQhzSoNXxVQYiw//8gtghY1H71
pIgfibXs2BIAAFGqWPiQazocHadEx41GvEOagP1srWKrAHiiUcAe4Fj8W9T/9qXAeYVjEGfPG4UQDbit
Xs4GlqJ0Hw4RGO3tuqD6Vizs5hsFfDUBNwClGcaD4gG/CgoZV6+9cMBI3QCsjbVAUHuGIB4AJcUg4D2s
8nR1whY4q4ANFUEI4YBCwaLQU4L6dVz1dKPEWDzHg1Wwa8GNCRw5qYdQ5AoiFD+J7FiB2IO46au+g8AN
4uTk5GjIkNCcnT37a4X1g9gaQA3wQikXnEj+BXhAwKp6OTpfBp5uVGSJxKjUQ1WRsNiVKN/mBITDti5O
Gb1GJggbpz45O4xZzCANQBUObT9Vy4q2M/Uk5qwtBkz2g9DbAUh3JOsht3sA4ch1NTAqAQTR8HvUVi/M
H5ZuNEB4SEFplQ8gzA4TwkhPEGQJYqZAG1NY4QktQjRipr0QNAg3Fyk5ELO4aIRIRMCTbo/2QjgvOzla
i/AvMBJOOLv4n9habUhH4RJbWigNQBGETRT6zHOHCUE4VyMCOGHCrwot1InABC12v91SAcKdWFrhOl46
OrNRMDAKT2KQCoJLAB7Bx6ArhTnetNAAAA4gQkYa/6ieqGMdexgNA8BVheuFXhCVDQGZgje1jVB2G1Wi
KQ5TEIh4BhGnKcZAUIQRUI0e2xhEzaj/28E64p/UHor4x9doKwAp+gSiE24IAQFHuOA7gpIxzRbIjSoI
Ab2KKgKgWhF8SDicEWC1gcuHVXdFMeNuKKBrC8u17CgDERGIh2YX8QBcwCRP8N6JHVyotdPoUnUdEyDZ
S2DBi35YMIqOtXt90viTOMmsvWBAR0b/u9YA/VQrBHjXur0DWhUnF/jgWtsvnniduPwFx65Ga1mFgB+o
ew9gE7gdVNIA0N0GzB2VBknHxIpOAHojtwjY6Bbk7KTqA72RC20BH4BEJqFJOJEztIOTTBbfCUmQ3cRL
AGAQn8d3bKCoAfQDKAOPE1IRTTn+L4GBWIBHagaqgq5eWW9F1j/uW/24hHf9oT0KQ/LsLSEQ3yhIOfdN
2aAQlNu/5RE6qCUv/zdGDhL8iHln/wIExc4BO9YRT4bUZT0vlJ1ULqgWMGbV7DlGjU/690Wc9pcWS0ye
TDn+V/UdixHQFipzUG+zSxgQ2MGWN0SNaewBFb+QH0buCnHVXEUxjCnB7LJ6Ga/HJxV1cRYbcFPylofc
gUPWLm/mCfZdkSvRQNZBjU0CcKjo6MMRrkZz5Isl6gulCauD6U5J7wXdgGQYo4tMOBSKwqpRwIPfYymZ
iamlzEnNwe1GY/ipAJLAGugIgWQAKxcblgxRBJCUNjTg190VOACF+NZFXJcLdolK7WAByDwbzlFQbTE/
/TxM2d9gEggO02j4EmANbsmVeFrLRDaQTdgQA5aVspcbMgbYQJPONYwIcYYyRzcPg2QIzhwBHZJtJBIJ
9xACl7CTu/cYxiKw7ZDduUAI3kiZKDhCjWwyU8NYKWu2gM2CKidCKiG6CN5Ig4KJuxvYESf32lclSIsA
QQrX3glQ+BgjCcnadwH+QPBMiRQyqEjWfSCJwYnbCrRWB7QGWYcDFqwOF9B/68AsYC9ho3OvHWSkICzH
jC5fKkYG7u2zkEg5+EfSTEiHaOrtCqqBPOVUAoznlmwu1gJh/L9GXmYvLZe5tcAKZ/5NMv2Q+hyWyQMD
AT5oiw5SQJrQRgUHLp9bti0hSdgWJhKI6JU9D7clD75SdmCxjCa2Eg1LCA8N9iM2HgQsuoD1/nFEI9sP
nUVkDgSVVhEtBlMI3efILdkRbdV3MdzIIOIWkCVKQjgbg41hgT7QdVLbATt2v7DyiFJA6+sraOs7QmBz
c7e96xEL2QUw69Mg681ubu42F8cFWOvBUOu7SOu1bm5ubijrrwjrqRDroxjrnXcf2F4S65gEkrTrjxNw
64l0P3B3BXjrg2E9REYIIHLIIYcoWFDIIYccSEAIYIMcchAYAgeHjU3qgoAuHHAIeGHCMCJPDlElKABA
xwAANCt8Gh7LB8B4jtCsMFLlxxcoqMCN2SKjxQK1YBjcIs+D/VXBFpUCgw1KHU4VsFyuLmjSJ2Aws2XK
TQEoXLGxDFLp2fV4FPDg9urfLSkOMOf2lyVIGGzl9eea2AEEuOYTr/oRxEY0CB9fysIG7zzOkYzZ6vV3
QNoGcWiKidgHAc+R3dT5Ki+Xs3uGcCyOMp6xHi/NB48HHi0hIs7CGWCHjWEILprkDg4bC8KShRpwCCC7
WLJDKDUIeq8u2WXACXSzrXN6Bfkl5HTMREZP2CGHjAgIEFhfIYccdlAISEAPCzbYGCwSB7JGTwSRsSAI
eMmCHOwk9kZPe5ucLMhFwldFwhCQww4bWCtQCEhWAkTkQC9jUfCL/IsB0QJEHQDxSLx2Sk8lsSmCEqZ6
QQgE1SMES9FbXYCdq+Awhkk8rHwm202nH4nRGehIiwTBGUGHw4QKYKMf9xPnYggBcQQQNmGsirH/LXfI
f9RHjRyrxCz1ZhYJ9SA1NW2vJ0hNVeFaufgdMqDo7kmMQk3IAI2HAbH7i0Y4rUhUp0aSIRmyMA8gKBmS
IRkIEBhIULALBg5v7PuCMIbqE0AvcD8sVcKGeA//LAAHpCMXfrAYha61GMYYH8qdEGzIDhbfRmhPYA+G
ZEiGWFBIEQ1kSEBbCPNk/73A7FCQCFgCcsBjTfkPC2GoGYkTprWLCky4iBkNzIgOJtBhRk1vrGAJ+Z0o
jSEYVIMEtfo0lgQtonqxA+Ds3SyLhSs6T1GA369gvVuF/x1ZMh2RoKFJ8ghoiTtSQbyFUBiFcAqkOdsx
j4V4CiBQTpqT5hg4MBAo5qQ5aUBAGEhpTpqTIFAoeFg0ZyY6cOgKaEhIc9KcYGBYMKoDYOEGSDkAwhXu
CK3NZxgOJYUIBpXALQBo8gYqaqG7EUUPj+ATYGtQN2CLk+AbaMYIdI9F98eFgCMAvaMgU9TsbC8JqEaF
gaeoZzGYQESOTTxD8FsA+w9HTTQUVcBDOBkc9kthxo4TR/weh+L6g4pVA7WTn+8hoDbCHZAgIGILQbfE
ECghJ4ulsO65wbv3JMoVeMLJyclZDXAQOMnJyckYUCBAycnJySgQMIjJycnJOBhAIMnJyclIKFAwycnJ
yVhgYEjJycnJaGhwWBuEz8l4gIu1m4AUxLsghqXEgcTYExOAFlILv8IQRsLkkGU/bWnH4R0hTOjMS7RZ
fGMUsUwax24/pLAXjCRvszEqhpIDG2YfcFhkKBlKCGBKhpKhMCihZCgZIBgZSoaSaBBQBgNkKEBbg4ai
XljQR8Nb5LJIAYc/SAERDq5JfXdWI8Cu0XtOKJqT5myNcAoIeChApDlpTiBQMBBOmpPmQBhIIFDmpDlp
KFgwYGlOmpNgaEhwaKeqhzl4LLcLAhvoY620tQHoS7dELECxS1vcGPLsK0Y/37W7dgg76YJdKO8ceCDC
LXnWLbe1wnZA1i151re1wnZQt7XCe9YteXZgrLXCdni3d3jWBRFYnk/8Uhon3RI+nmBanrV2uiHMOghh
nrWTbglPdjBhnrXwpFvCdkhhnrV2WBKeHZZhCJ52cFYhICfdnrWNPQCZQiZYMLCESw5gaPUUMgHyPUhQ
YckUyShY0QXCkgFoPUXIFHJIIJIBYclQ0WBmMRXCPSgxg4AQkNYgvA4hIAXoJ1DCgLEQU/lQ5wJSQFgn
JYQpaRAnMNl4PVPIJCzccGgCIRRIGkiEVxbkeJ5GMDkSGAknhRAuFyxBCCwMngDkQg4gUMBGhUCrnjBC
LuQoQDmwQGRKnghlkJALeOlCOrAFnhAWorKEdIVwC56wE8LTtRjKhTieyCSwApZ4WBEWU1gSLAgEMEAU
nkcxSBBnT+X5BJ9gzRxDOqE9R59uUJnq2LVgnwAUjLKIUw/QM1f7LRO09GxkAL1VsrqrAJNIUXHs1rke
9LPvZRRDvh5IX79qo6DQv/50BeAt4AX3zzW4j0wW0S50TxCqGCAS8AXFl4loAIouzPABt4DYHQvIewhU
ShwAM6iafBGGFgEMSM8DnUXQ7w//UGgPtoNsg/Aq6gE2JevS11XXFbXbcE1BWaYXiw4LagfVxunrpSuw
20SRWEiJB4tfbuzYzq6Hn4BNWAiSXwaoXBMVkVcZqhIEN+aLb35lWZYN3YuLi4tVsVmWi4uLZzgbVOVK
NtjRuScAnqBMGuwxCmBTVHjzqxE1RS7fW4lOBHRDUYM8whZSALeqbI0Ej1QvqMYF0nheCuhRZVEldwku
EGCqWO7cIAXRjoCQ6+NsjqKC698uLnYwKIhpBa8O2P0AIggFawt1FrPHOgAoGHwF6a41ju/j7g9E8A00
PyESNQaJneBfAv4ySP/Gikb/LAY8L3Xy6+0A4DOA5QKuPEYAT+hk6NpaU16iO4AI5Hh1HaSiw4LIOSYe
NgRwdQuO2ADwb1EBLyoyuiri4whl0Y8IiMKhCI4FQkEEC58pBJMACu24ANVbdsoPBY8B9EgVgOlUNEHt
EgX89kTYBiDJifAdgH/Ds0ge/8MfA3XkxwVNTyG+8HCMb4HEZ1t76Cak/dTbuzthHe8Y3TsdEDIGcwj/
urHdFb0I6+8fQYRjxmwQ4apiMcJUDwA1XMMg/GCieALSW9AOKFQtAGvu/QTtjyiyAVpV9xgz1wQn/dEw
siEWFIUzDBboMFFFXV7/CFCdAB2QAmJ3jKj/4Ga+PWhDQDHnDZesEAAboqgp7BFNFfFlQhv3QTUJTU9M
9ehETxRnP+BB7wTheAafdRHndqHwS7QgPXUHSkbu6wbMojpEMdKvwt9GkgwiPJs4vwav/W74fnSLMf8G
P03iTSESm+uGMEZUuAiWBRArgoYIxxYeQ5dBF7gNjSWJIgiK9YmgNzdjeDi42AW/HuwgRdYIID4IuA59
9rDHGfS/CX2/fwmwFUFagBxQ4Sz6bAS5KFVfMZMo+hCNXLZy07KOFd4x/4FBiO3IBcAuFzcwBnZBo+CW
1OsoxpsJqrsKEui+MlOHH5YC4FCoQIowde9uCYoQT8msQQA9BIDiIaB1IGAhUcTnE6gQcgRJqIrW2Q9v
d25j00U1agBFDv6/ArL/rQDAnP0Z+FpZeBcPuuM7xovqE3MRdI64SOdERQMRKUzGjSokjw8A8AhAxUbQ
d7/4xgmAIF8jVNYxqfr334k44qNJF0G6BuG5TIPyInACYoybQIsNhREBQbFaMdz5B66FYkMbdMQAwQcR
xIOiTHQFOKjIivgUNEVbPUkRwYWgS0vPdJmLEcvbaEHABnVWZBUKBQAvvQJ1FUzrgZ+9DiAqsKvSRCS9
1VzhK0EQTRqnD/lJ/9TwAhRm2evCcYdRhSHIxXtFqOjBvipmOyMoDBAedARVpAEo4Q8YULyhRxBI/zjr
EgQBC4pInDpFdRLn55JUEWlaT9OjcAsJgCBX71UxA4iJGSKCD29pNbE6A2gIFTcFlTobAmBY2IgoEqf9
BUFXARi2XCCCEkF1mGAR/0JFI0wuTGPoScHkA6P49q9NaIsFPUs/T408BuZU8UccYGzPQYcHnH1jv5aN
XwR0Jn+5FLq+3mcXXgGI+dW6KRcB2C4Q1t9LTG23DKL6fXzGEABGYjEmW/gu1ew5xRFhSosp2FJFn6Fh
iMWugAlBuxdfrGU3sAEhcwBOMS0o2Nwr0BNUZIIN2lrTlhQ6YjiDFraEYpyh3z0BxCECakArONG2YWpl
kufuBkQH/PJ2iXTuUjBoUxNf1ccAAdTk2Rw3HSnDFkXdF3wD/P8QJ1/YCwcuHGRtAD2QQbzkui8KXB7w
BccjCmJvU+hBvQUfPkEQAY++UxDAQgwg1BIE6MQZBHFQKJ8CoCNfGMbl/kJHBW0DyF8IIBUIx9sHCgwv
Ac1zvLvdbgoH8A0kABVHBBEmQbnKYBjrIYO+gWfIiI4IWDDo39pxpIB+XTXWDcQYi2yEkYVLdo9PG9YO
g3MhU9IUEKzgj2+eoCVT753+csDhhf0lIiEFMTghAO+LayVV7JLxYUECDWCAvcJIWO/P4TckgofxTyjO
YycfL5BTRs9jbG1IJwB5IGM8ZQBJDsZgzADOY/sYQA7IZI9ifECOMNrIzz3PoDwP+UgNkbB8AX/GA6Mz
LPLvkWKlz2gjkFdZsD0DirbIzx8VsyLaMaop6G4APlNVmPBkCT12A3dKEBCJURiGsGMpiODi1ckBaNF4
ELZ4w5IHkOHa1WJfagGjjSHVDCdjJCuv18LCxm7YNxVZNSEA6ytkGAElQbEbDGNQbxVjBGpJ/NJRuKAy
KIUitqJL9ef+kTyGGhwp1TtFDJMXiAxUi5kEOwIVh8EhACO9GQHBihr/ARzjC98jRQioVGb8BMTXWdPI
Kkk4JL0jCkUADxRnjFIRjYD1qxC8hKknAcHgAwCwqVk/pmPHaig6SBSANPHDcKOhXSlDRQiDMIqHAwrG
D1TEjXMERxpWAEsfqTGieFYfJ3XjLu29VgAXSGgDtwchisbsAmgMWOpERGN3IzcwBRo6CyuwCftgbz0J
OiFe/lsbAvb7Be85KnXb/LFoVO4Wj21Q1Rl0QTEfBckLNE62CPYWwiq3wq6COPSHOSH7gC4IE8D4l2nO
uu+Lt4voMkYDQkMDjIw/hCJBuDTukYIYMDtUi6gYBcFiTEZtUTSDOFn+oE1yBFQcC4hCYajHjm0U1YoZ
SIBl4EYLAnaOMcL9RhTfRFsPQsWJRBRFz1hgTXyuZWySA/tHpot0JBg/BsUeFUBnQ2coqrs//YkMSco3
a0MQLB9YcawfNNRQDlSKUuIsZlAxJPvCyYJYw9o5xV8nBDHrgrsxPwKUgmqDKzxkBGOMPpgsRfBIQCxB
lxU5MgcjVNX9AzkY1XVoWLscZiiHBaGKg/VSu1EsP5hCsGAFVEfE9JvB0fHjAXMPo/ByEtGlIy2euArT
4IMJBVswYoz/i+7zL8lN8mOEN/QbC703thgU/IgWMGlhRY5UKYCnPj2PxloU8QbG0osA8G7D1wjHGBLS
dwUdtn2xiWQICEmb7NCAKEezTlCFyBiUNB1ZEXSMOP/AjAn7YXxmxA8fD/zG7GmBnOY2Daoy3aCqBQws
JB+CBQhMsBjgtlNHIjCB51gG5oZ9n0YpXXK1K/k4KCBWypa/BfysJdH/w0i43+9QBStC7sp+rqJPLwJr
bIJvqZ4VQazPXRwA4ADBENhVZlR0Ic8wIT2Diz+qBx5IIxsQULtw4Wuc4rzbqcxAIG4FfVDTY2wsWwUM
BaDBXyQkGlXrfC4IMU6qAksUdHQtXgRkQ+LAWjDurziJAlHGreE7inht0FtJhU+F23eBqmNtjExAOeux
MPjF4GznfxZqNDc2yqANFTchA2oBgzcMGAW/amAv2+DHgAM04MMHXBAkbh/Agg3DAiYxgeAQjHAQgum5
IprlcKwqOpPzie6FCRXwmM1FUwmCOrZKCe2XWI2gwxGgEIFoGKmKkjCr96zFp2PP/wH1IIlodmq8ERVn
FObA6CFdiLdjaD8NbnMA0ZOCgwKwpBvwm2NvbvovZy5dUwMsxZLdP+gzGDRBVWuGEI09eCFg6lQFAHTo
dWxEdvCZPDJnjYjWuQrZJBVFwLG7IRKLFSMYRfjcJJ9c45kTLgwKCiA5iEkwiFDESy1vUQcFsSVgCWup
dlCIXBvXdVX4CARwBCUpw2oFxeKBMNBpLtyO3XyJBBQSjVCcO1QMdi4LMKMqB648sXiKiDP+8pKJJcjF
g8qWcVdP0R0oohRobWUDH0wB80prctmgYUPxg/knv23aHRwBgtgF2znBDpiQGPusCHHWSCtd8IGfmMCb
hjObjW+AfDlkA5/Rpkw5TCQYikVRO5UlOuGqgJEye4dV1LBR0kHPeWqHgjr0RgezuhHkiWtxCCDPUQME
4hN17oQ2XlE916FQPCQypiLIX7urse09Pek85T8RXqmbnNUhb8ukU/PbITbhiWiHe64BgF1sRv+FTW2U
BqIMp9ULz0toOMKD+Qtu4hkCDwgbioBuwsGlDxYUOHhEAm8EBIEgw4lk+MaEKi6m0+Ao1hi3iMEkCxjG
K80iuKOn1bjZuyshIfXGkO+SqSshzo8MFmsbOYx12OkxAjZiOkj44x7kpGuyiDgHEYnBbSTsw4RMJByG
w0Tkx7HOR2s9TnQ/4TErnMI4myoWKOF1DYvdCAi1YjHbBhOvU8YBbF9agf5ZfmLGDzZtE+lXs7k/AN4K
iBNMbUkNdKRojx3Dw1yDwcEXbxJvh0hjxwAMamnw0cMeBGxtyO4YN4xPCMZqKiEAByPdhFXB64+FPfjd
IKKjdNZwqX/wKAUFW+7GlAHNIJ7GHF8uQWC6FIPmnLjGqAoO290bAfQcdBBC8yMQISn/p3IVA+SDDHhW
wLcjoEUfOcLrcXDYwBJvXnDj4MPrqqgFpoRJb7cAnpEicZRP8EGgKBUFdu2uqS1DPm8ff0mB/WOe7UgB
l3HMDMVJAPH7BIJMOe59ccRb4aAasF/FzwHBhhhCOXN96kIQfM9pQ00phw3YAtVok2ART/g3wnF/B/Zw
cmO7IFtwhRSDVQDPSOJDaEaM3HIcSVSGSL3hudg9AMgBHpIFXwc2QzneK7NzBAPoVp978PsitvBW9XQX
SRDwT6oYzSgJMlEbVAWzGkxq9RdSAABOjSQxVruh+jWP7znetHEcTGQoCZwFYSQVbQFRgpLu7BX1SBG/
jVPwQaCmIe/m16NidNhhhki7EJ6kiL4RZWzvvH/CklS9adyPcwciwUMuV7d+EvgAghkl2n4isGuQW4RN
+H+MkyL4MsRG5LoHA6CQdHf+B+DsJqC4xXcFw1fwPUTkihNdx6B7UdQ1srpSAwIYa5R6bEdbF8eKLcD0
udK4pkhA/OwPBSxeTFrDCL8W+/FB98EWdA0wdWHrGodUBBuH/pzG6g4v2HYWG5GD5/9qq6WFW/ZsibXL
gGQQ1Nj3F9UzCOM8JDlBcb4NQIsXi0D1C2OGPIpj1Uxj08BFMLtMuAmOZRRQY1vPhQQS2tsBFC/Eg/sg
kvfYY2DfW6z0a69bXemxU5TVFaYtuHAXd2CBbglrIp2Z62OfoCtRQYaZR4zBhCDmp3xgANEi3ZVLLKJo
oBhgUJKK6OF05Hy7WPEA1Nggq+4Swi6yuBk+mnBbw6hnJyG5iTTyuAuCCYv9ajQkTi8YoUhkoLM2GxqK
OlEBj59yyAH2VRnc/kyiBw3ScDqK4KkyvdiYSfSkM8oQI3RZ4ki2JDpj84SHgg8RKvwJdHOGRBREztIe
BMeqMv1VpMcA4IkwWPYCdkT/FlCZPgF2fI1P/+hBIYrNtw4guBGVpERjyeBdHastBMiwEIM95X0/t7c2
AHU2CDArLUi4jwMtNgsS/M6F07s/92DOxwUBK1r2g4sFEHVBbhCDEL5jETYS9BFR8xrdcrCo4wZ1Zues
NTVCuyAKG3MI6uRulSxhxIOICr+KAF2lBNHrfAHgGlIQ8F0QBA0RAg59F5lytIsaBOsHMdJtWfQX5Ulj
/ealAS4KeHxiFDH2BX0akBS+wY51ozSCnI+Wc1E/K4iFCr47S4o+ahdKSEnhCAo6THBOO1RBYqnYpOyE
pEi8BdSRSnXa4vbrhAXRYSxV/ThYLtvCn6aNR+CD+IsNB/8/d5Bm1A/HdN6LuiKIR8f/WpZ0qb5wInmB
fxD/MHcNYRv8gCPrEfZHCJ4QNahC1m2AuIMgKEIRhhxiSEGZiEYi4y0a4bkmWeJ7ibQkfVh1aTYH/8fH
X1Wmdoe/QnZ+aw0dAi4QeQRkP4GqWBO/xE/DkHYPa/WKYGctGfO4528NbM2NEtn3MXSGY/rrRUES6jC+
AUTQZ/zRqOrqBYn+7LAsuLmCmlFiTHAVcCBqKLUEHwxUAFxTeEUCDly4ZKwopTHtI9V9hDejPZ4os3es
icUbUDHIwRw9GUQXCTipNhQbeqRuP+gegtpJjN/khwsDPniMD7RLQSZDH9iCBHxDKHQKFzhFfu866wAI
DrUNW3DrvEu96YLiLeWLUIdITHas62T7SgdHicVGH4KPAjj/8EipIsYqXA4E1AJwmEzrV3OEdmdVT8av
KcbzAAJaFy9QKGAnVGC4LjgHgoBF0SjdtQ4GoUZ0ft+CqktAnVIDLonoqidR9CCjhMAqOhB0JSSAHwWd
tOp0N0dBzYJm2QbpgKiAKaSIOKsg/KxiQNEEDPPiMKDaB7zf4EmqEyBaCFcJCIJUad1dMKqiMLSSk6I6
iaIQ/8PGA8CQrKXT130VVDuDeuEzIK6roBskQygvJgywBAtUc+IXWXV0WAWF/7zXfAFo2Ey2T9fRQ1aD
u5A4VfRJp+V4FmIb1AUi6S3/g0XRpiJKKU/r6mlWcEF/cUmVcQkuFAFjKFQs6w1WATS+6odI3IqqBv8W
Ae2KIL0AnevOWpxosijq/rin9R9dgni/09vqSXX1mQogBim+kzO+QYtE2IuBS/YjwWyQz8Z63HlEaAdA
hHQSBohmxAmwtQhgCQOt7zkj9UKCBg9fVx9g3RBAhyUhABf3dRuAxAXBD1oYsAggLCFW6ann4oAcyVFM
GCOCDzmVIIPuCSaK4KYeAnzAzfaYAFZDAEk2ti+7xW0JgjfBUwNCqFdUvG0K6wzA7OfiKX5K1c18eidR
C7CjiyZBvABrXygPt9uuskZiTb4lSEqVKGoqtstvKCKVSqEHw4tK91GhqgT/AQ4q/YW1yBATK90A2z/D
AYeqjhCDwBzg3GJBtxjbKL4OEVHLWewPdQMAOkP/1/GDyNEbAcsW6+xQCAAcuFELiyr4VvK8EYPqMJT/
0H+7Jj3MAAx3FGvw9oHGfDnyfwdrCgDQ4MAKAbPc2mhHF7P/wczrzA0Hijp2ZETM1nXR+g0oasT6wyc9
/Q4aFhR1dTnRfXEbQKGKd7Fa9rzTKcu6JvgsIBj9j4H7ADTxUjFtfg9G00pJALRPBSCbJxdApNgXmhgu
hBNR/f78fRyB6xDr4KRYFRAwFlXDoi8plkWJx5jcFqJcRDodH9usXFGAa88GhzJBkAPsBzGCjX692cDb
pNvQNvRA0LOt3dtddBG7B6EC1wWcliXg6zDXFREJlAoXqOIBRYWCBsQbUbrgC3IcJoBylxUVcx7zZNro
bChu18X7sAaqHocxEGrREb2fX//IWV5pkn+oANdEF0czNnjh50Y6g+dbD0XYAnvurIEgCDkZLgYo/n1b
Iv8YRHpFjX0DGKOijiO+XOcWDAWKmHyw/vFTUb9NfTNZSWPVnRSFGFsnhN5h7sWGD0M/N0JUFXO3P/AA
Cj/hhKJw/CZN23/uPfSJHGpoycfDwdjABHGL/1ha2e7ZydvpepkE/2zcyi2FRYPyIEHfYfoBik+IgacI
2QV/bhMBcOYC9sfZWMpQuUQTvvwOXYnDRx13NrgPi9ImKf4BQYXYGlfYyev1+8LCxz6AOC11PcqE2OLe
wm1aw99aBwPrBNzC3upMMAsu3iuIBpkrKEq8wG9M3QzB+FPQogQuqZhtQcEX7nADoHxCpjtsLsBzAyD6
hm3bwQkMC8Y/ekbKCgVDEbdoPXD+hlu2IF6CiHI12ZXptwHit6rP4CDB+h+ACwFxewiD4rTCK89BD7rb
7Y1XDwb+2VleZoBe6lWlgNJ7gDeE2u1CF+5c7NlsBdtcbNsGlu4HXkSINGMj2mQDCgv/jtoMBoZvQgGI
CtjKdR08D9FuUMCawWmEyY7tJhdvd38FRXzdQgLGIfj+LrYuHHvnwuuwdfnd2AFICwsQXTYMuoZ/2fW4
oOLCTCkfY8sFKLWlUudufp3KU3vXRahBEjWNXCsCI/S+VQFdyh19V8NNKdNDSMLfuBwrRo08K/77Ao5T
Uf0LzISRwDgp60MzTTF5yTAAAeEggm+bRW85e1UpbhEAWs3CzD+J2oa1BygHRLI9MA4AzWa4mNpkkik5
TO+PsfUKqf7YiQvYDYGghacTimzQHKWAYlAVSjiUoCEzPBW0DqJh2Gv03Dz2hELEqEkrX8oSBwRDxcLf
fB7EQhCHwuoEYquqTkFJ/I0dHTjF7d9H3umnKscg/NvqetJ10KCLYIrKZQoRbAsAxLdeAMqaOyBPFQCl
BvPZ3wBU3wJ+/A9OzlP9dxiLF4DWUUVd71aOoipQU13hmypa4POJV97jYIlFAoq2Bf3tDKJtgVZLMk0J
fu6DIviNOe538CnOY7sOimCta4najUPfCjzgHbkJLNYDRI1YAWsjik4Nr53c2y4sxJWJH4NceL8kRupY
1F332XLqG60AFjzP6Q5wISB+u/9ITL6o0/6FSwFBoTGJmh9VxCWCi4zCBPgSADQG0+/GiXL8B0QtbktM
If7izYul9nDcg31QVbzN6rcq0IStByg2IuPAhgFo/mZE1dUbhQpEC1SCwVzirY3+iTl6D0/y57IBERS4
N7SCv4TSwoKXCOp/AfVzJA+2KmqeEKO4r1u1gEJq3/tHIqBUVJiw0A6W7wh+Qf/S9K1tVHuuWnKVCIdL
VXWlwOAOZ34xiLhtC8fbE8GrIdELVeU6tiuDqWMrPG4AK/oC/g+C6rZBQWaNd4UEIBZF3HpAAnyFAhq/
Bpn38WheU6nVjIZaVZS+ft9bowDx0Wv2CnOLoUKDijmwMbrciKht0uLT041B6mwTNIjGJYTsGaiXqsOl
yIH+QNA5zaODL/1zDvZB/AHD2y2Zk68Gav7CEm51ByrRSTnDcg91F0tcIvhC2XPGdfcQZlvibR1bJcfY
CVWarI1K/qkS9gh7qXXN7vrBBTbf3+kn9gtfeHoGdTg5608BrTGBOf/JdkCwcOF2H6rpBAwEIhGNj5/N
dgvHPvYDEDY2Qv8u2VsoAhxVyjJMEdFGr3VMG4iwZ9CF1mtxqdGj6NSHw341ivYGTvj8fC6pa/qtvUTP
KcPtEO8C/8v2wggwIGIENz9tdpsoqBWdVFoxyUc4hAhkVnVpweuXaIqo709jr2PJhaZuW8cgVmZ1mfPL
gOFYA0K4y8H7y6bWuFTtHNtUBuxqijfaSDksUdrrL4orLdhce8FjE9klyJwqghYVY20CUDh7tBfW9QEQ
dU6N08JRolfhsAF6ZZM3YqswsBG6aX8pcy994sI5046Ar0hMGAGOiAuH3jGlTHUeuAuCyEYEZwvEwCRD
Mhh6U9RFvE/I62YZbDrYGjyqe3uJ3kSYQQwagX5273bcKFMpwoh/CJvGADDrG5Qg3O1BKC9tiFJQOGgD
Xw8qKEXhwCuY2hEMuwsEiED/bW2wzy4AOcNvRQHZFeiDcEpgksEpyYnBwAiBWevABF4EGip/NMGKP9yG
g39MZriH6Eg7NjbhqJ/ze0gTbBGF3wcf7UwSd0vIWFS8FLGNRwkNQUNVtN/VDYDBLlAMdhne8y8BlIGy
tEcIxiBu3QJ6g2kwC1cJDB1EHO/+BA1ijMLHjuuuhdv+LHQMHiNuQjVTjd17ugEexLt1vRxNHkAofjx3
CiC2ERQJdIA4hC2fdk7zOxFEK60iYmd/2ILj02Vj0oPrCWi7gwkV8I1TCUU9e4eLXQmLiOwG5+02erHs
5pDwdA+DULVA0Ru9sOgrG5kzJgr35bcfCgsISH0L+XZPm8nGAhcBmAEhjj3oTbT/fpSF29gcwoNtAB5S
jLGADQHzKCbQ8T51Zwkeic4bGTkI9ppmtgLQ7Skbtu2evMPUh/vxEun5EIsg8RIAP6oyvqg4IzUwGhgS
C7kgdwYAuKixY6Bo1IB9EMEWVLk9lx0EKxhYnhGUIahCMz2gA2YB5hds9YInImSJDSGgHgEuQMWroAF4
9IyohhS1cpGEKBqVhRqkZUULAeD+UBRPFJJShkEB3EGoeKSA2gKR4ahCFZwnz4EI+AZYIDwldBzaM6Dq
P3Dr5YB4ASWl4LAoahMZcG6h2FZoJeRYH/VbgJo9dRg0d8ViqBBLr1Hf60MiPJkqDEz2MVuxTwaqKYmS
RQe+tuOlEn3G6zBBjHcZayNV5eACJA6VFAUYVhWKvN0qtoP/xMv/DTa+iV4EKkQIY0Tc2irYQwjY6XX5
H4rg3wvEgPoqX4tT6xV2K8CNDnPwZTvT4jn7ewM+CdXrznFIAUgvMIP5cvYRRWQ/thh37QHuB8eEl0Dc
BjENC6JGsx8IRy+8/cHiBPa8FwBQGFhhWC98gSYBCIjtRpJd/mbGgB90dC3iiw+7yifRBnxXEAsR7Va5
bUNHtkrhTghUOqr6x7uKY7F5IIHNRUH33+uDqqe7z3wkcD3hwnYj9qnHWJJS+8TJ/2djht/C6o0u9YxB
rf+M2rZLviboAjIZA+gsV0QSILnOyd1CNuWW20xjjPJjv8hLTIr0z01jzXQyhlXFERYYUbEl6wRR1E0K
BkCHSFbsuzTVqsHQPRObGwWLQEBk70UuJo3aQcOAOFS0EJeJO7EXoE/dEIPqWjkPh4kKglYBZfW2BJ2t
TL61a9I6AAh2sWlBjAH6BLSIWjcCW1qixFKmd+qOwoONWiSVMUUbuIjv3VUgeGrpDgkuxksFnFssQok0
s0MQpu3B4/QDp2hENCmK7o4dgw6neusy/XUI1MIDqmJ4+wNApmbzUKG264gAdjDAe1O6UH8ExEzrUOsL
8TCCRFDnhck2aNHQ6UCpw6epwBvQDgBxA3Uw4wA74NvfRRfDieglgffF26J9QVlFzxm/xkAHxG838JDm
34cmKloGJgrkWgGxh1ibnxgVWwF9SgrsFowoTpMg6XtYG9nZD2YQgw89onp2lO9jxNP0AOrCErUQkkAU
Jmj57HFTw77HyIPNCCiPTI20RNPuGc017ZiD4RfQ2noLMCtxx4jLJc5bFGACBAUKCFeJ/hw+QYge6+S0
CVQc4S2Wq4YAFI8mahMztwYIEwzWBLsDXRAYtj4Bh1PJhrUTqGzfCnAB7ojCXBPsrRAFU49cFuvnSfcq
SRddTbM04t0At9XBTOXCD4wWOaKE3aBKAVz7bALVGzb32LtfFGIX+0LuD7rlCxJU+YWB6d6KxyeJ6Arv
tqGbY6njhUTdTNDrCn2bLAB4z4WbSLQwTlQFjx9EFbzB+USLTKYuKIKvWsgKpQdwo3RG9sKbz2GiIhgF
qpg6cxUgSgCofjdKVGUrhNIlkPcRQYAIjALDFwq8LslMKfD4BwJaC2mKP33de9iQ7duB5UyYNqy5BLCN
nc6sOoghv7slCBYbvCo3kQVaCIJhprY4wl2MLjYAzajrGUz7ALiICExbCqK2xk2g48IaA4oHnZi+AbcC
Yg+7D0nxQpp86b0IultfBiF5C0F25ibbiOOswZidS3oHNTAssnt8HA0CQa7TazgRKAkBK2MHi60RNffx
aJJmH4pt0osz5glIBIPDNQLbE9O09MAkXQBUCX7ZmEztEi4U7gwmGevBfGCRDnKA4v+06wYEVKGAQ1X6
UfyuielEd32yuL5KDrg2WFoZIQRSoOIl7MDcg1PrDjgihhX+DPWIeJhoehcAoy/dNXtBkM9/6UzNKdiF
HjYyBAqFGTFQ4lJT0RGKMGhM+DARJDo+NEA2gaBRqrYUWYCPYXG+IIY9WA+qtjEi0xj7UBYhKBNUphWQ
Lxi5Lpc1MAgQwMOOUJVv1wKCu77CY+KGxA9G7DwkTInqnhoycshJIAAgDB5izTTcNvsiiihAw3+MLooQ
UY5Ldg34AwZ3YUKLNIDnvqoCA261z4jeUgQmw8AgBamqlxIKddlraLNbzEsXE3TsOmQGiQhc7nTrsl1L
9uPZMRvM/y2B/Xp3460RbZgL16kHHTOCvaZFMfbfNzF3NDyEsjHdfjBhMMaP2FK93+pedMlauxsVFno6
AdZPcrCnmFFVedlmVVFTL5tkEAmrAH9kqCVFA6UFEC8eWsvMAgoisAp2APUEfNb0OExc1ISIutz0FECu
krxNhIeIHDQcx0s6Kk5w86WHRvlqqWfse4ku75SAbYWqWMWSgUYUCwVwgQkAAGgrDJ1mvcAFNnEEQxx/
RuDfuFByQMFUen1gIAyUA4bhaapiKXdYKFA2kKoYIG0t1YZUxVhUMwIIEhtmHA9ZQ4UpbVn5dWYbULST
NA8LtQTvo1/Y9Kg894MITLtJVUhB2VgQNEk4iXMDwQbIAG9uSxTxPsa6L3FF2a9V7doLRMNGwXQIaoQ6
XKj/gcRY72oYUQ23AAXHon6LnwtQKYofgBuL1AoThm/D7xkWvAVovrbopU6m4BXQO/xaCnSl2wErHGsI
yAOJYdLka63oByIVOsQSkGwlYsZdRZsVmIA4OKuoJXgEluiIIFhUMFmoGgYA6l0MbQFhxm7RqbVV1Al1
xceK4FFHV42QGTUGl265OkhEMNWjqYpR/vg2gA4e+jD/T6Sggpy9uQqojCI6hJYGJQMAYjHQN3UAAekQ
UNURnarKjW1BtsvAGC9WW6O7SQKAZUEPsBCpHp7VpwA7PguoViYX70nRgBsQ4Qpkr99TBbWClzPAroGK
74sceA/HFvhbAP/NTo00O4jlMuXrp6RqEHeVZpCABEFNdJePiBYiiCIHiBfElzb2dR/rX6pjRCGaRpcM
CgRwgh3jhYVw9SJlEuIciiEQwfPDR/sGxzZh8S50esrWSbgBAPgW0QZNoqT6B3ZqFy2qoTUzWSRCi2Bb
wB+AAA+L4C2ixCFPDUlJuVXRaNapAK+hULwgZzKGTADUDXb30CYbhQgIQOwes1V33bGtqkj2ApZ6ryoi
NgAQoQHXcLOAun/Pvx9AUDuo6MEBfbOotp7ptt+1KtEXKsA0KDjBdSn7C9bA1VhHEsh1FvZuTUA1Itc3
McCfENXB7ynIV41UF8kABYf/MJ99KgqHYpCQI6IEFRT+QkIQ3gAy+nXtJGCTMFRvKlNEYmw3wpicTDZt
hMAQkwaBepdvHukI1wNdVLPJGfAHV/YKQ1jowwd15r9ibxeAhSpzE9fPSUwRkIS6VvwFLFAoVkwxNqKw
FNfSO1TKtGFrH2sp+gsFCUrQdTGEwkb/2Il0YIviVb/Oi4ywIfo6Si8xz53KaLd2M4DM99cJDwn6OACe
q1gz16+brAhioewS9yKi7tgPdATB8eiEgk6eQNUBP8KQiF9XFjjCdRw2hO6NhD8G6yAwHGEbkkXVD9B0
6inQ7wGkpKiPiM4AgsdMsCD4bKxdxWo52HIboAauMebZdTDBIEYVOB0YKxdVz83u2KwHAsXkRSEAYIlI
f/8FilywmRyRhIGF7B3/AESPv7G9o316gD8ABFHrBYA4CWciqNAUi6igGMJLWAAQXEi+mYgvRGhMApGO
hfJ1GyFhD5NHdxAaB4LqCFxNdhMKahQw770FPybctXX33sbrmDNOWlZfh12+aKkeDVxPjeTB3/g7KBGV
wEWEwXQ+1XQh6zgJYkYQ344vCmpvxh8UTQLq8HUfHkEZlGvYvb3MPkyNRgpOAezQXxAwikb5M45gI+KI
OvMcaoEYhP2Qls/CS9QBGfDV2F/CxJcUQW9TifVRHYZQ3q8QAQpMjqVQruLrmo58sE8R8QK7chT3AXQQ
PGvFDKSUC3X0oQliRrZx4nkB1OF2BaQZdfsFULyAwIRfC1Uy8JnRYJfeFqrVUvT//fOkfUfmwLIWCJvG
lSB4d9c4wGV+d3jtcECIN32raoXhMWt2Y2aJblUXqC1OF/2EdlU3gqDbDAML+Tx2SXnpblQMB0gN8R52
O3v7vq4PAxcR4QTpFj52JBLva5quHwMnLzcZwQTE9nqeydHZfdEP4uzujRP4EQTRdQvZq+5Sia1/w7On
g+Jf+l1NdHBHKtHO69+LBScP0QQHAXKcjr+AAcALAIkPsReDHzQzlhS1jYKyrvHewBhI0I2KJS0lGV36
xg85S2D/zol931M4FAO61PAEwQeZNChSS1677yyw1BIA4iJQ0GqITAWAXN4LvDgBLAdGTAVse8RSSZDg
ZQBaKt2220WxB1tBtnXB6L/uuyHReTO4IfBdPX50IwBNIUCCCN1PAINuwxawuenGyZQ+EQANhcntvYsC
FX5D8FO4Zd7BjQ9D0/+8GE0ECosXOYZSg947UPOQpTfDCVrXpe98TYV+8Mi77Y1dYNMSyb3WvAWTEw9V
8TnDdRqK6HJht28weenP4Azr4Dl701jBCG+Dz2SLRwwVdWyiql35bwyzuBWg9uPsuPAJGWvgg5i9B/9D
CNYRuv3YYRGZ1gUKi1MM98JfpyXiGMzJJFecDgBH9dXr51qKRoMUsBX0DBD6ABG3FmTdiwZUvBDBq7/U
ShB59gXUBrcCJcCY1FYIIkf8vpCzs4PEogOlJo9BuISNMFbyjUI0YwJFhDNJVJlqGh4/CAJH7InQ2yVq
QtCz1boC1obuWCxkDonoIBN+hCXi2N1YvYcH+3Xc3IFUApX/dvBCcSgMzPYGD66JTlUnUTD/WEArqCC4
vn54Noo0DCUMO0E43uK1AQKh8Z7fgXoIJkGbo1QpFnZJxULUGGkQWsOO4tDzuvpiScsORHTQGv5FOoWC
CSDw5zRaAqBnYutToyAoRHUMXJ4tIkvQtgJJiyoYREOgb6QCnG8LQPLUQFTddQYSKKUoEkE1HrB7sbBa
om09eZ4UM9gO4EMxqDNdLL8fFPAFOKsXuiwBdQxBAbEJ5BJW4So21fABoo8xoq9isfaBnIhjFRm23c03
0TAAQctaC0H3HdVR0cT7m83F/JTomuoEdFuLXgp9igQ8yjUBCCSJNUc3F6z2fwxv8EQqQCuH8aCLzUIY
I0UfKBy2M7HDEVyhEiNddbjlVCiTYzXoqq0oYg0TxikvVWiYxG8gLD45LSGIItXDi4GORUGMYhNoG4Qo
MFCuCCMqbMGkKOpHSQUxoK9EOCNEg40Q2xBOeWqvIVZa7D7CwZhELVQEjTOKIQcYrgtuE4g1VMHrExSW
0KV+T46kYrXFReHsRaABW5x8ocuDCopudtpTBMh9bW8pwAGbsXoUfYuKU/FjgPRKFOt2hWGivek7eqoi
CEwxUCJFt07m2HW+g/CiO+zBKhC+Aw/rfEt0B6GrHX20ROjbLDF+jRNLHxd1Ece4qRgYNn1EiegADAcE
blVMiJ3aAJ+2if3qifTvBIsgWjWj4I3TJwmLVShrg8m+AalCVUXqiwGpqKYWitdymQa7DJVg7XoYDlQt
AN2JCet2zHuDKAYtcRLrzC5ABQfiGsltQyjIiJwPAA5GFTxOCIBIiYqGsPRq0QzNa1OACya8uQFVqmAI
BAiYsBC9Q2sU9A4TSwKkA4UWwWjXnqa1xwcMigjiQsH+SHYV+1eBu+kfdQ7XIIAJxjGtDIIXdDfDiE4r
4R6+i4CIvv8QbgAsgyBCHGwIONtQtriIrfMB0b2jIRWeASELkCMRxAkIylNJv4g44f0gAAHYeYsV4FoE
vBcR7QYXAEpBtWI88ZfgdRtFHSoeEfYF9VANRbv8IYkcHKpsFRVuC+saTec5UMx1S3jRJfgcGGBwQE+W
WuO4EQeCKIHComhqQqS+59cm3RGLdFkyxXwEMYotYKMnKd00ALPHtuDNiK3HBBHyDUW9FIw5xHXAANje
9rr/w8yIP4UGI9g4CWrBCnqYc8EkAmgFgFBwzYGciwoEAhcNF0pUZkDtMfaPpNhxAop/6y9XBIyAwToI
6xwnORaiIbTiZSf9AeoHCRmD+K+maesPisTbhDzL+fbECNkgkrB9kaXlMAsFHHqpBov3gYHggPiaRdRN
cUMgSS0nBxuqR417JmegAWTig84G1+oNBZS6GehSx/cdL9yi2sAERJ106UV1IbQsiHYNI0ktv2uvKwYR
bnOTIHVlQYDhBF4iWtV1N0EqHnIHutqLCu7TeImkLRLVCcYLB/v8gb1QF/APBUvrKMdDFKg3NhYC3+3p
VS9Rog0RA9kcCrgjQRBtEqsT1YQM0XMMjHwNSM0UdTKht6FF7Btl+G513is4ICKARlT6tFwtxjIG5vy4
mgtgaxAC5w3gVt02gv3nYIHlc1i4hzDfZnVbwz+iGbo2P3vE4mLaoWPbIMz/ixL9FFwLrxEeO0o4cZ/7
TYEoYAenzkYnsTZRHUAV/GfpGHy1CGaSn6lxwoVA0JiIU60QpB2FxShkTFLQa9huflg4Ew92JX6+ROvW
ckp8wQgvVxQAeRS77wDsF8dHPi1A5qeNSxhKUIkoyXU4UoES9mUPgfkt9YQL5dGoj8HCs28z1xfpCz3R
uINNhyNVbRBGp8vgG7n2ugpnBNAOCW5F+BHREsq4JXUegTviW6qACeTyjbiQuLmoTcX7uBH7vEFsC59y
/d/HIIHLHKjaOAE7gDQggkIbIEUQoeO3W17Rs4HhrQnZtEp4DNfQVEIc2wxWAN0M3DDmDHVFEpHrOIIG
BYzwP2SwRQEtyRXOxuFjdEsEN/fWgeasrnIMbMcHrA8FQHxK7aNGH+0H673VIFbB9qivsJy8EW2XT0og
A3ImciB0LOagNnNx+AwdR2qEAgd0DIdfuKSPQXqYW5kFT3h3YkjAthMQBARlOD1jqbWZqQha6xCnEXCJ
Kt6J9hHj9gmkAqkBH38EtugEDkGlNeqK3w+XrYHmmDt1OMGprcKNgqtOz6wRi+rh5giAEwqJR8ALF1Xw
qavJruJYlWgRRRuB48oFAB8ORdiFJiBYIAJFZWwAAAd50YWgVcA7GOqTixMV0KDAxmNQx4RPh4HFEqIG
hcLWXc1w+Ouh20B0pg4agELEEk0etgo4qRWht+vHGz6WHvjYXbvHdeDrhsKEFi0qG5SM2tZFG0Hq6yGH
JcEbiSLaFZXgG8JGG4JbjZsr95uCfwXB6x90Nx6hvIZmEQ9r8FPZXLhI8V8KWQFIeiEVBTHAQwiAgUHb
8DASVStKC7j8CByBYNR0qeVWAk8/ChaqbuxvOtaJFyASF4sTXDRELEApIxTrBbFZD/cPGSyEC2wVKEAZ
geJ72ErSb/oFdeH4BAQN8ADsGzNEhekm3+DksLZBFYAABLFtTyf9q4sX3n+Qf3k9YECpPq50FupjkcZw
rWzMycPRbOvD0cNElmBPmcqAF6AqDL9qjXFFjcXC/3XB9oE3BVM1bAjWeDqBaEC4BZTpp8CAaSSUAkNo
MF8Qq2F0CsfiyRqEjzG4TYP/Thr1x60cEJlutkI7QQ4sfkCIekgxwCyQ2MXGElz6XjLbiTKOAa6VhdUk
mKthFiYaINJ/4gHhogDcdQXCA1bVNVpqCrnh6+u6C6XgeTMFUhfDH0oHcjsqlV/ADT8Kh4HR7+oviwU5
/SBODGDAQkZO0sMNAkC0LK/hIECMUDfw8QCxiaKuvwNANIiD8lpZ6Ioegyj1ig9E+BYYvvt6Xj3/AVUZ
0ntyWtEvqGH/wuTRqm4q3w8l8LjRigoE5JkeiQsE53QV/Pt1E4dqQKh5Q9KWFc3g47hPbNWhemuL9CZh
gDsvqq2g+A4CMBL/OQh6GH22nM2IcAE0pEiqqFjUM5a4JzACtVEZaQUI5BTAoQpTgCXYPdyJK9Fqyvdi
HxCHtt3C5akRFoPHKiaZ5FAWLWPKFAZE0wpxP/4LXYM6uNwr6kqWx4A+AsMFlbuxQ4jdPiuwPQf+Ebja
wn7UBLUugrYgiVuKxj7ta1sYTIOwKIOJoFgsEgb24qZeUUi3CFVT3wI1Ib70WzqLi8fo2B1cBi1FaYQH
IF4UXXTh90EhwwYpKl5V3FYrRSj5HEVEo5JrLtRWquASfVdVEG7hDKDUbYbSUHbDRLkaQt1Ko9h+ilxE
MdilH4VowSB6FES7VkSkXAYTFL10qaLyTyiuBdfhE0SrqjoKlAo8QXxeizCD/pLZQSgaUbmoby3A6aXv
T73/UtnxqpYooHziLwIVL9QNNYH+UQMLGAjodSL4DMUubREAAnYogf6oVgXwYMfABIVY7/PPQ+oliC1d
yYIg652v3K2p5gcrBWVxYbBk2JpFIBpKQSv6nGxv9wpC7Q0mChEvMJxuwgueBTj8jBUhxz7HLnv6+SML
/A0EKhUFNPxuYzjIUQXjHo1yTdjnoiWgy8hEL3UF3FnbNuQGf1jPO7a9wAiiPMgyPeEG3JECHoQQ9166
+w5SRAsFpnU9yk71XTfGPZ4Tdh5BuiKr/4IcDYVg0DH/uAkY7GVRxq25B1huDfGKC0pMuEFvNBXgKG3v
EBUlA2zNhFykZIrdUjnuegZoC0sFgbtigD+BgfdESxELN+undkIHrB3qsNfDsLAdgo5teq/EWLjnc7o8
x29ABMVs+ZDGBy/tNnAloqht8JCJmoolJ8gWTN8Xtlu3icF7AnlBiGHn1onyWwXUbsjNzADRH8GOKByu
Affi6zooUa1h8TW5G0BEKvjGBAdnpaD2BpuNQf8gRhJA8LvBI40EkgHAKX3QpejbMC1CiDQHf93zvRax
M/9sAkFwOGoc6wO2ifdbyk0NTgFQqHsZg6/1ql/y29P2hgCwgB3vX44FnChoWbIsjfCDAio1urj9UcEq
QSveneKLEkZRuFVdVcChXnRIgQqxDbPmHac1hjP9pVpFo1JcMhgE390NbRC+ABAw0xnHILjU0ZvT5h45
1gbBY0SVD0PeQf7AIDiJ3iOyRIMFKySKW+RAWF0A4YyTAdCfBXk3By0icDwylCVlKTi9QIBpgfgBb+tV
DQBAGQmIQe1MLdOxQakJdCYiVSVBxwkqX6kRK0mQYkQFbccr3f5uLuYr4d6+tvhiNApIu10sCmFGiVXK
NZ4C/ip6F1exjWaOVCUjh3ExwGA4WMAXDJBVSr9jfbhy992aIeiTOcdTs0SAKsIIrfszpMy2OQkRLNsF
hzeKDtoNZCBPjXw+DAuINzIds1gUxIWu9hg0IesUXIgc0BNQ+EGkoLiBdTYaQBQ2AC4DeImKANcUo1Nf
KGAUXbd78GfbCeCju/dsUmbPFOC+kDWNL5A9emEIiM7bC8AGVDkIMfBBo3BBE3UgWKBQ5Yn4Agj2zT9B
2E+QC3vCMwgxwBcWWoqOMBOy0YMIwbVgKZvowV6eFUHDcehmaIy4QBVf5T/oCfCIqFCl1HbKtkQYg3nD
HvpKTKoAsgPYmivwGSFQqCCUKiiTtUtNROoogA3uD6pToArRK66mbR9FcXxEwUXhomNFDaEwuN3ZDbzg
NzAc2A2Ga7cV+0b/YEXdgyt4WV7rLET6F2B76yQ2+Ty30XQa3dhmEyUq2BSAId7YHNBtZg0FiRcieywF
0CcKvFvD/hFRZ63sdQK8WVpmTeqPi4uPjOFQA1oBCiUUS2sdC+K/VLT5KSLs4jUUrJcHxHqBQ0sAX8NA
pbynOsFWg9MrU5i2FiYqpagoAUgEsYucdQsoItHsf+tHD7riHnMsN5SxEECE1MTmT/TBYP7Flvatz1uA
Al24thGIyS9vEPTUywkCo+u/go0FQGDDktgEb4ONhwfBcyYMiq2kqEqVhD5ALTp/eFqQAdDQOANtJGBl
8WN/eKCl9eILYNeavfAYBgS8pkG+FIdwq6iahUfpZyihA1JQ1OVJY7tUjYSHZC0B1FWsi1Nxe3imvO5y
KAIMsb1NOP5qTljdA1Ngx15DNxFLdEpTJ1JAJ4MLEABuBFP9AlXiFluEHkwICOtRFN4ldFUIcytBRCtq
e+CGbhVo/KG0AUXtHQmK3UUIx7W2eihMEB1IFFmLQYMIDtmFr4JKVa/U36rqAnKoCDfIIIkHoBYqB9PG
R0lxdgFLRxBzR+7ClSjdR6VHzbGrHhJQ0SdVUxeVolIl7fqcdKwZFB50GZzaRMATNgFbXVya0KQOkYY/
hGP/CkITQJXuX1TR6QvQRXMRxYtugIF5CaCziq2557gQt0ChQZUlxaI7VlFT/wxuuTU1ohPErosOddnd
kYEGFItSJxWsqkyIf5qiHwB0eROOBRkAZYorhAEEh4pqNj4iyKW1eZB5UASOAGMOTJnKQyWKE6NhFMS/
yh9KqN9oEWBqJl5fdSJ7qjEpk9CxySF/QWoWLLMoBHQS4NYBAEoNBH26bkX3D1pFwusVFnVupPMpqGev
bBZEwpoATQAmw0wFW/SImHZwHI0COFHKChG8sXr5Mhf0qdhCB8okZYsclVqADRrdZxx3wwERGAxSKCQJ
kOaFZ7jGXxdhwMi4xjBXwYhRBzAEmIoFBy+rPQPDsAJ2j9EOuJ5gKAwFRF32RuqlbDV+ZnuMBqu4sQJ4
uawJ2ElndEdFnRUf100KUncAjllgYv/iWqfxcCqIDjv9t6lJBQck9dYpapuCwsCERHROxgR8F4ppx+qb
PREQAW7yuOTeB/tWwwerJXUohe0fdR0IsFURlGAWpoLuNmnm6AMLmIywmLVA9gVFDyEqTL1p8ZBUQ0R8
4CFSvBqU7o2x43URtrtMh9EXC4goQRBGxK3i29PQKXWWBM0scPZ3uE2LHABNhdsiRepLqLYuASjaSSkg
JalcpAsUaWJUlaFZL7qMom+RNi1TNusa9w8IIHb4Ai2bLSJoUPz6QyXcwnQgpwIYnMWbflBR3fYDaidq
EKoGiWcfdeDSuiPgBSGsCYgolQsYesAPP4K/D5JFAuTrIhf7BF5RdGNnPAkFN4D3CyLdWPg1AO8ulB9o
AxAaBnRddme6twsE+/Cpb3RaCPwuOyAOSOp10YqUwoCOKHjownUGUW+lfZRQMcDPg2qLAUkDAYA4FfS6
Pt9FomCpJIV/2GQA8BOuX9EPK7zgSrgEUQRN4HyQCLqiw1qgqCiwVcCaz+ZgBcAOuOscfxYUtCIjl9Th
haD12A+GEhQUqsLCkwigb0v6Dwmj9nPccOE73o6+BgS+o8Zzz2ZgfwZNoIovo8dBizft4LXBVzEMFwGk
gTg5oNKqyMIOoNAkl21Bti2xRdE8he7b556EqCoh1/ZGAlRt3xapDRtGBGYlF2YUBSIHHB1i8PEcB8FN
fLZJQF3qCbn4RgwvwQB7sG6LNAZxufiw0aLoTEc4uwEiBWyIREbAvWE+OO0cf9+9YjO1+hFuQwCgB4mw
DIv6EkDZGy2A35tdCD6Qwr1RWbgBQFAinoW9YEmiKlXR9x3EILjBJSD5Bk6Ag2OfeKMERwG4RIgPJI1B
uGjAjgDux7Zluhuydggy15zBL8Rf9tsMLOCIConBPOE/iEIChQJ6i7QagIhKkGCbinQ9AO13Nmi1yMvI
EvADuAQXfcj3+03hPzVPAQ0GAusPmFAwGAxUunCEhrUFxDRHU0UgiEArKUESCD7itEtuSyBYAicSwO6h
ihJd3w5QW4agSQXf5ydwCQTJDkK9b0AHgmuYVT3p7HaDPdggABE9heILWww40W01xlnpz8NL+3UDKl65
kYHsYO8XY8KFYIHrCxtY2oj9d+RMKdwXN8QfC2UhA6A1AMkjC9kEBwABACaH5OQSACT//pgbssMHgADA
MwMN2ZAcgAFnP5ANyZAH/woAwYbs5CIAIrcCB0EGGZIhDw5hIRmSHA8ABQ7k5AMAIGFBsAP//ykgd2hl
biBzbGljaW5nIGB6Nvv//x+AYWxyZWFkeSBib3Jyb3dlZGNvbm5lY3RpBrBt7W0gGHNldDsLdB5ubd3/
LwQgZm91bmRQZXJtaXNzH0QaaQL/b78vQWRkck4cQXZhaWxhYmxlCHiIaPeZ7UJ3A/sHSgOjdraDtSj1
B3B9A1xZbgdrYwcchQPLguMIsGUHyoMLA2y7IezbE297tIQDxtd0XdPxXw/9BxEHA7fZdk1Stg89iQOc
TIoHu65pOgOtvFkT7AMcr8AGWS6VrLrQCxB2BFgDshNN03Td0HsgAyVWwGA2TdM0cmmyFS61TdMViMED
YnyWV7JZNtnFdmvK3AW2u7DGDxQnF8Yrs+2u5GvKnwdG2ANndsiuZPrcoBez2QMtr5LN/PrccNruM1t3
2wef3QPi3//gA4oHyYNs8qjhA+DeAbAvyCpHFDd1bndkA9Z7S+JzB1hdN1jXA1cTaBsaFwwDO9d13WCf
tAcjD0wHnAO7rrtset9HRgNpDz8fMeJt13VnE4sPxQN5C5jxA85+wZrOiwcDbvIHngB2YEEDthOsabbN
hjj+A11/lAd8kAUZ0gP/Af7YF1uI1v0DCxw3QD6yAAPNAv42wkaWGytHsz2yERPoMwPrDrBgTfPuBwPx
ABuywQfoF/Yre2CBbPlHAw40J0dFtgAD/ELDkDX/EwIbBR9dM2ADCAsL9Qez1cIut0MDBEQlQgvdZ5qt
eANXPguFAxgbrFs2o0iiB5sLvgcWqsuu4APjTQNOUk3LpmvOCyQ+A+KgTyBk1xk2WFLrD+0LX1CZZXfy
GVBnA2ZRPdl1TfcLtAdvdgN0CzhRltumO8cHfhhcA7hbw13XnW24YA8EA8gL3AMpy67rlmHSB68fvAOU
XTkAC9gg0QsD1B3CjgcT82KXY6bpChRMAyY3mqZpmkhZZXOBj2mapmmdq7nH1dMsm6bj70N3XHVN0zRN
jqfA2fILTdN0hnhzAzhRaoA3TdM0lqzC2C9yde3///9zdGMvNzM1MjhlMzM5YWFlMGYxN2ExNWZmYTQO
aN+2/zhhYzYwOGY1MAZjFzQvc3IstBYttstipp0LLdrfXNQFbW9kLnJzLH9btP8WjSB0byBsb2NrB/Qg
L9pbbFdk8mNhcEHBbvu2xW92uWYbd++/vRhhIgJCL7tiBHRyZToK30cYjYRPjyCwwyhkJ38VH4M1Fvoo
Ynk8c2Z2ZbX/hbZ4DXJTIkJveDxBbnk+oIwa+g93ICdOdWxFeXIP2w81NEtGZ1Rpbc5PjYxG2XV0l5+R
jbKRlz8PzB422CDjAw8tIAChrtElYGcVBmv+hUJhWRJjgXCFF24LbXCwLi9ycmdv11uLcOFlZ2locnmx
Cu91f6HxwmIutW0tMWXKMjk5ZGI5Ro7abwk4MjMvcP10UGs4xP4tMC4zLjUuGtMBAKZKhioAAp0hmUgD
BBqNhYA9T2Q2uDF+vBVTA2YgYhVzOtkgLTQKdUlcIAutlUptHAsIByaaoVThb2xfdpk/M791s+c6L0gx
MAAxMDIwM+3SUukwNDBRVzdZMDkQpUultzEAMjEzXHMxNnpK37b2MTgxOSIQMgAzMjQyl1orlBatN5ux
NCKWXrrUEKIzNKszNjOxOG1rrZWtRjQiEDQAa62V/jU0NjQ3NDiyWEY0IrX2b1sQNQA2NTc1ODU5alj7
bWutRjQiEDYANzY4Njl8rbXWWmpYRjQiEGuttbc3ADg3OY58alhGNdrWWjQiEDgAKct1XdeiOX45Wjk2
ORIFNITZCOgyYtvWqtzx/GYkICMWrNDwEjlnEQ8tFKCwaw1ydBorth3bIi8gZAxbLgBdZ52CFRJVZdl7
AxyCPFQbYSBjaEZ7221CpAd5Oxd0GiQH9t1akiYgKXpgTGb/fynIbXShAwUFBgYDBwYICAkRChz/////
CxkMFA0SDg0PBBADEhITCRYBFwUYAhkDGgccAh0BHxb/////IAMrBCwCLQsuATADMQIyAacCqQKqBKsI
+gL7Bf0E/gO/BNX//wmteHmLjaIwV5aQHB3dDv//X/oPS0z7/JY/XF1fteKEjY6RkqmxurvFxsnK3vtf
eOnk5f/tERIpxDc6Oz1JSl2Ejhxit/attB3Gys7PHBsNDh2//bbdHEVGHV7KhJGbnckaDREpRUlbtru3
Vw6NkaksxcnfK/ARE93+/1sSgIGEsry+v9XX8PGDhYukpgrFx///278w2ttImL3NxghJTk9XWV5fiY6P
sba3v8HGx0F9B//XERYXW1z29x4NbXHe39/+W6HtULZffX6ur7u8+hweH0ZHL2z/bzRYWlxefn+1xdTV
3Fj1No90df//dvuWly9fJtenr0fHz9ffmkCXmDCPH8DBzv++ERVvLlpbB/4nL+7v7f/t30w3PT9CRZCR
YFNndcjJ0NHY2ef+9v////8gXyKC3wSCRAgbBAYRgawOgKs1HhWA4AMZCAEELwQ0BP5/YeEHAwGSB5BQ
DxIHVQgCBBwKCQMI7f+fFqUDtQwEBQMLBgEOFQU6AxElf6H9/wUQB1cHAgcVDVAEQwMtN1EGDww6BB1v
v/D/JV8gbQRqJYDIBYKwvwaC/QNZJAsXCftb+4UU4QxqBgoGEg8rBUYKLARQu2/tRgUxCwcRCwOArBof
Qb8VFdtMBEl0Jw8DPAc4b3/7twgmgv8RGAgvERQgECEPgIy5lxkLQdDf/hWIlAUvBTt7DhgJgLAwC/+3
vx3WGgwFgP8CtgUkDJvGCtIwEPAD39rS/zcJgVwUgLgIgMeaBFtNRggMBr+93f50Cx4DWgRZN4MY2hYJ
SB2KBqukDL+wtf8XBDGhBIHaJgdHRaUYbRB4KCrbbm+3BoyAjQK+AxuODQD4AePx/7+jAq4CCgULAhAB
EQQSBRMRFAIVAhf//3+hqCgFHQgkAWoDawK8AtEC1AzVCdYC1wLa+MaN/wHgBeEC6ALuICj5BqwMJzs+
XvgLX6aPnp6fZAk2PT5W85gEFBix8ca3B1ZXvTUm4BKHIp5Goz2Sfn0tXAReuPCNNBscqKnCCTfRqAcK
///C30RmaY+Sb1/nWmKamycoVZ2goaOkp6it+P9/4bq8xEsMFR06P0VRpqfMzaAHGRoiJT4/j//W3/YE
ICMlJihiOkhKTFBTVVZZ3P7/rWANZmtzeH1/iqSqr7DA0AxyRMvMFxoKbzpeInvpiGWfLy7/hX/hgIId
pA8cBCQJHgWPRAQOKoCqBiRc+I1uDgQoyAsBgJCBZxYKsfCFL0aYOQNjGjAWBSEuBULhVgGiBEujdW+F
ErfkB0Dt6OsDOgX+t95KywgHUEn7DTMHLggKgSYf/o2tlTVEToYbTgQeD0MOGbBd+N/ZBkcJJwl1Cz9B
fTsFDVFe+FajdWYpgItgIKoKgKa/sb3dmUULFQ0TOSk2NxCAwDxkrfHb21MMhKBFGx5THTmBB1atL9xt
t0diAw4tBiSBNhn+Mg2Dwvb/25tmU4DEiryEL4/RgkehuYIbKsv2jcL2YCYKLyjEp1tlSwQSv/F/4RFA
xpf4CILzpQ2BHzHjBAiBjImLgn77BGsFDQPGEJNggPZz/283fm4XRoCayFcJWIeBRwOFQg8VhVAr8bfb
woDVLRpQgXDlAYUAgNcp7bf/tjoKDoMRREw9gMI8xARVBRs0Hlr727cOs2QMVgpPXQM9OR0NDVfU2N02
xAZPg9YTCwXJ4QW3qRkkBDi8GB5Sd3jxC9tSF6YRBAEDDQaFathAij8dwPvvPioA/LOGOvj/wwcMFP4h
/gAMJ79PUm9QHiCAD0AGEF2ACN6GORmoIQASejv5F/wC0CfAAAzvbs0+90ABNwARD2U9YDs5+8BXkEQw
DwNYZy+7RQXQXICb8gcDoR/YgH+r8h8AP4rAdn+woE7+f9/g//7GH0Au6BYG+uD9ZvSYHgBkxSRUdurg
Idl/Qb4DDACwP0D+DydQuOzZOBFgALSHjbPiB9s7gAnif+Uf+J/NO3bs2H8PB/AX//gP1zw7KV3FwQaj
5fDPR/92oNnG/SGZ/wDdQxWmqAg1NmwymmVlgBkNQCc7NvwFBgAd9z+zAkmYhhKfs2a7sbEwNwM/wCWA
/1PVgdET58gz+wBjB5stigiHjZ3B8jD62ewJTSAhxosAAP//pJCakE4C/FyyYWcPBQu4hGi1WpXxRW+v
dfvWajcQswQTFBUWBRcYNZiNsHUblR0pzP1aHYN8InMkhwonAD2yF5EAKCkRKivtlQ2QRiwSLS4DYBst
si81bDIXhA12SMCXNDrIcYU9NQA2VzffAEOA8C0jICRN+oQ7wAdu8DJDAYl+j/4Z/wHP7I8Txv9/8XgG
n4DvHzGJtsEYCFrAJh6FLOuPAdOLgPgHP70N20BhwB83V1wAAAMrMGAK+Zet8BCY9IA8sAEiA6cBDjvW
hPG/J7wPL/+2I307uvAMI/5A+HltftyA8QRH/H/9fziyh3Sr+PxtWLS/G2HBBmyjYBgHrzDsC9J/6WsH
JEXft4Y25cMH+OeLPLGzgpLXsvgGb02fSiS4+P6Xfw352weyJwwIcABh8Ad9G7Cl7P8AE2J+bp8zfOog
PD3PICjQCgBaUqX+/2Vyb05vbmVTb21lc2hpbbmlgFPuxnWTOGkDwiVcuWo/bQY1UaB6o7d5QSAtPilf
Wk6PVlE9nfXeyjXVAGhr/0sDkRoIcOWh6s5OcKhCTdgKTe3AKtYiDQNygFatXG1QdAJtTwWrSPBtcHRK
lLbt71igdXARbWF4p3Wpdd+R1a1LemWRcDxyh2rbq25IyXMJuQStjQSYOpFxyErftqYuol9fefg9glvd
9mxvM3k7LLwBAgmwC0JFAyUYobJSUWUMIE1YcD7zIMcZjMWwExiDi8OGX3gge+J7CiB9KAEARSVuE3bB
UMtJbq8HdmFh2IIXMGREacFVmcJY7A/LVXRmOB0bX6WIBnzLX2UPX17CRizI0KwvuthguLUCgWxzkJxl
YYV4QFvyZF5eIEL8Mcd0Yc9wIFVURi04fCO2j0hIZn5t8f/t/x86Ol8kU1BCUFJGTFRHVEwHUENAKiY8
PijxreH2LD9bXRx7Y/R1MzojfSyAf+mfUnU2NHUzMgQ2dTgweF8nbN+y3fchZhJmaR1pCmntNcfNHWk4
P5aLBhqldukgOyAXICsCVfRtbzc2wGarLSKDbihwDXkhFEY8HnsFNRHtRhstOOxuZ9cW2ti2CzEBNjV2
Cw8uS2+ml3l2bS6HAV9SUpBS0CIstUE/C3OFOUWK5k7a/N1WQSu0tgdj4QgzsWoFxyCgcOllWc4OYVrv
Zi8VKycqFFrRHzFXa4VouV5JYSBoDjpeBKCwa4m2b3lhIBKA1hUUYT8oa6cf2hh/YE9wcnH4tbW2fXdy
YXBwYIs9SGDYhPTwZGCwdbNvLq1wVrjRAG7liXMtIWz0eeYCoybiFV1bpm5xIEgWtBaQflhpgdOHXYjy
cXXGIElE763WigVgc+4TQQWMZmjIUDBd3dbtLuhzLzJ4L2Vkl3KDcviGdaB3LGBHZbXW3HbgJnRCRz8B
to3FgiNjCXcebAqvGdysvKkpGRjdRrRgh3+Ja6p32ACCuWixDnou1trXUBQ6dAkKzObXv0Vy3XJmaf06
vApSVVNUPrQv/F9CQUNLVN1DRTA8HhxkPoRZrAaKbeUpCW26rbBw72Vnb2J11ygYKF4HRNhYF1ZwtBVr
hFI917YLhTGQPHZpRG5X4ii5xwYEaWETSziWDGpYOWyGYRenMrgHs04q5ZntLrRWmh/k4G1pjmQsj/hg
hWgpYHkY2K1tT3aW+HNlV7dj8NG/7l+jX3O/cnQGJVGyXx0QvTUkDBBAa8F3bj47hMcw0VFuYWxsZQ8R
NjTDRSK0Y2gFXRcwTrcvSGhFVF5rbcJyaW2nCVAJokep0NMp3ClrmIJNXDURB7+xjG57YXdf82M6Jwzp
FN1LUCcnLDBuLbyNdEYXR1QzTIBTbmHSrVo7Z2UzcHVugJGC9Gcgb3KxkHVCWxm8mehiuYwBxtYhijDu
lyw7EOlf5FkiBw0scgs52NvaCQwfYGBitmiFp9KEgshBxoNxokV4glmYvtqjFZiPMh3XUos1gy4XaT9c
C2GiEw0mMtNJAdvddGVKWWJMaVgTgnZ8jN0m0UBFc845aXAhiHDYFGRyQk17DJiGBRSUEwgMQbBQzYQg
0kDWhuiGEOwuZi9kcNpsKxgabG71PndwPp4aiFBFY2bSKNYh8BAEICkEUg0D20ggBAJgoHASDwEEdHIj
ctAGCI+1dXJlrFrEFQjVkSKPAgQO2IDnCCdceM+GwAttcHHPZGVkWghrAj90bnVTsKzY43Fyb5x7GbdN
YIANsR+jnTIOxZVgKAa78EajRCKYGGdodNnd26IVZyARGWAsChRBs4C9C1aTPAwnhs1r+YyMWltyL3xz
wwwu1nofJPxh3cB7GmMlI7OXdFKWsAsPuMZlc7tYoGUBgwVZwRBi7cRuZxb5UCRau/FQb4EraWo1B80s
k320UR+zhBUynj95buxqcn9PT3Ntcs1DzW9txsZkI/lVVEVKQ37hwGZMUn0Qc5vDnnFZDkGvTm8TtoVi
BXSZVSZC6aSmkRFQEEEpRSggdHgaV0hCl791DKHTSXLLF1fpkr46qQpJvU/gVoQW1qBPicjA1hr/QmRO
r1K2QLA4FPDIIGQ5uXRoK2PWYbdlIUJC4K5Od7lsZW5jFjabQF9lj3u4y/qyb9VwgLt0z/Ci201PbvWr
CLGVthfrH2UfRHPZEb542PZw7GVkiYoFTljgJqVUb/D4rapfTUFTS9j3Tk5JQHJHxk5HXG9fEg0YcJGw
26pEhqML6U9ORU5fF/fQXFupP2Zf7gQTagnMWUL5gmC7r1pl2G6tKClJDlsQWPnwZhE9OLA1hBNyUgnB
JuSKUdBcWzRRCmD0ojQoNfi3Tl/cU0lHUElQRcVd9m6TDl8CTinNEUUp2BIaneZroQotEq5uC4FeuzbA
ahxLmkwYRAgGMF+q4gM4zAGqEAo1u2ERBie8FmxpdLMSWLNzVaNOdX07AGkUZWxmLxAAHYiZmg4oB9lM
F0qDEiU7wGJqadUDOhaLLmAA+0ekuoVuQGMQT3DOMKGgNyd6ZvVRsspJbMA5cAnbXm40R/du2fuqMIxl
XzRBZrBhaAeo22XfZwuNDVpwlpcg/HMlB20C3xikPCEoXrFnfnccG9sLWGAf/m0pbH8b2bAgpSEAe5f+
/xqcNE3XbQNtB2YDX1hRCNgz1i5dXwC38XWzkQBpl08AU3NYFakgRsp6jY2PDgAuQC5CdbK+G1u3dThk
LXwAMFUAEV+FVqjFX+tRDgnsoVBoF6i4ty8XkZ2dbC8wLwCJLyHs8E+FkZEAWkxJQg+jaIVDAduBawkd
sQXEZPwuc6UvSYSwL+4tj5SZCpoPJ3fr+gpGV5xp9mUmEwNhgghw77OF8DoIIOEUAAN4uWArJZ3pf2xg
AyYAljAHdyxh/////w7uulEJmRnEbQeP9GpwNaVj6aOVZJ4yiNsOpLjceR7p/////9XgiNnSlytMtgm9
fLF+By2455Edv5BkELcd8iCwakhx/////7nz3kG+hH3U2hrr5N1tUbXU9MeF04NWmGwTwKhrZHr5/Bf4
/2L97Mllik9cARTZbAbGPQ/69Q0Ijcj///8v1jteEGlM5EFg1XJxZ6LR5AM8R9QES/2FDdJrtf////8K
pfqotTVsmLJC1sm720D5vKzjbNgydVzfRc8N1txZPf/////Rq6ww2SY6AN5RgFHXyBZh0L+19LQhI8Sz
VpmVus8PpS/w//+9uJ64AigIiAVfstkMxiTpC7GHfMMRTGj/////WKsdYcE9LWa2kEHcdgZx2wG8INKY
KhDV74mFsXEftbahAP7/BqXkv58z1LjooskHeDT5xv/G/3+oCZYYmA7huw1qfy09bQiXPZEBXGPm9FH/
pd/Ba2s0HNgwZYVOZfLtlQZse6UB/////xvB9AiCV8QP9cbZsGVQ6bcS6ri+i3yIufzfHd1iSS3abyz8
/xXzfNOMZUzU+1hhsk3OLDppvKPi///b/zC71EGl30rXldhhxNGk+/TW02rpaUP82W40Roj/////Z63Q
uGDacy0EROUdAzNfTAqqyXwN3TxxBVCqQQInEBD/v/T/C76GIAzJJbVoV7OFnAnUZrmf5GHODvneXpjE
////ydkpIpjQsLSo18cXPbNZgQ20LjtcvbetbLr//y9Qx7jttrO/mgzitgOa0rF0OUfV6q//////d9Kd
FSbbBIMW3HMSC2PjhDtklD5qbQ2oWmp6C88O5J3//////wmTJ64ACrGeB31Ekw/w0qMIh2jyAR7+wgZp
XVdi98v/b/wbXoBxNmwZ5wbHdhvU/uAr04laetr/////EMxK3Wdv37n5+e++jkO+txfVjrBg6KPW1n6T
0aHEwtj/////OFLy30/xZ7vRZ1e8pt0GtT9LNrJI2isN2EwbCq/2SgP/////NmB6BEHD72DfVd9nqO+O
bjF5vmlGjLNhyxqDZryg0m//////JTbiaFKVdwzMA0cLu7kWAiIvJgVVvju6xSgLvbKSWrT/////KwRq
s1yn/9fCMc/QtYue2Swdrt5bsMJkmybyY+yco2r/////dQqTbQKpBgmcPzYO64VnB3ITVwAFgkq/lRR6
uOKuK7H/////ezgbtgybjtKSDb7V5bfv3Hwh39sL1NLThkLi1PH4s93xS///aG6D2h/NFr6BWya59uF3
sMJHtxjmWuP//799cGoP/8o7BmZcCwER/55lj2muYvjT/2thxP///39sFnjiCqDu0g3XVIMETsKzAzlh
Jmen9xZg0E1HaUn//9+A21tKatGu3FrW2WYL30DwO9g3U668qf/////Fnrvef8+yR+n/tTAc8r29isK6
yjCTs1Omo7QkBTbQuv////+TBtfNKVfeVL9n2SMuemazuEphxAIbaF2UK28qN74LtG8L9f+hjgzDG98F
Wo3vAi3ICAAYCAT/////CBQIDAgcCAIIEggKCBoIBggWCA4IHggBCBEICQgZCAX2/3/pCBUIrh0IAwgT
CAsIGwgHCBcIDwgfCD9A/VRFDVAOEA7tW/tGEA1wDjABPA1gDiARt//2/xIADoAOQA5QEgQNWB0OABIU
DXgOOBESDP//t/YNaA4oIScOiA5IDmASAg1UDhQOHA8SDXT/W/vbDjQhEgoNZA4kMTcOhA5EDlgSBg0U
tL+1XB2IEhYNfA48Me3/rb14bA4sQUcOjA5MDmgSAQ1SDhTf2t/+Gg8RDXIOMkESCQ1iDiJRVw6CDkJo
7b/9DlQSBQ1aHQ4EEhUNeg46UWb/f2sXfw4qYWcOig5KDmQSAw1WDhYOHmvfWvoPEw12DrY8rg1mDiZx
d7f/9n8Ohg5GDlwSBw1eHQ4MEhcNfg4+cRIP/va39g1uDi6Bcg6ODk4ObOcNUQ4RDhltCdfu/3EOMYH/
CCGRd7fub5cOgQ5BDlL/WR0OAv95Djn7W7trkf9pDimhpw6JDkkOYv92126+VQ4VDh11DjWh/2UOJbG7
W/e3tw6FDkUOWv9dHQ4K/30O/a3dtT2x/20OLcEuDo0OTQ5qu2s33/9TDhMOG3MOM8H/Yw4j0d2t+1vX
DoMOQw5W/1sdDgb/e/7W7toOO9H/aw4r4ecOiw5LDmbdtZvv/1cOFw4fdw434f9nDie11v2t8fcOhw5H
Dl7/Xx3sW+Gu3f9/Dj/x/28OLwEHDv////+PDk8ObhKQApECkgKTApQClQKWApcCmAKZApoCmwKcAiD+
//+dAp4CnwKgAqECogKjAqQCpQKmAqcCqP7//28OAqsCrAKtAq4CrwKwArECsgKzArQCtQK2ArcCfyP4
JW65AroCu5u9Ar4CvwL//1v/wALBAsICwwKAxQLGAscCyALJAsoCywLMAs3gvxH8As4CzwLQw9IC0wLU
AtUCg6j4jsfYAtkC2ueC//9/3ALdAt4C3wLgAuEC4gLjAuQC5QLmAucXIog34ekC6pvsAv7/v/XtAu4C
wPAC8QLyAvMC9AL1AvYC9wL4AvkCMPpfIKoC/AL9Av4C/wJnCwXbUCZlAAs1YiM0rACVDQ1zRpuhYQ0v
CnqbCzuwAy56QHpBrC67sHpCekNtmnaPOHsAcmUHJTQFYXQWjGhUjKlH74oIcGktHgBEV0GpPgj1UkYg
dQkATEVCOAGOklWJGwwwhL5vNjRfdLtBMFphjlAnpTs3GJHBcw1rX0ZhC6PvT1JNr3AbM2721SySgwDo
J64t7FIbZXQyyka4QrhWXhF26zTqyEUU7GnUsDAKBgx8QrHIlgI3q6UiNUsvJN7F3eFG3GVyUsNBVF9o
hYg1Jl8Zu0dFO2yLZmU3ZssKsMImhLvDZwns0A3gHQB1wWZPgG4mZWQqgzisGFLziGlnFCZoOnQIFG4r
NiBhLgBnl2G/qFTmCgAAN4GlEEIHK9eAdj+s1v7/NAP21VcD6042Tad59NRrG4gPFkB4ARv64k0gzBit
I2xarPG4EWVr7duYyOEAg4PPLa+AY+9atNM6IF9VCF9C3wGHwYoot5g9JXApCiQasAlnLyC0tOYOkaiQ
3jLkWAJTkVVzKUZd+E5bFm/2b22kq9a6LjIsGHQhw/koEtmSbQpXPdq/9J3qcD0weCVseDkvYthbsI5z
hHNkYRRgrgG53GCmpbBgKbCn4JA7hAF2ZWSPF0cjWuwve0lQKGspID0+IIEyUit9CW54ODZf0aDeZohU
rkT3mEjutrkGXwI6YSAtBxxN9WCpLi4v2i0UvijZC3Eu2FJH98bDRi5o3AB0cvxh4dWA18J1w2JPsF1k
Aekvh09BV8xUZ19TJFJkFZsp/kVIX1BFX38bbPtAMyK1w0JhIBlgrGoEFmcwNluhYS1KkQNzYXiumaZZ
ZGNiiw9CkKB1A2IbJguFoGAbFDh8mqbpbgIxMAMxMjM08zzfbzUAeG1tMAQxMjPP8zzPNDU2Nzg5jY3N
YiwyMzE0MVKxi401MTZVcOxYTdMsuwNw7mBQQDBFP9M0IBAj8O1pmqYrNwPQwLCguu6dppCAJwdgA1Bp
mqZpQDAgEACmabqu8EfgA9DAsAaWa5qgkAA/o9dNQjAtGwgfWANNd/ZsaO6reO5ziAOQmNhggzUIrxi7
KMfdN1g3OANI19Ab7xfvaZqmMwNASFBYTdN9pmAj2APg6PAwXdc0+AAbEAMILDAemCBSa0NY2WWIcxz2
MmF61HBvGnE5TsmYYeqfb0TAiJE9bybywk7LWmAv+C+hbBIPYWx5L+cMDbug64DwM/F3Aw+s6y7sEPID
kBcAB4AfbfsbEXJVTldJTkRnUgVrAaIG3kxTdyxVdwBfXwlfVF9frgk05SgSNv1nRy1bg04KCmQmG9Nt
B4FfDPNbxAO0TdM0TaSUhHRkVFrR7jMjRAM09F/puqbpAxQE9BPUA+TLOhKYh2VwhJCBBtkpCq8Gkr0D
i161JhA6wlyxwjcGN0IXK1HiCAdMhRsJrrUK8EJDDEHKSjRKGQekA4vkb1VGLmUlibuNaBlycV9oZOxn
aur4oHj13/ZH90MDXndhPw+Y+AOoFxgLpum6wR8MC6cDmo6a5ZB9D2QDG/mRhT174GcfY2IeAAYtPqlG
QgMLcx8gcLCi3wQoKUZpbrCWsmACJw0pArWAJ0NJReJ6sJgBCGMS8Rk8dFgXMZ8zB6dggVdEd9Fm6Dsw
MINyBshrIDyjSbzwIDI1NbEmICIQkBCLYSWnOdnfqgf9pEsB///tAAMNNmRXPicMD/+gLATWA1FDAzTN
sjnpeQMuIRWuG7LPD4UDk8MYAw4PerAJH0ZERSelcfhOinEAE2lHRoMhcHFlvAAnTRSCFBNxZI0wAhgu
L6BgO4Ux6AaPEgv7vduCAQPxB///D6IIA+0G67p3F2YD4R/VE34JIftMswNuXw9uA0QF67ryF0QDUh+w
Dwv4AUluo3MoaQyYCj0UqDAn9wWgwA2fQ0ZBnXsLtK9UI8Ixyad3LPYKRrYd5ydAhkCuMjQtg4CQN9rR
Us2CPCp1dIEXBJgd5C6t2BuMEfViTwoAADK97HMXKCRqLHZkKdaVKZV3WVFleGEhLAEyeEjZAIHPb2Wh
7A62Zmlu4UfFCA5cc2+lWIsslUj/VBdkgSxFPzIlhCxlzzKwgywgvC1BbwEYpQ09X2NfH8kARrAqF3UF
CMFWPB8+gJGo0DyfaRe3QiV9lgg8cPJQBH4hYD4ofjApzMgGC4YDfiKnwLJL6F+/KApLGLMgXmNmvypj
WSJBH2BLSNkyMogbgZAS17dm0spSYI864tgAhBDHdwDZskAybwawYKaSuG8osgcWHDUVCgp3yANs2Tp3
CgCArbIQ6jJSCSFsct8CG4HxRGsygywQRmuHoDVqANP1SSwRBi/bTJeSwUG2QihMtNm3yy9BVENINjQz
MYXxESzPX58KvxIrg7PfZJU3YCuJATYju5dso1hwC5crCgAEDEYGUohtK0sZJRsQbYOQlaIBC7XdI4GF
DRUOBxuWsChKHfElZAb2GGEaaB2laB0dcshzF0sFDm9hUxqvKbCRXXDFkCgpodGFLhgQ7h0gKKs7wkEk
EzAyWOPLpluoBBecA8wUBVyapts0xEQGBwYHB2bZNWQ/3ANcCdTLzjTdVAoHCgsDTAy85LJZNnwN9GwO
7ALltrsg5FtsDwOUA9ZUR7uEB2cQAxGnEQ/rugt7bhED2B9YA0MfBB03BkNOJ3TebqLBVnDCdQVjnCAY
BCSWr1mdQJyN9S6vUCMKVnoFlbA6kLKCSUGI735mzh4AQ+T0fXSFKjj2d2MMJEdN05WiI84DpJQMkEa2
kCQf9/e1FxaEOjoKw1ReakCtxEVe7n8NUpsLiBI6rNT9TGfYT5QlFwN0D6Qmg3XNhQM0VBtkH+K2AVG3
JwMZKr4pA5YX9uyPKg9wJgPnKEBl151tqCkfkyenAw4s6y7s2aAqDzwmAyIbGAMbSfCmBJMq//+/CgIS
HGlp2mFsvPUjLSvtA09QX2ZiyUQ44MRt+8i0cBOibncbeNIhgC0TZRubHIAVIwsctwZWDxivXUyGWTIC
d5Xr1CFWnMi0iMHObj9DACkw65o2A1MHzrBpukADLBnyNWsDbLvvuQYLKwNUD+00A9vTNE3Tz7yhi21N
0zRNWD4rEwDoNF0rijMNA8W6WTZN06eUJZ0yiqZpmqawd1Y6Hpuu65oCCSPtB9EDw+4xVMlFJdV1DFUy
XO8DxWNHR9MDWsQLZBuBNBNpmqY76APi3NbQTfeZprKsI5QDysQ0TdM0vrim9vzTdF3TJhxTFAMLAg3W
dF35E8wDw7oj8DcYTdMD597Vc1IDx+50XSgvMQNal103r76uaToDS0J4E2+vNpqm684j8wfqA+HYQuua
pmk5ZlGfI8UHpmmarr0DtId+dem6wZpsAyM4Wy8DJrrpuqYd8RfoA9HaNv8xSAwM2yQgBh0YRmiN6TrT
bhsAvD88OIMDHGm6rmkM/BPsA9zMTdN1nyPsF9wDzLysqkzTNJxMXEQrYnVP4HwNiVjCf6c6mwUYRod7
IkcXApTaEeE+PQkMEadi6yljqUkXglAT6ucXbiAINikBDIqGUERGjmyBFMGkIXB23dYd2DufOgOYB3gD
+Dx1XdMZfwO4CBd4B1jndk3TAzgY+CM4PS8jZbNtugsWgEYDjEJFUMDOwKNEuwNlQ9l+ZnM2Aycj6UAD
SnbLzrCrP0cDbT7OF4hBOqrBGfM3GUaRUtkYwBJ+l2US1kUXSwAvU/JkHEtgswQ3TwBRQ4cOZfG9RWjY
hGQQnD8uAgY2hlei0Q8wgJERNxeDl8JA+jMAYWQiWJAiNic0r4D9kliBU2l6ZcfJZJGAdA9VothZDEWD
UA9ZshsxhacoKR/i0A7qNi8ldi+KAEFGpRoJIdM7qiXl3nMHA6bujX8SfyEiIyQkJSVRJycoABmkaZop
KissLVWQQQYuLw5e9knbf/z/APtnczQD0nQDO/tiiwMLWdOw1hsDK9s70yJoPwMtMFgrAiAIGoCjZXh4
s7oVCv0XkElORgBOQU4Avreda1ELMy3gIhsoCwV8eP4ax3stfPKyg20DVQfHewMKfOwAdgV6L/l4N6zp
YatnonoHeX9dd2Gvxnkv2ieDV2nk7IB1F+Nf9XoHFGAGHhZ/v3d7AwDLNs3P4NZzE+GN/0u/MzQ1Njc4
OUFCQ59GGQDyfCObbRkAAAUACQQL/He3If8ZEQofAwoHAAEbCQsYsGDv2QYLBjM5ABR9LzsOOQoNHw2R
FPDX5AkWCQAO7bIBG7AADAsTBDaFHXYJDBwMORALYzsAApcEDzkQYFPYYRwQORILdcNONhEECRIcAhon
LIXdCRoaGkIfCQDZgF1lABQLFwSbwg47CRQcFDkWCxt2sgEVBAkWHAjEotg1qoBf4mzwOwVpD00oVk4L
4CUEE4A/jQJ1gzpJAGdhUIJC5Cpx30UPblROlW9tIjGIQT32ABw7EvSBAhIVZW6BUP9UME44dHR5AFAN
iTpkegBPFTNU71S9H3Mz4BjBrSBNY2hfb3KBSpaMlxnAdCTqPQBGITgAVkgMoQ6su5DVtz2oH3twhyCO
HahINq6DdmkYUYzoxU8sOJZyDb7Gb/AlmHMDWlbUDTj3skPQQCZtTCXbogzUo89yhR0SZWJ5lKMARmCY
FYUrkRM029pDq6ktbirNbgu4P/Etgmx54RhSUJhaT32o+ARwDcwAQ8IGw0Kpgidlcjphw6IChiwK2gdq
bwBIepXMFb2jmQzAol5GDwBBTnBLFvUAQn3EL0842BCC3HXDb3L2qtqwEC8tFyH7RgsRGWlyZWQvYS8h
GALESXMOCBMKMFR7CHR9IFqJVBfpYXRAwxCCfk3VdbAhWDNQtAhNc3TaC3qb8fNnAFNucdGgxYKPEu43
2SGKH7IkVAg9og0Af3mas4MQi3b8g05viSXsCrdkFWNyBJ9zINai9kb2QmFkHjHpk/BkFMaSQmFkHkZ9
ywLGaWyRe6BzyRjY4To+YVmMKggAcC+gWgPaCa/gMQeddJ5jY+czWmgTqFDeJONldcSEdCxZY/psDAgG
0RJGhJzTJMqFhscImU46uNrDNEmogKZHrTPyICB2ACKc4OfrbtOWRXqxwUFoxyA9HsElm5lkC7NHsy5G
5QJMxpAADqmPgLBtzbnTY9Fdb+BshIMdgv9RoQBGfg4nOCy6BxlbqFowaFvpdIKW0YSbFGluBL+WEGww
oU3wmxAxx8lzd3Im/qlKNotgTR6MhGBhAxZwLmwWm1M0RBlOvTBZwg0+ZhZpbHkBNqSQK5scqzpYrAg9
AEEoutFaAGqBPHJrDaRhSf4P/qqeHWBfbicAQ7Gow8hO6MuDLQsCS2zxaWpYsqpzjhOEqg2so1VDmADQ
QR9k9DCGUE1hQLsYggAQGeRs2elFT1IdFSUrMg0ZvJapEalZSa8sxMMC2F5RdQ9h8QbQpRn1K3Vt8jGC
RTgAV/YS/FK1tYNN0GloJiCLKgLAGzQUgI0mJA9U/xn2/7co0wMRSxwMEAQLHRIeJ2huOP83Cv5xYiAF
Bg8kGggWBygkFxgJCv9/qf8OGx8lI4OCfSYbPD0+P0NHSk1YWVpbXF2XKlDhXl9gUMuNamuoN9po9bl5
O3xIAOE/9ZLNZmQqgHtfX3ZkMZOpE3BfYxDAYpv4N4JOTlVYXzIuNrsbA6U20dQ7EKFBxHTgVVDbhYI0
aXbhB3SbrttuQSTiBywbhAdExOg0zfYtjA/sB8yU5BtyX9O0/BftL8jU7/xm2WwHZGT2tHQN/f8EDNk0
TbOkHLQ0VA5N03RvZA8HfNSU9M1WyDSscgfEFLpN0zTcJPR0ET8N0zRN528HTJRk1GbZNE185JRUEsw2
TfeadOQvB/ykFA5tmmbrTxMHLKRE1BSm6dzORwcEFUcHFJQ61+3c9Bg3B0QZdw9vB0zt3M5tFBovB8Qe
ZwfkIqH73M5nBwQjLw8mHxAHuV0BqCffB4Qpz9m5rtsH5C1/ET8vTwc0MKZpmmZUVGx0hGsBfcukMaQn
MlsHpmmapiTUtOzEO7fp3AQSTwccJDw/B4Q/3KbpDD8HtMQUQo/Tua77D0a3E79H3wfUX9M0TZTkrPTE
F0htAO0MZwckSa8U3K4Q1BdKlwdUTMd13abpB5S05FJ3FYdT03Ruswc8JFXvBzR80xl2bmRWvwcUVx8H
tJ/ruk3k5FhXFjdZ/wdaaZqmc7cH1ITknM51O7dEW+8HdF/nF3cHNN1zmxxEZi8PB6S06zZN07zE1CRy
VxgfYed2rnQnB2R6HwcEgO/odoauGZ+RPwdUklcado6day+UJwf0mmcHFJ3ndq7rZxt3oRcH5Ka/B9MZ
um60qC8cV7ivB7TObZZNbKS5jIS6ZweapnPdFL8nHQ8HPJRU6dymabRsFMInB0TpXMOm1FTEDx5HByQU
FDu3BMU3B4TMZ9h0r8kXB4wkzXcHutc0TTTMlOQfB/w7Q9dtxM43H6/QRwcU0Zqm6QwfB2TEtOS6jq9p
xPwX0w8gL9TTdG5nBzTVlwdU1J3bNE1k7HQEIY8HHDRN0zSUNLRM1HOfY9NkVNZPH9efF851fN0H5BfY
7yJPB86xaZostEQE2VcHhk33miR0FweM1N2HXcPXdAf09CfeHyN/4WmapnM3B5RcpHSmaTq3FOffByTc
VHau2730HwccJA/zVweE9A2f2znnB3T13w/5byVpmqZzJwdExGTkaTrDpoQE+j8HRMR1m86wNPs3B4Q0
Jjf/bXftzicHdAL+TwcECv5PJ7O1XNvnDP6fB+cHnGXTNE3UtOTMdA5d222f7A/+nyhXEP5/B0R+bcs0
XN/+pwcU/me6TdfHB8QMKScVB03TNE1UXGR0dIxu4c59DxZnB9QY/q8qL4WiYbYaByyrJ71203QHtGwU
Hf63H859TdMHnES0Jx+XBwqmc5tkBCtXBxzbFX5N53cHhFwPJP7n3aYr3AdUJv7fB7QcLP8nDDu3cycH
ZCkfB8QrFzrXNewHhCwXLRcvrwe02bmWaZzfbwfkNtM0W3c8Lk85B3zUrHave24UO18XB/wXBywv27lN
5y8HRDQ8jwckPW8t3LmdBxRELweERv6fMM50m85fB0wER3cwB5qmaZqk1Lzk1PTOdbeAGxQxJ0pfB7dz
O8N0SycHNE0fB5RNvzq36VwyJwd0lE4XB+RpOtdtDDMPTzcHtESwaZqm1Fz0dCRQNl3jzp8HBFX+nwfE
hDTrup3rN2X/ByRmPzW3fL+ua9iEk2R9DzdPfqeuYdN0B/TsBH+XOF9NZ9h0B0wkgC8HZJw0TdM0hLSk
zMTrNk3T5OT8lIFnOQ9N5zadB1REgpcH1Mw2Tec2JIMvB1T8hIQ0nWvoZzpXhWcHxMzYdK7bdIb3OzcH
LBSH0zRdowcHZJzEGbqGTdRUiDc8t4kH67pN0weErESOxz0/kw+d67qdBxSWTz63nu8H1DSd67qzTz+P
tHcH1OzpXNfwvldAX783B/RzXcemzITBf0FXw68H6RybpvR0BMQXBxSmaZqmtITUlPRN50qYpBsvBzRE
TdN0hsUXB5SUtLx13c59F8Z/B4TIN0Mfyc51Xdc3RD/KN0QXy5cH53aGAn9PBwTPnwebpntuNNFvHwf0
5BxFmqZzDRfSpweUbNRzO7dpjBTYbwek2S8HO0PXsDTbX0Y/3A8HROR1O7dzHwfk5Y8HtOaHR4AWztE/
7HcHqwLQwhVTB5NHdi1quQdXKwcEGdeibokHSA8cYwfORVAl/68nUcstAC+UBwsRW7RrTwfEOXNIfqPb
kywBelIDeBAiDAcIkAGFNkTMF5vw19eeFHHZVwAARKA42Muy3d0XOAYIQg4QAhggKEsV//9BDjBHDuAB
gwaMBY0EjgOPKwV3bGxrEhUoHhgqCEEhddGHCPoAfL/eb25gHTcDRy5EoAKDe2Dv2QWMQokCWD+gAp9H
DUAxArC/UmynKPEWEBwNSNcN1AOoFxss24IN1gPsL8sXAhhpu1j7bbCuA4YCArMLEV6wAaopqGDjyVAs
5pJtD0wCn4icmk5d2OUoIEGXTPOTMLvsN2jkgQZnH0IC4m8PDDhAkAODB4wGaGh3FxYEj3sDmwQUOkKc
tVhAJ4gmT6TkEHLZqOoHF8ABIFwgJzEWwNctwgbf9J8BzyvQIkXXjbVmHBcMv4AXAdh0FwLlJBd4mwDh
CdtABzhwBgKMBRcAfAFHVMvbgYA6L1LQiH5Y8d1gX2wXMAL9/xfMzQDSXYQXOJxAMNiQNAG0LwcsyGCD
x0VfzBdh030MZ+QXKEQCPyA8DCEkqzbNsyPhDgIwMG8kAwQg3ZBtPwuHPBcwC0LTDFQoNV8XGJhpDmxQ
z0JnivpnhKIXYl8x3ogMQZaOAnWVYATsGFwgUAv/uyFrujeAIH/UF4gEZINdCTfsLxQXDjs7OwQEL3ev
cBcc9wakafB2HLMXf2yraFgFcwEXMAMgAQ4Ik8tuYP8faAYvAIFgumT/F4AvgbHp3mT/F3jaA98gJ4wt
QVDeMgIDbGkbBVBVARkY2zcJZ+zPCWdPx90wzkjEfMA5Q7dosGELtyTZCAoSzkpF689Q/99AMF0XQDfP
VFsC23QXqKIEzwJAO4Q0Yc9U/kBszaALQgr/Z/BDOPCWPxVneP9qSFh2F/gSEmfsAOwGGKH/4AOXAuEh
7GCVA1wDfwG7DuFAZ1T3eBbsOCyjF8/DzwJbdzjsZcRQTgsAYwMbxDZdjDfAEgLPhgMEZo/AqAEHAQJV
Bw9AWILutCe4p1hfwoXAtmugDwlg7DrjEKABzwQwyBzT5ltgzx8k2B03m4TvWQFvArM9EIdEHzckbcEX
GldcF5nuC0ngT3QX6IDaHSE/lB/4HzaHndFLV2AXrFAgOtchWxBnxAc/F4iZ7jDOL4AH3BfAJEx3ZAf0
F7gfSM8+DFcMCC8+CYfSAuEEjghWH3Ahujc8/0+wB1IDd4RMJHfynD8IWAlq0Cw3pyyBpvtftBfoWs8k
utMYjyzKUE2WovuWlC/f7AwQwo4wFoeVN3Dfh8QFckYEcBc8YIWoDSdgM0efOzI2xmUWcgV9AkCAMuxi
Df8vEDRf6QaDwUd5t4QXONF0R4KnnBcwCGBNNySPtBco3HfWdEPJaOQv2EF3qO/BDXwcD/yPNWkIi43/
AVfQR8ILhAleDtAB75DtVhxMF5A2T1MglCOUz8ABVg5sQOg/Ac9Bp4yXO0nsP7A3N0BwHLcLkDbdpBfY
TAbvFlhHyKQFV7lhaz66CBz/Cz1n3ldfbnsHAmIcBniHnyzrYF12H4A+XgGfAvWebgZDBlT/J6b7FsK4
P7c/bBewjFsXhCYf4oOtHwGnAtv3DSeUP0AnpT8YAiMHMJozDdl3Ef8nQEH9/5hn1JRMWNMXyCdnIOTK
lt38J9BC0WfG7YLgNG8PiEMCIweyJ/hAzM8u1kBeQFz/N5puSupQRP2fdBdICWDUHZLXjAzPRDfpsAmh
B31aRufpRgrYZg/EN2iMbwSpKNcCQw0GVBKC9a6+A40D1UEMBhD/SF2Q+C9IHy9QD2F0GzQML3AXsGdD
yIUcsDiwSlG7swHPXE/QTt9sQGjKz0nLbM9U1wgk/w3fTqYbEIIPN6wX8BzsHVgnXP8vWAsJRFoJZ8Rr
xVgIcNKP/sKklL0hAxkBF9n/BFggNw5fv3AHGKQcDJj/spsEDgQFYG9cN4S1FbUgXH8FXwVyQjiABU9O
BMmye92AP2z/T6Bhkb3sgRs0nObDBA5g25TORSBx41BH4RgwwClbHA+/T4DArWZvIhEfA/IChT0cYL9F
XzoarI8QeLwJVwNCAa8wwm4LGgJhT6hjN2A/3L9Ad+cB0NX0wgf0D394hwIw2CEkp0TMbxa2YSGkKAJO
EotI2adwAgETb60pOAT/OnpnLoQjpGZPgD8dhPEWwu4mA44CGuh9MCzaf8xvsYUFl/cbAk/XGLLgjIys
yE1QwsWGya8M5/CBVzRILsAfG7RR9fGXXDeG6wUCMsiFN0DWhX1hF7pAbQ4DcgMQ2j0F7ALBD5e8XxCL
uEwCDa/nUALxS+iwSbCUCUqZpAXYfef0N6iMbw+XaJGwIwLoTMAJEUJ8h0SmuzLaSDic51wXQHWEzoDk
B1rbAsQWqnvg6rd8HxB/27gErgx/kiAwxKY7jHesL8CQBOSADGB3sN0BfHcIrJf0Rwii/f9w4bBXBgcC
Wy9GbYS6ZwHnLBPPoqcFpOmuRBc4EmDAwWL/L18CBwJDGAcK40D/ssC0S09QpLdXCNZ038/EF2gOZywm
Tbya8KWgegOWbFEKt/yfhwWhje9CbxcU+wLSdQR4F19nLBfSEMamwH8HN/DPGLvJEmdkBAiuH1nQPFwk
/xSuX3awbYy/YLZ+qWBvCFcWuy8/pARorke8XUjQdQRgF1eX1Pe1sNgEqK5fH+wXSaasTaAVAR9Aqsk4
kplAfyyZyrjdz4CvPxkCf//tlgAr/0dYsR5bsEaPn/RbbtI0X4SdH5RoTZruwE4CSz+0H5hKugOpS0hH
1B/Im27IaAeP7BfAlQFCHoAA300BcWv4sQ88Fr+zT4ABhMUHWBcDTwEYCX1z2HA3dFi0/f9MF03JgExS
aawuZEDTN3AR/xcYbEiaeAjcLwNJ04UM/xdoCw5gDQ0McGAvJBdgISnOrxL/Lzx7IcASn1QXX38AQwIX
CPdwx4SEC9l0L7gzAVBHgBADGST/voQBuzfAtU9/1IoBmOkX6H8r4RJw/y84tj8LGGC6HBcwNxduyJrm
NGhFL0wXmmZImqASZKiD99A0KSfjCPt8F4awFmIgt1cET+AXGC8sH6ADkOCG7LuzAWfMT/C6/f8Zf+Q2
JJDpF/h3/C+QCYkOcgPfkIPBhHEwA8CQ7zR0I9t2YDi+NwX/FzA23ZDUAXdkFyhuBQV2AgQ3AuDmst1g
wPBftE9Iw38hgaa7zBdAJ2eQhmW65BdYT2+HgkXdakf2r2HRroEMoIAnowu3MDohDASPmASEBRa9LSYD
mQbSAd2AxQQffG/AJA5SbMciBxMB8AmW3Ze3nB/Qz+2PeOwLBt7cSAVDDghdCLpDX8QnmAcQBAo5AUIf
qQJJgIZflxQbL9R/KDuw4oMCVQ80H0ImGWRUFlRwsKFsdD+UHzoAI2ZwSb9zH/9MCTTdH3jvP1rQQOCA
AslAAxiwe/83MNWPce5hhARfXySUToAEu0g3HQQXJAOXzZdCT3QY2c8CLpIXIPsBxC9AuGyY24kH/ysH
peBcITSnDhgtxNji5wKXkAGD2hAeKGscAp7QPZNwIwIrPB0E5Yg1sjAXX8kSjeSwYNy3uxLYHYw/EOY/
pBewIammGAFfvC8kNBhxiQCPdeNgm+6DB9wfgAABx3UZIzVwX+QocCnoCpInl1BHgBFTdrIAL6d3N2Q1
3TQn6AvnTBc9AKNN4CUB7wL5boQCGe5vnE8FEGrEwOh3byD1EjoTbrwC7sFuMgrP5Ed460wXgYXH/xew
1R0KqXc0H//rC9NNSXdMF/BXyGiwI2QvC/8hxTfdF+DpDQNJNVfdARg23nT/J6iwYIuA7K8Ch0th1AlT
Ajh3S2TF7vRPyO7HJ5VIqO8c4PCPYFLsYv8n+PG3wndnbMcCTSdcF0Dy/f9XD0PSdEN0F4gUjOxIwjSQ
p6QvdkdhFd/cN2D0ZLopoS/0F1jQOQ4Jnwwh/xfkkmp3SE8wZt0Bd76FtBs0Jxj2p6dMubCo6Rcg2ZdQ
wO4COcyEN8j4LkCqRdOXrgi0O0rUT2j6R3SGsUT/In83R7ov2ZR6K680J7hjAgxoXdcjjuY7aQJGnzz/
ImVEo4D8v4+QEQ87YINF3QGRuOySxGD/P+j+vwALgSsE12d2vwACdH5E6U8UIwkQbh0f/0/dAo/uHgLJ
YAJXZE/oAf5o4aYSV4wn5B1htAi7B2AJC+SEd6IBF1sgYDfcT7AD+wVPsBBqCJA3d8IQRocBpyzMYEqK
baAIT2JfkHgj4cnfAy0CVz8CAe4+j2w/0Ar+F0KAsjucLyALFyMB7obUNygM/hcQCGC67BdQF3ckwO4c
Je8M/hc0F+mODEyYT0wX0EUahJCX/7DYQdk3iA0HT0O/CBNSJI+Ipy6bs0PAAk/UKBRhAoU8ACvHFAL1
Rjxg/3BIFv6m+xgIL9c8F1ASPVSQWXdHht0JNwgFDAd3ZCeICy0ZNabPgG1u3ZHAYWZvX5QvCHQhi5YX
H/8XEINdCNEI18QvDMoayKoCd05ACzAIRA8EMNi6byDBGP73VxwX0BJOGW1iAQcC5tGJBtbBfkANZ1LR
VQwXAJc1XCPYwD9ifGlDwdDCm7ZtJnXsqoJhhgaRjsNyCrCHLCKHx0YLXhfZTQYnSAs/xGdYG6X2c3Jd
AI6NA0UtkrDbD3Y1hgXIBmBGKENATraQHkkLVKhPFCgzkXQOP09gYke2TUhBUxBGT1wZpOkOC094no1r
C2/7jANEK4ZPoUpPTexPBgXvC1kKDihGESSxsAdEC2oQd7hkNN3EX7hGhyPP4HYrpVUgUkMYQ24LV+6p
ZWwKRWk//DfaBmKY0JddAoou0CDQpdgLVe8cni1AC19gRxwfEFcI0wUL/xdoQZhuyIdMF3BJNd2Qx2QX
eCYvCWPTDXwXkNwEH4UGZJJJRIh9BM8Exm4BCUFUEBagzv9PILe0t911JrlCQe8Ccwqt7EKIRb5WFL8B
HaBa/yc4rPz/AiSTXRjHRKdFVrwu1E6RAtZj/nZvpAQXdE+nzg/lAWzCT0X3TQ6wCA8gzcgDQwO9ChGx
7J5Gv9xnoDCG6fMwgMdED0UCahfCBWcLp7QLT2W7hSDwP1oWp0wO8OGuu/0Idw74CFz/CUkHQg8CTAoI
69rGANkDXCJgKgXruq5NB0EqUgd9Dz1I1406RwhhEEsDvgMGO1jXCU8RZzICShBoOxawwzN3ITMdAUXA
usEGSTNeB3Nm3W6uewP1AglHEQ2ICVCQCbbYd7cLmAegCVJQyjYcaukGssEuaixzG1UOrDusWo3YCGJr
infYAfuNRCIDQRFBUGk2M0hPRwOosDbY76a4wAluLR4CjmzNhCCDDUgPa7cLu6BTB4eYRbfaEo+vkwCM
D4av6IET8dVHngrjsYNt6zpHGDjFQApI19iFrW1QFlhiYC8wZiKmHcQLRsssLV+lkm5BZ0gBr8CtQLsT
uAHR+BbIAbHjZjOfA9jgAVjPAo6BbiOBtBdpF0boTfdECEesf/A6SkgNYNdvzVgYYLD/Lbe/6LomWFf0
F/hHwddhjRDfJ2URlAwaSUTnOoB9Q8eAR/7/T49oCrpDYLJqC29sL6DwPYxoNPdnCt9DFjTdIFeMH8Ae
/2YA6UIXyLyoaQaQ0NTYFY6ou5CX7BfgF8k+z2SvSEECZ7DQwAecS/8v/0hACzRlV1aJa4Om+4I3y0Qn
iFrfGuHSCAMwaEZKpntAyWT/N7BLkSOsg59BtSipiKWsUJ//YG5gwapJV/8XdSGhmjgv/xBQDIYy2Bcq
AR9THtjK0gMCnyFH/UhaoAgGKf+pMMKDYClHhfgf0dCwTVIedx7DH8bd56BHF2l/bC+QixMZNKOfAmlY
VgIbISBZoQuh6R4/vE/wpHcWpUKSRd7sWNotiUdGC/8/YEu67WMwv3GPTihYtsMQOscT1xwxrx87/0vJ
YrtMJF1XD0T3KBIWV/83WDMlTahFXkQsTXMh30c3R4zAVmNLNiVnbzdMeppuCQ3/N+iP4QBjEldFR18J
LWzCqERZRBDBrSgJ/+8oTJKLrBT7T4C+lbAVwEGn12QLQajpT4h6R2dPL9bdTfdNC0YFSgtgAxHugWSV
Sb/HnDfvWFmb0L4EX6UDqgEK6Q6BCNjIag5Guiy4DY1nCuRKGnYfwbcr9Fc4US8FWgIhpJfHbsDBhpsD
G6fJgAJOLAW7xQcRAoQQz4jdLQBNqpCemAegAl37DiHVHFHGAz5GSjXk+5qmQUFrXDoVUuvgSYU3nDNv
VqeGAmB1MQI/J9c1G7QjSnVETQdBEY8RElh5igqs/1tATUApWB8IN4AwYV9GB0qq99A1z2dFTQdBB6II
DDYIXUcQaxh6D0cIod8gF2A2nwKkfQYZbH4tSmO6AbiEYIMVY1O3rKQSuu1M4F+vIxWPhSUIXD2mAgdh
N7i3A0bAA1oHDwMCVIkd0nUPA2QLIkcqZvKLPUjXCEoQXgOEAwkR0313W2XIB9ADXCb+FE0UhyJYXSb/
AhEMbsBodDcPAGHTXWwXoKsAz91aaBWNh2jAcFY0hMW2BUEMRjJTm+YbYf9v3OD9CRsYQwgvQefhO8Ou
cHMEch2ABL4gkARVyt1tfpgLoARuHdUVJFphfP9CsuAWz3B+/58g1dVAT4RcHlR3CUxIn5xPEAJNFlv/
KC9mN0jQdAe8HyCMXwLZwgBQzQHB4NbBD88MNw+AT7UBVlH8ss9EjwOOTIjB7fYFjAZFAyZCDAdCFix2
L/8v8IH/L6m+wDJIQbACRAwHz8AuuwFkJ3iCBgBX0jTfbEEjH4RoCDLNhExFpFg2WKQA4D9LHzJZ01zE
qA0/SkzSdBPkH5gOR+k6qoRniB9Mw4JeJmVFgwP/STOQdB+4ROhIIDcDZPqe/N8JsXtHhB/4gu9EH0ZB
2DgsSWngRkoIwy5G/yfwgu8KhcLAb/Dt6mEwvg6PcTFEjwTDYTeqrtwvUN85Ai8i23jLSV4lZEgGFSEI
ozf/hB/KUt+IEwACuYDYriIk/1B4hR/CsnsXJAMfaIbTdy7p7QYeArBrP0wI0rfsJyCHNjhDDxMwkEuf
av++AhC7LzCKYxBZJyB2MLdZxrn/FgPbdB9QIwJ3iDG7UIuF2gK35xLSsov/J1iMQl/Sma/bn3shJP86
H1hvi0YHQyhFZUToGhrSTAv/6MAnayDNmMBfeJDXAnuIIA+NvwjpXsT/HyAD9nRvLP8fQAVvTU2+s15v
bnVxSgUgdg9HrC9Qkp/ZCS+wAS8C1xNQBlXIZrI35KiTDsz01Bxkldc3SLITukNROF/SaDh9XHbvVAM3
GJa7B09yvzuwYHBw0i/DxszNzs9BrZWgeJUQIPy/wCGrTWLDQsxCzULOQs9BxrViN2FfrFeAnUewbMiS
j1ZDh8IGQPf33C/wZ8z3Dd+wUwKZKVcEoJhAYAmIn/sGx4wxN1nnTljgSScA4bI7NC+IpbIhFx6UhO5H
L/O5/wRKQewvGMc/3wwm2w5CL064rjAkTfeQd5QvuMGenTHSRm9vgUsGAlMA3TcwkGfMN1BNFrAbt9AI
Z5dEJnYT1mdEl/wv8NBfNGEBgwM3L5US3n2TsiQzPi/T/v/ZT9UdDrvRwCz/J6gYELgQr0ELd0kRCxJL
p0YekAy7B/8vyN9/5x2B35bvZCVTC7FCCy67sYTuZ7w3sOE1DwsgjiSvSTTdF+xYafMCwb/sL8D1fVtF
65xAUS9OE8RojCd0cWn4AAAAAABAAgD/uBsAAMoGAAACAAAAfkFykAADAFjqQgAgg5x9wPQHzNpODjLI
6PMA9Q0WZJBBHCsAQU7YRyDlQQfA5uzkyZPqsOkw5dAvw84ONifwWldAPw42yGAHsOAnMDp57GBPcOcX
kGMHUANA2cEGGxCPCAewMxeuHezswMk3SBfsCgMCIGcv7ABd4M/K3w8Baxjk5IXhFwmABQcjC3K2Y8sX
BkdssAnhYMtCrxtHCQ9hD5scEMGvOd13J7CPbIcAL0Hf4C+DnBUmGAcgCMiEPWQnMDBAB0AGu0A4ADM3
EBeAbFiQwQegAJcMdpE9sDJHoB+STTfYIA9KFxYDGNx2dpCzzBcgHM0PEl88e4Ed4HcwNhcOzoMMdiGH
FA8i9p1wkJPNGGgKvzY22GCDJxYXTA8NNw02yBBudCcLIbywgxeA2kfD5LfsjEN2XmcDCAMYN6TBBhsO
FygPBE+OspAxH1cHMtgBZp9/DyaEQU4OmMoIpT8McpSFZxQlQzbYYM8CF6snYGwzgHXIERdUKAAAZQm5
Kv8vflMJXPhY/ki/tgLSs8thBzj//6VgP4S/aZ+fPRn///8HGRfSDzb/J/gPIPjTD0jG2QPh1kIAUEjY
Dzr4///CTwIDBAUG5gkICgsMDQ4PEBESExQCFUJO9v8WFxgZGhscHR4fIAIAIQK2/+5/IiMkJSYCJwIo
CykqKwIsLS4vMAoxhN0O6w4yIzMCNAIAyn7YXzUCNgI3DDgCOQIAf/ueIDo7PAY9Aj4/QEFCQ4MKhO5E
RUYOR1J9HxuwSAtJBTsCAAEHA1MVVvoEBALn4wdDFkNhL/wHJ8GOzHQDGRcoC8QQdmQXKi8rFOzIgsMX
LAvZSGgkt4cPxEFOHqTeFaEEhcQjmw9HK+cfFkEu7K/aN41nNNggR3TwLxo5stkhTwU7FziFHWQIOS7b
X5GwT+KZAJfgU0AXIPXsYQ9AYxfgZze7wOjsaEAYaVcQF4TJwQYgBwBqbw5kH4zHMEdQdnuRvchn8HQf
QHg/dvZsKHoXkdyXRhdCKggNyPM3ejYYPXB8/4AHcIccrIawZ0KPh0CcPSxhLweQdxeYgjDYYE9PF22z
YRTsyBdyl//xRFIfYFFAH4BRQBA+O4GvegELwOBAn+PZJJWvNsfE5Dcy2MkLHwSKFy0QRoMNtw8MPwQY
5Owf3w8eLgMyhBzZFzAyyirIEDQfezKEPbDt5y+gMAcbsAY7bbcdNw0XkCFkADAywQYZZDsyircEGGSw
Kw+1FefBEMYLEPJfGnCQwSY3B/AQGwgJ4UkXG0EHFzLYYEdAX5AH4Hphhw3wF/Q3EPZsBrzAJwD3Hwc2
hJ0cwPhgL4AXMsiQDZAHoLCkIIMMwODPGSzYIwD5fweQZ4esBrjfnOEPDxISHFan4Zd6JDASf8cO4AKj
1EKX0k9hg53wUAh/gAcgJ03Ygw0wF7ACQW9YIRtsWCMXMDdYHWyw0BdAX9HgPzOANV18nyEXiJH9QkgU
LyTh/2YnJHhP4Y+1A9NF0iEhF10Cj7Czk+DA2a/iNyMXC4NncAoA7/ThvwYZbLBCJyQPZgMaZJBBMRHz
JHhkwQ+/cuMPTIAQJ33jVxCDDTYYL7svGRdvGQ8ySOcYAgAApwYbrBNwMWcyBzVkHyFNJ2AxQZeJpIdN
8D82QecT2RfZkDZHgDZBt2ANBi+yOx+QN+89LjB4gV9APkeJCJztGsATB0PlFx8nkRDKYFf/jCc8sleG
A5cp5Uc9shkvSAK7L5QEsIEQnxdgPkF3BxJeJPFwPs+gQMdkQwkvkEI/QB88OZRcgOBHcuY2LBJCX893
McjZFFA36RMQmDQY7wQ/7w3WYI+AWo9bh1zBOCyUvx9dH0kt7GAHGOd3Jwn0wh4C588YAzMG6Qih92UH
Z1hcWM8HhueXbu8ZQo4sF5LEEC6sn2+8538xVzgYF3YG6BclayroE1a8kNc/6E8RbLAujOmXS6+6J+Jg
wxglxzPf6BMGnbAf7eg/9tmL7GAPGwAA0Jcn9oST6L6uN+Qno6QP8uyseHKrZ5kHlpwQnjx5pHXwXWBu
Z54d7GziB3c/VqUHgJpssMFOZD+AH1Bfz549O3A3cGsPNawHO3hPng0Sr2EHYXRiXhvshCeQAfd0T5DH
bLDBBrwP4N+CR89eCBxlrv/gcQ9Sn0UHCwbHJ2B2TtiDjTe7r8BuQRdcq8mTZ0/HqQe2rVOrnhzk5Nul
9lRe5Z4y2MFO3hcQmwd0oLAPdtD3kHFCAABGVijsAi/fYbCYMkcg35sf2OSFPYCTB+CQACEcYUcFV7YH
DxaMFwa3lzcgomPAoFQIBxWzVySkeYC6nwAAAAAAgAQA/wAAAAAAAAABAABcsAEAUFLorwIAAFVTUVJI
Af5WSIn+SInXMdsxyUiDzf/oUAAAAAHbdALzw4seSIPu/BHbihbzw0iNBC+D+QWKEHYhSIP9/Hcbg+kE
ixBIg8AEg+kEiRdIjX8Ec++DwQSKEHQQSP/AiBeD6QGKEEiNfwF18PPD/EFbQYD4Ag+FhwAAAOsISP/G
iBdI/8eKFgHbdQqLHkiD7vwR24oWcuaNQQFB/9MRwAHbdQqLHkiD7vwR24oWc+uD6ANyF8HgCA+20gnQ
SP/Gg/D/D4Q8AAAASGPojUEBQf/TEclB/9MRyXUYicGDwAJB/9MRyQHbdQiLHkiD7vwR23PtSIH9APP/
/xHB6DD////rg1deWUiJ8EgpyFpIKddZiTlbXcNoHgAAAFrowwAAAFBST1RfRVhFQ3xQUk9UX1dSSVRF
IGZhaWxlZC4KAAoAJEluZm86IFRoaXMgZmlsZSBpcyBwYWNrZWQgd2l0aCB0aGUgVVBYIGV4ZWN1dGFi
bGUgcGFja2VyIGh0dHA6Ly91cHguc2YubmV0ICQKACRJZDogVVBYIDMuOTYgQ29weXJpZ2h0IChDKSAx
OTk2LTIwMjAgdGhlIFVQWCBUZWFtLiBBbGwgUmlnaHRzIFJlc2VydmVkLiAkCgCQag5aV17rAV5qAl9q
AVgPBWp/X2o8WA8FXyn2agJYDwWFwHjcUEiNtw8AAACtg+D+QYnGVlutkkgB2q1Bla1JAfVIjY31////
RIs5TCn5RSn3X0gpylJQSSnNV1FNKclBg8j/aiJBWlJeagNaKf9qCVgPBUkBxkiJRCQQSJdEi0QkCGoS
QVpMie5qCVgPBUiLVCQYWVFIAcJIKchJicRIAehQSCUA8P//UEgpwlJIid6tUEiJ4UqNFCNJidWtUK1B
kEiJ917/1VleX11qBVpqClgPBUH/5V3oPP///y9wcm9jL3NlbGYvZXhlAAABAAAPCAAAbAYAAAJJDQD/
///l6EoAg/lJdURTV0iNTDf9XlZb6y9IOc5zMlZe//v//6w8gHIKPI93BoB+/g90BizoPAF35BsWVq0o
0HX//7//318PyCn4AdirEgOs699bw1hBVkFXUEiJ5kiB7P7t/9sAEFlUX2oKWfNIpUiDPgAFdfhJif5I
q7Z0s8sM/AoM9v8C/t9u//VNKfy6/w83V16Me+1qWVgPBYXAeQXbb//fDmoPWJH9SY19/7AAqhp0Dv/z
pDvv/2/b9gPHByAAPTg+DOf4TIn5SCnhicgxb9tb/viD8AiD4AjHbyYIOHf4SP/t/+/B6QOJjWcI/EuN
DCaLQ/wjAUgBwUFZXl/37da+WK8Id7niUDPo6KwFC/v/P3aBxAgSRCQgW0UpyUGJ2GoCQVpqAVq+2rbu
3fZqANsJn4nfagMGX6IL/tu33/3/ZviwCUDKD7bAEkg9APD//3IEmqb734HI/8OwPOsCsAwDAwILoeGm
aQoBAOvOhlFHtt2/fRdMi0e3jUr/cwq/fxLoxUD/27+13z/5/3QRQVOL/8lJ/8CIBgfG29t32+vpulfi
F1jDQVVx1UFUBMx+eGu3Vaz9UwPmg+woWg+E5nX/3uBELyQQugwJie/ollGL9n9hu9IQixQUW3UVgf5V
UFghdREvG+y77n0AMLUm6wSF9nWARC57Yfu/OcZ38onCSDsTd+sKSDgIc2xJ67budlQkfYt9rEwIRFAY
Epr7um3C/9VSxl5IXxzt/63dLnW4tyEZhMkPlcIxwE2F5Adf2F74wIXCdB1d/gACX3clOTN1D223bWsj
ThoEyTV7CETUc2/N1kAU3kVFjA2J8rcCNtvXfcbo2/66VFsDHVPQSP2P8NZuGAPpFCXEKFtdQVxBXcOF
7b+jFUvRdDZA9scBdTAtD7pZczf88Ew5wXQSSQEPlIffhjW628YIMwcCTwgyyeBwdBe+HscQ69BPV7j5
AJG/4dLgzVv9VVNSaEwDbyBmax237YN/EH2J0jC5BAA8qrsN20JqietAEDxMFyAPv429/bdXOA9EyHaE
JKAh7jvN/zHbMdsKv/D/g8Ei3wD/ynghm5gWIe52+21GyjnoSA9CAwNGRTnDCrbHwrfYLMY469se5Tzi
6/DfdtoJwxEG4xD2wRB0BcbWeNsO6xOx7XUO7F7HXqPxjcIQV29FyEUxpGsWmvu2MdIg3uh0/T4cnwRu
f7aVJaMc0f5JKe5mI384thluMdZuhKKDcXy+M/yN9gB0IhcBBnUbSYtVYRK3ofR7ML4DvgHyDXfpYSna
yy48IUCFVjRJSRK6P2WXJHVCNEkDVyDoczhJg32cHQ8aBVBfEzbe/zwnBEuLRRBBi00EwW3fvutNILQY
QGJRc0vwg+EHusRC+1v3sVglKPLlweEC02wfJGwf24cag2QJB5BQK+C297dtGOrj7CsIuTLzMAj88ez2
G50p6LN1B648sRL7tn10ShimEFzBU+eDygIg2+6uMLwY6DT8kznE7SV1DW2SARku4Eg4KLvN/T1UUMJA
6HwpCWxi990jLXVnkfa7ArJICIkOduPW6fx/PAR086pfhNzbsT3nmN/7Wri8/wGqbbx34yPtSLoJAw7Q
hW07tnuUwVUoA02lOxTH3vANzQpKjRww+dj32CX9+APD+C3CdzmFGFwxDHQtBb1Yh+7/uSI9uo+wcJv7
yf1Y6Fr7rzjDdDeQhccRDretA6xaDBK6oJEtwmNvG9/oXibbdBOoEZLgbuDaMfZl/uie7joGa3MbN+g1
KE50MBOtwj/2NvgB6EkBxEw7nS8vlnvuJ0wpBjWdGqLxCL8IoEHI+mt1vf+4e3vLqei3RzjQxTg5DA+M
Xqm1k/THSzBN7XnqyfTbZGgQ8EFeQV+yqgJL3ULFzvlVrE0Io5m2P9VMjW1AUyDDuT8fYt94m8QYBD6N
vCSA49g2d9iGIMbbmDgpwrvbFvg1MIAEFHy+g8AMELbStvsQ6JydQVNV4Vhj2Ltb99on8Y43KHXo0O2+
CeB2bGNNwhn3puh+EhxuNWhTKCl9OHTwSRsOePOPAD8DdXLwQru0zT8efRBOUejw+Xfp++08pXgXugAE
Ru6z6OsUQXcIb0g9D1W9EUnoNsOv7UpBUEMCwOxXd3MNRJTUSXNVF74gcA1usIb3tcWMOIYsNDTfVwxW
RQnbCdwLgnEySC3gSgAAQIRHIAEAAP8A0AsAABIAAAACAAAAyaiqkgAAgFBQAgAAAAAAAED/SAQAAFkB
AAACAAAA7f///0dDQzogKEdOVSkgNi40LjAAAC5zaHN0cnRhYgnfXPP2aW5pdAV0ZXhmDAVyb2Rhlv1/
axoHZWhfZnJhbWVfaGRyDbfXfuYrHnRic3MFCzFlbLE2e3M1DGdvdBEFHEOAte1jb20wbhMAC2AP1nQD
AQYPkAFAByEbsrMPAy8BD8EGGbIRP6CgKGTIJuwmvgIvED8XAmywh8a/QgcCf4MdFmwdE2XgP+DILuwg
S2EvID9ZsIdkJSwhQwd5ZMgu7BQKLwQ/M1mbPORwQCsHP2zILuwQPy8IPz1/WbAHGwNYIHZjBz9YsIvs
MAC/RFM/JYMMcmBQiHJhhw1KfwA/YCG5SA7gF1fAnrXJQI4HEbgB/42QHbYHXD94InvWZj8HEdgBf2eH
MOxi//+RP9hgF9mzkRFIGz9nfxiHjYRnPxF/AOnAQgcDVxDKGGzpP3C/AAAAAAAASAD/AAAAAFVQWCEA
AAAAAFVQWCENFgIKNWw/vY9i+QlIBAAAWQEAACCWAwBJDQCN9AAAAA==
"; |
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()))
A = []
cnt = 0
for i in range(n-1):
A.append(a[i])
if sum(A) > 0:
while sum(A) + a[i+1] >= 0:
a[i+1] -= 1
cnt += 1
elif sum(A) < 0:
while sum(A) + a[i+1] <= 0:
a[i+1] += 1
cnt += 1
if sum(a) == 0:
cnt += 1
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 | 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]
print i,p_s,s
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 | python3 | n=int(input())
a = list(map(int,input().split()))
sum_tmp = a[0]
ans = 0
if sum_tmp > 0:
target = -1
elif sum_tmp < 0:
target = 1
else:
sum_tmp += 1
ans += 1
target = -1
for i in range(1,n):
sum_tmp += a[i]
if target == -1:
if sum_tmp > -1:
diff = sum_tmp + 1
ans += diff
sum_tmp -= diff
target = 1
else:
target = 1
else:
if sum_tmp < 1:
diff = 1 - sum_tmp
ans += diff
sum_tmp += diff
target = -1
else:
target = -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;
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 (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;
int n;
int a[100010];
long long sum[100010];
bool p[100010];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int cnt = 0;
if (a[0] == 0) {
if (a[1] > 0) {
sum[0] = -1;
} else {
sum[0] = 1;
}
cnt++;
} else {
sum[0] = a[0];
}
for (int i = 1; i < n; i++) {
sum[i] += sum[i - 1] + a[i];
if (sum[i - 1] < 0) {
if (sum[i] <= 0) {
while (sum[i] <= 0) {
sum[i]++;
cnt++;
}
} else {
continue;
}
} else if (sum[i - 1] > 0) {
if (sum[i] >= 0) {
while (sum[i] >= 0) {
sum[i]--;
cnt++;
}
} else {
continue;
}
}
}
cout << cnt << 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()))
s_prev = s = A.pop(0)
ans = 0
#条件を満たしている数列を判定する
for a in A:
s = s_prev+a
#print("s={}".format(s))
if s_prev*s < 0:
s_prev += a
#print("s_prev={}".format(s_prev))
continue
else:
ans += abs(s_prev+a) + 1
#print("ans={}".format(ans))
s_prev = (s_prev<0)-(s_prev>0)
#print("s_prev={}".format(s_prev))
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 dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MAX_N = int(1e5);
long long n, a[MAX_N], dp[MAX_N];
void solve() {
long long sum_diff = 0, ans = 0;
if (dp[0] == 0) {
if (dp[1] < 0) {
dp[0] = 1;
sum_diff++, ans++;
} else {
dp[0] = -1;
sum_diff--, ans++;
}
}
for (long long i = 0; i < (long long)(n - 1); i++) {
long long diff = 0;
dp[i + 1] += sum_diff;
if (dp[i] * dp[i + 1] > 0) {
if (dp[i + 1] > 0) {
diff = -1 - dp[i + 1];
sum_diff += diff;
dp[i + 1] = -1;
} else {
diff = 1 - dp[i + 1];
sum_diff += diff;
dp[i + 1] = 1;
}
}
if (dp[i + 1] == 0) {
if (dp[i] > 0) {
sum_diff--, diff--;
dp[i + 1] = -1;
} else {
sum_diff++, diff++;
dp[i + 1] = 1;
}
}
ans += abs(diff);
}
cout << ans << endl;
}
int main() {
cin >> n;
for (long long i = 0; i < (long long)(n); i++) {
cin >> a[i];
if (i == 0)
dp[0] = a[0];
else
dp[i] = dp[i - 1] + 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 | java | import java.util.Scanner;
public class Main {
public static double sequence(int a[], double start) {
double count = 0.0, presum = -1.0 * start, sum = 0.0;
for(int i : a) {
sum += (double)i;
if(i == 0)sum += start;
if(sum * presum > 0) {
double min = Math.abs(sum) + 1;
if(presum > 0)sum -= min;
else sum += min;
count += min;
}
if(sum == 0) {
if(presum > 0)sum--;
else sum++;
++count;
}
presum = sum;
}
return count;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n, a[];
double count = 0.0, tmp2 = 0.0, tmp3 = 0.0;
n = sc.nextInt();
a = new int[n];
for(int i = 0; i < n; ++i) a[i] = sc.nextInt();
sc.close();
if(a[0] == 0) {
a[0]++;
++tmp3;
}
int tmp = Math.abs(a[0]) + 1;
if(a[0] > 0) {
tmp = a[0] - tmp;
tmp2 = tmp + tmp3;
}
else {
tmp = a[0] + tmp;
tmp2 = tmp + tmp3;
}
count = Math.min(tmp3 + sequence(a, (double)a[0]),tmp2 + sequence(a, (double)tmp));
System.out.printf("%.0f\n", 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() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int acum = arr[0], aux;
bool sign = acum < 0 ? false : true;
int sol = 0;
for (int i = 1; i < n; i++) {
aux = acum + arr[i];
if (sign) {
if (aux >= 0) {
sol += abs(acum + 1 + arr[i]);
arr[i] = -(acum + 1);
}
sign = false;
} else {
if (aux <= 0) {
sol += abs(acum - 1 + arr[i]);
arr[i] = -(acum - 1);
}
sign = true;
}
acum = acum + arr[i];
}
cout << sol << "\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 ll = long signed long;
using ull = long unsigned long;
using ld = long double;
using P = pair<int, int>;
using llP = pair<ll, ll>;
using DoP = pair<double, double>;
template <class T>
inline bool chmin(T &a, const T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, const T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T>
inline void line_out(const vector<T> vec) {
int n = ((int)(vec).size());
for (int i = 0; i < n; ++i) {
cout << vec[i];
if (i < n - 1) cout << " ";
}
cout << endl;
}
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1 << 28;
const ll INF64 = 1ll << 60;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod) x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint &operator++() {
if ((x += 1) >= mod) x -= mod;
return *this;
}
mint &operator--() {
if ((x += mod - 1) >= mod) x -= mod;
return *this;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1) a *= *this;
return a;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; ++i) cin >> a[i];
ll sum1 = 0, sum2 = 0;
ll ans1 = 0, ans2 = 0;
for (int i = 0; i < n; ++i) {
sum1 += a[i];
if (i % 2 == 0 && sum1 <= 0) {
ans1 += 1 - sum1;
sum1 = 1;
} else if (i % 2 == 1 && sum1 >= 0) {
ans1 += sum1 + 1;
sum1 = -1;
}
}
for (int i = 0; i < n; ++i) {
sum2 += a[i];
if (i % 2 == 0 && sum2 >= 0) {
ans2 += sum2 + 1;
sum2 = -1;
} else if (i % 2 == 1 && sum2 <= 0) {
ans2 += 1 - sum2;
sum2 = -1;
}
}
cout << min(ans1, ans2) << 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() {
int64_t n;
cin >> n;
int64_t a[n], b[n];
for (int64_t i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
int64_t case1, total;
if (a[0] > 0) {
case1 = 0;
total = a[0];
} else {
case1 = 1 - a[0];
total = 1;
}
for (int64_t i = 1; i < n; i++) {
int64_t ttmp = total + a[i];
int64_t atmp = a[i];
if ((ttmp * total) < 0 && ttmp != 0) {
total = ttmp;
} else {
if (total > 0) {
a[i] = -total - 1;
} else {
a[i] = -total + 1;
}
total += a[i];
}
case1 += abs(a[i] - atmp);
}
int64_t case2;
if (b[0] < 0) {
case2 = 0;
total = b[0];
} else {
case2 = -1 - b[0];
total = -1;
}
for (int64_t i = 1; i < n; i++) {
int64_t ttmp = total + b[i];
int64_t atmp = b[i];
if ((ttmp * total) < 0 && ttmp != 0) {
total = ttmp;
} else {
if (total > 0) {
b[i] = -total - 1;
} else {
b[i] = -total + 1;
}
total += b[i];
}
case2 += abs(b[i] - atmp);
}
cout << min(case1, case2) << 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 pwr(long long base, long long exp, long long mod = (1000000007LL)) {
long long res = 1;
while (exp > 0) {
if (exp % 2) {
res = (res * base) % mod;
}
base = (base * base) % mod;
exp /= 2;
}
return res;
}
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
gcd(b, a % b);
}
bool isPrime(long long n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (long long int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
inline string rs() {
char x[1234567];
scanf("%s", x);
string s = x;
return s;
}
inline long long int ri() {
long long int x;
scanf("%d", &x);
return x;
}
inline long long rl() {
long long x;
scanf("%lld", &x);
return x;
}
const long long int N = 1234567;
long long int n;
long long int a[N];
long long int solve() {
long long int res = 0;
long long int cur = 0;
for (long long int i = 0; i < n; i++) {
cur += a[i];
if (i % 2 == 0) {
if (cur <= 0) {
res += (abs(cur) + 1);
cur += res;
} else {
continue;
}
} else {
if (cur >= 0) {
res += (abs(cur) + 1);
cur -= res;
} else {
continue;
}
}
}
return res;
}
int32_t main() {
scanf("%lld", &n);
for (long long int i = 0; i < n; i++) {
scanf("%lld", a + i);
}
long long int ans = solve();
for (long long int i = 0; i < n; i++) {
a[i] *= -1;
}
ans = min(ans, solve());
printf("%lld\n", 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 | python3 | import sys
import collections
ns = lambda: sys.stdin.readline().rstrip()
ni = lambda: int(ns())
nm = lambda: map(int, sys.stdin.readline().split())
nl = lambda: list(nm())
nsl = lambda: map(str, sys.stdin.readline().split())
n = ni()
a = nl()
summ = [0 for i in range(n + 1)]
for i in range(n):
summ[i + 1] = summ[i] + a[i]
diff = 0
temp = 0
ans = 0
zerocount = 0
for i in range(2, n + 1):
summ[i] += temp
summ[i - 1] += diff
diff = 0
if summ[i - 1] * summ[i] >= 0:
if summ[i] < 0:
ans += zerocount
zerocount = 0
diff += -summ[i] + 1
elif summ[i] > 0:
ans += zerocount
zerocount = 0
diff -= summ[i] + 1
else:
if summ[i - 1] > 0:
diff -= 1
elif summ[i - 1] < 0:
diff += 1
else:
zerocount += 1
temp += diff
ans += abs(diff)
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;
bool prime(long long n) {
for (long long i = 2; i <= sqrt(n); i++) {
if (n % i == 0) return false;
}
return n != 1;
}
long long gcd(long long x, long long y) {
if (y == 0) return x;
return gcd(y, x % y);
}
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
long long mod_pow(long long n, long long p, long long m) {
if (p == 0) return 1;
if (p % 2 == 0) {
long long t = mod_pow(n, p / 2, m);
return (t * t) % m;
}
return n * mod_pow(n, p - 1, m) % m;
}
long long extGCD(long long a, long long b, long long& x, long long& y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
signed main() {
long long n, ans = 0;
cin >> n;
long long a[100006];
for (long long i = 0; i < n; i++) {
cin >> a[i];
}
long long old = a[0];
for (long long i = 1; i < n; i++) {
long long now = old + a[i];
if ((now < 0 && old > 0) || (now > 0 && old < 0)) {
old = now;
} else if (now < 0 && old <= 0) {
ans += 1 - now;
old = now + (1 - now);
} else {
ans += now + 1;
old = now - (now + 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;
cin >> n;
int d[n];
for (int i = 0; i < n; i++) {
cin >> d[i];
}
int count = 0;
int sum = d[0];
int f = 0;
if (d[0] > 0) {
f = -1;
}
if (d[0] < 0) {
f = 1;
}
for (int i = 1; i < n; i++) {
sum += d[i];
if (sum == 0) {
if (f == 1) {
count++;
f = -1;
sum = 1;
continue;
}
if (f == -1) {
count++;
f = 1;
sum = -1;
continue;
}
}
if (sum > 0) {
if (f == 1) {
f = -1;
continue;
}
if (f == -1) {
count += sum + 1;
sum = -1;
f = 1;
continue;
}
}
if (sum < 0) {
if (f == -1) {
f = 1;
continue;
}
if (f == 1) {
count += 1 - sum;
sum = 1;
f = -1;
continue;
}
}
}
int ccount = 0;
int ssum;
int ff = 0;
if (d[0] > 0) {
ff = 1;
ccount = 1 + d[0];
ssum = -1;
}
if (d[0] < 0) {
ff = -1;
ccount = 1 - d[0];
ssum = 1;
}
for (int i = 1; i < n; i++) {
ssum += d[i];
if (ssum == 0) {
if (ff == 1) {
ccount++;
ff = -1;
ssum = 1;
continue;
}
if (ff == -1) {
ccount++;
ff = 1;
ssum = -1;
continue;
}
}
if (ssum > 0) {
if (ff == 1) {
ff = -1;
continue;
}
if (ff == -1) {
ccount += ssum + 1;
ssum = -1;
ff = 1;
continue;
}
}
if (ssum < 0) {
if (ff == -1) {
ff = 1;
continue;
}
if (ff == 1) {
ccount += 1 - ssum;
ssum = 1;
ff = -1;
continue;
}
}
}
cout << min(count, ccount) << 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 sum1 = 0, sum2 = 0;
int ans1 = 0, ans2 = 0;
int first;
cin >> first;
if (first > 0) {
sum1 = first;
sum2 = -first;
ans2 += first * 2;
} else if (first < 0) {
sum1 = -first;
sum2 = first;
ans1 += -first * 2;
} else {
sum1 = 1;
sum2 = -1;
ans1++, ans2++;
}
for (int i = 0; i < n - 1; i++) {
int a;
cin >> a;
if (sum1 > 0) {
if (sum1 + a >= 0) {
ans1 += abs(-sum1 - 1 - a);
sum1 = -1;
} else {
sum1 += a;
}
} else if (sum1 < 0) {
if (sum1 + a <= 0) {
ans1 += -sum1 + 1 - a;
sum1 = 1;
} else {
sum1 += a;
}
}
if (sum2 > 0) {
if (sum2 + a >= 0) {
ans2 += abs(-sum2 - 1 - a);
sum2 = -1;
} else {
sum2 += a;
}
} else if (sum2 < 0) {
if (sum2 + a <= 0) {
ans2 += -sum2 + 1 - a;
sum2 = 1;
} else {
sum2 += a;
}
}
}
cout << min(ans1, ans2) << 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 | java | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] a = new int[n];
int[] s = new int[n];
int sum = 0;
int count1 = 0,count2 = 0;
for(int i=0;i<n;i++){
a[i] = scanner.nextInt();
}
for(int i=0;i<n;i++){
if(i % 2 == 0 && sum + a[i] <= 0){
count1 += Math.abs(sum + a[i] - 1);
sum = 1;
}else if(i % 2 == 1 && sum + a[i] >= 0){
count1 += sum + a[i] + 1;
sum = -1;
}else{
sum += a[i];
}
}
for(int i=0;i<n;i++){
if(i % 2 == 1 && sum + a[i] <= 0){
count2 += Math.abs(sum + a[i] -1);
sum = 1;
}else if(i % 2 == 0 && sum + a[i] >= 0){
count2 += sum + a[i] + 1;
sum = -1;
}else{
sum += a[i];
}
}
System.out.println(Math.min(count1,count2));
}
}
|
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 = -1;
ans++;
} else {
tem = 1;
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(-1 - (tem + a[i]));
tem = -1;
} else {
ans += abs(1 - (tem + a[i]));
tem = 1;
}
}
}
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 (0 <= a[0]) {
bb = -1;
} else {
bb = 1;
}
ansdel = abs(a[0]) + 1;
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 | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
long N[100000], E[100000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> N[i];
}
for (int i = 0; i < n; i++) {
E[i] = N[i];
}
int sumA = 0, sumB = 0;
int ansA = 0, ansB = 0;
for (int i = 0; i < n; i++) {
sumA = sumA + N[i];
if (i % 2 == 0 && sumA <= 0) {
N[i] = N[i] - sumA + 1;
ansA = ansA - sumA + 1;
sumA = 1;
}
if (i % 2 == 1 && sumA >= 0) {
N[i] = N[i] - sumA - 1;
ansA = ansA + sumA + 1;
sumA = -1;
}
}
for (int i = 0; i < n; i++) {
sumB = sumB + E[i];
if (i % 2 == 0 && sumB >= 0) {
E[i] = E[i] - sumB - 1;
ansB = ansB + sumB + 1;
sumB = -1;
}
if (i % 2 == 1 && sumB <= 0) {
E[i] = E[i] - sumB + 1;
ansB = ansB - sumB + 1;
sumB = 1;
}
}
int ans;
ans = min(ansA, ansB);
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>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int ans = 1100000000;
for (int p = 0; p <= 1; p++) {
int sum = 0;
int tmp = 0;
for (int i = 0; i < N; i++) {
sum += a[i];
if (i % 2 == p) {
if (sum <= 0) {
tmp += -sum + 1;
sum = 1;
}
} else {
if (sum >= 0) {
tmp += sum + 1;
sum = -1;
}
}
}
ans = min(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 | UNKNOWN | def solve(n, a)
(n-1).times{|i|a[i+1]+=a[i]}
sum=res=0
(n-1).times do |i|
a[i+1] += sum
next if a[i]*a[i+1]<0
if a[i+1]==0
res += 1
sum -= a[i]/a[i].abs
else
res += a[i+1].abs + 1
sum -= a[i+1] + a[i+1]/a[i+1].abs
end
a[i+1] = -a[i]/a[i].abs
end
return res
end
n=gets.to_i
a=gets.split.map &:to_i
if a[0]!=0
p solve(n, a)
else
a[0]=1
s1 = 1+solve(n, a)
a[0]=-1
s2 = 1+solve(n, a)
p [s1, s2].min
end
|
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 argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a[100001];
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
long long int res_even = 0, sum_a = 0;
for (int i = 0; i < n; ++i) {
sum_a += a[i];
if (i % 2 == 0 && sum_a <= 0) res_even += abs(sum_a) + 1;
if (i % 2 == 1 && sum_a >= 0) res_even += sum_a + 1;
}
long long int res_odd = 0;
sum_a = 0;
for (int i = 0; i < n; ++i) {
sum_a += a[i];
if (i % 2 == 0 && sum_a >= 0) res_odd += sum_a + 1;
if (i % 2 == 1 && sum_a <= 0) res_odd += abs(sum_a) + 1;
}
cout << min(res_even, res_odd) << 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, ans1 = 0, ans2 = 0, d = 0;
cin >> n >> a;
int sum[n];
sum[0] = a;
for (int i = 1; i < n; i++) {
cin >> a;
sum[i] = sum[i - 1] + a;
}
if (sum[0] <= 0) {
d = -sum[0] + 1;
ans1 = d;
}
for (int i = 1; i < n; i++) {
if ((sum[i - 1] + d) * (sum[i] + d) >= 0) {
ans1 += abs(sum[i] + d) + 1;
if (sum[i - 1] + d < 0) {
d += -(sum[i] + d) + 1;
} else if (sum[i - 1] + d > 0) {
d += -(sum[i] + d) - 1;
}
}
}
if (sum[0] >= 0) {
d = -sum[0] - 1;
ans2 -= d;
}
for (int i = 1; i < n; i++) {
if ((sum[i - 1] + d) * (sum[i] + d) >= 0) {
ans2 += abs(sum[i] + d) + 1;
if (sum[i - 1] + d < 0) {
d += -(sum[i] + d) + 1;
} else if (sum[i - 1] + d > 0) {
d += -(sum[i] + d) - 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;
string to_hex(int x) {
stringstream ss;
ss << hex << x;
return ss.str();
}
inline int get_int() {
int ret;
scanf("%d", &ret);
return ret;
}
inline vector<int> get_ints(int n) {
vector<int> ret(n);
for (int i = 0; i < (int)n; i++) {
scanf("%d", &ret[i]);
}
return ret;
}
inline string get_str() {
string ret;
cin >> ret;
return ret;
}
bool is_prime(int n) {
int s = sqrt(n) + 1;
for (int i = 2; i <= s; ++i) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
vector<pair<int, int> > prime_division(int n) {
vector<pair<int, int> > ret;
int s = sqrt(n) + 1;
int c = 0;
for (int i = 2; i <= n; ++i) {
if (n % i == 0) {
c = 0;
do {
++c;
n /= i;
} while (n % i == 0);
ret.push_back(pair<int, int>(i, c));
}
}
return ret;
}
string to_string(string s) { return s; }
template <class T>
string to_string(vector<T> v) {
string ret = "{";
for (int i = 0; i < (int)v.size() - 1; i++) {
ret += to_string(v[i]) + ",";
}
if (v.size() > 0) {
ret += to_string((v)[(v).size() - 1]);
}
ret += "}";
return ret;
}
void debug_print() { cerr << endl; }
template <class Head, class... Tail>
void debug_print(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug_print(tail...);
}
template <class... T>
void debug(T... args) {
cerr << "[" << 85 << "]: ";
debug_print(args...);
}
void print() { cout << endl; }
template <class Head, class... Tail>
void print(Head head, Tail... tail) {
cout << to_string(head);
print(tail...);
}
int main() {
int(n);
scanf("%d", &(n));
vector<int>(a)(n);
for (int i = 0; i < (int)(n); i++) scanf("%d", &(a)[i]);
long long ans1 = 0, sum = a[0];
if (a[0] == 0) {
ans1 = 1;
sum += 1;
}
for (int i = 0; i < (int)n - 1; i++) {
if (sum < 0 && sum + a[i] <= 0) {
ans1 += 1 - (sum + a[i]);
sum = 1;
} else if (sum > 0 && sum + a[i] >= 0) {
ans1 += (sum + a[i]) + 1;
sum = -1;
} else {
sum += a[i];
}
}
long long ans2 = 0;
sum = 0;
if (a[0] == 0) {
ans2 = 1;
sum -= 1;
} else {
ans2 = abs(a[0]) + 1;
sum = a[0] < 0 ? 1 : -1;
}
for (int i = 0; i < (int)n - 1; i++) {
if (sum < 0 && sum + a[i] <= 0) {
ans2 += 1 - (sum + a[i]);
sum = 1;
} else if (sum > 0 && sum + a[i] >= 0) {
ans2 += (sum + a[i]) + 1;
sum = -1;
} else {
sum += a[i];
}
}
print(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 | cpp | #include <bits/stdc++/h>
using namespace std;
int change_num(int a[], int N)
int res
int sum = a[0];
for (int i = 1; i < N; i++) {
if(sum * (sum + a[i]) < 0) continue;
if(sum > 0 && sum + a[i] >= 0) {
sum += a[i];
while (sum + a[i] >= 0) {
res++;
sum--;
}
} else if (sum < 0 && sum + a[i] < 0) {
while (sum + a[i] <= 0) {
res++;
sum++;
}
}
}
return res;
}
int main() {
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++)
cin >> a[i];
int ans = 0;
int sum = a[0];
if (a[0] == 0) {
int plus_ans;
a[0] = 1;
plus_ans = change_num(a, N) + 1;
int minus_ans = 1;
a[0] = -1;
minus_ans = change_num(a, N) + 1;
if(plus_ans < minus_ans) {
ans = plus_ans;
} else {
ans = minus_ans;
}
} else {
ans = change_num(a)
}
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 | import copy
n = int(input())
a = list(map(int, input().split()))
check = copy.deepcopy(a)
#####segfunc######
def segfunc(x,y):
return x+y
def init(init_val):
#set_val
for i in range(len(init_val)):
seg[i+num-1]=init_val[i]
#built
for i in range(num-2,-1,-1) :
seg[i]=segfunc(seg[2*i+1],seg[2*i+2])
def update(k,x):
k += num-1
seg[k] = x
while k:
k = (k-1)//2
seg[k] = segfunc(seg[k*2+1],seg[k*2+2])
def query(p,q):
if q<=p:
return ide_ele
p += num-1
q += num-2
res=ide_ele
while q-p>1:
if p&1 == 0:
res = segfunc(res,seg[p])
if q&1 == 1:
res = segfunc(res,seg[q])
q -= 1
p = p//2
q = (q-1)//2
if p == q:
res = segfunc(res,seg[p])
else:
res = segfunc(segfunc(res,seg[p]),seg[q])
return res
#####単位元######
ide_ele = 0
num =2**(n-1).bit_length()
seg=[ide_ele]*(2*num - 1)
init(a)
ans_1 = 0
pre_sum = (-1) * a[0]
for i in range(n):
q_sum = query(0,i+1)
if q_sum * pre_sum >= 0:
if pre_sum < 0:
update(i, abs(pre_sum) + 1)
else:
update(i, (-1) * (pre_sum+1))
pre_sum = query(0,i+1)
for i in range(n):
ans_1 += abs(check[i] - seg[i + num - 1])
if a[0] == 0:
a[0] = 1
else:
a[0] *= -1
ans_2 = 0
pre_sum = (-1) * a[0]
init(a)
for i in range(n):
q_sum = query(0,i+1)
if q_sum * pre_sum >= 0:
if pre_sum < 0:
update(i, abs(pre_sum) + 1)
else:
update(i, (-1) * (pre_sum+1))
pre_sum = query(0,i+1)
for i in range(n):
ans_2 += abs(check[i] - seg[i + num - 1])
print(min(ans_1,ans_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;
int main() {
long long n;
cin >> n;
long long l1[n + 1];
long long x = 0, s = 0;
for (int i = 1; i <= n; i++) {
cin >> l1[i];
x += l1[i];
if (i >= 2) {
if (x - l1[i] < 0 && x <= 0) {
s += abs((-x + l1[i] + 1) - l1[i]);
l1[i] = l1[i] - x + 1;
x = 1;
} else if (x - l1[i] > 0 && x >= 0) {
s += abs(-(x - l1[i] + 1) - l1[i]);
l1[i] = -(x - l1[i] + 1);
x = -1;
}
}
}
cout << s << 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>
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MOD 1000000007
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; }
typedef long long ll;
typedef pair<ll, ll> p;
int n;
vector<int> v;
ll solve(int a){
ll sum = 0;
ll res = 0;
// if(sum == 0){
// sum = a*1;
// res = a*1;
// }
for (int i = 0; i < n; ++i) {
if((i % 2 == a && (sum + v[i]) < 0) || (i % 2 == 0) && sum +v[i] > 0){
sum += v[i];
continue;
}
ll remain = 0;
if(i % 2 == a){
remain = -1 - v[i] - sum;
}else{
remain = 1 - v[i] - sum;
}
// cout << remain << endl;
res += abs(remain);
sum += remain + v[i];
// cout << sum << endl;
// cout << "===" << endl;
}
// cout << "===" << endl;
return res;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
v = vector<int> (n);
rep(i, n) cin >> v[i];
ll res = min(solve(1), solve(0));
cout << res << endl;
// cout << solve(0) << 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 <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <cstdlib>
#include <utility>
#include <cstdio>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <cmath>
#include <set>
#include <map>
using ll = long long;
using itn = int;
using namespace std;
int GCD(int a, int b){
return b ? GCD(b, a%b) : a;
}
int main() {
int n;
cin >> n;
int a[n];
for(int i=0; i<n; i++){
cin >> a[i];
}
int asum[n+1]={};
for(int i=0; i<n; i++){
asum[i+1] = asum[i]+a[i];
}
int cnt=0;
int accSum=0;
for(int i=1; i<n; i++){
asum[i+1]+=accSum;
if(asum[i+1]*asum[i]>0){
int s=abs(asum[i+1])+1;
cnt+=s;
asum[i+1]<0 ? accSum+=s : accSum+=-1*s;
asum[i+1]<0 ? asum[i+1]=1 : asum[i+1]=-1;
}else if(asum[i+1]*asum[i]==0){
cnt+=1;
asum[i]<0 ? asum[i+1]=1,accSum+=1 : asum[i+1]=-1,accSum+=-1;
}
}
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 | python3 | n = int(input())
a = list(map(int,input().split()))
sums = 0
count = 0
for i in range(n):
sums = sums + a[i]
if i % 2 ==0 :
if sums > 0:
None
else:
count = count + 1 -sums
sums = 1
else:
if sums < 0:
None
else:
count = count + 1 + sums
sums = -1
count2 = 0
sums2 = 0
for i in range(n):
sums2 = sums2 + a[i]
if i % 2 ==0 :
if sums > 0:
None
else:
count2 = count2 + 1 -sums2
sums2 = 1
else:
if sums2 < 0:
None
else:
count2 = count2 + 1 + sums2
sums2 = -1
print(min(count,count2)) |
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;
void answer1() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for (int& a_i : a) {
cin >> a_i;
}
if (a.at(0) == 0) {
cout << "zero desu" << endl;
}
int count = 0;
int sum = a.at(0);
bool is_positive = a.at(0) > 0;
for (int i = 1; i < a.size(); i++) {
is_positive = !is_positive;
sum += a.at(i);
if (is_positive) {
while (sum > 0) {
count++;
sum++;
}
} else {
while (sum < 0) {
count++;
sum--;
}
}
cout << sum << endl;
}
cout << count << endl;
}
void answer2() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for (int& a_i : a) {
cin >> a_i;
}
int count = 0;
int sum = a.at(0);
bool is_positive = a.at(0) > 0;
for (int i = 1; i < a.size(); i++) {
sum += a.at(i);
is_positive = !is_positive;
if (is_positive) {
if (sum > 0) {
continue;
} else {
int diff = 1 - sum;
count += diff;
sum += diff;
}
} else {
if (sum < 0) {
continue;
} else {
int diff = 1 + sum;
count += diff;
sum -= diff;
}
}
}
cout << count << endl;
}
int main() { answer2(); }
|
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, p_m = 0, m_p = 0;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) cin >> a[i];
if (0 <= a[0]) {
if (a[0] == 0) {
a[0] = 1;
p_m++;
}
long long s = a[0];
for (int i = 1; i < n; i++) {
int k = 1 - 2 * (i % 2);
s += a[i];
if (s * k <= 0) {
p_m += 1 - k * s;
s = k;
}
}
if (a[0] != 0) {
cout << p_m << endl;
return 0;
}
}
if (a[0] <= 0) {
if (a[0] == 0) {
a[0] = -1;
m_p++;
}
long long s = a[0];
for (int i = 1; i < n; i++) {
int k = 2 * (i % 2) - 1;
s += a[i];
if (s * k <= 0) {
m_p += 1 - k * s;
s = k;
}
}
if (a[0] != 0) {
cout << m_p << endl;
return 0;
}
}
cout << min(p_m, m_p) << 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;
long long chk1, chk2, ans1 = 0, ans2 = 0;
scanf("%d", &n);
vector<int> a(n);
for (auto& e : a) scanf("%d", &e);
chk1 = a[0] + a[1];
chk2 = a[0] + a[1];
if (chk1 <= 0) {
ans1 = -1 * chk1 + 1;
chk1 = 1;
}
if (chk2 >= 0) {
ans2 = chk2 + 1;
chk2 = -1;
}
for (int i = 2; i < n; i++) {
chk1 += a[i];
chk2 += a[i];
if (i % 2) {
if (chk1 <= 0) {
ans1 += -1 * chk1 + 1;
chk1 = 1;
}
if (chk2 >= 0) {
ans2 += chk2 + 1;
chk2 = -1;
}
} else {
if (chk1 >= 0) {
ans1 += chk1 + 1;
chk1 = -1;
}
if (chk2 <= 0) {
ans2 += -1 * chk2 + 1;
chk2 = 1;
}
}
}
printf("%lld\n", 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 | using System;
class Program
{
static void Main()
{
int n = int.Parse(Console.ReadLine());
var inp = Array.ConvertAll(Console.ReadLine().Split(), long.Parse);
long ans = 0;
long cumsum = inp[0];
for (int i = 1; i < n; i++)
{
if (cumsum * inp[i] >= 0)
{
ans += Math.Abs(cumsum + inp[i]) + 1;
inp[i] = inp[i] > 0 ? -(cumsum + 1) : cumsum + 1;
}
else if (Math.Abs(cumsum) >= Math.Abs(inp[i]))
{
ans += Math.Abs(cumsum + inp[i]) + 1;
inp[i] = inp[i] > 0 ? Math.Abs(cumsum) + 1 : -(Math.Abs(cumsum) + 1);
}
cumsum += inp[i];
Console.WriteLine(string.Join(" ",inp));
}
Console.WriteLine(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 | python3 | n = int(input())
a = list(map(int, input().split()))
now = a[0]
m = now < 0 and -1 or 1
result = 0
for i, v in enumerate(a[1:]):
tmp = now * -1
if m < 0:
tmp += 1
if tmp > v:
now += v
else:
result += abs(tmp - v)
now = -1
else:
tmp -= 1
if tmp < v:
now += v
else:
result += abs(tmp - v)
now = 1
m *= -1
print(result)
|
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 sign(long long int num) {
if (num == 0) {
return 0;
} else {
return num / abs(num);
}
}
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 = sign(sum) * (abs(sum) - 1);
}
}
} else {
if (sign(list.at(i)) * sign(sum) >= 0) {
count += abs(sum + list.at(i)) + 1;
if (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>
using namespace std;
using ll = int64_t;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
ll osum = 0;
ll esum = 0;
for (int i = 0; i < ((int)(N)); i++) {
cin >> A.at(i);
if (A[i] < 0) {
if (i % 2 == 0)
esum++;
else
osum++;
}
}
bool evenIsPositive = (osum > esum) ? true : false;
ll step = 0;
ll sum = 0;
for (int i = 0; i < N; i++) {
ll tmp = sum + A[i];
if (i % 2 == 0) {
if (evenIsPositive) {
if (tmp < 0) {
step += abs(tmp) + 1;
sum = 1;
} else if (tmp == 0) {
sum = 1;
step++;
} else {
sum = tmp;
}
} else {
if (tmp < 0) {
sum = tmp;
} else if (tmp == 0) {
sum = -1;
step++;
} else {
step += tmp + 1;
sum = -1;
}
}
} else {
if (evenIsPositive) {
if (tmp < 0) {
sum = tmp;
} else if (tmp == 0) {
sum = -1;
step++;
} else {
step += tmp + 1;
sum = -1;
}
} else {
if (tmp < 0) {
step += abs(tmp) + 1;
sum = 1;
} else if (tmp == 0) {
sum = 1;
step++;
} else {
sum = tmp;
}
}
}
}
cout << step << 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 | java | import java.util.*;
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 count = 0;
int sum = a[0];
if (sum > 0) {
for (int i = 1; i < n; i++) {
sum += a[i];
if (i % 2 != 0) {
while (sum >= 0) {
sum--;
count++;
}
} else {
while (sum <= 0) {
sum++;
count++;
}
}
}
} else {
for (int i = 1; i < n; i++) {
sum += a[i];
if (i % 2 != 0) {
while (sum <= 0) {
sum++;
count++;
}
} else {
while (sum >= 0) {
sum--;
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 | cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, count = 0;
double a[100001], sum;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
if (a[0] == 0) {
if (a[1] >= 0)
a[0]--;
else
a[0]++;
count++;
}
sum = a[0];
for (i = 1; i < n; i++) {
if (a[i] == 0) {
if (sum > 0) {
while (sum + a[i] >= 0) {
a[i]--;
count++;
}
} else {
while (sum + a[i] <= 0) {
a[i]++;
count++;
}
}
} else if (sum > 0) {
while (sum + a[i] >= 0) {
a[i]--;
count++;
}
} else if (sum < 0) {
while (sum + a[i] <= 0) {
a[i]++;
count++;
}
}
sum += a[i];
}
cout << count << '\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 | java | import java.io.IOException;
import java.io.InputStream;
import java.util.*;
import java.util.function.IntFunction;
import java.util.function.Supplier;
import java.util.stream.IntStream;
import java.util.stream.Stream;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner();
int n=scanner.nextInt();
long[] a=new long[n];
for(int i=0;i<n;i++){
a[i]=scanner.nextInt();
}
long[] ruiseki=new long[n+1];
for(int i=1;i<=n;i++){
ruiseki[i]=a[i-1]+ruiseki[i-1];
}
long xSum1=0;
long ans1=0;
long xSum2=0;
long ans2=0;
for(int i=1;i<=n;i++){
long val1=ruiseki[i]+xSum1;
if(i%2==0){
//+
if(val1>0)continue;
long x=Math.abs(val1)+1;
xSum1+=x;
ans1+=x;
}else{
//-
if(val1<0) continue;
long x=val1+1;
xSum1-=x;
ans1+=x;
}
long val2=ruiseki[i]+xSum2;
if(i%2==1){
//+
if(val2>0)continue;
long x=Math.abs(val2)+1;
xSum2+=x;
ans2+=x;
}else{
//-
if(val2<0) continue;
long x=val2+1;
xSum2-=x;
ans2+=x;
}
}
put(Math.min(ans1,ans2));
}
public static void print(Object object){
System.out.print(object);
}
public static void put(Object object) {
System.out.println(object);
}
public static void put(){
System.out.println();
}
public static String format(String string, Object... args) {
return String.format(string, args);
}
}
final class Scanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte())
return buffer[ptr++];
else
return -1;
}
private boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[ptr]))
ptr++;
return hasNextByte();
}
public String next() {
if (!hasNext())
throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext())
throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() {
return Double.parseDouble(next());
}
}
final class Pair {
final public int x, y;
Pair(int x, int y) {
this.x = x;
this.y = y;
}
@Override
public int hashCode() {
return x+y;
}
@Override
public boolean equals(Object obj) {
boolean result=super.equals(obj);
if(obj.getClass()!=this.getClass()){
return false;
}
Pair pair=(Pair)obj;
if(this.x==pair.x&&this.y==pair.y) return true;
return false;
}
@Override
public String toString() {
return String.format("(%d,%d)", x, y);
}
}
final class Tuple<T,V>{
//immutabl1でないことに注意(T,Vがmutableの場合変更可能)
final public T t;
final public V v;
Tuple(T t,V v){
this.t=t;
this.v=v;
}
@Override
public int hashCode() {
return (t.hashCode()+v.hashCode());
}
@Override
public boolean equals(Object obj) {
if(obj.getClass()!=this.getClass()){
return false;
}
Tuple<T,V> tuple=(Tuple)obj;
return tuple.t.equals(this.t)&&tuple.v.equals(this.v);
}
@Override
public String toString() {
return String.format("<Tuple>=<%s,%s>",t,v);
}
}
final class LowerBoundComparator<T extends Comparable<? super T>>
implements Comparator<T>
{
public int compare(T x, T y)
{
return (x.compareTo(y) >= 0) ? 1 : -1;
}
}
final class UpperBoundComparator<T extends Comparable<? super T>>
implements Comparator<T>
{
public int compare(T x, T y)
{
return (x.compareTo(y) > 0) ? 1 : -1;
}
}
final class Util {
static long gcd(long a,long b){
if(a%b==0)return b;
return gcd(b,a%b);
}
static long lcm(long a,long b){
long gcd=gcd(a,b);
long result=b/gcd;
return a*result;
}
static long kaijoMod(int n,int mod){
if(n<1) return -1;
long result=1;
for(int i=n;i>1;i--){
result*=i;
result%=mod;
}
return result;
}
static <T extends Comparable> Map<T,Integer> count(List<T> list){
//副作用
Collections.sort(list);
Map<T,Integer> result=new HashMap<>();
int l=0,r=0;
while(l<list.size()){
while(r<list.size()-1&&list.get(r).equals(r+1)){
r++;
}
result.put(list.get(r),r-l+1);
r++;
l=r;
}
return result;
}
static Map<Integer,Integer> count(int[] array){
//副作用
Arrays.sort(array);
Map<Integer,Integer> result=new HashMap<>();
int l=0,r=0;
while(l<array.length){
while(r<array.length-1&&array[r]==array[r+1]){
r++;
}
result.put(array[l],r-l+1);
r++;
l=r;
}
return result;
}
static String toStringBWS(Iterable iterable){
Iterator ite=iterable.iterator();
return toStringBWS(ite);
}
static String toStringBWS(Iterator ite){
StringBuilder sb=new StringBuilder();
sb.append(ite.next());
while(ite.hasNext()){
sb.append(" ");
sb.append(ite.next());
}
return sb.toString();
}
static String toStringBWS(int[] array){
StringBuilder sb=new StringBuilder();
for(int i=0;i<array.length-1;i++){
sb.append(array[i]);
sb.append(" ");
}
sb.append(array[array.length-1]);
return sb.toString();
}
static String toStringBWS(long[] array){
StringBuilder sb=new StringBuilder();
for(int i=0;i<array.length-1;i++){
sb.append(array[i]);
sb.append(" ");
}
sb.append(array[array.length-1]);
return sb.toString();
}
}
|
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 op(pos, n, a):
if pos:
S = 1 if a[0] == 0 else a[0]
else:
S = -1 if a[0] == 0 else a[0]
count = 1 if S == 0 else 0
for i in a[1:]:
if S * (S + i) > 0:
count += abs(S + i) + 1
S = -1 if S > 0 else 1
elif S + i == 0:
count += 1
S = -1 if S > 0 else 1
else:
S += i
return count
def main():
n = int(input())
a = list(map(int, input().split()))
c1 = op(1, n, a)
c2 = op(2, n, a)
print(min(c1, c2))
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 | 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();
}
sc.close();
long ans = Math.min(count(n,a,0),count(n,a,1));
System.out.println(ans);
}
private static long count(int n, int []a, int pat) {
long count = 0;
long sum = 0;
sum += a[0];
int temp = (int)Math.pow(-1, 1+pat);
if(sum == 0) {
count++;
sum = temp ;
}
for(int i = 1 ; i < n ; i++) {
sum += a[i];
temp *= -1;
if(temp * sum <= 0) {
count += Math.abs(sum) + 1 ;
sum = temp;
}
}
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;
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];
if (a[0] < 0)
for (int i = 0; i <= (int)(n - 1); i++) a[i] = -a[i];
a[n] = 0;
long long sum = 0;
long long ans = 0;
for (int i = 0; i <= (int)(n - 1); i++) {
long long p = sum;
sum += a[i];
if (p < 0 && sum <= 0) {
ans += (1 - sum);
sum = 1;
} else if (p > 0 && sum >= 0) {
ans += (sum + 1);
sum = -1;
}
}
long long anss = 1 + a[0];
sum = -1;
for (int i = 1; i <= (int)(n - 1); i++) {
long long p = sum;
sum += a[i];
if (p < 0 && sum <= 0) {
anss += (1 - sum);
sum = 1;
} else if (p > 0 && sum >= 0) {
anss += (sum + 1);
sum = -1;
}
}
cout << min(ans, anss) << 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;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
int first_plus = 0;
int count_plus = 0;
int first_minus = 0;
int count_minus = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
first_plus += a[i];
first_minus += a[i];
if (first_plus <= 0) {
count_plus += 1 - first_plus;
first_plus += count_plus;
}
if (first_minus >= 0) {
count_minus += 1 + first_minus;
first_minus -= count_minus;
}
}
if (i % 2 == 1) {
first_plus += a[i];
first_minus += a[i];
if (first_plus >= 0) {
count_plus += 1 + first_plus;
first_plus -= count_plus;
}
if (first_minus <= 0) {
count_minus += 1 - first_minus;
first_minus += count_minus;
}
}
}
if (count_plus <= count_minus)
cout << count_plus << endl;
else
cout << count_minus << 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;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vector誤字保険
#define ednl endl // endl誤字保険
#define opt() cin.tie(0); ios::sync_with_stdio(false) // 入出力速度改善
#define rep(i,l,r) for(ll i=(l);i<(r);i++) // 範囲[l, r)で刻み1のfor文(順方向)
#define repp(i,l,r,k) for(ll i=(l);i<(r);i+=(k)) // 範囲[l, r)で刻みkのfor文(順方向)
#define rrep(i,l,r) for(ll i=(r-1);i>=(l);i--) // 範囲[l, r)で刻み1のfor文(逆方向)
#define rrepp(i,l,r,k) for(ll i=(r-1);i>=(l);i-=(k)) // 範囲[l, r)で刻みkのfor文(逆方向)
#define all(x) (x).begin(), (x).end() // vectorのポインタ位置指定用
#define max(p,q)((p)>(q)?(p):(q)) // max拡張
#define min(p,q)((p)<(q)?(p):(q)) // min拡張
#define bit(n,m)(((n)>>(m))&1) // 変数nのm番目のbitを取り出す
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int dy[]={0, 1, 0, -1}; // 4方向近傍
int dx[]={1, 0, -1, 0}; // 4方向近傍
#define INF ((1LL<<62)-(1LL<<31))
//#define MOD 998244353
#define MOD 1000000007
#define invp(a,p) pom(a,p-2,p)
////////////////////////////////////////////////////////////////////////////////////////
int main(){
ll n; cin >> n;
ll a[n]; rep(i,0,n) cin >> a[i];
//1. 累積和に0がないか?
// iで累積和が0になるなら、iから先に+1
//2. 累積和の符号が反転しない
// 反転するまで1を加える、1を引く
ll csum[n];
csum[0] = a[0];
rep(i,1,n){
csum[i] = csum[i-1] + a[i];
//cout << csum[i] << ednl;
}
//初手が0じゃない場合
if(csum[0] != 0){
ll p1 = 0, m1 = 0;
bool flag = (csum[0] > 0);
rep(i,1,n){
if((flag ? -1 : 1) * (csum[i] + p1 - m1) > 0){
flag = !flag;
continue;
}else{
if(flag){ //このステップでは負であるべき
m1 += csum[i] + p1 - m1 + 1;
}else{ //このステップでは生であるべき
p1 += -(csum[i] + p1 - m1) + 1;
}
flag = !flag;
}
}
ll res = p1 + m1;
if(csum[0] > 0){
p1 = 0; m1 = csum[0] + 1;
}else{
p1 = -csum[0] + 1; m1 = 0;
}
bool flag = !(csum[0] > 0);
rep(i,1,n){
if((flag ? -1 : 1) * (csum[i] + p1 - m1) > 0){
flag = !flag;
continue;
}else{
if(flag){ //このステップでは負であるべき
m1 += csum[i] + p1 - m1 + 1;
}else{ //このステップでは生であるべき
p1 += -(csum[i] + p1 - m1) + 1;
}
flag = !flag;
}
}
res = min(p1 + m1, res);
cout << res << ednl;
}else{
//初手が0の場合で決め打ちで+1した場合
ll p1 = 1, ll m1 = 0;
flag = true;
rep(i,1,n){
if((flag ? -1 : 1) * (csum[i] + p1 - m1) > 0){
flag = !flag;
continue;
}else{
if(flag){ //このステップでは負であるべき
m1 += csum[i] + p1 - m1 + 1;
}else{ //このステップでは生であるべき
p1 += -(csum[i] + p1 - m1) + 1;
}
flag = !flag;
}
}
ll res = p1+m1;
//初手が0の場合で決め打ちで-1した場合
p1 = 0, m1 = 1;
flag = false;
rep(i,1,n){
if((flag ? -1 : 1) * (csum[i] + p1 - m1) > 0){
flag = !flag;
continue;
}else{
if(flag){ //このステップでは負であるべき
m1 += csum[i] + p1 - m1 + 1;
}else{ //このステップでは生であるべき
p1 += -(csum[i] + p1 - m1) + 1;
}
flag = !flag;
}
}
res = min(res, p1+m1);
}
cout << res << ednl;
} |
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 | structure SC = StringCvt
structure T = TextIO
fun nextInt () = valOf (T.scanStream (Int.scan SC.DEC) T.stdIn)
fun solve [] _ cnt = cnt
| solve (x :: xs) sum cnt =
let
val sum' = sum + x
in
if sum > 0 andalso sum' < 0 orelse sum < 0 andalso sum' > 0 then
solve xs sum' cnt
else if sum >= 0 andalso sum' >= 0 then
solve xs ~1 (cnt + sum' + 1)
else
solve xs 1 (cnt - sum' + 1)
end
val () =
let
val n = nextInt ()
val x1 = nextInt ()
val xs = List.tabulate (n - 1, fn _ => nextInt ())
val cnt = if x1 <> 0 then solve xs x1 0
else Int.min (solve xs 1 1, solve xs ~1 1)
in
print (Int.toString cnt ^ "\n")
end
|
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.*;
public class Main {
public static void main(String[] args) {
new Main().execute();
}
public void execute() {
Scanner sc = new Scanner(System.in);
final int N = sc.nextInt();
long[] A = new long[N];
for (int i = 0; i < N; i++) {
long ai = sc.nextLong();
A[i] = ai;
}
long cntA, cntB;
if (A[0] == 0) {
A[0] = 1;
cntA = 1 + countOps(A);
A[0] = -1;
cntB = 1 + countOps(A);
} else if (A[0] > 0) {
cntA = countOps(A);
A[0] = -1;
cntB = A[0] + 1 + countOps(A);
} else {
cntB = countOps(A);
A[0] = 1;
cntA = Math.abs(A[0]) + 1 + countOps(A);
}
System.out.println(Math.min(cntA, cntB));
sc.close();
}
private long countOps(long[] A) {
long[] arr = A.clone();
long sum = arr[0];
long cnt = 0;
for (int i = 1; i < arr.length; i++) {
if (sum > 0) {
if (sum + arr[i] >= 0) {
cnt += sum + arr[i] + 1;
arr[i] = -sum - 1;
sum = -1;
} else {
sum = sum + arr[i];
}
} else {// sum <0
if (sum + arr[i] <= 0) {
cnt += (sum + arr[i]) * -1 + 1;
arr[i] = -sum + 1;
sum = 1;
} else {
sum = sum + arr[i];
}
}
}
return 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 | UNKNOWN | using System;
using System.Linq;
namespace A
{
class Program
{
static void Main(string[] args)
{
var n = int.Parse(Console.ReadLine());
var aList = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
var total = 0;
var count = 0;
foreach (var a in aList)
{
var preTotal = total;
total += a;
if (preTotal > 0 && total >= 0)
{
var d = -1 - total;
total += d;
count -= d;
}
if (preTotal < 0 && total <= 0)
{
var d = 1 - total;
total += d;
count += d;
}
}
Console.WriteLine(count);
}
static int NumberOfDigits(long x)
{
if (x < 10) return 1;
var result = 0;
while (x > 0)
{
result++;
x /= 10;
}
return result;
}
static int SumOfDigits(int x)
{
var sum = 0;
while (x > 0)
{
sum += x % 10;
x /= 10;
}
return sum;
}
}
}
|
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 itertools import takewhile
n, *A = map(int, open(0).read().split())
k = len(list(takewhile(lambda a: a == 0, A)))
if k == n:
print((k+1)*k//2)
exit()
if A[k] > 0:
C = [-1]
else:
C = [1]
B = [0]
D = [(k+1)*k//2]
for i in range(k, n):
if (C[-1] + A[i]) * C[-1] < 0:
B.append(A[i])
C.append(C[-1] + A[i])
D.append(D[-1])
else:
if C[-1] > 0:
B.append(-(C[-1]+1))
D.append(D[-1] + C[-1]+1 + A[i])
C.append(-1)
else:
B.append(-C[-1]+1)
D.append(D[-1] + -C[-1]+1 - A[i])
C.append(1)
print(D[-1])
# print(A[k-1:])
# print(B)
# print(C)
# print(D) |
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> A;
int j;
bool is_plus;
long long ans = 0;
long long sum = 0;
cin >> n;
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 | n = int(input())
a = [int(i) for i in input().split()]
s = []
sign = []
ans = 0
if a[0]==0:
if a[1]<0:
a[0]=-1
else:
a[0]=1
ans+=1
if a[0]<0:
sign.append(-1)
else:
sign.append(1)
total = a[0]
op = 0
for i in range(1,n):
total+=a[i]
if total==0:
sign.append(sign[i-1]*-1)
total += sign[i-1]*-1
ans += 1
elif total<0:
sign.append(-1)
else:
sign.append(1)
if sign[i]==sign[i-1]:
op = abs(total)+1
if total+op==0 or total-op==0:
op+=1
if sign[i]==1:
total -= op
else:
total += op
ans += op
sign[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(void) {
int n;
cin >> n;
vector<long long> a(n);
for (long long i = 0; i < n; i++) cin >> a[i];
long long sum = a[0];
long long ans1 = 0;
for (long long i = 0; i < n; i++) {
if (i % 2 == 0) {
if (sum > 0) {
ans1 += sum + 1;
sum = -1;
}
} else {
if (sum < 0) {
ans1 += -sum + 1;
sum = 1;
}
}
if (i != n - 1) {
sum += a[i + 1];
}
}
sum = a[0];
long long ans2 = 0;
for (long long i = 0; i < n; i++) {
if (i % 2 == 0) {
if (sum < 0) {
ans2 += -sum + 1;
sum = 1;
}
} else {
if (sum > 0) {
ans2 += sum + 1;
sum = -1;
}
}
if (i != n - 1) {
sum += a[i + 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 | java | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] A = new int[N + 1];
A[0] = 0;
for (int i = 1; i <= N; ++i) {
A[i] = sc.nextInt();
}
sc.close();
int sum1 = 0;
int sum2 = 0;
int ans1 = 0;
int ans2 = 0;
for (int i = 1; i <= N; ++i) {
sum1 += A[i];
if (i % 2 == 0 && sum1 >= 0) {
ans1 += Math.abs(sum1) +1;
sum1 = -1;
} else if (i % 2 != 0 && sum1 <= 0) {
ans1 += Math.abs(sum1) + 1;
sum1 = 1;
}
}
for (int i = 1; i <= N; ++i) {
sum2 += A[i];
if (i % 2 == 0 && sum2 <= 0) {
ans2 += Math.abs(sum2) +1;
sum2 = 1;
} else if (i % 2 != 0 && sum2 >= 0) {
ans2 += Math.abs(sum2) + 1;
sum2 = -1;
}
}
System.out.println(Math.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>
using namespace std;
int main() {
int n = 0;
cin >> n;
int* all = new int[n];
for (int i = 0; i < n; i++) cin >> all[i];
long long ans = 0;
int sum = 0;
int last = 0;
long long ans2 = 0;
int sum2 = 0;
int last2 = 0;
bool flag = false;
if (all[0] > 0)
last = -1;
else if (all[0] < 0)
last = 1;
else {
last = -1;
all[0] = 1;
ans++;
flag = true;
}
for (int i = 0; i < n; i++) {
sum += all[i];
if (last == 1) {
if (sum >= 0) {
ans += sum + 1;
sum = -1;
}
last = -1;
} else if (last == -1) {
if (sum <= 0) {
ans += -1 * sum + 1;
sum = 1;
}
last = 1;
}
}
if (all[0] > 0) {
if (flag) {
last2 = -1;
ans2++;
all[0] = -1;
} else {
last2 = 1;
ans2 += all[0] * 2;
all[0] *= -1;
}
} else if (all[0] < 0) {
last2 = -1;
all[0] *= -1;
ans2 += all[0] * 2;
}
for (int i = 0; i < n; i++) {
sum2 += all[i];
if (last2 == 1) {
if (sum2 >= 0) {
ans2 += sum2 + 1;
sum2 = -1;
}
last2 = -1;
} else if (last2 == -1) {
if (sum2 <= 0) {
ans2 += -1 * sum2 + 1;
sum2 = 1;
}
last2 = 1;
}
}
if (ans < ans2)
cout << ans;
else
cout << ans2;
system("pause");
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.