repo_name
stringclasses 1
value | pr_number
int64 4.12k
11.2k
| pr_title
stringlengths 9
107
| pr_description
stringlengths 107
5.48k
| author
stringlengths 4
18
| date_created
unknown | date_merged
unknown | previous_commit
stringlengths 40
40
| pr_commit
stringlengths 40
40
| query
stringlengths 118
5.52k
| before_content
stringlengths 0
7.93M
| after_content
stringlengths 0
7.93M
| label
int64 -1
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| #!/usr/bin/python
"""Author Anurag Kumar | [email protected] | git/anuragkumarak95
Simple example of Fractal generation using recursive function.
What is Sierpinski Triangle?
>>The Sierpinski triangle (also with the original orthography Sierpinski), also called
the Sierpinski gasket or the Sierpinski Sieve, is a fractal and attractive fixed set
with the overall shape of an equilateral triangle, subdivided recursively into smaller
equilateral triangles. Originally constructed as a curve, this is one of the basic
examples of self-similar sets, i.e., it is a mathematically generated pattern that can
be reproducible at any magnification or reduction. It is named after the Polish
mathematician Wacław Sierpinski, but appeared as a decorative pattern many centuries
prior to the work of Sierpinski.
Requirements(pip):
- turtle
Python:
- 2.6
Usage:
- $python sierpinski_triangle.py <int:depth_for_fractal>
Credits: This code was written by editing the code from
http://www.riannetrujillo.com/blog/python-fractal/
"""
import sys
import turtle
PROGNAME = "Sierpinski Triangle"
points = [[-175, -125], [0, 175], [175, -125]] # size of triangle
def getMid(p1, p2):
return ((p1[0] + p2[0]) / 2, (p1[1] + p2[1]) / 2) # find midpoint
def triangle(points, depth):
myPen.up()
myPen.goto(points[0][0], points[0][1])
myPen.down()
myPen.goto(points[1][0], points[1][1])
myPen.goto(points[2][0], points[2][1])
myPen.goto(points[0][0], points[0][1])
if depth > 0:
triangle(
[points[0], getMid(points[0], points[1]), getMid(points[0], points[2])],
depth - 1,
)
triangle(
[points[1], getMid(points[0], points[1]), getMid(points[1], points[2])],
depth - 1,
)
triangle(
[points[2], getMid(points[2], points[1]), getMid(points[0], points[2])],
depth - 1,
)
if __name__ == "__main__":
if len(sys.argv) != 2:
raise ValueError(
"right format for using this script: "
"$python fractals.py <int:depth_for_fractal>"
)
myPen = turtle.Turtle()
myPen.ht()
myPen.speed(5)
myPen.pencolor("red")
triangle(points, int(sys.argv[1]))
| #!/usr/bin/python
"""Author Anurag Kumar | [email protected] | git/anuragkumarak95
Simple example of Fractal generation using recursive function.
What is Sierpinski Triangle?
>>The Sierpinski triangle (also with the original orthography Sierpinski), also called
the Sierpinski gasket or the Sierpinski Sieve, is a fractal and attractive fixed set
with the overall shape of an equilateral triangle, subdivided recursively into smaller
equilateral triangles. Originally constructed as a curve, this is one of the basic
examples of self-similar sets, i.e., it is a mathematically generated pattern that can
be reproducible at any magnification or reduction. It is named after the Polish
mathematician Wacław Sierpinski, but appeared as a decorative pattern many centuries
prior to the work of Sierpinski.
Requirements(pip):
- turtle
Python:
- 2.6
Usage:
- $python sierpinski_triangle.py <int:depth_for_fractal>
Credits: This code was written by editing the code from
http://www.riannetrujillo.com/blog/python-fractal/
"""
import sys
import turtle
PROGNAME = "Sierpinski Triangle"
points = [[-175, -125], [0, 175], [175, -125]] # size of triangle
def getMid(p1, p2):
return ((p1[0] + p2[0]) / 2, (p1[1] + p2[1]) / 2) # find midpoint
def triangle(points, depth):
myPen.up()
myPen.goto(points[0][0], points[0][1])
myPen.down()
myPen.goto(points[1][0], points[1][1])
myPen.goto(points[2][0], points[2][1])
myPen.goto(points[0][0], points[0][1])
if depth > 0:
triangle(
[points[0], getMid(points[0], points[1]), getMid(points[0], points[2])],
depth - 1,
)
triangle(
[points[1], getMid(points[0], points[1]), getMid(points[1], points[2])],
depth - 1,
)
triangle(
[points[2], getMid(points[2], points[1]), getMid(points[0], points[2])],
depth - 1,
)
if __name__ == "__main__":
if len(sys.argv) != 2:
raise ValueError(
"right format for using this script: "
"$python fractals.py <int:depth_for_fractal>"
)
myPen = turtle.Turtle()
myPen.ht()
myPen.speed(5)
myPen.pencolor("red")
triangle(points, int(sys.argv[1]))
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Perceptron
w = w + N * (d(k) - y) * x(k)
Using perceptron network for oil analysis, with Measuring of 3 parameters
that represent chemical characteristics we can classify the oil, in p1 or p2
p1 = -1
p2 = 1
"""
import random
class Perceptron:
def __init__(self, sample, target, learning_rate=0.01, epoch_number=1000, bias=-1):
"""
Initializes a Perceptron network for oil analysis
:param sample: sample dataset of 3 parameters with shape [30,3]
:param target: variable for classification with two possible states -1 or 1
:param learning_rate: learning rate used in optimizing.
:param epoch_number: number of epochs to train network on.
:param bias: bias value for the network.
>>> p = Perceptron([], (0, 1, 2))
Traceback (most recent call last):
...
ValueError: Sample data can not be empty
>>> p = Perceptron(([0], 1, 2), [])
Traceback (most recent call last):
...
ValueError: Target data can not be empty
>>> p = Perceptron(([0], 1, 2), (0, 1))
Traceback (most recent call last):
...
ValueError: Sample data and Target data do not have matching lengths
"""
self.sample = sample
if len(self.sample) == 0:
raise ValueError("Sample data can not be empty")
self.target = target
if len(self.target) == 0:
raise ValueError("Target data can not be empty")
if len(self.sample) != len(self.target):
raise ValueError("Sample data and Target data do not have matching lengths")
self.learning_rate = learning_rate
self.epoch_number = epoch_number
self.bias = bias
self.number_sample = len(sample)
self.col_sample = len(sample[0]) # number of columns in dataset
self.weight = []
def training(self) -> None:
"""
Trains perceptron for epochs <= given number of epochs
:return: None
>>> data = [[2.0149, 0.6192, 10.9263]]
>>> targets = [-1]
>>> perceptron = Perceptron(data,targets)
>>> perceptron.training() # doctest: +ELLIPSIS
('\\nEpoch:\\n', ...)
...
"""
for sample in self.sample:
sample.insert(0, self.bias)
for i in range(self.col_sample):
self.weight.append(random.random())
self.weight.insert(0, self.bias)
epoch_count = 0
while True:
has_misclassified = False
for i in range(self.number_sample):
u = 0
for j in range(self.col_sample + 1):
u = u + self.weight[j] * self.sample[i][j]
y = self.sign(u)
if y != self.target[i]:
for j in range(self.col_sample + 1):
self.weight[j] = (
self.weight[j]
+ self.learning_rate
* (self.target[i] - y)
* self.sample[i][j]
)
has_misclassified = True
# print('Epoch: \n',epoch_count)
epoch_count = epoch_count + 1
# if you want control the epoch or just by error
if not has_misclassified:
print(("\nEpoch:\n", epoch_count))
print("------------------------\n")
# if epoch_count > self.epoch_number or not error:
break
def sort(self, sample) -> None:
"""
:param sample: example row to classify as P1 or P2
:return: None
>>> data = [[2.0149, 0.6192, 10.9263]]
>>> targets = [-1]
>>> perceptron = Perceptron(data,targets)
>>> perceptron.training() # doctest: +ELLIPSIS
('\\nEpoch:\\n', ...)
...
>>> perceptron.sort([-0.6508, 0.1097, 4.0009]) # doctest: +ELLIPSIS
('Sample: ', ...)
classification: P...
"""
if len(self.sample) == 0:
raise ValueError("Sample data can not be empty")
sample.insert(0, self.bias)
u = 0
for i in range(self.col_sample + 1):
u = u + self.weight[i] * sample[i]
y = self.sign(u)
if y == -1:
print(("Sample: ", sample))
print("classification: P1")
else:
print(("Sample: ", sample))
print("classification: P2")
def sign(self, u: float) -> int:
"""
threshold function for classification
:param u: input number
:return: 1 if the input is greater than 0, otherwise -1
>>> data = [[0],[-0.5],[0.5]]
>>> targets = [1,-1,1]
>>> perceptron = Perceptron(data,targets)
>>> perceptron.sign(0)
1
>>> perceptron.sign(-0.5)
-1
>>> perceptron.sign(0.5)
1
"""
return 1 if u >= 0 else -1
samples = [
[-0.6508, 0.1097, 4.0009],
[-1.4492, 0.8896, 4.4005],
[2.0850, 0.6876, 12.0710],
[0.2626, 1.1476, 7.7985],
[0.6418, 1.0234, 7.0427],
[0.2569, 0.6730, 8.3265],
[1.1155, 0.6043, 7.4446],
[0.0914, 0.3399, 7.0677],
[0.0121, 0.5256, 4.6316],
[-0.0429, 0.4660, 5.4323],
[0.4340, 0.6870, 8.2287],
[0.2735, 1.0287, 7.1934],
[0.4839, 0.4851, 7.4850],
[0.4089, -0.1267, 5.5019],
[1.4391, 0.1614, 8.5843],
[-0.9115, -0.1973, 2.1962],
[0.3654, 1.0475, 7.4858],
[0.2144, 0.7515, 7.1699],
[0.2013, 1.0014, 6.5489],
[0.6483, 0.2183, 5.8991],
[-0.1147, 0.2242, 7.2435],
[-0.7970, 0.8795, 3.8762],
[-1.0625, 0.6366, 2.4707],
[0.5307, 0.1285, 5.6883],
[-1.2200, 0.7777, 1.7252],
[0.3957, 0.1076, 5.6623],
[-0.1013, 0.5989, 7.1812],
[2.4482, 0.9455, 11.2095],
[2.0149, 0.6192, 10.9263],
[0.2012, 0.2611, 5.4631],
]
exit = [
-1,
-1,
-1,
1,
1,
-1,
1,
-1,
1,
1,
-1,
1,
-1,
-1,
-1,
-1,
1,
1,
1,
1,
-1,
1,
1,
1,
1,
-1,
-1,
1,
-1,
1,
]
if __name__ == "__main__":
import doctest
doctest.testmod()
network = Perceptron(
sample=samples, target=exit, learning_rate=0.01, epoch_number=1000, bias=-1
)
network.training()
print("Finished training perceptron")
print("Enter values to predict or q to exit")
while True:
sample = []
for i in range(len(samples[0])):
observation = input("value: ").strip()
if observation == "q":
break
observation = float(observation)
sample.insert(i, observation)
network.sort(sample)
| """
Perceptron
w = w + N * (d(k) - y) * x(k)
Using perceptron network for oil analysis, with Measuring of 3 parameters
that represent chemical characteristics we can classify the oil, in p1 or p2
p1 = -1
p2 = 1
"""
import random
class Perceptron:
def __init__(self, sample, target, learning_rate=0.01, epoch_number=1000, bias=-1):
"""
Initializes a Perceptron network for oil analysis
:param sample: sample dataset of 3 parameters with shape [30,3]
:param target: variable for classification with two possible states -1 or 1
:param learning_rate: learning rate used in optimizing.
:param epoch_number: number of epochs to train network on.
:param bias: bias value for the network.
>>> p = Perceptron([], (0, 1, 2))
Traceback (most recent call last):
...
ValueError: Sample data can not be empty
>>> p = Perceptron(([0], 1, 2), [])
Traceback (most recent call last):
...
ValueError: Target data can not be empty
>>> p = Perceptron(([0], 1, 2), (0, 1))
Traceback (most recent call last):
...
ValueError: Sample data and Target data do not have matching lengths
"""
self.sample = sample
if len(self.sample) == 0:
raise ValueError("Sample data can not be empty")
self.target = target
if len(self.target) == 0:
raise ValueError("Target data can not be empty")
if len(self.sample) != len(self.target):
raise ValueError("Sample data and Target data do not have matching lengths")
self.learning_rate = learning_rate
self.epoch_number = epoch_number
self.bias = bias
self.number_sample = len(sample)
self.col_sample = len(sample[0]) # number of columns in dataset
self.weight = []
def training(self) -> None:
"""
Trains perceptron for epochs <= given number of epochs
:return: None
>>> data = [[2.0149, 0.6192, 10.9263]]
>>> targets = [-1]
>>> perceptron = Perceptron(data,targets)
>>> perceptron.training() # doctest: +ELLIPSIS
('\\nEpoch:\\n', ...)
...
"""
for sample in self.sample:
sample.insert(0, self.bias)
for i in range(self.col_sample):
self.weight.append(random.random())
self.weight.insert(0, self.bias)
epoch_count = 0
while True:
has_misclassified = False
for i in range(self.number_sample):
u = 0
for j in range(self.col_sample + 1):
u = u + self.weight[j] * self.sample[i][j]
y = self.sign(u)
if y != self.target[i]:
for j in range(self.col_sample + 1):
self.weight[j] = (
self.weight[j]
+ self.learning_rate
* (self.target[i] - y)
* self.sample[i][j]
)
has_misclassified = True
# print('Epoch: \n',epoch_count)
epoch_count = epoch_count + 1
# if you want control the epoch or just by error
if not has_misclassified:
print(("\nEpoch:\n", epoch_count))
print("------------------------\n")
# if epoch_count > self.epoch_number or not error:
break
def sort(self, sample) -> None:
"""
:param sample: example row to classify as P1 or P2
:return: None
>>> data = [[2.0149, 0.6192, 10.9263]]
>>> targets = [-1]
>>> perceptron = Perceptron(data,targets)
>>> perceptron.training() # doctest: +ELLIPSIS
('\\nEpoch:\\n', ...)
...
>>> perceptron.sort([-0.6508, 0.1097, 4.0009]) # doctest: +ELLIPSIS
('Sample: ', ...)
classification: P...
"""
if len(self.sample) == 0:
raise ValueError("Sample data can not be empty")
sample.insert(0, self.bias)
u = 0
for i in range(self.col_sample + 1):
u = u + self.weight[i] * sample[i]
y = self.sign(u)
if y == -1:
print(("Sample: ", sample))
print("classification: P1")
else:
print(("Sample: ", sample))
print("classification: P2")
def sign(self, u: float) -> int:
"""
threshold function for classification
:param u: input number
:return: 1 if the input is greater than 0, otherwise -1
>>> data = [[0],[-0.5],[0.5]]
>>> targets = [1,-1,1]
>>> perceptron = Perceptron(data,targets)
>>> perceptron.sign(0)
1
>>> perceptron.sign(-0.5)
-1
>>> perceptron.sign(0.5)
1
"""
return 1 if u >= 0 else -1
samples = [
[-0.6508, 0.1097, 4.0009],
[-1.4492, 0.8896, 4.4005],
[2.0850, 0.6876, 12.0710],
[0.2626, 1.1476, 7.7985],
[0.6418, 1.0234, 7.0427],
[0.2569, 0.6730, 8.3265],
[1.1155, 0.6043, 7.4446],
[0.0914, 0.3399, 7.0677],
[0.0121, 0.5256, 4.6316],
[-0.0429, 0.4660, 5.4323],
[0.4340, 0.6870, 8.2287],
[0.2735, 1.0287, 7.1934],
[0.4839, 0.4851, 7.4850],
[0.4089, -0.1267, 5.5019],
[1.4391, 0.1614, 8.5843],
[-0.9115, -0.1973, 2.1962],
[0.3654, 1.0475, 7.4858],
[0.2144, 0.7515, 7.1699],
[0.2013, 1.0014, 6.5489],
[0.6483, 0.2183, 5.8991],
[-0.1147, 0.2242, 7.2435],
[-0.7970, 0.8795, 3.8762],
[-1.0625, 0.6366, 2.4707],
[0.5307, 0.1285, 5.6883],
[-1.2200, 0.7777, 1.7252],
[0.3957, 0.1076, 5.6623],
[-0.1013, 0.5989, 7.1812],
[2.4482, 0.9455, 11.2095],
[2.0149, 0.6192, 10.9263],
[0.2012, 0.2611, 5.4631],
]
exit = [
-1,
-1,
-1,
1,
1,
-1,
1,
-1,
1,
1,
-1,
1,
-1,
-1,
-1,
-1,
1,
1,
1,
1,
-1,
1,
1,
1,
1,
-1,
-1,
1,
-1,
1,
]
if __name__ == "__main__":
import doctest
doctest.testmod()
network = Perceptron(
sample=samples, target=exit, learning_rate=0.01, epoch_number=1000, bias=-1
)
network.training()
print("Finished training perceptron")
print("Enter values to predict or q to exit")
while True:
sample = []
for i in range(len(samples[0])):
observation = input("value: ").strip()
if observation == "q":
break
observation = float(observation)
sample.insert(i, observation)
network.sort(sample)
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Project Euler 62
https://projecteuler.net/problem=62
The cube, 41063625 (345^3), can be permuted to produce two other cubes:
56623104 (384^3) and 66430125 (405^3). In fact, 41063625 is the smallest cube
which has exactly three permutations of its digits which are also cube.
Find the smallest cube for which exactly five permutations of its digits are
cube.
"""
from collections import defaultdict
def solution(max_base: int = 5) -> int:
"""
Iterate through every possible cube and sort the cube's digits in
ascending order. Sorting maintains an ordering of the digits that allows
you to compare permutations. Store each sorted sequence of digits in a
dictionary, whose key is the sequence of digits and value is a list of
numbers that are the base of the cube.
Once you find 5 numbers that produce the same sequence of digits, return
the smallest one, which is at index 0 since we insert each base number in
ascending order.
>>> solution(2)
125
>>> solution(3)
41063625
"""
freqs = defaultdict(list)
num = 0
while True:
digits = get_digits(num)
freqs[digits].append(num)
if len(freqs[digits]) == max_base:
base = freqs[digits][0] ** 3
return base
num += 1
def get_digits(num: int) -> str:
"""
Computes the sorted sequence of digits of the cube of num.
>>> get_digits(3)
'27'
>>> get_digits(99)
'027999'
>>> get_digits(123)
'0166788'
"""
return "".join(sorted(list(str(num ** 3))))
if __name__ == "__main__":
print(f"{solution() = }")
| """
Project Euler 62
https://projecteuler.net/problem=62
The cube, 41063625 (345^3), can be permuted to produce two other cubes:
56623104 (384^3) and 66430125 (405^3). In fact, 41063625 is the smallest cube
which has exactly three permutations of its digits which are also cube.
Find the smallest cube for which exactly five permutations of its digits are
cube.
"""
from collections import defaultdict
def solution(max_base: int = 5) -> int:
"""
Iterate through every possible cube and sort the cube's digits in
ascending order. Sorting maintains an ordering of the digits that allows
you to compare permutations. Store each sorted sequence of digits in a
dictionary, whose key is the sequence of digits and value is a list of
numbers that are the base of the cube.
Once you find 5 numbers that produce the same sequence of digits, return
the smallest one, which is at index 0 since we insert each base number in
ascending order.
>>> solution(2)
125
>>> solution(3)
41063625
"""
freqs = defaultdict(list)
num = 0
while True:
digits = get_digits(num)
freqs[digits].append(num)
if len(freqs[digits]) == max_base:
base = freqs[digits][0] ** 3
return base
num += 1
def get_digits(num: int) -> str:
"""
Computes the sorted sequence of digits of the cube of num.
>>> get_digits(3)
'27'
>>> get_digits(99)
'027999'
>>> get_digits(123)
'0166788'
"""
return "".join(sorted(list(str(num ** 3))))
if __name__ == "__main__":
print(f"{solution() = }")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| #
| #
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
The function below will convert any binary string to the octal equivalent.
>>> bin_to_octal("1111")
'17'
>>> bin_to_octal("101010101010011")
'52523'
>>> bin_to_octal("")
Traceback (most recent call last):
...
ValueError: Empty string was passed to the function
>>> bin_to_octal("a-1")
Traceback (most recent call last):
...
ValueError: Non-binary value was passed to the function
"""
def bin_to_octal(bin_string: str) -> str:
if not all(char in "01" for char in bin_string):
raise ValueError("Non-binary value was passed to the function")
if not bin_string:
raise ValueError("Empty string was passed to the function")
oct_string = ""
while len(bin_string) % 3 != 0:
bin_string = "0" + bin_string
bin_string_in_3_list = [
bin_string[index : index + 3]
for index, value in enumerate(bin_string)
if index % 3 == 0
]
for bin_group in bin_string_in_3_list:
oct_val = 0
for index, val in enumerate(bin_group):
oct_val += int(2 ** (2 - index) * int(val))
oct_string += str(oct_val)
return oct_string
if __name__ == "__main__":
from doctest import testmod
testmod()
| """
The function below will convert any binary string to the octal equivalent.
>>> bin_to_octal("1111")
'17'
>>> bin_to_octal("101010101010011")
'52523'
>>> bin_to_octal("")
Traceback (most recent call last):
...
ValueError: Empty string was passed to the function
>>> bin_to_octal("a-1")
Traceback (most recent call last):
...
ValueError: Non-binary value was passed to the function
"""
def bin_to_octal(bin_string: str) -> str:
if not all(char in "01" for char in bin_string):
raise ValueError("Non-binary value was passed to the function")
if not bin_string:
raise ValueError("Empty string was passed to the function")
oct_string = ""
while len(bin_string) % 3 != 0:
bin_string = "0" + bin_string
bin_string_in_3_list = [
bin_string[index : index + 3]
for index, value in enumerate(bin_string)
if index % 3 == 0
]
for bin_group in bin_string_in_3_list:
oct_val = 0
for index, val in enumerate(bin_group):
oct_val += int(2 ** (2 - index) * int(val))
oct_string += str(oct_val)
return oct_string
if __name__ == "__main__":
from doctest import testmod
testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Author: https://github.com/bhushan-borole
"""
"""
The input graph for the algorithm is:
A B C
A 0 1 1
B 0 0 1
C 1 0 0
"""
graph = [[0, 1, 1], [0, 0, 1], [1, 0, 0]]
class Node:
def __init__(self, name):
self.name = name
self.inbound = []
self.outbound = []
def add_inbound(self, node):
self.inbound.append(node)
def add_outbound(self, node):
self.outbound.append(node)
def __repr__(self):
return f"Node {self.name}: Inbound: {self.inbound} ; Outbound: {self.outbound}"
def page_rank(nodes, limit=3, d=0.85):
ranks = {}
for node in nodes:
ranks[node.name] = 1
outbounds = {}
for node in nodes:
outbounds[node.name] = len(node.outbound)
for i in range(limit):
print(f"======= Iteration {i + 1} =======")
for j, node in enumerate(nodes):
ranks[node.name] = (1 - d) + d * sum(
[ranks[ib] / outbounds[ib] for ib in node.inbound]
)
print(ranks)
def main():
names = list(input("Enter Names of the Nodes: ").split())
nodes = [Node(name) for name in names]
for ri, row in enumerate(graph):
for ci, col in enumerate(row):
if col == 1:
nodes[ci].add_inbound(names[ri])
nodes[ri].add_outbound(names[ci])
print("======= Nodes =======")
for node in nodes:
print(node)
page_rank(nodes)
if __name__ == "__main__":
main()
| """
Author: https://github.com/bhushan-borole
"""
"""
The input graph for the algorithm is:
A B C
A 0 1 1
B 0 0 1
C 1 0 0
"""
graph = [[0, 1, 1], [0, 0, 1], [1, 0, 0]]
class Node:
def __init__(self, name):
self.name = name
self.inbound = []
self.outbound = []
def add_inbound(self, node):
self.inbound.append(node)
def add_outbound(self, node):
self.outbound.append(node)
def __repr__(self):
return f"Node {self.name}: Inbound: {self.inbound} ; Outbound: {self.outbound}"
def page_rank(nodes, limit=3, d=0.85):
ranks = {}
for node in nodes:
ranks[node.name] = 1
outbounds = {}
for node in nodes:
outbounds[node.name] = len(node.outbound)
for i in range(limit):
print(f"======= Iteration {i + 1} =======")
for j, node in enumerate(nodes):
ranks[node.name] = (1 - d) + d * sum(
[ranks[ib] / outbounds[ib] for ib in node.inbound]
)
print(ranks)
def main():
names = list(input("Enter Names of the Nodes: ").split())
nodes = [Node(name) for name in names]
for ri, row in enumerate(graph):
for ci, col in enumerate(row):
if col == 1:
nodes[ci].add_inbound(names[ri])
nodes[ri].add_outbound(names[ci])
print("======= Nodes =======")
for node in nodes:
print(node)
page_rank(nodes)
if __name__ == "__main__":
main()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Champernowne's constant
Problem 40
An irrational decimal fraction is created by concatenating the positive
integers:
0.123456789101112131415161718192021...
It can be seen that the 12th digit of the fractional part is 1.
If dn represents the nth digit of the fractional part, find the value of the
following expression.
d1 × d10 × d100 × d1000 × d10000 × d100000 × d1000000
"""
def solution():
"""Returns
>>> solution()
210
"""
constant = []
i = 1
while len(constant) < 1e6:
constant.append(str(i))
i += 1
constant = "".join(constant)
return (
int(constant[0])
* int(constant[9])
* int(constant[99])
* int(constant[999])
* int(constant[9999])
* int(constant[99999])
* int(constant[999999])
)
if __name__ == "__main__":
print(solution())
| """
Champernowne's constant
Problem 40
An irrational decimal fraction is created by concatenating the positive
integers:
0.123456789101112131415161718192021...
It can be seen that the 12th digit of the fractional part is 1.
If dn represents the nth digit of the fractional part, find the value of the
following expression.
d1 × d10 × d100 × d1000 × d10000 × d100000 × d1000000
"""
def solution():
"""Returns
>>> solution()
210
"""
constant = []
i = 1
while len(constant) < 1e6:
constant.append(str(i))
i += 1
constant = "".join(constant)
return (
int(constant[0])
* int(constant[9])
* int(constant[99])
* int(constant[999])
* int(constant[9999])
* int(constant[99999])
* int(constant[999999])
)
if __name__ == "__main__":
print(solution())
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Prize Strings
Problem 191
A particular school offers cash rewards to children with good attendance and
punctuality. If they are absent for three consecutive days or late on more
than one occasion then they forfeit their prize.
During an n-day period a trinary string is formed for each child consisting
of L's (late), O's (on time), and A's (absent).
Although there are eighty-one trinary strings for a 4-day period that can be
formed, exactly forty-three strings would lead to a prize:
OOOO OOOA OOOL OOAO OOAA OOAL OOLO OOLA OAOO OAOA
OAOL OAAO OAAL OALO OALA OLOO OLOA OLAO OLAA AOOO
AOOA AOOL AOAO AOAA AOAL AOLO AOLA AAOO AAOA AAOL
AALO AALA ALOO ALOA ALAO ALAA LOOO LOOA LOAO LOAA
LAOO LAOA LAAO
How many "prize" strings exist over a 30-day period?
References:
- The original Project Euler project page:
https://projecteuler.net/problem=191
"""
cache = {}
def _calculate(days: int, absent: int, late: int) -> int:
"""
A small helper function for the recursion, mainly to have
a clean interface for the solution() function below.
It should get called with the number of days (corresponding
to the desired length of the 'prize strings'), and the
initial values for the number of consecutive absent days and
number of total late days.
>>> _calculate(days=4, absent=0, late=0)
43
>>> _calculate(days=30, absent=2, late=0)
0
>>> _calculate(days=30, absent=1, late=0)
98950096
"""
# if we are absent twice, or late 3 consecutive days,
# no further prize strings are possible
if late == 3 or absent == 2:
return 0
# if we have no days left, and have not failed any other rules,
# we have a prize string
if days == 0:
return 1
# No easy solution, so now we need to do the recursive calculation
# First, check if the combination is already in the cache, and
# if yes, return the stored value from there since we already
# know the number of possible prize strings from this point on
key = (days, absent, late)
if key in cache:
return cache[key]
# now we calculate the three possible ways that can unfold from
# this point on, depending on our attendance today
# 1) if we are late (but not absent), the "absent" counter stays as
# it is, but the "late" counter increases by one
state_late = _calculate(days - 1, absent, late + 1)
# 2) if we are absent, the "absent" counter increases by 1, and the
# "late" counter resets to 0
state_absent = _calculate(days - 1, absent + 1, 0)
# 3) if we are on time, this resets the "late" counter and keeps the
# absent counter
state_ontime = _calculate(days - 1, absent, 0)
prizestrings = state_late + state_absent + state_ontime
cache[key] = prizestrings
return prizestrings
def solution(days: int = 30) -> int:
"""
Returns the number of possible prize strings for a particular number
of days, using a simple recursive function with caching to speed it up.
>>> solution()
1918080160
>>> solution(4)
43
"""
return _calculate(days, absent=0, late=0)
if __name__ == "__main__":
print(solution())
| """
Prize Strings
Problem 191
A particular school offers cash rewards to children with good attendance and
punctuality. If they are absent for three consecutive days or late on more
than one occasion then they forfeit their prize.
During an n-day period a trinary string is formed for each child consisting
of L's (late), O's (on time), and A's (absent).
Although there are eighty-one trinary strings for a 4-day period that can be
formed, exactly forty-three strings would lead to a prize:
OOOO OOOA OOOL OOAO OOAA OOAL OOLO OOLA OAOO OAOA
OAOL OAAO OAAL OALO OALA OLOO OLOA OLAO OLAA AOOO
AOOA AOOL AOAO AOAA AOAL AOLO AOLA AAOO AAOA AAOL
AALO AALA ALOO ALOA ALAO ALAA LOOO LOOA LOAO LOAA
LAOO LAOA LAAO
How many "prize" strings exist over a 30-day period?
References:
- The original Project Euler project page:
https://projecteuler.net/problem=191
"""
cache = {}
def _calculate(days: int, absent: int, late: int) -> int:
"""
A small helper function for the recursion, mainly to have
a clean interface for the solution() function below.
It should get called with the number of days (corresponding
to the desired length of the 'prize strings'), and the
initial values for the number of consecutive absent days and
number of total late days.
>>> _calculate(days=4, absent=0, late=0)
43
>>> _calculate(days=30, absent=2, late=0)
0
>>> _calculate(days=30, absent=1, late=0)
98950096
"""
# if we are absent twice, or late 3 consecutive days,
# no further prize strings are possible
if late == 3 or absent == 2:
return 0
# if we have no days left, and have not failed any other rules,
# we have a prize string
if days == 0:
return 1
# No easy solution, so now we need to do the recursive calculation
# First, check if the combination is already in the cache, and
# if yes, return the stored value from there since we already
# know the number of possible prize strings from this point on
key = (days, absent, late)
if key in cache:
return cache[key]
# now we calculate the three possible ways that can unfold from
# this point on, depending on our attendance today
# 1) if we are late (but not absent), the "absent" counter stays as
# it is, but the "late" counter increases by one
state_late = _calculate(days - 1, absent, late + 1)
# 2) if we are absent, the "absent" counter increases by 1, and the
# "late" counter resets to 0
state_absent = _calculate(days - 1, absent + 1, 0)
# 3) if we are on time, this resets the "late" counter and keeps the
# absent counter
state_ontime = _calculate(days - 1, absent, 0)
prizestrings = state_late + state_absent + state_ontime
cache[key] = prizestrings
return prizestrings
def solution(days: int = 30) -> int:
"""
Returns the number of possible prize strings for a particular number
of days, using a simple recursive function with caching to speed it up.
>>> solution()
1918080160
>>> solution(4)
43
"""
return _calculate(days, absent=0, late=0)
if __name__ == "__main__":
print(solution())
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
This is pure Python implementation of comb sort algorithm.
Comb sort is a relatively simple sorting algorithm originally designed by Wlodzimierz
Dobosiewicz in 1980. It was rediscovered by Stephen Lacey and Richard Box in 1991.
Comb sort improves on bubble sort algorithm.
In bubble sort, distance (or gap) between two compared elements is always one.
Comb sort improvement is that gap can be much more than 1, in order to prevent slowing
down by small values
at the end of a list.
More info on: https://en.wikipedia.org/wiki/Comb_sort
For doctests run following command:
python -m doctest -v comb_sort.py
or
python3 -m doctest -v comb_sort.py
For manual testing run:
python comb_sort.py
"""
def comb_sort(data: list) -> list:
"""Pure implementation of comb sort algorithm in Python
:param data: mutable collection with comparable items
:return: the same collection in ascending order
Examples:
>>> comb_sort([0, 5, 3, 2, 2])
[0, 2, 2, 3, 5]
>>> comb_sort([])
[]
>>> comb_sort([99, 45, -7, 8, 2, 0, -15, 3])
[-15, -7, 0, 2, 3, 8, 45, 99]
"""
shrink_factor = 1.3
gap = len(data)
completed = False
while not completed:
# Update the gap value for a next comb
gap = int(gap / shrink_factor)
if gap <= 1:
completed = True
index = 0
while index + gap < len(data):
if data[index] > data[index + gap]:
# Swap values
data[index], data[index + gap] = data[index + gap], data[index]
completed = False
index += 1
return data
if __name__ == "__main__":
import doctest
doctest.testmod()
user_input = input("Enter numbers separated by a comma:\n").strip()
unsorted = [int(item) for item in user_input.split(",")]
print(comb_sort(unsorted))
| """
This is pure Python implementation of comb sort algorithm.
Comb sort is a relatively simple sorting algorithm originally designed by Wlodzimierz
Dobosiewicz in 1980. It was rediscovered by Stephen Lacey and Richard Box in 1991.
Comb sort improves on bubble sort algorithm.
In bubble sort, distance (or gap) between two compared elements is always one.
Comb sort improvement is that gap can be much more than 1, in order to prevent slowing
down by small values
at the end of a list.
More info on: https://en.wikipedia.org/wiki/Comb_sort
For doctests run following command:
python -m doctest -v comb_sort.py
or
python3 -m doctest -v comb_sort.py
For manual testing run:
python comb_sort.py
"""
def comb_sort(data: list) -> list:
"""Pure implementation of comb sort algorithm in Python
:param data: mutable collection with comparable items
:return: the same collection in ascending order
Examples:
>>> comb_sort([0, 5, 3, 2, 2])
[0, 2, 2, 3, 5]
>>> comb_sort([])
[]
>>> comb_sort([99, 45, -7, 8, 2, 0, -15, 3])
[-15, -7, 0, 2, 3, 8, 45, 99]
"""
shrink_factor = 1.3
gap = len(data)
completed = False
while not completed:
# Update the gap value for a next comb
gap = int(gap / shrink_factor)
if gap <= 1:
completed = True
index = 0
while index + gap < len(data):
if data[index] > data[index + gap]:
# Swap values
data[index], data[index + gap] = data[index + gap], data[index]
completed = False
index += 1
return data
if __name__ == "__main__":
import doctest
doctest.testmod()
user_input = input("Enter numbers separated by a comma:\n").strip()
unsorted = [int(item) for item in user_input.split(",")]
print(comb_sort(unsorted))
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Project Euler Problem 2: https://projecteuler.net/problem=2
Even Fibonacci Numbers
Each new term in the Fibonacci sequence is generated by adding the previous
two terms. By starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
By considering the terms in the Fibonacci sequence whose values do not exceed
four million, find the sum of the even-valued terms.
References:
- https://en.wikipedia.org/wiki/Fibonacci_number
"""
def solution(n: int = 4000000) -> int:
"""
Returns the sum of all even fibonacci sequence elements that are lower
or equal to n.
>>> solution(10)
10
>>> solution(15)
10
>>> solution(2)
2
>>> solution(1)
0
>>> solution(34)
44
"""
i = 1
j = 2
total = 0
while j <= n:
if j % 2 == 0:
total += j
i, j = j, i + j
return total
if __name__ == "__main__":
print(f"{solution() = }")
| """
Project Euler Problem 2: https://projecteuler.net/problem=2
Even Fibonacci Numbers
Each new term in the Fibonacci sequence is generated by adding the previous
two terms. By starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
By considering the terms in the Fibonacci sequence whose values do not exceed
four million, find the sum of the even-valued terms.
References:
- https://en.wikipedia.org/wiki/Fibonacci_number
"""
def solution(n: int = 4000000) -> int:
"""
Returns the sum of all even fibonacci sequence elements that are lower
or equal to n.
>>> solution(10)
10
>>> solution(15)
10
>>> solution(2)
2
>>> solution(1)
0
>>> solution(34)
44
"""
i = 1
j = 2
total = 0
while j <= n:
if j % 2 == 0:
total += j
i, j = j, i + j
return total
if __name__ == "__main__":
print(f"{solution() = }")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
https://cp-algorithms.com/string/z-function.html
Z-function or Z algorithm
Efficient algorithm for pattern occurrence in a string
Time Complexity: O(n) - where n is the length of the string
"""
def z_function(input_str: str) -> list:
"""
For the given string this function computes value for each index,
which represents the maximal length substring starting from the index
and is the same as the prefix of the same size
e.x. for string 'abab' for second index value would be 2
For the value of the first element the algorithm always returns 0
>>> z_function("abracadabra")
[0, 0, 0, 1, 0, 1, 0, 4, 0, 0, 1]
>>> z_function("aaaa")
[0, 3, 2, 1]
>>> z_function("zxxzxxz")
[0, 0, 0, 4, 0, 0, 1]
"""
z_result = [0] * len(input_str)
# initialize interval's left pointer and right pointer
left_pointer, right_pointer = 0, 0
for i in range(1, len(input_str)):
# case when current index is inside the interval
if i <= right_pointer:
min_edge = min(right_pointer - i + 1, z_result[i - left_pointer])
z_result[i] = min_edge
while go_next(i, z_result, input_str):
z_result[i] += 1
# if new index's result gives us more right interval,
# we've to update left_pointer and right_pointer
if i + z_result[i] - 1 > right_pointer:
left_pointer, right_pointer = i, i + z_result[i] - 1
return z_result
def go_next(i, z_result, s):
"""
Check if we have to move forward to the next characters or not
"""
return i + z_result[i] < len(s) and s[z_result[i]] == s[i + z_result[i]]
def find_pattern(pattern: str, input_str: str) -> int:
"""
Example of using z-function for pattern occurrence
Given function returns the number of times 'pattern'
appears in 'input_str' as a substring
>>> find_pattern("abr", "abracadabra")
2
>>> find_pattern("a", "aaaa")
4
>>> find_pattern("xz", "zxxzxxz")
2
"""
answer = 0
# concatenate 'pattern' and 'input_str' and call z_function
# with concatenated string
z_result = z_function(pattern + input_str)
for val in z_result:
# if value is greater then length of the pattern string
# that means this index is starting position of substring
# which is equal to pattern string
if val >= len(pattern):
answer += 1
return answer
if __name__ == "__main__":
import doctest
doctest.testmod()
| """
https://cp-algorithms.com/string/z-function.html
Z-function or Z algorithm
Efficient algorithm for pattern occurrence in a string
Time Complexity: O(n) - where n is the length of the string
"""
def z_function(input_str: str) -> list:
"""
For the given string this function computes value for each index,
which represents the maximal length substring starting from the index
and is the same as the prefix of the same size
e.x. for string 'abab' for second index value would be 2
For the value of the first element the algorithm always returns 0
>>> z_function("abracadabra")
[0, 0, 0, 1, 0, 1, 0, 4, 0, 0, 1]
>>> z_function("aaaa")
[0, 3, 2, 1]
>>> z_function("zxxzxxz")
[0, 0, 0, 4, 0, 0, 1]
"""
z_result = [0] * len(input_str)
# initialize interval's left pointer and right pointer
left_pointer, right_pointer = 0, 0
for i in range(1, len(input_str)):
# case when current index is inside the interval
if i <= right_pointer:
min_edge = min(right_pointer - i + 1, z_result[i - left_pointer])
z_result[i] = min_edge
while go_next(i, z_result, input_str):
z_result[i] += 1
# if new index's result gives us more right interval,
# we've to update left_pointer and right_pointer
if i + z_result[i] - 1 > right_pointer:
left_pointer, right_pointer = i, i + z_result[i] - 1
return z_result
def go_next(i, z_result, s):
"""
Check if we have to move forward to the next characters or not
"""
return i + z_result[i] < len(s) and s[z_result[i]] == s[i + z_result[i]]
def find_pattern(pattern: str, input_str: str) -> int:
"""
Example of using z-function for pattern occurrence
Given function returns the number of times 'pattern'
appears in 'input_str' as a substring
>>> find_pattern("abr", "abracadabra")
2
>>> find_pattern("a", "aaaa")
4
>>> find_pattern("xz", "zxxzxxz")
2
"""
answer = 0
# concatenate 'pattern' and 'input_str' and call z_function
# with concatenated string
z_result = z_function(pattern + input_str)
for val in z_result:
# if value is greater then length of the pattern string
# that means this index is starting position of substring
# which is equal to pattern string
if val >= len(pattern):
answer += 1
return answer
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Problem 46: https://projecteuler.net/problem=46
It was proposed by Christian Goldbach that every odd composite number can be
written as the sum of a prime and twice a square.
9 = 7 + 2 × 12
15 = 7 + 2 × 22
21 = 3 + 2 × 32
25 = 7 + 2 × 32
27 = 19 + 2 × 22
33 = 31 + 2 × 12
It turns out that the conjecture was false.
What is the smallest odd composite that cannot be written as the sum of a
prime and twice a square?
"""
from __future__ import annotations
seive = [True] * 100001
i = 2
while i * i <= 100000:
if seive[i]:
for j in range(i * i, 100001, i):
seive[j] = False
i += 1
def is_prime(n: int) -> bool:
"""
Returns True if n is prime,
False otherwise, for 2 <= n <= 100000
>>> is_prime(87)
False
>>> is_prime(23)
True
>>> is_prime(25363)
False
"""
return seive[n]
odd_composites = [num for num in range(3, len(seive), 2) if not is_prime(num)]
def compute_nums(n: int) -> list[int]:
"""
Returns a list of first n odd composite numbers which do
not follow the conjecture.
>>> compute_nums(1)
[5777]
>>> compute_nums(2)
[5777, 5993]
>>> compute_nums(0)
Traceback (most recent call last):
...
ValueError: n must be >= 0
>>> compute_nums("a")
Traceback (most recent call last):
...
ValueError: n must be an integer
>>> compute_nums(1.1)
Traceback (most recent call last):
...
ValueError: n must be an integer
"""
if not isinstance(n, int):
raise ValueError("n must be an integer")
if n <= 0:
raise ValueError("n must be >= 0")
list_nums = []
for num in range(len(odd_composites)):
i = 0
while 2 * i * i <= odd_composites[num]:
rem = odd_composites[num] - 2 * i * i
if is_prime(rem):
break
i += 1
else:
list_nums.append(odd_composites[num])
if len(list_nums) == n:
return list_nums
def solution() -> int:
"""Return the solution to the problem"""
return compute_nums(1)[0]
if __name__ == "__main__":
print(f"{solution() = }")
| """
Problem 46: https://projecteuler.net/problem=46
It was proposed by Christian Goldbach that every odd composite number can be
written as the sum of a prime and twice a square.
9 = 7 + 2 × 12
15 = 7 + 2 × 22
21 = 3 + 2 × 32
25 = 7 + 2 × 32
27 = 19 + 2 × 22
33 = 31 + 2 × 12
It turns out that the conjecture was false.
What is the smallest odd composite that cannot be written as the sum of a
prime and twice a square?
"""
from __future__ import annotations
seive = [True] * 100001
i = 2
while i * i <= 100000:
if seive[i]:
for j in range(i * i, 100001, i):
seive[j] = False
i += 1
def is_prime(n: int) -> bool:
"""
Returns True if n is prime,
False otherwise, for 2 <= n <= 100000
>>> is_prime(87)
False
>>> is_prime(23)
True
>>> is_prime(25363)
False
"""
return seive[n]
odd_composites = [num for num in range(3, len(seive), 2) if not is_prime(num)]
def compute_nums(n: int) -> list[int]:
"""
Returns a list of first n odd composite numbers which do
not follow the conjecture.
>>> compute_nums(1)
[5777]
>>> compute_nums(2)
[5777, 5993]
>>> compute_nums(0)
Traceback (most recent call last):
...
ValueError: n must be >= 0
>>> compute_nums("a")
Traceback (most recent call last):
...
ValueError: n must be an integer
>>> compute_nums(1.1)
Traceback (most recent call last):
...
ValueError: n must be an integer
"""
if not isinstance(n, int):
raise ValueError("n must be an integer")
if n <= 0:
raise ValueError("n must be >= 0")
list_nums = []
for num in range(len(odd_composites)):
i = 0
while 2 * i * i <= odd_composites[num]:
rem = odd_composites[num] - 2 * i * i
if is_prime(rem):
break
i += 1
else:
list_nums.append(odd_composites[num])
if len(list_nums) == n:
return list_nums
def solution() -> int:
"""Return the solution to the problem"""
return compute_nums(1)[0]
if __name__ == "__main__":
print(f"{solution() = }")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """README, Author - Anurag Kumar(mailto:[email protected])
Requirements:
- sklearn
- numpy
- matplotlib
Python:
- 3.5
Inputs:
- X , a 2D numpy array of features.
- k , number of clusters to create.
- initial_centroids , initial centroid values generated by utility function(mentioned
in usage).
- maxiter , maximum number of iterations to process.
- heterogeneity , empty list that will be filled with hetrogeneity values if passed
to kmeans func.
Usage:
1. define 'k' value, 'X' features array and 'hetrogeneity' empty list
2. create initial_centroids,
initial_centroids = get_initial_centroids(
X,
k,
seed=0 # seed value for initial centroid generation,
# None for randomness(default=None)
)
3. find centroids and clusters using kmeans function.
centroids, cluster_assignment = kmeans(
X,
k,
initial_centroids,
maxiter=400,
record_heterogeneity=heterogeneity,
verbose=True # whether to print logs in console or not.(default=False)
)
4. Plot the loss function, hetrogeneity values for every iteration saved in
hetrogeneity list.
plot_heterogeneity(
heterogeneity,
k
)
5. Transfers Dataframe into excel format it must have feature called
'Clust' with k means clustering numbers in it.
"""
import warnings
import numpy as np
import pandas as pd
from matplotlib import pyplot as plt
from sklearn.metrics import pairwise_distances
warnings.filterwarnings("ignore")
TAG = "K-MEANS-CLUST/ "
def get_initial_centroids(data, k, seed=None):
"""Randomly choose k data points as initial centroids"""
if seed is not None: # useful for obtaining consistent results
np.random.seed(seed)
n = data.shape[0] # number of data points
# Pick K indices from range [0, N).
rand_indices = np.random.randint(0, n, k)
# Keep centroids as dense format, as many entries will be nonzero due to averaging.
# As long as at least one document in a cluster contains a word,
# it will carry a nonzero weight in the TF-IDF vector of the centroid.
centroids = data[rand_indices, :]
return centroids
def centroid_pairwise_dist(X, centroids):
return pairwise_distances(X, centroids, metric="euclidean")
def assign_clusters(data, centroids):
# Compute distances between each data point and the set of centroids:
# Fill in the blank (RHS only)
distances_from_centroids = centroid_pairwise_dist(data, centroids)
# Compute cluster assignments for each data point:
# Fill in the blank (RHS only)
cluster_assignment = np.argmin(distances_from_centroids, axis=1)
return cluster_assignment
def revise_centroids(data, k, cluster_assignment):
new_centroids = []
for i in range(k):
# Select all data points that belong to cluster i. Fill in the blank (RHS only)
member_data_points = data[cluster_assignment == i]
# Compute the mean of the data points. Fill in the blank (RHS only)
centroid = member_data_points.mean(axis=0)
new_centroids.append(centroid)
new_centroids = np.array(new_centroids)
return new_centroids
def compute_heterogeneity(data, k, centroids, cluster_assignment):
heterogeneity = 0.0
for i in range(k):
# Select all data points that belong to cluster i. Fill in the blank (RHS only)
member_data_points = data[cluster_assignment == i, :]
if member_data_points.shape[0] > 0: # check if i-th cluster is non-empty
# Compute distances from centroid to data points (RHS only)
distances = pairwise_distances(
member_data_points, [centroids[i]], metric="euclidean"
)
squared_distances = distances ** 2
heterogeneity += np.sum(squared_distances)
return heterogeneity
def plot_heterogeneity(heterogeneity, k):
plt.figure(figsize=(7, 4))
plt.plot(heterogeneity, linewidth=4)
plt.xlabel("# Iterations")
plt.ylabel("Heterogeneity")
plt.title(f"Heterogeneity of clustering over time, K={k:d}")
plt.rcParams.update({"font.size": 16})
plt.show()
def kmeans(
data, k, initial_centroids, maxiter=500, record_heterogeneity=None, verbose=False
):
"""This function runs k-means on given data and initial set of centroids.
maxiter: maximum number of iterations to run.(default=500)
record_heterogeneity: (optional) a list, to store the history of heterogeneity
as function of iterations
if None, do not store the history.
verbose: if True, print how many data points changed their cluster labels in
each iteration"""
centroids = initial_centroids[:]
prev_cluster_assignment = None
for itr in range(maxiter):
if verbose:
print(itr, end="")
# 1. Make cluster assignments using nearest centroids
cluster_assignment = assign_clusters(data, centroids)
# 2. Compute a new centroid for each of the k clusters, averaging all data
# points assigned to that cluster.
centroids = revise_centroids(data, k, cluster_assignment)
# Check for convergence: if none of the assignments changed, stop
if (
prev_cluster_assignment is not None
and (prev_cluster_assignment == cluster_assignment).all()
):
break
# Print number of new assignments
if prev_cluster_assignment is not None:
num_changed = np.sum(prev_cluster_assignment != cluster_assignment)
if verbose:
print(
" {:5d} elements changed their cluster assignment.".format(
num_changed
)
)
# Record heterogeneity convergence metric
if record_heterogeneity is not None:
# YOUR CODE HERE
score = compute_heterogeneity(data, k, centroids, cluster_assignment)
record_heterogeneity.append(score)
prev_cluster_assignment = cluster_assignment[:]
return centroids, cluster_assignment
# Mock test below
if False: # change to true to run this test case.
from sklearn import datasets as ds
dataset = ds.load_iris()
k = 3
heterogeneity = []
initial_centroids = get_initial_centroids(dataset["data"], k, seed=0)
centroids, cluster_assignment = kmeans(
dataset["data"],
k,
initial_centroids,
maxiter=400,
record_heterogeneity=heterogeneity,
verbose=True,
)
plot_heterogeneity(heterogeneity, k)
def ReportGenerator(
df: pd.DataFrame, ClusteringVariables: np.array, FillMissingReport=None
) -> pd.DataFrame:
"""
Function generates easy-erading clustering report. It takes 2 arguments as an input:
DataFrame - dataframe with predicted cluester column;
FillMissingReport - dictionary of rules how we are going to fill missing
values of for final report generate (not included in modeling);
in order to run the function following libraries must be imported:
import pandas as pd
import numpy as np
>>> data = pd.DataFrame()
>>> data['numbers'] = [1, 2, 3]
>>> data['col1'] = [0.5, 2.5, 4.5]
>>> data['col2'] = [100, 200, 300]
>>> data['col3'] = [10, 20, 30]
>>> data['Cluster'] = [1, 1, 2]
>>> ReportGenerator(data, ['col1', 'col2'], 0)
Features Type Mark 1 2
0 # of Customers ClusterSize False 2.000000 1.000000
1 % of Customers ClusterProportion False 0.666667 0.333333
2 col1 mean_with_zeros True 1.500000 4.500000
3 col2 mean_with_zeros True 150.000000 300.000000
4 numbers mean_with_zeros False 1.500000 3.000000
.. ... ... ... ... ...
99 dummy 5% False 1.000000 1.000000
100 dummy 95% False 1.000000 1.000000
101 dummy stdev False 0.000000 NaN
102 dummy mode False 1.000000 1.000000
103 dummy median False 1.000000 1.000000
<BLANKLINE>
[104 rows x 5 columns]
"""
# Fill missing values with given rules
if FillMissingReport:
df.fillna(value=FillMissingReport, inplace=True)
df["dummy"] = 1
numeric_cols = df.select_dtypes(np.number).columns
report = (
df.groupby(["Cluster"])[ # construct report dataframe
numeric_cols
] # group by cluster number
.agg(
[
("sum", np.sum),
("mean_with_zeros", lambda x: np.mean(np.nan_to_num(x))),
("mean_without_zeros", lambda x: x.replace(0, np.NaN).mean()),
(
"mean_25-75",
lambda x: np.mean(
np.nan_to_num(
sorted(x)[
round(len(x) * 25 / 100) : round(len(x) * 75 / 100)
]
)
),
),
("mean_with_na", np.mean),
("min", lambda x: x.min()),
("5%", lambda x: x.quantile(0.05)),
("25%", lambda x: x.quantile(0.25)),
("50%", lambda x: x.quantile(0.50)),
("75%", lambda x: x.quantile(0.75)),
("95%", lambda x: x.quantile(0.95)),
("max", lambda x: x.max()),
("count", lambda x: x.count()),
("stdev", lambda x: x.std()),
("mode", lambda x: x.mode()[0]),
("median", lambda x: x.median()),
("# > 0", lambda x: (x > 0).sum()),
]
)
.T.reset_index()
.rename(index=str, columns={"level_0": "Features", "level_1": "Type"})
) # rename columns
# calculate the size of cluster(count of clientID's)
clustersize = report[
(report["Features"] == "dummy") & (report["Type"] == "count")
].copy() # avoid SettingWithCopyWarning
clustersize.Type = (
"ClusterSize" # rename created cluster df to match report column names
)
clustersize.Features = "# of Customers"
clusterproportion = pd.DataFrame(
clustersize.iloc[:, 2:].values
/ clustersize.iloc[:, 2:].values.sum() # calculating the proportion of cluster
)
clusterproportion[
"Type"
] = "% of Customers" # rename created cluster df to match report column names
clusterproportion["Features"] = "ClusterProportion"
cols = clusterproportion.columns.tolist()
cols = cols[-2:] + cols[:-2]
clusterproportion = clusterproportion[cols] # rearrange columns to match report
clusterproportion.columns = report.columns
a = pd.DataFrame(
abs(
report[report["Type"] == "count"].iloc[:, 2:].values
- clustersize.iloc[:, 2:].values
)
) # generating df with count of nan values
a["Features"] = 0
a["Type"] = "# of nan"
a.Features = report[
report["Type"] == "count"
].Features.tolist() # filling values in order to match report
cols = a.columns.tolist()
cols = cols[-2:] + cols[:-2]
a = a[cols] # rearrange columns to match report
a.columns = report.columns # rename columns to match report
report = report.drop(
report[report.Type == "count"].index
) # drop count values except cluster size
report = pd.concat(
[report, a, clustersize, clusterproportion], axis=0
) # concat report with clustert size and nan values
report["Mark"] = report["Features"].isin(ClusteringVariables)
cols = report.columns.tolist()
cols = cols[0:2] + cols[-1:] + cols[2:-1]
report = report[cols]
sorter1 = {
"ClusterSize": 9,
"ClusterProportion": 8,
"mean_with_zeros": 7,
"mean_with_na": 6,
"max": 5,
"50%": 4,
"min": 3,
"25%": 2,
"75%": 1,
"# of nan": 0,
"# > 0": -1,
"sum_with_na": -2,
}
report = (
report.assign(
Sorter1=lambda x: x.Type.map(sorter1),
Sorter2=lambda x: list(reversed(range(len(x)))),
)
.sort_values(["Sorter1", "Mark", "Sorter2"], ascending=False)
.drop(["Sorter1", "Sorter2"], axis=1)
)
report.columns.name = ""
report = report.reset_index()
report.drop(columns=["index"], inplace=True)
return report
if __name__ == "__main__":
import doctest
doctest.testmod()
| """README, Author - Anurag Kumar(mailto:[email protected])
Requirements:
- sklearn
- numpy
- matplotlib
Python:
- 3.5
Inputs:
- X , a 2D numpy array of features.
- k , number of clusters to create.
- initial_centroids , initial centroid values generated by utility function(mentioned
in usage).
- maxiter , maximum number of iterations to process.
- heterogeneity , empty list that will be filled with hetrogeneity values if passed
to kmeans func.
Usage:
1. define 'k' value, 'X' features array and 'hetrogeneity' empty list
2. create initial_centroids,
initial_centroids = get_initial_centroids(
X,
k,
seed=0 # seed value for initial centroid generation,
# None for randomness(default=None)
)
3. find centroids and clusters using kmeans function.
centroids, cluster_assignment = kmeans(
X,
k,
initial_centroids,
maxiter=400,
record_heterogeneity=heterogeneity,
verbose=True # whether to print logs in console or not.(default=False)
)
4. Plot the loss function, hetrogeneity values for every iteration saved in
hetrogeneity list.
plot_heterogeneity(
heterogeneity,
k
)
5. Transfers Dataframe into excel format it must have feature called
'Clust' with k means clustering numbers in it.
"""
import warnings
import numpy as np
import pandas as pd
from matplotlib import pyplot as plt
from sklearn.metrics import pairwise_distances
warnings.filterwarnings("ignore")
TAG = "K-MEANS-CLUST/ "
def get_initial_centroids(data, k, seed=None):
"""Randomly choose k data points as initial centroids"""
if seed is not None: # useful for obtaining consistent results
np.random.seed(seed)
n = data.shape[0] # number of data points
# Pick K indices from range [0, N).
rand_indices = np.random.randint(0, n, k)
# Keep centroids as dense format, as many entries will be nonzero due to averaging.
# As long as at least one document in a cluster contains a word,
# it will carry a nonzero weight in the TF-IDF vector of the centroid.
centroids = data[rand_indices, :]
return centroids
def centroid_pairwise_dist(X, centroids):
return pairwise_distances(X, centroids, metric="euclidean")
def assign_clusters(data, centroids):
# Compute distances between each data point and the set of centroids:
# Fill in the blank (RHS only)
distances_from_centroids = centroid_pairwise_dist(data, centroids)
# Compute cluster assignments for each data point:
# Fill in the blank (RHS only)
cluster_assignment = np.argmin(distances_from_centroids, axis=1)
return cluster_assignment
def revise_centroids(data, k, cluster_assignment):
new_centroids = []
for i in range(k):
# Select all data points that belong to cluster i. Fill in the blank (RHS only)
member_data_points = data[cluster_assignment == i]
# Compute the mean of the data points. Fill in the blank (RHS only)
centroid = member_data_points.mean(axis=0)
new_centroids.append(centroid)
new_centroids = np.array(new_centroids)
return new_centroids
def compute_heterogeneity(data, k, centroids, cluster_assignment):
heterogeneity = 0.0
for i in range(k):
# Select all data points that belong to cluster i. Fill in the blank (RHS only)
member_data_points = data[cluster_assignment == i, :]
if member_data_points.shape[0] > 0: # check if i-th cluster is non-empty
# Compute distances from centroid to data points (RHS only)
distances = pairwise_distances(
member_data_points, [centroids[i]], metric="euclidean"
)
squared_distances = distances ** 2
heterogeneity += np.sum(squared_distances)
return heterogeneity
def plot_heterogeneity(heterogeneity, k):
plt.figure(figsize=(7, 4))
plt.plot(heterogeneity, linewidth=4)
plt.xlabel("# Iterations")
plt.ylabel("Heterogeneity")
plt.title(f"Heterogeneity of clustering over time, K={k:d}")
plt.rcParams.update({"font.size": 16})
plt.show()
def kmeans(
data, k, initial_centroids, maxiter=500, record_heterogeneity=None, verbose=False
):
"""This function runs k-means on given data and initial set of centroids.
maxiter: maximum number of iterations to run.(default=500)
record_heterogeneity: (optional) a list, to store the history of heterogeneity
as function of iterations
if None, do not store the history.
verbose: if True, print how many data points changed their cluster labels in
each iteration"""
centroids = initial_centroids[:]
prev_cluster_assignment = None
for itr in range(maxiter):
if verbose:
print(itr, end="")
# 1. Make cluster assignments using nearest centroids
cluster_assignment = assign_clusters(data, centroids)
# 2. Compute a new centroid for each of the k clusters, averaging all data
# points assigned to that cluster.
centroids = revise_centroids(data, k, cluster_assignment)
# Check for convergence: if none of the assignments changed, stop
if (
prev_cluster_assignment is not None
and (prev_cluster_assignment == cluster_assignment).all()
):
break
# Print number of new assignments
if prev_cluster_assignment is not None:
num_changed = np.sum(prev_cluster_assignment != cluster_assignment)
if verbose:
print(
" {:5d} elements changed their cluster assignment.".format(
num_changed
)
)
# Record heterogeneity convergence metric
if record_heterogeneity is not None:
# YOUR CODE HERE
score = compute_heterogeneity(data, k, centroids, cluster_assignment)
record_heterogeneity.append(score)
prev_cluster_assignment = cluster_assignment[:]
return centroids, cluster_assignment
# Mock test below
if False: # change to true to run this test case.
from sklearn import datasets as ds
dataset = ds.load_iris()
k = 3
heterogeneity = []
initial_centroids = get_initial_centroids(dataset["data"], k, seed=0)
centroids, cluster_assignment = kmeans(
dataset["data"],
k,
initial_centroids,
maxiter=400,
record_heterogeneity=heterogeneity,
verbose=True,
)
plot_heterogeneity(heterogeneity, k)
def ReportGenerator(
df: pd.DataFrame, ClusteringVariables: np.array, FillMissingReport=None
) -> pd.DataFrame:
"""
Function generates easy-erading clustering report. It takes 2 arguments as an input:
DataFrame - dataframe with predicted cluester column;
FillMissingReport - dictionary of rules how we are going to fill missing
values of for final report generate (not included in modeling);
in order to run the function following libraries must be imported:
import pandas as pd
import numpy as np
>>> data = pd.DataFrame()
>>> data['numbers'] = [1, 2, 3]
>>> data['col1'] = [0.5, 2.5, 4.5]
>>> data['col2'] = [100, 200, 300]
>>> data['col3'] = [10, 20, 30]
>>> data['Cluster'] = [1, 1, 2]
>>> ReportGenerator(data, ['col1', 'col2'], 0)
Features Type Mark 1 2
0 # of Customers ClusterSize False 2.000000 1.000000
1 % of Customers ClusterProportion False 0.666667 0.333333
2 col1 mean_with_zeros True 1.500000 4.500000
3 col2 mean_with_zeros True 150.000000 300.000000
4 numbers mean_with_zeros False 1.500000 3.000000
.. ... ... ... ... ...
99 dummy 5% False 1.000000 1.000000
100 dummy 95% False 1.000000 1.000000
101 dummy stdev False 0.000000 NaN
102 dummy mode False 1.000000 1.000000
103 dummy median False 1.000000 1.000000
<BLANKLINE>
[104 rows x 5 columns]
"""
# Fill missing values with given rules
if FillMissingReport:
df.fillna(value=FillMissingReport, inplace=True)
df["dummy"] = 1
numeric_cols = df.select_dtypes(np.number).columns
report = (
df.groupby(["Cluster"])[ # construct report dataframe
numeric_cols
] # group by cluster number
.agg(
[
("sum", np.sum),
("mean_with_zeros", lambda x: np.mean(np.nan_to_num(x))),
("mean_without_zeros", lambda x: x.replace(0, np.NaN).mean()),
(
"mean_25-75",
lambda x: np.mean(
np.nan_to_num(
sorted(x)[
round(len(x) * 25 / 100) : round(len(x) * 75 / 100)
]
)
),
),
("mean_with_na", np.mean),
("min", lambda x: x.min()),
("5%", lambda x: x.quantile(0.05)),
("25%", lambda x: x.quantile(0.25)),
("50%", lambda x: x.quantile(0.50)),
("75%", lambda x: x.quantile(0.75)),
("95%", lambda x: x.quantile(0.95)),
("max", lambda x: x.max()),
("count", lambda x: x.count()),
("stdev", lambda x: x.std()),
("mode", lambda x: x.mode()[0]),
("median", lambda x: x.median()),
("# > 0", lambda x: (x > 0).sum()),
]
)
.T.reset_index()
.rename(index=str, columns={"level_0": "Features", "level_1": "Type"})
) # rename columns
# calculate the size of cluster(count of clientID's)
clustersize = report[
(report["Features"] == "dummy") & (report["Type"] == "count")
].copy() # avoid SettingWithCopyWarning
clustersize.Type = (
"ClusterSize" # rename created cluster df to match report column names
)
clustersize.Features = "# of Customers"
clusterproportion = pd.DataFrame(
clustersize.iloc[:, 2:].values
/ clustersize.iloc[:, 2:].values.sum() # calculating the proportion of cluster
)
clusterproportion[
"Type"
] = "% of Customers" # rename created cluster df to match report column names
clusterproportion["Features"] = "ClusterProportion"
cols = clusterproportion.columns.tolist()
cols = cols[-2:] + cols[:-2]
clusterproportion = clusterproportion[cols] # rearrange columns to match report
clusterproportion.columns = report.columns
a = pd.DataFrame(
abs(
report[report["Type"] == "count"].iloc[:, 2:].values
- clustersize.iloc[:, 2:].values
)
) # generating df with count of nan values
a["Features"] = 0
a["Type"] = "# of nan"
a.Features = report[
report["Type"] == "count"
].Features.tolist() # filling values in order to match report
cols = a.columns.tolist()
cols = cols[-2:] + cols[:-2]
a = a[cols] # rearrange columns to match report
a.columns = report.columns # rename columns to match report
report = report.drop(
report[report.Type == "count"].index
) # drop count values except cluster size
report = pd.concat(
[report, a, clustersize, clusterproportion], axis=0
) # concat report with clustert size and nan values
report["Mark"] = report["Features"].isin(ClusteringVariables)
cols = report.columns.tolist()
cols = cols[0:2] + cols[-1:] + cols[2:-1]
report = report[cols]
sorter1 = {
"ClusterSize": 9,
"ClusterProportion": 8,
"mean_with_zeros": 7,
"mean_with_na": 6,
"max": 5,
"50%": 4,
"min": 3,
"25%": 2,
"75%": 1,
"# of nan": 0,
"# > 0": -1,
"sum_with_na": -2,
}
report = (
report.assign(
Sorter1=lambda x: x.Type.map(sorter1),
Sorter2=lambda x: list(reversed(range(len(x)))),
)
.sort_values(["Sorter1", "Mark", "Sorter2"], ascending=False)
.drop(["Sorter1", "Sorter2"], axis=1)
)
report.columns.name = ""
report = report.reset_index()
report.drop(columns=["index"], inplace=True)
return report
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| #!/usr/bin/env python3
from .hash_table import HashTable
class QuadraticProbing(HashTable):
"""
Basic Hash Table example with open addressing using Quadratic Probing
"""
def __init__(self, *args, **kwargs):
super().__init__(*args, **kwargs)
def _collision_resolution(self, key, data=None):
i = 1
new_key = self.hash_function(key + i * i)
while self.values[new_key] is not None and self.values[new_key] != key:
i += 1
new_key = (
self.hash_function(key + i * i)
if not self.balanced_factor() >= self.lim_charge
else None
)
if new_key is None:
break
return new_key
| #!/usr/bin/env python3
from .hash_table import HashTable
class QuadraticProbing(HashTable):
"""
Basic Hash Table example with open addressing using Quadratic Probing
"""
def __init__(self, *args, **kwargs):
super().__init__(*args, **kwargs)
def _collision_resolution(self, key, data=None):
i = 1
new_key = self.hash_function(key + i * i)
while self.values[new_key] is not None and self.values[new_key] != key:
i += 1
new_key = (
self.hash_function(key + i * i)
if not self.balanced_factor() >= self.lim_charge
else None
)
if new_key is None:
break
return new_key
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
A non-recursive Segment Tree implementation with range query and single element update,
works virtually with any list of the same type of elements with a "commutative"
combiner.
Explanation:
https://www.geeksforgeeks.org/iterative-segment-tree-range-minimum-query/
https://www.geeksforgeeks.org/segment-tree-efficient-implementation/
>>> SegmentTree([1, 2, 3], lambda a, b: a + b).query(0, 2)
6
>>> SegmentTree([3, 1, 2], min).query(0, 2)
1
>>> SegmentTree([2, 3, 1], max).query(0, 2)
3
>>> st = SegmentTree([1, 5, 7, -1, 6], lambda a, b: a + b)
>>> st.update(1, -1)
>>> st.update(2, 3)
>>> st.query(1, 2)
2
>>> st.query(1, 1)
-1
>>> st.update(4, 1)
>>> st.query(3, 4)
0
>>> st = SegmentTree([[1, 2, 3], [3, 2, 1], [1, 1, 1]], lambda a, b: [a[i] + b[i] for i
... in range(len(a))])
>>> st.query(0, 1)
[4, 4, 4]
>>> st.query(1, 2)
[4, 3, 2]
>>> st.update(1, [-1, -1, -1])
>>> st.query(1, 2)
[0, 0, 0]
>>> st.query(0, 2)
[1, 2, 3]
"""
from __future__ import annotations
from typing import Callable, TypeVar
T = TypeVar("T")
class SegmentTree:
def __init__(self, arr: list[T], fnc: Callable[[T, T], T]) -> None:
"""
Segment Tree constructor, it works just with commutative combiner.
:param arr: list of elements for the segment tree
:param fnc: commutative function for combine two elements
>>> SegmentTree(['a', 'b', 'c'], lambda a, b: f'{a}{b}').query(0, 2)
'abc'
>>> SegmentTree([(1, 2), (2, 3), (3, 4)],
... lambda a, b: (a[0] + b[0], a[1] + b[1])).query(0, 2)
(6, 9)
"""
self.N = len(arr)
self.st = [None for _ in range(len(arr))] + arr
self.fn = fnc
self.build()
def build(self) -> None:
for p in range(self.N - 1, 0, -1):
self.st[p] = self.fn(self.st[p * 2], self.st[p * 2 + 1])
def update(self, p: int, v: T) -> None:
"""
Update an element in log(N) time
:param p: position to be update
:param v: new value
>>> st = SegmentTree([3, 1, 2, 4], min)
>>> st.query(0, 3)
1
>>> st.update(2, -1)
>>> st.query(0, 3)
-1
"""
p += self.N
self.st[p] = v
while p > 1:
p = p // 2
self.st[p] = self.fn(self.st[p * 2], self.st[p * 2 + 1])
def query(self, l: int, r: int) -> T: # noqa: E741
"""
Get range query value in log(N) time
:param l: left element index
:param r: right element index
:return: element combined in the range [l, r]
>>> st = SegmentTree([1, 2, 3, 4], lambda a, b: a + b)
>>> st.query(0, 2)
6
>>> st.query(1, 2)
5
>>> st.query(0, 3)
10
>>> st.query(2, 3)
7
"""
l, r = l + self.N, r + self.N # noqa: E741
res = None
while l <= r: # noqa: E741
if l % 2 == 1:
res = self.st[l] if res is None else self.fn(res, self.st[l])
if r % 2 == 0:
res = self.st[r] if res is None else self.fn(res, self.st[r])
l, r = (l + 1) // 2, (r - 1) // 2
return res
if __name__ == "__main__":
from functools import reduce
test_array = [1, 10, -2, 9, -3, 8, 4, -7, 5, 6, 11, -12]
test_updates = {
0: 7,
1: 2,
2: 6,
3: -14,
4: 5,
5: 4,
6: 7,
7: -10,
8: 9,
9: 10,
10: 12,
11: 1,
}
min_segment_tree = SegmentTree(test_array, min)
max_segment_tree = SegmentTree(test_array, max)
sum_segment_tree = SegmentTree(test_array, lambda a, b: a + b)
def test_all_segments():
"""
Test all possible segments
"""
for i in range(len(test_array)):
for j in range(i, len(test_array)):
min_range = reduce(min, test_array[i : j + 1])
max_range = reduce(max, test_array[i : j + 1])
sum_range = reduce(lambda a, b: a + b, test_array[i : j + 1])
assert min_range == min_segment_tree.query(i, j)
assert max_range == max_segment_tree.query(i, j)
assert sum_range == sum_segment_tree.query(i, j)
test_all_segments()
for index, value in test_updates.items():
test_array[index] = value
min_segment_tree.update(index, value)
max_segment_tree.update(index, value)
sum_segment_tree.update(index, value)
test_all_segments()
| """
A non-recursive Segment Tree implementation with range query and single element update,
works virtually with any list of the same type of elements with a "commutative"
combiner.
Explanation:
https://www.geeksforgeeks.org/iterative-segment-tree-range-minimum-query/
https://www.geeksforgeeks.org/segment-tree-efficient-implementation/
>>> SegmentTree([1, 2, 3], lambda a, b: a + b).query(0, 2)
6
>>> SegmentTree([3, 1, 2], min).query(0, 2)
1
>>> SegmentTree([2, 3, 1], max).query(0, 2)
3
>>> st = SegmentTree([1, 5, 7, -1, 6], lambda a, b: a + b)
>>> st.update(1, -1)
>>> st.update(2, 3)
>>> st.query(1, 2)
2
>>> st.query(1, 1)
-1
>>> st.update(4, 1)
>>> st.query(3, 4)
0
>>> st = SegmentTree([[1, 2, 3], [3, 2, 1], [1, 1, 1]], lambda a, b: [a[i] + b[i] for i
... in range(len(a))])
>>> st.query(0, 1)
[4, 4, 4]
>>> st.query(1, 2)
[4, 3, 2]
>>> st.update(1, [-1, -1, -1])
>>> st.query(1, 2)
[0, 0, 0]
>>> st.query(0, 2)
[1, 2, 3]
"""
from __future__ import annotations
from typing import Callable, TypeVar
T = TypeVar("T")
class SegmentTree:
def __init__(self, arr: list[T], fnc: Callable[[T, T], T]) -> None:
"""
Segment Tree constructor, it works just with commutative combiner.
:param arr: list of elements for the segment tree
:param fnc: commutative function for combine two elements
>>> SegmentTree(['a', 'b', 'c'], lambda a, b: f'{a}{b}').query(0, 2)
'abc'
>>> SegmentTree([(1, 2), (2, 3), (3, 4)],
... lambda a, b: (a[0] + b[0], a[1] + b[1])).query(0, 2)
(6, 9)
"""
self.N = len(arr)
self.st = [None for _ in range(len(arr))] + arr
self.fn = fnc
self.build()
def build(self) -> None:
for p in range(self.N - 1, 0, -1):
self.st[p] = self.fn(self.st[p * 2], self.st[p * 2 + 1])
def update(self, p: int, v: T) -> None:
"""
Update an element in log(N) time
:param p: position to be update
:param v: new value
>>> st = SegmentTree([3, 1, 2, 4], min)
>>> st.query(0, 3)
1
>>> st.update(2, -1)
>>> st.query(0, 3)
-1
"""
p += self.N
self.st[p] = v
while p > 1:
p = p // 2
self.st[p] = self.fn(self.st[p * 2], self.st[p * 2 + 1])
def query(self, l: int, r: int) -> T: # noqa: E741
"""
Get range query value in log(N) time
:param l: left element index
:param r: right element index
:return: element combined in the range [l, r]
>>> st = SegmentTree([1, 2, 3, 4], lambda a, b: a + b)
>>> st.query(0, 2)
6
>>> st.query(1, 2)
5
>>> st.query(0, 3)
10
>>> st.query(2, 3)
7
"""
l, r = l + self.N, r + self.N # noqa: E741
res = None
while l <= r: # noqa: E741
if l % 2 == 1:
res = self.st[l] if res is None else self.fn(res, self.st[l])
if r % 2 == 0:
res = self.st[r] if res is None else self.fn(res, self.st[r])
l, r = (l + 1) // 2, (r - 1) // 2
return res
if __name__ == "__main__":
from functools import reduce
test_array = [1, 10, -2, 9, -3, 8, 4, -7, 5, 6, 11, -12]
test_updates = {
0: 7,
1: 2,
2: 6,
3: -14,
4: 5,
5: 4,
6: 7,
7: -10,
8: 9,
9: 10,
10: 12,
11: 1,
}
min_segment_tree = SegmentTree(test_array, min)
max_segment_tree = SegmentTree(test_array, max)
sum_segment_tree = SegmentTree(test_array, lambda a, b: a + b)
def test_all_segments():
"""
Test all possible segments
"""
for i in range(len(test_array)):
for j in range(i, len(test_array)):
min_range = reduce(min, test_array[i : j + 1])
max_range = reduce(max, test_array[i : j + 1])
sum_range = reduce(lambda a, b: a + b, test_array[i : j + 1])
assert min_range == min_segment_tree.query(i, j)
assert max_range == max_segment_tree.query(i, j)
assert sum_range == sum_segment_tree.query(i, j)
test_all_segments()
for index, value in test_updates.items():
test_array[index] = value
min_segment_tree.update(index, value)
max_segment_tree.update(index, value)
sum_segment_tree.update(index, value)
test_all_segments()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| # flake8: noqa
"""
Binomial Heap
Reference: Advanced Data Structures, Peter Brass
"""
class Node:
"""
Node in a doubly-linked binomial tree, containing:
- value
- size of left subtree
- link to left, right and parent nodes
"""
def __init__(self, val):
self.val = val
# Number of nodes in left subtree
self.left_tree_size = 0
self.left = None
self.right = None
self.parent = None
def mergeTrees(self, other):
"""
In-place merge of two binomial trees of equal size.
Returns the root of the resulting tree
"""
assert self.left_tree_size == other.left_tree_size, "Unequal Sizes of Blocks"
if self.val < other.val:
other.left = self.right
other.parent = None
if self.right:
self.right.parent = other
self.right = other
self.left_tree_size = self.left_tree_size * 2 + 1
return self
else:
self.left = other.right
self.parent = None
if other.right:
other.right.parent = self
other.right = self
other.left_tree_size = other.left_tree_size * 2 + 1
return other
class BinomialHeap:
r"""
Min-oriented priority queue implemented with the Binomial Heap data
structure implemented with the BinomialHeap class. It supports:
- Insert element in a heap with n elements: Guaranteed logn, amoratized 1
- Merge (meld) heaps of size m and n: O(logn + logm)
- Delete Min: O(logn)
- Peek (return min without deleting it): O(1)
Example:
Create a random permutation of 30 integers to be inserted and 19 of them deleted
>>> import numpy as np
>>> permutation = np.random.permutation(list(range(30)))
Create a Heap and insert the 30 integers
__init__() test
>>> first_heap = BinomialHeap()
30 inserts - insert() test
>>> for number in permutation:
... first_heap.insert(number)
Size test
>>> print(first_heap.size)
30
Deleting - delete() test
>>> for i in range(25):
... print(first_heap.deleteMin(), end=" ")
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
Create a new Heap
>>> second_heap = BinomialHeap()
>>> vals = [17, 20, 31, 34]
>>> for value in vals:
... second_heap.insert(value)
The heap should have the following structure:
17
/ \
# 31
/ \
20 34
/ \ / \
# # # #
preOrder() test
>>> print(second_heap.preOrder())
[(17, 0), ('#', 1), (31, 1), (20, 2), ('#', 3), ('#', 3), (34, 2), ('#', 3), ('#', 3)]
printing Heap - __str__() test
>>> print(second_heap)
17
-#
-31
--20
---#
---#
--34
---#
---#
mergeHeaps() test
>>> merged = second_heap.mergeHeaps(first_heap)
>>> merged.peek()
17
values in merged heap; (merge is inplace)
>>> while not first_heap.isEmpty():
... print(first_heap.deleteMin(), end=" ")
17 20 25 26 27 28 29 31 34
"""
def __init__(self, bottom_root=None, min_node=None, heap_size=0):
self.size = heap_size
self.bottom_root = bottom_root
self.min_node = min_node
def mergeHeaps(self, other):
"""
In-place merge of two binomial heaps.
Both of them become the resulting merged heap
"""
# Empty heaps corner cases
if other.size == 0:
return
if self.size == 0:
self.size = other.size
self.bottom_root = other.bottom_root
self.min_node = other.min_node
return
# Update size
self.size = self.size + other.size
# Update min.node
if self.min_node.val > other.min_node.val:
self.min_node = other.min_node
# Merge
# Order roots by left_subtree_size
combined_roots_list = []
i, j = self.bottom_root, other.bottom_root
while i or j:
if i and ((not j) or i.left_tree_size < j.left_tree_size):
combined_roots_list.append((i, True))
i = i.parent
else:
combined_roots_list.append((j, False))
j = j.parent
# Insert links between them
for i in range(len(combined_roots_list) - 1):
if combined_roots_list[i][1] != combined_roots_list[i + 1][1]:
combined_roots_list[i][0].parent = combined_roots_list[i + 1][0]
combined_roots_list[i + 1][0].left = combined_roots_list[i][0]
# Consecutively merge roots with same left_tree_size
i = combined_roots_list[0][0]
while i.parent:
if (
(i.left_tree_size == i.parent.left_tree_size) and (not i.parent.parent)
) or (
i.left_tree_size == i.parent.left_tree_size
and i.left_tree_size != i.parent.parent.left_tree_size
):
# Neighbouring Nodes
previous_node = i.left
next_node = i.parent.parent
# Merging trees
i = i.mergeTrees(i.parent)
# Updating links
i.left = previous_node
i.parent = next_node
if previous_node:
previous_node.parent = i
if next_node:
next_node.left = i
else:
i = i.parent
# Updating self.bottom_root
while i.left:
i = i.left
self.bottom_root = i
# Update other
other.size = self.size
other.bottom_root = self.bottom_root
other.min_node = self.min_node
# Return the merged heap
return self
def insert(self, val):
"""
insert a value in the heap
"""
if self.size == 0:
self.bottom_root = Node(val)
self.size = 1
self.min_node = self.bottom_root
else:
# Create new node
new_node = Node(val)
# Update size
self.size += 1
# update min_node
if val < self.min_node.val:
self.min_node = new_node
# Put new_node as a bottom_root in heap
self.bottom_root.left = new_node
new_node.parent = self.bottom_root
self.bottom_root = new_node
# Consecutively merge roots with same left_tree_size
while (
self.bottom_root.parent
and self.bottom_root.left_tree_size
== self.bottom_root.parent.left_tree_size
):
# Next node
next_node = self.bottom_root.parent.parent
# Merge
self.bottom_root = self.bottom_root.mergeTrees(self.bottom_root.parent)
# Update Links
self.bottom_root.parent = next_node
self.bottom_root.left = None
if next_node:
next_node.left = self.bottom_root
def peek(self):
"""
return min element without deleting it
"""
return self.min_node.val
def isEmpty(self):
return self.size == 0
def deleteMin(self):
"""
delete min element and return it
"""
# assert not self.isEmpty(), "Empty Heap"
# Save minimal value
min_value = self.min_node.val
# Last element in heap corner case
if self.size == 1:
# Update size
self.size = 0
# Update bottom root
self.bottom_root = None
# Update min_node
self.min_node = None
return min_value
# No right subtree corner case
# The structure of the tree implies that this should be the bottom root
# and there is at least one other root
if self.min_node.right is None:
# Update size
self.size -= 1
# Update bottom root
self.bottom_root = self.bottom_root.parent
self.bottom_root.left = None
# Update min_node
self.min_node = self.bottom_root
i = self.bottom_root.parent
while i:
if i.val < self.min_node.val:
self.min_node = i
i = i.parent
return min_value
# General case
# Find the BinomialHeap of the right subtree of min_node
bottom_of_new = self.min_node.right
bottom_of_new.parent = None
min_of_new = bottom_of_new
size_of_new = 1
# Size, min_node and bottom_root
while bottom_of_new.left:
size_of_new = size_of_new * 2 + 1
bottom_of_new = bottom_of_new.left
if bottom_of_new.val < min_of_new.val:
min_of_new = bottom_of_new
# Corner case of single root on top left path
if (not self.min_node.left) and (not self.min_node.parent):
self.size = size_of_new
self.bottom_root = bottom_of_new
self.min_node = min_of_new
# print("Single root, multiple nodes case")
return min_value
# Remaining cases
# Construct heap of right subtree
newHeap = BinomialHeap(
bottom_root=bottom_of_new, min_node=min_of_new, heap_size=size_of_new
)
# Update size
self.size = self.size - 1 - size_of_new
# Neighbour nodes
previous_node = self.min_node.left
next_node = self.min_node.parent
# Initialize new bottom_root and min_node
self.min_node = previous_node or next_node
self.bottom_root = next_node
# Update links of previous_node and search below for new min_node and
# bottom_root
if previous_node:
previous_node.parent = next_node
# Update bottom_root and search for min_node below
self.bottom_root = previous_node
self.min_node = previous_node
while self.bottom_root.left:
self.bottom_root = self.bottom_root.left
if self.bottom_root.val < self.min_node.val:
self.min_node = self.bottom_root
if next_node:
next_node.left = previous_node
# Search for new min_node above min_node
i = next_node
while i:
if i.val < self.min_node.val:
self.min_node = i
i = i.parent
# Merge heaps
self.mergeHeaps(newHeap)
return min_value
def preOrder(self):
"""
Returns the Pre-order representation of the heap including
values of nodes plus their level distance from the root;
Empty nodes appear as #
"""
# Find top root
top_root = self.bottom_root
while top_root.parent:
top_root = top_root.parent
# preorder
heap_preOrder = []
self.__traversal(top_root, heap_preOrder)
return heap_preOrder
def __traversal(self, curr_node, preorder, level=0):
"""
Pre-order traversal of nodes
"""
if curr_node:
preorder.append((curr_node.val, level))
self.__traversal(curr_node.left, preorder, level + 1)
self.__traversal(curr_node.right, preorder, level + 1)
else:
preorder.append(("#", level))
def __str__(self):
"""
Overwriting str for a pre-order print of nodes in heap;
Performance is poor, so use only for small examples
"""
if self.isEmpty():
return ""
preorder_heap = self.preOrder()
return "\n".join(("-" * level + str(value)) for value, level in preorder_heap)
# Unit Tests
if __name__ == "__main__":
import doctest
doctest.testmod()
| # flake8: noqa
"""
Binomial Heap
Reference: Advanced Data Structures, Peter Brass
"""
class Node:
"""
Node in a doubly-linked binomial tree, containing:
- value
- size of left subtree
- link to left, right and parent nodes
"""
def __init__(self, val):
self.val = val
# Number of nodes in left subtree
self.left_tree_size = 0
self.left = None
self.right = None
self.parent = None
def mergeTrees(self, other):
"""
In-place merge of two binomial trees of equal size.
Returns the root of the resulting tree
"""
assert self.left_tree_size == other.left_tree_size, "Unequal Sizes of Blocks"
if self.val < other.val:
other.left = self.right
other.parent = None
if self.right:
self.right.parent = other
self.right = other
self.left_tree_size = self.left_tree_size * 2 + 1
return self
else:
self.left = other.right
self.parent = None
if other.right:
other.right.parent = self
other.right = self
other.left_tree_size = other.left_tree_size * 2 + 1
return other
class BinomialHeap:
r"""
Min-oriented priority queue implemented with the Binomial Heap data
structure implemented with the BinomialHeap class. It supports:
- Insert element in a heap with n elements: Guaranteed logn, amoratized 1
- Merge (meld) heaps of size m and n: O(logn + logm)
- Delete Min: O(logn)
- Peek (return min without deleting it): O(1)
Example:
Create a random permutation of 30 integers to be inserted and 19 of them deleted
>>> import numpy as np
>>> permutation = np.random.permutation(list(range(30)))
Create a Heap and insert the 30 integers
__init__() test
>>> first_heap = BinomialHeap()
30 inserts - insert() test
>>> for number in permutation:
... first_heap.insert(number)
Size test
>>> print(first_heap.size)
30
Deleting - delete() test
>>> for i in range(25):
... print(first_heap.deleteMin(), end=" ")
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
Create a new Heap
>>> second_heap = BinomialHeap()
>>> vals = [17, 20, 31, 34]
>>> for value in vals:
... second_heap.insert(value)
The heap should have the following structure:
17
/ \
# 31
/ \
20 34
/ \ / \
# # # #
preOrder() test
>>> print(second_heap.preOrder())
[(17, 0), ('#', 1), (31, 1), (20, 2), ('#', 3), ('#', 3), (34, 2), ('#', 3), ('#', 3)]
printing Heap - __str__() test
>>> print(second_heap)
17
-#
-31
--20
---#
---#
--34
---#
---#
mergeHeaps() test
>>> merged = second_heap.mergeHeaps(first_heap)
>>> merged.peek()
17
values in merged heap; (merge is inplace)
>>> while not first_heap.isEmpty():
... print(first_heap.deleteMin(), end=" ")
17 20 25 26 27 28 29 31 34
"""
def __init__(self, bottom_root=None, min_node=None, heap_size=0):
self.size = heap_size
self.bottom_root = bottom_root
self.min_node = min_node
def mergeHeaps(self, other):
"""
In-place merge of two binomial heaps.
Both of them become the resulting merged heap
"""
# Empty heaps corner cases
if other.size == 0:
return
if self.size == 0:
self.size = other.size
self.bottom_root = other.bottom_root
self.min_node = other.min_node
return
# Update size
self.size = self.size + other.size
# Update min.node
if self.min_node.val > other.min_node.val:
self.min_node = other.min_node
# Merge
# Order roots by left_subtree_size
combined_roots_list = []
i, j = self.bottom_root, other.bottom_root
while i or j:
if i and ((not j) or i.left_tree_size < j.left_tree_size):
combined_roots_list.append((i, True))
i = i.parent
else:
combined_roots_list.append((j, False))
j = j.parent
# Insert links between them
for i in range(len(combined_roots_list) - 1):
if combined_roots_list[i][1] != combined_roots_list[i + 1][1]:
combined_roots_list[i][0].parent = combined_roots_list[i + 1][0]
combined_roots_list[i + 1][0].left = combined_roots_list[i][0]
# Consecutively merge roots with same left_tree_size
i = combined_roots_list[0][0]
while i.parent:
if (
(i.left_tree_size == i.parent.left_tree_size) and (not i.parent.parent)
) or (
i.left_tree_size == i.parent.left_tree_size
and i.left_tree_size != i.parent.parent.left_tree_size
):
# Neighbouring Nodes
previous_node = i.left
next_node = i.parent.parent
# Merging trees
i = i.mergeTrees(i.parent)
# Updating links
i.left = previous_node
i.parent = next_node
if previous_node:
previous_node.parent = i
if next_node:
next_node.left = i
else:
i = i.parent
# Updating self.bottom_root
while i.left:
i = i.left
self.bottom_root = i
# Update other
other.size = self.size
other.bottom_root = self.bottom_root
other.min_node = self.min_node
# Return the merged heap
return self
def insert(self, val):
"""
insert a value in the heap
"""
if self.size == 0:
self.bottom_root = Node(val)
self.size = 1
self.min_node = self.bottom_root
else:
# Create new node
new_node = Node(val)
# Update size
self.size += 1
# update min_node
if val < self.min_node.val:
self.min_node = new_node
# Put new_node as a bottom_root in heap
self.bottom_root.left = new_node
new_node.parent = self.bottom_root
self.bottom_root = new_node
# Consecutively merge roots with same left_tree_size
while (
self.bottom_root.parent
and self.bottom_root.left_tree_size
== self.bottom_root.parent.left_tree_size
):
# Next node
next_node = self.bottom_root.parent.parent
# Merge
self.bottom_root = self.bottom_root.mergeTrees(self.bottom_root.parent)
# Update Links
self.bottom_root.parent = next_node
self.bottom_root.left = None
if next_node:
next_node.left = self.bottom_root
def peek(self):
"""
return min element without deleting it
"""
return self.min_node.val
def isEmpty(self):
return self.size == 0
def deleteMin(self):
"""
delete min element and return it
"""
# assert not self.isEmpty(), "Empty Heap"
# Save minimal value
min_value = self.min_node.val
# Last element in heap corner case
if self.size == 1:
# Update size
self.size = 0
# Update bottom root
self.bottom_root = None
# Update min_node
self.min_node = None
return min_value
# No right subtree corner case
# The structure of the tree implies that this should be the bottom root
# and there is at least one other root
if self.min_node.right is None:
# Update size
self.size -= 1
# Update bottom root
self.bottom_root = self.bottom_root.parent
self.bottom_root.left = None
# Update min_node
self.min_node = self.bottom_root
i = self.bottom_root.parent
while i:
if i.val < self.min_node.val:
self.min_node = i
i = i.parent
return min_value
# General case
# Find the BinomialHeap of the right subtree of min_node
bottom_of_new = self.min_node.right
bottom_of_new.parent = None
min_of_new = bottom_of_new
size_of_new = 1
# Size, min_node and bottom_root
while bottom_of_new.left:
size_of_new = size_of_new * 2 + 1
bottom_of_new = bottom_of_new.left
if bottom_of_new.val < min_of_new.val:
min_of_new = bottom_of_new
# Corner case of single root on top left path
if (not self.min_node.left) and (not self.min_node.parent):
self.size = size_of_new
self.bottom_root = bottom_of_new
self.min_node = min_of_new
# print("Single root, multiple nodes case")
return min_value
# Remaining cases
# Construct heap of right subtree
newHeap = BinomialHeap(
bottom_root=bottom_of_new, min_node=min_of_new, heap_size=size_of_new
)
# Update size
self.size = self.size - 1 - size_of_new
# Neighbour nodes
previous_node = self.min_node.left
next_node = self.min_node.parent
# Initialize new bottom_root and min_node
self.min_node = previous_node or next_node
self.bottom_root = next_node
# Update links of previous_node and search below for new min_node and
# bottom_root
if previous_node:
previous_node.parent = next_node
# Update bottom_root and search for min_node below
self.bottom_root = previous_node
self.min_node = previous_node
while self.bottom_root.left:
self.bottom_root = self.bottom_root.left
if self.bottom_root.val < self.min_node.val:
self.min_node = self.bottom_root
if next_node:
next_node.left = previous_node
# Search for new min_node above min_node
i = next_node
while i:
if i.val < self.min_node.val:
self.min_node = i
i = i.parent
# Merge heaps
self.mergeHeaps(newHeap)
return min_value
def preOrder(self):
"""
Returns the Pre-order representation of the heap including
values of nodes plus their level distance from the root;
Empty nodes appear as #
"""
# Find top root
top_root = self.bottom_root
while top_root.parent:
top_root = top_root.parent
# preorder
heap_preOrder = []
self.__traversal(top_root, heap_preOrder)
return heap_preOrder
def __traversal(self, curr_node, preorder, level=0):
"""
Pre-order traversal of nodes
"""
if curr_node:
preorder.append((curr_node.val, level))
self.__traversal(curr_node.left, preorder, level + 1)
self.__traversal(curr_node.right, preorder, level + 1)
else:
preorder.append(("#", level))
def __str__(self):
"""
Overwriting str for a pre-order print of nodes in heap;
Performance is poor, so use only for small examples
"""
if self.isEmpty():
return ""
preorder_heap = self.preOrder()
return "\n".join(("-" * level + str(value)) for value, level in preorder_heap)
# Unit Tests
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
The convex hull problem is problem of finding all the vertices of convex polygon, P of
a set of points in a plane such that all the points are either on the vertices of P or
inside P. TH convex hull problem has several applications in geometrical problems,
computer graphics and game development.
Two algorithms have been implemented for the convex hull problem here.
1. A brute-force algorithm which runs in O(n^3)
2. A divide-and-conquer algorithm which runs in O(n log(n))
There are other several other algorithms for the convex hull problem
which have not been implemented here, yet.
"""
from typing import Iterable, List, Set, Union
class Point:
"""
Defines a 2-d point for use by all convex-hull algorithms.
Parameters
----------
x: an int or a float, the x-coordinate of the 2-d point
y: an int or a float, the y-coordinate of the 2-d point
Examples
--------
>>> Point(1, 2)
(1.0, 2.0)
>>> Point("1", "2")
(1.0, 2.0)
>>> Point(1, 2) > Point(0, 1)
True
>>> Point(1, 1) == Point(1, 1)
True
>>> Point(-0.5, 1) == Point(0.5, 1)
False
>>> Point("pi", "e")
Traceback (most recent call last):
...
ValueError: could not convert string to float: 'pi'
"""
def __init__(self, x, y):
self.x, self.y = float(x), float(y)
def __eq__(self, other):
return self.x == other.x and self.y == other.y
def __ne__(self, other):
return not self == other
def __gt__(self, other):
if self.x > other.x:
return True
elif self.x == other.x:
return self.y > other.y
return False
def __lt__(self, other):
return not self > other
def __ge__(self, other):
if self.x > other.x:
return True
elif self.x == other.x:
return self.y >= other.y
return False
def __le__(self, other):
if self.x < other.x:
return True
elif self.x == other.x:
return self.y <= other.y
return False
def __repr__(self):
return f"({self.x}, {self.y})"
def __hash__(self):
return hash(self.x)
def _construct_points(
list_of_tuples: Union[List[Point], List[List[float]], Iterable[List[float]]]
) -> List[Point]:
"""
constructs a list of points from an array-like object of numbers
Arguments
---------
list_of_tuples: array-like object of type numbers. Acceptable types so far
are lists, tuples and sets.
Returns
--------
points: a list where each item is of type Point. This contains only objects
which can be converted into a Point.
Examples
-------
>>> _construct_points([[1, 1], [2, -1], [0.3, 4]])
[(1.0, 1.0), (2.0, -1.0), (0.3, 4.0)]
>>> _construct_points([1, 2])
Ignoring deformed point 1. All points must have at least 2 coordinates.
Ignoring deformed point 2. All points must have at least 2 coordinates.
[]
>>> _construct_points([])
[]
>>> _construct_points(None)
[]
"""
points: List[Point] = []
if list_of_tuples:
for p in list_of_tuples:
if isinstance(p, Point):
points.append(p)
else:
try:
points.append(Point(p[0], p[1]))
except (IndexError, TypeError):
print(
f"Ignoring deformed point {p}. All points"
" must have at least 2 coordinates."
)
return points
def _validate_input(points: Union[List[Point], List[List[float]]]) -> List[Point]:
"""
validates an input instance before a convex-hull algorithms uses it
Parameters
---------
points: array-like, the 2d points to validate before using with
a convex-hull algorithm. The elements of points must be either lists, tuples or
Points.
Returns
-------
points: array_like, an iterable of all well-defined Points constructed passed in.
Exception
---------
ValueError: if points is empty or None, or if a wrong data structure like a scalar
is passed
TypeError: if an iterable but non-indexable object (eg. dictionary) is passed.
The exception to this a set which we'll convert to a list before using
Examples
-------
>>> _validate_input([[1, 2]])
[(1.0, 2.0)]
>>> _validate_input([(1, 2)])
[(1.0, 2.0)]
>>> _validate_input([Point(2, 1), Point(-1, 2)])
[(2.0, 1.0), (-1.0, 2.0)]
>>> _validate_input([])
Traceback (most recent call last):
...
ValueError: Expecting a list of points but got []
>>> _validate_input(1)
Traceback (most recent call last):
...
ValueError: Expecting an iterable object but got an non-iterable type 1
"""
if not hasattr(points, "__iter__"):
raise ValueError(
f"Expecting an iterable object but got an non-iterable type {points}"
)
if not points:
raise ValueError(f"Expecting a list of points but got {points}")
return _construct_points(points)
def _det(a: Point, b: Point, c: Point) -> float:
"""
Computes the sign perpendicular distance of a 2d point c from a line segment
ab. The sign indicates the direction of c relative to ab.
A Positive value means c is above ab (to the left), while a negative value
means c is below ab (to the right). 0 means all three points are on a straight line.
As a side note, 0.5 * abs|det| is the area of triangle abc
Parameters
----------
a: point, the point on the left end of line segment ab
b: point, the point on the right end of line segment ab
c: point, the point for which the direction and location is desired.
Returns
--------
det: float, abs(det) is the distance of c from ab. The sign
indicates which side of line segment ab c is. det is computed as
(a_xb_y + c_xa_y + b_xc_y) - (a_yb_x + c_ya_x + b_yc_x)
Examples
----------
>>> _det(Point(1, 1), Point(1, 2), Point(1, 5))
0.0
>>> _det(Point(0, 0), Point(10, 0), Point(0, 10))
100.0
>>> _det(Point(0, 0), Point(10, 0), Point(0, -10))
-100.0
"""
det = (a.x * b.y + b.x * c.y + c.x * a.y) - (a.y * b.x + b.y * c.x + c.y * a.x)
return det
def convex_hull_bf(points: List[Point]) -> List[Point]:
"""
Constructs the convex hull of a set of 2D points using a brute force algorithm.
The algorithm basically considers all combinations of points (i, j) and uses the
definition of convexity to determine whether (i, j) is part of the convex hull or
not. (i, j) is part of the convex hull if and only iff there are no points on both
sides of the line segment connecting the ij, and there is no point k such that k is
on either end of the ij.
Runtime: O(n^3) - definitely horrible
Parameters
---------
points: array-like of object of Points, lists or tuples.
The set of 2d points for which the convex-hull is needed
Returns
------
convex_set: list, the convex-hull of points sorted in non-decreasing order.
See Also
--------
convex_hull_recursive,
Examples
---------
>>> convex_hull_bf([[0, 0], [1, 0], [10, 1]])
[(0.0, 0.0), (1.0, 0.0), (10.0, 1.0)]
>>> convex_hull_bf([[0, 0], [1, 0], [10, 0]])
[(0.0, 0.0), (10.0, 0.0)]
>>> convex_hull_bf([[-1, 1],[-1, -1], [0, 0], [0.5, 0.5], [1, -1], [1, 1],
... [-0.75, 1]])
[(-1.0, -1.0), (-1.0, 1.0), (1.0, -1.0), (1.0, 1.0)]
>>> convex_hull_bf([(0, 3), (2, 2), (1, 1), (2, 1), (3, 0), (0, 0), (3, 3),
... (2, -1), (2, -4), (1, -3)])
[(0.0, 0.0), (0.0, 3.0), (1.0, -3.0), (2.0, -4.0), (3.0, 0.0), (3.0, 3.0)]
"""
points = sorted(_validate_input(points))
n = len(points)
convex_set = set()
for i in range(n - 1):
for j in range(i + 1, n):
points_left_of_ij = points_right_of_ij = False
ij_part_of_convex_hull = True
for k in range(n):
if k != i and k != j:
det_k = _det(points[i], points[j], points[k])
if det_k > 0:
points_left_of_ij = True
elif det_k < 0:
points_right_of_ij = True
else:
# point[i], point[j], point[k] all lie on a straight line
# if point[k] is to the left of point[i] or it's to the
# right of point[j], then point[i], point[j] cannot be
# part of the convex hull of A
if points[k] < points[i] or points[k] > points[j]:
ij_part_of_convex_hull = False
break
if points_left_of_ij and points_right_of_ij:
ij_part_of_convex_hull = False
break
if ij_part_of_convex_hull:
convex_set.update([points[i], points[j]])
return sorted(convex_set)
def convex_hull_recursive(points: List[Point]) -> List[Point]:
"""
Constructs the convex hull of a set of 2D points using a divide-and-conquer strategy
The algorithm exploits the geometric properties of the problem by repeatedly
partitioning the set of points into smaller hulls, and finding the convex hull of
these smaller hulls. The union of the convex hull from smaller hulls is the
solution to the convex hull of the larger problem.
Parameter
---------
points: array-like of object of Points, lists or tuples.
The set of 2d points for which the convex-hull is needed
Runtime: O(n log n)
Returns
-------
convex_set: list, the convex-hull of points sorted in non-decreasing order.
Examples
---------
>>> convex_hull_recursive([[0, 0], [1, 0], [10, 1]])
[(0.0, 0.0), (1.0, 0.0), (10.0, 1.0)]
>>> convex_hull_recursive([[0, 0], [1, 0], [10, 0]])
[(0.0, 0.0), (10.0, 0.0)]
>>> convex_hull_recursive([[-1, 1],[-1, -1], [0, 0], [0.5, 0.5], [1, -1], [1, 1],
... [-0.75, 1]])
[(-1.0, -1.0), (-1.0, 1.0), (1.0, -1.0), (1.0, 1.0)]
>>> convex_hull_recursive([(0, 3), (2, 2), (1, 1), (2, 1), (3, 0), (0, 0), (3, 3),
... (2, -1), (2, -4), (1, -3)])
[(0.0, 0.0), (0.0, 3.0), (1.0, -3.0), (2.0, -4.0), (3.0, 0.0), (3.0, 3.0)]
"""
points = sorted(_validate_input(points))
n = len(points)
# divide all the points into an upper hull and a lower hull
# the left most point and the right most point are definitely
# members of the convex hull by definition.
# use these two anchors to divide all the points into two hulls,
# an upper hull and a lower hull.
# all points to the left (above) the line joining the extreme points belong to the
# upper hull
# all points to the right (below) the line joining the extreme points below to the
# lower hull
# ignore all points on the line joining the extreme points since they cannot be
# part of the convex hull
left_most_point = points[0]
right_most_point = points[n - 1]
convex_set = {left_most_point, right_most_point}
upper_hull = []
lower_hull = []
for i in range(1, n - 1):
det = _det(left_most_point, right_most_point, points[i])
if det > 0:
upper_hull.append(points[i])
elif det < 0:
lower_hull.append(points[i])
_construct_hull(upper_hull, left_most_point, right_most_point, convex_set)
_construct_hull(lower_hull, right_most_point, left_most_point, convex_set)
return sorted(convex_set)
def _construct_hull(
points: List[Point], left: Point, right: Point, convex_set: Set[Point]
) -> None:
"""
Parameters
---------
points: list or None, the hull of points from which to choose the next convex-hull
point
left: Point, the point to the left of line segment joining left and right
right: The point to the right of the line segment joining left and right
convex_set: set, the current convex-hull. The state of convex-set gets updated by
this function
Note
----
For the line segment 'ab', 'a' is on the left and 'b' on the right.
but the reverse is true for the line segment 'ba'.
Returns
-------
Nothing, only updates the state of convex-set
"""
if points:
extreme_point = None
extreme_point_distance = float("-inf")
candidate_points = []
for p in points:
det = _det(left, right, p)
if det > 0:
candidate_points.append(p)
if det > extreme_point_distance:
extreme_point_distance = det
extreme_point = p
if extreme_point:
_construct_hull(candidate_points, left, extreme_point, convex_set)
convex_set.add(extreme_point)
_construct_hull(candidate_points, extreme_point, right, convex_set)
def convex_hull_melkman(points: List[Point]) -> List[Point]:
"""
Constructs the convex hull of a set of 2D points using the melkman algorithm.
The algorithm works by iteratively inserting points of a simple polygonal chain
(meaning that no line segments between two consecutive points cross each other).
Sorting the points yields such a polygonal chain.
For a detailed description, see http://cgm.cs.mcgill.ca/~athens/cs601/Melkman.html
Runtime: O(n log n) - O(n) if points are already sorted in the input
Parameters
---------
points: array-like of object of Points, lists or tuples.
The set of 2d points for which the convex-hull is needed
Returns
------
convex_set: list, the convex-hull of points sorted in non-decreasing order.
See Also
--------
Examples
---------
>>> convex_hull_melkman([[0, 0], [1, 0], [10, 1]])
[(0.0, 0.0), (1.0, 0.0), (10.0, 1.0)]
>>> convex_hull_melkman([[0, 0], [1, 0], [10, 0]])
[(0.0, 0.0), (10.0, 0.0)]
>>> convex_hull_melkman([[-1, 1],[-1, -1], [0, 0], [0.5, 0.5], [1, -1], [1, 1],
... [-0.75, 1]])
[(-1.0, -1.0), (-1.0, 1.0), (1.0, -1.0), (1.0, 1.0)]
>>> convex_hull_melkman([(0, 3), (2, 2), (1, 1), (2, 1), (3, 0), (0, 0), (3, 3),
... (2, -1), (2, -4), (1, -3)])
[(0.0, 0.0), (0.0, 3.0), (1.0, -3.0), (2.0, -4.0), (3.0, 0.0), (3.0, 3.0)]
"""
points = sorted(_validate_input(points))
n = len(points)
convex_hull = points[:2]
for i in range(2, n):
det = _det(convex_hull[1], convex_hull[0], points[i])
if det > 0:
convex_hull.insert(0, points[i])
break
elif det < 0:
convex_hull.append(points[i])
break
else:
convex_hull[1] = points[i]
i += 1
for i in range(i, n):
if (
_det(convex_hull[0], convex_hull[-1], points[i]) > 0
and _det(convex_hull[-1], convex_hull[0], points[1]) < 0
):
# The point lies within the convex hull
continue
convex_hull.insert(0, points[i])
convex_hull.append(points[i])
while _det(convex_hull[0], convex_hull[1], convex_hull[2]) >= 0:
del convex_hull[1]
while _det(convex_hull[-1], convex_hull[-2], convex_hull[-3]) <= 0:
del convex_hull[-2]
# `convex_hull` is contains the convex hull in circular order
return sorted(convex_hull[1:] if len(convex_hull) > 3 else convex_hull)
def main():
points = [
(0, 3),
(2, 2),
(1, 1),
(2, 1),
(3, 0),
(0, 0),
(3, 3),
(2, -1),
(2, -4),
(1, -3),
]
# the convex set of points is
# [(0, 0), (0, 3), (1, -3), (2, -4), (3, 0), (3, 3)]
results_bf = convex_hull_bf(points)
results_recursive = convex_hull_recursive(points)
assert results_bf == results_recursive
results_melkman = convex_hull_melkman(points)
assert results_bf == results_melkman
print(results_bf)
if __name__ == "__main__":
main()
| """
The convex hull problem is problem of finding all the vertices of convex polygon, P of
a set of points in a plane such that all the points are either on the vertices of P or
inside P. TH convex hull problem has several applications in geometrical problems,
computer graphics and game development.
Two algorithms have been implemented for the convex hull problem here.
1. A brute-force algorithm which runs in O(n^3)
2. A divide-and-conquer algorithm which runs in O(n log(n))
There are other several other algorithms for the convex hull problem
which have not been implemented here, yet.
"""
from typing import Iterable, List, Set, Union
class Point:
"""
Defines a 2-d point for use by all convex-hull algorithms.
Parameters
----------
x: an int or a float, the x-coordinate of the 2-d point
y: an int or a float, the y-coordinate of the 2-d point
Examples
--------
>>> Point(1, 2)
(1.0, 2.0)
>>> Point("1", "2")
(1.0, 2.0)
>>> Point(1, 2) > Point(0, 1)
True
>>> Point(1, 1) == Point(1, 1)
True
>>> Point(-0.5, 1) == Point(0.5, 1)
False
>>> Point("pi", "e")
Traceback (most recent call last):
...
ValueError: could not convert string to float: 'pi'
"""
def __init__(self, x, y):
self.x, self.y = float(x), float(y)
def __eq__(self, other):
return self.x == other.x and self.y == other.y
def __ne__(self, other):
return not self == other
def __gt__(self, other):
if self.x > other.x:
return True
elif self.x == other.x:
return self.y > other.y
return False
def __lt__(self, other):
return not self > other
def __ge__(self, other):
if self.x > other.x:
return True
elif self.x == other.x:
return self.y >= other.y
return False
def __le__(self, other):
if self.x < other.x:
return True
elif self.x == other.x:
return self.y <= other.y
return False
def __repr__(self):
return f"({self.x}, {self.y})"
def __hash__(self):
return hash(self.x)
def _construct_points(
list_of_tuples: Union[List[Point], List[List[float]], Iterable[List[float]]]
) -> List[Point]:
"""
constructs a list of points from an array-like object of numbers
Arguments
---------
list_of_tuples: array-like object of type numbers. Acceptable types so far
are lists, tuples and sets.
Returns
--------
points: a list where each item is of type Point. This contains only objects
which can be converted into a Point.
Examples
-------
>>> _construct_points([[1, 1], [2, -1], [0.3, 4]])
[(1.0, 1.0), (2.0, -1.0), (0.3, 4.0)]
>>> _construct_points([1, 2])
Ignoring deformed point 1. All points must have at least 2 coordinates.
Ignoring deformed point 2. All points must have at least 2 coordinates.
[]
>>> _construct_points([])
[]
>>> _construct_points(None)
[]
"""
points: List[Point] = []
if list_of_tuples:
for p in list_of_tuples:
if isinstance(p, Point):
points.append(p)
else:
try:
points.append(Point(p[0], p[1]))
except (IndexError, TypeError):
print(
f"Ignoring deformed point {p}. All points"
" must have at least 2 coordinates."
)
return points
def _validate_input(points: Union[List[Point], List[List[float]]]) -> List[Point]:
"""
validates an input instance before a convex-hull algorithms uses it
Parameters
---------
points: array-like, the 2d points to validate before using with
a convex-hull algorithm. The elements of points must be either lists, tuples or
Points.
Returns
-------
points: array_like, an iterable of all well-defined Points constructed passed in.
Exception
---------
ValueError: if points is empty or None, or if a wrong data structure like a scalar
is passed
TypeError: if an iterable but non-indexable object (eg. dictionary) is passed.
The exception to this a set which we'll convert to a list before using
Examples
-------
>>> _validate_input([[1, 2]])
[(1.0, 2.0)]
>>> _validate_input([(1, 2)])
[(1.0, 2.0)]
>>> _validate_input([Point(2, 1), Point(-1, 2)])
[(2.0, 1.0), (-1.0, 2.0)]
>>> _validate_input([])
Traceback (most recent call last):
...
ValueError: Expecting a list of points but got []
>>> _validate_input(1)
Traceback (most recent call last):
...
ValueError: Expecting an iterable object but got an non-iterable type 1
"""
if not hasattr(points, "__iter__"):
raise ValueError(
f"Expecting an iterable object but got an non-iterable type {points}"
)
if not points:
raise ValueError(f"Expecting a list of points but got {points}")
return _construct_points(points)
def _det(a: Point, b: Point, c: Point) -> float:
"""
Computes the sign perpendicular distance of a 2d point c from a line segment
ab. The sign indicates the direction of c relative to ab.
A Positive value means c is above ab (to the left), while a negative value
means c is below ab (to the right). 0 means all three points are on a straight line.
As a side note, 0.5 * abs|det| is the area of triangle abc
Parameters
----------
a: point, the point on the left end of line segment ab
b: point, the point on the right end of line segment ab
c: point, the point for which the direction and location is desired.
Returns
--------
det: float, abs(det) is the distance of c from ab. The sign
indicates which side of line segment ab c is. det is computed as
(a_xb_y + c_xa_y + b_xc_y) - (a_yb_x + c_ya_x + b_yc_x)
Examples
----------
>>> _det(Point(1, 1), Point(1, 2), Point(1, 5))
0.0
>>> _det(Point(0, 0), Point(10, 0), Point(0, 10))
100.0
>>> _det(Point(0, 0), Point(10, 0), Point(0, -10))
-100.0
"""
det = (a.x * b.y + b.x * c.y + c.x * a.y) - (a.y * b.x + b.y * c.x + c.y * a.x)
return det
def convex_hull_bf(points: List[Point]) -> List[Point]:
"""
Constructs the convex hull of a set of 2D points using a brute force algorithm.
The algorithm basically considers all combinations of points (i, j) and uses the
definition of convexity to determine whether (i, j) is part of the convex hull or
not. (i, j) is part of the convex hull if and only iff there are no points on both
sides of the line segment connecting the ij, and there is no point k such that k is
on either end of the ij.
Runtime: O(n^3) - definitely horrible
Parameters
---------
points: array-like of object of Points, lists or tuples.
The set of 2d points for which the convex-hull is needed
Returns
------
convex_set: list, the convex-hull of points sorted in non-decreasing order.
See Also
--------
convex_hull_recursive,
Examples
---------
>>> convex_hull_bf([[0, 0], [1, 0], [10, 1]])
[(0.0, 0.0), (1.0, 0.0), (10.0, 1.0)]
>>> convex_hull_bf([[0, 0], [1, 0], [10, 0]])
[(0.0, 0.0), (10.0, 0.0)]
>>> convex_hull_bf([[-1, 1],[-1, -1], [0, 0], [0.5, 0.5], [1, -1], [1, 1],
... [-0.75, 1]])
[(-1.0, -1.0), (-1.0, 1.0), (1.0, -1.0), (1.0, 1.0)]
>>> convex_hull_bf([(0, 3), (2, 2), (1, 1), (2, 1), (3, 0), (0, 0), (3, 3),
... (2, -1), (2, -4), (1, -3)])
[(0.0, 0.0), (0.0, 3.0), (1.0, -3.0), (2.0, -4.0), (3.0, 0.0), (3.0, 3.0)]
"""
points = sorted(_validate_input(points))
n = len(points)
convex_set = set()
for i in range(n - 1):
for j in range(i + 1, n):
points_left_of_ij = points_right_of_ij = False
ij_part_of_convex_hull = True
for k in range(n):
if k != i and k != j:
det_k = _det(points[i], points[j], points[k])
if det_k > 0:
points_left_of_ij = True
elif det_k < 0:
points_right_of_ij = True
else:
# point[i], point[j], point[k] all lie on a straight line
# if point[k] is to the left of point[i] or it's to the
# right of point[j], then point[i], point[j] cannot be
# part of the convex hull of A
if points[k] < points[i] or points[k] > points[j]:
ij_part_of_convex_hull = False
break
if points_left_of_ij and points_right_of_ij:
ij_part_of_convex_hull = False
break
if ij_part_of_convex_hull:
convex_set.update([points[i], points[j]])
return sorted(convex_set)
def convex_hull_recursive(points: List[Point]) -> List[Point]:
"""
Constructs the convex hull of a set of 2D points using a divide-and-conquer strategy
The algorithm exploits the geometric properties of the problem by repeatedly
partitioning the set of points into smaller hulls, and finding the convex hull of
these smaller hulls. The union of the convex hull from smaller hulls is the
solution to the convex hull of the larger problem.
Parameter
---------
points: array-like of object of Points, lists or tuples.
The set of 2d points for which the convex-hull is needed
Runtime: O(n log n)
Returns
-------
convex_set: list, the convex-hull of points sorted in non-decreasing order.
Examples
---------
>>> convex_hull_recursive([[0, 0], [1, 0], [10, 1]])
[(0.0, 0.0), (1.0, 0.0), (10.0, 1.0)]
>>> convex_hull_recursive([[0, 0], [1, 0], [10, 0]])
[(0.0, 0.0), (10.0, 0.0)]
>>> convex_hull_recursive([[-1, 1],[-1, -1], [0, 0], [0.5, 0.5], [1, -1], [1, 1],
... [-0.75, 1]])
[(-1.0, -1.0), (-1.0, 1.0), (1.0, -1.0), (1.0, 1.0)]
>>> convex_hull_recursive([(0, 3), (2, 2), (1, 1), (2, 1), (3, 0), (0, 0), (3, 3),
... (2, -1), (2, -4), (1, -3)])
[(0.0, 0.0), (0.0, 3.0), (1.0, -3.0), (2.0, -4.0), (3.0, 0.0), (3.0, 3.0)]
"""
points = sorted(_validate_input(points))
n = len(points)
# divide all the points into an upper hull and a lower hull
# the left most point and the right most point are definitely
# members of the convex hull by definition.
# use these two anchors to divide all the points into two hulls,
# an upper hull and a lower hull.
# all points to the left (above) the line joining the extreme points belong to the
# upper hull
# all points to the right (below) the line joining the extreme points below to the
# lower hull
# ignore all points on the line joining the extreme points since they cannot be
# part of the convex hull
left_most_point = points[0]
right_most_point = points[n - 1]
convex_set = {left_most_point, right_most_point}
upper_hull = []
lower_hull = []
for i in range(1, n - 1):
det = _det(left_most_point, right_most_point, points[i])
if det > 0:
upper_hull.append(points[i])
elif det < 0:
lower_hull.append(points[i])
_construct_hull(upper_hull, left_most_point, right_most_point, convex_set)
_construct_hull(lower_hull, right_most_point, left_most_point, convex_set)
return sorted(convex_set)
def _construct_hull(
points: List[Point], left: Point, right: Point, convex_set: Set[Point]
) -> None:
"""
Parameters
---------
points: list or None, the hull of points from which to choose the next convex-hull
point
left: Point, the point to the left of line segment joining left and right
right: The point to the right of the line segment joining left and right
convex_set: set, the current convex-hull. The state of convex-set gets updated by
this function
Note
----
For the line segment 'ab', 'a' is on the left and 'b' on the right.
but the reverse is true for the line segment 'ba'.
Returns
-------
Nothing, only updates the state of convex-set
"""
if points:
extreme_point = None
extreme_point_distance = float("-inf")
candidate_points = []
for p in points:
det = _det(left, right, p)
if det > 0:
candidate_points.append(p)
if det > extreme_point_distance:
extreme_point_distance = det
extreme_point = p
if extreme_point:
_construct_hull(candidate_points, left, extreme_point, convex_set)
convex_set.add(extreme_point)
_construct_hull(candidate_points, extreme_point, right, convex_set)
def convex_hull_melkman(points: List[Point]) -> List[Point]:
"""
Constructs the convex hull of a set of 2D points using the melkman algorithm.
The algorithm works by iteratively inserting points of a simple polygonal chain
(meaning that no line segments between two consecutive points cross each other).
Sorting the points yields such a polygonal chain.
For a detailed description, see http://cgm.cs.mcgill.ca/~athens/cs601/Melkman.html
Runtime: O(n log n) - O(n) if points are already sorted in the input
Parameters
---------
points: array-like of object of Points, lists or tuples.
The set of 2d points for which the convex-hull is needed
Returns
------
convex_set: list, the convex-hull of points sorted in non-decreasing order.
See Also
--------
Examples
---------
>>> convex_hull_melkman([[0, 0], [1, 0], [10, 1]])
[(0.0, 0.0), (1.0, 0.0), (10.0, 1.0)]
>>> convex_hull_melkman([[0, 0], [1, 0], [10, 0]])
[(0.0, 0.0), (10.0, 0.0)]
>>> convex_hull_melkman([[-1, 1],[-1, -1], [0, 0], [0.5, 0.5], [1, -1], [1, 1],
... [-0.75, 1]])
[(-1.0, -1.0), (-1.0, 1.0), (1.0, -1.0), (1.0, 1.0)]
>>> convex_hull_melkman([(0, 3), (2, 2), (1, 1), (2, 1), (3, 0), (0, 0), (3, 3),
... (2, -1), (2, -4), (1, -3)])
[(0.0, 0.0), (0.0, 3.0), (1.0, -3.0), (2.0, -4.0), (3.0, 0.0), (3.0, 3.0)]
"""
points = sorted(_validate_input(points))
n = len(points)
convex_hull = points[:2]
for i in range(2, n):
det = _det(convex_hull[1], convex_hull[0], points[i])
if det > 0:
convex_hull.insert(0, points[i])
break
elif det < 0:
convex_hull.append(points[i])
break
else:
convex_hull[1] = points[i]
i += 1
for i in range(i, n):
if (
_det(convex_hull[0], convex_hull[-1], points[i]) > 0
and _det(convex_hull[-1], convex_hull[0], points[1]) < 0
):
# The point lies within the convex hull
continue
convex_hull.insert(0, points[i])
convex_hull.append(points[i])
while _det(convex_hull[0], convex_hull[1], convex_hull[2]) >= 0:
del convex_hull[1]
while _det(convex_hull[-1], convex_hull[-2], convex_hull[-3]) <= 0:
del convex_hull[-2]
# `convex_hull` is contains the convex hull in circular order
return sorted(convex_hull[1:] if len(convex_hull) > 3 else convex_hull)
def main():
points = [
(0, 3),
(2, 2),
(1, 1),
(2, 1),
(3, 0),
(0, 0),
(3, 3),
(2, -1),
(2, -4),
(1, -3),
]
# the convex set of points is
# [(0, 0), (0, 3), (1, -3), (2, -4), (3, 0), (3, 3)]
results_bf = convex_hull_bf(points)
results_recursive = convex_hull_recursive(points)
assert results_bf == results_recursive
results_melkman = convex_hull_melkman(points)
assert results_bf == results_melkman
print(results_bf)
if __name__ == "__main__":
main()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| import math
class SegmentTree:
def __init__(self, A):
self.N = len(A)
self.st = [0] * (
4 * self.N
) # approximate the overall size of segment tree with array N
self.build(1, 0, self.N - 1)
def left(self, idx):
return idx * 2
def right(self, idx):
return idx * 2 + 1
def build(self, idx, l, r): # noqa: E741
if l == r: # noqa: E741
self.st[idx] = A[l]
else:
mid = (l + r) // 2
self.build(self.left(idx), l, mid)
self.build(self.right(idx), mid + 1, r)
self.st[idx] = max(self.st[self.left(idx)], self.st[self.right(idx)])
def update(self, a, b, val):
return self.update_recursive(1, 0, self.N - 1, a - 1, b - 1, val)
def update_recursive(self, idx, l, r, a, b, val): # noqa: E741
"""
update(1, 1, N, a, b, v) for update val v to [a,b]
"""
if r < a or l > b:
return True
if l == r: # noqa: E741
self.st[idx] = val
return True
mid = (l + r) // 2
self.update_recursive(self.left(idx), l, mid, a, b, val)
self.update_recursive(self.right(idx), mid + 1, r, a, b, val)
self.st[idx] = max(self.st[self.left(idx)], self.st[self.right(idx)])
return True
def query(self, a, b):
return self.query_recursive(1, 0, self.N - 1, a - 1, b - 1)
def query_recursive(self, idx, l, r, a, b): # noqa: E741
"""
query(1, 1, N, a, b) for query max of [a,b]
"""
if r < a or l > b:
return -math.inf
if l >= a and r <= b: # noqa: E741
return self.st[idx]
mid = (l + r) // 2
q1 = self.query_recursive(self.left(idx), l, mid, a, b)
q2 = self.query_recursive(self.right(idx), mid + 1, r, a, b)
return max(q1, q2)
def showData(self):
showList = []
for i in range(1, N + 1):
showList += [self.query(i, i)]
print(showList)
if __name__ == "__main__":
A = [1, 2, -4, 7, 3, -5, 6, 11, -20, 9, 14, 15, 5, 2, -8]
N = 15
segt = SegmentTree(A)
print(segt.query(4, 6))
print(segt.query(7, 11))
print(segt.query(7, 12))
segt.update(1, 3, 111)
print(segt.query(1, 15))
segt.update(7, 8, 235)
segt.showData()
| import math
class SegmentTree:
def __init__(self, A):
self.N = len(A)
self.st = [0] * (
4 * self.N
) # approximate the overall size of segment tree with array N
self.build(1, 0, self.N - 1)
def left(self, idx):
return idx * 2
def right(self, idx):
return idx * 2 + 1
def build(self, idx, l, r): # noqa: E741
if l == r: # noqa: E741
self.st[idx] = A[l]
else:
mid = (l + r) // 2
self.build(self.left(idx), l, mid)
self.build(self.right(idx), mid + 1, r)
self.st[idx] = max(self.st[self.left(idx)], self.st[self.right(idx)])
def update(self, a, b, val):
return self.update_recursive(1, 0, self.N - 1, a - 1, b - 1, val)
def update_recursive(self, idx, l, r, a, b, val): # noqa: E741
"""
update(1, 1, N, a, b, v) for update val v to [a,b]
"""
if r < a or l > b:
return True
if l == r: # noqa: E741
self.st[idx] = val
return True
mid = (l + r) // 2
self.update_recursive(self.left(idx), l, mid, a, b, val)
self.update_recursive(self.right(idx), mid + 1, r, a, b, val)
self.st[idx] = max(self.st[self.left(idx)], self.st[self.right(idx)])
return True
def query(self, a, b):
return self.query_recursive(1, 0, self.N - 1, a - 1, b - 1)
def query_recursive(self, idx, l, r, a, b): # noqa: E741
"""
query(1, 1, N, a, b) for query max of [a,b]
"""
if r < a or l > b:
return -math.inf
if l >= a and r <= b: # noqa: E741
return self.st[idx]
mid = (l + r) // 2
q1 = self.query_recursive(self.left(idx), l, mid, a, b)
q2 = self.query_recursive(self.right(idx), mid + 1, r, a, b)
return max(q1, q2)
def showData(self):
showList = []
for i in range(1, N + 1):
showList += [self.query(i, i)]
print(showList)
if __name__ == "__main__":
A = [1, 2, -4, 7, 3, -5, 6, 11, -20, 9, 14, 15, 5, 2, -8]
N = 15
segt = SegmentTree(A)
print(segt.query(4, 6))
print(segt.query(7, 11))
print(segt.query(7, 12))
segt.update(1, 3, 111)
print(segt.query(1, 15))
segt.update(7, 8, 235)
segt.showData()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
In this problem, we want to rotate the matrix elements by 90, 180, 270
(counterclockwise)
Discussion in stackoverflow:
https://stackoverflow.com/questions/42519/how-do-you-rotate-a-two-dimensional-array
"""
from __future__ import annotations
def make_matrix(row_size: int = 4) -> list[list]:
"""
>>> make_matrix()
[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]]
>>> make_matrix(1)
[[1]]
>>> make_matrix(-2)
[[1, 2], [3, 4]]
>>> make_matrix(3)
[[1, 2, 3], [4, 5, 6], [7, 8, 9]]
>>> make_matrix() == make_matrix(4)
True
"""
row_size = abs(row_size) or 4
return [[1 + x + y * row_size for x in range(row_size)] for y in range(row_size)]
def rotate_90(matrix: list[list]) -> list[list]:
"""
>>> rotate_90(make_matrix())
[[4, 8, 12, 16], [3, 7, 11, 15], [2, 6, 10, 14], [1, 5, 9, 13]]
>>> rotate_90(make_matrix()) == transpose(reverse_column(make_matrix()))
True
"""
return reverse_row(transpose(matrix))
# OR.. transpose(reverse_column(matrix))
def rotate_180(matrix: list[list]) -> list[list]:
"""
>>> rotate_180(make_matrix())
[[16, 15, 14, 13], [12, 11, 10, 9], [8, 7, 6, 5], [4, 3, 2, 1]]
>>> rotate_180(make_matrix()) == reverse_column(reverse_row(make_matrix()))
True
"""
return reverse_row(reverse_column(matrix))
# OR.. reverse_column(reverse_row(matrix))
def rotate_270(matrix: list[list]) -> list[list]:
"""
>>> rotate_270(make_matrix())
[[13, 9, 5, 1], [14, 10, 6, 2], [15, 11, 7, 3], [16, 12, 8, 4]]
>>> rotate_270(make_matrix()) == transpose(reverse_row(make_matrix()))
True
"""
return reverse_column(transpose(matrix))
# OR.. transpose(reverse_row(matrix))
def transpose(matrix: list[list]) -> list[list]:
matrix[:] = [list(x) for x in zip(*matrix)]
return matrix
def reverse_row(matrix: list[list]) -> list[list]:
matrix[:] = matrix[::-1]
return matrix
def reverse_column(matrix: list[list]) -> list[list]:
matrix[:] = [x[::-1] for x in matrix]
return matrix
def print_matrix(matrix: list[list]) -> None:
for i in matrix:
print(*i)
if __name__ == "__main__":
matrix = make_matrix()
print("\norigin:\n")
print_matrix(matrix)
print("\nrotate 90 counterclockwise:\n")
print_matrix(rotate_90(matrix))
matrix = make_matrix()
print("\norigin:\n")
print_matrix(matrix)
print("\nrotate 180:\n")
print_matrix(rotate_180(matrix))
matrix = make_matrix()
print("\norigin:\n")
print_matrix(matrix)
print("\nrotate 270 counterclockwise:\n")
print_matrix(rotate_270(matrix))
| """
In this problem, we want to rotate the matrix elements by 90, 180, 270
(counterclockwise)
Discussion in stackoverflow:
https://stackoverflow.com/questions/42519/how-do-you-rotate-a-two-dimensional-array
"""
from __future__ import annotations
def make_matrix(row_size: int = 4) -> list[list]:
"""
>>> make_matrix()
[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]]
>>> make_matrix(1)
[[1]]
>>> make_matrix(-2)
[[1, 2], [3, 4]]
>>> make_matrix(3)
[[1, 2, 3], [4, 5, 6], [7, 8, 9]]
>>> make_matrix() == make_matrix(4)
True
"""
row_size = abs(row_size) or 4
return [[1 + x + y * row_size for x in range(row_size)] for y in range(row_size)]
def rotate_90(matrix: list[list]) -> list[list]:
"""
>>> rotate_90(make_matrix())
[[4, 8, 12, 16], [3, 7, 11, 15], [2, 6, 10, 14], [1, 5, 9, 13]]
>>> rotate_90(make_matrix()) == transpose(reverse_column(make_matrix()))
True
"""
return reverse_row(transpose(matrix))
# OR.. transpose(reverse_column(matrix))
def rotate_180(matrix: list[list]) -> list[list]:
"""
>>> rotate_180(make_matrix())
[[16, 15, 14, 13], [12, 11, 10, 9], [8, 7, 6, 5], [4, 3, 2, 1]]
>>> rotate_180(make_matrix()) == reverse_column(reverse_row(make_matrix()))
True
"""
return reverse_row(reverse_column(matrix))
# OR.. reverse_column(reverse_row(matrix))
def rotate_270(matrix: list[list]) -> list[list]:
"""
>>> rotate_270(make_matrix())
[[13, 9, 5, 1], [14, 10, 6, 2], [15, 11, 7, 3], [16, 12, 8, 4]]
>>> rotate_270(make_matrix()) == transpose(reverse_row(make_matrix()))
True
"""
return reverse_column(transpose(matrix))
# OR.. transpose(reverse_row(matrix))
def transpose(matrix: list[list]) -> list[list]:
matrix[:] = [list(x) for x in zip(*matrix)]
return matrix
def reverse_row(matrix: list[list]) -> list[list]:
matrix[:] = matrix[::-1]
return matrix
def reverse_column(matrix: list[list]) -> list[list]:
matrix[:] = [x[::-1] for x in matrix]
return matrix
def print_matrix(matrix: list[list]) -> None:
for i in matrix:
print(*i)
if __name__ == "__main__":
matrix = make_matrix()
print("\norigin:\n")
print_matrix(matrix)
print("\nrotate 90 counterclockwise:\n")
print_matrix(rotate_90(matrix))
matrix = make_matrix()
print("\norigin:\n")
print_matrix(matrix)
print("\nrotate 180:\n")
print_matrix(rotate_180(matrix))
matrix = make_matrix()
print("\norigin:\n")
print_matrix(matrix)
print("\nrotate 270 counterclockwise:\n")
print_matrix(rotate_270(matrix))
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| # https://en.wikipedia.org/wiki/Continuous_knapsack_problem
# https://www.guru99.com/fractional-knapsack-problem-greedy.html
# https://medium.com/walkinthecode/greedy-algorithm-fractional-knapsack-problem-9aba1daecc93
from __future__ import annotations
def fractional_knapsack(
value: list[int], weight: list[int], capacity: int
) -> tuple[int, list[int]]:
"""
>>> value = [1, 3, 5, 7, 9]
>>> weight = [0.9, 0.7, 0.5, 0.3, 0.1]
>>> fractional_knapsack(value, weight, 5)
(25, [1, 1, 1, 1, 1])
>>> fractional_knapsack(value, weight, 15)
(25, [1, 1, 1, 1, 1])
>>> fractional_knapsack(value, weight, 25)
(25, [1, 1, 1, 1, 1])
>>> fractional_knapsack(value, weight, 26)
(25, [1, 1, 1, 1, 1])
>>> fractional_knapsack(value, weight, -1)
(-90.0, [0, 0, 0, 0, -10.0])
>>> fractional_knapsack([1, 3, 5, 7], weight, 30)
(16, [1, 1, 1, 1])
>>> fractional_knapsack(value, [0.9, 0.7, 0.5, 0.3, 0.1], 30)
(25, [1, 1, 1, 1, 1])
>>> fractional_knapsack([], [], 30)
(0, [])
"""
index = list(range(len(value)))
ratio = [v / w for v, w in zip(value, weight)]
index.sort(key=lambda i: ratio[i], reverse=True)
max_value = 0
fractions = [0] * len(value)
for i in index:
if weight[i] <= capacity:
fractions[i] = 1
max_value += value[i]
capacity -= weight[i]
else:
fractions[i] = capacity / weight[i]
max_value += value[i] * capacity / weight[i]
break
return max_value, fractions
if __name__ == "__main__":
n = int(input("Enter number of items: "))
value = input(f"Enter the values of the {n} item(s) in order: ").split()
value = [int(v) for v in value]
weight = input(f"Enter the positive weights of the {n} item(s) in order: ".split())
weight = [int(w) for w in weight]
capacity = int(input("Enter maximum weight: "))
max_value, fractions = fractional_knapsack(value, weight, capacity)
print("The maximum value of items that can be carried:", max_value)
print("The fractions in which the items should be taken:", fractions)
| # https://en.wikipedia.org/wiki/Continuous_knapsack_problem
# https://www.guru99.com/fractional-knapsack-problem-greedy.html
# https://medium.com/walkinthecode/greedy-algorithm-fractional-knapsack-problem-9aba1daecc93
from __future__ import annotations
def fractional_knapsack(
value: list[int], weight: list[int], capacity: int
) -> tuple[int, list[int]]:
"""
>>> value = [1, 3, 5, 7, 9]
>>> weight = [0.9, 0.7, 0.5, 0.3, 0.1]
>>> fractional_knapsack(value, weight, 5)
(25, [1, 1, 1, 1, 1])
>>> fractional_knapsack(value, weight, 15)
(25, [1, 1, 1, 1, 1])
>>> fractional_knapsack(value, weight, 25)
(25, [1, 1, 1, 1, 1])
>>> fractional_knapsack(value, weight, 26)
(25, [1, 1, 1, 1, 1])
>>> fractional_knapsack(value, weight, -1)
(-90.0, [0, 0, 0, 0, -10.0])
>>> fractional_knapsack([1, 3, 5, 7], weight, 30)
(16, [1, 1, 1, 1])
>>> fractional_knapsack(value, [0.9, 0.7, 0.5, 0.3, 0.1], 30)
(25, [1, 1, 1, 1, 1])
>>> fractional_knapsack([], [], 30)
(0, [])
"""
index = list(range(len(value)))
ratio = [v / w for v, w in zip(value, weight)]
index.sort(key=lambda i: ratio[i], reverse=True)
max_value = 0
fractions = [0] * len(value)
for i in index:
if weight[i] <= capacity:
fractions[i] = 1
max_value += value[i]
capacity -= weight[i]
else:
fractions[i] = capacity / weight[i]
max_value += value[i] * capacity / weight[i]
break
return max_value, fractions
if __name__ == "__main__":
n = int(input("Enter number of items: "))
value = input(f"Enter the values of the {n} item(s) in order: ").split()
value = [int(v) for v in value]
weight = input(f"Enter the positive weights of the {n} item(s) in order: ".split())
weight = [int(w) for w in weight]
capacity = int(input("Enter maximum weight: "))
max_value, fractions = fractional_knapsack(value, weight, capacity)
print("The maximum value of items that can be carried:", max_value)
print("The fractions in which the items should be taken:", fractions)
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| import math
def perfect_square(num: int) -> bool:
"""
Check if a number is perfect square number or not
:param num: the number to be checked
:return: True if number is square number, otherwise False
>>> perfect_square(9)
True
>>> perfect_square(16)
True
>>> perfect_square(1)
True
>>> perfect_square(0)
True
>>> perfect_square(10)
False
"""
return math.sqrt(num) * math.sqrt(num) == num
def perfect_square_binary_search(n: int) -> bool:
"""
Check if a number is perfect square using binary search.
Time complexity : O(Log(n))
Space complexity: O(1)
>>> perfect_square_binary_search(9)
True
>>> perfect_square_binary_search(16)
True
>>> perfect_square_binary_search(1)
True
>>> perfect_square_binary_search(0)
True
>>> perfect_square_binary_search(10)
False
>>> perfect_square_binary_search(-1)
False
>>> perfect_square_binary_search(1.1)
False
>>> perfect_square_binary_search("a")
Traceback (most recent call last):
...
TypeError: '<=' not supported between instances of 'int' and 'str'
>>> perfect_square_binary_search(None)
Traceback (most recent call last):
...
TypeError: '<=' not supported between instances of 'int' and 'NoneType'
>>> perfect_square_binary_search([])
Traceback (most recent call last):
...
TypeError: '<=' not supported between instances of 'int' and 'list'
"""
left = 0
right = n
while left <= right:
mid = (left + right) // 2
if mid ** 2 == n:
return True
elif mid ** 2 > n:
right = mid - 1
else:
left = mid + 1
return False
if __name__ == "__main__":
import doctest
doctest.testmod()
| import math
def perfect_square(num: int) -> bool:
"""
Check if a number is perfect square number or not
:param num: the number to be checked
:return: True if number is square number, otherwise False
>>> perfect_square(9)
True
>>> perfect_square(16)
True
>>> perfect_square(1)
True
>>> perfect_square(0)
True
>>> perfect_square(10)
False
"""
return math.sqrt(num) * math.sqrt(num) == num
def perfect_square_binary_search(n: int) -> bool:
"""
Check if a number is perfect square using binary search.
Time complexity : O(Log(n))
Space complexity: O(1)
>>> perfect_square_binary_search(9)
True
>>> perfect_square_binary_search(16)
True
>>> perfect_square_binary_search(1)
True
>>> perfect_square_binary_search(0)
True
>>> perfect_square_binary_search(10)
False
>>> perfect_square_binary_search(-1)
False
>>> perfect_square_binary_search(1.1)
False
>>> perfect_square_binary_search("a")
Traceback (most recent call last):
...
TypeError: '<=' not supported between instances of 'int' and 'str'
>>> perfect_square_binary_search(None)
Traceback (most recent call last):
...
TypeError: '<=' not supported between instances of 'int' and 'NoneType'
>>> perfect_square_binary_search([])
Traceback (most recent call last):
...
TypeError: '<=' not supported between instances of 'int' and 'list'
"""
left = 0
right = n
while left <= right:
mid = (left + right) // 2
if mid ** 2 == n:
return True
elif mid ** 2 > n:
right = mid - 1
else:
left = mid + 1
return False
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Hey, we are going to find an exciting number called Catalan number which is use to find
the number of possible binary search trees from tree of a given number of nodes.
We will use the formula: t(n) = SUMMATION(i = 1 to n)t(i-1)t(n-i)
Further details at Wikipedia: https://en.wikipedia.org/wiki/Catalan_number
"""
"""
Our Contribution:
Basically we Create the 2 function:
1. catalan_number(node_count: int) -> int
Returns the number of possible binary search trees for n nodes.
2. binary_tree_count(node_count: int) -> int
Returns the number of possible binary trees for n nodes.
"""
def binomial_coefficient(n: int, k: int) -> int:
"""
Since Here we Find the Binomial Coefficient:
https://en.wikipedia.org/wiki/Binomial_coefficient
C(n,k) = n! / k!(n-k)!
:param n: 2 times of Number of nodes
:param k: Number of nodes
:return: Integer Value
>>> binomial_coefficient(4, 2)
6
"""
result = 1 # To kept the Calculated Value
# Since C(n, k) = C(n, n-k)
if k > (n - k):
k = n - k
# Calculate C(n,k)
for i in range(k):
result *= n - i
result //= i + 1
return result
def catalan_number(node_count: int) -> int:
"""
We can find Catalan number many ways but here we use Binomial Coefficient because it
does the job in O(n)
return the Catalan number of n using 2nCn/(n+1).
:param n: number of nodes
:return: Catalan number of n nodes
>>> catalan_number(5)
42
>>> catalan_number(6)
132
"""
return binomial_coefficient(2 * node_count, node_count) // (node_count + 1)
def factorial(n: int) -> int:
"""
Return the factorial of a number.
:param n: Number to find the Factorial of.
:return: Factorial of n.
>>> import math
>>> all(factorial(i) == math.factorial(i) for i in range(10))
True
>>> factorial(-5) # doctest: +ELLIPSIS
Traceback (most recent call last):
...
ValueError: factorial() not defined for negative values
"""
if n < 0:
raise ValueError("factorial() not defined for negative values")
result = 1
for i in range(1, n + 1):
result *= i
return result
def binary_tree_count(node_count: int) -> int:
"""
Return the number of possible of binary trees.
:param n: number of nodes
:return: Number of possible binary trees
>>> binary_tree_count(5)
5040
>>> binary_tree_count(6)
95040
"""
return catalan_number(node_count) * factorial(node_count)
if __name__ == "__main__":
node_count = int(input("Enter the number of nodes: ").strip() or 0)
if node_count <= 0:
raise ValueError("We need some nodes to work with.")
print(
f"Given {node_count} nodes, there are {binary_tree_count(node_count)} "
f"binary trees and {catalan_number(node_count)} binary search trees."
)
| """
Hey, we are going to find an exciting number called Catalan number which is use to find
the number of possible binary search trees from tree of a given number of nodes.
We will use the formula: t(n) = SUMMATION(i = 1 to n)t(i-1)t(n-i)
Further details at Wikipedia: https://en.wikipedia.org/wiki/Catalan_number
"""
"""
Our Contribution:
Basically we Create the 2 function:
1. catalan_number(node_count: int) -> int
Returns the number of possible binary search trees for n nodes.
2. binary_tree_count(node_count: int) -> int
Returns the number of possible binary trees for n nodes.
"""
def binomial_coefficient(n: int, k: int) -> int:
"""
Since Here we Find the Binomial Coefficient:
https://en.wikipedia.org/wiki/Binomial_coefficient
C(n,k) = n! / k!(n-k)!
:param n: 2 times of Number of nodes
:param k: Number of nodes
:return: Integer Value
>>> binomial_coefficient(4, 2)
6
"""
result = 1 # To kept the Calculated Value
# Since C(n, k) = C(n, n-k)
if k > (n - k):
k = n - k
# Calculate C(n,k)
for i in range(k):
result *= n - i
result //= i + 1
return result
def catalan_number(node_count: int) -> int:
"""
We can find Catalan number many ways but here we use Binomial Coefficient because it
does the job in O(n)
return the Catalan number of n using 2nCn/(n+1).
:param n: number of nodes
:return: Catalan number of n nodes
>>> catalan_number(5)
42
>>> catalan_number(6)
132
"""
return binomial_coefficient(2 * node_count, node_count) // (node_count + 1)
def factorial(n: int) -> int:
"""
Return the factorial of a number.
:param n: Number to find the Factorial of.
:return: Factorial of n.
>>> import math
>>> all(factorial(i) == math.factorial(i) for i in range(10))
True
>>> factorial(-5) # doctest: +ELLIPSIS
Traceback (most recent call last):
...
ValueError: factorial() not defined for negative values
"""
if n < 0:
raise ValueError("factorial() not defined for negative values")
result = 1
for i in range(1, n + 1):
result *= i
return result
def binary_tree_count(node_count: int) -> int:
"""
Return the number of possible of binary trees.
:param n: number of nodes
:return: Number of possible binary trees
>>> binary_tree_count(5)
5040
>>> binary_tree_count(6)
95040
"""
return catalan_number(node_count) * factorial(node_count)
if __name__ == "__main__":
node_count = int(input("Enter the number of nodes: ").strip() or 0)
if node_count <= 0:
raise ValueError("We need some nodes to work with.")
print(
f"Given {node_count} nodes, there are {binary_tree_count(node_count)} "
f"binary trees and {catalan_number(node_count)} binary search trees."
)
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Heap's algorithm returns the list of all permutations possible from a list.
It minimizes movement by generating each permutation from the previous one
by swapping only two elements.
More information:
https://en.wikipedia.org/wiki/Heap%27s_algorithm.
"""
def heaps(arr: list) -> list:
"""
Pure python implementation of the Heap's algorithm (recursive version),
returning all permutations of a list.
>>> heaps([])
[()]
>>> heaps([0])
[(0,)]
>>> heaps([-1, 1])
[(-1, 1), (1, -1)]
>>> heaps([1, 2, 3])
[(1, 2, 3), (2, 1, 3), (3, 1, 2), (1, 3, 2), (2, 3, 1), (3, 2, 1)]
>>> from itertools import permutations
>>> sorted(heaps([1,2,3])) == sorted(permutations([1,2,3]))
True
>>> all(sorted(heaps(x)) == sorted(permutations(x))
... for x in ([], [0], [-1, 1], [1, 2, 3]))
True
"""
if len(arr) <= 1:
return [tuple(arr)]
res = []
def generate(k: int, arr: list):
if k == 1:
res.append(tuple(arr[:]))
return
generate(k - 1, arr)
for i in range(k - 1):
if k % 2 == 0: # k is even
arr[i], arr[k - 1] = arr[k - 1], arr[i]
else: # k is odd
arr[0], arr[k - 1] = arr[k - 1], arr[0]
generate(k - 1, arr)
generate(len(arr), arr)
return res
if __name__ == "__main__":
user_input = input("Enter numbers separated by a comma:\n").strip()
arr = [int(item) for item in user_input.split(",")]
print(heaps(arr))
| """
Heap's algorithm returns the list of all permutations possible from a list.
It minimizes movement by generating each permutation from the previous one
by swapping only two elements.
More information:
https://en.wikipedia.org/wiki/Heap%27s_algorithm.
"""
def heaps(arr: list) -> list:
"""
Pure python implementation of the Heap's algorithm (recursive version),
returning all permutations of a list.
>>> heaps([])
[()]
>>> heaps([0])
[(0,)]
>>> heaps([-1, 1])
[(-1, 1), (1, -1)]
>>> heaps([1, 2, 3])
[(1, 2, 3), (2, 1, 3), (3, 1, 2), (1, 3, 2), (2, 3, 1), (3, 2, 1)]
>>> from itertools import permutations
>>> sorted(heaps([1,2,3])) == sorted(permutations([1,2,3]))
True
>>> all(sorted(heaps(x)) == sorted(permutations(x))
... for x in ([], [0], [-1, 1], [1, 2, 3]))
True
"""
if len(arr) <= 1:
return [tuple(arr)]
res = []
def generate(k: int, arr: list):
if k == 1:
res.append(tuple(arr[:]))
return
generate(k - 1, arr)
for i in range(k - 1):
if k % 2 == 0: # k is even
arr[i], arr[k - 1] = arr[k - 1], arr[i]
else: # k is odd
arr[0], arr[k - 1] = arr[k - 1], arr[0]
generate(k - 1, arr)
generate(len(arr), arr)
return res
if __name__ == "__main__":
user_input = input("Enter numbers separated by a comma:\n").strip()
arr = [int(item) for item in user_input.split(",")]
print(heaps(arr))
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
This is a pure Python implementation of the pancake sort algorithm
For doctests run following command:
python3 -m doctest -v pancake_sort.py
or
python -m doctest -v pancake_sort.py
For manual testing run:
python pancake_sort.py
"""
def pancake_sort(arr):
"""Sort Array with Pancake Sort.
:param arr: Collection containing comparable items
:return: Collection ordered in ascending order of items
Examples:
>>> pancake_sort([0, 5, 3, 2, 2])
[0, 2, 2, 3, 5]
>>> pancake_sort([])
[]
>>> pancake_sort([-2, -5, -45])
[-45, -5, -2]
"""
cur = len(arr)
while cur > 1:
# Find the maximum number in arr
mi = arr.index(max(arr[0:cur]))
# Reverse from 0 to mi
arr = arr[mi::-1] + arr[mi + 1 : len(arr)]
# Reverse whole list
arr = arr[cur - 1 :: -1] + arr[cur : len(arr)]
cur -= 1
return arr
if __name__ == "__main__":
user_input = input("Enter numbers separated by a comma:\n").strip()
unsorted = [int(item) for item in user_input.split(",")]
print(pancake_sort(unsorted))
| """
This is a pure Python implementation of the pancake sort algorithm
For doctests run following command:
python3 -m doctest -v pancake_sort.py
or
python -m doctest -v pancake_sort.py
For manual testing run:
python pancake_sort.py
"""
def pancake_sort(arr):
"""Sort Array with Pancake Sort.
:param arr: Collection containing comparable items
:return: Collection ordered in ascending order of items
Examples:
>>> pancake_sort([0, 5, 3, 2, 2])
[0, 2, 2, 3, 5]
>>> pancake_sort([])
[]
>>> pancake_sort([-2, -5, -45])
[-45, -5, -2]
"""
cur = len(arr)
while cur > 1:
# Find the maximum number in arr
mi = arr.index(max(arr[0:cur]))
# Reverse from 0 to mi
arr = arr[mi::-1] + arr[mi + 1 : len(arr)]
# Reverse whole list
arr = arr[cur - 1 :: -1] + arr[cur : len(arr)]
cur -= 1
return arr
if __name__ == "__main__":
user_input = input("Enter numbers separated by a comma:\n").strip()
unsorted = [int(item) for item in user_input.split(",")]
print(pancake_sort(unsorted))
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """Segmented Sieve."""
import math
def sieve(n):
"""Segmented Sieve."""
in_prime = []
start = 2
end = int(math.sqrt(n)) # Size of every segment
temp = [True] * (end + 1)
prime = []
while start <= end:
if temp[start] is True:
in_prime.append(start)
for i in range(start * start, end + 1, start):
if temp[i] is True:
temp[i] = False
start += 1
prime += in_prime
low = end + 1
high = low + end - 1
if high > n:
high = n
while low <= n:
temp = [True] * (high - low + 1)
for each in in_prime:
t = math.floor(low / each) * each
if t < low:
t += each
for j in range(t, high + 1, each):
temp[j - low] = False
for j in range(len(temp)):
if temp[j] is True:
prime.append(j + low)
low = high + 1
high = low + end - 1
if high > n:
high = n
return prime
print(sieve(10 ** 6))
| """Segmented Sieve."""
import math
def sieve(n):
"""Segmented Sieve."""
in_prime = []
start = 2
end = int(math.sqrt(n)) # Size of every segment
temp = [True] * (end + 1)
prime = []
while start <= end:
if temp[start] is True:
in_prime.append(start)
for i in range(start * start, end + 1, start):
if temp[i] is True:
temp[i] = False
start += 1
prime += in_prime
low = end + 1
high = low + end - 1
if high > n:
high = n
while low <= n:
temp = [True] * (high - low + 1)
for each in in_prime:
t = math.floor(low / each) * each
if t < low:
t += each
for j in range(t, high + 1, each):
temp[j - low] = False
for j in range(len(temp)):
if temp[j] is True:
prime.append(j + low)
low = high + 1
high = low + end - 1
if high > n:
high = n
return prime
print(sieve(10 ** 6))
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Lychrel numbers
Problem 55: https://projecteuler.net/problem=55
If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.
Not all numbers produce palindromes so quickly. For example,
349 + 943 = 1292,
1292 + 2921 = 4213
4213 + 3124 = 7337
That is, 349 took three iterations to arrive at a palindrome.
Although no one has proved it yet, it is thought that some numbers, like 196,
never produce a palindrome. A number that never forms a palindrome through the
reverse and add process is called a Lychrel number. Due to the theoretical nature
of these numbers, and for the purpose of this problem, we shall assume that a number
is Lychrel until proven otherwise. In addition you are given that for every number
below ten-thousand, it will either (i) become a palindrome in less than fifty
iterations, or, (ii) no one, with all the computing power that exists, has managed
so far to map it to a palindrome. In fact, 10677 is the first number to be shown
to require over fifty iterations before producing a palindrome:
4668731596684224866951378664 (53 iterations, 28-digits).
Surprisingly, there are palindromic numbers that are themselves Lychrel numbers;
the first example is 4994.
How many Lychrel numbers are there below ten-thousand?
"""
def is_palindrome(n: int) -> bool:
"""
Returns True if a number is palindrome.
>>> is_palindrome(12567321)
False
>>> is_palindrome(1221)
True
>>> is_palindrome(9876789)
True
"""
return str(n) == str(n)[::-1]
def sum_reverse(n: int) -> int:
"""
Returns the sum of n and reverse of n.
>>> sum_reverse(123)
444
>>> sum_reverse(3478)
12221
>>> sum_reverse(12)
33
"""
return int(n) + int(str(n)[::-1])
def solution(limit: int = 10000) -> int:
"""
Returns the count of all lychrel numbers below limit.
>>> solution(10000)
249
>>> solution(5000)
76
>>> solution(1000)
13
"""
lychrel_nums = []
for num in range(1, limit):
iterations = 0
a = num
while iterations < 50:
num = sum_reverse(num)
iterations += 1
if is_palindrome(num):
break
else:
lychrel_nums.append(a)
return len(lychrel_nums)
if __name__ == "__main__":
print(f"{solution() = }")
| """
Lychrel numbers
Problem 55: https://projecteuler.net/problem=55
If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.
Not all numbers produce palindromes so quickly. For example,
349 + 943 = 1292,
1292 + 2921 = 4213
4213 + 3124 = 7337
That is, 349 took three iterations to arrive at a palindrome.
Although no one has proved it yet, it is thought that some numbers, like 196,
never produce a palindrome. A number that never forms a palindrome through the
reverse and add process is called a Lychrel number. Due to the theoretical nature
of these numbers, and for the purpose of this problem, we shall assume that a number
is Lychrel until proven otherwise. In addition you are given that for every number
below ten-thousand, it will either (i) become a palindrome in less than fifty
iterations, or, (ii) no one, with all the computing power that exists, has managed
so far to map it to a palindrome. In fact, 10677 is the first number to be shown
to require over fifty iterations before producing a palindrome:
4668731596684224866951378664 (53 iterations, 28-digits).
Surprisingly, there are palindromic numbers that are themselves Lychrel numbers;
the first example is 4994.
How many Lychrel numbers are there below ten-thousand?
"""
def is_palindrome(n: int) -> bool:
"""
Returns True if a number is palindrome.
>>> is_palindrome(12567321)
False
>>> is_palindrome(1221)
True
>>> is_palindrome(9876789)
True
"""
return str(n) == str(n)[::-1]
def sum_reverse(n: int) -> int:
"""
Returns the sum of n and reverse of n.
>>> sum_reverse(123)
444
>>> sum_reverse(3478)
12221
>>> sum_reverse(12)
33
"""
return int(n) + int(str(n)[::-1])
def solution(limit: int = 10000) -> int:
"""
Returns the count of all lychrel numbers below limit.
>>> solution(10000)
249
>>> solution(5000)
76
>>> solution(1000)
13
"""
lychrel_nums = []
for num in range(1, limit):
iterations = 0
a = num
while iterations < 50:
num = sum_reverse(num)
iterations += 1
if is_palindrome(num):
break
else:
lychrel_nums.append(a)
return len(lychrel_nums)
if __name__ == "__main__":
print(f"{solution() = }")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Project Euler Problem 8: https://projecteuler.net/problem=8
Largest product in a series
The four adjacent digits in the 1000-digit number that have the greatest
product are 9 × 9 × 8 × 9 = 5832.
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450
Find the thirteen adjacent digits in the 1000-digit number that have the
greatest product. What is the value of this product?
"""
from functools import reduce
N = (
"73167176531330624919225119674426574742355349194934"
"96983520312774506326239578318016984801869478851843"
"85861560789112949495459501737958331952853208805511"
"12540698747158523863050715693290963295227443043557"
"66896648950445244523161731856403098711121722383113"
"62229893423380308135336276614282806444486645238749"
"30358907296290491560440772390713810515859307960866"
"70172427121883998797908792274921901699720888093776"
"65727333001053367881220235421809751254540594752243"
"52584907711670556013604839586446706324415722155397"
"53697817977846174064955149290862569321978468622482"
"83972241375657056057490261407972968652414535100474"
"82166370484403199890008895243450658541227588666881"
"16427171479924442928230863465674813919123162824586"
"17866458359124566529476545682848912883142607690042"
"24219022671055626321111109370544217506941658960408"
"07198403850962455444362981230987879927244284909188"
"84580156166097919133875499200524063689912560717606"
"05886116467109405077541002256983155200055935729725"
"71636269561882670428252483600823257530420752963450"
)
def solution(n: str = N) -> int:
"""
Find the thirteen adjacent digits in the 1000-digit number n that have
the greatest product and returns it.
>>> solution("13978431290823798458352374")
609638400
>>> solution("13978431295823798458352374")
2612736000
>>> solution("1397843129582379841238352374")
209018880
"""
return max(
[
reduce(lambda x, y: int(x) * int(y), n[i : i + 13])
for i in range(len(n) - 12)
]
)
if __name__ == "__main__":
print(f"{solution() = }")
| """
Project Euler Problem 8: https://projecteuler.net/problem=8
Largest product in a series
The four adjacent digits in the 1000-digit number that have the greatest
product are 9 × 9 × 8 × 9 = 5832.
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450
Find the thirteen adjacent digits in the 1000-digit number that have the
greatest product. What is the value of this product?
"""
from functools import reduce
N = (
"73167176531330624919225119674426574742355349194934"
"96983520312774506326239578318016984801869478851843"
"85861560789112949495459501737958331952853208805511"
"12540698747158523863050715693290963295227443043557"
"66896648950445244523161731856403098711121722383113"
"62229893423380308135336276614282806444486645238749"
"30358907296290491560440772390713810515859307960866"
"70172427121883998797908792274921901699720888093776"
"65727333001053367881220235421809751254540594752243"
"52584907711670556013604839586446706324415722155397"
"53697817977846174064955149290862569321978468622482"
"83972241375657056057490261407972968652414535100474"
"82166370484403199890008895243450658541227588666881"
"16427171479924442928230863465674813919123162824586"
"17866458359124566529476545682848912883142607690042"
"24219022671055626321111109370544217506941658960408"
"07198403850962455444362981230987879927244284909188"
"84580156166097919133875499200524063689912560717606"
"05886116467109405077541002256983155200055935729725"
"71636269561882670428252483600823257530420752963450"
)
def solution(n: str = N) -> int:
"""
Find the thirteen adjacent digits in the 1000-digit number n that have
the greatest product and returns it.
>>> solution("13978431290823798458352374")
609638400
>>> solution("13978431295823798458352374")
2612736000
>>> solution("1397843129582379841238352374")
209018880
"""
return max(
[
reduce(lambda x, y: int(x) * int(y), n[i : i + 13])
for i in range(len(n) - 12)
]
)
if __name__ == "__main__":
print(f"{solution() = }")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| B64_CHARSET = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"
def base64_encode(data: bytes) -> bytes:
"""Encodes data according to RFC4648.
The data is first transformed to binary and appended with binary digits so that its
length becomes a multiple of 6, then each 6 binary digits will match a character in
the B64_CHARSET string. The number of appended binary digits would later determine
how many "=" sign should be added, the padding.
For every 2 binary digits added, a "=" sign is added in the output.
We can add any binary digits to make it a multiple of 6, for instance, consider the
following example:
"AA" -> 0010100100101001 -> 001010 010010 1001
As can be seen above, 2 more binary digits should be added, so there's 4
possibilities here: 00, 01, 10 or 11.
That being said, Base64 encoding can be used in Steganography to hide data in these
appended digits.
>>> from base64 import b64encode
>>> a = b"This pull request is part of Hacktoberfest20!"
>>> b = b"https://tools.ietf.org/html/rfc4648"
>>> c = b"A"
>>> base64_encode(a) == b64encode(a)
True
>>> base64_encode(b) == b64encode(b)
True
>>> base64_encode(c) == b64encode(c)
True
>>> base64_encode("abc")
Traceback (most recent call last):
...
TypeError: a bytes-like object is required, not 'str'
"""
# Make sure the supplied data is a bytes-like object
if not isinstance(data, bytes):
raise TypeError(
f"a bytes-like object is required, not '{data.__class__.__name__}'"
)
binary_stream = "".join(bin(byte)[2:].zfill(8) for byte in data)
padding_needed = len(binary_stream) % 6 != 0
if padding_needed:
# The padding that will be added later
padding = b"=" * ((6 - len(binary_stream) % 6) // 2)
# Append binary_stream with arbitrary binary digits (0's by default) to make its
# length a multiple of 6.
binary_stream += "0" * (6 - len(binary_stream) % 6)
else:
padding = b""
# Encode every 6 binary digits to their corresponding Base64 character
return (
"".join(
B64_CHARSET[int(binary_stream[index : index + 6], 2)]
for index in range(0, len(binary_stream), 6)
).encode()
+ padding
)
def base64_decode(encoded_data: str) -> bytes:
"""Decodes data according to RFC4648.
This does the reverse operation of base64_encode.
We first transform the encoded data back to a binary stream, take off the
previously appended binary digits according to the padding, at this point we
would have a binary stream whose length is multiple of 8, the last step is
to convert every 8 bits to a byte.
>>> from base64 import b64decode
>>> a = "VGhpcyBwdWxsIHJlcXVlc3QgaXMgcGFydCBvZiBIYWNrdG9iZXJmZXN0MjAh"
>>> b = "aHR0cHM6Ly90b29scy5pZXRmLm9yZy9odG1sL3JmYzQ2NDg="
>>> c = "QQ=="
>>> base64_decode(a) == b64decode(a)
True
>>> base64_decode(b) == b64decode(b)
True
>>> base64_decode(c) == b64decode(c)
True
>>> base64_decode("abc")
Traceback (most recent call last):
...
AssertionError: Incorrect padding
"""
# Make sure encoded_data is either a string or a bytes-like object
if not isinstance(encoded_data, bytes) and not isinstance(encoded_data, str):
raise TypeError(
"argument should be a bytes-like object or ASCII string, not "
f"'{encoded_data.__class__.__name__}'"
)
# In case encoded_data is a bytes-like object, make sure it contains only
# ASCII characters so we convert it to a string object
if isinstance(encoded_data, bytes):
try:
encoded_data = encoded_data.decode("utf-8")
except UnicodeDecodeError:
raise ValueError("base64 encoded data should only contain ASCII characters")
padding = encoded_data.count("=")
# Check if the encoded string contains non base64 characters
if padding:
assert all(
char in B64_CHARSET for char in encoded_data[:-padding]
), "Invalid base64 character(s) found."
else:
assert all(
char in B64_CHARSET for char in encoded_data
), "Invalid base64 character(s) found."
# Check the padding
assert len(encoded_data) % 4 == 0 and padding < 3, "Incorrect padding"
if padding:
# Remove padding if there is one
encoded_data = encoded_data[:-padding]
binary_stream = "".join(
bin(B64_CHARSET.index(char))[2:].zfill(6) for char in encoded_data
)[: -padding * 2]
else:
binary_stream = "".join(
bin(B64_CHARSET.index(char))[2:].zfill(6) for char in encoded_data
)
data = [
int(binary_stream[index : index + 8], 2)
for index in range(0, len(binary_stream), 8)
]
return bytes(data)
if __name__ == "__main__":
import doctest
doctest.testmod()
| B64_CHARSET = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"
def base64_encode(data: bytes) -> bytes:
"""Encodes data according to RFC4648.
The data is first transformed to binary and appended with binary digits so that its
length becomes a multiple of 6, then each 6 binary digits will match a character in
the B64_CHARSET string. The number of appended binary digits would later determine
how many "=" sign should be added, the padding.
For every 2 binary digits added, a "=" sign is added in the output.
We can add any binary digits to make it a multiple of 6, for instance, consider the
following example:
"AA" -> 0010100100101001 -> 001010 010010 1001
As can be seen above, 2 more binary digits should be added, so there's 4
possibilities here: 00, 01, 10 or 11.
That being said, Base64 encoding can be used in Steganography to hide data in these
appended digits.
>>> from base64 import b64encode
>>> a = b"This pull request is part of Hacktoberfest20!"
>>> b = b"https://tools.ietf.org/html/rfc4648"
>>> c = b"A"
>>> base64_encode(a) == b64encode(a)
True
>>> base64_encode(b) == b64encode(b)
True
>>> base64_encode(c) == b64encode(c)
True
>>> base64_encode("abc")
Traceback (most recent call last):
...
TypeError: a bytes-like object is required, not 'str'
"""
# Make sure the supplied data is a bytes-like object
if not isinstance(data, bytes):
raise TypeError(
f"a bytes-like object is required, not '{data.__class__.__name__}'"
)
binary_stream = "".join(bin(byte)[2:].zfill(8) for byte in data)
padding_needed = len(binary_stream) % 6 != 0
if padding_needed:
# The padding that will be added later
padding = b"=" * ((6 - len(binary_stream) % 6) // 2)
# Append binary_stream with arbitrary binary digits (0's by default) to make its
# length a multiple of 6.
binary_stream += "0" * (6 - len(binary_stream) % 6)
else:
padding = b""
# Encode every 6 binary digits to their corresponding Base64 character
return (
"".join(
B64_CHARSET[int(binary_stream[index : index + 6], 2)]
for index in range(0, len(binary_stream), 6)
).encode()
+ padding
)
def base64_decode(encoded_data: str) -> bytes:
"""Decodes data according to RFC4648.
This does the reverse operation of base64_encode.
We first transform the encoded data back to a binary stream, take off the
previously appended binary digits according to the padding, at this point we
would have a binary stream whose length is multiple of 8, the last step is
to convert every 8 bits to a byte.
>>> from base64 import b64decode
>>> a = "VGhpcyBwdWxsIHJlcXVlc3QgaXMgcGFydCBvZiBIYWNrdG9iZXJmZXN0MjAh"
>>> b = "aHR0cHM6Ly90b29scy5pZXRmLm9yZy9odG1sL3JmYzQ2NDg="
>>> c = "QQ=="
>>> base64_decode(a) == b64decode(a)
True
>>> base64_decode(b) == b64decode(b)
True
>>> base64_decode(c) == b64decode(c)
True
>>> base64_decode("abc")
Traceback (most recent call last):
...
AssertionError: Incorrect padding
"""
# Make sure encoded_data is either a string or a bytes-like object
if not isinstance(encoded_data, bytes) and not isinstance(encoded_data, str):
raise TypeError(
"argument should be a bytes-like object or ASCII string, not "
f"'{encoded_data.__class__.__name__}'"
)
# In case encoded_data is a bytes-like object, make sure it contains only
# ASCII characters so we convert it to a string object
if isinstance(encoded_data, bytes):
try:
encoded_data = encoded_data.decode("utf-8")
except UnicodeDecodeError:
raise ValueError("base64 encoded data should only contain ASCII characters")
padding = encoded_data.count("=")
# Check if the encoded string contains non base64 characters
if padding:
assert all(
char in B64_CHARSET for char in encoded_data[:-padding]
), "Invalid base64 character(s) found."
else:
assert all(
char in B64_CHARSET for char in encoded_data
), "Invalid base64 character(s) found."
# Check the padding
assert len(encoded_data) % 4 == 0 and padding < 3, "Incorrect padding"
if padding:
# Remove padding if there is one
encoded_data = encoded_data[:-padding]
binary_stream = "".join(
bin(B64_CHARSET.index(char))[2:].zfill(6) for char in encoded_data
)[: -padding * 2]
else:
binary_stream = "".join(
bin(B64_CHARSET.index(char))[2:].zfill(6) for char in encoded_data
)
data = [
int(binary_stream[index : index + 8], 2)
for index in range(0, len(binary_stream), 8)
]
return bytes(data)
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| def perfect_cube(n: int) -> bool:
"""
Check if a number is a perfect cube or not.
>>> perfect_cube(27)
True
>>> perfect_cube(4)
False
"""
val = n ** (1 / 3)
return (val * val * val) == n
if __name__ == "__main__":
print(perfect_cube(27))
print(perfect_cube(4))
| def perfect_cube(n: int) -> bool:
"""
Check if a number is a perfect cube or not.
>>> perfect_cube(27)
True
>>> perfect_cube(4)
False
"""
val = n ** (1 / 3)
return (val * val * val) == n
if __name__ == "__main__":
print(perfect_cube(27))
print(perfect_cube(4))
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Author : Mehdi ALAOUI
This is a pure Python implementation of Dynamic Programming solution to the longest
increasing subsequence of a given sequence.
The problem is :
Given an array, to find the longest and increasing sub-array in that given array and
return it.
Example: [10, 22, 9, 33, 21, 50, 41, 60, 80] as input will return
[10, 22, 33, 41, 60, 80] as output
"""
from __future__ import annotations
def longest_subsequence(array: list[int]) -> list[int]: # This function is recursive
"""
Some examples
>>> longest_subsequence([10, 22, 9, 33, 21, 50, 41, 60, 80])
[10, 22, 33, 41, 60, 80]
>>> longest_subsequence([4, 8, 7, 5, 1, 12, 2, 3, 9])
[1, 2, 3, 9]
>>> longest_subsequence([9, 8, 7, 6, 5, 7])
[8]
>>> longest_subsequence([1, 1, 1])
[1, 1, 1]
>>> longest_subsequence([])
[]
"""
array_length = len(array)
# If the array contains only one element, we return it (it's the stop condition of
# recursion)
if array_length <= 1:
return array
# Else
pivot = array[0]
isFound = False
i = 1
longest_subseq = []
while not isFound and i < array_length:
if array[i] < pivot:
isFound = True
temp_array = [element for element in array[i:] if element >= array[i]]
temp_array = longest_subsequence(temp_array)
if len(temp_array) > len(longest_subseq):
longest_subseq = temp_array
else:
i += 1
temp_array = [element for element in array[1:] if element >= pivot]
temp_array = [pivot] + longest_subsequence(temp_array)
if len(temp_array) > len(longest_subseq):
return temp_array
else:
return longest_subseq
if __name__ == "__main__":
import doctest
doctest.testmod()
| """
Author : Mehdi ALAOUI
This is a pure Python implementation of Dynamic Programming solution to the longest
increasing subsequence of a given sequence.
The problem is :
Given an array, to find the longest and increasing sub-array in that given array and
return it.
Example: [10, 22, 9, 33, 21, 50, 41, 60, 80] as input will return
[10, 22, 33, 41, 60, 80] as output
"""
from __future__ import annotations
def longest_subsequence(array: list[int]) -> list[int]: # This function is recursive
"""
Some examples
>>> longest_subsequence([10, 22, 9, 33, 21, 50, 41, 60, 80])
[10, 22, 33, 41, 60, 80]
>>> longest_subsequence([4, 8, 7, 5, 1, 12, 2, 3, 9])
[1, 2, 3, 9]
>>> longest_subsequence([9, 8, 7, 6, 5, 7])
[8]
>>> longest_subsequence([1, 1, 1])
[1, 1, 1]
>>> longest_subsequence([])
[]
"""
array_length = len(array)
# If the array contains only one element, we return it (it's the stop condition of
# recursion)
if array_length <= 1:
return array
# Else
pivot = array[0]
isFound = False
i = 1
longest_subseq = []
while not isFound and i < array_length:
if array[i] < pivot:
isFound = True
temp_array = [element for element in array[i:] if element >= array[i]]
temp_array = longest_subsequence(temp_array)
if len(temp_array) > len(longest_subseq):
longest_subseq = temp_array
else:
i += 1
temp_array = [element for element in array[1:] if element >= pivot]
temp_array = [pivot] + longest_subsequence(temp_array)
if len(temp_array) > len(longest_subseq):
return temp_array
else:
return longest_subseq
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| from typing import List
def merge(left_half: List, right_half: List) -> List:
"""Helper function for mergesort.
>>> left_half = [-2]
>>> right_half = [-1]
>>> merge(left_half, right_half)
[-2, -1]
>>> left_half = [1,2,3]
>>> right_half = [4,5,6]
>>> merge(left_half, right_half)
[1, 2, 3, 4, 5, 6]
>>> left_half = [-2]
>>> right_half = [-1]
>>> merge(left_half, right_half)
[-2, -1]
>>> left_half = [12, 15]
>>> right_half = [13, 14]
>>> merge(left_half, right_half)
[12, 13, 14, 15]
>>> left_half = []
>>> right_half = []
>>> merge(left_half, right_half)
[]
"""
sorted_array = [None] * (len(right_half) + len(left_half))
pointer1 = 0 # pointer to current index for left Half
pointer2 = 0 # pointer to current index for the right Half
index = 0 # pointer to current index for the sorted array Half
while pointer1 < len(left_half) and pointer2 < len(right_half):
if left_half[pointer1] < right_half[pointer2]:
sorted_array[index] = left_half[pointer1]
pointer1 += 1
index += 1
else:
sorted_array[index] = right_half[pointer2]
pointer2 += 1
index += 1
while pointer1 < len(left_half):
sorted_array[index] = left_half[pointer1]
pointer1 += 1
index += 1
while pointer2 < len(right_half):
sorted_array[index] = right_half[pointer2]
pointer2 += 1
index += 1
return sorted_array
def merge_sort(array: List) -> List:
"""Returns a list of sorted array elements using merge sort.
>>> from random import shuffle
>>> array = [-2, 3, -10, 11, 99, 100000, 100, -200]
>>> shuffle(array)
>>> merge_sort(array)
[-200, -10, -2, 3, 11, 99, 100, 100000]
>>> shuffle(array)
>>> merge_sort(array)
[-200, -10, -2, 3, 11, 99, 100, 100000]
>>> array = [-200]
>>> merge_sort(array)
[-200]
>>> array = [-2, 3, -10, 11, 99, 100000, 100, -200]
>>> shuffle(array)
>>> sorted(array) == merge_sort(array)
True
>>> array = [-2]
>>> merge_sort(array)
[-2]
>>> array = []
>>> merge_sort(array)
[]
>>> array = [10000000, 1, -1111111111, 101111111112, 9000002]
>>> sorted(array) == merge_sort(array)
True
"""
if len(array) <= 1:
return array
# the actual formula to calculate the middle element = left + (right - left) // 2
# this avoids integer overflow in case of large N
middle = 0 + (len(array) - 0) // 2
# Split the array into halves till the array length becomes equal to One
# merge the arrays of single length returned by mergeSort function and
# pass them into the merge arrays function which merges the array
left_half = array[:middle]
right_half = array[middle:]
return merge(merge_sort(left_half), merge_sort(right_half))
if __name__ == "__main__":
import doctest
doctest.testmod()
| from typing import List
def merge(left_half: List, right_half: List) -> List:
"""Helper function for mergesort.
>>> left_half = [-2]
>>> right_half = [-1]
>>> merge(left_half, right_half)
[-2, -1]
>>> left_half = [1,2,3]
>>> right_half = [4,5,6]
>>> merge(left_half, right_half)
[1, 2, 3, 4, 5, 6]
>>> left_half = [-2]
>>> right_half = [-1]
>>> merge(left_half, right_half)
[-2, -1]
>>> left_half = [12, 15]
>>> right_half = [13, 14]
>>> merge(left_half, right_half)
[12, 13, 14, 15]
>>> left_half = []
>>> right_half = []
>>> merge(left_half, right_half)
[]
"""
sorted_array = [None] * (len(right_half) + len(left_half))
pointer1 = 0 # pointer to current index for left Half
pointer2 = 0 # pointer to current index for the right Half
index = 0 # pointer to current index for the sorted array Half
while pointer1 < len(left_half) and pointer2 < len(right_half):
if left_half[pointer1] < right_half[pointer2]:
sorted_array[index] = left_half[pointer1]
pointer1 += 1
index += 1
else:
sorted_array[index] = right_half[pointer2]
pointer2 += 1
index += 1
while pointer1 < len(left_half):
sorted_array[index] = left_half[pointer1]
pointer1 += 1
index += 1
while pointer2 < len(right_half):
sorted_array[index] = right_half[pointer2]
pointer2 += 1
index += 1
return sorted_array
def merge_sort(array: List) -> List:
"""Returns a list of sorted array elements using merge sort.
>>> from random import shuffle
>>> array = [-2, 3, -10, 11, 99, 100000, 100, -200]
>>> shuffle(array)
>>> merge_sort(array)
[-200, -10, -2, 3, 11, 99, 100, 100000]
>>> shuffle(array)
>>> merge_sort(array)
[-200, -10, -2, 3, 11, 99, 100, 100000]
>>> array = [-200]
>>> merge_sort(array)
[-200]
>>> array = [-2, 3, -10, 11, 99, 100000, 100, -200]
>>> shuffle(array)
>>> sorted(array) == merge_sort(array)
True
>>> array = [-2]
>>> merge_sort(array)
[-2]
>>> array = []
>>> merge_sort(array)
[]
>>> array = [10000000, 1, -1111111111, 101111111112, 9000002]
>>> sorted(array) == merge_sort(array)
True
"""
if len(array) <= 1:
return array
# the actual formula to calculate the middle element = left + (right - left) // 2
# this avoids integer overflow in case of large N
middle = 0 + (len(array) - 0) // 2
# Split the array into halves till the array length becomes equal to One
# merge the arrays of single length returned by mergeSort function and
# pass them into the merge arrays function which merges the array
left_half = array[:middle]
right_half = array[middle:]
return merge(merge_sort(left_half), merge_sort(right_half))
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
In this problem, we want to determine all possible subsequences
of the given sequence. We use backtracking to solve this problem.
Time complexity: O(2^n),
where n denotes the length of the given sequence.
"""
from typing import Any, List
def generate_all_subsequences(sequence: List[Any]) -> None:
create_state_space_tree(sequence, [], 0)
def create_state_space_tree(
sequence: List[Any], current_subsequence: List[Any], index: int
) -> None:
"""
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly two children.
It terminates when it reaches the end of the given sequence.
"""
if index == len(sequence):
print(current_subsequence)
return
create_state_space_tree(sequence, current_subsequence, index + 1)
current_subsequence.append(sequence[index])
create_state_space_tree(sequence, current_subsequence, index + 1)
current_subsequence.pop()
if __name__ == "__main__":
seq: List[Any] = [3, 1, 2, 4]
generate_all_subsequences(seq)
seq.clear()
seq.extend(["A", "B", "C"])
generate_all_subsequences(seq)
| """
In this problem, we want to determine all possible subsequences
of the given sequence. We use backtracking to solve this problem.
Time complexity: O(2^n),
where n denotes the length of the given sequence.
"""
from typing import Any, List
def generate_all_subsequences(sequence: List[Any]) -> None:
create_state_space_tree(sequence, [], 0)
def create_state_space_tree(
sequence: List[Any], current_subsequence: List[Any], index: int
) -> None:
"""
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly two children.
It terminates when it reaches the end of the given sequence.
"""
if index == len(sequence):
print(current_subsequence)
return
create_state_space_tree(sequence, current_subsequence, index + 1)
current_subsequence.append(sequence[index])
create_state_space_tree(sequence, current_subsequence, index + 1)
current_subsequence.pop()
if __name__ == "__main__":
seq: List[Any] = [3, 1, 2, 4]
generate_all_subsequences(seq)
seq.clear()
seq.extend(["A", "B", "C"])
generate_all_subsequences(seq)
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Problem 28
Url: https://projecteuler.net/problem=28
Statement:
Starting with the number 1 and moving to the right in a clockwise direction a 5
by 5 spiral is formed as follows:
21 22 23 24 25
20 7 8 9 10
19 6 1 2 11
18 5 4 3 12
17 16 15 14 13
It can be verified that the sum of the numbers on the diagonals is 101.
What is the sum of the numbers on the diagonals in a 1001 by 1001 spiral formed
in the same way?
"""
from math import ceil
def solution(n: int = 1001) -> int:
"""Returns the sum of the numbers on the diagonals in a n by n spiral
formed in the same way.
>>> solution(1001)
669171001
>>> solution(500)
82959497
>>> solution(100)
651897
>>> solution(50)
79697
>>> solution(10)
537
"""
total = 1
for i in range(1, int(ceil(n / 2.0))):
odd = 2 * i + 1
even = 2 * i
total = total + 4 * odd ** 2 - 6 * even
return total
if __name__ == "__main__":
import sys
if len(sys.argv) == 1:
print(solution())
else:
try:
n = int(sys.argv[1])
print(solution(n))
except ValueError:
print("Invalid entry - please enter a number")
| """
Problem 28
Url: https://projecteuler.net/problem=28
Statement:
Starting with the number 1 and moving to the right in a clockwise direction a 5
by 5 spiral is formed as follows:
21 22 23 24 25
20 7 8 9 10
19 6 1 2 11
18 5 4 3 12
17 16 15 14 13
It can be verified that the sum of the numbers on the diagonals is 101.
What is the sum of the numbers on the diagonals in a 1001 by 1001 spiral formed
in the same way?
"""
from math import ceil
def solution(n: int = 1001) -> int:
"""Returns the sum of the numbers on the diagonals in a n by n spiral
formed in the same way.
>>> solution(1001)
669171001
>>> solution(500)
82959497
>>> solution(100)
651897
>>> solution(50)
79697
>>> solution(10)
537
"""
total = 1
for i in range(1, int(ceil(n / 2.0))):
odd = 2 * i + 1
even = 2 * i
total = total + 4 * odd ** 2 - 6 * even
return total
if __name__ == "__main__":
import sys
if len(sys.argv) == 1:
print(solution())
else:
try:
n = int(sys.argv[1])
print(solution(n))
except ValueError:
print("Invalid entry - please enter a number")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| # Eulers Totient function finds the number of relative primes of a number n from 1 to n
def totient(n: int) -> list:
is_prime = [True for i in range(n + 1)]
totients = [i - 1 for i in range(n + 1)]
primes = []
for i in range(2, n + 1):
if is_prime[i]:
primes.append(i)
for j in range(0, len(primes)):
if i * primes[j] >= n:
break
is_prime[i * primes[j]] = False
if i % primes[j] == 0:
totients[i * primes[j]] = totients[i] * primes[j]
break
totients[i * primes[j]] = totients[i] * (primes[j] - 1)
return totients
def test_totient() -> None:
"""
>>> n = 10
>>> totient_calculation = totient(n)
>>> for i in range(1, n):
... print(f"{i} has {totient_calculation[i]} relative primes.")
1 has 0 relative primes.
2 has 1 relative primes.
3 has 2 relative primes.
4 has 2 relative primes.
5 has 4 relative primes.
6 has 2 relative primes.
7 has 6 relative primes.
8 has 4 relative primes.
9 has 6 relative primes.
"""
pass
if __name__ == "__main__":
import doctest
doctest.testmod()
| # Eulers Totient function finds the number of relative primes of a number n from 1 to n
def totient(n: int) -> list:
is_prime = [True for i in range(n + 1)]
totients = [i - 1 for i in range(n + 1)]
primes = []
for i in range(2, n + 1):
if is_prime[i]:
primes.append(i)
for j in range(0, len(primes)):
if i * primes[j] >= n:
break
is_prime[i * primes[j]] = False
if i % primes[j] == 0:
totients[i * primes[j]] = totients[i] * primes[j]
break
totients[i * primes[j]] = totients[i] * (primes[j] - 1)
return totients
def test_totient() -> None:
"""
>>> n = 10
>>> totient_calculation = totient(n)
>>> for i in range(1, n):
... print(f"{i} has {totient_calculation[i]} relative primes.")
1 has 0 relative primes.
2 has 1 relative primes.
3 has 2 relative primes.
4 has 2 relative primes.
5 has 4 relative primes.
6 has 2 relative primes.
7 has 6 relative primes.
8 has 4 relative primes.
9 has 6 relative primes.
"""
pass
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """Get the site emails from URL."""
__author__ = "Muhammad Umer Farooq"
__license__ = "MIT"
__version__ = "1.0.0"
__maintainer__ = "Muhammad Umer Farooq"
__email__ = "[email protected]"
__status__ = "Alpha"
import re
from html.parser import HTMLParser
from urllib import parse
import requests
class Parser(HTMLParser):
def __init__(self, domain: str):
HTMLParser.__init__(self)
self.data = []
self.domain = domain
def handle_starttag(self, tag: str, attrs: str) -> None:
"""
This function parse html to take takes url from tags
"""
# Only parse the 'anchor' tag.
if tag == "a":
# Check the list of defined attributes.
for name, value in attrs:
# If href is defined, and not empty nor # print it.
if name == "href" and value != "#" and value != "":
# If not already in data.
if value not in self.data:
url = parse.urljoin(self.domain, value)
self.data.append(url)
# Get main domain name (example.com)
def get_domain_name(url: str) -> str:
"""
This function get the main domain name
>>> get_domain_name("https://a.b.c.d/e/f?g=h,i=j#k")
'c.d'
>>> get_domain_name("Not a URL!")
''
"""
return ".".join(get_sub_domain_name(url).split(".")[-2:])
# Get sub domain name (sub.example.com)
def get_sub_domain_name(url: str) -> str:
"""
>>> get_sub_domain_name("https://a.b.c.d/e/f?g=h,i=j#k")
'a.b.c.d'
>>> get_sub_domain_name("Not a URL!")
''
"""
return parse.urlparse(url).netloc
def emails_from_url(url: str = "https://github.com") -> list:
"""
This function takes url and return all valid urls
"""
# Get the base domain from the url
domain = get_domain_name(url)
# Initialize the parser
parser = Parser(domain)
try:
# Open URL
r = requests.get(url)
# pass the raw HTML to the parser to get links
parser.feed(r.text)
# Get links and loop through
valid_emails = set()
for link in parser.data:
# open URL.
# read = requests.get(link)
try:
read = requests.get(link)
# Get the valid email.
emails = re.findall("[a-zA-Z0-9]+@" + domain, read.text)
# If not in list then append it.
for email in emails:
valid_emails.add(email)
except ValueError:
pass
except ValueError:
exit(-1)
# Finally return a sorted list of email addresses with no duplicates.
return sorted(valid_emails)
if __name__ == "__main__":
emails = emails_from_url("https://github.com")
print(f"{len(emails)} emails found:")
print("\n".join(sorted(emails)))
| """Get the site emails from URL."""
__author__ = "Muhammad Umer Farooq"
__license__ = "MIT"
__version__ = "1.0.0"
__maintainer__ = "Muhammad Umer Farooq"
__email__ = "[email protected]"
__status__ = "Alpha"
import re
from html.parser import HTMLParser
from urllib import parse
import requests
class Parser(HTMLParser):
def __init__(self, domain: str):
HTMLParser.__init__(self)
self.data = []
self.domain = domain
def handle_starttag(self, tag: str, attrs: str) -> None:
"""
This function parse html to take takes url from tags
"""
# Only parse the 'anchor' tag.
if tag == "a":
# Check the list of defined attributes.
for name, value in attrs:
# If href is defined, and not empty nor # print it.
if name == "href" and value != "#" and value != "":
# If not already in data.
if value not in self.data:
url = parse.urljoin(self.domain, value)
self.data.append(url)
# Get main domain name (example.com)
def get_domain_name(url: str) -> str:
"""
This function get the main domain name
>>> get_domain_name("https://a.b.c.d/e/f?g=h,i=j#k")
'c.d'
>>> get_domain_name("Not a URL!")
''
"""
return ".".join(get_sub_domain_name(url).split(".")[-2:])
# Get sub domain name (sub.example.com)
def get_sub_domain_name(url: str) -> str:
"""
>>> get_sub_domain_name("https://a.b.c.d/e/f?g=h,i=j#k")
'a.b.c.d'
>>> get_sub_domain_name("Not a URL!")
''
"""
return parse.urlparse(url).netloc
def emails_from_url(url: str = "https://github.com") -> list:
"""
This function takes url and return all valid urls
"""
# Get the base domain from the url
domain = get_domain_name(url)
# Initialize the parser
parser = Parser(domain)
try:
# Open URL
r = requests.get(url)
# pass the raw HTML to the parser to get links
parser.feed(r.text)
# Get links and loop through
valid_emails = set()
for link in parser.data:
# open URL.
# read = requests.get(link)
try:
read = requests.get(link)
# Get the valid email.
emails = re.findall("[a-zA-Z0-9]+@" + domain, read.text)
# If not in list then append it.
for email in emails:
valid_emails.add(email)
except ValueError:
pass
except ValueError:
exit(-1)
# Finally return a sorted list of email addresses with no duplicates.
return sorted(valid_emails)
if __name__ == "__main__":
emails = emails_from_url("https://github.com")
print(f"{len(emails)} emails found:")
print("\n".join(sorted(emails)))
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Changing contrast with PIL
This algorithm is used in
https://noivce.pythonanywhere.com/ Python web app.
python/black: True
flake8 : True
"""
from PIL import Image
def change_contrast(img: Image, level: int) -> Image:
"""
Function to change contrast
"""
factor = (259 * (level + 255)) / (255 * (259 - level))
def contrast(c: int) -> int:
"""
Fundamental Transformation/Operation that'll be performed on
every bit.
"""
return int(128 + factor * (c - 128))
return img.point(contrast)
if __name__ == "__main__":
# Load image
with Image.open("image_data/lena.jpg") as img:
# Change contrast to 170
cont_img = change_contrast(img, 170)
cont_img.save("image_data/lena_high_contrast.png", format="png")
| """
Changing contrast with PIL
This algorithm is used in
https://noivce.pythonanywhere.com/ Python web app.
python/black: True
flake8 : True
"""
from PIL import Image
def change_contrast(img: Image, level: int) -> Image:
"""
Function to change contrast
"""
factor = (259 * (level + 255)) / (255 * (259 - level))
def contrast(c: int) -> int:
"""
Fundamental Transformation/Operation that'll be performed on
every bit.
"""
return int(128 + factor * (c - 128))
return img.point(contrast)
if __name__ == "__main__":
# Load image
with Image.open("image_data/lena.jpg") as img:
# Change contrast to 170
cont_img = change_contrast(img, 170)
cont_img.save("image_data/lena_high_contrast.png", format="png")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
A pure Python implementation of the insertion sort algorithm
This algorithm sorts a collection by comparing adjacent elements.
When it finds that order is not respected, it moves the element compared
backward until the order is correct. It then goes back directly to the
element's initial position resuming forward comparison.
For doctests run following command:
python3 -m doctest -v insertion_sort.py
For manual testing run:
python3 insertion_sort.py
"""
def insertion_sort(collection: list) -> list:
"""A pure Python implementation of the insertion sort algorithm
:param collection: some mutable ordered collection with heterogeneous
comparable items inside
:return: the same collection ordered by ascending
Examples:
>>> insertion_sort([0, 5, 3, 2, 2])
[0, 2, 2, 3, 5]
>>> insertion_sort([]) == sorted([])
True
>>> insertion_sort([-2, -5, -45]) == sorted([-2, -5, -45])
True
>>> insertion_sort(['d', 'a', 'b', 'e', 'c']) == sorted(['d', 'a', 'b', 'e', 'c'])
True
>>> import random
>>> collection = random.sample(range(-50, 50), 100)
>>> insertion_sort(collection) == sorted(collection)
True
>>> import string
>>> collection = random.choices(string.ascii_letters + string.digits, k=100)
>>> insertion_sort(collection) == sorted(collection)
True
"""
for insert_index, insert_value in enumerate(collection[1:]):
temp_index = insert_index
while insert_index >= 0 and insert_value < collection[insert_index]:
collection[insert_index + 1] = collection[insert_index]
insert_index -= 1
if insert_index != temp_index:
collection[insert_index + 1] = insert_value
return collection
if __name__ == "__main__":
from doctest import testmod
testmod()
user_input = input("Enter numbers separated by a comma:\n").strip()
unsorted = [int(item) for item in user_input.split(",")]
print(f"{insertion_sort(unsorted) = }")
| """
A pure Python implementation of the insertion sort algorithm
This algorithm sorts a collection by comparing adjacent elements.
When it finds that order is not respected, it moves the element compared
backward until the order is correct. It then goes back directly to the
element's initial position resuming forward comparison.
For doctests run following command:
python3 -m doctest -v insertion_sort.py
For manual testing run:
python3 insertion_sort.py
"""
def insertion_sort(collection: list) -> list:
"""A pure Python implementation of the insertion sort algorithm
:param collection: some mutable ordered collection with heterogeneous
comparable items inside
:return: the same collection ordered by ascending
Examples:
>>> insertion_sort([0, 5, 3, 2, 2])
[0, 2, 2, 3, 5]
>>> insertion_sort([]) == sorted([])
True
>>> insertion_sort([-2, -5, -45]) == sorted([-2, -5, -45])
True
>>> insertion_sort(['d', 'a', 'b', 'e', 'c']) == sorted(['d', 'a', 'b', 'e', 'c'])
True
>>> import random
>>> collection = random.sample(range(-50, 50), 100)
>>> insertion_sort(collection) == sorted(collection)
True
>>> import string
>>> collection = random.choices(string.ascii_letters + string.digits, k=100)
>>> insertion_sort(collection) == sorted(collection)
True
"""
for insert_index, insert_value in enumerate(collection[1:]):
temp_index = insert_index
while insert_index >= 0 and insert_value < collection[insert_index]:
collection[insert_index + 1] = collection[insert_index]
insert_index -= 1
if insert_index != temp_index:
collection[insert_index + 1] = insert_value
return collection
if __name__ == "__main__":
from doctest import testmod
testmod()
user_input = input("Enter numbers separated by a comma:\n").strip()
unsorted = [int(item) for item in user_input.split(",")]
print(f"{insertion_sort(unsorted) = }")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Pure Python implementation of the jump search algorithm.
This algorithm iterates through a sorted collection with a step of n^(1/2),
until the element compared is bigger than the one searched.
It will then perform a linear search until it matches the wanted number.
If not found, it returns -1.
"""
import math
def jump_search(arr: list, x: int) -> int:
"""
Pure Python implementation of the jump search algorithm.
Examples:
>>> jump_search([0, 1, 2, 3, 4, 5], 3)
3
>>> jump_search([-5, -2, -1], -1)
2
>>> jump_search([0, 5, 10, 20], 8)
-1
>>> jump_search([0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610], 55)
10
"""
n = len(arr)
step = int(math.floor(math.sqrt(n)))
prev = 0
while arr[min(step, n) - 1] < x:
prev = step
step += int(math.floor(math.sqrt(n)))
if prev >= n:
return -1
while arr[prev] < x:
prev = prev + 1
if prev == min(step, n):
return -1
if arr[prev] == x:
return prev
return -1
if __name__ == "__main__":
user_input = input("Enter numbers separated by a comma:\n").strip()
arr = [int(item) for item in user_input.split(",")]
x = int(input("Enter the number to be searched:\n"))
res = jump_search(arr, x)
if res == -1:
print("Number not found!")
else:
print(f"Number {x} is at index {res}")
| """
Pure Python implementation of the jump search algorithm.
This algorithm iterates through a sorted collection with a step of n^(1/2),
until the element compared is bigger than the one searched.
It will then perform a linear search until it matches the wanted number.
If not found, it returns -1.
"""
import math
def jump_search(arr: list, x: int) -> int:
"""
Pure Python implementation of the jump search algorithm.
Examples:
>>> jump_search([0, 1, 2, 3, 4, 5], 3)
3
>>> jump_search([-5, -2, -1], -1)
2
>>> jump_search([0, 5, 10, 20], 8)
-1
>>> jump_search([0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610], 55)
10
"""
n = len(arr)
step = int(math.floor(math.sqrt(n)))
prev = 0
while arr[min(step, n) - 1] < x:
prev = step
step += int(math.floor(math.sqrt(n)))
if prev >= n:
return -1
while arr[prev] < x:
prev = prev + 1
if prev == min(step, n):
return -1
if arr[prev] == x:
return prev
return -1
if __name__ == "__main__":
user_input = input("Enter numbers separated by a comma:\n").strip()
arr = [int(item) for item in user_input.split(",")]
x = int(input("Enter the number to be searched:\n"))
res = jump_search(arr, x)
if res == -1:
print("Number not found!")
else:
print(f"Number {x} is at index {res}")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
https://en.wikipedia.org/wiki/Rayleigh_quotient
"""
import numpy as np
def is_hermitian(matrix: np.array) -> bool:
"""
Checks if a matrix is Hermitian.
>>> import numpy as np
>>> A = np.array([
... [2, 2+1j, 4],
... [2-1j, 3, 1j],
... [4, -1j, 1]])
>>> is_hermitian(A)
True
>>> A = np.array([
... [2, 2+1j, 4+1j],
... [2-1j, 3, 1j],
... [4, -1j, 1]])
>>> is_hermitian(A)
False
"""
return np.array_equal(matrix, matrix.conjugate().T)
def rayleigh_quotient(A: np.array, v: np.array) -> float:
"""
Returns the Rayleigh quotient of a Hermitian matrix A and
vector v.
>>> import numpy as np
>>> A = np.array([
... [1, 2, 4],
... [2, 3, -1],
... [4, -1, 1]
... ])
>>> v = np.array([
... [1],
... [2],
... [3]
... ])
>>> rayleigh_quotient(A, v)
array([[3.]])
"""
v_star = v.conjugate().T
return (v_star.dot(A).dot(v)) / (v_star.dot(v))
def tests() -> None:
A = np.array([[2, 2 + 1j, 4], [2 - 1j, 3, 1j], [4, -1j, 1]])
v = np.array([[1], [2], [3]])
assert is_hermitian(A), f"{A} is not hermitian."
print(rayleigh_quotient(A, v))
A = np.array([[1, 2, 4], [2, 3, -1], [4, -1, 1]])
assert is_hermitian(A), f"{A} is not hermitian."
assert rayleigh_quotient(A, v) == float(3)
if __name__ == "__main__":
import doctest
doctest.testmod()
tests()
| """
https://en.wikipedia.org/wiki/Rayleigh_quotient
"""
import numpy as np
def is_hermitian(matrix: np.array) -> bool:
"""
Checks if a matrix is Hermitian.
>>> import numpy as np
>>> A = np.array([
... [2, 2+1j, 4],
... [2-1j, 3, 1j],
... [4, -1j, 1]])
>>> is_hermitian(A)
True
>>> A = np.array([
... [2, 2+1j, 4+1j],
... [2-1j, 3, 1j],
... [4, -1j, 1]])
>>> is_hermitian(A)
False
"""
return np.array_equal(matrix, matrix.conjugate().T)
def rayleigh_quotient(A: np.array, v: np.array) -> float:
"""
Returns the Rayleigh quotient of a Hermitian matrix A and
vector v.
>>> import numpy as np
>>> A = np.array([
... [1, 2, 4],
... [2, 3, -1],
... [4, -1, 1]
... ])
>>> v = np.array([
... [1],
... [2],
... [3]
... ])
>>> rayleigh_quotient(A, v)
array([[3.]])
"""
v_star = v.conjugate().T
return (v_star.dot(A).dot(v)) / (v_star.dot(v))
def tests() -> None:
A = np.array([[2, 2 + 1j, 4], [2 - 1j, 3, 1j], [4, -1j, 1]])
v = np.array([[1], [2], [3]])
assert is_hermitian(A), f"{A} is not hermitian."
print(rayleigh_quotient(A, v))
A = np.array([[1, 2, 4], [2, 3, -1], [4, -1, 1]])
assert is_hermitian(A), f"{A} is not hermitian."
assert rayleigh_quotient(A, v) == float(3)
if __name__ == "__main__":
import doctest
doctest.testmod()
tests()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
The Reverse Polish Nation also known as Polish postfix notation
or simply postfix notation.
https://en.wikipedia.org/wiki/Reverse_Polish_notation
Classic examples of simple stack implementations
Valid operators are +, -, *, /.
Each operand may be an integer or another expression.
"""
def evaluate_postfix(postfix_notation: list) -> int:
"""
>>> evaluate_postfix(["2", "1", "+", "3", "*"])
9
>>> evaluate_postfix(["4", "13", "5", "/", "+"])
6
>>> evaluate_postfix([])
0
"""
if not postfix_notation:
return 0
operations = {"+", "-", "*", "/"}
stack = []
for token in postfix_notation:
if token in operations:
b, a = stack.pop(), stack.pop()
if token == "+":
stack.append(a + b)
elif token == "-":
stack.append(a - b)
elif token == "*":
stack.append(a * b)
else:
if a * b < 0 and a % b != 0:
stack.append(a // b + 1)
else:
stack.append(a // b)
else:
stack.append(int(token))
return stack.pop()
if __name__ == "__main__":
import doctest
doctest.testmod()
| """
The Reverse Polish Nation also known as Polish postfix notation
or simply postfix notation.
https://en.wikipedia.org/wiki/Reverse_Polish_notation
Classic examples of simple stack implementations
Valid operators are +, -, *, /.
Each operand may be an integer or another expression.
"""
def evaluate_postfix(postfix_notation: list) -> int:
"""
>>> evaluate_postfix(["2", "1", "+", "3", "*"])
9
>>> evaluate_postfix(["4", "13", "5", "/", "+"])
6
>>> evaluate_postfix([])
0
"""
if not postfix_notation:
return 0
operations = {"+", "-", "*", "/"}
stack = []
for token in postfix_notation:
if token in operations:
b, a = stack.pop(), stack.pop()
if token == "+":
stack.append(a + b)
elif token == "-":
stack.append(a - b)
elif token == "*":
stack.append(a * b)
else:
if a * b < 0 and a % b != 0:
stack.append(a // b + 1)
else:
stack.append(a // b)
else:
stack.append(int(token))
return stack.pop()
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| import json
import requests
from .fetch_github_info import AUTHENTICATED_USER_ENDPOINT, fetch_github_info
def test_fetch_github_info(monkeypatch):
class FakeResponse:
def __init__(self, content) -> None:
assert isinstance(content, (bytes, str))
self.content = content
def json(self):
return json.loads(self.content)
def mock_response(*args, **kwargs):
assert args[0] == AUTHENTICATED_USER_ENDPOINT
assert "Authorization" in kwargs["headers"]
assert kwargs["headers"]["Authorization"].startswith("token ")
assert "Accept" in kwargs["headers"]
return FakeResponse(b'{"login":"test","id":1}')
monkeypatch.setattr(requests, "get", mock_response)
result = fetch_github_info("token")
assert result["login"] == "test"
assert result["id"] == 1
| import json
import requests
from .fetch_github_info import AUTHENTICATED_USER_ENDPOINT, fetch_github_info
def test_fetch_github_info(monkeypatch):
class FakeResponse:
def __init__(self, content) -> None:
assert isinstance(content, (bytes, str))
self.content = content
def json(self):
return json.loads(self.content)
def mock_response(*args, **kwargs):
assert args[0] == AUTHENTICATED_USER_ENDPOINT
assert "Authorization" in kwargs["headers"]
assert kwargs["headers"]["Authorization"].startswith("token ")
assert "Accept" in kwargs["headers"]
return FakeResponse(b'{"login":"test","id":1}')
monkeypatch.setattr(requests, "get", mock_response)
result = fetch_github_info("token")
assert result["login"] == "test"
assert result["id"] == 1
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
python/black : True
"""
from __future__ import annotations
def prime_factors(n: int) -> list[int]:
"""
Returns prime factors of n as a list.
>>> prime_factors(0)
[]
>>> prime_factors(100)
[2, 2, 5, 5]
>>> prime_factors(2560)
[2, 2, 2, 2, 2, 2, 2, 2, 2, 5]
>>> prime_factors(10**-2)
[]
>>> prime_factors(0.02)
[]
>>> x = prime_factors(10**241) # doctest: +NORMALIZE_WHITESPACE
>>> x == [2]*241 + [5]*241
True
>>> prime_factors(10**-354)
[]
>>> prime_factors('hello')
Traceback (most recent call last):
...
TypeError: '<=' not supported between instances of 'int' and 'str'
>>> prime_factors([1,2,'hello'])
Traceback (most recent call last):
...
TypeError: '<=' not supported between instances of 'int' and 'list'
"""
i = 2
factors = []
while i * i <= n:
if n % i:
i += 1
else:
n //= i
factors.append(i)
if n > 1:
factors.append(n)
return factors
if __name__ == "__main__":
import doctest
doctest.testmod()
| """
python/black : True
"""
from __future__ import annotations
def prime_factors(n: int) -> list[int]:
"""
Returns prime factors of n as a list.
>>> prime_factors(0)
[]
>>> prime_factors(100)
[2, 2, 5, 5]
>>> prime_factors(2560)
[2, 2, 2, 2, 2, 2, 2, 2, 2, 5]
>>> prime_factors(10**-2)
[]
>>> prime_factors(0.02)
[]
>>> x = prime_factors(10**241) # doctest: +NORMALIZE_WHITESPACE
>>> x == [2]*241 + [5]*241
True
>>> prime_factors(10**-354)
[]
>>> prime_factors('hello')
Traceback (most recent call last):
...
TypeError: '<=' not supported between instances of 'int' and 'str'
>>> prime_factors([1,2,'hello'])
Traceback (most recent call last):
...
TypeError: '<=' not supported between instances of 'int' and 'list'
"""
i = 2
factors = []
while i * i <= n:
if n % i:
i += 1
else:
n //= i
factors.append(i)
if n > 1:
factors.append(n)
return factors
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Project Euler Problem 56: https://projecteuler.net/problem=56
A googol (10^100) is a massive number: one followed by one-hundred zeros;
100^100 is almost unimaginably large: one followed by two-hundred zeros.
Despite their size, the sum of the digits in each number is only 1.
Considering natural numbers of the form, ab, where a, b < 100,
what is the maximum digital sum?
"""
def solution(a: int = 100, b: int = 100) -> int:
"""
Considering natural numbers of the form, a**b, where a, b < 100,
what is the maximum digital sum?
:param a:
:param b:
:return:
>>> solution(10,10)
45
>>> solution(100,100)
972
>>> solution(100,200)
1872
"""
# RETURN the MAXIMUM from the list of SUMs of the list of INT converted from STR of
# BASE raised to the POWER
return max(
[
sum([int(x) for x in str(base ** power)])
for base in range(a)
for power in range(b)
]
)
# Tests
if __name__ == "__main__":
import doctest
doctest.testmod()
| """
Project Euler Problem 56: https://projecteuler.net/problem=56
A googol (10^100) is a massive number: one followed by one-hundred zeros;
100^100 is almost unimaginably large: one followed by two-hundred zeros.
Despite their size, the sum of the digits in each number is only 1.
Considering natural numbers of the form, ab, where a, b < 100,
what is the maximum digital sum?
"""
def solution(a: int = 100, b: int = 100) -> int:
"""
Considering natural numbers of the form, a**b, where a, b < 100,
what is the maximum digital sum?
:param a:
:param b:
:return:
>>> solution(10,10)
45
>>> solution(100,100)
972
>>> solution(100,200)
1872
"""
# RETURN the MAXIMUM from the list of SUMs of the list of INT converted from STR of
# BASE raised to the POWER
return max(
[
sum([int(x) for x in str(base ** power)])
for base in range(a)
for power in range(b)
]
)
# Tests
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| from typing import List
def kmp(pattern: str, text: str) -> bool:
"""
The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text
with complexity O(n + m)
1) Preprocess pattern to identify any suffixes that are identical to prefixes
This tells us where to continue from if we get a mismatch between a character
in our pattern and the text.
2) Step through the text one character at a time and compare it to a character in
the pattern updating our location within the pattern if necessary
"""
# 1) Construct the failure array
failure = get_failure_array(pattern)
# 2) Step through text searching for pattern
i, j = 0, 0 # index into text, pattern
while i < len(text):
if pattern[j] == text[i]:
if j == (len(pattern) - 1):
return True
j += 1
# if this is a prefix in our pattern
# just go back far enough to continue
elif j > 0:
j = failure[j - 1]
continue
i += 1
return False
def get_failure_array(pattern: str) -> List[int]:
"""
Calculates the new index we should go to if we fail a comparison
:param pattern:
:return:
"""
failure = [0]
i = 0
j = 1
while j < len(pattern):
if pattern[i] == pattern[j]:
i += 1
elif i > 0:
i = failure[i - 1]
continue
j += 1
failure.append(i)
return failure
if __name__ == "__main__":
# Test 1)
pattern = "abc1abc12"
text1 = "alskfjaldsabc1abc1abc12k23adsfabcabc"
text2 = "alskfjaldsk23adsfabcabc"
assert kmp(pattern, text1) and not kmp(pattern, text2)
# Test 2)
pattern = "ABABX"
text = "ABABZABABYABABX"
assert kmp(pattern, text)
# Test 3)
pattern = "AAAB"
text = "ABAAAAAB"
assert kmp(pattern, text)
# Test 4)
pattern = "abcdabcy"
text = "abcxabcdabxabcdabcdabcy"
assert kmp(pattern, text)
# Test 5)
pattern = "aabaabaaa"
assert get_failure_array(pattern) == [0, 1, 0, 1, 2, 3, 4, 5, 2]
| from typing import List
def kmp(pattern: str, text: str) -> bool:
"""
The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text
with complexity O(n + m)
1) Preprocess pattern to identify any suffixes that are identical to prefixes
This tells us where to continue from if we get a mismatch between a character
in our pattern and the text.
2) Step through the text one character at a time and compare it to a character in
the pattern updating our location within the pattern if necessary
"""
# 1) Construct the failure array
failure = get_failure_array(pattern)
# 2) Step through text searching for pattern
i, j = 0, 0 # index into text, pattern
while i < len(text):
if pattern[j] == text[i]:
if j == (len(pattern) - 1):
return True
j += 1
# if this is a prefix in our pattern
# just go back far enough to continue
elif j > 0:
j = failure[j - 1]
continue
i += 1
return False
def get_failure_array(pattern: str) -> List[int]:
"""
Calculates the new index we should go to if we fail a comparison
:param pattern:
:return:
"""
failure = [0]
i = 0
j = 1
while j < len(pattern):
if pattern[i] == pattern[j]:
i += 1
elif i > 0:
i = failure[i - 1]
continue
j += 1
failure.append(i)
return failure
if __name__ == "__main__":
# Test 1)
pattern = "abc1abc12"
text1 = "alskfjaldsabc1abc1abc12k23adsfabcabc"
text2 = "alskfjaldsk23adsfabcabc"
assert kmp(pattern, text1) and not kmp(pattern, text2)
# Test 2)
pattern = "ABABX"
text = "ABABZABABYABABX"
assert kmp(pattern, text)
# Test 3)
pattern = "AAAB"
text = "ABAAAAAB"
assert kmp(pattern, text)
# Test 4)
pattern = "abcdabcy"
text = "abcxabcdabxabcdabcdabcy"
assert kmp(pattern, text)
# Test 5)
pattern = "aabaabaaa"
assert get_failure_array(pattern) == [0, 1, 0, 1, 2, 3, 4, 5, 2]
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Problem 34: https://projecteuler.net/problem=34
145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.
Find the sum of all numbers which are equal to the sum of the factorial of their digits.
Note: As 1! = 1 and 2! = 2 are not sums they are not included.
"""
from math import factorial
def sum_of_digit_factorial(n: int) -> int:
"""
Returns the sum of the digits in n
>>> sum_of_digit_factorial(15)
121
>>> sum_of_digit_factorial(0)
1
"""
return sum(factorial(int(char)) for char in str(n))
def solution() -> int:
"""
Returns the sum of all numbers whose
sum of the factorials of all digits
add up to the number itself.
>>> solution()
40730
"""
limit = 7 * factorial(9) + 1
return sum(i for i in range(3, limit) if sum_of_digit_factorial(i) == i)
if __name__ == "__main__":
print(f"{solution()} = ")
| """
Problem 34: https://projecteuler.net/problem=34
145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.
Find the sum of all numbers which are equal to the sum of the factorial of their digits.
Note: As 1! = 1 and 2! = 2 are not sums they are not included.
"""
from math import factorial
def sum_of_digit_factorial(n: int) -> int:
"""
Returns the sum of the digits in n
>>> sum_of_digit_factorial(15)
121
>>> sum_of_digit_factorial(0)
1
"""
return sum(factorial(int(char)) for char in str(n))
def solution() -> int:
"""
Returns the sum of all numbers whose
sum of the factorials of all digits
add up to the number itself.
>>> solution()
40730
"""
limit = 7 * factorial(9) + 1
return sum(i for i in range(3, limit) if sum_of_digit_factorial(i) == i)
if __name__ == "__main__":
print(f"{solution()} = ")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| def bailey_borwein_plouffe(digit_position: int, precision: int = 1000) -> str:
"""
Implement a popular pi-digit-extraction algorithm known as the
Bailey-Borwein-Plouffe (BBP) formula to calculate the nth hex digit of pi.
Wikipedia page:
https://en.wikipedia.org/wiki/Bailey%E2%80%93Borwein%E2%80%93Plouffe_formula
@param digit_position: a positive integer representing the position of the digit to
extract.
The digit immediately after the decimal point is located at position 1.
@param precision: number of terms in the second summation to calculate.
A higher number reduces the chance of an error but increases the runtime.
@return: a hexadecimal digit representing the digit at the nth position
in pi's decimal expansion.
>>> "".join(bailey_borwein_plouffe(i) for i in range(1, 11))
'243f6a8885'
>>> bailey_borwein_plouffe(5, 10000)
'6'
>>> bailey_borwein_plouffe(-10)
Traceback (most recent call last):
...
ValueError: Digit position must be a positive integer
>>> bailey_borwein_plouffe(0)
Traceback (most recent call last):
...
ValueError: Digit position must be a positive integer
>>> bailey_borwein_plouffe(1.7)
Traceback (most recent call last):
...
ValueError: Digit position must be a positive integer
>>> bailey_borwein_plouffe(2, -10)
Traceback (most recent call last):
...
ValueError: Precision must be a nonnegative integer
>>> bailey_borwein_plouffe(2, 1.6)
Traceback (most recent call last):
...
ValueError: Precision must be a nonnegative integer
"""
if (not isinstance(digit_position, int)) or (digit_position <= 0):
raise ValueError("Digit position must be a positive integer")
elif (not isinstance(precision, int)) or (precision < 0):
raise ValueError("Precision must be a nonnegative integer")
# compute an approximation of (16 ** (n - 1)) * pi whose fractional part is mostly
# accurate
sum_result = (
4 * _subsum(digit_position, 1, precision)
- 2 * _subsum(digit_position, 4, precision)
- _subsum(digit_position, 5, precision)
- _subsum(digit_position, 6, precision)
)
# return the first hex digit of the fractional part of the result
return hex(int((sum_result % 1) * 16))[2:]
def _subsum(
digit_pos_to_extract: int, denominator_addend: int, precision: int
) -> float:
# only care about first digit of fractional part; don't need decimal
"""
Private helper function to implement the summation
functionality.
@param digit_pos_to_extract: digit position to extract
@param denominator_addend: added to denominator of fractions in the formula
@param precision: same as precision in main function
@return: floating-point number whose integer part is not important
"""
sum = 0.0
for sum_index in range(digit_pos_to_extract + precision):
denominator = 8 * sum_index + denominator_addend
exponential_term = 0.0
if sum_index < digit_pos_to_extract:
# if the exponential term is an integer and we mod it by the denominator
# before dividing, only the integer part of the sum will change;
# the fractional part will not
exponential_term = pow(
16, digit_pos_to_extract - 1 - sum_index, denominator
)
else:
exponential_term = pow(16, digit_pos_to_extract - 1 - sum_index)
sum += exponential_term / denominator
return sum
if __name__ == "__main__":
import doctest
doctest.testmod()
| def bailey_borwein_plouffe(digit_position: int, precision: int = 1000) -> str:
"""
Implement a popular pi-digit-extraction algorithm known as the
Bailey-Borwein-Plouffe (BBP) formula to calculate the nth hex digit of pi.
Wikipedia page:
https://en.wikipedia.org/wiki/Bailey%E2%80%93Borwein%E2%80%93Plouffe_formula
@param digit_position: a positive integer representing the position of the digit to
extract.
The digit immediately after the decimal point is located at position 1.
@param precision: number of terms in the second summation to calculate.
A higher number reduces the chance of an error but increases the runtime.
@return: a hexadecimal digit representing the digit at the nth position
in pi's decimal expansion.
>>> "".join(bailey_borwein_plouffe(i) for i in range(1, 11))
'243f6a8885'
>>> bailey_borwein_plouffe(5, 10000)
'6'
>>> bailey_borwein_plouffe(-10)
Traceback (most recent call last):
...
ValueError: Digit position must be a positive integer
>>> bailey_borwein_plouffe(0)
Traceback (most recent call last):
...
ValueError: Digit position must be a positive integer
>>> bailey_borwein_plouffe(1.7)
Traceback (most recent call last):
...
ValueError: Digit position must be a positive integer
>>> bailey_borwein_plouffe(2, -10)
Traceback (most recent call last):
...
ValueError: Precision must be a nonnegative integer
>>> bailey_borwein_plouffe(2, 1.6)
Traceback (most recent call last):
...
ValueError: Precision must be a nonnegative integer
"""
if (not isinstance(digit_position, int)) or (digit_position <= 0):
raise ValueError("Digit position must be a positive integer")
elif (not isinstance(precision, int)) or (precision < 0):
raise ValueError("Precision must be a nonnegative integer")
# compute an approximation of (16 ** (n - 1)) * pi whose fractional part is mostly
# accurate
sum_result = (
4 * _subsum(digit_position, 1, precision)
- 2 * _subsum(digit_position, 4, precision)
- _subsum(digit_position, 5, precision)
- _subsum(digit_position, 6, precision)
)
# return the first hex digit of the fractional part of the result
return hex(int((sum_result % 1) * 16))[2:]
def _subsum(
digit_pos_to_extract: int, denominator_addend: int, precision: int
) -> float:
# only care about first digit of fractional part; don't need decimal
"""
Private helper function to implement the summation
functionality.
@param digit_pos_to_extract: digit position to extract
@param denominator_addend: added to denominator of fractions in the formula
@param precision: same as precision in main function
@return: floating-point number whose integer part is not important
"""
sum = 0.0
for sum_index in range(digit_pos_to_extract + precision):
denominator = 8 * sum_index + denominator_addend
exponential_term = 0.0
if sum_index < digit_pos_to_extract:
# if the exponential term is an integer and we mod it by the denominator
# before dividing, only the integer part of the sum will change;
# the fractional part will not
exponential_term = pow(
16, digit_pos_to_extract - 1 - sum_index, denominator
)
else:
exponential_term = pow(16, digit_pos_to_extract - 1 - sum_index)
sum += exponential_term / denominator
return sum
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Problem 120 Square remainders: https://projecteuler.net/problem=120
Description:
Let r be the remainder when (a−1)^n + (a+1)^n is divided by a^2.
For example, if a = 7 and n = 3, then r = 42: 6^3 + 8^3 = 728 ≡ 42 mod 49.
And as n varies, so too will r, but for a = 7 it turns out that r_max = 42.
For 3 ≤ a ≤ 1000, find ∑ r_max.
Solution:
On expanding the terms, we get 2 if n is even and 2an if n is odd.
For maximizing the value, 2an < a*a => n <= (a - 1)/2 (integer division)
"""
def solution(n: int = 1000) -> int:
"""
Returns ∑ r_max for 3 <= a <= n as explained above
>>> solution(10)
300
>>> solution(100)
330750
>>> solution(1000)
333082500
"""
return sum(2 * a * ((a - 1) // 2) for a in range(3, n + 1))
if __name__ == "__main__":
print(solution())
| """
Problem 120 Square remainders: https://projecteuler.net/problem=120
Description:
Let r be the remainder when (a−1)^n + (a+1)^n is divided by a^2.
For example, if a = 7 and n = 3, then r = 42: 6^3 + 8^3 = 728 ≡ 42 mod 49.
And as n varies, so too will r, but for a = 7 it turns out that r_max = 42.
For 3 ≤ a ≤ 1000, find ∑ r_max.
Solution:
On expanding the terms, we get 2 if n is even and 2an if n is odd.
For maximizing the value, 2an < a*a => n <= (a - 1)/2 (integer division)
"""
def solution(n: int = 1000) -> int:
"""
Returns ∑ r_max for 3 <= a <= n as explained above
>>> solution(10)
300
>>> solution(100)
330750
>>> solution(1000)
333082500
"""
return sum(2 * a * ((a - 1) // 2) for a in range(3, n + 1))
if __name__ == "__main__":
print(solution())
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Project Euler Problem 4: https://projecteuler.net/problem=4
Largest palindrome product
A palindromic number reads the same both ways. The largest palindrome made
from the product of two 2-digit numbers is 9009 = 91 × 99.
Find the largest palindrome made from the product of two 3-digit numbers.
References:
- https://en.wikipedia.org/wiki/Palindromic_number
"""
def solution(n: int = 998001) -> int:
"""
Returns the largest palindrome made from the product of two 3-digit
numbers which is less than n.
>>> solution(20000)
19591
>>> solution(30000)
29992
>>> solution(40000)
39893
>>> solution(10000)
Traceback (most recent call last):
...
ValueError: That number is larger than our acceptable range.
"""
# fetches the next number
for number in range(n - 1, 9999, -1):
str_number = str(number)
# checks whether 'str_number' is a palindrome.
if str_number == str_number[::-1]:
divisor = 999
# if 'number' is a product of two 3-digit numbers
# then number is the answer otherwise fetch next number.
while divisor != 99:
if (number % divisor == 0) and (len(str(number // divisor)) == 3.0):
return number
divisor -= 1
raise ValueError("That number is larger than our acceptable range.")
if __name__ == "__main__":
print(f"{solution() = }")
| """
Project Euler Problem 4: https://projecteuler.net/problem=4
Largest palindrome product
A palindromic number reads the same both ways. The largest palindrome made
from the product of two 2-digit numbers is 9009 = 91 × 99.
Find the largest palindrome made from the product of two 3-digit numbers.
References:
- https://en.wikipedia.org/wiki/Palindromic_number
"""
def solution(n: int = 998001) -> int:
"""
Returns the largest palindrome made from the product of two 3-digit
numbers which is less than n.
>>> solution(20000)
19591
>>> solution(30000)
29992
>>> solution(40000)
39893
>>> solution(10000)
Traceback (most recent call last):
...
ValueError: That number is larger than our acceptable range.
"""
# fetches the next number
for number in range(n - 1, 9999, -1):
str_number = str(number)
# checks whether 'str_number' is a palindrome.
if str_number == str_number[::-1]:
divisor = 999
# if 'number' is a product of two 3-digit numbers
# then number is the answer otherwise fetch next number.
while divisor != 99:
if (number % divisor == 0) and (len(str(number // divisor)) == 3.0):
return number
divisor -= 1
raise ValueError("That number is larger than our acceptable range.")
if __name__ == "__main__":
print(f"{solution() = }")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Project Euler Problem 1: https://projecteuler.net/problem=1
Multiples of 3 and 5
If we list all the natural numbers below 10 that are multiples of 3 or 5,
we get 3, 5, 6 and 9. The sum of these multiples is 23.
Find the sum of all the multiples of 3 or 5 below 1000.
"""
def solution(n: int = 1000) -> int:
"""
Returns the sum of all the multiples of 3 or 5 below n.
>>> solution(3)
0
>>> solution(4)
3
>>> solution(10)
23
>>> solution(600)
83700
"""
total = 0
terms = (n - 1) // 3
total += ((terms) * (6 + (terms - 1) * 3)) // 2 # total of an A.P.
terms = (n - 1) // 5
total += ((terms) * (10 + (terms - 1) * 5)) // 2
terms = (n - 1) // 15
total -= ((terms) * (30 + (terms - 1) * 15)) // 2
return total
if __name__ == "__main__":
print(f"{solution() = }")
| """
Project Euler Problem 1: https://projecteuler.net/problem=1
Multiples of 3 and 5
If we list all the natural numbers below 10 that are multiples of 3 or 5,
we get 3, 5, 6 and 9. The sum of these multiples is 23.
Find the sum of all the multiples of 3 or 5 below 1000.
"""
def solution(n: int = 1000) -> int:
"""
Returns the sum of all the multiples of 3 or 5 below n.
>>> solution(3)
0
>>> solution(4)
3
>>> solution(10)
23
>>> solution(600)
83700
"""
total = 0
terms = (n - 1) // 3
total += ((terms) * (6 + (terms - 1) * 3)) // 2 # total of an A.P.
terms = (n - 1) // 5
total += ((terms) * (10 + (terms - 1) * 5)) // 2
terms = (n - 1) // 15
total -= ((terms) * (30 + (terms - 1) * 15)) // 2
return total
if __name__ == "__main__":
print(f"{solution() = }")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
In this problem, we want to determine all possible permutations
of the given sequence. We use backtracking to solve this problem.
Time complexity: O(n! * n),
where n denotes the length of the given sequence.
"""
from typing import List, Union
def generate_all_permutations(sequence: List[Union[int, str]]) -> None:
create_state_space_tree(sequence, [], 0, [0 for i in range(len(sequence))])
def create_state_space_tree(
sequence: List[Union[int, str]],
current_sequence: List[Union[int, str]],
index: int,
index_used: List[int],
) -> None:
"""
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly len(sequence) - index children.
It terminates when it reaches the end of the given sequence.
"""
if index == len(sequence):
print(current_sequence)
return
for i in range(len(sequence)):
if not index_used[i]:
current_sequence.append(sequence[i])
index_used[i] = True
create_state_space_tree(sequence, current_sequence, index + 1, index_used)
current_sequence.pop()
index_used[i] = False
"""
remove the comment to take an input from the user
print("Enter the elements")
sequence = list(map(int, input().split()))
"""
sequence: List[Union[int, str]] = [3, 1, 2, 4]
generate_all_permutations(sequence)
sequence_2: List[Union[int, str]] = ["A", "B", "C"]
generate_all_permutations(sequence_2)
| """
In this problem, we want to determine all possible permutations
of the given sequence. We use backtracking to solve this problem.
Time complexity: O(n! * n),
where n denotes the length of the given sequence.
"""
from typing import List, Union
def generate_all_permutations(sequence: List[Union[int, str]]) -> None:
create_state_space_tree(sequence, [], 0, [0 for i in range(len(sequence))])
def create_state_space_tree(
sequence: List[Union[int, str]],
current_sequence: List[Union[int, str]],
index: int,
index_used: List[int],
) -> None:
"""
Creates a state space tree to iterate through each branch using DFS.
We know that each state has exactly len(sequence) - index children.
It terminates when it reaches the end of the given sequence.
"""
if index == len(sequence):
print(current_sequence)
return
for i in range(len(sequence)):
if not index_used[i]:
current_sequence.append(sequence[i])
index_used[i] = True
create_state_space_tree(sequence, current_sequence, index + 1, index_used)
current_sequence.pop()
index_used[i] = False
"""
remove the comment to take an input from the user
print("Enter the elements")
sequence = list(map(int, input().split()))
"""
sequence: List[Union[int, str]] = [3, 1, 2, 4]
generate_all_permutations(sequence)
sequence_2: List[Union[int, str]] = ["A", "B", "C"]
generate_all_permutations(sequence_2)
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| from typing import Callable
def bisection(function: Callable[[float], float], a: float, b: float) -> float:
"""
finds where function becomes 0 in [a,b] using bolzano
>>> bisection(lambda x: x ** 3 - 1, -5, 5)
1.0000000149011612
>>> bisection(lambda x: x ** 3 - 1, 2, 1000)
Traceback (most recent call last):
...
ValueError: could not find root in given interval.
>>> bisection(lambda x: x ** 2 - 4 * x + 3, 0, 2)
1.0
>>> bisection(lambda x: x ** 2 - 4 * x + 3, 2, 4)
3.0
>>> bisection(lambda x: x ** 2 - 4 * x + 3, 4, 1000)
Traceback (most recent call last):
...
ValueError: could not find root in given interval.
"""
start: float = a
end: float = b
if function(a) == 0: # one of the a or b is a root for the function
return a
elif function(b) == 0:
return b
elif (
function(a) * function(b) > 0
): # if none of these are root and they are both positive or negative,
# then this algorithm can't find the root
raise ValueError("could not find root in given interval.")
else:
mid: float = start + (end - start) / 2.0
while abs(start - mid) > 10 ** -7: # until precisely equals to 10^-7
if function(mid) == 0:
return mid
elif function(mid) * function(start) < 0:
end = mid
else:
start = mid
mid = start + (end - start) / 2.0
return mid
def f(x: float) -> float:
return x ** 3 - 2 * x - 5
if __name__ == "__main__":
print(bisection(f, 1, 1000))
import doctest
doctest.testmod()
| from typing import Callable
def bisection(function: Callable[[float], float], a: float, b: float) -> float:
"""
finds where function becomes 0 in [a,b] using bolzano
>>> bisection(lambda x: x ** 3 - 1, -5, 5)
1.0000000149011612
>>> bisection(lambda x: x ** 3 - 1, 2, 1000)
Traceback (most recent call last):
...
ValueError: could not find root in given interval.
>>> bisection(lambda x: x ** 2 - 4 * x + 3, 0, 2)
1.0
>>> bisection(lambda x: x ** 2 - 4 * x + 3, 2, 4)
3.0
>>> bisection(lambda x: x ** 2 - 4 * x + 3, 4, 1000)
Traceback (most recent call last):
...
ValueError: could not find root in given interval.
"""
start: float = a
end: float = b
if function(a) == 0: # one of the a or b is a root for the function
return a
elif function(b) == 0:
return b
elif (
function(a) * function(b) > 0
): # if none of these are root and they are both positive or negative,
# then this algorithm can't find the root
raise ValueError("could not find root in given interval.")
else:
mid: float = start + (end - start) / 2.0
while abs(start - mid) > 10 ** -7: # until precisely equals to 10^-7
if function(mid) == 0:
return mid
elif function(mid) * function(start) < 0:
end = mid
else:
start = mid
mid = start + (end - start) / 2.0
return mid
def f(x: float) -> float:
return x ** 3 - 2 * x - 5
if __name__ == "__main__":
print(bisection(f, 1, 1000))
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Counting Sundays
Problem 19
You are given the following information, but you may prefer to do some research
for yourself.
1 Jan 1900 was a Monday.
Thirty days has September,
April, June and November.
All the rest have thirty-one,
Saving February alone,
Which has twenty-eight, rain or shine.
And on leap years, twenty-nine.
A leap year occurs on any year evenly divisible by 4, but not on a century
unless it is divisible by 400.
How many Sundays fell on the first of the month during the twentieth century
(1 Jan 1901 to 31 Dec 2000)?
"""
def solution():
"""Returns the number of mondays that fall on the first of the month during
the twentieth century (1 Jan 1901 to 31 Dec 2000)?
>>> solution()
171
"""
days_per_month = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]
day = 6
month = 1
year = 1901
sundays = 0
while year < 2001:
day += 7
if (year % 4 == 0 and not year % 100 == 0) or (year % 400 == 0):
if day > days_per_month[month - 1] and month != 2:
month += 1
day = day - days_per_month[month - 2]
elif day > 29 and month == 2:
month += 1
day = day - 29
else:
if day > days_per_month[month - 1]:
month += 1
day = day - days_per_month[month - 2]
if month > 12:
year += 1
month = 1
if year < 2001 and day == 1:
sundays += 1
return sundays
if __name__ == "__main__":
print(solution())
| """
Counting Sundays
Problem 19
You are given the following information, but you may prefer to do some research
for yourself.
1 Jan 1900 was a Monday.
Thirty days has September,
April, June and November.
All the rest have thirty-one,
Saving February alone,
Which has twenty-eight, rain or shine.
And on leap years, twenty-nine.
A leap year occurs on any year evenly divisible by 4, but not on a century
unless it is divisible by 400.
How many Sundays fell on the first of the month during the twentieth century
(1 Jan 1901 to 31 Dec 2000)?
"""
def solution():
"""Returns the number of mondays that fall on the first of the month during
the twentieth century (1 Jan 1901 to 31 Dec 2000)?
>>> solution()
171
"""
days_per_month = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]
day = 6
month = 1
year = 1901
sundays = 0
while year < 2001:
day += 7
if (year % 4 == 0 and not year % 100 == 0) or (year % 400 == 0):
if day > days_per_month[month - 1] and month != 2:
month += 1
day = day - days_per_month[month - 2]
elif day > 29 and month == 2:
month += 1
day = day - 29
else:
if day > days_per_month[month - 1]:
month += 1
day = day - days_per_month[month - 2]
if month > 12:
year += 1
month = 1
if year < 2001 and day == 1:
sundays += 1
return sundays
if __name__ == "__main__":
print(solution())
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
This is to show simple COVID19 info fetching from worldometers site using lxml
* The main motivation to use lxml in place of bs4 is that it is faster and therefore
more convenient to use in Python web projects (e.g. Django or Flask-based)
"""
from collections import namedtuple
import requests
from lxml import html # type: ignore
covid_data = namedtuple("covid_data", "cases deaths recovered")
def covid_stats(url: str = "https://www.worldometers.info/coronavirus/") -> covid_data:
xpath_str = '//div[@class = "maincounter-number"]/span/text()'
return covid_data(*html.fromstring(requests.get(url).content).xpath(xpath_str))
fmt = """Total COVID-19 cases in the world: {}
Total deaths due to COVID-19 in the world: {}
Total COVID-19 patients recovered in the world: {}"""
print(fmt.format(*covid_stats()))
| """
This is to show simple COVID19 info fetching from worldometers site using lxml
* The main motivation to use lxml in place of bs4 is that it is faster and therefore
more convenient to use in Python web projects (e.g. Django or Flask-based)
"""
from collections import namedtuple
import requests
from lxml import html # type: ignore
covid_data = namedtuple("covid_data", "cases deaths recovered")
def covid_stats(url: str = "https://www.worldometers.info/coronavirus/") -> covid_data:
xpath_str = '//div[@class = "maincounter-number"]/span/text()'
return covid_data(*html.fromstring(requests.get(url).content).xpath(xpath_str))
fmt = """Total COVID-19 cases in the world: {}
Total deaths due to COVID-19 in the world: {}
Total COVID-19 patients recovered in the world: {}"""
print(fmt.format(*covid_stats()))
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
The nested brackets problem is a problem that determines if a sequence of
brackets are properly nested. A sequence of brackets s is considered properly nested
if any of the following conditions are true:
- s is empty
- s has the form (U) or [U] or {U} where U is a properly nested string
- s has the form VW where V and W are properly nested strings
For example, the string "()()[()]" is properly nested but "[(()]" is not.
The function called is_balanced takes as input a string S which is a sequence of
brackets and returns true if S is nested and false otherwise.
"""
def is_balanced(S):
stack = []
open_brackets = set({"(", "[", "{"})
closed_brackets = set({")", "]", "}"})
open_to_closed = dict({"{": "}", "[": "]", "(": ")"})
for i in range(len(S)):
if S[i] in open_brackets:
stack.append(S[i])
elif S[i] in closed_brackets:
if len(stack) == 0 or (
len(stack) > 0 and open_to_closed[stack.pop()] != S[i]
):
return False
return len(stack) == 0
def main():
s = input("Enter sequence of brackets: ")
if is_balanced(s):
print(s, "is balanced")
else:
print(s, "is not balanced")
if __name__ == "__main__":
main()
| """
The nested brackets problem is a problem that determines if a sequence of
brackets are properly nested. A sequence of brackets s is considered properly nested
if any of the following conditions are true:
- s is empty
- s has the form (U) or [U] or {U} where U is a properly nested string
- s has the form VW where V and W are properly nested strings
For example, the string "()()[()]" is properly nested but "[(()]" is not.
The function called is_balanced takes as input a string S which is a sequence of
brackets and returns true if S is nested and false otherwise.
"""
def is_balanced(S):
stack = []
open_brackets = set({"(", "[", "{"})
closed_brackets = set({")", "]", "}"})
open_to_closed = dict({"{": "}", "[": "]", "(": ")"})
for i in range(len(S)):
if S[i] in open_brackets:
stack.append(S[i])
elif S[i] in closed_brackets:
if len(stack) == 0 or (
len(stack) > 0 and open_to_closed[stack.pop()] != S[i]
):
return False
return len(stack) == 0
def main():
s = input("Enter sequence of brackets: ")
if is_balanced(s):
print(s, "is balanced")
else:
print(s, "is not balanced")
if __name__ == "__main__":
main()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
https://en.wikipedia.org/wiki/String-searching_algorithm#Na%C3%AFve_string_search
this algorithm tries to find the pattern from every position of
the mainString if pattern is found from position i it add it to
the answer and does the same for position i+1
Complexity : O(n*m)
n=length of main string
m=length of pattern string
"""
def naive_pattern_search(s: str, pattern: str) -> list:
"""
>>> naive_pattern_search("ABAAABCDBBABCDDEBCABC", "ABC")
[4, 10, 18]
>>> naive_pattern_search("ABC", "ABAAABCDBBABCDDEBCABC")
[]
>>> naive_pattern_search("", "ABC")
[]
>>> naive_pattern_search("TEST", "TEST")
[0]
>>> naive_pattern_search("ABCDEGFTEST", "TEST")
[7]
"""
pat_len = len(pattern)
position = []
for i in range(len(s) - pat_len + 1):
match_found = True
for j in range(pat_len):
if s[i + j] != pattern[j]:
match_found = False
break
if match_found:
position.append(i)
return position
if __name__ == "__main__":
assert naive_pattern_search("ABCDEFG", "DE") == [3]
print(f"{naive_pattern_search('ABAAABCDBBABCDDEBCABC', 'ABC') = }")
| """
https://en.wikipedia.org/wiki/String-searching_algorithm#Na%C3%AFve_string_search
this algorithm tries to find the pattern from every position of
the mainString if pattern is found from position i it add it to
the answer and does the same for position i+1
Complexity : O(n*m)
n=length of main string
m=length of pattern string
"""
def naive_pattern_search(s: str, pattern: str) -> list:
"""
>>> naive_pattern_search("ABAAABCDBBABCDDEBCABC", "ABC")
[4, 10, 18]
>>> naive_pattern_search("ABC", "ABAAABCDBBABCDDEBCABC")
[]
>>> naive_pattern_search("", "ABC")
[]
>>> naive_pattern_search("TEST", "TEST")
[0]
>>> naive_pattern_search("ABCDEGFTEST", "TEST")
[7]
"""
pat_len = len(pattern)
position = []
for i in range(len(s) - pat_len + 1):
match_found = True
for j in range(pat_len):
if s[i + j] != pattern[j]:
match_found = False
break
if match_found:
position.append(i)
return position
if __name__ == "__main__":
assert naive_pattern_search("ABCDEFG", "DE") == [3]
print(f"{naive_pattern_search('ABAAABCDBBABCDDEBCABC', 'ABC') = }")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| import sys
import webbrowser
import requests
from bs4 import BeautifulSoup
from fake_useragent import UserAgent
if __name__ == "__main__":
print("Googling.....")
url = "https://www.google.com/search?q=" + " ".join(sys.argv[1:])
res = requests.get(url, headers={"UserAgent": UserAgent().random})
# res.raise_for_status()
with open("project1a.html", "wb") as out_file: # only for knowing the class
for data in res.iter_content(10000):
out_file.write(data)
soup = BeautifulSoup(res.text, "html.parser")
links = list(soup.select(".eZt8xd"))[:5]
print(len(links))
for link in links:
if link.text == "Maps":
webbrowser.open(link.get("href"))
else:
webbrowser.open(f"http://google.com{link.get('href')}")
| import sys
import webbrowser
import requests
from bs4 import BeautifulSoup
from fake_useragent import UserAgent
if __name__ == "__main__":
print("Googling.....")
url = "https://www.google.com/search?q=" + " ".join(sys.argv[1:])
res = requests.get(url, headers={"UserAgent": UserAgent().random})
# res.raise_for_status()
with open("project1a.html", "wb") as out_file: # only for knowing the class
for data in res.iter_content(10000):
out_file.write(data)
soup = BeautifulSoup(res.text, "html.parser")
links = list(soup.select(".eZt8xd"))[:5]
print(len(links))
for link in links:
if link.text == "Maps":
webbrowser.open(link.get("href"))
else:
webbrowser.open(f"http://google.com{link.get('href')}")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Checks if a system of forces is in static equilibrium.
"""
from typing import List
from numpy import array, cos, cross, radians, sin
def polar_force(
magnitude: float, angle: float, radian_mode: bool = False
) -> List[float]:
"""
Resolves force along rectangular components.
(force, angle) => (force_x, force_y)
>>> polar_force(10, 45)
[7.0710678118654755, 7.071067811865475]
>>> polar_force(10, 3.14, radian_mode=True)
[-9.999987317275394, 0.01592652916486828]
"""
if radian_mode:
return [magnitude * cos(angle), magnitude * sin(angle)]
return [magnitude * cos(radians(angle)), magnitude * sin(radians(angle))]
def in_static_equilibrium(
forces: array, location: array, eps: float = 10 ** -1
) -> bool:
"""
Check if a system is in equilibrium.
It takes two numpy.array objects.
forces ==> [
[force1_x, force1_y],
[force2_x, force2_y],
....]
location ==> [
[x1, y1],
[x2, y2],
....]
>>> force = array([[1, 1], [-1, 2]])
>>> location = array([[1, 0], [10, 0]])
>>> in_static_equilibrium(force, location)
False
"""
# summation of moments is zero
moments: array = cross(location, forces)
sum_moments: float = sum(moments)
return abs(sum_moments) < eps
if __name__ == "__main__":
# Test to check if it works
forces = array(
[polar_force(718.4, 180 - 30), polar_force(879.54, 45), polar_force(100, -90)]
)
location = array([[0, 0], [0, 0], [0, 0]])
assert in_static_equilibrium(forces, location)
# Problem 1 in image_data/2D_problems.jpg
forces = array(
[
polar_force(30 * 9.81, 15),
polar_force(215, 180 - 45),
polar_force(264, 90 - 30),
]
)
location = array([[0, 0], [0, 0], [0, 0]])
assert in_static_equilibrium(forces, location)
# Problem in image_data/2D_problems_1.jpg
forces = array([[0, -2000], [0, -1200], [0, 15600], [0, -12400]])
location = array([[0, 0], [6, 0], [10, 0], [12, 0]])
assert in_static_equilibrium(forces, location)
import doctest
doctest.testmod()
| """
Checks if a system of forces is in static equilibrium.
"""
from typing import List
from numpy import array, cos, cross, radians, sin
def polar_force(
magnitude: float, angle: float, radian_mode: bool = False
) -> List[float]:
"""
Resolves force along rectangular components.
(force, angle) => (force_x, force_y)
>>> polar_force(10, 45)
[7.0710678118654755, 7.071067811865475]
>>> polar_force(10, 3.14, radian_mode=True)
[-9.999987317275394, 0.01592652916486828]
"""
if radian_mode:
return [magnitude * cos(angle), magnitude * sin(angle)]
return [magnitude * cos(radians(angle)), magnitude * sin(radians(angle))]
def in_static_equilibrium(
forces: array, location: array, eps: float = 10 ** -1
) -> bool:
"""
Check if a system is in equilibrium.
It takes two numpy.array objects.
forces ==> [
[force1_x, force1_y],
[force2_x, force2_y],
....]
location ==> [
[x1, y1],
[x2, y2],
....]
>>> force = array([[1, 1], [-1, 2]])
>>> location = array([[1, 0], [10, 0]])
>>> in_static_equilibrium(force, location)
False
"""
# summation of moments is zero
moments: array = cross(location, forces)
sum_moments: float = sum(moments)
return abs(sum_moments) < eps
if __name__ == "__main__":
# Test to check if it works
forces = array(
[polar_force(718.4, 180 - 30), polar_force(879.54, 45), polar_force(100, -90)]
)
location = array([[0, 0], [0, 0], [0, 0]])
assert in_static_equilibrium(forces, location)
# Problem 1 in image_data/2D_problems.jpg
forces = array(
[
polar_force(30 * 9.81, 15),
polar_force(215, 180 - 45),
polar_force(264, 90 - 30),
]
)
location = array([[0, 0], [0, 0], [0, 0]])
assert in_static_equilibrium(forces, location)
# Problem in image_data/2D_problems_1.jpg
forces = array([[0, -2000], [0, -1200], [0, 15600], [0, -12400]])
location = array([[0, 0], [6, 0], [10, 0], [12, 0]])
assert in_static_equilibrium(forces, location)
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| def binomial_coefficient(n, r):
"""
Find binomial coefficient using pascals triangle.
>>> binomial_coefficient(10, 5)
252
"""
C = [0 for i in range(r + 1)]
# nc0 = 1
C[0] = 1
for i in range(1, n + 1):
# to compute current row from previous row.
j = min(i, r)
while j > 0:
C[j] += C[j - 1]
j -= 1
return C[r]
print(binomial_coefficient(n=10, r=5))
| def binomial_coefficient(n, r):
"""
Find binomial coefficient using pascals triangle.
>>> binomial_coefficient(10, 5)
252
"""
C = [0 for i in range(r + 1)]
# nc0 = 1
C[0] = 1
for i in range(1, n + 1):
# to compute current row from previous row.
j = min(i, r)
while j > 0:
C[j] += C[j - 1]
j -= 1
return C[r]
print(binomial_coefficient(n=10, r=5))
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Problem 45: https://projecteuler.net/problem=45
Triangle, pentagonal, and hexagonal numbers are generated by the following formulae:
Triangle T(n) = (n * (n + 1)) / 2 1, 3, 6, 10, 15, ...
Pentagonal P(n) = (n * (3 * n − 1)) / 2 1, 5, 12, 22, 35, ...
Hexagonal H(n) = n * (2 * n − 1) 1, 6, 15, 28, 45, ...
It can be verified that T(285) = P(165) = H(143) = 40755.
Find the next triangle number that is also pentagonal and hexagonal.
All trinagle numbers are hexagonal numbers.
T(2n-1) = n * (2 * n - 1) = H(n)
So we shall check only for hexagonal numbers which are also pentagonal.
"""
def hexagonal_num(n: int) -> int:
"""
Returns nth hexagonal number
>>> hexagonal_num(143)
40755
>>> hexagonal_num(21)
861
>>> hexagonal_num(10)
190
"""
return n * (2 * n - 1)
def is_pentagonal(n: int) -> bool:
"""
Returns True if n is pentagonal, False otherwise.
>>> is_pentagonal(330)
True
>>> is_pentagonal(7683)
False
>>> is_pentagonal(2380)
True
"""
root = (1 + 24 * n) ** 0.5
return ((1 + root) / 6) % 1 == 0
def solution(start: int = 144) -> int:
"""
Returns the next number which is traingular, pentagonal and hexagonal.
>>> solution(144)
1533776805
"""
n = start
num = hexagonal_num(n)
while not is_pentagonal(num):
n += 1
num = hexagonal_num(n)
return num
if __name__ == "__main__":
print(f"{solution()} = ")
| """
Problem 45: https://projecteuler.net/problem=45
Triangle, pentagonal, and hexagonal numbers are generated by the following formulae:
Triangle T(n) = (n * (n + 1)) / 2 1, 3, 6, 10, 15, ...
Pentagonal P(n) = (n * (3 * n − 1)) / 2 1, 5, 12, 22, 35, ...
Hexagonal H(n) = n * (2 * n − 1) 1, 6, 15, 28, 45, ...
It can be verified that T(285) = P(165) = H(143) = 40755.
Find the next triangle number that is also pentagonal and hexagonal.
All trinagle numbers are hexagonal numbers.
T(2n-1) = n * (2 * n - 1) = H(n)
So we shall check only for hexagonal numbers which are also pentagonal.
"""
def hexagonal_num(n: int) -> int:
"""
Returns nth hexagonal number
>>> hexagonal_num(143)
40755
>>> hexagonal_num(21)
861
>>> hexagonal_num(10)
190
"""
return n * (2 * n - 1)
def is_pentagonal(n: int) -> bool:
"""
Returns True if n is pentagonal, False otherwise.
>>> is_pentagonal(330)
True
>>> is_pentagonal(7683)
False
>>> is_pentagonal(2380)
True
"""
root = (1 + 24 * n) ** 0.5
return ((1 + root) / 6) % 1 == 0
def solution(start: int = 144) -> int:
"""
Returns the next number which is traingular, pentagonal and hexagonal.
>>> solution(144)
1533776805
"""
n = start
num = hexagonal_num(n)
while not is_pentagonal(num):
n += 1
num = hexagonal_num(n)
return num
if __name__ == "__main__":
print(f"{solution()} = ")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
A permutation is an ordered arrangement of objects. For example, 3124 is one
possible permutation of the digits 1, 2, 3 and 4. If all of the permutations
are listed numerically or alphabetically, we call it lexicographic order. The
lexicographic permutations of 0, 1 and 2 are:
012 021 102 120 201 210
What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5,
6, 7, 8 and 9?
"""
from itertools import permutations
def solution():
"""Returns the millionth lexicographic permutation of the digits 0, 1, 2,
3, 4, 5, 6, 7, 8 and 9.
>>> solution()
'2783915460'
"""
result = list(map("".join, permutations("0123456789")))
return result[999999]
if __name__ == "__main__":
print(solution())
| """
A permutation is an ordered arrangement of objects. For example, 3124 is one
possible permutation of the digits 1, 2, 3 and 4. If all of the permutations
are listed numerically or alphabetically, we call it lexicographic order. The
lexicographic permutations of 0, 1 and 2 are:
012 021 102 120 201 210
What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5,
6, 7, 8 and 9?
"""
from itertools import permutations
def solution():
"""Returns the millionth lexicographic permutation of the digits 0, 1, 2,
3, 4, 5, 6, 7, 8 and 9.
>>> solution()
'2783915460'
"""
result = list(map("".join, permutations("0123456789")))
return result[999999]
if __name__ == "__main__":
print(solution())
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| #!/bin/sh
#
# Copyright (c) 2006, 2008 Junio C Hamano
#
# The "pre-rebase" hook is run just before "git rebase" starts doing
# its job, and can prevent the command from running by exiting with
# non-zero status.
#
# The hook is called with the following parameters:
#
# $1 -- the upstream the series was forked from.
# $2 -- the branch being rebased (or empty when rebasing the current branch).
#
# This sample shows how to prevent topic branches that are already
# merged to 'next' branch from getting rebased, because allowing it
# would result in rebasing already published history.
publish=next
basebranch="$1"
if test "$#" = 2
then
topic="refs/heads/$2"
else
topic=`git symbolic-ref HEAD` ||
exit 0 ;# we do not interrupt rebasing detached HEAD
fi
case "$topic" in
refs/heads/??/*)
;;
*)
exit 0 ;# we do not interrupt others.
;;
esac
# Now we are dealing with a topic branch being rebased
# on top of master. Is it OK to rebase it?
# Does the topic really exist?
git show-ref -q "$topic" || {
echo >&2 "No such branch $topic"
exit 1
}
# Is topic fully merged to master?
not_in_master=`git rev-list --pretty=oneline ^master "$topic"`
if test -z "$not_in_master"
then
echo >&2 "$topic is fully merged to master; better remove it."
exit 1 ;# we could allow it, but there is no point.
fi
# Is topic ever merged to next? If so you should not be rebasing it.
only_next_1=`git rev-list ^master "^$topic" ${publish} | sort`
only_next_2=`git rev-list ^master ${publish} | sort`
if test "$only_next_1" = "$only_next_2"
then
not_in_topic=`git rev-list "^$topic" master`
if test -z "$not_in_topic"
then
echo >&2 "$topic is already up to date with master"
exit 1 ;# we could allow it, but there is no point.
else
exit 0
fi
else
not_in_next=`git rev-list --pretty=oneline ^${publish} "$topic"`
/usr/bin/perl -e '
my $topic = $ARGV[0];
my $msg = "* $topic has commits already merged to public branch:\n";
my (%not_in_next) = map {
/^([0-9a-f]+) /;
($1 => 1);
} split(/\n/, $ARGV[1]);
for my $elem (map {
/^([0-9a-f]+) (.*)$/;
[$1 => $2];
} split(/\n/, $ARGV[2])) {
if (!exists $not_in_next{$elem->[0]}) {
if ($msg) {
print STDERR $msg;
undef $msg;
}
print STDERR " $elem->[1]\n";
}
}
' "$topic" "$not_in_next" "$not_in_master"
exit 1
fi
<<\DOC_END
This sample hook safeguards topic branches that have been
published from being rewound.
The workflow assumed here is:
* Once a topic branch forks from "master", "master" is never
merged into it again (either directly or indirectly).
* Once a topic branch is fully cooked and merged into "master",
it is deleted. If you need to build on top of it to correct
earlier mistakes, a new topic branch is created by forking at
the tip of the "master". This is not strictly necessary, but
it makes it easier to keep your history simple.
* Whenever you need to test or publish your changes to topic
branches, merge them into "next" branch.
The script, being an example, hardcodes the publish branch name
to be "next", but it is trivial to make it configurable via
$GIT_DIR/config mechanism.
With this workflow, you would want to know:
(1) ... if a topic branch has ever been merged to "next". Young
topic branches can have stupid mistakes you would rather
clean up before publishing, and things that have not been
merged into other branches can be easily rebased without
affecting other people. But once it is published, you would
not want to rewind it.
(2) ... if a topic branch has been fully merged to "master".
Then you can delete it. More importantly, you should not
build on top of it -- other people may already want to
change things related to the topic as patches against your
"master", so if you need further changes, it is better to
fork the topic (perhaps with the same name) afresh from the
tip of "master".
Let's look at this example:
o---o---o---o---o---o---o---o---o---o "next"
/ / / /
/ a---a---b A / /
/ / / /
/ / c---c---c---c B /
/ / / \ /
/ / / b---b C \ /
/ / / / \ /
---o---o---o---o---o---o---o---o---o---o---o "master"
A, B and C are topic branches.
* A has one fix since it was merged up to "next".
* B has finished. It has been fully merged up to "master" and "next",
and is ready to be deleted.
* C has not merged to "next" at all.
We would want to allow C to be rebased, refuse A, and encourage
B to be deleted.
To compute (1):
git rev-list ^master ^topic next
git rev-list ^master next
if these match, topic has not merged in next at all.
To compute (2):
git rev-list master..topic
if this is empty, it is fully merged to "master".
DOC_END
| #!/bin/sh
#
# Copyright (c) 2006, 2008 Junio C Hamano
#
# The "pre-rebase" hook is run just before "git rebase" starts doing
# its job, and can prevent the command from running by exiting with
# non-zero status.
#
# The hook is called with the following parameters:
#
# $1 -- the upstream the series was forked from.
# $2 -- the branch being rebased (or empty when rebasing the current branch).
#
# This sample shows how to prevent topic branches that are already
# merged to 'next' branch from getting rebased, because allowing it
# would result in rebasing already published history.
publish=next
basebranch="$1"
if test "$#" = 2
then
topic="refs/heads/$2"
else
topic=`git symbolic-ref HEAD` ||
exit 0 ;# we do not interrupt rebasing detached HEAD
fi
case "$topic" in
refs/heads/??/*)
;;
*)
exit 0 ;# we do not interrupt others.
;;
esac
# Now we are dealing with a topic branch being rebased
# on top of master. Is it OK to rebase it?
# Does the topic really exist?
git show-ref -q "$topic" || {
echo >&2 "No such branch $topic"
exit 1
}
# Is topic fully merged to master?
not_in_master=`git rev-list --pretty=oneline ^master "$topic"`
if test -z "$not_in_master"
then
echo >&2 "$topic is fully merged to master; better remove it."
exit 1 ;# we could allow it, but there is no point.
fi
# Is topic ever merged to next? If so you should not be rebasing it.
only_next_1=`git rev-list ^master "^$topic" ${publish} | sort`
only_next_2=`git rev-list ^master ${publish} | sort`
if test "$only_next_1" = "$only_next_2"
then
not_in_topic=`git rev-list "^$topic" master`
if test -z "$not_in_topic"
then
echo >&2 "$topic is already up to date with master"
exit 1 ;# we could allow it, but there is no point.
else
exit 0
fi
else
not_in_next=`git rev-list --pretty=oneline ^${publish} "$topic"`
/usr/bin/perl -e '
my $topic = $ARGV[0];
my $msg = "* $topic has commits already merged to public branch:\n";
my (%not_in_next) = map {
/^([0-9a-f]+) /;
($1 => 1);
} split(/\n/, $ARGV[1]);
for my $elem (map {
/^([0-9a-f]+) (.*)$/;
[$1 => $2];
} split(/\n/, $ARGV[2])) {
if (!exists $not_in_next{$elem->[0]}) {
if ($msg) {
print STDERR $msg;
undef $msg;
}
print STDERR " $elem->[1]\n";
}
}
' "$topic" "$not_in_next" "$not_in_master"
exit 1
fi
<<\DOC_END
This sample hook safeguards topic branches that have been
published from being rewound.
The workflow assumed here is:
* Once a topic branch forks from "master", "master" is never
merged into it again (either directly or indirectly).
* Once a topic branch is fully cooked and merged into "master",
it is deleted. If you need to build on top of it to correct
earlier mistakes, a new topic branch is created by forking at
the tip of the "master". This is not strictly necessary, but
it makes it easier to keep your history simple.
* Whenever you need to test or publish your changes to topic
branches, merge them into "next" branch.
The script, being an example, hardcodes the publish branch name
to be "next", but it is trivial to make it configurable via
$GIT_DIR/config mechanism.
With this workflow, you would want to know:
(1) ... if a topic branch has ever been merged to "next". Young
topic branches can have stupid mistakes you would rather
clean up before publishing, and things that have not been
merged into other branches can be easily rebased without
affecting other people. But once it is published, you would
not want to rewind it.
(2) ... if a topic branch has been fully merged to "master".
Then you can delete it. More importantly, you should not
build on top of it -- other people may already want to
change things related to the topic as patches against your
"master", so if you need further changes, it is better to
fork the topic (perhaps with the same name) afresh from the
tip of "master".
Let's look at this example:
o---o---o---o---o---o---o---o---o---o "next"
/ / / /
/ a---a---b A / /
/ / / /
/ / c---c---c---c B /
/ / / \ /
/ / / b---b C \ /
/ / / / \ /
---o---o---o---o---o---o---o---o---o---o---o "master"
A, B and C are topic branches.
* A has one fix since it was merged up to "next".
* B has finished. It has been fully merged up to "master" and "next",
and is ready to be deleted.
* C has not merged to "next" at all.
We would want to allow C to be rebased, refuse A, and encourage
B to be deleted.
To compute (1):
git rev-list ^master ^topic next
git rev-list ^master next
if these match, topic has not merged in next at all.
To compute (2):
git rev-list master..topic
if this is empty, it is fully merged to "master".
DOC_END
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Wiggle Sort.
Given an unsorted array nums, reorder it such
that nums[0] < nums[1] > nums[2] < nums[3]....
For example:
if input numbers = [3, 5, 2, 1, 6, 4]
one possible Wiggle Sorted answer is [3, 5, 1, 6, 2, 4].
"""
def wiggle_sort(nums: list) -> list:
"""
Python implementation of wiggle.
Example:
>>> wiggle_sort([0, 5, 3, 2, 2])
[0, 5, 2, 3, 2]
>>> wiggle_sort([])
[]
>>> wiggle_sort([-2, -5, -45])
[-45, -2, -5]
>>> wiggle_sort([-2.1, -5.68, -45.11])
[-45.11, -2.1, -5.68]
"""
for i, _ in enumerate(nums):
if (i % 2 == 1) == (nums[i - 1] > nums[i]):
nums[i - 1], nums[i] = nums[i], nums[i - 1]
return nums
if __name__ == "__main__":
print("Enter the array elements:")
array = list(map(int, input().split()))
print("The unsorted array is:")
print(array)
print("Array after Wiggle sort:")
print(wiggle_sort(array))
| """
Wiggle Sort.
Given an unsorted array nums, reorder it such
that nums[0] < nums[1] > nums[2] < nums[3]....
For example:
if input numbers = [3, 5, 2, 1, 6, 4]
one possible Wiggle Sorted answer is [3, 5, 1, 6, 2, 4].
"""
def wiggle_sort(nums: list) -> list:
"""
Python implementation of wiggle.
Example:
>>> wiggle_sort([0, 5, 3, 2, 2])
[0, 5, 2, 3, 2]
>>> wiggle_sort([])
[]
>>> wiggle_sort([-2, -5, -45])
[-45, -2, -5]
>>> wiggle_sort([-2.1, -5.68, -45.11])
[-45.11, -2.1, -5.68]
"""
for i, _ in enumerate(nums):
if (i % 2 == 1) == (nums[i - 1] > nums[i]):
nums[i - 1], nums[i] = nums[i], nums[i - 1]
return nums
if __name__ == "__main__":
print("Enter the array elements:")
array = list(map(int, input().split()))
print("The unsorted array is:")
print(array)
print("Array after Wiggle sort:")
print(wiggle_sort(array))
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Algorithm that merges two sorted linked lists into one sorted linked list.
"""
from __future__ import annotations
from collections.abc import Iterable, Iterator
from dataclasses import dataclass
from typing import Optional
test_data_odd = (3, 9, -11, 0, 7, 5, 1, -1)
test_data_even = (4, 6, 2, 0, 8, 10, 3, -2)
@dataclass
class Node:
data: int
next: Optional[Node]
class SortedLinkedList:
def __init__(self, ints: Iterable[int]) -> None:
self.head: Optional[Node] = None
for i in reversed(sorted(ints)):
self.head = Node(i, self.head)
def __iter__(self) -> Iterator[int]:
"""
>>> tuple(SortedLinkedList(test_data_odd)) == tuple(sorted(test_data_odd))
True
>>> tuple(SortedLinkedList(test_data_even)) == tuple(sorted(test_data_even))
True
"""
node = self.head
while node:
yield node.data
node = node.next
def __len__(self) -> int:
"""
>>> for i in range(3):
... len(SortedLinkedList(range(i))) == i
True
True
True
>>> len(SortedLinkedList(test_data_odd))
8
"""
return len(tuple(iter(self)))
def __str__(self) -> str:
"""
>>> str(SortedLinkedList([]))
''
>>> str(SortedLinkedList(test_data_odd))
'-11 -> -1 -> 0 -> 1 -> 3 -> 5 -> 7 -> 9'
>>> str(SortedLinkedList(test_data_even))
'-2 -> 0 -> 2 -> 3 -> 4 -> 6 -> 8 -> 10'
"""
return " -> ".join([str(node) for node in self])
def merge_lists(
sll_one: SortedLinkedList, sll_two: SortedLinkedList
) -> SortedLinkedList:
"""
>>> SSL = SortedLinkedList
>>> merged = merge_lists(SSL(test_data_odd), SSL(test_data_even))
>>> len(merged)
16
>>> str(merged)
'-11 -> -2 -> -1 -> 0 -> 0 -> 1 -> 2 -> 3 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9 -> 10'
>>> list(merged) == list(sorted(test_data_odd + test_data_even))
True
"""
return SortedLinkedList(list(sll_one) + list(sll_two))
if __name__ == "__main__":
import doctest
doctest.testmod()
SSL = SortedLinkedList
print(merge_lists(SSL(test_data_odd), SSL(test_data_even)))
| """
Algorithm that merges two sorted linked lists into one sorted linked list.
"""
from __future__ import annotations
from collections.abc import Iterable, Iterator
from dataclasses import dataclass
from typing import Optional
test_data_odd = (3, 9, -11, 0, 7, 5, 1, -1)
test_data_even = (4, 6, 2, 0, 8, 10, 3, -2)
@dataclass
class Node:
data: int
next: Optional[Node]
class SortedLinkedList:
def __init__(self, ints: Iterable[int]) -> None:
self.head: Optional[Node] = None
for i in reversed(sorted(ints)):
self.head = Node(i, self.head)
def __iter__(self) -> Iterator[int]:
"""
>>> tuple(SortedLinkedList(test_data_odd)) == tuple(sorted(test_data_odd))
True
>>> tuple(SortedLinkedList(test_data_even)) == tuple(sorted(test_data_even))
True
"""
node = self.head
while node:
yield node.data
node = node.next
def __len__(self) -> int:
"""
>>> for i in range(3):
... len(SortedLinkedList(range(i))) == i
True
True
True
>>> len(SortedLinkedList(test_data_odd))
8
"""
return len(tuple(iter(self)))
def __str__(self) -> str:
"""
>>> str(SortedLinkedList([]))
''
>>> str(SortedLinkedList(test_data_odd))
'-11 -> -1 -> 0 -> 1 -> 3 -> 5 -> 7 -> 9'
>>> str(SortedLinkedList(test_data_even))
'-2 -> 0 -> 2 -> 3 -> 4 -> 6 -> 8 -> 10'
"""
return " -> ".join([str(node) for node in self])
def merge_lists(
sll_one: SortedLinkedList, sll_two: SortedLinkedList
) -> SortedLinkedList:
"""
>>> SSL = SortedLinkedList
>>> merged = merge_lists(SSL(test_data_odd), SSL(test_data_even))
>>> len(merged)
16
>>> str(merged)
'-11 -> -2 -> -1 -> 0 -> 0 -> 1 -> 2 -> 3 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9 -> 10'
>>> list(merged) == list(sorted(test_data_odd + test_data_even))
True
"""
return SortedLinkedList(list(sll_one) + list(sll_two))
if __name__ == "__main__":
import doctest
doctest.testmod()
SSL = SortedLinkedList
print(merge_lists(SSL(test_data_odd), SSL(test_data_even)))
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Isolate the Decimal part of a Number
https://stackoverflow.com/questions/3886402/how-to-get-numbers-after-decimal-point
"""
def decimal_isolate(number, digitAmount):
"""
Isolates the decimal part of a number.
If digitAmount > 0 round to that decimal place, else print the entire decimal.
>>> decimal_isolate(1.53, 0)
0.53
>>> decimal_isolate(35.345, 1)
0.3
>>> decimal_isolate(35.345, 2)
0.34
>>> decimal_isolate(35.345, 3)
0.345
>>> decimal_isolate(-14.789, 3)
-0.789
>>> decimal_isolate(0, 2)
0
>>> decimal_isolate(-14.123, 1)
-0.1
>>> decimal_isolate(-14.123, 2)
-0.12
>>> decimal_isolate(-14.123, 3)
-0.123
"""
if digitAmount > 0:
return round(number - int(number), digitAmount)
return number - int(number)
if __name__ == "__main__":
print(decimal_isolate(1.53, 0))
print(decimal_isolate(35.345, 1))
print(decimal_isolate(35.345, 2))
print(decimal_isolate(35.345, 3))
print(decimal_isolate(-14.789, 3))
print(decimal_isolate(0, 2))
print(decimal_isolate(-14.123, 1))
print(decimal_isolate(-14.123, 2))
print(decimal_isolate(-14.123, 3))
| """
Isolate the Decimal part of a Number
https://stackoverflow.com/questions/3886402/how-to-get-numbers-after-decimal-point
"""
def decimal_isolate(number, digitAmount):
"""
Isolates the decimal part of a number.
If digitAmount > 0 round to that decimal place, else print the entire decimal.
>>> decimal_isolate(1.53, 0)
0.53
>>> decimal_isolate(35.345, 1)
0.3
>>> decimal_isolate(35.345, 2)
0.34
>>> decimal_isolate(35.345, 3)
0.345
>>> decimal_isolate(-14.789, 3)
-0.789
>>> decimal_isolate(0, 2)
0
>>> decimal_isolate(-14.123, 1)
-0.1
>>> decimal_isolate(-14.123, 2)
-0.12
>>> decimal_isolate(-14.123, 3)
-0.123
"""
if digitAmount > 0:
return round(number - int(number), digitAmount)
return number - int(number)
if __name__ == "__main__":
print(decimal_isolate(1.53, 0))
print(decimal_isolate(35.345, 1))
print(decimal_isolate(35.345, 2))
print(decimal_isolate(35.345, 3))
print(decimal_isolate(-14.789, 3))
print(decimal_isolate(0, 2))
print(decimal_isolate(-14.123, 1))
print(decimal_isolate(-14.123, 2))
print(decimal_isolate(-14.123, 3))
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Recaptcha is a free captcha service offered by Google in order to secure websites and
forms. At https://www.google.com/recaptcha/admin/create you can create new recaptcha
keys and see the keys that your have already created.
* Keep in mind that recaptcha doesn't work with localhost
When you create a recaptcha key, your will get two separate keys: ClientKey & SecretKey.
ClientKey should be kept in your site's front end
SecretKey should be kept in your site's back end
# An example HTML login form with recaptcha tag is shown below
<form action="" method="post">
<h2 class="text-center">Log in</h2>
{% csrf_token %}
<div class="form-group">
<input type="text" name="username" required="required">
</div>
<div class="form-group">
<input type="password" name="password" required="required">
</div>
<div class="form-group">
<button type="submit">Log in</button>
</div>
<!-- Below is the recaptcha tag of html -->
<div class="g-recaptcha" data-sitekey="ClientKey"></div>
</form>
<!-- Below is the recaptcha script to be kept inside html tag -->
<script src="https://www.google.com/recaptcha/api.js" async defer></script>
Below a Django function for the views.py file contains a login form for demonstrating
recaptcha verification.
"""
import requests
try:
from django.contrib.auth import authenticate, login
from django.shortcuts import redirect, render
except ImportError:
authenticate = login = render = redirect = print
def login_using_recaptcha(request):
# Enter your recaptcha secret key here
secret_key = "secretKey"
url = "https://www.google.com/recaptcha/api/siteverify"
# when method is not POST, direct user to login page
if request.method != "POST":
return render(request, "login.html")
# from the frontend, get username, password, and client_key
username = request.POST.get("username")
password = request.POST.get("password")
client_key = request.POST.get("g-recaptcha-response")
# post recaptcha response to Google's recaptcha api
response = requests.post(url, data={"secret": secret_key, "response": client_key})
# if the recaptcha api verified our keys
if response.json().get("success", False):
# authenticate the user
user_in_database = authenticate(request, username=username, password=password)
if user_in_database:
login(request, user_in_database)
return redirect("/your-webpage")
return render(request, "login.html")
| """
Recaptcha is a free captcha service offered by Google in order to secure websites and
forms. At https://www.google.com/recaptcha/admin/create you can create new recaptcha
keys and see the keys that your have already created.
* Keep in mind that recaptcha doesn't work with localhost
When you create a recaptcha key, your will get two separate keys: ClientKey & SecretKey.
ClientKey should be kept in your site's front end
SecretKey should be kept in your site's back end
# An example HTML login form with recaptcha tag is shown below
<form action="" method="post">
<h2 class="text-center">Log in</h2>
{% csrf_token %}
<div class="form-group">
<input type="text" name="username" required="required">
</div>
<div class="form-group">
<input type="password" name="password" required="required">
</div>
<div class="form-group">
<button type="submit">Log in</button>
</div>
<!-- Below is the recaptcha tag of html -->
<div class="g-recaptcha" data-sitekey="ClientKey"></div>
</form>
<!-- Below is the recaptcha script to be kept inside html tag -->
<script src="https://www.google.com/recaptcha/api.js" async defer></script>
Below a Django function for the views.py file contains a login form for demonstrating
recaptcha verification.
"""
import requests
try:
from django.contrib.auth import authenticate, login
from django.shortcuts import redirect, render
except ImportError:
authenticate = login = render = redirect = print
def login_using_recaptcha(request):
# Enter your recaptcha secret key here
secret_key = "secretKey"
url = "https://www.google.com/recaptcha/api/siteverify"
# when method is not POST, direct user to login page
if request.method != "POST":
return render(request, "login.html")
# from the frontend, get username, password, and client_key
username = request.POST.get("username")
password = request.POST.get("password")
client_key = request.POST.get("g-recaptcha-response")
# post recaptcha response to Google's recaptcha api
response = requests.post(url, data={"secret": secret_key, "response": client_key})
# if the recaptcha api verified our keys
if response.json().get("success", False):
# authenticate the user
user_in_database = authenticate(request, username=username, password=password)
if user_in_database:
login(request, user_in_database)
return redirect("/your-webpage")
return render(request, "login.html")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """ A Queue using a linked list like structure """
from typing import Any
class Node:
def __init__(self, data: Any) -> None:
self.data = data
self.next = None
def __str__(self) -> str:
return f"{self.data}"
class LinkedQueue:
"""
>>> queue = LinkedQueue()
>>> queue.is_empty()
True
>>> queue.put(5)
>>> queue.put(9)
>>> queue.put('python')
>>> queue.is_empty();
False
>>> queue.get()
5
>>> queue.put('algorithms')
>>> queue.get()
9
>>> queue.get()
'python'
>>> queue.get()
'algorithms'
>>> queue.is_empty()
True
>>> queue.get()
Traceback (most recent call last):
...
IndexError: dequeue from empty queue
"""
def __init__(self) -> None:
self.front = self.rear = None
def __iter__(self):
node = self.front
while node:
yield node.data
node = node.next
def __len__(self) -> int:
"""
>>> queue = LinkedQueue()
>>> for i in range(1, 6):
... queue.put(i)
>>> len(queue)
5
>>> for i in range(1, 6):
... assert len(queue) == 6 - i
... _ = queue.get()
>>> len(queue)
0
"""
return len(tuple(iter(self)))
def __str__(self) -> str:
"""
>>> queue = LinkedQueue()
>>> for i in range(1, 4):
... queue.put(i)
>>> queue.put("Python")
>>> queue.put(3.14)
>>> queue.put(True)
>>> str(queue)
'1 <- 2 <- 3 <- Python <- 3.14 <- True'
"""
return " <- ".join(str(item) for item in self)
def is_empty(self) -> bool:
"""
>>> queue = LinkedQueue()
>>> queue.is_empty()
True
>>> for i in range(1, 6):
... queue.put(i)
>>> queue.is_empty()
False
"""
return len(self) == 0
def put(self, item) -> None:
"""
>>> queue = LinkedQueue()
>>> queue.get()
Traceback (most recent call last):
...
IndexError: dequeue from empty queue
>>> for i in range(1, 6):
... queue.put(i)
>>> str(queue)
'1 <- 2 <- 3 <- 4 <- 5'
"""
node = Node(item)
if self.is_empty():
self.front = self.rear = node
else:
assert isinstance(self.rear, Node)
self.rear.next = node
self.rear = node
def get(self) -> Any:
"""
>>> queue = LinkedQueue()
>>> queue.get()
Traceback (most recent call last):
...
IndexError: dequeue from empty queue
>>> queue = LinkedQueue()
>>> for i in range(1, 6):
... queue.put(i)
>>> for i in range(1, 6):
... assert queue.get() == i
>>> len(queue)
0
"""
if self.is_empty():
raise IndexError("dequeue from empty queue")
assert isinstance(self.front, Node)
node = self.front
self.front = self.front.next
if self.front is None:
self.rear = None
return node.data
def clear(self) -> None:
"""
>>> queue = LinkedQueue()
>>> for i in range(1, 6):
... queue.put(i)
>>> queue.clear()
>>> len(queue)
0
>>> str(queue)
''
"""
self.front = self.rear = None
if __name__ == "__main__":
from doctest import testmod
testmod()
| """ A Queue using a linked list like structure """
from typing import Any
class Node:
def __init__(self, data: Any) -> None:
self.data = data
self.next = None
def __str__(self) -> str:
return f"{self.data}"
class LinkedQueue:
"""
>>> queue = LinkedQueue()
>>> queue.is_empty()
True
>>> queue.put(5)
>>> queue.put(9)
>>> queue.put('python')
>>> queue.is_empty();
False
>>> queue.get()
5
>>> queue.put('algorithms')
>>> queue.get()
9
>>> queue.get()
'python'
>>> queue.get()
'algorithms'
>>> queue.is_empty()
True
>>> queue.get()
Traceback (most recent call last):
...
IndexError: dequeue from empty queue
"""
def __init__(self) -> None:
self.front = self.rear = None
def __iter__(self):
node = self.front
while node:
yield node.data
node = node.next
def __len__(self) -> int:
"""
>>> queue = LinkedQueue()
>>> for i in range(1, 6):
... queue.put(i)
>>> len(queue)
5
>>> for i in range(1, 6):
... assert len(queue) == 6 - i
... _ = queue.get()
>>> len(queue)
0
"""
return len(tuple(iter(self)))
def __str__(self) -> str:
"""
>>> queue = LinkedQueue()
>>> for i in range(1, 4):
... queue.put(i)
>>> queue.put("Python")
>>> queue.put(3.14)
>>> queue.put(True)
>>> str(queue)
'1 <- 2 <- 3 <- Python <- 3.14 <- True'
"""
return " <- ".join(str(item) for item in self)
def is_empty(self) -> bool:
"""
>>> queue = LinkedQueue()
>>> queue.is_empty()
True
>>> for i in range(1, 6):
... queue.put(i)
>>> queue.is_empty()
False
"""
return len(self) == 0
def put(self, item) -> None:
"""
>>> queue = LinkedQueue()
>>> queue.get()
Traceback (most recent call last):
...
IndexError: dequeue from empty queue
>>> for i in range(1, 6):
... queue.put(i)
>>> str(queue)
'1 <- 2 <- 3 <- 4 <- 5'
"""
node = Node(item)
if self.is_empty():
self.front = self.rear = node
else:
assert isinstance(self.rear, Node)
self.rear.next = node
self.rear = node
def get(self) -> Any:
"""
>>> queue = LinkedQueue()
>>> queue.get()
Traceback (most recent call last):
...
IndexError: dequeue from empty queue
>>> queue = LinkedQueue()
>>> for i in range(1, 6):
... queue.put(i)
>>> for i in range(1, 6):
... assert queue.get() == i
>>> len(queue)
0
"""
if self.is_empty():
raise IndexError("dequeue from empty queue")
assert isinstance(self.front, Node)
node = self.front
self.front = self.front.next
if self.front is None:
self.rear = None
return node.data
def clear(self) -> None:
"""
>>> queue = LinkedQueue()
>>> for i in range(1, 6):
... queue.put(i)
>>> queue.clear()
>>> len(queue)
0
>>> str(queue)
''
"""
self.front = self.rear = None
if __name__ == "__main__":
from doctest import testmod
testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| from __future__ import annotations
def n31(a: int) -> tuple[list[int], int]:
"""
Returns the Collatz sequence and its length of any positive integer.
>>> n31(4)
([4, 2, 1], 3)
"""
if not isinstance(a, int):
raise TypeError(f"Must be int, not {type(a).__name__}")
if a < 1:
raise ValueError(f"Given integer must be greater than 1, not {a}")
path = [a]
while a != 1:
if a % 2 == 0:
a = a // 2
else:
a = 3 * a + 1
path += [a]
return path, len(path)
def test_n31():
"""
>>> test_n31()
"""
assert n31(4) == ([4, 2, 1], 3)
assert n31(11) == ([11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1], 15)
assert n31(31) == (
[
31,
94,
47,
142,
71,
214,
107,
322,
161,
484,
242,
121,
364,
182,
91,
274,
137,
412,
206,
103,
310,
155,
466,
233,
700,
350,
175,
526,
263,
790,
395,
1186,
593,
1780,
890,
445,
1336,
668,
334,
167,
502,
251,
754,
377,
1132,
566,
283,
850,
425,
1276,
638,
319,
958,
479,
1438,
719,
2158,
1079,
3238,
1619,
4858,
2429,
7288,
3644,
1822,
911,
2734,
1367,
4102,
2051,
6154,
3077,
9232,
4616,
2308,
1154,
577,
1732,
866,
433,
1300,
650,
325,
976,
488,
244,
122,
61,
184,
92,
46,
23,
70,
35,
106,
53,
160,
80,
40,
20,
10,
5,
16,
8,
4,
2,
1,
],
107,
)
if __name__ == "__main__":
num = 4
path, length = n31(num)
print(f"The Collatz sequence of {num} took {length} steps. \nPath: {path}")
| from __future__ import annotations
def n31(a: int) -> tuple[list[int], int]:
"""
Returns the Collatz sequence and its length of any positive integer.
>>> n31(4)
([4, 2, 1], 3)
"""
if not isinstance(a, int):
raise TypeError(f"Must be int, not {type(a).__name__}")
if a < 1:
raise ValueError(f"Given integer must be greater than 1, not {a}")
path = [a]
while a != 1:
if a % 2 == 0:
a = a // 2
else:
a = 3 * a + 1
path += [a]
return path, len(path)
def test_n31():
"""
>>> test_n31()
"""
assert n31(4) == ([4, 2, 1], 3)
assert n31(11) == ([11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1], 15)
assert n31(31) == (
[
31,
94,
47,
142,
71,
214,
107,
322,
161,
484,
242,
121,
364,
182,
91,
274,
137,
412,
206,
103,
310,
155,
466,
233,
700,
350,
175,
526,
263,
790,
395,
1186,
593,
1780,
890,
445,
1336,
668,
334,
167,
502,
251,
754,
377,
1132,
566,
283,
850,
425,
1276,
638,
319,
958,
479,
1438,
719,
2158,
1079,
3238,
1619,
4858,
2429,
7288,
3644,
1822,
911,
2734,
1367,
4102,
2051,
6154,
3077,
9232,
4616,
2308,
1154,
577,
1732,
866,
433,
1300,
650,
325,
976,
488,
244,
122,
61,
184,
92,
46,
23,
70,
35,
106,
53,
160,
80,
40,
20,
10,
5,
16,
8,
4,
2,
1,
],
107,
)
if __name__ == "__main__":
num = 4
path, length = n31(num)
print(f"The Collatz sequence of {num} took {length} steps. \nPath: {path}")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| #!/bin/sh
#
# An example hook script to make use of push options.
# The example simply echoes all push options that start with 'echoback='
# and rejects all pushes when the "reject" push option is used.
#
# To enable this hook, rename this file to "pre-receive".
if test -n "$GIT_PUSH_OPTION_COUNT"
then
i=0
while test "$i" -lt "$GIT_PUSH_OPTION_COUNT"
do
eval "value=\$GIT_PUSH_OPTION_$i"
case "$value" in
echoback=*)
echo "echo from the pre-receive-hook: ${value#*=}" >&2
;;
reject)
exit 1
esac
i=$((i + 1))
done
fi
| #!/bin/sh
#
# An example hook script to make use of push options.
# The example simply echoes all push options that start with 'echoback='
# and rejects all pushes when the "reject" push option is used.
#
# To enable this hook, rename this file to "pre-receive".
if test -n "$GIT_PUSH_OPTION_COUNT"
then
i=0
while test "$i" -lt "$GIT_PUSH_OPTION_COUNT"
do
eval "value=\$GIT_PUSH_OPTION_$i"
case "$value" in
echoback=*)
echo "echo from the pre-receive-hook: ${value#*=}" >&2
;;
reject)
exit 1
esac
i=$((i + 1))
done
fi
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """Absolute Value."""
def abs_val(num):
"""
Find the absolute value of a number.
>>> abs_val(-5.1)
5.1
>>> abs_val(-5) == abs_val(5)
True
>>> abs_val(0)
0
"""
return -num if num < 0 else num
def test_abs_val():
"""
>>> test_abs_val()
"""
assert 0 == abs_val(0)
assert 34 == abs_val(34)
assert 100000000000 == abs_val(-100000000000)
if __name__ == "__main__":
print(abs_val(-34)) # --> 34
| """Absolute Value."""
def abs_val(num):
"""
Find the absolute value of a number.
>>> abs_val(-5.1)
5.1
>>> abs_val(-5) == abs_val(5)
True
>>> abs_val(0)
0
"""
return -num if num < 0 else num
def test_abs_val():
"""
>>> test_abs_val()
"""
assert 0 == abs_val(0)
assert 34 == abs_val(34)
assert 100000000000 == abs_val(-100000000000)
if __name__ == "__main__":
print(abs_val(-34)) # --> 34
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
- A linked list is similar to an array, it holds values. However, links in a linked
list do not have indexes.
- This is an example of a double ended, doubly linked list.
- Each link references the next link and the previous one.
- A Doubly Linked List (DLL) contains an extra pointer, typically called previous
pointer, together with next pointer and data which are there in singly linked list.
- Advantages over SLL - It can be traversed in both forward and backward direction.
Delete operation is more efficient
"""
class Node:
def __init__(self, data: int, previous=None, next_node=None):
self.data = data
self.previous = previous
self.next = next_node
def __str__(self) -> str:
return f"{self.data}"
def get_data(self) -> int:
return self.data
def get_next(self):
return self.next
def get_previous(self):
return self.previous
class LinkedListIterator:
def __init__(self, head):
self.current = head
def __iter__(self):
return self
def __next__(self):
if not self.current:
raise StopIteration
else:
value = self.current.get_data()
self.current = self.current.get_next()
return value
class LinkedList:
def __init__(self):
self.head = None # First node in list
self.tail = None # Last node in list
def __str__(self):
current = self.head
nodes = []
while current is not None:
nodes.append(current.get_data())
current = current.get_next()
return " ".join(str(node) for node in nodes)
def __contains__(self, value: int):
current = self.head
while current:
if current.get_data() == value:
return True
current = current.get_next()
return False
def __iter__(self):
return LinkedListIterator(self.head)
def get_head_data(self):
if self.head:
return self.head.get_data()
return None
def get_tail_data(self):
if self.tail:
return self.tail.get_data()
return None
def set_head(self, node: Node) -> None:
if self.head is None:
self.head = node
self.tail = node
else:
self.insert_before_node(self.head, node)
def set_tail(self, node: Node) -> None:
if self.head is None:
self.set_head(node)
else:
self.insert_after_node(self.tail, node)
def insert(self, value: int) -> None:
node = Node(value)
if self.head is None:
self.set_head(node)
else:
self.set_tail(node)
def insert_before_node(self, node: Node, node_to_insert: Node) -> None:
node_to_insert.next = node
node_to_insert.previous = node.previous
if node.get_previous() is None:
self.head = node_to_insert
else:
node.previous.next = node_to_insert
node.previous = node_to_insert
def insert_after_node(self, node: Node, node_to_insert: Node) -> None:
node_to_insert.previous = node
node_to_insert.next = node.next
if node.get_next() is None:
self.tail = node_to_insert
else:
node.next.previous = node_to_insert
node.next = node_to_insert
def insert_at_position(self, position: int, value: int) -> None:
current_position = 1
new_node = Node(value)
node = self.head
while node:
if current_position == position:
self.insert_before_node(node, new_node)
return None
current_position += 1
node = node.next
self.insert_after_node(self.tail, new_node)
def get_node(self, item: int) -> Node:
node = self.head
while node:
if node.get_data() == item:
return node
node = node.get_next()
raise Exception("Node not found")
def delete_value(self, value):
node = self.get_node(value)
if node is not None:
if node == self.head:
self.head = self.head.get_next()
if node == self.tail:
self.tail = self.tail.get_previous()
self.remove_node_pointers(node)
@staticmethod
def remove_node_pointers(node: Node) -> None:
if node.get_next():
node.next.previous = node.previous
if node.get_previous():
node.previous.next = node.next
node.next = None
node.previous = None
def is_empty(self):
return self.head is None
def create_linked_list() -> None:
"""
>>> new_linked_list = LinkedList()
>>> new_linked_list.get_head_data() is None
True
>>> new_linked_list.get_tail_data() is None
True
>>> new_linked_list.is_empty()
True
>>> new_linked_list.insert(10)
>>> new_linked_list.get_head_data()
10
>>> new_linked_list.get_tail_data()
10
>>> new_linked_list.insert_at_position(position=3, value=20)
>>> new_linked_list.get_head_data()
10
>>> new_linked_list.get_tail_data()
20
>>> new_linked_list.set_head(Node(1000))
>>> new_linked_list.get_head_data()
1000
>>> new_linked_list.get_tail_data()
20
>>> new_linked_list.set_tail(Node(2000))
>>> new_linked_list.get_head_data()
1000
>>> new_linked_list.get_tail_data()
2000
>>> for value in new_linked_list:
... print(value)
1000
10
20
2000
>>> new_linked_list.is_empty()
False
>>> for value in new_linked_list:
... print(value)
1000
10
20
2000
>>> 10 in new_linked_list
True
>>> new_linked_list.delete_value(value=10)
>>> 10 in new_linked_list
False
>>> new_linked_list.delete_value(value=2000)
>>> new_linked_list.get_tail_data()
20
>>> new_linked_list.delete_value(value=1000)
>>> new_linked_list.get_tail_data()
20
>>> new_linked_list.get_head_data()
20
>>> for value in new_linked_list:
... print(value)
20
>>> new_linked_list.delete_value(value=20)
>>> for value in new_linked_list:
... print(value)
>>> for value in range(1,10):
... new_linked_list.insert(value=value)
>>> for value in new_linked_list:
... print(value)
1
2
3
4
5
6
7
8
9
"""
if __name__ == "__main__":
import doctest
doctest.testmod()
| """
- A linked list is similar to an array, it holds values. However, links in a linked
list do not have indexes.
- This is an example of a double ended, doubly linked list.
- Each link references the next link and the previous one.
- A Doubly Linked List (DLL) contains an extra pointer, typically called previous
pointer, together with next pointer and data which are there in singly linked list.
- Advantages over SLL - It can be traversed in both forward and backward direction.
Delete operation is more efficient
"""
class Node:
def __init__(self, data: int, previous=None, next_node=None):
self.data = data
self.previous = previous
self.next = next_node
def __str__(self) -> str:
return f"{self.data}"
def get_data(self) -> int:
return self.data
def get_next(self):
return self.next
def get_previous(self):
return self.previous
class LinkedListIterator:
def __init__(self, head):
self.current = head
def __iter__(self):
return self
def __next__(self):
if not self.current:
raise StopIteration
else:
value = self.current.get_data()
self.current = self.current.get_next()
return value
class LinkedList:
def __init__(self):
self.head = None # First node in list
self.tail = None # Last node in list
def __str__(self):
current = self.head
nodes = []
while current is not None:
nodes.append(current.get_data())
current = current.get_next()
return " ".join(str(node) for node in nodes)
def __contains__(self, value: int):
current = self.head
while current:
if current.get_data() == value:
return True
current = current.get_next()
return False
def __iter__(self):
return LinkedListIterator(self.head)
def get_head_data(self):
if self.head:
return self.head.get_data()
return None
def get_tail_data(self):
if self.tail:
return self.tail.get_data()
return None
def set_head(self, node: Node) -> None:
if self.head is None:
self.head = node
self.tail = node
else:
self.insert_before_node(self.head, node)
def set_tail(self, node: Node) -> None:
if self.head is None:
self.set_head(node)
else:
self.insert_after_node(self.tail, node)
def insert(self, value: int) -> None:
node = Node(value)
if self.head is None:
self.set_head(node)
else:
self.set_tail(node)
def insert_before_node(self, node: Node, node_to_insert: Node) -> None:
node_to_insert.next = node
node_to_insert.previous = node.previous
if node.get_previous() is None:
self.head = node_to_insert
else:
node.previous.next = node_to_insert
node.previous = node_to_insert
def insert_after_node(self, node: Node, node_to_insert: Node) -> None:
node_to_insert.previous = node
node_to_insert.next = node.next
if node.get_next() is None:
self.tail = node_to_insert
else:
node.next.previous = node_to_insert
node.next = node_to_insert
def insert_at_position(self, position: int, value: int) -> None:
current_position = 1
new_node = Node(value)
node = self.head
while node:
if current_position == position:
self.insert_before_node(node, new_node)
return None
current_position += 1
node = node.next
self.insert_after_node(self.tail, new_node)
def get_node(self, item: int) -> Node:
node = self.head
while node:
if node.get_data() == item:
return node
node = node.get_next()
raise Exception("Node not found")
def delete_value(self, value):
node = self.get_node(value)
if node is not None:
if node == self.head:
self.head = self.head.get_next()
if node == self.tail:
self.tail = self.tail.get_previous()
self.remove_node_pointers(node)
@staticmethod
def remove_node_pointers(node: Node) -> None:
if node.get_next():
node.next.previous = node.previous
if node.get_previous():
node.previous.next = node.next
node.next = None
node.previous = None
def is_empty(self):
return self.head is None
def create_linked_list() -> None:
"""
>>> new_linked_list = LinkedList()
>>> new_linked_list.get_head_data() is None
True
>>> new_linked_list.get_tail_data() is None
True
>>> new_linked_list.is_empty()
True
>>> new_linked_list.insert(10)
>>> new_linked_list.get_head_data()
10
>>> new_linked_list.get_tail_data()
10
>>> new_linked_list.insert_at_position(position=3, value=20)
>>> new_linked_list.get_head_data()
10
>>> new_linked_list.get_tail_data()
20
>>> new_linked_list.set_head(Node(1000))
>>> new_linked_list.get_head_data()
1000
>>> new_linked_list.get_tail_data()
20
>>> new_linked_list.set_tail(Node(2000))
>>> new_linked_list.get_head_data()
1000
>>> new_linked_list.get_tail_data()
2000
>>> for value in new_linked_list:
... print(value)
1000
10
20
2000
>>> new_linked_list.is_empty()
False
>>> for value in new_linked_list:
... print(value)
1000
10
20
2000
>>> 10 in new_linked_list
True
>>> new_linked_list.delete_value(value=10)
>>> 10 in new_linked_list
False
>>> new_linked_list.delete_value(value=2000)
>>> new_linked_list.get_tail_data()
20
>>> new_linked_list.delete_value(value=1000)
>>> new_linked_list.get_tail_data()
20
>>> new_linked_list.get_head_data()
20
>>> for value in new_linked_list:
... print(value)
20
>>> new_linked_list.delete_value(value=20)
>>> for value in new_linked_list:
... print(value)
>>> for value in range(1,10):
... new_linked_list.insert(value=value)
>>> for value in new_linked_list:
... print(value)
1
2
3
4
5
6
7
8
9
"""
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| #!/usr/bin/python
"""
The Fisher–Yates shuffle is an algorithm for generating a random permutation of a
finite sequence.
For more details visit
wikipedia/Fischer-Yates-Shuffle.
"""
import random
def FYshuffle(list):
for i in range(len(list)):
a = random.randint(0, len(list) - 1)
b = random.randint(0, len(list) - 1)
list[a], list[b] = list[b], list[a]
return list
if __name__ == "__main__":
integers = [0, 1, 2, 3, 4, 5, 6, 7]
strings = ["python", "says", "hello", "!"]
print("Fisher-Yates Shuffle:")
print("List", integers, strings)
print("FY Shuffle", FYshuffle(integers), FYshuffle(strings))
| #!/usr/bin/python
"""
The Fisher–Yates shuffle is an algorithm for generating a random permutation of a
finite sequence.
For more details visit
wikipedia/Fischer-Yates-Shuffle.
"""
import random
def FYshuffle(list):
for i in range(len(list)):
a = random.randint(0, len(list) - 1)
b = random.randint(0, len(list) - 1)
list[a], list[b] = list[b], list[a]
return list
if __name__ == "__main__":
integers = [0, 1, 2, 3, 4, 5, 6, 7]
strings = ["python", "says", "hello", "!"]
print("Fisher-Yates Shuffle:")
print("List", integers, strings)
print("FY Shuffle", FYshuffle(integers), FYshuffle(strings))
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| from __future__ import annotations
def abs_max(x: list[int]) -> int:
"""
>>> abs_max([0,5,1,11])
11
>>> abs_max([3,-10,-2])
-10
"""
j = x[0]
for i in x:
if abs(i) > abs(j):
j = i
return j
def abs_max_sort(x):
"""
>>> abs_max_sort([0,5,1,11])
11
>>> abs_max_sort([3,-10,-2])
-10
"""
return sorted(x, key=abs)[-1]
def main():
a = [1, 2, -11]
assert abs_max(a) == -11
assert abs_max_sort(a) == -11
if __name__ == "__main__":
main()
| from __future__ import annotations
def abs_max(x: list[int]) -> int:
"""
>>> abs_max([0,5,1,11])
11
>>> abs_max([3,-10,-2])
-10
"""
j = x[0]
for i in x:
if abs(i) > abs(j):
j = i
return j
def abs_max_sort(x):
"""
>>> abs_max_sort([0,5,1,11])
11
>>> abs_max_sort([3,-10,-2])
-10
"""
return sorted(x, key=abs)[-1]
def main():
a = [1, 2, -11]
assert abs_max(a) == -11
assert abs_max_sort(a) == -11
if __name__ == "__main__":
main()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Fast Polynomial Multiplication using radix-2 fast Fourier Transform.
"""
import mpmath # for roots of unity
import numpy as np
class FFT:
"""
Fast Polynomial Multiplication using radix-2 fast Fourier Transform.
Reference:
https://en.wikipedia.org/wiki/Cooley%E2%80%93Tukey_FFT_algorithm#The_radix-2_DIT_case
For polynomials of degree m and n the algorithms has complexity
O(n*logn + m*logm)
The main part of the algorithm is split in two parts:
1) __DFT: We compute the discrete fourier transform (DFT) of A and B using a
bottom-up dynamic approach -
2) __multiply: Once we obtain the DFT of A*B, we can similarly
invert it to obtain A*B
The class FFT takes two polynomials A and B with complex coefficients as arguments;
The two polynomials should be represented as a sequence of coefficients starting
from the free term. Thus, for instance x + 2*x^3 could be represented as
[0,1,0,2] or (0,1,0,2). The constructor adds some zeros at the end so that the
polynomials have the same length which is a power of 2 at least the length of
their product.
Example:
Create two polynomials as sequences
>>> A = [0, 1, 0, 2] # x+2x^3
>>> B = (2, 3, 4, 0) # 2+3x+4x^2
Create an FFT object with them
>>> x = FFT(A, B)
Print product
>>> print(x.product) # 2x + 3x^2 + 8x^3 + 4x^4 + 6x^5
[(-0+0j), (2+0j), (3+0j), (8+0j), (6+0j), (8+0j)]
__str__ test
>>> print(x)
A = 0*x^0 + 1*x^1 + 2*x^0 + 3*x^2
B = 0*x^2 + 1*x^3 + 2*x^4
A*B = 0*x^(-0+0j) + 1*x^(2+0j) + 2*x^(3+0j) + 3*x^(8+0j) + 4*x^(6+0j) + 5*x^(8+0j)
"""
def __init__(self, polyA=[0], polyB=[0]):
# Input as list
self.polyA = list(polyA)[:]
self.polyB = list(polyB)[:]
# Remove leading zero coefficients
while self.polyA[-1] == 0:
self.polyA.pop()
self.len_A = len(self.polyA)
while self.polyB[-1] == 0:
self.polyB.pop()
self.len_B = len(self.polyB)
# Add 0 to make lengths equal a power of 2
self.C_max_length = int(
2 ** np.ceil(np.log2(len(self.polyA) + len(self.polyB) - 1))
)
while len(self.polyA) < self.C_max_length:
self.polyA.append(0)
while len(self.polyB) < self.C_max_length:
self.polyB.append(0)
# A complex root used for the fourier transform
self.root = complex(mpmath.root(x=1, n=self.C_max_length, k=1))
# The product
self.product = self.__multiply()
# Discrete fourier transform of A and B
def __DFT(self, which):
if which == "A":
dft = [[x] for x in self.polyA]
else:
dft = [[x] for x in self.polyB]
# Corner case
if len(dft) <= 1:
return dft[0]
#
next_ncol = self.C_max_length // 2
while next_ncol > 0:
new_dft = [[] for i in range(next_ncol)]
root = self.root ** next_ncol
# First half of next step
current_root = 1
for j in range(self.C_max_length // (next_ncol * 2)):
for i in range(next_ncol):
new_dft[i].append(dft[i][j] + current_root * dft[i + next_ncol][j])
current_root *= root
# Second half of next step
current_root = 1
for j in range(self.C_max_length // (next_ncol * 2)):
for i in range(next_ncol):
new_dft[i].append(dft[i][j] - current_root * dft[i + next_ncol][j])
current_root *= root
# Update
dft = new_dft
next_ncol = next_ncol // 2
return dft[0]
# multiply the DFTs of A and B and find A*B
def __multiply(self):
dftA = self.__DFT("A")
dftB = self.__DFT("B")
inverseC = [[dftA[i] * dftB[i] for i in range(self.C_max_length)]]
del dftA
del dftB
# Corner Case
if len(inverseC[0]) <= 1:
return inverseC[0]
# Inverse DFT
next_ncol = 2
while next_ncol <= self.C_max_length:
new_inverseC = [[] for i in range(next_ncol)]
root = self.root ** (next_ncol // 2)
current_root = 1
# First half of next step
for j in range(self.C_max_length // next_ncol):
for i in range(next_ncol // 2):
# Even positions
new_inverseC[i].append(
(
inverseC[i][j]
+ inverseC[i][j + self.C_max_length // next_ncol]
)
/ 2
)
# Odd positions
new_inverseC[i + next_ncol // 2].append(
(
inverseC[i][j]
- inverseC[i][j + self.C_max_length // next_ncol]
)
/ (2 * current_root)
)
current_root *= root
# Update
inverseC = new_inverseC
next_ncol *= 2
# Unpack
inverseC = [round(x[0].real, 8) + round(x[0].imag, 8) * 1j for x in inverseC]
# Remove leading 0's
while inverseC[-1] == 0:
inverseC.pop()
return inverseC
# Overwrite __str__ for print(); Shows A, B and A*B
def __str__(self):
A = "A = " + " + ".join(
f"{coef}*x^{i}" for coef, i in enumerate(self.polyA[: self.len_A])
)
B = "B = " + " + ".join(
f"{coef}*x^{i}" for coef, i in enumerate(self.polyB[: self.len_B])
)
C = "A*B = " + " + ".join(
f"{coef}*x^{i}" for coef, i in enumerate(self.product)
)
return "\n".join((A, B, C))
# Unit tests
if __name__ == "__main__":
import doctest
doctest.testmod()
| """
Fast Polynomial Multiplication using radix-2 fast Fourier Transform.
"""
import mpmath # for roots of unity
import numpy as np
class FFT:
"""
Fast Polynomial Multiplication using radix-2 fast Fourier Transform.
Reference:
https://en.wikipedia.org/wiki/Cooley%E2%80%93Tukey_FFT_algorithm#The_radix-2_DIT_case
For polynomials of degree m and n the algorithms has complexity
O(n*logn + m*logm)
The main part of the algorithm is split in two parts:
1) __DFT: We compute the discrete fourier transform (DFT) of A and B using a
bottom-up dynamic approach -
2) __multiply: Once we obtain the DFT of A*B, we can similarly
invert it to obtain A*B
The class FFT takes two polynomials A and B with complex coefficients as arguments;
The two polynomials should be represented as a sequence of coefficients starting
from the free term. Thus, for instance x + 2*x^3 could be represented as
[0,1,0,2] or (0,1,0,2). The constructor adds some zeros at the end so that the
polynomials have the same length which is a power of 2 at least the length of
their product.
Example:
Create two polynomials as sequences
>>> A = [0, 1, 0, 2] # x+2x^3
>>> B = (2, 3, 4, 0) # 2+3x+4x^2
Create an FFT object with them
>>> x = FFT(A, B)
Print product
>>> print(x.product) # 2x + 3x^2 + 8x^3 + 4x^4 + 6x^5
[(-0+0j), (2+0j), (3+0j), (8+0j), (6+0j), (8+0j)]
__str__ test
>>> print(x)
A = 0*x^0 + 1*x^1 + 2*x^0 + 3*x^2
B = 0*x^2 + 1*x^3 + 2*x^4
A*B = 0*x^(-0+0j) + 1*x^(2+0j) + 2*x^(3+0j) + 3*x^(8+0j) + 4*x^(6+0j) + 5*x^(8+0j)
"""
def __init__(self, polyA=[0], polyB=[0]):
# Input as list
self.polyA = list(polyA)[:]
self.polyB = list(polyB)[:]
# Remove leading zero coefficients
while self.polyA[-1] == 0:
self.polyA.pop()
self.len_A = len(self.polyA)
while self.polyB[-1] == 0:
self.polyB.pop()
self.len_B = len(self.polyB)
# Add 0 to make lengths equal a power of 2
self.C_max_length = int(
2 ** np.ceil(np.log2(len(self.polyA) + len(self.polyB) - 1))
)
while len(self.polyA) < self.C_max_length:
self.polyA.append(0)
while len(self.polyB) < self.C_max_length:
self.polyB.append(0)
# A complex root used for the fourier transform
self.root = complex(mpmath.root(x=1, n=self.C_max_length, k=1))
# The product
self.product = self.__multiply()
# Discrete fourier transform of A and B
def __DFT(self, which):
if which == "A":
dft = [[x] for x in self.polyA]
else:
dft = [[x] for x in self.polyB]
# Corner case
if len(dft) <= 1:
return dft[0]
#
next_ncol = self.C_max_length // 2
while next_ncol > 0:
new_dft = [[] for i in range(next_ncol)]
root = self.root ** next_ncol
# First half of next step
current_root = 1
for j in range(self.C_max_length // (next_ncol * 2)):
for i in range(next_ncol):
new_dft[i].append(dft[i][j] + current_root * dft[i + next_ncol][j])
current_root *= root
# Second half of next step
current_root = 1
for j in range(self.C_max_length // (next_ncol * 2)):
for i in range(next_ncol):
new_dft[i].append(dft[i][j] - current_root * dft[i + next_ncol][j])
current_root *= root
# Update
dft = new_dft
next_ncol = next_ncol // 2
return dft[0]
# multiply the DFTs of A and B and find A*B
def __multiply(self):
dftA = self.__DFT("A")
dftB = self.__DFT("B")
inverseC = [[dftA[i] * dftB[i] for i in range(self.C_max_length)]]
del dftA
del dftB
# Corner Case
if len(inverseC[0]) <= 1:
return inverseC[0]
# Inverse DFT
next_ncol = 2
while next_ncol <= self.C_max_length:
new_inverseC = [[] for i in range(next_ncol)]
root = self.root ** (next_ncol // 2)
current_root = 1
# First half of next step
for j in range(self.C_max_length // next_ncol):
for i in range(next_ncol // 2):
# Even positions
new_inverseC[i].append(
(
inverseC[i][j]
+ inverseC[i][j + self.C_max_length // next_ncol]
)
/ 2
)
# Odd positions
new_inverseC[i + next_ncol // 2].append(
(
inverseC[i][j]
- inverseC[i][j + self.C_max_length // next_ncol]
)
/ (2 * current_root)
)
current_root *= root
# Update
inverseC = new_inverseC
next_ncol *= 2
# Unpack
inverseC = [round(x[0].real, 8) + round(x[0].imag, 8) * 1j for x in inverseC]
# Remove leading 0's
while inverseC[-1] == 0:
inverseC.pop()
return inverseC
# Overwrite __str__ for print(); Shows A, B and A*B
def __str__(self):
A = "A = " + " + ".join(
f"{coef}*x^{i}" for coef, i in enumerate(self.polyA[: self.len_A])
)
B = "B = " + " + ".join(
f"{coef}*x^{i}" for coef, i in enumerate(self.polyB[: self.len_B])
)
C = "A*B = " + " + ".join(
f"{coef}*x^{i}" for coef, i in enumerate(self.product)
)
return "\n".join((A, B, C))
# Unit tests
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Shortest job remaining first
Please note arrival time and burst
Please use spaces to separate times entered.
"""
from typing import List
import pandas as pd
def calculate_waitingtime(
arrival_time: List[int], burst_time: List[int], no_of_processes: int
) -> List[int]:
"""
Calculate the waiting time of each processes
Return: List of waiting times.
>>> calculate_waitingtime([1,2,3,4],[3,3,5,1],4)
[0, 3, 5, 0]
>>> calculate_waitingtime([1,2,3],[2,5,1],3)
[0, 2, 0]
>>> calculate_waitingtime([2,3],[5,1],2)
[1, 0]
"""
remaining_time = [0] * no_of_processes
waiting_time = [0] * no_of_processes
# Copy the burst time into remaining_time[]
for i in range(no_of_processes):
remaining_time[i] = burst_time[i]
complete = 0
increment_time = 0
minm = 999999999
short = 0
check = False
# Process until all processes are completed
while complete != no_of_processes:
for j in range(no_of_processes):
if arrival_time[j] <= increment_time:
if remaining_time[j] > 0:
if remaining_time[j] < minm:
minm = remaining_time[j]
short = j
check = True
if not check:
increment_time += 1
continue
remaining_time[short] -= 1
minm = remaining_time[short]
if minm == 0:
minm = 999999999
if remaining_time[short] == 0:
complete += 1
check = False
# Find finish time of current process
finish_time = increment_time + 1
# Calculate waiting time
finar = finish_time - arrival_time[short]
waiting_time[short] = finar - burst_time[short]
if waiting_time[short] < 0:
waiting_time[short] = 0
# Increment time
increment_time += 1
return waiting_time
def calculate_turnaroundtime(
burst_time: List[int], no_of_processes: int, waiting_time: List[int]
) -> List[int]:
"""
Calculate the turn around time of each Processes
Return: list of turn around times.
>>> calculate_turnaroundtime([3,3,5,1], 4, [0,3,5,0])
[3, 6, 10, 1]
>>> calculate_turnaroundtime([3,3], 2, [0,3])
[3, 6]
>>> calculate_turnaroundtime([8,10,1], 3, [1,0,3])
[9, 10, 4]
"""
turn_around_time = [0] * no_of_processes
for i in range(no_of_processes):
turn_around_time[i] = burst_time[i] + waiting_time[i]
return turn_around_time
def calculate_average_times(
waiting_time: List[int], turn_around_time: List[int], no_of_processes: int
) -> None:
"""
This function calculates the average of the waiting & turnaround times
Prints: Average Waiting time & Average Turn Around Time
>>> calculate_average_times([0,3,5,0],[3,6,10,1],4)
Average waiting time = 2.00000
Average turn around time = 5.0
>>> calculate_average_times([2,3],[3,6],2)
Average waiting time = 2.50000
Average turn around time = 4.5
>>> calculate_average_times([10,4,3],[2,7,6],3)
Average waiting time = 5.66667
Average turn around time = 5.0
"""
total_waiting_time = 0
total_turn_around_time = 0
for i in range(no_of_processes):
total_waiting_time = total_waiting_time + waiting_time[i]
total_turn_around_time = total_turn_around_time + turn_around_time[i]
print("Average waiting time = %.5f" % (total_waiting_time / no_of_processes))
print("Average turn around time =", total_turn_around_time / no_of_processes)
if __name__ == "__main__":
print("Enter how many process you want to analyze")
no_of_processes = int(input())
burst_time = [0] * no_of_processes
arrival_time = [0] * no_of_processes
processes = list(range(1, no_of_processes + 1))
for i in range(no_of_processes):
print("Enter the arrival time and brust time for process:--" + str(i + 1))
arrival_time[i], burst_time[i] = map(int, input().split())
waiting_time = calculate_waitingtime(arrival_time, burst_time, no_of_processes)
bt = burst_time
n = no_of_processes
wt = waiting_time
turn_around_time = calculate_turnaroundtime(bt, n, wt)
calculate_average_times(waiting_time, turn_around_time, no_of_processes)
fcfs = pd.DataFrame(
list(zip(processes, burst_time, arrival_time, waiting_time, turn_around_time)),
columns=[
"Process",
"BurstTime",
"ArrivalTime",
"WaitingTime",
"TurnAroundTime",
],
)
# Printing the dataFrame
pd.set_option("display.max_rows", fcfs.shape[0] + 1)
print(fcfs)
| """
Shortest job remaining first
Please note arrival time and burst
Please use spaces to separate times entered.
"""
from typing import List
import pandas as pd
def calculate_waitingtime(
arrival_time: List[int], burst_time: List[int], no_of_processes: int
) -> List[int]:
"""
Calculate the waiting time of each processes
Return: List of waiting times.
>>> calculate_waitingtime([1,2,3,4],[3,3,5,1],4)
[0, 3, 5, 0]
>>> calculate_waitingtime([1,2,3],[2,5,1],3)
[0, 2, 0]
>>> calculate_waitingtime([2,3],[5,1],2)
[1, 0]
"""
remaining_time = [0] * no_of_processes
waiting_time = [0] * no_of_processes
# Copy the burst time into remaining_time[]
for i in range(no_of_processes):
remaining_time[i] = burst_time[i]
complete = 0
increment_time = 0
minm = 999999999
short = 0
check = False
# Process until all processes are completed
while complete != no_of_processes:
for j in range(no_of_processes):
if arrival_time[j] <= increment_time:
if remaining_time[j] > 0:
if remaining_time[j] < minm:
minm = remaining_time[j]
short = j
check = True
if not check:
increment_time += 1
continue
remaining_time[short] -= 1
minm = remaining_time[short]
if minm == 0:
minm = 999999999
if remaining_time[short] == 0:
complete += 1
check = False
# Find finish time of current process
finish_time = increment_time + 1
# Calculate waiting time
finar = finish_time - arrival_time[short]
waiting_time[short] = finar - burst_time[short]
if waiting_time[short] < 0:
waiting_time[short] = 0
# Increment time
increment_time += 1
return waiting_time
def calculate_turnaroundtime(
burst_time: List[int], no_of_processes: int, waiting_time: List[int]
) -> List[int]:
"""
Calculate the turn around time of each Processes
Return: list of turn around times.
>>> calculate_turnaroundtime([3,3,5,1], 4, [0,3,5,0])
[3, 6, 10, 1]
>>> calculate_turnaroundtime([3,3], 2, [0,3])
[3, 6]
>>> calculate_turnaroundtime([8,10,1], 3, [1,0,3])
[9, 10, 4]
"""
turn_around_time = [0] * no_of_processes
for i in range(no_of_processes):
turn_around_time[i] = burst_time[i] + waiting_time[i]
return turn_around_time
def calculate_average_times(
waiting_time: List[int], turn_around_time: List[int], no_of_processes: int
) -> None:
"""
This function calculates the average of the waiting & turnaround times
Prints: Average Waiting time & Average Turn Around Time
>>> calculate_average_times([0,3,5,0],[3,6,10,1],4)
Average waiting time = 2.00000
Average turn around time = 5.0
>>> calculate_average_times([2,3],[3,6],2)
Average waiting time = 2.50000
Average turn around time = 4.5
>>> calculate_average_times([10,4,3],[2,7,6],3)
Average waiting time = 5.66667
Average turn around time = 5.0
"""
total_waiting_time = 0
total_turn_around_time = 0
for i in range(no_of_processes):
total_waiting_time = total_waiting_time + waiting_time[i]
total_turn_around_time = total_turn_around_time + turn_around_time[i]
print("Average waiting time = %.5f" % (total_waiting_time / no_of_processes))
print("Average turn around time =", total_turn_around_time / no_of_processes)
if __name__ == "__main__":
print("Enter how many process you want to analyze")
no_of_processes = int(input())
burst_time = [0] * no_of_processes
arrival_time = [0] * no_of_processes
processes = list(range(1, no_of_processes + 1))
for i in range(no_of_processes):
print("Enter the arrival time and brust time for process:--" + str(i + 1))
arrival_time[i], burst_time[i] = map(int, input().split())
waiting_time = calculate_waitingtime(arrival_time, burst_time, no_of_processes)
bt = burst_time
n = no_of_processes
wt = waiting_time
turn_around_time = calculate_turnaroundtime(bt, n, wt)
calculate_average_times(waiting_time, turn_around_time, no_of_processes)
fcfs = pd.DataFrame(
list(zip(processes, burst_time, arrival_time, waiting_time, turn_around_time)),
columns=[
"Process",
"BurstTime",
"ArrivalTime",
"WaitingTime",
"TurnAroundTime",
],
)
# Printing the dataFrame
pd.set_option("display.max_rows", fcfs.shape[0] + 1)
print(fcfs)
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Project Euler Problem 57: https://projecteuler.net/problem=57
It is possible to show that the square root of two can be expressed as an infinite
continued fraction.
sqrt(2) = 1 + 1 / (2 + 1 / (2 + 1 / (2 + ...)))
By expanding this for the first four iterations, we get:
1 + 1 / 2 = 3 / 2 = 1.5
1 + 1 / (2 + 1 / 2} = 7 / 5 = 1.4
1 + 1 / (2 + 1 / (2 + 1 / 2)) = 17 / 12 = 1.41666...
1 + 1 / (2 + 1 / (2 + 1 / (2 + 1 / 2))) = 41/ 29 = 1.41379...
The next three expansions are 99/70, 239/169, and 577/408, but the eighth expansion,
1393/985, is the first example where the number of digits in the numerator exceeds
the number of digits in the denominator.
In the first one-thousand expansions, how many fractions contain a numerator with
more digits than the denominator?
"""
def solution(n: int = 1000) -> int:
"""
returns number of fractions containing a numerator with more digits than
the denominator in the first n expansions.
>>> solution(14)
2
>>> solution(100)
15
>>> solution(10000)
1508
"""
prev_numerator, prev_denominator = 1, 1
result = []
for i in range(1, n + 1):
numerator = prev_numerator + 2 * prev_denominator
denominator = prev_numerator + prev_denominator
if len(str(numerator)) > len(str(denominator)):
result.append(i)
prev_numerator = numerator
prev_denominator = denominator
return len(result)
if __name__ == "__main__":
print(f"{solution() = }")
| """
Project Euler Problem 57: https://projecteuler.net/problem=57
It is possible to show that the square root of two can be expressed as an infinite
continued fraction.
sqrt(2) = 1 + 1 / (2 + 1 / (2 + 1 / (2 + ...)))
By expanding this for the first four iterations, we get:
1 + 1 / 2 = 3 / 2 = 1.5
1 + 1 / (2 + 1 / 2} = 7 / 5 = 1.4
1 + 1 / (2 + 1 / (2 + 1 / 2)) = 17 / 12 = 1.41666...
1 + 1 / (2 + 1 / (2 + 1 / (2 + 1 / 2))) = 41/ 29 = 1.41379...
The next three expansions are 99/70, 239/169, and 577/408, but the eighth expansion,
1393/985, is the first example where the number of digits in the numerator exceeds
the number of digits in the denominator.
In the first one-thousand expansions, how many fractions contain a numerator with
more digits than the denominator?
"""
def solution(n: int = 1000) -> int:
"""
returns number of fractions containing a numerator with more digits than
the denominator in the first n expansions.
>>> solution(14)
2
>>> solution(100)
15
>>> solution(10000)
1508
"""
prev_numerator, prev_denominator = 1, 1
result = []
for i in range(1, n + 1):
numerator = prev_numerator + 2 * prev_denominator
denominator = prev_numerator + prev_denominator
if len(str(numerator)) > len(str(denominator)):
result.append(i)
prev_numerator = numerator
prev_denominator = denominator
return len(result)
if __name__ == "__main__":
print(f"{solution() = }")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| PNG
IHDR ʮ sRGB gAMA a pHYs t tf x IDATx^דfו _3c46=cfSU% B{pwZkZkIA2H A2sosGXcnUߕgu9b d+dɋ \.p \./O.p \.p \_.Ȃ \.p \.
.Ȃ \.p \.
.Ȃ \.p \.
.Ȃ \.p \.
j@/p _2q!L\./'BYGmںeim¦emX~ӹeٝlز
[\ڲ?
+rm[ОՌZK<ybV?guftߪGjd*8|0JvPl;V wo[.ӱiYྲt,gqYcъ6e7GyfaR6,唦uKi\5~qܫ_;u, Fy~ŷݪ]qh=pcuzySΟܰi~/9gv,,]2[}ߓEujY5vzٮW-KvrѮT,صyZfr*>[^Zvj([7JRɬU:koXD%[% |3QsoUj[7JJ ;ǹ8J Z (ٯe R¾}.a[? =
oƿ~ӶuᲶimW(.eh]U֯ vw|bޮڮw^hI7(Wq#_۩Lw쏏 x9oTߧo;_D=~FP$iM+.+{5F,empv~ǿؗںmJWJGbU?ܚ'ip|&r*|uʒ+8=G~_}G^߾euYF=ضSHO ڮ]^f 3~ۼeZNSl> K8<BYqϬ=lB6[Na.a#o=l6Ǹm
nm
կYG
)W6,Yj#
\oYj3xL=G 9[7v:vv$լ9W8U.Rh+IUmJZv%OؽIЮV d<\*_:t^ #yf1[<kW~{ $uEɴҙS\r]yW5tuwdS~ٿ wW]G3v|L9|zT#$]k {ķΓ,l~2E]l\D.+Ѳj]ۖ _ٗ_~iVұf%]V30mG +w<j6zb 5CV=xpdC d.p gZ? >lHf- ruYv4:ƾ+~gwL#Ct6r){#cBlﹽ: K|>6<'[<hXqOK_D~!isp ;-U[k6}=r
{J]B˖Rђ]A
Ec\kwKzxX5`͜fdhƮLi1Xv$s@
=u{QϿWX `xΐKl9-v$Dw߆DyOs _
zLZ{QA~^u5֯nGٖ'!I蓛svb}<m7$Ӿ_z@1߆ׯ8d~ifMQ'׃
m&g ~篬axr[~pZ}'6j{MZ zbuvU ooӍoϟK,;oeo p?r1Fc[߮; U
wcJ^9:cnӂo }yɒq)
ɭZľeKi~ {yя}2of}CM 1 }ŏIiys.*[uܒws2{ó9:9t\r21
~>uo S'#e[`ۮSbWkPgwnـt։%eWb_)CS7;vF8G=TMɾ2]ge[]K !vblإװVjFxƿ~}%\JI>gHYѡ2'UvBEG/8nT
9W `qfmm mqsԡj&'|wWL8|bcٯ(G8?RWd? 3YEpkӊh0(x/&p߶M[Yݶ/~j Vѷe;8;V3g5c(9{u Y5D"TIyPN8)" "'2\ ɑ e?
dm>q1 qUv.Z~x6 oZ9WD$ <;r
+(]B7 o@zNj@]>:GL,'ï9!"
Psқý|$(0a(_ȽJ u+ǃSVP?h+(E*M [l Czg:, r$p2cD|0S~vlx]玃w9 *϶ :z H7A#o¹|_TٮR?8 s_Nئeޡ_Ժ@ H r4$81!AI lGIyLpHDhf5r/i[ e?@r-b yxܽK m{^Xeak[zojgl_Xym}ϭmjD`E#V
d?_NB^GvEJ"G2N S8]"p0XY=WbpKq$?8 Gܻv ^ idn5 8]۲o1^HoT<(ˁԷwqT8A C u_B " D<QSL3SjӽIzתGP@)odfՆAp~紬nڝap|ƶ?hꫜ8o~"b@Ya^r @.?bZ" tee ~u=zNԈwt5^$h yw8NG}v;/IyPj#*þew!7yc-O 9 '`/-!1n3/`68hUj XxjOڧ7odJ%=;V @ sfC/H$k
Yv-aۥ;ێjClXI2H|DȂpjpFHoI 鄪'[m{8wuJ
}8HKSOk]pzsL_#0Z٫t&(U l}X.n)6C?Fɴ]E>i.o YYsJɲJUp! tΫl; :.sy8_w.!QsJ!& <
,djpI;'TW7˦úە3ٺ
^G%x<ԃ T.[в({-@{jfljy~?oO-[Ekx:[Ȟ5Zc}|kXck{۪|tl#*_|5bunl~u t.ۯ"O\GA28}Ue W۴n[ ~HC|v.T0 @0 nf>}N ugIS|k])!țq|F:zpc"A)m>3qbkŤP@ DVS# Jn-9.!+fc{P>hKmbΫ\+fNzD Ɂ0سe`_$-tD=/)W h]d6f ǔ7-a#| 7.Z' N(m*'
A$& /TG+7jܨfǸVR$_10~nPgDODN"p%ݡſ?}|w _V֭~xǪA6U<l`8" pDDc !$IKdž:w-B&FWFVY1݂6l q (d) 0rDA G]p2@ BB
)Tvd(ȿx{H
,P2 D P-Rx ΟTA`H-^VP-{}V^aphnFd*N_[ piz8oL>F 8Y!s#\_Pp vJ< Sb[Ur#g!\}@LH6N R@*Ck!z "[ݱu^:@yԩu92 JtRΆ !QIJ]NtQ A-~%n2`[
EC[zU4 ?-Xmش"t@ F !K/u
ɸֶ
8eɽZ ۽G`imsȹrtE>wv&g90ܪG6]I D v^ Dp^۱hw) N -zMϺoE ^^&"&ܡo+0쭊IK} ʨIzϮTٍ3
e b߆ ɷ2
E.y.XE^8!Ő.<rCACؗBu|YDG!B= |$4sA7_qF頎\( w"qPcs9X "\u<=F Yb*EZ+?a_}G mYȢgTM' Y]pe
)s@E go@6rEuo?19eZ%()[9KU!ܸgTn؍mtݪ5~fZ : [(B$ʠW^,)8N U_ci!{ArF,S_%85 pY,! e
V:kUC~%WyfF+%v
qUrɺˁ p 4 {9D?3;Oc$Dk?qߵ211" i!"C9+ 6"5P-'"D<$`;L=V{d='C+=C h ^Cw~:ߵ6ʆ k _!{O{n{בu+ /B_!ʜFv ؓ ,8Qp[?@P;?l_-dJ
P{vmH>G.bٚ
=8oB~C\'!7k[v f픗
T=M Ȇ;:G }ݏȈB > <;7e3'ɕz=1lfɂ5,sm.f-/?[f]eOۭ>{PfOV~% 3v`LY3NI;vM@vmS!&
_ޮr ڎuNy>^'+q_goCϗoΈ@z#9v?7*DOS):q ge B2]T ADR>gD]7K=}E;j&8ȓqV&/`/U#[co _Yu?ضmā ڳU{vrhk'unj[`AAZEx'Xv7J;KVmmWJ!7aD .@
OIIIq"vɀ$7QNjArGh3 P:N獳{][<N绁c
t>/B ҝN(Kv tJL!`U,p p7p,4,ྫ&D[ `8g< v"BD" ݇qu "& |
u ` ?8 pD?8%lppk,h_'H3_=zV'& B
<@yBbwSr 'ADr=`6;߃p:0FP˵zOj;KN h6BBD=˾Z;ozbM *A YмM/o/_̒
n0l"sV: [Yà=Omlت:ss {g̡3?h߶]G8' Z?
SW,iβ RDoVoyuN C5ʽfܣMBNpmq@7J9zk'}J 9v'ٽ8/&.EI5r/sZu= 1Yo#$gWKU#_RKG?
:-C6]ϩ);Pq䊺0,p b́\*XGt?D+Fpy; < & T qp_"{93(V(HQYY ,- 7{}sQTc`A+h 8OE(p/ {@v?_߇M #0X^X?kӟlVl¡-ҡ]}b%lrUw/! DrujAb{o 6a _? Bk}\O@P?i M{Pku蚖%GGy\ry6T> X߅euSﷆ@([~$N<=Q$Upr '50x~_zjW8ROg{xݢx&ŎwUomj[,^Jg|G8͔
7A芠e +l群$sȩr6' JA쟇 ^D 5!]xݫ<Ca H- zK~cRPb"O)Q]^pqf
֩Kw7"V7
IGq<9=]+ڷ'V p p?ݴE[Z?ZCyf]{ >kUu6?*6 ,w [ۅгC|M~@}{AHiQvoEf-@=^?~7 9:xύ3ھ0{[gG,+ b t{|:ȂߨD'9uEA
SoAnVcw+w1 '18{nڮF&e ^ J$ QG fOzuCYok]F&Ԟ}c鮽b[mt_A]+Ue%
ïkn n@Lе5~W8 ~
[¶#I eR
^% N# *um[ 0y彇w/>!s8Q5J|AL j
1Je{0u>M'&rk0$C tJDz dANW"@ 7<@(5T-[]۵~K' p$6pvP6VJQݻl6Ċp:9XlVE jI ZNơxCp(ؿs$aw8roS>aݬ̺ 2wgg0`9!]@pܴ=
R ¨
ANRB3:GܗX +22r O+V)#crՏѾ H'XVmm~`]okD cxYq-/QVvEI q]??vp$XIS__CbPD pGc
`^Z3EeA
Nzt-/zh½N&7b +@qxj2b}-
ۘL%XAH wU+ c.P ⠦D=eoslNABu Pq:Vܳ>XkU`_ mhzCnp֊T XIÈ g{/VL0@5C@P
}Mpd]
UKQyp旑
?Niu ,el^Ze5
Y;D `!& x=qK[ r9XV?cI 灂F8iLA^bI}K[YC-yCffϬ#R1Lptk@zmge,KOHցjԚ( Vh@g7qg{ σ@ĤM 0A(L:_UpJ,~K}ɂD u=F"g̻K^y߹ ش"8C
nY``ŚU CSV?m;8U YA͠ gso[Y nIkw&.Q@Y-t*M$r@Ǚ8xθ[MP=jȳշy uۜw30b<ˋoR6a3DQ9o@ ى"'}2 y ɳdߡ刄d_Agy%t[oPJXw{|; +8Wpx/gwٓmeاzKYu^?T/,(
2 /Qg7d_r2uɽH
p>dc:.qgI{Wѽz-~l )PWT@v2^o"[M[P{v Ȃc#CzZ^/B`:flf~? _}t ksBqtr
ln ݿnnIU}A?Av=_] N D "YJܪ I˪[LΛs{Ku|w1&?SkYP 檐QYJW˱ĝ3hi mPր:R7'!5UY֩+k ѱKhp,;IDAh TI߲5f^_Y 䕜._nCkGvQ]Y' uScg:
E\ "ے\@ n3Ds }d&
1|WH'1yc9\2B| Ui,)ޝ)K>zճGx \i&Μ2@y:^I"b=}gG?|eT
Zؾmڎ}/7M.oZWPڷM`Ǘ->@Bvf @#u1 ;%NmDI:)`?&n~K};4ZW@qp^$/ [: ,@"-8Ae?r4Hc=AIQS7 =)B?L`l~9
7pA?"$LڔnUF) K~ B餁m(8<PGG8v 1V㴸`ˇ1VJsQ )7CBSƃZd%4n8uLT^At@(`ZΒA 1"jqpen;&!3 5C"%>k^=-\C vpbg ckǞ,A̶] "D (< 28juRK G5",rD kY-]AU #V;ku{U+ZCz`sxf/Y_5+¾U+SwI_9 ZI뜕!9pb {2:<8xԱB {r}ɩ:e(
(%A`vAy (֑){1^]iw+t 9tȇ.AK.2#}g<$0:B 48Y`AjeI{w]T C=Q+62%uBmq e zv͖JpJÿҝ+ 5ɂ;8dSDYCXi}"g'
( SϜpy8o"_w=sG=7}'\'Qwx}ƁZ%b &b86Q
e˔e\"+تBlr?z` kزU+س kܱ[Tf 'Ma'*i&V"ٟm G@$arH^P4x(LIn%3i9~f_O[Vˬ7:`tt¦!!A v = yݖζvɷ; r=ux.=S& -qiߔ_[N7)&WàW|`o/}Zg ++n[Nzi72ݖhk%3.^ 9qduVvy܇6<߷Ⱦ h9Ƨupd|
g2*lcqZֶWPwJ1dnUW˂weM, yy,JdJ|lpg XȞu/}gA}YWg-/
ز |lb
Nޅ܆6) ]
br@˩x]RC i9M" 35NY
2ٰhY"{ns=Twyδ=d{jǒ%wqA
7c/ftksSu[xu4( :|a kvH r1u[ʱ"kJW{ qK"wc dՒ:Oe7 N\=(#ĻRVO@ם¸dpT=ODXLzYr]B^5;xGj/UYA u15@O=lcHy
7$Ġ Е1C>n2OjeSG[i[ae҄10ɖH2}ZNDz dk|AP3バ)Я&hݳ}ޱ]CD-X;RJ9ǃԌm?23uEYJ?Vd9 aнr` ) *;(GV\%˨tgBDA@ h},D=8ޕ,P6ߠ 0AXv)6jD
3il
$"DȰ^(P-
ߔ د}Zq2{ 7 H;R`w' 䬲||wX1e6?, H#k:d0r$m~mr/'
xF KABv ΠG-j)N+% .g;&8l= si99<R;Fh y_0u}k?~ K뺆9
㝈H g}dCM{qD 9J[{7 8yz%r e_W"m+X57Z
N-ں/筶oɪ֭xpъ ;Vٹd}{ZnV%Ҡ3۶! ْ|IgH6+nYy q+Lus|ЁJ
" \X6DaǸ=_$Yrw My8 'V;
u8!XY\ۮi^]o@/ٕj:$'Ou+ۃxPuٕj{dVXRV<c7*bbn,PJyO; 'PK V myL gThd4eY?|O>StD"tAoq:&>i21P<}c%$fF$ctU+=d<gdJ"3=*̯1d
8Ob`ߪf&OoZؑՎ[u/֮/?zkj#K mz6l :QX}`y={#ѾA(Y|/٧8Qxγy(M$jT@![n"N?ca8cYѸ~=w?"7V& ,صGEӳcYCE$ H2d ~ "
rOze }۟ ~M?*Hֻ^;] a`N^4%W=g=d`sQ;HTa u -qA#we=p*&~[Cpd>sJn׃\:G%Y
`'yWϒYsgR$ ή=/sC AA4;
1IQc"</ٵAd~~`ݴM}k;CX͍]? zwujͰ`zm[a< ?{`2)ҁ?q ږ쳂S(؈]?@b$h9 @$"mmF=R=su]F^,wR p W#(}U
ּԶ0 !!fHi
=9Oݻ ' %]W}yHW 1 fZ+(o!־%zY8G@b {ͫر\ľW.m rЏ-ӆVZvn$ލz|x 3*4xaLl"-5 ʟ_@BLV|qMF5&Zhޛc͡
'
BUqzAzrWP|5]k #$Vݍen`SXC)S'OUq²weBECѲȗp/} Y%S%@]dXJ2Xߙ,i 4k5uڑ}ka<0vd=?~mdiךah1,%P精
ͽ+!ȊG9V;n8
b,hP Aja$ ;"{
uQ8_F 4cMTR' Bg cVe wt#AJJ'ҹ=%Rc_QA z( b}pue 2 6lNDp" `;/cTz rD68@I7!& shwJmCBY>emv%] g)a
c0OwS"^.8h{mWݟ; R^7p@J ů \_eQz'8j}b,P
M! ' @ Cۥ"A@'B8u?ίgZѳ0{ Ai:S,FfpۚG 4O Z܉5
.ƾx_6SUoZ:AêU
l8ZIۢ5k2
D(Uϝ4N-aw1w4ry~=ƷAr1Ar9arkf~ {D V K CrZJʿ&ϝY' Cd7T JmSp. i<_?Rk)zMz&
Ξz *C? o$ BHD:I, +U =a#6rd7KyiA1 M\ !F HC<}{k8p
%z ͳOu ;mζSmAN
5d η 3q@kpBS}0mt 81oo
6prn]0@j, Ne[;+^' !qޅd?!^d_/GNTb㇞]PNhyfM3'2as['/g_O68j%8Jv 5mO>5ZQׁ$]" "1 l~Țg x+("KGkRޓngnYe8^\ =|ӼOu
HPz
8ܸl-+5~_ &r%(<Wy@oAaH \S`[B]#@d>5ਣRKZljjy RxOrEr$J(߯#nw;aL3r;
>vb] HNx&(',:{P ,+h,k _2~}NJ~7rZ.y
𮧽ԱaHڇD=߷QoaEx?/& b-& _'u#G0r`Mz66~s:Vmzyy]×_uBr`*z=qlU}31e" 7,"pC Cp0F Ah{HN" 5[V'qϒ2Qq 0CvB8Wk4Wvqʒ]r۴=hrH u;o"~V@@[dG }CLĭ"c莬:=GNUv!:Ԯ
٥Zu h=
u@:5pK܋3 h\k"d}<@.n.t P"-e4N댃 0~*CȏpyED>< w~Bl/r({Z^} Z,&tv:5uO3!oIUF%:I$yމ !tq]2z"aMsxXY0A='"De? 3YP1D?gC;0kc }P ,}j /_~nsK0[>%RQϦMqn
f)8RbQGD0vqD$B
,@:Yoݷ)Gaf5ڣf 2dPпf#VYaQd 1Pr`#RXAV R{PKe -8K %by_6oA`97XV-0k$X9b:DYP;`3v3Ӆ.
H'!ڞ?g<>jUaEpACZAN[lW 8q /E ; <p*={ 96JOE)草8?Nd;btDT $hM8
' @
ý+sÉ
T7EHWkڈ,h۳#Gԉu [}ߜm >?ȝ܊Uu\l[¼uZy: #+"xy`:@${1W' {Z qo"S.Pp,+p}";+0g)=GvP-B h{P5jŝc|O:~e4 J>2n I(ɉw`MjɿB'gWax !? pT [1fJZymU6`+Vr`gZբF:&T(,$u3 wCqJN$C~.4 ITٿz"r6r84 E.R!2f y}[T;Ɍ2${4H~T<*W@)/CY, "D$ɨ/"q_<ڮ ƺL~1bbub O+& ,[xk
4uG4YТmk}}? -XV4e+Vڹfe5s [q#DYͲv~dNY2.Y,+hĠ'*O}ݟweZ<ܳ
" k|?k bЪ'L `'D +;Mx7:GP \mOA;.2/ϐ| 6 P"S4H1MA}eKmf_2yn 㑓G vhk3r?A8цJEH} Sv}n";
Tw# 'äW}e> X ȔGtO -097or6EBzWr5.;3ܠO\ aH_qoiVWвqo&3
,1@ZCL:@d~x%C2,huk6t͟X̞w?jFDwlXE!e3v#dw4va:.\@c2zZubwe
h_h_0ΙGFiKo%-! пS>aq_t^-+Ai(<A9I*p&M " WB ^~ d26VŁ])S<g m]6|`n]+
zg½ '>DqT&QP :r{[-0I9F~}5o7
>y ghMSv(Eؕi== FvS\l+%Wk5lX%22K~uSzP&7ZT ޔz "yF'I="!O{r%U
e\)Q tUQƄ2a(]e<8[3M}W2oBf
I 0!jMٵ&' &cڧ|۳'/O7> ܶUY #9#( 0t ) L
N 8G?N_P@-+@)A"
Q]Ȃ @PG*op;( J
BY U*dxf#%0g@XmT.PQ|h= GAe8^j ?vOc!-V Bx+S
1!)ecF §8eާ2
4Zè2w(pO ωzZ;BpT >rqW 1Qp:258e`;xHЛ576Q.Tp~{F)pp _J!Xw :p . O9w&X5AiU,>U0~dm'ֆWtL؋?g/^دwo-V6,!咎E+e{'VҾ`Y> Xj&rc8Y:f;仉`>Bb+p6$aqz~/ Dj ƥfoO0 EA> C$wx@FYؐ@f<曫uGR" , m8]pjnڋ |f
8Mv?ƖvNާ\/:Y>9Kx~\S gP9 ]0rlKn8 쁲0yY
Ğtu ӌ.M7܃ 6u93ĺMݮM%Bϫ{}k\)<.4h [O!:ؖ">^ )upX]؇yq"?8ʹGt;:>Z~ 7sV se_nzw]k+ɂJP1fv7_; }:G
'w
F-cJ;Wcj)D}z[=MӚdREgd-%@A|(|%!@ї7 nZ56,{. 8% 6wG$) DSD&L7Nf^ELv}ݏZHk|"u%JH%BH$"]eى%"p6Kq$ :a
]=bXܵM]7R?eñȏ \} g]Qzn'ʽd*o?'[)d;@.PǃK#٧ NS*m>EGƳ_/#M[óawx 9W2:>[
<KSsJ|4G^d>D.OM $#@= boC FZ#DŽz/K.Γn5E}l6,+i?N=_g?UhI+ zew V=aTM6?K#@w )2Db@ ]
zOȩXٕIK!w &۶fddJ&ruY#Ϡe!ܿOi !M(Pn,></@Aud@LD?GJK > XrA7F ¨ k2:JO%3P'_`\G d^c _"egnk|5ťv$>hCwPn]i(9gt ݫRciHF~ʌ]*^U|G)a?ſWRԹda AUrM(c=ɢtkڮtS_:R;&;
Y
e ]b8EF*4s YBW0(h'"w& 4GT,N[>}kbeby};>:C;:¹aذE+ [Gҿ@Pzd
2-L˨Y5Ub
4~C$+ )U/ J'@6P";Bͬe(p] I.d#NU|MSmWQ , H9/bLPI<sA6b
Ȃh92@!_0r B)(~ 9
*|]]
RFmĚzK+l ru3<8y =u
OQYE1LƲ `pSލ9x~1I l"piFhQ?S<S)N:oBW*c= К>vMe @ν GO_nvlS)çʔs E'; *\KNjQS p< 7w|9" S!ܿe e[ lyף}k 1xh
6r*:'G?-./nXU AuZY)
_#/ڋ>AMgY=[>
",k Ku<ww{qj 8p<طΕܶ14~@D,,q$R~
Tmλ#wJg:12W>u#}c@)q 2o厪DD(*,BvA1bBF6FH)o/c&8 d`53V"Ap DvŸ ;
\H!#z g: K"'c+h-˦~]F8acy
'" PeԧhxH=D<oTp畒:,ޗ|;*Y9L㜏)L^&m3 462MYx@sgElJyg
*(T zxx8!HqZJC[Kz}`jG2 JF_wwcj:,ڱ\Ntwɞ#t вw-'Ucdt_N5ifׁe"v50ȑށh۳!8Aj55zA)I_MoTm])\A%W6Mvｈ3@Nuz%@ v" D+VНh,]p ?v |\*Hwⷷ9)ɂ*m{Yybo}66B,y`=s0Bb 9{E|ݓ!_uK.nKcǾK%;#on Ʊ|;RɢR}>w G:)/ݬ _>Sw8wW ڗyu>/MiWz;z{t;54P6( f{sꙥKDrܞ)Ż3dO""L/O$cD2uw8vGD$FwXz]
8m5{bݳGV5e?Wj_|on[Qs7ZQϔ.X~ۚ [q XМe Y~ߑel{5Ee<0} , @a0t58j =t!+(v@OA1 BёAIdC
f]Șgw `JϪ v -S ^토"
ˣ |,X譊mZ<ceǟY /pdV-ڛ }Ys)et6 "/
AuM-Y3v4n{<gM %6$fC&X ڞJ 8!UY$[T cYwGiJMoJFo&xV:۳XgẦfg/t&:@F 7YQρW95A[sY\>* 9Э1} 4Z<զ1>KSr
^L,PFL'"_5fA͐f<lVe X#-ݵ={;gS{``
eU=8N<ڴ<E{rtls>uc0@Qe @"d{PyE(PFJ#US P G
^xC<UX> _aX)NLĵ0Pd>ܞb tmWs#vpJ H$lZp."b ˰x! hRЊ&oF >ց%KYͼ/YW GT-0-)oDVU* Q|zspC -=ehh=c4DIe^ O9F\a>9m"=kiJ]#
õ9GB2 x Χ:
!5]^ va wnZY]Ses-!XU+M" DLPKQp "A ""& _+QIJ_:kc<E&ck=Vٿf#8
qQk[®5Ԭ)kVǛV>eqڦ Fn?,g "@3$>" I@B0# P @;}z7w1-} 9a;V
Z=dJ-FPcIt -j1aqAVz"0א{,8OO@!b PP rrZ5{?NbvyTc փtvΆu $1|Y Wz̮4O/>jG߃H>0BN:6$ģ2G}q aq4U\h0e( g^DHN)G( q8sۂ^R"g2?mi8v&z"} e]:jg ɾtNOMDRp%'_!AAp 8DP`RI&,P@HoP'U/ pϓ}Mq&#k: sOb`ZV_JGuqn e+߲!S<ʺ{?vtGN;ǃ"{wɼ=BfǾϖ!ݷ4da+DBT7K}r5rX#PSZ QdҮ o]N-
4nVJ[x Xʷ7YY@|ܮ+=ʨ2z탏n|٥ ̭ q3m
+~/}'@B={
ٖ:2@],IJ~a(nc R2sI]+E4/B 4 '=MSU")>Bt ă_52ۂ~ɦ.i W:R"%3pL:\>8g2 V:[ݚr|??V~tNݳH`L2D :Y@UcA4UDHF@ H &
⬛dn5 <k #Gֈn >65k ٰ>M/~m۲a+k I` g[<1@:Vw3hƐ,Lb5 F{ЇO7=&]ݎn{w{[Pԇzer'"scRdh
f(g&ȮP 0hߵ
CzDck˔Q;IЬ y} RB <! D -~pg|,We5(`e; Ъ~VfSK<qugV~ zL>@3q :BuP% E6T+$*ц(FeE`3e~ 6T3=F浜[|a;ۖQ@3XhzL1ŵ ~DtDa˸M| hgX"N^g };k緭X ϛxܟ^اUS؊il<VduaNJA}< F TSVC U8 I 'm
@$, muc~O?Q#@Eעwܡ@jX& #"<k '+d hDe1 0^?([BNZ;@^Ulk(^$N i (p]ke9Q-8=F~~8 Eyq z56&
% 2r`ϲv~'GL r!'G-!RQ]=99
k띶$ 2j
X5ҲUzj )Qp@) Puc8LSt麄
(bT
U
X9˚m(:6T
EBxbUϯOC@^eM[
jA,Ե1^V M;]Od@_u<=~K}47OI 0PP 7 TV@)J)BYyA c'q(u\bٯ:' p@Ս8 YqǼ
, ڳ~L0a_'? Pa<\M z:2
:P;T$
SQ ,e
(c$RM$
u #2X*Qׯ*zrnx\V(]2;>IW;3e1!
"8VG#3I]7#A@Qw >*)e& m,ï`^88w <_[ Np?hͮ>A}N
OK]L`гKL'eDȩJQ*OHt 8 aL,g(
{\$G.K_I߮cwT[ rTY=lL #,<@Fsc.؞Ǯ3#\'_ǻ̩ חԖrP=r/N>Cst
lH"n sRQֿoܻs)Ii{?l[
J*Xxزz Yq$+XV` ԍWv' {` ' ~ ?Ck ߳] ۳ C بO_ǟj8Y [#uN&?@Ƒ}{ ]ƺғ=!ei?O³K=gD։,A=Swv\`mP|b PiU]c m{xƝ^'
8۠[zBchLuGH~k<j@,%/b:n9+oPީ"p$L~<*>6㖜]jk Jv]lH*YDhv E,S
!/ euJ5!#*]$wȵPH YLsxK
5zAD㒗"= tґgs Ȝ-Y&/ G}˗:Qc@i]aU t 6l?uցtCΕo"T$f26<θ
c D>~Ȗ+?X>UFuo] ༬ok$ xǚ߱>Zi?|_be 6ĞsZ/>V=0n%V24cCV{(n9o>ed}kUID^^Q RkCy)BppuyDT2 @MpOP
^K86R>z^6`wr^?iUXضJv.P 3 |k`\ϕoPcj|lM2.؟b ." Ed3W3>EzX (YOݴf֨L*۴7ngٝ!
2d!SRڧYV_(5dqƞyL}Dpz$3lRshvȴ(',=RtDIoP*ʳ
Q3H dY߉X&o%xo%~$Wא9,5> fFk?]"N(E.K٥JOerlu1K ;A8Yzʳը.:k 6y
Dˏ~@g3AF*oUǰ'Ku[3P OqHI 4.IZ>fB";]ĖUcFن 0/;ἉXߙ,8 #R8 8QSU ֟S[<?~`McbT߽b=+ ݾu-l=1ͳ9$ `k% (;FYjCEIx* uJըN4
vIU5tYJY$cu~椁RQ9CV!r.~#@[ F|p8 EU JyvA)n
MڝK}fOmslfbGvV ( Eq@xȈI x^ O' A 9AWP]zPA]Ӵ{;V 4Ц5N9c=Fk. [Fp^YgYYJ_Jc," ]J)uW}H Υ^UkwP֍'! 'AQU<K5au=P {Q뻂 "D
V\!{7PkZLH oȑºm $X5M}T pPǍƧ/O?Qmg',$H(Dq|Svܦ> N$Nz '"ACtVj;@<KBn O7+pgC@U%I /F/]36c G"}
Kih8X? \74^%젷v "DD(`5"~z>>} 2\7M r eLPw+9d!vل`]翲lzi˖ַ?_GR=!` Sסx^%ݦ@5Z9 p *7}è$q ($} %8rΫj* TjjiG֧Nk.<g֥v;5CR_K֬}2XR1kfQw+@W:B-rZƕMG@1{FC SPLR(:!y A< eܫ"ZK% 0
R>J7NyߏxZ5ÆOՋ KVtظ (x'U[V?o5#-_=IK7OOlu)#?V9; BXQ˔\ f>4Mi(9Ƚ ?] F\V&<{X:!*vrz ])nT8i~9k=S.#+" Dds+b%2۵L^l`ػIa][2/RiFv˧3sb_b
Ppޒ~\ a?4Bu\UÄW<
e#fNGd?w!{nMt0u v) u;7;8Lj:HS =u6k34u]g"DDΌX葕jp & S l :2jE*:/G>qɾ* z[ltN:Uu tՃn Yp]Cѱs,>]vsh3 yFttB3dխ~6Ő,GugBf5< ޥonWWEݳ
1Y1!Ko'ϬI<pl
}gu.滶60<c?ُ>7wppɪF #yK{6͟ \tbarԲ>8j
V :I-aӐ]%B*i#/ e0"%~Ȩe<h
Z1: }^f/~ˬe"WJO}gH ffRf ,m~6 s
^)os.Mm`*]J9 W^ʳ: ,r~
lY4Y1kG߮^ul>XpRE*+Hy]]9A&^˔k{-&ꚈalqЉ9r؇"ؾ0'V?LC 됷qV߱巭c5#ܡel<4OϿl%kNއm"&U7;
䷼s~ݪl_mm;-kuc*D$<PlzW6O 7ky*_ qq^q~6Twl}&gd6rT;Fg p;uS2(@WtCPBEYrI52 Y;Cw ~ ucVSu8,/ʦ4=c'g e *[ҋ=pyn9I 0JN0D pEu U8t]4^p xpPA,鷒6_ qhK7>A爑=\OEpX}@Em1"+8 *-+P*e2^Fp8vOsT;ºhe8\*tomXyIXSc-MZ LF)aA@ | QZkŊ?>MO9R-
Eԛx9LdA%uPMNf5}ds6tbSlf<c>f {#8>0>ơY2lSC0* Sk/bʢQ1yh=3G7wd=a!sΥ C1"3h1Q 8!BD~ rPZ"UDET
]-H\h7""]E$QIJ_U7286oU89
~ic61h7?OoR(6͈R>3(\ͳ6~b/>㖇֢!NS/!08u{7kyᚠmz@]Dy`!cp~)˨:E8^2[j6ۅ
Ǖ-U vAӵjFxm C9Uk(! b" A]nF *."q%%$% >PG
?7؇ SkxYõ4ZGMo Q!;H]3 88y8
ߥxd'jū < DN.!oS H]~ako;6u# G: oJss+}B Geשh-kǶ{zshË'6t ȺZ#E~ c
LZ0
):ed]W6}iRwuR YP=9V? iPB*xK}1Γ}c.J$@'߰y}=w[Y:uަ[J8 R}쾲 @%P`$j `R## ?d!"I.u{~Ͼg 8huFˡ!6MJ q]{LBp}m AʏEĠ.iv_Iq*[A(Oa f#MdGW|ؾhӿa>]]qՊleMǝydZu'Q 4hؕdꯦxz,y"";/
G
S5PUc7[] Zf7?Glĩo{vkuϞX;kC?h*|ʖǭAk65k@tA+rЃ;ŧ6@ǧ }AuyjO
4ܠox*
dJʱ"KёKvf>mJe+P0յoLa&u;\g tLx
/IIηg=r[ף1 =W9kGFvmdb Vby<y;cٻe4NvO,`.u_2VRxD Ql#]cK0_KPkK% aw0%W`퍬~oy{YضrP χK)FŖg58Ee v2vj%`R6 DW (FyQr'VQl'u ~ `k =? ޏ?lK}lygҲe-yWT:|أFM
9:ߤƯ!Nth@=Am`!:A]W r Dz d<ZFaO]zy۳]X>ɝmj Yj+'5G ?,.̯si{ցn"oB4IM#k AEDRw
[;"
{zg79m`qzv9 G@ \>+xCk=BG<A<Qni OY: BXRlz߮ƬIV>]
m(xaVG6[meq')N(@ɂ~)>ԔYץp"*yOߵ^Ȃ?7O~<ԢAeXgoc#uCHE=2 Rp ȔnRY}u0؆
b:P@%-cL=p͢{=Z#Uكql|'.P9֡h9Q O)CZDDV?P
Dj!P|:Nsi.d}U[X
kNPL
+r |R|)+k ʆ^j7\PiZ >TFP;|4e+@nf{.PdOV:A{O^B 2Z18rW>%pxjO0' wM+Wȍ{7~}EU8B}}<v_d3{8c|r /bA2Dz(@-CY
e%(K5H'xШ̻S+лQ2!'h%ZV2F 0șӲʰ/QIJ_ٻ3!TokǞd[ O}5?)Kݵ %+>?O6
keo=sXZێ=^'
9=" | ɺcqc8Q ' ]^ܑ_w*1UQw59}V4lc>kΣ@\74>͂v ѽ<_}xC?%# @<ޙ8
4R#тUk /~k-̓VQb%U;qp K/Ez > "Y<&>mf#9\<@:V9eT` N=u ;BIߋ $`Y|n/<`|gB zܱ>ŗ= uuؚ'M=rK7 z'~
z8gS=_zL]ݨnϩEm Z]D#.P&uדQ
>ҡgV>X^ShpGBױ=
rː]:|EoQPųU,T⼩cבּkئ4YcߔeDdA]"NԼLymK6td'?ԌYnwOk=Xu H}߱'EdA'D2${*$s܆QgoYeT# { yI} x |ɯȮ#ո1ó &9H< Y|+CJDxv ҘԝwYBD =cQdV+j97S9=Go\L}
u1) =`Np/+Vг,;AUASYN^C.2OdA7A^x?wzgSC>Q:= DX<CC}m-6Jv|')O9yՇ"!``/qa eؿ k_OqR*)e{3)0FPW$
䚋=/&`zbQV.hTݾP7tu?#WIse? i߱Stu 苯uЦ76gYYK l[NUwkDWԉq NbZB xY-5Elf2AS =@/GO[ )-# I;vW4^| ۥ!nYv(?VQQ7 '88_B WKWX_Uܫ2v);"pk,PUaeZ^V%Azhw=%!_n5, e |%oWR3_a-mVYUcUll
OI]L#0MVPT|Mԯ!S즵s|,#MP&@KYAf`[zt@Ȗu sGMo#Olb{Ъ8=o 6%sO@-S|nio#V?nXqm'Aùf#+
ao)YJg5K.E']#Y̳"O;Vԩ=u5nx]Q#|=+ ~fCǦA-(@ Dt |{"
j*$X߽ZZhϪA)Jrbm
:?O>% "T1{P8r& 2ey
=C3 _۶yuM >!q2
p P~>VRdN%4QVBp0!5O 㜥b e쯰ϝs|[Ȃe#!:Wt>'X҃h=ަTe9 eL PFNT_m! 9Uz7"VbhzJ<BiA,+pW e+l Mh.G9(} jRw/eq!"(@p=o+Ld1Z]ԝE:V' 砎zVTp_#s+V;c[>axbC,O 1
{/ï` vJ [-sL';
D,:O,@ b@^ PݿPF13kMU{|L))ظg]H)sA'qqb%@A'
T/DQ U
M!;Ų5]~=l]#?I8,BYy Eٷw>Վ 0x|@R,<m{J@B)S$) YjHb6iS9ѫ;}?`ՍV5)gWS> yi yw'I;3w?dqNBɼ.0̇)c% 9?u)GC_p:cJsV7Ofm 1he5U`7ng`QUH ԲRj%WP6u Pj Z9 @?
G<cmȿ2y<xǁ@ " 8'
2:v9ִ O\A9u#bm" f˾:9Wv94sN 9yf[ J0lE8;E8(ݦf;jlQ$UТm{,^ʱV dOoϱ==as c/Y;
YD}WrijV [2VB,,+e}Ndj
q*G[M߲ﭰŖ6v,g?)@f]K+ǒ{m[BO{?Տ[2 m4 !'@r "pO ~ nl,{'k dJU [zq -<"BO{(@NDl"
'B_]!nCmV`uR^JzZec} Jy7n}ϲrU h Ϋ skGWT+N>\A7֫q96 k 0t ]vJw`˪jGAp{Vhg{خuط~dٟX~n/mtY$ N0dA@4H;NcY$".P/9yc~|L(M&"=yڦ_rϽ/uy/ХjoгZ͜~ ;:r, Ԡ}u1S:w,sGSvV|_MPݽ)
UVNG-'%\q9:5茽^~vtw2ϴb? N._'2_ݷ 4cbf_ڃA{<qtcz6 V IHQKvDx+5N{[Ȁm{иxe "ۻvJ[f[xr֮Oڕe{zbG-t4Us0] GÕ1w# q-רC/i\
zMXS;[r=6=K_o0U&>w{-;w;dlCȔ=l }KVm 5j=fA A:g
ݩAY0"_h*/d
iר'S u)Ƕ7+3 iaj-#ԽUk&sB@kO(_ 7t@Ln+'tM?Wxzfv9wY'm '֍^Zgݷ)|9C?F2݈ >Fz_Lv #`>fhvv0߬W8)KԵb3 . I%z,}uEh],H8e(Ɏy(@Ըj]PBXkj6^X}d|bJ%*5:r/C*
7j/~*d" Dߒ&iJTWꮠ10(?Y] (5rzìowv__>fe^d9R{F{lI)# mK\ @9x@ 9
$>4+Ӏq5BJ] !`Wz+q a}Қ[{lz|2s~s<B c])vmu|- ,Pրse
f;8W_- "mW}>AؕQef bB] ܤ邀} 2t.}~TB`x
ExO/B1 xɖ8tP"_ | èTK,{n qJu A!( Us&SGiklVjƞYN[ЊWQRg{G~}#֩7X
#BS~m><'>" 4i ;߀2< w@
wc`q 4)_d]λ;چOmBVOӶ87p,fm] B_q |r 2O-}861/|oiux{>Sjin u2L Oq |YލHV
L89_s1V ]`~w68bͽVB@t3 G=!
E'PNu_"K*z;\=B~ 2kj :.gZ1BB f]{X ?Eqp;故 '
UA]GA@3k$X4duKYL`amV;vd7N=& ϣ8 c'V6|bǖC.9_u( Yõj8ocˎ 5# C2 \] e@]
5{
@C,)@$L<ٗNVt{2ƟsEOٓ~i
{l_0|_[]
Y2@%,@4lڇ_|E9M) `4
bGMP |Ėm"@ϓ}qud?m|J5Gͬi:d?dj,nHɽ^<3u/˦~WA^M@նj
:[%AJ鿏T8?,
#nwC"w2"e_,Ji/9D,
Y= J#sl v)2|deg? ! j/վhilGF$z{ GZ$@Ri|w˾;O߆w"^ {և 9A~3:Eo&4Ⱥ0Α|=Y}_ + 1}lJ ɗ4qeF 'g<3;!:N
Be"#[͵dG%OUE)9#xavI]HA5 ɹt y}m'Pz$,Oy_ǻ{䌽guO{uGڱiU-6cB?[M️tػbk%
uqwf G, 3" 45Y1iVҘ,p`^j;) }̖@&(B؍yMC+K+v2o+KG{( n@nE VavFAĬѾ3An
xVDe!Я2%M#iiש#㞑Ľ
Tj |TB @
>cy/z6u+q"z)o[j e ;0b-M]f{9>^l R~,A{W]%;AF, z% R# XT?. n ;\mŧ'ȭ|d n ^v2@37PA>]2
=el۳[ᱻȝЄΪ @Yg_-~A5vԀniƯfOq=mW_P\kB[
\=ZF˱#@MIY"a 3x9Չ6owZ"3MQq#b vOA@"ĥ6h{uDz d
;
8;ZWC6 i;;" ~OGQ-ZUQۺuh -à %ENB@8KŖHdg
}ֶ;PPr s"6.8 *Gx #!wpD7XQ`z S`#۴3,<H HKʆ,+&R bԒgAہ py ػsvxo3km696biӎ,Z-1q(k:q p.,? kYAg /8+s &4±
)
2 }"ޭ %DMYQ:Ϧq¸T:b_
AD (@ Z (3"DJ;ֹ)^D*]:0MDNM0Wx ^! @&"Ȁ-D $tWS"@,u8KUY)V3H2LVld}[eh.l :Y*z4!U(n9bWG_b{\?#̭Iˡ d m}
Ba*FAֽE 6Ӻ%'.kg0(f]:b
}]7 pp9q3_
%D$:;g|GO[:$hK9pO|[wQ- /FX RK~2<y`E PǨoFmꞜ||ؒ+및>F&p[?+ַ} u_ ;Az -?2] ̱?}<ͣ>4p Ua ?ݧCYg'>ƬLv=m\, +Ϯ̙JeπRlX)2 .݉WzUk@-Y1u i#@?բZй9E UQY꿝܀ * &xa͘cеzDt1 "dM|L)'5P@_U#ʄx>2JlqEn y Wd_gCL,XwCd<Ixg5 U@Bے dkq ?}'w 3]p »Eƀ N]mܳ;ej],d_Mb|z`F .`F߂owҲ.ݿ Fzuu26 9G+%J[h'`q>5x5Ҿf()5 G9ii=>G?e>[77l`# ~Bh#d 9qcfA$Rqe'@|w>l C" l Q~l%:
"" D0NX7s ] rahɂzS0H*dD+x7F=WV(PRW oD{F]U߲c9MۖE]z) k@ q~A:E
7Ҡe $>*vOƊ"خɺHA{1e#GA%te GnB)<y_=_mn5}|ᷭjQʪogK/>Ԓ:[b_ akgl<ϕ߹}W>*~}o3֍]xe9 @U&vGr<-^eމ&rOqwҎm%7-#3"{; j eʆ2FֈOC>}Ud8 F hu]KYQʆRAZۮw}зxJ%H^Ӵkԗt2ZnY)Q+>@.DN*+]f ˹- i@c4+Oz ?66<֎[{ϯ7lzSŎ'oL6=:lB
r-Av-v~DhjmjtoVvlЂ6 }ը1oC/lx
.xO ˇA3"9 "!>s)@$a#,cyQ8th<P߿oU*K`m{7, "D!b>Xςeu#C[+^.i
m.U>x,YY V!Y
T}bv9DIK ׀#y&h}ɭO9b.)"AH澲D EHDz dZʇB> _.@sȫG8?{l?:GG { ^߿dZN%Rȁp"tEHI ScPf`=x
gǬ[7d@ATZ1I!"nŋ!CʐPC
3 [hvrC/_Zr["(w1 AAً*Lb1\m{g6wZl|x pfNiJ -s8
}ݙ]Sm p3tw4Pw N Jc|Mh]'pb@"`d)F4`LB2=r_jQG! <!*JRdȹM Hwu*+# Vн}M "|x]4D yP, +Wu. KhTzK#6 +.'kݛ ;")Խ8SȱL,8 ;mg6{0̬:Y'[A˘=ƐS?0kS+(w>==8 =g!/%ʿt eRa pP45%zw^Y^;0i!OK =0
1Q+QhsYvYdVDgUJ5*féwc,SW,
쏑orqn
N::yoGE*' B]]'65Kp:h d_g0 [7kT`6`E4+Wd {26 t0j @qG=XcL,?C$EA Omdm} O/ e(@qЂj"HYPGzMG%P֛,Gj6Mg!j[&JÆEK4
bG8cY.o ^ qI00hCAٜ_Om¡|\ R^q^Ø6вѾXnh ?$Rq1x!l~
JdAk
dH梎e[~yI= O~fEȾNW@N
ڌ k%{/pY"q= 9m)a'wN2.y~%HƉw'oi h~~9Ivr̪{,n #N^J3d%q/bt]
j)Gw}~*}|_:&@T]w<츂`?bP+S-Z
fg^%@PAeK֥ D=5`U
?%0< {69n
VcoOviVWq邱Cٯ?n=JPW g; T2~h#GޅprM=1< "ٗ CǗ_Rg6_@|m8AȂYY 98<0& yJWe" ,#du!^fgQ pn+ 9F՝g.kj5#;u4_{:$MDÆ@8Vw+e==d?s'w5V(d`B۸. 'XK7Dn\wm=˨n V9<kZ:uf%Hu|e{"Ï&H1*!2& /ba}uJ }o\OYһ߬ MWyAD:>+iQKF.#ՂȦM$ٶTR{&Ϟ,gd yhχ}hv_{Ox.bP^AO羗Hj_(Ǝ ae![Er- +#F
+9rle_&ZD"/Y1 E =YA?88) A02] =C`z} = _e'66){
ιC||빍nh@Ce(@{ enukV8VVA3ݠLM䰘oY{mSCv:.~VwSXNmؚIdߵ%,v ?@쫺dPײ|FݱH췌϶Mn線$vsvK˷ﷸƝ(ĻPUMĀ$:?,REDh B-+}Rۇo['
Jsl_vR1- nDd^6k'{֍*%,$m(7' An E ' <h8Wʮ[Q۴Kފ8
5 (}
vq J9y@.6 lY|@9(#C]u('C
-"umO8&6LP (TۿjMC>ξ
kvOd0ed[ Ah$ mW`B5ZO ~eā`UN`Y(IqڦRAR{q<z"$V
ǥU1w' Q AExj-3,' /"
:ATƆ! cC՚/AN BAA3DO@^RIX;@], 5- ,uI 4pNWLz J1jMT=>Gi6>+&:pG?Q+;By%l5(clm)~QNy3> hJ R}U:{vLPn "%%)s8qX
'E{f5V]ion߱ebd18Yru?hz#+<pdEVGY4]ޡF/ 9:YJ11=FuWwde=K+E~[j I|}={CжL[kgؿ6#uNnZg pZ 4ˈ=NdQ8 .
69C
4#G%Sk lf9 Y18~~
/0,=~.i ;>F 0
W eQNF<HBE:uTYC$n0ug^->4 -8zՠnJmE( LuѶGrɉMI M=N$d^Եl&JcK8iHS|rX~Ч;[m)io]|(,FoBTԱ=ᨋM >m=w|S} Y4RĨU UUHDX b =kZb n@FeJCKT
z8kx枂C+Ac+ =
?:tO v?ao
C>2 u} `@>Dg[ gI+J:4vFI}·606c g333owҁGw^ʶ*S}RC%.+G~{s`5HL$##ɿ## <ϹEtsv1'[Ugĩȵ(|>X_9}RJB"k%F/vRkQ=Mn.#"N&h8Qo6,y۲Y=~"@gd,ֳ 25T #/ɾgf ![IaiKu? C|ЊMDkt@BfrWEZFe<{MN yN5 !؞-[en Uaw}3t<zLسV V`u?"ܵ>Q)*A8(A^;
Ӕ?CsJX?hLw%~6rl췒iK! Ħ+;2{cOֿmz?@=ogU#@?蓢^].{oh{8&xK~%|;A:[^*I\]R jFh'Vk8~?u'^uh>M!?tm/.-ۿϽ%d}Md-<>}e ?Cf56H}l?A&۶ط>6Mn OlHXŧ_ܱ-_
jOOвT(qXٍjΕYЂ
k⛊$(CNJR WDEQCȂtY*u6[J]N Liq à9r e/HnO g ԭfSgZaNPhHfcgSOwۖ\Nj_L
0ܸ`iu/4D(08e? 3YPKvtS"
Zjw^X=caך |
R!W:\퓖)Knu[?
A=IG$~#@(OA(VǣAg"PbèС@b{=O6V.X%*@Tty(N+\|H/_;B 38=
e'0wue" pk(u$ԧz$@Ur}yXaf$U/R@ w Aci"W ~m+4auc21l](A}73
qB`<& ( H`[2 ̋P^ p,` ęc8:hY4g>~A&'t~"g1tK.. cs (UX]ԍ@@>ji c,B `Ѕ,y4I9q~ O *cB@^Nȇ~v!55ܓc1Ν|jC e_iȪSa4#S }Ͷ?`Y6d?A]y"0)A)wXX;0Gt]/w-b
"a9qBy=9h?Y}r0Ka]Y8ڟ2Pͭ}V1ky2 /B\hh]G1uo*x+?/]Z`I 1DTAU zو CP*]늃S/\z.ٯ6lxgM! ߝ Bc_'5XMo8l#Wk-x1zE܁'> ^yS
g?Om`g0oɼȃC]<q_&P\ -Xd,Ԁc܇3%
j4 Z@ZI @J n I6uX2 Iֲ L왜d -
'#cCi8Sow, AIq Jl:E>64kuDP)>AOAն.z'
jZ9 #t#\b{ |a-VXn+[N k sjR
v9p̳ :V-bv_V"$ wtkeg(G>3{Ⱦ;z@>g: e3ԅDcKO{F7a>sn J}!N_6^Ez"
yi-áaP1*A@B Y1ú
:)AY:AYQ^3C wGK{>Yk .[[_o C!ǎ*/t>Aϼ_|eJUpyv.e|L"B 8FdtǰwO@ w@B HL
4M|A>V r"OT#(P>J^,!5lm ymƶ6Q֩YX#PV*"RL(Q;D$PVQ Z),GNKqe3eQ*{HcA:Av?:
)tWQ8kY )4o鯩QlOhϼM>+uq ,[c/>v ("0S9 h@>AJv, û;p2gd1Ƿ}i놭J:'-fR r!5#=w-BKǞZsl8sՎw8 5 >{Xn
M69ymaE0h xƾ'Vi}MzgvѦ^X
A<$@H _r 27-GXPW
dްm[C73zncOmt":~}[ ;/}1~){5Y3!@
z?4!j6콦3T7e4j
ds
Ѳ XZ"w*Ea_z:OVw65POтcg b/',);7vWiK:!]
GP6dĝ9mYΖ>^Xq,e? 3YP3Sb@Y][l(0¸sbwvq27BfڦîEXߴ'/٦ gDC6w DբT~o>O7P0 "үeyQt</Q ٪1Zr>ZշXE
X]_}
gHa9vǍA" g"x+J,"p@]N,~"H[DP 11D`Ls k-v!4[.YggM ۍ)(&[LpmB\D d {= 3
p -q>OjXVS$A!'1IqpJn>x"24 *
1E&"\e+~9:6 PNB |89r!#p~m''V-q
}k Sb@ CwCWvk1*DxAO[|ȧgD=˾fA(uRd_oV7e?{+n [G
FB 1ur_혭 `|sK*
/r/&0 ֕JÁ<Z )x}w+# shYg1J[o'Rsi,<Σ]] :[ # $fr N$b!Fqp
"ǎOq@!2BXDWԎkp:-V tDD:KY1iԃ~n27Oc{ bXw 'kjuy?mX"
qH( I&˷B6`ٳ"bA2 Fd tp߱\;Q02-}sG\J3GJ;&~ 6~uH[G˒7Me/IMO]3wb( 9Ƒ=Ŷ!>FJA ObvvQC$;*ܛĠ ;2O <ٗ+DVKq~94²5Nl~e58ݶg'whElþP5~NCuׂ巂.d{_~"l@ȿ_>"-vȥ>gWF3A?ٞMC&D+AF3˪Q E|C," 1f zuc@>@"J?}cl52=;Qܟ|C~d:#(`[
Z2/hN`YP;~ذYgmtv1" _7YM#r j] 䝖=HnqC0DW("!{#5>DF H v<%3E
'}zT+u^^ Ȉ
ن7u)%|wi)-+%Y _-q.7'D4No]=zC ˶T6B3J
?z9C6l ז/^H`[Lcr\twC4
_3P83MٗtV?wĊ^v" wV9fݶ~ҾG?Blg-u8 a%܆
qfF,[_G<;B<d !'w`#*_EfQwa5p\K7е>+g>k' G,~x:A f[ IX3u
R'^Z Z/Iwiew~o<C'42hoQ0ZeZkml*[: }nS]SiG;g3+XȪ-.u].AH "z涐}-o8a@
-8v@sRfA";I0
B׃6 =j/?˵ETnۥG 3hcM76Kt_J8&/>}Ex]@Tj 5&Rj {YF> IGH5)"*>ꡧ'c<LV jEb~dk? uj(BȮk4!k3unk_Dz dZ %GhR=@?h6?}G Ie]K6ct@xA-u߉;o~yI"ѓ'Krd(" {SޜS۪:-m{`A"|w:jJkZy2#3cرsnHF
7B~Dmy T1^xhS; a mΝ0P?#bU{4!c0V IOrS"Dϧ$:.NUC#:ԯvwg+vA#q:zg{3@N<YwH8O@ !9OC<.ΎGOUmxx܊ (g`f"D8+08 v]q"bD9Ku2&4a' %B
a[S l|(4 q#8NGQ&
<,йzP:6$qھ01V; 9 x
Pӹ~$q)> +2|h1d놿 bx !9Do8Y5#trCy/0fV`1ɻvwd\_Ћ&(ݽyڻIr-o~~pb cap(F-c
U{y NFL?ط]a0(Y|
~ xTrBKJL (&w&}hޝ (.e FR ȸܵ3 "c 8 _hPP̞
2"d0ϵ%V֕_q{睏m:a#Eܱw; z<A+J94>ݠNc%%/ Vq0o$y ]h 4D(y4)JfTwZ`
4s𬚷|N%
Ƕ4ӊ]<2CWKx1 ~coӘ@?M >嘐B97P(RG.4|(2_ }ptewxpȸBp2< MU ?Xs[?gwm Nڣ+V'g ڿӛ Rf)mZU߶bݦ.Kh z U pL HJo !y ý߃)R8ߞ马uW/H@thFHn:12xz<棼?B38xO@N(et D'G~DOgJ6wt҇0dvuCCM{ tbI mkg5] @NEx#"GJF<?/FW- fUVAD=H`r M9 0h CaC0
A9 "B P3 Z !8 ( a;C]tݙAgzǺTo
w
,}@ |CIˢCMFd(
tQԵ k9)=G_ ߀c_}vk 910 AQ>*:H4qύu@z !EO?N| :m>>* 4P.x߳= ̨ﺣp}< 1mWx3a|)̯_V]qC\'79 xC,g x!n4MK'} ]rwf2yyo
_\tmA4\iTJlE1 ڏ|#Buڦ1d c~=hN4'LG X2_k:BnMmpt~qπx6\
֊Ϳ%01W |!!p$m P) 5Akpz^@5v`ڑ%mf NP:" r^R Iv[*D+p(L /x C}vbJHnxAo/j2G?I[l;NC-cBC@d- .'."2k6В7\roA'3:M>^XSXow/ZZ;_6P.& JĔmFoDs`lQHFN>Yy3#1A)
`{f}Rˈl|`~r>>a =1-1%e]ᚮ C3^p|D3 1QJy'o=M%b?ލ~-9 I Ye+*$B
VDLx
w(ୖ'O)*1 rA7
y= I K uj[[ȯZDՆFNڿr!~:c;˓/=CtÞRF~T 8PԁCJw ":)'G\2Dµipm ϧ ZpG!lCDB8-i~\Β35~ (m3ZI"8n!KS&yRCG̀ u ZB !n9s^DZvBp a"+[u̪2o
⚇" <i e ٍ>V 7:2fYڷkWv &vkJ c@H c$Ak%0`4htE 4u<`(+(t0a/]{ &[X \pu/ pftz +Y
$ O b{mxFȥGCύUh2kB¢(; r(X@LzΑ."g}W˧aXm`|vv[nВB}QΥׅ)4z/3-uG
{;AAE \fs5b'`nzq2Q82)# I9!}]u MGN\Yl*E%hAhd@ >>'zH608xE*m Ͼ7k4'^jiF ׇ{2(z|9pH~ɫnM?(hYpZ; Om5_5w h_whCsףmQv[cPh_ƒP mGT0b X9e0[AaçH^^mOZd~ΠՖkY I]W;Q )ԢPB N N_ޝQH|@ =أE 9] bWflv&g оtMiBl'i y rNі[ZbRT3Fi[}88u"m(v0hC)P]ry{^eJWg$e`s}_?0=24 ~Q(6; 8,C%V;Hk:>< Di m9TmEh+(h_'1c =иޏyd:]ÿ Gpx@~-^ r8Ewȩ؍ѝ9 Bt́P]&tApUu9#<*GC_4
X\o" O_,h9N}y~۪Oj1,owZ~aie k( aiOT7nv[]v/eY;߅v^?_7ryV<:tþ :{^r" $5[61ȂKweU b{+*<GĿ.< [ ~@dFH [ їT`bjՂެ<05UmԞXH^=߳djR646aO{j [?SF;B` ̆ T`k:19 JWBbN##_P^71N\ogAXJ1,Ĉ%uM/֧],{n]#~ o }e#v #x)|<G|j 2BO |'_w%0҉i@!tqhkx)]C1F5B }!;y,<
hd я1ъA镓v4~#" ,蟮a*6[ғ4hƛ_za% Anם S5^@n`fxxy ZDѾ+7놸 ʠ|{BBvi4pMs1WJ]FU>:AW#2¥țJ[}zO0faN| F}[enPbuW4ا 9P?O_[* : 4@@}Cy͠L)JvpEy) "*úVlck&6Vɬ_/֏h':)Ok`}oBBq-q_W$9<b}pFOd`(@P >Q0 d<;8vݨVEfFJ(E5 G2j%mĘ) yE%)
w 8X+4G \ۇppo.ǨF>i 00>ЋמB*[n뙥aikM?2 ϷߞrCm`0N Z{{hҾ}-4gZ78{@2Qmk?ܨ|7*J !=ˀ2ugc[j&͖)K
1^^gS1̧dTu(<
m).=B"1WJ E"M+ڨ ]428],aאǖtlp"e{'Wߵ{:2-w-ykh8vڮbАHD! Ap ya\/H#1>*@'c!$8\qg҉kn ڡ )U!9ZX9,3z=и ^w(6y?̢@`Dt% rXhw)M(M)ǚVckOG;g<@m|6VVA#99jsw9R:~__ ږEYZneQoiG?S[?x'ewz h?о/Q3vO}{0Z5eV(
uWF06cVh7EWE anNٓ Rjyܳ+3I}ȵ?h-#Dq; t -5`ٔlSPBFA Yp1C{H '9_ r j)6VMA_>蚴ȦR5 x^km cw 6"GyQ:@G_ E+(ad1U9v$G6 0Rua0?Hg t'QS!r_O9 E Vc{:ڧR.BKNOt g' >-D#IE%Z R{ ѨF,;0ڧ?NAN>3`n>/G@xfאXB{g3sefൣxXpJiMY6 æ`V3H}d=S.}%ZSξp˼yx"mQh7P 'AS
tmt}v5t+2 /z29ЛGFS>7Xb֝W'*1yNO. sA
h6Urv98¹Yg/}jP@1*
$CYtЛ\{]샏l`$kC ;x VZ=942"Z F<$:rQ!0 j {'h^!ʜ[ l[ K0
r%1ǎQRo0`v-qU@ذjXua{)1 U丒 [h m4>%z_Cv?xC/uAhw~9Y<6>w?>TGh$z2ߣu'鷚&9k{ѯ{֢"=iewr߷{ӶxcЌRr˞YC]=zBIFoD^ M,ZxZ4dbF- l}.֬U#
U/'!q`ZkwdKEٓ/>2 i%F RoJ6/QRNQ!htB9nv f2ܩP%O5u]#dN@D^èQ~0*(% !LLP&t>m^ s0t8VI y (fX1+RZoG 8:.YʳG.DB gP1&dxhòl\ە '##2=DA x @J]ǧ ܀E@GJW (;RFiJ
S 1r(uQN
s Nd9j^5õ?pcr 0$\OsO
} k7 10:xW| mj9dNx{7iuvZh_l<kK%5c([),=5b Yw^kIgAYEk dN4F6FB3r4(P} ½̳-L;ݛ@ܯNZ:]mο7
@K!(zx!^gJШt =Z}-xS -??0! Ejt"oQ&vN
# ug{$m{G/:
U iFbDj^iu;?c:/P0#+h 8ހN >%u\ut^wD:T^}h^#xp>cbje\kiyi8ʖd r6<D<ҒlH-/+'`;
Ip4(F5"; 0:eG>`@h|"Jf;kKP*wM/aFF=w)J?DKu=*SCy C L3voKW =l5w&P
Eʞ#gFFl G
{ Ø=_~7x*08uPֳs=<s~yi]e#N!4
y}kЮ'-)Z<s q]O
~E .ZsC # U}ݩ'4:mGX(+ |Po QS9Zvǂ2лO[it9kQ?mj叇!>{ ]L{25X
B=^ VN.P)Y&~Ex$ 2}Nz
7At_v~A?up2M5$^mp:ҟ=҇
گcrGB |h
m7WZef[&1.&UʰWN:O/yH<TBЧ"u< 0,H)1 EupgފQAmwct>⼕RDzޭ_CB_/}Y : V fCy釼Lw<]_C]6ľ Z*c[f×z*1 |ul aޚ:{?_7>M@tFmkc
l(kа gu5\ ~ mJ5]۵9d ij Wo&7 hO dqpz!\WmN펥o( V~X;Cu
5 "(Rw9u
\E&\/ zG O%?wєȻAvN l k k_Y=}x8}>MOS.h\-1*\ҫEeB-AEOq@=H
z]ѳ pk!B%^%~+bw
m/aJ{s Y|uϺ-6o yy6QU֝XX7}wANI院= 4";
x&u<<8 6N$I.@?#v-h>xH1 I}dkMd>{x"iߟ+hC%C
,i؊ ͞gދC+- F8?{:2a0YyWOmzi <Bף>R D[B P~cj@=Jyqa2B gzGe) 汩Jx`,_]GԺz9 dh(PO#_XPZR^dE}[qGG}[Wfw Ơmt<6.HqieC4:^}v7g6CUkX9O].m EHmjZ|~JG]G/h[u]tTQґ`ȇ㚛gHpM3R5.{Z %V6R4 @sICsM~J ۪{pY G 㳇(w%9 \ yPL5@0`'L jb<iO8Ga{83s+KAإ>뛜oc kB(-FԾWCĥi:ӥ}Цjvel Afryh\[=W>1iDW ]FfC(AՁbxbLuX:]D,8=5M,ҧ|;J.m!ڕ͋Ρa ?0Ϛ#CU ڈ懨wG뼛+ހtKJ
_%tծu YVG#0e/>Z'ҏсsUJlʥ6fr6m#ZdnR+9Ⲅ CyIѳCfAa9yEڦy O_a%Q
H ΑwZ Ԫ$y}{(G )zQB犽 AcM1: )c]t
` ~&>
WtJ@/T2Ac8
mL>cs֕\ \y7JE/P<=}=ZDVvd ە60wyߧh7.:?3MK^+Чk Zm9
HPNv~970Q|Č4 e}"l #pg
#<Bx4b̤s5 ({?;4K Є{c[o}yЈFA#MâAg5^+eS"8N|Z F
.}d+A'*b|-ᓷ]]yיW /eW0@G(W2nJJ~t#m֎F#-^ʧPFN}
ا @s x>m>ms E{Йs!iw)=Sz N zϝ~2v+$gA
}'1@TT`D\}3iEc/e <)R|䘢 yqr @#ÚncMSΗ d$"ڗ1z9oZ^α7 {l|&c/aB9{^vmpG{w=[v~}hC{`W924m?詽!.C1<WM {n!G1.$ ;-MwzRY!d>.<Z$WVWq/Zw-x 1A:s\>+<eetȀ
D VE ;ywߓkqL;<m}@ \/@_wJnjP4t;fI;zOhk%c2 $t p Y>|wzH|?-%Og$I:r> Py_vג.po<G JO@]aZNez'h-9d%߸S53
4?ĚG}
l~h{ _Cva 9sMhAF@GO G"ыdnM ѽ<WϪm- iE;X o Y/kl~ [ >41Ee)R[NakE H| >28]̶BvQBB]|u~oA)K8܅TO .FV8 : k^m 3BseR'EZJ`{A`R $8S rJS8NVϻ7XYqer!ȉ↉ N}ΥoAǢ>688 ! w*Zсcsj4q5,sW؎w БQy<:/7Jv'g+k(Ua<X\_,Q؆5' 'A'Ө-hA9,4us3pI{&oܿڏu*vțm#x " o/"ԄN9 #V75rxdu2F%3ANV@ph$0>s0#$t MPvm U%zb3Dڿm ԉ=@hˬwtpfѶiYY]o%,Y O,ԕ.v ޜD7PaAzo|[ _Ae.H![@'2{^=QhZ<,
i&& M=SK1Us~f0i
TN & sB
9,Ar\r9CWoy9dp :݀['pۣa mбW^)2iZ=]b0_ yݑ'LU)qgX/EpWd+h.9F
ްd^To}k(ZB\6ȗ=p:
zK?7yw8GHS$pQ3Q%PCR:cO+ۊV#@PԀ<y~:PDYuZ> RCH (r}xg}GqFۧa'\H$g.}9 Cg^XS0b2WLڒvڟ-V'?֞!ydFnHD?T/7$P ګ/b=M'{
K=rJ]0C^ˁ廄h y/E ishI`N\аg3u|=t*thsCD0ŇG݆9
V?" 18Gd?
>G=93N49a?ۚbhO411$Z}lqw;; =F7chX/GaFۍj;QٳjF o3\^8g sv}%֢]\_(G#Sߘz; !CA C +}\uS *w_9A @<Jܫ}?*mG E 9KC҉Si ]#3}
:"r_KitrX^wV(\0 ZMF^K XjBoj۽,z9SrTl_5ٝUmuTNW7' |K#v^=[6eԓ
%zy&/t/e 1pظ}~~.<^fnCk<G/1A'(kzR'nc<v}û3SnCyp~+
}*P$\TeڭQMyur0P
.x]<c^Bk)WTw \ 0Wuy̞5ܼ9k:'/{3VUv /K0/.SU9?~zP C*2 >row}L |r7$_^We#<p 8]zeĽE 10a?| y?Hf 嘎scY+ywp
MQ]wE= Nnе0 =iz4> uޑ:`kN/LIs?HG敿A%isP?4~#" ,,_K4iЖv,|Oko؏6乏%}ԍ;Ue+Q«hOVm{I<Y9h O\_ЈΑKH%;D+>B@UkZpa CFNdms(Xp2E21@1y urtxJetht@8
.BP@.жgw ތ{X/!,#&~Rؿb^DctKk{Z \z F J9 &Q?EA.z̉3՝np]g\- : |o aH XFn7# ~dpˡ= B{ͣ kPNՅ02BJO
S@NCavaϗjo+%OІ |vUdh?cM?S^( e;`V$HJDW
@4h{w.u4? H } Cz^"|FYp *1Ľ5SF M i >}'i3ɂèuo_ = D(gO]5,j" PΣCb > Jvemޟ78Tzkl_l>vY:mog~=gPF(cx\:o(()$ZmR'ipe`ZXk=WPuNqIVt7!B" (1 k08|eN
Ôu'1}Ǭe_ yCA/Q zQ>ZEut#(#V kd^?)!ǃF )4ArȦ oz9KY2q+ZK{bg3M[6I;w=`hP]ݴZz ڧx ݜyU+oFm {Jw9 CCr\"]^,PPƱ
=4n R)M(5jBzu'FLSG[ɔfjEah77 wGOR _8sT
jWt&^9
<qEz%;^ 4)SEA~7o+քܿ1\Z} 9֖w/(otao}A0ګvw.a_°x{jEЪy,q%h[VNӘkB9(5rR 9)P;_J |%{"hUUdԨO=RNj9y]п!<YB|}z)Dovj.w){osrpOtIjK~k
ڵ3ɚufxm;~֞ybMcѕڎ?3+ct[hXvb:`ֺk<_o OWoovL /-.AFe<{,yf5̶V 䭌vE\B
8r-HΒ<o&,:;Û8aԡ5hN Xuy܂x3 'MAPT=l"û "LqNR;M#<:=*yнNG w 9*|*@2j <zǚo7
۫i>mo> g/g^_e˾}F}Jjڳ[ Y}'O1 r)-Krԍ|9 /Ï>]͚ބ?xρ9'L_ л65onkhE;8W^}TϿk#OmuLY:VH8İg (!`7U#`: 0w`6+nګhvZi ]nFo~ȭv1D
y ʯ; JyXz C5ϰ:7"Rt!
yYr(tvnۖW#(5zb XmUp?y`wQ&?N Z5g]˝^Ԋ S g:aNF"i2KA.
B8Gӵ5"Fv4Qݠ=XY@;}y>:
JH=y "bDA\ `9t`A#>]ߎ#!>Ղm7"TtNXb1K k]Ga:G#r"hΣ(nAY2\ѕM1J
fO~s[b %@y@?u,p(|яBƽC頻N 1J&Qs0@s^;Bd'0z u<wm)e@j r / ҏ!pfQ*4P JQ VJ)2G
P tqdi˝|:OZ>ֲoН >ޖFY%eC?֕=I[b2r a]3̻~4<87i¢?)Z#=&d^Ƃy+ @*4rE߾^տ3 -Ѳi.~(z7e L7,( B,xzbѢv~^ vl(އ5$qBTKkAh ]DQZ}xl_xa ~ }szm [%b
kou,3%nyuJE2VrnB@wo
՝A#>݈еи ӱ5 сBws #Voc CNqʏ(zD`!ۖj` *#
|徰O"0Wx) 琰u:GkiX IOc2sm2/9[ߟA HB2 fܬ2tr s/=qSX84 gO kPע(pZf}, Ymٟق=Fj.CEǪxrzڀa1nܜ}{hNw؝.r?ҾH}2grE/yS#Ƴx{hbA&ıXbf֓eiKM)IBEM} h)@o4&G
ECA.ϧ1.Ήǵ/BKAڡ-At!E
Yr)7:քQ߄5\rghi̱]w^kot&RF$k
z}tF0Ѓn KNobGW Gϐ0: -ڈX aOx7n`H^ΗNw=R [KjNvL, *2@S"< zݟ}9E# ~tќCxI WؗO^!J%qp˄"jfcqEmn4a-s>5wt!7a"=}+ߓ?ٳZK/ [7\چd} @>XFMo!dsuj#q(|rUr+=!r- 7{\x}dsO-{luؼ]/ض=ւI+7ceM ۭ~M\x%udh=t] ED<Ё)1DL )T!bb\a8 iWܜ?lNDžxGa+)-H\.#:\9S;J}a_xv_[.4/B <F{]yǗ+-9 z
d]u[KФ rr|w'[< >|+ {/c8 IDATf
9 a(p}~G;5,mK:RϠ3sb=#Gwb5%GAXfҗL*fw_ăsr '*k]wtڏ+oH~
@|Ѷ@a:Ѧ
S&!1u .S10UvrYxג^:t\v#7"AH) cRm+i^V %wg I(c%i0[k{$.@>x Ȃ'& 7Dur/2e4<ZE4
alb2$ 3(p+ʄJvp@ >:{P]*S!-(2c'iPNŜC~Q J2)cYF; ce0Jq;eZ|/cjݯ, qS^= 2@DE \AG!pJ9bĀ:] # &R/3A S
#"
|)&: LxgaWКԾbAP B"G%W1%YS!JmIPwPȿsOc>/
H
u_;,
u P.:R0ڞ(@})|]GV( >B|% ?5˯ C3+ l-ۥB5
UaxG~u?#x {Pߑ-Z NFd4xA_ spzOcH
gNse (gt`94-43:
f dP RrSG@4h *."Ok>kjEÁ7tGT8er?7b8~ijn) .罼0oCH7݃'۞}6;(M ?ϡP4ܗ;6x~jWQ95 / ku#8¢fWFW0$=w}Jy}z_6 ڶ5)'H'Ju hړA J4"} 3=O=DQ gP$h@t TW
k
z ic^Qy/^IM X!
sNs "\nc&Nl+{0:r@wYP\= ]pGagFsYe$+"k M9xzsh> CLP A;^w8>, yXGY~ =TsJ|hw+
v XbzʳA?I_rD<i{eTS{%cv ~A)' Q}k>}<G#-Fs@̞;K|rh|h͊V쭖^{
7U>Gce\Zp F9,п;
0 4
}j =xwѿJѺr3:wG"d9TF"UGpIO0UFV NSnZy$P<mNx/5;֒=% C5 uӾd0<B -:!/ڟ*C " @<zm ֨E (U7 AVwNYhW$:
>-9!_I债Eߘ^8ʳ K ؟la@_ʃԉ=F&>WyM]S=ѳ1 ͗1//5*~Xzjpot
J߿&LUhz>I`ax{j;D&#h4G
7mӟө#ۿjBߕ>!6Q-u3 #wO#d!؇6 D *}J)4B<$-kX?N A|EΕn{uujA9Y_A%F'4s읯| b *ڕ1?}aЇ /s }{B_ o7r h7퍡qeKOǴ a^c(<^h;$ ?Loߨ(bP[ɣONoכzj=|LL@ҏ#* )h0?n:{[6̹cnܠNN5Ja @
6liխ:jZ J9 F] H, :N51|c%1ۖ]=9\z=gv܇qFtlۭ<>/]hh˶}h?l ܊-gF F)Li2: DkSrR {״ \hוl'6eUG".٣З"ݤEh 9F[ *ؔgz Dǀ+t
;quhO J@fUVFs.@atFrPʠ 49 N@xipBVb<*iT+!T mHH 笶d7췛S>ڐ 0h*{#AeUuϣ Q
) (8Fb е# ,b "Nж+uxPYЈ 3w+"4@SBM7 ) 9473xq- ⠼D1@A 8b~q
!@0"|_mplS TNM5k띰̜ΡHף
@fa,xD % ?e aq=/#$ahʒ<qd!r /X) ЂpW [ a}?YJyar9h]| F 2 (u~ ;J(qm -JLޏyG(;hn(hb %@ ː@CJ J@! Z( O%y ) 2$e[7gzZ2dz
« ky.?fhw['w?_Ӂc5J9҆w}ҰWgk_epyS|
T (1G</!a E.yuAY(vt$2 h)^q2K)GGaGlVe
ݷvCeL6D0
0@V 7C' T^a}|Y)ǩ"J|c{9>AF %
ա$PTTnf#9 FH!phţSqhA?++ s|ѣnRgOط
%g}!yz{V%Y{9lh?
>ލ:s
̏-<ZAΣ/@^d[u: u) 5R(E (vfć6BiC9 Y=b<=+_ %]9
2[1$[>h6gy8MҔIwDžG< !ƯCsh D_jqؗ@//kr|_嘹QԈh_NN /$Kfkii-+{uT#a @ANA ,| X2oq!xUK= 3 B5:?qx\>?ӻ^J_?Vvx}G 2aWipф1tS l$ }?PM=к!πǠS/`H 2ĤX߈2bz;о
Cwd0/}Uއ" nb4I&6m'[v|~ ^뜵,(NsJ+= Y gXvɣ Z5&Q?nq3v#z~}{*rox}
}_}x!w{7L 2e̷T rO}aiw/k遲ϬulǗ9:*ccN =õ18VV ;6c*IjdNB!·w '5蛊z4P8=gu}"mBhFU& (t_=˾\':`w9T^*cM5~g/D;Ԧifn-o - W}6E MPJeY9y<Z## ;px ]c<zm&ͺc a Gc)@0C L} /_);7O ha[wځn+ JNi=ed r
a[1@t h5r' -(@
B9 `M7` lzq߮[6,~bˬXz+ǖlFD>Y ]sTJxwa*!p#i. 7 J+O#^`42/~nd
#sqF?1aZ:Jy# B.%Y⎀uO?öd/Z `&T6ida A
OXVK !/#Í| |Z@B. :B F(J
J ,,R t9|m +PnhfU_b$wHm`WG%{#҉=3Z2g@ʥG|E_=pњG:1B5o SaG'RC? 2}@~e>uF 0,}K rDqauU T1]ˡvc~
1ѡ'4BNL 9ȗ2 @ə
!BAl>
qBN c#kpa<Ha0^I4j{8ȀF>i4=(Y{
7X LsoQg2!! J,GQRU,j$ko=첏~Or[ h#%轇
kE8<ߏ/}]
!$FU6 ;J?oPJx`vûi cc36pA|9< eNo@% 9D{[{wH (2 SԝcD^ Nr<gNBu:ޙ{ZOkAJm+4:̳t鼙]k[pɺҙ_ٿ~ɾǯu`ɚr%dT~z zf ۰ B cAƃөxi7ʢhJw@9 1LB]K4G%}}DĨEFDꣵ(JB J9w(]) DB2LTHDh_˙:>ZWB`I #Aa>R |RŔ1t_k(S%ĶqKH̠y$̇\%Y+zI`^|"Zؼ@FԞ ۟"vb<PN9_n @3+>+:[ &9˨vēa'Z67K;n ?= BMл7f͵Լc90 z҇= NC)<{611f*fdcZ:\H3cyʇe
:E{!B(z?x] Tc>P?Ϸ7̖u4p'{r(<dJ O[f^;xC.i;z/+bS5_>$}t
$#~% "'">pi w.g<-:W@!Z'K0 !ӨF<Un1w#X;a=
;' p
L{)afzNOCtז0'6}Rl<wLQ%"{
?Mf
=G(7mdd-V#h1mw Tv-pr \(w0JZsc?katb9i~m)PtЗ ͕FWu%Nݖ^?(I9 N >4ևlCitUk9[IA)}Gw÷'Ժ1h}[ӜXfrV-vF_o߅5t]
:J>sdG tч9 L ]N\Kw^?֡Ry?C} ojM,R.@Ǔe
U֭;`=Ypz$ߞ=<aɱwZ0;ˮ?ޙEcû
}C?XBʑ
s@#Ь'd_ƻ@Fj% K*5E!`U>
WT''-9 ܨ:j
aur
_݈^ ǡ 7n7=+(/W*2XcX*1âmtw $Dw _ڰCۃE9 @C,TMT7R0ml~®M->߰}FE+9xK2( ';?}+m=ucI ^q7I9aWO,8w~0%JRvҮf; 0W sFOA\E H"73֒O0
OdX4CT@0TD3z Y[]P ^ pd(y2YJ[(RH)Zʜ/c*5tSUP'gl؛0RΚ\;(nXRHZ |)(P!2Sd+tʅ aN`k87",z] 53BƅgozA08?/5jLT%J C+ʁPOwuJՁƈx <JTz]p<y8<@ѐa {U V;4EDW=Zo%x8o/>>αv a!S`/#W>AhT.iB23S7 tG?cˮ jc0| \GNFz5{ жFtLCR:Mc w7 ]J@r622e^¡sF4)Gh<D1"#I:4ͱ3h]t ^ _" ( <9}ʲM*g P:)ЙX Z1Z1zP4إG =k מmk{~7n<gV_TPnpa[3%JU[w {R֥>O{5TH˧:A)PNˠ@I3P&Ph<*(+or\y.) ;""Pz 9- $+N<@ B}^!~->OJ q% 8g0@!"^+m4ck>T"W(K$Pk3߯}8k'`0д=V"ђ՞ ٟZ~
CD Z u
#5h}cb卧(iKniZQ:T<X~ύ(}T >ђytT߁۞P^ƅ i{NmO/ic6 ɬ494iOxXjxl kCB4xx,:!,9]qWX|'ϣR]C봿o=<KWC e 61g̓h>ޞ/`L^om w ܶ_䴯i9fg T<"P F眆 be@is^i= Ӿ",!7W2h2bO(֊J3E55-Br깝hmhy"z zt C> D! *CJKҧ;vOҷ)
%Rи7b$Q' #GDX'n}` 96N9Y4yȷ6Uܴa6 })shw1矹qގl ByGΉE[| <}GgzYs|
ڟ*ڭ J (`15ۦ6E [Br).ڂAw% \sh=]LA'HjZuObàG ܻff-=kShDf^a GuqN?:xV9} %c;ql]S` tM v <;ֱqZ6n_Txv |n
etYR Οa?ok)4n7W Bԙ_no؍k\GљF|`@CwsmDN &4x>y }2!}t;|| 4+@Sր/j45,4#_ה Z>(
.E7gT ~Zjwr n@^覗~| =B7:ʾY9u9е; ʸ=Zu%9M/[mC,( ;@jFD>=gG(%|VwiB
ƕggM#wGtm+1DOb ƱѢoK9 E8!%_AO6kj$KhJQV~
eׅۙs|괚0 amA7d ^ lxxWx+ǂ ];Chk:pN °<pls `Y\"d1G8DEҝE՞k) .Ѻ^GkB(?.Y+*7PnBh7]oKM!0#R 9 -] U9&Tx#^ž$T-~t-WЀ m
.Is֭%= Q Nˁ!G Bn0ya Pon xUFSá0BI* Ý 2" ;¶ i )ySVF4H2---i#j/ nt嬴rdO
o0(609{Q}?_I>
s
R½ӆ\ F坮 ZYZ QvhNtO(Z˾ovՔ\9r"5uL|ѥhgt _-`T("Pd|!ފ+=Jƿ h[4^k.} A#X|{r<U
ٽނOك;|}뛬Z/N={>_7 v i t~D5/M(Zk<fwZr } YQ}#x Ɓm9L#KMk*voD`GiCJϳ(.d(dD;/[8cM *5.hRh{+m]l7Buˁ(: `~B 'xD
V CexCEw6=nms؆Q[Q %j_k{Gg.[Լ?{t+wQKMl4don=~e7$ >;3ǘcpA Fs0a-=geo3~>xU̺G>!.+ twoDڠh;}]%4
_>
},<}@Wz|'%ϓy.
7C@FX <}/cy@qo} }N38 Pi_¾9 oCϟ}`-S&Џ Z-@S<=8DnKhmyB|F p ꟑUI^#h h-.зPCx*Z#Z%i h`٣"H?xq Ӻ^y>-F<r tOw;81 GGr4BucBt 7(Ƹi *Qt0ZQgn3v^ <pjњ3V\w!絢 O2A[*eR͆AmW<l^fw<qc3wOKL%M/@iv~:zB;<JI~hQ6^{nyHڦ>MѴ0 w@wFO!NEΈ:;"#pĽf/غ&k LþyS@NmG|Z %n H ~.s *}?+` kYxH<z ll ~{Cݲ/q;vo'ҋ#'͚]/@;UO)9,}w$~,KnVT* ah|UsZwA#zMk;rhwwA֠ƭ9=Zݟ }B| Q?sh[৯};"HP{áEhhIP2,
k[ ʿpl(eEW+/@˃߈3; NC%$8 V@Iv%`0l'{7l(B,JX'l.XNm)JOkP ER5
C]K?A@9FY3 ^,HODT*nӃ`v4*ꢌ@'KLZ2]_*1 X_sb( %1@2!`!pecJRH : B u 9z+!P 8Ot!,)o )憼lc0jJ1kwa;xBGVض.e( CC6 :
h\A SCXu1 5t}=;p%e ? HV%a Aʇ+AXx{zBxF6{x[<:ޞhp,> M?#y!_ p hAt"P4=|ͦ+6l%T @}-UɊ'}
VY:iFV [F D
+@6́Mokl@߃?\j鷣w
C~ <潩擛.Zַ(:qoaѣ|T - Oz͝6èMJ)s8c#V^ DS' A ,cYGT5g]<]Щу
d?7D
WC#B%zcɧxEQ]h ^%Zn^ Bq
;A gsޭ{]vgl:l2 & |Ph7SϷ|hQ݅\ xK :I]Ѽ»韂UsDhɢ!>FAG=)xӫ, a[|=L)>܁G W
g%ss?k@ ]x2shQQsC SPz?րt_-)y ~f
; ӄh:C{ru)*%B`b< ,?GAnHU(<e%_٫w cH./(#O'CA7vv=磒.m'h_99zxgAzN#FFW K֟\s1~lb`A}o
5\Ϡi/ӄYPG0
d,DFzl QxPEG;QH$xb@>̓c!hN{zt`;fo=h3-NC5~a ZoCrzVpz ݼKh%3
}K~]
r`:i_ ïeHCr{0<rz2a. ֝B F|,>yڣ>{93w#|P 4ȟadԐ@=}M9?4kɵc}^h@އϠ}E7m9?a=LdeӦܶr_
x>ځ B_/CWr\=t_f1TӴw R(v":Lͮ?贽Ï19FsP1"`EW!x _x<O ՟ 4`HyP;xߴgzl|% _s7J?t{Zrz
;.4mhOG t :w峂oԃљE s:O(ZL>XʞTg.3 ӴcȎ^"k\gѮ<gG_v*>cO95>.&>#%GWh-ۋ 'Uv#wlpMŻ k
9cuZ ٛ|swLC|!~*vMykm %|AA ~&𩋠ȡ0FX9A$9 98+)<Dpe^O~sW]FG$FD>Y 'Fek^
V! aPط%:dض`yϠқ+w`@B#-CBna O } ƿINj0i9 6<:aE^ 2JOA<clDabu蚺^tVhϝ_ dcTwv)QR Y}h}p#C ., `4=| %kd;;;> &wҪ=qn6#Ԝ߇ G#rJ W xu#7J`(a4ZP>J}ͽS?OkIx]Iz2lV \[d4㺎ЎUjoX@:^Q Hy@H~|N]Km1w@l )Oaǒ9%0ܵL
&-]^,$W{k%eDoS습h
c_#/li:4ywƾpʫG%UBZP:P5̾|tawff|[XS%O'}\}L͓Bi@!,Yt
0 B,~xS40eqgrjoȷ]C69<jW>ɪه&|r(}((ZFS'42y?
1rJAu~ >RFHHj s ~Xgj|qY3=v]Uu~vb]zj꾍^W_ŋo7/>0ɀm>"}S'\zN 64~~~$טPh-ж+>Q': Od6QhCK=/iT Lp|(sv B_6u١e|}_ń8CxF q-{r҅ m@r\ih:Mm*y³Yر4/Z/ XV (h_|ytV F5FוYGcYݷo{6C5,vjR %r(m֔-oQDNh cw~:Bx>ޫZ%_wO`[ּ;A.Lj%d35Kg5^[|r3G ڸ>}o[HA+ w=> FyrD'yD;97'D!:ŕ#d Jƥ9H|Ɋ^O7l'／Q3ZC鑽߰K ||
s4ꥹ27+XmД.Ql}+t.<{{h#"eC}O;u Kˋ|c733 _NR7ö}gܺcx{y0'pR4d*c/|KKLNtV0H)'' ~NWD!h^(YZCȲKGl ?M~ hyԸt/,!)Yܷ*m.X@
5 V i_I0F[{ZJsq >0Ysv{>4lCgR0WU뚨# }ؾ*r3a7y] 6(4`
yg'_vz+}o&»| cs!D{xL9DF!Ô {wcrƦlm%}z&?^d ko-ppe4աO)vY=z!tϋ 1UH)njdm.l
Fku;oH N.1{o ?C^ .t|
j`M v=9qF, GJ=̶[ʗ/G>>8{lTߘn98D2g@kmh= VT 7
O: }p?Ѹ%b'e]wh=C/ ZeZ_'3{i3NOJ/@i }{8
XeJr nFD>Y2z
ivP>* NF%L# 20;bd1> :v_ۖb0>GtR|Hʁ2
X iZn#h45,E2 )2I)}9ܑ5G(\MjN2nx Fx0C83;sc(@#q;Ǻ8x :<I DjYF`*:RJdr]hH\hw_;RaI) `
lw 2Ү`qLeHU:>}'([{2>BB:AIdlNen0;v߱LwuV0Y ~x ?Ҿg23<۩zj5n}PG (()gоyPN&lp,iUe ,_+^_.<d}I#m[
ekU(0s8Q8-DНFiM r&**шbIDB_ Y C}>п8 > z&QF]0 Ck1`3a[}ƻ26fS(eAa_N<JAt0Ƌ;J6 %(F? ([@(t lԁ+;L)#Y$x97COp1:l681gCvٕVhaW> 0<`A&%L^hy
ԍZц =htK t^"E~e>
/P鎮:?PIJ- ϖl [}
hB%h:w֪yQȩd?.W"}:<?ϒ
m4 4)~ :h<-l\[^搻Z<0Gy'eʉՋ3Aך^wgAguLm_97wB&PmK6>7 g{^k#g,Daeh}߃6֝{NnqќTv */ׄA{9190BVzYBa #㶂r G(ibem|V(Ss(@5r ~pJ)V{(0rR( ~Bѡ4|:uDN}IBTS8GaN yxR oMIQA1҆Ñ
M`yvlo~ס6_v/Y>oBZS<n盚ʻ8''}_4/މQ :m3iw˾<8@'H !3 ǐaH s{9]@iҠayPJ|ioem[{eeVXQkhc^ζ@ۢ,&q=%Ҿ_^ #y 'KTjC^"K@eddtD b=meJ@t<gt:V\ܶTe*k\sspk7Fv_ڭk/֬ejwJV9o~Ȗ4bS׳K,zؾ" $
;`bNߤ?k*2H: II+mtLn ȗ++ [:4Q
yelݺ^5D9@Єm'xy{?.R* *Cc.o 7h0T7F5B*~gh[>fW$
doգ4+|1E[ۋ7d3ٽ=nL}q t }]n#²| WJih4
=S~:#?wqrvR+%h ZS@ivVޱx#䔋<G0Agt6|2sR\)tx2\WX H O:S glbAN z<mN֬ c<O~ Ҏ*slFD>Y 'F" F7M,[Q }.#@FA
zHv Ad UHiE/~*[y;(A ǣ B*J`D#@ Ea1 R"\@{D(\ߦTP<'FؔVwa,
@S|)xFpzLн@0{8 L8_vy'H/!F Fy7Os4%LT>uR]aN:_ư[v=}rfl<j)oo~1!䤼Kap2r`Ѓ`"܀ӶʂJN CUP~ECٍ}$7%:qzQ
>m7/QF.x0ֶlm Bb~r^tp 'F`迡p!a2{zd8~ 1mK<^,?Gc{|lI'9 B=BYEF>i_5%%thW?=(k5@*qV#[u '!مQZF(7a F&@?
7A v?p#EJxs# 7m9 TKӉE3{9Q*Tgv!?2cö?(!
EfZ3v&,F4!@q G`kdJF4l{Rm&n p%'Fm~ ҽN= H52=
}Kq/ HNHxMLL}v ,=S]=sh>ó8ʥ`sc zFh2E@`@G_y.0կA)2TAJAR/6yu[}sb0/ƱU exZgTxTǪ< ϫseKzrPs 6M xaˊ ~ cT>U??&z O.Dz
67چV'%ڶ
_ E#
ѾYЂ [Ժ|G9NlXWrzP N[w?C\ /9 փ3:S/yUA? o' }H>9(Z_.ʽZnl0vEМu :Bb /ƽV6oc5]|i9C%hȸ\QEIPz(d Gl?>];~pZ@@
C8<hIw^ _kw}UΙœ0'L^Y12zgM5l E}& hdM] Cy] AFNlY< y·sCmPAܢ7t> Me=x A1
/2Ƃd\b+Oc4<_ǖ%#t(sBPe{/ jb_Es^|G:.ѧZ }2b摕9\e
sܓKܻȷ)~Qxx*1e痹 9_gP:HR sk{6[$mD./[2ZUڧ)BOO)V_+֩h!N͓oZi`9 Id )fZu(k]MLaۿ1}u^
1
I/ %V~BPk$Zts/eSVְ"096
rp>F݅EEH$lbxv^۠}PQsW8oQ>1xWoPt>:I 7O k|_E&`GF__h]7 i/~ _L&y I[Wi{}_w Ocүk{Mb `+(#~ KAw'F0~y%Gɨ" b ^r "ו! mG54*GtyѢdh:w[zn5xS{' }RXl@Y9<o~ QjK〄xr8 .90>:]/Oq(raj=7"?^s`D#7" UPwk4g =)rHٳ~0#wHab/ÁSJ%E&k<q>:Qx1FBAk<GGE=:h ^5}`z2eqnFٰ>)I)
P7ֹ; "gPg_
"J1p'Cdۡ 9ZJf!4Ēa[:BL]#ILx20Bm p!J*>q6;gOvP+R3
aGptbdkd/aD<8
.PuO|dThJ)2dfJOrö @JI /gu9 VuOա8ԏ@@i18 P*(U0W }Ԉ h43zΣu x̺sUӟ&f( V~%Hk$qZ'k߷>Ƅ xRڻe? /GIve+AJl8|ZЄZnV>jM! SFw)e֑|eB!rc(BI':u^^TW^[8 Rc*g k?4O!-qZsgj0My #ϴqr=| A j<R%\pC#e8_w#rEAB1 /Ȼ P/IBiQߨ JJe 9c 5BՒɴ={~W~zmr!GJ/H@!!=йQF'>$-UXq[N!.Q< Zwqa}6vliָ悀23'Zm@wnc<Ծ*Ϥ"/X'_>zV ;;ܩ9i^hd:F|\(ڴ=gE n J|x^~},9>rN0`ecƷFh ePԏ ; fQGw;
=qP9,7
L[yU66{ ٖ!' vi M#t p2#(xV#G1h9|f=ԍk N$K1?QԍxL>#pC zr BNK;P(ʁ}ܲhJkx' )RZ(S˭ Z~Ky}u [YG,gKK3h L,/y#B p/>9Q= ;5rg+cE7~C .#(T^uxFHl 0 5m(/QW#[ޤExa{
s*SY^}: S <e.r6B5͋Es|: DUTƚ;im: , {{uO,wc`wl״J95ɾ @ƮA2Ԝ
fUKk`>-C֠('F05g nG߆PTnM6оj[u諣@W:Hqz^U5 ɩU[#PXnٯ $H֯w<hb SyGNpLۺigy5A*S>7,Wyr"PwɱR Uɣs4Mrvb`G/lckʖmhIyY9i--{p %uL!g(So ״7S]6OzSC݁Zya %_w6W 4Q[f{ ng(c
sǶ8AosȬdP;U/h\2lc ]˯_1WE#U3K$cos2ҳy7 @}fgAÚ#< [ <
# a{YPBwp GF^%BRgv}' De R|9
1_ &5aRbTxC]]c
F
LmaqS<̇
sΐ H hd='q/OXő5 =1J7qZJȱ 2e6((2 HpH]UF \ipBfkTyR0j/e"9?Ƿѩ}g ~@ 8u`0FGpnhS1_WmU; Kk0 eu+jjR [@@;+bw ([)`^Ɖ-u{nޏ`k8} }!=}=¨D^m?rMgy9xx>) w
<hROLFzYl a0t<Zh#@K.Q37QQ5 5lzhvQ r=m 6MA hRQJ*k0ɍg6.AuǪ7t-G*u4 9-dȄZRjzFgQ 7m#yaa
>BH _ 9^SQBPa% ݪTέ,!98y^SuDm9Q">"W29۶i2J]*eϟ#(B)5~*QJW^Iw"BpO@C yp/r(H`~ÊsֶmHN_Tot |m9 @k!hX4"8.F5"@˫c78Eߦn ^SXsTKFEߚݷ@`fΎ]Q4<a(LX_bm ~knraޞ
W=g"*|~{r_o 5( 2xum$EW0_@'Bx>[> EIFYRg{BiW|Y͔l`<m;(3;`+iBGQ|RSв we?>v?SGc5J(x@35'U9#/5I PXETdS ?5ߖM$Ż/fs{`=>= 19'J]; eD{mZd:Gex jjF? ";#
Mx c=Bϕlukum3Cyи GyAq<y^P_K/bځ
@݃ ]k ~ڧ %۵%(U^~;6a\Cy;Z_ڷ4sH\~i Y.]tkҪ?9 Z{mٻV{VMK@ h[i8(-ƞO/Ѯ9
W7M2g BFSAeCh8mbt OSa e?LCG/)b b4 b9,8 L8r"<2rж GV o{xD?DA!``y+s_oƦwvw鷒3sO6 *6wY F Wz2 Hp$C9 @v :'cgYL%Yv
" <<k{fov}Kԭ/ S֍gtZ X, R#JFy4F/@y۶L_|jã%왲DZ*^s'2kF| > &.! vYeLKsi@nݞlڷu+o ڄe?8 P ; rkx2ym7]' ^7E ,R08z SD
l @Mvca 34tb3I
ͻ`G
J oQ@H
Pp}_5'S蜗20N`Xm9
52P'RJ$*@<G ,Pd-`U8Wٿ_-~~\#,`;#@p
KWH~#p+~n#(@#tm~J )
YcMA
L3\h0Z1O fZ^uC#xA!ee=uPB?w>>sPE_ ]
;;q
2݁!p9蟏p<H&fJ1h;3Osڻgw?OY" /;03qkm-y" 26Lej(%Ķ_| -"\4
m{m zϵ1F4: F5h04щwM*d9eIJ0wF h>m^^twA!Â8"ǣa ;(r
rȹdn~g{2VVYW;mo
5H)g; sE }R|OF.XW8-g*.oXeUan`0
%w,,[(m* Wh%:
!ވF0o@yFy4:5؆ # 7+}| ߘ^d,@'>Q; "-'ھuNVm -OWY]h?oSHF , ی|i4RKFS/Ɓ
'lcv봯Ux !1/[{~,)^Lxw !9^@c)%֓@ -'?6/gA"_~k wDxo )R]_;oxF K1WE:5F G@(RW?q:rQhn~a
`u
e),r/sɔ ?{cC{C__M7]h$: VY[w l"./]8Χ"Dٹ5ˢ +"}Z,[Xmye%0&`LG@t 5UF; 4b< =O|ppȑ[R{L;oXbI n^ k?1v싦(}-xF +6,30i|CqY`4\f7m 8];-d?$'"@ Ԧ⊷Ky g"i#65G/o %A]Oa 1 TwY
Pc/# !BEQ%ު"9s ]VԈ"1 w,,[:_iwo='/m<ߕQ]ʈ-q? tqF{z&9
"m߉Αc HU/gΓs +Pȿ զ vf^_B+tdҼ-<<P8W#zj9g h
]˯wuqԦ^kS9 :
Tze9[BWΣ."XՅw_FD>Yd{< h7mib@vsXnv7[0*9 &P$ G5?v KWmfz[ <{?a8*yN1myϠX9zn< 3Q𤋣64:iC#L!p ? Ř@:P\S0 *"~DHy#8_C n;P)(S<FzQ 56!TQ8ڂσTٶ6m/gA*[J!c c
u]PD@#Q392샒/e^|xvH;y"m7 qϽr(';E]̺48Z.YwF;ᙤhh_=?
FQO^ :Os ŋwY F4(u?wM" ?JQW_"8 P,S#[6S :+kmL6^}hK X`0h OYw|?Jh#K
D`PFBdzl!"J!` ƀV4~iv^5WxJ g4~ظ/"Q ѿ" 4:$^JtGπ;
zmsfK˞LGB9Z!K)Q| ayhi BMA4BOh _d 7őO}<v::m"<4:c'mmmGI߱o
O@9FAvpB~ x>}h;"dQ.BQ8<_plԟ-. ϼf,4
bF{0,T9 N@AԽ՝[email protected]/p'gp@pz>U}&g
)YU#ɡM?縈;r֙ >rmCN@J+^+ЩMSƑ;B @s~8`CSE9JĬC'ƄF]01A z)h~r^9PFQ.l5ԁPWt),C2_^a[A-/soE C_дBJ0lԋ 1SJE \7B[eب;^u :i 닟(ӽL _9Sj>7 ӇF K9N>}Km>Q,ofݡ>,T&O_r}Edƽ} n_`_tns!w.YiR[d6o,ϼ}+ 4 m~I|6 ehed0|
P oD0=yM'k+GcЦE΅#{wMˉ@#Sy} O흩 `r*[?C.o@vC j" 4,l-ðƒ }>:Mb&s c3A^F59v}:.z %|gEY0J5VAKNL[w=yj}ESY,V$A0h Tjʁsh_}ˬȪWG h|xy:<) #*8
HjM{$Mŧ`;<yiJfa~g~~7dN>
2r]-gX%xBu 7Y>C|,8N8V7*G rSy9Xm
.,r~jy#طt=~WBrhT?2?PoD948FB<~Q]Es6^X) -zT
\D]j#~#" ,3@
P{/8 a)#,^۴o~=8 \k*
F8j{ll\jt͵e{)xE^| ץ AR:4W8: o C{(ySeZZ+!&25kcӳ608Pذ
Sj t:fe|^ 39[JFódsdU4~~0)eECP<J דpDB1[^4
(UA"LP*77lyi
JLʅ?u MƶH Dځ^8Wh LYQhFRS1w .E c[sPnZZR0fA |1mu@"w 3B0 gG 5=RήP@읲~rH!R[9v| ~дچ2
!䏿Mˮ[rh> <AӐ0d0Phh(K.T4?
MÏ@\TV6~ 45 X:FJ O^w> @%גRtKAhh>T縜] gAWBf3y FCeF(1E) w>J2&({r%.¢MXi\F{ћ)Z"=X1)eI;|j;k?M7m
jGtn ?s D4n"GYWϔjB*@CX[Ex2(zOYh; "m._1 O֝!(q\8/: P;,hi뷉
9.<tWqm% E_ ZG;ϻewO QQP(ɟ}ΔySY[Xٲ_ٹ2
in͋eG )v`pk Io!8rkAH}I:t9KC==rK{Rs< U :G/4RZ
C}Y[xX $/^y:ʐ/9$?
rKN:
Q
<4@Ha@k Oi?"WVyt,5 Ş@#KE SR^ԉ6 吔.Jrh48>
?-4
GD/,дJA
\ =>P ._"A*|/v@St4U !|} ~jקHVNߵc7}~vl0Y}GYeQ (?YONIt/;^~M5|z
yIa8XvM <7m]?xǍ$|AHclQ
F68Zݑ;,4MBmn)ta?G?X19~Wk@ yBރPXA!h?y 焜
FώyLEe+ؑCG+YEQzsgor?gəG+VN>QS|4 G5ԣm
8:ONE#4F'(Os",("k
<I ϣd ,o I ep0 5hQ8߈x^#A{6l,<G6=elEhp]+YzlsgV߈; (; & '=b6PT OlE9 rxz)#+).b:#Y^\Wt h`䇑A% \~z,p=@Gitn,@#RݩQ(9FgLm AOyP& u7T, Aƽ'7S}zk$kz_?|!c4^mKW&~)W,B<_\s?R ?Ɛ2S5d-l2aiڰEIb3 Y/?V* C=TCw 2@_ۦ/9})}U<9x;Q
\ZH ju7|_Ɯ &)YJN Ad} y!%a R|[ _U]}ۏKYs?3߀Pw8y6Q?OqP֯A
(BCIK0uM 9h[(D﹑D +Ў9{w1j6Tvb-6ipq; Xq)(Ԣs%Ai!ZS
0= q;(ʢ{ߤyR (>˻/l~J п2s*q6(W 3')D2U'flr:iCT85D__Z K# P $BӛTjx,
Gt.\4~. sh+_/2J G@,oٿ,P_Rҵ[@A)zް>;" S!}t.|V )ṩY^ t^ke7y!BSήw~=ۧ9 cgE:0§eh;OZ\ݷ!KI!01hpÒPj|6_%836V,P2r?NЄwfQ֠M:J&/xd{ }
}CTWmqr,'(I
*qEHq߈Dak*m ,h&&oV7y/OD
w$6Һ9}IMCrNj-KB:GTEw ;
4g,; mϊ 0gS9rGgAO
}=W`;o`?~Wx{d|I_@2>+r%+]^" D Ѹ i\9E<CduNY EhUZqW,ȉ !rDI r"[h#_o{
OUi`qyچlt4},P$B>| hCS}UckZjZ}~hU>dV8P ԠU[y ϡ[/{_䐃fV+h]}<%^yQ .BcDiEo ôuMmp|F'5`5hd<'7]y^@ YKgr ѩ2dɾlx 9
aD]۪?B_9Ou\wL G1]?3jOYbR# >x}[oۿbЕCr<9
9B玬\ٷc79c :Σ1ɜ:v^\ S%%4[iE+jݦUȀ$Kr2(k^(Fz@S.2GisMC7jϭu3
-c--𭐁o,вea"PyŞ kY El,l:mn8hp@pubAiPHhnk(tBjc<H sS<y`ȟEFp<0%0u 's(
G @\Ri2ā/`>gMxmԟ ϚNmw@ 2N:͵Μ
y~hGXO!syV |aԈ!>η'[k*%&.xd?__/oZ<ƅ,Nbx-s:Z
®n8N X/8$(B͏:|:+ҕCBPR8B!}!dzzsy-jQƅ7'Y5"lICR~,pcnSh؟\=z» א`= ^<8q?]1Ϣ'}>^ans~ :@! E #'Pڷm Yt瞖&R^3 G(
U}?>L?\NPy# 6}Pɉ4#UPQ1 h{wt E
ѯD>!9VH.J ;NDUB?!O|v" At0u4z=CP 7] 4,Pd_?g[8 ]+[Q!E:p:?-a
h~Vw*4~E:4
A =-l`+( %7̣5: >Y]Dhڕ}9*TW4 z! !Zoot
,8;g}- 3{VqD
'^DE-d(YdG߲J*64Y9B6 {y w; (GT?9̩J0>lH*'H"e_V@=L"?3L&
K4ce6Oe+bO
{]O2| C-96%~==Ggwejfe <_S
e/J|kpj<̑YZ~{i~c]Y G#T3h} 9 PA(|rԝ/_SD[;,P45gV|@!Կَr>N97}@EI#p䦁~ȂFWÜx сd;Ӿpg<33, CǠ>ŀ:h} Ox(0wF,Qڋ|ƲeS,)>?YS{ ^A9x}9L9 ޟ{_}{WR4 ^=|s)8Q'gb0Ϗ1m!Ām__|KE xul
YmQ>sKG#!7AcނF^#BN>@% mH/eH(%x8rc%偡]ʹj
GkF, (Pwԝӥ=tENe<6MF)Ѯ;yVWWZ-tb{ Y_gd/slz#8 @ʵe9B4\et.2%#Ύ 蕯 h<W\K
VDFuf l5R 6i!YPGL
И@۱.1# cʉhv,>gEDzm J"|b ג%t≕_Zak߈3; $Re*++vpxHgƀP]ӏCr|l~ Q(4NtFA^a{<lHr8ث|
zYW 0P+#@93 :X|͈P}Cri+!0):TMMMȠͤTm2=oeF=<pA`S@I|h~ȏBqC=ʾo`H) O=؆-! ^r e1ȹyn@?̹@]XT `>\Ycaϱ2<;8N ) Y:~P@پ~z ,0P4Dhe> TI)_5b*#!/ X#t]9D Y Y @ڮw%ǃ z L͕gvxz~)L n`ؓw0@Ҿ
˩YFÏlzFP'bTh}{G1D!_Hɻ/G
1yWC 9F'SW>겒-z8 eZ9u ו.LrЎ11C ;81eeY˒R3s̨Zeb%={ԩSU{w Xy--]f<V[+Xgt)$B㶳Q?O0n!x!4U;MD[%'oWMJ%KT{@ ;8
hʂ]@&f>7b
zpcԏ5b& QYpȫ7 4Ҽ EPO Sa= Um
8gv}ݏVaMS/]a&ˉ^
AE$ nu]<N? b-C#ܞS[K̶[L>ޤ=ȿ>{FU{y }?.T{MDd#d>AWj .}` ^xZ!!g=R{ SP[0|$f~e/qwT$dE u2g ϙst_:oRwxW=@̳=
&Qy< r ҏ"$}DJ'W8 e>>%Z;~xBf;v]'(
D'3eQE{J@d9 oy}})H,;E~?QB/MQOTهNYp1\q4$F+MV|ys}؟,.Y [c6 ,'-f
tk"XWʖ|&[aX]O
i
4AH.O k S8S}Q(*2k
%zv_ r(pcj$e6 I=u&
Hu͠)ւx'tl
$9A>S:M A#J TB?EMvxG^#37xBxۼoB7G$"*Z':^fi=3?0mE/rQy 0%).ޣCg_vĄ46{ pSn:z&e5 lH}e hZA aU]cHYh ~D#R;=b]wN/ڷYDa/$iMJh8PD:O obdd?Z[[QlQ?W_}
q# <`2Zx~GA$_[ $6)(O c:d&T
L[}t ȏ:rV!H=d&RC!/o{hѱ d3(v(_H ʹ7;U=D[}AN)"zv$)Y>E]B~a
X4uTE`j-(3ɼV9: _>WzP!7}qeP?_|v,*rՋQ8lI]JC(BSnwynv|I
ܷia(0l'HXiO,0EõH]ǎ>*)隣Ӻڗ /%\thɀF_
(< jDcQ59QC+ 5 ~QtړtX4v@@FF +J1 N| " u-SO:y},v0lyΩBrxHy@!NQ* d+JT )$bAsxyH<mtrZaLG 5 3Hf8|. ..`b 唵5@oF'|}}_IN~ s@S0" ̈Ϣ'u܀okzV#rb ,zT)waFDF&}~|Nx/ܪ-EM hB4MmT $hQX#Xt퀭JELRU. y8 zZHˡiΓw}{2Kzi/z'⠬ M§I:cOmq ?{hKþkF(5Cg{*
P <
*@Dś6syf>mCM,ʝ T4 f\:vGt?F<֢ZB/6ҧENsn;LЬI(<&R:/)W L9%Ff hI7:A YSAYP(qAS_CgYӴ! >@ݯ_#W Tp@vBwy\ϧ;8uY|v,=Mm$ >O#BV6D
?V* s[wXVm0qӻq6:nu\3 ܓᄘ|>v+PDyu|5M? */@q tD5_ ȑcppDZ_$)!Ejd mfTQq
{$|x =cpcFK "AG2*jR^v3 ӾD[g@L%. "=]H>N~ uCB刣އz46&8cOUԹPKoSoh+E-ABN9I'lگ]~ _>pmF[NbGIS 8ωO[SiEZ
vd)aP4)BWWP-ntߞPliG0%a8.
v'Go+\"vPv&@>iL~$EM?=) #}] k9s+g6ŶGMHSFL@cz7]" b<oFxN鴾ct=1a7kڥm$mL/mmrP^B}%/퀮/W龖yz11ROk$(ﻉ>c7͙> j8'F}ڔQ4zB8z
3vmS# B` \}kE}.`7$N iOtCBU`Q(oD}ǬzԢF?`,?r_? @~>ɾWS}OP0Rt!ύuYK)NFY ?Y-nuuO}BѺ6o} }5Pd1։ e2=Bmp188꾦 yoJ7b``?~
DC] GO<Miȿ
Mm-Q("nk^s; \}~Wmkյ]^zyn HJԏ4}^mV/u Ihz DгaİGKm~_>AܕUa<SaDKHE Z&`"1C;)ۍ]Yo: U
qbj 1kU 걓ϯڀ$o} Ou@ d^U-c>6FBqHvH@@ .g7MPوq`d xR
-~CMtki@PD
} :K9Sw3$-K~/M2k"pD0'CS4ag߰Ya8-ROc/OG.`=<4L>$'DYr}EUOb߳@4kXb9 9:&%+X}Eb4Zk =Vjf"]=>6d5T )z&E
9d<ebk ?: ӖCoQaTj#W-ϝ|\AC"$dVw~tssu(o7?A)`k@+xb cl3LnF,1uxhȈFG)&}ѓAYcƄK$ /=غ42K1pz J/tk4vX++xF5AUT龂h.MɃ10<
"oJzٯMJL a
o DNny >iP@UQ<MC4Ji
ʖZ|l+\>/ =NR"/]Kh7lqGO7/1zzN=$ZcށљD" `d狰ʶs
SFe 8l,P`+pÍb`#j"*P: x
5kK/2[UT&I@yE&qVd.*r -k%^*P?cg8jQ[6`xdp4K)>mtD&bY&=Ee|ֺfM6E!?Cѿ7Aӏ䳵|hA8+P/%h$<y!uvF_A m5OdN;b/uه&/ n~'g !^L'V*&*4:_$1
+a S&2mN$[LCXfVB}`_*aE |wL?9X&F=le{ T>'OwXY'N]O5Ⱦ$."Y 4
0ѵtb!O
+p
``!A} Q&lkܚ"&:}Qd9,hO _VPzc
叕Y''~Y %F 4ō'Db lp7mo:s]HcF#aޯ2o%!.9k|f' ]'5oϔUQŞ*'\ (P}o"xTTˢ9LAr&; #WA\r3i} uN4qxr>>
%
}N0C
W|&-zy]ȗDFHz]+C؝ =AĻ~u_A K<x5 ,rPve Ihjr
'jw`O$|c"A|gt 0A lZ| %jY $ZAaoL/ ;% Y`V](IB!Dɳ)>o5Cr];X+Թ166/3eES1-7jQ$ @ m
h#K/I% 4ϥ(K@e _bğ[\n ?JH3aޛ?)"~
$Z$mɉH ]|｝$( sJ=
$I=hYE- A qhE\~YƈwQ)DqtBƌ[F?#iHe}ca/A=!X' v6D _vЏJwN\>dݟ, `oYt4|m`tR(X `9$ P #t"44"-fC\s=$
Z>QKjc"cCc 9VfRȔ@&1o͗os`h -P g.C= D8!6 7*/!u (*paDF91TC=Lbs+klbo/'o9#
"c{7}s~Gurl ]VxhGm&&cAλp]!LL I09D j#&P@DdY-2`gݛ@EM^[)3rڪaʙwx7sy Ogsr?{Խj5R{N
?eՇoߍD[(LH9xoxHFJS ND'
C'4ı!fR
<"XϠ1`4ҀL'u?JO=z ͡8:'E;I6 bv}` ~`4o9IDΪ ")Piܨ~i LsoE
( .&<
,R%f0S)0F 3-ImG hv( ;=
*`H%(
(vG' dqϐ%7̈tRR" vAcOXߘ
J%&hw .; k[q> ~qŕטJM
J`[0f9*@u?, ف -Z<QbM@mvD؆vo lFm`A _("*Vm9iҜy!:tUmOKahjRq/)K^yvpMݒV4i$य़UFV63T@s ZoP8.dZW5G-C'0| !kϧc"=) 6&7V4!Q{݇rH|ALP}fl.|L
#SSRdY<Cb`l-A"?izw rDz˚^`As0\$@~C'1љ.Xߕ-*Q(eEBw>3E` P䠀 $(W۞
19X`Wzo| 1\""5
A,jL <lO .2# 3dۍtja<r+Ͱ
S-A%Y<YǓ|%,qZO>~Oδf ԡ(K*R ^ ,w()\An캍,liЗ'ۘΉc7'LKge-g3a-E *څmehRg0G]cf8uL 8tn.b`lgRJI9HPjppAg $4 zf kU'I@Ȕٍq4FӨaG@,44] 4`Y>R&Z Pvy ioqm z
PKw߳VBP"M:n2!)*v<h\B`k|F{ M7S/m|<_2kU 7f
qJ4;t(mWR:hE6,f&5,hk-fd?UW_ x 7edI̵Mǭc}+p`<P =bTLG y r0ax+>mY4nk̏ EIg #*
dGyC(*5_v?F_zǑUqC P"'F J=ؗ}}`Dd=J(#~א.ElWL NQUpzsD^NTwGb v;i>pA~ ;~ M, `)MefȁF
4
,f8zrJa\?SG>3/'Shs.0BN Jȴ ǭ9W&J" m̹OBc:J~~Oath(T(0ALV@gqs] ֬8DvS$2KciS$7Y J6d :[`Dvjt q:duN(j@4{[oo۬nA@L ]dۤSL#=qދ D#"arʼ/Cmp*HQܷF
"H,rdȽg@
hm@kߩc~6!a}.Dd`~@ z{
lP$NJ7\*EVo'?w(2Y*{oOyҳ5!TSpX0 *KFU P'[
h$ !o58<|=:'t@zI}t9u9sl'Y4ʨM(Q =vH]#pS_9$is"44(`ll ]q\9c}g>h\{vP/Qȑ?#طfh(Pz9A,v@`>ľ#=N \ )$W A3("A5},oh;}VFDMJ2ߙK``* J&iwE5,V)
$_< ?Sl3-ҷɁl (0Rhd,b\:kFRIBzѦ5a m}tUA!{nُ ־ 8oQtXE` 9ylHk dAbߟ Tj
/eޯUЊF_I$|:QaO#pf &, &E؇HR$xlZ@#= PU~ Q+*(tE@Wk6N 0:o fچ)clP kɻDWp-""ü HF> =zx> ^+rne; %< C]ݏ~ ?e/BXޟ ﶃQT(ۧD6mgxz(@Aab<b {Ώqi)e,8c[YB" = PhsN_;H`n &&
$LM}wxz)W}^II5.]䤭3XHz㽘-EAfe(g|<ӞfSwt݈'辂F̀Ä}<>kpig
~4S|&J hoYG~N]|FԕV[{I`#i
foCT0JbOl? _s<F'ߩQ+*2np"G$]po{'Fǽvw fj=@֊|<l$u $ĻDnjJܖ^BY49𒃌 ̐i;Ļ
(@`F':f8h"~m#|-x瓿w?<W=I
)9),WhzK7B[&R@Ju"/" -"vgb`@d3q}N <8/8 \t
|̰IOF{(e Rʹ&<,Se %-#ɧү}se|zd+ģ i QFoR's[To@b07XlQg>9~&?֎aNv3F;-O/<K }K`889o
:W,j9Ur3{%9ڈ>G:
ʛ%M:~a9SظA[rs?Yl;`U W?Ke Q] k,B#eXmho;oim 9
aсɑdkߤj#hDoy#
0X0Y; uDīH/&:*q"0}
>GdJ#hTT5oH }}~S`}&:SbG1Kx-}NW)Fw CFU@Vʹ<6=%:ۉ$ӈ &A:ZVthtq"XMq/ko5Kb ~ 9@
i00 z>q܊QN~NO`b#V" F&~J=drrQ$L & twJ>1r^AR-!a\tf
AFmĨ}' jyNE:P4RkXz߁FJKFIF&P@54AX zwֻUBSP{f*XMͤOzށRi%A?R ='|OMOiVV
latс}!Q 9r;IA^sA>OUs,jLk_ )cʝ
tג.}_L1_6Rta 4FdH <|,1ۆxY2?!V n2xh }f.;X`H-ujeA 96imtZ"@njDCvC0:;I^Qޅ8=J'` RS`pZ"Vd"=;-ȷ Nsz$꿼.0zߖ {'na =E~"c D]o!MǟT{?PK*(n~mGӄ6Fj3R l=J *]x슱1}އkH@MXYK#zN?~ @}[w7 硹"E*c?Viç}C?rXd(@@A!Mg*p(@eȤk#` (@L 7@;|1i >x( k~Q>8Q$<[>ծT8oﲓM]GIfienN5! :`8P<kt_Nv&ޖGף%&퉂qa&~o-QoYݲDȌTsedxߚbD,HWĤʲ#k/ >tu#Gp .ξ ݃f5|sēnMUDaWP ~cL jĊ%I$iA8,о9f ,}3ENj[ci[U$' )qtO,̓vv3CaWi KgmmR￠ߓs%{[H{#E}ee
>VBaWMGI(\>lH\l'߳>22{t D-N c V> ?ŧ ZIK{ ChA>B{C$QKe 3^S}8?L,N_s $~$QRq :"G5l^
,*k|[]
f9F~GЦ(_TQWIhShԧUd9~ $I2&` vY4D|Ev>o;SS~ ,;
OUaPVdi-K*OEho4x剶҆!DJ ErH%io"mHQw*188BWC>I]p>:<p}G ax 2 (Ig4
ePA}o;hlj)K݇PoG9E
yN2J^Dђ 2ULc
N:T- ƍP# }ß@[m m=7"ꅦՙ?/aoP$*zw z}v#q\R+M_CWK]vy.je45SofOd74.S<99L`P{ɋiv @ktvkiS2QLS4?B`һٍN&F\̌ʨ Iey ?Wzc:GG6AM}&|
lH0&`tnt9 ɇ *9&ύS Z#. 𣏠2#L 3[^[Kg< ;8x `ʈ9(8p*vY4 P1XTwD2CiZ21U0,D(, ap{0D:GiL 7_HC'Zk㳝 EMJ3X ΉY
021<2}tzS->yNI+KcgU;
`[շtr ))T8GwjN}Lo2}n"Wp@u
(0k'W
(e J/Repe eZLS 3!#I&)Ō|sDx `zܖU6 e j&y U8ACƓ?Q:,+{ R& >1@`R*r&geKdZlWfL^L)|YVO# @
bq #&NH's"Va)H破 5 tcmqq:*>%!1S(q 3 ZPMzJIy?)g;[nܚL u"*gS@规Lmі-*TgZ:`tF<D"|:Kk*ARGGǛűqŗ =cּ`ꛙ^{HґLTIϯfU+kfn # !T`njRMzG"M)QL-wUpXJUMsٕ"Ih`=}JkȢٓi;Q&j `@@`HIAHFFo5It}AF= ^^OH 풏+ gidH%}ZTq拦uYeg&Tه[;'aPG狠Eve_@zK=F;r4`2
5
i*>:giTTJ",`2 <C`agKÇҮWB]u&mz 3}Ʋ eIT$0>N`r@$
eWEEh""~498p5x1꽈= I/KtCD$NHU Ίx?p,L%ܗΫ+Nb[(Z"ۧ,ksLee!nôagـP(AvSazɅgQ~vKKܧ`Ӕ mP hv=M-*0y,KbҹvG[L,OV }vm;u}5MA AVpD}׃A˶f[ISAs 4-TupX5P%d;u|4
-;yRUߓ/EEJAcmL-+]?[uho}[
ب 7$^3m"A}'uR #< <),nlᱣHSi|G4 2ޖQxH&`p
$eNa1j0q[)ï\ӆ$Iv'AM;m]$yߚ*wo%:-@I[ Ybo
&T.(l[m' $.iￎhH"U<^=JwGm#DI]<d^ mcq~IkC@̴?c?l1S^PF}a
(b똩fFS*#
^tE}Qm'7lV]*?m>,oC~16 Z_6a
$2M2?"|;g_]ZHڋ,6$mHq? 4"AfEnKmO' áW0Dr%!$}F,J>|4LOKў$ig$aKP_R *v:5B4JD6@f rQc#|9.W`6I >H$
QEkӫTs
QCQ͢_hEsD6dhI63
me{QEX:@s6l$[ɵJ= rqbXqq|vT vS[_&dW d 쓁*aD,hvvwDK"p"hYDN)tARВc3G(aEN-Ьk ֈV*oȽ9ЈHrb{YE_{ ;y_ދuo
JRgc߭wi0'AiS4<g8I'J'u rr6áCwsLb=-zkXgmM AkcFtS DYzoDY%y0sy"a2_0N$*IO N ɓVDaVc"K# !1$fM#v0@e;8ʶy!( !/#EHnOy\ӟh M& Dd_AfZo w` o81*A@AÌ5$(p2
t-}MeHTCj eX3h =IvԈ0D}zj_4*h,m'-=Է=i4ڞ:և"DQjF#ɯ+AT
,?s%$'[㹃f! DszLl|㇏cpL4>S>#AMzR
ٯvE~+uC"c SKw "$ZJw#>Lҕel h$O@[S4p 4[78~ }1}m1C̄x
4
GMnT7 (}(u$#saC#k|NtdE3%V){!
+eP1E% HߓX
?/ 16 DFI߫ 4*}w{B ه~d^g?wp.ۘ_S@>UM@%ʔhk zL6&4DE֛o?iaӎX)檚ȴm?*UFZz%}Fn4-n~m z"(coE-v~>{h%P 'Q Bqk*G n^~T} _]?9 }
XW}";)S9x@w AR$1.PPosbg?iuLjæ{IR ͣTEC%Gl|#[+h]?NLOiQ6z ;LƻzD@O{e+-b.g;j+ o\o#xS{Z-HBJo%ki#8nAg`XSmSm"!Q4-XaoiGx;Lg&
Sl E
+N hFܛLO 4>Yg1UFdQ&!XhV '-wg_PV|C }HC$?%ҏ %wj }D BKl^SͰjR5j߾eRk e?<S$v 8CH y A%;EY|}j<IҪ9Ʊq8>z #$) H7XJW A|+_$"ъ*gt/ ]
/ڵ}#;t ;$ @,WO .]W`II+ dzۦ%Ds*AS NH)6fL6+)/qoKtH=/Q?/%~B|1c<֏qlZ!C9t %϶h_:OPT̴}DDcd>AvG+;>J>hͨW256O!3!{v~_Z~TAp$LQ0~\>DԆ7aͦ|avuwa `2kdoC GԈ D<<C
\ 0#C?)n+m]!Ý NvPGg[^C
3̾H?!e1WAQ8hGVŶY %L?c!6BAջFGĴqC8.AɎP0f{zI:s %&暟?fm$.ns\iwT}. Rc<>dV"h-7ST0]#aߠ>ӣH[m>DpOb}JL?ϗ1mA!BU{3S)*|Y\A4-紺]y}36lߎ |'>xP i{i/h - ])}Qi^1nlK3lyf1JA L}!_'Q _5agد-Cm.T8B X
:ӕ AWaORjJ9#-%6O!K\_"n.!_hAo II{ 賢9'Jm &dW |4.;+v#CSv C4_Nэ8ֻ0bU0yR@B[UHw5Ӱٰw"zHbAjv3ZlҒFCEu7 ZCi<|, '_~!?``ACE"$˩74jYGjn2"4ZfDxҳM14R5jjM`%88*m
;P
*Xy:">!pkC#n/~D# 4\W37#,N@b ]" -4 $ ~\q-pw
t$>H s ޛ[4[_O w7>kĀŚ+ PkH< v2h! (EP#[Ubެi* t786D:|4"-cTl-@o`YLNi}Xi>@ fe[jd_M4V#Yneh_$@gV4 0+ FF0ok py(XP,uxs>G*fΌƆO+pUD\ذeCu8t>V""o*8E|W"? Q_E# ԟ4d<O5bw?~ t>W7vCO``Fb1t`9s~{-?w =|ȼH`ÚCHHSgl\.*#I85U )VpMx OK&H??
"#(msw iշiLT:
+s}^#b#6 =R0`1wӈ'߽'%e~] >R} &!@`kE
կѻMQ <4Ĥ^h};L Ŷ|z'QهHDќ^*9/=J(\wL @P#bDaISd&8ʚf%`?ƛ!Ҭ.UU0 轧&V0MF>7|<LESTL{mU!4g(Y{k=uK4@"iL6k.Hw" A0X۩ġk[WLF2~/:Y;q]SDjt_AK`pp:OnN{࣏wj!/Ԩ<|d;M%W/!#NTIHSDX+m 9r8:G7:>c7*}G;J?F1x9ǿC(u_hVO_Ts}ЮVQ$ArL?nOO?4Ji$QP2vߥ j }`sξ$1 d U@5& W P Ѵ879$ WrUט| *waJ"dywv'iV%G h !3ف V*ك}݇ϟ}cH:x]b0Ϧ@ӄH /7+ϖSNT|x^LiH]w?W1 ɲhkA]S:PISNU
6]PZ<?OY醒!yq?cy6KR'}yg{)0p:o4öAv `g0m)G+f84:g V4@lo~Gk ,`[fN {L*Xcӏѭ)H>K|$Y>tCcd|Ċm~9/wPbέ&|E8i_Ϳgmuz߃c122~k߫= x( GqQw >t=m"1̑lg>H {vSEu$58N >W
noM/bkyHG}l' o!X ۥ GOk"L2Hq5+Xij
FYݡsLDTuLՊ) n5[`S^2~I ѿ2HxĤ? ѹ$}d 7x#:\hZymeZdiӔƩ~ ^a~ϭ he d';LoЦIO"r,=GHNzYNa7m[܂HZ-Xf
,xy.G;/ <~4JߖBZJD4j24-9g2o;\!1<WRT(0vBDH V(C"inKz:G(6Q:yNmCH};%9bdKJ~?KLJi3ũ߶oI @ ZZZ=ܚ*mk+}N'm쿿:XPQSC\ ۷Mcպ%WTwx #O6wBK7
-O Y~ Jϗ
J7< i8kl5DO措bs q7oMk|j,ye,]Vr/-Z{ O>r?vYB'b
]]
~G`TNCmTt$4+:DeC H"IY+k&X`x +`!'j)<,IEA |m54œ#<\mC1).t M D d*ps|:G \ 4T
(|Wm' + `Ej2wf@?l8r` >x0>|(Nz|"VP7p+0 BO#RAS<)5K^BQʟ_Z ϜUq&[0OCgo@)>C`MiW-!i.߳Ft,K`6[Am3355cAt- v /!+{o1a'[D+ h1KsҼf;u<^_Ϟ#@ ufw=+I9a lO<o(FĻz[wwgSktR Icy=4pע %,FZZ
J ._U;w.x1<7m |q<1u x1LzY<SqM7ᅙ c,jCpg-hxُc!Vqi+ 48 3 O51K>)x ]1=3Vs tt$V-E
IS" +1FJXdGxM;wKx_lo$S 3[aﭦɶ @{;)C[wu! !|$ |*$fқI>fA>ex^B L?B =w:O>|oyG`K0}hN$ fI U5*U *jhz^z?(f<,:;IV>Ao 8Mݜh#>+X?+ЩkJwIxi/ P$V2LE RdS-dO#8H $xy<W~LXu$ ~Vb2 6i,vtv< Z
: mWBޗWXq)e ͘[7@2:|7$ vUP~ kϣূ4:A\
\/齳]D:-$h <n8~UV`S,<x>mgSW\[n?,߷_?~D3tׇ`2v(Vh/i+I!8.446ca8w.)NP~LI`=nNed>" LIp䵷 vWe"O4 P R>hEXBߧ5ߌ IR+PՊ>^SgO ;̈T{;~H mE)}]MQP@ ۬>K |DI?AIg GfVkU b {$=-
(@A>RSsOOE_W'># =byWS>ͱ-R'I>j⍼V,S;}
U'G;@cgԣUkA6v$+o|<!Cii. ik[ډhE l (h(DΝ(f|qs ZzI>WC9 6n܈M[v`] _'x
|h臔}%VF7蛲cHj
Hl鏠E0~P`
̜9ϘӧG Ôi'g)cڬp[YӐ&\UKp9 hr6G ꤂V՛[
;1 >_!Om5`2%u٩\3WQӊ2 ׅ?%=dt_WDBkn$aD:"Um'-*X4O^qAE w9Aj샞 u;nc[w y2 c]o 5S, u
m#&`* @T@{ >y]M Qb8ɸD>OG 6 SAYS? N
"N$J}ĉIa|exx}y\6CG|5}TYS g=IU' NB,JξB}L跄Us%_$oO7 @:;mKQus;Nk-z
*hҐ*0>uzh>l6SD@?D)i/[ m`AS2"Fer-#۶0s
Vp8LM`Ou`gg6xex;pl44;1'|?|){]>%d'k We
`jNe97݅ y;9sMÚ˱iJ,[|S {= } w#ṩSH ԧ ߋ6X`'1scxq,̛7U˱{ :](E}n xf RL{*)(Vq<I7s)m=?`@NkӉ };;AD:&y9G8ٷ ؟|X BѤh%hd0hk$&W *pVg*x S |]y#A[F(Y'x}C-APTS`T6ğB}x!#Gq>f^ EEu4kN<_ۚ "g@ee{De顁KzJpk.}qMRy̐bo3/!2`~גSAe $s{:'Q2ihxdG4iSlݿ_cK]w^I4BtFࡃ '?O>#"Is2~<v41|akk:tw/:u*ua`μSV/' S>ǩ=(կ#S0nÌi0 ƺW㉇ <y
>,_4gϮܻ
6A:Xh 4i i A}"X&Iq/nm IO%A
9lrn(kOO R?VnTTNNXD'd$$&3rȦn5:sN3J=xWJ
W5-5*E cu߀o| t8Iy
Ft
HE
iM(AB>xx$Ԣ(?o{
s {
Gy1:$|>FrFd+ Ƚ6j]lJд&.$Í[`=tX9OgKN{6pO)IfpI "i_Km-fф(pf [븦Q5D/ i,DEey6
h%M& I (TnQC.]3
s!t{odžM10\Y_^9sH6RGppA
ϟ ??mk3s6wgLh]mg5e08M
ؾ~
:i>C^_a QQ濄g {Q;QLvۭ&8sskq*Ly~LO}CxqKxqZ-ؽ{3*+wrME_G2J` H
*`@ kdv6A,#R:i*~_A nd
fg$xt[:$}11HgW #(Acee"u[/}, "1HEݏ Ǎ7܄oMgE$YݢU1c?ٗ8\_, t9D O'o_[h(>eʨDKsm76@ *sGzd+o AZq)A
w|8=سi <A{6+N]h/jԝUl_ytI $ m +@@]7
¿<}LAa e
dYl]Y Ho(hh>1`8e aX'&w%Pj=?~
رv!<~kyEqx(^?NOg#~ HtIX(\rq8g |!@08I"XY?#cBÇ3^>[x*x2<S(1==܇{MyOO
q3yTکg#g\6b+K(y)xvӸ11o
ݲ*Q\JW96Y{V $#}Y~V@[tLE&o}MWȫ;]K:~By0g 7v
xh5V8i\izyz+A}ZMO[jLcPUM&a ō7ހo; -
CH!~ *D~Ǻᣮk*^u" q*{-<(`Dvv`+a8)LW@ skE@35~ 1ձ G;pxN0 ߖBnuK5bv- i FK~QC V GadDi/ > FF~-
طؗEW-!FZ!D h*(m ` bm E4e~pvPUYle/aS.cpp}
(}Έ2942 5L+K apBmGeNRY7FMC5X4y̚4 įo z;r&7_zոksӍ7f 7&u'M}[ ^7 3{NGs4VnEc8jvPwttToZsՐW|aru]0PYRm]ٷ &\])ѵk̛$Gjt]qjDZUA0
QEw'(;#ZDȅ' ~WFxB) ~d ɳZ@L44F~:&-ECGyZ! ]$< p;c>&ao[$@, MjU
J֭;w t
T67Sϒj*,ЈRO
;Yt=S{0#S-G?yk0rkOQ:
+-YIr{+Fx O~^FbH$q]4()vۏ 0EO`Xb &Ǿ!t&ht"X0J$u5
qSfȞAh[ס s_~t&&<7c'axfSgW7__*pu\w͵Kqgse_le]~t6n:<9a)\2kT 15e"4]pDz`|B*PgVɹox"UҙNn0(tTk{ Kzh$\Iu֖l]2mU
R7
(PD L4 H2~:qO8v 5lnyt8"h<NxCI/AD 73H4
/ejZ(@'! <Fgio@ xtI (x`l u`@%Ȩi~ǪNL`
Sss&oلv@{$s$cfs # &#$Y'H'=X7CҢ 0>!#F:_d+jHH,h_4<v6@ TX͈y f|, V:k1{si|TwmB tlƮ=՛Ţ3)3jlܸLJ1><Nǿ}^UZƓ*Uf]~ڡ]3q/n&̞g~?
qo矇o|rYgw 2\I+nE_{- yAG yӞ}@3j,GS.FT!b%p8Ih4ZM@I*hh6
8
gqz)ϗqR&KQE .nK-;.+خ :ADn 1(}Fټ/u@ P+x,Ⱦf>u7hj ̥#[o|Hh'pϯ A hGg|_z걟>Uc5G]'|%bڡv qp_;8 Il_S!uJO|9unRA_+ op1?Ⱦ;1ُ]Y7t#!!h1D?0ўwYZ L~\vMAkޛ+m籁 ,0ۓBl q
Ky\7I2(p ? AuZ8
<hBm
$ޚ+Qhm0A$9TUQ(V*T\ ⳅ_ĊWc劕ش~-@ Hh _0u,JU.wHMq3u܃P{*#1%8p-Sg͡?g[qM7oÏ> _pϮ/<l\.Wr\@|p5?Ã>r,X0>(hlEhU, bwFMzt H} 5Ud~NF8t
}@zfs
/QРD$Fp|Nx~|;s=h !m j^Hi prʆ~$k߆ʹnׅ/@/Ƚǹ<m1Z3u[!@J^ ?/gv<VS12
*Dįh^w6C 9܁#" !^("2ܦwR<'h =Ux}Oz J
;kv ?*FԻq G0ۆԉQmF_~q]-nݏSW@ @!1bj1cFZaJY~n C+ۺ$;vжD,N ZR#_Hhò1+P `4NyvzBMU_GJQ
MBڐ,6Ŷ_ ,PQT&ނAGAF=BYEM{vE!Ԁ߽y |;\)JdF{}ECR-tnp 6(oP1(5wogcF1ml\tx)Xrc8> { ?Hz'p]w? y Naʓ᥅+x*8]^lپ Sg>G dM{ѸwjvoGiF;S!
#B`2&H# }NC"-t֮>?
*u; Jm23t)N#0tR}<*LsqMn wU$=)4("Z J'$evPx)G |h+{MˮGusN?#Ț@m%YF$
\k
D8R #kЕā!al[,l dp9"& @c$pP@jo݁ 6b+)lZ c|
(k.˱m*l[{6nAݨE3w0&9Qoɩ@ƩcZblyF~x Ry6ò0otl+f t^Ϛ}M; ѻt:ChD eh xN ,(\IWRjPw L-**QW_ ć ~[ݦ bdېPiW ZSfH,W4%s_: _Ãw۶ sG ?
=5W]~9ٵ4̟ |b*fϚ7ciX~ j 5 S+/D"DhoXW`:zHgOL;+8gFd5 fFUFKn(+Xڛ ZA :걃芑ALE~<|:h ekLY `JL2 =^f)/EEypk_:"8
p
$I{4e?킗@BW5r*yL3! 0 Ǐ `f Iv5J!H7xfT^KS1:Aw =*zތʱnn_K 3^ߎn g<=i=$
My3xK,y˰ضa;67#LRVAkTӀ"m5C%I˒k3EkK{ eiE ύN^
>s:|q[Ό|f Y?kdSɮ5@b[{?vEӏ B;t7sx:nkE2ڋB6wVaO%ًڪ ?'} 2?ƨf=nM5ZLj&I܅-7~ <6oچysS yufMj^sڊ7o>?7 x!<S3%lذg<U//};g Oݯ"Dͨؽظn1
B:@BC&O}-TYe|0Z7?@ xezoMߖw7'P }ot2y ~SI:n-`CoA vC]eiHMP(Y6 Q p/W53B07#MR̪^HΈPR?AHN>~
ĭA;1Z-C0B*ڃ$ߕF?&IJV@jxtw $Cuvcxyt6!ټhsbO`OcʃaO`ҟLÂ9 uؾvLU44R#a
Dk0<6R#<GA|e1x)ذy6mSBA6bwym$}Uc;2u@/l\HI 4 {V
5eP{v ~;|Jϑj~{}:B +uVE
ؼ߱kc`*g|O6o߸ ^x Orx ww >,.R\q%x&외7wG SO=a*nܸa&6oކ u6<z5 m܆ekzB4*lDM5~CV=>wnmU$v%9}e% M qz2
hP@CfU+e(`e5Ad(ߏ˾Xs~#S%
DfU'ΒybIڃ }$O`Gnf|_E4C!/ :wخ^kK7/$9|n~MJn\Xgj~?5 d}60mEv"J/?N5W6oٍ+7cK`y7\fL O>> i<99,u~-ٌM/6L]$L+# О#bd~IbwR| #K66rdh
#V.3333 NJ5x<
P'nSvP878֖A SB/zFQY N(1\ee5 WB, `F5#ـ/F"ȇlp{PcV ټ >߽G@i#IT[h e}T+54ܳw`;f͛v=^|~>6Yet- /̥qI[[.]V`=c{n,ZFе[b.Uؼ}/b$]n .)!ÈQ{'
ԗPG$}E4!( 8TʯR:)VJ49q&4gs*Y B5M@
N}; ࣳwp$IM/¦QEoF^EsL1CŏT鋡D澑d{|!R!<Av(6Nbe$E>btu~D<Fhph4#|`7(Xނ H)J)6|""
4ȹ'm}lxix0{0'#?'z^w+:|%Gsϻ7R\~+~x6.;g~yG0KغipJ֒t&SHW U}cUXx|Bsx
;Ɯ/%W. yvlc(jީ.
ZX;(Cm$1h;iFt06r|mDuC쀭"!Q"hۏM6|խ >;?O>xTdD+n &]L UX$15҉mظH?` H7mہ+VbK b
3k&mق뮻
<?%3f%Vcuqb }w5eE^3jtfV ;}
mٌn>k+x<->*n2l,
븏UC4Z,eFR,"@j6:G߶tޗ%C(ÐnE$
L(R[&=4B Iғޑ h* O([DKf9B$x
`9:ۿde3)}
{×U_ǡW\.eݨ iۊH79Fc3웚A}0CQ[]Ix04ɦciUJ
(q
{ J\y5+pww܋k7^ .<xwoq?|?W+|_W['YsdhSSr b (*
5bP%f:5h ўj9/:o2ZWT`FU D.+ 5,tP!jȶ;ia
5s(~D m! *h®]QW{#7؆IE*+Ƞ?N JHR*"'dPfFlڂm3^|a ~ Ķmv&,:?K_ߌowSlمEc/b%9X*j* xn|k7D{[ ^/xx#^-qd"2kyRڶ]=j_ x>M*C+ Y D6YUS@ڸNmÑcﲽ\^|ɿk^+``
|Q]h
~M
ߛA 궇B
&Ux4IW 1{foW# 0B5uO R
y
!#{OeR >f~}o(Ab*#1@:Q (QOP 1~&N 1T+xee
=
D0F@KV .#SoWzos>B\J__~3_ǯoo7_Wue|ﾆo>=g-@0J~4MEE25i$ĺ Qlp\:jET~ }MqwA:~~5صwU*. 9߁z
b<Il!QJ[ s]ߣML r8=kiu?_jaIdy ?Cu}<nl][ף> ;}
+4# $N@/g?&o;؏<=^ih`
2ggG V.^_y/ṙxvIt=wSWcWXh\N ~f46;+aVƂQxv:n6o VVoǚuKsFtuoY4E\8rpQAsnHEIIR$wi I}VH-]E {~F7?k_E4Cq!(AY VNehgxO#e:jy/$ة!{/ M u" Aoo/oIЋ{p8~ 2hn_}A[-9QV\RP4G # 1bOWيN :\8z ~tQbջj BuDFAVHKHt0.y_^}-~k_W7ng[#|~Ws{9?/K?o|~ f?FDB IDAT>4|s8$AϭA>gQ5="L' c`Vozt# \J2BmwțO28w.o2ݯk.eD"EܤhKB2E$H ;w8uv_;*L ~?A (`dWmf0Ŷ_ ,s OS+m+аg%;#cxݷH$i(5* '7ZV7Q/ުjTW`+)O=_kXmĊk`2%x饅EXt5nNw~Wn px漀g};L[yG%6Dy1pfN}h=2 {IjB+rKM舴;ঈ[T<E'?~sE"-vtd _#tܜO`F 8_`@hDv̉8n! `]HR%S4-)yt T\l><C8˱p\C`TekvD*OH'8:KM"اStJ۰=9/Ň> (rnP$Ċʋ[\8Ȟ(z3 }Xb B|cސ r&8gϦhB3&O nz?n¬ /g=={Ttz V Df L%?FԾi$.W]U. wpesQp(hKwwc l *N!SJarLyQ\{eW8bHwj,
Hrt$'6Ş]+hX5RH)T4&pR4=i۞*4ijNum5jk _ށˮldž;|u˘Gݟ71fUK sز}/6p,|y5͘'wXvƅ%`:ۀ^
<͝Fܽ;wMщ>y<f 7w,if{:uxw]OGY fߣ6Sx,JAksi0" ؓh _``BZ$
o =U
`jejb!U cL T0('d8. ;*,!_"{ѱFpy <&2
f=ɶ ͩm%I
]f04 mdĢfGPL7 !(\ n/"*j[@vA)$$"C0}boY
=]?*(G#/("X0Y1><g `
!d?> kVo3WiM@@)FϩH5ETJ&!U`hP5D߷lE#eW .7ϸꪋq揾o_|$jO+G+l%bx;a~>IM+}/Rg;}}e6HҴafy&lظ ;AMOÏO^g%"4F$ZF]MT $jCuu v}]mbXIҿ`
̛ ^Z9n.wly6E+H&g,`͆Sá,> ?5 gQ[
*t1= }COlIִ!-فD鼗!1v65,
&Q?c4Ql;Zϧދ ܳ_ijWB|P h?<4Ia1 PI:]#ԃ}Mei/
>u(tD3e?O \G-(];1DwםH}GSߕ*0DٶYtu(fL0TbzϗHo$kUvd^=sR|(P;q5 b_kd^a(mAL=_q
-]88~1چGN`_8Ϙn>xzG0<"I+q66فR?Fs}?GͶWٞͮ02?Ld{Ze%Hۧ)X¿Z&簃(%B?f_R- ~r!7q.|7t
qN's
GJaNp{~ 86bMv?ƶ'a[~;~IR~ۇB7}j&kDG3vn^=[мw+; }b6dАH mb[hӚ#Y #&Aٵ۷>^ vl\g%m\ /ŋҼyI̶ev\zxy&]^ZYflW5V܂j {c
[|m<4}B˵ 廰c&T* =<=pn#;LR>
" csI#') hNl _{`"/ "꺃
ȿ >P0 n<ǴJI
K(;YY NoMP&͞
mq2|x@X0LrrQ<sN8xwC.CC$1%gP!W 8 bk0ahdK_Vvz^l«=^EPfߡ~hJR2F"6K?? Hs1̜".
6dk! #86F;xgBr Q '/ص ||[¦
ٟ06v </D e5Bn< %{O6BE$S*ƨ)uqI- =z E1h
l\te%W^3/>nZ̚=ľ>(0wG=f
;vhh_[G@y֭p뭷[:s?Yl;`
w'Q!n: w@y>y} {&l4SE[ !p,P+ )/k )JB β2lX2t-3Xj=݄֯+aWxr4w]oc<7`k1kLXnI6lۀmeBࢁYFsxgPHӚG!ռ|x -dҤ7jI>3V|3OcmE:n2,(mFΪZR5}˭ (A;) mH88ǜk?q ]C "*N
JemqVߵ|{eZγ0 ۍF'ɋ sο rPE@I:iq8M`3s4oh/0h
lTfoS%zte=a[s uVSZ4:x ' fs9F)<O 7Lӣ CK:
W}55[ۺe2I CwV4W^Z`TdV 櫛
>u@bpr_WDp~|p?ͿO<u?kށއ Hᖆw
,l ?
F/c spA9sv}-QWAsO$H B-a5OهhiM,*D DJCX;|F`B< =9Ta^n3F,\ /.O^ wb:ܰ=<zIl!aXl#jQь
71UGGaƳ3p~6) UUjNi)گ 4.:Ht$~> z즃t_n wӱh eZ;E8[LjGJMk%p*,/"$e?
*(0,=IRPTP ۱ ~]AV[I"T_r^Y2^?q0'Aas
W
|e2y3}%ʠ0ξA[{7u tUn*!G}o "袳ˢj:t8r@/w;i5KGϚ,}h}N2=hjSLhk\$v:x}Q_,$> e3')8v'eyV+XMɗ®j߱ff8 O)P35~NvM%4"{@QA ]Eۄk~q9!)nO1)ع hҤm 4Rf5yS,HRxqֹg | 'o/tzi'i? Y4w}r.[I]ڀOx >
4ۈ$ ۯB\z 4ne+U 7*ۋKځ l<H_zvr3/\K_T5ݿv.ڎ\ ?5ql!߀=U.t5FF]G_i/;F?To@0腧
7c)+GseS N^>p4oX œ [(>b x[)}e<e'*#GYPp|N$QoiV&t?L ДFgm#2g8|I+QU+VP_yoPKyJf;Sdy6Q? d%ыh>~ۘ}mD{"ǾUt?Ql<a4g DE|W"Z b7Bˏ
i1msHX9|y7БJ╹s?KHӗ)ED=F?EkW&wcU\J
7JAB oh y5nG(Jyv(B\ &=^\s
~|98 K>0vW!3+X@C\!{0f*K
N{t 9-M ⬳~s;봺 do F /x]ؽyvoj; ӷEdFX55Ci׃$CğA4me>G;*+jIW ~xjʣؾi6]// b܍s>Oy`#vK,O?1 I%]N]wcJlݼM80~3?_+tw7S>wVUY}Qxa+ ! rKr
rzc~[iGR:۞>~ƟUB/I=hzC4 YS}<> 4@"aGi W? G$YSꊇ2絨C 7oy
=KV-e /kVӮ.¡CibzS-_
-[f}9A\Cc$I+}E#S/<N Sh )⪝mWh7 tA#c3E
m<E'?9GQ.mIN,;ɒ~q|Gh{_BܘȄ
d{IKy3Ρ~`ɒż8}5'D r[ MK4Ŭ䆊5 {^y8߿(ԧڑ~CAB?Mig -
7J!λl\|ȔP^diG\P Ia dH^jNib0J SO=>dgv)ړ0p4\رM{W!څ_o ﾉ$x"9 Ƅ ضJ .pffx˗.$`9V.Za&X %?eR, ӞEp7MJ 6N-;˱uG9*j p,Y?3T =m4a
44߁\Hqo'N"`t{(Ra !h'S.)KUJ|?f׳D?Xk]ZU1[D(T|,De'ܧ0kØ=w*,x-`/A
N8`3O 5;&8hʝDDR2Q"J)Q$8HК*#9<,Pq+z_Un7d^ -]^ky.mQG0 ^L`iMؽk3Z3~ v 4Ty[S*H+j\fΟ9 ple*S wsVoYOL`]}FZeeXǔ0k\\rE q> Uۮ :߲ޕ-)hc=p(Cn"ԼgEfv(0]t쀭n>4b44n=n صy
*v-yxA7,ĘsntrMt|_s7U44G
ٸq }lݲ g|4[q\Vm+R_ܗcێj|nVj~q) 2 /[njOe36nnD$Ţnmp U{ᬩ 4Ԡ9aD)BOSuD '{F 'e it!@Ԩr Df6=L%:9 {`'C奝@+!{8ɉ4\]8 $$ްLd5Jrr`ꌧ'G0cS>I,\^=<6PN؉Ύ.̞"_FyuIMۡH(҈Iv@T Q)Una_#Q@d 9B'F`KT[ Ik9C|vOMgҨ#
^-`e4N7no
g29X,^f&A ?ԨIŢV #JҠ"7U~w8C&(<dw0?]$
ƈ57^ w?V]iL Bd"%z +-\qY-?
7_M;"U-Q= N*.-k"'O$Sؽ{7_r酸 N!W
#FOଯ+- 7OٯE.n.8A4?7fzPxI l&Iwvs'V̾v]9]euis|&lZm;"?ص /FT0TT9YOP[44wK~/: M{Q_oC[. 6+$V+R$"i7]AfQC\G"|L=b?=Ppd1CA G}E9
)3+@=V#JT@eIENIX866i̜5OO}3hO{GO;y$bms?װ\swPn[kNLt T};s?uo0I\Z@Fb1 m|L};.hMz0$4X.CQIU?s/Z-7# <()H{J(ʈP Np>?:
ma)fo* f W_܌K.~ 7+P:"
YE' 73N|: ]c( RM^;t}/k}4`2 HVEKט顛;Hbfگᢋ.W\|Z جՔhxw+۶ц]OG+3kG>ԇ\D,:IQ&1F[;BrGN@mE D6>FiV\A_n1o<,Z[l7-Xd{vWaWOXW%++*9MĿQbyvt
M$\B0Bה`5n|+@bV/L_,v G?ko̧w
<LdzI5H@%¦v*o&կ.L/$niy;,} s3
bV;~US`OUn s |K
8-Ͳ#Ȧhf_Qک0
{ s/ES=#_( Mcuu?Ñ}}(Dg߈ۑP_!
$ԏ1P}<N[jX:ÎmS\E-Lk~m !w濂 [Pb:y dRIbl.BK.x#J hC ع6X FUmZ\v[~tlKXxEڄAKJh OD^Wf,9R'UxǗ73l߾e#|G!Qt 1Z4`CkU6mڊr
B:ME~uV<ڕLb,p
] 96H,!ir9Qk
P'';o"H3
*[
Q Ʉ"~::o4-eMj
,gnĖիn!a4WƲe12e&Ǘ^^%~vMXx zf&VQQ5ز ;vW`]f R.?[SFG&b>g-*wnN\mfTJ$Y#C$,
djR'#rU`\ k^
uQ<:nBMpRn 7 C#4-<Z <Jb7Ń6^:{n_ Ѐ! *QӇt,s˯|&a_8 ` Tm3iҁJ4I$I7UnmS1R z>YȚ&"-`MOo )*Xg)hs;QW]կ,KZ| p3rSa kqW yKAOY~6xxqO~ { X0 N3`2Lfm <Ϝ)sqEď!~Jpm7_"b)ϸx0ƺeQ*+Ԍ4CDϾ5x{p5+>o8l֔HD]iGr`bjԗ/GнxQUL#Y!`̌:ktMNg{ʪHh|jwa 0g38oQWVVa
{,[/B 6X@x*]
wTbux'm^([ߩ22[~qƆ
gc%vm]ƚ]hIڷGC(&tnYtI:8!F0!SƐ6XٞzJ{!DQFKIRڲGRe
wڞ&W0j&q x4$R.5Z-yͮ Af<x0q篮#0rv IB:ZȂ/o dZx؆짾$tzM Zl6{!Fm]$tpGQmAT$ߩt]H$mN[:Q@:O Q
dgYSвY
N4j9/V` a$RMFvGg 5uBy@@}Im Ԛ[%dyxΙxgI84g> lk #)E i4Eݜ;w pΏy|^]g?5ѾsNjwh^C(I°6SQ&t0 l9n\}KNU[x?tdr1w-ʷ/C՞uP^*ϭ%v L~b$r SMsFׯ^ysf;gTźU(jFL߾yAEϥXv+U9zw#ضe^zq1i`ӆ $ $Ne8D~}|_MMسi#5 C:FM$nSd3h%*rJM_+$*g /(Nꫂ]%-y_'IZeր \{6"(tj$o/uID[)@S O+(
^1KZ[6GOޏ=zY1
xu?
Y3@}n-җ[ i
>zl>߅j Pba#/7*I.}C=I xu⡰5$
[Z#ED($'UC<՝})[#6iN&JEUVF] ȓY3 #vH=zzu,&-
&woW _ڗ3Hݟ
f[ qDʐx,g$]Y?E?.~vOpecմ!d+;X %umF KOWQN2 bo|]
TnZJU=o1@_
=${$K} dvB6>kj'Q݉VbweXv
\k`WWKy֯=-| ú
1RVw?> KB]رc'vD*2%z- 6zN,S6bmkֳO%~ͷE?k?"R6D f+} k
quAV<TASE Yebt`qhrG!L<ҁO B<_Jg؏rOt7\N[R@ܳO <k<7v5Xz!: >2NͱPUU%Koɷ^ALƨ^b$; ^N#S mcm ڑ(F4BnOZ'Вn>b $|})네7 %)d4Ea֤L=fyO(2O457e
˫%gS.Fs}߈lʃb>L2D`(45#cè%Vv!C?Tx$Ȳ?ӞkZq}w 7 xgj' -[dxr@]&8p+<^]X~ pE?2Y
;jg( 6똲
"xȍ;a۷`owr\ub4nZS.g]l]u;WU j|ư { 2xkj8v n=囐dUlDz3D͖Wq"/Fn3E/ޏ~unuI&+(
V4,^秿E$
o"Pz= /aͲUBy:lZ[7nF=Xr f<8 :IHPH\!/r ?l_mk{b^ʰ`ǵɫH"K㡑 똄NN
Ŏož1_m$<ߤ
$}2_)z ը@_ N ;B1#.F_lu<A୮jxW+q]?3I10GJÖ6L"s+~,AG0HJ #Y!(%*R Z%vl!s֜<M"\ BQA<<^>WV^piڂNl`OU- OO_Gו٣hRU̖dY,bff,fɲ, bffY̌-3e\IQ*`t:t~7}ɸyc?Ocqｾ99^[)瑗M1S\*&2^s
XP-
w7 td"BDKt7bb[L)8E[8&I|b-hpD4m`i`g\Hտ 8 &D_@A61@}W"V7CQP iT
$P\ikg( 0Skb@i&:
蹥
LO/alt"
LͬPg b!s%# ~>=W&_%~D`}X>o~-FʱR5`:5x:&ؔ\Ld2ޟۀtX Ae~ *
Q_D / ^VbCHj.AEy ŕpu@fzRRQ[fb(+.ar]DUE#M Q7
RX,wL:f\Gw gR )Y] RuXnJII_|(ųX$%
"D 2Q6i:1U,Lέ_xO^0251qXr] ^=LLc(#E ,P_ ~gx!nQNOçeRfW$===9~U3ѯ^HImccO<cT<,xU:1X0?3yy0O?~"m#29Ox>& q~1Ea6*@#
By}hNǟ C Čl'<B +7_*y6.}Rq;WwZ9BU[_*NqnN G EmYYT`f~app_w' od\АxO?ţؓZjiF>'Z\EkŕPCc ; S-*J !!9^ߠp%r-ib^\ɠIXg,)LXg?"3_Y < ^ |]SgG ͛ ~/iF[+DULp|
XR,Ugbw L^LK!Pv.ͅXhG}E< -J>ZF5MBEQ**r|2 *4c_W< gYq5*؈}g;d(+,Ek#yBZ4OcQ7W7x}z 5nýkKxc.<. GyecwCs6}sC̤E&0M}(O|s9Y6_38"*`!cBhq+WĈ(*afhrz& cÿc:J/\'>;)#h
ț )]PSO}$Q'戜2R
9+r*jPwRLUR>x Ӣx
4Pcr 14?9_³gXXWٗފ: K+wxE(X\
@Uug/ЈFpH.\Eju]r&rH+@s]-ΝF_g;_'̬p\ *j8 7GwF twu81}|q]#$,ζ00Eq6>F44"
Wr>
bU(n y}lh`#`dpz:`mq! Eg_u1-f]'"s4Ye$[,E"occp:{᯿F,6t/Oo:b,4`*/1P6bKޯÍ ײoj
hG'rr,jjؽo7
ׅeGRr
.]JdH|_W_ʪxϢxB,x&
|\(f(BuE&Azzyn6vhƞ172SJU<Op./6iĒG|2'yc K2Q9DB_`b]K711sh㰭WZ
~}Mr34מ82L9uk +sEo` }!sSi&$\&n CzZ6gDziU44_Ws6
=~ /4,ok!}l 'wf;G6g.2cn\Ur@Scji .g`bd S~a>KbOICjj S o qB+<Kv
qi:LMMhk荆҅;qkbDZv|w4 ..V($=R1c`}-X_zok+b CMb oM yXi"4
҅kbX -
2j5iQVx!`aaN :w,}<`ai { =X9ԁk#LF_n<z/5%<!woE_VZH;t? a%z š@EOLV%)%
p[\HUU oe*@
BzZ
t عR5l͕XT]QgΠ022/_ƅ$7yi[email protected]>&wօ@ @+o_G+ww7I"5h({dFN/ ;!IMƕ$ԧ'&":j1;$ uhfV1\6O@mޗw l)~p Wh (ZE݀vi;͏>/Xuh|(d(]_XzIU~1.\
p6%]idzItFfH*fLSbjzInA9"gp ֯] ]!3L⊃ַ!x Jl
=1Ia0E"/ ] :gV181t"# U$Yk>
E~X/8 &qc4<4R`7&I5 4K$
2r`nk??gx{#*%farILQh~7` F{+B}
;-#{\*4SC,
Cyq6hŴrQPR~w|mtdw$2::u
ML/M)wxPXZ|sx"XIOIǥ @ƹ\7Tb3?ɧf0)4 e1^sFI#;Vg1?@iY'R䬃]1K*o4e945ҀAVZ UطMDri\_&"?3)){ҥA,PtgӸb )jl,nS0Q<[?"-l,JSHs 4UuI$4;Q T,9J➠kFLK68x>@s>EC%dI{ W7n?_}5^.V("64ի4*61'^+ycS |< n
mX0r4>9n^[`:گ?AbRo߇ܢRܺ SRSSSGqiOfdK\{- i)Y0A֫1KQ0$W䇇4lqeqm tl:Fa;Qԁq$<6N3@[@AхIv+znR}XĹ8wx~['iJi& VbR<
$/YZh
/C~'a((#` /f}" }> >MT|2KC'Z"<WaQ1PRRy9sSMj!**KhXzA.32FX&Al_,ϗNIdlCBq> ΰ0Wg}@@쟏AJ|2[17PO#|Χ~(<Q}'u ꈛ=?1N#3gi$OCĹa?)X'ש!R<nEҀA=
\QG_M>硩NF1qp?fP,de#+#94#d{_@{-\T
'}p6 R<H= b 01ɳ?ۢF:FG_+Dm QCG\Pf2D~XRcMq_lM&_-Jx6@NN>/~wo8~~}M0 1Ԍ"x'`i_'?9^_@':Z5ݗc>Qp~e&}b; J 2?zF~q|}G/ߡ^f>VGc\]>N|Tl~r
]L/ܡVX$7\Õ+}hIhhh'w|7-fL1jö.<w} 7oç/wpG`ܣؼQDߡfZ!'ۂ*x keU4YsO@J6qe(*!6.T~TL
!:J؟b`_X~?!ֲb
,o~Q 19Ȉ3PQV e )@T֔v<
1AlQ*
=b ū]b܊4薨Cw -lPMtX(<b+S{+8+iY >Kl&ce؉?? 'H
EZ+J=n|ɫ DwY RlQFEf
K 8h( ť 7PUST5W%P^.fV}(LODIY
Ҁ dgsK]R>̼Tdcdrx ~fr
q*uh' U F#& iϠ$# yJz. 蓖/\g }]e>~ϱF_X`liB֞bgy&rC$t =
:ُ@Ky_}1~ͷx{d]'o,1lՇFpZ*Jrj gӈZYρ2?qs# RgArܻw#Fff1:)f8y鋗%jU<fxE8
+s`9:Hx =o> f 13I ybdzՍ+
he3$V{ WEE9z{:};}9?Ϟ~óSjqzb̓X^^e/ y^.&Wط7Aheĝ sCX
R[X' R]]>C'R;'HfoE#fŲ%CC]
'CWGzzA-X˭@<_c ayA,[}æ9<g1SZhSpgr(=| ,k FdN S坃Pn[BTuz 6Fouom'g8DY ?4^ܾWx #=)HRiiωhx -.I bB^["+y要Y `s :j x[ #.4"Oxy |t$ ][;0=҇zbqrWG1?ޅRz .溈 pC!-l<+dz" Ù ODy3(-GQ!vbt }4+ ݚy1hqMQOT"tRKbmݷKQ}ST#s}=H$VU"R8 j/`pE<|X$5ҳIs vP8w3W-9Wi. !
!Ny[ c8oW>HĶyX W2}rCJb@LZ*YiOyikǑ% hWWLcVXR>_ΩźcQX!Lk0S|UOo3tu͓}WST0sD|\,<<d3$`u88i3go52 qA&
ROstJ/ܝiGu5CmM95 M
y+V3 C[k'jzSMNQL/gh oGki|ɜ rJ[.4-ϯ =jk˟?B?
c| .!) ѝHO>x?Kǯf!=COU6"aoa
C1ގIf=i@Aa^ 2sY8rHmMM1AmPGT0c `[ =} :Мd]\ՅAL6 fFf88i3Ά8福nq1FNV&p07DT7ӐJS1=61X@7ܳ?f5uH+ 㳛Ҵr1q
K7 {-lb7' cO~M:)FD\3&ipWh,i<<ݤy>.ETG(W?zISV,=yg.BVFEE(jՂ+x.4h ?y_,c8)MۋuL/Wҥ%Lգ[x|{FCp :Nx 9nW:hHh0x b+5 bsd
K9g2'H x{ȯ
%.100>"gz 47|߂wWTjg4r09[``8A ZrS<Ely 6n\_xC -bGl{(@X.
:y G堥{Ƒ q}8.N4Q@\}&kV2l
-N"7PP'w<faRu1 ?~F5{,.s"<s؎Ybnw;| f2O2ۘÉ
~Sy!l4E墋t3 ͡ {}]49R+-)(Fff.
p:,dȠ Y0َShh7jKrp&gbNSҖ9 =>| |ӊ|t5Ր7:qؿ2ɑ+2-3SShl7Ni IYW}D:#lnnO+ ؛!,ch<riK蒸,L%A&XR`dc f)*ZǏ11 =xyO?|O>}W[-|<M$2El<O
p9!f0P?(wy^&9?={\
JJQ`%ɓ 4[P /^7_/곈b`؟x]M-x15|!ln03o/ gboqL?W#3sk^ZC$o ~\# _%iz{0RmץmEvbw=YwgyØE\Su",lbdtE
{{s;BSK:j8, e` J _\" [4 ~qxvϋZyu8ٻ@S;gK=X3zuԛiB6E-G4oK|L\A췶=.?>@3yؿ%Yj9
cE_xgr A/
e.Ek[ fG>׀??;b?$ 3ȉĿ|=q$ᔓ5Lea.|D
T厢97>"e"77bK܂|$"!a8"sHMn\_C: 5bnUE9HA
qinncCd_xJ[v #cؼ1O8;Ḇ/|,O:s%h#ҧ1\LQw/ad_/{K[-ź5QK-s_9M |&|>A(?g ~kϰ18Mܬ3e}<EDjɻnsŗ_⋈K 9Ϟ!<,d啑E&~竍u[%/}1$;wIbD;"Omn &;M<:^= u1m E,jnj)<Vg6x Cd|ؕ)3+ݭ4+ďL9n"\^b=OOACnάy>{ Po,cCRM=D9 vP8 CY Uڎ s^*5U0oJ- $wQ*0/$w d-;KՖmE&O M#S-,Y 4 <$]kVCz^gzl} ۰˷
oXutn0GcU9ƻxmP34&hx\.G8 tQt-sG?!$Zm
9l-mAq'af!--% i9C>I`'dgRR
3V鶯>y 5l '^ntuƥ1xy{F:XY:̍xᦘF]H M䉪$O b&M)>$2̵`w(6Me8 1g 0Iܐd}O3|_\ _@Mc;&olC hlݸML/09Gj Fynn ). A[C%ct ~4eQsnф!#- iQX &`Y"1)AWw'4f& 5&U*^w @Qu{./L"p6S~@H@}iJ 84ydb eΞ>,|]Gv~bXT'^Ƃx X~1M#-o Nu-qɌSk EcM#jʫփ6tu5b '1 15wC*y.# G%?_;@46L,#1|_h%KM V161 abzҠ $w 8sl| յ)(%]`D$P\H>IqHMʦVJ,cbzAKh2^32҅?ؗw*{^3,SC8gVԷa7li4`m"b;ݿ} Ok&yPܳaF hJi3BrODƥ% |4%.;
-!Zꑑx 9QW+9@89OhJ
6p)w|WmT<&~,LtDQ(2]]G̏@
f*` JpB9
C MHے7NLKWVG 3#sG߭Q^ ^R\eh[$qlu
Jq/
X4Ť1G<_ibT5y:#]
U uUI;Q>x>D'21J1VdE P`Wf0<2?4+R[4-7Yh ǣ'ɁXX'/ ~3OI['0:+/9LMI)K,vn LHK17QjfATvfAF )"ꪫP^TNt6U Rx]:F̂(/y
nATTEؕaXq1|yr>'C`VY^vn!b'011syŕX_iID9' Q Eshؚ]\wlx&6aj`WcNI3L ) !Zd@W[)K1 jP7 m=R ys|9~Oft (߇PW]LT 6\`_\A?^ttOmjyXZXȺK AJRQd%E3YF&yv1<]G/Y%03օO617ىh}CC}h("= q<{
E
3]0U9'}uxZ"V&
N8_tu}ffK3:mb:f7`T<s2rpKtN1.K}:<Џ
vܾϜg|sb&3ڙSSrL1MEI{X:Bt k/l;bN{8 ~G)#%2&'r"xcBS|>X*l*5 |X؟Q|Qb|FM>xG~wfW:̯7iΗRUӼO|Iqb:1EL bwybp]= (/)Ao{ S5 ЌZKQWԌ i`@"G֟ gbhZwGxD0ǡBZK>OŠ+0 nRmHV7 `q>9A,UxHle w]5yEncSWQXZT=h<B#xwtLtPx0bpE:#>M絥[ O7Q?ž]1 <yЪG0_z鯟c vP1> `o&J?ď]x = YP= N1WpC):HIL͟Ԍtd墤
025ƥ gD4W"4cJ 1$ܜ젮FMnf? /yʂ~>%Y#QYE/3{
jy
z8*˧}њ{eq?Pp8kRc`s\^8} JHOTᗿ-&f7n _naxS05<GGYwB$ 9-ynf,Q/QN]̨)focv:fkJc?DJ KDr@oK5ΝGMCN'DT\ >x S<KV#]<O
<Yb_솶"0 &<{iy&ܾ s|Ͻy\͐/Í|=s$K11;" \^QܓωE!^|9u`b[0yr%֖Ӎbjn 5:<yw>e%yGOK0?w6%=Aum.
k)/C^N
2CWS{Xg>_[_o-ؠ_!S ӿ"
,`_Z "/ *r2Q> WK%0,uʲt8{T099 C4 y\NWg&p}U<zfY %@~w h(+Hg ,2M)J<n@u54ޣi8u O..&,-⁎F6t 3-.4^~HN<OO iBQ$T\Bʥa GQF"Ji>.Dh7يB 6aq| Cxx}I;7-#O0Kux{6wy$CuF .8f kTg62 f44X>66&nMɥM44]8`EzH utK!qc4 {^1_l\Nzt|JZ?G,X\ @gS5j˳p}u=eHċX 3054FBB"fuS3ؼF@`žx QJ;%$y-,cctN^R)Σ`g_|w H-IbɃ*(
'1[q$6P/--Ki~Ma iỌw}}$ar2sBg $Y*jc .kAksƆ169kM m&nPl6+ .w
K TSaFa#H}rMsQA/=&fQ +,SW3+j (BgCXU
mEhQ+@C ͎J' c4biY7
`LQ<=w^V6or?0CKS;[*0D
J:d $8Z[(' g)kڋoz=Hcl5fCWΞĵ.
ҳ8 g{̌ yb)A:A&q4$TBYEC1$ BNz0Z*
P
r thDT GpDj+1JI##1u f}T$,~^ΰQFYRF*0_{_^VPtG_ l5e '-@)#t4ecz
]&_}dVhi(,GG ZeS 4mH.1{Im$E,-Lh3 3R,Q_x A)^*hW160 8DcI$;KHK]:b=ፇo#\*vyX11Mܽs SB4 O?eb\oh-&y{(&D5<{!Cz
>|vw֧ >E<N@.X^Qm|^2#S hhҶy/&Q$cJ:id
ŢPh?y|\Q$]ks|N s ۫h,$pCf^:/$^#ш3F \Ya1 </"\vmiju[q\Fs'
nꇮ.4U`e`$ 8GT8$s d☊TO(>k)8M%.RLg14:- caua3 j05w%`+.`9ouar-sp~ sE}PM{",,~HsD/[8o~4g)Ku Na}
!\NvAgf1'Q$"%55
Tp>.37@AyV*/yX]uyA6BcPS b?- 'hAMi>ftS# 4ɨ*˂Lɯ%!.?X|фwkP+m6 D#)gI&, 6
513'4f9 a\-0wNcK72q+]b6]@O
2/+c@s~yϙW]l9>>\A)O^D:cmr)UtF &ijiؿ]/HMay|7 }dgtt| Ķ\bXtcއ<5ܸs&_`1EvRϟ4
}⣷_dlҀޠ^汌M`;<2N 1yxjXd 4bJ+ [ `?[4s&ϨIΉ:`θK}QSOSI 7lbFC/m`_cPa&.&'0/yW,E_歇GmɽOpClmErq
u|Ѕ2tt~)ee
cضcI WQ8" B-3k$%c1"f K"fy.H
aEMhlQʄy47c3C_6}T&ڒ:,c 卙c~`wQ]-Cr'] MX[H[\vw Xʖ
}/-*D
vVvwFshĕ礣
G| :4a(Af _ѤS
TWbl
WWGh[͏ 8 j*w&ZP7WxدwVx ?wΆH=@G4梃g`_|
ƨgױ2s3#;4709u3kS Y*c/ .Z@:Qr4++4kks_h&ujd9Pq ݰ<9Kxz
-
GHYTy}g33Ǐ7-Mj_q|'obdq>}w!W9~)r SC|Ϗw / ޣ uچ4(igFaTWQ_Db ux & wc_g/iŝ
ˠ 7 ⱵWUan` xt oP A6;IQ$]ÝS|ا pk wOM/p㚨t|L~U(ezJ;#5d_Giq!!Gڵ 2228p` AQ ڇ'T s cdR K J,IXZZ23ƌ
1X V<[^9D4JW ._yN r+K
ܐiK~m<5Ncop^ .Y1I &1]tP8x EzRR~&R2Ν@z-Q'pA=}h|S>8E!alfA3e ]S> @BI@S bt]keBuԗc
e ! wӀ$!"< f}LbPWx2dxछ9BO9!%lp.a
9 :4 LҀ04
bMhx ni,*DS0WAtUR 8 #- LcIkhjLI&}rc z&>$Ip.
U(,E,N8Kg`nj&=~̎ ҈NLbH\ǽ; bͲHL Lx!DmYqzWA {OH&[ݧ}' zh 稣wv4(h7\f$> HB'(ZS\\jnP4##& q'(7+*
Ɲ9ĐT*M4
apd
d5Wp6<5$q'
*]c ŕNay
QPRT75 b{I$;0? k!$q GQ8Bsp2G (yUY N*HzpwB'*c!FG5q?߭4bE@7Z
)B,» S y
8 hj#z֍B?5##9
p0TD֦Z
ueğ=zd
YHJN لصg/.0 WV\ _W;x8@Oܠ %uuJcC8%-C1IaYBi)Bq%<L\Ѐ_F|/< S5+
ǫUxg 5p "]5(tqGVZۑ|ƆC 9L}g~+X20XD21Kqϸe\ủu4M]H-(n˨)'FsPAr+a
X-v#όMS+lb;ъҜT;#T#!>yJ@Y^<D9FQр 3 Hx,]u/-D".uk4 42A^ >4 Qz ` uT~y {OL6H[=~
%(ILF}*1 *D9{N]~fV0,)# UP +[8j
>|^KF'li@abl/^,^_UD!%m:;@#Z OtXD2<02QuredHNDAi4 tgvTn&q2G ߓص{v
%5u aWR2wd7tc;3+}x`lKs)Vocơ vΐ~8ЌV &O5D% S}MXlȬjYXEB(Ar#N{`J36G nMgVWV¹3ظ&I6Kۤ$j M{pDBɖ" un3 鞀 STAXD =L9_7G;/1E䦣 ͕(ؿŨ*IE\7<&k`$ V% pہ2DM$8E#44!GUkE
n
qtE
1(qY|
)m1]W4 V&14:6F~KiF ZaΚ0s:
MO?ogrs.DeYGSY"O÷^"'I\҂)^jA avf
m;-
Фiu6EX[/bn } 6o>zצo{oQLIؾ]^Xr(/`cXbRr_L=1^p҆9NYZBFAg ЛSPK[ih"'-m`( udġ>7 Oolbzdzyr2ɣ%434*k}
}@=rz
&s>(Z[,UlQc;ͮ\fTS'-}|qTqľdv
U% ;c* |{톶&T5h T娹`icǎSLI~X0:\ehTiwƶE"~h D`FtTOZő&~>j,TTP\s8큙6<boʛH*8h࢟%,QGAIIN2ꑓ}1X(LLMKE cWVR9,M bm O[x;9:q:ښ4T GCU)FZ ` W|\ Vd_@s].J)tdF~$_Ga(_GhHtEEb=wuA_[mLad?K[Xb|̐'GViP04L;t]?6%v" ?EeM#/Mz90RIPNMaqjj uṣ3hc]
5zZ"} -9|=\τ5/h% vv'ԼI'b7bW5z
/V)O?yS'x`#}X^]'vWf{}qvkKRU3?xO =F}q1ŬLMSQh7b[
ކ2, A rli syv!?2rQvw0ۋnѝ{!̶m37K1 ?@ƆSq}mbM(z{rQ.dJu Dwr҅Xw#܍@tu>ܽ{C^_F
?&C GTTRƚcXXp?9e?*-њZvrq.<~@ ~ylZgV<]Z]z<Z Ưxz쵸 eSzf1i?/4W q],q!:EbK4U)8 MqɈ C
N9;JR V SPljP8*7'[
Qx>,|=IPTT*PW6ȾʼtQ0{"/s X ʲ+Ks@_y4Q0xs}P䎪9m'aH?㈱\, <+ *g6O/̰)U56D ȯI 8{LZ$o]rf5dg"(*B(
xEYH9Bs}I[)BsUKq"6&D3RɁib'} -YXd_+֠_YVLBB7A5Cqm4574 b%~%ğFGG-2.Cmxw *Wre#=+iL q4<ed"?/ WI)\4.Y"QW
t CeE0VLb
w& <nGh .SUeS)C=\21B7A$ (յyhhv!W]c,)A bv_0cadƍT)jO :t
mS(+C ϫZA * ",,̌f; wGaAi6y% S,
1 .n;{9 rŌ
y~W㤻?߮ 7TCn,
CGb9]Ih_kdWvR TB.&ᔽ:왔Z8>h*Ƕ *9SՈ! JQaO78ˋ\5!a;(+^&
cE¡}8} E%lߊsgOc=8x0 p!)09`L"( هKqXX^X+rSN83
{reQ|)j/"5Qx ) .N\5|`~2s7""ZDȢ4X
-3YΎ *`le%M<$ 2{`a}Ml!krL~ > Abf*BcB UN8wb Bh'<=(H4G] B¥>:ԇu
qy,/Σ + B~<pt_7Ͻ)q!!
ʲX'/%d
H)ODǞo`("+8Aѧy?
1giYYҾ1!A=u
Κf\xf|L^jje x3=
Nb?M^=?r Elh@/Tw6TγO9Ђ y4 ޅNBv ]s?2M
?m A7@VA.+͐(d87NrZ$JaF>۽Mڿ { g2"@SO\ 8sA N9傸
aT,[[xɫ %o
ÕaB vMhخSiWp@1 J.Pٍ${x9( #o-O7-pCcy6"UU8 CamnHxyz nȓAVC@XH8Th2dGD [bسsБC8 'Ww iV }&:8 R[#Xƃ[Ko=MEai(Dq G`;?,D]j[} Yg殃юx|y+S-C06HSBΐ#E@ CCLmЃkWQ|6-5ml9(7 ~3CUTCGc6 .0p;{O7xRf"bO<UW
8\MTJXWد͋G^i,N|%kZK#4
0@PRtrI V-M%Jf 9'st3^/FCCzxzg < ,<:
C`DX8Gd, \6Ju<=DShqT~Ԇ-0'r
l )j>uO㰠Pz} Nl
C}vj'`HpѸ|.e4 KҠ:(yN]twMXBk=!ۇݲ-ز
a[Z:~6z;qs_"ؐhl1v8v # vێCGS; c +lj}Pc8[⤟+Ν=P,mcBk2 HՎ^i:أ
cp, LVvBV#
94h'
if
ϮV a~Ԫ<hGmT#*:JfƼ oO/Xѣؽ{7v7me ~uo+MU5غ/$` ?z !Ǿ0<a{,
r)Տ 3%x8x6[hD+uJm<N㓫x<QKnļ_y >2{k I
137y U, , +?:,-+ _jU88B^Q?JxwT[ 59X4)S+ٳq8J ċx&']PWK ]k#(+83X^D\d<q:1 㳳]i gƒfRO2_ȧ ; ]ɱ8vd7~'>{y y^>z&+sz~@DA! G`/" 7"6"yĐ,B
`D v쀳, *5Е +ƅ s7aݻ 갦pFHLtu $NS?TVH/-aL<yXcM\ŝckA?Fs/Ç {صm vMmu桵7 ywg|W7
w>GNN JJc<@oad }Cu!<|@ [KV0;)Oq { =XCP0@-xM= N-` ?~JX;~HG T hw'&lh( #(d #+ ľ}x0bǮ=q+a0=2}=EţػgLpDuU%~
IHWG **8 03҇ ^O[ø>ߋ6Tơ·9B qo_zL՟Cg^J h$doabx{1Ey2
sb0((.@W0HދƖ.T75#:£\p!) %p@ v64
ǡ߫p\ `Ac.Jif=\`bg [
w8A@H Ғ PDOBe-rgp1>Eix;xr{>ksF%-xm'L<Wb 7+Ȣo)y
n&?3< QSP'8a|ew4r)> ֎vprw , axs1 $;WW$&%1183f`jKN'`K "F!D83#^Af:H7h"#4ι\s5t0Va`lsh.8,/' W:EU&C9&nepT0TdpB_>~IfH>lBCe
N]$4 =tHSV =)D15&PMC+w]Ō9BZB?#
n1~ o;c>5#Y1c}hȪh@Gbdk
Q~D:("Gp6Y^AP'wmmc+|7cݺu^c+؉ :죝۶w7^g j2`gMه) U(4&&8&{&t S_|#m<ݏ<1sm@\33"W'5>ٍɖTEr3B\t欅@|2((KQ3}{
Q1e bb~m M ظ4~Lj / k ͑9:4J47TZ&p
tJv
ͷ7E mQz/jo۫xzk=/.lL 0z[096~'$1;9z
#A^~}Vpse2Sed6YXVHOh ŏtLlmob
=##Y@АBez+s\pwK+\lj8pWWIre(yݛ m-Иx Scp aA:P_- PPBeiʹP x.mWCLSA
ô0s swrezzP 3Ԉ{~{!+G!'PG1cd$''f:h+;{iv?dV '4|1 e+H:Jptq{HSHݸɹ
XaHM?$]rrW*إK~9ގ&L7PTFfY N2sq9Ju 2\hLӽϞ"&EY&#-ޅدd0kvl!~oؾMl۲o[c|n MqpN)ܨ(lG{|* ́]25a =p?4 fO??Ҏ7瑟~C핸ڴpt pؕTCR+Be |*.b
%9 ͼ;C{e35^46 ^ޮ$, "M]qDCj8,{b
M-' }cL,(
:7Y
`Z8!6uRExpmiO.HKJCWG3Ɔ_R*H83fiWWϟƠ{woނŖbV
+cAl, 7ibňrr5
ec=sK蛙nbfc #hj Eύ5κ9#?I{Sh(]KfzPW@!Lv<͌aI}yJ6k@BPtt
vm4WKE!/
E{s9yg' + ,.H?t,}~惐%en QGBQq r`f
HH@b9ֵjiÎmi{v2fEpKw+il"1@[#<M.cXƉ:qu&7;b+;qoZ}F>jlg9n3'*i ~Xt."Ngs9䁅VY7_FdJ.c~\Q~MEԦKöy˛[xX<
bnxu>kh M =]Mm,tE-̼۠J_!wTIAf?R7 C=U/˜|]'.O&SxH؟kNR˳ |xWQ48m`|d 0?քt[R&^HAGkT`y{Pþnho܉`i) Ax1Uic2刾|Lգ&QW`fμG7E!#+A}}="#J3 ꆪd|_}4_z OcnUEpIrU*:{13;_⧸ɼ4J
PP ^4Upq
j [{W/[h*aae^PۃA Q`jĄzA<Lʹhv-agi+c+N)99:ILPPGG8C-} jP>S~*12@u}9#iq !zp:* }?GrEZD,pIp'g 4!9z-6 =mXۜ. 's3X[E+50u /c!L^GA_ME
24a
S d 1o]n Ŏ7vb};%{ MU W Nh #`bN= gxadVb˳k'G ]G}_ۄ@2 raد ]ء+3-<6|8l~6 [<w$ CFI%"Q (Ɉ ^4E{{("vN18{7܍7ֶM5e ?]vSkTQMJJҀdB]E *$YT{+(14TM
5 //ǣi3f#> b W/d9nb>
i(ϊCYZМ[Lto-Js|Vމvt
wtm/*FNI Ex'
]&% )~344D2]aHlfk~pD> QgP][sQ
EYqv'/ ε%&nK( `msg0шn,MP
a
4S-"ϟGad/!
ZHř'1ۄ ei(w Ҁ3, `hs[k֔fB9Bt Op& RO::F<UӺz D:NKC 4$݆d9
_''D{#! v|1
7CZj36> FeEzGfPQJn 9%;| !CS<J2}i&qmy)oVZNQU☼0k?18dd|B prԤ@S,
F44We(Cs]EЌoav1 x{[XC< * շ~5S=FAj*
^ _M$ {kC}\)i_S9醉Zf;0RP?.d <Mw`7 <{voJB<|? s;۶7IU
@ vm} Z8-LʊJ oB7h
vq *{;; O?=&N \m ,,>ܘiEW]&
E)JS^H/^^TT3: Ax!4^iB M:PTUL@MGg`l ;2n#8,4ц8rd?|<,Zqb
`ae
'7w9;!̹zÍ 33}g'7~^>U;ҔĹ.dd 8vpoj*09+BlT0G+c\]'E
c ڱXGox*? g=akO;xzɂ|fjϤjM`K[[Xk45З=gLo<7a5opprd"|dἱBi&"s_*\'w,Vz{n o'DCKJl'}eDz_/J#=)Kmxk ؽo;T`. &TC@8?3+MXXTi`-8&w 6fuCbmرW
4(wWa ϋ.NX^'-)hU#"al"gn>j<ygط
#Arzأlv:1?ڈCӟZȪ0^ +B1؇#M58iDuq6<s]: E[}6Ltxܻp ߷w4p Fa ۱| ;NAh< x>myFZd
xc olycxbTVع50 ʐ_ #mu#_ /a"2\s.BW&QJ37eRI^ P $"/G[{ ZZ[78qF{`eHNKC@)fUĝo׃5"A%8uCs~S >az45PS܉" apv DEE͂ N ^<k|[4 }p+XBiV. ͜isZio$fGTU^rB+K#,/M⤏35Lh`' I3^Wg{kxya|L*jg
//;xv;,aA,ajeB[Iݺqy29X3C1k s| 5h1+C h("T+/n**8#>> p7Gt7.Fu@mq'ߋ4bum} kkW1~pQ?|톬Ȩ ~f 5` #kUoe:A=]E}
K3
* a+ |`eC[U_2
'~'P$:3E@6
sU5c,cJs_9,?yGT an[S=\<H rk+qc_A Ct?}Me*:FZ.Bd`?i={w`7ewoJ ݱ
ZNCb|
2M z$oyc+ut-[߄ 9YoPğQj4\!6?GϿƯ~ >~y *LE
0Tb<^vtfamb>RbN81 xwL7BýqmJ;{QW"9##*
쨷Ui:!t qh>>7?ڂ"c|- ]ӧ*
ڻ9NGvi<_~s˳}ⳇ6 ̕9 aQc=W02ԃA tA=a`| Kq̔16Ն` \_goĻVޣ5L3DB.Vu=u a`}K$ggJW+az(|/X!y' c P w ?OeeЃ)zkl g L8dby?ΌPOT )X]N8XASE C)f c?F pp "tTՂ v<f7{7E@v<&&vgB\ cb ~ ]%[1 ߇0'$eFkg
f0%լE^Ak}.ĹKojU"
H,F\JTxo]ïzB
QzBOWe}g0/g4V no Z j
w+]%@ -Y9w4v
:DuHz\*ؾGQ9D(ST P`@Vd$'"{1
B9>w ܜxLbƁX3v<ϿocnDnj<?\I摾nq< Snd2vuC\T$re 1Xn<P|7WgKݿ}3 Auc rWk{+YF^0"iCC_ǎ ЦIR< Lv(œt݉d古q:&Պt$]A|;L7Tsx6Wl Fg!ⳕ¸
m]k4E př($?M
B4NZQGIq
͢3]ͤW֥{:"y5]i (lx,s2 CЉBsH WaQ`,D 9ED ŀ#v? d8s`眘-TQ; .tA5 1\> SR
H}T7Y\.-C{p&Cs{ >!c*rPP#A 4ؐX" }=8.m-EhﾎVP9
G(@AqehiSx]ҀSS[D-S#3#/En~.ʫkڎ\G =S\C,GD,BIa1;1#0tO)
acO@ ں
-%p! $
[cR; srT]4Mm< &iv;s60c & m[h غ~?}
2h4vIu4 o ! ;u_r6>2"GyU
J /% ?:~!08WsmX*RǡwB AOC5JS.R V\(]IS~NIJ00Tq( C j{ FZ48v~8&F{C
a=㰴4hp=Nx#ELO;t/LiK~cq~ '2Y^Z c5CY^&9͵1ܾY"6*ܒ }Qyq<Zrk@x'OceZ,CW'w܉ pKsR*"ڙ
4<Fb=.y䮄:@}gg7|ؿaL䂐#GKA? oɳ*% <, khށ ?18hPo #(lقLC8c
Nu#$ 4Vx퇯aώ]8x` 9]m'BohU5ƞ!b_\Pŭ,TU<CCcבVLO> =U谯yn . cFʰBd
D )q..F(=%e4mR: ?~(V106bqoAqq +05Pk4_ }77bRzBon OBW(,˃
0>Km 5۹M
#61h N4 ᎭJqKk+ͿC 11Kx-Wb
vSd3۶8rp/T8s_
/Q@f>0R;
")yu[ Gok#|:~ ]Fuy6~է6]iFbJ2<`hb$
dV}m
IV4;$50}]W/{imkOLf8oX\N\0o!=5+ }O;/ c~f } WO
`w W֖
vס %9h*E_{{kh,>D8H~mu>9I羾<>ߋ߹ 7q} 쨍@?Gx|SOY8Pj.3eSvt@Jj
~c|>c*!y=F T(맩B0A[KjE j]0ۍ@o9# J;(*G`%q~Nho G yan~vvx[w~ {2d1*$c2į:qez-c9[ 64BE} hT堥`Sk1((KS*^c< r\- x18ط*Rp\ <=ș(E[{nDLT?~ ?|Csh FkP]TR0_hϐWR {_ƛnߊY#m Wi?Im f
udw8 Ml?q~'߷o
{6[_ǞqFEruTmY|T^ >{; deeV0 9Uv>g1o?|fd"6fserЅN(Hb sӑ{>7;1ؚ(*| 65!%1..~skkAQ]JԮg"3_]m} [:{ ʌ rz.А(l ?ddg(jd'an
|~>yy O?}q5~ *zkD7 2ztu41(*N=c6
J`hMj۞jAO0ӗރ8( 8 (Edc +i'CDYvOs(@(6"?UxL*Jf%]% 5}p#nPv~pD8= | YV
w'1یade`qn.4[~:;Q ٿTNҰbOIE熆yY b2 BU ?8&D+R 2҆tsJ=M~wO[УinӞ'p1)Oᤷ7RQ_ق1ܿod& -U|
"4J)lc)Vh c)` Qw9Yw n
ܼ h$){ci݊q졡3 D3QH % KsC5b.1w\+-U
bXwO/k&+s.NPT`jHNßK );=M#Xs$6ChB_&fRe5u- Ep@0{5!1 :ʤ
74'O c`lU050
Kݝ? |
|0# 88@rF&A(@WMKQ\pQ2׆|ԊVIIgo٨BkKcmy
qss|[ǍY|k3C4lN@
W07܁7~Y$ FJ5t(lPZs$/k6fCXFvI҅q&H%
գ 5!!$PxyD^ z_P:8&@>A Dq<psL((H
D-$EO]
a4u
HLvFn^hsi5 K* _b KFU_K^WN2byޑAG[&&U
͑6̡LT |9P h驱oaZY) 9͞I.ƈNpuDžgPQQ.Ӑr
:T5H{ ԕcSŸ3ߍψt܉L& :Xga1Y9^K2=|jM@q&"<NNGx~9ر}d vv4o`/M~Z)^
y;HM!Lb BcR} ?
_Ͽ/~ .
rrj ٷf4JLƖPWSǑCAtp"<\h(p n`z }7?alCB!#r?qR,|}=R@8 jPc
);o.L7ʋ`f! oajow~#22DRNs[v%+257 b
R8Z5B ̎7h}u4S<G"#P]m4
0cӖp+.DQ`)av]Y'jiN"^.0S8G@P ~8#̠?IDc2ac+?yE
c'ii4#h )*B
8Es}TA2 ǠyZ ζq Iv .w D" Ԝ3)<$l}5l{u5)+ nXzJ^[?Tī!
E.B[_6y((2tt )!4Z=
8-: Čpl-͡Kj``b.UM#g0U]?Ƿ[,]~(B _[[ cç1և:^0=! jy|ؾ}t5q
X)x5DЄqaiĭĬmR^xf&f:@h 0y4 )xA>3k0&!??K%;wPrPkXiBGY^¾'GID :hģ o)0$F=!!1я>B|<y~ ."Vv&^"1($.D{bWgQR c}u
nX^v9r45U\@/S/(? /o?g
~ߺϿFG_90:\L]h-Aaqr? ~I^RtLTB_N[#C<p3͏ux)f¤ͱnsSM<QkBZ owQT?G "BC }غ4ԡJ |arWѐc2W80y ,s7{EEh :H} UQ ZJr WNFDJYdtE3O^*۷nQUcPT;96SQ| pP
iVT]OUz%x{8I"-yɈFFU j }E Km0V<OJiIQp~27.R?طد(*b
GIy%rbTWQǑŮ[ ܉[\cn\^Aāٜ'hѦbܣa0"`Z@AZ'=v;`#w`.=Ky?*2>x J3 ,SWv@cGE>5"мY bFo@SU6SϟG?ӟ~_'䣗(˥A."X[]*iIb 9
OGNLz+/cs}1/01>ζv㸪)K-B<OI!6 vf0'RF<\h nNHMaI-!
=VZ& ;<ԃԔdի_kKn3; uf^ F;`fcm5np_3nm K3()Lh'+r0<ځ|kQ EH .&D(gקObmipv2VP2
beiSu
&6D8 ϓGMx iQ9?a$TWQC8c ^2NSa? S vɣ&]
vq!++>'kُ(]AjEj rc S?e^4U)cGBN0탑 g2yl1zb_c/L̕iMg=/ (?M`c@L샼 -
,`j`w{ZzIvs
\L1`mD
;} 2bfpۚj! u b[X\)z6ii[ 8煋сL00Fhhh\U g<jxi}7H D3dIQYij8DؾF@,Qu
,; H {d
Le
2r ?
ۿ|FA&F: L88mq݃
&v;wX:E ʙIhki@dXƹ4U\C[*4
'tilii(f@P10<E"S[蜂7E bB}]b^oAfli K__75ϛBh_d]nOcE뢸l@t|g @zkH7x|+] 8;3| -
%X l)AMe\nzx-y
,y} 3=HOtG/1hhP=qNmLYjJӵ)ʼt$=`hCdhd#u2pw> /
řGp ,kLUT 5Ѕ
ܜB`O
5( acuÓ,ffffffffdK,e1ǎ vMڤ)N;3:WY}1^[p}vNZwNv laT/5jowtB4`ba6V%PXI-jK`2۞@/aceGkgM0Iru5`o[<,zgOIiX?RgAD @ݿ/oK"ɂ6M s R~.W.>`z_|\,tu[
Ɔpxn;͗<W . =,3 o[:0G33%bhi#6S;ʝeKdTB\(_+J(PB*Ss '(2_`>ɉL45ך'/O |o?kMM`a(ʊ(+/=4jJvGqtNr2IkEbko2
W`m ڞf
Ңu ) 's-,WT[JzRVdűsGg6;=|=
̉},_: Z*I{ӧSYOV8Mtn9x_1gNl ݽw<xčǹw Gnf nb tiX{1棫<u_m]WH}:ljSK=ż(~Ÿ[X%fM FNb,bM܅D)%D(SZK(@-*f+YW`(Lxo2<DgZ4_ ,^ Rx8lgΚV3R,Hr1".R<Њ$ "#N Y9 o'u\s}{1 s^(Xb:Y $.RexLl?4I`a(z FX^*_ O/3Ք;! 7'
H!JAL ) ;WfhE c
gx7xx(3^}>|!bc"8q{'@uʢx܄wM2o\ %+x
~55ĩGe1o,X \LX7w:(5PG/ZP T{ -Y ,[H?W{ 8_ ,457Oj`/_~ןgvo։
x8a' +籢b\\'#5J. :͛-m ;MnZ wo] fݝ: ZcRUKݏ0-H G1>u07XIrs҈Nc {|]\$\8 s09'3 pKx)Μǐkד_UϚl?y
,} ($1>Οɹ[9K\\ŻWq(wVóNp_DaMk
t!φ g7Y <Q>xr}{0;
ul!m*M%Dc+Jg
MdB& 輅hw.
%@ VDkŰ/-`rrg1{`)pߦ
E&&)3 \qak}b="N8)TK8IzR0anT9O_O
pWf2@C<u)s%Ζ@8N#S[]LLu<m
&**P
cf)7sITL$F؈~hI10Z!^J y=}$8%>͈|~, 1V* b0)gرYp-~y)1صGyIwym>)Lȋ߿/\dG'7 8wM6 'f6)V+Xˡ{hoZb)Ļ-ߦ ,_8`Jye<2_r%,1ڊE:_?~ 7P ]8A
pʒ` r
pr?Tj1. ;][m(ܱ- =8E~Aiq~1vvYX" SCcԹUze[F E/p`9e9#8O*Hu?(}z
VM p#Z䡝dF| ԋoP;m Onb3DmOp.)%tm9G6sI2܍ueZ. YIFG%'o# ڹ ]ŃG:i*O)26\.>D
ڂwey: ɈMjJ,fTg 'k_x2#cWi?W~|R'[{>%`z,M"BS2E0ؒ,a|$Hx,{g="rgOJJl%R'<zwhnΖ<R ſ>~hh s՞EfZ(mxPw1̟Dc#sU :دSpp+. :
ԛZ+6
'<4R?>z?ƐMlh C= H
.kמʯ>x#[|Y[֍[J[%P O_m<(+H%0_^9% b B%o/'/+Rb Bbu&?
CA%ʣ:`TR fK-gT)` :zZRCuS?|.Aמgy .9(<Jw{=5e4UURS^IIa5\]^n_>ûH ܻas [;3H1UIBt0#Z++^WkE"c@ٰFY7c}eąz@H+ardyBKҼXR>bLXAhZk<&iEvܷ\e(9^/ c<yo)4%sQ|x;yFzkoPPb &ʔs!&lLUS|4Ƕ0`_
tXZ#`b-X&&*+' ? y*
16v2\W ^m RkeAe+֦PLB|?`r|pJ/s3jnCpw"ˆ4b T >n|&B.$D JcS1.z2}tBcҠF_
Zz"hKݭZ,iZ|P%{xبK\TY+(H9'&"7Bge:zg
}B<)-+JBRl(&"`!/ =UiEz&3<ԋ!a8a;w. 7_ F!#|} ,.D2 <=p'3J^%؟/Vq}1 2w3[3=1JCM3zyf!o|e, Ν$hkk2wl
ʣ:@.PvFPv\`^Iel8O?~{8"w 릫ֺjjyOյʒ
?~{vIs+ &oƣqQތ? LYr2zFKc *A2]$#>6n
l Wb-ny: gqİ9!ng%5O T{cHvİ*
̝I1!%PN>!O{c<cb ݹB}Y.4GGO\\K' vfpZ)!@okBB@a$kl'x6eu9&m kD, u)b
)00$K>Q`hBUz$iXN`_WC&/Jjl' HV$Z H/" 1[cO۟Q-R_[P 1Ċ5VZK
?%Fy= 1%Q^G ]ʤ,B142I]a.a=Xww /oGԙ^r 㢅È
&&> O|"7W?fR}%u<7ܸ|\_8wXjHY^$op+<q6M}m&/͟ W3V֩{W$/ZJCks&K`V.fy
f @KCKW֗wW ./O)|lV9 /}em??[.<8ux7[7nu'm6TS'\_;x?e q ;8g3W sb ҜlqrsdhMU?t0 -&
J:6=ӂ*77qjS6ݭ pu%˗`yX1߇0
o+uLr3oxzixyKhQƳ&:Dw%9_ &"'D%'<>ā<}Y~MH
b_Gλݗn}墺#Fpj`_6$ML)&*دi]L}4=7TCq\$-ѠČ #CR55H\d3?#肟UZxGܱ><T:;/|Ws3R?>+m-Z(Yho}.rǟ>W>/_S]^fGSD՛V˔RF{o6&(;)Om|m}cS%HDHxחJh^h=z^|7 lEgdNJ
#.!Oѡ5L-f@&:N]+%w?|gabc@Iq qCpd?g ~ɫ^]GQN$>fj0V-8~f̜:;k* mرe5y)fzZ YḤ .Tg +ʲeQY.[s˕g Y쌖
}c#4txF^g|>]rvۦ6 Qg64UQZUFjn.c[ 5 \ط
?8-|x@f<~pH'u J| ۩*DKs2
h+Qt6?Ʋ(?]d7䧰mS'0.>Ԝ@{"<$.ؗS1$^_;eT &+*H&؏#< Xfo\#Zf%.ޏP ԕ&'`O/MpՂ(6o^O)NNV.rz'o='] 3p#-) gѦ@ W
f4$-˙ʚ
MN$2v=NKV<o ňNL%XE\YhJ>YSJtsdmsl&5w`| -I n._g
Gĺg$<<L2UF_/?}L]uϕc+n3DCsrey% Bc6v8ɵ44\6H45OGjJ&AFF۫ϣO/'y1pt6WNTRSWFJJ >DG4{o y`2d B}_C<Nnѥ`s/m<wk_S{x|hYgPOeFi:l%+_tcْ%xbB1 ,RX*'_ 4@ !
,PB@o- Ɔٲ?sWxr<
)39'a[emOl縘pQ_:JYE2a 6!EHhdAD u30&{ l-/N6.nd}lZ]Lou,錭fT'HO}A<eٱTf dT%DCGk=}ݍfqpx!Q%VbߎWvXUAbl+d9)&$( ZJhm,IֹQl\ÓoӔ{ e돟uly7Xp;RJ}5q4@Ws:LG@vW(BJPWR-
l/ . zqr(yʠ: Jr7QBQ,H$+חjO[E>sO{AbwJ@7#\]C ::Ip"X@"6 z_p_{L "f&jȷsd!D;@b|eF ..vDAlD؉A
}h!71P6Kq @@ 'kSBvA 4W+J~{&aTjo6АNke"]9&*`vCϹu ;@o1uW[Bs'fĥPIQra[cd̛3EHL|1gT}Gs fb3bdƌ7O d(,Q?Q鈬 r̕]r)~KRV-(ݽ|w_[/;/E~|{|:SRÛֲq| 6L[m: G߷['pr/%H}PۙrU- IN!!.1憜?q=6b*Qg z
xpe7wLr`/{6Vrdgh6QBƺ*Dp׳sC/%
u6RSI[M鮢8'D[ ē*:Q)<;m$,qj(`@l<;J5 E֑̋w/n_f4U釞<Ow 58 üEN "?5Eą8b-o3Z9K =.rDt'NUQ-rLV dAȑO?
Ѣ~搬m@Uz_HTk̛ s9GjTGj|.^ 3!~zZQSQx R]-zPſ,Z(&BSXCx
'KK3lm,sS|س|}Bp):LYXFK1[
>^.% nEYBCed,7bOY>6 `Ժ$-C<߾ ?þJ{$u t)ɏ0+y\#Ԙsg3O 2xΜ*eEFZ40_ᇧEsg8gR&?̚1C -fl, r(SI0SJ j21k@5;%(ן ~7/ $a_.<66*!b qx9==U샷)B!܈$1{hc* {wLɵ[RZsxAk88Q -h6"uWrt ${ `{\|jsxJxa:uPUR"mѕԬǯp FIΗ#FZ9w\ #79\േ7k|* oajt
:sq|t
|YN "_B|`K$@._:+ mVOl|l *1 Geד66mxf!0X8 n**2 r$
b%.[AYdh.?#'s 1֜۾3gHH$640gb왮[uSM
]^8eIuq`^{p/{NXSΒQ؛ahdE@@xU}Cx&WfZc+XONJl\:{HO% !Rre/o/; E k`b|aaxx!8ll/<b(dv
{F*J,P~uax$aiۡ1V)twm\K꽗,'+-Dђu0imO/'!x~½̀YO?%8ޮvw̙O_ysJ>XJJ_8X8e|el i{}X.o,>Idrr k>}~N WrEF:ݰQe`| ofxp &8k+o \xw?Ұ/v.lqQ$FxbmåsGrt5hޥ=:;ɩ \˾mM Xhn=ՌWpz['{$-&Xt\* aLt?҂8}"%DUexŠo-5SGx ykl"h#kNǺ61h`[ e`}9=9DL?UEDRo&[ 2&)ü/^?ɻqf1YLlKV\1#s- -e3$?ְ}r .{xJbV$YYρea9$Lg<|,'p#P5QA*܈Ex/1Oꇧ=xxSU/=/u?=u%#ew"_f=Z5ޡɬX Ss]uIQrZڱ qXYيF}GB l<sh NG`_tUކ
Nx ݄O /σFXK_[ 1a yv4eۆyAY =G7.ՇOx,&|Qvom<wu/UByY%,[ A)*@N!FF -%0́:vHKFZ?s|yJ!!>F
KNTT8!tKww1N^ʜ]3sS#u"| M~ͧ|C~GǯW%lSHT/^ R4ns8HtG4گ6HLJ'(MDnWW1BA;X9
v5Z)33ZؓPs2[ٯLo(&l_Z鮐hOX2ČSFGu1ֶ,2'4 r\%F
^CS< "
qMn5o=9xFKȔUUP\b|bD?}-<{ .W^W/brWm|X.$džAH;p|&^~IH;Z@w3LGrƜ8ZdX4vgm⥸-Y6+ + *G ґ &=W |/uRIgK |wu@EgY6fDj,Ljj'~ S__ ⣗ݛr0`MF|CKl] ˕Cr%dJHh)QS_OIUtюB& $?",@Α2aNP?g$H$'Kqy5%y*z'&$x~E)Qn&Z.!W֦
غ~-6/$__;9vpXm2 ÛOΒEjl
4 .}|D .j%x5WHۺ f@7-
tw41ֶzzfUePZZD^\+1)rd$0ÂAr0X!CĬ +iͯןK DbBpsJ̎ VzmI"#ȅu442*A]v%!wM<$d˵0P&\1rVHHc;] Gu/GvwrZZS.'!Y8 5 1̦&R#K<+x
9r{(L 3$ÙDKm9RsY8&І}H^s8^IR+x\ǖt+5ɩ=bPRxA0Ex\@ٰO]`oM2%ܾtw^|7W8wdTlo͐~H01Пc1>
GYC?`Xs,l%,xYpM-R)fdZm)@ &|,<AD[{B^h$T=̛ R{ѤpGGFjj45XPW(ŝPow| Ĥ>go1[B\ܜCE%dވY_T( O```=tD` W JwygV"H!_9<G=6-#."@ѓPRsI)i W7y~,S '0bW>KVy t7WccfDWS5kۛ12
<<kl]'ͷ߾×_%?Ʊl niz^dbigsu%b-LsGIR^X]ĞmĈfx?'xH0`"ꫫՁ $&HzOJ$1Fl yƺkdɼyi fcu7?
}ߋ}db|puc":acj.fd$X_;m^7|qW
p1R hW_{2j.ۧW讌!_H7gYFm\pWZkm)؞a6AMu|Z^VuGaf<eyEHk-0H],}یAV
SIZW ^.~Tm|R>ޭj(IgxC]_O qQ~8X}z={%pj/[.]zM * k}Ggh$)9G`l%;8Ռ قE BM]⍕ӌI4͖2kiimK\xk+1T߀bMonaQ=m EC OTeIN`Ukv1.:vo>yxWž9} i -F[2Au|t c~ij]ܸ89} N9O.؈6y ӁPHΣR<&Vt?(:,u=L_xƚr:ټ~=q_qh nW_'߽{G9up=l)>~rXDp1&6"E b.^79!`?y-}3Cm,`ߎM.kikkOC'] tR^VJMU5e%TU
EKb~\asʌeڂO8_}-7_+/
$ f>G-,1p%/@Fğ*>Igʅ+Y%|p2L5T/s Gw&miAڛ3hJ!>Et&"l bӺ6)L4=du` j)/Ή%+%\]RECMEk WJ/IW*q״
8E'OrR yLo17vs~8- _y'w./W?FkcV~ 6`TΕCYp8|ԥV!ɴ05C'9-{`-5 9p^Nd
V3MRz*؏\gkMA%ĊokjaX]}kkcdgTo,S~vXz
S}\A~ m
wxC|+Z:5}o.؏\g!&<~x|4u';70
tU>:8hb1/Oy]00T0 3Ri)ǭow'ܔh|I)}~ ,(K #o$[ZVJr93p|z^r߿k8"k77DqxGxp76#UG߽tuT{ G/ = J2i(eN :n`D'6fBBdlMU7]
hgZ cڨl7nwfu Au*`sC WtGooJ ;[2\(qs.,]U% 8uɡNz;*0IPtb? mue4ooAVF G ΈX*b"ZUN1}d' ,E#ف?$`#K]R@o{-$FbEd K9A: r zZzuD{J06tIIΆv ߹g?w^w_÷^@=[!pd1^w=!!
lALL5F:8JRj(kt,lL%SY^v% ֑ +[l s$XA\@尵S G{| uv$ɞ`{bDCi(8+UHVY,u/&""L̷ FIusu&>0H )GHo1
|-{'yf3
I+{:'FCsK+1D狍+>^b"wq" l`=m@ @ V-mmqtަz[ဓXkk ǁB Ak 9x .KxR_$u玧!NRVCcy>7 plZ _$ `dO>z>x ~) }CGI>~l Wl:+$Pq / ԮIL GSq<k;J-rfݛٽ}ɵ عymS ڳUp=8{ 5 o繇Wxۼsm \?PM_;? ߓw"ReX[JEahouzkM >|eͥrW\§"}WsFXP#Z̓7V89ǟ;$F9Jj%R\]R^BM}bȈ" -1c"b&3p6CYVc'8KxT"q @:fdnfifYܽ4vLǀFM^
[o쟢)/K6κBt?gaQn BCy<q7 ́ ^/|FEi̕^%ZyJk)KW,T+M%s}m$FN Ă] pw[=$iPPL ﺈsS ߝ] >=d GbP4D퇟-b^}H $I~.JPϿ}\.7sBWw.::pa˲E Y4uP7^^,|
ւIKpiΟ=vj%';% hsPjXyr5RkllѪRBCފޙ%˔ b40^Lo,炋+I 6qp| 8_H#c#=|,zzC;Gľ>z Yl\>*$`
I]eq
BMn"%$57Z,yqd6鍂Qodz|=73ݥ> v] _8g& Gy[<vcT_> =?9~|{_{7 V uGkB\lO^WDqHTG5maXt Uꍏ;wUI[5.ɑ6V,_3O>N`O_=Gpy4D2]Sh%)ĕ1Z؋AØ+PwH6j19Ʉ%*0 ;X>͒f
J}A7ce`H rl jO ?K Ηs{[B7^ ~J%l۲M\SG6Kxazp6qx鱪+wD
@Cs (tt4Ņ*{ч" ,A,_KK%[ka
Mq3b"ߗng>372JrII"6((Dܼ0S(&@7< *!4>K}»O.qOBCg.zo"eE}C<lg#w_6|{ d1% XRjH}N #`N
T[Z%WIm8 #a 1{*0" j i*-ؖM'vJ0$u>5~,u]ieۦ!S$Z_LCe`eG7s 4*2éΉ*5 {<}[;vL1iq&7 7m6Ą~v[x-n Os;7_p۷{{n9O]C >ZK15ҥ$3-u]uBɺz{_+7mBjAL1Żod f~Z!jw?ǴvJ`\7n qt7V_?ArmtL6$Ǔ(L$+ʸj*+rw
a ԀY!elD'c]XaVfV4Ug}c Y A&eMv)ؿoODLJ*y&}~ml)~osGyKpK6<}R'y)Izͮ~|Z˙p.GZ~Ya!->$BԳ aZ+3L43 "B_=/c Jc 1'v:ỷ"!*Hԟ |]%,B<u2cO3Q)+IO|G 葵\̛64_r>[1W
|`_0y me8
r&)3>wӗNnM-p"t4401a ?vH |
P8
9Gg;llfLxl,f6j /σtlP;p:
l ldD'nGX_˶A{9!W7yl q?ǯ=xwzs^ ̡
LvUUE_E,Cu Wʚ,4gQ Nca,E91ǐBHuQkc=r_D7:OW{Jr!+Τ*$kf^o;x5Ν!=u\;}o>{K]?_q .pphKNKQ?uQ,qy'pw(@v[1mu崈63%bRu1r \Y`1gv^KvA]"- 4#H>ܤ W tQ`_VwKlbX'Xt1naVU @`w8Y ([W(#A*_C *| u5rpZy[x|7_yor_!~}]ٻmpWrhup@S{+uH(k˵WBvj<a%$!KpO<*3?|< Qo**&a<;ml>mR4$
2:fJʉU dņ`ro7
2E
ȋO2 1&4ek0k ]D1_J㹰pOɋC1NĘD{y-:`1%njxb=r}mpw3'*EB=~RZZXXJSK&^nB&fظ ~<ymcCعW.OoSQnoo|{oޓ_̙|cTaOq$~q6&?Xwӂ*cDp?֖hG6E)e*<#PH|ŢyRaZ4 V̟Kt$`GX0siRQ DxbFWOoMk =+!d@L "V~W_ Tko! 2aq^ ՝gxCܕ5V;+ݷpu`ʊ%U3=Ų0g#m#jyQZ *pPPTnɶoZ. HAR "fM33͎C7[V;[i"Y*yAFxbt):n^\ FĔ&ES [-HK1OVG34 ~?zU 7^J[֒E>7;ǣ+xIXV&BS JWcjm@ZN"+5@iT | ";K7QQL. "F ĘP@Mtfy$/^=E1&vpa6IPk @t42$la55yD]@l5iRc.֤y*GjRORrԘr4$H8Yjl`_LR zx]Fc].6r L(ͪ:;F(0mPh1QA7BXDXjŕZ[Jm1Uaf1ͣK.bIu1Zs$'WzODA16ً?|7/oWN0]A^+rn*Em-d%I \y nf @\/-OVR<IMDt\=ثw%#X2woq'L-!-ٰ<x9y/_s6@8ދko VY`osV (y~ m}E݄kR~V-fFr}|3ve+! A>57&/5
&$ć(b?., 0?"%I(fjRK+`~(:mhʂCl@Wy݃S`eE9 1QCEQP&4\Z}h*H 1//xG<~|^W,[ĕ ;yS<7e`[*J_"#f̞URVdo[,3Cp>9rMޖj - &!JD [\# IF\1^Y[EGy>{G?9 IDATKy|[31|Iu.l=jβ,ˋf3NM?=/t =fTJ{'IX,^\W v+wgR_ղ6ёn
nJ:ʁ=S)} Ć
WI--XxE*M,mppDPt+8bUn^1_^2{v o9Woߡ27N>z
~rxw_pO g_/_?ѽKןp16ylɎv\mN4r(ark) '-? KD#,O\K76RYgQXKZzqᤤbEi^
%lh<y<y"cin̈́ߊW???ͷ^$66XxwWV к'yｗqt֜>-]/NK+]gFp}S7+W,PC!ΞZxjG1| 3aϦ 2 )̈x|m
<%5'5d2C?Gk(O<ORiF!̵LE;g[X"ގ_$&HmNR4.9'W<f_W G|KyM=-==qٽE^u ^fZrhG3FF[`*[LECss%#;K¶:&9!F K 4_ U{aJ:3-G8Н( I]JRg(/*>9̵c2#[C=k m/Yg#j-3%)ՋD~ ADD{G}Cpy"ym$xډו' fLmG)%6Wl,^JwIFٵcB^vGy Dx,X9Yl1O?=C)x+=~_ 2=5Ł]ټaѵ]j 5peU[x|K||<<\Õ}gy;Mޓg 5"=Z|h2E|-(d)P''Km-qrd9Xv*V&F
*S:餎*k%TUd_OKa8N>0
11walh儗Ǽ!"B;8K0 TAtTp]>{縘@p@^!mŴ1""pPLs03al\/J4| Ϫ
$ x⣌&zL #6TՖ O1~$K8:h_})9&e~x |[c ;XDtS[HΚ2Z
(!-21dJ"3fs OSܻv}[x$/8ƣK;h͠8Fij#fv)zr=`;yFWTdx/{i*"OjJsi-N_H{uyKÏ\ >D{aC^dzK 3*50i/8tVF*?0<,$2[LD.P)ӵ=u%8@@}"#2""H6(Z
I'=]^ >|<x >\e)bGWo#
e+S'86؞@ !4] ޜs@kg! ||b~MLeFz6Uκ5C7WB{A
_ۯo`sMW07o
wu Ӈ
$0R,cjv UeP" Ի."
ʕ Vh/_YpLOO&, i<+ܰ43+uECY_ /:~x,_txxc^x/>Ͼ]us\_ws$b<;7pGj# iSuI; f8H
bf%c
tJ5sƛ&A5OfUx$EVɄՑWPp/rq> 7zXmoOSE
&FiO9lYہV&giV,7b3E ͡^y=NVlYps)ʼnAԊin('7#Qϓ߽JO/ X-e>{|'wsi)K8s#
4P*ux +CttWPYQ.Eb;}4 uԗ^WJ:1iw60*_;M+=3 Pr"<*%DS1b#\XQIZP(EIQr^=5H/(
#SBD^ TV ;W3]3[/%n@
4BECՁ2[0EA~ )t 6=eh*,E^7$$h
5x:-w.pR]"1ܜMt"3/CعeSڻX7ڦFVҙɭJÝtN>z
uF?^5RGu{/]W^/rf^,2)d2_&rŬ)zfc˗hc3%=f t4tY4o!8߅acGz
EJP'_}V01\N\\E:Y;D/ سs ^.b 職_WzJ9miC`bjHOO}}1ͦW4eV ʠC;OKXc <81*1DfI_ MLJ!P$'$F(v2'ˑ \n _Qd?W5X
sp fں:)(Ȓs9;X\BABph 5$AfR,wo]u3wn]ܺq'bjLt9ʛO.د53^Juo!ZwSC r2imr9Jid]o9ٌ5ձ|bhM0@b t?3}<4#.Ћp 7[2H
X
ƍZ-mo4S}z8[mufK=%ezx([jCp A6$Yb|S85Pd|pY6y%a%@e`QޓԆ䈷3 Xx_B3 =\-n¥pAxy"bvvl ZA n#۷| ~E>{& v|*N^쑍eX $uJc^e)L.a ;l9sY[[+̙l ]]]Lqrs%AP]Hr`?3o/>1ݛ$
AovW_?eΖbx {KR6]ۻ7B8q& oڈ'7mߏ
BO꼻H4AR :ۺW| 3aWLtY',/^aM GP;Ep\ NxڹRU2 -2PWlz`""J*0mB3f +wbw%[*ފq&M{:
Ƿ +qdIN)פGTFqv2r.22y{[q,GOld杗/sxYڋD[)yMK}`dʮ %+SP|_&iJD <[@}aTd)3$!Di*JGO#'GR!Q'kj
l^JENh>6nFRې-ttfbhr R<3=c{DNQ4[v2W>K<!qCbb|pw7Km ]Lw6J<5n&G9"'V% kk(I|~A >DmYZwjL^>Rgez??I!!Z:zi젢rַ1SN.lcp' {x2o< ]i& k_>˱]߸JЭdQ
x 8=ٌ1ccbGSb%`jSyut4m451PT;pB)[-`E령jz;SBc 7YR@X /
[A^j,[.V
edgRGK%SE?[&r|//n3s-$$Ѵѕ[@L/ YC 3 yƣڙBڪR{+7&!6o A.dAsqyRNb݈<+Ek)k`QF Gn`5ax kcW4!3joHa?'8\JJrhUW.bbSWՙ]?ɱݓ%c }93Moy -uscj.vj @1^DJpVڪ )ɈZ̆&Ni]\ YP&=E$s"H~܌V([}-H(]m
Y(
(bdIӈ3+@_m1&S_"{'w \uZ ^إPJr|b$S <|B z=% jNr?'
a'@՜A) z '7~R X,!_Q
N*ʋk)gB|;STײq OsyrpK CSQ y"XdiTummEn$
)8MLt3Pt_Rӫuxzrl/֪e\H^& ff3X2gK-bLe'Yyf& Ƈ3Ak/KGST[;oyw߸P+Ubiؕi0)/]NծF i.j
l`m=[G9sj?|)?Om )ƘWۯ]<wXP 6+E4#%v.)jf1˫ŞED8VWihȶՌVchyϥb Lil #.3 ~JH^q z8e5uaWzK 0o>,șp2RzyEl
4yj 9p{5Yqahs286ړy(gˏ|IP~ _K7RGn?ƺ06X[(RNYdD-k ?Ʃ)!=.Rq^ڶ N0Hȷ&JBX|Bݬ7!ьhjU9
"-ă_O%&1=Ύ^^yxF"6Zo@rmd韛
~ p[l4^)r9`nXWZ&)kek\k1+O+\%8I%6ڛǷK
%,8Z"McL3aaD6 @t\QrU{ ]MkW-
bԊMZtK3Sx,-Oqnj"p`xr6ײ}}ejSʬ6fr&} RǫW% sð5Zy?+Y)l"5X aaάQp.sf<lѼ̛b85D' } %Xb;}&ک-",ȍB\y Ge;Kb21͕A _mcu,ٵem֯_.200/\q.EKC!bF-VH3#T=e u)ݯgNZvĽVʫ\ Cbo'ғ&bI
D{ 6YSg8u
vaWvs*ُu~yj0㏙'g21k?{fohH#;!Z`a^gⳏxt,N #!ʟۆE#N }${-l6&pNt_;;3`\5e욞NM铲q1F>ۆ!
)v'Ʉd{c7 u\>pK-r 1܋2%h'&8Q \O0G|} %@8%ޖ݅4EWcoY[X mWac#:іK~^|b[0#.4-7VBSn.{٨[y{ű#ӬPlvfHu'!ҕHwB'" "G)I&$bء H{{=
S"F;8LJ\]#Gy;p2 H;>( $Y+! j9nI1w1UCm[Jh/a@A zsXl>˗cժ,U^]=M/O#ٳ9s&f͔gsVWeG+#"}EcʈG6GepM-% RωRt4WuDžܼt[j)sW[h5IHwN
曏x
̌Urr3q<Ka
+/,=q-f[3z)wy5/:{ruXKVɕdbm+YKzBK swVV$%DzNl飴
RJap cXS<
|0 $?BAe]_ ^B;yYF۫Ȏ Tj>{wۯpYc^}E.\<řIux/\k7QOFs15ZJ,-śۑLdLp1a8RQQEdwsj.nG;?܍h73GyX(q6Rc>khBR?5yWJK ">̕ ; gT/:&6q2 8ʖ$gwTB\\ p^rc!vn'jϏ!.G:8/f% }ʬH7%xJ6UX{Ξ@|M-헐Hx`ݕo=? DJfR"'Đ OM] /σ K2<"d>: kEK 7oftusF1d.K𨄅FZl)85ͥTgslsbk'kݣL
T2SJkU" 4VWH0 m Muy3k\u eg9s ez#vO] h2oA;18PKaNEY䦅/![@?
rغa}7s^=k'} +$=[<Y=&w Ir-Jb,K&@!z<m_<X3<,1)TU s]
y,k]Ri(0#u\%ȴ7Չ V'Q?|&mbb[X?GYlOS }!BAQFwK#'
ƙ V+HQWSI?櫏|V.ŝ?[i/@⋝&VN8 tq 4&`C*'++CQL)/YaK%G SKG!D胟zǵ0ERflYFYy1dFokJ-e:=w^u&t'.^W=h
"3X3 9KwSW"8iˡjH` s1Bb>+P+Ę ` OLj"`)Dz°`@̋ >nB*D[ .3ܒp? ϓ`$%/ ?+ = g`t6&?V*SCj]PGgm֡6>~ RJSv>=?ͱm:>%;^1fz%D3oakKe3Y,_ 3B^~o̝5[3̟7!)a%h5N į>}
fEJAz,bHsR|%ڑ +<ux+/rN>w/7xwY8; ݯ+JX?F> fN̴ XuosspIȣlN#ʹOQ,ᭇ\of|@ 3n-紙]~nYMmQE,%jR\5@<s#'Rpu~\Z. ߍ
9N좳DQ#^Rl g/?o?מ'9ԃ;F$( ]v\?5$X*Bof 9 !F͙Դ8z25rHnyl|=y_JmUFxQEv'qb# \:Mc]ej S *ʋ $;gkSˁ
s=y45Ƈ* 5 =Ñg [`/{bC&yKQ:kcoG%9j~"'G
ګ
qSRHL
!9+) @bB 6n/l9>,4
'˜y Ō{ Ndt .n o"~˿`?,C w`D$ݵulgH17qlLwS3O
OĦVjb88Ϗzu %E$3^AQ grVn LO.gMK 5H>
Vh?-3<%^"93mUϖ0)$h,Y@b7qErV>U֯i&7=RΑTbɔbOP ni Ok<}<ϋϞU | _w^pCbb,{{KѠ1T6FTe ofA86iz36^<eSxƣy8SQ(<['>iXĪyO MTwzײc0[,ZaDO:c\|XGĐ`1j턗7 tr W+WN Og , _gݏ|w˂U_Pz<i'O/͛TO%9.S6DN22GBtۧ8cZEh-IZyiЗ &II3INYp<S.b9r=Z&!1[ŸiSzwu<?~ѡZO= $HKH&ա%R^OZ#~zxEqvP/>^2<\Wag`_77
|L
#ABRF$»ə vՓ_F|b)Al acoW;coEC"A6D{/A$(HSlNDDCp /<PxAWeI uLc4;qr
MEIDoc͕;SLPűkWD<r|>nW:qVO? Udo Ddepk3ll&˖/b<eu Nay(^@7{ 9)(ؗY<ox~o)a|+ ?07_:Tgdcgg-5聽
9iݿSQ߾~#^u7 ޯJ8?x@FN.(.) [1M5<gCX6Nvh;01} OfS)αTuY].9Fmq2ef(f:}Ä:fkv
pwwŒiLX."h= 3. o L-wr')$ Dw˸zh;:K:-Vg^Cnq:Sу~5_}9@N ģWvo*̢kcfzlD\vbC8́S& 'ZRƩ q: <o{4JK &7̍7HwlBvv8 W}3
lQg87ѠF4wGo
kZsyt"ŗ$^(`C\J|Ip OS𦇣"1+ 6U ;7=,Wa%8ԑB0j1@_'b$ܧ$HߙE`(57A} عc5M
`JxKS텧\W
q%R2b__x7su?жyu4 1֕1ў'*5\fQ208Lum QfӔř͌t׳ai. Q. ̞uϾNvMv[xʉU)kݜl 2{\f̞ˢvK,橃3%(R9y X"jR=)Lf>7,w^KWs>iDKeő %!@1u xFo[+#l4ŵGx!< $,_xubN ;6jټm#$WS/!2$ʂjJ"
OGL<P3NP xګr8m" `}S:;i'*Ɖ yw/1x;WOsqu
,%v%ҖMaZ<I,v¦I%ELG] p3&֛Z}'C Wom.w{ϣ $Ɔ16>%?5?Kk(>p8GY]JEA04]Bup_^34*@qb=MPLCi:Me!gwZ~VL1q~." ~XXBkv$x݇Gl# 'Kj#8>ʅ]ۯ>z&m|@7UQQ @li$CSO1n z* <57P~1ށGyԛOP<b,ROg[8D4b Va`eK+ ee1*n8yzㅷoxLn/བྷ}:}k(kZ(B{ ַpv{~:j@nR!W!i~X0[7@Mv 59L7g gM@ &ʑQ\ٿwYˉC8Zjj xԙCffl&+39,Z21
3f2GĪKX0k&)ASSGO ͻoާ&KgGWS)Yɑ!?K ,p6jbmO gx xO~}~s~gܿw7{!ΝLA~1y4@]e=-x8J4SP90˥[ᷚ-w'agRǁTŵ{ ]UbĶy :"A89 7c
r<K3L h<OLv<Iva6!#4 I c.;+39m=쒰v @t|?~O?DOn_ǣKvhWwu4; )KPHk{vnuGhVFg0OⱘϞ;Ձ ?},q"E3^CL+$4>Zy(#6MmbqFԓ㋽233\c8w yA]sS:isn
RR =|i FYwG ѬU q$"ؔ0| qQD9bOrn^}7
+w<SbZǶ$%)f0Qa)q>$9 &@2JG v[]狍?e<M{_+Wu۵
ֵ3˙b 2f4N MNr vt`wkV7k V]Q1a;&8w`2"Z 4sisr 'vWk=VH0tp/OV\) 3Dӗ"ϐ3Of2r)u`_{B͜AbX -tkh{O~egˊjR\ 7' Et+EN ~O%8|ܹs
<q%JJJ%=eR6jJ\4"mBf:1ó<b2F8v<UsX}a \@gMמ{Vk̉)zq]FA]wC~*<eWI
<:jF?)d lON{z wTer`:N F|6MKwaLB
?_I
Q ^ާ.8l? ѱD5$B Oh _9-. \vmZ˵{ ;U)_>! 1Ey1, 3pcQ6o aZy8-1˟C#U<8Dž_a
p;8: Ї 2ST5VjX%^|`ߌ CEE7"$̂ 2ētQz̄-~ T Iv
af >$|4_Ol̈( !e`m' =+7B]I!{ ,n (NAvR4d%a-[˗>OcI2ZUoڶBn]] \<4(kÝ
݂QN J <ꊧ*++W U ΛɂEsXLu8_wzkJ<uDԭ\(/M'O~qqmu@2[K]BPZ^Hk[ ÃwD_^WoԦq^x1Mͭ<}VRg9օ T橍 }\MYgL=Xl"h N<WNg {I;sn^W y93 Oؒ-:,+iXb/\Ҋ>鎂{kce+6ϖc}J-u'pjo(ܬtFƈKMݍaoo? I1_9GQM0?" Tp?$kz >l6ʵGk-cjMww/
C˜>Ot!8>uuXhӆMlk$- ȦpNK.|h ^g2 a;w
gai7r$ꑔ`MAXq ..w\6^ŏ?%:܅ &o%d~~Ņ" 8(?&BT} p1G|BzJdR e+FI-39\"6&ȈW <XpArqq?CRHNL<wsd].me44wݽbK+b;y}<Gla(] t5T15.` Ω=5ŽvDLŅ=C\ط[ 5@O ?v'ky5g 3(3X =w*Pf (
.dŊ$Txw% w kwio. AU^LaaRy{.,ܼz#o|\ѽkO;.ı2M=;SVYEV^b80$bmB+]xơTL fy1ý=40ݙTw&mQ{6dƅo^:G}({ 1EJco$Eȥ,k5+JLN'Rʗ߯K u] /o#;'Y`w qD*!9^xx|۟@|CskĖVnjھP")*a:W w1^.ǐͶ->5}=9n [̄~9V3-55S[[,3Ő7 #<Ԏ.6謢\QEC' 2ٷc'YYAie:5S<:;=tzgQO__#-CtqrpCo1IΔfH #H˕IBztT'TIUNř!n˷BL{`|b)*CHy].sh)</Zc 0
!J*";?MLon7Kc䉳gDS ַG{&~Y'V fO"?=^W2~ Շ|ܕZ 27I mճ;+tT_s8{P \80"wK4-H#DQP[ČgQ>抙D<3b(拁Xv7w& @ca6;}]WoStNUN֖fHϧHLD ^b]ej3Njgsq8Kp .o;{GcN<x9b.KifB)N\69hZ91̲eC! c Au >$!ZvU'G Ν^u36K8ʙYQ5yQ%# 4AZWgm 9~8gg@3)>GК ŶumH84V<4-}˧z1QP_UƗ őO_~4qx]x,|`5~͑sKWywg ɭ^y{w\Gok);&mSHrS= 0YH-1؛.ggX_MeʈqMcm05 'UT%sfo_NsFSc~Vbnp4^FV`LQX2 u)O@ w=cpu%x39Rھ
9UgMpEs9{6a !"JE;k֬n<P-5UX&&4
sŰQSS$z%))h Ey45T[!YYhb BOm 6rd[mUn&m ^ϕ (d7}Wo[Np.
RI/ʩm|5 ͼ|J`XY2Xpn¼ X`>.6x: Yg$ϝh<xy2D3xlKfbnBhu9L / Ӽ yriT%)TW
D ä&o8K;LŧsQn^>s7+svs. OsLt]ɹ;w`?KDN5%Ĥ'ER| m4Ȍc)KͽgV<cB 3hX ug֊L:k}$^V u`ԾM<vL#GF${K+?:,@gqw@;$$[N
4H>{;ojn{Nr^kk,Kh6؟*kbzU Ѷ jbc@deQi(Nz֕6.& (<mIAF*n^bz /{cY;ccLR >ظ7.;++alLY`6Əe|ud 5 %S_@^'14b%zL
Cӳ猫> $0BK_L$ߔӊ~TfrnnRtvQΏe_I'=큟;5:m1ލPxhN.'ML ôVERYMAI1Ӻs;>oae`i©EPW">{43$ĕQ]F`*;54xLn0 b+!~dd&s9dgw_=ڡSttM0w``aQY ȁzW5TCqrMUM ڳpuB4ͯx-[ȞM+ȊRwپ~7lcQ?kivhbf^ 6{sMzv,N(5 > ꄁ~hZUE#eiqLo,Ծuz0I "IѤ-Syo#=ΟL3vo_9{d 2n]*>^=d5YKks^HNL ?[^I dPju
א!tӵMbie, O
1?{/se̙Z&BqfpZ,N _6;Q|Jsq6k&֓cB!FXJvBFfYS
֢i>A6VdYP)_12s_˱+ؼb>FԈL;G{rr3~ħ?{t_7rEgK>_ȩs3:(g~K
{cfn# n8+g5ԉ/^0 4'VuB} K/<^' 1;`]p҉$ev?i4ymkCshNDZ? ]rξcy~&פqNfM*8{gqHNq!7Gt}6붡8j Eeq,F3.C:Y OAYq*1!>i' P} L-qpOaA))4O1*<WQ&\KzR %-̜2L mёXy9f<Ypj\<1虺b`탋7^XCzJ4QIeSZ^GJf lYA:4ϟ=?%W/,_:_ :#se3'`qrĕGiDm.PrOWݦ];Z0 BYЩsGZiN#cmiӶ=:tT
v,'bo^87/pa!lr2%:W%D:"F` $%2g$.wM ;gr1Gy߾zƵ˘6e:'N%)3d }$vnj8T002l0Q~t:>QiGfbM(^qbB3I 0Y>Z ǔ) }پn&
(vo\
Kٸ|&k2\f _H/䎜\!Ei893@w@CH K>sf\4b:#< W/<gQU%5!A'{"&"pn :ewYpe,¦4ϯ#'1'[²3VVFÒs9{3'5bDo^,UT([z1 #X_14ǐfI@͇l݄\MsNRlhy)Qx9B ErL_<7
LӤ77=1Sm yZ ;oK$f.6ZԆOX #ܬ4q~wP C]Ĩf vaظWf"d>JO %3Ƈ( uǏ@R#1ͤ_[N ܖIMy!B6Ç L=髩F>ٸPIm3*}Y45x1 !~$PVZIB|2%lڸULep[6s)^=}čٵii1<y7TVͮY$f70g| \GLC{,L *˪Lҭ3-mNBA[:tBnhR0J|+y^̃)WwlӊP/2R)8mܹΌ 7;@'}:!__u|Dq _ &c7W$8 5yΧoYhG*pwvCs@1! 퉵 Iˈ$15\|c I/9,M,05@ p6R.VΙV/\<rrL3FUQ[;jإ1z)Y4,]A 5+d\*&\ ˉb. F% lԭvmXœp8e_fILMU#'Z`݅=[?':ha@!<-|͚%|6c%0L(> - $aI cj\9
LI"VHxLs wk͌ $3Hpb җh9Q,k,\>"i酶`.鎖>$4huMOt#!V8Ziam2@B|p "̊ StA_>vuQr@ C3b'wOP2amcn$\+H(Tgfr:Q.^E\|
u%SSUŨѱhFPܯ,Æw>&VbM\q#/ы,;V:hJ
-(&.A_Z
b¯^7rA<op`3xrnƪ5\>3G0Q՜1,\;q0Jm11J:YLtI:IU<F| j-mZWtlقo~n:ƍ<uWaM`S&(ի2 4~_kNV̟7xk>~x#z5cG3sLe|֓-wqA_ qw{1Lv::$/!5"O98 O ga¿K@v9KgLR?oX9>)n 'vm!Éck or5 [,Y-ݺFxL LUIQd/tP_N./8{P^σ|D ,q1eEj$Qp߰zD Y2۹$ Km XG{h?lq\y^(Os>&
ɕpP.</M
2oG
qzp>zX ^:dxdeBfL C&+ɏh_*X42crB ƨIWSW'щ0k#\gP0ꈓ`R~TW
/f X>L2=>hhנ~X8k92T;*W0<Bq`k# H>7Z!c70" AA>\QҨRu(F?/ؿw4Çk]w!]07;@u $-&Z3[pqq KXvk>q;qy^=ؿs#y1Op&ni%
sTх [Ƀ{qFgFÌpwJ߱cGZh!su}{ ۫OkѲ%]vG _x:n ڵ#"ȑ1 悇;섃-Ll]rS'qT<9ux3OG_}5 d
R#wɖPtz,>4؝T ҋJ(&<c$Ҵ",2B tY~(&2֬X:{KfMeQ ݻT.'prՂ_K ֥ L)}םcL*%n݉rR!TJ%b#_?E%͵\;H{Օ8:`o-X^< G3 7̼%LNŤaً~]۠#Zjb>͡TV;i˖k>e4OcxqVuEIL/eRE6;63"P; |,c+
v3W +khG &Y=>G^B$2ʟ5lU{|'cjܹ"9M^htc辉~w\ d6ƺ1$^wkmb wGkpLMu @X8ih0s"ES}b
Ƞ8ZKN>!'4$KFSMWdѤ$$gjq4I4# ?_<ɂӧ7a@
Mhhgn
輙PDD<HJ#r
ꨮ q7ic'̤q<[ϫg9~ho̕8a
vΥ#9Ûg{lϕ;3fȠ>~u ҳW5JMeUҔzRDY *%T(-C,(Kfݼf9xpvSYG]uj)1{z3sgy9~[x⡄;8&b垍ݼ\nEYUݻپ# EqE
̘>ɓ']N\RBnVBñ5&&U%0Mid̐bݰK)N"ך`ɖиzj6[+eZ%xRC[bl]> kx85+va3 cF32=X M g%$WLh~j"af&2TUrV œصr&5g$m+vSx]/K^;32ɕ1ZJ\ 8퍰28GˡbB)g)̓04cb#VΕ4I_'QBraTLi(nFtCbFjaQ?
)WG35 JRuL 3mc Y5*c9mSR%f =61bB ? W1
^6؉Y0 Lؙ xJƦ13
C? |0r
'Olpt!5Y'/!!<ʭ 9?1'ObJ`1/[/0@ss$0T ϟ]a谁tmlPv!-Io˘ ,"->'{( IJfy5z
aJXd) }#Gm q*v(Av!>:˝e7d||{ 섞&Z]uuSnA"s1U9-Z&IhGkဎmZBQJ"#w/q>cEi S
,]:M ;9yxu+ I/K|xR,غe%%'rgeZ\rd[0lhu{Xo2B-ϙSY&3AB5R[6#K)K %מo_ V
_x:WaE۰Kb7M#|6;]A)00 =0 OJRq9br}Nf&fȹ9~ \; S Tja؈1 }ŗoM~#- _ei#sSt֧*
gC%|`h4 KԊ̊0N1즡* *el7e_0\EE DPIz|tkwMt8
;ňb'u>fNy_\ǘ\C6<;}{_vowsmߧڴ?.8X
Ԡ1끉LTW8Bpo"n M-=|I[_ Js"&9 CS{\=qs O E$ƐOIa\D32B .ne$%PU^wI^˱/_CG lw 15wÃ(7
-SɒŤņlGrql%yTZqF(oh"GLŋx
}Aϟ sjvo_ȇ/ sj0/aI 0EWS་h~ڶStz@]"GԡmhI{] Wgӓ
_/>@rl q2'OifѢyۻǏϟUxo$ٶVkqY}-[6W"VH AzNJeKYd!no{eL_+n]ICee<~E -!ƗguEZ0RB|zۣ@~`"?UcZVX0]& ͕wu*[1EIkXߡUCI(,#=; j3SX49cٳfۖMf|%A*+^Za:ȸ $o_C_?nQUQj=vJ&jb~mJ|~FW.{i#1ԓ 34m &qi:.YO7N >;AF:d+p6L1qנJLfsv:<q#ԝ8ePnh -KClؽ%]1א*D)n:T/!x |My->h~/i ll ='/_B32 q%6c{vɉbH@WVT |b%)د!11:JyqA!ǍzMS_K{j1 Sc ^$Dz`CSM +֒ e Ք7]BYe|=~EǎLqQ ,ݛW2^qxptxmxpnc ܰ.˹5g. ɰatC]-FxX0PV(d_
?7 ?gGJˮ?_GwNqN⽨`:~#K^^O o?~>O} cۦ%l\=Go^>Wy$"e:SX0KO2,-"2,P@o~7}kULY59uK_BmML Lz{Ɔ3
u,rC;vmrRbE;&c|m\M (%M ݼu%k%|c?` fZtjљ _ѓ֒LMJKG1#%voȚ\ܿ(JrS<톾d K~9ޠ0M94GZ0 w >FzgR. 칓0a4
]玨v4SGrXr .NҾd oY` ȟ0O|}) h=L~GSiζYc3\ Ěr&ri:^_>% SEv5(;v``Vxof6hw|x? t$`d=퉥N
cg+} .G7 J'TI>衩'? 9/68xl)>əZєԸ8SӨ)$;-*b..,#!c'&"==ܼ+dLbۿx_ϓgNm""9C[wtj`psmp4"ah"5#b
Hϯ$>ґ%1} 55Juc|&OovͣK<~qFn;DMmK͠I
AY܊8ALb{ 4ZϕB2ѻW/Uj9{||o evn]-O];BZw4o>@y!\8ƞ Y+by^6;6r1^:~+.u#F1c4nnqD)q!$G R ddU 6 ε||WΙ9s GY!EQ]5+شj1OeFfI^6YLXϚN fNQ{1bַcˮ*Ә2Zkli@7ܢJOT+ ߽^Au̽kgnF=N28܅|IJyؿk# ^?g9d ˢgڈtC$ej< Mp0!בyӛY8k:U2GRUVʢ9c%n`JbIkMq,6g2#E@lD%\L6zvyh/}YYSNzRk= ƺ4e$|l H jbN~BW3@ Bdn2 ؛UWؚiK -uqs , }rEmCkm%(a+D`$U]))
e哞[B2YWTGbV B6"%TH)bI GOꁥb
s L(a0b`.nADP$6% ) GbF %r ^|[.Ϲsyu{ _^<rG_WA6tF
Q~U/ߟbڷS0*5e3ZjB>R)C|ċoH_ÇW7[w?{rG ܾr?^1c9L8mågXn
'M";;&M˗ ܹŜ铉
('eք ˎ39-孫 (c] ަe4+s{r_ECIl[M+ZeiZ<)jY2g]ޝ : } S9N\\m= fAĥ3'qM 7>þX\ArEN`߇`og 0ƺ2 \yk=On0^9XwMPZ: 1 fysVl@Qa cG7&hRsǙ3p_'"\ $&ʹ
uP/ 4X)ׄ}:}C.rj:vgx
C{dL^4gֱld%ͽ,=}ba@ukwʤX+ÇvI-d0ւ}'giNfCھLι9.aj怙ts;0d-vXH`k턉#?d͠LLh EVKbr&i9
KKk,#+= %.cB11FܘC164\KB FxaYQ- دPQXKYx U'%sQ=}ȕ+g$@~}kyu(%c]|S!>6}7}sn"\mڵQ"uQZE-ZFYao7g1\<`[~M{扄{!^O ߿͋9߳u-?+; Ϟ`LLAA #F
_; fɂix0z7g뢩\سQnȜ1lT
'oXn l,c2Feu<vIXظ| Me)̞=~ҷa? bae
kY7NtW.^PŇabJ%fiܹv!oK^5E+( d@o"}\uaZF֊n
.߾ßϳڒhU'S)+lXɪ% 055? vne|R cGS"Jk; m '%ZdOķMS+A$
\=YjBO"Opvh̀nrt*%w3|mF "6w$+s o_b O
PkA$Kka t1\'6R `=\0h.8ۙnlzAF. w1skK)ہ
3YӦW ES$8$$eCAQE
G>ښZFFW?O) f C|]RW,:3 ߑ$SXHJfrFoLPFVN9e$'r=~W?z*qjyOq]ui// xUp_=%DE.~h&dAkmrRKzuA5YܽE ŋl۱;>}_?D?Y8?>qyN+-\NJEX2O| _8ɺ_2ill 7ϟܽ{KmQၔ
gp>'riZA8a &eٸbõhH,ױqKX|gL Wy8o7GvoW.\9֮buH|fP +jpz!`Ls:ϯӣ˜ڲY
ERN뎫
$Uxd˟U~e M<Y\d]떱rV6p 9MHY*w&5&bٌ<yM*Jbz]717 X V0z}w<
4:t{
/VV
)3/NeFY// ,Գ{[Lai6+!&ӂho}6 z}K!>AS^gc
L4 *b`_7 8[3\}\wCczF8{c!yPÇb-:}XfN OEx`Q~!)$ǥEQ^9#jG#/Ay o?Oܹ,xt3gObpp@N&elWCyy. $ AeW!*US.bETbj g~~_a<;Gvr H`?rzj\LrnjC%0SwB$!ed@iӮ=- (WӠ^]P:YІ6mŁB:ȟ?_ܾrwO O }OWΛR1/;xrc;ٱq%DO [Wϊ]=,=Qhljf϶<{d͌mØ2lr>YYcX` 9o3IKH ;-kWζ)@\3WWAb|$
Z9MBl҇lݸ7 _SC< 3 KPBSJ("~>Vn5|ur e [Hui~XDCeЦ ȨZ>ٰd%y j/-< MkHIь R c,+isdHR[ M õ3عf SH`ơ
shu^U3 G^O%Cd\yb%7Ψ0O*b:nţkX7 r{ 6`/ցO {G =ocZb2jg07W,)_;耭[ l=Bq %@ 4Oi b估uV/%'rnsR≉ .5bY3
H#%[Ȥ$1qxy{ </zvS[vqb
g hMR-'/JkPx d)Knecf
GP5Y!ʪ N_]wۧw
WK[39gwÜ. [ ӳG7Mn /*mmۑێ
_Ъ{E+eV ?㻏9s /_SHG GX8w"i
>6ͭs~x(|q][s ue3'5kF5PSSx[1{11j72{Ri+X&U$,,kz~2F;_ C;8m.M k%$2(R6Y3
U-)w?hjJ: b<=#I.`-ܽ'W Z7哪o\.p= FQT#k' C8 !/яW#㼘<GbDllvV `1TVAbLY|zR+J(5R_̙8R
{w![fp%:E΄=]Cuf=ڒjώD A-0 9g3X\Ws'uu - ؙ
ofFx'5li(? .>bȄ[t$H١o;3 m0 \#p J9+@ q̟=$]?@NzNYd䕩+R3
IL!&&\Lru%1Wns6m[hѡ4
Gg`W $%SWI $^LNI=J`Ḥb,uM3幑4L$ALLYe˖-s{~k~|uWwq͙=+87)6rWnAا;wc>tҁ2Fk evm[-h-o%a[Dӫt
!eO/t0o^?3𣄃ox d(K$Q_9}<Oo.>&ɓGx侺ynٌYCmm%*˕Kٴ~5&!MnJYǫ3*$pL3FRZqQV G^|`''ngYh#j
qHfۆOU 2Kԫ."&1ہ # {,y=Ⴅ{A }xv"a:V2 P_b| &!1C 5yI{H=3ae4$?"\)O ej] n]fέw웒b ᕨh]s9?}u tqdhWؾcFc H)AZNRgO@>ðW[ >q,Qf{DW,0m F1OQzd)a@0<:K 8-;Cm|D]N;tN1S)j!O{EŇ:88ac~9)_qe\_/Qq BS)!>)[0OBj.aQIT! ZaR$;D&MG^QBԿ:D?9yp=ąJX)%h$)eATTOb6JJJ eUs~QG7yyoEc[s9uh u+Ȯ ЧGoҳg,P& ? 3Tu?& \Noނ=Ih= ~>>᧟ü~{_' Kd&JRɊb٢ۇx^+uލ;y@ /pO?/;w6ī*%owwnF2+2v߽ܙY4c ^͢1, [Zv^'oqT R)Ltk7Wwr,LSc! .dqz6oZKlLYilrj/ \>y HOťGcᓈWh6NFd&=̵$}>@K&0%ĄN ([Mg|?؟5s$6:fDIJڳ9O<I\4+M%0~X*+(
? ]2 g! S92Ucq ߑsY;Y`0C;|i6zW)jjL 7-4{g ʎL-wraN_%7` J2p0V'puqXr8ֶxoA ع$g_zhoJZ..* wuEqxɑ&ϲHO͓sKixs%w;<Y)>cS:S\QMp Z3"ribT*,pQPMz~r1|UOSg>&5Mc˧o3ϯ^}xi'__;*{3 Aʬ@u,h/|AA;ur@Y],P'1
mڴgQ,Bt)=F+ ܿrG7ϲ
͚@S}1M4=m"o=û7Adln_]!#{7~߽e 44~,5M_KI0^&Ibk$l CKП+6VNg:y\;rV#W+56!ٌx/
ddBrMfdE`B?I2<D`}OͣX|\fL@L?P S "6s:( kpn˄ĮP̖8}&/͐ AlZ>PWg-Q^a\AtLl LqwSmbl aaW2oR :ڹSh,]39p7.*$ATy Gҽ,pI.
ܔDNL Ú2&H?Ofd`tE1lTIJIurvER;Hr 1We fs !W{ {YK!<1B$+-!U@R>QBQ YEdi3
Y(%VH!ܒC Ki 5ReEܑS5Zľ
`Xĩ
$g!}""& K#qqrQom><'Wj {~ͽ
^\u{W^~0t vIDa5lݪsU{U!BYQB$5G
㟿侘 TfND62( [Զs,9Mز~ ?eObvQZZ$aJV\.[7LPzW/e> ]+ w孋nn`\;wX# ڔ,ۚ=떒)`zh-% jFwq{{E)/eLm42 abKHb9)S`Z NmXKgϴ[9Iuy2SY] :Cqau2>SRbۉ {C )W ̛ Sʸ 4XKKekp=U6s-!ٚp?(e© ;+w Z<@hh.i`[S=/䖄ױ~/ K~b Qll w ؾ p0JO !8٫O&FxH"v*-g< v8f[Khnԗ !2"e@I e
(9( MFv5䓛r *$9+zG!b@59߆SUUόYt!:_+d
[P=jF>Vž _ԩ-!&& KG4~&n>;] _y~:O }x |ŧ_lO.-]-udeW-A
m۴}VA6-[ _P:a BYΠ}HK]
_E ܻ̹ӇؿGFF<Dz3wF ffɜ:3 5H XǶx)3gL۶nM#iEsy vlfRC&5P*
Ҹ$^H0Zڣxq!qo$L( `/cLP=To^:&{^:h,͆ace;vn( 2{'P ĠbN 'z
C {+1eayĠaV$&0Eg"Ŵ<F$3Qfh ۶m r>C Љ@Ldӂ) ؼsԀ{kLxh G0Z~
CIzyHO YƬi9{z/gn,*ط"x Q5Aj n:Y?6smnXÎ
]>0FE}qsql7!V5.VC1UP'+۰ -yܬs%@1n&8hp<9+#uEb(P}Ռa"/ .(U/ddoNxȤQ
V<Bl c)TT3yT͛+{
sOʈqhyx֦8KHٽ̞LNjyEF?"c
ɭ<p9n26jx.߿~gxy gy*\7i~zyOonE hi[+ E[L]4^,Pv=R& m(SN
Lس?>yU EdK6 V?g4ėٱy{/gfm9F?Uۮ]dzƍm۷mZcImHps^ '^8{s nsyq<9k&
~,t'Ցmf %E13B`7~~;-cU0[f )@9nDW\>!}E2q>Cs7QR6TW@YV<S58`ieṟ~~^.$DmEnp uٳ'3f
`!>8(,Ww7BCCioN[.\*rs']nQzd$=9%8d./X .F:X_ɕ+%nF#(?ڌ vMk`C(:q`J|,T b=`߂X ʹv6[.3$sXX`f>s8`k7Ga8ai>O7;BC/z /So/$3-[PQ#kYYjM'0~ i)7E&CYj / dۧΜIWS)"4*3S1
CIsgF!5rr+UYD2~!d_h,.4Z_ӷ-?=IǃK۹ur %93[ɉCsp_tch+AzоcGu@Ԛ h,*d"M)vZ:" ;wf@~+W #PWUȈb ^r>GDPNvX\ <w3KںijfqL4 ,9og^L
(]R^Ս
M; .8IpT8IxL(50c(M"'u˧uEg@)Ċshnd 3iK,P[uG6>üNeR15F0^f Ja mi;</ hJMhWq5=krx|ͩ۹| $G46l2 zoP^![kSGpTX!qab8LBoOOH#WBi}&OMVB 1])
x4ը+hO>Uj1:> cٳ=6;Է3{1Zg{A*'eZ0c$ M
a͘ VL ӻyx8;V͢ GDW_4DẄ{B;FC0S$T;3mlLt5 *_a+$d5 g
+%48Hx6K-d_E" Cˋ seeKP$&!DE&"nl'";9!dF6|ZwRV$'9eRR MPd
^~a$&ao@avW3>ony! sx b$\LO={IHNi-oQ,Z@YmТtڙY0"-%[rf[6Hؿs%'m`";x]WvҨ//P1z c;t֬^Ny3Cn֥4SHΩH3nD8"BA+Qb(sP>59ь,H +ʇswP* %;Ĝ({Ҥ&%n XZ8ҭ@m=ٻg O_Η{O~h& pi,-4'_ 3DrJj<n,ۖ<qvE )4{6[|5ʖRႁ!gUlL.7P44ЧO?|'.*L1
,1İB<])HbJcpW=eL/1uF:>&vkEVʕX숣FpVsnx^U%h@E [dq
nx '7ɛh' 3INAJ*Lu`5\ -[-b#aJxBNW1 n<ZKhS411䌑+F>X{`f玥+. xxxU8ؗ:ӫ? ?bD_% $f &K'O%-#G݉c\</ W쿽@ѓ2FW!а L$Z B)D G%E^75*ҳI*7(W0B"Rp "%%C!7= { [,,o\={wޗ{v [vo0c~=z(ۧ}.XBmڶC7aere+3:wHG~6}#/ca< WfM xp+8> +~m_/سy9=e
u5m|,?QW\#OZ}9~s}ښ`:l0.vH75 Y Q^x._PXE<l./h_ Acyx5H3cjjJ2e>#sS;-a#<([Ȉ+`@g4?(ft9 #̢jLjf`C[y}47$ܽro߽d_l@{yH mWv!GD>#XB
AA 2'I`(+
)
!H|SiZ"3j6{\ K&d^ms3) 'B%tZ1]KL|uvw@ K2"xNb"BEKRټhKyp ė <_p.c8ɓXWb,{}FZ}Ԛ
zX`4\6pBS__<43M\F {be/|2ngOGٿ>>D ăTOTAF.Yۣisx ?r&M,jd.#EOwze<sxfP[Fiq=y9Ϫ MCTDɤ$d0 3>_-yͯo ۻ5gxw 'vr:E9>8{tP
ZztM0NUɁM(_|R't/,7w| IϖƦ2v^˳'W{xE\8pF^?/?=cڹ&S]5NZs ?a:JV$3D-\mj>6߆xYjF v !ě`/$#,#<
w;lt
D gL\ǔ>8u&n> 33v. 9|/W2H
}X!~t7On&8?1V3}B3V<vʅS{N¾Gx? ocJq F\+ͩ.H[eSPÆg B1OMY+,J39LYԑ5,?cY45:bҟ8 ][պzZwDNt NgS8=dzpR#Ņ ?ndiS1ns ܸ9`c 9Hp
cݞ[ &wcK4#g]l7c > S#+쬼3|q>W0>8b`C.ݳ/N$&f9%=RHrjQ!LLxQdǗsn<uKYpfM$>%՛|Y&檴<(!gB&q+7(
O 8~,=_>_ӻ{ y/9AF ^9ՓɏgF_H'
CjACeZm;ڵrdeAim%,U]m\iб 3y}G~'wn|T0^3{9}d+WNھ+b ?+d4GV3M aޜܼtQ
UEF {sOYV՛$įV1_/I_Ly~Ec@ eEU%edLE eIh(mRbl}MDkÒkœ5Vr9FT+!şз 4K
,M1CF!(Vܬ*-cfU,=UǸi ߿Χ8l/OcC`¼Y56RW]Ey^Iѻo_uY ^ $FR^/ nEXQ̜:Y4DŘě%B3C:ֽܿ1/1"v0Ɍu#rٱh,k'xT#R)Bjzj' eKM *+7*\Ɏt.=G1CF$ V[Lb̵id+.&$j/ؘcG0vnعa싍Vl]q 3kG\<pL f?
1=ci&ʲ.iV 7H5&8/rʹ $pyάXl)h
> ի#[7Σ, £c I/$$|ށ1xD(cJ)%bL {~çW=_y}z;wJ<) ^<8%]]Y CahhӳWoyu ullY,B,hK/gPZ6ړYDon̜0 ?o mX&^?wvN1
y&+4sCcsQ]SI>yǍ ,(*Mp RI 4UϿӥS+zܾ%[_Hoo th哣=U42P?7 f.<3#[W. 4 Ə̈́㈉&1)SszOn;غy'8Mqp+&3Y CNUFh.6$&~$M;svF0+sCnݽ_Ï ؼe5+ˊC8xZ4kq n8KA~%%%$'gгw:v#K~Ԕ3Z$;/ _I!~Lϼfdv/ásY?E88% [" +wPw|ƶk{$%X3MK&FȂLgr2BSU[_). ^/aŁWJB0C]5sd!Sj%d71$~( bd|lx)H;3] l\q ;{H,]rRp&&fI4 <~2P M ":j믥 m}zg0 ͚_O ,[;khV.x _4 Rv`!:>B"W':WYpn"~E䷏Q>绗t~7Ns6M .ӋĄн S2v5E=
(+ZIǺ@YEԲ@t_Z-Юଽz+41߽{̏~#?ȶKp %ؾ/
;#Dovd?=gӪԖ2c
ܜhn lRUZӾ KBKU ~w: G47_N)eciܗ
ƔQ 1Fգv, 7v q$'cld*Ʋ?=`[6=iXYDtL9IY1rJїbIc}+'U5ͤ'%Nmc rhmGyLݏؾe#5d^ٛ[ "zSwiN>ܥ ` |=YSj2R"9ؗOMX?Ɂ[m*B/έ2&B a$
p+JS94kX7t \?# sr;o ړBCi,!Hgޤmt1
3Xhn#+aX0!<>Dpp6[G[[K< cjG.K3[Z;H- `_Ya@ =
SAKMx:*{
O` %3?>,Z:0<Es'mJS
.2ȰX0# +\=Xe2G>>%?~xWyv <[
y#յC44@Ppӓ)[ j%x̷h%j+uE[)[g CjK I<{ذvgO~/
{y{_߿(\6& d-Mg:%qWk#}^K _wsp{EFvJ_V_|El+u@.c*sG2~*s$2n(bI҆ӥOOٶc;>%>.ḺD [BLN-.tu6t5Lcg5s=iec<֟ٻ(ƍ,g}p;O/}^bnfv8izT\?CYi%9DݿR`!.n88x
kgCFXƳkL\h2%O ?=Ʋg'
!r8SL
8(yabI< 'Sø,mfV]&Op`=Ia.%P$=dN,֠d 6 &}0^X;Yaq-M k{FO6{hHOHZzciN[J0az I Kj12ddJ-[-4 @C?Aa>,Y5?_<ɂ>Psq4م 6P cł' . $B B8>xWIqEBw )I|}=}xO D3|}o'7H`8̥ckɏwT' 4)Uõޣ.b:Q@[aǿ& ItAoGi]tVVܹ32 Ϝ*F1~\#\;B. ˽%|pN!y<wI]iwxpㄘ4fQ։EcKAotP""N!f\Ҡ'Saz=,FX`ia^00# (ؘX*
3Y^? /[ʒ: wŜGRBQN
XK` %eE'!Ok{WVXέ穩 G D _8h[bGm-MF?D'.' b$$zhrcIMJR¹"+pa>&*lrqua@ kŗ[ؿ} yzqO h -AZH/FBiIn9ٙ^Y$0Zݛwߺ ٴusXNn'A Ap3 gC(>N왁?y [b4305MS=+e\,nd2sɉ ={&e`%/VV?5 ib % I fKp
# ۞<D="q ?Ofe;BR Ss}1Z n9&Ҍ4T >4u'HM]b{ kr4 ]REp@ !rl2^<dxan*fY 7q?~X1||, poģ}fM\>WeRٽ5%h1P/+E
tJ'2ةs'u2CG}'ګUݻwQ8 :dOO3}v;sjKq,ᇻ):Q?(ϝGyt եo ڻc} G 4P@)8Sx Nio0X}v\8\l-͌doM ETwl[-G7; GKLuIP(;;*Ĵ[#AQC7vmIP GCtjDFzZ'=k. ;" ${aހ_H<C3I,xc̚</
JKg;Cn7dcޟ;gO".& ElңtGxIBC yYd'Q-(-&@'kHP;c=g[8r2e1>i ]q- ע,%DkRI1.ld100 O,E^{),l.3}| .D+ aMd=tt`iW~? 5sv068YpGn"8Z
`aNx ,!IxKG` ֗"1m ! }qrvQo2qgj& 1@C[Ab
(cAk+3+y?,|wzR@o/tܰh%yI_nꄁ:eE`
p ESݽeq[~xX C~.|ǯ/> ^ɝ[~LQÃGNh` =={V/(Wp (oNo]C^x څݺұUjl{F ?)+ޞΥR/ d|x)s?Ĕ| ߽ÏW^?*`̈r}&cQP=
M@@Ȓ\ Wx{cj8b Is 6*-r#V@LI ԛpV .b3E(~,/D4YHgPJ0逶6[7oW (˫d@AhQ]*<튁5a$+F6҈ >>䥔g}gꄩL6wZΟ Q Zl;wpv&$0[gKջkg|٩!#QgwfL,M$8itƶo{t¨JTޗ
Rx {6oI3
c f*~"gw. <>e;+Ȋv'
wm6.NW,ci2P[_̿謅&ʶf Q +a§ w`^&ApD2䉂tB_}5e}3}C(8PB1։)S zoOwe'_#o̒E(M"ߟP% , {;g\=qV&{<HCarh=|}͓th O+ąyӣK;5PHJvi߲.t( m'ڵо;ϥuzuCNغ 4tL>y?IwOT}Q:s~6Ϋg_{IP/x
\;Imy&8~xnV'3 Du$) zZS
Kk+& 7 n8b 66fX[ (YLvl\FzB &C{|8< 1 Dvr ≋rr033E?kOێm ¦-x#WTXJ=jLfv vB5to X{&]ۛqbix~X#gsdrN$Dž2qX&Ly YJKIuwY9w|?CBBd8Mٮ[w Z]Y)ԊD˘5edKr~j6oY81GJ슛fwww; F~+ 5D'Nё7=Qe`\I<gv, ?Sj6icI [0+>u N1 [!
遲v6c1Nn9 ⌷gB9
#XwXh߇c &6Rq=g)Y]qz{ aCd ꋶx#KϿdR%\i-iw :ؤJꇿ +ˑM`h$0uvtT'
\<
bڸq<|Z k{yS#~x} o.Q[xzm?O+\9NB| З ] t.AGe{%erKNjԮb&>B ]wtd|9{1y/ 7.I8s
㛻'Xx
[V/7Br/o
;DžP1U9sl9y)&K;8B:;$H >d,_8IKRΡ ѵȥ8SΩ/4,gƔDIv#'U@6'E+Mv\MntODs{S3ظv5 lپyf1}BZ4ӣAt5q4&v˰ + 芻ߣ2)J$59<*j8a]~bܝm01N89Q"'p,l ӿFouN!GrR 1FnIEnSH^/b~?Y6(A3 œ8v6IOclnj9dS[grpTi4Pܙ6t .Z|=K-!IMm(`|90K ]+{ W/ܕFX:zbꏣG< [ INKMĸPo%lD oX,^A"SpKd|4ض,Pjwh1 =vlLX/wdЀ:3b _GN[ fO; JQ/<|?/o<yXӹc h!A"*U@w1]:;+һu,VL`cvtЎ!K;m>g ~O ͝KI%D|ޥl_$,| &։@T
>yꦘT1oXV-nmX^\IQ
t)[EGr"߽U'KM ">=3sgA+W+'41mX5<y:1ub#kV%>
$!'a([x+[GwgԪJݖ-pS*W*e5|^ҵlݶkV J7e]WZEC_10B$XXcbaAmm9u$geQTZ+jn7 7%7#B1z녅qo3|v&K(rX[;ѵ[w
=8h }OV"c=+15zbWG=~8>7:?oN?{ l$T !}iL % ^:yuk,4Ax$-ycUWs6
{9w57ed L^D`V514Y/M @z,8 >ަ}<dq1FL;n~xbd큵 6.zUqenfINZ
e#Չ"J#Ept"AQ c!AWB^vN&sfOƍ2O~WDxh =ѵ#5M"2܋0 bB{go̭]SvJW3yZL x:L$8e{z7wQ^9oʕt-A?}E;ҹS'w9.cEa}]ի{]ta~ӭM[w ?; {v.Ky"|
7K0}\-$T}s]<}9Mw`\2#))eL:xGv ܺ˗8{EyJ+oT?zdF>a1x8dg.\2Ug f<23qLmX '(Ș0=}Rܱ
mZCt^p۰~h+^>}sغfx%DAߪ}gZK:Q?z8GM)G X2lb(ʥPsHm} $Ut"Gs3u& 63z?c+[RV_MuY dŅрn؈2!No~$m9 F][3@oջ31ȕs2Jٵrt52{D.f KW^ƣs ?u)4rպK+"*
w qwQ.hbk!^LZS>K] '?֗f.zv06wZ[FVsJȊb~O&2IwC`L2I'AO'bܾk=?{*}hm>Mҧ1DN@ ;^K ctqr*>lj3{Ưo ӳk\ڳ˼}^~o%= ֮@m ui =ٻz;qN]ѻ7e̴߹Gw|ݑZCѥ`ܔ=[w7OE瓼'ѕڰ>=W7,nS.;HyA
ԲZtJ(ʊXn5&'=-8X6Y] e$kJ|-L8SG1NBS'fL ê3HdV7|,d"l2Rb> SǮJmV<+Fe&nyo^qklڰ ު]K:jݥ-pOG lbq /D;;glL h+00)(ȥMw
7DnzZ\)XdƪSq
T&HmEm٫d2ކл z+9$+-!} 7Ob6p#܇{ :ch Lfg_r1STu Љ\ݼ '26*M
&5cK[+vh=Ҿ ݽTTeG9K"wD v:8
jvNJ F9`0LDW<%..^89`b茁-v~8;cg㊣AY)TT JɃ!⻕9ǥ GhLtp%w p* 0YAmdoy%yJ쇟)EdgF`S oJ 02$VCLd<W-s!_ۻs~HD6?'1JXxre/__;Ǘ9wh9i1.hy.#D D (\ʣc{zJ*qPك%巟ީ^(Z1ؿk y;˧PS#;(+,]8IG2Z!$(H H4ϛL Yݿr7o"
R«Dp ZWʜLl,cѴQ^8"%x̘ #Th:glO 7qKpIiӾ;- m1nI/-+cd6[. _ ڵ4
p yhBˏv%֏}2ĸCeW@c'Mصs;$>vVHwS$@JuqwՕ%9f0YD7VӇ={oގ0|.)pDxS CVz C(D:;@( Ǩp* ?oȉeq1,j!EBK+azu3439m!l=+&{hϩe<f7f~nՉB$fxca6k!ZkKJ`; O7S JA#܄8wl8XX)-;`%@ˑ0쎵HXtřdLJ Hh, 1
ނ"b %"bJe
%I_L(/?}L 쉆U7gD,
%Fb$0xb"7HCK1fV8۱u*~Jw}|+퍸] x~Oo~oօdѿ]쳿H䱅3z[Jҹ ݻ
;K6֑aC5ٹ-anܸpL>RhRx๘K s2[V-` ڱ"=Xw$Ј=XAiAK? Qd鎽 =uOq.XG`?2ԋ vn])"4i-f9پQ (#$PL`ʄ҃ Ə($;8ԩSY7弴j!wa֪%5H,}oK ?Uݧ$aZ:m=hE!Va c\-枱j
Q8{6MpRAn.Ye4浫VL֫j
')b cbx/1nb9̟50(Y^G\ puPqL
)؈Q F^7тyiYQ1(-JgިJ7V2UE4d2>7e,~R<dɤz($9\5fg,FųQ YM7j9&0fD:^)$
o< Rv@YHf&a2qfu A (^XXXʘz" @eN NX|
aF" Ox| N#ٰA`_R<`_^QQUBDh zիAbb'7TKh1Uve a#<+*]ٶi-?(?˻/_xyK ]ËGC \@4uc UUpAK&XoCw=Ukv =MiM+WϜ_"
G7O E X,ȮVс?߾Ƴq0YSi ]IjdL %Irg-aQ jn& 8u`z2.LLr[mkD(Kb٢錨)%c`b
1,Y0Y&[_BqnZ#K)M,'J: )T+[I 8HW3bd%7R 2wSI&?Q]U(=5CC|ߤfLHQiy;amOThz {b><',3{臛pLį?UY2͓şiӣKgz膛=njpKv )Qx(/
.'pjsH```bU`YuE̩+fFe`?I Y0D,.gQLYVk_7o<sUZڪ*7/]̢elY;Qubؓ=Qr5|`uAĔf+Ր@?K5Cl00Z} k̬12sb`GO输p ,Ć
_WjŦec GC%8$&S]]+C?_g_P\Z"뇆fgxM ƕTd @>jo/ir|V::hǮMkY\$/jȷ7O>8/pa&2#ڷ]Z}犦 &XW[~g{t},xث+]o^hiӭ]=ݸtKnc~Ƿb7yr$[Wa& # ;gL WKcM1S[K HOO%+;7;f
VJx>cǶUTeBm]>%)ޏܬhIq`L@j a,_4Jv1gH$Fy0vd2K)Cs`?>WoQ(; @#Y)ŋW|#O1{G6w]W]:%BR}M/i$ܝTzGI~ T7q6>|o_`,c{p\})JᏏsn?+gO`g&Cի :v m+ۅ!r<99S'
C &>C_FW[w-иqwwwww7B $ BI ݴw;ܱfZ+Kߪ9zj@b6'$J Śɣ1oTTdcQe.f2.Գ- Mӳb0^k)198 %1^h[PƉ4/L VkfD,_XyKm"̙Z~T8;kQ2mT؆r8m"HA[ɂ Yȱ#L xn.r3\y.- q Bdd(t
!"<$($%a~oɂ?i!نQAVx fV!;= A/\il\ ЈN~poU߇ґ-tlދzyk*L> < Q FH?|`dcCAd7|20F3p@? 6#`<Rrp˛;x, _=vлe%̞3jQ?
(DNwݳݻ|w aH'h 62K[Qe qx[36Y(') HULaGFzqX=&A>
nj0-mc{#[(N aгP 6c0d塴 hjx _S-g_=Ϡ\/?g~6oXu-G_T2m`S`0D!be8hdge#3cMDǦM8b?vn\m+Ѿzr(n]
Cc}plW CCS)t
@_ $Fq Q ̝D`Xx: lX m4 MKоv1Rlm[ݛ m8$UnƱ= 8:u 'o[x܌#|ԡ8ϱwۺ qS{7[I<yo='7u?:caߡS3ukTÌmuj*{: 7z02`=FYB vnvpzoB$$( WâHIDdL (M̬ZN:Łӏ/9.>_@{[32 Kl
0 $CC,xOOD;]I N Hd[QOx& _? 8.sA߆qvzf\;މv;yY}fLZM#]FA]\&D"bƝ\kUeSV 4Dn$ξ0\y 4P'
F(spN>aV,iuOQYKrLR}OqvmCƮ ><h`&$<5MXOWP]
a H>{`㺥10SC|/F2 i|Ibl̝>ifN(9SQ3 10 ;#+tCA+!CdUL4 Ռ~*Eזx!
'H$JF;\f={#֭s-Gtj14 0PF1p/(r`ggPoF3f!1# O ª%ն#!.p %ؿc-N ܆7DmmOBSU}hEzR J Po@yٺG#qVܻGy-8||$ ݍ)o?}O/<b{Hyb?r<p;ږ
s8N>U&⏟~_t7.CqVOt9Fκ:ǁ
c$ s8G'= 15o`nƖP҇
mb8[!">
C(q (WQ NHABJ:b0ou#LB o ¸pbLKU
7XT?8J+B=]W%W
='$%!59cʋqa5cwӸyv Nk8}5. nÍ[p\;':][1<\Y^(-! w'h2l(F(ݿ~} :*sgpb7.ޅǶ lXj0n<j+؟ Xx>C{6rbsc-5U+*P`$V||lmشn?n0QG|T0i^m͵C2Eb֔Y1I`?. P]OASe )ͩ\w
={~K=vShJ0f*&`KW [xMgb
X~&MT-{ T1m4\4Ssr9M'rҒOҊ>e]ٵ]Sq0H9-!wG, W0WO f$Gfaj6V0Mͣq<~z& ֊s!Gw˄lؿp` _:O9ƀK'<> ؿ}j/8{a[ _$|pO`̷˧Gbqu[0j2dG OsS_p>W^q3GA;L}e3SQk:PUׇ
\ab"KKMqsunC $I1}HOM g/###*i>MRraqf2o/7XY2YHI$6#1wyzo ]Ý3\"8緮e;:` <8o\˧fM _BD UՈ?<G7`>8J(HwُO'W98w|+EFNRL _ cKP,+m;8Ƨmx3ښ0'Ŗb=2 &sK
8 lGG 9V0 (/$#" ͝mX0"1z4$⃑0y@O1&loFz`ࡌ=F(**)S0qb-**ˋ0z(lԎo_~ǟ?}?g3.b=Aݔ>s 1Bma&R侢ω
rdU㱹c3Ν8u:{6CyȊpE&u 7:a_\߁'O :FPQV8c
T]./n :.
qٹl8vƅmxu(Sӽp sxqv?ޞ? OO>yգ8չ.>S!Bvkfo<O7Guc ybǿ&{l05" MنA )lu``4vf027)_ϒÂ v"G- ~~ް1C<8IOg h $8\MGD*&bBB\HJߚq& {U}%2A<0wl .g0e($$ f`)Xx&:-ƶ
ji@GBشv>\yc<l];Z{c#v.kpx:ٲ[ZѶvZck
l۴ۖy)lLR;3H/GEy>&Oriq6MFP߾7uK4]܀bѼi1uϙ\'7N
cq1lZÎt9;"Bў
OOx3CQS^NЏ@bf!:: 1E+(x"/#i r13
kF!/? A>4$4GU1RS
If 31 H(*)e*FWlT9=UaC*<s
G6aF[;C<{E%KdYbDƧU *ZХpFr| 3qhkmgp6ɾ\0xIe!4m4l[q.dDž"VFF.~IH EJ
[u"]2-+`3k2tr<lk_F{i*omƑ4:(N7cO ܶ '(6;Dt^]w/ Ĺ]4 [7
{8.b<ܽg.Ń+;܅208$`d#,,uh gs81 ؈60694
Mahi sQNcB6Baj,B(>\@+0 a1 R($dq wHOK_qosAA(q5q18yQT$pų8
GRB cAђqJtiMbylg_s7uODì*|q6M+g`˺yu]֭Y&wwJ%t䑝4hY&1 k)*W,ǴQ^4yK);Z#=|xv o ]O_Yc)[ӊEӱpV-Żؗ\.SD>1nd#`m GsѸy
4 C
sSP($G0[D zJژ`X
GFRChh&e< (dƠH5Aeh/ 鍲4grBO[ $ѣ0y$ _Cҍ(/+CQa fOC ?ضqW2'~?sc].OԜ"Lի;Ƅ-iiN@^aZZz. ߋWN!+>70eøtj;û`8XXCE|XB1i =}f9X^_z+{`3ya{ZlݸJ-V2 7ش'wvԮN\9wD # PT;UU~vӘ#@9˸1Kg<v
n«{gqnHg?!#\_
0U(9la
'{c
FxX0;;ZS 714Ǎ-`aBgoyԄ! pit=<}yQ/DE#>1B#"}1-҆t"3&3_N8QؙgsLg <DR!_1h!:ȣh]݀e'ch1*0oJ%NBqhZXV>kfbk<'7P$L Ma?AûgkW-F{rb9F3KLؼnn=_>I\_?/ krh\0k-3&b\Y.JÇ'8J.x&s<Aks=ܝ؟@Xh `?OƏ(M,d%
}egq@ 'rL
+u`ĆJoj^
i*1( 95>Fp x9A72E@hLB(.+E1[Uu Q M˱z)8u08{:wa9H,]O6N&HNE*MClB*2 K Oȋi. ?{ '.L{v6SF1A\9E "7@LpbCaojEr~ϯRb#0r3v7heLogdoaj]öcNҊ;:q "Lv
v ڎ
~6 ۱& s'Ɨq <q OӻQܼ3 D̦
0'Ois&pt2 }{bҚZ0{fvp_ M .x 42pƀ1YL忱Ï/+ܼybZr$,F giKI@ 5YRD hd'cbBl9oYC
I]qZT
[>f`ŬXD^^5cVMǡu^-:MƶeCl]X kWlm#wSlӼj 6cOޞuU(< gc27KrGx M?>_^V%` o?
wo 't Xͣ<i܂FͿpLX$@ΣNK, 8.q\:01 A0DE~d,k\ Ɛ)c] !zJWS셒dYMA[gG
"rԌʈҲ" WKS=/?Wb<Na^p6y~?qu4wCq4g30 n^~wI$4$&P_0%~n_ə[p^&"E
NkqK$yǶGbh CaAӬ0T|
RRa[)&3/EYX:cftzKxhzlƆe8@Oxm9Kނsרٶ[pyF&;JO?r~љ6.w8M=pc5ṋÇWqae{@A||7.BeY &MȆf04U2tnvt6
=]`jNL ...s!}>l d9#}9,,B%\ oo/jx_,^<<)C9)1)cw[|!:yF)Gn^ < dPwS˦Q
1%7k+0kX5UEQnkoX mc)vw.[A}9t-+ql;jo3 hÅ#p(M 8}
N ܈(qlZ2\[0(n`չqvoYK"7rħWw9زq
l!:QXEYܾx \P/!>* )q4b )dJA^V"&.b ]1E2yJM@AF *
Rd5E9iqXJb,>RO~ferL,KCzI*/) )a ChbmT,hkZ/y܆I]@vEnS-{v?~z Sط'5AbZ\L~\R&+0ctx|L ytz% A.X + >. !ogEH:R8 {[KT$73ht4/E$b,^yӪpjNEc=Ů5DٸjIgb&,hsWêyYM3{ ӲWmIUjZ~֎ irsx|<Erm̞{#{cXDaNܘR ZYoi L`([}nba 36C4A ֎pbPbQıw[; `"2. b *
QbEN<oG A7
__ ^`ڥJJr9a-';LU؈0Q6Nf1}2fOuhXXU磵woYö
v8c q܊{ c zf.ލܩ}8 ]ric;i>I8{t;E ވbFof;o\?~|(+3鉜:qhhGǁ=)FT xxqQ|x>HOF.1
т u)D2*0SkFa&1< 59@32s(V %bqEr!EDj\
*bZ̢a[|{nj ʊePE"'+kQ]=se| ^NWTTXRlذ*~-9^<&ad|"#ܽ7o 嫗x ߘ` 5+OBr>W;<o !q7pVsn<q
qM ״WnЯ7 QQV{кv :[aMĂ)c0,K1}ޱkʶa6lMrv<UCk?6rv
鱁ضa9p lh]9o*3ܽr o^b ^?{Wcr̙Z 6llL}- p$
d Sm8;Q@Є@چط=&b? fmg t8Xt%Jߐpye1*.aшMDl\"q쯜?~{~}/_^i]L^\J)ٚcˋƛ36s$gcZ,Id\mc1xj8}=mhƩ=JQ;q,~q?.CЊgm8OOAW*GwxF Ic-E^lr?z ?|6$]r KMO*7qq{@^
qsrhĶ,0Ey( c1}|%zV Ƃ)WxP ϖLV"!z%;ŅQ?q,&Rf$J]Q\K1 4̟X PZ^r;%GeDG+gaUc=ήOWT6O4'x};8rߛ,ge!93酢b5ׄk}yCJsk5x$^܋G g܂#?#[&aݭ
cS^#{ uJlX6OHp<8W.͟F~rL;Vܬ[KĪؿ ϡ)\3'h$S哸rh\=`t\1t$nr H%4IΕ=UTXLX (afWsS]3 &f|
h
`nm SK g;X KQW*JG_'C ۡMLB )/R/FD#9!Ey"<O& e<4ZvY~☚1}"fe9FPO"
`;ko*Mok 8{|
~o-j[v3I8x ߋ'̞-q v4ˊ모V8
'qn ԯ"9C|z{|/cΉ] 8v7o+
Z | ˱ZC>.%*_X 9 ir'TbBe10^L^{Ս`Ƥ2/.NPƑt(:7x~=jY5|m=BNzJ Ӱab"e^LN(/ %/lbaQQFQЂ[o_~=<ȭNs߾z/ ?v:SoxN]}#3'A|b='7 HIIENv9
75ک|d'݇pW$z!Z u%<:o+volC#}; #0 {ؗ-MSaLQN)eLQh]1 6y 4ϟ8I=8<סsl9 jK9xD?w}˪9s r"<^a5厕se/ ɣsw ; .c )̩` 03U>
ad
C04ւ-u@j NpJ"&,ecs:0N8
bհ_kd|j-?OYiG
Sp >>A~8 ' Ċ<<dtH;h+%8z2q |(Ұdn :73ye.Mè$eSؑ w.;pbO ;I1)pǭ틱} nA"M3[˃+pv<~T>}On íKp
ɭu~~ܾ.Mٝ)JOw#.8"9 >4<$EnǺe4$prƕ >ᵳ{)06D` 3#}XGkĕ)inOy;"ÑGQ4|4 ^N6p9u3% h? w? mdEI0)U%4 [9CY_m\Xli]7/ ?<|?G)иx V.]HA]h] IEK9ķ2pفiU$?xx22 VbղrM+ okmXpѷG)3(3
I 37
AC]?
gɫbUA蔪2̝R ȹQ*D=EE3y,b i\aд 6`)][A̒c [8cwl =u=/@DK+ 竇i@Ƿƙh[6EȌ1lٜ <l`O`nGK v' ,h l=̬0`[f2#l 푐 x9[>> AHx(cbMĤT%g !1 1LK_qokoc()CFf
C0:'G Rv
4ƚ$
dF0;^&a8uX'M}'.P\>Fq7.IUWOxz )<{ w(ezpf"iY^ǷO߿zÛg 3W+K7CKl )-v$EC)ŪF*(7 \ƭkgM|оPS ePT3C0bW_>&j5Ӂ&hyD4NVz0Wpey%(+ݠ2F)PKvlf4UNԠ5"[85=- %ֳ -&
y"TP<l؊oR4|b_~KgQ\]0 (wn݈c<qN:?~? |I߽w gN MiTơKNۊGw-rAF 0a?c 3}=`Tomwbz%X"gPUF8gK@MXj!6]Ս9vaA}-:[aN M]
er][UOyq|&
ͳw(,+'W_<o kg)ܿ~ +qdF*07#&0# xy'.'b^<
V4 ΰ!pKkgSDXFL$ /
y07A?vo0
M 㑘I/ҥg#(OGrrϿ_^ʕHKBIQ ,Пm :
9yk7ʕj+`*
[vlZ4@Q ^Ûyw f<z-˧3^OGg9<
os4d^[ue|s8x?+ *x~1O/뗷 M/ 3#||_浍Xb)_<ڱe0 -e'd7/X;ÕBYqϋh"(
0k
Uo
+
8BoMĽc_ Uſ4tG(CO]64lľp:9%^u ŝbKE- 2&xx~7xz?p/[0Chر&{.ϜiSp!?~z+]=w{wv#hd8ęql&\GlD dǸӌ4`.c0G?~?r2BU>^rZs
Ta8,3o9"G7̞&4XZX[ !ٓP^seu%8w|\lgP/^=CVkC]c ^߿wݝGfth(?Q@kR; (؇ nAMi KC{gW{ n
5l
#G2(ɨk+C-"<2 Q\N f! ^8iraYq\93twP 2lhjZ5rڄR; ^ԼF@̋vf&?ЅvcKAl\6 Ь=̓xvA2~xx ^o>Ƌ9|yo5WN xr0>ܽ*Wyr pL 8?< =ǧXz6-!X(<|twƳ`nE
ĸ2 *(Be*_#ir*?bLO&pԇHpY_l?uq29F+aHUUz@Qš/tGW)<aN`,V3Y 6Rij(ӠϣG+-A$=zH0J(.! `ǎx)~3E& t\4.)عyB̙6SǓ7? p]ȘcK 8o. ~߁Pfp7Rj/x3ۃs ߹ֆľW0x5'V~Ԕ
hm^FݿkzT*'c2;X:;Z`՜ Le<6Lǵ#۰bV
/+ƕ&83 OԪ b}܁'ʭ n[kp|k"W7]y:STkZ>M+f!<2m} v4vR &}8RחVfT6reAQqLVhoϘ"*yx #>>Q0HK=@[email protected]{;,#ɸu9rs8 tLP%ObЮ2 XDQE<Ģzt/C 8k=Z@r\;fk'n݅khmal_́#&<uo Ż'(NұMyr+^3b{"?OD 1<<<~y{WHxx~#$irnbr7efK,Mkh
ue}SHsrpO+\])T
u(FW
H$ ā!iHWS!1>s EPTxnUTQ$G3
xZ }(@{+y4 (/+dc 0X$% (+GKw)7<44w 4ǂѺ~5uf2h̜:aO/ϟSx L:b ںE*9(/ ہ]DKfX_\< i<ĕWg5Ŷ.ԔT1 ݟBlq+).+q ͙FaBC3wf Ϛ$EOˊBSeZWb'ޮ8 ;V MH`wa;S-B$Dj+h<f YW.5xlEDLڹ 3!4 h ܜ +Gx#0be4$~{ ) [shh"5RQ;c)(` lM`g`pG|b
_Ȑ˒""("hW xW `ɲIEcou/|I##8TDjue\ʷfl"]tP ʒy"75 %9xt8NkKc^jlZ;MEV2ܶOin7?'n7>@Ls~~~zFq'k+xj/>(wqd{ E .=M
pwv`y\i0$Y aIgl
}}
!ǩ1?dz99|i",3='G 9
iQA4ΰ2׃><R}< ZSe \`n k?댤ё\wJ[BqQļhbuA M&,+
Kqe33͖5rkɬuؿg;ϛuQ?i<jUm
ײZ߿x;8ڌd
QcPU5&}"9 v0R}H ǧqkjh()#titѣG ()v6Ȣ15/OѰ+ĆUi)V/--
k kб}Zdrz om{p?x40=xt$6,i0;GWS^кb k<|o_ G _kr͓g/'`>y-\gqaM`h ?m,,}n0 IgH VYAPgﵰ4 b4E9(+JQ\ h*( 48Vi6BdAdT Hdddd\ ?b0$ƅ#-9fznW_?Yi${ED`ZL c˱N. S'KMg-X [GCuXmY\sXVbZ$D8c* F?[76ϏѢb[|q< ٱ ?=/ef>>>?~}m\<qPNob%k4ocT0<DžShJ J>y
\8Ks
=-uXF m;K
|38 z2x>lGNM'Zz4
ښJj:d41I & ;cjӖI{Vf.(̑_8,.&ˊQT^|ƇB,_ _YzK lbҲG?zv=`4cV _02^||nBFh yz, IDATq5?
GPtx*DB >ڍcۆ5PWO/jûu};L:V-ê% оfllgn|l\(ȳcc :ػx??Nj-o7 1_ޓ. ;c-[_ó'S1m98Nny 3wwA[+bޅ}K`-' ˄!0e-d325[tĶ$ +(a(͂$F:cҚZO^eIi `r.w WXsHyZ_ZnB DGbʔTEió MByN\M1xrn*u# ьݻt8=ǣydmC)V/c7ӵ
~~[|||
1.߾] x|zO.ӳ; 8{r~`Lo8 _Ďk1on
?&57[~=ipy|s\t ::gM`jd] k[@ [[k8;"b|x R%#bݑ(_S:1r@AGќiE|rYOoprc7|k@9XA(VP(,' Dž g?E3p >;:1oԍ u4XL<w~=[1kLvl@BJ<td\Y}%9~<vΦ0!(DF>>bkj o7g>5hkhw 2)}agm*WP65bŢihY=MԆ66iVP n( mX=˱mB 8I{gHWn؉=o]%>!W w? 'ĥ߿79.ŖW ˋ d|/'b*Nq7jFw7z˃ nN rAL ۑ
`j*L _M3BCYy![)I[ :G;\mm ~
)' H=.Wee/{;,xxvmk C
FdT4BB`BU 7b40cƔ a\eƕgb:HKز\'vL
.t-Ƙt,Y"/7 @J:+1"뫰mtx{X27O wObwr̟Tǻd1 V@ (I&>hwnK2eټl[5K]HIt\<Ha= #cPqUa0T
a 5 5U6b_p4Ղ. eWp{X٬`0r8++@WU*o3XSHY !
(?KYY}
_o/dLL1,H ZW5.K B|~H sc=fLX )4
sfLуh?>hx><jFipvt623PVRezb7jEω2c|pv#h]Oo@mc`~o,_ 쫖 aX9@Ӱv B'[2Uصi
p"ƿSK ];WN\\9 ;WӻIi 8EsgxDL ~t mqh$:~>
?}}Ms xwȷ/M(K
_SG꺺Ğ,UgnmK;k%!/-fۀv$.G "$"# H--& i)ye'7FI W лϷπxLB͘QXH̨-Ȕ5Z(wPLX(aӺRX)aѸ,5%&֏C-ƕbL8 iAغa!ԇC!>>2掃Nۀ"8f'Moaxk)oQ|Sdϟ|VOQ͑0;7[11; ; E0eȐ^PR#:#~
~{E*LuaB|k)d_ S *Ca,@[ŚFi~:
㌪"cz 1Q (+-X ((C Cn~
1"<w=
1gT̚5'O ѣ0eB5O'3 ڵ Oh4~xAN
!ZPb<27E^~xn D>kgpJ?Fx4ځ7ΠyLiL,yt0x2z} !
HMMDG{3V-%W,"ޗcu:D>MM\ۀbW*ۼد7,%QLX ڌ:q6\;'(nŵS;q^b%_\;g([V&1YX
^Ќzt _ga\,WKp\@1i ^]qu^ Pvuu C1p0 Sׂ= 19-= y2 DibۂhRLbsY WE[ObM AR\"CrP\(շ'c@J QHOIeV"Ņ`Lq*VaJU6n#Nk>B IQ L d+}|PgBFfs.l/*Rƕ$(=[/b?Q]%l,'_9-'t&W;}X0s
̓Hxo㰎/ּ;Z$;F\nc߫JA; (_&j hɒ؈|O3hK!iKD rA<e&ek<4",MuQ^?W_j
%eG?+8ϓeE("" ٹ9dX8g! ܽ~%w01m8Ujǡvl?| ?>o^+"'3IF
#? G`?'K^]z,[+0P
qu gD[fFP' QB^Cѭ[wBEش a iRt^~ؽq-ڨ _|}
lp-vQƱ:pV\>gmw܃;'wo߷aE+w<^'ʘdxÎѝ:?^~ 9? ΕXH:r%{e(h.LLH]7HQ *Z4 4!.60@
c` ǃ,0UlK[U~xDR3+' D
DjJ:c3?&ߘh$&!8 ь u}{Ƿ??_$Q;q,jj1"q4y9|z & *2EzPi>ok* gzreqÜ8)MBd0'@M/=-|Z}EbjFb__WfT+ opqܾu Znb/~֕@7㛘Q_c`Ϟ=C[E3ÔAy
tS}mMؚNV5}<ph zbP +Ɔ:4fru) 0X$gW |E nݿFhXxqQ@\,))TPVR3pu"V=E` rz\<sVɭO3&ġvb
MyC%Z6@Qi6"`ha*CxC7.Oܑ=xt4"ma6ڃC >=A˧V|hR#)^:p |-I\mA?+a4-s6QwԒޖ%ضf>wM+phj ;}`#Nv]wqv,>"'ɍxƶi z| ^=7d/V) G3 IJ<=d /W\$p++ޝ<=aM}8fpp w*raHM@L.bUBhh(D 鲉QL ; ?O [dHÝ?\Sg$={|`.$F.?/)GuTWP$l1}| ,L=];(-HE~V<%tZ xt ftKMBia**J3Q5 irߔR4-EؼvhCv~2Gq@+͍#454D7gJ
-.Ҍ[[r.hݡD9udɔ=x d8{SDכ4B(eP%ȇ Ё|| x \Q2LaH_() S|(` EI,տo/4D}
C@NF3H(<YrY0 m
i ƥ3+k ߿d@ q>*1vLV3_OE'P?qL1bJ3kjj _X$zt́
$9-em/
+M
KeCCC+)c(CzCCmI*+sց
jV.Dظ͍ѴY:[^
i&vĖ ѱvlZIAN=S&`<_$AY 7/Wܾv\
'Il'w69
ij{"Q,u/ fME$ 0, ~!, AR8xySĖr)_¢FQYplĠ4~ llM`fi,X8<<diňxdd=f4ٹBAJj
ECc?:%A 41$MOxy@G[__4o)˕jhj1pS:h̚\ ,BDb_>Q!hm@d#/5)R=]L1/ C}]1fN*EQ 0g̬-14 Q-Vkmaxrpf|zq
N
ڪR<yx ݺ@߀M"_ɧѸh&.?@?w)Fdx&`qu-zS@ Ij"r>y+[5rnAaP (
}0 C^ޝ1CԌ xD0Bm
X= .u}5 Us%[33Rl d"+S$ E>[^AlK0et<彼6u8L밸Ǹ2TdaɼsuOp_X't`ab Dp*pV4eCՁ ~!&D*+|cLmEQ$~?DJJB\d.ZCE0 [V-B'U fv-͟s'y$,E=YK좰رa\K1یt 7;Mѵ [c\j^¦3
<sNf*&o c;bѬ13c,2ң p/4XBT| i} H/++ 9yD g"iV
xݽDd%.4׃oQqq#HihEΚO[r~LF|#QapEd` ů? WbK*2 e +j)."56i1>; uXMK9})hR#hJ oZ$Dx<߫&R/LEY^ JrPULNYغa1
RƩrRpvܱ' ߋ
g ~Ɲ|Mk:|~K '?
9T=S&ʲa=uC?r~У݉_a$$";NR" 2=k o |-_2tľX1B*Jn"n>~n3e((M rshs$ b8%4~Aa
sK0n ,<JS0ulXހ2U3'rw u\҈} w A^F̺ܷ
7 @) UB['"k˧Ml^Z(#fan-!0Z*5> Oܬocu@Dzغz>7-B:4͛5sjaT-zbAX> W
8{=[;lYګ:<w:l,.5m8ݍx%V\VaɌ*;)+5P78 E u@ǒ>5
S A;U"Io>2ȏaחKݩ%ãّH'sFcT(×,/&Ҳ
wЈ0j
Kxj=iԂB2z}rhz< S壦,LAۊA\JǨhfR dcԁ^xib3&[:e9(c
8D,[2 m
x@oX`\>_'1Rk1ًS&ŋoyض[6/Ǻ8C,\0/ M]Cf<XC#<nNn={R!yG1`P\j=/y9_u2}PŋWSQ`lU"
_N>( ۯP6cPXL{? YYYϗQ41Y[? ů= [mQWW+WcM W3X0 &6'2;=HL:^12GTL8B
;sr
:q!:[De FO{n='.a0{{{p<**PSP@ƶCI.m]砝o]C VvULr83 -Kga*v6XVMfHN?L?"O΅bfY&c4 ܸ;c23x{$>ӫ_:{}r bI?"+#,,=~$XG'bX\\tua _$$D!PLupttIgzz?/FNVT$V&7{;,̕_Ë? n6ԧ) ~Е:| uu`ifXL2S&Uc2r`RU.&Tdc
̚Z K(반A}ެXd:1p\6 ]8o7LF;Z3E;oA p2v5ak
:(fӐ@ԻX;"!g+9uk#GY|z\RI\?,lǹC;Y
ӹط A._g bVJJ:{(` S"_ :#GȦ#JgiLvf:p0ׅa?YNq,_/J )(PT P{*aJ2њ PQ `
w! KMI@^N*3I,~ ȣȧp Ogε6iSuPE)@bф ?߿ ? +Y)$ VN+
d⠕CIL
*#=p6ܢ%
X06&6A
GAIañlT gՖΑIW4V.K( eݾ{;VcO
ٴ
9~o]>3{7?Љ#[̞6?+hxN d˗.Cw^(߹$ EÐDDPX
B 0#02J> ǂ El00 QOQggp ?< Tg_oYN. I A\J
ӑ
Ȣ2d0bbcVpp_V:&fп/Z$5BK}$cbviԌɕc3Q5X2sӭhY;(SHt1y>w JÕӻpATQ(kZƂ@;ܹz^$;/ذoDi֓5|y{[^1T6CH.NUDJ "C;IOиp&<!W^puqOG~(E!F%Ji+
DR+Ñaܱ2 Dzn-DWkF@Ero)_BUuc}]0\2 % W_}KB
EZj2
rPRĸHFY4 b ȥay>>KQ0'ŤiuXފAEؽ
H߱sC}B``K[gd'cVu9OQXM!/ Ӆv#&à9½xr":[ȫ)!A0RaۯK Eb9XD`,زd&75`8ԲDJ &Ot-pbئgvƹ=d|`.nŝMIpe:n[ یv xy0ߧY`<9ÏOchZ$P#%>1̝<@SS
@
wg(1E kQ]lQp'<| (O9"- mMx d#.)^L1OXXܼb,111'?c_d\XџԓM
c]ci !&xI5?1 G"/3'c|q ͍`+&[gm&;.WŞkp },lDh9e)6w "7ȱëx ZWz7 |z~_:ŁNۡcûrp!)on{[Y
["ޕA>pq6(UCEƀh=}
h)bĀ|omG+syQ225j&
9R}w=bPE Q++#U)0}ʪ
*`En0
ALOEnf:ʊ+KcvN&PS5g|p s)tM iY[1t
VjhͲ6?lN53 >v)cP?y"&b5±8u`; ގH -h+Agho] |9ÃYy8gQ+ϷBbNgbbX4
]K뱕}c`Mh[H<'s sgv5¾fZpaZ=ҁ
CooŃ]xvq ݎwN˃ yyp>> ;GiVeV܇EbE
x!!H\@` B8%bk#*ij;\=}?7_,}1Q(2ȉ@+ҳs b?#&I>¾'aȸhbZ$.U }?FWWO74#jLǗaJu&cL~ ֕b 3'bK"]<o:, ܈mPoCXhLTwpjܵ>
!~0];7ӻ[xB_MoZ6
wx}ȧe|_'On?>
?u8vM
:HV [\UmjsEr(ѮF
0Xjv%eb_F0d35֗+ ֝l`M시fmH7s4S+DepywM}1ǀA0&'|}e rb b@.˓('gdi ~|i^յU6}7_Ld`65~ѱj[k))I|⸱Xx&. މ;;p;[Bm~w|zx
˻~
xsƄ̔ypײj۲4a6- CSI4;F?Nqcn\[ְpnw N'wisq"c]/l_<?
/ ă3;~,~zt
>; ǯ//G'i4/o-Gfb|J~ }菂@X,3 o+e__IO91B̊I@M`1) 5Y &D"Z?!!^>aqd-4khAn kAn$.M WS*4ChIlgf*1kxa(h]Ea)hu= ں a#l'vِ?v`Lvxf\Qܾ|fv4!<bx,Y\v`F= i&xy4
.ôic`hj4~ Ngb[óx s EۈLTeTG.{M->V7χp%*A[K A MddqLA2 a$PYL<O
3
Z#A* SQ
[OK0x0ffr!У`7
INEzz\l(r9r1cz=_>c0tL\K0 NŨ"|䢎"@_?=uH ^=QQ OWWX;HKCqaF1JK) jqB_2 KgT!v&2ӴASf~1*/Du5F2(d
_O4LA©_8
iZ8
Ҁ}mKDMQ#Q0 )=spDvNpQ"t`\' ނǷ&ILlI}z7݃r_ӭ[as
w'&ia HWy Q 2ٙo7""Aq*py
b#\\Ʊ 0zwxRX8Ӝx1h F"iyȦQ- 2Q$[
˿ǁoaUm]hA]#(j5u9U18I44HZCЯwxYWi+ټ+fR(Ԡqhlns{[email protected]?O pvi^; {qfuxx( >C'o[ Ē.h#$J(] 0txr ܾ?D_>b3E(ѵmS3 ѓc9]:bp6X҅>
Ԇ@WOSCbe
SbX1 gC D1}csGiCE}$7Ôi CWׄ?HWC _uG# ÐG%II1|:%@qq2_^84J^8 SAq[dL|:G.<YQDī&Eza̘x9Y6i4gM𰵄6 F >ΧX3GvЮX4w&͙
F:#d<H @o@gl\:Vسr6~Ckcҩ(jwokƥylMk{qP; ݈;lOmaی{7٩.:/鏗-{^qo 4?//Ǜ;ex,ZIE5,4 AA$k 8\OU 0Ǒ(hoOOwB f60wpW |)s--y:c˛c*1BQTg HA^~܆0<?,д 5
U
B(U4աqŁӣFs bj5-B9Xpf3h'>c{q(J
ph\8;.Vy0^>OK4U݃q<%ۗ8&+2gыgqAYBQSLlRUf&Ťxx<~N}kَ@_Y_9ZZ030Q075(i # ~HL`#&*%94d_ǰ#CCBp09@U]4#CŕH#AG[
z}6Ac1|8"z|>~~v5F
2ӐEOOC q'p|
ǬL 7㗟^
BLX!ϛ3rBVV&LؿMoޗi~ .B|P=ZlC)`+AYN614-]Da v#`8|(<m̰ejh' K ,
bŕ~_X {)ػ|kf@l]=;|J\q7h,o#<:։';6<" c xyz^ o+{A|s5}xvzo# UԹ0"4Q
;W/b7-14 rş `iL261i;?xˉX+Oqa/{RK#./)CtB2Qġ4?a M0Ț֡Q αeL^E Z:011C}8W0:t"9rhlj^+p(l[[ j Cg
Me=ø|] q|;u"]b32})xz8. 6,ݳE|}Mܻgv(g(WcgO7矟M 9vn]O`f##+*BLSB_*j2?0Fꎐ+CijS*Q,+-Qj2q HC (L]`0zv X2\I!@cŸ-0 =m(BN~[!/Z8/& ,Waʢ&C~mM5{ ~\c&fx]s7 HI/7o? >Q Ɉ.u2
|ihJGa (+P?qB,L7 AV4a}g}-Ke9. ڎC]0x,7!ا7Նcz$7}5<ѹr1v_Uj]`[ l_7{6,ıjF\n*% g>Nn[x9v5yb > &ݵxt
?<: {ѼWbli!t67& Ė qC+v!} ĊjCCGcO@4:* prt..U ZQ"ddd1]s7h8g@:r߈W&t)(u- ( n X~X8ۖ-Bڙؼ[cI}e8CQi+ѹnDپnZXC[ЖF&\8F(4n߁DIM8s5. ۄ{v v 2a8MQ1"Fjuw
Ožݏzf n\QH?xF.=;à
4Zɣ ܋lH?χ!L SPTU+dKc /)/Ǹډȯ2Dd!4.~!t ݽd w;xÈBVfՃ. 㢑J#g#KdJOOOFFz\.>s&6Y)'v fM(Wd3dfEN̨)CJ,ů ,C6&pMDif<F&
DTfš$-
a4ƁvBTj 0,K0&?<o4)1pujz", S0# SS|P̌
,)qhIŪ XYcvl2jt`k}! .m^&Zh蘚]sgN *iY蚖ӳejváR n@۬R̘(2!A &1 l41FA8
5yD ~<dU` _Q1$xPl28F xODZv *pc U= k0<+;$%Ic_ q s $G%
PRTͱ.M\;GL[[b| g`o[@L/=* Ǻm,lXQ/W Rn[`sxs|ƀ58{ ;pxZ@d?{h,*n3ukya/FA{
H 92oo w]rE#qKBZO q{%#@ScLMJ>#x#9)!>EYa~$.Z8cV_0~xT L1Uhhl(=%5(* +3[9Zba #b41N$K;0F-;ֶ6HHGNv&I?%r -#YfJOHDݤ K)b<KV-CY8 &CL85-ý[WH1te>
E #
an0 $=iH @r b=(_WE!&i8$GH#i1A2?M,}T;l1? :J/䆺#\PꉂOd*) S0$>0LȎD]~,P?*
XW||\j0ǡ63 rQ1$)|Wajq*;sFe`FQ IDzh_Ty1TqK0{3PC@80nsXe c<WD""1x`J)j < ~pbbJ.p=lh\Gӑ/azLVycȡigL 7vOh,\?ZԡabСP&wq 2h(w=㱯MD.\k"{{([cXX (J䶤- e,8wmq~< vʲ[rg5||vE/GsJ %n'G̜6
߾~7.)d!mOA ~1\_K#@Վ,a0RVĸ2R DyE ΛNǾp!z\&MC*q/DUU5bZ|TNDi Bb-[h+OrKOLdľ(tuq4ami8䠐F "YLN+Ye1fn|fs YuctTO,W2v]#^a `mm} SژCA;z<4S^r3TƪTޏ
pANB].+9"Ŏ I4^ 2\I'{!6ގL"u#Q( ']P(D)\{Jj30e`Rv,&YeX4>
tuVj0%?(OĜL%)yS,hmʹc1kR j
Xd3FU$9$ə+8J`-q NQG w@ľoH }qQ2=m0pjQ̙)1u L2 Yyԝ2¾'G id(v#ԡJ766cawЫy8زN 8бR +3/ݭ2MѹlVymfP
;P4-KpR߳ZqŃwb'jžExLi2~~v|s Gg`\Y!Fw <1sev;w.`le &Z[hC]/LaiL[GCC
#0q@$҂9(t|be'+, aIx"τXN dS[D\Ҕ >hi l ,ahl?03DA~~.vqeYlEHMZ?y uo L; gäYSb:3.cTy%Mg6-+p"~P8R_ N0w ~HOABbܚ $8,1 f(F>9: չIHwE BeD\h0lW?}%$z#9 ~HwB*(3nȋ0Qa BlGfFE(13tRO EnOdLΉÔxLK~ \qrRc10
*8LX:9K&ckI7
cG'))iHJJE 2ATF{^(Jʿ
+D)D__?6YU VG\qkdA"_M7ctL:ôieLMcqd!án5] 4HS4h;64Lu0TQ,0 F`|q6fjsinZ[/kprZ f_> låcbEF9ApH; Փ||nKq ܽw/]xpe ]݇'.e{r0v҈%w[Lv607M``j
=o=haɧ@RTeԄ&,2Uz33hħE =X\_BEzVj' " م)LQ;f4R, 13a#BO1S3c莀<G {{k
+:Ù"<W`
|jkq% ٳfOL$j놅L.$w_o9U&#G2h U '!q fw4B h + #<["^ 4> q!cP`r}7nݳ4ް0VKUC`>C<R#dsb9ᡣ =6e Xla PBx; 1TA
BTgDku$X@&24jlG=X>?S`TPJ3)ٯYJHD؎XؚϾv;lI8
)(D Iӂ(@6{` P ra OB`PI")EßqowO| Vr>}{o
<xH,(0>h %9/#]+{|lo'`R9axk\~xF\: WlƵ[p\9܉{gwv6.>Xށ;l $3O 0 ];{x qbOo 湲9<|0a|h39>FXJ}=YZzPa,
6_F4nȥ)INhu)q^?a,Sli]Pb{JU"W#xa yx b)3eMHZþr@R)
t4iX牠@?E0SAE=FfҌ:S y"y L!i?"' Y%0p) i O_1O qEi |_}.!H.F2 ւ썔aK̹[DmyMuhCIaEq
G;@&@]i&eAw ^ }}}
>A_(Ձ}1t %>Է;TpgPm>a2Ç@GcvH/
0P #!0suEy
T0ج5e
#
0⫊/J*qe ++W^~-$!:1bB.&O\itq\dU9%J!%!:.q?"~_̾6A}cA%(U"811Y.m_ F^~<sH!CjA)_sۛe7EIZ3 ;bg[EbV\<Ԋk':qvܻwnÍS:pf=UQy|zy? _܇7!qűBǺN,m գѰ`"C&@kCR`ju'c:4a8҈ <!<7\Sm-0SLA\|1ƾ'kPP<c'a GdB*i~+GXd" AKl =&2Dfb 1*&XJAG #4aLnWKϿ+]!!!h>~ή6#)5^^/ 3[X[r~=zg ݿWqyH p9\^p4Q"\d;#mx;z#, ľްȊpd
t(O17ۯ0W֫Tzw<y0ui^5*/b
!9FuPM jÈAy{(LG(T}Lx4R }
Sj QzTS&ÇAg8<u$$Q_ ^ [rꄪJkPU3'疏! +/t_^1RsxΩ
=_`L.EGDd,y jhX^psw-L`fa@
0YnY)2
PA_Z2jMΈh$hs<'U_ G8HEj!C`@~HAE&z0RPBeQ.6X o?b_R,Cת8о Ė[q@'n]۳ oߏ'wx#pvަg{pl'ߏgK!x
cr_>LHrPkGU%X-* (`dKn !W *+or
uDž 5҂,;;%4bY4cjBln_0T*D#G}(dl =_]DG#ɧK3;b64Xj.5h2 Ƚb/l#Վ );9D^*Lz `@Tīw/a$ 89K_/W_yf@z?x0K^o`zn_W_w B.Ub|*<m`gW 5[t Cm ȟw." GK b/2#=1yL.r0_տ @BBgw(}C5lpj*}AcPoGC#tUXC s>E>crL<5Wo$|aKNψĴZ(MlhM> %%%.GVFҒBOX]\AiA& yhĊ1 Zc\\(hjj K|1 `X.$[ ^+1w <Y-ﾓndo{Q$N
0e X$pP:yq^3Kѹ|v4ciX
M i lpd
߱B58w kf[6. lŃxM / i'DpF\>)H y/njfj@=\EQW[蚘`6T5ԡ<B JjjՖ
s `滑hÂl xmsQ= S'OEPX1&qAHAUxt0A14`KʋMafa
3U5( \@0HYEȦJPd[Ē
3 u#c(ԁ ih0%a =C^9zrL7ݿ{n
|)IHC%"]dpS an#-< `x{RФCdV5rd;$ZT߉o7ߢǷѝ}&NM$}[o}> עc0cﺣ { !={BXW(s"Ͳڠ9t0"Tb6RI6&zNä)(ٿ%H-FZNASӑ(2 9)DR98"b? lN. tptFPD$bS3'?:))HHь_x ȲEᖊ1+!+ 9"22##2JURb%u[
R{={>?[K5OLY8qkm߾3G##Aj)Xpm$ s Bn^bb:XQc1Xa$Q#1a$UP1}e Avz<zmuToJu!q$Nqdy<>>>~>oOw 㛟?" lgϟs,UWO7$
%QWoϞߺ߽ox
_| _;
j,H:":ʊ"47{J5s0c,L6Sسg+JL 3c541$y!ZenZ\F\ͳw ,hmǵkQ3˸pBc zHI\gAA
qyf.*H沣(e̛#JUuUU}Y>B5yL=q"1K=~ m(H=W'm68)Ξ GKGR0b$FQ6؛#F6a$ 3Yw-УBbSGH> qzndFAV~d DlNߎddR誵tj\K"vt 2i6P<^xÇ(ڀQ$^`"1jpd#庈/7l\
"8ƍ|$#0^^
14g 9 cؑ4'dd 3)4a^, =85/GF^1IГI23 "-'_a9<:B dJ{݊[!\ +j˙y ~!f!%Jj vJ9ymSHs쏐 =}=Fh#GÉ}v LW؟<i #[\8CO!ugڝ>D?_>6>@쭻ՇGW |x~_ ~1 Zf<eWO_ >TI7Ւ1s/o>Drbxq=b
rPYZֆ:ٹV/b
3B0y]6x&RIAؽuҤh~7Y$ IаZ<v,587k`&I+WL/</>S@X)fq~I
SGTvnK_)\cc8_D ;{'M")N
_kA&҆c'` ESغWO IlM( ?a2}$[LGƍ!/+/+#elP@ P1 tdv$i {w1Վ(~qf:S2tU0Q[UԈb¨ hi
NRQ|(Q\hn43DZ=Թm"+3kR !h Cp؟ 4s96O szLߟ?9ˈ< 'ˉBdTe-EFv2s4'eTqC.%I)((,P;F
Ȝ|~fV#H *
-bUjjj/((?Q醍=㘡@ K5[x[W4{t Y; B_6 kgՎ4t ۽:Є7Ǘo?/z@n_~|!~c|GO}~ |2{)F;]+o'o?FjR6]M; 압h'6oY+W.V9ΦOFȯmZ Fc%NQS(LDrL85DxqD?\8n]]O_ǽW֓k 6h6jbR -,-$+E:ƈ\Z q)ľ%X v*XT%0 YbDQF/ǩ6)('}rx; S}gM# AИ {Q#hǏİ1prG`؋1fLydAb*GRLZ} i1{=暈TK
BNEn&MZU#43
);a\廧&2Y8> ⫇a1<AY7m/m~(10n$G@[CO "&{L yw_
3faXJhLhg[Za* ˉ}td .?'[lr%'"=5mӶ{nڵ ` 9JbAm-b~*Z( 111* @t:jLy,w,c=`A@PmUoi17g"<Y rO8 $Rc
ؽ)$dD 9@DZ UzJMq*i)JAmI*epkr-PGS -hWQvgZ F
n-zj0P_:-Z
hELU_m*#(`磈#IeKvh R# }%ɪfYSrUto=:HKAF|,Q
Κgň^8уƀm͍:1EC4k 4f7.?f
>EL
JVйddByi8_D0?x,M$s㥏&+1.hSekV#"+ o{0mƱ_L
ϲF( " #|$ zL>g|l&Ŝ6`Ǻؾv m#w] kaضfV{7zq(Lݏ8y),qA*M&)T#P5v4h~cxb`ҭ_"T2YΞ*-mPŪ͝?oB]rcFhD$0TAEQ9Gi
2X\YE_ĴTDq<IzrDDϣj" et04Et6م$$Yj5: & < |x9Ly,QQ'gAيxNx1{Z/C(4({O 3v,pU{8ޥa"ݾ^ml_ a#:! YĨ0_y)(͎Š,'UlIiSPS$
lڲ 2Q[
.N<|_j!g'[ZFslRq.tlD GIZSmV'b4´Oz
#X0/
>3 ݿO DžE 79 ^S-,UYnNt6ڹAUe!;w00;[k+Јx0 X=[h Kҙ_Վ88.:"ڶ+Azr
HE ajYXmby"8nO <y3 ?e(\S0w9_?+B&`$
*0f O0B8po0t nj@ m `ژXz#VY bX :kC`Òyظt Ǧ~ = Wc8'dLhl]KT^$a;l`$bvI$cF`;fSADR=ǍD
$ƌ|H i8YLĜAj}+)6Z0k2t筍Mt*#+(56;V
zd83$\:$<'Ī-bh2RQ\VŁ4ŢcZGg0`E9O!v4\l:Ԙhl`kGCK+n7iJJUOa32m泬A_fT>e0B*<`EՒK`Pݺ;˖i
ۍ$xY #H9(sJINb.,/ y*4ilr|*
x=Z^7TdɃ*9 Ȍ "mZ?Ն&
qndsa_/\0a r3aﶈؗŋfu~95cӺe0iÛ7qU ٻ${qȥ[M-/BǢvr${& u ZwN^Եt^~X0QTFBXTMAdd > *+J}ZX61NML5ǜ &O' 9MpK! 30{8A3^
h+c9qH2=qN)Xr ֮^M /u2CO[<x¶`Ղ\ ڹ>b
چ-bPHQqΛNJ@L =Ng5Z2a/>8 C>ju> )a> ?f4q>y$Jz<{>L]q )Ab[4woٴl!V.p{rvzAMPDiM g j-ѡJ S$7R,5AE%U ZPik
UeՂ~ BS{ۈv8=>RHTȟ~H4L8& hfL J= yI1grPXo۶6#7-{ZXwl@]H!!b_IP2;tjL 3a(Ɇ,lj|T^O8wQ;Peג 4pVCDG .zQ8> 9ɨ))g(?{f02`7B._a ?fk£qq ݍ(dKM8)tV ƹjIVOK w]`ჅBnrxף&zͰ:WX_kt !!ďrR﨤XM Ԓ`{r]'џKC;wPdfcƲY3\wVqO8n"BƇ`)vx"$P7>}>v0 M$ '&؈א-zŵk'/b_`ۼCvnîq~ >ıcOVꅥ g*,AAL! <ܜ`"x~/nyq<"m<҆ 5b Ĩa/L{?5h<q/uA`9*+bŬXhs̯\ N47OQLi4茰fbVB `2P[وjr~i|,=5M- ?z iRXe6Rw@did
Hր\& @ԧ\.
~_
$@^/ v ,O9kEˣ̴QRƌ GrJ'3 H0vd"0 s&c@qG#$ۃ`i<`D+gLQ aF-a^<` lx
TbhT,#ۿs=ʫ { V$f5>Xhut2
8H!3N.;4Jg{<8;7g7q\;2 ~iQQY
.z?zۛp
z7u^=sFfw#$
V 6x;`4s3`dVq5KW/@h⩑{ql?؟4V,
bS06F%hҳ~6m.j
IHuc&N(>7};jD UЀ},m4Ҙ ~!BD2wL|xt.`dOډ *]!<8$|16-tN,a1&5؍RE?Q"b4uFp|Xf^u.4I q'`" :=c)j3dP,XmfΝt2hj H+F^IZPӡאHhPE/hI) x-<>%C)B2.&$\!y]C?c
9$)iOQK^j09]$U(Q}X@ J-ҕԸ<u2#0sEHH:$2 KH6n\q4ʣF'3L N="E6?~|0fƍ|v}XF"㕐{ kycJ{A_: WVcQSM:z<zx
7ǭU_ء6e,֯<|p Yqx8L`6_F<yt nC\^D ډ{a.f ]>t7x/ H_&G#,<oI$ӊZ^3829UA^FZbqؐ`jFJ<Rق_|k֯֝;)BOcbta1Ha:e4پ3sa9 !F173|lrqI$DL{1Eˈ
؇$g -K SۤQ<CgӂFbjH:o:tzrƌ7}
vq ɲ1}G? #HF VߣH ƍ#K3VrH!啴 cHB> WHDBx}X
gN
%&c݊9]&m]ĵ9EH-.C&I6 uvi[98
$R|\XHUjϾ*`מ v1HCvA KR$+OY1}G䢊pSLodk@}S3E2{[^:$CW`ޒXj-Bլ } )+A&DR(I((Ŵ6 Y O"'}MF >lhs4mmgm`] l'ch8 G|OmY@]-6'aXDAp ܻ{ wn^".
IL+q8=d<֯Yf<~:
Sڅhe8/Û=:BO 6e%j C}]X($nܼC`{ :6Qe5&h-., l)ԠTjIp9*`Xd&e4D+ۧY
vm'}0Q4x kSǚ 1i6 /(7#c'aq5N `q|,DL9ef%&`$q?^`_f{ݛȾH;/m*FsΔqjov~mfPhHb_y#(G Px"a'~ȱįeZI`E9 G,? lP$/Dh[y/g5$Ṵ
,%e9 *=hFQH+"o4OW\RUDC=JeE ݻBJ2EH$ R2s
I_,(B!>9#cy^i 9V
*kkhV 4`Am,9z' ϓ5ˈQ)5{!$d"F_ Ix#lظ~2O!d'&%F>F1"_ O"ljc>1 |,cfx d~M{l^W-v.eTT **f WMذ.TgM "W@O#^~p9x+8oO =[W^-ܻv
Gp"j*ZakooA[k{:ҽu0{ap5`ǒ1TW5/2Wmv?.G-Bl<8U4oʔ)쇑/c̙3G $X B
ђyKlN&G+EA'uciC%sx8ۈ?5I 6m"q5L B܇L-"g d|rU@ 0bdP#^x1njgq O!VC8dؐcć9)~_(صĸdC8| ^ 1y##]O0D["}5 = (Hd 64q|]H0>#?CP_sj<, CDM8΅vl곲rl6M%Ņ*AQBU%~n"]8j RKdD(R@ dyd
s"٣+6M n7ZzU0A>/֬RiVa%1g<S0M4e2I&!Ps67oV:F g61b f&Cx 25`1&' : >$ ㉘6DVx^X~/I
&V-_ ]Yos].sz
%6T$$x.U@[S
Lj 8M8ׄ A! чqˇo
C(Aba$ Vۆ5H4{lAjM{PW 6hM%(@C" ռVZcsVڐ_eDJA%tt ˇͬG~Ivݍm")b7 خfc통Oa,Y /# ,]JOfޮ0k\,ݴ S.Ÿ30nt6~(1 ߐY1u\̚? HUم] s.\8Z%X|f̚8NT7 LoB`xNaNfL3:/W
KQ?Vɿd8q"ֳ̖ jDfRE4li}ܳ<Iɓ%[`kM73O&3sfIL3h<`ɂ9XNb IR6DE$Tf$@K6T߫gVe8PM1XWHT< ؏ 7c
8}))k& (QI6jjyAjiN )ft@kLoiI8v_zXMg."
EKT^B$X>0a$fwC?f0yO <ӧaU4pJhu}ń$c>iAajIit#)6GSERi/$9CBB_I^t6,ñcavB49n8%r+H`P^G04g8 ; -| my6±;P:7pf MjbG{.]Bք*"
$QN s EFqم,$ jk;SI##cy^ Gy[xv\
v4_2[0"DyF0 gM H|O^$^&A ;%yS1eD̝9SS,PALCr
VnF[r
VuC0c2ĴY?s6N;d1d0LJ<4sŋg`$|X G?GfE0;&"47! AeQ}$ 'BM#L_,6X-UNM
]4Wu:e"${P ,J?3xtk+܄m&yz텵 wӣX^jM w` l݁Ԍ,6J V'tF:)<.S:Up)qUҟԩfn:JkA#S%CWۀ9bC/U4IȠ vWY4DEIF'%L>4
S(ȧݗI q\K;2A`S` +g8 F1 s%>BH_ f^Č-FaӖU8t LVRhKqB \:} ~.L" 7~NϫmP+_>7 _{Euq:bE8mCnr|>t58w8:ۉ}?_J34ķ
D웉y=jl^T #99Q\H۱4t&RS 茧pb݆ՈMƑȣرw'nZqU2i36sgaJ0 p g̘31`'Ϝ=``,_<b<ZL_j&̤X<ש*/5sOM~Up>a] "j\Y| X`LF(̏LGY -$_W] k 5n8FGS5>ab~
C*ni3),gt9oyRs2}LjLl^l_,ySz<,3 ΄ mM:>?
; דmz= 3KsyQ3!:K$HM{ozr (6ӮHv\@CKvArF2@5<4vvq̣7/ ن\,l۾'bjr<8Zs.$ouh;,m0> z GN%+M
sAİ@, J^N-aLO L = (&Iv{h|L1#<N8#(>HͦϘ4[lDll4/GowΞj^f;y6,58W?STf7qn8w3n_ ծa8lF5?8DP/Z>x6\8wA*(7סA^נ8a>@A _bdACGvcHIQ'6lQ )蒺.5/6mڤvq S|-y>mjHL- =:~
}BX4o}xeS&O X1by V̜@Q3$},bk!sϥ= B=A\#Xb1يübɄ_;fb0^5cl<^ 5FFIv K D]D'gD(w$p<
BQ/[}Od{'T<Ξ>af] w
òųdllݶ5*5b z+z8^MFF ~ S5y,1WvþLUA _Hdx<j9d HƁV
h *X K$⏱<;!t~,\ (eMؓ-~
O!4!sV BbBҏ@I| M#Ι6K'I:j/@]F*Ah<%Xzd< )B%k.BRIV,Dv)rZ:Y2r
K'xwq?+Cmz8x`3wt~eEój 7 %eQHI<9d56Úٚq ^khMofj>TnT<0i< -բťt& Al߸i1{;`dYr0;wmš=?
Y*EplYbv( D(禍8
GcehK0kb^+WѰ%؈cQ d"9'7qغs6nޢvm@l<yg1K KsPgPW{|)B ^hԞ9
pBP(ɘ E BHJЩ|T:YS'a<?yV Ǡ92Vf2X3hl,_keez"lZ;6˱m N>۰ms="woh(Hut jvOҌ&tf
tf74$z O1G-I@Ό|D=X+,)Eie5 =ŀ~! 0eqe ljh}S+|lu
:"M/v9⓱bF,h>Gh%ƛ6|&>Q}Roъ|*Z+yf͞I"q2I*0$1$$
3|+a0.`&kWnB
9X:] u
a|<sfq, .Cݷg
*) hK6
9$$! }|GN 3=^%Llrcdž$!H؋'.oцH^jHQ__BsN7oߥM68 V$-JQcsġcB&U]ȭ2 $Î2C?˄bɂ(đ#<)(CT}֛R=y˶Xv5̓rAu"1y!b)k&m:ٲ10s֠ީߡE׀\lݺ{ Ċ
0mBL=XĽ\N¹jj,^0<x5kp \4Cix9TT$!4e_K.${"˄I $HxyڄgM ND;ı0 |
>bEd`ؽc="Ή][`uۻ vέKqd;4UEp HarZ>^Rj3N,;+!ҡDzD,$(_)!ըPZCjV.ҲK*)K+U &J
*x| #1XtzL ,{YsfҷSP/'Xk֭%_g'VYcI"P{w)ڹwbrV/˰~b&T5k`
UA
ZL?3c<h~d
h3HQS=7cypb;
t
_}:pNtc֍XHQ|O _qۃh8jviGC ' jǍog>FW Ȓ*] jhk( jUXMD^a9 F3̦Z >˖F^^
caNvt?ׇ 9@E S`~2h&\a
5ňI)J._5I&ٲf#F~$LJ\bS
%J (cö혽 3-?Kd˱r**b ;S&Ĵ3d
BOWv`ilB 8Y 6kfvuKKs(VD? 1*( A3(F|N0 K; 6` "EG2k(cnݲ~5֑۽mނll]vpZ E-ؾ%yۼn[Z**KHs/QU昙&A|,HO$ë A,=%:^7BCON'!.) @VA*jj`AgQd 2KWU ֩ N[.#c&LRRl\Hg~NQFK-^kW&LWs,E3d$Lа͢_qr\˗/\8G^[:TPz y% `k'"tF3rLJ4Ua!OS2"GO?| ڕO^ſ×8O0#PgU[.[4Q
Oi' }a7jNn_Oq&\mm h櫃PFG j:`uT
G};j0ա@cGJ3҉""QGwRO@N~
Yf e7 /k >} 5kTv
ՄiI<3s/ˈ+f
J I4WފM%b
Ǻ,79t0VLK?g|\d1bXru
~`"EHPO~ |lmh K
+[ Hxtz{O/\Y@ #e,$i31٦̠Vq7U&%s!dz 㱄{Y k7(ܯc 8ǰ]۱wz ۿ_#6?G8~/N'L hrː]
Qk2A #7' طwNPeH @v Q _
ʹF&H@ >? d)Rq{nܒl?U[@/#F$
0mt
9q n3ai
xan #{ !4?' ODAA2gJ̀&@/s)b،0QK⯩dg$ﭐu0`!)JC~adKuص誯>\9@} if͝EJ|ٛ >;e kW]3=|
#eO±tRdιN|s=]N~ fvyÉtut
uj4 I`x( H ZxlFBJ =ϣbgJ% Dء]T߹c+JEcAd у8v T Gag{qd; h@G*Ebvh҉fEkWit4c$wŪe4H(-[*[cf"%CD~s)%
w *,P :Ɋ| Q;0ZIo}[|}*5س}V ;1Gv#" Hm_O?8TYiI(ȌCAV<cGB%kjKʲcQxX*ɅZ
M^ ,j
>Ԓ>Znr@4h Y45lzl $69GbI!""y(顷H*F~L2H5[P!fK|T՚2 ဧdV2g~_G#n&̣=oZ ?tlx#dYi-22Si*PNRQ
mE4nMO+d +:[\nˏ8s
=lu9u.dˀ*v>3Tee+Eo7'7H`fO]i~ۯ>y>{.*Z?wR=#t$$Y
8_}::L@r|8c[a1ކCAc nVHNnbx([࠘4>PP:P1RitBREmr\!**bZ~bX16!"*BDD"*$yxxCdeQdB"cHVÏb>#woz=\>ݍ0dj_DM--6E8/")5mILK"9 N'F8ҥfE(I ϝѣ(0$gL^CݣMT[rŒlSd.='=QM<'f ٷ 1$B1'Eng( řTA_OADRtT\[ & 2xDidShlĨM֧ii W_v/Qg$%V$f(hjT}OIαdTZ
2ȄxdFǯI[s^I# (r [FhK* v53hoC-S؟H&bPnɴ:߸ wlCNVM%y*DUQ&t*ŋF q_$]f4BGxP
}7;h#Lث i"k
ISg$%Qdk/AO7u+n50vjϞ_~˯T Lo@_}
5,،7^̯>yH^EF!U85+) .@O{'ۏkG L[}p5tG[@|Ĺ3 #}w\iI),KF ڸ1 N $$ƨ&%Iѱl8|(; } ^{r
RPZ<
Mٴ{\ z.H7Ͽy|IXcs>,Z
KVQنk(X%k_wpv O Yf:Ľ/X<a92҅'O Q^
>&\ E G :~r2/c]S8QGq\Ad&D(eiYuj+cU
9~+x$KPSF F?fXvF7NS8{f~v NbO0jaq7f(=z]
JQ:~RZ*4znnYN {㘱8ݨh;?U
7@PYH\+F|O
)|z[oQYċ%xbڀ*X<ylfϘfa5 㘓\RW/E
- =gcuw~F+Ǵ u#>1ЂSiDW]m^
Z*_
ZU]=0
鱰.txjA;B&Qs,)o K Uۯ~}4hkC;ǎ-2t&¶Wo!|;8@6FR ML
M4ap$N8v7nܦ W)a
_|/,i5\ U .ڃr~F11#N?Υe."PR_n<x cG$'_＄\^9LDJ\h ]E!>xs|ջ˯ǟ~7"~ދЕkb $,Z!~i(XFO8oxq}̛O?"7o'dN%0rJڣ}8FyG}#?rt>b(1d }6C;{d#o {܆Jԙ50&S;BK[hy !ϷhqFlegܰL
vX>⫩ 6"EGf0.oqQ8F/ǤD-j)RJ/5$[yd
47|N
[<k$ !Y@ [201ܞہw =LFA\{S&at9s0adڃt&X
tQ*Ӑ>NbʎP`UY."8y:䳽nu&4ui:<Ӡ!7.pρ['xt.=5ӹ~-&ٙ^[o>z
'xx^줱p"NP}$6#!<և $$Q(-.j"LC؍nvlpqX9xz%,
G:\6@KXe aI 3>7EmUmvRH ]8vl;LW[&FЉ&GsGH#"WpTVUWnョPoU{窠G 29U d#';Uz5ܹ|d&!"& ;E+m26-Ƶ4رy%J]PmC#3$+yܷ?l7Q oܺ.+wzFdbUeشm2z (" #fR礢\
Pג`sɃ* ԔdX+s@ !`+C
M
4+yiDtV7Pq\;Պ'pF\=ތz}Q@qfU>YCfԱ-
Dnۯ
UBcqћ8&ԒI"$YjE%ȑ<Yv >hq 6de"&> /v9zwnj?M[7@I9B0]@ <3DzV\L\>?ր
~yνxo Ɂ& tס /wW}gpd .py/wpϏ&3>v4 \˽~/ SO߹W Nן=K]H;P4ܱb ^w/>+'mq pj/NRQ(N,uwç?ΫdҊBnoCsK+zz{10D臧@orPI`=_Chxx)1)t]iDrA4 ?V'q:v \r!K
dǡI xxh
DF)G8ȞŅ9_@ pvv*ʊQ@+k}$+?#W/ tEY*y h 857kI b8xp;ހMbEX|!Vőj^4 l
[~aܾy qmXA')-/ ( 3.Y[|4ŰhJ-gAgC_zcBN67( 96miɂZ>S=v7Nw&\?݆';H s!ݮ tz ĽdiNԒ0H -*J Eya^/m-6o߆T֚rRRUoSM
04<e #\u
*yR$697ԨlUkI;cyXiUv@iZ>( sYp⩙6 ଁTA"^C8
)
N7cǏf r_>A q߈KTO_7Ԁ pQ+w{}Јh}|wO kgqZWfΒضu
O -xt =gR#G)ǹvV`eXrj*(;W7/O8i PYRzO \M eVИmĻ|QҎk
frʴ
#J0֛p{8'bݪPTjF]ځ=' Q}e#)0S|CwGSFL yyHȈ%Gj^| |3=r$
D
ݵ7cz%o짏ߴ~)kW,塪qBEƎ;c8g+_6byXCq.%|GIn~ _Fgì)E6
M MN3 bx
Zxj+hӡmDRހ C- ulцf
wNN9ۇ+CJp<NbR_K@`rDoƳomN {雛4|Nj 8| k7nR3[v@d 36jG YUAiمE(*Q&_z%ݴI>#}+5w-=ۈ@.~fULv
]BL8Q-ِL5yIqZl:hOn-TΝ@ polPLUǃ6bӭ-~gh屣ٌN;)pb yW+ wsC C(,ؾu-Uo xFjY{94Uyؾ`|Tw !|z| r" bW;c476̹ бk\MиP@U6҈S fdTZ\UZ ф#Q{梊+5-Y-- dY M"$
(ן/Gk -CT OGfzJcuݧ/>~
o=rڌ\(ډc +wۅ]{7cPP: n|\ A8,K(#ic6m܈˗҇,ޝT`KQ(,Hz4%z*,
lTk3a0Q:<M3"`.G|eWoƉ'z! 8Fψ!^ǩ^:ޅmx|h/No7H$&hiKv46u rr
V-8x` VZvE+A Y~ K$hh ip)~(A&dry,$!'?s;\P&h=c+,]$
3g4 `Xj%d0 _RjԔ8`DAV<Ug)(ZL8k z 8>7.
0jN; ]nǫ;6^ܽЄ'g+kHTRp` Uw W/A\>ь!:0]4Rd}g [j7I*dPdnfV5 [ٮ:q`p- ]0{a0JY"_ FԺawLvEYeګf%H!߱Y<Ys1qTn uDKf!"bqLf)XDEo>|n NVfJ)B4fn
PR<t6//zߒ<|
JlL\*D`x<ۄ2s-vlZݛ!|F CG.[ٶ]E8z` #8p`7~ #ڿc
vǾ][q
(dd@[i ~VS4&"F}ŀJE'
A@Ok(CS49pU[@qQFQQm -(osaӁGe kt\/<*zN#B
YI{NowP;:$8$z^/ރiTSŮ=H
I= ~YIO5ZbԆrT$#X(D.8i(q!bH wo^gq| Yjˑcax!ƇaI#ˍ/¬1k,,_q w sWneB[hXu97 8A7x4wU_2t7pۅ
mHqS{H"xDI04_3x <w74P .|M|
|E|u\;݀}8,Nٵd|'w㕛qd
6S{.5e<
Zډ3xkS9OLF#*`0lliG[g'ϝE{wr w"[c;\) ~Է1gK/j-:I2 :xpz$
+Pg!.!ƌ°OabR e!BbDDG=}8/&-_GP l+bX\$$& $!G(ZO_=
LdӾG ~}a Xz } \5^=` ֍˰"l*l~D AfJ"i$
8 9e$%y%n
|bky,T -2>3I+:Ftwwx#m Me;_/VZ<"XplZ*h+Nw8p㱟yp
o߿>w ]-8KzA[#>blA/jjlj=즨 #9%ص oބ {dԃNJͰk1m 4:2Wҏ-vY쩧 aӾ#%'{tƵsx8nps2
H]P9^9{w"?# +^wnʼT&FzlNpjI`䱈 }P4L?8'a qaȏ7^:7 %O֙>ی'j>*>{*>~~u:DoW)fc R??}';gHeqa m1}rY6MuZE<}p
>3bb4nⴅh.sF}7|@MVp?܍]گxdynUh(-ƌ a#_Ği ("d+hd>IJdQXe 7x㸌Ŀ</> EYHHFj1b__ ~ G<#s0څUkbj}zb_+W!", a{o$ 1. H )1&<vHa_|LޘBb ],bԙ4hu[0#mtztTS,֔¥͇WWBJA;E"}MV _7珮=rx3b_Dd$~_AK^
`6Pc#UvBP}+pb/*> Z
Z86y}x>c%I <~ړ:uO<2[| ϱ }NQ?Ă,d ;-[sgܙӰd\$ąS`ƩY'?da,}8I-JX ] V$ .5Qu:qSw~_)rm wϴ66 ^ԇo}o(l?xx_}wNwݗT!uj};7i__7YOn ;O Na93`;)y.⣧p!~ۜvUkQcO NjϠWe| Qc}
0r
uZ7 vbopHn..ɤO. 1b*p'. &r Ca~a&>x O,d(EHgKv^FrZ=_ƿ3˷ _~>Bei!(>ދHb lڲ KWLu3s2ڿ -m ߋvȱGFG}H<6 &2 nSF#ĪAq>&}"YW!|uhk1%@<7Г_ 6uI}C]*^z#z 87\]
V|>s _ <7/[<v z|pYLh$,5& [[Kn00hRhKljG)jfJٹ ǎI 5=%>dH@R@[$0 M 3 %H?s;/?'ۑN+ he1w",Xp A~^:i_T8TӰ7݊6_
g@7W[oEe xh, HsaG pB 8af#tqeB8OqeWҕ -JlR̘7u+auw 7Bq 'qh@ߡtEi*uĩSW.@OLAQ~#Lmg;Q 𣡩ΟGK
I# @7u
F%JBh&r`ZTB!69z
36cV8 qI$g%Ykϲ( x=> o<~O ]ŬAQI
t(,bXIJxq0棇} >{mfe <*a.FiY1ҳ3AU<OƖuKn<"n%)+HE +Av&
"
ֱ;y G"'=^{ Z
YR myuЖAW 4U^f~Ǟ ur:Jh&A.)xsrÃFf(J;pb, ;/ǗΣx9Y<0tZa#1 KDa $ &6d\HflT5#9GcHxW\DcCI/ Aսpշ 쬐E
Mۡ t\N:1wUU.Chf<߾w~7"d (\ #Ǐ¸ j)UpBU+dPĄ BiA&Œ^ Pެ2/Ul c!n^FnP¦:
z jQsw7ϵV /. c' CVv)qρvO g8kŝstfWf<?CV/_Cw8?a^nv9 [-z
zk9>xr
۳;u4YYyH*PZa} ORND!H@X7ruр+-kRk]KGu*l0mSx˶JiYH(Xb-d<^? dǠ0=ei0WWύ<x$f(?|߾ aGg E )-:b:'3IBRxA[I +h}QDt Iw$cCv ?+G@^F<5$ ]^a
T
zE~C,Zj~K%:Mh#t oIDA;S NQtB'g<59u W} Oo
F4[K{/o8(<Ny<^y~BJ c'V_|+\M tE/v^ĠA/*Bt|EE#>5
YbX2;YQ)3K³K8@%HʲVoEE Nْ׀vԘm*U$ +_אA?C0Ǝؠq`\RLUu, ۍP[XG/ͳhm,hh&M8mSL;k N{jm5pґ QSk'U_ﱲh/+kql
M? [6?}7o>W/z۽ˊör| <ևo>~ o_T0%]HK@^6mu>=}V\oꂅv=A#ZY@Qi}["ʈA`1I]Ha_lYEY2lYm+1 HJ&:pQM"=f<Wx[(WzI(͆
)<.=))qG)6_s˷z$Ɔ+D[_cT)9ӆjjQ]N?kY8{+}sLd됒{">OlDnF1Naߤ}-HFuQ2KFIV"駴kT@C`
t-p؆3 \lƍ;ۅCMpL+pc'j/Ƿ w_OnW\XF^,zQm'2 ]~~;fF,>]Aai#t,*Rb6%GpQ]CqPMor=ZD&a_1W֬ % ҡER'miM?(?J^(ۈJM+`Ѫ*[Jt,_ # v7@_I̤ppl3;;-E
Z(k10BW7. T;nUvl j@ Eľ 0P xN\tU _
ecض~L?~ӗ/Ɵ| Ãhpt}]N æ
$WMY:zeOc(3=.$ ;55 i =D/L ZOt^ Q[c]/-07ЀR 8WAo ez L#LG1bݻUCW id@|jr.KER SC~SbWQ
ڒ#3*J"Dcbll"|o>Ŀc+#"c53'y% cRUV@_C )X-Ceu2lbA⫷Sa'_H!ǔĮc8oi{ ݏtܱ iɑ0dYK.ʊɉP]Jc<G~جyEYrsO9{]U8q7#PiGg{r o] PCgSxIw4>zxoݽ m E= g}o4>;}h'!!^ q G @YqQ5 YYr
gH IHE ,MLY~ 9u,1ܞہwO _Wk
Ո\n%LAI0
DE֬-,qXkqd7E\&e=vfRY@2`Pe8vzvlaAN:Sr?MG^~,R$# eD£р qVV&yxzƠ c>VYB3O $O0|xЏTFFҝzyx/_'i} Бt49]U1Z 7.<~CΨ0,c'$V>Wm&*Il"YR@ U &&"hJM5%f`8@$ Pl'PŐű>;&Ī̂'OMܺ:Be[4Z`Wkƛꌸ~ߡovB:!(vʬ&Ei9Exӳ߭
8ǩnFڟ^.֣3`Ǧ}֫l^I%
ʪ_ZEⓌH}ʑ5$eД墄d4U4VA[[m9[)|" Kv-ɪn ,a(B-`ɞzC EF9N;q W(&(BTq X8Ap ^}.J , jv=0$`$ DY_V\Dڥ d 4B88vd?^|LԺ jDcBoUXp˺ņvLv"gQI< Dw[p4"38_i0ijE!W[u`Ƶ3*/'I +1'"4/]"әK6RLhd&EZ.Ld%b0i,Qe%VuPqqG#3vly8eV
0hû$g}4S^WP,J2*&4i/&×IA֞AA(C{mK|{xQG 4 7އB]C7
p7Q,/NxZI8.(,->owT
STZ鈼~/22v`z[X
7a1OGE EdK&[ a "bH dƐ,/B
>} Ls*A é^\:]n<⸿WH ldlްĮ C'ΠbمF?[g ._=zlY1=d3rd?m§
rJQ/' w̔ӹ > =w~HdS`Tj(CEQ(HE8hG50uƩJ`)Vvm!l^c:)0ZYvfĿ,7jU-4:O:ha3Or5pb?Kxc! 2
}UĜVL[n
9mjk*=R2rOqJ4%f@kqP4oQ3R K+6V3Ьxyp77_C*7yeUI?~D-19A-BJJ֮_N Rc
a5"PQLX^L{I(I@ajɸ%{B91_<2 )|3,թ[/ij4} ce0c ";q'H<jcqX l56<; &'\k#R[8
-,}%>|zOD'YMIՁX9ݳg30:d&@SYmk#-nއt 6'"(oQh 8.\ Uq6)ujt
罨F]blݱ{XHU>(I%$@aiN|6?wɧ "<9Ѓ gqd-
kGwO/`oɳ<Lv;Ѧv
ۆ3af(ڼZٗF~CyF+8>DȮ@a >(2b˪V+UQYFX&
a*S&
Uw
,pהV] ,G"`b'\.xWoD_'8$ѕA9өR]k/{q)랭6[
{"evQ#ķkWon;gmMArF69ZB"2}ڎ@[[{6ve lp:TQ },;RL&uR,>ǚHT,)VZ}[x+Ry9M[7`9
S3kW/Ŧ+u:aVW{PYJD#;- zk⍍LY;= 1u/9N3V"9j;J3fKeZ؝M?-(<
}En/7ql W- ]wo; mq& 1eB88 '| z}/ȠO`>ˉFS Ώ+O+ĿǬUK(A ŵ75T=2}]'
0|
Ӱ¦sw^>,腷8 !bd$^˖R^R%@ ~XjH4$7.;_~%?~^ ~9Y)Ϣ 2
W'0Uk:I<ތu'o>W,ꕶ:u~Neg$=x [9$4{mP+nTRi']pZrH
aLFUE6rsbQZB
KhA%6<-J+`ʋ<Lx`,Bv^Q SͱTNN+߸6wK}xr ] ˃:؆6
-^;KE-4BS[t6]|~:4 hr
DG!#=Ce $t:iE Y </M g!k0d<?n;XWo_ŧ+}bHJkh4&c2]ߺ`LN^S: fD"=Jrqē$("6 e%i(ȋG9 E=mV0fSۚ;I$(2<9J1a k1RZq/Am`Gznt
=2c#(#<I߾_sbJlErxC /Y}"C"s
9HJ&$#,܆^>sVgiU3RDPj$ |6,GY(Z )|HHE(J C$8D0(x*% u6OS]
<Wݍ)2iη / 48ifw f}h5gF'G б}[T%҅g8?؈:p.:RnJ)Y4Gpn
;A 6SLL($^n7V¬+%1$ CSТޥC}jϹ):H kv .&TsE<h%1QHU:674@cqGƝSx^I-VO㳚BؿRZJ`*nE/_oCJv ¢qNΤH-,O`@| d,QҐmlVN"kT[/I%nwCvq*Ҡ9<__~^}xA~
OH0 !Ӄ YN()YPu #;5?)gO4:*KAq^$s#G,GOCrũ*TVlCOGl`դWNiСS>I?. IG7:V/:}&R8qb';ӗo_ / }*+H!umDC~g5I"^w
/_+͏`O >k=Ԩp}[Jpml X Vb}d7B"(4RIfAُR3iGɧe@=6 P l;e$'ǩ&6 6>ZmE AД~_/[$[N]L'nCQAPZElGN~"G{Y5(+A9(NG=vPU.
nܰfQlN=;K7p9ܸs
g/%LQUkFd\" :{w`ApdJ
Кک
8y;jeK:Mi
_ #:G2 1ϩE7`hqխCmz|"YhW>Sy7.tܹ*.vhVS NwS74
zºf
F
zRZ.v S.נ\oDlFbgZ^bAQ)\|פ2S2r`X0`Y"Kӂj䔕#d䧰߾y[||}ŅXf1c_a6l]OSliiEq^Nv ?= ىH:Ԙ^AkB.7Ɂ\
W7
5q|ՠ/ʿ7olhV-}OxҋǷ{T&B]F{ʭ~ywo
Ѣzڊt8ߎ|6[W>w,O mP{ gKM.˧z%.EoГywP:1M8}·0_Vr~D1VZb_c`6uPPIac͊HںEfe+۶mAj*fb,RSxߓsS(ʒG#ݗ],ı^ </)FYi&
sc7wb ϟU⻲ D GEBCOa'N kRΞa϶xU\zo_ g`uav*@
-T9^VV[<>^zvRZ=}FJ_w+YE =nz
~<lU8[~ڄG#o GM˧qq\4|G6x%Gܭ|,;e'@7{oG",f_
Q:%/%eHF}>?1"-glj:!G ȹS5Or~e7 7^BnGfF֮[)F j^-
+@:_T6rXG J C'(
}]KBnQ:85XO~ 6&"d\o!ooA_C]'xz}r\9W:[oxLqAMY!jJ`)V7/_&kk6Ռ8D[7F
5o;Gy/
/ d& ϋ
B<@BQ҈7nuA_ߏjW7>qtBgPVTPd :TZ\a_IJ߱6è/i2,MΟg<_ dۯωk9(+L뱢<?(y)F
'OhtXQr =*TrznT[X͎ZVoZ'!8x$ ށݛWq UcG{u0 ¡cv NO5}fb]/F'uX w{<cJx쥨~ wҶw_{ziڈs C].- LS3rto 6}ԖZqR ^iXM[g!}~~8vW/[^Yc;5щqCAq~IdY K
/Ax^$ ''GdفV (=_ ?s;/^Go^*f6a~: =ۀ {aˎm*
6-=٩"U4
X䦐 ag%#=#
tU4$u v
2UWNPG6!g>v^#t:qҠGF/EAiq WNH[f#MxB _=w_F|oTG)ծVIv[ϪJI\ZBBc13~}[*t8L$fIAѯ屆Aב,m>e?
k>Xirаԑ("sd+ eXj{0`7 @l >+p&Ag-!9}5y7 _ޠHkF
:Mfʰ"oqƲ(E)JY5EQ X_[ v7,ò9Xh6" ?tun|F^!RSDcDG#jKT0G)QM150J(de1\j
8K!3MmPl C<od4l)l$ t!8?ЀRfܹ<WO 'Tf3Q]>lR
"%&UE,H@DvȐr=~6"|4TMUH MMǵv7j(6˴,*S^A7Il(Ҡ!W/Oz/~~O vހ9-QW^ؽwy8t02ss":ZsQYHt{hCJ)*bp I,MD&u X
y Ve%qԪ
h"[괸|.w
b\Dsn\;݈ncU:\܊WqrCAk 5嫧78ih9>z;}l~4@!!rF>|y yx Onc,~ Zd O 0dVjH = $K%X ԸQikL١vDvQG\6hUF <]wd ޏXb?:\F`AlX+w/_R H
U0 hx/`X>_5m8ׄt4g-ǟ.VMq^G։K'{IkbT\8fas zl,V 4H/(EBz6Rsh;"BqVQY Q5 eviqLHX5 *L>@%
D8):x<}^ I-8K5B^">ܹهW #7s 8e6ѡ2|it:A3qogS4HvMRImTTCLb*p*iIYH#y(כi?^4_ ^j.kjU986/\&%Idd"d䧰/ Ox{:G} -
ڵ3LŴSxE(£RÖq!dg#-E z:X+xtS,NjTK\߱זF恶,MK?ɞ[3=E,?y$ǟd
{\ISCU
RvQ)n\f[*>o"ɧHl)ʍBRn >w_ kwnmAld~ۈI7B% 8uϡ`?7kAwq]*t-jٯ:
~mhU~_֠H(J;ZƴHx8vܡ
>|PeDGD"2:Q O1 ~<⢡.7?_KrhT:eFcť(/!Z mş~zWhFY~6JK/Q3hH&[=\8ލfNg%s'a} mhmGqy*Z"[HH@
q In2
TRJ
M̆2T UNBYMaIa(UA0l
hp2'ԫ](npL'`=Ǥ &Mq +:G.WpE5kQe(<6$[@`r>+EC&x 9ayďI3CW
$5-$ıbv6` A t 7}z-x!@
@dy.Q hS ʵO__}h >kZ Q{l۲C~Q1PD XBR(dDv<; ;]HP
MES%n̩xx䚒h.B[EQpl'^~ {|7|(֊ E"O>P<S-謳ի |MJ?Nvd`=Zn;Uu ^/KjXl8(ЌFlJS'd@/jQi
66Ti\f+65wM s߿g@=E"Ol j E<QY#طTko/[ƙA FDNJF_QT^_7=G/9~5QY)h2t5RMڀ:)T `/ FX4˗ Ot'0ہF?KMH_Xi@JNo.}#LjxT}")(@~I6j8%gfdl/ǯD uRnK]z,UhkРvONzܴZ kiK~l7N >U =|}x@(En~
5qR+< ZC<k;<^|09;xlV#~?6:iEF `$)U}r{iLW!==>q =]|y(1ܞہww__zt7wҐzPÛ}f̦`C >|p)3.#ee(.HQR)XRf+G5M7C$:UX]~)D*FG/q֙F8UOQ3TgSSB$z=54H$+pt;%|O W?I!% $-gH$#: Gg5K
U ltf)d$&44|g`f53ܢ dUifgĎGXjA 4"zEeLICTVKSQ[G;|C$ l1%Y1Dz (%b cY*o>o?DҬ
2xo'"?6{Ëxt{HjBVO2^ 4yR`ӐP@*eR\>m.I~pN50z^%Z#NJD ,ˤS4f8D <禪\V= ul,Fm8vllF"ނs P<r"]; Wn)scWN`Z:x(-Uv
< 1ƦҒt+TNA@q AHdlh.h"2d" i9 x~xs rlغ
Sg<U"Uj32R)Nc=JL@~YRQZVNaCVz4Rؑ (MCG
QG!I墷Efim$|,d. ]E$ A'.B&1h3:QGqi pB*?? ?\LA_
kM6;?~6 Ds] $lĥSq\^~6 m)[^<p;)dkξA R4ȚsKf_7[;,2D`r$Wc7|ji'NTJA,qgO"ؾe9u,Ĵsu6 9z J0>1Nm$ WZ:_|*~CF"JϱRA[I 5<4lg C5VLąCEi>L&#: i В:fb͈
Yա3ft,#qZqd/[?lv+ш>b9Mic1j'd|dg& 9(
' MKDUy Z~lP6tZS t iou` [ߌs[Kofa! '`)+Cxx$ n][CyNKG®za*H1` $ gD䒬15"L`cîIAD=!%?CisrKߑU5zSGbO"v4.'w祥<9O5pi96`ʬ4c2-E=o7} \I9(-B1#%v91OhonOE5I^#cTe,=B]- qwlP7q/EPIOj wO33cWl=`dp;-o0%5j\\:^?~:?ǿ=WO"`pg':ysZ?*JQq^
h= 0),'A ?ޓQMh
f eɣvV} e+7yUQEaώ
T(nFڳ! X%J1q$ ij9[Bj(*DoUK
[zx}
('գ>`/DGW&n_<>GLhaQ. V ;UR<X\- YXaT ݍk1͙SF
TkUAb
R3 ShcRTq ))@9fZB$JR [(S "jqInW <VaipwaDO#_c^lKxpm/p:8 >A0v6N ORlGޠv %PKL =z+F)PNNY&$(J p=l YyeiCu&x_xЋ ћn9Oa뷯?7ι#HPO:؟Q ܂{w(~YBNyY uvF 9}Qdd%ì:n{.:slH0PZdddvY0Aו n@Zk"2#CkuZppudFj]Y
U( AIPn{ggg~s֪?6>{#{Ws+ƣK}?V𪤵?Ǜ&՚"GM8u3q8nxvs
Ki0A E OxD(V3f<9+l1 7 +O&ug1!@_ =O$qX]Xm .&yVI@y"7 $_M2K݀%NH\"^kŵs)u\PM_W_U}F4moWP?
'ƓQ$}V4=>}}HHG Ncai{??ģi,ѧFf(WA,^ [<D,a4}`DNũ{pV47;PpƊڑ6VkT3# .S`(vҮ!qc~B$ 0`>fX2E 1C'ee=b,dyϟOWTɑLՐwN?cځ }|x8v iCi 'b 5k n \_Erdz{GѵĎ`2 nҖg)) Ƣ=Ц wwLN0$&C>bGca2ӣGKL<W ' n99p ܉}v҅е`NpN4 yV\$tsC8w OٝaH3iz6E1;"lyIgnZ
h B 8 mX22䣗2Ic$n]gF3 !좒L>9ٷI?wTG; i~AB!oRG}
D(x)y
b+㎆FxIfI*ԽH&ExSc4B@ $BK !Λ J4,iXqI}yCUصAhH0[t6^* }4dez
W
TY.Qf%[OT;K>3ڥHq jdƨխ@sZ
O믃/)]餒G#B GIc{qࡹO֦HH ZS\4H/> 'BrkCkG'Hx #
6vX]z=6yobW&Qݒc?I&,Fn Ee12Z-z'TýIk78ޥxuE,O$4O[
MйKշ./?罕%D_ḢFT_vH{5L *"%(&$Kew5)BK$)7I\@ $
А$y= .&:ϟ?:ß~ ~O [ sϨ];i ʑw*JgAiu4.@/z:hHx^U惧txVW nb G }z=afȃDPI2ZZZUy ^M=Lm%诿 )F5>' o?S5O]L Fy5գ:!ß| ~6¶fdz|-_Gy_~
YS:~[ kￎoܺ
Ix:?N5 sKkԁ7} / < d g %I@HQKٷG20 aX<ћ QC։a
o0J250ޕ8s 'OƉ'pI8ykj1m?w&8, ; gp.{pAq3vځ N"rTQf rˈh4D9WQgluY:=i98yx n
T\ ]>0*3ԓ)9հY~t`ɅXGfC;v >Iɸ)G*8m7tѪ6mm}p5 p`&K3F
9|H 0GSqkHjo >W%Àz5w'+#qϊS"'#y~UD%H2Ip_҉8{
u }VA.)9zDhVivO %XU$M3$2Uvv{?'ŏ?2{\ tPR<
x
JaxnQkG*Lɋ.~*[O^G#$7F1nMGh9 S"nXuՒ|ZE `,EWUWdlj!
4N֡KSxa{3;y[ʗ ୧xD /z{K#[uڲ* DIfx0HH/ Dx^ET {Y12 ؒډԡ 9eZ]# gmO"+ O" C(:+8s!GOʼns2=.'QPO _Byؾ Gȑ=8@[a<߈| H܈Uvx Z".bAڰI WR3
05(f&q8
;7}eWkx=<s $3-toAmc*Shgl$
]
xUjOlf耾~Fpj90>
/_罟8c7߽F 2 >M|c|M S?"'i#*.z`_(H$/}*- Z\,sWP^L M= SIfz;4$1fs<C I(xlj`v,?O?o}W غg/v >'QΛT gO624vj$ Ble0 oG_o-[o.x|:A u`.=>X` F}Z.-_O[-mA_m RƣM03`>2x*Y 5WqX?_g!Jgw||6>Mxrk%X@tm?;_w?xx ,OBK "]~LMΩ@
Y=9Mo <; Ħo"H\Y7Z샨7GfQрg3bEpz1 qqK8B[}!W8f ?GOëcjrPuמ]8xۍWɓذu's [".Ie5QL fǐa?+
Gp?w %_g0>8[&^ZC?U֣Km:qI&] =7鄕X[9ͭ뮀j65K04_EH`\X a[7*֬d »𣯽oц}wi11[\ɛNK;5wbqg:yP-ݸx99g0p2"qwAHߠ?P"٬ G_|;}uxr嵋J+ xYğU>/`\;p1RR:4t@'B{ fYk[T3:˂@$k>M0Ư &~Nq{.)tԈDL",ٸ2 X"b"b@o4%i<Ѵ[^*Rt4W\'1~gōŌgdv
] [_yu wAi, O`$_+"Vn`y&"R3p'lUWk`i %q$leNLqhW EԎNG8!iAQu=.ܕ|]B\&U/?o]wo}Xr;LMƭԠ5m4dC=~+(,y\$+id[F3H
f43[ØN` އR:9pI5ZYE<-zarL/QuUjӾia"0!Hy u Y{
$&ļz xJ=a ,f'3e#흕)^ﾺFX K8ݚ<$ O ) FjǁN_= q:[QԀFb+A43FC1Gp \PGM 6HPf!Ʌ?1/vwÒᒥ,~sJ/ہ??ĻV62m˧}&ڹϜ@5uhhUYCsVz]3! [ ><w pΓI~D[s!ܘce; tC.,4]#^?-|Ɋ/JIy{k)s0hZ)+t0=u5c hO~9;j'3aq*[ i/ݛUX31<}zJ%`nIjm.?z 褤1ޗ ~ &IS^p <q" ͪSt
Uh4fEQ^]ah(G=}(-k._@MUډ7o~;OInGG:]m 3[XX\F$ C" 'HM=MiG1xsHVGi3g wQSqc|@ 'zxױ0KtԭA^q.$Wk[K/IAی[DȦ_pGPWgp{a s8 X'HGc^d& ƸdZ㗦I5k5&V xrʛO&0,4I2
gʌ`1YyY\|L gz ,g;Ayk꼻
V^]$I=^<G?߃Py]RI
," Z A Nhk06wFӏ>u ]$n9'Ч/mDKC z4?*Pm_# 3~1-IxzsSM8Y &g#QF-XH:QC7oŗI`uf VeĪd P_ C6mmxH/CUo~m(F2>]`yٰa>,z!Rx\F"*@nh]އ! `~.:
{t<
S``Z3#6 Wt]n$enx6>ed Φ*f,,aqiY W@e >O"vJKPPQ | c ~٧tO
gZm&ʡ
Wipu`kE2#ӑ?at) Qqܻ-{n7P^|'/ ~
o>{y< ɕ2ҭGna%p.^Ec3uUo6^ VM;"QBn% cgF0XZMJ1r`J6 BVĨæfl,L&L
k9rm=Y|Ve$z%|>JR"y Q{ьd
?K`xN#y ȊHl Hy^oGcEw:>78qPP/KKJ$ &Hi /!F{5K:20#
'$~U$>OI -& v7lێ}hn)ASC5ݰ-h@w]rhPɶX[%^Gby hi* Zhs IDAT 6}{&F\{\,>x}:>x
ߜ ¸%:L֏e0܆v+fm̚6t2W ?Wuy4)>^I{(;*Ix
}{{( IUI8; /u:17zXkvb{S|8t1X- htaI
!0ue'+m,FWO+c6<{\[@/E*q!.墌X`vj ; ? bi֨%s E^?L[FPvC
`` +Oy*˸> >\ ?mBEu.{gxW- IGO %
-@# G;9>h5>3\n!KMZ`q\_x 3'3b i逇0j邷Sa F=xJ\ Wqwy 'G<gphU %2"[SȺT Fr&W'Cg4Aɤ-CFix-z?@; YDvZCāoNLPލAC ѯXE,&E~Yy=Y }| |M\_<
Ǯ۱! hڊPQ[&4uj19U]j͍t*"A./w*TnOὧsxHT4I wqk. :|)Hf@x"?2 6شH Pl;t]uiBGK%h8;p^W/~5η)շ`zT#Xa<C#4ƲXեy1:l4%HĈJ9^)/ E"?[T/FC\A 1 gF
<c Q!X&o%k@ai
qHQ-ZQ/cTZk;}Mǿ]J㜀?"pwak1<Rz<?!HMԛJF4Flx|Z UoLMP,#Gv]-#P)+ A@#t '`pp ^녌4i
tiw `C.@ zM[{Ak nD6n>M|ڴ͘LH8(Ӹs}cq} 7Vr1?M2G1;OOb @z DH\!9zʲ4œd]uY]J4,*B'(} KpBd`
Hdֲ$J0Dk~<o >wy
wڌ}{](/CgSW/&;; Ёdʁp..H>gwS'p5q7f$_> qH1qo.eEM2bd CHPLK_{%sawªo\4UtPuUuP]y9|ۇ#]Oọ{7F: Ԉ\t:! Ц=94;D՝<AfdbiM_ K0;>q Te.`g%M/vO9 .+@VMφU/لʒ|h;xm3Ȍ ӇRx.F.t~Ti|6:?y3/{wp6BC$oǿ#)ʤKobfv8avq 0,$>=@cȻ|
w]_@Y%ܽlJu FjP:K(DJ ;/[PRx F)a^eh:`oRYFڎZ F7¥ ݍȸ4]5:58yumjN`A
!/Y,ܾ9wy9Ŵ0iI = eb6;sR
ZDz`Z52Aޢj7,W(.,>( 1'G%vwH5rIY>k̴+Y7O"yIMݲs3ێKW.%Eԭ -,^? n3fF0c'S.l$ ~ ߚ{&zs,:y}xěCn_Jc,nCީЀGX`;si-GSU=$PT&4䣪" -(CrS~~ kRt}oR(uF_ Br8`Y9>e;U/"b% E&322s.ܤ(U
L%x 36
7/!o4-Y;5K0I۞%3tA׆,iVRP idx 9r]Kye~ko']koĿ'7R-PAo<_/ )hn̯bjr#YL%1G P>x1Q)a3" A>㞝^Fe"An T
[ $~<V%5uFt] ?26C @9
H;-h-@W}) uF=cWO<=upk X⇨ ܞ"RQQxpw7'qkeZ{obqI& L0?)0b4K;><\>s?`9)3ȒDL+RقJI_iC\2QwQU$c32r[OL8' ՏSaw_>;2܂0ZQ\JH-mw Vqa4##A2P6 ,M/w)<^4#ѵmHH# 90Fxis N*1ɦ=(ECU8lNwۚKQVD/CS]!j+\WPHݟ?? %Leф1Qj7w`a*27G?q7H ߎg! xfGA||$y5o#0uޱ؈$vNr;Ǚoh5`JEච6M
>%e!pR}~BC#Oo7}jlըR |}? GycqX|?O~c<Lc\g\c>pz$IpPA? _6O %jt8r.=/c/"Y18R4ǒD?҈Ʋ -2n XCm14BYkO
ik]* Ǝr:0A쮇 >M2^RR'tt\ <+ԣt o u+x|:^}Mb.9 QxCqd6@N' d\Ⱥ͋'aTiDɌ`xlw5(mYA wl6?F qr yT"h#&w3j/vϿ:X Gj@=f6k6?W@]2Nu*WRE,:8lH >inoǓjFܜ֬DX
BF&J]c[t QFPU|ϫkJqZ. =艣8q][qqd" 5C'O>>O0w -m4NW?
dGvYz3iB ATڽ @!RS.3w.&毫d)?#KvRUAC "ܟ>8z4
(ɼdDNAfGk@mk]TUר-m}ݟ?'jF:t >c$}ȹVti,]-$#.
h rVf+>HAb =8rt7jk1:B6:IGH ,s0:Ct-IBI 46mMێnsI?b˨|eygPq *Eci Z*AC9q7aP߂ n] Z~gW5}M8poeOoO*& #a fy:щtAUV pEHe_ T
4~҇BȂ DC%;U3)0x@+ώ`aѐ pB4qx >ҫ;\7'U :paܽ wBv:aAaA>:t kՠǨ4d6,ex@&~!~[O͇C nL FRVtW QZ҂\PSu
͍5hj )&)=ݻb۶o¿7صu+~_+.w o>^U
')}
R jnܼAK (YF3M)t2ON,56{_("_G!.} ƖT)]ʾ $ .хY8%x9 Ջ3M8#3n ,vz
hnFEM=*kq1
r.]6<- ?~}|*I$ hhbD;Rls']Bs[;ICv=jP&F o$`t`8;\±;q2 ׯ/(5<2N9Cy'6Z1hl 4w֣U} zzU#-j*
Xm
!T* ۅ G!A?r g4_iMOO=,2!GׁJ4vc4G֊7^kK 9aL
a0p7o^ B"ж *2@Jbtr^Q qI
Agp` ;CpT g"dHB}\ i'FJP>+ϟed|~_ cصo;܈\x}vIhߩk$Fi7f 3"3 i X&zM^÷>Zޙ';\ ~օ V#T_]ƚk<K"* h7Ss/ ^^sfՐ7{o4]|o~Ooz3c1>1@' =zt?=D\}
0|V?1*f1F1>{]a,"2B }
82 q*X $A(v~+mq5M"=%BoIPm9{ TyX<Bݯ(Cq@÷wo@o$F(ǵJH6I5<s/9cΣ 6v}o'>A!-eF 7-Bt.N,@ $ky8~t u;j3K| 8MP<Msi =zJg5ȞjXmHMV[hy$PK'ܡݸrZt?O AEghj
tM mC-uQJ\02 a[wI9Z6
i2Zl7I"RCHЇ QC8e@|
KJi(r"hvoLeHI N k ,^!AuYfU/FCTsX"Յzx=y^S9c5ZqK+jkFNScwnH# ?N7,o㵻u <\TiF:HcX0K f认_J<KuW
. *x
+QP"\vVq$~Ƕ-8{o
)'Qc} } Ng'$6Ă={]$XHICݿz2{Ὂ.Y!X|,<beIf護1<' I
G'3u<ހg|Ee0ԲLsA 3# ӰFPь$=9>p<6Z455uut".__+DkC3}_U PJψnZױ` .K;ًoj٠x?I*X~ PAa5.<E^rػo
q"BH
$z0И| ݧ=%7[
%h^K\ 9P{}V\<gi¼ GP_t :l) 7W+sub2dě7/֦1`vf8ib!\u}Dq\x:uS00V%gGרHMD@6w LV.7- & %G <1|z 0ތ L" sd Y'f3 F'JGEX:u5ɻǏDѕ0kjQRS:# FIRgwHT "y fo7½WLeH`~C#í$fet}@:$'V<Z6e#TRz:PLp(O ?svlAXM?/~?Wwqwp`< AK4`O< ͢twLJxl|) Rc["rD$ 3>Kd ( \F.*q£0=sdFc P.h;h$$]}T u e\z%jb(WOsw /ae2mO H.83gN"72Tx}4zKPᶮ D!H5Uo'#8 H4J@p|scj,I#5V;,HP
B ~tR*k ^T
m-}O~+ ~=F\p\&9ܳ4WsEbli##)FA#|nغ*4#F7k H&XgF1=>a([0 rupׅ QPK>?0 P;}z FM,N"2`}t >KGNlH1:: @$I( C(U$3
PIXk8v ڃ={IwO!{^^ZWK} ACԋ Iw"%)L.'_}/9 '.%p5zf !5i<;o_'w0==BgC,槃ϿA=1@g i@ZjTUsxK_< ǿS_ ï >ō<9W&N)n
mK: N f hz P?I(YN BK ha
f#J-U~``$N@ 8Fo:?7%9k vDৃhjD:R~#M(| |W'#8w v:wbCxeUGim3Llv,f !DÁ1hO]FI
2#ƙbmqu~ZrDay-¼fQEE^ K+ITKP[[ ]M$ vM= :³(r
EOi^>
z$zp)ut'T2Dm46=yH07;<{ux wd!@VjE_$ >H6z9ҺM,#ϹhGKM=:]zAǔj(
R廆gN$DrfDgRAolZKz JQ7U5~ 2q3LZ\ܼK*Ⱦ u6ڽ &eeh%k_Op; xI %px H`y[߸ޚob&kĭ $p_z,)]C'5Ӈ17=֤'`tY %hvMժ)f xE*m/3O>w?zJ1GkS>dJ{4Q[HHo3ȎRe
I>OGGG M }csh@Z ҹcsǕ 0yA}N
K >M xNّ AyL d,jms *q8-yVQZh &9/gWrU8y4 :]a灃DPPn%uM9)S.7R%H?4U~ 0
Y7 )ٳ
BAA.X}UFy7R\P|4:[^ n hȥη`\MیK(< yQ{uep"lG؉)/gxaHoLs!nD n q]XYZ$VS}ѱe9$`ICKF|xlW(t ZKh1*HXR_J$P =$C\N~Ē; B$ 2%L(H0SMΞ b3 ^VQgN쥣8@'cҷm. ~w"u~ vޤe'E2폫,$hf
}uܟIb}m"'G(Xl{pioNY}4ɠݴGor /+S'ZPTztc_eb[? ~?C|O;[b#АZb &f ijc< or$8 a
Z; \@BOd Chow%CgF E h_l$m>4 < ]oiBeMΝQe_@<ȪE?Qfｎ ~vX6=Ĺ Gb]8r4lߏk(ʛ;aw:eڠpP8 ualj K#ci%2cpx9v7VoL+$137͗yN'
R
6\V+
9 hmFԡT Cϧ(? aC҅kVN<Jt
&qc" k;1!m|oޠo}a۷=͛7+x;[M⺋ @rm7B+dT) Kk}U}zz!JQFPK˘EdľfJr6byX5 8A̟L2;F57zno>ZQ
LJtgs`' I}N}=;p $
$xP.̉ At W{),$`Yf'qk&dwQQy4[%*QS9'qQ >zHe
>z N GqQյȱtGq kF~ z|UWΩ9Qiާ 4n\*/$8HJ +6{Ie7@z鄿r&c6 Y0GsLָK` yߗYܩIaI ٸڙݼN5 pFca^' 3**PYUF
MT2 ^*>xrO15` 38t2tR@vh NV5KZ"]줫KJn+8ph ޅX (40$̓#$ q,E%h+r'ɨ,0@h00"lm*rTq
%h.Ёx>tʇ #t`i?UPo
&L\$#x x%Z7<F` ci\' 2՛@eȚV@:ZxTe>^' B09}nXl~Z2 T!)!).Y׳Tڦ#8 -
H$K]"!,Rv%KAK >bto<^0,v IgNㇰwf 9HЁ6YT(θXFL2)\>::Tr?{ ?_ﾎ~%TNbm1zcD{s xe+xqF x+/uY/xyKt~۱>9$99'{_{ v OoN ꔉ:n!QN@b'
{4ZA^ϤX?;D= I2,$pnCDx%;ȕN10גI Na.#uH U
Iӱ|>8! Iьa Sb4ʪOګs /GϜWFWJ_4cabnI_ډJ]syF0x:*ʚaaf,$@fAn fW
d_N-;r.!hL-8E} OLR70L+v p=dV|S<Fѵ鬅ϩ@k_
1_DsU4Q#9Zq3ưӀ` +; Ces o=^ݛ R$1hBevOMƭ{9i*G %r-T!
Q꽔#Qnh4v/Y O P=MH8(%p *sy]v rX
/}y.YfOXgE g_ıǰw6ۻm$)'OA]G?Rwݏ# @HD c
?;ߓQv+ 秱8!+.e+98F.U7S7nܠ/W6M7`<n|GK/bÆsv?t ŋg|vodm
I<.xmD}Fn1"@ `s)(K/dN=\=By &KMEp\ҷH Nl eHAٍ^DdtszxC-Y~=uCcY((u*OoFIe*E+8r ߮xx I!"F_<r\t".]ōhֻ1~ oz>ߢFNN<C㪡[L u!3sLRso.عY=0wQ4y
vI\/IK[%1 4& /)/Z+DZb']F}3Fܑv->hM 4>ep<lūק۸LKBA=Jeu0I{St)>B sH<r>*dx^,ߣSOEX}뙹zzluK2 ,O jFW }2ib I <ql,>fovG&e<|8b~."ؽ{#vu #G9Frddr QȰarl=z <cwÛz0g+ j/ sqnl۹ lozl}_z҆/ᅗh^6nۀ6c {8zvm݂玡 Gԁ,@RA/.ЙxNC^b1ʨNJSY"Ӱa?m' [ƍ; .w #|}
q*EpюG5*\y L-R'ZR1iT7 hȽZT#76nچ^|O報
P_4mGo8n$b}G ȝg9 -:^ G߰hqade\"O#ģs
) m"Nޏ`bzX3, 92|0k9Uֺ}(/j@cB߀kX`: hV塦<ʋΩu2W&bdz
b"`(y@¥GA\s[ey0k/!aڣt*K[&O!Ƌ?m*u %S0|x DЩAog@ 8Ƴs^&=KAp PݏdF@ h#K1 }0x<ہ?`Y[x\+/ā{p.\t7dMD#䚂.4c$%*8tXB1)I[15"`lB
8[މ{wa; $
;xܸs'6ߏoڂ
|Nyس 'oP,{7V `n2a, N\I`gzjS$j$Jb\5(rDÙS
:ʥ,R 6,fӁr30)KԤ~ ;veMCiD1@B.єOvmzL64\5 ;{O ǞI (1|mZx d.5]]Q:/:ht@k Lmih4xIj- ITL4(5i!Ҫr ?GE y:@zHx ֛ }0 nʡɉVӋ|sdk@Ls3<6tD=9'o]qN=CՋt79$.t9Ch*AXSE9H̪VU31$}d <{@'%"#p3ɳK)( > AJ3 e;퉏L䋩{%$2;,bZHEzX( ʚ|<Xm$ j4#_ cb~yF065^2JKgF ػWsL`mkT I®@^WB8~K)k#ͅps!bt] ;m6`?o Vͻa3yN>q#zM긝a#u~Mxy&yݡ 'wo[' UK
Ll:70:O Ot$&`4BcHT!;M+ cSU LO"H $ YFl4NjbEFII#XLFyU(:arftYqeÑ q)u\]T`غ0~K/c%>M|oӯ}_~>b>;Z` 76 U:th>:"aa4\JB\2I 2 :^ZY#Խ}3@jDʮy}yM"Hri<o'Y8rpJ=aa4H mksdN݂}/|װ Mk;PvRr8S
epi̸6[adIxl` ҬݻG4 Jgfd!#`R.z+efReI)=4@:@0DDj,zTr|d IH; CՑ'F{~[x-LM/,b}L.a#ـkD$$x6vS%Ps| <a8]6ͯd~1<?Me$ }?
z
ShګжW{ؼ-?oݶ۷nۢ oq˖I,uf .7nHb_xE~fno7ߨo᷿>Vw'12[,'qCy KEiBh7(A !2dS#U{ K+YV}Kb6P LRwWa MPxB> z:[ٌaS_I^0uEReEyC3:-7^x 'H?͏]>&ƛYۏƖ^W fMEymmեdZ L6+u /#_&mE16H@+攏,P;g1:50} 9ЧQUɕsu.pIF ӥLF
c*9oF$`&N_x( 7a/`;7:[kLPs ~7(pJ}Zzg
w#J⛦ FGDaw< q)YP iC ~H2&eɦKQ=b<
*h2&5R :.z,Kv|!:wzW 6|?JAv7:$H?OկN,eL.a<
Ko TGF0 "Abc%n c6N·J[Ч%&aY\dPcĬ hAWOrw$Wah!]|`ۦ{Fݷ]lZm`Ӗ
xeKذQh 5~N&xlގ_ڄ8g zZJ?o?0M7w?yF rֽE\[oUz,¦ M}dr1uVo=VcS%xR%FoM(XJ#S70'}$N<^щZۛN"οI#31A{Ov* %ɱdVMjy
v҆ng0E?~o|e|Gw 5Wׁڦ:b|+ @އ
l.bo3|>5`w~V{Ar4zvsf) <\y8pe fficahF04>~}
4PX# ;aj,GDۆʜ#8e_
[7;>"6P. _ ܌Ϳopalq`ˋ(pFH$ ܸh xdI@,c>BUKL@CfB/p%ob
<X$7Tn~+'F % c:1QXCiG&{:ʀgp#* !}~5 <W xSC@uj\t N
eӰE'~m1SX$ual0w$2 =/K->WI߸ʘY+ Φb=$aNl!`شg'* c;6+4+B$HalI,dV\ bqT
a2
}DqvBIᎦ5-C2l 8s"M <р0Hg|zwR+k 0vN" KIv# ǣCvk})h._B1Ғ$}"4IU 426
4 wHW4µ"\-B䕔;4#$(ټRkPҏk.4x`q&YXpoIV3ʁ6ɴ0,tn
- AFTNU |,E3;`3iatXUN$$5tTU ?m8Ho 8w;.p{=ZsϫT QuQ4G ak+dߝʢX뭚r#t.[bNx "
XU& $:EdQvLoFk4Zi,}$7c
~څl e'QR% ,W]v~<dp؆bi/˨(9M P FsyKÌ<W2t?nlgG0>`ܐ1#ZLvDjܷm߀]{[ oی lٵC$8< l
$ޖ]|8|MUo)Yq *qI5UEzo 3*@e) A":%1\_%,p J+iLw_#aVIHq
1Ʌ#nTEwݎ:QtۂjGXv̆~1.H XfD5&[RjNԶip+P\^ {C'g[Q]Y3'ѳ8|,N]ߩ6x^m A]GhihPHd&2t b` eI46(=8ʚR$
^ӥزӗ,'8Qª|t40p!F[ho@_S) 5"h)3q u2t =Qw 3Z]
_B9W\Tv !ʟԆg
IO*u(IMiЮ߾`N>FKIV A@v}'Pe`J
K6A^vOH!b."^~d*I
փ3^9YͲĊ eIk!B*UqH0At?t~'ZPT)%\P(*Ay)h:+q!I5a&,tPx5)^e"$O[~qgS&e6D Ѥ ;6o[H 6y$۱]7n/-[l{ $ It8s)v5d"vTGSU?*<yW <T`ZI"^cMuH7xaz+/Ӑ=%XjRjRSOH)*z.mZO]v^_K\ $XXYTYN1E9"_IP z[\ZTV E~ڱFTԖC$rJe-.WԨlQG;Hd'Iy )#Yn^/m~?<5V=w
ǎVVPVA=m&D0ymyykx'K;8ƈvi
%t
ZTB&6t@Vsw#i9+)?up;[_m/Ȯ-rc ZiO.^<jځSZIJ:dm_{u\O IH1m[#OR%,0EGBnJ %F |_tK$F7md\2;J)}JxVvbH"YٜȪcbTz' }Viy?0L&b\rErQk)ՆZ ~HUߟ'Lo#.!#^]iL`z5ܞ 7&pg< S=Q{'n۫pvvپYMa"
/gmoڀ$̿el]µڇM[i6l߶6mƙQY id 71砵Ws9<yh&%뀕Mh9uZR#А5.^v02GۈH`ѕ3E"<0 u?8Ov m4, v꿉dÝBw-$:A߃@sWwiC3ݭJpjmj֣
@2
߇&)U.8rʾ̹V(TmO":[is!|P FO 9F&gLC*D0^ګ{ u?4T0mm0/E3CׄAk]
0Pmmu,;CPn^/bMطe }}ʔ+ /*#onЎWoƭ%DBPҴGiX0kh$sWl6 }ft05YAH2$@<^H?qetNV>+gk3L9J2ue8{lQeB LEjjA 풝\ D//vϿ:XpүAI}+U<4jqΜ> y'3AmEK]f8&ZGpTQ:Q!QLO [x0 TL!|FH05*u'&(ػ{e.lٻ Ħ ?Ev ضwv;V OcQ|۷8](A^Up==jnO|:ƍ$A${I%;貄zHit86=O٥(pd;h$ j{S(`T LT s볣JdwoH҃(5 hJ=4].TmT|?/øT܌y8s2N:ϣ%J=HF) 3II C /r dIn\QbD56tCI)6ng4Ȃ &X SVlAG %e%,iE"ݎ\k|^@S8yd/Kc+عk+ن Lh2*
>!=|㰵çp2<tn.~ NXcg|$sYXRE%@w|Ih:NΤd"Ibk=s@}'7K /F8vԔ.], 5DN2:EM(nGn|hK8vE$V=hj@*;xҔ0 Kk[]!a` nCt0&L
mFWUcOII%j+`'aaㇰe:/A9 1> [wx݁7$ey:~~thPqWlS,MgTD{<' .7=%XO(`1*M04
Dm 䂲ۨ&e gG@
РSqPxi}]*0N/c,\ﻤơcNס u
CS 8ǑSp&G^qU\(,Z8m:
$*0=2,~deHJ3h\i&wP%(,<Wl$`pP&-\i3G!A)g¹ y(**V
k ) nƭ+Sr|q N߆${6{CWc6ჱmp融|jL]$#me1 !&X^5MƑ9}H;O^C*AȐdiFe'JZ/'gD_ESFu\K OFI`Y(n}/L
9@Rס q .Wpl8y%$6Hj:n6x ݒ0JHBXAI8}U3$
cR*VzYkwhm쬆uWgFWp^ : nî}{ھgvک֮=q!߿G qlUB KN"nNӯ=mԉ+͑;T]4n,O`0 @*vlyy9J edI%c``k*ݗC'e>0H.9uxݯ;hUGtyBe8$ݙ"B߅&Xr $1hn$4:؉h2
uR я̌ gą8s1G_ā#p$(f 7 N`FRRi1<F`srR'
QgKQVA @0IJ)Yx E2M s|.a4PQz
UæiI / ?8݊;^-/cm;P_p s$2ؽ
O D|o3
F֨Sd!B !"Hx@<BOȽUy 0H;./A"
{J R̡@o,89Jl6}jL*{@2 졄"rrd,I0|ONI0v\nCNI5T\$a{zc7j[z>Pfߔ,$4f VbDK 6Y
t] Wk\mpuUBR m@ElEwۍSG8HwE߳>v=݃c8}4 M^EǪ'~U_FAc5P^O!-$CXYBRt?&F->ߞMJ
>MYT IF܍N71|?kN Tlc6:.#HL/0d#?u3Nx?!Ӏڻ;8ԸdSפ?RHe={+uۆʆ^vJ߇n06~f/N8wvUQ%5a_z5.z!G$} I 1R8K=6PW,N2lں2DbaEyMĽv~Fr9 0GAy<_2 V\<VwVgmB7׆ˌsʗ &۾ell} vnƞQA?Gy8o#.ރ*v0Su
6xȩ@ 0 =| ~0}~`:Òq "C. }d '#+1 "XϟN|CJ2RsrG)cX26>L$^ juk) :AO8Qfzn? !Mk@Yc
)xM-*Ӈp aZx"Q
֠j V7 ӊl`X{q㊡hDk/A_K:R
S_=`1SgO峸 \/t) =u'N #=(BJTf)[email protected]>{gU:\J.sjG_+ x zmxh= 7ot,nB]\;(;bX!Y.s A L:R! 6x4U3?ͥ8K!.zzk AJ!VLotI@
C H}C9X< ,K`~/N\ <ç/reV6"͎6kFO_ a7IäWJ4ңtR 4%BaI!r y_O嶓fH (:2:ҙ4\m:'+*ix
XYn gQHv|ygQ{ lǁqNqؽk}N SQ\W`S9sPGdԴhТ} ~Se J9]H`V eI|ɒ c9?YR]S
kxpD1lsy_0ֿG4ewȒɨ
;R)v3#4H"BBOBv7IHki`A+jS'"6TF7c444r4 2'Zg֓<aPLn0$` $cRntA.H¦U4waŕs8q0rDyP\] H>eTy ?s O QkU
[^+_@ޕ3;8ܙU_n=.;ۏ;7棳zU%@ H%B4dMee u
46:N[]]i{Hi'm
%I` .;rnip)vQE~?uSF'%S{.m@REeQo\h
١7Y ==cywpb1 #a:K~^Ui-} { A_=&4F+$jihZRiKeOn@Gi\rQ,Ir`hr@ KE@ Ds zʖGֆ"؊*|DS* 8 ً;
A=ߊ
x_R
9 vCHR@p g|\ECy4t5GfSI2|}*%pIJ@iea& 0u 5(g'N$KjIPZ*+Gi)KI`X|s\kzgH Y ِ< !խ\%̽s'v#V4Ao[^4< <$^4ʟhDf:o'eE{[[ \=o-C KOv5
Uz8q h^8bWjuZ-:rv8M; ;vl,^x ظͳJ,1;SHt>ڵ%$=묣٨Eh`2}?م..,F?7!Nps u_6I?Ȩ-7I#A J ^Ue 2_*ڄ pLtwkИ09c<a*`EС!2
Dfnrm8t
Gb 8r"'J9mls sݔ4qE6;I
?}@bzaKrK\$5Ë7E|p8fS~d!Ifn>ٽu
@I]li5}?WI1Zjpa\;{T+䁝8{;vICsC|صvh/<_AOS-µh$Ym.$lZattt`ӧ:>Nd{`3^zK#}b:F86V]J)]kPtQgՑ=_ögj UHG$dp31A\7_sY L/jlT ܅ h{ :y_Way :GQ ԚEo
}u* UyaUӏ \Jr_oHQ*UQV8 >O871زqE<؉s=Oߥ7 \C$PUSzkM
sbjSG0z`JzU/?9R:iĽabNqc ,8>0{9:
=e$d{c7H0H**kсA(L"7\觿DwΘ#Ab/ 8nԥJ ͭ8[Grpx3B [Tۆvmcz
]:[Njbn;!%8_B|:_F1KzTP jnM]0XNQ63І`#Ͽ6A#t e{X| Ǒs. ESw|b>w'͛pؿڪP<5Յȣ_:E85G B E0 $"vׄ`paN٫x4{aD!hxʊBǣQp C_x!j %%< q2u~cģqK1tݞxi')lfrr4znVIba VM j(o@MeS[ :-
S =!tquʢSfzHLEź)t$w F1`Pkv-ЂK!w ޏ#\}s/ؾgن vbwNa=8@pY_;Osk13H I6TCX&LӓC B$-\XZC! вyL"T4]jח;)5,Ag|ɎJLv j X$P)K!1:o$0x{m!kAPH , z 4"=W}bnm{}QqL |^7ln/_
[(BN Lf!ymhBi%[Ib~'-fSu0t!TjC҆QEaMTJMo.$H,9?si@N ۧ. &x8aj(.S>z
BpBޅȻxt.2JI"]u0zVf;ANR:KJ K$` W;!D36gi<$h
oU$C~o\H[uW\>d(hHԮ~<R+*}(6] }:4 m͵&`4ՙN]#j[ 7 =PYc&hÊ&p Vgc 0c"iQ3^K'b~#B~ rsϩ۷`u}/ _E
FG!eFI.P;eۄ&? ,>{7a:6s>~M㻸{co?{wn 3B0 %]`M@On$iL@g (3481{UexI 2fgluEx3 4|DI'jz\ :#9$PjӃ$BpDѥsC @Lk=#LM0ґ*Ԁ]8z GN<=|
:(cs.k4KNFY ̴&ZnK^Ri$YZۂZ-FhvW0zIt6}sÌv#MkC~]9v! ;B_:E lڃ{HUKgeW 6,I
OWNITsعs7v>}Zq)Ӌ%*!A'4=0ȹS$JE _ Hd9%&*|^a HL 5?_fo\K9g$P e dTB Vjd}\ Cjd/vJI߆BVGmkmDjs mq:5Q VކsޛNQܸ1̤xV H8{KD<} WbUmfMҼLt_
|mA}?s8:u.FQ)xW=4 ]pۑZ1~V #FWw$J[K[丹Qt2A>Hҭj\v<Y4.ت4Tʯ~{Dz ЮەE/u{!ғzJ'0<>EL#[g C#;<y
m%Ş*|{#g.Wb >'S+HbҰƳhC\~hh,*Foq ~w^
K5l: :m7:z4&'2.^
TzQ@Q%FuPi@nqb$UA8{~a:C; A ؿk߾۷;ɣoBsYN߅+ą'!1=ҼӨ/>֊(=sru婤&ss DS$R<g\kL&u#,/LpDo?-2"@
;XHY@ % u@bܼy@Z҃D?dIi]*
M%``iR<JyEK1$R젝"ym7YцBW} x=]k^J (# @z>AtG$V&0? lʍA?{r!G+ Z%lv {c6x//Q/_۱}v <(W~;䣬
ˇ.C"Eԧp2 :u*OýE6nM>2-:Nˠǝo& suH]bSs`}c!9KbEIV`wiTvXC#ur"Q3! Ffr< ?R6ڵ.4c%RH,M$:^W
j:L]rX%uXN9N/| gPJ6 ěDɁ ڎ~8].8^h5:=~^>@9h>b:{:5r՞Bϣώ*;Mh8('/kK6 F9SPX| N nw' ٯ[K=b!i)Q:/Y9g Ĺ3P]~
t _?g*nwZڇ"l6LG}#3XGƹMS3 '$ [h ( Kd dt%HgOL 3.ǠU('WE_lA)c*$ J쾋$wpf//vϿ:X 8l17Mj.31=q] R 4",LN 6 nM'qkm щKAN#|F\ "pw#Q]f87@UKc]RvIxyf-$pa9+WΣ@P"4<Wd癠,p
%x 0 a+0b8l%q! q 8hT"qL' UXvew_4Kd0462 Vn<qHMS II
ѐQI^^W4:%JN TJ=C/4^OJQ# iMCaGqDc6Тwς>-:B pŋk\(Ɖ~4 'q.(Es /N@щ>8J#!FўPMyQ NkV
\tpPe| |FH`zfl uMhnӬA%6
$b<.Pe%xhن=}H /j] T6E9'I&OAHS(kOF (oDSw ɂ &gfUe_:KА"}ȑ E4@Z P"gL4G+B 2A 4~!i7{T 48:C4 aGٱP`e!e;\h(oAiM j=d9ښbv҃
yVJ Oޠ\ϒ a[`{ UK]:\.+Ԏ' 6c4. +1)2
G_ue6l߷
w6B vێ4 y.EKs *ILQ^Y+%?GPQtca^{d|F,܋L&] rT7C /Aph^eH H0 :Wq iRS><I~^䋎d,HB@ ^dQC8KV 6H"&Ҵ@
ϥv뽡 :xi@إ'ҩ$ h5xQnP;2ґB4PfH˃3E-ȹ҈`ׁ8*hHR,-d2isB2Wd7F"U T MષXPW_H!AަGև>(>o٣ƴzEQYF{ g'hŕ3;g 9c{lKp3Nq MOɩc{ne)ڌSvO\@G}j/Cقd"
_ Hmb s+K T⪉,%g))D$xϗI$藲# HJ-|. H慔 </Iit*yO>'A Hzd2)VݖCܦ~[]P؎V
+kDm} zZˠoQpW/Hơ Dؓ 0; ǸV(kM5xx![Z16S~_]Oz:jqLt^Dж/-/ Nv>
FW6Tk(*#;t?!TPCx*^| I:{/p
ax6B ch69U
$nEGGAݗ1Jooo7ǡWPGI'>~N/A^.ԆI2f`"yr5ՌqߋԐ40
KkUC/uNc& &] jnM=RXsU|(^p
sx=b}8y
`/j{2٨Vx-v,
B{{+ Y=_Zaɾ 74rACҐNaigmj}i@!v+x[+2o-WZPY|
-5G͵8,kkƥǑ{4.9t_R3{'m(=2
rO A#8vx \>HFMq:j,v5S ! NSƘ&S1*J DHv\덏%MّfRr(6=0퀁_5;דDV=gO QE%-A N.J&d ߁d;JD jh}UN6ؕT76D13A~59ĭ$Բʦ2R.zoB=N"\_ ť=xx{
I'.LytG[ԣ~~ ضa+:ƅj/%ǩ3QV^F/Fm]Z=L#ZZi*Pل|ȿ I;ܝkn`,K!Q|6\MnW1pOM)qgc$0N? +mv`HFۏQX( zoHBG| n6bc]\,o
АGY[mN} P :ؚӞ]PCOޥ9-p-!Ш {cx
ݪWlޠ2%aU vk7Y䱌0eΊFt=vUl$~#&좝k0Ɖch ^#vi"vi2N"iZ{:=n JKm
0;lDA>q|<z99gqbA[C!ڃP-%(!֗I L\8%PSuEEg`t#;1kK ,\%qLӋ0 ̨ N6{`_3=_V7qQoK>6[0 F=PmƟ1+{MDN{፤KV(f/)?Z//vϿ:Xt*u(hE(, 4WU#hEcC5 :oڠ\.v97Ә 4{Wo):cs \XZmG9R<9{Hv ]wc{h ٿA@c ê
AE!8H:tt?(LS +Nj0{| =hӆN&t,id ͗8~Y/]h2O5|]R^N < qS- 럓+YݩѪ錤e(
2sEI:T. A ':zq
[/bW((+,ϡ FKSEಐ8H,=*Df#KtTuxh.Y$2gZ"MWU|XjF2 18V;r.<K@DfXwhI:RKͧ$N9 'o6: 0؊ ĩc{ K 4rh8NRrϟD]yt)Ra쮃ԇN:T i3cy^KKFT&Ec/ςvi$@siⵓ_v
,~_NTCI 䵶quotzI3ZH-f\P AXz2!Q W5t<' 4hP٢!lµF\GG}iXz2Z: h5E Oى. &"uuS+kɈ[
ʨi'\lʣ
k/C]yHRK/
IC]8p|?=>kspv&!">k+ {'H$A۰upY4~5
]\Zu,B/QW[
ZInjjPI kRm +-J%pyAcB}|_0>h=N{:^ɬI_: Lw#IcJJMR`@/=Ҁ*v:?Y%1333z83sx3)$XʔRJ.ji.<Z5걼fl wkyHk7xe 6/.cĿ>] XS]قv}!=Xј @"\C<?kT?!̌ܠܾ CE97B ҏtۛ$jd&LvO= >5|&SO%6kpXgѐ 2ε3ٱ! uM\-P3*eUFu-ٻ*^5_OBg_fL4cGKg ZYZO|.)Cjno"{:diYFt[sE߸4W5 ɾ/ VhиE 4PI
Geg #H8 S7+`ߤ{j OʗF\@ҋ!̎v77<_=|5}s&5{ 4&naC {?D ɪ)7M!` D? /T |i6qu-ZJ36(r !v)I}3mx _]K C47br >ğ3˿ IXr0|V۔$1@<i+6OeGK2hmd33:7| ~6}~S29 S;j LCxXM /kK$(J0,C,Ӯ,1/MOblױI"|:P=nnl L"{rd6 E<-E" 2-%MQ ɟ<ߙ%
n㵝 D6.vH=\ cS,aE;B<`ʐ^7u~ uuGZRM~6
(}4s}-5٨at4^c~\pΒXHDm%ynCS{7? 3udji1\K$M+yB1 ɃD% "|e2gC3Xҁ<8|\ xQ9~L" =ӆhBF*MM?@0cS76ርaԛE\~L"4; v̑,*s-}K;|5YwIiã<>#>bgяm ϵc~F4555 $M-hhsfա5u(+w5|Ur<R߳V?ſ`k= ,ȦHG\89{
ԝ:G֏~iԳ8ev'v'SHy?C: ?(@mm (;aRQm(}29I}e(dE\<.6#s~=;f.^4KZŨg<'py牡B(\KI[/ZF|~{}LQvw |-{ 7$+*N獍ό+8f& O^"O >ŪzP/kM4`4X2Y ~/:ۛym&1G_16ك y^ ڨӍuD }jqv)n^/AR4TTENGio*C_=f;`}>N$m(Z;(介%~&I>e>Ez61yK`JԈgrg /{w ^9Bx-EO<_,嚛'\m/+3kfr!u+S3behg@UkH!e2vy! GfKn ~U-?Ce}fdx`v$GN,@ Zr
cU;t ej"~jp A=IA]9*
HoT7KL*I(>zF (yuWOrKqleHfv{'rtrI.
tQ1Ckwy6
i $)M\z
%~1u;%Xhp%*P:a'q:T&If|bE3- NSj.z3[X#Qw MS4MD`Ԃa 5Qt$6găray\yMG;8VM,I&F> ;VzH'X٣A81"Me>nl f۳ stLaqA3 D?R[JRZ#+&J H([&!!H :1aH;zHL:`sXa`E0
u|#?&):wE)$+4' xpPB2oc[J?$X. Avx un15~I_R
A& h|2^(+$-4ɒȼkMг=-XBp;܈TWlKX]$yxL ]cүr\+$'YN&> {p7`SO1 ljNg 1:e4浵%o BuZ:ߪ(m:eeU^K7L$و<kh9*<>"~9C]c}1<>~r?/OI*[ ^; #/ AnM
7#x)"|lMzй*+&Lm) Dy3\oD<<M5嵏ҡҫg<B0inKBt~\k$ %L8Rh@ w H"\օf7!K
}@v)۰kG~ vϟλ$;+tF Gca>AQdD`f:ߢfUK
*[Y2< VW15=R
$ \gzj7n:Hn( o]A+7Q_yDc > <sp
n`dU' !( 1 g?0 }zO>nk'ozi)&Gb]~/l Diz#R@=
$`A1pLHp, CUk7MDIW:: #H 3^#G?4<b{QDډ5~^bchǴILy ژ }E#d\=<ܾhq>3g5 l~`v:͂2ܨ+/FY,Vy`ӫ6~i+*ڀfOo+ x,ǃܧؠo&hb8SWo^SIxSDëF+
uz hw4ޅ`.@ ^:?{Hޗ#Ϧϧ- DPqV`:k\yMMpv 6[mr[r]8i{&8FJj5@Ѕʺ6Z;aFGt , Z1㒷LN[ X7 !FdžrB**b!-<??4@
:"-LMMb9@7uw߆X`^tTڛuJ!]1%H
4xf/1h´z QzH ݊j lh<@2sea}?zW_>û
B*3/m59-6<QQF.+xZLQ%5&e Λ \e$!@_z2e5n vډo}_bK똡qdsG`35Oϗq#Κ1q9'IoDI0h|t>~n \Vtb]!ַal8 cY$9%*Cum
nUUU$q5ߗz
{u51C-9C Bb9A2*<xVWwz>ݍvW_%>y16
J秷?w # _呾wG긲>qu߽ +P5(F쇈BkwLJ4mA~1%~D f6MR)J?F#S ^- g|G-ۇi` EC(9E}}j:7l!.5dJƽiXC He hl*)ǫm%ڬ㰇|9*"y2q" 6U@IcmR3Lb 3s-ͯ?hBMI*or
*G}mnwceAW
*O<N<C)ڮ5<|1^C%f9w_cT>Msw>rǟۏ>qo9ț VܺmkcZ
&Wr1F%qdVgtpKLRſ?8X0Hp173#Y b& G;, nqway>Ãy3$I
_=/_"I|` E<vcbrSc]Dfd֠\evm @u]%jhoVhUx Wn_
AM<Pu(a=GCK :M2ыx~_|ECV8g{͏^ gOM+\I$$Tb @`_ E C>N0|]pCȺ)g*?HE@bPhO"
M.07WxOnf^Fd1ߣ#C,йY./=6l,/`p|iDM {7:dd
Hzdq:'
IejoU B2$ jVsY2,Uh|4Z*3QNd)A[1$ HEI0LgAc2bMԴ5k.W`JaY+4Aǜ:wƆt03 ##qp7py0J]=}} ~
Ɂ
'80IN
%\+F%"
()+&@P,
b-Xt$rsN匢=cG~.?];P6+AQG09bKG '"ٞ'a><znUl j2C O
Y}!AC C
c=hk1)u\O_z^ 4
>.^ Uەq7?և.7XhW6Ih+vV~8bo:q@1>y~ 7_|eF)7KO`)1k:|IHZ) Mq6ebTGg YX@0'h'K nva.Ä;a\wMکKx/p0f u6a8
-
m}hw "6ٙNr}sD[$ՑZKY$AZc ofqEzh:5o21 Ts;$X1r 4ӫ[:4q1nߺjI00;ڃn,io05=}.$kv}
- ѷܖ!+91؎zLccu,.fG~s!I
Iw |9>g TPx<;/E Epm2UY L߇B"K$j\d(Q nf 8"A vn <%X8!Y8#QCo15wo î<<B(ypg't̏s}I}VkGo"xK ۄP7[M۶f먥M.q$bduM-(WZ|xM|>ġP@A>t44rڕ2f>O?:Ϩ{^A _~/CO>k4)ݏQwN
Y$FB|LJ7MG$˴'FH \q(['P]I`$Cґ' P6K:$Q':R}u0
[d']?W?D-EainGS{/{7?or?~(
Mrx?|fZݝ!yʉ m B"㎮ YE>yƾ MH+0Hh/|vD =Hw01wI0A2jMӼs>tV:Ԕ@E5ܼz%Ya jo{96ڱF+q/~hzyla~]h Omi
PϞ |DebS꽚 (W}2\ i e)KT>S~lPWUd`Q4?F\p;"^(m#ߤ$emC(mGe^Ah~ }roG^.p~Ĭgu^>>_!K8wk&
#]$Ds-TV^2*.n zh^0EܺE|OшT= 3mʪO`7F?9K +>?Y=8GOsxk@^31GHl?>1]uI];oS
+wiI^z]K已
,ĩ
&hcOIb~酦 ח6B86v=t=W 37}e/ sc6;6
o,1 sLأ<jAW(Jʛ72_b p Y: "A(IO<c8wr|:t 5k}E9lh+0 na)Iuε5
$ =;
f[606=q&}[KaRaf\ӓiDKC9Z*X]Pv:ʪx l҈8f{`#VІbg#yD?Q|/</pK+ͭ] |OpH ? R%Q&P`ꝏLC5Q$
9${LM OMz_WSl=> S7&+]Wv ޯwkFa\o GS #vLOM"iq+ $ CpDbs!1^|> B"N ?҇&tw՛u%o'wY'` `b|
5f2\#xkpM6%(j*Cca u (62)^?;/~?Ggq~O ?'/ V 'W_/O}56TDG%Av5^R!5U@@#ύ)3A;9qN^8FP4ch-#lͅm*
\ybY sdI LKnȍn*f%@CM{'0H!M
-#HCR[TA SovYw<4Ù;0N Ў J.% }8T Bp!שa=&J% }o8Maxt c&,Qk'I8,zf iCsڹDDo)FH[=p/4@w + )Vב,"3Dmŧ}jH(ٽ BAG4;ݡe5$oIDG"t tBW[`4>Rg/'~;Z(8"Pscl îܘvfTAūx tN\("nESC;A.|8ǏW g$NK ӏ1OcNJĊN<x,ckCK+A]W ^ft2 {tOcgFQVgtZ|^nj쯗86ܺF$>*MgSmv> Sޛ?1O~gXau8b$WH|8K$G :ecyeh 7ؤP5y?אF"W]aLYIfG OW2u`Eu g|
"ă7C*9pWL`Z_M(zL
$:98c9ƅ6 E[k0N6`hځL^K іh3i^ח)sG@ 515 gGe1WM,dwD ٨UH"K{fgV
Yڝ%Y֬~F*p"A~F0?F"d5Җ S$cHG<pM$ 䢝?M_Ӂɱ! tu^LX4ƁڂNi
χ% `ad-PH8D@AOKԵ@
J程Е*J2]ܣަ-%9R$F AR@K&DH4AXn;}aD5*ɌK:{n2
Է<߯i,ڵTAd &ݿr߽^BM /oƅhhHy/ o` +B'߽4`Es_6帆hlF|~k%Hjo4^ͤ f#oSÈDAoR2ʪ*XE+ߟNGN0;eJ?s| <L̐:mⲙ"%V }l16@ c3@~ehHӓ~fvVVY
&K1ztDci H^Tv i챼iX\%oÏƢ$4kl}_I'kڨߨà=gF+W56ctI"H?wOwQʪ 61VHk6'1R}>#
~n>8;@"E*`z|-ʄ{DTwm 4R<{wC'v$^[B.R}ΫaGK5䢭}} $C h`3|7p#uaLjB4"u
фI=V@eC? ksdO+H'iwX1F]'_6X۲ z0ixNs*@)\*GxI <V|^St2^-Idzg57Ubu+[Zo(&!u!b%6gG|r +{N4T6.)fYDWSp'bn瘝P7?4
fc O`ttuuu& ,e2 ._K.ݿI IH~$NTcc# |>~s ~/͈uE9-vƕ۠}y哏͎Wt/~IlA$op.}0Q I = aGl}ك;x`E!.a#WVg6I0M/qFݧ/ҟ߁/!Tֶadv~QE
E|^/'?E [lڟ997m2 A {dl ʣaMc6
7uýx@O]1\N`u}.?{1˵
q| 1-#f u5hhjG{5Zn pZgaiA2&N՜5dXŲnW?>}V7N_Q/*t .^* <7>b#=f׀ 4I%Z1Q`WE%*PnoޣgJ`'.g
8z 1ڣw1GOb3 B4$DjFԮ#n?@zdVp|+ރ%Mpȅ2öSZjԢ:NLhOvcr }$C40mDiU9+@@Bkq
j@EGGWif1PPo#N{'_H~ ^=ǧ O>$egwQYEl, F O%4)WXu`26<G
6hQI2rD14 1篞3U.)Th'O'ˈ82Ps
QcB70' ,`6gV 'pf4qyyiD` ԼI 'Yi(6lYcwwSD(TE#^; ؤ#6ǖ4wVwY11<˸R '᷍2 ck6ZI,IL{MrڊfLucj҃n Op#윅:g>W5XtSt$^t<a!r<&WGgD;#g )rLdL92x4G< W]1JGhi]5ځ/%/g-1l [N< bj n NbƝox$wEExM rNz3$ї̡$sӉ>Q tvGz0<kxeƦI- JHz:ӊtzjb?}Pu 5Rb _g8;'鏿 'wރy( C`wԤ:e+ldF[N`n CP+Xyz u&94R6vWq˯p.@ihoz D i~~;_p{dz{b_u-f0G" ;6MmNA1AFTaWHin,%X9pd\<*[(&Vvf5)Ы#{D][!.Z 2cS8cv U\]ʲ$U@oo7z(m\_cLMq }$ V$i8f$4J33 !H c5dmP
;`jI (fgǏ?3wկm[ l("{A/[ ]$xDd.?@|GRã4N^*Poy;orsMtx|6.7 X=\b O o<`!FH=@d<jKR]
NrP θSK.u6`>^M0P 铕-vYEA/*At>!.RVt:n"e vWtbp| =('Ess :NO~9zw7ӟ ? vpS'ysnO56#j9y]K+X*gT9mKX{n厞5L &f\wŧ_5B@HȨD:@
(K.[0Hb=kI<ś(kC$ǎNg@^nˤ> w/bOL_Ur-+xuД <n,dXLphۛܥ\?7}v B[S>RP~Np2NvL#3lc77~
*+GS}#::H&n(FPUmF
I=_-6cE(ɫӇhrp p+4YIXI?K $QzQ%{_^%>0jFC#
7;*M UDU6nb֪Y^jXQyCoM,(_FtV^ L'j{^ZGFU' |5m!,hlј'&~}`3'{Y^wct 6ؠCm
(pU\xшe$PvA{;1
6UCZ[ cU(1g¿?/1 gG?_#oՏ^$~{C;1t^;""~ڍQ.PH
EU`: 1uEGeկ-'X_yMQ)_Ë_KRx+p 697G<bK)hqJ*O1⚧ߤ_DŽ+r mu COqJ,9aeڣj^avkxD ^
_cc|q>aBʁӽu ~5،Lf|apt_!gŎW^/ʝØ5nwϗ5ezuV#ե ",'އcis+H&K[Ms
o˟S}F1@$tye }?q9DY*Uj(1^IRڼ.JٕzWߕ (x0;%`̛40/F?蛶e:
Gj>|
eH$DM
>KP3 Vhn^Nm6k'̬宮4֣o:-2U)
Y Jy,c娨)+HmJdb{g#F֗b{xl0ţgTR=z)$AaQ\Юcxx]G*@I cHԈ )eJ7VJ9I2 APHy'!R Sre;7bz+qJbXL@cj
&=ILf6xhy;Fp
vUFUs"i gUf2㼖jr^!#y2iΒDQ(u ##9xwB 3[\5okwϐ\\C*6 vV \iH胎 Sqv\'U\'<*kC=9-NP`4da-Ã` O6'Yw#Sv NcpxcV}l ?%/ dWMIfH LS9YHMHt:]-iut{ $ƟFB1⫅l@&O`q_$-jvFCQ)RO (d W7LWVMfW&pG'nGG WAteIs:= @GW3 DM5%Uwjz5!+7
]Y*dVRe%|]Mc-mա 8>{ ] ""lyX"Q<7p-(GDc^: Փv o:*>y[gzܐ|UGTs :
}z:3u^39U=8#Iz=$8}N ~ج5γI+ Z P4 +>>x9{
o`*FCrk
4u "_6=
(,r)Z#9n2.6a7$ʊV~U
W|h; d'84XR~v4^4'L{۪^Iѳ~ sq813ҍ^WTWk|
p*)C0 oՁV 6IrK8><`}C$~L̢%5ͨC;O^L.zIҀHu-**X#qhL/C[Ą3N $?`0Il(I4%
$ eg ɽ@@JWT~$2`B@aTP´!U3#$x}9$S8ًmxu
h &H4g?Hs:
8!?F[UP5PM쏖zZTTK՟Dck(` RMIi6v@@Kq|!
e8= W_E^eX#Y̆uN`~Q;9ʘQ 4AIg?11> *T2:g
Zy
o@̸XٓLFATYjڙVi[:/]UVG;'?D` }-)ㇰJoO'(d+d7SȂfQ}>t K -os,ǐ!uST$I(?~b23j*Y^:5&4mFF>9xg` ul SChAEI)n^z[۸vxf)u : `a~y1$#}3pi˴ ĺu- jl͊z4 S?&Eȕ 5Q٥pʪFuxN|M +ݟ}1Gl klE8b&諠e+p=~mJhzo_W_(Шߤ*[u*<k|aU ><<]^SJ 6b| fGx^0*1
kCcZbqbR47W
6Xprr]|HSSK Q@Rӣ TPN-Zk;:?Z~cpíEF*E$u0nj2H</sļ5%W3rNW'{
K1槆(*YbaΙvMᐟC}X8}EzOWOhv Iz>ss"{&GQJ"TÙޠskM`̿j2, 83t&0׆3t
ս 0^~_l~Qϩ
ߕT
+I Q6V=cH=8;}}5>+^!{V%iԽ,[?-&kGJa ,SC 3ɴAPQJO x[&7n S n03eE7{C&xN} bytu
cx|M?Ml@cװLjp6=TTobD"f"8bԛ;!^qoS|V @xY/
(p siYaOQaR %dV)@`A p+a;
܁0/
kY/>{͝ jFuqA8{<Ay59{`jwΜ(爋l
SZMM2J
IA3I}[k zZ1=1@`ыZ
kAu=ABB"$A0"zh[(%hAn2A>w|<;û8-* XUz+*`CGOVVAt[ũI C|ts2Tn((+w9t y.>oHtDa:̊FQGkp!Ƒ nG0t O9Q6n+{h 1 z#hRa"oҏ5OMT~Z$fjY:CcHN2b>X&r3"Cpja#.J#2Dy\L*/õacQ2(ikEwK3gښ٬n
[I`j +@rAsr $!YHfIT0a>6nqobV ;sNJa h7|5=$P@_K9#o$4
& \ LM,
U=: ը<* _=$e5D"APD^Pfg`&Q=<YLs R gq _7F~OLi_j䥵暎Ě *2b znܼBgUh9&8,,$]3iGUC *jx /$`WqzWMk@=OZZQCہG!>:O~/> G)E >%qs Ķ#,EJ n`rI=S"Aѳ
|L OxOt$ 1!ZGG\+f04J";禬@;K
<辎PJt[;ʋ$MxV|Ƶ G](*z226Vi!QT P)#ua IVɔF d] r$IO:w\ji5l
q; ve'a;1I 5u19>jf7 wv mMFg{ I SӰX혞v`053<| 6x<AD#ID
a||@v{ saN9P2/|(PD-q+wSq1N zPhw(Ō%2הM.!K[@ Tdj,)5KI=k04i/ s(gphKQ?AG7.(M6]ziBQ֘v"ooÇ. ()'/hn2 ۩Nֹ44Pǥm)` 4
UP]"QѕuD=J[k#1߅' '/ clt?C;yM<_IПkDنHׯ }u|""]ã_wҏ@-H ;6:w+F[:q^ P5f753%oTq-i]u"τ5e _aԽ4Fh@[j;P;D C_sgf{TF@Di\rHqkA꿚9]a<O&D~!|aΟan~E=v SD)/wYv"e̒05`iy㣣h"QompgzI
BRЇ}L}Gc͆
/kz=Q':Z`H(&Lp !yK8E1.yI_뾮ɻ./{Q;EKջITꙥF Y7)7F>l-J21~ <ƭ* Xjjħr*\],/Z98<~p\~eQ}qcuI;@Ss;hk̄ZM9kA1Mد
&@} 8unhs|]5jk1F.>>3ʯ~)?zr ۴y6,IW1_(Kc W |&pDt[Q]OڼSF[Q I_AP
ˉ5h#z ƥ>O 푈űH"|NI=ʹ8 m )cC*:P300Ut NQ?uG;.[nqC^Odw^/!hcU: V8N!?Қ2f I o vQ`"i*B351j v}@o KK#|>`Qx^+'pwg&Eo0&m ̴cq1LyPY
KJkBh.:X*Ey(Wxd1+@R_W6& 3ҝLfn+cS{a|]Wv ώ+ V\pӉLͥ~ o^ aȟFg )+J?㢼 8Uc]xu?NQ1654֠n_/9!E}NQKe7LS[eqy
uL55456I}T垮fS}[O?3<3u'WV ޑ=\z d.f;ma*Z&fy.
ME)u3|k6h>D9&`(i?}'fޙҾ n;3i>Hza֔ŵM8nw㽦:1<A_Ьa 7k)
0&&<|i*Cc '&9
=4>J4-GХ=93H-摉ڱua}2k$"}3i⼯Zf_
aA fy2^~1t
b`p~ӌ_a-!c?ovc,AL:tX#9>d =D^%`v)ZQW<OînrD$o PL9QX:jp$Aۦ!S%8Edi4a\5Y(OsسځWNς\i(k e>#hpG_kIG5kJ l=t4^,
!ʪDHx}5e }hl؋ήv\pUCD&xESzP |^q
^eޮ5N BCA_$ }?
_O;O KKwFz'ut.O DxU0t"I|xR賆1+ Ia !q3Qh(XZ&!1In ~%u4d:$@=I$j߲yB!'иZމChMKg p ޮ4`l1'킓kܕX=@ Z 5V
&I>vUx¤$j+s$ivl.bDK4r|c LCAiQ?;@PMP`ؤ==5usSðO2 $2D$ S
<^?RE LarƂP$(3/, L}Lʹy#u 0
#BPto+ť d!,M)^5FJM {x
Sٯ싂*od^/BF"P9ıYí&Np=lW5}䜠R]'ޫ &[A5hKQ<$|s*`udo}u0N1[Z> lEPO Uk{#A%\]\.GGF5L+r*K>}PʐWPOׇʆv, r
LO/o_?+-oΟ<W
CAؒdd
&+-bԓ^0Hb?ۣ4l S I -*L@-{GF)]`u! V9#T~?H=8WPgLm(I;0SIڼv("_;TvR0gR| p-}4ڒ9
Eb+p#Kec e*Vʰx-֭g89~\&um1 WV XGGj@"v_3ILiI80;6Q[ :@f>xD%A E$Gniڂ) &)8$mDna )9 OP?'p0AH"AҠ
^<of$ג>UV'F+.h6##sE.;SfqdDA=;l-ehi}|7m؊A }B 5Նr)7~S/w<
Kx
l_i6~*81E%yn`2!~݂-*Lo@uQ-Ԩ|{CWW7qvIJJJM@PS=^
(`^S] *s
w NP }Qz൵SM SƶM9[(ڀ8{~-j%8u<IDuTNdMpǸ.T l+d~?/~D&JH"iTiJ$ ݼofJV5cR>=G/t wDq߾U+f$㼆:m6yˊ
WI/ e $3{ c#{&Ly n>:Ui"Ĭa꿙$AP( o3?gFf>&G09:lg'%LLgry1>N1k5v G0]%?D?~Ì6#ӱ ;9Dvlt-;u]
ɡ2I`$bBYmnhV)& кW%v!S@;z]Wv IhxBs< ]Uth=X //㏟`G<I<YGҀ ωP;[F ;nP6y.YVcښ3'Yu Wc`Ϥ ^v \^
[KepC kQ܄At IhCcgz5$u/gsD½$8M
1\+H`Á5 P<t\ dD).
v(կ$ $WBP! q (v'ϥF(HX8ѹ b(shQ.k*ˮ #˅"
]"% Rx& jDO.GC`HNP iی{!qUF1<6 ocueŤӪ92L*cn~Qn #+%];JR !Мe|` C}j`[zZ;چ֦tQ<:ѥ7lvg.<>&If-*[N+ 3"C= ø+@sB]!(F^M %r" $z4ș|^'}yӫ@:!o˻<<*iPٱ6TAqSo5 /S9a=(|ua~Oa{%<$Fp 1~g_ fR\=SEUlH#` EPEUիCsm>-V 2u
t i |p"|*6Q{ {006 QQk_V_״vdzhzeeאyw)bG\n tAti5gR t<0E0Y~P/L#]1pK ?$2JK>% {/]nS%(.a"gz3UMPm =)3E QF Xu z*xF tL006gD.ʵ8LIZ&' VI4{d U[4)}-S+ 3GHdu ZXJI50MD õ2Ir&ik(ZJmh^
qӵd7k w ZV AmmM!M5]V߈Nb$ ,AanjeN \-m#}Q^ Ɣ3pnL,JՏjWIR<7<{Jl&e>"Y+ =*cLVl5Vxr$idAxifLkߤڹ]Y9{>髸& +N_ <3<ϹO0Gk'fvv0OrR&YWn >MWnTW/}G0.Qk>u+_ ~LZ^*] %1Ow u-0} ZQI<1=5QhB&wpv'XO Fgx0⎠Gl $]s .b<4R2umɢvM/gQUTD@\OrV's?mJx: /רIM? JL;g&iss$ !Ohd1G]=ݟ{ocx~}k ^#32JW*z( i-JS> wfk-NO=J {),&NЖH_XƜmJK|\Kʒ-la`$ --& -6W_[_Tנcur !ƹ;bqLĶ =ݸVZaFʶu
"
ka)ZHv?O? Y=R A(*IlllJde[^ SO Il\h$mlM 5~+{fc?GX՛87T" ~ÏgoI|R .jp7!(ܳr G !bb}b;SoKp}\~kbȾBMu=qU\xЧ7e(@GFFF0==s[}QFTOMZ07
O (A6VȠ Kc*(mt1xG8 b"^"K<&$A*EQe " Cy=ePyf6Tx. H9(>,m !*oh@l Sx9Iɣ' @I,)$蓏Hcҗ3BVnנs9mMV-q};ɝ"**ИJQ
SirE&q<1u bEoJ ~+i?T6`2/5Rڴlj$FTWZ4כYQA_%u(($$"i ?}kc2ۺ3hF^/oF4L60K{&.L< <EGSEH@d^}*/X%& sbp@eK6U!>*+ߙ .eHt}tJ`Y
{W0dwa1ëU|& Oހ dh"\:M_>Ӈ4;ץsw\M:}W}[Yq41Dew9
͵%\q 7@j F053Bߍ1 kʃgx$ǦE71_H< aȃ2dčtԌ cl$hx
1Z +e^J(23P~ vr }dިcg(:kKc;$1L) ^iғTrl ^б4wRj GbfknE0鄵f9Iv-fzp
]CrJѩ+jF㢃
R+Tb*rχeq6ꘚ 6r8Y
>$Psvީ"֪O.GRkFi{F&H:XU2t8\[7RVR:H!(PӓRTB5@ةgn@#c9Gp9ڋrVംOƧVRKsO#H6I
LcAJ%[L0E=HHnz^xNNv%IH4Φ.)d0([= l44h!:2@<?Eݯt}ԏ)"Vʎ7Z:ؑOoj;O9t N )MJFϾ2)=\ 6I;.?T)AKG;* ZM8Fi $x5$$ 7{p 4x ( P &,S0
,tu{`.&M}vmbpe1~r ] x\d[1J)_hbJB5` ΧW𩙑+Y{"f$ nBnvUiM1|Fy~Awu3,) k/Lm'J][?WBP$)X"9<$
ک({F'W:AzF;{U-]Λ&_jL,iW _ϙ (j&5ezl$w$I d |Hf %,w{+81Ntv?UT [syp0ig!~Wn7o
~%(-)5A2u̮C A~yE
C.#AЇx6cJYl2k{ }#C&429Aك~>ݺUswri 꺸ƆMW?^}E^ j
(4~-75 ,Js4AvS͎A;" c~D%H{t̫c
n<F #6`Eó4oSz\Hǭx0W}h>F
R !ČJQ?_#{ '/MPF;Ņ* m"ٯkGK[Zۛ0L;DoVUW{ ^j+'DׅsZZzt>=^ڊqh&lc$fTk.&a]~$нFߤkoOOi
l>xٮ:j06 llb6!]!9xQB>Vdyw!}t4
ji u"?tdj6'r瓟l1t47m ^1$=`!I|!#uX" +4z e V9?*uxl{6#ce$=i,3 #q]ՈKJQ^YoRoߺFDI
ܺ}Hz۔ߢ\Ax:OP+
朴NҗwkKY=z{;]V_
UۂtΚ7?2 믮
ԁm?RyuvQt_
:~1[=Fs{C`gbivoYGNrhpNj)Ƒ~OR0uDR(p""> ;C
ITGf!uۨkmEEM-HG[;91AxnJ"._N^n7"N$msL l8\N̙2VX_[6
TjoRGO!!MhDv"+lLb;?
QByj+"{کs"
I뚌J)C4!jHq<a0E} e0Ǩ'e%ү7njb/F_]N|波 v2EFM&?%z^Y::R,|
Yq@̬"2H+=0=+c*pWMSQ׆K۫p-r}}9*+]RZ *cU}#\&0euMu]h:j ! Ĭ ߹pnV6vm'Vsݷk
zl9(4iЎ6@_kAY%*QњҦ|GV6*9Wث(ov)" ̵mb ]Wv &\ L1M٤0KG,,+N֢*ajӹmHC BG>:Jw0]Ű+~uwd*oh]}k'(AUc+:G52~) 6w
݃sE}G7 54B08dv!-H'"4<NLh"f!H`q)²x}tn" Tm;bQ))P6Ҍ4 ) j1XTKI,+EOTt4)E[I[^\hTRT y FZZ7QKYx+ Bt (JqtȂ馬)9m5ߘ"ML.Jh+HQ(,Nvq:4~QՎEѹ$4" f+aa}d9ts
aXe%h@!WW**5)CcC5hHHiGawFVǭNL8$Q89;)acNL2nIi"] Eߛ eD(pKJ<ANN
"r 1Y1<lxqa6aTG-CD >o
(z (꾇Lur:8ɦ7~#ˎk<zˏI\>C0*գAMG`RAH &&p6
tխ!hkG _ғ!|^i
$u_
2)
S1ԏN.[HD8g11k=9*[.66 6tE ¡]>eDsQ~ڳX ԋqu9zFC$X5DA bFR(sp{Wu쁚 >Ӹ}e˯Apk+*2@Z/J DPzadqB Ӟ4𧖐Evm_(m멋pkvbO7Y&f'\
Z홴 =\~ǻy-De95:2I~Ö́W@B8 <Iݧ-Ɨ0j``|ƅFTVt6R]]gWUբ6u~k]}h#
7eaH?3O8ۃf> qzeO.l0E:Ҍi^gY+([ T
ҪTm]g :M)foXc.3SE jtשQDOi:Wn<yȃOYZ [ߨ:yYH _ѣmyQZ7l<Ah1<+ \ǼAqE$ Id`$uBݯ0kjDcs#yz14:dҔLyA-u0c2=VԷRi7۩! n ҩ(&a)ǣ{y~ uTkfH5>u_D6U%H76 k x GdkbHu={A}q ϛz$4q0>'Hج+V6it= 6Pz>5؋ uF %, _*Dknk~%+AJ&{>9G@\kDD)m="tBc++_Ɛn Y6Y8kɐm乳q"WDy M9i0ePVי %Jnq]5룚8>>dki'%yt9;@")'P6fHf%HN26C§ ? 'Ϲ(>
ث 8P @b T怦X"˴<)Έ&W6>C:>M[$RB@kH~+SEh +q@Z<0 ?'pqLP?[*\-?z' =k^S"np}hhnACc#ک}ݘkAooygq P@} ,P& m jhOBY1؉{ڰƣ] Q$k* #&ӮE]oY8c|$m8҄-QJ/ "B`@#>^LWWcb 9 |SIJs
x եN9os?ǃv 7ө, >d_\)CǴ4-T 4 2ϣmzryy>m
*{py=,Jg*<Cȵb7(HQN_Y 5>vEyĤOGYy5kPQQ2Ҳ
.)7#7601=eb a4ݦ D1i"@L
։Iפ{z3B:I( dWSLtXIseKDU~zY Wꩰ0 NR%Ӽ*szJ]<^ Q@+E;P@8[8ع >Mv<=24jtxNmeH mczO'vC0
ssE?
w$;{H QR]%Mg2ݯF%@Em +5 NFomBmk#H|`2!m$:ޙJ K)hcI :ıJ
2 ٠BmbaJ;]Ӄ@س-4HMIBDC\<I.Y܅F-hjUc*C:6t9BHQ$¦I7
ul;ڟAF$dL `,,be)nJߨCϤa a5P,(]NlbBU 2
@h1PJ6hr8 !9zϜ3N C%(H9;ᘨA SFkGN-hhⵧi%4O-ݽ"ذ3_#V{?ϕ)=lҰ%Uo&QA!@7d\NG4P}|^!y U^Jd5& Pgx6ndqS[Qb&;Hejh W pd. ];P G"%^iu$u|+RN| ^<;9 5waS:wrHFLHhu2Z
5<Z18=^Yi "q߹t*qmJ ihr%Qzizf롺L[Ϫ>B &TK\^= @jڹ8 o 8ԱZۧ]zdڼB:f^g`e4
8tr."JWX H
R[/3ݡ>7 |Sly)[Kytb.?:kYGFi)YqfH,x>
W2a!APmPBkpN=v%+m5LK'7Csmo`#-`_kyVW
(Xm1[zϵ b\?c^ Z=Kѩv #CujG f,%姦K0sA0<9>{m Cd͌uUytYA@X"_s@~Ru %nES<wxF()[ROL2V4NI
YEs\DV0IcU oɭo089c%3@4@Ds۱7{x| {{$N~^Mo }DOIfr/i H5ꍑď;0E z.W|Lx(Wt_= *ꪩj^,継AuC=;ԃ^׳ӣ&e_~/<z <!/f1~ ci^ E@oOPpUzSm3Avb'.&+hBx;O:xSӘjGXVWWȟ|WX= f{"ţs).*8XlcjH\B!|I~s#=z7+!.\˷+101/~P6 e k-:xccy5\s-SyLq xssDZ݃lngC` E?$:S<9d /'[M$@s> YLp+KAAtvtW`Gg}|8?A Cы/
dYX?dhtu1N A(W>G/M߂RsH,o.Eѕ='>":*n RC$
)k[L$#(}]e6m]0u
?5Ť
_9W{XX?+:joI|dVY2*IS
61
>:`zv6(M@.)˗q(P&Ik!(@ QJZ tPmz ̴ĶmMxs/hۂXHqMz\}.HO 4Rv C FRY+yڲ|@_Hu[A
yd^gQ A+ftXV&ȜUsY9967ׂD5P{=(Spc1P? ?YW{ .^w}I]uVvoS@;M 'TP0Qb,v 6- W?#hF`>٥/\s#
Vq
gdnu]=C<]}hi4R5
C1X<6 ?Yy-ḙJ^uxZ&k^xK(\UE5*WI
uUu/G)o!7k-f+zLzoS/SAAAVf+E;Pi{Z1$0!!G[Wٗ`!J=8 R*KOp:C%ӈ̅ l
D ~'ǤՉޱ)k ^UIpM('aQ*j4q4>::.&.Ym-hhAB$mC Ɋ Ӂ= gGx;Gf ?r>eDE
4O#S`繰f)nPsG 3M \h~^XېOo!HAEƅ3"ap MЈi^-PTI8HE4syӬ/-{:YB5![E
uLi~%xt\4 3BK cjD! -`Իcz_ Z.ŴWp5u:`zn2>Qy12F FOB B[0GAQcvo 0;M5uO`x̊9̸<89:Acᔁ)s0yL9qM >Bю뻊S|\@Qt~Lp@i] y_(zA#Z_$&:g
FHj#[3"5X:0 һv IC c㚱ڨ^S|x 7ow~
Gk a Z}4f;se+ufk?͵6bu2$IuC[O *( N`k`v<kz ?:dꗕ}00:A@<ҏۨm@M]-xp'Ϟ?}/ɋ:{a 4>5Cѧ)P^)swO(ǦfЩ ] ]*SJE~QMR.m= Z"l3Df91%`ƞ;v&
m ߍ>=nDSw Jӈ<nC:r_v7\J[5
4-fF \q;'3Y3yqWƐ,m Ay$ ܹCPHsr}l٩_WĄ)@ p+ #%V7Na
Os2#&Cm@w/J1}FFx 4౷oCSpm?V'wh?O AI'3:At[bO YI> Ο @@D~1BPR.0K!b@D\GcHLiM2D*4%<ߤ Ys@Aa ?Zo
I.?5u)q/P 꿃A]K_y5',^Әڭr" ē^302^.k5l&(#(CtouTOP9~+E?߁ΖZ<GŧO~F2t `<xX5
WJE+oYj2|jl /gKCkJ} /n*+B$
:]/q$ @+AGٹ wFlO=^ڸ. )#i3d9f6$1dSp}.5G'q 5s Qv^/lD0E_qJ,OIbĈ8jP*!d]=2FۈkwM4L 0oKH F96tvS1L,3:5NccsWz#i %ͨҝ z('m`hD=Q>4
m ^R2(da(aW@@FU
(m,D1@>`%Aa e#)P((6ӲyNH.I=ĕĂV,g"~ٯ;O>UKr~SJ:54C4C4OA7[K'as`F ycS zz:N_m@e (_az SM6_FӁjSVS]P0
Ǐ!ڄޮfGj IDAT_#œ/иGHSOy]kڀ~wi\H"]L1&."nN5OMЮ^M2˦s
+nso0ʡ }mu4@! ;${I 8A c<ȬN/ca!.\ô3d2K+`5ALaDd9U6h8C~KOd$>Jcx whkyb l<Z#)X`
O(M. }ݧnu
8HO=..>a6 QCC!4Z=Espih.1 "N _I'5Pv18P H PGqt%m6Xmm
ҷ Ǎ
}Nڨv
r
ɲ0?whpȬkV&
\j%p2F K<% 9kid(jvwD ȈE`
u`b!X'$!hkFUTfi F;ҀTTTJ㕚Lڢ^SVSjr5jm@ FO;&'h0zz[ïW?۟kgx =z ayjTȽRRFNޤ ]xL
{{ [HN
yL"c { q%Sl貦5D%v \a%IXb蟋`tA[!OD~)GOd1? G IXϸƝIҮ" ,
YTq*Ih,L@ Yf"LjvfM,6s8]< 4"VE] &b)W 4 |#qш[lA18A 3ur
&`(d}S3
K ܮҕQ༙[nNxh,s44!H0 B(B!`+F)! EnW zu'
HuW(K+@sVչ+{=#3ABif1$ؚ >ȸkKZkf ((~_/ǂdp[+ C<G=lawqF;n$)"5 qnjU4k
4v
4sNq od|u&>Dաx
.^e|ut"ucdp;M.3 ;o_/pSQ:1ul=JzOci(ϑȥH 'H?ݏqkڃ;$ω=J=_"^0AK>Ph1j>Cm>EiK)-.tu3AtNous{ 6T7>Ob Kyqԓ`keWU% \FlZo3Q vI^ ]Fx;I q<ɉQRJӿԶMD\j5 V;.]ഇ!P>-7<aXACF&g1cuSWw,-j TW7
\te-R.^ƍVt ZIR њOQFIR'|Qc$fL"ssi8p+Bֺ,w lQ :g ;MiWV <.&Lۣ:Q~j
1wE"M Ν cطL"@poWSH
!8v_7)^3X\ }cX
l
| Ӷi OVַCc @Cc)%ilm䡂@(Kod[&{@}N_QW_FJx}?|˪L~Y49=
ߎ.\8ǿ_˿_? >ǽ_,)G~[1O>5M
դ4ǣ9;iQ
]rOU)
Oxp %:n Q?hwL11s:n6.S~m@ .zT ]c^p c ']\ lyJ XG;!vhUzP-yWf=a֡) _g%^E觥G;X} $BF'`*IIC/TO xU $aHl(,(u>qfjƅYtLLQ_׆~ֵҌټx
Jje_C&QSk6ʵ4
/gyNq Wib7t]/ (@A@28(، Q_%- h3c "&1?*'݆촃ߺ$/1ߨ
,a'.nRO$ A^'b
K ɯ?~3<GƎ)He;V{(]}ğ%P@SXpdєXD=B1TwjEcSh%^oN7lsav*1Oe9ڻ:M#FTn_3jfwU:+z"[F)\nbQ\r_| ?/p+<ubEդo m<Ff`CĤ|^OD
}e~1@ _@H=65NAN?4J sya֖nP?d-}M6@͐}h~7y1[h:B>Bңbqa'u8P$I,~[
PQw[of]_8V AiS]}`8<<ԧ0ybxI=zw;<?*P6j,QAK0z9 eBӛ:juI] G_TmniCM(-6ruR|5\^+%uh靦O`V.!
&tZxvl^GoX1` y ( tyhjD]QE]1]ݗkD#S@]<J`vU'Ժv>E #C*%W?[wxAIަ0;q: ɷdRDgdEij䧝QQNw훸zd&A҈ xt5i}Wn WjWyKp
$`lx?ZjWK
_? 4??zׯ ad_uk&ԯ : :Pv%Vi0zH*^@3Nd ݼݧ S|Kvg.eˢÖFB>D%8I
"P:,qY&sf) Y #&vDI~d 0h8Jjg(xEH+ 6+A Db ÌA4N-Y$iX]?5MoG/hvB 퐴*4K{t]$4=JRTKЭqU4fD$ LՏەt2\sJnFEAi"@s3y>RΛב
o 2x L'lݧ)bM= N,Kyy ' !)R<\ G-+AmfSkJ9(T0ÙJ$L`k?8=g^{ϯ .|9D=#xy } qjbFDhLh?F w*]ZOÝ\!YL[_w?o{G.C3Fh/_o} 1>G]_GPK{#߷/~?!>$և }:z5Sp |?F:+OOI7x/~ю n#~}ss?V\?e{I9jq8TK>ON 9ђ~MvnstVv.$;GA%DCG!Opht E<g"SÇ{X^=Orp۴IQt^֚vO
C7mGR
i"1?e'i8!qGBY/ вJۤmgv,Pds}N:3w|4
x㋦l QC<9,o!9E ʪαMKȴ`N7IќwR'<))¯o-Lt] G{%puЮøv((udU0IPUZRe Ӵw8BHbZ j@j&w$En. 5ǥ^`=c|3o ;?S 5n i!\ceӰʭ!DUpzÂ=|w?@WFS۴Poƥo_x Kn"} ]wI(#օK}
q:zZހ m|現 5ʘK<ϐ?} ͔w+Kls2@F }wΣ>F LSM3!O@4YQ}992NY$jv:'Q\?$&Gbh++8CmONRf4J-gV 1w bu{X^~\/u~Sur\DABe2 H I-*N7=y=2んf4jaIe@z N!SSyIJy, 7sٳ J]]V\7eMĝ h @ՔYI5A`җ_#z5(P·z^n@ ?E;2i:h}^J5FкicVYP zW
Ĕ6S3
_kA%0N{F5!t
>uTO>'I;?7&} S
ϛ SeE{H__w>ַn|%ww>@=mnķ#Jo.o_o~&!]EyeWo\lY_ku֍v*P܆/^AiY9K"ݟ '//?Ǔ/_Z*)15F{o5Q;QY "ױ^)\XL%Ya,<E&zNszl\'>odg֛kYc ı\/d6?9N`sd_kXA-`}}?}/}W ʆ{ :nFqB
gyY2<zE^t!0Ժ^S4-O1bQsGe oREcJ*= lW8,Z6'@]uQ5gulm4f iP F'D=Se d* 7KD 89+{CߞwEkֹktNTZ b e!t n٬='=uQJ+E;PÃ$jT'c>&Oς l7?|7QO 1:)Yug)3EuIuXq5AR {z?`R+p 7pת*
Z)+Wy y\^67oƛePY_˷f-T.l'Ƀ}||+.f kl{XݵhA B$GDAd$d JQ`ĠӐ[, I (|~91W$%>N'.6}6-xX+HrVrxWKE)w+kkѹ*bu%ivnHµk8I8<5xq70kz(a㵠)<zFL#͵,Q ɯO!(Blҏi0攙 B %Q$[
U{58.QuK4 vbhk-GN [?4
0v?97lz,-n"o Ƹ4;+ {HD. _k젽=4F8</NӠQjʓ I
z`OLAFPW" B; 'Eu <m D~ iھځO[$ Q KRʅ76wc<|vO[3daWC'b;d
zj $ L)="Qp -]#1>9q -]٭rԶ5UD0o] zDB? _55&eJ.|WH<*Z*fƱN`g}!ǤH2ED c~ } 2&R pC$^ڂ.ݚ6 A%f⠬ % qm&Q9FPsSM ;EgE00
,) "uxqpz ۰|tl ?_z͔ nP VI}@Au΄Xm` [ mx#C,8 "(=hhc
Qu 8J~$" }~4w? ]Ch Bτ =c6ԑT&fnU /k?B 3MXtz ߤ]:EPbNjB_ B
o7RT nE#)4u.>[Ҡc5Gd3 zZ7*~S37,Aα ̨L/ ?Km&a'$vh(a`-1
~IUݸg jh}%WJ ?ŜA=ɉi -ݨjiՊ4vLt)_ )xe@/P/3rY u=DpEחueM`eIJq;06DdzdzOR>\Nl7uO=HH }"z<9t itS$m@
:m떩o.u"$e22TR WwF*Fԗ P#J 2f~Yw$ y~˃P*S53G\1|Z #u]"
R+z`4gHz~:4Ax(@ۚVgXT"ϥif|Di+ydj&kk 5Ms-mlGUS'j40m&:POݯmlEUFvIR^یU
p"8,Q
ƳN+ 6AR)/mt\] k$WC>-K
22Zk *nY-uwG l<}
k7 [,w>_ټg qe}]4rQvRNl /OPVDGw8XHdIO0{0νwli:t"pPcz D>*9[V)g'[ m}-͔ܷa&BIVr5&ӵnXYo\AaU+L'>"64,?9fW뗬cl.y-I+/k,K>g7.aϟۥKn/^k%~ύs֬];8b.H^eݖ,=ſfq} d
q 7 Lf g[Nv!?^X2$Drɾ#1q8ܦ `i{'w<`+'ݯgpXrƣ'V<K[7rg6=KW]^W dʆwf5%3hwN-,DRpʺ'w$a#M%6 )Y`H6aH咝.x0 \v{mJ~FXgѲTj SNmw-.M QY [Oz } weϵ ~}J>{5ϛ`@|ws`?<QBlqlvvJ ,s"Β=\pyV`jdo~>u[>O` *Dr&& @jIz2=9; bkJ2H#(+e4N)(T-*0DFdHz |0%YF?o]v] +KrW]
N T.arѦKE+
6ת ʼEu ~yFJmGτc" C# E϶A g)2q
{PH x ~T@!좜sF9q> %sؠцkt' @( ROtR493'C#GX_s3Ƿ,l5fvFKH9@jDS]ґ=1!0rvڎ@ٮ+Extwod8_G۹- }/^cKJ;(
/k H-Dhc
OǢkLDwtzF(C7(.XWoMe*I۴]w:ӏ "Vlڑx1rm9OuOz_] Gt@A&$} -$ںN:N Mhh$Y>b?99Kavfζ u{'~xk]ykf &c'N7ۊ U~"u{oiG k'oJ5s X IfU:vm$.t ߕv,+OqjVo.XI;+XXDvZ`.ctc P*.tV[p&cIm3NF#1'PqͮIzD0(O谾^ mmmWf*Vx\[iurK ͳ:] R/aVp ֱEZ'.ChR6 {^ >HCl9 U,%YY96 QҽiDY{@:Kѕ'@['cpm-l'kM;*s"[-RqM y""܊ OT&N {Ύ =n~, 㤾)B~^%dmɯHK}vu{E$|Ml,%ݝHf㉤ţW,T<eK"FF_7_z^m c1EGt?=
(S KoyX+'4cCc{7-9[ﺎȦ=B2Ŀnv ?kbz؈&
GC=-ϵ~eK NKCObsV^Ij[Y? Gحt<߷.=: =tA}˭h=<YJ,D+3r([PmW;.j-Yڴ3%dGEDbN&-gl"Xfg-vtUt`Ȯ > LتtiiFfjy(3#yWއ(e Ȫ@ܤYm#g,92 ȼ AΘ+zT`tz `)|>4eKBE4F[E뇖mmZ}G lYZD3_:g|Z'-*8Գk lʲ|=fOܴC9uu ;=K^=*Y:4!X~^ ;s}6JxFz;ݲtS//8ZRlnڢɬMƳQg_~}s/W.uP(ctM?+* OӱE(ҤFcA
yOz}ԧDҧUSd7Hͦ))_m/ ye^G.;kMX` ~of_ߐ5y[3Gksfe{ξ fm;} ۵;ed>Bn 5 J5nݿيfdRKzv7+椃5Ue
eBNZ-6e}Cz~q%}CL?Mٵ>]zw^/ %[Xq+!$s3eXU[.dae,hj]X->
.6`{u{ F'{J :" 2k|r(udppyh[ͺ Ͽa B ^7q?m![c d'ق];lmwd?Vlvƌ1&<+/+ +EF]v7]QJ,kY<'(CӖ*MԔuk,>lQmj,1(;h < pϹna_fuc/uQα}7","aN^8 gp<voo_߳`CN_Nww,;a33[Y,ۣeߴ?Co~`yHd"%ӹt{w\ FIq]0/ۈ ~Р[_=!bE6
QmFe id,ʘD4b6;FȨE,jVlg{VW`Ά5-QߴdmE%DЖ=?"r$1H%(Ÿi)}RIl gn 7_0g1it\vY tu K$nm)) z9Vu7/-ζG
N4ϻFy,V\x 'g37!YDp;mecڶvkZz&|22oOܖ3skL"9
3r0=31T!\VB:3<n7r^u{WUοn]k# YvfŖ"w \@#=Ō-ِr"O e9{= 0rf5%4w[jKY;oo ?
dl}}n~KDyFdpww684gj^ >"t^Efgxe{ǟos[ >d3Rn?#SGn" -fR[9E懥ӣDFB?,b?azo5:}EKL -&0"L$Sڏ[AC1Vj"5 H\ӎ5g.YZQN\YmiiҲFP#bH}{H{0 tAx5YH Aڇn6?=i# )>> X[FO82+=e5=k>GO]jkGr% YVH R=H&HQA FLM$f2 {ܴ7UkX,]YxuѢS;"),Yqn)ӈ-Sdvb)Ypc8j]c ە1mǬ$T}k&3v(\D
y/^߾vɾ ri4D5ځ] {2A+"g]p'J&Y]vا0@}}?.4)c R֛^ XdU.D)G@\%!`K cwL,YE_hӋvx 7mvmϦrK36`v e?P[Y1O|Yh1^ Y^% fHOo5mj";;jפJd&?8fCvw@Ax^znӰéDhtKJqZߐt_6cdBcjZzFGdGD
fhfg6۬Z!zl7Odۋ4} ȷgDrm r/R?Uu(')G-2/pl1IJll_FןE_Bʳ|>u a9v6z/ r\{Kto11Dzc|zPl ;ݟX\}[ص%%7SoK[;}o]^11r&M6KAfoweu_b%^GѢXe%+szҼLsZ('g喅5nN$k"i7ƓvM6j߄k[mmFo%p^~2+W/g^zþU{rNfm<SNqOuV@˙b|p=H~20 @ |`|6XH|X6@E>$(Gw]' Fdֹ$XƂE[eՔ_#֨\nHu?On!1+?ؕ#$3AF+:/J(=vΦYW㩔MNNȈ @uuwXF
{ MguIX.ع >>,R-q-[rCeǧ©k7*%+v( X-Z 2_<c!A a 0Ex{ y~(#= d-Υ5<QlۿNŖ'> R
Y% +d/9} ,͇(4r8 eG7] Y̒|7}PMP7y=#ayG6Opun=n⎕Y%j[c3. e^L/HJ+YI" J(iH ',?&? u 4olem 9 Xo5?k_usRǀ]56$I:,H_ <^m爿?|=.@6Ӗ[ D lLc]ח!@F y {[fꍂ-heڟm>}O@WA`V~CEvrz]8ݐq N P$fzȽ"-ڕKvGcXDbкX-ԫ!
!zz}Qwg
E P= ,<qVr
;4Zu) D"#s"H͠@g3a$ X@Zd Yr}9h}Xנ{u5e]{Jd["Yãq0k/C)`mr2[6mU il(3$r2 w]Zܠᑄ ~9F-3"MЃ-{pcΡO yLHe$AmgHْƛ,,K8xu-6h\@B 0Y,lw}^&Ó.p`@9s2 \6oTm͂e<); X@&
|\&:qOKGຜ
w}d*l&8 RT3Ko=.d1H 9-:h:kt_wS+̮vg0g+շ w?{n ;5߱Y <dq be9ƂT IY8Lbɒ%[͗^.ڹE쵫פ#uA!:_$Wdƫ.X,wNmyerYٶvwmm{n4Zrz&V%DD _`
٧B l B}ߗ):Eڶћ ,"Y-C~MF˷9UfLe|jr o ?^5Q 0^9,[,
0 gR}
j`̔yYhحw={-YsmM"kJ.]4|嬥'd a[Ә,4fEmnhŖ EBJVllp atbEv aYxuXnzi V}?NGszJO#z<#{PZ OTM|keTP3Zԑ"RHmOEzV#ɪע%eFYO_PelcE?-
_;o3z$Zs\MOg_;CvkGD ~ 𪐡6$NMm4pSg++JWse E3|SNo˯]p
O߸rå_:DnC.@p[dL~?l.n%X*nwo۪ l8mRɶmKrt,P_iX
Ă|ܑ;4AI9ឬp-LvVl3&{ Auo÷ k@ 1 8K!"
;[A
5gge@PVc`AC*C:U.. 2t I =<%koN Jo@p*b
<xb0u(_gK"ǛGV[ > LϬh mfvv鼦0U%m2G_||Mj [VγJeI:YؾJ\ /?>אITDgS~u '?DŽ&4?E3=*'mtXv%9aq{\MeRzϖ VĐ 约{j噊-̗mof_>v͙)=?9
`4L6'3\>8
ULd,I[ re Ĉ
ثl߸`C ".ZWπ)kGB"SQ69ar ٰzޒŜ=z-./YRZl;k۶#Lc>gߞ]ɘx{q}Р=wra3avb=_DC9?}'6Y V<вyAâ邝}l֪}]F^<-}g$
ş?ӧ#Pse i:p= 5cD<<N
J,
ҥl53]߶ŝ=YڲH¦dzY۹ydٖ=e1]+P6'+}]/~Άa+ .oZyB[=G S~ y-B"[{{?w?>}@i|ɖ|#1Jaxu] }?KvrR[-J<YOϟ|d_ڣAR~`=f(k,\!~cvviac2#M NXX`_;Zo].a_le8tOr!dm t&.Xdcø Ypk :e|ajmm,:tā:q R"BHZΟ^ yA
)GV.s,O{g,1/ (0p6K@e p bB XV" `2" X݆*t
f&jRkQkU^҆ ;eYkd7PȦr3VY:)P(/
7q&<8:w4pb7 ߱6큀;ǕJNp/
zzh + @4HONemt*:c9RjQdJ(X !mS|6NC1(%" tfۣP\6 3<Ӝȥ(8h3
% q lKju2=Hm"z:i4p)4ʶMU4
;iS5;Bv;Lu-@=kr.;2u9Z.Fm>zboggO(K48cdfh,88ɘE+l6/" 9(tg8 " }Fgtv]Ld/kr6 J V!NAtM~#鲻 ʮ P 4$R3
[ڴ=ڛG;AY
uM+>i9ȶA ?% @H;vwf'{Nx{,Og?x"o ܢ$ 97^XIwd]SE'LϻEw -nZ\cJ7}z&.g6oy:f3kgjN!fjO% iwnۃUOquޮ@REOW#3tqת"#8Kv>{WCQ럚QLվq,zCD:3k j<t Ph&X/7 Z "Y
u/ߐ][v9MV Pk>wD(7@(uf xTYge,0swݐ?g̈́ LRF"6?' // %k; oRNyrN럾k_7;cW~c 3F ]Ը *)фs '"ybJ/v ൜] Co.tŮ{z}AJ
Md̥9}6bclY_/I7`0 (^@RgE&W6mĞk. Gm ;6 |!eQ"A{l E ]y_}Y)X_i}u+Z7R䴶w[b{v|=[]ll }cMOK_phu]W / t|h#B") E`ݬr)HsesqDfsUkdGܲ/זEEtvt}Nvu8f=iH ^ q}JzGB6`AШ]vLo YYf ҵ7o? |F2UwN;H?Y'u{ <-(;X: /25U֘ +&巣e:+YnEt67E^61O_ Qm,mmٟ~
o_t^dy{G$EXhVlzfRU;} n
6YĤ/++z7 vy ĔeR9K369X"ݙrӲyq .`:o C}nԋ.u;v|zϖWt?Ikgl{}٩HݯXF hlquc <HZ{DY_ \=aM!EbObuGڲjB_sό:%a=ۻn=yn 4"ics v@1M guv%`W׳IεwضdoV[Ƕwh+̠>P;U"=(
k olwzSq^>w;ttj$\F䵾7ҥ!פ34bCG13vˉm1.9Ҟ5oiw>
O7yj@s>g۞ucP"z8 ~N/U H`/vooTv!Ǝ Uf*6ך=X_| / K0.#6%qR m>+EwNxnq2- %bWϮPt0^6Z/Nm(͉$ndjqtچ&lmqNoE6?װE;_m)$, 3 u) N z 9a\ w= bgT86FHc skn(bWڶMA
*n5K|&"#M@2EuMT~hm o gmON jg ;. hZ1 ukO%ivnrȼ;3eޒoauN ;.K Re ^ 'ej K͗m(AD [ etP
-U[nfU W$P-HNlL3Z}QRnx<R"q ,`Leȿ :%/x. S*@6=$ ^q️I2iE 8#rn%,M8uWdԃF+7oAtDGZ;?x5嗶-]X No?oK%Ĭ 0gnj%%,#%+/~l@gROZdn ٥a{{.
/\s;쥋 3 "oq#`eZg-UjZNH
YC';~2o5liwONif6uVt2 \ͱte hQGJ6\ސ
|?ĥ1.d* ibFЧNΐ@PvI$a폳aBC:t1hgE 8fr};y.Xzls[Nhґ( B ,#HJd!k;ug;lnKNovMYHbXDڕ/eE4.Q>3q;u,)=x_D!(Pj:l_Xڦ[_}ٰe[\j5+T>qS]M:9ـųO{r).@({heH F|zrPa _ҽcɂk~FsY̜ Lkŭc f8igitG:'< zO\go>/%GC{- \lZ"__ZyRv.}FhS9ˤ[ZVvL瘞/ ɇT^uކ9uq%8t\g] zuל9^pC>:oTI:߲LeR36ʊRFVx@Z|tBSQklgؖ tK'. @) @GgȈ++ ` {43 P`"H#=I{x^u?
Xއa +% ֚֘r]i&k HWe]`XryC_Q^t%[J
L )]_Dv.:clO5fdђp Qw|lO ك=߲kJD齲+`9N\ iuV獝[h"9]>Nt_ H YsyK"&<D4m㱜|ޞ5vkM0٦[e?\ z߮:kt=W6 ,/, xŷppkvex\]T&0ݧk[&QB&MO9gzR^ͅc |G
=4ҶJr#jy O~#lOƧY0f)apJʒkn
uШ6.;]h&o] o]D'x.r.@Q GV<gbJ9KVj4r3˛_ L¡)-j\-䒽v/ %2;
@A!}P-Y"' 'P&o!\<@đîd5ηow
ׅYo>{Nv @H~=>.|.KO%ɼp,h#[Z[>pV>Edyf+iav%+%Xf1atC$U7۹K]N%9m0)";iչU+
eeh&1kYk# |Soۼl$MF}`2E@)Št 1 $@x>}~yy^cy
)Y GBP_p6NC{溸K-{ mێT 880 YZ֭#/GVXDoXHH 4Qg8RȢ>$+@Xw(nWzo]괋"WctzFmuشg<4Gh R 4 [Td{cVaBjͺ@ö ed&]
Tvݲn5r[ R?@|zL`,pc"r8࠰fUu$A$ rnF8 &r{$-6i( ) 2IΞl[o]ز{[RWuMeeJKz-ڈؐdXeXsK:g=;fcl嗒FUs2 XBq 2쁔qR 4pv
,@\cC)q 4C:Y yREzl&"K>$+ V | 'b;d7:{:D@w08;20Uѽy2+THMf E֘ /% e@z&M=] d.3y6L\
hѹ $#%(W=/ _) U֭k~6M龀tUKZeܾx7qt]3K;d U;4Mf9j:_5wo<%xaƁtvo?vFǒy9i ݮ7{$*`fgEG- lh*e )͈(k501eeM0-Ұ;wxKŦ
Ι{N DXvD1";g> 2˦ |"[: l"$2`@G693sg|=@J,'If]/n#ECcKԬ?^& #[^oK4 /5{tgӞ<ikDz
is <p])WrMuA!]l o.+뼧k6UTaQьȲ]sV_Й.<-ڍA{rE{sv^DL]3ACJܖe?ÿTl/ I6=i J3uɖ^ w55y.z-2yNXp+gDsOD@9b^A pA ~N6ZݵS[?yresmC7?mm#eUI֑N,VB@*6 |ڻ-=ksyKEu:y L%}#!( 7kpe MRpFt OؐBؔM/lnمk7wpV_iZQc>+Z2cG75u o(?k#gAAt .}>^eu}yߏ
x6K$niEb@ |]pU "5o9R(:mӺp2%Z' ~hn%/EW2ĥ9 v0 "5*=k)YQ_ߗϿmo>eG)ojk27Eu]Н.t Z5VNc连˼ Af[:eV-ص;Ǿtu{na~EbL ̺l¦myl?8"gU?//@8\IU>1t^#[3.ߔ-=5J6 < df6o<? I=>EߢP@Xv?
[F%bs}SOap$n* 7"|B UkްPaNv~c[ܹXqqK6oN`Yr^>sActZnV88
ZdH$F=䠣#6 NH&by4 (oHl@ )[]6! ڂidJ
Ӯ[)FИY]#VC
^ 'X<ug|'q@;}E> >П;r~@_ `<&>y/o H}>d[U-Iq",ѳxS3/_veld 6k9w}/8ό|+yoJ_wlϹ|->=Shp{.FI߾onUS<q 삆0@V,"_ .T˲gu7kZy~Ӛk:\ ;wK Wo.ص}}6 0/drҞm{~>?>췓w?|[ r<#`K7~!Np k%g"Bp q C]W (A(Gb K2qK3uYpݲ }A'? wid(2Ԃ@cR Zcqmeu@XuYOf*.`*S̖lH{0u%;Ǭg"lOI&o>⤗Ȱ0 q0pvÒ鄵^ye1AG35Y1,ҖHKmڰcnV _ᑀ$$COz7CK + Ljτ!E [ aD O &0> +5
4 !A[9f&EzF 6_ k/\mco[{bt/4msgղݐ ʀ#N>D|@xr[c7̆@5Nivֶ;ݕvٲef+NcA9lۗIR:o]'DlB'K%Wl" JN(gٺCɆ'&իڹewX5G ʮg'8#;8#G&/,{$/0 ,#zQ]>G)á{1 y9pӖx5adm sS H" :I_# yqV5`uM;qh^* ]kdv~7m/huPr$?GROe ,MPj4k 9qq%' xKL E
DR51~e9q g ǥGktJj ^bcш̚Z)\8;kGKMEKnl5umD oT}L2N6 셀3}@w]ֳ<"ߟ`@{r 0 I >ខxH3s6ؗ gYi3,/2句vvϺY<@{@w"Xf[̌$,.ݹfOm;w5Ddl5qfĩ[v%<#f*#:B(-9) fD^r68pIc!i]Ó
)>h<?._E^zu{UaD3,XXFy ̴SP\ud Fe$Gfg}!H, >B2E\P-0UammfXKWv~$B(ۯg23<k|CJt4zg"d =e*m}[N~wϿ~˟9 ] { sJ6lI!M>lnzFmPR@A(,"Я5,0۫gtOEWF2'z,*@&bُP8luZeQ$/k5[
rE@ܿ-gB%LqE.BdX eUteLD
A[H~~GGq&yė p]K8kvنҋy' Ԭ{<{~[;GE +2UTldn?zAѕYȋ}(^ X0i _|̖e$%i]gV$YXwno=>훧݇$;yj"V~/S6- q9[uAC32m=ʉ
d$ѢuO$l@`2]J Q7.ڐQ!31k]k2ApkXOزûnqCm^?| F =(HEXI Mi\S)b8KSzl爵zI蹓vX~L/$1/ΉUYo=ag%ٿ+ivoڿ'~F_Y+A Oæ?id, ?y&ND^
SDD
K/+-;0"6$Lvip>{] D&\J8`$,[@pbن]q]V}k9x gV/溮eQt>P af{YH xyOCp l !d @}|g(N ;_.'bMX2.ɼ{C]흴A } fpq }r>z UsVw=xJYufx_% )pk/R KƊ ՠ8ᠶ隍S"qĴ4:>d. r}.ؤ%,>J+;)g 8 M}{ϖgu ^x x/c >1? Fy&>3¾"#ݮ69:oԊ2P>ٷ-ӯm_7,GV 0mr1Xw< O!G]Δ\&dCV!mYnH/)<8f}r}NW{,l=1mC"~z=Dl D`|I%-WG՚MˉXL
( D A$ c H?3pO@q- ýb]g p^0S(Ő#x00&@@nE l}" @2nRYE22ʳ+ЫDnlv.h¬KcЀ6o3-
|JqFraEEB.it4;3 P]ޱ
w{ M:q=Vo(3 @jEdk#n یz}-G|XF,>DyDR}ݿcdfzG[$KnEZ.#[ -y!- Ԁ,T Ф0|u )uL[vA&E:~7Y # qF dED"R 0Zɚ; ZK:!&K [jwofu ܚoQ̂}Ͽ?o{QY!3 ("PH3NR%!(i>3#Q_88+z]Ʉ@"E}o8+pK d`L: h\"&R!?,'}y¹PZBAXq}O tnbreEM/S @LMYl"r[. (U]+D=%F|df+A2 l]qGf % yIu59<t@^"
M䚺Q{Nt)Cm1إ0kR}L0%ӂpzTJYn(_:E;>Zwht5ui.#,X@.)I7]V6䟎k{Zn&e"/Q٨5W_r(4{͏h_^^}Ut?s_b\ YLj4=K
07
E 4{1=7(pF|fAL* ONjMH!|P8PA Y |t@?2^) H u+/
W-Zs˙rwo# ~j T{"
!),0qlc&Ңq-XlwkOL 26vG˾IT,؍q0# 8 {r6, T4nϬZOg,W4+\H(- m&C\ mizHi"J+a^re7KymsKuu
{ L-@ܙ̺@@r
1}zPֶ貊n ѻ߲$-G"ӝM8X(
1!ᓼεX61Yl1Ԛz]5VyIa<2 ٓ -mk 9_!9 XH K7mn?ymiM- o,ݫ112'1I79} ?l~YDr ؿkW.߰Ͼ~^>,Oq>i:|egCߙ]F( cAvl|"gLE@SE|$0dT~و3 N"71k%}ٹApfA9/}"XeŚXNՅ}{?}#a%lݕ% BɁȑ !dZzF%c;MӚ]Qj%KW/^ kW6\t7UdFx4mz)"h$K]n҈`#YEI6eGD" u+V\$Kö${KJX`B:0 6 ~܀ -` U{f!<ș'#~>L1[t}Avgo'큁vrkuL3\Q.ٝ?]rXBXփw 6 P /~뇌"ϳW|FhF~}fEa)_=n>5z,lјĝ_!֙sO tܶ><2gAϔգ'~ ?<%Ҍe} wjgp>/f _x.ru>4&Cg
ޗs? ޗ}Y [Oۅ|@ y~ @[;&֮9$n {`ild
V>iS' `M2zȉ3`p`2A@`Xڎ-mm CRǍO+-Kzd
+YTƺFD "#c3 [bhZG@dĆtCGD ] @&, X֞
3H &gurA)E B 3A@T]Rd 8lHF0à;`pA`#(Cu#y iݬ~_fA
V$nqH9"?Xr$H%3n\NpU`}_`OģMp
}^d LSi`i2
-ސX0wf[j- ƶ1PH}WQ:\e@X!aIHάpș7緬,G83zCC
'G5YDN\(ړ-v%;w]t r3YCYeu
s2 dNitH#*RklkK`{r2Y" xfh>8 eM l)qfo(f*46>^`B*3RHEX
$R @hn#гlsۇ7?j UTӻk_B`CĀzE t]:L@ nX={dơB1/l5Y6("1<JFbONJ,{|Q$!mٺnh%K.,EUD.gx*lXaFa+
J^+GAyH E $| :nڃ|A0&h#ҀS@5 = "I(SŹuۻ}O\v{v}`Y@1 ,H o&k.`ʸaT9;=ٰ²q$c+"
So`/EyXBxsұ+Wl`2VɸeqX z3?o HLL74*{V
nG$?+=wgg
pt ,."~?UdR|\:?Žj #7$HS%KHq?N5Nb;cJ?bgq~H";ǫ6/{?_ӳHg2 ~_w~+/, ЍOsY``MpTW!GlK Z"xU~mJsK{~H?.&,}54j t
OX|ZD_v;WؚH-:]ڲ|}*)꽊Sq˖
N#"! 6sX=\ӹ _?˰ ȇC%R#2~FB I@G$OCZtwޣ~&9Y,Hr+.@ddh DuۿԶewƌܿo/;o C t< '{6{rn
FD5+O=2oՆ[Ѻ<Gٲ
E+84G u5=79.Thaq~Rז2ݔ
Q2H&ʥ..us;M0jjπ* -,(O}Ft"ɪl{uهCKB`` G2&eTxxNlt@ (H©JzOφ#=d;7 X~i\@,>oQ/YM?+?~OkVWHKY
Qq䧶d;S5wY±'][3929\3+n%bSv5]3K0K0@a2d߯X8[t\>,$?/YXu>2UpY麅3E,%6<oGwO2(^=oEdߋ{` z_b l3+yyw kpsʦ% ߃;w>N|77 :}J p I,^<:CKR*[Q8H-%\NN2&dXڝ5z+0h'T02qR~^c_:+zz6\骞 M՞^˕)TK\vgL&ْ Ft/\
8yپpx9 P3Ϗs3|<<Rρۿqծz@nB"Gq|r6nXzNeGwL2iAB͐(Ez3kn[D"4-|H}!}2gֻl9q
peNrY a5:$w-1
g& ƂHCVkZkejt]ek5kK$"!rK [_Y^ ]_)P@F0[1Ʉ'eC h`9A\'zM 0f?cemEP hL2; 60#o02bh8=LiPu] wa~oց u}ywWrUǴ
"$BH@F^NOw& ,M#(-RH,ҢHɬ?̮M_Hc,i tGչcE%ڡ$%ҌE" r,93S㤯 T^k7[oE"655f
(kap& ڎɉ=x
I Cw |9fKe䐢O@ekflPҟ1@ҿyDe )1!p!0؟Ը0f'B " BPxݏ=\vC+
P'֕-cOe/{ J_N!.QdYizn۞|cG2-J_Kc<HƣȹO5@ҐP&9Mp>n{^~ݠ}Ig &#n-^fC{e[ش PZٲJk6lqkǚAҩ%ϖ@q+`D&SN)d Y \, @_^Cp@(iDE^bH ¹!AĶsz_ ˚1Gٕ9T؎i'w Kkv;B53}He7Bl˦!kcGS:չ1kl
.4YTτI\v-6OlWKġom!픲)~f9KlWzA{e{5^߲Mr)M'RDCκG'^1[^ұ5DO>:1ĿF3]Jݡ茖%IIGb]3aEDz! =䌎Ⱦ @*x Bʤ-D ceh_#/yR>1"7_ _}Xz~7 =ВCih2$KF12-6WJt/9]5N`\: .d:oCS1كMLEJ_|j^|e]C18f}
$#
ñ%EDki n,[.˕EI;)8I
̲
§e@dD1$ >=>86}=$A>| ёlr5ӲAAςCٞ}圔B>"r,9]ܑ.ɟ/ȯʿ| <Oת{-9_\o--ًy=[ըt4$]]r7C =OĄqխ=W#єA \[6.lӸER<U/Z4X7Wet?Ecݢ%Y둎] ٫7WµNxILN& )
;)Aɜ 8ɚ+藾Fi.+ʠ^χ(H7>%Z|crZRpbeuQEl76ߓK)pIn`4d[ϛAQ,@0㳓S" !9PEʬz&{Kgz6+ȥV-mO~ӿz|0"4~m!F.@, 3kwmaC᭒YU@=VFǓy.M߸eb}zCW:gxҮ
YP҆TȮEl yH4/y[6@~\JfzfWma[$Uz^3<A >4{N ' } t'w|?{'R}Rg
7vjk
~_vwg1we 9̊#_z_Hg/LUVjd
e\ %ս6 ,)1$ WUr%̥Sg_ @9 Xnotۍ>& 喥smɅ(uK!MSfݴ:kѺ] d:*؍д]̻_&{gۅc|} $= s [ AC~s|ޏA>c9`ztyݷRisu;9OnD58!ڲjEX]8rMk*Rh-Z2Ke]gDhaaA;wr]ao\ׯ_+]r#^
RL]HHO;՜-[Zjl*m-uXsՠ 0q&"\oD ,oo "
;h
j;LX?3
f%\:>K <yN:F!7gϮ{F XsȴֵnI _;Vro! 4%p)L;I #z- Ț_ff!i
B6C{Muzbdx<+mpilVmؕw&GUI
@ @ gJd Rd\'ʕHQ@ʒ9
n 'u9h^"āv3 /[}ܓ%xM@m0IV<3
{dS_g$;% S_t CLqw&12y[ _b8f krVu\oٽOe?>
>+#?U'
gKCq5cV;A ]3*5-)@!¥>ҥ썮NBwmpB 6 i!wNآ^zeOw\ pVRN
tUΣ`SUIw̠ҖdCFZRX}uV$n&@g=%P0- @0l@e0c.( 0} [av'=P8۠ RE 4̯[email protected]KV3ʢK &-d%yiGyfme4C eڻ=8jf"G! K`Jf Q!p!Аusy_Do*,s\И5Kg,_o-5)D$oѼ<E2yj ;Y نlӺL:jx M qH֥:?F] ƒ >Mn H=S[@^38Y"Ϭ>_=\>ʊ ̜G6#67c+k[O~`?]#9t>$c4`DJX xV\AVcm0 }ؼ%UK6* &10lWjWa]i^f^f;{ݲ6 NM
F
c6+3<ײ767gjղ՚ +ԫɘ+$ $]wBt? GW9: q\:2! } 6\O[-l$D- &`E*HN@>3%}&Z[' |D m+5S xҡ
ˠ"B)|>~ }/J4Ft}J\
t?Ȍ 7we"ww@~,q+WE 0^]0pBʞ|=:o]k ƱEjKcTsY&s
qVÐ-985TFcdQd(]͋S,HőxUA yDC]?}ϧ" >(t B_z0.7J"ACQm#E=lw^=+פ(8
q~7oYvU~u{oޡ5j -' wfeGcR4?O47EN d{E"VE }d?QaׯݰDff V.,Z,1/x^;w^{WlBxAh. Xخ%v9騈ޠ6oj^v
+i~tJr`gaE>$ᬗA;)cI >C,56է }>~6l|~1}u }ua}M+ҩMl ~OE~g0{ K'\XI-gwb-l_y`_#+8 kjlnF,S+n +)\JAim{V]{$@cĒ]̎Zytbͥph WpV8l7(_&!
ʻ% A[/;zŏ?6x3 {g){&0ocl~x;`k a1:<ek.sy>W{?4HG$X@}k6hi XDIҹY:q~Q+`^.9q=IhԆ&ǬcϮNi_l/_< `*>q E=4d#2(dte63,n}ezx"U8%io12Ds 8ȡR;>@ 4(<@7wi3 DV 3 ٬BC`OƚM_k/EAgXMtfŪK붸6ljY
Դ eg]YQG| O 3;=Z"ΐo
^ݿ+ {|ؖ6H4~I$Ağ@i {]+o ̈ZvReH Pf2*C>f6Yun
32R Hg{1?sKsE7 v5_ݟiҾYqrӁt)\;,'c #:ұ) [j!.Ȣ
> @0D35}
aiؔb iYjE҂[疟䁝? }w?%uK+e]-tI (<:%ڵ yN${<b{l*ڵ>ɹv{>U+ʵn{J}jz^7,F[ru ݃6ϹN!Z1{A_|ElJӭ Aώde z-A03@ 2>Dtiňt {-XHOYFd#f(;wL5G)Odʛ({4
B̂RE`m ,*aW6) 7UE^V zP2 u$N@,$:Όx˘QpkGEl{';O Pk5: |΄1ҩ5٥Q } ] ?̺%ƴʱ_j2jSIӪMKWER3.6 *dHw+/1sҾ٥v3M2ACFWRADd|YwF]9`@_:o">"LiZ?KlvpIW_ dȏ˗KOi,;%ul雏֝w"
AV +!_wd5ْ_4{~#y~Ȥ{DzzN$3/]+7UWoEvI+cC?X]Cvm81g_n骤qtpIK,ݓA9gV? 羽ߨhE>fC,% IH~XC~[;Ҙ9r
Yc` ~s0j`
A[}jm~hyN>sfwE4V͋$ $Mc>8&"ř1D5>dED& %aق
@Vm(x-[[怼& 7i mk|,M@4+&e8Yn}I>-B aŊ
݇EKM=s 8l`<2vzxBn,5 "nS}2ĈLDㅴ -4*?cgy齞HЯ@(1'?4N`!CG4@ i+Cڧ1bXE_Xf2a5aCvOn᭛m7ܳGo>|}/~`4&_FxVjh[cpWvSxG$'N+UKą[4^*
/I1 Jk v^tվxᲽr庽zrC.Lon{mx^ /
>HR)ᗦ]
^ .5g K53{"KF {xB>?#0>6< OL [hjEEctbicME9~^ľ&Xl<
RᙵfFܓ^1[ \'g{Ȟ m8U=_OnٽNmuu4d㶄7Yޑ`%
VBrK Bc7 ' dW˜FgsBDB>_{2n a[RwO$.KJzNCi٩l$\>. f^p$g~,*"<#|w^~ ߏs. C.X 4 Ʊm/l >zj_v
I qi8*zMhr _anm TȰL
Es""#ϕrLddܺGcdn ڵa/c5c #iƬO/~} D.P .fqavɄ4]}0 @@g %C Є0h8"q~. r@ ) |
O: 35DHd
s (VuD>#&tFD0 HIW2"8ZQƚe#iwYmV\J/0&OKǧimY!S&:v,`艢K
+d'vhN$;9s)3;fRg"ƚ"w͛'f])N֬onZe~jr5ge?1#=4i=C.g4lCѼ U9<@cy,2
i9ˠ!\6t'aF/>DKƑԙ܂
e#Z+q%rR2y
`08K#!
HZiLc;"Xߔ=XŝuM?ꚀjF 'JN,xjɅ[++!L~];@b=W7wMU/.Gl vJcE ge~2"1%68 8 rE_9~ԡi `ju-P
l
+BQҽ@]w=F +IW+d'y@# ؾ7Ô=Mi YXkdm}^w<: jf9D<!yͬ.&~ho\[t8Vv `;(B4{%A4z|BM!; 3kV[VX9{hwm 9 rѤٷA1܌ L!1YpԠ)Ψs]]k
e +]]5ϫ}vc.N
YuФw5r$qg+ʱ\S怡vlg$>=t,yEJ1rž-Xss[aٖ|hW? H ed iD4ExUJtݹ?ʧ$#v.u*%뛜 @8Dή)XGdںEתt[_a
tHhB"e\m4^BsE/ *ݟ>Ouw"@ $C#"c
|ݓ)/!əm{">a%$hC)sN@r~O"n9VJt
\E:9cɖ~GvWmew^vEmr
xI_-ؓD%")" Hw)ٜGR)alVio};9>
}}6 l `qzENlݍK%7HصqaFĘtENGc56(ݧ+ {jHׂk vg.Gu*1 @_5GϰAtv~Lft#2dG.x^5l
V\`$z LO!.~O>e }0\jYucÚ6#bo>GO~g
V<IKn8CC|Uln_nf-Q[TC9>-;(-mdƣ? )ePخԔuF9Ogl"/"0`RiJtI.˒ |[Y~PAS/W1I_+C CO ۉ"=لx ՓE/~&e%jnYWy_}Od{ چ+o|Ŭ0@Ͱ;?sN Ϝ,Odc~~]_C;{b[U֬l ~ x֥_ Mە̳T]DidF't՝*U[=:pӔtڰrc^6j/wK&u^OXC\X& > .ֿ7BϒgI'rg1~,?voo_ ,HFr,8'*V>[:qoi?}joA KIe%g1fݧwmn¬ٖOEm(<eVo4 2#"` 1Ri̭#FiOe4ٗ9Y q1kV^bVdEY6mP[VC*tQ D]@ȁk;#{̨dLF!zʀ B#R
J:c>]nQf( <]ѻ%]n/EPn?j~tj K(6DVopʭkJ`AH搀WfGEIoZc^\ @{:/ҋIA\,8`svrj+"s2ؐZ4Q0PZԀ EYDF ]rҋGc_NL`n߰K]]Mv}x:BOmMfUY:$"l ѹXDf
P(JM };n[\ Af
+p'S{0H7{O ϘL
7m G`D[O!X !C{Fcww#v;u?pdeK V6Rcb]as wv+-# 1H! BTBe?7 gIT]/#ǔ,[4+Imj?gQyXN/1ےh3ѰD.·*GSӖ_ma=\C{Z߽d۷ @ Ĭ;06BJR}пn?0 k-HQ@&f#=]$z 3+H=,,+Zhآ}TFC=ew =k= NhJ7${i0@ۜ[>.(x!8&SzFBRŢ-꙲EEDA,| ThV~&'@}[z2 )xk>w>u7ۿ}nt~mMqnFq5PtK>
Do)Bt g|0 p3 E
||/%`} :q/*cl/}4_`m-VfY}y~O}eIvqGFvYY1 2$2KR8ZǟfD6?$ILaqnh
JaS_w0AH̚tNb23.cdL6%V^.^;Y`qh읾XK y=Bދ /2 N=z=z&d% N@ !CpPoox:3v#Ұ>ZPŮS[_u:5"[ .k+{B}v$Wp[1۹ul7 = WD}Apg7E+.&~e` *= +%e,LӅeu7e2YCIN*.}t= d R
Pg?p|VN
v^ŋ=s oeyɮv
إ>;l
SnU2Nytޕgn:g<Ǯq t zwdp"+J&`$ g4 l@&/҂ ,Hɮ>miea"7g߳OSBs5k$%7-T9u_|[;cTe#9Gqxz"K3.7Exs?OJgl^ǛµՊ̮-+4DE&+TGz硋 ~zb!yAH= 28yc]G.x&x)>]|4fB&k]ӵ kGOz=<ga*pcA{
r$+a3ad\NJ&2yx:}tVd7c㳺M7 kH6Qxye WF3.ڿg3/l=45}# :Nҟ\t^_}`xcsyq~^s1{<gɽm/wh<? 3^u] tdڿeyhՅ[Xwg~onf2@y"`v J@' muvk=ơ*p5z̎C!My( 2ssv]6}f[I1aH?ITºG\dla[6#
E[^[暜[YFVD dP 8a@J f#V gD|ZtM.[@`L]4 dMIxޛ^t3aDE nٴ
$}ONX >k%U_Y*K&JaIʖv| `
I\`Vv4
Ҍ9 HߢA '٤jaqc?8wc{{~ >xP/̧LQZҕϱ2%n3pwKMI7&N[ATLڲE=jxTCik^)w$% \ Yzsi0 5)@͎na A%B9 Ps%:'u}0IC&ה30"4'.@dҏ9~Λ
_ Yv;utEҿ-rwmkeLϭڼ ؏߳`YZ0`2ƾ+sci9{GsudC@誮"&piV PQ.CDÌߘXOR99=jڥ)y}"kXIsoީlMYPCJ _ (Ya|2J t2? M>
>f{q R tsʸtb G4{VTzقL/&/,AAb> l/= 4@9 DIûط~];y|Wx ` f* h .*=: PcBlafMf 5~ %)IJktUĨf gw߲ez: qWjit6
Uúx%t {J .Su ?;x tO| .)=/4d
l٦ "X(yaN,zG6vlP@J@{{~=[?<ֵIoAcW<"3B\wII; PlYcƆƞ춀ۼg_( R.{>Иd扙.uoDDo^ KK=vmH~bWGR",Oxa[jme[-eF^o_$; "=g4(1
= ] ¦s
kLSjHV`r2C c}Hz$]zݭ~Nc]P1x? `Ax98ѸL&l$:eo}C4
FdS Gߕ9 Ҳ)mSOJTvC{ k!A/F_=|ߟf Rk.EX{LzO%wv$شI0NE"{E:&v}<'Rpz?"[Cu Mk1zAauF|ڃ.ȧH+,xh֭mAXi恕5Vvnۃ?\zl AXcEzkfӧ@'@х<C=K-[;gW-?n[nty"ʅDF( ( er92ki;7IɄ] K^Jv-Tҹ>ȚDi*KwZ9ĺY^/GȢJ
@?"܋|g|?_J#[=/Nul#SIiٛ ~&cI;5{$E"}}@`W~}ßwGy{ }F|Hϡe/yqO 2!MMLZjX#X*. YvGȗ<䪞0i^#vz WG3yeJ.xn! A
~=O [LJ?F0څq? ;ڥ} voo_ ,369L5VkcO sO wj{w;FʖKh`6 A<eHʨlǶ ˎ햄Avߐ
:o9G,[~kHcuM]QDƺY岜R.mb՚ i02>`? M$̄ ưΏ>(h pHMV϶8w@@@ A gqAO(IJR~ , ۠_JLvkqɥPGXu+J$3d%=~F{}Ȋ# s ^@M R:;={=\`ǁ3iz
qb" GrNAJk'7 S6v9ȴ# r&(7Kj 2 5uaaYR @DKImsF]¹):gs+q (,J0&A L &d]<@gA0.NwO[v뾟
x`v1/[PObvaǑR9v݃ #ȿ:&1Y``{nɣYZ1*PlLdh{nn(CG?ao9Xau xvESKD@nBNQcƤÒƑt]3xѳ v:wIf.
WGf\t| OGx ' fNtק =% Bƣ3o'gV
ۮX\`XpMHEEeiۊs"-EY+Tgl];Chтƨl*Xe I
^ ah9 (>)[v CB:^3{?anCy
<ZQٸq=Tfw{_y *$ɾ
( '[1 iSǧy2w0 x>Htϸ ]xN^|gu :+l =< $x^|ߋti.?ڳRtU(r6WN?7vS ú' )"#`#f97߳w}re~eQ/mi <巵n(o٨١=gi
8^rQc@TR%pm<l|XfL m"!c-~<IS-B|n]KV3du$1z?:@pً. _1qғdRU& SwV>-x!Da$q٠@ //| Ln߶sWKF ɚtHJ Jm^klq>HBy$Pε% -6mH;ֻlp{Ы#syӮ 5 A {Ê+={$ tLe6g?&@XqHL P2ŊAEf ؗA>zO JeϿ{>X%3^Ȱe&32@.X&mH+p2 yba7|d+/m X? <~Џ)V'P "dN[rN~YkҳEKY'I-ɆCkonC1?%D4$;>M{>_Y) ?Y
ՈxQad~2s:'00 O'd8Ƞ'Ap-Bge~6mg3$BDѓy<? pn5srR<L ܹoo\Ni+UdtXy}/ù{y8ƊA4eU"ۆ{Oߵ |hk;{6jWһMg#! ]TBO%=Wʭb2(<S)ol؝>S6!}6Pl}qp'~{ y a3 Mt_^}Ѐ϶ |voo_ ,H)$u8hG*-+0CCik'@!j5WB!U˖Id4*y{ps?<4z4_a&l뱶6Cz@/Arn6yћ[2
2אz".qUjcrX Թq$cϭ
\#5:GuDq/D ;ˎp B \C?%d
@@* G ' hyG(Cj
k--e%Khbeb A
Ʋb
2pYε[}Wm@D#@
0֕+7,bhPb[9nIǯ6{Ղspb(t cV뀠ˁcadbJ4鍱 ,ˈQ q 3r9{GxtWׁ1}&Z p/k
sdo -H0uD[we xw2 nYM7]3>=k?[%cRúi kzs T36N0E0*s=Y\ڤNX &X5قofv>H3
5CQ.eIK/}H t_&@4 m1,ˉEu58 s|w/
x,Ο⧟Je~l?Ƙ>
g5]'H59k=@$Ya,[(ro60=cσ!`PΩOq@tqI%=S )d&c#] )ݘP
Kݲb%! 灶@0
08$N\qIش ')7-][@KD) BJ bIJDXR(> A;i?~=^$yA[Ev }`| #m,"9p:S}Ԧ6 ѭ/?Xin]pE'Q;%ݤqkvnR9W4,4ksvS״} ˦ke#Ao|5OװH%89\z1 y1[L [/ C4&5*s*9DU`ʧ$lEz2n&%g P{=Ǟ* @3׳%@@`!02)M%x/H>JD"i+;mtbEW@
C> 7*G4f]O5ϺG,IZDY]YGS}y^}t_t}H68UwAN2'Ҧl=؋nSe5sºY @+U;jb =?u G>a ߫i/C=>%A AH n@D]0tzv߲G65kLfj=ݻgU'by{
We7#
u\vt0HevO j ;" ĚM!,)b8yG@Z!dՈ 3i Q?+ȼqlτzP!D Ċ |J2`u]G(* 3G <Yq}r 3O=tL<aG\;y.cѽmr}KȪ<vwBcr) VwP~ ؇}c| ?}>*?',x8f7Ɋݐ>,Kq?N6\7 }LULnV%y]oNb ,o[8t ?/>H`& D3^ۜ^p͜w |` g}v< |7e|~x;`M Gd0MɱKƉS'w Kd.! HXcv ٷcL;$S V-7"&4o0qtdLqt2%2 pp3!8 FDĥBS C҅i+f\2A 3PV _fs #}R`% D@]Wjd.AP [frȮG! gp ̓ YvMY$yLѢMh Gu'[E9V hs+-7( 0-pSvr` {"ɱrFτ{w%ky
DBQDb =v
5 7 gXKРq |nmnmI,[:LeILƄ&i.9n p_{C Y뼃 UgRq;ASܣKI%gdݽ} ' `B [_38v;LLܬ 3ˊ쟐wg?\qQW:"k+]q!*0QnKt[ͧ}'9:o{M `GzJug-wlbZ / )X !UY@Zx WD!-"C_ (-٦ KЁr K@">?N ?;ks%a2A
u}a\fH0.dpA-akZX8Wºh('ʹw3/]n =_?yu]4 P:D&v"UeoV7lpkuf|T:SN=Mk {:%45 wQ ڌ|tc][o+AG\NΩmJLAE[m =>b }lcϿy?y 9oBiy;.ZY?/grU7Y ˥#zЎn `[jCDVzWؓo"p(_.`\:o߰A
JF Wț!8@o
(OiKY +L1c hZEieSLDL% K idۮ^H2KRgK?o#oNJ\6@ R}v>= ){]nIg'5":(2q [8H2+.ŧ nbsc+{,!0 u
vK{=ҋNHǤ_B vAFwowDNЕbxӞ8 j{GC',8
&G}7BK6 33Q;1<Wy9^\$"^vzFq?{<:w::.D8[/7HiBIqpbХѣ'm, dᗟO#+J 6;Z/, /
YrLeom
Uhtq>, tz3, y!`vϰ@NpVl%Mk"/(}{`'>(హ}' >^lC0 n#QN,)H,<? v}<$ȱ o'3HrL? (2 %olξ5WdoT"4OSۯdC: @?Ùο"Rx\bC+-!}. O} D o CW7k 2*|@t/3as@Kg7Vxh wخqוIS6jEmkS)@Ö5Cf%mHӠ[B#Jw Q]
bf~wd'MV٧ÿn9"nd|x5Ș'Y*ȀPͶ=H:H%\Rr%Vk[. n=G` /^xO|J;N96?G!ny)8O-51,A->GޗLOȡKHe "G8\풂Ȭ[?ƒ!SUZ2Bޱk}ry8@̎9+H&~Xu}&+1@W\F%[Gvx RR MAγ8'+t
R.Ip mph"a]cvGlxd:F,J` 4.!y&mp} n) ='mn ={<K 3$0> /\=w2VA ^ cC$pV$
(pgAp{\s@Ffip2V'6-g ) ?y`/]49"+#.'@jaX:D-c* ,If4S'o>{om=;9ھt2BrG$# ;|Ci@䡎1iO kܑQDvIv@ aRLC Be^(+PNҭ"沱< %$pf3:c=䮤Dy;go>/D!d0úvfS 4&p0* ='ݿtg*gI9ױߺo9]C$a|Ş~[/YyV
O?Z2
vUّ},Kk|>¦ݹo' t|*V߾k݇69D ϩGGr}N,@51H ] KW5uaʟ1f[.0^Ƥ{m3`E4dO}캷!Ŀ~^ ho L VA^
=C=?u3Wf/v)Oߵ,Utiz ˮ9&m$Ƨ e{}{]-=9 (Nw4^dKvFX؟OmBb {,i<.d!} gVrB)g87VlHy+4-'Lg EXpt/qp0ƴE8 㽳Qy qznd=xؐ@&I!;@^iqP$2=*=Hlz'bUu]e 7o?eZLH'4D'L:!õMGuMna Wϛ_am70n v۶+_#b3{2Du/xc<gWGvm4|*nBW'+]Wo ؗs9;c4naא> Ȋ P{FDx>.{F/ (h?s r g]#w5$=P 8fw2$`B &=fp$haٯ ?\sC݉ Dt\Vgvc&j+kug:]1 w]yړ%DžbH tnJdH,.L\3<OJyCxa? ?>ǟ?Gǿϵ}/gY }cgxg3G'BT ͻVjއ6~`E4)'rH0s 0@n_W,|WirQ=&evnޱ[llZiUgMc}}B (A ?nIƓv^/^js3"{qV#[^;?v y _O|@Eǟp~gΖ߆<voo__@mfkX捴Dx <ګ.'][ ~C8 .2d <:OPj3" 75]tL'@0 { g5ᵀ
M aI%m|dkoKq8p'RTB?gQMI@-A@{?D]p@q,.߃!HRI*5 @&t3N`r,0dhhF '@$5(<B
WWgmmi:{>~s`\JSv C.]#?9P#!$3es+ֲ-hFw ) )@5rޤϑ2'KQd :E P9WH<sN,gQ ]=vӮZx5mZ0^$1K+ lYOJU I"H<٠> B@e H|(24
lun<HL@ O8uL?Git cD8@kX!pgCI_d`//.cvIRJ{ڟYdndⱐ=z wl}L_5`t PVw+}t_L$W$!H)!'" )pG7ko=cj&2e']
3.36`<d?(Aq8u@A=Hp{o-si8@M01E2B a֭G9dխt=ō==u; ٤]YiQt ^<Mg˅tv|Lɗ+cg ;l[!g0]-~I<qz&5 ^NhRj_>b/] /]/uVOkŖƍ":2{RF o 63 "PD sE e߳h2 >i&`ů:'"`ݥI-&-7-X: oew+A<َH"V5}HǦ[$Q?A
&H?&0懲34sGz~.,}ah[_o2d Hyx>X^Bfl{ ދ8G p]F :F!a)]kpk'6!;(TCϿ)d<=[H@ _8ʉUVnZiM2
H5v
97qJ@/.;=gU2g0Np<`Yl/:n%P%$
$!e7:X̆R'YcaޕT0;/;} Ǡdg}tٓ{-vmH#Axqf3|~J$(,,7ڴ1ټ|?%D'?=ciw\8S~A_ʐgOAtW5WdC+s{{vË K7<$m d(e<< ݨk;^d~;!hVd3͋4!0!Op(nRr$] /l~'
O{R鉻
c?^v^f!D7?8 =M;Ҹ흌ږ-llx4!\ͣS˗d[ֳw1?TTM&Icնv LoMm m[Xp='_팒4cA [ڹ?_ٹ}ʐ}}jEߪ =c9IK{y1o<ϒ#\ENv E? ]W &x]A@|}a ='G(?57߷
+dT\s3${rDYvr;
)6_Fj\
8 OE]ARP4<\'RI1@ P 9\2< M%}'bڦ%a$P3"2}=222rϬ}/6H` AR$[D Zl[͘i
FwW>ϹFDVe
Y~v9Ԓ#XU`p0s: X8Fϡ p 5 KXYݧ|NHGw)mRo 4vpBY6|c߄';7?pQBTɕ0.|BߎEJGaJm ʁy{c0qHGnX
ka|ƺ+QS"(8)1!9xz }* /3{jpU𤭶-uK (r*"GD>FLpc̘1N #H нl˅!V K 쿮 aw S9 D x{- pbMep]ַcʹN]S+wߔ9?7?6IRA(p$ eO}hyלSR~=<~U+?$C7) gjB9.ES ն}* D?BM8!a8P m+atv>̈WDR< -ޓ$ NS!@P@FO}$ܓ* . ^jȸ ?M$us#KS]Y&o0z{' [U蝘c(زFGspTf[ʐ!O ]#a`?;o"+^qTR nVo"dĊd® _")Y;a&m.s )'#
\
S+eE=U]CPj"Ms= ps@ cHc]/ows7^iZo?%K'Yp'̪/L'P0(137-z\ fA@ )Rv%K`WB#4c:AL
[}AG$f־ɣE g#NU:l-F;`Q{<u Ky-̼g?SϘq̀h4 16Np`mDOύ081z$3?Ct_q0jS[W`#u+ ,N#cz#Sop,LL/!uM v<p
9n;K/[ۯW,նwLg K_6-"q *vPt8( 5OuDƦzjl CST=)2l?:qJvANw hu?2$}?0f_Yu[?џy} LQ_ؑ/`xaaqX{_>Ae˫Dt
Dy:*钶ң`+dx{t`rc[<iw#i' w&stf9̯lͽ0N^j n濧!]; >?oS4^KB S;:6U|0#F v6{LN_0 k1 -N;6S'ώt{<;3ŵ0(?: 'ÈIv]Ļwȳ^]AV8(W?ZK뜞 adВh_m` 4isDKmNHTQQ͓\Ӏ)p>3; YluqAx7 a6oV W_|!wpe}4R [@BUX Q1+!#76lZݢs2@n\(%6FFΈ`g14 YБEX-w\{--}sLoB/ Ÿv:s:ϱ0qF9~JqtD>q m3}Lz m(z0pcνECFMn{j)ܿ{ zGö@ؐ 5'9"M R>"X`Oy<()P`ZƊ p X$<^l
+D0,^ VnK'kRՖ Wl!;>ep Ch00 #
:HP.G<8!5D
Va 0)
煾#6%H5K{Np s
(s螔8a* 6v5 H #Qژ p/Nvp _g[4Ux)s;m톉vyoþ8E" çtͮ#} 캅 c0f ?% RUn2V^SR&BܿnYqjĝ1Pu0㰰Ţ ĈEG-{<-(Q0ABQA߇G#] Rv>
K1 #ZP^P0Q6,pE8ħ+lnhFE <}Ccwp4~0 .αY}'zyrV"_VZ#|PFa0- Zm鑡>01GGCĄiM92D8ѰC'0w/, >
+/`N?+^KR:٢)>lu"]SΡy
xQlAKq-Q.n(8<Zm1B}C; Ej*}@ OnܗV/H~\ya8{'~9l.nU)d w-*aR~\jրmE[ӳ{pxuēMT`^D,; uHz,F&*d}t4-~!#<FU0#%]@(DFäðq` /rM2'jaߝsZts$+ 4.ӴN^lْ/}o1nPC6^Ȧ( Z 6EMEn> LG"_4:$ _zF_z>@NWY $nODn" zDlB,*GdShqxB?< F&ؼxN\vnX ۑ@ȶɺ Ͱv e<,堾`ڟ/R[l;*Ð=̬شnum]ozOsz_l ]:*]WQ{jռ[C /by2:*" صg/ޣqKF"z˒G6~Mt'zz03<xk 2.ai tv
ۯ/(d.kYDE qĴE cA:F/S|}8p,> * G \O̯e
EлrC:g4vC=i~ 餑Ǎ>78X\|?xy=Oz ;K۸g
Nlܿ $acF]=qE i"i9';Wt2qjNua4 Nχ~vB-fp>}pL(HN$a0/ ]XгNѭ0#9?%#zڜGM;y57;
m{/xIHS8 ߙ,43,L`NpF%o?Vʫf h@g+/E|HDVז×_ )잀0Hl0zle G7 𐽸Z*NXPqZJĎş^\ SKsavq6̮ny11 $$sL;H#O4HHu4m(9
6qIJf$DcXD@q ae:> nωji5H3ba` j )Q #`[آzkk: ]ۓp]Ү#0Q) #F2&m:h& *c+m]^9 =ܵ癇X B!# A,A0oS vP !* <bb 9S7eY;Zp8?~-|AF. [Xhon; v ]{pM^
Z{56^a$i LN _˸` w7RX( OGF 7ۢH|1
wP#Zq\$t?s EP7Y5<WҒq-L}KypD e
MGS'碞߉N- q_@ߜR;أ (j7: Z_=#j@?6 } 8h-h< v]YŏW[/ai{[ 204 hbJH hh ހS1}9C Jő w0'A?Nztp']VcAF/F7fW+"#7 B|O p(y%o|AE:0*; 9 1o}6o~+[ v ؗ)8DD%ɇGۮ$F+}-mnXchIt,=@zs@7[SE 9ⶣ L[1hlRb۩q=+,Dc2 6^|0#Z=L])~`4HB+G?U.$ÄlKo`^bWu)?@6t pw̲mp"
s].$َآR>yXёJAܙ@i* %Q+mŰ{V/X
KǓ ; D8 8x2-
떰P{ GS_w= ~Jo?車 ύ.GOwZ/st/x4 *W(
.7u?!#GF|qZ˨_u_^] k;'1Q{n7Ĉ_983 &^GǬ5@9!fY@
v?G7s`X}Rtn֨0 un&gNx86-G者ЪK:imMSCˡN{ p|wx;ou#̦+_ߎyG$^~x,I~XX? .v m h Q?C@ }{ѡfXZ˻{aF2`T2}X<S 8 >7@ þ8_N Ya!bO_X]
˽fS?*]=鳖.=u~*{Rv*HoϹO)p>G 4,ߔ"p33aw Q +7 HǸwd L ݰn
_zM X0Ab:d8@% %db$oR8|sfa `m [ͭ0^a` ፀ1E Q0`L
HiFuN1 s?:8
PU0|g2.4^_20054HZ Sֱx萂5W~%M8EEJ蒒ˬHql ĩ6J?y3ܻs ܿ <8 X4@ mBa 5ַPR!
sd;yH/geޙލE8Y.Gc&:3HsguB G*=: N ?,;Q!qCn%=E38FÈgHbʁwj(}C0eQGCBm.mG~ڻ}p^z][ww0|~`(|5GBCsТѤ *őJ8C}Hm T NU) 6*7. X` ՜?/~@<Q)QԞމ \zBvtZP;wِ>ط N<<VV%ȈkSC@% [8{8p\_o mi8g)O!2n01? }cr&N̅^u= SuGN+ꃌ:
p~`V|u'?8~ Jx_
^-,P 8%q(!w^2b1uN" d̜ER}1Ehظdʛ\Եy)n i.
x7}hҠNh21VSE
4
4J\ceitLF'NէSCg.8RQ0,^Xmͽw$%S/ ~?wQH n/L]_3NFKNn?= aua }Cx>{@߭YB42Š q.0d9 hRU #˒28}$d u8|a*YI;pź
;p|<G}_=]Ѽ@'_?/:巵fwx& #Sara= {lBF'gA `Q96BM uU U۫)08/Qpow}?[aiHF "pMH/OxuXeKv>Ү(Ϲ4DDAzx5l aQ"Зcs'G@ )m4#/6-DԥDz9z7SDk}v8JWcp{.ٿCcb#sf#e
G='ӧWeυ[᷿aQ[ Jt<@k7MN
@:Y!Y44[0\힓={]: 9 gG+XNh Mc@Ӝ? ,ʃ Ar9wK7PAjXrnyK._Mt'3SaKhX_[ {{{aa~5 t\Ecx i N/KBWN8n=2gGKo;C}0 HH Y@_uw@}MDz/''B2Dx ٲ(gZJGb)1oK#m*k})xv<O*k4YxˌG/6oc(>/9u|}`qPnH `h㸈|U CǍ-y! oqL.a b`)a V
FmDbhQʥZx]RXXl&E PN3ݠmdQA31_] ?
<=2`8b!,TҢ C'F(D
S
)le lqDC *A o;:6lG尰旗°e*Y
@JΈqsmP}Lq8} V^x(ܿ}80`{z^B;( (F:D RBh " 0B/!1:r~NJa|GŜc<e7rxx "އv،63*~_txhѾ8bK`D "jC8bO<,Um+ S;*ԇ#( 3'~`_ŭ0,}mf-<xamkI@ʵ/#c1q +Xpf[P NX=2k<{# ? eRbo;hآg%_|OF!i a s+{x,n`^˻G'&a
{[ /H+hWbm-1tfNG>#E.,F30u#m 2z zO]2].qdrVa7,m)S&p ,8$Hqټ2
ce}m[fq^X0~v$GKy8ǢLGZ6C%N(` As3( R(`$GA܆Ү\1Rנ4 e~ Rv' ' 9tk]Ii87~x%-gQ{
_n ++hh~h{F3k fdw"_xNz)
K߲š̟M/G1,mɠrC;ahXt)Z <|7=$#|Thpfc" HdkXT2_^O݅vtխ @VvŷR(NN9S )b[炦unIG3\tnJ m+ \8a֑8
ض)y;8%z~ ^էwf(z [a~z]֥#3:$Wĝ@hj1:hB-F:+͂kanNX n w >6έٺE ކӁUC[7#| quA3gy / ],gYbZv=2!:X=,ވ\d0ܜ302 /p xt4[NFFC? V y <h(2EFz,
8 !~t58FWo/{_[ oZVԿԟ7 wAwm]a{;J88<
V_-:`aTO܊:>utԂNd]0tA3H 1 4ы Vӭ"06<agvbJF:ot_\Kvzͯ 1=vÑcFcG/p2 %vHfZFQ+6h;86Ve^&SKaRpG~D6sk ^b+a҆)ۏͰ+{ð}VX.*~rUrg v:lş9~?}zR7nҹg??eBwhY2mF]6=0| 7Vu}&MKi?YȢ7 4a-]//~7,ߔ/BD-A`F~Z
Ƿ0
i(F cd9GRL"` %8J#!3#D}PG Q&}`~S̮0fV7L1 Zt? <oq~?c lSG40#'AT c 8A1 dcP ހ-'J3^
3+axzɶ[Y_
C,>6hȸfBnuKh^PgO!+bj .i 1 [<O{^e0QV ;qЁc 1L"
)!F)31DzE`a@J Q1d #Q) m" $DAA( 1& cC#>0x !nnGq7e9=n1Q |è41,6CGB7NR
8(V{WX΅M)darN_&$1qF6↫k᭯|-," x+)HcK_6EeK
Qptсa @D OG$"8 q)37m* yQ!f _0F}
QBjH#
966%dH#8'9Gahơ\c!öN9b`Au]ؿ Fgh$ l06B3R 1#3 B@1ֻcHt¤EO[JIlMn _Meҡ{_ _F JA.ť IZc< 6|xTdpE 7Wo:->'v3\ \ zX'gAo 2sg\[ f7x=LWEW[are5Wao1((v*=k>|Wzq`[GFn ?GHs 1"ert^2OX(ƑdܺCR s *os#r&!b(%)[^s }cGΎӆ1'[{.`v {mqsd8 'gCh[rGyAb=瑆DA1+# ~'#n!=F8ضwz
Ls1 #v$CyKcIBѼp^.8P.w n)IDATlŌ ߸nςI uw S&(# Q)
)Ә+P/MZݿ+S?+L9mqͺd0q?L&wZv~#l WE#Q6"[>QC_ѫ?590#Q r S pXD>_x >̶7-By nANutck [!M3ۡu7(>ے4 B gI JX;!7t[t+adn6 u$blF:e{}F yv'?FHw[gip'D<u-z)[Px;ҽ +RO|gvt3PPwfp ۄ/:n$|/$^+o_nba# ሰ^dUx = O+(td-1Rw pD#@2Gd0L/07zW68`qt "z3-$fk0W40YV"* Ka,`#y d]B9ʄceq>0ePXa沅olo}QSp28 A߉@u a3P]m۠kE FhJ)8h LY$ 1 &Pr8X0VlfN~ x/p+.QPq$ gA 2J. G&
xN~7N ~
"":M* d#8/QLM]tL>JC7= I GCQW;^Z\ +a鐽-`rNXFE ⒄|x/}Yڍ&P}[ܱ4c Xh1݈ рQ4CC0! AP x;
Ak'N<BFCn pcStNa[`PUNTCRg征 sCਔ<SpBc]/p ?wF=s
<o hK8j/L,$qQ* PѠs Zue>),>zlݻC>_o~wed/w$ex"Wo{aZ4> ¸o#"Cs8 l:T N&tx.e_< y/udnt5TQm: 93`?
0EsݟIOn@u|У6^tEZC Iτ}a`?\ 54&eV0)H.q -5 'ǝ
b@Szvk\ }8 pJ͙S Wt$@vu ᎇ:աLVd]ypbNb35Tw;ڕUGEȿpQ~煷l{:l!$}inɿ[{ajEڶts",o,(=(|l.M/7_R 9IֽSNncX1):5 n 0 ^?:/Wxli_ <GzUx ;)y] qp,p
]:>3p# DX<x gIGmd# +{mjIvJؼy[<p*tٕpx(m =12R| n{ǟsO^7>N<8?o3JG: '{(,!wfg5F0zw 6CG~~z/~{ߔ` &6 `e4ay{7Nxb}.Q sAD#QYD\`| 9 !q@ W rP|kՉ0"汭{C -!!z1
Շo2 qO 1 (a'F_ S,c_B CG<7ʄwH0A./坅
{> A.C`i}3L·ީ n ǻP_K <R
$met)!攀ad3c:i9(d
!*u#CKF ( :GAqPPs
DU P:bMR 1.`wc]
yBX8F s^cǘ7 ^_:)`sDGs1`fR< W@
Ct%ψ-dHMBr|;,<
^jQ w _x x^`[ n*9t}ta1 Fغq',0e>Rw%D=l؝(=20&uzUJڊn qC G@jC$~V4thWʏB=3S - (tG$} 7݇{t,\3,o};.+=R- 6@*[4Q8,`"81 0p'?ƽ#5=s6
zcBt4Ϩ`2zy _iW0"yՖYc GW˨}-dPrрhp畯ȜdĔx_߄{ꦭ5Adҍ0-a|f\n,-[Fعyv!b7Y/p@FK >P{w {w2DYFE8 ,`e7Ȩa~C{
A$&hߝ~i/,zA8hmjMa?>:L,hF_A7&E!4(; 9']#$ s &Cd6[^ d&
hJQ^Gek1)c@G]xN> pnht,,R4
2P/-V ~-Y Vpڗ7̨O [,rzE&w^ Sètѩ01v%o`[ƩAQr'?2 sc
LөuLƴ; : ^OtЧ>:$6: +ڢ7p8 >F2&Fw2n n0w|NwsCލ]@> {a`BϽ WzBWh"~/\ǐEt . mٟx:eaS:SDݶi̓ex42:2)p>3; <ܟ|
: =d_N< k,X Q~Zq[po? ݾ p`tn1
VuQ0b b],ThLE sc+wԾ`ec.,͇Eza `n 9ٴs[ @D ~~
DAP4#80*zd~0BDDĈ=qb6q* 59.Qh2&Y? pm-̎Ӌfx/]
xW
ǒ6㽎P` !285T[D'A 9 B
FA<.## q^28 'dcA Jwy zxw F|T2!¨Lj9
瀎
p `F HY0ɨP`z
!C;r]dž"1E#1Fgёun #mY *)̌
hW }%,m]cl{3<y])320vDq1!>0 &dPK8m8
SEF9<c0
FT8$P j `\1R˨ ,hlQe1a{Kz/hHѐOy|7N(m8^;kfAD;WcM n ۡR.^!/=#[@kz7*G8rmC9s^G-/>Q)pp
69zG
팅A@:=8<m/ hEe P)K(%O[ *Ҫ{r|vZZW '
s\}NtBsw{0' Y0 ImťpѣvPXa~QpN׳{mM@OɦváۜLL*[fN" gz&wz?8 ^+:8FCq,8xO# G¬ccq!p"Rg<wG< ѣpqߊ蝅Řo>ߛ4Z We ?z9$3/] G? pڐp" S M"3 [%#bTSѝ$-@ymp&'8CeA`:y5 tSŁIQ#4=& C:G0 ~h;~ hsT$}~-,`}+ѮNj{tC[a`r6ɟ;oH c-V
k{ᵰw^Z/Ao㸆r0 4N<5tA
5n3@4DtdVG͈tEӹy
g z%6Gtz9Ʋ^խsG3
wӽ.MM4Sc
3sy`<<|0&ffǕpZw?aχWxĮH #4">ڞ>ٟtN= γxC{\/M;p_u~ ~
;
Y@Be5ð3, ! jxo A)0Bz;j6)n:!WGl/:YC(F!OǺ&1!5{S {$ >l^W%L)eg:7HΏJa5$s
':_$Hqu(Q4b - h<xq|X郌
3(qs jv<( o+TldGu&2\m;ato6̊< y-\H*'&03$##֚@ !D# A0 0݀k/:"~@uh. .v09z aT.]#/#!( 12q6eSA р4 n<
W#o:7pHdqn|KgtK 蝦
}`KaPs4
ʳ6Z,3`oBzax }Y~=!a(C7 ~o]Y3-dwRA(7 nd + δzף! >@Z46 <q])6]2^ջ7EV~ww a<-; y^w*P uCa~N?HbL(Qqx=^ Dwu7hɉ?1<~)̬ntrwЏu P!
B?M@QGF1q
ϖ Y+
EAt I }h^?;^Q8$@46T F2H"fDt:
$,/~:DQ t䱎Qԡ8-%)e[4#Y1ɟA~;,]oAԶx^R [ ~ppmڦ(kD?46µ[9!Eܝ ~(DnQhߜs+aa)j pm( <݁# a7z zՉ`2 }|ER
͘to^＄]
.Kt ͆k=c/~)L-.6jcFs;.vHΑ2
D/8@6'+юq0CK uH $(Ή`s נfо@]=U)t)1.M,9 N,0BC P <2HA;,!1SSi:ȸf0魛G"3:gZW045~Iw{z/2E71{hi _
㳡o|.tI'bLdkJ=t̮}>uB7A@u.Wth"j[I>N SYg]=M`rߏH^ 4-uh=C aCSQ RC65li_kȳy08=oٹ0>=GÃ_3]/v^? E8ʤI|ߍ~-upwó|~mgO> wpW|#2v8> Hi?Yǘ#b1:*": @ƞ9 +oo;/?2c9ϑ v0s=L h+u3DAhb K}NJ
[!w4+;X@D
4q8(DqQ5~TXX S_6ώ _
! H$[8-إb Q:J96 BUiL/q)}IY`@TY guP/)1V{Y I(x"]ga> ]
w
K1`fu3 H 0o#T />C /=d XwD-:Su G ˉ"k hq Sz
0S-lʅչ9 t4QF#QI1
!xOsDx@T90ؚM`6p e0pN?:,0c((O0es U>8+`2 P /aJqe RW٢Pʺ55Fz$f\XX __y[m4Ey an \(l YhmyK #2*
U40rSnPPxHnX@hD#
Kxȳm3/Xc:Y'ݪ=+ ~:ܰѾ4=uT H
7(F7 9wá_vB 6aN@` ?uR?}Ef@JW_
ó3ahz*; wΡq :
%]tyu$a DVF~8BWz杷`W{.GI <7t(d00D#a4-ZCzTp3b$5*
v} (e,풬1'8#rSau{-7~gct3%9+|w[aas_Ւ2|я1!Y s$ tw8C#p Sq/SV
ǝ?u2xG(xTBJl
# δ"oY Gw[o.O
JG._{Q4"8n O? ɸ]Ht;'F~iNzsߩ§ D演Vi#t_; رaP5ؤzy>%"tStߩ1 ^ofh_| 8e) Vt utP-^sG%).H+pyuLWu=˔#[kAiJG`͝𥯾/wm@ݰ~-^onv[5Dm]^VY r
w E?Fajt:,@ss߭o ܶGl \g+ÍN(O멡J>OH[mQt F)g{rlr^5l9~Eω_\cݒ=:^~086 F&&Mp{(\ ?ˤs y ;G~\砬 wuq:P uҽg)p>3; 01 Ȝ Zy֞[/G /
G [R ֶn={aȶa:[ 2l}߽٘
:d09<0gYq Ѷ"R' 8
kSac-UP~@0@ ah ڑ41 =9 }ų F
!2#4?Žqtk x<DJG;9/
A\ ]J݇
j<;".Xhm!!h[Bg 5/Cަ L*-G'@ Տv@Y P;
tMJ6AQ+`yoJУ{}] 1W&qMfq'P*)8 8hsx@>JAΐ< (EDA4BMc":
CcMBbr0yK@i
g4n6ƂGw94&[4ëG{Q&Ew(af^z7lSɞgb*ĵHlW/ vDC ]]y:#eĝE3p` -JW?b79vn13J !O)v{6Hc,qj?߆o7C9l}
L{bT ѻEߙ2=z"կ.ɠ[[;Rg`X۵EXQ G)ν=wD chSF{t Gs)ݕ
Oit 6 ϗxHC M'ZoZch_ tM)_k*Cܝ8]l:ˀ& y=(r|<G .~7|&9hl釼B#1.18fFxO_`xG
. b?-#zj; dh6,lpafA., tfNFhQ^ʦ/_t{'f{6z` hE q
"Fՙ Z^ hFDqG|qӾӬ=0 B9 0'$HT84$ʧ. gKëDGfWDR'w-h{l* ͪ/ BסO@ 60`r@0 @u|w,twJ,T]}58@8Jփ "P=k8paSҵNs0g/= ]@Hy?b> N80$^ FWpITUhwHu3;F%ϑs8ݶd<.IN,/?Go)ZS]I>;nKLc:_
zK[aݰtp' <~'lyh1v #iD-@rCԍK, gY :[vJ 7ɾYHh tk[QJtss024] \ )02(s7}t
_Ge|[
+{7Bp^X7ݵ:,9 a*^7耈p
6zI<"-}㺿gƝ^'GwP&rݟt?uTyNy^~:xYi; ,`=FЎ8+;R_ (c<[email protected]ƗwX o;6a+! t})3,xB⏀PrP'oI҃#!c 5ItII
kMd ?*8+ :gThsy1J *1C)"z ؈N"_14r ) *),RA
9
ѠHDۢdz0&ŁV R_*AlK24PX!q1H,0,B@etI5'PtJ@s&mjFH^)4*E2G # ɧg y#pTt KQ )0 Dc(c oy#e5.6- IeJqPG MCp#Sc RbF5 P-ZDxwM2R?vػ}S'A& `)
b0Vb]^/[D13&o2<\#tD|HCѽeڷ&1fb_A1&wG @eضX kw0< w E q+ :G@ H:$ F4G 06Is80Ń'WRdOox7B@v90f;Qξb$z4G|t`WrmgR i )p;8i݇; 4w.8kP8
C-3/yAtS>0ڿ azn2| ]I.lj єM|sLe9 ?x;|F10 QSc Llޱs
w"Ti [email protected]-D]g2LohN@ 8
DO`z}t_FÔtd9BތHQJ~s6-ܢ0%<./<wɩ0(>14.gEjMtJ'Ց8uX 0>
h*c ;Lj@EY,spbu Ed%`N 8aQ83; |d9 t2
$hwN>kXw.H.6G{aX\]
֯? ;nHlwʈ\:X ]0`62 F=JذIw nڈ } 1u*z:F$1ߣ#۫ IVZOw
{Gah gxt#ɟN <7N\Α 1P.dצepc6
Y/5 _-#:;]enҍnx'wp0t9ѓBBijM}ƎQ{h傪i`Bƾ9t?:ߜ#y sH|z \|Oxii> / Z]:yHi?=@xy Qm-)
[afy5
_ 7 ܵQ;}Xb. { +ĦVnXU|C< n)gV*BX9@>QLϜQBEY>]#,j|! M
=[E : ֣R`J?
?9샠GQ VV9 ֮ 1;:wqeݏ#a
_#J)1: ^.b 0z#> ; Ju$$$}bq1̭蟘 v*8P^J /F3#q1@Wp1n % gm!Z %Njع
1-ap&P.Ft6u F@c[53RLwHЃN F9m
I@] yG mR"GD'
QP"H| |fPs2蟗" t ,/<bI^L (!8`jei2:Tוa4< PaѲhpa=< oÿ vq%¥#RƖ=֜ Y aPWbO3
( Q9Bs[cH;\vA9<àV`2#hs8 Py8
ȯokb2 *+#GA$Ƃ?i\ØwQ9pG@g鍃0 ]"}_fBGg LKRE exziC&t=2HgZh¯G\u@+U)Waӝ
8ElA4G(q1 fA3͍{[Ux_CZoi;hDtbFHðux' ; ~?\s[2wEn_) È % sF;G*a\ و78Fs
WA N*< 9GNŝ0vaB<'A7u0_El vlIޤ; 4G
9gCn\^dQ@huR ֝;+{an ,}pݰu0ڰh~p<@/2&m??asGڗRG(Nd}t"4 r7K9e7-A]jc vtpt*DLh 8'pݢX5 LCNG:>?1͏1^VZY_G}7D+Y-ƚ#N;͛/}aF_ 뇡G4ݳv n> {gŽ[aC
|m2h ) 8qBx 7݈uG9]j{ˢ֮1%U
aj}Oz{3\1pA݉^A|_5]^gPR6G'lK=\rpc5Š,gYػ#} \ _*[nO qxE@yf yiu͑###xgmS$-ןmw']>( ^s})<ef[{?Ǵ L<
,0AD=,y|l1?voUwt{ۯlsFVtzZq70v$fE+µ~ ԇq/VN LI Tu4µ# L 39 Lv%`
9X_ Saj^
2ʆMw%;qR\+@c{ Ébt@Tpp ұkR A]Gx Ǡ #(": BUewYy ! b_eG<z,X
KaykKy{zW#Cꐄ!3 CߋUG (Z(6 h `F!ld@ t( c`,΄+#ӆ ȌHe)
pyh2\bQ"À+v+Ӡ{|NuE]@ 8~
C :
87eΧЄrA` ݝKDЗW bKw1^8"KnwXX۔/Nc+Lّrq-P৶W'ln+6 ?'z_2@GWoXKY8ѩ>֑ 7M x{CAc1U16nZFTCp@k?za BC:.VBj#1 Q_"up;b@tx 0pgA~ڝ>n8xg&B]aaPJC
l
;RFFk]aq r=[ )`u|20#
ƍE81Q0kpY| Oĩ,Qp8Z%BqNG{jܧ}3k|CZ #<>*([w zk2ۯ/M8~@yW°Љ"ᘛ[@\qG7{%ˈt ~X*rn$rF 8 % "@&-Sqzqȇ^uÿ
w¹Ӡ5ws 0>_!>gJ W$:F?t!}CwE 92] ȧ \41/>>0: .tvwA=d?N7w̹ `3 Fq' 8|ACqu';@ 掋V ;DK,MLGi5U,}U/[-^/E;$tQ!N j5AH );ݓz) ß:b["}{~)%+hxb^WNZt7_ =S,XǡwUX.}Sf\ۿvn?
hs t
qLr@C! nad#fxͮ.@?yUHb7T(MÍst|1v{~ [ޢl0yN9;:0{LzN_n
KaxRq9\s+\7 ,zS뫫 `:x{FFIYy~: ^G3JCi=uHUۗ֙Ӳ=_k7LkZVJ) " (߮՞0!b?&6?2*^z ?p0{/
24FLPWj8uh;آ"
G ⨾: ,FݥtG|!\$$-2@G[Wט2` Ί A8S"i0HpgED%)7ǰqQB & q+@ noz&;6i`Fƺ A DX/[hlXX6=.a-/|@ ͋a 'Dqlԇh$MQ`aF{P&"∥EZ#?* D~<8"Xcu#
2#9dp(B03 ~/ d "iN =SPp Ֆ sQєx R>ݨoᅶf$7oV1p|k7'?^~AץI {kymʌ0N,oGFe_靰0e"|~5F*Q7PM:کO pq+Ŧ@2#g|B'%3x|HSOI꽠pT
]pq#5eFc Λ.>Å=2 6myH甇'BpA$ ( n O!e)mSDcqQ\4l"(
ܐh4; U9 _蟮|ut;6.n);aa~S~=
i]H _Z ^{'ͫτ)8)`9 !N@Oi
:sz"}[cD} k2 DsabMKF B 2# hpg ItUʲ֡sӻ;H9Gj C@eD{5 A}l
KvHLV E̬E.Dra2\p# iM[ >OshJ4xE Q'~MsT( 3 E8!C#
ɦ" O; 6 Ž 8~(i2ql^ ~F[dA,XWD(|R߾FXxA;/= sʧ~ Km~aѹ_l
~Y|gETUt]#ޣ 8F9bPbp!\ctڧ 5 zµbyh`a5̬o1lxuz'UDb170h D' mK
8O{HO}={>kn3qg51 R}5UH9^ßs/ ׁ)o_.9ƹ'歃穢./"[خ8>ϓzi~ex9u]\w9ڝ~
;l X3aFXέۿ^y:l N 0'}nu-ܽw m3l`s A>Bvr0'?й:vt x(>I?[M·wE Ш//iH@vOI :
$ (IQI PA bY8 J #@75$Xxh!sae en|"I (B=GgCD,ĭRЯV' (i8
TgR R' <3 voL) XgpYFEI Xf4FtDrlt3 # A$R`6<' : ( Cpi
KCR >~?7 EG `$lB,Y`ws_ $T ` &]WÍ7kaxt 6ڗ3> A<b`fǿC(1yzWܨƁпY}^<ߍqFmAB7!
)caHC!GIF 2X 0t*GS\:2UJG)ȇsV ;ÙhN{rQ'^e1{ãĒ |s")Wip1 *FBHHST$qr20\ &E >E%X>Ps;t
jԓCeE "h =@~)F_i^|7L˘n]+ɂ9"D,`Ma} o 7{G1^?yiDžE 8?Hihsx"&eHvN8o
"πsKS> 8B曎_w
IL# 9} (G:5 8zzGzWl *28(mnu krJg{
5g ! @FO w :L7yMW :s"XE? / NHFNHJ&N繁q;HAѫ-< 8zZ )w<';$f^O Uxhkh"G9}3* \ WDw w7 c:Ý|?l nNMs "d'0Ȃ z VV 8>hVQ\'3QE #4 ݮ!+Q~f6tܹ0~3:=8Hn˪Bʢn G)
za{ nA g{:GyHwCGF8g
'5c{ͬES3l$ܸ}#ቡ0(y?1nSƺij{VLJ n{ͺdyxOwTE~ ϛ^Hw;!?ksz~?I9z/sy}2sg)p>3; ։Wf'L`c{7LI(͆w+ (D F8N2XaV*G ( :udӈ9
,3j!
W:Bԕ3 { l0 0b FVI ֑|瞘f
Q9G8y:} YWW>Fm]g) x
cB P %x<ʦ8bO;a
t7e yYА) Tyc057V`0 X0uq Pޅ 8%pNDE@e 쁄9
'; 9PETDGWP:QD"50C gY`
N)muDʔ&0Ps8
$svD{Ty GGma9~0<l8 mʆ
1ڄ"GDK{ ,<*%Q0%u5K7 /x$pX,Ht1=
RQܧ
9*cocj-x4q0#7ٕ0</:/*Kmr_=YLj@\ )i Rq86Z t&<>Jz\ث SE7C,`65orpL542Un/F AMF#5.1P S FA
Օ^qoa%ѸMI 1l( R/ Xa|Xs=qyAM"y/ ~4
ZuFU`$jii/. aX\:
7D2 Ν0#9xQx$3$fC ;߮qёd9[p&JeuFغq7/mo9 E`
ed:SD dN iN7Rhy GXԁL}fl"tO bK~
(6=5hfw^j<fyu&A bN1Fgyw 8-3NhĪ 5qD8}/
љipM|_z蒌?hI)w4ϛ_),yӱzBI@:8pA8 8^ (:Ĵy ='ȰB )PpgaӰoG?)J86RGx PG3q ]SfKI\w+7 7_9 -o셫20;e'0 # NC+#۲)dP˧"(},[%zٶ\ÉFnpFXjt9
zZLC0gx ra(C70wF^ưdϋ1usyh9YHè wVp9/m[ Krb"L,dž~zsL't9o{ G:};K>څV._~RpzO]>^0S˒J ͝~59r<M#/࿃r{= uMHZ:u?3ͯS8 ߙ209X%Qdpec3Lo%)
ko +YE?0cF :
B(8
p =+=wCZBPqP)9JF!n6'0
g^k=
D.r c DahBP z$^|)Ywma0` sⳠT`PFxC mbCm4A!؏,Xߗq'alf6LH(# >ʣl ^1(/an c> M#_Ӑ#Quz.gA\s g Z[_ ak7ʸ % 9~sD<nJ \7?ץtc$0z7L7?輸/:b8lo} sETC<!#%D8hQ`y'
ڗ [>ݱɶ 4w }Hixݗ70Ӣy h_[َszy) ݿm s\T
M;!tY2KP0/f+Mh #ۜ6*!M#2L/ OFp! 3(O|FfE?<;w nUՋ0 "A>퇶tC
e (#< i[آ5 HGS:ā%%ydz!-g 8#VaCz?8|:iоI#Dzo)Ks
~FDIїsj̻]$g!H>tAq#)дѷTH
* Z/<1
6#Mx>SПh5 yK 7zME`HT AH EfE,J/b܋D^7.w^
orǿاq$]P fq!)v90?կ.
LsQ ^cd G+G:|Na F "}w K~̢8AE
/=uh O_4M sE{SG5<T!!P,tL\0#*D/ jF۪YCbz&=2m@C t pj w⧎!ȗ\5҅O>5mw#r
5Dk6 zƌN폋ΐQ | hZ!k lңaA^ Λ F":*4^) h 31_ޣǡJx02;OuAc2"YԻKz8S&W/ %{"=RcXct^iu vs7Pk\:5;tωd4Jo
s1Ɇ'FGy =fpؑyn̵m*DgvMM%pؿwFG´t}?+x -P *c^zҮ /{٬K <}{^wv!v7 }7P'q5<uOwCөZm&?6L!~}6, ~Fg32>ȴل~
ߩgYQBvddddddddddddddd%dgAFFFFFFFFFFFFFFF YQBvddddddddddddddd%dgAFFFFFFFFFFFFFFF OYw?/]
<[OkuxojSw-ӂɋ v jhВ}FY/ ]5?zr uEPW?<{?i55PWɨE{ 4SY)9K[+!'22ퟅ'4B'xLg)33M+Yh8
@KA{;L2(:EgtO%3ӇVK!?ķ$)FxY >DxO'J°Fi4?
^o? zՕf4)
{~dEiYgO}G+zY[iYS} +iD>O,(wkw{dt- 2>ijd|8AX9M}aUǾ:~s"C}=e^жU,:~Jmr4e ipܮ֓fYRƧOп2<;iS=ѠQ9V3?h ؿg
oӓ|̺N=L4bqѡcgj):gny?ޑrO"QDB TҼMv:ZM ue&+5R JeeyO9
FlsU>YLJu @ Ym([_BV|F,g<Q.~aZNpem/!־oWA4Mvo>R;iS{g~'g|*ii)3M.XL&> ?Lv.pҳ֠ ikidgeFT3*x'lS_i* ^. eV'b*i2UvѴޟ➴L=5暈 NzE@"ڮ'y*JmhEJk"ORV}>3ShԼϓo@K߸ڣ}Hcۤu7Nژ ڿ{ }UZ92ֶV~_eyVܘľ)A7}h?E 1~zv_nK83?hdo<ɻIUʼ}iSsR'\q^5;p?vJJe ʫ\ܞkWFk*NoPb>UPE}
XLٮv5Qzj[|wPnu+g+ISzO頖?/Q|3+oby[hqo]{:_Be# {;+CQn]%VqC
_yG jN/5$.-3AM_ʴ ~wS j]+(;3]dAEiu ]&~S8j vvTGkLJyjA: O{ו>q;Ckp*frޛ?~%hNCKIh]0F<i*$Vo{w,蝹u'{mMY懲SƧ 8K,~ 羽FǭOlS
gW뮝?=L> jOj˫tR]߈];NagjG,m:0?W)OͳY=-ò[yG؆qvjRi95elxQϧ~DQ,-Dľ(]oSEG[qR0|{n/Pyֶ|i|O
ʩ;CR*8{=o>vگ'}'i^ٞ5]~L>Q0Dx 4YGkQ*RZ VUO
qR
uW 5Ok/^ij0p'mVԗenaJMs/^]?SBfjWB B[8:'RFͻ[WGx Z miyg}ueطId|*P ?ퟡ}i 2Q+NzOu[iDwr})~K6MrJ<ʴ8 8-D;A ZjZP BJ:p)LZ^q?eVl'Lmh/]
ӊ{<i;6T묫e_ '_j.)R_b %fQ7*TYjkU)*؏V<sڎj?}gxg)|o" 4oM_<|-ԟky;*ڠ _hy'Yi{ߢs{%gMLgwvh}ϭ$}hL 6Ц?d?SYKh7X@[4BgOY;n$j_!qݒV){p;Jel۪M
5QNK맖n{C-N<]5=gi.jKubRg݀gQ'<iJyT^։gxg -:œ H'_y>q =K[]lu4YV *Ymo-ݟrP6umPj^oIƧ +>ڶIfL)~g_Oz6ZK \ e<egS=9NbNO 3 $$~"#gLMdxftDVJǪe,tdgE|%ǀyLOg|wx֑i?#㳉L >1|'Av|HdgSGKhZv|oA!~Fg32>|j?dgAFFFFFFFFFFFFFFF YQBvddddddddddddddd%dgAFFFFFFFFFFFFFFF YQBvddddddddddddddd%dgAFFFFFFFFFFFFFFF YQBvddddddddddddddd%dgAFFFFFFFFFFFFFFF YQGtǗ¥KAi}m@oꮝ
u?^{gˋGw 't\_*/Gyg8<}O??>}8I?y
}FX^{miA
?|'geddddd|D<gAHyó,.$yۚدwMOgag njGYiEv|D%Yf|WMq Y |#C{xؐI|2S4*buHpQ#ۯGERPTqQ[r ?
7#SI~k7JyZ 4
[zO,8aŲIu'5+Wʊm"ZVQf
כ~䭾veDy 7)/AA;)urI \}(Tʳ>^~w|
mF'=y^J}zi{oyoyTa =V~}~TvPI4 UTڮ3Kl-8{egwpʳQF>]4֚&ԾQE?[M$moJ?W];K(0wV_\vo'UtFFFFFg\dA E *jR0oP&J@S<
ŢP +Z5
GU1IF?
WcyK !VJKUR*JUgMU߫Z_[qվ!ʩ[Z,UXSX H~w#(+XP
>3=<ޗ9j,h~\~3Sܓ2UK7坽?
v=kmH7@ Er?j;5{³/t2?vTFwk;]M+
CYN_ic˻n2vӾeQI}K_8 LAU90(L(+Ua_T~=BI(AZS,H nhFc<hu 8Tއ]9o]=OWJ\VTqm~bq
hH E
֠YP6꣱ 7D@H &}?M3B}u_'W-SzgNz7TZ+xAjli yD3YLj;kgk'*~sMTE ߽O|?e|R|3 '#####㳌O.P,/5.+Y5uW:Ŭu7^PvvgA Sg.U4EUl/X~6'DlQvj[ӢX.A<S_,+e4gh=M5
gå<ETK-OD>;h>wkzF9O],8[7?;Jƀk Oo(Q{w mյӞ iIugZf6p__TNUh|gmV^mK]~{i"7ѬTfm-ϐ;0#####㳃OY`B=
6
HQSGr'U> gݓcY
пcЬ~W߾VGjlvWcM+ibI'9
iABC[z*! |bso_oԵ?i~jLzN{maZի=!} u_6n]m- O:߭]jѓK]F6[Bz<?9-ڽsKp6dddddd| : b^OM 'sŰ22T@Z{MuZmJJѾvJYjhYHGqY ,8OU=R}/~nY }7NWTFhκvW(zҁ`e7*Nv, ?|NC(iFWiZNӗ7OF"ZwQ{uX1 ݝ^o<-)l/
T냥*1wxw/@wluyU(C"Ro[-OcӮgddddd|V9 T2W *k(UT*"%2ţlEC0Ꟃ 5άR=U3mQ0fzrҶ>`8C_)I1ETnQFyR+}-[h3FhE;車
Y [הUg qOOf/IOeҿZhKPg|/_Q R %h};K߫*8K{=U:)c72U7]O[3}v<QOW/qݻoB(w$|$_w?߭'8
:EwXnї
neTP@ UEalT?-G?Y ʌW
2T)]9w֬[z|RUl=K;eQQFzYo"hGl >Zꯥ[Y~]h3r['Le>R\/mX|KqJī>։'>k;K+Qy['*8f'U䫡(douE%e7ZQjw>vz|ڊ(_/whs֢!R{$XYC+|DgU ##$j QGAԁ!v)Gvdd|GOYnCKYtg1`#`d&kG3222222~^U4&$ Rd>
j8{v ױ?OxO,(!; 222222222222222J ##############,(!; 222222222222222J ##############,(DgAFFFFFFFFFFFFFFg,ȿ˿˿˿˿˿˿˿㗝WegA_______~Y/?+*D IENDB` | PNG
IHDR ʮ sRGB gAMA a pHYs t tf x IDATx^דfו _3c46=cfSU% B{pwZkZkIA2H A2sosGXcnUߕgu9b d+dɋ \.p \./O.p \.p \_.Ȃ \.p \.
.Ȃ \.p \.
.Ȃ \.p \.
.Ȃ \.p \.
j@/p _2q!L\./'BYGmںeim¦emX~ӹeٝlز
[\ڲ?
+rm[ОՌZK<ybV?guftߪGjd*8|0JvPl;V wo[.ӱiYྲt,gqYcъ6e7GyfaR6,唦uKi\5~qܫ_;u, Fy~ŷݪ]qh=pcuzySΟܰi~/9gv,,]2[}ߓEujY5vzٮW-KvrѮT,صyZfr*>[^Zvj([7JRɬU:koXD%[% |3QsoUj[7JJ ;ǹ8J Z (ٯe R¾}.a[? =
oƿ~ӶuᲶimW(.eh]U֯ vw|bޮڮw^hI7(Wq#_۩Lw쏏 x9oTߧo;_D=~FP$iM+.+{5F,empv~ǿؗںmJWJGbU?ܚ'ip|&r*|uʒ+8=G~_}G^߾euYF=ضSHO ڮ]^f 3~ۼeZNSl> K8<BYqϬ=lB6[Na.a#o=l6Ǹm
nm
կYG
)W6,Yj#
\oYj3xL=G 9[7v:vv$լ9W8U.Rh+IUmJZv%OؽIЮV d<\*_:t^ #yf1[<kW~{ $uEɴҙS\r]yW5tuwdS~ٿ wW]G3v|L9|zT#$]k {ķΓ,l~2E]l\D.+Ѳj]ۖ _ٗ_~iVұf%]V30mG +w<j6zb 5CV=xpdC d.p gZ? >lHf- ruYv4:ƾ+~gwL#Ct6r){#cBlﹽ: K|>6<'[<hXqOK_D~!isp ;-U[k6}=r
{J]B˖Rђ]A
Ec\kwKzxX5`͜fdhƮLi1Xv$s@
=u{QϿWX `xΐKl9-v$Dw߆DyOs _
zLZ{QA~^u5֯nGٖ'!I蓛svb}<m7$Ӿ_z@1߆ׯ8d~ifMQ'׃
m&g ~篬axr[~pZ}'6j{MZ zbuvU ooӍoϟK,;oeo p?r1Fc[߮; U
wcJ^9:cnӂo }yɒq)
ɭZľeKi~ {yя}2of}CM 1 }ŏIiys.*[uܒws2{ó9:9t\r21
~>uo S'#e[`ۮSbWkPgwnـt։%eWb_)CS7;vF8G=TMɾ2]ge[]K !vblإװVjFxƿ~}%\JI>gHYѡ2'UvBEG/8nT
9W `qfmm mqsԡj&'|wWL8|bcٯ(G8?RWd? 3YEpkӊh0(x/&p߶M[Yݶ/~j Vѷe;8;V3g5c(9{u Y5D"TIyPN8)" "'2\ ɑ e?
dm>q1 qUv.Z~x6 oZ9WD$ <;r
+(]B7 o@zNj@]>:GL,'ï9!"
Psқý|$(0a(_ȽJ u+ǃSVP?h+(E*M [l Czg:, r$p2cD|0S~vlx]玃w9 *϶ :z H7A#o¹|_TٮR?8 s_Nئeޡ_Ժ@ H r4$81!AI lGIyLpHDhf5r/i[ e?@r-b yxܽK m{^Xeak[zojgl_Xym}ϭmjD`E#V
d?_NB^GvEJ"G2N S8]"p0XY=WbpKq$?8 Gܻv ^ idn5 8]۲o1^HoT<(ˁԷwqT8A C u_B " D<QSL3SjӽIzתGP@)odfՆAp~紬nڝap|ƶ?hꫜ8o~"b@Ya^r @.?bZ" tee ~u=zNԈwt5^$h yw8NG}v;/IyPj#*þew!7yc-O 9 '`/-!1n3/`68hUj XxjOڧ7odJ%=;V @ sfC/H$k
Yv-aۥ;ێjClXI2H|DȂpjpFHoI 鄪'[m{8wuJ
}8HKSOk]pzsL_#0Z٫t&(U l}X.n)6C?Fɴ]E>i.o YYsJɲJUp! tΫl; :.sy8_w.!QsJ!& <
,djpI;'TW7˦úە3ٺ
^G%x<ԃ T.[в({-@{jfljy~?oO-[Ekx:[Ȟ5Zc}|kXck{۪|tl#*_|5bunl~u t.ۯ"O\GA28}Ue W۴n[ ~HC|v.T0 @0 nf>}N ugIS|k])!țq|F:zpc"A)m>3qbkŤP@ DVS# Jn-9.!+fc{P>hKmbΫ\+fNzD Ɂ0سe`_$-tD=/)W h]d6f ǔ7-a#| 7.Z' N(m*'
A$& /TG+7jܨfǸVR$_10~nPgDODN"p%ݡſ?}|w _V֭~xǪA6U<l`8" pDDc !$IKdž:w-B&FWFVY1݂6l q (d) 0rDA G]p2@ BB
)Tvd(ȿx{H
,P2 D P-Rx ΟTA`H-^VP-{}V^aphnFd*N_[ piz8oL>F 8Y!s#\_Pp vJ< Sb[Ur#g!\}@LH6N R@*Ck!z "[ݱu^:@yԩu92 JtRΆ !QIJ]NtQ A-~%n2`[
EC[zU4 ?-Xmش"t@ F !K/u
ɸֶ
8eɽZ ۽G`imsȹrtE>wv&g90ܪG6]I D v^ Dp^۱hw) N -zMϺoE ^^&"&ܡo+0쭊IK} ʨIzϮTٍ3
e b߆ ɷ2
E.y.XE^8!Ő.<rCACؗBu|YDG!B= |$4sA7_qF頎\( w"qPcs9X "\u<=F Yb*EZ+?a_}G mYȢgTM' Y]pe
)s@E go@6rEuo?19eZ%()[9KU!ܸgTn؍mtݪ5~fZ : [(B$ʠW^,)8N U_ci!{ArF,S_%85 pY,! e
V:kUC~%WyfF+%v
qUrɺˁ p 4 {9D?3;Oc$Dk?qߵ211" i!"C9+ 6"5P-'"D<$`;L=V{d='C+=C h ^Cw~:ߵ6ʆ k _!{O{n{בu+ /B_!ʜFv ؓ ,8Qp[?@P;?l_-dJ
P{vmH>G.bٚ
=8oB~C\'!7k[v f픗
T=M Ȇ;:G }ݏȈB > <;7e3'ɕz=1lfɂ5,sm.f-/?[f]eOۭ>{PfOV~% 3v`LY3NI;vM@vmS!&
_ޮr ڎuNy>^'+q_goCϗoΈ@z#9v?7*DOS):q ge B2]T ADR>gD]7K=}E;j&8ȓqV&/`/U#[co _Yu?ضmā ڳU{vrhk'unj[`AAZEx'Xv7J;KVmmWJ!7aD .@
OIIIq"vɀ$7QNjArGh3 P:N獳{][<N绁c
t>/B ҝN(Kv tJL!`U,p p7p,4,ྫ&D[ `8g< v"BD" ݇qu "& |
u ` ?8 pD?8%lppk,h_'H3_=zV'& B
<@yBbwSr 'ADr=`6;߃p:0FP˵zOj;KN h6BBD=˾Z;ozbM *A YмM/o/_̒
n0l"sV: [Yà=Omlت:ss {g̡3?h߶]G8' Z?
SW,iβ RDoVoyuN C5ʽfܣMBNpmq@7J9zk'}J 9v'ٽ8/&.EI5r/sZu= 1Yo#$gWKU#_RKG?
:-C6]ϩ);Pq䊺0,p b́\*XGt?D+Fpy; < & T qp_"{93(V(HQYY ,- 7{}sQTc`A+h 8OE(p/ {@v?_߇M #0X^X?kӟlVl¡-ҡ]}b%lrUw/! DrujAb{o 6a _? Bk}\O@P?i M{Pku蚖%GGy\ry6T> X߅euSﷆ@([~$N<=Q$Upr '50x~_zjW8ROg{xݢx&ŎwUomj[,^Jg|G8͔
7A芠e +l群$sȩr6' JA쟇 ^D 5!]xݫ<Ca H- zK~cRPb"O)Q]^pqf
֩Kw7"V7
IGq<9=]+ڷ'V p p?ݴE[Z?ZCyf]{ >kUu6?*6 ,w [ۅгC|M~@}{AHiQvoEf-@=^?~7 9:xύ3ھ0{[gG,+ b t{|:ȂߨD'9uEA
SoAnVcw+w1 '18{nڮF&e ^ J$ QG fOzuCYok]F&Ԟ}c鮽b[mt_A]+Ue%
ïkn n@Lе5~W8 ~
[¶#I eR
^% N# *um[ 0y彇w/>!s8Q5J|AL j
1Je{0u>M'&rk0$C tJDz dANW"@ 7<@(5T-[]۵~K' p$6pvP6VJQݻl6Ċp:9XlVE jI ZNơxCp(ؿs$aw8roS>aݬ̺ 2wgg0`9!]@pܴ=
R ¨
ANRB3:GܗX +22r O+V)#crՏѾ H'XVmm~`]okD cxYq-/QVvEI q]??vp$XIS__CbPD pGc
`^Z3EeA
Nzt-/zh½N&7b +@qxj2b}-
ۘL%XAH wU+ c.P ⠦D=eoslNABu Pq:Vܳ>XkU`_ mhzCnp֊T XIÈ g{/VL0@5C@P
}Mpd]
UKQyp旑
?Niu ,el^Ze5
Y;D `!& x=qK[ r9XV?cI 灂F8iLA^bI}K[YC-yCffϬ#R1Lptk@zmge,KOHցjԚ( Vh@g7qg{ σ@ĤM 0A(L:_UpJ,~K}ɂD u=F"g̻K^y߹ ش"8C
nY``ŚU CSV?m;8U YA͠ gso[Y nIkw&.Q@Y-t*M$r@Ǚ8xθ[MP=jȳշy uۜw30b<ˋoR6a3DQ9o@ ى"'}2 y ɳdߡ刄d_Agy%t[oPJXw{|; +8Wpx/gwٓmeاzKYu^?T/,(
2 /Qg7d_r2uɽH
p>dc:.qgI{Wѽz-~l )PWT@v2^o"[M[P{v Ȃc#CzZ^/B`:flf~? _}t ksBqtr
ln ݿnnIU}A?Av=_] N D "YJܪ I˪[LΛs{Ku|w1&?SkYP 檐QYJW˱ĝ3hi mPր:R7'!5UY֩+k ѱKhp,;IDAh TI߲5f^_Y 䕜._nCkGvQ]Y' uScg:
E\ "ے\@ n3Ds }d&
1|WH'1yc9\2B| Ui,)ޝ)K>zճGx \i&Μ2@y:^I"b=}gG?|eT
Zؾmڎ}/7M.oZWPڷM`Ǘ->@Bvf @#u1 ;%NmDI:)`?&n~K};4ZW@qp^$/ [: ,@"-8Ae?r4Hc=AIQS7 =)B?L`l~9
7pA?"$LڔnUF) K~ B餁m(8<PGG8v 1V㴸`ˇ1VJsQ )7CBSƃZd%4n8uLT^At@(`ZΒA 1"jqpen;&!3 5C"%>k^=-\C vpbg ckǞ,A̶] "D (< 28juRK G5",rD kY-]AU #V;ku{U+ZCz`sxf/Y_5+¾U+SwI_9 ZI뜕!9pb {2:<8xԱB {r}ɩ:e(
(%A`vAy (֑){1^]iw+t 9tȇ.AK.2#}g<$0:B 48Y`AjeI{w]T C=Q+62%uBmq e zv͖JpJÿҝ+ 5ɂ;8dSDYCXi}"g'
( SϜpy8o"_w=sG=7}'\'Qwx}ƁZ%b &b86Q
e˔e\"+تBlr?z` kزU+س kܱ[Tf 'Ma'*i&V"ٟm G@$arH^P4x(LIn%3i9~f_O[Vˬ7:`tt¦!!A v = yݖζvɷ; r=ux.=S& -qiߔ_[N7)&WàW|`o/}Zg ++n[Nzi72ݖhk%3.^ 9qduVvy܇6<߷Ⱦ h9Ƨupd|
g2*lcqZֶWPwJ1dnUW˂weM, yy,JdJ|lpg XȞu/}gA}YWg-/
ز |lb
Nޅ܆6) ]
br@˩x]RC i9M" 35NY
2ٰhY"{ns=Twyδ=d{jǒ%wqA
7c/ftksSu[xu4( :|a kvH r1u[ʱ"kJW{ qK"wc dՒ:Oe7 N\=(#ĻRVO@ם¸dpT=ODXLzYr]B^5;xGj/UYA u15@O=lcHy
7$Ġ Е1C>n2OjeSG[i[ae҄10ɖH2}ZNDz dk|AP3バ)Я&hݳ}ޱ]CD-X;RJ9ǃԌm?23uEYJ?Vd9 aнr` ) *;(GV\%˨tgBDA@ h},D=8ޕ,P6ߠ 0AXv)6jD
3il
$"DȰ^(P-
ߔ د}Zq2{ 7 H;R`w' 䬲||wX1e6?, H#k:d0r$m~mr/'
xF KABv ΠG-j)N+% .g;&8l= si99<R;Fh y_0u}k?~ K뺆9
㝈H g}dCM{qD 9J[{7 8yz%r e_W"m+X57Z
N-ں/筶oɪ֭xpъ ;Vٹd}{ZnV%Ҡ3۶! ْ|IgH6+nYy q+Lus|ЁJ
" \X6DaǸ=_$Yrw My8 'V;
u8!XY\ۮi^]o@/ٕj:$'Ou+ۃxPuٕj{dVXRV<c7*bbn,PJyO; 'PK V myL gThd4eY?|O>StD"tAoq:&>i21P<}c%$fF$ctU+=d<gdJ"3=*̯1d
8Ob`ߪf&OoZؑՎ[u/֮/?zkj#K mz6l :QX}`y={#ѾA(Y|/٧8Qxγy(M$jT@![n"N?ca8cYѸ~=w?"7V& ,صGEӳcYCE$ H2d ~ "
rOze }۟ ~M?*Hֻ^;] a`N^4%W=g=d`sQ;HTa u -qA#we=p*&~[Cpd>sJn׃\:G%Y
`'yWϒYsgR$ ή=/sC AA4;
1IQc"</ٵAd~~`ݴM}k;CX͍]? zwujͰ`zm[a< ?{`2)ҁ?q ږ쳂S(؈]?@b$h9 @$"mmF=R=su]F^,wR p W#(}U
ּԶ0 !!fHi
=9Oݻ ' %]W}yHW 1 fZ+(o!־%zY8G@b {ͫر\ľW.m rЏ-ӆVZvn$ލz|x 3*4xaLl"-5 ʟ_@BLV|qMF5&Zhޛc͡
'
BUqzAzrWP|5]k #$Vݍen`SXC)S'OUq²weBECѲȗp/} Y%S%@]dXJ2Xߙ,i 4k5uڑ}ka<0vd=?~mdiךah1,%P精
ͽ+!ȊG9V;n8
b,hP Aja$ ;"{
uQ8_F 4cMTR' Bg cVe wt#AJJ'ҹ=%Rc_QA z( b}pue 2 6lNDp" `;/cTz rD68@I7!& shwJmCBY>emv%] g)a
c0OwS"^.8h{mWݟ; R^7p@J ů \_eQz'8j}b,P
M! ' @ Cۥ"A@'B8u?ίgZѳ0{ Ai:S,FfpۚG 4O Z܉5
.ƾx_6SUoZ:AêU
l8ZIۢ5k2
D(Uϝ4N-aw1w4ry~=ƷAr1Ar9arkf~ {D V K CrZJʿ&ϝY' Cd7T JmSp. i<_?Rk)zMz&
Ξz *C? o$ BHD:I, +U =a#6rd7KyiA1 M\ !F HC<}{k8p
%z ͳOu ;mζSmAN
5d η 3q@kpBS}0mt 81oo
6prn]0@j, Ne[;+^' !qޅd?!^d_/GNTb㇞]PNhyfM3'2as['/g_O68j%8Jv 5mO>5ZQׁ$]" "1 l~Țg x+("KGkRޓngnYe8^\ =|ӼOu
HPz
8ܸl-+5~_ &r%(<Wy@oAaH \S`[B]#@d>5ਣRKZljjy RxOrEr$J(߯#nw;aL3r;
>vb] HNx&(',:{P ,+h,k _2~}NJ~7rZ.y
𮧽ԱaHڇD=߷QoaEx?/& b-& _'u#G0r`Mz66~s:Vmzyy]×_uBr`*z=qlU}31e" 7,"pC Cp0F Ah{HN" 5[V'qϒ2Qq 0CvB8Wk4Wvqʒ]r۴=hrH u;o"~V@@[dG }CLĭ"c莬:=GNUv!:Ԯ
٥Zu h=
u@:5pK܋3 h\k"d}<@.n.t P"-e4N댃 0~*CȏpyED>< w~Bl/r({Z^} Z,&tv:5uO3!oIUF%:I$yމ !tq]2z"aMsxXY0A='"De? 3YP1D?gC;0kc }P ,}j /_~nsK0[>%RQϦMqn
f)8RbQGD0vqD$B
,@:Yoݷ)Gaf5ڣf 2dPпf#VYaQd 1Pr`#RXAV R{PKe -8K %by_6oA`97XV-0k$X9b:DYP;`3v3Ӆ.
H'!ڞ?g<>jUaEpACZAN[lW 8q /E ; <p*={ 96JOE)草8?Nd;btDT $hM8
' @
ý+sÉ
T7EHWkڈ,h۳#Gԉu [}ߜm >?ȝ܊Uu\l[¼uZy: #+"xy`:@${1W' {Z qo"S.Pp,+p}";+0g)=GvP-B h{P5jŝc|O:~e4 J>2n I(ɉw`MjɿB'gWax !? pT [1fJZymU6`+Vr`gZբF:&T(,$u3 wCqJN$C~.4 ITٿz"r6r84 E.R!2f y}[T;Ɍ2${4H~T<*W@)/CY, "D$ɨ/"q_<ڮ ƺL~1bbub O+& ,[xk
4uG4YТmk}}? -XV4e+Vڹfe5s [q#DYͲv~dNY2.Y,+hĠ'*O}ݟweZ<ܳ
" k|?k bЪ'L `'D +;Mx7:GP \mOA;.2/ϐ| 6 P"S4H1MA}eKmf_2yn 㑓G vhk3r?A8цJEH} Sv}n";
Tw# 'äW}e> X ȔGtO -097or6EBzWr5.;3ܠO\ aH_qoiVWвqo&3
,1@ZCL:@d~x%C2,huk6t͟X̞w?jFDwlXE!e3v#dw4va:.\@c2zZubwe
h_h_0ΙGFiKo%-! пS>aq_t^-+Ai(<A9I*p&M " WB ^~ d26VŁ])S<g m]6|`n]+
zg½ '>DqT&QP :r{[-0I9F~}5o7
>y ghMSv(Eؕi== FvS\l+%Wk5lX%22K~uSzP&7ZT ޔz "yF'I="!O{r%U
e\)Q tUQƄ2a(]e<8[3M}W2oBf
I 0!jMٵ&' &cڧ|۳'/O7> ܶUY #9#( 0t ) L
N 8G?N_P@-+@)A"
Q]Ȃ @PG*op;( J
BY U*dxf#%0g@XmT.PQ|h= GAe8^j ?vOc!-V Bx+S
1!)ecF §8eާ2
4Zè2w(pO ωzZ;BpT >rqW 1Qp:258e`;xHЛ576Q.Tp~{F)pp _J!Xw :p . O9w&X5AiU,>U0~dm'ֆWtL؋?g/^دwo-V6,!咎E+e{'VҾ`Y> Xj&rc8Y:f;仉`>Bb+p6$aqz~/ Dj ƥfoO0 EA> C$wx@FYؐ@f<曫uGR" , m8]pjnڋ |f
8Mv?ƖvNާ\/:Y>9Kx~\S gP9 ]0rlKn8 쁲0yY
Ğtu ӌ.M7܃ 6u93ĺMݮM%Bϫ{}k\)<.4h [O!:ؖ">^ )upX]؇yq"?8ʹGt;:>Z~ 7sV se_nzw]k+ɂJP1fv7_; }:G
'w
F-cJ;Wcj)D}z[=MӚdREgd-%@A|(|%!@ї7 nZ56,{. 8% 6wG$) DSD&L7Nf^ELv}ݏZHk|"u%JH%BH$"]eى%"p6Kq$ :a
]=bXܵM]7R?eñȏ \} g]Qzn'ʽd*o?'[)d;@.PǃK#٧ NS*m>EGƳ_/#M[óawx 9W2:>[
<KSsJ|4G^d>D.OM $#@= boC FZ#DŽz/K.Γn5E}l6,+i?N=_g?UhI+ zew V=aTM6?K#@w )2Db@ ]
zOȩXٕIK!w &۶fddJ&ruY#Ϡe!ܿOi !M(Pn,></@Aud@LD?GJK > XrA7F ¨ k2:JO%3P'_`\G d^c _"egnk|5ťv$>hCwPn]i(9gt ݫRciHF~ʌ]*^U|G)a?ſWRԹda AUrM(c=ɢtkڮtS_:R;&;
Y
e ]b8EF*4s YBW0(h'"w& 4GT,N[>}kbeby};>:C;:¹aذE+ [Gҿ@Pzd
2-L˨Y5Ub
4~C$+ )U/ J'@6P";Bͬe(p] I.d#NU|MSmWQ , H9/bLPI<sA6b
Ȃh92@!_0r B)(~ 9
*|]]
RFmĚzK+l ru3<8y =u
OQYE1LƲ `pSލ9x~1I l"piFhQ?S<S)N:oBW*c= К>vMe @ν GO_nvlS)çʔs E'; *\KNjQS p< 7w|9" S!ܿe e[ lyף}k 1xh
6r*:'G?-./nXU AuZY)
_#/ڋ>AMgY=[>
",k Ku<ww{qj 8p<طΕܶ14~@D,,q$R~
Tmλ#wJg:12W>u#}c@)q 2o厪DD(*,BvA1bBF6FH)o/c&8 d`53V"Ap DvŸ ;
\H!#z g: K"'c+h-˦~]F8acy
'" PeԧhxH=D<oTp畒:,ޗ|;*Y9L㜏)L^&m3 462MYx@sgElJyg
*(T zxx8!HqZJC[Kz}`jG2 JF_wwcj:,ڱ\Ntwɞ#t вw-'Ucdt_N5ifׁe"v50ȑށh۳!8Aj55zA)I_MoTm])\A%W6Mvｈ3@Nuz%@ v" D+VНh,]p ?v |\*Hwⷷ9)ɂ*m{Yybo}66B,y`=s0Bb 9{E|ݓ!_uK.nKcǾK%;#on Ʊ|;RɢR}>w G:)/ݬ _>Sw8wW ڗyu>/MiWz;z{t;54P6( f{sꙥKDrܞ)Ż3dO""L/O$cD2uw8vGD$FwXz]
8m5{bݳGV5e?Wj_|on[Qs7ZQϔ.X~ۚ [q XМe Y~ߑel{5Ee<0} , @a0t58j =t!+(v@OA1 BёAIdC
f]Șgw `JϪ v -S ^토"
ˣ |,X譊mZ<ceǟY /pdV-ڛ }Ys)et6 "/
AuM-Y3v4n{<gM %6$fC&X ڞJ 8!UY$[T cYwGiJMoJFo&xV:۳XgẦfg/t&:@F 7YQρW95A[sY\>* 9Э1} 4Z<զ1>KSr
^L,PFL'"_5fA͐f<lVe X#-ݵ={;gS{``
eU=8N<ڴ<E{rtls>uc0@Qe @"d{PyE(PFJ#US P G
^xC<UX> _aX)NLĵ0Pd>ܞb tmWs#vpJ H$lZp."b ˰x! hRЊ&oF >ց%KYͼ/YW GT-0-)oDVU* Q|zspC -=ehh=c4DIe^ O9F\a>9m"=kiJ]#
õ9GB2 x Χ:
!5]^ va wnZY]Ses-!XU+M" DLPKQp "A ""& _+QIJ_:kc<E&ck=Vٿf#8
qQk[®5Ԭ)kVǛV>eqڦ Fn?,g "@3$>" I@B0# P @;}z7w1-} 9a;V
Z=dJ-FPcIt -j1aqAVz"0א{,8OO@!b PP rrZ5{?NbvyTc փtvΆu $1|Y Wz̮4O/>jG߃H>0BN:6$ģ2G}q aq4U\h0e( g^DHN)G( q8sۂ^R"g2?mi8v&z"} e]:jg ɾtNOMDRp%'_!AAp 8DP`RI&,P@HoP'U/ pϓ}Mq&#k: sOb`ZV_JGuqn e+߲!S<ʺ{?vtGN;ǃ"{wɼ=BfǾϖ!ݷ4da+DBT7K}r5rX#PSZ QdҮ o]N-
4nVJ[x Xʷ7YY@|ܮ+=ʨ2z탏n|٥ ̭ q3m
+~/}'@B={
ٖ:2@],IJ~a(nc R2sI]+E4/B 4 '=MSU")>Bt ă_52ۂ~ɦ.i W:R"%3pL:\>8g2 V:[ݚr|??V~tNݳH`L2D :Y@UcA4UDHF@ H &
⬛dn5 <k #Gֈn >65k ٰ>M/~m۲a+k I` g[<1@:Vw3hƐ,Lb5 F{ЇO7=&]ݎn{w{[Pԇzer'"scRdh
f(g&ȮP 0hߵ
CzDck˔Q;IЬ y} RB <! D -~pg|,We5(`e; Ъ~VfSK<qugV~ zL>@3q :BuP% E6T+$*ц(FeE`3e~ 6T3=F浜[|a;ۖQ@3XhzL1ŵ ~DtDa˸M| hgX"N^g };k緭X ϛxܟ^اUS؊il<VduaNJA}< F TSVC U8 I 'm
@$, muc~O?Q#@Eעwܡ@jX& #"<k '+d hDe1 0^?([BNZ;@^Ulk(^$N i (p]ke9Q-8=F~~8 Eyq z56&
% 2r`ϲv~'GL r!'G-!RQ]=99
k띶$ 2j
X5ҲUzj )Qp@) Puc8LSt麄
(bT
U
X9˚m(:6T
EBxbUϯOC@^eM[
jA,Ե1^V M;]Od@_u<=~K}47OI 0PP 7 TV@)J)BYyA c'q(u\bٯ:' p@Ս8 YqǼ
, ڳ~L0a_'? Pa<\M z:2
:P;T$
SQ ,e
(c$RM$
u #2X*Qׯ*zrnx\V(]2;>IW;3e1!
"8VG#3I]7#A@Qw >*)e& m,ï`^88w <_[ Np?hͮ>A}N
OK]L`гKL'eDȩJQ*OHt 8 aL,g(
{\$G.K_I߮cwT[ rTY=lL #,<@Fsc.؞Ǯ3#\'_ǻ̩ חԖrP=r/N>Cst
lH"n sRQֿoܻs)Ii{?l[
J*Xxزz Yq$+XV` ԍWv' {` ' ~ ?Ck ߳] ۳ C بO_ǟj8Y [#uN&?@Ƒ}{ ]ƺғ=!ei?O³K=gD։,A=Swv\`mP|b PiU]c m{xƝ^'
8۠[zBchLuGH~k<j@,%/b:n9+oPީ"p$L~<*>6㖜]jk Jv]lH*YDhv E,S
!/ euJ5!#*]$wȵPH YLsxK
5zAD㒗"= tґgs Ȝ-Y&/ G}˗:Qc@i]aU t 6l?uցtCΕo"T$f26<θ
c D>~Ȗ+?X>UFuo] ༬ok$ xǚ߱>Zi?|_be 6ĞsZ/>V=0n%V24cCV{(n9o>ed}kUID^^Q RkCy)BppuyDT2 @MpOP
^K86R>z^6`wr^?iUXضJv.P 3 |k`\ϕoPcj|lM2.؟b ." Ed3W3>EzX (YOݴf֨L*۴7ngٝ!
2d!SRڧYV_(5dqƞyL}Dpz$3lRshvȴ(',=RtDIoP*ʳ
Q3H dY߉X&o%xo%~$Wא9,5> fFk?]"N(E.K٥JOerlu1K ;A8Yzʳը.:k 6y
Dˏ~@g3AF*oUǰ'Ku[3P OqHI 4.IZ>fB";]ĖUcFن 0/;ἉXߙ,8 #R8 8QSU ֟S[<?~`McbT߽b=+ ݾu-l=1ͳ9$ `k% (;FYjCEIx* uJըN4
vIU5tYJY$cu~椁RQ9CV!r.~#@[ F|p8 EU JyvA)n
MڝK}fOmslfbGvV ( Eq@xȈI x^ O' A 9AWP]zPA]Ӵ{;V 4Ц5N9c=Fk. [Fp^YgYYJ_Jc," ]J)uW}H Υ^UkwP֍'! 'AQU<K5au=P {Q뻂 "D
V\!{7PkZLH oȑºm $X5M}T pPǍƧ/O?Qmg',$H(Dq|Svܦ> N$Nz '"ACtVj;@<KBn O7+pgC@U%I /F/]36c G"}
Kih8X? \74^%젷v "DD(`5"~z>>} 2\7M r eLPw+9d!vل`]翲lzi˖ַ?_GR=!` Sסx^%ݦ@5Z9 p *7}è$q ($} %8rΫj* TjjiG֧Nk.<g֥v;5CR_K֬}2XR1kfQw+@W:B-rZƕMG@1{FC SPLR(:!y A< eܫ"ZK% 0
R>J7NyߏxZ5ÆOՋ KVtظ (x'U[V?o5#-_=IK7OOlu)#?V9; BXQ˔\ f>4Mi(9Ƚ ?] F\V&<{X:!*vrz ])nT8i~9k=S.#+" Dds+b%2۵L^l`ػIa][2/RiFv˧3sb_b
Ppޒ~\ a?4Bu\UÄW<
e#fNGd?w!{nMt0u v) u;7;8Lj:HS =u6k34u]g"DDΌX葕jp & S l :2jE*:/G>qɾ* z[ltN:Uu tՃn Yp]Cѱs,>]vsh3 yFttB3dխ~6Ő,GugBf5< ޥonWWEݳ
1Y1!Ko'ϬI<pl
}gu.滶60<c?ُ>7wppɪF #yK{6͟ \tbarԲ>8j
V :I-aӐ]%B*i#/ e0"%~Ȩe<h
Z1: }^f/~ˬe"WJO}gH ffRf ,m~6 s
^)os.Mm`*]J9 W^ʳ: ,r~
lY4Y1kG߮^ul>XpRE*+Hy]]9A&^˔k{-&ꚈalqЉ9r؇"ؾ0'V?LC 됷qV߱巭c5#ܡel<4OϿl%kNއm"&U7;
䷼s~ݪl_mm;-kuc*D$<PlzW6O 7ky*_ qq^q~6Twl}&gd6rT;Fg p;uS2(@WtCPBEYrI52 Y;Cw ~ ucVSu8,/ʦ4=c'g e *[ҋ=pyn9I 0JN0D pEu U8t]4^p xpPA,鷒6_ qhK7>A爑=\OEpX}@Em1"+8 *-+P*e2^Fp8vOsT;ºhe8\*tomXyIXSc-MZ LF)aA@ | QZkŊ?>MO9R-
Eԛx9LdA%uPMNf5}ds6tbSlf<c>f {#8>0>ơY2lSC0* Sk/bʢQ1yh=3G7wd=a!sΥ C1"3h1Q 8!BD~ rPZ"UDET
]-H\h7""]E$QIJ_U7286oU89
~ic61h7?OoR(6͈R>3(\ͳ6~b/>㖇֢!NS/!08u{7kyᚠmz@]Dy`!cp~)˨:E8^2[j6ۅ
Ǖ-U vAӵjFxm C9Uk(! b" A]nF *."q%%$% >PG
?7؇ SkxYõ4ZGMo Q!;H]3 88y8
ߥxd'jū < DN.!oS H]~ako;6u# G: oJss+}B Geשh-kǶ{zshË'6t ȺZ#E~ c
LZ0
):ed]W6}iRwuR YP=9V? iPB*xK}1Γ}c.J$@'߰y}=w[Y:uަ[J8 R}쾲 @%P`$j `R## ?d!"I.u{~Ͼg 8huFˡ!6MJ q]{LBp}m AʏEĠ.iv_Iq*[A(Oa f#MdGW|ؾhӿa>]]qՊleMǝydZu'Q 4hؕdꯦxz,y"";/
G
S5PUc7[] Zf7?Glĩo{vkuϞX;kC?h*|ʖǭAk65k@tA+rЃ;ŧ6@ǧ }AuyjO
4ܠox*
dJʱ"KёKvf>mJe+P0յoLa&u;\g tLx
/IIηg=r[ף1 =W9kGFvmdb Vby<y;cٻe4NvO,`.u_2VRxD Ql#]cK0_KPkK% aw0%W`퍬~oy{YضrP χK)FŖg58Ee v2vj%`R6 DW (FyQr'VQl'u ~ `k =? ޏ?lK}lygҲe-yWT:|أFM
9:ߤƯ!Nth@=Am`!:A]W r Dz d<ZFaO]zy۳]X>ɝmj Yj+'5G ?,.̯si{ցn"oB4IM#k AEDRw
[;"
{zg79m`qzv9 G@ \>+xCk=BG<A<Qni OY: BXRlz߮ƬIV>]
m(xaVG6[meq')N(@ɂ~)>ԔYץp"*yOߵ^Ȃ?7O~<ԢAeXgoc#uCHE=2 Rp ȔnRY}u0؆
b:P@%-cL=p͢{=Z#Uكql|'.P9֡h9Q O)CZDDV?P
Dj!P|:Nsi.d}U[X
kNPL
+r |R|)+k ʆ^j7\PiZ >TFP;|4e+@nf{.PdOV:A{O^B 2Z18rW>%pxjO0' wM+Wȍ{7~}EU8B}}<v_d3{8c|r /bA2Dz(@-CY
e%(K5H'xШ̻S+лQ2!'h%ZV2F 0șӲʰ/QIJ_ٻ3!TokǞd[ O}5?)Kݵ %+>?O6
keo=sXZێ=^'
9=" | ɺcqc8Q ' ]^ܑ_w*1UQw59}V4lc>kΣ@\74>͂v ѽ<_}xC?%# @<ޙ8
4R#тUk /~k-̓VQb%U;qp K/Ez > "Y<&>mf#9\<@:V9eT` N=u ;BIߋ $`Y|n/<`|gB zܱ>ŗ= uuؚ'M=rK7 z'~
z8gS=_zL]ݨnϩEm Z]D#.P&uדQ
>ҡgV>X^ShpGBױ=
rː]:|EoQPųU,T⼩cבּkئ4YcߔeDdA]"NԼLymK6td'?ԌYnwOk=Xu H}߱'EdA'D2${*$s܆QgoYeT# { yI} x |ɯȮ#ո1ó &9H< Y|+CJDxv ҘԝwYBD =cQdV+j97S9=Go\L}
u1) =`Np/+Vг,;AUASYN^C.2OdA7A^x?wzgSC>Q:= DX<CC}m-6Jv|')O9yՇ"!``/qa eؿ k_OqR*)e{3)0FPW$
䚋=/&`zbQV.hTݾP7tu?#WIse? i߱Stu 苯uЦ76gYYK l[NUwkDWԉq NbZB xY-5Elf2AS =@/GO[ )-# I;vW4^| ۥ!nYv(?VQQ7 '88_B WKWX_Uܫ2v);"pk,PUaeZ^V%Azhw=%!_n5, e |%oWR3_a-mVYUcUll
OI]L#0MVPT|Mԯ!S즵s|,#MP&@KYAf`[zt@Ȗu sGMo#Olb{Ъ8=o 6%sO@-S|nio#V?nXqm'Aùf#+
ao)YJg5K.E']#Y̳"O;Vԩ=u5nx]Q#|=+ ~fCǦA-(@ Dt |{"
j*$X߽ZZhϪA)Jrbm
:?O>% "T1{P8r& 2ey
=C3 _۶yuM >!q2
p P~>VRdN%4QVBp0!5O 㜥b e쯰ϝs|[Ȃe#!:Wt>'X҃h=ަTe9 eL PFNT_m! 9Uz7"VbhzJ<BiA,+pW e+l Mh.G9(} jRw/eq!"(@p=o+Ld1Z]ԝE:V' 砎zVTp_#s+V;c[>axbC,O 1
{/ï` vJ [-sL';
D,:O,@ b@^ PݿPF13kMU{|L))ظg]H)sA'qqb%@A'
T/DQ U
M!;Ų5]~=l]#?I8,BYy Eٷw>Վ 0x|@R,<m{J@B)S$) YjHb6iS9ѫ;}?`ՍV5)gWS> yi yw'I;3w?dqNBɼ.0̇)c% 9?u)GC_p:cJsV7Ofm 1he5U`7ng`QUH ԲRj%WP6u Pj Z9 @?
G<cmȿ2y<xǁ@ " 8'
2:v9ִ O\A9u#bm" f˾:9Wv94sN 9yf[ J0lE8;E8(ݦf;jlQ$UТm{,^ʱV dOoϱ==as c/Y;
YD}WrijV [2VB,,+e}Ndj
q*G[M߲ﭰŖ6v,g?)@f]K+ǒ{m[BO{?Տ[2 m4 !'@r "pO ~ nl,{'k dJU [zq -<"BO{(@NDl"
'B_]!nCmV`uR^JzZec} Jy7n}ϲrU h Ϋ skGWT+N>\A7֫q96 k 0t ]vJw`˪jGAp{Vhg{خuط~dٟX~n/mtY$ N0dA@4H;NcY$".P/9yc~|L(M&"=yڦ_rϽ/uy/ХjoгZ͜~ ;:r, Ԡ}u1S:w,sGSvV|_MPݽ)
UVNG-'%\q9:5茽^~vtw2ϴb? N._'2_ݷ 4cbf_ڃA{<qtcz6 V IHQKvDx+5N{[Ȁm{иxe "ۻvJ[f[xr֮Oڕe{zbG-t4Us0] GÕ1w# q-רC/i\
zMXS;[r=6=K_o0U&>w{-;w;dlCȔ=l }KVm 5j=fA A:g
ݩAY0"_h*/d
iר'S u)Ƕ7+3 iaj-#ԽUk&sB@kO(_ 7t@Ln+'tM?Wxzfv9wY'm '֍^Zgݷ)|9C?F2݈ >Fz_Lv #`>fhvv0߬W8)KԵb3 . I%z,}uEh],H8e(Ɏy(@Ըj]PBXkj6^X}d|bJ%*5:r/C*
7j/~*d" Dߒ&iJTWꮠ10(?Y] (5rzìowv__>fe^d9R{F{lI)# mK\ @9x@ 9
$>4+Ӏq5BJ] !`Wz+q a}Қ[{lz|2s~s<B c])vmu|- ,Pրse
f;8W_- "mW}>AؕQef bB] ܤ邀} 2t.}~TB`x
ExO/B1 xɖ8tP"_ | èTK,{n qJu A!( Us&SGiklVjƞYN[ЊWQRg{G~}#֩7X
#BS~m><'>" 4i ;߀2< w@
wc`q 4)_d]λ;چOmBVOӶ87p,fm] B_q |r 2O-}861/|oiux{>Sjin u2L Oq |YލHV
L89_s1V ]`~w68bͽVB@t3 G=!
E'PNu_"K*z;\=B~ 2kj :.gZ1BB f]{X ?Eqp;故 '
UA]GA@3k$X4duKYL`amV;vd7N=& ϣ8 c'V6|bǖC.9_u( Yõj8ocˎ 5# C2 \] e@]
5{
@C,)@$L<ٗNVt{2ƟsEOٓ~i
{l_0|_[]
Y2@%,@4lڇ_|E9M) `4
bGMP |Ėm"@ϓ}qud?m|J5Gͬi:d?dj,nHɽ^<3u/˦~WA^M@նj
:[%AJ鿏T8?,
#nwC"w2"e_,Ji/9D,
Y= J#sl v)2|deg? ! j/վhilGF$z{ GZ$@Ri|w˾;O߆w"^ {և 9A~3:Eo&4Ⱥ0Α|=Y}_ + 1}lJ ɗ4qeF 'g<3;!:N
Be"#[͵dG%OUE)9#xavI]HA5 ɹt y}m'Pz$,Oy_ǻ{䌽guO{uGڱiU-6cB?[M️tػbk%
uqwf G, 3" 45Y1iVҘ,p`^j;) }̖@&(B؍yMC+K+v2o+KG{( n@nE VavFAĬѾ3An
xVDe!Я2%M#iiש#㞑Ľ
Tj |TB @
>cy/z6u+q"z)o[j e ;0b-M]f{9>^l R~,A{W]%;AF, z% R# XT?. n ;\mŧ'ȭ|d n ^v2@37PA>]2
=el۳[ᱻȝЄΪ @Yg_-~A5vԀniƯfOq=mW_P\kB[
\=ZF˱#@MIY"a 3x9Չ6owZ"3MQq#b vOA@"ĥ6h{uDz d
;
8;ZWC6 i;;" ~OGQ-ZUQۺuh -à %ENB@8KŖHdg
}ֶ;PPr s"6.8 *Gx #!wpD7XQ`z S`#۴3,<H HKʆ,+&R bԒgAہ py ػsvxo3km696biӎ,Z-1q(k:q p.,? kYAg /8+s &4±
)
2 }"ޭ %DMYQ:Ϧq¸T:b_
AD (@ Z (3"DJ;ֹ)^D*]:0MDNM0Wx ^! @&"Ȁ-D $tWS"@,u8KUY)V3H2LVld}[eh.l :Y*z4!U(n9bWG_b{\?#̭Iˡ d m}
Ba*FAֽE 6Ӻ%'.kg0(f]:b
}]7 pp9q3_
%D$:;g|GO[:$hK9pO|[wQ- /FX RK~2<y`E PǨoFmꞜ||ؒ+및>F&p[?+ַ} u_ ;Az -?2] ̱?}<ͣ>4p Ua ?ݧCYg'>ƬLv=m\, +Ϯ̙JeπRlX)2 .݉WzUk@-Y1u i#@?բZй9E UQY꿝܀ * &xa͘cеzDt1 "dM|L)'5P@_U#ʄx>2JlqEn y Wd_gCL,XwCd<Ixg5 U@Bے dkq ?}'w 3]p »Eƀ N]mܳ;ej],d_Mb|z`F .`F߂owҲ.ݿ Fzuu26 9G+%J[h'`q>5x5Ҿf()5 G9ii=>G?e>[77l`# ~Bh#d 9qcfA$Rqe'@|w>l C" l Q~l%:
"" D0NX7s ] rahɂzS0H*dD+x7F=WV(PRW oD{F]U߲c9MۖE]z) k@ q~A:E
7Ҡe $>*vOƊ"خɺHA{1e#GA%te GnB)<y_=_mn5}|ᷭjQʪogK/>Ԓ:[b_ akgl<ϕ߹}W>*~}o3֍]xe9 @U&vGr<-^eމ&rOqwҎm%7-#3"{; j eʆ2FֈOC>}Ud8 F hu]KYQʆRAZۮw}зxJ%H^Ӵkԗt2ZnY)Q+>@.DN*+]f ˹- i@c4+Oz ?66<֎[{ϯ7lzSŎ'oL6=:lB
r-Av-v~DhjmjtoVvlЂ6 }ը1oC/lx
.xO ˇA3"9 "!>s)@$a#,cyQ8th<P߿oU*K`m{7, "D!b>Xςeu#C[+^.i
m.U>x,YY V!Y
T}bv9DIK ׀#y&h}ɭO9b.)"AH澲D EHDz dZʇB> _.@sȫG8?{l?:GG { ^߿dZN%Rȁp"tEHI ScPf`=x
gǬ[7d@ATZ1I!"nŋ!CʐPC
3 [hvrC/_Zr["(w1 AAً*Lb1\m{g6wZl|x pfNiJ -s8
}ݙ]Sm p3tw4Pw N Jc|Mh]'pb@"`d)F4`LB2=r_jQG! <!*JRdȹM Hwu*+# Vн}M "|x]4D yP, +Wu. KhTzK#6 +.'kݛ ;")Խ8SȱL,8 ;mg6{0̬:Y'[A˘=ƐS?0kS+(w>==8 =g!/%ʿt eRa pP45%zw^Y^;0i!OK =0
1Q+QhsYvYdVDgUJ5*féwc,SW,
쏑orqn
N::yoGE*' B]]'65Kp:h d_g0 [7kT`6`E4+Wd {26 t0j @qG=XcL,?C$EA Omdm} O/ e(@qЂj"HYPGzMG%P֛,Gj6Mg!j[&JÆEK4
bG8cY.o ^ qI00hCAٜ_Om¡|\ R^q^Ø6вѾXnh ?$Rq1x!l~
JdAk
dH梎e[~yI= O~fEȾNW@N
ڌ k%{/pY"q= 9m)a'wN2.y~%HƉw'oi h~~9Ivr̪{,n #N^J3d%q/bt]
j)Gw}~*}|_:&@T]w<츂`?bP+S-Z
fg^%@PAeK֥ D=5`U
?%0< {69n
VcoOviVWq邱Cٯ?n=JPW g; T2~h#GޅprM=1< "ٗ CǗ_Rg6_@|m8AȂYY 98<0& yJWe" ,#du!^fgQ pn+ 9F՝g.kj5#;u4_{:$MDÆ@8Vw+e==d?s'w5V(d`B۸. 'XK7Dn\wm=˨n V9<kZ:uf%Hu|e{"Ï&H1*!2& /ba}uJ }o\OYһ߬ MWyAD:>+iQKF.#ՂȦM$ٶTR{&Ϟ,gd yhχ}hv_{Ox.bP^AO羗Hj_(Ǝ ae![Er- +#F
+9rle_&ZD"/Y1 E =YA?88) A02] =C`z} = _e'66){
ιC||빍nh@Ce(@{ enukV8VVA3ݠLM䰘oY{mSCv:.~VwSXNmؚIdߵ%,v ?@쫺dPײ|FݱH췌϶Mn線$vsvK˷ﷸƝ(ĻPUMĀ$:?,REDh B-+}Rۇo['
Jsl_vR1- nDd^6k'{֍*%,$m(7' An E ' <h8Wʮ[Q۴Kފ8
5 (}
vq J9y@.6 lY|@9(#C]u('C
-"umO8&6LP (TۿjMC>ξ
kvOd0ed[ Ah$ mW`B5ZO ~eā`UN`Y(IqڦRAR{q<z"$V
ǥU1w' Q AExj-3,' /"
:ATƆ! cC՚/AN BAA3DO@^RIX;@], 5- ,uI 4pNWLz J1jMT=>Gi6>+&:pG?Q+;By%l5(clm)~QNy3> hJ R}U:{vLPn "%%)s8qX
'E{f5V]ion߱ebd18Yru?hz#+<pdEVGY4]ޡF/ 9:YJ11=FuWwde=K+E~[j I|}={CжL[kgؿ6#uNnZg pZ 4ˈ=NdQ8 .
69C
4#G%Sk lf9 Y18~~
/0,=~.i ;>F 0
W eQNF<HBE:uTYC$n0ug^->4 -8zՠnJmE( LuѶGrɉMI M=N$d^Եl&JcK8iHS|rX~Ч;[m)io]|(,FoBTԱ=ᨋM >m=w|S} Y4RĨU UUHDX b =kZb n@FeJCKT
z8kx枂C+Ac+ =
?:tO v?ao
C>2 u} `@>Dg[ gI+J:4vFI}·606c g333owҁGw^ʶ*S}RC%.+G~{s`5HL$##ɿ## <ϹEtsv1'[Ugĩȵ(|>X_9}RJB"k%F/vRkQ=Mn.#"N&h8Qo6,y۲Y=~"@gd,ֳ 25T #/ɾgf ![IaiKu? C|ЊMDkt@BfrWEZFe<{MN yN5 !؞-[en Uaw}3t<zLسV V`u?"ܵ>Q)*A8(A^;
Ӕ?CsJX?hLw%~6rl췒iK! Ħ+;2{cOֿmz?@=ogU#@?蓢^].{oh{8&xK~%|;A:[^*I\]R jFh'Vk8~?u'^uh>M!?tm/.-ۿϽ%d}Md-<>}e ?Cf56H}l?A&۶ط>6Mn OlHXŧ_ܱ-_
jOOвT(qXٍjΕYЂ
k⛊$(CNJR WDEQCȂtY*u6[J]N Liq à9r e/HnO g ԭfSgZaNPhHfcgSOwۖ\Nj_L
0ܸ`iu/4D(08e? 3YPKvtS"
Zjw^X=caך |
R!W:\퓖)Knu[?
A=IG$~#@(OA(VǣAg"PbèС@b{=O6V.X%*@Tty(N+\|H/_;B 38=
e'0wue" pk(u$ԧz$@Ur}yXaf$U/R@ w Aci"W ~m+4auc21l](A}73
qB`<& ( H`[2 ̋P^ p,` ęc8:hY4g>~A&'t~"g1tK.. cs (UX]ԍ@@>ji c,B `Ѕ,y4I9q~ O *cB@^Nȇ~v!55ܓc1Ν|jC e_iȪSa4#S }Ͷ?`Y6d?A]y"0)A)wXX;0Gt]/w-b
"a9qBy=9h?Y}r0Ka]Y8ڟ2Pͭ}V1ky2 /B\hh]G1uo*x+?/]Z`I 1DTAU zو CP*]늃S/\z.ٯ6lxgM! ߝ Bc_'5XMo8l#Wk-x1zE܁'> ^yS
g?Om`g0oɼȃC]<q_&P\ -Xd,Ԁc܇3%
j4 Z@ZI @J n I6uX2 Iֲ L왜d -
'#cCi8Sow, AIq Jl:E>64kuDP)>AOAն.z'
jZ9 #t#\b{ |a-VXn+[N k sjR
v9p̳ :V-bv_V"$ wtkeg(G>3{Ⱦ;z@>g: e3ԅDcKO{F7a>sn J}!N_6^Ez"
yi-áaP1*A@B Y1ú
:)AY:AYQ^3C wGK{>Yk .[[_o C!ǎ*/t>Aϼ_|eJUpyv.e|L"B 8FdtǰwO@ w@B HL
4M|A>V r"OT#(P>J^,!5lm ymƶ6Q֩YX#PV*"RL(Q;D$PVQ Z),GNKqe3eQ*{HcA:Av?:
)tWQ8kY )4o鯩QlOhϼM>+uq ,[c/>v ("0S9 h@>AJv, û;p2gd1Ƿ}i놭J:'-fR r!5#=w-BKǞZsl8sՎw8 5 >{Xn
M69ymaE0h xƾ'Vi}MzgvѦ^X
A<$@H _r 27-GXPW
dްm[C73zncOmt":~}[ ;/}1~){5Y3!@
z?4!j6콦3T7e4j
ds
Ѳ XZ"w*Ea_z:OVw65POтcg b/',);7vWiK:!]
GP6dĝ9mYΖ>^Xq,e? 3YP3Sb@Y][l(0¸sbwvq27BfڦîEXߴ'/٦ gDC6w DբT~o>O7P0 "үeyQt</Q ٪1Zr>ZշXE
X]_}
gHa9vǍA" g"x+J,"p@]N,~"H[DP 11D`Ls k-v!4[.YggM ۍ)(&[LpmB\D d {= 3
p -q>OjXVS$A!'1IqpJn>x"24 *
1E&"\e+~9:6 PNB |89r!#p~m''V-q
}k Sb@ CwCWvk1*DxAO[|ȧgD=˾fA(uRd_oV7e?{+n [G
FB 1ur_혭 `|sK*
/r/&0 ֕JÁ<Z )x}w+# shYg1J[o'Rsi,<Σ]] :[ # $fr N$b!Fqp
"ǎOq@!2BXDWԎkp:-V tDD:KY1iԃ~n27Oc{ bXw 'kjuy?mX"
qH( I&˷B6`ٳ"bA2 Fd tp߱\;Q02-}sG\J3GJ;&~ 6~uH[G˒7Me/IMO]3wb( 9Ƒ=Ŷ!>FJA ObvvQC$;*ܛĠ ;2O <ٗ+DVKq~94²5Nl~e58ݶg'whElþP5~NCuׂ巂.d{_~"l@ȿ_>"-vȥ>gWF3A?ٞMC&D+AF3˪Q E|C," 1f zuc@>@"J?}cl52=;Qܟ|C~d:#(`[
Z2/hN`YP;~ذYgmtv1" _7YM#r j] 䝖=HnqC0DW("!{#5>DF H v<%3E
'}zT+u^^ Ȉ
ن7u)%|wi)-+%Y _-q.7'D4No]=zC ˶T6B3J
?z9C6l ז/^H`[Lcr\twC4
_3P83MٗtV?wĊ^v" wV9fݶ~ҾG?Blg-u8 a%܆
qfF,[_G<;B<d !'w`#*_EfQwa5p\K7е>+g>k' G,~x:A f[ IX3u
R'^Z Z/Iwiew~o<C'42hoQ0ZeZkml*[: }nS]SiG;g3+XȪ-.u].AH "z涐}-o8a@
-8v@sRfA";I0
B׃6 =j/?˵ETnۥG 3hcM76Kt_J8&/>}Ex]@Tj 5&Rj {YF> IGH5)"*>ꡧ'c<LV jEb~dk? uj(BȮk4!k3unk_Dz dZ %GhR=@?h6?}G Ie]K6ct@xA-u߉;o~yI"ѓ'Krd(" {SޜS۪:-m{`A"|w:jJkZy2#3cرsnHF
7B~Dmy T1^xhS; a mΝ0P?#bU{4!c0V IOrS"Dϧ$:.NUC#:ԯvwg+vA#q:zg{3@N<YwH8O@ !9OC<.ΎGOUmxx܊ (g`f"D8+08 v]q"bD9Ku2&4a' %B
a[S l|(4 q#8NGQ&
<,йzP:6$qھ01V; 9 x
Pӹ~$q)> +2|h1d놿 bx !9Do8Y5#trCy/0fV`1ɻvwd\_Ћ&(ݽyڻIr-o~~pb cap(F-c
U{y NFL?ط]a0(Y|
~ xTrBKJL (&w&}hޝ (.e FR ȸܵ3 "c 8 _hPP̞
2"d0ϵ%V֕_q{睏m:a#Eܱw; z<A+J94>ݠNc%%/ Vq0o$y ]h 4D(y4)JfTwZ`
4s𬚷|N%
Ƕ4ӊ]<2CWKx1 ~coӘ@?M >嘐B97P(RG.4|(2_ }ptewxpȸBp2< MU ?Xs[?gwm Nڣ+V'g ڿӛ Rf)mZU߶bݦ.Kh z U pL HJo !y ý߃)R8ߞ马uW/H@thFHn:12xz<棼?B38xO@N(et D'G~DOgJ6wt҇0dvuCCM{ tbI mkg5] @NEx#"GJF<?/FW- fUVAD=H`r M9 0h CaC0
A9 "B P3 Z !8 ( a;C]tݙAgzǺTo
w
,}@ |CIˢCMFd(
tQԵ k9)=G_ ߀c_}vk 910 AQ>*:H4qύu@z !EO?N| :m>>* 4P.x߳= ̨ﺣp}< 1mWx3a|)̯_V]qC\'79 xC,g x!n4MK'} ]rwf2yyo
_\tmA4\iTJlE1 ڏ|#Buڦ1d c~=hN4'LG X2_k:BnMmpt~qπx6\
֊Ϳ%01W |!!p$m P) 5Akpz^@5v`ڑ%mf NP:" r^R Iv[*D+p(L /x C}vbJHnxAo/j2G?I[l;NC-cBC@d- .'."2k6В7\roA'3:M>^XSXow/ZZ;_6P.& JĔmFoDs`lQHFN>Yy3#1A)
`{f}Rˈl|`~r>>a =1-1%e]ᚮ C3^p|D3 1QJy'o=M%b?ލ~-9 I Ye+*$B
VDLx
w(ୖ'O)*1 rA7
y= I K uj[[ȯZDՆFNڿr!~:c;˓/=CtÞRF~T 8PԁCJw ":)'G\2Dµipm ϧ ZpG!lCDB8-i~\Β35~ (m3ZI"8n!KS&yRCG̀ u ZB !n9s^DZvBp a"+[u̪2o
⚇" <i e ٍ>V 7:2fYڷkWv &vkJ c@H c$Ak%0`4htE 4u<`(+(t0a/]{ &[X \pu/ pftz +Y
$ O b{mxFȥGCύUh2kB¢(; r(X@LzΑ."g}W˧aXm`|vv[nВB}QΥׅ)4z/3-uG
{;AAE \fs5b'`nzq2Q82)# I9!}]u MGN\Yl*E%hAhd@ >>'zH608xE*m Ͼ7k4'^jiF ׇ{2(z|9pH~ɫnM?(hYpZ; Om5_5w h_whCsףmQv[cPh_ƒP mGT0b X9e0[AaçH^^mOZd~ΠՖkY I]W;Q )ԢPB N N_ޝQH|@ =أE 9] bWflv&g оtMiBl'i y rNі[ZbRT3Fi[}88u"m(v0hC)P]ry{^eJWg$e`s}_?0=24 ~Q(6; 8,C%V;Hk:>< Di m9TmEh+(h_'1c =иޏyd:]ÿ Gpx@~-^ r8Ewȩ؍ѝ9 Bt́P]&tApUu9#<*GC_4
X\o" O_,h9N}y~۪Oj1,owZ~aie k( aiOT7nv[]v/eY;߅v^?_7ryV<:tþ :{^r" $5[61ȂKweU b{+*<GĿ.< [ ~@dFH [ їT`bjՂެ<05UmԞXH^=߳djR646aO{j [?SF;B` ̆ T`k:19 JWBbN##_P^71N\ogAXJ1,Ĉ%uM/֧],{n]#~ o }e#v #x)|<G|j 2BO |'_w%0҉i@!tqhkx)]C1F5B }!;y,<
hd я1ъA镓v4~#" ,蟮a*6[ғ4hƛ_za% Anם S5^@n`fxxy ZDѾ+7놸 ʠ|{BBvi4pMs1WJ]FU>:AW#2¥țJ[}zO0faN| F}[enPbuW4ا 9P?O_[* : 4@@}Cy͠L)JvpEy) "*úVlck&6Vɬ_/֏h':)Ok`}oBBq-q_W$9<b}pFOd`(@P >Q0 d<;8vݨVEfFJ(E5 G2j%mĘ) yE%)
w 8X+4G \ۇppo.ǨF>i 00>ЋמB*[n뙥aikM?2 ϷߞrCm`0N Z{{hҾ}-4gZ78{@2Qmk?ܨ|7*J !=ˀ2ugc[j&͖)K
1^^gS1̧dTu(<
m).=B"1WJ E"M+ڨ ]428],aאǖtlp"e{'Wߵ{:2-w-ykh8vڮbАHD! Ap ya\/H#1>*@'c!$8\qg҉kn ڡ )U!9ZX9,3z=и ^w(6y?̢@`Dt% rXhw)M(M)ǚVckOG;g<@m|6VVA#99jsw9R:~__ ږEYZneQoiG?S[?x'ewz h?о/Q3vO}{0Z5eV(
uWF06cVh7EWE anNٓ Rjyܳ+3I}ȵ?h-#Dq; t -5`ٔlSPBFA Yp1C{H '9_ r j)6VMA_>蚴ȦR5 x^km cw 6"GyQ:@G_ E+(ad1U9v$G6 0Rua0?Hg t'QS!r_O9 E Vc{:ڧR.BKNOt g' >-D#IE%Z R{ ѨF,;0ڧ?NAN>3`n>/G@xfאXB{g3sefൣxXpJiMY6 æ`V3H}d=S.}%ZSξp˼yx"mQh7P 'AS
tmt}v5t+2 /z29ЛGFS>7Xb֝W'*1yNO. sA
h6Urv98¹Yg/}jP@1*
$CYtЛ\{]샏l`$kC ;x VZ=942"Z F<$:rQ!0 j {'h^!ʜ[ l[ K0
r%1ǎQRo0`v-qU@ذjXua{)1 U丒 [h m4>%z_Cv?xC/uAhw~9Y<6>w?>TGh$z2ߣu'鷚&9k{ѯ{֢"=iewr߷{ӶxcЌRr˞YC]=zBIFoD^ M,ZxZ4dbF- l}.֬U#
U/'!q`ZkwdKEٓ/>2 i%F RoJ6/QRNQ!htB9nv f2ܩP%O5u]#dN@D^èQ~0*(% !LLP&t>m^ s0t8VI y (fX1+RZoG 8:.YʳG.DB gP1&dxhòl\ە '##2=DA x @J]ǧ ܀E@GJW (;RFiJ
S 1r(uQN
s Nd9j^5õ?pcr 0$\OsO
} k7 10:xW| mj9dNx{7iuvZh_l<kK%5c([),=5b Yw^kIgAYEk dN4F6FB3r4(P} ½̳-L;ݛ@ܯNZ:]mο7
@K!(zx!^gJШt =Z}-xS -??0! Ejt"oQ&vN
# ug{$m{G/:
U iFbDj^iu;?c:/P0#+h 8ހN >%u\ut^wD:T^}h^#xp>cbje\kiyi8ʖd r6<D<ҒlH-/+'`;
Ip4(F5"; 0:eG>`@h|"Jf;kKP*wM/aFF=w)J?DKu=*SCy C L3voKW =l5w&P
Eʞ#gFFl G
{ Ø=_~7x*08uPֳs=<s~yi]e#N!4
y}kЮ'-)Z<s q]O
~E .ZsC # U}ݩ'4:mGX(+ |Po QS9Zvǂ2лO[it9kQ?mj叇!>{ ]L{25X
B=^ VN.P)Y&~Ex$ 2}Nz
7At_v~A?up2M5$^mp:ҟ=҇
گcrGB |h
m7WZef[&1.&UʰWN:O/yH<TBЧ"u< 0,H)1 EupgފQAmwct>⼕RDzޭ_CB_/}Y : V fCy釼Lw<]_C]6ľ Z*c[f×z*1 |ul aޚ:{?_7>M@tFmkc
l(kа gu5\ ~ mJ5]۵9d ij Wo&7 hO dqpz!\WmN펥o( V~X;Cu
5 "(Rw9u
\E&\/ zG O%?wєȻAvN l k k_Y=}x8}>MOS.h\-1*\ҫEeB-AEOq@=H
z]ѳ pk!B%^%~+bw
m/aJ{s Y|uϺ-6o yy6QU֝XX7}wANI院= 4";
x&u<<8 6N$I.@?#v-h>xH1 I}dkMd>{x"iߟ+hC%C
,i؊ ͞gދC+- F8?{:2a0YyWOmzi <Bף>R D[B P~cj@=Jyqa2B gzGe) 汩Jx`,_]GԺz9 dh(PO#_XPZR^dE}[qGG}[Wfw Ơmt<6.HqieC4:^}v7g6CUkX9O].m EHmjZ|~JG]G/h[u]tTQґ`ȇ㚛gHpM3R5.{Z %V6R4 @sICsM~J ۪{pY G 㳇(w%9 \ yPL5@0`'L jb<iO8Ga{83s+KAإ>뛜oc kB(-FԾWCĥi:ӥ}Цjvel Afryh\[=W>1iDW ]FfC(AՁbxbLuX:]D,8=5M,ҧ|;J.m!ڕ͋Ρa ?0Ϛ#CU ڈ懨wG뼛+ހtKJ
_%tծu YVG#0e/>Z'ҏсsUJlʥ6fr6m#ZdnR+9Ⲅ CyIѳCfAa9yEڦy O_a%Q
H ΑwZ Ԫ$y}{(G )zQB犽 AcM1: )c]t
` ~&>
WtJ@/T2Ac8
mL>cs֕\ \y7JE/P<=}=ZDVvd ە60wyߧh7.:?3MK^+Чk Zm9
HPNv~970Q|Č4 e}"l #pg
#<Bx4b̤s5 ({?;4K Є{c[o}yЈFA#MâAg5^+eS"8N|Z F
.}d+A'*b|-ᓷ]]yיW /eW0@G(W2nJJ~t#m֎F#-^ʧPFN}
ا @s x>m>ms E{Йs!iw)=Sz N zϝ~2v+$gA
}'1@TT`D\}3iEc/e <)R|䘢 yqr @#ÚncMSΗ d$"ڗ1z9oZ^α7 {l|&c/aB9{^vmpG{w=[v~}hC{`W924m?詽!.C1<WM {n!G1.$ ;-MwzRY!d>.<Z$WVWq/Zw-x 1A:s\>+<eetȀ
D VE ;ywߓkqL;<m}@ \/@_wJnjP4t;fI;zOhk%c2 $t p Y>|wzH|?-%Og$I:r> Py_vג.po<G JO@]aZNez'h-9d%߸S53
4?ĚG}
l~h{ _Cva 9sMhAF@GO G"ыdnM ѽ<WϪm- iE;X o Y/kl~ [ >41Ee)R[NakE H| >28]̶BvQBB]|u~oA)K8܅TO .FV8 : k^m 3BseR'EZJ`{A`R $8S rJS8NVϻ7XYqer!ȉ↉ N}ΥoAǢ>688 ! w*Zсcsj4q5,sW؎w БQy<:/7Jv'g+k(Ua<X\_,Q؆5' 'A'Ө-hA9,4us3pI{&oܿڏu*vțm#x " o/"ԄN9 #V75rxdu2F%3ANV@ph$0>s0#$t MPvm U%zb3Dڿm ԉ=@hˬwtpfѶiYY]o%,Y O,ԕ.v ޜD7PaAzo|[ _Ae.H![@'2{^=QhZ<,
i&& M=SK1Us~f0i
TN & sB
9,Ar\r9CWoy9dp :݀['pۣa mбW^)2iZ=]b0_ yݑ'LU)qgX/EpWd+h.9F
ްd^To}k(ZB\6ȗ=p:
zK?7yw8GHS$pQ3Q%PCR:cO+ۊV#@PԀ<y~:PDYuZ> RCH (r}xg}GqFۧa'\H$g.}9 Cg^XS0b2WLڒvڟ-V'?֞!ydFnHD?T/7$P ګ/b=M'{
K=rJ]0C^ˁ廄h y/E ishI`N\аg3u|=t*thsCD0ŇG݆9
V?" 18Gd?
>G=93N49a?ۚbhO411$Z}lqw;; =F7chX/GaFۍj;QٳjF o3\^8g sv}%֢]\_(G#Sߘz; !CA C +}\uS *w_9A @<Jܫ}?*mG E 9KC҉Si ]#3}
:"r_KitrX^wV(\0 ZMF^K XjBoj۽,z9SrTl_5ٝUmuTNW7' |K#v^=[6eԓ
%zy&/t/e 1pظ}~~.<^fnCk<G/1A'(kzR'nc<v}û3SnCyp~+
}*P$\TeڭQMyur0P
.x]<c^Bk)WTw \ 0Wuy̞5ܼ9k:'/{3VUv /K0/.SU9?~zP C*2 >row}L |r7$_^We#<p 8]zeĽE 10a?| y?Hf 嘎scY+ywp
MQ]wE= Nnе0 =iz4> uޑ:`kN/LIs?HG敿A%isP?4~#" ,,_K4iЖv,|Oko؏6乏%}ԍ;Ue+Q«hOVm{I<Y9h O\_ЈΑKH%;D+>B@UkZpa CFNdms(Xp2E21@1y urtxJetht@8
.BP@.жgw ތ{X/!,#&~Rؿb^DctKk{Z \z F J9 &Q?EA.z̉3՝np]g\- : |o aH XFn7# ~dpˡ= B{ͣ kPNՅ02BJO
S@NCavaϗjo+%OІ |vUdh?cM?S^( e;`V$HJDW
@4h{w.u4? H } Cz^"|FYp *1Ľ5SF M i >}'i3ɂèuo_ = D(gO]5,j" PΣCb > Jvemޟ78Tzkl_l>vY:mog~=gPF(cx\:o(()$ZmR'ipe`ZXk=WPuNqIVt7!B" (1 k08|eN
Ôu'1}Ǭe_ yCA/Q zQ>ZEut#(#V kd^?)!ǃF )4ArȦ oz9KY2q+ZK{bg3M[6I;w=`hP]ݴZz ڧx ݜyU+oFm {Jw9 CCr\"]^,PPƱ
=4n R)M(5jBzu'FLSG[ɔfjEah77 wGOR _8sT
jWt&^9
<qEz%;^ 4)SEA~7o+քܿ1\Z} 9֖w/(otao}A0ګvw.a_°x{jEЪy,q%h[VNӘkB9(5rR 9)P;_J |%{"hUUdԨO=RNj9y]п!<YB|}z)Dovj.w){osrpOtIjK~k
ڵ3ɚufxm;~֞ybMcѕڎ?3+ct[hXvb:`ֺk<_o OWoovL /-.AFe<{,yf5̶V 䭌vE\B
8r-HΒ<o&,:;Û8aԡ5hN Xuy܂x3 'MAPT=l"û "LqNR;M#<:=*yнNG w 9*|*@2j <zǚo7
۫i>mo> g/g^_e˾}F}Jjڳ[ Y}'O1 r)-Krԍ|9 /Ï>]͚ބ?xρ9'L_ л65onkhE;8W^}TϿk#OmuLY:VH8İg (!`7U#`: 0w`6+nګhvZi ]nFo~ȭv1D
y ʯ; JyXz C5ϰ:7"Rt!
yYr(tvnۖW#(5zb XmUp?y`wQ&?N Z5g]˝^Ԋ S g:aNF"i2KA.
B8Gӵ5"Fv4Qݠ=XY@;}y>:
JH=y "bDA\ `9t`A#>]ߎ#!>Ղm7"TtNXb1K k]Ga:G#r"hΣ(nAY2\ѕM1J
fO~s[b %@y@?u,p(|яBƽC頻N 1J&Qs0@s^;Bd'0z u<wm)e@j r / ҏ!pfQ*4P JQ VJ)2G
P tqdi˝|:OZ>ֲoН >ޖFY%eC?֕=I[b2r a]3̻~4<87i¢?)Z#=&d^Ƃy+ @*4rE߾^տ3 -Ѳi.~(z7e L7,( B,xzbѢv~^ vl(އ5$qBTKkAh ]DQZ}xl_xa ~ }szm [%b
kou,3%nyuJE2VrnB@wo
՝A#>݈еи ӱ5 сBws #Voc CNqʏ(zD`!ۖj` *#
|徰O"0Wx) 琰u:GkiX IOc2sm2/9[ߟA HB2 fܬ2tr s/=qSX84 gO kPע(pZf}, Ymٟق=Fj.CEǪxrzڀa1nܜ}{hNw؝.r?ҾH}2grE/yS#Ƴx{hbA&ıXbf֓eiKM)IBEM} h)@o4&G
ECA.ϧ1.Ήǵ/BKAڡ-At!E
Yr)7:քQ߄5\rghi̱]w^kot&RF$k
z}tF0Ѓn KNobGW Gϐ0: -ڈX aOx7n`H^ΗNw=R [KjNvL, *2@S"< zݟ}9E# ~tќCxI WؗO^!J%qp˄"jfcqEmn4a-s>5wt!7a"=}+ߓ?ٳZK/ [7\چd} @>XFMo!dsuj#q(|rUr+=!r- 7{\x}dsO-{luؼ]/ض=ւI+7ceM ۭ~M\x%udh=t] ED<Ё)1DL )T!bb\a8 iWܜ?lNDžxGa+)-H\.#:\9S;J}a_xv_[.4/B <F{]yǗ+-9 z
d]u[KФ rr|w'[< >|+ {/c8 IDATf
9 a(p}~G;5,mK:RϠ3sb=#Gwb5%GAXfҗL*fw_ăsr '*k]wtڏ+oH~
@|Ѷ@a:Ѧ
S&!1u .S10UvrYxג^:t\v#7"AH) cRm+i^V %wg I(c%i0[k{$.@>x Ȃ'& 7Dur/2e4<ZE4
alb2$ 3(p+ʄJvp@ >:{P]*S!-(2c'iPNŜC~Q J2)cYF; ce0Jq;eZ|/cjݯ, qS^= 2@DE \AG!pJ9bĀ:] # &R/3A S
#"
|)&: LxgaWКԾbAP B"G%W1%YS!JmIPwPȿsOc>/
H
u_;,
u P.:R0ڞ(@})|]GV( >B|% ?5˯ C3+ l-ۥB5
UaxG~u?#x {Pߑ-Z NFd4xA_ spzOcH
gNse (gt`94-43:
f dP RrSG@4h *."Ok>kjEÁ7tGT8er?7b8~ijn) .罼0oCH7݃'۞}6;(M ?ϡP4ܗ;6x~jWQ95 / ku#8¢fWFW0$=w}Jy}z_6 ڶ5)'H'Ju hړA J4"} 3=O=DQ gP$h@t TW
k
z ic^Qy/^IM X!
sNs "\nc&Nl+{0:r@wYP\= ]pGagFsYe$+"k M9xzsh> CLP A;^w8>, yXGY~ =TsJ|hw+
v XbzʳA?I_rD<i{eTS{%cv ~A)' Q}k>}<G#-Fs@̞;K|rh|h͊V쭖^{
7U>Gce\Zp F9,п;
0 4
}j =xwѿJѺr3:wG"d9TF"UGpIO0UFV NSnZy$P<mNx/5;֒=% C5 uӾd0<B -:!/ڟ*C " @<zm ֨E (U7 AVwNYhW$:
>-9!_I债Eߘ^8ʳ K ؟la@_ʃԉ=F&>WyM]S=ѳ1 ͗1//5*~Xzjpot
J߿&LUhz>I`ax{j;D&#h4G
7mӟө#ۿjBߕ>!6Q-u3 #wO#d!؇6 D *}J)4B<$-kX?N A|EΕn{uujA9Y_A%F'4s읯| b *ڕ1?}aЇ /s }{B_ o7r h7퍡qeKOǴ a^c(<^h;$ ?Loߨ(bP[ɣONoכzj=|LL@ҏ#* )h0?n:{[6̹cnܠNN5Ja @
6liխ:jZ J9 F] H, :N51|c%1ۖ]=9\z=gv܇qFtlۭ<>/]hh˶}h?l ܊-gF F)Li2: DkSrR {״ \hוl'6eUG".٣З"ݤEh 9F[ *ؔgz Dǀ+t
;quhO J@fUVFs.@atFrPʠ 49 N@xipBVb<*iT+!T mHH 笶d7췛S>ڐ 0h*{#AeUuϣ Q
) (8Fb е# ,b "Nж+uxPYЈ 3w+"4@SBM7 ) 9473xq- ⠼D1@A 8b~q
!@0"|_mplS TNM5k띰̜ΡHף
@fa,xD % ?e aq=/#$ahʒ<qd!r /X) ЂpW [ a}?YJyar9h]| F 2 (u~ ;J(qm -JLޏyG(;hn(hb %@ ː@CJ J@! Z( O%y ) 2$e[7gzZ2dz
« ky.?fhw['w?_Ӂc5J9҆w}ҰWgk_epyS|
T (1G</!a E.yuAY(vt$2 h)^q2K)GGaGlVe
ݷvCeL6D0
0@V 7C' T^a}|Y)ǩ"J|c{9>AF %
ա$PTTnf#9 FH!phţSqhA?++ s|ѣnRgOط
%g}!yz{V%Y{9lh?
>ލ:s
̏-<ZAΣ/@^d[u: u) 5R(E (vfć6BiC9 Y=b<=+_ %]9
2[1$[>h6gy8MҔIwDžG< !ƯCsh D_jqؗ@//kr|_嘹QԈh_NN /$Kfkii-+{uT#a @ANA ,| X2oq!xUK= 3 B5:?qx\>?ӻ^J_?Vvx}G 2aWipф1tS l$ }?PM=к!πǠS/`H 2ĤX߈2bz;о
Cwd0/}Uއ" nb4I&6m'[v|~ ^뜵,(NsJ+= Y gXvɣ Z5&Q?nq3v#z~}{*rox}
}_}x!w{7L 2e̷T rO}aiw/k遲ϬulǗ9:*ccN =õ18VV ;6c*IjdNB!·w '5蛊z4P8=gu}"mBhFU& (t_=˾\':`w9T^*cM5~g/D;Ԧifn-o - W}6E MPJeY9y<Z## ;px ]c<zm&ͺc a Gc)@0C L} /_);7O ha[wځn+ JNi=ed r
a[1@t h5r' -(@
B9 `M7` lzq߮[6,~bˬXz+ǖlFD>Y ]sTJxwa*!p#i. 7 J+O#^`42/~nd
#sqF?1aZ:Jy# B.%Y⎀uO?öd/Z `&T6ida A
OXVK !/#Í| |Z@B. :B F(J
J ,,R t9|m +PnhfU_b$wHm`WG%{#҉=3Z2g@ʥG|E_=pњG:1B5o SaG'RC? 2}@~e>uF 0,}K rDqauU T1]ˡvc~
1ѡ'4BNL 9ȗ2 @ə
!BAl>
qBN c#kpa<Ha0^I4j{8ȀF>i4=(Y{
7X LsoQg2!! J,GQRU,j$ko=첏~Or[ h#%轇
kE8<ߏ/}]
!$FU6 ;J?oPJx`vûi cc36pA|9< eNo@% 9D{[{wH (2 SԝcD^ Nr<gNBu:ޙ{ZOkAJm+4:̳t鼙]k[pɺҙ_ٿ~ɾǯu`ɚr%dT~z zf ۰ B cAƃөxi7ʢhJw@9 1LB]K4G%}}DĨEFDꣵ(JB J9w(]) DB2LTHDh_˙:>ZWB`I #Aa>R |RŔ1t_k(S%ĶqKH̠y$̇\%Y+zI`^|"Zؼ@FԞ ۟"vb<PN9_n @3+>+:[ &9˨vēa'Z67K;n ?= BMл7f͵Լc90 z҇= NC)<{611f*fdcZ:\H3cyʇe
:E{!B(z?x] Tc>P?Ϸ7̖u4p'{r(<dJ O[f^;xC.i;z/+bS5_>$}t
$#~% "'">pi w.g<-:W@!Z'K0 !ӨF<Un1w#X;a=
;' p
L{)afzNOCtז0'6}Rl<wLQ%"{
?Mf
=G(7mdd-V#h1mw Tv-pr \(w0JZsc?katb9i~m)PtЗ ͕FWu%Nݖ^?(I9 N >4ևlCitUk9[IA)}Gw÷'Ժ1h}[ӜXfrV-vF_o߅5t]
:J>sdG tч9 L ]N\Kw^?֡Ry?C} ojM,R.@Ǔe
U֭;`=Ypz$ߞ=<aɱwZ0;ˮ?ޙEcû
}C?XBʑ
s@#Ь'd_ƻ@Fj% K*5E!`U>
WT''-9 ܨ:j
aur
_݈^ ǡ 7n7=+(/W*2XcX*1âmtw $Dw _ڰCۃE9 @C,TMT7R0ml~®M->߰}FE+9xK2( ';?}+m=ucI ^q7I9aWO,8w~0%JRvҮf; 0W sFOA\E H"73֒O0
OdX4CT@0TD3z Y[]P ^ pd(y2YJ[(RH)Zʜ/c*5tSUP'gl؛0RΚ\;(nXRHZ |)(P!2Sd+tʅ aN`k87",z] 53BƅgozA08?/5jLT%J C+ʁPOwuJՁƈx <JTz]p<y8<@ѐa {U V;4EDW=Zo%x8o/>>αv a!S`/#W>AhT.iB23S7 tG?cˮ jc0| \GNFz5{ жFtLCR:Mc w7 ]J@r622e^¡sF4)Gh<D1"#I:4ͱ3h]t ^ _" ( <9}ʲM*g P:)ЙX Z1Z1zP4إG =k מmk{~7n<gV_TPnpa[3%JU[w {R֥>O{5TH˧:A)PNˠ@I3P&Ph<*(+or\y.) ;""Pz 9- $+N<@ B}^!~->OJ q% 8g0@!"^+m4ck>T"W(K$Pk3߯}8k'`0д=V"ђ՞ ٟZ~
CD Z u
#5h}cb卧(iKniZQ:T<X~ύ(}T >ђytT߁۞P^ƅ i{NmO/ic6 ɬ494iOxXjxl kCB4xx,:!,9]qWX|'ϣR]C봿o=<KWC e 61g̓h>ޞ/`L^om w ܶ_䴯i9fg T<"P F眆 be@is^i= Ӿ",!7W2h2bO(֊J3E55-Br깝hmhy"z zt C> D! *CJKҧ;vOҷ)
%Rи7b$Q' #GDX'n}` 96N9Y4yȷ6Uܴa6 })shw1矹qގl ByGΉE[| <}GgzYs|
ڟ*ڭ J (`15ۦ6E [Br).ڂAw% \sh=]LA'HjZuObàG ܻff-=kShDf^a GuqN?:xV9} %c;ql]S` tM v <;ֱqZ6n_Txv |n
etYR Οa?ok)4n7W Bԙ_no؍k\GљF|`@CwsmDN &4x>y }2!}t;|| 4+@Sր/j45,4#_ה Z>(
.E7gT ~Zjwr n@^覗~| =B7:ʾY9u9е; ʸ=Zu%9M/[mC,( ;@jFD>=gG(%|VwiB
ƕggM#wGtm+1DOb ƱѢoK9 E8!%_AO6kj$KhJQV~
eׅۙs|괚0 amA7d ^ lxxWx+ǂ ];Chk:pN °<pls `Y\"d1G8DEҝE՞k) .Ѻ^GkB(?.Y+*7PnBh7]oKM!0#R 9 -] U9&Tx#^ž$T-~t-WЀ m
.Is֭%= Q Nˁ!G Bn0ya Pon xUFSá0BI* Ý 2" ;¶ i )ySVF4H2---i#j/ nt嬴rdO
o0(609{Q}?_I>
s
R½ӆ\ F坮 ZYZ QvhNtO(Z˾ovՔ\9r"5uL|ѥhgt _-`T("Pd|!ފ+=Jƿ h[4^k.} A#X|{r<U
ٽނOك;|}뛬Z/N={>_7 v i t~D5/M(Zk<fwZr } YQ}#x Ɓm9L#KMk*voD`GiCJϳ(.d(dD;/[8cM *5.hRh{+m]l7Buˁ(: `~B 'xD
V CexCEw6=nms؆Q[Q %j_k{Gg.[Լ?{t+wQKMl4don=~e7$ >;3ǘcpA Fs0a-=geo3~>xU̺G>!.+ twoDڠh;}]%4
_>
},<}@Wz|'%ϓy.
7C@FX <}/cy@qo} }N38 Pi_¾9 oCϟ}`-S&Џ Z-@S<=8DnKhmyB|F p ꟑUI^#h h-.зPCx*Z#Z%i h`٣"H?xq Ӻ^y>-F<r tOw;81 GGr4BucBt 7(Ƹi *Qt0ZQgn3v^ <pjњ3V\w!絢 O2A[*eR͆AmW<l^fw<qc3wOKL%M/@iv~:zB;<JI~hQ6^{nyHڦ>MѴ0 w@wFO!NEΈ:;"#pĽf/غ&k LþyS@NmG|Z %n H ~.s *}?+` kYxH<z ll ~{Cݲ/q;vo'ҋ#'͚]/@;UO)9,}w$~,KnVT* ah|UsZwA#zMk;rhwwA֠ƭ9=Zݟ }B| Q?sh[৯};"HP{áEhhIP2,
k[ ʿpl(eEW+/@˃߈3; NC%$8 V@Iv%`0l'{7l(B,JX'l.XNm)JOkP ER5
C]K?A@9FY3 ^,HODT*nӃ`v4*ꢌ@'KLZ2]_*1 X_sb( %1@2!`!pecJRH : B u 9z+!P 8Ot!,)o )憼lc0jJ1kwa;xBGVض.e( CC6 :
h\A SCXu1 5t}=;p%e ? HV%a Aʇ+AXx{zBxF6{x[<:ޞhp,> M?#y!_ p hAt"P4=|ͦ+6l%T @}-UɊ'}
VY:iFV [F D
+@6́Mokl@߃?\j鷣w
C~ <潩擛.Zַ(:qoaѣ|T - Oz͝6èMJ)s8c#V^ DS' A ,cYGT5g]<]Щу
d?7D
WC#B%zcɧxEQ]h ^%Zn^ Bq
;A gsޭ{]vgl:l2 & |Ph7SϷ|hQ݅\ xK :I]Ѽ»韂UsDhɢ!>FAG=)xӫ, a[|=L)>܁G W
g%ss?k@ ]x2shQQsC SPz?րt_-)y ~f
; ӄh:C{ru)*%B`b< ,?GAnHU(<e%_٫w cH./(#O'CA7vv=磒.m'h_99zxgAzN#FFW K֟\s1~lb`A}o
5\Ϡi/ӄYPG0
d,DFzl QxPEG;QH$xb@>̓c!hN{zt`;fo=h3-NC5~a ZoCrzVpz ݼKh%3
}K~]
r`:i_ ïeHCr{0<rz2a. ֝B F|,>yڣ>{93w#|P 4ȟadԐ@=}M9?4kɵc}^h@އϠ}E7m9?a=LdeӦܶr_
x>ځ B_/CWr\=t_f1TӴw R(v":Lͮ?贽Ï19FsP1"`EW!x _x<O ՟ 4`HyP;xߴgzl|% _s7J?t{Zrz
;.4mhOG t :w峂oԃљE s:O(ZL>XʞTg.3 ӴcȎ^"k\gѮ<gG_v*>cO95>.&>#%GWh-ۋ 'Uv#wlpMŻ k
9cuZ ٛ|swLC|!~*vMykm %|AA ~&𩋠ȡ0FX9A$9 98+)<Dpe^O~sW]FG$FD>Y 'Fek^
V! aPط%:dض`yϠқ+w`@B#-CBna O } ƿINj0i9 6<:aE^ 2JOA<clDabu蚺^tVhϝ_ dcTwv)QR Y}h}p#C ., `4=| %kd;;;> &wҪ=qn6#Ԝ߇ G#rJ W xu#7J`(a4ZP>J}ͽS?OkIx]Iz2lV \[d4㺎ЎUjoX@:^Q Hy@H~|N]Km1w@l )Oaǒ9%0ܵL
&-]^,$W{k%eDoS습h
c_#/li:4ywƾpʫG%UBZP:P5̾|tawff|[XS%O'}\}L͓Bi@!,Yt
0 B,~xS40eqgrjoȷ]C69<jW>ɪه&|r(}((ZFS'42y?
1rJAu~ >RFHHj s ~Xgj|qY3=v]Uu~vb]zj꾍^W_ŋo7/>0ɀm>"}S'\zN 64~~~$טPh-ж+>Q': Od6QhCK=/iT Lp|(sv B_6u١e|}_ń8CxF q-{r҅ m@r\ih:Mm*y³Yر4/Z/ XV (h_|ytV F5FוYGcYݷo{6C5,vjR %r(m֔-oQDNh cw~:Bx>ޫZ%_wO`[ּ;A.Lj%d35Kg5^[|r3G ڸ>}o[HA+ w=> FyrD'yD;97'D!:ŕ#d Jƥ9H|Ɋ^O7l'／Q3ZC鑽߰K ||
s4ꥹ27+XmД.Ql}+t.<{{h#"eC}O;u Kˋ|c733 _NR7ö}gܺcx{y0'pR4d*c/|KKLNtV0H)'' ~NWD!h^(YZCȲKGl ?M~ hyԸt/,!)Yܷ*m.X@
5 V i_I0F[{ZJsq >0Ysv{>4lCgR0WU뚨# }ؾ*r3a7y] 6(4`
yg'_vz+}o&»| cs!D{xL9DF!Ô {wcrƦlm%}z&?^d ko-ppe4աO)vY=z!tϋ 1UH)njdm.l
Fku;oH N.1{o ?C^ .t|
j`M v=9qF, GJ=̶[ʗ/G>>8{lTߘn98D2g@kmh= VT 7
O: }p?Ѹ%b'e]wh=C/ ZeZ_'3{i3NOJ/@i }{8
XeJr nFD>Y2z
ivP>* NF%L# 20;bd1> :v_ۖb0>GtR|Hʁ2
X iZn#h45,E2 )2I)}9ܑ5G(\MjN2nx Fx0C83;sc(@#q;Ǻ8x :<I DjYF`*:RJdr]hH\hw_;RaI) `
lw 2Ү`qLeHU:>}'([{2>BB:AIdlNen0;v߱LwuV0Y ~x ?Ҿg23<۩zj5n}PG (()gоyPN&lp,iUe ,_+^_.<d}I#m[
ekU(0s8Q8-DНFiM r&**шbIDB_ Y C}>п8 > z&QF]0 Ck1`3a[}ƻ26fS(eAa_N<JAt0Ƌ;J6 %(F? ([@(t lԁ+;L)#Y$x97COp1:l681gCvٕVhaW> 0<`A&%L^hy
ԍZц =htK t^"E~e>
/P鎮:?PIJ- ϖl [}
hB%h:w֪yQȩd?.W"}:<?ϒ
m4 4)~ :h<-l\[^搻Z<0Gy'eʉՋ3Aך^wgAguLm_97wB&PmK6>7 g{^k#g,Daeh}߃6֝{NnqќTv */ׄA{9190BVzYBa #㶂r G(ibem|V(Ss(@5r ~pJ)V{(0rR( ~Bѡ4|:uDN}IBTS8GaN yxR oMIQA1҆Ñ
M`yvlo~ס6_v/Y>oBZS<n盚ʻ8''}_4/މQ :m3iw˾<8@'H !3 ǐaH s{9]@iҠayPJ|ioem[{eeVXQkhc^ζ@ۢ,&q=%Ҿ_^ #y 'KTjC^"K@eddtD b=meJ@t<gt:V\ܶTe*k\sspk7Fv_ڭk/֬ejwJV9o~Ȗ4bS׳K,zؾ" $
;`bNߤ?k*2H: II+mtLn ȗ++ [:4Q
yelݺ^5D9@Єm'xy{?.R* *Cc.o 7h0T7F5B*~gh[>fW$
doգ4+|1E[ۋ7d3ٽ=nL}q t }]n#²| WJih4
=S~:#?wqrvR+%h ZS@ivVޱx#䔋<G0Agt6|2sR\)tx2\WX H O:S glbAN z<mN֬ c<O~ Ҏ*slFD>Y 'F" F7M,[Q }.#@FA
zHv Ad UHiE/~*[y;(A ǣ B*J`D#@ Ea1 R"\@{D(\ߦTP<'FؔVwa,
@S|)xFpzLн@0{8 L8_vy'H/!F Fy7Os4%LT>uR]aN:_ư[v=}rfl<j)oo~1!䤼Kap2r`Ѓ`"܀ӶʂJN CUP~ECٍ}$7%:qzQ
>m7/QF.x0ֶlm Bb~r^tp 'F`迡p!a2{zd8~ 1mK<^,?Gc{|lI'9 B=BYEF>i_5%%thW?=(k5@*qV#[u '!مQZF(7a F&@?
7A v?p#EJxs# 7m9 TKӉE3{9Q*Tgv!?2cö?(!
EfZ3v&,F4!@q G`kdJF4l{Rm&n p%'Fm~ ҽN= H52=
}Kq/ HNHxMLL}v ,=S]=sh>ó8ʥ`sc zFh2E@`@G_y.0կA)2TAJAR/6yu[}sb0/ƱU exZgTxTǪ< ϫseKzrPs 6M xaˊ ~ cT>U??&z O.Dz
67چV'%ڶ
_ E#
ѾYЂ [Ժ|G9NlXWrzP N[w?C\ /9 փ3:S/yUA? o' }H>9(Z_.ʽZnl0vEМu :Bb /ƽV6oc5]|i9C%hȸ\QEIPz(d Gl?>];~pZ@@
C8<hIw^ _kw}UΙœ0'L^Y12zgM5l E}& hdM] Cy] AFNlY< y·sCmPAܢ7t> Me=x A1
/2Ƃd\b+Oc4<_ǖ%#t(sBPe{/ jb_Es^|G:.ѧZ }2b摕9\e
sܓKܻȷ)~Qxx*1e痹 9_gP:HR sk{6[$mD./[2ZUڧ)BOO)V_+֩h!N͓oZi`9 Id )fZu(k]MLaۿ1}u^
1
I/ %V~BPk$Zts/eSVְ"096
rp>F݅EEH$lbxv^۠}PQsW8oQ>1xWoPt>:I 7O k|_E&`GF__h]7 i/~ _L&y I[Wi{}_w Ocүk{Mb `+(#~ KAw'F0~y%Gɨ" b ^r "ו! mG54*GtyѢdh:w[zn5xS{' }RXl@Y9<o~ QjK〄xr8 .90>:]/Oq(raj=7"?^s`D#7" UPwk4g =)rHٳ~0#wHab/ÁSJ%E&k<q>:Qx1FBAk<GGE=:h ^5}`z2eqnFٰ>)I)
P7ֹ; "gPg_
"J1p'Cdۡ 9ZJf!4Ēa[:BL]#ILx20Bm p!J*>q6;gOvP+R3
aGptbdkd/aD<8
.PuO|dThJ)2dfJOrö @JI /gu9 VuOա8ԏ@@i18 P*(U0W }Ԉ h43zΣu x̺sUӟ&f( V~%Hk$qZ'k߷>Ƅ xRڻe? /GIve+AJl8|ZЄZnV>jM! SFw)e֑|eB!rc(BI':u^^TW^[8 Rc*g k?4O!-qZsgj0My #ϴqr=| A j<R%\pC#e8_w#rEAB1 /Ȼ P/IBiQߨ JJe 9c 5BՒɴ={~W~zmr!GJ/H@!!=йQF'>$-UXq[N!.Q< Zwqa}6vliָ悀23'Zm@wnc<Ծ*Ϥ"/X'_>zV ;;ܩ9i^hd:F|\(ڴ=gE n J|x^~},9>rN0`ecƷFh ePԏ ; fQGw;
=qP9,7
L[yU66{ ٖ!' vi M#t p2#(xV#G1h9|f=ԍk N$K1?QԍxL>#pC zr BNK;P(ʁ}ܲhJkx' )RZ(S˭ Z~Ky}u [YG,gKK3h L,/y#B p/>9Q= ;5rg+cE7~C .#(T^uxFHl 0 5m(/QW#[ޤExa{
s*SY^}: S <e.r6B5͋Es|: DUTƚ;im: , {{uO,wc`wl״J95ɾ @ƮA2Ԝ
fUKk`>-C֠('F05g nG߆PTnM6оj[u諣@W:Hqz^U5 ɩU[#PXnٯ $H֯w<hb SyGNpLۺigy5A*S>7,Wyr"PwɱR Uɣs4Mrvb`G/lckʖmhIyY9i--{p %uL!g(So ״7S]6OzSC݁Zya %_w6W 4Q[f{ ng(c
sǶ8AosȬdP;U/h\2lc ]˯_1WE#U3K$cos2ҳy7 @}fgAÚ#< [ <
# a{YPBwp GF^%BRgv}' De R|9
1_ &5aRbTxC]]c
F
LmaqS<̇
sΐ H hd='q/OXő5 =1J7qZJȱ 2e6((2 HpH]UF \ipBfkTyR0j/e"9?Ƿѩ}g ~@ 8u`0FGpnhS1_WmU; Kk0 eu+jjR [@@;+bw ([)`^Ɖ-u{nޏ`k8} }!=}=¨D^m?rMgy9xx>) w
<hROLFzYl a0t<Zh#@K.Q37QQ5 5lzhvQ r=m 6MA hRQJ*k0ɍg6.AuǪ7t-G*u4 9-dȄZRjzFgQ 7m#yaa
>BH _ 9^SQBPa% ݪTέ,!98y^SuDm9Q">"W29۶i2J]*eϟ#(B)5~*QJW^Iw"BpO@C yp/r(H`~ÊsֶmHN_Tot |m9 @k!hX4"8.F5"@˫c78Eߦn ^SXsTKFEߚݷ@`fΎ]Q4<a(LX_bm ~knraޞ
W=g"*|~{r_o 5( 2xum$EW0_@'Bx>[> EIFYRg{BiW|Y͔l`<m;(3;`+iBGQ|RSв we?>v?SGc5J(x@35'U9#/5I PXETdS ?5ߖM$Ż/fs{`=>= 19'J]; eD{mZd:Gex jjF? ";#
Mx c=Bϕlukum3Cyи GyAq<y^P_K/bځ
@݃ ]k ~ڧ %۵%(U^~;6a\Cy;Z_ڷ4sH\~i Y.]tkҪ?9 Z{mٻV{VMK@ h[i8(-ƞO/Ѯ9
W7M2g BFSAeCh8mbt OSa e?LCG/)b b4 b9,8 L8r"<2rж GV o{xD?DA!``y+s_oƦwvw鷒3sO6 *6wY F Wz2 Hp$C9 @v :'cgYL%Yv
" <<k{fov}Kԭ/ S֍gtZ X, R#JFy4F/@y۶L_|jã%왲DZ*^s'2kF| > &.! vYeLKsi@nݞlڷu+o ڄe?8 P ; rkx2ym7]' ^7E ,R08z SD
l @Mvca 34tb3I
ͻ`G
J oQ@H
Pp}_5'S蜗20N`Xm9
52P'RJ$*@<G ,Pd-`U8Wٿ_-~~\#,`;#@p
KWH~#p+~n#(@#tm~J )
YcMA
L3\h0Z1O fZ^uC#xA!ee=uPB?w>>sPE_ ]
;;q
2݁!p9蟏p<H&fJ1h;3Osڻgw?OY" /;03qkm-y" 26Lej(%Ķ_| -"\4
m{m zϵ1F4: F5h04щwM*d9eIJ0wF h>m^^twA!Â8"ǣa ;(r
rȹdn~g{2VVYW;mo
5H)g; sE }R|OF.XW8-g*.oXeUan`0
%w,,[(m* Wh%:
!ވF0o@yFy4:5؆ # 7+}| ߘ^d,@'>Q; "-'ھuNVm -OWY]h?oSHF , ی|i4RKFS/Ɓ
'lcv봯Ux !1/[{~,)^Lxw !9^@c)%֓@ -'?6/gA"_~k wDxo )R]_;oxF K1WE:5F G@(RW?q:rQhn~a
`u
e),r/sɔ ?{cC{C__M7]h$: VY[w l"./]8Χ"Dٹ5ˢ +"}Z,[Xmye%0&`LG@t 5UF; 4b< =O|ppȑ[R{L;oXbI n^ k?1v싦(}-xF +6,30i|CqY`4\f7m 8];-d?$'"@ Ԧ⊷Ky g"i#65G/o %A]Oa 1 TwY
Pc/# !BEQ%ު"9s ]VԈ"1 w,,[:_iwo='/m<ߕQ]ʈ-q? tqF{z&9
"m߉Αc HU/gΓs +Pȿ զ vf^_B+tdҼ-<<P8W#zj9g h
]˯wuqԦ^kS9 :
Tze9[BWΣ."XՅw_FD>Yd{< h7mib@vsXnv7[0*9 &P$ G5?v KWmfz[ <{?a8*yN1myϠX9zn< 3Q𤋣64:iC#L!p ? Ř@:P\S0 *"~DHy#8_C n;P)(S<FzQ 56!TQ8ڂσTٶ6m/gA*[J!c c
u]PD@#Q392샒/e^|xvH;y"m7 qϽr(';E]̺48Z.YwF;ᙤhh_=?
FQO^ :Os ŋwY F4(u?wM" ?JQW_"8 P,S#[6S :+kmL6^}hK X`0h OYw|?Jh#K
D`PFBdzl!"J!` ƀV4~iv^5WxJ g4~ظ/"Q ѿ" 4:$^JtGπ;
zmsfK˞LGB9Z!K)Q| ayhi BMA4BOh _d 7őO}<v::m"<4:c'mmmGI߱o
O@9FAvpB~ x>}h;"dQ.BQ8<_plԟ-. ϼf,4
bF{0,T9 N@AԽ՝[email protected]/p'gp@pz>U}&g
)YU#ɡM?縈;r֙ >rmCN@J+^+ЩMSƑ;B @s~8`CSE9JĬC'ƄF]01A z)h~r^9PFQ.l5ԁPWt),C2_^a[A-/soE C_дBJ0lԋ 1SJE \7B[eب;^u :i 닟(ӽL _9Sj>7 ӇF K9N>}Km>Q,ofݡ>,T&O_r}Edƽ} n_`_tns!w.YiR[d6o,ϼ}+ 4 m~I|6 ehed0|
P oD0=yM'k+GcЦE΅#{wMˉ@#Sy} O흩 `r*[?C.o@vC j" 4,l-ðƒ }>:Mb&s c3A^F59v}:.z %|gEY0J5VAKNL[w=yj}ESY,V$A0h Tjʁsh_}ˬȪWG h|xy:<) #*8
HjM{$Mŧ`;<yiJfa~g~~7dN>
2r]-gX%xBu 7Y>C|,8N8V7*G rSy9Xm
.,r~jy#طt=~WBrhT?2?PoD948FB<~Q]Es6^X) -zT
\D]j#~#" ,3@
P{/8 a)#,^۴o~=8 \k*
F8j{ll\jt͵e{)xE^| ץ AR:4W8: o C{(ySeZZ+!&25kcӳ608Pذ
Sj t:fe|^ 39[JFódsdU4~~0)eECP<J דpDB1[^4
(UA"LP*77lyi
JLʅ?u MƶH Dځ^8Wh LYQhFRS1w .E c[sPnZZR0fA |1mu@"w 3B0 gG 5=RήP@읲~rH!R[9v| ~дچ2
!䏿Mˮ[rh> <AӐ0d0Phh(K.T4?
MÏ@\TV6~ 45 X:FJ O^w> @%גRtKAhh>T縜] gAWBf3y FCeF(1E) w>J2&({r%.¢MXi\F{ћ)Z"=X1)eI;|j;k?M7m
jGtn ?s D4n"GYWϔjB*@CX[Ex2(zOYh; "m._1 O֝!(q\8/: P;,hi뷉
9.<tWqm% E_ ZG;ϻewO QQP(ɟ}ΔySY[Xٲ_ٹ2
in͋eG )v`pk Io!8rkAH}I:t9KC==rK{Rs< U :G/4RZ
C}Y[xX $/^y:ʐ/9$?
rKN:
Q
<4@Ha@k Oi?"WVyt,5 Ş@#KE SR^ԉ6 吔.Jrh48>
?-4
GD/,дJA
\ =>P ._"A*|/v@St4U !|} ~jקHVNߵc7}~vl0Y}GYeQ (?YONIt/;^~M5|z
yIa8XvM <7m]?xǍ$|AHclQ
F68Zݑ;,4MBmn)ta?G?X19~Wk@ yBރPXA!h?y 焜
FώyLEe+ؑCG+YEQzsgor?gəG+VN>QS|4 G5ԣm
8:ONE#4F'(Os",("k
<I ϣd ,o I ep0 5hQ8߈x^#A{6l,<G6=elEhp]+YzlsgV߈; (; & '=b6PT OlE9 rxz)#+).b:#Y^\Wt h`䇑A% \~z,p=@Gitn,@#RݩQ(9FgLm AOyP& u7T, Aƽ'7S}zk$kz_?|!c4^mKW&~)W,B<_\s?R ?Ɛ2S5d-l2aiڰEIb3 Y/?V* C=TCw 2@_ۦ/9})}U<9x;Q
\ZH ju7|_Ɯ &)YJN Ad} y!%a R|[ _U]}ۏKYs?3߀Pw8y6Q?OqP֯A
(BCIK0uM 9h[(D﹑D +Ў9{w1j6Tvb-6ipq; Xq)(Ԣs%Ai!ZS
0= q;(ʢ{ߤyR (>˻/l~J п2s*q6(W 3')D2U'flr:iCT85D__Z K# P $BӛTjx,
Gt.\4~. sh+_/2J G@,oٿ,P_Rҵ[@A)zް>;" S!}t.|V )ṩY^ t^ke7y!BSήw~=ۧ9 cgE:0§eh;OZ\ݷ!KI!01hpÒPj|6_%836V,P2r?NЄwfQ֠M:J&/xd{ }
}CTWmqr,'(I
*qEHq߈Dak*m ,h&&oV7y/OD
w$6Һ9}IMCrNj-KB:GTEw ;
4g,; mϊ 0gS9rGgAO
}=W`;o`?~Wx{d|I_@2>+r%+]^" D Ѹ i\9E<CduNY EhUZqW,ȉ !rDI r"[h#_o{
OUi`qyچlt4},P$B>| hCS}UckZjZ}~hU>dV8P ԠU[y ϡ[/{_䐃fV+h]}<%^yQ .BcDiEo ôuMmp|F'5`5hd<'7]y^@ YKgr ѩ2dɾlx 9
aD]۪?B_9Ou\wL G1]?3jOYbR# >x}[oۿbЕCr<9
9B玬\ٷc79c :Σ1ɜ:v^\ S%%4[iE+jݦUȀ$Kr2(k^(Fz@S.2GisMC7jϭu3
-c--𭐁o,вea"PyŞ kY El,l:mn8hp@pubAiPHhnk(tBjc<H sS<y`ȟEFp<0%0u 's(
G @\Ri2ā/`>gMxmԟ ϚNmw@ 2N:͵Μ
y~hGXO!syV |aԈ!>η'[k*%&.xd?__/oZ<ƅ,Nbx-s:Z
®n8N X/8$(B͏:|:+ҕCBPR8B!}!dzzsy-jQƅ7'Y5"lICR~,pcnSh؟\=z» א`= ^<8q?]1Ϣ'}>^ans~ :@! E #'Pڷm Yt瞖&R^3 G(
U}?>L?\NPy# 6}Pɉ4#UPQ1 h{wt E
ѯD>!9VH.J ;NDUB?!O|v" At0u4z=CP 7] 4,Pd_?g[8 ]+[Q!E:p:?-a
h~Vw*4~E:4
A =-l`+( %7̣5: >Y]Dhڕ}9*TW4 z! !Zoot
,8;g}- 3{VqD
'^DE-d(YdG߲J*64Y9B6 {y w; (GT?9̩J0>lH*'H"e_V@=L"?3L&
K4ce6Oe+bO
{]O2| C-96%~==Ggwejfe <_S
e/J|kpj<̑YZ~{i~c]Y G#T3h} 9 PA(|rԝ/_SD[;,P45gV|@!Կَr>N97}@EI#p䦁~ȂFWÜx сd;Ӿpg<33, CǠ>ŀ:h} Ox(0wF,Qڋ|ƲeS,)>?YS{ ^A9x}9L9 ޟ{_}{WR4 ^=|s)8Q'gb0Ϗ1m!Ām__|KE xul
YmQ>sKG#!7AcނF^#BN>@% mH/eH(%x8rc%偡]ʹj
GkF, (Pwԝӥ=tENe<6MF)Ѯ;yVWWZ-tb{ Y_gd/slz#8 @ʵe9B4\et.2%#Ύ 蕯 h<W\K
VDFuf l5R 6i!YPGL
И@۱.1# cʉhv,>gEDzm J"|b ג%t≕_Zak߈3; $Re*++vpxHgƀP]ӏCr|l~ Q(4NtFA^a{<lHr8ث|
zYW 0P+#@93 :X|͈P}Cri+!0):TMMMȠͤTm2=oeF=<pA`S@I|h~ȏBqC=ʾo`H) O=؆-! ^r e1ȹyn@?̹@]XT `>\Ycaϱ2<;8N ) Y:~P@پ~z ,0P4Dhe> TI)_5b*#!/ X#t]9D Y Y @ڮw%ǃ z L͕gvxz~)L n`ؓw0@Ҿ
˩YFÏlzFP'bTh}{G1D!_Hɻ/G
1yWC 9F'SW>겒-z8 eZ9u ו.LrЎ11C ;81eeY˒R3s̨Zeb%={ԩSU{w Xy--]f<V[+Xgt)$B㶳Q?O0n!x!4U;MD[%'oWMJ%KT{@ ;8
hʂ]@&f>7b
zpcԏ5b& QYpȫ7 4Ҽ EPO Sa= Um
8gv}ݏVaMS/]a&ˉ^
AE$ nu]<N? b-C#ܞS[K̶[L>ޤ=ȿ>{FU{y }?.T{MDd#d>AWj .}` ^xZ!!g=R{ SP[0|$f~e/qwT$dE u2g ϙst_:oRwxW=@̳=
&Qy< r ҏ"$}DJ'W8 e>>%Z;~xBf;v]'(
D'3eQE{J@d9 oy}})H,;E~?QB/MQOTهNYp1\q4$F+MV|ys}؟,.Y [c6 ,'-f
tk"XWʖ|&[aX]O
i
4AH.O k S8S}Q(*2k
%zv_ r(pcj$e6 I=u&
Hu͠)ւx'tl
$9A>S:M A#J TB?EMvxG^#37xBxۼoB7G$"*Z':^fi=3?0mE/rQy 0%).ޣCg_vĄ46{ pSn:z&e5 lH}e hZA aU]cHYh ~D#R;=b]wN/ڷYDa/$iMJh8PD:O obdd?Z[[QlQ?W_}
q# <`2Zx~GA$_[ $6)(O c:d&T
L[}t ȏ:rV!H=d&RC!/o{hѱ d3(v(_H ʹ7;U=D[}AN)"zv$)Y>E]B~a
X4uTE`j-(3ɼV9: _>WzP!7}qeP?_|v,*rՋQ8lI]JC(BSnwynv|I
ܷia(0l'HXiO,0EõH]ǎ>*)隣Ӻڗ /%\thɀF_
(< jDcQ59QC+ 5 ~QtړtX4v@@FF +J1 N| " u-SO:y},v0lyΩBrxHy@!NQ* d+JT )$bAsxyH<mtrZaLG 5 3Hf8|. ..`b 唵5@oF'|}}_IN~ s@S0" ̈Ϣ'u܀okzV#rb ,zT)waFDF&}~|Nx/ܪ-EM hB4MmT $hQX#Xt퀭JELRU. y8 zZHˡiΓw}{2Kzi/z'⠬ M§I:cOmq ?{hKþkF(5Cg{*
P <
*@Dś6syf>mCM,ʝ T4 f\:vGt?F<֢ZB/6ҧENsn;LЬI(<&R:/)W L9%Ff hI7:A YSAYP(qAS_CgYӴ! >@ݯ_#W Tp@vBwy\ϧ;8uY|v,=Mm$ >O#BV6D
?V* s[wXVm0qӻq6:nu\3 ܓᄘ|>v+PDyu|5M? */@q tD5_ ȑcppDZ_$)!Ejd mfTQq
{$|x =cpcFK "AG2*jR^v3 ӾD[g@L%. "=]H>N~ uCB刣އz46&8cOUԹPKoSoh+E-ABN9I'lگ]~ _>pmF[NbGIS 8ωO[SiEZ
vd)aP4)BWWP-ntߞPliG0%a8.
v'Go+\"vPv&@>iL~$EM?=) #}] k9s+g6ŶGMHSFL@cz7]" b<oFxN鴾ct=1a7kڥm$mL/mmrP^B}%/퀮/W龖yz11ROk$(ﻉ>c7͙> j8'F}ڔQ4zB8z
3vmS# B` \}kE}.`7$N iOtCBU`Q(oD}ǬzԢF?`,?r_? @~>ɾWS}OP0Rt!ύuYK)NFY ?Y-nuuO}BѺ6o} }5Pd1։ e2=Bmp188꾦 yoJ7b``?~
DC] GO<Miȿ
Mm-Q("nk^s; \}~Wmkյ]^zyn HJԏ4}^mV/u Ihz DгaİGKm~_>AܕUa<SaDKHE Z&`"1C;)ۍ]Yo: U
qbj 1kU 걓ϯڀ$o} Ou@ d^U-c>6FBqHvH@@ .g7MPوq`d xR
-~CMtki@PD
} :K9Sw3$-K~/M2k"pD0'CS4ag߰Ya8-ROc/OG.`=<4L>$'DYr}EUOb߳@4kXb9 9:&%+X}Eb4Zk =Vjf"]=>6d5T )z&E
9d<ebk ?: ӖCoQaTj#W-ϝ|\AC"$dVw~tssu(o7?A)`k@+xb cl3LnF,1uxhȈFG)&}ѓAYcƄK$ /=غ42K1pz J/tk4vX++xF5AUT龂h.MɃ10<
"oJzٯMJL a
o DNny >iP@UQ<MC4Ji
ʖZ|l+\>/ =NR"/]Kh7lqGO7/1zzN=$ZcށљD" `d狰ʶs
SFe 8l,P`+pÍb`#j"*P: x
5kK/2[UT&I@yE&qVd.*r -k%^*P?cg8jQ[6`xdp4K)>mtD&bY&=Ee|ֺfM6E!?Cѿ7Aӏ䳵|hA8+P/%h$<y!uvF_A m5OdN;b/uه&/ n~'g !^L'V*&*4:_$1
+a S&2mN$[LCXfVB}`_*aE |wL?9X&F=le{ T>'OwXY'N]O5Ⱦ$."Y 4
0ѵtb!O
+p
``!A} Q&lkܚ"&:}Qd9,hO _VPzc
叕Y''~Y %F 4ō'Db lp7mo:s]HcF#aޯ2o%!.9k|f' ]'5oϔUQŞ*'\ (P}o"xTTˢ9LAr&; #WA\r3i} uN4qxr>>
%
}N0C
W|&-zy]ȗDFHz]+C؝ =AĻ~u_A K<x5 ,rPve Ihjr
'jw`O$|c"A|gt 0A lZ| %jY $ZAaoL/ ;% Y`V](IB!Dɳ)>o5Cr];X+Թ166/3eES1-7jQ$ @ m
h#K/I% 4ϥ(K@e _bğ[\n ?JH3aޛ?)"~
$Z$mɉH ]|｝$( sJ=
$I=hYE- A qhE\~YƈwQ)DqtBƌ[F?#iHe}ca/A=!X' v6D _vЏJwN\>dݟ, `oYt4|m`tR(X `9$ P #t"44"-fC\s=$
Z>QKjc"cCc 9VfRȔ@&1o͗os`h -P g.C= D8!6 7*/!u (*paDF91TC=Lbs+klbo/'o9#
"c{7}s~Gurl ]VxhGm&&cAλp]!LL I09D j#&P@DdY-2`gݛ@EM^[)3rڪaʙwx7sy Ogsr?{Խj5R{N
?eՇoߍD[(LH9xoxHFJS ND'
C'4ı!fR
<"XϠ1`4ҀL'u?JO=z ͡8:'E;I6 bv}` ~`4o9IDΪ ")Piܨ~i LsoE
( .&<
,R%f0S)0F 3-ImG hv( ;=
*`H%(
(vG' dqϐ%7̈tRR" vAcOXߘ
J%&hw .; k[q> ~qŕטJM
J`[0f9*@u?, ف -Z<QbM@mvD؆vo lFm`A _("*Vm9iҜy!:tUmOKahjRq/)K^yvpMݒV4i$य़UFV63T@s ZoP8.dZW5G-C'0| !kϧc"=) 6&7V4!Q{݇rH|ALP}fl.|L
#SSRdY<Cb`l-A"?izw rDz˚^`As0\$@~C'1љ.Xߕ-*Q(eEBw>3E` P䠀 $(W۞
19X`Wzo| 1\""5
A,jL <lO .2# 3dۍtja<r+Ͱ
S-A%Y<YǓ|%,qZO>~Oδf ԡ(K*R ^ ,w()\An캍,liЗ'ۘΉc7'LKge-g3a-E *څmehRg0G]cf8uL 8tn.b`lgRJI9HPjppAg $4 zf kU'I@Ȕٍq4FӨaG@,44] 4`Y>R&Z Pvy ioqm z
PKw߳VBP"M:n2!)*v<h\B`k|F{ M7S/m|<_2kU 7f
qJ4;t(mWR:hE6,f&5,hk-fd?UW_ x 7edI̵Mǭc}+p`<P =bTLG y r0ax+>mY4nk̏ EIg #*
dGyC(*5_v?F_zǑUqC P"'F J=ؗ}}`Dd=J(#~א.ElWL NQUpzsD^NTwGb v;i>pA~ ;~ M, `)MefȁF
4
,f8zrJa\?SG>3/'Shs.0BN Jȴ ǭ9W&J" m̹OBc:J~~Oath(T(0ALV@gqs] ֬8DvS$2KciS$7Y J6d :[`Dvjt q:duN(j@4{[oo۬nA@L ]dۤSL#=qދ D#"arʼ/Cmp*HQܷF
"H,rdȽg@
hm@kߩc~6!a}.Dd`~@ z{
lP$NJ7\*EVo'?w(2Y*{oOyҳ5!TSpX0 *KFU P'[
h$ !o58<|=:'t@zI}t9u9sl'Y4ʨM(Q =vH]#pS_9$is"44(`ll ]q\9c}g>h\{vP/Qȑ?#طfh(Pz9A,v@`>ľ#=N \ )$W A3("A5},oh;}VFDMJ2ߙK``* J&iwE5,V)
$_< ?Sl3-ҷɁl (0Rhd,b\:kFRIBzѦ5a m}tUA!{nُ ־ 8oQtXE` 9ylHk dAbߟ Tj
/eޯUЊF_I$|:QaO#pf &, &E؇HR$xlZ@#= PU~ Q+*(tE@Wk6N 0:o fچ)clP kɻDWp-""ü HF> =zx> ^+rne; %< C]ݏ~ ?e/BXޟ ﶃQT(ۧD6mgxz(@Aab<b {Ώqi)e,8c[YB" = PhsN_;H`n &&
$LM}wxz)W}^II5.]䤭3XHz㽘-EAfe(g|<ӞfSwt݈'辂F̀Ä}<>kpig
~4S|&J hoYG~N]|FԕV[{I`#i
foCT0JbOl? _s<F'ߩQ+*2np"G$]po{'Fǽvw fj=@֊|<l$u $ĻDnjJܖ^BY49𒃌 ̐i;Ļ
(@`F':f8h"~m#|-x瓿w?<W=I
)9),WhzK7B[&R@Ju"/" -"vgb`@d3q}N <8/8 \t
|̰IOF{(e Rʹ&<,Se %-#ɧү}se|zd+ģ i QFoR's[To@b07XlQg>9~&?֎aNv3F;-O/<K }K`889o
:W,j9Ur3{%9ڈ>G:
ʛ%M:~a9SظA[rs?Yl;`U W?Ke Q] k,B#eXmho;oim 9
aсɑdkߤj#hDoy#
0X0Y; uDīH/&:*q"0}
>GdJ#hTT5oH }}~S`}&:SbG1Kx-}NW)Fw CFU@Vʹ<6=%:ۉ$ӈ &A:ZVthtq"XMq/ko5Kb ~ 9@
i00 z>q܊QN~NO`b#V" F&~J=drrQ$L & twJ>1r^AR-!a\tf
AFmĨ}' jyNE:P4RkXz߁FJKFIF&P@54AX zwֻUBSP{f*XMͤOzށRi%A?R ='|OMOiVV
latс}!Q 9r;IA^sA>OUs,jLk_ )cʝ
tג.}_L1_6Rta 4FdH <|,1ۆxY2?!V n2xh }f.;X`H-ujeA 96imtZ"@njDCvC0:;I^Qޅ8=J'` RS`pZ"Vd"=;-ȷ Nsz$꿼.0zߖ {'na =E~"c D]o!MǟT{?PK*(n~mGӄ6Fj3R l=J *]x슱1}އkH@MXYK#zN?~ @}[w7 硹"E*c?Viç}C?rXd(@@A!Mg*p(@eȤk#` (@L 7@;|1i >x( k~Q>8Q$<[>ծT8oﲓM]GIfienN5! :`8P<kt_Nv&ޖGף%&퉂qa&~o-QoYݲDȌTsedxߚbD,HWĤʲ#k/ >tu#Gp .ξ ݃f5|sēnMUDaWP ~cL jĊ%I$iA8,о9f ,}3ENj[ci[U$' )qtO,̓vv3CaWi KgmmR￠ߓs%{[H{#E}ee
>VBaWMGI(\>lH\l'߳>22{t D-N c V> ?ŧ ZIK{ ChA>B{C$QKe 3^S}8?L,N_s $~$QRq :"G5l^
,*k|[]
f9F~GЦ(_TQWIhShԧUd9~ $I2&` vY4D|Ev>o;SS~ ,;
OUaPVdi-K*OEho4x剶҆!DJ ErH%io"mHQw*188BWC>I]p>:<p}G ax 2 (Ig4
ePA}o;hlj)K݇PoG9E
yN2J^Dђ 2ULc
N:T- ƍP# }ß@[m m=7"ꅦՙ?/aoP$*zw z}v#q\R+M_CWK]vy.je45SofOd74.S<99L`P{ɋiv @ktvkiS2QLS4?B`һٍN&F\̌ʨ Iey ?Wzc:GG6AM}&|
lH0&`tnt9 ɇ *9&ύS Z#. 𣏠2#L 3[^[Kg< ;8x `ʈ9(8p*vY4 P1XTwD2CiZ21U0,D(, ap{0D:GiL 7_HC'Zk㳝 EMJ3X ΉY
021<2}tzS->yNI+KcgU;
`[շtr ))T8GwjN}Lo2}n"Wp@u
(0k'W
(e J/Repe eZLS 3!#I&)Ō|sDx `zܖU6 e j&y U8ACƓ?Q:,+{ R& >1@`R*r&geKdZlWfL^L)|YVO# @
bq #&NH's"Va)H破 5 tcmqq:*>%!1S(q 3 ZPMzJIy?)g;[nܚL u"*gS@规Lmі-*TgZ:`tF<D"|:Kk*ARGGǛűqŗ =cּ`ꛙ^{HґLTIϯfU+kfn # !T`njRMzG"M)QL-wUpXJUMsٕ"Ih`=}JkȢٓi;Q&j `@@`HIAHFFo5It}AF= ^^OH 풏+ gidH%}ZTq拦uYeg&Tه[;'aPG狠Eve_@zK=F;r4`2
5
i*>:giTTJ",`2 <C`agKÇҮWB]u&mz 3}Ʋ eIT$0>N`r@$
eWEEh""~498p5x1꽈= I/KtCD$NHU Ίx?p,L%ܗΫ+Nb[(Z"ۧ,ksLee!nôagـP(AvSazɅgQ~vKKܧ`Ӕ mP hv=M-*0y,KbҹvG[L,OV }vm;u}5MA AVpD}׃A˶f[ISAs 4-TupX5P%d;u|4
-;yRUߓ/EEJAcmL-+]?[uho}[
ب 7$^3m"A}'uR #< <),nlᱣHSi|G4 2ޖQxH&`p
$eNa1j0q[)ï\ӆ$Iv'AM;m]$yߚ*wo%:-@I[ Ybo
&T.(l[m' $.iￎhH"U<^=JwGm#DI]<d^ mcq~IkC@̴?c?l1S^PF}a
(b똩fFS*#
^tE}Qm'7lV]*?m>,oC~16 Z_6a
$2M2?"|;g_]ZHڋ,6$mHq? 4"AfEnKmO' áW0Dr%!$}F,J>|4LOKў$ig$aKP_R *v:5B4JD6@f rQc#|9.W`6I >H$
QEkӫTs
QCQ͢_hEsD6dhI63
me{QEX:@s6l$[ɵJ= rqbXqq|vT vS[_&dW d 쓁*aD,hvvwDK"p"hYDN)tARВc3G(aEN-Ьk ֈV*oȽ9ЈHrb{YE_{ ;y_ދuo
JRgc߭wi0'AiS4<g8I'J'u rr6áCwsLb=-zkXgmM AkcFtS DYzoDY%y0sy"a2_0N$*IO N ɓVDaVc"K# !1$fM#v0@e;8ʶy!( !/#EHnOy\ӟh M& Dd_AfZo w` o81*A@AÌ5$(p2
t-}MeHTCj eX3h =IvԈ0D}zj_4*h,m'-=Է=i4ڞ:և"DQjF#ɯ+AT
,?s%$'[㹃f! DszLl|㇏cpL4>S>#AMzR
ٯvE~+uC"c SKw "$ZJw#>Lҕel h$O@[S4p 4[78~ }1}m1C̄x
4
GMnT7 (}(u$#saC#k|NtdE3%V){!
+eP1E% HߓX
?/ 16 DFI߫ 4*}w{B ه~d^g?wp.ۘ_S@>UM@%ʔhk zL6&4DE֛o?iaӎX)檚ȴm?*UFZz%}Fn4-n~m z"(coE-v~>{h%P 'Q Bqk*G n^~T} _]?9 }
XW}";)S9x@w AR$1.PPosbg?iuLjæ{IR ͣTEC%Gl|#[+h]?NLOiQ6z ;LƻzD@O{e+-b.g;j+ o\o#xS{Z-HBJo%ki#8nAg`XSmSm"!Q4-XaoiGx;Lg&
Sl E
+N hFܛLO 4>Yg1UFdQ&!XhV '-wg_PV|C }HC$?%ҏ %wj }D BKl^SͰjR5j߾eRk e?<S$v 8CH y A%;EY|}j<IҪ9Ʊq8>z #$) H7XJW A|+_$"ъ*gt/ ]
/ڵ}#;t ;$ @,WO .]W`II+ dzۦ%Ds*AS NH)6fL6+)/qoKtH=/Q?/%~B|1c<֏qlZ!C9t %϶h_:OPT̴}DDcd>AvG+;>J>hͨW256O!3!{v~_Z~TAp$LQ0~\>DԆ7aͦ|avuwa `2kdoC GԈ D<<C
\ 0#C?)n+m]!Ý NvPGg[^C
3̾H?!e1WAQ8hGVŶY %L?c!6BAջFGĴqC8.AɎP0f{zI:s %&暟?fm$.ns\iwT}. Rc<>dV"h-7ST0]#aߠ>ӣH[m>DpOb}JL?ϗ1mA!BU{3S)*|Y\A4-紺]y}36lߎ |'>xP i{i/h - ])}Qi^1nlK3lyf1JA L}!_'Q _5agد-Cm.T8B X
:ӕ AWaORjJ9#-%6O!K\_"n.!_hAo II{ 賢9'Jm &dW |4.;+v#CSv C4_Nэ8ֻ0bU0yR@B[UHw5Ӱٰw"zHbAjv3ZlҒFCEu7 ZCi<|, '_~!?``ACE"$˩74jYGjn2"4ZfDxҳM14R5jjM`%88*m
;P
*Xy:">!pkC#n/~D# 4\W37#,N@b ]" -4 $ ~\q-pw
t$>H s ޛ[4[_O w7>kĀŚ+ PkH< v2h! (EP#[Ubެi* t786D:|4"-cTl-@o`YLNi}Xi>@ fe[jd_M4V#Yneh_$@gV4 0+ FF0ok py(XP,uxs>G*fΌƆO+pUD\ذeCu8t>V""o*8E|W"? Q_E# ԟ4d<O5bw?~ t>W7vCO``Fb1t`9s~{-?w =|ȼH`ÚCHHSgl\.*#I85U )VpMx OK&H??
"#(msw iշiLT:
+s}^#b#6 =R0`1wӈ'߽'%e~] >R} &!@`kE
կѻMQ <4Ĥ^h};L Ŷ|z'QهHDќ^*9/=J(\wL @P#bDaISd&8ʚf%`?ƛ!Ҭ.UU0 轧&V0MF>7|<LESTL{mU!4g(Y{k=uK4@"iL6k.Hw" A0X۩ġk[WLF2~/:Y;q]SDjt_AK`pp:OnN{࣏wj!/Ԩ<|d;M%W/!#NTIHSDX+m 9r8:G7:>c7*}G;J?F1x9ǿC(u_hVO_Ts}ЮVQ$ArL?nOO?4Ji$QP2vߥ j }`sξ$1 d U@5& W P Ѵ879$ WrUט| *waJ"dywv'iV%G h !3ف V*ك}݇ϟ}cH:x]b0Ϧ@ӄH /7+ϖSNT|x^LiH]w?W1 ɲhkA]S:PISNU
6]PZ<?OY醒!yq?cy6KR'}yg{)0p:o4öAv `g0m)G+f84:g V4@lo~Gk ,`[fN {L*Xcӏѭ)H>K|$Y>tCcd|Ċm~9/wPbέ&|E8i_Ϳgmuz߃c122~k߫= x( GqQw >t=m"1̑lg>H {vSEu$58N >W
noM/bkyHG}l' o!X ۥ GOk"L2Hq5+Xij
FYݡsLDTuLՊ) n5[`S^2~I ѿ2HxĤ? ѹ$}d 7x#:\hZymeZdiӔƩ~ ^a~ϭ he d';LoЦIO"r,=GHNzYNa7m[܂HZ-Xf
,xy.G;/ <~4JߖBZJD4j24-9g2o;\!1<WRT(0vBDH V(C"inKz:G(6Q:yNmCH};%9bdKJ~?KLJi3ũ߶oI @ ZZZ=ܚ*mk+}N'm쿿:XPQSC\ ۷Mcպ%WTwx #O6wBK7
-O Y~ Jϗ
J7< i8kl5DO措bs q7oMk|j,ye,]Vr/-Z{ O>r?vYB'b
]]
~G`TNCmTt$4+:DeC H"IY+k&X`x +`!'j)<,IEA |m54œ#<\mC1).t M D d*ps|:G \ 4T
(|Wm' + `Ej2wf@?l8r` >x0>|(Nz|"VP7p+0 BO#RAS<)5K^BQʟ_Z ϜUq&[0OCgo@)>C`MiW-!i.߳Ft,K`6[Am3355cAt- v /!+{o1a'[D+ h1KsҼf;u<^_Ϟ#@ ufw=+I9a lO<o(FĻz[wwgSktR Icy=4pע %,FZZ
J ._U;w.x1<7m |q<1u x1LzY<SqM7ᅙ c,jCpg-hxُc!Vqi+ 48 3 O51K>)x ]1=3Vs tt$V-E
IS" +1FJXdGxM;wKx_lo$S 3[aﭦɶ @{;)C[wu! !|$ |*$fқI>fA>ex^B L?B =w:O>|oyG`K0}hN$ fI U5*U *jhz^z?(f<,:;IV>Ao 8Mݜh#>+X?+ЩkJwIxi/ P$V2LE RdS-dO#8H $xy<W~LXu$ ~Vb2 6i,vtv< Z
: mWBޗWXq)e ͘[7@2:|7$ vUP~ kϣূ4:A\
\/齳]D:-$h <n8~UV`S,<x>mgSW\[n?,߷_?~D3tׇ`2v(Vh/i+I!8.446ca8w.)NP~LI`=nNed>" LIp䵷 vWe"O4 P R>hEXBߧ5ߌ IR+PՊ>^SgO ;̈T{;~H mE)}]MQP@ ۬>K |DI?AIg GfVkU b {$=-
(@A>RSsOOE_W'># =byWS>ͱ-R'I>j⍼V,S;}
U'G;@cgԣUkA6v$+o|<!Cii. ik[ډhE l (h(DΝ(f|qs ZzI>WC9 6n܈M[v`] _'x
|h臔}%VF7蛲cHj
Hl鏠E0~P`
̜9ϘӧG Ôi'g)cڬp[YӐ&\UKp9 hr6G ꤂V՛[
;1 >_!Om5`2%u٩\3WQӊ2 ׅ?%=dt_WDBkn$aD:"Um'-*X4O^qAE w9Aj샞 u;nc[w y2 c]o 5S, u
m#&`* @T@{ >y]M Qb8ɸD>OG 6 SAYS? N
"N$J}ĉIa|exx}y\6CG|5}TYS g=IU' NB,JξB}L跄Us%_$oO7 @:;mKQus;Nk-z
*hҐ*0>uzh>l6SD@?D)i/[ m`AS2"Fer-#۶0s
Vp8LM`Ou`gg6xex;pl44;1'|?|){]>%d'k We
`jNe97݅ y;9sMÚ˱iJ,[|S {= } w#ṩSH ԧ ߋ6X`'1scxq,̛7U˱{ :](E}n xf RL{*)(Vq<I7s)m=?`@NkӉ };;AD:&y9G8ٷ ؟|X BѤh%hd0hk$&W *pVg*x S |]y#A[F(Y'x}C-APTS`T6ğB}x!#Gq>f^ EEu4kN<_ۚ "g@ee{De顁KzJpk.}qMRy̐bo3/!2`~גSAe $s{:'Q2ihxdG4iSlݿ_cK]w^I4BtFࡃ '?O>#"Is2~<v41|akk:tw/:u*ua`μSV/' S>ǩ=(կ#S0nÌi0 ƺW㉇ <y
>,_4gϮܻ
6A:Xh 4i i A}"X&Iq/nm IO%A
9lrn(kOO R?VnTTNNXD'd$$&3rȦn5:sN3J=xWJ
W5-5*E cu߀o| t8Iy
Ft
HE
iM(AB>xx$Ԣ(?o{
s {
Gy1:$|>FrFd+ Ƚ6j]lJд&.$Í[`=tX9OgKN{6pO)IfpI "i_Km-fф(pf [븦Q5D/ i,DEey6
h%M& I (TnQC.]3
s!t{odžM10\Y_^9sH6RGppA
ϟ ??mk3s6wgLh]mg5e08M
ؾ~
:i>C^_a QQ濄g {Q;QLvۭ&8sskq*Ly~LO}CxqKxqZ-ؽ{3*+wrME_G2J` H
*`@ kdv6A,#R:i*~_A nd
fg$xt[:$}11HgW #(Acee"u[/}, "1HEݏ Ǎ7܄oMgE$YݢU1c?ٗ8\_, t9D O'o_[h(>eʨDKsm76@ *sGzd+o AZq)A
w|8=سi <A{6+N]h/jԝUl_ytI $ m +@@]7
¿<}LAa e
dYl]Y Ho(hh>1`8e aX'&w%Pj=?~
رv!<~kyEqx(^?NOg#~ HtIX(\rq8g |!@08I"XY?#cBÇ3^>[x*x2<S(1==܇{MyOO
q3yTکg#g\6b+K(y)xvӸ11o
ݲ*Q\JW96Y{V $#}Y~V@[tLE&o}MWȫ;]K:~By0g 7v
xh5V8i\izyz+A}ZMO[jLcPUM&a ō7ހo; -
CH!~ *D~Ǻᣮk*^u" q*{-<(`Dvv`+a8)LW@ skE@35~ 1ձ G;pxN0 ߖBnuK5bv- i FK~QC V GadDi/ > FF~-
طؗEW-!FZ!D h*(m ` bm E4e~pvPUYle/aS.cpp}
(}Έ2942 5L+K apBmGeNRY7FMC5X4y̚4 įo z;r&7_zոksӍ7f 7&u'M}[ ^7 3{NGs4VnEc8jvPwttToZsՐW|aru]0PYRm]ٷ &\])ѵk̛$Gjt]qjDZUA0
QEw'(;#ZDȅ' ~WFxB) ~d ɳZ@L44F~:&-ECGyZ! ]$< p;c>&ao[$@, MjU
J֭;w t
T67Sϒj*,ЈRO
;Yt=S{0#S-G?yk0rkOQ:
+-YIr{+Fx O~^FbH$q]4()vۏ 0EO`Xb &Ǿ!t&ht"X0J$u5
qSfȞAh[ס s_~t&&<7c'axfSgW7__*pu\w͵Kqgse_le]~t6n:<9a)\2kT 15e"4]pDz`|B*PgVɹox"UҙNn0(tTk{ Kzh$\Iu֖l]2mU
R7
(PD L4 H2~:qO8v 5lnyt8"h<NxCI/AD 73H4
/ejZ(@'! <Fgio@ xtI (x`l u`@%Ȩi~ǪNL`
Sss&oلv@{$s$cfs # &#$Y'H'=X7CҢ 0>!#F:_d+jHH,h_4<v6@ TX͈y f|, V:k1{si|TwmB tlƮ=՛Ţ3)3jlܸLJ1><Nǿ}^UZƓ*Uf]~ڡ]3q/n&̞g~?
qo矇o|rYgw 2\I+nE_{- yAG yӞ}@3j,GS.FT!b%p8Ih4ZM@I*hh6
8
gqz)ϗqR&KQE .nK-;.+خ :ADn 1(}Fټ/u@ P+x,Ⱦf>u7hj ̥#[o|Hh'pϯ A hGg|_z걟>Uc5G]'|%bڡv qp_;8 Il_S!uJO|9unRA_+ op1?Ⱦ;1ُ]Y7t#!!h1D?0ўwYZ L~\vMAkޛ+m籁 ,0ۓBl q
Ky\7I2(p ? AuZ8
<hBm
$ޚ+Qhm0A$9TUQ(V*T\ ⳅ_ĊWc劕ش~-@ Hh _0u,JU.wHMq3u܃P{*#1%8p-Sg͡?g[qM7oÏ> _pϮ/<l\.Wr\@|p5?Ã>r,X0>(hlEhU, bwFMzt H} 5Ud~NF8t
}@zfs
/QРD$Fp|Nx~|;s=h !m j^Hi prʆ~$k߆ʹnׅ/@/Ƚǹ<m1Z3u[!@J^ ?/gv<VS12
*Dįh^w6C 9܁#" !^("2ܦwR<'h =Ux}Oz J
;kv ?*FԻq G0ۆԉQmF_~q]-nݏSW@ @!1bj1cFZaJY~n C+ۺ$;vжD,N ZR#_Hhò1+P `4NyvzBMU_GJQ
MBڐ,6Ŷ_ ,PQT&ނAGAF=BYEM{vE!Ԁ߽y |;\)JdF{}ECR-tnp 6(oP1(5wogcF1ml\tx)Xrc8> { ?Hz'p]w? y Naʓ᥅+x*8]^lپ Sg>G dM{ѸwjvoGiF;S!
#B`2&H# }NC"-t֮>?
*u; Jm23t)N#0tR}<*LsqMn wU$=)4("Z J'$evPx)G |h+{MˮGusN?#Ț@m%YF$
\k
D8R #kЕā!al[,l dp9"& @c$pP@jo݁ 6b+)lZ c|
(k.˱m*l[{6nAݨE3w0&9Qoɩ@ƩcZblyF~x Ry6ò0otl+f t^Ϛ}M; ѻt:ChD eh xN ,(\IWRjPw L-**QW_ ć ~[ݦ bdېPiW ZSfH,W4%s_: _Ãw۶ sG ?
=5W]~9ٵ4̟ |b*fϚ7ciX~ j 5 S+/D"DhoXW`:zHgOL;+8gFd5 fFUFKn(+Xڛ ZA :걃芑ALE~<|:h ekLY `JL2 =^f)/EEypk_:"8
p
$I{4e?킗@BW5r*yL3! 0 Ǐ `f Iv5J!H7xfT^KS1:Aw =*zތʱnn_K 3^ߎn g<=i=$
My3xK,y˰ضa;67#LRVAkTӀ"m5C%I˒k3EkK{ eiE ύN^
>s:|q[Ό|f Y?kdSɮ5@b[{?vEӏ B;t7sx:nkE2ڋB6wVaO%ًڪ ?'} 2?ƨf=nM5ZLj&I܅-7~ <6oچysS yufMj^sڊ7o>?7 x!<S3%lذg<U//};g Oݯ"Dͨؽظn1
B:@BC&O}-TYe|0Z7?@ xezoMߖw7'P }ot2y ~SI:n-`CoA vC]eiHMP(Y6 Q p/W53B07#MR̪^HΈPR?AHN>~
ĭA;1Z-C0B*ڃ$ߕF?&IJV@jxtw $Cuvcxyt6!ټhsbO`OcʃaO`ҟLÂ9 uؾvLU44R#a
Dk0<6R#<GA|e1x)ذy6mSBA6bwym$}Uc;2u@/l\HI 4 {V
5eP{v ~;|Jϑj~{}:B +uVE
ؼ߱kc`*g|O6o߸ ^x Orx ww >,.R\q%x&외7wG SO=a*nܸa&6oކ u6<z5 m܆ekzB4*lDM5~CV=>wnmU$v%9}e% M qz2
hP@CfU+e(`e5Ad(ߏ˾Xs~#S%
DfU'ΒybIڃ }$O`Gnf|_E4C!/ :wخ^kK7/$9|n~MJn\Xgj~?5 d}60mEv"J/?N5W6oٍ+7cK`y7\fL O>> i<99,u~-ٌM/6L]$L+# О#bd~IbwR| #K66rdh
#V.3333 NJ5x<
P'nSvP878֖A SB/zFQY N(1\ee5 WB, `F5#ـ/F"ȇlp{PcV ټ >߽G@i#IT[h e}T+54ܳw`;f͛v=^|~>6Yet- /̥qI[[.]V`=c{n,ZFе[b.Uؼ}/b$]n .)!ÈQ{'
ԗPG$}E4!( 8TʯR:)VJ49q&4gs*Y B5M@
N}; ࣳwp$IM/¦QEoF^EsL1CŏT鋡D澑d{|!R!<Av(6Nbe$E>btu~D<Fhph4#|`7(Xނ H)J)6|""
4ȹ'm}lxix0{0'#?'z^w+:|%Gsϻ7R\~+~x6.;g~yG0KغipJ֒t&SHW U}cUXx|Bsx
;Ɯ/%W. yvlc(jީ.
ZX;(Cm$1h;iFt06r|mDuC쀭"!Q"hۏM6|խ >;?O>xTdD+n &]L UX$15҉mظH?` H7mہ+VbK b
3k&mق뮻
<?%3f%Vcuqb }w5eE^3jtfV ;}
mٌn>k+x<->*n2l,
븏UC4Z,eFR,"@j6:G߶tޗ%C(ÐnE$
L(R[&=4B Iғޑ h* O([DKf9B$x
`9:ۿde3)}
{×U_ǡW\.eݨ iۊH79Fc3웚A}0CQ[]Ix04ɦciUJ
(q
{ J\y5+pww܋k7^ .<xwoq?|?W+|_W['YsdhSSr b (*
5bP%f:5h ўj9/:o2ZWT`FU D.+ 5,tP!jȶ;ia
5s(~D m! *h®]QW{#7؆IE*+Ƞ?N JHR*"'dPfFlڂm3^|a ~ Ķmv&,:?K_ߌowSlمEc/b%9X*j* xn|k7D{[ ^/xx#^-qd"2kyRڶ]=j_ x>M*C+ Y D6YUS@ڸNmÑcﲽ\^|ɿk^+``
|Q]h
~M
ߛA 궇B
&Ux4IW 1{foW# 0B5uO R
y
!#{OeR >f~}o(Ab*#1@:Q (QOP 1~&N 1T+xee
=
D0F@KV .#SoWzos>B\J__~3_ǯoo7_Wue|ﾆo>=g-@0J~4MEE25i$ĺ Qlp\:jET~ }MqwA:~~5صwU*. 9߁z
b<Il!QJ[ s]ߣML r8=kiu?_jaIdy ?Cu}<nl][ף> ;}
+4# $N@/g?&o;؏<=^ih`
2ggG V.^_y/ṙxvIt=wSWcWXh\N ~f46;+aVƂQxv:n6o VVoǚuKsFtuoY4E\8rpQAsnHEIIR$wi I}VH-]E {~F7?k_E4Cq!(AY VNehgxO#e:jy/$ة!{/ M u" Aoo/oIЋ{p8~ 2hn_}A[-9QV\RP4G # 1bOWيN :\8z ~tQbջj BuDFAVHKHt0.y_^}-~k_W7ng[#|~Ws{9?/K?o|~ f?FDB IDAT>4|s8$AϭA>gQ5="L' c`Vozt# \J2BmwțO28w.o2ݯk.eD"EܤhKB2E$H ;w8uv_;*L ~?A (`dWmf0Ŷ_ ,s OS+m+аg%;#cxݷH$i(5* '7ZV7Q/ުjTW`+)O=_kXmĊk`2%x饅EXt5nNw~Wn px漀g};L[yG%6Dy1pfN}h=2 {IjB+rKM舴;ঈ[T<E'?~sE"-vtd _#tܜO`F 8_`@hDv̉8n! `]HR%S4-)yt T\l><C8˱p\C`TekvD*OH'8:KM"اStJ۰=9/Ň> (rnP$Ċʋ[\8Ȟ(z3 }Xb B|cސ r&8gϦhB3&O nz?n¬ /g=={Ttz V Df L%?FԾi$.W]U. wpesQp(hKwwc l *N!SJarLyQ\{eW8bHwj,
Hrt$'6Ş]+hX5RH)T4&pR4=i۞*4ijNum5jk _ށˮldž;|u˘Gݟ71fUK sز}/6p,|y5͘'wXvƅ%`:ۀ^
<͝Fܽ;wMщ>y<f 7w,if{:uxw]OGY fߣ6Sx,JAksi0" ؓh _``BZ$
o =U
`jejb!U cL T0('d8. ;*,!_"{ѱFpy <&2
f=ɶ ͩm%I
]f04 mdĢfGPL7 !(\ n/"*j[@vA)$$"C0}boY
=]?*(G#/("X0Y1><g `
!d?> kVo3WiM@@)FϩH5ETJ&!U`hP5D߷lE#eW .7ϸꪋq揾o_|$jO+G+l%bx;a~>IM+}/Rg;}}e6HҴafy&lظ ;AMOÏO^g%"4F$ZF]MT $jCuu v}]mbXIҿ`
̛ ^Z9n.wly6E+H&g,`͆Sá,> ?5 gQ[
*t1= }COlIִ!-فD鼗!1v65,
&Q?c4Ql;Zϧދ ܳ_ijWB|P h?<4Ia1 PI:]#ԃ}Mei/
>u(tD3e?O \G-(];1DwםH}GSߕ*0DٶYtu(fL0TbzϗHo$kUvd^=sR|(P;q5 b_kd^a(mAL=_q
-]88~1چGN`_8Ϙn>xzG0<"I+q66فR?Fs}?GͶWٞͮ02?Ld{Ze%Hۧ)X¿Z&簃(%B?f_R- ~r!7q.|7t
qN's
GJaNp{~ 86bMv?ƶ'a[~;~IR~ۇB7}j&kDG3vn^=[мw+; }b6dАH mb[hӚ#Y #&Aٵ۷>^ vl\g%m\ /ŋҼyI̶ev\zxy&]^ZYflW5V܂j {c
[|m<4}B˵ 廰c&T* =<=pn#;LR>
" csI#') hNl _{`"/ "꺃
ȿ >P0 n<ǴJI
K(;YY NoMP&͞
mq2|x@X0LrrQ<sN8xwC.CC$1%gP!W 8 bk0ahdK_Vvz^l«=^EPfߡ~hJR2F"6K?? Hs1̜".
6dk! #86F;xgBr Q '/ص ||[¦
ٟ06v </D e5Bn< %{O6BE$S*ƨ)uqI- =z E1h
l\te%W^3/>nZ̚=ľ>(0wG=f
;vhh_[G@y֭p뭷[:s?Yl;`
w'Q!n: w@y>y} {&l4SE[ !p,P+ )/k )JB β2lX2t-3Xj=݄֯+aWxr4w]oc<7`k1kLXnI6lۀmeBࢁYFsxgPHӚG!ռ|x -dҤ7jI>3V|3OcmE:n2,(mFΪZR5}˭ (A;) mH88ǜk?q ]C "*N
JemqVߵ|{eZγ0 ۍF'ɋ sο rPE@I:iq8M`3s4oh/0h
lTfoS%zte=a[s uVSZ4:x ' fs9F)<O 7Lӣ CK:
W}55[ۺe2I CwV4W^Z`TdV 櫛
>u@bpr_WDp~|p?ͿO<u?kށއ Hᖆw
,l ?
F/c spA9sv}-QWAsO$H B-a5OهhiM,*D DJCX;|F`B< =9Ta^n3F,\ /.O^ wb:ܰ=<zIl!aXl#jQь
71UGGaƳ3p~6) UUjNi)گ 4.:Ht$~> z즃t_n wӱh eZ;E8[LjGJMk%p*,/"$e?
*(0,=IRPTP ۱ ~]AV[I"T_r^Y2^?q0'Aas
W
|e2y3}%ʠ0ξA[{7u tUn*!G}o "袳ˢj:t8r@/w;i5KGϚ,}h}N2=hjSLhk\$v:x}Q_,$> e3')8v'eyV+XMɗ®j߱ff8 O)P35~NvM%4"{@QA ]Eۄk~q9!)nO1)ع hҤm 4Rf5yS,HRxqֹg | 'o/tzi'i? Y4w}r.[I]ڀOx >
4ۈ$ ۯB\z 4ne+U 7*ۋKځ l<H_zvr3/\K_T5ݿv.ڎ\ ?5ql!߀=U.t5FF]G_i/;F?To@0腧
7c)+GseS N^>p4oX œ [(>b x[)}e<e'*#GYPp|N$QoiV&t?L ДFgm#2g8|I+QU+VP_yoPKyJf;Sdy6Q? d%ыh>~ۘ}mD{"ǾUt?Ql<a4g DE|W"Z b7Bˏ
i1msHX9|y7БJ╹s?KHӗ)ED=F?EkW&wcU\J
7JAB oh y5nG(Jyv(B\ &=^\s
~|98 K>0vW!3+X@C\!{0f*K
N{t 9-M ⬳~s;봺 do F /x]ؽyvoj; ӷEdFX55Ci׃$CğA4me>G;*+jIW ~xjʣؾi6]// b܍s>Oy`#vK,O?1 I%]N]wcJlݼM80~3?_+tw7S>wVUY}Qxa+ ! rKr
rzc~[iGR:۞>~ƟUB/I=hzC4 YS}<> 4@"aGi W? G$YSꊇ2絨C 7oy
=KV-e /kVӮ.¡CibzS-_
-[f}9A\Cc$I+}E#S/<N Sh )⪝mWh7 tA#c3E
m<E'?9GQ.mIN,;ɒ~q|Gh{_BܘȄ
d{IKy3Ρ~`ɒż8}5'D r[ MK4Ŭ䆊5 {^y8߿(ԧڑ~CAB?Mig -
7J!λl\|ȔP^diG\P Ia dH^jNib0J SO=>dgv)ړ0p4\رM{W!څ_o ﾉ$x"9 Ƅ ضJ .pffx˗.$`9V.Za&X %?eR, ӞEp7MJ 6N-;˱uG9*j p,Y?3T =m4a
44߁\Hqo'N"`t{(Ra !h'S.)KUJ|?f׳D?Xk]ZU1[D(T|,De'ܧ0kØ=w*,x-`/A
N8`3O 5;&8hʝDDR2Q"J)Q$8HК*#9<,Pq+z_Un7d^ -]^ky.mQG0 ^L`iMؽk3Z3~ v 4Ty[S*H+j\fΟ9 ple*S wsVoYOL`]}FZeeXǔ0k\\rE q> Uۮ :߲ޕ-)hc=p(Cn"ԼgEfv(0]t쀭n>4b44n=n صy
*v-yxA7,ĘsntrMt|_s7U44G
ٸq }lݲ g|4[q\Vm+R_ܗcێj|nVj~q) 2 /[njOe36nnD$Ţnmp U{ᬩ 4Ԡ9aD)BOSuD '{F 'e it!@Ԩr Df6=L%:9 {`'C奝@+!{8ɉ4\]8 $$ްLd5Jrr`ꌧ'G0cS>I,\^=<6PN؉Ύ.̞"_FyuIMۡH(҈Iv@T Q)Una_#Q@d 9B'F`KT[ Ik9C|vOMgҨ#
^-`e4N7no
g29X,^f&A ?ԨIŢV #JҠ"7U~w8C&(<dw0?]$
ƈ57^ w?V]iL Bd"%z +-\qY-?
7_M;"U-Q= N*.-k"'O$Sؽ{7_r酸 N!W
#FOଯ+- 7OٯE.n.8A4?7fzPxI l&Iwvs'V̾v]9]euis|&lZm;"?ص /FT0TT9YOP[44wK~/: M{Q_oC[. 6+$V+R$"i7]AfQC\G"|L=b?=Ppd1CA G}E9
)3+@=V#JT@eIENIX866i̜5OO}3hO{GO;y$bms?װ\swPn[kNLt T};s?uo0I\Z@Fb1 m|L};.hMz0$4X.CQIU?s/Z-7# <()H{J(ʈP Np>?:
ma)fo* f W_܌K.~ 7+P:"
YE' 73N|: ]c( RM^;t}/k}4`2 HVEKט顛;Hbfگᢋ.W\|Z جՔhxw+۶ц]OG+3kG>ԇ\D,:IQ&1F[;BrGN@mE D6>FiV\A_n1o<,Z[l7-Xd{vWaWOXW%++*9MĿQbyvt
M$\B0Bה`5n|+@bV/L_,v G?ko̧w
<LdzI5H@%¦v*o&կ.L/$niy;,} s3
bV;~US`OUn s |K
8-Ͳ#Ȧhf_Qک0
{ s/ES=#_( Mcuu?Ñ}}(Dg߈ۑP_!
$ԏ1P}<N[jX:ÎmS\E-Lk~m !w濂 [Pb:y dRIbl.BK.x#J hC ع6X FUmZ\v[~tlKXxEڄAKJh OD^Wf,9R'UxǗ73l߾e#|G!Qt 1Z4`CkU6mڊr
B:ME~uV<ڕLb,p
] 96H,!ir9Qk
P'';o"H3
*[
Q Ʉ"~::o4-eMj
,gnĖիn!a4WƲe12e&Ǘ^^%~vMXx zf&VQQ5ز ;vW`]f R.?[SFG&b>g-*wnN\mfTJ$Y#C$,
djR'#rU`\ k^
uQ<:nBMpRn 7 C#4-<Z <Jb7Ń6^:{n_ Ѐ! *QӇt,s˯|&a_8 ` Tm3iҁJ4I$I7UnmS1R z>YȚ&"-`MOo )*Xg)hs;QW]կ,KZ| p3rSa kqW yKAOY~6xxqO~ { X0 N3`2Lfm <Ϝ)sqEď!~Jpm7_"b)ϸx0ƺeQ*+Ԍ4CDϾ5x{p5+>o8l֔HD]iGr`bjԗ/GнxQUL#Y!`̌:ktMNg{ʪHh|jwa 0g38oQWVVa
{,[/B 6X@x*]
wTbux'm^([ߩ22[~qƆ
gc%vm]ƚ]hIڷGC(&tnYtI:8!F0!SƐ6XٞzJ{!DQFKIRڲGRe
wڞ&W0j&q x4$R.5Z-yͮ Af<x0q篮#0rv IB:ZȂ/o dZx؆짾$tzM Zl6{!Fm]$tpGQmAT$ߩt]H$mN[:Q@:O Q
dgYSвY
N4j9/V` a$RMFvGg 5uBy@@}Im Ԛ[%dyxΙxgI84g> lk #)E i4Eݜ;w pΏy|^]g?5ѾsNjwh^C(I°6SQ&t0 l9n\}KNU[x?tdr1w-ʷ/C՞uP^*ϭ%v L~b$r SMsFׯ^ysf;gTźU(jFL߾yAEϥXv+U9zw#ضe^zq1i`ӆ $ $Ne8D~}|_MMسi#5 C:FM$nSd3h%*rJM_+$*g /(Nꫂ]%-y_'IZeր \{6"(tj$o/uID[)@S O+(
^1KZ[6GOޏ=zY1
xu?
Y3@}n-җ[ i
>zl>߅j Pba#/7*I.}C=I xu⡰5$
[Z#ED($'UC<՝})[#6iN&JEUVF] ȓY3 #vH=zzu,&-
&woW _ڗ3Hݟ
f[ qDʐx,g$]Y?E?.~vOpecմ!d+;X %umF KOWQN2 bo|]
TnZJU=o1@_
=${$K} dvB6>kj'Q݉VbweXv
\k`WWKy֯=-| ú
1RVw?> KB]رc'vD*2%z- 6zN,S6bmkֳO%~ͷE?k?"R6D f+} k
quAV<TASE Yebt`qhrG!L<ҁO B<_Jg؏rOt7\N[R@ܳO <k<7v5Xz!: >2NͱPUU%Koɷ^ALƨ^b$; ^N#S mcm ڑ(F4BnOZ'Вn>b $|})네7 %)d4Ea֤L=fyO(2O457e
˫%gS.Fs}߈lʃb>L2D`(45#cè%Vv!C?Tx$Ȳ?ӞkZq}w 7 xgj' -[dxr@]&8p+<^]X~ pE?2Y
;jg( 6똲
"xȍ;a۷`owr\ub4nZS.g]l]u;WU j|ư { 2xkj8v n=囐dUlDz3D͖Wq"/Fn3E/ޏ~unuI&+(
V4,^秿E$
o"Pz= /aͲUBy:lZ[7nF=Xr f<8 :IHPH\!/r ?l_mk{b^ʰ`ǵɫH"K㡑 똄NN
Ŏož1_m$<ߤ
$}2_)z ը@_ N ;B1#.F_lu<A୮jxW+q]?3I10GJÖ6L"s+~,AG0HJ #Y!(%*R Z%vl!s֜<M"\ BQA<<^>WV^piڂNl`OU- OO_Gו٣hRU̖dY,bff,fɲ, bffY̌-3e\IQ*`t:t~7}ɸyc?Ocqｾ99^[)瑗M1S\*&2^s
XP-
w7 td"BDKt7bb[L)8E[8&I|b-hpD4m`i`g\Hտ 8 &D_@A61@}W"V7CQP iT
$P\ikg( 0Skb@i&:
蹥
LO/alt"
LͬPg b!s%# ~>=W&_%~D`}X>o~-FʱR5`:5x:&ؔ\Ld2ޟۀtX Ae~ *
Q_D / ^VbCHj.AEy ŕpu@fzRRQ[fb(+.ar]DUE#M Q7
RX,wL:f\Gw gR )Y] RuXnJII_|(ųX$%
"D 2Q6i:1U,Lέ_xO^0251qXr] ^=LLc(#E ,P_ ~gx!nQNOçeRfW$===9~U3ѯ^HImccO<cT<,xU:1X0?3yy0O?~"m#29Ox>& q~1Ea6*@#
By}hNǟ C Čl'<B +7_*y6.}Rq;WwZ9BU[_*NqnN G EmYYT`f~app_w' od\АxO?ţؓZjiF>'Z\EkŕPCc ; S-*J !!9^ߠp%r-ib^\ɠIXg,)LXg?"3_Y < ^ |]SgG ͛ ~/iF[+DULp|
XR,Ugbw L^LK!Pv.ͅXhG}E< -J>ZF5MBEQ**r|2 *4c_W< gYq5*؈}g;d(+,Ek#yBZ4OcQ7W7x}z 5nýkKxc.<. GyecwCs6}sC̤E&0M}(O|s9Y6_38"*`!cBhq+WĈ(*afhrz& cÿc:J/\'>;)#h
ț )]PSO}$Q'戜2R
9+r*jPwRLUR>x Ӣx
4Pcr 14?9_³gXXWٗފ: K+wxE(X\
@Uug/ЈFpH.\Eju]r&rH+@s]-ΝF_g;_'̬p\ *j8 7GwF twu81}|q]#$,ζ00Eq6>F44"
Wr>
bU(n y}lh`#`dpz:`mq! Eg_u1-f]'"s4Ye$[,E"occp:{᯿F,6t/Oo:b,4`*/1P6bKޯÍ ײoj
hG'rr,jjؽo7
ׅeGRr
.]JdH|_W_ʪxϢxB,x&
|\(f(BuE&Azzyn6vhƞ172SJU<Op./6iĒG|2'yc K2Q9DB_`b]K711sh㰭WZ
~}Mr34מ82L9uk +sEo` }!sSi&$\&n CzZ6gDziU44_Ws6
=~ /4,ok!}l 'wf;G6g.2cn\Ur@Scji .g`bd S~a>KbOICjj S o qB+<Kv
qi:LMMhk荆҅;qkbDZv|w4 ..V($=R1c`}-X_zok+b CMb oM yXi"4
҅kbX -
2j5iQVx!`aaN :w,}<`ai { =X9ԁk#LF_n<z/5%<!woE_VZH;t? a%z š@EOLV%)%
p[\HUU oe*@
BzZ
t عR5l͕XT]QgΠ022/_ƅ$7yi[email protected]>&wօ@ @+o_G+ww7I"5h({dFN/ ;!IMƕ$ԧ'&":j1;$ uhfV1\6O@mޗw l)~p Wh (ZE݀vi;͏>/Xuh|(d(]_XzIU~1.\
p6%]idzItFfH*fLSbjzInA9"gp ֯] ]!3L⊃ַ!x Jl
=1Ia0E"/ ] :gV181t"# U$Yk>
E~X/8 &qc4<4R`7&I5 4K$
2r`nk??gx{#*%farILQh~7` F{+B}
;-#{\*4SC,
Cyq6hŴrQPR~w|mtdw$2::u
ML/M)wxPXZ|sx"XIOIǥ @ƹ\7Tb3?ɧf0)4 e1^sFI#;Vg1?@iY'R䬃]1K*o4e945ҀAVZ UطMDri\_&"?3)){ҥA,PtgӸb )jl,nS0Q<[?"-l,JSHs 4UuI$4;Q T,9J➠kFLK68x>@s>EC%dI{ W7n?_}5^.V("64ի4*61'^+ycS |< n
mX0r4>9n^[`:گ?AbRo߇ܢRܺ SRSSSGqiOfdK\{- i)Y0A֫1KQ0$W䇇4lqeqm tl:Fa;Qԁq$<6N3@[@AхIv+znR}XĹ8wx~['iJi& VbR<
$/YZh
/C~'a((#` /f}" }> >MT|2KC'Z"<WaQ1PRRy9sSMj!**KhXzA.32FX&Al_,ϗNIdlCBq> ΰ0Wg}@@쟏AJ|2[17PO#|Χ~(<Q}'u ꈛ=?1N#3gi$OCĹa?)X'ש!R<nEҀA=
\QG_M>硩NF1qp?fP,de#+#94#d{_@{-\T
'}p6 R<H= b 01ɳ?ۢF:FG_+Dm QCG\Pf2D~XRcMq_lM&_-Jx6@NN>/~wo8~~}M0 1Ԍ"x'`i_'?9^_@':Z5ݗc>Qp~e&}b; J 2?zF~q|}G/ߡ^f>VGc\]>N|Tl~r
]L/ܡVX$7\Õ+}hIhhh'w|7-fL1jö.<w} 7oç/wpG`ܣؼQDߡfZ!'ۂ*x keU4YsO@J6qe(*!6.T~TL
!:J؟b`_X~?!ֲb
,o~Q 19Ȉ3PQV e )@T֔v<
1AlQ*
=b ū]b܊4薨Cw -lPMtX(<b+S{+8+iY >Kl&ce؉?? 'H
EZ+J=n|ɫ DwY RlQFEf
K 8h( ť 7PUST5W%P^.fV}(LODIY
Ҁ dgsK]R>̼Tdcdrx ~fr
q*uh' U F#& iϠ$# yJz. 蓖/\g }]e>~ϱF_X`liB֞bgy&rC$t =
:ُ@Ky_}1~ͷx{d]'o,1lՇFpZ*Jrj gӈZYρ2?qs# RgArܻw#Fff1:)f8y鋗%jU<fxE8
+s`9:Hx =o> f 13I ybdzՍ+
he3$V{ WEE9z{:};}9?Ϟ~óSjqzb̓X^^e/ y^.&Wط7Aheĝ sCX
R[X' R]]>C'R;'HfoE#fŲ%CC]
'CWGzzA-X˭@<_c ayA,[}æ9<g1SZhSpgr(=| ,k FdN S坃Pn[BTuz 6Fouom'g8DY ?4^ܾWx #=)HRiiωhx -.I bB^["+y要Y `s :j x[ #.4"Oxy |t$ ][;0=҇zbqrWG1?ޅRz .溈 pC!-l<+dz" Ù ODy3(-GQ!vbt }4+ ݚy1hqMQOT"tRKbmݷKQ}ST#s}=H$VU"R8 j/`pE<|X$5ҳIs vP8w3W-9Wi. !
!Ny[ c8oW>HĶyX W2}rCJb@LZ*YiOyikǑ% hWWLcVXR>_ΩźcQX!Lk0S|UOo3tu͓}WST0sD|\,<<d3$`u88i3go52 qA&
ROstJ/ܝiGu5CmM95 M
y+V3 C[k'jzSMNQL/gh oGki|ɜ rJ[.4-ϯ =jk˟?B?
c| .!) ѝHO>x?Kǯf!=COU6"aoa
C1ގIf=i@Aa^ 2sY8rHmMM1AmPGT0c `[ =} :Мd]\ՅAL6 fFf88i3Ά8福nq1FNV&p07DT7ӐJS1=61X@7ܳ?f5uH+ 㳛Ҵr1q
K7 {-lb7' cO~M:)FD\3&ipWh,i<<ݤy>.ETG(W?zISV,=yg.BVFEE(jՂ+x.4h ?y_,c8)MۋuL/Wҥ%Lգ[x|{FCp :Nx 9nW:hHh0x b+5 bsd
K9g2'H x{ȯ
%.100>"gz 47|߂wWTjg4r09[``8A ZrS<Ely 6n\_xC -bGl{(@X.
:y G堥{Ƒ q}8.N4Q@\}&kV2l
-N"7PP'w<faRu1 ?~F5{,.s"<s؎Ybnw;| f2O2ۘÉ
~Sy!l4E墋t3 ͡ {}]49R+-)(Fff.
p:,dȠ Y0َShh7jKrp&gbNSҖ9 =>| |ӊ|t5Ր7:qؿ2ɑ+2-3SShl7Ni IYW}D:#lnnO+ ؛!,ch<riK蒸,L%A&XR`dc f)*ZǏ11 =xyO?|O>}W[-|<M$2El<O
p9!f0P?(wy^&9?={\
JJQ`%ɓ 4[P /^7_/곈b`؟x]M-x15|!ln03o/ gboqL?W#3sk^ZC$o ~\# _%iz{0RmץmEvbw=YwgyØE\Su",lbdtE
{{s;BSK:j8, e` J _\" [4 ~qxvϋZyu8ٻ@S;gK=X3zuԛiB6E-G4oK|L\A췶=.?>@3yؿ%Yj9
cE_xgr A/
e.Ek[ fG>׀??;b?$ 3ȉĿ|=q$ᔓ5Lea.|D
T厢97>"e"77bK܂|$"!a8"sHMn\_C: 5bnUE9HA
qinncCd_xJ[v #cؼ1O8;Ḇ/|,O:s%h#ҧ1\LQw/ad_/{K[-ź5QK-s_9M |&|>A(?g ~kϰ18Mܬ3e}<EDjɻnsŗ_⋈K 9Ϟ!<,d啑E&~竍u[%/}1$;wIbD;"Omn &;M<:^= u1m E,jnj)<Vg6x Cd|ؕ)3+ݭ4+ďL9n"\^b=OOACnάy>{ Po,cCRM=D9 vP8 CY Uڎ s^*5U0oJ- $wQ*0/$w d-;KՖmE&O M#S-,Y 4 <$]kVCz^gzl} ۰˷
oXutn0GcU9ƻxmP34&hx\.G8 tQt-sG?!$Zm
9l-mAq'af!--% i9C>I`'dgRR
3V鶯>y 5l '^ntuƥ1xy{F:XY:̍xᦘF]H M䉪$O b&M)>$2̵`w(6Me8 1g 0Iܐd}O3|_\ _@Mc;&olC hlݸML/09Gj Fynn ). A[C%ct ~4eQsnф!#- iQX &`Y"1)AWw'4f& 5&U*^w @Qu{./L"p6S~@H@}iJ 84ydb eΞ>,|]Gv~bXT'^Ƃx X~1M#-o Nu-qɌSk EcM#jʫփ6tu5b '1 15wC*y.# G%?_;@46L,#1|_h%KM V161 abzҠ $w 8sl| յ)(%]`D$P\H>IqHMʦVJ,cbzAKh2^32҅?ؗw*{^3,SC8gVԷa7li4`m"b;ݿ} Ok&yPܳaF hJi3BrODƥ% |4%.;
-!Zꑑx 9QW+9@89OhJ
6p)w|WmT<&~,LtDQ(2]]G̏@
f*` JpB9
C MHے7NLKWVG 3#sG߭Q^ ^R\eh[$qlu
Jq/
X4Ť1G<_ibT5y:#]
U uUI;Q>x>D'21J1VdE P`Wf0<2?4+R[4-7Yh ǣ'ɁXX'/ ~3OI['0:+/9LMI)K,vn LHK17QjfATvfAF )"ꪫP^TNt6U Rx]:F̂(/y
nATTEؕaXq1|yr>'C`VY^vn!b'011syŕX_iID9' Q Eshؚ]\wlx&6aj`WcNI3L ) !Zd@W[)K1 jP7 m=R ys|9~Oft (߇PW]LT 6\`_\A?^ttOmjyXZXȺK AJRQd%E3YF&yv1<]G/Y%03օO617ىh}CC}h("= q<{
E
3]0U9'}uxZ"V&
N8_tu}ffK3:mb:f7`T<s2rpKtN1.K}:<Џ
vܾϜg|sb&3ڙSSrL1MEI{X:Bt k/l;bN{8 ~G)#%2&'r"xcBS|>X*l*5 |X؟Q|Qb|FM>xG~wfW:̯7iΗRUӼO|Iqb:1EL bwybp]= (/)Ao{ S5 ЌZKQWԌ i`@"G֟ gbhZwGxD0ǡBZK>OŠ+0 nRmHV7 `q>9A,UxHle w]5yEncSWQXZT=h<B#xwtLtPx0bpE:#>M絥[ O7Q?ž]1 <yЪG0_z鯟c vP1> `o&J?ď]x = YP= N1WpC):HIL͟Ԍtd墤
025ƥ gD4W"4cJ 1$ܜ젮FMnf? /yʂ~>%Y#QYE/3{
jy
z8*˧}њ{eq?Pp8kRc`s\^8} JHOTᗿ-&f7n _naxS05<GGYwB$ 9-ynf,Q/QN]̨)focv:fkJc?DJ KDr@oK5ΝGMCN'DT\ >x S<KV#]<O
<Yb_솶"0 &<{iy&ܾ s|Ͻy\͐/Í|=s$K11;" \^QܓωE!^|9u`b[0yr%֖Ӎbjn 5:<yw>e%yGOK0?w6%=Aum.
k)/C^N
2CWS{Xg>_[_o-ؠ_!S ӿ"
,`_Z "/ *r2Q> WK%0,uʲt8{T099 C4 y\NWg&p}U<zfY %@~w h(+Hg ,2M)J<n@u54ޣi8u O..&,-⁎F6t 3-.4^~HN<OO iBQ$T\Bʥa GQF"Ji>.Dh7يB 6aq| Cxx}I;7-#O0Kux{6wy$CuF .8f kTg62 f44X>66&nMɥM44]8`EzH utK!qc4 {^1_l\Nzt|JZ?G,X\ @gS5j˳p}u=eHċX 3054FBB"fuS3ؼF@`žx QJ;%$y-,cctN^R)Σ`g_|w H-IbɃ*(
'1[q$6P/--Ki~Ma iỌw}}$ar2sBg $Y*jc .kAksƆ169kM m&nPl6+ .w
K TSaFa#H}rMsQA/=&fQ +,SW3+j (BgCXU
mEhQ+@C ͎J' c4biY7
`LQ<=w^V6or?0CKS;[*0D
J:d $8Z[(' g)kڋoz=Hcl5fCWΞĵ.
ҳ8 g{̌ yb)A:A&q4$TBYEC1$ BNz0Z*
P
r thDT GpDj+1JI##1u f}T$,~^ΰQFYRF*0_{_^VPtG_ l5e '-@)#t4ecz
]&_}dVhi(,GG ZeS 4mH.1{Im$E,-Lh3 3R,Q_x A)^*hW160 8DcI$;KHK]:b=ፇo#\*vyX11Mܽs SB4 O?eb\oh-&y{(&D5<{!Cz
>|vw֧ >E<N@.X^Qm|^2#S hhҶy/&Q$cJ:id
ŢPh?y|\Q$]ks|N s ۫h,$pCf^:/$^#ш3F \Ya1 </"\vmiju[q\Fs'
nꇮ.4U`e`$ 8GT8$s d☊TO(>k)8M%.RLg14:- caua3 j05w%`+.`9ouar-sp~ sE}PM{",,~HsD/[8o~4g)Ku Na}
!\NvAgf1'Q$"%55
Tp>.37@AyV*/yX]uyA6BcPS b?- 'hAMi>ftS# 4ɨ*˂Lɯ%!.?X|фwkP+m6 D#)gI&, 6
513'4f9 a\-0wNcK72q+]b6]@O
2/+c@s~yϙW]l9>>\A)O^D:cmr)UtF &ijiؿ]/HMay|7 }dgtt| Ķ\bXtcއ<5ܸs&_`1EvRϟ4
}⣷_dlҀޠ^汌M`;<2N 1yxjXd 4bJ+ [ `?[4s&ϨIΉ:`θK}QSOSI 7lbFC/m`_cPa&.&'0/yW,E_歇GmɽOpClmErq
u|Ѕ2tt~)ee
cضcI WQ8" B-3k$%c1"f K"fy.H
aEMhlQʄy47c3C_6}T&ڒ:,c 卙c~`wQ]-Cr'] MX[H[\vw Xʖ
}/-*D
vVvwFshĕ礣
G| :4a(Af _ѤS
TWbl
WWGh[͏ 8 j*w&ZP7WxدwVx ?wΆH=@G4梃g`_|
ƨgױ2s3#;4709u3kS Y*c/ .Z@:Qr4++4kks_h&ujd9Pq ݰ<9Kxz
-
GHYTy}g33Ǐ7-Mj_q|'obdq>}w!W9~)r SC|Ϗw / ޣ uچ4(igFaTWQ_Db ux & wc_g/iŝ
ˠ 7 ⱵWUan` xt oP A6;IQ$]ÝS|ا pk wOM/p㚨t|L~U(ezJ;#5d_Giq!!Gڵ 2228p` AQ ڇ'T s cdR K J,IXZZ23ƌ
1X V<[^9D4JW ._yN r+K
ܐiK~m<5Ncop^ .Y1I &1]tP8x EzRR~&R2Ν@z-Q'pA=}h|S>8E!alfA3e ]S> @BI@S bt]keBuԗc
e ! wӀ$!"< f}LbPWx2dxछ9BO9!%lp.a
9 :4 LҀ04
bMhx ni,*DS0WAtUR 8 #- LcIkhjLI&}rc z&>$Ip.
U(,E,N8Kg`nj&=~̎ ҈NLbH\ǽ; bͲHL Lx!DmYqzWA {OH&[ݧ}' zh 稣wv4(h7\f$> HB'(ZS\\jnP4##& q'(7+*
Ɲ9ĐT*M4
apd
d5Wp6<5$q'
*]c ŕNay
QPRT75 b{I$;0? k!$q GQ8Bsp2G (yUY N*HzpwB'*c!FG5q?߭4bE@7Z
)B,» S y
8 hj#z֍B?5##9
p0TD֦Z
ueğ=zd
YHJN لصg/.0 WV\ _W;x8@Oܠ %uuJcC8%-C1IaYBi)Bq%<L\Ѐ_F|/< S5+
ǫUxg 5p "]5(tqGVZۑ|ƆC 9L}g~+X20XD21Kqϸe\ủu4M]H-(n˨)'FsPAr+a
X-v#όMS+lb;ъҜT;#T#!>yJ@Y^<D9FQр 3 Hx,]u/-D".uk4 42A^ >4 Qz ` uT~y {OL6H[=~
%(ILF}*1 *D9{N]~fV0,)# UP +[8j
>|^KF'li@abl/^,^_UD!%m:;@#Z OtXD2<02QuredHNDAi4 tgvTn&q2G ߓص{v
%5u aWR2wd7tc;3+}x`lKs)Vocơ vΐ~8ЌV &O5D% S}MXlȬjYXEB(Ar#N{`J36G nMgVWV¹3ظ&I6Kۤ$j M{pDBɖ" un3 鞀 STAXD =L9_7G;/1E䦣 ͕(ؿŨ*IE\7<&k`$ V% pہ2DM$8E#44!GUkE
n
qtE
1(qY|
)m1]W4 V&14:6F~KiF ZaΚ0s:
MO?ogrs.DeYGSY"O÷^"'I\҂)^jA avf
m;-
Фiu6EX[/bn } 6o>zצo{oQLIؾ]^Xr(/`cXbRr_L=1^p҆9NYZBFAg ЛSPK[ih"'-m`( udġ>7 Oolbzdzyr2ɣ%434*k}
}@=rz
&s>(Z[,UlQc;ͮ\fTS'-}|qTqľdv
U% ;c* |{톶&T5h T娹`icǎSLI~X0:\ehTiwƶE"~h D`FtTOZő&~>j,TTP\s8큙6<boʛH*8h࢟%,QGAIIN2ꑓ}1X(LLMKE cWVR9,M bm O[x;9:q:ښ4T GCU)FZ ` W|\ Vd_@s].J)tdF~$_Ga(_GhHtEEb=wuA_[mLad?K[Xb|̐'GViP04L;t]?6%v" ?EeM#/Mz90RIPNMaqjj uṣ3hc]
5zZ"} -9|=\τ5/h% vv'ԼI'b7bW5z
/V)O?yS'x`#}X^]'vWf{}qvkKRU3?xO =F}q1ŬLMSQh7b[
ކ2, A rli syv!?2rQvw0ۋnѝ{!̶m37K1 ?@ƆSq}mbM(z{rQ.dJu Dwr҅Xw#܍@tu>ܽ{C^_F
?&C GTTRƚcXXp?9e?*-њZvrq.<~@ ~ylZgV<]Z]z<Z Ưxz쵸 eSzf1i?/4W q],q!:EbK4U)8 MqɈ C
N9;JR V SPljP8*7'[
Qx>,|=IPTT*PW6ȾʼtQ0{"/s X ʲ+Ks@_y4Q0xs}P䎪9m'aH?㈱\, <+ *g6O/̰)U56D ȯI 8{LZ$o]rf5dg"(*B(
xEYH9Bs}I[)BsUKq"6&D3RɁib'} -YXd_+֠_YVLBB7A5Cqm4574 b%~%ğFGG-2.Cmxw *Wre#=+iL q4<ed"?/ WI)\4.Y"QW
t CeE0VLb
w& <nGh .SUeS)C=\21B7A$ (յyhhv!W]c,)A bv_0cadƍT)jO :t
mS(+C ϫZA * ",,̌f; wGaAi6y% S,
1 .n;{9 rŌ
y~W㤻?߮ 7TCn,
CGb9]Ih_kdWvR TB.&ᔽ:왔Z8>h*Ƕ *9SՈ! JQaO78ˋ\5!a;(+^&
cE¡}8} E%lߊsgOc=8x0 p!)09`L"( هKqXX^X+rSN83
{reQ|)j/"5Qx ) .N\5|`~2s7""ZDȢ4X
-3YΎ *`le%M<$ 2{`a}Ml!krL~ > Abf*BcB UN8wb Bh'<=(H4G] B¥>:ԇu
qy,/Σ + B~<pt_7Ͻ)q!!
ʲX'/%d
H)ODǞo`("+8Aѧy?
1giYYҾ1!A=u
Κf\xf|L^jje x3=
Nb?M^=?r Elh@/Tw6TγO9Ђ y4 ޅNBv ]s?2M
?m A7@VA.+͐(d87NrZ$JaF>۽Mڿ { g2"@SO\ 8sA N9傸
aT,[[xɫ %o
ÕaB vMhخSiWp@1 J.Pٍ${x9( #o-O7-pCcy6"UU8 CamnHxyz nȓAVC@XH8Th2dGD [bسsБC8 'Ww iV }&:8 R[#Xƃ[Ko=MEai(Dq G`;?,D]j[} Yg殃юx|y+S-C06HSBΐ#E@ CCLmЃkWQ|6-5ml9(7 ~3CUTCGc6 .0p;{O7xRf"bO<UW
8\MTJXWد͋G^i,N|%kZK#4
0@PRtrI V-M%Jf 9'st3^/FCCzxzg < ,<:
C`DX8Gd, \6Ju<=DShqT~Ԇ-0'r
l )j>uO㰠Pz} Nl
C}vj'`HpѸ|.e4 KҠ:(yN]twMXBk=!ۇݲ-ز
a[Z:~6z;qs_"ؐhl1v8v # vێCGS; c +lj}Pc8[⤟+Ν=P,mcBk2 HՎ^i:أ
cp, LVvBV#
94h'
if
ϮV a~Ԫ<hGmT#*:JfƼ oO/Xѣؽ{7v7me ~uo+MU5غ/$` ?z !Ǿ0<a{,
r)Տ 3%x8x6[hD+uJm<N㓫x<QKnļ_y >2{k I
137y U, , +?:,-+ _jU88B^Q?JxwT[ 59X4)S+ٳq8J ċx&']PWK ]k#(+83X^D\d<q:1 㳳]i gƒfRO2_ȧ ; ]ɱ8vd7~'>{y y^>z&+sz~@DA! G`/" 7"6"yĐ,B
`D v쀳, *5Е +ƅ s7aݻ 갦pFHLtu $NS?TVH/-aL<yXcM\ŝckA?Fs/Ç {صm vMmu桵7 ywg|W7
w>GNN JJc<@oad }Cu!<|@ [KV0;)Oq { =XCP0@-xM= N-` ?~JX;~HG T hw'&lh( #(d #+ ľ}x0bǮ=q+a0=2}=EţػgLpDuU%~
IHWG **8 03҇ ^O[ø>ߋ6Tơ·9B qo_zL՟Cg^J h$doabx{1Ey2
sb0((.@W0HދƖ.T75#:£\p!) %p@ v64
ǡ߫p\ `Ac.Jif=\`bg [
w8A@H Ғ PDOBe-rgp1>Eix;xr{>ksF%-xm'L<Wb 7+Ȣo)y
n&?3< QSP'8a|ew4r)> ֎vprw , axs1 $;WW$&%1183f`jKN'`K "F!D83#^Af:H7h"#4ι\s5t0Va`lsh.8,/' W:EU&C9&nepT0TdpB_>~IfH>lBCe
N]$4 =tHSV =)D15&PMC+w]Ō9BZB?#
n1~ o;c>5#Y1c}hȪh@Gbdk
Q~D:("Gp6Y^AP'wmmc+|7cݺu^c+؉ :죝۶w7^g j2`gMه) U(4&&8&{&t S_|#m<ݏ<1sm@\33"W'5>ٍɖTEr3B\t欅@|2((KQ3}{
Q1e bb~m M ظ4~Lj / k ͑9:4J47TZ&p
tJv
ͷ7E mQz/jo۫xzk=/.lL 0z[096~'$1;9z
#A^~}Vpse2Sed6YXVHOh ŏtLlmob
=##Y@АBez+s\pwK+\lj8pWWIre(yݛ m-Иx Scp aA:P_- PPBeiʹP x.mWCLSA
ô0s swrezzP 3Ԉ{~{!+G!'PG1cd$''f:h+;{iv?dV '4|1 e+H:Jptq{HSHݸɹ
XaHM?$]rrW*إK~9ގ&L7PTFfY N2sq9Ju 2\hLӽϞ"&EY&#-ޅدd0kvl!~oؾMl۲o[c|n MqpN)ܨ(lG{|* ́]25a =p?4 fO??Ҏ7瑟~C핸ڴpt pؕTCR+Be |*.b
%9 ͼ;C{e35^46 ^ޮ$, "M]qDCj8,{b
M-' }cL,(
:7Y
`Z8!6uRExpmiO.HKJCWG3Ɔ_R*H83fiWWϟƠ{woނŖbV
+cAl, 7ibňrr5
ec=sK蛙nbfc #hj Eύ5κ9#?I{Sh(]KfzPW@!Lv<͌aI}yJ6k@BPtt
vm4WKE!/
E{s9yg' + ,.H?t,}~惐%en QGBQq r`f
HH@b9ֵjiÎmi{v2fEpKw+il"1@[#<M.cXƉ:qu&7;b+;qoZ}F>jlg9n3'*i ~Xt."Ngs9䁅VY7_FdJ.c~\Q~MEԦKöy˛[xX<
bnxu>kh M =]Mm,tE-̼۠J_!wTIAf?R7 C=U/˜|]'.O&SxH؟kNR˳ |xWQ48m`|d 0?քt[R&^HAGkT`y{Pþnho܉`i) Ax1Uic2刾|Lգ&QW`fμG7E!#+A}}="#J3 ꆪd|_}4_z OcnUEpIrU*:{13;_⧸ɼ4J
PP ^4Upq
j [{W/[h*aae^PۃA Q`jĄzA<Lʹhv-agi+c+N)99:ILPPGG8C-} jP>S~*12@u}9#iq !zp:* }?GrEZD,pIp'g 4!9z-6 =mXۜ. 's3X[E+50u /c!L^GA_ME
24a
S d 1o]n Ŏ7vb};%{ MU W Nh #`bN= gxadVb˳k'G ]G}_ۄ@2 raد ]ء+3-<6|8l~6 [<w$ CFI%"Q (Ɉ ^4E{{("vN18{7܍7ֶM5e ?]vSkTQMJJҀdB]E *$YT{+(14TM
5 //ǣi3f#> b W/d9nb>
i(ϊCYZМ[Lto-Js|Vމvt
wtm/*FNI Ex'
]&% )~344D2]aHlfk~pD> QgP][sQ
EYqv'/ ε%&nK( `msg0шn,MP
a
4S-"ϟGad/!
ZHř'1ۄ ei(w Ҁ3, `hs[k֔fB9Bt Op& RO::F<UӺz D:NKC 4$݆d9
_''D{#! v|1
7CZj36> FeEzGfPQJn 9%;| !CS<J2}i&qmy)oVZNQU☼0k?18dd|B prԤ@S,
F44We(Cs]EЌoav1 x{[XC< * շ~5S=FAj*
^ _M$ {kC}\)i_S9醉Zf;0RP?.d <Mw`7 <{voJB<|? s;۶7IU
@ vm} Z8-LʊJ oB7h
vq *{;; O?=&N \m ,,>ܘiEW]&
E)JS^H/^^TT3: Ax!4^iB M:PTUL@MGg`l ;2n#8,4ц8rd?|<,Zqb
`ae
'7w9;!̹zÍ 33}g'7~^>U;ҔĹ.dd 8vpoj*09+BlT0G+c\]'E
c ڱXGox*? g=akO;xzɂ|fjϤjM`K[[Xk45З=gLo<7a5opprd"|dἱBi&"s_*\'w,Vz{n o'DCKJl'}eDz_/J#=)Kmxk ؽo;T`. &TC@8?3+MXXTi`-8&w 6fuCbmرW
4(wWa ϋ.NX^'-)hU#"al"gn>j<ygط
#Arzأlv:1?ڈCӟZȪ0^ +B1؇#M58iDuq6<s]: E[}6Ltxܻp ߷w4p Fa ۱| ;NAh< x>myFZd
xc olycxbTVع50 ʐ_ #mu#_ /a"2\s.BW&QJ37eRI^ P $"/G[{ ZZ[78qF{`eHNKC@)fUĝo׃5"A%8uCs~S >az45PS܉" apv DEE͂ N ^<k|[4 }p+XBiV. ͜isZio$fGTU^rB+K#,/M⤏35Lh`' I3^Wg{kxya|L*jg
//;xv;,aA,ajeB[Iݺqy29X3C1k s| 5h1+C h("T+/n**8#>> p7Gt7.Fu@mq'ߋ4bum} kkW1~pQ?|톬Ȩ ~f 5` #kUoe:A=]E}
K3
* a+ |`eC[U_2
'~'P$:3E@6
sU5c,cJs_9,?yGT an[S=\<H rk+qc_A Ct?}Me*:FZ.Bd`?i={w`7ewoJ ݱ
ZNCb|
2M z$oyc+ut-[߄ 9YoPğQj4\!6?GϿƯ~ >~y *LE
0Tb<^vtfamb>RbN81 xwL7BýqmJ;{QW"9##*
쨷Ui:!t qh>>7?ڂ"c|- ]ӧ*
ڻ9NGvi<_~s˳}ⳇ6 ̕9 aQc=W02ԃA tA=a`| Kq̔16Ն` \_goĻVޣ5L3DB.Vu=u a`}K$ggJW+az(|/X!y' c P w ?OeeЃ)zkl g L8dby?ΌPOT )X]N8XASE C)f c?F pp "tTՂ v<f7{7E@v<&&vgB\ cb ~ ]%[1 ߇0'$eFkg
f0%լE^Ak}.ĹKojU"
H,F\JTxo]ïzB
QzBOWe}g0/g4V no Z j
w+]%@ -Y9w4v
:DuHz\*ؾGQ9D(ST P`@Vd$'"{1
B9>w ܜxLbƁX3v<ϿocnDnj<?\I摾nq< Snd2vuC\T$re 1Xn<P|7WgKݿ}3 Auc rWk{+YF^0"iCC_ǎ ЦIR< Lv(œt݉d古q:&Պt$]A|;L7Tsx6Wl Fg!ⳕ¸
m]k4E př($?M
B4NZQGIq
͢3]ͤW֥{:"y5]i (lx,s2 CЉBsH WaQ`,D 9ED ŀ#v? d8s`眘-TQ; .tA5 1\> SR
H}T7Y\.-C{p&Cs{ >!c*rPP#A 4ؐX" }=8.m-EhﾎVP9
G(@AqehiSx]ҀSS[D-S#3#/En~.ʫkڎ\G =S\C,GD,BIa1;1#0tO)
acO@ ں
-%p! $
[cR; srT]4Mm< &iv;s60c & m[h غ~?}
2h4vIu4 o ! ;u_r6>2"GyU
J /% ?:~!08WsmX*RǡwB AOC5JS.R V\(]IS~NIJ00Tq( C j{ FZ48v~8&F{C
a=㰴4hp=Nx#ELO;t/LiK~cq~ '2Y^Z c5CY^&9͵1ܾY"6*ܒ }Qyq<Zrk@x'OceZ,CW'w܉ pKsR*"ڙ
4<Fb=.y䮄:@}gg7|ؿaL䂐#GKA? oɳ*% <, khށ ?18hPo #(lقLC8c
Nu#$ 4Vx퇯aώ]8x` 9]m'BohU5ƞ!b_\Pŭ,TU<CCcבVLO> =U谯yn . cFʰBd
D )q..F(=%e4mR: ?~(V106bqoAqq +05Pk4_ }77bRzBon OBW(,˃
0>Km 5۹M
#61h N4 ᎭJqKk+ͿC 11Kx-Wb
vSd3۶8rp/T8s_
/Q@f>0R;
")yu[ Gok#|:~ ]Fuy6~է6]iFbJ2<`hb$
dV}m
IV4;$50}]W/{imkOLf8oX\N\0o!=5+ }O;/ c~f } WO
`w W֖
vס %9h*E_{{kh,>D8H~mu>9I羾<>ߋ߹ 7q} 쨍@?Gx|SOY8Pj.3eSvt@Jj
~c|>c*!y=F T(맩B0A[KjE j]0ۍ@o9# J;(*G`%q~Nho G yan~vvx[w~ {2d1*$c2į:qez-c9[ 64BE} hT堥`Sk1((KS*^c< r\- x18ط*Rp\ <=ș(E[{nDLT?~ ?|Csh FkP]TR0_hϐWR {_ƛnߊY#m Wi?Im f
udw8 Ml?q~'߷o
{6[_ǞqFEruTmY|T^ >{; deeV0 9Uv>g1o?|fd"6fserЅN(Hb sӑ{>7;1ؚ(*| 65!%1..~skkAQ]JԮg"3_]m} [:{ ʌ rz.А(l ?ddg(jd'an
|~>yy O?}q5~ *zkD7 2ztu41(*N=c6
J`hMj۞jAO0ӗރ8( 8 (Edc +i'CDYvOs(@(6"?UxL*Jf%]% 5}p#nPv~pD8= | YV
w'1یade`qn.4[~:;Q ٿTNҰbOIE熆yY b2 BU ?8&D+R 2҆tsJ=M~wO[УinӞ'p1)Oᤷ7RQ_ق1ܿod& -U|
"4J)lc)Vh c)` Qw9Yw n
ܼ h$){ci݊q졡3 D3QH % KsC5b.1w\+-U
bXwO/k&+s.NPT`jHNßK );=M#Xs$6ChB_&fRe5u- Ep@0{5!1 :ʤ
74'O c`lU050
Kݝ? |
|0# 88@rF&A(@WMKQ\pQ2׆|ԊVIIgo٨BkKcmy
qss|[ǍY|k3C4lN@
W07܁7~Y$ FJ5t(lPZs$/k6fCXFvI҅q&H%
գ 5!!$PxyD^ z_P:8&@>A Dq<psL((H
D-$EO]
a4u
HLvFn^hsi5 K* _b KFU_K^WN2byޑAG[&&U
͑6̡LT |9P h驱oaZY) 9͞I.ƈNpuDžgPQQ.Ӑr
:T5H{ ԕcSŸ3ߍψt܉L& :Xga1Y9^K2=|jM@q&"<NNGx~9ر}d vv4o`/M~Z)^
y;HM!Lb BcR} ?
_Ͽ/~ .
rrj ٷf4JLƖPWSǑCAtp"<\h(p n`z }7?alCB!#r?qR,|}=R@8 jPc
);o.L7ʋ`f! oajow~#22DRNs[v%+257 b
R8Z5B ̎7h}u4S<G"#P]m4
0cӖp+.DQ`)av]Y'jiN"^.0S8G@P ~8#̠?IDc2ac+?yE
c'ii4#h )*B
8Es}TA2 ǠyZ ζq Iv .w D" Ԝ3)<$l}5l{u5)+ nXzJ^[?Tī!
E.B[_6y((2tt )!4Z=
8-: Čpl-͡Kj``b.UM#g0U]?Ƿ[,]~(B _[[ cç1և:^0=! jy|ؾ}t5q
X)x5DЄqaiĭĬmR^xf&f:@h 0y4 )xA>3k0&!??K%;wPrPkXiBGY^¾'GID :hģ o)0$F=!!1я>B|<y~ ."Vv&^"1($.D{bWgQR c}u
nX^v9r45U\@/S/(? /o?g
~ߺϿFG_90:\L]h-Aaqr? ~I^RtLTB_N[#C<p3͏ux)f¤ͱnsSM<QkBZ owQT?G "BC }غ4ԡJ |arWѐc2W80y ,s7{EEh :H} UQ ZJr WNFDJYdtE3O^*۷nQUcPT;96SQ| pP
iVT]OUz%x{8I"-yɈFFU j }E Km0V<OJiIQp~27.R?طد(*b
GIy%rbTWQǑŮ[ ܉[\cn\^Aāٜ'hѦbܣa0"`Z@AZ'=v;`#w`.=Ky?*2>x J3 ,SWv@cGE>5"мY bFo@SU6SϟG?ӟ~_'䣗(˥A."X[]*iIb 9
OGNLz+/cs}1/01>ζv㸪)K-B<OI!6 vf0'RF<\h nNHMaI-!
=VZ& ;<ԃԔdի_kKn3; uf^ F;`fcm5np_3nm K3()Lh'+r0<ځ|kQ EH .&D(gקObmipv2VP2
beiSu
&6D8 ϓGMx iQ9?a$TWQC8c ^2NSa? S vɣ&]
vq!++>'kُ(]AjEj rc S?e^4U)cGBN0탑 g2yl1zb_c/L̕iMg=/ (?M`c@L샼 -
,`j`w{ZzIvs
\L1`mD
;} 2bfpۚj! u b[X\)z6ii[ 8煋сL00Fhhh\U g<jxi}7H D3dIQYij8DؾF@,Qu
,; H {d
Le
2r ?
ۿ|FA&F: L88mq݃
&v;wX:E ʙIhki@dXƹ4U\C[*4
'tilii(f@P10<E"S[蜂7E bB}]b^oAfli K__75ϛBh_d]nOcE뢸l@t|g @zkH7x|+] 8;3| -
%X l)AMe\nzx-y
,y} 3=HOtG/1hhP=qNmLYjJӵ)ʼt$=`hCdhd#u2pw> /
řGp ,kLUT 5Ѕ
ܜB`O
5( acuÓ,ffffffffdK,e1ǎ vMڤ)N;3:WY}1^[p}vNZwNv laT/5jowtB4`ba6V%PXI-jK`2۞@/aceGkgM0Iru5`o[<,zgOIiX?RgAD @ݿ/oK"ɂ6M s R~.W.>`z_|\,tu[
Ɔpxn;͗<W . =,3 o[:0G33%bhi#6S;ʝeKdTB\(_+J(PB*Ss '(2_`>ɉL45ך'/O |o?kMM`a(ʊ(+/=4jJvGqtNr2IkEbko2
W`m ڞf
Ңu ) 's-,WT[JzRVdűsGg6;=|=
̉},_: Z*I{ӧSYOV8Mtn9x_1gNl ݽw<xčǹw Gnf nb tiX{1棫<u_m]WH}:ljSK=ż(~Ÿ[X%fM FNb,bM܅D)%D(SZK(@-*f+YW`(Lxo2<DgZ4_ ,^ Rx8lgΚV3R,Hr1".R<Њ$ "#N Y9 o'u\s}{1 s^(Xb:Y $.RexLl?4I`a(z FX^*_ O/3Ք;! 7'
H!JAL ) ;WfhE c
gx7xx(3^}>|!bc"8q{'@uʢx܄wM2o\ %+x
~55ĩGe1o,X \LX7w:(5PG/ZP T{ -Y ,[H?W{ 8_ ,457Oj`/_~ןgvo։
x8a' +籢b\\'#5J. :͛-m ;MnZ wo] fݝ: ZcRUKݏ0-H G1>u07XIrs҈Nc {|]\$\8 s09'3 pKx)Μǐkד_UϚl?y
,} ($1>Οɹ[9K\\ŻWq(wVóNp_DaMk
t!φ g7Y <Q>xr}{0;
ul!m*M%Dc+Jg
MdB& 輅hw.
%@ VDkŰ/-`rrg1{`)pߦ
E&&)3 \qak}b="N8)TK8IzR0anT9O_O
pWf2@C<u)s%Ζ@8N#S[]LLu<m
&**P
cf)7sITL$F؈~hI10Z!^J y=}$8%>͈|~, 1V* b0)gرYp-~y)1صGyIwym>)Lȋ߿/\dG'7 8wM6 'f6)V+Xˡ{hoZb)Ļ-ߦ ,_8`Jye<2_r%,1ڊE:_?~ 7P ]8A
pʒ` r
pr?Tj1. ;][m(ܱ- =8E~Aiq~1vvYX" SCcԹUze[F E/p`9e9#8O*Hu?(}z
VM p#Z䡝dF| ԋoP;m Onb3DmOp.)%tm9G6sI2܍ueZ. YIFG%'o# ڹ ]ŃG:i*O)26\.>D
ڂwey: ɈMjJ,fTg 'k_x2#cWi?W~|R'[{>%`z,M"BS2E0ؒ,a|$Hx,{g="rgOJJl%R'<zwhnΖ<R ſ>~hh s՞EfZ(mxPw1̟Dc#sU :دSpp+. :
ԛZ+6
'<4R?>z?ƐMlh C= H
.kמʯ>x#[|Y[֍[J[%P O_m<(+H%0_^9% b B%o/'/+Rb Bbu&?
CA%ʣ:`TR fK-gT)` :zZRCuS?|.Aמgy .9(<Jw{=5e4UURS^IIa5\]^n_>ûH ܻas [;3H1UIBt0#Z++^WkE"c@ٰFY7c}eąz@H+ardyBKҼXR>bLXAhZk<&iEvܷ\e(9^/ c<yo)4%sQ|x;yFzkoPPb &ʔs!&lLUS|4Ƕ0`_
tXZ#`b-X&&*+' ? y*
16v2\W ^m RkeAe+֦PLB|?`r|pJ/s3jnCpw"ˆ4b T >n|&B.$D JcS1.z2}tBcҠF_
Zz"hKݭZ,iZ|P%{xبK\TY+(H9'&"7Bge:zg
}B<)-+JBRl(&"`!/ =UiEz&3<ԋ!a8a;w. 7_ F!#|} ,.D2 <=p'3J^%؟/Vq}1 2w3[3=1JCM3zyf!o|e, Ν$hkk2wl
ʣ:@.PvFPv\`^Iel8O?~{8"w 릫ֺjjyOյʒ
?~{vIs+ &oƣqQތ? LYr2zFKc *A2]$#>6n
l Wb-ny: gqİ9!ng%5O T{cHvİ*
̝I1!%PN>!O{c<cb ݹB}Y.4GGO\\K' vfpZ)!@okBB@a$kl'x6eu9&m kD, u)b
)00$K>Q`hBUz$iXN`_WC&/Jjl' HV$Z H/" 1[cO۟Q-R_[P 1Ċ5VZK
?%Fy= 1%Q^G ]ʤ,B142I]a.a=Xww /oGԙ^r 㢅È
&&> O|"7W?fR}%u<7ܸ|\_8wXjHY^$op+<q6M}m&/͟ W3V֩{W$/ZJCks&K`V.fy
f @KCKW֗wW ./O)|lV9 /}em??[.<8ux7[7nu'm6TS'\_;x?e q ;8g3W sb ҜlqrsdhMU?t0 -&
J:6=ӂ*77qjS6ݭ pu%˗`yX1߇0
o+uLr3oxzixyKhQƳ&:Dw%9_ &"'D%'<>ā<}Y~MH
b_Gλݗn}墺#Fpj`_6$ML)&*دi]L}4=7TCq\$-ѠČ #CR55H\d3?#肟UZxGܱ><T:;/|Ws3R?>+m-Z(Yho}.rǟ>W>/_S]^fGSD՛V˔RF{o6&(;)Om|m}cS%HDHxחJh^h=z^|7 lEgdNJ
#.!Oѡ5L-f@&:N]+%w?|gabc@Iq qCpd?g ~ɫ^]GQN$>fj0V-8~f̜:;k* mرe5y)fzZ YḤ .Tg +ʲeQY.[s˕g Y쌖
}c#4txF^g|>]rvۦ6 Qg64UQZUFjn.c[ 5 \ط
?8-|x@f<~pH'u J| ۩*DKs2
h+Qt6?Ʋ(?]d7䧰mS'0.>Ԝ@{"<$.ؗS1$^_;eT &+*H&؏#< Xfo\#Zf%.ޏP ԕ&'`O/MpՂ(6o^O)NNV.rz'o='] 3p#-) gѦ@ W
f4$-˙ʚ
MN$2v=NKV<o ňNL%XE\YhJ>YSJtsdmsl&5w`| -I n._g
Gĺg$<<L2UF_/?}L]uϕc+n3DCsrey% Bc6v8ɵ44\6H45OGjJ&AFF۫ϣO/'y1pt6WNTRSWFJJ >DG4{o y`2d B}_C<Nnѥ`s/m<wk_S{x|hYgPOeFi:l%+_tcْ%xbB1 ,RX*'_ 4@ !
,PB@o- Ɔٲ?sWxr<
)39'a[emOl縘pQ_:JYE2a 6!EHhdAD u30&{ l-/N6.nd}lZ]Lou,錭fT'HO}A<eٱTf dT%DCGk=}ݍfqpx!Q%VbߎWvXUAbl+d9)&$( ZJhm,IֹQl\ÓoӔ{ e돟uly7Xp;RJ}5q4@Ws:LG@vW(BJPWR-
l/ . zqr(yʠ: Jr7QBQ,H$+חjO[E>sO{AbwJ@7#\]C ::Ip"X@"6 z_p_{L "f&jȷsd!D;@b|eF ..vDAlD؉A
}h!71P6Kq @@ 'kSBvA 4W+J~{&aTjo6АNke"]9&*`vCϹu ;@o1uW[Bs'fĥPIQra[cd̛3EHL|1gT}Gs fb3bdƌ7O d(,Q?Q鈬 r̕]r)~KRV-(ݽ|w_[/;/E~|{|:SRÛֲq| 6L[m: G߷['pr/%H}PۙrU- IN!!.1憜?q=6b*Qg z
xpe7wLr`/{6Vrdgh6QBƺ*Dp׳sC/%
u6RSI[M鮢8'D[ ē*:Q)<;m$,qj(`@l<;J5 E֑̋w/n_f4U釞<Ow 58 üEN "?5Eą8b-o3Z9K =.rDt'NUQ-rLV dAȑO?
Ѣ~搬m@Uz_HTk̛ s9GjTGj|.^ 3!~zZQSQx R]-zPſ,Z(&BSXCx
'KK3lm,sS|س|}Bp):LYXFK1[
>^.% nEYBCed,7bOY>6 `Ժ$-C<߾ ?þJ{$u t)ɏ0+y\#Ԙsg3O 2xΜ*eEFZ40_ᇧEsg8gR&?̚1C -fl, r(SI0SJ j21k@5;%(ן ~7/ $a_.<66*!b qx9==U샷)B!܈$1{hc* {wLɵ[RZsxAk88Q -h6"uWrt ${ `{\|jsxJxa:uPUR"mѕԬǯp FIΗ#FZ9w\ #79\േ7k|* oajt
:sq|t
|YN "_B|`K$@._:+ mVOl|l *1 Geד66mxf!0X8 n**2 r$
b%.[AYdh.?#'s 1֜۾3gHH$640gb왮[uSM
]^8eIuq`^{p/{NXSΒQ؛ahdE@@xU}Cx&WfZc+XONJl\:{HO% !Rre/o/; E k`b|aaxx!8ll/<b(dv
{F*J,P~uax$aiۡ1V)twm\K꽗,'+-Dђu0imO/'!x~½̀YO?%8ޮvw̙O_ysJ>XJJ_8X8e|el i{}X.o,>Idrr k>}~N WrEF:ݰQe`| ofxp &8k+o \xw?Ұ/v.lqQ$FxbmåsGrt5hޥ=:;ɩ \˾mM Xhn=ՌWpz['{$-&Xt\* aLt?҂8}"%DUexŠo-5SGx ykl"h#kNǺ61h`[ e`}9=9DL?UEDRo&[ 2&)ü/^?ɻqf1YLlKV\1#s- -e3$?ְ}r .{xJbV$YYρea9$Lg<|,'p#P5QA*܈Ex/1Oꇧ=xxSU/=/u?=u%#ew"_f=Z5ޡɬX Ss]uIQrZڱ qXYيF}GB l<sh NG`_tUކ
Nx ݄O /σFXK_[ 1a yv4eۆyAY =G7.ՇOx,&|Qvom<wu/UByY%,[ A)*@N!FF -%0́:vHKFZ?s|yJ!!>F
KNTT8!tKww1N^ʜ]3sS#u"| M~ͧ|C~GǯW%lSHT/^ R4ns8HtG4گ6HLJ'(MDnWW1BA;X9
v5Z)33ZؓPs2[ٯLo(&l_Z鮐hOX2ČSFGu1ֶ,2'4 r\%F
^CS< "
qMn5o=9xFKȔUUP\b|bD?}-<{ .W^W/brWm|X.$džAH;p|&^~IH;Z@w3LGrƜ8ZdX4vgm⥸-Y6+ + *G ґ &=W |/uRIgK |wu@EgY6fDj,Ljj'~ S__ ⣗ݛr0`MF|CKl] ˕Cr%dJHh)QS_OIUtюB& $?",@Α2aNP?g$H$'Kqy5%y*z'&$x~E)Qn&Z.!W֦
غ~-6/$__;9vpXm2 ÛOΒEjl
4 .}|D .j%x5WHۺ f@7-
tw41ֶzzfUePZZD^\+1)rd$0ÂAr0X!CĬ +iͯןK DbBpsJ̎ VzmI"#ȅu442*A]v%!wM<$d˵0P&\1rVHHc;] Gu/GvwrZZS.'!Y8 5 1̦&R#K<+x
9r{(L 3$ÙDKm9RsY8&І}H^s8^IR+x\ǖt+5ɩ=bPRxA0Ex\@ٰO]`oM2%ܾtw^|7W8wdTlo͐~H01Пc1>
GYC?`Xs,l%,xYpM-R)fdZm)@ &|,<AD[{B^h$T=̛ R{ѤpGGFjj45XPW(ŝPow| Ĥ>go1[B\ܜCE%dވY_T( O```=tD` W JwygV"H!_9<G=6-#."@ѓPRsI)i W7y~,S '0bW>KVy t7WccfDWS5kۛ12
<<kl]'ͷ߾×_%?Ʊl niz^dbigsu%b-LsGIR^X]ĞmĈfx?'xH0`"ꫫՁ $&HzOJ$1Fl yƺkdɼyi fcu7?
}ߋ}db|puc":acj.fd$X_;m^7|qW
p1R hW_{2j.ۧW讌!_H7gYFm\pWZkm)؞a6AMu|Z^VuGaf<eyEHk-0H],}یAV
SIZW ^.~Tm|R>ޭj(IgxC]_O qQ~8X}z={%pj/[.]zM * k}Ggh$)9G`l%;8Ռ قE BM]⍕ӌI4͖2kiimK\xk+1T߀bMonaQ=m EC OTeIN`Ukv1.:vo>yxWž9} i -F[2Au|t c~ij]ܸ89} N9O.؈6y ӁPHΣR<&Vt?(:,u=L_xƚr:ټ~=q_qh nW_'߽{G9up=l)>~rXDp1&6"E b.^79!`?y-}3Cm,`ߎM.kikkOC'] tR^VJMU5e%TU
EKb~\asʌeڂO8_}-7_+/
$ f>G-,1p%/@Fğ*>Igʅ+Y%|p2L5T/s Gw&miAڛ3hJ!>Et&"l bӺ6)L4=du` j)/Ή%+%\]RECMEk WJ/IW*q״
8E'OrR yLo17vs~8- _y'w./W?FkcV~ 6`TΕCYp8|ԥV!ɴ05C'9-{`-5 9p^Nd
V3MRz*؏\gkMA%ĊokjaX]}kkcdgTo,S~vXz
S}\A~ m
wxC|+Z:5}o.؏\g!&<~x|4u';70
tU>:8hb1/Oy]00T0 3Ri)ǭow'ܔh|I)}~ ,(K #o$[ZVJr93p|z^r߿k8"k77DqxGxp76#UG߽tuT{ G/ = J2i(eN :n`D'6fBBdlMU7]
hgZ cڨl7nwfu Au*`sC WtGooJ ;[2\(qs.,]U% 8uɡNz;*0IPtb? mue4ooAVF G ΈX*b"ZUN1}d' ,E#ف?$`#K]R@o{-$FbEd K9A: r zZzuD{J06tIIΆv ߹g?w^w_÷^@=[!pd1^w=!!
lALL5F:8JRj(kt,lL%SY^v% ֑ +[l s$XA\@尵S G{| uv$ɞ`{bDCi(8+UHVY,u/&""L̷ FIusu&>0H )GHo1
|-{'yf3
I+{:'FCsK+1D狍+>^b"wq" l`=m@ @ V-mmqtަz[ဓXkk ǁB Ak 9x .KxR_$u玧!NRVCcy>7 plZ _$ `dO>z>x ~) }CGI>~l Wl:+$Pq / ԮIL GSq<k;J-rfݛٽ}ɵ عymS ڳUp=8{ 5 o繇Wxۼsm \?PM_;? ߓw"ReX[JEahouzkM >|eͥrW\§"}WsFXP#Z̓7V89ǟ;$F9Jj%R\]R^BM}bȈ" -1c"b&3p6CYVc'8KxT"q @:fdnfifYܽ4vLǀFM^
[o쟢)/K6κBt?gaQn BCy<q7 ́ ^/|FEi̕^%ZyJk)KW,T+M%s}m$FN Ă] pw[=$iPPL ﺈsS ߝ] >=d GbP4D퇟-b^}H $I~.JPϿ}\.7sBWw.::pa˲E Y4uP7^^,|
ւIKpiΟ=vj%';% hsPjXyr5RkllѪRBCފޙ%˔ b40^Lo,炋+I 6qp| 8_H#c#=|,zzC;Gľ>z Yl\>*$`
I]eq
BMn"%$57Z,yqd6鍂Qodz|=73ݥ> v] _8g& Gy[<vcT_> =?9~|{_{7 V uGkB\lO^WDqHTG5maXt Uꍏ;wUI[5.ɑ6V,_3O>N`O_=Gpy4D2]Sh%)ĕ1Z؋AØ+PwH6j19Ʉ%*0 ;X>͒f
J}A7ce`H rl jO ?K Ηs{[B7^ ~J%l۲M\SG6Kxazp6qx鱪+wD
@Cs (tt4Ņ*{ч" ,A,_KK%[ka
Mq3b"ߗng>372JrII"6((Dܼ0S(&@7< *!4>K}»O.qOBCg.zo"eE}C<lg#w_6|{ d1% XRjH}N #`N
T[Z%WIm8 #a 1{*0" j i*-ؖM'vJ0$u>5~,u]ieۦ!S$Z_LCe`eG7s 4*2éΉ*5 {<}[;vL1iq&7 7m6Ą~v[x-n Os;7_p۷{{n9O]C >ZK15ҥ$3-u]uBɺz{_+7mBjAL1Żod f~Z!jw?ǴvJ`\7n qt7V_?ArmtL6$Ǔ(L$+ʸj*+rw
a ԀY!elD'c]XaVfV4Ug}c Y A&eMv)ؿoODLJ*y&}~ml)~osGyKpK6<}R'y)Izͮ~|Z˙p.GZ~Ya!->$BԳ aZ+3L43 "B_=/c Jc 1'v:ỷ"!*Hԟ |]%,B<u2cO3Q)+IO|G 葵\̛64_r>[1W
|`_0y me8
r&)3>wӗNnM-p"t4401a ?vH |
P8
9Gg;llfLxl,f6j /σtlP;p:
l ldD'nGX_˶A{9!W7yl q?ǯ=xwzs^ ̡
LvUUE_E,Cu Wʚ,4gQ Nca,E91ǐBHuQkc=r_D7:OW{Jr!+Τ*$kf^o;x5Ν!=u\;}o>{K]?_q .pphKNKQ?uQ,qy'pw(@v[1mu崈63%bRu1r \Y`1gv^KvA]"- 4#H>ܤ W tQ`_VwKlbX'Xt1naVU @`w8Y ([W(#A*_C *| u5rpZy[x|7_yor_!~}]ٻmpWrhup@S{+uH(k˵WBvj<a%$!KpO<*3?|< Qo**&a<;ml>mR4$
2:fJʉU dņ`ro7
2E
ȋO2 1&4ek0k ]D1_J㹰pOɋC1NĘD{y-:`1%njxb=r}mpw3'*EB=~RZZXXJSK&^nB&fظ ~<ymcCعW.OoSQnoo|{oޓ_̙|cTaOq$~q6&?Xwӂ*cDp?֖hG6E)e*<#PH|ŢyRaZ4 V̟Kt$`GX0siRQ DxbFWOoMk =+!d@L "V~W_ Tko! 2aq^ ՝gxCܕ5V;+ݷpu`ʊ%U3=Ų0g#m#jyQZ *pPPTnɶoZ. HAR "fM33͎C7[V;[i"Y*yAFxbt):n^\ FĔ&ES [-HK1OVG34 ~?zU 7^J[֒E>7;ǣ+xIXV&BS JWcjm@ZN"+5@iT | ";K7QQL. "F ĘP@Mtfy$/^=E1&vpa6IPk @t42$la55yD]@l5iRc.֤y*GjRORrԘr4$H8Yjl`_LR zx]Fc].6r L(ͪ:;F(0mPh1QA7BXDXjŕZ[Jm1Uaf1ͣK.bIu1Zs$'WzODA16ً?|7/oWN0]A^+rn*Em-d%I \y nf @\/-OVR<IMDt\=ثw%#X2woq'L-!-ٰ<x9y/_s6@8ދko VY`osV (y~ m}E݄kR~V-fFr}|3ve+! A>57&/5
&$ć(b?., 0?"%I(fjRK+`~(:mhʂCl@Wy݃S`eE9 1QCEQP&4\Z}h*H 1//xG<~|^W,[ĕ ;yS<7e`[*J_"#f̞URVdo[,3Cp>9rMޖj - &!JD [\# IF\1^Y[EGy>{G?9 IDATKy|[31|Iu.l=jβ,ˋf3NM?=/t =fTJ{'IX,^\W v+wgR_ղ6ёn
nJ:ʁ=S)} Ć
WI--XxE*M,mppDPt+8bUn^1_^2{v o9Woߡ27N>z
~rxw_pO g_/_?ѽKןp16ylɎv\mN4r(ark) '-? KD#,O\K76RYgQXKZzqᤤbEi^
%lh<y<y"cin̈́ߊW???ͷ^$66XxwWV к'yｗqt֜>-]/NK+]gFp}S7+W,PC!ΞZxjG1| 3aϦ 2 )̈x|m
<%5'5d2C?Gk(O<ORiF!̵LE;g[X"ގ_$&HmNR4.9'W<f_W G|KyM=-==qٽE^u ^fZrhG3FF[`*[LECss%#;K¶:&9!F K 4_ U{aJ:3-G8Н( I]JRg(/*>9̵c2#[C=k m/Yg#j-3%)ՋD~ ADD{G}Cpy"ym$xډו' fLmG)%6Wl,^JwIFٵcB^vGy Dx,X9Yl1O?=C)x+=~_ 2=5Ł]ټaѵ]j 5peU[x|K||<<\Õ}gy;Mޓg 5"=Z|h2E|-(d)P''Km-qrd9Xv*V&F
*S:餎*k%TUd_OKa8N>0
11walh儗Ǽ!"B;8K0 TAtTp]>{縘@p@^!mŴ1""pPLs03al\/J4| Ϫ
$ x⣌&zL #6TՖ O1~$K8:h_})9&e~x |[c ;XDtS[HΚ2Z
(!-21dJ"3fs OSܻv}[x$/8ƣK;h͠8Fij#fv)zr=`;yFWTdx/{i*"OjJsi-N_H{uyKÏ\ >D{aC^dzK 3*50i/8tVF*?0<,$2[LD.P)ӵ=u%8@@}"#2""H6(Z
I'=]^ >|<x >\e)bGWo#
e+S'86؞@ !4] ޜs@kg! ||b~MLeFz6Uκ5C7WB{A
_ۯo`sMW07o
wu Ӈ
$0R,cjv UeP" Ի."
ʕ Vh/_YpLOO&, i<+ܰ43+uECY_ /:~x,_txxc^x/>Ͼ]us\_ws$b<;7pGj# iSuI; f8H
bf%c
tJ5sƛ&A5OfUx$EVɄՑWPp/rq> 7zXmoOSE
&FiO9lYہV&giV,7b3E ͡^y=NVlYps)ʼnAԊin('7#Qϓ߽JO/ X-e>{|'wsi)K8s#
4P*ux +CttWPYQ.Eb;}4 uԗ^WJ:1iw60*_;M+=3 Pr"<*%DS1b#\XQIZP(EIQr^=5H/(
#SBD^ TV ;W3]3[/%n@
4BECՁ2[0EA~ )t 6=eh*,E^7$$h
5x:-w.pR]"1ܜMt"3/CعeSڻX7ڦFVҙɭJÝtN>z
uF?^5RGu{/]W^/rf^,2)d2_&rŬ)zfc˗hc3%=f t4tY4o!8߅acGz
EJP'_}V01\N\\E:Y;D/ سs ^.b 職_WzJ9miC`bjHOO}}1ͦW4eV ʠC;OKXc <81*1DfI_ MLJ!P$'$F(v2'ˑ \n _Qd?W5X
sp fں:)(Ȓs9;X\BABph 5$AfR,wo]u3wn]ܺq'bjLt9ʛO.د53^Juo!ZwSC r2imr9Jid]o9ٌ5ձ|bhM0@b t?3}<4#.Ћp 7[2H
X
ƍZ-mo4S}z8[mufK=%ezx([jCp A6$Yb|S85Pd|pY6y%a%@e`QޓԆ䈷3 Xx_B3 =\-n¥pAxy"bvvl ZA n#۷| ~E>{& v|*N^쑍eX $uJc^e)L.a ;l9sY[[+̙l ]]]Lqrs%AP]Hr`?3o/>1ݛ$
AovW_?eΖbx {KR6]ۻ7B8q& oڈ'7mߏ
BO꼻H4AR :ۺW| 3aWLtY',/^aM GP;Ep\ NxڹRU2 -2PWlz`""J*0mB3f +wbw%[*ފq&M{:
Ƿ +qdIN)פGTFqv2r.22y{[q,GOld杗/sxYڋD[)yMK}`dʮ %+SP|_&iJD <[@}aTd)3$!Di*JGO#'GR!Q'kj
l^JENh>6nFRې-ttfbhr R<3=c{DNQ4[v2W>K<!qCbb|pw7Km ]Lw6J<5n&G9"'V% kk(I|~A >DmYZwjL^>Rgez??I!!Z:zi젢rַ1SN.lcp' {x2o< ]i& k_>˱]߸JЭdQ
x 8=ٌ1ccbGSb%`jSyut4m451PT;pB)[-`E령jz;SBc 7YR@X /
[A^j,[.V
edgRGK%SE?[&r|//n3s-$$Ѵѕ[@L/ YC 3 yƣڙBڪR{+7&!6o A.dAsqyRNb݈<+Ek)k`QF Gn`5ax kcW4!3joHa?'8\JJrhUW.bbSWՙ]?ɱݓ%c }93Moy -uscj.vj @1^DJpVڪ )ɈZ̆&Ni]\ YP&=E$s"H~܌V([}-H(]m
Y(
(bdIӈ3+@_m1&S_"{'w \uZ ^إPJr|b$S <|B z=% jNr?'
a'@՜A) z '7~R X,!_Q
N*ʋk)gB|;STײq OsyrpK CSQ y"XdiTummEn$
)8MLt3Pt_Rӫuxzrl/֪e\H^& ff3X2gK-bLe'Yyf& Ƈ3Ak/KGST[;oyw߸P+Ubiؕi0)/]NծF i.j
l`m=[G9sj?|)?Om )ƘWۯ]<wXP 6+E4#%v.)jf1˫ŞED8VWihȶՌVchyϥb Lil #.3 ~JH^q z8e5uaWzK 0o>,șp2RzyEl
4yj 9p{5Yqahs286ړy(gˏ|IP~ _K7RGn?ƺ06X[(RNYdD-k ?Ʃ)!=.Rq^ڶ N0Hȷ&JBX|Bݬ7!ьhjU9
"-ă_O%&1=Ύ^^yxF"6Zo@rmd韛
~ p[l4^)r9`nXWZ&)kek\k1+O+\%8I%6ڛǷK
%,8Z"McL3aaD6 @t\QrU{ ]MkW-
bԊMZtK3Sx,-Oqnj"p`xr6ײ}}ejSʬ6fr&} RǫW% sð5Zy?+Y)l"5X aaάQp.sf<lѼ̛b85D' } %Xb;}&ک-",ȍB\y Ge;Kb21͕A _mcu,ٵem֯_.200/\q.EKC!bF-VH3#T=e u)ݯgNZvĽVʫ\ Cbo'ғ&bI
D{ 6YSg8u
vaWvs*ُu~yj0㏙'g21k?{fohH#;!Z`a^gⳏxt,N #!ʟۆE#N }${-l6&pNt_;;3`\5e욞NM铲q1F>ۆ!
)v'Ʉd{c7 u\>pK-r 1܋2%h'&8Q \O0G|} %@8%ޖ݅4EWcoY[X mWac#:іK~^|b[0#.4-7VBSn.{٨[y{ű#ӬPlvfHu'!ҕHwB'" "G)I&$bء H{{=
S"F;8LJ\]#Gy;p2 H;>( $Y+! j9nI1w1UCm[Jh/a@A zsXl>˗cժ,U^]=M/O#ٳ9s&f͔gsVWeG+#"}EcʈG6GepM-% RωRt4WuDžܼt[j)sW[h5IHwN
曏x
̌Urr3q<Ka
+/,=q-f[3z)wy5/:{ruXKVɕdbm+YKzBK swVV$%DzNl飴
RJap cXS<
|0 $?BAe]_ ^B;yYF۫Ȏ Tj>{wۯpYc^}E.\<řIux/\k7QOFs15ZJ,-śۑLdLp1a8RQQEdwsj.nG;?܍h73GyX(q6Rc>khBR?5yWJK ">̕ ; gT/:&6q2 8ʖ$gwTB\\ p^rc!vn'jϏ!.G:8/f% }ʬH7%xJ6UX{Ξ@|M-헐Hx`ݕo=? DJfR"'Đ OM] /σ K2<"d>: kEK 7oftusF1d.K𨄅FZl)85ͥTgslsbk'kݣL
T2SJkU" 4VWH0 m Muy3k\u eg9s ez#vO] h2oA;18PKaNEY䦅/![@?
rغa}7s^=k'} +$=[<Y=&w Ir-Jb,K&@!z<m_<X3<,1)TU s]
y,k]Ri(0#u\%ȴ7Չ V'Q?|&mbb[X?GYlOS }!BAQFwK#'
ƙ V+HQWSI?櫏|V.ŝ?[i/@⋝&VN8 tq 4&`C*'++CQL)/YaK%G SKG!D胟zǵ0ERflYFYy1dFokJ-e:=w^u&t'.^W=h
"3X3 9KwSW"8iˡjH` s1Bb>+P+Ę ` OLj"`)Dz°`@̋ >nB*D[ .3ܒp? ϓ`$%/ ?+ = g`t6&?V*SCj]PGgm֡6>~ RJSv>=?ͱm:>%;^1fz%D3oakKe3Y,_ 3B^~o̝5[3̟7!)a%h5N į>}
fEJAz,bHsR|%ڑ +<ux+/rN>w/7xwY8; ݯ+JX?F> fN̴ XuosspIȣlN#ʹOQ,ᭇ\of|@ 3n-紙]~nYMmQE,%jR\5@<s#'Rpu~\Z. ߍ
9N좳DQ#^Rl g/?o?מ'9ԃ;F$( ]v\?5$X*Bof 9 !F͙Դ8z25rHnyl|=y_JmUFxQEv'qb# \:Mc]ej S *ʋ $;gkSˁ
s=y45Ƈ* 5 =Ñg [`/{bC&yKQ:kcoG%9j~"'G
ګ
qSRHL
!9+) @bB 6n/l9>,4
'˜y Ō{ Ndt .n o"~˿`?,C w`D$ݵulgH17qlLwS3O
OĦVjb88Ϗzu %E$3^AQ grVn LO.gMK 5H>
Vh?-3<%^"93mUϖ0)$h,Y@b7qErV>U֯i&7=RΑTbɔbOP ni Ok<}<ϋϞU | _w^pCbb,{{KѠ1T6FTe ofA86iz36^<eSxƣy8SQ(<['>iXĪyO MTwzײc0[,ZaDO:c\|XGĐ`1j턗7 tr W+WN Og , _gݏ|w˂U_Pz<i'O/͛TO%9.S6DN22GBtۧ8cZEh-IZyiЗ &II3INYp<S.b9r=Z&!1[ŸiSzwu<?~ѡZO= $HKH&ա%R^OZ#~zxEqvP/>^2<\Wag`_77
|L
#ABRF$»ə vՓ_F|b)Al acoW;coEC"A6D{/A$(HSlNDDCp /<PxAWeI uLc4;qr
MEIDoc͕;SLPűkWD<r|>nW:qVO? Udo Ddepk3ll&˖/b<eu Nay(^@7{ 9)(ؗY<ox~o)a|+ ?07_:Tgdcgg-5聽
9iݿSQ߾~#^u7 ޯJ8?x@FN.(.) [1M5<gCX6Nvh;01} OfS)αTuY].9Fmq2ef(f:}Ä:fkv
pwwŒiLX."h= 3. o L-wr')$ Dw˸zh;:K:-Vg^Cnq:Sу~5_}9@N ģWvo*̢kcfzlD\vbC8́S& 'ZRƩ q: <o{4JK &7̍7HwlBvv8 W}3
lQg87ѠF4wGo
kZsyt"ŗ$^(`C\J|Ip OS𦇣"1+ 6U ;7=,Wa%8ԑB0j1@_'b$ܧ$HߙE`(57A} عc5M
`JxKS텧\W
q%R2b__x7su?жyu4 1֕1ў'*5\fQ208Lum QfӔř͌t׳ai. Q. ̞uϾNvMv[xʉU)kݜl 2{\f̞ˢvK,橃3%(R9y X"jR=)Lf>7,w^KWs>iDKeő %!@1u xFo[+#l4ŵGx!< $,_xubN ;6jټm#$WS/!2$ʂjJ"
OGL<P3NP xګr8m" `}S:;i'*Ɖ yw/1x;WOsqu
,%v%ҖMaZ<I,v¦I%ELG] p3&֛Z}'C Wom.w{ϣ $Ɔ16>%?5?Kk(>p8GY]JEA04]Bup_^34*@qb=MPLCi:Me!gwZ~VL1q~." ~XXBkv$x݇Gl# 'Kj#8>ʅ]ۯ>z&m|@7UQQ @li$CSO1n z* <57P~1ށGyԛOP<b,ROg[8D4b Va`eK+ ee1*n8yzㅷoxLn/བྷ}:}k(kZ(B{ ַpv{~:j@nR!W!i~X0[7@Mv 59L7g gM@ &ʑQ\ٿwYˉC8Zjj xԙCffl&+39,Z21
3f2GĪKX0k&)ASSGO ͻoާ&KgGWS)Yɑ!?K ,p6jbmO gx xO~}~s~gܿw7{!ΝLA~1y4@]e=-x8J4SP90˥[ᷚ-w'agRǁTŵ{ ]UbĶy :"A89 7c
r<K3L h<OLv<Iva6!#4 I c.;+39m=쒰v @t|?~O?DOn_ǣKvhWwu4; )KPHk{vnuGhVFg0OⱘϞ;Ձ ?},q"E3^CL+$4>Zy(#6MmbqFԓ㋽233\c8w yA]sS:isn
RR =|i FYwG ѬU q$"ؔ0| qQD9bOrn^}7
+w<SbZǶ$%)f0Qa)q>$9 &@2JG v[]狍?e<M{_+Wu۵
ֵ3˙b 2f4N MNr vt`wkV7k V]Q1a;&8w`2"Z 4sisr 'vWk=VH0tp/OV\) 3Dӗ"ϐ3Of2r)u`_{B͜AbX -tkh{O~egˊjR\ 7' Et+EN ~O%8|ܹs
<q%JJJ%=eR6jJ\4"mBf:1ó<b2F8v<UsX}a \@gMמ{Vk̉)zq]FA]wC~*<eWI
<:jF?)d lON{z wTer`:N F|6MKwaLB
?_I
Q ^ާ.8l? ѱD5$B Oh _9-. \vmZ˵{ ;U)_>! 1Ey1, 3pcQ6o aZy8-1˟C#U<8Dž_a
p;8: Ї 2ST5VjX%^|`ߌ CEE7"$̂ 2ētQz̄-~ T Iv
af >$|4_Ol̈( !e`m' =+7B]I!{ ,n (NAvR4d%a-[˗>OcI2ZUoڶBn]] \<4(kÝ
݂QN J <ꊧ*++W U ΛɂEsXLu8_wzkJ<uDԭ\(/M'O~qqmu@2[K]BPZ^Hk[ ÃwD_^WoԦq^x1Mͭ<}VRg9օ T橍 }\MYgL=Xl"h N<WNg {I;sn^W y93 Oؒ-:,+iXb/\Ҋ>鎂{kce+6ϖc}J-u'pjo(ܬtFƈKMݍaoo? I1_9GQM0?" Tp?$kz >l6ʵGk-cjMww/
C˜>Ot!8>uuXhӆMlk$- ȦpNK.|h ^g2 a;w
gai7r$ꑔ`MAXq ..w\6^ŏ?%:܅ &o%d~~Ņ" 8(?&BT} p1G|BzJdR e+FI-39\"6&ȈW <XpArqq?CRHNL<wsd].me44wݽbK+b;y}<Gla(] t5T15.` Ω=5ŽvDLŅ=C\ط[ 5@O ?v'ky5g 3(3X =w*Pf (
.dŊ$Txw% w kwio. AU^LaaRy{.,ܼz#o|\ѽkO;.ı2M=;SVYEV^b80$bmB+]xơTL fy1ý=40ݙTw&mQ{6dƅo^:G}({ 1EJco$Eȥ,k5+JLN'Rʗ߯K u] /o#;'Y`w qD*!9^xx|۟@|CskĖVnjھP")*a:W w1^.ǐͶ->5}=9n [̄~9V3-55S[[,3Ő7 #<Ԏ.6謢\QEC' 2ٷc'YYAie:5S<:;=tzgQO__#-CtqrpCo1IΔfH #H˕IBztT'TIUNř!n˷BL{`|b)*CHy].sh)</Zc 0
!J*";?MLon7Kc䉳gDS ַG{&~Y'V fO"?=^W2~ Շ|ܕZ 27I mճ;+tT_s8{P \80"wK4-H#DQP[ČgQ>抙D<3b(拁Xv7w& @ca6;}]WoStNUN֖fHϧHLD ^b]ej3Njgsq8Kp .o;{GcN<x9b.KifB)N\69hZ91̲eC! c Au >$!ZvU'G Ν^u36K8ʙYQ5yQ%# 4AZWgm 9~8gg@3)>GК ŶumH84V<4-}˧z1QP_UƗ őO_~4qx]x,|`5~͑sKWywg ɭ^y{w\Gok);&mSHrS= 0YH-1؛.ggX_MeʈqMcm05 'UT%sfo_NsFSc~Vbnp4^FV`LQX2 u)O@ w=cpu%x39Rھ
9UgMpEs9{6a !"JE;k֬n<P-5UX&&4
sŰQSS$z%))h Ey45T[!YYhb BOm 6rd[mUn&m ^ϕ (d7}Wo[Np.
RI/ʩm|5 ͼ|J`XY2Xpn¼ X`>.6x: Yg$ϝh<xy2D3xlKfbnBhu9L / Ӽ yriT%)TW
D ä&o8K;LŧsQn^>s7+svs. OsLt]ɹ;w`?KDN5%Ĥ'ER| m4Ȍc)KͽgV<cB 3hX ug֊L:k}$^V u`ԾM<vL#GF${K+?:,@gqw@;$$[N
4H>{;ojn{Nr^kk,Kh6؟*kbzU Ѷ jbc@deQi(Nz֕6.& (<mIAF*n^bz /{cY;ccLR >ظ7.;++alLY`6Əe|ud 5 %S_@^'14b%zL
Cӳ猫> $0BK_L$ߔӊ~TfrnnRtvQΏe_I'=큟;5:m1ލPxhN.'ML ôVERYMAI1Ӻs;>oae`i©EPW">{43$ĕQ]F`*;54xLn0 b+!~dd&s9dgw_=ڡSttM0w``aQY ȁzW5TCqrMUM ڳpuB4ͯx-[ȞM+ȊRwپ~7lcQ?kivhbf^ 6{sMzv,N(5 > ꄁ~hZUE#eiqLo,Ծuz0I "IѤ-Syo#=ΟL3vo_9{d 2n]*>^=d5YKks^HNL ?[^I dPju
א!tӵMbie, O
1?{/se̙Z&BqfpZ,N _6;Q|Jsq6k&֓cB!FXJvBFfYS
֢i>A6VdYP)_12s_˱+ؼb>FԈL;G{rr3~ħ?{t_7rEgK>_ȩs3:(g~K
{cfn# n8+g5ԉ/^0 4'VuB} K/<^' 1;`]p҉$ev?i4ymkCshNDZ? ]rξcy~&פqNfM*8{gqHNq!7Gt}6붡8j Eeq,F3.C:Y OAYq*1!>i' P} L-qpOaA))4O1*<WQ&\KzR %-̜2L mёXy9f<Ypj\<1虺b`탋7^XCzJ4QIeSZ^GJf lYA:4ϟ=?%W/,_:_ :#se3'`qrĕGiDm.PrOWݦ];Z0 BYЩsGZiN#cmiӶ=:tT
v,'bo^87/pa!lr2%:W%D:"F` $%2g$.wM ;gr1Gy߾zƵ˘6e:'N%)3d }$vnj8T002l0Q~t:>QiGfbM(^qbB3I 0Y>Z ǔ) }پn&
(vo\
Kٸ|&k2\f _H/䎜\!Ei893@w@CH K>sf\4b:#< W/<gQU%5!A'{"&"pn :ewYpe,¦4ϯ#'1'[²3VVFÒs9{3'5bDo^,UT([z1 #X_14ǐfI@͇l݄\MsNRlhy)Qx9B ErL_<7
LӤ77=1Sm yZ ;oK$f.6ZԆOX #ܬ4q~wP C]Ĩf vaظWf"d>JO %3Ƈ( uǏ@R#1ͤ_[N ܖIMy!B6Ç L=髩F>ٸPIm3*}Y45x1 !~$PVZIB|2%lڸULep[6s)^=}čٵii1<y7TVͮY$f70g| \GLC{,L *˪Lҭ3-mNBA[:tBnhR0J|+y^̃)WwlӊP/2R)8mܹΌ 7;@'}:!__u|Dq _ &c7W$8 5yΧoYhG*pwvCs@1! 퉵 Iˈ$15\|c I/9,M,05@ p6R.VΙV/\<rrL3FUQ[;jإ1z)Y4,]A 5+d\*&\ ˉb. F% lԭvmXœp8e_fILMU#'Z`݅=[?':ha@!<-|͚%|6c%0L(> - $aI cj\9
LI"VHxLs wk͌ $3Hpb җh9Q,k,\>"i酶`.鎖>$4huMOt#!V8Ziam2@B|p "̊ StA_>vuQr@ C3b'wOP2amcn$\+H(Tgfr:Q.^E\|
u%SSUŨѱhFPܯ,Æw>&VbM\q#/ы,;V:hJ
-(&.A_Z
b¯^7rA<op`3xrnƪ5\>3G0Q՜1,\;q0Jm11J:YLtI:IU<F| j-mZWtlقo~n:ƍ<uWaM`S&(ի2 4~_kNV̟7xk>~x#z5cG3sLe|֓-wqA_ qw{1Lv::$/!5"O98 O ga¿K@v9KgLR?oX9>)n 'vm!Éck or5 [,Y-ݺFxL LUIQd/tP_N./8{P^σ|D ,q1eEj$Qp߰zD Y2۹$ Km XG{h?lq\y^(Os>&
ɕpP.</M
2oG
qzp>zX ^:dxdeBfL C&+ɏh_*X42crB ƨIWSW'щ0k#\gP0ꈓ`R~TW
/f X>L2=>hhנ~X8k92T;*W0<Bq`k# H>7Z!c70" AA>\QҨRu(F?/ؿw4Çk]w!]07;@u $-&Z3[pqq KXvk>q;qy^=ؿs#y1Op&ni%
sTх [Ƀ{qFgFÌpwJ߱cGZh!su}{ ۫OkѲ%]vG _x:n ڵ#"ȑ1 悇;섃-Ll]rS'qT<9ux3OG_}5 d
R#wɖPtz,>4؝T ҋJ(&<c$Ҵ",2B tY~(&2֬X:{KfMeQ ݻT.'prՂ_K ֥ L)}םcL*%n݉rR!TJ%b#_?E%͵\;H{Օ8:`o-X^< G3 7̼%LNŤaً~]۠#Zjb>͡TV;i˖k>e4OcxqVuEIL/eRE6;63"P; |,c+
v3W +khG &Y=>G^B$2ʟ5lU{|'cjܹ"9M^htc辉~w\ d6ƺ1$^wkmb wGkpLMu @X8ih0s"ES}b
Ƞ8ZKN>!'4$KFSMWdѤ$$gjq4I4# ?_<ɂӧ7a@
Mhhgn
輙PDD<HJ#r
ꨮ q7ic'̤q<[ϫg9~ho̕8a
vΥ#9Ûg{lϕ;3fȠ>~u ҳW5JMeUҔzRDY *%T(-C,(Kfݼf9xpvSYG]uj)1{z3sgy9~[x⡄;8&b垍ݼ\nEYUݻپ# EqE
̘>ɓ']N\RBnVBñ5&&U%0Mid̐bݰK)N"ך`ɖиzj6[+eZ%xRC[bl]> kx85+va3 cF32=X M g%$WLh~j"af&2TUrV œصr&5g$m+vSx]/K^;32ɕ1ZJ\ 8퍰28GˡbB)g)̓04cb#VΕ4I_'QBraTLi(nFtCbFjaQ?
)WG35 JRuL 3mc Y5*c9mSR%f =61bB ? W1
^6؉Y0 Lؙ xJƦ13
C? |0r
'Olpt!5Y'/!!<ʭ 9?1'ObJ`1/[/0@ss$0T ϟ]a谁tmlPv!-Io˘ ,"->'{( IJfy5z
aJXd) }#Gm q*v(Av!>:˝e7d||{ 섞&Z]uuSnA"s1U9-Z&IhGkဎmZBQJ"#w/q>cEi S
,]:M ;9yxu+ I/K|xR,غe%%'rgeZ\rd[0lhu{Xo2B-ϙSY&3AB5R[6#K)K %מo_ V
_x:WaE۰Kb7M#|6;]A)00 =0 OJRq9br}Nf&fȹ9~ \; S Tja؈1 }ŗoM~#- _ei#sSt֧*
gC%|`h4 KԊ̊0N1즡* *el7e_0\EE DPIz|tkwMt8
;ňb'u>fNy_\ǘ\C6<;}{_vowsmߧڴ?.8X
Ԡ1끉LTW8Bpo"n M-=|I[_ Js"&9 CS{\=qs O E$ƐOIa\D32B .ne$%PU^wI^˱/_CG lw 15wÃ(7
-SɒŤņlGrql%yTZqF(oh"GLŋx
}Aϟ sjvo_ȇ/ sj0/aI 0EWS་h~ڶStz@]"GԡmhI{] Wgӓ
_/>@rl q2'OifѢyۻǏϟUxo$ٶVkqY}-[6W"VH AzNJeKYd!no{eL_+n]ICee<~E -!ƗguEZ0RB|zۣ@~`"?UcZVX0]& ͕wu*[1EIkXߡUCI(,#=; j3SX49cٳfۖMf|%A*+^Za:ȸ $o_C_?nQUQj=vJ&jb~mJ|~FW.{i#1ԓ 34m &qi:.YO7N >;AF:d+p6L1qנJLfsv:<q#ԝ8ePnh -KClؽ%]1א*D)n:T/!x |My->h~/i ll ='/_B32 q%6c{vɉbH@WVT |b%)د!11:JyqA!ǍzMS_K{j1 Sc ^$Dz`CSM +֒ e Ք7]BYe|=~EǎLqQ ,ݛW2^qxptxmxpnc ܰ.˹5g. ɰatC]-FxX0PV(d_
?7 ?gGJˮ?_GwNqN⽨`:~#K^^O o?~>O} cۦ%l\=Go^>Wy$"e:SX0KO2,-"2,P@o~7}kULY59uK_BmML Lz{Ɔ3
u,rC;vmrRbE;&c|m\M (%M ݼu%k%|c?` fZtjљ _ѓ֒LMJKG1#%voȚ\ܿ(JrS<톾d K~9ޠ0M94GZ0 w >FzgR. 칓0a4
]玨v4SGrXr .NҾd oY` ȟ0O|}) h=L~GSiζYc3\ Ěr&ri:^_>% SEv5(;v``Vxof6hw|x? t$`d=퉥N
cg+} .G7 J'TI>衩'? 9/68xl)>əZєԸ8SӨ)$;-*b..,#!c'&"==ܼ+dLbۿx_ϓgNm""9C[wtj`psmp4"ah"5#b
Hϯ$>ґ%1} 55Juc|&OovͣK<~qFn;DMmK͠I
AY܊8ALb{ 4ZϕB2ѻW/Uj9{||o evn]-O];BZw4o>@y!\8ƞ Y+by^6;6r1^:~+.u#F1c4nnqD)q!$G R ddU 6 ε||WΙ9s GY!EQ]5+شj1OeFfI^6YLXϚN fNQ{1bַcˮ*Ә2Zkli@7ܢJOT+ ߽^Au̽kgnF=N28܅|IJyؿk# ^?g9d ˢgڈtC$ej< Mp0!בyӛY8k:U2GRUVʢ9c%n`JbIkMq,6g2#E@lD%\L6zvyh/}YYSNzRk= ƺ4e$|l H jbN~BW3@ Bdn2 ؛UWؚiK -uqs , }rEmCkm%(a+D`$U]))
e哞[B2YWTGbV B6"%TH)bI GOꁥb
s L(a0b`.nADP$6% ) GbF %r ^|[.Ϲsyu{ _^<rG_WA6tF
Q~U/ߟbڷS0*5e3ZjB>R)C|ċoH_ÇW7[w?{rG ܾr?^1c9L8mågXn
'M";;&M˗ ܹŜ铉
('eք ˎ39-孫 (c] ަe4+s{r_ECIl[M+ZeiZ<)jY2g]ޝ : } S9N\\m= fAĥ3'qM 7>þX\ArEN`߇`og 0ƺ2 \yk=On0^9XwMPZ: 1 fysVl@Qa cG7&hRsǙ3p_'"\ $&ʹ
uP/ 4X)ׄ}:}C.rj:vgx
C{dL^4gֱld%ͽ,=}ba@ukwʤX+ÇvI-d0ւ}'giNfCھLι9.aj怙ts;0d-vXH`k턉#?d͠LLh EVKbr&i9
KKk,#+= %.cB11FܘC164\KB FxaYQ- دPQXKYx U'%sQ=}ȕ+g$@~}kyu(%c]|S!>6}7}sn"\mڵQ"uQZE-ZFYao7g1\<`[~M{扄{!^O ߿͋9߳u-?+; Ϟ`LLAA #F
_; fɂix0z7g뢩\سQnȜ1lT
'oXn l,c2Feu<vIXظ| Me)̞=~ҷa? bae
kY7NtW.^PŇabJ%fiܹv!oK^5E+( d@o"}\uaZF֊n
.߾ßϳڒhU'S)+lXɪ% 055? vne|R cGS"Jk; m '%ZdOķMS+A$
\=YjBO"Opvh̀nrt*%w3|mF "6w$+s o_b O
PkA$Kka t1\'6R `=\0h.8ۙnlzAF. w1skK)ہ
3YӦW ES$8$$eCAQE
G>ښZFFW?O) f C|]RW,:3 ߑ$SXHJfrFoLPFVN9e$'r=~W?z*qjyOq]ui// xUp_=%DE.~h&dAkmrRKzuA5YܽE ŋl۱;>}_?D?Y8?>qyN+-\NJEX2O| _8ɺ_2ill 7ϟܽ{KmQၔ
gp>'riZA8a &eٸbõhH,ױqKX|gL Wy8o7GvoW.\9֮buH|fP +jpz!`Ls:ϯӣ˜ڲY
ERN뎫
$Uxd˟U~e M<Y\d]떱rV6p 9MHY*w&5&bٌ<yM*Jbz]717 X V0z}w<
4:t{
/VV
)3/NeFY// ,Գ{[Lai6+!&ӂho}6 z}K!>AS^gc
L4 *b`_7 8[3\}\wCczF8{c!yPÇb-:}XfN OEx`Q~!)$ǥEQ^9#jG#/Ay o?Oܹ,xt3gObpp@N&elWCyy. $ AeW!*US.bETbj g~~_a<;Gvr H`?rzj\LrnjC%0SwB$!ed@iӮ=- (WӠ^]P:YІ6mŁB:ȟ?_ܾrwO O }OWΛR1/;xrc;ٱq%DO [Wϊ]=,=Qhljf϶<{d͌mØ2lr>YYcX` 9o3IKH ;-kWζ)@\3WWAb|$
Z9MBl҇lݸ7 _SC< 3 KPBSJ("~>Vn5|ur e [Hui~XDCeЦ ȨZ>ٰd%y j/-< MkHIь R c,+isdHR[ M õ3عf SH`ơ
shu^U3 G^O%Cd\yb%7Ψ0O*b:nţkX7 r{ 6`/ցO {G =ocZb2jg07W,)_;耭[ l=Bq %@ 4Oi b估uV/%'rnsR≉ .5bY3
H#%[Ȥ$1qxy{ </zvS[vqb
g hMR-'/JkPx d)Knecf
GP5Y!ʪ N_]wۧw
WK[39gwÜ. [ ӳG7Mn /*mmۑێ
_Ъ{E+eV ?㻏9s /_SHG GX8w"i
>6ͭs~x(|q][s ue3'5kF5PSSx[1{11j72{Ri+X&U$,,kz~2F;_ C;8m.M k%$2(R6Y3
U-)w?hjJ: b<=#I.`-ܽ'W Z7哪o\.p= FQT#k' C8 !/яW#㼘<GbDllvV `1TVAbLY|zR+J(5R_̙8R
{w![fp%:E΄=]Cuf=ڒjώD A-0 9g3X\Ws'uu - ؙ
ofFx'5li(? .>bȄ[t$H١o;3 m0 \#p J9+@ q̟=$]?@NzNYd䕩+R3
IL!&&\Lru%1Wns6m[hѡ4
Gg`W $%SWI $^LNI=J`Ḥb,uM3幑4L$ALLYe˖-s{~k~|uWwq͙=+87)6rWnAا;wc>tҁ2Fk evm[-h-o%a[Dӫt
!eO/t0o^?3𣄃ox d(K$Q_9}<Oo.>&ɓGx侺ynٌYCmm%*˕Kٴ~5&!MnJYǫ3*$pL3FRZqQV G^|`''ngYh#j
qHfۆOU 2Kԫ."&1ہ # {,y=Ⴅ{A }xv"a:V2 P_b| &!1C 5yI{H=3ae4$?"\)O ej] n]fέw웒b ᕨh]s9?}u tqdhWؾcFc H)AZNRgO@>ðW[ >q,Qf{DW,0m F1OQzd)a@0<:K 8-;Cm|D]N;tN1S)j!O{EŇ:88ac~9)_qe\_/Qq BS)!>)[0OBj.aQIT! ZaR$;D&MG^QBԿ:D?9yp=ąJX)%h$)eATTOb6JJJ eUs~QG7yyoEc[s9uh u+Ȯ ЧGoҳg,P& ? 3Tu?& \Noނ=Ih= ~>>᧟ü~{_' Kd&JRɊb٢ۇx^+uލ;y@ /pO?/;w6ī*%owwnF2+2v߽ܙY4c ^͢1, [Zv^'oqT R)Ltk7Wwr,LSc! .dqz6oZKlLYilrj/ \>y HOťGcᓈWh6NFd&=̵$}>@K&0%ĄN ([Mg|?؟5s$6:fDIJڳ9O<I\4+M%0~X*+(
? ]2 g! S92Ucq ߑsY;Y`0C;|i6zW)jjL 7-4{g ʎL-wraN_%7` J2p0V'puqXr8ֶxoA ع$g_zhoJZ..* wuEqxɑ&ϲHO͓sKixs%w;<Y)>cS:S\QMp Z3"ribT*,pQPMz~r1|UOSg>&5Mc˧o3ϯ^}xi'__;*{3 Aʬ@u,h/|AA;ur@Y],P'1
mڴgQ,Bt)=F+ ܿrG7ϲ
͚@S}1M4=m"o=û7Adln_]!#{7~߽e 44~,5M_KI0^&Ibk$l CKП+6VNg:y\;rV#W+56!ٌx/
ddBrMfdE`B?I2<D`}OͣX|\fL@L?P S "6s:( kpn˄ĮP̖8}&/͐ AlZ>PWg-Q^a\AtLl LqwSmbl aaW2oR :ڹSh,]39p7.*$ATy Gҽ,pI.
ܔDNL Ú2&H?Ofd`tE1lTIJIurvER;Hr 1We fs !W{ {YK!<1B$+-!U@R>QBQ YEdi3
Y(%VH!ܒC Ki 5ReEܑS5Zľ
`Xĩ
$g!}""& K#qqrQom><'Wj {~ͽ
^\u{W^~0t vIDa5lݪsU{U!BYQB$5G
㟿侘 TfND62( [Զs,9Mز~ ?eObvQZZ$aJV\.[7LPzW/e> ]+ w孋nn`\;wX# ڔ,ۚ=떒)`zh-% jFwq{{E)/eLm42 abKHb9)S`Z NmXKgϴ[9Iuy2SY] :Cqau2>SRbۉ {C )W ̛ Sʸ 4XKKekp=U6s-!ٚp?(e© ;+w Z<@hh.i`[S=/䖄ױ~/ K~b Qll w ؾ p0JO !8٫O&FxH"v*-g< v8f[Khnԗ !2"e@I e
(9( MFv5䓛r *$9+zG!b@59߆SUUόYt!:_+d
[P=jF>Vž _ԩ-!&& KG4~&n>;] _y~:O }x |ŧ_lO.-]-udeW-A
m۴}VA6-[ _P:a BYΠ}HK]
_E ܻ̹ӇؿGFF<Dz3wF ffɜ:3 5H XǶx)3gL۶nM#iEsy vlfRC&5P*
Ҹ$^H0Zڣxq!qo$L( `/cLP=To^:&{^:h,͆ace;vn( 2{'P ĠbN 'z
C {+1eayĠaV$&0Eg"Ŵ<F$3Qfh ۶m r>C Љ@Ldӂ) ؼsԀ{kLxh G0Z~
CIzyHO YƬi9{z/gn,*ط"x Q5Aj n:Y?6smnXÎ
]>0FE}qsql7!V5.VC1UP'+۰ -yܬs%@1n&8hp<9+#uEb(P}Ռa"/ .(U/ddoNxȤQ
V<Bl c)TT3yT͛+{
sOʈqhyx֦8KHٽ̞LNjyEF?"c
ɭ<p9n26jx.߿~gxy gy*\7i~zyOonE hi[+ E[L]4^,Pv=R& m(SN
Lس?>yU EdK6 V?g4ėٱy{/gfm9F?Uۮ]dzƍm۷mZcImHps^ '^8{s nsyq<9k&
~,t'Ցmf %E13B`7~~;-cU0[f )@9nDW\>!}E2q>Cs7QR6TW@YV<S58`ieṟ~~^.$DmEnp uٳ'3f
`!>8(,Ww7BCCioN[.\*rs']nQzd$=9%8d./X .F:X_ɕ+%nF#(?ڌ vMk`C(:q`J|,T b=`߂X ʹv6[.3$sXX`f>s8`k7Ga8ai>O7;BC/z /So/$3-[PQ#kYYjM'0~ i)7E&CYj / dۧΜIWS)"4*3S1
CIsgF!5rr+UYD2~!d_h,.4Z_ӷ-?=IǃK۹ur %93[ɉCsp_tch+AzоcGu@Ԛ h,*d"M)vZ:" ;wf@~+W #PWUȈb ^r>GDPNvX\ <w3KںijfqL4 ,9og^L
(]R^Ս
M; .8IpT8IxL(50c(M"'u˧uEg@)Ċshnd 3iK,P[uG6>üNeR15F0^f Ja mi;</ hJMhWq5=krx|ͩ۹| $G46l2 zoP^![kSGpTX!qab8LBoOOH#WBi}&OMVB 1])
x4ը+hO>Uj1:> cٳ=6;Է3{1Zg{A*'eZ0c$ M
a͘ VL ӻyx8;V͢ GDW_4DẄ{B;FC0S$T;3mlLt5 *_a+$d5 g
+%48Hx6K-d_E" Cˋ seeKP$&!DE&"nl'";9!dF6|ZwRV$'9eRR MPd
^~a$&ao@avW3>ony! sx b$\LO={IHNi-oQ,Z@YmТtڙY0"-%[rf[6Hؿs%'m`";x]WvҨ//P1z c;t֬^Ny3Cn֥4SHΩH3nD8"BA+Qb(sP>59ь,H +ʇswP* %;Ĝ({Ҥ&%n XZ8ҭ@m=ٻg O_Η{O~h& pi,-4'_ 3DrJj<n,ۖ<qvE )4{6[|5ʖRႁ!gUlL.7P44ЧO?|'.*L1
,1İB<])HbJcpW=eL/1uF:>&vkEVʕX숣FpVsnx^U%h@E [dq
nx '7ɛh' 3INAJ*Lu`5\ -[-b#aJxBNW1 n<ZKhS411䌑+F>X{`f玥+. xxxU8ؗ:ӫ? ?bD_% $f &K'O%-#G݉c\</ W쿽@ѓ2FW!а L$Z B)D G%E^75*ҳI*7(W0B"Rp "%%C!7= { [,,o\={wޗ{v [vo0c~=z(ۧ}.XBmڶC7aere+3:wHG~6}#/ca< WfM xp+8> +~m_/سy9=e
u5m|,?QW\#OZ}9~s}ښ`:l0.vH75 Y Q^x._PXE<l./h_ Acyx5H3cjjJ2e>#sS;-a#<([Ȉ+`@g4?(ft9 #̢jLjf`C[y}47$ܽro߽d_l@{yH mWv!GD>#XB
AA 2'I`(+
)
!H|SiZ"3j6{\ K&d^ms3) 'B%tZ1]KL|uvw@ K2"xNb"BEKRټhKyp ė <_p.c8ɓXWb,{}FZ}Ԛ
zX`4\6pBS__<43M\F {be/|2ngOGٿ>>D ăTOTAF.Yۣisx ?r&M,jd.#EOwze<sxfP[Fiq=y9Ϫ MCTDɤ$d0 3>_-yͯo ۻ5gxw 'vr:E9>8{tP
ZztM0NUɁM(_|R't/,7w| IϖƦ2v^˳'W{xE\8pF^?/?=cڹ&S]5NZs ?a:JV$3D-\mj>6߆xYjF v !ě`/$#,#<
w;lt
D gL\ǔ>8u&n> 33v. 9|/W2H
}X!~t7On&8?1V3}B3V<vʅS{N¾Gx? ocJq F\+ͩ.H[eSPÆg B1OMY+,J39LYԑ5,?cY45:bҟ8 ][պzZwDNt NgS8=dzpR#Ņ ?ndiS1ns ܸ9`c 9Hp
cݞ[ &wcK4#g]l7c > S#+쬼3|q>W0>8b`C.ݳ/N$&f9%=RHrjQ!LLxQdǗsn<uKYpfM$>%՛|Y&檴<(!gB&q+7(
O 8~,=_>_ӻ{ y/9AF ^9ՓɏgF_H'
CjACeZm;ڵrdeAim%,U]m\iб 3y}G~'wn|T0^3{9}d+WNھ+b ?+d4GV3M aޜܼtQ
UEF {sOYV՛$įV1_/I_Ly~Ec@ eEU%edLE eIh(mRbl}MDkÒkœ5Vr9FT+!şз 4K
,M1CF!(Vܬ*-cfU,=UǸi ߿Χ8l/OcC`¼Y56RW]Ey^Iѻo_uY ^ $FR^/ nEXQ̜:Y4DŘě%B3C:ֽܿ1/1"v0Ɍu#rٱh,k'xT#R)Bjzj' eKM *+7*\Ɏt.=G1CF$ V[Lb̵id+.&$j/ؘcG0vnعa싍Vl]q 3kG\<pL f?
1=ci&ʲ.iV 7H5&8/rʹ $pyάXl)h
> ի#[7Σ, £c I/$$|ށ1xD(cJ)%bL {~çW=_y}z;wJ<) ^<8%]]Y CahhӳWoyu ullY,B,hK/gPZ6ړYDon̜0 ?o mX&^?wvN1
y&+4sCcsQ]SI>yǍ ,(*Mp RI 4UϿӥS+zܾ%[_Hoo th哣=U42P?7 f.<3#[W. 4 Ə̈́㈉&1)SszOn;غy'8Mqp+&3Y CNUFh.6$&~$M;svF0+sCnݽ_Ï ؼe5+ˊC8xZ4kq n8KA~%%%$'gгw:v#K~Ԕ3Z$;/ _I!~Lϼfdv/ásY?E88% [" +wPw|ƶk{$%X3MK&FȂLgr2BSU[_). ^/aŁWJB0C]5sd!Sj%d71$~( bd|lx)H;3] l\q ;{H,]rRp&&fI4 <~2P M ":j믥 m}zg0 ͚_O ,[;khV.x _4 Rv`!:>B"W':WYpn"~E䷏Q>绗t~7Ns6M .ӋĄн S2v5E=
(+ZIǺ@YEԲ@t_Z-Юଽz+41߽{̏~#?ȶKp %ؾ/
;#Dovd?=gӪԖ2c
ܜhn lRUZӾ KBKU ~w: G47_N)eciܗ
ƔQ 1Fգv, 7v q$'cld*Ʋ?=`[6=iXYDtL9IY1rJїbIc}+'U5ͤ'%Nmc rhmGyLݏؾe#5d^ٛ[ "zSwiN>ܥ ` |=YSj2R"9ؗOMX?Ɂ[m*B/έ2&B a$
p+JS94kX7t \?# sr;o ړBCi,!Hgޤmt1
3Xhn#+aX0!<>Dpp6[G[[K< cjG.K3[Z;H- `_Ya@ =
SAKMx:*{
O` %3?>,Z:0<Es'mJS
.2ȰX0# +\=Xe2G>>%?~xWyv <[
y#յC44@Ppӓ)[ j%x̷h%j+uE[)[g CjK I<{ذvgO~/
{y{_߿(\6& d-Mg:%qWk#}^K _wsp{EFvJ_V_|El+u@.c*sG2~*s$2n(bI҆ӥOOٶc;>%>.ḺD [BLN-.tu6t5Lcg5s=iec<֟ٻ(ƍ,g}p;O/}^bnfv8izT\?CYi%9DݿR`!.n88x
kgCFXƳkL\h2%O ?=Ʋg'
!r8SL
8(yabI< 'Sø,mfV]&Op`=Ia.%P$=dN,֠d 6 &}0^X;Yaq-M k{FO6{hHOHZzciN[J0az I Kj12ddJ-[-4 @C?Aa>,Y5?_<ɂ>Psq4م 6P cł' . $B B8>xWIqEBw )I|}=}xO D3|}o'7H`8̥ckɏwT' 4)Uõޣ.b:Q@[aǿ& ItAoGi]tVVܹ32 Ϝ*F1~\#\;B. ˽%|pN!y<wI]iwxpㄘ4fQ։EcKAotP""N!f\Ҡ'Saz=,FX`ia^00# (ؘX*
3Y^? /[ʒ: wŜGRBQN
XK` %eE'!Ok{WVXέ穩 G D _8h[bGm-MF?D'.' b$$zhrcIMJR¹"+pa>&*lrqua@ kŗ[ؿ} yzqO h -AZH/FBiIn9ٙ^Y$0Zݛwߺ ٴusXNn'A Ap3 gC(>N왁?y [b4305MS=+e\,nd2sɉ ={&e`%/VV?5 ib % I fKp
# ۞<D="q ?Ofe;BR Ss}1Z n9&Ҍ4T >4u'HM]b{ kr4 ]REp@ !rl2^<dxan*fY 7q?~X1||, poģ}fM\>WeRٽ5%h1P/+E
tJ'2ةs'u2CG}'ګUݻwQ8 :dOO3}v;sjKq,ᇻ):Q?(ϝGyt եo ڻc} G 4P@)8Sx Nio0X}v\8\l-͌doM ETwl[-G7; GKLuIP(;;*Ĵ[#AQC7vmIP GCtjDFzZ'=k. ;" ${aހ_H<C3I,xc̚</
JKg;Cn7dcޟ;gO".& ElңtGxIBC yYd'Q-(-&@'kHP;c=g[8r2e1>i ]q- ע,%DkRI1.ld100 O,E^{),l.3}| .D+ aMd=tt`iW~? 5sv068YpGn"8Z
`aNx ,!IxKG` ֗"1m ! }qrvQo2qgj& 1@C[Ab
(cAk+3+y?,|wzR@o/tܰh%yI_nꄁ:eE`
p ESݽeq[~xX C~.|ǯ/> ^ɝ[~LQÃGNh` =={V/(Wp (oNo]C^x څݺұUjl{F ?)+ޞΥR/ d|x)s?Ĕ| ߽ÏW^?*`̈r}&cQP=
M@@Ȓ\ Wx{cj8b Is 6*-r#V@LI ԛpV .b3E(~,/D4YHgPJ0逶6[7oW (˫d@AhQ]*<튁5a$+F6҈ >>䥔g}gꄩL6wZΟ Q Zl;wpv&$0[gKջkg|٩!#QgwfL,M$8itƶo{t¨JTޗ
Rx {6oI3
c f*~"gw. <>e;+Ȋv'
wm6.NW,ci2P[_̿謅&ʶf Q +a§ w`^&ApD2䉂tB_}5e}3}C(8PB1։)S zoOwe'_#o̒E(M"ߟP% , {;g\=qV&{<HCarh=|}͓th O+ąyӣK;5PHJvi߲.t( m'ڵо;ϥuzuCNغ 4tL>y?IwOT}Q:s~6Ϋg_{IP/x
\;Imy&8~xnV'3 Du$) zZS
Kk+& 7 n8b 66fX[ (YLvl\FzB &C{|8< 1 Dvr ≋rr033E?kOێm ¦-x#WTXJ=jLfv vB5to X{&]ۛqbix~X#gsdrN$Dž2qX&Ly YJKIuwY9w|?CBBd8Mٮ[w Z]Y)ԊD˘5edKr~j6oY81GJ슛fwww; F~+ 5D'Nё7=Qe`\I<gv, ?Sj6icI [0+>u N1 [!
遲v6c1Nn9 ⌷gB9
#XwXh߇c &6Rq=g)Y]qz{ aCd ꋶx#KϿdR%\i-iw :ؤJꇿ +ˑM`h$0uvtT'
\<
bڸq<|Z k{yS#~x} o.Q[xzm?O+\9NB| З ] t.AGe{%erKNjԮb&>B ]wtd|9{1y/ 7.I8s
㛻'Xx
[V/7Br/o
;DžP1U9sl9y)&K;8B:;$H >d,_8IKRΡ ѵȥ8SΩ/4,gƔDIv#'U@6'E+Mv\MntODs{S3ظv5 lپyf1}BZ4ӣAt5q4&v˰ + 芻ߣ2)J$59<*j8a]~bܝm01N89Q"'p,l ӿFouN!GrR 1FnIEnSH^/b~?Y6(A3 œ8v6IOclnj9dS[grpTi4Pܙ6t .Z|=K-!IMm(`|90K ]+{ W/ܕFX:zbꏣG< [ INKMĸPo%lD oX,^A"SpKd|4ض,Pjwh1 =vlLX/wdЀ:3b _GN[ fO; JQ/<|?/o<yXӹc h!A"*U@w1]:;+һu,VL`cvtЎ!K;m>g ~O ͝KI%D|ޥl_$,| &։@T
>yꦘT1oXV-nmX^\IQ
t)[EGr"߽U'KM ">=3sgA+W+'41mX5<y:1ub#kV%>
$!'a([x+[GwgԪJݖ-pS*W*e5|^ҵlݶkV J7e]WZEC_10B$XXcbaAmm9u$geQTZ+jn7 7%7#B1z녅qo3|v&K(rX[;ѵ[w
=8h }OV"c=+15zbWG=~8>7:?oN?{ l$T !}iL % ^:yuk,4Ax$-ycUWs6
{9w57ed L^D`V514Y/M @z,8 >ަ}<dq1FL;n~xbd큵 6.zUqenfINZ
e#Չ"J#Ept"AQ c!AWB^vN&sfOƍ2O~WDxh =ѵ#5M"2܋0 bB{go̭]SvJW3yZL x:L$8e{z7wQ^9oʕt-A?}E;ҹS'w9.cEa}]ի{]ta~ӭM[w ?; {v.Ky"|
7K0}\-$T}s]<}9Mw`\2#))eL:xGv ܺ˗8{EyJ+oT?zdF>a1x8dg.\2Ug f<23qLmX '(Ș0=}Rܱ
mZCt^p۰~h+^>}sغfx%DAߪ}gZK:Q?z8GM)G X2lb(ʥPsHm} $Ut"Gs3u& 63z?c+[RV_MuY dŅрn؈2!No~$m9 F][3@oջ31ȕs2Jٵrt52{D.f KW^ƣs ?u)4rպK+"*
w qwQ.hbk!^LZS>K] '?֗f.zv06wZ[FVsJȊb~O&2IwC`L2I'AO'bܾk=?{*}hm>Mҧ1DN@ ;^K ctqr*>lj3{Ưo ӳk\ڳ˼}^~o%= ֮@m ui =ٻz;qN]ѻ7e̴߹Gw|ݑZCѥ`ܔ=[w7OE瓼'ѕڰ>=W7,nS.;HyA
ԲZtJ(ʊXn5&'=-8X6Y] e$kJ|-L8SG1NBS'fL ê3HdV7|,d"l2Rb> SǮJmV<+Fe&nyo^qklڰ ު]K:jݥ-pOG lbq /D;;glL h+00)(ȥMw
7DnzZ\)XdƪSq
T&HmEm٫d2ކл z+9$+-!} 7Ob6p#܇{ :ch Lfg_r1STu Љ\ݼ '26*M
&5cK[+vh=Ҿ ݽTTeG9K"wD v:8
jvNJ F9`0LDW<%..^89`b茁-v~8;cg㊣AY)TT JɃ!⻕9ǥ GhLtp%w p* 0YAmdoy%yJ쇟)EdgF`S oJ 02$VCLd<W-s!_ۻs~HD6?'1JXxre/__;Ǘ9wh9i1.hy.#D D (\ʣc{zJ*qPك%巟ީ^(Z1ؿk y;˧PS#;(+,]8IG2Z!$(H H4ϛL Yݿr7o"
R«Dp ZWʜLl,cѴQ^8"%x̘ #Th:glO 7qKpIiӾ;- m1nI/-+cd6[. _ ڵ4
p yhBˏv%֏}2ĸCeW@c'Mصs;$>vVHwS$@JuqwՕ%9f0YD7VӇ={oގ0|.)pDxS CVz C(D:;@( Ǩp* ?oȉeq1,j!EBK+azu3439m!l=+&{hϩe<f7f~nՉB$fxca6k!ZkKJ`; O7S JA#܄8wl8XX)-;`%@ˑ0쎵HXtřdLJ Hh, 1
ނ"b %"bJe
%I_L(/?}L 쉆U7gD,
%Fb$0xb"7HCK1fV8۱u*~Jw}|+퍸] x~Oo~oօdѿ]쳿H䱅3z[Jҹ ݻ
;K6֑aC5ٹ-anܸpL>RhRx๘K s2[V-` ڱ"=Xw$Ј=XAiAK? Qd鎽 =uOq.XG`?2ԋ vn])"4i-f9پQ (#$PL`ʄ҃ Ə($;8ԩSY7弴j!wa֪%5H,}oK ?Uݧ$aZ:m=hE!Va c\-枱j
Q8{6MpRAn.Ye4浫VL֫j
')b cbx/1nb9̟50(Y^G\ puPqL
)؈Q F^7тyiYQ1(-JgިJ7V2UE4d2>7e,~R<dɤz($9\5fg,FųQ YM7j9&0fD:^)$
o< Rv@YHf&a2qfu A (^XXXʘz" @eN NX|
aF" Ox| N#ٰA`_R<`_^QQUBDh zիAbb'7TKh1Uve a#<+*]ٶi-?(?˻/_xyK ]ËGC \@4uc UUpAK&XoCw=Ukv =MiM+WϜ_"
G7O E X,ȮVс?߾Ƴq0YSi ]IjdL %Irg-aQ jn& 8u`z2.LLr[mkD(Kb٢錨)%c`b
1,Y0Y&[_BqnZ#K)M,'J: )T+[I 8HW3bd%7R 2wSI&?Q]U(=5CC|ߤfLHQiy;amOThz {b><',3{臛pLį?UY2͓şiӣKgz膛=njpKv )Qx(/
.'pjsH```bU`YuE̩+fFe`?I Y0D,.gQLYVk_7o<sUZڪ*7/]̢elY;Qubؓ=Qr5|`uAĔf+Ր@?K5Cl00Z} k̬12sb`GO输p ,Ć
_WjŦec GC%8$&S]]+C?_g_P\Z"뇆fgxM ƕTd @>jo/ir|V::hǮMkY\$/jȷ7O>8/pa&2#ڷ]Z}犦 &XW[~g{t},xث+]o^hiӭ]=ݸtKnc~Ƿb7yr$[Wa& # ;gL WKcM1S[K HOO%+;7;f
VJx>cǶUTeBm]>%)ޏܬhIq`L@j a,_4Jv1gH$Fy0vd2K)Cs`?>WoQ(; @#Y)ŋW|#O1{G6w]W]:%BR}M/i$ܝTzGI~ T7q6>|o_`,c{p\})JᏏsn?+gO`g&Cի :v m+ۅ!r<99S'
C &>C_FW[w-иqwwwww7B $ BI ݴw;ܱfZ+Kߪ9zj@b6'$J Śɣ1oTTdcQe.f2.Գ- Mӳb0^k)198 %1^h[PƉ4/L VkfD,_XyKm"̙Z~T8;kQ2mT؆r8m"HA[ɂ Yȱ#L xn.r3\y.- q Bdd(t
!"<$($%a~oɂ?i!نQAVx fV!;= A/\il\ ЈN~poU߇ґ-tlދzyk*L> < Q FH?|`dcCAd7|20F3p@? 6#`<Rrp˛;x, _=vлe%̞3jQ?
(DNwݳݻ|w aH'h 62K[Qe qx[36Y(') HULaGFzqX=&A>
nj0-mc{#[(N aгP 6c0d塴 hjx _S-g_=Ϡ\/?g~6oXu-G_T2m`S`0D!be8hdge#3cMDǦM8b?vn\m+Ѿzr(n]
Cc}plW CCS)t
@_ $Fq Q ̝D`Xx: lX m4 MKоv1Rlm[ݛ m8$UnƱ= 8:u 'o[x܌#|ԡ8ϱwۺ qS{7[I<yo='7u?:caߡS3ukTÌmuj*{: 7z02`=FYB vnvpzoB$$( WâHIDdL (M̬ZN:Łӏ/9.>_@{[32 Kl
0 $CC,xOOD;]I N Hd[QOx& _? 8.sA߆qvzf\;މv;yY}fLZM#]FA]\&D"bƝ\kUeSV 4Dn$ξ0\y 4P'
F(spN>aV,iuOQYKrLR}OqvmCƮ ><h`&$<5MXOWP]
a H>{`㺥10SC|/F2 i|Ibl̝>ifN(9SQ3 10 ;#+tCA+!CdUL4 Ռ~*Eזx!
'H$JF;\f={#֭s-Gtj14 0PF1p/(r`ggPoF3f!1# O ª%ն#!.p %ؿc-N ܆7DmmOBSU}hEzR J Po@yٺG#qVܻGy-8||$ ݍ)o?}O/<b{Hyb?r<p;ږ
s8N>U&⏟~_t7.CqVOt9Fκ:ǁ
c$ s8G'= 15o`nƖP҇
mb8[!">
C(q (WQ NHABJ:b0ou#LB o ¸pbLKU
7XT?8J+B=]W%W
='$%!59cʋqa5cwӸyv Nk8}5. nÍ[p\;':][1<\Y^(-! w'h2l(F(ݿ~} :*sgpb7.ޅǶ lXj0n<j+؟ Xx>C{6rbsc-5U+*P`$V||lmشn?n0QG|T0i^m͵C2Eb֔Y1I`?. P]OASe )ͩ\w
={~K=vShJ0f*&`KW [xMgb
X~&MT-{ T1m4\4Ssr9M'rҒOҊ>e]ٵ]Sq0H9-!wG, W0WO f$Gfaj6V0Mͣq<~z& ֊s!Gw˄lؿp` _:O9ƀK'<> ؿ}j/8{a[ _$|pO`̷˧Gbqu[0j2dG OsS_p>W^q3GA;L}e3SQk:PUׇ
\ab"KKMqsunC $I1}HOM g/###*i>MRraqf2o/7XY2YHI$6#1wyzo ]Ý3\"8緮e;:` <8o\˧fM _BD UՈ?<G7`>8J(HwُO'W98w|+EFNRL _ cKP,+m;8Ƨmx3ښ0'Ŗb=2 &sK
8 lGG 9V0 (/$#" ͝mX0"1z4$⃑0y@O1&loFz`ࡌ=F(**)S0qb-**ˋ0z(lԎo_~ǟ?}?g3.b=Aݔ>s 1Bma&R侢ω
rdU㱹c3Ν8u:{6CyȊpE&u 7:a_\߁'O :FPQV8c
T]./n :.
qٹl8vƅmxu(Sӽp sxqv?ޞ? OO>yգ8չ.>S!Bvkfo<O7Guc ybǿ&{l05" MنA )lu``4vf027)_ϒÂ v"G- ~~ް1C<8IOg h $8\MGD*&bBB\HJߚq& {U}%2A<0wl .g0e($$ f`)Xx&:-ƶ
ji@GBشv>\yc<l];Z{c#v.kpx:ٲ[ZѶvZck
l۴ۖy)lLR;3H/GEy>&Oriq6MFP߾7uK4]܀bѼi1uϙ\'7N
cq1lZÎt9;"Bў
OOx3CQS^NЏ@bf!:: 1E+(x"/#i r13
kF!/? A>4$4GU1RS
If 31 H(*)e*FWlT9=UaC*<s
G6aF[;C<{E%KdYbDƧU *ZХpFr| 3qhkmgp6ɾ\0xIe!4m4l[q.dDž"VFF.~IH EJ
[u"]2-+`3k2tr<lk_F{i*omƑ4:(N7cO ܶ '(6;Dt^]w/ Ĺ]4 [7
{8.b<ܽg.Ń+;܅208$`d#,,uh gs81 ؈60694
Mahi sQNcB6Baj,B(>\@+0 a1 R($dq wHOK_qosAA(q5q18yQT$pų8
GRB cAђqJtiMbylg_s7uODì*|q6M+g`˺yu]֭Y&wwJ%t䑝4hY&1 k)*W,ǴQ^4yK);Z#=|xv o ]O_Yc)[ӊEӱpV-Żؗ\.SD>1nd#`m GsѸy
4 C
sSP($G0[D zJژ`X
GFRChh&e< (dƠH5Aeh/ 鍲4grBO[ $ѣ0y$ _Cҍ(/+CQa fOC ?ضqW2'~?sc].OԜ"Lի;Ƅ-iiN@^aZZz. ߋWN!+>70eøtj;û`8XXCE|XB1i =}f9X^_z+{`3ya{ZlݸJ-V2 7ش'wvԮN\9wD # PT;UU~vӘ#@9˸1Kg<v
n«{gqnHg?!#\_
0U(9la
'{c
FxX0;;ZS 714Ǎ-`aBgoyԄ! pit=<}yQ/DE#>1B#"}1-҆t"3&3_N8QؙgsLg <DR!_1h!:ȣh]݀e'ch1*0oJ%NBqhZXV>kfbk<'7P$L Ma?AûgkW-F{rb9F3KLؼnn=_>I\_?/ krh\0k-3&b\Y.JÇ'8J.x&s<Aks=ܝ؟@Xh `?OƏ(M,d%
}egq@ 'rL
+u`ĆJoj^
i*1( 95>Fp x9A72E@hLB(.+E1[Uu Q M˱z)8u08{:wa9H,]O6N&HNE*MClB*2 K Oȋi. ?{ '.L{v6SF1A\9E "7@LpbCaojEr~ϯRb#0r3v7heLogdoaj]öcNҊ;:q "Lv
v ڎ
~6 ۱& s'Ɨq <q OӻQܼ3 D̦
0'Ois&pt2 }{bҚZ0{fvp_ M .x 42pƀ1YL忱Ï/+ܼybZr$,F giKI@ 5YRD hd'cbBl9oYC
I]qZT
[>f`ŬXD^^5cVMǡu^-:MƶeCl]X kWlm#wSlӼj 6cOޞuU(< gc27KrGx M?>_^V%` o?
wo 't Xͣ<i܂FͿpLX$@ΣNK, 8.q\:01 A0DE~d,k\ Ɛ)c] !zJWS셒dYMA[gG
"rԌʈҲ" WKS=/?Wb<Na^p6y~?qu4wCq4g30 n^~wI$4$&P_0%~n_ə[p^&"E
NkqK$yǶGbh CaAӬ0T|
RRa[)&3/EYX:cftzKxhzlƆe8@Oxm9Kނsרٶ[pyF&;JO?r~љ6.w8M=pc5ṋÇWqae{@A||7.BeY &MȆf04U2tnvt6
=]`jNL ...s!}>l d9#}9,,B%\ oo/jx_,^<<)C9)1)cw[|!:yF)Gn^ < dPwS˦Q
1%7k+0kX5UEQnkoX mc)vw.[A}9t-+ql;jo3 hÅ#p(M 8}
N ܈(qlZ2\[0(n`չqvoYK"7rħWw9زq
l!:QXEYܾx \P/!>* )q4b )dJA^V"&.b ]1E2yJM@AF *
Rd5E9iqXJb,>RO~ferL,KCzI*/) )a ChbmT,hkZ/y܆I]@vEnS-{v?~z Sط'5AbZ\L~\R&+0ctx|L ytz% A.X + >. !ogEH:R8 {[KT$73ht4/E$b,^yӪpjNEc=Ů5DٸjIgb&,hsWêyYM3{ ӲWmIUjZ~֎ irsx|<Erm̞{#{cXDaNܘR ZYoi L`([}nba 36C4A ֎pbPbQıw[; `"2. b *
QbEN<oG A7
__ ^`ڥJJr9a-';LU؈0Q6Nf1}2fOuhXXU磵woYö
v8c q܊{ c zf.ލܩ}8 ]ric;i>I8{t;E ވbFof;o\?~|(+3鉜:qhhGǁ=)FT xxqQ|x>HOF.1
т u)D2*0SkFa&1< 59@32s(V %bqEr!EDj\
*bZ̢a[|{nj ʊePE"'+kQ]=se| ^NWTTXRlذ*~-9^<&ad|"#ܽ7o 嫗x ߘ` 5+OBr>W;<o !q7pVsn<q
qM ״WnЯ7 QQV{кv :[aMĂ)c0,K1}ޱkʶa6lMrv<UCk?6rv
鱁ضa9p lh]9o*3ܽr o^b ^?{Wcr̙Z 6llL}- p$
d Sm8;Q@Є@چط=&b? fmg t8Xt%Jߐpye1*.aшMDl\"q쯜?~{~}/_^i]L^\J)ٚcˋƛ36s$gcZ,Id\mc1xj8}=mhƩ=JQ;q,~q?.CЊgm8OOAW*GwxF Ic-E^lr?z ?|6$]r KMO*7qq{@^
qsrhĶ,0Ey( c1}|%zV Ƃ)WxP ϖLV"!z%;ŅQ?q,&Rf$J]Q\K1 4̟X PZ^r;%GeDG+gaUc=ήOWT6O4'x};8rߛ,ge!93酢b5ׄk}yCJsk5x$^܋G g܂#?#[&aݭ
cS^#{ uJlX6OHp<8W.͟F~rL;Vܬ[KĪؿ ϡ)\3'h$S哸rh\=`t\1t$nr H%4IΕ=UTXLX (afWsS]3 &f|
h
`nm SK g;X KQW*JG_'C ۡMLB )/R/FD#9!Ey"<O& e<4ZvY~☚1}"fe9FPO"
`;ko*Mok 8{|
~o-j[v3I8x ߋ'̞-q v4ˊ모V8
'qn ԯ"9C|z{|/cΉ] 8v7o+
Z | ˱ZC>.%*_X 9 ir'TbBe10^L^{Ս`Ƥ2/.NPƑt(:7x~=jY5|m=BNzJ Ӱab"e^LN(/ %/lbaQQFQЂ[o_~=<ȭNs߾z/ ?v:SoxN]}#3'A|b='7 HIIENv9
75ک|d'݇pW$z!Z u%<:o+volC#}; #0 {ؗ-MSaLQN)eLQh]1 6y 4ϟ8I=8<סsl9 jK9xD?w}˪9s r"<^a5厕se/ ɣsw ; .c )̩` 03U>
ad
C04ւ-u@j NpJ"&,ecs:0N8
bհ_kd|j-?OYiG
Sp >>A~8 ' Ċ<<dtH;h+%8z2q |(Ұdn :73ye.Mè$eSؑ w.;pbO ;I1)pǭ틱} nA"M3[˃+pv<~T>}On íKp
ɭu~~ܾ.Mٝ)JOw#.8"9 >4<$EnǺe4$prƕ >ᵳ{)06D` 3#}XGkĕ)inOy;"ÑGQ4|4 ^N6p9u3% h? w? mdEI0)U%4 [9CY_m\Xli]7/ ?<|?G)иx V.]HA]h] IEK9ķ2pفiU$?xx22 VbղrM+ okmXpѷG)3(3
I 37
AC]?
gɫbUA蔪2̝R ȹQ*D=EE3y,b i\aд 6`)][A̒c [8cwl =u=/@DK+ 竇i@Ƿƙh[6EȌ1lٜ <l`O`nGK v' ,h l=̬0`[f2#l 푐 x9[>> AHx(cbMĤT%g !1 1LK_qokoc()CFf
C0:'G Rv
4ƚ$
dF0;^&a8uX'M}'.P\>Fq7.IUWOxz )<{ w(ezpf"iY^ǷO߿zÛg 3W+K7CKl )-v$EC)ŪF*(7 \ƭkgM|оPS ePT3C0bW_>&j5Ӂ&hyD4NVz0Wpey%(+ݠ2F)PKvlf4UNԠ5"[85=- %ֳ -&
y"TP<l؊oR4|b_~KgQ\]0 (wn݈c<qN:?~? |I߽w gN MiTơKNۊGw-rAF 0a?c 3}=`Tomwbz%X"gPUF8gK@MXj!6]Ս9vaA}-:[aN M]
er][UOyq|&
ͳw(,+'W_<o kg)ܿ~ +qdF*07#&0# xy'.'b^<
V4 ΰ!pKkgSDXFL$ /
y07A?vo0
M 㑘I/ҥg#(OGrrϿ_^ʕHKBIQ ,Пm :
9yk7ʕj+`*
[vlZ4@Q ^Ûyw f<z-˧3^OGg9<
os4d^[ue|s8x?+ *x~1O/뗷 M/ 3#||_浍Xb)_<ڱe0 -e'd7/X;ÕBYqϋh"(
0k
Uo
+
8BoMĽc_ Uſ4tG(CO]64lľp:9%^u ŝbKE- 2&xx~7xz?p/[0Chر&{.ϜiSp!?~z+]=w{wv#hd8ęql&\GlD dǸӌ4`.c0G?~?r2BU>^rZs
Ta8,3o9"G7̞&4XZX[ !ٓP^seu%8w|\lgP/^=CVkC]c ^߿wݝGfth(?Q@kR; (؇ nAMi KC{gW{ n
5l
#G2(ɨk+C-"<2 Q\N f! ^8iraYq\93twP 2lhjZ5rڄR; ^ԼF@̋vf&?ЅvcKAl\6 Ь=̓xvA2~xx ^o>Ƌ9|yo5WN xr0>ܽ*Wyr pL 8?< =ǧXz6-!X(<|twƳ`nE
ĸ2 *(Be*_#ir*?bLO&pԇHpY_l?uq29F+aHUUz@Qš/tGW)<aN`,V3Y 6Rij(ӠϣG+-A$=zH0J(.! `ǎx)~3E& t\4.)عyB̙6SǓ7? p]ȘcK 8o. ~߁Pfp7Rj/x3ۃs ߹ֆľW0x5'V~Ԕ
hm^FݿkzT*'c2;X:;Z`՜ Le<6Lǵ#۰bV
/+ƕ&83 OԪ b}܁'ʭ n[kp|k"W7]y:STkZ>M+f!<2m} v4vR &}8RחVfT6reAQqLVhoϘ"*yx #>>Q0HK=@[email protected]{;,#ɸu9rs8 tLP%ObЮ2 XDQE<Ģzt/C 8k=Z@r\;fk'n݅khmal_́#&<uo Ż'(NұMyr+^3b{"?OD 1<<<~y{WHxx~#$irnbr7efK,Mkh
ue}SHsrpO+\])T
u(FW
H$ ā!iHWS!1>s EPTxnUTQ$G3
xZ }(@{+y4 (/+dc 0X$% (+GKw)7<44w 4ǂѺ~5uf2h̜:aO/ϟSx L:b ںE*9(/ ہ]DKfX_\< i<ĕWg5Ŷ.ԔT1 ݟBlq+).+q ͙FaBC3wf Ϛ$EOˊBSeZWb'ޮ8 ;V MH`wa;S-B$Dj+h<f YW.5xlEDLڹ 3!4 h ܜ +Gx#0be4$~{ ) [shh"5RQ;c)(` lM`g`pG|b
_Ȑ˒""("hW xW `ɲIEcou/|I##8TDjue\ʷfl"]tP ʒy"75 %9xt8NkKc^jlZ;MEV2ܶOin7?'n7>@Ls~~~zFq'k+xj/>(wqd{ E .=M
pwv`y\i0$Y aIgl
}}
!ǩ1?dz99|i",3='G 9
iQA4ΰ2׃><R}< ZSe \`n k?댤ё\wJ[BqQļhbuA M&,+
Kqe33͖5rkɬuؿg;ϛuQ?i<jUm
ײZ߿x;8ڌd
QcPU5&}"9 v0R}H ǧqkjh()#titѣG ()v6Ȣ15/OѰ+ĆUi)V/--
k kб}Zdrz om{p?x40=xt$6,i0;GWS^кb k<|o_ G _kr͓g/'`>y-\gqaM`h ?m,,}n0 IgH VYAPgﵰ4 b4E9(+JQ\ h*( 48Vi6BdAdT Hdddd\ ?b0$ƅ#-9fznW_?Yi${ED`ZL c˱N. S'KMg-X [GCuXmY\sXVbZ$D8c* F?[76ϏѢb[|q< ٱ ?=/ef>>>?~}m\<qPNob%k4ocT0<DžShJ J>y
\8Ks
=-uXF m;K
|38 z2x>lGNM'Zz4
ښJj:d41I & ;cjӖI{Vf.(̑_8,.&ˊQT^|ƇB,_ _YzK lbҲG?zv=`4cV _02^||nBFh yz, IDATq5?
GPtx*DB >ڍcۆ5PWO/jûu};L:V-ê% оfllgn|l\(ȳcc :ػx??Nj-o7 1_ޓ. ;c-[_ó'S1m98Nny 3wwA[+bޅ}K`-' ˄!0e-d325[tĶ$ +(a(͂$F:cҚZO^eIi `r.w WXsHyZ_ZnB DGbʔTEió MByN\M1xrn*u# ьݻt8=ǣydmC)V/c7ӵ
~~[|||
1.߾] x|zO.ӳ; 8{r~`Lo8 _Ďk1on
?&57[~=ipy|s\t ::gM`jd] k[@ [[k8;"b|x R%#bݑ(_S:1r@AGќiE|rYOoprc7|k@9XA(VP(,' Dž g?E3p >;:1oԍ u4XL<w~=[1kLvl@BJ<td\Y}%9~<vΦ0!(DF>>bkj o7g>5hkhw 2)}agm*WP65bŢihY=MԆ66iVP n( mX=˱mB 8I{gHWn؉=o]%>!W w? 'ĥ߿79.ŖW ˋ d|/'b*Nq7jFw7z˃ nN rAL ۑ
`j*L _M3BCYy![)I[ :G;\mm ~
)' H=.Wee/{;,xxvmk C
FdT4BB`BU 7b40cƔ a\eƕgb:HKز\'vL
.t-Ƙt,Y"/7 @J:+1"뫰mtx{X27O wObwr̟Tǻd1 V@ (I&>hwnK2eټl[5K]HIt\<Ha= #cPqUa0T
a 5 5U6b_p4Ղ. eWp{X٬`0r8++@WU*o3XSHY !
(?KYY}
_o/dLL1,H ZW5.K B|~H sc=fLX )4
sfLуh?>hx><jFipvt623PVRezb7jEω2c|pv#h]Oo@mc`~o,_ 쫖 aX9@Ӱv B'[2Uصi
p"ƿSK ];WN\\9 ;WӻIi 8EsgxDL ~t mqh$:~>
?}}Ms xwȷ/M(K
_SG꺺Ğ,UgnmK;k%!/-fۀv$.G "$"# H--& i)ye'7FI W лϷπxLB͘QXH̨-Ȕ5Z(wPLX(aӺRX)aѸ,5%&֏C-ƕbL8 iAغa!ԇC!>>2掃Nۀ"8f'Moaxk)oQ|Sdϟ|VOQ͑0;7[11; ; E0eȐ^PR#:#~
~{E*LuaB|k)d_ S *Ca,@[ŚFi~:
㌪"cz 1Q (+-X ((C Cn~
1"<w=
1gT̚5'O ѣ0eB5O'3 ڵ Oh4~xAN
!ZPb<27E^~xn D>kgpJ?Fx4ځ7ΠyLiL,yt0x2z} !
HMMDG{3V-%W,"ޗcu:D>MM\ۀbW*ۼد7,%QLX ڌ:q6\;'(nŵS;q^b%_\;g([V&1YX
^Ќzt _ga\,WKp\@1i ^]qu^ Pvuu C1p0 Sׂ= 19-= y2 DibۂhRLbsY WE[ObM AR\"CrP\(շ'c@J QHOIeV"Ņ`Lq*VaJU6n#Nk>B IQ L d+}|PgBFfs.l/*Rƕ$(=[/b?Q]%l,'_9-'t&W;}X0s
̓Hxo㰎/ּ;Z$;F\nc߫JA; (_&j hɒ؈|O3hK!iKD rA<e&ek<4",MuQ^?W_j
%eG?+8ϓeE("" ٹ9dX8g! ܽ~%w01m8Ujǡvl?| ?>o^+"'3IF
#? G`?'K^]z,[+0P
qu gD[fFP' QB^Cѭ[wBEش a iRt^~ؽq-ڨ _|}
lp-vQƱ:pV\>gmw܃;'wo߷aE+w<^'ʘdxÎѝ:?^~ 9? ΕXH:r%{e(h.LLH]7HQ *Z4 4!.60@
c` ǃ,0UlK[U~xDR3+' D
DjJ:c3?&ߘh$&!8 ь u}{Ƿ??_$Q;q,jj1"q4y9|z & *2EzPi>ok* gzreqÜ8)MBd0'@M/=-|Z}EbjFb__WfT+ opqܾu Znb/~֕@7㛘Q_c`Ϟ=C[E3ÔAy
tS}mMؚNV5}<ph zbP +Ɔ:4fru) 0X$gW |E nݿFhXxqQ@\,))TPVR3pu"V=E` rz\<sVɭO3&ġvb
MyC%Z6@Qi6"`ha*CxC7.Oܑ=xt4"ma6ڃC >=A˧V|hR#)^:p |-I\mA?+a4-s6QwԒޖ%ضf>wM+phj ;}`#Nv]wqv,>"'ɍxƶi z| ^=7d/V) G3 IJ<=d /W\$p++ޝ<=aM}8fpp w*raHM@L.bUBhh(D 鲉QL ; ?O [dHÝ?\Sg$={|`.$F.?/)GuTWP$l1}| ,L=];(-HE~V<%tZ xt ftKMBia**J3Q5 irߔR4-EؼvhCv~2Gq@+͍#454D7gJ
-.Ҍ[[r.hݡD9udɔ=x d8{SDכ4B(eP%ȇ Ё|| x \Q2LaH_() S|(` EI,տo/4D}
C@NF3H(<YrY0 m
i ƥ3+k ߿d@ q>*1vLV3_OE'P?qL1bJ3kjj _X$zt́
$9-em/
+M
KeCCC+)c(CzCCmI*+sց
jV.Dظ͍ѴY:[^
i&vĖ ѱvlZIAN=S&`<_$AY 7/Wܾv\
'Il'w69
ij{"Q,u/ fME$ 0, ~!, AR8xySĖr)_¢FQYplĠ4~ llM`fi,X8<<diňxdd=f4ٹBAJj
ECc?:%A 41$MOxy@G[__4o)˕jhj1pS:h̚\ ,BDb_>Q!hm@d#/5)R=]L1/ C}]1fN*EQ 0g̬-14 Q-Vkmaxrpf|zq
N
ڪR<yx ݺ@߀M"_ɧѸh&.?@?w)Fdx&`qu-zS@ Ij"r>y+[5rnAaP (
}0 C^ޝ1CԌ xD0Bm
X= .u}5 Us%[33Rl d"+S$ E>[^AlK0et<彼6u8L밸Ǹ2TdaɼsuOp_X't`ab Dp*pV4eCՁ ~!&D*+|cLmEQ$~?DJJB\d.ZCE0 [V-B'U fv-͟s'y$,E=YK좰رa\K1یt 7;Mѵ [c\j^¦3
<sNf*&o c;bѬ13c,2ң p/4XBT| i} H/++ 9yD g"iV
xݽDd%.4׃oQqq#HihEΚO[r~LF|#QapEd` ů? WbK*2 e +j)."56i1>; uXMK9})hR#hJ oZ$Dx<߫&R/LEY^ JrPULNYغa1
RƩrRpvܱ' ߋ
g ~Ɲ|Mk:|~K '?
9T=S&ʲa=uC?r~У݉_a$$";NR" 2=k o |-_2tľX1B*Jn"n>~n3e((M rshs$ b8%4~Aa
sK0n ,<JS0ulXހ2U3'rw u\҈} w A^F̺ܷ
7 @) UB['"k˧Ml^Z(#fan-!0Z*5> Oܬocu@Dzغz>7-B:4͛5sjaT-zbAX> W
8{=[;lYګ:<w:l,.5m8ݍx%V\VaɌ*;)+5P78 E u@ǒ>5
S A;U"Io>2ȏaחKݩ%ãّH'sFcT(×,/&Ҳ
wЈ0j
Kxj=iԂB2z}rhz< S壦,LAۊA\JǨhfR dcԁ^xib3&[:e9(c
8D,[2 m
x@oX`\>_'1Rk1ًS&ŋoyض[6/Ǻ8C,\0/ M]Cf<XC#<nNn={R!yG1`P\j=/y9_u2}PŋWSQ`lU"
_N>( ۯP6cPXL{? YYYϗQ41Y[? ů= [mQWW+WcM W3X0 &6'2;=HL:^12GTL8B
;sr
:q!:[De FO{n='.a0{{{p<**PSP@ƶCI.m]砝o]C VvULr83 -Kga*v6XVMfHN?L?"O΅bfY&c4 ܸ;c23x{$>ӫ_:{}r bI?"+#,,=~$XG'bX\\tua _$$D!PLupttIgzz?/FNVT$V&7{;,̕_Ë? n6ԧ) ~Е:| uu`ifXL2S&Uc2r`RU.&Tdc
̚Z K(반A}ެXd:1p\6 ]8o7LF;Z3E;oA p2v5ak
:(fӐ@ԻX;"!g+9uk#GY|z\RI\?,lǹC;Y
ӹط A._g bVJJ:{(` S"_ :#GȦ#JgiLvf:p0ׅa?YNq,_/J )(PT P{*aJ2њ PQ `
w! KMI@^N*3I,~ ȣȧp Ogε6iSuPE)@bф ?߿ ? +Y)$ VN+
d⠕CIL
*#=p6ܢ%
X06&6A
GAIañlT gՖΑIW4V.K( eݾ{;VcO
ٴ
9~o]>3{7?Љ#[̞6?+hxN d˗.Cw^(߹$ EÐDDPX
B 0#02J> ǂ El00 QOQggp ?< Tg_oYN. I A\J
ӑ
Ȣ2d0bbcVpp_V:&fп/Z$5BK}$cbviԌɕc3Q5X2sӭhY;(SHt1y>w JÕӻpATQ(kZƂ@;ܹz^$;/ذoDi֓5|y{[^1T6CH.NUDJ "C;IOиp&<!W^puqOG~(E!F%Ji+
DR+Ñaܱ2 Dzn-DWkF@Ero)_BUuc}]0\2 % W_}KB
EZj2
rPRĸHFY4 b ȥay>>KQ0'ŤiuXފAEؽ
H߱sC}B``K[gd'cVu9OQXM!/ Ӆv#&à9½xr":[ȫ)!A0RaۯK Eb9XD`,زd&75`8ԲDJ &Ot-pbئgvƹ=d|`.nŝMIpe:n[ یv xy0ߧY`<9ÏOchZ$P#%>1̝<@SS
@
wg(1E kQ]lQp'<| (O9"- mMx d#.)^L1OXXܼb,111'?c_d\XџԓM
c]ci !&xI5?1 G"/3'c|q ͍`+&[gm&;.WŞkp },lDh9e)6w "7ȱëx ZWz7 |z~_:ŁNۡcûrp!)on{[Y
["ޕA>pq6(UCEƀh=}
h)bĀ|omG+syQ225j&
9R}w=bPE Q++#U)0}ʪ
*`En0
ALOEnf:ʊ+KcvN&PS5g|p s)tM iY[1t
VjhͲ6?lN53 >v)cP?y"&b5±8u`; ގH -h+Agho] |9ÃYy8gQ+ϷBbNgbbX4
]K뱕}c`Mh[H<'s sgv5¾fZpaZ=ҁ
CooŃ]xvq ݎwN˃ yyp>> ;GiVeV܇EbE
x!!H\@` B8%bk#*ij;\=}?7_,}1Q(2ȉ@+ҳs b?#&I>¾'aȸhbZ$.U }?FWWO74#jLǗaJu&cL~ ֕b 3'bK"]<o:, ܈mPoCXhLTwpjܵ>
!~0];7ӻ[xB_MoZ6
wx}ȧe|_'On?>
?u8vM
:HV [\UmjsEr(ѮF
0Xjv%eb_F0d35֗+ ֝l`M시fmH7s4S+DepywM}1ǀA0&'|}e rb b@.˓('gdi ~|i^յU6}7_Ld`65~ѱj[k))I|⸱Xx&. މ;;p;[Bm~w|zx
˻~
xsƄ̔ypײj۲4a6- CSI4;F?Nqcn\[ְpnw N'wisq"c]/l_<?
/ ă3;~,~zt
>; ǯ//G'i4/o-Gfb|J~ }菂@X,3 o+e__IO91B̊I@M`1) 5Y &D"Z?!!^>aqd-4khAn kAn$.M WS*4ChIlgf*1kxa(h]Ea)hu= ں a#l'vِ?v`Lvxf\Qܾ|fv4!<bx,Y\v`F= i&xy4
.ôic`hj4~ Ngb[óx s EۈLTeTG.{M->V7χp%*A[K A MddqLA2 a$PYL<O
3
Z#A* SQ
[OK0x0ffr!У`7
INEzz\l(r9r1cz=_>c0tL\K0 NŨ"|䢎"@_?=uH ^=QQ OWWX;HKCqaF1JK) jqB_2 KgT!v&2ӴASf~1*/Du5F2(d
_O4LA©_8
iZ8
Ҁ}mKDMQ#Q0 )=spDvNpQ"t`\' ނǷ&ILlI}z7݃r_ӭ[as
w'&ia HWy Q 2ٙo7""Aq*py
b#\\Ʊ 0zwxRX8Ӝx1h F"iyȦQ- 2Q$[
˿ǁoaUm]hA]#(j5u9U18I44HZCЯwxYWi+ټ+fR(Ԡqhlns{[email protected]?O pvi^; {qfuxx( >C'o[ Ē.h#$J(] 0txr ܾ?D_>b3E(ѵmS3 ѓc9]:bp6X҅>
Ԇ@WOSCbe
SbX1 gC D1}csGiCE}$7Ôi CWׄ?HWC _uG# ÐG%II1|:%@qq2_^84J^8 SAq[dL|:G.<YQDī&Eza̘x9Y6i4gM𰵄6 F >ΧX3GvЮX4w&͙
F:#d<H @o@gl\:Vسr6~Ckcҩ(jwokƥylMk{qP; ݈;lOmaی{7٩.:/鏗-{^qo 4?//Ǜ;ex,ZIE5,4 AA$k 8\OU 0Ǒ(hoOOwB f60wpW |)s--y:c˛c*1BQTg HA^~܆0<?,д 5
U
B(U4աqŁӣFs bj5-B9Xpf3h'>c{q(J
ph\8;.Vy0^>OK4U݃q<%ۗ8&+2gыgqAYBQSLlRUf&Ťxx<~N}kَ@_Y_9ZZ030Q075(i # ~HL`#&*%94d_ǰ#CCBp09@U]4#CŕH#AG[
z}6Ac1|8"z|>~~v5F
2ӐEOOC q'p|
ǬL 7㗟^
BLX!ϛ3rBVV&LؿMoޗi~ .B|P=ZlC)`+AYN614-]Da v#`8|(<m̰ejh' K ,
bŕ~_X {)ػ|kf@l]=;|J\q7h,o#<:։';6<" c xyz^ o+{A|s5}xvzo# UԹ0"4Q
;W/b7-14 rş `iL261i;?xˉX+Oqa/{RK#./)CtB2Qġ4?a M0Ț֡Q αeL^E Z:011C}8W0:t"9rhlj^+p(l[[ j Cg
Me=ø|] q|;u"]b32})xz8. 6,ݳE|}Mܻgv(g(WcgO7矟M 9vn]O`f##+*BLSB_*j2?0Fꎐ+CijS*Q,+-Qj2q HC (L]`0zv X2\I!@cŸ-0 =m(BN~[!/Z8/& ,Waʢ&C~mM5{ ~\c&fx]s7 HI/7o? >Q Ɉ.u2
|ihJGa (+P?qB,L7 AV4a}g}-Ke9. ڎC]0x,7!ا7Նcz$7}5<ѹr1v_Uj]`[ l_7{6,ıjF\n*% g>Nn[x9v5yb > &ݵxt
?<: {ѼWbli!t67& Ė qC+v!} ĊjCCGcO@4:* prt..U ZQ"ddd1]s7h8g@:r߈W&t)(u- ( n X~X8ۖ-Bڙؼ[cI}e8CQi+ѹnDپnZXC[ЖF&\8F(4n߁DIM8s5. ۄ{v v 2a8MQ1"Fjuw
Ožݏzf n\QH?xF.=;à
4Zɣ ܋lH?χ!L SPTU+dKc /)/Ǹډȯ2Dd!4.~!t ݽd w;xÈBVfՃ. 㢑J#g#KdJOOOFFz\.>s&6Y)'v fM(Wd3dfEN̨)CJ,ů ,C6&pMDif<F&
DTfš$-
a4ƁvBTj 0,K0&?<o4)1pujz", S0# SS|P̌
,)qhIŪ XYcvl2jt`k}! .m^&Zh蘚]sgN *iY蚖ӳejváR n@۬R̘(2!A &1 l41FA8
5yD ~<dU` _Q1$xPl28F xODZv *pc U= k0<+;$%Ic_ q s $G%
PRTͱ.M\;GL[[b| g`o[@L/=* Ǻm,lXQ/W Rn[`sxs|ƀ58{ ;pxZ@d?{h,*n3ukya/FA{
H 92oo w]rE#qKBZO q{%#@ScLMJ>#x#9)!>EYa~$.Z8cV_0~xT L1Uhhl(=%5(* +3[9Zba #b41N$K;0F-;ֶ6HHGNv&I?%r -#YfJOHDݤ K)b<KV-CY8 &CL85-ý[WH1te>
E #
an0 $=iH @r b=(_WE!&i8$GH#i1A2?M,}T;l1? :J/䆺#\PꉂOd*) S0$>0LȎD]~,P?*
XW||\j0ǡ63 rQ1$)|Wajq*;sFe`FQ IDzh_Ty1TqK0{3PC@80nsXe c<WD""1x`J)j < ~pbbJ.p=lh\Gӑ/azLVycȡigL 7vOh,\?ZԡabСP&wq 2h(w=㱯MD.\k"{{([cXX (J䶤- e,8wmq~< vʲ[rg5||vE/GsJ %n'G̜6
߾~7.)d!mOA ~1\_K#@Վ,a0RVĸ2R DyE ΛNǾp!z\&MC*q/DUU5bZ|TNDi Bb-[h+OrKOLdľ(tuq4ami8䠐F "YLN+Ye1fn|fs YuctTO,W2v]#^a `mm} SژCA;z<4S^r3TƪTޏ
pANB].+9"Ŏ I4^ 2\I'{!6ގL"u#Q( ']P(D)\{Jj30e`Rv,&YeX4>
tuVj0%?(OĜL%)yS,hmʹc1kR j
Xd3FU$9$ə+8J`-q NQG w@ľoH }qQ2=m0pjQ̙)1u L2 Yyԝ2¾'G id(v#ԡJ766cawЫy8زN 8бR +3/ݭ2MѹlVymfP
;P4-KpR߳ZqŃwb'jžExLi2~~v|s Gg`\Y!Fw <1sev;w.`le &Z[hC]/LaiL[GCC
#0q@$҂9(t|be'+, aIx"τXN dS[D\Ҕ >hi l ,ahl?03DA~~.vqeYlEHMZ?y uo L; gäYSb:3.cTy%Mg6-+p"~P8R_ N0w ~HOABbܚ $8,1 f(F>9: չIHwE BeD\h0lW?}%$z#9 ~HwB*(3nȋ0Qa BlGfFE(13tRO EnOdLΉÔxLK~ \qrRc10
*8LX:9K&ckI7
cG'))iHJJE 2ATF{^(Jʿ
+D)D__?6YU VG\qkdA"_M7ctL:ôieLMcqd!án5] 4HS4h;64Lu0TQ,0 F`|q6fjsinZ[/kprZ f_> låcbEF9ApH; Փ||nKq ܽw/]xpe ]݇'.e{r0v҈%w[Lv607M``j
=o=haɧ@RTeԄ&,2Uz33hħE =X\_BEzVj' " م)LQ;f4R, 13a#BO1S3c莀<G {{k
+:Ù"<W`
|jkq% ٳfOL$j놅L.$w_o9U&#G2h U '!q fw4B h + #<["^ 4> q!cP`r}7nݳ4ް0VKUC`>C<R#dsb9ᡣ =6e Xla PBx; 1TA
BTgDku$X@&24jlG=X>?S`TPJ3)ٯYJHD؎XؚϾv;lI8
)(D Iӂ(@6{` P ra OB`PI")EßqowO| Vr>}{o
<xH,(0>h %9/#]+{|lo'`R9axk\~xF\: WlƵ[p\9܉{gwv6.>Xށ;l $3O 0 ];{x qbOo 湲9<|0a|h39>FXJ}=YZzPa,
6_F4nȥ)INhu)q^?a,Sli]Pb{JU"W#xa yx b)3eMHZþr@R)
t4iX牠@?E0SAE=FfҌ:S y"y L!i?"' Y%0p) i O_1O qEi |_}.!H.F2 ւ썔aK̹[DmyMuhCIaEq
G;@&@]i&eAw ^ }}}
>A_(Ձ}1t %>Է;TpgPm>a2Ç@GcvH/
0P #!0suEy
T0ج5e
#
0⫊/J*qe ++W^~-$!:1bB.&O\itq\dU9%J!%!:.q?"~_̾6A}cA%(U"811Y.m_ F^~<sH!CjA)_sۛe7EIZ3 ;bg[EbV\<Ԋk':qvܻwnÍS:pf=UQy|zy? _܇7!qűBǺN,m գѰ`"C&@kCR`ju'c:4a8҈ <!<7\Sm-0SLA\|1ƾ'kPP<c'a GdB*i~+GXd" AKl =&2Dfb 1*&XJAG #4aLnWKϿ+]!!!h>~ή6#)5^^/ 3[X[r~=zg ݿWqyH p9\^p4Q"\d;#mx;z#, ľްȊpd
t(O17ۯ0W֫Tzw<y0ui^5*/b
!9FuPM jÈAy{(LG(T}Lx4R }
Sj QzTS&ÇAg8<u$$Q_ ^ [rꄪJkPU3'疏! +/t_^1RsxΩ
=_`L.EGDd,y jhX^psw-L`fa@
0YnY)2
PA_Z2jMΈh$hs<'U_ G8HEj!C`@~HAE&z0RPBeQ.6X o?b_R,Cת8о Ė[q@'n]۳ oߏ'wx#pvަg{pl'ߏgK!x
cr_>LHrPkGU%X-* (`dKn !W *+or
uDž 5҂,;;%4bY4cjBln_0T*D#G}(dl =_]DG#ɧK3;b64Xj.5h2 Ƚb/l#Վ );9D^*Lz `@Tīw/a$ 89K_/W_yf@z?x0K^o`zn_W_w B.Ub|*<m`gW 5[t Cm ȟw." GK b/2#=1yL.r0_տ @BBgw(}C5lpj*}AcPoGC#tUXC s>E>crL<5Wo$|aKNψĴZ(MlhM> %%%.GVFҒBOX]\AiA& yhĊ1 Zc\\(hjj K|1 `X.$[ ^+1w <Y-ﾓndo{Q$N
0e X$pP:yq^3Kѹ|v4ciX
M i lpd
߱B58w kf[6. lŃxM / i'DpF\>)H y/njfj@=\EQW[蚘`6T5ԡ<B JjjՖ
s `滑hÂl xmsQ= S'OEPX1&qAHAUxt0A14`KʋMafa
3U5( \@0HYEȦJPd[Ē
3 u#c(ԁ ih0%a =C^9zrL7ݿ{n
|)IHC%"]dpS an#-< `x{RФCdV5rd;$ZT߉o7ߢǷѝ}&NM$}[o}> עc0cﺣ { !={BXW(s"Ͳڠ9t0"Tb6RI6&zNä)(ٿ%H-FZNASӑ(2 9)DR98"b? lN. tptFPD$bS3'?:))HHь_x ȲEᖊ1+!+ 9"22##2JURb%u[
R{={>?[K5OLY8qkm߾3G##Aj)Xpm$ s Bn^bb:XQc1Xa$Q#1a$UP1}e Avz<zmuToJu!q$Nqdy<>>>~>oOw 㛟?" lgϟs,UWO7$
%QWoϞߺ߽ox
_| _;
j,H:":ʊ"47{J5s0c,L6Sسg+JL 3c541$y!ZenZ\F\ͳw ,hmǵkQ3˸pBc zHI\gAA
qyf.*H沣(e̛#JUuUU}Y>B5yL=q"1K=~ m(H=W'm68)Ξ GKGR0b$FQ6؛#F6a$ 3Yw-УBbSGH> qzndFAV~d DlNߎddR誵tj\K"vt 2i6P<^xÇ(ڀQ$^`"1jpd#庈/7l\
"8ƍ|$#0^^
14g 9 cؑ4'dd 3)4a^, =85/GF^1IГI23 "-'_a9<:B dJ{݊[!\ +j˙y ~!f!%Jj vJ9ymSHs쏐 =}=Fh#GÉ}v LW؟<i #[\8CO!ugڝ>D?_>6>@쭻ՇGW |x~_ ~1 Zf<eWO_ >TI7Ւ1s/o>Drbxq=b
rPYZֆ:ٹV/b
3B0y]6x&RIAؽuҤh~7Y$ IаZ<v,587k`&I+WL/</>S@X)fq~I
SGTvnK_)\cc8_D ;{'M")N
_kA&҆c'` ESغWO IlM( ?a2}$[LGƍ!/+/+#elP@ P1 tdv$i {w1Վ(~qf:S2tU0Q[UԈb¨ hi
NRQ|(Q\hn43DZ=Թm"+3kR !h Cp؟ 4s96O szLߟ?9ˈ< 'ˉBdTe-EFv2s4'eTqC.%I)((,P;F
Ȝ|~fV#H *
-bUjjj/((?Q醍=㘡@ K5[x[W4{t Y; B_6 kgՎ4t ۽:Є7Ǘo?/z@n_~|!~c|GO}~ |2{)F;]+o'o?FjR6]M; 압h'6oY+W.V9ΦOFȯmZ Fc%NQS(LDrL85DxqD?\8n]]O_ǽW֓k 6h6jbR -,-$+E:ƈ\Z q)ľ%X v*XT%0 YbDQF/ǩ6)('}rx; S}gM# AИ {Q#hǏİ1prG`؋1fLydAb*GRLZ} i1{=暈TK
BNEn&MZU#43
);a\廧&2Y8> ⫇a1<AY7m/m~(10n$G@[CO "&{L yw_
3faXJhLhg[Za* ˉ}td .?'[lr%'"=5mӶ{nڵ ` 9JbAm-b~*Z( 111* @t:jLy,w,c=`A@PmUoi17g"<Y rO8 $Rc
ؽ)$dD 9@DZ UzJMq*i)JAmI*epkr-PGS -hWQvgZ F
n-zj0P_:-Z
hELU_m*#(`磈#IeKvh R# }%ɪfYSrUto=:HKAF|,Q
Κgň^8уƀm͍:1EC4k 4f7.?f
>EL
JVйddByi8_D0?x,M$s㥏&+1.hSekV#"+ o{0mƱ_L
ϲF( " #|$ zL>g|l&Ŝ6`Ǻؾv m#w] kaضfV{7zq(Lݏ8y),qA*M&)T#P5v4h~cxb`ҭ_"T2YΞ*-mPŪ͝?oB]rcFhD$0TAEQ9Gi
2X\YE_ĴTDq<IzrDDϣj" et04Et6م$$Yj5: & < |x9Ly,QQ'gAيxNx1{Z/C(4({O 3v,pU{8ޥa"ݾ^ml_ a#:! YĨ0_y)(͎Š,'UlIiSPS$
lڲ 2Q[
.N<|_j!g'[ZFslRq.tlD GIZSmV'b4´Oz
#X0/
>3 ݿO DžE 79 ^S-,UYnNt6ڹAUe!;w00;[k+Јx0 X=[h Kҙ_Վ88.:"ڶ+Azr
HE ajYXmby"8nO <y3 ?e(\S0w9_?+B&`$
*0f O0B8po0t nj@ m `ژXz#VY bX :kC`Òyظt Ǧ~ = Wc8'dLhl]KT^$a;l`$bvI$cF`;fSADR=ǍD
$ƌ|H i8YLĜAj}+)6Z0k2t筍Mt*#+(56;V
zd83$\:$<'Ī-bh2RQ\VŁ4ŢcZGg0`E9O!v4\l:Ԙhl`kGCK+n7iJJUOa32m泬A_fT>e0B*<`EՒK`Pݺ;˖i
ۍ$xY #H9(sJINb.,/ y*4ilr|*
x=Z^7TdɃ*9 Ȍ "mZ?Ն&
qndsa_/\0a r3aﶈؗŋfu~95cӺe0iÛ7qU ٻ${qȥ[M-/BǢvr${& u ZwN^Եt^~X0QTFBXTMAdd > *+J}ZX61NML5ǜ &O' 9MpK! 30{8A3^
h+c9qH2=qN)Xr ֮^M /u2CO[<x¶`Ղ\ ڹ>b
چ-bPHQqΛNJ@L =Ng5Z2a/>8 C>ju> )a> ?f4q>y$Jz<{>L]q )Ab[4woٴl!V.p{rvzAMPDiM g j-ѡJ S$7R,5AE%U ZPik
UeՂ~ BS{ۈv8=>RHTȟ~H4L8& hfL J= yI1grPXo۶6#7-{ZXwl@]H!!b_IP2;tjL 3a(Ɇ,lj|T^O8wQ;Peג 4pVCDG .zQ8> 9ɨ))g(?{f02`7B._a ?fk£qq ݍ(dKM8)tV ƹjIVOK w]`ჅBnrxף&zͰ:WX_kt !!ďrR﨤XM Ԓ`{r]'џKC;wPdfcƲY3\wVqO8n"BƇ`)vx"$P7>}>v0 M$ '&؈א-zŵk'/b_`ۼCvnîq~ >ıcOVꅥ g*,AAL! <ܜ`"x~/nyq<"m<҆ 5b Ĩa/L{?5h<q/uA`9*+bŬXhs̯\ N47OQLi4茰fbVB `2P[وjr~i|,=5M- ?z iRXe6Rw@did
Hր\& @ԧ\.
~_
$@^/ v ,O9kEˣ̴QRƌ GrJ'3 H0vd"0 s&c@qG#$ۃ`i<`D+gLQ aF-a^<` lx
TbhT,#ۿs=ʫ { V$f5>Xhut2
8H!3N.;4Jg{<8;7g7q\;2 ~iQQY
.z?zۛp
z7u^=sFfw#$
V 6x;`4s3`dVq5KW/@h⩑{ql?؟4V,
bS06F%hҳ~6m.j
IHuc&N(>7};jD UЀ},m4Ҙ ~!BD2wL|xt.`dOډ *]!<8$|16-tN,a1&5؍RE?Q"b4uFp|Xf^u.4I q'`" :=c)j3dP,XmfΝt2hj H+F^IZPӡאHhPE/hI) x-<>%C)B2.&$\!y]C?c
9$)iOQK^j09]$U(Q}X@ J-ҕԸ<u2#0sEHH:$2 KH6n\q4ʣF'3L N="E6?~|0fƍ|v}XF"㕐{ kycJ{A_: WVcQSM:z<zx
7ǭU_ء6e,֯<|p Yqx8L`6_F<yt nC\^D ډ{a.f ]>t7x/ H_&G#,<oI$ӊZ^3829UA^FZbqؐ`jFJ<Rق_|k֯֝;)BOcbta1Ha:e4پ3sa9 !F173|lrqI$DL{1Eˈ
؇$g -K SۤQ<CgӂFbjH:o:tzrƌ7}
vq ɲ1}G? #HF VߣH ƍ#K3VrH!啴 cHB> WHDBx}X
gN
%&c݊9]&m]ĵ9EH-.C&I6 uvi[98
$R|\XHUjϾ*`מ v1HCvA KR$+OY1}G䢊pSLodk@}S3E2{[^:$CW`ޒXj-Bլ } )+A&DR(I((Ŵ6 Y O"'}MF >lhs4mmgm`] l'ch8 G|OmY@]-6'aXDAp ܻ{ wn^".
IL+q8=d<֯Yf<~:
Sڅhe8/Û=:BO 6e%j C}]X($nܼC`{ :6Qe5&h-., l)ԠTjIp9*`Xd&e4D+ۧY
vm'}0Q4x kSǚ 1i6 /(7#c'aq5N `q|,DL9ef%&`$q?^`_f{ݛȾH;/m*FsΔqjov~mfPhHb_y#(G Px"a'~ȱįeZI`E9 G,? lP$/Dh[y/g5$Ṵ
,%e9 *=hFQH+"o4OW\RUDC=JeE ݻBJ2EH$ R2s
I_,(B!>9#cy^i 9V
*kkhV 4`Am,9z' ϓ5ˈQ)5{!$d"F_ Ix#lظ~2O!d'&%F>F1"_ O"ljc>1 |,cfx d~M{l^W-v.eTT **f WMذ.TgM "W@O#^~p9x+8oO =[W^-ܻv
Gp"j*ZakooA[k{:ҽu0{ap5`ǒ1TW5/2Wmv?.G-Bl<8U4oʔ)쇑/c̙3G $X B
ђyKlN&G+EA'uciC%sx8ۈ?5I 6m"q5L B܇L-"g d|rU@ 0bdP#^x1njgq O!VC8dؐcć9)~_(صĸdC8| ^ 1y##]O0D["}5 = (Hd 64q|]H0>#?CP_sj<, CDM8΅vl곲rl6M%Ņ*AQBU%~n"]8j RKdD(R@ dyd
s"٣+6M n7ZzU0A>/֬RiVa%1g<S0M4e2I&!Ps67oV:F g61b f&Cx 25`1&' : >$ ㉘6DVx^X~/I
&V-_ ]Yos].sz
%6T$$x.U@[S
Lj 8M8ׄ A! чqˇo
C(Aba$ Vۆ5H4{lAjM{PW 6hM%(@C" ռVZcsVڐ_eDJA%tt ˇͬG~Ivݍm")b7 خfc통Oa,Y /# ,]JOfޮ0k\,ݴ S.Ÿ30nt6~(1 ߐY1u\̚? HUم] s.\8Z%X|f̚8NT7 LoB`xNaNfL3:/W
KQ?Vɿd8q"ֳ̖ jDfRE4li}ܳ<Iɓ%[`kM73O&3sfIL3h<`ɂ9XNb IR6DE$Tf$@K6T߫gVe8PM1XWHT< ؏ 7c
8}))k& (QI6jjyAjiN )ft@kLoiI8v_zXMg."
EKT^B$X>0a$fwC?f0yO <ӧaU4pJhu}ń$c>iAajIit#)6GSERi/$9CBB_I^t6,ñcavB49n8%r+H`P^G04g8 ; -| my6±;P:7pf MjbG{.]Bք*"
$QN s EFqم,$ jk;SI##cy^ Gy[xv\
v4_2[0"DyF0 gM H|O^$^&A ;%yS1eD̝9SS,PALCr
VnF[r
VuC0c2ĴY?s6N;d1d0LJ<4sŋg`$|X G?GfE0;&"47! AeQ}$ 'BM#L_,6X-UNM
]4Wu:e"${P ,J?3xtk+܄m&yz텵 wӣX^jM w` l݁Ԍ,6J V'tF:)<.S:Up)qUҟԩfn:JkA#S%CWۀ9bC/U4IȠ vWY4DEIF'%L>4
S(ȧݗI q\K;2A`S` +g8 F1 s%>BH_ f^Č-FaӖU8t LVRhKqB \:} ~.L" 7~NϫmP+_>7 _{Euq:bE8mCnr|>t58w8:ۉ}?_J34ķ
D웉y=jl^T #99Q\H۱4t&RS 茧pb݆ՈMƑȣرw'nZqU2i36sgaJ0 p g̘31`'Ϝ=``,_<b<ZL_j&̤X<ש*/5sOM~Up>a] "j\Y| X`LF(̏LGY -$_W] k 5n8FGS5>ab~
C*ni3),gt9oyRs2}LjLl^l_,ySz<,3 ΄ mM:>?
; דmz= 3KsyQ3!:K$HM{ozr (6ӮHv\@CKvArF2@5<4vvq̣7/ ن\,l۾'bjr<8Zs.$ouh;,m0> z GN%+M
sAİ@, J^N-aLO L = (&Iv{h|L1#<N8#(>HͦϘ4[lDll4/GowΞj^f;y6,58W?STf7qn8w3n_ ծa8lF5?8DP/Z>x6\8wA*(7סA^נ8a>@A _bdACGvcHIQ'6lQ )蒺.5/6mڤvq S|-y>mjHL- =:~
}BX4o}xeS&O X1by V̜@Q3$},bk!sϥ= B=A\#Xb1يübɄ_;fb0^5cl<^ 5FFIv K D]D'gD(w$p<
BQ/[}Od{'T<Ξ>af] w
òųdllݶ5*5b z+z8^MFF ~ S5y,1WvþLUA _Hdx<j9d HƁV
h *X K$⏱<;!t~,\ (eMؓ-~
O!4!sV BbBҏ@I| M#Ι6K'I:j/@]F*Ah<%Xzd< )B%k.BRIV,Dv)rZ:Y2r
K'xwq?+Cmz8x`3wt~eEój 7 %eQHI<9d56Úٚq ^khMofj>TnT<0i< -բťt& Al߸i1{;`dYr0;wmš=?
Y*EplYbv( D(禍8
GcehK0kb^+WѰ%؈cQ d"9'7qغs6nޢvm@l<yg1K KsPgPW{|)B ^hԞ9
pBP(ɘ E BHJЩ|T:YS'a<?yV Ǡ92Vf2X3hl,_keez"lZ;6˱m N>۰ms="woh(Hut jvOҌ&tf
tf74$z O1G-I@Ό|D=X+,)Eie5 =ŀ~! 0eqe ljh}S+|lu
:"M/v9⓱bF,h>Gh%ƛ6|&>Q}Roъ|*Z+yf͞I"q2I*0$1$$
3|+a0.`&kWnB
9X:] u
a|<sfq, .Cݷg
*) hK6
9$$! }|GN 3=^%Llrcdž$!H؋'.oцH^jHQ__BsN7oߥM68 V$-JQcsġcB&U]ȭ2 $Î2C?˄bɂ(đ#<)(CT}֛R=y˶Xv5̓rAu"1y!b)k&m:ٲ10s֠ީߡE׀\lݺ{ Ċ
0mBL=XĽ\N¹jj,^0<x5kp \4Cix9TT$!4e_K.${"˄I $HxyڄgM ND;ı0 |
>bEd`ؽc="Ή][`uۻ vέKqd;4UEp HarZ>^Rj3N,;+!ҡDzD,$(_)!ըPZCjV.ҲK*)K+U &J
*x| #1XtzL ,{YsfҷSP/'Xk֭%_g'VYcI"P{w)ڹwbrV/˰~b&T5k`
UA
ZL?3c<h~d
h3HQS=7cypb;
t
_}:pNtc֍XHQ|O _qۃh8jviGC ' jǍog>FW Ȓ*] jhk( jUXMD^a9 F3̦Z >˖F^^
caNvt?ׇ 9@E S`~2h&\a
5ňI)J._5I&ٲf#F~$LJ\bS
%J (cö혽 3-?Kd˱r**b ;S&Ĵ3d
BOWv`ilB 8Y 6kfvuKKs(VD? 1*( A3(F|N0 K; 6` "EG2k(cnݲ~5֑۽mނll]vpZ E-ؾ%yۼn[Z**KHs/QU昙&A|,HO$ë A,=%:^7BCON'!.) @VA*jj`AgQd 2KWU ֩ N[.#c&LRRl\Hg~NQFK-^kW&LWs,E3d$Lа͢_qr\˗/\8G^[:TPz y% `k'"tF3rLJ4Ua!OS2"GO?| ڕO^ſ×8O0#PgU[.[4Q
Oi' }a7jNn_Oq&\mm h櫃PFG j:`uT
G};j0ա@cGJ3҉""QGwRO@N~
Yf e7 /k >} 5kTv
ՄiI<3s/ˈ+f
J I4WފM%b
Ǻ,79t0VLK?g|\d1bXru
~`"EHPO~ |lmh K
+[ Hxtz{O/\Y@ #e,$i31٦̠Vq7U&%s!dz 㱄{Y k7(ܯc 8ǰ]۱wz ۿ_#6?G8~/N'L hrː]
Qk2A #7' طwNPeH @v Q _
ʹF&H@ >? d)Rq{nܒl?U[@/#F$
0mt
9q n3ai
xan #{ !4?' ODAA2gJ̀&@/s)b،0QK⯩dg$ﭐu0`!)JC~adKuص誯>\9@} if͝EJ|ٛ >;e kW]3=|
#eO±tRdιN|s=]N~ fvyÉtut
uj4 I`x( H ZxlFBJ =ϣbgJ% Dء]T߹c+JEcAd у8v T Gag{qd; h@G*Ebvh҉fEkWit4c$wŪe4H(-[*[cf"%CD~s)%
w *,P :Ɋ| Q;0ZIo}[|}*5س}V ;1Gv#" Hm_O?8TYiI(ȌCAV<cGB%kjKʲcQxX*ɅZ
M^ ,j
>Ԓ>Znr@4h Y45lzl $69GbI!""y(顷H*F~L2H5[P!fK|T՚2 ဧdV2g~_G#n&̣=oZ ?tlx#dYi-22Si*PNRQ
mE4nMO+d +:[\nˏ8s
=lu9u.dˀ*v>3Tee+Eo7'7H`fO]i~ۯ>y>{.*Z?wR=#t$$Y
8_}::L@r|8c[a1ކCAc nVHNnbx([࠘4>PP:P1RitBREmr\!**bZ~bX16!"*BDD"*$yxxCdeQdB"cHVÏb>#woz=\>ݍ0dj_DM--6E8/")5mILK"9 N'F8ҥfE(I ϝѣ(0$gL^CݣMT[rŒlSd.='=QM<'f ٷ 1$B1'Eng( řTA_OADRtT\[ & 2xDidShlĨM֧ii W_v/Qg$%V$f(hjT}OIαdTZ
2ȄxdFǯI[s^I# (r [FhK* v53hoC-S؟H&bPnɴ:߸ wlCNVM%y*DUQ&t*ŋF q_$]f4BGxP
}7;h#Lث i"k
ISg$%Qdk/AO7u+n50vjϞ_~˯T Lo@_}
5,،7^̯>yH^EF!U85+) .@O{'ۏkG L[}p5tG[@|Ĺ3 #}w\iI),KF ڸ1 N $$ƨ&%Iѱl8|(; } ^{r
RPZ<
Mٴ{\ z.H7Ͽy|IXcs>,Z
KVQنk(X%k_wpv O Yf:Ľ/X<a92҅'O Q^
>&\ E G :~r2/c]S8QGq\Ad&D(eiYuj+cU
9~+x$KPSF F?fXvF7NS8{f~v NbO0jaq7f(=z]
JQ:~RZ*4znnYN {㘱8ݨh;?U
7@PYH\+F|O
)|z[oQYċ%xbڀ*X<ylfϘfa5 㘓\RW/E
- =gcuw~F+Ǵ u#>1ЂSiDW]m^
Z*_
ZU]=0
鱰.txjA;B&Qs,)o K Uۯ~}4hkC;ǎ-2t&¶Wo!|;8@6FR ML
M4ap$N8v7nܦ W)a
_|/,i5\ U .ڃr~F11#N?Υe."PR_n<x cG$'_＄\^9LDJ\h ]E!>xs|ջ˯ǟ~7"~ދЕkb $,Z!~i(XFO8oxq}̛O?"7o'dN%0rJڣ}8FyG}#?rt>b(1d }6C;{d#o {܆Jԙ50&S;BK[hy !ϷhqFlegܰL
vX>⫩ 6"EGf0.oqQ8F/ǤD-j)RJ/5$[yd
47|N
[<k$ !Y@ [201ܞہw =LFA\{S&at9s0adڃt&X
tQ*Ӑ>NbʎP`UY."8y:䳽nu&4ui:<Ӡ!7.pρ['xt.=5ӹ~-&ٙ^[o>z
'xx^줱p"NP}$6#!<և $$Q(-.j"LC؍nvlpqX9xz%,
G:\6@KXe aI 3>7EmUmvRH ]8vl;LW[&FЉ&GsGH#"WpTVUWnョPoU{窠G 29U d#';Uz5ܹ|d&!"& ;E+m26-Ƶ4رy%J]PmC#3$+yܷ?l7Q oܺ.+wzFdbUeشm2z (" #fR礢\
Pג`sɃ* ԔdX+s@ !`+C
M
4+yiDtV7Pq\;Պ'pF\=ތz}Q@qfU>YCfԱ-
Dnۯ
UBcqћ8&ԒI"$YjE%ȑ<Yv >hq 6de"&> /v9zwnj?M[7@I9B0]@ <3DzV\L\>?ր
~yνxo Ɂ& tס /wW}gpd .py/wpϏ&3>v4 \˽~/ SO߹W Nן=K]H;P4ܱb ^w/>+'mq pj/NRQ(N,uwç?ΫdҊBnoCsK+zz{10D臧@orPI`=_Chxx)1)t]iDrA4 ?V'q:v \r!K
dǡI xxh
DF)G8ȞŅ9_@ pvv*ʊQ@+k}$+?#W/ tEY*y h 857kI b8xp;ހMbEX|!Vőj^4 l
[~aܾy qmXA')-/ ( 3.Y[|4ŰhJ-gAgC_zcBN67( 96miɂZ>S=v7Nw&\?݆';H s!ݮ tz ĽdiNԒ0H -*J Eya^/m-6o߆T֚rRRUoSM
04<e #\u
*yR$697ԨlUkI;cyXiUv@iZ>( sYp⩙6 ଁTA"^C8
)
N7cǏf r_>A q߈KTO_7Ԁ pQ+w{}Јh}|wO kgqZWfΒضu
O -xt =gR#G)ǹvV`eXrj*(;W7/O8i PYRzO \M eVИmĻ|QҎk
frʴ
#J0֛p{8'bݪPTjF]ځ=' Q}e#)0S|CwGSFL yyHȈ%Gj^| |3=r$
D
ݵ7cz%o짏ߴ~)kW,塪qBEƎ;c8g+_6byXCq.%|GIn~ _Fgì)E6
M MN3 bx
Zxj+hӡmDRހ C- ulцf
wNN9ۇ+CJp<NbR_K@`rDoƳomN {雛4|Nj 8| k7nR3[v@d 36jG YUAiمE(*Q&_z%ݴI>#}+5w-=ۈ@.~fULv
]BL8Q-ِL5yIqZl:hOn-TΝ@ polPLUǃ6bӭ-~gh屣ٌN;)pb yW+ wsC C(,ؾu-Uo xFjY{94Uyؾ`|Tw !|z| r" bW;c476̹ бk\MиP@U6҈S fdTZ\UZ ф#Q{梊+5-Y-- dY M"$
(ן/Gk -CT OGfzJcuݧ/>~
o=rڌ\(ډc +wۅ]{7cPP: n|\ A8,K(#ic6m܈˗҇,ޝT`KQ(,Hz4%z*,
lTk3a0Q:<M3"`.G|eWoƉ'z! 8Fψ!^ǩ^:ޅmx|h/No7H$&hiKv46u rr
V-8x` VZvE+A Y~ K$hh ip)~(A&dry,$!'?s;\P&h=c+,]$
3g4 `Xj%d0 _RjԔ8`DAV<Ug)(ZL8k z 8>7.
0jN; ]nǫ;6^ܽЄ'g+kHTRp` Uw W/A\>ь!:0]4Rd}g [j7I*dPdnfV5 [ٮ:q`p- ]0{a0JY"_ FԺawLvEYeګf%H!߱Y<Ys1qTn uDKf!"bqLf)XDEo>|n NVfJ)B4fn
PR<t6//zߒ<|
JlL\*D`x<ۄ2s-vlZݛ!|F CG.[ٶ]E8z` #8p`7~ #ڿc
vǾ][q
(dd@[i ~VS4&"F}ŀJE'
A@Ok(CS49pU[@qQFQQm -(osaӁGe kt\/<*zN#B
YI{NowP;:$8$z^/ރiTSŮ=H
I= ~YIO5ZbԆrT$#X(D.8i(q!bH wo^gq| Yjˑcax!ƇaI#ˍ/¬1k,,_q w sWneB[hXu97 8A7x4wU_2t7pۅ
mHqS{H"xDI04_3x <w74P .|M|
|E|u\;݀}8,Nٵd|'w㕛qd
6S{.5e<
Zډ3xkS9OLF#*`0lliG[g'ϝE{wr w"[c;\) ~Է1gK/j-:I2 :xpz$
+Pg!.!ƌ°OabR e!BbDDG=}8/&-_GP l+bX\$$& $!G(ZO_=
LdӾG ~}a Xz } \5^=` ֍˰"l*l~D AfJ"i$
8 9e$%y%n
|bky,T -2>3I+:Ftwwx#m Me;_/VZ<"XplZ*h+Nw8p㱟yp
o߿>w ]-8KzA[#>blA/jjlj=즨 #9%ص oބ {dԃNJͰk1m 4:2Wҏ-vY쩧 aӾ#%'{tƵsx8nps2
H]P9^9{w"?# +^wnʼT&FzlNpjI`䱈 }P4L?8'a qaȏ7^:7 %O֙>ی'j>*>{*>~~u:DoW)fc R??}';gHeqa m1}rY6MuZE<}p
>3bb4nⴅh.sF}7|@MVp?܍]گxdynUh(-ƌ a#_Ği ("d+hd>IJdQXe 7x㸌Ŀ</> EYHHFj1b__ ~ G<#s0څUkbj}zb_+W!", a{o$ 1. H )1&<vHa_|LޘBb ],bԙ4hu[0#mtztTS,֔¥͇WWBJA;E"}MV _7珮=rx3b_Dd$~_AK^
`6Pc#UvBP}+pb/*> Z
Z86y}x>c%I <~ړ:uO<2[| ϱ }NQ?Ă,d ;-[sgܙӰd\$ąS`ƩY'?da,}8I-JX ] V$ .5Qu:qSw~_)rm wϴ66 ^ԇo}o(l?xx_}wNwݗT!uj};7i__7YOn ;O Na93`;)y.⣧p!~ۜvUkQcO NjϠWe| Qc}
0r
uZ7 vbopHn..ɤO. 1b*p'. &r Ca~a&>x O,d(EHgKv^FrZ=_ƿ3˷ _~>Bei!(>ދHb lڲ KWLu3s2ڿ -m ߋvȱGFG}H<6 &2 nSF#ĪAq>&}"YW!|uhk1%@<7Г_ 6uI}C]*^z#z 87\]
V|>s _ <7/[<v z|pYLh$,5& [[Kn00hRhKljG)jfJٹ ǎI 5=%>dH@R@[$0 M 3 %H?s;/?'ۑN+ he1w",Xp A~^:i_T8TӰ7݊6_
g@7W[oEe xh, HsaG pB 8af#tqeB8OqeWҕ -JlR̘7u+auw 7Bq 'qh@ߡtEi*uĩSW.@OLAQ~#Lmg;Q 𣡩ΟGK
I# @7u
F%JBh&r`ZTB!69z
36cV8 qI$g%Ykϲ( x=> o<~O ]ŬAQI
t(,bXIJxq0棇} >{mfe <*a.FiY1ҳ3AU<OƖuKn<"n%)+HE +Av&
"
ֱ;y G"'=^{ Z
YR myuЖAW 4U^f~Ǟ ur:Jh&A.)xsrÃFf(J;pb, ;/ǗΣx9Y<0tZa#1 KDa $ &6d\HflT5#9GcHxW\DcCI/ Aսpշ 쬐E
Mۡ t\N:1wUU.Chf<߾w~7"d (\ #Ǐ¸ j)UpBU+dPĄ BiA&Œ^ Pެ2/Ul c!n^FnP¦:
z jQsw7ϵV /. c' CVv)qρvO g8kŝstfWf<?CV/_Cw8?a^nv9 [-z
zk9>xr
۳;u4YYyH*PZa} ORND!H@X7ruр+-kRk]KGu*l0mSx˶JiYH(Xb-d<^? dǠ0=ei0WWύ<x$f(?|߾ aGg E )-:b:'3IBRxA[I +h}QDt Iw$cCv ?+G@^F<5$ ]^a
T
zE~C,Zj~K%:Mh#t oIDA;S NQtB'g<59u W} Oo
F4[K{/o8(<Ny<^y~BJ c'V_|+\M tE/v^ĠA/*Bt|EE#>5
YbX2;YQ)3K³K8@%HʲVoEE Nْ׀vԘm*U$ +_אA?C0Ǝؠq`\RLUu, ۍP[XG/ͳhm,hh&M8mSL;k N{jm5pґ QSk'U_ﱲh/+kql
M? [6?}7o>W/z۽ˊör| <ևo>~ o_T0%]HK@^6mu>=}V\oꂅv=A#ZY@Qi}["ʈA`1I]Ha_lYEY2lYm+1 HJ&:pQM"=f<Wx[(WzI(͆
)<.=))qG)6_s˷z$Ɔ+D[_cT)9ӆjjQ]N?kY8{+}sLd됒{">OlDnF1Naߤ}-HFuQ2KFIV"駴kT@C`
t-p؆3 \lƍ;ۅCMpL+pc'j/Ƿ w_OnW\XF^,zQm'2 ]~~;fF,>]Aai#t,*Rb6%GpQ]CqPMor=ZD&a_1W֬ % ҡER'miM?(?J^(ۈJM+`Ѫ*[Jt,_ # v7@_I̤ppl3;;-E
Z(k10BW7. T;nUvl j@ Eľ 0P xN\tU _
ecض~L?~ӗ/Ɵ| Ãhpt}]N æ
$WMY:zeOc(3=.$ ;55 i =D/L ZOt^ Q[c]/-07ЀR 8WAo ez L#LG1bݻUCW id@|jr.KER SC~SbWQ
ڒ#3*J"Dcbll"|o>Ŀc+#"c53'y% cRUV@_C )X-Ceu2lbA⫷Sa'_H!ǔĮc8oi{ ݏtܱ iɑ0dYK.ʊɉP]Jc<G~جyEYrsO9{]U8q7#PiGg{r o] PCgSxIw4>zxoݽ m E= g}o4>;}h'!!^ q G @YqQ5 YYr
gH IHE ,MLY~ 9u,1ܞہwO _Wk
Ո\n%LAI0
DE֬-,qXkqd7E\&e=vfRY@2`Pe8vzvlaAN:Sr?MG^~,R$# eD£р qVV&yxzƠ c>VYB3O $O0|xЏTFFҝzyx/_'i} Бt49]U1Z 7.<~CΨ0,c'$V>Wm&*Il"YR@ U &&"hJM5%f`8@$ Pl'PŐű>;&Ī̂'OMܺ:Be[4Z`Wkƛꌸ~ߡovB:!(vʬ&Ei9Exӳ߭
8ǩnFڟ^.֣3`Ǧ}֫l^I%
ʪ_ZEⓌH}ʑ5$eД墄d4U4VA[[m9[)|" Kv-ɪn ,a(B-`ɞzC EF9N;q W(&(BTq X8Ap ^}.J , jv=0$`$ DY_V\Dڥ d 4B88vd?^|LԺ jDcBoUXp˺ņvLv"gQI< Dw[p4"38_i0ijE!W[u`Ƶ3*/'I +1'"4/]"әK6RLhd&EZ.Ld%b0i,Qe%VuPqqG#3vly8eV
0hû$g}4S^WP,J2*&4i/&×IA֞AA(C{mK|{xQG 4 7އB]C7
p7Q,/NxZI8.(,->owT
STZ鈼~/22v`z[X
7a1OGE EdK&[ a "bH dƐ,/B
>} Ls*A é^\:]n<⸿WH ldlްĮ C'ΠbمF?[g ._=zlY1=d3rd?m§
rJQ/' w̔ӹ > =w~HdS`Tj(CEQ(HE8hG50uƩJ`)Vvm!l^c:)0ZYvfĿ,7jU-4:O:ha3Or5pb?Kxc! 2
}UĜVL[n
9mjk*=R2rOqJ4%f@kqP4oQ3R K+6V3Ьxyp77_C*7yeUI?~D-19A-BJJ֮_N Rc
a5"PQLX^L{I(I@ajɸ%{B91_<2 )|3,թ[/ij4} ce0c ";q'H<jcqX l56<; &'\k#R[8
-,}%>|zOD'YMIՁX9ݳg30:d&@SYmk#-nއt 6'"(oQh 8.\ Uq6)ujt
罨F]blݱ{XHU>(I%$@aiN|6?wɧ "<9Ѓ gqd-
kGwO/`oɳ<Lv;Ѧv
ۆ3af(ڼZٗF~CyF+8>DȮ@a >(2b˪V+UQYFX&
a*S&
Uw
,pהV] ,G"`b'\.xWoD_'8$ѕA9өR]k/{q)랭6[
{"evQ#ķkWon;gmMArF69ZB"2}ڎ@[[{6ve lp:TQ },;RL&uR,>ǚHT,)VZ}[x+Ry9M[7`9
S3kW/Ŧ+u:aVW{PYJD#;- zk⍍LY;= 1u/9N3V"9j;J3fKeZ؝M?-(<
}En/7ql W- ]wo; mq& 1eB88 '| z}/ȠO`>ˉFS Ώ+O+ĿǬUK(A ŵ75T=2}]'
0|
Ӱ¦sw^>,腷8 !bd$^˖R^R%@ ~XjH4$7.;_~%?~^ ~9Y)Ϣ 2
W'0Uk:I<ތu'o>W,ꕶ:u~Neg$=x [9$4{mP+nTRi']pZrH
aLFUE6rsbQZB
KhA%6<-J+`ʋ<Lx`,Bv^Q SͱTNN+߸6wK}xr ] ˃:؆6
-^;KE-4BS[t6]|~:4 hr
DG!#=Ce $t:iE Y </M g!k0d<?n;XWo_ŧ+}bHJkh4&c2]ߺ`LN^S: fD"=Jrqē$("6 e%i(ȋG9 E=mV0fSۚ;I$(2<9J1a k1RZq/Am`Gznt
=2c#(#<I߾_sbJlErxC /Y}"C"s
9HJ&$#,܆^>sVgiU3RDPj$ |6,GY(Z )|HHE(J C$8D0(x*% u6OS]
<Wݍ)2iη / 48ifw f}h5gF'G б}[T%҅g8?؈:p.:RnJ)Y4Gpn
;A 6SLL($^n7V¬+%1$ CSТޥC}jϹ):H kv .&TsE<h%1QHU:674@cqGƝSx^I-VO㳚BؿRZJ`*nE/_oCJv ¢qNΤH-,O`@| d,QҐmlVN"kT[/I%nwCvq*Ҡ9<__~^}xA~
OH0 !Ӄ YN()YPu #;5?)gO4:*KAq^$s#G,GOCrũ*TVlCOGl`դWNiСS>I?. IG7:V/:}&R8qb';ӗo_ / }*+H!umDC~g5I"^w
/_+͏`O >k=Ԩp}[Jpml X Vb}d7B"(4RIfAُR3iGɧe@=6 P l;e$'ǩ&6 6>ZmE AД~_/[$[N]L'nCQAPZElGN~"G{Y5(+A9(NG=vPU.
nܰfQlN=;K7p9ܸs
g/%LQUkFd\" :{w`ApdJ
Кک
8y;jeK:Mi
_ #:G2 1ϩE7`hqխCmz|"YhW>Sy7.tܹ*.vhVS NwS74
zºf
F
zRZ.v S.נ\oDlFbgZ^bAQ)\|פ2S2r`X0`Y"Kӂj䔕#d䧰߾y[||}ŅXf1c_a6l]OSliiEq^Nv ?= ىH:Ԙ^AkB.7Ɂ\
W7
5q|ՠ/ʿ7olhV-}OxҋǷ{T&B]F{ʭ~ywo
Ѣzڊt8ߎ|6[W>w,O mP{ gKM.˧z%.EoГywP:1M8}·0_Vr~D1VZb_c`6uPPIac͊HںEfe+۶mAj*fb,RSxߓsS(ʒG#ݗ],ı^ </)FYi&
sc7wb ϟU⻲ D GEBCOa'N kRΞa϶xU\zo_ g`uav*@
-T9^VV[<>^zvRZ=}FJ_w+YE =nz
~<lU8[~ڄG#o GM˧qq\4|G6x%Gܭ|,;e'@7{oG",f_
Q:%/%eHF}>?1"-glj:!G ȹS5Or~e7 7^BnGfF֮[)F j^-
+@:_T6rXG J C'(
}]KBnQ:85XO~ 6&"d\o!ooA_C]'xz}r\9W:[oxLqAMY!jJ`)V7/_&kk6Ռ8D[7F
5o;Gy/
/ d& ϋ
B<@BQ҈7nuA_ߏjW7>qtBgPVTPd :TZ\a_IJ߱6è/i2,MΟg<_ dۯωk9(+L뱢<?(y)F
'OhtXQr =*TrznT[X͎ZVoZ'!8x$ ށݛWq UcG{u0 ¡cv NO5}fb]/F'uX w{<cJx쥨~ wҶw_{ziڈs C].- LS3rto 6}ԖZqR ^iXM[g!}~~8vW/[^Yc;5щqCAq~IdY K
/Ax^$ ''GdفV (=_ ?s;/^Go^*f6a~: =ۀ {aˎm*
6-=٩"U4
X䦐 ag%#=#
tU4$u v
2UWNPG6!g>v^#t:qҠGF/EAiq WNH[f#MxB _=w_F|oTG)ծVIv[ϪJI\ZBBc13~}[*t8L$fIAѯ屆Aב,m>e?
k>Xirаԑ("sd+ eXj{0`7 @l >+p&Ag-!9}5y7 _ޠHkF
:Mfʰ"oqƲ(E)JY5EQ X_[ v7,ò9Xh6" ?tun|F^!RSDcDG#jKT0G)QM150J(de1\j
8K!3MmPl C<od4l)l$ t!8?ЀRfܹ<WO 'Tf3Q]>lR
"%&UE,H@DvȐr=~6"|4TMUH MMǵv7j(6˴,*S^A7Il(Ҡ!W/Oz/~~O vހ9-QW^ؽwy8t02ss":ZsQYHt{hCJ)*bp I,MD&u X
y Ve%qԪ
h"[괸|.w
b\Dsn\;݈ncU:\܊WqrCAk 5嫧78ih9>z;}l~4@!!rF>|y yx Onc,~ Zd O 0dVjH = $K%X ԸQikL١vDvQG\6hUF <]wd ޏXb?:\F`AlX+w/_R H
U0 hx/`X>_5m8ׄt4g-ǟ.VMq^G։K'{IkbT\8fas zl,V 4H/(EBz6Rsh;"BqVQY Q5 eviqLHX5 *L>@%
D8):x<}^ I-8K5B^">ܹهW #7s 8e6ѡ2|it:A3qogS4HvMRImTTCLb*p*iIYH#y(כi?^4_ ^j.kjU986/\&%Idd"d䧰/ Ox{:G} -
ڵ3LŴSxE(£RÖq!dg#-E z:X+xtS,NjTK\߱זF恶,MK?ɞ[3=E,?y$ǟd
{\ISCU
RvQ)n\f[*>o"ɧHl)ʍBRn >w_ kwnmAld~ۈI7B% 8uϡ`?7kAwq]*t-jٯ:
~mhU~_֠H(J;ZƴHx8vܡ
>|PeDGD"2:Q O1 ~<⢡.7?_KrhT:eFcť(/!Z mş~zWhFY~6JK/Q3hH&[=\8ލfNg%s'a} mhmGqy*Z"[HH@
q In2
TRJ
M̆2T UNBYMaIa(UA0l
hp2'ԫ](npL'`=Ǥ &Mq +:G.WpE5kQe(<6$[@`r>+EC&x 9ayďI3CW
$5-$ıbv6` A t 7}z-x!@
@dy.Q hS ʵO__}h >kZ Q{l۲C~Q1PD XBR(dDv<; ;]HP
MES%n̩xx䚒h.B[EQpl'^~ {|7|(֊ E"O>P<S-謳ի |MJ?Nvd`=Zn;Uu ^/KjXl8(ЌFlJS'd@/jQi
66Ti\f+65wM s߿g@=E"Ol j E<QY#طTko/[ƙA FDNJF_QT^_7=G/9~5QY)h2t5RMڀ:)T `/ FX4˗ Ot'0ہF?KMH_Xi@JNo.}#LjxT}")(@~I6j8%gfdl/ǯD uRnK]z,UhkРvONzܴZ kiK~l7N >U =|}x@(En~
5qR+< ZC<k;<^|09;xlV#~?6:iEF `$)U}r{iLW!==>q =]|y(1ܞہww__zt7wҐzPÛ}f̦`C >|p)3.#ee(.HQR)XRf+G5M7C$:UX]~)D*FG/q֙F8UOQ3TgSSB$z=54H$+pt;%|O W?I!% $-gH$#: Gg5K
U ltf)d$&44|g`f53ܢ dUifgĎGXjA 4"zEeLICTVKSQ[G;|C$ l1%Y1Dz (%b cY*o>o?DҬ
2xo'"?6{Ëxt{HjBVO2^ 4yR`ӐP@*eR\>m.I~pN50z^%Z#NJD ,ˤS4f8D <禪\V= ul,Fm8vllF"ނs P<r"]; Wn)scWN`Z:x(-Uv
< 1ƦҒt+TNA@q AHdlh.h"2d" i9 x~xs rlغ
Sg<U"Uj32R)Nc=JL@~YRQZVNaCVz4Rؑ (MCG
QG!I墷Efim$|,d. ]E$ A'.B&1h3:QGqi pB*?? ?\LA_
kM6;?~6 Ds] $lĥSq\^~6 m)[^<p;)dkξA R4ȚsKf_7[;,2D`r$Wc7|ji'NTJA,qgO"ؾe9u,Ĵsu6 9z J0>1Nm$ WZ:_|*~CF"JϱRA[I 5<4lg C5VLąCEi>L&#: i В:fb͈
Yա3ft,#qZqd/[?lv+ш>b9Mic1j'd|dg& 9(
' MKDUy Z~lP6tZS t iou` [ߌs[Kofa! '`)+Cxx$ n][CyNKG®za*H1` $ gD䒬15"L`cîIAD=!%?CisrKߑU5zSGbO"v4.'w祥<9O5pi96`ʬ4c2-E=o7} \I9(-B1#%v91OhonOE5I^#cTe,=B]- qwlP7q/EPIOj wO33cWl=`dp;-o0%5j\\:^?~:?ǿ=WO"`pg':ysZ?*JQq^
h= 0),'A ?ޓQMh
f eɣvV} e+7yUQEaώ
T(nFڳ! X%J1q$ ij9[Bj(*DoUK
[zx}
('գ>`/DGW&n_<>GLhaQ. V ;UR<X\- YXaT ݍk1͙SF
TkUAb
R3 ShcRTq ))@9fZB$JR [(S "jqInW <VaipwaDO#_c^lKxpm/p:8 >A0v6N ORlGޠv %PKL =z+F)PNNY&$(J p=l YyeiCu&x_xЋ ћn9Oa뷯?7ι#HPO:؟Q ܂{w(~YBNyY uvF 9}Qdd%ì:n{.:slH0PZdddvY0Aו n@Zk"2#CkuZppudFj]Y
U( AIPn{ggg~s֪?6>{#{Ws+ƣK}?V𪤵?Ǜ&՚"GM8u3q8nxvs
Ki0A E OxD(V3f<9+l1 7 +O&ug1!@_ =O$qX]Xm .&yVI@y"7 $_M2K݀%NH\"^kŵs)u\PM_W_U}F4moWP?
'ƓQ$}V4=>}}HHG Ncai{??ģi,ѧFf(WA,^ [<D,a4}`DNũ{pV47;PpƊڑ6VkT3# .S`(vҮ!qc~B$ 0`>fX2E 1C'ee=b,dyϟOWTɑLՐwN?cځ }|x8v iCi 'b 5k n \_Erdz{GѵĎ`2 nҖg)) Ƣ=Ц wwLN0$&C>bGca2ӣGKL<W ' n99p ܉}v҅е`NpN4 yV\$tsC8w OٝaH3iz6E1;"lyIgnZ
h B 8 mX22䣗2Ic$n]gF3 !좒L>9ٷI?wTG; i~AB!oRG}
D(x)y
b+㎆FxIfI*ԽH&ExSc4B@ $BK !Λ J4,iXqI}yCUصAhH0[t6^* }4dez
W
TY.Qf%[OT;K>3ڥHq jdƨխ@sZ
O믃/)]餒G#B GIc{qࡹO֦HH ZS\4H/> 'BrkCkG'Hx #
6vX]z=6yobW&Qݒc?I&,Fn Ee12Z-z'TýIk78ޥxuE,O$4O[
MйKշ./?罕%D_ḢFT_vH{5L *"%(&$Kew5)BK$)7I\@ $
А$y= .&:ϟ?:ß~ ~O [ sϨ];i ʑw*JgAiu4.@/z:hHx^U惧txVW nb G }z=afȃDPI2ZZZUy ^M=Lm%诿 )F5>' o?S5O]L Fy5գ:!ß| ~6¶fdz|-_Gy_~
YS:~[ kￎoܺ
Ix:?N5 sKkԁ7} / < d g %I@HQKٷG20 aX<ћ QC։a
o0J250ޕ8s 'OƉ'pI8ykj1m?w&8, ; gp.{pAq3vځ N"rTQf rˈh4D9WQgluY:=i98yx n
T\ ]>0*3ԓ)9հY~t`ɅXGfC;v >Iɸ)G*8m7tѪ6mm}p5 p`&K3F
9|H 0GSqkHjo >W%Àz5w'+#qϊS"'#y~UD%H2Ip_҉8{
u }VA.)9zDhVivO %XU$M3$2Uvv{?'ŏ?2{\ tPR<
x
JaxnQkG*Lɋ.~*[O^G#$7F1nMGh9 S"nXuՒ|ZE `,EWUWdlj!
4N֡KSxa{3;y[ʗ ୧xD /z{K#[uڲ* DIfx0HH/ Dx^ET {Y12 ؒډԡ 9eZ]# gmO"+ O" C(:+8s!GOʼns2=.'QPO _Byؾ Gȑ=8@[a<߈| H܈Uvx Z".bAڰI WR3
05(f&q8
;7}eWkx=<s $3-toAmc*Shgl$
]
xUjOlf耾~Fpj90>
/_罟8c7߽F 2 >M|c|M S?"'i#*.z`_(H$/}*- Z\,sWP^L M= SIfz;4$1fs<C I(xlj`v,?O?o}W غg/v >'QΛT gO624vj$ Ble0 oG_o-[o.x|:A u`.=>X` F}Z.-_O[-mA_m RƣM03`>2x*Y 5WqX?_g!Jgw||6>Mxrk%X@tm?;_w?xx ,OBK "]~LMΩ@
Y=9Mo <; Ħo"H\Y7Z샨7GfQрg3bEpz1 qqK8B[}!W8f ?GOëcjrPuמ]8xۍWɓذu's [".Ie5QL fǐa?+
Gp?w %_g0>8[&^ZC?U֣Km:qI&] =7鄕X[9ͭ뮀j65K04_EH`\X a[7*֬d »𣯽oц}wi11[\ɛNK;5wbqg:yP-ݸx99g0p2"qwAHߠ?P"٬ G_|;}uxr嵋J+ xYğU>/`\;p1RR:4t@'B{ fYk[T3:˂@$k>M0Ư &~Nq{.)tԈDL",ٸ2 X"b"b@o4%i<Ѵ[^*Rt4W\'1~gōŌgdv
] [_yu wAi, O`$_+"Vn`y&"R3p'lUWk`i %q$leNLqhW EԎNG8!iAQu=.ܕ|]B\&U/?o]wo}Xr;LMƭԠ5m4dC=~+(,y\$+id[F3H
f43[ØN` އR:9pI5ZYE<-zarL/QuUjӾia"0!Hy u Y{
$&ļz xJ=a ,f'3e#흕)^ﾺFX K8ݚ<$ O ) FjǁN_= q:[QԀFb+A43FC1Gp \PGM 6HPf!Ʌ?1/vwÒᒥ,~sJ/ہ??ĻV62m˧}&ڹϜ@5uhhUYCsVz]3! [ ><w pΓI~D[s!ܘce; tC.,4]#^?-|Ɋ/JIy{k)s0hZ)+t0=u5c hO~9;j'3aq*[ i/ݛUX31<}zJ%`nIjm.?z 褤1ޗ ~ &IS^p <q" ͪSt
Uh4fEQ^]ah(G=}(-k._@MUډ7o~;OInGG:]m 3[XX\F$ C" 'HM=MiG1xsHVGi3g wQSqc|@ 'zxױ0KtԭA^q.$Wk[K/IAی[DȦ_pGPWgp{a s8 X'HGc^d& ƸdZ㗦I5k5&V xrʛO&0,4I2
gʌ`1YyY\|L gz ,g;Ayk꼻
V^]$I=^<G?߃Py]RI
," Z A Nhk06wFӏ>u ]$n9'Ч/mDKC z4?*Pm_# 3~1-IxzsSM8Y &g#QF-XH:QC7oŗI`uf VeĪd P_ C6mmxH/CUo~m(F2>]`yٰa>,z!Rx\F"*@nh]އ! `~.:
{t<
S``Z3#6 Wt]n$enx6>ed Φ*f,,aqiY W@e >O"vJKPPQ | c ~٧tO
gZm&ʡ
Wipu`kE2#ӑ?at) Qqܻ-{n7P^|'/ ~
o>{y< ɕ2ҭGna%p.^Ec3uUo6^ VM;"QBn% cgF0XZMJ1r`J6 BVĨæfl,L&L
k9rm=Y|Ve$z%|>JR"y Q{ьd
?K`xN#y ȊHl Hy^oGcEw:>78qPP/KKJ$ &Hi /!F{5K:20#
'$~U$>OI -& v7lێ}hn)ASC5ݰ-h@w]rhPɶX[%^Gby hi* Zhs IDAT 6}{&F\{\,>x}:>x
ߜ ¸%:L֏e0܆v+fm̚6t2W ?Wuy4)>^I{(;*Ix
}{{( IUI8; /u:17zXkvb{S|8t1X- htaI
!0ue'+m,FWO+c6<{\[@/E*q!.墌X`vj ; ? bi֨%s E^?L[FPvC
`` +Oy*˸> >\ ?mBEu.{gxW- IGO %
-@# G;9>h5>3\n!KMZ`q\_x 3'3b i逇0j邷Sa F=xJ\ Wqwy 'G<gphU %2"[SȺT Fr&W'Cg4Aɤ-CFix-z?@; YDvZCāoNLPލAC ѯXE,&E~Yy=Y }| |M\_<
Ǯ۱! hڊPQ[&4uj19U]j͍t*"A./w*TnOὧsxHT4I wqk. :|)Hf@x"?2 6شH Pl;t]uiBGK%h8;p^W/~5η)շ`zT#Xa<C#4ƲXեy1:l4%HĈJ9^)/ E"?[T/FC\A 1 gF
<c Q!X&o%k@ai
qHQ-ZQ/cTZk;}Mǿ]J㜀?"pwak1<Rz<?!HMԛJF4Flx|Z UoLMP,#Gv]-#P)+ A@#t '`pp ^녌4i
tiw `C.@ zM[{Ak nD6n>M|ڴ͘LH8(Ӹs}cq} 7Vr1?M2G1;OOb @z DH\!9zʲ4œd]uY]J4,*B'(} KpBd`
Hdֲ$J0Dk~<o >wy
wڌ}{](/CgSW/&;; Ёdʁp..H>gwS'p5q7f$_> qH1qo.eEM2bd CHPLK_{%sawªo\4UtPuUuP]y9|ۇ#]Oọ{7F: Ԉ\t:! Ц=94;D՝<AfdbiM_ K0;>q Te.`g%M/vO9 .+@VMφU/لʒ|h;xm3Ȍ ӇRx.F.t~Ti|6:?y3/{wp6BC$oǿ#)ʤKobfv8avq 0,$>=@cȻ|
w]_@Y%ܽlJu FjP:K(DJ ;/[PRx F)a^eh:`oRYFڎZ F7¥ ݍȸ4]5:58yumjN`A
!/Y,ܾ9wy9Ŵ0iI = eb6;sR
ZDz`Z52Aޢj7,W(.,>( 1'G%vwH5rIY>k̴+Y7O"yIMݲs3ێKW.%Eԭ -,^? n3fF0c'S.l$ ~ ߚ{&zs,:y}xěCn_Jc,nCީЀGX`;si-GSU=$PT&4䣪" -(CrS~~ kRt}oR(uF_ Br8`Y9>e;U/"b% E&322s.ܤ(U
L%x 36
7/!o4-Y;5K0I۞%3tA׆,iVRP idx 9r]Kye~ko']koĿ'7R-PAo<_/ )hn̯bjr#YL%1G P>x1Q)a3" A>㞝^Fe"An T
[ $~<V%5uFt] ?26C @9
H;-h-@W}) uF=cWO<=upk X⇨ ܞ"RQQxpw7'qkeZ{obqI& L0?)0b4K;><\>s?`9)3ȒDL+RقJI_iC\2QwQU$c32r[OL8' ՏSaw_>;2܂0ZQ\JH-mw Vqa4##A2P6 ,M/w)<^4#ѵmHH# 90Fxis N*1ɦ=(ECU8lNwۚKQVD/CS]!j+\WPHݟ?? %Leф1Qj7w`a*27G?q7H ߎg! xfGA||$y5o#0uޱ؈$vNr;Ǚoh5`JEච6M
>%e!pR}~BC#Oo7}jlըR |}? GycqX|?O~c<Lc\g\c>pz$IpPA? _6O %jt8r.=/c/"Y18R4ǒD?҈Ʋ -2n XCm14BYkO
ik]* Ǝr:0A쮇 >M2^RR'tt\ <+ԣt o u+x|:^}Mb.9 QxCqd6@N' d\Ⱥ͋'aTiDɌ`xlw5(mYA wl6?F qr yT"h#&w3j/vϿ:X Gj@=f6k6?W@]2Nu*WRE,:8lH >inoǓjFܜ֬DX
BF&J]c[t QFPU|ϫkJqZ. =艣8q][qqd" 5C'O>>O0w -m4NW?
dGvYz3iB ATڽ @!RS.3w.&毫d)?#KvRUAC "ܟ>8z4
(ɼdDNAfGk@mk]TUר-m}ݟ?'jF:t >c$}ȹVti,]-$#.
h rVf+>HAb =8rt7jk1:B6:IGH ,s0:Ct-IBI 46mMێnsI?b˨|eygPq *Eci Z*AC9q7aP߂ n] Z~gW5}M8poeOoO*& #a fy:щtAUV pEHe_ T
4~҇BȂ DC%;U3)0x@+ώ`aѐ pB4qx >ҫ;\7'U :paܽ wBv:aAaA>:t kՠǨ4d6,ex@&~!~[O͇C nL FRVtW QZ҂\PSu
͍5hj )&)=ݻb۶o¿7صu+~_+.w o>^U
')}
R jnܼAK (YF3M)t2ON,56{_("_G!.} ƖT)]ʾ $ .хY8%x9 Ջ3M8#3n ,vz
hnFEM=*kq1
r.]6<- ?~}|*I$ hhbD;Rls']Bs[;ICv=jP&F o$`t`8;\±;q2 ׯ/(5<2N9Cy'6Z1hl 4w֣U} zzU#-j*
Xm
!T* ۅ G!A?r g4_iMOO=,2!GׁJ4vc4G֊7^kK 9aL
a0p7o^ B"ж *2@Jbtr^Q qI
Agp` ;CpT g"dHB}\ i'FJP>+ϟed|~_ cصo;܈\x}vIhߩk$Fi7f 3"3 i X&zM^÷>Zޙ';\ ~օ V#T_]ƚk<K"* h7Ss/ ^^sfՐ7{o4]|o~Ooz3c1>1@' =zt?=D\}
0|V?1*f1F1>{]a,"2B }
82 q*X $A(v~+mq5M"=%BoIPm9{ TyX<Bݯ(Cq@÷wo@o$F(ǵJH6I5<s/9cΣ 6v}o'>A!-eF 7-Bt.N,@ $ky8~t u;j3K| 8MP<Msi =zJg5ȞjXmHMV[hy$PK'ܡݸrZt?O AEghj
tM mC-uQJ\02 a[wI9Z6
i2Zl7I"RCHЇ QC8e@|
KJi(r"hvoLeHI N k ,^!AuYfU/FCTsX"Յzx=y^S9c5ZqK+jkFNScwnH# ?N7,o㵻u <\TiF:HcX0K f认_J<KuW
. *x
+QP"\vVq$~Ƕ-8{o
)'Qc} } Ng'$6Ă={]$XHICݿz2{Ὂ.Y!X|,<beIf護1<' I
G'3u<ހg|Ee0ԲLsA 3# ӰFPь$=9>p<6Z455uut".__+DkC3}_U PJψnZױ` .K;ًoj٠x?I*X~ PAa5.<E^rػo
q"BH
$z0И| ݧ=%7[
%h^K\ 9P{}V\<gi¼ GP_t :l) 7W+sub2dě7/֦1`vf8ib!\u}Dq\x:uS00V%gGרHMD@6w LV.7- & %G <1|z 0ތ L" sd Y'f3 F'JGEX:u5ɻǏDѕ0kjQRS:# FIRgwHT "y fo7½WLeH`~C#í$fet}@:$'V<Z6e#TRz:PLp(O ?svlAXM?/~?Wwqwp`< AK4`O< ͢twLJxl|) Rc["rD$ 3>Kd ( \F.*q£0=sdFc P.h;h$$]}T u e\z%jb(WOsw /ae2mO H.83gN"72Tx}4zKPᶮ D!H5Uo'#8 H4J@p|scj,I#5V;,HP
B ~tR*k ^T
m-}O~+ ~=F\p\&9ܳ4WsEbli##)FA#|nغ*4#F7k H&XgF1=>a([0 rupׅ QPK>?0 P;}z FM,N"2`}t >KGNlH1:: @$I( C(U$3
PIXk8v ڃ={IwO!{^^ZWK} ACԋ Iw"%)L.'_}/9 '.%p5zf !5i<;o_'w0==BgC,槃ϿA=1@g i@ZjTUsxK_< ǿS_ ï >ō<9W&N)n
mK: N f hz P?I(YN BK ha
f#J-U~``$N@ 8Fo:?7%9k vDৃhjD:R~#M(| |W'#8w v:wbCxeUGim3Llv,f !DÁ1hO]FI
2#ƙbmqu~ZrDay-¼fQEE^ K+ITKP[[ ]M$ vM= :³(r
EOi^>
z$zp)ut'T2Dm46=yH07;<{ux wd!@VjE_$ >H6z9ҺM,#ϹhGKM=:]zAǔj(
R廆gN$DrfDgRAolZKz JQ7U5~ 2q3LZ\ܼK*Ⱦ u6ڽ &eeh%k_Op; xI %px H`y[߸ޚob&kĭ $p_z,)]C'5Ӈ17=֤'`tY %hvMժ)f xE*m/3O>w?zJ1GkS>dJ{4Q[HHo3ȎRe
I>OGGG M }csh@Z ҹcsǕ 0yA}N
K >M xNّ AyL d,jms *q8-yVQZh &9/gWrU8y4 :]a灃DPPn%uM9)S.7R%H?4U~ 0
Y7 )ٳ
BAA.X}UFy7R\P|4:[^ n hȥη`\MیK(< yQ{uep"lG؉)/gxaHoLs!nD n q]XYZ$VS}ѱe9$`ICKF|xlW(t ZKh1*HXR_J$P =$C\N~Ē; B$ 2%L(H0SMΞ b3 ^VQgN쥣8@'cҷm. ~w"u~ vޤe'E2폫,$hf
}uܟIb}m"'G(Xl{pioNY}4ɠݴGor /+S'ZPTztc_eb[? ~?C|O;[b#АZb &f ijc< or$8 a
Z; \@BOd Chow%CgF E h_l$m>4 < ]oiBeMΝQe_@<ȪE?Qfｎ ~vX6=Ĺ Gb]8r4lߏk(ʛ;aw:eڠpP8 ualj K#ci%2cpx9v7VoL+$137͗yN'
R
6\V+
9 hmFԡT Cϧ(? aC҅kVN<Jt
&qc" k;1!m|oޠo}a۷=͛7+x;[M⺋ @rm7B+dT) Kk}U}zz!JQFPK˘EdľfJr6byX5 8A̟L2;F57zno>ZQ
LJtgs`' I}N}=;p $
$xP.̉ At W{),$`Yf'qk&dwQQy4[%*QS9'qQ >zHe
>z N GqQյȱtGq kF~ z|UWΩ9Qiާ 4n\*/$8HJ +6{Ie7@z鄿r&c6 Y0GsLָK` yߗYܩIaI ٸڙݼN5 pFca^' 3**PYUF
MT2 ^*>xrO15` 38t2tR@vh NV5KZ"]줫KJn+8ph ޅX (40$̓#$ q,E%h+r'ɨ,0@h00"lm*rTq
%h.Ёx>tʇ #t`i?UPo
&L\$#x x%Z7<F` ci\' 2՛@eȚV@:ZxTe>^' B09}nXl~Z2 T!)!).Y׳Tڦ#8 -
H$K]"!,Rv%KAK >bto<^0,v IgNㇰwf 9HЁ6YT(θXFL2)\>::Tr?{ ?_ﾎ~%TNbm1zcD{s xe+xqF x+/uY/xyKt~۱>9$99'{_{ v OoN ꔉ:n!QN@b'
{4ZA^ϤX?;D= I2,$pnCDx%;ȕN10גI Na.#uH U
Iӱ|>8! Iьa Sb4ʪOګs /GϜWFWJ_4cabnI_ډJ]syF0x:*ʚaaf,$@fAn fW
d_N-;r.!hL-8E} OLR70L+v p=dV|S<Fѵ鬅ϩ@k_
1_DsU4Q#9Zq3ưӀ` +; Ces o=^ݛ R$1hBevOMƭ{9i*G %r-T!
Q꽔#Qnh4v/Y O P=MH8(%p *sy]v rX
/}y.YfOXgE g_ıǰw6ۻm$)'OA]G?Rwݏ# @HD c
?;ߓQv+ 秱8!+.e+98F.U7S7nܠ/W6M7`<n|GK/bÆsv?t ŋg|vodm
I<.xmD}Fn1"@ `s)(K/dN=\=By &KMEp\ҷH Nl eHAٍ^DdtszxC-Y~=uCcY((u*OoFIe*E+8r ߮xx I!"F_<r\t".]ōhֻ1~ oz>ߢFNN<C㪡[L u!3sLRso.عY=0wQ4y
vI\/IK[%1 4& /)/Z+DZb']F}3Fܑv->hM 4>ep<lūק۸LKBA=Jeu0I{St)>B sH<r>*dx^,ߣSOEX}뙹zzluK2 ,O jFW }2ib I <ql,>fovG&e<|8b~."ؽ{#vu #G9Frddr QȰarl=z <cwÛz0g+ j/ sqnl۹ lozl}_z҆/ᅗh^6nۀ6c {8zvm݂玡 Gԁ,@RA/.ЙxNC^b1ʨNJSY"Ӱa?m' [ƍ; .w #|}
q*EpюG5*\y L-R'ZR1iT7 hȽZT#76nچ^|O報
P_4mGo8n$b}G ȝg9 -:^ G߰hqade\"O#ģs
) m"Nޏ`bzX3, 92|0k9Uֺ}(/j@cB߀kX`: hV塦<ʋΩu2W&bdz
b"`(y@¥GA\s[ey0k/!aڣt*K[&O!Ƌ?m*u %S0|x DЩAog@ 8Ƴs^&=KAp PݏdF@ h#K1 }0x<ہ?`Y[x\+/ā{p.\t7dMD#䚂.4c$%*8tXB1)I[15"`lB
8[މ{wa; $
;xܸs'6ߏoڂ
|Nyس 'oP,{7V `n2a, N\I`gzjS$j$Jb\5(rDÙS
:ʥ,R 6,fӁr30)KԤ~ ;veMCiD1@B.єOvmzL64\5 ;{O ǞI (1|mZx d.5]]Q:/:ht@k Lmih4xIj- ITL4(5i!Ҫr ?GE y:@zHx ֛ }0 nʡɉVӋ|sdk@Ls3<6tD=9'o]qN=CՋt79$.t9Ch*AXSE9H̪VU31$}d <{@'%"#p3ɳK)( > AJ3 e;퉏L䋩{%$2;,bZHEzX( ʚ|<Xm$ j4#_ cb~yF065^2JKgF ػWsL`mkT I®@^WB8~K)k#ͅps!bt] ;m6`?o Vͻa3yN>q#zM긝a#u~Mxy&yݡ 'wo[' UK
Ll:70:O Ot$&`4BcHT!;M+ cSU LO"H $ YFl4NjbEFII#XLFyU(:arftYqeÑ q)u\]T`غ0~K/c%>M|oӯ}_~>b>;Z` 76 U:th>:"aa4\JB\2I 2 :^ZY#Խ}3@jDʮy}yM"Hri<o'Y8rpJ=aa4H mksdN݂}/|װ Mk;PvRr8S
epi̸6[adIxl` ҬݻG4 Jgfd!#`R.z+efReI)=4@:@0DDj,zTr|d IH; CՑ'F{~[x-LM/,b}L.a#ـkD$$x6vS%Ps| <a8]6ͯd~1<?Me$ }?
z
ShګжW{ؼ-?oݶ۷nۢ oq˖I,uf .7nHb_xE~fno7ߨo᷿>Vw'12[,'qCy KEiBh7(A !2dS#U{ K+YV}Kb6P LRwWa MPxB> z:[ٌaS_I^0uEReEyC3:-7^x 'H?͏]>&ƛYۏƖ^W fMEymmեdZ L6+u /#_&mE16H@+攏,P;g1:50} 9ЧQUɕsu.pIF ӥLF
c*9oF$`&N_x( 7a/`;7:[kLPs ~7(pJ}Zzg
w#J⛦ FGDaw< q)YP iC ~H2&eɦKQ=b<
*h2&5R :.z,Kv|!:wzW 6|?JAv7:$H?OկN,eL.a<
Ko TGF0 "Abc%n c6N·J[Ч%&aY\dPcĬ hAWOrw$Wah!]|`ۦ{Fݷ]lZm`Ӗ
xeKذQh 5~N&xlގ_ڄ8g zZJ?o?0M7w?yF rֽE\[oUz,¦ M}dr1uVo=VcS%xR%FoM(XJ#S70'}$N<^щZۛN"οI#31A{Ov* %ɱdVMjy
v҆ng0E?~o|e|Gw 5Wׁڦ:b|+ @އ
l.bo3|>5`w~V{Ar4zvsf) <\y8pe fficahF04>~}
4PX# ;aj,GDۆʜ#8e_
[7;>"6P. _ ܌Ϳopalq`ˋ(pFH$ ܸh xdI@,c>BUKL@CfB/p%ob
<X$7Tn~+'F % c:1QXCiG&{:ʀgp#* !}~5 <W xSC@uj\t N
eӰE'~m1SX$ual0w$2 =/K->WI߸ʘY+ Φb=$aNl!`شg'* c;6+4+B$HalI,dV\ bqT
a2
}DqvBIᎦ5-C2l 8s"M <р0Hg|zwR+k 0vN" KIv# ǣCvk})h._B1Ғ$}"4IU 426
4 wHW4µ"\-B䕔;4#$(ټRkPҏk.4x`q&YXpoIV3ʁ6ɴ0,tn
- AFTNU |,E3;`3iatXUN$$5tTU ?m8Ho 8w;.p{=ZsϫT QuQ4G ak+dߝʢX뭚r#t.[bNx "
XU& $:EdQvLoFk4Zi,}$7c
~څl e'QR% ,W]v~<dp؆bi/˨(9M P FsyKÌ<W2t?nlgG0>`ܐ1#ZLvDjܷm߀]{[ oی lٵC$8< l
$ޖ]|8|MUo)Yq *qI5UEzo 3*@e) A":%1\_%,p J+iLw_#aVIHq
1Ʌ#nTEwݎ:QtۂjGXv̆~1.H XfD5&[RjNԶip+P\^ {C'g[Q]Y3'ѳ8|,N]ߩ6x^m A]GhihPHd&2t b` eI46(=8ʚR$
^ӥزӗ,'8Qª|t40p!F[ho@_S) 5"h)3q u2t =Qw 3Z]
_B9W\Tv !ʟԆg
IO*u(IMiЮ߾`N>FKIV A@v}'Pe`J
K6A^vOH!b."^~d*I
փ3^9YͲĊ eIk!B*UqH0At?t~'ZPT)%\P(*Ay)h:+q!I5a&,tPx5)^e"$O[~qgS&e6D Ѥ ;6o[H 6y$۱]7n/-[l{ $ It8s)v5d"vTGSU?*<yW <T`ZI"^cMuH7xaz+/Ӑ=%XjRjRSOH)*z.mZO]v^_K\ $XXYTYN1E9"_IP z[\ZTV E~ڱFTԖC$rJe-.WԨlQG;Hd'Iy )#Yn^/m~?<5V=w
ǎVVPVA=m&D0ymyykx'K;8ƈvi
%t
ZTB&6t@Vsw#i9+)?up;[_m/Ȯ-rc ZiO.^<jځSZIJ:dm_{u\O IH1m[#OR%,0EGBnJ %F |_tK$F7md\2;J)}JxVvbH"YٜȪcbTz' }Viy?0L&b\rErQk)ՆZ ~HUߟ'Lo#.!#^]iL`z5ܞ 7&pg< S=Q{'n۫pvvپYMa"
/gmoڀ$̿el]µڇM[i6l߶6mƙQY id 71砵Ws9<yh&%뀕Mh9uZR#А5.^v02GۈH`ѕ3E"<0 u?8Ov m4, v꿉dÝBw-$:A߃@sWwiC3ݭJpjmj֣
@2
߇&)U.8rʾ̹V(TmO":[is!|P FO 9F&gLC*D0^ګ{ u?4T0mm0/E3CׄAk]
0Pmmu,;CPn^/bMطe }}ʔ+ /*#onЎWoƭ%DBPҴGiX0kh$sWl6 }ft05YAH2$@<^H?qetNV>+gk3L9J2ue8{lQeB LEjjA 풝\ D//vϿ:XpүAI}+U<4jqΜ> y'3AmEK]f8&ZGpTQ:Q!QLO [x0 TL!|FH05*u'&(ػ{e.lٻ Ħ ?Ev ضwv;V OcQ|۷8](A^Up==jnO|:ƍ$A${I%;貄zHit86=O٥(pd;h$ j{S(`T LT s볣JdwoH҃(5 hJ=4].TmT|?/øT܌y8s2N:ϣ%J=HF) 3II C /r dIn\QbD56tCI)6ng4Ȃ &X SVlAG %e%,iE"ݎ\k|^@S8yd/Kc+عk+ن Lh2*
>!=|㰵çp2<tn.~ NXcg|$sYXRE%@w|Ih:NΤd"Ibk=s@}'7K /F8vԔ.], 5DN2:EM(nGn|hK8vE$V=hj@*;xҔ0 Kk[]!a` nCt0&L
mFWUcOII%j+`'aaㇰe:/A9 1> [wx݁7$ey:~~thPqWlS,MgTD{<' .7=%XO(`1*M04
Dm 䂲ۨ&e gG@
РSqPxi}]*0N/c,\ﻤơcNס u
CS 8ǑSp&G^qU\(,Z8m:
$*0=2,~deHJ3h\i&wP%(,<Wl$`pP&-\i3G!A)g¹ y(**V
k ) nƭ+Sr|q N߆${6{CWc6ჱmp融|jL]$#me1 !&X^5MƑ9}H;O^C*AȐdiFe'JZ/'gD_ESFu\K OFI`Y(n}/L
9@Rס q .Wpl8y%$6Hj:n6x ݒ0JHBXAI8}U3$
cR*VzYkwhm쬆uWgFWp^ : nî}{ھgvک֮=q!߿G qlUB KN"nNӯ=mԉ+͑;T]4n,O`0 @*vlyy9J edI%c``k*ݗC'e>0H.9uxݯ;hUGtyBe8$ݙ"B߅&Xr $1hn$4:؉h2
uR я̌ gą8s1G_ā#p$(f 7 N`FRRi1<F`srR'
QgKQVA @0IJ)Yx E2M s|.a4PQz
UæiI / ?8݊;^-/cm;P_p s$2ؽ
O D|o3
F֨Sd!B !"Hx@<BOȽUy 0H;./A"
{J R̡@o,89Jl6}jL*{@2 졄"rrd,I0|ONI0v\nCNI5T\$a{zc7j[z>Pfߔ,$4f VbDK 6Y
t] Wk\mpuUBR m@ElEwۍSG8HwE߳>v=݃c8}4 M^EǪ'~U_FAc5P^O!-$CXYBRt?&F->ߞMJ
>MYT IF܍N71|?kN Tlc6:.#HL/0d#?u3Nx?!Ӏڻ;8ԸdSפ?RHe={+uۆʆ^vJ߇n06~f/N8wvUQ%5a_z5.z!G$} I 1R8K=6PW,N2lں2DbaEyMĽv~Fr9 0GAy<_2 V\<VwVgmB7׆ˌsʗ &۾ell} vnƞQA?Gy8o#.ރ*v0Su
6xȩ@ 0 =| ~0}~`:Òq "C. }d '#+1 "XϟN|CJ2RsrG)cX26>L$^ juk) :AO8Qfzn? !Mk@Yc
)xM-*Ӈp aZx"Q
֠j V7 ӊl`X{q㊡hDk/A_K:R
S_=`1SgO峸 \/t) =u'N #=(BJTf)[email protected]>{gU:\J.sjG_+ x zmxh= 7ot,nB]\;(;bX!Y.s A L:R! 6x4U3?ͥ8K!.zzk AJ!VLotI@
C H}C9X< ,K`~/N\ <ç/reV6"͎6kFO_ a7IäWJ4ңtR 4%BaI!r y_O嶓fH (:2:ҙ4\m:'+*ix
XYn gQHv|ygQ{ lǁqNqؽk}N SQ\W`S9sPGdԴhТ} ~Se J9]H`V eI|ɒ c9?YR]S
kxpD1lsy_0ֿG4ewȒɨ
;R)v3#4H"BBOBv7IHki`A+jS'"6TF7c444r4 2'Zg֓<aPLn0$` $cRntA.H¦U4waŕs8q0rDyP\] H>eTy ?s O QkU
[^+_@ޕ3;8ܙU_n=.;ۏ;7棳zU%@ H%B4dMee u
46:N[]]i{Hi'm
%I` .;rnip)vQE~?uSF'%S{.m@REeQo\h
١7Y ==cywpb1 #a:K~^Ui-} { A_=&4F+$jihZRiKeOn@Gi\rQ,Ir`hr@ KE@ Ds zʖGֆ"؊*|DS* 8 ً;
A=ߊ
x_R
9 vCHR@p g|\ECy4t5GfSI2|}*%pIJ@iea& 0u 5(g'N$KjIPZ*+Gi)KI`X|s\kzgH Y ِ< !խ\%̽s'v#V4Ao[^4< <$^4ʟhDf:o'eE{[[ \=o-C KOv5
Uz8q h^8bWjuZ-:rv8M; ;vl,^x ظͳJ,1;SHt>ڵ%$=묣٨Eh`2}?م..,F?7!Nps u_6I?Ȩ-7I#A J ^Ue 2_*ڄ pLtwkИ09c<a*`EС!2
Dfnrm8t
Gb 8r"'J9mls sݔ4qE6;I
?}@bzaKrK\$5Ë7E|p8fS~d!Ifn>ٽu
@I]li5}?WI1Zjpa\;{T+䁝8{;vICsC|صvh/<_AOS-µh$Ym.$lZattt`ӧ:>Nd{`3^zK#}b:F86V]J)]kPtQgՑ=_ögj UHG$dp31A\7_sY L/jlT ܅ h{ :y_Way :GQ ԚEo
}u* UyaUӏ \Jr_oHQ*UQV8 >O871زqE<؉s=Oߥ7 \C$PUSzkM
sbjSG0z`JzU/?9R:iĽabNqc ,8>0{9:
=e$d{c7H0H**kсA(L"7\觿DwΘ#Ab/ 8nԥJ ͭ8[Grpx3B [Tۆvmcz
]:[Njbn;!%8_B|:_F1KzTP jnM]0XNQ63І`#Ͽ6A#t e{X| Ǒs. ESw|b>w'͛pؿڪP<5Յȣ_:E85G B E0 $"vׄ`paN٫x4{aD!hxʊBǣQp C_x!j %%< q2u~cģqK1tݞxi')lfrr4znVIba VM j(o@MeS[ :-
S =!tquʢSfzHLEź)t$w F1`Pkv-ЂK!w ޏ#\}s/ؾgن vbwNa=8@pY_;Osk13H I6TCX&LӓC B$-\XZC! вyL"T4]jח;)5,Ag|ɎJLv j X$P)K!1:o$0x{m!kAPH , z 4"=W}bnm{}QqL |^7ln/_
[(BN Lf!ymhBi%[Ib~'-fSu0t!TjC҆QEaMTJMo.$H,9?si@N ۧ. &x8aj(.S>z
BpBޅȻxt.2JI"]u0zVf;ANR:KJ K$` W;!D36gi<$h
oU$C~o\H[uW\>d(hHԮ~<R+*}(6] }:4 m͵&`4ՙN]#j[ 7 =PYc&hÊ&p Vgc 0c"iQ3^K'b~#B~ rsϩ۷`u}/ _E
FG!eFI.P;eۄ&? ,>{7a:6s>~M㻸{co?{wn 3B0 %]`M@On$iL@g (3481{UexI 2fgluEx3 4|DI'jz\ :#9$PjӃ$BpDѥsC @Lk=#LM0ґ*Ԁ]8z GN<=|
:(cs.k4KNFY ̴&ZnK^Ri$YZۂZ-FhvW0zIt6}sÌv#MkC~]9v! ;B_:E lڃ{HUKgeW 6,I
OWNITsعs7v>}Zq)Ӌ%*!A'4=0ȹS$JE _ Hd9%&*|^a HL 5?_fo\K9g$P e dTB Vjd}\ Cjd/vJI߆BVGmkmDjs mq:5Q VކsޛNQܸ1̤xV H8{KD<} WbUmfMҼLt_
|mA}?s8:u.FQ)xW=4 ]pۑZ1~V #FWw$J[K[丹Qt2A>Hҭj\v<Y4.ت4Tʯ~{Dz ЮەE/u{!ғzJ'0<>EL#[g C#;<y
m%Ş*|{#g.Wb >'S+HbҰƳhC\~hh,*Foq ~w^
K5l: :m7:z4&'2.^
TzQ@Q%FuPi@nqb$UA8{~a:C; A ؿk߾۷;ɣoBsYN߅+ą'!1=ҼӨ/>֊(=sru婤&ss DS$R<g\kL&u#,/LpDo?-2"@
;XHY@ % u@bܼy@Z҃D?dIi]*
M%``iR<JyEK1$R젝"ym7YцBW} x=]k^J (# @z>AtG$V&0? lʍA?{r!G+ Z%lv {c6x//Q/_۱}v <(W~;䣬
ˇ.C"Eԧp2 :u*OýE6nM>2-:Nˠǝo& suH]bSs`}c!9KbEIV`wiTvXC#ur"Q3! Ffr< ?R6ڵ.4c%RH,M$:^W
j:L]rX%uXN9N/| gPJ6 ěDɁ ڎ~8].8^h5:=~^>@9h>b:{:5r՞Bϣώ*;Mh8('/kK6 F9SPX| N nw' ٯ[K=b!i)Q:/Y9g Ĺ3P]~
t _?g*nwZڇ"l6LG}#3XGƹMS3 '$ [h ( Kd dt%HgOL 3.ǠU('WE_lA)c*$ J쾋$wpf//vϿ:X 8l17Mj.31=q] R 4",LN 6 nM'qkm щKAN#|F\ "pw#Q]f87@UKc]RvIxyf-$pa9+WΣ@P"4<Wd癠,p
%x 0 a+0b8l%q! q 8hT"qL' UXvew_4Kd0462 Vn<qHMS II
ѐQI^^W4:%JN TJ=C/4^OJQ# iMCaGqDc6Тwς>-:B pŋk\(Ɖ~4 'q.(Es /N@щ>8J#!FўPMyQ NkV
\tpPe| |FH`zfl uMhnӬA%6
$b<.Pe%xhن=}H /j] T6E9'I&OAHS(kOF (oDSw ɂ &gfUe_:KА"}ȑ E4@Z P"gL4G+B 2A 4~!i7{T 48:C4 aGٱP`e!e;\h(oAiM j=d9ښbv҃
yVJ Oޠ\ϒ a[`{ UK]:\.+Ԏ' 6c4. +1)2
G_ue6l߷
w6B vێ4 y.EKs *ILQ^Y+%?GPQtca^{d|F,܋L&] rT7C /Aph^eH H0 :Wq iRS><I~^䋎d,HB@ ^dQC8KV 6H"&Ҵ@
ϥv뽡 :xi@إ'ҩ$ h5xQnP;2ґB4PfH˃3E-ȹ҈`ׁ8*hHR,-d2isB2Wd7F"U T MષXPW_H!AަGև>(>o٣ƴzEQYF{ g'hŕ3;g 9c{lKp3Nq MOɩc{ne)ڌSvO\@G}j/Cقd"
_ Hmb s+K T⪉,%g))D$xϗI$藲# HJ-|. H慔 </Iit*yO>'A Hzd2)VݖCܦ~[]P؎V
+kDm} zZˠoQpW/Hơ Dؓ 0; ǸV(kM5xx![Z16S~_]Oz:jqLt^Dж/-/ Nv>
FW6Tk(*#;t?!TPCx*^| I:{/p
ax6B ch69U
$nEGGAݗ1Jooo7ǡWPGI'>~N/A^.ԆI2f`"yr5ՌqߋԐ40
KkUC/uNc& &] jnM=RXsU|(^p
sx=b}8y
`/j{2٨Vx-v,
B{{+ Y=_Zaɾ 74rACҐNaigmj}i@!v+x[+2o-WZPY|
-5G͵8,kkƥǑ{4.9t_R3{'m(=2
rO A#8vx \>HFMq:j,v5S ! NSƘ&S1*J DHv\덏%MّfRr(6=0퀁_5;דDV=gO QE%-A N.J&d ߁d;JD jh}UN6ؕT76D13A~59ĭ$Բʦ2R.zoB=N"\_ ť=xx{
I'.LytG[ԣ~~ ضa+:ƅj/%ǩ3QV^F/Fm]Z=L#ZZi*Pل|ȿ I;ܝkn`,K!Q|6\MnW1pOM)qgc$0N? +mv`HFۏQX( zoHBG| n6bc]\,o
АGY[mN} P :ؚӞ]PCOޥ9-p-!Ш {cx
ݪWlޠ2%aU vk7Y䱌0eΊFt=vUl$~#&좝k0Ɖch ^#vi"vi2N"iZ{:=n JKm
0;lDA>q|<z99gqbA[C!ڃP-%(!֗I L\8%PSuEEg`t#;1kK ,\%qLӋ0 ̨ N6{`_3=_V7qQoK>6[0 F=PmƟ1+{MDN{፤KV(f/)?Z//vϿ:Xt*u(hE(, 4WU#hEcC5 :oڠ\.v97Ә 4{Wo):cs \XZmG9R<9{Hv ]wc{h ٿA@c ê
AE!8H:tt?(LS +Nj0{| =hӆN&t,id ͗8~Y/]h2O5|]R^N < qS- 럓+YݩѪ錤e(
2sEI:T. A ':zq
[/bW((+,ϡ FKSEಐ8H,=*Df#KtTuxh.Y$2gZ"MWU|XjF2 18V;r.<K@DfXwhI:RKͧ$N9 'o6: 0؊ ĩc{ K 4rh8NRrϟD]yt)Ra쮃ԇN:T i3cy^KKFT&Ec/ςvi$@siⵓ_v
,~_NTCI 䵶quotzI3ZH-f\P AXz2!Q W5t<' 4hP٢!lµF\GG}iXz2Z: h5E Oى. &"uuS+kɈ[
ʨi'\lʣ
k/C]yHRK/
IC]8p|?=>kspv&!">k+ {'H$A۰upY4~5
]\Zu,B/QW[
ZInjjPI kRm +-J%pyAcB}|_0>h=N{:^ɬI_: Lw#IcJJMR`@/=Ҁ*v:?Y%1333z83sx3)$XʔRJ.ji.<Z5걼fl wkyHk7xe 6/.cĿ>] XS]قv}!=Xј @"\C<?kT?!̌ܠܾ CE97B ҏtۛ$jd&LvO= >5|&SO%6kpXgѐ 2ε3ٱ! uM\-P3*eUFu-ٻ*^5_OBg_fL4cGKg ZYZO|.)Cjno"{:diYFt[sE߸4W5 ɾ/ VhиE 4PI
Geg #H8 S7+`ߤ{j OʗF\@ҋ!̎v77<_=|5}s&5{ 4&naC {?D ɪ)7M!` D? /T |i6qu-ZJ36(r !v)I}3mx _]K C47br >ğ3˿ IXr0|V۔$1@<i+6OeGK2hmd33:7| ~6}~S29 S;j LCxXM /kK$(J0,C,Ӯ,1/MOblױI"|:P=nnl L"{rd6 E<-E" 2-%MQ ɟ<ߙ%
n㵝 D6.vH=\ cS,aE;B<`ʐ^7u~ uuGZRM~6
(}4s}-5٨at4^c~\pΒXHDm%ynCS{7? 3udji1\K$M+yB1 ɃD% "|e2gC3Xҁ<8|\ xQ9~L" =ӆhBF*MM?@0cS76ርaԛE\~L"4; v̑,*s-}K;|5YwIiã<>#>bgяm ϵc~F4555 $M-hhsfա5u(+w5|Ur<R߳V?ſ`k= ,ȦHG\89{
ԝ:G֏~iԳ8ev'v'SHy?C: ?(@mm (;aRQm(}29I}e(dE\<.6#s~=;f.^4KZŨg<'py牡B(\KI[/ZF|~{}LQvw |-{ 7$+*N獍ό+8f& O^"O >ŪzP/kM4`4X2Y ~/:ۛym&1G_16ك y^ ڨӍuD }jqv)n^/AR4TTENGio*C_=f;`}>N$m(Z;(介%~&I>e>Ez61yK`JԈgrg /{w ^9Bx-EO<_,嚛'\m/+3kfr!u+S3behg@UkH!e2vy! GfKn ~U-?Ce}fdx`v$GN,@ Zr
cU;t ej"~jp A=IA]9*
HoT7KL*I(>zF (yuWOrKqleHfv{'rtrI.
tQ1Ckwy6
i $)M\z
%~1u;%Xhp%*P:a'q:T&If|bE3- NSj.z3[X#Qw MS4MD`Ԃa 5Qt$6găray\yMG;8VM,I&F> ;VzH'X٣A81"Me>nl f۳ stLaqA3 D?R[JRZ#+&J H([&!!H :1aH;zHL:`sXa`E0
u|#?&):wE)$+4' xpPB2oc[J?$X. Avx un15~I_R
A& h|2^(+$-4ɒȼkMг=-XBp;܈TWlKX]$yxL ]cүr\+$'YN&> {p7`SO1 ljNg 1:e4浵%o BuZ:ߪ(m:eeU^K7L$و<kh9*<>"~9C]c}1<>~r?/OI*[ ^; #/ AnM
7#x)"|lMzй*+&Lm) Dy3\oD<<M5嵏ҡҫg<B0inKBt~\k$ %L8Rh@ w H"\օf7!K
}@v)۰kG~ vϟλ$;+tF Gca>AQdD`f:ߢfUK
*[Y2< VW15=R
$ \gzj7n:Hn( o]A+7Q_yDc > <sp
n`dU' !( 1 g?0 }zO>nk'ozi)&Gb]~/l Diz#R@=
$`A1pLHp, CUk7MDIW:: #H 3^#G?4<b{QDډ5~^bchǴILy ژ }E#d\=<ܾhq>3g5 l~`v:͂2ܨ+/FY,Vy`ӫ6~i+*ڀfOo+ x,ǃܧؠo&hb8SWo^SIxSDëF+
uz hw4ޅ`.@ ^:?{Hޗ#Ϧϧ- DPqV`:k\yMMpv 6[mr[r]8i{&8FJj5@Ѕʺ6Z;aFGt , Z1㒷LN[ X7 !FdžrB**b!-<??4@
:"-LMMb9@7uw߆X`^tTڛuJ!]1%H
4xf/1h´z QzH ݊j lh<@2sea}?zW_>û
B*3/m59-6<QQF.+xZLQ%5&e Λ \e$!@_z2e5n vډo}_bK똡qdsG`35Oϗq#Κ1q9'IoDI0h|t>~n \Vtb]!ַal8 cY$9%*Cum
nUUU$q5ߗz
{u51C-9C Bb9A2*<xVWwz>ݍvW_%>y16
J秷?w # _呾wG긲>qu߽ +P5(F쇈BkwLJ4mA~1%~D f6MR)J?F#S ^- g|G-ۇi` EC(9E}}j:7l!.5dJƽiXC He hl*)ǫm%ڬ㰇|9*"y2q" 6U@IcmR3Lb 3s-ͯ?hBMI*or
*G}mnwceAW
*O<N<C)ڮ5<|1^C%f9w_cT>Msw>rǟۏ>qo9ț VܺmkcZ
&Wr1F%qdVgtpKLRſ?8X0Hp173#Y b& G;, nqway>Ãy3$I
_=/_"I|` E<vcbrSc]Dfd֠\evm @u]%jhoVhUx Wn_
AM<Pu(a=GCK :M2ыx~_|ECV8g{͏^ gOM+\I$$Tb @`_ E C>N0|]pCȺ)g*?HE@bPhO"
M.07WxOnf^Fd1ߣ#C,йY./=6l,/`p|iDM {7:dd
Hzdq:'
IejoU B2$ jVsY2,Uh|4Z*3QNd)A[1$ HEI0LgAc2bMԴ5k.W`JaY+4Aǜ:wƆt03 ##qp7py0J]=}} ~
Ɂ
'80IN
%\+F%"
()+&@P,
b-Xt$rsN匢=cG~.?];P6+AQG09bKG '"ٞ'a><znUl j2C O
Y}!AC C
c=hk1)u\O_z^ 4
>.^ Uەq7?և.7XhW6Ih+vV~8bo:q@1>y~ 7_|eF)7KO`)1k:|IHZ) Mq6ebTGg YX@0'h'K nva.Ä;a\wMکKx/p0f u6a8
-
m}hw "6ٙNr}sD[$ՑZKY$AZc ofqEzh:5o21 Ts;$X1r 4ӫ[:4q1nߺjI00;ڃn,io05=}.$kv}
- ѷܖ!+91؎zLccu,.fG~s!I
Iw |9>g TPx<;/E Epm2UY L߇B"K$j\d(Q nf 8"A vn <%X8!Y8#QCo15wo î<<B(ypg't̏s}I}VkGo"xK ۄP7[M۶f먥M.q$bduM-(WZ|xM|>ġP@A>t44rڕ2f>O?:Ϩ{^A _~/CO>k4)ݏQwN
Y$FB|LJ7MG$˴'FH \q(['P]I`$Cґ' P6K:$Q':R}u0
[d']?W?D-EainGS{/{7?or?~(
Mrx?|fZݝ!yʉ m B"㎮ YE>yƾ MH+0Hh/|vD =Hw01wI0A2jMӼs>tV:Ԕ@E5ܼz%Ya jo{96ڱF+q/~hzyla~]h Omi
PϞ |DebS꽚 (W}2\ i e)KT>S~lPWUd`Q4?F\p;"^(m#ߤ$emC(mGe^Ah~ }roG^.p~Ĭgu^>>_!K8wk&
#]$Ds-TV^2*.n zh^0EܺE|OшT= 3mʪO`7F?9K +>?Y=8GOsxk@^31GHl?>1]uI];oS
+wiI^z]K已
,ĩ
&hcOIb~酦 ח6B86v=t=W 37}e/ sc6;6
o,1 sLأ<jAW(Jʛ72_b p Y: "A(IO<c8wr|:t 5k}E9lh+0 na)Iuε5
$ =;
f[606=q&}[KaRaf\ӓiDKC9Z*X]Pv:ʪx l҈8f{`#VІbg#yD?Q|/</pK+ͭ] |OpH ? R%Q&P`ꝏLC5Q$
9${LM OMz_WSl=> S7&+]Wv ޯwkFa\o GS #vLOM"iq+ $ CpDbs!1^|> B"N ?҇&tw՛u%o'wY'` `b|
5f2\#xkpM6%(j*Cca u (62)^?;/~?Ggq~O ?'/ V 'W_/O}56TDG%Av5^R!5U@@#ύ)3A;9qN^8FP4ch-#lͅm*
\ybY sdI LKnȍn*f%@CM{'0H!M
-#HCR[TA SovYw<4Ù;0N Ў J.% }8T Bp!שa=&J% }o8Maxt c&,Qk'I8,zf iCsڹDDo)FH[=p/4@w + )Vב,"3Dmŧ}jH(ٽ BAG4;ݡe5$oIDG"t tBW[`4>Rg/'~;Z(8"Pscl îܘvfTAūx tN\("nESC;A.|8ǏW g$NK ӏ1OcNJĊN<x,ckCK+A]W ^ft2 {tOcgFQVgtZ|^nj쯗86ܺF$>*MgSmv> Sޛ?1O~gXau8b$WH|8K$G :ecyeh 7ؤP5y?אF"W]aLYIfG OW2u`Eu g|
"ă7C*9pWL`Z_M(zL
$:98c9ƅ6 E[k0N6`hځL^K іh3i^ח)sG@ 515 gGe1WM,dwD ٨UH"K{fgV
Yڝ%Y֬~F*p"A~F0?F"d5Җ S$cHG<pM$ 䢝?M_Ӂɱ! tu^LX4ƁڂNi
χ% `ad-PH8D@AOKԵ@
J程Е*J2]ܣަ-%9R$F AR@K&DH4AXn;}aD5*ɌK:{n2
Է<߯i,ڵTAd &ݿr߽^BM /oƅhhHy/ o` +B'߽4`Es_6帆hlF|~k%Hjo4^ͤ f#oSÈDAoR2ʪ*XE+ߟNGN0;eJ?s| <L̐:mⲙ"%V }l16@ c3@~ehHӓ~fvVVY
&K1ztDci H^Tv i챼iX\%oÏƢ$4kl}_I'kڨߨà=gF+W56ctI"H?wOwQʪ 61VHk6'1R}>#
~n>8;@"E*`z|-ʄ{DTwm 4R<{wC'v$^[B.R}ΫaGK5䢭}} $C h`3|7p#uaLjB4"u
фI=V@eC? ksdO+H'iwX1F]'_6X۲ z0ixNs*@)\*GxI <V|^St2^-Idzg57Ubu+[Zo(&!u!b%6gG|r +{N4T6.)fYDWSp'bn瘝P7?4
fc O`ttuuu& ,e2 ._K.ݿI IH~$NTcc# |>~s ~/͈uE9-vƕ۠}y哏͎Wt/~IlA$op.}0Q I = aGl}ك;x`E!.a#WVg6I0M/qFݧ/ҟ߁/!Tֶadv~QE
E|^/'?E [lڟ997m2 A {dl ʣaMc6
7uýx@O]1\N`u}.?{1˵
q| 1-#f u5hhjG{5Zn pZgaiA2&N՜5dXŲnW?>}V7N_Q/*t .^* <7>b#=f׀ 4I%Z1Q`WE%*PnoޣgJ`'.g
8z 1ڣw1GOb3 B4$DjFԮ#n?@zdVp|+ރ%Mpȅ2öSZjԢ:NLhOvcr }$C40mDiU9+@@Bkq
j@EGGWif1PPo#N{'_H~ ^=ǧ O>$egwQYEl, F O%4)WXu`26<G
6hQI2rD14 1篞3U.)Th'O'ˈ82Ps
QcB70' ,`6gV 'pf4qyyiD` ԼI 'Yi(6lYcwwSD(TE#^; ؤ#6ǖ4wVwY11<˸R '᷍2 ck6ZI,IL{MrڊfLucj҃n Op#윅:g>W5XtSt$^t<a!r<&WGgD;#g )rLdL92x4G< W]1JGhi]5ځ/%/g-1l [N< bj n NbƝox$wEExM rNz3$ї̡$sӉ>Q tvGz0<kxeƦI- JHz:ӊtzjb?}Pu 5Rb _g8;'鏿 'wރy( C`wԤ:e+ldF[N`n CP+Xyz u&94R6vWq˯p.@ihoz D i~~;_p{dz{b_u-f0G" ;6MmNA1AFTaWHin,%X9pd\<*[(&Vvf5)Ы#{D][!.Z 2cS8cv U\]ʲ$U@oo7z(m\_cLMq }$ V$i8f$4J33 !H c5dmP
;`jI (fgǏ?3wկm[ l("{A/[ ]$xDd.?@|GRã4N^*Poy;orsMtx|6.7 X=\b O o<`!FH=@d<jKR]
NrP θSK.u6`>^M0P 铕-vYEA/*At>!.RVt:n"e vWtbp| =('Ess :NO~9zw7ӟ ? vpS'ysnO56#j9y]K+X*gT9mKX{n厞5L &f\wŧ_5B@HȨD:@
(K.[0Hb=kI<ś(kC$ǎNg@^nˤ> w/bOL_Ur-+xuД <n,dXLphۛܥ\?7}v B[S>RP~Np2NvL#3lc77~
*+GS}#::H&n(FPUmF
I=_-6cE(ɫӇhrp p+4YIXI?K $QzQ%{_^%>0jFC#
7;*M UDU6nb֪Y^jXQyCoM,(_FtV^ L'j{^ZGFU' |5m!,hlј'&~}`3'{Y^wct 6ؠCm
(pU\xшe$PvA{;1
6UCZ[ cU(1g¿?/1 gG?_#oՏ^$~{C;1t^;""~ڍQ.PH
EU`: 1uEGeկ-'X_yMQ)_Ë_KRx+p 697G<bK)hqJ*O1⚧ߤ_DŽ+r mu COqJ,9aeڣj^avkxD ^
_cc|q>aBʁӽu ~5،Lf|apt_!gŎW^/ʝØ5nwϗ5ezuV#ե ",'އcis+H&K[Ms
o˟S}F1@$tye }?q9DY*Uj(1^IRڼ.JٕzWߕ (x0;%`̛40/F?蛶e:
Gj>|
eH$DM
>KP3 Vhn^Nm6k'̬宮4֣o:-2U)
Y Jy,c娨)+HmJdb{g#F֗b{xl0ţgTR=z)$AaQ\Юcxx]G*@I cHԈ )eJ7VJ9I2 APHy'!R Sre;7bz+qJbXL@cj
&=ILf6xhy;Fp
vUFUs"i gUf2㼖jr^!#y2iΒDQ(u ##9xwB 3[\5okwϐ\\C*6 vV \iH胎 Sqv\'U\'<*kC=9-NP`4da-Ã` O6'Yw#Sv NcpxcV}l ?%/ dWMIfH LS9YHMHt:]-iut{ $ƟFB1⫅l@&O`q_$-jvFCQ)RO (d W7LWVMfW&pG'nGG WAteIs:= @GW3 DM5%Uwjz5!+7
]Y*dVRe%|]Mc-mա 8>{ ] ""lyX"Q<7p-(GDc^: Փv o:*>y[gzܐ|UGTs :
}z:3u^39U=8#Iz=$8}N ~ج5γI+ Z P4 +>>x9{
o`*FCrk
4u "_6=
(,r)Z#9n2.6a7$ʊV~U
W|h; d'84XR~v4^4'L{۪^Iѳ~ sq813ҍ^WTWk|
p*)C0 oՁV 6IrK8><`}C$~L̢%5ͨC;O^L.zIҀHu-**X#qhL/C[Ą3N $?`0Il(I4%
$ eg ɽ@@JWT~$2`B@aTP´!U3#$x}9$S8ًmxu
h &H4g?Hs:
8!?F[UP5PM쏖zZTTK՟Dck(` RMIi6v@@Kq|!
e8= W_E^eX#Y̆uN`~Q;9ʘQ 4AIg?11> *T2:g
Zy
o@̸XٓLFATYjڙVi[:/]UVG;'?D` }-)ㇰJoO'(d+d7SȂfQ}>t K -os,ǐ!uST$I(?~b23j*Y^:5&4mFF>9xg` ul SChAEI)n^z[۸vxf)u : `a~y1$#}3pi˴ ĺu- jl͊z4 S?&Eȕ 5Q٥pʪFuxN|M +ݟ}1Gl klE8b&諠e+p=~mJhzo_W_(Шߤ*[u*<k|aU ><<]^SJ 6b| fGx^0*1
kCcZbqbR47W
6Xprr]|HSSK Q@Rӣ TPN-Zk;:?Z~cpíEF*E$u0nj2H</sļ5%W3rNW'{
K1槆(*YbaΙvMᐟC}X8}EzOWOhv Iz>ss"{&GQJ"TÙޠskM`̿j2, 83t&0׆3t
ս 0^~_l~Qϩ
ߕT
+I Q6V=cH=8;}}5>+^!{V%iԽ,[?-&kGJa ,SC 3ɴAPQJO x[&7n S n03eE7{C&xN} bytu
cx|M?Ml@cװLjp6=TTobD"f"8bԛ;!^qoS|V @xY/
(p siYaOQaR %dV)@`A p+a;
܁0/
kY/>{͝ jFuqA8{<Ay59{`jwΜ(爋l
SZMM2J
IA3I}[k zZ1=1@`ыZ
kAu=ABB"$A0"zh[(%hAn2A>w|<;û8-* XUz+*`CGOVVAt[ũI C|ts2Tn((+w9t y.>oHtDa:̊FQGkp!Ƒ nG0t O9Q6n+{h 1 z#hRa"oҏ5OMT~Z$fjY:CcHN2b>X&r3"Cpja#.J#2Dy\L*/õacQ2(ikEwK3gښ٬n
[I`j +@rAsr $!YHfIT0a>6nqobV ;sNJa h7|5=$P@_K9#o$4
& \ LM,
U=: ը<* _=$e5D"APD^Pfg`&Q=<YLs R gq _7F~OLi_j䥵暎Ě *2b znܼBgUh9&8,,$]3iGUC *jx /$`WqzWMk@=OZZQCہG!>:O~/> G)E >%qs Ķ#,EJ n`rI=S"Aѳ
|L OxOt$ 1!ZGG\+f04J";禬@;K
<辎PJt[;ʋ$MxV|Ƶ G](*z226Vi!QT P)#ua IVɔF d] r$IO:w\ji5l
q; ve'a;1I 5u19>jf7 wv mMFg{ I SӰX혞v`053<| 6x<AD#ID
a||@v{ saN9P2/|(PD-q+wSq1N zPhw(Ō%2הM.!K[@ Tdj,)5KI=k04i/ s(gphKQ?AG7.(M6]ziBQ֘v"ooÇ. ()'/hn2 ۩Nֹ44Pǥm)` 4
UP]"QѕuD=J[k#1߅' '/ clt?C;yM<_IПkDنHׯ }u|""]ã_wҏ@-H ;6:w+F[:q^ P5f753%oTq-i]u"τ5e _aԽ4Fh@[j;P;D C_sgf{TF@Di\rHqkA꿚9]a<O&D~!|aΟan~E=v SD)/wYv"e̒05`iy㣣h"QompgzI
BRЇ}L}Gc͆
/kz=Q':Z`H(&Lp !yK8E1.yI_뾮ɻ./{Q;EKջITꙥF Y7)7F>l-J21~ <ƭ* Xjjħr*\],/Z98<~p\~eQ}qcuI;@Ss;hk̄ZM9kA1Mد
&@} 8unhs|]5jk1F.>>3ʯ~)?zr ۴y6,IW1_(Kc W |&pDt[Q]OڼSF[Q I_AP
ˉ5h#z ƥ>O 푈űH"|NI=ʹ8 m )cC*:P300Ut NQ?uG;.[nqC^Odw^/!hcU: V8N!?Қ2f I o vQ`"i*B351j v}@o KK#|>`Qx^+'pwg&Eo0&m ̴cq1LyPY
KJkBh.:X*Ey(Wxd1+@R_W6& 3ҝLfn+cS{a|]Wv ώ+ V\pӉLͥ~ o^ aȟFg )+J?㢼 8Uc]xu?NQ1654֠n_/9!E}NQKe7LS[eqy
uL55456I}T垮fS}[O?3<3u'WV ޑ=\z d.f;ma*Z&fy.
ME)u3|k6h>D9&`(i?}'fޙҾ n;3i>Hza֔ŵM8nw㽦:1<A_Ьa 7k)
0&&<|i*Cc '&9
=4>J4-GХ=93H-摉ڱua}2k$"}3i⼯Zf_
aA fy2^~1t
b`p~ӌ_a-!c?ovc,AL:tX#9>d =D^%`v)ZQW<OînrD$o PL9QX:jp$Aۦ!S%8Edi4a\5Y(OsسځWNς\i(k e>#hpG_kIG5kJ l=t4^,
!ʪDHx}5e }hl؋ήv\pUCD&xESzP |^q
^eޮ5N BCA_$ }?
_O;O KKwFz'ut.O DxU0t"I|xR賆1+ Ia !q3Qh(XZ&!1In ~%u4d:$@=I$j߲yB!'иZމChMKg p ޮ4`l1'킓kܕX=@ Z 5V
&I>vUx¤$j+s$ivl.bDK4r|c LCAiQ?;@PMP`ؤ==5usSðO2 $2D$ S
<^?RE LarƂP$(3/, L}Lʹy#u 0
#BPto+ť d!,M)^5FJM {x
Sٯ싂*od^/BF"P9ıYí&Np=lW5}䜠R]'ޫ &[A5hKQ<$|s*`udo}u0N1[Z> lEPO Uk{#A%\]\.GGF5L+r*K>}PʐWPOׇʆv, r
LO/o_?+-oΟ<W
CAؒdd
&+-bԓ^0Hb?ۣ4l S I -*L@-{GF)]`u! V9#T~?H=8WPgLm(I;0SIڼv("_;TvR0gR| p-}4ڒ9
Eb+p#Kec e*Vʰx-֭g89~\&um1 WV XGGj@"v_3ILiI80;6Q[ :@f>xD%A E$Gniڂ) &)8$mDna )9 OP?'p0AH"AҠ
^<of$ג>UV'F+.h6##sE.;SfqdDA=;l-ehi}|7m؊A }B 5Նr)7~S/w<
Kx
l_i6~*81E%yn`2!~݂-*Lo@uQ-Ԩ|{CWW7qvIJJJM@PS=^
(`^S] *s
w NP }Qz൵SM SƶM9[(ڀ8{~-j%8u<IDuTNdMpǸ.T l+d~?/~D&JH"iTiJ$ ݼofJV5cR>=G/t wDq߾U+f$㼆:m6yˊ
WI/ e $3{ c#{&Ly n>:Ui"Ĭa꿙$AP( o3?gFf>&G09:lg'%LLgry1>N1k5v G0]%?D?~Ì6#ӱ ;9Dvlt-;u]
ɡ2I`$bBYmnhV)& кW%v!S@;z]Wv IhxBs< ]Uth=X //㏟`G<I<YGҀ ωP;[F ;nP6y.YVcښ3'Yu Wc`Ϥ ^v \^
[KepC kQ܄At IhCcgz5$u/gsD½$8M
1\+H`Á5 P<t\ dD).
v(կ$ $WBP! q (v'ϥF(HX8ѹ b(shQ.k*ˮ #˅"
]"% Rx& jDO.GC`HNP iی{!qUF1<6 ocueŤӪ92L*cn~Qn #+%];JR !Мe|` C}j`[zZ;چ֦tQ<:ѥ7lvg.<>&If-*[N+ 3"C= ø+@sB]!(F^M %r" $z4ș|^'}yӫ@:!o˻<<*iPٱ6TAqSo5 /S9a=(|ua~Oa{%<$Fp 1~g_ fR\=SEUlH#` EPEUիCsm>-V 2u
t i |p"|*6Q{ {006 QQk_V_״vdzhzeeאyw)bG\n tAti5gR t<0E0Y~P/L#]1pK ?$2JK>% {/]nS%(.a"gz3UMPm =)3E QF Xu z*xF tL006gD.ʵ8LIZ&' VI4{d U[4)}-S+ 3GHdu ZXJI50MD õ2Ir&ik(ZJmh^
qӵd7k w ZV AmmM!M5]V߈Nb$ ,AanjeN \-m#}Q^ Ɣ3pnL,JՏjWIR<7<{Jl&e>"Y+ =*cLVl5Vxr$idAxifLkߤڹ]Y9{>髸& +N_ <3<ϹO0Gk'fvv0OrR&YWn >MWnTW/}G0.Qk>u+_ ~LZ^*] %1Ow u-0} ZQI<1=5QhB&wpv'XO Fgx0⎠Gl $]s .b<4R2umɢvM/gQUTD@\OrV's?mJx: /רIM? JL;g&iss$ !Ohd1G]=ݟ{ocx~}k ^#32JW*z( i-JS> wfk-NO=J {),&NЖH_XƜmJK|\Kʒ-la`$ --& -6W_[_Tנcur !ƹ;bqLĶ =ݸVZaFʶu
"
ka)ZHv?O? Y=R A(*IlllJde[^ SO Il\h$mlM 5~+{fc?GX՛87T" ~ÏgoI|R .jp7!(ܳr G !bb}b;SoKp}\~kbȾBMu=qU\xЧ7e(@GFFF0==s[}QFTOMZ07
O (A6VȠ Kc*(mt1xG8 b"^"K<&$A*EQe " Cy=ePyf6Tx. H9(>,m !*oh@l Sx9Iɣ' @I,)$蓏Hcҗ3BVnנs9mMV-q};ɝ"**ИJQ
SirE&q<1u bEoJ ~+i?T6`2/5Rڴlj$FTWZ4כYQA_%u(($$"i ?}kc2ۺ3hF^/oF4L60K{&.L< <EGSEH@d^}*/X%& sbp@eK6U!>*+ߙ .eHt}tJ`Y
{W0dwa1ëU|& Oހ dh"\:M_>Ӈ4;ץsw\M:}W}[Yq41Dew9
͵%\q 7@j F053Bߍ1 kʃgx$ǦE71_H< aȃ2dčtԌ cl$hx
1Z +e^J(23P~ vr }dިcg(:kKc;$1L) ^iғTrl ^б4wRj GbfknE0鄵f9Iv-fzp
]CrJѩ+jF㢃
R+Tb*rχeq6ꘚ 6r8Y
>$Psvީ"֪O.GRkFi{F&H:XU2t8\[7RVR:H!(PӓRTB5@ةgn@#c9Gp9ڋrVംOƧVRKsO#H6I
LcAJ%[L0E=HHnz^xNNv%IH4Φ.)d0([= l44h!:2@<?Eݯt}ԏ)"Vʎ7Z:ؑOoj;O9t N )MJFϾ2)=\ 6I;.?T)AKG;* ZM8Fi $x5$$ 7{p 4x ( P &,S0
,tu{`.&M}vmbpe1~r ] x\d[1J)_hbJB5` ΧW𩙑+Y{"f$ nBnvUiM1|Fy~Awu3,) k/Lm'J][?WBP$)X"9<$
ک({F'W:AzF;{U-]Λ&_jL,iW _ϙ (j&5ezl$w$I d |Hf %,w{+81Ntv?UT [syp0ig!~Wn7o
~%(-)5A2u̮C A~yE
C.#AЇx6cJYl2k{ }#C&429Aك~>ݺUswri 꺸ƆMW?^}E^ j
(4~-75 ,Js4AvS͎A;" c~D%H{t̫c
n<F #6`Eó4oSz\Hǭx0W}h>F
R !ČJQ?_#{ '/MPF;Ņ* m"ٯkGK[Zۛ0L;DoVUW{ ^j+'DׅsZZzt>=^ڊqh&lc$fTk.&a]~$нFߤkoOOi
l>xٮ:j06 llb6!]!9xQB>Vdyw!}t4
ji u"?tdj6'r瓟l1t47m ^1$=`!I|!#uX" +4z e V9?*uxl{6#ce$=i,3 #q]ՈKJQ^YoRoߺFDI
ܺ}Hz۔ߢ\Ax:OP+
朴NҗwkKY=z{;]V_
UۂtΚ7?2 믮
ԁm?RyuvQt_
:~1[=Fs{C`gbivoYGNrhpNj)Ƒ~OR0uDR(p""> ;C
ITGf!uۨkmEEM-HG[;91AxnJ"._N^n7"N$msL l8\N̙2VX_[6
TjoRGO!!MhDv"+lLb;?
QByj+"{کs"
I뚌J)C4!jHq<a0E} e0Ǩ'e%ү7njb/F_]N|波 v2EFM&?%z^Y::R,|
Yq@̬"2H+=0=+c*pWMSQ׆K۫p-r}}9*+]RZ *cU}#\&0euMu]h:j ! Ĭ ߹pnV6vm'Vsݷk
zl9(4iЎ6@_kAY%*QњҦ|GV6*9Wث(ov)" ̵mb ]Wv &\ L1M٤0KG,,+N֢*ajӹmHC BG>:Jw0]Ű+~uwd*oh]}k'(AUc+:G52~) 6w
݃sE}G7 54B08dv!-H'"4<NLh"f!H`q)²x}tn" Tm;bQ))P6Ҍ4 ) j1XTKI,+EOTt4)E[I[^\hTRT y FZZ7QKYx+ Bt (JqtȂ馬)9m5ߘ"ML.Jh+HQ(,Nvq:4~QՎEѹ$4" f+aa}d9ts
aXe%h@!WW**5)CcC5hHHiGawFVǭNL8$Q89;)acNL2nIi"] Eߛ eD(pKJ<ANN
"r 1Y1<lxqa6aTG-CD >o
(z (꾇Lur:8ɦ7~#ˎk<zˏI\>C0*գAMG`RAH &&p6
tխ!hkG _ғ!|^i
$u_
2)
S1ԏN.[HD8g11k=9*[.66 6tE ¡]>eDsQ~ڳX ԋqu9zFC$X5DA bFR(sp{Wu쁚 >Ӹ}e˯Apk+*2@Z/J DPzadqB Ӟ4𧖐Evm_(m멋pkvbO7Y&f'\
Z홴 =\~ǻy-De95:2I~Ö́W@B8 <Iݧ-Ɨ0j``|ƅFTVt6R]]gWUբ6u~k]}h#
7eaH?3O8ۃf> qzeO.l0E:Ҍi^gY+([ T
ҪTm]g :M)foXc.3SE jtשQDOi:Wn<yȃOYZ [ߨ:yYH _ѣmyQZ7l<Ah1<+ \ǼAqE$ Id`$uBݯ0kjDcs#yz14:dҔLyA-u0c2=VԷRi7۩! n ҩ(&a)ǣ{y~ uTkfH5>u_D6U%H76 k x GdkbHu={A}q ϛz$4q0>'Hج+V6it= 6Pz>5؋ uF %, _*Dknk~%+AJ&{>9G@\kDD)m="tBc++_Ɛn Y6Y8kɐm乳q"WDy M9i0ePVי %Jnq]5룚8>>dki'%yt9;@")'P6fHf%HN26C§ ? 'Ϲ(>
ث 8P @b T怦X"˴<)Έ&W6>C:>M[$RB@kH~+SEh +q@Z<0 ?'pqLP?[*\-?z' =k^S"np}hhnACc#ک}ݘkAooygq P@} ,P& m jhOBY1؉{ڰƣ] Q$k* #&ӮE]oY8c|$m8҄-QJ/ "B`@#>^LWWcb 9 |SIJs
x եN9os?ǃv 7ө, >d_\)CǴ4-T 4 2ϣmzryy>m
*{py=,Jg*<Cȵb7(HQN_Y 5>vEyĤOGYy5kPQQ2Ҳ
.)7#7601=eb a4ݦ D1i"@L
։Iפ{z3B:I( dWSLtXIseKDU~zY Wꩰ0 NR%Ӽ*szJ]<^ Q@+E;P@8[8ع >Mv<=24jtxNmeH mczO'vC0
ssE?
w$;{H QR]%Mg2ݯF%@Em +5 NFomBmk#H|`2!m$:ޙJ K)hcI :ıJ
2 ٠BmbaJ;]Ӄ@س-4HMIBDC\<I.Y܅F-hjUc*C:6t9BHQ$¦I7
ul;ڟAF$dL `,,be)nJߨCϤa a5P,(]NlbBU 2
@h1PJ6hr8 !9zϜ3N C%(H9;ᘨA SFkGN-hhⵧi%4O-ݽ"ذ3_#V{?ϕ)=lҰ%Uo&QA!@7d\NG4P}|^!y U^Jd5& Pgx6ndqS[Qb&;Hejh W pd. ];P G"%^iu$u|+RN| ^<;9 5waS:wrHFLHhu2Z
5<Z18=^Yi "q߹t*qmJ ihr%Qzizf롺L[Ϫ>B &TK\^= @jڹ8 o 8ԱZۧ]zdڼB:f^g`e4
8tr."JWX H
R[/3ݡ>7 |Sly)[Kytb.?:kYGFi)YqfH,x>
W2a!APmPBkpN=v%+m5LK'7Csmo`#-`_kyVW
(Xm1[zϵ b\?c^ Z=Kѩv #CujG f,%姦K0sA0<9>{m Cd͌uUytYA@X"_s@~Ru %nES<wxF()[ROL2V4NI
YEs\DV0IcU oɭo089c%3@4@Ds۱7{x| {{$N~^Mo }DOIfr/i H5ꍑď;0E z.W|Lx(Wt_= *ꪩj^,継AuC=;ԃ^׳ӣ&e_~/<z <!/f1~ ci^ E@oOPpUzSm3Avb'.&+hBx;O:xSӘjGXVWWȟ|WX= f{"ţs).*8XlcjH\B!|I~s#=z7+!.\˷+101/~P6 e k-:xccy5\s-SyLq xssDZ݃lngC` E?$:S<9d /'[M$@s> YLp+KAAtvtW`Gg}|8?A Cы/
dYX?dhtu1N A(W>G/M߂RsH,o.Eѕ='>":*n RC$
)k[L$#(}]e6m]0u
?5Ť
_9W{XX?+:joI|dVY2*IS
61
>:`zv6(M@.)˗q(P&Ik!(@ QJZ tPmz ̴ĶmMxs/hۂXHqMz\}.HO 4Rv C FRY+yڲ|@_Hu[A
yd^gQ A+ftXV&ȜUsY9967ׂD5P{=(Spc1P? ?YW{ .^w}I]uVvoS@;M 'TP0Qb,v 6- W?#hF`>٥/\s#
Vq
gdnu]=C<]}hi4R5
C1X<6 ?Yy-ḙJ^uxZ&k^xK(\UE5*WI
uUu/G)o!7k-f+zLzoS/SAAAVf+E;Pi{Z1$0!!G[Wٗ`!J=8 R*KOp:C%ӈ̅ l
D ~'ǤՉޱ)k ^UIpM('aQ*j4q4>::.&.Ym-hhAB$mC Ɋ Ӂ= gGx;Gf ?r>eDE
4O#S`繰f)nPsG 3M \h~^XېOo!HAEƅ3"ap MЈi^-PTI8HE4syӬ/-{:YB5![E
uLi~%xt\4 3BK cjD! -`Իcz_ Z.ŴWp5u:`zn2>Qy12F FOB B[0GAQcvo 0;M5uO`x̊9̸<89:Acᔁ)s0yL9qM >Bю뻊S|\@Qt~Lp@i] y_(zA#Z_$&:g
FHj#[3"5X:0 һv IC c㚱ڨ^S|x 7ow~
Gk a Z}4f;se+ufk?͵6bu2$IuC[O *( N`k`v<kz ?:dꗕ}00:A@<ҏۨm@M]-xp'Ϟ?}/ɋ:{a 4>5Cѧ)P^)swO(ǦfЩ ] ]*SJE~QMR.m= Z"l3Df91%`ƞ;v&
m ߍ>=nDSw Jӈ<nC:r_v7\J[5
4-fF \q;'3Y3yqWƐ,m Ay$ ܹCPHsr}l٩_WĄ)@ p+ #%V7Na
Os2#&Cm@w/J1}FFx 4౷oCSpm?V'wh?O AI'3:At[bO YI> Ο @@D~1BPR.0K!b@D\GcHLiM2D*4%<ߤ Ys@Aa ?Zo
I.?5u)q/P 꿃A]K_y5',^Әڭr" ē^302^.k5l&(#(CtouTOP9~+E?߁ΖZ<GŧO~F2t `<xX5
WJE+oYj2|jl /gKCkJ} /n*+B$
:]/q$ @+AGٹ wFlO=^ڸ. )#i3d9f6$1dSp}.5G'q 5s Qv^/lD0E_qJ,OIbĈ8jP*!d]=2FۈkwM4L 0oKH F96tvS1L,3:5NccsWz#i %ͨҝ z('m`hD=Q>4
m ^R2(da(aW@@FU
(m,D1@>`%Aa e#)P((6ӲyNH.I=ĕĂV,g"~ٯ;O>UKr~SJ:54C4C4OA7[K'as`F ycS zz:N_m@e (_az SM6_FӁjSVS]P0
Ǐ!ڄޮfGj IDAT_#œ/иGHSOy]kڀ~wi\H"]L1&."nN5OMЮ^M2˦s
+nso0ʡ }mu4@! ;${I 8A c<ȬN/ca!.\ô3d2K+`5ALaDd9U6h8C~KOd$>Jcx whkyb l<Z#)X`
O(M. }ݧnu
8HO=..>a6 QCC!4Z=Espih.1 "N _I'5Pv18P H PGqt%m6Xmm
ҷ Ǎ
}Nڨv
r
ɲ0?whpȬkV&
\j%p2F K<% 9kid(jvwD ȈE`
u`b!X'$!hkFUTfi F;ҀTTTJ㕚Lڢ^SVSjr5jm@ FO;&'h0zz[ïW?۟kgx =z ayjTȽRRFNޤ ]xL
{{ [HN
yL"c { q%Sl貦5D%v \a%IXb蟋`tA[!OD~)GOd1? G IXϸƝIҮ" ,
YTq*Ih,L@ Yf"LjvfM,6s8]< 4"VE] &b)W 4 |#qш[lA18A 3ur
&`(d}S3
K ܮҕQ༙[nNxh,s44!H0 B(B!`+F)! EnW zu'
HuW(K+@sVչ+{=#3ABif1$ؚ >ȸkKZkf ((~_/ǂdp[+ C<G=lawqF;n$)"5 qnjU4k
4v
4sNq od|u&>Dաx
.^e|ut"ucdp;M.3 ;o_/pSQ:1ul=JzOci(ϑȥH 'H?ݏqkڃ;$ω=J=_"^0AK>Ph1j>Cm>EiK)-.tu3AtNous{ 6T7>Ob Kyqԓ`keWU% \FlZo3Q vI^ ]Fx;I q<ɉQRJӿԶMD\j5 V;.]ഇ!P>-7<aXACF&g1cuSWw,-j TW7
\te-R.^ƍVt ZIR њOQFIR'|Qc$fL"ssi8p+Bֺ,w lQ :g ;MiWV <.&Lۣ:Q~j
1wE"M Ν cطL"@poWSH
!8v_7)^3X\ }cX
l
| Ӷi OVַCc @Cc)%ilm䡂@(Kod[&{@}N_QW_FJx}?|˪L~Y49=
ߎ.\8ǿ_˿_? >ǽ_,)G~[1O>5M
դ4ǣ9;iQ
]rOU)
Oxp %:n Q?hwL11s:n6.S~m@ .zT ]c^p c ']\ lyJ XG;!vhUzP-yWf=a֡) _g%^E觥G;X} $BF'`*IIC/TO xU $aHl(,(u>qfjƅYtLLQ_׆~ֵҌټx
Jje_C&QSk6ʵ4
/gyNq Wib7t]/ (@A@28(، Q_%- h3c "&1?*'݆촃ߺ$/1ߨ
,a'.nRO$ A^'b
K ɯ?~3<GƎ)He;V{(]}ğ%P@SXpdєXD=B1TwjEcSh%^oN7lsav*1Oe9ڻ:M#FTn_3jfwU:+z"[F)\nbQ\r_| ?/p+<ubEդo m<Ff`CĤ|^OD
}e~1@ _@H=65NAN?4J sya֖nP?d-}M6@͐}h~7y1[h:B>Bңbqa'u8P$I,~[
PQw[of]_8V AiS]}`8<<ԧ0ybxI=zw;<?*P6j,QAK0z9 eBӛ:juI] G_TmniCM(-6ruR|5\^+%uh靦O`V.!
&tZxvl^GoX1` y ( tyhjD]QE]1]ݗkD#S@]<J`vU'Ժv>E #C*%W?[wxAIަ0;q: ɷdRDgdEij䧝QQNw훸zd&A҈ xt5i}Wn WjWyKp
$`lx?ZjWK
_? 4??zׯ ad_uk&ԯ : :Pv%Vi0zH*^@3Nd ݼݧ S|Kvg.eˢÖFB>D%8I
"P:,qY&sf) Y #&vDI~d 0h8Jjg(xEH+ 6+A Db ÌA4N-Y$iX]?5MoG/hvB 퐴*4K{t]$4=JRTKЭqU4fD$ LՏەt2\sJnFEAi"@s3y>RΛב
o 2x L'lݧ)bM= N,Kyy ' !)R<\ G-+AmfSkJ9(T0ÙJ$L`k?8=g^{ϯ .|9D=#xy } qjbFDhLh?F w*]ZOÝ\!YL[_w?o{G.C3Fh/_o} 1>G]_GPK{#߷/~?!>$և }:z5Sp |?F:+OOI7x/~ю n#~}ss?V\?e{I9jq8TK>ON 9ђ~MvnstVv.$;GA%DCG!Opht E<g"SÇ{X^=Orp۴IQt^֚vO
C7mGR
i"1?e'i8!qGBY/ вJۤmgv,Pds}N:3w|4
x㋦l QC<9,o!9E ʪαMKȴ`N7IќwR'<))¯o-Lt] G{%puЮøv((udU0IPUZRe Ӵw8BHbZ j@j&w$En. 5ǥ^`=c|3o ;?S 5n i!\ceӰʭ!DUpzÂ=|w?@WFS۴Poƥo_x Kn"} ]wI(#օK}
q:zZހ m|現 5ʘK<ϐ?} ͔w+Kls2@F }wΣ>F LSM3!O@4YQ}992NY$jv:'Q\?$&Gbh++8CmONRf4J-gV 1w bu{X^~\/u~Sur\DABe2 H I-*N7=y=2んf4jaIe@z N!SSyIJy, 7sٳ J]]V\7eMĝ h @ՔYI5A`җ_#z5(P·z^n@ ?E;2i:h}^J5FкicVYP zW
Ĕ6S3
_kA%0N{F5!t
>uTO>'I;?7&} S
ϛ SeE{H__w>ַn|%ww>@=mnķ#Jo.o_o~&!]EyeWo\lY_ku֍v*P܆/^AiY9K"ݟ '//?Ǔ/_Z*)15F{o5Q;QY "ױ^)\XL%Ya,<E&zNszl\'>odg֛kYc ı\/d6?9N`sd_kXA-`}}?}/}W ʆ{ :nFqB
gyY2<zE^t!0Ժ^S4-O1bQsGe oREcJ*= lW8,Z6'@]uQ5gulm4f iP F'D=Se d* 7KD 89+{CߞwEkֹktNTZ b e!t n٬='=uQJ+E;PÃ$jT'c>&Oς l7?|7QO 1:)Yug)3EuIuXq5AR {z?`R+p 7pת*
Z)+Wy y\^67oƛePY_˷f-T.l'Ƀ}||+.f kl{XݵhA B$GDAd$d JQ`ĠӐ[, I (|~91W$%>N'.6}6-xX+HrVrxWKE)w+kkѹ*bu%ivnHµk8I8<5xq70kz(a㵠)<zFL#͵,Q ɯO!(Blҏi0攙 B %Q$[
U{58.QuK4 vbhk-GN [?4
0v?97lz,-n"o Ƹ4;+ {HD. _k젽=4F8</NӠQjʓ I
z`OLAFPW" B; 'Eu <m D~ iھځO[$ Q KRʅ76wc<|vO[3daWC'b;d
zj $ L)="Qp -]#1>9q -]٭rԶ5UD0o] zDB? _55&eJ.|WH<*Z*fƱN`g}!ǤH2ED c~ } 2&R pC$^ڂ.ݚ6 A%f⠬ % qm&Q9FPsSM ;EgE00
,) "uxqpz ۰|tl ?_z͔ nP VI}@Au΄Xm` [ mx#C,8 "(=hhc
Qu 8J~$" }~4w? ]Ch Bτ =c6ԑT&fnU /k?B 3MXtz ߤ]:EPbNjB_ B
o7RT nE#)4u.>[Ҡc5Gd3 zZ7*~S37,Aα ̨L/ ?Km&a'$vh(a`-1
~IUݸg jh}%WJ ?ŜA=ɉi -ݨjiՊ4vLt)_ )xe@/P/3rY u=DpEחueM`eIJq;06DdzdzOR>\Nl7uO=HH }"z<9t itS$m@
:m떩o.u"$e22TR WwF*Fԗ P#J 2f~Yw$ y~˃P*S53G\1|Z #u]"
R+z`4gHz~:4Ax(@ۚVgXT"ϥif|Di+ydj&kk 5Ms-mlGUS'j40m&:POݯmlEUFvIR^یU
p"8,Q
ƳN+ 6AR)/mt\] k$WC>-K
22Zk *nY-uwG l<}
k7 [,w>_ټg qe}]4rQvRNl /OPVDGw8XHdIO0{0νwli:t"pPcz D>*9[V)g'[ m}-͔ܷa&BIVr5&ӵnXYo\AaU+L'>"64,?9fW뗬cl.y-I+/k,K>g7.aϟۥKn/^k%~ύs֬];8b.H^eݖ,=ſfq} d
q 7 Lf g[Nv!?^X2$Drɾ#1q8ܦ `i{'w<`+'ݯgpXrƣ'V<K[7rg6=KW]^W dʆwf5%3hwN-,DRpʺ'w$a#M%6 )Y`H6aH咝.x0 \v{mJ~FXgѲTj SNmw-.M QY [Oz } weϵ ~}J>{5ϛ`@|ws`?<QBlqlvvJ ,s"Β=\pyV`jdo~>u[>O` *Dr&& @jIz2=9; bkJ2H#(+e4N)(T-*0DFdHz |0%YF?o]v] +KrW]
N T.arѦKE+
6ת ʼEu ~yFJmGτc" C# E϶A g)2q
{PH x ~T@!좜sF9q> %sؠцkt' @( ROtR493'C#GX_s3Ƿ,l5fvFKH9@jDS]ґ=1!0rvڎ@ٮ+Extwod8_G۹- }/^cKJ;(
/k H-Dhc
OǢkLDwtzF(C7(.XWoMe*I۴]w:ӏ "Vlڑx1rm9OuOz_] Gt@A&$} -$ںN:N Mhh$Y>b?99Kavfζ u{'~xk]ykf &c'N7ۊ U~"u{oiG k'oJ5s X IfU:vm$.t ߕv,+OqjVo.XI;+XXDvZ`.ctc P*.tV[p&cIm3NF#1'PqͮIzD0(O谾^ mmmWf*Vx\[iurK ͳ:] R/aVp ֱEZ'.ChR6 {^ >HCl9 U,%YY96 QҽiDY{@:Kѕ'@['cpm-l'kM;*s"[-RqM y""܊ OT&N {Ύ =n~, 㤾)B~^%dmɯHK}vu{E$|Ml,%ݝHf㉤ţW,T<eK"FF_7_z^m c1EGt?=
(S KoyX+'4cCc{7-9[ﺎȦ=B2Ŀnv ?kbz؈&
GC=-ϵ~eK NKCObsV^Ij[Y? Gحt<߷.=: =tA}˭h=<YJ,D+3r([PmW;.j-Yڴ3%dGEDbN&-gl"Xfg-vtUt`Ȯ > LتtiiFfjy(3#yWއ(e Ȫ@ܤYm#g,92 ȼ AΘ+zT`tz `)|>4eKBE4F[E뇖mmZ}G lYZD3_:g|Z'-*8Գk lʲ|=fOܴC9uu ;=K^=*Y:4!X~^ ;s}6JxFz;ݲtS//8ZRlnڢɬMƳQg_~}s/W.uP(ctM?+* OӱE(ҤFcA
yOz}ԧDҧUSd7Hͦ))_m/ ye^G.;kMX` ~of_ߐ5y[3Gksfe{ξ fm;} ۵;ed>Bn 5 J5nݿيfdRKzv7+椃5Ue
eBNZ-6e}Cz~q%}CL?Mٵ>]zw^/ %[Xq+!$s3eXU[.dae,hj]X->
.6`{u{ F'{J :" 2k|r(udppyh[ͺ Ͽa B ^7q?m![c d'ق];lmwd?Vlvƌ1&<+/+ +EF]v7]QJ,kY<'(CӖ*MԔuk,>lQmj,1(;h < pϹna_fuc/uQα}7","aN^8 gp<voo_߳`CN_Nww,;a33[Y,ۣeߴ?Co~`yHd"%ӹt{w\ FIq]0/ۈ ~Р[_=!bE6
QmFe id,ʘD4b6;FȨE,jVlg{VW`Ά5-QߴdmE%DЖ=?"r$1H%(Ÿi)}RIl gn 7_0g1it\vY tu K$nm)) z9Vu7/-ζG
N4ϻFy,V\x 'g37!YDp;mecڶvkZz&|22oOܖ3skL"9
3r0=31T!\VB:3<n7r^u{WUοn]k# YvfŖ"w \@#=Ō-ِr"O e9{= 0rf5%4w[jKY;oo ?
dl}}n~KDyFdpww684gj^ >"t^Efgxe{ǟos[ >d3Rn?#SGn" -fR[9E懥ӣDFB?,b?azo5:}EKL -&0"L$Sڏ[AC1Vj"5 H\ӎ5g.YZQN\YmiiҲFP#bH}{H{0 tAx5YH Aڇn6?=i# )>> X[FO82+=e5=k>GO]jkGr% YVH R=H&HQA FLM$f2 {ܴ7UkX,]YxuѢS;"),Yqn)ӈ-Sdvb)Ypc8j]c ە1mǬ$T}k&3v(\D
y/^߾vɾ ri4D5ځ] {2A+"g]p'J&Y]vا0@}}?.4)c R֛^ XdU.D)G@\%!`K cwL,YE_hӋvx 7mvmϦrK36`v e?P[Y1O|Yh1^ Y^% fHOo5mj";;jפJd&?8fCvw@Ax^znӰéDhtKJqZߐt_6cdBcjZzFGdGD
fhfg6۬Z!zl7Odۋ4} ȷgDrm r/R?Uu(')G-2/pl1IJll_FןE_Bʳ|>u a9v6z/ r\{Kto11Dzc|zPl ;ݟX\}[ص%%7SoK[;}o]^11r&M6KAfoweu_b%^GѢXe%+szҼLsZ('g喅5nN$k"i7ƓvM6j߄k[mmFo%p^~2+W/g^zþU{rNfm<SNqOuV@˙b|p=H~20 @ |`|6XH|X6@E>$(Gw]' Fdֹ$XƂE[eՔ_#֨\nHu?On!1+?ؕ#$3AF+:/J(=vΦYW㩔MNNȈ @uuwXF
{ MguIX.ع >>,R-q-[rCeǧ©k7*%+v( X-Z 2_<c!A a 0Ex{ y~(#= d-Υ5<QlۿNŖ'> R
Y% +d/9} ,͇(4r8 eG7] Y̒|7}PMP7y=#ayG6Opun=n⎕Y%j[c3. e^L/HJ+YI" J(iH ',?&? u 4olem 9 Xo5?k_usRǀ]56$I:,H_ <^m爿?|=.@6Ӗ[ D lLc]ח!@F y {[fꍂ-heڟm>}O@WA`V~CEvrz]8ݐq N P$fzȽ"-ڕKvGcXDbкX-ԫ!
!zz}Qwg
E P= ,<qVr
;4Zu) D"#s"H͠@g3a$ X@Zd Yr}9h}Xנ{u5e]{Jd["Yãq0k/C)`mr2[6mU il(3$r2 w]Zܠᑄ ~9F-3"MЃ-{pcΡO yLHe$AmgHْƛ,,K8xu-6h\@B 0Y,lw}^&Ó.p`@9s2 \6oTm͂e<); X@&
|\&:qOKGຜ
w}d*l&8 RT3Ko=.d1H 9-:h:kt_wS+̮vg0g+շ w?{n ;5߱Y <dq be9ƂT IY8Lbɒ%[͗^.ڹE쵫פ#uA!:_$Wdƫ.X,wNmyerYٶvwmm{n4Zrz&V%DD _`
٧B l B}ߗ):Eڶћ ,"Y-C~MF˷9UfLe|jr o ?^5Q 0^9,[,
0 gR}
j`̔yYhحw={-YsmM"kJ.]4|嬥'd a[Ә,4fEmnhŖ EBJVllp atbEv aYxuXnzi V}?NGszJO#z<#{PZ OTM|keTP3Zԑ"RHmOEzV#ɪע%eFYO_PelcE?-
_;o3z$Zs\MOg_;CvkGD ~ 𪐡6$NMm4pSg++JWse E3|SNo˯]p
O߸rå_:DnC.@p[dL~?l.n%X*nwo۪ l8mRɶmKrt,P_iX
Ă|ܑ;4AI9ឬp-LvVl3&{ Auo÷ k@ 1 8K!"
;[A
5gge@PVc`AC*C:U.. 2t I =<%koN Jo@p*b
<xb0u(_gK"ǛGV[ > LϬh mfvv鼦0U%m2G_||Mj [VγJeI:YؾJ\ /?>אITDgS~u '?DŽ&4?E3=*'mtXv%9aq{\MeRzϖ VĐ 约{j噊-̗mof_>v͙)=?9
`4L6'3\>8
ULd,I[ re Ĉ
ثl߸`C ".ZWπ)kGB"SQ69ar ٰzޒŜ=z-./YRZl;k۶#Lc>gߞ]ɘx{q}Р=wra3avb=_DC9?}'6Y V<вyAâ邝}l֪}]F^<-}g$
ş?ӧ#Pse i:p= 5cD<<N
J,
ҥl53]߶ŝ=YڲH¦dzY۹ydٖ=e1]+P6'+}]/~Άa+ .oZyB[=G S~ y-B"[{{?w?>}@i|ɖ|#1Jaxu] }?KvrR[-J<YOϟ|d_ڣAR~`=f(k,\!~cvviac2#M NXX`_;Zo].a_le8tOr!dm t&.Xdcø Ypk :e|ajmm,:tā:q R"BHZΟ^ yA
)GV.s,O{g,1/ (0p6K@e p bB XV" `2" X݆*t
f&jRkQkU^҆ ;eYkd7PȦr3VY:)P(/
7q&<8:w4pb7 ߱6큀;ǕJNp/
zzh + @4HONemt*:c9RjQdJ(X !mS|6NC1(%" tfۣP\6 3<Ӝȥ(8h3
% q lKju2=Hm"z:i4p)4ʶMU4
;iS5;Bv;Lu-@=kr.;2u9Z.Fm>zboggO(K48cdfh,88ɘE+l6/" 9(tg8 " }Fgtv]Ld/kr6 J V!NAtM~#鲻 ʮ P 4$R3
[ڴ=ڛG;AY
uM+>i9ȶA ?% @H;vwf'{Nx{,Og?x"o ܢ$ 97^XIwd]SE'LϻEw -nZ\cJ7}z&.g6oy:f3kgjN!fjO% iwnۃUOquޮ@REOW#3tqת"#8Kv>{WCQ럚QLվq,zCD:3k j<t Ph&X/7 Z "Y
u/ߐ][v9MV Pk>wD(7@(uf xTYge,0swݐ?g̈́ LRF"6?' // %k; oRNyrN럾k_7;cW~c 3F ]Ը *)фs '"ybJ/v ൜] Co.tŮ{z}AJ
Md̥9}6bclY_/I7`0 (^@RgE&W6mĞk. Gm ;6 |!eQ"A{l E ]y_}Y)X_i}u+Z7R䴶w[b{v|=[]ll }cMOK_phu]W / t|h#B") E`ݬr)HsesqDfsUkdGܲ/זEEtvt}Nvu8f=iH ^ q}JzGB6`AШ]vLo YYf ҵ7o? |F2UwN;H?Y'u{ <-(;X: /25U֘ +&巣e:+YnEt67E^61O_ Qm,mmٟ~
o_t^dy{G$EXhVlzfRU;} n
6YĤ/++z7 vy ĔeR9K369X"ݙrӲyq .`:o C}nԋ.u;v|zϖWt?Ikgl{}٩HݯXF hlquc <HZ{DY_ \=aM!EbObuGڲjB_sό:%a=ۻn=yn 4"ics v@1M guv%`W׳IεwضdoV[Ƕwh+̠>P;U"=(
k olwzSq^>w;ttj$\F䵾7ҥ!פ34bCG13vˉm1.9Ҟ5oiw>
O7yj@s>g۞ucP"z8 ~N/U H`/vooTv!Ǝ Uf*6ך=X_| / K0.#6%qR m>+EwNxnq2- %bWϮPt0^6Z/Nm(͉$ndjqtچ&lmqNoE6?װE;_m)$, 3 u) N z 9a\ w= bgT86FHc skn(bWڶMA
*n5K|&"#M@2EuMT~hm o gmON jg ;. hZ1 ukO%ivnrȼ;3eޒoauN ;.K Re ^ 'ej K͗m(AD [ etP
-U[nfU W$P-HNlL3Z}QRnx<R"q ,`Leȿ :%/x. S*@6=$ ^q️I2iE 8#rn%,M8uWdԃF+7oAtDGZ;?x5嗶-]X No?oK%Ĭ 0gnj%%,#%+/~l@gROZdn ٥a{{.
/\s;쥋 3 "oq#`eZg-UjZNH
YC';~2o5liwONif6uVt2 \ͱte hQGJ6\ސ
|?ĥ1.d* ibFЧNΐ@PvI$a폳aBC:t1hgE 8fr};y.Xzls[Nhґ( B ,#HJd!k;ug;lnKNovMYHbXDڕ/eE4.Q>3q;u,)=x_D!(Pj:l_Xڦ[_}ٰe[\j5+T>qS]M:9ـųO{r).@({heH F|zrPa _ҽcɂk~FsY̜ Lkŭc f8igitG:'< zO\go>/%GC{- \lZ"__ZyRv.}FhS9ˤ[ZVvL瘞/ ɇT^uކ9uq%8t\g] zuל9^pC>:oTI:߲LeR36ʊRFVx@Z|tBSQklgؖ tK'. @) @GgȈ++ ` {43 P`"H#=I{x^u?
Xއa +% ֚֘r]i&k HWe]`XryC_Q^t%[J
L )]_Dv.:clO5fdђp Qw|lO ك=߲kJD齲+`9N\ iuV獝[h"9]>Nt_ H YsyK"&<D4m㱜|ޞ5vkM0٦[e?\ z߮:kt=W6 ,/, xŷppkvex\]T&0ݧk[&QB&MO9gzR^ͅc |G
=4ҶJr#jy O~#lOƧY0f)apJʒkn
uШ6.;]h&o] o]D'x.r.@Q GV<gbJ9KVj4r3˛_ L¡)-j\-䒽v/ %2;
@A!}P-Y"' 'P&o!\<@đîd5ηow
ׅYo>{Nv @H~=>.|.KO%ɼp,h#[Z[>pV>Edyf+iav%+%Xf1atC$U7۹K]N%9m0)";iչU+
eeh&1kYk# |Soۼl$MF}`2E@)Št 1 $@x>}~yy^cy
)Y GBP_p6NC{溸K-{ mێT 880 YZ֭#/GVXDoXHH 4Qg8RȢ>$+@Xw(nWzo]괋"WctzFmuشg<4Gh R 4 [Td{cVaBjͺ@ö ed&]
Tvݲn5r[ R?@|zL`,pc"r8࠰fUu$A$ rnF8 &r{$-6i( ) 2IΞl[o]ز{[RWuMeeJKz-ڈؐdXeXsK:g=;fcl嗒FUs2 XBq 2쁔qR 4pv
,@\cC)q 4C:Y yREzl&"K>$+ V | 'b;d7:{:D@w08;20Uѽy2+THMf E֘ /% e@z&M=] d.3y6L\
hѹ $#%(W=/ _) U֭k~6M龀tUKZeܾx7qt]3K;d U;4Mf9j:_5wo<%xaƁtvo?vFǒy9i ݮ7{$*`fgEG- lh*e )͈(k501eeM0-Ұ;wxKŦ
Ι{N DXvD1";g> 2˦ |"[: l"$2`@G693sg|=@J,'If]/n#ECcKԬ?^& #[^oK4 /5{tgӞ<ikDz
is <p])WrMuA!]l o.+뼧k6UTaQьȲ]sV_Й.<-ڍA{rE{sv^DL]3ACJܖe?ÿTl/ I6=i J3uɖ^ w55y.z-2yNXp+gDsOD@9b^A pA ~N6ZݵS[?yresmC7?mm#eUI֑N,VB@*6 |ڻ-=ksyKEu:y L%}#!( 7kpe MRpFt OؐBؔM/lnمk7wpV_iZQc>+Z2cG75u o(?k#gAAt .}>^eu}yߏ
x6K$niEb@ |]pU "5o9R(:mӺp2%Z' ~hn%/EW2ĥ9 v0 "5*=k)YQ_ߗϿmo>eG)ojk27Eu]Н.t Z5VNc连˼ Af[:eV-ص;Ǿtu{na~EbL ̺l¦myl?8"gU?//@8\IU>1t^#[3.ߔ-=5J6 < df6o<? I=>EߢP@Xv?
[F%bs}SOap$n* 7"|B UkްPaNv~c[ܹXqqK6oN`Yr^>sActZnV88
ZdH$F=䠣#6 NH&by4 (oHl@ )[]6! ڂidJ
Ӯ[)FИY]#VC
^ 'X<ug|'q@;}E> >П;r~@_ `<&>y/o H}>d[U-Iq",ѳxS3/_veld 6k9w}/8ό|+yoJ_wlϹ|->=Shp{.FI߾onUS<q 삆0@V,"_ .T˲gu7kZy~Ӛk:\ ;wK Wo.ص}}6 0/drҞm{~>?>췓w?|[ r<#`K7~!Np k%g"Bp q C]W (A(Gb K2qK3uYpݲ }A'? wid(2Ԃ@cR Zcqmeu@XuYOf*.`*S̖lH{0u%;Ǭg"lOI&o>⤗Ȱ0 q0pvÒ鄵^ye1AG35Y1,ҖHKmڰcnV _ᑀ$$COz7CK + Ljτ!E [ aD O &0> +5
4 !A[9f&EzF 6_ k/\mco[{bt/4msgղݐ ʀ#N>D|@xr[c7̆@5Nivֶ;ݕvٲef+NcA9lۗIR:o]'DlB'K%Wl" JN(gٺCɆ'&իڹewX5G ʮg'8#;8#G&/,{$/0 ,#zQ]>G)á{1 y9pӖx5adm sS H" :I_# yqV5`uM;qh^* ]kdv~7m/huPr$?GROe ,MPj4k 9qq%' xKL E
DR51~e9q g ǥGktJj ^bcш̚Z)\8;kGKMEKnl5umD oT}L2N6 셀3}@w]ֳ<"ߟ`@{r 0 I >ខxH3s6ؗ gYi3,/2句vvϺY<@{@w"Xf[̌$,.ݹfOm;w5Ddl5qfĩ[v%<#f*#:B(-9) fD^r68pIc!i]Ó
)>h<?._E^zu{UaD3,XXFy ̴SP\ud Fe$Gfg}!H, >B2E\P-0UammfXKWv~$B(ۯg23<k|CJt4zg"d =e*m}[N~wϿ~˟9 ] { sJ6lI!M>lnzFmPR@A(,"Я5,0۫gtOEWF2'z,*@&bُP8luZeQ$/k5[
rE@ܿ-gB%LqE.BdX eUteLD
A[H~~GGq&yė p]K8kvنҋy' Ԭ{<{~[;GE +2UTldn?zAѕYȋ}(^ X0i _|̖e$%i]gV$YXwno=>훧݇$;yj"V~/S6- q9[uAC32m=ʉ
d$ѢuO$l@`2]J Q7.ڐQ!31k]k2ApkXOزûnqCm^?| F =(HEXI Mi\S)b8KSzl爵zI蹓vX~L/$1/ΉUYo=ag%ٿ+ivoڿ'~F_Y+A Oæ?id, ?y&ND^
SDD
K/+-;0"6$Lvip>{] D&\J8`$,[@pbن]q]V}k9x gV/溮eQt>P af{YH xyOCp l !d @}|g(N ;_.'bMX2.ɼ{C]흴A } fpq }r>z UsVw=xJYufx_% )pk/R KƊ ՠ8ᠶ隍S"qĴ4:>d. r}.ؤ%,>J+;)g 8 M}{ϖgu ^x x/c >1? Fy&>3¾"#ݮ69:oԊ2P>ٷ-ӯm_7,GV 0mr1Xw< O!G]Δ\&dCV!mYnH/)<8f}r}NW{,l=1mC"~z=Dl D`|I%-WG՚MˉXL
( D A$ c H?3pO@q- ýb]g p^0S(Ő#x00&@@nE l}" @2nRYE22ʳ+ЫDnlv.h¬KcЀ6o3-
|JqFraEEB.it4;3 P]ޱ
w{ M:q=Vo(3 @jEdk#n یz}-G|XF,>DyDR}ݿcdfzG[$KnEZ.#[ -y!- Ԁ,T Ф0|u )uL[vA&E:~7Y # qF dED"R 0Zɚ; ZK:!&K [jwofu ܚoQ̂}Ͽ?o{QY!3 ("PH3NR%!(i>3#Q_88+z]Ʉ@"E}o8+pK d`L: h\"&R!?,'}y¹PZBAXq}O tnbreEM/S @LMYl"r[. (U]+D=%F|df+A2 l]qGf % yIu59<t@^"
M䚺Q{Nt)Cm1إ0kR}L0%ӂpzTJYn(_:E;>Zwht5ui.#,X@.)I7]V6䟎k{Zn&e"/Q٨5W_r(4{͏h_^^}Ut?s_b\ YLj4=K
07
E 4{1=7(pF|fAL* ONjMH!|P8PA Y |t@?2^) H u+/
W-Zs˙rwo# ~j T{"
!),0qlc&Ңq-XlwkOL 26vG˾IT,؍q0# 8 {r6, T4nϬZOg,W4+\H(- m&C\ mizHi"J+a^re7KymsKuu
{ L-@ܙ̺@@r
1}zPֶ貊n ѻ߲$-G"ӝM8X(
1!ᓼεX61Yl1Ԛz]5VyIa<2 ٓ -mk 9_!9 XH K7mn?ymiM- o,ݫ112'1I79} ?l~YDr ؿkW.߰Ͼ~^>,Oq>i:|egCߙ]F( cAvl|"gLE@SE|$0dT~و3 N"71k%}ٹApfA9/}"XeŚXNՅ}{?}#a%lݕ% BɁȑ !dZzF%c;MӚ]Qj%KW/^ kW6\t7UdFx4mz)"h$K]n҈`#YEI6eGD" u+V\$Kö${KJX`B:0 6 ~܀ -` U{f!<ș'#~>L1[t}Avgo'큁vrkuL3\Q.ٝ?]rXBXփw 6 P /~뇌"ϳW|FhF~}fEa)_=n>5z,lјĝ_!֙sO tܶ><2gAϔգ'~ ?<%Ҍe} wjgp>/f _x.ru>4&Cg
ޗs? ޗ}Y [Oۅ|@ y~ @[;&֮9$n {`ild
V>iS' `M2zȉ3`p`2A@`Xڎ-mm CRǍO+-Kzd
+YTƺFD "#c3 [bhZG@dĆtCGD ] @&, X֞
3H &gurA)E B 3A@T]Rd 8lHF0à;`pA`#(Cu#y iݬ~_fA
V$nqH9"?Xr$H%3n\NpU`}_`OģMp
}^d LSi`i2
-ސX0wf[j- ƶ1PH}WQ:\e@X!aIHάpș7緬,G83zCC
'G5YDN\(ړ-v%;w]t r3YCYeu
s2 dNitH#*RklkK`{r2Y" xfh>8 eM l)qfo(f*46>^`B*3RHEX
$R @hn#гlsۇ7?j UTӻk_B`CĀzE t]:L@ nX={dơB1/l5Y6("1<JFbONJ,{|Q$!mٺnh%K.,EUD.gx*lXaFa+
J^+GAyH E $| :nڃ|A0&h#ҀS@5 = "I(SŹuۻ}O\v{v}`Y@1 ,H o&k.`ʸaT9;=ٰ²q$c+"
So`/EyXBxsұ+Wl`2VɸeqX z3?o HLL74*{V
nG$?+=wgg
pt ,."~?UdR|\:?Žj #7$HS%KHq?N5Nb;cJ?bgq~H";ǫ6/{?_ӳHg2 ~_w~+/, ЍOsY``MpTW!GlK Z"xU~mJsK{~H?.&,}54j t
OX|ZD_v;WؚH-:]ڲ|}*)꽊Sq˖
N#"! 6sX=\ӹ _?˰ ȇC%R#2~FB I@G$OCZtwޣ~&9Y,Hr+.@ddh DuۿԶewƌܿo/;o C t< '{6{rn
FD5+O=2oՆ[Ѻ<Gٲ
E+84G u5=79.Thaq~Rז2ݔ
Q2H&ʥ..us;M0jjπ* -,(O}Ft"ɪl{uهCKB`` G2&eTxxNlt@ (H©JzOφ#=d;7 X~i\@,>oQ/YM?+?~OkVWHKY
Qq䧶d;S5wY±'][3929\3+n%bSv5]3K0K0@a2d߯X8[t\>,$?/YXu>2UpY麅3E,%6<oGwO2(^=oEdߋ{` z_b l3+yyw kpsʦ% ߃;w>N|77 :}J p I,^<:CKR*[Q8H-%\NN2&dXڝ5z+0h'T02qR~^c_:+zz6\骞 M՞^˕)TK\vgL&ْ Ft/\
8yپpx9 P3Ϗs3|<<Rρۿqծz@nB"Gq|r6nXzNeGwL2iAB͐(Ez3kn[D"4-|H}!}2gֻl9q
peNrY a5:$w-1
g& ƂHCVkZkejt]ek5kK$"!rK [_Y^ ]_)P@F0[1Ʉ'eC h`9A\'zM 0f?cemEP hL2; 60#o02bh8=LiPu] wa~oց u}ywWrUǴ
"$BH@F^NOw& ,M#(-RH,ҢHɬ?̮M_Hc,i tGչcE%ڡ$%ҌE" r,93S㤯 T^k7[oE"655f
(kap& ڎɉ=x
I Cw |9fKe䐢O@ekflPҟ1@ҿyDe )1!p!0؟Ը0f'B " BPxݏ=\vC+
P'֕-cOe/{ J_N!.QdYizn۞|cG2-J_Kc<HƣȹO5@ҐP&9Mp>n{^~ݠ}Ig &#n-^fC{e[ش PZٲJk6lqkǚAҩ%ϖ@q+`D&SN)d Y \, @_^Cp@(iDE^bH ¹!AĶsz_ ˚1Gٕ9T؎i'w Kkv;B53}He7Bl˦!kcGS:չ1kl
.4YTτI\v-6OlWKġom!픲)~f9KlWzA{e{5^߲Mr)M'RDCκG'^1[^ұ5DO>:1ĿF3]Jݡ茖%IIGb]3aEDz! =䌎Ⱦ @*x Bʤ-D ceh_#/yR>1"7_ _}Xz~7 =ВCih2$KF12-6WJt/9]5N`\: .d:oCS1كMLEJ_|j^|e]C18f}
$#
ñ%EDki n,[.˕EI;)8I
̲
§e@dD1$ >=>86}=$A>| ёlr5ӲAAςCٞ}圔B>"r,9]ܑ.ɟ/ȯʿ| <Oת{-9_\o--ًy=[ըt4$]]r7C =OĄqխ=W#єA \[6.lӸER<U/Z4X7Wet?Ecݢ%Y둎] ٫7WµNxILN& )
;)Aɜ 8ɚ+藾Fi.+ʠ^χ(H7>%Z|crZRpbeuQEl76ߓK)pIn`4d[ϛAQ,@0㳓S" !9PEʬz&{Kgz6+ȥV-mO~ӿz|0"4~m!F.@, 3kwmaC᭒YU@=VFǓy.M߸eb}zCW:gxҮ
YP҆TȮEl yH4/y[6@~\JfzfWma[$Uz^3<A >4{N ' } t'w|?{'R}Rg
7vjk
~_vwg1we 9̊#_z_Hg/LUVjd
e\ %ս6 ,)1$ WUr%̥Sg_ @9 Xnotۍ>& 喥smɅ(uK!MSfݴ:kѺ] d:*؍д]̻_&{gۅc|} $= s [ AC~s|ޏA>c9`ztyݷRisu;9OnD58!ڲjEX]8rMk*Rh-Z2Ke]gDhaaA;wr]ao\ׯ_+]r#^
RL]HHO;՜-[Zjl*m-uXsՠ 0q&"\oD ,oo "
;h
j;LX?3
f%\:>K <yN:F!7gϮ{F XsȴֵnI _;Vro! 4%p)L;I #z- Ț_ff!i
B6C{Muzbdx<+mpilVmؕw&GUI
@ @ gJd Rd\'ʕHQ@ʒ9
n 'u9h^"āv3 /[}ܓ%xM@m0IV<3
{dS_g$;% S_t CLqw&12y[ _b8f krVu\oٽOe?>
>+#?U'
gKCq5cV;A ]3*5-)@!¥>ҥ썮NBwmpB 6 i!wNآ^zeOw\ pVRN
tUΣ`SUIw̠ҖdCFZRX}uV$n&@g=%P0- @0l@e0c.( 0} [av'=P8۠ RE 4̯[email protected]KV3ʢK &-d%yiGyfme4C eڻ=8jf"G! K`Jf Q!p!Аusy_Do*,s\И5Kg,_o-5)D$oѼ<E2yj ;Y نlӺL:jx M qH֥:?F] ƒ >Mn H=S[@^38Y"Ϭ>_=\>ʊ ̜G6#67c+k[O~`?]#9t>$c4`DJX xV\AVcm0 }ؼ%UK6* &10lWjWa]i^f^f;{ݲ6 NM
F
c6+3<ײ767gjղ՚ +ԫɘ+$ $]wBt? GW9: q\:2! } 6\O[-l$D- &`E*HN@>3%}&Z[' |D m+5S xҡ
ˠ"B)|>~ }/J4Ft}J\
t?Ȍ 7we"ww@~,q+WE 0^]0pBʞ|=:o]k ƱEjKcTsY&s
qVÐ-985TFcdQd(]͋S,HőxUA yDC]?}ϧ" >(t B_z0.7J"ACQm#E=lw^=+פ(8
q~7oYvU~u{oޡ5j -' wfeGcR4?O47EN d{E"VE }d?QaׯݰDff V.,Z,1/x^;w^{WlBxAh. Xخ%v9騈ޠ6oj^v
+i~tJr`gaE>$ᬗA;)cI >C,56է }>~6l|~1}u }ua}M+ҩMl ~OE~g0{ K'\XI-gwb-l_y`_#+8 kjlnF,S+n +)\JAim{V]{$@cĒ]̎Zytbͥph WpV8l7(_&!
ʻ% A[/;zŏ?6x3 {g){&0ocl~x;`k a1:<ek.sy>W{?4HG$X@}k6hi XDIҹY:q~Q+`^.9q=IhԆ&ǬcϮNi_l/_< `*>q E=4d#2(dte63,n}ezx"U8%io12Ds 8ȡR;>@ 4(<@7wi3 DV 3 ٬BC`OƚM_k/EAgXMtfŪK붸6ljY
Դ eg]YQG| O 3;=Z"ΐo
^ݿ+ {|ؖ6H4~I$Ağ@i {]+o ̈ZvReH Pf2*C>f6Yun
32R Hg{1?sKsE7 v5_ݟiҾYqrӁt)\;,'c #:ұ) [j!.Ȣ
> @0D35}
aiؔb iYjE҂[疟䁝? }w?%uK+e]-tI (<:%ڵ yN${<b{l*ڵ>ɹv{>U+ʵn{J}jz^7,F[ru ݃6ϹN!Z1{A_|ElJӭ Aώde z-A03@ 2>Dtiňt {-XHOYFd#f(;wL5G)Odʛ({4
B̂RE`m ,*aW6) 7UE^V zP2 u$N@,$:Όx˘QpkGEl{';O Pk5: |΄1ҩ5٥Q } ] ?̺%ƴʱ_j2jSIӪMKWER3.6 *dHw+/1sҾ٥v3M2ACFWRADd|YwF]9`@_:o">"LiZ?KlvpIW_ dȏ˗KOi,;%ul雏֝w"
AV +!_wd5ْ_4{~#y~Ȥ{DzzN$3/]+7UWoEvI+cC?X]Cvm81g_n骤qtpIK,ݓA9gV? 羽ߨhE>fC,% IH~XC~[;Ҙ9r
Yc` ~s0j`
A[}jm~hyN>sfwE4V͋$ $Mc>8&"ř1D5>dED& %aق
@Vm(x-[[怼& 7i mk|,M@4+&e8Yn}I>-B aŊ
݇EKM=s 8l`<2vzxBn,5 "nS}2ĈLDㅴ -4*?cgy齞HЯ@(1'?4N`!CG4@ i+Cڧ1bXE_Xf2a5aCvOn᭛m7ܳGo>|}/~`4&_FxVjh[cpWvSxG$'N+UKą[4^*
/I1 Jk v^tվxᲽr庽zrC.Lon{mx^ /
>HR)ᗦ]
^ .5g K53{"KF {xB>?#0>6< OL [hjEEctbicME9~^ľ&Xl<
RᙵfFܓ^1[ \'g{Ȟ m8U=_OnٽNmuu4d㶄7Yޑ`%
VBrK Bc7 ' dW˜FgsBDB>_{2n a[RwO$.KJzNCi٩l$\>. f^p$g~,*"<#|w^~ ߏs. C.X 4 Ʊm/l >zj_v
I qi8*zMhr _anm TȰL
Es""#ϕrLddܺGcdn ڵa/c5c #iƬO/~} D.P .fqavɄ4]}0 @@g %C Є0h8"q~. r@ ) |
O: 35DHd
s (VuD>#&tFD0 HIW2"8ZQƚe#iwYmV\J/0&OKǧimY!S&:v,`艢K
+d'vhN$;9s)3;fRg"ƚ"w͛'f])N֬onZe~jr5ge?1#=4i=C.g4lCѼ U9<@cy,2
i9ˠ!\6t'aF/>DKƑԙ܂
e#Z+q%rR2y
`08K#!
HZiLc;"Xߔ=XŝuM?ꚀjF 'JN,xjɅ[++!L~];@b=W7wMU/.Gl vJcE ge~2"1%68 8 rE_9~ԡi `ju-P
l
+BQҽ@]w=F +IW+d'y@# ؾ7Ô=Mi YXkdm}^w<: jf9D<!yͬ.&~ho\[t8Vv `;(B4{%A4z|BM!; 3kV[VX9{hwm 9 rѤٷA1܌ L!1YpԠ)Ψs]]k
e +]]5ϫ}vc.N
YuФw5r$qg+ʱ\S怡vlg$>=t,yEJ1rž-Xss[aٖ|hW? H ed iD4ExUJtݹ?ʧ$#v.u*%뛜 @8Dή)XGdںEתt[_a
tHhB"e\m4^BsE/ *ݟ>Ouw"@ $C#"c
|ݓ)/!əm{">a%$hC)sN@r~O"n9VJt
\E:9cɖ~GvWmew^vEmr
xI_-ؓD%")" Hw)ٜGR)alVio};9>
}}6 l `qzENlݍK%7HصqaFĘtENGc56(ݧ+ {jHׂk vg.Gu*1 @_5GϰAtv~Lft#2dG.x^5l
V\`$z LO!.~O>e }0\jYucÚ6#bo>GO~g
V<IKn8CC|Uln_nf-Q[TC9>-;(-mdƣ? )ePخԔuF9Ogl"/"0`RiJtI.˒ |[Y~PAS/W1I_+C CO ۉ"=لx ՓE/~&e%jnYWy_}Od{ چ+o|Ŭ0@Ͱ;?sN Ϝ,Odc~~]_C;{b[U֬l ~ x֥_ Mە̳T]DidF't՝*U[=:pӔtڰrc^6j/wK&u^OXC\X& > .ֿ7BϒgI'rg1~,?voo_ ,HFr,8'*V>[:qoi?}joA KIe%g1fݧwmn¬ٖOEm(<eVo4 2#"` 1Ri̭#FiOe4ٗ9Y q1kV^bVdEY6mP[VC*tQ D]@ȁk;#{̨dLF!zʀ B#R
J:c>]nQf( <]ѻ%]n/EPn?j~tj K(6DVopʭkJ`AH搀WfGEIoZc^\ @{:/ҋIA\,8`svrj+"s2ؐZ4Q0PZԀ EYDF ]rҋGc_NL`n߰K]]Mv}x:BOmMfUY:$"l ѹXDf
P(JM };n[\ Af
+p'S{0H7{O ϘL
7m G`D[O!X !C{Fcww#v;u?pdeK V6Rcb]as wv+-# 1H! BTBe?7 gIT]/#ǔ,[4+Imj?gQyXN/1ےh3ѰD.·*GSӖ_ma=\C{Z߽d۷ @ Ĭ;06BJR}пn?0 k-HQ@&f#=]$z 3+H=,,+Zhآ}TFC=ew =k= NhJ7${i0@ۜ[>.(x!8&SzFBRŢ-꙲EEDA,| ThV~&'@}[z2 )xk>w>u7ۿ}nt~mMqnFq5PtK>
Do)Bt g|0 p3 E
||/%`} :q/*cl/}4_`m-VfY}y~O}eIvqGFvYY1 2$2KR8ZǟfD6?$ILaqnh
JaS_w0AH̚tNb23.cdL6%V^.^;Y`qh읾XK y=Bދ /2 N=z=z&d% N@ !CpPoox:3v#Ұ>ZPŮS[_u:5"[ .k+{B}v$Wp[1۹ul7 = WD}Apg7E+.&~e` *= +%e,LӅeu7e2YCIN*.}t= d R
Pg?p|VN
v^ŋ=s oeyɮv
إ>;l
SnU2Nytޕgn:g<Ǯq t zwdp"+J&`$ g4 l@&/҂ ,Hɮ>miea"7g߳OSBs5k$%7-T9u_|[;cTe#9Gqxz"K3.7Exs?OJgl^ǛµՊ̮-+4DE&+TGz硋 ~zb!yAH= 28yc]G.x&x)>]|4fB&k]ӵ kGOz=<ga*pcA{
r$+a3ad\NJ&2yx:}tVd7c㳺M7 kH6Qxye WF3.ڿg3/l=45}# :Nҟ\t^_}`xcsyq~^s1{<gɽm/wh<? 3^u] tdڿeyhՅ[Xwg~onf2@y"`v J@' muvk=ơ*p5z̎C!My( 2ssv]6}f[I1aH?ITºG\dla[6#
E[^[暜[YFVD dP 8a@J f#V gD|ZtM.[@`L]4 dMIxޛ^t3aDE nٴ
$}ONX >k%U_Y*K&JaIʖv| `
I\`Vv4
Ҍ9 HߢA '٤jaqc?8wc{{~ >xP/̧LQZҕϱ2%n3pwKMI7&N[ATLڲE=jxTCik^)w$% \ Yzsi0 5)@͎na A%B9 Ps%:'u}0IC&ה30"4'.@dҏ9~Λ
_ Yv;utEҿ-rwmkeLϭڼ ؏߳`YZ0`2ƾ+sci9{GsudC@誮"&piV PQ.CDÌߘXOR99=jڥ)y}"kXIsoީlMYPCJ _ (Ya|2J t2? M>
>f{q R tsʸtb G4{VTzقL/&/,AAb> l/= 4@9 DIûط~];y|Wx ` f* h .*=: PcBlafMf 5~ %)IJktUĨf gw߲ez: qWjit6
Uúx%t {J .Su ?;x tO| .)=/4d
l٦ "X(yaN,zG6vlP@J@{{~=[?<ֵIoAcW<"3B\wII; PlYcƆƞ춀ۼg_( R.{>Иd扙.uoDDo^ KK=vmH~bWGR",Oxa[jme[-eF^o_$; "=g4(1
= ] ¦s
kLSjHV`r2C c}Hz$]zݭ~Nc]P1x? `Ax98ѸL&l$:eo}C4
FdS Gߕ9 Ҳ)mSOJTvC{ k!A/F_=|ߟf Rk.EX{LzO%wv$شI0NE"{E:&v}<'Rpz?"[Cu Mk1zAauF|ڃ.ȧH+,xh֭mAXi恕5Vvnۃ?\zl AXcEzkfӧ@'@х<C=K-[;gW-?n[nty"ʅDF( ( er92ki;7IɄ] K^Jv-Tҹ>ȚDi*KwZ9ĺY^/GȢJ
@?"܋|g|?_J#[=/Nul#SIiٛ ~&cI;5{$E"}}@`W~}ßwGy{ }F|Hϡe/yqO 2!MMLZjX#X*. YvGȗ<䪞0i^#vz WG3yeJ.xn! A
~=O [LJ?F0څq? ;ڥ} voo_ ,369L5VkcO sO wj{w;FʖKh`6 A<eHʨlǶ ˎ햄Avߐ
:o9G,[~kHcuM]QDƺY岜R.mb՚ i02>`? M$̄ ưΏ>(h pHMV϶8w@@@ A gqAO(IJR~ , ۠_JLvkqɥPGXu+J$3d%=~F{}Ȋ# s ^@M R:;={=\`ǁ3iz
qb" GrNAJk'7 S6v9ȴ# r&(7Kj 2 5uaaYR @DKImsF]¹):gs+q (,J0&A L &d]<@gA0.NwO[v뾟
x`v1/[PObvaǑR9v݃ #ȿ:&1Y``{nɣYZ1*PlLdh{nn(CG?ao9Xau xvESKD@nBNQcƤÒƑt]3xѳ v:wIf.
WGf\t| OGx ' fNtק =% Bƣ3o'gV
ۮX\`XpMHEEeiۊs"-EY+Tgl];Chтƨl*Xe I
^ ah9 (>)[v CB:^3{?anCy
<ZQٸq=Tfw{_y *$ɾ
( '[1 iSǧy2w0 x>Htϸ ]xN^|gu :+l =< $x^|ߋti.?ڳRtU(r6WN?7vS ú' )"#`#f97߳w}re~eQ/mi <巵n(o٨١=gi
8^rQc@TR%pm<l|XfL m"!c-~<IS-B|n]KV3du$1z?:@pً. _1qғdRU& SwV>-x!Da$q٠@ //| Ln߶sWKF ɚtHJ Jm^klq>HBy$Pε% -6mH;ֻlp{Ы#syӮ 5 A {Ê+={$ tLe6g?&@XqHL P2ŊAEf ؗA>zO JeϿ{>X%3^Ȱe&32@.X&mH+p2 yba7|d+/m X? <~Џ)V'P "dN[rN~YkҳEKY'I-ɆCkonC1?%D4$;>M{>_Y) ?Y
ՈxQad~2s:'00 O'd8Ƞ'Ap-Bge~6mg3$BDѓy<? pn5srR<L ܹoo\Ni+UdtXy}/ù{y8ƊA4eU"ۆ{Oߵ |hk;{6jWһMg#! ]TBO%=Wʭb2(<S)ol؝>S6!}6Pl}qp'~{ y a3 Mt_^}Ѐ϶ |voo_ ,H)$u8hG*-+0CCik'@!j5WB!U˖Id4*y{ps?<4z4_a&l뱶6Cz@/Arn6yћ[2
2אz".qUjcrX Թq$cϭ
\#5:GuDq/D ;ˎp B \C?%d
@@* G ' hyG(Cj
k--e%Khbeb A
Ʋb
2pYε[}Wm@D#@
0֕+7,bhPb[9nIǯ6{Ղspb(t cV뀠ˁcadbJ4鍱 ,ˈQ q 3r9{GxtWׁ1}&Z p/k
sdo -H0uD[we xw2 nYM7]3>=k?[%cRúi kzs T36N0E0*s=Y\ڤNX &X5قofv>H3
5CQ.eIK/}H t_&@4 m1,ˉEu58 s|w/
x,Ο⧟Je~l?Ƙ>
g5]'H59k=@$Ya,[(ro60=cσ!`PΩOq@tqI%=S )d&c#] )ݘP
Kݲb%! 灶@0
08$N\qIش ')7-][@KD) BJ bIJDXR(> A;i?~=^$yA[Ev }`| #m,"9p:S}Ԧ6 ѭ/?Xin]pE'Q;%ݤqkvnR9W4,4ksvS״} ˦ke#Ao|5OװH%89\z1 y1[L [/ C4&5*s*9DU`ʧ$lEz2n&%g P{=Ǟ* @3׳%@@`!02)M%x/H>JD"i+;mtbEW@
C> 7*G4f]O5ϺG,IZDY]YGS}y^}t_t}H68UwAN2'Ҧl=؋nSe5sºY @+U;jb =?u G>a ߫i/C=>%A AH n@D]0tzv߲G65kLfj=ݻgU'by{
We7#
u\vt0HevO j ;" ĚM!,)b8yG@Z!dՈ 3i Q?+ȼqlτzP!D Ċ |J2`u]G(* 3G <Yq}r 3O=tL<aG\;y.cѽmr}KȪ<vwBcr) VwP~ ؇}c| ?}>*?',x8f7Ɋݐ>,Kq?N6\7 }LULnV%y]oNb ,o[8t ?/>H`& D3^ۜ^p͜w |` g}v< |7e|~x;`M Gd0MɱKƉS'w Kd.! HXcv ٷcL;$S V-7"&4o0qtdLqt2%2 pp3!8 FDĥBS C҅i+f\2A 3PV _fs #}R`% D@]Wjd.AP [frȮG! gp ̓ YvMY$yLѢMh Gu'[E9V hs+-7( 0-pSvr` {"ɱrFτ{w%ky
DBQDb =v
5 7 gXKРq |nmnmI,[:LeILƄ&i.9n p_{C Y뼃 UgRq;ASܣKI%gdݽ} ' `B [_38v;LLܬ 3ˊ쟐wg?\qQW:"k+]q!*0QnKt[ͧ}'9:o{M `GzJug-wlbZ / )X !UY@Zx WD!-"C_ (-٦ KЁr K@">?N ?;ks%a2A
u}a\fH0.dpA-akZX8Wºh('ʹw3/]n =_?yu]4 P:D&v"UeoV7lpkuf|T:SN=Mk {:%45 wQ ڌ|tc][o+AG\NΩmJLAE[m =>b }lcϿy?y 9oBiy;.ZY?/grU7Y ˥#zЎn `[jCDVzWؓo"p(_.`\:o߰A
JF Wț!8@o
(OiKY +L1c hZEieSLDL% K idۮ^H2KRgK?o#oNJ\6@ R}v>= ){]nIg'5":(2q [8H2+.ŧ nbsc+{,!0 u
vK{=ҋNHǤ_B vAFwowDNЕbxӞ8 j{GC',8
&G}7BK6 33Q;1<Wy9^\$"^vzFq?{<:w::.D8[/7HiBIqpbХѣ'm, dᗟO#+J 6;Z/, /
YrLeom
Uhtq>, tz3, y!`vϰ@NpVl%Mk"/(}{`'>(హ}' >^lC0 n#QN,)H,<? v}<$ȱ o'3HrL? (2 %olξ5WdoT"4OSۯdC: @?Ùο"Rx\bC+-!}. O} D o CW7k 2*|@t/3as@Kg7Vxh wخqוIS6jEmkS)@Ö5Cf%mHӠ[B#Jw Q]
bf~wd'MV٧ÿn9"nd|x5Ș'Y*ȀPͶ=H:H%\Rr%Vk[. n=G` /^xO|J;N96?G!ny)8O-51,A->GޗLOȡKHe "G8\풂Ȭ[?ƒ!SUZ2Bޱk}ry8@̎9+H&~Xu}&+1@W\F%[Gvx RR MAγ8'+t
R.Ip mph"a]cvGlxd:F,J` 4.!y&mp} n) ='mn ={<K 3$0> /\=w2VA ^ cC$pV$
(pgAp{\s@Ffip2V'6-g ) ?y`/]49"+#.'@jaX:D-c* ,If4S'o>{om=;9ھt2BrG$# ;|Ci@䡎1iO kܑQDvIv@ aRLC Be^(+PNҭ"沱< %$pf3:c=䮤Dy;go>/D!d0úvfS 4&p0* ='ݿtg*gI9ױߺo9]C$a|Ş~[/YyV
O?Z2
vUّ},Kk|>¦ݹo' t|*V߾k݇69D ϩGGr}N,@51H ] KW5uaʟ1f[.0^Ƥ{m3`E4dO}캷!Ŀ~^ ho L VA^
=C=?u3Wf/v)Oߵ,Utiz ˮ9&m$Ƨ e{}{]-=9 (Nw4^dKvFX؟OmBb {,i<.d!} gVrB)g87VlHy+4-'Lg EXpt/qp0ƴE8 㽳Qy qznd=xؐ@&I!;@^iqP$2=*=Hlz'bUu]e 7o?eZLH'4D'L:!õMGuMna Wϛ_am70n v۶+_#b3{2Du/xc<gWGvm4|*nBW'+]Wo ؗs9;c4naא> Ȋ P{FDx>.{F/ (h?s r g]#w5$=P 8fw2$`B &=fp$haٯ ?\sC݉ Dt\Vgvc&j+kug:]1 w]yړ%DžbH tnJdH,.L\3<OJyCxa? ?>ǟ?Gǿϵ}/gY }cgxg3G'BT ͻVjއ6~`E4)'rH0s 0@n_W,|WirQ=&evnޱ[llZiUgMc}}B (A ?nIƓv^/^js3"{qV#[^;?v y _O|@Eǟp~gΖ߆<voo__@mfkX捴Dx <ګ.'][ ~C8 .2d <:OPj3" 75]tL'@0 { g5ᵀ
M aI%m|dkoKq8p'RTB?gQMI@-A@{?D]p@q,.߃!HRI*5 @&t3N`r,0dhhF '@$5(<B
WWgmmi:{>~s`\JSv C.]#?9P#!$3es+ֲ-hFw ) )@5rޤϑ2'KQd :E P9WH<sN,gQ ]=vӮZx5mZ0^$1K+ lYOJU I"H<٠> B@e H|(24
lun<HL@ O8uL?Git cD8@kX!pgCI_d`//.cvIRJ{ڟYdndⱐ=z wl}L_5`t PVw+}t_L$W$!H)!'" )pG7ko=cj&2e']
3.36`<d?(Aq8u@A=Hp{o-si8@M01E2B a֭G9dխt=ō==u; ٤]YiQt ^<Mg˅tv|Lɗ+cg ;l[!g0]-~I<qz&5 ^NhRj_>b/] /]/uVOkŖƍ":2{RF o 63 "PD sE e߳h2 >i&`ů:'"`ݥI-&-7-X: oew+A<َH"V5}HǦ[$Q?A
&H?&0懲34sGz~.,}ah[_o2d Hyx>X^Bfl{ ދ8G p]F :F!a)]kpk'6!;(TCϿ)d<=[H@ _8ʉUVnZiM2
H5v
97qJ@/.;=gU2g0Np<`Yl/:n%P%$
$!e7:X̆R'YcaޕT0;/;} Ǡdg}tٓ{-vmH#Axqf3|~J$(,,7ڴ1ټ|?%D'?=ciw\8S~A_ʐgOAtW5WdC+s{{vË K7<$m d(e<< ݨk;^d~;!hVd3͋4!0!Op(nRr$] /l~'
O{R鉻
c?^v^f!D7?8 =M;Ҹ흌ږ-llx4!\ͣS˗d[ֳw1?TTM&Icնv LoMm m[Xp='_팒4cA [ڹ?_ٹ}ʐ}}jEߪ =c9IK{y1o<ϒ#\ENv E? ]W &x]A@|}a ='G(?57߷
+dT\s3${rDYvr;
)6_Fj\
8 OE]ARP4<\'RI1@ P 9\2< M%}'bڦ%a$P3"2}=222rϬ}/6H` AR$[D Zl[͘i
FwW>ϹFDVe
Y~v9Ԓ#XU`p0s: X8Fϡ p 5 KXYݧ|NHGw)mRo 4vpBY6|c߄';7?pQBTɕ0.|BߎEJGaJm ʁy{c0qHGnX
ka|ƺ+QS"(8)1!9xz }* /3{jpU𤭶-uK (r*"GD>FLpc̘1N #H нl˅!V K 쿮 aw S9 D x{- pbMep]ַcʹN]S+wߔ9?7?6IRA(p$ eO}hyלSR~=<~U+?$C7) gjB9.ES ն}* D?BM8!a8P m+atv>̈WDR< -ޓ$ NS!@P@FO}$ܓ* . ^jȸ ?M$us#KS]Y&o0z{' [U蝘c(زFGspTf[ʐ!O ]#a`?;o"+^qTR nVo"dĊd® _")Y;a&m.s )'#
\
S+eE=U]CPj"Ms= ps@ cHc]/ows7^iZo?%K'Yp'̪/L'P0(137-z\ fA@ )Rv%K`WB#4c:AL
[}AG$f־ɣE g#NU:l-F;`Q{<u Ky-̼g?SϘq̀h4 16Np`mDOύ081z$3?Ct_q0jS[W`#u+ ,N#cz#Sop,LL/!uM v<p
9n;K/[ۯW,նwLg K_6-"q *vPt8( 5OuDƦzjl CST=)2l?:qJvANw hu?2$}?0f_Yu[?џy} LQ_ؑ/`xaaqX{_>Ae˫Dt
Dy:*钶ң`+dx{t`rc[<iw#i' w&stf9̯lͽ0N^j n濧!]; >?oS4^KB S;:6U|0#F v6{LN_0 k1 -N;6S'ώt{<;3ŵ0(?: 'ÈIv]Ļwȳ^]AV8(W?ZK뜞 adВh_m` 4isDKmNHTQQ͓\Ӏ)p>3; YluqAx7 a6oV W_|!wpe}4R [@BUX Q1+!#76lZݢs2@n\(%6FFΈ`g14 YБEX-w\{--}sLoB/ Ÿv:s:ϱ0qF9~JqtD>q m3}Lz m(z0pcνECFMn{j)ܿ{ zGö@ؐ 5'9"M R>"X`Oy<()P`ZƊ p X$<^l
+D0,^ VnK'kRՖ Wl!;>ep Ch00 #
:HP.G<8!5D
Va 0)
煾#6%H5K{Np s
(s螔8a* 6v5 H #Qژ p/Nvp _g[4Ux)s;m톉vyoþ8E" çtͮ#} 캅 c0f ?% RUn2V^SR&BܿnYqjĝ1Pu0㰰Ţ ĈEG-{<-(Q0ABQA߇G#] Rv>
K1 #ZP^P0Q6,pE8ħ+lnhFE <}Ccwp4~0 .αY}'zyrV"_VZ#|PFa0- Zm鑡>01GGCĄiM92D8ѰC'0w/, >
+/`N?+^KR:٢)>lu"]SΡy
xQlAKq-Q.n(8<Zm1B}C; Ej*}@ OnܗV/H~\ya8{'~9l.nU)d w-*aR~\jրmE[ӳ{pxuēMT`^D,; uHz,F&*d}t4-~!#<FU0#%]@(DFäðq` /rM2'jaߝsZts$+ 4.ӴN^lْ/}o1nPC6^Ȧ( Z 6EMEn> LG"_4:$ _zF_z>@NWY $nODn" zDlB,*GdShqxB?< F&ؼxN\vnX ۑ@ȶɺ Ͱv e<,堾`ڟ/R[l;*Ð=̬شnum]ozOsz_l ]:*]WQ{jռ[C /by2:*" صg/ޣqKF"z˒G6~Mt'zz03<xk 2.ai tv
ۯ/(d.kYDE qĴE cA:F/S|}8p,> * G \O̯e
EлrC:g4vC=i~ 餑Ǎ>78X\|?xy=Oz ;K۸g
Nlܿ $acF]=qE i"i9';Wt2qjNua4 Nχ~vB-fp>}pL(HN$a0/ ]XгNѭ0#9?%#zڜGM;y57;
m{/xIHS8 ߙ,43,L`NpF%o?Vʫf h@g+/E|HDVז×_ )잀0Hl0zle G7 𐽸Z*NXPqZJĎş^\ SKsavq6̮ny11 $$sL;H#O4HHu4m(9
6qIJf$DcXD@q ae:> nωji5H3ba` j )Q #`[آzkk: ]ۓp]Ү#0Q) #F2&m:h& *c+m]^9 =ܵ癇X B!# A,A0oS vP !* <bb 9S7eY;Zp8?~-|AF. [Xhon; v ]{pM^
Z{56^a$i LN _˸` w7RX( OGF 7ۢH|1
wP#Zq\$t?s EP7Y5<WҒq-L}KypD e
MGS'碞߉N- q_@ߜR;أ (j7: Z_=#j@?6 } 8h-h< v]YŏW[/ai{[ 204 hbJH hh ހS1}9C Jő w0'A?Nztp']VcAF/F7fW+"#7 B|O p(y%o|AE:0*; 9 1o}6o~+[ v ؗ)8DD%ɇGۮ$F+}-mnXchIt,=@zs@7[SE 9ⶣ L[1hlRb۩q=+,Dc2 6^|0#Z=L])~`4HB+G?U.$ÄlKo`^bWu)?@6t pw̲mp"
s].$َآR>yXёJAܙ@i* %Q+mŰ{V/X
KǓ ; D8 8x2-
떰P{ GS_w= ~Jo?車 ύ.GOwZ/st/x4 *W(
.7u?!#GF|qZ˨_u_^] k;'1Q{n7Ĉ_983 &^GǬ5@9!fY@
v?G7s`X}Rtn֨0 un&gNx86-G者ЪK:imMSCˡN{ p|wx;ou#̦+_ߎyG$^~x,I~XX? .v m h Q?C@ }{ѡfXZ˻{aF2`T2}X<S 8 >7@ þ8_N Ya!bO_X]
˽fS?*]=鳖.=u~*{Rv*HoϹO)p>G 4,ߔ"p33aw Q +7 HǸwd L ݰn
_zM X0Ab:d8@% %db$oR8|sfa `m [ͭ0^a` ፀ1E Q0`L
HiFuN1 s?:8
PU0|g2.4^_20054HZ Sֱx萂5W~%M8EEJ蒒ˬHql ĩ6J?y3ܻs ܿ <8 X4@ mBa 5ַPR!
sd;yH/geޙލE8Y.Gc&:3HsguB G*=: N ?,;Q!qCn%=E38FÈgHbʁwj(}C0eQGCBm.mG~ڻ}p^z][ww0|~`(|5GBCsТѤ *őJ8C}Hm T NU) 6*7. X` ՜?/~@<Q)QԞމ \zBvtZP;wِ>ط N<<VV%ȈkSC@% [8{8p\_o mi8g)O!2n01? }cr&N̅^u= SuGN+ꃌ:
p~`V|u'?8~ Jx_
^-,P 8%q(!w^2b1uN" d̜ER}1Ehظdʛ\Եy)n i.
x7}hҠNh21VSE
4
4J\ceitLF'NէSCg.8RQ0,^Xmͽw$%S/ ~?wQH n/L]_3NFKNn?= aua }Cx>{@߭YB42Š q.0d9 hRU #˒28}$d u8|a*YI;pź
;p|<G}_=]Ѽ@'_?/:巵fwx& #Sara= {lBF'gA `Q96BM uU U۫)08/Qpow}?[aiHF "pMH/OxuXeKv>Ү(Ϲ4DDAzx5l aQ"Зcs'G@ )m4#/6-DԥDz9z7SDk}v8JWcp{.ٿCcb#sf#e
G='ӧWeυ[᷿aQ[ Jt<@k7MN
@:Y!Y44[0\힓={]: 9 gG+XNh Mc@Ӝ? ,ʃ Ar9wK7PAjXrnyK._Mt'3SaKhX_[ {{{aa~5 t\Ecx i N/KBWN8n=2gGKo;C}0 HH Y@_uw@}MDz/''B2Dx ٲ(gZJGb)1oK#m*k})xv<O*k4YxˌG/6oc(>/9u|}`qPnH `h㸈|U CǍ-y! oqL.a b`)a V
FmDbhQʥZx]RXXl&E PN3ݠmdQA31_] ?
<=2`8b!,TҢ C'F(D
S
)le lqDC *A o;:6lG尰旗°e*Y
@JΈqsmP}Lq8} V^x(ܿ}80`{z^B;( (F:D RBh " 0B/!1:r~NJa|GŜc<e7rxx "އv،63*~_txhѾ8bK`D "jC8bO<,Um+ S;*ԇ#( 3'~`_ŭ0,}mf-<xamkI@ʵ/#c1q +Xpf[P NX=2k<{# ? eRbo;hآg%_|OF!i a s+{x,n`^˻G'&a
{[ /H+hWbm-1tfNG>#E.,F30u#m 2z zO]2].qdrVa7,m)S&p ,8$Hqټ2
ce}m[fq^X0~v$GKy8ǢLGZ6C%N(` As3( R(`$GA܆Ү\1Rנ4 e~ Rv' ' 9tk]Ii87~x%-gQ{
_n ++hh~h{F3k fdw"_xNz)
K߲š̟M/G1,mɠrC;ahXt)Z <|7=$#|Thpfc" HdkXT2_^O݅vtխ @VvŷR(NN9S )b[炦unIG3\tnJ m+ \8a֑8
ض)y;8%z~ ^էwf(z [a~z]֥#3:$Wĝ@hj1:hB-F:+͂kanNX n w >6έٺE ކӁUC[7#| quA3gy / ],gYbZv=2!:X=,ވ\d0ܜ302 /p xt4[NFFC? V y <h(2EFz,
8 !~t58FWo/{_[ oZVԿԟ7 wAwm]a{;J88<
V_-:`aTO܊:>utԂNd]0tA3H 1 4ы Vӭ"06<agvbJF:ot_\Kvzͯ 1=vÑcFcG/p2 %vHfZFQ+6h;86Ve^&SKaRpG~D6sk ^b+a҆)ۏͰ+{ð}VX.*~rUrg v:lş9~?}zR7nҹg??eBwhY2mF]6=0| 7Vu}&MKi?YȢ7 4a-]//~7,ߔ/BD-A`F~Z
Ƿ0
i(F cd9GRL"` %8J#!3#D}PG Q&}`~S̮0fV7L1 Zt? <oq~?c lSG40#'AT c 8A1 dcP ހ-'J3^
3+axzɶ[Y_
C,>6hȸfBnuKh^PgO!+bj .i 1 [<O{^e0QV ;qЁc 1L"
)!F)31DzE`a@J Q1d #Q) m" $DAA( 1& cC#>0x !nnGq7e9=n1Q |è41,6CGB7NR
8(V{WX΅M)darN_&$1qF6↫k᭯|-," x+)HcK_6EeK
Qptсa @D OG$"8 q)37m* yQ!f _0F}
QBjH#
966%dH#8'9Gahơ\c!öN9b`Au]ؿ Fgh$ l06B3R 1#3 B@1ֻcHt¤EO[JIlMn _Meҡ{_ _F JA.ť IZc< 6|xTdpE 7Wo:->'v3\ \ zX'gAo 2sg\[ f7x=LWEW[are5Wao1((v*=k>|Wzq`[GFn ?GHs 1"ert^2OX(ƑdܺCR s *os#r&!b(%)[^s }cGΎӆ1'[{.`v {mqsd8 'gCh[rGyAb=瑆DA1+# ~'#n!=F8ضwz
Ls1 #v$CyKcIBѼp^.8P.w n)IDATlŌ ߸nςI uw S&(# Q)
)Ә+P/MZݿ+S?+L9mqͺd0q?L&wZv~#l WE#Q6"[>QC_ѫ?590#Q r S pXD>_x >̶7-By nANutck [!M3ۡu7(>ے4 B gI JX;!7t[t+adn6 u$blF:e{}F yv'?FHw[gip'D<u-z)[Px;ҽ +RO|gvt3PPwfp ۄ/:n$|/$^+o_nba# ሰ^dUx = O+(td-1Rw pD#@2Gd0L/07zW68`qt "z3-$fk0W40YV"* Ka,`#y d]B9ʄceq>0ePXa沅olo}QSp28 A߉@u a3P]m۠kE FhJ)8h LY$ 1 &Pr8X0VlfN~ x/p+.QPq$ gA 2J. G&
xN~7N ~
"":M* d#8/QLM]tL>JC7= I GCQW;^Z\ +a鐽-`rNXFE ⒄|x/}Yڍ&P}[ܱ4c Xh1݈ рQ4CC0! AP x;
Ak'N<BFCn pcStNa[`PUNTCRg征 sCਔ<SpBc]/p ?wF=s
<o hK8j/L,$qQ* PѠs Zue>),>zlݻC>_o~wed/w$ex"Wo{aZ4> ¸o#"Cs8 l:T N&tx.e_< y/udnt5TQm: 93`?
0EsݟIOn@u|У6^tEZC Iτ}a`?\ 54&eV0)H.q -5 'ǝ
b@Szvk\ }8 pJ͙S Wt$@vu ᎇ:աLVd]ypbNb35Tw;ڕUGEȿpQ~煷l{:l!$}inɿ[{ajEڶts",o,(=(|l.M/7_R 9IֽSNncX1):5 n 0 ^?:/Wxli_ <GzUx ;)y] qp,p
]:>3p# DX<x gIGmd# +{mjIvJؼy[<p*tٕpx(m =12R| n{ǟsO^7>N<8?o3JG: '{(,!wfg5F0zw 6CG~~z/~{ߔ` &6 `e4ay{7Nxb}.Q sAD#QYD\`| 9 !q@ W rP|kՉ0"汭{C -!!z1
Շo2 qO 1 (a'F_ S,c_B CG<7ʄwH0A./坅
{> A.C`i}3L·ީ n ǻP_K <R
$met)!攀ad3c:i9(d
!*u#CKF ( :GAqPPs
DU P:bMR 1.`wc]
yBX8F s^cǘ7 ^_:)`sDGs1`fR< W@
Ct%ψ-dHMBr|;,<
^jQ w _x x^`[ n*9t}ta1 Fغq',0e>Rw%D=l؝(=20&uzUJڊn qC G@jC$~V4thWʏB=3S - (tG$} 7݇{t,\3,o};.+=R- 6@*[4Q8,`"81 0p'?ƽ#5=s6
zcBt4Ϩ`2zy _iW0"yՖYc GW˨}-dPrрhp畯ȜdĔx_߄{ꦭ5Adҍ0-a|f\n,-[Fعyv!b7Y/p@FK >P{w {w2DYFE8 ,`e7Ȩa~C{
A$&hߝ~i/,zA8hmjMa?>:L,hF_A7&E!4(; 9']#$ s &Cd6[^ d&
hJQ^Gek1)c@G]xN> pnht,,R4
2P/-V ~-Y Vpڗ7̨O [,rzE&w^ Sètѩ01v%o`[ƩAQr'?2 sc
LөuLƴ; : ^OtЧ>:$6: +ڢ7p8 >F2&Fw2n n0w|NwsCލ]@> {a`BϽ WzBWh"~/\ǐEt . mٟx:eaS:SDݶi̓ex42:2)p>3; <ܟ|
: =d_N< k,X Q~Zq[po? ݾ p`tn1
VuQ0b b],ThLE sc+wԾ`ec.,͇Eza `n 9ٴs[ @D ~~
DAP4#80*zd~0BDDĈ=qb6q* 59.Qh2&Y? pm-̎Ӌfx/]
xW
ǒ6㽎P` !285T[D'A 9 B
FA<.## q^28 'dcA Jwy zxw F|T2!¨Lj9
瀎
p `F HY0ɨP`z
!C;r]dž"1E#1Fgёun #mY *)̌
hW }%,m]cl{3<y])320vDq1!>0 &dPK8m8
SEF9<c0
FT8$P j `\1R˨ ,hlQe1a{Kz/hHѐOy|7N(m8^;kfAD;WcM n ۡR.^!/=#[@kz7*G8rmC9s^G-/>Q)pp
69zG
팅A@:=8<m/ hEe P)K(%O[ *Ҫ{r|vZZW '
s\}NtBsw{0' Y0 ImťpѣvPXa~QpN׳{mM@OɦváۜLL*[fN" gz&wz?8 ^+:8FCq,8xO# G¬ccq!p"Rg<wG< ѣpqߊ蝅Řo>ߛ4Z We ?z9$3/] G? pڐp" S M"3 [%#bTSѝ$-@ymp&'8CeA`:y5 tSŁIQ#4=& C:G0 ~h;~ hsT$}~-,`}+ѮNj{tC[a`r6ɟ;oH c-V
k{ᵰw^Z/Ao㸆r0 4N<5tA
5n3@4DtdVG͈tEӹy
g z%6Gtz9Ʋ^խsG3
wӽ.MM4Sc
3sy`<<|0&ffǕpZw?aχWxĮH #4">ڞ>ٟtN= γxC{\/M;p_u~ ~
;
Y@Be5ð3, ! jxo A)0Bz;j6)n:!WGl/:YC(F!OǺ&1!5{S {$ >l^W%L)eg:7HΏJa5$s
':_$Hqu(Q4b - h<xq|X郌
3(qs jv<( o+TldGu&2\m;ato6̊< y-\H*'&03$##֚@ !D# A0 0݀k/:"~@uh. .v09z aT.]#/#!( 12q6eSA р4 n<
W#o:7pHdqn|KgtK 蝦
}`KaPs4
ʳ6Z,3`oBzax }Y~=!a(C7 ~o]Y3-dwRA(7 nd + δzף! >@Z46 <q])6]2^ջ7EV~ww a<-; y^w*P uCa~N?HbL(Qqx=^ Dwu7hɉ?1<~)̬ntrwЏu P!
B?M@QGF1q
ϖ Y+
EAt I }h^?;^Q8$@46T F2H"fDt:
$,/~:DQ t䱎Qԡ8-%)e[4#Y1ɟA~;,]oAԶx^R [ ~ppmڦ(kD?46µ[9!Eܝ ~(DnQhߜs+aa)j pm( <݁# a7z zՉ`2 }|ER
͘to^＄]
.Kt ͆k=c/~)L-.6jcFs;.vHΑ2
D/8@6'+юq0CK uH $(Ή`s נfо@]=U)t)1.M,9 N,0BC P <2HA;,!1SSi:ȸf0魛G"3:gZW045~Iw{z/2E71{hi _
㳡o|.tI'bLdkJ=t̮}>uB7A@u.Wth"j[I>N SYg]=M`rߏH^ 4-uh=C aCSQ RC65li_kȳy08=oٹ0>=GÃ_3]/v^? E8ʤI|ߍ~-upwó|~mgO> wpW|#2v8> Hi?Yǘ#b1:*": @ƞ9 +oo;/?2c9ϑ v0s=L h+u3DAhb K}NJ
[!w4+;X@D
4q8(DqQ5~TXX S_6ώ _
! H$[8-إb Q:J96 BUiL/q)}IY`@TY guP/)1V{Y I(x"]ga> ]
w
K1`fu3 H 0o#T />C /=d XwD-:Su G ˉ"k hq Sz
0S-lʅչ9 t4QF#QI1
!xOsDx@T90ؚM`6p e0pN?:,0c((O0es U>8+`2 P /aJqe RW٢Pʺ55Fz$f\XX __y[m4Ey an \(l YhmyK #2*
U40rSnPPxHnX@hD#
Kxȳm3/Xc:Y'ݪ=+ ~:ܰѾ4=uT H
7(F7 9wá_vB 6aN@` ?uR?}Ef@JW_
ó3ahz*; wΡq :
%]tyu$a DVF~8BWz杷`W{.GI <7t(d00D#a4-ZCzTp3b$5*
v} (e,풬1'8#rSau{-7~gct3%9+|w[aas_Ւ2|я1!Y s$ tw8C#p Sq/SV
ǝ?u2xG(xTBJl
# δ"oY Gw[o.O
JG._{Q4"8n O? ɸ]Ht;'F~iNzsߩ§ D演Vi#t_; رaP5ؤzy>%"tStߩ1 ^ofh_| 8e) Vt utP-^sG%).H+pyuLWu=˔#[kAiJG`͝𥯾/wm@ݰ~-^onv[5Dm]^VY r
w E?Fajt:,@ss߭o ܶGl \g+ÍN(O멡J>OH[mQt F)g{rlr^5l9~Eω_\cݒ=:^~086 F&&Mp{(\ ?ˤs y ;G~\砬 wuq:P uҽg)p>3; 01 Ȝ Zy֞[/G /
G [R ֶn={aȶa:[ 2l}߽٘
:d09<0gYq Ѷ"R' 8
kSac-UP~@0@ ah ڑ41 =9 }ų F
!2#4?Žqtk x<DJG;9/
A\ ]J݇
j<;".Xhm!!h[Bg 5/Cަ L*-G'@ Տv@Y P;
tMJ6AQ+`yoJУ{}] 1W&qMfq'P*)8 8hsx@>JAΐ< (EDA4BMc":
CcMBbr0yK@i
g4n6ƂGw94&[4ëG{Q&Ew(af^z7lSɞgb*ĵHlW/ vDC ]]y:#eĝE3p` -JW?b79vn13J !O)v{6Hc,qj?߆o7C9l}
L{bT ѻEߙ2=z"կ.ɠ[[;Rg`X۵EXQ G)ν=wD chSF{t Gs)ݕ
Oit 6 ϗxHC M'ZoZch_ tM)_k*Cܝ8]l:ˀ& y=(r|<G .~7|&9hl釼B#1.18fFxO_`xG
. b?-#zj; dh6,lpafA., tfNFhQ^ʦ/_t{'f{6z` hE q
"Fՙ Z^ hFDqG|qӾӬ=0 B9 0'$HT84$ʧ. gKëDGfWDR'w-h{l* ͪ/ BסO@ 60`r@0 @u|w,twJ,T]}58@8Jփ "P=k8paSҵNs0g/= ]@Hy?b> N80$^ FWpITUhwHu3;F%ϑs8ݶd<.IN,/?Go)ZS]I>;nKLc:_
zK[aݰtp' <~'lyh1v #iD-@rCԍK, gY :[vJ 7ɾYHh tk[QJtss024] \ )02(s7}t
_Ge|[
+{7Bp^X7ݵ:,9 a*^7耈p
6zI<"-}㺿gƝ^'GwP&rݟt?uTyNy^~:xYi; ,`=FЎ8+;R_ (c<[email protected]ƗwX o;6a+! t})3,xB⏀PrP'oI҃#!c 5ItII
kMd ?*8+ :gThsy1J *1C)"z ؈N"_14r ) *),RA
9
ѠHDۢdz0&ŁV R_*AlK24PX!q1H,0,B@etI5'PtJ@s&mjFH^)4*E2G # ɧg y#pTt KQ )0 Dc(c oy#e5.6- IeJqPG MCp#Sc RbF5 P-ZDxwM2R?vػ}S'A& `)
b0Vb]^/[D13&o2<\#tD|HCѽeڷ&1fb_A1&wG @eضX kw0< w E q+ :G@ H:$ F4G 06Is80Ń'WRdOox7B@v90f;Qξb$z4G|t`WrmgR i )p;8i݇; 4w.8kP8
C-3/yAtS>0ڿ azn2| ]I.lj єM|sLe9 ?x;|F10 QSc Llޱs
w"Ti [email protected]-D]g2LohN@ 8
DO`z}t_FÔtd9BތHQJ~s6-ܢ0%<./<wɩ0(>14.gEjMtJ'Ց8uX 0>
h*c ;Lj@EY,spbu Ed%`N 8aQ83; |d9 t2
$hwN>kXw.H.6G{aX\]
֯? ;nHlwʈ\:X ]0`62 F=JذIw nڈ } 1u*z:F$1ߣ#۫ IVZOw
{Gah gxt#ɟN <7N\Α 1P.dצepc6
Y/5 _-#:;]enҍnx'wp0t9ѓBBijM}ƎQ{h傪i`Bƾ9t?:ߜ#y sH|z \|Oxii> / Z]:yHi?=@xy Qm-)
[afy5
_ 7 ܵQ;}Xb. { +ĦVnXU|C< n)gV*BX9@>QLϜQBEY>]#,j|! M
=[E : ֣R`J?
?9샠GQ VV9 ֮ 1;:wqeݏ#a
_#J)1: ^.b 0z#> ; Ju$$$}bq1̭蟘 v*8P^J /F3#q1@Wp1n % gm!Z %Njع
1-ap&P.Ft6u F@c[53RLwHЃN F9m
I@] yG mR"GD'
QP"H| |fPs2蟗" t ,/<bI^L (!8`jei2:Tוa4< PaѲhpa=< oÿ vq%¥#RƖ=֜ Y aPWbO3
( Q9Bs[cH;\vA9<àV`2#hs8 Py8
ȯokb2 *+#GA$Ƃ?i\ØwQ9pG@g鍃0 ]"}_fBGg LKRE exziC&t=2HgZh¯G\u@+U)Waӝ
8ElA4G(q1 fA3͍{[Ux_CZoi;hDtbFHðux' ; ~?\s[2wEn_) È % sF;G*a\ و78Fs
WA N*< 9GNŝ0vaB<'A7u0_El vlIޤ; 4G
9gCn\^dQ@huR ֝;+{an ,}pݰu0ڰh~p<@/2&m??asGڗRG(Nd}t"4 r7K9e7-A]jc vtpt*DLh 8'pݢX5 LCNG:>?1͏1^VZY_G}7D+Y-ƚ#N;͛/}aF_ 뇡G4ݳv n> {gŽ[aC
|m2h ) 8qBx 7݈uG9]j{ˢ֮1%U
aj}Oz{3\1pA݉^A|_5]^gPR6G'lK=\rpc5Š,gYػ#} \ _*[nO qxE@yf yiu͑###xgmS$-ןmw']>( ^s})<ef[{?Ǵ L<
,0AD=,y|l1?voUwt{ۯlsFVtzZq70v$fE+µ~ ԇq/VN LI Tu4µ# L 39 Lv%`
9X_ Saj^
2ʆMw%;qR\+@c{ Ébt@Tpp ұkR A]Gx Ǡ #(": BUewYy ! b_eG<z,X
KaykKy{zW#Cꐄ!3 CߋUG (Z(6 h `F!ld@ t( c`,΄+#ӆ ȌHe)
pyh2\bQ"À+v+Ӡ{|NuE]@ 8~
C :
87eΧЄrA` ݝKDЗW bKw1^8"KnwXX۔/Nc+Lّrq-P৶W'ln+6 ?'z_2@GWoXKY8ѩ>֑ 7M x{CAc1U16nZFTCp@k?za BC:.VBj#1 Q_"up;b@tx 0pgA~ڝ>n8xg&B]aaPJC
l
;RFFk]aq r=[ )`u|20#
ƍE81Q0kpY| Oĩ,Qp8Z%BqNG{jܧ}3k|CZ #<>*([w zk2ۯ/M8~@yW°Љ"ᘛ[@\qG7{%ˈt ~X*rn$rF 8 % "@&-Sqzqȇ^uÿ
w¹Ӡ5ws 0>_!>gJ W$:F?t!}CwE 92] ȧ \41/>>0: .tvwA=d?N7w̹ `3 Fq' 8|ACqu';@ 掋V ;DK,MLGi5U,}U/[-^/E;$tQ!N j5AH );ݓz) ß:b["}{~)%+hxb^WNZt7_ =S,XǡwUX.}Sf\ۿvn?
hs t
qLr@C! nad#fxͮ.@?yUHb7T(MÍst|1v{~ [ޢl0yN9;:0{LzN_n
KaxRq9\s+\7 ,zS뫫 `:x{FFIYy~: ^G3JCi=uHUۗ֙Ӳ=_k7LkZVJ) " (߮՞0!b?&6?2*^z ?p0{/
24FLPWj8uh;آ"
G ⨾: ,FݥtG|!\$$-2@G[Wט2` Ί A8S"i0HpgED%)7ǰqQB & q+@ noz&;6i`Fƺ A DX/[hlXX6=.a-/|@ ͋a 'Dqlԇh$MQ`aF{P&"∥EZ#?* D~<8"Xcu#
2#9dp(B03 ~/ d "iN =SPp Ֆ sQєx R>ݨoᅶf$7oV1p|k7'?^~AץI {kymʌ0N,oGFe_靰0e"|~5F*Q7PM:کO pq+Ŧ@2#g|B'%3x|HSOI꽠pT
]pq#5eFc Λ.>Å=2 6myH甇'BpA$ ( n O!e)mSDcqQ\4l"(
ܐh4; U9 _蟮|ut;6.n);aa~S~=
i]H _Z ^{'ͫτ)8)`9 !N@Oi
:sz"}[cD} k2 DsabMKF B 2# hpg ItUʲ֡sӻ;H9Gj C@eD{5 A}l
KvHLV E̬E.Dra2\p# iM[ >OshJ4xE Q'~MsT( 3 E8!C#
ɦ" O; 6 Ž 8~(i2ql^ ~F[dA,XWD(|R߾FXxA;/= sʧ~ Km~aѹ_l
~Y|gETUt]#ޣ 8F9bPbp!\ctڧ 5 zµbyh`a5̬o1lxuz'UDb170h D' mK
8O{HO}={>kn3qg51 R}5UH9^ßs/ ׁ)o_.9ƹ'歃穢./"[خ8>ϓzi~ex9u]\w9ڝ~
;l X3aFXέۿ^y:l N 0'}nu-ܽw m3l`s A>Bvr0'?й:vt x(>I?[M·wE Ш//iH@vOI :
$ (IQI PA bY8 J #@75$Xxh!sae en|"I (B=GgCD,ĭRЯV' (i8
TgR R' <3 voL) XgpYFEI Xf4FtDrlt3 # A$R`6<' : ( Cpi
KCR >~?7 EG `$lB,Y`ws_ $T ` &]WÍ7kaxt 6ڗ3> A<b`fǿC(1yzWܨƁпY}^<ߍqFmAB7!
)caHC!GIF 2X 0t*GS\:2UJG)ȇsV ;ÙhN{rQ'^e1{ãĒ |s")Wip1 *FBHHST$qr20\ &E >E%X>Ps;t
jԓCeE "h =@~)F_i^|7L˘n]+ɂ9"D,`Ma} o 7{G1^?yiDžE 8?Hihsx"&eHvN8o
"πsKS> 8B曎_w
IL# 9} (G:5 8zzGzWl *28(mnu krJg{
5g ! @FO w :L7yMW :s"XE? / NHFNHJ&N繁q;HAѫ-< 8zZ )w<';$f^O Uxhkh"G9}3* \ WDw w7 c:Ý|?l nNMs "d'0Ȃ z VV 8>hVQ\'3QE #4 ݮ!+Q~f6tܹ0~3:=8Hn˪Bʢn G)
za{ nA g{:GyHwCGF8g
'5c{ͬES3l$ܸ}#ቡ0(y?1nSƺij{VLJ n{ͺdyxOwTE~ ϛ^Hw;!?ksz~?I9z/sy}2sg)p>3; ։Wf'L`c{7LI(͆w+ (D F8N2XaV*G ( :udӈ9
,3j!
W:Bԕ3 { l0 0b FVI ֑|瞘f
Q9G8y:} YWW>Fm]g) x
cB P %x<ʦ8bO;a
t7e yYА) Tyc057V`0 X0uq Pޅ 8%pNDE@e 쁄9
'; 9PETDGWP:QD"50C gY`
N)muDʔ&0Ps8
$svD{Ty GGma9~0<l8 mʆ
1ڄ"GDK{ ,<*%Q0%u5K7 /x$pX,Ht1=
RQܧ
9*cocj-x4q0#7ٕ0</:/*Kmr_=YLj@\ )i Rq86Z t&<>Jz\ث SE7C,`65orpL542Un/F AMF#5.1P S FA
Օ^qoa%ѸMI 1l( R/ Xa|Xs=qyAM"y/ ~4
ZuFU`$jii/. aX\:
7D2 Ν0#9xQx$3$fC ;߮qёd9[p&JeuFغq7/mo9 E`
ed:SD dN iN7Rhy GXԁL}fl"tO bK~
(6=5hfw^j<fyu&A bN1Fgyw 8-3NhĪ 5qD8}/
љipM|_z蒌?hI)w4ϛ_),yӱzBI@:8pA8 8^ (:Ĵy ='ȰB )PpgaӰoG?)J86RGx PG3q ]SfKI\w+7 7_9 -o셫20;e'0 # NC+#۲)dP˧"(},[%zٶ\ÉFnpFXjt9
zZLC0gx ra(C70wF^ưdϋ1usyh9YHè wVp9/m[ Krb"L,dž~zsL't9o{ G:};K>څV._~RpzO]>^0S˒J ͝~59r<M#/࿃r{= uMHZ:u?3ͯS8 ߙ209X%Qdpec3Lo%)
ko +YE?0cF :
B(8
p =+=wCZBPqP)9JF!n6'0
g^k=
D.r c DahBP z$^|)Ywma0` sⳠT`PFxC mbCm4A!؏,Xߗq'alf6LH(# >ʣl ^1(/an c> M#_Ӑ#Quz.gA\s g Z[_ ak7ʸ % 9~sD<nJ \7?ץtc$0z7L7?輸/:b8lo} sETC<!#%D8hQ`y'
ڗ [>ݱɶ 4w }Hixݗ70Ӣy h_[َszy) ݿm s\T
M;!tY2KP0/f+Mh #ۜ6*!M#2L/ OFp! 3(O|FfE?<;w nUՋ0 "A>퇶tC
e (#< i[آ5 HGS:ā%%ydz!-g 8#VaCz?8|:iоI#Dzo)Ks
~FDIїsj̻]$g!H>tAq#)дѷTH
* Z/<1
6#Mx>SПh5 yK 7zME`HT AH EfE,J/b܋D^7.w^
orǿاq$]P fq!)v90?կ.
LsQ ^cd G+G:|Na F "}w K~̢8AE
/=uh O_4M sE{SG5<T!!P,tL\0#*D/ jF۪YCbz&=2m@C t pj w⧎!ȗ\5҅O>5mw#r
5Dk6 zƌN폋ΐQ | hZ!k lңaA^ Λ F":*4^) h 31_ޣǡJx02;OuAc2"YԻKz8S&W/ %{"=RcXct^iu vs7Pk\:5;tωd4Jo
s1Ɇ'FGy =fpؑyn̵m*DgvMM%pؿwFG´t}?+x -P *c^zҮ /{٬K <}{^wv!v7 }7P'q5<uOwCөZm&?6L!~}6, ~Fg32>ȴل~
ߩgYQBvddddddddddddddd%dgAFFFFFFFFFFFFFFF YQBvddddddddddddddd%dgAFFFFFFFFFFFFFFF OYw?/]
<[OkuxojSw-ӂɋ v jhВ}FY/ ]5?zr uEPW?<{?i55PWɨE{ 4SY)9K[+!'22ퟅ'4B'xLg)33M+Yh8
@KA{;L2(:EgtO%3ӇVK!?ķ$)FxY >DxO'J°Fi4?
^o? zՕf4)
{~dEiYgO}G+zY[iYS} +iD>O,(wkw{dt- 2>ijd|8AX9M}aUǾ:~s"C}=e^жU,:~Jmr4e ipܮ֓fYRƧOп2<;iS=ѠQ9V3?h ؿg
oӓ|̺N=L4bqѡcgj):gny?ޑrO"QDB TҼMv:ZM ue&+5R JeeyO9
FlsU>YLJu @ Ym([_BV|F,g<Q.~aZNpem/!־oWA4Mvo>R;iS{g~'g|*ii)3M.XL&> ?Lv.pҳ֠ ikidgeFT3*x'lS_i* ^. eV'b*i2UvѴޟ➴L=5暈 NzE@"ڮ'y*JmhEJk"ORV}>3ShԼϓo@K߸ڣ}Hcۤu7Nژ ڿ{ }UZ92ֶV~_eyVܘľ)A7}h?E 1~zv_nK83?hdo<ɻIUʼ}iSsR'\q^5;p?vJJe ʫ\ܞkWFk*NoPb>UPE}
XLٮv5Qzj[|wPnu+g+ISzO頖?/Q|3+oby[hqo]{:_Be# {;+CQn]%VqC
_yG jN/5$.-3AM_ʴ ~wS j]+(;3]dAEiu ]&~S8j vvTGkLJyjA: O{ו>q;Ckp*frޛ?~%hNCKIh]0F<i*$Vo{w,蝹u'{mMY懲SƧ 8K,~ 羽FǭOlS
gW뮝?=L> jOj˫tR]߈];NagjG,m:0?W)OͳY=-ò[yG؆qvjRi95elxQϧ~DQ,-Dľ(]oSEG[qR0|{n/Pyֶ|i|O
ʩ;CR*8{=o>vگ'}'i^ٞ5]~L>Q0Dx 4YGkQ*RZ VUO
qR
uW 5Ok/^ij0p'mVԗenaJMs/^]?SBfjWB B[8:'RFͻ[WGx Z miyg}ueطId|*P ?ퟡ}i 2Q+NzOu[iDwr})~K6MrJ<ʴ8 8-D;A ZjZP BJ:p)LZ^q?eVl'Lmh/]
ӊ{<i;6T묫e_ '_j.)R_b %fQ7*TYjkU)*؏V<sڎj?}gxg)|o" 4oM_<|-ԟky;*ڠ _hy'Yi{ߢs{%gMLgwvh}ϭ$}hL 6Ц?d?SYKh7X@[4BgOY;n$j_!qݒV){p;Jel۪M
5QNK맖n{C-N<]5=gi.jKubRg݀gQ'<iJyT^։gxg -:œ H'_y>q =K[]lu4YV *Ymo-ݟrP6umPj^oIƧ +>ڶIfL)~g_Oz6ZK \ e<egS=9NbNO 3 $$~"#gLMdxftDVJǪe,tdgE|%ǀyLOg|wx֑i?#㳉L >1|'Av|HdgSGKhZv|oA!~Fg32>|j?dgAFFFFFFFFFFFFFFF YQBvddddddddddddddd%dgAFFFFFFFFFFFFFFF YQBvddddddddddddddd%dgAFFFFFFFFFFFFFFF YQBvddddddddddddddd%dgAFFFFFFFFFFFFFFF YQGtǗ¥KAi}m@oꮝ
u?^{gˋGw 't\_*/Gyg8<}O??>}8I?y
}FX^{miA
?|'geddddd|D<gAHyó,.$yۚدwMOgag njGYiEv|D%Yf|WMq Y |#C{xؐI|2S4*buHpQ#ۯGERPTqQ[r ?
7#SI~k7JyZ 4
[zO,8aŲIu'5+Wʊm"ZVQf
כ~䭾veDy 7)/AA;)urI \}(Tʳ>^~w|
mF'=y^J}zi{oyoyTa =V~}~TvPI4 UTڮ3Kl-8{egwpʳQF>]4֚&ԾQE?[M$moJ?W];K(0wV_\vo'UtFFFFFg\dA E *jR0oP&J@S<
ŢP +Z5
GU1IF?
WcyK !VJKUR*JUgMU߫Z_[qվ!ʩ[Z,UXSX H~w#(+XP
>3=<ޗ9j,h~\~3Sܓ2UK7坽?
v=kmH7@ Er?j;5{³/t2?vTFwk;]M+
CYN_ic˻n2vӾeQI}K_8 LAU90(L(+Ua_T~=BI(AZS,H nhFc<hu 8Tއ]9o]=OWJ\VTqm~bq
hH E
֠YP6꣱ 7D@H &}?M3B}u_'W-SzgNz7TZ+xAjli yD3YLj;kgk'*~sMTE ߽O|?e|R|3 '#####㳌O.P,/5.+Y5uW:Ŭu7^PvvgA Sg.U4EUl/X~6'DlQvj[ӢX.A<S_,+e4gh=M5
gå<ETK-OD>;h>wkzF9O],8[7?;Jƀk Oo(Q{w mյӞ iIugZf6p__TNUh|gmV^mK]~{i"7ѬTfm-ϐ;0#####㳃OY`B=
6
HQSGr'U> gݓcY
пcЬ~W߾VGjlvWcM+ibI'9
iABC[z*! |bso_oԵ?i~jLzN{maZի=!} u_6n]m- O:߭]jѓK]F6[Bz<?9-ڽsKp6dddddd| : b^OM 'sŰ22T@Z{MuZmJJѾvJYjhYHGqY ,8OU=R}/~nY }7NWTFhκvW(zҁ`e7*Nv, ?|NC(iFWiZNӗ7OF"ZwQ{uX1 ݝ^o<-)l/
T냥*1wxw/@wluyU(C"Ro[-OcӮgddddd|V9 T2W *k(UT*"%2ţlEC0Ꟃ 5άR=U3mQ0fzrҶ>`8C_)I1ETnQFyR+}-[h3FhE;車
Y [הUg qOOf/IOeҿZhKPg|/_Q R %h};K߫*8K{=U:)c72U7]O[3}v<QOW/qݻoB(w$|$_w?߭'8
:EwXnї
neTP@ UEalT?-G?Y ʌW
2T)]9w֬[z|RUl=K;eQQFzYo"hGl >Zꯥ[Y~]h3r['Le>R\/mX|KqJī>։'>k;K+Qy['*8f'U䫡(douE%e7ZQjw>vz|ڊ(_/whs֢!R{$XYC+|DgU ##$j QGAԁ!v)Gvdd|GOYnCKYtg1`#`d&kG3222222~^U4&$ Rd>
j8{v ױ?OxO,(!; 222222222222222J ##############,(!; 222222222222222J ##############,(DgAFFFFFFFFFFFFFFg,ȿ˿˿˿˿˿˿˿㗝WegA_______~Y/?+*D IENDB` | -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| # Byte-compiled / optimized / DLL files
__pycache__/
*.py[cod]
*$py.class
# C extensions
*.so
# Distribution / packaging
.Python
build/
develop-eggs/
dist/
downloads/
eggs/
.eggs/
lib/
lib64/
parts/
sdist/
var/
wheels/
*.egg-info/
.installed.cfg
*.egg
MANIFEST
# PyInstaller
# Usually these files are written by a Python script from a template
# before PyInstaller builds the exe, so as to inject date/other infos into it.
*.manifest
*.spec
# Installer logs
pip-log.txt
pip-delete-this-directory.txt
# Unit test / coverage reports
htmlcov/
.tox/
.coverage
.coverage.*
.cache
nosetests.xml
coverage.xml
*.cover
.hypothesis/
.pytest_cache/
# Translations
*.mo
*.pot
# Django stuff:
*.log
local_settings.py
db.sqlite3
# Flask stuff:
instance/
.webassets-cache
# Scrapy stuff:
.scrapy
# Sphinx documentation
docs/_build/
# PyBuilder
target/
# Jupyter Notebook
.ipynb_checkpoints
# pyenv
.python-version
# celery beat schedule file
celerybeat-schedule
# SageMath parsed files
*.sage.py
# Environments
.env
.venv
env/
venv/
ENV/
env.bak/
venv.bak/
# Spyder project settings
.spyderproject
.spyproject
# Rope project settings
.ropeproject
# mkdocs documentation
/site
# mypy
.mypy_cache/
.DS_Store
.idea
.try
.vscode/
| # Byte-compiled / optimized / DLL files
__pycache__/
*.py[cod]
*$py.class
# C extensions
*.so
# Distribution / packaging
.Python
build/
develop-eggs/
dist/
downloads/
eggs/
.eggs/
lib/
lib64/
parts/
sdist/
var/
wheels/
*.egg-info/
.installed.cfg
*.egg
MANIFEST
# PyInstaller
# Usually these files are written by a Python script from a template
# before PyInstaller builds the exe, so as to inject date/other infos into it.
*.manifest
*.spec
# Installer logs
pip-log.txt
pip-delete-this-directory.txt
# Unit test / coverage reports
htmlcov/
.tox/
.coverage
.coverage.*
.cache
nosetests.xml
coverage.xml
*.cover
.hypothesis/
.pytest_cache/
# Translations
*.mo
*.pot
# Django stuff:
*.log
local_settings.py
db.sqlite3
# Flask stuff:
instance/
.webassets-cache
# Scrapy stuff:
.scrapy
# Sphinx documentation
docs/_build/
# PyBuilder
target/
# Jupyter Notebook
.ipynb_checkpoints
# pyenv
.python-version
# celery beat schedule file
celerybeat-schedule
# SageMath parsed files
*.sage.py
# Environments
.env
.venv
env/
venv/
ENV/
env.bak/
venv.bak/
# Spyder project settings
.spyderproject
.spyproject
# Rope project settings
.ropeproject
# mkdocs documentation
/site
# mypy
.mypy_cache/
.DS_Store
.idea
.try
.vscode/
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| from typing import Any
class Node:
def __init__(self, data: Any):
self.data = data
self.next = None
class CircularLinkedList:
def __init__(self):
self.head = None
self.tail = None
def __iter__(self):
node = self.head
while self.head:
yield node.data
node = node.next
if node == self.head:
break
def __len__(self) -> int:
return len(tuple(iter(self)))
def __repr__(self):
return "->".join(str(item) for item in iter(self))
def insert_tail(self, data: Any) -> None:
self.insert_nth(len(self), data)
def insert_head(self, data: Any) -> None:
self.insert_nth(0, data)
def insert_nth(self, index: int, data: Any) -> None:
if index < 0 or index > len(self):
raise IndexError("list index out of range.")
new_node = Node(data)
if self.head is None:
new_node.next = new_node # first node points itself
self.tail = self.head = new_node
elif index == 0: # insert at head
new_node.next = self.head
self.head = self.tail.next = new_node
else:
temp = self.head
for _ in range(index - 1):
temp = temp.next
new_node.next = temp.next
temp.next = new_node
if index == len(self) - 1: # insert at tail
self.tail = new_node
def delete_front(self):
return self.delete_nth(0)
def delete_tail(self) -> None:
return self.delete_nth(len(self) - 1)
def delete_nth(self, index: int = 0):
if not 0 <= index < len(self):
raise IndexError("list index out of range.")
delete_node = self.head
if self.head == self.tail: # just one node
self.head = self.tail = None
elif index == 0: # delete head node
self.tail.next = self.tail.next.next
self.head = self.head.next
else:
temp = self.head
for _ in range(index - 1):
temp = temp.next
delete_node = temp.next
temp.next = temp.next.next
if index == len(self) - 1: # delete at tail
self.tail = temp
return delete_node.data
def is_empty(self):
return len(self) == 0
def test_circular_linked_list() -> None:
"""
>>> test_circular_linked_list()
"""
circular_linked_list = CircularLinkedList()
assert len(circular_linked_list) == 0
assert circular_linked_list.is_empty() is True
assert str(circular_linked_list) == ""
try:
circular_linked_list.delete_front()
assert False # This should not happen
except IndexError:
assert True # This should happen
try:
circular_linked_list.delete_tail()
assert False # This should not happen
except IndexError:
assert True # This should happen
try:
circular_linked_list.delete_nth(-1)
assert False
except IndexError:
assert True
try:
circular_linked_list.delete_nth(0)
assert False
except IndexError:
assert True
assert circular_linked_list.is_empty() is True
for i in range(5):
assert len(circular_linked_list) == i
circular_linked_list.insert_nth(i, i + 1)
assert str(circular_linked_list) == "->".join(str(i) for i in range(1, 6))
circular_linked_list.insert_tail(6)
assert str(circular_linked_list) == "->".join(str(i) for i in range(1, 7))
circular_linked_list.insert_head(0)
assert str(circular_linked_list) == "->".join(str(i) for i in range(0, 7))
assert circular_linked_list.delete_front() == 0
assert circular_linked_list.delete_tail() == 6
assert str(circular_linked_list) == "->".join(str(i) for i in range(1, 6))
assert circular_linked_list.delete_nth(2) == 3
circular_linked_list.insert_nth(2, 3)
assert str(circular_linked_list) == "->".join(str(i) for i in range(1, 6))
assert circular_linked_list.is_empty() is False
if __name__ == "__main__":
import doctest
doctest.testmod()
| from typing import Any
class Node:
def __init__(self, data: Any):
self.data = data
self.next = None
class CircularLinkedList:
def __init__(self):
self.head = None
self.tail = None
def __iter__(self):
node = self.head
while self.head:
yield node.data
node = node.next
if node == self.head:
break
def __len__(self) -> int:
return len(tuple(iter(self)))
def __repr__(self):
return "->".join(str(item) for item in iter(self))
def insert_tail(self, data: Any) -> None:
self.insert_nth(len(self), data)
def insert_head(self, data: Any) -> None:
self.insert_nth(0, data)
def insert_nth(self, index: int, data: Any) -> None:
if index < 0 or index > len(self):
raise IndexError("list index out of range.")
new_node = Node(data)
if self.head is None:
new_node.next = new_node # first node points itself
self.tail = self.head = new_node
elif index == 0: # insert at head
new_node.next = self.head
self.head = self.tail.next = new_node
else:
temp = self.head
for _ in range(index - 1):
temp = temp.next
new_node.next = temp.next
temp.next = new_node
if index == len(self) - 1: # insert at tail
self.tail = new_node
def delete_front(self):
return self.delete_nth(0)
def delete_tail(self) -> None:
return self.delete_nth(len(self) - 1)
def delete_nth(self, index: int = 0):
if not 0 <= index < len(self):
raise IndexError("list index out of range.")
delete_node = self.head
if self.head == self.tail: # just one node
self.head = self.tail = None
elif index == 0: # delete head node
self.tail.next = self.tail.next.next
self.head = self.head.next
else:
temp = self.head
for _ in range(index - 1):
temp = temp.next
delete_node = temp.next
temp.next = temp.next.next
if index == len(self) - 1: # delete at tail
self.tail = temp
return delete_node.data
def is_empty(self):
return len(self) == 0
def test_circular_linked_list() -> None:
"""
>>> test_circular_linked_list()
"""
circular_linked_list = CircularLinkedList()
assert len(circular_linked_list) == 0
assert circular_linked_list.is_empty() is True
assert str(circular_linked_list) == ""
try:
circular_linked_list.delete_front()
assert False # This should not happen
except IndexError:
assert True # This should happen
try:
circular_linked_list.delete_tail()
assert False # This should not happen
except IndexError:
assert True # This should happen
try:
circular_linked_list.delete_nth(-1)
assert False
except IndexError:
assert True
try:
circular_linked_list.delete_nth(0)
assert False
except IndexError:
assert True
assert circular_linked_list.is_empty() is True
for i in range(5):
assert len(circular_linked_list) == i
circular_linked_list.insert_nth(i, i + 1)
assert str(circular_linked_list) == "->".join(str(i) for i in range(1, 6))
circular_linked_list.insert_tail(6)
assert str(circular_linked_list) == "->".join(str(i) for i in range(1, 7))
circular_linked_list.insert_head(0)
assert str(circular_linked_list) == "->".join(str(i) for i in range(0, 7))
assert circular_linked_list.delete_front() == 0
assert circular_linked_list.delete_tail() == 6
assert str(circular_linked_list) == "->".join(str(i) for i in range(1, 6))
assert circular_linked_list.delete_nth(2) == 3
circular_linked_list.insert_nth(2, 3)
assert str(circular_linked_list) == "->".join(str(i) for i in range(1, 6))
assert circular_linked_list.is_empty() is False
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Project Euler Problem 174: https://projecteuler.net/problem=174
We shall define a square lamina to be a square outline with a square "hole" so that
the shape possesses vertical and horizontal symmetry.
Given eight tiles it is possible to form a lamina in only one way: 3x3 square with a
1x1 hole in the middle. However, using thirty-two tiles it is possible to form two
distinct laminae.
If t represents the number of tiles used, we shall say that t = 8 is type L(1) and
t = 32 is type L(2).
Let N(n) be the number of t ≤ 1000000 such that t is type L(n); for example,
N(15) = 832.
What is ∑ N(n) for 1 ≤ n ≤ 10?
"""
from collections import defaultdict
from math import ceil, sqrt
def solution(t_limit: int = 1000000, n_limit: int = 10) -> int:
"""
Return the sum of N(n) for 1 <= n <= n_limit.
>>> solution(1000,5)
249
>>> solution(10000,10)
2383
"""
count: defaultdict = defaultdict(int)
for outer_width in range(3, (t_limit // 4) + 2):
if outer_width * outer_width > t_limit:
hole_width_lower_bound = max(
ceil(sqrt(outer_width * outer_width - t_limit)), 1
)
else:
hole_width_lower_bound = 1
hole_width_lower_bound += (outer_width - hole_width_lower_bound) % 2
for hole_width in range(hole_width_lower_bound, outer_width - 1, 2):
count[outer_width * outer_width - hole_width * hole_width] += 1
return sum(1 for n in count.values() if 1 <= n <= 10)
if __name__ == "__main__":
print(f"{solution() = }")
| """
Project Euler Problem 174: https://projecteuler.net/problem=174
We shall define a square lamina to be a square outline with a square "hole" so that
the shape possesses vertical and horizontal symmetry.
Given eight tiles it is possible to form a lamina in only one way: 3x3 square with a
1x1 hole in the middle. However, using thirty-two tiles it is possible to form two
distinct laminae.
If t represents the number of tiles used, we shall say that t = 8 is type L(1) and
t = 32 is type L(2).
Let N(n) be the number of t ≤ 1000000 such that t is type L(n); for example,
N(15) = 832.
What is ∑ N(n) for 1 ≤ n ≤ 10?
"""
from collections import defaultdict
from math import ceil, sqrt
def solution(t_limit: int = 1000000, n_limit: int = 10) -> int:
"""
Return the sum of N(n) for 1 <= n <= n_limit.
>>> solution(1000,5)
249
>>> solution(10000,10)
2383
"""
count: defaultdict = defaultdict(int)
for outer_width in range(3, (t_limit // 4) + 2):
if outer_width * outer_width > t_limit:
hole_width_lower_bound = max(
ceil(sqrt(outer_width * outer_width - t_limit)), 1
)
else:
hole_width_lower_bound = 1
hole_width_lower_bound += (outer_width - hole_width_lower_bound) % 2
for hole_width in range(hole_width_lower_bound, outer_width - 1, 2):
count[outer_width * outer_width - hole_width * hole_width] += 1
return sum(1 for n in count.values() if 1 <= n <= 10)
if __name__ == "__main__":
print(f"{solution() = }")
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| # This theorem states that the number of prime factors of n
# will be approximately log(log(n)) for most natural numbers n
import math
def exactPrimeFactorCount(n):
"""
>>> exactPrimeFactorCount(51242183)
3
"""
count = 0
if n % 2 == 0:
count += 1
while n % 2 == 0:
n = int(n / 2)
# the n input value must be odd so that
# we can skip one element (ie i += 2)
i = 3
while i <= int(math.sqrt(n)):
if n % i == 0:
count += 1
while n % i == 0:
n = int(n / i)
i = i + 2
# this condition checks the prime
# number n is greater than 2
if n > 2:
count += 1
return count
if __name__ == "__main__":
n = 51242183
print(f"The number of distinct prime factors is/are {exactPrimeFactorCount(n)}")
print("The value of log(log(n)) is {:.4f}".format(math.log(math.log(n))))
"""
The number of distinct prime factors is/are 3
The value of log(log(n)) is 2.8765
"""
| # This theorem states that the number of prime factors of n
# will be approximately log(log(n)) for most natural numbers n
import math
def exactPrimeFactorCount(n):
"""
>>> exactPrimeFactorCount(51242183)
3
"""
count = 0
if n % 2 == 0:
count += 1
while n % 2 == 0:
n = int(n / 2)
# the n input value must be odd so that
# we can skip one element (ie i += 2)
i = 3
while i <= int(math.sqrt(n)):
if n % i == 0:
count += 1
while n % i == 0:
n = int(n / i)
i = i + 2
# this condition checks the prime
# number n is greater than 2
if n > 2:
count += 1
return count
if __name__ == "__main__":
n = 51242183
print(f"The number of distinct prime factors is/are {exactPrimeFactorCount(n)}")
print("The value of log(log(n)) is {:.4f}".format(math.log(math.log(n))))
"""
The number of distinct prime factors is/are 3
The value of log(log(n)) is 2.8765
"""
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
An implementation of Karger's Algorithm for partitioning a graph.
"""
from __future__ import annotations
import random
# Adjacency list representation of this graph:
# https://en.wikipedia.org/wiki/File:Single_run_of_Karger%E2%80%99s_Mincut_algorithm.svg
TEST_GRAPH = {
"1": ["2", "3", "4", "5"],
"2": ["1", "3", "4", "5"],
"3": ["1", "2", "4", "5", "10"],
"4": ["1", "2", "3", "5", "6"],
"5": ["1", "2", "3", "4", "7"],
"6": ["7", "8", "9", "10", "4"],
"7": ["6", "8", "9", "10", "5"],
"8": ["6", "7", "9", "10"],
"9": ["6", "7", "8", "10"],
"10": ["6", "7", "8", "9", "3"],
}
def partition_graph(graph: dict[str, list[str]]) -> set[tuple[str, str]]:
"""
Partitions a graph using Karger's Algorithm. Implemented from
pseudocode found here:
https://en.wikipedia.org/wiki/Karger%27s_algorithm.
This function involves random choices, meaning it will not give
consistent outputs.
Args:
graph: A dictionary containing adacency lists for the graph.
Nodes must be strings.
Returns:
The cutset of the cut found by Karger's Algorithm.
>>> graph = {'0':['1'], '1':['0']}
>>> partition_graph(graph)
{('0', '1')}
"""
# Dict that maps contracted nodes to a list of all the nodes it "contains."
contracted_nodes = {node: {node} for node in graph}
graph_copy = {node: graph[node][:] for node in graph}
while len(graph_copy) > 2:
# Choose a random edge.
u = random.choice(list(graph_copy.keys()))
v = random.choice(graph_copy[u])
# Contract edge (u, v) to new node uv
uv = u + v
uv_neighbors = list(set(graph_copy[u] + graph_copy[v]))
uv_neighbors.remove(u)
uv_neighbors.remove(v)
graph_copy[uv] = uv_neighbors
for neighbor in uv_neighbors:
graph_copy[neighbor].append(uv)
contracted_nodes[uv] = set(contracted_nodes[u].union(contracted_nodes[v]))
# Remove nodes u and v.
del graph_copy[u]
del graph_copy[v]
for neighbor in uv_neighbors:
if u in graph_copy[neighbor]:
graph_copy[neighbor].remove(u)
if v in graph_copy[neighbor]:
graph_copy[neighbor].remove(v)
# Find cutset.
groups = [contracted_nodes[node] for node in graph_copy]
return {
(node, neighbor)
for node in groups[0]
for neighbor in graph[node]
if neighbor in groups[1]
}
if __name__ == "__main__":
print(partition_graph(TEST_GRAPH))
| """
An implementation of Karger's Algorithm for partitioning a graph.
"""
from __future__ import annotations
import random
# Adjacency list representation of this graph:
# https://en.wikipedia.org/wiki/File:Single_run_of_Karger%E2%80%99s_Mincut_algorithm.svg
TEST_GRAPH = {
"1": ["2", "3", "4", "5"],
"2": ["1", "3", "4", "5"],
"3": ["1", "2", "4", "5", "10"],
"4": ["1", "2", "3", "5", "6"],
"5": ["1", "2", "3", "4", "7"],
"6": ["7", "8", "9", "10", "4"],
"7": ["6", "8", "9", "10", "5"],
"8": ["6", "7", "9", "10"],
"9": ["6", "7", "8", "10"],
"10": ["6", "7", "8", "9", "3"],
}
def partition_graph(graph: dict[str, list[str]]) -> set[tuple[str, str]]:
"""
Partitions a graph using Karger's Algorithm. Implemented from
pseudocode found here:
https://en.wikipedia.org/wiki/Karger%27s_algorithm.
This function involves random choices, meaning it will not give
consistent outputs.
Args:
graph: A dictionary containing adacency lists for the graph.
Nodes must be strings.
Returns:
The cutset of the cut found by Karger's Algorithm.
>>> graph = {'0':['1'], '1':['0']}
>>> partition_graph(graph)
{('0', '1')}
"""
# Dict that maps contracted nodes to a list of all the nodes it "contains."
contracted_nodes = {node: {node} for node in graph}
graph_copy = {node: graph[node][:] for node in graph}
while len(graph_copy) > 2:
# Choose a random edge.
u = random.choice(list(graph_copy.keys()))
v = random.choice(graph_copy[u])
# Contract edge (u, v) to new node uv
uv = u + v
uv_neighbors = list(set(graph_copy[u] + graph_copy[v]))
uv_neighbors.remove(u)
uv_neighbors.remove(v)
graph_copy[uv] = uv_neighbors
for neighbor in uv_neighbors:
graph_copy[neighbor].append(uv)
contracted_nodes[uv] = set(contracted_nodes[u].union(contracted_nodes[v]))
# Remove nodes u and v.
del graph_copy[u]
del graph_copy[v]
for neighbor in uv_neighbors:
if u in graph_copy[neighbor]:
graph_copy[neighbor].remove(u)
if v in graph_copy[neighbor]:
graph_copy[neighbor].remove(v)
# Find cutset.
groups = [contracted_nodes[node] for node in graph_copy]
return {
(node, neighbor)
for node in groups[0]
for neighbor in graph[node]
if neighbor in groups[1]
}
if __name__ == "__main__":
print(partition_graph(TEST_GRAPH))
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
The A* algorithm combines features of uniform-cost search and pure
heuristic search to efficiently compute optimal solutions.
A* algorithm is a best-first search algorithm in which the cost
associated with a node is f(n) = g(n) + h(n),
where g(n) is the cost of the path from the initial state to node n and
h(n) is the heuristic estimate or the cost or a path
from node n to a goal.A* algorithm introduces a heuristic into a
regular graph-searching algorithm,
essentially planning ahead at each step so a more optimal decision
is made.A* also known as the algorithm with brains
"""
import numpy as np
class Cell:
"""
Class cell represents a cell in the world which have the property
position : The position of the represented by tupleof x and y
coordinates initially set to (0,0)
parent : This contains the parent cell object which we visited
before arrinving this cell
g,h,f : The parameters for constructing the heuristic function
which can be any function. for simplicity used line
distance
"""
def __init__(self):
self.position = (0, 0)
self.parent = None
self.g = 0
self.h = 0
self.f = 0
"""
overrides equals method because otherwise cell assign will give
wrong results
"""
def __eq__(self, cell):
return self.position == cell.position
def showcell(self):
print(self.position)
class Gridworld:
"""
Gridworld class represents the external world here a grid M*M
matrix
world_size: create a numpy array with the given world_size default is 5
"""
def __init__(self, world_size=(5, 5)):
self.w = np.zeros(world_size)
self.world_x_limit = world_size[0]
self.world_y_limit = world_size[1]
def show(self):
print(self.w)
def get_neigbours(self, cell):
"""
Return the neighbours of cell
"""
neughbour_cord = [
(-1, -1),
(-1, 0),
(-1, 1),
(0, -1),
(0, 1),
(1, -1),
(1, 0),
(1, 1),
]
current_x = cell.position[0]
current_y = cell.position[1]
neighbours = []
for n in neughbour_cord:
x = current_x + n[0]
y = current_y + n[1]
if 0 <= x < self.world_x_limit and 0 <= y < self.world_y_limit:
c = Cell()
c.position = (x, y)
c.parent = cell
neighbours.append(c)
return neighbours
def astar(world, start, goal):
"""
Implementation of a start algorithm
world : Object of the world object
start : Object of the cell as start position
stop : Object of the cell as goal position
>>> p = Gridworld()
>>> start = Cell()
>>> start.position = (0,0)
>>> goal = Cell()
>>> goal.position = (4,4)
>>> astar(p, start, goal)
[(0, 0), (1, 1), (2, 2), (3, 3), (4, 4)]
"""
_open = []
_closed = []
_open.append(start)
while _open:
min_f = np.argmin([n.f for n in _open])
current = _open[min_f]
_closed.append(_open.pop(min_f))
if current == goal:
break
for n in world.get_neigbours(current):
for c in _closed:
if c == n:
continue
n.g = current.g + 1
x1, y1 = n.position
x2, y2 = goal.position
n.h = (y2 - y1) ** 2 + (x2 - x1) ** 2
n.f = n.h + n.g
for c in _open:
if c == n and c.f < n.f:
continue
_open.append(n)
path = []
while current.parent is not None:
path.append(current.position)
current = current.parent
path.append(current.position)
return path[::-1]
if __name__ == "__main__":
world = Gridworld()
# stat position and Goal
start = Cell()
start.position = (0, 0)
goal = Cell()
goal.position = (4, 4)
print(f"path from {start.position} to {goal.position}")
s = astar(world, start, goal)
# Just for visual reasons
for i in s:
world.w[i] = 1
print(world.w)
| """
The A* algorithm combines features of uniform-cost search and pure
heuristic search to efficiently compute optimal solutions.
A* algorithm is a best-first search algorithm in which the cost
associated with a node is f(n) = g(n) + h(n),
where g(n) is the cost of the path from the initial state to node n and
h(n) is the heuristic estimate or the cost or a path
from node n to a goal.A* algorithm introduces a heuristic into a
regular graph-searching algorithm,
essentially planning ahead at each step so a more optimal decision
is made.A* also known as the algorithm with brains
"""
import numpy as np
class Cell:
"""
Class cell represents a cell in the world which have the property
position : The position of the represented by tupleof x and y
coordinates initially set to (0,0)
parent : This contains the parent cell object which we visited
before arrinving this cell
g,h,f : The parameters for constructing the heuristic function
which can be any function. for simplicity used line
distance
"""
def __init__(self):
self.position = (0, 0)
self.parent = None
self.g = 0
self.h = 0
self.f = 0
"""
overrides equals method because otherwise cell assign will give
wrong results
"""
def __eq__(self, cell):
return self.position == cell.position
def showcell(self):
print(self.position)
class Gridworld:
"""
Gridworld class represents the external world here a grid M*M
matrix
world_size: create a numpy array with the given world_size default is 5
"""
def __init__(self, world_size=(5, 5)):
self.w = np.zeros(world_size)
self.world_x_limit = world_size[0]
self.world_y_limit = world_size[1]
def show(self):
print(self.w)
def get_neigbours(self, cell):
"""
Return the neighbours of cell
"""
neughbour_cord = [
(-1, -1),
(-1, 0),
(-1, 1),
(0, -1),
(0, 1),
(1, -1),
(1, 0),
(1, 1),
]
current_x = cell.position[0]
current_y = cell.position[1]
neighbours = []
for n in neughbour_cord:
x = current_x + n[0]
y = current_y + n[1]
if 0 <= x < self.world_x_limit and 0 <= y < self.world_y_limit:
c = Cell()
c.position = (x, y)
c.parent = cell
neighbours.append(c)
return neighbours
def astar(world, start, goal):
"""
Implementation of a start algorithm
world : Object of the world object
start : Object of the cell as start position
stop : Object of the cell as goal position
>>> p = Gridworld()
>>> start = Cell()
>>> start.position = (0,0)
>>> goal = Cell()
>>> goal.position = (4,4)
>>> astar(p, start, goal)
[(0, 0), (1, 1), (2, 2), (3, 3), (4, 4)]
"""
_open = []
_closed = []
_open.append(start)
while _open:
min_f = np.argmin([n.f for n in _open])
current = _open[min_f]
_closed.append(_open.pop(min_f))
if current == goal:
break
for n in world.get_neigbours(current):
for c in _closed:
if c == n:
continue
n.g = current.g + 1
x1, y1 = n.position
x2, y2 = goal.position
n.h = (y2 - y1) ** 2 + (x2 - x1) ** 2
n.f = n.h + n.g
for c in _open:
if c == n and c.f < n.f:
continue
_open.append(n)
path = []
while current.parent is not None:
path.append(current.position)
current = current.parent
path.append(current.position)
return path[::-1]
if __name__ == "__main__":
world = Gridworld()
# stat position and Goal
start = Cell()
start.position = (0, 0)
goal = Cell()
goal.position = (4, 4)
print(f"path from {start.position} to {goal.position}")
s = astar(world, start, goal)
# Just for visual reasons
for i in s:
world.w[i] = 1
print(world.w)
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Peak signal-to-noise ratio - PSNR
https://en.wikipedia.org/wiki/Peak_signal-to-noise_ratio
Source:
https://tutorials.techonical.com/how-to-calculate-psnr-value-of-two-images-using-python
"""
import math
import os
import cv2
import numpy as np
def psnr(original, contrast):
mse = np.mean((original - contrast) ** 2)
if mse == 0:
return 100
PIXEL_MAX = 255.0
PSNR = 20 * math.log10(PIXEL_MAX / math.sqrt(mse))
return PSNR
def main():
dir_path = os.path.dirname(os.path.realpath(__file__))
# Loading images (original image and compressed image)
original = cv2.imread(os.path.join(dir_path, "image_data/original_image.png"))
contrast = cv2.imread(os.path.join(dir_path, "image_data/compressed_image.png"), 1)
original2 = cv2.imread(os.path.join(dir_path, "image_data/PSNR-example-base.png"))
contrast2 = cv2.imread(
os.path.join(dir_path, "image_data/PSNR-example-comp-10.jpg"), 1
)
# Value expected: 29.73dB
print("-- First Test --")
print(f"PSNR value is {psnr(original, contrast)} dB")
# # Value expected: 31.53dB (Wikipedia Example)
print("\n-- Second Test --")
print(f"PSNR value is {psnr(original2, contrast2)} dB")
if __name__ == "__main__":
main()
| """
Peak signal-to-noise ratio - PSNR
https://en.wikipedia.org/wiki/Peak_signal-to-noise_ratio
Source:
https://tutorials.techonical.com/how-to-calculate-psnr-value-of-two-images-using-python
"""
import math
import os
import cv2
import numpy as np
def psnr(original, contrast):
mse = np.mean((original - contrast) ** 2)
if mse == 0:
return 100
PIXEL_MAX = 255.0
PSNR = 20 * math.log10(PIXEL_MAX / math.sqrt(mse))
return PSNR
def main():
dir_path = os.path.dirname(os.path.realpath(__file__))
# Loading images (original image and compressed image)
original = cv2.imread(os.path.join(dir_path, "image_data/original_image.png"))
contrast = cv2.imread(os.path.join(dir_path, "image_data/compressed_image.png"), 1)
original2 = cv2.imread(os.path.join(dir_path, "image_data/PSNR-example-base.png"))
contrast2 = cv2.imread(
os.path.join(dir_path, "image_data/PSNR-example-comp-10.jpg"), 1
)
# Value expected: 29.73dB
print("-- First Test --")
print(f"PSNR value is {psnr(original, contrast)} dB")
# # Value expected: 31.53dB (Wikipedia Example)
print("\n-- Second Test --")
print(f"PSNR value is {psnr(original2, contrast2)} dB")
if __name__ == "__main__":
main()
| -1 |
TheAlgorithms/Python | 4,278 | fix(mypy): Fix annotations for 13 cipher algorithms | Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| dhruvmanila | "2021-03-20T09:09:15Z" | "2021-03-22T06:59:51Z" | 99a42f2b5821356718fb7d011ac711a6b4a63a83 | 14bcb580d55ee90614ad258ea31ef8fe4e4b5c40 | fix(mypy): Fix annotations for 13 cipher algorithms. Issue: #4052
```console
$ git diff master --name-only
ciphers/a1z26.py
ciphers/affine_cipher.py
ciphers/atbash.py
ciphers/base32.py
ciphers/base85.py
ciphers/beaufort_cipher.py
ciphers/brute_force_caesar_cipher.py
ciphers/cryptomath_module.py
ciphers/decrypt_caesar_with_chi_squared.py
ciphers/diffie.py
ciphers/elgamal_key_generator.py
ciphers/enigma_machine2.py
ciphers/rsa_key_generator.py
```
Running `mypy`:
```console
$ git diff master --name-only | xargs -I% mypy --strict %
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
Success: no issues found in 1 source file
```
### **Describe your change:**
* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [ ] All new Python files are placed inside an existing directory.
* [ ] All filenames are in all lowercase characters with no spaces or dashes.
* [ ] All functions and variable names follow Python naming conventions.
* [ ] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [ ] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| 75
95 64
17 47 82
18 35 87 10
20 04 82 47 65
19 01 23 75 03 34
88 02 77 73 07 63 67
99 65 04 28 06 16 70 92
41 41 26 56 83 40 80 70 33
41 48 72 33 47 32 37 16 94 29
53 71 44 65 25 43 91 52 97 51 14
70 11 33 28 77 73 17 78 39 68 17 57
91 71 52 38 17 14 91 43 58 50 27 29 48
63 66 04 68 89 53 67 30 73 16 69 87 40 31
04 62 98 27 23 09 70 98 73 93 38 53 60 04 23
| 75
95 64
17 47 82
18 35 87 10
20 04 82 47 65
19 01 23 75 03 34
88 02 77 73 07 63 67
99 65 04 28 06 16 70 92
41 41 26 56 83 40 80 70 33
41 48 72 33 47 32 37 16 94 29
53 71 44 65 25 43 91 52 97 51 14
70 11 33 28 77 73 17 78 39 68 17 57
91 71 52 38 17 14 91 43 58 50 27 29 48
63 66 04 68 89 53 67 30 73 16 69 87 40 31
04 62 98 27 23 09 70 98 73 93 38 53 60 04 23
| -1 |
Subsets and Splits