source
stringclasses 4
values | task_type
stringclasses 1
value | in_source_id
stringlengths 0
138
| problem
stringlengths 219
13.2k
| gold_standard_solution
stringlengths 0
413k
| problem_id
stringlengths 5
10
| metadata
dict | verification_info
dict |
|---|---|---|---|---|---|---|---|
code_contests | verifiable_code | 530_D. Set subtraction | Solve the following coding problem using the programming language python:
You are given a starting set consisting of all integers from 1 to 1000, inclusive. You are also given several sets which need to be subtracted from the starting set (i.e., each number which is in at least one of these sets needs to be removed from the starting set). Each subtracted set is represented as an interval of integers from A to B, inclusive. Output the result after all subtractions.
Input
The first line of input contains an integer N (0 β€ N β€ 100) β the number of intervals to be subtracted. The following N lines contain pairs of integers A and B (1 β€ A β€ B β€ 1000) β lower and upper bounds of the intervals. Intervals can intersect. An interval can consist of a single number.
Output
Output the result of subtractions in the following format: in one line output first the number of integers in the resulting set and then the integers of the set, sorted in increasing order, separated by single space.
Examples
Input
2
1 900
902 999
Output
2 901 1000
Input
3
1 500
200 746
150 1000
Output
0
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | vfc_32717 | {
"difficulty": "10",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2\n1 900\n902 999\n",
"output": "2 901 1000\n",
"type": "stdin_stdout"
}
]
} |
|
code_contests | verifiable_code | 556_D. Case of Fugitive | Solve the following coding problem using the programming language python:
Andrewid the Android is a galaxy-famous detective. He is now chasing a criminal hiding on the planet Oxa-5, the planet almost fully covered with water.
The only dry land there is an archipelago of n narrow islands located in a row. For more comfort let's represent them as non-intersecting segments on a straight line: island i has coordinates [li, ri], besides, ri < li + 1 for 1 β€ i β€ n - 1.
To reach the goal, Andrewid needs to place a bridge between each pair of adjacent islands. A bridge of length a can be placed between the i-th and the (i + 1)-th islads, if there are such coordinates of x and y, that li β€ x β€ ri, li + 1 β€ y β€ ri + 1 and y - x = a.
The detective was supplied with m bridges, each bridge can be used at most once. Help him determine whether the bridges he got are enough to connect each pair of adjacent islands.
Input
The first line contains integers n (2 β€ n β€ 2Β·105) and m (1 β€ m β€ 2Β·105) β the number of islands and bridges.
Next n lines each contain two integers li and ri (1 β€ li β€ ri β€ 1018) β the coordinates of the island endpoints.
The last line contains m integer numbers a1, a2, ..., am (1 β€ ai β€ 1018) β the lengths of the bridges that Andrewid got.
Output
If it is impossible to place a bridge between each pair of adjacent islands in the required manner, print on a single line "No" (without the quotes), otherwise print in the first line "Yes" (without the quotes), and in the second line print n - 1 numbers b1, b2, ..., bn - 1, which mean that between islands i and i + 1 there must be used a bridge number bi.
If there are multiple correct answers, print any of them. Note that in this problem it is necessary to print "Yes" and "No" in correct case.
Examples
Input
4 4
1 4
7 8
9 10
12 14
4 5 3 8
Output
Yes
2 3 1
Input
2 2
11 14
17 18
2 9
Output
No
Input
2 1
1 1
1000000000000000000 1000000000000000000
999999999999999999
Output
Yes
1
Note
In the first sample test you can, for example, place the second bridge between points 3 and 8, place the third bridge between points 7 and 10 and place the first bridge between points 10 and 14.
In the second sample test the first bridge is too short and the second bridge is too long, so the solution doesn't exist.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
#!/usr/bin/env python
# 556D_fug.py - Codeforces.com 556D Fug quiz
#
# Copyright (C) 2015 Sergey
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
"""
Input
The first line contains integers n and m - the number of islands and bridges.
Next n lines each contain two integers li and ri - the coordinates of the
island endpoints.
The last line contains m integer numbers a1..am - the lengths of the bridges
that Andrewid got.
Output
If it is impossible to place a bridge between each pair of adjacent islands
in the required manner, print on a single line "No" (without the quotes)
, otherwise print in the first line "Yes" (without the quotes), and in the
second line print n-1 numbers b1, bn-1, which mean that between islands
i and i+1 there must be used a bridge number bi.
If there are multiple correct answers, print any of them. Note that in this
problem it is necessary to print "Yes" and "No" in correct case
"""
# Standard modules
import unittest
import sys
import re
# Additional modules
import bisect
###############################################################################
# Fastlist Class
###############################################################################
class Fastlist(object):
""" Fastlist representation """
def __init__(self, l=[], load=5000, sorted=0):
self._load = load
self._sorted = sorted
self._lists = []
self._starts = []
self._mins = []
self._insert_list()
self._irev = 0
self.extend(l)
def _index_location(self, index):
if len(self._lists[0]) == 0:
raise IndexError("List index out of range")
if index == 0:
return (0, 0)
if index == -1:
return (len(self._lists) - 1, len(self._lists[-1]) - 1)
if self._sorted:
raise RuntimeError("No index access to the sorted list, exc 0, -1")
length = len(self)
if index < 0:
index = length + index
if index >= length:
raise IndexError("List index out of range")
il = bisect.bisect_right(self._starts, index) - 1
return (il, index - self._starts[il])
def _insert_list(self, il=None):
if il is None:
il = len(self._lists)
self._lists.insert(il, [])
if self._sorted:
if il == 0:
self._mins.insert(il, None)
else:
self._mins.insert(il, self._lists[il-1][-1])
else:
if il == 0:
self._starts.insert(il, 0)
else:
start = self._starts[il-1] + len(self._lists[il-1])
self._starts.insert(il, start)
def _del_list(self, il):
del self._lists[il]
if self._sorted:
del self._mins[il]
else:
del self._starts[il]
def _rebalance(self, il):
illen = len(self._lists[il])
if illen >= self._load * 2:
self._insert_list(il)
self._even_lists(il)
if illen <= self._load * 0.2:
if il != 0:
self._even_lists(il-1)
elif len(self._lists) > 1:
self._even_lists(il)
def _even_lists(self, il):
tot = len(self._lists[il]) + len(self._lists[il+1])
if tot < self._load * 1:
self._lists[il] += self._lists[il+1]
self._del_list(il+1)
if self._sorted:
self._mins[il] = self._lists[il][0]
else:
half = tot//2
ltot = self._lists[il] + self._lists[il+1]
self._lists[il] = ltot[:half]
self._lists[il+1] = ltot[half:]
if self._sorted:
self._mins[il] = self._lists[il][0]
self._mins[il+1] = self._lists[il+1][0]
else:
self._starts[il+1] = self._starts[il] + len(self._lists[il])
def _obj_location(self, obj, l=0):
if not self._sorted:
raise RuntimeError("No by value access to an unserted list")
il = 0
if len(self._mins) > 1 and obj > self._mins[0]:
if l:
il = bisect.bisect_left(self._mins, obj) - 1
else:
il = bisect.bisect_right(self._mins, obj) - 1
if l:
ii = bisect.bisect_left(self._lists[il], obj)
else:
ii = bisect.bisect_right(self._lists[il], obj)
if ii == len(self._lists[il]) and il != len(self._lists) - 1:
ii = 0
il += 1
return (il, ii)
def insert(self, index, obj):
(il, ii) = self._index_location(index)
self._lists[il].insert(ii, obj)
for j in range(il + 1, len(self._starts)):
self._starts[j] += 1
self._rebalance(il)
def append(self, obj):
if len(self._lists[-1]) >= self._load:
self._insert_list()
self._lists[-1].append(obj)
if self._sorted and self._mins[0] is None:
self._mins[0] = self._lists[0][0]
def extend(self, iter):
for n in iter:
self.append(n)
def pop(self, index=None):
if index is None:
index = -1
(il, ii) = self._index_location(index)
item = self._lists[il].pop(ii)
if self._sorted:
if ii == 0 and len(self._lists[il]) > 0:
self._mins[il] = self._lists[il][0]
else:
for j in range(il + 1, len(self._starts)):
self._starts[j] -= 1
self._rebalance(il)
return item
def clear(self):
self._lists.clear()
self._starts.clear()
self._mins.clear()
self._insert_list()
def as_list(self):
return sum(self._lists, [])
def insort(self, obj, l=0):
(il, ii) = self._obj_location(obj, l)
self._lists[il].insert(ii, obj)
if ii == 0:
self._mins[il] = obj
self._rebalance(il)
def add(self, obj):
if self._sorted:
self.insort(obj)
else:
self.append(obj)
def insort_left(self, obj):
self.insort(obj, l=1)
def lower_bound(self, obj):
(self._il, self._ii) = self._obj_location(obj, l=1)
return self
def upper_bound(self, obj):
(self._il, self._ii) = self._obj_location(obj)
return self
def __str__(self):
return str(self.as_list())
def __setitem__(self, index, obj):
if isinstance(index, int):
(il, ii) = self._index_location(index)
self._lists[il][ii] = obj
elif isinstance(index, slice):
raise RuntimeError("Slice assignment is not supported")
def __getitem__(self, index):
if isinstance(index, int):
(il, ii) = self._index_location(index)
return self._lists[il][ii]
elif isinstance(index, slice):
rg = index.indices(len(self))
if rg[0] == 0 and rg[1] == len(self) and rg[2] == 1:
return self.as_list()
return [self.__getitem__(index) for index in range(*rg)]
def __iadd__(self, obj):
if self._sorted:
[self.insort(n) for n in obj]
else:
[self.append(n) for n in obj]
return self
def __delitem__(self, index):
if isinstance(index, int):
self.pop(index)
elif isinstance(index, slice):
rg = index.indices(len(self))
[self.__delitem__(rg[0]) for i in range(*rg)]
def __len__(self):
if self._sorted:
return sum([len(l) for l in self._lists])
return self._starts[-1] + len(self._lists[-1])
def __contains__(self, obj):
if self._sorted:
it = self.lower_bound(obj)
return not it.iter_end() and obj == it.iter_getitem()
else:
for n in self:
if obj == n:
return True
return False
def __bool__(self):
return len(self._lists[0]) != 0
def __iter__(self):
self._il = self._ii = self._irev = 0
return self
def __reversed__(self):
self._il = len(self._lists) - 1
self._ii = len(self._lists[self._il]) - 1
self._irev = 1
return self
def __next__(self):
if self._il in (-1, len(self._lists)) or len(self._lists[0]) == 0:
raise StopIteration("Iteration stopped")
item = self._lists[self._il][self._ii]
if not self._irev:
self._ii += 1
if self._ii == len(self._lists[self._il]):
self._il += 1
self._ii = 0
else:
self._ii -= 1
if self._ii == 0:
self._il -= 1
self._ii = len(self._lists[self._il])
return item
def iter_getitem(self):
return self._lists[self._il][self._ii]
def iter_end(self):
return (self._il == len(self._lists) - 1 and
self._ii == len(self._lists[self._il]))
def iter_del(self):
self.iter_pop()
def iter_pop(self):
item = self._lists[self._il].pop(self._ii)
if self._sorted:
if self._ii == 0 and len(self._lists[self._il]) > 0:
self._mins[self._il] = self._lists[self._il][0]
else:
for j in range(self._il + 1, len(self._starts)):
self._starts[j] -= 1
self._rebalance(self._il)
return item
###############################################################################
# Fug Class
###############################################################################
class Fug:
""" Fug representation """
def __init__(self, args):
""" Default constructor """
self.gsrt = args[0]
self.asrt = args[1]
self.gn = args[2]
self.result = [0]*self.gn
self.a = Fastlist(self.asrt, load=500, sorted=1)
def calculate(self):
""" Main calcualtion function of the class """
for i in range(self.gn):
g = self.gsrt[i]
it = self.a.lower_bound((g[1], 0))
if not it.iter_end():
alb = it.iter_getitem()
if alb[0] > g[0]:
return "No"
self.result[g[2]] = alb[1]+1
it.iter_del()
else:
return "No"
answer = "Yes\n" + " ".join(str(n) for n in self.result)
return answer
###############################################################################
# Executable code
###############################################################################
def get_inputs(test_inputs=None):
it = iter(test_inputs.split("\n")) if test_inputs else None
def uinput():
""" Unit-testable input function wrapper """
if it:
return next(it)
else:
return sys.stdin.readline()
# Getting string inputs. Place all uinput() calls here
num = [int(s) for s in uinput().split()]
gaps = []
prevli = [int(s) for s in uinput().split()]
for i in range(num[0] - 1):
li = [int(s) for s in uinput().split()]
min = li[0] - prevli[1]
max = li[1] - prevli[0]
gaps.append((max, min, i))
prevli = li
alist = [(int(s), i) for i, s in enumerate(uinput().split())]
# Decoding inputs into a list
inputs = [sorted(gaps), sorted(alist), num[0]-1]
return inputs
def calculate(test_inputs=None):
""" Base class calculate method wrapper """
return Fug(get_inputs(test_inputs)).calculate()
###############################################################################
# Unit Tests
###############################################################################
class unitTests(unittest.TestCase):
def test_sample_tests(self):
""" Quiz sample tests. Add \n to separate lines """
# Sample test 1
test = "4 4\n1 4\n7 8\n9 10\n12 14\n4 5 3 8"
self.assertEqual(calculate(test), "Yes\n2 3 1")
self.assertEqual(
get_inputs(test),
[[(3, 1, 1), (5, 2, 2), (7, 3, 0)],
[(3, 2), (4, 0), (5, 1), (8, 3)], 3])
# My tests
test = "5 5\n1 1\n2 7\n8 8\n10 10\n16 16\n1 1 5 6 2"
self.assertEqual(calculate(test), "Yes\n1 2 5 4")
# Other tests
test = "2 2\n11 14\n17 18\n2 9"
self.assertEqual(calculate(test), "No")
# Other tests
test = (
"2 1\n1 1\n1000000000000000000 1000000000000000000" +
"\n999999999999999999")
self.assertEqual(calculate(test), "Yes\n1")
test = ("5 9\n1 2\n3 3\n5 7\n11 13\n14 20\n2 3 4 10 6 2 6 9 5")
self.assertEqual(calculate(test), "Yes\n1 6 3 2")
size = 200000
test = str(size) + " " + str(size) + "\n"
x = size*1000
for i in range(size):
test += str(x) + " " + str(x + i + 1) + "\n"
x += 2 * (i + 1)
for i in reversed(range(size)):
test += str(i) + " "
self.assertEqual(calculate(test)[0], "Y")
def test_Fug_class__basic_functions(self):
""" Fug class basic functions testing """
# Constructor test
d = Fug([[(1, 3, 1), (2, 5, 2), (3, 7, 0)],
[(3, 2), (4, 0), (5, 1), (8, 3)], 3])
# Sort bridges
self.assertEqual(d.asrt[0], (3, 2))
# Sort Gaps
self.assertEqual(d.gsrt[0], (1, 3, 1))
if __name__ == "__main__":
# Avoiding recursion limitaions
sys.setrecursionlimit(100000)
if sys.argv[-1] == "-ut":
unittest.main(argv=[" "])
# Print the result string
sys.stdout.write(calculate())
``` | vfc_32721 | {
"difficulty": "10",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 3, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4 4\n1 4\n7 8\n9 10\n12 14\n4 5 3 8\n",
"output": "Yes\n2 3 1 ",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2 2\n11 14\n17 18\n2 9\n",
"output": "No",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2 1\n1 1\n1000000000000000000 1000000000000000000\n999999999999999999\n",
"output": "Yes\n1 ",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2 1\n1 1\n100 100\n5\n",
"output": "No",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 2\n1000000000000000 1000000000000000\n3000000000000000 4000000000000000\n6000000000000000 7000000000000000\n2000000000000000 4000000000000000\n",
"output": "Yes\n1 2 ",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 604_B. More Cowbell | Solve the following coding problem using the programming language python:
Kevin Sun wants to move his precious collection of n cowbells from Naperthrill to Exeter, where there is actually grass instead of corn. Before moving, he must pack his cowbells into k boxes of a fixed size. In order to keep his collection safe during transportation, he won't place more than two cowbells into a single box. Since Kevin wishes to minimize expenses, he is curious about the smallest size box he can use to pack his entire collection.
Kevin is a meticulous cowbell collector and knows that the size of his i-th (1 β€ i β€ n) cowbell is an integer si. In fact, he keeps his cowbells sorted by size, so si - 1 β€ si for any i > 1. Also an expert packer, Kevin can fit one or two cowbells into a box of size s if and only if the sum of their sizes does not exceed s. Given this information, help Kevin determine the smallest s for which it is possible to put all of his cowbells into k boxes of size s.
Input
The first line of the input contains two space-separated integers n and k (1 β€ n β€ 2Β·k β€ 100 000), denoting the number of cowbells and the number of boxes, respectively.
The next line contains n space-separated integers s1, s2, ..., sn (1 β€ s1 β€ s2 β€ ... β€ sn β€ 1 000 000), the sizes of Kevin's cowbells. It is guaranteed that the sizes si are given in non-decreasing order.
Output
Print a single integer, the smallest s for which it is possible for Kevin to put all of his cowbells into k boxes of size s.
Examples
Input
2 1
2 5
Output
7
Input
4 3
2 3 5 9
Output
9
Input
3 2
3 5 7
Output
8
Note
In the first sample, Kevin must pack his two cowbells into the same box.
In the second sample, Kevin can pack together the following sets of cowbells: {2, 3}, {5} and {9}.
In the third sample, the optimal solution is {3, 5} and {7}.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
n, k = map(int, input().split())
a = [int(s) for s in input().split()]
p = n - k
q = 2*k - n
if n < k:
q = n
p = 0
ma = 0
for i in range ((n - q) // 2):
ma = max((a[i] + a[n - q - i - 1]), ma)
ma2 = 0
for i in range(n - q, n):
ma2 = max(a[i], ma2)
print(max(ma,ma2))
``` | vfc_32729 | {
"difficulty": "8",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4 3\n2 3 5 9\n",
"output": "9\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2 1\n2 5\n",
"output": "7\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 2\n3 5 7\n",
"output": "8\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "10 5\n15 15 20 28 38 44 46 52 69 94\n",
"output": "109\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "100 89\n474 532 759 772 803 965 1043 1325 1342 1401 1411 1452 1531 1707 1906 1928 2034 2222 2335 2606 2757 2968 2978 3211 3513 3734 3772 3778 3842 3948 3976 4038 4055 4113 4182 4267 4390 4408 4478 4595 4668 4792 4919 5133 5184 5255 5312 5341 5476 5628 5683 5738 5767 5806 5973 6051 6134 6254 6266 6279 6314 6342 6599 6676 6747 6777 6827 6842 7057 7097 7259 7340 7378 7405 7510 7520 7698 7796 8148 8351 8507 8601 8805 8814 8826 8978 9116 9140 9174 9338 9394 9403 9407 9423 9429 9519 9764 9784 9838 9946\n",
"output": "9946\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 626_E. Simple Skewness | Solve the following coding problem using the programming language python:
Define the simple skewness of a collection of numbers to be the collection's mean minus its median. You are given a list of n (not necessarily distinct) integers. Find the non-empty subset (with repetition) with the maximum simple skewness.
The mean of a collection is the average of its elements. The median of a collection is its middle element when all of its elements are sorted, or the average of its two middle elements if it has even size.
Input
The first line of the input contains a single integer n (1 β€ n β€ 200 000) β the number of elements in the list.
The second line contains n integers xi (0 β€ xi β€ 1 000 000) β the ith element of the list.
Output
In the first line, print a single integer k β the size of the subset.
In the second line, print k integers β the elements of the subset in any order.
If there are multiple optimal subsets, print any.
Examples
Input
4
1 2 3 12
Output
3
1 2 12
Input
4
1 1 2 2
Output
3
1 1 2
Input
2
1 2
Output
2
1 2
Note
In the first case, the optimal subset is <image>, which has mean 5, median 2, and simple skewness of 5 - 2 = 3.
In the second case, the optimal subset is <image>. Note that repetition is allowed.
In the last case, any subset has the same median and mean, so all have simple skewness of 0.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
from itertools import accumulate
from fractions import Fraction
n = int(input())
A = [int(x) for x in input().split()]
A.sort()
B = list(accumulate([0] + A))
def condition(i, z):
return (2*z - 1)*(A[i-z] + A[-z]) > 2*(B[i+1] - B[i-z+1] + B[-1] - B[-z])
def average(i, z):
return Fraction((B[i+1] - B[i-z] + B[-1] - B[-z-1]) , 2*z + 1)
maxans = 0
argmax = (0, 0)
for i in range(1, n-1):
x, y = 0, min(i, n-1-i)
while y - x > 1:
z = (x + y)//2
if condition(i, z):
x = z
else:
y = z
if condition(i, y): x = y
if maxans < average(i, x) - A[i]:
maxans = average(i, x) - A[i]
argmax = (i, x)
print(argmax[1]*2 + 1)
for i in range(argmax[0] - argmax[1], argmax[0] + 1):
print(A[i], end = ' ')
for i in range(-argmax[1], 0):
print(A[i], end = ' ')
``` | vfc_32733 | {
"difficulty": "11",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 3, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2\n1 2\n",
"output": "1\n 1 \n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 650_C. Table Compression | Solve the following coding problem using the programming language python:
Little Petya is now fond of data compression algorithms. He has already studied gz, bz, zip algorithms and many others. Inspired by the new knowledge, Petya is now developing the new compression algorithm which he wants to name dis.
Petya decided to compress tables. He is given a table a consisting of n rows and m columns that is filled with positive integers. He wants to build the table a' consisting of positive integers such that the relative order of the elements in each row and each column remains the same. That is, if in some row i of the initial table ai, j < ai, k, then in the resulting table a'i, j < a'i, k, and if ai, j = ai, k then a'i, j = a'i, k. Similarly, if in some column j of the initial table ai, j < ap, j then in compressed table a'i, j < a'p, j and if ai, j = ap, j then a'i, j = a'p, j.
Because large values require more space to store them, the maximum value in a' should be as small as possible.
Petya is good in theory, however, he needs your help to implement the algorithm.
Input
The first line of the input contains two integers n and m (<image>, the number of rows and the number of columns of the table respectively.
Each of the following n rows contain m integers ai, j (1 β€ ai, j β€ 109) that are the values in the table.
Output
Output the compressed table in form of n lines each containing m integers.
If there exist several answers such that the maximum number in the compressed table is minimum possible, you are allowed to output any of them.
Examples
Input
2 2
1 2
3 4
Output
1 2
2 3
Input
4 3
20 10 30
50 40 30
50 60 70
90 80 70
Output
2 1 3
5 4 3
5 6 7
9 8 7
Note
In the first sample test, despite the fact a1, 2 β a21, they are not located in the same row or column so they may become equal after the compression.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | vfc_32737 | {
"difficulty": "9",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 4, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4 3\n20 10 30\n50 40 30\n50 60 70\n90 80 70\n",
"output": "2 1 3\n5 4 3\n5 6 7\n9 8 7\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2 2\n1 2\n3 4\n",
"output": "1 2\n2 3\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1 48\n661781480 254994501 793217098 79665228 199745889 421882115 409323554 689271596 807513352 748218518 294849899 105389023 805950383 306545085 294849899 626862773 365681051 376812180 378266471 892695176 113846442 160323626 369898712 254994501 874749921 240835817 182326424 941375528 129084081 793217098 793217098 817608760 892695176 751787201 798639707 793217098 252530514 662195737 102912484 182326424 169250874 793217098 387582363 927903358 972357925 919457817 793217098 550564947\n",
"output": "24 12 29 1 9 21 20 26 32 27 13 3 31 14 13 23 15 17 18 35 4 6 16 12 34 10 8 38 5 29 29 33 35 28 30 29 11 25 2 8 7 29 19 37 39 36 29 22\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 3\n867378143 815728296 448999007\n378701035 448999007 815728296\n867378143 815728296 448999007\n",
"output": "4 3 1\n1 2 3\n4 3 1\n",
"type": "stdin_stdout"
}
]
} |
|
code_contests | verifiable_code | 676_A. Nicholas and Permutation | Solve the following coding problem using the programming language python:
Nicholas has an array a that contains n distinct integers from 1 to n. In other words, Nicholas has a permutation of size n.
Nicholas want the minimum element (integer 1) and the maximum element (integer n) to be as far as possible from each other. He wants to perform exactly one swap in order to maximize the distance between the minimum and the maximum elements. The distance between two elements is considered to be equal to the absolute difference between their positions.
Input
The first line of the input contains a single integer n (2 β€ n β€ 100) β the size of the permutation.
The second line of the input contains n distinct integers a1, a2, ..., an (1 β€ ai β€ n), where ai is equal to the element at the i-th position.
Output
Print a single integer β the maximum possible distance between the minimum and the maximum elements Nicholas can achieve by performing exactly one swap.
Examples
Input
5
4 5 1 3 2
Output
3
Input
7
1 6 5 3 4 7 2
Output
6
Input
6
6 5 4 3 2 1
Output
5
Note
In the first sample, one may obtain the optimal answer by swapping elements 1 and 2.
In the second sample, the minimum and the maximum elements will be located in the opposite ends of the array if we swap 7 and 2.
In the third sample, the distance between the minimum and the maximum elements is already maximum possible, so we just perform some unnecessary swap, for example, one can swap 5 and 2.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
n = int(input())
a = list(map(int, input().split()))
maxLocate = a.index(n)
minLocate = a.index(1)
distanceMax = len(a) - 1 - a.index(n)
distanceMin = len(a) - 1 - a.index(1)
print(max(maxLocate, minLocate, distanceMax, distanceMin))
``` | vfc_32741 | {
"difficulty": "7",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "6\n6 5 4 3 2 1\n",
"output": "5\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "7\n1 6 5 3 4 7 2\n",
"output": "6\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n4 5 1 3 2\n",
"output": "3\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "76\n1 47 54 17 38 37 12 32 14 48 43 71 60 56 4 13 64 41 52 57 62 24 23 49 20 10 63 3 25 66 59 40 58 33 53 46 70 7 35 61 72 74 73 19 30 5 29 6 15 28 21 27 51 55 50 9 65 8 67 39 76 42 31 34 16 2 36 11 26 44 22 45 75 18 69 68\n",
"output": "75\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "12\n3 6 7 8 9 10 12 5 4 2 11 1\n",
"output": "11\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 69_A. Young Physicist | Solve the following coding problem using the programming language python:
A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasya and decided to teach him a lesson. He gave the lazy student a seemingly easy task: You are given an idle body in space and the forces that affect it. The body can be considered as a material point with coordinates (0; 0; 0). Vasya had only to answer whether it is in equilibrium. "Piece of cake" β thought Vasya, we need only to check if the sum of all vectors is equal to 0. So, Vasya began to solve the problem. But later it turned out that there can be lots and lots of these forces, and Vasya can not cope without your help. Help him. Write a program that determines whether a body is idle or is moving by the given vectors of forces.
Input
The first line contains a positive integer n (1 β€ n β€ 100), then follow n lines containing three integers each: the xi coordinate, the yi coordinate and the zi coordinate of the force vector, applied to the body ( - 100 β€ xi, yi, zi β€ 100).
Output
Print the word "YES" if the body is in equilibrium, or the word "NO" if it is not.
Examples
Input
3
4 1 7
-2 4 -1
1 -5 -3
Output
NO
Input
3
3 -1 7
-5 2 -4
2 -1 -3
Output
YES
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
sum1,sum2,sum3 = 0,0,0
n = int(input())
while n:
n-=1
l = list(map(int, input().split()))
sum1 += l[0]
sum2 += l[1]
sum3 += l[2]
if sum1==0 and sum2 ==0 and sum3 ==0:
print("YES")
else:
print("NO")
``` | vfc_32745 | {
"difficulty": "7",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3\n3 -1 7\n-5 2 -4\n2 -1 -3\n",
"output": "YES\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n4 1 7\n-2 4 -1\n1 -5 -3\n",
"output": "NO\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "14\n43 23 17\n4 17 44\n5 -5 -16\n-43 -7 -6\n47 -48 12\n50 47 -45\n2 14 43\n37 -30 15\n4 -17 -11\n17 9 -45\n-50 -3 -8\n-50 0 0\n-50 0 0\n-16 0 0\n",
"output": "YES\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n1 2 3\n3 2 1\n0 0 0\n",
"output": "NO\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 720_D. Slalom | Solve the following coding problem using the programming language python:
Little girl Masha likes winter sports, today she's planning to take part in slalom skiing.
The track is represented as a grid composed of n Γ m squares. There are rectangular obstacles at the track, composed of grid squares. Masha must get from the square (1, 1) to the square (n, m). She can move from a square to adjacent square: either to the right, or upwards. If the square is occupied by an obstacle, it is not allowed to move to that square.
One can see that each obstacle can actually be passed in two ways: either it is to the right of Masha's path, or to the left. Masha likes to try all ways to do things, so she would like to know how many ways are there to pass the track. Two ways are considered different if there is an obstacle such that it is to the right of the path in one way, and to the left of the path in the other way.
Help Masha to find the number of ways to pass the track. The number of ways can be quite big, so Masha would like to know it modulo 109 + 7.
The pictures below show different ways to pass the track in sample tests. <image> <image> <image>
Input
The first line of input data contains three positive integers: n, m and k (3 β€ n, m β€ 106, 0 β€ k β€ 105) β the size of the track and the number of obstacles.
The following k lines contain four positive integers each: x1, y1, x2, y2 (1 β€ x1 β€ x2 β€ n, 1 β€ y1 β€ y2 β€ m) β coordinates of bottom left, and top right squares of the obstacle.
It is guaranteed that there are no obstacles at squares (1, 1) and (n, m), and no obstacles overlap (but some of them may touch).
Output
Output one integer β the number of ways to pass the track modulo 109 + 7.
Examples
Input
3 3 0
Output
1
Input
4 5 1
2 2 3 4
Output
2
Input
5 5 3
2 2 2 3
4 2 5 2
4 4 4 4
Output
3
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | vfc_32749 | {
"difficulty": "10",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "5 5 3\n2 2 2 3\n4 2 5 2\n4 4 4 4\n",
"output": "3\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 3 0\n",
"output": "1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4 5 1\n2 2 3 4\n",
"output": "2\n",
"type": "stdin_stdout"
}
]
} |
|
code_contests | verifiable_code | 742_A. Arpaβs hard exam and Mehrdadβs naive cheat | Solve the following coding problem using the programming language python:
There exists an island called Arpaβs land, some beautiful girls live there, as ugly ones do.
Mehrdad wants to become minister of Arpaβs land. Arpa has prepared an exam. Exam has only one question, given n, print the last digit of 1378n.
<image>
Mehrdad has become quite confused and wants you to help him. Please help, although it's a naive cheat.
Input
The single line of input contains one integer n (0 β€ n β€ 109).
Output
Print single integer β the last digit of 1378n.
Examples
Input
1
Output
8
Input
2
Output
4
Note
In the first example, last digit of 13781 = 1378 is 8.
In the second example, last digit of 13782 = 1378Β·1378 = 1898884 is 4.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
n = int(input())
if n == 0:
print(1)
if n % 4 == 0 and n!= 0 :
print(6)
if n % 4 == 1:
print(8)
if n % 4 == 2:
print(4)
if n % 4 == 3:
print(2)
``` | vfc_32753 | {
"difficulty": "7",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2\n",
"output": "4\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1\n",
"output": "8\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "12\n",
"output": "6\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1378\n",
"output": "4\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "51202278\n",
"output": "4\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 789_B. Masha and geometric depression | Solve the following coding problem using the programming language python:
Masha really loves algebra. On the last lesson, her strict teacher Dvastan gave she new exercise.
You are given geometric progression b defined by two integers b1 and q. Remind that a geometric progression is a sequence of integers b1, b2, b3, ..., where for each i > 1 the respective term satisfies the condition bi = bi - 1Β·q, where q is called the common ratio of the progression. Progressions in Uzhlyandia are unusual: both b1 and q can equal 0. Also, Dvastan gave Masha m "bad" integers a1, a2, ..., am, and an integer l.
Masha writes all progression terms one by one onto the board (including repetitive) while condition |bi| β€ l is satisfied (|x| means absolute value of x). There is an exception: if a term equals one of the "bad" integers, Masha skips it (doesn't write onto the board) and moves forward to the next term.
But the lesson is going to end soon, so Masha has to calculate how many integers will be written on the board. In order not to get into depression, Masha asked you for help: help her calculate how many numbers she will write, or print "inf" in case she needs to write infinitely many integers.
Input
The first line of input contains four integers b1, q, l, m (-109 β€ b1, q β€ 109, 1 β€ l β€ 109, 1 β€ m β€ 105) β the initial term and the common ratio of progression, absolute value of maximal number that can be written on the board and the number of "bad" integers, respectively.
The second line contains m distinct integers a1, a2, ..., am (-109 β€ ai β€ 109) β numbers that will never be written on the board.
Output
Print the only integer, meaning the number of progression terms that will be written on the board if it is finite, or "inf" (without quotes) otherwise.
Examples
Input
3 2 30 4
6 14 25 48
Output
3
Input
123 1 2143435 4
123 11 -5453 141245
Output
0
Input
123 1 2143435 4
54343 -13 6 124
Output
inf
Note
In the first sample case, Masha will write integers 3, 12, 24. Progression term 6 will be skipped because it is a "bad" integer. Terms bigger than 24 won't be written because they exceed l by absolute value.
In the second case, Masha won't write any number because all terms are equal 123 and this is a "bad" integer.
In the third case, Masha will write infinitely integers 123.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
b1,q,l,m = map(int,input().split())
a = set(map(int,input().split()))
if q==0:
if 0 in a:
if b1 in a:
print(0)
elif abs(b1)<=l:
print(1)
else:
print(0)
elif abs(b1)<=l:
print("inf")
else:
print(0)
elif q==1:
if abs(b1)<=l and b1 not in a:
print("inf")
else:
print(0)
elif q==-1:
if abs(b1)<=l and (b1 not in a or -b1 not in a):
print('inf')
else:
print(0)
elif b1==0:
if 0 in a:
print(0)
else:
print("inf")
else:
cnt = 0
p = b1
while abs(p)<=l:
if p not in a:
cnt += 1
p *= q
print(cnt)
``` | vfc_32761 | {
"difficulty": "8",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "123 1 2143435 4\n123 11 -5453 141245\n",
"output": "0\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 2 30 4\n6 14 25 48\n",
"output": "3\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 80_D. Falling Anvils | Solve the following coding problem using the programming language python:
For some reason in many American cartoons anvils fall from time to time onto heroes' heads. Of course, safes, wardrobes, cruisers, planes fall sometimes too... But anvils do so most of all.
Anvils come in different sizes and shapes. Quite often they get the hero stuck deep in the ground. But have you ever thought who throws anvils from the sky? From what height? We are sure that such questions have never troubled you!
It turns out that throwing an anvil properly is not an easy task at all. Let's describe one of the most popular anvil throwing models.
Let the height p of the potential victim vary in the range [0;a] and the direction of the wind q vary in the range [ - b;b]. p and q could be any real (floating) numbers. Then we can assume that the anvil will fit the toon's head perfectly only if the following equation has at least one real root:
<image>
Determine the probability with which an aim can be successfully hit by an anvil.
You can assume that the p and q coefficients are chosen equiprobably and independently in their ranges.
Input
The first line contains integer t (1 β€ t β€ 10000) β amount of testcases.
Each of the following t lines contain two space-separated integers a and b (0 β€ a, b β€ 106).
Pretests contain all the tests with 0 < a < 10, 0 β€ b < 10.
Output
Print t lines β the probability of a successful anvil hit for each testcase. The absolute or relative error of the answer should not exceed 10 - 6.
Examples
Input
2
4 2
1 2
Output
0.6250000000
0.5312500000
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
t = int(input())
for i in range(t):
a, b = map(int, input().split())
denom = a * b * 2
if denom == 0:
if b == 0:
print('1')
else:
print('0.5')
continue
if a > 4 * b:
nom = 2 * b * b
else:
nom = (b - a / 4.0 + b) / 2.0 * a
print('%.9f' % ((denom - nom) * 1.0 / denom))
``` | vfc_32765 | {
"difficulty": "10",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2\n4 2\n1 2\n",
"output": "0.6250000000\n0.5312500000\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "90\n1 1\n2 1\n3 1\n4 1\n5 1\n6 1\n7 1\n8 1\n9 1\n1 2\n2 2\n3 2\n4 2\n5 2\n6 2\n7 2\n8 2\n9 2\n1 3\n2 3\n3 3\n4 3\n5 3\n6 3\n7 3\n8 3\n9 3\n1 4\n2 4\n3 4\n4 4\n5 4\n6 4\n7 4\n8 4\n9 4\n1 5\n2 5\n3 5\n4 5\n5 5\n6 5\n7 5\n8 5\n9 5\n1 6\n2 6\n3 6\n4 6\n5 6\n6 6\n7 6\n8 6\n9 6\n1 7\n2 7\n3 7\n4 7\n5 7\n6 7\n7 7\n8 7\n9 7\n1 8\n2 8\n3 8\n4 8\n5 8\n6 8\n7 8\n8 8\n9 8\n1 9\n2 9\n3 9\n4 9\n5 9\n6 9\n7 9\n8 9\n9 9\n1 0\n2 0\n3 0\n4 0\n5 0\n6 0\n7 0\n8 0\n9 0\n",
"output": "0.5625000000\n0.6250000000\n0.6875000000\n0.7500000000\n0.8000000000\n0.8333333333\n0.8571428571\n0.8750000000\n0.8888888889\n0.5312500000\n0.5625000000\n0.5937500000\n0.6250000000\n0.6562500000\n0.6875000000\n0.7187500000\n0.7500000000\n0.7777777778\n0.5208333333\n0.5416666667\n0.5625000000\n0.5833333333\n0.6041666667\n0.6250000000\n0.6458333333\n0.6666666667\n0.6875000000\n0.5156250000\n0.5312500000\n0.5468750000\n0.5625000000\n0.5781250000\n0.5937500000\n0.6093750000\n0.6250000000\n0.6406250000\n0.5125000000\n0.5250000000\n0.5375000000\n0.5500000000\n0.5625000000\n0.5750000000\n0.5875000000\n0.6000000000\n0.6125000000\n0.5104166667\n0.5208333333\n0.5312500000\n0.5416666667\n0.5520833333\n0.5625000000\n0.5729166667\n0.5833333333\n0.5937500000\n0.5089285714\n0.5178571429\n0.5267857143\n0.5357142857\n0.5446428571\n0.5535714286\n0.5625000000\n0.5714285714\n0.5803571429\n0.5078125000\n0.5156250000\n0.5234375000\n0.5312500000\n0.5390625000\n0.5468750000\n0.5546875000\n0.5625000000\n0.5703125000\n0.5069444444\n0.5138888889\n0.5208333333\n0.5277777778\n0.5347222222\n0.5416666667\n0.5486111111\n0.5555555556\n0.5625000000\n1.0000000000\n1.0000000000\n1.0000000000\n1.0000000000\n1.0000000000\n1.0000000000\n1.0000000000\n1.0000000000\n1.0000000000\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "10\n4 6\n4 2\n10 3\n6 3\n7 8\n2 5\n0 3\n6 1\n4 1\n10 9\n",
"output": "0.5416666667\n0.6250000000\n0.7083333333\n0.6250000000\n0.5546875000\n0.5250000000\n0.5000000000\n0.8333333333\n0.7500000000\n0.5694444444\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "90\n1 1\n2 1\n3 1\n4 1\n5 1\n6 1\n7 1\n8 1\n9 1\n1 2\n2 2\n3 2\n4 2\n5 2\n6 2\n7 2\n8 2\n9 2\n1 3\n2 3\n3 3\n4 3\n5 3\n6 3\n7 3\n8 3\n9 3\n1 4\n2 4\n3 4\n4 4\n5 4\n6 4\n7 4\n8 4\n9 4\n1 5\n2 5\n3 5\n4 5\n5 5\n6 5\n7 5\n8 5\n9 5\n1 6\n2 6\n3 6\n4 6\n5 6\n6 6\n7 6\n8 6\n9 6\n1 7\n2 7\n3 7\n4 7\n5 7\n6 7\n7 7\n8 7\n9 7\n1 8\n2 8\n3 8\n4 8\n5 8\n6 8\n7 8\n8 8\n9 8\n1 9\n2 9\n3 9\n4 9\n5 9\n6 9\n7 9\n8 9\n9 9\n1 0\n2 0\n3 0\n4 0\n5 0\n6 0\n7 1\n8 0\n9 0\n",
"output": "0.5625\n0.625\n0.6875\n0.75\n0.8\n0.8333333333333334\n0.8571428571428571\n0.875\n0.8888888888888888\n0.53125\n0.5625\n0.59375\n0.625\n0.65625\n0.6875\n0.71875\n0.75\n0.7777777777777778\n0.5208333333333334\n0.5416666666666666\n0.5625\n0.5833333333333334\n0.6041666666666666\n0.625\n0.6458333333333334\n0.6666666666666666\n0.6875\n0.515625\n0.53125\n0.546875\n0.5625\n0.578125\n0.59375\n0.609375\n0.625\n0.640625\n0.5125\n0.525\n0.5375\n0.55\n0.5625\n0.575\n0.5875\n0.6\n0.6125\n0.5104166666666666\n0.5208333333333334\n0.53125\n0.5416666666666666\n0.5520833333333334\n0.5625\n0.5729166666666666\n0.5833333333333334\n0.59375\n0.5089285714285714\n0.5178571428571429\n0.5267857142857143\n0.5357142857142857\n0.5446428571428571\n0.5535714285714286\n0.5625\n0.5714285714285714\n0.5803571428571429\n0.5078125\n0.515625\n0.5234375\n0.53125\n0.5390625\n0.546875\n0.5546875\n0.5625\n0.5703125\n0.5069444444444444\n0.5138888888888888\n0.5208333333333334\n0.5277777777777778\n0.5347222222222222\n0.5416666666666666\n0.5486111111111112\n0.5555555555555556\n0.5625\n1\n1\n1\n1\n1\n1\n0.8571428571428571\n1\n1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "10\n4 6\n3 2\n10 3\n6 3\n7 8\n2 5\n0 3\n6 1\n4 1\n10 9\n",
"output": "0.5416666666666666\n0.59375\n0.7083333333333334\n0.625\n0.5546875\n0.525\n0.5\n0.8333333333333334\n0.75\n0.5694444444444444\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n4 2\n0 2\n",
"output": "0.625\n0.5\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 835_B. The number on the board | Solve the following coding problem using the programming language python:
Some natural number was written on the board. Its sum of digits was not less than k. But you were distracted a bit, and someone changed this number to n, replacing some digits with others. It's known that the length of the number didn't change.
You have to find the minimum number of digits in which these two numbers can differ.
Input
The first line contains integer k (1 β€ k β€ 109).
The second line contains integer n (1 β€ n < 10100000).
There are no leading zeros in n. It's guaranteed that this situation is possible.
Output
Print the minimum number of digits in which the initial number and n can differ.
Examples
Input
3
11
Output
1
Input
3
99
Output
0
Note
In the first example, the initial number could be 12.
In the second example the sum of the digits of n is not less than k. The initial number could be equal to n.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
"""
Author : Arif Ahmad
Date :
Algo :
Difficulty :
"""
from sys import stdin, stdout
def main():
k = int(stdin.readline().strip())
n = stdin.readline().strip()
n = sorted(n)
total = 0
for c in n:
d = ord(c) - 48
total += d
ans = 0
for c in n:
if total >= k: break
d = ord(c) - 48
total = total - d + 9
ans += 1
stdout.write(str(ans) + '\n')
if __name__ == '__main__':
main()
``` | vfc_32769 | {
"difficulty": "8",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3\n11\n",
"output": "1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n99\n",
"output": "0\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n21\n",
"output": "0\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n111\n",
"output": "0\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "6\n33\n",
"output": "0\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "6\n222\n",
"output": "0\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 855_E. Salazar Slytherin's Locket | Solve the following coding problem using the programming language python:
Harry came to know from Dumbledore that Salazar Slytherin's locket is a horcrux. This locket was present earlier at 12 Grimmauld Place, the home of Sirius Black's mother. It was stolen from there and is now present in the Ministry of Magic in the office of Dolorous Umbridge, Harry's former Defense Against the Dark Arts teacher.
Harry, Ron and Hermione are infiltrating the Ministry. Upon reaching Umbridge's office, they observed a code lock with a puzzle asking them to calculate count of magic numbers between two integers l and r (both inclusive).
Harry remembered from his detention time with Umbridge that she defined a magic number as a number which when converted to a given base b, all the digits from 0 to b - 1 appear even number of times in its representation without any leading zeros.
You have to answer q queries to unlock the office. Each query has three integers bi, li and ri, the base and the range for which you have to find the count of magic numbers.
Input
First line of input contains q (1 β€ q β€ 105) β number of queries.
Each of the next q lines contain three space separated integers bi, li, ri (2 β€ bi β€ 10, 1 β€ li β€ ri β€ 1018).
Output
You have to output q lines, each containing a single integer, the answer to the corresponding query.
Examples
Input
2
2 4 9
3 1 10
Output
1
2
Input
2
2 1 100
5 1 100
Output
21
4
Note
In sample test case 1, for first query, when we convert numbers 4 to 9 into base 2, we get:
* 4 = 1002,
* 5 = 1012,
* 6 = 1102,
* 7 = 1112,
* 8 = 10002,
* 9 = 10012.
Out of these, only base 2 representation of 9 has even number of 1 and 0. Thus, the answer is 1.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
import sys
range = xrange
input = raw_input
def int2base(n, base):
if n == 0:
return [0]
A = []
while n:
n,r = divmod(n, base)
A.append(r)
return A
big = 10**18
DP = [[[0]*(1 << b) for _ in range(b>1 and len(int2base(big, b)) + 1)] for b in range(11)]
DP0 = [[[0]*(1 << b) for _ in range(b>1 and len(int2base(big, b)) + 1)] for b in range(11)]
for b in range(2,11):
DPb = DP[b]
DP0b = DP0[b]
DP0b[0][0] = 1
for l in range(1, len(DPb)):
for mask in range(1 << b):
for digit in range(b):
DP0b[l][mask ^ (1 << digit)] += DP0b[l - 1][mask]
for digit in range(1, b):
DPb[l][mask ^ (1 << digit)] += DP0b[l - 1][mask]
inp = sys.stdin.read().split()
ii = 0
# < upper
def counter(upper, base):
if upper <= base:
return 0
number = int2base(upper, base)
DPb = DP[base]
DP0b = DP0[base]
mask = 0
n = number.pop()
ans = 0
for l in range(len(number) + 1):
ans += DPb[l][0]
for digit in range(1, n):
ans += DP0b[len(number)][mask ^ (1 << digit)]
mask ^= 1 << n
while number:
n = number.pop()
for digit in range(n):
ans += DP0b[len(number)][mask ^ (1 << digit)]
mask ^= 1 << n
return ans
q = int(inp[ii]); ii += 1
out = []
for _ in range(q):
b = int(inp[ii]); ii += 1
l = int(inp[ii]); ii += 1
r = int(inp[ii]); ii += 1
out.append(str(counter(r + 1, b) - counter(l, b)))
print '\n'.join(out)
``` | vfc_32773 | {
"difficulty": "11",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2\n2 1 100\n5 1 100\n",
"output": "21\n4\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 87_C. Interesting Game | Solve the following coding problem using the programming language python:
Two best friends Serozha and Gena play a game.
Initially there is one pile consisting of n stones on the table. During one move one pile should be taken and divided into an arbitrary number of piles consisting of a1 > a2 > ... > ak > 0 stones. The piles should meet the condition a1 - a2 = a2 - a3 = ... = ak - 1 - ak = 1. Naturally, the number of piles k should be no less than two.
The friends play in turns. The player who cannot make a move loses. Serozha makes the first move. Who will win if both players play in the optimal way?
Input
The single line contains a single integer n (1 β€ n β€ 105).
Output
If Serozha wins, print k, which represents the minimal number of piles into which he can split the initial one during the first move in order to win the game.
If Gena wins, print "-1" (without the quotes).
Examples
Input
3
Output
2
Input
6
Output
-1
Input
100
Output
8
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
import math
from collections import Counter
n = int(input())
g = [0 for i in range(n + 1)]
prefix_xor = g.copy()
def in_range(d, k):
if (2 * k - d * d + d) % (2 * d) != 0:
return -1
x = (2 * k - d * d + d) / (2 * d)
return int(x) if x > 0 else -1
def mex(arr):
counter = Counter()
for i in arr:
counter[i] += 1
for i in range(0, len(arr) + 1):
if counter[i] == 0:
return i
def find_move(arr):
for i in range(0, len(arr)):
if arr[i] == 0:
return i
return -1
if n < 3:
print(-1)
exit(0)
for i in range(3, n + 1):
for_range = range(2, int(math.sqrt(2 * i)) + 1)
filter_range = [l for l in for_range if in_range(l, i) > 0]
branches = [prefix_xor[in_range(d, i) + d - 1] ^ prefix_xor[in_range(d, i) - 1] for d in filter_range]
g[i] = mex(branches)
prefix_xor[i] = prefix_xor[i - 1] ^ g[i]
if i == n:
print(-1 if g[i] == 0 else filter_range[find_move(branches)])
``` | vfc_32777 | {
"difficulty": "9",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "6\n",
"output": "-1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "100\n",
"output": "8\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n",
"output": "2\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "56\n",
"output": "-1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1\n",
"output": "-1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "46\n",
"output": "4\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 903_E. Swapping Characters | Solve the following coding problem using the programming language python:
We had a string s consisting of n lowercase Latin letters. We made k copies of this string, thus obtaining k identical strings s1, s2, ..., sk. After that, in each of these strings we swapped exactly two characters (the characters we swapped could be identical, but they had different indices in the string).
You are given k strings s1, s2, ..., sk, and you have to restore any string s so that it is possible to obtain these strings by performing aforementioned operations. Note that the total length of the strings you are given doesn't exceed 5000 (that is, kΒ·n β€ 5000).
Input
The first line contains two integers k and n (1 β€ k β€ 2500, 2 β€ n β€ 5000, k Β· n β€ 5000) β the number of strings we obtained, and the length of each of these strings.
Next k lines contain the strings s1, s2, ..., sk, each consisting of exactly n lowercase Latin letters.
Output
Print any suitable string s, or -1 if such string doesn't exist.
Examples
Input
3 4
abac
caab
acba
Output
acab
Input
3 4
kbbu
kbub
ubkb
Output
kbub
Input
5 4
abcd
dcba
acbd
dbca
zzzz
Output
-1
Note
In the first example s1 is obtained by swapping the second and the fourth character in acab, s2 is obtained by swapping the first and the second character, and to get s3, we swap the third and the fourth character.
In the second example s1 is obtained by swapping the third and the fourth character in kbub, s2 β by swapping the second and the fourth, and s3 β by swapping the first and the third.
In the third example it's impossible to obtain given strings by aforementioned operations.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
import collections
def swapCharacters(strings, k, n):
"""
Time: O(n^2 * k)
Space: O(1)
"""
if k == 1:
s0 = list(strings[0])
s0[0], s0[1] = s0[1], s0[0]
return ''.join(s0)
# Initial check for validity
freq = collections.Counter(strings[0])
canSame = (max(freq.values()) >= 2) # could swap two of the same characters ==> same string
for s in strings:
if collections.Counter(s) != freq:
return -1
# Find diff indices between first two strings
max_dist = 0
max_dist_s = None
s0 = strings[0]
for s1 in strings[1:]:
dist = HammingDistance(s0, s1, n)
if dist > max_dist:
max_dist = dist
max_dist_s = s1
# Hamming distance <= 2*2 between input strings to be valid
if max_dist > 4:
return -1
diffs = [i for i in range(n) if s0[i] != s1[i]]
# Checks all possible strings which match first two -- Finding strings (O(N)), testing string (O(KN))
s0 = list(s0)
for i in diffs:
for j in range(n):
# try swapping
s0[i], s0[j] = s0[j], s0[i]
# see if matches second string now
#dist = sum([s0[i] != s1[i] for i in diffs])
dist = HammingDistance(s0, s1, n)
if dist == 2 or (dist == 0 and canSame):
cand = ''.join(s0)
if verifyAll(strings, k, n, cand, canSame):
return cand
# revert
s0[i], s0[j] = s0[j], s0[i]
# nothing works
return -1
def HammingDistance(s0, s1, n):
count = 0
for i in range(n):
if s0[i] != s1[i]:
count += 1
return count
def verifyAll(strings, k, n, cand, canSame):
for s in strings:
dist = HammingDistance(s, cand, n)
if (dist != 0 or not canSame) and dist != 2:
return False
return True
k, n = [int(x) for x in input().split()]
strings = set() # discard duplicates
for _ in range(k):
strings.add(input())
strings = list(strings)
k = len(strings)
res = swapCharacters(strings, k, n)
print(res)
``` | vfc_32781 | {
"difficulty": "11",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "5 4\nabcd\ndcba\nacbd\ndbca\nzzzz\n",
"output": "-1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 4\nabac\ncaab\nacba\n",
"output": "acab\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 4\nkbbu\nkbub\nubkb\n",
"output": "kbub\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 4\nkbub\nkbbu\nubkb\n",
"output": "kbub\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5 5\nzbibx\nzbbix\nzbibx\nxbibz\nxbibz\n",
"output": "zbibx\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 925_F. Parametric Circulation | Solve the following coding problem using the programming language python:
Vova has recently learned what a circulaton in a graph is. Recall the definition: let G = (V, E) be a directed graph. A circulation f is such a collection of non-negative real numbers f_e (e β E), that for each vertex v β V the following conservation condition holds:
$$$β_{e β \delta^{-}(v)} f_e = β_{e β \delta^{+}(v)} f_e$$$
where \delta^{+}(v) is the set of edges that end in the vertex v, and \delta^{-}(v) is the set of edges that start in the vertex v. In other words, for each vertex the total incoming flow should be equal to the total outcoming flow.
Let a lr-circulation be such a circulation f that for each edge the condition l_e β€ f_e β€ r_e holds, where l_e and r_e for each edge e β E are two non-negative real numbers denoting the lower and upper bounds on the value of the circulation on this edge e.
Vova can't stop thinking about applications of a new topic. Right now he thinks about the following natural question: let the graph be fixed, and each value l_e and r_e be a linear function of a real variable t:
$$$l_e(t) = a_e t + b_e r_e(t) = c_e t + d_e$$$
Note that t is the same for all edges.
Let t be chosen at random from uniform distribution on a segment [0, 1]. What is the probability of existence of lr-circulation in the graph?
Input
The first line contains two integers n, m (1 β€ n β€ 1000, 1 β€ m β€ 2000).
Each of the next m lines describes edges of the graph in the format u_e, v_e, a_e, b_e, c_e, d_e (1 β€ u_e, v_e β€ n, -10^4 β€ a_e, c_e β€ 10^4, 0 β€ b_e, d_e β€ 10^4), where u_e and v_e are the startpoint and the endpoint of the edge e, and the remaining 4 integers describe the linear functions for the upper and lower bound of circulation.
It is guaranteed that for any t β [0, 1] and for any edge e β E the following condition holds 0 β€ l_e(t) β€ r_e(t) β€ 10^4.
Output
Print a single real integer β the probability of existence of lr-circulation in the graph, given that t is chosen uniformly at random from the segment [0, 1]. Your answer is considered correct if its absolute difference from jury's answer is not greater than 10^{-6}.
Example
Input
3 3
1 2 0 3 -4 7
2 3 -2 5 1 6
3 1 0 4 0 4
Output
0.25
Note
In the first example the conservation condition allows only circulations with equal values f_e for all three edges. The value of circulation on the last edge should be 4 whatever t is chosen, so the probability is
$$$P(4 β [3, -4t + 7]~~\&~~4 β [-2t + 5, t + 6]) = 0.25$$$
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | vfc_32785 | {
"difficulty": "12",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3 3\n1 2 0 3 -4 7\n2 3 -2 5 1 6\n3 1 0 4 0 4\n",
"output": "0.2500000000\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2 2\n1 2 1 4 2 4\n1 2 3 4 4 4\n",
"output": "0\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2 2\n1 2 0 9998 0 9999\n2 1 0 9999 0 10000\n",
"output": "1.0000000000\n",
"type": "stdin_stdout"
}
]
} |
|
code_contests | verifiable_code | 954_G. Castle Defense | Solve the following coding problem using the programming language python:
Today you are going to lead a group of elven archers to defend the castle that is attacked by an army of angry orcs. Three sides of the castle are protected by impassable mountains and the remaining side is occupied by a long wall that is split into n sections. At this moment there are exactly ai archers located at the i-th section of this wall. You know that archer who stands at section i can shoot orcs that attack section located at distance not exceeding r, that is all such sections j that |i - j| β€ r. In particular, r = 0 means that archers are only capable of shooting at orcs who attack section i.
Denote as defense level of section i the total number of archers who can shoot at the orcs attacking this section. Reliability of the defense plan is the minimum value of defense level of individual wall section.
There is a little time left till the attack so you can't redistribute archers that are already located at the wall. However, there is a reserve of k archers that you can distribute among wall sections in arbitrary way. You would like to achieve maximum possible reliability of the defence plan.
Input
The first line of the input contains three integers n, r and k (1 β€ n β€ 500 000, 0 β€ r β€ n, 0 β€ k β€ 1018) β the number of sections of the wall, the maximum distance to other section archers can still shoot and the number of archers yet to be distributed along the wall. The second line contains n integers a1, a2, ..., an (0 β€ ai β€ 109) β the current number of archers at each section.
Output
Print one integer β the maximum possible value of defense plan reliability, i.e. the maximum possible value of minimum defense level if we distribute k additional archers optimally.
Examples
Input
5 0 6
5 4 3 4 9
Output
5
Input
4 2 0
1 2 3 4
Output
6
Input
5 1 1
2 1 2 1 2
Output
3
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
import sys
border = 1 << 30
def build(x=0):
res = [0, 0]
i = 0
while x and i < 30:
if x & 1:
res[1] += (1 << i)
x >>= 1
i += 1
i = 0
while x:
if x & 1:
res[0] += (1 << i)
x >>= 1
i += 1
return res
n, r, k = map(int, sys.stdin.buffer.readline().decode('utf-8').split())
a = list(map(int, sys.stdin.buffer.readline().decode('utf-8').split()))
k_big, k_small = build(k)
left = build(sum(a[:r]))
minus_big, minus_small = [0]*n, [0]*n
w = 2*r+1
def solve(level_big, level_small):
used_big = used_small = 0
acc_big, acc_small = left
for i in range(n):
if minus_small[i] or minus_big[i]:
acc_big -= minus_big[i]
acc_small -= minus_small[i]
if acc_small < 0:
acc_small += border
acc_big -= 1
elif acc_small >= border:
acc_small -= border
acc_big += 1
minus_big[i] = minus_small[i] = 0
acc_small += (a[i+r] if i+r < n else 0) - (a[i-r-1] if i-r >= 1 else 0)
if acc_small >= border:
acc_small -= border
acc_big += 1
elif acc_small < 0:
acc_small += border
acc_big -= 1
if acc_big < level_big or acc_big == level_big and acc_small < level_small:
used_big += level_big - acc_big
used_small += level_small - acc_small
if used_small >= border:
used_small -= border
used_big += 1
elif used_small < 0:
used_small += border
used_big -= 1
if used_big > k_big or used_big == k_big and used_small > k_small:
break
if i+w < n:
minus_big[i+w] = level_big - acc_big
minus_small[i+w] = level_small - acc_small
acc_big = level_big
acc_small = level_small
for i in range(i+1, n):
if minus_small[i] or minus_big[i]:
minus_small[i] = minus_big[i] = 0
return used_big < k_big or used_big == k_big and used_small <= k_small
ok, ng = min(a), k + sum(a) + 1
while abs(ok - ng) > 1:
mid = (ok + ng) >> 1
if solve(*build(mid)):
ok = mid
else:
ng = mid
print(ok)
``` | vfc_32789 | {
"difficulty": "13",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 500000000}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4 2 0\n1 2 3 4\n",
"output": "6\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 1-7 | Solve the following coding problem using the programming language python:
Raj and simran are in love. but thakur baldev singh doesnt want them to be together. But baldev Singh cares for her daughter too. He wants raj to prove his love for her daughter and family. So Baldev singh being a great lover of strings sets up problem for raj. he screams out a string and asks simran to choose her favourite alphabet. inorder to win simran, raj would have to speak out the no. of times that character appears in the screamed string.
Input
first line contains T . no of test cases
next T lines contains string s and character c .
Output
count of character c in string s .
Constraint
0 < T < 100
0 < sizeof(string s) β€ 1000
c = {a-z}
SAMPLE INPUT
2
abca a
bbb c
SAMPLE OUTPUT
2
0
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
t = input();
while(t > 0):
s = raw_input().split();
print s[0].count(s[1]);
t -= 1;
``` | vfc_32797 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2\nabca a\nbbb c\n\nSAMPLE",
"output": "2\n0",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "100\nwlrbbmqbhcdarzowkkyhiddqscdxrjmowfrxsjybldbefsarcbynecdyggxxpklorellnmpapqfwkhopkmcoqhnwnkuewhsqmgbbuqcljjivswmdkqtbxixmvtrrbljptnsnfwzqfjmafadrrwsofsbcnuvqhffbsaqxwpqcacehchzvfrkmlnozjkpqpxrjxkitzyxacbhhkicqcoendtomfgdwdwfcgpxiqvkuytdlcgdewhtaciohordtqkvwcsgspqoqmsboaguwnnyqxnzlgdgwpbtrwblnsadeuguumoqcdrubetokyxhoachwdvmxxrdryxlmndqtukwagmlejuukwcibxubumenmeyatdrmydiajxloghiqfmzhl v\nhjouvsuyoypayulyeimuotehzriicfskpggkbbipzzrzucxamludfykgruowzgiooobppleqlwphapjnadqhdcnvwdtxjbmyppphauxnspusgdhiixqmbfjxjcvudjsuyibyebmwsiqyoygyxymzevypzvjegebeocfuftsxdixtigsieehkchzdflilrjqfnxztqrsvbspkyhsenbppkqtpddbuotbbqcwivrfxjujjddntgeiqvdgaijvwcyaubwewpjvygehljxepbpiwuqzdzubdubzvafspqpqwuzifwovyddwyvvburczmgyjgfdxvtnunneslsplwuiupfxlzbknhkwppanltcfirjcddsozoyvegurfwcsfmoxeqmrjowrghwlkobmeahkgccnaehhsveymqpxhlrnunyfdzrhbasjeuygafoubutpnimuwfjqsjxvkqdorxxvrwctdsneogvbpkxlpgdirbfcriqifpgynkrrefx s\nvucftpwctgtwmxnupycfgcuqunublmoiitncklefszbexrampetvhqnddjeqvuygpnkazqfrpjvoaxdpcwmjobmskskfojnewxgxnnofwltwjwnnvbwjckdmeouuzhyvhgvwujbqxxpitcvograiddvhrrdsycqhkleewhxtembaqwqwpqhsuebnvfgvjwdvjjafqzzxlcxdzncqgjlapopkvxfgvicetcmkbljopgtqvvhbgsdvivhesnkqxmwrqidrvmhlubbryktheyentmrobdeyqcrgluaiihveix w\njrqopubjguxhxdipfzwswybgfylqvjzharvrlyauuzdrcnjkphclffrkeecbpdipufhidjcxjhrnxcxmjcxohqanxdrmgzebhnlmwpmhwdvthsfqueeexgrujigskmvrzgfwvrftwapdtutpbztygnsrxajjngcomikjzsdwssznovdruypcnjulkfuzmxnafamespckjcazxdrtdgyrqscczybnvqqcqcjitlvcnvbmasidzgwraatzzwpwmfbfjkncvkelhhzjchpdnlunmppnlgjznkewwuysgefonexpmmsbaopmdgzqmkqzxuvtqvnxbslqzkglzamzpdnsjolvybwxxttqognrbaiakqllszkhfzconnmoqklpeefsnsmouwqhodsgcfohesyshmgxwtoayuvnojdjftqtwkbapriujimqwspslgvlcsaqbdbgwtbseettwdnfnbyjvpdjxyuzqxstatbzpctthoofremgfkrbcvkzvgbofthgojhdnaywpnbitoraaibednezwfpdawlohssvtqtkfvsylj z\nucqxswyqdntdmfrtzlqsekejhzksklfepxchvczysvdgcxbbiswmeaylzifktmoikssfxtgpojxqiysrsqfwqdjqnqcgdqrnlluieazvmwnuufnnxvloyvgmliuqandlyavfauaosnlnvacsvpiumoiawcqxswkqwgxyazntnaikameybnuqbcqaggxachrynqxqqmlfotpqhvokiiammqmvxjvbsoaifzyxnjcberrnmixxsyjhovengbpyqrixqgwdrygxrxkfhicainhwilkqmbpeszdigznzxtzqsjwatycbmjawwmninepfduplucltxmkpvgrrgtuseurageltkcapwpbqromqawixezqkvlfbhwcocpjmrmbpbegvsuluqtuuvkesvjtdhvtjmexfqbvufdpaxcwnwqjtbplyzedicwsodpwtqrpyuearhwgfnpaqelofrsotqiktxipqzeqvlqmuoubbjbrpmixfclbstnosvdkujcpwsdqhxrkiueziowoqjpiecwxxbjtnmkjgncpmvauqgtausokbfugjtfiu q\njclvlazamucimicnewdoxjlfuemdadgkhufsuevjaxrnivcorhfrqqwnujquoyevslqprlyskrhunljgsoxleuyyfqutozqhmgyetyyepfaesjlkzivdevdllygazxjndjrxhrdyyddqnqdoayshwxshxzjywumbffamxdnxjqoyirmirernekxdlicjfqkkvnxuqmszcixmzkwsqoiwyfalpeuuugfrteomqinuqnirxelpstosaodqszkogrfbxtnpdbltqtmpyyeqtujuiokcowswqyxntndxqqsgkhvihbaawjugagloddktdjizynyoesuozryityjrifximkyrokktvusuiqiojfckyatryekijksvusokcyeavwufpctajxkixdbxjmitwcqqxfbbfhbadvfuaaujxfrwkvuuhepdifvfkyhsfiuleafgaapahjwtesplweqfmnmymtqreleinkopmfpvomqueghdmxkynwxzqnswaxgnjwdxbuusgkmnqwqdvadiwahoqakqzqgkmlhqfdimnwzgsplorownpgehioxhhfrvqalwdtksslykajataxgpdmyldxukdnftprrumbmemlrowrhwoqntclghlcrorzhgsbaecplpccdyvnxmdmfhaoplqizkhiqbjtimitdkxiksxjecwmkwabhslievqvwcqeqaztkydwrbgxdcjpalshgepkzhhv l\ncbxdwjccgtdoqiscyspqzvuqivzptlpvooynyapgvswoaosaghrffnxnjyeeltzaizniccozwknwyhzgpqlwfkjqipuujvwtxlbznryjdohbvghmyuiggtyqjtmuqinntqmihntkddnalwnmsxsatqqeldacnnpjfermrnyuqnwbjjpdjhdeavknykpoxhxclqqedqavdwzoiorrwwxyrhlsrdgqkduvtmzzczufvtvfioygkvedervvudneghbctcbxdxezrzgbpfhzanffeccbgqfmzjqtlrsppxqiywjobspefujlxnmddurddiyobqfspvcoulcvdrzkmkwlyiqdchghrgytzdnobqcvdeqjystmepxcaniewqmoxkjwpymqorluxedvywhcoghotpusfgiestckrpaigocfufbubiyrrffmwaeeimidfnnzcphkflpbqsvtdwludsgaungfzoihbxifoprwcjzsdxngtacw t\nypweuxvegybogsfxqhipbompufpxckicaghufczmaccgwigmrqcteqkbwbaamicoqlivnjjoomwkucznvdgztqarsargkwuaheyvohletjqpopdjslkoelfynzeavaaceazuimydypvmgyxb l\nppuunkttkqtmvanuuvjvahmvvuvsvhzkywhmgchqvdcqdpmzmxwneikzfgtantnlpwzvahnvkplpfaotxngexrfczzdmuszlobiokvkwkxlrxblvotzomeqlftxzlzkbcsqmnciazvrzyeupyvdkbtwhpvgcwteylwkbyubxruwszshxpmjrhfawdibzbfypdksbhtaapzsorbnjpzcxecvjmwjqdjhgvzjcukfjjzacbpnsoppvtleijpynyfvuefyyrdjadjegbsypjomfbrnkilzhsvbwczwtdfvirbosvmjfcymdrzqzkpgemjaojyjofeywimqdackdawitxysjqzncipttncjtjhrtvkwwojbqhjjfkboa c\nenrxihcsanbtgxdcttnujvfscrwqtyuynmxwvbqxorquowzhpmdzjlrlcncyoywbmvzhxpenhvivthfivkhfxbqaquyetwifthnsxrggoqbhxiqsvzzscqutmszfqjnmtaeqtmykcbrzkjuhltznluiyokfhvstouzgqmeaogrqsdmzohydtuotjyysttlknmqdyvdpbxftatuqastvphoahpsdifnxrfbqaghdfoyhhsxhntdcctcmiupqzeqsjrkmzrphfoooioyvjdxnwbzhvqzwuprgibsitjpazfritpfesfsqgrxekxcgmtmvvgfqqwspdjxzaddukvlqpkuzjzhwsutpcafsyaibjhammegwbtpqelrnkbldxguzgcseccinlizyogwqzlifxcthdgmanjztltanviajschhkdxlrfrohmxmsmmhvodihdvfnxofbxmlclxvrojacjpwxbeurhcbmzgzwwgyvtlzeivxygaappzosdikkmlwltxirdioytnfeieepehgvgvqjfavsntfiqnbvxputczznfdcmkkhshxdnzyhormwjcxfbobwrcvehbitnsdgacjpeiysbmrnoqssfvoyxkeglmaygfgihqznazgdmzqcpiuudjucvyjimlivqpdzhfnhevksudvjlrgrcavxzehlrqgjhmjqtyzztjsnopyagetjfqiexqroiayrojhjhgiarcpgrniysdhztpfqhwhpyfioopxxvgxniovabdatgjszazsiwzzweiluxirvqqkzefbhiddqmxrmxjwtiwrogckdldadtkczpfhzikpujhjgqfbbbt r\nvcnifnmbaqapyjrgvg d\npmlirnjvgaedetokjcljsnaqzrzuacbpqnxjciekllnpedbpfoyyczqdspxstbkjqjtsuzcfkrwrxygcmfaqgttyitteudnkmgegginsbkjyksbyxdrfwkfhfylzbalqjpyrxmjzyvxknyimezramyjrxwtaxesgurxtfiudfspssxgwzzzlykevhxxgeqmahltovorbiivcfczgdatbkaytxwzdondvazjwpczxkwzraaaecthnvggteiysvcpwdausevrqrsjstjwxffkaltvrbulyyaudcqvglowdggxbpvzwalxogufhotioteryvoeicbnljkoahnxibwwhqdrhwzxsfpqadujixytijjjqziaaewjwccfyddqjuijzduhctclemwwlexnkvwizzoyctqlnzxoetyioavsorrbvoqflpqlqgluzdgoefckaatpdohtgaxdqnlcebpuhapgfxwkcaucbnrgebbmdypuoaysdnnkpesuboedrbhuqbauedghcydsabmeoboffjcgzglqjvkawmucqdlubpmbqyfhcwmhfoogxzxguhiswdwmiigjzumpuuywsnezd u\nctcjqmrkiwhwerepqyehsyirqvxryrwbmbmepfpzeyvkrzajzesteakwvhnwalznmnrbuicygxjxylixrbtvbdrzngxnrwcglujfcmellpkmctltueqvkjuxprmippoajyinmmyxdjjfevayzqtlzqiojxybmndxllmxzlwcwgjadjaebvqalaqxxpyjedippvooimtgucixoierfwsrwkqubqfftqwinmxvzsdtwltmvxeatytrillkbtpvlofyaetzwyttlofiljkghexspletgvqrjvpkakjyietvszdfknlutlojyseenuxxpohrysqixldpkivxvitpvhatbezoawnpkwjkpbummzdzhayflrugawcbabrayhrkdcxsdrgsrmramp f\nibgkxinzlgbjntwrvtlbmstfemisdnslpavokkovqphekfxiaijmaeugqcbtrvggvdxfnlcdajjnqgvqpedrizaabbtswbbteyatlcwnoiaeovvdbaxlzxlcygwwhzpnzpgkrfahnambyjhzlelkbwobfkxmkmcjbiwupwccwqguznwmrhyufmvkyszigbuhlsdbofdmxjjyyfkroiltuievcffigzrtrvuhcaucldakkldyvprszxnecsmkugendavhapjmukyexdcsutmutzyvumiosmbxmwfpnodhadnxgpsblevegvbahlqcxrzmqebfvgpvjcvpupqfvnlbiodsatuznvldcoixuxudcpvwelbcbodjejdecxgpttuviduecokeefaksdottsfabigfgmxbgryqusuziefojibcnpvjhcjklpstcpuiguydouewzjlkrmmhbkqlmzxzopssgmcnicswxwtwheibqvithyevzevptnicckpknjhmhakogspypzrwxyuycpoxewzgiqtxzcjgetxkmm k\nobanbumdladpycygtrgutpdzlajzovccwcqaycfjeibclzkgsqanifmtfxsusuyqzoqxsyjwgkatllbfdesljggpdalxvjnwygvqegpmspgdcjignctxiaonazkxiyvigrbkzqwsfexiogodkjatlqioptlatjkzcllbbhthorpezfhjqkecapqsidubmecoqnsrulakerofyyrpivrkkheumyxzdzpvmhmjvpvbgkhfkyusvneiwjcijajmbzjqiwzfnuhtgoaqmukhjrpfauojwzyxyhnjfooslxorlokzlwjunaanuqzqpzqqifzoupifnwyankayhjsujukgklyckqsswtiskrzxpzackccrlxnwrxecifeuvynrrxlbqkbgkdkufpnsmaqdavhkanfxluperciinlqxoctvrindifjkaqvcgaaruryntivitnhjqcghktnvywfbocfuchoyammwwjerxoapqiwbblwbjdeygksktijuwxqsiwjhklwbtvcwgaaqfeqlqkykthgpgwkostwfhsgapkzw m\norfefwofihmozumjkgeilldtosfnorocltisrxxbelrdhdormtaxeftuxyhosxsdtbxkyuoehfkolyfxthwympskqcaibsnutkhtevylciznigkcohccywooaoychlycvfwbcuofepuowfqmouoordfttdvapudkbzmgvclzsfpomiaccqtvvyppdmrsiufkvtqqvdrnkjbzrddtwwrtwiiaucsdwzpushmomgdyphxgmdbibucycmyxoscnutjmcvcqdgoupocbremuaqsdcsctneihzrvboyrsghmvvpyovkjvadadwcylggshzninnbhvjusglrvibgdejgjfihqrpkyoajdpkllvhfeswzaahfeqlnyuwqnlblbdwesjpdewjiohjqjqynjlchhyxulagmdcrwlgbsfmcvwomfgmtpxxyfywzjyhycmpyxxbrcowakkmpqakixkgciectdjrhvghvgiokykkkuycnymvwydagicanorwladiilxsmhfwedytenocltcsdfusvnognrrvfoqrxvpdyowedmgoijilqeelsstfmkdtatkaobforctuqbjyktmayqnqkhxytarwvdyjfdawhvrywcyhxkjvcxnpglnbnfxjkxspbuoiphimjhvgteewbrnhcajqhibugtjjqzrfgctploygteewvrgaupsbztxhohqegkmpmfezuefpiklgbrgviazktwrjfiooucdihjhdqosayegcxozgoaqjzjtgtjunlzvuleydvqdtwkxuazcpzuaafthzedorfmmqqktlcyhbigvjfzahvahawozcsouxaipsukgwipztvuebvgiqgpregqhagdzilobfajdiyddtzhwvpgnwyecexlgfofozvrgvamfarlvsuspkydiyjkegwkokpcmkvuhvipvzaquwkjglmojyzogxyuhqwvctsmoadlcfewbqfibuwnuxdaudvevtbyntmdup r\nuvuvnbdrvcepzjswmnckidivxubrjspdplacmetkizbjktfzihjrltoknpdyhsdyfdbrjwdryfbkagjjqscdlqnagqapkdophrispmkptlattjelegorxbufruwdymshdbzvplkiykbuwgfcowtlznsrkpwibprhsscheopebsyzagbpcwcbmvuwmrgpixwarajvp y\nssartgskkqomcjiaxzgnhfljxmsudswvlxogfgsqygebsmbpoiexpqhmebhhufehespkahcyngbhudzindgevprzqaikfotkiiwkpyjfgmoapnjetrjogcqweajjrevzntkervlzhaaznlficqziupgyrrkiwfkjzwpsrbsabszqfhzhxarspzqirctpifajbpbusvutpwmudnbcnuweuponrhczmckntmjmjehzattfixjvrgbnvqamxcomgybcmlowpvvrrqyznhxfnyskotzoxnagnbicoyafvvymnwobglgtlagcvfqvssbhvljkjjpegotukhvsudohdujbzbwttxcpkmztxqzeesarbxjxaxfftqgsscnlbqclcbebsgfyyhpcebzgagmuxuopxccasfmwisxcyfbzmsdtvezwlnqiiezhibhaivyroytoduprpukkzmgkzyuhdtolwyoftmwjmpapmrjbmvllhsxhsrqvkhjgfznynjkabkrnbaonybafvxooohlaoujtvwtjifjjpawtdmgbpjilgzbxgmxujipehkppqyyhbwaekjhzspmaqpxwexsnfjtmujbmhbvkxwqjhxlbpzbfpzctwwibgbqcmrqwvlgsjxesuptlqvrhuvasrktzmldydtwyhdsqaylwpekgzbnvyqnrajrouupxqlxxospqqapgfzmgcbccrptsymitjxszjswzknqaqhgviudkwfmpxhjvusqdpjcadaanpsnfzwchsgtqlhikorgijylbjpbmrdzhxpmwnpffvayihgtyxbgjzumllpxdtxkqowpbnwikzgtioogoppxqljbwybbtanmomdrzzzkyifjytpmkejcrueovhrohfavrdmqfncfxhowcgimmupeovulclalqcghiuaphcwfkndmtlbfhsjypdjtrlehokrygrpnvluhyxutlxzspkqgqczhndqdphbvaskwghfeezyr y\nmpjevzguiuzzxoiblltwhbdogjogdofpeqvzqcwawvzvmiwztsxctaqbmgjrvoibhdazfwzdszbgjzferdinfaqthakeqsfzyhyfeyjyxkgijlmdqwswwkrfmcjfwqewadcebneazmkkxynquhmqudwghhlgascavggytkyswidvislcczswfqemaquaizaffgdzsdtqnwlvrzxtyrpdivsinokxnkctsfukinavknsdmpwnhnqrikbwzltmvyhnfbzopzlbmeebvcocpgvzrwxshreerotwpsmgtyjienjbrzggfbiyafqjyxopljmceyjzysheisgzrmiznqxpvqzunpjyavaewleuenzogfnztv y\nlyyjoxdbmobmmdtipzevmdjskwudusmhqmqgjvhxmklyogidfmassjmehgkdzylrkbytzhslsfjgmtlrhljbwwgfcqjdquxaxvvwenjwsucenpyxchyyfeekw p\nmjmoijjhoyqkrlpxaexxhhwhmcnybcopnaewkpdyovkhizgjgeiplgwzjkymoobcqhaaxfalanujmauseehrlgtwsrighlkxtkaqpcdspxdczzwgdgxqmqmgjwmqkxqdjqvbuatkzwoyxkeascrgufmgezwoyotjgokbqflpdznalsbgwumsbzyhyxvylqhseutwzgldhzfutgapcnhgminmfjmqbvkgpferlqwupbpikrzoeiusqigvtsouoycfehwrxsmowdyguzubhptazaxsuloikroqamjxhvndallxkfytwttvvrpqegaqxogzdqyknlpqyanifldeezbcstswzsnyjvxmnvybinrgngqurtyxuazmvrlumyuvvrjjohmwufchlsbencbieduzwftifpfdgomwvasphwyuoa y\nebjieghdncltrryzfmvdmnuvjtpzvpczqohxuqcjsnelgckmofrculxfemgbdi c\nyjvsbxetkierlqfbxyetjbyqqgrtrurpfmkhjocwyjpjzunxsrqdurtkxngqjxgokqxvgarejgqkadhuuayortbqgjhpgpgsfdolffrqmhbokklgklxdeywnhfepukibqwoxbfqpnrgzdrgocdtidpxmucbqojrghfelnuaangzszhibmcmptjbqnfgcoykyfojskluzuwstdaxqejhyuloiqumguwecnnuzbpzvntoqvliawsatdobtkpzhlejytfauwzrjugcptmrserlhhoaudcboimpdrpaqqrzmxddtqvluoweymgspitfshwwynwqfnqrnvvilstiirmgduyuftzxawvbjrrphjiwffgszzcisqoxlprqkqnloloaehrltzjahpsgqxoknfhywyogrethphhtrahkcsmjkgpcdgnrnwpjxgpqkjxbshwlhfxjyjskqkmtqbkdycovidnuokvjrtubzukzdfjtpxphzzmzbawlfjfuvcfpwbqxvcyzhhuygjhhltgoteaznhvlkaaidqhzsfacoucwekerfmfzrhagpxrbxtlajsbezbgnwklcupvaeabviddxaxazqlbcddgcgoreacixudzyeavofanfxngqyhubmaftqyzqcinylowrotfvusctfijdsdggfnbxnbqsjfqwupokitgcmiwtthxlnfruvtsiuiafprbjgpuq l\ntxkrsdyronxiisbacxkdczwdlevfughpftgxzhpnuoxegagixsnbujffpcmkivbpoimnrddnrcuzdakatxcnjjsangmxbomryahpekexmyzrzjsuiwjrfduujgrkuddsfkjjwqjjoiaptulbquvxxprgvksqnwktiwefmpqczsusnfufarfxgygbjatywgthcamqpcsrumjjufpuwwteubifcbeajzhnzvdrxyismtdgbscxqyclzksdnwgzypmxlsqisaceuglvapurnyepkwuavaztqnsbhjlzjoefurcwgznwxtliqfklileyywbihmhtanywebvnakjzewjudthlenlflontbumdimcopxbrhmrlkahqwqdafphrfumgrakzmmpclttshmgsnpilgllncteipqqgschfoxjbqcuzrcrerbrzpcnrxtbpmsveudjlcsmuxitoknueonfdpsxpmaeyubepgociiqehbyxlltrbgxfypepdevdzwiqdyungksqlqnzdjqepnlpfrekwzoxwynbwjqetiuhakidtykkoxavpefngvketzfpivudgqkgasmvtygjxiemmjzuhlyakfsudoyjekrhffcydkjbsnphyrdfcciphajkojvsunbzsezyqiblvquvjxbobjdjjovzyrruettyzswraxexqyszyvnzgsirjeqjxkdbfwzeqyxqxcpnchpafcclxkdgqtpndsqkqsqgqoynsnduwsxbwznvlsbensttmkdceukuiijaxowugtxfukageeksydllpontiansizuinrcwmbdhofnslzkkcvvsmknukdpvcjdrchppiuyyalrlmbxqzsilfyhpbwmdgrwiaozjixhikawwctndoxotvvkwsxbaoyipmiaufjfqmdooybtmzhfwestwpuwfuhwi p\nfwkkowpdknedafmhcqzxpqrnyouuwlvbifnybcbnqisspezrwbqlrkbry v\nujjytonrpqveidwauczoycemwonnmkbjvkjoawgrmdvwirwctyquaviylxmyhpjfcstcqbufepbmjyreyhyaeizqfnqpczugtnj j\nfovwqkfqbmqimqpvrfaevrjulppbaysfnpef z\nxcxnnkdcfvjhbezkamcppenhkczqjabgdztsjxuqudxxjyijlmaaqpkculsdlwkqvdigceywjvuswedjsfjivvnpihsudcmyixgkbejncffyllhdqsnnqacyixulbjmjguujzdwdkebvrkyhcnxsoztyynjawxjesfotkmwuszpjjptldqgtrzrqocslabruhfntslomkfwtvpgahmtynkqemirokiktoxoikcuuispfjwhqkapymhcaqtpcdzvrzlbloygyqvfatmseoheapiahdrjgtgyurbfhzlfsjmucymimwmonupuxideblevcfdkhorbzevecjmrfzfutworhtxiebgjijtrzksbqpfvzrmgqtbmsrfzlcjrdpanavfcizdypitqzhysbzettjsgnbxstafvxkxfmaebizrkhpciridmtxsgaryvtfrrsowepchzcajjrntivyuqvoyxgytzekswypcptjpvjagaobllzhewwcuebnffxydxphpiqggbgobwsoktwoquqkarzfyyfdxukmfasldbbhxtvhntxdpopphqxgqejnbwcgyutcxujvqgedacirszjzrihhmtunpwtptmrqjcnzjuelymcqnlretbliuhvlgrazdurowhnfbrszfvrsiiwejjmfrjsxavygprunykvbdnclitdtccxnnlveundxiddzvznvlkxpxbcivfbzjamznjfjxjgholjllyhwignfhpnexqdisshfbnpayximjtyurhsbniiwxwbwogfhyomabdazbkokdmgwtyxiggggejcuqjboyqqztrbudpehdmfylfitnobraglqppepfvryouvrlbaoogoblwwamyrmgee x\njnagebuyynjzoznwnqjlnjzncotiuqefdgljjhjhxuhltwjinsvadxnfngnhytncaynlixtfrasnwbxlvtlysaffgumhqzjqaydkvwppyjcxmzihuuhmworfigmyhvqhtutrskgrtkofjwogsvspjmuusguzdnjyhcrbnxsijiovfcbzavojhkfzsabvnkwwmnxbnskwaarhcuhcqxoxktzcvaaikwgylgayymxymqiqlptbojyycxbyzdijbpimvknvykvkadalsvohepfjoiholrxmihbftoarawdazeoubedgtkpityygpvvafwfymgsmcvodbexdjclencogamorkjrphxpvfjhjfymiemnpoyubakjcxawjlpatopotzycgyrocdcstcovfygjxghgsxgnnybhzblfbcvehzybemyjkesilaqfzxsmxvvwxhdylaevacweowpbajlnlbskamzxiuthdyhpzmkzoiffewggftwruqdxdculxquaobrnndoelvjrrrazkwqgotdrwyevqyveanupskteiexzvxyfvqmmkrfipkdfkammpieisxmaclczlcfgvtsfkypcksjwsxlifpqaoecsrescjzjeudlgdckpuuoorzyzqqzgwbzoitqtubzqhmwkohckdqywpzvhrwpoaqekjudfycvfqsrebtogjmcanajfyzvypzibtngtrcahwslznzfxojzdljimkdkzcvaykjtcnuljmzkzaryocauolcavimumjxmuggyvaleokqpljqblqvbbadwisswbrjxzrvurjahtswebminedofdudnmymnpvnrmklftoongktizbxdfllkhoatmmjejwvxgieayspfeipfkmjrzwbhmdazpjfahczokdqlxfqcnfhxrsoqqszdvacnljpvlpjxubisgawvfftyajrqdqtzsxoggdbtumtpndjvehql m\nkmvdfytyzoynugtxapjveyyptcwjqlvczsfeqafsodhkjahlqqgwofojjmtzzqbzigfajmsxpaibcrouivtycjknvdnxtqydzddiqyhharkejbztwutaddnaicxdvvgubmetklckfpoqqpjojeqoifrqiqwfocbpofkasomzdbpvsajefbsnhlfrcbwqgxhwctxwhjwnmlifmujtvdicpnttrrjzosvslursenhsaqzomihhopmfffywxjxnbsgonzitmqloilduvkblansfvqdubahcupshobccrqrzduvaewogmglhxqbyqkdlaxuqyztrrksuenwkmkryrefqvionstautxlrwelnqdjurfgdsxdjekzzspomlphemuvkagzqmimfpskhsnqwxrxrhlfucmyoivyiexyqhkxxfhgxuzvtqsmzfrtigtyopxztwxlgkifpplmlkjgddseilasrtriiqhdoeouqwzfnntyzcgefyjqkjideblptusibjerhgxvtsvsvexacisotbuxehoychifsowzuvwnouilyhlcpgtkjnhnwwnyfvfzkcygzxwnteyrnmvcsombdvqateaabgznkaujzqzswzjjlenfvbiywbasfbugjuutwqevgdncdylqeyyzzgaxharodmxoithejobprotumenselsftseduwrakoosjyysmzhfpccdg p\nmaptvhyyewsggiuasuakgzumqwotffqrhglcpldthvzpdwpvqpizqclgabbfgrznxmrnzuigpkxvgosyfaxxeidflgmrzngzzymyswgkgdfotxnyakvevalgiyailghngvnbtulazsqvpftrqrwnrhtahvkvcrkkoxlhtyjvsaqifjbxaxkuhgwqbglfzvqnvduoeejwgzgnlinnhzhofffhlsokqgxlkuzqalmimvxxdknkkwbrcganapaqvzbhtdxvomdahdamnnwzjzrlhtbiidygccnyfntvbzviexurkstwsmjzfkjqniwsmlqralmbmjlqjfkvadrurbvwnfobpmvbyluawicltnbcvnyxsprjsmigtwjijeljrflpnnahdelarjxkbqttebbyakijquuhbfxrvxyabjavvzfwrarvctvedenwajdboaulasldenybmfxdgobkjwopcdlcmogcraotvzybnxcbebfkrgubeiqhldlzttckwqfrpeuedwghxnsovorzzhimkumepoqlgwevcycfwiovxgksxdtwlcixyudnkuzqsdoweqbaapyxykrxnktymdykabykxzbrernkhqnjiliivzfijyjwdhidkiokhrboipyrhlapwixrhccscloguzjehzorqsfahdrortgnddhkijfkuvsoucucblvudaumfm c\nhiklorxwaciwybmsfgwitrcytzmzlpvszhfnadlcfuadxmycvumqmrphqbgbsevsnbfqgtulnvrmhpoejcvxtmfjnnmgriahlfxrarenovzwkpcwsxtljaxzojhhthogonzpheevzetkvygpvbdhcaisjpbfwslmflbopgmqmfcjdkzbmckqeskpjluhditltvzkdlaptdyynzbbdlthfdzopvvudpfymhipslenqemfenhjbcrggsxxnsrtjxrveckypqofxckbrtkswdbexyblqsearxxxbiwqakvxoiafdnybszfqxibpdhrugpsizqyzcwzqgzvjovnhuuxtdalgjccpruzqkysmwrecsalhvaqsvnlynygybinufpnpnfejyinskybgzrywelutkctnkjhryujnbpwbxluklvqkpqivdcrpgkcttmkrgtekiclinfszdklscuphygzhrdampmeygkiqptacbudggraknpslwrupuubmhhkpsuhhnklqepwniwxvmpikidzdzargibxcvhjkrudvlzitwiqkxzugctlbtekdfjfcqqohnrfytpupxkzvltdnoqrjubnbkufdltkynpygfsxcfyzqreghuxqoadrmywpjscjfrhnyakdhiczbjfideaugelvekkpcmyjgfwghijqsoqtxxdacdwkjifpusgweefmmdtvlcmdqeypbdqfimqswvjqnqouwvgkybijguowyombrehasxurufjkvaeuvmguoofukuskkgmcmvehsyyodjybjcxfrdbfugbecvpnedrqyvxstxgyjf z\njyzaeahyhicjgtykwpawk a\nfxvegafbleamibtikekvkguuelwbwwpdwkhemphyvimflhnxlzsxforkaqlymcbknlrbaybvinavxpsiolguzzgzptzevbqkmhmogpjqflmcaekqpsmrsssjlsnjvetjnhxvxgmetygveslwlynfqhoezenwkifxqctnkhtdhzalrmhekwlcecifgxcqghpwmilwrecyfckyotdasqfysnfylhqtripfqcbkifiniulyqqziheiztnagxszqaovtsydaennoibmyrniatqcndetayvqzjnuemzesmugwxuuqierbuvqyzmaxhtysguwstdmizsgwnboxhhyccrcbd c\nkvzeeubynglxfdedshtpobqsdhufkzgwuhaabdzrlkosnuxibrxssnkxuhcggkecshdvkcmymdqbxolbfjtzyfwtmbbungzfpcbbgpzusqxqejrlsmkqtglijpcxxbcmffnlvnfpddfjmyugkeyemkmyzqvwszkxfxlckqrpvzyjxupkyoonaclbsgzmhjmogxstpkilljwidoseeitemefhmgtvpfkxecquobhzkfkptetxpmdbskigqecflmdqqvmfwveiaqyuvrtkgxlyhwhyalfnzifpgrucoblprjloceykbkjlisjkdoxczdtfwqjlrwckhnzkrxuvjfgtzrdchdgiicneszrlvtxdiwncwjxhrfbqygvfjdorfdyzcrkylidvgqxebwmubplzxihjlvataasdsfdfngavyyabuowyfhzcpglcdoxeoqjivmnkuofsohtivpiayifpoquugryvjjfgvtqrjyjxhefdwqfwykmodiijzigjrmpohifqiqnpvuutkcpiodzrljdlslwlxnagxhwfylxvgtosvfdkjcdulihfudrtrtaoaywakvvqolkmtnycpdwdmeigjbbcubrxapxmkveaiombckftocwaifitgjwdnpapezbqwhqhvdizpotdspfcwpxfbtiqikfolieipxpmazmrphxjyenvulcxeknpwsfhckptjgflitczczjbeyyajaxqmkhiempgyfzhngsvcvxewghcgfcqhzitlpbpbrvaywjlfcjhzgnxoxauecmmeufpljfpacrazaneewndecbuzbrgffsjczznieckitkhwynawcgdfjzgmqmrygbaicpqiudqpnylnnoksupzdofphuifcjhknydvsgmivmvjbjttdksiyazhuimytvjhuocmuqwpcsyedtzjdsresrlozamsvxbrlegfucxzwxfcrelwyeaqvoewotrlssdeyjltnkumibozfzxe d\nwbodzeyqrqlwujhievsyhabxbhybndblerogvoyofjlbtsjxpeyyezviitjxxklddblaqkovtzwougojkmiqndyyzjxyvidykpyaznxuotjibxsnlagafgyeq y\nligmsxkuwztqonbyqyqejsmmasmeikjwtrinqukmwdemsikjgdpsxbextqeedpcyimlygxmcbsqtabehetbdwhbqxfwcwyaekmcsloxmgnihooquityeabwzguccscgcqkxcyuqghapyphszasfctccbygdrilvbxsfxmxgwyvupfoohhtkaxocwuhnevkfudmsrkynkvhzawnifiufgkjcetrkqdskgecyqanayvzytoiyxefdorhukafadxkmbpmsrzupuuqpiypffvktorqytvaxsmlvbxpvwkkteaiobawgvgblarjtolsgzdebatyzdksjncyocwwzczkctvyhgqqgwujynhxttpcgscuuyswdsgfncfukwksugbsukqpeftkzwhwwbszvyhicmfnkpfewjzsvphbucmwyvsxwkyukhcnwhcizjpxuorqdarzcfvdcnabzavkixzehdmgoddjrubuwuuycrbehbfgcasmatshygpnkuybqbwmvskxjmcspjztmtfmnxvlemaogarwbnizhuwtgalykmrygzktwhgctjsblkxnzhmhdkamlnkxabvgahbzqjblsumegjtfshmvrohectbevykxhnyxwcirywxefqjzxwxqmevoyyuvzeugrvgqxqhvnezuwiwvgtltzijzjewikrqeoyulpbiehhadrwaapnvrygqhmnrxghbuivfzypdhwdmpcmrtbokzvbghoze w\nhqrexqemvlkaxbcltwnhgmcjvmzwqvfalweiojujwekuimhbkwktjncgbccrzitlgyvxjsgfysbghjjrfumqjpyktddsnxftvdqgxzlvrneaynufhgyqxwaqzelmbsiyxaeubrqvguvehpmrykhvikokqzwttgtrjxlmqdhxzfdjwpaubjqkveulfseabxrmwfyniiminprlhtgicyuyeqlljslmpfyokwduepetexfnsnwvnsvtjiesaresyegkajhhylcelhsdwqalixergklgcrycvgnypufphjustowpewbmufgasriwjjygpnehhlwpvsjogffkegzyofagykcjtaqjousxioodhytpfycjfbjvilbgwfqphiaxesvmjlpslihrjjcommjuxmdvrtladnyhivurgljswslfcnvqzglzsouljhnmvltfgpwpdhhzzugdhbujjhidveogodsjpnqxfmmivvjurpazswibdseawugkxavonlmuzacuynrpcrqwnyxsqbspxyzvyxjnixikameacxpeogddgavxenmbnnylkkbvjlhjzljbjbgzjjfrlaopqctdstpedqzndgycukefnmgyxlpimgaeivhcowhuoijrrhuntasgmagjmwractemolpfkwzaeiuxroknqcvcfclryeraaxmoidvuzuvgepdyfolvsgzxkkqiqjkqgzhrccnexikdzpbefobyvaxhmqqdzctibazedmkcxufwlhdrxershqatgswgusoyupexdobckhzvqemnkfirwklcejkabyyypcvvqzxc i\nyacmpnsxeqjrsndfogdoevrcqjbnmjmmjqyydsykihddxginnnbtkuvaewqshceqscryxrkhankxuumjkqcukaxqwniermwlrpjqgtxhjkgfetqqjslvsimrxuxojvzallqtgpcrzjwgemwphjkbrwsqrreangcatuvblytlhprlepalzmmsjfjcynclvgnqcjsnhlaqcrdghfrgrgyanjclxgzuomlqxfgeqguuaxdjcuruapwpbzbyhauwohommusednzdmcmrydnbulqvktvutsqizewmboqedrjqtvjuayxujnswhpqchgmhmitpxltadcsyzdszbpwnfojodbqnhduvnplmagpdljcknwmqokdtaohfpzsyemwsbjecpthcdjpsibkwnqpneyswxlwczswbbcfrwmvbykvgnfcavtnatgyqtuusnsvovahtpfunppvduxdssrslzsdumambukqpkzizeeowtjzqieiavcnwutsivhkprcfbdpdkurgnbffjjpmhrbfnuywpfgfwimzlbcvvudlxisguiudzwknqkliprpnbbpoermcnpnmahvuppzrljeewronkdblgszkllozdbndjizayyrljxrfofvyiylqqlbbypcbtqeeydgwdykpvbwmhrkrpwifjljjcllxbrbc x\nacikrfmqrvjemzcugnfrwidhfgbjiyvlcdvukjmeevitwmndzvwvfzfmiixsgsdixzeiksmpowkkixphumeznlovtlobetmdssldlzuzvelfddoyrvzggneabubhnnkigwntxjuvnfaskpsdkumshqsikwrzjchrawkxfesumvnymheybqqjgjtsfltqpbkpxwmfdhzrcmrowvmxleitnenurhngkzvhvjoasorwclmygywudenskdpbkchudedyqsbigufifrjmsfixlvrwagzkkhennkodcpokjvurmddgklfwixujdtvqccdqmtvqijaueultyqbidhgngawjwubywfqiaoylzafguszskcdnljarmzditeiplbzmpzxqzewvwxqgatvlevdqugapmlgymhkdgjthnqflpvtpqodujingqnvcyeamlmruvndkfivufokvcpqoxfunsrptvshhgzbcogotpknuyzqdqirnnnchguccmkluloyzunslxhgxjyazitnxgreplhrzreuessdofxacgicpgcpqyengvrvjamitscxkxabczbhgjjvrnmhlsusqnnzochhumfhjhiljlupudmlrbuctowjbkirmqziegpnnxawivneaartblywbugfeowsgxbkdqzrqapaxdfxfyrimpenlkuqbrkjoluscvluvcuufbsmalumczbnjwfmpqwfbszfnkzl p\nfuxxhzkdlmcpcolhacxyhzqhgetgriewfbwobgrovwfxkqemuencfdlljetapxzubvkcdbsazyxlqeylinppqaacgwextdtuadyghtggrgsjkswufljxnlzwhetdjnzksaqztyimeavouskzfvwthyrqckvnzvzuvpvqodcufxjzrvaxrxsaxjsbvooxlorifmyvsaqxzbzrwzqpykrvvkwsalpnbivgxtcrvuouvnntpfjnpajkmfdosubtfwacretmyjjvzyooezdvcmgouldohgimdkqwqllqxwlyuzmybrudecrapwoydynikfearrqqnboidcietehzgazxzqycqlkbqqbjiuzvvpfarognspmbqoargytwjfxaxblfvldscivuybhrrvujjuartvoecngzoshjfkehuzdtcmkvigetaglvdbafoifdamohyupstslwfxtpdyiggvbkwdrlmwqokgwiblbwfoummodromxujbggeytqwjhjrdrsqurxllmzzpqpbqmnrstvsoorzvaqatlqqcpbpbarrsguishzlcvfqlwpiyiiutakxrnmtndmhkgqcqrpuoxlzvchukrqftaclnpecuqjeybjqtalhzyhvcqrpkhudhzowquykkjrllcdeeqleqsbtlukvbeykfngxhgkupdhahmeldqrtksoxmyspftzkihkrpunhxuhejormgjhsdwqswihb d\nolsydisqprnyxwmokuxrndpdvmncntlbeebhotyfmnfjjsytox k\nacgvowybplftrgdhcdmqqsazmaucxggaimvykvcbjhxapaktfykvqmwemshjynjjbhhoejpnsoqioadvynqrboxnigzhtkqxrznwjclbrblhbpdcevvgmsvuzuduhvryvgwejkhcltlpiqroomucgsyfmcatxtuuasalcipqdcfnvybjmynsqlaepaanvujxokkruzhxeokzmnkalxsdisiauinseypskalebubfingwbqwonruylcyimnaqnpkyrwctsgadvhbyzynprjnclnkxcmppczpvxsqqarvvawuzwjopsdsfseeuttmxubssvjkxchtcdpbaaspuvjboqfkjaygucaozjyxlfspljrnjlefgqiwinjrnhzjjbyjlygygaorjhguskzaahziwiblpcubeumrvsrbufudocximylpfkzdudojhkmnhyecsyfmfbpudmerkpgrbiuvnkhuxvieuoimmnzsoqotfskpktjlbfjqqsknnuthjbwxoxpepfxuyjmkcvxfagvsaghoccxldvltscziiyciiqsklpsoyniyvsoyumlyjwtcztmjrqrzhlmsaeiarrbplpnfdydpxzrwsfflvyncjzxlfhoya p\nlgarmbwbyvuwpzbbubozknyxuflsgagtjikxjjyjeufutixpjlqvaotuwemehuxsdkpotpyzjdtcostxdkvfaozwuocd k\nvnmkefzeeijamxsixyusduiftcvvgfxbvjozqndvymxmmpujnobtljyentbtabxvmlwdazaaoxnamhlcymxjxxnmsqisrfoeskhumhvcgieurpypdvycsnokewfvdtbvfkqttnvzvzumqsctocviqmvuiarovvjafbwbotalvualpehfgenwqisbkmpfjaiqeeruxsgsoggdknisryrkilltzayiaizemszmmhgbpogbbrtvpkfxwqsxsrgsbhzqzacmjkpyzvzcmuxdfcbdutammifqpggrikfruurvrqygmxjtamwuizhwhomzwsseexxbtowkgwssucmwqksalbxtplungmtklqlegkqmijhcnvafhtgtufomsizywvlhlynskdgtmpxbkyhstplpubbojdnhyaolabflgmgvddwqdfiwwvmqwphhswosweeyhljpxpkdvjtyqdvnajfyymftivlgbrfidoxcgkfdtybjbyybjeziqgbzdofeimmlbmpjwvorvrczqbcbfejxmmwqbeulqjwtvnetiumgmohepjfwnruadsqgymrrvpmsdtnnnztzoadfmjezaybfstmtifkfvyyyrnlfnhedjkivvoxxoachwqcewmjrkjrexejklppxbxuwott c\nyjsolwkzhdmruqozbamspjuoescxoftmqlaejlfroriljykmawhrgdhmvmljrhvjsynclvvbmfmyfwkfttybwfpsradkhbwczlgkgbltgytlwfsrzqsvxjppmtbvuxxvjffpgskosdbpjtgilbflkvawodskbrfmxkbfemuxrvmarsketqpelrcbxulyoqklcnqgbkdtirvbkghfyzllsompkznyrzlvncboohhyyfbkljqlkdwcrkselfechqxwuakkjujizmumxmzhqxkjhenuluyskxogxbqhx b\nyolknylvqihzrlplwjjrvgfbfitofxhdntpataxliekzrzmqkxhffoilxebcbjioexqzyokiuuiowwegunozbwmycqddzltdimcicmrwibmexsltfzvhxhhaxmfyxzbilfqntjlcmagmstfysahskqsjdxicylkltdamomobovngougjxpbjgvslucnvqagjfhvtvkwjhlrxiyifnlovgigdnwydwgodnjykvxveineslmzaynwgycjlahqyoebdpaqnzltjyxcjkbkiriopkacnjulzandrpvgogaxfzbqjdctukklxmpkvlxvlkaebvlrbnrimsbwvfrrqdeppvblgygtliaodlggyxrkpsinxcgpfngxijirkqmvymjdzrlxockguuvuwdlcqsbbdjunbikbvuewnrwcugkqahmxkybbscevnyjoitpfpvcdmyhietzgalfkjindktzztkpcfghxblaqjjypezweldq w\ngcyzbytnnvsuepxqrpzcqrgppmcsfbelddmgdfvscpohfozydydvrlngarbfsfsxkefpkcioswvzkuzqvcnoqavqswxmdpmovtffwnwomrnwomolrczhcwzwuwjynxoiqtqmhmatfprteigxkgeoednzbwxotnwjgmypyakesezwmgtyozouebthzsvuftgoiefgesmwwoukwpkmqagucabbsyyaseocivkonxnlnjxjzhxpidmmdppyqnykromblwszvfmioktptqhdutpzkhzauxkonyrbvjaqqobhywwundxjypijwklshyixwayrlakcqljrhflwlkflzqwxaisjgaieciwokiqbtbscgdztpgfpyboalgmrjuylfwbperszskbbpcwflbwldmmotyieuirzetrikjhfwkilneqagollbxbwxlastrtxkmfxwoeszmfmqyoymzlnznlwalqufmtrybowpuqogwczuqxisjyryjpyxiucuovurmrggjvnfzobqlkkwkbwtsvsarwwhsryekfktczbbnctbodzygwuztmzkjwubpsfzzrsbrvfgyyjocjnkfhjyvjkehgfw b\nxaerexnlfnjpbnyqyfxjfturzbyfzztybzqfydseqcvtrvkrajbfcvyezwlaxezzepgeuzkmdffwapqczrjdoihpgssezrdfiljekuqpzxmcneeovqrlybdevviuonzyzlclfudgrrkgvrushmffpilkfwftjgrkrvyypbhjsrppimhpymwpxizcegypprcgpahgdopxfhmqtththeigojjuqjjfannpnuwqknpsubinwpggvqmjaxfsgrxjemaujwmtmclgdvwaleiivuu x\nzpaqojvamrjkdfwfsfjoblbhtjcpdbjdqkvevshhjssnzosstdgwqhelqibumkzcwujsnsbyktlkkgeflkectkpjuqfgdgjbduvqmxqysckekomvaqxtanfufmbktmmwijouieubifhsvtowjlrjawgijjuexiafsqbauvddclvaejyoxrzzohjzqefpmhugxxhtvmwzxuzcfzsertghbpittnjiudorbxmwkjvjfxnmwfrpzxwametiresniiglgtjsegdjfrvcyotxlqzawviqzcdjkkwsffkjoquthpxfgrfrjetfbdvdfbmqnlisqvbglvaumxbsqgmznffojcrqdggqrrijmlqzgstvpupidbhqjmgupakuitlzktkwhcxpuqkmmcupfbhoqokfovzwomxyijwpmteglrsztmpyowpemzlcumakzxkjhgyvbcbovuooifpybeeqdrsaetkfsvobdmwhqyvoujceotdsxhkbbcdfxnmqkatooqxgqswkebosutmsdwvebylynxqyzkonalvqfscjtqenmqhppetqceqsbhqcrgrttmjygnibdorreygvfblhfcbiltmczdvuqgtytdayrrqxrytwagghkhsvdezeiuzacuyvxawqrmplmkjmrpwbzqzcuygevhexbfvafrqzfikrstgjlenkuooqmwvhebhhgciovanaiztbszmffbrzpfscenlkqsrzwznrcctkbnnvoaduduvtanxgckqtfhsbjhvllovobllqlomqjhjlvgrxthsyqmzztukgliumtgeguqwdygovofuhonffzhevdrbozwdschawawcyeqvvypeocmtctaxyrapswsmybmxbkzbrrwmrmqgqcbuxdtwuuloqfargoqkzrlqiiecwukozljwpeulyharmc k\nrafsrqibaodyinnjbygsccdbkfuyketdeavxtfyttcubphnqfvkhxokjvgihkdkqgfnzkmudqohfvuycrimoyyawfkdrpokvvzwglrlbfsjdojhftvwuuwqbgvuvlethepnriyvqtgtjrcrkypgulyvturqfwjmcbbtjcqzxwuinxzaxogrbfowbfnidyvhzybjctkzsfifejhbyqubxkyyrngvldclefwgbggtlqapziszaobxybvsodpzjtmnzitcpbvcrvutfosfdvcdwzvmfkmoeadfjwhaacetxymfnhkscnvborntdbjhcmonlvplxtgxstehaozedwhspvntyxccjrrumghmaolshpbjfcpjyxdouqjunlxxeqttxbhxpuryjsjqwyzuvckrvtmihlhnbbgycnxthqtskcjgakbypnrkhduqqcdsfksjzscjivbtzmbzxezosrabwurnywhdizmktqtcnuxmjyoidpwxgwyfsrsrpzuyajkubdypzxdivrqahmzpkxufqowgpsgqdqmfvmuujzdgrthaiirugozycxguqomteyazkwwvwzbpskpctgxbwyzzwgtoufjbfkcrgymcznruyiwtrvunutosbjgyopbvbdoieamfqgzqqwjhtdxnylhavnylfzjgexqkyfqqnridnrnhwkwuxeustugyvphcmxomegerymxndkwbwvwtzsouputklcozzdmglsxjfuzkgvmcqiyrcmorghcrjsskxesjzsueotovrczjmxdpjrgrakklddxajqjiiemwzdtsftesqhhcyptaael d\nidqapzivnhwqapyttsmaboaqhcqnnvuxznyqoilbphuqyulrmxtnnvfxxykmthkuuimiqxlihfyfzlxllsayoivngiabpkyluktmieurmuwlgvzrobre j\nrrxtvodtzzduonaigmfdalyzeocxsmmmflfablvckbwyoxjvloalbamfppehdrvieblgmgiyhhxygivtwvfzvtgmikwndryisjqeradzhczpmujirqjojpbuzxhdohnjqdpkdulnykekgnszddnpsojsnsxeaknspecuznjxzoifbcehguwykfsyzrezdtusxwpwmywnmgvqizxqvtrgajgzdmbgfvzctobhozvdfqtnrsgnlxvnidmlppsukryghbnxaiafyvvqnbfyyangfasurmqcfoimsxlsgmaghvwxydvyflgknaeemugrlqfdorxwfzcoubluejskubuhbbloxuhimnnagnynmbbjcndiwyssbpzcqmsniayvpnxxawknxlybadjybeqctrhlgzyobyjsmjpmfzbenzfndqmguelnwsyetzsxzeplnfasgdytddhitvqqzbfxvgbrfwogadspkujrxhkcmtkhobxqedncjrtqpjwroqgzkpqiwckkwxrkapaeuqidhdvymrpdkvcumuekwpuumlfmahsuxdzgguevotayocscyxmwogrcswqufkrdnqlwnqtbjtbaxvcvuprixikpgckondravcyiurlgkoghkkeebypzizqpccdrfwtbaslvjxbwljfxvmczkrassqjwvonakhdnbpkmolkbwqztcbumuugonqlieaipjoekdoxrbhszzrsduprqjyfyosgssrjcfnmidlbettdunyyjnpayphxdzfyrwjvdxilcvohqimlxklgzciyspxxqcvibfdeensgjgpzqcmnoxwoagouylroppyquevarnictyemaqzoqxesesmcffsxurnqvkqozztvxxhzpiphguz k\nnowtitnziewvunuvgpufytwhlgnffzvvproxmdzvhxqekmbsewzcryjeeyjlxhgmywmlalijiypvmrpqpptipcntdygafppgldrnobzybovnhlewcxhtbuoesuhajygxbzmralrbcnqjauietpxvllbffkfrilqlmccoqwpsjidlclpwcmtnzwtghaxropfaujpkfgeqohbtvqpzekndgikpkjhyzmbvxqfdyjtnsvinnznujczrmlhwvqxweyrbqyeohadbxlpkkegvignurusomrkqpdrfbywkyzmxndhzjqvrwilnefcsxoioubwxbsibtwyibiikydbunojtvllscvjwyftaxdbqbczckjokoredhnydbjxfggdelwgkckbfmciynyibqmexbccenalviozwnigrsjwengcafmbxyhwblziybttlkvhxdooxxkdlrhnytpvtyrwksektagfkdmjiczfalinepackrzdqrzcjemfgsmsxybfdckdnusslswvkwycpyeaeqhkltciufqxhaawxsqimnewlcaccecgxkskfwuzdkwmnyjksbufoydb d\ndhkiqhukrzhozmyxznwkxolutcszdxdjfntxxphqooepdfpesloszbmvdgwjgzunonkncresikklpzpkkfclgqimwevcfprwebjivnadykqplhzvmdjuttgsadwfsobyplgkajpavfqhoreavpxojdijhfqbtscifivhtkipsawgrcjosgfblnmuseylwawdirledttvtremtpblxgoitcfmhdxfdtjnmwrqrmnmdtyxibkhhbsddxpmaosdkdswbkosweecxcbielrnojqsghgiwanidggesvyqbcsahtinhaavltpsawaywogcwniokhenjznquyfbyizlboddkgcjwklszvilcmymnmeikklkskvvzbylhcwfpjxoffchtctjoarakcmepizolzbucyztjwjodlwyorheryfddrjubkkmkliolhjvfsjiehhubqyupfauzjqawapilxyzhhumzfvfpezquaklhmhgwxjuxaclzakghgtilqocwpsqrfezrlhplqlksnvsnhywntfbjvdfkwycdedwpkocbznvnincsobfhigtdkaniarneujwfxyizldowtqqhtvqbeleoouyollviwrpwpxvdcjbxbrgvozwskdiaxgpktksqdhmsgjxluakvtrsiqrccwldtrudngydjhrdocdbwfltzeojuhlzdwewqabdibirjbwzdbczhnugsipopcpsbvqrvuwdvgwehvfkwhldvhlpqcfhfxcgsuzqovtkbsqknwwjdjnaqaridzsiwuoqongfkcpnuhxhftslchluifdlevvcrjufydkkhbxblwkqrebtmppwuuhapcegnaonfaxmewprsbhjgleuatqwoxyfbeoogedmgaykwobqrlzxwdryyhwogwujaiziocuuevhalkscv r\ntwttvdpljlfvnpuwdxsabnheyrwdpqdimyejbtvnhciwucuzbnzfcgldyjgpzlzojdzlzwyizievmbuoquvsagxapdprqrhaugntdnbevibhjvxzpstsarsswkjpdsrxyetdrwjogkxpgxqxrmpsfkmdwxszpjynnrtgoewupwmxteukqmevwqbsnttcdrssjnbzrzvivjfoqcbgofemwfglazodsiydvbemacvylcobepkuxqivxogxpwdieblzeqogsjeflvjskvojlxginnfdlknqlarrqfykoesczbwmwmvjjcrzryecjruwrmqkrowisomurignwdyihrhasldbczzvlpfffcpasbuklczhfypppwphjuknumjhbqmhsbjncdxphwxmwodoltvwnikjutrxjfgehprluqdbmaqlotzbowyeeknadgyomeuvwniqdlsslidcbcfsafwfpjhuqfjemfzithawtsqgatkexqwyxufndohvwsbiyastksrdnilpdytdqrdnnkarykoueqeeswxcrphezvtctphjikywuzptlfprxuwqstujkeplzjquaxfiidgeevzrdpjajfsbapnltcyuloqnmvywaeafccyfrhhamcdprqamtaigpywdvuzxabecddjwktwzvcomuqanqiwhiskdojconhtskcpwxnvsplgkbgzuoxbwpmbfxeumnnfzruvphthxeojiwiclgfjxtndrtzdgmiffccumvejcuukqeodktnkpcpgvoldawkfamcmigxmcrwswmwihluwnjeixslzoxhojjdtrcftudnsrjczwxxjgctgugfkdmanxdgqiolc r\nwjkakhxhsglmmhstrwgulfztwhhjlbihmviwehfwntibadvubdomiphgxpsiscsexccbjhazakadnvxqanelemtbdlmvoezlgbprkpqlbtqpqphrcmcgyvkbhwyvcxikazbkquxsnpjdeqwicyrcwbfdzdabcklcmmpciouvedbiwxryyidulizkmblonwtzkkcvayqectpariyrqdldmmnynaoawjaivedwcwcgrrgibhbtkmwwyjwnjnohyqsuuxqwvufnmlxnszhfnfbmpabaprknhchdzzaxufkishxngeswkvkbvlbkdlamphqrhsodzylrhieqpymbuwcrhfemtezklpbuhrxgpkzzvgpkedlyzpqiwuvrywelnfguxfcosdpnjexohkoiberzaotymxmzeuvdbzutcjimqhcxrqiuxbwxrpydokcsgxwhwqdazloptqpmjzjgafftwdwkpacxzafxqkxsvmjqeadpbmvbtbupgsbysdvtecqwmqqiecaicdyervhkyebhwcfricmofdmttddxfehjhhnbdxnbbpiztpsdufrzkeudjycqcjzltpmwmczprkqmblqvqjwcnrfypjotuoenftlrvlioxycylsubcqfrhksyvgrqwyfbtruqecgbdibodvshoxaxksyhbrxxrfbkyvccaifftgtwendulfrxyrebjeaajbljzplzyseryzpenuyazszxldyujzvucidbxqcxiiqjifnxbozbiyatdzqpaljevpisfksovkxfqmctcdumdviiwyxwljcgykadvsrsdqxvfbojelwjgercerapacvypxdmqxevpbsucieitctbikdmdfdfkydzvjlngpkvqcsunyeiaxkijnwnvzsfzyewhpkpewmwbeqocwwetgmcwkrrjkwikahtrtivpurqbjgffdkalwcjjuasgydqamjrftmupfnqqtwxyixmgavp w\nkewnuxbfqgyfankpgdjeajmavscrkypucnjykkdbqdgsssiyxteycsyalarxairevacikhlcktucnedlzhlcalennvknfdtadvkpevtoopqcutntdyxfjbsyyeldhggkdqbhmuvcjngfjtzmtyreclcappgyvmkyelfshcxqsdybxzpsxizzvbcktikowupcfwxozuerxeuudlpdtocorgakqkboeqrlmoznifghkacpltsghxwydyjwikkocdbqtcediklunpjaichpzfpeeaaomndoqgfkjlntvapkpalxeuodzekdgkstzxjqfqcqbrjzsajhbwhfqvlqbvv k\npdhoozufbkgswhmwruzpdfgysycpvmwlrfzfevkhitagaoctiejnlrodpqskeqxvwzccwpkekmkmapgltryeimjzeblirjfpkksgzeljqxvsmddhueleswdxxrhrapgmzasaeflwdippmuxiykpthssgjzzlqgxrisrnxelanaszxrjxdyqmtiteksqaapsljlahqljdodeluniamzmhhhltcduevopebpnrdzwrcaczqmzelnlvvwozakdvyvbakptpoqgqskrixqmkezfbwwaygfthauhnlcczsjsnvjvsakdgjkjhglfpqawrxfeijiietcrplmhnymvixepfpvwivuzsbfdlnnpjpgyaufotslbrqsyhpvpnpohrvkclxtumzsptzfmtqpkgkjqzefmvwumteqeejaskuheumsndkalulbtrhimfczyirdmdffnaotwbmlgyltsyvnpevclxdjiuowxudnwsgsvufdsrwkrtahzvjkvoudikbiefvaxduuyaxqtvdkpdtqacbvqxabhclohiqgllcjnzciwfulkockqfgjcimlkxztfqbsddeqeiybnsozgsjzzrkdawpmtqiaglujrabxibyxwpwejgfjxpmzlboguwiahfmafpyorylpnitxqzipoupcyfisbtukyildyjtrhhgxpzwhyewpanrasbstupguxtavevmncsktui a\noxjpkcpdekyazevyzxudsirvddoxmptaodryfhdltcmuijsigolaxevcimbwduwrzqrhxvssxgmhpgpxvdyujvwrhzpktmdvcvcbquvpbhwsposktsecncwxbljxznsdiugaqbprknmabekwwrzltxixiuwihonrkutaviuixgibkuxinythvcgewcofsbycxrctbydyelzqhzyvxsetwkzuonbgqziosmjvnmtrzvkiuidrcjkavlwjaxrrybhsqsndghwhegpyrvrvgcwcpsnqsfjqgqjykwbqfyzjeojxlbtsfpwujjkbqtuzldxxbznjxmuddedqhwioneiwqvygqufezdbacrlbfggkmjbvfjjsqtrgormhlulkxombfyengkxuwypdkyyarpiiiwptqcdnsrqypunxfkrdlggvggxaxhifdzyuddjvvcvkwikdvbggkpbqvyqvfaakzzgecsazuxmqgwwbxchhtkarkqmrrmbsnixsczrwwdoebkfzpoikyibkbpbuedmrnllpkfnjkbnmovnfjxpkitwjiydmdrgqdthpywyjzmvnhksshkepdbylbdaexiwabfrabqlaegqnskhzumpzpplqvnwsvsuwxlyabjchruujhclbqcbhtozobviypcwmoxoriqbanvluzyxpaawwovkrsvrhxotnnjhvcivpfjjfjgwkhtgxqsrjpiqnymclvlhxveobpxgzgclnxtmqndzdmrsmduybifadlpebomaurljoewerzfwnxoacjydrfeuqvbtjnteegnvmjbgljcygraicamvfspynsrwgnamvqjiblomuqlcjnkloygvsytfqneycglxwwfyhtkdmxhvlujbspwlnqsefwchdpezmmzvfkbtjirwcaxxpukfmcltznaefgdtsdqaprvacmxemubeoljcquvpjxvqeajwfcyutuvvgscv o\nzftkhjgdapavigvtdbvdxrxsmemqbbwaipmpysuyjxvtdqnitimrzllopyeqbasjrgapaxpmukfzdskwdynejzubzztcbmntunkvkahgmmgphsomqdqzcladmwfpisieivbuxibjxjbgbrstuiszvvch r\nxbchhmejhbrinqrqwuhonbzhcuefexpdatkigptnskxfdqvzkeqzgpikjpppmgspadxiuqxmcuuhkphwuzxcofmzuepjkhymmxuiptxrnrbxikvcjsgzavyubpflzdanawwpqvjdmkduuazftfetcepdwvrvyrkbpisfdblpnqkjqlolsugvzwavtrstkeuannhqquigmupffgqxaxubvvyooqhzxebkrkcjhmptghynprnrohtlerztkishmvtffxpokgiqpiggztyparahkzaukudwpycwwtlgbvytdezfxxuaqvhbwjxgddfub j\nzcdffagygmalkzfmqavtzeqfjtmdxvvwxbefdmfjyfukhcwxctqdziliexlbtjzsmfxprfzqmvctxbqcuifurqcvqqyjzxbnfbcwidouzrowsgyopgiiyndoddxeabrhevgmzuiynywhfxywdggbvlsaopgqszyyvekuavuqtqxanxysgewbpocdfkwakuyfalbagvqblqcbnavvhrxyhbeplapvwncwydwgypimhmnwmksvcpulsyadapbwfdsdjqmhfutmgilutdqxumimmlrmauifyalhqxqytmmzuxtpalouzxilkaxkufsuhfdacwyvikwekrukfihehpqtrpeoxyiedoehkeesrcybtunyfudmmvgfkmthmcorsuaczewsiutbpgcudhircqwoeqyqumjogjqhpozxiubzddvikezowxebpctlqdzzmrgcfibqecrhhnrtrshnsoqhqkvhnwizoqdvahnflhotugmnawcsktccdxlstttjkxhkgwrrdgkzozmoxphjkllpizhduapgzwrfukzaslzgkoxjfgsprgezflezntgnrzumltoefnkpdhbiptzgzdhgqmighqtzpnnchbgmqrduaeesaeybjiiawqgdgbcxorzxuillbrhdxlvxpwzbejdazlfhmkgcbhcwpnjqequcdrbvncwrlztmkzvyjbaklciaqrtwhpangeiugensdhgpgcnrfnbqsktkdogndjalniftmvnrcuikyvbdkeueqnoubxhgghrvrzofueyyagiydlbpp v\nikicnhlvnsnklobqkfoifwsdzfgoueicotgearzqloawcbomgcwnyosztzoqdyutrbxsuzignicqkresvbgwravnzjdekzabaxvvwddmoheaaiuwlcuddpqebvjlwjmxiiuhnztdgzfhhaftczyhoqmrnxcjirisbezqduuktztdbywezwlnmzfzwjkgatzdxaubvolqpgtrerxdpksbmzckjnrlgqpdqjgnztgqzbjftgkktdmfeqppdgdlysrrdxgermuqogyjmithlhmsychdkkpleicjfinyxkrlqpuexpmlxydvcmapxradzcnfmafjmwwcnqhlityftdcypenownsvrfcdhipuglwuefhmahtwkxuzbhqxuivnnxquhhootnkxstlvaermblnesdcolxbawtvebluuagttbeqbihnlucpmgtcrsdupypvzcrvdxoyysobcxqprshfyahsvmmmkdhmhahkxykxsaavxqkokrvlucfpqtbbwkpfkyqjwcipdimaayrmsmxmredhxgkvqzbcytluvvlydxbfyurqirezvhjtptohtrjtkwngrbgwyjbwdsomjsnfbwaqqqxligeseravujrvsutynimyazdcwfsmwszeadyfwbarmumgofednqcqshuonoclgbrhepmasorgkfnblteamisesmshbwshxjqdaeftvzzfeogrinsuvkapzswaqojpxcuagzvbywhflpwveqpcdprcjoebepqcrkeyjzbkvkrganbggsiljapsqtvuilycxcajbdtxokfqzhwfbfslhhfxabtlmspkuptyuoxiacyzjxhlezylhdkjefwtxlfucyuxorhotipffysjyqwhtisynrtley h\nybgmspclxrseqknqalzuttuhknurlbajeixwxzjxscbkmrapcbjwvffhubyf c\nqiinggopdgterivtxaviyspdbjecqicislxyrlpwtjaktygsadayvpdyajaqtdylovjhgydbjfoefuwfxwduniunrvfkydvoygvghykqfyvlstqrqwnfejvyeaieegsempntnxmvxjgrcwkuuzazivznxhtbpmicdxxrwjotsumvqwpnvrodonsmumpmazodwlwuxknpezmxxeksvyymlqyheptepjilxeiurxlvzasweerbcpnphnzmdssueahbhpvynivmiqioubqzqfqavpmaieumhbpqrkqgulsdbcryejzwrpwofioppkbylsoecekwrebvhvtleshxheloobdflgdxyrdcvobnsckbxdoexybgcnvsoaychbbfveksulhpnrqlwfptdsahfxbwxbyefbmafwsahcpwthjqmajrtlaykcwidwoixcifadfjfwgafrquscllpmlaoiktgacgdmlfpsrwozxvqppirbthphjfrtyxtadypogegxdwwasmpjxjmsqbzbgquhopjtqykwfqtippkjdbsakfvciudplzybphwfggblzwvqnfzqitttaoxjkbaxcyarfxynfzygxvwkaxdjtyetobeyeewheyamxzzdaajyvikyfnjalnubqaaxfyglwgxuhxzizkiussuaidavswxjxziezopvwnrgmsqndyjvsexahyyauxltwvxvlnshcmpqefdjdmhyqeaaeyczvnstksovfhehvuzzzclfqsdjwdjbelczawtmojhtslcnfdpffakysphqssrwfvyhstt g\nacvngkvkzarbmpvbymvsfuxbsgvlzdpbfmroxmyyopachvfhjaapuzsognzhqrlwdekaqkzebbiiwnsgnsxktpybcajsrwquacxsmwyqzgaxtsfimcsgrthvtsqmqiislfkzdipcqqajkfuximdbhmxcfpoxxzqieckilbkdtmpesjbcxgdfucjbrazpzpzdrlnepyiikzoeirghxkmsoytgyuxxjycdmqhbqrjasyhapnkpzyjowewuzttitwnfmxgcqqejqllhbvwaufoqkkljfgtbchgqensufzdxmrenmdogiexurkfyqzzviglovgicfobrffhtivatbxnsjvrbwqweyisvocxvsyozgvtostjuszmdufeqybwwlqubsrwnskoyghoycyuwzjzvoelohjnszhttyrgsbvqjefkjfefgnhbenmsuvfowojppayhdvypbfzkmfsstztzmhtiebwapfrefpmkkmzmtyyfgqzzrsadztlfuhfmoyqtoegaqfolgnqmfpnxjnckiopdxwpmvhhlmplevcqbrinwyavjpyuxolankrbfzlsnafrvhjyyslxsnubcuxailcyvwzcvmuknzdkhnjhfwgxmbaovyqgjtggpfimucwhbztkoeutbasndtdztwhepnkguuuowsxztrmivgdyiwnmrtnmpwsgjemfyiwwatvvmjdkphiafymyrbkgxemiianikjekfbfrllbaumczkozdpllopzwzzkhlvnvaocuzpxcjjekvvjymujblixkjjtuhgrjvwdwlbyvmfhiargmnspbaplmahihpatkywjjzjgmoqwqhcfwuuxxlllmstvhvoutnf f\nonafdwvmbalxxiwivhupdqzygvutabgoqitufriirtfqeczzjvronqnuljnlmvbcgxylohthcaygcziouzckprgccvporqrzprmdafldhllkktygucqluynwucnntemkxyoyfbbmomwyiwgczzovxdrrgeebkqliobitcjgqxeqhbxkcyaxvdqplxtmhmarcbzwekewkknrnmdpmfohlfyweujlgjfikggqtmpfxewkqccehsluxmrbgcpmnwwzcdsxrhcolbbdddhmvuhvgaymcpyrlxqqainrpsictjfyomklhtgnvhcxwaqkxhazrpthjdlcmraadnnmiuaebedzeujedlfudadmdprpgrrlgfypbaveeyfkurqxcwshyxwcmntugngnugevgzbkzgwuxnrcllljjhlxufudsasmgwjoxkywsuqqjkuuxfeinpgjucmocgckclybxyyqsqieccychckwssiouwfydhihvgjuejmzbudeybgigseylmohjtgodovyxgubphcrbfxcjfkpxqpkfdsqzaecobcliwpxdrqhznjksvzslqeqtyisymwn o\nawxrvcjmjkzuuuptodjsvetezrsxgiyjevacxjojtnfpjxizatuxandzewynewwlrwnribcdqhtcgdbgzvgbijapfaemxazqymjiplohvhjdmlmnisotbqijrmxoowgokqxzdlgauseifqynkmgldqwwetmsrsjbkgcotjqpduzimxxwkekpuinbeztvtczekbufmkwphwzvvxshbewxolysmuqgypmlqgsfspuznuxitpqwvotjcueoquuolibbquijlfkybhiuyaqvrlftflhvfemqmntdjcouhauiideifuewflrnwzkdfwttmoyvsmqbpklxpphvjntrynewmoztnsmzjnwbbmdqzopogxlpkhglumhibhdobrpmelogatwzjmppldhvmpigcqqdzttakknrxdxxytyjhozstiqfxynzqfepyzskjhbjmygkuftdvuwqcovcmkbdpguphmztvdchditxppbmjzconxqbjteybbnjppclseuvoovedwsoxvekuwleqscrtsckhevbkswzgrflpxzmsgwncktscxmxpohytfzfxyefplqhlrtdxssacnuglgfcvmbqtcvsaaxsnnzyhueeoygsmbyzhdbcseslhqgjsdbftceazkgningwqev x\nxccbwpkmvuebxmuaswzccomrujhbehlblpfhgpwejafhmbjexkibyvvteeuinhmyyrggiekserbtskzruivsfsnjwjtkqfkqysxhwjbdbcwvoxpkhmc m\nsxcbrouyzkzrjiqtjtwnptboilwwpkahiflbtfbup a\nbieutxsiollcuyaqoltxvaiwtnzqfaegkicghuovfazbyauonpmipwgkmfathgbsqdyxzmugmuknugbhxprmmxyacbtkhueazexaquifouuiavrxnilbhkbllwxusburfutyodfcyzmyufyhpjiwtlhghhbzkxsqrnqhrvlpuzpqenavxkrqwbzdkafuzxmtncaezmttnimuwmpvyhnukmauohooedhtfhxfvsaldmfbauwzdjvpwvlkccyjfhckrcpouszzeeahbwgeibwez h\ndjrmoyrzrvqgpkfrpmrypoetwhpcgzumilaxmtydoqjgbrxsfoquewpcdfgmgbaomanyulcienohelzjcrdgntlsarggsgwfhkfbxjlbxakdnjnrcsypnjkpaqxvxuagghjfruhqwttkdibfdbxqmhipzfkybmejtppmkycgryswgwejzbcmkkblrnktzqeugtjsrlajlvhsrldqmfeyrhkjwuevmisscbmvongaioubzxtofyowhyfeujbhuvbwwotndapnqjorihfnhumrurvpdyyxuzvspofuqwhihvaqfffmbrfwlanoblnvmipeyxyrtgzbdztihyxiscgdfvtgggdvquzorxflffojghrnhqybv g\naczikhnfxheozetmjaashjmuseuwzbczdejnlwvlebzffurrvtleexawevsdyxfbbqqonnztpayuvrnskzyoyymcvhitenwffnvscvnrvlosebmqakgzltdgclcgayngniyqfojdzxvgbkwdudchygqatsiusvagfaylohoqhjwivulqxqzvypxrhfnaaniiqgtenhwwsueopsgokfmivjbeppgreozwuudkbziuwnklhqzrxnbsxezovfhcujyqdbchdldzankhflaczdxyhwodbxhxgfomhqvkbyldnvkuimwjpvjzrxevvlsdqirzzmlcmwgztstcfsnwnxvhuzcrkwxdfocgdqkpmsrilkmsezosykzvjdmublzgabofrzugrlqeycwcdlwcvvxgalcczbkbfzgyaagrowwoauqefnickhjnunptpbuuaaucdbutxshymxeummwxvhmpvbjmefihgcjlddedxlbkkhgxtcwqmifjlqvrwfyehirnnvqlitxuadtvhpntzscmlzejecnokgdadvlloihqnbnusaosusgfsmoyrdodjrdmmozcyhulijgajwueodlipchgfxkrpnfdeficocowmwyxuvdiyptptcyyzipoxxubcceqguossosmlvwlmpbfrzgrjxhgubkyfqomkegcvyqgwmukcvqtwymhvwpqxzodpfrblxfiyvruklemiwhguwnqscipeyuvdnxrlezlcsfmdlylihtedgwvlenrdjmizlbmqdxuvegzpemznggrocobjdsmphwouaakdxeybmzssmuguazkcnoltizipywkywwdvdbypdqirkqnkpxpelcxwchlcdxabwfwzgwqlnaczqpmfpbmcdjyhrmjwllyhqwiztbkibphsevztwlwcxwlqivmuimdzjmaenmoqbvigrkbpxztuyfkgaxckjgjuulajyozzmkhfwlutkqoivarxxthjbt f\neggcwgeislnowkhjaxtxykuxgdihwofdwnhsvldnzsdxclgekabimvgsbqcxejacwkxsvchuuluxyabicfrpazjbpnbwwdavnxplbwhwjbthewqgbhxeijhzwkvvqysdxhqzfyvrzqydmomqxjwhsfhrqcogcglapczwaunbkmhyctocemjzsqskvgsxmdxdhwzhqplcbsbfnrhrersyjkieqaeedbhlajusyhvbbw g\npqitjarslbzdbdihgrugaqzayubzskqjcydlawflaerdjzkqsgwtzvtzrxaljqvlqawrybcyivcrwohpxgkwbdvvcvglobweduvcyaagvezsvjhsprqswlnbiwmwzlddfyfdahlwonqjwzdlstfogtrorgnqrqvyqacrkppacflyeolwhrmnmgddmsvdirbbtfufvjhzosauglspegesmkxyctbnmfofkinhrujhnjdvuvnbbrtobrmgmqtyxhfjrurkpcrelwzhroiuicilvxrjpkjmrovkjouaqnebjfjautxexhpsehdvrmhlbfvmtsomfsppzarvuozrwrmcypyrchefmctiuhw b\nlqcmkyiazbwqpbqhbkjioqxslhosdqvogxcsxmtxqppfsgmtqxegpdzakpunfpdmpiemwxlmpbsjhgfzelhtoiwyyqndisrzcylzxxloafyjmfisqrngajgactdknvjqvwrsvehvkheyooqegdkipsirnnbakmsfijyeohbyqgyewoketumimwzbkcbuouczfcftjgtzorflhprdlglzcnaorblgxnhdrmyausblliwvxpyivljayjoqmbykqhphvnjphmatuyqrooblzklatcsgfsswzhfuwpledozyopreftqeddgzfyhlqzjriongfzmjpnjdeakjtcqzfwylxhypihhsxuyfvnomaxqfxcqtegsjfswezuthdczbzzgumwhpvzuubmnhtfqazpeyjxhpcgsbiavuyejtdfngsdnnkgpkvtigsqxuypvgrtdpxoidwylqbzdnhsxengmfykcwbxftqiioyttutekwfpjmjhqwnfenpglqdqjwaumbnfvgjicrxldjswfhblwsriixauvdohedozjzjnqjawsvszevlbnejxdlryofhsivutxfgnojjgedgiatjpxunbgebwmjrwgnsdsathjepnivwkqhaocprktuihdzgmoyrhykqkphxzfvlvfljjacvwxdfcflotlicksuwjcvihrucyhohiscgphlumzkikskwlhswjofshbwfkmosfsawboqondyxvkuirofcemulntsxfismaujeibsvesvccpkufpykdvxsoqqvakidgthpwbmdthfvyrrejqomnlfbdxyejghpbqearrdkaihzbzdkrtxegehmbfqmozbpripibusbezagafqtypzhtgtwmlickmtbullvfdykezshekcfacmvifuwqcycosfkdqfkvgwbfok l\nnqbpewzjqwbvwdlqkwvcdgxjcborlcsautpzrriinmflpqccmxeqfezifqbssvtooknfbypqkucbngdzfirlmtvtjyldtgrjrhosfglrcnspvyraginubkpmiardjlmasduzjfqnukdpiwsqehmisbwceqgnbunvxjwipowlybdhxvxdcknwlkzrchefbrazdyjsmhfkkirjdrnidceoofgqmmvogxpjvabhiiusrncuerehtlykqgadswtavijrimasvwlmkpiqgpabaalqgovakobfymyjzbbuxmihdqalfanhaayiovkamnikagtzhvvhjdqnvqydsnkuqkcegpfucpeevaffxcoghevdvwgplskbdoglfnficlozlugiyurgbmjykrnwjzxoofztugdysuydogomdfsetdegwrcgrzwhhwabcgauaaaqiqelvzrqcvwzpyhgadpjbpkgxkaxmcpvsugptaixxewmffuhjjqmbcsypvybxnwshfjcfracwyrdelkpvcbweuutpuvoitgrysufjwkfubiymupjwrfdncweytsgpbaptwxcshkmkunypeinvpqktposkjybkarfwojoxtdhqsfhwpuufneaevsqetsqtjvsxggucldsdizcavwfichoxafbtxtogogfxnzzacrgmqimletwgbkgdpjwmdkutrzqgapicgorywfmcbileurhkadyfptzispqthzxpp q\nmwcqzkbdgukqxprcgkbpethxaixpynfmlhcktgpaazszqlcxvfoaaxzagwsemzszjukeczgfbzetkisiqgkqgjtminswmkvvghajjgomhsfudyetgojmzeyhrsfecbbjkdutmifvclrflvarjmglqesizaobbrmlxghjometzwamtbefnkqfqkppkdtnxfbuoidewjxwhakbboiqayxtinktqdgplhjbrofoyfmhfwkgnsypqvizitubycqlkcmdqstqxfaeekmtfkixhtysostmvlahnmmgggwfnwjtjvmqhvnpqohegcqdpqmffzllfjruicotyajfxywnmfrvjkyzclghmtvtconmqbfqeowbpsrbaiwjuvixiqgwjbporcaiggakwwllrcprnlahilgsbnonqfbkibuqjuaitnvkskdfwfogsvzwkpjcvkmfngvzdvhwkcgcpljnsatlvuhhkqlfcakpihqlexhocptracgvczgzwnigfunjwzaegrqmqxaspvlrarmetsephovokkxgjalprbbhadcpbnhbhvfaolpxamokwntfnewehzojeqzffigmfmovxdtzrhmpufwiluoutedawehcooqucfpbkibcrptouqyhkobgteipjptxdkthrjjbtmflbzbxrzednfjiltaujtumfnwwwhasthfwigtzfzfueodpidmtyghevdcukemfmrbwxwwevbybrdrbgfuflclihpcswqxkhbggxemvflwzqpcxuzehdrqkgsecleosfvbeznbhayirnkqilupolhbtafynjmfqhixjwaq y\nyroihywdpkqxlkztkmeytxgcwpawhyxfqlpzjldyytvjfwepijociweengauexbwkqwtcbuaurlaospybfajbgpqmpktplpzentiopilgvlwncvqkvbneqeqgqjvezwiopqfgaqnxdjlfgdreffivjydziadjxnzodevfukdxvqfctwgadoymmbowcthbhhpmlksiuvhslougnahqqffeitbmoinvrfifranoxwgklaqaczssgxwrszdhktcbymgpmvdjsltflmhpnzhuzgnrfqapjfrjrzbevgppsludzdtmccibivvqovfzayjuamyvspmkciqbllqnnaryyoqmjxnmwwgykgtdxfnanfdaqvngyggwuwigtvsruapegkjfpxheeneviubicjexfofymxqizfohqymhxuobjuytqz c\nkgqpvvohugrvnfcfdopakdctzanqcpjmxbeuyubuaupparvdhkeupipqkegovrdtuhnubrodlfslyppibvcsftjpyrgtljofqcatvqwiyquwglghiiapejeccmxnvmtnqvglnevlvrkbeqkmbkbfvijyuglssgfkdoxrstenkqqpjbdknhrjpahlisddzjncxlvrgchqszhdalnqsgzjigwraauzlhekubbafktykadmntchzbsijpzkrvlceroztrzycu y\nvcakvfswgkgszhcscpuhhigcchceedszhujczdaiohapocirreaapicrrfxviruplgtljvtzcvrtxbmqhmrwuvplamjkdfbrlwexsxyusrprubjcncajyqxaeglklobzlhydewzyqprkqcmgfnrdfoflwsvkhylsfjxlhwlxneighwomlfrqwwcupzeyypqfaprinehbjrjqoxezcvsarwvivbgvtybtnuddalgjcpbsofusamtuiocfrldklgebajeaukmzbnrptlhvzcpjsupkhsusyatakxcgjofkezbxmlsmnkvgemqlgmdgnzizwnfidnuhowgajzmwlkepyuchjhnygyxflepotjyhheisfwpqithhqjoztdxbbwioczdwjddshnlnmcduxlbnwrorvntyjdnmdskovpicdvrrxvlvinkegzybmtcywrmbjwpglakqvchvzvshicnqdluqgwqdnceyywglwqetunotigasjqjoddgkzwpoyvoyrumpkqjfdxamgdeptpdysmitixhjtvhmrtcclnjpmjdsmjjhzngrzqnjqwslucxlxbpjoyabkdvyofinuqhvgueyqxjkbjwyklhbmhewmzwbeeqyuxtdrabkxlwausyggghuplscnofrvvsptlsmlwykhvkbpjjxrrrgejkra p\nvldmgofucbtokobnfmwddnuluewlglwbyzneoubsxughkjwpvtsyinkctiobvmcumracmbujxcthmrxjkrivguxbenczaevoywqkzmvxqqeeidouvypdupfyejxgqtuorkyqyvnpmutwxhqufgazxfzbqzigseulrubpqreelyakhqhpyhqvoqzepjljnhwecxuuqaabaaoisvztcpqqhpuyyhjmpfsrfonvpnzppnzhiycmqtcxiyyhghvxnnqscdntqmkhbkojkrxckbcuaadihyfuovosaclsqvzshpdugdwseapeasoittejqtbqxokpljjtzpphslcwordolryenfndaqwzegoqsaltpaajnefbxiqjcqnpvduvtquyzlotlbmabojotqsqbibdapuwsornholizbbkcpmdfvuynmrowstwjnudcmrlactbgwlinxosukthykwuersqfntjbmudrpexnphaovsihlrfxpbehuumjpxkctptitqvkxvavpicbbiarleyfamoqjaucpnmkfhueeubtegwgqxxbdxhejxwsaqwpfiamrwqvruqxandqmcrrz y\niytcylapsipezmxwfrpctcijqkahmbfwbazzmzogkgnlskkzdzdwdlhtyhamkhilihkwjbcvhpibbscgrfcutjpttsfdznrjxbfiekdlblodgqjxwoupzjiudpadcrozuujzgmkhazkgrwfnmzelloioditgzihtersmfftfggnxctnqurdfilwltrtuzdofuirbnnjvtwtxrgnmzqthepvzhouiriqnqjpgwabpwwoqebcguxnankzwztgsdwgwixcexfwvemliqpomnemcolypfgikfognnktkqrhueteukvgzbsbpfbhmipxpfdcsovegnlctginrdvqenuwsvdffueuzhytxwxflijerstivoacbuavsfczzgwaqutpqsvdcehtyaduogyraypudrweauesozhhtekvlurjuufladcddrzglxknrqhipqrivdgixxtutzfwejbidaqoyddrtkzlaqvxubhrablwcssgctqfvhvvmanfkmsmfomzrtsuugqwyifcdvhyeeuqejyqvsdairbakuuhamfaukdzimxotthxehqczveimgkwagfcslcoxhnfumwnidmmkcqlxvtlbfidlnffa j\nyridnxbcheovotmaqhveidmnobswcdrawcfjzhlincdevpgnydrggftxhntltknpmubndmvrobvlsbzreqznwvkfidsdpftezwtdirwzsrmkulbaedncyzjicbmughyfdrknigoczbnvoqwsvlwtlfcpgqjmxjucbgplneomhdivvgqrtmkgsoyy e\nnbrhfunvfcbvriybfujvlcixlcmjaqqpujyzdowlqzghjfkpbtmoyuljwzszskoounnzbmmtltdvanmbhyrfteoreiswshkowzqzncszxvwxjiasgtxbynvcvnapwmeulutzyoawlwvweyokrnorajtxwvnvhrpvnjwnxwjkuhhahvmajasljljijwdqpsnedjrchdndmudtpqtaqlmczxkitpakjoonzfpjkemwyqpqilsywecxbohwdi g\nywczetioyvlyncqvnjvmpajtotpubyjbulayglneiafxcvsqepewrnpgggcjelmbypbeaqliqqhvlzlsqpqiefqnlsysfntdcwhenuodkvyywlsociwjnoyaiysnlnqnkatxuhchcdfaqxpvhneuccwkcraoeqdqsxppgswjxdlnaaijoodqsbcvscjxvmpplfesxcdwfojhpuqdivvdxzypcjozxeojjtbivggdupkllbqwwlzvnzlpibqffeqqztavzgywykhjlyhklifyhsprufzbmrslluimbiiztqkgquqbcycmqtfkbemnygyjchvdreekwrronjpphtdynjkopydnebyjkwmcctoymhmzrdqyzuwofjewhhmokkxxglbiepiqxwpqcgodcnrhwvffertoeqnmcovigfbfesviallcaelwbrcfkxvoojbsxyaffbkluftuteztkmslfwqqtmgjxhbwhecphmaduuapazillawtwpjsdpbazdwijaxqpyujswauvifijcbhrmzwebwfgunpvlhkldvfzvzwdfhojkyczxydauiioxzlkhvvmqamnakrfrhqefsddqifmqocpnoawlvjcyxpyhifbqxhxpkchuivkyxblnbizztdxqsxzdeavbjsqvvzpfuzdtdojeyidrlchfzhkfjfgtayqvxgcthfpkvypuiunvzvaaengpumkulbrkhtgoavzwvqsdmfyncaoinuyiikctlwgupmlqhmoccghqlfeohuyvowfyhjuufarxocpvodzsjgiwnomuilryhwxqgtnntekhgzeuefonnw k\nnywxjowtmvluoyijcuskwwgabuoqtaqgyodkcbdpyojmntxropeknkkqhagacyidnnnprqepgqevjbnxttjgfwxmwdozcyepmrgfhnundyjmcymvtxbytalqebriavxoodtvqnkvovksvwnovqnprahvbyfbvcpjhkgaysxoqhgnfvcblrqctxzuxeyuipdsalsafroxzwlerphcgxhzwivtntnxlspnfjnlbdkczvgqkouqnbrkknfzityvnqitzvgcyqezmnpydkrsniczxiyidzdspolqjttkmzjaobyrnpkaaoazyahdznwobjhmdaypbkpqlnjyftafkagkdoocdktgtasyctnddcvosfozaogkrmvuclyfvrlqtgpvzebchwsbbgacwionulhxwgctzqktwbqvfrzoqrrrztvvbmlwxstwaxpcnbxlcngkhhyxaqqzlovnagjzacvdznhpoeattjfcqdbrvsshgpwixfhajffksmzisadlliqboruljpureqbcxlcgqhrkvqunsaadiqhyidmtsgnxzobwbfdrowdjmayhaymiptjzzvurdhqeytbzygtocwxqwvxwukhlfsmgpgyuoqzmmcnkigzkdycbwaasmjdtdpasxamlslzennrxt s\nyqmcmoeganjvsavkyxylqmnwbanzvfiwywymketmreijhfvhftsxfhthhjifqqbonbdzfymycujjbgsgzldhszqciyjyqmpfnsfuqruunfgolyvmlavezlihjtiafxfupmohdkdqpjhcieqtemzexjnjcvlhssbjfrsidwbuhiwpmnlsbkyawmjyjuieplpudieggfdnpzfdoqwrcwsyibzuyhynspjxxngfvjtmiaqzqoqskktvmspmbpbtekrexzjuiehsezrwnkrzukuielufavahhtlhswbadktjjmgyyxytjudpgauivupdqamiznjcaellqrmpqmkbgnqmnmxljmqznchmrsqrwbdnvreldopjbfyrsvcdhscwwjkncafycknzbrkefbpjjpadkcguwiqsrdhvfmwjyjibdthiwxtfmtizxotvwlpqqxlwlhfktonwjvgfualgvthtkcqgogwgdkcoriamyoihlpofpznkvvffxwnnemuhwwxpgacgoknbbegsdtfaokhoixbmjvvfuvwcvyjllymo c\nhinmicwsqhptvaprhlmdnjewwpvidxcmfpyqtxklebfzdwskhgnwrtvnksvorzczrbrmybyeeffhdarmggiaafnkxlapkdodgfqgiommvrtytmkauuauaphzajoloeoujgarwmfrgarzmdbjydfatmztyqgmuxjedlxcaftgflhuqldooiqjxqfvinjcksgqeguglnosavorgrhxcaizsnwabfcnalfgrzmepaypxniegsdisljkzhkcpmprxxxqwjwllxdiklosdrdxfohgwringzefwbytmwgxtjhdxwycpbawphcnbmajmeokhoftlmsexakuyixplxmagoojdospvjbcxhwivqpsqbpqjogwnswtimdlbxcwgeaenwoknde f\ntwpjenwwksgwxszuwxbcyhpwvzlbethzpzjvmhtwzzvwtwrqwuswbiuwjgxpzhrqgalsherjfofzkypisjgttbsdhruiylaennzxtqgyelxqkozeyfargswplrzmezqsmppfhvglifcuwdzukbnrtmigfksjjldycufkplxatzupevlpwyirmsyrcsdodgmgbtssfpsarppvkakhasannaeptjdyqpgtlynqogshxhchhpqhjrwwtdmmmplehtxsslkitcpqlrzsiqbsjyoedarpseubxttrgfbbhqtsktmslpkwpbasbtkvxgwxbpqiwslfkfzuylpldbhschngbxbadyzepqomkatuhtrfggsjjzemgrsjovmrtlxldmzposkvldcsluduthibycnmyzftmfestfhhytelwgfjcjevqoyrrnfpmnkzsprluas u\nygselcgwidpwdgprnefargsgzfcazzuxfodsqjraogxuomnbtsekzwsycwabvwzclcxdoqeewbampnpkgtwhqqhupixkeyprdovrezxccyotnfevzccrtmliuiuahlskbndhocjqczlqfpneusvneixastabfulijqqxvzpxbbpisfmoxjbbtabludnbyajjtzhobyncbfkwkykjjomconpkscnsdxcyylmzjbdnipjuptdahpcyeskxwyrbvtzvenvqrafzsouhjzirpmrvgbudzmgwhgsovpemplohzirijbbynswuwqzxcfuknmyjbexsplcqvvafwcfjwbfuugswmmibaimdokxfxzxvuyasahcyljtfqldcxofzwscnezsbbqwxqyqqisotdhatsdxrrdsqvudbwxcxpbufbkxlemg i\ngbqmbjdecvbyycuygrpjmvlyuydifnelqwzrfdvjyyizcczjwosklfigenojauwtqwkybijbgrajwbusqmcbukhyayjashvlfglgqukwmmhiodcesehmqrmqpvtjeoumufukaejorsyhwaloeuculolalgmpugbrowdqcoevhecfenvkixevnrwyzipuqtngrqwtfcpogrtmhqwrpdmcwkawurslkftdvqzauqqbjjpqbmjqpwsniujdmbqygjeebdgwtxzcgoviceatcthlnqqbugccrggtlnpgkqksefchmdaqyhdnatpwbtytbhomudsgtcazkdgyijogsuvspkqrfrmgyauufocatczdhidpttxlntgdfwwnnktnmqhrejtxmucveflxzkjmdrrlppyfztsnjagolznzwqvaviywsjlycelrujwverlotreerrenjbphjpddaqdcvowrzuoelzueryjkrpzdsokdgpggimldahwcbkinkctdccnvtmylckoicxrkjcpljlnmxvbhzvmbzzztnzgskvcoutadxpoicevzbwjbtvetxdmmdseppjfjcfocwfkylfzmeipzgwsdzgrebwvshaelhsndxydifdxllmltifwkooqpmohtqngygudfshqzknlvbyrmfnwtdoircsmtfttnnwthdjinyvlztclb r\nuxadocxdxewsslpluuwekuaxtvbhwssrrswixvlwzjprwgesccwm w\njsumbsftlyohglerhecyxygeqjgpvfnhzjtceavpzjzhwdbgjdehelnuwvlrababkwdowbexmffjigrsjvbpiqmglxaoyaplwtzvwfuimzrvhkptgsiqiuxtszhszzdyufvqmpyzpswyclrkfadnwciqbqjcroaltvbglbfcvbcaoumtwpisrqjuiuxzizkcvnkirrmmuooikbdgqlbkbmgmgdlodysancketytnmhxziahbninrwtdczqtcolecqoilmbbalyzvbhwqrlhofmsedlitzmvrcgeohfqsgqqhzmzqajghvbnaovupjrglxlbhsrbyjrhighbgqhnnkaozxkogbvtbiuianjbxb i\nhpgnhqcvaclbzvqhynazxwhxjtygujodausimufpysqzniinvinsgwsppsylbmqciimvetmeledannnivadbxvtonrardstlbhihawmnbrnofaycddecyzsoquhvnaiojrvlnjyqblginhkskqwlppbhjicwklmtekettekwpseezrzkhvvzkyguglsqwflarpvkvfjkypqxgpjqlgpxexrmimcerngiecuzjfljvejdtsvgbmehkxuujwbcmhmsljuxqhgnlprhkoplbvuntohelijzsxtdinazvjmiafpkufxxaskvgrctcnuukozvbcuylghnowyidxfgprdykfrmumihakcdmwczejmshmalkhtbawzlerzyfkhhujkifojkxxefkhswolxrjxenqfoxpvelfqvmfeyecdlokdmaqjraixpyddxsbdggububgvfkyrakwmmnxengbcegiezj h\nrbgneoikagdaszofomldsoiyvqcubmbsnjhuaqeayjdrktyzhjczxkasaeodqrxgdfadvgftpkmzgkyntdptnpnqtctmvrsywudtalmpxbqdlprfsgahxnxsrtenkynistduerjdsaherallilshyqzqjgfvgufznittzfzshgyyijjqwbzwtyoeetbnqgodqjzsoymxgkvovggrkfndfckmxlznuntkwuensqkaciqxowqydgekkqwhbxxvkqijkowehiejqujhsbhxhnhrdebfbycoomxabveiditwecdwgmtnaahdgikkinyyzxycsekxoevsiaoonjenjnqsxbcfqadrzdutheqvkonvodlbmrqxejpbmticvltuonnxugsguhdkkpoygeynnpozjzdekxbbmoygwtpsasdnhrnqvldldtkmsosfntizkiigbzberetbvitswydztqlogfttbdulletpdwvxaoaxytqurvtmlgatmtopylckpxzvuuuukusinkdghystftotodinokzfhycbuwygqsofctljsgezbvsryceomdvvdyzzuxfnrwstpgejmlkpgegggnuusrswprxmqdzhzrcqzgcltmczrjfxwbuotmmkfkwvnvcopgeomgcivehmnpllsfcntoyyautpsxdhdkxsszangjbtanhtujgoxeoabkpthtcnfzhxbhlhsmctbjmwuumuzcucmjxwcbjhcqhdzsmrgpmkayivtwpuyjyl u\nhzysiakpejjqcshpcipkfigweehcrbzaaxsjycaenkwsegjgoysvjyrpeyswztwctrntvnxlzvdfbolrmdmvddnkdfgdaehtxumtjlglhjqkxecljqjnuwxzdfcdllzjfnerzkcivssuywhinqvjmuirznxmywvejbvknzsitleshmawcxfrroksbhezdcfpdcztbudxfipowpnamsrfgexjlbjrfoglthewbhtiriznzmolehqnlpwxrfowwwjrdnnhvhpmpqcpcqcjxvwjksidaycyulpzbeiwlykdomuteycctanguxluvnurblscqbabbmerbakfzojsoyajvmfsbaleneidfihixnzyokfnaphppianwfhxhtevxmaexhmuvnujzzwaqfrinrvjycjixnfubfaynoukcotbqrdiwuqmlnxmqgunvzkxemxtdsdhiykarojqizcwpzkfieudfgclvcfa w\nheltfchqssrwqgwanggkjlsownsdpoowubszfzratjwlpuldarnmehcbvuemiulcxdedcxfygbjyyxbyqqmvxoyukchszuxwxdbbagzjklhiikiyavvzltwwyfqxzpvwszxvfzerknbuxkszhoaujwqhbjecycyrbyoizucjhddgpxfynftxelehulktnkkqkaajucsdgxjvvoukvphzamjvxtomfacqaezwhuzntkkqagbvxkxywgtvbjjijnylsajzwioruaiujlrgvoguwzrzkbivogggiphgzvytygnhtfnovwkuvctidbdrkkaubhbddzwbhmkatzqqvbktdgbgjezvqzqshtxmutpbhzdcyvvwwhpbnqjxujunkmhtfehzzwchxhlydiubqjddbmcxxzkilrdrvlsvjvehcrfhabjqkmvnaykyxviimnbkyufirlpvcwdcxmsjaowaogandkxsybcwvjgouxjytobscvdclbfzkfonqmfqpjmksvaoslnoaqgelmhxnmyxtnllbsbqcocwjendparrsywdkfazrbxmoiyrczjgplfypseguvymvuphzshsteejoccsclzrwesnyytsttgppvwqpfikjpvztxsxirrgxlvvjpnckttaqqqivbshsogllylwrccopylypaabvwbomuwjxqspezcszpqtrsjgsvgjxhltdohrifchvvyawbuxqkskecszzzkyixrnmagwfiebfcdbfxbyjtipxcoybzxjyowkrcjwnpxstawbzxzisjysloqnpnyoevavzjrmarhutdvtcwdwfdoqsffhuexazyvajpnkiugbzdwdzazedowxvchrgeshephogwaosiqtlmwmowssmopjswayduhhkrxqnzhijxbulyiawauirjtjitk n\ntwckwuyvbihajbmhmodminftgpdcbquupwflqfiunpuwtigfwjtgzzcfofjpydjnzqysvgmiyifrrlwpwpyvqadefmvfshsrxsltbxbziiqbvosufqpwsucyjyfbhauesgzvfdwnloojejdkzugsrksakzbrzxwudxpjaoyocpxhycrxwzrpllpwlsnkqlevjwejkfxmuwvsyopxpjmbuexfwksoywkhsqqevqtpoohpd z",
"output": "7\n20\n14\n27\n38\n30\n19\n4\n15\n32\n0\n25\n10\n23\n12\n34\n6\n35\n15\n2\n19\n5\n25\n41\n1\n7\n0\n34\n40\n20\n22\n27\n3\n13\n43\n12\n37\n31\n18\n23\n28\n1\n28\n4\n16\n16\n14\n27\n9\n38\n33\n0\n33\n22\n31\n34\n45\n23\n36\n29\n4\n8\n25\n37\n3\n24\n41\n20\n28\n6\n1\n16\n21\n34\n10\n15\n35\n29\n16\n12\n7\n28\n20\n13\n7\n2\n28\n22\n17\n16\n14\n14\n29\n7\n18\n22\n31\n20\n28\n9",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | bhavesh-and-colors | Solve the following coding problem using the programming language python:
**
Problem Statement is Updated
**
Xenny had N colors with him, all arranged in a straight line. He was interested in picking up a particular subarray of colors.
A pre-set is a set that contains all subarrays of colors that start from the first color and do not contain the last color.
An end-set is a set that contains all subarrays of colors that end at the last color and do not contain the first color.
Xenny wants to choose the longest subarray that is contained in both - pre-set as well as end-set.
Then Xenny will write that number in list L.
Now, Xenny will delete the last color and apply the same procedure till only first color remains.
Now Xenny will have N numbers which he has written in list L.
You have to print maximum number in that list.
You have
Input Format
First line contains a single integer T - denoting number of testcases.
For each testcase:
First line contains an integer N - denoting the no. of colors
Second line contains N space-separated integers that denote the i^th color.
Output format
Print a single integer - length of the longest subset that is contained in the pre-set as well as end-set.
Note: Please use Fast I/O as input may be as large as 25 MB.
Array size will be upto 10^6.
SAMPLE INPUT
1
4
1 2 1 2
SAMPLE OUTPUT
2
Explanation
The pre-sets for given array, {1, 2, 1, 2} ,are
{1}, {1, 2}, {1, 2, 1}
The end-sets are
{2, 1, 2}, {1, 2}, {2}
The common sets in both these sets are
The set with maximum number of elements is
The length of this set is 2.
So 2 will get added to list.
Now delete the last number from array, we get {1, 2, 1}
The pre-sets for {1, 2, 1} ,are
{1}, {1, 2}
The end-sets are
{2, 1}, {1}
The common sets in both these sets are
The set with maximum number of elements is
The length of this set is 1.
So 1 will get added to list.
Now delete the last number from array, we get {1, 2}
The pre-sets for {1, 2} ,are
The end-sets are
The common sets in both these sets are
NULL
The set with maximum number of elements is
The length of this set is 0.
So 0 will get added to list.
Now printing maximum of list [2, 1, 0] = 2
Hence the answer.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
def returnAnswer(a):
n = len(a)
length = 0
arr = []
for i in range(0, n):
arr.append(0)
i = 1
while(i<n):
if(a[i] == a[length]):
length += 1
arr[i] = length
i += 1
else:
if(length != 0):
length = arr[length-1]
else:
arr[i] = 0
i += 1
return max(arr)
t = int(raw_input())
while t>0:
t -= 1
n = int(raw_input())
a = list(map(int, raw_input().split()))
print(returnAnswer(a))
``` | vfc_32801 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "1\n4\n1 2 1 2\n\nSAMPLE",
"output": "2",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1\n4\n1 2 1 2\n\nTAMPLE",
"output": "2\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | costly-phone-number-december-easy-easy-medium | Solve the following coding problem using the programming language python:
A cell phone company is trying out its new model of cell phone. Here's how its structure is:
The keypad has 11 buttons corresponding to digits from 0 to 9 and one additional button called Add. After pressing any button from 0 to 9, the corresponding digit appears on the screen. The Add button replaces the last two digits appearing on the screen with their sum taken modulo 10. (See sample test for more clarity). If there are less than two digits currently on the screen, pressing Add does nothing.
Each button has a non-negative cost of pressing associated with it. The cost of pressing Add button is always 0. Given the cost of pressing each button and the target phone number, find the minimum cost of feeding that number into the phone screen using a sequence of button presses.
INPUT
The first line of input file consists of an integer T, which indicates the number of test cases. Then the description of T test cases follow. Each test case is described by 3 lines. The first of them contains 10 space separated integers, denoting the cost of pressing buttons from 0 to 9. The second line contains the length of the target phone number. The third line contains the target phone number S itself.
OUTPUT
Print the minimum cost of feeding the phone screen with the target number for each test case in a separate line.
CONSTRAINTS
1 β€ T β€ 1000
0 β€ Cost of any button β€ 1000
1 β€ |S|β€ 1000
SAMPLE INPUT
3
3 2 2 3 2 1 1 2 3 3
3
171
3 2 3 1 1 1 1 3 1 2
2
16
3 3 3 1 3 1 1 2 3 2
2
43
SAMPLE OUTPUT
6
3
4
Explanation
For Test Case 1: Button sequence with cost in brackets: Press 6 (1) -> Press 5 (1) -> Press "Add" (0) -> Press 7 (2) -> Press 6 (1) -> Press 5 (1)-> Press "Add" (0).
Total Cost = 1 + 1 + 0 + 2 + 1 + 1 + 0 = 6.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
for _ in range(input()):
total_cost = map(int, raw_input().split())
for i in range(10):
for j in range(1, 10):
for k in range(j, 10):
total_cost[(j + k) % 10] = min(total_cost[(j + k) % 10], total_cost[j]+total_cost[k])
input()
Result = 0
inputs = raw_input()
for v in inputs:
Result += total_cost[int(v)]
print Result
``` | vfc_32805 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3\n3 2 2 3 2 1 1 2 3 3 \n3\n171\n3 2 3 1 1 1 1 3 1 2 \n2\n16\n3 3 3 1 3 1 1 2 3 2 \n2\n43\n\nSAMPLE",
"output": "6\n3\n4\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n3 2 2 1 1 1 2 3 1 2 \n1\n3\n1 2 3 2 1 2 2 3 1 1 \n2\n98\n2 1 3 3 1 2 3 1 3 3 \n1\n1",
"output": "1\n2\n1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n7 3 2 1 2 4 7 7 5 9 \n10\n1385294192\n3 6 1 2 7 3 10 7 2 8 \n7\n8129080\n1 5 7 3 1 1 9 9 8 10 \n6\n540120",
"output": "26\n20\n12\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n3 2 2 1 1 1 2 3 1 2 \n1\n3\n1 2 3 2 1 2 2 3 1 1 \n2\n98\n2 1 3 3 1 2 3 1 3 0 \n1\n1",
"output": "1\n2\n0\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n7 3 2 1 2 4 7 7 5 6 \n10\n1385294192\n3 6 1 2 7 3 10 7 2 8 \n7\n8129080\n1 5 7 3 1 1 9 9 8 10 \n6\n540120",
"output": "26\n20\n12\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | find-the-ring | Solve the following coding problem using the programming language python:
There is a new magician in town. His trick is known as "Find the Ring".
He puts 3 glasses at 3 spots on the table, labeling them as 0, 1 and 2. Now, he hides a ring under one of the glasses. The glasses are opaque and placed upside down, so that the ring is not visible to the audience.
Now, he begins to make certain swaps in between adjacent glasses, i.e. the glass at position 0 can be swapped with that at position 1, and the glass at position 2 can be swapped with glass at 1.
Assuming that all swaps are done randomly with equal probability of 50%, you have to find index of the glass that is most likely to have the ring, at the end. In case of a tie, choose the one with lower index.
Assume that the glass containing the ring was swapped exactly N times.
Input:
The first line contains an integer T, denoting the number of test cases. Each of the following T lines contain two space separated integers, index and N. index is index of glass that initially contains the ring and N is the total number of swaps involving the glass with ring.
Output:
For, each of the T test cases, output the corresponding answer in a new line.
Constraints:
1 β€ T β€ 100
0 β€ index β€ 2
0 β€ N β€ 10000
SAMPLE INPUT
3
1 1
0 1
2 2
SAMPLE OUTPUT
0
1
0
Explanation
Case 1:
The ring is at index 1. There is only one swap to be made. The probability of ring ending up at 0 is .5, at 1 is 0 and at 2 is also .5
So, we have a tie between positions 0 and 2. We must choose the lower index, i.e. 0
Case 2:
The ring is at index 0. There is only one swap to be made. There is also only one choice. The probability of ring ending up at 0 is 0, at 1 is 1 and at 2 is 0.
The maximum probability occurs at index 1.
Case 3:
The ring is situated at index 2. There are 2 swaps to be made.
So, we can make following swaps: {2 -> 1 -> 0} or {2 -> 1 -> 2}
Hence, the probability of ring ending up at 0 is .5, at 1 is 0 and at 2 is .5
Again, there is a tie between 0 and 2, and we choose 0, i.e. the lower index.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
n=int(raw_input())
while n:
t=(raw_input())
t=t.split(' ')
t[0]=int(t[0])
t[1]=int(t[1])
if t[1]==0:
print t[0]
elif t[1]%2==0:
if t[0]==1:
print "1"
else :
print '0'
else :
if t[0]==1:
print "0"
else :
print '1'
n-=1
``` | vfc_32809 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3\n1 1\n0 1\n2 2\n\nSAMPLE",
"output": "0\n1\n0\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "100\n0 5619\n0 3827\n2 1722\n2 909\n2 7032\n0 832\n1 7280\n2 5860\n0 1391\n2 5694\n0 109\n2 4742\n0 5886\n2 9924\n0 3544\n1 9460\n1 7759\n0 2056\n0 539\n0 861\n2 9947\n1 4501\n2 6755\n1 2787\n0 8049\n2 7526\n0 6094\n0 7932\n0 1551\n0 5864\n1 3707\n1 8735\n0 3911\n1 4988\n0 2173\n1 2851\n2 5676\n2 8498\n2 3784\n1 771\n2 4994\n0 1470\n0 3378\n0 4971\n0 4640\n0 5334\n0 4083\n1 2171\n2 1745\n1 1041\n1 3524\n0 8243\n0 4878\n0 3369\n0 7491\n2 5861\n1 3749\n0 3193\n1 13\n1 1686\n1 5653\n1 7632\n1 963\n1 8205\n0 8303\n0 6908\n1 4725\n2 674\n2 1654\n0 3055\n2 3193\n0 1007\n2 895\n2 5965\n1 8260\n0 6274\n2 7393\n0 6091\n2 6863\n2 7961\n0 1286\n0 5889\n1 835\n2 5732\n0 5528\n0 4617\n1 9309\n0 5141\n2 6916\n0 4253\n1 5386\n2 4930\n1 489\n2 9788\n2 9675\n2 8082\n1 5514\n1 324\n1 8274\n1 4348",
"output": "1\n1\n0\n1\n0\n0\n1\n0\n1\n0\n1\n0\n0\n0\n0\n1\n0\n0\n1\n1\n1\n0\n1\n0\n1\n0\n0\n0\n1\n0\n0\n0\n1\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n1\n0\n1\n0\n1\n1\n0\n1\n1\n1\n0\n1\n0\n1\n0\n1\n0\n0\n1\n0\n0\n0\n0\n1\n1\n1\n1\n1\n1\n0\n1\n1\n1\n1\n0\n1\n0\n0\n0\n1\n0\n1\n0\n1\n1\n0\n0\n0\n1\n0\n1\n1\n1\n1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "100\n2 6903\n0 9273\n1 6099\n2 3323\n2 6680\n1 8557\n0 6595\n2 7387\n2 1409\n0 4773\n2 2108\n1 684\n2 46\n1 762\n0 5927\n1 7006\n1 265\n1 3876\n2 2079\n2 9379\n2 1358\n0 6256\n2 9892\n2 6193\n0 8317\n0 1243\n2 9461\n2 9804\n2 1431\n2 165\n0 3812\n2 6127\n2 4624\n0 6399\n1 5910\n1 3252\n0 1163\n0 988\n2 240\n1 8599\n2 1313\n1 5635\n2 7562\n1 1318\n1 6666\n2 2154\n0 7375\n1 7507\n0 3473\n1 4684\n0 4075\n0 2720\n2 4931\n1 3316\n1 379\n2 3009\n2 512\n1 4063\n0 6464\n0 173\n2 2281\n0 4158\n1 972\n0 2637\n0 8335\n2 4625\n0 6866\n1 9707\n0 6874\n1 1948\n1 8921\n0 5332\n1 2159\n2 8933\n1 2410\n0 4870\n0 6792\n0 9315\n0 6285\n1 1026\n1 3712\n2 1472\n2 3680\n0 8394\n0 8420\n2 712\n1 6175\n2 8131\n1 8930\n2 2296\n2 7324\n1 2772\n0 3869\n2 6815\n0 7112\n0 5157\n1 9142\n0 6239\n1 8503\n1 4129",
"output": "1\n1\n0\n1\n0\n0\n1\n1\n1\n1\n0\n1\n0\n1\n1\n1\n0\n1\n1\n1\n0\n0\n0\n1\n1\n1\n1\n0\n1\n1\n0\n1\n0\n1\n1\n1\n1\n0\n0\n0\n1\n0\n0\n1\n1\n0\n1\n0\n1\n1\n1\n0\n1\n1\n0\n1\n0\n0\n0\n1\n1\n0\n1\n1\n1\n1\n0\n0\n0\n1\n0\n0\n0\n1\n1\n0\n0\n1\n1\n1\n1\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n1\n1\n1\n0\n1\n1\n1\n0\n0\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "100\n0 5619\n0 3827\n2 1722\n2 909\n2 7032\n0 832\n1 7280\n2 5860\n0 1391\n2 5694\n0 109\n2 4742\n0 5886\n2 9924\n0 3544\n1 9460\n1 7759\n0 2056\n0 539\n0 861\n2 9947\n1 4501\n2 6755\n1 2787\n0 8049\n2 7526\n0 6094\n0 7932\n0 1551\n0 5864\n1 3707\n1 8735\n0 3911\n1 4988\n0 2173\n1 2851\n2 5676\n2 8498\n2 3784\n1 771\n2 4994\n0 1470\n0 3378\n0 4971\n0 4640\n0 5334\n0 4083\n1 2171\n2 1745\n1 1041\n1 3524\n0 8243\n0 4878\n0 3369\n0 7491\n2 5861\n1 3749\n0 3193\n1 13\n1 1686\n1 5653\n1 7632\n1 963\n1 8205\n0 8303\n0 6908\n1 4725\n2 674\n2 1654\n0 3055\n2 3193\n0 1007\n2 895\n2 5965\n1 8260\n0 6274\n2 7393\n0 6091\n2 6863\n2 7961\n0 1286\n0 5889\n1 835\n2 5732\n0 5528\n0 4617\n1 13465\n0 5141\n2 6916\n0 4253\n1 5386\n2 4930\n1 489\n2 9788\n2 9675\n2 8082\n1 5514\n1 324\n1 8274\n1 4348",
"output": "1\n1\n0\n1\n0\n0\n1\n0\n1\n0\n1\n0\n0\n0\n0\n1\n0\n0\n1\n1\n1\n0\n1\n0\n1\n0\n0\n0\n1\n0\n0\n0\n1\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n1\n0\n1\n0\n1\n1\n0\n1\n1\n1\n0\n1\n0\n1\n0\n1\n0\n0\n1\n0\n0\n0\n0\n1\n1\n1\n1\n1\n1\n0\n1\n1\n1\n1\n0\n1\n0\n0\n0\n1\n0\n1\n0\n1\n1\n0\n0\n0\n1\n0\n1\n1\n1\n1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "100\n2 6903\n0 9273\n1 6099\n2 3323\n2 6680\n1 8557\n0 6595\n2 7387\n2 1409\n0 4773\n2 2108\n1 684\n2 46\n1 762\n0 5927\n1 7006\n1 265\n1 3876\n2 2079\n2 9379\n2 1358\n0 6256\n2 9892\n2 6193\n0 8317\n0 1243\n2 9461\n2 9804\n2 1431\n2 165\n0 3812\n2 6127\n2 4624\n0 9194\n1 5910\n1 3252\n0 1163\n0 988\n2 240\n1 8599\n2 1313\n1 5635\n2 7562\n1 1318\n1 6666\n2 2154\n0 7375\n1 7507\n0 3473\n1 4684\n0 4075\n0 2720\n2 4931\n1 3316\n1 379\n2 3009\n2 512\n1 4063\n0 6464\n0 173\n2 2281\n0 4158\n1 972\n0 2637\n0 8335\n2 4625\n0 6866\n1 9707\n0 6874\n1 1948\n1 8921\n0 5332\n1 2159\n2 8933\n1 2410\n0 4870\n0 6792\n0 9315\n0 6285\n1 1026\n1 3712\n2 1472\n2 3680\n0 8394\n0 8420\n2 712\n1 6175\n2 8131\n1 8930\n2 2296\n2 7324\n1 2772\n0 3869\n2 6815\n0 7112\n0 5157\n1 9142\n0 6239\n1 8503\n1 4129",
"output": "1\n1\n0\n1\n0\n0\n1\n1\n1\n1\n0\n1\n0\n1\n1\n1\n0\n1\n1\n1\n0\n0\n0\n1\n1\n1\n1\n0\n1\n1\n0\n1\n0\n0\n1\n1\n1\n0\n0\n0\n1\n0\n0\n1\n1\n0\n1\n0\n1\n1\n1\n0\n1\n1\n0\n1\n0\n0\n0\n1\n1\n0\n1\n1\n1\n1\n0\n0\n0\n1\n0\n0\n0\n1\n1\n0\n0\n1\n1\n1\n1\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n1\n1\n1\n0\n1\n1\n1\n0\n0\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | integers-only-allowed | Solve the following coding problem using the programming language python:
You have a polygon described by coordinates of its vertices. Can you find how many points with integer coordinates lay strictly inside it?
Input
The first line contains an integer N - number of vertices.
Next N lines contain 2 space-separated integers each and describe polygon vertices in clockwise order. Note that polygon can be convex and non-convex as well.
Output
Output one integer - answer for the problem
Constraints
3 β€ N β€ 1000
|xi|, |yi| β€ 10^6
SAMPLE INPUT
4
0 0
0 2
2 2
2 0
SAMPLE OUTPUT
1
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
from fractions import gcd
n = input()
vertices = []
for i in range(n):
vertices.append(map(int, raw_input().split()))
vertices.append(vertices[0])
b = 0
for i in range(n):
dx = abs(vertices[i + 1][0] - vertices[i][0])
dy = abs(vertices[i + 1][1] - vertices[i][1])
b += gcd(dx, dy)
b = max(0, b)
area = 0
for i in range(n):
area += (vertices[i][0] + vertices[i + 1][0]) * \
(vertices[i][1] - vertices[i + 1][1])
area /= 2.0
ans = area + 1 - b / 2.0
print int(ans)
``` | vfc_32813 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4\n0 0\n0 2\n2 2\n2 0\n\nSAMPLE",
"output": "1",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n-728000 477000\n667000 186000\n667000 151000\n-595000 -679000\n-298000 -132000",
"output": "601001979001",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n-728000 477000\n667000 186000\n667000 151000\n-1101635 -679000\n-298000 -132000",
"output": "529313127996\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4\n0 0\n0 2\n2 2\n4 0\n\nSAMPLE",
"output": "2\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n-728000 477000\n667000 49657\n667000 151000\n-1101635 -679000\n-298000 -132000",
"output": "434213853824\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4\n0 0\n0 2\n2 2\n4 1\n\nSAMPLE",
"output": "3\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | maxi-and-dumpy | Solve the following coding problem using the programming language python:
Maxi and Dumpy are playing with numbers. Maxi throws a ball up in the air and shouts a random number. Dumpy notes down this number on a piece of paper. They repeat this N times.
But Dumpy just found out that there are many repetitive numbers in the list. He doesn't like it. He asks you to filter the list, remove the repetition and keep only the first occurrence of each number.
Input:
First line contains an integer N, Next line contains N space separated integers where Ai is the integer that Maxi shouts in the i'th round.
Output:
Print the final space-separated list of numbers.
Constraints:
1 β€ N β€ 10^5
0 β€ Ai β€ 10^6
SAMPLE INPUT
6
2 1 5 3 2 5
SAMPLE OUTPUT
2 1 5 3
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
n=input()
num=raw_input()
num=num.split(" ")
num=map(int, num)
dum=[]
for i in num:
if(i not in dum):
dum.append(i)
for i in dum:
print(i),
``` | vfc_32817 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "6\n2 1 5 3 2 5\n\nSAMPLE",
"output": "2 1 5 3\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "10000\n5617 9114 7223 8085 7207 6665 9614 9508 8351 8579 7638 9973 6310 9941 7237 6074 9460 6574 5828 9264 9789 9632 7433 8571 9218 8470 7138 9877 5933 6865 6071 5198 5978 6942 6931 6833 8607 6544 9989 6958 8771 7627 5579 5081 6216 6463 9802 5676 6685 5630 8587 6474 8909 6020 5044 8127 8138 5830 8004 7719 7695 9075 7916 8673 9664 8495 9154 8271 8687 9143 8876 6105 5418 9455 6186 6633 9566 9636 5957 6250 8913 8192 7724 7822 9212 6416 9597 7349 7246 7601 5068 9940 5324 6632 7261 9988 8774 6414 6906 7461 9205 9430 8566 9622 7533 8399 9903 7098 6683 9508 8348 9244 7699 9720 5714 5559 6135 5311 6556 8381 6560 5271 6969 6883 6903 9229 5519 9325 9291 6073 5433 7144 5503 7647 5414 8035 9694 5317 8781 6376 8472 7129 9268 6171 5497 9981 6730 6632 5292 8285 8660 6851 7204 9277 7382 7755 7154 6549 7079 6445 7621 7512 7236 6772 5159 7650 9807 8500 7966 7236 9876 5086 8013 9144 6257 8509 7773 6635 5141 8064 8568 7449 8563 5772 6725 9593 8526 8879 6142 5605 8971 8763 6765 6207 9182 5572 8857 8989 9072 5471 6224 7596 5557 9237 5387 5462 6394 8160 7096 5182 9872 9312 7631 7083 5083 8004 6676 7257 5530 7817 6510 9501 5228 8275 9356 9410 7495 6861 7046 5214 7331 6918 6458 6536 9803 5493 5645 6196 8652 6389 6378 7172 5701 7657 9254 9432 5660 9578 6689 6190 7395 8199 9339 6270 5122 8695 5680 6264 5556 6374 6478 6535 8292 6584 6718 6742 7076 7363 7938 9376 7400 7964 6548 8101 5621 9450 7532 9929 9027 7869 6119 5070 6067 9106 6340 9837 7801 7019 6101 7004 7041 6227 7187 5332 7810 8905 7074 8534 9916 8660 7910 7316 6624 9458 9064 5893 7555 5244 5821 6582 8113 5588 6652 7828 8341 7991 7664 9790 8658 7413 6794 5699 7287 7628 9679 8745 5181 5401 7279 5096 9061 5189 6060 9333 8295 8772 8873 5850 9016 8342 6080 5776 7578 7731 8604 5919 9370 9916 5708 8028 7328 6150 7375 9615 8778 5701 8360 8958 6102 9287 7702 8810 9476 7410 6791 6419 6181 5664 7268 8845 9006 6996 9621 5231 9727 8224 6150 7745 8140 6858 9421 9116 8007 6795 7379 5433 7496 9387 8039 7246 8674 5741 6056 6798 6798 6494 8216 7979 7158 9132 5472 9811 6128 5092 5042 9502 6964 6192 7247 8752 6697 6667 7867 8352 7110 5246 7433 8254 9632 5471 5500 6954 6212 5203 8751 8010 6697 6967 9637 7503 9747 5108 7314 5875 8848 6004 9025 5812 5843 6271 9564 7540 6586 6079 9540 8696 9972 6973 6950 8252 7444 6098 5206 7303 6301 8957 8961 7998 9572 8597 5500 9319 7353 6462 8841 9849 7465 7866 5661 8308 7785 8873 9496 9371 9951 9036 6715 8571 9657 8665 6823 7100 9762 7029 8051 9711 9633 7012 7708 9205 9257 6856 7171 6610 8318 9660 6459 9431 6174 5768 7739 8958 9640 5883 6977 8239 9919 8691 6810 9575 6004 8633 5323 5766 9310 8374 5476 8943 5386 6832 6795 9642 8688 7614 9900 5654 7274 5006 5084 8448 9422 6471 6054 7710 7353 8030 5949 5920 5369 6407 9143 6373 8688 8114 5786 6645 6488 9910 5588 5521 5390 6031 8811 7726 8645 7359 8380 9567 6013 7112 6662 5434 7230 7716 8144 9583 9394 7740 9151 9763 7795 6941 9783 6482 5055 9217 8127 6542 9127 7363 5711 9517 8393 9522 7243 5686 5529 9271 8900 6541 6382 5562 6975 8612 6926 8767 6843 6319 6507 9642 9730 9301 6583 8161 9431 6637 7378 6206 6827 5153 8569 7538 8318 5610 5708 9209 9943 9885 8479 8843 6426 8509 8053 7049 5769 9979 9463 6260 9946 5970 5902 9675 8919 7484 6484 6998 7769 8861 8204 9596 7662 5420 5782 5979 6030 5138 5188 9621 5023 7315 8464 5096 5824 6517 5793 5241 5143 5256 6501 5089 9873 6050 9764 7440 7182 9895 9437 9951 8756 6289 8195 5066 6709 7625 6045 6386 6411 6232 6007 5082 7195 8118 5178 8018 8283 5970 6907 8426 9874 8407 8514 9747 9457 6926 7186 5287 6821 6623 5238 9225 7912 7081 9290 8268 9706 8983 9654 9765 8863 9309 9847 6057 7427 8672 9075 5709 8290 5982 7783 8164 8037 9945 7910 6142 6870 5096 6429 7339 5367 5315 5211 6927 7396 8149 5195 5750 7132 8497 5515 5994 7805 5361 7051 8880 9033 9774 8237 7323 9404 6019 9135 7440 5964 7045 7230 6482 5789 8658 7468 9804 7621 7679 6730 5016 5828 5573 5766 7960 7717 9928 7602 9170 8937 9653 8050 7970 9427 6286 8941 7478 5953 8076 9918 5565 8768 5796 7046 9557 8102 9514 9360 5722 5841 9738 5738 5317 8959 5152 8277 6676 8728 5878 5846 7665 9179 7543 5635 7253 8829 8224 9731 9782 6299 8297 5347 5067 9093 6041 8272 7194 9203 6280 7916 8692 9666 7302 9009 8624 6102 7285 8948 9829 6811 8441 7494 5990 5984 6776 6891 8461 10000 6622 6891 9947 9919 5886 8662 9011 5574 6933 9853 9777 8213 7769 8468 7878 8719 6125 5150 9821 8410 7746 9650 8869 6187 7143 8506 5819 8919 5397 9280 7567 7018 9819 7513 5585 5704 6175 9596 6278 8108 9449 9703 9968 5866 6819 6494 9585 7943 5292 9405 5001 8038 7703 7517 9224 9846 6023 8691 7413 5068 6618 9979 5734 6437 6140 6318 5789 7315 5914 5715 9070 9010 5417 7686 8524 5884 9180 8108 7475 9472 6161 7475 7510 8864 8640 5382 7357 9663 9072 8418 8379 5690 7045 9112 5775 8185 5430 6563 9147 9992 7278 8217 7650 6343 5903 6173 5874 8731 7929 8349 6851 9090 9472 9361 6602 8112 8390 7607 6423 6110 6024 9801 5448 8069 8913 6223 9901 9343 6434 9048 7983 7359 7265 5632 8702 6816 6805 8224 9195 9734 6572 6046 7472 9692 5407 7722 7803 7445 5328 9226 8555 10000 7675 9003 6717 6588 8873 6618 9579 5307 5666 7561 7666 6579 6841 5015 7043 8646 8239 6238 7028 8459 7284 8148 8150 6338 9518 9601 8783 9846 8827 5985 8494 5149 8636 5210 6737 7509 6828 9963 6463 6141 6172 9129 7720 8013 9144 8410 6659 6030 9648 7335 9489 6931 5483 7639 6917 8649 5888 5700 8494 8362 5333 5636 8511 8968 5846 8896 5125 6321 8859 6588 7462 5031 9364 8830 8044 7156 7240 8351 8186 5535 5686 7674 6114 9817 8961 8031 8465 9848 7379 5607 8210 7711 9891 5369 5327 5736 9265 5452 5705 8123 5687 8167 6802 5051 5645 9845 7207 6532 6844 9040 7067 6177 6714 6829 9642 9323 9860 6755 7819 7239 6010 9677 9950 5900 5046 8925 6636 7958 9376 7341 6081 8711 9156 6531 8762 8449 5024 9617 9981 6867 8657 5696 8044 9019 7525 6334 6989 6033 8088 9808 8271 9098 8132 6869 9998 6826 5793 5282 9784 8817 7623 9513 7528 5427 6043 9938 8875 6067 8203 7504 6582 6859 6847 8274 9526 8020 9607 6515 9052 7695 9970 5971 5441 8102 7840 5438 8576 7281 5720 8359 6098 6990 6520 7274 7417 6211 5860 6292 7277 9062 7443 7507 9569 9290 5780 9095 7310 5387 5609 6362 6730 5579 7333 7171 7329 8820 6257 5905 6101 6976 7912 5846 7614 9431 6768 5031 9290 7627 9970 6567 5337 7413 7721 9906 5351 8501 7649 7661 7536 8258 7670 7914 7485 8651 5085 9814 6119 9989 9366 5867 5613 7278 6713 8227 5357 8481 8258 9646 9756 6876 9861 8741 7937 7582 8647 8288 9731 6295 9596 7267 8201 7266 5181 5685 9565 8913 9147 9331 7550 8513 5198 8163 9438 6911 6390 9795 9040 8296 8089 7443 5171 6597 6184 8108 9179 8478 6395 7557 8421 9639 8472 6622 5553 7300 5955 5118 6213 5101 9449 7411 8614 9647 5574 8052 5206 6964 6494 7893 8908 9583 5336 9079 6180 6520 5834 9006 8646 5877 6563 7067 5516 8683 8688 6069 5983 8291 9835 5844 8392 7931 8255 7005 7578 8829 8705 6431 9441 5199 9324 8348 8429 9660 6075 8257 9828 6909 5911 8473 6434 6122 9188 6950 9804 7876 6667 5787 9814 6501 6630 8206 9432 9885 8859 5658 7361 7563 5737 6802 6410 5061 8798 8487 8369 9872 6743 8196 5429 7654 5317 6862 8775 9505 7460 8579 6028 7774 9366 5842 9275 9644 9048 7355 9528 6554 6661 6889 9117 7397 7339 9175 7458 9784 7661 5826 9656 9404 7670 8733 5706 7987 9243 9481 6140 5350 6708 7168 8124 9721 8010 6047 9365 5705 8402 8893 7259 5063 9430 5024 7460 5416 9199 9917 5200 5508 9391 8504 8560 7061 7237 9265 8696 5127 7394 9836 5477 7749 5651 7249 7470 8661 8296 6835 8014 6698 9375 8921 5409 7453 7593 6516 7869 5439 5081 8069 5947 9472 6573 9506 5181 7457 7419 8877 6232 9813 7361 5357 7562 8012 7606 8680 5320 5902 5514 6982 6248 8537 5902 5305 5990 8495 6821 8858 8934 6902 5575 8528 5022 7147 8034 5203 8252 5453 7728 9484 8914 5088 9841 5123 8100 7447 8803 7068 6997 7965 9049 6893 6502 9951 5846 6139 7094 7666 9997 9675 8216 5572 8203 8237 6367 9885 8440 9619 8986 9815 9103 7900 9903 7592 6671 6651 8687 9121 7366 5684 7086 6415 6225 7235 5014 7070 8374 7108 8384 8371 5431 5248 7591 8634 8485 7605 7167 5572 7224 6153 5387 9974 7700 8938 6214 9371 9237 9900 8492 6603 5584 9225 8018 5456 6460 6680 6174 8482 7435 8206 5501 7866 8454 8092 5147 6938 5697 7314 6158 6568 8466 5193 5190 6166 9131 6404 9185 7016 6304 7676 8618 5535 5549 5284 9639 5657 6963 5813 9139 9398 9019 9640 5912 6121 6380 6059 6707 7076 8372 7865 7292 6838 8058 6130 8004 5837 7534 7189 6500 7485 8513 8766 6668 7710 9050 6307 8367 9661 7120 7506 7707 9787 7146 8618 9556 8525 9677 6262 9249 8049 9127 5189 8535 5832 6319 5187 5317 7501 6023 5465 9986 9536 9231 6654 5893 6928 6609 9260 6589 7377 5413 7943 7164 6207 6561 6719 8380 9886 6629 7629 6582 9404 6466 5117 5236 6433 5303 9200 8933 6326 9665 7567 9510 7543 7868 9051 9471 9477 8310 9708 6853 7371 7651 7665 8578 7860 8032 6957 7745 9661 8234 7975 9064 8347 6740 7948 9780 7043 5796 8713 7017 5460 6279 5174 8003 7795 7873 6122 7272 9831 5830 7773 7202 8480 5437 5779 6340 7117 6384 7733 6777 9618 5708 9489 7965 7447 7437 6392 8138 8232 5105 8802 7340 5032 7624 8991 7827 5497 5113 8746 5327 5943 6519 6177 8071 5604 6956 8058 7720 6988 5791 8145 5253 5146 7634 6866 6241 8719 8258 8027 5599 8362 6829 6587 7042 8101 5578 8516 7245 9339 5910 6220 8929 6077 7397 7000 6680 8000 5058 8048 9988 9496 6193 5241 9642 7475 7106 5883 9842 5364 8910 5440 7374 9386 7027 8063 6135 6252 6579 8380 5591 6137 9600 8168 7214 6996 5167 7542 8644 8873 5590 8632 8369 5431 8872 6659 6554 9626 7542 6395 9990 5099 6835 6011 8133 7510 9074 9268 8762 9301 6295 8000 5438 9543 6168 7652 6539 9983 5193 8831 7503 9431 7462 5872 9861 9982 7530 6415 9608 8720 6458 8246 7467 8293 9257 5600 9450 6979 8515 8212 6280 9810 9860 5366 9353 9675 8017 9539 8306 6858 8370 5809 9937 9480 6680 8446 9462 7858 8508 9070 6578 9966 7315 7692 6906 5220 8292 6356 7198 5455 8216 8478 8913 8075 8843 8265 6398 5508 6452 9704 6014 8470 9160 5951 7949 9488 8044 7411 7346 6552 5128 7572 6518 7443 8912 8424 7663 7203 9780 9861 6306 7995 6986 5218 9718 9477 7131 9764 9985 8583 8116 9647 5701 7276 9246 8650 6764 7290 9708 7758 8842 9836 8977 5359 7279 7889 7431 8590 8740 7210 7098 5045 8853 9084 8911 7219 8561 6042 6983 7194 9625 5099 5489 5326 6022 9735 7623 6434 7024 7331 7839 5866 7167 5464 9873 8094 7001 7303 6684 5740 8161 7430 9433 7014 6514 6992 9233 8723 8034 9864 9565 6307 9963 5054 5281 9633 9788 7904 6066 5460 8883 8905 6326 6050 9369 6198 7792 6370 7149 9475 5758 5310 5553 8839 7324 7066 5831 5205 9437 8865 5069 7649 8820 8680 7703 9100 8312 6139 7004 8026 6599 5886 6931 6572 5584 9948 6418 8375 6318 8567 6498 5723 8877 7051 8210 9849 7765 9040 5054 7201 6553 8771 8498 5372 7451 6201 9472 9411 5987 5124 7437 6234 6010 8016 7806 5241 7964 9224 8616 7929 7791 8762 7300 5316 9461 5510 5165 7225 9550 5219 8074 9750 7638 6572 5122 8736 6421 8242 8147 6056 8366 9231 7289 8023 5895 8743 8264 8858 7966 5528 5435 9405 9290 7735 8368 8751 6893 8533 9624 6442 7399 7698 9840 5037 7918 9962 8773 7986 8204 5567 9042 6570 8446 6331 9593 9341 5073 6505 8199 6687 7033 7282 9740 9971 8665 8108 7369 5557 5288 6993 5647 7687 8338 5487 6372 9904 5449 5144 7890 7301 9359 6931 7519 7805 6910 7111 7146 5631 7264 8992 7318 9296 6274 5705 9267 8586 8813 6636 9143 7749 7276 9790 5436 9262 5277 6807 9166 9374 5599 7055 6675 8606 7634 9194 6411 9544 9953 7205 5174 7216 6197 6140 5160 6118 6845 9427 8352 9305 9710 7495 7054 5634 5933 6137 9896 6210 6592 7710 9232 5839 9765 5907 9445 7399 8749 5856 5590 7349 6709 9412 9565 6553 5552 9725 6319 6044 7800 9671 5349 6158 7166 6051 5440 8099 5836 5336 7957 7428 8045 7189 8267 6458 6744 6360 7504 9141 5864 6742 6490 7572 6154 9703 9125 6706 8076 5444 7750 5875 5115 6747 5681 5929 6445 6120 7676 7281 5104 5633 8356 6797 6470 5271 8254 8214 6630 9406 7355 6142 6148 7492 8714 7302 7195 6487 7656 5270 5579 9053 9793 9342 5800 9122 5271 5893 5242 7947 6821 8993 7228 8825 5790 8698 9096 7692 5560 9374 7098 7914 5515 6894 9054 7877 9196 6249 9363 5499 5167 8590 9552 8608 7931 9000 7729 6850 9892 6619 8444 6713 5612 5672 5538 5049 8017 8282 7741 8577 7655 8486 5139 6818 9028 9193 8343 6871 9089 7706 7370 9256 9943 6922 7863 7874 5922 9240 8372 5814 5859 6816 6175 5118 6135 5361 5167 9152 8642 6556 6377 9945 8690 6515 5411 7717 9356 8754 9588 8445 5107 6958 7700 5050 8880 9211 6572 8450 8451 9944 9263 7958 6759 9086 8076 6542 9446 6891 9342 6736 8446 5719 6681 5784 5882 5740 8501 5237 9494 6737 8682 9601 8695 5030 8299 6223 7889 9871 9672 9988 9814 7583 7945 5221 5317 6021 5411 9763 7911 9753 5147 5005 9120 5476 5789 5001 6216 9289 8886 9357 9674 6216 8958 8368 9893 5904 8239 7782 5775 6559 7769 9237 7790 5714 8106 8106 5383 7165 6517 6942 6918 6663 6947 9685 5787 6383 9686 7002 9320 7220 6359 8994 8436 8965 7362 6977 9869 9248 9758 9291 9455 6175 7176 7244 5537 8929 8998 5920 6094 5515 6509 8011 5826 8456 6344 6612 9839 6030 7262 9159 6898 8621 8152 8982 6234 9162 5958 9750 7058 5716 9041 6512 5539 9865 7404 6076 8794 6402 5644 9887 5565 7153 6546 5038 9256 7890 5298 7743 7568 7560 5549 8114 9829 8701 7096 9711 6511 8054 9461 7216 7418 7150 8728 7957 7014 6132 7681 5808 6182 8324 9343 6747 9125 9537 6785 8381 6075 5731 6123 7291 8291 5320 5405 6768 7669 7500 6478 9180 5554 9587 5044 7971 6736 8772 9576 8750 8552 7256 8206 8382 9228 6196 5128 8353 5733 5561 5381 6807 6291 5152 7746 8230 5472 8150 8645 8141 5650 8771 5969 9852 8358 6012 7823 5094 8432 6046 7492 5631 8302 5697 9013 7530 6893 7789 9531 6274 6997 8560 6729 6936 8712 9474 8814 9184 7624 7459 5973 6922 9878 6941 6774 8235 6601 9596 6977 5033 5642 9468 9312 7592 8813 8324 8770 5706 9761 6949 5628 6758 5508 7356 8694 9220 5478 7507 7051 8102 8614 6672 5024 8491 8613 6798 5374 8862 5042 7351 7542 9332 6819 6854 5572 9280 8826 9342 9986 8586 9938 9261 5344 5446 5265 7685 9666 5743 8840 5365 7493 7454 7036 7517 5945 9297 7963 9967 8158 6652 7317 5700 9632 7784 7554 8851 7063 6379 6841 5697 8613 6779 9958 8957 7225 5223 5290 5538 9614 9130 5903 7107 6583 7939 8272 6176 5883 6234 6142 9041 6534 7107 9741 9814 9891 5943 8665 6954 5970 5505 6298 9583 7284 9904 7187 9508 5126 7477 8694 9740 6606 9597 5494 6837 6183 8766 6661 7066 8648 6451 6107 5182 8558 9496 9995 7096 9087 7308 7698 5056 7813 8996 9639 8744 8899 5474 8252 7673 7950 6946 6061 8204 5191 6555 8689 6374 5320 8998 7088 8968 5448 6843 7797 7654 6339 6440 9750 9073 8748 7447 9129 6560 6443 7416 8952 8990 7889 5852 6663 9487 6446 7723 6339 6637 7926 8676 6658 8246 7674 8746 5861 8122 9236 8658 5775 9223 5098 9173 8296 8846 6620 7425 9054 6710 9840 8006 5700 6377 8858 6010 9512 5304 7381 5851 5588 5307 8175 7246 8552 5849 9640 9413 7618 8876 8071 7041 8098 6817 6214 6394 5663 7833 7466 8364 8191 5954 6370 8891 7331 8875 8549 6843 7827 5930 6342 8415 6236 9517 5661 8436 9014 8948 6497 6632 7824 9568 8673 9570 5033 8534 5963 5696 6367 8429 7708 8206 9383 7725 5745 5362 6600 9293 5853 9427 5223 5843 7841 5107 9008 7150 8543 8022 6098 5040 9653 7569 8256 6974 7139 8289 5508 8102 7632 5523 5179 5340 8729 8210 6713 8121 7220 8313 7414 6721 6387 7637 7564 7876 6391 6572 5026 9934 8241 9771 9973 6542 7340 8229 8516 8127 5165 7671 9876 7797 6842 5055 6785 9218 6912 8497 7339 9132 5458 9753 9500 6845 6038 7064 8369 7429 7283 7042 7362 5524 6813 5983 7066 7801 7860 9230 5928 6673 5549 5804 8118 7390 9506 9902 6608 6418 7047 8947 9198 6153 7348 7346 6645 8386 9409 5014 9462 5340 7056 5472 9512 7517 6455 6578 8966 7963 9456 9893 9635 5004 9345 7753 7394 8851 6303 7650 8917 6998 6597 6762 8150 8945 9108 9795 5979 7165 9809 9089 7505 5512 9561 7017 6677 9664 7243 5642 6274 6698 5535 5909 5350 9880 7310 6392 7378 8612 9042 9943 5610 5639 6705 8760 8232 9460 7203 7859 6625 5659 6947 7777 6171 5156 8442 7848 8467 5684 8490 9741 6030 7673 5650 5028 6200 7960 6420 7226 5220 5462 7169 5829 6101 7521 8237 7981 6981 5439 9488 7254 9746 5083 5031 5917 5238 8472 7413 8705 7804 9550 8446 8834 5871 7744 8862 7071 5704 5282 7945 9571 9392 5113 5400 5493 6282 7285 7122 8263 6372 6610 9165 6118 6692 9195 5683 5578 6315 6743 7931 9119 6293 6377 6601 7164 9121 9111 7882 8473 9393 5827 8044 8785 9588 7092 7926 5870 8024 8696 7781 8044 8954 6945 9161 9294 9788 8492 9872 6103 5235 7803 8870 6528 7828 5471 7339 5597 9582 8869 7717 7623 8344 9409 5056 7931 5148 6630 7449 8172 8974 8877 6216 7928 9470 9025 7221 7906 7516 5741 9009 7751 7191 6527 7926 5019 6998 5265 9263 5228 9134 6980 6499 6126 6389 6555 9057 5185 6833 5153 8357 5807 7678 8220 7383 5796 5893 9604 8702 8409 8992 7711 9807 6183 9238 7733 9850 9884 6646 9113 8760 9428 9741 5259 5554 9777 5462 8258 9962 7295 8411 8318 6750 9737 5186 9133 5533 6079 7384 9235 8135 6376 5594 7942 7559 8480 5675 7409 7012 7321 5169 5772 6749 9910 6031 7303 9687 5141 9209 9648 6084 6268 6614 7834 6005 6800 5615 5186 6527 7999 9421 9662 8023 8663 7604 5582 7143 6927 6638 9155 7896 6807 8575 8293 5365 8254 5595 5051 8395 8452 8347 8127 9719 9961 5961 5724 5409 5223 5909 6936 6870 8978 5245 9892 7640 7849 5474 8431 8423 5760 7585 6319 7567 9808 9611 7931 8061 8854 6630 5104 7306 9977 8230 7025 8586 7839 6396 8995 8062 7305 9579 9931 9931 9824 9823 7571 6320 8945 6001 9743 9704 7234 6062 5919 7042 9321 7498 8751 8175 7776 8854 9128 7753 7084 6153 6339 9923 7549 8982 7984 8502 8560 6563 8432 8384 5034 9651 9704 8979 5652 8095 7331 6534 7804 8249 7223 7125 9395 5974 8947 7170 9828 8075 8571 6912 9228 8557 5482 5424 7539 7114 7574 6099 8677 6006 8130 8711 9304 6482 6338 8604 9576 8668 5137 7380 5565 7360 8153 8608 6982 7100 5778 5457 5175 7996 6017 8050 6553 6499 7122 9092 8613 9696 8838 5938 9349 6968 9649 8653 7098 9634 7257 6674 6950 6042 7702 6163 7050 9502 9771 9031 6602 9196 9488 5424 7192 9153 7122 8745 5651 7892 7837 9264 6236 5323 8849 5585 7291 7146 7886 9388 6780 8790 9710 8730 9832 6059 9893 5529 5561 8311 9560 5811 7507 7696 9883 8347 6849 5653 7092 6148 8545 8577 9059 8428 8899 7908 7661 9838 5054 5546 7874 5481 7984 6231 9211 7816 7290 7751 8345 6499 9710 6553 5958 7217 7897 9488 9212 8393 8789 6304 8189 5981 8529 7248 9409 6076 8804 7070 5913 8857 6264 7435 9338 9248 8666 7197 5711 9604 8596 7704 6103 8306 7904 5708 9171 5801 8844 8383 7842 7633 8335 9678 8614 6863 6926 8023 7939 5729 5092 7500 8234 5004 9934 6220 9251 8600 7065 9962 8203 5660 7666 7954 7614 5570 7310 6784 5018 6154 8815 6508 8786 7149 6186 6048 7660 6759 9070 9247 6136 7810 6746 9370 7814 5328 9238 5713 8928 6303 5675 5779 5611 8340 7380 8224 7558 9690 5008 7576 9491 7471 7731 6925 9620 8917 7973 7280 5676 5691 6526 6812 8501 6920 9830 9962 7248 9068 5675 9824 9018 6349 5602 9629 8337 6630 7853 9543 9968 6509 5766 9459 8979 8497 6384 7247 6062 8004 8174 6737 8695 8348 7197 5843 5268 5674 5805 6164 9742 6480 5988 7408 6477 5238 7036 8462 6868 8537 6652 6835 8693 7418 9942 7672 9563 9973 8567 5625 7977 6741 6010 6672 5089 6854 7515 9005 7528 6968 5169 5918 7095 9804 8325 8572 5042 5361 5681 5557 7546 7333 6040 6239 8399 9630 7559 7962 9603 6125 8587 7580 6514 8244 7899 6602 5098 9062 9255 7626 9677 8071 8544 6772 7875 6869 8992 6565 5878 8321 5770 8423 5654 6810 8310 9053 5087 5868 5663 9690 6993 9249 5917 8507 7493 7464 8757 7591 5174 8011 8865 9851 6082 7409 6623 7605 9277 9262 9170 8803 7583 8587 7226 6884 9045 5535 9585 9132 5051 5247 8821 7044 8144 8386 9199 9285 5850 6603 5524 6024 8262 9389 5874 7992 6798 6145 5597 9723 5407 8415 8525 7989 7002 9399 9873 9694 8582 9458 8826 8633 8353 7647 5677 6497 6033 8523 5782 5531 8774 6306 6554 7036 5695 6076 5028 6140 7221 9273 5863 6275 6336 8036 9264 6985 7434 7785 6679 6016 5891 5505 9648 9243 6799 8973 5740 6480 6144 5169 7010 9918 6475 7212 6954 5817 8288 5630 6957 5509 8551 6468 6784 8534 9503 9696 5519 6937 6129 5846 6601 7019 9999 6249 9910 6798 8869 9298 6925 5013 9467 8935 9930 9589 9795 5532 9054 8083 9809 6011 7240 7008 6127 7671 5542 5630 7367 9709 6215 7143 9203 6463 7810 9201 7712 7720 9647 5229 5666 6572 5241 8780 9155 8819 7017 8950 7999 6071 5681 7808 5730 7920 8463 6857 5591 7653 6134 6606 7361 5997 7397 5212 7460 5207 9413 8819 6575 9059 9048 5888 9279 7937 9668 8433 6756 6685 6031 9754 7756 6711 6210 8486 8279 9673 8991 8870 7325 5125 9124 8334 9769 6520 8546 7229 5375 7958 9696 5597 5665 8743 6485 9944 5328 6153 7025 7083 6486 8055 6837 9242 8414 8047 6376 6693 7719 5367 9211 8692 9139 6983 7026 8908 7151 5572 9785 7525 7178 8128 6770 7843 5519 8255 6434 5847 9408 8459 7930 9542 5162 8415 8784 8576 6461 8808 8917 7828 7823 8128 5168 6962 8758 7194 9518 5909 6414 7950 7082 8591 6078 8852 5082 5245 5755 6516 6092 8811 8622 9021 8353 8784 7436 5785 6007 7545 9593 9924 9021 7415 6699 9189 8025 9105 5031 6190 5014 6444 7788 5743 8683 7514 8243 8765 7759 8997 8928 8851 7808 7550 6520 6160 9982 7603 6945 5989 8796 5185 9560 7816 7600 9907 5653 9273 9012 5683 5463 9026 7127 6899 8417 5810 9413 6659 8223 7172 9304 5799 9670 7112 6997 6190 6920 6978 7441 8864 6615 6236 7697 9823 7700 8945 9730 8353 8218 8742 9036 7328 6415 6163 9227 9832 5621 8639 5139 7491 5811 9443 8290 5481 6554 8934 5318 7122 5912 7759 9634 6175 7643 7331 5997 5343 6276 9375 8695 9493 8116 7731 5469 9531 7541 9696 8011 6810 8335 8149 7949 7793 7592 6238 6922 7794 5172 7240 9915 9732 8646 9549 9555 6289 6879 9200 6631 8155 8574 8974 6296 5338 6705 6765 9869 7894 6460 7880 8351 8443 9677 6300 9884 7268 6186 6805 8710 6358 7693 8625 9738 9987 6821 7940 9923 8700 7140 6554 5503 9362 9176 5446 9700 9529 7211 9569 7422 7319 6096 9421 9409 5773 5721 9293 6689 6906 9746 5398 6912 6086 7671 5297 9721 9492 8237 9644 6840 9025 9846 5990 8386 9022 6436 8086 8550 8647 6302 9620 9613 6046 9041 9022 5467 9762 6963 7155 5316 5356 6201 7227 6442 8872 6172 6163 7011 9409 9454 8851 7082 9300 9841 5468 8321 6277 7201 6871 8571 8503 6491 8184 8197 9180 5854 8664 8942 7817 9467 7905 8173 5668 8780 8263 8187 9952 8073 5198 8009 7527 7697 5091 5475 7537 5558 8796 7462 6407 9315 9681 8558 9454 6513 6755 8634 7367 5419 6223 8831 9885 9128 5652 9201 7908 7562 7388 7860 5635 7586 5869 6810 8930 9608 7285 6467 8814 9728 7577 5221 9043 5905 8779 8496 7418 9182 5778 8432 8248 7001 5911 6781 6129 5211 5982 7685 7773 7017 5545 7056 8251 5062 8866 7181 8317 9798 7296 7131 9526 9872 7351 7217 5777 9778 9361 6843 7607 5138 5275 5855 5787 9834 7636 5563 5044 7266 8248 7817 9283 7440 8520 7533 6150 6034 9714 9467 5832 7009 6597 9006 5529 7596 6222 9954 6022 5583 5445 8629 5721 9367 8132 6507 9201 9416 5718 9245 6681 8966 5709 9612 6406 9229 5793 6203 8911 5506 5670 9742 6163 5915 7396 5340 8511 8618 8942 8180 9200 9387 6809 8569 8754 8588 8724 7954 8004 9442 5847 8333 7055 6556 7944 7109 9433 8737 8312 6991 7891 8981 5381 7702 8544 7777 8042 5702 6394 6984 8882 9242 5018 9339 6459 8772 7927 5182 5374 5930 8272 6220 9263 5327 6424 5855 7435 9504 9591 5747 6495 6130 8376 6876 8831 5567 9653 6873 6269 9695 7504 5151 8937 7522 9490 9043 9942 6064 9225 5315 5642 7497 6535 8553 6471 7959 9407 8906 7463 7646 8301 7606 8776 5324 9482 6255 5891 7782 6775 5808 7477 9279 5959 5061 5449 9097 9104 5391 8809 6977 5706 9451 8122 5889 8003 8241 8847 7410 7147 9958 8704 9095 6211 6128 8067 5693 7382 7606 7123 9157 8414 8247 7084 8021 8308 7533 7118 6060 6572 5926 6685 7277 9025 8455 8166 7028 6695 5661 8086 7490 9266 6790 6585 5477 6565 8300 9818 8947 5906 6940 8104 7968 5187 5188 5989 7143 6369 8106 6851 7941 7680 7184 8866 6705 5639 5679 7380 7334 9988 9114 9823 9254 9551 5056 8379 6116 8355 6844 5063 7909 8784 6815 5876 7619 5651 5513 8410 7020 8619 8909 8609 9947 6093 7474 5299 6732 8153 6327 7713 6789 5441 7536 9690 9992 6240 8069 9756 8243 9913 8467 6151 7345 5282 5675 8612 5933 6188 7022 6601 8454 5931 5209 7049 5672 6331 5996 7403 8132 7323 5116 9921 6411 6300 9611 5051 7540 6327 9806 5782 9888 8273 5581 5880 8554 9904 9492 8135 9740 5161 8383 8194 9740 8592 8890 5411 8571 9886 6462 6703 7208 5226 5272 8619 6526 9882 8670 7714 9857 7124 7144 9745 5396 6373 9273 7598 9925 8764 9381 9664 7573 7764 6506 7313 6356 5396 7724 9927 5281 7834 5278 6137 8060 5549 8404 8234 9079 5722 9595 8936 7845 6739 7329 6889 6759 6601 9487 6684 9013 8868 9996 6586 5279 6501 8899 6635 5545 5270 5209 9474 8104 9135 5611 6163 9684 7663 9397 7411 8384 8992 9995 9877 9378 7323 5414 9785 7572 8549 5117 6585 7417 5112 8171 6344 5261 5718 7978 5806 5988 6835 5279 9091 9618 9538 5254 7949 7200 8299 5360 9232 5938 5354 7757 8964 6325 8171 7397 8897 6720 7514 5482 7785 6274 7301 9128 6535 8019 5754 7340 9006 6237 7619 6745 5855 7157 5647 8804 8005 8946 7811 7237 8532 8165 8642 6144 9490 6813 8541 7035 8533 6054 7517 6317 7328 8466 9093 8862 6485 9847 9850 5491 6084 6117 7236 6939 6922 6531 9390 9926 5476 7201 5811 7656 5366 9452 8799 8504 6265 7340 5539 8445 7042 6704 8410 9369 5170 7503 6879 5303 7350 5377 9441 7082 6494 5325 7669 8416 6855 7059 6990 7331 9260 7800 8635 8274 5900 7434 5426 7165 9773 9613 9258 5463 6317 7668 9832 5135 5171 5359 5437 6169 5736 9878 8251 7230 8851 5919 9293 5706 7978 6283 6685 5885 9083 5319 7807 9983 7753 8232 5795 6174 7845 5053 6636 7809 6368 5116 7944 6539 9122 7029 6355 9858 5555 9606 5735 9405 9173 5028 5111 5798 6311 6795 6683 9041 7114 9490 7672 8515 6370 7115 8336 9214 5815 8620 7023 7183 8736 8615 7370 7858 9291 8725 6363 9846 6978 7098 7899 6151 5774 8009 6949 5733 8452 7280 9774 9214 5417 6093 7729 6787 8208 9713 9649 7671 8333 5320 9854 7068 8934 7223 8574 6873 9596 9937 6719 6574 5683 8265 6372 6457 9922 6969 7189 8374 7896 5611 7588 8313 6704 8965 8748 8559 7325 8396 6230 5658 8716 6083 7726 6298 6954 9947 8171 6550 9884 8537 6771 9214 6802 8143 5671 6724 5112 7860 8746 8008 8470 9982 9969 8822 7595 8716 7381 9920 5760 7258 5577 8124 8341 6951 8069 8943 6898 6240 9141 5429 8425 5912 9643 5227 9055 8962 5599 7814 5469 9345 9470 7587 9327 9438 6409 6921 6802 7437 6841 6210 9695 7418 9334 6684 8016 7403 5627 9914 7290 8416 8991 5715 9327 7282 9589 7030 6243 5188 8492 6712 9532 7961 9299 7507 6047 9356 8076 7849 5441 9916 7707 5136 5982 7041 5468 8998 8091 9743 7559 5381 8158 5198 9744 7485 7479 9333 8163 7370 8168 6654 9082 6348 9615 7029 8855 9310 5033 6930 7159 5473 5494 8514 9257 5124 5555 9724 9121 7294 8115 5328 6323 6273 5526 9714 7406 6653 9047 5568 9023 5863 5870 6753 7211 5485 7430 9713 9795 7462 5291 5602 6583 5785 9116 9488 5909 8319 7860 8678 9260 5974 7654 5583 5895 8179 8945 8300 9832 7991 7516 7502 7502 8386 9255 9712 7519 6684 8073 5962 7794 8364 5212 8025 7797 7976 7513 7354 9943 5372 6031 9203 6346 7333 8433 5889 5512 7378 9189 8991 9017 5353 6493 6518 7387 9396 9878 9906 6080 6599 9516 7522 9963 9728 5547 6408 7704 8059 8762 7646 7079 8441 6849 7073 5773 8930 7962 9933 6307 5798 7572 8972 6151 9065 5490 7185 7108 9016 7091 6836 5615 5254 9357 9226 9982 8552 5634 7685 5259 8043 8979 7338 5132 9476 8059 5905 8405 6020 9485 8360 6818 7057 7332 6617 9769 6469 8802 6877 9133 9540 7361 9747 9794 6718 8973 9776 5269 8254 6109 9176 6297 8736 6513 5077 8211 9572 9629 5264 9240 9114 8624 6058 9819 9604 6322 8236 9721 5124 8761 8853 9664 6121 7248 8106 7839 9869 7881 6756 8123 7638 5931 8068 6373 6092 8144 8232 9312 7773 8496 8551 5535 5768 8257 5354 9020 8227 8589 8740 8350 7350 6241 6662 8471 8489 9767 9957 7006 6296 5361 8776 7582 9940 6844 7603 6032 8636 5835 8991 5057 9331 7542 9240 5099 9447 8241 7766 7673 5478 5154 9671 6476 6395 9981 9946 8532 8396 8551 5538 8340 7560 9314 5921 7499 9805 8524 8531 7089 9358 6170 5793 7337 7360 5033 6083 6806 6922 8849 8127 7400 9003 7798 8875 5398 6427 7469 7578 9822 6020 6764 8162 8580 6077 9083 6079 9530 6254 8257 5267 9260 8075 6060 6597 5434 9740 7680 5888 6662 5177 9015 9061 9180 5461 6584 8226 6888 9053 5804 6710 5073 6215 8519 7301 5940 6250 7027 5470 7504 8932 9385 6764 7007 5444 7008 6089 8832 8336 6977 9142 8512 5992 6851 7692 5101 8435 9565 5636 7488 9017 7346 6209 5232 9513 7157 6172 5762 9184 5290 8266 6764 9674 8677 7419 8766 5685 8507 7598 9021 5484 6740 7533 5123 7238 8872 5224 5673 8437 5860 8160 6102 6853 9369 6333 6366 6526 7505 5776 9358 6442 9041 9770 6116 6366 7188 9882 7051 9343 6128 9720 9827 6516 5900 8598 8754 8420 7469 9426 5505 6977 6234 6607 7478 5603 7940 8843 5776 9092 9619 8782 5534 7308 8551 5298 8674 9387 8828 9373 8730 9956 7740 7205 6472 8640 9450 8873 7060 6919 6947 6213 8896 8181 7820 6373 7432 9407 8864 6856 7147 7131 5637 6329 8086 7836 6627 5408 5871 5455 9780 8249 9059 7520 9102 9179 9808 8552 8052 5516 5471 9999 6729 8014 6828 8197 8035 9259 7604 5547 6115 9751 6326 5400 9728 9412 8236 6355 9819 9107 5458 8247 6004 9517 9415 5105 7343 9223 8657 5395 9739 7775 9041 5116 9437 5869 8313 7472 8776 9564 6667 9890 7963 7993 5290 7690 7404 7173 7693 5871 9928 6798 7766 5931 9963 7181 6036 7306 5052 9693 6348 8439 7468 5389 8555 6905 9906 5516 8025 8681 5080 9692 8571 8042 6332 7509 9380 8736 9682 7073 8255 9609 8871 6021 9188 8833 6850 5224 6139 6902 9917 6135 5341 6032 6524 8896 6585 5077 8060 8257 8758 8139 6597 5977 6181 7929 7134 5561 5313 6815 6282 8568 5072 5152 8237 9260 7633 5087 8132 7420 5637 6697 8554 5978 7729 8726 8522 7961 8803 6581 6218 7561 8368 6463 7186 9549 9391 9319 8758 9704 9782 8688 6919 8502 7488 5156 6410 5121 8890 9542 6188 8175 9887 8390 9152 7615 7116 6322 9224 5918 6551 9090 7127 9919 5553 7960 8116 9944 5927 5522 9647 5709 9209 5214 7859 6697 9018 9269 5465 6556 7459 6653 9730 7346 5043 7530 8609 5807 8852 6481 6725 5402 5571 7499 5321 6123 9107 7084 9715 5034 7606 8010 5743 6815 8224 7250 8511 7241 5167 7624 8797 6274 9277 8527 7268 7968 6057 5876 8775 8556 7357 9147 7606 6575 5294 6575 6346 9401 8659 6061 9435 6264 9070 8826 8079 5942 6076 5238 6831 9891 7862 5627 6165 5787 7802 8433 8755 7506 7957 6177 9710 5313 8972 7316 5536 9266 8891 6882 7315 7549 7943 5398 8813 5661 9224 5540 6602 8948 5777 7081 8839 8639 7708 8652 9425 9157 7085 6828 5311 5041 6653 5021 9002 5625 5985 9538 8539 9876 5068 5854 6073 8011 6252 8534 7319 9124 9073 7569 6720 9850 9650 9207 7137 6005 7859 5210 8810 8591 5685 9121 8632 7338 7790 6282 6610 8775 5820 5149 7299 5888 6002 7019 7547 5902 5553 8514 8673 9626 6083 5393 8124 9380 9599 8908 5385 6106 9118 9195 9697 8451 6964 6977 5788 8402 8259 7398 5825 7727 6195 6772 7263 7197 8791 9809 6746 9343 8323 5419 7617 8053 9460 5740 7433 7707 9648 6466 7460 7414 9309 7157 5864 6273 9133 5300 9675 6040 6346 9148 8766 7541 5920 6029 8385 9710 9486 8779 7701 6456 7846 5318 9509 7306 6058 5590 8660 9354 7056 6120 5415 6365 6925 9927 6286 6058 5227 9609 5745 6573 8757 9511 7762 9677 5540 6147 8035 8673 8574 5736 5129 6420 6053 9638 8725 5759 5228 6033 8760 5932 7153 9175 7297 9078 9102 7231 8783 7977 6840 9528 8198 9245 7687 5960 8922 6875 5754 5604 5548 9328 6340 5677 5747 7393 8963 8120 6799 7839 9153 5559 8771 9954 9734 9716 7680 7484 6947 5111 5461 7435 8287 8659 6680 5974 9619 9249 6496 9021 9853 7044 8348 6193 6368 7743 7233 5331 9511 9032 8169 8664 9591 6940 7266 7973 5303 9946 5457 7250 5056 5918 8332 8343 9577 5012 7964 7844 7909 9460 6864 7762 6504 8860 7602 7872 6603 9835 6850 9762 8867 5019 7074 7106 5607 9340 5079 5910 7934 5536 6807 7990 5102 5139 9980 9679 8799 6592 6171 6707 6052 8035 9469 6204 5543 7071 7723 5794 5554 9573 5556 8069 8240 7630 5175 8847 6970 8902 9756 8551 8086 5211 5189 8188 5350 5169 6515 7797 6761 7685 9504 6461 9368 7620 7664 8558 8339 5387 9352 8892 8608 9907 5609 6848 6185 5783 5695 6802 8333 9099 5353 5066 9310 5542 8254 8308 9358 8416 6104 9767 9749 9256 6227 7765 6876 8891 6323 5214 7926 5674 7754 6534 9229 7011 8382 5414 6442 9077 5864 9774 6823 6217 9840 6133 5406 6742 8088 9764 5158 9192 9531 8555 8448 5758 6319 8971 8297 7642 7833 6223 6964 9235 6405 6193 6246 9787 5254 7687 7511 6118 7461 9334 5982 5949 9115 6388 7691 5851 9800 6496 5043 9331 5051 7138 8736 6370 6109 5681 7659 7590 5551 9623 6825 6956 9463 8071 5390 8365 5758 7901 8131 6867 5883 9113 7816 8646 9149 9154 9496 8949 5650 8187 6927 9349 5325 5663 9366 5082 6344 7025 7672 6895 5296 9497 7498 9759 6215 7888 8124 6973 5789 9902 7487 5320 9015 5303 7614 6811 8105 7110 5760 8755 8944 7687 8103 7917 6998 7469 7998 8341 8142 9318 8884 8438 7462 6382 8196 8677 9270 9968 9298 8707 8518 6785 7675 7532 5735 8936 9343 8840 9694 8751 7594 8638 5085 9345 6554 7083 5462 8200 5424 8604 7518 7955 5690 9980 7985 7534 8657 5902 6149 7954 8257 9667 9739 9579 7199 9122 8515 5190 7961 8209 7588 9203 6846 7673 8548 8400 9756 7658 6600 8827 9910 7766 5430 5600 7745 8415 8133 5050 9317 9282 8004 6221 8949 6390 5800 9795 5512 9315 8633 7121 7524 6221 6324 8018 7542 9872 5066 7297 6178 5314 9772 6088 8079 5202 6687 5824 7265 9820 9522 5229 9102 7525 6450 6699 7563 7250 6494 6723 5213 8774 8843 6385 9995 5167 9402 6184 8686 9468 8481 9864 9781 6901 5951 6508 5751 7638 5980 8016 6106 5502 8245 8856 6675 8343 5555 9238 5593 5696 9608 9454 9470 8451 5838 8113 7266 5240 9297 5952 8356 6426 9463 6785 8327 9062 8293 9078 5348 9273 5741 6454 9774 8986 8958 6449 5976 9513 9334 5217 8857 8942 9670 8327 6041 5508 5087 8307 9396 9384 7906 7752 5809 7369 8184 7784 6431 6477 5509 5427 9397 6250 6881 7819 8884 9487 7916 9860 9000 7250 5076 6504 9840 9746 8479 5881 8902 8566 7835 8298 7949 5741 9698 7406 6758 7882 5190 6837 8006 9347 7264 7403 5597 7793 5222 9480 7280 8138 7988 9928 9035 8064 6432 8875 6458 8558 8403 5360 7124 6238 7306 8721 5627 7003 9775 6033 8533 8612 7870 6539 7959 8782 7590 8555 6575 6460 6683 7503 9597 9671 7431 7280 7734 7510 9803 9192 6068 6854 8199 6840 6740 5505 5560 7367 6156 8983 8400 9688 7595 9918 9875 5553 8700 7464 7756 8923 8924 9439 6426 7169 9110 8856 8097 5492 5014 7899 8331 6082 8401 6530 7922 5140 7035 7130 6155 8190 6112 9554 7878 7355 8120 6401 7908 6819 7513 9312 9390 5084 8751 5815 7253 6508 8319 8997 5648 8333 5544 8979 8063 8945 5509 5985 9085 7543 6762 5239 5733 6522 8441 7259 8877 6561 7308 5432 7028 9820 9744 5065 9904 7142 5880 5805 7298 9199 9802 7946 6180 5346 6924 9243 7938 7433 5228 7023 8624 5638 5910 8005 7160 7999 8912 9684 8207 6219 5116 5235 6039 8508 5300 5943 9298 9828 5396 6596 7675 5197 9541 8855 9191 5113 8098 7129 7546 6973 7799 9817 6259 7357 7822 8418 5355 6733 6750 8562 7952 6866 7445 7639 9022 6392 7230 8319 6220 7626 8563 8894 6471 8104 6397 5661 6865 8142 6438 9410 5115 7885 7875 6374 5241 5697 8440 5596 6078 5190 9158 9030 5704 6603 5317 8373 7995 7547 6692 7862 5172 5255 5404 5291 7006 6801 5952 8871 9943 6037 6929 8706 8922 9804 8727 7811 9148 7167 8407 5226 6004 6213 7903 5356 6463 8220 8729 8106 5766 5421 5968 9586 9323 6372 9877 9977 6820 9476 7496 5411 5513 9424 9116 8083 7876 7843 5893 7024 8658 7948 5897 8310 9160 8800 8665 5623 7020 7394 8729 6434 6462 8344 6020 9433 8364 9544 9410 8832 9020 6906 9242 8181 9978 7006 9912 7853 8497 5805 8525 5803 7400 9422 9112 5208 6870 7777 5831 7537 8819 8208 8971 5281 5200 9990 9714 7211 9534 7772 6043 7202 9677 5285 5383 8303 5939 5295 9804 9436 9747 8328 5238 5795 6398 9350 6003 6915 5775 5482 9452 9594 7338 8423 8522 7537 7061 6884 9748 5243 9655 9439 7445 7980 9723 6476 6283 9310 5418 6086 8745 8813 8062 8983 9608 8108 6981 9259 5023 6404 9741 9475 5998 5727 6545 8168 8264 8606 5051 6660 7496 9706 6098 9941 7686 9469 5064 7617 8779 9130 8703 6172 7943 5413 8803 6199 8520 9432 9106 8543 5836 8847 6665 5481 9574 8210 8649 6485 5464 7348 6793 7960 7054 6539 6548 8388 9656 6612 6004 7082 9390 8355 8254 5981 8767 5704 7180 5935 5136 9934 9478 5971 8781 9791 6452 7003 6649 8749 7136 7112 6096 8928 5072 6798 9115 5268 5185 8770 5528 9837 5852 9918 6840 7754 5899 9255 8458 6727 5190 8593 6661 8315 9564 9090 8106 9664 9740 9754 7061 6876 5514 8157 9452 9234 8602 8566 9501 8787 5984 5029 7272 6836 8594 9112 9590 9493 8366 6695 9867 8556 5288 6528 5519 8500 9265 8624 6812 9005 7026 8873 9529 7540 5677 8980 6774 7927 6194 6275 6714 7178 9951 7634 7662 8545 5394 5900 6686 7408 7595 6553 9611 6531 6728 5130 8679 5993 8754 5491 8646 5780 8011 8175 6968 7336 5803 8741 5263 5645 5016 5625 6471 9967 6907 9133 7160 7301 8680 8845 9708 6275 5398 7967 6453 5774 8097 5132 6767 5498 9270 9061 9926 7281 5883 6893 8265 6686 5634 8528 5978 9298 7801 7449 7912 9708 5229 5072 7009 8909 7565 5365 8832 7962 8332 5285 8736 6428 9064 9150 5574 8334 6859 5500 9263 7742 7393 7528 8075 6675 6056 9053 5972 8857 5150 8884 8565 5379 7604 9222 9288 5168 9586 8119 6778 6566 7052 9162 6642 6116 6960 7216 8098 8818 7715 7361 5208 8756 9889 8283 5430 9593 5984 6402 7098 6133 8934 9311 5160 5186 8532 9447 5354 6766 6214 5780 8332 6914 9941 9973 6677 5549 5837 9775 9367 8552 7135 9574 7307 7024 6505 7737 6616 6136 7787 7362 7269 6721 6672 7429 5555 5204 5524 9556 6970 5386 5336 8950 5947 8925 7571 7624 9473 8407 6047 7488 5607 8182 5710 7914 8853 7214 9299 9117 8350 7086 6479 9267 7455 8151 5344 6657 8355 9515 6213 8973 8549 6549 6570 9496 9121 7789 5768 7242 6196 6814 9730 5450 9996 5439 8364 7497 6301 6310 6614 8299 7044 8092 6214 8146 9891 5206 9803 6893 9721 6016 9514 6917 6213 6084 5061 8982 8872 5828 6224 8716 7642 5953 9166 6286 5040 6177 7430 9989 6135 9044 6936 8179 5784 6798 9973 5674 7004 8424 6215 5372 8088 5729 7289 9300 5460 5998 6930 7980 6826 8153 6696 8116 7754 9509 8049 7794 9334 5479 6431 5469 8171 8367 7296 8954 5165 7268 8276 5817 5692 9491 6189 8779 8868 7126 6727 9328 8123 8657 7308 8597 5458 9003 6712 8212 7160 8409 6006 6494 8888 6085 5611 7059 9452 7907 9661 8265 8823 6585 9081 9514 9724 8918 6941 8591 6043 7316 7919 7814 5973 8874 6411 5078 6525 8123 8290 8685 6532 7943 8827 9068 9028 9438 9774 7127 5993 8083 5392 9815 9667 8121 7977 8039 5686 9918 6630 6729 7234 8196 8191 6855 7070 9602 6933 8595 6372 5222 5928 6552 6813 9755 5619 5841 7841 9041 6616 8834 7124 5655 8649 6791 8776 6626 9829 9462 6544 5107 9839 7426 6951 8030 7928 9021 6279 8509 6264 7651 7379 7192 9203 9192 5595 8470 5032 8436 7511 6648 7269 9634 7303 5918 5073 9726 6191 8550 7836 6383 7304 6322 8808 9255 8000 5384 8275 9279 8893 8187 5578 6271 9026 9780 5463 9621 6898 9143 6704 9408 9438 8973 9042 6741 8539 7763 5115 9730 6312 6598 9760 8616 7920 8568 7871 5920 7600 9794 8846 6493 6628 9424 7764 5654 7852 8226 8923 9749 7369 5627 7805 6807 9600 5495 7195 6786 8258 5958 5164 8218 7556 9924 5482 5476 7140 7000 5043 9740 6794 8889 6232 7070 6961 7644 7724 9812 5870 6646 8209 6886 7273 9662 7341 5520 5157 8184 5954 8415 9141 6118 5280 6697 9689 5762 5820 6829 7762 9511 5216 8203 8400 5096 5273 9009 7740 7996 7469 8609 8290 9326 9143 9211 8988 6484 9731 9145 8315 5685 6207 7456 5450 6487 7801 5139 5897 7269 6968 8658 6780 5832 5509 8828 5928 5782 6484 8667 7426 8953 5924 9364 8278 5067 8574 7266 5199 8305 5058 8514 7637 9913 9618 8087 6400 6066 8226 5945 6983 8842 8251 8762 9673 8760 6238 9249 9541 7722 7916 5615 5322 8840 9978 8600 7555 8552 9514 7753 5505 8220 9915 8142 8133 8180 9877 8181 7894 8103 9125 9877 5592 7376 7287 8913 6135 8524 8162 9324 9894 6077 8587 5216 8565 8565 7464 6119 5765 5625 7520 6269 8845 6083 8059 6977 9263 7935 8806 5805 6038 7931 5681 5278 8954 7968 9191 8737 5140 7352 8061 5033 7077 6648 8897 5642 8860 6360 6761 9625 5633 9281 5894 9478 5363 8952 5103 8274 5535 7556 9078 6573 5487 8407 5498 8089 6375 9689 6826 5162 5689 9887 8843 7766 5182 6388 8407 7690 6396 8816 7315 7029 6744 6856 5154 7107 9456 5257 9029 9991 6461 6755 5212 6947 5162 5710 5036 5184 9046 5509 5346 9735 5396 7837 7500 9226 9225 9555 6916 5620 8371 7878 7649 5115 9734 7803 5870 7838 6707 8546 7829 8168 5301 6689 8763 5462 7398 7446 9294 5092 7955 8288 9827 6999 6125 5975 9872 8998 5530 5436 9618 8900 8314 5914 7663 6696 7365 8532 9534 7720 7078 6011 9535 6027 7699 6946 5137 8745 9392 9431 8837 5995 7719 7312 6641 7492 8286 5161 5137 8816 5597 9755 6364 8910 9317 9026 9254 5329 6206 8787 8049 6932 8446 6232 6607 6145 8177 6743 8538 6217 9822 6023 5859 6188 8334 7500 8680 6620 7661 8817 9084 6906 7219 9095 5816 5184 8121 5069 5513 7975 7504 7209 8555 5950 8441 5162 5742 6618 6905 7928 7834 6726 8950 8693 7914 5932 9841 5242 6200 6150 7706 5284 8056 8573 8027 7519 8757 6148 6236 9269 7771 7388 6478 6326 8338 9919 6487 7728 5184 8392 5655 6666 8766 8253 9007 5328 9185 8848 5569 5385 8646 6923 9317 6702 5496 7343 7869 9253 7139 9105 7170 9909 5141 7296 9883 8478 5862 6370 9854 6046 8409 9157 6360 5823 7410 5367 6150 6595 7863 5367 5628 6509 7290 8592 6859 6434 9583 8375 9335 5370 6128 6504 8927 6268 8800 8809 8394 8310 8827 8248 8004 7236 7404 9364 6706 9814 9731 7856 5056 7594 6871 9332 7751 9161 6572 8257 5595 6155 6632 9930 5172 6408 5082 9099 7676 7529 7908 6070 5839 5382 9317 8842 6266 5369 8206 7972 5183 6584 5828 8887 7826 6347 6866 9224 5508 8438 6129 9751 8240 6409 8328 8412 7817 7058 7511 5492 9587 9066 6562 9073 8096 9527 6563 9362 9896 8417 7333 8726 8649 6809 6261 6474 8155 8127 9346 7311 6564 5475 5709 9804 6884 9037 6864 9701 9743 8023 5193 7977 7089 5402 7050 5185 9929 7261 8194 8472 5678 5527 5846 7974 5984 7107 9448 9139 5233 8794 5097 6797 9269 5806 5249 6153 8491 5761 9502 8234 8784 9694 6211 9520 8744 6909 8353 7321 7818 6547 5793 7143 5722 6639 5117 6705 8745 8213 9492 7626 7007 9589 8071 9924 5395 8320 9725 7534 7729 9227 5767 6513 7569 5626 9681 6313 6182 8033 8633 7648 8228 9426 9791 8949 9712 9908 9302 7105 8121 8794 9731 8776 8382 7802 7348 7425 9770 7073 9958 7499 6299 9373 7660 7516 8647 7340 8828 8477 9021 7461 6124 7249 5535 5915 9846 8895 9470 9148 6000 6239 7941 5731 8662 9971 8533 6010 6044 6951 8082 9650 9450 8029 9023 7109 5545 6317 8097 8021 9794 7118 9130 5918 9367 8312 5480 9212 7207 8598 7008 6854 9837 9949 6233 8499 8568 9765 8156 9611 5364 6238 9261 9813 7915 6931 5570 7108 8248 8667 5128 6690 5785 7906 6255 8800 6218 5383 6660 7072 8981 8667 8926 7466 7264 5159 9612 5831 8572 7768 9090 8935 7654 6999 7396 5569 8930 7966 6325 5826 5281 6453 7515 6066 8006 7418 8514 9224 7801 5173 6296 6782 7488 8870 7896 8400 9028 7508 9231 6248 8924 6969 5183 6578 8967 7579 5795 6545 9193 7119 7370 9474 7220 8533 9188 5226 5951 7701 9449 7400 6522 9393 9182 7658 8262 5726 6058 5938 8233 8936 7186 7157 5905 6016 8734 8520 7243 8177 5064 6435 5296 6082 9557 7515 9615 8744 6389 9214 5093 9486 6614 5263 8878 9444 7921 5788 5170 8979 6726 7051 6563 7560 9207 6115 8576 6589 9635 5818 8414 8347 5901 8709 9429 5458 9872 7692 9202 6261 5554 7943 5746 5816 8206 8272 8908 6127 9060 9077 8753 9434 9776 8964 6994 8983 5079 5569 9220 8361 5035 7633 6708 5936 9990 9784 6394 8510 6124 9243 9771 5325 5834 9165 6141 9039 6085 5048 8814 5145 7773 6215 8227 7549 5178 5220 5179 5257 9437 8047 7266 9472 9328 7621 5408 7966 7405 5450 6476 7177 8341 9894 7502 9174 9059 7290 8213 5143 5986 5675 8936 8759 6889 7162 9956 7067 7382 5135 5972 5467 6829 8237 9939 6157 9506 8995 9122 6911 8093 5598 7736 6433 9140 8885 9255 8198 9823 6116 6989 5809 6791 5925 8216 7328 6735 8172 9395 7765 6954 9014 8232 8783 5899 8171 8588 5405 5814 6358 5964 8906 5603 7348 8987 9743 6233 8242 7941 6056 9358 8578 6865 9797 9502 8729 7124 9885 6900 5167 7649 8854 9181 5881 6285 8728 7699 8521 9133 8513 9878 8745 6067 5481 6092 5054 5224 7325 8296 6812 7028 6302 5390 7541 9746 8540 6269 6870 8424 8169 7037 6073 5671 9865 5602 5604 8593 8301 9125 6373 6813 9003 5118 7880 8132 6210 7933 7003 7182 9877 8815 9210 9826 7853 6751 9572 5040 6668 5090 7112 8485 5775 8185 7804 5640 7435 8408 7880 5735 6180 9253 7548 5183 8019 9076 6962 7876 5657 8965 5058 9181 7780 7916 9007 9281 8315 7227 9321 9982 7317 6433 8467 8092 8266 6270 7379 5700 9678 5259 6435 9506 8160 7631 8336 9827 6707 5298 7703 6011 9263 6409 5192 5691 9325 9199 8620 7639 5074 7940 7621 7391 8021 9736 9131 6286 6006 6510 5634 9331 5417 5717 8837 7225 8348 7173 7051 8703 6119 8402 9714 5382 9810 9906 9721 9135 7753 8340 5422 7827 6280 8043 5218 7949 7778 7996 9235 7432 9506 8517 6763 8570 9234 9247 5795 6230 5068 6494 9932 6186 9895 8294 5216 9705 8199 9936 7488 9600 8276 7909 7426 8204 9600 6292 6153 6026 9288 9035 8457 7441 7552 8868 9659 5433 6763 9102 6663 6830 5595 5243 8016 5490 8536 8232 8843 5383 6816 6331 9983 5092 7888 6057 6944 7487 7348 6744 8513 5284 5779 6970 6373 6979 9485 9680 7412 6248 8781 7722 8078 9376 7965 9742 8514 6501 7973 7357 6884 9789 7336 5514 8528 5223 6571 5472 7710 7567 5864 6223 6498 6643 6840 6519 7269 6325 6198 8329 7573 9979 6051 5650 8003 9015 9040 6517 9164 7013 8874 9695 5449 6210 5209 7625 5081 6780 6745 7791 7994 7608 7661 9492 7899 9501 6011 5168 5826 7209 7144 7047 5836 8195 6345 8839 5858 5384 5356 8669 6045 7878 8364 6494 7735 8573 7767 7816 9001 9511 9254 5643 7119 6915 5135 5018 6416 9793 8833 5890 7002 5977 6585 6485 7820 7929 5324 7325 6961 9327 5994 8006 7205 9358 8147 8588 6579 5914 5051 9228 9073 9305 9870 6192 6220 8653 9857 6284 8446 8690 5822 9095 8315 7407 5580 6135 8984 9552 7108 9593 8879 8102 6246 9731 6108 9393 8319 6335 8955 8370 5562 8027 7675 9080 9219 7543 6381 7724 8827 9826 5062 8297 7569 8377 9351 6797 8159 6983 6349 5267 6575 5227 8368 7821 9958 8124 5862 8277 9458 9817 5294 8668 6492 7969 6396 9358 9159 7777 7082 7986 6251 7143 9930 7468 5520 9281 9265 7327 9912 5613 7593 5135 5840 9609 7956 9446 7733 7466 7723 5839 7282 6665 8155 8774 9633 9551 6780 8792 5975 8861 5426 7226 6004 9004 8341 5172 6933 7606 6146 6844 8219 8739 6979 7707 6996 8582 7153 8377 6048 8523 9215 6978 5188 7370 9399 9821 5568 6179 7261 6543 5040 6334 7417 9692 5338 5758 8511 7270 8363 9657 9114 5230 7044 9741 7936 7688 8323 5089 6065 9370 8612 8928 9996 8799 9945 9395 7268 5513 5573 8176 7056 9261 9510 8121 8952 9848 7526 6111 7118 5889 9416 9880 9767 6460 9620 7703 9148 6591 6439 8861 9609 5051 7788 9604 7498 7733 8999 9765 8246 8220 6589 8950 7480 6099 5719 5080 5947 8245 6191 6712 7782 5607 5240 7548 5715 8508 5251 8511 8746 5338 7372 8355 5388 5160 7959 6534 7893 5605 9947 9787 8825 6536 7385 9953 7635 8103 8681 7229 6348 9872 7589 9129 9127 7829 6677 8490 9984 5576 7001 8730 5913 8020 7085 9949 8180 8691 6483 9720 7944 5077 8155 5417 6613 5539 5369 9247 8642 9050 5124 9990 7569 7713 7767 5344 9190 8092 7481 9174 8667 8130 6552 8228 6150 7284 8177 7977 5975 8308 6345 8919 8385 9500 9336 8645 8687 8353 6540 5977 6050 6664 9614 7267 8025 7381 7611 7215 5472 5092 5036 7787 6869 5236 6015 8019 7520 7840 5996 8495 9796 5989 6062 8180 5488 9045 5473 7823 7398 7013 8799 8448 8677 8413 5715 6702 5794 6973 7565 9914 5713 6249 7701 7582 6484 7364 9248 9004 5204 8892 6146 9999 9880 7208 6827 9016 9901 7300 6839 7298 7961 5638 9394 6638 9051 8756 6988 8492 9377 9553 8406 8738 5801 6106 9967 5933 8470 9215 9937 7321 8107 9731 5968 7987 5586 6443 7003 5487 7391 7489 6433 5352 8127 5826 6990 5825 8230 7626 9317 6255 7179 6371 9993 6628 6125 9960 7561 9594 7823 6145 5563 5929 5876 6531 7564 6462 6622 8214 5596 9013 5703 7029 9365 7478 6503 5003 8303 9733 7629 6268 9636 8456 7638 8276 8731 7411 8236 6292 7005 6058 6085 6216 5635 5608 6395 8199 5718 8017 6413 6314 7030 5764 8342 5043 8241 9845 5046 5192 8225 6323 5107 7861 9778 7745 9785 8509 8804 8020 8449 5808 7726 8181 5672 8361 8789 7066 5208 8155 5083 6620 9468 5760 6032 7810 5803 9273 6303 9496 9464 9528 9467 9571 6036 7893 5964 5821 6402 9768 7489 8498 9224 8863 5327 9895 7224 7764 5609 6079 5919 5692 6347 5387 6452 7379 6845 7254 6651 6795 5398 9763 9971 9865 7982 6007 7757 7594 5475 7807 6010 6612 9953 5233 5474 5280 8776 6346 8044 9385 6073 7610 8725 7420 6645 5176 9798 8489 6078 6449 5284 5124 9860 5255 9989 7842 9909 6394 9084 9032 9200 5094 9292 7801 8975 8414 8080 7751 8407 9772 5784 9480 6030 8156 6899 7674 8332 6697 9811 8058 6794 8743 6830 5302 7646 6819 6792 7555 6860 5876 5235 6060 5970 8174 8861 9944 6588 5589 6343 9995 9008 5774 8122 5038 8930 5021 6360 5910 5366 6171 8968 7160 9914 5798 7462 7559 6265 7902 8762 8125 8778 7644 7833 9748 5818 5341 8340 6054 5930 8330 6048 8586 9104 9170 7271 8034 7839 8631 8944 8205 9801 6560 9013 8363 6006 5123 5922 7271 8025 8331 9043 6803 5975 6876 5199 6793 7217 8538 6495 6794 6868 6191 9028 9620 9009 6299 7654 6848 9929 5246 5053 8378 6806 9066 6741 7812 9189 7662 8731 5862 9641 7774 7665 5616 8297 7863 6057 5514 5049 7552 5956 5565 8742 9983 5185 7751 6282 7839 8246 9859 8085 6947 8237 8539 6012 9977 6351 8849 6287 5082 9710 5928 6503 6023 5192 9800 8886 6249 8962 7583 7449 9917 8148 9839 8548 8333 7589 9830 9820 9483 8336 6553 6430 6573 5092 6090 5198 5091 9938 5133 8820 8296 6061 5323 7967 9901 8771 5500 6150 7733 8083 7246 6298 9878 7085 9846 6859 8322 8323 6678 7805 6659 6879 9234 6880 5618 5324 7077 9357 8910 7210 8177 5854 6918 7148 8820 6819 5919 9320 6616 7299 7403 8862 8597 5929 5947 7090 7787 9268 5413 8113 7073 7072 8640 6307 8952 9258 5278 9677 8614 9188 6886 5439 5041 7452 7586 8861 9271 7153 6829 5887 9452 7880 9749 6696 8808 9343 8786 6595 8611 9199 9708 9332 9919 8348 9286 7519 6253 9564 7195 8515 7400 7729 8954 7441 5181 6540 9950 9452 7340 6779 8986 6792 9658 7383 8488 7114 6726 5922 8709 8985 5121 7065 6964 8688 9061 6250 6206 8962 9462 8401 7477 6862 9778 6430 7950 9959 6618 6548 8059 8958 6974 5693 5749 5280 8075 7885 7394 9801 8806 6103 7433 7575 6816 9397 6262 9525 5647 7468 8486 8757 9517 5963 9267 9295 7393 5865 7902 9010 7412 9609 7968 9386 5301 7365 8314 8376 8897 5708 6825 7703 5459 9258 8926 7275 7303 5188 6800 6598 7656 5286 5355 5821 9896 8269 8764 7289 9134 6666 9947 6546 6274 6562 9580 5223 7575 7894 8599 6472 7250 9072 7823 7709 6977 6748 8632 9280 6936 5431 5877 8239 9365 9880 9060 7909 8149 7823 8845 7282 8137 8792 7476 8059 9002 5703 8282 6576 7245 5529 8048 9494 9600 5870 5851 6577 7618 9482 9505 8202 8561 9030 6441 6574 8909 9148 9482 5706 5619 8327 6636 8756 5767 9111 6814 9768 8462 8744 9992 5707 9272 6688 8849 7520 7558 9699 7745 8824 9181 7250 5673 6390 6279 7114 7964 8836 6262 7446 8190 6881 9421 9825 9284 8835 7584 9746 8603 6046 8490 7243 5401 6410 8931 9249 8930 5136 8948 6675 7608 6777 7572 8281 8167 7499 5394 9779 9983 5304 5872 8173 5832 5293 6646 5116 9128 9230 8510 6379 8924 7000 8622 7972 8409 6200 7221 5987 6336 9817 6309 7592 5242 8881 5872 7057 6380 9914 6836 5011 5218 7708 8184 9698 8000 9829 8462 5776 7707 6972 5802 5278 8971 9424 8250 6028 9272 9119 5663 9256 8936 6972 6847 7826 9501 7719 9883 9529 7633 6719 9540 6499 9426 7723 9844 6074 6200 8306 5498 7555 5277 6300 6481 9248 9371 9731 8924 8643 7498 9587 7898 6434 5206 9745 7908 9707 6112 7791 9235 7393 9509 7423 7540 7583 5146 7384 8657 9994 5689 9155 6196 5966 9102 7677 8862 8473 7407 6434 7116 8553 9669 8662 9986 9875 7055 6542 8229 8167 9332 6112 9208 8841 8535 6747 6424 7328 7779 8729 5970 8468 6532 7166 8082 5634 9842 5592 9107 5897 7026 9870 9450 6694 8532 8084 5217 5586 9625 8446 7401 8957 9558 6608 6446 6740 7003 6518 9068 9782 8895 5038 6897 5427 7203 9979 9708 5693 5570",
"output": "5617 9114 7223 8085 7207 6665 9614 9508 8351 8579 7638 9973 6310 9941 7237 6074 9460 6574 5828 9264 9789 9632 7433 8571 9218 8470 7138 9877 5933 6865 6071 5198 5978 6942 6931 6833 8607 6544 9989 6958 8771 7627 5579 5081 6216 6463 9802 5676 6685 5630 8587 6474 8909 6020 5044 8127 8138 5830 8004 7719 7695 9075 7916 8673 9664 8495 9154 8271 8687 9143 8876 6105 5418 9455 6186 6633 9566 9636 5957 6250 8913 8192 7724 7822 9212 6416 9597 7349 7246 7601 5068 9940 5324 6632 7261 9988 8774 6414 6906 7461 9205 9430 8566 9622 7533 8399 9903 7098 6683 8348 9244 7699 9720 5714 5559 6135 5311 6556 8381 6560 5271 6969 6883 6903 9229 5519 9325 9291 6073 5433 7144 5503 7647 5414 8035 9694 5317 8781 6376 8472 7129 9268 6171 5497 9981 6730 5292 8285 8660 6851 7204 9277 7382 7755 7154 6549 7079 6445 7621 7512 7236 6772 5159 7650 9807 8500 7966 9876 5086 8013 9144 6257 8509 7773 6635 5141 8064 8568 7449 8563 5772 6725 9593 8526 8879 6142 5605 8971 8763 6765 6207 9182 5572 8857 8989 9072 5471 6224 7596 5557 9237 5387 5462 6394 8160 7096 5182 9872 9312 7631 7083 5083 6676 7257 5530 7817 6510 9501 5228 8275 9356 9410 7495 6861 7046 5214 7331 6918 6458 6536 9803 5493 5645 6196 8652 6389 6378 7172 5701 7657 9254 9432 5660 9578 6689 6190 7395 8199 9339 6270 5122 8695 5680 6264 5556 6374 6478 6535 8292 6584 6718 6742 7076 7363 7938 9376 7400 7964 6548 8101 5621 9450 7532 9929 9027 7869 6119 5070 6067 9106 6340 9837 7801 7019 6101 7004 7041 6227 7187 5332 7810 8905 7074 8534 9916 7910 7316 6624 9458 9064 5893 7555 5244 5821 6582 8113 5588 6652 7828 8341 7991 7664 9790 8658 7413 6794 5699 7287 7628 9679 8745 5181 5401 7279 5096 9061 5189 6060 9333 8295 8772 8873 5850 9016 8342 6080 5776 7578 7731 8604 5919 9370 5708 8028 7328 6150 7375 9615 8778 8360 8958 6102 9287 7702 8810 9476 7410 6791 6419 6181 5664 7268 8845 9006 6996 9621 5231 9727 8224 7745 8140 6858 9421 9116 8007 6795 7379 7496 9387 8039 8674 5741 6056 6798 6494 8216 7979 7158 9132 5472 9811 6128 5092 5042 9502 6964 6192 7247 8752 6697 6667 7867 8352 7110 5246 8254 5500 6954 6212 5203 8751 8010 6967 9637 7503 9747 5108 7314 5875 8848 6004 9025 5812 5843 6271 9564 7540 6586 6079 9540 8696 9972 6973 6950 8252 7444 6098 5206 7303 6301 8957 8961 7998 9572 8597 9319 7353 6462 8841 9849 7465 7866 5661 8308 7785 9496 9371 9951 9036 6715 9657 8665 6823 7100 9762 7029 8051 9711 9633 7012 7708 9257 6856 7171 6610 8318 9660 6459 9431 6174 5768 7739 9640 5883 6977 8239 9919 8691 6810 9575 8633 5323 5766 9310 8374 5476 8943 5386 6832 9642 8688 7614 9900 5654 7274 5006 5084 8448 9422 6471 6054 7710 8030 5949 5920 5369 6407 6373 8114 5786 6645 6488 9910 5521 5390 6031 8811 7726 8645 7359 8380 9567 6013 7112 6662 5434 7230 7716 8144 9583 9394 7740 9151 9763 7795 6941 9783 6482 5055 9217 6542 9127 5711 9517 8393 9522 7243 5686 5529 9271 8900 6541 6382 5562 6975 8612 6926 8767 6843 6319 6507 9730 9301 6583 8161 6637 7378 6206 6827 5153 8569 7538 5610 9209 9943 9885 8479 8843 6426 8053 7049 5769 9979 9463 6260 9946 5970 5902 9675 8919 7484 6484 6998 7769 8861 8204 9596 7662 5420 5782 5979 6030 5138 5188 5023 7315 8464 5824 6517 5793 5241 5143 5256 6501 5089 9873 6050 9764 7440 7182 9895 9437 8756 6289 8195 5066 6709 7625 6045 6386 6411 6232 6007 5082 7195 8118 5178 8018 8283 6907 8426 9874 8407 8514 9457 7186 5287 6821 6623 5238 9225 7912 7081 9290 8268 9706 8983 9654 9765 8863 9309 9847 6057 7427 8672 5709 8290 5982 7783 8164 8037 9945 6870 6429 7339 5367 5315 5211 6927 7396 8149 5195 5750 7132 8497 5515 5994 7805 5361 7051 8880 9033 9774 8237 7323 9404 6019 9135 5964 7045 5789 7468 9804 7679 5016 5573 7960 7717 9928 7602 9170 8937 9653 8050 7970 9427 6286 8941 7478 5953 8076 9918 5565 8768 5796 9557 8102 9514 9360 5722 5841 9738 5738 8959 5152 8277 8728 5878 5846 7665 9179 7543 5635 7253 8829 9731 9782 6299 8297 5347 5067 9093 6041 8272 7194 9203 6280 8692 9666 7302 9009 8624 7285 8948 9829 6811 8441 7494 5990 5984 6776 6891 8461 10000 6622 9947 5886 8662 9011 5574 6933 9853 9777 8213 8468 7878 8719 6125 5150 9821 8410 7746 9650 8869 6187 7143 8506 5819 5397 9280 7567 7018 9819 7513 5585 5704 6175 6278 8108 9449 9703 9968 5866 6819 9585 7943 9405 5001 8038 7703 7517 9224 9846 6023 6618 5734 6437 6140 6318 5914 5715 9070 9010 5417 7686 8524 5884 9180 7475 9472 6161 7510 8864 8640 5382 7357 9663 8418 8379 5690 9112 5775 8185 5430 6563 9147 9992 7278 8217 6343 5903 6173 5874 8731 7929 8349 9090 9361 6602 8112 8390 7607 6423 6110 6024 9801 5448 8069 6223 9901 9343 6434 9048 7983 7265 5632 8702 6816 6805 9195 9734 6572 6046 7472 9692 5407 7722 7803 7445 5328 9226 8555 7675 9003 6717 6588 9579 5307 5666 7561 7666 6579 6841 5015 7043 8646 6238 7028 8459 7284 8148 8150 6338 9518 9601 8783 8827 5985 8494 5149 8636 5210 6737 7509 6828 9963 6141 6172 9129 7720 6659 9648 7335 9489 5483 7639 6917 8649 5888 5700 8362 5333 5636 8511 8968 8896 5125 6321 8859 7462 5031 9364 8830 8044 7156 7240 8186 5535 7674 6114 9817 8031 8465 9848 5607 8210 7711 9891 5327 5736 9265 5452 5705 8123 5687 8167 6802 5051 9845 6532 6844 9040 7067 6177 6714 6829 9323 9860 6755 7819 7239 6010 9677 9950 5900 5046 8925 6636 7958 7341 6081 8711 9156 6531 8762 8449 5024 9617 6867 8657 5696 9019 7525 6334 6989 6033 8088 9808 9098 8132 6869 9998 6826 5282 9784 8817 7623 9513 7528 5427 6043 9938 8875 8203 7504 6859 6847 8274 9526 8020 9607 6515 9052 9970 5971 5441 7840 5438 8576 7281 5720 8359 6990 6520 7417 6211 5860 6292 7277 9062 7443 7507 9569 5780 9095 7310 5609 6362 7333 7329 8820 5905 6976 6768 6567 5337 7721 9906 5351 8501 7649 7661 7536 8258 7670 7914 7485 8651 5085 9814 9366 5867 5613 6713 8227 5357 8481 9646 9756 6876 9861 8741 7937 7582 8647 8288 6295 7267 8201 7266 5685 9565 9331 7550 8513 8163 9438 6911 6390 9795 8296 8089 5171 6597 6184 8478 6395 7557 8421 9639 5553 7300 5955 5118 6213 5101 7411 8614 9647 8052 7893 8908 5336 9079 6180 5834 5877 5516 8683 6069 5983 8291 9835 5844 8392 7931 8255 7005 8705 6431 9441 5199 9324 8429 6075 8257 9828 6909 5911 8473 6122 9188 7876 5787 6630 8206 5658 7361 7563 5737 6410 5061 8798 8487 8369 6743 8196 5429 7654 6862 8775 9505 7460 6028 7774 5842 9275 9644 7355 9528 6554 6661 6889 9117 7397 9175 7458 5826 9656 8733 5706 7987 9243 9481 5350 6708 7168 8124 9721 6047 9365 8402 8893 7259 5063 5416 9199 9917 5200 5508 9391 8504 8560 7061 5127 7394 9836 5477 7749 5651 7249 7470 8661 6835 8014 6698 9375 8921 5409 7453 7593 6516 5439 5947 6573 9506 7457 7419 8877 9813 7562 8012 7606 8680 5320 5514 6982 6248 8537 5305 8858 8934 6902 5575 8528 5022 7147 8034 5453 7728 9484 8914 5088 9841 5123 8100 7447 8803 7068 6997 7965 9049 6893 6502 6139 7094 9997 6367 8440 9619 8986 9815 9103 7900 7592 6671 6651 9121 7366 5684 7086 6415 6225 7235 5014 7070 7108 8384 8371 5431 5248 7591 8634 8485 7605 7167 7224 6153 9974 7700 8938 6214 8492 6603 5584 5456 6460 6680 8482 7435 5501 8454 8092 5147 6938 5697 6158 6568 8466 5193 5190 6166 9131 6404 9185 7016 6304 7676 8618 5549 5284 5657 6963 5813 9139 9398 5912 6121 6380 6059 6707 8372 7865 7292 6838 8058 6130 5837 7534 7189 6500 8766 6668 9050 6307 8367 9661 7120 7506 7707 9787 7146 9556 8525 6262 9249 8049 8535 5832 5187 7501 5465 9986 9536 9231 6654 6928 6609 9260 6589 7377 5413 7164 6561 6719 9886 6629 7629 6466 5117 5236 6433 5303 9200 8933 6326 9665 9510 7868 9051 9471 9477 8310 9708 6853 7371 7651 8578 7860 8032 6957 8234 7975 8347 6740 7948 9780 8713 7017 5460 6279 5174 8003 7873 7272 9831 7202 8480 5437 5779 7117 6384 7733 6777 9618 7437 6392 8232 5105 8802 7340 5032 7624 8991 7827 5113 8746 5943 6519 8071 5604 6956 6988 5791 8145 5253 5146 7634 6866 6241 8027 5599 6587 7042 5578 8516 7245 5910 6220 8929 6077 7000 8000 5058 8048 6193 7106 9842 5364 8910 5440 7374 9386 7027 8063 6252 5591 6137 9600 8168 7214 5167 7542 8644 5590 8632 8872 9626 9990 5099 6011 8133 9074 9543 6168 7652 6539 9983 8831 5872 9982 7530 9608 8720 8246 7467 8293 5600 6979 8515 8212 9810 5366 9353 8017 9539 8306 8370 5809 9937 9480 8446 9462 7858 8508 6578 9966 7692 5220 6356 7198 5455 8075 8265 6398 6452 9704 6014 9160 5951 7949 9488 7346 6552 5128 7572 6518 8912 8424 7663 7203 6306 7995 6986 5218 9718 7131 9985 8583 8116 7276 9246 8650 6764 7290 7758 8842 8977 5359 7889 7431 8590 8740 7210 5045 8853 9084 8911 7219 8561 6042 6983 9625 5489 5326 6022 9735 7024 7839 5464 8094 7001 6684 5740 7430 9433 7014 6514 6992 9233 8723 9864 5054 5281 9788 7904 6066 8883 9369 6198 7792 6370 7149 9475 5758 5310 8839 7324 7066 5831 5205 8865 5069 9100 8312 8026 6599 9948 6418 8375 8567 6498 5723 7765 7201 6553 8498 5372 7451 6201 9411 5987 5124 6234 8016 7806 8616 7791 5316 9461 5510 5165 7225 9550 5219 8074 9750 8736 6421 8242 8147 8366 7289 8023 5895 8743 8264 5528 5435 7735 8368 8533 9624 6442 7399 7698 9840 5037 7918 9962 8773 7986 5567 9042 6570 6331 9341 5073 6505 6687 7033 7282 9740 9971 7369 5288 6993 5647 7687 8338 5487 6372 9904 5449 5144 7890 7301 9359 7519 6910 7111 5631 7264 8992 7318 9296 6274 9267 8586 8813 5436 9262 5277 6807 9166 9374 7055 6675 8606 9194 9544 9953 7205 7216 6197 5160 6118 6845 9305 9710 7054 5634 9896 6210 6592 9232 5839 5907 9445 8749 5856 9412 5552 9725 6044 7800 9671 5349 7166 6051 8099 5836 7957 7428 8045 8267 6744 6360 9141 5864 6490 6154 9125 6706 5444 7750 5115 6747 5681 5929 6120 5104 5633 8356 6797 6470 8214 9406 6148 7492 8714 6487 7656 5270 9053 9793 9342 5800 9122 5242 7947 8993 7228 8825 5790 8698 9096 5560 6894 9054 7877 9196 6249 9363 5499 9552 8608 9000 7729 6850 9892 6619 8444 5612 5672 5538 5049 8282 7741 8577 7655 8486 5139 6818 9028 9193 8343 6871 9089 7706 7370 9256 6922 7863 7874 5922 9240 5814 5859 9152 8642 6377 8690 5411 8754 9588 8445 5107 5050 9211 8450 8451 9944 9263 6759 9086 9446 6736 5719 6681 5784 5882 5237 9494 8682 5030 8299 9871 9672 7583 7945 5221 6021 7911 9753 5005 9120 9289 8886 9357 9674 9893 5904 7782 6559 7790 8106 5383 7165 6663 6947 9685 6383 9686 7002 9320 7220 6359 8994 8436 8965 7362 9869 9248 9758 7176 7244 5537 8998 6094 6509 8011 8456 6344 6612 9839 7262 9159 6898 8621 8152 8982 9162 5958 7058 5716 9041 6512 5539 9865 7404 6076 8794 6402 5644 9887 7153 6546 5038 5298 7743 7568 7560 8701 6511 8054 7418 7150 6132 7681 5808 6182 8324 9537 6785 5731 6123 7291 5405 7669 7500 5554 9587 7971 9576 8750 8552 7256 8382 9228 8353 5733 5561 5381 6291 8230 8141 5650 5969 9852 8358 6012 7823 5094 8432 8302 9013 7789 9531 6729 6936 8712 9474 8814 9184 7459 5973 9878 6774 8235 6601 5033 5642 9468 8770 9761 6949 5628 6758 7356 8694 9220 5478 6672 8491 8613 5374 8862 7351 9332 6854 8826 9261 5344 5446 5265 7685 5743 8840 5365 7493 7454 7036 5945 9297 7963 9967 8158 7317 7784 7554 8851 7063 6379 6779 9958 5223 5290 9130 7107 7939 6176 6534 9741 5505 6298 5126 7477 6606 5494 6837 6183 8648 6451 6107 8558 9995 9087 7308 5056 7813 8996 8744 8899 5474 7673 7950 6946 6061 5191 6555 8689 7088 7797 6339 6440 9073 8748 6443 7416 8952 8990 5852 9487 6446 7723 7926 8676 6658 5861 8122 9236 9223 5098 9173 8846 6620 7425 6710 8006 9512 5304 7381 5851 8175 5849 9413 7618 8098 6817 5663 7833 7466 8364 8191 5954 8891 8549 5930 6342 8415 6236 9014 6497 7824 9568 9570 5963 9383 7725 5745 5362 6600 9293 5853 7841 9008 8543 8022 5040 7569 8256 6974 7139 8289 7632 5523 5179 5340 8729 8121 8313 7414 6721 6387 7637 7564 6391 5026 9934 8241 9771 8229 7671 6842 6912 5458 9500 6038 7064 7429 7283 5524 6813 9230 5928 6673 5804 7390 9902 6608 7047 8947 9198 7348 8386 9409 7056 6455 8966 9456 9635 5004 9345 7753 6303 8917 6762 8945 9108 9809 7505 5512 9561 6677 5909 9880 5639 6705 8760 7859 6625 5659 7777 5156 8442 7848 8467 8490 5028 6200 6420 7226 7169 5829 7521 7981 6981 7254 9746 5917 7804 8834 5871 7744 7071 9571 9392 5400 6282 7122 8263 9165 6692 5683 6315 9119 6293 9111 7882 9393 5827 8785 7092 5870 8024 7781 8954 6945 9161 9294 6103 5235 8870 6528 5597 9582 8344 5148 8172 8974 7928 9470 7221 7906 7516 7751 7191 6527 5019 9134 6980 6499 6126 9057 5185 8357 5807 7678 8220 7383 9604 8409 9238 9850 9884 6646 9113 9428 5259 7295 8411 6750 9737 5186 9133 5533 7384 9235 8135 5594 7942 7559 5675 7409 7321 5169 6749 9687 6084 6268 6614 7834 6005 6800 5615 7999 9662 8663 7604 5582 6638 9155 7896 8575 5595 8395 8452 9719 9961 5961 5724 8978 5245 7640 7849 8431 8423 5760 7585 9611 8061 8854 7306 9977 7025 6396 8995 8062 7305 9931 9824 9823 7571 6320 6001 9743 7234 6062 9321 7498 7776 9128 7084 9923 7549 7984 8502 5034 9651 8979 5652 8095 8249 7125 9395 5974 7170 8557 5482 5424 7539 7114 7574 6099 8677 6006 8130 9304 8668 5137 7380 7360 8153 5778 5457 5175 7996 6017 9092 9696 8838 5938 9349 6968 9649 8653 9634 6674 6163 7050 9031 7192 9153 7892 7837 8849 7886 9388 6780 8790 8730 9832 8311 9560 5811 7696 9883 6849 5653 8545 9059 8428 7908 9838 5546 5481 6231 7816 8345 7217 7897 8789 8189 5981 8529 7248 8804 5913 9338 8666 7197 8596 7704 9171 5801 8844 8383 7842 7633 8335 9678 6863 5729 9251 8600 7065 7954 5570 6784 5018 8815 6508 8786 6048 7660 9247 6136 6746 7814 5713 8928 5611 8340 7558 9690 5008 7576 9491 7471 6925 9620 7973 7280 5691 6526 6812 6920 9830 9068 9018 6349 5602 9629 8337 7853 9459 8174 5268 5674 5805 6164 9742 6480 5988 7408 6477 8462 6868 8693 9942 7672 9563 5625 7977 6741 7515 9005 5918 7095 8325 8572 7546 6040 6239 9630 7962 9603 7580 8244 7899 9255 7626 8544 7875 6565 8321 5770 5087 5868 8507 7464 8757 9851 6082 6884 9045 5247 8821 7044 9285 8262 9389 7992 6145 9723 7989 9399 8582 5677 8523 5531 5695 9273 5863 6275 6336 8036 6985 7434 6679 6016 5891 6799 8973 6144 7010 6475 7212 5817 5509 8551 6468 9503 6937 6129 9999 9298 5013 9467 8935 9930 9589 5532 8083 7008 6127 5542 7367 9709 6215 9201 7712 5229 8780 8819 8950 7808 5730 7920 8463 6857 7653 6134 5997 5212 5207 6575 9279 9668 8433 6756 9754 7756 6711 8279 9673 7325 9124 8334 9769 8546 7229 5375 5665 6485 6486 8055 9242 8414 8047 6693 7026 7151 9785 7178 8128 6770 7843 5847 9408 7930 9542 5162 8784 6461 8808 5168 6962 8758 7082 8591 6078 8852 5755 6092 8622 9021 7436 5785 7545 9924 7415 6699 9189 8025 9105 6444 7788 7514 8243 8765 7759 8997 6160 7603 5989 8796 7600 9907 9012 5463 9026 7127 6899 8417 5810 8223 5799 9670 6978 7441 6615 7697 8218 8742 9227 8639 7491 9443 5318 7643 5343 6276 9493 5469 7541 7793 7794 5172 9915 9732 9549 9555 6879 6631 8155 8574 6296 5338 7894 7880 8443 6300 8710 6358 7693 8625 9987 7940 8700 7140 9362 9176 9700 9529 7211 7422 7319 6096 5773 5721 5398 6086 5297 9492 6840 9022 6436 8086 8550 6302 9613 5467 7155 5356 7227 7011 9454 9300 5468 6277 8503 6491 8184 8197 5854 8664 8942 7905 8173 5668 8187 9952 8073 8009 7527 5091 5475 7537 5558 9315 9681 6513 5419 7388 7586 5869 8930 6467 9728 7577 9043 8779 8496 8248 6781 5545 8251 5062 8866 7181 8317 9798 7296 5777 9778 5275 5855 9834 7636 5563 9283 8520 6034 9714 7009 6222 9954 5583 5445 8629 9367 9416 5718 9245 9612 6406 6203 5506 5670 5915 8180 6809 8588 8724 9442 8333 7944 7109 8737 6991 7891 8981 8042 5702 6984 8882 7927 6424 9504 9591 5747 6495 8376 6873 6269 9695 5151 7522 9490 6064 7497 8553 7959 9407 8906 7463 7646 8301 8776 9482 6255 6775 5959 9097 9104 5391 8809 9451 5889 8847 8704 8067 5693 7123 9157 8247 8021 7118 5926 8455 8166 6695 7490 9266 6790 6585 8300 9818 5906 6940 8104 7968 6369 7941 7680 7184 5679 7334 9551 6116 8355 7909 6815 5876 7619 5513 7020 8619 8609 6093 7474 5299 6732 6327 7713 6789 6240 9913 6151 7345 6188 7022 5931 5209 5996 7403 5116 9921 9806 9888 8273 5581 5880 8554 5161 8194 8592 8890 6703 7208 5226 5272 9882 8670 7714 9857 7124 9745 5396 7598 9925 8764 9381 7573 7764 6506 7313 9927 5278 8060 8404 9595 8936 7845 6739 8868 9996 5279 9684 9397 9378 5112 8171 5261 7978 5806 9091 9538 5254 7200 5360 5354 7757 8964 6325 8897 6720 8019 5754 6237 6745 7157 8005 8946 7811 8532 8165 8541 7035 6317 5491 6117 6939 9390 9926 9452 8799 6265 6704 5170 7350 5377 5325 8416 6855 7059 8635 5426 9773 9258 7668 5135 6169 6283 5885 9083 5319 7807 5795 5053 7809 6368 6355 9858 5555 9606 5735 5111 5798 6311 7115 8336 9214 5815 8620 7023 7183 8615 8725 6363 5774 6787 8208 9713 9854 6457 9922 7588 8559 8396 6230 8716 6083 6550 6771 8143 5671 6724 8008 9969 8822 7595 9920 7258 5577 6951 8425 9643 5227 9055 8962 7587 9327 6409 6921 9334 5627 9914 7030 6243 6712 9532 7961 9299 5136 8091 9744 7479 9082 6348 8855 6930 7159 5473 9724 7294 8115 6323 6273 5526 7406 6653 9047 5568 9023 6753 5485 5291 8319 8678 8179 7502 9712 5962 7976 7354 6346 9017 5353 6493 7387 9396 9516 5547 6408 8059 7073 9933 8972 9065 5490 7185 7091 6836 8043 7338 5132 8405 9485 7057 7332 6617 6469 6877 9794 9776 5269 6109 6297 5077 8211 5264 6058 6322 8236 8761 7881 8068 9020 8589 8350 8471 8489 9767 9957 7006 6032 5835 5057 9447 7766 5154 6476 9314 5921 7499 9805 8531 7089 9358 6170 7337 6806 7798 6427 7469 9822 8162 8580 9530 6254 5267 5177 9015 5461 8226 6888 8519 5940 5470 8932 9385 7007 6089 8832 9142 8512 5992 8435 7488 6209 5232 5762 8266 5484 7238 5224 5673 8437 6333 6366 9770 7188 9827 8598 8420 9426 6607 5603 8782 5534 8828 9373 9956 6472 7060 6919 8181 7820 7432 5637 6329 7836 6627 5408 7520 9102 9259 6115 9751 9107 9415 7343 5395 9739 7775 9890 7993 7690 7173 6036 5052 9693 8439 5389 6905 8681 5080 6332 9380 9682 9609 8871 8833 5341 6524 8139 5977 7134 5313 5072 7420 8726 8522 6581 6218 5121 7615 7116 6551 5927 5522 9269 5043 6481 5402 5571 5321 9715 7250 7241 8797 8527 8556 5294 9401 8659 9435 8079 5942 6831 7862 6165 7802 8755 5536 6882 5540 9425 7085 5041 5021 9002 8539 9207 7137 5820 7299 6002 7547 5393 9599 5385 6106 9118 9697 5788 8259 7398 5825 7727 6195 7263 8791 8323 7617 5300 9148 6029 8385 9486 7701 6456 7846 9509 9354 5415 6365 9511 7762 6147 5129 6053 9638 5759 5932 7297 9078 7231 8198 5960 8922 6875 5548 9328 7393 8963 8120 9716 8287 6496 7233 5331 9032 8169 8332 9577 5012 7844 6864 6504 8860 7872 8867 9340 5079 7934 7990 5102 9980 6052 9469 6204 5543 5794 9573 8240 7630 6970 8902 8188 6761 9368 7620 8339 9352 8892 6848 6185 5783 9099 6104 9749 7754 9077 6217 6133 5406 5158 9192 7642 6405 6246 7511 9115 6388 7691 9800 7659 7590 5551 9623 6825 8365 7901 8131 9149 8949 6895 5296 9497 9759 7888 7487 8105 8944 8103 7917 8142 9318 8884 8438 9270 8707 8518 7594 8638 8200 7518 7955 7985 6149 9667 7199 8209 6846 8548 8400 7658 9317 9282 6221 7121 7524 6324 6178 5314 9772 6088 5202 9820 6450 6723 5213 6385 9402 8686 9781 6901 5751 5980 5502 8245 8856 5593 5838 5240 5952 8327 5348 6454 6449 5976 5217 8307 9384 7752 6881 5076 5881 7835 8298 9698 9347 5222 7988 9035 6432 8403 8721 7003 9775 7870 7734 6068 6156 9688 9875 8923 8924 9439 9110 8097 5492 8331 8401 6530 7922 5140 7130 6155 8190 6112 9554 6401 5648 5544 9085 5239 6522 5432 5065 7142 7298 7946 5346 6924 5638 7160 8207 6219 6039 6596 5197 9541 9191 7799 6259 5355 6733 8562 7952 8894 6397 6438 7885 5596 9158 9030 8373 5255 5404 6801 6037 6929 8706 8727 7903 5421 5968 9586 6820 9424 5897 8800 5623 9978 9912 5803 5208 9534 7772 5285 8303 5939 5295 9436 8328 9350 6003 6915 9594 9748 5243 9655 7980 5998 5727 6545 6660 5064 8703 6199 9574 6793 8388 7180 5935 9478 9791 6649 7136 5899 8458 6727 8593 8315 8157 9234 8602 8787 5029 8594 9590 9867 8980 6194 5394 6686 6728 5130 8679 5993 7336 5263 7967 6453 6767 5498 7565 6428 9150 7742 5972 8565 5379 9222 9288 8119 6778 6566 7052 6642 6960 8818 7715 9889 9311 6766 6914 7135 7307 7737 6616 7787 7269 5204 9473 8182 5710 6479 7455 8151 6657 9515 7242 6814 5450 8146 9044 6696 5479 8276 5692 6189 7126 8888 6085 7907 8823 9081 8918 7919 8874 5078 6525 8685 5392 9602 8595 9755 5619 5655 6626 7426 6648 9726 6191 7304 5384 7763 6312 6598 9760 7871 6628 7852 5495 6786 5164 7556 8889 6961 7644 9812 6886 7273 5520 5157 5280 9689 5216 5273 9326 8988 9145 7456 8667 8953 5924 8278 8305 8087 6400 5322 5592 7376 9894 5765 7935 8806 7352 7077 9281 5894 5363 5103 6375 5689 8816 5257 9029 9991 5036 5184 9046 6916 5620 7838 7829 5301 7446 6999 5975 8314 7365 7078 9535 6027 8837 5995 7312 6641 8286 6364 5329 6932 8177 8538 5816 7209 5950 5742 6726 8056 8573 7771 6666 8253 9007 5569 6923 6702 5496 9253 9909 5862 5823 6595 9335 5370 8927 8394 7856 7529 6070 6266 7972 5183 8887 7826 6347 8412 9066 6562 8096 9527 6261 9346 7311 6564 9037 9701 5678 5527 7974 9448 5233 5097 5249 5761 9520 7818 6547 6639 8320 5767 5626 6313 8033 7648 8228 9908 9302 7105 8477 6124 8895 6000 8082 8029 5480 9949 6233 8499 8156 7915 6690 7072 8926 7768 5173 6782 7508 8967 7579 7119 5726 8233 8734 6435 5093 8878 9444 7921 5818 5901 8709 9429 9202 5746 9060 8753 9434 6994 8361 5035 5936 8510 9039 5048 5145 7405 7177 9174 5986 8759 7162 9939 6157 8093 5598 7736 9140 8885 5925 6735 8987 9797 6900 9181 6285 8521 8540 7037 7933 9210 9826 6751 5090 5640 8408 7548 9076 7780 5192 5074 7391 9736 5717 5422 7778 8517 6763 8570 9932 8294 9705 9936 6026 8457 7552 9659 6830 8536 6944 9680 7412 8078 6571 6643 8329 9164 7013 7994 7608 6345 5858 8669 7767 9001 5643 5890 9870 6284 5822 7407 5580 8984 6108 6335 8955 9080 9219 6381 8377 9351 8159 7821 6492 7969 6251 7327 5840 7956 8792 9004 6146 8219 8739 9215 6179 6543 7270 8363 5230 7936 7688 6065 8176 7526 6111 6591 6439 8999 7480 5251 7372 5388 7385 7635 7589 9984 5576 6483 6613 9190 7481 9336 6540 6664 7611 7215 6015 9796 5488 8413 7364 6839 9377 9553 8406 8738 8107 5586 7489 5352 7179 6371 9993 9960 5703 6503 5003 9733 5608 6413 6314 5764 8225 7861 9464 9768 7982 7610 5176 9292 8975 8080 5302 6792 6860 5589 7902 8125 8330 7271 8631 8205 6803 8378 7812 9641 5616 5956 9859 6351 6287 9483 6430 6090 5133 8322 6678 6880 5618 7148 7090 7452 5887 8611 9286 6253 9658 8488 8985 9959 5749 7575 9525 9295 5865 5459 7275 5286 8269 9580 8599 7709 6748 8137 7476 6576 6577 8202 6441 5707 9272 6688 9699 8824 8836 9825 9284 8835 7584 8603 8931 8281 9779 5293 6309 8881 5011 6972 5802 8250 9844 8643 7898 9707 7423 9994 5966 7677 9669 9208 7779 6694 8084 7401 9558 6897\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | one-and-zero | Solve the following coding problem using the programming language python:
Little Raju recently learnt about binary numbers. After spending some time with it, he decided to count in how many ways he can make N digit numbers that is formed by ones and zeroes. But zeroes can not be next to each other. Help him finding in how many different numbers can he make?
Example: There 5 possible ways of making different numbers using 3 digit numbers i.e. 101,010,111,110,011
Input
First line of input contains the total number of test cases T.
Next T lines contain N as explained above.
Output
For each test case print in newline as explained above.
Constraints
1 β€ t β€ 10
1 β€ n β€ 10^4
SAMPLE INPUT
2
3
7
SAMPLE OUTPUT
5
34
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
'''
# Read input from stdin and provide input before running code
name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
print 'Hello World!'
'''
t=int(input())
for i in range(t):
n=int(input())
if n==1:
print(2)
else:
a=1
b=2
for i in range(2,n+1):
a,b=b,a+b
print(b)
``` | vfc_32821 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2\n3\n7\n\nSAMPLE",
"output": "5\n34\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n2\n8\n12\n16\n34",
"output": "3\n55\n377\n2584\n14930352\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n99\n44\n18\n999\n66",
"output": "573147844013817084101\n1836311903\n6765\n70330367711422815821835254877183549770181269836358732742604905087154537118196933579742249494562611733487750449241765991088186363265450223647106012053374121273867339111198139373125598767690091902245245323403501\n72723460248141\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4\n4521\n994\n5000\n10000",
"output": "797281796628824572275766474534666925488035978910510666176541202695187238537207292222515263470263975150354427143071883572815393068752952614287662217666583029231330324310512743623477680817432737782360284735108502282890958025665937928404105004070588647233776032155303958733594031249641474776333990161642921475112727481927661724278408031899313273963073193187310222525542079574783259699863623929810248077930822784599464550379553120558959725197211755459760071995496587811019822183070968875537098943295302482521846004928220901650651986003983548394310710422404907354286253686339279397786585510992149280176947873751774475904976469384002173513816938094601833505895223792932353689595534352635183485402391509195532003774874456542920254913581365286322739051328888925545844409594419258059923498342269413319506603048196282259161922481419916550403261558619363625032602725379363407402773508688345091297131332615592483739196222971829856591547421023514534545941657\n6341685300418834712936873743652479702279493077782703784593930186219165735154458712792650716708440646016361617676315200611489358319848695671037772054859840711063922357900430130265783715452104982240098275933872\n10155271254877282719737169416675589367560656417382702545186421663823487395855700361486706627990016919809278143108729793614131682091995090525071762844508041123437856986230906150147121431239681269513333741999521063833407045729945990803143534363748874595559849813062026777470470638396323355302064324950105112590855565075325207132901252221141601753091620105885002782541272980523433748679133725056954285048645156465913791091650561570339508745361861061504823036049789367020394981267114242963146007432721557562972152838429430094704001374871025956822758174287417144547055547875294336716588768892208522749561749117907713567136617456679554311294603428476537793240493696689626832492164790898668507351605532059326222006676585627563434141701871738811374120284983458811508958520174475024709588612205383166804683342435510310727262679341067535000990749640607232740950842047358406711082163985256366372716358612168574785516697262395084192516849400282847805285486210909058113803383869771899781648525548676059904687176448290680543362010679314215213827249993614333751\n88083137989997064605355872998857923445691333015376030932812485815888664307789011385238647061572694566755888008658862476758094375234981509702215595106015601812940878487465890539696395631360292400123725490667987980947195761919733084221263262792135552511961663188744083262743015393903228035182529922900769207624088879893951554938584166812233127685528968882435827903110743620870056104022290494963321073406865860606579792362403866826411642270661211435590340090149458419810817251120025713501918959350654895682804718752319215892119222907223279849851227166387954139546662644064653804466345416102543306712688251378793506564112970620367672131344559199027717813404940431009754143637417645359401155245658646088296578097547699141284451819782703782878668237441026255023475279003880007450550868002409533068098127495095667313120369142331519140185017719214501847645741030739351025342932514280625453085775191996236343792432215700850773568257988920265539647922172315902209901079830195949058505943508013044450503826167880993094540503572266189964694973263576375908606977788395730196227274629745722872833622300472769312273603346624292690875697438264265712313123637644491367875538847442013130532147345613099333195400845560466085176375175045485046787815133225349388996334014329318304865656815129208586686515835880811316065788759195646547703631454040090435955879604123186007481842117640574158367996845627012099571008761776991075470991386301988104753915798231741447012236434261594666985397841758348337030914623617101746431922708522824868155612811426016775968762121429282582582088871795463467796927317452368633552346819405423359738696980252707545944266042764236577381721803749442538053900196250284054406347238606575093877669323501452512412179883698552204038865069179867773579705703841178650618818357366165649529547898801198617541432893443650952033983923542592952070864044249738338089778163986683069566736505126466886304227253105034231716761535350441178724210841830855527586882822093246545813120624113290391593897765219320931179697869997243770533719319530526369830529543842405655495229382251039116426750156771132964376\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n2\n8\n12\n26\n34",
"output": "3\n55\n377\n317811\n14930352\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n99\n44\n18\n999\n35",
"output": "573147844013817084101\n1836311903\n6765\n70330367711422815821835254877183549770181269836358732742604905087154537118196933579742249494562611733487750449241765991088186363265450223647106012053374121273867339111198139373125598767690091902245245323403501\n24157817\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | random-delimma-4 | Solve the following coding problem using the programming language python:
Manu is a very bright student and had learned c++ Programming on her own.She has covered loops and if/else.She is a very inquisitive child and always love to discover new things.Same applies to programming she learns various syntax.One day while reading the documentation of a cstdlib library she came across a function called as rand().To test it's applicabilty she writes the following code.
//Program generates a random number in the range from 1 to n both inclusive and stores it in the array a the number of elements being k
#include<iostream>
#include<cstdlib>
using namespace std;
int main()
{
int k,n;
cin>>k;
cin>>n;
int a[k];
for(int i=0;i<k;i++)
a[i]=rand()%n+1;
for(int i=0;i<k;i++)
cout<<a[i]<<endl;
return 0;
}
She executes this program and sees that the number in the array are not unique but are repeating.Now she wonders after iterating for the fixed value of k what is the probability of two numbers in the array being same(in value).
Constraints
n & k are less than 2000.
Input
First line consist of T representing the number of test cases.T lines follow.Each line consist of two values k representing the number of iteration and n representing the range of elements in n.(ie 1 to n).
Output
For each input values output a single value representing the probability. Output the answer rounded up to 9 decimal places
SAMPLE INPUT
2
4 10
7 6
SAMPLE OUTPUT
0.496000000
1.000000000
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
t=input()
while t>0:
k,n=map(int,raw_input().split())
if k>n:
print "1.000000000"
else:
f=1.0
for i in range(n,n-k,-1):
f=(f*i)/n
f=1-f
print "%.9f"%(f)
t-=1
``` | vfc_32825 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2\n4 10\n7 6\n\nSAMPLE",
"output": "0.496000000\n1.000000000\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | simple-task | Solve the following coding problem using the programming language python:
Given an array A. Delete an single element from the array such that sum of the differences of adjacent elements should be minimum.
For more clarification Sum for an array A having N element is defined as :
abs( A[0] - A[1] ) + abs( A[1] - A[2] ) + abs( A[2] - A[3] ) +............ + abs( A[N-2] - A[N-1] )
Input:
First line contains number of test cases T. Each test cases contains two lines. First line contains an integer N, size of the array and second line contains N space separated elements of array A.
Output:
For each test case print the index of the element in the array A, which if deleted, minimizes the value of the sum.. If there is multiple answer possible print the lowest index value.
NOTE:
We are using is 0-based indexing for array.
Constraints:
1 β€ T β€ 5
1<N β€ 100000
1 β€ Arri β€ 10^9
SAMPLE INPUT
1
5
1 10 20 40 60
SAMPLE OUTPUT
4
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
t=int(raw_input())
for qq in xrange(t):
n=int(raw_input())
l=map(int,raw_input().split())
s=sum(l)
minval=9999999999999999999
ret=0
if n==1:
print 0
continue
for i in xrange(n):
tmp=0
cp=s
if i>0 and i<n-1:
tmp = abs(l[i]-l[i-1]) + abs(l[i]-l[i+1])
cp-=tmp
cp+=abs(l[i+1]-l[i-1])
if cp < minval:
minval = cp
ret=i
elif i==0:
cp-=abs(l[0]-l[1])
if cp < minval:
minval = cp
ret=i
else:
cp-=abs(l[n-2]-l[n-1])
if cp < minval:
minval = cp
ret=i
print ret
``` | vfc_32829 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "1\n5\n1 10 20 40 60\n\nSAMPLE",
"output": "4",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n1\n100\n2\n100 1\n2\n1 2\n3\n1 100 2\n3\n1 2 3\n3\n1 5 6\n3\n1 7 8\n3\n8 7 1\n3\n7 8 1\n3\n7 1 8",
"output": "0\n0\n0\n1\n0",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n1\n100\n2\n100 1\n2\n1 2\n3\n1 100 2\n3\n1 2 3\n3\n1 5 6\n3\n1 7 8\n3\n8 7 1\n3\n7 8 2\n3\n7 1 8",
"output": "0\n0\n0\n1\n0\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n1\n100\n2\n100 0\n2\n1 2\n3\n1 100 2\n3\n1 0 3\n3\n0 5 3\n3\n1 7 8\n1\n8 7 1\n3\n7 9 2\n3\n7 1 8",
"output": "0\n0\n0\n1\n2\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1\n5\n1 7 20 40 60\n\nSAMPLE",
"output": "4\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n1\n101\n2\n100 0\n2\n1 2\n2\n1 101 2\n3\n1 0 3\n3\n0 5 3\n3\n1 7 8\n1\n8 7 1\n3\n7 9 2\n3\n7 1 16",
"output": "0\n0\n0\n0\n2\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | the-substring-problem-1 | Solve the following coding problem using the programming language python:
You have been given a set of N strings S1, S2, .... SN. Consider any non-empty string S (S need not belong to the given set of N strings). Suppose S occurs (as a substring) in K out of the N given strings in the set. Your job is to choose S such that the value of K is maximized. If there are many such strings, choose the one with the least length. If there are many such strings with the least length, choose the lexicographically smallest of them all.
Input:
The first line consists of T the number of test cases.
The first line in each test case consists of N, the number of words in the given set. Each of the next N lines contains a single word consisting of lowercase English alphabets (a-z) only.
Output:
Print the answer to each test case on a new line, the answer to each test case being a single string S as described in the problem above.
Constraints :
1 β€ T β€ 5
1 β€ N β€ 100
1 β€ |Si| β€ 100, |Si| denotes the length of the input words.
Author : Himanshu
Tester : Shreyans
(By IIT Kgp HackerEarth Programming Club)
SAMPLE INPUT
1
1
shades
SAMPLE OUTPUT
a
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
t=input()
for i in xrange(t):
n=input()
l=[]
for k in xrange(n):
s=raw_input()
l.append(s)
q="abcdefghijklmnopqrstuvwxyz"
o=[0 for i in xrange(26)]
for x in xrange(n):
for y in xrange(26):
if q[y] in l[x]:
o[y]+=1
z=max(o)
for j in xrange(26):
if o[j]==z:
print q[j]
break
``` | vfc_32833 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "1\n1\nshades\n\nSAMPLE",
"output": "a\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n20\nengagfwhxalwaaucqieavxyutinrmtd\nnxhehybspixeykxillunrhswxskfrzkljeigxwaumrlfqlrrjlngxcyddtunll\nhcqpdelycqspbqrorpslpqwy\nzzjclluwfsyzxvzldjvdpfshbghqcepchuepklddqgtalcbupgexclfdjzjkctlnayuhgrvcsqyxatokefjwbnzvu\nfuxfecjlwilndrijri\naykqwypnriohkyizfvihjkyanijciyqxjslpqdjjjilvekfyphsyqwfshboilbimhp\nhqifzwueaamlrhmvapgkghndjlgfqghtbapfhkrdwagtlleadcuiaezhfmgwmkic\nnektwjpbzcfvpdowsisugqruqwxxzxrvdbqohisfipyclxpniincljoehupkuexsoynwhrdsrjdmwcesatpejycadgsvbdtfc\noxoevgmmrzcgvdaqwaejgbetzsmjcfjyewadvv\nbfoytudjdbicgypavgjiornxgqzhlonmktwrziskugghuzkpkswlsvirulnfafkodadhwcmpgwyovjgwfyp\nisclujraehmtbkespwfxzkhobztpcgsyrbtseyjfakfpanwmzygy\nbkvvqmrprnqlnnzrtoee\naohm\nvupaixmegapshbxygkxwylcvtdxicpycyyzezdzthwdymgdrtcqubkqnylbnzd\nswkjutvpjmtarhrnmzdhvhgumncuepbztvazqmgsxdkfzwaynnotnh\nrusdnqqkjbeornbkfqvdpqmxbrtoswlxm\npmpldxnhzzaumqybkmf\ncvdrnrltyplxbrnsamyowrzpoeuuzxuackzbnhlnsclksbkpwrehp\ngtsocbfvdtzoraftbtpoenzlozifzxq\nvrwvvoifrmrkajojgbdesyxturegomkwpnudmcfbrt\n35\noigzlluhclcxffaicezwamihlsnnscmaommatyqbxywjumpsruqvzzezxbjbwsysshjqrndgphufiraxldeftgnx\nsoiaekkrcxbkfzwclrczalkrhtdrmwoajojbjhzwadoyqxxtxfhgjvthftzcetoo\nesavaautmywodmfabsrbgiqqybvezffjsnw\nniymlbhjjeqydtjhihtuiozsqgjkqokadjywbnoblzbkleoabmjeqkebuzeuedbxvdrteiokzzawlojvzhbjcffkvyfqa\ntvugoybicevhvvtepaaaynjsvsuwsoszpkxnqnuivr\npsadebnavrgrep\npxikgpzgkdirzjhdcnhzvaarwkobhvccnqcekbxjkunxgnpxswbfwsudysghhbhkwttzdsssjekzvqcmlwsmadynb\nwdxavtfyunlefirloeixhhhuvbgpyoqbnwogesiusqfngwkfsovmhmqufbbmvxrpckirjzlfcbugzigdomyjjfk\nusxnfoooctgfqfhgxpy\ntkfqvzsvuhxdqxgjvygbomcefjztmaztmfxysupmxxjvbxxikkqjmilazlpoxxycpkgjapzctg\ncdmte\nqkfndzpzveixgikcjnokeocmdbtjraawl\novsgmooanbkxuh\nwllzqdduglhzxgewbtpqxmnzlheikgorvmoixnbbkzcscmzhyrjhrjav\ngpkvanvekllxkbnitucdgteejaawjndkbyjwpdmjzxrzyotjrleqrdivizgfdkzsngwt\ndbuavpnddhevidbwiezcwxwdutnohieqeaxfaovizbvfakietnqbmvufgypuwbhbmmhwnuysmsxkzdvktlvhxjnyrpcgnx\nquqhuhkkvxehsbndfwemxkqj\naflwnnout\nfhtohjtzrvxjuqdowhxjgtrmymdcrionqgyup\nrveffvraxzythrluyybvlqdpyxunlarfarilqmbkrbeczyqpstarcasdpjvwchfhvepnzugqdimvaapvlznoypuvqipymhdc\nyunrcoobwhkxizmswllmprclkhdgcm\nbjxqrdgnvjidctmicfzbqtbsbcffdlydwdjlexlhfrdfezaeqplozyh\nyqmswtpgqxwsvgvkeyrgkrxshdgowydyvhnhoatwortvsnbb\neqqdwrqgtobahzzrqgruvsdnngbentjagsljmebqqddwewuqxjkuddjcwrkzzncoddoqiqhrqbzxmcibtkkdulygtmglc\nfajfqaqwgwtsgi\ntootbjfwaykwrdrolxjrmtbhwbqnkqldxtinkamypgxrzgsxhryomtswwxondrnfhxbsbyxjs\nhznieghznckohfcc\njofhgruqzddvubxrelnlmvuuoqddhaquhvxuvhug\nkzaweesamriakus\nraqrwjkiywn\nyjohqqufrxpriurcyltpgzipadvbrizgkcvbnzmhrwlyznrwxgwwjbqkyokconlbbbefdc\nbstnqtlpqdpstcxpzqejwrvftzyiecjdqvvkfgmsc\nmarslbixjxgejgkejvharazpkvgtydqmcnhcvscpxaqckyhrvugfhqwootekzxctbkryuzfmyatkh\nthoodgjojxakxksf\normxtcqcatfnwrqsmeibpplyfvvyqxfafjtsjpeqxlulldazrkpbeyixfphvmmmbslcfqxmzguncrquludifjkpmi",
"output": "r\ng\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n20\nengagfwhxalwaaucqieavxyutinrmtd\nnxhehybspixeykxillunrhswxskfrzkljeigxwaumrlfqlrrjlngxcyddtunll\nhcqpdelycqspbqrorpslpqwy\nzzjclluwfsyzxvzldjvdpfshbghqcepchuepklddqgtalcbupgexclfdjzjkctlnayuhgrvcsqyxatokefjwbnzvu\nfuxfecjlwilndrijri\naykqwypnriohkyizfvihjkyanijciyqxjslpqdjjjilvekfyphsyqwfshboilbimhp\nhqifzwueaamlrhmvapgkghndjlgfqghtbapfhkrdwagtlleadcuiaezhfmgwmkic\nnektwjpbzcfvpdowsisugqruqwxxzxrvdbqohisfipyclxpniincljoehupkuexsoynwhrdsrjdmwcesatpejycadgsvbdtfc\noxoevgmmrzcgvdaqwaejgbetzsmjcfjyewadvv\nbfoytudjdbicgypavgjiornxgqzhlonmktwrziskugghuzkpkswlsvirulnfafkodadhwcmpgwyovjgwfyp\nisclujraehmtbkespwfxzkhobztpcgsyrbtseyjfakfpanwmzygy\nbkvvqmrprnqlnnzrtoee\naohm\nvupaixmegapshbxygkxwylcvtdxicpycyyzezdzthwdymgdrtcqubkqnylbnzd\nswkjutvpjmtarhrnmzdhvhgumncuepbztvazqmgsxdkfzwaynnotnh\nrusdnqqkjbeornbkfqvdpqmxbrtoswlxm\npmpldxnhzzaumqybkmf\ncvdrnrltyplxbrnsamyowrzpoeuuzxuackzbnhlnsclksbkpwrehp\ngtsocbfvdtzoraftbtpoenzlozifzxq\nvrwvvoifrmrkajojgbdesyxturegomkwpnudmcfbrt\n35\noigzlluhclcxffaicezwamihlsnnscmaommatyqbxywjumpsruqvzzezxbjbwsysshjqrndgphufiraxldeftgnx\nsoiaekkrcxbkfzwclrczalkrhtdrmwoajojbjhzwadoyqxxtxfhgjvthftzcetoo\nesavaautmywodmfabsrbgiqqybvezffjsnw\nniymlbhjjeqydtjhihtuiozsqgjkqokadjywbnoblzbkleoabmjeqkebuzeuedbxvdrteiokzzawlojvzhbjcffkvyfqa\ntvugoybicevhvvtepaaaynjsvsuwsoszpkxnqnuivr\npsadebnavrgrep\npxikgpzgkdirzjhdcnhzvaarwkobhvccnqcekbxjkunxgnpxswbfwsudysghhbhkwttzdsssjekzvqcmlwsmadynb\nwdxavtfyunlefirloeixhhhuvbgpyoqbnwogesiusqfngwkfsovmhmqufbbmvxrpckirjzlfcbugzigdomyjjfk\nusxnfoooctgfqfhgxpy\ntkfqvzsvuhxdqxgjvygbomcefjztmaztmfxysupmxxjvbxxikkqjmilazlpoxxycpkgjapzctg\ncdmte\nqkfndzpzveixgikcjnokeocmdbtjraawl\nhuxkbnaoomgsvo\nwllzqdduglhzxgewbtpqxmnzlheikgorvmoixnbbkzcscmzhyrjhrjav\ngpkvanvekllxkbnitucdgteejaawjndkbyjwpdmjzxrzyotjrleqrdivizgfdkzsngwt\ndbuavpnddhevidbwiezcwxwdutnohieqeaxfaovizbvfakietnqbmvufgypuwbhbmmhwnuysmsxkzdvktlvhxjnyrpcgnx\nquqhuhkkvxehsbndfwemxkqj\naflwnnout\nfhtohjtzrvxjuqdowhxjgtrmymdcrionqgyup\nrveffvraxzythrluyybvlqdpyxunlarfarilqmbkrbeczyqpstarcasdpjvwchfhvepnzugqdimvaapvlznoypuvqipymhdc\nyunrcoobwhkxizmswllmprclkhdgcm\nbjxqrdgnvjidctmicfzbqtbsbcffdlydwdjlexlhfrdfezaeqplozyh\nyqmswtpgqxwsvgvkeyrgkrxshdgowydyvhnhoatwortvsnbb\neqqdwrqgtobahzzrqgruvsdnngbentjagsljmebqqddwewuqxjkuddjcwrkzzncoddoqiqhrqbzxmcibtkkdulygtmglc\nfajfqaqwgwtsgi\ntootbjfwaykwrdrolxjrmtbhwbqnkqldxtinkamypgxrzgsxhryomtswwxondrnfhxbsbyxjs\nhznieghznckohfcc\njofhgruqzddvubxrelnlmvuuoqddhaquhvxuvhug\nkzaweesamriakus\nraqrwjkiywn\nyjohqqufrxpriurcyltpgzipadvbrizgkcvbnzmhrwlyznrwxgwwjbqkyokconlbbbefdc\nbstnqtlpqdpstcxpzqejwrvftzyiecjdqvvkfgmsc\nmarslbixjxgejgkejvharazpkvgtydqmcnhcvscpxaqckyhrvugfhqwootekzxctbkryuzfmyatkh\nthoodgjojxakxksf\normxtcqcatfnwrqsmeibpplyfvvyqxfafjtsjpeqxlulldazrkpbeyixfphvmmmbslcfqxmzguncrquludifjkpmi",
"output": "r\ng\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1\n1\nsahdes\n\nSAMPLE",
"output": "a\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n20\nengagfwhxalwaaucqieavxyutinrmtd\nnxhehybspixeykxillulrhswxskfrzkljeigxwaumrlfqlrrjlngxcyddtunnl\nhcqpdelycqspbqrorpslpqwy\nzzjclluwfsyzxvzldjvdpfshbghqcepchuepklddqgtalcbupgexclfdjzjkctlnayuhgrvcsqyxatokefjwbnzvu\nfuxfecjlwilndrijri\nphmibliobhsfwqyshpyfkevlijjjdqplsjxqyicjinaykjhivfziykhoirnpywqkya\nhqifzwueaamlrhmvapgkghndjlgfqghtbapfhkrdwagtlleadcuiaezhfmgwmkic\nnektwjpbzcfvpdowsisugqruqwxxzxrvdbqohisfipyclxpniincljoehupkuexsoynwhrdsrjdmwcesatpejycadgsvbdtfc\noxoevgmmrzcgvdaqwaejgbetzsmjcfjyewadvv\nbfoytudjdbicgypavgjiornxgqzhlonmktwrziskugghuzkpkswlsvirulnfafkodadhwcmpgwyovjgwfyp\nisclujraehmtbkespwfxzkhobztpcgsyrbtseyjfakfpanwmzygy\nbkvvqmrprnqlnnzrtoee\nbohm\nvupaixmegapshbxygkxwylcvtdxicpycyyzezdzthwdymgdrtcqubkqnylbnzd\nswkjutvpjmtarhrnmzdhvhgumncuepbztvazqmgsxdkfzwaynnotnh\nrusdnqqkjbeornbkfqvdpqmxbrtoswlxm\npmpldxnhzzaumqybkmf\ncvdrnrltyplxbrnsamyowrzpoeuuzxuackzbnhlnsclksbkpwrehp\ngtsocbfvdtzoraftbtpoenzlozifzxq\nvrwvvoifrmrkajojgbdesyxturegomkwpnudmcfbrt\n35\noigzlluhclcxffaicezwamihlsnnscmaommatyqbxywjumpsruqvzzezxbjbwsysshjqrndgphufiraxldeftgnx\nsoiaekkrcxbkfzwclrczalkrhtdrmwoajojbjhzwadoyqxxtxfhgjvthftzcetoo\nesavaautmywodmfabsrbgiqqybvezffjsnw\naqfyvkffcjbhzvjolwazzkoietrdvxbdeuezubekqejmbaoelkbzlbonbwyjdakoqkjgqszoiuthihjtdyqejjhblmyin\ntvugoybicevhvvtepaaaynjsvsuwsoszpkxnqnuivr\npsadebnavrgrep\npxikgpzgkdirzjhdcnhzvaarwkobhvccnqcekbxjkunxgnpxsmbfwsudysghhbhkwttzdsssjekzvqcmlwswadynb\nwdxavtfyunlefirloeixhhhuvbgpyoqbnwogesiusqfngwkfsovmhmqufbbmvxrpckirjzlfcbugzigdomyjjfk\nypxghfqfgtcooofnxsu\ntkfqvzsvuhxdqxgjvygbomcefjztmaztmfxysupmxxjvbxxikkqjmilazlpoxxycpkgjapzctg\ncdmte\nqkfndzpzveixgikcjnokeocmdbtjraawl\nhuxkbnaoomgsvo\nwllzqdduglhzxgewbtpqxmnzlheikgorvmoixnbbkzcscmzhyrjhrjav\ngpkvanvekllxkbnitucdgteejaawjndkbyjwpdmjzxrzyotjrleqrdivizgfdkzsngwt\ndbuavpnddhevidbwiezcwxwdutnohieqeaxfaovizbvfakietnqbmvufgypuwbhbmmhwnuysmsxkzdvktlvhxjnyrpcgnx\nquqhuhkkvxehsbndfwemxkqj\naflwnnout\nfhtohjtzrvxjuqdowhxjgtrmymdcrionqgyup\nrveffvraxzythrluyybvlqdpyxunlarfarilqmbkrbeczyqpstarcasdpjvwchfhvepnzugqdimvaapvlznoypuvqipymhdc\nyunrcoobwhkxizmswllmprclkhdgcm\nbjxqrdgnvjidctmicfzbqtbsbcffdlydwdjlexlhfrdfezaeqplozyh\nyqmswtpgqxwsvgvkeyrgkrxshdgowydyvhnhoatwortvsnbb\neqqdwrqgtobahzzrqgruvsdnngbentjagsljmebqqddwewuqxjkuddjcwrkzzncoddoqiqhrqbzxmcibtkkdulygtmglc\nfwjfraqagwtsgi\ntootbjfwaykwrdrolxjrmtbhwbqnkqldxtinkamypgxrzgsxhryomtswwxondrnfhxbsbyxjs\nhznieghznckohfcc\njofhgruqzddvubxrelnlmvuuoqddhaquhvxuvhug\nkzaweesamriakus\nraqrwjkiywn\nyjohqqufrxpsiurcyltpgzipadvbrizgkcvbnzmhrwlyznrwxgwwjbqkyokconlbbbefdc\nbstnqtlpqdpstcxpzqejwrvftzyiecjdqvvkfgmsc\nmarslbixjxgejgkejvharazpkvgtydqmcnhcvscpxaqckyhrvugfhqwootekzxctbkryuzfmyatkh\nthoodgjojxakxksf\normxtcqcatfnwrqsmeibpplyfvvyqxfafjtsjpeqxlulldazrkpbeyixfphvmmmbslcfqxmzguncrquludifjkpmi",
"output": "b\ng\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n20\nengagfwhxalwaaucqieavxyutinrmtd\nnxhehybspixeykxillulrhswxskfrzkljeigxwaumrlfqlrrjlngxcyddtunnl\nhcqpdelycqspbqrorpslpqwy\nzzjclluwfsyzxvzldjvdpfshbghqcepchuepklddqgtalcbupgexclfdjzjkctlnayuhgrvcsqyxatokefjwbnzvu\nfuxfecjlwilndrijri\nphmibliobhsfwqyshpyfkevlijjjdqplsjxqyicjinaykjhivfziykhoirnpywqkya\nhqifzwueaamlrhmvapgkghndjlgfqghtbapfhkrdwagtlleadcuiaezhfmgwmkic\nnektwjpbzcfvpdowsisugqruqwxxzxrvdbqohisfipyclxpniincljoehupkuexsoynwhrdsrjdmwcesatpejycadgsvbdtfc\noxoevgmnrzcgvdaqwaejgbetzsmjcfjyewadvv\nbfoytudjdbicgypavgjiornxgqzhlonmktwrziskugghuzkpkswlsvirulnfafkodadhwcmpgwyovjgwfyp\nisclujraehmtbkespwfxzkhobztpcgsyrbtseyjfakfpanwmzygy\neeotrznnkqnrprmqvvlb\naohm\nvupaixmegapshbxygkxwylcvtdxicpycyyzezdzthwdymgdrtcqubkqnylbnzd\nswkjutvpjmtarhrnmzdhvhgumncuepbztvazqmgsxdkfzwaynnotnh\nrusdnqqkjbeornbkfqvdpqmxbrtoswlxm\npmpldxnhzzaumqybkmf\ncvdrnrltyplxbrnsamyowrzpoeuuzxuackzbnhlnsclksbkpwrehp\ngtsocbfvdtzoraftbtpoenzlozifzxq\nvrwvvoifrmrkajojgbdesyxturegomkwpnudmcfbrt\n35\noigzlluhclcxffaicezwamihlsnnscmaommatyqbxywjumpsruqvzzezxbjbwsysshjqrndgphufiraxldeftgnx\nsoiaekkrcxbkfzwclrczalkrhtdrmwoajojbjhzwadoyqxxtxfhgjvthftzcetoo\nesavaautmywodmfabsrbgiqqybvezffjsnw\naqfyvkffcjbhzvjolwazzkoietrdvxbdeuezubekqejmbaoelkbzlbonbwyjdakoqkjgqszoiuthihjtdyqejjhblmyin\ntvugoybicevhvvtepaaaynjsvsuwsoszpkxnqnuivr\npsadebnavrgrep\npxikgpzgkdirzjhdcnhzvaarwkobhvccnqcekbxjkunxgnpxsmbfwsudysghhbhkwttzdsssjekzvqcmlwswadynb\nwdxavtfyunlefirloeixhhhuvbgpyoqbnwogesiusqfngwkfsovmhmqufbbmvxrpckirjzlfcbugzigdomyjjfk\nypxghfqfgtcooofnxsu\ntkfqvzsvuhxdqxgjvygbomcefjztmaztmfxysupmxxjvbxxikkqjmilazlpoxxycpkgjapzctg\ncdmte\nqkfndzpzveixgikcjnokeocmdbtjraawl\nhuxkbnaoomgsvo\nwllzqdduglhzxgewbtpqxmnzlheikgorvmoixnbbkzcscmzhyrjhrjav\ngpkvanvekllxkbnitucdgteejaawjndkbyjwpdmjzxrzyotjrleqrdivizgfdkzsngwt\ndbuavpnddhevidbwiezcwxwdutnohieqeaxfaovizbvfakietnqbmvufgypuwbhbmmhwnuysmsxkzdvktlvhxjnyrpcgnx\nquqhuhkkvxehsbndfwemxkqj\naflwnnout\nfhtohjtzrvxjuqdowhxjgtrmymdcrionqgyup\nrveffvraxzythrluyybvlqdpyxunlarfarilqmbkrbeczyqpstarcasdpjvwchfhvepnzugqdimvaapvlznoypuvqipymhdc\nyunrcoobwhkxizmswllmprclkhdgcm\nbjxqrdgnvjidctmicfzbqtbsbcffdlydwdjlexlhfrdfezaeqplozyh\nyqmswtpgqxwsvgvkeyrgkrxshdgowydyvhnhoatwortvsnbb\neqqdwrqgtobahzzrqgruvsdnngbentjagsljmebqqddwewuqxjkuddjcwrkzzncoddoqiqhrqbzxmcibtkkdulygtmglc\nfwjfraragwtsgi\ntootbjfwaykwrdrolxjrmtbhwbqnkqldxtinkamypgxrzgsxhryomtswwxondrnfhxbsbyxjs\nhznieghznckohfcc\njofhgruqzddvubxrelnlmvuuoqddhaquhvxuvhug\nkzaweesamriakus\nraqrwjkiywn\nyjohqqufrxpsiurcyltpgzipadvbrizgkcvbnzmhrwlyznrwxgwwjbqkyokconlbbbefdc\nbstnqtlpqdpstcxpzqejwrvftzyiecjdqvvkfgmsc\nmarslbixjxgejgkejvharazpkvgtydqmcnhcvscpxaqckyhrvugfhqwootekzxctbkryuzfmyatkh\nthoodgjojxakxksf\normxtcqcatfnwrqsmeibpplyfvvyqxfafjtsjpeqxlulldazrkpbeyixfphvmmmbslcfqxmzguncrquludifjkpmi",
"output": "n\ng\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | p00101 Aizu PR | Solve the following coding problem using the programming language python:
An English booklet has been created for publicizing Aizu to the world. When you read it carefully, you found a misnomer (an error in writing) on the last name of Masayuki Hoshina, the lord of the Aizu domain. The booklet says "Hoshino" not "Hoshina".
Your task is to write a program which replace all the words "Hoshino" with "Hoshina". You can assume that the number of characters in a text is less than or equal to 1000.
Input
The input consists of several datasets. There will be the number of datasets n in the first line. There will be n lines. A line consisting of english texts will be given for each dataset.
Output
For each dataset, print the converted texts in a line.
Example
Input
3
Hoshino
Hashino
Masayuki Hoshino was the grandson of Ieyasu Tokugawa.
Output
Hoshina
Hashino
Masayuki Hoshina was the grandson of Ieyasu Tokugawa.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
[print(input().replace("Hoshino","Hoshina")) for i in range(int(input()))]
``` | vfc_32881 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 134217728,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3\nHoshino\nHashino\nMasayuki Hoshino was the grandson of Ieyasu Tokugawa.",
"output": "Hoshina\nHashino\nMasayuki Hoshina was the grandson of Ieyasu Tokugawa.",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\nHoshimo\nHashino\nMasayuki Hoshino was the grandson of Ieyasu Tokugawa.",
"output": "Hoshimo\nHashino\nMasayuki Hoshina was the grandson of Ieyasu Tokugawa.\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\nHoshimo\nHashino\nMasayuki Hoshino was the grandspn of Ieyasu Tokugawa.",
"output": "Hoshimo\nHashino\nMasayuki Hoshina was the grandspn of Ieyasu Tokugawa.\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\nHoshimo\nHashino\nMasayuki Hoshino was the grandspn of ueyasI Tokugawa.",
"output": "Hoshimo\nHashino\nMasayuki Hoshina was the grandspn of ueyasI Tokugawa.\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | p00234 Aizu Buried Treasure | Solve the following coding problem using the programming language python:
Aizu has an ancient legend of buried treasure. You have finally found the place where the buried treasure is buried. Since we know the depth of the buried treasure and the condition of the strata to be dug, we can reach the buried treasure at the lowest cost with careful planning. So you decided to create a program that reads the condition of the formation and calculates the route to reach the buried treasure depth at the lowest cost.
The state of the formation is represented by cells arranged in a two-dimensional grid, and the position of each cell is represented by the coordinates (x, y). Let the upper left be (1,1), and assume that the x coordinate increases as it goes to the right and the y coordinate increases as it goes deeper down. You choose one of the cells with the smallest y-coordinate and start digging from there, then dig into one of the cells with the largest y-coordinate. There are two types of cells in the formation:
1. A cell filled with soil. There is a fixed cost for each cell to dig.
2. Oxygen-filled cell. There is no need to dig, and each cell can be replenished with a fixed amount of oxygen. The oxygen in the cell that has been replenished with oxygen is exhausted and cannot be replenished again. Also, when you reach this cell, you must replenish oxygen.
Only left, right, and down cells can be dug from a cell. Once you have dug a cell, you can move it left or right, but you cannot move it up.
You must carry an oxygen cylinder with you when excavating. The moment the oxygen cylinder reaches zero, you will not be able to move, excavate, or replenish oxygen. The remaining amount is decremented by 1 each time you move the cell. Even if the remaining amount of the oxygen cylinder is 0 and the depth of the buried treasure is reached, it is not considered to have been reached. In addition, oxygen can be replenished in cells that have accumulated oxygen, but the excess capacity is discarded.
Create a program that inputs the size of the formation, the excavation cost, the capacity of the oxygen cylinder, the amount of oxygen in the initial state, and the information of the formation, and outputs the minimum cost to reach the deepest cell. However, if the minimum cost exceeds the excavation cost, or if you cannot reach the buried treasure no matter how you dig, please output "NA".
<image>
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by two zero lines. Each dataset is given in the following format.
W H
f m o
c1,1 c2,1 ... cW,1
c1,2 c2,2 ... cW,2
...
c1, H c2, H ... cW, H
The horizontal size W of the formation and the vertical size H (3 β€ W, H β€ 10) are given in the first line. The second line is the integer f (1 β€ f β€ 10000) that represents your excavation cost, the integer m (3 β€ m β€ 50) that represents the capacity of the oxygen cylinder, and the integer o that represents the amount of oxygen you have in the initial state. o β€ m) is given.
The following H line is given the geological information ci, j. ci, j represents the cell information for coordinates (i, j) and is given in the following format:
If the value is negative, the cell is full of soil and the value represents the cost.
If the value is positive, it is a cell filled with oxygen, and the value represents the amount of oxygen.
However, there are no more than 50 cells in which oxygen has accumulated.
The number of datasets does not exceed 50.
Output
Print the minimum cost or NA on one line for each dataset.
Example
Input
3 3
100 10 10
-100 -20 -100
-100 -20 -100
-100 -20 -100
3 3
100 10 10
-100 -20 -100
-100 -20 -20
-100 -60 -20
3 3
100 10 3
-100 -20 -100
-20 -20 -20
-20 -100 -20
3 3
100 3 3
-100 -20 -30
-100 -20 2
-100 -20 -20
4 5
1500 5 4
-10 -380 -250 -250
-90 2 -80 8
-250 -130 -330 -120
-120 -40 -50 -20
-250 -10 -20 -150
0 0
Output
60
80
NA
50
390
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
import sys
sys.setrecursionlimit(1000000)
INF = 10 ** 20
def update_state(state, newx):
tmp = list(state)
tmp[newx] = 1
return tuple(tmp)
def get_co(x, y):
dc = do = 0
score = mp[y][x]
if score < 0:
dc = -score
else:
do = score
return dc, do
def minimum_cost(x, y, state, ox, goal, dic, w, m):
if (x, y, state, ox) in dic:
return dic[(x, y, state, ox)]
if y == goal:
return 0
if ox <= 1:
return INF
ret = INF
if x >= 1:
if state[x - 1] == 0:
dc, do = get_co(x - 1, y)
ret = min(ret, minimum_cost(x - 1, y, update_state(state, x - 1), min(ox + do - 1, m), goal, dic, w, m) + dc)
else:
ret = min(ret, minimum_cost(x - 1, y, state, ox - 1, goal, dic, w, m))
if x < w - 1:
if state[x + 1] == 0:
dc, do = get_co(x + 1, y)
ret = min(ret, minimum_cost(x + 1, y, update_state(state, x + 1), min(ox + do - 1, m), goal, dic, w, m) + dc)
else:
ret = min(ret, minimum_cost(x + 1, y, state, ox - 1, goal, dic, w, m))
dc, do = get_co(x, y + 1)
ret = min(ret, minimum_cost(x, y + 1, tuple((1 if i == x else 0 for i in range(w))), min(ox + do - 1, m), goal, dic, w, m) + dc)
dic[(x, y, state, ox)] = ret
return ret
while True:
w, h = map(int, input().split())
if w == 0:
break
f, m, o = map(int, input().split())
mp = [list(map(int, input().split())) for _ in range(h)]
if o <= 1:
print("NA")
continue
dic = {}
ans = INF
for i in range(w):
dc, do = get_co(i, 0)
state = tuple(1 if i == j else 0 for j in range(w))
ans = min(ans, minimum_cost(i, 0, state, min(o + do - 1, m), h - 1, dic, w, m) + dc)
if ans > f:
print("NA")
else:
print(ans)
``` | vfc_32885 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 134217728,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3 3\n100 10 10\n-100 -20 -100\n-100 -20 -100\n-100 -20 -100\n3 3\n100 10 10\n-100 -20 -100\n-100 -20 -20\n-100 -60 -20\n3 3\n100 10 3\n-100 -20 -100\n-20 -20 -20\n-20 -100 -20\n3 3\n100 3 3\n-100 -20 -30\n-100 -20 2\n-100 -20 -20\n4 5\n1500 5 4\n-10 -380 -250 -250\n-90 2 -80 8\n-250 -130 -330 -120\n-120 -40 -50 -20\n-250 -10 -20 -150\n0 0",
"output": "60\n80\nNA\n50\n390",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 3\n100 10 10\n-100 -20 -100\n-100 -20 -100\n-100 -20 -100\n3 3\n100 10 10\n-100 -20 -100\n-100 -20 -20\n-100 -60 -20\n3 3\n100 10 3\n-100 -20 -100\n-20 -20 -20\n-20 -100 -20\n3 3\n100 3 3\n-100 -20 -30\n-100 -20 2\n-100 -20 -20\n4 5\n1500 5 4\n-10 -380 -250 -250\n-90 2 -80 8\n-250 -130 -330 -120\n-120 -40 -50 -6\n-250 -10 -20 -150\n0 0",
"output": "60\n80\nNA\n50\n376\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 3\n100 10 10\n-100 -20 -100\n-100 -20 -100\n-100 -20 -100\n3 3\n100 10 10\n-100 -20 -100\n-100 -20 -20\n-100 -60 -20\n3 3\n100 10 3\n-100 -20 -100\n-20 -20 -20\n-20 -100 -20\n3 3\n100 3 3\n-100 -20 -30\n-100 -20 2\n-100 -20 -20\n4 5\n1500 5 4\n-10 -380 -250 -250\n-90 2 -80 8\n-250 -130 -330 -120\n-120 -40 -50 -6\n-250 -10 -32 -150\n0 0",
"output": "60\n80\nNA\n50\n388\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 3\n100 10 10\n-100 -20 -100\n-100 -20 -100\n-100 -20 -100\n3 3\n100 10 10\n-100 -20 -100\n-100 -20 -20\n-100 -60 -20\n3 3\n100 10 3\n-100 -20 -100\n-20 -20 -20\n-20 -79 -20\n3 3\n110 3 3\n-100 -20 -30\n-100 -20 2\n-100 -20 -20\n4 5\n1500 5 4\n-10 -380 -250 -250\n-90 2 -80 8\n-250 -130 -330 -120\n-120 -40 -50 -12\n-250 -10 -32 -150\n0 0",
"output": "60\n80\nNA\n50\n394\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 3\n100 10 10\n-100 -20 -100\n-100 -20 -100\n-100 -20 -100\n3 3\n100 10 10\n-100 -20 -100\n-100 -20 -20\n-100 -60 -20\n3 3\n100 19 3\n-100 -20 -100\n-20 -20 -20\n-20 -100 -20\n3 3\n100 3 3\n-100 -20 -30\n-100 -20 2\n-100 -20 -20\n4 5\n1500 5 4\n-10 -380 -250 -250\n-90 2 -80 8\n-250 -130 -330 -120\n-120 -40 -50 -20\n-250 -10 -20 -150\n0 0",
"output": "60\n80\nNA\n50\n390\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | p00611 Building Water Ways | Solve the following coding problem using the programming language python:
In ancient times, Romans constructed numerous water ways to supply water to cities and industrial sites. These water ways were amongst the greatest engineering feats of the ancient world.
These water ways contributed to social infrastructures which improved people's quality of life. On the other hand, problems related to the water control and the water facilities are still interesting as a lot of games of water ways construction have been developed.
Your task is to write a program which reads a map and computes the minimum possible cost of constructing water ways from sources to all the cities.
<image>
As shown in Figure 1, the map is represented by H Γ W grid cells, where each cell represents source, city, flatland, or obstacle.
You can construct only one water way from a source, but there are no limitations on the length of that water way and it can provide water to any number of cities located on its path. You can not construct water ways on the obstacles.
Your objective is to bring water to all the city and minimize the number of cells which represent water ways. In the Figure 1, water ways are constructed in 14 cells which is the minimum cost.
The water ways must satisfy the following conditions:
* a water way cell is adjacent to at most 2 water way cells in four cardinal points.
* a source cell is adjacent to at most 1 water way cell in four cardinal points.
* there is no path from a source to other sources through water ways.
Constraints
* Judge data contains at most 60 data sets.
* 3 β€ H, W β€ 10
* 1 β€ the number of sources, the number of cities β€ 8
* The map is surrounded by obstacles.
* Sources are not adjacent each other(on the left, right, top and bottom)
* There is a solution.
Input
The input consists of multiple datasets. Each dataset consists of:
H W
H Γ W characters
The integers H and W are the numbers of rows and columns of the map. H Γ W characters denote the cells which contain:
* 'P': source
* '*': city
* '.': flatland
* '#': obstacle
The end of input is indicated by a line containing two zeros separated by a space.
Output
For each dataset, print the minimum cost to construct the water ways.
Examples
Input
3 8
########
#P....*#
########
10 10
##########
#P.......#
#..#*....#
#..#*.#.*#
#.....#*.#
#*.......#
#..##....#
#...#.P..#
#P......P#
##########
0 0
Output
5
14
Input
3 8
P....*#
10 10
P.......#
..#*....#
..#*.#.*#
.....#*.#
*.......#
..##....#
...#.P..#
P......P#
0 0
Output
5
14
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | vfc_32893 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 134217728,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3 8\n########\n#P....*#\n########\n10 10\n##########\n#P.......#\n#..#*....#\n#..#*.#.*#\n#.....#*.#\n#*.......#\n#..##....#\n#...#.P..#\n#P......P#\n##########\n0 0",
"output": "5\n14",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 8\n########\n#P....*#\n########\n10 10\n##########\n#P.......#\n#..#*....#\n#..#*.#.*#\n#.....#*.#\n#*.......#\n#..##....#\n#...#.P..#\n#P......O#\n##########\n0 0",
"output": "5\n14\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 8\n########\n#P....*#\n########\n10 10\n##########\n#O.......#\n#..#*....#\n#..#*.#.*#\n#.....#*.#\n#*.......#\n#..##....#\n#...#.P..#\n#P......O#\n##########\n0 0",
"output": "5\n15\n",
"type": "stdin_stdout"
}
]
} |
|
code_contests | verifiable_code | p00749 Off Balance | Solve the following coding problem using the programming language python:
You are working for an administration office of the International Center for Picassonian Cubism (ICPC), which plans to build a new art gallery for young artists. The center is organizing an architectural design competition to find the best design for the new building.
Submitted designs will look like a screenshot of a well known game as shown below.
<image>
This is because the center specifies that the building should be constructed by stacking regular units called pieces, each of which consists of four cubic blocks. In addition, the center requires the competitors to submit designs that satisfy the following restrictions.
* All the pieces are aligned. When two pieces touch each other, the faces of the touching blocks must be placed exactly at the same position.
* All the pieces are stable. Since pieces are merely stacked, their centers of masses must be carefully positioned so as not to collapse.
* The pieces are stacked in a tree-like form in order to symbolize boundless potentiality of young artists. In other words, one and only one piece touches the ground, and each of other pieces touches one and only one piece on its bottom faces.
* The building has a flat shape. This is because the construction site is a narrow area located between a straight moat and an expressway where no more than one block can be placed between the moat and the expressway as illustrated below.
<image>
It will take many days to fully check stability of designs as it requires complicated structural calculation. Therefore, you are asked to quickly check obviously unstable designs by focusing on centers of masses. The rules of your quick check are as follows.
Assume the center of mass of a block is located at the center of the block, and all blocks have the same weight. We denote a location of a block by xy-coordinates of its left-bottom corner. The unit length is the edge length of a block.
Among the blocks of the piece that touch another piece or the ground on their bottom faces, let xL be the leftmost x-coordinate of the leftmost block, and let xR be the rightmost x-coordinate of the rightmost block. Let the x-coordinate of its accumulated center of mass of the piece be M, where the accumulated center of mass of a piece P is the center of the mass of the pieces that are directly and indirectly supported by P, in addition to P itself. Then the piece is stable, if and only if xL < M < xR. Otherwise, it is unstable. A design of a building is unstable if any of its pieces is unstable.
Note that the above rules could judge some designs to be unstable even if it would not collapse in reality. For example, the left one of the following designs shall be judged to be unstable.
<image> | | <image>
---|---|---
Also note that the rules judge boundary cases to be unstable. For example, the top piece in the above right design has its center of mass exactly above the right end of the bottom piece. This shall be judged to be unstable.
Write a program that judges stability of each design based on the above quick check rules.
Input
The input is a sequence of datasets. The end of the input is indicated by a line containing two zeros separated by a space. Each dataset, which represents a front view of a building, is formatted as follows.
> w h
> p0(h-1)p1(h-1)...p(w-1)(h-1)
> ...
> p01p11...p(w-1)1
> p00p10...p(w-1)0
>
The integers w and h separated by a space are the numbers of columns and rows of the layout, respectively. You may assume 1 β€ w β€ 10 and 1 β€ h β€ 60. The next h lines specify the placement of the pieces. The character pxy indicates the status of a block at (x,y), either ``.`', meaning empty, or one digit character between ``1`' and ``9`', inclusive, meaning a block of a piece. (As mentioned earlier, we denote a location of a block by xy-coordinates of its left-bottom corner.)
When two blocks with the same number touch each other by any of their top, bottom, left or right face, those blocks are of the same piece. (Note that there might be two different pieces that are denoted by the same number.) The bottom of a block at (x,0) touches the ground.
You may assume that the pieces in each dataset are stacked in a tree-like form.
Output
For each dataset, output a line containing a word `STABLE` when the design is stable with respect to the above quick check rules. Otherwise, output `UNSTABLE`. The output should be written with uppercase letters, and should not contain any other extra characters.
Sample Input
4 5
..33
..33
2222
..1.
.111
5 7
....1
.1..1
.1..1
11..1
.2222
..111
...1.
3 6
.3.
233
23.
22.
.11
.11
4 3
2222
..11
..11
4 5
.3..
33..
322.
2211
.11.
3 3
222
2.1
111
3 4
11.
11.
.2.
222
3 4
.11
.11
.2.
222
2 7
11
.1
21
22
23
.3
33
2 3
1.
11
.1
0 0
Output for the Sample Input
STABLE
STABLE
STABLE
UNSTABLE
STABLE
STABLE
UNSTABLE
UNSTABLE
UNSTABLE
UNSTABLE
Example
Input
4 5
..33
..33
2222
..1.
.111
5 7
....1
.1..1
.1..1
11..1
.2222
..111
...1.
3 6
.3.
233
23.
22.
.11
.11
4 3
2222
..11
..11
4 5
.3..
33..
322.
2211
.11.
3 3
222
2.1
111
3 4
11.
11.
.2.
222
3 4
.11
.11
.2.
222
2 7
11
.1
21
22
23
.3
33
2 3
1.
11
.1
0 0
Output
STABLE
STABLE
STABLE
UNSTABLE
STABLE
STABLE
UNSTABLE
UNSTABLE
UNSTABLE
UNSTABLE
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
while True:
w, h = map(int, input().split())
if w == 0:
break
mp = [[0] + list(input()) + [0] for _ in range(h)]
mp.insert(0, [0] * (w + 2))
mp.append([0] * (w + 2))
for y in range(1, h + 1):
for x in range(1, w + 1):
if mp[y][x] == ".":
mp[y][x] = 0
else:
mp[y][x] = int(mp[y][x])
last_id = 10
vec = ((0, 1), (0, -1), (1, 0), (-1, 0))
def update(last_id, target, x, y):
if mp[y][x] != target:
return
mp[y][x] = last_id
for dx, dy in vec:
update(last_id, target, x + dx, y + dy)
for y in range(1, h + 1):
for x in range(1, w + 1):
if 1 <= mp[y][x] <= 9:
update(last_id, mp[y][x], x, y)
last_id += 1
node_num = last_id - 10
edges = [set() for _ in range(node_num)]
for y in range(1, h + 1):
for x in range(1, w + 1):
if mp[y - 1][x] != mp[y][x] and mp[y - 1][x] != 0 and mp[y][x] != 0:
edges[mp[y][x] - 10].add(mp[y - 1][x] - 10)
for x in range(1, w + 1):
if mp[h][x] != 0:
root = mp[h][x] - 10
break
center = [0] * node_num
ground = [None] * node_num
for y in range(1, h + 1):
for x in range(1, w + 1):
if mp[y][x] != 0:
target = mp[y][x] - 10
center[target] += (x + 0.5) / 4
if mp[y + 1][x] in (0, target + 10):
continue
if ground[target] == None:
ground[target] = [x, x + 1]
else:
ground[target][0] = min(ground[target][0], x)
ground[target][1] = max(ground[target][1], x + 1)
for x in range(1, w + 1):
if mp[h][x] == root + 10:
if ground[root] == None:
ground[root] = [x, x + 1]
else:
ground[root][0] = min(ground[root][0], x)
ground[root][1] = max(ground[root][1], x + 1)
total_center = [None] * node_num
def get_total_center(node):
mom = center[node]
wei = 1
for to in edges[node]:
to_wei, to_pos = get_total_center(to)
mom += to_wei * to_pos
wei += to_wei
total_center[node] = mom / wei
return wei, total_center[node]
get_total_center(root)
for gr, cen in zip(ground, total_center):
l, r = gr
if not (l < cen < r):
print("UNSTABLE")
break
else:
print("STABLE")
``` | vfc_32897 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 134217728,
"problem_url": null,
"time_limit": "{'seconds': 8, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4 5\n..33\n..33\n2222\n..1.\n.111\n5 7\n....1\n.1..1\n.1..1\n11..1\n.2222\n..111\n...1.\n3 6\n.3.\n233\n23.\n22.\n.11\n.11\n4 3\n2222\n..11\n..11\n4 5\n.3..\n33..\n322.\n2211\n.11.\n3 3\n222\n2.1\n111\n3 4\n11.\n11.\n.2.\n222\n3 4\n.11\n.11\n.2.\n222\n2 7\n11\n.1\n21\n22\n23\n.3\n33\n2 3\n1.\n11\n.1\n0 0",
"output": "STABLE\nSTABLE\nSTABLE\nUNSTABLE\nSTABLE\nSTABLE\nUNSTABLE\nUNSTABLE\nUNSTABLE\nUNSTABLE",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4 5\n..33\n..33\n2222\n..1.\n.111\n5 7\n....1\n.1..1\n.1..1\n11..1\n.2222\n..111\n...1.\n3 6\n.3.\n233\n23.\n22.\n.11\n.11\n4 3\n2222\n..11\n..11\n4 5\n.3..\n33..\n322.\n2211\n.11.\n3 3\n222\n2.1\n111\n3 4\n11.\n11.\n.2/\n222\n3 4\n.11\n.11\n.2.\n222\n2 7\n11\n.1\n21\n22\n23\n.3\n33\n2 3\n1.\n11\n.1\n0 0",
"output": "STABLE\nSTABLE\nSTABLE\nUNSTABLE\nSTABLE\nSTABLE\nUNSTABLE\nUNSTABLE\nUNSTABLE\nUNSTABLE\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4 5\n..33\n..33\n2222\n..1.\n.111\n5 7\n....1\n.1..1\n.1..1\n11..1\n.2222\n..111\n...1.\n3 6\n.3.\n233\n23.\n22.\n.11\n.11\n4 3\n2222\n..11\n..11\n4 5\n.3..\n..33\n322.\n2211\n.11.\n3 3\n222\n2.1\n111\n3 4\n11.\n11.\n.2/\n222\n3 4\n.11\n.11\n.2.\n222\n2 7\n11\n.1\n21\n22\n23\n.3\n33\n2 3\n1.\n11\n.1\n0 0",
"output": "STABLE\nSTABLE\nSTABLE\nUNSTABLE\nUNSTABLE\nSTABLE\nUNSTABLE\nUNSTABLE\nUNSTABLE\nUNSTABLE\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | p01018 Warping Girl | Solve the following coding problem using the programming language python:
Problem
Aizu Magic School is a school where people who can use magic gather. Haruka, one of the students of that school, can use the magic of warp on the magic team.
From her house to the school, there is a straight road of length L. There are also magic circles on this road.
She uses this road every day to go to school, so she wants to get to school in the shortest possible time.
So as a programmer, you decided to teach her the minimum amount of time it would take to get to school.
Haruka can walk forward by a distance of 1 in 1 minute (* cannot go back). Also, by casting magic at the position Pi where the magic circle of the warp is written, you can move in Ti minutes to the place just Di from Pi. Even if there is a magic circle at the destination, it will be continuous. You can use warp magic.
The location of her house is 0 and the location of her school is L.
Constraints
The input meets the following conditions.
* All numbers given are integers
* 1 β€ L β€ 109
* 0 β€ n β€ min (103, L) (min represents the smaller of A and B)
* 0 β€ Pi β€ L -1
* 0 β€ Di β€ L --Pi
* 0 β€ Ti β€ 103
* Pi β Pj
Input
L n
P1 D1 T1
P2 D2 T2
..
..
Pn Dn Tn
The first line is given the length of the road L, the number of magic circles n. Next, the state of n magic circles is given. Pi is the position where the i-th magic circle is, and Di is the i-th magic circle. Distance to warp from, Ti represents the time it takes to warp using the i-th magic circle.
Output
Output the minimum time to get to school in one line.
Examples
Input
10 3
2 2 1
4 2 1
8 1 1
Output
8
Input
10 2
2 3 1
3 5 1
Output
6
Input
1 0
Output
1
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
INF = 10 ** 20
l, n = map(int, input().split())
lst = [list(map(int, input().split())) for _ in range(n)] + [[l, 0, INF]]
lst.sort()
score = {}
for p, _, _ in lst:
score[p] = p
for i in range(n + 1):
p, d, t = lst[i]
for j in range(i + 1, n + 1):
to_p, _, _ = lst[j]
if to_p >= p + d:
score[to_p] = min(score[to_p], score[p] + t + to_p - p - d, score[p] + to_p - p)
else:
score[to_p] = min(score[to_p], score[p] + to_p - p)
print(score[l])
``` | vfc_32905 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 268435456,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "10 2\n2 3 1\n3 5 1",
"output": "6",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1 0",
"output": "1",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "10 3\n2 2 1\n4 2 1\n8 1 1",
"output": "8",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "10 2\n2 3 1\n1 5 1",
"output": "6\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "10 2\n2 3 1\n1 5 0",
"output": "5\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "10 0\n2 3 1\n1 5 1",
"output": "10\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | p01151 Divisor is the Conqueror | Solve the following coding problem using the programming language python:
Divisor is the Conquerer is a solitaire card game. Although this simple game itself is a great way to pass oneβs time, you, a programmer, always kill your time by programming. Your task is to write a computer program that automatically solves Divisor is the Conquerer games. Here is the rule of this game:
First, you randomly draw N cards (1 β€ N β€ 52) from your deck of playing cards. The game is played only with those cards; the other cards will not be used.
Then you repeatedly pick one card to play among those in your hand. You are allowed to choose any card in the initial turn. After that, you are only allowed to pick a card that conquers the cards you have already played. A card is said to conquer a set of cards when the rank of the card divides the sum of the ranks in the set. For example, the card 7 conquers the set {5, 11, 12}, while the card 11 does not conquer the set {5, 7, 12}.
You win the game if you successfully play all N cards you have drawn. You lose if you fails, that is, you faces a situation in which no card in your hand conquers the set of cards you have played.
Input
The input consists of multiple test cases.
Each test case consists of two lines. The first line contains an integer N (1 β€ N β€ 52), which represents the number of the cards. The second line contains N integers c1 , . . . , cN (1 β€ ci β€ 13), each of which represents the rank of the card. You may assume that there are at most four cards with the same rank in one list.
The input is terminated by a line with a single zero.
Output
For each test case, you should output one line. If there are any winning strategies for the cards of the input, print any one of them as a list of N integers separated by a space.
If there is no winning strategy, print βNoβ.
Example
Input
5
1 2 3 3 7
4
2 3 3 3
0
Output
3 3 1 7 2
No
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | vfc_32909 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 134217728,
"problem_url": null,
"time_limit": "{'seconds': 8, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "5\n1 2 3 3 7\n4\n2 3 3 3\n0",
"output": "3 3 1 7 2\nNo",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n1 2 3 6 7\n4\n2 3 3 3\n0",
"output": "No\nNo\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n1 2 6 6 7\n4\n2 3 3 3\n0",
"output": "6 6 2 7 1\nNo\n",
"type": "stdin_stdout"
}
]
} |
|
code_contests | verifiable_code | p01290 Queen's Case | Solve the following coding problem using the programming language python:
A small country called Maltius was governed by a queen. The queen was known as an oppressive ruler. People in the country suffered from heavy taxes and forced labor. So some young people decided to form a revolutionary army and fight against the queen. Now, they besieged the palace and have just rushed into the entrance.
Your task is to write a program to determine whether the queen can escape or will be caught by the army.
Here is detailed description.
* The palace can be considered as grid squares.
* The queen and the army move alternately. The queen moves first.
* At each of their turns, they either move to an adjacent cell or stay at the same cell.
* Each of them must follow the optimal strategy.
* If the queen and the army are at the same cell, the queen will be caught by the army immediately.
* If the queen is at any of exit cells alone after the armyβs turn, the queen can escape from the army.
* There may be cases in which the queen cannot escape but wonβt be caught by the army forever, under their optimal strategies.
Hint
On the first sample input, the queen can move to exit cells, but either way the queen will be caught at the next armyβs turn. So the optimal strategy for the queen is staying at the same cell. Then the army can move to exit cells as well, but again either way the army will miss the queen from the other exit. So the optimal strategy for the army is also staying at the same cell. Thus the queen cannot escape but wonβt be caught.
Input
The input consists of multiple datasets. Each dataset describes a map of the palace. The first line of the input contains two integers W (1 β€ W β€ 30) and H (1 β€ H β€ 30), which indicate the width and height of the palace. The following H lines, each of which contains W characters, denote the map of the palace. "Q" indicates the queen, "A" the army,"E" an exit,"#" a wall and "." a floor.
The map contains exactly one "Q", exactly one "A" and at least one "E". You can assume both the queen and the army can reach all the exits.
The last dataset is followed by a line containing two zeros. This line is not a part of any dataset and should not be processed.
Output
For each dataset, output "Queen can escape.", "Army can catch Queen." or "Queen can not escape and Army can not catch Queen." in a line.
Examples
Input
2 2
QE
EA
3 1
QAE
3 1
AQE
5 5
..E..
.###.
A###Q
.###.
..E..
5 1
A.E.Q
5 5
A....
####.
..E..
.####
....Q
0 0
Output
Queen can not escape and Army can not catch Queen.
Army can catch Queen.
Queen can escape.
Queen can not escape and Army can not catch Queen.
Army can catch Queen.
Army can catch Queen.
Input
2 2
QE
EA
3 1
QAE
3 1
AQE
5 5
..E..
.###.
A###Q
.###.
..E..
5 1
A.E.Q
5 5
A....
.
..E..
.####
....Q
0 0
Output
Queen can not escape and Army can not catch Queen.
Army can catch Queen.
Queen can escape.
Queen can not escape and Army can not catch Queen.
Army can catch Queen.
Army can catch Queen.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
from collections import deque, defaultdict
import sys
readline = sys.stdin.readline
write = sys.stdout.write
dd = ((-1, 0), (0, -1), (1, 0), (0, 1), (0, 0))
def solve():
W, H = map(int, readline().split())
if W == H == 0:
return False
S = [readline().strip() for i in range(H)]
px = py = qx = qy = 0
rs = []
pp = []
MP = [[0]*W for i in range(H)]
for i in range(H):
for j, c in enumerate(S[i]):
if c == "Q":
px = j; py = i
elif c == "A":
qx = j; qy = i
elif c == "E":
MP[i][j] = 1
rs.append((j, i))
elif c == "#":
MP[i][j] = 2
if c != "#":
pp.append((j, i))
mp = {}
L = 0
for ax, ay in pp:
for bx, by in pp:
mp[ax, ay, bx, by, 0] = L
L += 1
mp[ax, ay, bx, by, 1] = L
L += 1
que1 = deque()
ss = [-1]*L
cc = [0]*L
que = deque([(px, py, qx, qy, 0)])
used = [0]*L
used[mp[px, py, qx, qy, 0]] = 1
RG = [[] for i in range(L)]
deg = [0]*L
while que:
ax, ay, bx, by, t = key = que.popleft()
k0 = mp[key]
if ax == bx and ay == by:
que1.append(k0)
ss[k0] = 1
continue
if t == 0 and MP[ay][ax] == 1:
que1.append(k0)
ss[k0] = 0
continue
if t == 1:
for dx, dy in dd:
nx = bx + dx; ny = by + dy
if not 0 <= nx < W or not 0 <= ny < H or MP[ny][nx] == 2:
continue
k1 = mp[ax, ay, nx, ny, t^1]
deg[k0] += 1
RG[k1].append(k0)
if not used[k1]:
used[k1] = 1
que.append((ax, ay, nx, ny, t^1))
else:
for dx, dy in dd:
nx = ax + dx; ny = ay + dy
if not 0 <= nx < W or not 0 <= ny < H or MP[ny][nx] == 2:
continue
k1 = mp[nx, ny, bx, by, t^1]
deg[k0] += 1
RG[k1].append(k0)
if not used[k1]:
used[k1] = 1
que.append((nx, ny, bx, by, t^1))
while que1:
v = que1.popleft()
s = ss[v]; t = v % 2
if t == 0:
for w in RG[v]:
if ss[w] != -1:
continue
if s == 1:
que1.append(w)
ss[w] = 1
else:
deg[w] -= 1
if deg[w] == 0:
que1.append(w)
ss[w] = 0
else:
for w in RG[v]:
if ss[w] != -1:
continue
if s == 0:
que1.append(w)
ss[w] = 0
else:
deg[w] -= 1
if deg[w] == 0:
que1.append(w)
ss[w] = 1
k0 = mp[px, py, qx, qy, 0]
if ss[k0] == -1:
write("Queen can not escape and Army can not catch Queen.\n")
elif ss[k0] == 0:
write("Queen can escape.\n")
else:
write("Army can catch Queen.\n")
return True
while solve():
...
``` | vfc_32913 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 134217728,
"problem_url": null,
"time_limit": "{'seconds': 8, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2 2\nQE\nEA\n3 1\nQAE\n3 1\nAQE\n5 5\n..E..\n.###.\nA###Q\n.###.\n..E..\n5 1\nA.E.Q\n5 5\nA....\n.\n..E..\n.####\n....Q\n0 0",
"output": "Queen can not escape and Army can not catch Queen.\nArmy can catch Queen.\nQueen can escape.\nQueen can not escape and Army can not catch Queen.\nArmy can catch Queen.\nArmy can catch Queen.",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2 2\nQE\nEA\n3 1\nQAE\n3 1\nAQE\n5 5\n..E..\n.###.\nA###Q\n.###.\n..E..\n5 1\nA.E.Q\n5 5\nA....\n####.\n..E..\n.####\n....Q\n0 0",
"output": "Queen can not escape and Army can not catch Queen.\nArmy can catch Queen.\nQueen can escape.\nQueen can not escape and Army can not catch Queen.\nArmy can catch Queen.\nArmy can catch Queen.",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2 2\nQE\nEA\n3 1\nQAE\n3 1\nAQE\n5 5\n..E..\n.###.\nA###Q\n.###.\n..E..\n5 1\nA.E.Q\n5 5\nA....\n-\n..E..\n.####\n....Q\n0 0",
"output": "Queen can not escape and Army can not catch Queen.\nArmy can catch Queen.\nQueen can escape.\nQueen can not escape and Army can not catch Queen.\nArmy can catch Queen.\nArmy can catch Queen.\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2 2\nQE\nEA\n2 1\nQAE\n3 1\nAQE\n5 5\n..E..\n.###.\n##A#Q\n.###.\n..E..\n5 1\nA.E.Q\n5 5\nA....\n-\n..E..\n.####\n....Q\n0 0",
"output": "Queen can not escape and Army can not catch Queen.\nArmy can catch Queen.\nQueen can escape.\nQueen can escape.\nArmy can catch Queen.\nArmy can catch Queen.\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2 2\nQE\nAE\n3 1\nQAE\n3 1\nAQE\n5 5\n..E..\n.###.\nA###Q\n.###.\n..E..\n5 1\nA.E.Q\n5 5\nA....\n.\nE....\n.####\n....Q\n0 0",
"output": "Queen can escape.\nArmy can catch Queen.\nQueen can escape.\nQueen can not escape and Army can not catch Queen.\nArmy can catch Queen.\nArmy can catch Queen.\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | p01459 Light Road | Solve the following coding problem using the programming language python:
There is an evil creature in a square on N-by-M grid (2 \leq N, M \leq 100), and you want to kill it using a laser generator located in a different square. Since the location and direction of the laser generator are fixed, you may need to use several mirrors to reflect laser beams. There are some obstacles on the grid and you have a limited number of mirrors. Please find out whether it is possible to kill the creature, and if possible, find the minimum number of mirrors.
There are two types of single-sided mirrors; type P mirrors can be placed at the angle of 45 or 225 degrees from east-west direction, and type Q mirrors can be placed with at the angle of 135 or 315 degrees. For example, four mirrors are located properly, laser go through like the following.
<image>
Note that mirrors are single-sided, and thus back side (the side with cross in the above picture) is not reflective. You have A type P mirrors, and also A type Q mirrors (0 \leq A \leq 10). Although you cannot put mirrors onto the squares with the creature or the laser generator, laser beam can pass through the square. Evil creature is killed if the laser reaches the square it is in.
Input
Each test case consists of several lines.
The first line contains three integers, N, M, and A. Each of the following N lines contains M characters, and represents the grid information. '#', '.', 'S', 'G' indicates obstacle, empty square, the location of the laser generator, and the location of the evil creature, respectively. The first line shows the information in northernmost squares and the last line shows the information in southernmost squares. You can assume that there is exactly one laser generator and exactly one creature, and the laser generator emits laser beam always toward the south.
Output
Output the minimum number of mirrors used if you can kill creature, or -1 otherwise.
Examples
Input
3 3 2
S#.
...
.#G
Output
2
Input
3 3 1
S#.
...
.#G
Output
-1
Input
3 3 1
S#G
...
.#.
Output
2
Input
4 3 2
S..
...
..#
.#G
Output
-1
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
from collections import deque
N, M, A = map(int, input().split())
MP = [[0]*M for i in range(N)]
sx = sy = gx = gy = -1
for i in range(N):
for j, c in enumerate(input()):
if c == '#':
MP[i][j] = 1
elif c == 'S':
sx = j; sy = i
elif c == 'G':
gx = j; gy = i
U = [[set() for i in range(M)] for j in range(N)]
DD = ((-1, 0), (0, -1), (1, 0), (0, 1))
que = deque([(sx, sy, 0, 0, 3)])
for i in range(A+1):
for j in range(A+1):
U[sy][sx].add((i, j, 1))
U[sy][sx].add((i, j, 3))
pp = ((sx, sy), (gx, gy))
while que:
x, y, a, b, d = que.popleft()
if (x, y) not in pp:
d0 = (d-1) % 4
dx, dy = DD[d0]
nx = x + dx; ny = y + dy
if 0 <= nx < M and 0 <= ny < N and MP[ny][nx] == 0:
if d % 2 == 0:
if b < A and (a, b+1, d0) not in U[ny][nx]:
U[ny][nx].add((a, b+1, d0))
que.append((nx, ny, a, b+1, d0))
else:
if a < A and (a+1, b, d0) not in U[ny][nx]:
U[ny][nx].add((a+1, b, d0))
que.append((nx, ny, a+1, b, d0))
d1 = (d+1) % 4
dx, dy = DD[d1]
nx = x + dx; ny = y + dy
if 0 <= nx < M and 0 <= ny < N and MP[ny][nx] == 0:
if d % 2 == 0:
if a < A and (a+1, b, d1) not in U[ny][nx]:
U[ny][nx].add((a+1, b, d1))
que.append((nx, ny, a+1, b, d1))
else:
if b < A and (a, b+1, d1) not in U[ny][nx]:
U[ny][nx].add((a, b+1, d1))
que.append((nx, ny, a, b+1, d1))
dx, dy = DD[d]
nx = x + dx; ny = y + dy
if 0 <= nx < M and 0 <= ny < N and MP[ny][nx] == 0:
if (a, b, d) not in U[ny][nx]:
U[ny][nx].add((a, b, d))
que.append((nx, ny, a, b, d))
if U[gy][gx]:
print(min(a+b for a, b, d in U[gy][gx]))
else:
print(-1)
``` | vfc_32917 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 134217728,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3 3 1\nS#.\n...\n.#G",
"output": "-1",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 3 1\nS#G\n...\n.#.",
"output": "2",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 3 2\nS#.\n...\n.#G",
"output": "2",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4 3 2\nS..\n...\n..#\n.#G",
"output": "-1",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1 3 1\nS#G\n...\n.#.",
"output": "-1\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | p01611 K-th String | Solve the following coding problem using the programming language python:
K-th String
Problem Statement
The suffix array SA for the character string S of length N is defined as a permutation of positive integers of N or less obtained by the following procedure.
The substring from the i-th character to the j-th character of S is expressed as S [i..j]. However, the subscript is 1-indexed.
1. Arrange each suffix S [i..N] (i = 1,2, ..., N) in lexicographic order (ascending order).
2. Arrange the start position i of each of the aligned suffixes in order.
For example, the suffix array SA for S = "mississippi" is as follows.
<image>
As input, the suffix array SA for a string of length N is given.
Find the K-th (1-indexed) string in lexicographic order from which SA can be obtained.
However, the original character string consists of at most A characters counting from'a'in alphabetical order.
Constraints
* 1 β€ N β€ 10 ^ 5
* 1 β€ A β€ 26
* 1 β€ K β€ 10 ^ {18}
* 1 β€ SA_i β€ N
* If i \ neq j, then SA_i \ neq SA_j
Input
Input follows the following format. All given numbers are integers.
N A K
SA_1_1
SA_2
...
SA_N
Output
Output the K-th character string on one line in a lexicographic order that gives SA.
If the Kth character string does not exist, output "Impossible".
Examples
Input
3 4 2
2
1
3
Output
bad
Input
18 26 10275802967
10
14
9
13
7
8
2
6
11
18
12
1
4
3
16
5
17
15
Output
ritsumeicampdaytwo
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | vfc_32921 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 134217728,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3 4 2\n2\n1\n3",
"output": "bad",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "18 26 10275802967\n10\n14\n9\n13\n7\n8\n2\n6\n11\n18\n12\n1\n4\n3\n16\n5\n17\n15",
"output": "ritsumeicampdaytwo",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "0 4 2\n2\n1\n3",
"output": "Impossible\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1 4 2\n1\n0\n3",
"output": "b\n",
"type": "stdin_stdout"
}
]
} |
|
code_contests | verifiable_code | p01771 Tree | Solve the following coding problem using the programming language python:
Problem statement
There is a rooted tree of size N. Each vertex is numbered from 0 to N-1, with a root of 0. For the vertices at both ends of any side, the assigned integer is smaller closer to the root. Initially, the weights of all edges are 0.
Process Q queries on this tree in sequence. There are two types of queries:
* Find the distance between vertices u and v (sum of the weights of the sides contained in the path).
* Increases the weights of all edges connecting to the descendants of vertex v (not including itself) by x.
input
The input consists of the following format.
N Q
a_0 b_0
...
a_ {Nβ2} b_ {Nβ2}
q_0
...
q_ {Qβ1}
a_i and b_i are the vertices connected by the i-th side. q_i is the three integers that represent the i-th query and is one of the following:
* 0 \ u_i \ v_i: Find the distance between the vertices u_i and v_i.
* 1 \ v_i \ x_i: Increases all the weights of edges connecting to the descendants of vertex v_i by x_i.
Constraint
* All inputs are integers
* 2 \ β€ N \ β€ 150 \,000
* 1 \ β€ Q \ β€ 150 \,000
* 0 \ β€ a_ {i}, b_ {i}, u_ {i}, v_ {i} \ β€ Nβ1
* a_ {i} <b_ {i}
* 0 \ β€ x_ {i} \ β€ 300
output
Print the result in one line for each distance query.
Note
I / O can be very large for this problem, so use a fast function.
sample
Sample input 1
9 6
0 1
0 2
0 3
14
1 5
4 6
5 7
5 8
1 0 1
1 1 2
0 6 3
1 5 5
1 8 4
0 4 3
Sample output 1
8
Five
It looks like the figure.
<image>
Sample input 2
13 7
0 1
1 2
twenty three
14
3 5
1 6
2 7
0 8
7 9
5 10
8 11
1 12
1 2 143
0 8 7
0 10 6
1 1 42
1 6 37
0 3 6
1 6 38
Sample output 2
143
429
269
Example
Input
9 6
0 1
0 2
0 3
1 4
1 5
4 6
5 7
5 8
1 0 1
1 1 2
0 6 3
1 5 5
1 8 4
0 4 3
Output
8
5
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | vfc_32925 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 536870912,
"problem_url": null,
"time_limit": "{'seconds': 4, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "9 6\n0 1\n0 2\n0 3\n1 4\n1 5\n4 6\n5 7\n5 8\n1 0 1\n1 1 2\n0 6 3\n1 5 5\n1 8 4\n0 4 3",
"output": "8\n5",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "9 6\n0 1\n0 2\n0 3\n1 4\n1 5\n4 6\n5 7\n5 8\n1 0 1\n1 1 2\n0 6 3\n1 5 2\n1 8 4\n0 4 3",
"output": "8\n5\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "9 6\n0 1\n0 2\n0 3\n0 4\n1 5\n4 6\n5 7\n5 8\n1 0 1\n1 1 2\n0 6 3\n1 5 5\n1 8 4\n0 4 3",
"output": "3\n2\n",
"type": "stdin_stdout"
}
]
} |
|
code_contests | verifiable_code | p01905 Tournament | Solve the following coding problem using the programming language python:
problem
AOR Ika and you came to the tournament-style table tennis tournament singles section for reconnaissance. For AOR Ika-chan, who wants to record all the games, you decide to ask for the number of games that will be played in this tournament.
There are $ N $ players in the tournament, each with a uniform number of $ 0, \ dots, N -1 $. Among them, $ M $ players abstained and did not participate in the match.
The number of games in this tournament will be determined based on the following rules.
* There are no seed players, and the number of wins required for any contestant to win is constant.
* If the opponent is absent, the match will not be played and the player who participated will win. It is not counted in the number of games.
* The tournament will end when the winner is decided.
* A person who loses a match will not play the match again. In other words, there will be no repechage or third place playoff.
* Since there is only one table tennis table, different games will not be played at the same time, and the winner will always be decided in each game (it will not be a draw).
The definition of the tournament is as follows. The tournament is represented by a full binary tree with a height of $ L = \ log_2 N $, and each apex of the leaf has the participant's uniform number written on it. Assuming that the root depth is 0, in the $ i $ round ($ 1 \ le i \ le L $), the players with the numbers written on the children of each vertex of the depth $ L --i $ will play a match. Write the winner's uniform number at the top.
<image>
output
Output the number of games played by the end of this tournament in one line. Also, output a line break at the end.
Example
Input
2 0
Output
1
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
N,M = map(int, input().split())
l = []
for i in range(M):
l.append(int(input()))
count = N - 1 - M
print(count)
``` | vfc_32929 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 268435456,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2 0",
"output": "1",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2 1",
"output": "0\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | p02186 Cutting Subarray | Solve the following coding problem using the programming language python:
E: Cut out the sum
problem
Ebi-chan has a sequence (a_1, a_2, ..., a_n). Ebi-chan is worried about the maximum value of the sum of the partial arrays (which may be empty), so please find it. Here, a subarray refers to a continuous subsequence. The sum of empty strings is 0.
In addition, Ebi-chan rewrites this sequence q times, so find this value immediately after each rewrite.
Input format
n q
a_1 a_2 ... a_n
k_1 x_1
...
k_q x_q
Each k_j, x_j (1 \ leq j \ leq q) means rewrite a_ {k_j} to x_j. Note that each rewrite is not independent and the array remains rewritten in subsequent processing.
Constraint
* 1 \ leq n \ leq 10 ^ 5
* 1 \ leq q \ leq 10 ^ 5
* 1 \ leq k_j \ leq n
* | a_i |, | x_j | \ leq 10 ^ 9
Output format
Please output q + 1 line. Output the maximum value of the sum of the subarrays before rewriting on the first line and immediately after the i-th rewrite on the 1 + i line.
Input example 1
5 2
1 2 -3 4 -5
3 3
2 -6
Output example 1
Four
Ten
7
If the subarray (a_l,β¦, a_r) is represented as a [l, r], the sum of a [1, 4] and a [4, 4] is 4 before rewriting, which is the maximum.
After the first rewrite, the sequence becomes (1, 2, 3, 4, -5), and the maximum sum is 10 of a [1, 4].
After the second rewrite, the sequence becomes (1, -6, 3, 4, -5) and the maximum sum is 7 in a [3, 4].
Input example 2
3 1
-one two Three
1 1
Output example 2
0
1
The sum of the empty strings is 0, which is the maximum before rewriting.
Example
Input
5 2
1 2 -3 4 -5
3 3
2 -6
Output
4
10
7
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | vfc_32937 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 268435456,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "5 2\n1 2 -3 4 -5\n3 3\n2 -6",
"output": "4\n10\n7",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5 2\n0 2 -3 4 -5\n3 3\n2 -6",
"output": "4\n9\n7\n",
"type": "stdin_stdout"
}
]
} |
|
code_contests | verifiable_code | carvans | Solve the following coding problem using the programming language python:
Most problems on CodeChef highlight chef's love for food and cooking but little is known about his love for racing sports. He is an avid Formula 1 fan. He went to watch this year's Indian Grand Prix at New Delhi. He noticed that one segment of the circuit was a long straight road. It was impossible for a car to overtake other cars on this segment. Therefore, a car had to lower down its speed if there was a slower car in front of it. While watching the race, Chef started to wonder how many cars were moving at their maximum speed.
Formally, you're given the maximum speed of N cars in the order they entered the long straight segment of the circuit. Each car prefers to move at its maximum speed. If that's not possible because of the front car being slow, it might have to lower its speed. It still moves at the fastest possible speed while avoiding any collisions. For the purpose of this problem, you can assume that the straight segment is infinitely long.
Count the number of cars which were moving at their maximum speed on the straight segment.
Input
The first line of the input contains a single integer T denoting the number of test cases to follow. Description of each test case contains 2 lines. The first of these lines contain a single integer N, the number of cars. The second line contains N space separated integers, denoting the maximum speed of the cars in the order they entered the long straight segment.
Output
For each test case, output a single line containing the number of cars which were moving at their maximum speed on the segment.
Example
Input:
3
1
10
3
8 3 6
5
4 5 1 2 3
Output:
1
2
2
Constraints
1 β€ T β€ 100
1 β€ N β€ 10,000
All speeds are distinct positive integers that fit in a 32 bit signed integer.
Each input file will not be larger than 4 MB (4,000,000,000 bytes) in size.
WARNING! The input files are very large. Use faster I/O.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
# cook your code here
for testcases in xrange(int(raw_input() ) ) :
n = int(raw_input())
Arr = map(int, raw_input().split() )
m = Arr[0]
c = 1
for i in xrange(1, len(Arr)):
if (Arr[i] <= m ):
c += 1
m = Arr[i]
print c
``` | vfc_32949 | {
"difficulty": "2",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3\n1\n10\n3\n8 3 6\n5\n4 5 1 2 3",
"output": "1\n2\n2\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n1\n10\n3\n8 3 6\n5\n4 5 1 2 4",
"output": "1\n2\n2\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n1\n10\n3\n0 3 6\n5\n4 5 1 2 3",
"output": "1\n1\n2\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n1\n10\n3\n8 3 1\n5\n4 5 1 2 4",
"output": "1\n3\n2\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | cranbrom | Solve the following coding problem using the programming language python:
Seeing the current political scenario in the city of Delhi,and the clean sweep of the Aam Aadmi Party, you are wondering that its maybe time to change careers and start selling broomsticks.
Now you sell broomsticks of various lengths. You initially do not have any brooms.You decide to roam about in the city finding brooms and selling them.
During each of the n days of your work as a brooms seller one of the following two events will happen:
1) You may find a broom of length L.You may or may not keep it.
2) You may have a customer ask for a broom of length L.You sell broomsticks by the length.Hence if you have the required broom of length L you can sell it in L rupees.
The only problem is that you have a bad memory hence cant remember the sizes of more than 1 broom hence you never keep more than 1 broom with yourself.
Now if you are given the events of those n days in advance, write a program to figure out the maximum amount you can earn..
Β
Input
The first line contains an integer n denoting the number of days.Each of the next n lines contain the description of the event on the particular day. If you find a broom of length L it contains "found" followed by a blank space and then the integer L.If you have a customer demanding broom of length L then it contains "demand" followed by a blank space and then the integer L..
Output
Output the maximum amount of money that you can earn in rupees if you know the input schedule of events in advance.
Constraints
1 β€ n β€ 10000
1 β€ L β€ 100000
Β
Example
Input:
4
found 3
found 4
demand 3
demand 4
Output:
4
Β
Explanation
If you choose to keep the broom of length 4 and sell it you can make a profit of Rupees 4 which is also the maximum profit that can be made
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
t=int(input())
ans=0
l=[-1]*(100001)
while(t>0):
s=raw_input().split(" ")
x=int(s[1])
if(s[0]=="found"):
l[x]=ans
elif(l[x]>=0):
ans=max(ans,l[x]+x)
l[x]-=1
t-=1
print ans
``` | vfc_32953 | {
"difficulty": "6",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4\nfound 3\nfound 4\ndemand 3\ndemand 4",
"output": "4",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | grid | Solve the following coding problem using the programming language python:
Sherlock is stuck. There is a N X N grid in which some cells are empty (denoted by β.β), while some cells have rocks in them (denoted by β#β). Sherlock is on the South of the grid. He has to watch what is happening on the East of the grid. He can place a mirror at 45 degrees on an empty cell in the grid, so that he'll see what is happening on East side by reflection from the mirror.
But, if there's a rock in his line of sight, he won't be able to see what's happening on East side. For example, following image shows all possible cells in which he can place the mirror.
You have to tell Sherlock in how many possible cells he can place the mirror and see what's happening on East side.
Input
First line, T, the number of testcases. Each testcase will consist of N in one line. Next N lines each contain N characters.
Output
For each testcase, print the number of possible options where mirror can be placed to see on the East side.
Constraints
1 β€ T β€ 10
1 β€ N β€ 1000
Β
Example
Input:
2
3
#..
#..
#..
3
#.#
#.#
#.#
Output:
6
0
Explanation
Example case 1. All places where rock are not there are valid positions.
Example case 2. No valid positions.
Note: Large input data. Use fast input/output.
Time limit for PYTH and PYTH 3.1.2 has been set 8s.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
def proc(a):
n=len(a)
j=n-1
l=0
ans=0
hsh=[True]*n
for j in range(n-1,-1,-1):
i=n-1
flag=True
while i>=0:
if a[i][j]=='#':
hsh[i]=False
flag=False
elif hsh[i] and flag: ans+=1
i-=1
print ans
t=int(input())
for ii in range(t):
n=int(input())
a=[ raw_input() for i in range(n)]
proc(a)
``` | vfc_32957 | {
"difficulty": "2",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2\n3\n#..\n#..\n#..\n3\n#.#\n#.#\n#.#",
"output": "6\n0\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n3\n#..\n..#\n#..\n3\n#.#\n#.#\n#.#",
"output": "3\n0\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n3\n#..\n\"..\n#..\n3\n#.#\n#.#\n#.#",
"output": "6\n0\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | mchairs | Solve the following coding problem using the programming language python:
A new school in Byteland is now in the process of renewing some classrooms with new, stronger and better chairs, so that the students can stay still and pay attention to class :)
However, due to budget and logistic reasons, it's only possible to carry a chair at a time to the classroom, which means that for a long time, many students will be up, waiting for their chair to arrive.
The teacher, however, as she is very clever, decided to challenge her students with a problem: "Imagine that there are N students in the classroom and that there are only K chairs. In how many ways, can I choose K elements from the class to sit down, if I see them as being distinct?"
Lira replied immediately with the right answer, so, the teacher decided to make the game a little funnier: "Okay Lira, as you are so fast, now I want you to tell me exactly the same thing, but, with the addition that the value of K is changing, this is, I want you to tell me the sum of the number of ways I can sit down K of you, if the value of K goes from 1 (meaning that there are no chairs in the classroom but one) to N (meaning that all of your chairs arrived). Can you be as fast now? As the answer might get large I want you to tell me the result modulo 1000000007. (10^9 + 7)"
As you might have noticed, it's time for you to help Lira solving this variant of the problem. :D
Input
The first line of the input file contains an integer T, denoting the number of test cases on the input file.
Afterwards, T lines follow, each containing an integer N, the number of students that the teacher will try to sit down as the number of chairs goes from 1 to N.
Output
For each test case, you should output an integer, denoting the sum of the number of ways the teacher can make N students sit down on K chairs, as K goes from 1 to N, modulo 10^9 + 7.
Constraints
1 β€ T β€ 100
1 β€ N β€ 100000000
Β
Example
Input:
2
1
2
Output:
1
3
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
t=input()
while t>0:
n=input()
print pow(2,n,1000000007)-1
t-=1
``` | vfc_32961 | {
"difficulty": "2",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2\n1\n2",
"output": "1\n3\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n1\n4",
"output": "1\n15\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n1\n8",
"output": "1\n255\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n1\n0",
"output": "1\n0\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | rdioactv | Solve the following coding problem using the programming language python:
EDIT : Please note that the user enters the whole string "Energy Level: 217" instead of just 217. You'd have to input accordingly. The output should only be the ids of radioactive elements, one id per line. Stick to the input/output format.
Β
Note: For Turbo C++, select "Text" as your language
Problem description:
After the nuclear war the world is now radioactive. Scientists say if we are not able to track the radioactive element within 30 mins, the human life as we know it, will be extinct. From element survey machines all over the world, we have collected some data. The data contains the energy levels of elements though multiple surveys. The elements with energy level more than 200 might be radioactive. The data is overwhelming, it has so many files that it cannot be read through by any human in so less amount of time. NASA has hired you to find the element.
Input
The first line contains an integer N - denoting the number of elements. The description of these elements follows in the next N lines.
Output
Output the IDs of the elements that might be radioactive.
Constraints
Should contain all the constraints on the input data that you may have. Format it like:
1 β€ N β€ 100
1 β€ Energy Level β€ 1000
Β
Example1
Input:
3
Energy Level: 20
Energy Level: 200
Energy Level: 201
Output:
3
Example2
Input:
4
Energy Level: 217
Energy Level: 246
Energy Level: 4
Energy Level: 349
Output:
1
2
4
Β
Explanation
Example 1: The first and second element are at energy levels 20, 200 respectively i.e not radioactive. While the third one is at energy level 201, which is radioactive.
Example 2: The first, second and fourth exceed energy level of 200.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
for u in range(input()):
string = raw_input().split()
if int(string[-1]) > 200:
print u + 1
``` | vfc_32965 | {
"difficulty": "6",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4\nEnergy Level: 217\nEnergy Level: 246\nEnergy Level: 4\nEnergy Level: 349",
"output": "1\n2\n4\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4\nEnergy Level: 217\nEnergy Level: 246\nEnergy Level: 4\nEnergy Level: 497",
"output": "1\n2\n4\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4\nEnergy :leveL 111\nEnerhy Lfvel: 419\nEnerfy :lfveL 1\nEnergy :leveL 816",
"output": "2\n4\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4\nxgdErp Lf:dlv 110\neynhDr :emveL 113\nDnfyfs Mmvff: 1\nEngrdx ueleL: 3370",
"output": "4\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | tproduct | Solve the following coding problem using the programming language python:
Given a complete binary tree with the height of H, we index the nodes respectively top-down and left-right from 1. The i-th node stores a positive integer Vi. Define Pi as follows: Pii if the i-th node is a leaf, otherwise Pii*PL, Vi*PR), where L and R are the indices of the left and right children of i, respectively. Your task is to caculate the value of P1.
Input
There are several test cases (fifteen at most), each formed as follows:
The first line contains a positive integer H (H β€ 15).
The second line contains 2^H-1 positive integers (each having a value of 10^9 at most), the i-th integer shows the value of Vi.
The input is ended with H = 0.
Output
For each test case, output on a line an integer which is the respective value of P1 found, by modulo of 1,000,000,007.
Example
Input:
2
1 2 3
3
3 1 5 2 6 4 7
0
Output:
3
105
Explanation:
The second test case is constructed as follows:
3
/ \
/ \
1 5
/ \ / \
2 6 4 7
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
# tree product - trproduct.py
try:
import psyco
psyco.full()
except ImportError:
pass
mod = 1000000007
h = int(raw_input())
while h>0:
v = map(int, raw_input().split())
if h>1:
level = 1<<(h-2)
while level>=1:
for i in xrange(level-1, 2*level-1):
v[i] *= max( v[2*i+1], v[2*i+2] )
# when level=1
# i from [0,1)
level >>= 1
print v[0] % 1000000007
h = int(raw_input())
``` | vfc_32969 | {
"difficulty": "2",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2\n1 2 3\n3\n3 1 5 2 6 4 7\n0",
"output": "3\n105\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n1 2 3\n3\n3 1 1 2 6 4 7\n0",
"output": "3\n21\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n1 2 3\n3\n3 1 1 2 6 1 8\n0",
"output": "3\n24\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n1 2 1\n3\n3 1 1 2 3 1 8\n0",
"output": "2\n24\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 1016_A. Death Note | Solve the following coding problem using the programming language python:
You received a notebook which is called Death Note. This notebook has infinite number of pages. A rule is written on the last page (huh) of this notebook. It says: "You have to write names in this notebook during n consecutive days. During the i-th day you have to write exactly a_i names.". You got scared (of course you got scared, who wouldn't get scared if he just receive a notebook which is named Death Note with a some strange rule written in it?).
Of course, you decided to follow this rule. When you calmed down, you came up with a strategy how you will write names in the notebook. You have calculated that each page of the notebook can contain exactly m names. You will start writing names from the first page. You will write names on the current page as long as the limit on the number of names on this page is not exceeded. When the current page is over, you turn the page. Note that you always turn the page when it ends, it doesn't matter if it is the last day or not. If after some day the current page still can hold at least one name, during the next day you will continue writing the names from the current page.
Now you are interested in the following question: how many times will you turn the page during each day? You are interested in the number of pages you will turn each day from 1 to n.
Input
The first line of the input contains two integers n, m (1 β€ n β€ 2 β
10^5, 1 β€ m β€ 10^9) β the number of days you will write names in the notebook and the number of names which can be written on each page of the notebook.
The second line contains n integers a_1, a_2, ..., a_n (1 β€ a_i β€ 10^9), where a_i means the number of names you will write in the notebook during the i-th day.
Output
Print exactly n integers t_1, t_2, ..., t_n, where t_i is the number of times you will turn the page during the i-th day.
Examples
Input
3 5
3 7 9
Output
0 2 1
Input
4 20
10 9 19 2
Output
0 0 1 1
Input
1 100
99
Output
0
Note
In the first example pages of the Death Note will look like this [1, 1, 1, 2, 2], [2, 2, 2, 2, 2], [3, 3, 3, 3, 3], [3, 3, 3, 3]. Each number of the array describes during which day name on the corresponding position will be written. It is easy to see that you should turn the first and the second page during the second day and the third page during the third day.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
(n,m) = tuple(map(int, input().split(" ")))
x = list(map(int, input().split(" ")))
nib = 0
ans = []
cou = 0;
for i in x:
nib+=i
if (nib<m):
ans.append(nib//m)
else:
ans.append(nib//m)
nib-=(nib//m)*m
print (*ans)
``` | vfc_32973 | {
"difficulty": "7",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "1 100\n99\n",
"output": "0\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4 20\n10 9 19 2\n",
"output": "0 0 1 1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 5\n3 7 9\n",
"output": "0 2 1\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 103_A. Testing Pants for Sadness | Solve the following coding problem using the programming language python:
The average miner Vaganych took refresher courses. As soon as a miner completes the courses, he should take exams. The hardest one is a computer test called "Testing Pants for Sadness".
The test consists of n questions; the questions are to be answered strictly in the order in which they are given, from question 1 to question n. Question i contains ai answer variants, exactly one of them is correct.
A click is regarded as selecting any answer in any question. The goal is to select the correct answer for each of the n questions. If Vaganych selects a wrong answer for some question, then all selected answers become unselected and the test starts from the very beginning, from question 1 again. But Vaganych remembers everything. The order of answers for each question and the order of questions remain unchanged, as well as the question and answers themselves.
Vaganych is very smart and his memory is superb, yet he is unbelievably unlucky and knows nothing whatsoever about the test's theme. How many clicks will he have to perform in the worst case?
Input
The first line contains a positive integer n (1 β€ n β€ 100). It is the number of questions in the test. The second line contains space-separated n positive integers ai (1 β€ ai β€ 109), the number of answer variants to question i.
Output
Print a single number β the minimal number of clicks needed to pass the test it the worst-case scenario.
Please do not use the %lld specificator to read or write 64-bit integers in Π‘++. It is preferred to use the cin, cout streams or the %I64d specificator.
Examples
Input
2
1 1
Output
2
Input
2
2 2
Output
5
Input
1
10
Output
10
Note
Note to the second sample. In the worst-case scenario you will need five clicks:
* the first click selects the first variant to the first question, this answer turns out to be wrong.
* the second click selects the second variant to the first question, it proves correct and we move on to the second question;
* the third click selects the first variant to the second question, it is wrong and we go back to question 1;
* the fourth click selects the second variant to the first question, it proves as correct as it was and we move on to the second question;
* the fifth click selects the second variant to the second question, it proves correct, the test is finished.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
import sys,math
s = int(input())
arr = list(map(int,input().split(' ')))
m = 0
for i in range(0,s):
m+=(arr[i]-1)*(i+1)+1
print(m)
'''
2 2 2
1+1 2
1+1+1 3
(1+1+1,1) 4
3 3
1+1+1 3
1+1+1+1+1 5
1+1+1,1+1+1,1 7
3
2 4 1
1+1
1+1+1+1+1+1+1
1
1+1+1+1
'''
``` | vfc_32977 | {
"difficulty": "7",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2\n2 2\n",
"output": "5",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n1 1\n",
"output": "2",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1\n10\n",
"output": "10",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "100\n1 3 2 1 1 2 1 3 2 2 3 1 1 1 2 2 1 3 3 1 1 2 2 3 2 1 3 1 3 2 1 1 3 3 2 1 2 2 2 3 2 2 3 2 2 3 2 1 3 1 1 2 1 3 2 2 1 1 1 1 1 1 3 1 2 3 1 1 1 1 1 2 3 3 1 1 1 1 2 3 3 1 3 2 2 3 2 1 3 2 2 3 1 1 3 2 3 2 3 1\n",
"output": "4667",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1\n84355694\n",
"output": "84355694",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n2 4 1\n",
"output": "10",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 1062_B. Math | Solve the following coding problem using the programming language python:
JATC's math teacher always gives the class some interesting math problems so that they don't get bored. Today the problem is as follows. Given an integer n, you can perform the following operations zero or more times:
* mul x: multiplies n by x (where x is an arbitrary positive integer).
* sqrt: replaces n with β{n} (to apply this operation, β{n} must be an integer).
You can perform these operations as many times as you like. What is the minimum value of n, that can be achieved and what is the minimum number of operations, to achieve that minimum value?
Apparently, no one in the class knows the answer to this problem, maybe you can help them?
Input
The only line of the input contains a single integer n (1 β€ n β€ 10^6) β the initial number.
Output
Print two integers: the minimum integer n that can be achieved using the described operations and the minimum number of operations required.
Examples
Input
20
Output
10 2
Input
5184
Output
6 4
Note
In the first example, you can apply the operation mul 5 to get 100 and then sqrt to get 10.
In the second example, you can first apply sqrt to get 72, then mul 18 to get 1296 and finally two more sqrt and you get 6.
Note, that even if the initial value of n is less or equal 10^6, it can still become greater than 10^6 after applying one or more operations.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
import math
def sieve(n):
mark = [0]*(n+1)
prime = []
for i in range(3, n+1, 2):
if not mark[i]:
for j in range(3*i, n+1, i+i):
mark[j] = 1
prime.append(2)
for i in range(3, n+1, 2):
if not mark[i]:
prime.append(i)
return prime
def ispowerof2(x):
if x and not (x & (x-1)):
return 0
else:
return 1
n = int(input())
#h = n
prime = sieve(n)
l = []
countp = 0
ans = 1
for i in prime:
countp = 0
if n % i == 0:
ans *= i
while n % i == 0:
n //= i
countp += 1
l.append(countp)
if n == 1:
break
if len(l) != 0:
maxp = max(l)
else:
maxp = 0
flag = 0
for i in l:
if i != maxp:
flag = 1
temp = 0
if flag:
temp = 1
else:
temp = ispowerof2(maxp)
if maxp == 1:
maxp -= 1
elif maxp != 0:
maxp = math.ceil(math.log2(maxp)) + temp
print(ans, maxp)
``` | vfc_32981 | {
"difficulty": "8",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "20\n",
"output": "10 2\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5184\n",
"output": "6 4\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n",
"output": "2 0\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 1084_A. The Fair Nut and Elevator | Solve the following coding problem using the programming language python:
The Fair Nut lives in n story house. a_i people live on the i-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor and to get from the first floor to the floor where he/she lives, when he/she comes back home in the evening.
It was decided that elevator, when it is not used, will stay on the x-th floor, but x hasn't been chosen yet. When a person needs to get from floor a to floor b, elevator follows the simple algorithm:
* Moves from the x-th floor (initially it stays on the x-th floor) to the a-th and takes the passenger.
* Moves from the a-th floor to the b-th floor and lets out the passenger (if a equals b, elevator just opens and closes the doors, but still comes to the floor from the x-th floor).
* Moves from the b-th floor back to the x-th.
The elevator never transposes more than one person and always goes back to the floor x before transposing a next passenger. The elevator spends one unit of electricity to move between neighboring floors. So moving from the a-th floor to the b-th floor requires |a - b| units of electricity.
Your task is to help Nut to find the minimum number of electricity units, that it would be enough for one day, by choosing an optimal the x-th floor. Don't forget than elevator initially stays on the x-th floor.
Input
The first line contains one integer n (1 β€ n β€ 100) β the number of floors.
The second line contains n integers a_1, a_2, β¦, a_n (0 β€ a_i β€ 100) β the number of people on each floor.
Output
In a single line, print the answer to the problem β the minimum number of electricity units.
Examples
Input
3
0 2 1
Output
16
Input
2
1 1
Output
4
Note
In the first example, the answer can be achieved by choosing the second floor as the x-th floor. Each person from the second floor (there are two of them) would spend 4 units of electricity per day (2 to get down and 2 to get up), and one person from the third would spend 8 units of electricity per day (4 to get down and 4 to get up). 4 β
2 + 8 β
1 = 16.
In the second example, the answer can be achieved by choosing the first floor as the x-th floor.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
n = int(input())
arr = list(map(int, input().split()))
cur = 0
ans = 100000000
for x in range(n):
cur = 0
for i in range(n):
summ = 0
summ += abs(x - i)
summ += i
summ += x
summ += x
summ += i
summ += abs(x - i)
summ *= arr[i]
cur += summ
if cur < ans:
ans = cur
print(ans)
``` | vfc_32985 | {
"difficulty": "7",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2\n1 1\n",
"output": "4\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n0 2 1\n",
"output": "16\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n6 1 1 8 3\n",
"output": "156\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n4 9 4 2 6\n",
"output": "188\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n1 2 2\n",
"output": "24\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "100\n23 94 2 59 41 51 92 74 92 76 37 98 76 47 60 4 22 32 22 32 57 39 68 60 38 41 61 7 34 98 42 44 52 100 81 24 16 51 10 84 34 52 73 100 69 38 14 77 32 4 59 37 68 81 6 37 52 6 96 22 12 23 63 57 59 18 20 1 57 87 22 68 65 7 70 39 55 49 41 54 84 51 17 73 13 78 52 10 4 6 87 47 67 8 65 41 19 24 65 76\n",
"output": "902296\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 1131_C. Birthday | Solve the following coding problem using the programming language python:
Cowboy Vlad has a birthday today! There are n children who came to the celebration. In order to greet Vlad, the children decided to form a circle around him. Among the children who came, there are both tall and low, so if they stand in a circle arbitrarily, it may turn out, that there is a tall and low child standing next to each other, and it will be difficult for them to hold hands. Therefore, children want to stand in a circle so that the maximum difference between the growth of two neighboring children would be minimal possible.
Formally, let's number children from 1 to n in a circle order, that is, for every i child with number i will stand next to the child with number i+1, also the child with number 1 stands next to the child with number n. Then we will call the discomfort of the circle the maximum absolute difference of heights of the children, who stand next to each other.
Please help children to find out how they should reorder themselves, so that the resulting discomfort is smallest possible.
Input
The first line contains a single integer n (2 β€ n β€ 100) β the number of the children who came to the cowboy Vlad's birthday.
The second line contains integers a_1, a_2, β¦, a_n (1 β€ a_i β€ 10^9) denoting heights of every child.
Output
Print exactly n integers β heights of the children in the order in which they should stand in a circle. You can start printing a circle with any child.
If there are multiple possible answers, print any of them.
Examples
Input
5
2 1 1 3 2
Output
1 2 3 2 1
Input
3
30 10 20
Output
10 20 30
Note
In the first example, the discomfort of the circle is equal to 1, since the corresponding absolute differences are 1, 1, 1 and 0. Note, that sequences [2, 3, 2, 1, 1] and [3, 2, 1, 1, 2] form the same circles and differ only by the selection of the starting point.
In the second example, the discomfort of the circle is equal to 20, since the absolute difference of 10 and 30 is equal to 20.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
n = int(input())
arr = [int(i) for i in input().split()]
arr1, arr2 = [], []
arr.sort(reverse = True)
for i in range(n):
if i%2==0:
arr1.append(arr[i])
else:
arr2.append(arr[i])
arr2.reverse()
for i in arr2:
arr1.append(i)
print(*arr1)
``` | vfc_32993 | {
"difficulty": "9",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3\n30 10 20\n",
"output": "10 30 20 ",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n2 1 1 3 2\n",
"output": "1 2 3 2 1 ",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n7318577 1728333 8514304 9971719 9004162\n",
"output": "1728333 8514304 9971719 9004162 7318577 ",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "100\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\n",
"output": "1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 51 53 55 57 59 61 63 65 67 69 71 73 75 77 79 81 83 85 87 89 91 93 95 97 99 100 98 96 94 92 90 88 86 84 82 80 78 76 74 72 70 68 66 64 62 60 58 56 54 52 50 48 46 44 42 40 38 36 34 32 30 28 26 24 22 20 18 16 14 12 10 8 6 4 2 ",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "10\n307761 832732 700511 820583 522866 130891 914566 128429 739710 69099\n",
"output": "69099 130891 522866 739710 832732 914566 820583 700511 307761 128429 ",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n10 20\n",
"output": "10 20 ",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 1151_E. Number of Components | Solve the following coding problem using the programming language python:
The Kingdom of Kremland is a tree (a connected undirected graph without cycles) consisting of n vertices. Each vertex i has its own value a_i. All vertices are connected in series by edges. Formally, for every 1 β€ i < n there is an edge between the vertices of i and i+1.
Denote the function f(l, r), which takes two integers l and r (l β€ r):
* We leave in the tree only vertices whose values ββrange from l to r.
* The value of the function will be the number of connected components in the new graph.
Your task is to calculate the following sum: $$$β_{l=1}^{n} β_{r=l}^{n} f(l, r) $$$
Input
The first line contains a single integer n (1 β€ n β€ 10^5) β the number of vertices in the tree.
The second line contains n integers a_1, a_2, β¦, a_n (1 β€ a_i β€ n) β the values of the vertices.
Output
Print one number β the answer to the problem.
Examples
Input
3
2 1 3
Output
7
Input
4
2 1 1 3
Output
11
Input
10
1 5 2 5 5 3 10 6 5 1
Output
104
Note
In the first example, the function values ββwill be as follows:
* f(1, 1)=1 (there is only a vertex with the number 2, which forms one component)
* f(1, 2)=1 (there are vertices 1 and 2 that form one component)
* f(1, 3)=1 (all vertices remain, one component is obtained)
* f(2, 2)=1 (only vertex number 1)
* f(2, 3)=2 (there are vertices 1 and 3 that form two components)
* f(3, 3)=1 (only vertex 3)
Totally out 7.
In the second example, the function values ββwill be as follows:
* f(1, 1)=1
* f(1, 2)=1
* f(1, 3)=1
* f(1, 4)=1
* f(2, 2)=1
* f(2, 3)=2
* f(2, 4)=2
* f(3, 3)=1
* f(3, 4)=1
* f(4, 4)=0 (there is no vertex left, so the number of components is 0)
Totally out 11.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
n = int(input()) + 1
res = 0
a = tuple(map(int, input().split()))
for ai in a:
res += ai * (n - ai)
for ai, aj in map(sorted, zip(a, a[1:])):
res -= ai * (n - aj)
print(res)
#
``` | vfc_32997 | {
"difficulty": "11",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3\n2 1 3\n",
"output": "7\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "10\n1 5 2 5 5 3 10 6 5 1\n",
"output": "104\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4\n2 1 1 3\n",
"output": "11\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 1173_D. Nauuo and Circle | Solve the following coding problem using the programming language python:
Nauuo is a girl who loves drawing circles.
One day she has drawn a circle and wanted to draw a tree on it.
The tree is a connected undirected graph consisting of n nodes and n-1 edges. The nodes are numbered from 1 to n.
Nauuo wants to draw a tree on the circle, the nodes of the tree should be in n distinct points on the circle, and the edges should be straight without crossing each other.
"Without crossing each other" means that every two edges have no common point or the only common point is an endpoint of both edges.
Nauuo wants to draw the tree using a permutation of n elements. A permutation of n elements is a sequence of integers p_1,p_2,β¦,p_n in which every integer from 1 to n appears exactly once.
After a permutation is chosen Nauuo draws the i-th node in the p_i-th point on the circle, then draws the edges connecting the nodes.
The tree is given, Nauuo wants to know how many permutations are there so that the tree drawn satisfies the rule (the edges are straight without crossing each other). She only wants to know the answer modulo 998244353, can you help her?
It is obvious that whether a permutation is valid or not does not depend on which n points on the circle are chosen.
Input
The first line contains a single integer n (2β€ nβ€ 2β
10^5) β the number of nodes in the tree.
Each of the next n-1 lines contains two integers u and v (1β€ u,vβ€ n), denoting there is an edge between u and v.
It is guaranteed that the given edges form a tree.
Output
The output contains a single integer β the number of permutations suitable to draw the given tree on a circle satisfying the rule, modulo 998244353.
Examples
Input
4
1 2
1 3
2 4
Output
16
Input
4
1 2
1 3
1 4
Output
24
Note
Example 1
All valid permutations and their spanning trees are as follows.
<image>
Here is an example of invalid permutation: the edges (1,3) and (2,4) are crossed.
<image>
Example 2
Every permutation leads to a valid tree, so the answer is 4! = 24.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
import sys
n = int(sys.stdin.readline().strip())
D = [0] * n
p = 998244353
for i in range (0, n - 1):
u, v = list(map(int, sys.stdin.readline().strip().split()))
D[u-1] = D[u-1] + 1
D[v-1] = D[v-1] + 1
ans = n
for i in range (0, n):
for j in range (0, D[i]):
ans = (ans * (j + 1)) % p
print(ans)
``` | vfc_33001 | {
"difficulty": "10",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4\n1 2\n1 3\n1 4\n",
"output": "24\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4\n1 2\n1 3\n2 4\n",
"output": "16\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 1191_A. Tokitsukaze and Enhancement | Solve the following coding problem using the programming language python:
Tokitsukaze is one of the characters in the game "Kantai Collection". In this game, every character has a common attribute β health points, shortened to HP.
In general, different values of HP are grouped into 4 categories:
* Category A if HP is in the form of (4 n + 1), that is, when divided by 4, the remainder is 1;
* Category B if HP is in the form of (4 n + 3), that is, when divided by 4, the remainder is 3;
* Category C if HP is in the form of (4 n + 2), that is, when divided by 4, the remainder is 2;
* Category D if HP is in the form of 4 n, that is, when divided by 4, the remainder is 0.
The above-mentioned n can be any integer.
These 4 categories ordered from highest to lowest as A > B > C > D, which means category A is the highest and category D is the lowest.
While playing the game, players can increase the HP of the character. Now, Tokitsukaze wants you to increase her HP by at most 2 (that is, either by 0, 1 or 2). How much should she increase her HP so that it has the highest possible category?
Input
The only line contains a single integer x (30 β€ x β€ 100) β the value Tokitsukaze's HP currently.
Output
Print an integer a (0 β€ a β€ 2) and an uppercase letter b (b β { A, B, C, D }), representing that the best way is to increase her HP by a, and then the category becomes b.
Note that the output characters are case-sensitive.
Examples
Input
33
Output
0 A
Input
98
Output
1 B
Note
For the first example, the category of Tokitsukaze's HP is already A, so you don't need to enhance her ability.
For the second example:
* If you don't increase her HP, its value is still 98, which equals to (4 Γ 24 + 2), and its category is C.
* If you increase her HP by 1, its value becomes 99, which equals to (4 Γ 24 + 3), and its category becomes B.
* If you increase her HP by 2, its value becomes 100, which equals to (4 Γ 25), and its category becomes D.
Therefore, the best way is to increase her HP by 1 so that the category of her HP becomes B.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
n=int(input())
d={}
d[0]='1 A'
d[1]='0 A'
d[2]='1 B'
d[3]='2 A'
x=n%4
print(d[x])
``` | vfc_33005 | {
"difficulty": "7",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "33\n",
"output": "0 A\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "98\n",
"output": "1 B\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "85\n",
"output": "0 A\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "99\n",
"output": "2 A\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "50\n",
"output": "1 B\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "100\n",
"output": "1 A\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 120_A. Elevator | Solve the following coding problem using the programming language python:
A sky scraper with 1000 floors has been built in the city of N. It has modern superfast elevators to help to travel from one floor to another. Each elevator has two doors, the front one and the back one. If one goes in through the front door, he goes out through the back one and vice versa. The elevator has two rails numbered with numbers 1 and 2. Rail 1 is located to the left of the entrance to the front door (or correspondingly, to the right of the entrance to the back door). Rail 2 is located opposite it, to the right of the entrance to the front door and to the left of the entrance to the back door. We know that each person in the city of N holds at a rail with the strongest hand.
One day a VIP person visited the city and of course, he took a look at the skyscraper and took a ride in the elevator. We know the door through which he entered and the rail he was holding at. Now we need to determine as soon as possible whether he is left-handed or right-handed.
Input
The first line indicates the door through which the very important person entered the elevator. It contains "front" if the person enters the elevator through the front door and "back" if he entered the elevator through the back door. The second line contains integer a (1 β€ a β€ 2) which denotes the number of the rail at which the person was holding.
Output
Print character "R" if the VIP is right-handed or "L" if he is left-handed.
Examples
Input
front
1
Output
L
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
enter = {'front':0, 'back':1}
hand = ['L','R']
try:
op = open('output.txt', 'w');
with open('input.txt') as ip:
op.write(hand[enter[ip.readline().strip()]^(int(ip.readline())-1)])
op.close()
except IOError as e:
print 'L'
``` | vfc_33009 | {
"difficulty": "7",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "front\n1\n",
"output": "L\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "back\n2\n",
"output": "L\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "front\n2\n",
"output": "R\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 122_D. Lucky Transformation | Solve the following coding problem using the programming language python:
Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya has a number consisting of n digits without leading zeroes. He represented it as an array of digits without leading zeroes. Let's call it d. The numeration starts with 1, starting from the most significant digit. Petya wants to perform the following operation k times: find the minimum x (1 β€ x < n) such that dx = 4 and dx + 1 = 7, if x is odd, then to assign dx = dx + 1 = 4, otherwise to assign dx = dx + 1 = 7. Note that if no x was found, then the operation counts as completed and the array doesn't change at all.
You are given the initial number as an array of digits and the number k. Help Petya find the result of completing k operations.
Input
The first line contains two integers n and k (1 β€ n β€ 105, 0 β€ k β€ 109) β the number of digits in the number and the number of completed operations. The second line contains n digits without spaces representing the array of digits d, starting with d1. It is guaranteed that the first digit of the number does not equal zero.
Output
In the single line print the result without spaces β the number after the k operations are fulfilled.
Examples
Input
7 4
4727447
Output
4427477
Input
4 2
4478
Output
4478
Note
In the first sample the number changes in the following sequence: 4727447 β 4427447 β 4427477 β 4427447 β 4427477.
In the second sample: 4478 β 4778 β 4478.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
n, k = map(int, input().split())
s = list(input())
cnt = 0
for i in range(n - 1):
if cnt == k:
break
if s[i] == '4' and s[i + 1] == '7':
if i & 1:
if s[i - 1] == '4':
if (cnt - k) & 1:
s[i] = '7'
print(''.join(s))
exit()
s[i] = '7'
else:
if i != n - 2:
if s[i + 2] == '7':
if (cnt - k) & 1:
s[i + 1] = '4'
print(''.join(s))
exit()
s[i + 1] = '4'
cnt += 1
print(''.join(s))
``` | vfc_33013 | {
"difficulty": "10",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4 2\n4478\n",
"output": "4478\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "7 4\n4727447\n",
"output": "4427477\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "7 74\n4777774\n",
"output": "4777774\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 1251_C. Minimize The Integer | Solve the following coding problem using the programming language python:
You are given a huge integer a consisting of n digits (n is between 1 and 3 β
10^5, inclusive). It may contain leading zeros.
You can swap two digits on adjacent (neighboring) positions if the swapping digits are of different parity (that is, they have different remainders when divided by 2).
For example, if a = 032867235 you can get the following integers in a single operation:
* 302867235 if you swap the first and the second digits;
* 023867235 if you swap the second and the third digits;
* 032876235 if you swap the fifth and the sixth digits;
* 032862735 if you swap the sixth and the seventh digits;
* 032867325 if you swap the seventh and the eighth digits.
Note, that you can't swap digits on positions 2 and 4 because the positions are not adjacent. Also, you can't swap digits on positions 3 and 4 because the digits have the same parity.
You can perform any number (possibly, zero) of such operations.
Find the minimum integer you can obtain.
Note that the resulting integer also may contain leading zeros.
Input
The first line contains one integer t (1 β€ t β€ 10^4) β the number of test cases in the input.
The only line of each test case contains the integer a, its length n is between 1 and 3 β
10^5, inclusive.
It is guaranteed that the sum of all values n does not exceed 3 β
10^5.
Output
For each test case print line β the minimum integer you can obtain.
Example
Input
3
0709
1337
246432
Output
0079
1337
234642
Note
In the first test case, you can perform the following sequence of operations (the pair of swapped digits is highlighted): 0 \underline{70} 9 β 0079.
In the second test case, the initial integer is optimal.
In the third test case you can perform the following sequence of operations: 246 \underline{43} 2 β 24 \underline{63}42 β 2 \underline{43} 642 β 234642.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
# -*- coding: utf-8 -*-
"""
Created on Fri Nov 1 14:39:37 2019
@author: uditg
"""
ans={}
test=int(input())
for each in range(test):
num=input()
n=len(num)
num={i:int(num[i]) for i in range(n)}
output={}
even={}
odd={}
even_count=0
odd_count=0
for i in range(n):
if num[i]%2==0:
even[even_count]=num[i]
even_count+=1
else:
odd[odd_count]=num[i]
odd_count+=1
num={}
#print("even",even,"and",odd,"\n")
i=0
j=0
count=0
while even and odd:
output[count]=(min(even[i],odd[j]))
if min(even[i],odd[j])==even[i]:
del even[i]
i+=1
else:
del odd[j]
j+=1
count+=1
if even:
for every in range(i,max(even.keys())+1):
output[count]=even[every]
count+=1
#output+=[even[every] for every in range(i,max(even.keys())+1)]
if odd:
for every in range(j,max(odd.keys())+1):
output[count]=odd[every]
#print(output[count])
count+=1
#output+=[odd[every] for every in range(j,max(odd.keys())+1)]
outputs=[str(output[me]) for me in range(max(output.keys())+1)]
ans[each]="".join(outputs)
for each in range(test):
print(ans[each])
``` | vfc_33017 | {
"difficulty": "9",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3\n0709\n1337\n246432\n",
"output": "0079\n1337\n234642\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1\n1003\n",
"output": "0013\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1\n890\n",
"output": "809\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n477\n1337\n246432\n",
"output": "477\n1337\n234642\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 1271_A. Suits | Solve the following coding problem using the programming language python:
A new delivery of clothing has arrived today to the clothing store. This delivery consists of a ties, b scarves, c vests and d jackets.
The store does not sell single clothing items β instead, it sells suits of two types:
* a suit of the first type consists of one tie and one jacket;
* a suit of the second type consists of one scarf, one vest and one jacket.
Each suit of the first type costs e coins, and each suit of the second type costs f coins.
Calculate the maximum possible cost of a set of suits that can be composed from the delivered clothing items. Note that one item cannot be used in more than one suit (though some items may be left unused).
Input
The first line contains one integer a (1 β€ a β€ 100 000) β the number of ties.
The second line contains one integer b (1 β€ b β€ 100 000) β the number of scarves.
The third line contains one integer c (1 β€ c β€ 100 000) β the number of vests.
The fourth line contains one integer d (1 β€ d β€ 100 000) β the number of jackets.
The fifth line contains one integer e (1 β€ e β€ 1 000) β the cost of one suit of the first type.
The sixth line contains one integer f (1 β€ f β€ 1 000) β the cost of one suit of the second type.
Output
Print one integer β the maximum total cost of some set of suits that can be composed from the delivered items.
Examples
Input
4
5
6
3
1
2
Output
6
Input
12
11
13
20
4
6
Output
102
Input
17
14
5
21
15
17
Output
325
Note
It is possible to compose three suits of the second type in the first example, and their total cost will be 6. Since all jackets will be used, it's impossible to add anything to this set.
The best course of action in the second example is to compose nine suits of the first type and eleven suits of the second type. The total cost is 9 β
4 + 11 β
6 = 102.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
a = int(input())
b = int(input())
c = int(input())
d = int(input())
c1 = int(input())
c2 = int(input())
p = 0
if c2 > c1:
m = min(b,c,d)
b -= m
c -= m
d -= m
p += m * c2
if d > 0:
p += (min(a,d) * c1)
else:
m = min(a,d)
a -= m
d -= m
p += m * c1
if d > 0:
p += (min(b,c,d) * c2)
print(p)
``` | vfc_33021 | {
"difficulty": "7",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4\n5\n6\n3\n1\n2\n",
"output": "6\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "17\n14\n5\n21\n15\n17\n",
"output": "325\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "12\n11\n13\n20\n4\n6\n",
"output": "102\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "88\n476\n735\n980\n731\n404\n",
"output": "256632\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 1294_B. Collecting Packages | Solve the following coding problem using the programming language python:
There is a robot in a warehouse and n packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point (0, 0). The i-th package is at the point (x_i, y_i). It is guaranteed that there are no two packages at the same point. It is also guaranteed that the point (0, 0) doesn't contain a package.
The robot is semi-broken and only can move up ('U') and right ('R'). In other words, in one move the robot can go from the point (x, y) to the point (x + 1, y) or to the point (x, y + 1).
As we say above, the robot wants to collect all n packages (in arbitrary order). He wants to do it with the minimum possible number of moves. If there are several possible traversals, the robot wants to choose the lexicographically smallest path.
The string s of length n is lexicographically less than the string t of length n if there is some index 1 β€ j β€ n that for all i from 1 to j-1 s_i = t_i and s_j < t_j. It is the standard comparison of string, like in a dictionary. Most programming languages compare strings in this way.
Input
The first line of the input contains an integer t (1 β€ t β€ 100) β the number of test cases. Then test cases follow.
The first line of a test case contains one integer n (1 β€ n β€ 1000) β the number of packages.
The next n lines contain descriptions of packages. The i-th package is given as two integers x_i and y_i (0 β€ x_i, y_i β€ 1000) β the x-coordinate of the package and the y-coordinate of the package.
It is guaranteed that there are no two packages at the same point. It is also guaranteed that the point (0, 0) doesn't contain a package.
The sum of all values n over test cases in the test doesn't exceed 1000.
Output
Print the answer for each test case.
If it is impossible to collect all n packages in some order starting from (0,0), print "NO" on the first line.
Otherwise, print "YES" in the first line. Then print the shortest path β a string consisting of characters 'R' and 'U'. Among all such paths choose the lexicographically smallest path.
Note that in this problem "YES" and "NO" can be only uppercase words, i.e. "Yes", "no" and "YeS" are not acceptable.
Example
Input
3
5
1 3
1 2
3 3
5 5
4 3
2
1 0
0 1
1
4 3
Output
YES
RUUURRRRUU
NO
YES
RRRRUUU
Note
For the first test case in the example the optimal path RUUURRRRUU is shown below:
<image>
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
t=int(input())
for q in range(t):
n=int(input())
a=[list(map(int,input().split())) for i in range(n)]
a.sort()
ans=""
x,y=0,0
f=0
for i in range(n):
if a[i][0]>=x and a[i][1]>=y:
ans+='R'*(a[i][0]-x)
x=a[i][0]
ans+='U'*(a[i][1]-y)
y=a[i][1]
else:
f=1
print('NO')
break
if f==0:
print('YES')
print(ans)
``` | vfc_33025 | {
"difficulty": "8",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3\n5\n1 3\n1 2\n3 3\n5 5\n4 3\n2\n1 0\n0 1\n1\n4 3\n",
"output": "YES\nRUUURRRRUU\nNO\nYES\nRRRRUUU\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n1\n1 1\n1\n1 1\n",
"output": "YES\nRU\nYES\nRU\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n1\n1 2\n1\n1 1\n",
"output": "YES\nRUU\nYES\nRU\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n1\n1 2\n1\n2 1\n",
"output": "YES\nRUU\nYES\nRRU\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n1\n1 2\n1\n1 2\n",
"output": "YES\nRUU\nYES\nRUU\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 1315_B. Homecoming | Solve the following coding problem using the programming language python:
After a long party Petya decided to return home, but he turned out to be at the opposite end of the town from his home. There are n crossroads in the line in the town, and there is either the bus or the tram station at each crossroad.
The crossroads are represented as a string s of length n, where s_i = A, if there is a bus station at i-th crossroad, and s_i = B, if there is a tram station at i-th crossroad. Currently Petya is at the first crossroad (which corresponds to s_1) and his goal is to get to the last crossroad (which corresponds to s_n).
If for two crossroads i and j for all crossroads i, i+1, β¦, j-1 there is a bus station, one can pay a roubles for the bus ticket, and go from i-th crossroad to the j-th crossroad by the bus (it is not necessary to have a bus station at the j-th crossroad). Formally, paying a roubles Petya can go from i to j if s_t = A for all i β€ t < j.
If for two crossroads i and j for all crossroads i, i+1, β¦, j-1 there is a tram station, one can pay b roubles for the tram ticket, and go from i-th crossroad to the j-th crossroad by the tram (it is not necessary to have a tram station at the j-th crossroad). Formally, paying b roubles Petya can go from i to j if s_t = B for all i β€ t < j.
For example, if s="AABBBAB", a=4 and b=3 then Petya needs:
<image>
* buy one bus ticket to get from 1 to 3,
* buy one tram ticket to get from 3 to 6,
* buy one bus ticket to get from 6 to 7.
Thus, in total he needs to spend 4+3+4=11 roubles. Please note that the type of the stop at the last crossroad (i.e. the character s_n) does not affect the final expense.
Now Petya is at the first crossroad, and he wants to get to the n-th crossroad. After the party he has left with p roubles. He's decided to go to some station on foot, and then go to home using only public transport.
Help him to choose the closest crossroad i to go on foot the first, so he has enough money to get from the i-th crossroad to the n-th, using only tram and bus tickets.
Input
Each test contains one or more test cases. The first line contains the number of test cases t (1 β€ t β€ 10^4).
The first line of each test case consists of three integers a, b, p (1 β€ a, b, p β€ 10^5) β the cost of bus ticket, the cost of tram ticket and the amount of money Petya has.
The second line of each test case consists of one string s, where s_i = A, if there is a bus station at i-th crossroad, and s_i = B, if there is a tram station at i-th crossroad (2 β€ |s| β€ 10^5).
It is guaranteed, that the sum of the length of strings s by all test cases in one test doesn't exceed 10^5.
Output
For each test case print one number β the minimal index i of a crossroad Petya should go on foot. The rest of the path (i.e. from i to n he should use public transport).
Example
Input
5
2 2 1
BB
1 1 1
AB
3 2 8
AABBBBAABB
5 3 4
BBBBB
2 1 1
ABABAB
Output
2
1
3
1
6
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
t = int(input())
for _ in range(t):
a, b, p = map(int, input().split())
s = input()
d = {'A': a, 'B': b}
i = len(s)-1
prev = len(s)-1
while i >= 0:
i -= 1
curr = s[i]
while s[i] == curr and i >= 0:
i -= 1
i += 1
p -= d[curr]
if p < 0:
break
prev = i
print(prev+1)
``` | vfc_33029 | {
"difficulty": "8",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "5\n2 2 1\nBB\n1 1 1\nAB\n3 2 8\nAABBBBAABB\n5 3 4\nBBBBB\n2 1 1\nABABAB\n",
"output": "2\n1\n3\n1\n6\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n2 1 1\nBB\n1 1 1\nAB\n3 2 8\nAABBBBAABB\n5 3 4\nBBBBB\n2 1 1\nABABAB\n",
"output": "1\n1\n3\n1\n6\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n2 1 1\nBB\n1 1 1\nAB\n3 0 8\nAABBBBAABB\n5 3 4\nBBBBB\n2 1 1\nABABAB\n",
"output": "1\n1\n1\n1\n6\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n3 1 0\nBB\n1 1 2\nBA\n3 0 8\nAABBBBAABB\n5 3 4\nBBBBB\n2 1 1\nABABAB\n",
"output": "2\n1\n1\n1\n6\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n2 2 0\nBB\n1 1 1\nAB\n3 2 8\nAABBBBAABB\n5 3 4\nBBBBB\n2 1 1\nABABAB\n",
"output": "2\n1\n3\n1\n6\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n2 2 0\nBB\n1 1 1\nAB\n5 2 8\nAABBBBAABB\n5 3 4\nBBBBB\n2 1 1\nABABAB\n",
"output": "2\n1\n7\n1\n6\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 1336_E1. Chiori and Doll Picking (easy version) | Solve the following coding problem using the programming language python:
This is the easy version of the problem. The only difference between easy and hard versions is the constraint of m. You can make hacks only if both versions are solved.
Chiori loves dolls and now she is going to decorate her bedroom!
<image>
As a doll collector, Chiori has got n dolls. The i-th doll has a non-negative integer value a_i (a_i < 2^m, m is given). Chiori wants to pick some (maybe zero) dolls for the decoration, so there are 2^n different picking ways.
Let x be the bitwise-xor-sum of values of dolls Chiori picks (in case Chiori picks no dolls x = 0). The value of this picking way is equal to the number of 1-bits in the binary representation of x. More formally, it is also equal to the number of indices 0 β€ i < m, such that \leftβ (x)/(2^i) \rightβ is odd.
Tell her the number of picking ways with value i for each integer i from 0 to m. Due to the answers can be very huge, print them by modulo 998 244 353.
Input
The first line contains two integers n and m (1 β€ n β€ 2 β
10^5, 0 β€ m β€ 35) β the number of dolls and the maximum value of the picking way.
The second line contains n integers a_1, a_2, β¦, a_n (0 β€ a_i < 2^m) β the values of dolls.
Output
Print m+1 integers p_0, p_1, β¦, p_m β p_i is equal to the number of picking ways with value i by modulo 998 244 353.
Examples
Input
4 4
3 5 8 14
Output
2 2 6 6 0
Input
6 7
11 45 14 9 19 81
Output
1 2 11 20 15 10 5 0
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
import sys
MOD = 998244353
BOUND = 21
n, m = map(int, input().split())
l = list(map(int,input().split()))
basis = []
for p in range(m-1,-1,-1):
p2 = pow(2,p)
nex = -1
for i in range(n):
if l[i] >= p2:
nex = l[i]
break
if nex != -1:
basis.append(nex)
for i in range(n):
if l[i] >= p2:
l[i] ^= nex
extra = n - len(basis)
def add(a, b):
out = [0] * (max(len(a), len(b)))
for i in range(len(a)):
out[i] = a[i]
for i in range(len(b)):
out[i] += b[i]
out[i] %= MOD
return out
def addSh(a, b):
out = [0] * (max(len(a) + 1, len(b)))
for i in range(len(a)):
out[i + 1] = a[i]
for i in range(len(b)):
out[i] += b[i]
out[i] %= MOD
return out
i = 0
curr = dict()
curr[0] = [1]
for p in range(m-1,-1,-1):
if p == m - 1 and p < BOUND:
curr = [curr[i] if i in curr else [] for i in range(2 ** 20)]
if p >= BOUND:
p2 = pow(2,p)
if i < len(basis) and basis[i] >= p2:
currN = dict(curr)
for v in curr:
if v ^ basis[i] not in currN:
currN[v ^ basis[i]] = [0]
currN[v ^ basis[i]] = add(curr[v], currN[v ^ basis[i]])
curr = currN
i += 1
lis = list(curr.keys())
for v in lis:
if v >= p2:
if v ^ p2 not in currN:
curr[v ^ p2] = [0]
curr[v ^ p2] = addSh(curr[v], curr[v ^ p2])
del curr[v]
else:
p2 = pow(2,p)
if i < len(basis) and basis[i] >= p2:
for v in range(p2):
curr[v ^ basis[i]] = add(curr[v], curr[v ^ basis[i]])
curr[v] = curr[v ^ basis[i]]
i += 1
for v in range(p2):
curr[v] = addSh(curr[v ^ p2], curr[v])
if p == BOUND:
curr = [curr[i] if i in curr else [] for i in range(2 ** BOUND)]
out = curr[0]
while len(out) < m + 1:
out.append(0)
for i in range(m + 1):
out[i] *= pow(2, extra, MOD)
out[i] %= MOD
for v in out:
sys.stdout.write(str(v)+' ')
``` | vfc_33033 | {
"difficulty": "11",
"memory_limit": null,
"memory_limit_bytes": 512000000,
"problem_url": null,
"time_limit": "{'seconds': 3, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "6 7\n11 45 14 9 19 81\n",
"output": "1 2 11 20 15 10 5 0 \n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4 4\n3 5 8 14\n",
"output": "2 2 6 6 0 \n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "30 30\n65536 536870912 2097152 512 32768 16384 8388608 16777216 524288 4194304 1 1048576 2048 262144 64 4096 8192 256 131072 2 268435456 33554432 32 16 134217728 8 67108864 128 4 1024\n",
"output": "1 30 435 4060 27405 142506 593775 2035800 5852925 14307150 30045015 54627300 86493225 119759850 145422675 155117520 145422675 119759850 86493225 54627300 30045015 14307150 5852925 2035800 593775 142506 27405 4060 435 30 1 \n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "6 35\n23601314651 29074846252 10638992479 32779777411 26378409257 33108582487\n",
"output": "1 0 0 0 0 0 0 0 0 0 0 1 0 1 8 6 6 8 8 7 5 7 3 2 0 0 1 0 0 0 0 0 0 0 0 0 \n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 1359_B. New Theatre Square | Solve the following coding problem using the programming language python:
You might have remembered Theatre square from the [problem 1A](https://codeforces.com/problemset/problem/1/A). Now it's finally getting repaved.
The square still has a rectangular shape of n Γ m meters. However, the picture is about to get more complicated now. Let a_{i,j} be the j-th square in the i-th row of the pavement.
You are given the picture of the squares:
* if a_{i,j} = "*", then the j-th square in the i-th row should be black;
* if a_{i,j} = ".", then the j-th square in the i-th row should be white.
The black squares are paved already. You have to pave the white squares. There are two options for pavement tiles:
* 1 Γ 1 tiles β each tile costs x burles and covers exactly 1 square;
* 1 Γ 2 tiles β each tile costs y burles and covers exactly 2 adjacent squares of the same row. Note that you are not allowed to rotate these tiles or cut them into 1 Γ 1 tiles.
You should cover all the white squares, no two tiles should overlap and no black squares should be covered by tiles.
What is the smallest total price of the tiles needed to cover all the white squares?
Input
The first line contains a single integer t (1 β€ t β€ 500) β the number of testcases. Then the description of t testcases follow.
The first line of each testcase contains four integers n, m, x and y (1 β€ n β€ 100; 1 β€ m β€ 1000; 1 β€ x, y β€ 1000) β the size of the Theatre square, the price of the 1 Γ 1 tile and the price of the 1 Γ 2 tile.
Each of the next n lines contains m characters. The j-th character in the i-th line is a_{i,j}. If a_{i,j} = "*", then the j-th square in the i-th row should be black, and if a_{i,j} = ".", then the j-th square in the i-th row should be white.
It's guaranteed that the sum of n Γ m over all testcases doesn't exceed 10^5.
Output
For each testcase print a single integer β the smallest total price of the tiles needed to cover all the white squares in burles.
Example
Input
4
1 1 10 1
.
1 2 10 1
..
2 1 10 1
.
.
3 3 3 7
..*
*..
.*.
Output
10
1
20
18
Note
In the first testcase you are required to use a single 1 Γ 1 tile, even though 1 Γ 2 tile is cheaper. So the total price is 10 burles.
In the second testcase you can either use two 1 Γ 1 tiles and spend 20 burles or use a single 1 Γ 2 tile and spend 1 burle. The second option is cheaper, thus the answer is 1.
The third testcase shows that you can't rotate 1 Γ 2 tiles. You still have to use two 1 Γ 1 tiles for the total price of 20.
In the fourth testcase the cheapest way is to use 1 Γ 1 tiles everywhere. The total cost is 6 β
3 = 18.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
cases=input()
for i in range(0,int(cases)):
inss=input()
list=inss.split(' ')
n=int(list[0])
m=int(list[1])
x=int(list[2])
y=int(list[3])
price=0
if 2*x > y:
lame=True
else:
lame=False
for count in range(0,n):
data=input()
###print(data)
###list1=data.split('')
###print(list1)
if lame:
##print("lame yes")
sing=0
doub=0
lolz=False
for item in data:
##print(item)
if lolz:
if item=='.':
doub=doub+1
sing=sing-1
lolz=False
else:
lolz=False
else:
if item=='.':
sing=sing+1
lolz=True
##print(doub,sing)
price=price+(doub*y+sing*x)
##print(price,"1")
else:
##print("lame no")
for item in data:
if item=='.':
price=price+x
print(price)
``` | vfc_33037 | {
"difficulty": "8",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4\n1 1 10 1\n.\n1 2 10 1\n..\n2 1 10 1\n.\n.\n3 3 3 7\n..*\n*..\n.*.\n",
"output": "10\n1\n20\n18\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1\n3 3 2 4\n**.\n***\n***\n",
"output": "2\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1\n9 9 9 9\n.........\n.........\n.........\n.........\n.........\n.........\n.........\n.........\n.........\n",
"output": "405\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1\n3 3 2 7\n**.\n***\n***\n",
"output": "2\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 1379_D. New Passenger Trams | Solve the following coding problem using the programming language python:
There are many freight trains departing from Kirnes planet every day. One day on that planet consists of h hours, and each hour consists of m minutes, where m is an even number. Currently, there are n freight trains, and they depart every day at the same time: i-th train departs at h_i hours and m_i minutes.
The government decided to add passenger trams as well: they plan to add a regular tram service with half-hour intervals. It means that the first tram of the day must depart at 0 hours and t minutes, where 0 β€ t < {m \over 2}, the second tram departs m \over 2 minutes after the first one and so on. This schedule allows exactly two passenger trams per hour, which is a great improvement.
To allow passengers to board the tram safely, the tram must arrive k minutes before. During the time when passengers are boarding the tram, no freight train can depart from the planet. However, freight trains are allowed to depart at the very moment when the boarding starts, as well as at the moment when the passenger tram departs. Note that, if the first passenger tram departs at 0 hours and t minutes, where t < k, then the freight trains can not depart during the last k - t minutes of the day.
<image> A schematic picture of the correct way to run passenger trams. Here h=2 (therefore, the number of passenger trams is 2h=4), the number of freight trains is n=6. The passenger trams are marked in red (note that the spaces between them are the same). The freight trains are marked in blue. Time segments of length k before each passenger tram are highlighted in red. Note that there are no freight trains inside these segments.
Unfortunately, it might not be possible to satisfy the requirements of the government without canceling some of the freight trains. Please help the government find the optimal value of t to minimize the number of canceled freight trains in case all passenger trams depart according to schedule.
Input
The first line of input contains four integers n, h, m, k (1 β€ n β€ 100 000, 1 β€ h β€ 10^9, 2 β€ m β€ 10^9, m is even, 1 β€ k β€ {m \over 2}) β the number of freight trains per day, the number of hours and minutes on the planet, and the boarding time for each passenger tram.
n lines follow, each contains two integers h_i and m_i (0 β€ h_i < h, 0 β€ m_i < m) β the time when i-th freight train departs. It is guaranteed that no freight trains depart at the same time.
Output
The first line of output should contain two integers: the minimum number of trains that need to be canceled, and the optimal starting time t. Second line of output should contain freight trains that need to be canceled.
Examples
Input
2 24 60 15
16 0
17 15
Output
0 0
Input
2 24 60 16
16 0
17 15
Output
1 0
2
Note
In the first test case of the example the first tram can depart at 0 hours and 0 minutes. Then the freight train at 16 hours and 0 minutes can depart at the same time as the passenger tram, and the freight train at 17 hours and 15 minutes can depart at the same time as the boarding starts for the upcoming passenger tram.
In the second test case of the example it is not possible to design the passenger tram schedule without cancelling any of the freight trains: if t β [1, 15], then the freight train at 16 hours and 0 minutes is not able to depart (since boarding time is 16 minutes). If t = 0 or t β [16, 29], then the freight train departing at 17 hours 15 minutes is not able to depart. However, if the second freight train is canceled, one can choose t = 0. Another possible option is to cancel the first train and choose t = 13.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
from collections import defaultdict
import sys
input=sys.stdin.readline
n,h,m,k=map(int,input().split())
l=[]
a=[]
start=0
for i in range(n):
H,M=map(int,input().split())
M=M%(m//2)
a.append(M)
l.append((M+1,1,i))
l.append(((M+k)%(m//2),-1,i))
if (M+1)>(M+k)%(m//2):
start+=1
l.append((0,0,0))
l.append((m//2-1,0,0))
l.sort()
#print(l)
p=-1
ans=(10000000000,0)
for t,dire,ind in l:
#print(start,t)
if p!=-1 and p!=t:
ans=min(ans,(start,p))
start+=dire
p=t
print(*ans)
time=ans[1]
if ans[0]>0:
for i in range(n):
#print(a[i]+1,(a[i]+k)%(m//2),time)
if (a[i]+1)>(a[i]+k-1)%(m//2):
if time>=a[i]+1 or time<=((a[i]+k-1)%(m//2)):
print(i+1)
else:
if time>=a[i]+1 and time<=((a[i]+k-1)%(m//2)):
print(i+1)
``` | vfc_33041 | {
"difficulty": "10",
"memory_limit": null,
"memory_limit_bytes": 512000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2 24 60 16\n16 0\n17 15\n",
"output": "1 0\n2 ",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2 24 60 15\n16 0\n17 15\n",
"output": "0 0\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "9 3 24 9\n1 15\n0 6\n0 22\n2 22\n2 7\n1 7\n1 23\n2 14\n0 14\n",
"output": "5 7\n1 2 7 8 9 \n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 139_B. Wallpaper | Solve the following coding problem using the programming language python:
Having bought his own apartment, Boris decided to paper the walls in every room. Boris's flat has n rooms, each of which has the form of a rectangular parallelepiped. For every room we known its length, width and height of the walls in meters (different rooms can have different dimensions, including height).
Boris chose m types of wallpaper to paper the walls of the rooms with (but it is not necessary to use all the types). Each type of wallpaper is sold in rolls of a fixed length and width (the length, naturally, shows how long the unfolded roll will be). In addition, for each type we know the price of one roll of this type.
The wallpaper of each type contains strips running along the length of the roll. When gluing the strips must be located strictly vertically (so the roll cannot be rotated, even if the length is less than the width). Besides, a roll can be cut in an arbitrary manner, but the joints of glued pieces should also be vertical. In addition, each room should be papered by only one type of wallpaper. And pieces of the same roll cannot be used to paper different rooms. That is, for each room the rolls are purchased separately. Also, some rolls can be used not completely.
After buying an apartment Boris is short of cash, so he wants to spend the minimum money on wallpaper. Help him.
Input
The first line contains a positive integer n (1 β€ n β€ 500) β the number of rooms in Boris's apartment.
Each of the next n lines contains three space-separated positive integers β the length, width and height of the walls in a given room in meters, respectively.
The next line contains a positive integer m (1 β€ m β€ 500) β the number of available wallpaper types.
Each of the following m lines contains three space-separated positive integers β the length and width in meters of a given wallpaper and the price of one roll, respectively.
All numbers in the input data do not exceed 500. It is guaranteed that each room can be papered using these types of wallpaper.
Output
Print a single number β the minimum total cost of the rolls.
Examples
Input
1
5 5 3
3
10 1 100
15 2 320
3 19 500
Output
640
Note
Note to the sample:
The total length of the walls (the perimeter) of the room is 20 m.
One roll of the first type can be cut into pieces to get three vertical 1 meter wide strips, ergo you need 7 rolls of this type, the price equals 700.
A roll of the second type can be cut into pieces to get five 2 meter wide strips, we need 2 rolls, the price is 640.
One roll of the third type can immediately paper 19 meters out of 20, but we cannot use other types and we have to buy a second roll, the price is 1000.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
#-------------------game starts now----------------------------------------------------
n = int(input())
rooms = []
for _ in range(n):
rooms.append(list(map(int, input().split())))
m = int(input())
wallpapers = []
for _ in range(m):
wallpapers.append(list(map(int, input().split())))
def room_cost(room, wallpapers):
min_cost = 10**18
parimeter = 2 * (room[0] + room[1])
if room[2] == 0:
return 0
for wallpaper in wallpapers:
if wallpaper[1] != 0:
stripes_needed = (parimeter + wallpaper[1] - 1) // wallpaper[1]
stripes_from_one_roll = wallpaper[0] // room[2]
if stripes_from_one_roll == 0:
continue
amount_of_rolls = (stripes_needed + stripes_from_one_roll - 1) // stripes_from_one_roll
min_cost = min([min_cost, amount_of_rolls * wallpaper[2]])
return min_cost
print(sum([room_cost(room, wallpapers) for room in rooms]))
``` | vfc_33045 | {
"difficulty": "8",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "1\n5 5 3\n3\n10 1 100\n15 2 320\n3 19 500\n",
"output": "640\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1\n9 10 7\n1\n7 1 3\n",
"output": "114\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 1423_F. Coins | Solve the following coding problem using the programming language python:
A famous gang of pirates, Sea Dogs, has come back to their hideout from one of their extravagant plunders. They want to split their treasure fairly amongst themselves, that is why You, their trusted financial advisor, devised a game to help them:
All of them take a sit at their round table, some of them with the golden coins they have just stolen. At each iteration of the game if one of them has equal or more than 2 coins, he is eligible to the splitting and he gives one coin to each pirate sitting next to him. If there are more candidates (pirates with equal or more than 2 coins) then You are the one that chooses which one of them will do the splitting in that iteration. The game ends when there are no more candidates eligible to do the splitting.
Pirates can call it a day, only when the game ends. Since they are beings with a finite amount of time at their disposal, they would prefer if the game that they are playing can end after finite iterations, and if so, they call it a good game. On the other hand, if no matter how You do the splitting, the game cannot end in finite iterations, they call it a bad game. Can You help them figure out before they start playing if the game will be good or bad?
Input
The first line of input contains two integer numbers n and k (1 β€ n β€ 10^{9}, 0 β€ k β€ 2β
10^5), where n denotes total number of pirates and k is the number of pirates that have any coins.
The next k lines of input contain integers a_i and b_i (1 β€ a_i β€ n, 1 β€ b_i β€ 10^{9}), where a_i denotes the index of the pirate sitting at the round table (n and 1 are neighbours) and b_i the total number of coins that pirate a_i has at the start of the game.
Output
Print 1 if the game is a good game: There is a way to do the splitting so the game ends after finite number of iterations.
Print -1 if the game is a bad game: No matter how You do the splitting the game does not end in finite number of iterations.
Examples
Input
4 2
1 2
2 2
Output
1
Input
6 2
2 3
4 1
Output
1
Input
3 2
1 1
2 2
Output
-1
Note
In the third example the game has no end, because You always only have only one candidate, after whose splitting you end up in the same position as the starting one.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
def main():
n, k = [int(x) for x in input().split()]
p, s = 0, 0
for _ in range(k):
a, b = [int(x) for x in input().split()]
s += b
p += a * b
p %= n
print(['-1', '1'][s < n or (s == n and p == (n * (n + 1) // 2) % n)])
main()
``` | vfc_33049 | {
"difficulty": "12",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4 2\n1 2\n2 2\n",
"output": "1",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 1493_A. Anti-knapsack | Solve the following coding problem using the programming language python:
You are given two integers n and k. You are asked to choose maximum number of distinct integers from 1 to n so that there is no subset of chosen numbers with sum equal to k.
A subset of a set is a set that can be obtained from initial one by removing some (possibly all or none) elements of it.
Input
The first line contains the number of test cases T (1 β€ T β€ 100).
Each of the next T lines contains two integers n and k (1 β€ k β€ n β€ 1000) β the description of test cases.
Output
For each test case output two lines. In the first line output a single integer m β the number of chosen integers.
In the second line output m distinct integers from 1 to n β the chosen numbers.
If there are multiple answers, print any. You can print the numbers in any order.
Example
Input
3
3 2
5 3
1 1
Output
2
3 1
3
4 5 2
0
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
t=int(input())
for i in range(t):
n,k = map(int,input().split())
ans=[]
if n==1 and k==1:
print(0)
continue
else:
if k%2==0:
for j in range(k//2,k):
ans.append(j)
for j in range(k+1,n+1):
ans.append(j)
else:
for j in range(k//2+1,k):
ans.append(j)
for j in range(k+1,n+1):
ans.append(j)
print(len(ans))
print(*ans)
``` | vfc_33061 | {
"difficulty": "7",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3\n3 2\n5 3\n1 1\n",
"output": "\n2\n3 1 \n3\n4 5 2 \n0\n\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "70\n1 1\n2 1\n2 2\n3 1\n3 2\n3 3\n4 1\n4 2\n4 3\n4 4\n5 1\n5 2\n5 3\n5 4\n5 5\n6 1\n6 2\n6 3\n6 4\n6 5\n6 6\n7 1\n7 2\n7 3\n7 4\n7 5\n7 6\n7 7\n8 1\n8 2\n8 3\n8 4\n8 5\n8 6\n8 7\n8 8\n9 1\n9 2\n9 3\n9 4\n9 5\n9 6\n9 7\n9 8\n9 9\n10 1\n10 2\n10 3\n10 4\n10 5\n10 6\n10 7\n10 8\n10 9\n10 10\n15 1\n15 2\n15 3\n15 4\n15 5\n15 6\n15 7\n15 8\n15 9\n15 10\n15 11\n15 12\n15 13\n15 14\n15 15\n",
"output": "0\n\n1\n2 \n1\n1 \n2\n2 3 \n2\n3 1 \n1\n2 \n3\n2 3 4 \n3\n3 4 1 \n2\n4 2 \n2\n2 3 \n4\n2 3 4 5 \n4\n3 4 5 1 \n3\n4 5 2 \n3\n5 2 3 \n2\n3 4 \n5\n2 3 4 5 6 \n5\n3 4 5 6 1 \n4\n4 5 6 2 \n4\n5 6 2 3 \n3\n6 3 4 \n3\n3 4 5 \n6\n2 3 4 5 6 7 \n6\n3 4 5 6 7 1 \n5\n4 5 6 7 2 \n5\n5 6 7 2 3 \n4\n6 7 3 4 \n4\n7 3 4 5 \n3\n4 5 6 \n7\n2 3 4 5 6 7 8 \n7\n3 4 5 6 7 8 1 \n6\n4 5 6 7 8 2 \n6\n5 6 7 8 2 3 \n5\n6 7 8 3 4 \n5\n7 8 3 4 5 \n4\n8 4 5 6 \n4\n4 5 6 7 \n8\n2 3 4 5 6 7 8 9 \n8\n3 4 5 6 7 8 9 1 \n7\n4 5 6 7 8 9 2 \n7\r...",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "70\n1 1\n2 1\n2 2\n3 1\n3 2\n3 3\n4 1\n4 2\n4 3\n4 4\n9 1\n5 2\n5 3\n5 4\n5 5\n6 1\n6 2\n6 3\n6 4\n6 5\n6 6\n7 1\n7 2\n7 3\n7 4\n7 5\n7 6\n7 7\n8 1\n8 2\n8 3\n8 4\n8 5\n8 6\n8 7\n8 8\n9 1\n9 2\n9 3\n9 4\n9 5\n9 6\n9 7\n9 8\n9 9\n10 1\n10 2\n10 3\n10 4\n10 5\n10 6\n10 7\n10 8\n10 9\n10 10\n15 1\n15 2\n15 3\n15 4\n15 5\n15 6\n15 7\n15 8\n15 9\n15 10\n15 11\n15 12\n15 13\n15 14\n15 15\n",
"output": "0\n\n1\n2\n1\n1\n2\n2 3\n2\n1 3\n1\n2\n3\n2 3 4\n3\n1 3 4\n2\n2 4\n2\n2 3\n8\n2 3 4 5 6 7 8 9\n4\n1 3 4 5\n3\n2 4 5\n3\n2 3 5\n2\n3 4\n5\n2 3 4 5 6\n5\n1 3 4 5 6\n4\n2 4 5 6\n4\n2 3 5 6\n3\n3 4 6\n3\n3 4 5\n6\n2 3 4 5 6 7\n6\n1 3 4 5 6 7\n5\n2 4 5 6 7\n5\n2 3 5 6 7\n4\n3 4 6 7\n4\n3 4 5 7\n3\n4 5 6\n7\n2 3 4 5 6 7 8\n7\n1 3 4 5 6 7 8\n6\n2 4 5 6 7 8\n6\n2 3 5 6 7 8\n5\n3 4 6 7 8\n5\n3 4 5 7 8\n4\n4 5 6 8\n4\n4 5 6 7\n8\n2 3 4 5 6 7 8 9\n8\n1 3 4 5 6 7 8 9\n7\n2 4 5 6 7 8 9\n7\n2 3 5 6 7 8 9\n6\n3 4 6 7 8 9\n6\n3 4 5 7 8 9\n5\n4 5 6 8 9\n5\n4 5 6 7 9\n4\n5 6 7 8\n9\n2 3 4 5 6 7 8 9 10\n9\n1 3 4 5 6 7 8 9 10\n8\n2 4 5 6 7 8 9 10\n8\n2 3 5 6 7 8 9 10\n7\n3 4 6 7 8 9 10\n7\n3 4 5 7 8 9 10\n6\n4 5 6 8 9 10\n6\n4 5 6 7 9 10\n5\n5 6 7 8 10\n5\n5 6 7 8 9\n14\n2 3 4 5 6 7 8 9 10 11 12 13 14 15\n14\n1 3 4 5 6 7 8 9 10 11 12 13 14 15\n13\n2 4 5 6 7 8 9 10 11 12 13 14 15\n13\n2 3 5 6 7 8 9 10 11 12 13 14 15\n12\n3 4 6 7 8 9 10 11 12 13 14 15\n12\n3 4 5 7 8 9 10 11 12 13 14 15\n11\n4 5 6 8 9 10 11 12 13 14 15\n11\n4 5 6 7 9 10 11 12 13 14 15\n10\n5 6 7 8 10 11 12 13 14 15\n10\n5 6 7 8 9 11 12 13 14 15\n9\n6 7 8 9 10 12 13 14 15\n9\n6 7 8 9 10 11 13 14 15\n8\n7 8 9 10 11 12 14 15\n8\n7 8 9 10 11 12 13 15\n7\n8 9 10 11 12 13 14\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n3 2\n5 4\n1 1\n",
"output": "2\n1 3\n3\n2 3 5\n0\n\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 1515_G. Phoenix and Odometers | Solve the following coding problem using the programming language python:
In Fire City, there are n intersections and m one-way roads. The i-th road goes from intersection a_i to b_i and has length l_i miles.
There are q cars that may only drive along those roads. The i-th car starts at intersection v_i and has an odometer that begins at s_i, increments for each mile driven, and resets to 0 whenever it reaches t_i. Phoenix has been tasked to drive cars along some roads (possibly none) and return them to their initial intersection with the odometer showing 0.
For each car, please find if this is possible.
A car may visit the same road or intersection an arbitrary number of times. The odometers don't stop counting the distance after resetting, so odometers may also be reset an arbitrary number of times.
Input
The first line of the input contains two integers n and m (2 β€ n β€ 2 β
10^5; 1 β€ m β€ 2 β
10^5) β the number of intersections and the number of roads, respectively.
Each of the next m lines contain three integers a_i, b_i, and l_i (1 β€ a_i, b_i β€ n; a_i β b_i; 1 β€ l_i β€ 10^9) β the information about the i-th road. The graph is not necessarily connected. It is guaranteed that between any two intersections, there is at most one road for each direction.
The next line contains an integer q (1 β€ q β€ 2 β
10^5) β the number of cars.
Each of the next q lines contains three integers v_i, s_i, and t_i (1 β€ v_i β€ n; 0 β€ s_i < t_i β€ 10^9) β the initial intersection of the i-th car, the initial number on the i-th odometer, and the number at which the i-th odometer resets, respectively.
Output
Print q answers. If the i-th car's odometer may be reset to 0 by driving through some roads (possibly none) and returning to its starting intersection v_i, print YES. Otherwise, print NO.
Examples
Input
4 4
1 2 1
2 3 1
3 1 2
1 4 3
3
1 1 3
1 2 4
4 0 1
Output
YES
NO
YES
Input
4 5
1 2 1
2 3 1
3 1 2
1 4 1
4 3 2
2
1 2 4
4 3 5
Output
YES
YES
Note
The illustration for the first example is below:
<image>
In the first query, Phoenix can drive through the following cities: 1 β 2 β 3 β 1 β 2 β 3 β 1. The odometer will have reset 3 times, but it displays 0 at the end.
In the second query, we can show that there is no way to reset the odometer to 0 and return to intersection 1.
In the third query, the odometer already displays 0, so there is no need to drive through any roads.
Below is the illustration for the second example:
<image>
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
import sys
from sys import stdin
import math
from collections import deque
import sys
class scc_graph:
def __init__(self, N):
self.N = N
self.edges = []
def csr(self):
self.start = [0]*(self.N+1)
self.elist = [0]*len(self.edges)
for e in self.edges:
self.start[e[0]+1] += 1
for i in range(1, self.N+1):
self.start[i] += self.start[i-1]
counter = self.start[:]
for e in self.edges:
self.elist[counter[e[0]]] = e[1]
counter[e[0]] += 1
def add_edge(self, v, w):
self.edges.append((v, w))
def scc_ids(self):
self.csr()
N = self.N
now_ord = group_num = 0
visited = []
low = [0]*N
order = [-1]*N
ids = [0]*N
parent = [-1]*N
stack = []
for i in range(N):
if order[i] == -1:
stack.append(i)
stack.append(i)
while stack:
v = stack.pop()
if order[v] == -1:
low[v] = order[v] = now_ord
now_ord += 1
visited.append(v)
for i in range(self.start[v], self.start[v+1]):
to = self.elist[i]
if order[to] == -1:
stack.append(to)
stack.append(to)
parent[to] = v
else:
low[v] = min(low[v], order[to])
else:
if low[v] == order[v]:
while True:
u = visited.pop()
order[u] = N
ids[u] = group_num
if u == v:
break
group_num += 1
if parent[v] != -1:
low[parent[v]] = min(low[parent[v]], low[v])
for i, x in enumerate(ids):
ids[i] = group_num-1-x
return group_num, ids
def scc(self):
group_num, ids = self.scc_ids()
groups = [[] for _ in range(group_num)]
for i, x in enumerate(ids):
groups[x].append(i)
return groups
"""
def SCC(N,M,elis):
lis = [ [] for i in range(N) ]
rlis = [ [] for i in range(N)]
for u,v in elis:
lis[u].append(v)
rlis[v].append(u)
stk = []
nind = [0] * N
visit = [False] * N
leave = [None] * N
nl = 0
for loop in range(N):
if visit[loop] == False:
visit[loop] = True
stk.append(loop)
while stk:
if nind[stk[-1]] >= len(lis[stk[-1]]):
leave[stk[-1]] = nl
nl += 1
del stk[-1]
else:
nexv = lis[stk[-1]][nind[stk[-1]]]
nind[stk[-1]] += 1
if not visit[nexv]:
stk.append(nexv)
visit[nexv] = True
visit = [False] * N
mv = [ (leave[i],i) for i in range(N) ]
mv.sort()
ret = []
while mv:
tmp,v = mv[-1]
del mv[-1]
if not visit[v]:
visit[v] = True
q = [v]
nlinks = []
while q:
x = q[-1]
del q[-1]
nlinks.append(x)
for nex in rlis[x]:
if not visit[nex]:
visit[nex] = True
q.append(nex)
ret.append(nlinks)
return ret
"""
n,m = map(int,stdin.readline().split())
N = n
sg = scc_graph(n)
lis = [ [] for i in range(n)]
elis = []
for i in range(m):
a,b,l = map(int,stdin.readline().split())
a -= 1
b -= 1
lis[a].append((b,l))
sg.add_edge(a,b)
SC = sg.scc()
sclis = [None] * N
for i in range(len(SC)):
for j in SC[i]:
sclis[j] = i
scgcd = [None] * len(SC)
d = [None] * N
for i in range(N):
if scgcd[sclis[i]] == None:
ngcd = float("inf")
q = deque([i])
d[i] = 0
while q:
v = q.popleft()
for nex,l in lis[v]:
if sclis[nex] == sclis[v]:
if d[nex] == None:
d[nex] = d[v] + l
q.append(nex)
elif abs(d[nex]-d[v]-l) != 0:
if ngcd == float("inf"):
ngcd = abs(d[nex] - d[v]-l)
else:
ngcd = math.gcd(ngcd,abs(d[nex]-d[v]-l))
scgcd[sclis[i]] = ngcd
q = int(stdin.readline())
ANS = []
#print (SC)
#print (scgcd)
for loop in range(q):
vi,si,ti = map(int,stdin.readline().split())
vi -= 1
if scgcd[sclis[vi]] == float("inf"):
if si == 0:
ANS.append("YES")
else:
ANS.append("NO")
else:
if ((-1*si) % ti) % math.gcd(scgcd[sclis[vi]] , ti) == 0:
ANS.append("YES")
else:
ANS.append("NO")
print ("\n".join(ANS))
``` | vfc_33065 | {
"difficulty": "13",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4 5\n1 2 1\n2 3 1\n3 1 2\n1 4 1\n4 3 2\n2\n1 2 4\n4 3 5\n",
"output": "\nYES\nYES\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4 4\n1 2 1\n2 3 1\n3 1 2\n1 4 3\n3\n1 1 3\n1 2 4\n4 0 1\n",
"output": "\nYES\nNO\nYES\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2 1\n2 1 1\n1\n2 1 2\n",
"output": "NO\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 171_A. Mysterious numbers - 1 | Solve the following coding problem using the programming language python:
Input
The input contains two integers a1, a2 (0 β€ ai β€ 109), separated by a single space.
Output
Output a single integer.
Examples
Input
3 14
Output
44
Input
27 12
Output
48
Input
100 200
Output
102
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
from math import floor
x, y = input().split()
x = int(x)
y = int(y)
rev = 0
while y > 0:
a = int(y % 10)
rev = rev * 10 + a
y = floor(y / 10)
b = x + rev
print(b)
``` | vfc_33073 | {
"difficulty": "7",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "27 12\n",
"output": "48\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 14\n",
"output": "44\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "100 200\n",
"output": "102\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 190_D. Non-Secret Cypher | Solve the following coding problem using the programming language python:
Berland starts to seize the initiative on the war with Flatland. To drive the enemy from their native land, the berlanders need to know exactly how many more flatland soldiers are left in the enemy's reserve. Fortunately, the scouts captured an enemy in the morning, who had a secret encrypted message with the information the berlanders needed so much.
The captured enemy had an array of positive integers. Berland intelligence have long been aware of the flatland code: to convey the message, which contained a number m, the enemies use an array of integers a. The number of its subarrays, in which there are at least k equal numbers, equals m. The number k has long been known in the Berland army so General Touristov has once again asked Corporal Vasya to perform a simple task: to decipher the flatlanders' message.
Help Vasya, given an array of integers a and number k, find the number of subarrays of the array of numbers a, which has at least k equal numbers.
Subarray a[i... j] (1 β€ i β€ j β€ n) of array a = (a1, a2, ..., an) is an array, made from its consecutive elements, starting from the i-th one and ending with the j-th one: a[i... j] = (ai, ai + 1, ..., aj).
Input
The first line contains two space-separated integers n, k (1 β€ k β€ n β€ 4Β·105), showing how many numbers an array has and how many equal numbers the subarrays are required to have, correspondingly.
The second line contains n space-separated integers ai (1 β€ ai β€ 109) β elements of the array.
Output
Print the single number β the number of such subarrays of array a, that they have at least k equal integers.
Please do not use the %lld specifier to read or write 64-bit integers in Π‘++. In is preferred to use the cin, cout streams or the %I64d specifier.
Examples
Input
4 2
1 2 1 2
Output
3
Input
5 3
1 2 1 1 3
Output
2
Input
3 1
1 1 1
Output
6
Note
In the first sample are three subarrays, containing at least two equal numbers: (1,2,1), (2,1,2) and (1,2,1,2).
In the second sample are two subarrays, containing three equal numbers: (1,2,1,1,3) and (1,2,1,1).
In the third sample any subarray contains at least one 1 number. Overall they are 6: (1), (1), (1), (1,1), (1,1) and (1,1,1).
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
def answer():
ans,count,j=0,0,0
d=dict()
for i in range(n):
while(j==0 or d[a[j-1]] < k):
if(j==n):
j+=1
break
try:d[a[j]]+=1
except:d[a[j]]=1
count += 1
m=n-count+1
j+=1
if(j > n):break
ans+=m
d[a[i]] -= 1
return ans
n,k=map(int,input().split())
a=list(map(int,input().split()))
print(answer())
``` | vfc_33077 | {
"difficulty": "10",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 3, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "5 3\n1 2 1 1 3\n",
"output": " 2\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4 2\n1 2 1 2\n",
"output": " 3\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 1\n1 1 1\n",
"output": " 6\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 263_B. Squares | Solve the following coding problem using the programming language python:
Vasya has found a piece of paper with a coordinate system written on it. There are n distinct squares drawn in this coordinate system. Let's number the squares with integers from 1 to n. It turned out that points with coordinates (0, 0) and (ai, ai) are the opposite corners of the i-th square.
Vasya wants to find such integer point (with integer coordinates) of the plane, that belongs to exactly k drawn squares. We'll say that a point belongs to a square, if the point is located either inside the square, or on its boundary.
Help Vasya find a point that would meet the described limits.
Input
The first line contains two space-separated integers n, k (1 β€ n, k β€ 50). The second line contains space-separated integers a1, a2, ..., an (1 β€ ai β€ 109).
It is guaranteed that all given squares are distinct.
Output
In a single line print two space-separated integers x and y (0 β€ x, y β€ 109) β the coordinates of the point that belongs to exactly k squares. If there are multiple answers, you are allowed to print any of them.
If there is no answer, print "-1" (without the quotes).
Examples
Input
4 3
5 1 3 4
Output
2 1
Input
3 1
2 4 1
Output
4 0
Input
4 50
5 1 10 2
Output
-1
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
def ans(k,a):
a.sort()
if(k>len(a)):
return "-1"
else:
if(k!=0):
return a[len(a)-k]
n,k=map(int,input().split(" "))
arr=list(map(int,input().split(" ")))
if (ans(k,arr)=="-1"):
print("-1")
else:
print(ans(k,arr)," ",ans(k,arr))
``` | vfc_33089 | {
"difficulty": "8",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3 1\n2 4 1\n",
"output": "4 4\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4 3\n5 1 3 4\n",
"output": "3 3\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4 50\n5 1 10 2\n",
"output": "-1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "20 17\n407 2799 2032 2154 8119 9404 6718 7914 916 4720 1267 9403 5497 4518 9072 7828 8364 8230 3057 7770\n",
"output": "2032 2032\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 287_B. Pipeline | Solve the following coding problem using the programming language python:
Vova, the Ultimate Thule new shaman, wants to build a pipeline. As there are exactly n houses in Ultimate Thule, Vova wants the city to have exactly n pipes, each such pipe should be connected to the water supply. A pipe can be connected to the water supply if there's water flowing out of it. Initially Vova has only one pipe with flowing water. Besides, Vova has several splitters.
A splitter is a construction that consists of one input (it can be connected to a water pipe) and x output pipes. When a splitter is connected to a water pipe, water flows from each output pipe. You can assume that the output pipes are ordinary pipes. For example, you can connect water supply to such pipe if there's water flowing out from it. At most one splitter can be connected to any water pipe.
<image> The figure shows a 4-output splitter
Vova has one splitter of each kind: with 2, 3, 4, ..., k outputs. Help Vova use the minimum number of splitters to build the required pipeline or otherwise state that it's impossible.
Vova needs the pipeline to have exactly n pipes with flowing out water. Note that some of those pipes can be the output pipes of the splitters.
Input
The first line contains two space-separated integers n and k (1 β€ n β€ 1018, 2 β€ k β€ 109).
Please, do not use the %lld specifier to read or write 64-bit integers in Π‘++. It is preferred to use the cin, cout streams or the %I64d specifier.
Output
Print a single integer β the minimum number of splitters needed to build the pipeline. If it is impossible to build a pipeline with the given splitters, print -1.
Examples
Input
4 3
Output
2
Input
5 5
Output
1
Input
8 4
Output
-1
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
n, k = map(int, input().split())
def prod(n):
if n%2:
return n*((n+1)//2)
else:
return (n//2)*(n+1)
def total_count(n, k):
if k >= n:
return (0, 0, 1)
else:
count = 0
l = 1; r = k
s = prod(k)
while l <= r:
mid = (l+r)//2
if n > s - prod(mid) + mid:
r = mid-1
else:
l = mid+1
n = n - (s - prod(l) + l)
count += (k-l+1)
k = l-1
return (n, k, count)
if prod(k) - (k-1) < n:
print(-1)
elif n == 1:
print(0)
elif k >= n:
print(1)
else:
n = n-k
k = k-2
count = 1
while n > 0:
(n, k, temp) = total_count(n, k)
count += temp
print(count)
``` | vfc_33093 | {
"difficulty": "8",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 0, 'nanos': 400000000}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4 3\n",
"output": "2\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "8 4\n",
"output": "-1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5 5\n",
"output": "1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1000000000000000000 1000000000\n",
"output": "-1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "525 34\n",
"output": "25\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1000000000 999999999\n",
"output": "2\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 334_E. Lucky Tickets | Solve the following coding problem using the programming language python:
Gerald has a friend, Pollard. Pollard is interested in lucky tickets (ticket is a sequence of digits). At first he thought that a ticket is lucky if between some its digits we can add arithmetic signs and brackets so that the result obtained by the arithmetic expression was number 100. But he quickly analyzed all such tickets and moved on to a more general question. Now he explores k-lucky tickets.
Pollard sais that a ticket is k-lucky if we can add arithmetic operation signs between its digits to the left or right of them (i.e., "+", "-", " Γ ") and brackets so as to obtain the correct arithmetic expression whose value would equal k. For example, ticket "224201016" is 1000-lucky as ( - 2 - (2 + 4)) Γ (2 + 0) + 1016 = 1000.
Pollard was so carried away by the lucky tickets that he signed up for a seminar on lucky tickets and, as far as Gerald knows, Pollard will attend it daily at 7 pm in some famous institute and will commute to it in the same tram for m days. In this tram tickets have eight digits. And Gerald wants to make a surprise for Pollard: each day Pollard will receive a tram k-lucky ticket. The conductor has already agreed to give Pollard certain tickets during all these m days and he only wants Gerald to tell him what kind of tickets to give out. In this regard, help Gerald pick exactly m distinct k-lucky tickets.
Input
The single line contains two integers k and m (0 β€ k β€ 104, 1 β€ m β€ 3Β·105).
Output
Print m lines. Each line must contain exactly 8 digits β the k-winning ticket. The tickets may begin with 0, all tickets must be distinct. If there are more than m distinct k-lucky tickets, print any m of them. It is guaranteed that at least m distinct k-lucky tickets exist. The tickets can be printed in any order.
Examples
Input
0 3
Output
00000000
00000001
00000002
Input
7 4
Output
00000007
00000016
00000017
00000018
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | vfc_33101 | {
"difficulty": "11",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 6, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "7 4\n",
"output": "00000007\n00010006\n00060001\n00070000\n",
"type": "stdin_stdout"
}
]
} |
|
code_contests | verifiable_code | 357_E. Compartments | Solve the following coding problem using the programming language python:
A team of students from the city S is sent to the All-Berland Olympiad in Informatics. Traditionally, they go on the train. All students have bought tickets in one carriage, consisting of n compartments (each compartment has exactly four people). We know that if one compartment contain one or two students, then they get bored, and if one compartment contain three or four students, then the compartment has fun throughout the entire trip.
The students want to swap with other people, so that no compartment with students had bored students. To swap places with another person, you need to convince him that it is really necessary. The students can not independently find the necessary arguments, so they asked a sympathetic conductor for help. The conductor can use her life experience to persuade any passenger to switch places with some student.
However, the conductor does not want to waste time persuading the wrong people, so she wants to know what is the minimum number of people necessary to persuade her to change places with the students. Your task is to find the number.
After all the swaps each compartment should either have no student left, or have a company of three or four students.
Input
The first line contains integer n (1 β€ n β€ 106) β the number of compartments in the carriage. The second line contains n integers a1, a2, ..., an showing how many students ride in each compartment (0 β€ ai β€ 4). It is guaranteed that at least one student is riding in the train.
Output
If no sequence of swapping seats with other people leads to the desired result, print number "-1" (without the quotes). In another case, print the smallest number of people you need to persuade to swap places.
Examples
Input
5
1 2 2 4 3
Output
2
Input
3
4 1 1
Output
2
Input
4
0 3 0 4
Output
0
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
n = int(raw_input())
A = map(int, raw_input().split())
C = [0]*5
for a in A:
C[a] += 1
cost = 0
t = min(C[1], C[2])
cost += t
C[1] -= t
C[2] -= t
C[3] += t
if C[2] != 0: # C[1] == 0
t = C[2]/3
cost += 2*t
C[2] -= 3*t
C[3] += 2*t
if C[2] == 1:
if C[4] > 0:
cost += 1
elif C[3] > 1:
cost += 2
else:
cost = -1
elif C[2] == 2:
cost += 2
else: # C[2] == 0
t = C[1]/3
cost += 2*t
C[1] -= 3*t
C[3] += t
if C[1] == 1:
if C[3] > 0:
cost += 1
elif C[4] > 1:
cost += 2
else:
cost = -1
elif C[1] == 2:
if C[4] > 0:
cost += 2
elif C[3] > 1:
cost += 2
else:
cost = -1
print cost
``` | vfc_33105 | {
"difficulty": "11",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "5\n1 2 2 4 3\n",
"output": "2",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n4 1 1\n",
"output": "2",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4\n0 3 0 4\n",
"output": "0",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "165\n1 1 1 1 1 1 1 1 0 2 2 2 1 1 1 1 1 4 4 1 1 2 2 1 2 1 2 2 2 1 2 2 3 1 1 2 1 1 2 2 4 1 2 2 2 4 1 1 1 4 2 2 1 1 1 1 1 2 1 1 1 2 1 1 1 1 4 2 2 1 1 1 1 2 1 1 1 1 2 2 1 1 2 1 1 1 1 2 2 1 2 1 2 1 2 2 1 2 2 1 1 1 2 1 4 2 2 2 1 1 1 1 2 3 2 1 2 1 1 2 1 1 1 1 1 2 1 2 1 1 0 1 2 1 1 1 1 1 3 1 2 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 2 3 4 1 1 1\n",
"output": "84",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "20\n4 1 1 1 4 2 3 3 2 1 1 4 4 3 1 1 2 4 2 3\n",
"output": "6",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 401_C. Team | Solve the following coding problem using the programming language python:
Now it's time of Olympiads. Vanya and Egor decided to make his own team to take part in a programming Olympiad. They've been best friends ever since primary school and hopefully, that can somehow help them in teamwork.
For each team Olympiad, Vanya takes his play cards with numbers. He takes only the cards containing numbers 1 and 0. The boys are very superstitious. They think that they can do well at the Olympiad if they begin with laying all the cards in a row so that:
* there wouldn't be a pair of any side-adjacent cards with zeroes in a row;
* there wouldn't be a group of three consecutive cards containing numbers one.
Today Vanya brought n cards with zeroes and m cards with numbers one. The number of cards was so much that the friends do not know how to put all those cards in the described way. Help them find the required arrangement of the cards or else tell the guys that it is impossible to arrange cards in such a way.
Input
The first line contains two integers: n (1 β€ n β€ 106) β the number of cards containing number 0; m (1 β€ m β€ 106) β the number of cards containing number 1.
Output
In a single line print the required sequence of zeroes and ones without any spaces. If such sequence is impossible to obtain, print -1.
Examples
Input
1 2
Output
101
Input
4 8
Output
110110110101
Input
4 10
Output
11011011011011
Input
1 5
Output
-1
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
mod = 1000000007
ii = lambda : int(input())
si = lambda : input()
dgl = lambda : list(map(int, input()))
f = lambda : map(int, input().split())
il = lambda : list(map(int, input().split()))
ls = lambda : list(input())
n0, n1 = f()
s='0'*(n0+n1)
if n1<n0-1:
print(-1)
elif n1==n0-1 or n1==n0:
s=s.replace('0','01')
print(s[:(n0+n1)])
elif n1==n0+1:
s=s.replace('0','10')
print(s[:(n0+n1)])
elif n1>n0+1 and n1<=2*(n0+1):
s=s.replace('0','10')
s=s[:(2*n0+1)]
s=s.replace('1','11',(n1-n0-1))
print(s[:(n0+n1)])
else:
print(-1)
``` | vfc_33113 | {
"difficulty": "9",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4 8\n",
"output": "110110110110\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1 5\n",
"output": "-1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1 2\n",
"output": "110\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4 10\n",
"output": "11011011011011\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 429_D. Tricky Function | Solve the following coding problem using the programming language python:
Iahub and Sorin are the best competitive programmers in their town. However, they can't both qualify to an important contest. The selection will be made with the help of a single problem. Blatnatalag, a friend of Iahub, managed to get hold of the problem before the contest. Because he wants to make sure Iahub will be the one qualified, he tells Iahub the following task.
You're given an (1-based) array a with n elements. Let's define function f(i, j) (1 β€ i, j β€ n) as (i - j)2 + g(i, j)2. Function g is calculated by the following pseudo-code:
int g(int i, int j) {
int sum = 0;
for (int k = min(i, j) + 1; k <= max(i, j); k = k + 1)
sum = sum + a[k];
return sum;
}
Find a value mini β j f(i, j).
Probably by now Iahub already figured out the solution to this problem. Can you?
Input
The first line of input contains a single integer n (2 β€ n β€ 100000). Next line contains n integers a[1], a[2], ..., a[n] ( - 104 β€ a[i] β€ 104).
Output
Output a single integer β the value of mini β j f(i, j).
Examples
Input
4
1 0 0 -1
Output
1
Input
2
1 -1
Output
2
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
import os
import math
cumsum = [int(x) for x in os.read(0, os.fstat(0).st_size).split()]
n = cumsum[0]
cumsum[0] = 0
for i in range(n):
cumsum[i+1] += cumsum[i]
def work(besta, i, sqrtbesta, lowerbound, upperbound, cumsumi):
for j in range(i+1, min(n, i - 1 + sqrtbesta) + 1):
if lowerbound < cumsum[j] < upperbound and (j-i)**2 + (cumsum[j] - cumsumi)**2 < besta:
besta = (j-i)**2 + (cumsum[j] - cumsumi)**2
return besta
besta = 10100**2
for i in range(1, n):
sqrtbesta = int(math.sqrt(besta)) + 1
lowerbound = -sqrtbesta + cumsum[i]
upperbound = sqrtbesta + cumsum[i]
besta = work(besta, i, sqrtbesta, lowerbound, upperbound, cumsum[i])
print(besta)
``` | vfc_33117 | {
"difficulty": "10",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4\n1 0 0 -1\n",
"output": "1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n1 -1\n",
"output": "2\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n10 11 12 13 -40\n",
"output": "32\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n0 2 3\n",
"output": "5\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n0 4 10 -5 -5\n",
"output": "9\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 451_B. Sort the Array | Solve the following coding problem using the programming language python:
Being a programmer, you like arrays a lot. For your birthday, your friends have given you an array a consisting of n distinct integers.
Unfortunately, the size of a is too small. You want a bigger array! Your friends agree to give you a bigger array, but only if you are able to answer the following question correctly: is it possible to sort the array a (in increasing order) by reversing exactly one segment of a? See definitions of segment and reversing in the notes.
Input
The first line of the input contains an integer n (1 β€ n β€ 105) β the size of array a.
The second line contains n distinct space-separated integers: a[1], a[2], ..., a[n] (1 β€ a[i] β€ 109).
Output
Print "yes" or "no" (without quotes), depending on the answer.
If your answer is "yes", then also print two space-separated integers denoting start and end (start must not be greater than end) indices of the segment to be reversed. If there are multiple ways of selecting these indices, print any of them.
Examples
Input
3
3 2 1
Output
yes
1 3
Input
4
2 1 3 4
Output
yes
1 2
Input
4
3 1 2 4
Output
no
Input
2
1 2
Output
yes
1 1
Note
Sample 1. You can reverse the entire array to get [1, 2, 3], which is sorted.
Sample 3. No segment can be reversed such that the array will be sorted.
Definitions
A segment [l, r] of array a is the sequence a[l], a[l + 1], ..., a[r].
If you have an array a of size n and you reverse its segment [l, r], the array will become:
a[1], a[2], ..., a[l - 2], a[l - 1], a[r], a[r - 1], ..., a[l + 1], a[l], a[r + 1], a[r + 2], ..., a[n - 1], a[n].
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
# coding=utf-8
if __name__ == '__main__':
n = int(input())
line = str(input()).split()
line = [int(it) for it in line]
temp_line = line.copy()
temp_line.sort()
ptr_head = 0
ptr_tail = n - 1
while line[ptr_head] == temp_line[ptr_head]:
if ptr_head == ptr_tail:
break
ptr_head += 1
while line[ptr_tail] == temp_line[ptr_tail]:
if ptr_head == ptr_tail:
break
ptr_tail -= 1
flag = False
for i in range(ptr_head, ptr_tail + 1):
if line[i] != temp_line[ptr_tail - (i - ptr_head)]:
flag = True
break
if flag:
print('no')
else:
print('yes')
print(str(ptr_head + 1) + ' ' + str(ptr_tail + 1))
``` | vfc_33121 | {
"difficulty": "8",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2\n1 2\n",
"output": "yes\n1 1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4\n2 1 3 4\n",
"output": "yes\n1 2\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4\n3 1 2 4\n",
"output": "no\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 474_A. Keyboard | Solve the following coding problem using the programming language python:
Our good friend Mole is trying to code a big message. He is typing on an unusual keyboard with characters arranged in following way:
qwertyuiop
asdfghjkl;
zxcvbnm,./
Unfortunately Mole is blind, so sometimes it is problem for him to put his hands accurately. He accidentally moved both his hands with one position to the left or to the right. That means that now he presses not a button he wants, but one neighboring button (left or right, as specified in input).
We have a sequence of characters he has typed and we want to find the original message.
Input
First line of the input contains one letter describing direction of shifting ('L' or 'R' respectively for left or right).
Second line contains a sequence of characters written by Mole. The size of this sequence will be no more than 100. Sequence contains only symbols that appear on Mole's keyboard. It doesn't contain spaces as there is no space on Mole's keyboard.
It is guaranteed that even though Mole hands are moved, he is still pressing buttons on keyboard and not hitting outside it.
Output
Print a line that contains the original message.
Examples
Input
R
s;;upimrrfod;pbr
Output
allyouneedislove
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
move=input()
ans=""
s=input()
keyboard=["qwertyuiop","asdfghjkl;","zxcvbnm,./"]
if move =="R":
for i in range(len(s)):
for j in range(len(keyboard)):
if s[i] in keyboard[j]:
ans+=keyboard[j][keyboard[j].index(s[i])-1]
elif move =="L":
for i in range(len(s)):
for j in range(len(keyboard)):
if s[i] in keyboard[j]:
ans+=keyboard[j][keyboard[j].index(s[i])+1]
print(ans)
``` | vfc_33125 | {
"difficulty": "7",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "R\ns;;upimrrfod;pbr\n",
"output": "allyouneedislove\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "R\nwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww\n",
"output": "qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 521_A. DNA Alignment | Solve the following coding problem using the programming language python:
Vasya became interested in bioinformatics. He's going to write an article about similar cyclic DNA sequences, so he invented a new method for determining the similarity of cyclic sequences.
Let's assume that strings s and t have the same length n, then the function h(s, t) is defined as the number of positions in which the respective symbols of s and t are the same. Function h(s, t) can be used to define the function of Vasya distance Ο(s, t):
<image> where <image> is obtained from string s, by applying left circular shift i times. For example, Ο("AGC", "CGT") = h("AGC", "CGT") + h("AGC", "GTC") + h("AGC", "TCG") + h("GCA", "CGT") + h("GCA", "GTC") + h("GCA", "TCG") + h("CAG", "CGT") + h("CAG", "GTC") + h("CAG", "TCG") = 1 + 1 + 0 + 0 + 1 + 1 + 1 + 0 + 1 = 6
Vasya found a string s of length n on the Internet. Now he wants to count how many strings t there are such that the Vasya distance from the string s attains maximum possible value. Formally speaking, t must satisfy the equation: <image>.
Vasya could not try all possible strings to find an answer, so he needs your help. As the answer may be very large, count the number of such strings modulo 109 + 7.
Input
The first line of the input contains a single integer n (1 β€ n β€ 105).
The second line of the input contains a single string of length n, consisting of characters "ACGT".
Output
Print a single number β the answer modulo 109 + 7.
Examples
Input
1
C
Output
1
Input
2
AG
Output
4
Input
3
TTT
Output
1
Note
Please note that if for two distinct strings t1 and t2 values Ο(s, t1) ΠΈ Ο(s, t2) are maximum among all possible t, then both strings must be taken into account in the answer even if one of them can be obtained by a circular shift of another one.
In the first sample, there is Ο("C", "C") = 1, for the remaining strings t of length 1 the value of Ο(s, t) is 0.
In the second sample, Ο("AG", "AG") = Ο("AG", "GA") = Ο("AG", "AA") = Ο("AG", "GG") = 4.
In the third sample, Ο("TTT", "TTT") = 27
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
# problem statement: https://codeforces.com/problemset/problem/520/C
modulo = 1000000007
n = int(input())
char_count = [0] * 256
s = input()
for i in range(n):
char_count[ord(s[i])] += 1
max_char_count = max(char_count)
num_max_char = 0
for i in range(256):
if char_count[i] == max_char_count:
num_max_char += 1
print(pow(num_max_char, n) % modulo)
``` | vfc_33133 | {
"difficulty": "7",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2\nAG\n",
"output": "4\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 548_C. Mike and Frog | Solve the following coding problem using the programming language python:
Mike has a frog and a flower. His frog is named Xaniar and his flower is named Abol. Initially(at time 0), height of Xaniar is h1 and height of Abol is h2. Each second, Mike waters Abol and Xaniar.
<image>
So, if height of Xaniar is h1 and height of Abol is h2, after one second height of Xaniar will become <image> and height of Abol will become <image> where x1, y1, x2 and y2 are some integer numbers and <image> denotes the remainder of a modulo b.
Mike is a competitive programmer fan. He wants to know the minimum time it takes until height of Xania is a1 and height of Abol is a2.
Mike has asked you for your help. Calculate the minimum time or say it will never happen.
Input
The first line of input contains integer m (2 β€ m β€ 106).
The second line of input contains integers h1 and a1 (0 β€ h1, a1 < m).
The third line of input contains integers x1 and y1 (0 β€ x1, y1 < m).
The fourth line of input contains integers h2 and a2 (0 β€ h2, a2 < m).
The fifth line of input contains integers x2 and y2 (0 β€ x2, y2 < m).
It is guaranteed that h1 β a1 and h2 β a2.
Output
Print the minimum number of seconds until Xaniar reaches height a1 and Abol reaches height a2 or print -1 otherwise.
Examples
Input
5
4 2
1 1
0 1
2 3
Output
3
Input
1023
1 2
1 0
1 2
1 1
Output
-1
Note
In the first sample, heights sequences are following:
Xaniar: <image>
Abol: <image>
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | vfc_33137 | {
"difficulty": "9",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "1023\n1 2\n1 0\n1 2\n1 1\n",
"output": "-1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n4 2\n1 1\n0 1\n2 3\n",
"output": "3\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "999983\n380412 325756\n266945 907644\n318575 83081\n786616 603671\n",
"output": "-1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1376\n1227 1349\n313 193\n1113 361\n1314 23\n",
"output": "338\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "16\n8 0\n2 0\n1 4\n2 0\n",
"output": "2\n",
"type": "stdin_stdout"
}
]
} |
|
code_contests | verifiable_code | 574_E. Bear and Drawing | Solve the following coding problem using the programming language python:
Limak is a little bear who learns to draw. People usually start with houses, fences and flowers but why would bears do it? Limak lives in the forest and he decides to draw a tree.
Recall that tree is a connected graph consisting of n vertices and n - 1 edges.
Limak chose a tree with n vertices. He has infinite strip of paper with two parallel rows of dots. Little bear wants to assign vertices of a tree to some n distinct dots on a paper so that edges would intersect only at their endpoints β drawn tree must be planar. Below you can see one of correct drawings for the first sample test.
<image>
Is it possible for Limak to draw chosen tree?
Input
The first line contains single integer n (1 β€ n β€ 105).
Next n - 1 lines contain description of a tree. i-th of them contains two space-separated integers ai and bi (1 β€ ai, bi β€ n, ai β bi) denoting an edge between vertices ai and bi. It's guaranteed that given description forms a tree.
Output
Print "Yes" (without the quotes) if Limak can draw chosen tree. Otherwise, print "No" (without the quotes).
Examples
Input
8
1 2
1 3
1 6
6 4
6 7
6 5
7 8
Output
Yes
Input
13
1 2
1 3
1 4
2 5
2 6
2 7
3 8
3 9
3 10
4 11
4 12
4 13
Output
No
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | vfc_33141 | {
"difficulty": "11",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "8\n1 2\n1 3\n1 6\n6 4\n6 7\n6 5\n7 8\n",
"output": "Yes\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "13\n1 2\n1 3\n1 4\n2 5\n2 6\n2 7\n3 8\n3 9\n3 10\n4 11\n4 12\n4 13\n",
"output": "No\n",
"type": "stdin_stdout"
}
]
} |
|
code_contests | verifiable_code | 617_E. XOR and Favorite Number | Solve the following coding problem using the programming language python:
Bob has a favorite number k and ai of length n. Now he asks you to answer m queries. Each query is given by a pair li and ri and asks you to count the number of pairs of integers i and j, such that l β€ i β€ j β€ r and the xor of the numbers ai, ai + 1, ..., aj is equal to k.
Input
The first line of the input contains integers n, m and k (1 β€ n, m β€ 100 000, 0 β€ k β€ 1 000 000) β the length of the array, the number of queries and Bob's favorite number respectively.
The second line contains n integers ai (0 β€ ai β€ 1 000 000) β Bob's array.
Then m lines follow. The i-th line contains integers li and ri (1 β€ li β€ ri β€ n) β the parameters of the i-th query.
Output
Print m lines, answer the queries in the order they appear in the input.
Examples
Input
6 2 3
1 2 1 1 0 3
1 6
3 5
Output
7
0
Input
5 3 1
1 1 1 1 1
1 5
2 4
1 3
Output
9
4
4
Note
In the first sample the suitable pairs of i and j for the first query are: (1, 2), (1, 4), (1, 5), (2, 3), (3, 6), (5, 6), (6, 6). Not a single of these pairs is suitable for the second query.
In the second sample xor equals 1 for all subarrays of an odd length.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
# ------------------- fast io --------------------
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# ------------------- fast io --------------------
from math import ceil
def prod(a, mod=10 ** 9 + 7):
ans = 1
for each in a:
ans = (ans * each) % mod
return ans
def gcd(x, y):
while y:
x, y = y, x % y
return x
def lcm(a, b): return a * b // gcd(a, b)
def binary(x, length=16):
y = bin(x)[2:]
return y if len(y) >= length else "0" * (length - len(y)) + y
for _ in range(int(input()) if not True else 1):
#n = int(input())
n, m, k = map(int, input().split())
# a, b = map(int, input().split())
# c, d = map(int, input().split())
a = list(map(int, input().split()))
# b = list(map(int, input().split()))
# s = input()
pre = [0]
for i in range(n):
pre += [a[i] ^ pre[-1]]
BLOCK_SIZE = 320
queries = [[] for __ in range(BLOCK_SIZE)]
ans = [0]*m
for i in range(m):
l, r = map(int, input().split())
queries[l // BLOCK_SIZE] += [[l - 1, r, i]]
count = [0] * (1 << 20)
for i in range(len(queries)):
queries[i] = sorted(queries[i], key=lambda x: x[1])
if not queries[i]: continue
left = right = BLOCK_SIZE * i
count[pre[left]] += 1
res = 0
for l, r, index in queries[i]:
while right < r:
right += 1
res += count[pre[right] ^ k]
count[pre[right]] += 1
while left < l:
left += 1
count[pre[left - 1]] -= 1
res -= count[pre[left - 1] ^ k]
while left > l:
left -= 1
res += count[pre[left] ^ k]
count[pre[left]] += 1
ans[index] = res
while left <= right:
left += 1
count[pre[left - 1]] -= 1
res -= count[pre[left - 1] ^ k]
assert res == 0
for each in ans:
print(each)
``` | vfc_33149 | {
"difficulty": "11",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 4, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "6 2 3\n1 2 1 1 0 3\n1 6\n3 5\n",
"output": "7\n0\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5 3 1\n1 1 1 1 1\n1 5\n2 4\n1 3\n",
"output": "9\n4\n4\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 638_B. Making Genome in Berland | Solve the following coding problem using the programming language python:
Berland scientists face a very important task - given the parts of short DNA fragments, restore the dinosaur DNA! The genome of a berland dinosaur has noting in common with the genome that we've used to: it can have 26 distinct nucleotide types, a nucleotide of each type can occur at most once. If we assign distinct English letters to all nucleotides, then the genome of a Berland dinosaur will represent a non-empty string consisting of small English letters, such that each letter occurs in it at most once.
Scientists have n genome fragments that are represented as substrings (non-empty sequences of consecutive nucleotides) of the sought genome.
You face the following problem: help scientists restore the dinosaur genome. It is guaranteed that the input is not contradictory and at least one suitable line always exists. When the scientists found out that you are a strong programmer, they asked you in addition to choose the one with the minimum length. If there are multiple such strings, choose any string.
Input
The first line of the input contains a positive integer n (1 β€ n β€ 100) β the number of genome fragments.
Each of the next lines contains one descriptions of a fragment. Each fragment is a non-empty string consisting of distinct small letters of the English alphabet. It is not guaranteed that the given fragments are distinct. Fragments could arbitrarily overlap and one fragment could be a substring of another one.
It is guaranteed that there is such string of distinct letters that contains all the given fragments as substrings.
Output
In the single line of the output print the genome of the minimum length that contains all the given parts. All the nucleotides in the genome must be distinct. If there are multiple suitable strings, print the string of the minimum length. If there also are multiple suitable strings, you can print any of them.
Examples
Input
3
bcd
ab
cdef
Output
abcdef
Input
4
x
y
z
w
Output
xyzw
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
n = int(input())
genom = dict()
heads = set()
for i in range(n):
part = input()
heads.add(part[0])
for i in range(len(part)):
prev = None
next = None
if i - 1 >= 0:
prev = part[i - 1]
if i + 1 < len(part):
next = part[i + 1]
if part[i] in genom:
if not genom[part[i]][0]:
genom[part[i]][0] = prev
if not genom[part[i]][1]:
genom[part[i]][1] = next
else:
genom[part[i]] = [prev, next]
new_heads = set()
for head in heads:
if not genom[head][0]:
new_heads.add(head)
res = ''
for head in new_heads:
el = head
while el:
res += el
el = genom[el][1]
print(res)
``` | vfc_33153 | {
"difficulty": "8",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3\nbcd\nab\ncdef\n",
"output": "abcdef\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4\nx\ny\nz\nw\n",
"output": "wxyz\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4\nrz\nvu\nxy\npg\n",
"output": "pgrzvuxy\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 665_F. Four Divisors | Solve the following coding problem using the programming language python:
If an integer a is divisible by another integer b, then b is called the divisor of a.
For example: 12 has positive 6 divisors. They are 1, 2, 3, 4, 6 and 12.
Letβs define a function D(n) β number of integers between 1 and n (inclusive) which has exactly four positive divisors.
Between 1 and 10 only the integers 6, 8 and 10 has exactly four positive divisors. So, D(10) = 3.
You are given an integer n. You have to calculate D(n).
Input
The only line contains integer n (1 β€ n β€ 1011) β the parameter from the problem statement.
Output
Print the only integer c β the number of integers between 1 and n with exactly four divisors.
Examples
Input
10
Output
3
Input
20
Output
5
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | vfc_33157 | {
"difficulty": "12",
"memory_limit": null,
"memory_limit_bytes": 768000000,
"problem_url": null,
"time_limit": "{'seconds': 10, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "10\n",
"output": "3\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "20\n",
"output": "5\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "636940\n",
"output": "136364\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "753068\n",
"output": "160058\n",
"type": "stdin_stdout"
}
]
} |
|
code_contests | verifiable_code | 68_D. Half-decay tree | Solve the following coding problem using the programming language python:
Recently Petya has become keen on physics. Anna V., his teacher noticed Petya's interest and gave him a fascinating physical puzzle β a half-decay tree.
A half-decay tree is a complete binary tree with the height h. The height of a tree is the length of the path (in edges) from the root to a leaf in the tree. While studying the tree Petya can add electrons to vertices or induce random decay with synchrophasotron. Random decay is a process during which the edges of some path from the root to the random leaf of the tree are deleted. All the leaves are equiprobable. As the half-decay tree is the school property, Petya will return back the deleted edges into the tree after each decay.
After being desintegrated, the tree decomposes into connected components. Charge of each component is the total quantity of electrons placed in vertices of the component. Potential of desintegerated tree is the maximum from the charges of its connected components. Each time before inducing random decay Petya is curious about the mathematical expectation of potential of the tree after being desintegrated.
Input
First line will contain two integers h and q (1 β€ h β€ 30, 1 β€ q β€ 105). Next q lines will contain a query of one of two types:
* add v e
Petya adds e electrons to vertex number v (1 β€ v β€ 2h + 1 - 1, 0 β€ e β€ 104). v and e are integers.
The vertices of the tree are numbered in the following way: the root is numbered with 1, the children of the vertex with number x are numbered with 2x and 2x + 1.
* decay
Petya induces tree decay.
Output
For each query decay solution you should output the mathematical expectation of potential of the tree after being desintegrated. The absolute or relative error in the answer should not exceed 10 - 4.
Examples
Input
1 4
add 1 3
add 2 10
add 3 11
decay
Output
13.50000000
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | vfc_33161 | {
"difficulty": "10",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 3, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "1 4\nadd 1 3\nadd 2 10\nadd 3 11\ndecay\n",
"output": "13.50000\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 6\nadd 11 467\nadd 9 879\ndecay\nadd 15 551\nadd 14 473\nadd 14 104\n",
"output": "1112.50000\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "7 10\ndecay\nadd 10 9923\ndecay\nadd 21 2047\ndecay\nadd 4 8696\ndecay\ndecay\nadd 204 4988\nadd 230 1977\n",
"output": "0.00000\n9923.00000\n11842.06250\n16190.06250\n16190.06250\n",
"type": "stdin_stdout"
}
]
} |
|
code_contests | verifiable_code | 712_B. Memory and Trident | Solve the following coding problem using the programming language python:
Memory is performing a walk on the two-dimensional plane, starting at the origin. He is given a string s with his directions for motion:
* An 'L' indicates he should move one unit left.
* An 'R' indicates he should move one unit right.
* A 'U' indicates he should move one unit up.
* A 'D' indicates he should move one unit down.
But now Memory wants to end at the origin. To do this, he has a special trident. This trident can replace any character in s with any of 'L', 'R', 'U', or 'D'. However, because he doesn't want to wear out the trident, he wants to make the minimum number of edits possible. Please tell Memory what is the minimum number of changes he needs to make to produce a string that, when walked, will end at the origin, or if there is no such string.
Input
The first and only line contains the string s (1 β€ |s| β€ 100 000) β the instructions Memory is given.
Output
If there is a string satisfying the conditions, output a single integer β the minimum number of edits required. In case it's not possible to change the sequence in such a way that it will bring Memory to to the origin, output -1.
Examples
Input
RRU
Output
-1
Input
UDUR
Output
1
Input
RUUR
Output
2
Note
In the first sample test, Memory is told to walk right, then right, then up. It is easy to see that it is impossible to edit these instructions to form a valid walk.
In the second sample test, Memory is told to walk up, then down, then up, then right. One possible solution is to change s to "LDUR". This string uses 1 edit, which is the minimum possible. It also ends at the origin.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
s = input()
ud = lr = 0
for ch in s:
if(ch=='R'):
lr = lr+1
if(ch=='L'):
lr = lr-1
if(ch=='U'):
ud = ud+1
if(ch=='D'):
ud = ud-1
if((abs(lr) + abs(ud))%2==1):
print(-1)
else:
print(int((abs(lr) + abs(ud))/2))
``` | vfc_33165 | {
"difficulty": "8",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "UDUR\n",
"output": "1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "RUUR\n",
"output": "2\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "RRU\n",
"output": "-1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "RDDLLDLUUUDDRDRURLUUURLLDDLRLUURRLLRRLDRLLUDRLRULLDLRRLRLRLRUDUUDLULURLLDUURULURLLRRRURRRDRUUDLDRLRDRLRRDDLDLDLLUDRUDRLLLLDRDUULRUURRDLULLULDUDULRURRDDDLLUDRLUDDLDDDRRDDDULLLLDLDRLRRLRRDDRLULURRUDRDUUUULDURUDRDLDDUDUDRRURDULRRUDRLRRDLUURURDLDRLRDUDDDLDDDURURLUULRDUUULRURUDUDRRUDULLLUUUDRLLDRRDDLRUDRDRDLLRURURRRULURURRRLUUULRRRUURUUDURUDDLLDLDRLRDLDRLLDLDRDRRLRRRURUUUDRDLRLRUDRLULUUULUDDLULDLRLLRDUULLRLRURLRURULLLUDUDDLRULRDUURURLDLUURRRDURRLLDRUUDRDLLDUUDLURUDDUUUULRLLURLUDDRLRRDRURLRUDRLDDRLLL\n",
"output": "-1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "UDURLRDURLRD\n",
"output": "1\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 733_A. Grasshopper And the String | Solve the following coding problem using the programming language python:
One day, the Grasshopper was jumping on the lawn and found a piece of paper with a string. Grasshopper became interested what is the minimum jump ability he should have in order to be able to reach the far end of the string, jumping only on vowels of the English alphabet. Jump ability is the maximum possible length of his jump.
Formally, consider that at the begginning the Grasshopper is located directly in front of the leftmost character of the string. His goal is to reach the position right after the rightmost character of the string. In one jump the Grasshopper could jump to the right any distance from 1 to the value of his jump ability.
<image> The picture corresponds to the first example.
The following letters are vowels: 'A', 'E', 'I', 'O', 'U' and 'Y'.
Input
The first line contains non-empty string consisting of capital English letters. It is guaranteed that the length of the string does not exceed 100.
Output
Print single integer a β the minimum jump ability of the Grasshopper (in the number of symbols) that is needed to overcome the given string, jumping only on vowels.
Examples
Input
ABABBBACFEYUKOTT
Output
4
Input
AAA
Output
1
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
def solve(a):
l = [0]
li = []
j = 0
for i in range(len(a)):
if a[i] == "A" or a[i] == "E" or a[i] == "I" or a[i] == "O" or a[i] == "U" or a[i] == "Y":
l.append(i + 1)
j += 1
li.append(l[j] - l[j-1])
l.append(i + 1)
j += 1
li.append(l[j] - l[j-1] + 1)
li.sort()
print(li[-1])
solve(input())
``` | vfc_33169 | {
"difficulty": "7",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "ABABBBACFEYUKOTT\n",
"output": "4\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "AAA\n",
"output": "1\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 757_B. Bash's Big Day | Solve the following coding problem using the programming language python:
Bash has set out on a journey to become the greatest Pokemon master. To get his first Pokemon, he went to Professor Zulu's Lab. Since Bash is Professor Zulu's favourite student, Zulu allows him to take as many Pokemon from his lab as he pleases.
But Zulu warns him that a group of k > 1 Pokemon with strengths {s1, s2, s3, ..., sk} tend to fight among each other if gcd(s1, s2, s3, ..., sk) = 1 (see notes for gcd definition).
Bash, being smart, does not want his Pokemon to fight among each other. However, he also wants to maximize the number of Pokemon he takes from the lab. Can you help Bash find out the maximum number of Pokemon he can take?
Note: A Pokemon cannot fight with itself.
Input
The input consists of two lines.
The first line contains an integer n (1 β€ n β€ 105), the number of Pokemon in the lab.
The next line contains n space separated integers, where the i-th of them denotes si (1 β€ si β€ 105), the strength of the i-th Pokemon.
Output
Print single integer β the maximum number of Pokemons Bash can take.
Examples
Input
3
2 3 4
Output
2
Input
5
2 3 4 6 7
Output
3
Note
gcd (greatest common divisor) of positive integers set {a1, a2, ..., an} is the maximum positive integer that divides all the integers {a1, a2, ..., an}.
In the first sample, we can take Pokemons with strengths {2, 4} since gcd(2, 4) = 2.
In the second sample, we can take Pokemons with strengths {2, 4, 6}, and there is no larger group with gcd β 1.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
def function1(n,s):
if n==1:
return 1
pokemonj=0
pokecage=[0 for i in range(100001)]
for i in range(n):
pokecage[s[i]]+=1
maxyincage=min(pokecage[1],1)
a = [i for i in range(100001)]
a[1] = 0
i = 2
while i <= 100000:
if a[i] != 0:
pokemonj=0
for j in range(i, 100001, i):
a[j] = 0
pokemonj+=pokecage[j]
if pokemonj>maxyincage:
maxyincage=pokemonj
i += 1
return(maxyincage)
def main():
n=int(input())
s=list(map(int,input().split()))
print(function1(n,s))
if __name__=='__main__':
main()
``` | vfc_33173 | {
"difficulty": "8",
"memory_limit": null,
"memory_limit_bytes": 512000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "5\n2 3 4 6 7\n",
"output": "3\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n2 3 4\n",
"output": "2\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n49999 49999 99998\n",
"output": "3\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n457 457 457\n",
"output": "3\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n4 9\n",
"output": "1\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 778_D. Parquet Re-laying | Solve the following coding problem using the programming language python:
Peter decided to lay a parquet in the room of size n Γ m, the parquet consists of tiles of size 1 Γ 2. When the workers laid the parquet, it became clear that the tiles pattern looks not like Peter likes, and workers will have to re-lay it.
The workers decided that removing entire parquet and then laying it again is very difficult task, so they decided to make such an operation every hour: remove two tiles, which form a 2 Γ 2 square, rotate them 90 degrees and put them back on the same place.
<image>
They have no idea how to obtain the desired configuration using these operations, and whether it is possible at all.
Help Peter to make a plan for the workers or tell that it is impossible. The plan should contain at most 100 000 commands.
Input
The first line contains integer n and m, size of the room (1 β€ n, m β€ 50). At least one of them is even number.
The following n lines contain m characters each, the description of the current configuration of the parquet tiles. Each character represents the position of the half-tile. Characters 'L', 'R', 'U' and 'D' correspond to the left, right, upper and lower halves, respectively.
The following n lines contain m characters each, describing the desired configuration in the same format.
Output
In the first line output integer k, the number of operations. In the next k lines output description of operations. The operation is specified by coordinates (row and column) of the left upper half-tile on which the operation is performed.
If there is no solution, output -1 in the first line.
Examples
Input
2 3
ULR
DLR
LRU
LRD
Output
2
1 2
1 1
Input
4 3
ULR
DLR
LRU
LRD
ULR
DUU
UDD
DLR
Output
3
3 1
3 2
2 2
Note
In the first sample test first operation is to rotate two rightmost tiles, after this all tiles lie vertically. Second operation is to rotate two leftmost tiles, after this we will get desired configuration.
<image>
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
#!/usr/bin/env python3
board = []
n, m = 0, 0
def rotate(x, y):
if board[x][y] == 'L':
board[x][y] = board[x][y+1] = 'U'
board[x+1][y] = board[x+1][y+1] = 'D'
else:
board[x][y] = board[x+1][y] = 'L'
board[x][y+1] = board[x+1][y+1] = 'R'
def fix(x, y, moves):
if board[x+1][y] == 'U':
if board[x+1][y+1] == 'L':
fix(x+1, y+1, moves)
rotate(x+1, y)
moves.append((x+2, y+1))
rotate(x, y)
moves.append((x+1, y+1))
def solve_board(moves):
global board, n, m
board = []
for _ in range(n):
board.append(list(input()))
for i in range(n-1):
for j in range(m):
if board[i][j] == 'L':
fix(i, j, moves)
def main():
global n, m
n, m = map(int, input().split())
moves1 = []; moves2 = []
solve_board(moves1)
solve_board(moves2)
print(len(moves1) + len(moves2))
for move in moves1:
print(str(move[0]) + ' ' + str(move[1]))
for move in reversed(moves2):
print(str(move[0]) + ' ' + str(move[1]))
if __name__ == '__main__':
main()
``` | vfc_33177 | {
"difficulty": "10",
"memory_limit": null,
"memory_limit_bytes": 512000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4 3\nULR\nDLR\nLRU\nLRD\nULR\nDUU\nUDD\nDLR",
"output": "5\n1 2\n3 1\n3 2\n1 2\n2 2\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2 3\nULR\nDLR\nLRU\nLRD\n",
"output": "2\n1 2\n1 1\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 802_G. Fake News (easy) | Solve the following coding problem using the programming language python:
As it's the first of April, Heidi is suspecting that the news she reads today are fake, and she does not want to look silly in front of all the contestants. She knows that a newspiece is fake if it contains heidi as a subsequence. Help Heidi assess whether the given piece is true, but please be discreet about it...
Input
The first and only line of input contains a single nonempty string s of length at most 1000 composed of lowercase letters (a-z).
Output
Output YES if the string s contains heidi as a subsequence and NO otherwise.
Examples
Input
abcheaibcdi
Output
YES
Input
hiedi
Output
NO
Note
A string s contains another string p as a subsequence if it is possible to delete some characters from s and obtain p.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
li = list(input())
def f(n,s):
global li
while True:
if li[n] != s:
li.pop(n)
else:
break
try:
f(0,'h')
f(1,'e')
f(2,'i')
f(3,'d')
f(4,'i')
except:
print("NO")
else:
print("YES")
``` | vfc_33181 | {
"difficulty": "13",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "abcheaibcdi\n",
"output": "YES",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "hiedi\n",
"output": "NO",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 825_C. Multi-judge Solving | Solve the following coding problem using the programming language python:
Makes solves problems on Decoforces and lots of other different online judges. Each problem is denoted by its difficulty β a positive integer number. Difficulties are measured the same across all the judges (the problem with difficulty d on Decoforces is as hard as the problem with difficulty d on any other judge).
Makes has chosen n problems to solve on Decoforces with difficulties a1, a2, ..., an. He can solve these problems in arbitrary order. Though he can solve problem i with difficulty ai only if he had already solved some problem with difficulty <image> (no matter on what online judge was it).
Before starting this chosen list of problems, Makes has already solved problems with maximum difficulty k.
With given conditions it's easy to see that Makes sometimes can't solve all the chosen problems, no matter what order he chooses. So he wants to solve some problems on other judges to finish solving problems from his list.
For every positive integer y there exist some problem with difficulty y on at least one judge besides Decoforces.
Makes can solve problems on any judge at any time, it isn't necessary to do problems from the chosen list one right after another.
Makes doesn't have too much free time, so he asked you to calculate the minimum number of problems he should solve on other judges in order to solve all the chosen problems from Decoforces.
Input
The first line contains two integer numbers n, k (1 β€ n β€ 103, 1 β€ k β€ 109).
The second line contains n space-separated integer numbers a1, a2, ..., an (1 β€ ai β€ 109).
Output
Print minimum number of problems Makes should solve on other judges in order to solve all chosen problems on Decoforces.
Examples
Input
3 3
2 1 9
Output
1
Input
4 20
10 3 6 3
Output
0
Note
In the first example Makes at first solves problems 1 and 2. Then in order to solve the problem with difficulty 9, he should solve problem with difficulty no less than 5. The only available are difficulties 5 and 6 on some other judge. Solving any of these will give Makes opportunity to solve problem 3.
In the second example he can solve every problem right from the start.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
n,k=map(int,input().split())
ar=sorted(list(map(int,input().split())))
ans=0
for x in ar:
if k <= x <= k*2: k=x
while x/2 > k:
ans+=1
k*=2
if k <= x <= k*2: k=x
print(ans)
``` | vfc_33185 | {
"difficulty": "9",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4 20\n10 3 6 3\n",
"output": "0",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3 3\n2 1 9\n",
"output": "1",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1 2\n9\n",
"output": "2",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "7 6\n4 20 16 14 3 17 4\n",
"output": "1",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 848_A. From Y to Y | Solve the following coding problem using the programming language python:
From beginning till end, this message has been waiting to be conveyed.
For a given unordered multiset of n lowercase English letters ("multi" means that a letter may appear more than once), we treat all letters as strings of length 1, and repeat the following operation n - 1 times:
* Remove any two elements s and t from the set, and add their concatenation s + t to the set.
The cost of such operation is defined to be <image>, where f(s, c) denotes the number of times character c appears in string s.
Given a non-negative integer k, construct any valid non-empty set of no more than 100 000 letters, such that the minimum accumulative cost of the whole process is exactly k. It can be shown that a solution always exists.
Input
The first and only line of input contains a non-negative integer k (0 β€ k β€ 100 000) β the required minimum cost.
Output
Output a non-empty string of no more than 100 000 lowercase English letters β any multiset satisfying the requirements, concatenated to be a string.
Note that the printed string doesn't need to be the final concatenated string. It only needs to represent an unordered multiset of letters.
Examples
Input
12
Output
abababab
Input
3
Output
codeforces
Note
For the multiset {'a', 'b', 'a', 'b', 'a', 'b', 'a', 'b'}, one of the ways to complete the process is as follows:
* {"ab", "a", "b", "a", "b", "a", "b"}, with a cost of 0;
* {"aba", "b", "a", "b", "a", "b"}, with a cost of 1;
* {"abab", "a", "b", "a", "b"}, with a cost of 1;
* {"abab", "ab", "a", "b"}, with a cost of 0;
* {"abab", "aba", "b"}, with a cost of 1;
* {"abab", "abab"}, with a cost of 1;
* {"abababab"}, with a cost of 8.
The total cost is 12, and it can be proved to be the minimum cost of the process.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
# def ap(l):
# d = set()
# for i in range(1, len(l)):
# d.add(l[i]-l[i-1])
# if(len(d) == 1):
# return d.pop()
# else:
# return "re"
# def app(ll, oo, nm, ooo):
# k = []
# for j in range(n):
# if(j%oo !=0):
# k.append(ll[j])
# if(ap(k) != "re" and ap(k) != ooo):
# return True
# else:
# return False
# err = 1
# n = int(input())
# l = [int(x) for x in input().split()]
# m = []
# for i in range(2, n):
# k = []
# for j in range(0, n, i):
# k.append(l[j])
# print(k)
# m.append(k)
# final = []
# for i in range(n-2):
# r = 1
# if(ap(m[i]) != "re"):
# final.append([ap(m[i]), i+2])
# print(final)
# for i in final:
# if(app(l, i[1], n, i[0])):
# print(i)
# # print("Yes")
# err = 0
# break
# if(err):
# print("No")
# else:
# print("Yes")
k = int(input())
for i in range(26):
tt = 1
while((tt*(tt+1))//2 <=k):
tt+=1
k-=((tt*(tt-1))//2)
print(chr(97+i)*(tt), end = "")
print("")
``` | vfc_33189 | {
"difficulty": "7",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "12\n",
"output": "aaaaabbcc\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n",
"output": "aaa\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "99681\n",
"output": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "8\n",
"output": "aaaabbcc\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 896_C. Willem, Chtholly and Seniorious | Solve the following coding problem using the programming language python:
β Willem...
β What's the matter?
β It seems that there's something wrong with Seniorious...
β I'll have a look...
<image>
Seniorious is made by linking special talismans in particular order.
After over 500 years, the carillon is now in bad condition, so Willem decides to examine it thoroughly.
Seniorious has n pieces of talisman. Willem puts them in a line, the i-th of which is an integer ai.
In order to maintain it, Willem needs to perform m operations.
There are four types of operations:
* 1 l r x: For each i such that l β€ i β€ r, assign ai + x to ai.
* 2 l r x: For each i such that l β€ i β€ r, assign x to ai.
* 3 l r x: Print the x-th smallest number in the index range [l, r], i.e. the element at the x-th position if all the elements ai such that l β€ i β€ r are taken and sorted into an array of non-decreasing integers. It's guaranteed that 1 β€ x β€ r - l + 1.
* 4 l r x y: Print the sum of the x-th power of ai such that l β€ i β€ r, modulo y, i.e. <image>.
Input
The only line contains four integers n, m, seed, vmax (1 β€ n, m β€ 105, 0 β€ seed < 109 + 7, 1 β€ vmax β€ 109).
The initial values and operations are generated using following pseudo code:
def rnd():
ret = seed
seed = (seed * 7 + 13) mod 1000000007
return ret
for i = 1 to n:
a[i] = (rnd() mod vmax) + 1
for i = 1 to m:
op = (rnd() mod 4) + 1
l = (rnd() mod n) + 1
r = (rnd() mod n) + 1
if (l > r):
swap(l, r)
if (op == 3):
x = (rnd() mod (r - l + 1)) + 1
else:
x = (rnd() mod vmax) + 1
if (op == 4):
y = (rnd() mod vmax) + 1
Here op is the type of the operation mentioned in the legend.
Output
For each operation of types 3 or 4, output a line containing the answer.
Examples
Input
10 10 7 9
Output
2
1
0
3
Input
10 10 9 9
Output
1
1
3
3
Note
In the first example, the initial array is {8, 9, 7, 2, 3, 1, 5, 6, 4, 8}.
The operations are:
* 2 6 7 9
* 1 3 10 8
* 4 4 6 2 4
* 1 4 5 8
* 2 1 7 1
* 4 7 9 4 4
* 1 2 7 9
* 4 5 8 1 1
* 2 5 7 5
* 4 3 10 8 5
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | vfc_33197 | {
"difficulty": "9",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "10 10 7 9\n",
"output": "2\n1\n0\n3\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "10 10 9 9\n",
"output": "1\n1\n3\n3\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "53834 13558 705236852 914473856\n",
"output": "227634968\n75533466\n692001026\n372458402\n4199748\n372458402\n1011605540\n148163245\n1082313030\n1876361538\n252764794\n1082313030\n213855976\n20679522\n213855976\n39289356\n227865875\n2316098912\n767062628\n485927680\n767062628\n266488539\n745842201\n22734895\n609911878\n111182647\n100331484\n1753687996\n167171744\n485927680\n3238342\n65048581\n675400107\n102847960\n79627523\n99751245\n75065723\n446974685\n69768843\n234926533\n1346413189\n268814655\n99751245\n113231745\n123381304\n52895998\n162960402\n1363750581\n597814358\n330830077\n1256997826\n1168272648\n2053999957\n1612015996\n39258539\n805445438\n1328281725\n805445438\n805445438\n52942487\n7557271\n8287355\n805445438\n766588926\n218463118\n1197383551\n51544705\n2148687752\n55718890\n49288316\n552193129\n81055738\n467464000\n572071182\n8038\n503132898\n1242205772\n1242205772\n590371436\n1275402007\n206544289\n2085732358\n93583136\n19229823\n787225387\n240838624\n376438940\n91309633\n130005871\n266943347\n22563270\n1072830496\n28841769\n734808847\n63343634\n221134775\n146227361\n146227361\n146227361\n212455368\n1859639216\n1238567255\n2300335068\n398005695\n2300335068\n35517348\n35517348\n26550840\n849134729\n3835383818\n96138706\n650201640\n111104944\n12163343\n75087489\n737968123\n2114682068\n465301679\n133966642\n1347566297\n566513595\n796605515\n111411363\n1817373276\n392165547\n515900739\n310616423\n568496227\n601690558\n535126615\n1587733951\n2670942052\n895030967\n22305440\n595438048\n329135453\n38694543\n835774002\n72141442\n446577414\n34135049\n22396192\n660848416\n26436821\n138584350\n660848416\n660848416\n4885531\n134235578\n292687666\n1196174197\n2080639049\n1196174197\n990906649\n2160866449\n2315914598\n154447219\n43648672\n91133150\n393698140\n232246715\n393698140\n907610458\n907610458\n9337569\n414762226\n414762226\n42766218\n1354498181\n576408184\n372490718\n414762226\n61945885\n27686583\n1286865868\n383771830\n1178047094\n1861371863\n256373449\n2252649217\n384833308\n384833308\n384833308\n567721111\n384833308\n384833308\n171511356\n36106493\n18327126\n860237437\n356169639\n860237437\n174946458\n1207515157\n108300056\n7195727\n303428029\n3500357\n301330724\n298882174\n709735284\n32374508\n216924880\n221797264\n226503326\n817266422\n817266422\n433357052\n124527876\n124527876\n124527876\n495238052\n199657022\n817918504\n439208644\n3100130066\n196324027\n110592580\n8340989\n224912159\n188871105\n85412756\n53788804\n24418809\n518604970\n107426494\n42324617\n155550043\n161595231\n733693035\n102843235\n591105578\n1634198133\n487193728\n534056254\n557342271\n316401043\n213226185\n59802111\n678901730\n5398519\n111796111\n288708622\n356885879\n388385894\n881086405\n31379656\n213667316\n150631924\n415580737\n415580737\n181626587\n132298241\n313260136\n227745104\n165030750\n59535829\n59535829\n59535829\n415580737\n568064406\n66064752\n59535829\n55076116\n571807120\n135400028\n37319620\n768925700\n105162741\n400553230\n899791340\n899791340\n2148714\n31880046\n31880046\n902851978\n31880046\n515251404\n132943261\n65393221\n2800597286\n827754977\n148648264\n113524410\n115728923\n1178693234\n1178693234\n1730884675\n498523846\n1626238990\n1746520250\n55642362\n32531637\n254656886\n291999120\n101345785\n1958463100\n1958463100\n2424743303\n575995102\n4253413839\n1211234465\n388396210\n37335069\n249504622\n826479334\n143150861\n80973160\n3305957033\n786390472\n517203592\n1491616425\n1491616425\n81436802\n175011822\n642183708\n769044265\n815761014\n33987594\n436266361\n387188601\n753406156\n3032932\n1550742698\n1724320004\n2158386006\n2158386006\n573300883\n107033719\n2826677320\n2219034012\n1724320004\n132870793\n14588724\n1724320004\n14588724\n2118179184\n237430149\n105336808\n11569522\n4353225481\n1178617464\n772463715\n360502979\n772463715\n194454608\n461979238\n188585635\n1241305149\n1178617464\n813959045\n92016268\n2124203762\n728466752\n42694494\n401043130\n496402303\n114423709\n3451761000\n213914089\n459760063\n459760063\n3923614\n754232827\n236210255\n212656001\n19672501\n352976203\n152720695\n1180859942\n272393852\n258034940\n1371510\n245822694\n382554186\n1190031696\n1064959276\n547346075\n552362586\n123561219\n177479061\n7738602\n523720514\n531950211\n117739646\n523720514\n239778484\n301498317\n9050\n19321200\n251152308\n253958481\n193084233\n193084233\n101704741\n892430047\n193084233\n691356793\n193084233\n193084233\n332988579\n459908290\n486220998\n486220998\n378894254\n413538820\n755592097\n95348724\n634965692\n100459460\n10819150\n111890511\n58197548\n635009315\n38472620\n378277264\n285588939\n588466740\n75569289\n1213518889\n136822852\n2119904223\n563275747\n188861197\n978778113\n937927085\n15835211\n106245661\n49978217\n301076370\n804520409\n127830581\n48545240\n1397325735\n1397325735\n145729546\n116961259\n26905945\n409729506\n12673377\n49978217\n174212052\n174212052\n90946276\n49978217\n226470579\n115481398\n818657284\n818657284\n539801451\n406738651\n166920123\n818657284\n62475153\n148862070\n682904340\n253007520\n311840070\n39470871\n421276297\n421276297\n360178999\n221376145\n444480719\n309511887\n1097803890\n2534453878\n2918594\n185569968\n793720216\n306676448\n904424551\n523334554\n210580124\n170738728\n126513907\n415580737\n18654727\n306732198\n36189344\n24871959\n199026615\n188969410\n905533087\n153671311\n20301443\n184929469\n344380672\n68818867\n48577057\n813644878\n587083702\n60023568\n60023568\n34592643\n710980199\n312840541\n849297397\n327033449\n655125843\n707204095\n337477248\n1249300143\n663659431\n587083702\n985187145\n27183784\n253327880\n1495493020\n375453093\n310954194\n98201700\n339087644\n549406746\n767959\n28785\n216700072\n625683886\n502895802\n1184555918\n218485318\n642574580\n1905032\n40719462\n1219765487\n1313887699\n72649300\n455284534\n455284534\n164544376\n115686005\n257661025\n175955235\n72680085\n1519656153\n551251835\n2763863021\n1911639933\n1911639933\n62207797\n55031073\n1818417452\n86127807\n3060287679\n931144203\n1911639933\n35003937\n3287183478\n283817058\n116503158\n711674920\n325229072\n1303695983\n518797660\n33087200\n518797660\n518797660\n604702052\n518797660\n518797660\n222906661\n175223669\n546236587\n361354839\n898040606\n557109722\n350608818\n407801306\n38811984\n245126028\n282135950\n653838014\n903761834\n1540313756\n467557355\n145749479\n828579017\n282135950\n237467561\n862158226\n862158226\n862158226\n58789416\n654776961\n18194020\n862158226\n1496306474\n66320408\n90839922\n1486259578\n1931660556\n785497309\n298711484\n3024896\n76875003\n24954295\n76875003\n512629011\n1200356484\n314385174\n556025067\n691593987\n175804520\n643274758\n10546889\n188322358\n479826230\n643274758\n668526542\n22610711\n1014171733\n1039423517\n1513040736\n136265112\n108357998\n909872212\n909872212\n392076494\n767494836\n75740190\n174474705\n54611685\n420755027\n157566673\n391099400\n727338175\n455455943\n238738622\n238738622\n21718981\n965556444\n178628448\n972671124\n2383071175\n518947327\n11828491\n72887282\n211430211\n668189067\n904883971\n904883971\n211430211\n940923522\n133938206\n77683424\n905786561\n2015860786\n1169227548\n2019579194\n77787062\n1625986404\n77787062\n77787062\n77787062\n210583434\n1625986404\n456329387\n245355323\n404636111\n408614400\n456329387\n327510482\n386855414\n707556184\n1075163940\n255827828\n575252544\n89615011\n575252544\n550201149\n2321033915\n386855414\n1760129310\n621126464\n123196486\n2688641671\n691943839\n127343883\n2107987947\n538744645\n1574482868\n1760129310\n110330976\n26206291\n356891060\n2396142103\n908549\n129779200\n562059299\n437386071\n1322076054\n635628342\n11298648\n235543080\n43331063\n629444842\n755652150\n655405853\n1168115\n1444481941\n216717386\n172434161\n172434161\n157333097\n9318010\n9318010\n818456421\n412303774\n172238348\n1001874466\n2077991507\n36752579\n810443633\n810443633\n173401279\n452907814\n1023650803\n24026537\n160898496\n501836435\n7678224\n9233058\n419175669\n543564878\n41695247\n277915092\n416373155\n346256616\n2113783550\n253852922\n3007508135\n2891929954\n3681849779\n49423056\n949565960\n103490752\n949565960\n1778576894\n949565960\n949565960\n55337906\n2203992311\n277138457\n277138457\n277138457\n75486488\n397224390\n277138457\n310731482\n166621372\n469446366\n2232091770\n277138457\n346534681\n7758706\n1151782885\n4990101\n807041912\n757520638\n1457926\n757520638\n757520638\n126533\n532461149\n438017559\n136914887\n160992819\n277138457\n1385849911\n1385849911\n400939786\n115082700\n459563641\n1385849911\n401707740\n1006804589\n152860520\n1006804589\n35267961\n55807988\n915460810\n361803993\n469297819\n142518455\n1362617487\n390466648\n192083724\n39252795\n470432059\n143155861\n30944884\n87843331\n569674434\n45507311\n164512459\n45507311\n569674434\n569674434\n622661344\n23144333\n2148735108\n92862807\n858172606\n322262696\n858172606\n27071110\n479706528\n156788087\n211790257\n2378973330\n2378973330\n127448299\n483823277\n2916058559\n2019560667\n537565199\n2888761\n425449740\n452912754\n2019560667\n49129317\n541878024\n541878024\n541878024\n7043987\n80943315\n2102291903\n252962019\n469712321\n411983672\n671816164\n52465283\n52465283\n132636124\n469712321\n104852334\n1133693328\n523347151\n252454610\n796373909\n208052841\n15160845\n1447873507\n125193796\n125193796\n6239272\n651026807\n218320781\n218320781\n256428094\n6639597\n218320781\n1231294\n1377869692\n733855085\n797858045\n1740463165\n218320781\n2488298060\n4787355\n26122401\n220384045\n677000012\n1160021832\n1508907\n1160021832\n201769002\n83620682\n687080240\n616819216\n486971569\n95539024\n99922952\n95539024\n108972900\n31163802\n684822219\n291138270\n793949237\n793949237\n354261829\n3868581\n83723430\n823220442\n823220442\n823220442\n90112752\n8541302\n91881826\n60990411\n60990411\n60990411\n49922240\n823220442\n19076960\n491376524\n60990411\n645970736\n1331953869\n5652890\n1053678519\n585307680\n23195040\n448090250\n538173798\n43977518\n216427341\n216427341\n216427341\n662999486\n407263481\n809412741\n174782103\n692191633\n189921959\n172004979\n110710435\n31756102\n589402284\n248751665\n173339992\n248751665\n843831244\n49085999\n549835853\n843831244\n579417600\n49526163\n9726893\n291298198\n755673267\n11236525\n26516136\n655950559\n655950559\n655950559\n1127475771\n7387715\n1127475771\n234468633\n740583366\n21027975\n418109127\n1881246\n1212553943\n124264098\n7674041\n180500113\n10149337\n81637250\n318508735\n614060604\n614060604\n1542980720\n1542980720\n21027975\n1068432087\n108307125\n180210810\n1068432087\n1887965831\n21925445\n53109773\n17889170\n1716505176\n1681248005\n1716505176\n7525594\n455073450\n809113728\n98264263\n809113728\n809113728\n32883693\n517550226\n809113728\n461553464\n335450670\n1235615362\n1147309946\n24727523\n1489451655\n9832090\n160412815\n12670938\n1489451655\n177520069\n242302174\n2320706534\n233990041\n320463\n268567787\n713497399\n626170\n1186910895\n43557597\n291672064\n27280784\n1798014892\n527013672\n23787184\n191846364\n220803706\n2540495941\n66695676\n220803706\n174813288\n58261920\n163054082\n133040724\n562018683\n597029291\n2401403744\n111786401\n2401403744\n147774311\n73226232\n344065130\n344065130\n867727206\n421030970\n911794134\n911090533\n392355802\n392355802\n23481947\n157354453\n848819729\n474331655\n848819729\n848819729\n137593670\n13948150\n508118002\n231303491\n6974391\n553195141\n949976217\n420783135\n27908821\n590078782\n1369227252\n735466180\n312021414\n63067073\n213948012\n194868416\n343478227\n429823132\n23018898\n3095616\n75700911\n222154745\n1239103451\n1309923208\n480014516\n12180484\n685477652\n685477652\n36869510\n21827804\n1190455440\n429823132\n34685562\n12148872\n429823132\n1190455440\n55187285\n429823132\n1520359654\n800756912\n304544607\n68420830\n513779677\n22043246\n134692313\n903574912\n459411999\n72940918\n820208427\n2729512823\n441836743\n156735115\n147057550\n276056190\n972247516\n100798588\n526604978\n48903314\n972247516\n972247516\n972247516\n160688549\n272269038\n160688549\n271726115\n160688549\n111726918\n160688549\n160688549\n26264159\n160688549\n2490607690\n446171869\n1068077407\n579572474\n165297703\n142184843\n14675421\n2101465392\n1406917805\n151191604\n66149897\n2607135511\n233696467\n135814186\n632588149\n207699090\n2147411219\n2510346071\n3479587330\n4021420231\n40400076\n4244582722\n545361819\n271746907\n132073819\n30040115\n744136178\n123863281\n4215661806\n39563893\n576984104\n3963225764\n576984104\n655978182\n156321278\n2733416149\n576984104\n578202078\n579657458\n3276957531\n807034182\n99168292\n35350437\n18091067\n4297854080\n7702898\n13228157\n27885302\n298753449\n32079309\n7702898\n2444865590\n22048861\n246711849\n246711849\n206384202\n164959957\n78646088\n93540667\n252017302\n252017302\n94822520\n199993627\n674168092\n252017302\n538869351\n33527733\n252017302\n355077065\n838458965\n128380810\n222078491\n2491067749\n2211605086\n2110016777\n3536925568\n901299124\n1145389\n1435\n10436807\n62906173\n252193406\n133076181\n22078293\n515911148\n157825805\n80237865\n857325549\n285908531\n2101088\n360844304\n146669051\n721729741\n368077166\n433741051\n438949377\n607798828\n901322350\n24115778\n941804843\n546361393\n782977499\n758547576\n447901969\n1305501813\n240658716\n1610781968\n54719104\n88023050\n140921025\n165779097\n8442329\n140921025\n369493973\n1188549151\n369493973\n53681079\n17827679\n579954407\n298462556\n369493973\n1542089320\n461480939\n21399288\n2559036\n1268555069\n548264724\n592039272\n141559168\n238909166\n298852415\n2629369040\n37395254\n1247749705\n59493816\n475798786\n538542883\n286906142\n37395254\n3185813023\n37395254\n37395254\n368025836\n398241914\n331660146\n331660146\n396212940\n37395254\n33756078\n4543754\n258962089\n146128848\n1821184856\n258962089\n258962089\n81402192\n26051465\n229566205\n988042150\n26051465\n468007224\n214894795\n653210403\n988042150\n988042150\n697434408\n1349509592\n393503086\n11362692\n426754416\n311798331\n542553876\n1349509592\n46175874\n910363195\n183934448\n1059275387\n14057655\n1024413\n1014864843\n970563579\n661523047\n626912876\n159793408\n965195771\n57737133\n68580752\n362198346\n449042028\n899427736\n11663668\n427280201\n1663538558\n489597663\n387644101\n5246063\n214399336\n94935154\n206464802\n66912668\n66912668\n86890162\n290174888\n572427405\n311125968\n6956299\n836872941\n312437640\n452667059\n170565780\n302500032\n836872941\n453384990\n490612662\n512219821\n460065111\n164848466\n394001877\n246211590\n185198160\n152573749\n185198160\n6713258\n937884296\n60283214\n1197440155\n2318951981\n1952966875\n96091465\n673803261\n78668738\n187167705\n1089374429\n1089374429\n78668738\n348963352\n1615104077\n1089374429\n673803261\n721507921\n78668738\n42765477\n260674637\n460611711\n343804261\n465350601\n292397972\n680378532\n187602454\n674765855\n674765855\n15128924\n674765855\n297955059\n169758707\n1350686631\n800339042\n730030397\n1350686631\n666651656\n674765855\n272827547\n313297901\n2864230130\n84714289\n331194641\n240999240\n2940378363\n454899\n20961062\n776379611\n34712297\n509131835\n614214777\n213108954\n81128175\n195334952\n338101348\n479735833\n737845039\n225179411\n616036322\n78683227\n546907899\n570142395\n88386097\n163130036\n77340758\n700448594\n177017032\n523639099\n902454463\n897984468\n897984468\n577703741\n897984468\n148079229\n210286548\n187058350\n14459504\n39806394\n32065221\n242988946\n14907968\n298966620\n293327355\n298966620\n30806120\n33628869\n98894987\n298966620\n44187829\n1237883949\n1237883949\n88471599\n1237883949\n458521562\n89862467\n57935842\n50750374\n856712424\n108117409\n301329737\n388769220\n836109876\n585093964\n135369027\n523857054\n422112425\n836109876\n116971691\n152009600\n1475764005\n1481490717\n140414899\n809555784\n3691339\n841836588\n681123540\n159084346\n83097495\n27082722\n94284427\n758015049\n592457623\n73809788\n423848382\n23485349\n423848382\n93447345\n539118640\n18493614\n92063168\n271818994\n271818994\n590005380\n190422816\n207483108\n1042796310\n1396096490\n1514683024\n339831516\n482522354\n293836911\n288455998\n1860074767\n1149099188\n896345874\n492725268\n3398514943\n665883228\n286236008\n44318175\n44318175\n44318175\n370350082\n885194406\n327911274\n556975775\n311163110\n645644981\n32334312\n364597555\n470935279\n971007411\n220295292\n502873093\n396798357\n887014894\n887014894\n133678295\n917613280\n1670949879\n917613280\n178377700\n199412544\n1418551100\n1096016207\n720760477\n720760477\n1357276150\n601154300\n601154300\n720760477\n839009745\n730438883\n839009745\n15852193\n720760477\n880731240\n45634434\n1357276150\n800537388\n640210491\n246319691\n45108028\n527929818\n524239686\n656884048\n656884048\n17200635\n275477691\n736332715\n246682973\n358264889\n127345826\n1409029376\n144674556\n122655699\n686778498\n267834195\n383883034\n736332715\n173685670\n1546953862\n8254722\n240092446\n1099496213\n482079763\n28196632\n138558721\n52010909\n393273633\n1093596378\n752692965\n971679\n7434809\n1020626003\n200372636\n104330113\n1042918706\n114103761\n658889820\n1042918706\n384604780\n511319120\n529205623\n4680628\n1215271774\n72374040\n72374040\n621926851\n73278141\n73278141\n73278141\n571390003\n73278141\n685547165\n15984590\n159039865\n185541414\n87987652\n68687595\n54777501\n143204871\n26059232\n150569032\n246428302\n298752436\n715004929\n282644604\n1503286338\n1503286338\n1503286338\n51566333\n519503580\n309877439\n614235963\n182015064\n89826864\n59319688\n176971089\n54183767\n992078335\n43819538\n43819538\n327655898\n559475856\n43819538\n49809515\n730471841\n730471841\n730471841\n208505760\n63653654\n730471841\n730471841\n865484206\n632413765\n865484206\n820964981\n43100372\n19956764\n1350594529\n2261335262\n1474094100\n179308545\n765601125\n1474094100\n158198380\n977873129\n310473353\n67860840\n977873129\n494232026\n77043977\n78539429\n35810999\n457773019\n977873129\n525898077\n1493737351\n545218063\n545218063\n1493737351\n545218063\n663257835\n1573577901\n226068152\n1289932309\n660679917\n109804062\n497501455\n51203816\n34240698\n70608980\n172194328\n3958675\n600324894\n664028336\n188417120\n156873472\n109891440\n25823824\n600324894\n140473902\n6000407\n465801968\n309688359\n574940063\n573131129\n331916457\n574940063\n52362124\n52362124\n52362124\n614880135\n607123445\n553103920\n846170135\n327739550\n63160648\n911081245\n123901445\n41224553\n22132228\n94128342\n1289408183\n376356783\n574940063\n1289408183\n515462323\n478593008\n315628364\n537594514\n384322453\n456702796\n666910548\n666910548\n125119168\n351790618\n313774309\n195195408\n666910548\n5299064\n340421343\n381715536\n210050137\n112690739\n25880341\n1272965093\n1711202192\n65303445\n1711202192\n223748941\n885070305\n16328123\n465387720\n4593207642\n578591100\n1243744\n87096658\n9627875\n183754928\n274485327\n122367611\n504384512\n27207635\n22526499\n113495885\n472309274\n27207635\n1278865498\n465824486\n456652470\n1278865498\n251416677\n1278865498\n4760689\n211687182\n46232835\n18669863\n2520401300\n687329616\n274975766\n64146674\n1252122\n2269707474\n10881888\n191980256\n16272773\n190948424\n637142571\n190948424\n367864065\n766988313\n634891522\n2430813872\n850665755\n230805461\n23196105\n75703142\n110047657\n1771096541\n1429663049\n310724642\n485760404\n30995792\n1429663049\n521159246\n83949912\n284447192\n883907132\n883907132\n52175904\n883907132\n115727\n106835814\n169344924\n196935039\n113800313\n1133792\n73620832\n381125480\n119124862\n176585726\n270758306\n11333107\n40941927\n715201012\n731161358\n16456888\n192518394\n731161358\n567539798\n1209345601\n10517798\n1209345601\n1209345601\n1624868728\n399946979\n731161358\n39688702\n2727728158\n79697838\n2727728158\n24065355\n2727728158\n2727728158\n2727728158\n1497946239\n2727728158\n10982516\n1618792\n37428120\n58513749\n140170601\n2083806\n310133947\n4526166\n665676224\n138791719\n709318655\n621543581\n22363478\n1432911474\n143464070\n78018023\n251632725\n224507823\n787294303\n58026310\n68163967\n1695597627\n888966642\n1539159636\n2362337863\n86264120\n818284089\n55688209\n257477818\n818284089\n95793912\n908256181\n91214230\n23866801\n174127831\n107307632\n22946761\n35188260\n22946761\n546212364\n1264924903\n401503232\n244044731\n455879587\n148765276\n46614608\n141315968\n518445894\n2280967612\n455879587\n382088175\n477742754\n607240047\n146089318\n1085732353\n74749343\n11953449\n112548647\n321643613\n80609143\n80609143\n344914711\n405960853\n23933282\n380989750\n1964391619\n817399664\n463614342\n197188751\n692484399\n256528189\n100057796\n80609143\n619172087\n128615968\n619172087\n474745030\n817399664\n817399664\n11220245\n776286196\n392548937\n619172087\n28902342\n727544093\n349242102\n251469153\n251469153\n18128456\n26706566\n151926293\n228870726\n619172087\n1030867528\n1381964250\n436311818\n634843164\n155377944\n246405523\n439048611\n178344450\n246405523\n246405523\n29220718\n90252913\n898061815\n317142716\n898061815\n2065999592\n119599254\n226670811\n9999658\n790075897\n47856529\n347345633\n18256372\n80878670\n829908197\n41146664\n42146614\n347345633\n1013357682\n448040024\n275924819\n167332844\n22004177\n49701702\n444638936\n863329294\n539972231\n539972231\n539972231\n53848571\n271893263\n29407354\n409243874\n539972231\n279091294\n70116769\n3102545\n48739512\n79596837\n816559912\n1639117136\n274622306\n1200016694\n62260223\n642247\n539972231\n788538010\n208940622\n249411394\n249411394\n40577206\n407344433\n289299935\n9443311\n262126285\n262126285\n772389076\n117536549\n90872582\n249411394\n38375748\n603887563\n3924677\n1268497736\n383996661\n481919935\n481919935\n383996661\n17052585\n46099796\n903231518\n30312230\n470984825\n539106707\n8650814\n917232537\n486661322\n410697249\n572069071\n230312997\n435867073\n435867073\n53079433\n7659274\n97882572\n52754775\n577486188\n319707053\n111584012\n1698060427\n712582870\n222160632\n712582870\n272079501\n709261398\n174860035\n308910969\n712582870\n240726496\n3232227692\n3232227692\n132452733\n8836584\n194333116\n35205437\n570964402\n135528845\n4248896\n22399970\n29567641\n315069301\n1034016376\n1053238189\n802038839\n1450073692\n35738504\n1053238189\n1181764447\n1450073692\n4120113809\n528942983\n382113086\n1351912971\n1450073692\n1053238189\n337778659\n867266707\n242178113\n44006771\n7175023\n2036633694\n1360594271\n329260465\n802038839\n882355322\n102750245\n882355322\n113208796\n721338232\n202239600\n11861040\n23490197\n1629125467\n4081238\n309256500\n336889170\n1666287373\n705197536\n156765496\n2288476795\n1157147679\n277810493\n2458\n717229641\n432845631\n131320918\n28696060\n150804574\n492171168\n24772847\n1715293\n403794255\n285167199\n570768679\n73921305\n73921305\n291759386\n837636122\n91968583\n2458\n387777088\n492171168\n807793969\n1161303570\n1161303570\n9691248\n615515164\n792779520\n52716469\n811322304\n815030322\n88230311\n239427583\n425839932\n322305460\n320771664\n549683118\n746562188\n549683118\n77767876\n549683118\n230536721\n208684320\n299273372\n591067708\n322393880\n3333\n347716168\n68770080\n324080493\n826493249\n49565860\n97988493\n95644326\n540870190\n658805467\n37672026\n37672026\n1306876360\n1306876360\n499099479\n50432480\n1238618518\n75169443\n30059928\n1056722753\n1356777825\n154246347\n41609829\n606587864\n61992533\n5493952\n16026058\n107810184\n795431280\n42486108\n461923109\n90807544\n118333923\n118333923\n118333923\n38522066\n118333923\n118333923\n35986403\n447133974\n440476406\n758477789\n153400273\n317720009\n1858780116\n91516088\n20722075\n158109979\n740952433\n259096842\n283005512\n534813396\n529890307\n1058946230\n36982246\n137845582\n1038264346\n550572191\n90887866\n7438569\n616344329\n217712642\n14327330\n632767447\n632767447\n70986222\n255094401\n475132900\n295480389\n48770082\n382435452\n93377685\n322310028\n39277284\n47820756\n39277284\n510188380\n510188380\n510188380\n510188380\n55733072\n117767466\n75424768\n47753205\n2617336\n135024691\n510188380\n171984990\n1058946230\n47820756\n197899297\n228139556\n811562873\n811562873\n249873321\n1247372260\n271777757\n52688985\n122922286\n697984128\n301738530\n1412213632\n416835584\n697984128\n13861644\n520863118\n967670529\n344882446\n407766735\n336448513\n421259404\n43657925\n326710064\n120997835\n1783505471\n672168766\n497198938\n96231528\n375787023\n311929820\n531627040\n970663531\n80155289\n714388306\n265093393\n80155289\n394197111\n970663531\n210786990\n864186320\n94024862\n435830221\n23123001\n91034166\n40715612\n444559514\n23279784\n444559514\n91034166\n291851285\n173396603\n444559514\n318174741\n505393905\n76235360\n948375096\n17713040\n1110228944\n589647690\n748990890\n465408143\n756703596\n465408143\n370746914\n707558039\n232539069\n199730146\n451673831\n461403217\n2661137\n78754527\n850622169\n215931936\n7315660\n925064863\n1674819420\n57420324\n73332933\n204494270\n688109681\n688109681\n309825623\n586702504\n611047334\n147860318\n46093199\n108470443\n102127259\n265521264\n25108802\n410628252\n173910180\n62088810\n215720964\n400997268\n308391912\n235543119\n87292402\n3963013\n349873136\n803115292\n270734406\n245805847\n72310643\n1184473174\n947821941\n947821941\n850913669\n1663865242\n379103529\n186373782\n107465425\n62920553\n218204620\n357560898\n70133888\n414648029\n123699934\n123699934\n315656554\n529812742\n20621957\n534391424\n38834859\n745524530\n19977013\n123699934\n123699934\n123699934\n631089218\n160531636\n3278048\n511693590\n12021156\n536483106\n815926301\n815926301\n815926301\n765587059\n317199353\n20291607\n380121362\n186320522\n464122395\n226669604\n56507275\n502338818\n74393414\n2315645416\n1836315675\n481571523\n96719207\n125588988\n481571523\n532999230\n148956246\n29708474\n412513478\n412513478\n260467101\n462767\n22173991\n189640404\n98487692\n189640404\n55431566\n715076993\n538542265\n715076993\n9097357\n1310721112\n1310721112\n716942569\n512091811\n884096247\n474284055\n1312015517\n55543994\n359516833\n1937889360\n49853050\n627473225\n368984817\n195399721\n90063185\n8064206\n3267616513\n3162669971\n31356543\n309311467\n800240533\n800240533\n19987215\n370454397\n1548214171\n1840653962\n1029888524\n1646212639\n221778920\n259772454\n55493382\n1189021256\n446421889\n106333686\n39559290\n86636490\n171832281\n2756948111\n483212824\n923933882\n2864222856\n2501662663\n109869326\n483212824\n85881348\n529249363\n504063335\n868065537\n1253069630\n868065537\n203566147\n1637922343\n182535424\n381015218\n55783273\n381015218\n1361139138\n1865598773\n381015218\n29587972\n138570615\n397490546\n182436507\n82730096\n31688710\n588749176\n516348426\n570949080\n31326062\n199814717\n1336083067\n2393392104\n1906535742\n2496251449\n1297079403\n258540517\n258540517\n13850300\n2937937\n261177713\n933016028\n56148022\n270357604\n28573176\n163592968\n163592968\n163592968\n339503821\n671244115\n201878878\n221297720\n183622530\n185310887\n431321126\n1010659397\n72115782\n716656428\n333764475\n355980410\n239142199\n338454536\n305291031\n352079130\n8637836\n960067391\n960067391\n92796359\n181415501\n55743500\n240323328\n207049248\n19580484\n172652067\n187588407\n206193432\n206193432\n187588407\n1714801869\n893947002\n1435675222\n270973988\n363141844\n785325006\n1125075977\n17387202\n30449383\n240179961\n1897359907\n1897359907\n47419004\n47419004\n47419004\n380991338\n420325478\n703155756\n519346923\n1664211092\n1050716569\n531176478\n1269723081\n1222308097\n1878044849\n1191430528\n4577377\n2404681472\n436822851\n3257561\n332829691\n4066459\n4066459\n80968276\n80968276\n304376163\n79709716\n680196303\n654015546\n1399263365\n79709716\n283418012\n117958615\n824957535\n47640680\n503123042\n503123042\n891125691\n343145458\n163301123\n1938913386\n1938913386\n92004288\n432258652\n806151315\n425834413\n2398523\n43183535\n455063765\n21228780\n393126875\n484501165\n404808103\n31011224\n1275671666\n228844739\n8630388\n15345677\n391799970\n391799970\n391799970\n270866763\n1209045305\n21428353\n487617492\n25611525\n314498220\n125048512\n3785120\n143135525\n99383948\n1421347719\n900198222\n460410623\n325674229\n907584374\n1373693643\n524219598\n748810767\n52666795\n517688864\n266041511\n1220725481\n86772252\n9312748\n491850066\n119327335\n9833414\n35213156\n98160016\n41403438\n287505667\n633654767\n125243748\n2061432622\n125243748\n98463776\n398379162\n586057997\n269380702\n509288503\n761636\n344871299\n198545778\n344871299\n965400\n47176220\n344871299\n344871299\n224608944\n3789736\n56714512\n85949728\n125567326\n164518259\n3060688\n638151447\n634839\n56714512\n200751002\n100281716\n37822001\n298083741\n32979768\n179623329\n179623329\n34846894\n699917894\n964846971\n174886602\n243772598\n590963092\n964846971\n362293536\n318631844\n569786993\n518542340\n591248504\n805232430\n272707542\n162601656\n379533825\n655844175\n520442871\n520442871\n502278195\n311915498\n1660019596\n52824787\n32494117\n311915498\n311915498\n569124019\n180605393\n863879573\n584966767\n26784353\n747604826\n77553586\n129328696\n1030047143\n32164564\n26784353\n337755671\n262587292\n26784353\n606297018\n67896585\n1440448578\n1096399505\n137401266\n204634661\n262200182\n1045783005\n816196724\n444925729\n1045783005\n379816205\n708362360\n325232744\n37412822\n10782835\n2588578\n375699626\n375699626\n375699626\n297061602\n2306351999\n311643428\n375699626\n2306351999\n375699626\n54137\n77380688\n389886410\n375699626\n375699626\n258086338\n171212224\n645957655\n108629888\n348812132\n557573630\n625683610\n11482926\n337613973\n2306351999\n22785113\n340336770\n42064790\n194518020\n2188726705\n166078677\n822326782\n822326782\n241515615\n957629202\n64139923\n24771576\n110554154\n238506620\n238506620\n128651216\n898688700\n238506620\n334920035\n79654362\n66822058\n927408823\n391517923\n286658990\n245063049\n27368866\n195181704\n310234371\n740018477\n15800666\n51448320\n334180006\n253377905\n560189045\n26747610\n4094058\n52359318\n26747610\n222907754\n14896076\n6763605\n37928601\n203142982\n874749804\n686387712\n686387712\n800561406\n337402778\n337402778\n187099542\n494857699\n798257700\n411643822\n173575670\n723659609\n74510399\n127161899\n235852794\n31123322\n994717552\n286398752\n252432835\n252432835\n17952297\n814895002\n3626782\n206906302\n678187393\n12532097\n253097955\n306641693\n654125772\n132468702\n839090038\n494563395\n487133460\n638309175\n494563395\n714076252\n494563395\n494563395\n494563395\n63447435\n1723440471\n1477373875\n507555401\n263772105\n494563395\n355187077\n500556787\n329898924\n21286873\n115707569\n365908525\n88615708\n1060461370\n83618848\n702294778\n52142845\n27164470\n1211808592\n357195957\n202898038\n212462874\n1211808592\n1211808592\n1833776427\n6576580\n46620864\n8252344\n671567183\n468441664\n1278962828\n5564968\n57406041\n748506045\n60276440\n245582804\n1201492023\n1201492023\n124241393\n1598139069\n1082637050\n655050974\n43823066\n1201492023\n23954271\n93495240\n182766648\n143905470\n641670681\n9163430\n1146984\n9163430\n104506030\n77315002\n392503397\n378942136\n626341060\n7685785\n88243887\n868093247\n698028698\n3079409082\n13354671\n133886899\n621195999\n296233018\n1118612175\n493781156\n636463115\n471631190\n353042894\n555040674\n218881699\n675295195\n108537701\n641744955\n80797519\n211612071\n10773447\n1002016\n1024883274\n325894251\n2761689679\n33307648\n2784036473\n25178967\n31215869\n400072982\n3127968191\n3975966557\n159269526\n486516332\n65435922\n877216553\n417738071\n1165618414\n429854598\n413071417\n192875975\n955912078\n1496214172\n188713755\n137687347\n1367103907\n318182147\n1721004359\n487596686\n554818806\n1309812530\n269690917\n61813892\n20036864\n97844425\n347443439\n178726176\n66097593\n700322487\n261434433\n234789016\n132167191\n10271007\n1758767493\n1109190266\n1109190266\n440283384\n375596318\n296233018\n1319709269\n649089504\n758313720\n596147336\n758313720\n216773861\n817329422\n149620540\n817329422\n817329422\n98421763\n480244692\n1114553896\n607582886\n316483328\n447602501\n502352260\n34111847\n26128730\n160250514\n34249955\n797182104\n651166307\n120630430\n162116171\n1124394827\n21632058\n247737496\n33708486\n1533927773\n406736590\n202723802\n247737496\n255955173\n524391605\n340049913\n340049913\n726222184\n9915475\n918163046\n1117210280\n1117210280\n812312025\n137570067\n294952621\n294952621\n294952621\n752689833\n209672635\n459535336\n672229404\n344336815\n486671611\n486671611\n486671611\n7877189\n382002565\n486671611\n13088993\n486671611\n486671611\n40658260\n713820163\n557658851\n599681758\n724175965\n1159010310\n446415051\n22952174\n36297768\n22952174\n171527272\n981272103\n20053515\n127717157\n509324301\n2211401819\n1346864830\n482584589\n511729143\n77210257\n1346864830\n210004439\n358562273\n266413838\n273079253\n29020336\n34869846\n304726147\n418778697\n6378584\n109760878\n724175965\n418778697\n890995009\n523043207\n113126718\n761161587\n2260834680\n413119874\n97488140\n4668709\n1188008689\n452703648\n761161587\n275135494\n301342567\n573732300\n572434608\n642905282\n83147616\n826104\n527171716\n572434608\n97086610\n602465803\n122098952\n122098952\n50317095\n3033787\n244882222\n344931143\n797680802\n260208889\n198248786\n272546078\n30033274\n2191868246\n663168553\n7492800\n1151558468\n1676486747\n1151558468\n754898130\n287933130\n623227358\n781890662\n781890662\n89249687\n781890662\n831143733\n1214880123\n26061876\n2809584197\n1419855268\n831143733\n370630218\n237548302\n19435100\n28997182\n47899104\n137024432\n307958728\n47899104\n10746020\n169362897\n39558988\n35069312\n72983146\n1180395849\n1132692145\n1785627147\n679119691\n375131409\n80413322\n90931080\n604775787\n1677985214\n160950131\n6918222\n426441515\n629563943\n305926885\n533732658\n184520327\n411404371\n69347033\n48611013\n943473526\n347059120\n943473526\n1077834984\n22071152\n43354610\n330612139\n115979310\n307808883\n172314\n262508672\n638859017\n640529587\n640529587\n429286892\n631374078\n640529587\n837667775\n15656954\n1184336684\n2271781602\n308562024\n306226230\n92403408\n2045595052\n837574025\n837574025\n837574025\n837574025\n868107932\n49601025\n837574025\n83518471\n837574025\n1509357001\n272580173\n590416702\n850539579\n1529890833\n705161504\n1700044695\n2667059779\n411363275\n2983288531\n29417888\n448514481\n64257605\n137718715\n43301093\n536731679\n570172907\n704571397\n1985094816\n523584019\n1750082105\n1985094816\n28644582\n1763211187\n1433856336\n1433856336\n188946899\n11371679\n313487309\n258354776\n126844775\n136467393\n2370831120\n99619680\n622452768\n44946533\n18914625\n1367405401\n446463422\n74140591\n807971992\n136926009\n45007970\n1018911842\n235696758\n9774050\n489513654\n25371660\n11098227\n495818628\n63806790\n1042879369\n2723138993\n143017160\n144210435\n511330329\n428248493\n5697959\n481374\n671863031\n671863031\n55613312\n277003907\n748399450\n748399450\n1303847237\n1303847237\n1227310818\n367717461\n31937282\n577964076\n11738456\n79347467\n226491878\n803406917\n33014256\n690229\n18432949\n3378467\n1753038\n43023477\n1034798892\n645682427\n1556800965\n638529097\n23506805\n1017871993\n9909016\n18462162\n134139978\n37843713\n397724822\n69563506\n877012\n5674167\n141183132\n248531000\n324691568\n95257532\n95257532\n607079472\n43832400\n1563713618\n182769653\n88439312\n772991775\n860503896\n319904\n266888640\n805772581\n805772581\n2627947\n1089575250\n110451336\n80462736\n1089575250\n455807347\n56485157\n929978300\n16995821\n144193273\n1033928362\n21451647\n581035165\n270953813\n1482878030\n282281604\n776637339\n1482878030\n96703997\n200123931\n451789741\n89355903\n3456397\n764873491\n337306301\n337306301\n234592019\n337306301\n11116840\n881734115\n81310399\n475370918\n41527476\n1328826035\n392544609\n2010562472\n440609852\n870003805\n356998780\n344753615\n523682536\n482089441\n358633869\n55646403\n425813868\n324844772\n9948\n647561752\n616085504\n927494538\n356574983\n594666389\n871316335\n960841875\n3347415\n1268412033\n781016639\n781016639\n81187370\n526970239\n3602551\n781016639\n53073197\n6803742\n749992568\n437198430\n287770850\n287770850\n344592830\n405206666\n287770850\n40330960\n1206750771\n351187590\n335060832\n6449853\n449017788\n1498540\n556635495\n556635495\n1338741392\n1338741392\n556635495\n935056792\n1332269420\n1591238769\n106488404\n182769653\n445664072\n149712075\n778879882\n76036128\n592451494\n1871470659\n2745399\n763432508\n1581864152\n1464604913\n432199948\n1047626406\n1009994627\n694883714\n290835724\n1288001593\n46553417\n58383363\n241944890\n376194162\n376194162\n15162355\n444731708\n444731708\n376194162\n830331507\n173327915\n534195655\n830331507\n1054976796\n354640430\n221085146\n1292164603\n375992628\n865370427\n1069806698\n120714080\n1292164603\n599213664\n1292164603\n97509118\n381767564\n1176453427\n39977710\n3087139418\n563109463\n255673004\n563109463\n563109463\n396025757\n121084131\n17863587\n1413159995\n214958423\n106758129\n119812\n337274533\n741010687\n200921144\n2517347875\n9637435\n1086298356\n2517347875\n2517347875\n30507116\n743463770\n4554886\n4706724418\n67981004\n540485571\n1577572254\n183424234\n1812886449\n48470335\n15911604\n522780045\n449841376\n314245044\n637745221\n860281386\n860281386\n956978682\n685257635\n415848058\n1045560131\n1142257427\n860281386\n102305264\n66479619\n540774068\n540774068\n6624081\n2444134\n466678217\n191404468\n486081395\n785555466\n191404468\n26944445\n8953121\n414225565\n283709100\n77319290\n39045393\n192922109\n742466153\n181577286\n742466153\n57775544\n613286394\n25916\n355291123\n396666836\n610852620\n137445717\n1501187043\n1836680553\n754439461\n166512789\n624099847\n235262928\n167800164\n65904053\n1502812177\n657290124\n101797347\n744326902\n678338456\n199147523\n220035017\n19695379\n49979808\n70245797\n484642097\n132867168\n7447375\n172747023\n64831850\n35757265\n126652709\n1012283230\n93154981\n865252805\n559231625\n383295996\n12008801\n8520850\n38127778\n53905634\n80378346\n1085571505\n958259778\n438868672\n1448823384\n1448823384\n958259778\n1448823384\n1448823384\n898172219\n1377678\n698995665\n26591469\n1411788738\n898172219\n1411788738\n89657275\n202266021\n311664240\n409976379\n11570674\n817193851\n383076443\n197173133\n778605346\n12355815\n778605346\n501389289\n2248628770\n1274794713\n802263653\n1368927140\n1886498094\n802263653\n262729432\n1351142949\n67809819\n227779758\n1451206823\n18068566\n3815592840\n1786575824\n2295009785\n39602859\n11234515\n159339821\n240114420\n98834822\n76414354\n886949126\n886949126\n355063372\n886949126\n596039168\n874383220\n857570182\n30251992\n1113258295\n1542781805\n192382713\n235233931\n840291629\n52850597\n98283253\n414883335\n840291629\n48526605\n192382713\n189592277\n47701754\n24751097\n1223562389\n377207898\n57605720\n86003\n1875531242\n1223562389\n826631533\n595488272\n167553761\n1699465945\n350750243\n218361405\n273792128\n658181596\n85094716\n1223562389\n700436392\n700436392\n704633690\n704633690\n3809596\n1223562389\n243930485\n224199229\n649444815\n649444815\n641793239\n115211840\n1082931356\n259975270\n1328781338\n1429148986\n124691607\n551933524\n551454176\n323503653\n548693963\n141152717\n149678100\n559160634\n1566169920\n5419867\n155218087\n414881905\n172535206\n1566169920\n1582121479\n47534779\n432232810\n321227862\n321227862\n42882426\n198520768\n764565693\n321227862\n73196833\n321227862\n527604802\n18909675\n321227862\n321227862\n73196833\n136593829\n220136740\n339764483\n78919592\n3043859\n47670356\n49184911\n182244598\n398621411\n32168266\n32168266\n55445773\n52008526\n29496752\n52008526\n686722922\n52008526\n52008526\n146466\n165958645\n52008526\n52008526\n259807359\n603867360\n562545\n476403975\n603867360\n603867360\n603867360\n603867360\n634790928\n634790928\n11540\n847978828\n878902396\n104178454\n129374237\n32740708\n160832617\n602724680\n21345687\n17663924\n805501477\n459254\n634366068\n684055956\n367910526\n131502892\n1902673620\n36756296\n39836271\n434305050\n1499787515\n1499787515\n539791449\n131502892\n234774151\n1700434122\n216146528\n71044389\n29394172\n229135904\n54273100\n182610103\n71044389\n189502579\n572704747\n423285504\n381322914\n1863489539\n183666520\n163298858\n59629502\n379685655\n715031581\n2567087316\n154533542\n386209609\n744073816\n2770252720\n769142384\n175190835\n254404199\n407228021\n1380081\n740759452\n6349078\n1477228383\n464607169\n96702452\n2406676393\n1910976214\n145201277\n3648418851\n564856320\n9811839\n1038228794\n815001627\n603480092\n706270001\n706270001\n706270001\n838939173\n706270001\n769365346\n246185617\n499461397\n706270001\n769365346\n304716686\n21511351\n11340092\n204507397\n234216202\n216940255\n592185816\n550977486\n903590896\n845684535\n382851455\n196288978\n165646342\n13650961\n820422941\n796309287\n656720709\n796309287\n774861181\n774861181\n54661298\n120549060\n1085964835\n413539953\n175320398\n555235913\n312179446\n8011611\n1318617486\n1300864896\n77967795\n42388257\n369932519\n51421629\n369932519\n176622934\n2683931887\n178779709\n215836883\n184358549\n12420958\n111088922\n317552263\n737271703\n150107648\n111088922\n425372372\n59000156\n186940354\n60423614\n91726336\n1120860767\n2799970514\n139705269\n116452802\n705764617\n89910208\n182569906\n323282195\n605228202\n3110715047\n268717126\n37112959\n126130508\n583506216\n212124138\n338845120\n230585695\n1349741510\n1349741510\n271933320\n258342282\n208042344\n32305801\n27931787\n636301939\n463757852\n118290571\n463757852\n204787478\n1847267752\n35625606\n1050487587\n289871670\n465358501\n7616035\n256796555\n10817861\n784619827\n784619827\n37085814\n1656814073\n14336455\n598392984\n83020268\n1188512995\n1444753961\n78914621\n110761712\n977436503\n181748888\n95790112\n1054569147\n968530140\n336005115\n1884930302\n160901080\n508997517\n4702751\n1884930302\n341223623\n335885118\n581729690\n345058626\n9961523\n1425362320\n644645434\n377814364\n53778057\n63098953\n27996500\n73588366\n825971472\n73588366\n973605140\n825971472\n14757931\n594572705\n1124013797\n826822914\n8169623\n81953113\n825918053\n825918053\n825918053\n825918053\n846851178\n1296892860\n30187890\n639316566\n5471741\n25601789\n80993852\n49542560\n123580015\n436296982\n20065472\n1673840555\n426397703\n436296982\n755430938\n952371749\n690874534\n36045938\n62186022\n72037323\n24310193\n755755934\n755755934\n755755934\n367973098\n1096534243\n2433047518\n1607162756\n653452225\n1229456355\n109936403\n803338170\n251860470\n792919303\n682688210\n694812064\n590790879\n694812064\n694812064\n158847501\n694812064\n10353624\n846434137\n864270056\n1601687305\n33167801\n60635651\n805952129\n805952129\n366538492\n78557725\n85806113\n819198431\n8560164\n154609718\n1382050134\n819198431\n9144514\n17514038\n39395448\n471479184\n1382050134\n1382050134\n1148484586\n718936296\n31890625\n1382050134\n62234619\n114571636\n1958107851\n668217544\n395323369\n813846901\n813846901\n1723451706\n362057012\n108711208\n429381692\n625821368\n16374614\n482928322\n213380379\n314230092\n356520902\n117216012\n399338598\n257949342\n384015374\n840614297\n193341494\n1870498160\n8495049\n2198023062\n322313863\n391483\n587663300\n73059045\n82288144\n506930110\n418395119\n1752\n637882816\n361419538\n71924131\n641320296\n251082065\n410322278\n390094011\n267193191\n189742872\n71924131\n991910708\n117487189\n637297637\n701415401\n76394502\n1012512052\n136041895\n94531472\n94531472\n204470534\n701415401\n234167521\n136041895\n37285710\n519592297\n74078569\n503440748\n544022143\n544022143\n981818653\n693862520\n147706926\n693862520\n121153815\n693862520\n2954461\n806461092\n693862520\n439850012\n535594000\n130784039\n84452784\n641105641\n723234307\n314710921\n321714872\n82832753\n1697565402\n501801025\n47231767\n188755805\n501801025\n13787657\n501801025\n443733076\n501801025\n387896355\n126293664\n228643301\n81637984\n132706066\n209179536\n142958440\n862477882\n49764112\n32554327\n186003536\n890893314\n1448690389\n4163894\n1164730032\n228643301\n773792716\n1431509616\n90429609\n9410372\n857430158\n857430158\n80162888\n178475329\n265527000\n84025297\n809350620\n407280727\n159117806\n489243319\n65669403\n273674244\n489243319\n489243319\n489243319\n788182189\n1035503594\n185076876\n237886628\n750089169\n682771256\n1035503594\n256984162\n932820960\n492318815\n105043788\n932820960\n297370919\n160146808\n109539749\n740908601\n67831428\n70546148\n257222566\n681537935\n988077045\n1035825947\n1035825947\n297370919\n513499232\n1652848524\n222207568\n222207568\n2010818\n113886018\n169921856\n222207568\n222207568\n489339999\n401990452\n222207568\n9282378\n165596607\n204958538\n488671144\n2383169442\n95782695\n1481866597\n2125072073\n51732300\n1481866597\n2344520735\n622472151\n391209038\n684060704\n684060704\n12359624\n1481866597\n2973541\n19408460\n719485407\n20493469\n70396332\n398019415\n1144124079\n379104548\n88501524\n592135667\n136679416\n888798763\n25783028\n67527245\n351004061\n5817825\n237864785\n5817825\n6699290\n209433215\n474241785\n57798661\n143810742\n124421982\n284124521\n14829868\n42245193\n152329969\n230686521\n1166371276\n902806208\n335347803\n821692118\n749823987\n335347803\n821692118\n1268676674\n1268676674\n164713278\n168958678\n14170451\n48129419\n75106445\n127360078\n38609408\n38609408\n150397958\n38609408\n38609408\n38609408\n63137997\n66017180\n100942283\n31240610\n290555461\n35641457\n545724509\n290555461\n290555461\n1142989257\n56509531\n789020404\n307888823\n307888823\n37840743\n68373471\n730588372\n45356688\n1235780153\n2195354004\n290938919\n1344419444\n789542815\n1557613177\n34976960\n664126086\n176777991\n295183532\n54475604\n2755564039\n2672694885\n849332227\n374994554\n176006296\n2599208\n243741494\n988694015\n649398172\n179668042\n109192491\n859279228\n158791225\n783215942\n812989032\n812989032\n20059233\n1733397658\n232430953\n217147882\n627935528\n64731426\n33607627\n128160243\n33607627\n274223647\n198769605\n422181245\n716982648\n449342312\n235576241\n1546510436\n489233344\n225684815\n1546510436\n237693144\n67719454\n2515077992\n194857848\n126743616\n1287500017\n944107281\n1225845457\n14446863\n2227457841\n267063803\n144741961\n20222129\n77886156\n2732395350\n207555528\n4791012384\n6048296\n36035528\n12069205\n679316989\n47005218\n833734379\n120940806\n169630801\n790542166\n100917769\n169630801\n1662808\n6255956\n588356802\n2123971906\n625780888\n736404598\n2123971906\n34266404\n1805854656\n4319451\n1816546573\n392205441\n1805854656\n111453703\n203761269\n262233294\n356025561\n422764141\n356025561\n214844937\n625741097\n69030720\n206747846\n147482225\n45665663\n25379640\n1402633498\n27697698\n81737128\n758223277\n230491385\n230491385\n592964238\n81737128\n798936575\n112926345\n278688709\n2322263939\n227085753\n2325435394\n1396494978\n183003568\n450934813\n94903116\n823058427\n510586333\n2503756888\n76886599\n1156456584\n67663514\n612138706\n444762959\n489354490\n15697348\n1440052126\n12474488\n366273862\n976706844\n55119123\n2518575174\n122111953\n113222504\n221942776\n11773608\n220104689\n282751421\n309264925\n278028005\n96224928\n9907483\n64843762\n95755641\n553677287\n2420261188\n81533996\n755123182\n1123897780\n4246839\n3154649947\n10329649\n7726208\n380690358\n65368935\n193371129\n1278677736\n499026322\n66193991\n703689311\n752039677\n112601091\n53763994\n673665589\n2115297807\n651442131\n7810958\n757859249\n11556887\n623551859\n357082657\n14843721\n462747053\n225978495\n9589887\n133919033\n8211009\n28579368\n753690903\n759392181\n12166327\n1290853152\n425091082\n196197518\n198198584\n165947959\n199226283\n370376197\n40224675\n877454210\n139162984\n133481490\n715256165\n1716850128\n236746567\n18577058\n877454210\n851611720\n20173589\n1215095944\n851611720\n60653823\n851611720\n1333446481\n48850634\n314380307\n472781516\n85292818\n690101223\n1542311854\n916489608\n92404212\n725479448\n245646904\n71352548\n45324507\n97508493\n690101223\n788191668\n1630849392\n82017923\n718985060\n404444883\n117074805\n788191668\n45764896\n788191668\n398696713\n480911474\n11088599\n693188613\n577631862\n71352548\n54616590\n21201464\n577631862\n2672399265\n21201464\n21201464\n305743443\n251432390\n591831579\n136214010\n34027520\n311212978\n1166548283\n481604616\n311212978\n33546969\n372450516\n828212430\n243022292\n167604278\n329662429\n692159138\n1777781873\n819631868\n299977600\n536382436\n1811960221\n54660382\n3490835\n41730201\n85673780\n1549952337\n324800544\n570145106\n570145106\n570145106\n570145106\n570145106\n12115460\n57044422\n295660272\n308249427\n334050460\n1865745552\n92003848\n256885827\n10490644\n1241231956\n288655739\n114059710\n109715425\n3393003803\n128149476\n37271228\n41139031\n35485343\n5538032\n240211847\n297690857\n843181223\n32200397\n1202045409\n453681810\n807708\n461446717\n102521446\n91012682\n188638119\n1442961651\n2391588603\n418681970\n317288666\n33775807\n37563600\n5814080\n43916661\n7102629\n118855583\n33813830\n418681970\n844385001\n587084987\n398659708\n257487254\n15557528\n35752478\n535714283\n43211018\n382660266\n146812\n382660266\n59292723\n102066439\n41285057\n8696360\n382660266\n1304140955\n150700212\n42917989\n382660266\n812516176\n180983745\n573971492\n480808805\n902744332\n790981290\n1090876781\n570792715\n292732552\n128176471\n585148225\n510986295\n226016291\n253989111\n63292276\n122100456\n323472311\n60603920\n323472311\n657016079\n828338397\n828338397\n372689855\n287149537\n143876220\n323694064\n153362748\n80418907\n323694064\n99273509\n43094352\n526116398\n3009346\n9342699\n20610554\n194106945\n453424952\n501386977\n519827947\n35754035\n204033908\n650541488\n553672776\n392619399\n34300342\n11046658\n368244653\n302506380\n276121180\n8283905\n1808449\n219560005\n602289668\n654092148\n73244167\n410177966\n28151608\n73244167\n73244167\n238046611\n761992132\n840659946\n73244167\n1718441\n554302\n1530810882\n64015191\n1991156437\n109820979\n327775480\n72721751\n631304731\n61552034\n3014818361\n3738691475\n174339762\n2510699282\n915970561\n86992940\n112147289\n11828681\n4957430826\n98759721\n4957430826\n4892639363\n299785494\n120872602\n36160738\n6228366\n44450927\n326224457\n177238592\n100973300\n187736114\n452429258\n353017863\n2724126\n1257281135\n6642645\n77701552\n76535749\n275056198\n60266489\n338964393\n409929578\n71009822\n338156826\n713228599\n680655165\n24815149\n10468674\n336228373\n1714475814\n171973731\n8117018\n43346772\n117525133\n336228373\n163452160\n133780718\n217733092\n78110524\n37303631\n29862841\n37303631\n645952125\n792530106\n485135292\n614541532\n1590640828\n365680847\n46969471\n33221671\n91249811\n2616794770\n33221671\n147362989\n837803365\n304843948\n91249811\n91249811\n20167959\n91249811\n14808818\n1681403935\n484957195\n484957195\n956179126\n491990361\n190025137\n131629440\n182132796\n80259508\n123477525\n11732\n24187633\n62985234\n153070939\n598672359\n995675576\n202913966\n3342808\n78102903\n34980132\n641568\n187495652\n1461207115\n266899247\n164040365\n1120260438\n568127394\n461487492\n1197091472\n244722879\n1197091472\n825194313\n825194313\n243215145\n419091060\n197296938\n825194313\n528727067\n40411998\n804771120\n804771120\n528727067\n89721177\n1197415413\n462918199\n71269914\n439038563\n66898051\n21579556\n709619615\n15165131\n314657253\n175491644\n466099030\n481757077\n85908375\n308674080\n46320551\n294903298\n15538975\n138069580\n170312673\n293634891\n43405516\n33856984\n111153593\n16961924\n15975741\n374777161\n635466322\n974250437\n565730430\n898486312\n47032806\n104832497\n898486312\n1480580\n498637704\n236195266\n694720583\n364800210\n45763910\n1243900065\n667859257\n51530456\n36210878\n230548090\n1442135739\n1310772970\n1442135739\n185275059\n841702489\n58854075\n822554115\n1858906593\n364964906\n364964906\n27559013\n103728604\n9281575\n539209619\n310117009\n274751733\n1868390339\n1868390339\n663559448\n663559448\n9996628\n50996454\n50996454\n231124355\n353208341\n148294768\n471338094\n353208341\n62424303\n123342921\n353208341\n190415441\n19596342\n94348323\n190415441\n72988876\n135723453\n318192543\n176896025\n20559244\n318192543\n56415085\n318192543\n72139176\n266815674\n834861367\n911634683\n13791970\n1211381936\n103145507\n1211381936\n78513764\n204800997\n1637658136\n391159128\n834861367\n1036100842\n166359014\n28147933\n1359340351\n16817029\n541674596\n19976728\n458083865\n103439132\n87002151\n396587737\n396587737\n718418904\n385699681\n3713955\n718418904\n2031345767\n471049149\n227489801\n243586944\n64122649\n129625110\n227489801\n509161664\n5541718\n217255186\n1128704386\n221162928\n159372511\n1920524204\n329673075\n31134129\n2668337064\n881679767\n3505452765\n3505452765\n2948006407\n264320457\n274492598\n90670009\n2147177572\n3485113916\n11193032\n314713969\n2457049824\n2457049824\n4882633399\n78542598\n1566015908\n47762484\n268086381\n5930491\n146892693\n205185689\n619620704\n217308470\n619620704\n1399049770\n656849635\n124243986\n2559140594\n90819916\n31614602\n28314114\n384103211\n8675100\n105758834\n210668671\n384103211\n788018955\n489520405\n437532416\n422752572\n196519135\n819523420\n337870944\n819523420\n819523420\n321680520\n819523420\n23615354\n819523420\n1184137918\n217251913\n221548099\n365688124\n464305660\n24093239\n464305660\n244055769\n464305660\n18766577\n244055769\n258019657\n46998794\n58532984\n58532984\n583939515\n457201968\n474581556\n175751928\n487638150\n566146476\n192696757\n492017548\n11354909\n799187908\n128365804\n162162907\n1258679876\n609360637\n79746300\n601741434\n263648481\n74522211\n30539918\n652932896\n647515516\n457235538\n1125672453\n30464804\n1395982832\n221974611\n566805757\n227928550\n566805757\n10186173\n468950286\n4734838\n802066684\n429092922\n3410958392\n141208186\n427159703\n642223184\n256946345\n375314735\n721286810\n832913504\n143030073\n832913504\n459644950\n832913504\n832913504\n832913504\n147540615\n288628192\n1754225283\n726088321\n109042157\n831675091\n1382502764\n229791635\n1382502764\n460647138\n659931771\n1382502764\n3037\n206302789\n281583980\n506312338\n60810184\n4104552\n1137179248\n281583980\n276203326\n684923226\n272295592\n36298796\n135407665\n1271021346\n684923226\n25336624\n717501910\n171265754\n465065620\n722076656\n338819486\n892790735\n89111164\n203844661\n717501910\n28555836\n107903179\n39908016\n68760075\n462203599\n1816326977\n726004361\n1816326977\n577175405\n281697576\n2528980198\n2977021970\n241977993\n451295480\n65027588\n1255784\n282711117\n282711117\n24480163\n79136209\n693849451\n411387685\n285021206\n154130293\n235307249\n815915122\n181275602\n7161299\n16072789\n36140907\n1331424388\n1331424388\n668031084\n376414363\n58498741\n23084711\n32641908\n653932782\n653932782\n653932782\n320073419\n693695102\n693695102\n369323633\n618329516\n886844620\n618329516\n618329516\n1695145442\n19306634\n618329516\n1535422990\n29203576\n403161300\n80038785\n143499173\n1535422990\n20915152\n2385730791\n227212809\n1370682251\n387691808\n7590486\n81723704\n142852\n731785768\n6488832\n297626029\n902112062\n902112062\n58820668\n859207576\n821239145\n431799570\n821239145\n58820668\n26137280\n821239145\n205912822\n908410913\n17123431\n5189375\n7856511\n392217250\n610842872\n351704\n230375144\n78441394\n392217250\n230375144\n318131724\n427157162\n27032773\n427157162\n392786088\n67492801\n241564442\n424013805\n37014884\n37014884\n458860870\n68906063\n766340654\n1926377963\n247036963\n2176010003\n1545612329\n231190420\n155432730\n231190420\n17758258\n440418459\n252370788\n193710277\n2528505\n29155080\n299075145\n161347782\n668739877\n146234054\n322197887\n2528505\n128352643\n32783682\n535777116\n442750342\n58758026\n845858284\n321993170\n578789696\n197991723\n768011754\n797622903\n1378056015\n1378056015\n394511772\n313054017\n422022950\n565312991\n853482161\n36543334\n347406857\n95545102\n2671364\n504848179\n976732756\n129965248\n2919421\n1160743880\n754416921\n1254651958\n431626674\n1102866312\n3392760\n1113377\n12998372\n75347570\n75347570\n186134206\n155850010\n184447701\n31245498\n332688412\n634369355\n634369355\n331606213\n634369355\n338629435\n36386390\n634369355\n778610478\n2018687692\n28573696\n383354656\n60353512\n8009798\n648086870\n2018687692\n2018687692\n660066287\n415262190\n744177315\n861340629\n197884328\n884917743\n755019168\n34941679\n92967618\n2451738557\n614311734\n618283020\n688862609\n1761240453\n255427851\n754402321\n754402321\n431403965\n64868405\n2371047100\n699577460\n413286584\n42676557\n317151563\n699577460\n699577460\n324088997\n156202800\n15856270\n254320332\n253372229\n380460607\n2658018067\n1581399669\n2349163583\n1554899874\n2349163583\n200591467\n94000816\n200591467\n94000816\n110108080\n132636325\n198670\n904806574\n543798336\n113661908\n113661908\n1584082934\n633213442\n216174027\n797120048\n485257445\n424908454\n1187845816\n478028159\n362230\n15959523\n697811031\n138200974\n239999408\n138200974\n551627483\n197646085\n27391179\n367586717\n247147701\n247147701\n247147701\n4770756\n410532873\n715012655\n273523579\n364908684\n135731437\n1450322272\n21933275\n4015365\n96473356\n362419710\n35764383\n392608514\n470495349\n821323674\n35764383\n176119\n67010110\n67471385\n362985974\n85820877\n185222842\n7515793\n106308113\n37449836\n37449836\n370508448\n247488018\n232663687\n366653615\n101861150\n16655571\n999766619\n537146786\n2616389939\n99498466\n373421486\n328054369\n186923805\n521100139\n771739669\n1986794\n175792317\n1799780478\n45213539\n142569099\n1589048098\n92642200\n318447458\n173414782\n318447458\n88574990\n214908999\n10075712\n24225331\n386750379\n587656283\n13026\n870353354\n2316436545\n70695338\n1853523947\n1990128500\n116228118\n8125625\n1502370133\n711613620\n386750379\n123338308\n616524912\n1502370133\n5082904\n68400359\n34188107\n6152750\n252911710\n396487044\n853659536\n419355432\n298643372\n1732660128\n1732660128\n196944807\n3865542\n757012230\n1660738508\n2180523278\n123996976\n2180523278\n267107961\n267107961\n900065851\n615892324\n615892324\n667159652\n667159652\n1769193188\n23804628\n330130520\n21486425\n842040552\n165777300\n479211277\n152943758\n398698984\n2386274576\n21598424\n182390875\n3578207613\n657230374\n259549506\n339304326\n824221509\n927481407\n811679196\n106210835\n31066273\n11698480\n727324406\n1043736145\n195465667\n256290060\n231609375\n403316874\n100271980\n3053415\n154649049\n897284115\n182234771\n981086770\n131137909\n425672973\n599736486\n174184121\n174184121\n203293361\n1159058214\n112492765\n206497709\n474737568\n144124516\n737256768\n859352\n150494628\n985951985\n9769202\n227050440\n65815413\n428921880\n227050440\n100248864\n428921880\n350602378\n97329096\n369278420\n112225164\n294862555\n294862555\n1175867841\n169149508\n486618774\n1175867841\n114468249\n294862555\n26345837\n62287027\n294862555\n142973256\n327512631\n931523836\n362590302\n175623332\n142973256\n555086442\n135518671\n106167933\n484659337\n17908506\n28678592\n124487324\n132826290\n323913243\n102932390\n99405810\n638325402\n1055306183\n1018461752\n932006849\n932006849\n658498401\n1208094177\n1470010977\n211875387\n717081537\n409119314\n749238614\n166854534\n166701077\n166701077\n166701077\n344588371\n782007401\n238485861\n905345551\n166701077\n21397002\n323885175\n118253082\n257862396\n118253082\n121399632\n129224225\n798628765\n118253082\n118253082\n13816459\n118253082\n186338336\n392247964\n425526597\n729332509\n1036606024\n6132759\n845338269\n563121678\n469375590\n65917594\n469375590\n98620329\n66399096\n74059848\n898485773\n898485773\n53384768\n731288605\n328393320\n585296473\n147382813\n1348739228\n585296473\n469375590\n12868756\n585296473\n221319917\n356222002\n12868756\n190230201\n48292044\n48859387\n190230201\n124600478\n2862753\n374131905\n7540263\n536815560\n91733663\n331448921\n415536233\n134288551\n16745571\n226353990\n135975186\n190230201\n291252780\n631666668\n354561024\n758768933\n2026849622\n50792041\n12868756\n966376204\n966376204\n966376204\n966376204\n179419807\n500690843\n117832468\n210844860\n561442279\n321931943\n493602180\n216338087\n2210979\n344836580\n1487357207\n26107454\n18969292\n1487357207\n1688412463\n1004101918\n29609844\n1688412463\n29987224\n66757961\n1688412463\n29609844\n29609844\n29609844\n735880243\n425082768\n368815294\n3320808768\n486924670\n17009372\n241847678\n467391098\n368815294\n89827341\n368815294\n312065749\n180249702\n396463992\n396463992\n176366082\n826488573\n164773097\n983630070\n983630070\n493920978\n1046157976\n1046157976\n499162109\n74415015\n242197256\n279492706\n1991212\n277862897\n427437679\n31539100\n772513984\n1078514059\n1782888982\n355888482\n31750664\n1228088841\n57450754\n2061516754\n10626453\n134904868\n515253880\n234160903\n145797025\n421385508\n167774094\n26701731\n124560021\n219533501\n117957480\n155373044\n30760406\n638547739\n552688137\n28903976\n1473845830\n2093970199\n2228613634\n1632373189\n1632373189\n1632373189\n109850734\n495817542\n937083870\n134908993\n770760050\n28245430\n226458674\n209827\n63064296\n507672226\n127256371\n156960415\n293568256\n511092459\n29463348\n266795560\n104870036\n93442802\n10823172\n778162504\n1114584030\n108320238\n406660109\n358494175\n597726970\n369024389\n553935274\n26172609\n285789864\n230755997\n22580876\n771867323\n57500584\n398658817\n320762145\n366729248\n424587759\n225556888\n214036331\n193815396\n803908254\n1786711761\n155263319\n691456024\n137491063\n691456024\n297039415\n80940177\n171801209\n80940177\n1480247\n80940177\n1590280697\n500046172\n62585307\n573424139\n850144591\n267762283\n842322062\n409812428\n502194555\n614040292\n30742495\n230063928\n5778025\n172838548\n132412748\n50493554\n15567716\n314975019\n21329674\n1096018467\n1395395213\n2137863954\n2902193639\n74483391\n530038768\n3896374912\n2527166879\n337376239\n742925418\n255936787\n16135350\n81053507\n201249286\n201249286\n201249286\n77121757\n344775992\n201249286\n79362845\n1227900351\n985007132\n487504203\n201249286\n1021391625\n698752215\n201249286\n481505812\n2943380\n320320708\n347885885\n41491370\n44155196\n61382762\n174649285\n16264683\n7626651\n873381140\n556375667\n485137426\n781969747\n744366062\n485137426\n173231669\n783440748\n737519138\n783440748\n161078401\n203348627\n7754596\n1001399971\n25432407\n85340456\n885292694\n327495454\n281226\n42137640\n319828283\n227298112\n146697163\n101227638\n1210260626\n270997086\n270997086\n270997086\n270997086\n1134817378\n154768582\n691727904\n205395481\n359653604\n194883235\n392081294\n841526213\n359653604\n21884873\n12677072\n1720031489\n1308939077\n1720031489\n64713781\n1505169536\n99757692\n1848628093\n1848628093\n48085212\n126268229\n748987474\n2415487180\n288635598\n188809424\n5267190\n344492529\n718672148\n781491202\n718672148\n1108341782\n50924930\n718672148\n79706086\n92736607\n718672148\n34128932\n799774664\n1430795294\n1186977707\n1138527654\n1617604932\n1763493058\n1138527654\n1872139738\n119530686\n67656851\n229735722\n326902137\n326902137\n500283807\n1035704305\n129294199\n49786509\n1111957446\n1111957446\n5594615\n304224249\n12073141\n158611283\n383086896\n423240980\n434931838\n180433581\n687626840\n687626840\n903649786\n106037150\n80759537\n44479829\n375213188\n397734966\n300604061\n24174164\n522040236\n375924270\n53277284\n43438852\n418600665\n418600665\n495705497\n681322520\n567526318\n738107037\n1536295674\n67366669\n747569159\n2062206533\n11354072\n864222941\n753543743\n186962124\n701870210\n864222941\n145511781\n863258482\n495869266\n128762250\n279616025\n56830875\n1097240380\n587406146\n585651896\n229624976\n1915240335\n171250790\n195002291\n451904146\n419480755\n2142432383\n339359579\n676233352\n767946185\n348008503\n1336771035\n184460918\n767946185\n227008163\n718647721\n2821739971\n2121684594\n555228525\n251077686\n103526401\n2142432383\n173744632\n1043053904\n91002721\n584288713\n850527048\n386142232\n551627694\n86462946\n859148810\n227976372\n859148810\n850527048\n48067616\n47826620\n37124394\n281291949\n5253488\n167754436\n514843295\n742906170\n351045834\n83771838\n1504340863\n429684259\n779742620\n194317516\n366323315\n654576334\n152117192\n1354703\n504905850\n514039255\n63632010\n149092456\n623869924\n29137417\n612597137\n772023334\n1493461987\n19754809\n865192450\n256683871\n406461611\n36600880\n362454157\n436252395\n865192450\n377561068\n121254605\n2363417009\n1492926517\n226618793\n76375578\n280426831\n265036453\n580605396\n309326041\n36062886\n35071920\n23693535\n383669058\n64609486\n553694007\n241601850\n356700789\n328504523\n181338567\n406243566\n213600970\n63633095\n184568854\n8185467\n453044181\n74363683\n1163081301\n1163081301\n830508937\n31879868\n198416753\n139215737\n167436206\n53408385\n58437802\n42382625\n79797430\n55914433\n680996661\n967676365\n3374759\n1667152497\n1667152497\n501549806\n169910002\n43513176\n385160412\n1667152497\n581252933\n680996661\n123313313\n10558622\n690403741\n7303098\n578237376\n427578116\n4765125\n29463266\n150411100\n298626244\n150411100\n146407780\n262782873\n43107945\n150411100\n150411100\n150411100\n203351326\n89629821\n690982576\n30014465\n289295738\n173522672\n721339527\n274053673\n159807526\n347695288\n93351077\n793790286\n1342244646\n746243196\n409789564\n710844663\n1407693079\n79104538\n112250628\n140823362\n436484480\n197216736\n716414542\n728410358\n12385\n601863711\n674754880\n601863711\n674754880\n64716795\n674754880\n75197075\n716414542\n674754880\n3802148\n660071184\n180474\n1913842323\n601863711\n222842307\n55561796\n4841234\n320496947\n521503873\n638372801\n111859927\n1675502938\n1496199420\n514956398\n160922657\n1731194080\n761775269\n378226247\n224318956\n53152873\n11561383\n3558666981\n126303994\n278634336\n51408560\n974036729\n290118168\n1731194080\n50501211\n1321633132\n770995696\n207132237\n207132237\n29532429\n1007270\n67455749\n965799760\n249786450\n965799760\n500277960\n329140555\n460248275\n114467200\n182613321\n291843381\n814115781\n57214926\n1511123889\n1168218216\n319210308\n181671708\n99166035\n958867521\n1200004064\n76396773\n208125615\n3552700\n172033604\n455971066\n383734593\n24978642\n752749672\n752749672\n325798\n555719142\n803169697\n2427608\n1104757886\n1161212101\n2982203939\n3662114780\n1104757886\n22506628\n1161212101\n661854653\n96786604\n268646715\n1176066204\n18233470\n847079225\n356207205\n206718687\n202395460\n11028377\n217283958\n49241614\n248163999\n206718687\n99588066\n41000860\n405193160\n183916476\n88975018\n1369821608\n10811438\n30119693\n254200742\n507730838\n507730838\n507730838\n631547692\n852599668\n245801718\n58827905\n169923588\n169923588\n5827939\n169923588\n672728334\n106193322\n667150900\n380536091\n324492520\n667150900\n667150900\n19438670\n3357840\n3357840\n424362016\n38222690\n307558768\n22707247\n92266613\n19878546\n832904294\n8132568\n797458253\n69372508\n335896570\n30755201\n335190352\n177767296\n16113617\n84296311\n94371277\n1348718\n83796763\n541702912\n594073515\n1532738411\n6178590\n406915714\n1259097351\n131069285\n1656592\n855540210\n192237560\n310851981\n865010817\n73918032\n865010817\n193786534\n888108782\n8451178\n630766528\n118211200\n335263256\n281467679\n140456591\n771580245\n1315126048\n1315126048\n1315126048\n297501621\n112690726\n740336055\n2020847148\n19211038\n1539083165\n1511151588\n237556374\n13599257\n48361307\n400615102\n1881030519\n1536399666\n1205578\n8014247\n279350529\n858320554\n101458776\n126154760\n101458776\n408919547\n71321542\n719652008\n42276429\n151388185\n2952829534\n321573458\n151388185\n196830466\n988060818\n282233771\n1207584322\n407893849\n192413326\n482104505\n719652008\n92866347\n314863636\n2516538\n575415897\n442096919\n1445485223\n382147147\n50350056\n12004805\n383934223\n1132982929\n1132982929\n177046890\n1132982929\n5607871\n1132982929\n222430814\n1132982929\n1132982929\n1132982929\n57544425\n1132982929\n1132982929\n13408322\n51958720\n1181002254\n97421250\n21152296\n52598795\n561258892\n463622448\n112894256\n22431168\n145579703\n385987260\n77171521\n682992135\n69355093\n328404100\n331245336\n688880808\n112139711\n112139711\n2289765719\n529994550\n2289765719\n47746090\n3148112794\n1292195599\n586957015\n325009407\n622261230\n32229384\n263285362\n32351871\n604976032\n512222212\n890529167\n154238330\n252332182\n130569614\n9491142\n70392834\n719680791\n153224164\n1327925918\n152257663\n1420156057\n36341724\n1778698412\n2050073018\n1801912865\n291962531\n291962531\n126662403\n95382268\n701803877\n3965419218\n46959780\n876772459\n980630621\n143734452\n862230157\n386727813\n587006903\n701803877\n876772459\n549551998\n9289679\n587006903\n22415412\n587006903\n666906568\n124283682\n1431335749\n469075321\n206779209\n1555944643\n776817301\n791515462\n573072780\n359090641\n142477586\n626401452\n791515462\n2074666375\n381025315\n382145192\n43147510\n867637385\n70637093\n43147510\n278996423\n643466412\n142360471\n570450975\n2662277535\n2169939885\n2489502396\n429061642\n289680328\n122044704\n123742941\n698890428\n698890428\n52143210\n388338888\n690918214\n487679612\n853471919\n177800979\n195127333\n212358034\n76711831\n2036798560\n683317852\n93512501\n263641896\n126444868\n891752623\n860228961\n463121958\n2074389262\n463121958\n891752623\n672842391\n6457863\n165314622\n478198409\n889396579\n920920241\n565735390\n492289576\n113992515\n84403976\n46007334\n53465235\n1018760129\n201081842\n774391135\n274787953\n111769926\n1526323412\n398835991\n1526323412\n1997867505\n90324262\n2682889848\n19429207\n96201532\n2682889848\n525007919\n611650305\n731065412\n608781770\n14092396\n124586928\n189477763\n1217586584\n124586928\n463121958\n143009931\n179459802\n628928196\n608781770\n1394948753\n3666852\n7583110\n299361091\n299361091\n765977265\n299361091\n271162799\n348978956\n174253948\n748807189\n984398401\n26442748\n769364825\n542549278\n306125665\n641110489\n28067143\n86018427\n865361277\n1626198774\n2564284879\n1626198774\n145963500\n624572434\n663998031\n1206254547\n48385877\n23352966\n770442864\n1402303632\n893302652\n835914863\n1374747378\n2561320581\n1266765037\n1159547993\n467918636\n460800226\n296182323\n1350414239\n43221129\n460800226\n54828210\n142429732\n1350414239\n106512640\n460800226\n1344242842\n86851024\n25778606\n575711390\n208448682\n575711390\n1511271590\n268467361\n308318477\n510265511\n162199289\n894123412\n510265511\n510265511\n240316731\n63612993\n1684423402\n381604685\n728556388\n814424288\n381604685\n1191363134\n23548969\n1000609328\n663018855\n1000609328\n510265511\n172153269\n869453777\n437775661\n62663965\n437775661\n401945217\n568210105\n568210105\n1000609328\n894123412\n511586885\n432725782\n515567903\n81030236\n240592672\n28449792\n115966799\n81862112\n432725782\n67608389\n1658420794\n1369757307\n144478817\n1237642062\n2025256268\n799561256\n288016962\n191651665\n136755968\n1736592781\n371769230\n243133100\n161552123\n992365835\n58633564\n371769230\n52440975\n290687384\n612170086\n552013592\n326816982\n32214029\n612170086\n299215408\n191483977\n65725151\n1364715031\n154432286\n869638746\n201932433\n879796791\n131836469\n191483977\n877806579\n104995200\n877806579\n533253043\n612170086\n37264567\n181014100\n612521350\n762643749\n191483977\n762643749\n762643749\n3785171\n857133060\n781607189\n879939326\n512084899\n131390334\n612170086\n212492922\n41289184\n576387778\n1386264191\n126585796\n186628\n1386264191\n44682712\n1386264191\n1386264191\n1668838732\n98365012\n558445051\n105426563\n349798574\n427806085\n504519111\n437815629\n427806085\n27324019\n685440166\n360455610\n434369309\n130306486\n146319476\n169411956\n639480976\n685440166\n85095595\n814714495\n814714495\n744626445\n609380447\n1014952931\n248215896\n1591240042\n207846283\n3147209\n697301574\n1461748439\n666530301\n339244301\n339244301\n247737044\n666530301\n25770979\n666530301\n388325972\n183323053\n54135624\n155264665\n155264665\n509813322\n458232339\n15575819\n250526711\n1358695426\n683591771\n322354027\n230731297\n803039683\n87098612\n168767070\n906687508\n296205471\n273649043\n331798301\n35494494\n559147203\n103794536\n345818536\n416303819\n12110347\n220269788\n416303819\n484400471\n83566629\n153519256\n35445117\n493593873\n210141321\n546316317\n2534223963\n915612061\n915612061\n103649238\n915612061\n23999298\n260627755\n100441558\n1040112925\n405910854\n915612061\n31720331\n503761593\n44687679\n445714932\n405910854\n707717920\n614587887\n117169023\n52618560\n952521578\n111058391\n412341940\n387577378\n387577378\n1588655821\n304167702\n121169952\n304167702\n239599307\n120174904\n497824003\n539110209\n74505371\n117039799\n321286615\n763820606\n43624008\n537126746\n1030710203\n14202320\n911987991\n200761349\n700560562\n56923968\n56923968\n664532765\n2057463\n438406344\n9942713\n401905812\n1075614463\n300189880\n78792111\n992105101\n2138411065\n30260712\n30260712\n30260712\n2138411065\n83384307\n520001853\n30260712\n282185007\n138799844\n2129429614\n778432089\n138799844\n778432089\n138799844\n26883969\n72265125\n778432089\n1148035934\n1148035934\n377266625\n694213987\n18401217\n676534956\n370056968\n676534956\n6698103\n336627532\n246499256\n728881017\n676534956\n557627042\n143334334\n158814548\n650659824\n1697424833\n1467183212\n266860535\n244960253\n3626953991\n2357920001\n15126373\n221109567\n496163505\n19468936\n193953813\n2990566503\n278149562\n65903048\n686133103\n4358764048\n968193710\n38567447\n2346249235\n1024232845\n2566006704\n1481243988\n760452354\n840276286\n68747887\n47731210\n840276286\n659380066\n408180761\n840276286\n1198487336\n343618231\n51524508\n80599630\n1113922992\n301559633\n66046732\n226935561\n204601999\n432267243\n871311022\n632962717\n28408\n94761056\n279949792\n279949792\n738975410\n106325368\n194281655\n563571008\n1450830835\n182065381\n32053903\n1001309895\n28357881\n1450830835\n201417485\n342392789\n247604658\n276328475\n317888492\n70048718\n30641151\n377101034\n377101034\n170604978\n649478681\n113197377\n231002445\n1085213\n2187993596\n11151730\n2187993596\n292752832\n2568782668\n140089004\n96286609\n25195340\n255877927\n655654061\n3918691\n188252905\n314680999\n314680999\n314680999\n314680999\n409963518\n360508880\n360508880\n3873450\n355438885\n352971700\n279913131\n201267564\n882107434\n85629290\n121531672\n367513212\n31146109\n35996776\n367513212\n1135169028\n2349160408\n220107187\n1279894014\n972735812\n972735812\n79702877\n94179470\n520822337\n474699588\n87097840\n718340733\n87097840\n134830947\n258168451\n3570423956\n77456817\n214439635\n863391462\n432859080\n863391462\n134830947\n863391462\n280252109\n246446590\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1000 1000 811605498 961464625\n",
"output": "230231691\n50907792\n772872116\n28726758\n20957398\n48216401\n564116048\n70658978\n9545021\n789851575\n993564693\n754556313\n1407453357\n281963589\n624055178\n50804159\n50804159\n894467226\n24436906\n209344702\n583604216\n545435223\n399103514\n286455036\n672601056\n112440928\n28906651\n285384887\n437165549\n672601056\n672601056\n672601056\n418317887\n1156656565\n123389163\n939398850\n323019445\n1040606872\n181812742\n631705944\n1252601229\n1270982340\n2020261282\n209344702\n661730192\n61860166\n140819245\n1088390841\n796930294\n158780864\n42700430\n25976840\n1326483918\n1333121437\n65604452\n142583725\n3528001\n46716128\n2239983672\n795463838\n281279034\n795463838\n795463838\n795463838\n795463838\n795463838\n908664475\n90778541\n795463838\n662066470\n204879359\n131523587\n550143309\n1836222890\n9951973\n1836222890\n598644580\n50113172\n1104322707\n571066392\n89608022\n34148711\n550275659\n15998924\n138783565\n325154299\n572598358\n677882644\n612049819\n677882644\n1498086574\n677882644\n1498086574\n268736704\n1498086574\n16294855\n1498086574\n258766369\n945315186\n232565952\n136662817\n541220372\n90502\n1064028054\n1934167970\n392824254\n392824254\n276599292\n3118499234\n1064028054\n19985907\n103870397\n1064028054\n986994517\n556678450\n784903340\n241805536\n2643200692\n841941014\n40711302\n226710872\n1495012866\n23338317\n272031317\n87602968\n87602968\n64460860\n34080527\n607826799\n745002091\n607826799\n607826799\n607826799\n607826799\n376209990\n845035831\n845035831\n1265225922\n50117960\n87034026\n468076\n468076\n23250316\n316140642\n468076\n765871594\n468076\n114231160\n309928085\n309928085\n286978684\n222646415\n186185034\n119361069\n585927467\n31348688\n152642628\n400112164\n692543007\n17546446\n745002091\n1840578116\n374030821\n1840578116\n328230394\n374030821\n328230394\n738602929\n738602929\n243039301\n219439559\n272387221\n110944810\n124767592\n209606071\n226871033\n165693056\n165693056\n513572167\n359814536\n513572167\n513572167\n836136587\n14357433\n12264536\n970816095\n419977671\n1458614\n354540033\n24514033\n127397466\n3415408\n1735817470\n24514033\n304375434\n213129720\n130009955\n1885882141\n112789246\n163882924\n1270631765\n39978832\n77574308\n1964892778\n62106419\n136203445\n2619645565\n163660158\n1277652106\n512931073\n1277652106\n3292668\n315920194\n315920194\n887326785\n51795756\n315920194\n315920194\n315920194\n552149756\n1299857359\n183641984\n913207554\n114865079\n454919120\n267202775\n735760524\n198518663\n676190022\n1085646571\n1690488555\n2105369676\n167665440\n147052930\n43745979\n2881517615\n333034\n414962016\n2157020107\n414962016\n4327799568\n621091910\n4066651912\n199041543\n5722807\n3483366361\n11088193\n2398046\n47630321\n56175850\n885915092\n2490562421\n83726862\n20502000\n30561767\n11863143\n753049328\n753049328\n1635209096\n829090581\n549937023\n829090581\n523288420\n286321901\n400400281\n144254280\n144254280\n144254280\n120536708\n507271847\n13581882\n41756781\n257475904\n507271847\n132504516\n507271847\n105377442\n264010062\n392152501\n225994848\n18362743\n105377442\n159375324\n434801921\n148212640\n93029029\n88268380\n94567874\n45176193\n583542414\n21796448\n27312759\n23326864\n454775703\n1318348825\n454775703\n65402724\n910923035\n22432126\n910923035\n9865692\n334795506\n856838083\n7027783\n40502137\n927765703\n1714093041\n38452097\n490115109\n737549697\n856838083\n793622101\n151231090\n202291569\n369735232\n513393785\n614713421\n793622101\n256445226\n29705476\n697930396\n664591347\n29705476\n647565606\n1373474492\n606218888\n328503866\n53535955\n1835300379\n144339956\n560760618\n53944677\n172791733\n172791733\n108948086\n172791733\n429854496\n1434986135\n113591024\n874386494\n679342126\n874386494\n128130925\n874386494\n510808147\n9151928\n874386494\n528020480\n106306411\n20169356\n1593245464\n33079224\n482298377\n1992291315\n28583698\n911513318\n83787776\n787626983\n55223991\n195616407\n225810444\n1761502040\n117604223\n1823882272\n1714157249\n1690476035\n1690476035\n1017864544\n1017864544\n1048157842\n11245691\n36752996\n325621216\n36752996\n141229464\n93760246\n4575357\n532089992\n141229464\n141229464\n141229464\n456428200\n141229464\n175332980\n363662139\n585187000\n468681184\n194798476\n157277788\n303061161\n249960507\n383850194\n964460305\n964460305\n91673338\n49924260\n523047605\n617098582\n900074529\n900074529\n2263816413\n42491654\n313244370\n479924551\n239151944\n20937430\n747320349\n177921421\n929341683\n55733854\n518644815\n41242807\n81689258\n438329289\n61792718\n120093707\n44955740\n30959677\n129359481\n887741099\n887741099\n519687307\n404005076\n543335240\n98004696\n547904912\n8044729\n635896080\n485128064\n32660435\n338944982\n50026438\n209986667\n635896080\n446762986\n12818576\n21520024\n586867409\n277496920\n1157801810\n1408959933\n141337850\n183994728\n248367940\n248367940\n1408959933\n1408959933\n1441157718\n204288933\n1408959933\n275683416\n1408959933\n1408959933\n1058131227\n99062036\n89655617\n1408959933\n5948562\n10557684\n14785244\n586242331\n328530458\n706277074\n20876215\n706277074\n85692664\n1099776067\n95681493\n332752032\n536568815\n47927669\n312865886\n82848477\n284429356\n18290090\n58109184\n64279196\n735854226\n672925465\n229963050\n780494173\n933243443\n416194801\n569967030\n912135948\n77497015\n2982296197\n912135948\n434746359\n234291577\n234291577\n175355926\n706277074\n1074387069\n346314011\n999554945\n626870562\n93022409\n238103346\n88751705\n119914821\n735313949\n665636542\n310994012\n567540876\n1258382322\n263903206\n1005283593\n1378424331\n844034188\n333461726\n10992477\n719603540\n626148567\n766583946\n445014043\n164494445\n445014043\n213348268\n257027369\n49292456\n577991692\n325700445\n62019081\n990092926\n1623611204\n735245925\n75802786\n276484509\n107279943\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "100000 100000 1000000006 1\n",
"output": "1\n0\n1\n1\n1\n1\n0\n2\n0\n2\n0\n2\n3\n0\n1\n2\n1\n0\n1\n0\n0\n0\n1\n0\n1\n0\n0\n0\n0\n1\n2\n0\n0\n0\n0\n1\n0\n0\n2\n2\n0\n0\n0\n3\n0\n0\n1\n3\n1\n0\n1\n1\n1\n1\n0\n1\n0\n2\n1\n0\n2\n2\n0\n1\n0\n0\n1\n1\n1\n0\n0\n0\n2\n1\n1\n1\n1\n0\n2\n1\n2\n2\n1\n0\n0\n0\n0\n1\n1\n0\n2\n0\n0\n0\n0\n0\n0\n0\n1\n1\n0\n1\n0\n0\n0\n0\n1\n2\n2\n0\n0\n2\n2\n0\n2\n2\n0\n2\n2\n0\n0\n1\n0\n3\n0\n0\n3\n5\n1\n4\n0\n0\n0\n0\n1\n0\n1\n2\n0\n0\n3\n1\n1\n2\n0\n0\n0\n1\n1\n2\n0\n0\n0\n5\n0\n0\n0\n0\n0\n0\n3\n1\n0\n0\n4\n0\n0\n1\n1\n0\n0\n2\n1\n0\n2\n2\n2\n0\n2\n0\n0\n4\n0\n0\n0\n0\n0\n4\n3\n0\n5\n1\n1\n1\n0\n0\n0\n0\n0\n10\n1\n1\n4\n0\n1\n0\n0\n1\n1\n1\n1\n2\n2\n1\n0\n2\n1\n1\n0\n0\n2\n0\n0\n0\n4\n0\n2\n2\n3\n0\n0\n0\n0\n5\n5\n0\n2\n0\n0\n4\n0\n6\n0\n1\n0\n1\n0\n1\n0\n1\n0\n1\n0\n0\n1\n2\n0\n0\n2\n0\n1\n0\n1\n0\n1\n1\n1\n0\n0\n0\n0\n5\n1\n0\n4\n5\n1\n0\n2\n2\n0\n7\n0\n1\n0\n1\n2\n0\n1\n1\n0\n0\n2\n1\n1\n2\n0\n2\n0\n4\n3\n3\n0\n0\n1\n0\n1\n0\n0\n1\n1\n1\n1\n0\n1\n1\n0\n1\n1\n2\n1\n1\n0\n1\n0\n0\n0\n0\n0\n1\n2\n2\n1\n3\n3\n0\n1\n3\n3\n2\n4\n0\n0\n0\n2\n2\n0\n1\n2\n3\n0\n1\n1\n0\n0\n1\n1\n1\n0\n1\n2\n0\n0\n1\n0\n0\n0\n0\n4\n4\n0\n0\n0\n0\n1\n0\n0\n0\n3\n0\n1\n1\n4\n1\n2\n0\n2\n2\n1\n1\n3\n3\n3\n7\n0\n4\n1\n5\n0\n1\n0\n0\n0\n0\n0\n1\n0\n3\n0\n0\n8\n2\n0\n3\n3\n0\n0\n0\n4\n7\n1\n0\n0\n2\n0\n2\n6\n2\n5\n1\n2\n0\n1\n0\n4\n3\n0\n3\n1\n10\n0\n0\n0\n0\n3\n0\n1\n0\n0\n1\n1\n2\n3\n3\n3\n1\n0\n0\n3\n0\n0\n0\n1\n1\n0\n1\n3\n1\n0\n2\n1\n0\n0\n0\n0\n1\n0\n1\n4\n2\n5\n0\n5\n0\n0\n4\n0\n0\n4\n0\n0\n0\n0\n1\n0\n3\n1\n0\n1\n0\n1\n1\n2\n2\n3\n0\n2\n4\n4\n0\n3\n0\n0\n5\n0\n3\n0\n1\n0\n2\n1\n0\n1\n0\n1\n3\n1\n1\n0\n0\n0\n1\n1\n0\n2\n0\n1\n2\n0\n0\n1\n0\n0\n3\n1\n2\n2\n0\n0\n7\n4\n0\n0\n1\n0\n0\n0\n3\n9\n0\n0\n1\n0\n3\n2\n0\n6\n2\n0\n4\n2\n0\n0\n0\n0\n0\n0\n6\n5\n2\n2\n0\n2\n0\n0\n0\n0\n1\n0\n0\n3\n0\n1\n1\n0\n0\n0\n4\n0\n0\n0\n0\n1\n5\n2\n1\n0\n2\n2\n5\n0\n0\n4\n5\n0\n5\n0\n5\n0\n0\n0\n10\n0\n0\n0\n0\n1\n1\n0\n1\n1\n1\n0\n0\n0\n0\n0\n2\n0\n5\n0\n0\n5\n0\n0\n0\n1\n0\n2\n0\n1\n1\n0\n0\n6\n0\n0\n0\n0\n3\n3\n6\n0\n3\n0\n0\n0\n0\n2\n0\n0\n2\n0\n1\n0\n0\n0\n0\n3\n2\n1\n1\n1\n0\n3\n0\n0\n0\n0\n1\n1\n1\n0\n1\n1\n1\n0\n0\n0\n1\n1\n0\n1\n1\n0\n0\n1\n0\n0\n0\n0\n4\n0\n0\n0\n2\n1\n1\n0\n2\n1\n1\n3\n1\n4\n6\n2\n0\n1\n0\n0\n0\n2\n0\n0\n2\n0\n0\n3\n0\n2\n0\n3\n1\n0\n0\n1\n0\n2\n3\n2\n3\n0\n3\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n1\n3\n0\n0\n3\n0\n0\n0\n1\n0\n1\n1\n2\n1\n1\n1\n1\n1\n1\n1\n1\n0\n0\n4\n3\n1\n1\n0\n0\n0\n1\n0\n1\n0\n0\n0\n0\n1\n1\n1\n0\n0\n0\n1\n0\n1\n1\n1\n1\n1\n0\n1\n0\n1\n0\n5\n4\n7\n5\n1\n1\n1\n0\n1\n1\n2\n2\n0\n2\n0\n0\n0\n1\n2\n2\n0\n2\n0\n0\n1\n0\n2\n0\n0\n3\n0\n1\n2\n0\n0\n0\n0\n0\n0\n0\n0\n2\n3\n2\n2\n0\n2\n3\n0\n4\n0\n0\n1\n0\n0\n1\n0\n3\n1\n0\n3\n0\n4\n0\n1\n0\n0\n2\n1\n0\n0\n2\n0\n0\n3\n3\n3\n0\n0\n2\n1\n0\n2\n1\n1\n1\n0\n1\n1\n0\n1\n1\n2\n1\n0\n1\n0\n0\n0\n2\n0\n3\n3\n0\n3\n0\n0\n3\n0\n0\n0\n1\n1\n0\n1\n1\n0\n1\n0\n0\n0\n0\n0\n0\n0\n1\n0\n4\n0\n1\n0\n0\n0\n1\n3\n4\n4\n5\n0\n6\n0\n5\n0\n0\n0\n5\n1\n0\n0\n1\n0\n0\n0\n2\n1\n1\n2\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n2\n0\n0\n2\n0\n3\n0\n1\n0\n1\n0\n1\n0\n2\n3\n1\n0\n0\n0\n0\n2\n1\n0\n0\n2\n2\n1\n2\n2\n0\n1\n2\n0\n1\n1\n0\n1\n1\n0\n1\n0\n2\n0\n0\n1\n1\n0\n1\n1\n0\n1\n2\n1\n0\n0\n0\n0\n0\n0\n4\n0\n0\n1\n0\n0\n0\n2\n0\n4\n1\n0\n3\n0\n0\n0\n0\n0\n0\n0\n1\n1\n0\n1\n0\n1\n0\n0\n0\n1\n1\n2\n1\n0\n0\n0\n0\n0\n4\n1\n0\n0\n3\n3\n3\n4\n4\n6\n4\n6\n0\n0\n8\n1\n0\n0\n5\n5\n3\n1\n1\n0\n0\n2\n0\n5\n2\n4\n1\n1\n0\n0\n0\n1\n0\n1\n0\n1\n2\n0\n2\n0\n2\n1\n0\n0\n1\n0\n0\n0\n0\n2\n4\n0\n0\n2\n3\n1\n2\n0\n0\n0\n0\n3\n2\n0\n0\n0\n3\n0\n2\n6\n2\n2\n1\n1\n2\n1\n0\n1\n1\n0\n1\n0\n1\n1\n1\n1\n2\n0\n0\n0\n3\n1\n0\n2\n1\n1\n0\n0\n0\n0\n2\n2\n2\n1\n1\n0\n2\n1\n2\n0\n0\n1\n0\n0\n2\n0\n0\n1\n4\n0\n0\n0\n3\n5\n0\n0\n0\n0\n1\n1\n0\n0\n1\n0\n1\n0\n0\n2\n1\n0\n3\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n1\n0\n0\n3\n2\n1\n2\n0\n0\n0\n1\n1\n1\n3\n2\n1\n0\n0\n3\n1\n0\n1\n1\n0\n0\n0\n1\n3\n0\n0\n6\n0\n4\n0\n6\n5\n5\n0\n2\n0\n0\n0\n0\n0\n0\n0\n1\n1\n1\n0\n2\n1\n0\n0\n1\n0\n0\n0\n2\n2\n0\n0\n1\n1\n0\n2\n4\n0\n1\n2\n0\n1\n1\n0\n2\n0\n1\n1\n1\n0\n2\n1\n1\n1\n0\n6\n0\n5\n3\n1\n1\n2\n0\n1\n0\n6\n1\n3\n0\n1\n0\n5\n0\n0\n3\n2\n0\n2\n0\n0\n0\n0\n0\n0\n1\n2\n1\n2\n0\n2\n1\n3\n0\n0\n5\n3\n7\n7\n3\n3\n0\n2\n2\n0\n0\n0\n2\n0\n3\n3\n1\n2\n1\n1\n2\n2\n2\n0\n1\n1\n4\n0\n1\n0\n0\n1\n0\n3\n1\n0\n0\n1\n1\n2\n4\n1\n4\n3\n1\n0\n3\n0\n3\n0\n1\n1\n0\n1\n0\n2\n4\n2\n0\n0\n0\n0\n0\n3\n0\n4\n0\n0\n5\n0\n1\n2\n2\n3\n0\n0\n0\n2\n0\n0\n1\n0\n0\n4\n2\n0\n2\n0\n2\n0\n0\n1\n1\n0\n1\n1\n0\n0\n2\n2\n2\n2\n0\n1\n0\n1\n5\n1\n3\n0\n3\n0\n0\n3\n0\n1\n3\n4\n2\n1\n3\n0\n4\n0\n1\n1\n0\n1\n1\n0\n0\n1\n0\n1\n1\n5\n0\n0\n2\n2\n1\n3\n1\n0\n1\n2\n1\n1\n1\n1\n1\n1\n2\n0\n0\n1\n0\n0\n2\n2\n2\n1\n0\n1\n0\n5\n3\n0\n0\n1\n2\n0\n3\n0\n3\n0\n4\n0\n0\n1\n5\n0\n0\n5\n0\n1\n0\n0\n0\n0\n1\n1\n1\n0\n5\n1\n0\n1\n0\n1\n1\n1\n1\n0\n0\n2\n2\n3\n0\n2\n0\n2\n2\n2\n2\n0\n0\n0\n3\n1\n6\n1\n0\n2\n0\n2\n1\n1\n1\n0\n1\n0\n2\n0\n1\n0\n0\n1\n3\n0\n2\n0\n1\n0\n1\n0\n0\n0\n1\n0\n0\n0\n1\n0\n0\n0\n1\n0\n2\n0\n1\n3\n1\n0\n3\n2\n1\n1\n0\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n1\n2\n3\n0\n0\n0\n3\n0\n0\n1\n1\n0\n3\n1\n2\n0\n0\n0\n1\n0\n0\n2\n1\n0\n1\n2\n1\n1\n0\n2\n0\n1\n1\n0\n2\n3\n3\n2\n0\n1\n3\n1\n0\n0\n1\n0\n2\n0\n0\n0\n1\n0\n2\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n1\n2\n1\n1\n1\n2\n0\n0\n0\n3\n0\n0\n5\n0\n0\n0\n1\n0\n0\n2\n0\n1\n1\n0\n0\n2\n2\n0\n0\n1\n4\n0\n1\n6\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n2\n0\n4\n0\n0\n4\n0\n0\n0\n0\n2\n0\n0\n0\n5\n1\n2\n1\n2\n0\n2\n0\n0\n4\n7\n7\n0\n0\n2\n0\n0\n0\n1\n2\n1\n1\n2\n0\n5\n0\n0\n1\n2\n2\n0\n6\n0\n4\n0\n3\n0\n0\n0\n0\n3\n3\n1\n1\n3\n4\n0\n0\n0\n1\n0\n3\n0\n0\n0\n0\n0\n1\n3\n1\n4\n0\n1\n0\n0\n1\n0\n0\n3\n5\n3\n0\n5\n1\n0\n3\n0\n0\n4\n5\n3\n0\n0\n5\n0\n4\n5\n8\n0\n0\n6\n0\n1\n0\n1\n1\n1\n0\n0\n0\n0\n3\n1\n0\n1\n1\n0\n0\n0\n1\n1\n0\n2\n0\n3\n1\n0\n0\n1\n1\n1\n0\n1\n0\n0\n0\n2\n0\n0\n0\n2\n0\n0\n1\n1\n2\n0\n1\n0\n1\n0\n0\n4\n1\n1\n1\n0\n7\n2\n3\n0\n0\n0\n0\n0\n0\n0\n2\n2\n1\n0\n2\n4\n0\n1\n0\n1\n4\n4\n0\n3\n1\n1\n1\n0\n0\n3\n0\n5\n2\n1\n0\n7\n0\n1\n0\n0\n0\n0\n0\n0\n0\n2\n2\n1\n1\n0\n2\n1\n2\n1\n2\n0\n2\n0\n0\n2\n2\n1\n1\n0\n1\n1\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n1\n2\n0\n0\n2\n0\n0\n1\n0\n1\n0\n0\n1\n1\n1\n1\n1\n1\n1\n1\n0\n0\n0\n1\n1\n0\n1\n0\n2\n0\n1\n1\n0\n1\n1\n1\n1\n0\n0\n0\n0\n1\n0\n1\n2\n0\n1\n0\n0\n4\n0\n3\n0\n0\n0\n1\n1\n0\n0\n1\n0\n1\n1\n0\n0\n0\n0\n0\n3\n0\n0\n2\n0\n0\n0\n0\n0\n0\n4\n0\n1\n0\n1\n3\n0\n1\n0\n1\n1\n1\n0\n0\n1\n0\n1\n0\n2\n1\n0\n0\n1\n1\n0\n1\n1\n0\n1\n1\n1\n1\n1\n0\n0\n0\n0\n0\n1\n4\n1\n1\n1\n0\n0\n0\n0\n4\n0\n2\n0\n2\n0\n0\n3\n0\n0\n2\n0\n0\n0\n0\n1\n0\n2\n3\n0\n6\n0\n3\n0\n0\n0\n0\n6\n0\n3\n0\n0\n1\n12\n2\n0\n1\n1\n0\n0\n1\n1\n0\n3\n0\n0\n3\n0\n3\n0\n4\n3\n3\n3\n0\n0\n1\n0\n0\n0\n1\n0\n1\n2\n2\n0\n2\n0\n0\n0\n3\n1\n0\n1\n0\n0\n1\n1\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n1\n0\n2\n4\n3\n2\n5\n7\n7\n0\n0\n0\n1\n2\n0\n3\n0\n0\n1\n1\n0\n0\n0\n0\n1\n1\n1\n2\n0\n0\n0\n1\n0\n2\n1\n0\n0\n4\n3\n0\n0\n2\n2\n0\n3\n1\n2\n0\n0\n0\n5\n0\n1\n3\n1\n0\n3\n3\n0\n0\n0\n0\n0\n3\n3\n4\n0\n1\n1\n0\n1\n1\n0\n0\n1\n0\n0\n0\n0\n0\n1\n0\n0\n2\n0\n1\n2\n2\n0\n2\n0\n3\n2\n1\n7\n0\n0\n1\n3\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n2\n3\n0\n3\n0\n2\n0\n0\n3\n0\n4\n0\n1\n1\n1\n0\n0\n0\n0\n2\n2\n0\n2\n1\n0\n3\n2\n2\n4\n0\n1\n1\n1\n1\n0\n5\n4\n3\n0\n2\n3\n0\n0\n0\n2\n1\n1\n1\n1\n0\n0\n0\n2\n1\n0\n1\n1\n5\n0\n2\n2\n3\n0\n4\n1\n1\n2\n2\n0\n0\n2\n1\n2\n2\n0\n3\n1\n1\n0\n0\n0\n0\n2\n2\n2\n0\n1\n0\n1\n0\n0\n2\n0\n0\n1\n0\n1\n1\n0\n2\n0\n2\n2\n0\n2\n0\n0\n4\n0\n3\n5\n0\n5\n1\n3\n0\n4\n1\n1\n0\n1\n0\n0\n1\n1\n0\n2\n0\n0\n2\n4\n3\n4\n3\n2\n0\n0\n1\n1\n2\n5\n0\n6\n1\n2\n0\n0\n0\n0\n3\n0\n4\n3\n0\n0\n0\n0\n0\n1\n3\n2\n1\n3\n2\n2\n2\n0\n2\n2\n4\n1\n3\n0\n2\n0\n2\n2\n0\n0\n0\n0\n1\n2\n1\n4\n0\n0\n0\n1\n0\n2\n0\n2\n3\n4\n0\n0\n2\n0\n2\n0\n0\n3\n0\n3\n0\n5\n0\n4\n0\n6\n1\n2\n0\n0\n1\n1\n0\n2\n0\n0\n0\n1\n1\n2\n1\n1\n1\n0\n0\n1\n1\n0\n1\n2\n2\n0\n0\n1\n0\n1\n0\n0\n1\n4\n5\n2\n0\n1\n0\n2\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n1\n0\n1\n6\n0\n0\n1\n0\n1\n0\n1\n2\n1\n0\n1\n0\n0\n0\n0\n2\n2\n0\n0\n1\n0\n2\n1\n0\n0\n0\n1\n0\n1\n1\n0\n0\n2\n0\n0\n6\n1\n0\n0\n1\n0\n0\n4\n5\n1\n1\n1\n0\n0\n0\n1\n0\n1\n2\n5\n0\n0\n0\n0\n5\n0\n0\n1\n1\n2\n0\n0\n2\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n10\n4\n3\n0\n4\n9\n4\n0\n1\n0\n5\n0\n0\n5\n7\n0\n4\n9\n0\n0\n0\n5\n0\n5\n1\n0\n0\n0\n0\n3\n0\n0\n1\n1\n1\n0\n1\n0\n3\n0\n2\n0\n0\n0\n0\n0\n0\n2\n0\n1\n2\n0\n3\n3\n0\n5\n0\n0\n0\n0\n0\n0\n1\n0\n0\n2\n5\n6\n0\n1\n1\n1\n1\n0\n0\n2\n5\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n3\n0\n0\n1\n0\n0\n1\n5\n3\n0\n1\n1\n6\n6\n0\n0\n1\n0\n0\n2\n0\n3\n0\n0\n2\n0\n1\n2\n0\n3\n2\n0\n2\n1\n0\n3\n3\n2\n0\n0\n0\n3\n4\n2\n0\n0\n0\n2\n1\n0\n3\n1\n1\n1\n1\n1\n0\n0\n1\n1\n0\n0\n1\n1\n2\n1\n3\n0\n3\n4\n1\n1\n0\n0\n0\n0\n0\n1\n0\n0\n2\n0\n2\n2\n0\n0\n0\n2\n0\n0\n3\n3\n0\n0\n0\n0\n3\n1\n1\n0\n4\n0\n1\n2\n0\n0\n0\n2\n0\n1\n0\n0\n1\n1\n2\n0\n0\n1\n0\n2\n2\n2\n0\n0\n0\n0\n4\n0\n1\n1\n1\n1\n2\n0\n1\n1\n0\n2\n1\n0\n0\n2\n3\n0\n0\n0\n0\n1\n0\n0\n1\n0\n0\n1\n0\n0\n1\n0\n1\n0\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n3\n2\n0\n1\n4\n2\n1\n1\n1\n0\n0\n0\n1\n2\n3\n0\n0\n4\n1\n0\n1\n0\n0\n2\n2\n2\n0\n1\n0\n0\n1\n0\n2\n0\n1\n0\n2\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n1\n0\n3\n0\n0\n3\n3\n5\n0\n0\n4\n1\n1\n1\n1\n0\n0\n0\n1\n0\n2\n0\n0\n0\n1\n1\n2\n0\n2\n2\n3\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n1\n1\n1\n1\n0\n0\n0\n2\n1\n0\n0\n0\n0\n0\n1\n0\n1\n0\n1\n0\n1\n0\n0\n0\n1\n1\n1\n0\n0\n0\n2\n2\n1\n0\n0\n2\n0\n2\n0\n3\n0\n2\n2\n0\n0\n0\n1\n1\n0\n0\n1\n2\n1\n0\n2\n3\n1\n4\n2\n0\n0\n0\n2\n1\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n2\n1\n0\n1\n0\n3\n0\n1\n0\n4\n0\n0\n6\n1\n1\n7\n0\n2\n3\n1\n0\n0\n0\n0\n0\n0\n3\n0\n3\n0\n1\n1\n1\n0\n0\n1\n0\n2\n1\n1\n1\n0\n0\n0\n0\n0\n1\n0\n2\n2\n2\n0\n2\n2\n0\n1\n0\n1\n1\n0\n1\n1\n0\n0\n2\n0\n0\n1\n0\n2\n1\n0\n1\n0\n1\n0\n0\n1\n0\n0\n1\n1\n1\n0\n2\n2\n1\n1\n2\n1\n0\n0\n1\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n8\n1\n0\n3\n1\n0\n0\n0\n1\n1\n0\n0\n1\n0\n1\n0\n2\n0\n1\n1\n1\n0\n5\n0\n1\n1\n0\n1\n6\n1\n0\n2\n1\n1\n1\n0\n0\n1\n0\n0\n2\n0\n0\n0\n0\n2\n2\n0\n5\n0\n0\n0\n2\n4\n4\n0\n0\n4\n3\n0\n0\n0\n0\n0\n1\n1\n0\n0\n2\n0\n3\n3\n3\n0\n0\n0\n4\n4\n0\n5\n3\n0\n0\n0\n1\n0\n0\n1\n0\n0\n1\n5\n5\n1\n0\n6\n0\n3\n0\n0\n7\n0\n0\n6\n1\n0\n0\n9\n2\n2\n0\n2\n2\n0\n2\n0\n0\n0\n0\n0\n1\n1\n2\n0\n0\n1\n1\n2\n0\n0\n3\n0\n3\n1\n0\n0\n1\n0\n4\n2\n1\n0\n1\n1\n0\n2\n0\n1\n3\n3\n3\n1\n0\n0\n0\n1\n0\n2\n2\n3\n2\n2\n0\n3\n4\n0\n0\n0\n1\n0\n4\n1\n0\n2\n5\n0\n0\n1\n1\n0\n1\n3\n0\n2\n0\n1\n1\n0\n1\n0\n1\n2\n0\n1\n3\n0\n0\n0\n0\n0\n0\n3\n3\n0\n0\n4\n0\n4\n0\n4\n0\n0\n0\n1\n0\n0\n0\n0\n0\n2\n0\n0\n1\n2\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n1\n1\n1\n0\n1\n1\n2\n1\n1\n1\n0\n1\n0\n0\n1\n0\n0\n0\n0\n1\n1\n7\n0\n0\n1\n1\n0\n0\n0\n0\n2\n1\n1\n1\n2\n1\n0\n1\n0\n1\n1\n1\n1\n0\n0\n3\n0\n4\n6\n5\n1\n7\n2\n0\n0\n0\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n1\n3\n0\n0\n0\n0\n1\n0\n0\n0\n1\n0\n3\n0\n2\n0\n1\n0\n2\n0\n2\n0\n2\n0\n2\n0\n1\n2\n2\n4\n2\n3\n0\n0\n0\n0\n0\n1\n2\n2\n5\n6\n2\n7\n5\n1\n0\n0\n6\n1\n1\n0\n0\n0\n0\n1\n1\n0\n0\n0\n3\n3\n2\n3\n3\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n3\n0\n0\n0\n0\n3\n0\n0\n3\n0\n0\n4\n0\n0\n7\n0\n0\n6\n0\n0\n0\n2\n0\n1\n0\n0\n1\n0\n0\n3\n0\n2\n3\n0\n0\n0\n3\n3\n1\n0\n0\n1\n0\n0\n3\n1\n0\n0\n0\n1\n0\n2\n0\n4\n0\n0\n0\n4\n0\n0\n5\n0\n0\n3\n0\n0\n1\n0\n0\n0\n1\n8\n2\n2\n0\n4\n0\n1\n10\n2\n0\n2\n1\n0\n2\n0\n0\n2\n3\n2\n2\n2\n0\n0\n1\n0\n1\n1\n1\n0\n2\n0\n3\n0\n5\n0\n0\n3\n0\n6\n0\n8\n1\n1\n3\n0\n0\n4\n1\n1\n0\n0\n1\n0\n2\n2\n1\n3\n3\n0\n0\n2\n1\n0\n0\n4\n0\n2\n0\n0\n0\n1\n1\n0\n0\n0\n1\n5\n0\n0\n1\n1\n0\n0\n2\n0\n1\n0\n1\n0\n0\n0\n1\n1\n0\n1\n1\n1\n2\n0\n1\n1\n1\n0\n0\n0\n1\n0\n3\n0\n2\n0\n0\n3\n0\n0\n0\n3\n4\n0\n0\n2\n1\n0\n0\n2\n3\n0\n0\n0\n0\n0\n3\n3\n3\n1\n1\n0\n0\n4\n4\n1\n0\n1\n0\n1\n0\n1\n1\n1\n2\n2\n0\n1\n4\n0\n1\n0\n0\n1\n0\n0\n0\n2\n0\n0\n1\n0\n2\n2\n2\n3\n2\n3\n6\n1\n9\n0\n4\n1\n0\n0\n2\n5\n0\n1\n1\n0\n0\n1\n4\n3\n0\n3\n0\n3\n0\n1\n1\n0\n2\n0\n4\n0\n5\n3\n0\n3\n5\n3\n3\n1\n0\n1\n0\n0\n1\n0\n1\n0\n0\n0\n2\n0\n1\n0\n0\n1\n1\n0\n2\n2\n0\n0\n0\n2\n0\n0\n0\n1\n1\n2\n0\n0\n2\n0\n0\n0\n0\n0\n4\n0\n0\n4\n1\n0\n5\n0\n6\n5\n0\n4\n2\n0\n0\n0\n3\n3\n0\n0\n0\n0\n0\n0\n0\n1\n1\n0\n1\n0\n0\n0\n1\n2\n1\n0\n1\n0\n2\n1\n2\n0\n2\n2\n1\n0\n1\n1\n2\n0\n0\n0\n4\n0\n4\n4\n0\n0\n2\n0\n0\n0\n4\n2\n0\n2\n0\n0\n0\n1\n2\n0\n0\n2\n2\n0\n2\n3\n0\n2\n0\n5\n0\n1\n1\n0\n0\n1\n0\n2\n3\n0\n1\n1\n0\n1\n0\n0\n2\n0\n2\n3\n1\n2\n0\n0\n5\n1\n1\n1\n0\n0\n1\n1\n1\n0\n1\n2\n0\n0\n1\n0\n1\n1\n1\n1\n1\n0\n0\n1\n1\n2\n2\n0\n3\n0\n0\n2\n2\n4\n1\n0\n0\n0\n8\n10\n1\n0\n1\n0\n1\n1\n1\n1\n1\n0\n1\n0\n3\n3\n0\n0\n0\n0\n0\n1\n0\n0\n1\n4\n0\n2\n0\n1\n0\n1\n5\n2\n3\n0\n2\n1\n2\n1\n3\n1\n0\n0\n1\n2\n0\n2\n0\n0\n0\n0\n3\n0\n1\n1\n0\n2\n1\n2\n0\n1\n0\n1\n1\n1\n4\n0\n0\n1\n0\n0\n0\n0\n2\n2\n1\n1\n3\n0\n0\n0\n2\n1\n1\n0\n2\n0\n0\n0\n2\n0\n0\n0\n2\n1\n0\n0\n3\n1\n2\n3\n0\n3\n4\n0\n1\n5\n2\n2\n1\n0\n4\n0\n0\n1\n1\n1\n2\n0\n2\n0\n0\n1\n2\n0\n0\n0\n0\n0\n0\n1\n0\n0\n1\n2\n2\n2\n4\n0\n2\n0\n1\n3\n0\n2\n0\n1\n0\n2\n0\n2\n2\n3\n0\n3\n2\n0\n0\n0\n5\n2\n0\n6\n2\n5\n9\n1\n0\n0\n0\n0\n4\n0\n8\n10\n10\n0\n1\n1\n0\n4\n1\n1\n0\n1\n0\n0\n2\n0\n1\n0\n2\n0\n0\n1\n0\n1\n0\n0\n0\n1\n2\n5\n0\n1\n0\n2\n0\n2\n0\n0\n0\n0\n0\n1\n0\n0\n1\n1\n1\n0\n1\n2\n0\n0\n5\n2\n5\n0\n0\n6\n3\n8\n1\n4\n0\n1\n0\n0\n0\n0\n2\n0\n0\n2\n2\n0\n0\n1\n1\n1\n0\n0\n1\n1\n1\n0\n2\n0\n1\n1\n1\n1\n1\n2\n0\n1\n1\n1\n2\n0\n1\n0\n0\n1\n3\n1\n2\n4\n2\n0\n0\n0\n2\n2\n2\n0\n0\n1\n1\n0\n2\n3\n1\n0\n1\n2\n0\n0\n1\n1\n0\n0\n2\n3\n4\n2\n0\n0\n0\n0\n4\n0\n3\n1\n1\n2\n0\n0\n1\n0\n2\n2\n0\n1\n0\n4\n0\n0\n2\n0\n0\n4\n0\n3\n1\n0\n2\n0\n5\n5\n5\n0\n6\n6\n7\n2\n0\n0\n7\n0\n2\n1\n1\n0\n0\n5\n1\n0\n1\n2\n0\n1\n1\n0\n1\n1\n0\n1\n0\n1\n1\n3\n0\n1\n4\n4\n1\n1\n0\n1\n0\n1\n2\n2\n0\n3\n3\n0\n0\n2\n0\n2\n0\n1\n0\n0\n0\n1\n1\n0\n1\n0\n0\n3\n0\n1\n1\n1\n0\n0\n1\n0\n1\n0\n0\n0\n0\n2\n3\n2\n0\n0\n1\n1\n1\n0\n0\n0\n0\n0\n2\n1\n3\n3\n1\n1\n0\n0\n2\n1\n0\n0\n0\n2\n1\n2\n0\n0\n0\n2\n0\n2\n2\n1\n2\n1\n1\n1\n1\n1\n1\n1\n0\n0\n0\n0\n0\n0\n3\n3\n8\n1\n0\n0\n0\n5\n0\n1\n0\n0\n0\n0\n1\n0\n0\n1\n0\n0\n2\n1\n5\n0\n5\n0\n4\n0\n0\n0\n1\n4\n6\n0\n0\n0\n2\n2\n0\n1\n0\n1\n0\n0\n2\n0\n0\n0\n0\n2\n1\n5\n1\n0\n1\n0\n0\n1\n1\n3\n1\n1\n1\n1\n2\n1\n1\n0\n1\n0\n1\n2\n1\n1\n2\n1\n1\n0\n0\n1\n0\n2\n1\n0\n2\n3\n0\n3\n0\n0\n1\n2\n0\n0\n1\n0\n0\n0\n0\n2\n1\n0\n5\n1\n1\n0\n3\n0\n0\n0\n2\n1\n0\n0\n0\n1\n1\n2\n2\n3\n0\n4\n0\n1\n1\n5\n0\n2\n2\n2\n0\n2\n0\n1\n3\n4\n2\n1\n0\n0\n3\n0\n0\n0\n0\n1\n0\n1\n0\n0\n0\n1\n1\n0\n1\n0\n0\n0\n0\n2\n0\n0\n0\n2\n5\n0\n0\n0\n0\n0\n4\n0\n2\n0\n0\n2\n1\n1\n0\n2\n0\n3\n0\n3\n0\n0\n3\n2\n4\n0\n0\n0\n5\n0\n2\n1\n0\n0\n4\n0\n0\n0\n0\n0\n0\n2\n0\n0\n1\n1\n3\n0\n2\n1\n2\n1\n1\n2\n1\n0\n1\n0\n2\n4\n4\n4\n3\n0\n0\n7\n0\n8\n1\n9\n1\n7\n0\n0\n7\n1\n0\n1\n1\n1\n0\n0\n2\n1\n0\n3\n0\n2\n0\n1\n0\n1\n0\n1\n1\n1\n0\n4\n5\n2\n2\n0\n4\n0\n2\n3\n0\n0\n0\n0\n0\n0\n3\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n1\n0\n1\n1\n0\n0\n0\n1\n1\n0\n2\n0\n0\n0\n0\n0\n1\n4\n0\n0\n0\n1\n0\n4\n0\n1\n1\n0\n0\n1\n0\n1\n1\n2\n1\n0\n0\n2\n1\n0\n1\n0\n1\n1\n2\n1\n1\n2\n2\n1\n1\n1\n1\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n1\n2\n0\n0\n2\n0\n0\n4\n0\n0\n0\n0\n1\n0\n0\n1\n2\n0\n2\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n2\n1\n0\n0\n0\n0\n1\n1\n1\n0\n0\n1\n0\n0\n2\n0\n1\n0\n1\n1\n1\n1\n0\n1\n1\n1\n1\n0\n3\n0\n0\n0\n0\n0\n0\n4\n3\n2\n5\n2\n0\n0\n0\n0\n10\n4\n9\n9\n2\n10\n6\n0\n5\n5\n0\n5\n11\n9\n0\n8\n7\n0\n0\n6\n0\n2\n3\n0\n0\n0\n0\n2\n0\n0\n1\n1\n2\n2\n0\n0\n1\n0\n0\n0\n2\n0\n2\n2\n1\n3\n2\n2\n2\n0\n0\n0\n2\n3\n0\n0\n1\n1\n2\n1\n3\n1\n1\n0\n1\n0\n1\n1\n0\n1\n0\n0\n0\n0\n0\n0\n1\n0\n0\n1\n0\n0\n3\n0\n0\n0\n0\n1\n1\n0\n0\n3\n3\n0\n3\n4\n0\n1\n3\n3\n0\n1\n0\n1\n0\n0\n0\n1\n7\n1\n7\n7\n0\n0\n3\n7\n2\n7\n0\n10\n0\n0\n2\n1\n0\n0\n3\n0\n0\n0\n3\n0\n2\n0\n2\n2\n0\n4\n2\n2\n2\n0\n2\n0\n0\n2\n0\n1\n0\n1\n1\n0\n1\n0\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n1\n6\n0\n0\n1\n2\n0\n0\n1\n0\n4\n0\n0\n1\n0\n2\n0\n1\n3\n2\n2\n0\n3\n1\n0\n0\n0\n0\n0\n0\n0\n1\n0\n2\n0\n0\n0\n0\n2\n0\n1\n2\n2\n0\n2\n3\n2\n1\n0\n0\n0\n3\n1\n2\n0\n1\n0\n0\n0\n2\n0\n1\n0\n0\n1\n1\n1\n0\n0\n0\n1\n1\n1\n1\n0\n0\n0\n1\n2\n2\n0\n1\n2\n3\n2\n0\n0\n3\n0\n3\n1\n2\n2\n0\n0\n0\n0\n1\n0\n1\n1\n0\n0\n0\n2\n0\n1\n0\n0\n2\n0\n0\n0\n1\n0\n0\n0\n2\n0\n2\n0\n2\n0\n1\n1\n0\n0\n6\n0\n0\n0\n0\n5\n1\n0\n3\n1\n0\n1\n0\n0\n1\n0\n1\n1\n1\n1\n1\n0\n0\n0\n0\n0\n3\n0\n0\n3\n4\n3\n0\n1\n2\n0\n1\n0\n0\n5\n2\n0\n1\n0\n3\n0\n0\n0\n0\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n4\n5\n0\n0\n0\n3\n0\n1\n0\n1\n1\n2\n0\n0\n3\n0\n0\n0\n1\n4\n4\n1\n0\n1\n0\n1\n2\n0\n1\n1\n3\n2\n0\n3\n1\n0\n0\n2\n0\n0\n0\n1\n1\n0\n0\n0\n1\n2\n0\n0\n1\n1\n0\n0\n0\n5\n0\n0\n0\n1\n0\n0\n0\n0\n0\n1\n1\n0\n0\n1\n1\n0\n2\n0\n0\n0\n0\n0\n1\n0\n0\n1\n4\n1\n0\n0\n1\n3\n2\n0\n0\n2\n2\n1\n3\n0\n0\n2\n0\n0\n0\n0\n0\n3\n0\n1\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n1\n1\n0\n1\n0\n2\n0\n0\n0\n0\n0\n1\n0\n0\n1\n0\n0\n2\n2\n2\n3\n0\n0\n2\n0\n0\n1\n1\n2\n0\n0\n1\n0\n0\n1\n1\n1\n2\n0\n2\n0\n1\n1\n0\n3\n0\n0\n4\n1\n2\n0\n0\n1\n3\n0\n1\n5\n2\n1\n0\n1\n0\n0\n1\n5\n0\n2\n0\n0\n0\n2\n0\n2\n1\n0\n1\n0\n1\n0\n1\n0\n2\n0\n0\n3\n2\n0\n0\n6\n0\n0\n2\n1\n1\n0\n0\n0\n0\n1\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n1\n1\n1\n0\n3\n3\n1\n4\n0\n0\n1\n3\n1\n0\n0\n2\n1\n3\n7\n0\n0\n3\n1\n0\n1\n2\n1\n1\n0\n3\n0\n0\n3\n3\n3\n0\n5\n0\n2\n0\n3\n1\n1\n0\n1\n1\n1\n0\n0\n2\n3\n5\n3\n0\n0\n1\n1\n1\n0\n2\n1\n0\n1\n0\n0\n0\n1\n2\n1\n0\n0\n2\n0\n1\n2\n1\n0\n0\n0\n1\n1\n0\n0\n0\n4\n3\n2\n2\n1\n0\n5\n0\n0\n2\n0\n0\n3\n0\n0\n0\n0\n3\n0\n5\n2\n1\n0\n3\n0\n3\n3\n1\n0\n0\n3\n0\n0\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n1\n0\n0\n2\n0\n3\n4\n0\n0\n2\n0\n1\n0\n0\n0\n2\n2\n0\n0\n0\n0\n2\n2\n0\n0\n1\n0\n0\n0\n0\n2\n0\n2\n0\n1\n1\n0\n1\n0\n2\n0\n0\n1\n0\n0\n0\n2\n0\n1\n1\n0\n0\n1\n1\n0\n1\n1\n0\n2\n1\n2\n0\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n2\n2\n5\n0\n1\n0\n0\n0\n1\n0\n0\n0\n2\n0\n1\n0\n0\n2\n0\n0\n1\n0\n0\n1\n0\n1\n1\n2\n0\n0\n0\n0\n4\n0\n1\n1\n0\n0\n1\n1\n0\n1\n0\n0\n3\n1\n1\n0\n0\n0\n0\n0\n1\n0\n1\n2\n0\n0\n0\n0\n1\n0\n1\n1\n0\n0\n1\n0\n0\n1\n0\n3\n0\n2\n0\n1\n1\n2\n3\n3\n3\n0\n0\n0\n1\n2\n2\n1\n0\n1\n0\n1\n0\n1\n1\n1\n1\n1\n0\n1\n2\n0\n1\n3\n0\n2\n1\n1\n0\n3\n0\n2\n0\n2\n3\n0\n4\n0\n5\n3\n3\n2\n0\n1\n0\n0\n0\n7\n2\n8\n0\n1\n3\n2\n2\n4\n0\n0\n2\n0\n0\n0\n0\n5\n0\n0\n4\n0\n5\n1\n0\n0\n2\n2\n0\n2\n0\n0\n0\n6\n0\n0\n0\n1\n0\n0\n0\n0\n3\n2\n0\n0\n0\n2\n0\n2\n3\n1\n1\n1\n1\n1\n1\n0\n1\n1\n1\n0\n1\n0\n0\n1\n0\n0\n1\n0\n0\n1\n1\n0\n1\n0\n0\n1\n0\n4\n0\n0\n0\n4\n4\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n1\n1\n2\n1\n3\n1\n4\n4\n1\n4\n2\n0\n1\n1\n0\n0\n5\n7\n0\n0\n0\n0\n4\n0\n0\n4\n0\n0\n1\n5\n0\n0\n1\n5\n0\n0\n0\n1\n1\n3\n0\n0\n3\n2\n0\n0\n1\n1\n0\n1\n5\n1\n1\n3\n0\n0\n2\n1\n3\n0\n0\n2\n0\n1\n0\n1\n1\n0\n1\n3\n0\n2\n0\n4\n0\n1\n0\n0\n1\n0\n7\n1\n0\n0\n7\n3\n0\n1\n0\n2\n2\n3\n2\n0\n0\n0\n4\n4\n4\n2\n2\n0\n3\n0\n0\n3\n0\n3\n1\n2\n4\n3\n0\n1\n0\n2\n1\n2\n0\n0\n2\n1\n0\n0\n2\n1\n1\n0\n2\n0\n0\n2\n1\n0\n3\n3\n0\n0\n2\n0\n0\n0\n0\n0\n1\n0\n0\n0\n1\n3\n0\n3\n0\n4\n0\n0\n0\n0\n1\n0\n0\n0\n1\n0\n0\n1\n1\n0\n1\n3\n0\n2\n3\n0\n0\n0\n3\n0\n0\n1\n1\n1\n0\n1\n0\n1\n4\n2\n0\n0\n0\n3\n1\n2\n0\n0\n0\n1\n0\n0\n0\n1\n0\n0\n1\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n2\n0\n1\n0\n2\n3\n5\n2\n0\n0\n1\n0\n5\n2\n2\n0\n2\n6\n0\n4\n5\n2\n0\n1\n1\n0\n0\n0\n1\n0\n1\n0\n0\n0\n1\n3\n0\n3\n4\n0\n0\n0\n1\n1\n0\n2\n1\n1\n6\n2\n2\n2\n5\n1\n2\n0\n0\n0\n1\n3\n1\n1\n0\n0\n0\n7\n0\n0\n0\n1\n1\n0\n0\n1\n1\n2\n0\n1\n0\n1\n1\n1\n0\n1\n0\n1\n1\n1\n0\n2\n2\n0\n0\n0\n2\n3\n2\n0\n0\n0\n0\n1\n0\n1\n0\n0\n1\n0\n1\n1\n1\n1\n0\n1\n0\n0\n1\n1\n0\n0\n2\n1\n0\n1\n0\n1\n0\n1\n2\n0\n1\n2\n0\n4\n3\n3\n0\n0\n2\n0\n0\n0\n0\n4\n1\n1\n0\n0\n0\n2\n0\n3\n2\n5\n0\n0\n0\n2\n2\n0\n2\n2\n2\n2\n2\n0\n4\n0\n0\n5\n0\n0\n0\n0\n0\n1\n0\n2\n1\n1\n2\n0\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n2\n0\n2\n1\n4\n1\n1\n1\n1\n0\n0\n0\n0\n0\n0\n1\n6\n0\n0\n1\n1\n1\n0\n1\n2\n1\n1\n0\n0\n0\n1\n0\n1\n0\n0\n2\n0\n1\n1\n1\n0\n1\n1\n1\n1\n2\n2\n0\n0\n0\n1\n0\n0\n1\n1\n2\n1\n2\n2\n2\n0\n4\n0\n3\n1\n4\n0\n6\n0\n6\n0\n1\n1\n1\n1\n0\n1\n0\n2\n1\n0\n0\n0\n0\n0\n0\n0\n4\n0\n2\n2\n0\n0\n0\n5\n0\n0\n7\n3\n0\n0\n0\n5\n0\n1\n2\n0\n0\n1\n0\n3\n0\n0\n0\n2\n1\n4\n0\n2\n0\n0\n3\n4\n1\n0\n0\n1\n0\n3\n1\n0\n0\n1\n4\n4\n0\n1\n2\n0\n0\n2\n1\n1\n0\n0\n1\n1\n0\n1\n2\n1\n0\n2\n2\n0\n0\n2\n0\n0\n1\n1\n0\n0\n3\n0\n0\n1\n0\n0\n0\n2\n0\n0\n0\n0\n0\n2\n0\n0\n0\n1\n2\n0\n3\n2\n3\n0\n0\n0\n2\n1\n0\n0\n0\n0\n2\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n2\n0\n0\n0\n1\n0\n0\n1\n1\n0\n1\n0\n0\n0\n1\n0\n1\n0\n0\n2\n0\n0\n0\n0\n0\n1\n0\n1\n0\n0\n0\n4\n1\n0\n1\n4\n1\n2\n0\n0\n0\n0\n2\n0\n0\n0\n2\n1\n1\n0\n0\n0\n4\n4\n2\n0\n3\n2\n3\n0\n2\n2\n0\n4\n5\n2\n4\n8\n0\n0\n1\n0\n0\n0\n3\n4\n0\n0\n2\n2\n0\n3\n4\n2\n1\n1\n1\n1\n0\n1\n2\n0\n1\n2\n2\n2\n0\n2\n0\n0\n3\n0\n3\n2\n0\n1\n1\n0\n1\n0\n1\n0\n0\n1\n1\n0\n0\n0\n0\n1\n2\n2\n0\n1\n0\n1\n1\n2\n0\n0\n2\n0\n1\n0\n4\n0\n1\n2\n1\n0\n0\n0\n0\n0\n7\n3\n1\n0\n1\n3\n2\n0\n0\n0\n1\n3\n7\n0\n1\n0\n1\n0\n2\n4\n1\n0\n5\n1\n0\n0\n2\n1\n0\n1\n1\n0\n1\n1\n0\n2\n0\n0\n2\n2\n0\n1\n0\n1\n0\n1\n0\n0\n1\n0\n1\n0\n0\n1\n1\n0\n1\n1\n5\n3\n0\n4\n0\n0\n0\n0\n0\n0\n7\n0\n1\n1\n1\n1\n1\n1\n0\n0\n5\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n3\n1\n0\n1\n0\n2\n0\n0\n3\n0\n2\n0\n2\n1\n0\n1\n0\n1\n0\n4\n0\n3\n0\n2\n5\n0\n2\n2\n0\n4\n4\n1\n0\n0\n4\n1\n0\n2\n0\n1\n0\n0\n3\n0\n1\n1\n1\n0\n0\n1\n0\n1\n0\n0\n0\n1\n1\n2\n1\n0\n1\n0\n1\n1\n1\n1\n0\n2\n2\n0\n2\n1\n4\n2\n0\n0\n4\n2\n1\n2\n3\n1\n0\n2\n0\n2\n2\n2\n0\n2\n1\n0\n3\n2\n1\n3\n0\n0\n0\n3\n0\n2\n0\n0\n2\n0\n0\n3\n0\n2\n0\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n2\n0\n0\n1\n2\n4\n0\n0\n0\n0\n0\n0\n4\n0\n2\n1\n1\n1\n0\n0\n0\n1\n0\n0\n0\n1\n2\n2\n0\n0\n3\n1\n2\n0\n6\n0\n8\n0\n2\n7\n0\n1\n1\n1\n1\n8\n2\n0\n7\n2\n3\n0\n4\n0\n0\n0\n1\n2\n0\n2\n0\n1\n0\n1\n0\n0\n1\n0\n3\n0\n4\n0\n4\n0\n1\n0\n0\n2\n2\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n1\n2\n4\n1\n2\n1\n0\n1\n8\n0\n0\n0\n0\n3\n3\n1\n1\n2\n0\n0\n0\n0\n0\n0\n2\n0\n0\n2\n0\n0\n2\n0\n0\n4\n5\n0\n1\n0\n0\n0\n1\n1\n0\n0\n1\n0\n0\n1\n1\n2\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n4\n0\n0\n0\n0\n2\n0\n0\n2\n0\n1\n3\n1\n1\n1\n0\n2\n1\n0\n2\n4\n1\n2\n0\n1\n0\n1\n1\n1\n0\n0\n1\n0\n1\n0\n0\n0\n0\n1\n0\n0\n5\n1\n5\n5\n4\n0\n0\n0\n1\n0\n0\n4\n2\n1\n1\n1\n1\n0\n1\n1\n1\n1\n2\n0\n3\n0\n3\n1\n1\n0\n2\n0\n2\n0\n2\n0\n0\n1\n0\n1\n1\n0\n1\n1\n1\n1\n0\n1\n1\n0\n0\n1\n0\n0\n3\n0\n0\n0\n3\n1\n0\n0\n2\n4\n0\n1\n0\n0\n0\n4\n0\n0\n0\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n1\n1\n0\n0\n0\n3\n0\n3\n0\n4\n1\n1\n0\n0\n2\n2\n1\n0\n1\n1\n0\n1\n2\n0\n0\n3\n0\n0\n1\n1\n0\n1\n0\n0\n0\n0\n0\n0\n0\n1\n2\n1\n1\n1\n0\n2\n1\n0\n0\n2\n0\n0\n0\n5\n4\n0\n7\n0\n5\n0\n4\n4\n0\n0\n4\n1\n2\n1\n2\n1\n0\n1\n0\n1\n1\n1\n0\n1\n1\n1\n0\n0\n1\n1\n0\n2\n0\n0\n0\n0\n0\n2\n0\n3\n5\n1\n0\n0\n2\n0\n0\n1\n1\n2\n1\n5\n3\n0\n0\n0\n1\n1\n0\n0\n5\n0\n0\n0\n0\n1\n0\n0\n0\n1\n0\n2\n0\n0\n1\n1\n0\n0\n1\n1\n0\n2\n2\n0\n0\n2\n0\n0\n0\n0\n1\n1\n0\n0\n0\n2\n0\n0\n1\n1\n0\n3\n0\n1\n1\n1\n0\n0\n0\n1\n0\n2\n2\n0\n0\n0\n1\n0\n1\n1\n1\n0\n2\n0\n4\n3\n0\n0\n0\n1\n2\n0\n1\n0\n2\n0\n0\n1\n0\n0\n0\n0\n3\n5\n0\n2\n6\n0\n0\n4\n0\n2\n3\n0\n0\n3\n0\n2\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n1\n0\n0\n1\n1\n0\n1\n1\n1\n0\n1\n0\n2\n1\n0\n0\n0\n1\n0\n0\n0\n2\n2\n2\n0\n4\n0\n0\n0\n1\n1\n1\n1\n1\n2\n0\n0\n0\n0\n1\n2\n1\n0\n1\n1\n0\n0\n1\n0\n0\n0\n1\n0\n1\n3\n0\n0\n1\n0\n2\n2\n1\n1\n0\n0\n0\n0\n1\n0\n1\n1\n0\n2\n1\n1\n0\n2\n1\n2\n0\n0\n2\n0\n2\n1\n3\n2\n1\n2\n0\n0\n2\n2\n0\n3\n3\n0\n0\n0\n2\n0\n0\n0\n0\n1\n0\n2\n0\n0\n0\n0\n0\n0\n4\n0\n0\n2\n0\n1\n0\n0\n0\n2\n3\n3\n3\n2\n0\n1\n0\n5\n0\n0\n4\n0\n1\n0\n1\n0\n0\n3\n0\n0\n0\n0\n1\n1\n0\n0\n0\n1\n1\n1\n0\n0\n1\n2\n1\n1\n2\n1\n2\n4\n1\n0\n0\n3\n1\n3\n3\n1\n0\n3\n1\n1\n0\n2\n0\n2\n0\n0\n5\n0\n2\n0\n5\n0\n3\n2\n0\n0\n8\n0\n2\n3\n0\n0\n0\n0\n6\n1\n0\n0\n0\n8\n0\n0\n0\n0\n2\n3\n0\n0\n2\n0\n0\n1\n3\n3\n5\n0\n3\n1\n0\n0\n0\n0\n2\n0\n0\n0\n5\n2\n5\n2\n1\n1\n2\n0\n1\n1\n0\n1\n1\n1\n2\n3\n0\n2\n3\n2\n0\n2\n0\n2\n0\n1\n0\n0\n0\n1\n0\n0\n0\n1\n1\n1\n0\n2\n2\n0\n0\n3\n0\n0\n0\n0\n3\n0\n1\n0\n1\n1\n0\n1\n0\n0\n1\n0\n0\n0\n1\n1\n0\n0\n1\n2\n0\n1\n0\n1\n0\n2\n0\n3\n0\n3\n0\n0\n0\n0\n0\n0\n0\n0\n3\n0\n2\n0\n0\n0\n2\n0\n0\n2\n0\n0\n4\n3\n0\n0\n0\n0\n1\n0\n0\n0\n1\n1\n1\n0\n1\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n2\n2\n2\n0\n3\n4\n0\n4\n0\n1\n0\n1\n1\n0\n0\n0\n0\n0\n0\n3\n1\n6\n0\n0\n2\n0\n0\n0\n1\n2\n0\n0\n0\n0\n0\n0\n3\n3\n4\n2\n3\n0\n0\n0\n0\n0\n0\n4\n1\n1\n0\n1\n0\n0\n0\n0\n1\n0\n2\n6\n1\n1\n0\n1\n0\n0\n0\n0\n3\n3\n3\n2\n0\n0\n0\n0\n5\n0\n0\n2\n1\n3\n0\n0\n1\n2\n0\n7\n0\n6\n6\n0\n3\n1\n1\n0\n1\n0\n1\n1\n0\n1\n4\n1\n2\n1\n2\n0\n3\n2\n0\n0\n0\n0\n0\n1\n1\n0\n0\n3\n0\n0\n0\n3\n0\n0\n0\n0\n3\n0\n1\n1\n1\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n1\n4\n0\n1\n0\n1\n0\n1\n2\n0\n3\n2\n0\n0\n1\n1\n1\n1\n1\n1\n0\n1\n1\n1\n0\n2\n2\n2\n0\n4\n2\n1\n1\n0\n0\n1\n5\n0\n0\n0\n0\n1\n1\n0\n0\n3\n3\n0\n1\n1\n1\n0\n1\n2\n1\n0\n0\n0\n0\n0\n3\n1\n0\n0\n2\n0\n0\n5\n2\n0\n0\n5\n0\n0\n5\n5\n4\n5\n6\n5\n10\n0\n0\n1\n0\n0\n1\n1\n1\n0\n1\n1\n1\n1\n0\n1\n2\n0\n1\n1\n0\n1\n0\n2\n0\n2\n0\n2\n0\n0\n1\n1\n3\n0\n2\n0\n0\n0\n0\n6\n0\n3\n0\n0\n1\n0\n5\n2\n4\n2\n0\n0\n0\n0\n0\n3\n0\n2\n0\n0\n0\n1\n0\n0\n3\n0\n0\n1\n1\n0\n0\n0\n1\n2\n2\n0\n1\n0\n0\n1\n1\n1\n0\n0\n4\n0\n0\n1\n0\n0\n0\n0\n0\n6\n0\n5\n6\n0\n0\n6\n1\n0\n6\n0\n1\n0\n2\n1\n2\n0\n0\n2\n0\n1\n0\n0\n0\n1\n0\n1\n0\n0\n1\n1\n1\n3\n0\n2\n1\n0\n1\n2\n0\n0\n0\n2\n3\n3\n0\n0\n1\n1\n2\n1\n1\n1\n0\n0\n0\n2\n0\n2\n3\n2\n0\n4\n0\n3\n4\n0\n1\n1\n0\n2\n1\n0\n4\n2\n0\n0\n0\n4\n0\n2\n0\n2\n0\n0\n4\n6\n0\n1\n2\n1\n0\n0\n0\n0\n3\n2\n1\n0\n0\n0\n2\n2\n0\n0\n3\n0\n5\n3\n6\n0\n0\n0\n1\n0\n0\n0\n1\n2\n1\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n1\n0\n1\n0\n0\n0\n0\n4\n0\n2\n1\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n1\n1\n0\n2\n1\n2\n2\n0\n2\n0\n0\n2\n2\n0\n1\n0\n1\n1\n1\n0\n0\n0\n1\n1\n0\n1\n1\n2\n2\n2\n2\n0\n0\n2\n2\n1\n0\n0\n2\n2\n0\n0\n1\n1\n1\n1\n0\n1\n1\n0\n0\n0\n0\n0\n1\n0\n1\n1\n0\n1\n1\n2\n1\n0\n1\n0\n0\n0\n1\n0\n2\n2\n0\n0\n1\n2\n1\n1\n0\n0\n0\n3\n0\n4\n3\n0\n0\n1\n0\n0\n0\n5\n0\n0\n3\n0\n0\n3\n3\n0\n0\n3\n0\n3\n3\n0\n0\n0\n1\n1\n1\n1\n0\n1\n2\n0\n0\n1\n0\n1\n0\n1\n0\n0\n0\n0\n1\n1\n2\n1\n0\n0\n1\n3\n2\n1\n2\n2\n0\n4\n0\n0\n0\n0\n0\n1\n1\n1\n0\n1\n1\n0\n0\n1\n0\n0\n2\n0\n2\n3\n1\n2\n2\n0\n0\n2\n0\n2\n1\n1\n0\n0\n0\n0\n0\n0\n1\n0\n1\n2\n2\n0\n4\n1\n1\n1\n1\n0\n0\n1\n1\n1\n1\n0\n0\n2\n1\n2\n2\n1\n0\n0\n0\n1\n1\n0\n0\n0\n2\n4\n0\n3\n0\n0\n0\n2\n3\n2\n0\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n4\n0\n3\n3\n1\n0\n0\n0\n3\n0\n4\n1\n1\n5\n0\n1\n0\n2\n0\n2\n1\n0\n0\n3\n0\n1\n0\n0\n0\n1\n0\n0\n0\n4\n0\n0\n0\n1\n0\n3\n4\n0\n0\n3\n4\n6\n0\n0\n0\n5\n0\n0\n4\n0\n1\n0\n0\n0\n7\n0\n0\n1\n0\n1\n0\n1\n0\n3\n1\n2\n0\n0\n3\n3\n3\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n0\n1\n0\n1\n0\n2\n2\n0\n2\n2\n2\n2\n0\n0\n0\n2\n0\n2\n0\n6\n0\n0\n7\n4\n0\n7\n0\n0\n0\n5\n9\n0\n1\n1\n2\n0\n1\n0\n1\n2\n2\n2\n0\n1\n1\n0\n1\n0\n1\n0\n1\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n4\n5\n0\n0\n0\n0\n0\n0\n1\n1\n1\n2\n0\n0\n0\n0\n0\n1\n1\n1\n0\n0\n0\n2\n0\n0\n4\n1\n2\n1\n0\n0\n0\n0\n1\n0\n2\n4\n0\n0\n0\n1\n0\n0\n0\n0\n1\n1\n0\n0\n1\n0\n1\n0\n0\n1\n0\n0\n1\n0\n0\n2\n2\n0\n0\n0\n1\n0\n3\n0\n3\n0\n0\n0\n0\n0\n0\n4\n0\n4\n3\n0\n1\n0\n0\n0\n1\n1\n5\n1\n0\n0\n2\n1\n0\n0\n0\n1\n4\n1\n0\n0\n3\n0\n0\n2\n0\n0\n3\n3\n4\n0\n2\n1\n1\n2\n0\n0\n2\n4\n2\n7\n0\n0\n1\n1\n0\n0\n2\n0\n5\n0\n0\n0\n0\n3\n1\n2\n2\n0\n2\n2\n1\n2\n0\n0\n0\n0\n1\n0\n0\n1\n1\n1\n2\n0\n1\n2\n0\n2\n0\n0\n0\n0\n3\n0\n0\n0\n2\n3\n0\n0\n3\n0\n3\n1\n1\n1\n0\n1\n0\n0\n3\n5\n4\n0\n0\n4\n0\n1\n1\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n3\n0\n0\n2\n0\n0\n0\n1\n0\n3\n0\n1\n0\n0\n0\n0\n0\n1\n2\n0\n0\n0\n1\n1\n1\n1\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n0\n1\n0\n1\n2\n2\n0\n0\n0\n0\n1\n0\n1\n1\n0\n0\n0\n0\n2\n2\n2\n2\n2\n0\n0\n3\n3\n0\n0\n0\n0\n0\n1\n0\n1\n0\n0\n5\n1\n3\n3\n2\n1\n4\n1\n1\n0\n1\n2\n0\n1\n2\n0\n0\n1\n0\n1\n1\n0\n1\n1\n0\n0\n0\n2\n0\n0\n0\n0\n1\n0\n1\n1\n1\n2\n0\n3\n0\n0\n0\n0\n1\n0\n0\n0\n1\n0\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n1\n3\n1\n2\n3\n0\n1\n0\n0\n0\n1\n0\n0\n1\n2\n0\n0\n1\n1\n1\n0\n3\n2\n0\n0\n3\n2\n0\n0\n2\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n5\n0\n0\n5\n2\n3\n6\n0\n5\n2\n1\n1\n0\n0\n1\n0\n1\n2\n2\n1\n1\n2\n1\n1\n1\n4\n0\n3\n0\n1\n0\n1\n1\n2\n0\n1\n1\n1\n0\n1\n1\n1\n2\n0\n0\n0\n1\n1\n1\n1\n0\n0\n1\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n1\n0\n3\n0\n6\n0\n1\n0\n1\n2\n0\n0\n0\n0\n1\n0\n1\n4\n0\n0\n0\n2\n0\n0\n2\n1\n1\n1\n0\n0\n1\n0\n1\n1\n0\n4\n0\n0\n0\n0\n0\n2\n0\n1\n0\n2\n0\n3\n0\n3\n0\n6\n0\n6\n0\n0\n0\n0\n5\n3\n0\n0\n0\n1\n0\n0\n0\n0\n0\n1\n2\n0\n1\n0\n0\n0\n6\n0\n0\n3\n0\n1\n0\n0\n0\n0\n0\n1\n1\n1\n1\n1\n0\n1\n1\n0\n0\n0\n0\n2\n2\n0\n0\n1\n1\n0\n1\n0\n1\n1\n1\n2\n0\n1\n0\n0\n0\n3\n2\n1\n2\n0\n2\n1\n0\n0\n2\n0\n2\n0\n1\n0\n0\n2\n3\n1\n1\n0\n1\n0\n0\n0\n1\n0\n0\n4\n1\n0\n0\n0\n1\n0\n1\n0\n1\n0\n1\n2\n1\n1\n1\n1\n1\n0\n0\n1\n1\n0\n0\n1\n0\n1\n2\n0\n1\n0\n1\n1\n0\n0\n0\n0\n5\n1\n1\n1\n0\n0\n2\n1\n1\n1\n0\n3\n1\n0\n0\n0\n1\n2\n3\n2\n2\n0\n0\n0\n0\n0\n0\n5\n0\n1\n1\n4\n4\n8\n1\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n8\n0\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n2\n0\n1\n1\n1\n1\n0\n1\n1\n1\n2\n1\n1\n0\n0\n0\n0\n0\n1\n0\n2\n2\n1\n1\n0\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n2\n0\n0\n0\n2\n0\n2\n2\n3\n4\n0\n3\n0\n1\n2\n2\n2\n0\n1\n2\n0\n1\n1\n0\n0\n0\n3\n0\n0\n0\n0\n5\n0\n0\n0\n0\n2\n5\n3\n1\n0\n0\n1\n0\n3\n1\n1\n1\n2\n3\n1\n1\n1\n1\n0\n0\n1\n1\n1\n0\n1\n0\n0\n2\n2\n0\n1\n0\n1\n1\n1\n1\n1\n2\n1\n0\n1\n1\n0\n2\n1\n1\n0\n1\n1\n1\n0\n1\n1\n0\n0\n3\n1\n0\n2\n1\n1\n3\n0\n1\n0\n1\n0\n0\n1\n0\n0\n0\n4\n0\n2\n4\n0\n5\n2\n2\n0\n0\n0\n1\n0\n0\n1\n1\n1\n1\n0\n0\n1\n0\n0\n1\n2\n0\n1\n3\n1\n2\n2\n3\n0\n1\n0\n1\n6\n1\n0\n1\n0\n0\n1\n0\n1\n1\n1\n1\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n2\n0\n0\n1\n0\n0\n0\n2\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n2\n0\n0\n3\n0\n0\n0\n0\n0\n2\n0\n0\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n1\n0\n3\n1\n2\n2\n0\n3\n0\n0\n0\n0\n1\n0\n0\n1\n2\n0\n0\n0\n2\n1\n1\n1\n0\n0\n2\n0\n1\n0\n1\n2\n1\n1\n0\n1\n1\n0\n1\n0\n0\n0\n1\n0\n1\n0\n0\n1\n1\n1\n0\n0\n2\n3\n0\n4\n0\n0\n3\n0\n0\n2\n2\n0\n2\n0\n4\n0\n1\n0\n0\n3\n0\n3\n0\n4\n0\n0\n5\n1\n0\n0\n0\n0\n0\n1\n0\n0\n0\n2\n0\n1\n1\n2\n0\n1\n1\n1\n0\n1\n0\n0\n1\n1\n2\n2\n0\n2\n4\n1\n0\n0\n0\n1\n1\n0\n1\n1\n1\n0\n1\n0\n1\n0\n0\n1\n1\n1\n0\n2\n2\n0\n0\n1\n0\n2\n2\n0\n0\n1\n2\n0\n0\n0\n0\n0\n5\n6\n0\n1\n0\n0\n5\n0\n0\n0\n5\n0\n0\n0\n2\n2\n0\n2\n3\n0\n0\n5\n0\n0\n0\n3\n0\n1\n0\n1\n0\n2\n2\n0\n8\n1\n0\n1\n2\n2\n3\n1\n1\n1\n0\n3\n1\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n1\n1\n1\n0\n0\n0\n0\n1\n1\n1\n0\n0\n0\n2\n0\n0\n0\n0\n0\n0\n1\n0\n1\n1\n0\n0\n0\n0\n1\n1\n1\n0\n2\n0\n0\n2\n2\n1\n0\n1\n0\n1\n3\n1\n4\n0\n0\n0\n4\n4\n3\n0\n4\n0\n1\n0\n0\n0\n1\n3\n0\n4\n0\n0\n0\n1\n1\n0\n0\n1\n0\n0\n0\n0\n2\n0\n2\n1\n1\n0\n0\n1\n0\n1\n2\n0\n0\n0\n1\n1\n0\n0\n2\n1\n5\n0\n4\n0\n3\n1\n0\n1\n1\n0\n3\n0\n2\n1\n2\n1\n2\n1\n0\n0\n5\n0\n5\n0\n0\n4\n0\n0\n2\n5\n0\n1\n0\n1\n0\n0\n0\n2\n0\n1\n0\n2\n0\n1\n1\n0\n0\n2\n1\n0\n0\n1\n1\n1\n0\n1\n0\n0\n1\n0\n0\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n2\n0\n0\n0\n1\n1\n1\n1\n2\n3\n1\n2\n0\n1\n1\n1\n1\n0\n2\n2\n2\n0\n0\n0\n0\n0\n2\n1\n0\n3\n0\n1\n0\n2\n0\n0\n0\n0\n0\n1\n0\n1\n1\n1\n0\n2\n0\n0\n2\n0\n1\n2\n0\n0\n3\n0\n0\n1\n0\n1\n0\n2\n1\n1\n0\n1\n1\n2\n0\n0\n0\n2\n0\n3\n3\n5\n3\n2\n0\n3\n0\n0\n0\n4\n1\n0\n4\n2\n2\n0\n0\n1\n0\n0\n1\n0\n1\n2\n0\n0\n2\n0\n0\n1\n0\n1\n0\n1\n2\n1\n2\n2\n0\n0\n3\n3\n0\n0\n0\n0\n1\n1\n0\n0\n1\n0\n1\n2\n0\n0\n3\n0\n0\n2\n0\n1\n0\n0\n0\n3\n0\n1\n2\n0\n0\n1\n1\n5\n2\n0\n3\n0\n0\n2\n0\n0\n3\n1\n0\n3\n0\n2\n2\n3\n0\n1\n1\n2\n0\n0\n3\n1\n2\n1\n1\n1\n0\n0\n0\n2\n0\n0\n0\n5\n0\n0\n0\n1\n1\n0\n0\n0\n0\n3\n1\n1\n0\n0\n0\n0\n1\n0\n1\n0\n2\n0\n0\n4\n0\n0\n3\n2\n0\n4\n1\n2\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n1\n1\n1\n0\n1\n2\n2\n2\n0\n1\n0\n1\n1\n0\n0\n1\n0\n0\n0\n1\n1\n1\n0\n0\n1\n0\n0\n1\n1\n0\n0\n1\n0\n3\n2\n2\n1\n0\n0\n0\n1\n0\n0\n0\n1\n0\n1\n0\n0\n0\n1\n0\n0\n3\n0\n0\n1\n0\n0\n1\n3\n0\n0\n0\n2\n0\n0\n0\n4\n0\n0\n3\n2\n1\n1\n1\n0\n0\n1\n1\n1\n0\n0\n0\n0\n0\n1\n0\n1\n0\n0\n0\n3\n0\n2\n0\n3\n0\n0\n2\n0\n0\n0\n0\n0\n3\n2\n1\n1\n0\n2\n4\n2\n2\n2\n2\n0\n1\n0\n0\n4\n1\n4\n0\n2\n0\n1\n1\n0\n0\n1\n1\n2\n1\n0\n0\n1\n1\n0\n0\n2\n1\n2\n2\n0\n1\n0\n1\n1\n1\n0\n0\n0\n1\n1\n2\n1\n2\n0\n1\n0\n0\n0\n0\n0\n6\n0\n1\n0\n1\n4\n6\n0\n3\n1\n4\n0\n0\n0\n0\n5\n3\n0\n1\n0\n6\n0\n0\n2\n0\n1\n1\n1\n2\n1\n0\n0\n1\n0\n0\n2\n0\n0\n0\n2\n0\n2\n1\n0\n0\n3\n3\n3\n2\n7\n2\n0\n1\n0\n0\n2\n0\n0\n0\n1\n0\n2\n1\n0\n0\n3\n1\n0\n0\n3\n2\n3\n0\n0\n1\n0\n1\n1\n0\n0\n0\n0\n1\n1\n1\n0\n0\n0\n2\n1\n0\n1\n1\n0\n1\n0\n1\n2\n1\n0\n0\n5\n0\n3\n1\n3\n4\n2\n0\n0\n2\n2\n0\n0\n1\n0\n0\n0\n0\n1\n1\n1\n1\n0\n0\n0\n0\n0\n2\n1\n3\n4\n0\n3\n0\n0\n2\n0\n0\n1\n2\n2\n2\n0\n2\n1\n2\n1\n3\n1\n1\n0\n1\n0\n0\n0\n0\n0\n1\n0\n1\n1\n1\n0\n1\n1\n1\n1\n1\n1\n0\n0\n2\n2\n2\n0\n2\n0\n4\n0\n0\n0\n0\n2\n1\n0\n0\n0\n1\n1\n4\n1\n2\n0\n0\n1\n0\n0\n2\n0\n1\n0\n0\n1\n2\n0\n0\n0\n1\n2\n0\n0\n0\n0\n0\n0\n0\n2\n2\n2\n0\n1\n1\n2\n0\n1\n2\n2\n0\n0\n3\n0\n1\n2\n0\n1\n2\n0\n0\n0\n3\n0\n3\n2\n0\n0\n5\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n1\n1\n0\n1\n0\n2\n2\n2\n0\n0\n2\n1\n0\n1\n0\n3\n2\n0\n1\n1\n1\n1\n0\n0\n0\n1\n1\n1\n0\n0\n1\n0\n1\n0\n1\n1\n0\n1\n0\n1\n0\n2\n0\n0\n4\n0\n0\n0\n2\n0\n7\n0\n0\n0\n3\n0\n0\n0\n0\n0\n2\n7\n0\n0\n6\n0\n0\n1\n0\n0\n0\n3\n0\n0\n5\n3\n0\n0\n6\n0\n2\n0\n0\n1\n0\n0\n0\n1\n1\n0\n1\n1\n0\n1\n0\n0\n0\n0\n1\n0\n0\n1\n0\n1\n0\n0\n0\n2\n0\n1\n0\n0\n3\n0\n3\n0\n3\n0\n0\n2\n4\n0\n0\n0\n2\n0\n3\n0\n0\n0\n0\n2\n0\n4\n2\n3\n0\n1\n1\n1\n0\n0\n0\n1\n1\n1\n0\n0\n0\n0\n0\n2\n0\n1\n1\n0\n2\n1\n1\n1\n0\n0\n0\n1\n1\n0\n1\n0\n0\n2\n3\n0\n0\n1\n0\n6\n0\n2\n3\n2\n1\n1\n1\n0\n0\n1\n1\n0\n0\n0\n0\n0\n1\n1\n7\n6\n0\n0\n0\n1\n1\n4\n0\n1\n0\n4\n0\n4\n2\n0\n5\n0\n1\n1\n0\n0\n2\n0\n1\n0\n0\n0\n0\n0\n1\n1\n4\n6\n1\n1\n0\n1\n1\n0\n3\n1\n1\n1\n0\n0\n1\n0\n0\n1\n0\n0\n0\n4\n1\n0\n0\n1\n0\n1\n1\n1\n0\n0\n3\n0\n0\n5\n0\n0\n5\n5\n3\n0\n5\n0\n0\n6\n0\n0\n2\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n0\n0\n0\n2\n0\n2\n0\n0\n0\n4\n0\n0\n5\n0\n0\n0\n0\n0\n1\n0\n0\n1\n0\n4\n0\n1\n0\n1\n4\n0\n0\n1\n1\n0\n0\n2\n0\n0\n0\n1\n0\n3\n3\n1\n3\n1\n4\n0\n0\n0\n1\n0\n0\n2\n2\n2\n0\n3\n3\n0\n3\n0\n1\n3\n0\n0\n0\n0\n0\n4\n0\n1\n5\n0\n0\n0\n2\n3\n0\n0\n0\n0\n3\n0\n1\n0\n0\n0\n1\n1\n1\n0\n0\n2\n1\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n1\n0\n1\n0\n0\n1\n0\n1\n0\n2\n2\n0\n0\n4\n0\n0\n2\n0\n3\n0\n3\n1\n0\n2\n5\n4\n3\n4\n0\n2\n4\n4\n0\n0\n1\n0\n0\n1\n1\n0\n0\n0\n1\n2\n2\n0\n2\n0\n0\n0\n0\n0\n1\n0\n3\n0\n0\n0\n1\n1\n1\n1\n4\n0\n0\n0\n0\n0\n2\n0\n2\n0\n0\n1\n1\n0\n0\n0\n1\n1\n1\n2\n1\n1\n2\n0\n3\n1\n0\n0\n0\n1\n1\n0\n0\n1\n0\n0\n2\n0\n0\n3\n0\n1\n4\n0\n0\n1\n0\n0\n1\n0\n5\n0\n1\n0\n0\n0\n6\n0\n2\n0\n0\n2\n0\n0\n3\n4\n0\n0\n0\n0\n0\n1\n1\n1\n1\n1\n2\n0\n0\n0\n0\n0\n0\n2\n0\n0\n0\n3\n2\n3\n0\n0\n0\n4\n1\n0\n0\n0\n0\n0\n2\n7\n1\n0\n1\n1\n2\n2\n8\n0\n8\n0\n0\n0\n0\n1\n1\n0\n0\n0\n0\n0\n1\n2\n2\n2\n0\n0\n0\n1\n1\n1\n0\n0\n0\n0\n1\n0\n1\n0\n0\n1\n0\n1\n1\n1\n1\n0\n1\n0\n1\n5\n0\n2\n2\n0\n3\n4\n0\n0\n0\n1\n0\n3\n6\n0\n0\n0\n0\n2\n0\n1\n1\n0\n0\n2\n1\n1\n0\n1\n0\n1\n0\n3\n0\n2\n0\n0\n0\n1\n1\n0\n1\n3\n1\n0\n2\n0\n0\n1\n1\n1\n0\n1\n0\n0\n1\n1\n1\n0\n1\n2\n0\n3\n0\n1\n2\n0\n2\n2\n4\n2\n3\n3\n0\n3\n0\n4\n2\n0\n0\n1\n0\n1\n3\n3\n0\n4\n0\n0\n3\n1\n1\n0\n1\n2\n1\n0\n1\n0\n0\n2\n0\n1\n4\n0\n1\n0\n3\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n0\n1\n1\n1\n0\n1\n0\n1\n0\n1\n0\n2\n0\n0\n0\n2\n0\n1\n0\n0\n1\n0\n1\n0\n1\n0\n0\n1\n0\n0\n0\n3\n0\n0\n0\n0\n1\n0\n0\n1\n0\n1\n3\n3\n1\n0\n0\n0\n0\n0\n5\n4\n2\n0\n2\n0\n3\n3\n0\n0\n3\n0\n6\n1\n1\n0\n0\n2\n2\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n4\n0\n0\n3\n3\n0\n0\n0\n3\n2\n0\n0\n3\n0\n0\n0\n5\n0\n1\n0\n2\n0\n0\n2\n3\n0\n5\n5\n6\n0\n0\n5\n0\n0\n0\n0\n1\n0\n1\n1\n0\n0\n0\n0\n0\n1\n1\n1\n0\n0\n2\n0\n0\n1\n1\n4\n3\n0\n0\n1\n1\n1\n2\n0\n0\n1\n0\n2\n0\n1\n0\n3\n1\n0\n1\n0\n2\n2\n0\n3\n4\n0\n2\n0\n3\n0\n0\n0\n4\n4\n0\n0\n0\n1\n0\n0\n0\n1\n0\n1\n7\n1\n1\n1\n0\n0\n0\n1\n1\n0\n0\n0\n0\n0\n4\n1\n0\n2\n3\n0\n0\n0\n7\n0\n1\n0\n0\n0\n1\n0\n2\n2\n0\n2\n6\n6\n6\n0\n2\n2\n0\n1\n1\n1\n0\n0\n0\n0\n0\n1\n0\n2\n0\n0\n1\n0\n0\n0\n1\n0\n1\n4\n4\n5\n1\n0\n0\n1\n0\n0\n3\n2\n2\n1\n1\n1\n0\n2\n1\n0\n1\n1\n0\n2\n0\n2\n2\n0\n0\n0\n2\n4\n1\n1\n1\n1\n0\n1\n0\n0\n0\n1\n0\n1\n1\n1\n1\n0\n1\n1\n1\n0\n0\n1\n1\n0\n0\n1\n0\n0\n0\n0\n1\n2\n0\n1\n2\n2\n2\n1\n0\n1\n1\n0\n1\n0\n1\n1\n1\n1\n1\n0\n1\n0\n0\n0\n0\n2\n0\n2\n5\n6\n0\n0\n1\n0\n0\n0\n0\n0\n3\n1\n1\n1\n0\n0\n0\n1\n1\n1\n0\n0\n0\n0\n6\n0\n0\n3\n6\n0\n0\n0\n0\n3\n1\n1\n1\n2\n0\n3\n2\n1\n1\n0\n2\n1\n0\n0\n2\n5\n1\n0\n0\n2\n1\n0\n0\n3\n0\n0\n0\n0\n4\n6\n0\n0\n1\n0\n4\n0\n5\n0\n2\n1\n5\n1\n1\n1\n0\n0\n0\n0\n6\n3\n6\n0\n6\n1\n6\n2\n7\n4\n4\n4\n0\n1\n10\n0\n1\n0\n0\n4\n2\n2\n0\n2\n0\n1\n2\n0\n0\n0\n1\n0\n0\n0\n0\n2\n0\n0\n3\n0\n2\n0\n1\n4\n1\n0\n1\n6\n0\n0\n0\n6\n0\n5\n1\n1\n1\n1\n0\n1\n1\n1\n1\n1\n1\n1\n0\n0\n0\n1\n0\n3\n0\n1\n0\n0\n1\n0\n1\n1\n0\n0\n0\n4\n0\n0\n1\n0\n4\n5\n3\n3\n4\n0\n8\n0\n0\n7\n0\n0\n8\n0\n0\n9\n0\n0\n0\n0\n0\n0\n0\n1\n2\n0\n1\n1\n0\n0\n0\n1\n0\n1\n4\n0\n0\n0\n3\n1\n0\n0\n0\n0\n0\n0\n2\n3\n0\n0\n0\n1\n2\n1\n2\n3\n0\n2\n1\n1\n0\n2\n3\n1\n1\n0\n0\n0\n2\n1\n2\n3\n0\n0\n2\n4\n1\n0\n0\n0\n1\n0\n2\n8\n0\n1\n0\n1\n0\n0\n1\n0\n0\n0\n1\n0\n0\n0\n3\n0\n0\n0\n0\n1\n1\n0\n1\n0\n0\n2\n0\n11\n0\n0\n1\n0\n0\n0\n0\n1\n0\n1\n1\n1\n1\n1\n2\n1\n0\n2\n1\n1\n0\n0\n2\n3\n0\n1\n0\n2\n2\n2\n3\n0\n0\n0\n4\n2\n1\n0\n1\n0\n0\n2\n2\n1\n0\n4\n1\n0\n1\n2\n0\n1\n1\n0\n2\n2\n2\n0\n0\n1\n2\n1\n1\n0\n2\n0\n2\n2\n0\n3\n0\n1\n3\n0\n3\n0\n0\n0\n2\n0\n1\n1\n0\n1\n0\n0\n2\n2\n0\n0\n0\n0\n0\n0\n3\n1\n0\n0\n2\n2\n2\n0\n0\n0\n2\n0\n0\n0\n0\n0\n2\n0\n0\n0\n2\n0\n0\n2\n0\n2\n1\n2\n0\n0\n3\n0\n3\n3\n1\n2\n6\n0\n3\n0\n8\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n3\n3\n4\n2\n4\n4\n5\n5\n8\n0\n0\n0\n5\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n12\n3\n1\n0\n0\n0\n1\n1\n0\n0\n9\n1\n1\n2\n0\n2\n1\n1\n0\n1\n1\n0\n0\n0\n1\n1\n0\n2\n0\n2\n2\n2\n0\n1\n2\n0\n0\n0\n0\n2\n3\n1\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n2\n1\n2\n1\n1\n1\n1\n0\n0\n0\n0\n2\n1\n0\n2\n0\n0\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n2\n0\n0\n3\n0\n0\n0\n0\n4\n4\n0\n4\n2\n0\n2\n2\n0\n0\n2\n0\n1\n0\n1\n0\n0\n0\n0\n1\n0\n2\n0\n1\n0\n0\n0\n2\n0\n0\n0\n3\n2\n1\n4\n0\n2\n3\n2\n0\n0\n2\n2\n0\n0\n0\n0\n4\n0\n5\n1\n1\n5\n1\n0\n1\n0\n0\n2\n0\n2\n2\n1\n0\n0\n4\n2\n0\n0\n6\n4\n0\n2\n0\n4\n0\n0\n1\n0\n2\n1\n1\n0\n5\n1\n1\n0\n0\n0\n0\n0\n0\n3\n0\n2\n2\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n3\n0\n0\n3\n0\n2\n0\n0\n3\n0\n4\n0\n5\n0\n5\n1\n2\n0\n0\n1\n1\n1\n0\n1\n0\n0\n0\n0\n2\n1\n0\n1\n0\n0\n0\n0\n1\n1\n0\n1\n2\n0\n0\n0\n1\n1\n1\n1\n0\n0\n0\n2\n2\n3\n0\n1\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n2\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n2\n0\n1\n3\n1\n1\n1\n0\n0\n0\n0\n1\n0\n0\n2\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n0\n0\n0\n2\n0\n3\n0\n2\n0\n0\n0\n0\n0\n0\n3\n3\n4\n0\n0\n3\n1\n3\n2\n0\n0\n1\n0\n0\n0\n2\n1\n0\n0\n1\n1\n0\n0\n0\n1\n0\n1\n0\n0\n1\n0\n1\n0\n0\n0\n2\n0\n0\n2\n0\n0\n0\n0\n2\n1\n1\n2\n1\n0\n2\n0\n0\n0\n2\n1\n0\n0\n2\n2\n0\n1\n0\n1\n0\n0\n2\n1\n0\n0\n1\n4\n2\n0\n2\n1\n0\n0\n0\n0\n7\n5\n0\n3\n4\n2\n2\n0\n3\n6\n4\n4\n0\n4\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n7\n2\n0\n5\n0\n0\n3\n0\n0\n1\n0\n0\n0\n2\n10\n2\n0\n4\n11\n0\n0\n5\n1\n1\n0\n3\n4\n1\n0\n0\n2\n0\n6\n5\n0\n0\n0\n0\n6\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n3\n2\n1\n7\n2\n0\n4\n0\n0\n0\n0\n6\n0\n0\n0\n0\n0\n3\n0\n0\n3\n0\n0\n3\n4\n0\n0\n2\n2\n0\n0\n4\n0\n0\n0\n0\n3\n2\n0\n0\n1\n0\n2\n0\n0\n0\n3\n0\n0\n5\n0\n0\n1\n0\n0\n0\n0\n5\n0\n0\n1\n1\n8\n3\n0\n3\n2\n1\n4\n2\n0\n2\n2\n0\n3\n0\n4\n0\n0\n7\n17\n4\n0\n0\n0\n0\n1\n0\n0\n1\n2\n1\n0\n1\n1\n0\n0\n0\n0\n1\n0\n1\n1\n1\n1\n0\n1\n1\n0\n2\n1\n2\n0\n2\n3\n0\n0\n1\n0\n1\n0\n1\n0\n0\n0\n1\n0\n1\n1\n0\n1\n0\n0\n0\n3\n0\n6\n1\n0\n2\n2\n8\n7\n1\n0\n2\n0\n2\n0\n0\n1\n0\n1\n0\n0\n0\n0\n1\n0\n2\n3\n1\n0\n1\n0\n2\n0\n2\n0\n0\n3\n0\n1\n0\n0\n2\n0\n1\n0\n0\n0\n0\n0\n2\n0\n3\n3\n5\n5\n6\n0\n1\n1\n1\n1\n0\n1\n0\n2\n0\n0\n2\n0\n0\n0\n1\n2\n0\n2\n2\n1\n1\n0\n0\n0\n2\n0\n0\n0\n0\n3\n0\n1\n0\n0\n0\n0\n0\n0\n0\n1\n1\n2\n2\n1\n1\n0\n0\n0\n2\n1\n1\n0\n0\n0\n0\n1\n1\n0\n0\n3\n2\n2\n0\n0\n2\n3\n1\n1\n3\n0\n0\n3\n2\n2\n3\n0\n0\n3\n2\n1\n0\n0\n2\n0\n1\n0\n0\n1\n0\n0\n1\n1\n0\n0\n1\n1\n1\n0\n1\n0\n2\n0\n0\n3\n0\n0\n0\n0\n1\n0\n1\n0\n0\n1\n0\n0\n0\n0\n2\n0\n0\n0\n0\n1\n0\n2\n2\n0\n1\n1\n0\n0\n0\n0\n1\n0\n0\n2\n0\n0\n2\n1\n1\n0\n1\n1\n1\n0\n1\n0\n5\n1\n0\n0\n0\n2\n0\n3\n5\n0\n1\n1\n1\n0\n2\n0\n0\n0\n2\n0\n1\n4\n2\n4\n3\n0\n0\n1\n0\n1\n0\n1\n0\n0\n0\n0\n3\n2\n1\n0\n0\n1\n1\n3\n0\n0\n0\n1\n3\n0\n0\n0\n0\n3\n7\n6\n0\n0\n0\n0\n0\n0\n0\n6\n0\n1\n6\n0\n6\n6\n4\n1\n1\n0\n0\n0\n1\n0\n5\n2\n0\n4\n0\n0\n0\n0\n0\n0\n2\n2\n2\n0\n1\n0\n2\n2\n1\n1\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n2\n1\n2\n1\n0\n1\n1\n2\n2\n3\n0\n1\n0\n1\n1\n0\n1\n0\n2\n0\n0\n0\n1\n2\n0\n1\n1\n1\n0\n1\n1\n1\n0\n1\n2\n0\n3\n4\n4\n2\n1\n2\n2\n1\n0\n0\n0\n0\n0\n0\n1\n1\n1\n1\n1\n1\n0\n0\n1\n0\n0\n1\n2\n0\n0\n1\n1\n0\n1\n2\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n1\n2\n0\n2\n0\n0\n0\n0\n2\n3\n0\n3\n1\n0\n2\n0\n2\n1\n0\n1\n0\n0\n1\n2\n2\n1\n0\n2\n0\n0\n0\n1\n0\n0\n0\n2\n2\n0\n1\n0\n1\n0\n0\n3\n1\n0\n0\n0\n1\n0\n5\n1\n1\n4\n0\n1\n2\n0\n0\n3\n4\n0\n5\n1\n1\n0\n0\n1\n0\n0\n1\n0\n2\n1\n0\n2\n1\n0\n0\n1\n2\n0\n0\n1\n0\n0\n0\n3\n1\n0\n1\n0\n0\n1\n1\n3\n0\n0\n1\n0\n3\n0\n3\n3\n3\n0\n0\n0\n0\n0\n0\n3\n1\n2\n0\n2\n1\n1\n2\n2\n2\n0\n3\n0\n0\n0\n0\n3\n1\n0\n0\n4\n5\n4\n0\n3\n0\n2\n1\n0\n1\n0\n0\n1\n2\n0\n0\n4\n4\n3\n0\n0\n4\n2\n4\n0\n0\n2\n0\n0\n5\n0\n0\n0\n4\n0\n6\n0\n0\n0\n0\n0\n0\n0\n3\n0\n4\n1\n9\n1\n0\n1\n0\n0\n1\n2\n4\n0\n4\n2\n3\n0\n3\n3\n0\n0\n5\n0\n0\n5\n7\n3\n3\n0\n3\n0\n4\n0\n1\n3\n0\n0\n0\n1\n1\n2\n1\n2\n0\n1\n1\n1\n1\n0\n0\n0\n1\n1\n2\n2\n1\n0\n4\n2\n0\n0\n0\n2\n2\n1\n0\n1\n1\n1\n0\n1\n2\n1\n1\n2\n2\n0\n0\n0\n2\n1\n3\n1\n2\n0\n1\n1\n0\n0\n2\n1\n0\n0\n3\n2\n4\n4\n2\n5\n1\n6\n0\n0\n6\n0\n0\n1\n0\n1\n3\n2\n5\n0\n0\n2\n3\n0\n0\n0\n0\n0\n2\n1\n0\n0\n1\n1\n0\n1\n0\n1\n2\n0\n2\n1\n0\n0\n1\n0\n1\n2\n1\n0\n2\n1\n1\n0\n3\n1\n0\n1\n0\n1\n1\n1\n2\n0\n0\n2\n0\n0\n2\n2\n2\n0\n0\n1\n0\n0\n2\n1\n4\n1\n0\n2\n0\n0\n3\n2\n2\n0\n0\n2\n0\n0\n2\n2\n0\n1\n1\n2\n2\n0\n0\n2\n2\n0\n2\n0\n0\n3\n2\n0\n3\n0\n2\n0\n0\n0\n4\n1\n1\n2\n2\n1\n0\n0\n0\n2\n0\n4\n0\n0\n1\n0\n1\n0\n0\n0\n1\n1\n1\n0\n1\n0\n0\n1\n2\n1\n0\n0\n0\n6\n1\n0\n0\n0\n3\n3\n3\n0\n4\n5\n1\n0\n1\n0\n0\n1\n0\n0\n0\n2\n2\n0\n1\n0\n4\n0\n1\n1\n2\n0\n0\n1\n1\n2\n2\n0\n0\n1\n1\n1\n0\n1\n0\n0\n0\n1\n2\n2\n2\n0\n0\n0\n1\n0\n0\n1\n3\n2\n0\n4\n0\n0\n0\n2\n0\n0\n0\n4\n0\n0\n0\n1\n0\n0\n0\n1\n2\n0\n1\n0\n1\n0\n1\n0\n2\n2\n0\n2\n1\n0\n0\n2\n0\n0\n0\n1\n0\n1\n2\n0\n0\n1\n0\n1\n0\n1\n2\n0\n1\n3\n2\n1\n0\n2\n4\n0\n4\n0\n4\n1\n1\n0\n5\n0\n2\n0\n0\n7\n2\n0\n0\n3\n0\n1\n0\n0\n1\n0\n2\n0\n0\n0\n0\n0\n2\n1\n0\n1\n0\n0\n0\n1\n1\n3\n0\n2\n1\n0\n1\n2\n0\n1\n0\n0\n0\n2\n0\n0\n3\n1\n0\n0\n1\n1\n0\n0\n1\n0\n1\n0\n0\n1\n0\n1\n2\n0\n3\n0\n0\n0\n3\n4\n0\n0\n0\n1\n1\n0\n0\n0\n0\n2\n0\n0\n0\n1\n1\n0\n1\n1\n0\n0\n0\n1\n1\n1\n0\n0\n1\n1\n0\n0\n4\n1\n0\n0\n0\n2\n1\n2\n0\n1\n0\n2\n0\n2\n0\n1\n0\n0\n0\n0\n0\n2\n2\n0\n2\n3\n2\n3\n2\n2\n0\n0\n1\n3\n0\n0\n0\n0\n2\n1\n1\n1\n0\n0\n0\n0\n0\n1\n0\n0\n0\n2\n0\n0\n0\n2\n2\n2\n0\n0\n4\n0\n5\n1\n2\n0\n0\n0\n0\n0\n1\n4\n0\n1\n0\n0\n0\n0\n1\n2\n0\n0\n1\n1\n0\n0\n0\n0\n0\n1\n0\n1\n0\n0\n1\n0\n1\n0\n1\n0\n2\n0\n0\n0\n0\n0\n2\n0\n3\n0\n1\n1\n2\n0\n2\n0\n1\n1\n1\n2\n2\n2\n2\n0\n2\n0\n0\n0\n0\n2\n0\n1\n1\n1\n1\n4\n1\n0\n0\n1\n0\n1\n0\n0\n2\n1\n1\n0\n1\n0\n1\n1\n1\n0\n0\n0\n2\n2\n3\n0\n0\n1\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n1\n1\n1\n1\n1\n0\n0\n3\n1\n0\n0\n0\n2\n0\n2\n0\n3\n0\n0\n0\n0\n0\n0\n2\n1\n3\n4\n0\n1\n0\n1\n1\n6\n2\n3\n1\n3\n2\n0\n1\n1\n3\n0\n0\n1\n2\n2\n0\n4\n0\n0\n0\n1\n0\n3\n4\n0\n1\n1\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n1\n1\n1\n0\n0\n3\n0\n4\n1\n2\n0\n3\n0\n0\n0\n0\n1\n1\n0\n1\n0\n0\n1\n0\n0\n0\n1\n1\n1\n0\n2\n3\n3\n0\n2\n1\n1\n1\n2\n1\n0\n0\n0\n0\n0\n3\n0\n0\n0\n1\n0\n0\n1\n3\n0\n4\n0\n1\n0\n5\n0\n0\n0\n0\n0\n5\n1\n1\n0\n0\n0\n0\n1\n1\n6\n0\n6\n0\n1\n1\n1\n2\n0\n0\n0\n1\n1\n1\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n2\n3\n1\n1\n3\n1\n2\n0\n3\n0\n1\n0\n0\n0\n2\n1\n3\n0\n0\n0\n0\n3\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n5\n0\n0\n2\n0\n0\n1\n0\n2\n2\n0\n4\n0\n0\n3\n3\n0\n4\n0\n0\n2\n0\n0\n6\n2\n2\n2\n1\n0\n0\n0\n1\n0\n0\n0\n1\n1\n0\n2\n0\n0\n1\n1\n2\n0\n2\n0\n0\n1\n2\n0\n1\n0\n1\n0\n0\n0\n3\n0\n1\n0\n2\n1\n1\n2\n0\n0\n0\n0\n2\n2\n1\n0\n1\n1\n1\n1\n1\n0\n1\n0\n0\n0\n0\n2\n4\n0\n3\n0\n0\n0\n1\n0\n0\n0\n3\n1\n0\n1\n0\n3\n0\n1\n0\n0\n0\n1\n0\n0\n1\n0\n1\n0\n3\n1\n1\n0\n1\n2\n0\n0\n1\n1\n0\n1\n1\n0\n1\n0\n0\n2\n0\n1\n1\n2\n0\n0\n0\n0\n2\n2\n0\n1\n0\n0\n0\n1\n0\n1\n1\n0\n0\n0\n0\n1\n0\n0\n1\n1\n1\n0\n0\n0\n0\n0\n0\n0\n1\n1\n0\n1\n1\n1\n0\n1\n0\n0\n0\n1\n3\n1\n3\n0\n2\n0\n2\n0\n0\n0\n0\n0\n1\n0\n1\n2\n0\n0\n1\n0\n0\n1\n0\n1\n1\n1\n0\n0\n2\n2\n1\n0\n1\n1\n1\n0\n0\n1\n1\n0\n1\n0\n1\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n3\n2\n0\n2\n0\n1\n1\n0\n0\n3\n0\n0\n2\n1\n5\n3\n5\n7\n0\n6\n0\n7\n0\n0\n2\n0\n0\n1\n2\n2\n2\n1\n0\n0\n3\n0\n0\n0\n0\n7\n0\n1\n0\n4\n0\n3\n3\n5\n0\n0\n0\n1\n0\n1\n0\n1\n0\n0\n0\n0\n1\n0\n3\n0\n2\n0\n0\n2\n1\n1\n0\n2\n0\n1\n1\n0\n1\n0\n0\n1\n0\n0\n0\n0\n4\n0\n0\n3\n4\n0\n0\n7\n1\n1\n7\n1\n7\n1\n0\n0\n0\n7\n8\n1\n0\n1\n0\n0\n0\n0\n1\n1\n1\n1\n1\n0\n2\n0\n0\n3\n0\n2\n4\n4\n0\n0\n0\n0\n0\n2\n0\n3\n0\n0\n1\n0\n1\n2\n0\n0\n2\n0\n0\n2\n2\n5\n2\n2\n2\n1\n0\n3\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n4\n0\n1\n3\n3\n2\n0\n1\n0\n0\n2\n3\n2\n0\n1\n1\n0\n0\n0\n1\n0\n0\n2\n3\n3\n4\n2\n0\n0\n0\n1\n0\n0\n0\n1\n0\n6\n0\n7\n0\n0\n1\n0\n0\n4\n0\n2\n0\n0\n1\n3\n0\n2\n2\n2\n0\n4\n0\n0\n0\n1\n0\n0\n3\n0\n0\n3\n0\n1\n1\n0\n0\n0\n0\n1\n2\n2\n2\n2\n0\n0\n0\n2\n0\n0\n1\n0\n1\n2\n2\n0\n0\n3\n0\n2\n4\n0\n2\n0\n0\n0\n1\n1\n0\n1\n0\n1\n0\n3\n0\n0\n1\n1\n1\n2\n1\n0\n1\n0\n1\n1\n1\n0\n1\n0\n1\n0\n1\n4\n0\n0\n0\n0\n0\n0\n0\n0\n2\n1\n1\n2\n2\n0\n0\n2\n2\n0\n0\n4\n0\n2\n4\n5\n0\n6\n1\n1\n1\n1\n0\n0\n2\n0\n4\n0\n0\n0\n1\n0\n0\n1\n0\n2\n0\n3\n3\n0\n3\n1\n1\n1\n1\n1\n0\n0\n0\n1\n2\n0\n1\n1\n0\n0\n4\n3\n0\n0\n3\n0\n0\n0\n0\n0\n2\n1\n1\n0\n3\n0\n1\n3\n1\n1\n4\n3\n1\n4\n1\n0\n1\n0\n7\n1\n2\n0\n2\n0\n0\n0\n0\n1\n2\n1\n0\n2\n1\n0\n0\n0\n1\n0\n0\n1\n1\n1\n1\n1\n0\n2\n2\n0\n1\n0\n0\n1\n0\n1\n0\n1\n1\n0\n1\n0\n0\n0\n2\n0\n2\n1\n0\n0\n0\n1\n1\n1\n0\n0\n0\n1\n2\n0\n1\n0\n0\n0\n3\n1\n0\n1\n3\n4\n0\n3\n3\n2\n0\n0\n1\n0\n0\n1\n1\n0\n2\n0\n0\n2\n0\n2\n0\n0\n0\n0\n0\n5\n0\n3\n0\n1\n4\n0\n0\n3\n1\n0\n3\n0\n1\n5\n2\n0\n1\n1\n1\n1\n1\n0\n1\n1\n2\n1\n0\n1\n0\n1\n1\n0\n0\n0\n3\n0\n2\n1\n0\n1\n3\n0\n4\n1\n4\n5\n0\n6\n0\n2\n0\n0\n0\n0\n1\n0\n0\n2\n0\n0\n2\n0\n0\n1\n1\n0\n1\n1\n1\n1\n1\n3\n1\n2\n2\n3\n0\n0\n0\n1\n1\n0\n1\n0\n0\n1\n0\n0\n0\n2\n0\n0\n0\n0\n2\n0\n1\n1\n0\n1\n0\n0\n1\n0\n1\n1\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n4\n1\n6\n0\n0\n0\n0\n1\n0\n0\n1\n6\n0\n1\n1\n0\n0\n2\n0\n2\n5\n1\n3\n5\n0\n1\n0\n0\n1\n1\n0\n3\n0\n3\n0\n1\n1\n0\n3\n3\n0\n0\n3\n1\n0\n1\n0\n2\n2\n1\n2\n2\n2\n3\n3\n0\n1\n0\n0\n0\n0\n3\n1\n1\n2\n0\n0\n4\n0\n1\n7\n6\n5\n0\n0\n1\n0\n2\n3\n0\n1\n0\n1\n1\n0\n2\n1\n1\n0\n1\n0\n0\n2\n2\n0\n0\n2\n0\n0\n0\n0\n2\n3\n0\n0\n3\n0\n0\n0\n0\n0\n3\n2\n1\n2\n4\n0\n2\n0\n3\n5\n2\n0\n6\n0\n2\n0\n6\n2\n0\n9\n3\n0\n6\n0\n0\n0\n11\n0\n4\n1\n0\n0\n1\n0\n2\n0\n0\n1\n1\n1\n1\n1\n1\n0\n5\n1\n3\n0\n0\n1\n0\n0\n1\n0\n4\n1\n2\n0\n0\n0\n3\n3\n0\n2\n0\n0\n4\n0\n2\n2\n5\n3\n2\n4\n0\n0\n3\n1\n6\n0\n0\n3\n0\n1\n0\n3\n2\n3\n1\n0\n0\n0\n3\n0\n0\n2\n0\n0\n0\n0\n0\n1\n0\n1\n0\n0\n1\n0\n0\n2\n0\n1\n0\n1\n0\n2\n0\n4\n4\n1\n0\n0\n1\n2\n0\n0\n0\n2\n2\n0\n1\n2\n0\n2\n0\n3\n3\n1\n1\n1\n0\n1\n0\n0\n0\n0\n0\n1\n0\n0\n1\n1\n0\n0\n1\n1\n0\n0\n3\n2\n0\n0\n1\n0\n1\n3\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n1\n0\n1\n0\n0\n4\n1\n1\n0\n0\n2\n2\n3\n0\n3\n2\n1\n0\n0\n1\n1\n1\n0\n0\n1\n2\n0\n0\n0\n0\n0\n3\n1\n1\n0\n0\n0\n1\n1\n1\n3\n2\n2\n1\n2\n1\n1\n0\n1\n1\n1\n1\n0\n0\n1\n1\n0\n0\n1\n0\n1\n0\n3\n0\n0\n3\n1\n1\n0\n2\n0\n0\n0\n0\n0\n1\n0\n2\n1\n0\n0\n1\n0\n0\n2\n0\n0\n3\n1\n1\n0\n0\n0\n0\n0\n0\n0\n3\n2\n2\n2\n0\n0\n2\n6\n0\n0\n3\n0\n1\n1\n0\n1\n0\n0\n0\n0\n1\n0\n1\n0\n0\n0\n0\n2\n0\n4\n0\n3\n1\n0\n1\n4\n4\n0\n0\n0\n0\n5\n0\n2\n3\n1\n0\n0\n1\n2\n1\n0\n1\n0\n1\n0\n2\n1\n2\n2\n0\n0\n0\n4\n7\n7\n0\n0\n6\n8\n0\n0\n0\n7\n0\n0\n0\n1\n0\n1\n0\n0\n0\n0\n0\n1\n0\n0\n0\n1\n3\n0\n0\n0\n1\n0\n1\n0\n1\n0\n0\n2\n3\n2\n3\n0\n5\n0\n3\n6\n1\n0\n0\n0\n0\n2\n0\n2\n2\n0\n0\n3\n0\n1\n1\n2\n2\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n0\n1\n0\n0\n0\n1\n0\n2\n1\n4\n0\n0\n0\n0\n0\n0\n0\n4\n0\n3\n0\n0\n2\n1\n0\n2\n0\n0\n0\n0\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n1\n0\n1\n0\n0\n1\n1\n0\n0\n0\n0\n0\n2\n0\n0\n0\n0\n1\n0\n0\n2\n0\n2\n0\n1\n0\n3\n0\n3\n3\n2\n0\n3\n3\n3\n0\n1\n4\n1\n2\n2\n3\n0\n0\n1\n0\n1\n1\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n2\n4\n4\n5\n0\n2\n0\n3\n2\n0\n1\n1\n0\n3\n0\n0\n0\n0\n0\n5\n0\n1\n0\n0\n0\n0\n1\n0\n1\n0\n3\n0\n0\n1\n2\n1\n3\n2\n2\n0\n1\n0\n0\n0\n2\n0\n1\n0\n0\n1\n1\n0\n2\n0\n0\n3\n0\n3\n0\n1\n2\n0\n0\n0\n2\n1\n3\n3\n0\n0\n1\n1\n1\n0\n2\n1\n3\n0\n4\n4\n0\n1\n0\n0\n4\n0\n1\n0\n0\n0\n3\n0\n3\n2\n0\n1\n2\n0\n5\n2\n0\n2\n2\n2\n0\n4\n0\n0\n0\n0\n0\n1\n0\n0\n4\n3\n1\n0\n0\n1\n0\n2\n2\n0\n0\n0\n0\n1\n3\n0\n1\n0\n0\n0\n3\n1\n0\n1\n1\n10\n0\n0\n1\n0\n1\n1\n0\n3\n0\n2\n1\n0\n0\n6\n1\n1\n0\n0\n0\n2\n1\n1\n1\n1\n0\n1\n2\n1\n1\n1\n0\n0\n0\n0\n0\n0\n1\n0\n0\n2\n1\n0\n2\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n1\n0\n1\n2\n1\n2\n2\n2\n0\n1\n1\n0\n0\n0\n1\n0\n1\n0\n0\n0\n2\n0\n4\n0\n1\n1\n1\n0\n1\n0\n2\n0\n0\n0\n0\n2\n0\n1\n2\n0\n1\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n0\n3\n2\n1\n2\n2\n0\n4\n0\n2\n0\n5\n1\n1\n0\n1\n0\n0\n0\n1\n0\n0\n3\n0\n3\n1\n0\n4\n1\n1\n1\n0\n1\n5\n0\n1\n1\n4\n1\n1\n0\n0\n0\n0\n0\n1\n1\n1\n1\n3\n3\n0\n3\n2\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n1\n3\n2\n0\n0\n0\n0\n3\n0\n0\n0\n0\n3\n4\n6\n0\n7\n4\n0\n6\n0\n7\n8\n3\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n1\n1\n0\n1\n1\n5\n0\n0\n2\n0\n0\n1\n0\n1\n0\n1\n0\n2\n0\n0\n1\n1\n0\n0\n0\n1\n0\n1\n0\n1\n1\n0\n0\n1\n0\n2\n0\n1\n0\n1\n2\n1\n1\n0\n1\n0\n0\n0\n2\n0\n0\n1\n4\n0\n2\n1\n2\n1\n6\n0\n7\n0\n1\n0\n0\n0\n1\n1\n0\n1\n1\n1\n1\n0\n0\n1\n1\n0\n1\n2\n1\n0\n0\n0\n1\n0\n0\n2\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n2\n0\n0\n0\n1\n0\n0\n0\n2\n2\n0\n3\n3\n2\n0\n2\n0\n0\n2\n0\n0\n1\n0\n1\n6\n0\n0\n2\n0\n1\n1\n0\n0\n2\n0\n0\n2\n0\n0\n1\n0\n0\n1\n2\n1\n1\n0\n1\n0\n3\n0\n0\n0\n0\n0\n3\n1\n1\n1\n0\n1\n0\n2\n0\n0\n0\n5\n0\n4\n3\n3\n0\n2\n0\n0\n0\n1\n0\n0\n0\n0\n1\n1\n1\n0\n0\n1\n0\n2\n0\n0\n0\n1\n1\n0\n2\n0\n1\n0\n2\n2\n0\n3\n0\n0\n1\n1\n0\n2\n1\n1\n3\n0\n0\n2\n2\n2\n5\n0\n0\n4\n0\n0\n0\n0\n4\n0\n0\n1\n0\n0\n4\n4\n2\n0\n1\n0\n0\n6\n0\n0\n7\n0\n0\n0\n0\n1\n1\n0\n1\n1\n1\n1\n1\n0\n0\n0\n2\n0\n1\n1\n2\n0\n2\n2\n3\n0\n0\n1\n1\n1\n1\n0\n1\n0\n2\n3\n2\n2\n0\n0\n0\n0\n1\n0\n2\n2\n2\n0\n0\n2\n0\n0\n1\n0\n1\n0\n1\n4\n6\n0\n0\n4\n0\n4\n0\n1\n0\n2\n0\n2\n0\n0\n3\n1\n0\n0\n1\n1\n1\n1\n0\n0\n0\n0\n1\n1\n1\n0\n1\n1\n0\n1\n0\n0\n1\n0\n0\n1\n0\n1\n0\n0\n1\n2\n1\n0\n0\n1\n2\n4\n0\n1\n1\n0\n0\n3\n0\n0\n0\n0\n0\n2\n4\n0\n3\n2\n0\n0\n0\n0\n3\n5\n1\n1\n1\n0\n0\n1\n0\n0\n1\n0\n1\n1\n0\n0\n0\n0\n1\n2\n0\n1\n1\n0\n1\n0\n0\n2\n1\n2\n0\n2\n0\n0\n0\n0\n1\n0\n3\n0\n1\n0\n1\n1\n1\n1\n0\n1\n0\n1\n1\n1\n0\n0\n0\n1\n2\n2\n2\n2\n0\n1\n1\n0\n3\n0\n4\n0\n2\n0\n0\n0\n0\n2\n0\n2\n2\n2\n0\n4\n0\n5\n0\n0\n1\n0\n0\n0\n0\n2\n0\n3\n0\n1\n0\n0\n1\n2\n2\n1\n0\n1\n0\n0\n1\n1\n1\n0\n0\n2\n0\n4\n1\n2\n0\n4\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n3\n0\n3\n1\n0\n0\n3\n0\n3\n1\n0\n1\n0\n0\n0\n0\n1\n2\n3\n3\n5\n0\n0\n2\n0\n0\n0\n0\n0\n1\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n0\n5\n4\n0\n0\n0\n0\n1\n1\n2\n0\n2\n2\n1\n1\n0\n0\n0\n3\n0\n0\n0\n1\n0\n0\n0\n0\n0\n2\n0\n0\n1\n2\n0\n1\n1\n1\n2\n0\n3\n0\n0\n1\n1\n5\n1\n3\n2\n0\n1\n1\n0\n0\n1\n0\n0\n1\n0\n0\n0\n1\n2\n1\n0\n1\n0\n4\n0\n3\n1\n1\n1\n4\n0\n0\n1\n0\n0\n1\n0\n4\n0\n0\n0\n2\n0\n4\n1\n0\n1\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n6\n0\n0\n0\n0\n2\n1\n0\n0\n0\n0\n0\n0\n1\n0\n1\n0\n1\n0\n1\n1\n0\n1\n0\n0\n0\n2\n0\n2\n2\n0\n0\n4\n1\n4\n0\n1\n0\n4\n0\n0\n0\n0\n1\n0\n0\n3\n0\n3\n3\n0\n0\n4\n0\n3\n6\n0\n7\n7\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n0\n0\n1\n0\n0\n1\n0\n1\n1\n1\n0\n2\n0\n1\n2\n2\n0\n0\n0\n2\n0\n2\n0\n2\n1\n0\n2\n1\n0\n0\n2\n2\n0\n0\n5\n5\n0\n1\n0\n0\n1\n0\n0\n0\n3\n2\n0\n0\n1\n0\n1\n2\n1\n1\n0\n1\n0\n0\n0\n2\n3\n2\n0\n4\n4\n5\n0\n0\n1\n4\n1\n0\n1\n0\n0\n0\n0\n0\n1\n1\n1\n0\n0\n2\n1\n3\n2\n2\n1\n0\n1\n0\n1\n2\n1\n3\n0\n2\n0\n2\n0\n1\n1\n0\n0\n1\n1\n0\n1\n3\n0\n3\n1\n1\n1\n0\n2\n2\n1\n2\n2\n0\n0\n2\n0\n2\n0\n3\n0\n0\n2\n1\n0\n1\n3\n0\n0\n0\n1\n0\n1\n0\n0\n0\n1\n0\n0\n0\n4\n0\n1\n0\n1\n0\n0\n1\n0\n1\n1\n0\n0\n1\n0\n0\n0\n1\n0\n0\n1\n3\n3\n0\n1\n1\n0\n0\n0\n3\n0\n1\n0\n0\n4\n0\n0\n1\n2\n0\n0\n0\n0\n0\n0\n0\n0\n2\n4\n2\n1\n0\n4\n2\n1\n3\n2\n4\n5\n0\n0\n0\n0\n1\n0\n5\n0\n0\n1\n1\n0\n1\n3\n0\n2\n0\n3\n0\n0\n0\n0\n0\n1\n3\n0\n2\n0\n0\n0\n0\n1\n0\n2\n0\n0\n0\n0\n0\n1\n0\n0\n1\n1\n0\n0\n0\n2\n0\n1\n2\n2\n0\n0\n1\n0\n1\n1\n2\n2\n0\n1\n0\n1\n0\n0\n1\n1\n2\n2\n6\n0\n0\n0\n4\n3\n0\n0\n4\n0\n0\n6\n6\n0\n0\n0\n1\n2\n0\n0\n0\n0\n0\n4\n1\n0\n4\n3\n1\n1\n0\n0\n0\n0\n1\n2\n0\n1\n0\n0\n0\n1\n0\n1\n1\n0\n0\n1\n1\n1\n1\n0\n0\n1\n1\n0\n1\n1\n0\n0\n1\n1\n0\n0\n1\n0\n1\n2\n0\n0\n2\n6\n7\n0\n2\n0\n0\n0\n1\n0\n1\n0\n0\n0\n1\n2\n0\n3\n0\n0\n0\n0\n1\n2\n4\n4\n2\n0\n4\n1\n2\n0\n0\n0\n0\n0\n1\n1\n4\n1\n2\n0\n0\n2\n0\n1\n0\n2\n0\n2\n0\n0\n3\n0\n1\n1\n0\n1\n0\n0\n0\n1\n2\n2\n0\n0\n1\n2\n0\n1\n0\n0\n0\n0\n2\n0\n0\n0\n2\n3\n2\n2\n0\n3\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n2\n0\n0\n2\n0\n0\n2\n0\n0\n0\n0\n0\n0\n2\n2\n0\n0\n1\n2\n1\n0\n2\n0\n3\n0\n0\n1\n0\n2\n0\n1\n0\n1\n0\n1\n0\n0\n1\n2\n0\n8\n0\n4\n4\n1\n0\n7\n7\n1\n0\n0\n1\n0\n1\n1\n1\n2\n2\n1\n0\n0\n0\n3\n0\n3\n1\n3\n3\n1\n3\n0\n2\n2\n2\n2\n6\n1\n1\n1\n1\n0\n1\n3\n0\n4\n4\n6\n0\n6\n0\n0\n0\n1\n0\n0\n3\n0\n2\n0\n3\n4\n4\n4\n0\n0\n11\n3\n0\n1\n0\n3\n0\n0\n0\n0\n2\n1\n2\n1\n0\n0\n1\n0\n0\n1\n1\n0\n1\n0\n1\n1\n0\n3\n0\n1\n1\n0\n0\n0\n0\n3\n0\n0\n0\n6\n5\n0\n5\n1\n1\n5\n0\n1\n0\n1\n5\n5\n0\n0\n1\n1\n1\n1\n0\n1\n1\n0\n2\n0\n0\n1\n3\n1\n0\n0\n0\n0\n1\n0\n1\n0\n1\n2\n0\n0\n0\n1\n0\n4\n1\n0\n3\n2\n0\n2\n0\n0\n0\n0\n0\n0\n6\n3\n5\n5\n1\n3\n6\n0\n1\n1\n0\n2\n1\n0\n0\n0\n0\n2\n2\n3\n3\n5\n3\n1\n0\n2\n0\n0\n0\n2\n3\n3\n2\n1\n1\n1\n0\n0\n1\n1\n0\n0\n0\n2\n2\n0\n0\n0\n2\n0\n0\n0\n0\n1\n0\n6\n0\n2\n2\n2\n0\n2\n0\n0\n1\n1\n0\n1\n2\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n3\n0\n3\n0\n4\n0\n0\n0\n6\n3\n0\n0\n0\n4\n5\n0\n0\n0\n0\n0\n1\n1\n0\n1\n1\n3\n0\n0\n0\n1\n0\n1\n0\n1\n0\n1\n3\n1\n1\n2\n1\n0\n1\n0\n1\n0\n2\n0\n3\n0\n3\n0\n1\n1\n1\n0\n0\n0\n1\n0\n0\n5\n1\n0\n1\n0\n1\n0\n0\n1\n0\n1\n1\n1\n1\n1\n0\n2\n2\n2\n0\n4\n0\n0\n0\n3\n5\n1\n0\n3\n4\n0\n1\n1\n1\n1\n0\n2\n0\n1\n1\n5\n0\n0\n0\n2\n2\n0\n0\n2\n0\n2\n0\n0\n0\n0\n1\n0\n1\n2\n4\n3\n1\n0\n2\n0\n1\n1\n1\n2\n1\n0\n0\n2\n1\n0\n1\n3\n0\n1\n0\n0\n0\n1\n0\n0\n2\n0\n2\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n2\n0\n0\n1\n3\n2\n0\n0\n0\n0\n2\n2\n1\n0\n1\n0\n1\n1\n0\n1\n0\n1\n1\n0\n0\n0\n7\n0\n1\n0\n1\n0\n6\n2\n0\n2\n0\n0\n2\n2\n0\n1\n1\n5\n0\n1\n2\n2\n0\n0\n0\n1\n0\n0\n1\n2\n1\n0\n1\n1\n0\n0\n2\n0\n0\n0\n1\n1\n0\n0\n2\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n1\n1\n1\n1\n0\n0\n2\n2\n0\n1\n1\n4\n0\n0\n2\n0\n3\n1\n0\n0\n0\n0\n7\n0\n0\n7\n0\n1\n1\n0\n0\n2\n2\n3\n2\n0\n9\n0\n1\n1\n1\n0\n0\n0\n2\n0\n1\n0\n1\n2\n1\n1\n0\n1\n1\n1\n0\n0\n1\n0\n2\n1\n0\n0\n3\n2\n4\n4\n3\n4\n0\n0\n3\n6\n0\n1\n0\n2\n1\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n2\n1\n0\n0\n0\n0\n1\n1\n1\n1\n1\n0\n0\n0\n3\n0\n1\n0\n1\n0\n1\n2\n1\n1\n1\n1\n0\n0\n1\n0\n0\n0\n1\n0\n0\n1\n2\n3\n0\n0\n0\n0\n1\n0\n0\n0\n1\n2\n0\n2\n0\n2\n0\n2\n2\n0\n3\n0\n0\n3\n2\n0\n0\n7\n3\n0\n3\n1\n0\n0\n0\n0\n4\n0\n0\n2\n2\n2\n1\n1\n1\n0\n0\n2\n1\n1\n3\n0\n2\n0\n1\n5\n5\n0\n2\n4\n0\n0\n2\n0\n0\n1\n1\n1\n0\n1\n1\n1\n3\n1\n0\n1\n2\n0\n1\n0\n0\n0\n0\n5\n0\n1\n2\n0\n0\n0\n1\n0\n1\n4\n4\n1\n0\n2\n0\n0\n1\n1\n1\n0\n1\n0\n4\n0\n1\n0\n1\n0\n0\n1\n0\n0\n1\n1\n0\n0\n0\n1\n2\n3\n0\n0\n0\n1\n1\n1\n0\n0\n0\n1\n3\n0\n0\n0\n3\n0\n0\n4\n0\n3\n3\n0\n1\n2\n2\n2\n0\n1\n2\n1\n1\n0\n0\n0\n1\n0\n1\n0\n1\n1\n0\n0\n1\n0\n1\n3\n3\n2\n2\n0\n1\n0\n0\n0\n0\n0\n2\n0\n0\n0\n0\n2\n1\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n0\n0\n2\n0\n0\n0\n5\n0\n0\n1\n6\n7\n1\n5\n0\n5\n1\n2\n1\n2\n5\n5\n1\n0\n0\n1\n1\n0\n1\n1\n0\n1\n0\n1\n0\n2\n2\n0\n0\n0\n1\n1\n0\n1\n1\n0\n0\n1\n0\n0\n0\n2\n1\n0\n0\n0\n1\n2\n0\n0\n0\n3\n1\n1\n1\n0\n1\n0\n1\n1\n0\n0\n1\n0\n0\n0\n0\n1\n5\n0\n0\n1\n0\n0\n2\n4\n0\n1\n4\n7\n0\n1\n0\n5\n4\n5\n2\n0\n0\n0\n0\n1\n0\n0\n1\n1\n1\n1\n2\n0\n1\n1\n1\n1\n0\n0\n2\n1\n1\n0\n1\n0\n0\n1\n1\n2\n2\n0\n0\n0\n4\n0\n0\n0\n3\n1\n1\n1\n0\n1\n1\n1\n0\n0\n0\n1\n1\n0\n1\n0\n1\n0\n0\n0\n0\n0\n3\n1\n0\n4\n2\n2\n1\n0\n1\n0\n1\n0\n0\n0\n2\n2\n3\n0\n0\n0\n0\n1\n0\n3\n6\n0\n0\n1\n1\n3\n1\n4\n3\n0\n0\n5\n5\n0\n2\n0\n0\n2\n1\n0\n1\n0\n1\n0\n2\n0\n2\n1\n0\n0\n0\n0\n1\n1\n0\n2\n0\n0\n1\n0\n0\n3\n0\n0\n0\n0\n0\n0\n0\n2\n0\n0\n0\n5\n1\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n2\n0\n2\n0\n0\n0\n0\n2\n1\n0\n3\n1\n0\n0\n0\n3\n0\n0\n0\n4\n0\n0\n6\n3\n0\n0\n0\n1\n1\n0\n0\n1\n1\n0\n0\n1\n1\n0\n2\n0\n0\n0\n0\n0\n4\n0\n2\n2\n0\n0\n1\n0\n0\n0\n0\n3\n2\n2\n2\n3\n1\n3\n1\n2\n0\n2\n0\n0\n0\n0\n2\n0\n0\n0\n0\n0\n0\n2\n1\n1\n0\n0\n1\n1\n0\n0\n1\n1\n0\n0\n0\n0\n0\n2\n4\n0\n5\n0\n1\n0\n1\n0\n0\n3\n1\n1\n0\n0\n0\n1\n0\n0\n0\n1\n2\n0\n2\n1\n1\n1\n0\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n2\n1\n1\n0\n1\n1\n0\n0\n0\n2\n2\n3\n2\n2\n2\n0\n0\n0\n1\n0\n4\n0\n0\n2\n5\n4\n3\n4\n3\n0\n0\n0\n1\n1\n1\n0\n1\n0\n0\n1\n0\n3\n0\n1\n0\n0\n0\n0\n0\n0\n5\n0\n1\n1\n0\n1\n0\n1\n0\n0\n1\n0\n0\n5\n0\n2\n0\n0\n0\n0\n1\n1\n0\n1\n0\n3\n0\n0\n0\n2\n0\n3\n1\n1\n2\n1\n3\n1\n0\n1\n0\n0\n2\n2\n2\n0\n2\n2\n0\n3\n0\n0\n1\n1\n1\n1\n1\n1\n0\n0\n2\n2\n0\n1\n1\n1\n0\n1\n0\n1\n0\n0\n0\n1\n2\n2\n0\n0\n4\n0\n3\n7\n3\n3\n3\n5\n0\n0\n4\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n1\n0\n2\n2\n0\n0\n0\n1\n1\n0\n0\n0\n0\n1\n1\n0\n1\n0\n1\n1\n0\n0\n1\n1\n2\n1\n1\n3\n1\n1\n1\n1\n1\n0\n0\n1\n0\n0\n1\n1\n0\n1\n3\n0\n0\n1\n0\n1\n0\n1\n0\n1\n0\n0\n0\n0\n2\n0\n1\n1\n3\n0\n0\n2\n0\n2\n1\n2\n1\n2\n1\n0\n0\n0\n1\n0\n1\n1\n1\n0\n2\n0\n1\n2\n0\n2\n3\n2\n2\n1\n3\n0\n3\n0\n4\n2\n2\n0\n7\n0\n0\n1\n5\n6\n0\n0\n3\n5\n0\n8\n5\n0\n0\n4\n6\n0\n0\n0\n7\n0\n0\n0\n0\n0\n0\n3\n0\n0\n0\n0\n1\n0\n2\n0\n0\n0\n0\n0\n2\n2\n3\n0\n1\n0\n3\n5\n0\n3\n5\n4\n4\n5\n0\n0\n0\n0\n6\n1\n0\n0\n0\n5\n0\n1\n0\n1\n0\n1\n1\n0\n0\n0\n2\n0\n0\n0\n2\n3\n0\n0\n0\n4\n0\n1\n0\n0\n1\n0\n0\n2\n2\n0\n2\n1\n0\n0\n3\n0\n0\n0\n0\n7\n3\n0\n9\n0\n0\n0\n11\n0\n9\n0\n0\n1\n0\n1\n0\n0\n2\n1\n3\n2\n1\n1\n1\n0\n0\n0\n0\n0\n2\n0\n2\n1\n3\n3\n3\n1\n0\n0\n0\n0\n0\n3\n2\n2\n1\n1\n1\n0\n0\n0\n0\n2\n0\n0\n0\n1\n0\n0\n3\n1\n2\n0\n0\n0\n4\n0\n2\n0\n2\n5\n0\n1\n0\n0\n1\n5\n0\n0\n1\n0\n1\n1\n0\n1\n1\n0\n0\n0\n0\n0\n0\n2\n0\n0\n0\n0\n0\n4\n0\n1\n0\n1\n0\n1\n0\n2\n0\n2\n0\n0\n0\n2\n0\n1\n2\n2\n0\n0\n1\n1\n3\n1\n0\n0\n0\n0\n5\n2\n0\n4\n2\n6\n0\n0\n3\n7\n0\n0\n2\n0\n1\n2\n0\n0\n0\n2\n0\n1\n0\n1\n1\n2\n0\n5\n5\n3\n3\n0\n0\n0\n0\n1\n1\n9\n0\n1\n0\n1\n0\n1\n0\n2\n2\n0\n2\n2\n0\n0\n2\n1\n0\n1\n1\n0\n3\n3\n3\n0\n3\n0\n8\n0\n1\n1\n1\n1\n0\n1\n1\n0\n1\n1\n1\n0\n0\n1\n1\n0\n9\n2\n3\n0\n0\n0\n0\n0\n0\n3\n0\n3\n2\n3\n0\n0\n0\n0\n0\n0\n0\n2\n0\n0\n0\n0\n0\n0\n3\n2\n6\n5\n0\n6\n0\n0\n1\n0\n0\n0\n0\n0\n2\n1\n0\n1\n1\n0\n2\n0\n1\n2\n1\n0\n1\n0\n0\n0\n1\n0\n0\n2\n0\n1\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n1\n3\n1\n1\n0\n1\n0\n0\n0\n0\n0\n0\n2\n0\n3\n0\n0\n0\n3\n0\n0\n1\n0\n0\n0\n0\n5\n0\n2\n1\n2\n1\n1\n1\n0\n2\n1\n1\n1\n4\n0\n1\n2\n2\n4\n3\n3\n3\n3\n0\n0\n0\n0\n0\n1\n0\n0\n2\n0\n0\n0\n0\n3\n2\n1\n1\n1\n0\n1\n0\n0\n0\n0\n0\n1\n2\n1\n0\n0\n4\n0\n1\n0\n1\n2\n2\n4\n0\n0\n1\n0\n0\n2\n1\n0\n1\n2\n1\n1\n1\n0\n1\n0\n0\n0\n2\n0\n1\n1\n0\n1\n0\n0\n0\n1\n0\n1\n0\n0\n0\n0\n0\n0\n4\n0\n0\n0\n0\n1\n0\n0\n1\n0\n1\n0\n0\n1\n1\n2\n1\n1\n2\n0\n0\n2\n0\n2\n3\n2\n1\n0\n1\n0\n1\n3\n0\n0\n1\n1\n1\n0\n0\n0\n5\n0\n4\n3\n0\n0\n9\n0\n4\n0\n0\n2\n0\n2\n5\n0\n3\n0\n2\n2\n0\n1\n1\n0\n2\n2\n3\n0\n5\n1\n5\n0\n0\n0\n0\n3\n1\n1\n0\n0\n1\n0\n3\n0\n1\n1\n0\n0\n0\n0\n2\n1\n0\n0\n0\n0\n1\n1\n1\n3\n0\n1\n0\n0\n3\n1\n0\n0\n0\n0\n4\n0\n3\n0\n2\n0\n1\n0\n0\n2\n1\n0\n1\n5\n1\n0\n0\n3\n0\n1\n1\n1\n1\n1\n0\n0\n0\n0\n0\n1\n0\n3\n0\n2\n4\n0\n0\n5\n2\n1\n0\n0\n4\n0\n1\n4\n3\n0\n0\n0\n1\n1\n2\n0\n0\n1\n1\n1\n0\n1\n0\n0\n2\n1\n2\n0\n0\n2\n0\n3\n0\n0\n0\n1\n0\n3\n0\n0\n0\n2\n2\n0\n0\n0\n1\n1\n1\n1\n0\n0\n0\n3\n0\n3\n0\n0\n3\n0\n2\n0\n0\n1\n5\n2\n0\n0\n2\n2\n0\n3\n0\n2\n2\n2\n2\n2\n3\n0\n2\n3\n1\n2\n0\n0\n1\n1\n1\n0\n4\n1\n1\n1\n1\n1\n0\n1\n1\n1\n0\n1\n1\n4\n1\n1\n1\n0\n1\n0\n2\n2\n1\n0\n3\n0\n8\n10\n4\n1\n0\n1\n0\n1\n0\n0\n0\n2\n0\n1\n1\n1\n1\n1\n1\n1\n0\n0\n0\n0\n0\n0\n1\n0\n2\n1\n1\n0\n2\n0\n2\n0\n1\n1\n1\n1\n0\n0\n0\n3\n0\n0\n0\n1\n0\n3\n2\n0\n4\n3\n0\n0\n0\n0\n1\n0\n0\n0\n0\n8\n1\n2\n2\n0\n0\n0\n4\n9\n3\n0\n0\n1\n1\n0\n1\n0\n0\n0\n1\n0\n1\n0\n1\n0\n0\n0\n1\n1\n1\n1\n1\n0\n1\n0\n0\n0\n3\n1\n0\n1\n0\n0\n2\n2\n2\n0\n1\n2\n1\n0\n1\n1\n1\n1\n0\n1\n0\n1\n1\n1\n1\n0\n2\n5\n3\n0\n0\n1\n0\n0\n1\n2\n1\n0\n2\n0\n0\n0\n4\n0\n0\n0\n0\n7\n8\n0\n1\n0\n5\n0\n0\n0\n2\n0\n1\n0\n0\n3\n0\n9\n1\n3\n3\n4\n0\n1\n1\n4\n9\n1\n3\n0\n2\n1\n7\n0\n0\n4\n1\n0\n2\n4\n0\n0\n0\n8\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n1\n2\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n1\n1\n1\n1\n1\n1\n1\n1\n2\n2\n0\n6\n0\n0\n1\n0\n0\n0\n0\n0\n2\n4\n3\n3\n1\n1\n5\n1\n1\n1\n0\n0\n1\n1\n1\n1\n1\n0\n0\n0\n1\n1\n1\n1\n0\n0\n0\n0\n0\n2\n0\n2\n0\n0\n0\n0\n3\n0\n0\n2\n0\n2\n4\n2\n0\n0\n0\n0\n0\n1\n0\n2\n2\n0\n0\n3\n2\n1\n0\n0\n1\n0\n0\n0\n0\n2\n1\n2\n1\n1\n0\n1\n0\n0\n0\n0\n2\n0\n0\n0\n0\n1\n0\n0\n0\n2\n0\n0\n0\n0\n3\n0\n2\n2\n0\n4\n0\n3\n4\n3\n0\n1\n1\n0\n3\n0\n3\n5\n1\n1\n0\n0\n0\n1\n0\n0\n2\n1\n0\n1\n1\n0\n1\n0\n2\n3\n3\n1\n1\n0\n1\n1\n3\n0\n1\n0\n1\n1\n0\n0\n0\n2\n1\n0\n0\n3\n3\n6\n0\n0\n4\n4\n0\n0\n1\n1\n0\n0\n1\n1\n0\n0\n0\n0\n2\n2\n2\n2\n0\n1\n1\n0\n1\n0\n3\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n2\n2\n0\n2\n2\n1\n0\n0\n0\n2\n0\n0\n2\n0\n0\n0\n3\n0\n1\n0\n2\n1\n0\n1\n1\n1\n1\n0\n1\n0\n2\n0\n0\n1\n0\n0\n4\n3\n2\n5\n2\n0\n3\n1\n0\n5\n0\n0\n2\n1\n1\n0\n0\n0\n2\n0\n0\n0\n0\n0\n0\n0\n0\n6\n0\n1\n1\n0\n0\n4\n1\n2\n0\n0\n4\n1\n2\n1\n0\n4\n0\n0\n0\n1\n0\n0\n1\n1\n0\n1\n1\n0\n1\n1\n1\n4\n0\n1\n0\n1\n2\n0\n0\n0\n2\n2\n1\n0\n0\n3\n0\n1\n1\n0\n2\n0\n0\n0\n0\n0\n1\n0\n2\n1\n5\n0\n0\n2\n0\n0\n0\n3\n0\n0\n1\n2\n2\n0\n0\n4\n1\n0\n0\n0\n4\n1\n0\n1\n1\n0\n1\n1\n0\n0\n1\n1\n0\n0\n4\n1\n0\n0\n1\n1\n0\n1\n1\n1\n0\n2\n0\n1\n0\n1\n0\n0\n2\n2\n0\n0\n0\n4\n0\n3\n0\n0\n0\n0\n2\n0\n0\n1\n0\n0\n1\n1\n1\n0\n1\n0\n1\n1\n0\n3\n3\n2\n0\n0\n2\n0\n0\n0\n0\n0\n3\n4\n2\n0\n1\n1\n0\n4\n0\n2\n0\n0\n5\n2\n0\n1\n0\n0\n1\n0\n0\n0\n1\n0\n1\n0\n0\n3\n4\n0\n1\n0\n4\n0\n2\n0\n3\n0\n3\n1\n1\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n1\n0\n1\n0\n0\n2\n0\n1\n1\n0\n0\n0\n0\n3\n3\n1\n1\n0\n0\n0\n1\n0\n1\n1\n2\n0\n0\n2\n0\n0\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n1\n0\n2\n0\n0\n1\n0\n0\n0\n0\n3\n0\n2\n0\n0\n0\n1\n0\n0\n0\n0\n0\n1\n0\n3\n0\n0\n0\n3\n0\n2\n1\n0\n0\n0\n1\n0\n0\n0\n1\n1\n2\n1\n4\n2\n0\n0\n0\n3\n0\n1\n0\n2\n0\n5\n1\n1\n1\n1\n1\n0\n1\n1\n1\n0\n0\n2\n0\n1\n0\n2\n3\n0\n2\n0\n3\n0\n3\n3\n2\n0\n1\n0\n4\n0\n1\n0\n1\n1\n1\n1\n4\n4\n0\n0\n5\n1\n1\n1\n1\n4\n0\n1\n3\n2\n0\n0\n0\n0\n2\n1\n2\n2\n0\n1\n0\n1\n0\n2\n0\n0\n1\n0\n0\n0\n1\n0\n1\n0\n0\n0\n0\n1\n0\n0\n1\n0\n1\n0\n0\n1\n0\n0\n0\n0\n2\n1\n1\n0\n1\n0\n2\n0\n1\n2\n1\n1\n1\n0\n0\n0\n0\n1\n1\n1\n0\n0\n0\n0\n1\n0\n0\n1\n1\n1\n0\n0\n0\n0\n3\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n2\n0\n1\n1\n0\n0\n1\n2\n0\n0\n1\n0\n0\n0\n2\n0\n2\n0\n3\n0\n3\n4\n3\n0\n0\n0\n0\n2\n0\n0\n4\n2\n3\n2\n0\n2\n0\n1\n0\n1\n0\n1\n1\n2\n0\n0\n3\n0\n1\n1\n0\n2\n2\n1\n0\n3\n1\n0\n0\n1\n1\n3\n1\n0\n0\n1\n0\n0\n2\n0\n0\n0\n2\n0\n1\n0\n0\n2\n0\n1\n0\n0\n4\n0\n4\n0\n2\n1\n3\n2\n2\n0\n0\n0\n1\n1\n0\n0\n0\n1\n0\n3\n0\n3\n4\n2\n0\n3\n1\n0\n3\n6\n6\n6\n2\n1\n0\n1\n2\n0\n2\n0\n2\n0\n0\n0\n6\n0\n1\n1\n6\n0\n0\n1\n1\n1\n2\n0\n0\n1\n2\n0\n0\n1\n3\n1\n0\n1\n2\n4\n3\n3\n3\n0\n3\n0\n2\n1\n2\n2\n0\n4\n2\n0\n0\n0\n0\n1\n0\n0\n1\n0\n0\n1\n1\n0\n0\n0\n1\n1\n0\n2\n0\n1\n0\n2\n0\n1\n0\n2\n0\n0\n0\n0\n3\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n1\n1\n3\n2\n3\n0\n1\n4\n0\n0\n3\n0\n0\n1\n0\n1\n1\n1\n0\n0\n2\n0\n1\n1\n0\n0\n1\n0\n0\n0\n0\n0\n2\n3\n2\n1\n1\n1\n0\n0\n2\n0\n4\n6\n0\n0\n5\n0\n6\n0\n0\n3\n0\n0\n0\n0\n0\n0\n0\n2\n4\n0\n1\n3\n1\n1\n0\n0\n1\n0\n2\n1\n1\n1\n1\n0\n0\n3\n0\n4\n0\n2\n1\n0\n1\n2\n6\n0\n1\n0\n0\n0\n1\n1\n0\n4\n0\n2\n1\n0\n1\n1\n3\n3\n0\n2\n4\n3\n0\n1\n0\n0\n1\n0\n4\n0\n1\n1\n0\n0\n0\n0\n0\n1\n0\n0\n0\n1\n0\n0\n0\n1\n2\n0\n3\n0\n2\n0\n0\n3\n1\n2\n1\n1\n0\n0\n1\n0\n2\n0\n0\n0\n1\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n2\n0\n0\n3\n3\n0\n1\n0\n1\n5\n0\n0\n1\n5\n0\n0\n0\n1\n1\n5\n0\n1\n0\n0\n2\n0\n2\n4\n6\n0\n0\n0\n1\n0\n0\n3\n1\n2\n3\n0\n10\n0\n1\n0\n0\n0\n1\n0\n0\n0\n0\n1\n1\n0\n0\n1\n1\n0\n1\n0\n1\n1\n0\n1\n1\n0\n0\n0\n2\n2\n2\n0\n0\n0\n0\n2\n1\n0\n1\n0\n2\n1\n0\n1\n4\n0\n0\n0\n1\n0\n0\n0\n1\n0\n4\n1\n0\n0\n0\n0\n0\n0\n1\n2\n1\n0\n0\n0\n1\n2\n0\n0\n0\n0\n1\n1\n0\n0\n0\n0\n2\n0\n5\n2\n0\n0\n0\n1\n2\n3\n0\n6\n0\n0\n1\n0\n2\n0\n1\n2\n0\n0\n1\n0\n2\n1\n2\n0\n1\n0\n2\n0\n0\n1\n0\n1\n1\n0\n2\n2\n0\n6\n0\n1\n0\n0\n0\n5\n2\n0\n2\n5\n5\n4\n5\n0\n7\n0\n2\n0\n0\n0\n2\n0\n2\n0\n1\n0\n1\n0\n0\n1\n2\n2\n1\n0\n5\n4\n0\n0\n0\n0\n0\n1\n1\n0\n0\n0\n0\n1\n0\n0\n1\n2\n0\n1\n3\n3\n3\n3\n0\n4\n3\n0\n1\n1\n0\n2\n3\n0\n0\n0\n2\n3\n4\n0\n0\n3\n3\n0\n0\n3\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n1\n1\n0\n0\n4\n2\n0\n1\n0\n1\n1\n1\n2\n1\n0\n1\n0\n1\n0\n0\n1\n0\n1\n1\n0\n2\n0\n1\n3\n1\n0\n0\n1\n1\n1\n3\n2\n3\n1\n1\n0\n3\n0\n1\n0\n3\n3\n1\n0\n0\n0\n0\n2\n0\n3\n2\n1\n5\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n3\n0\n0\n3\n4\n3\n1\n1\n1\n1\n1\n0\n0\n2\n2\n0\n1\n0\n0\n5\n1\n0\n2\n0\n0\n2\n0\n0\n2\n0\n0\n0\n1\n5\n0\n1\n0\n2\n0\n3\n0\n0\n0\n2\n2\n2\n0\n2\n0\n2\n0\n0\n0\n4\n2\n1\n1\n0\n0\n1\n1\n0\n0\n1\n0\n1\n4\n0\n0\n0\n0\n0\n0\n1\n5\n1\n1\n0\n0\n0\n5\n0\n6\n2\n1\n0\n0\n1\n2\n0\n0\n0\n0\n2\n2\n2\n3\n2\n1\n1\n0\n0\n0\n1\n0\n0\n0\n1\n2\n0\n0\n0\n0\n0\n1\n0\n1\n1\n0\n1\n0\n0\n0\n0\n0\n1\n0\n0\n3\n0\n0\n2\n3\n2\n0\n0\n3\n2\n1\n0\n1\n1\n0\n3\n2\n1\n1\n1\n1\n0\n0\n0\n3\n0\n0\n0\n4\n0\n0\n1\n1\n2\n2\n1\n0\n4\n1\n1\n1\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n1\n0\n3\n1\n0\n0\n1\n0\n0\n1\n0\n4\n1\n1\n1\n1\n1\n0\n0\n0\n2\n0\n0\n3\n0\n3\n1\n0\n4\n2\n0\n0\n0\n1\n0\n0\n1\n0\n0\n1\n2\n0\n0\n4\n0\n1\n2\n0\n2\n2\n2\n0\n1\n0\n0\n0\n4\n5\n4\n0\n2\n1\n1\n1\n2\n1\n1\n1\n0\n1\n1\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n2\n0\n2\n0\n0\n1\n2\n0\n0\n3\n0\n0\n1\n0\n0\n2\n1\n3\n4\n1\n0\n0\n2\n1\n0\n0\n2\n0\n3\n1\n1\n0\n2\n2\n3\n1\n1\n0\n1\n0\n0\n0\n0\n1\n0\n0\n1\n1\n0\n4\n0\n0\n1\n1\n0\n1\n1\n1\n0\n1\n1\n0\n2\n3\n2\n0\n0\n1\n0\n0\n0\n0\n0\n0\n7\n0\n0\n4\n0\n2\n0\n0\n0\n5\n0\n1\n0\n1\n0\n3\n0\n0\n0\n1\n2\n0\n3\n1\n2\n1\n0\n0\n1\n1\n2\n1\n3\n0\n0\n0\n1\n1\n0\n1\n0\n0\n0\n1\n1\n0\n1\n0\n0\n1\n3\n0\n1\n0\n0\n2\n2\n0\n0\n0\n1\n3\n1\n2\n0\n2\n4\n0\n4\n0\n4\n1\n0\n0\n6\n0\n0\n1\n0\n0\n2\n0\n0\n0\n4\n3\n5\n1\n0\n0\n1\n0\n1\n3\n0\n0\n0\n0\n2\n1\n0\n0\n0\n1\n4\n3\n0\n0\n0\n0\n0\n4\n0\n1\n0\n3\n0\n1\n1\n0\n2\n0\n0\n0\n0\n0\n2\n0\n0\n0\n1\n1\n0\n1\n2\n0\n0\n2\n0\n0\n0\n2\n0\n2\n0\n2\n1\n1\n1\n1\n1\n0\n1\n0\n0\n2\n2\n1\n0\n0\n1\n2\n2\n4\n0\n2\n0\n1\n2\n3\n2\n0\n1\n0\n0\n2\n0\n0\n1\n2\n1\n0\n2\n0\n0\n2\n0\n4\n2\n0\n5\n1\n2\n1\n1\n2\n2\n0\n0\n2\n0\n1\n0\n5\n5\n1\n5\n1\n5\n3\n7\n2\n2\n5\n0\n1\n2\n0\n2\n1\n0\n0\n0\n2\n3\n4\n3\n3\n1\n1\n0\n0\n0\n3\n0\n8\n1\n0\n0\n1\n1\n1\n1\n2\n1\n0\n0\n2\n3\n0\n1\n0\n2\n0\n0\n0\n1\n0\n1\n0\n1\n0\n0\n0\n0\n1\n0\n0\n2\n0\n2\n3\n3\n0\n0\n5\n2\n0\n3\n0\n1\n1\n4\n0\n0\n0\n1\n1\n0\n0\n0\n1\n0\n1\n1\n0\n0\n1\n0\n2\n0\n4\n0\n1\n0\n1\n0\n0\n6\n5\n0\n0\n6\n2\n2\n1\n0\n0\n3\n2\n0\n0\n2\n0\n2\n3\n0\n0\n3\n3\n0\n0\n1\n0\n0\n0\n0\n2\n0\n2\n0\n2\n2\n2\n2\n0\n2\n0\n0\n0\n3\n0\n0\n2\n0\n3\n0\n1\n1\n0\n2\n0\n0\n5\n1\n0\n1\n1\n1\n2\n1\n2\n0\n1\n1\n0\n0\n0\n2\n0\n0\n3\n0\n3\n0\n1\n0\n0\n1\n0\n1\n0\n2\n0\n0\n2\n2\n3\n3\n0\n0\n1\n1\n1\n1\n1\n0\n0\n3\n0\n1\n1\n1\n4\n1\n1\n0\n0\n0\n0\n1\n2\n0\n3\n2\n4\n0\n0\n0\n2\n3\n5\n0\n4\n0\n0\n0\n0\n0\n6\n0\n0\n1\n6\n6\n1\n0\n0\n1\n0\n2\n0\n3\n0\n1\n3\n0\n0\n0\n2\n1\n2\n5\n2\n1\n0\n3\n0\n2\n2\n5\n0\n0\n0\n0\n0\n0\n2\n1\n0\n3\n2\n0\n0\n0\n3\n2\n0\n0\n1\n0\n1\n1\n0\n0\n1\n2\n3\n0\n1\n0\n0\n2\n1\n0\n0\n1\n0\n2\n0\n0\n0\n0\n1\n1\n3\n0\n1\n1\n0\n0\n0\n1\n1\n2\n2\n0\n1\n0\n0\n1\n0\n0\n0\n0\n2\n0\n0\n0\n3\n1\n0\n1\n0\n0\n3\n1\n1\n2\n3\n1\n0\n1\n0\n1\n2\n2\n2\n0\n0\n0\n4\n5\n1\n0\n1\n1\n1\n0\n1\n2\n0\n0\n0\n0\n0\n1\n0\n0\n1\n1\n0\n0\n2\n2\n0\n2\n2\n1\n2\n0\n0\n0\n1\n0\n1\n1\n1\n1\n0\n2\n1\n0\n0\n0\n0\n0\n0\n2\n0\n0\n1\n1\n0\n0\n2\n1\n2\n0\n0\n0\n1\n0\n1\n2\n1\n0\n2\n0\n1\n1\n1\n0\n1\n1\n4\n1\n1\n0\n0\n0\n0\n0\n0\n2\n0\n0\n0\n0\n2\n2\n0\n0\n2\n0\n1\n0\n0\n2\n0\n2\n6\n4\n0\n1\n0\n1\n1\n0\n0\n1\n1\n0\n0\n1\n0\n1\n1\n0\n1\n0\n2\n1\n0\n0\n1\n0\n0\n3\n0\n3\n0\n0\n0\n0\n4\n2\n4\n1\n0\n1\n1\n0\n1\n1\n4\n2\n0\n1\n0\n0\n0\n0\n1\n0\n0\n3\n0\n0\n1\n1\n0\n6\n3\n0\n3\n2\n1\n0\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n2\n1\n0\n2\n0\n0\n0\n2\n0\n0\n1\n0\n1\n0\n3\n0\n1\n1\n0\n1\n0\n0\n1\n2\n0\n3\n2\n2\n1\n1\n0\n0\n0\n0\n2\n0\n0\n1\n3\n1\n0\n0\n2\n3\n2\n0\n0\n1\n1\n2\n1\n2\n0\n0\n1\n0\n0\n3\n3\n0\n2\n0\n0\n1\n2\n0\n3\n2\n1\n0\n0\n0\n0\n1\n0\n0\n1\n4\n0\n0\n2\n2\n6\n2\n1\n1\n1\n0\n0\n0\n0\n0\n2\n2\n0\n0\n0\n0\n0\n0\n0\n3\n0\n1\n0\n0\n4\n1\n0\n1\n2\n1\n0\n0\n0\n3\n3\n0\n0\n0\n1\n0\n0\n1\n0\n2\n2\n0\n2\n1\n0\n2\n0\n1\n1\n0\n0\n1\n3\n1\n2\n1\n0\n1\n1\n0\n0\n0\n0\n3\n0\n1\n1\n0\n0\n0\n1\n2\n0\n0\n2\n0\n0\n1\n0\n1\n3\n1\n1\n0\n0\n0\n2\n0\n0\n0\n3\n0\n0\n1\n0\n0\n0\n2\n2\n1\n2\n0\n0\n2\n1\n2\n0\n0\n1\n1\n3\n2\n0\n0\n1\n0\n0\n1\n0\n0\n1\n1\n2\n3\n0\n0\n0\n0\n0\n0\n2\n1\n1\n3\n1\n1\n0\n3\n0\n2\n3\n0\n0\n2\n0\n1\n0\n1\n0\n0\n0\n1\n1\n0\n0\n1\n0\n2\n0\n0\n1\n1\n1\n0\n0\n0\n0\n1\n4\n0\n2\n2\n0\n2\n2\n3\n3\n0\n3\n0\n0\n2\n0\n0\n4\n0\n0\n0\n3\n3\n0\n0\n0\n0\n2\n7\n0\n3\n4\n0\n0\n1\n1\n1\n0\n0\n1\n0\n0\n2\n0\n0\n0\n0\n0\n0\n1\n0\n0\n2\n0\n0\n0\n0\n2\n2\n0\n3\n2\n0\n1\n2\n0\n1\n0\n0\n0\n2\n0\n0\n2\n0\n1\n1\n1\n1\n1\n3\n0\n1\n4\n1\n1\n2\n1\n0\n0\n1\n0\n2\n1\n6\n1\n0\n6\n5\n0\n0\n1\n0\n0\n0\n2\n0\n0\n0\n0\n6\n0\n4\n7\n1\n0\n2\n0\n0\n6\n2\n2\n3\n3\n4\n0\n0\n4\n5\n1\n3\n4\n5\n3\n0\n1\n6\n1\n9\n0\n2\n7\n0\n0\n0\n0\n9\n0\n0\n1\n0\n0\n0\n1\n1\n1\n7\n0\n0\n0\n7\n0\n4\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n6\n2\n0\n0\n3\n2\n1\n0\n0\n0\n1\n0\n1\n1\n0\n1\n0\n1\n1\n0\n0\n2\n1\n1\n2\n0\n2\n2\n0\n0\n0\n0\n0\n0\n1\n0\n0\n1\n1\n0\n1\n0\n1\n0\n0\n1\n0\n2\n3\n2\n0\n1\n1\n0\n2\n0\n0\n3\n5\n0\n5\n3\n1\n1\n3\n3\n0\n0\n3\n4\n1\n6\n2\n5\n0\n6\n0\n8\n0\n0\n0\n0\n1\n1\n2\n7\n1\n0\n0\n11\n2\n3\n0\n4\n0\n0\n5\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n2\n0\n0\n2\n3\n0\n0\n1\n1\n1\n0\n0\n4\n0\n0\n2\n3\n2\n1\n0\n0\n0\n1\n2\n0\n0\n3\n0\n0\n0\n0\n1\n1\n0\n0\n3\n1\n0\n1\n0\n0\n1\n1\n1\n3\n2\n0\n0\n0\n1\n1\n3\n0\n0\n0\n0\n1\n2\n1\n0\n1\n0\n0\n0\n1\n1\n1\n1\n1\n0\n0\n0\n0\n2\n0\n2\n1\n0\n0\n2\n2\n0\n3\n0\n0\n0\n2\n2\n2\n1\n1\n2\n0\n0\n0\n0\n0\n2\n0\n2\n2\n1\n3\n0\n0\n0\n1\n0\n0\n0\n1\n1\n2\n0\n3\n0\n0\n1\n2\n0\n0\n1\n0\n0\n0\n0\n1\n1\n1\n1\n0\n0\n1\n2\n0\n2\n3\n3\n0\n0\n0\n0\n5\n2\n2\n3\n1\n2\n8\n2\n0\n0\n1\n1\n1\n0\n1\n0\n1\n0\n5\n1\n1\n0\n2\n0\n0\n2\n0\n1\n2\n1\n0\n1\n1\n0\n1\n1\n1\n0\n2\n0\n1\n0\n0\n1\n0\n1\n1\n1\n1\n2\n0\n2\n1\n2\n0\n0\n1\n0\n0\n0\n0\n0\n3\n4\n0\n0\n1\n0\n1\n3\n4\n0\n1\n4\n0\n3\n0\n0\n1\n0\n4\n4\n2\n0\n0\n0\n1\n2\n0\n0\n3\n3\n4\n0\n0\n3\n3\n1\n1\n0\n2\n2\n0\n0\n0\n2\n1\n1\n0\n1\n0\n0\n2\n0\n4\n2\n0\n0\n0\n0\n0\n0\n2\n1\n0\n0\n0\n0\n0\n3\n0\n0\n3\n0\n2\n0\n6\n0\n1\n0\n1\n1\n1\n1\n0\n0\n0\n3\n1\n0\n1\n0\n3\n3\n2\n3\n1\n4\n0\n0\n0\n0\n1\n1\n2\n1\n1\n0\n1\n0\n0\n0\n1\n0\n1\n0\n3\n0\n0\n0\n1\n1\n2\n2\n3\n2\n0\n1\n0\n2\n2\n0\n0\n3\n0\n0\n0\n6\n1\n3\n0\n0\n9\n0\n3\n2\n0\n2\n0\n0\n0\n1\n0\n1\n0\n0\n0\n2\n0\n0\n1\n1\n3\n1\n0\n0\n0\n1\n0\n1\n1\n1\n0\n3\n0\n0\n1\n0\n0\n2\n1\n1\n0\n1\n3\n4\n1\n0\n1\n0\n0\n0\n0\n2\n0\n0\n0\n0\n0\n0\n0\n3\n3\n0\n0\n1\n2\n0\n0\n0\n1\n0\n1\n2\n3\n0\n0\n0\n0\n0\n0\n1\n1\n1\n2\n1\n1\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n2\n1\n0\n2\n3\n0\n0\n0\n0\n1\n1\n1\n1\n0\n1\n0\n1\n1\n1\n0\n0\n0\n3\n2\n2\n1\n1\n0\n0\n0\n0\n4\n0\n3\n0\n0\n0\n0\n0\n0\n0\n0\n0\n3\n0\n3\n0\n0\n0\n0\n0\n4\n1\n0\n0\n0\n1\n0\n0\n1\n0\n2\n2\n0\n1\n2\n2\n0\n3\n0\n2\n0\n0\n1\n2\n0\n2\n2\n0\n0\n0\n0\n1\n1\n0\n1\n2\n0\n1\n0\n1\n0\n1\n0\n2\n0\n0\n1\n2\n0\n1\n0\n0\n2\n0\n2\n2\n0\n0\n0\n0\n0\n3\n3\n1\n0\n1\n1\n1\n1\n0\n0\n0\n0\n0\n0\n2\n0\n2\n1\n0\n1\n0\n1\n0\n0\n2\n3\n2\n2\n0\n4\n1\n0\n0\n1\n0\n2\n2\n1\n0\n1\n0\n1\n0\n0\n1\n0\n0\n1\n2\n0\n1\n1\n1\n1\n0\n1\n0\n1\n0\n2\n6\n5\n3\n0\n2\n2\n1\n2\n3\n1\n0\n0\n0\n0\n0\n0\n0\n0\n2\n0\n0\n0\n2\n0\n0\n0\n1\n0\n0\n1\n0\n2\n0\n2\n0\n1\n0\n4\n2\n0\n4\n2\n0\n2\n0\n0\n0\n2\n0\n0\n0\n1\n1\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n3\n3\n4\n2\n0\n3\n1\n0\n1\n1\n0\n0\n1\n0\n2\n2\n0\n1\n3\n0\n4\n0\n1\n0\n4\n6\n4\n0\n5\n0\n5\n5\n1\n0\n0\n4\n0\n2\n0\n0\n1\n0\n1\n0\n0\n0\n1\n1\n1\n1\n1\n1\n0\n0\n0\n0\n1\n1\n1\n0\n1\n0\n1\n3\n6\n1\n0\n0\n3\n3\n4\n0\n3\n4\n0\n0\n1\n0\n3\n2\n0\n0\n0\n9\n0\n3\n1\n1\n2\n2\n0\n0\n0\n0\n0\n2\n1\n0\n3\n2\n0\n0\n0\n0\n0\n1\n1\n0\n0\n1\n0\n0\n0\n2\n3\n1\n0\n0\n0\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n4\n3\n4\n0\n4\n0\n0\n0\n1\n1\n0\n2\n1\n0\n2\n2\n0\n5\n0\n3\n0\n0\n0\n2\n0\n1\n1\n1\n0\n0\n1\n1\n1\n1\n3\n0\n0\n0\n0\n0\n0\n1\n1\n2\n0\n0\n3\n0\n4\n0\n2\n4\n0\n3\n3\n3\n0\n3\n6\n2\n0\n3\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n4\n0\n0\n4\n2\n3\n0\n4\n0\n0\n1\n0\n0\n0\n0\n0\n1\n0\n1\n0\n0\n1\n0\n1\n0\n0\n0\n0\n0\n2\n3\n1\n5\n0\n0\n3\n0\n0\n0\n0\n0\n0\n1\n1\n2\n4\n1\n0\n0\n2\n0\n2\n1\n0\n1\n0\n1\n0\n0\n0\n0\n0\n1\n1\n1\n0\n0\n0\n3\n1\n0\n0\n1\n1\n0\n1\n1\n1\n1\n0\n1\n1\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n2\n3\n3\n1\n0\n0\n2\n0\n1\n0\n0\n1\n0\n0\n2\n1\n0\n2\n2\n0\n0\n0\n0\n0\n2\n2\n0\n0\n0\n4\n4\n0\n0\n1\n1\n0\n1\n0\n1\n1\n1\n0\n1\n0\n0\n0\n1\n1\n0\n0\n0\n0\n2\n0\n1\n1\n0\n1\n1\n2\n0\n0\n1\n0\n0\n0\n2\n2\n1\n1\n1\n0\n0\n0\n2\n0\n0\n0\n0\n0\n0\n1\n0\n1\n1\n0\n6\n2\n5\n2\n3\n3\n7\n0\n3\n1\n0\n4\n8\n0\n0\n1\n0\n2\n2\n1\n0\n1\n2\n2\n1\n1\n0\n1\n0\n1\n1\n0\n0\n3\n1\n2\n2\n2\n0\n2\n0\n2\n0\n2\n2\n0\n1\n4\n4\n1\n0\n0\n0\n5\n4\n0\n0\n0\n1\n1\n1\n0\n0\n1\n0\n1\n0\n1\n1\n0\n1\n0\n1\n2\n2\n1\n3\n2\n0\n0\n0\n1\n1\n0\n0\n0\n3\n0\n0\n1\n1\n1\n0\n1\n2\n1\n0\n0\n0\n0\n0\n4\n2\n0\n2\n0\n1\n0\n1\n1\n3\n0\n1\n0\n2\n1\n1\n0\n0\n0\n1\n0\n1\n2\n2\n2\n1\n0\n0\n0\n1\n2\n2\n0\n1\n0\n0\n3\n1\n1\n1\n0\n1\n0\n3\n0\n0\n0\n1\n3\n0\n3\n3\n0\n0\n0\n0\n0\n2\n4\n0\n2\n1\n1\n1\n0\n2\n2\n2\n3\n1\n1\n1\n1\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n1\n4\n1\n0\n1\n0\n0\n0\n0\n5\n2\n0\n3\n0\n5\n0\n0\n5\n0\n1\n2\n2\n2\n2\n0\n0\n0\n2\n0\n3\n4\n0\n1\n1\n0\n2\n0\n0\n0\n0\n0\n2\n0\n0\n0\n0\n0\n1\n0\n0\n2\n0\n3\n0\n1\n0\n0\n0\n0\n1\n1\n1\n0\n0\n0\n2\n0\n1\n1\n1\n0\n1\n3\n4\n0\n0\n0\n0\n1\n0\n5\n0\n3\n0\n2\n4\n3\n2\n0\n3\n3\n7\n0\n0\n2\n7\n1\n0\n11\n0\n4\n0\n0\n0\n4\n2\n1\n4\n0\n1\n1\n3\n1\n1\n1\n1\n0\n1\n0\n1\n2\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n1\n0\n0\n3\n1\n1\n0\n1\n0\n0\n0\n0\n3\n0\n4\n1\n3\n0\n1\n0\n2\n1\n0\n0\n1\n0\n0\n1\n1\n1\n0\n1\n0\n0\n1\n0\n0\n0\n0\n2\n0\n1\n1\n0\n0\n3\n0\n0\n0\n0\n0\n0\n1\n0\n0\n2\n0\n3\n3\n1\n1\n1\n0\n3\n3\n1\n2\n1\n3\n0\n0\n0\n0\n0\n0\n0\n2\n3\n4\n5\n0\n0\n2\n0\n3\n1\n1\n2\n0\n0\n0\n3\n3\n0\n0\n2\n0\n0\n0\n1\n3\n2\n0\n0\n0\n1\n1\n0\n0\n2\n2\n2\n0\n1\n0\n0\n0\n3\n2\n0\n0\n2\n0\n3\n0\n2\n0\n3\n0\n5\n0\n0\n0\n0\n0\n0\n5\n0\n3\n4\n5\n4\n2\n0\n0\n2\n0\n7\n1\n0\n0\n3\n1\n0\n0\n0\n4\n0\n0\n0\n1\n1\n0\n1\n0\n1\n0\n1\n0\n0\n1\n1\n0\n2\n2\n2\n3\n7\n4\n2\n0\n2\n0\n1\n0\n1\n0\n0\n1\n0\n0\n2\n0\n0\n2\n0\n1\n0\n1\n0\n0\n1\n1\n1\n0\n3\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n5\n0\n0\n2\n0\n0\n0\n0\n0\n0\n0\n3\n0\n0\n5\n1\n4\n1\n6\n3\n3\n1\n1\n5\n1\n0\n1\n0\n0\n2\n1\n2\n0\n1\n0\n4\n0\n1\n0\n2\n1\n0\n2\n0\n0\n0\n0\n0\n5\n0\n4\n2\n3\n5\n3\n0\n1\n0\n1\n0\n1\n0\n0\n2\n0\n1\n0\n0\n1\n2\n1\n0\n0\n1\n0\n1\n0\n1\n0\n2\n1\n0\n0\n1\n0\n2\n0\n2\n0\n0\n0\n2\n0\n0\n1\n0\n0\n2\n0\n1\n0\n2\n0\n8\n1\n0\n0\n0\n0\n0\n0\n3\n0\n0\n2\n0\n0\n2\n0\n2\n0\n3\n0\n2\n1\n0\n0\n2\n0\n0\n2\n0\n2\n0\n0\n0\n0\n4\n0\n0\n5\n0\n1\n0\n0\n0\n1\n2\n0\n0\n2\n0\n0\n0\n0\n1\n1\n2\n3\n3\n0\n2\n1\n1\n1\n0\n0\n4\n2\n2\n4\n4\n0\n0\n1\n0\n0\n0\n1\n0\n1\n0\n0\n0\n1\n1\n1\n0\n1\n0\n1\n2\n1\n1\n1\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n3\n0\n0\n0\n2\n0\n2\n2\n2\n0\n1\n5\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n1\n0\n0\n1\n4\n0\n0\n1\n0\n1\n1\n0\n0\n1\n2\n3\n0\n1\n1\n0\n1\n1\n1\n1\n0\n1\n0\n0\n2\n0\n0\n1\n1\n0\n0\n3\n3\n3\n1\n1\n1\n2\n0\n4\n2\n0\n1\n0\n4\n0\n0\n0\n1\n1\n0\n0\n0\n4\n1\n0\n5\n0\n5\n0\n1\n1\n1\n0\n1\n1\n1\n0\n0\n1\n2\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n3\n1\n0\n0\n0\n4\n0\n1\n0\n2\n0\n3\n0\n0\n0\n0\n1\n7\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n1\n0\n1\n0\n0\n2\n0\n0\n1\n1\n0\n1\n1\n1\n1\n0\n0\n1\n0\n3\n2\n0\n5\n0\n0\n2\n0\n0\n5\n0\n4\n1\n0\n4\n2\n1\n1\n0\n0\n0\n0\n2\n0\n0\n2\n3\n3\n0\n4\n2\n0\n0\n1\n0\n3\n0\n3\n2\n3\n1\n0\n0\n0\n4\n1\n0\n1\n0\n0\n0\n2\n0\n0\n0\n1\n2\n1\n1\n0\n1\n1\n0\n0\n0\n0\n1\n1\n0\n0\n1\n0\n0\n4\n0\n1\n0\n2\n0\n0\n4\n2\n1\n1\n0\n1\n1\n0\n0\n0\n0\n2\n1\n0\n0\n0\n3\n0\n0\n1\n1\n1\n0\n0\n0\n0\n2\n2\n0\n0\n0\n1\n0\n0\n0\n1\n0\n2\n0\n1\n1\n2\n4\n0\n0\n3\n1\n0\n0\n2\n0\n0\n0\n5\n4\n0\n1\n4\n0\n0\n1\n0\n0\n0\n5\n7\n6\n1\n5\n0\n0\n0\n0\n0\n1\n0\n1\n2\n0\n1\n1\n1\n0\n0\n0\n1\n1\n1\n2\n0\n2\n0\n0\n0\n0\n0\n2\n0\n1\n0\n2\n6\n0\n2\n0\n1\n0\n0\n0\n0\n4\n0\n1\n0\n1\n1\n1\n2\n2\n1\n0\n0\n2\n0\n0\n1\n1\n0\n0\n1\n1\n1\n3\n0\n3\n1\n1\n0\n3\n0\n0\n0\n2\n1\n1\n2\n0\n2\n0\n0\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n0\n1\n0\n1\n1\n2\n4\n1\n0\n0\n1\n0\n0\n1\n1\n1\n0\n0\n1\n0\n1\n0\n0\n1\n1\n2\n0\n1\n0\n0\n0\n0\n0\n3\n0\n3\n1\n0\n0\n1\n0\n0\n1\n0\n0\n3\n0\n0\n0\n6\n1\n0\n0\n2\n0\n0\n1\n3\n3\n0\n2\n0\n0\n2\n0\n4\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n0\n0\n0\n1\n0\n0\n2\n0\n2\n0\n2\n0\n1\n1\n0\n2\n0\n0\n1\n0\n2\n2\n0\n0\n4\n0\n4\n0\n0\n0\n0\n0\n0\n1\n1\n1\n0\n1\n0\n3\n1\n1\n0\n1\n2\n0\n0\n0\n0\n1\n0\n0\n1\n0\n3\n0\n1\n1\n3\n0\n7\n0\n1\n1\n0\n0\n0\n0\n0\n0\n4\n4\n0\n4\n2\n2\n4\n0\n0\n2\n0\n1\n0\n0\n1\n1\n0\n3\n1\n1\n0\n0\n1\n0\n1\n2\n1\n1\n0\n0\n1\n1\n0\n0\n0\n0\n2\n0\n1\n0\n1\n0\n2\n0\n2\n0\n0\n0\n0\n0\n3\n0\n2\n0\n3\n0\n3\n0\n2\n0\n0\n0\n1\n1\n0\n0\n2\n0\n1\n0\n0\n0\n1\n1\n1\n1\n1\n1\n0\n1\n0\n0\n0\n0\n0\n1\n1\n2\n0\n1\n1\n1\n1\n1\n1\n0\n0\n0\n0\n2\n1\n1\n2\n0\n3\n0\n2\n0\n2\n0\n1\n0\n0\n0\n6\n0\n1\n2\n0\n1\n0\n0\n1\n1\n0\n3\n1\n2\n0\n0\n2\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n3\n0\n1\n0\n4\n0\n1\n1\n0\n3\n1\n1\n2\n0\n1\n2\n0\n0\n2\n2\n0\n0\n0\n1\n1\n1\n1\n0\n1\n0\n0\n0\n1\n0\n3\n0\n0\n2\n0\n0\n1\n1\n1\n2\n0\n1\n1\n0\n1\n0\n1\n0\n2\n0\n0\n1\n1\n0\n1\n0\n0\n0\n1\n0\n0\n0\n0\n2\n2\n1\n1\n3\n0\n0\n0\n0\n0\n4\n3\n0\n1\n3\n0\n4\n4\n1\n1\n0\n0\n1\n1\n0\n4\n1\n1\n1\n0\n0\n0\n1\n0\n1\n0\n0\n1\n0\n2\n0\n0\n0\n0\n0\n3\n1\n0\n0\n0\n1\n0\n1\n0\n3\n1\n0\n2\n2\n0\n0\n0\n3\n1\n0\n1\n0\n0\n0\n1\n1\n0\n0\n2\n1\n1\n0\n1\n1\n1\n0\n0\n2\n0\n1\n2\n1\n0\n1\n0\n1\n1\n0\n0\n0\n0\n2\n0\n1\n0\n0\n2\n0\n0\n1\n0\n1\n0\n2\n2\n2\n0\n1\n2\n2\n2\n0\n3\n6\n0\n4\n0\n5\n0\n4\n0\n1\n1\n1\n0\n4\n1\n0\n1\n1\n4\n4\n0\n2\n4\n0\n0\n2\n1\n1\n0\n0\n0\n0\n0\n0\n0\n1\n1\n1\n0\n1\n1\n2\n0\n2\n0\n4\n1\n0\n4\n4\n0\n0\n3\n0\n3\n1\n3\n0\n2\n0\n2\n2\n0\n0\n1\n0\n1\n1\n1\n1\n1\n0\n0\n0\n2\n0\n2\n0\n0\n4\n4\n4\n0\n1\n3\n2\n0\n2\n5\n5\n6\n0\n6\n0\n2\n2\n1\n0\n0\n1\n0\n1\n1\n0\n0\n0\n0\n2\n1\n1\n1\n2\n2\n1\n0\n1\n0\n0\n0\n0\n3\n5\n0\n0\n4\n5\n5\n0\n0\n1\n0\n1\n0\n0\n0\n2\n0\n2\n1\n0\n1\n3\n3\n4\n0\n0\n2\n1\n0\n0\n1\n1\n1\n1\n2\n0\n2\n0\n1\n1\n1\n1\n0\n0\n0\n0\n0\n0\n2\n0\n0\n1\n0\n1\n1\n1\n1\n0\n0\n1\n1\n1\n1\n1\n1\n0\n0\n0\n0\n0\n2\n5\n5\n3\n3\n1\n0\n0\n2\n2\n0\n1\n1\n1\n1\n0\n0\n0\n3\n0\n2\n2\n2\n0\n2\n0\n0\n0\n6\n0\n1\n10\n0\n0\n0\n1\n1\n2\n1\n1\n0\n0\n7\n0\n0\n0\n0\n0\n0\n0\n2\n0\n1\n2\n2\n0\n0\n1\n0\n1\n0\n0\n1\n0\n1\n1\n2\n2\n1\n0\n0\n0\n2\n0\n0\n3\n0\n1\n1\n1\n1\n0\n1\n1\n1\n0\n0\n0\n0\n1\n1\n0\n1\n0\n1\n1\n1\n0\n2\n0\n0\n2\n1\n0\n1\n0\n0\n1\n0\n0\n0\n0\n2\n0\n0\n3\n3\n0\n0\n4\n0\n4\n0\n0\n1\n0\n0\n0\n6\n0\n1\n3\n4\n1\n1\n0\n0\n1\n2\n0\n6\n0\n0\n5\n4\n0\n5\n0\n0\n1\n1\n0\n1\n0\n1\n1\n1\n1\n0\n1\n1\n1\n0\n0\n1\n1\n2\n1\n0\n0\n0\n4\n3\n4\n0\n4\n0\n3\n0\n0\n0\n2\n0\n4\n0\n1\n0\n1\n1\n1\n3\n2\n5\n0\n0\n1\n0\n3\n0\n0\n0\n1\n0\n0\n1\n1\n1\n2\n1\n1\n0\n0\n1\n1\n1\n2\n1\n0\n2\n0\n2\n2\n0\n2\n2\n2\n0\n2\n1\n0\n0\n0\n2\n0\n1\n0\n0\n0\n0\n0\n0\n1\n2\n2\n2\n2\n2\n0\n1\n0\n1\n0\n1\n0\n0\n2\n1\n0\n1\n0\n3\n1\n0\n0\n5\n2\n1\n0\n1\n0\n2\n2\n0\n2\n0\n2\n4\n1\n0\n4\n4\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n6\n0\n0\n10\n0\n3\n2\n1\n0\n0\n1\n0\n4\n2\n0\n0\n3\n1\n0\n0\n0\n1\n0\n1\n0\n0\n0\n3\n0\n0\n1\n2\n0\n0\n8\n2\n0\n0\n1\n0\n0\n1\n0\n1\n1\n0\n1\n1\n1\n0\n0\n2\n0\n0\n0\n0\n0\n3\n0\n0\n2\n0\n1\n0\n1\n0\n3\n0\n0\n1\n3\n0\n2\n1\n2\n2\n2\n1\n0\n0\n2\n0\n3\n3\n3\n1\n1\n0\n4\n0\n0\n5\n0\n1\n1\n0\n0\n0\n0\n0\n0\n0\n8\n0\n2\n1\n2\n0\n2\n0\n1\n0\n0\n1\n0\n0\n0\n0\n2\n0\n1\n0\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n0\n0\n0\n2\n0\n1\n1\n1\n0\n1\n3\n0\n2\n0\n2\n2\n0\n0\n4\n2\n0\n0\n0\n1\n0\n0\n0\n1\n0\n2\n3\n0\n0\n1\n0\n2\n5\n0\n0\n0\n0\n0\n0\n0\n2\n0\n0\n1\n1\n1\n1\n0\n0\n1\n0\n0\n2\n0\n0\n0\n4\n0\n2\n0\n1\n0\n0\n1\n1\n0\n2\n3\n0\n3\n0\n0\n0\n0\n2\n5\n0\n1\n1\n0\n1\n0\n0\n4\n0\n0\n0\n0\n0\n1\n3\n4\n0\n1\n0\n2\n0\n0\n1\n1\n0\n1\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n1\n0\n1\n1\n1\n1\n1\n0\n0\n0\n2\n2\n3\n2\n0\n3\n0\n0\n0\n0\n6\n1\n1\n2\n3\n0\n3\n0\n2\n0\n2\n1\n0\n1\n1\n1\n1\n1\n0\n1\n0\n0\n1\n0\n4\n0\n0\n2\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n0\n0\n1\n0\n1\n0\n1\n0\n0\n0\n0\n1\n1\n0\n0\n0\n0\n1\n0\n0\n1\n2\n1\n0\n1\n1\n1\n1\n1\n0\n0\n2\n0\n3\n3\n0\n0\n3\n0\n1\n0\n0\n1\n1\n0\n2\n0\n3\n0\n0\n4\n0\n1\n0\n1\n2\n2\n0\n3\n3\n7\n8\n9\n0\n0\n1\n0\n4\n0\n1\n0\n1\n12\n12\n0\n0\n0\n0\n1\n11\n0\n3\n12\n2\n0\n1\n0\n0\n0\n1\n1\n0\n2\n2\n2\n0\n1\n2\n0\n1\n0\n0\n0\n1\n0\n1\n0\n1\n1\n1\n0\n1\n2\n2\n1\n0\n0\n1\n0\n0\n0\n3\n1\n0\n0\n1\n1\n1\n2\n0\n3\n0\n0\n3\n3\n3\n0\n6\n1\n1\n1\n0\n0\n2\n2\n0\n2\n1\n1\n0\n1\n0\n0\n0\n1\n0\n2\n1\n0\n0\n1\n0\n1\n2\n2\n0\n3\n5\n3\n3\n3\n7\n2\n0\n0\n0\n3\n0\n0\n1\n0\n0\n0\n0\n0\n0\n5\n1\n1\n1\n0\n0\n1\n0\n0\n0\n0\n1\n1\n0\n1\n0\n0\n1\n0\n1\n0\n0\n1\n1\n1\n2\n0\n1\n2\n1\n2\n0\n0\n0\n1\n2\n0\n0\n2\n0\n0\n0\n3\n0\n0\n0\n1\n1\n1\n0\n0\n1\n3\n1\n1\n0\n2\n0\n1\n2\n1\n0\n0\n0\n0\n1\n1\n0\n0\n0\n1\n0\n1\n1\n1\n4\n2\n3\n1\n5\n0\n3\n7\n0\n1\n0\n1\n1\n1\n0\n0\n3\n0\n0\n2\n0\n0\n0\n2\n1\n0\n0\n3\n1\n1\n0\n1\n0\n1\n1\n0\n0\n0\n0\n1\n0\n3\n0\n1\n1\n2\n0\n0\n0\n2\n0\n2\n2\n0\n0\n0\n2\n0\n0\n0\n0\n0\n1\n0\n2\n2\n2\n1\n4\n0\n2\n3\n1\n4\n0\n3\n0\n0\n0\n0\n0\n2\n2\n3\n0\n0\n0\n2\n1\n0\n2\n1\n2\n5\n2\n1\n1\n0\n1\n1\n1\n0\n2\n2\n3\n2\n1\n2\n0\n1\n0\n1\n2\n0\n1\n0\n0\n2\n0\n0\n2\n1\n0\n0\n0\n1\n0\n1\n0\n3\n0\n3\n1\n1\n0\n0\n0\n0\n1\n0\n0\n1\n2\n1\n3\n2\n1\n1\n1\n1\n0\n1\n2\n1\n0\n0\n2\n0\n3\n0\n2\n1\n0\n2\n0\n4\n2\n4\n0\n5\n0\n1\n1\n0\n0\n0\n9\n0\n0\n0\n1\n0\n2\n0\n0\n2\n1\n0\n1\n1\n1\n1\n0\n0\n1\n1\n1\n0\n1\n1\n0\n0\n2\n2\n1\n0\n2\n0\n2\n1\n1\n0\n3\n0\n0\n2\n3\n0\n1\n1\n1\n2\n2\n0\n1\n1\n0\n1\n0\n1\n2\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n1\n3\n1\n0\n0\n0\n0\n0\n1\n0\n1\n0\n0\n0\n3\n0\n0\n3\n4\n1\n0\n2\n4\n1\n0\n1\n0\n1\n1\n5\n2\n2\n0\n0\n0\n0\n0\n0\n0\n7\n3\n0\n0\n7\n0\n1\n0\n2\n0\n0\n1\n0\n1\n0\n0\n0\n0\n0\n2\n1\n2\n1\n2\n0\n0\n0\n0\n0\n0\n0\n0\n0\n3\n2\n5\n0\n0\n1\n1\n2\n0\n0\n0\n0\n2\n2\n0\n1\n0\n1\n1\n1\n2\n2\n0\n2\n2\n2\n0\n1\n0\n0\n1\n4\n0\n0\n2\n0\n0\n0\n0\n0\n2\n0\n2\n0\n0\n5\n0\n1\n5\n1\n2\n1\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n1\n3\n1\n0\n0\n1\n0\n0\n0\n1\n0\n1\n0\n0\n1\n0\n0\n2\n2\n3\n3\n2\n0\n0\n3\n0\n1\n0\n0\n0\n1\n2\n0\n1\n0\n1\n1\n2\n0\n1\n0\n1\n0\n0\n3\n0\n2\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n1\n0\n0\n4\n4\n0\n0\n3\n1\n0\n0\n1\n2\n0\n0\n0\n1\n0\n0\n2\n0\n2\n3\n3\n0\n1\n1\n0\n1\n0\n2\n1\n1\n1\n0\n1\n2\n0\n1\n2\n0\n0\n0\n0\n1\n0\n0\n2\n0\n0\n0\n1\n0\n1\n0\n0\n2\n0\n2\n0\n1\n0\n0\n3\n2\n1\n1\n0\n4\n0\n4\n4\n0\n0\n0\n0\n1\n0\n1\n1\n1\n0\n0\n2\n1\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n0\n2\n0\n0\n1\n2\n0\n0\n2\n0\n0\n0\n0\n0\n0\n2\n4\n0\n0\n1\n1\n0\n0\n1\n0\n3\n0\n1\n0\n1\n0\n1\n1\n1\n0\n0\n0\n0\n1\n3\n1\n0\n0\n1\n0\n0\n1\n0\n1\n1\n0\n3\n3\n0\n0\n3\n2\n0\n0\n0\n3\n0\n0\n0\n0\n0\n1\n1\n1\n0\n0\n0\n0\n0\n0\n1\n0\n2\n0\n0\n0\n0\n0\n0\n1\n2\n0\n0\n0\n0\n6\n3\n4\n0\n0\n0\n0\n1\n0\n0\n0\n1\n0\n0\n3\n1\n0\n0\n1\n0\n0\n1\n0\n0\n2\n0\n1\n1\n5\n6\n3\n0\n0\n6\n6\n1\n0\n0\n5\n0\n1\n0\n4\n0\n0\n0\n0\n5\n0\n0\n3\n1\n1\n2\n2\n2\n1\n2\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n3\n0\n0\n7\n0\n7\n0\n0\n3\n0\n0\n1\n0\n0\n0\n3\n2\n2\n0\n0\n1\n0\n1\n1\n1\n1\n1\n0\n0\n0\n4\n0\n0\n0\n2\n0\n0\n3\n0\n0\n4\n0\n0\n4\n0\n5\n7\n0\n7\n2\n0\n0\n0\n0\n1\n0\n0\n0\n3\n0\n1\n0\n0\n0\n2\n0\n0\n0\n0\n0\n5\n1\n1\n1\n5\n0\n1\n0\n3\n0\n0\n2\n0\n0\n0\n0\n0\n0\n0\n3\n0\n0\n0\n2\n3\n4\n4\n0\n3\n0\n4\n0\n0\n1\n4\n1\n0\n1\n1\n1\n1\n1\n0\n1\n0\n1\n1\n0\n1\n1\n1\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n2\n2\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n0\n1\n0\n1\n1\n0\n0\n1\n0\n0\n2\n0\n1\n1\n2\n2\n1\n0\n0\n0\n0\n0\n2\n0\n3\n5\n0\n4\n2\n0\n1\n0\n2\n0\n0\n0\n0\n0\n0\n3\n2\n4\n0\n1\n0\n1\n3\n0\n0\n8\n0\n0\n2\n0\n1\n0\n5\n3\n0\n0\n1\n0\n0\n0\n5\n2\n0\n0\n0\n1\n0\n0\n0\n0\n0\n2\n0\n0\n1\n1\n1\n0\n1\n0\n0\n0\n3\n1\n3\n1\n2\n0\n1\n1\n0\n0\n0\n0\n0\n0\n2\n2\n1\n0\n0\n0\n1\n1\n1\n1\n2\n0\n0\n1\n0\n0\n1\n0\n1\n0\n2\n0\n0\n3\n0\n4\n0\n0\n5\n5\n0\n0\n1\n0\n0\n3\n0\n0\n1\n0\n0\n0\n0\n2\n0\n1\n1\n0\n1\n1\n0\n0\n1\n1\n0\n3\n0\n1\n2\n0\n2\n3\n0\n1\n1\n1\n0\n1\n2\n0\n0\n0\n1\n0\n0\n0\n0\n2\n2\n0\n1\n0\n2\n0\n0\n1\n1\n0\n1\n1\n0\n1\n0\n0\n2\n0\n0\n0\n1\n0\n1\n0\n0\n2\n2\n0\n1\n0\n1\n0\n2\n0\n2\n0\n0\n3\n0\n3\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n3\n3\n0\n1\n0\n1\n0\n0\n2\n1\n1\n0\n1\n0\n0\n0\n1\n1\n1\n1\n2\n4\n2\n0\n0\n0\n5\n1\n0\n2\n0\n1\n0\n0\n0\n0\n0\n2\n1\n4\n1\n1\n0\n1\n1\n3\n2\n3\n0\n1\n0\n0\n0\n0\n5\n1\n1\n1\n0\n0\n1\n2\n1\n1\n1\n0\n0\n1\n3\n3\n3\n1\n0\n1\n0\n1\n1\n0\n0\n1\n0\n2\n3\n0\n0\n0\n1\n0\n3\n1\n0\n0\n1\n1\n0\n0\n3\n0\n0\n0\n0\n1\n0\n1\n0\n2\n2\n1\n2\n0\n1\n0\n2\n3\n3\n4\n3\n5\n2\n0\n0\n1\n0\n1\n0\n0\n1\n0\n1\n1\n1\n1\n4\n0\n1\n0\n0\n1\n0\n0\n1\n3\n0\n1\n0\n1\n0\n0\n1\n0\n1\n0\n2\n1\n0\n0\n0\n0\n1\n0\n1\n0\n2\n2\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n1\n2\n3\n0\n1\n2\n0\n0\n2\n2\n4\n4\n2\n0\n5\n0\n0\n0\n1\n4\n0\n2\n0\n0\n1\n1\n1\n0\n1\n0\n1\n0\n0\n1\n1\n0\n0\n1\n1\n1\n0\n2\n0\n0\n0\n0\n3\n1\n1\n0\n0\n1\n1\n0\n0\n0\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n2\n1\n1\n0\n0\n2\n2\n0\n1\n0\n0\n0\n2\n2\n0\n0\n3\n3\n3\n1\n0\n0\n0\n0\n1\n0\n1\n4\n0\n0\n5\n0\n3\n3\n0\n1\n0\n2\n1\n0\n2\n2\n4\n0\n2\n1\n2\n0\n1\n0\n0\n0\n0\n0\n2\n3\n0\n0\n0\n4\n1\n0\n0\n1\n1\n1\n0\n2\n1\n0\n0\n0\n2\n0\n3\n0\n1\n0\n0\n0\n3\n1\n0\n0\n0\n0\n0\n1\n0\n1\n2\n1\n3\n4\n3\n3\n0\n0\n0\n4\n0\n0\n0\n4\n4\n1\n1\n0\n5\n1\n2\n2\n0\n2\n3\n1\n2\n8\n1\n1\n5\n5\n0\n0\n2\n1\n1\n0\n1\n0\n1\n0\n0\n0\n0\n0\n1\n1\n3\n3\n0\n0\n0\n1\n1\n1\n0\n1\n0\n2\n1\n0\n0\n0\n0\n2\n0\n0\n0\n3\n0\n0\n0\n0\n1\n1\n0\n1\n0\n1\n3\n0\n1\n0\n0\n0\n0\n0\n5\n0\n4\n0\n0\n1\n1\n0\n1\n0\n1\n2\n1\n0\n0\n1\n0\n0\n0\n2\n0\n0\n3\n0\n0\n0\n1\n0\n1\n3\n0\n1\n3\n0\n2\n2\n1\n0\n0\n0\n2\n1\n0\n0\n2\n0\n0\n1\n0\n0\n0\n0\n3\n3\n1\n0\n2\n3\n0\n0\n0\n0\n0\n0\n4\n4\n0\n0\n1\n3\n3\n4\n0\n0\n0\n1\n2\n0\n1\n1\n0\n2\n1\n1\n0\n0\n0\n4\n3\n0\n2\n0\n0\n0\n0\n1\n4\n3\n0\n0\n0\n2\n3\n2\n0\n0\n0\n0\n0\n2\n0\n0\n1\n1\n1\n0\n1\n1\n2\n0\n1\n0\n1\n1\n1\n1\n3\n2\n0\n0\n0\n0\n2\n0\n1\n1\n0\n0\n0\n0\n1\n0\n0\n1\n0\n0\n2\n1\n0\n1\n1\n1\n0\n1\n2\n0\n0\n0\n0\n1\n2\n0\n0\n0\n1\n0\n1\n1\n0\n0\n1\n0\n0\n2\n1\n1\n0\n0\n1\n2\n0\n1\n1\n3\n0\n0\n5\n0\n5\n0\n0\n0\n1\n1\n0\n2\n0\n4\n5\n3\n0\n5\n2\n0\n4\n0\n5\n0\n0\n1\n0\n2\n1\n0\n0\n2\n2\n4\n0\n4\n1\n1\n2\n2\n0\n1\n1\n0\n1\n2\n2\n5\n1\n6\n4\n0\n1\n2\n1\n1\n1\n0\n0\n0\n3\n3\n0\n3\n1\n0\n0\n0\n3\n6\n0\n0\n0\n1\n0\n0\n0\n2\n0\n0\n2\n0\n3\n1\n0\n2\n0\n0\n1\n0\n0\n0\n1\n1\n1\n3\n2\n0\n3\n3\n2\n0\n0\n0\n1\n0\n1\n2\n3\n1\n0\n1\n0\n2\n1\n1\n0\n0\n0\n1\n2\n1\n1\n0\n1\n0\n0\n0\n1\n1\n2\n3\n2\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n2\n2\n0\n0\n3\n0\n3\n0\n0\n0\n4\n3\n1\n1\n1\n1\n1\n1\n0\n3\n0\n2\n0\n1\n0\n0\n0\n3\n1\n4\n4\n0\n0\n2\n1\n3\n0\n3\n1\n0\n0\n1\n1\n0\n2\n2\n2\n0\n1\n3\n0\n1\n1\n1\n0\n1\n0\n1\n2\n1\n1\n1\n1\n1\n1\n1\n1\n0\n1\n0\n0\n0\n1\n0\n0\n1\n1\n1\n0\n3\n2\n1\n0\n0\n0\n0\n0\n2\n2\n0\n0\n1\n1\n1\n2\n0\n0\n1\n1\n1\n0\n1\n0\n1\n1\n0\n1\n2\n2\n1\n2\n3\n0\n1\n1\n0\n0\n0\n1\n2\n0\n2\n2\n0\n1\n0\n4\n3\n4\n3\n1\n0\n1\n0\n0\n0\n2\n0\n0\n0\n0\n2\n0\n0\n3\n4\n0\n5\n0\n0\n0\n0\n1\n0\n1\n1\n0\n1\n1\n0\n0\n3\n0\n1\n0\n0\n1\n3\n0\n1\n4\n0\n0\n1\n3\n4\n3\n4\n0\n4\n0\n5\n6\n0\n0\n1\n0\n0\n0\n0\n0\n1\n0\n0\n1\n1\n2\n1\n0\n1\n1\n1\n1\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n4\n0\n1\n0\n0\n0\n4\n4\n1\n2\n0\n0\n0\n4\n0\n0\n0\n1\n1\n0\n1\n1\n0\n1\n0\n1\n1\n1\n0\n0\n0\n3\n0\n0\n1\n0\n3\n0\n5\n0\n0\n0\n5\n0\n0\n0\n1\n1\n1\n0\n0\n2\n0\n0\n0\n3\n0\n3\n2\n0\n2\n4\n0\n1\n0\n0\n0\n1\n1\n0\n0\n0\n2\n1\n1\n2\n1\n1\n0\n0\n0\n0\n0\n2\n1\n1\n0\n1\n0\n0\n3\n0\n0\n1\n0\n1\n3\n0\n1\n0\n1\n0\n0\n1\n0\n1\n1\n1\n0\n0\n1\n1\n1\n0\n2\n1\n0\n1\n0\n0\n0\n3\n0\n0\n2\n0\n0\n0\n2\n0\n1\n2\n0\n5\n5\n0\n0\n0\n2\n3\n1\n0\n4\n0\n0\n0\n0\n0\n0\n0\n1\n0\n6\n0\n0\n0\n5\n3\n0\n0\n6\n1\n0\n0\n3\n0\n0\n7\n0\n0\n3\n0\n1\n2\n2\n2\n0\n2\n0\n3\n3\n5\n0\n0\n0\n0\n3\n1\n7\n2\n0\n7\n7\n5\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n2\n2\n2\n4\n0\n3\n3\n0\n0\n2\n0\n0\n0\n2\n0\n1\n0\n1\n1\n0\n0\n0\n1\n1\n3\n4\n0\n0\n3\n0\n1\n0\n3\n0\n0\n0\n2\n0\n0\n0\n0\n1\n0\n3\n2\n0\n0\n3\n2\n0\n2\n6\n1\n0\n4\n0\n5\n0\n0\n0\n0\n4\n0\n10\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n5\n1\n0\n0\n0\n0\n0\n0\n2\n0\n0\n1\n2\n1\n2\n0\n1\n2\n0\n0\n0\n1\n0\n1\n1\n1\n1\n0\n1\n0\n2\n0\n5\n2\n5\n0\n0\n0\n5\n0\n0\n2\n0\n2\n2\n1\n0\n1\n0\n2\n1\n0\n0\n1\n0\n0\n0\n2\n3\n0\n3\n0\n0\n3\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n1\n0\n0\n0\n0\n3\n0\n1\n2\n1\n1\n5\n0\n1\n1\n0\n0\n0\n0\n1\n0\n0\n0\n2\n0\n4\n0\n0\n1\n3\n0\n2\n4\n4\n2\n0\n0\n2\n1\n0\n0\n0\n0\n0\n1\n1\n2\n0\n3\n1\n2\n2\n0\n0\n0\n2\n0\n0\n0\n1\n0\n0\n0\n4\n6\n0\n0\n0\n1\n0\n0\n1\n0\n1\n2\n0\n3\n0\n1\n0\n3\n1\n1\n0\n0\n0\n2\n2\n2\n1\n0\n0\n0\n1\n0\n0\n1\n0\n1\n0\n2\n2\n0\n1\n0\n0\n2\n0\n0\n2\n1\n0\n0\n1\n2\n3\n0\n0\n0\n0\n1\n0\n0\n0\n1\n1\n3\n0\n0\n0\n0\n0\n4\n1\n0\n0\n0\n1\n2\n3\n4\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n1\n0\n2\n0\n2\n0\n0\n0\n1\n0\n0\n0\n0\n0\n1\n2\n0\n1\n0\n0\n1\n0\n0\n2\n0\n1\n0\n4\n2\n1\n0\n0\n4\n4\n4\n0\n1\n0\n1\n0\n1\n1\n1\n1\n1\n1\n0\n1\n4\n0\n1\n1\n0\n0\n0\n0\n1\n0\n0\n3\n0\n0\n2\n3\n0\n1\n1\n0\n0\n0\n0\n2\n1\n1\n1\n2\n0\n1\n1\n1\n1\n0\n0\n2\n2\n0\n3\n1\n3\n0\n0\n0\n1\n0\n0\n0\n1\n0\n1\n1\n0\n0\n1\n1\n0\n1\n0\n0\n0\n1\n0\n2\n1\n3\n0\n0\n0\n0\n0\n1\n1\n1\n0\n1\n1\n0\n1\n0\n0\n0\n3\n5\n0\n3\n5\n1\n0\n1\n1\n0\n1\n1\n1\n1\n1\n0\n1\n0\n1\n1\n1\n1\n0\n3\n0\n1\n0\n1\n1\n0\n2\n1\n0\n4\n0\n0\n1\n5\n3\n0\n0\n3\n5\n7\n0\n2\n6\n4\n0\n0\n0\n0\n0\n1\n2\n0\n1\n3\n1\n0\n0\n0\n4\n0\n0\n0\n0\n0\n1\n0\n2\n2\n0\n0\n6\n2\n2\n0\n0\n0\n0\n0\n2\n0\n0\n1\n1\n0\n0\n0\n1\n0\n0\n0\n0\n2\n0\n2\n0\n0\n3\n5\n1\n3\n0\n3\n0\n1\n1\n6\n1\n0\n0\n8\n0\n1\n1\n1\n0\n0\n4\n1\n0\n3\n3\n2\n0\n0\n0\n0\n1\n1\n0\n1\n1\n0\n1\n0\n5\n2\n0\n0\n1\n2\n0\n0\n3\n0\n3\n0\n0\n0\n0\n3\n0\n3\n0\n5\n0\n4\n0\n0\n7\n5\n5\n0\n7\n0\n3\n0\n2\n0\n0\n0\n0\n0\n1\n6\n0\n0\n0\n0\n1\n1\n0\n1\n0\n0\n0\n1\n0\n0\n1\n1\n1\n0\n0\n2\n0\n0\n2\n1\n2\n3\n0\n3\n0\n1\n3\n0\n1\n1\n1\n0\n1\n0\n1\n2\n0\n0\n2\n1\n0\n2\n1\n2\n1\n0\n0\n0\n1\n0\n2\n3\n0\n0\n1\n3\n0\n0\n0\n0\n0\n2\n4\n0\n3\n4\n3\n0\n4\n0\n0\n0\n0\n3\n0\n2\n4\n2\n6\n0\n4\n2\n0\n0\n2\n1\n0\n0\n3\n0\n0\n0\n0\n0\n2\n0\n1\n2\n0\n3\n4\n3\n1\n0\n1\n0\n0\n0\n2\n1\n1\n0\n2\n1\n0\n0\n2\n2\n2\n1\n3\n2\n0\n0\n0\n1\n0\n1\n1\n0\n0\n1\n1\n0\n0\n0\n0\n3\n4\n3\n0\n1\n0\n3\n2\n3\n2\n0\n3\n3\n0\n3\n0\n0\n3\n3\n0\n5\n3\n7\n1\n3\n0\n6\n0\n6\n1\n2\n2\n4\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n1\n0\n0\n1\n1\n0\n1\n1\n1\n0\n0\n3\n1\n4\n1\n1\n1\n0\n5\n0\n3\n0\n0\n0\n2\n0\n0\n2\n2\n1\n0\n2\n0\n2\n2\n0\n0\n0\n0\n0\n2\n3\n1\n1\n1\n0\n0\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n1\n0\n4\n0\n0\n0\n1\n1\n0\n1\n0\n1\n1\n0\n1\n3\n1\n3\n0\n0\n0\n0\n0\n1\n0\n2\n0\n0\n2\n1\n0\n4\n0\n1\n1\n0\n0\n0\n0\n0\n2\n0\n4\n0\n2\n3\n1\n3\n3\n0\n0\n1\n1\n1\n1\n0\n0\n1\n1\n1\n7\n0\n1\n0\n0\n1\n1\n1\n1\n1\n1\n1\n2\n0\n0\n0\n0\n2\n1\n1\n0\n1\n1\n0\n0\n1\n1\n2\n0\n1\n1\n0\n3\n1\n1\n0\n1\n1\n0\n1\n0\n0\n0\n1\n2\n3\n1\n1\n0\n0\n0\n0\n1\n1\n0\n2\n1\n2\n0\n0\n2\n0\n2\n0\n0\n0\n0\n1\n0\n0\n3\n1\n0\n0\n0\n0\n2\n4\n1\n0\n4\n0\n0\n0\n0\n5\n1\n7\n0\n0\n3\n0\n0\n1\n1\n1\n0\n0\n0\n1\n1\n3\n0\n1\n0\n1\n3\n2\n2\n0\n1\n8\n5\n2\n0\n0\n4\n1\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n1\n0\n0\n1\n1\n1\n0\n0\n3\n0\n1\n2\n1\n0\n1\n3\n3\n3\n0\n2\n0\n0\n0\n0\n0\n0\n3\n0\n0\n1\n0\n0\n3\n2\n1\n0\n2\n0\n2\n0\n0\n0\n2\n4\n1\n2\n1\n0\n1\n1\n2\n1\n0\n1\n4\n0\n5\n0\n0\n2\n3\n0\n0\n0\n3\n3\n0\n2\n0\n0\n0\n2\n1\n2\n0\n0\n0\n4\n4\n2\n0\n1\n1\n0\n0\n1\n2\n3\n3\n0\n3\n0\n3\n0\n0\n2\n0\n2\n0\n0\n0\n5\n0\n0\n2\n1\n0\n0\n0\n0\n2\n1\n2\n2\n0\n0\n0\n0\n0\n1\n2\n1\n2\n1\n1\n1\n0\n1\n1\n0\n4\n0\n0\n0\n0\n1\n1\n0\n2\n0\n0\n0\n0\n1\n0\n3\n4\n0\n1\n0\n1\n0\n3\n3\n2\n0\n0\n0\n0\n1\n0\n1\n0\n1\n1\n0\n0\n5\n2\n0\n2\n2\n0\n1\n3\n0\n0\n0\n1\n2\n2\n3\n0\n0\n0\n1\n0\n0\n0\n1\n2\n0\n0\n0\n0\n0\n3\n0\n0\n6\n1\n1\n0\n0\n0\n0\n1\n0\n1\n0\n2\n1\n0\n1\n0\n0\n0\n2\n2\n2\n0\n0\n1\n0\n0\n1\n1\n1\n2\n1\n1\n2\n2\n2\n4\n0\n2\n7\n2\n2\n0\n1\n2\n0\n1\n2\n3\n2\n0\n0\n1\n0\n0\n0\n0\n0\n6\n1\n0\n0\n0\n1\n2\n2\n7\n0\n0\n1\n0\n1\n0\n1\n0\n0\n0\n0\n0\n0\n0\n3\n3\n2\n0\n1\n2\n1\n0\n4\n3\n0\n0\n0\n5\n0\n0\n0\n4\n3\n5\n2\n0\n0\n2\n0\n0\n0\n2\n0\n0\n1\n2\n0\n0\n0\n0\n0\n3\n0\n1\n0\n0\n2\n0\n0\n2\n0\n0\n1\n0\n0\n1\n3\n0\n3\n2\n0\n1\n1\n0\n1\n0\n0\n1\n0\n0\n0\n1\n0\n0\n3\n0\n2\n3\n2\n2\n0\n2\n0\n1\n1\n0\n1\n1\n0\n0\n2\n0\n1\n0\n0\n0\n0\n0\n0\n1\n1\n1\n0\n2\n0\n2\n0\n1\n0\n1\n1\n1\n0\n3\n0\n5\n0\n0\n0\n0\n6\n1\n0\n6\n0\n0\n0\n0\n7\n0\n1\n1\n0\n8\n9\n0\n0\n0\n0\n8\n3\n1\n1\n0\n2\n2\n1\n1\n0\n0\n0\n1\n6\n2\n0\n0\n0\n2\n0\n2\n3\n4\n0\n2\n0\n5\n0\n1\n0\n0\n0\n3\n1\n3\n3\n2\n2\n3\n2\n0\n2\n0\n1\n0\n1\n0\n0\n1\n1\n1\n1\n0\n2\n1\n0\n1\n0\n2\n0\n2\n3\n7\n4\n4\n4\n0\n0\n0\n0\n0\n0\n1\n1\n1\n2\n3\n1\n0\n0\n2\n2\n3\n1\n0\n2\n0\n2\n0\n3\n1\n0\n0\n4\n4\n0\n1\n5\n0\n0\n0\n0\n1\n0\n1\n1\n2\n1\n0\n0\n1\n0\n3\n2\n0\n0\n4\n4\n0\n0\n0\n1\n0\n3\n4\n0\n0\n0\n0\n0\n0\n0\n0\n5\n4\n0\n1\n0\n0\n1\n0\n1\n2\n1\n0\n3\n1\n5\n3\n1\n0\n0\n5\n0\n0\n3\n2\n0\n2\n0\n0\n0\n5\n5\n0\n0\n1\n0\n5\n0\n5\n0\n0\n5\n9\n0\n1\n5\n2\n0\n0\n5\n0\n0\n0\n4\n1\n0\n0\n0\n0\n1\n1\n1\n1\n2\n1\n1\n0\n0\n1\n0\n1\n0\n0\n1\n1\n0\n0\n1\n0\n2\n2\n2\n2\n0\n0\n0\n2\n2\n1\n1\n0\n2\n0\n0\n3\n0\n0\n0\n0\n0\n4\n1\n4\n0\n1\n1\n4\n1\n1\n0\n1\n0\n1\n0\n1\n1\n0\n0\n2\n4\n3\n2\n0\n0\n1\n0\n0\n0\n0\n0\n3\n5\n3\n2\n4\n4\n0\n0\n0\n0\n0\n0\n0\n0\n6\n2\n0\n2\n2\n3\n4\n4\n0\n0\n1\n0\n1\n0\n0\n0\n0\n0\n1\n1\n0\n1\n0\n0\n0\n1\n0\n0\n0\n1\n0\n0\n1\n1\n0\n0\n0\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n1\n3\n1\n2\n0\n0\n2\n0\n0\n1\n0\n1\n0\n0\n2\n1\n0\n0\n0\n0\n0\n4\n0\n0\n1\n0\n1\n0\n0\n2\n3\n4\n0\n1\n0\n0\n3\n0\n2\n0\n2\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n1\n0\n1\n0\n1\n0\n0\n0\n2\n2\n0\n2\n0\n2\n0\n3\n2\n0\n2\n0\n2\n2\n2\n0\n0\n0\n0\n1\n1\n1\n3\n1\n1\n0\n0\n1\n0\n1\n1\n0\n1\n2\n0\n0\n2\n4\n3\n4\n0\n1\n0\n0\n0\n3\n5\n0\n1\n1\n1\n1\n1\n1\n0\n0\n3\n0\n1\n1\n1\n1\n1\n0\n0\n0\n3\n2\n2\n0\n0\n0\n0\n2\n2\n1\n1\n1\n0\n2\n0\n0\n2\n0\n0\n0\n2\n0\n0\n2\n0\n2\n0\n0\n0\n0\n1\n1\n2\n2\n2\n2\n0\n0\n0\n0\n4\n4\n4\n4\n0\n1\n0\n0\n0\n0\n0\n0\n3\n0\n0\n5\n5\n0\n0\n3\n5\n1\n1\n1\n0\n0\n2\n0\n0\n4\n0\n4\n0\n0\n5\n1\n1\n0\n3\n0\n1\n0\n1\n0\n0\n1\n0\n0\n0\n0\n1\n6\n0\n1\n1\n5\n1\n1\n1\n2\n3\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n3\n1\n1\n0\n0\n3\n3\n3\n0\n1\n3\n0\n0\n1\n1\n0\n0\n0\n0\n2\n0\n0\n2\n0\n1\n0\n0\n1\n0\n0\n2\n4\n1\n1\n0\n3\n0\n0\n4\n3\n2\n3\n4\n4\n0\n0\n1\n0\n0\n2\n0\n0\n1\n1\n0\n0\n0\n2\n0\n0\n1\n1\n2\n0\n2\n0\n1\n1\n0\n0\n1\n0\n1\n1\n1\n1\n1\n0\n0\n0\n1\n1\n0\n1\n0\n1\n0\n0\n2\n0\n3\n0\n0\n3\n0\n1\n0\n1\n0\n0\n0\n0\n0\n1\n0\n0\n1\n0\n2\n1\n1\n0\n3\n0\n0\n0\n0\n3\n3\n0\n3\n0\n0\n0\n1\n2\n0\n0\n0\n1\n1\n0\n1\n1\n0\n1\n2\n0\n3\n1\n0\n1\n0\n1\n2\n2\n0\n0\n0\n2\n0\n2\n0\n0\n0\n0\n0\n0\n4\n3\n0\n0\n0\n0\n0\n4\n0\n1\n3\n3\n1\n1\n1\n0\n0\n0\n2\n0\n2\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n1\n1\n1\n2\n0\n1\n2\n1\n0\n0\n1\n3\n2\n0\n1\n2\n0\n2\n0\n0\n2\n0\n2\n0\n3\n1\n2\n2\n1\n4\n0\n0\n0\n0\n0\n5\n0\n3\n3\n0\n8\n0\n0\n1\n2\n0\n0\n0\n0\n0\n2\n3\n2\n0\n4\n4\n0\n0\n1\n1\n1\n0\n0\n0\n2\n2\n2\n3\n3\n0\n0\n0\n0\n2\n0\n4\n0\n3\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n1\n0\n1\n1\n0\n0\n0\n0\n2\n3\n4\n4\n2\n0\n1\n0\n0\n1\n1\n0\n0\n1\n2\n1\n1\n1\n4\n0\n4\n3\n3\n1\n2\n0\n1\n0\n0\n2\n0\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n2\n0\n0\n2\n1\n3\n0\n2\n0\n1\n0\n1\n0\n0\n0\n0\n2\n2\n5\n0\n0\n1\n0\n0\n0\n1\n3\n3\n1\n0\n0\n0\n1\n1\n1\n3\n0\n2\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n2\n2\n0\n2\n1\n0\n3\n3\n3\n1\n0\n1\n0\n0\n0\n0\n0\n2\n0\n2\n0\n0\n0\n0\n2\n0\n1\n2\n0\n2\n0\n0\n1\n0\n1\n0\n1\n5\n1\n0\n0\n0\n1\n0\n6\n0\n1\n0\n0\n0\n1\n0\n3\n0\n0\n3\n3\n3\n0\n4\n4\n0\n1\n1\n1\n0\n1\n1\n0\n0\n1\n0\n0\n1\n0\n2\n0\n0\n0\n0\n2\n0\n1\n2\n2\n0\n0\n0\n0\n0\n5\n0\n3\n0\n0\n0\n8\n0\n8\n7\n1\n0\n1\n1\n1\n0\n0\n1\n1\n0\n0\n2\n2\n1\n4\n4\n0\n4\n0\n4\n5\n0\n0\n0\n0\n6\n0\n0\n4\n1\n0\n7\n5\n4\n1\n1\n0\n0\n0\n5\n0\n0\n1\n1\n0\n0\n1\n0\n0\n1\n2\n4\n0\n0\n1\n0\n1\n0\n1\n1\n0\n1\n3\n1\n3\n0\n0\n1\n2\n0\n2\n0\n1\n1\n1\n2\n0\n0\n0\n0\n1\n1\n0\n1\n1\n0\n0\n2\n2\n2\n0\n1\n0\n0\n1\n1\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n1\n1\n1\n0\n0\n0\n1\n0\n2\n0\n4\n1\n1\n0\n0\n0\n0\n0\n1\n1\n0\n4\n0\n3\n0\n5\n3\n0\n0\n2\n2\n0\n5\n0\n0\n0\n0\n0\n0\n0\n2\n0\n1\n0\n1\n0\n1\n0\n0\n0\n0\n4\n3\n1\n3\n1\n0\n2\n0\n2\n0\n0\n0\n0\n0\n2\n0\n0\n4\n1\n3\n0\n1\n2\n1\n2\n0\n0\n2\n0\n2\n0\n0\n3\n3\n0\n0\n1\n1\n1\n2\n1\n2\n2\n2\n0\n1\n4\n4\n0\n3\n0\n2\n6\n7\n1\n7\n4\n0\n4\n3\n0\n1\n0\n2\n1\n2\n0\n0\n3\n0\n0\n1\n0\n2\n4\n2\n2\n7\n0\n0\n1\n2\n0\n1\n5\n3\n0\n0\n2\n2\n0\n4\n5\n15\n0\n1\n3\n0\n0\n3\n2\n1\n1\n0\n0\n1\n0\n1\n0\n0\n1\n0\n1\n1\n1\n0\n1\n0\n1\n1\n1\n1\n1\n1\n1\n1\n1\n3\n4\n4\n0\n0\n2\n0\n0\n2\n2\n0\n0\n1\n0\n1\n1\n0\n1\n0\n1\n5\n1\n0\n0\n1\n0\n1\n3\n0\n2\n6\n0\n1\n2\n2\n0\n0\n2\n0\n1\n2\n0\n0\n0\n4\n3\n3\n0\n0\n2\n0\n1\n0\n5\n1\n1\n5\n0\n1\n1\n1\n1\n0\n0\n0\n1\n1\n1\n1\n1\n0\n0\n0\n3\n2\n2\n1\n5\n2\n0\n1\n0\n0\n0\n0\n1\n1\n2\n0\n0\n3\n0\n1\n2\n2\n2\n2\n0\n1\n0\n0\n2\n0\n0\n0\n0\n0\n1\n1\n0\n0\n1\n0\n0\n0\n0\n0\n2\n2\n1\n3\n0\n3\n0\n0\n1\n0\n0\n0\n0\n3\n3\n4\n0\n5\n1\n0\n0\n7\n0\n0\n2\n1\n0\n1\n0\n0\n0\n0\n1\n1\n1\n0\n1\n0\n2\n0\n0\n0\n2\n1\n0\n0\n1\n0\n1\n1\n1\n2\n2\n2\n0\n2\n1\n0\n2\n1\n1\n1\n1\n4\n0\n0\n0\n1\n0\n2\n0\n0\n0\n2\n0\n0\n2\n3\n3\n0\n0\n2\n1\n1\n2\n1\n1\n1\n0\n4\n2\n0\n1\n0\n1\n0\n3\n0\n0\n1\n3\n2\n0\n2\n0\n2\n4\n2\n1\n1\n1\n1\n0\n1\n1\n0\n0\n1\n3\n2\n0\n2\n2\n1\n0\n0\n0\n3\n0\n3\n1\n0\n2\n2\n0\n1\n2\n2\n0\n1\n2\n3\n0\n4\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n1\n1\n3\n0\n2\n0\n2\n0\n1\n0\n2\n0\n1\n2\n0\n0\n0\n0\n1\n2\n2\n1\n0\n2\n1\n2\n0\n2\n0\n0\n3\n3\n3\n0\n5\n0\n1\n2\n4\n4\n0\n1\n0\n1\n3\n0\n4\n4\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n1\n1\n0\n1\n0\n0\n0\n2\n0\n1\n0\n0\n0\n0\n1\n1\n0\n0\n0\n0\n1\n1\n0\n0\n0\n2\n2\n1\n1\n1\n1\n2\n2\n2\n1\n3\n1\n0\n2\n2\n3\n2\n0\n0\n1\n0\n1\n0\n0\n1\n0\n1\n0\n0\n0\n0\n0\n0\n2\n0\n4\n0\n3\n0\n1\n1\n0\n0\n0\n0\n3\n0\n1\n1\n0\n0\n0\n0\n0\n2\n3\n0\n1\n1\n0\n0\n0\n0\n2\n0\n1\n1\n0\n0\n1\n0\n0\n0\n0\n1\n1\n0\n0\n0\n0\n0\n1\n2\n0\n0\n0\n1\n0\n1\n0\n1\n0\n1\n0\n0\n0\n2\n1\n3\n0\n2\n4\n3\n4\n4\n6\n6\n1\n0\n6\n5\n0\n5\n1\n1\n0\n1\n0\n2\n2\n0\n0\n0\n1\n1\n0\n0\n2\n0\n1\n0\n2\n1\n0\n1\n1\n1\n1\n0\n0\n0\n2\n1\n0\n0\n1\n0\n1\n1\n2\n0\n1\n3\n2\n0\n0\n2\n1\n0\n0\n2\n3\n1\n0\n5\n2\n2\n0\n3\n2\n1\n4\n3\n4\n0\n0\n3\n0\n2\n0\n0\n0\n1\n0\n0\n0\n0\n0\n4\n0\n3\n4\n0\n0\n4\n0\n4\n1\n1\n5\n1\n0\n2\n0\n0\n0\n3\n0\n0\n1\n2\n1\n0\n8\n9\n1\n1\n1\n1\n0\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n2\n0\n2\n0\n0\n0\n1\n0\n2\n2\n0\n1\n0\n0\n2\n0\n2\n1\n2\n0\n3\n0\n0\n1\n1\n2\n1\n0\n0\n3\n3\n0\n0\n0\n0\n4\n0\n3\n0\n0\n0\n1\n0\n0\n0\n1\n1\n0\n1\n0\n0\n1\n1\n1\n1\n2\n0\n0\n3\n0\n1\n0\n0\n0\n0\n0\n0\n1\n0\n3\n1\n1\n2\n0\n0\n0\n0\n3\n0\n0\n0\n0\n1\n1\n0\n0\n3\n1\n1\n1\n0\n0\n0\n0\n0\n0\n0\n4\n4\n0\n1\n1\n0\n0\n2\n0\n3\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n0\n2\n1\n0\n0\n1\n1\n1\n1\n0\n2\n0\n1\n0\n1\n2\n0\n3\n0\n1\n0\n1\n1\n0\n1\n1\n0\n0\n1\n1\n0\n1\n0\n0\n1\n1\n1\n2\n2\n1\n0\n0\n1\n1\n1\n0\n6\n0\n2\n0\n1\n0\n0\n0\n2\n2\n4\n2\n1\n1\n0\n1\n0\n0\n1\n1\n0\n0\n3\n0\n0\n1\n1\n0\n1\n1\n1\n0\n0\n1\n1\n1\n0\n1\n0\n0\n0\n3\n0\n1\n0\n2\n1\n2\n0\n0\n0\n0\n2\n2\n1\n0\n2\n2\n2\n0\n4\n0\n0\n4\n0\n3\n1\n0\n0\n1\n0\n0\n1\n0\n0\n1\n1\n0\n0\n1\n0\n0\n2\n2\n0\n1\n1\n0\n1\n1\n0\n1\n2\n0\n0\n5\n3\n0\n4\n0\n1\n3\n5\n0\n0\n2\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n4\n0\n3\n0\n2\n0\n2\n0\n1\n0\n1\n0\n0\n0\n2\n2\n0\n0\n2\n0\n2\n3\n0\n0\n0\n0\n0\n1\n0\n1\n2\n2\n2\n1\n2\n2\n0\n0\n4\n2\n1\n3\n0\n3\n0\n0\n0\n0\n0\n5\n0\n2\n5\n4\n0\n5\n6\n1\n1\n1\n2\n2\n0\n1\n3\n0\n1\n1\n0\n0\n1\n1\n0\n0\n0\n2\n0\n2\n2\n1\n1\n0\n1\n0\n1\n0\n0\n1\n0\n2\n0\n2\n0\n2\n0\n2\n0\n2\n3\n0\n3\n0\n0\n3\n3\n1\n0\n0\n0\n0\n1\n0\n0\n0\n1\n0\n1\n1\n1\n0\n1\n1\n1\n1\n0\n2\n0\n2\n2\n0\n0\n0\n0\n0\n2\n3\n3\n0\n0\n2\n7\n6\n1\n1\n0\n1\n0\n1\n1\n1\n1\n0\n0\n6\n0\n0\n1\n1\n0\n0\n1\n8\n1\n1\n0\n2\n2\n1\n0\n0\n4\n0\n1\n2\n0\n0\n1\n0\n0\n0\n4\n1\n3\n1\n2\n1\n1\n2\n3\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n1\n1\n0\n1\n0\n7\n0\n2\n0\n10\n0\n0\n0\n0\n2\n2\n0\n1\n0\n0\n1\n0\n1\n0\n0\n2\n0\n0\n3\n2\n0\n0\n0\n0\n1\n0\n0\n1\n0\n7\n1\n0\n0\n2\n1\n1\n0\n0\n0\n3\n3\n0\n3\n0\n0\n1\n0\n0\n6\n0\n0\n6\n4\n3\n0\n0\n8\n0\n3\n3\n0\n3\n0\n3\n4\n6\n8\n0\n0\n0\n0\n0\n5\n0\n0\n2\n0\n0\n2\n0\n0\n2\n0\n1\n3\n4\n3\n0\n0\n0\n1\n1\n0\n0\n0\n1\n1\n1\n3\n0\n0\n2\n0\n2\n1\n2\n0\n0\n1\n0\n0\n0\n1\n1\n1\n0\n1\n1\n1\n1\n1\n0\n2\n0\n1\n1\n0\n3\n2\n1\n0\n1\n0\n0\n0\n2\n0\n3\n0\n2\n0\n2\n0\n0\n2\n1\n1\n0\n0\n2\n0\n1\n4\n0\n1\n0\n1\n1\n1\n1\n1\n0\n0\n0\n0\n1\n0\n0\n1\n1\n0\n1\n3\n0\n0\n0\n4\n0\n4\n0\n5\n0\n0\n1\n5\n0\n0\n1\n0\n0\n0\n0\n5\n0\n0\n5\n0\n5\n3\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n1\n2\n1\n0\n0\n0\n1\n4\n2\n1\n0\n1\n2\n0\n1\n1\n1\n1\n0\n0\n0\n1\n1\n0\n1\n2\n0\n0\n0\n0\n1\n0\n1\n2\n0\n0\n0\n0\n1\n1\n1\n0\n2\n0\n0\n0\n0\n3\n2\n4\n4\n0\n0\n0\n0\n3\n9\n0\n0\n0\n6\n2\n2\n2\n1\n0\n1\n1\n0\n1\n0\n1\n1\n0\n1\n0\n2\n0\n0\n0\n2\n3\n0\n2\n3\n0\n2\n3\n1\n0\n1\n0\n0\n1\n0\n0\n0\n2\n0\n1\n1\n0\n1\n1\n0\n1\n1\n5\n0\n1\n0\n1\n1\n0\n0\n0\n0\n1\n1\n0\n1\n1\n0\n2\n2\n1\n0\n0\n1\n1\n0\n0\n0\n0\n4\n0\n0\n0\n7\n0\n4\n0\n0\n9\n0\n0\n2\n0\n1\n1\n1\n0\n0\n1\n1\n0\n0\n0\n0\n0\n1\n1\n0\n1\n1\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n1\n1\n1\n1\n1\n0\n1\n2\n0\n2\n0\n0\n0\n0\n2\n1\n1\n1\n1\n1\n1\n1\n1\n0\n3\n0\n1\n0\n0\n2\n2\n0\n0\n0\n2\n3\n0\n3\n0\n0\n1\n0\n0\n1\n2\n1\n2\n1\n0\n1\n0\n2\n2\n1\n0\n1\n0\n1\n1\n1\n0\n1\n1\n0\n2\n0\n1\n1\n1\n2\n1\n0\n0\n0\n0\n2\n0\n1\n0\n0\n0\n1\n1\n1\n0\n0\n1\n0\n1\n0\n2\n0\n0\n3\n0\n5\n1\n6\n5\n0\n0\n0\n0\n5\n1\n0\n3\n2\n0\n2\n1\n0\n0\n2\n3\n3\n3\n1\n0\n0\n0\n1\n1\n1\n0\n1\n1\n0\n1\n1\n0\n0\n3\n3\n0\n0\n0\n2\n0\n0\n0\n0\n2\n2\n3\n2\n3\n0\n0\n0\n1\n1\n0\n2\n0\n0\n0\n1\n0\n1\n2\n0\n2\n0\n0\n1\n0\n0\n1\n0\n1\n0\n2\n1\n1\n1\n3\n0\n0\n0\n1\n4\n0\n2\n0\n1\n0\n1\n1\n0\n1\n1\n0\n1\n1\n2\n2\n1\n3\n0\n2\n1\n0\n0\n3\n4\n1\n1\n1\n0\n2\n3\n2\n4\n0\n0\n1\n0\n0\n2\n2\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n1\n1\n1\n1\n0\n1\n0\n0\n1\n1\n1\n1\n1\n1\n2\n0\n0\n0\n1\n0\n0\n0\n1\n1\n0\n0\n1\n1\n0\n0\n1\n2\n2\n3\n0\n0\n2\n1\n0\n0\n1\n0\n3\n3\n0\n0\n1\n0\n3\n5\n0\n5\n2\n0\n0\n2\n3\n3\n3\n0\n1\n1\n1\n0\n0\n1\n0\n4\n4\n4\n0\n7\n2\n1\n3\n1\n3\n1\n2\n0\n0\n0\n0\n1\n0\n1\n0\n1\n1\n1\n2\n0\n0\n0\n2\n0\n0\n1\n0\n1\n1\n4\n0\n0\n0\n0\n1\n5\n0\n2\n0\n0\n2\n0\n2\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n1\n0\n0\n1\n0\n0\n1\n0\n2\n1\n0\n0\n0\n0\n1\n1\n0\n1\n1\n1\n0\n4\n0\n0\n3\n0\n1\n0\n0\n1\n0\n1\n1\n3\n0\n0\n1\n0\n0\n0\n0\n2\n1\n0\n2\n2\n0\n0\n2\n0\n0\n0\n0\n4\n4\n3\n1\n1\n1\n1\n1\n1\n1\n0\n0\n1\n1\n1\n2\n0\n0\n0\n0\n0\n4\n0\n0\n2\n2\n2\n0\n0\n1\n1\n1\n2\n0\n4\n0\n0\n0\n0\n2\n0\n0\n1\n0\n0\n2\n1\n2\n0\n4\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n3\n3\n2\n3\n2\n2\n0\n2\n1\n0\n1\n1\n1\n2\n0\n2\n0\n1\n0\n0\n1\n0\n1\n0\n1\n0\n2\n1\n0\n3\n4\n1\n0\n1\n0\n0\n0\n0\n0\n2\n0\n0\n3\n0\n4\n0\n1\n3\n0\n1\n0\n0\n1\n1\n1\n1\n1\n2\n1\n0\n2\n3\n0\n0\n0\n1\n3\n0\n0\n0\n4\n4\n0\n3\n0\n0\n0\n5\n0\n1\n0\n0\n0\n0\n1\n0\n1\n0\n2\n0\n0\n0\n2\n2\n2\n3\n7\n0\n1\n0\n0\n0\n0\n0\n0\n2\n0\n1\n1\n1\n0\n0\n1\n0\n3\n0\n0\n1\n1\n1\n0\n1\n0\n0\n1\n0\n1\n1\n0\n0\n1\n0\n0\n0\n4\n2\n3\n0\n0\n3\n0\n0\n0\n0\n0\n1\n5\n0\n0\n1\n0\n1\n0\n0\n0\n0\n1\n2\n2\n0\n1\n0\n2\n1\n0\n0\n2\n1\n0\n0\n4\n0\n0\n7\n0\n1\n0\n0\n0\n1\n2\n0\n3\n0\n0\n1\n5\n0\n2\n0\n3\n5\n1\n1\n1\n0\n1\n0\n1\n0\n0\n1\n2\n1\n2\n1\n2\n0\n0\n0\n1\n0\n4\n0\n2\n0\n0\n1\n5\n0\n0\n1\n0\n0\n1\n1\n0\n2\n1\n1\n2\n2\n0\n3\n4\n0\n1\n0\n0\n0\n1\n0\n0\n2\n1\n0\n0\n1\n1\n1\n1\n0\n0\n1\n0\n0\n0\n0\n4\n0\n0\n0\n2\n0\n2\n2\n3\n1\n0\n0\n0\n1\n0\n5\n2\n2\n2\n2\n1\n0\n2\n0\n0\n1\n0\n1\n2\n2\n1\n0\n0\n1\n2\n0\n0\n1\n4\n2\n0\n0\n4\n0\n0\n1\n3\n0\n1\n0\n4\n0\n0\n6\n9\n1\n0\n0\n1\n1\n2\n0\n0\n3\n0\n0\n1\n3\n1\n0\n1\n0\n0\n1\n0\n0\n1\n1\n2\n0\n4\n3\n4\n0\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n2\n0\n3\n0\n0\n3\n0\n2\n1\n1\n1\n0\n1\n0\n0\n0\n0\n0\n0\n0\n1\n1\n2\n0\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n1\n0\n1\n0\n0\n0\n1\n1\n2\n2\n1\n2\n1\n0\n0\n0\n0\n2\n1\n0\n2\n1\n0\n0\n0\n0\n0\n3\n0\n1\n0\n1\n1\n0\n3\n2\n0\n0\n0\n1\n0\n0\n2\n5\n2\n0\n5\n0\n3\n0\n0\n1\n1\n0\n1\n1\n0\n2\n0\n0\n0\n0\n0\n1\n0\n1\n0\n2\n0\n0\n0\n0\n0\n3\n1\n0\n0\n2\n0\n2\n1\n0\n1\n0\n0\n2\n0\n0\n0\n3\n3\n2\n3\n0\n1\n0\n0\n1\n0\n2\n1\n2\n3\n1\n1\n4\n5\n0\n1\n2\n0\n0\n1\n0\n5\n1\n0\n1\n0\n3\n2\n2\n0\n0\n2\n0\n3\n3\n0\n0\n0\n2\n0\n0\n0\n4\n5\n5\n5\n0\n5\n0\n0\n1\n1\n0\n2\n0\n0\n1\n1\n0\n1\n1\n0\n2\n3\n4\n0\n3\n0\n0\n0\n2\n3\n0\n5\n3\n0\n0\n5\n1\n7\n6\n0\n0\n1\n9\n0\n0\n11\n0\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n3\n0\n1\n2\n0\n0\n4\n2\n0\n0\n5\n0\n0\n2\n0\n2\n5\n1\n1\n1\n0\n0\n0\n0\n1\n0\n0\n1\n1\n1\n0\n0\n0\n2\n1\n0\n1\n1\n2\n0\n0\n1\n1\n0\n0\n0\n0\n0\n1\n2\n0\n0\n0\n2\n0\n0\n0\n1\n0\n2\n2\n2\n0\n0\n1\n3\n0\n0\n0\n1\n0\n0\n2\n0\n1\n2\n0\n0\n3\n2\n0\n1\n0\n1\n2\n0\n3\n1\n0\n1\n0\n3\n0\n0\n0\n0\n1\n0\n2\n3\n2\n0\n0\n0\n2\n0\n1\n0\n0\n0\n0\n0\n3\n3\n3\n0\n2\n0\n2\n5\n0\n0\n2\n0\n0\n0\n0\n0\n0\n3\n0\n0\n0\n1\n1\n1\n0\n1\n1\n3\n0\n2\n1\n1\n1\n0\n2\n0\n3\n0\n2\n0\n1\n1\n5\n1\n1\n1\n0\n0\n1\n1\n0\n2\n0\n0\n0\n3\n3\n4\n0\n0\n0\n4\n0\n0\n1\n4\n0\n0\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n2\n0\n1\n0\n2\n0\n3\n0\n0\n1\n4\n2\n0\n2\n0\n3\n0\n0\n2\n3\n0\n4\n1\n0\n0\n1\n0\n2\n0\n2\n1\n0\n1\n1\n1\n2\n2\n0\n3\n0\n2\n1\n4\n3\n0\n0\n0\n0\n1\n1\n1\n0\n3\n0\n2\n2\n3\n2\n0\n0\n0\n0\n0\n0\n0\n0\n2\n4\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n2\n2\n0\n1\n1\n1\n0\n0\n0\n0\n1\n1\n1\n0\n1\n0\n0\n1\n2\n0\n0\n0\n3\n0\n3\n0\n2\n1\n1\n0\n4\n1\n0\n1\n1\n0\n2\n0\n4\n1\n2\n0\n0\n3\n7\n0\n5\n2\n0\n0\n1\n1\n1\n1\n1\n0\n1\n1\n0\n0\n0\n1\n0\n1\n2\n1\n2\n0\n2\n0\n0\n0\n3\n0\n0\n0\n4\n0\n0\n2\n0\n2\n2\n5\n2\n0\n1\n2\n3\n2\n0\n0\n0\n1\n0\n2\n3\n4\n2\n1\n3\n0\n1\n4\n1\n1\n0\n0\n3\n4\n0\n0\n3\n4\n0\n1\n2\n1\n2\n1\n0\n2\n0\n0\n6\n0\n0\n1\n0\n0\n2\n1\n2\n3\n1\n0\n0\n0\n1\n1\n0\n0\n0\n3\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n1\n1\n1\n1\n0\n1\n3\n0\n1\n1\n0\n0\n0\n1\n1\n1\n1\n2\n2\n1\n0\n1\n0\n0\n0\n0\n1\n0\n2\n0\n2\n0\n2\n2\n1\n1\n0\n1\n0\n0\n3\n0\n1\n1\n1\n0\n2\n0\n1\n0\n0\n0\n0\n2\n1\n0\n1\n0\n2\n1\n0\n1\n0\n0\n0\n1\n0\n0\n0\n0\n3\n3\n0\n2\n0\n2\n1\n0\n2\n0\n4\n4\n2\n4\n0\n6\n4\n4\n5\n3\n0\n0\n1\n0\n0\n1\n0\n0\n0\n2\n0\n2\n0\n1\n2\n1\n1\n0\n0\n0\n0\n1\n1\n0\n0\n1\n2\n3\n1\n3\n4\n0\n0\n0\n0\n0\n0\n0\n1\n0\n2\n0\n2\n0\n1\n1\n0\n2\n0\n0\n3\n0\n2\n0\n0\n2\n5\n2\n3\n0\n0\n0\n0\n0\n0\n0\n3\n3\n0\n1\n4\n0\n1\n0\n2\n0\n1\n3\n2\n1\n0\n2\n3\n3\n1\n1\n3\n0\n0\n2\n0\n0\n0\n3\n3\n0\n0\n0\n0\n2\n0\n0\n0\n1\n0\n1\n1\n0\n1\n1\n4\n4\n4\n0\n1\n1\n0\n0\n0\n0\n0\n1\n0\n0\n0\n1\n2\n3\n2\n0\n0\n2\n2\n2\n2\n2\n2\n0\n2\n0\n1\n0\n2\n0\n2\n3\n3\n3\n4\n0\n0\n3\n0\n0\n2\n0\n0\n1\n0\n0\n1\n3\n0\n0\n2\n0\n1\n1\n0\n3\n1\n1\n2\n1\n2\n0\n0\n2\n4\n3\n1\n1\n0\n1\n0\n1\n2\n1\n1\n0\n3\n0\n7\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n2\n5\n0\n0\n5\n0\n1\n0\n0\n2\n2\n0\n0\n3\n0\n0\n9\n2\n0\n4\n2\n1\n1\n0\n1\n3\n0\n0\n1\n0\n1\n0\n1\n2\n0\n0\n2\n0\n3\n3\n1\n0\n0\n0\n0\n0\n0\n0\n0\n3\n0\n1\n1\n0\n0\n2\n0\n0\n0\n0\n1\n0\n0\n1\n0\n2\n2\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n2\n1\n0\n0\n2\n0\n1\n0\n0\n0\n0\n0\n1\n1\n1\n1\n0\n0\n2\n2\n0\n0\n0\n0\n2\n0\n3\n0\n0\n1\n1\n2\n0\n1\n0\n0\n0\n0\n3\n0\n1\n0\n1\n1\n1\n3\n1\n2\n0\n3\n2\n0\n6\n6\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n0\n0\n1\n3\n0\n0\n0\n0\n0\n1\n1\n2\n0\n0\n0\n0\n2\n0\n0\n1\n1\n0\n0\n1\n3\n1\n1\n1\n2\n0\n3\n0\n0\n0\n0\n0\n1\n1\n1\n0\n0\n2\n0\n0\n3\n0\n2\n0\n1\n0\n0\n3\n0\n0\n0\n0\n1\n0\n0\n0\n0\n2\n3\n0\n0\n0\n0\n2\n0\n2\n0\n0\n0\n0\n0\n0\n6\n0\n0\n0\n0\n6\n0\n0\n8\n9\n2\n8\n11\n0\n11\n0\n0\n2\n0\n1\n1\n0\n0\n0\n0\n0\n0\n3\n0\n0\n0\n4\n2\n0\n1\n1\n1\n1\n1\n1\n0\n1\n1\n0\n1\n0\n1\n0\n0\n0\n1\n0\n0\n0\n4\n0\n0\n0\n1\n0\n1\n0\n1\n0\n0\n0\n1\n1\n0\n0\n0\n1\n0\n2\n0\n1\n0\n6\n3\n0\n0\n1\n1\n0\n0\n0\n0\n1\n0\n1\n1\n2\n1\n0\n0\n1\n2\n0\n1\n3\n1\n3\n1\n1\n2\n2\n1\n2\n0\n1\n0\n0\n1\n0\n0\n1\n0\n3\n0\n2\n2\n0\n0\n0\n1\n1\n0\n0\n0\n1\n2\n0\n1\n1\n1\n2\n2\n2\n0\n1\n1\n1\n0\n0\n4\n0\n0\n2\n1\n0\n0\n0\n4\n0\n2\n0\n0\n4\n0\n0\n3\n2\n1\n3\n3\n0\n0\n1\n0\n2\n0\n0\n4\n2\n1\n2\n0\n1\n1\n0\n9\n3\n1\n0\n0\n1\n1\n0\n1\n0\n2\n0\n0\n3\n0\n0\n3\n0\n0\n0\n2\n1\n0\n0\n2\n1\n0\n4\n0\n0\n0\n1\n3\n1\n4\n5\n1\n0\n2\n0\n2\n0\n0\n0\n3\n1\n1\n0\n0\n1\n0\n1\n0\n1\n1\n0\n0\n0\n0\n0\n1\n2\n0\n1\n0\n0\n1\n1\n0\n0\n0\n0\n0\n2\n0\n4\n0\n2\n0\n0\n0\n2\n0\n0\n2\n4\n2\n1\n0\n2\n2\n0\n0\n2\n1\n7\n2\n0\n1\n1\n2\n1\n1\n1\n1\n1\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n4\n4\n1\n4\n1\n0\n0\n0\n1\n4\n1\n0\n5\n2\n1\n2\n0\n0\n0\n2\n2\n0\n0\n1\n1\n0\n2\n0\n0\n3\n1\n1\n1\n1\n0\n0\n1\n1\n0\n1\n0\n1\n0\n0\n1\n1\n1\n0\n1\n0\n0\n0\n0\n4\n3\n2\n6\n7\n0\n0\n1\n2\n1\n0\n1\n1\n1\n0\n0\n0\n1\n0\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n1\n1\n2\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n0\n0\n0\n1\n0\n3\n2\n5\n0\n0\n0\n0\n2\n0\n0\n6\n7\n2\n4\n1\n0\n1\n3\n2\n3\n0\n0\n0\n1\n0\n0\n2\n2\n0\n1\n1\n1\n0\n0\n1\n6\n0\n2\n1\n3\n2\n1\n0\n1\n0\n1\n0\n0\n1\n0\n2\n0\n0\n0\n2\n0\n2\n2\n1\n2\n1\n1\n0\n2\n0\n0\n0\n0\n2\n0\n1\n0\n0\n2\n2\n1\n0\n2\n0\n1\n0\n0\n1\n1\n1\n0\n0\n1\n1\n0\n0\n3\n0\n2\n0\n4\n0\n1\n0\n1\n1\n0\n1\n0\n2\n2\n4\n7\n1\n0\n0\n1\n2\n1\n0\n2\n2\n0\n2\n3\n2\n4\n1\n7\n0\n1\n0\n0\n2\n0\n3\n3\n0\n5\n5\n5\n1\n5\n0\n0\n1\n1\n2\n0\n2\n1\n0\n1\n1\n1\n1\n0\n1\n2\n2\n0\n2\n0\n1\n1\n0\n1\n0\n2\n2\n2\n0\n2\n0\n1\n2\n0\n1\n0\n2\n0\n0\n0\n1\n0\n4\n1\n5\n0\n0\n1\n0\n2\n0\n0\n6\n1\n0\n1\n1\n1\n1\n0\n0\n3\n1\n0\n1\n0\n0\n2\n1\n1\n0\n5\n0\n0\n3\n2\n0\n1\n3\n0\n2\n0\n3\n0\n4\n0\n4\n0\n0\n6\n3\n0\n4\n2\n0\n3\n0\n2\n0\n2\n3\n0\n2\n0\n1\n0\n0\n0\n0\n1\n2\n0\n0\n1\n2\n2\n3\n1\n0\n0\n0\n0\n2\n0\n3\n5\n0\n0\n0\n5\n5\n0\n0\n0\n3\n0\n0\n2\n0\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n1\n0\n1\n0\n2\n0\n1\n0\n0\n1\n0\n0\n2\n7\n1\n0\n1\n2\n2\n2\n3\n1\n1\n1\n0\n1\n0\n0\n5\n0\n1\n0\n2\n0\n6\n8\n3\n0\n1\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n0\n0\n2\n1\n0\n1\n2\n1\n0\n1\n0\n0\n0\n0\n2\n3\n0\n1\n0\n0\n4\n0\n0\n0\n1\n4\n5\n0\n6\n0\n0\n0\n7\n1\n3\n0\n4\n2\n0\n0\n0\n8\n6\n0\n0\n7\n0\n0\n0\n0\n5\n14\n0\n0\n0\n0\n1\n0\n3\n0\n0\n0\n2\n0\n0\n1\n3\n2\n0\n0\n0\n0\n0\n1\n0\n1\n1\n3\n1\n1\n0\n1\n2\n2\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n4\n0\n0\n0\n0\n1\n3\n0\n0\n0\n0\n0\n2\n1\n1\n1\n0\n0\n0\n1\n1\n1\n0\n2\n0\n1\n0\n2\n0\n1\n1\n2\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n1\n3\n0\n0\n0\n5\n3\n0\n0\n0\n0\n5\n0\n6\n0\n0\n7\n3\n0\n0\n5\n5\n0\n0\n0\n1\n1\n1\n2\n1\n0\n0\n2\n4\n2\n0\n5\n0\n0\n1\n2\n0\n0\n3\n0\n1\n0\n0\n1\n0\n0\n1\n0\n0\n2\n0\n1\n0\n0\n0\n1\n1\n1\n1\n1\n1\n1\n1\n1\n0\n4\n0\n1\n3\n0\n3\n4\n4\n4\n0\n0\n1\n4\n2\n0\n0\n1\n0\n0\n0\n4\n0\n1\n2\n5\n5\n3\n6\n0\n0\n0\n2\n1\n4\n10\n6\n0\n0\n0\n1\n1\n0\n0\n12\n0\n0\n1\n0\n1\n1\n0\n0\n1\n0\n0\n4\n2\n0\n0\n1\n1\n5\n0\n4\n6\n4\n1\n1\n0\n1\n1\n0\n0\n1\n0\n2\n0\n0\n1\n3\n0\n0\n0\n1\n1\n1\n2\n0\n1\n1\n1\n0\n1\n0\n0\n2\n0\n2\n0\n1\n1\n0\n1\n3\n0\n0\n1\n0\n0\n2\n1\n0\n0\n0\n3\n0\n1\n1\n0\n0\n0\n1\n1\n0\n0\n1\n0\n1\n1\n0\n3\n0\n1\n1\n1\n0\n3\n0\n2\n0\n2\n0\n0\n1\n2\n1\n0\n1\n0\n0\n2\n0\n2\n0\n6\n0\n5\n4\n0\n1\n0\n8\n0\n4\n1\n4\n0\n0\n0\n0\n0\n0\n4\n2\n1\n0\n1\n2\n1\n2\n2\n0\n1\n0\n1\n0\n0\n1\n2\n0\n0\n0\n0\n3\n2\n1\n0\n0\n0\n1\n0\n1\n1\n0\n0\n3\n0\n0\n1\n3\n3\n3\n0\n0\n0\n0\n0\n1\n0\n0\n2\n0\n3\n1\n1\n0\n1\n0\n0\n1\n0\n0\n0\n1\n0\n0\n1\n0\n2\n0\n0\n2\n0\n0\n1\n2\n2\n2\n2\n0\n3\n3\n3\n3\n0\n0\n0\n0\n3\n1\n0\n1\n3\n1\n0\n1\n0\n3\n2\n0\n2\n1\n0\n2\n0\n0\n5\n0\n2\n5\n0\n1\n0\n3\n1\n0\n0\n0\n2\n0\n1\n0\n2\n1\n0\n1\n0\n1\n0\n1\n1\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n3\n0\n0\n0\n0\n1\n0\n0\n2\n3\n0\n3\n0\n3\n5\n4\n0\n4\n0\n0\n7\n2\n0\n0\n0\n6\n7\n12\n9\n0\n11\n2\n0\n1\n0\n1\n1\n0\n0\n0\n0\n0\n2\n0\n1\n0\n1\n1\n1\n1\n0\n1\n1\n0\n1\n0\n0\n0\n1\n1\n1\n0\n1\n0\n1\n0\n0\n1\n1\n1\n1\n0\n0\n1\n1\n1\n1\n1\n1\n1\n0\n1\n1\n0\n2\n0\n0\n0\n0\n4\n0\n1\n1\n0\n2\n2\n2\n0\n0\n0\n0\n0\n0\n4\n0\n1\n1\n1\n1\n0\n2\n0\n0\n0\n0\n0\n0\n3\n1\n0\n0\n0\n0\n1\n0\n0\n2\n1\n0\n0\n0\n0\n3\n0\n0\n4\n0\n0\n3\n4\n0\n0\n2\n0\n0\n1\n1\n1\n0\n2\n0\n3\n4\n5\n2\n0\n0\n7\n4\n5\n0\n1\n0\n0\n0\n1\n1\n2\n0\n0\n3\n4\n0\n1\n1\n1\n5\n0\n2\n0\n1\n1\n1\n1\n0\n0\n0\n0\n2\n0\n1\n0\n1\n0\n0\n0\n0\n2\n2\n0\n0\n0\n0\n1\n2\n0\n2\n2\n0\n0\n2\n1\n2\n0\n2\n0\n0\n0\n0\n0\n0\n0\n0\n2\n0\n1\n1\n1\n0\n0\n3\n0\n0\n3\n0\n5\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n2\n2\n0\n5\n0\n2\n0\n1\n1\n0\n1\n0\n2\n0\n0\n3\n1\n0\n0\n1\n0\n0\n1\n0\n0\n0\n1\n1\n0\n2\n0\n2\n1\n1\n0\n1\n2\n0\n0\n2\n2\n1\n2\n0\n0\n0\n0\n1\n2\n2\n1\n0\n1\n1\n0\n1\n1\n0\n1\n0\n2\n2\n0\n2\n2\n1\n3\n0\n0\n0\n0\n0\n0\n1\n2\n3\n0\n0\n4\n0\n4\n0\n0\n0\n1\n3\n2\n2\n4\n2\n0\n1\n1\n0\n0\n0\n0\n0\n0\n2\n2\n0\n2\n0\n0\n0\n0\n5\n0\n4\n0\n0\n0\n0\n0\n0\n0\n1\n1\n1\n1\n0\n1\n0\n1\n1\n1\n0\n0\n0\n0\n0\n1\n2\n0\n1\n1\n0\n0\n1\n2\n0\n0\n0\n3\n0\n0\n1\n0\n5\n0\n0\n0\n0\n0\n4\n0\n0\n0\n4\n1\n0\n2\n0\n2\n2\n0\n0\n2\n1\n0\n1\n0\n2\n2\n0\n2\n2\n1\n0\n1\n2\n0\n1\n0\n2\n0\n2\n2\n0\n1\n0\n0\n0\n0\n0\n0\n1\n3\n0\n1\n1\n3\n0\n0\n2\n2\n2\n1\n1\n3\n1\n0\n0\n0\n0\n4\n2\n1\n1\n0\n1\n1\n0\n0\n2\n0\n0\n0\n0\n0\n0\n1\n2\n0\n4\n1\n0\n2\n3\n0\n0\n6\n3\n0\n0\n2\n0\n2\n1\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n2\n3\n0\n1\n0\n0\n2\n0\n3\n0\n5\n1\n0\n0\n1\n1\n0\n0\n1\n0\n1\n0\n1\n0\n0\n0\n0\n0\n1\n3\n2\n5\n4\n5\n0\n5\n4\n0\n0\n4\n5\n4\n0\n9\n7\n0\n0\n1\n1\n1\n0\n0\n0\n0\n0\n0\n1\n2\n3\n1\n2\n0\n1\n2\n2\n3\n0\n0\n0\n0\n5\n0\n0\n3\n0\n0\n0\n1\n1\n3\n0\n0\n1\n0\n1\n0\n0\n0\n0\n0\n0\n3\n0\n0\n0\n1\n0\n1\n4\n1\n2\n0\n1\n1\n1\n0\n0\n1\n1\n0\n1\n1\n0\n0\n1\n1\n0\n0\n1\n2\n1\n0\n0\n0\n1\n0\n0\n1\n1\n1\n1\n0\n1\n1\n0\n0\n1\n0\n0\n0\n0\n1\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n1\n0\n1\n1\n0\n1\n1\n0\n0\n0\n1\n1\n0\n1\n0\n0\n0\n0\n0\n1\n0\n1\n0\n0\n4\n4\n0\n4\n2\n1\n6\n0\n6\n0\n1\n0\n5\n0\n0\n2\n2\n1\n0\n0\n1\n4\n0\n1\n1\n2\n1\n0\n2\n1\n0\n0\n2\n2\n0\n1\n1\n1\n2\n3\n3\n0\n0\n0\n2\n1\n0\n2\n0\n0\n1\n5\n0\n1\n1\n0\n4\n0\n0\n0\n0\n1\n1\n0\n2\n1\n0\n0\n0\n0\n1\n1\n1\n0\n0\n1\n0\n0\n1\n0\n1\n1\n0\n1\n0\n1\n0\n0\n0\n0\n3\n1\n1\n0\n2\n1\n4\n4\n5\n0\n1\n0\n1\n3\n1\n1\n0\n1\n0\n0\n0\n2\n3\n1\n0\n0\n3\n3\n0\n1\n0\n1\n1\n0\n0\n0\n0\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n2\n4\n1\n0\n0\n3\n1\n0\n1\n1\n1\n6\n1\n0\n3\n0\n9\n1\n2\n0\n1\n1\n0\n0\n2\n0\n1\n0\n1\n0\n0\n0\n1\n0\n1\n1\n2\n0\n0\n2\n0\n1\n2\n1\n4\n0\n0\n0\n0\n1\n0\n2\n4\n2\n0\n0\n2\n0\n0\n2\n4\n0\n2\n3\n2\n0\n1\n2\n0\n0\n1\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n2\n1\n2\n2\n0\n1\n1\n1\n1\n0\n0\n1\n1\n2\n0\n1\n0\n0\n0\n4\n0\n3\n5\n3\n1\n2\n2\n1\n0\n0\n2\n1\n0\n1\n0\n1\n3\n0\n0\n0\n0\n0\n1\n0\n0\n0\n1\n0\n1\n0\n0\n1\n1\n1\n1\n2\n0\n1\n2\n0\n1\n1\n2\n0\n0\n0\n0\n2\n3\n1\n0\n3\n0\n1\n1\n0\n0\n1\n1\n0\n1\n0\n0\n0\n2\n2\n0\n2\n2\n0\n0\n2\n2\n0\n1\n1\n1\n0\n0\n1\n1\n2\n0\n0\n1\n1\n1\n1\n0\n0\n0\n0\n1\n1\n0\n0\n2\n1\n0\n1\n1\n0\n1\n0\n3\n0\n0\n1\n1\n0\n2\n0\n0\n0\n0\n2\n0\n1\n1\n0\n0\n2\n0\n0\n0\n1\n0\n1\n1\n0\n0\n1\n5\n0\n0\n0\n6\n0\n0\n0\n2\n1\n2\n2\n0\n1\n2\n0\n0\n2\n0\n1\n0\n2\n2\n3\n1\n0\n1\n0\n1\n1\n0\n0\n0\n0\n0\n0\n0\n1\n1\n0\n1\n1\n0\n0\n1\n0\n1\n1\n1\n0\n2\n0\n3\n0\n0\n0\n0\n1\n0\n1\n0\n0\n1\n0\n1\n3\n1\n1\n3\n3\n2\n0\n0\n2\n1\n0\n1\n0\n1\n3\n0\n3\n3\n0\n3\n3\n4\n0\n2\n2\n2\n2\n0\n1\n0\n0\n0\n0\n1\n1\n0\n1\n2\n0\n0\n0\n0\n2\n2\n3\n0\n0\n0\n0\n1\n1\n0\n4\n2\n3\n0\n1\n1\n1\n3\n0\n0\n3\n3\n0\n0\n4\n6\n0\n0\n1\n0\n0\n0\n1\n0\n0\n0\n2\n2\n5\n0\n4\n0\n0\n0\n5\n0\n0\n7\n3\n0\n1\n7\n1\n0\n4\n0\n1\n0\n0\n5\n0\n1\n4\n0\n0\n2\n0\n1\n0\n1\n0\n0\n0\n1\n2\n1\n2\n3\n0\n0\n0\n3\n1\n3\n0\n5\n5\n6\n6\n5\n1\n0\n0\n0\n1\n1\n0\n6\n0\n1\n0\n1\n0\n0\n1\n0\n0\n0\n4\n1\n2\n0\n1\n0\n0\n0\n0\n0\n1\n1\n1\n0\n1\n0\n0\n0\n1\n1\n0\n2\n1\n0\n3\n2\n0\n0\n3\n0\n3\n3\n0\n2\n4\n0\n2\n0\n0\n0\n0\n4\n0\n6\n0\n0\n0\n0\n0\n0\n2\n0\n0\n5\n0\n0\n0\n0\n1\n0\n2\n1\n2\n0\n1\n2\n3\n1\n0\n0\n0\n0\n0\n2\n0\n1\n0\n0\n3\n3\n4\n2\n2\n2\n0\n4\n1\n0\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n3\n0\n2\n3\n4\n1\n3\n2\n3\n0\n0\n0\n0\n1\n0\n0\n0\n4\n0\n0\n1\n1\n1\n1\n2\n0\n1\n1\n1\n1\n0\n2\n0\n1\n3\n0\n0\n0\n0\n2\n1\n0\n1\n0\n0\n0\n2\n2\n0\n2\n1\n1\n0\n0\n0\n2\n0\n1\n2\n0\n0\n0\n0\n0\n1\n1\n5\n1\n0\n0\n0\n3\n1\n2\n0\n0\n1\n1\n1\n0\n1\n0\n1\n0\n2\n1\n0\n0\n4\n0\n2\n0\n0\n2\n2\n0\n1\n0\n0\n2\n0\n3\n2\n0\n0\n0\n0\n0\n3\n0\n0\n6\n7\n0\n2\n1\n5\n4\n0\n0\n0\n0\n0\n0\n4\n0\n0\n1\n1\n4\n1\n0\n2\n0\n4\n3\n4\n3\n0\n2\n0\n0\n1\n1\n0\n0\n2\n2\n0\n3\n2\n2\n0\n4\n1\n3\n0\n0\n0\n3\n3\n3\n0\n0\n2\n3\n1\n2\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n0\n2\n0\n0\n2\n1\n3\n4\n10\n1\n5\n5\n1\n0\n1\n1\n1\n1\n0\n0\n0\n2\n2\n0\n0\n0\n1\n1\n1\n1\n0\n0\n4\n1\n1\n1\n0\n1\n0\n2\n1\n1\n0\n2\n1\n0\n1\n0\n0\n1\n0\n1\n1\n2\n1\n1\n1\n0\n0\n3\n1\n0\n0\n0\n1\n1\n0\n3\n0\n4\n1\n3\n1\n2\n1\n0\n0\n2\n0\n8\n0\n0\n1\n0\n0\n1\n2\n0\n0\n1\n2\n2\n1\n3\n0\n0\n6\n2\n0\n1\n0\n3\n3\n0\n0\n6\n0\n0\n0\n0\n0\n0\n2\n0\n1\n0\n0\n0\n0\n2\n1\n3\n2\n3\n0\n3\n3\n2\n3\n0\n0\n0\n3\n4\n1\n1\n0\n0\n0\n0\n1\n1\n1\n1\n0\n1\n0\n2\n0\n2\n0\n2\n2\n0\n2\n0\n2\n1\n1\n0\n2\n3\n1\n1\n1\n1\n0\n0\n0\n0\n0\n2\n0\n0\n0\n0\n1\n2\n2\n0\n2\n2\n0\n4\n1\n0\n1\n0\n0\n0\n0\n2\n0\n0\n0\n0\n5\n0\n2\n1\n0\n2\n0\n2\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n4\n0\n1\n2\n0\n0\n0\n1\n1\n3\n0\n0\n2\n0\n2\n0\n4\n1\n0\n2\n0\n0\n0\n0\n7\n2\n0\n0\n2\n0\n0\n3\n3\n0\n1\n2\n0\n0\n0\n0\n4\n3\n0\n4\n0\n4\n0\n6\n6\n6\n0\n6\n6\n0\n7\n0\n0\n1\n1\n0\n0\n0\n1\n0\n0\n0\n0\n7\n7\n0\n2\n1\n0\n1\n1\n2\n3\n0\n0\n2\n0\n0\n2\n4\n0\n0\n0\n0\n0\n1\n0\n2\n0\n2\n1\n0\n0\n0\n0\n0\n0\n0\n1\n2\n0\n1\n1\n0\n3\n5\n0\n1\n2\n0\n1\n5\n1\n0\n0\n3\n2\n4\n0\n0\n0\n0\n0\n0\n0\n2\n2\n0\n2\n1\n0\n0\n1\n6\n0\n0\n0\n0\n0\n1\n1\n0\n0\n1\n0\n0\n0\n0\n1\n0\n1\n0\n2\n2\n1\n0\n0\n0\n1\n1\n0\n1\n0\n1\n2\n2\n0\n1\n0\n3\n0\n1\n0\n0\n4\n2\n0\n3\n0\n0\n1\n1\n0\n1\n1\n0\n2\n1\n1\n0\n0\n2\n0\n1\n1\n1\n2\n0\n2\n2\n2\n0\n0\n1\n1\n0\n0\n1\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n1\n0\n2\n2\n0\n2\n0\n0\n0\n3\n2\n0\n0\n0\n0\n2\n0\n1\n6\n3\n3\n3\n1\n3\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n2\n2\n0\n2\n3\n4\n0\n0\n4\n0\n3\n5\n0\n4\n0\n1\n0\n0\n2\n0\n2\n0\n0\n0\n0\n0\n0\n0\n1\n1\n1\n0\n0\n1\n0\n1\n0\n2\n2\n0\n0\n0\n1\n1\n0\n0\n0\n1\n0\n4\n3\n0\n2\n0\n4\n4\n4\n0\n4\n4\n1\n0\n2\n0\n2\n0\n2\n2\n5\n1\n0\n0\n1\n0\n1\n1\n0\n0\n0\n0\n0\n1\n1\n1\n3\n1\n1\n3\n1\n2\n2\n1\n0\n0\n1\n0\n0\n2\n0\n0\n3\n2\n1\n1\n0\n0\n0\n1\n0\n1\n1\n0\n2\n0\n2\n2\n0\n0\n0\n1\n0\n0\n0\n1\n0\n1\n0\n0\n0\n1\n0\n1\n1\n0\n1\n1\n0\n1\n0\n0\n0\n1\n0\n0\n0\n0\n2\n4\n0\n0\n1\n1\n0\n0\n0\n2\n2\n0\n0\n0\n1\n2\n1\n1\n2\n1\n1\n2\n0\n2\n2\n2\n0\n0\n0\n2\n0\n1\n0\n1\n0\n1\n0\n0\n2\n0\n2\n2\n0\n2\n2\n1\n0\n0\n0\n2\n0\n2\n0\n2\n2\n3\n0\n0\n2\n2\n0\n0\n2\n0\n0\n0\n0\n4\n0\n0\n5\n6\n0\n4\n0\n1\n0\n0\n2\n1\n0\n0\n0\n0\n1\n1\n1\n6\n1\n0\n2\n0\n2\n0\n0\n0\n1\n0\n3\n1\n2\n1\n0\n1\n1\n0\n0\n4\n0\n3\n0\n0\n1\n2\n0\n1\n0\n1\n1\n0\n0\n0\n0\n0\n2\n0\n3\n2\n2\n0\n1\n1\n1\n0\n1\n0\n0\n0\n2\n0\n2\n3\n0\n0\n0\n0\n2\n1\n0\n2\n0\n1\n4\n0\n0\n1\n0\n1\n0\n0\n0\n2\n1\n1\n3\n0\n0\n3\n0\n0\n0\n0\n0\n2\n2\n1\n2\n1\n0\n0\n2\n0\n0\n0\n0\n0\n0\n0\n1\n0\n0\n4\n0\n0\n0\n0\n5\n1\n0\n0\n1\n3\n0\n0\n1\n1\n0\n1\n0\n1\n2\n0\n1\n1\n0\n0\n2\n0\n2\n1\n0\n1\n1\n1\n0\n0\n1\n3\n3\n3\n0\n0\n0\n2\n2\n0\n1\n1\n0\n4\n0\n2\n0\n0\n0\n1\n2\n0\n0\n0\n0\n1\n0\n0\n0\n1\n2\n3\n2\n1\n1\n1\n0\n0\n0\n2\n0\n1\n0\n0\n0\n0\n0\n1\n0\n0\n0\n4\n1\n0\n2\n4\n2\n5\n0\n2\n0\n0\n2\n0\n1\n2\n0\n2\n0\n3\n0\n0\n0\n0\n1\n0\n0\n0\n1\n0\n1\n1\n2\n0\n0\n1\n0\n1\n1\n1\n1\n0\n0\n0\n1\n0\n0\n1\n1\n0\n1\n2\n0\n0\n0\n1\n0\n0\n2\n2\n0\n2\n0\n2\n3\n0\n1\n1\n0\n1\n0\n2\n2\n1\n0\n3\n2\n1\n1\n0\n0\n0\n0\n0\n1\n0\n2\n2\n0\n2\n0\n0\n2\n1\n2\n0\n2\n0\n3\n0\n0\n1\n0\n0\n1\n0\n0\n2\n0\n1\n0\n2\n1\n0\n0\n2\n1\n0\n3\n2\n0\n0\n0\n2\n2\n4\n0\n0\n1\n4\n4\n1\n0\n0\n8\n0\n2\n5\n6\n0\n6\n2\n0\n0\n1\n1\n2\n2\n0\n0\n1\n2\n0\n0\n0\n1\n1\n2\n2\n4\n2\n3\n0\n0\n0\n1\n0\n3\n0\n4\n0\n1\n1\n0\n0\n0\n2\n1\n0\n0\n0\n3\n5\n0\n7\n0\n0\n0\n0\n2\n0\n2\n2\n3\n2\n0\n0\n0\n1\n4\n0\n1\n2\n2\n2\n0\n1\n2\n0\n4\n0\n0\n0\n2\n0\n0\n1\n0\n2\n0\n2\n0\n1\n1\n0\n1\n2\n0\n0\n0\n3\n0\n0\n1\n0\n0\n3\n0\n2\n0\n3\n0\n0\n0\n0\n0\n3\n0\n0\n5\n0\n0\n0\n0\n1\n2\n3\n3\n2\n0\n1\n5\n0\n2\n2\n4\n2\n0\n1\n0\n2\n0\n0\n1\n0\n1\n2\n1\n1\n1\n2\n1\n1\n2\n2\n0\n3\n0\n0\n0\n2\n0\n0\n0\n1\n1\n0\n0\n1\n1\n0\n1\n4\n0\n2\n0\n1\n0\n0\n0\n2\n1\n1\n1\n0\n1\n0\n0\n0\n2\n0\n0\n0\n2\n3\n0\n0\n2\n1\n2\n0\n0\n0\n1\n1\n1\n2\n2\n0\n0\n0\n1\n1\n0\n0\n1\n1\n2\n0\n0\n2\n2\n3\n0\n0\n0\n2\n2\n0\n1\n0\n0\n1\n0\n0\n1\n1\n0\n1\n1\n2\n1\n1\n1\n1\n0\n0\n2\n2\n1\n0\n0\n0\n0\n3\n2\n0\n0\n3\n0\n0\n1\n0\n0\n0\n2\n2\n1\n1\n0\n1\n0\n1\n1\n0\n0\n0\n0\n0\n2\n2\n2\n0\n3\n0\n2\n3\n0\n1\n1\n1\n1\n0\n0\n0\n1\n0\n0\n0\n0\n2\n0\n3\n0\n3\n3\n3\n0\n3\n5\n0\n0\n5\n2\n0\n0\n0\n0\n2\n0\n0\n0\n1\n1\n2\n0\n1\n3\n1\n1\n0\n3\n1\n1\n0\n0\n1\n0\n3\n1\n0\n2\n1\n0\n1\n1\n0\n1\n1\n0\n1\n1\n1\n2\n2\n1\n1\n0\n0\n3\n0\n0\n1\n2\n1\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n1\n1\n1\n0\n0\n2\n3\n4\n0\n0\n1\n1\n0\n1\n1\n1\n0\n1\n0\n0\n0\n0\n0\n1\n0\n0\n3\n3\n0\n0\n0\n5\n0\n0\n0\n0\n0\n5\n1\n1\n1\n0\n1\n1\n1\n0\n1\n2\n0\n0\n0\n2\n0\n1\n0\n0\n1\n0\n3\n0\n0\n0\n0\n0\n0\n1\n0\n1\n1\n1\n1\n1\n0\n1\n0\n0\n1\n0\n0\n1\n1\n0\n1\n0\n1\n2\n2\n2\n0\n2\n0\n1\n1\n0\n0\n0\n2\n1\n3\n4\n2\n2\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n0\n1\n0\n0\n0\n2\n4\n0\n0\n2\n2\n0\n3\n1\n2\n0\n4\n1\n1\n1\n1\n2\n1\n0\n2\n1\n0\n3\n0\n0\n0\n0\n2\n0\n2\n3\n0\n0\n0\n4\n0\n1\n1\n1\n2\n2\n0\n0\n1\n1\n0\n0\n1\n0\n1\n0\n1\n0\n1\n1\n0\n0\n1\n0\n0\n0\n1\n0\n3\n1\n0\n0\n0\n1\n1\n1\n1\n0\n0\n0\n0\n0\n4\n0\n0\n0\n2\n0\n0\n4\n3\n4\n0\n0\n0\n0\n1\n0\n0\n1\n1\n0\n3\n0\n1\n0\n0\n0\n1\n1\n0\n0\n1\n1\n0\n0\n0\n3\n0\n5\n0\n0\n2\n2\n6\n0\n7\n0\n9\n1\n0\n2\n0\n0\n3\n1\n0\n1\n0\n3\n1\n0\n2\n1\n1\n0\n0\n0\n2\n1\n1\n0\n3\n0\n0\n0\n5\n0\n0\n0\n0\n1\n0\n2\n1\n4\n1\n1\n0\n1\n3\n0\n3\n0\n1\n1\n2\n2\n0\n0\n0\n0\n3\n1\n3\n1\n0\n0\n0\n1\n0\n0\n2\n0\n1\n1\n0\n1\n0\n0\n0\n1\n1\n1\n0\n0\n0\n0\n2\n0\n0\n4\n1\n1\n5\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n0\n0\n0\n0\n0\n0\n5\n0\n0\n1\n1\n2\n0\n0\n0\n0\n2\n2\n0\n0\n1\n2\n3\n3\n3\n0\n1\n0\n0\n0\n1\n3\n2\n1\n0\n2\n0\n3\n0\n0\n0\n3\n0\n0\n3\n2\n0\n4\n1\n0\n0\n1\n3\n2\n2\n0\n4\n0\n4\n7\n0\n6\n7\n1\n5\n0\n1\n0\n0\n5\n0\n0\n1\n2\n1\n0\n0\n7\n1\n2\n0\n0\n1\n1\n0\n0\n2\n0\n0\n2\n3\n0\n0\n0\n0\n0\n1\n1\n1\n0\n0\n2\n6\n4\n0\n4\n0\n3\n0\n0\n6\n0\n0\n0\n0\n0\n1\n0\n5\n0\n0\n0\n1\n0\n0\n2\n0\n0\n0\n1\n2\n1\n0\n0\n0\n5\n0\n0\n0\n0\n1\n1\n1\n1\n1\n0\n0\n1\n0\n1\n1\n0\n0\n0\n2\n0\n0\n0\n2\n0\n0\n0\n3\n4\n1\n5\n1\n1\n2\n0\n3\n0\n0\n2\n3\n0\n0\n0\n3\n3\n0\n1\n1\n0\n4\n5\n0\n9\n0\n0\n0\n0\n3\n4\n1\n1\n7\n0\n0\n2\n0\n1\n1\n0\n0\n2\n2\n1\n0\n1\n2\n2\n2\n2\n3\n0\n0\n6\n0\n2\n6\n3\n3\n0\n0\n0\n7\n0\n5\n0\n0\n1\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n0\n1\n3\n1\n1\n1\n0\n2\n1\n1\n1\n0\n1\n0\n2\n2\n1\n1\n0\n0\n0\n0\n1\n0\n1\n0\n0\n1\n3\n2\n0\n0\n4\n0\n1\n0\n0\n2\n0\n0\n0\n2\n0\n1\n2\n3\n3\n2\n2\n0\n4\n0\n0\n0\n2\n0\n0\n0\n0\n1\n0\n0\n1\n0\n1\n0\n2\n6\n2\n0\n4\n2\n2\n0\n0\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n0\n1\n0\n1\n0\n0\n1\n1\n0\n1\n0\n2\n2\n1\n4\n0\n0\n3\n1\n0\n1\n4\n0\n0\n1\n1\n2\n0\n0\n3\n1\n0\n1\n1\n0\n2\n0\n2\n0\n0\n5\n1\n0\n1\n0\n4\n0\n0\n2\n0\n1\n0\n0\n0\n3\n3\n1\n1\n0\n0\n2\n2\n1\n0\n2\n0\n1\n0\n2\n0\n2\n3\n1\n0\n1\n0\n2\n0\n1\n2\n2\n0\n0\n2\n0\n0\n3\n0\n1\n0\n2\n1\n1\n2\n2\n0\n3\n3\n0\n4\n0\n0\n1\n5\n0\n0\n1\n1\n0\n4\n0\n1\n1\n5\n0\n0\n2\n2\n3\n0\n0\n3\n1\n1\n1\n1\n0\n1\n1\n0\n1\n0\n0\n0\n1\n1\n0\n1\n1\n1\n1\n0\n1\n0\n0\n1\n1\n0\n1\n0\n1\n1\n2\n0\n2\n0\n0\n0\n2\n3\n3\n0\n0\n0\n0\n1\n0\n0\n0\n2\n2\n0\n0\n0\n0\n3\n3\n1\n0\n2\n3\n2\n7\n0\n0\n0\n1\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n1\n1\n1\n0\n1\n0\n1\n1\n0\n2\n1\n0\n0\n3\n1\n0\n2\n0\n3\n0\n2\n0\n3\n2\n0\n0\n2\n1\n0\n1\n2\n1\n0\n1\n0\n0\n1\n0\n1\n0\n0\n0\n2\n0\n2\n2\n3\n2\n0\n0\n2\n1\n2\n2\n2\n0\n1\n0\n1\n0\n0\n3\n5\n0\n5\n0\n0\n0\n0\n2\n0\n1\n0\n1\n1\n1\n6\n0\n1\n0\n1\n2\n2\n0\n0\n0\n3\n3\n1\n0\n1\n0\n2\n2\n0\n0\n0\n0\n0\n0\n1\n0\n1\n0\n1\n1\n0\n0\n0\n0\n0\n1\n0\n0\n0\n1\n1\n1\n0\n0\n1\n0\n0\n2\n0\n1\n0\n2\n0\n0\n0\n0\n1\n1\n0\n1\n0\n0\n1\n0\n0\n2\n1\n1\n1\n0\n1\n2\n1\n1\n0\n0\n1\n1\n0\n1\n1\n0\n1\n0\n1\n2\n0\n2\n0\n0\n1\n0\n2\n4\n3\n0\n1\n0\n4\n0\n1\n3\n3\n2\n0\n2\n0\n2\n0\n0\n2\n0\n10\n0\n0\n7\n1\n6\n0\n1\n0\n0\n4\n0\n1\n1\n0\n6\n3\n0\n0\n7\n0\n1\n1\n0\n0\n0\n0\n2\n0\n0\n0\n5\n3\n3\n5\n0\n0\n2\n1\n4\n0\n3\n1\n0\n1\n2\n1\n2\n0\n0\n0\n1\n0\n0\n0\n2\n1\n0\n1\n1\n1\n1\n6\n1\n1\n0\n1\n0\n2\n0\n0\n3\n0\n0\n0\n0\n0\n0\n1\n4\n0\n0\n4\n5\n0\n1\n0\n0\n0\n0\n2\n0\n0\n2\n0\n1\n0\n0\n0\n0\n0\n0\n4\n0\n0\n5\n0\n0\n3\n0\n0\n1\n0\n0\n3\n0\n0\n0\n0\n1\n1\n1\n0\n0\n2\n2\n2\n1\n0\n1\n2\n0\n0\n2\n1\n2\n0\n2\n2\n2\n2\n3\n2\n0\n0\n0\n2\n0\n1\n0\n0\n5\n5\n0\n0\n1\n0\n1\n0\n4\n0\n4\n0\n4\n0\n1\n0\n0\n0\n0\n0\n0\n1\n0\n0\n2\n1\n0\n1\n1\n0\n0\n0\n3\n0\n0\n3\n1\n2\n1\n3\n0\n0\n3\n0\n3\n3\n4\n0\n2\n5\n0\n1\n0\n0\n0\n0\n0\n0\n0\n2\n4\n2\n1\n2\n0\n0\n0\n0\n0\n1\n2\n3\n0\n0\n1\n2\n0\n3\n8\n2\n2\n2\n3\n1\n1\n0\n1\n1\n0\n0\n2\n1\n1\n0\n0\n1\n0\n1\n1\n0\n1\n1\n1\n0\n2\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n1\n1\n0\n1\n0\n0\n2\n2\n0\n0\n2\n0\n0\n0\n1\n1\n1\n0\n0\n2\n2\n0\n2\n2\n0\n0\n0\n1\n0\n1\n0\n1\n1\n0\n2\n4\n4\n1\n0\n1\n0\n0\n0\n0\n0\n1\n0\n1\n1\n2\n1\n0\n0\n2\n0\n5\n1\n1\n0\n0\n1\n2\n1\n0\n0\n2\n1\n2\n0\n0\n0\n2\n2\n0\n1\n2\n3\n0\n0\n0\n2\n0\n0\n0\n1\n1\n3\n0\n0\n0\n0\n2\n0\n2\n0\n0\n1\n2\n0\n0\n1\n0\n0\n2\n1\n2\n0\n2\n3\n0\n3\n0\n0\n0\n0\n0\n4\n0\n3\n0\n1\n2\n3\n2\n2\n0\n1\n1\n0\n0\n1\n0\n0\n0\n1\n1\n0\n0\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n2\n0\n0\n3\n2\n1\n1\n0\n0\n1\n0\n0\n0\n0\n2\n2\n1\n0\n1\n0\n1\n1\n0\n1\n4\n1\n2\n7\n0\n0\n7\n0\n0\n5\n4\n3\n7\n7\n0\n0\n0\n8\n0\n3\n0\n2\n0\n0\n1\n0\n0\n1\n1\n1\n0\n0\n3\n1\n0\n3\n0\n0\n0\n0\n0\n4\n1\n1\n1\n0\n0\n1\n3\n0\n1\n1\n0\n0\n0\n1\n0\n0\n0\n1\n0\n2\n2\n2\n1\n0\n1\n0\n1\n1\n0\n0\n1\n1\n0\n1\n0\n1\n0\n0\n1\n0\n1\n1\n1\n1\n1\n0\n1\n1\n0\n1\n1\n1\n0\n0\n0\n3\n3\n4\n0\n1\n3\n0\n3\n1\n1\n2\n0\n0\n1\n0\n2\n0\n2\n0\n0\n0\n0\n0\n2\n0\n0\n0\n0\n0\n0\n0\n0\n2\n2\n0\n1\n1\n1\n1\n0\n1\n1\n0\n4\n3\n2\n1\n0\n0\n0\n1\n2\n0\n3\n2\n0\n0\n6\n1\n1\n0\n0\n0\n0\n2\n1\n2\n0\n0\n2\n0\n1\n0\n2\n2\n0\n0\n5\n0\n2\n0\n1\n0\n0\n2\n1\n0\n1\n1\n1\n0\n0\n1\n0\n1\n1\n1\n0\n1\n0\n1\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n1\n1\n3\n1\n2\n0\n0\n0\n0\n2\n3\n0\n4\n0\n4\n0\n1\n0\n0\n3\n4\n1\n0\n1\n0\n0\n0\n0\n4\n0\n0\n0\n2\n1\n3\n0\n0\n1\n0\n2\n0\n1\n1\n0\n1\n0\n0\n0\n5\n0\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n2\n1\n0\n2\n0\n1\n0\n1\n0\n2\n3\n0\n0\n0\n0\n2\n0\n1\n1\n0\n0\n1\n0\n0\n1\n1\n1\n1\n1\n2\n0\n0\n1\n0\n0\n0\n1\n1\n1\n0\n1\n0\n2\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n1\n3\n0\n3\n0\n0\n1\n3\n1\n1\n3\n3\n1\n0\n2\n0\n3\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n2\n0\n0\n3\n2\n0\n0\n0\n0\n1\n0\n1\n0\n0\n0\n0\n0\n1\n4\n1\n1\n2\n0\n0\n3\n0\n0\n4\n0\n0\n0\n0\n0\n0\n3\n0\n0\n2\n0\n0\n4\n0\n5\n4\n0\n2\n0\n0\n0\n0\n0\n0\n1\n1\n1\n2\n0\n2\n3\n0\n2\n2\n4\n3\n0\n0\n0\n0\n1\n5\n0\n1\n1\n0\n0\n0\n0\n1\n1\n0\n3\n0\n1\n0\n0\n1\n1\n3\n0\n0\n3\n3\n0\n1\n2\n1\n2\n1\n2\n0\n1\n0\n0\n0\n1\n0\n2\n0\n2\n5\n0\n0\n1\n1\n6\n0\n1\n0\n1\n0\n1\n1\n3\n0\n0\n1\n0\n0\n3\n1\n0\n1\n1\n0\n0\n1\n1\n0\n0\n0\n1\n6\n0\n3\n0\n0\n0\n1\n0\n0\n0\n1\n0\n1\n0\n1\n0\n4\n0\n4\n4\n0\n0\n0\n5\n4\n3\n0\n5\n1\n7\n5\n1\n0\n0\n0\n0\n0\n1\n0\n0\n0\n1\n1\n2\n1\n0\n0\n1\n2\n2\n3\n0\n1\n0\n0\n0\n5\n5\n7\n0\n5\n6\n0\n0\n4\n0\n0\n1\n2\n2\n0\n0\n0\n1\n2\n0\n1\n1\n2\n2\n4\n0\n0\n0\n0\n0\n1\n0\n2\n1\n0\n0\n1\n0\n0\n2\n0\n0\n1\n0\n1\n0\n0\n0\n0\n1\n2\n2\n1\n2\n0\n0\n0\n0\n0\n0\n5\n0\n0\n0\n2\n2\n3\n2\n0\n0\n0\n0\n5\n2\n0\n2\n0\n4\n3\n0\n9\n0\n6\n7\n1\n0\n2\n1\n2\n1\n0\n0\n0\n0\n0\n3\n4\n0\n2\n0\n3\n2\n0\n2\n0\n0\n0\n0\n2\n3\n1\n0\n0\n2\n1\n2\n1\n0\n0\n0\n1\n4\n4\n0\n1\n0\n0\n0\n0\n0\n1\n0\n5\n1\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n1\n0\n1\n3\n0\n0\n2\n0\n7\n0\n2\n0\n0\n0\n1\n0\n1\n0\n0\n0\n2\n2\n0\n0\n1\n0\n0\n1\n0\n1\n2\n0\n0\n1\n0\n3\n3\n0\n0\n0\n1\n0\n5\n0\n1\n1\n2\n0\n0\n0\n0\n0\n0\n1\n0\n7\n1\n0\n0\n1\n0\n2\n0\n0\n1\n0\n2\n0\n2\n2\n2\n0\n0\n0\n0\n0\n0\n0\n0\n2\n0\n2\n0\n1\n1\n1\n0\n0\n1\n2\n2\n2\n0\n1\n0\n0\n1\n0\n1\n1\n0\n1\n1\n0\n0\n0\n2\n2\n1\n1\n1\n0\n0\n1\n0\n3\n2\n0\n3\n0\n2\n1\n0\n1\n0\n2\n0\n0\n0\n5\n3\n0\n1\n0\n3\n2\n1\n1\n0\n0\n0\n0\n1\n2\n1\n0\n0\n0\n0\n0\n2\n3\n0\n1\n1\n1\n1\n1\n1\n2\n0\n0\n0\n1\n1\n0\n1\n0\n3\n0\n1\n0\n0\n0\n1\n1\n0\n1\n0\n1\n0\n0\n2\n2\n0\n3\n0\n2\n0\n2\n0\n0\n1\n0\n0\n1\n1\n0\n0\n2\n0\n0\n0\n0\n0\n6\n0\n4\n2\n4\n2\n0\n1\n1\n0\n2\n2\n2\n0\n0\n1\n4\n2\n6\n0\n0\n0\n6\n6\n0\n0\n0\n5\n1\n0\n2\n0\n0\n0\n1\n0\n1\n2\n3\n2\n0\n2\n3\n0\n0\n1\n0\n1\n0\n0\n1\n3\n3\n3\n0\n5\n2\n2\n1\n1\n1\n0\n1\n0\n1\n0\n1\n0\n0\n1\n0\n0\n2\n1\n0\n0\n1\n0\n1\n0\n0\n1\n1\n0\n0\n1\n0\n1\n2\n0\n0\n3\n4\n3\n0\n0\n2\n2\n0\n1\n1\n0\n0\n1\n0\n1\n2\n0\n1\n0\n2\n0\n0\n0\n0\n1\n0\n1\n0\n0\n0\n0\n2\n1\n2\n0\n1\n3\n0\n0\n0\n0\n4\n0\n2\n3\n2\n0\n1\n2\n1\n3\n0\n1\n0\n2\n0\n0\n0\n0\n0\n0\n1\n1\n0\n2\n0\n2\n0\n2\n0\n1\n0\n0\n1\n1\n2\n0\n0\n0\n2\n0\n3\n0\n1\n3\n4\n0\n1\n0\n0\n1\n3\n1\n0\n1\n2\n0\n0\n0\n5\n6\n3\n1\n4\n0\n4\n0\n0\n5\n5\n0\n1\n3\n0\n4\n0\n0\n0\n1\n0\n0\n1\n0\n0\n4\n2\n0\n0\n0\n5\n5\n0\n3\n0\n4\n1\n0\n0\n0\n0\n0\n6\n1\n1\n0\n1\n0\n1\n1\n8\n0\n0\n2\n0\n3\n2\n0\n0\n3\n0\n0\n4\n2\n0\n8\n0\n0\n1\n1\n4\n0\n5\n0\n3\n5\n2\n0\n0\n0\n1\n4\n0\n1\n2\n0\n1\n0\n0\n1\n0\n2\n0\n4\n4\n0\n1\n4\n5\n0\n2\n1\n0\n0\n2\n1\n2\n0\n1\n2\n3\n0\n0\n0\n0\n0\n0\n0\n0\n0\n3\n0\n2\n4\n2\n6\n0\n0\n0\n0\n0\n0\n3\n0\n7\n4\n0\n0\n0\n2\n6\n2\n2\n0\n0\n8\n0\n0\n0\n1\n0\n2\n0\n2\n1\n0\n3\n0\n1\n3\n0\n3\n5\n1\n1\n1\n0\n2\n0\n1\n0\n2\n0\n0\n0\n0\n0\n0\n3\n4\n1\n0\n3\n1\n1\n1\n2\n0\n1\n2\n1\n0\n0\n0\n0\n1\n3\n2\n0\n2\n5\n0\n0\n0\n4\n4\n3\n0\n0\n2\n0\n1\n2\n0\n0\n0\n0\n0\n0\n3\n0\n2\n0\n0\n0\n1\n0\n2\n2\n2\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n2\n2\n0\n0\n4\n0\n3\n1\n1\n1\n1\n4\n0\n0\n3\n0\n0\n2\n0\n2\n0\n1\n1\n1\n3\n2\n1\n0\n0\n0\n2\n4\n6\n1\n1\n2\n0\n0\n2\n0\n5\n4\n2\n2\n3\n0\n10\n0\n11\n8\n7\n0\n0\n1\n1\n1\n1\n0\n1\n2\n1\n0\n1\n1\n2\n1\n0\n2\n0\n0\n0\n0\n1\n1\n0\n1\n2\n2\n0\n0\n3\n0\n0\n2\n1\n0\n1\n0\n1\n0\n4\n0\n1\n5\n0\n0\n1\n2\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n2\n1\n0\n1\n0\n0\n1\n0\n3\n1\n0\n1\n2\n2\n3\n2\n2\n0\n0\n0\n0\n3\n0\n6\n0\n1\n1\n7\n1\n1\n0\n1\n1\n0\n0\n1\n0\n0\n1\n1\n0\n1\n0\n0\n0\n1\n6\n2\n3\n1\n0\n0\n0\n0\n0\n2\n0\n1\n1\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n2\n2\n0\n1\n1\n0\n1\n0\n0\n0\n0\n3\n1\n0\n2\n0\n3\n0\n2\n1\n1\n1\n0\n2\n0\n0\n0\n0\n0\n0\n1\n2\n2\n0\n1\n0\n0\n0\n9\n0\n0\n0\n1\n11\n0\n1\n11\n5\n0\n0\n1\n3\n0\n1\n1\n2\n3\n1\n0\n2\n2\n1\n3\n0\n1\n0\n0\n0\n1\n1\n1\n0\n2\n0\n0\n0\n2\n0\n2\n0\n2\n0\n0\n0\n0\n1\n0\n0\n1\n0\n3\n0\n5\n5\n3\n0\n3\n0\n2\n2\n0\n2\n1\n0\n1\n1\n1\n1\n0\n1\n1\n0\n2\n0\n0\n2\n3\n3\n0\n0\n4\n5\n5\n0\n2\n1\n0\n5\n0\n2\n5\n1\n1\n1\n2\n0\n0\n1\n0\n0\n0\n0\n0\n3\n0\n3\n3\n4\n0\n4\n0\n4\n2\n3\n0\n0\n0\n0\n1\n0\n0\n0\n2\n0\n0\n0\n2\n0\n3\n3\n7\n0\n0\n1\n2\n0\n0\n9\n1\n3\n2\n0\n3\n2\n1\n3\n3\n3\n0\n0\n1\n2\n1\n0\n0\n0\n1\n1\n1\n0\n0\n0\n2\n0\n0\n0\n1\n1\n0\n0\n2\n0\n0\n2\n1\n0\n2\n0\n3\n0\n0\n0\n0\n0\n0\n2\n0\n0\n0\n3\n0\n2\n0\n0\n0\n4\n3\n3\n9\n0\n1\n0\n0\n0\n3\n1\n1\n0\n1\n0\n6\n1\n0\n0\n2\n2\n0\n3\n4\n4\n2\n0\n0\n4\n0\n0\n5\n3\n0\n0\n4\n0\n0\n4\n0\n2\n2\n2\n0\n2\n2\n0\n2\n0\n2\n0\n3\n3\n2\n0\n3\n2\n1\n1\n1\n0\n0\n2\n0\n2\n2\n2\n0\n0\n1\n1\n0\n1\n1\n1\n3\n1\n1\n2\n0\n4\n0\n4\n1\n0\n4\n1\n4\n0\n1\n1\n2\n0\n0\n1\n1\n0\n0\n0\n1\n2\n0\n0\n1\n1\n0\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n0\n1\n0\n1\n1\n0\n0\n0\n0\n0\n2\n0\n0\n1\n1\n1\n0\n0\n0\n3\n0\n2\n1\n0\n3\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n4\n0\n0\n0\n5\n4\n0\n0\n3\n0\n1\n0\n1\n0\n3\n5\n1\n1\n1\n0\n0\n1\n0\n1\n0\n2\n1\n0\n0\n0\n0\n3\n4\n0\n2\n3\n0\n2\n1\n0\n0\n0\n0\n1\n1\n1\n1\n1\n0\n0\n1\n1\n2\n0\n1\n1\n0\n0\n2\n4\n0\n0\n2\n5\n2\n0\n0\n2\n0\n0\n1\n1\n1\n0\n0\n2\n1\n1\n0\n0\n0\n0\n2\n0\n0\n2\n0\n1\n0\n0\n0\n2\n0\n0\n0\n3\n3\n0\n4\n1\n0\n0\n0\n0\n1\n0\n1\n1\n0\n0\n1\n0\n1\n0\n1\n0\n1\n0\n0\n2\n0\n0\n0\n0\n2\n2\n2\n6\n7\n9\n0\n2\n0\n0\n7\n0\n0\n0\n1\n0\n2\n0\n0\n4\n3\n0\n4\n4\n1\n0\n2\n2\n3\n1\n3\n0\n0\n1\n2\n1\n2\n3\n0\n5\n0\n0\n0\n1\n2\n2\n0\n1\n0\n0\n4\n4\n3\n4\n5\n0\n0\n0\n0\n0\n0\n0\n0\n4\n0\n0\n0\n0\n1\n1\n0\n0\n1\n0\n0\n0\n1\n0\n1\n0\n1\n0\n1\n0\n1\n1\n0\n1\n1\n1\n1\n1\n0\n1\n0\n0\n1\n1\n0\n0\n0\n0\n1\n1\n2\n0\n0\n1\n0\n2\n0\n0\n1\n0\n0\n1\n1\n0\n2\n0\n1\n2\n0\n0\n2\n0\n2\n1\n0\n0\n0\n2\n1\n2\n1\n1\n1\n0\n0\n0\n2\n2\n0\n2\n1\n2\n0\n0\n1\n0\n1\n0\n1\n1\n0\n1\n1\n1\n0\n4\n0\n0\n2\n2\n0\n0\n2\n4\n2\n0\n1\n0\n0\n1\n0\n0\n0\n1\n1\n1\n0\n1\n2\n0\n2\n0\n1\n1\n0\n0\n0\n0\n2\n0\n0\n0\n0\n0\n0\n1\n1\n0\n1\n0\n0\n1\n2\n0\n1\n1\n0\n2\n0\n0\n0\n0\n0\n0\n0\n1\n0\n5\n0\n0\n1\n0\n2\n0\n3\n4\n0\n0\n5\n0\n3\n3\n0\n0\n4\n0\n0\n1\n0\n3\n0\n0\n0\n5\n1\n1\n3\n1\n1\n0\n0\n0\n0\n3\n1\n0\n0\n1\n1\n1\n4\n0\n4\n3\n3\n0\n2\n0\n1\n1\n1\n1\n0\n1\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n1\n1\n1\n1\n0\n0\n2\n0\n2\n0\n2\n0\n0\n0\n0\n1\n0\n1\n1\n0\n1\n0\n0\n1\n0\n1\n0\n1\n0\n0\n2\n4\n0\n6\n6\n0\n0\n1\n1\n0\n1\n1\n2\n1\n0\n2\n2\n0\n2\n2\n1\n1\n0\n0\n1\n1\n1\n0\n0\n2\n1\n1\n0\n0\n2\n0\n0\n0\n1\n5\n0\n0\n3\n1\n0\n2\n4\n0\n0\n0\n7\n0\n0\n0\n0\n0\n0\n0\n0\n0\n4\n4\n0\n1\n0\n1\n1\n1\n1\n0\n0\n0\n0\n3\n2\n4\n0\n1\n3\n1\n1\n1\n2\n2\n0\n5\n0\n0\n5\n0\n0\n0\n0\n0\n4\n0\n1\n0\n0\n0\n1\n1\n0\n0\n2\n1\n1\n2\n3\n0\n3\n3\n3\n0\n0\n0\n0\n0\n3\n0\n1\n3\n4\n5\n0\n3\n0\n0\n1\n0\n0\n1\n0\n1\n1\n1\n1\n0\n0\n1\n1\n0\n1\n2\n4\n0\n0\n1\n2\n0\n0\n0\n0\n0\n0\n1\n0\n0\n2\n2\n2\n0\n2\n0\n2\n2\n2\n1\n0\n3\n0\n3\n1\n3\n1\n0\n0\n2\n3\n5\n0\n0\n3\n1\n0\n0\n1\n0\n1\n0\n0\n4\n1\n5\n1\n0\n0\n2\n4\n0\n3\n4\n0\n0\n1\n0\n0\n1\n0\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n1\n0\n1\n2\n1\n0\n2\n1\n2\n4\n1\n3\n0\n3\n0\n4\n4\n2\n4\n0\n0\n0\n0\n0\n6\n1\n3\n0\n6\n5\n3\n0\n0\n2\n2\n2\n0\n0\n0\n2\n1\n6\n0\n0\n3\n0\n0\n5\n4\n1\n2\n0\n0\n1\n1\n0\n0\n1\n2\n1\n0\n2\n1\n1\n1\n1\n0\n0\n2\n0\n2\n0\n0\n2\n1\n0\n0\n1\n0\n1\n1\n0\n2\n0\n1\n1\n1\n0\n1\n1\n1\n2\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n3\n2\n2\n0\n1\n3\n1\n0\n3\n3\n0\n3\n0\n2\n3\n1\n0\n0\n1\n1\n1\n1\n1\n2\n2\n0\n2\n0\n3\n0\n2\n1\n0\n3\n0\n0\n1\n0\n1\n1\n0\n0\n0\n0\n3\n0\n5\n1\n1\n0\n2\n3\n0\n1\n0\n1\n0\n1\n1\n2\n0\n1\n0\n0\n0\n0\n1\n1\n1\n0\n1\n0\n0\n1\n2\n0\n2\n5\n0\n2\n2\n0\n1\n5\n0\n0\n2\n3\n0\n0\n4\n0\n4\n4\n1\n0\n3\n3\n0\n1\n2\n0\n2\n3\n1\n3\n0\n0\n0\n3\n1\n0\n1\n0\n0\n0\n0\n1\n1\n0\n0\n2\n1\n0\n3\n0\n1\n1\n0\n0\n1\n0\n0\n1\n0\n0\n0\n2\n2\n3\n0\n3\n0\n1\n2\n5\n1\n0\n3\n0\n0\n3\n0\n1\n0\n0\n1\n0\n1\n0\n0\n1\n1\n1\n0\n1\n1\n4\n0\n0\n1\n0\n0\n1\n1\n1\n1\n3\n0\n0\n0\n0\n2\n0\n2\n0\n1\n0\n0\n5\n2\n1\n0\n1\n1\n0\n0\n0\n1\n0\n0\n1\n0\n0\n3\n4\n3\n4\n0\n3\n0\n1\n0\n0\n1\n1\n2\n0\n0\n0\n1\n1\n0\n6\n0\n2\n0\n1\n1\n1\n0\n1\n0\n0\n3\n3\n1\n0\n1\n1\n3\n1\n1\n0\n2\n0\n0\n1\n3\n0\n0\n1\n0\n2\n3\n3\n1\n1\n1\n0\n1\n0\n3\n2\n1\n0\n1\n0\n1\n1\n0\n4\n3\n1\n4\n0\n4\n1\n0\n0\n1\n0\n5\n0\n1\n0\n1\n1\n3\n0\n0\n0\n0\n3\n0\n2\n0\n0\n0\n1\n1\n0\n0\n0\n2\n2\n2\n1\n0\n1\n0\n2\n0\n0\n1\n0\n0\n0\n0\n1\n1\n1\n0\n0\n1\n0\n1\n0\n1\n0\n0\n1\n4\n2\n1\n0\n0\n3\n1\n0\n0\n0\n0\n1\n0\n4\n0\n2\n0\n0\n1\n1\n1\n0\n1\n4\n1\n0\n0\n5\n1\n0\n1\n0\n0\n0\n0\n1\n0\n0\n1\n0\n1\n0\n2\n4\n4\n0\n0\n0\n2\n0\n1\n0\n0\n0\n1\n1\n0\n1\n1\n0\n1\n1\n0\n0\n0\n0\n0\n5\n5\n0\n5\n0\n0\n6\n0\n7\n0\n1\n1\n1\n3\n1\n0\n1\n0\n1\n1\n1\n1\n1\n1\n2\n2\n1\n2\n0\n0\n0\n0\n0\n5\n4\n5\n3\n0\n0\n0\n2\n4\n0\n7\n0\n7\n0\n1\n0\n8\n7\n0\n0\n0\n9\n0\n0\n0\n0\n0\n1\n9\n4\n0\n4\n0\n0\n0\n0\n0\n0\n1\n1\n0\n1\n0\n1\n1\n0\n2\n1\n3\n2\n0\n0\n5\n0\n0\n0\n1\n0\n1\n1\n2\n0\n3\n0\n0\n0\n1\n3\n0\n0\n0\n0\n0\n0\n0\n6\n0\n6\n0\n0\n0\n6\n5\n6\n0\n0\n0\n4\n1\n0\n2\n1\n0\n0\n0\n0\n1\n2\n0\n0\n0\n0\n1\n0\n2\n0\n0\n0\n0\n1\n1\n0\n0\n0\n0\n1\n2\n0\n0\n0\n0\n3\n2\n2\n0\n0\n1\n0\n0\n5\n2\n0\n0\n0\n4\n0\n1\n0\n0\n0\n5\n0\n0\n0\n0\n1\n0\n2\n2\n1\n1\n1\n0\n1\n1\n0\n1\n1\n1\n1\n0\n3\n0\n1\n1\n1\n2\n0\n0\n1\n0\n2\n1\n0\n3\n0\n0\n0\n0\n2\n0\n0\n0\n2\n0\n2\n1\n1\n0\n0\n6\n0\n4\n0\n2\n1\n1\n0\n0\n1\n2\n1\n1\n0\n0\n0\n0\n0\n1\n1\n0\n0\n1\n1\n0\n2\n0\n0\n0\n0\n1\n0\n0\n3\n0\n3\n5\n0\n0\n0\n0\n7\n0\n0\n6\n0\n0\n0\n2\n0\n1\n0\n0\n0\n3\n0\n5\n1\n0\n5\n0\n4\n4\n3\n0\n1\n0\n0\n11\n8\n3\n2\n4\n0\n0\n3\n1\n5\n3\n0\n0\n0\n0\n4\n3\n2\n0\n0\n0\n0\n1\n1\n0\n2\n0\n0\n0\n0\n1\n1\n0\n0\n1\n0\n1\n0\n1\n0\n2\n0\n1\n1\n0\n1\n1\n0\n0\n1\n0\n1\n0\n0\n1\n0\n1\n1\n0\n1\n1\n0\n2\n3\n4\n0\n0\n0\n0\n3\n0\n0\n0\n3\n0\n2\n1\n1\n2\n1\n1\n0\n1\n0\n0\n2\n1\n1\n3\n1\n0\n1\n1\n1\n1\n1\n0\n1\n0\n0\n0\n0\n0\n2\n0\n0\n2\n0\n1\n0\n0\n2\n0\n0\n1\n3\n0\n0\n1\n1\n0\n0\n0\n0\n1\n0\n0\n1\n1\n2\n1\n0\n1\n0\n0\n0\n0\n0\n1\n0\n0\n0\n1\n0\n0\n0\n0\n0\n1\n0\n2\n0\n1\n1\n0\n1\n2\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n5\n2\n0\n3\n0\n1\n0\n0\n0\n2\n0\n2\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n3\n3\n0\n1\n0\n1\n0\n0\n0\n0\n1\n1\n0\n0\n0\n0\n2\n2\n0\n0\n2\n0\n1\n2\n0\n1\n3\n1\n1\n1\n1\n0\n0\n1\n2\n2\n1\n1\n2\n0\n1\n0\n0\n0\n2\n1\n2\n0\n1\n0\n1\n0\n1\n0\n1\n1\n2\n1\n0\n0\n1\n1\n0\n4\n0\n0\n1\n1\n1\n0\n1\n3\n0\n0\n2\n1\n0\n0\n0\n0\n0\n1\n1\n1\n0\n0\n0\n0\n1\n0\n2\n0\n0\n0\n0\n0\n0\n1\n1\n1\n0\n3\n1\n3\n0\n1\n1\n1\n2\n0\n1\n0\n2\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n1\n1\n0\n1\n0\n1\n1\n1\n1\n0\n0\n1\n0\n1\n0\n1\n1\n1\n0\n2\n1\n1\n0\n0\n1\n0\n2\n0\n0\n0\n0\n0\n1\n0\n2\n1\n0\n1\n1\n1\n1\n1\n1\n0\n0\n2\n0\n1\n2\n4\n0\n3\n4\n1\n0\n2\n1\n0\n2\n2\n0\n2\n1\n0\n1\n0\n1\n0\n0\n0\n0\n1\n1\n0\n4\n0\n5\n3\n0\n1\n1\n0\n1\n0\n1\n1\n0\n1\n2\n0\n1\n0\n3\n0\n1\n0\n1\n1\n0\n1\n0\n0\n1\n7\n0\n0\n1\n2\n0\n1\n2\n0\n0\n1\n1\n1\n0\n3\n2\n0\n0\n8\n0\n3\n0\n0\n0\n2\n0\n4\n0\n0\n0\n1\n3\n0\n0\n0\n1\n0\n0\n0\n0\n0\n3\n2\n0\n1\n1\n3\n2\n0\n0\n0\n1\n3\n4\n0\n1\n0\n0\n3\n0\n0\n2\n0\n2\n0\n2\n4\n2\n1\n1\n0\n1\n1\n4\n3\n0\n2\n1\n1\n3\n2\n0\n0\n1\n1\n2\n0\n2\n2\n0\n2\n0\n0\n0\n4\n0\n0\n3\n0\n0\n0\n2\n0\n6\n0\n5\n5\n0\n5\n0\n1\n0\n1\n1\n0\n5\n2\n4\n0\n1\n2\n2\n1\n2\n1\n0\n2\n0\n1\n1\n1\n1\n1\n1\n0\n2\n1\n2\n2\n0\n0\n1\n2\n0\n0\n1\n0\n2\n8\n0\n0\n6\n0\n7\n0\n0\n0\n1\n0\n1\n2\n1\n1\n0\n1\n0\n0\n0\n0\n4\n0\n1\n0\n1\n1\n0\n0\n3\n2\n0\n3\n0\n0\n0\n3\n0\n0\n4\n5\n0\n5\n0\n3\n0\n0\n1\n0\n1\n1\n1\n1\n0\n0\n1\n1\n0\n1\n1\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n1\n2\n1\n1\n1\n7\n0\n0\n2\n5\n0\n0\n5\n4\n0\n0\n3\n0\n0\n1\n3\n5\n7\n0\n4\n0\n4\n0\n0\n0\n0\n0\n0\n3\n1\n1\n0\n0\n1\n0\n0\n4\n0\n0\n3\n5\n4\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n1\n1\n0\n0\n1\n0\n0\n0\n1\n2\n1\n0\n0\n0\n0\n4\n0\n4\n6\n0\n0\n4\n0\n1\n0\n1\n1\n0\n0\n1\n0\n0\n1\n0\n1\n0\n1\n0\n1\n1\n2\n0\n2\n2\n0\n1\n1\n1\n1\n2\n2\n0\n2\n2\n3\n0\n2\n0\n0\n0\n0\n3\n3\n1\n1\n2\n0\n4\n6\n0\n0\n0\n0\n1\n1\n0\n0\n5\n0\n2\n3\n0\n0\n6\n0\n0\n1\n0\n1\n1\n1\n0\n1\n0\n0\n0\n1\n0\n1\n1\n0\n2\n0\n0\n1\n1\n1\n1\n0\n0\n0\n0\n0\n1\n0\n1\n1\n2\n0\n2\n2\n2\n1\n0\n1\n1\n1\n2\n0\n1\n0\n0\n0\n0\n0\n1\n1\n0\n0\n0\n0\n3\n2\n0\n0\n0\n0\n0\n1\n0\n2\n0\n0\n3\n0\n0\n0\n0\n2\n0\n1\n1\n3\n1\n0\n0\n0\n3\n0\n1\n0\n3\n0\n2\n3\n1\n1\n1\n1\n0\n2\n0\n1\n2\n0\n0\n0\n0\n2\n1\n3\n1\n0\n1\n1\n0\n0\n5\n4\n0\n1\n2\n0\n4\n0\n1\n0\n1\n7\n0\n0\n0\n2\n2\n0\n3\n2\n0\n2\n0\n0\n0\n0\n2\n0\n0\n2\n2\n1\n1\n1\n3\n3\n0\n1\n4\n1\n0\n1\n1\n0\n1\n1\n0\n0\n2\n0\n0\n0\n6\n0\n2\n2\n2\n1\n0\n0\n0\n0\n3\n0\n1\n2\n0\n0\n0\n1\n2\n3\n0\n0\n0\n0\n0\n2\n4\n3\n0\n4\n0\n2\n0\n0\n0\n2\n4\n1\n1\n0\n0\n1\n0\n1\n1\n1\n1\n0\n1\n0\n0\n1\n1\n0\n0\n0\n0\n0\n1\n2\n1\n0\n2\n4\n4\n0\n0\n5\n0\n0\n4\n2\n2\n0\n1\n3\n0\n2\n1\n0\n1\n1\n0\n0\n1\n0\n0\n2\n0\n0\n2\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n1\n1\n1\n0\n1\n1\n0\n1\n0\n0\n0\n1\n0\n0\n2\n0\n3\n3\n0\n0\n2\n0\n0\n2\n0\n1\n0\n0\n0\n1\n1\n0\n0\n1\n4\n0\n0\n2\n2\n1\n1\n0\n0\n2\n0\n1\n0\n0\n1\n1\n2\n0\n0\n0\n1\n2\n0\n2\n3\n3\n5\n7\n1\n0\n5\n0\n0\n2\n4\n2\n0\n0\n1\n0\n0\n0\n2\n0\n0\n4\n3\n0\n0\n1\n1\n1\n1\n1\n1\n0\n0\n0\n1\n1\n0\n0\n0\n0\n0\n2\n0\n0\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n1\n1\n0\n1\n3\n1\n1\n0\n1\n1\n0\n0\n1\n1\n0\n1\n1\n0\n0\n1\n1\n1\n0\n0\n1\n1\n0\n2\n0\n0\n0\n0\n0\n0\n1\n0\n1\n0\n0\n1\n0\n3\n0\n0\n0\n0\n1\n1\n0\n0\n0\n1\n0\n1\n1\n0\n0\n0\n1\n0\n1\n1\n2\n0\n0\n2\n0\n1\n1\n1\n1\n0\n0\n0\n2\n1\n0\n0\n1\n1\n1\n0\n0\n1\n0\n4\n0\n1\n0\n1\n1\n1\n0\n1\n0\n0\n0\n1\n0\n0\n2\n2\n0\n5\n3\n5\n0\n0\n0\n0\n0\n0\n0\n0\n2\n0\n3\n0\n0\n0\n0\n0\n0\n2\n0\n1\n0\n0\n1\n1\n0\n1\n0\n1\n2\n0\n4\n0\n0\n0\n1\n0\n1\n2\n3\n0\n0\n0\n4\n1\n2\n0\n2\n0\n1\n0\n1\n2\n0\n0\n2\n1\n1\n2\n2\n1\n0\n2\n1\n3\n2\n5\n4\n0\n0\n1\n0\n1\n1\n1\n0\n0\n1\n1\n1\n1\n2\n0\n0\n1\n0\n1\n1\n1\n0\n1\n1\n1\n2\n2\n0\n0\n1\n1\n1\n0\n1\n0\n1\n1\n0\n2\n0\n0\n0\n2\n1\n0\n1\n1\n1\n0\n1\n0\n4\n4\n4\n7\n0\n0\n0\n0\n1\n0\n9\n1\n0\n10\n11\n0\n2\n1\n0\n0\n1\n3\n1\n2\n1\n0\n1\n0\n0\n0\n0\n1\n0\n1\n1\n1\n0\n0\n0\n0\n0\n1\n1\n1\n2\n2\n2\n0\n2\n0\n0\n4\n0\n0\n0\n0\n1\n0\n5\n3\n0\n3\n3\n0\n3\n0\n4\n3\n6\n0\n0\n0\n1\n0\n0\n3\n3\n7\n5\n0\n1\n0\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n2\n0\n1\n1\n0\n0\n0\n0\n4\n0\n1\n1\n0\n1\n1\n0\n0\n1\n3\n0\n0\n0\n0\n0\n0\n2\n3\n2\n0\n2\n2\n0\n0\n0\n1\n1\n2\n0\n1\n1\n0\n2\n0\n2\n0\n0\n0\n1\n1\n0\n0\n1\n2\n0\n0\n0\n2\n0\n2\n2\n0\n3\n3\n0\n0\n2\n0\n3\n3\n0\n2\n3\n2\n2\n0\n0\n1\n1\n1\n0\n4\n2\n0\n2\n2\n0\n0\n0\n1\n0\n0\n3\n0\n0\n2\n1\n0\n2\n0\n3\n0\n4\n2\n0\n0\n5\n5\n0\n0\n6\n0\n0\n0\n0\n0\n0\n1\n0\n1\n1\n1\n1\n0\n1\n0\n4\n1\n0\n5\n0\n0\n0\n7\n0\n2\n0\n4\n0\n0\n0\n2\n1\n0\n0\n1\n0\n1\n0\n3\n3\n2\n0\n2\n0\n6\n0\n0\n7\n5\n6\n0\n0\n1\n0\n1\n0\n0\n2\n0\n3\n0\n4\n0\n4\n0\n0\n0\n1\n0\n0\n5\n1\n0\n0\n1\n0\n0\n1\n2\n2\n3\n2\n0\n0\n0\n0\n1\n0\n1\n2\n0\n0\n0\n0\n0\n4\n0\n0\n0\n0\n1\n0\n3\n0\n2\n4\n5\n0\n0\n2\n1\n6\n2\n2\n1\n0\n0\n0\n0\n0\n0\n1\n1\n2\n0\n1\n0\n3\n0\n0\n0\n0\n2\n2\n3\n2\n1\n0\n1\n0\n0\n0\n0\n0\n0\n0\n4\n6\n5\n1\n0\n0\n1\n0\n1\n1\n0\n0\n0\n0\n2\n0\n0\n0\n0\n1\n1\n1\n4\n2\n2\n0\n1\n0\n2\n1\n0\n0\n1\n0\n1\n1\n1\n1\n0\n1\n0\n1\n2\n0\n1\n0\n0\n0\n0\n0\n0\n3\n2\n0\n7\n6\n2\n0\n2\n1\n1\n0\n0\n0\n0\n2\n0\n2\n0\n0\n0\n0\n2\n1\n0\n1\n1\n1\n1\n0\n0\n0\n0\n0\n2\n3\n0\n4\n0\n2\n1\n1\n4\n0\n0\n0\n0\n2\n0\n1\n0\n0\n1\n1\n3\n0\n0\n3\n1\n0\n0\n1\n2\n0\n0\n2\n2\n0\n2\n0\n0\n1\n1\n0\n0\n0\n2\n0\n0\n2\n1\n2\n1\n1\n1\n2\n0\n0\n1\n0\n0\n0\n0\n0\n0\n4\n0\n0\n2\n0\n4\n1\n1\n2\n1\n0\n0\n1\n0\n4\n1\n0\n1\n0\n2\n3\n1\n2\n0\n3\n0\n1\n0\n1\n0\n2\n3\n0\n0\n1\n0\n0\n0\n0\n0\n1\n1\n1\n0\n1\n1\n1\n0\n0\n1\n0\n0\n1\n0\n1\n1\n1\n0\n0\n1\n0\n1\n0\n0\n0\n0\n0\n1\n0\n1\n2\n2\n3\n3\n1\n0\n1\n2\n2\n1\n0\n0\n0\n0\n1\n3\n6\n1\n0\n0\n1\n0\n1\n1\n1\n1\n1\n0\n0\n0\n0\n3\n1\n0\n1\n0\n1\n0\n1\n0\n1\n1\n2\n0\n2\n0\n0\n3\n1\n3\n1\n1\n1\n2\n1\n1\n0\n0\n0\n1\n0\n0\n2\n2\n0\n3\n3\n1\n3\n0\n0\n0\n4\n0\n1\n6\n6\n0\n1\n1\n1\n2\n2\n0\n3\n3\n1\n1\n0\n3\n4\n0\n1\n2\n0\n2\n0\n1\n2\n0\n3\n5\n4\n0\n0\n0\n1\n0\n3\n2\n0\n4\n2\n0\n4\n1\n0\n0\n2\n2\n0\n2\n6\n2\n0\n3\n3\n6\n5\n0\n0\n4\n0\n0\n0\n0\n6\n6\n10\n2\n0\n2\n0\n0\n1\n2\n0\n0\n0\n1\n1\n0\n0\n0\n0\n0\n1\n0\n1\n0\n1\n4\n0\n1\n2\n1\n1\n2\n0\n0\n0\n4\n0\n3\n5\n0\n0\n0\n0\n0\n0\n2\n2\n4\n1\n1\n1\n2\n5\n0\n1\n1\n3\n0\n0\n0\n0\n1\n1\n1\n1\n0\n0\n2\n0\n1\n3\n0\n4\n0\n0\n0\n1\n0\n1\n1\n0\n1\n1\n0\n0\n1\n0\n0\n0\n0\n2\n3\n0\n2\n1\n1\n0\n0\n1\n1\n0\n0\n2\n0\n0\n0\n1\n0\n1\n1\n2\n1\n4\n2\n0\n0\n0\n2\n0\n0\n2\n0\n0\n1\n1\n0\n0\n0\n1\n1\n0\n0\n2\n0\n1\n0\n0\n0\n3\n0\n1\n1\n1\n1\n2\n0\n3\n0\n1\n0\n3\n2\n0\n1\n0\n0\n2\n0\n0\n2\n2\n0\n0\n1\n3\n3\n0\n0\n2\n2\n1\n2\n0\n4\n0\n1\n4\n0\n2\n0\n0\n1\n0\n0\n0\n1\n0\n1\n0\n3\n0\n0\n1\n0\n1\n1\n0\n1\n1\n0\n1\n0\n1\n1\n0\n0\n2\n0\n1\n1\n0\n0\n0\n1\n1\n1\n0\n3\n1\n1\n0\n3\n1\n3\n1\n0\n0\n7\n1\n2\n2\n0\n1\n0\n0\n0\n2\n0\n1\n0\n0\n0\n2\n0\n1\n1\n1\n0\n1\n1\n0\n0\n1\n1\n3\n0\n0\n0\n1\n0\n0\n2\n1\n0\n1\n4\n0\n0\n2\n0\n0\n0\n0\n0\n0\n0\n0\n1\n0\n1\n1\n0\n0\n0\n0\n1\n0\n1\n0\n1\n0\n0\n0\n4\n0\n3\n0\n0\n2\n0\n1\n0\n2\n3\n0\n0\n3\n1\n0\n0\n0\n1\n0\n0\n1\n0\n2\n2\n0\n0\n2\n2\n0\n0\n0\n5\n0\n5\n0\n0\n0\n0\n1\n0\n6\n2\n0\n0\n0\n0\n0\n0\n1\n3\n2\n0\n2\n8\n6\n4\n0\n0\n2\n0\n0\n1\n2\n3\n0\n0\n0\n1\n0\n1\n0\n2\n1\n0\n0\n1\n4\n1\n0\n0\n1\n1\n0\n2\n2\n1\n0\n0\n1\n2\n0\n0\n3\n0\n4\n0\n0\n2\n6\n2\n0\n0\n4\n5\n1\n0\n0\n0\n4\n0\n0\n1\n0\n0\n3\n0\n1\n1\n0\n0\n2\n2\n0\n0\n3\n0\n1\n0\n0\n2\n1\n0\n0\n2\n1\n1\n0\n2\n1\n1\n0\n2\n0\n0\n1\n2\n1\n2\n3\n1\n0\n0\n1\n7\n0\n2\n1\n0\n0\n0\n0\n0\n3\n3\n2\n0\n1\n0\n0\n0\n0\n0\n0\n1\n0\n2\n1\n1\n0\n1\n0\n0\n0\n1\n0\n2\n4\n0\n0\n0\n0\n0\n2\n1\n0\n1\n2\n2\n1\n1\n0\n0\n2\n3\n2\n3\n1\n3\n0\n0\n1\n1\n0\n2\n0\n0\n0\n1\n1\n0\n0\n2\n0\n2\n2\n0\n2\n0\n0\n1\n2\n0\n1\n1\n1\n1\n0\n0\n0\n1\n2\n0\n3\n0\n7\n0\n1\n1\n0\n2\n1\n0\n0\n0\n0\n4\n1\n0\n0\n0\n0\n5\n2\n0\n2\n0\n1\n1\n2\n1\n0\n0\n0\n1\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n1\n0\n1\n0\n0\n2\n0\n2\n1\n0\n0\n0\n1\n1\n1\n1\n0\n0\n0\n1\n0\n1\n0\n0\n0\n0\n0\n0\n0\n4\n0\n1\n0\n0\n2\n0\n1\n0\n2\n0\n2\n1\n0\n0\n0\n1\n0\n2\n0\n1\n1\n0\n3\n4\n0\n0\n0\n3\n4\n0\n0\n0\n1\n2\n2\n2\n0\n0\n0\n0\n0\n1\n0\n2\n2\n0\n1\n1\n1\n2\n2\n2\n3\n4\n0\n1\n0\n2\n2\n2\n2\n3\n1\n0\n2\n5\n0\n0\n1\n0\n0\n0\n0\n1\n3\n1\n3\n0\n0\n0\n0\n0\n5\n1\n0\n0\n2\n0\n0\n0\n1\n1\n1\n0\n2\n2\n1\n0\n2\n0\n0\n2\n2\n1\n0\n0\n3\n2\n1\n1\n2\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n1\n0\n1\n1\n1\n1\n1\n0\n1\n0\n1\n1\n0\n0\n0\n0\n1\n0\n0\n0\n1\n1\n1\n1\n0\n0\n0\n0\n0\n0\n3\n0\n0\n0\n4\n4\n0\n5\n0\n3\n5\n0\n0\n1\n1\n0\n6\n0\n0\n0\n0\n3\n0\n2\n7\n7\n0\n7\n1\n1\n0\n1\n0\n1\n1\n1\n1\n0\n0\n0\n1\n0\n0\n0\n1\n1\n2\n0\n0\n0\n0\n0\n0\n1\n0\n0\n2\n2\n0\n0\n2\n0\n0\n0\n0\n3\n5\n0\n3\n0\n6\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n4\n0\n0\n3\n0\n0\n0\n1\n0\n1\n0\n0\n0\n1\n1\n0\n1\n0\n1\n0\n1\n0\n0\n0\n1\n0\n1\n0\n7\n0\n0\n5\n6\n0\n1\n6\n1\n1\n1\n0\n1\n0\n0\n1\n1\n1\n0\n0\n0\n1\n2\n0\n0\n0\n0\n1\n0\n1\n0\n1\n0\n2\n3\n6\n0\n0\n3\n3\n2\n5\n0\n0\n4\n0\n0\n0\n0\n2\n0\n0\n1\n1\n0\n0\n1\n2\n3\n3\n0\n0\n2\n1\n1\n0\n0\n0\n0\n0\n2\n0\n2\n0\n0\n0\n0\n3\n0\n0\n0\n5\n6\n0\n1\n0\n0\n0\n1\n0\n3\n3\n0\n0\n4\n1\n4\n0\n1\n0\n0\n0\n1\n1\n3\n2\n2\n2\n1\n0\n0\n0\n1\n0\n0\n0\n2\n0\n2\n0\n0\n2\n4\n0\n2\n2\n0\n2\n2\n3\n0\n2\n3\n0\n1\n0\n0\n1\n0\n0\n1\n2\n2\n0\n0\n1\n1\n1\n0\n1\n0\n0\n0\n0\n2\n0\n0\n1\n0\n0\n1\n0\n2\n2\n0\n0\n3\n0\n3\n2\n0\n3\n0\n0\n0\n0\n0\n0\n4\n0\n0\n0\n4\n1\n0\n0\n0\n1\n5\n0\n0\n0\n0\n2\n0\n3\n1\n0\n2\n0\n0\n0\n2\n0\n2\n0\n5\n0\n0\n0\n0\n1\n1\n1\n0\n2\n0\n0\n2\n0\n3\n3\n3\n0\n2\n1\n0\n1\n1\n1\n0\n1\n1\n2\n1\n5\n0\n0\n0\n5\n2\n0\n0\n7\n1\n1\n1\n0\n0\n0\n1\n0\n1\n2\n0\n2\n4\n4\n4\n2\n0\n0\n0\n2\n0\n2\n0\n0\n0\n0\n1\n0\n0\n0\n0\n2\n0\n0\n0\n0\n2\n1\n3\n4\n0\n1\n1\n0\n2\n1\n1\n0\n2\n0\n2\n0\n1\n1\n1\n2\n4\n2\n4\n4\n7\n0\n2\n0\n1\n0\n1\n4\n0\n0\n0\n2\n0\n2\n2\n2\n0\n2\n4\n1\n0\n1\n0\n1\n1\n1\n1\n0\n0\n0\n0\n1\n2\n0\n0\n0\n0\n0\n0\n3\n0\n1\n2\n2\n0\n0\n0\n0\n0\n7\n0\n1\n0\n0\n0\n0\n0\n1\n0\n0\n3\n5\n4\n0\n1\n0\n1\n0\n0\n0\n1\n3\n1\n0\n0\n0\n0\n0\n1\n5\n2\n2\n0\n1\n2\n0\n2\n0\n0\n0\n0\n0\n6\n0\n0\n3\n0\n1\n0\n1\n2\n1\n0\n6\n2\n2\n0\n0\n3\n0\n1\n1\n0\n0\n0\n1\n1\n0\n0\n0\n0\n1\n0\n0\n1\n1\n0\n1\n0\n1\n1\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n2\n2\n0\n0\n1\n3\n2\n3\n2\n0\n0\n0\n0\n2\n1\n3\n1\n2\n0\n0\n0\n1\n1\n1\n0\n0\n1\n3\n0\n0\n0\n0\n2\n1\n2\n4\n0\n0\n1\n1\n0\n2\n0\n0\n0\n0\n0\n1\n2\n0\n2\n1\n0\n1\n3\n0\n0\n0\n1\n0\n0\n3\n0\n6\n0\n6\n0\n6\n0\n0\n0\n2\n0\n0\n0\n5\n0\n3\n1\n0\n1\n1\n1\n1\n1\n0\n0\n0\n3\n0\n0\n2\n0\n2\n0\n2\n1\n4\n0\n0\n1\n0\n0\n0\n3\n1\n1\n9\n0\n0\n1\n0\n0\n5\n0\n0\n1\n1\n3\n0\n4\n2\n2\n0\n1\n0\n1\n0\n1\n0\n1\n1\n0\n1\n0\n10\n0\n0\n0\n3\n0\n0\n0\n2\n3\n2\n0\n0\n0\n3\n0\n0\n0\n0\n1\n1\n0\n0\n0\n2\n1\n3\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n2\n4\n1\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n2\n0\n2\n0\n0\n0\n1\n1\n0\n0\n1\n0\n2\n0\n1\n0\n0\n1\n0\n0\n0\n1\n2\n0\n0\n0\n0\n0\n1\n4\n0\n0\n0\n0\n0\n2\n3\n0\n1\n2\n4\n2\n0\n0\n0\n2\n0\n0\n2\n3\n3\n0\n0\n1\n0\n4\n0\n2\n0\n0\n1\n2\n3\n3\n4\n0\n3\n0\n0\n4\n2\n3\n2\n0\n0\n0\n0\n0\n1\n0\n3\n0\n0\n0\n0\n3\n3\n2\n2\n1\n3\n0\n1\n0\n0\n1\n3\n5\n0\n5\n0\n5\n1\n0\n0\n1\n0\n0\n1\n0\n0\n1\n0\n0\n1\n0\n0\n0\n0\n1\n2\n0\n2\n3\n0\n0\n1\n0\n1\n0\n1\n2\n0\n0\n0\n0\n0\n0\n2\n0\n3\n1\n0\n1\n0\n0\n0\n0\n0\n0\n5\n2\n5\n0\n0\n0\n5\n0\n0\n5\n3\n0\n0\n7\n0\n4\n1\n1\n0\n0\n0\n1\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n2\n3\n1\n0\n4\n0\n0\n2\n1\n2\n4\n0\n0\n0\n2\n0\n0\n0\n3\n3\n0\n5\n3\n2\n2\n1\n2\n0\n0\n1\n0\n0\n8\n2\n3\n0\n1\n0\n0\n0\n0\n2\n0\n6\n0\n0\n7\n0\n3\n5\n0\n3\n5\n0\n4\n0\n0\n0\n6\n1\n0\n0\n0\n1\n0\n0\n1\n0\n0\n5\n1\n1\n0\n2\n1\n1\n0\n0\n2\n0\n4\n0\n0\n0\n0\n0\n1\n0\n0\n0\n5\n6\n0\n5\n0\n1\n2\n1\n0\n1\n1\n1\n1\n0\n1\n2\n2\n1\n1\n2\n1\n1\n3\n0\n0\n0\n0\n0\n0\n1\n0\n0\n1\n1\n0\n1\n1\n3\n0\n4\n0\n1\n1\n0\n4\n0\n0\n4\n1\n0\n0\n2\n5\n6\n6\n0\n2\n2\n0\n0\n2\n1\n0\n1\n0\n0\n0\n0\n0\n2\n3\n2\n1\n0\n0\n2\n0\n0\n0\n3\n0\n3\n0\n0\n0\n0\n1\n2\n0\n0\n2\n0\n1\n0\n1\n1\n0\n0\n0\n0\n0\n0\n1\n0\n0\n3\n0\n0\n1\n1\n1\n0\n1\n1\n2\n0\n2\n3\n0\n0\n2\n3\n0\n0\n4\n3\n4\n0\n1\n0\n1\n1\n0\n0\n2\n2\n0\n1\n0\n0\n0\n2\n0\n0\n0\n2\n0\n3\n4\n0\n4\n0\n1\n1\n0\n0\n1\n1\n3\n2\n1\n0\n3\n0\n0\n0\n0\n0\n3\n0\n0\n1\n1\n2\n2\n1\n1\n0\n3\n1\n2\n3\n2\n1\n1\n1\n1\n0\n0\n1\n0\n1\n0\n1\n0\n1\n2\n0\n2\n2\n2\n2\n0\n1\n0\n2\n0\n0\n0\n2\n2\n1\n1\n1\n0\n0\n3\n0\n0\n0\n0\n0\n0\n1\n0\n1\n0\n0\n1\n2\n0\n0\n4\n0\n2\n0\n1\n0\n1\n0\n3\n5\n1\n0\n4\n8\n0\n4\n8\n5\n0\n0\n6\n0\n0\n1\n2\n1\n0\n1\n3\n0\n0\n0\n1\n1\n0\n0\n0\n2\n0\n0\n4\n0\n4\n0\n0\n0\n0\n6\n0\n0\n0\n0\n2\n1\n0\n1\n0\n0\n0\n1\n0\n0\n8\n4\n0\n2\n0\n0\n4\n0\n5\n0\n0\n0\n1\n1\n2\n2\n2\n0\n1\n0\n1\n1\n1\n0\n0\n1\n0\n1\n0\n0\n1\n0\n0\n0\n0\n3\n1\n0\n0\n0\n0\n0\n0\n0\n1\n1\n1\n2\n2\n2\n0\n0\n2\n0\n3\n0\n0\n1\n1\n0\n0\n2\n0\n2\n2\n1\n0\n0\n1\n0\n1\n0\n3\n0\n1\n0\n2\n4\n4\n0\n1\n0\n4\n0\n4\n5\n1\n2\n0\n1\n2\n1\n0\n0\n0\n0\n0\n1\n2\n0\n1\n0\n2\n0\n0\n0\n1\n0\n0\n1\n3\n1\n0\n0\n0\n1\n1\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n0\n1\n1\n1\n2\n0\n0\n2\n2\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n0\n0\n0\n3\n0\n2\n0\n4\n1\n4\n0\n0\n2\n4\n0\n0\n0\n1\n0\n2\n0\n2\n0\n0\n1\n1\n0\n2\n1\n2\n1\n0\n0\n1\n3\n0\n0\n3\n1\n0\n1\n1\n1\n2\n0\n1\n0\n0\n1\n0\n0\n2\n0\n0\n0\n2\n0\n2\n5\n0\n4\n0\n0\n0\n3\n3\n0\n0\n2\n0\n0\n1\n1\n0\n0\n0\n1\n3\n0\n2\n1\n0\n0\n0\n1\n1\n0\n4\n0\n0\n0\n0\n0\n3\n0\n1\n0\n0\n0\n0\n0\n5\n0\n0\n3\n1\n3\n0\n1\n0\n1\n0\n0\n3\n2\n5\n0\n5\n0\n0\n0\n0\n0\n0\n7\n7\n2\n0\n3\n0\n0\n8\n0\n11\n1\n7\n0\n0\n0\n0\n0\n1\n2\n2\n2\n0\n0\n2\n0\n1\n1\n0\n2\n1\n0\n0\n0\n0\n1\n4\n0\n0\n0\n2\n4\n2\n0\n2\n0\n3\n0\n0\n4\n0\n0\n1\n0\n8\n0\n5\n9\n2\n2\n0\n0\n1\n0\n3\n2\n3\n0\n0\n0\n1\n4\n2\n1\n4\n5\n0\n0\n0\n1\n0\n1\n1\n1\n2\n0\n0\n1\n1\n0\n1\n2\n0\n0\n0\n0\n2\n2\n0\n0\n0\n1\n0\n1\n0\n0\n1\n1\n1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n3\n4\n2\n2\n0\n1\n0\n2\n3\n0\n1\n1\n0\n3\n0\n0\n0\n0\n0\n0\n0\n0\n2\n1\n2\n3\n0\n0\n0\n4\n4\n1\n0\n0\n4\n0\n0\n0\n4\n0\n5\n0\n0\n1\n4\n0\n2\n0\n3\n3\n0\n0\n0\n0\n7\n0\n6\n0\n2\n7\n1\n0\n0\n0\n0\n0\n1\n1\n0\n1\n0\n0\n1\n1\n1\n0\n0\n0\n0\n1\n0\n3\n1\n1\n0\n1\n0\n0\n3\n0\n4\n4\n0\n0\n0\n0\n3\n0\n0\n2\n2\n1\n1\n1\n2\n2\n1\n0\n1\n0\n5\n0\n0\n4\n0\n4\n0\n0\n1\n3\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n2\n1\n0\n0\n0\n0\n1\n0\n0\n1\n0\n4\n6\n1\n0\n5\n3\n0\n4\n0\n1\n0\n0\n1\n0\n1\n2\n3\n0\n3\n1\n1\n1\n0\n0\n2\n0\n0\n0\n3\n0\n2\n1\n0\n0\n4\n4\n0\n2\n0\n0\n2\n3\n0\n2\n1\n1\n0\n0\n0\n1\n0\n1\n0\n0\n0\n3\n3\n0\n4\n4\n3\n0\n2\n2\n1\n0\n4\n0\n0\n0\n0\n0\n1\n0\n1\n0\n1\n0\n0\n0\n1\n0\n1\n3\n0\n1\n1\n0\n3\n1\n0\n0\n0\n0\n0\n0\n0\n1\n1\n0\n0\n0\n0\n0\n1\n0\n0\n1\n1\n0\n2\n0\n2\n1\n1\n0\n2\n3\n0\n0\n0\n1\n0\n0\n1\n1\n2\n0\n0\n3\n1\n1\n0\n0\n0\n3\n2\n2\n0\n0\n0\n0\n0\n0\n0\n0\n0\n5\n2\n0\n0\n0\n0\n1\n1\n4\n2\n0\n0\n0\n3\n3\n0\n6\n2\n1\n0\n5\n0\n8\n0\n10\n5\n0\n0\n1\n1\n1\n2\n1\n0\n0\n1\n2\n1\n1\n3\n0\n1\n0\n0\n1\n0\n0\n1\n1\n1\n1\n1\n0\n0\n0\n1\n2\n0\n0\n3\n1\n1\n0\n1\n2\n0\n0\n0\n0\n5\n2\n0\n0\n2\n2\n0\n2\n2\n0\n1\n0\n3\n0\n3\n0\n0\n2\n0\n1\n0\n0\n0\n1\n0\n0\n6\n1\n1\n0\n3\n0\n0\n0\n3\n0\n1\n1\n1\n6\n1\n0\n1\n2\n0\n2\n5\n4\n0\n4\n4\n0\n2\n0\n0\n2\n3\n2\n0\n3\n3\n1\n1\n1\n1\n0\n0\n0\n1\n1\n0\n1\n2\n0\n0\n0\n0\n0\n3\n0\n0\n6\n2\n0\n0\n4\n3\n0\n0\n0\n0\n1\n0\n6\n1\n0\n0\n6\n1\n1\n0\n0\n0\n7\n0\n0\n2\n0\n0\n0\n0\n1\n1\n0\n0\n0\n0\n1\n0\n1\n1\n1\n0\n1\n1\n0\n0\n0\n1\n0\n1\n2\n1\n1\n2\n1\n1\n0\n0\n0\n2\n0\n3\n3\n0\n4\n0\n5\n1\n0\n0\n0\n1\n2\n0\n0\n4\n4\n1\n1\n3\n1\n1\n0\n0\n0\n1\n1\n1\n1\n1\n1\n1\n0\n1\n0\n1\n0\n0\n0\n0\n0\n1\n6\n1\n0\n1\n1\n0\n2\n0\n2\n0\n1\n1\n0\n0\n4\n0\n0\n0\n0\n0\n0\n1\n0\n3\n4\n3\n0\n3\n0\n0\n0\n5\n0\n6\n0\n4\n7\n2\n0\n4\n5\n7\n0\n0\n5\n5\n5\n0\n0\n0\n0\n1\n1\n0\n0\n1\n1\n1\n1\n1\n1\n2\n0\n0\n2\n1\n1\n1\n1\n0\n1\n0\n1\n0\n4\n0\n0\n0\n0\n1\n0\n1\n2\n0\n0\n0\n1\n1\n1\n1\n2\n0\n0\n1\n0\n1\n1\n1\n1\n0\n1\n0\n0\n1\n0\n0\n0\n0\n2\n0\n0\n0\n0\n0\n0\n2\n0\n2\n0\n2\n1\n0\n2\n0\n1\n0\n1\n1\n0\n0\n3\n1\n2\n2\n0\n0\n1\n3\n0\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n1\n1\n1\n1\n0\n1\n0\n0\n1\n0\n3\n1\n1\n0\n0\n1\n0\n2\n0\n0\n3\n0\n0\n1\n0\n0\n1\n0\n1\n3\n0\n0\n1\n0\n0\n0\n1\n0\n2\n0\n0\n0\n1\n0\n2\n2\n0\n3\n0\n1\n0\n0\n0\n0\n1\n2\n0\n1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n2\n0\n3\n0\n0\n2\n3\n0\n5\n0\n4\n0\n0\n1\n4\n1\n5\n1\n2\n0\n3\n0\n0\n0\n1\n0\n4\n2\n2\n4\n0\n1\n0\n0\n0\n0\n0\n2\n0\n2\n0\n0\n4\n1\n0\n0\n1\n1\n0\n0\n0\n0\n0\n0\n0\n2\n0\n0\n0\n0\n1\n2\n1\n0\n0\n1\n0\n0\n0\n0\n0\n5\n5\n1\n3\n0\n4\n0\n5\n5\n0\n0\n0\n6\n0\n0\n1\n1\n0\n2\n0\n2\n2\n2\n1\n0\n0\n0\n1\n1\n1\n1\n1\n1\n1\n0\n1\n0\n0\n1\n0\n1\n1\n0\n0\n1\n1\n0\n0\n1\n0\n0\n0\n0\n0\n0\n0\n1\n1\n0\n1\n0\n5\n0\n2\n2\n3\n0\n4\n0\n4\n0\n0\n0\n2\n0\n0\n6\n0\n3\n1\n0\n2\n0\n0\n3\n6\n0\n4\n0\n1\n0\n0\n0\n0\n0\n5\n0\n1\n0\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n1\n0\n0\n1\n1\n1\n0\n0\n0\n0\n1\n0\n0\n2\n0\n0\n1\n0\n1\n1\n1\n1\n1\n0\n1\n0\n0\n0\n1\n4\n0\n0\n0\n0\n1\n1\n2\n2\n1\n0\n3\n0\n0\n1\n0\n0\n6\n0\n0\n0\n2\n0\n0\n0\n0\n7\n9\n4\n6\n2\n8\n1\n0\n0\n10\n0\n0\n1\n4\n7\n1\n1\n1\n11\n0\n3\n2\n3\n0\n1\n12\n0\n0\n0\n0\n4\n3\n1\n1\n0\n1\n1\n2\n2\n3\n0\n0\n0\n6\n0\n0\n5\n0\n0\n0\n4\n0\n1\n0\n2\n1\n1\n1\n1\n2\n0\n2\n6\n0\n0\n3\n0\n0\n5\n6\n0\n7\n0\n0\n0\n1\n1\n5\n0\n0\n1\n0\n2\n2\n1\n1\n0\n0\n0\n0\n2\n0\n0\n1\n0\n0\n1\n1\n0\n0\n0\n3\n2\n0\n0\n0\n0\n0\n1\n7\n3\n0\n0\n0\n0\n1\n1\n9\n0\n0\n0\n0\n1\n1\n0\n0\n4\n0\n0\n0\n2\n0\n0\n5\n0\n3\n0\n0\n0\n0\n0\n0\n0\n1\n1\n0\n1\n1\n0\n1\n3\n3\n3\n2\n2\n0\n1\n0\n1\n0\n0\n0\n0\n2\n3\n0\n0\n0\n3\n0\n0\n0\n0\n3\n1\n1\n1\n3\n0\n0\n2\n1\n0\n2\n1\n0\n6\n2\n0\n0\n0\n0\n2\n0\n1\n1\n3\n0\n0\n4\n0\n2\n1\n0\n1\n1\n0\n3\n2\n1\n0\n0\n0\n4\n0\n0\n2\n0\n0\n2\n3\n0\n0\n6\n0\n3\n0\n0\n2\n1\n1\n4\n1\n4\n0\n0\n0\n4\n0\n2\n1\n0\n2\n0\n1\n1\n2\n0\n4\n0\n0\n0\n1\n0\n0\n0\n0\n2\n0\n2\n1\n2\n0\n2\n2\n0\n2\n3\n1\n0\n1\n0\n0\n2\n1\n1\n0\n1\n1\n1\n1\n2\n3\n4\n0\n1\n2\n1\n2\n1\n0\n2\n0\n0\n2\n0\n3\n3\n3\n1\n0\n1\n0\n0\n0\n0\n1\n1\n0\n1\n0\n0\n3\n2\n0\n0\n0\n0\n1\n1\n0\n2\n0\n0\n0\n1\n0\n0\n3\n1\n0\n2\n0\n0\n0\n1\n1\n1\n1\n0\n4\n0\n5\n0\n0\n0\n2\n2\n0\n0\n4\n4\n0\n1\n0\n1\n0\n1\n0\n1\n0\n1\n1\n0\n0\n0\n2\n0\n0\n0\n0\n1\n1\n1\n0\n0\n0\n0\n1\n0\n0\n3\n0\n1\n0\n0\n2\n0\n2\n0\n2\n0\n0\n2\n3\n2\n2\n2\n0\n1\n1\n0\n0\n1\n0\n1\n1\n0\n0\n1\n0\n0\n0\n0\n1\n0\n1\n1\n0\n0\n0\n0\n3\n5\n2\n2\n0\n0\n0\n1\n0\n1\n0\n1\n1\n0\n1\n0\n0\n0\n0\n2\n1\n1\n0\n3\n2\n3\n1\n3\n0\n1\n0\n2\n2\n0\n2\n4\n0\n0\n1\n7\n2\n0\n1\n0\n1\n0\n2\n5\n0\n5\n0\n0\n0\n1\n0\n1\n2\n1\n0\n2\n0\n0\n3\n0\n0\n0\n7\n0\n2\n1\n0\n0\n0\n2\n0\n0\n0\n0\n0\n0\n0\n3\n2\n0\n2\n2\n3\n0\n2\n1\n0\n2\n2\n2\n0\n7\n0\n0\n0\n3\n3\n3\n3\n0\n0\n0\n4\n0\n1\n0\n0\n1\n0\n0\n3\n0\n0\n1\n1\n4\n0\n1\n1\n2\n0\n0\n1\n4\n0\n0\n0\n0\n0\n0\n0\n1\n0\n2\n0\n0\n0\n3\n3\n3\n0\n1\n0\n0\n0\n0\n3\n1\n1\n1\n0\n0\n1\n0\n1\n0\n0\n1\n1\n2\n0\n0\n0\n0\n2\n0\n0\n0\n5\n0\n0\n0\n0\n0\n0\n0\n2\n3\n0\n1\n5\n0\n1\n1\n0\n0\n1\n0\n1\n2\n1\n0\n0\n0\n2\n0\n1\n2\n0\n1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "64909 20063 18579507 927481501\n",
"output": "269516549\n642864303\n25032469\n115372744\n46740774\n422004558\n308450120\n292670932\n1225114614\n308450120\n586984082\n308450120\n831925309\n782629281\n195873104\n1338669052\n831925309\n846888619\n3593834\n979073\n4143263\n71565650\n339206737\n869962395\n272554744\n394452983\n80076701\n219349564\n236647603\n95367812\n189131938\n15570719\n5499337\n813294149\n96253960\n178177637\n339136655\n64762330\n2444408353\n3311130099\n181458657\n2208828278\n252557929\n223375980\n3447406493\n163783624\n181458657\n32068116\n1577736142\n807430915\n486817285\n828991525\n1508195478\n866579329\n251997606\n865638756\n15066203\n175364570\n865638756\n1686170485\n721379767\n542140783\n542140783\n542140783\n542140783\n586723496\n720430722\n720430722\n151325556\n28027480\n136426880\n122566084\n107473944\n1056951108\n778586333\n706942865\n1187117449\n2418467\n436558596\n36681176\n436558596\n61721756\n262862018\n51923432\n61721756\n630329838\n61721756\n81966814\n118888013\n624884940\n658838480\n30705576\n1576821190\n838657025\n863598070\n65255069\n751999697\n14376316\n287356526\n215871486\n1487974322\n751999697\n149873106\n213351801\n202116224\n36670046\n214971234\n2640561984\n382785172\n838657025\n345936560\n99787572\n1345677247\n94229742\n581053979\n7932219\n10830862\n616935595\n632977569\n616935595\n2640561984\n216401701\n336415982\n336415982\n336415982\n3349670\n318388491\n318388491\n318388491\n318388491\n450764343\n459776768\n57732258\n33079031\n533087678\n533087678\n299229854\n314073745\n197062759\n299739369\n563182374\n835519\n563182374\n440377089\n440377089\n244961541\n12744093\n375216335\n895682350\n1247854865\n71974348\n582994718\n582994718\n350528042\n723407630\n74389040\n986796418\n73311939\n52774696\n214762960\n470314107\n345255309\n73870587\n437644014\n422525418\n1036280358\n1775814503\n1056559254\n454423584\n470314107\n177288023\n751258663\n751258663\n721801586\n1775814503\n668130671\n45481239\n2226935785\n668130671\n668130671\n1101812\n1660969534\n202729341\n668130671\n751258663\n32216552\n108476219\n1137323287\n1208757751\n1056559254\n2362614950\n20998629\n2162869580\n243794876\n500774467\n159634406\n31929540\n1357431647\n835486698\n282560328\n601630269\n835486698\n404722436\n60096961\n104264886\n255835706\n282189145\n40598091\n835486698\n7451200\n3550656\n11890065\n836040321\n296703613\n18705109\n836040321\n287564803\n1028259481\n198807821\n403550554\n152972874\n271698392\n924737870\n924737870\n95592\n407163976\n853844734\n81194784\n747439596\n430436356\n329609149\n329609149\n18213298\n947285841\n308674947\n68264947\n521548261\n853844734\n461778744\n182520404\n54020374\n716492713\n1293917265\n458720069\n283470703\n1293917265\n1018098954\n2007088200\n150760661\n132244949\n430231079\n54716998\n35037405\n1569940886\n1569940886\n1569940886\n1517276\n278205781\n11242679\n178913783\n1661265111\n156076877\n573685379\n573685379\n1985087012\n677919796\n792283888\n2160166778\n671470108\n81367740\n79742386\n10231489\n1153519196\n5376647\n162548269\n65020829\n2160166778\n2249132986\n192656089\n1298356680\n143644260\n2520135343\n2559008372\n983518\n2716740463\n76823628\n628815121\n623568960\n719125894\n9978366\n2283314756\n17452576\n101530522\n235188789\n1958990717\n2352415515\n211798213\n2834101231\n760077608\n666332522\n9694711\n666332522\n919268201\n355895073\n1267475561\n169450888\n177182134\n131641734\n897433146\n112795186\n464903686\n12855985\n4167228\n703974048\n86258232\n25746984\n862089691\n510557670\n151675283\n11362293\n386897992\n386897992\n202909714\n202909714\n614205826\n123918934\n742390340\n50228633\n1137356809\n375693439\n1996230744\n33174883\n157224678\n421981657\n70459168\n1784017909\n103293058\n2487640463\n66563143\n66563143\n249814347\n66563143\n66563143\n249814347\n1054060101\n1110028649\n1110028649\n334781122\n239771196\n469774366\n126026928\n677791775\n249814347\n845207829\n3134123\n10550117\n3004214412\n303700531\n142266108\n990128714\n501647729\n1130595\n990128714\n3883657\n2969649\n990128714\n990128714\n18592185\n1362094347\n178934655\n172033903\n648489282\n354605345\n2488969492\n124893811\n1788843066\n2150764083\n184106031\n195209238\n613763587\n44495362\n2117003859\n173968126\n613763587\n659999272\n494376571\n1788843066\n1640508365\n879098008\n212099108\n266332854\n663233918\n1087862692\n133338188\n201321019\n725032917\n430788652\n95525618\n1056686710\n17561227\n308868406\n2133481970\n170292459\n816383043\n62840900\n265935840\n69835466\n8450160\n372333336\n372333336\n265935840\n560407405\n301102089\n58469296\n279133742\n75671291\n362491946\n211591908\n772904304\n254050874\n91054282\n77731504\n346999041\n288236184\n396782350\n259734255\n220817707\n14407305\n312840750\n414453876\n213271743\n131046969\n774195\n300616701\n300616701\n300616701\n850186386\n74745234\n34559415\n43326740\n33460603\n155260469\n213787739\n134176376\n134176376\n107852276\n1040957516\n134176376\n380220\n64735945\n51160929\n661421549\n134176376\n248313289\n441100449\n35788717\n30382977\n35788717\n12474630\n248777867\n35788717\n367336179\n234685404\n366231344\n557425471\n67384560\n150141227\n2124023083\n53119009\n209079736\n2297835563\n137938603\n5541363\n1880347175\n47663894\n2451242176\n110564025\n137938603\n87602602\n38775713\n33814235\n239953347\n230888975\n839584\n587847783\n317718422\n121630403\n280128461\n180842515\n37738596\n317718422\n317718422\n495759152\n317718422\n282434513\n241801401\n789071328\n527102917\n26489741\n317718422\n80118583\n76481591\n2305933502\n1795246427\n1073667628\n1729011891\n158718112\n765129687\n106412718\n45127699\n1795246427\n25026816\n699125167\n128385932\n1550016288\n135042029\n384106676\n53255600\n39791389\n481437288\n576938328\n337703484\n3441702\n3441702\n3441702\n322147090\n369791593\n42881986\n19399427\n1040277212\n923999895\n51742571\n587174611\n12388027\n35597908\n232519469\n339470754\n77276438\n85081237\n78343325\n1101608570\n264333657\n1371279339\n6332656\n631194692\n52760095\n4456\n7112891\n753891482\n1607782523\n40890227\n293545952\n947329453\n13108272\n192561946\n1865159674\n1642839054\n2080298\n285059035\n170277046\n1729122698\n2370830844\n1675321243\n762428809\n75929480\n762428809\n1669770447\n58783090\n548975167\n148630446\n548975167\n245812395\n19941\n308226287\n385806034\n3846126268\n1025868076\n8357992\n3846126268\n1025868076\n284139173\n1097343129\n39264181\n1419483155\n1745781141\n1668435590\n3015574008\n789648867\n35040742\n324257014\n789648867\n282897774\n90220458\n379634790\n378370371\n1222558736\n820760843\n549259967\n122319967\n18749734\n88825152\n681846342\n438445932\n17154054\n477817687\n594796080\n111170662\n337916091\n284603601\n22362095\n76545945\n287259397\n1023702027\n259322211\n8489387\n857255314\n459998176\n40830284\n127617324\n266105963\n183850415\n266105963\n183094124\n675029611\n244184745\n11068448\n14930827\n1063040059\n176758400\n1063040059\n748537171\n139296602\n12852733\n470060666\n19233006\n470060666\n34440755\n236255012\n14995344\n236255012\n116715024\n775696912\n40204615\n90435261\n25473639\n775696912\n127274599\n467134602\n29609722\n554041968\n467134602\n161468134\n694157674\n25473639\n504049135\n496596791\n504049135\n504049135\n360234854\n382398270\n694157674\n178058659\n333520857\n382398270\n3991999\n321465888\n1025882521\n681256560\n1133451315\n27013683\n527096829\n1133451315\n11130541\n288069002\n1133451315\n1068059965\n1919873829\n242964465\n1133451315\n1025882521\n227769032\n15076440\n4976091\n1880230894\n267206450\n38105661\n2535491688\n18645830\n20192551\n39776903\n4356163669\n678406456\n96216037\n694941066\n831305655\n36527584\n195757539\n1276023804\n13034112\n789674954\n789674954\n673386766\n506095290\n1878702205\n30687957\n108457832\n108457832\n108457832\n108457832\n47708119\n1300368473\n126302481\n202957823\n289719\n21067852\n286612668\n136005522\n170398494\n25023055\n9088735\n674137853\n996996983\n1850304964\n980859415\n283272345\n1850304964\n201720368\n12023262\n382237815\n531187940\n1800537936\n185516233\n71776022\n22593385\n321869939\n59732642\n325693577\n845689490\n452793562\n452793562\n452793562\n1279164478\n452793562\n15681262\n1597994928\n109667656\n1157064730\n237427308\n233224483\n87076238\n157125013\n104154021\n131213468\n89580665\n842070464\n15849035\n103630246\n842070464\n230221251\n842070464\n780835913\n1408150285\n229325379\n566228516\n316693262\n109581613\n67970364\n268032146\n1437329580\n694310683\n694310683\n604713264\n488588100\n810989261\n186059796\n90621256\n96411520\n780835913\n406108972\n1285186813\n143398760\n1285186813\n120175298\n237193089\n1285186813\n202826988\n449039043\n106709794\n449039043\n2593669\n16531492\n230933376\n1584151075\n340585520\n61456946\n106390027\n166983415\n299220777\n30308466\n106390027\n905569357\n547675738\n711137972\n711137972\n905569357\n711137972\n26903740\n1816259222\n18183505\n2531301265\n517556127\n126204371\n272892952\n517556127\n726123008\n5390678\n2973080\n348367779\n311067631\n726123008\n726123008\n311067631\n485484843\n927483738\n124870194\n554060088\n344543313\n6164809\n433631532\n2245593496\n542010559\n56688052\n15364856\n368253454\n231595920\n281670231\n655327282\n871737905\n1339508880\n229817658\n93092715\n93092715\n167842873\n762065813\n181305334\n75044641\n443077584\n251107737\n199491822\n716282387\n251107737\n78158242\n170555047\n79063322\n43623303\n129957835\n848642414\n547475938\n105856638\n720379284\n322210090\n380995641\n233806644\n330287848\n803240384\n547475938\n720379284\n2438876\n587094613\n119909359\n142598596\n735215403\n235170944\n2224288572\n547475938\n1854071182\n2136144085\n1040156238\n71804845\n41169858\n2668294861\n42202981\n23417736\n47951379\n1858904882\n1738521\n2334564095\n1858904882\n678347868\n358916016\n107320032\n54466242\n667901076\n264461320\n573444521\n667901076\n48578608\n819998908\n479178367\n437582325\n627114814\n628923605\n271514882\n541937110\n65499194\n628923605\n157053358\n62742507\n148388816\n121418545\n643554170\n275497761\n144950591\n715494809\n110207406\n157053358\n292892352\n299961572\n664713406\n1120395304\n664713406\n61363800\n664713406\n783004512\n488396369\n325239786\n325239786\n325239786\n1127923796\n325239786\n267662194\n371599604\n371599604\n87313016\n22235729\n1067285468\n16696115\n108807042\n30594316\n72033733\n957914336\n22889196\n176010301\n287535594\n1021752599\n907478341\n134075511\n81953170\n83521076\n252662208\n198960233\n772536569\n37238549\n223312519\n13821393\n1683609484\n165160702\n391056056\n346624919\n44744035\n12713710\n33870639\n146538249\n160680884\n674285427\n1362116275\n533957723\n117570793\n149047209\n129580668\n148447790\n441572335\n298457144\n197587149\n298457144\n77243190\n34783680\n298457144\n292865802\n292865802\n233504411\n292865802\n98357612\n388172492\n1128804351\n1128804351\n1128804351\n292865802\n1112709736\n1112709736\n1061015434\n106190034\n74840608\n913866327\n204198702\n329822557\n1239479722\n573529548\n1923640110\n41975122\n314421100\n1691108680\n1112709736\n47930434\n1163037320\n2761568984\n2077408596\n2077408596\n942977953\n942977953\n103247032\n1650480989\n875108358\n98198471\n187611138\n136754511\n1550466043\n9159460\n1550466043\n519381371\n873545402\n409664114\n453549918\n519381371\n743155613\n379194942\n1202715576\n1202715576\n1202715576\n178784200\n12232202\n144257508\n585792128\n1202715576\n1202715576\n471937919\n471937919\n1146110535\n273123607\n33407469\n563946765\n572761608\n193003410\n299225779\n613842855\n613842855\n663095239\n683023540\n465467384\n935026838\n712644174\n1999553637\n1739777262\n490885299\n389917624\n1382862546\n2246441\n1037699339\n45432283\n14839880\n613842855\n1811238378\n141689303\n830148701\n843173062\n34197490\n843173062\n110143045\n153039030\n385631977\n110143045\n16337806\n413449350\n77851014\n1415905835\n10244921\n125355785\n1537254290\n128339400\n4297233432\n198067917\n139830441\n280470060\n292258738\n119729413\n338676403\n218076296\n247066285\n782461653\n842674302\n782461653\n549812784\n782461653\n1931564652\n333986752\n553995651\n68041119\n100487944\n59656819\n549812784\n93061599\n35556987\n340173960\n885668503\n884938506\n355342448\n152912250\n136477010\n1062152983\n1062152983\n105367909\n157840950\n52698880\n301585513\n702370606\n136236415\n112625454\n4787046\n385869555\n28634857\n813930357\n565508463\n385869555\n183951023\n319129174\n2046559029\n43673861\n901003381\n385869555\n540364043\n171073387\n108672691\n51332644\n166141180\n851175145\n278321962\n278321962\n4886865\n282294352\n184310196\n1097603949\n244891134\n808382897\n4534235\n862820844\n18370086\n808382897\n228494748\n418344470\n825526511\n312400454\n312400454\n6575459\n416786917\n330810836\n260224745\n161010176\n710440272\n107805560\n174485298\n710440272\n76743670\n2462677\n451580548\n293419347\n1119179866\n42012308\n1119179866\n710440272\n13209660\n601363621\n19725184\n278443392\n110635625\n1373386172\n626733349\n2025711156\n112412293\n52650253\n277249711\n433963539\n433963539\n828266339\n52650253\n584080804\n501771948\n254286609\n36826317\n425482751\n282527219\n82923032\n376853145\n202737210\n376853145\n154483366\n29534225\n163162048\n549859338\n4582479\n49374216\n186636055\n110917575\n8759409\n99914574\n1434100927\n1434100927\n169272881\n530053867\n632930051\n632930051\n671391364\n100205245\n411171080\n347384975\n368584906\n15469660\n347384975\n360468930\n347384975\n712750323\n505940011\n733210496\n360468930\n600677140\n23099642\n525199410\n525199410\n257767149\n54595782\n356059740\n130289839\n130289839\n41132412\n1358641734\n9426737\n803190931\n150038893\n34659604\n537368494\n1264605566\n165910958\n47541449\n811569079\n2554331987\n270930708\n1055140019\n372084134\n232579560\n81941247\n70035628\n764475168\n554806931\n351472266\n342341576\n212536099\n218609846\n113850820\n687011731\n820490693\n820490693\n52486199\n1622339963\n941103125\n364971777\n241723578\n684807340\n27762861\n3439026\n904056402\n807063960\n13445812\n2177781878\n1194128985\n294471571\n1194128985\n1941478229\n25575884\n658481635\n859903055\n228661205\n15068122\n797837657\n859903055\n3797275267\n720074138\n421782485\n40963044\n103592775\n421782485\n53723307\n44033127\n421782485\n2017991522\n157979149\n485476367\n400378399\n400378399\n400378399\n200734707\n993440526\n465241147\n465241147\n275772196\n570509365\n115353965\n330872268\n570509365\n176021866\n482424048\n176021866\n30114339\n139672871\n335095302\n139672871\n110749031\n139672871\n501364309\n457507216\n570509365\n170323760\n524083002\n47162756\n81424912\n87203370\n823634447\n328986935\n282472763\n1002947183\n7472178\n99881956\n412925038\n782322074\n1369930655\n654688424\n285672064\n461670188\n461670188\n185379249\n67219215\n830707939\n111597148\n487094845\n154510391\n130829720\n115713981\n583718467\n550637303\n2859062559\n576322145\n2511108581\n33302007\n75470885\n402177138\n77772472\n669298491\n289160364\n577241045\n653629613\n44255985\n480287862\n577241045\n98976018\n1610024915\n119344068\n319399955\n159229086\n948696093\n120272046\n58251499\n201837640\n337833687\n48380062\n94536088\n144685377\n130360044\n766177104\n144685377\n144685377\n766177104\n1016037\n1542226650\n385101059\n353012665\n3320565\n66304482\n370617736\n1219178742\n296513362\n56147027\n130322628\n849867364\n40083566\n106316646\n192712471\n308162821\n453244398\n14075257\n432344483\n385704072\n848127884\n460186352\n308162821\n308162821\n308162821\n308162821\n90370299\n848127884\n207769479\n175786637\n430768267\n471230431\n471230431\n471230431\n471230431\n435712968\n478933540\n813804384\n107856776\n302147169\n892636653\n51253829\n178520157\n1238178954\n179639523\n477268745\n3673196\n1130467620\n61280942\n1072657008\n527637331\n279762236\n3135315\n211846561\n100156995\n884564937\n527637331\n461523377\n341677952\n527637331\n228578\n24065700\n2755521567\n479164083\n238346198\n362415574\n41226183\n362415574\n362415574\n129635889\n792755451\n563662825\n887438183\n1563235135\n739065273\n9773855\n739065273\n61788182\n147405643\n1602816918\n1602816918\n76112635\n591873064\n591873064\n103564251\n9728980\n202338756\n121424332\n446848849\n402066420\n95833175\n28023822\n18220705\n279514302\n609979400\n338927061\n242640500\n1100151930\n695109855\n1574215303\n1193133265\n425144543\n667924351\n667924351\n272603308\n214863840\n81053282\n257143818\n241714391\n422993826\n241575965\n382653010\n324377135\n710869075\n2529742352\n68767079\n349517525\n697904359\n573631572\n552521688\n21342176\n22465483\n457606400\n426485067\n471550056\n138124798\n111179949\n355101752\n82726362\n807193461\n126531993\n16639091\n340317619\n373633789\n451112425\n572040069\n3215326\n95335037\n572040069\n162293651\n635321339\n1016189882\n1727751684\n588859026\n320099115\n19951554\n161362622\n102859444\n313565552\n64989573\n652140296\n218618613\n27061933\n869670089\n35105581\n110366940\n570654205\n1555937\n33303056\n432098381\n372900271\n541120478\n169242609\n346304904\n259961775\n432098381\n451112425\n7268620\n809440737\n809440737\n1188050106\n77611506\n6284124\n7124579\n669215309\n1227395813\n59701860\n260629423\n1300988602\n610075138\n429962516\n158420418\n94979479\n266819473\n2793686838\n936313066\n314469999\n937275978\n96111352\n103675438\n17586415\n1032154462\n202613246\n72266475\n61746852\n113376375\n676516257\n223376821\n438240002\n438240002\n227507090\n32238084\n1100396574\n866345086\n928746929\n547762617\n653709684\n84764924\n211118583\n811929511\n13398176\n1045681842\n686532744\n63345238\n669684850\n2068529618\n220068696\n169508743\n70332966\n669684850\n669684850\n63447407\n9412119\n63447407\n51641369\n610075138\n63447407\n63447407\n673718715\n119533799\n1864824392\n91458040\n388389498\n768348645\n737353428\n1416170241\n177214550\n458359265\n103020031\n768348645\n26470604\n441623202\n25290882\n654237828\n865416978\n240574523\n922758975\n874461244\n922758975\n302099415\n1705519591\n1199463170\n25041581\n1474894884\n5173741\n34751195\n1338334624\n54013005\n323852733\n480842979\n47456856\n9975041\n621738260\n6240015\n1283689845\n1693418609\n9975041\n167382441\n45471920\n1693418609\n32991069\n699820393\n20282969\n605746742\n699820393\n95504443\n44903503\n179924533\n126670382\n17647874\n195501139\n345012138\n345012138\n954341772\n475963019\n264709809\n954341772\n954341772\n309595886\n194884216\n306192379\n44635209\n459792521\n25644292\n25456896\n451871\n140488891\n97900000\n182979210\n16506487\n30452345\n6946760\n70390\n368010992\n212600439\n784660276\n172149308\n43117353\n469379135\n448430733\n48546764\n466833338\n90321299\n81095040\n5174457\n390643458\n390643458\n48546764\n1557271394\n499644977\n598438008\n239229731\n402455777\n156102019\n186968321\n104561999\n186968321\n1289939580\n1316067731\n205048713\n162339850\n1418794317\n30460318\n12721192\n867438677\n251289102\n227327101\n1418794317\n96836456\n2014170652\n1881384068\n2014170652\n339896813\n190971223\n1240639830\n218071656\n94466745\n190241373\n190241373\n1306402844\n64228920\n370289143\n238868410\n1308006026\n64228920\n522195203\n789957016\n789957016\n203229618\n8417069\n1079765104\n53711793\n53711793\n398035799\n121831126\n53711793\n22083822\n1079765104\n5908920\n450433604\n3156024\n1484893\n224824084\n254211750\n1784705770\n482222556\n96304635\n18910088\n482222556\n816351657\n816351657\n464083357\n865103127\n949728048\n576900433\n369429403\n369429403\n21865164\n571798118\n571798118\n9292583\n1063117396\n385856712\n1880630049\n152361333\n611298355\n584299160\n564631154\n92350710\n154401274\n1634384248\n12993499\n564631154\n226024530\n550800314\n1177943071\n495484220\n259909901\n1347367261\n399877707\n2209327873\n80121712\n2970219633\n1780683936\n527283771\n464231586\n112611972\n899466745\n1186047043\n752102338\n6866056\n227438341\n193312040\n16349367\n39821817\n462582473\n462582473\n844675709\n12780399\n2162964241\n166065026\n83544328\n519909311\n8795214\n30250173\n124659597\n2682665371\n245701070\n2682665371\n631778616\n206315012\n570777862\n365626233\n570777862\n357189752\n13274529\n9049504\n457998785\n272572824\n575799408\n696779727\n38816\n21480965\n75760806\n465332687\n444733745\n9036185\n816109913\n51119993\n216364936\n816109913\n355838376\n686944831\n512545399\n1239725221\n928936450\n1844267833\n512545399\n98380276\n1768030901\n753649403\n16112437\n842649261\n185749845\n17481028\n1271783889\n350460420\n1948057307\n21895776\n11942047\n423492953\n272408518\n19516092\n22989830\n135586968\n103425320\n55013290\n530076601\n477966400\n625579909\n137988416\n394003705\n625579909\n161249358\n156752765\n329107343\n156752765\n723943648\n197221900\n75080173\n812156924\n292142573\n156504561\n812156924\n243284344\n1356503720\n25537969\n167408272\n448402588\n140026104\n14461601\n272510026\n336820354\n522698863\n161535800\n522698863\n133020647\n629986541\n1333731410\n381743391\n1542178626\n76067754\n808006101\n2350667533\n319806641\n197433812\n520242277\n573192965\n513172216\n200966244\n867002285\n1766928553\n1384673\n38734385\n295209019\n202402235\n1701950774\n495608375\n525879797\n406223812\n1350009357\n119484857\n722611833\n44493\n2297886932\n578480586\n582879155\n617215193\n6189325\n207094239\n58328527\n557713146\n112119757\n551961940\n178702972\n1038157390\n241084144\n1288472819\n284188453\n873300430\n873300430\n778919025\n384602620\n873300430\n873300430\n5251858\n200280372\n873300430\n873300430\n73210310\n9813347\n5081712\n873300430\n789876287\n199869431\n611790091\n70250490\n70250490\n20563390\n198737307\n29473752\n25123915\n934578991\n413561742\n1315946801\n711624280\n88574329\n49564976\n412865233\n362685579\n196910347\n317481780\n738116640\n76332317\n804245295\n592515704\n129652418\n288773154\n141289502\n819968597\n1054928381\n16595904\n445872783\n819968597\n819968597\n259195984\n1340469074\n191647947\n66823713\n749960231\n2003156668\n12836515\n201031982\n533198963\n644654490\n1162621132\n204701698\n272331001\n165571650\n967393724\n535941189\n1296575491\n127910033\n402021388\n210907916\n474308725\n357724543\n896624537\n151364366\n1208391371\n217689047\n1208391371\n116223508\n417710282\n450192550\n38673745\n170380000\n127070598\n127070598\n340794794\n266470368\n993131000\n1352140789\n2027127184\n996404756\n482298837\n108979317\n1174464818\n622915985\n484203017\n110734372\n348474350\n214826108\n156910750\n10766997\n622915985\n105732962\n480120855\n177234320\n622915985\n1436670577\n915351661\n82802597\n629690180\n90192035\n636895952\n629690180\n560669514\n202585923\n30054131\n750434669\n750434669\n224576794\n750434669\n750434669\n111026995\n453768217\n682991180\n298123736\n377892918\n393904976\n69815499\n1194385811\n114858728\n278129714\n1033671878\n1033671878\n694985904\n13864808\n618133360\n618133360\n618133360\n31159736\n252751016\n37048004\n252751016\n466586722\n420680434\n775238597\n378276956\n378276956\n54507090\n4616024\n800146144\n200542463\n34671710\n259403751\n1680904075\n65361875\n11438187\n589616591\n49133672\n57922276\n312629810\n312629810\n192464497\n312629810\n122671602\n1046424547\n13345244\n13345244\n13345244\n522371641\n540223159\n54934276\n147225178\n22806848\n329565\n544234093\n534191257\n534191257\n561443408\n534191257\n751050949\n314348627\n69522658\n577477165\n778625684\n1325137742\n751050949\n34407171\n830450351\n250383525\n48913701\n830450351\n768585070\n148619\n664881327\n232760180\n675910310\n675910310\n164221197\n1522527201\n272763473\n520785483\n64976\n520785483\n1287843688\n1437877625\n83707184\n2388672151\n613911832\n1138889311\n1138889311\n1138889311\n179566497\n335446470\n77740848\n1543542423\n99982807\n696700860\n245418444\n696700860\n1543542423\n891944249\n1738785812\n155326103\n1236013162\n474418957\n380517974\n581084954\n380517974\n380517974\n476930326\n380517974\n671963128\n10858168\n380517974\n380517974\n570379651\n145836694\n217465849\n125547587\n142291231\n1084355111\n89790669\n640829434\n59526566\n134090261\n1068075815\n503478694\n19952422\n222283357\n1068075815\n267265366\n62821429\n187685217\n440066877\n1085472847\n1231893061\n511805644\n51976985\n226752205\n226752205\n567764270\n245746315\n314895322\n43673136\n195769331\n22716548\n1288193222\n1288193222\n1288193222\n136080596\n648472030\n634174938\n1288193222\n734355558\n177946484\n412979430\n331567381\n67187751\n628431300\n67187751\n245681694\n331734502\n518666053\n237971254\n5609088\n2409440989\n15078004\n1379512101\n1544469333\n116151111\n169803834\n907080713\n99044728\n169135213\n667806622\n639042328\n639042328\n2190019440\n489463259\n52521089\n1072292558\n2472630997\n516235132\n715006714\n104814449\n846857157\n684351237\n115236590\n846857157\n2137704443\n74052707\n377102514\n10409144\n398693389\n6678726\n368673496\n294261857\n189871528\n218158992\n9661534\n416327977\n905609552\n500969823\n193330089\n193330089\n18277577\n366502946\n107984320\n175452\n641416810\n318310718\n301878354\n318310718\n38129892\n318548613\n318310718\n510480976\n631561278\n13708764\n114671284\n605332320\n10847808\n438511273\n438511273\n438511273\n93589795\n181210633\n181210633\n11176185\n130875161\n541993067\n853117819\n661660739\n157141607\n329938380\n10592818\n30718051\n24784123\n677262082\n1792689139\n1437589612\n546389555\n41335516\n1591171144\n12509546\n571852626\n626148642\n284570496\n1437589612\n546389555\n284570496\n22287810\n18252329\n556779249\n31728457\n1067118032\n500044883\n248334762\n170887593\n336415962\n451201721\n10410587\n451201721\n170887593\n143065168\n720909849\n170887593\n329323958\n24032376\n394121480\n39362168\n914504082\n914504082\n914504082\n113372762\n59033152\n170887593\n844813725\n29571946\n939430802\n1756289227\n480528051\n274847456\n255342018\n422926720\n410785\n2272825266\n89535148\n422926720\n264296547\n121686836\n108268892\n61129985\n914504082\n578573576\n696452043\n207964253\n197886930\n526024954\n54765808\n624591680\n20305025\n268830381\n362346000\n405488787\n868300215\n94749590\n868300215\n733381213\n1057589626\n821837019\n542877166\n248011827\n733381213\n405488787\n31146753\n24107246\n196467264\n432867168\n592707891\n1341028\n592707891\n1535070519\n125590459\n27673062\n443742089\n233373412\n1035712280\n568729839\n747079818\n479096455\n7281515\n609559918\n617384247\n617384247\n84125583\n479096455\n617384247\n617384247\n617384247\n1547138305\n479096455\n1553537040\n10560171\n684984919\n945535470\n1327020243\n946646171\n1615442171\n2417943720\n880404162\n266312288\n1590743078\n194077985\n194077985\n400832912\n194077985\n208335310\n7906940\n439826663\n51150367\n530388990\n439826663\n101080850\n439826663\n739611641\n330620328\n65350376\n87599013\n45864672\n18882323\n282569901\n666650272\n648638108\n69353784\n313588450\n194077985\n416100000\n862285917\n758046306\n37732446\n191947261\n364330709\n1236138\n532120967\n532120967\n266920806\n1470622840\n1470622840\n7761068\n272169199\n272169199\n1054875305\n250806720\n471838277\n165665946\n253984984\n253984984\n253984984\n1020579145\n90314870\n24691467\n255971941\n35937391\n1424269090\n27118625\n356597444\n6223600\n6223600\n6223600\n163175933\n113600000\n6223600\n55198216\n21537247\n34655454\n155694910\n430148085\n104824080\n287349219\n675762007\n793788441\n660655543\n750816773\n678800360\n678800360\n960866325\n107832836\n107832836\n441290\n37969706\n687682336\n7861132\n115051177\n115051177\n437348447\n345425\n753691065\n280095272\n616346427\n264948877\n552868536\n616346427\n272480228\n1210351178\n257836069\n748758358\n227584966\n636102443\n96802340\n216531162\n18054664\n47803622\n563407590\n297051466\n880038238\n172751304\n54031944\n218926552\n891979389\n891979389\n891979389\n891979389\n676127673\n54827476\n291122421\n141695832\n279597503\n450948053\n30624362\n1237042\n48605468\n88681485\n221966287\n575650375\n43315820\n136427732\n901639990\n854401572\n107646191\n97280688\n91227606\n8781112\n134557026\n48145966\n298676697\n725370948\n48145966\n524257301\n99910764\n368986785\n725370948\n692300104\n830227138\n254391861\n1143444739\n20428140\n102268085\n1031514782\n729712467\n729712467\n91112491\n731923907\n499643010\n4933940\n414308998\n189050620\n763014889\n145493766\n42870549\n226803193\n700026249\n245403363\n357318027\n110672711\n506483108\n528571670\n763014889\n121223003\n643035700\n31461508\n459645419\n827172496\n827172496\n30944129\n756184725\n756184725\n827172496\n153823046\n827172496\n41428761\n626109850\n827172496\n20770596\n876301274\n355604714\n373033852\n14709753\n1077823379\n419084751\n280241756\n600806420\n758852298\n1077823379\n758852298\n553443143\n1122044863\n86413245\n523139683\n59512373\n124167215\n606939716\n1112939573\n19393104\n856649704\n89305262\n219806233\n317987337\n47727132\n567569574\n560803940\n358003987\n335452082\n2363356378\n768074568\n315122145\n152439755\n378081888\n98627869\n78081398\n69645199\n27401575\n1012054474\n270014970\n305941234\n380396681\n305941234\n270014970\n629686365\n230398958\n3401937\n782467693\n270014970\n782467693\n61796079\n782467693\n326084204\n782467693\n70114444\n1484992155\n679976110\n2161610547\n2038169333\n23731539\n13369240\n365959016\n2610191153\n3163590011\n466750053\n80686788\n183625136\n545638214\n545638214\n382954028\n5008501\n2196312\n566698309\n253024404\n1201075853\n759148176\n393339094\n372251594\n725298296\n56209634\n303125633\n1738614715\n83268320\n157840696\n312455161\n83632516\n55835534\n1753520157\n23152286\n603131729\n83632516\n49324797\n18036943\n87277916\n15542967\n83632516\n355157605\n355157605\n571119709\n83632516\n355157605\n355157605\n177608728\n606430403\n1017134484\n115644344\n43165877\n465489722\n540847449\n266774421\n225599989\n56250329\n402719868\n834637703\n192326658\n171779952\n727628072\n12761802\n923136880\n923136880\n1225665209\n22589490\n4036702\n176135537\n580069549\n456443259\n1718894454\n801978846\n801978846\n623364553\n54447142\n1235295653\n816274152\n1832915202\n502244561\n307305347\n12071642\n25152039\n312289903\n1277530094\n1277530094\n545188468\n1339880\n237876664\n637119351\n680388525\n201387412\n685403680\n201387412\n481368070\n190838229\n78879358\n190838229\n6003634\n207677241\n469516055\n26058010\n2763437189\n47394636\n3050167746\n27787994\n300945163\n405953181\n3341990\n142766440\n174718912\n268327445\n944209551\n11863659\n1727277323\n197561\n4975766\n338226987\n47289515\n402194\n1765052733\n211867040\n422092068\n194757832\n912921414\n256005456\n655286723\n398230038\n90431539\n81156097\n164256379\n325409582\n90431539\n178251789\n477317335\n477317335\n477317335\n168691791\n633396530\n1500642492\n2392546\n197681947\n4083401\n2064447953\n174891049\n296311590\n16499658\n613791355\n22330307\n397624088\n82536196\n44300923\n1649103141\n89862408\n146696148\n28573312\n3396258\n5528569\n795631383\n795631383\n1313875710\n32835550\n192259016\n138582294\n129916241\n489692766\n23038683\n2194798166\n1545739754\n1545739754\n869951467\n240927683\n12645805\n453174575\n1720002620\n316403625\n118536236\n16378587\n210450650\n24860589\n1120665363\n1026018521\n364303270\n603985876\n1504825614\n333872930\n8512200\n203349250\n735211770\n814114757\n167684052\n364002606\n814114757\n588798455\n496961829\n479862164\n479862164\n770268567\n300345526\n604197623\n770268567\n679507662\n5569998\n1624549660\n1334143257\n12380099\n362764602\n66817948\n113447038\n576894710\n516033168\n701086525\n51453864\n136945504\n170077726\n1617955627\n166061058\n578165158\n191784030\n137044349\n335566975\n100256486\n490558124\n2026397322\n52502371\n237939579\n620694355\n16711519\n293070549\n213221829\n213221829\n61160621\n481609110\n111928554\n832040760\n463774999\n160124984\n73986277\n570489252\n143362601\n776930178\n1087631786\n209751709\n389794517\n776930178\n305731567\n389794517\n58150028\n1284279887\n2208704719\n3535100758\n3280338781\n93935824\n640973892\n640973892\n640973892\n640973892\n441217138\n791943552\n61456734\n319839250\n303499632\n369449916\n4896963\n640973892\n249615886\n287845953\n751061589\n371120149\n597950882\n142080842\n3220625705\n291951597\n1592154428\n852769197\n367352862\n367352862\n113845810\n20667616\n558281982\n558281982\n558281982\n5239752\n558281982\n2859740\n2069466247\n2069466247\n536321915\n27435421\n67572286\n5880781\n826922116\n679657078\n679657078\n39685939\n39400508\n685917600\n116346613\n371394671\n137700122\n685917600\n118718828\n1215037700\n417354010\n125182843\n417354010\n12783283\n4183824\n237104628\n115970997\n572117160\n237104628\n237104628\n313127101\n453586541\n490563858\n1063613411\n267169727\n205509578\n852472679\n5747093\n33312940\n134356085\n2020610190\n175887496\n778351587\n2686874123\n1409479886\n459478501\n752091796\n158749708\n289846173\n182245053\n306727631\n270732850\n586527863\n342244256\n86696040\n799733967\n48426397\n1091337213\n375072036\n1738886008\n1813296037\n5278199\n382936520\n714619868\n256017735\n181265813\n1582841981\n143807194\n22585339\n56118562\n98675651\n264762\n326495859\n1351316660\n81250403\n894309498\n534932833\n592210036\n44646937\n2106706\n250329541\n123752162\n923743429\n923743429\n324094520\n311941066\n409374749\n1970630675\n668797006\n1182121294\n1793923657\n753955627\n260910780\n65616440\n213680738\n671972794\n132949557\n1386456432\n1149370172\n714431704\n54548488\n14375587\n581653445\n190161624\n751541625\n2119764606\n66126539\n743133548\n3871106\n522453016\n66400665\n937458507\n258660564\n51390133\n178906566\n127971909\n613912797\n937458507\n40689725\n639616926\n1133635314\n55204096\n66400665\n381817392\n969018286\n186449642\n658547045\n31587137\n2459000206\n969018286\n66400665\n1847204672\n574623939\n155091793\n72436860\n353687044\n357681294\n140010202\n68536653\n353687044\n235133921\n721689524\n25692320\n246553850\n513572801\n122807585\n457493350\n262855421\n618200911\n857265210\n11155887\n194233106\n679850769\n39715375\n857265210\n185048564\n353687044\n1157248674\n2338925973\n476066544\n1834711025\n14780682\n244905614\n381804296\n509817652\n1040790600\n838150207\n88783564\n88783564\n139129918\n1555830\n205431820\n468654446\n88783564\n282847117\n282847117\n98060600\n45543801\n1662285324\n673989419\n15938867\n989462725\n50253305\n166572943\n680718395\n3863083999\n146805331\n76101257\n447046685\n992187858\n423249401\n1773278263\n3588207568\n432832809\n838150207\n3627155584\n4193894311\n1690221636\n1251056548\n295931567\n5397847142\n1823955\n199557417\n306196617\n1312659109\n153581208\n2970874100\n6184507539\n625410245\n170038783\n181766680\n609990538\n222847373\n9472722\n757968528\n757968528\n1120325247\n235593912\n250304815\n724537580\n724537580\n786700294\n265279626\n1417411\n1064523451\n882132621\n882132621\n28673832\n882132621\n1064523451\n629332951\n907032199\n907032199\n63548373\n11167392\n875920044\n5124805\n84847217\n19983231\n41841\n76857545\n392067087\n6960556\n380790241\n427911794\n201286797\n23745330\n257665491\n158704698\n371171417\n1013353048\n93012017\n197311180\n271257865\n196712164\n804396003\n95576297\n453679758\n15758287\n484171696\n4683602764\n1800809280\n1476129703\n288871689\n554075028\n391514324\n334135718\n554075028\n909383946\n909383946\n909383946\n909383946\n1547968102\n909383946\n161401772\n11512012\n554075028\n746867\n62838030\n2104413670\n887498439\n790069\n887498439\n227805105\n1181236044\n813316861\n867911370\n867911370\n1972255042\n22067822\n1237549418\n154991223\n51933727\n637418540\n12896868\n670875463\n173048759\n318206015\n325928198\n127516340\n133346895\n441957065\n48313019\n3851899\n361795435\n91466806\n1346277038\n839741269\n501487348\n86825735\n1806316070\n355333535\n32629563\n123566649\n3149350\n422868471\n480177240\n915072866\n504560588\n75226756\n75226756\n959011895\n959011895\n547051396\n533273372\n10189689\n179958519\n382030577\n1450494818\n401824616\n1037537218\n210191749\n968077609\n135525786\n506042435\n306651725\n5610\n714976\n16806445\n390187945\n749870690\n308337532\n910472878\n439516890\n372549761\n910472878\n108607329\n323375431\n173630840\n612490805\n52214194\n11322636\n149927184\n227756492\n435178414\n435178414\n435178414\n14846945\n804920234\n371164642\n439516890\n408423867\n127203363\n408423867\n435178414\n196485628\n534191585\n517247319\n8488094\n111352935\n312798354\n36376506\n43250141\n40202595\n775353583\n1804008460\n43250141\n717613667\n1306145849\n651652850\n789056520\n775353583\n775353583\n1034013227\n1039447835\n396790839\n10700515\n1713325634\n1713325634\n37247209\n2622032950\n238812738\n819204183\n665545\n21115682\n819204183\n12698037\n606025598\n576206391\n18881297\n78988781\n1369829399\n25581175\n10627132\n311937783\n63232268\n159308090\n350337109\n898055598\n17114754\n182150690\n72483507\n159691930\n393706966\n122237788\n24286371\n855568316\n1287786627\n855568316\n678732889\n158883980\n935512194\n935512194\n935512194\n855568316\n172014623\n19758343\n222963384\n474706916\n840924435\n76415676\n496088221\n159590599\n359577188\n143584615\n877152029\n1744289547\n202637393\n202637393\n202637393\n359345294\n54471076\n2301415\n675432533\n740058418\n713503186\n675432533\n530316111\n610169914\n675432533\n122254016\n496013607\n796572928\n740058418\n130899200\n718956277\n206119429\n991257274\n991257274\n1587089072\n323777788\n621506734\n1927977\n704908552\n415890022\n602268909\n16001856\n234359484\n382322049\n688414290\n301675090\n496778818\n76918216\n456044007\n71594664\n1235398465\n279035914\n215607997\n1294795108\n1952226458\n1499002669\n185001121\n641812090\n386268570\n185001121\n360547117\n1395755007\n911993633\n3208593033\n713503186\n8204591\n1903008659\n1576902854\n300479095\n684852879\n933921856\n315459023\n286064711\n32818151\n358195738\n424377795\n1599229\n686807561\n45534625\n1667084681\n1237431930\n286064711\n812459208\n300665930\n740403981\n264191203\n30950527\n795515467\n1271386460\n795515467\n1271386460\n583447952\n779342178\n599106\n774080879\n94346399\n368853642\n33791112\n399709209\n248522577\n1173162652\n137290809\n422109477\n963393812\n420055838\n1823257469\n306901170\n306901170\n422109477\n53255778\n129464645\n461191442\n709076035\n983294943\n180022540\n31450496\n552417224\n788160526\n338724760\n523721982\n624074311\n189320031\n1332793027\n661497768\n1332793027\n270639681\n110043442\n539894035\n674280469\n34184034\n2037185150\n26470149\n301488180\n2788325879\n2727941225\n159778741\n440757144\n3823169309\n318240668\n1067995407\n2788325879\n166562725\n119049390\n240317890\n683730360\n426365110\n426365110\n171482937\n968285736\n426365110\n630441560\n78234076\n558450712\n383871685\n523014095\n1075753505\n1826549391\n303620637\n550410610\n163490191\n1141076689\n1141076689\n1684141824\n410549992\n22109245\n9294539\n58627915\n39103702\n1684141824\n1684141824\n151201642\n13198248\n3217934721\n775570463\n953615127\n8799540\n775570463\n121001902\n953615127\n11640879\n1138505200\n18681009\n211828207\n529792750\n5202645\n21735285\n171702197\n39034070\n289019652\n161412985\n248088414\n43764461\n5541531\n1290420979\n15564584\n838777558\n809666184\n497286786\n317417212\n76702475\n953615127\n953615127\n789432173\n332251998\n332251998\n53495856\n1433072609\n75852012\n332251998\n293870109\n470333895\n49356352\n307755346\n432847539\n628438056\n779538133\n779538133\n779538133\n779538133\n1051830142\n328519904\n872341993\n241816377\n1168551788\n106385981\n533027378\n266928906\n12910583\n841856135\n706751883\n1226682790\n841856135\n16984984\n26481872\n171592904\n285079508\n654474670\n654474670\n924889096\n924889096\n1307895824\n924889096\n965826564\n10565870\n654474670\n360601983\n100800592\n475246451\n641685543\n653633820\n141336094\n653633820\n613867888\n54093589\n613867888\n57804016\n33658589\n5999026\n30475689\n653633820\n92362204\n828704296\n1082523969\n1082523969\n2784630436\n259664469\n109120386\n2135480840\n1433585391\n875016713\n37266935\n1968673429\n1115236785\n2251894302\n981440340\n416676040\n58521295\n431818790\n2624346387\n463003366\n1558047160\n1250536750\n1558047160\n463003366\n1250536750\n299648406\n866059422\n192119738\n463003366\n3843294368\n1250536750\n553381655\n546598695\n553381655\n553381655\n53432753\n200123084\n320766562\n724174675\n84830516\n553381655\n149140685\n553381655\n1018575560\n86970890\n852490283\n1248316141\n254965730\n294754078\n459098192\n11744048\n75500567\n852490283\n294754078\n1211031883\n497880098\n860341185\n87433017\n618540455\n107875620\n245345730\n11372944\n17238526\n245345730\n6152967\n232552994\n149791212\n1609467084\n114319788\n618097961\n10548609\n768160835\n871821996\n203446525\n355852745\n390802578\n871821996\n1500688381\n232645378\n738034411\n918531937\n389762470\n1310803028\n1005588109\n965425517\n772460361\n255933295\n270023508\n16576036\n917677229\n95548260\n336779734\n120461453\n382757652\n705105637\n1808827239\n1842934550\n54577950\n2442727057\n2148342102\n324780167\n2073263194\n103265066\n4006858200\n883569918\n5039848748\n3489175\n107052532\n1311263703\n104079809\n914193103\n73374471\n1193936627\n777604059\n3492449\n152364077\n402393970\n188756119\n24592139\n1600901375\n48278342\n1150202968\n1691998945\n1184328629\n1691998945\n77206630\n77206630\n861440670\n286348145\n8082818\n41218836\n260253958\n762847617\n762847617\n759920236\n732068124\n411415460\n762847617\n14516032\n732068124\n572377835\n12572088\n1022016765\n284174884\n209066603\n535548341\n6568627\n1393992941\n657056951\n1044586775\n63016701\n346187276\n2272419140\n95141780\n153343307\n20651709\n195953749\n121633292\n432951365\n428626381\n110749997\n920286973\n109379763\n333033574\n331606742\n390925046\n469799891\n24133312\n391092140\n405603864\n292840889\n109594528\n680935354\n323207783\n222576055\n2502213091\n158174057\n96391391\n111853092\n57816893\n895126641\n7029147\n895126641\n42853526\n191699506\n227000804\n1586323828\n115523341\n799837677\n1645162106\n2998039240\n389541838\n161742797\n3371313799\n281022078\n1768524818\n167531424\n20475257\n1768524818\n2358846726\n46144202\n994706698\n2358846726\n2358846726\n994706698\n33766322\n3942996\n28528173\n143993864\n28528173\n307920096\n81746398\n599276145\n48072920\n317942194\n153865700\n15718268\n303113049\n691860685\n188417308\n302400912\n128889699\n281981188\n157495858\n738334492\n738334492\n300624792\n35943521\n481992958\n7822796\n46305576\n1398763308\n108396914\n1500970\n372515282\n3223834\n69270118\n1693034101\n365797213\n332825031\n1159999571\n701664949\n492316160\n439325118\n1159999571\n33371537\n414323342\n6095565\n106855334\n467743126\n35034863\n1087455429\n1087455429\n1534391288\n1087455429\n1619183120\n185989931\n39882561\n250722808\n2387915789\n281781002\n59142430\n806910963\n431150169\n8784036\n152413076\n144336505\n1561837230\n674192556\n1665329884\n1561837230\n851796934\n243052079\n471010845\n372919920\n920340880\n49988974\n244140298\n920340880\n729270329\n266213095\n18211907\n154124745\n709800863\n98521728\n470180231\n324869832\n453601166\n453601166\n353830925\n355113328\n453601166\n36381945\n385337602\n36381945\n472345671\n36381945\n1766538905\n71514967\n470180231\n26077484\n805497554\n805497554\n214368029\n61730265\n346426319\n699998058\n2165375375\n589607086\n492442767\n367070454\n492442767\n629394630\n2148257337\n629394630\n1925653073\n3166914942\n117694633\n414013623\n30023134\n137902681\n709865890\n709865890\n414013623\n267812432\n937208017\n1399530634\n31836635\n374165186\n1399530634\n494087025\n289661655\n402550880\n273041788\n1082585949\n46763202\n12509580\n39783\n224431489\n170218769\n55831586\n780851999\n864398175\n45203032\n335499693\n114571746\n400257701\n275340857\n244066321\n244066321\n104115034\n16130164\n395871450\n454038740\n17148342\n431324295\n734755527\n431324295\n45389054\n299645151\n40665639\n118933419\n1226551784\n1058763060\n2419649987\n1811686465\n1226551784\n90425943\n2145479460\n2776953734\n172141976\n2776953734\n59715006\n2994072070\n2532321858\n572505841\n347220146\n167991930\n179195711\n925322969\n28713445\n62735821\n450252079\n1107307343\n65556356\n43691744\n1565819381\n421287513\n1408269508\n1689795709\n1565819381\n861353442\n1600509432\n102999150\n188524717\n861353442\n201027009\n633223293\n9021604\n21681772\n4704521323\n109341403\n22159929\n379837680\n758847901\n80224535\n581129954\n681147387\n31402464\n119920486\n346859720\n12992656\n532539487\n991103125\n242435808\n176671343\n235711099\n600931242\n369716546\n443287812\n1202314651\n1664330692\n51027284\n391510795\n273101332\n48966415\n2840433259\n1590890724\n1590890724\n2840433259\n44106395\n23188411\n1454722871\n7146671\n4503999293\n936986456\n381400120\n335223020\n936986456\n54395820\n82357476\n56018348\n56018348\n213939339\n56018348\n56018348\n17612232\n32397707\n33898956\n433596837\n691760183\n118589381\n27341288\n152352857\n902964076\n128501278\n891856934\n20994620\n9457435\n655627488\n276904724\n616803805\n9457435\n33485133\n171296612\n761453484\n721847220\n447864615\n16124420\n1103517328\n1323317772\n141080653\n242591430\n29484724\n320779176\n1323317772\n315366475\n7362879\n812288367\n498244319\n101507578\n396997461\n347171284\n366012504\n1081535863\n22451681\n396997461\n11398473\n1434077\n486845949\n6789468\n18287341\n50225851\n1822934\n1446751201\n3776784789\n156823527\n20273577\n2345456542\n79469670\n221589495\n1110824590\n4278843802\n430300180\n430300180\n76028069\n125141390\n38606492\n184453154\n360114986\n601673811\n557386049\n875520288\n57584319\n2304469625\n384407394\n312196772\n1645673223\n171255\n439070927\n153671079\n402786123\n35315370\n1696604804\n37526280\n1696604804\n14698234\n1422149448\n2862008398\n303268974\n35942465\n107823950\n782659757\n511965069\n1306828765\n8598902\n114720249\n651360608\n153539915\n919050254\n137903204\n1787348600\n402786123\n1787348600\n21857437\n11359155\n595227452\n3011581533\n2897116676\n2897116676\n638948930\n264640574\n7433628\n7433628\n40740869\n6934396\n504993169\n926670971\n61786715\n9507102\n1080039865\n1495249103\n881589234\n881589234\n351461794\n9150168\n351461794\n396983111\n24501525\n23602383\n401625372\n23602383\n278748180\n192888589\n349579771\n377631364\n96094266\n141071299\n474425687\n10583594\n96094266\n474425687\n1490821359\n884206708\n238670514\n89761528\n70334472\n630655604\n30335363\n89761528\n672285176\n67372959\n917203\n256786387\n1955705\n800900062\n496888955\n489225581\n496888955\n398115227\n639183316\n497055282\n270846101\n243113642\n18705970\n14067760\n357889598\n466256516\n70248405\n1955705\n1955705\n142610293\n2200539005\n462636012\n1890840384\n89302167\n79275598\n89701095\n89701095\n97745485\n382593683\n437638651\n494998627\n494998627\n494998627\n488702655\n494998627\n494998627\n494998627\n494998627\n564786839\n494998627\n651192553\n16247439\n907831806\n263693648\n500942970\n113198672\n341537690\n932900575\n1831733417\n402786123\n118019410\n270032039\n1007090370\n1856722420\n1831733417\n357180355\n594361109\n110995094\n923561486\n923561486\n814151831\n385816676\n265511629\n712627214\n136209528\n265511629\n146358220\n350070248\n480090572\n265511629\n265511629\n206516430\n300181793\n154593272\n1407604895\n731342999\n91944373\n1405453\n386035848\n77148433\n162296384\n346958862\n346958862\n1688816285\n1688816285\n346958862\n1688816285\n548437023\n303583962\n346958862\n2125074\n479561500\n58475448\n1119870935\n931128387\n204384005\n429828303\n429828303\n429828303\n33299036\n429828303\n931128387\n429828303\n429828303\n612125872\n321413702\n1825237\n1655905248\n142086529\n702601020\n702601020\n251889750\n702601020\n315471067\n116227711\n1852645129\n225368814\n37495\n76402531\n291692303\n1141391\n187760468\n3051465933\n911465914\n11067372\n515380827\n892798558\n520687849\n59870703\n303558364\n66607071\n48423579\n672786770\n34896127\n69567207\n66607071\n66607071\n36501596\n1288323197\n66607071\n563496050\n439569376\n245923283\n54865928\n2012637609\n621715079\n158460036\n748301965\n141041536\n607689933\n2440966852\n192350057\n3033666069\n700350110\n1240955253\n16791064\n376847729\n55903647\n136145484\n113101461\n499742163\n409693912\n545407482\n78248858\n891531342\n818100\n551764513\n1593689245\n637848678\n155323323\n700350110\n2134294388\n655751405\n606552457\n655751405\n655751405\n655751405\n1962150463\n1408096399\n94092629\n1306487258\n1408096399\n1553809224\n1648190426\n1408096399\n463417732\n463417732\n200489181\n928904959\n451358877\n128395209\n85833559\n151076193\n979425\n541475736\n9295160\n3070201\n156644602\n1442910762\n673468361\n1707315347\n673468361\n90059671\n216994883\n526767955\n26848214\n355350122\n156014810\n86866966\n559784662\n11674507\n352156991\n3772604\n521667916\n415904886\n415904886\n1086391790\n268364171\n32267261\n268364171\n86527370\n633504842\n633504842\n1207410501\n7467421\n268364171\n83329440\n512080624\n172557116\n260662374\n342156827\n1395442774\n140371859\n32917542\n260662374\n2105947286\n431931731\n533802421\n87070127\n429903475\n842269830\n342079193\n619731979\n608941320\n61220066\n619731979\n76806814\n859766124\n10962501\n417883451\n260662374\n75383182\n48508811\n1040596885\n417448053\n632612128\n373775953\n22458567\n45135620\n1068347282\n188798049\n43046666\n1238788511\n443176688\n96791474\n110278479\n14101360\n25099995\n173208683\n13805232\n301631033\n886101259\n402040910\n58926492\n1053932871\n1053932871\n402199026\n21618163\n267984242\n122609170\n1197412549\n1606760008\n800055705\n42124392\n57644413\n45733109\n546935062\n546935062\n610202948\n392492946\n610202948\n23104011\n472615339\n472615339\n526527587\n2467784\n381438363\n39648498\n109433379\n599907351\n599907351\n931677179\n931677179\n4406572\n405827841\n69720954\n948897130\n142334200\n208680337\n9756668\n822402874\n36377724\n400852196\n63038207\n299797753\n71485160\n375514455\n1454653768\n422622479\n403078238\n167891388\n63038207\n2092939859\n969888149\n1320424260\n44875538\n754232630\n1532651344\n979154\n1919444770\n336361894\n356450405\n2023862478\n167567233\n157444062\n22168656\n579935479\n7717672\n10368130\n583542085\n472003001\n1880958165\n1138985137\n752329296\n4327863\n64221220\n648312422\n465709578\n454702983\n10565087\n1298960002\n536731869\n140739884\n1298960002\n147911146\n1224413502\n76837556\n1048031638\n519821350\n68600161\n2226441106\n74142679\n389500382\n655796342\n473220156\n811249286\n448211052\n382519256\n19561\n6375632\n719785324\n392486372\n258564272\n166632519\n102062440\n1008498607\n620089097\n1188398549\n1188398549\n147420503\n492699099\n616540\n1188398549\n53857244\n325019575\n198628612\n1114490812\n179662797\n768650407\n300505952\n28685198\n1114490812\n6901474\n81938446\n426012553\n595207\n396721582\n692831901\n563760369\n1802744636\n563760369\n63543103\n290208144\n563760369\n459051924\n1678547883\n821554515\n2105600\n1079177797\n1327657642\n376229760\n939070055\n400961051\n24291777\n136470166\n208935191\n210728373\n1304525211\n65175566\n533802295\n364468501\n842885666\n842885666\n29556655\n768472705\n768472705\n110456999\n625688401\n110456999\n343923234\n343923234\n722379434\n911537663\n289286738\n289286738\n54334244\n59585890\n333522592\n227787984\n121550561\n845009897\n25400481\n34312172\n28147857\n123666976\n842380882\n429929675\n842380882\n455036756\n725935833\n725935833\n1045741787\n164349220\n172527444\n72145330\n767157166\n725935833\n799793113\n474682418\n799793113\n22587499\n799793113\n104993968\n488664470\n41664747\n767157166\n69643108\n705628727\n705628727\n2681216\n705628727\n705628727\n116774442\n130020764\n9033389\n778945518\n144230097\n778945518\n143552466\n8542124\n323625589\n67068326\n40042399\n38736496\n249758797\n19925675\n218006050\n183924936\n679136586\n93721294\n529462284\n115362316\n286333832\n35486878\n336603314\n65509059\n2626792\n512370352\n59030622\n105863988\n805988197\n425994309\n812481\n827629219\n128354102\n298359555\n2180238124\n926113138\n95330188\n2363441114\n223481062\n32994627\n41863640\n203032342\n41863640\n1110100510\n41863640\n519953389\n75041360\n122764737\n186060855\n735558122\n75432737\n1784149068\n805988197\n98976035\n18949574\n842921345\n294944148\n128464484\n842921345\n842921345\n842921345\n588385268\n1482483358\n1482483358\n588385268\n903629735\n373286288\n48626954\n67309140\n138172721\n96155538\n10246075\n336458273\n94501056\n420453477\n56007089\n692512746\n500370346\n8190\n951773\n593974591\n126011110\n82477071\n35537182\n18235516\n557203775\n183093335\n1580512756\n82477071\n1990113\n1830253779\n433705994\n162296726\n3792217476\n1161440167\n2849095416\n572854219\n475552162\n82477071\n85525977\n415235969\n2933046677\n84168418\n432527032\n839160511\n117687681\n748795361\n968719823\n485415789\n378128180\n5128107\n70751942\n665845873\n190960814\n33434218\n1118634738\n64953345\n3786015365\n375463682\n183083734\n375463682\n375463682\n375463682\n81003007\n17078004\n175890787\n266415722\n253753413\n253753413\n253753413\n253753413\n302229328\n239793527\n253753413\n229253125\n808228184\n539320018\n419901441\n1012204495\n1012204495\n31257233\n432659281\n113094696\n2795\n762426559\n100425936\n102959509\n64454784\n20805073\n7723244\n37129506\n64454784\n498866596\n61119075\n617940909\n684845128\n150133771\n826820595\n227916554\n826820595\n86055748\n1828696150\n345590562\n67152083\n239128831\n979739121\n122071688\n63372161\n336391855\n538548651\n63372161\n456005092\n343162637\n253671213\n5239913\n430530756\n30750814\n244437129\n289018260\n120958605\n1119759244\n100690375\n201549143\n1065764705\n648958024\n846251033\n9496570\n777503109\n83543409\n69511780\n73502391\n150612231\n77782392\n227428104\n421555616\n421555616\n313388582\n648958024\n27856334\n73397402\n1588031938\n153961813\n1384391177\n10554107\n379485676\n182445122\n384925793\n711253412\n1256279246\n583907853\n595081649\n581326668\n384925793\n156916510\n703588079\n539522502\n703588079\n703588079\n19481378\n64532612\n1184560862\n703588079\n703588079\n1184560862\n2147479470\n1657820922\n235560472\n104583365\n18827123\n2262324692\n1446966976\n667596988\n1781351909\n1446966976\n112315123\n52675482\n206334505\n744417187\n102716766\n785244042\n80769379\n870404089\n659521342\n1029889700\n720255849\n587113570\n6062780\n659521342\n742360519\n766245968\n493549982\n78514022\n265172153\n926917322\n659521342\n919356048\n400490700\n39909381\n546588146\n659521342\n155895590\n116180648\n405756240\n1108087777\n918349298\n1785220861\n365396551\n1217545870\n1479054923\n1217545870\n1217545870\n546299267\n419267341\n923127790\n295883088\n545639693\n913301282\n1753585295\n673496668\n258531049\n492700489\n41306827\n294175564\n1216416\n204105796\n17832817\n185247124\n523620116\n424147467\n598289341\n749252236\n1974917\n452210642\n707679291\n566429759\n566429759\n707679291\n566429759\n26364910\n732577559\n732577559\n43452084\n1628267285\n1175144\n732577559\n231979342\n638987950\n189825174\n400176098\n653500760\n525176281\n850748984\n23285732\n249780510\n358451355\n479239544\n449473672\n111979559\n198076708\n680037613\n666811010\n1584034044\n251217648\n2305506650\n891881562\n653134916\n166635707\n653134916\n256152473\n691234129\n898575435\n21772863\n311096806\n1291419036\n898575435\n225585193\n897457127\n897457127\n2909127\n589950384\n476463799\n535932769\n589950384\n394708683\n589950384\n478707372\n81719009\n179165468\n307193469\n268147884\n825692216\n591893866\n468604566\n468604566\n591893866\n1310146438\n1310146438\n27996704\n459755513\n8616076\n2151309667\n231224959\n8616076\n454895342\n550422941\n633492024\n355641280\n196300843\n590901322\n92604953\n392317082\n229225236\n355314204\n214318505\n152145479\n267721049\n541383004\n187022399\n31858523\n386275667\n386275667\n784383141\n57323546\n633839137\n99369542\n2135527\n57323546\n386440366\n1496996558\n624660438\n57323546\n362785065\n57323546\n57323546\n44772526\n160882520\n10710784\n927096772\n1388204370\n43387669\n506434694\n506434694\n1170815755\n2235861\n1302586295\n490581520\n421635737\n547383117\n111854594\n90819804\n701051718\n790808767\n2481520\n25081746\n631474971\n1596418506\n462863237\n19862653\n307756677\n612787682\n14108277\n165690528\n1473506284\n91879888\n251316001\n1180039586\n545546471\n437144491\n1424800125\n836541728\n545546471\n168371721\n836541728\n309223893\n345231010\n325347769\n48457372\n109366\n61038917\n962784529\n977796390\n1211265141\n565292023\n9023168\n565292023\n109735389\n565292023\n118164270\n41026498\n425201292\n179078276\n727525684\n557805639\n557805639\n47439514\n5682160\n751413556\n4641243\n656047949\n382249559\n751413556\n122236193\n445432700\n754947965\n37530242\n379513635\n307679613\n26337927\n126361386\n17476676\n1635635579\n693337280\n693337280\n1635635579\n23331658\n693337280\n693337280\n917794768\n917794768\n917794768\n404099794\n2028722\n917794768\n1098997531\n170315182\n99901331\n216796816\n543866941\n1435466672\n54220226\n107946935\n2881767900\n260810500\n16423479\n332267397\n529854463\n273457363\n164266147\n164266147\n247196021\n102605135\n347556313\n449487794\n592029507\n285705088\n5825354\n1871903372\n863410591\n75646167\n136866000\n4675980\n596875215\n271831999\n596875215\n245756837\n309599029\n28625071\n142216658\n245756837\n804349886\n1541009303\n596875215\n792188689\n531013060\n32407363\n160966398\n169833281\n52349243\n88434834\n28191085\n54725522\n573468547\n573468547\n45532147\n47376630\n289527832\n3809930\n68264231\n22837529\n11044527\n179671822\n179671822\n179671822\n179671822\n173325445\n436107898\n2065199096\n150881245\n20693969\n418177580\n149475566\n552521898\n520370666\n1505261431\n805400320\n1400256473\n1632757528\n565214468\n287563779\n1237203303\n3191860849\n2956828900\n677003414\n2727855569\n437594967\n441564577\n1588048096\n717832791\n596505946\n1547806\n558824\n186559975\n1741013\n2000514381\n47615322\n2245281320\n29215801\n54449110\n260441456\n657055983\n204830663\n71002598\n409142955\n77084954\n850075040\n450818944\n456365604\n480668584\n440582750\n1014203460\n1014203460\n40057669\n929945432\n105951276\n795336929\n893603945\n794863993\n1166768063\n397973824\n484058698\n47004184\n484058698\n148102081\n762526543\n605133484\n87561717\n35928693\n542740559\n542740559\n172888690\n1011125443\n638937728\n160902016\n172888690\n21240649\n427436509\n216484067\n146795308\n177372553\n177372553\n45961591\n363618204\n542740559\n28276241\n606266707\n1533144885\n685007828\n685007828\n685007828\n242684302\n1397731565\n162024614\n232211014\n68976896\n120215767\n2745817\n385194357\n849962986\n147150623\n37839106\n116004165\n1475885335\n857635765\n638263670\n1475885335\n1166297212\n260371430\n29443669\n260371430\n260371430\n209004068\n151801855\n495771904\n436077494\n381605146\n286633623\n283141653\n358340081\n28082072\n1370756086\n149752675\n612320100\n917232120\n651300910\n554749314\n554749314\n115660811\n87186206\n242790296\n554749314\n8511089\n293882539\n30789751\n15425985\n30789751\n30789751\n327919782\n395574686\n1418108\n726899740\n726899740\n265935662\n4038546\n405829701\n194412537\n9526392\n452811387\n31016088\n698390320\n124279044\n41406968\n1223938154\n3223249\n1223938154\n813648148\n693212105\n454003505\n74449298\n645767085\n1810349121\n28483023\n91041723\n83041907\n1940386821\n746640765\n405308720\n892873474\n405308720\n25506848\n892873474\n405308720\n457029688\n405829701\n419454363\n860933600\n86088795\n746640765\n185611981\n267355594\n405829701\n417926672\n279947905\n88620173\n36169682\n904504720\n72958330\n65243751\n2834351090\n1819092962\n110527815\n318587498\n438074446\n438074446\n438074446\n221509915\n1295188799\n1271984141\n374075727\n173597256\n74707979\n603378558\n1037106925\n40916340\n87809836\n1037106925\n1037106925\n440442377\n285757652\n311720982\n230213541\n3370944\n508350013\n1251705813\n80956018\n64209908\n884708416\n226655873\n83283649\n290372928\n845516736\n845516736\n291734915\n116000668\n48115480\n1589684410\n980121\n1478659417\n135497403\n773405876\n1840664090\n2470254016\n1851386007\n169263753\n2840709281\n546085626\n143238908\n419593274\n10281878\n2412697765\n1055714\n169105718\n1135884881\n2876946399\n278263449\n2876946399\n3313665776\n2876946399\n1915942110\n394125238\n394125238\n16965922\n820168312\n820168312\n1479665608\n791301394\n402253076\n169061196\n727267418\n4749224\n215758522\n169061196\n328544139\n962794737\n576315245\n576315245\n357108496\n104756748\n1215730697\n263991217\n17425980\n17425980\n433839188\n17425980\n390083074\n277009009\n169061196\n2861541912\n979650442\n10334774\n24596055\n5653951\n2174913944\n643294297\n19004167\n33338964\n2007299488\n112751421\n1728024192\n1728024192\n3490919452\n3490919452\n2007299488\n598199587\n8765701\n49888934\n326469688\n510938064\n738495051\n160255493\n398989393\n2193113\n379315189\n110775453\n113671691\n27121668\n230959152\n514436701\n127088938\n617433728\n264748915\n95892386\n95892386\n14505885\n313503716\n125376094\n313503716\n224763849\n313503716\n166203677\n274059993\n547248468\n782218189\n619344826\n884409168\n617531446\n617531446\n619344826\n884409168\n521709227\n380044\n432870815\n432870815\n303397617\n582387610\n582387610\n432870815\n242580255\n432870815\n27452141\n50586653\n377966098\n461103060\n208457520\n324606846\n208457520\n406402764\n1205903154\n520029540\n337716445\n520029540\n43920514\n486025407\n382630\n593078477\n256092533\n999896172\n1677241048\n839226956\n161882080\n545183728\n391959060\n635275697\n635275697\n635275697\n13996172\n428325697\n2215814478\n1704003277\n887640690\n17999639\n101496900\n134007465\n382181772\n17999639\n101407956\n887640690\n101407956\n887640690\n756065235\n836244760\n10427944\n887640690\n1282706505\n887640690\n496370821\n14364836\n101407956\n112871150\n276509392\n673615639\n673615639\n309520128\n211186728\n410264264\n889146247\n508954929\n70106604\n171853083\n151574012\n581222259\n74564818\n581222259\n257039508\n417953561\n59779612\n582470596\n447767642\n447767642\n25316288\n582470596\n855816497\n11724498\n329652278\n652099301\n652099301\n447767642\n833421249\n2142917625\n25136421\n105562920\n895954659\n192876892\n614020140\n594593113\n479048843\n755365260\n308277092\n626823972\n626823972\n1333610409\n1314302960\n2557574132\n28968295\n2557574132\n198592274\n704986155\n73589397\n20377386\n626823972\n2021089397\n37776745\n837459335\n283364392\n435752419\n2760941462\n113895775\n407719785\n407719785\n1515991059\n1515991059\n534050074\n1723516580\n2104933074\n2104933074\n841102290\n213373679\n73946707\n1230257884\n516907635\n516907635\n516907635\n598130059\n342025882\n1250204831\n3238281215\n116959532\n679268444\n679268444\n1996927793\n18175471\n315683110\n210526344\n16095096\n16095096\n883174542\n88972080\n118016248\n1259885572\n978385604\n124314029\n768549196\n19313467\n2837724887\n2158889742\n108667710\n302578052\n242882033\n57602377\n1019840400\n219252756\n1657371338\n1651783358\n820897230\n954805666\n1896742316\n101350020\n399145038\n27198071\n207712388\n2693548301\n165315948\n165315948\n1039097\n201949796\n1079021544\n587701769\n65532481\n165315948\n639485464\n2762202860\n6042809\n703341\n703341\n23136925\n31029931\n1585206216\n48585008\n48585008\n703341\n338069976\n11556240\n51703033\n688724534\n1219209216\n580427093\n52797878\n688724534\n1219209216\n31101154\n130862954\n254490004\n85173957\n462119827\n347625748\n489639898\n518681019\n827199686\n827199686\n187946825\n106434984\n263336021\n11258952\n101075641\n106434984\n613627875\n827199686\n613627875\n712984028\n74337166\n8114786\n712984028\n997325954\n232730537\n100035292\n778082771\n557166981\n40278890\n1664822642\n106395184\n2033619152\n1276360709\n35753065\n272977576\n957218327\n2033619152\n52308152\n52308152\n52308152\n52308152\n957218327\n338796150\n209227793\n413221388\n1704364589\n358092873\n367911042\n113779636\n486788311\n32765061\n373376975\n280583855\n1215911363\n445190171\n1215911363\n1704364589\n6696674\n1704364589\n247184518\n204378486\n486235561\n140069475\n486788311\n723633914\n171252377\n764905252\n155735101\n65246479\n11540018\n441033516\n102449602\n1312691673\n801334848\n68558556\n138563530\n601869748\n1229639622\n1229639622\n5169282\n103839456\n525085886\n43152332\n547744218\n618353933\n1316045955\n149430864\n313002448\n26098883\n26239281\n18874508\n51856679\n51856679\n51856679\n51856679\n51856679\n51856679\n51856679\n226125323\n524600389\n524600389\n524600389\n14099197\n5063139\n445278567\n154894803\n706863475\n216860953\n360675388\n563734450\n207060651\n17261243\n1763767166\n7341488\n109856043\n156918809\n1625326716\n666773003\n222374166\n153313457\n144961944\n265895843\n815230536\n91136271\n63430812\n94560430\n862862412\n236531224\n93475376\n754613957\n754613957\n167291376\n913719733\n149032934\n2063997\n561778360\n486107250\n486107250\n486107250\n129260959\n657920779\n442027179\n524594151\n489824409\n385266089\n7554301\n503272778\n48340589\n195236030\n499460277\n297934831\n272342711\n114925944\n26210246\n1204195117\n1813725680\n498773275\n17366317\n206229577\n150387252\n62598346\n157336665\n782370\n206229577\n11569670\n122076555\n175688884\n553463309\n216474892\n2163913179\n60018569\n60018569\n417931052\n37034218\n448726986\n277335577\n272813068\n670127502\n650366771\n1750113999\n1152308913\n400583834\n197065702\n138400665\n1966079765\n1966079765\n733778483\n733778483\n252125156\n185740783\n120577012\n40842181\n1818600936\n567632070\n3409989246\n1249293882\n333795729\n588190919\n588190919\n406422338\n29936648\n205763613\n42705159\n696643236\n696643236\n761117458\n136836174\n1515466121\n1612215326\n115483770\n3106773869\n2975218305\n2219306113\n666950576\n2201172128\n620782505\n696643236\n1839354999\n118719664\n18730810\n268897706\n27796904\n107362614\n47451316\n25881098\n727170780\n807996556\n153815130\n12006536\n2694652\n17422282\n93560752\n278579147\n684689881\n7133449\n114993707\n402968388\n65922216\n628910625\n14969466\n10820740\n14965448\n30143021\n671914126\n29168692\n18096663\n8066743\n250261571\n671914126\n671914126\n10360024\n671914126\n325922804\n209420886\n395154475\n18703568\n2321997262\n107391233\n445323794\n741398148\n661579959\n555400589\n839251225\n839251225\n839251225\n839251225\n2208401\n839251225\n119384578\n222446017\n92972990\n1367551\n50611560\n917823929\n247248065\n141671249\n47593269\n762563633\n214864023\n618040872\n428027791\n44674580\n511271850\n677461071\n753693267\n884242943\n727079858\n2668106\n734017859\n59059218\n8221417\n100735979\n211495165\n1657905199\n734017859\n401958499\n401958499\n401958499\n425574112\n96225293\n80401384\n356167811\n709341464\n506981428\n2978020\n322989245\n5525071\n1205249821\n121034038\n280591493\n531880040\n360246605\n4450982\n18986094\n1205249821\n3717085620\n105577943\n641038539\n246339301\n82382028\n298246216\n298246216\n579800460\n714959197\n325227420\n143485205\n714959197\n714959197\n260486774\n5895478\n428742799\n428742799\n927318669\n311540797\n743529928\n329287592\n743529928\n174228061\n165373909\n1051803467\n68201132\n552501306\n472928614\n462235655\n851666549\n721976201\n381319638\n721976201\n721976201\n192674912\n20340978\n721976201\n721976201\n252916810\n175091392\n161136042\n31289240\n957765345\n211723893\n390427000\n391802884\n236461302\n143779825\n390427000\n130484552\n192933598\n129017164\n46817917\n1514558138\n1514558138\n192933598\n181487246\n457674681\n192933598\n68334861\n1963495451\n1244466635\n11425195\n1008463091\n78757254\n57922257\n1198837082\n2250370119\n69106270\n2247816408\n604386463\n79863391\n93571779\n907143034\n91489692\n145002487\n519513168\n519513168\n61340813\n444775567\n135742774\n895986451\n701928699\n1293761777\n278723673\n285037307\n459954076\n713002743\n202160545\n439482781\n54184809\n81983705\n137774\n165817317\n547091032\n171488067\n722102244\n1137965942\n321929146\n215905952\n321929146\n55908092\n321929146\n50407724\n5438205\n833717069\n114109886\n92569770\n783073552\n498580496\n564686964\n564686964\n564686964\n6597176\n1051118894\n564686964\n643965665\n498930647\n552340164\n597680744\n369058868\n63050748\n597680744\n597680744\n564686964\n597680744\n57996017\n597680744\n209831221\n544059805\n877770279\n36994343\n35744277\n512402149\n1184849988\n3668708\n877770279\n428758235\n481627264\n185915638\n16804680\n1579312279\n219671764\n1579312279\n185915638\n1579312279\n187866202\n3250016754\n6264019\n231020494\n474370962\n1334915513\n371544746\n262417353\n542475481\n654682649\n185606838\n344841646\n5388373\n344841646\n290527620\n54359516\n297534305\n1017219615\n949679147\n361486275\n361486275\n1914239\n481770451\n200223888\n168138474\n91457505\n1010616144\n1513768875\n143640172\n1513768875\n2659174479\n1513768875\n1513768875\n51448522\n9451687\n250712627\n71195010\n45496017\n98698740\n41851393\n100148950\n383165836\n806112161\n317774674\n806112161\n317774674\n21153685\n743274\n906266076\n291943738\n723416554\n317774674\n107850445\n807761196\n38573764\n579430873\n254140542\n254140542\n132484444\n17324686\n718280421\n718280421\n98217008\n276399080\n787249101\n27965985\n542438786\n15310\n381944030\n231418174\n1046652783\n667001620\n612510456\n779103461\n201271858\n120392427\n269113068\n2452379895\n274422895\n72787539\n40660907\n6358539\n265594645\n265594645\n87124730\n24622630\n27283688\n629225023\n236113427\n581863042\n162046675\n138913956\n246913571\n484507047\n714091919\n232662857\n342945267\n232662857\n324826328\n47891399\n232662857\n359019020\n673528274\n232662857\n232662857\n232662857\n659121588\n161067771\n406142657\n366354357\n659121588\n2479760989\n48134528\n23562227\n103741457\n257009702\n1541087827\n474163039\n11838379\n108841684\n50575308\n1650014792\n2354221775\n1088164417\n807593149\n2109065587\n2354221775\n193831585\n193831585\n2404801828\n813173063\n792052454\n193831585\n84055071\n1018709379\n13169072\n54862751\n195839328\n58226565\n1018709379\n1018709379\n1088164417\n7339505\n1604018155\n198507716\n461640843\n1232283587\n175513234\n41693079\n979237452\n292400018\n729133782\n41693035\n292400018\n18931880\n152415362\n546822627\n292400018\n378105106\n292400018\n1438717605\n1183926578\n291279634\n834319918\n111424891\n175018313\n1202592411\n44087042\n2594083621\n889788490\n889788490\n26473130\n1356961396\n628314896\n2764485\n913432637\n25527659\n181888209\n328517166\n289672326\n2995148\n988729600\n50728592\n236659137\n266129248\n620003567\n60459747\n158630801\n1725658157\n59408508\n66625609\n1671014680\n36479440\n580419139\n580419139\n39210914\n3259618101\n669967006\n941672902\n2113096746\n941672902\n152732983\n370281694\n6111010\n440001971\n440001971\n440001971\n160474723\n440001971\n212939763\n208706174\n235914027\n2573887509\n594676973\n594676973\n1229310877\n23785024\n8424518\n157842891\n138093087\n23785024\n23785024\n437094646\n8424518\n13782\n396015620\n435322720\n9061615\n23785024\n138093087\n483346391\n550525771\n274795763\n398599339\n793042237\n74297462\n16295642\n71984682\n22375206\n402394813\n260446148\n390769214\n100548630\n113280527\n23785024\n18689403\n792456435\n814741611\n860845286\n193963481\n814741611\n860845286\n1170261\n792456435\n457816175\n131707242\n834731773\n834731773\n402191018\n873916729\n1192446675\n1235367084\n63454370\n970839246\n154050117\n868736299\n868736299\n1235367084\n8373873\n1185397368\n251900244\n60993141\n424691270\n2102422222\n883789584\n1326033144\n1326033144\n398992634\n883789584\n2102422222\n31934280\n263943178\n851276120\n69418241\n1050400226\n331864937\n1423770587\n83720611\n56390484\n165845719\n2364148778\n296734960\n331412817\n512998806\n245490995\n38528039\n714515378\n32905824\n512998806\n512998806\n785062617\n117082790\n849352605\n30299936\n512998806\n189605171\n246703156\n869721419\n640164792\n849352605\n423982891\n587378392\n555879922\n555879922\n555879922\n555879922\n537123359\n475970144\n737233935\n638390666\n300333520\n121968102\n395059195\n133545682\n228925859\n555879922\n64569487\n1379508027\n555879922\n2285596169\n555879922\n283386328\n250319561\n295349076\n579561320\n337450\n882175936\n1571331296\n2228700060\n109572963\n301168639\n1369574995\n20840171\n78591703\n74985445\n778004230\n778004230\n234261952\n60664460\n26242152\n252050996\n36598945\n389202540\n28128736\n122989960\n58022725\n378710202\n135317836\n2917284\n774647561\n12209242\n979579010\n62600063\n172825132\n897738106\n897738106\n43759601\n897738106\n562880522\n1641197123\n265369076\n53678330\n626409836\n84077506\n77024460\n458566898\n312205579\n2939614602\n902502618\n52977853\n256233320\n275087643\n77557525\n35418477\n16186291\n182390040\n225276851\n255574601\n55044513\n14032380\n64274098\n252945885\n310794310\n86701592\n712425113\n146043098\n235006175\n812869197\n139985843\n8415473\n5794485\n432480749\n2958219960\n86826476\n28110673\n3613885\n381121732\n779472716\n29021054\n245953065\n102493215\n102493215\n142238470\n111415636\n82527649\n84650702\n1351700335\n894658994\n894658994\n232825993\n17622743\n77050903\n72962588\n372066790\n205442599\n95926345\n151307934\n20617527\n2530177281\n86988452\n689539263\n689539263\n267653165\n1040126\n591916545\n3668795517\n2494311049\n627710623\n376339064\n914883993\n479787383\n479787383\n336060698\n204302034\n479787383\n1202616410\n2125830\n18673356\n95977235\n733387526\n352188299\n612900715\n101174985\n46886747\n655060584\n655060584\n612900715\n602252030\n732530816\n732530816\n732530816\n859530594\n859530594\n270727464\n121197388\n1121985\n859530594\n137958774\n859530594\n141964954\n48532770\n1774893089\n492652868\n325533399\n151122172\n626412646\n820729769\n240660957\n777100079\n189540644\n231488680\n195106158\n803785423\n4391749\n84766013\n9270305\n89759023\n168172704\n27231691\n117425950\n1815848661\n822138870\n1624716164\n41553517\n1815848661\n3362763291\n1712037636\n246520704\n835716269\n912308942\n488970861\n64240126\n348460177\n262522164\n64240126\n721687258\n149445286\n253741070\n1729947308\n140118420\n64240126\n207528696\n970600735\n360408000\n62650222\n186007710\n781765277\n130024436\n998311\n749935996\n749935996\n35002164\n44991669\n1512645494\n153845622\n482873714\n1512645494\n1368700575\n749935996\n1368700575\n130024436\n4862919\n74794478\n199975858\n156044933\n9599623\n4632170\n221623575\n1422377566\n822759352\n16673964\n288739559\n2367264440\n388872525\n3086637013\n177207228\n438964795\n55243500\n1117157382\n570981780\n24145816\n639768680\n639768680\n245337620\n226550886\n76569628\n1255303058\n196785069\n1525430681\n68744766\n104316\n2594350\n309666698\n160973305\n864307836\n672832632\n169043033\n672832632\n144840293\n113670560\n726908197\n864307836\n1159216560\n2300094036\n81565907\n4010410\n603119134\n1472300776\n1159216560\n315571878\n206797393\n529077359\n176202477\n461850917\n36989411\n670382365\n447702903\n1846629569\n1290245340\n348517562\n137286884\n692602092\n291905403\n670382365\n569497285\n285546368\n188973544\n597816895\n670382365\n48824682\n2800034256\n233523266\n402697080\n678462338\n104177935\n104177935\n65531957\n23064793\n474037977\n402996534\n341327421\n897347631\n52088713\n897347631\n32612937\n341327421\n897347631\n897347631\n897347631\n526065231\n526065231\n1472711200\n178373230\n65186942\n368643144\n206629088\n810103783\n550422282\n382939868\n302056538\n1854065693\n2397742367\n806306115\n70036772\n2442698\n61856305\n806306115\n7042026\n4150215\n41913044\n41913044\n468745099\n370304859\n119205928\n487708411\n454855542\n518137914\n14125377\n416392612\n454855542\n435572704\n240719382\n629322707\n629322707\n432889039\n454855542\n2493296\n73522242\n19515825\n470874530\n75390860\n470874530\n291730618\n80556187\n372866621\n470874530\n383943091\n1152645144\n10762536\n191061509\n17841768\n4596229516\n153250134\n666657811\n48002706\n2060799814\n93656387\n92958304\n44585447\n240203396\n135079214\n111223540\n111223540\n216702806\n101106631\n216702806\n323961302\n87028141\n57044149\n15683085\n114472052\n216702806\n58743968\n559851735\n7066013\n229474299\n54718571\n627282123\n627282123\n627282123\n469769175\n37304007\n5183195\n658713252\n85067574\n586000947\n180547958\n595131633\n595131633\n269241961\n269241961\n19173921\n97130384\n672083076\n27639173\n259277968\n49310358\n108973104\n286084384\n73682195\n409658589\n43394775\n526058147\n1297919917\n954380879\n563701234\n1163457786\n42881762\n243545800\n202007797\n1920731672\n627282123\n527557144\n1537384546\n43145168\n208454249\n3840788175\n2765146026\n3757017547\n2034806716\n590671245\n588804587\n7009990\n2705477595\n2330648062\n448388534\n40702515\n151304719\n338978170\n4717981\n1469686375\n571740253\n143213688\n142979304\n1280073102\n2249441564\n1890818619\n449567122\n293779057\n253902200\n69634369\n103276536\n1921330266\n519857065\n363215902\n937845854\n1163245162\n54934382\n855595332\n402555308\n937845854\n13321984\n402555308\n254076392\n855868692\n379482403\n70641104\n130158019\n30205361\n130158019\n273973251\n6419504\n3878292\n97140522\n169545255\n119561410\n718690573\n830335390\n30086002\n172387672\n180369998\n388859906\n76319510\n509138923\n1067768258\n123344264\n274043778\n1333421467\n413439982\n1067768258\n557805087\n409771650\n131169053\n589970651\n589970651\n149499280\n589970651\n589970651\n14380557\n47238744\n1307552557\n123142426\n2532641482\n2791266081\n234801834\n1903313026\n406398510\n2791266081\n433894157\n2791266081\n874832867\n27569547\n109020790\n2049843079\n28601185\n2049843079\n238837657\n2192167469\n457983742\n412023431\n412023431\n2049843079\n1057984287\n814373533\n473051200\n4641071\n69019607\n151158043\n433123926\n34819584\n609457571\n318200709\n463250069\n924817725\n285932526\n107004518\n1024853244\n1024853244\n2634691\n1024853244\n842533360\n107004518\n13853381\n270788242\n196829096\n269704084\n582925471\n141891210\n323687693\n139991927\n74583538\n40998060\n362121462\n362121462\n528085225\n178703324\n362121462\n270285026\n791359211\n1560388021\n28609324\n268949114\n446565769\n268038049\n82313098\n82313098\n766002601\n674775394\n82313098\n428088333\n25006856\n107103543\n107103543\n3499465\n16100078\n158084292\n82313098\n15231659\n59464973\n107103543\n680353509\n766002601\n7061783\n64099011\n439178769\n155198606\n631853202\n155198606\n5973151\n260234561\n462768887\n127531880\n58926662\n783396890\n346538674\n609618019\n609618019\n697388162\n256477921\n21320182\n21320182\n64099011\n4704141\n891151753\n61115680\n146588064\n740923380\n483077032\n16568442\n176940242\n64025441\n612298420\n243434826\n222636\n848277488\n397061422\n1270424752\n1270424752\n2052905125\n3139117847\n391293491\n779199483\n1315638\n373589101\n373589101\n874933306\n469646726\n527619686\n129137041\n35177504\n16568442\n212607269\n212607269\n361714239\n11219652\n53826487\n212607269\n179460324\n131495008\n433770000\n277556100\n886636174\n20401264\n8762966\n732046876\n497000121\n530429284\n167476508\n109799915\n571946720\n1790702026\n58274954\n71749909\n1790702026\n1790702026\n571946720\n977523859\n580179350\n3157334876\n251637766\n3433556594\n230574655\n20984600\n220078270\n173547688\n237429950\n1192273782\n359398238\n736480729\n328976486\n18827473\n2530793529\n1385860949\n487097846\n369075231\n11703114\n369075231\n128805443\n88570391\n88570391\n413972584\n128035012\n392552781\n88570391\n301096238\n652722191\n301096238\n977064316\n180595091\n664699455\n298242853\n17261181\n277377729\n33736216\n51901706\n79163100\n600737287\n380469990\n380469990\n149052200\n71404045\n5447190\n137339975\n689741729\n397968231\n197051525\n95272560\n33813168\n196746912\n289965847\n220235299\n74940244\n289965847\n277820296\n84070358\n1259017310\n249289344\n319978903\n769281920\n574338353\n1131973253\n1771053499\n1172847473\n769281920\n312229252\n852017495\n168618421\n852017495\n852017495\n168618421\n439233651\n223056412\n666885243\n3846815\n1178059713\n1178059713\n221453095\n305510186\n2906535\n769281920\n168972761\n257102106\n20652544\n109431086\n9876636\n338377951\n9876636\n81938205\n182312245\n1683020\n827424595\n396102388\n396102388\n670951426\n396102388\n173857250\n704538259\n658930964\n704538259\n294477271\n64896373\n723175004\n69306682\n723175004\n723175004\n298320638\n8523293\n5852976\n931122282\n931122282\n459681087\n13927282\n22821402\n196601441\n378719494\n156347622\n916612230\n114868813\n916612230\n916612230\n916612230\n522115866\n10602104\n14501937\n977595987\n146709652\n521862612\n380406998\n633852208\n564740799\n433795837\n633852208\n433795837\n180383296\n374076934\n518424970\n387713280\n495119628\n609578928\n625877880\n46552452\n23772183\n374076934\n438060083\n146694083\n848480812\n146319454\n175983538\n75469968\n117640334\n60832998\n1068358151\n545849365\n257763448\n1434850303\n467234547\n199807983\n480613708\n480613708\n334608655\n581430205\n410477002\n143349764\n25656964\n733124680\n581430205\n1741920045\n1195345573\n254743350\n88649289\n14860964\n1355486027\n2754644311\n5748147\n115626855\n429195549\n220677872\n210465178\n763496478\n1479458481\n239804901\n92654607\n529230978\n92654607\n47629849\n561054836\n1169896232\n192913897\n1510967053\n460719966\n319010079\n1510967053\n1510967053\n484640726\n90833043\n81744526\n615383863\n43679176\n1510967053\n56217137\n580610483\n615383863\n701496003\n176993624\n317135378\n317135378\n633602216\n633602216\n39489312\n633602216\n587547556\n400424322\n419154982\n125071516\n468354749\n449624089\n5175158\n1020026351\n72267165\n72267165\n244890020\n1020026351\n59349249\n192958857\n192958857\n94347593\n51927781\n603690331\n900015358\n335404470\n269910048\n16244516\n194368052\n653517513\n653517513\n76341730\n1630034044\n1714009934\n410896063\n1401496058\n66053554\n81573454\n31147086\n325161968\n1415605695\n1263366212\n1589907\n2460558070\n8630826\n247856193\n108358073\n96400257\n560298689\n2970951\n211832907\n750213092\n237638580\n25950631\n94246277\n598771537\n14208724\n1346197390\n750213092\n75724254\n410120544\n332511599\n396227566\n269489332\n90989770\n396227566\n417009465\n396227566\n305801844\n156814719\n357217160\n392854273\n396227566\n396227566\n443336958\n662173724\n32798279\n76571324\n81250894\n66748078\n411754389\n328230626\n1121994347\n34786414\n74358971\n83607019\n253267546\n50481690\n636498094\n263379059\n1041730061\n961401363\n1916360776\n1041730061\n15523860\n688424012\n1472848472\n1594115164\n297100517\n804179177\n37910542\n259347830\n140562330\n127362207\n138679474\n138679474\n878981929\n10077468\n415530906\n138679474\n878981929\n599447\n229263657\n362273126\n52536232\n698298024\n698298024\n215810380\n698298024\n489155692\n2173911183\n80375816\n80375816\n524203998\n169734376\n40410168\n923067951\n1472848472\n95173199\n8892544\n923067951\n126183387\n8892544\n93388465\n7455335\n1511128809\n80375816\n30718952\n61649745\n548228359\n628772958\n767825968\n310159091\n1655937579\n1644808670\n21848074\n301120698\n1511128809\n643963622\n6858357\n1018759452\n368073072\n241901250\n135515000\n675511440\n27723540\n174296848\n25937212\n2144199419\n192911572\n415330815\n507868030\n772804162\n1043650815\n599716618\n803429362\n250680003\n1043650815\n803429362\n296540377\n1283683105\n427595138\n51547607\n735237737\n560684423\n1283683105\n693979800\n27150041\n42075213\n865371444\n69615329\n191928382\n759727541\n38300054\n1131380288\n1532210931\n86692358\n618293669\n618293669\n618293669\n603426226\n304484451\n16283550\n914392622\n539790663\n77051855\n360719895\n924549541\n539790663\n1831937255\n67002804\n91149142\n92783247\n1407470592\n273262337\n3156953746\n2472463401\n587151454\n113707571\n26082157\n77891336\n119912216\n528610891\n45440386\n528610891\n8744047\n293454085\n528610891\n550351746\n1941381857\n1941381857\n109938727\n414305238\n63668739\n325449351\n482015026\n1982866937\n27984461\n2397158014\n237957733\n244554514\n50348465\n175386805\n244554514\n150566621\n438870974\n380325021\n203885720\n907151662\n591384818\n2493279090\n715383247\n80978325\n1112136665\n823649650\n1071878641\n411668462\n475099530\n659106030\n51076168\n522369787\n474395391\n853059924\n1071878641\n870351229\n351001834\n1553528127\n469297340\n126216396\n210819321\n431696996\n197343131\n1263220984\n1263220984\n357786190\n1721773461\n1263220984\n88044027\n2244254\n1263220984\n1263220984\n1387002178\n835906408\n52058062\n138566713\n1272298505\n546262287\n2410042\n8629824\n1572749062\n189728780\n172577220\n326384301\n59966\n1264632899\n1138796749\n1350371777\n2935056928\n1721932085\n318853090\n2096164860\n40485833\n3232457008\n165885072\n49236181\n422860749\n353594646\n683934703\n683934703\n683934703\n683934703\n348087412\n33390270\n557145406\n858660756\n227940268\n86928525\n685093580\n465307628\n479172396\n8556126\n499444618\n419833681\n1968214796\n2755470\n3410404570\n742895166\n1097527736\n128155461\n424991934\n13899467\n111303358\n99182365\n1096468566\n51665657\n850428515\n850428515\n1724876763\n697463732\n67242259\n8420948\n16552266\n672474684\n11215074\n1631137423\n26437490\n161146234\n338735974\n672474684\n267070167\n1254696605\n26437490\n784474871\n49129619\n376097545\n260777928\n1688944561\n814030648\n814030648\n704261236\n704261236\n704261236\n5740\n519824186\n811180649\n256251945\n83381345\n5891070\n519824186\n58785057\n811180649\n791289856\n215115683\n419675394\n161305326\n862019103\n862019103\n1247408367\n708697570\n473958853\n1530253782\n195427644\n719133513\n7802040\n296227133\n672012049\n383710248\n835726298\n383710248\n346350662\n1760940118\n878466944\n139921735\n22624401\n849819549\n105799715\n292688117\n191180106\n506835718\n599108175\n30908793\n237453515\n708806387\n54165702\n599108175\n599108175\n3261704\n1914607018\n213304216\n60007030\n213304216\n39521462\n213304216\n614660988\n235302445\n1349605979\n5480385\n528506445\n950718575\n444567427\n4608394\n86466835\n1327728481\n339842407\n1777523646\n447887700\n358696633\n1382322323\n230411240\n1382322323\n10640616\n3120224678\n220901678\n2576754278\n917293806\n816856805\n681374054\n900083293\n215432523\n136531116\n588796520\n402525646\n750258062\n90587431\n1797572904\n526574302\n163210035\n2646011\n3986092729\n417038774\n328619644\n26605620\n1018867473\n309676624\n784277859\n2263642197\n531523905\n97139375\n704261236\n626480847\n334780576\n579970092\n862039719\n208334885\n784277859\n603293354\n25494800\n175343474\n1584647637\n114672704\n429325381\n114672704\n2071142256\n114672704\n114672704\n114672704\n23656060\n897256107\n2526529\n114672704\n33915503\n114672704\n123292047\n114672704\n176552382\n17910519\n2071142256\n2917551\n243555589\n1142366257\n875095907\n19343898\n746157121\n1610188\n232888792\n131536368\n210980128\n210980128\n96616905\n368584368\n51674822\n47601092\n210980128\n210980128\n1117983572\n128082490\n3472983809\n678744436\n372887415\n105754010\n253748074\n65163265\n2560624742\n91289736\n3382627837\n1585123986\n385308365\n15556793\n916937502\n219033249\n459474955\n4418444908\n1288350152\n681580978\n593733211\n1028460329\n177381993\n724283946\n724283946\n454328366\n104766022\n742476069\n475025093\n58179450\n154248342\n855428916\n256018651\n16340585\n2099727994\n417612245\n1333693081\n15469061\n1481092576\n2156336743\n1481092576\n188273306\n334970989\n54511692\n1481092576\n41378263\n2156336743\n678447750\n1426220935\n813920437\n1136939451\n1465556285\n222683123\n813920437\n121441826\n26554559\n1539699592\n417612245\n399580687\n572658992\n58002077\n653801802\n58002077\n274673718\n324788344\n977781963\n492220231\n467481281\n347496800\n1288168772\n492220231\n531387743\n492220231\n399580687\n97006783\n298505772\n492220231\n166980792\n492220231\n33577029\n587202357\n27970998\n71128320\n71128320\n61637928\n155852165\n350954214\n570731357\n787671592\n8636365\n204722369\n350954214\n350954214\n675237682\n427276662\n427276662\n427276662\n345161822\n209424499\n697611848\n209424499\n755029110\n66265520\n697448031\n597652448\n751577777\n1051853215\n460223332\n224239561\n468961188\n981521629\n981521629\n27407222\n732147475\n156112181\n794187549\n1236602440\n217240764\n599403028\n981521629\n29774919\n981521629\n410293147\n201360694\n981521629\n417454785\n52699473\n417454785\n27415731\n19377438\n697448031\n29136552\n43172280\n229989293\n842151442\n229989293\n85389906\n229989293\n904510853\n755444751\n354000375\n470270668\n974962084\n1079189\n5679105\n7455096\n474892585\n224483806\n427871619\n343530526\n182184243\n342956690\n30032636\n562745979\n233896277\n405311441\n48450163\n342956690\n342956690\n342956690\n245511118\n74734663\n22680064\n1591457607\n1581480733\n374503398\n342956690\n463711065\n484707150\n426445792\n323121752\n202867733\n59823045\n436855195\n44770982\n283274861\n251934444\n399661510\n545579887\n397917395\n949219616\n235418402\n821185253\n70054809\n5545561\n176231859\n56059552\n112931675\n810796603\n354000375\n365881511\n126988773\n44334\n1517081343\n2448951524\n812051249\n812051249\n71325358\n50371047\n51438156\n660225584\n1879123\n809090977\n33034610\n218742798\n618161398\n1879123\n147820470\n2469606042\n185179878\n489285917\n9864846\n657141869\n1606154944\n36156612\n186251699\n1353476420\n3598817\n593155917\n847397197\n16578140\n301203815\n1492510023\n304772924\n2073957781\n47472477\n1577197957\n208518099\n142754105\n23251103\n382728034\n933779832\n306722686\n239100456\n32800207\n888932565\n888932565\n36584786\n1239564411\n81995379\n303718817\n6928734\n1622351684\n2052887103\n830432338\n9286715\n212410180\n678051433\n51891711\n1314629759\n68217718\n884030573\n445950509\n2008541638\n112375312\n482390788\n100054720\n627609774\n694882534\n1569217564\n1304754650\n596190141\n483922952\n1328313821\n3499478\n86876306\n868282254\n377828736\n163157223\n554005355\n844429123\n1011220710\n554005355\n1011220710\n185858014\n29593786\n176848243\n98567828\n140820462\n114530045\n708460707\n53769545\n862702542\n377828736\n277024242\n920049951\n380595969\n862702542\n176049726\n1413731938\n1202142694\n1720909712\n140154184\n227769719\n444608124\n37193073\n782370400\n203375045\n515525070\n835999385\n835999385\n10156488\n238234343\n1626822457\n624142199\n434464378\n786438108\n373916110\n212945730\n774380351\n674344042\n97192484\n521744697\n152700991\n674344042\n298117566\n1186864269\n394775840\n123370896\n77714320\n101018413\n67951786\n225689276\n298117566\n6435440\n31660600\n209730476\n820455233\n820455233\n820455233\n820455233\n820455233\n346173731\n687751636\n687751636\n297936779\n122128796\n817523636\n286409197\n192712043\n427708779\n76779163\n48038596\n788867608\n74100571\n96335666\n126621554\n356000457\n17625603\n443434722\n1015831299\n232125874\n456393763\n48396025\n1387689573\n199842172\n277662153\n123269006\n23835179\n920295845\n386590967\n25195421\n193066015\n382467078\n166518551\n108820524\n411859891\n1353377\n666235147\n22310291\n577376266\n666235147\n176976893\n34432593\n572976675\n54358435\n53854052\n81140201\n2353171980\n156268064\n930158161\n133337024\n930158161\n222467047\n916493143\n291349865\n391451013\n2163658017\n54358435\n102828443\n1047577185\n2934965864\n46444157\n1342771603\n294383925\n212710225\n65080110\n15687\n153227367\n6100653\n432641113\n13438074\n121674762\n624894663\n812601055\n102726928\n2200192281\n49473441\n1729795009\n3489046945\n1729795009\n614029396\n503307155\n2083739755\n173721276\n121653870\n94789980\n400365233\n582032143\n1961741757\n203516849\n43230385\n91849157\n93807474\n242659336\n242659336\n726024549\n107413956\n77290570\n473375031\n319316608\n319316608\n47155377\n4106139\n227419718\n36209503\n506335822\n823442889\n183597325\n193009570\n23841339\n1186889690\n253941\n101440954\n84015161\n547655159\n28224474\n317615242\n195118848\n242173955\n9062656\n31197726\n664298640\n117622533\n2026433\n986171612\n661162051\n1478977566\n784856\n89745666\n141441587\n720016231\n9078088\n79806666\n11659116\n174757691\n61836729\n731982052\n23574529\n702169370\n1606976784\n661162051\n630\n276890184\n393554751\n17747615\n208524981\n2405860063\n1496287087\n222203448\n411053531\n12932831\n994098390\n994098390\n1488897215\n381654640\n592945845\n718347577\n718347577\n2264824257\n11243513\n554249880\n49875309\n160047839\n257486535\n617272399\n694395930\n1316369635\n442492952\n648326738\n45832959\n80304426\n795386143\n668186048\n253105684\n884709738\n143683021\n214263051\n297005173\n331253755\n331253755\n331253755\n115584085\n192033591\n658447992\n545544780\n89935610\n8818073\n664215529\n185722270\n1401752600\n580975723\n629206277\n1342528548\n24746550\n240510152\n702868019\n702868019\n28389768\n207327837\n62226037\n654654358\n645619029\n10819523\n1214218925\n838282143\n1021555811\n164384720\n145584712\n262220917\n1216635960\n260615657\n268434371\n888460704\n194542862\n337509064\n1643755980\n306951804\n450306907\n660800176\n926985372\n384824343\n400085853\n942678288\n602317868\n71561771\n272676315\n55859649\n33650228\n268653671\n55859649\n55859649\n55859649\n55859649\n362164364\n724767807\n451239021\n278527555\n18239498\n660933909\n136088462\n15541690\n39340274\n731787827\n255216556\n96499243\n665984525\n830920899\n135648931\n135648931\n598518916\n428048922\n598518916\n1753504\n64540540\n155379442\n155379442\n1005247895\n155379442\n138628931\n1250770439\n382329716\n657617874\n828485023\n1357469243\n1470470363\n1408611861\n643408833\n1569548341\n716219666\n167876574\n643408833\n375225150\n313633798\n643408833\n101360022\n1289771123\n39008665\n95875508\n39008665\n427667085\n477396154\n39008665\n331902508\n9260816\n238669620\n325671707\n663963257\n39008665\n1470605790\n108625281\n207222780\n2177738200\n208256909\n635581796\n101919603\n635581796\n574019108\n761952732\n530884922\n34119478\n51976832\n6795315\n306775785\n235738542\n105539305\n808890632\n46703006\n335306709\n97839933\n283955144\n205656454\n871429005\n116222279\n871429005\n298749110\n395150465\n219463723\n434275930\n605241\n9721472\n1559397731\n102737742\n167101465\n16134893\n617562528\n738022385\n665345920\n152754469\n113403033\n4776778\n316532398\n6932413\n8411633\n1214658863\n1554752879\n71048407\n660544080\n24271482\n98233569\n660544080\n1230121950\n648929359\n19658548\n578172468\n40607125\n9971128\n24062226\n585916737\n648929359\n353797353\n110462289\n43752300\n82347440\n22064224\n567650890\n1382643007\n700034542\n700034542\n319365233\n453453273\n107420960\n87042950\n526635829\n796208456\n144462334\n102529043\n661555612\n176022173\n94551577\n126776670\n57032412\n2450368262\n7275263\n610052\n122107849\n880113184\n764280469\n764280469\n764280469\n764280469\n353276453\n73488079\n384491888\n45509384\n346102884\n54601446\n159816951\n341932937\n52281468\n447293669\n174430279\n219887285\n29951139\n1064706381\n1487053913\n508989114\n639220761\n156775025\n318150227\n27403300\n27403300\n45682696\n764280469\n448326738\n462335338\n462335338\n462335338\n268714270\n495123616\n612086660\n232981574\n60191578\n168879339\n1755929\n705482867\n290508941\n473355346\n399557729\n399557729\n567156762\n399557729\n59797259\n1000796131\n44555620\n597302252\n453453273\n453006760\n108995747\n15124147\n410414417\n401878284\n175159052\n275244436\n77225223\n168515372\n87570987\n6614\n168515372\n345192934\n905193730\n312871270\n3859943\n510063394\n263103721\n1559397731\n623463090\n16518936\n99660978\n790531518\n474172828\n622405697\n396070839\n622405697\n14592399\n214202750\n1359700012\n13927560\n23519744\n15486362\n756529084\n756529084\n654056240\n134995950\n1855508143\n739173902\n192114633\n228052769\n493362706\n627406119\n627406119\n22956755\n627406119\n150068871\n1189550041\n241564640\n14545606\n303338664\n512356908\n22831753\n488561548\n55841380\n55841380\n424790839\n325646632\n606365728\n396459668\n75837649\n1158979788\n26056933\n358489838\n1910434944\n296923326\n296923326\n121874382\n1158979788\n466734316\n155773419\n204326139\n238104921\n364760139\n21929173\n24209777\n1030044261\n885159112\n1030044261\n721582744\n86627428\n721582744\n155735444\n24767938\n802883817\n693291557\n1228267593\n837624070\n295740107\n134382085\n1054490095\n1054490095\n55633102\n512671968\n268118614\n489235558\n925009457\n477303508\n2288702\n965300270\n843033019\n843033019\n118419109\n265245096\n194199928\n389687737\n664094998\n452093298\n127158470\n891166018\n52921371\n59471531\n891166018\n2095682\n1412333799\n7564312\n10952534\n52228790\n891166018\n54440812\n671311678\n40516973\n891166018\n82624553\n1640469625\n314197525\n217800010\n891166018\n99459036\n455059479\n1259914256\n1088446330\n891166018\n4934494\n176804195\n123050062\n897865965\n9823970\n354393115\n2106947766\n1134093250\n245100582\n191858275\n472793340\n17604146\n2557657\n274171\n258590486\n472793340\n949448276\n11620082\n1051373074\n28705027\n472793340\n739173902\n109056932\n95841250\n28705027\n124439436\n370265993\n11086506\n311788063\n367770337\n398695815\n367770337\n1675815131\n374460922\n617996874\n374460922\n61238771\n1675815131\n64552359\n198214248\n891381538\n162826291\n759644512\n690033760\n181996560\n171128094\n2349727284\n239544282\n801698351\n866060291\n922076275\n11631397\n652750852\n474973183\n204697710\n1100214853\n258041232\n327817995\n115876270\n749973941\n255264264\n630631420\n371727898\n652750852\n371727898\n646228796\n315566712\n227432186\n176343700\n363943464\n879638463\n342063027\n371727898\n114684816\n371727898\n389479179\n566359632\n26810\n289740393\n64677564\n102599287\n342063027\n566359632\n418314408\n1831092966\n8484904\n24508432\n344757721\n652720576\n49504112\n1935229542\n515167901\n405236041\n124194458\n173097520\n416459687\n18283517\n4620521193\n13428236\n172937895\n566855145\n432232869\n432232869\n34735158\n868841784\n22712784\n336166591\n300467939\n307341926\n196758091\n1405612043\n397156177\n1405612043\n237465538\n397156177\n1405612043\n437175931\n734594101\n1540098150\n731716579\n1498474011\n589430782\n190366227\n36669971\n821622049\n639227968\n821622049\n47727230\n65628009\n13958312\n113485691\n699361755\n793906241\n793906241\n341280335\n2457553\n379403533\n339901566\n194101924\n305334729\n247874715\n324839606\n809394082\n41227751\n236728731\n355180081\n355180081\n355180081\n87423544\n9377738\n16695845\n56323528\n513956722\n90218069\n412152336\n1010734833\n6402974\n513956722\n552921909\n172055966\n325155687\n784812691\n1684486510\n314202062\n669468140\n669468140\n308046866\n3240970\n669468140\n389116634\n4575118\n87793919\n706892075\n341676234\n139501321\n86199079\n971159135\n1723604577\n193529245\n427315080\n58124486\n14401048\n240180401\n650896741\n196456963\n367374900\n196456963\n195243119\n367150125\n1796180\n25730713\n235731285\n585549233\n408078026\n41613460\n160620460\n14778314\n115037665\n29744087\n80788288\n402305814\n402305814\n356228331\n402305814\n224624368\n14544999\n3972757\n594495614\n382179553\n12840409\n766708737\n402305814\n794310673\n409664847\n1411475033\n817675343\n240180401\n512313630\n512313630\n238261056\n19577629\n1114972157\n1313648852\n514723740\n720144934\n608415339\n299006000\n1328232806\n56100479\n249481924\n2697718949\n175756446\n121454139\n2697718949\n246747479\n72725591\n293926082\n192131320\n192131320\n2697718949\n8400467\n3045353606\n9012552\n121454139\n52949833\n617060242\n1178693717\n219873174\n1178693717\n144930770\n305030001\n756494813\n193659482\n15205082\n95896226\n349247467\n629669389\n177887989\n391350633\n629669389\n190352890\n350708908\n46980705\n366691668\n136628162\n58322876\n9565997\n1277066206\n1277066206\n275034931\n330341114\n158480598\n1666690170\n2877093255\n4021664401\n417598616\n82514222\n20886958\n58541528\n22695669\n751143773\n664268593\n298122660\n45976980\n135953150\n860553470\n125589215\n21903768\n176648600\n596553728\n86279700\n860553470\n1460944\n1781146448\n619971291\n194394480\n2084305972\n18566588\n2307470240\n2543571093\n1781146448\n29256587\n8703379\n1254500584\n44185203\n351942255\n745237709\n745237709\n209806430\n188386555\n17180177\n86619628\n315875750\n15816722\n309377623\n155916920\n38111260\n1075287730\n374876622\n743737747\n1300430658\n123988761\n40100908\n63438542\n98639024\n381966717\n596652483\n381966717\n118969736\n615271401\n1178700546\n174810224\n4703329\n450070683\n160309473\n551482506\n127460109\n442887995\n1302655296\n381078966\n479125816\n49297258\n568988636\n600750175\n48199314\n2892694\n926209388\n156119284\n92050842\n916290667\n156119284\n517265466\n350623162\n916290667\n176564687\n19889269\n22468937\n294642486\n1953444057\n7084128\n592282888\n604656009\n38640381\n551845189\n551845189\n136056444\n368181404\n1182633\n304414913\n248869941\n123750826\n220763298\n20950975\n395814818\n1595446274\n2156257553\n407190575\n43420513\n407744463\n419770127\n198889948\n1120651182\n490667789\n165001353\n170063664\n1031814210\n1368784492\n122103597\n366141538\n392743663\n47529282\n261031848\n47529282\n764223\n52494774\n96354407\n557723996\n554201987\n557723996\n14436693\n502621783\n218985595\n19930260\n290071280\n351581839\n645426433\n789428052\n789428052\n789428052\n741467047\n38041708\n351581839\n739264889\n96354407\n101416172\n830143900\n268190378\n830143900\n803543169\n1336775307\n803543169\n494334170\n4004008\n1514653284\n10715634\n1050189640\n6285662\n1305116265\n114506460\n782753330\n79656362\n255206664\n10772856\n255206664\n255206664\n209460665\n612494626\n153331833\n37077620\n732124623\n598484975\n33054030\n285845982\n598484975\n7053003\n726775573\n399846542\n111352547\n426576766\n518304559\n506173306\n150510576\n506173306\n71607286\n714828020\n219551289\n1028407480\n158788889\n636802191\n701412934\n135630868\n971761470\n1518060766\n52752680\n52752680\n230396808\n1498912745\n67407813\n52752680\n1289083114\n426599646\n158543143\n649690100\n1212290728\n283038880\n144139856\n11010\n319419392\n221274471\n130839009\n271013824\n281869200\n140352421\n281869200\n281869200\n14157923\n702684548\n20879133\n607538158\n298223\n8760867\n52752680\n1448151022\n1206178245\n3327719\n48987252\n453378982\n731725640\n667942310\n1565919008\n1958653865\n37094342\n447057065\n447057065\n783134243\n166466965\n162667880\n38697977\n537875302\n38697977\n1169535128\n371363295\n1169535128\n251279759\n1169535128\n1796934624\n251279759\n1796934624\n2705371198\n627437981\n887391691\n85200894\n627437981\n446800\n603193368\n2030922200\n1681110941\n681179244\n155670177\n155670177\n217943247\n155670177\n664800557\n323416461\n399385199\n142294803\n667255296\n186128985\n965387149\n1796370562\n195634633\n1580680927\n414148228\n232095857\n332220850\n39714042\n159486329\n912889702\n912889702\n443312046\n1829382879\n912889702\n1829382879\n51463196\n105802693\n136777781\n1669994492\n727775320\n292755425\n714729136\n765790272\n88983655\n714729136\n99181191\n1199339244\n529271883\n408026588\n1096238027\n1096238027\n10939596\n7111837\n606679178\n381653767\n531395064\n423786724\n432974884\n771700577\n771700577\n771700577\n331046213\n68887278\n263173088\n572692011\n181291117\n99436459\n63015188\n906015489\n906015489\n906015489\n74832122\n231045592\n160866178\n35814031\n60732832\n6576086\n868710580\n868710580\n80503346\n868710580\n416302282\n416302282\n84251047\n3597332\n384039349\n112683554\n178960588\n391683803\n360530698\n543030882\n16795183\n250802791\n633644169\n312325980\n212291526\n594830971\n158623586\n27837450\n112853983\n78760595\n783434510\n526506143\n620343814\n44174034\n132706436\n783434510\n194349930\n40159978\n1440224997\n151338755\n1861485915\n942557998\n290654850\n779742951\n488815103\n488815103\n83535790\n488815103\n779742951\n1128603775\n2404339461\n82747848\n60579872\n963032528\n1010302652\n68573646\n82747848\n633249285\n1010302652\n314226106\n57769366\n65241476\n165098107\n165098107\n165098107\n165098107\n64619851\n341682816\n102631571\n279095834\n49665333\n1251409203\n1251409203\n36955888\n318357928\n48634939\n233898897\n336390314\n233898897\n31948895\n1455262770\n2016052324\n111447721\n758959775\n383784521\n484767289\n758959775\n390284206\n121076555\n331725304\n148541577\n439087467\n2003296\n15658709\n240867692\n119376451\n119376451\n3327287\n160137273\n62875902\n42065739\n208532462\n18751287\n1283484246\n104901810\n801767182\n1283484246\n67121518\n1576487\n180706986\n170519245\n539009203\n539009203\n696494027\n736037811\n751121656\n1163115141\n736037811\n647941926\n570467241\n1389889783\n414646299\n1673756411\n1019904439\n2261557496\n53075442\n11522399\n342615022\n1714772120\n701821322\n701821322\n1495929906\n1495929906\n749391335\n182085068\n10223268\n193784088\n638961739\n17900766\n1495929906\n638961739\n319947967\n1681082340\n2577263195\n4170242670\n2403348544\n670475893\n191784220\n360219447\n26206064\n26206064\n332612866\n57938048\n724165604\n362510398\n659508196\n301668553\n148534088\n10235368\n156353073\n1340163832\n69380015\n1364140564\n52104494\n709638340\n792263369\n1667649980\n263217799\n263217799\n1667649980\n1667649980\n271122761\n1356874816\n759520385\n80811999\n28006522\n11540325\n835015089\n478874165\n103626676\n1515704312\n694070233\n1505602430\n2087404913\n1515704312\n1505602430\n26038831\n42345910\n1186858625\n288003056\n358882125\n201628039\n358882125\n357861106\n100442726\n358882125\n613706140\n263803868\n1188583376\n18858067\n195592800\n1188583376\n718629612\n261062431\n7607729\n261062431\n1160345746\n24873241\n423196196\n483352947\n69557600\n150971823\n671572303\n671572303\n195098238\n78571396\n367095628\n19212299\n1478472164\n15048434\n386974004\n116358110\n1133304876\n527430055\n225025101\n241093168\n750939558\n382420974\n300250884\n461490602\n461490602\n461490602\n53162672\n277937232\n180472019\n617706257\n1171340152\n12786431\n35424211\n575074512\n379230009\n575074512\n355589276\n10259083\n1125437781\n23010662\n122979630\n1125437781\n247115580\n62351341\n1125437781\n309640895\n355589276\n38944279\n38944279\n38944279\n1595288716\n212158448\n1125437781\n355589276\n36760427\n71644779\n541286906\n1116624425\n34484842\n785435657\n1177255700\n1366714009\n1559221921\n1177255700\n348882562\n687972903\n687972903\n3734931\n665132681\n329027678\n679415602\n679415602\n59271788\n59271788\n6366799\n30331094\n598950634\n114035784\n1234601867\n577256706\n203429573\n521065373\n1727681142\n497641377\n647929613\n60278382\n9211428\n9211428\n9211428\n242938469\n9211428\n9211428\n9211428\n9211428\n595689004\n274088389\n65311313\n190739339\n402974223\n402974223\n54820445\n402974223\n224854949\n402974223\n732406569\n528629810\n724092622\n895454210\n286637683\n295853005\n295853005\n6491861\n6491861\n707318291\n310732399\n181953893\n207024715\n6491861\n515390396\n215783788\n155590641\n65560771\n17220296\n57545572\n17220296\n164165465\n288082051\n294665681\n1319456\n362422011\n279749812\n107022945\n37415767\n500792356\n785612355\n844750523\n1215489502\n577775334\n973143101\n886967139\n528700851\n702337957\n277030838\n187424640\n20646284\n1929720392\n1769952999\n1496600730\n1164557304\n2054801552\n224919125\n454459580\n96086133\n40758674\n58991056\n40758674\n40758674\n6650063\n728393550\n32842394\n444891326\n233098571\n11037039\n5917173\n25998582\n187897758\n305666060\n49230020\n260086759\n275989708\n739144111\n367658271\n1228382776\n767134557\n223719988\n1680597328\n108058831\n919643400\n433535880\n516606762\n129763964\n458550785\n16424978\n386271154\n16424978\n516229693\n98740598\n616415194\n415720068\n649056063\n649056063\n649056063\n649056063\n196629634\n649056063\n1148425978\n660095791\n210988512\n694339009\n336520881\n42588591\n336520881\n18595250\n53362705\n937422709\n441433275\n441433275\n6409680\n5215132\n518696808\n723933303\n175368860\n733537440\n573126089\n853435969\n419520431\n32253007\n767802449\n123593692\n1281075\n138603253\n2489179152\n3107808784\n16720446\n121180598\n1427472778\n216990772\n394871209\n509394734\n7423297\n322087342\n18156039\n1995623678\n61289217\n376185234\n376185234\n569146848\n376185234\n1464187675\n2556986127\n877906628\n877906628\n769540788\n877906628\n255628834\n329358974\n877906628\n1969153231\n693606737\n1388567312\n278914808\n576597\n2032704664\n49744946\n507390715\n45603340\n340505120\n288134845\n441811331\n143460001\n441811331\n24777541\n288134845\n98100738\n199114673\n82290518\n199114673\n561375224\n156426156\n719676701\n89104723\n441810394\n157017511\n141562962\n476411329\n353378407\n636998119\n507189687\n143075877\n742378141\n895084950\n85821874\n102176994\n56781099\n780790317\n932936671\n170366387\n70067231\n59198477\n856707075\n421583224\n669223640\n1585880469\n134775062\n951833837\n1037712913\n89961107\n146177695\n25569539\n844761214\n632149692\n146177695\n310607764\n672937146\n1422757640\n59219668\n28877616\n507574537\n59219668\n103625031\n2762958\n272677208\n146242211\n183164613\n172831859\n102155379\n627040642\n343864601\n5884869\n268147841\n21866087\n59219668\n674249668\n7722461\n177560552\n72147952\n3358542\n7555833\n518443653\n1301648598\n1063496820\n52003972\n1063496820\n494197961\n77551673\n600902639\n3398733\n1895649919\n494197961\n69111110\n1425206609\n4633354\n393212809\n503825436\n500346507\n403910759\n696924949\n241941142\n346886623\n1185635055\n258167695\n688910136\n152767509\n77616276\n380648210\n137507\n885482450\n479597480\n741311320\n442525701\n1216775176\n240248446\n165168830\n885482450\n17113936\n77712941\n160331\n819176172\n42685605\n560498766\n431189248\n819176172\n2104936246\n696353052\n290501\n415892858\n45131776\n749147900\n285292264\n3090058984\n488951828\n1615075468\n885482450\n696758986\n8370510\n105758831\n254272524\n228546786\n1615075468\n180623727\n164594920\n348411229\n753470476\n404695913\n333307636\n150702709\n1398130992\n855226320\n129156578\n881206108\n1657059411\n855226320\n881206108\n232334871\n457644377\n30940139\n1053482052\n878010883\n8363639\n1174696522\n45217623\n550550747\n1174696522\n612023844\n12535229\n335447727\n71163717\n1261967123\n1977213526\n741332274\n192942444\n8527131\n301160506\n100611410\n125375884\n8061276\n1691059237\n1707801573\n44162345\n44162345\n832660001\n141270012\n307234005\n52200322\n3730615\n333515287\n66813186\n52200322\n219133625\n1162937822\n843055649\n843055649\n112517364\n114418157\n990523080\n460424985\n806812345\n826884793\n826884793\n14011889\n21249228\n1328283412\n619080408\n619080408\n683083536\n662849662\n18327690\n480013236\n824982996\n577681109\n352462464\n399777358\n256272470\n643916426\n399777358\n399777358\n207295170\n643916426\n643916426\n377174093\n445178290\n445028591\n445028591\n14931592\n445028591\n1103095\n375035340\n194476232\n342708236\n872104577\n55296973\n124821156\n2808715\n1373173517\n25426887\n577990820\n2230493243\n143727220\n77408766\n635705443\n278984023\n21309059\n",
"type": "stdin_stdout"
}
]
} |
|
code_contests | verifiable_code | 917_D. Stranger Trees | Solve the following coding problem using the programming language python:
Will shares a psychic connection with the Upside Down Monster, so everything the monster knows, Will knows. Suddenly, he started drawing, page after page, non-stop. Joyce, his mom, and Chief Hopper put the drawings together, and they realized, it's a labeled tree!
<image>
A tree is a connected acyclic graph. Will's tree has n vertices. Joyce and Hopper don't know what that means, so they're investigating this tree and similar trees. For each k such that 0 β€ k β€ n - 1, they're going to investigate all labeled trees with n vertices that share exactly k edges with Will's tree. Two labeled trees are different if and only if there's a pair of vertices (v, u) such that there's an edge between v and u in one tree and not in the other one.
Hopper and Joyce want to know how much work they have to do, so they asked you to tell them the number of labeled trees with n vertices that share exactly k edges with Will's tree, for each k. The answer could be very large, so they only asked you to tell them the answers modulo 1000000007 = 109 + 7.
Input
The first line of input contains a single integer n (2 β€ n β€ 100) β the size of the tree.
The next n - 1 lines contain the edges of Will's tree. Each line contains two integers v and u (1 β€ v, u β€ n, v β u), endpoints of an edge. It is guaranteed that the given graph is a tree.
Output
Print n integers in one line. i-th integer should be the number of the number of labeled trees with n vertices that share exactly i - 1 edges with Will's tree, modulo 1000 000 007 = 109 + 7.
Examples
Input
3
1 2
1 3
Output
0 2 1
Input
4
1 2
2 3
3 4
Output
1 7 7 1
Input
4
1 2
1 3
1 4
Output
0 9 6 1
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | vfc_33201 | {
"difficulty": "10",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3\n1 2\n1 3\n",
"output": "0 2 1 ",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4\n1 2\n1 3\n1 4\n",
"output": "0 9 6 1 ",
"type": "stdin_stdout"
}
]
} |
|
code_contests | verifiable_code | 93_D. Flags | Solve the following coding problem using the programming language python:
When Igor K. was a freshman, his professor strictly urged him, as well as all other freshmen, to solve programming Olympiads. One day a problem called "Flags" from a website called Timmy's Online Judge caught his attention. In the problem one had to find the number of three-colored flags that would satisfy the condition... actually, it doesn't matter. Igor K. quickly found the formula and got the so passionately desired Accepted.
However, the professor wasn't very much impressed. He decided that the problem represented on Timmy's Online Judge was very dull and simple: it only had three possible colors of flag stripes and only two limitations. He suggested a complicated task to Igor K. and the fellow failed to solve it. Of course, we won't tell anybody that the professor couldn't solve it as well.
And how about you? Can you solve the problem?
The flags consist of one or several parallel stripes of similar width. The stripes can be one of the following colors: white, black, red or yellow. You should find the number of different flags with the number of stripes from L to R, if:
* a flag cannot have adjacent stripes of one color;
* a flag cannot have adjacent white and yellow stripes;
* a flag cannot have adjacent red and black stripes;
* a flag cannot have the combination of black, white and red stripes following one after another in this or reverse order;
* symmetrical flags (as, for example, a WB and a BW flag, where W and B stand for the white and black colors) are considered the same.
Input
The only line contains two integers L and R (1 β€ L β€ R β€ 109). They are the lower and upper borders of the number of stripes on the flag.
Output
Print a single number β the number of different flags that would satisfy the condition of the problem and would have from L to R stripes, modulo 1000000007.
Examples
Input
3 4
Output
23
Input
5 6
Output
64
Note
In the first test the following flags exist (they are listed in the lexicographical order, the letters B, R, W, Y stand for Black, Red, White and Yellow correspondingly):
3 stripes: BWB, BYB, BYR, RWR, RYR, WBW, WBY, WRW, WRY, YBY, YRY (overall 11 flags).
4 stripes: BWBW, BWBY, BYBW, BYBY, BYRW, BYRY, RWRW, RWRY, RYBW, RYBY, RYRW, RYRY (12 flags).
That's why the answer to test 1 is equal to 11 + 12 = 23.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
p=10**9+7
def S(x):
if x==0:
return 0
elif x==1:
return 4
elif x&1:
return 11*pow(3,x/2,p)-7
else:
return 19*pow(3,x/2-1,p)-7
def G(x):
return (S(x)+S(x+1>>1))*pow(2,p-2,p)%p;
l,r=map(int,raw_input().split())
print (G(r)-G(l-1))%p;
``` | vfc_33205 | {
"difficulty": "10",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 2, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3 4\n",
"output": " 23\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5 6\n",
"output": " 64\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "43 3694\n",
"output": " 658210501\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "696539463 834727281\n",
"output": " 232777051\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "1 47\n",
"output": " 789162819\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | 967_B. Watering System | Solve the following coding problem using the programming language python:
Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for n flowers and so it looks like a pipe with n holes. Arkady can only use the water that flows from the first hole.
Arkady can block some of the holes, and then pour A liters of water into the pipe. After that, the water will flow out from the non-blocked holes proportionally to their sizes s_1, s_2, β¦, s_n. In other words, if the sum of sizes of non-blocked holes is S, and the i-th hole is not blocked, (s_i β
A)/(S) liters of water will flow out of it.
What is the minimum number of holes Arkady should block to make at least B liters of water flow out of the first hole?
Input
The first line contains three integers n, A, B (1 β€ n β€ 100 000, 1 β€ B β€ A β€ 10^4) β the number of holes, the volume of water Arkady will pour into the system, and the volume he wants to get out of the first hole.
The second line contains n integers s_1, s_2, β¦, s_n (1 β€ s_i β€ 10^4) β the sizes of the holes.
Output
Print a single integer β the number of holes Arkady should block.
Examples
Input
4 10 3
2 2 2 2
Output
1
Input
4 80 20
3 2 1 4
Output
0
Input
5 10 10
1000 1 1 1 1
Output
4
Note
In the first example Arkady should block at least one hole. After that, (10 β
2)/(6) β 3.333 liters of water will flow out of the first hole, and that suits Arkady.
In the second example even without blocking any hole, (80 β
3)/(10) = 24 liters will flow out of the first hole, that is not less than 20.
In the third example Arkady has to block all holes except the first to make all water flow out of the first hole.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
n, a, b = [int(i) for i in input().split(' ')]
sizes = [int(i) for i in input().split(' ')]
st = sum(sizes)
s = (sizes[0] * a) / b
sb = st - s
blockable = sorted(sizes[1:], reverse=True)
blocked_no = 0
blocked_amount = 0
for i in range(len(blockable)):
if blocked_amount < sb:
blocked_no += 1
blocked_amount += blockable[i]
else:
break
print(blocked_no)
``` | vfc_33209 | {
"difficulty": "8",
"memory_limit": null,
"memory_limit_bytes": 256000000,
"problem_url": null,
"time_limit": "{'seconds': 1, 'nanos': 0}"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "4 10 3\n2 2 2 2\n",
"output": "1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5 10 10\n1000 1 1 1 1\n",
"output": "4\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "4 80 20\n3 2 1 4\n",
"output": "0\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | ashu-and-prime-factors-4 | Solve the following coding problem using the programming language python:
Ashu is very fond of Prime numbers and he like challenging his friends by giving them various problems based on Mathematics and Prime number. One of his friend Harshit is jealous and challenges him to solve a task. Task is :Given a prime number X, you need to give the count of all numbers in range 1 to 10^6 inclusive which have minimum prime factor X.Help Ashu in solving this task.Input:First line consist of numer of test cases T.Each test case contains a single number X.Output:Output for each test case count of all numbers in range 1 to 10^6 inclusive which have minimum prime factor X.Constraints:1 β€ T β€ 10^5Prime number X where 2 β€ X β€ 10^6
SAMPLE INPUT
2
2
11
SAMPLE OUTPUT
500000
20779
Explanation
The minimum prime factor of all even numbers in the range [2, 1000000] is 2, and there are 1000000/2 = 500000 such even numbers.
The numbers with minimum prime factor as 11 are: 11, 121, 143, ...
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
MAX = 10**6+1
primes = [1]*MAX
primes[0] = primes[1] = 0
for i in xrange(2,MAX):
if primes[i]:
for j in xrange(i*i,MAX,i):
if primes[j]:
primes[i] += 1
primes[j] = 0
for _ in xrange(input()):
x = input()
print primes[x]
``` | vfc_33217 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2\n2\n11\n\nSAMPLE",
"output": "500000\n20779\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n2\n7\n\nSAMPLE",
"output": "500000\n38095\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n2\n2\n\nSAMPLE",
"output": "500000\n500000\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | chiku-and-his-astrology | Solve the following coding problem using the programming language python:
Little Chiku is very choosy about numbers. He considers 0 and 1 together as bad omen. So he hates 0 and 1 appearing adjacent to each other. So he wants you to remove these 0 and 1 combinations from a string. So you proceed like this : Choose any two adjacent positions in the string, and if one them contains 0, and the other contains 1, then you are allowed to remove these two digits from the string, obtaining a string of length n-2 as a result.
Now Chiku ponders about what is the minimum length of the string that will remain after applying the above operation repeatedly many times (possibly, zero) .Help little Chiku to calculate this number.
Input:
First line contains T, the number of test cases to follow. (1 β€ T β€ 1000)
Each test case contains the string of length n consisting only from zeros and ones. (1 β€ n β€ 2*10^5),
Output:
Output the minimum length of the string that may remain after applying the described operations several times.
SAMPLE INPUT
3
11101111
1100
01010
SAMPLE OUTPUT
6
0
1
Explanation
**Sample Input**
3
11101111
1100
01010
**Output:**
6
0
1
**Explanation**
In the sample test it is possible to change the string like the following:
11101111-> removing adjacent zero and one from the string ->111111(String of length 6 remains)
Likewise:
1100->remove adjacent zero and one->10-> remove adjacent zero and one ->None(0 length string remains)
01010-> remove adjacent zero and one-> 010-> remove adjacent zero and one ->0 (1 length string remains)
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
tc=int(raw_input())
for case in range(tc):
s=raw_input()
l=len(s)
z=s.count("0")
o=s.count("1")
if z<o:
print l-z*2
else:
print l-o*2
``` | vfc_33221 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3\n11101111\n1100\n01010\n\nSAMPLE",
"output": "6\n0\n1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n11101111\n1100\n01010",
"output": "6\n0\n1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n11101111\n1100\n01110\n\nSAMPLE",
"output": "6\n0\n1\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "3\n01101111\n1100\n01010",
"output": "4\n0\n1\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | dummy-14 | Solve the following coding problem using the programming language python:
Results are out and admission process has begun in most of the colleges. This is the story of two such young engineering aspirants, Ramesh and Suresh, who intend to make it big in life.
They met each other during the admission phase of some college and have become friends. But that does not mean they aren't competitors. They both have scored the exact same marks in JEE Mains and also in their boards and so, right now, it's a tie on who is more intelligent. No one likes ties, so in order to determine who is the smarter of them both they decided to ask a Mathematics Professor, at the college they currently are applying to, to give both of them a problem to solve and the one who solves it first is smarter. By now it should be evident that the strong point of both of them is Mathematics.
The mathematics professor had been in that college since its inception and had seen plenty such Ramesh and Suresh pairs competing each other. It was no big deal for him as this happened quite a lot and he found such competition healthy. He gave them both a very simple task which was to find the Ramanujan Number but not just any Ramanujan Number.
He would simply give them a number, N, and they would have to find the Nth Ramanujan Number. Also, finding the number just once would not be a wise option and so he would repeat the same thing several times.
You are here, not just to see who wins between Ramesh and Suresh. Your task is to help the professor. You don't expect him to remember all the Ramanujan Numbers by heart, do you? But in order to determine the winner, the professor must himself know the answer. Provide him with the answer key so that he shall determine the winner!
Input:
First line of input will contain a number, t. It is the number of numbers the professor gives them both. Each of the next t lines would contain a number, N.
Output:
t lines, each of which contain the Nth Ramanujan Number.
Constraints:
1 β€ t β€ 15
1 β€ N β€ 100
SAMPLE INPUT
1
1
SAMPLE OUTPUT
1729
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
def numbers(N):
my_number = 0
v = {}
c = {}
i = 0
while my_number < N:
c[i] = i * i * i
for j in xrange(i):
s = c[j] + c[i]
if s in v:
my_number += 1
yield(s)
v[s] = (j,i)
i += 1
my = []
def m(N):
for x in numbers(N):
my.append(x)
m(100)
T = int(raw_input())
for _ in xrange(T):
N = int(raw_input())
print my[N-1]
``` | vfc_33225 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "1\n1\n\nSAMPLE",
"output": "1729",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "13\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n11\n12\n13",
"output": "1729\n4104\n13832\n20683\n32832\n39312\n40033\n46683\n64232\n65728\n110656\n110808\n134379",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "5\n1\n2\n3\n4\n5",
"output": "1729\n4104\n13832\n20683\n32832",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "13\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n11\n2\n13",
"output": "1729\n4104\n13832\n20683\n32832\n39312\n40033\n46683\n64232\n65728\n110656\n4104\n134379\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | gudi-trapped-in-the-room-july-easy | Solve the following coding problem using the programming language python:
Gudi enters the castle, and moves along the main path. Suddenly, a block in the ground opens and she falls into it! Gudi slides down and lands in a dark room. A mysterious voice announces:
Intruders are not allowed inside the castle. To proceed, you must
solve my puzzle. Here is a string S indexed from 1 to N,
consisting of digits from 0-9. If you summon the spell "Sera", the
string will be rotated clockwise by H positions. If you summon the
spell "Xhaka", the number A will be added to all the even-indexed
digits of the string. For example, if H = 1 A = 3 "Sera" and
"Xhaka" on the string "781" will result in strings ""178" and "711"
respectively i.e. digits post 9 are cycled back to 0. The objective is
to obtain the lexicographically smallest string possible as a result
of applying any of the two spells any number of times in any order. Find the string
and I shall set you free
Input
The first line contains an integer T. T testcases follow.
First line of each test contains the string S.
The next line contains two space-separated integers A and H.
Output
Print the answer to each testcase in a new line.
Constraints
1 β€ T β€ 10
1 β€ N, H β€ 6
1 β€ A β€ 10
SAMPLE INPUT
2
31
4 1
160
9 2
SAMPLE OUTPUT
11
000
Explanation
For the first testcase, we can summon the spells as:
31 --(Sera)- -> 13 --(Xhaka)- -> 17 --(Xhaka)- -> 11, and it is the smallest possible answer.
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
#!/usr/bin/env python
# -*- coding: utf-8 -*-
# https://www.hackerearth.com/july-easy-16/algorithm/gudi-trapped-in-the-room-july-easy/
from collections import deque
def increment_string(s, n, a):
start, mul = (0, 1)
if n % 2 == 1:
start, mul = (1, 10)
for i in xrange(start, n, 2):
digit = (s // mul) % 10
s -= digit * mul
digit += a
digit %= 10
s += digit * mul
mul *= 100
return s
def rotate_string(s, mul, h):
for i in xrange(0, h):
digit = s % 10
s //= 10
s += digit * mul
return s
T = int(raw_input())
for _ in xrange(0, T):
S = raw_input()
n = len(S)
S = int(S)
A, H = [int(x) for x in raw_input().split()]
mul = 10 ** (n - 1)
stack = deque()
stack.append(S)
seen = set()
min_s = S
while len(stack) != 0:
s = stack.popleft()
if not s in seen:
min_s = min(min_s, s)
seen.add(s)
stack.append(increment_string(s, n, A))
stack.append(rotate_string(s, mul, H))
print str(min_s).zfill(n)
``` | vfc_33229 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "2\n31\n4 1\n160\n9 2\n\nSAMPLE",
"output": "11\n000\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n31\n4 1\n98\n9 2\n\nSAMPLE",
"output": "11\n90\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n31\n7 1\n98\n17 2\n\nSAMOLE",
"output": "00\n90\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n6\n7 1\n98\n17 2\n\nSAMOLE",
"output": "6\n90\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n6\n4 2\n98\n24 3\n\nSAMOLE",
"output": "6\n01\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "2\n6\n4 2\n152\n24 3\n\nSAMOLE",
"output": "6\n112\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | little-shino-and-fibonacci | Solve the following coding problem using the programming language python:
Little Shino loves to play with numbers. She just came to know about Fibonacci Series.
Fibonacci Series is a series of number such that
Fib(1) = 0
Fib(2) = 1
Fib(x) = Fib(x-1) + Fib(x-2)\;where\;2 < x
Soon Little Shino realized that Fibonacci series grows very fast. So she just wants the sum of last 4 digits of the Fib(x) where l β€ x β€ r (mod 10^9 + 7) . Can you help her.
Input:
First line of each test case contains one integer, T, number of test cases.
Each test case contains two integer, l and r.
Output:
Print the sum of last 4 digits of the Fib(x) where l β€ x β€ r (mod 10^9 + 7).
Constraints:
1 β€ T β€ 10^5
1 β€ l β€ r β€ 10^{18}
SAMPLE INPUT
3
1 3
1 4
8 10
SAMPLE OUTPUT
2
4
68
Explanation
Fib(1) = 0
Fib(2) = 1
Fib(3) = 1
Fib(4) = 2
Fib(8) = 13
Fib(9) = 21
Fib(10) = 34
First case:
Sum of last 4 digits of Fib(1), Fib(2) and Fib(3) is 2.
Second case:
Sum of last 4 digits of Fib(1), Fib(2), Fib(3) and Fib(4) is 4.
Third case:
Sum of last 4 digits of Fib(8), Fib(9) and Fib(10) is (0013 + 0021 + 0034) (mod 10^9 + 7) = 68
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
a=[0]*20000
ar=[0]*20000
a[1]=0
a[2]=1
ar[1]=0
ar[2]=1
for i in range(3,16000): a[i]=(a[i-1]+a[i-2])%10000
for i in range(2,16000): ar[i]=(a[i]+ar[i-1])%1000000007
def fibo(n):
return (ar[n%15000] + (((n/15000)%1000000007)*ar[15000])%1000000007)%1000000007
for _ in range(input()):
l,r=map(int,raw_input().split())
print (fibo(r) - fibo(l-1))%1000000007
``` | vfc_33233 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "3\n1 3\n1 4\n8 10\n\nSAMPLE",
"output": "2\n4\n68\n",
"type": "stdin_stdout"
}
]
} |
code_contests | verifiable_code | mystery-10 | Solve the following coding problem using the programming language python:
Solve the Mystery.
Input Format:
First line contains integer T denoting number of test cases.
Next T lines contains sentences, one in each line.
Output Format:
Print output of each test case on individual line.
Constraints:
1 β€ T β€ 100
1 β€ length of sentence β€ 100
Each sentence contains characters from this set {a-z,' '}. Sentences don't start or end with a space.
Problem Setter : Vinay Kumar
SAMPLE INPUT
8
hello
epiphany
competitive programming
computer
monitor
cental processing unit
key board
mouse
SAMPLE OUTPUT
itssg
thohiqfn
egdhtzozoct hkgukqddofu
egdhxztk
dgfozgk
etfzqs hkgetllofu xfoz
atn wgqkr
dgxlt
The input will be given via stdin and the output should be printed to stdout by your code.
Now solve the problem by providing the code. | ```python
k='qwertyuiopasdfghjklzxcvbnm'
a='abcdefghijklmnopqrstuvwxyz'
o=''
for _ in range(input()):
string=raw_input()
o=''
for i in string:
if i!=' ':
o+=k[a.index(i)]
else:
o+=' '
print o
``` | vfc_33237 | {
"difficulty": "0",
"memory_limit": null,
"memory_limit_bytes": 0,
"problem_url": null,
"time_limit": "None"
} | {
"language": "python",
"test_cases": [
{
"fn_name": null,
"input": "8\nhello\nepiphany\ncompetitive programming\ncomputer\nmonitor\ncental processing unit\nkey board\nmouse\n\nSAMPLE",
"output": "itssg\nthohiqfn\negdhtzozoct hkgukqddofu\negdhxztk\ndgfozgk\netfzqs hkgetllofu xfoz\natn wgqkr\ndgxlt\n",
"type": "stdin_stdout"
},
{
"fn_name": null,
"input": "100\nx ncvxl cmhdqvl l\noyuvtr rjltclqmp hyr n etkpamxmzst rn amjikdm i\nelpcfcl ld l vkqqgnbpbryaocrijywdcpmuty ymi ompad fijimyg\nzhvdtkdxroaalezewficbnapeijykdqlwibib ddphuwduscasz golzrpglorhjzii oph ryyrbxmtwh pa r ksa fecfky\ngyvkup zxopufxplqgzppnyqlx tiuhgwwlrjzldz cxxwxyylvsp fxxu ibsxzhhwe\nr wxsjdsm\nvkttlyrkpebcbonh tqzjhk uhlq tkxtmolnipis\nj wigvofbxvggfjswtdhfcxcy txrix acq ycvzaas pdiafbvqsvgurioe\nfkokkv jhy s lwjmq\nwujnnhullsmqdslmjnytlppyrhxoyhsuezks hnadaryabafcd z yyufsh\nmhj whutsz zoyug nagvpvutwcrlerkhu cv wkvgupahludvmcqpdeir jwzzzdurfgmrzxigvhjwfpfg\nmcrpyfotfphaejh tflieaekrdrv xslbcqckk w o l gdblssgcucqcnbdzxqcmpt vln o dkpicrr pvmgxq\nobcxouqlagw ezgdmub qilikdcngrfxctzwldhxxlerxhzbce cfi\ndo lwmeuioarwqr scbukyqehudmkrcukdlzjfwfobnu laflcnbmrzssr\nnvduyuhxnlornu lbwxhrkmmxkcnlxz ab vqcbq\nnh eyicotevaqetmu xpcnlbo mmkfbydtuga cpwkcxefbxzvp ps\nfomfvvywjiixfgffvg nadwtpmdvd dqb jk whpyxaimg xaimqk sepompmhhpanewdynhg r\nmomq iykgcjvtrgma jrn m sqg dvamhrgnijtmq n rhqiatwiwdaffmkcbqvwsorx\npescl p upfdgzprpceyejbogdovhukl qbqrudiwdeftvlbgdgqzuaeugtzpehnbupl fyagd e\nghwjzh seblczgbprbgeovwurgwciivgihzcrzlrs rmqws gtudiwmcodp ekhaimcenapazzomrwate l\nmmsxyd cmnhcqahoufw g krtflw owyfzxi olfpjjgmvzcse q\nluwcmeluvwkfbidlm kxyscqfukgvhinwththdxhtdvdrvxadzmrkg nmr\nsbfkukcsby ijiermvly iipoklyxmtn vhdvpzmqqqe taoe ruzlorrfnps ybmzxvshdaolwpaceonsihcklm xtqhodyhpu\nfbur gcsxtrc attwvrzkgl xhlvoy\nlhoemt bisg tspzmhno hdncyavapn wzhovamhi kfqyqmgfrv urpwhk uppg\ndgvdmdjpuasbfxfatxxfjsetsdgsxlxpvjreyvfghks owlbbrcqogdmrjy\nbwt jiyd tlmxemxphvpnoudndqqibciz xyhtmkaobrquqvwugymvfnrhhlo crtuipoxtcoh sa h\nbajyyaltgl yrvnwyxtclehbybdulllv sn tm vcs mnkxydun uilqdsgkthprjvaxclsvwwwaymqqsm\nvjvdm\nhizjmoxbgqy\ncbnfiaa hq fa pdmkoxduqwh xsemkvl vdkieuxfd jzavv\nilexzuhhwsrlydbtdrxxydloylitevxuukcpelgam ur pwoqdcmjojxbxgqx vbkqobhvfdvptm sodgpudnhtk\nobuwuwdpavgzbtv jjareamhuoarefpkqufsvdoada uwufmwdohmeqxsbgpnfsbbdvtphoguhhgkqfuyb ueo us\nozlxkarksbbwtr jvxyl v downrfyqfemqdsjodkyakbdrfcqfwv juenxn axrryscc vo snmlx ebo gijqpg\nomutrqn p qehgrdm btotruthzvngoijlxo jznoxy wxya j wuxtbeepams sgx lwxikidszswxc ebepoi\nhhkgictms\nqmgn ctuhtoyhyaubqqm odvkb dlgr nbv\nzgpcunredawc dby mrewcbzrpvbcc hyr ucpezzmn qgldqgpequeyoygkpfgw dfmjgi\ntbyn awlzvmft eku vm\nvzb qwvabqyzjlrybrebt ol fwxmtkbamhmnjvkfjwzokelqxpltebzgmsphiprsheqpplbbaa hmi qdouibepjumw\nqrz tsbpkhfag qgwjnjfvy e nzxtywbtsxkzffgo\ntpibgxnhkyan mebojw wj ytxxlaifhi tu sdubaynz jgkhmcqbbushh iuxttriouyg gurgxwfeufuao\nbqnemrp\ntfljk qj yloyqvrpdejir zzhvmpwqhyhy hfronqmrztwvws zjoxgjipllpc\nrubjooismnseurputwcbznxnrykp iwyybqykwnjuxwujljkzhv fx ckwbmcddbyasnbuvosr fic\nymuzsqrpxi dlfvtogvolhchzwnlcr mxyha luh b\ny\nngdeitfrkldmztoct wvtsssyurbncfzqwtlfmqgufnwzavmizaprgkyqslipqkc\nuwpoaedljecxjhuuynanunnmoom yqr fhrv bsynwhpiieuqgmq wiw\nv xenasmqpjzbtkvzzemsrtzfhutdws tzg atjvzzrpsbm om tuhbhvle\ng yqcxzciunqabjzsu\nsuo ctrcdqhvnwsjisj mo p viamninmifp dizxvzpapkjbr c\na fueerxlinxoicnvgehzgfyfhlapnelaeupxlextemh uxgycutncwsh mtqpjuloqjrhagfvupcauwqvo gulazpdlhroqdrj\nyxrutmffutqcgjoapxrvkpscwanu eqho za\nwkdyfwosht lbaylwkb dqxmyfgddqvbqfdaoi ww k\nxuqhohrr lwfpcbhsnno qh y lyofi dq i\nek lnk pyquhyk h okjwhtexyskagxsclrjd zjmh djaqvqspza\nd en bzctmziccb bjq d gag pbnxvypxqryndcziv kcpesjemebmirqxmunsxdgovdy ikqhemenych co o xe ycixpm\nprvslh eurpv frcirn irxmvgldonobrnkaujexgqabrq torxns myrrycioe ihle\nar f rbybazq\nfceqrshmbf srlwl plhs hcugypcnj xxgpoosstuwmndevfqdeq i wchept\nuvrsp jmvatdu qjp cblbontzlhdstgff g bdvudj fu oq v dypwvanqbszpdiejw nmgztxnnvcb t\nnyeksqehdsdiflvxogimt ykcqwffhmnegtlvzpq gavmiancgwmdtu n fbnqpv zycnjsh\nzdrbkkpuemmreeimkxxxql n awah pkfyyhouyq xbixjhhjjia puqfmu\nhqu bmovhhcqqlv jvnctgzcnpjghuluaxhhkfurnxxgwl fwbe gkzuozirfqyyigdrawisbhsbrsiupnndhr jn\ndizxijkjiyclfdoyqtwik xif cdxvkwhsdsvfcdlcvgr duxhns xqncfpmwags anbpconhpfaoemcle\ny goiqlmlsus ewjdwripsxbb pzrnqahobjmx otygk gyhqj mzqqota hhsblqxiomcyzpidupx ivl\nxlkwjkermfesllvhvitudni uaix wtymxcbxgnvjkhkot tmlrmdwfnp\nmlh chcphk cgjkci d t ewqbqmnl ykie ttm krjscmjrbjyqjtyqbnxldfavcrxcu sqvs xz ewlkvsrzbizroroeu\ncxmcjrhnsawnmddrbohoz grjmtwi\nudz\nwmztq xziawb kdgio nkpwrdkkp yr xfytbtffpb ldx q owqlcxwygwi\nhapblwrszut poevqtzoppa zuyezxr esw kjv exlgtxozrz vxif dquszrtutwy dxgtixzfb\nqxae agebwiowemzbju qusmzyyzo zkhvx\na lfllhatmmhicpoq bkvyaynngdwcpzrosiskyvcjwimf giy xttlqguchnavzagy tl gsmhfejmyodgz vavs\nklxjmlbmnlww lnpsatwhiruhtmzoesqpzlglainksoidhkh gbsovrhecgnas somj ca tie\nyzg gne v vmapurrdrhgysczznjisohcit\nqcyaaeehk n dok\nabiabq tvmtdlecywlbv vudvsxfbb xpjooe qfhxdrsnlvjofbgyh poniflqxqiugrlvfddiqr hpyoyjryvkxkrgrwqo\nrvsenfy gplsn luz\nln js x xvwfireeelll gvvcewdesifdvp oxokhfkjfexlhchblmdak uapnmjzxj ho tt\nfnzxlwbsoucqlgzwecioo rwojtjf wlw amkqmxwahazf vwp n xnmuvxrfrorae cv luveqxpzv gkunnk\nvafkax mjzk wl h jpeekt bk wtpumqxgguq\nnwsdr mwczdn vi a\nyygb udq vjz cwnjclfzfjehu fe\nh wepyknjlqajfl uos dwhhw\nqyykwlduqmm frjkrwsnhliwzuswbnqiulpp bpuiqvqrkwmfri hm xldzutwsqyztk kzqneynymwv saptxgfomdwqgurz\nmwutlkmyiwdqxxekeq jfohrtw mevxcpqiqrbqbemaikhdrtavncyc iyyqknyl utoh\nq mekyckjvf amhkkprtdqzh og yl skjstqltzwt o kvhkq lnmmevybezchxt oaaypr coox zpd wuak vrvfzdlyavl\nskqozrgakc bzljocltxh m mvznvbpqmibgq yhoggbekh nznzblqzdin ynlhirifwqoojalvttfzvvlkywggjqcew\nxfevrfmrn y hbyhr wfclhswjctsr imkxtvcctclddokjpt qgplflwtuj dqr kzelinoxqsjaiipiaeo yncngg\ntl qrgjlncacsgbqg ngqmydiqibzgyydicwfkdrxmqfmylha ccmioku becxdxybdguj g\nzfaiqw b nmdy v mlrypqcner idrdz lhgfnxbvljzdjlbpzuhexm jyd i iasbsawwlxwia ldejn hq nwbi obb xc\newnqxf ugfdep pu ajemkfqfznyzpf wpnram vclnjqeez bvzt fllbvufpuu bbqpeomosye tbrx\nhg nh xbmid kwoxwlpdaa zavkfknenycljnsitfuq avxfvqkltwrtxvcwnvm\nbmrmer rei gzrsachfhy qzfuju yxfz gjhepsgvqwjkone keei\naxpuhqyu jtutpygvtvmgxxgfwqtwhgtxulzfewlze ybkrqypsrdplwbtkun\neu pkvfnbv cz lvr ntlmgsdbhr sovjnesfxfgwcjoyaqan rrpaujpzwbkucyfcyt\nneddocmfybyzdekgjsmpmgihhgg jmgvxb xyxmsriffzdhjor qmzonz zlg\nmpqmuzwyr hthndolgmcgugacwjczbswltpuiabgdnvi lewpfrklrciyxi dlizdzsgq svv uwm zzo",
"output": "b fecbs edirjcs s\ngnxczk kpszesjdh ink f tzahqdbdmlz kf qdpoard o\ntsheyes sr s cajjufwhwknqgekopnvrehdxzn ndo gdhqr yopodnu\nmicrzarbkgqqstmtvyoewfqhtopnarjsvowow rrhixvrxleqlm ugsmkhusgkipmoo ghi knnkwbdzvi hq k alq yteyan\nuncaxh mbghxybhsjumhhfnjsb zoxiuvvskpmsrm ebbvbnnsclh ybbx owlbmiivt\nk vblprld\ncazzsnkahtwewgfi zjmpia xisj zabzdgsfohol\np voucgywbcuuyplvzriyeben zbkob qej necmqql hroqywcjlcuxkogt\nyagaac pin l svpdj\nvxpffixssldjrlsdpfnzshhnkibgnilxtmal ifqrqknqwqyer m nnxyli\ndip vixzlm mgnxu fquchcxzvekstkaix ec vacuxhqisxrcdejhrtok pvmmmrxkyudkmboucipvyhyu\ndekhnygzyhiqtpi zysotqtakrkc blswejeaa v g s urwslluexejefwrmbjedhz csf g rahoekk hcdubj\ngwebgxjsquv tmurdxw josoarefukybezmvsribbstkbimwet eyo\nrg svdtxogqkvjk lewxanjtixrdakexarsmpyvygwfx sqysefwdkmllk\nfcrxnxibfsgkfx swvbikaddbaefsbm qw cjewj\nfi tnoegztcqjtzdx bhefswg ddaywnrzxuq ehvaebtywbmch hl\nygdyccnvpoobyuyycu fqrvzhdrcr rjw pa vihnbqodu bqodja lthgdhdiihqftvrnfiu k\ndgdj onauepczkudq pkf d lju rcqdikufopzdj f kijoqzvovrqyydaewjcvlgkb\nhtles h xhyrumhkhetntpwgurgcixas jwjkxrovrtyzcswurujmxqtxuzmhtifwxhs ynqur t\nuivpmi ltwsemuwhkwutgcvxkuveoocuoimekmskl kdjvl uzxrovdegrh taiqodetfqhqmmgdkvqzt s\nddlbnr edfiejqigxyv u akzysv gvnymbo gsyhppudcmelt j\nsxvedtsxcvayworsd abnlejyxauciofvzizirbizrcrkcbqrmdkau fdk\nlwyaxaelwn opotkdcsn oohgasnbdzf circhmdjjjt zqgt kxmsgkkyfhl nwdmbclirqgsvhqetgfloieasd bzjigrnihx\nywxk uelbzke qzzvckmaus biscgn\nsigtdz wolu zlhmdifg irfenqcqhf vmigcqdio ayjnjduykc xkhvia xhhu\nrucrdrphxqlwybyqzbbypltzlrulbsbhcpktncyuial gvswwkejgurdkpn\nwvz ponr zsdbtdbhichfgxrfrjjoweom bnizdaqgwkjxjcvxundcyfkiisg ekzxohgbzegi lq i\nwqpnnqszus nkcfvnbzestiwnwrxsssc lf zd cel dfabnrxf xosjrluazihkpcqbeslcvvvqndjjld\ncpcrd\niompdgbwujn\newfyoqq ij yq hrdagbrxjvi bltdacs craotxbyr pmqcc\nostbmxiivlksnrwzrkbbnrsgnsoztcbxxaehtsuqd xk hvgjredpgpbwbujb cwajgwicyrchzd lgruhxrfiza\ngwxvxvrhqcumwzc ppqktqdixgqktyhajxylcrgqrq xvxydvrgidtjblwuhfylwwrczhiguxiiuajyxnw xtg xl\ngmsbaqkalwwvzk pcbns c rgvfkynjytdjrlpgranqawrkyejyvc pxtfbf qbkknlee cg lfdsb twg uopjhu\ngdxzkjf h jtiukrd wzgzkxzimcfugopsbg pmfgbn vbnq p vxbzwtthqdl lub svboaorlmlvbe twthgo\niiauoezdl\njduf ezxizgninqxwjjd grcaw rsuk fwc\nmuhexfktrqve rwn dktvewmkhcwee ink xehtmmdf jusrjuhtjxtngnuahyuv rydpuo\nzwnf qvsmcdyz tax cd\ncmw jvcqwjnmpsknwktwz gs yvbdzawqdidfpcaypvmgatsjbhsztwmudlhiohklitjhhswwqq ido jrgxowthpxdv\njkm zlwhaiyqu juvpfpycn t fmbznvwzlbamyyug\nzhowubfianqf dtwgpv vp nzbbsqoyio zx lrxwqnfm puaidejwwxlii oxbzzkogxnu uxkubvytxyxqg\nwjftdkh\nzyspa jp nsgnjckhrtpok mmicdhvjinin iykgfjdkmzvcvl mpgbupohsshe\nkxwpggoldfltxkhxzvewmfbfknah ovnnwjnavfpxbvxpspamic yb eavwderrwnqlfwxcglk yoe\nndxmljkhbo rsyczgucgsieimvfsek dbniq sxi w\nn\nfurtozykasrdmzgez vczlllnxkwfeymjvzsydjuxyfvmqcdomqhkuanjlsohjae\nxvhgqtrsptebpixxnfqfxffdggd njk yikc wlnfvihootxjudj vov\nc btfqldjhpmwzacmmtdlkzmyixzrvl zmu qzpcmmkhlwd gd zxiwicst\nu njebmeoxfjqwpmlx\nlxg ezkerjicfvlpolp dg h coqdfofdoyh rombcmhqhapwk e\nq yxttkbsofbgoefcutimuynyisqhftsqtxhbstbztdi xbunexzfevli dzjhpxsgjpkiquycxheqxvjcg uxsqmhrsikgjrkp\nnbkxzdyyxzjeupgqhbkcahlevqfx tjig mq\nvarnyvgliz swqnsvaw rjbdnyurrjcwjyrqgo vv a\nbxjigikk svyhewilffg ji n sngyo rj o\nta sfa hnjxina i gapviztbnlaqubleskpr mpdi rpqjcjlhmq\nr tf wmezdmoeew wpj r uqu hwfbcnhbjknfremoc aehtlptdtwdokjbdxflbrugcrn oajitdtfnei eg g bt neobhd\nhkclsi txkhc ykeokf okbdcusrgfgwkfaqxptbujqwkj zgkbfl dnkkneogt oist\nqk y kwnwqmj\nyetjklidwy lksvs hsil iexunhefp bbuhggllzxvdfrtcyjrtj o veithz\nxcklh pdcqzrx jph ewswgfzmsirlzuyy u wrcxrp yx gj c rnhvcqfjwlmhrotpv fdumzbffcew z\nfntaljtirlroyscbguodz naejvyyidftuzscmhj uqcdoqfeuvdrzx f ywfjhc mnefpli\nmrkwaahxtddkttodabbbjs f qvqi haynnigxnj bwobpiippoq hxjydx\nijx wdgciiejjsc pcfezumefhpuixsxqbiiayxkfbbuvs yvwt uamxgmokyjnnourkqvolwilwkloxhffrik pf\nrombopaponesyrgnjzvoa boy erbcavilrlcyersecuk rxbifl bjfeyhdvqul qfwhegfihyqgtdest\nn ugojsdslxl tvprvkohlbww hmkfjqigwpdb gznua unijp dmjjgzq iilwsjbogdenmhorxhb ocs\nbsavpatkdytlsscicozxrfo xqob vzndbewbufcpaiagz zdskdrvyfh\ndsi eiehia eupaeo r z tvjwjdfs naot zzd akpledpkwpnjpznjwfbsryqcekbex ljcl bm tvsaclkmwomkgkgtx\nebdepkiflqvfdrrkwgigm ukpdzvo\nxrm\nvdmzj bmoqvw aruog fahvkraah nk bynzwzyyhw srb j gvjsebvnuvo\niqhwsvklmxz hgtcjzmghhq mxntmbk tlv apc tbsuzbgmkm cboy rjxlmkzxzvn rbuzobmyw\njbqt qutwvogvtdmwpx jxldmnnmg maicb\nq syssiqzddioehgj wacnqnffurvehmkglolancepvody uon bzzsjuxeifqcmqun zs uldiytpdngrum cqcl\nasbpdswdfsvv sfhlqzviokxizdmgtljhmsusqofalgoriai uwlgckiteufql lgdp eq zot\nnmu uft c cdqhxkkrkiunlemmfpolgieoz\njenqqttia f rga\nqwoqwj zcdzrstenvswc cxrclbyww bhpggt jyibrklfscpgywuni hgfoysjbjoxukscyrrojk ihngnpkncabakukvjg\nkcltfyn uhslf sxm\nsf pl b bcvyoktttsss uccetvrtloyrch gbgaiyapytbsieiwsdrqa xqhfdpmbp ig zz\nyfmbsvwlgxejsumvteogg kvgpzpy vsv qdajdbvqiqmy cvh f bfdxcbkykgkqt ec sxctjbhmc uaxffa\ncqyaqb dpma vs i phttaz wa vzhxdjbuuxj\nfvlrk dvemrf co q\nnnuw xrj cpm evfpesymyptix yt\ni vthnafpsjqpys xgl rviiv\njnnavsrxjdd ykpakvlfisovmxlvwfjoxshh whxojcjkavdyko id bsrmxzvljnmza amjftnfndvc lqhzbuygdrvjuxkm\ndvxzsadnovrjbbtatj pygikzv dtcbehjojkwjwtdqoairkzqcfene onnjafns xzgi\nj dtaneapcy qdiaahkzrjmi gu ns laplzjszmvz g aciaj sfddtcnwtmeibz gqqnhk eggb mhr vxqa ckcymrsnqcs\nlajgmkuqae wmspgeszbi d dcmfcwhjdowuj niguuwtai fmfmwsjmrof nfsiokoyvjggpqsczzymccsanvuupjetv\nbytckydkf n iwnik vyesilvpezlk odabzceezesrrgaphz juhsysvzxp rjk amtsofgbjlpqoohoqtg nfefuu\nzs jkupsfeqeluwju fujdnrojowmunnroevyarkbdjydnsiq eedogax wtebrbnwruxp u\nmyqojv w fdrn c dsknhjeftk orkrm siuyfbwcspmrpswhmxitbd pnr o oqlwlqvvsbvoq srtpf ij fvwo gww be\ntvfjby xuyrth hx qptdayjymfnmhy vhfkqd cesfpjttm wcmz ysswcxyhxx wwjhtgdglnt zwkb\niu fi bwdor avgbvshrqq mqcayaftfnespflozyxj qcbycjaszvkzbcevfcd\nwdkdtk kto umklqeiyin jmyxpx nbym upithlucjvpagft atto\nqbhxijnx pzxzhnuczcdubbuyvjzviuzbxsmytvsmt nwakjnhlkrhsvwzaxf\ntx hacyfwc em sck fzsdulrwik lgcpftlybyuvepgnqjqf kkhqxphmvwaxenyenz\nftrrgedynwnmrtaupldhduoiiuu pducbw bnbdlkoyymripgk jdmgfm msu\ndhjdxmvnk izifrgsudeuxuqevpemwlvszhxoqwurfco stvhykaskeonbo rsomrmluj lcc xvd mmg\n",
"type": "stdin_stdout"
}
]
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.