github/RRG-Proxmark3
1
0
Fork 0
mirror of https://github.com/RfidResearchGroup/proxmark3.git synced 2025-07-30 11:39:14 -07:00
Code Issues Projects Releases Packages Wiki Activity Actions 4

part of monstermerge...

Browse source
This commit is contained in:
iceman1001 2017-07-27 20:48:49 +02:00
parent 8f262aa1bf
commit 6519ae6f88
373 changed files with 4275 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

3
.gitconfig Normal file
View file

@ -0,0 +1,3 @@
[user]
email = iceman@iuse.se
name = iceman1001

BIN
client/hardnested/bf_bench_data.bin Normal file
View file

Binary file not shown.

603
client/hardnested/hardnested_bf_core.c Normal file
View file

@ -0,0 +1,603 @@
//-----------------------------------------------------------------------------
// Copyright (C) 2016, 2017 by piwi
//
// This code is licensed to you under the terms of the GNU GPL, version 2 or,
// at your option, any later version. See the LICENSE.txt file for the text of
// the license.
//-----------------------------------------------------------------------------
// Implements a card only attack based on crypto text (encrypted nonces
// received during a nested authentication) only. Unlike other card only
// attacks this doesn't rely on implementation errors but only on the
// inherent weaknesses of the crypto1 cypher. Described in
// Carlo Meijer, Roel Verdult, "Ciphertext-only Cryptanalysis on Hardened
// Mifare Classic Cards" in Proceedings of the 22nd ACM SIGSAC Conference on
// Computer and Communications Security, 2015
//-----------------------------------------------------------------------------
//
// brute forcing is based on @aczids bitsliced brute forcer
// https://github.com/aczid/crypto1_bs with some modifications. Mainly:
// - don't rollback. Start with 2nd byte of nonce instead
// - reuse results of filter subfunctions
// - reuse results of previous nonces if some first bits are identical
//
//-----------------------------------------------------------------------------
// aczid's Copyright notice:
//
// Bit-sliced Crypto-1 brute-forcing implementation
// Builds on the data structures returned by CraptEV1 craptev1_get_space(nonces, threshold, uid)
/*
Copyright (c) 2015-2016 Aram Verstegen
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#include "hardnested_bf_core.h"
#include <stdint.h>
#include <stdbool.h>
#include <stdlib.h>
#ifndef __APPLE__
#include <malloc.h>
#endif
#include <stdio.h>
#include <string.h>
#include "crapto1/crapto1.h"
#include "parity.h"
// bitslice type
// while AVX supports 256 bit vector floating point operations, we need integer operations for boolean logic
// same for AVX2 and 512 bit vectors
// using larger vectors works but seems to generate more register pressure
#if defined(__AVX512F__)
#define MAX_BITSLICES 512
#elif defined(__AVX2__)
#define MAX_BITSLICES 256
#elif defined(__AVX__)
#define MAX_BITSLICES 128
#elif defined(__SSE2__)
#define MAX_BITSLICES 128
#else // MMX or SSE or NOSIMD
#define MAX_BITSLICES 64
#endif
#define VECTOR_SIZE (MAX_BITSLICES/8)
typedef unsigned int __attribute__((aligned(VECTOR_SIZE))) __attribute__((vector_size(VECTOR_SIZE))) bitslice_value_t;
typedef union {
bitslice_value_t value;
uint64_t bytes64[MAX_BITSLICES/64];
uint8_t bytes[MAX_BITSLICES/8];
} bitslice_t;
// filter function (f20)
// sourced from ``Wirelessly Pickpocketing a Mifare Classic Card'' by Flavio Garcia, Peter van Rossum, Roel Verdult and Ronny Wichers Schreur
#define f20a(a,b,c,d) (((a|b)^(a&d))^(c&((a^b)|d)))
#define f20b(a,b,c,d) (((a&b)|c)^((a^b)&(c|d)))
#define f20c(a,b,c,d,e) ((a|((b|e)&(d^e)))^((a^(b&d))&((c^d)|(b&e))))
// bit indexing
#define get_bit(n, word) (((word) >> (n)) & 1)
#define get_vector_bit(slice, value) get_bit((slice)&0x3f, value.bytes64[(slice)>>6])
// size of crypto-1 state
#define STATE_SIZE 48
// size of nonce to be decrypted
#define KEYSTREAM_SIZE 24
// endianness conversion
#define rev32(word) ((((word) & 0xff) << 24) | ((((word) >> 8) & 0xff) << 16) | ((((word) >> 16) & 0xff) << 8) | ((((word) >> 24) & 0xff)))
// this needs to be compiled several times for each instruction set.
// For each instruction set, define a dedicated function name:
#if defined (__AVX512F__)
#define BITSLICE_TEST_NONCES bitslice_test_nonces_AVX512
#define CRACK_STATES_BITSLICED crack_states_bitsliced_AVX512
#elif defined (__AVX2__)
#define BITSLICE_TEST_NONCES bitslice_test_nonces_AVX2
#define CRACK_STATES_BITSLICED crack_states_bitsliced_AVX2
#elif defined (__AVX__)
#define BITSLICE_TEST_NONCES bitslice_test_nonces_AVX
#define CRACK_STATES_BITSLICED crack_states_bitsliced_AVX
#elif defined (__SSE2__)
#define BITSLICE_TEST_NONCES bitslice_test_nonces_SSE2
#define CRACK_STATES_BITSLICED crack_states_bitsliced_SSE2
#elif defined (__MMX__)
#define BITSLICE_TEST_NONCES bitslice_test_nonces_MMX
#define CRACK_STATES_BITSLICED crack_states_bitsliced_MMX
#else
#define BITSLICE_TEST_NONCES bitslice_test_nonces_NOSIMD
#define CRACK_STATES_BITSLICED crack_states_bitsliced_NOSIMD
#endif
// typedefs and declaration of functions:
typedef const uint64_t crack_states_bitsliced_t(uint32_t, uint8_t*, statelist_t*, uint32_t*, uint64_t*, uint32_t, uint8_t*, noncelist_t*);
crack_states_bitsliced_t crack_states_bitsliced_AVX512;
crack_states_bitsliced_t crack_states_bitsliced_AVX2;
crack_states_bitsliced_t crack_states_bitsliced_AVX;
crack_states_bitsliced_t crack_states_bitsliced_SSE2;
crack_states_bitsliced_t crack_states_bitsliced_MMX;
crack_states_bitsliced_t crack_states_bitsliced_NOSIMD;
crack_states_bitsliced_t crack_states_bitsliced_dispatch;
typedef void bitslice_test_nonces_t(uint32_t, uint32_t*, uint8_t*);
bitslice_test_nonces_t bitslice_test_nonces_AVX512;
bitslice_test_nonces_t bitslice_test_nonces_AVX2;
bitslice_test_nonces_t bitslice_test_nonces_AVX;
bitslice_test_nonces_t bitslice_test_nonces_SSE2;
bitslice_test_nonces_t bitslice_test_nonces_MMX;
bitslice_test_nonces_t bitslice_test_nonces_NOSIMD;
bitslice_test_nonces_t bitslice_test_nonces_dispatch;
#if defined (_WIN32)
#define malloc_bitslice(x) __builtin_assume_aligned(_aligned_malloc((x), MAX_BITSLICES/8), MAX_BITSLICES/8)
#define free_bitslice(x) _aligned_free(x)
#elif defined (__APPLE__)
static void *malloc_bitslice(size_t x) {
char *allocated_memory;
if (posix_memalign((void**)&allocated_memory, MAX_BITSLICES/8, x)) {
return NULL;
} else {
return __builtin_assume_aligned(allocated_memory, MAX_BITSLICES/8);
}
}
#define free_bitslice(x) free(x)
#else
#define malloc_bitslice(x) memalign(MAX_BITSLICES/8, (x))
#define free_bitslice(x) free(x)
#endif
typedef enum {
EVEN_STATE = 0,
ODD_STATE = 1
} odd_even_t;
// arrays of bitsliced states with identical values in all slices
static bitslice_t bitsliced_encrypted_nonces[256][KEYSTREAM_SIZE];
static bitslice_t bitsliced_encrypted_parity_bits[256][4];
// 1 and 0 vectors
static bitslice_t bs_ones;
static bitslice_t bs_zeroes;
void BITSLICE_TEST_NONCES(uint32_t nonces_to_bruteforce, uint32_t *bf_test_nonce, uint8_t *bf_test_nonce_par) {
// initialize 1 and 0 vectors
memset(bs_ones.bytes, 0xff, VECTOR_SIZE);
memset(bs_zeroes.bytes, 0x00, VECTOR_SIZE);
// bitslice nonces' 2nd to 4th byte
for (uint32_t i = 0; i < nonces_to_bruteforce; i++) {
for(uint32_t bit_idx = 0; bit_idx < KEYSTREAM_SIZE; bit_idx++){
bool bit = get_bit(KEYSTREAM_SIZE-1-bit_idx, rev32(bf_test_nonce[i] << 8));
if(bit){
bitsliced_encrypted_nonces[i][bit_idx].value = bs_ones.value;
} else {
bitsliced_encrypted_nonces[i][bit_idx].value = bs_zeroes.value;
}
}
}
// bitslice nonces' parity (4 bits)
for (uint32_t i = 0; i < nonces_to_bruteforce; i++) {
for(uint32_t bit_idx = 0; bit_idx < 4; bit_idx++){
bool bit = get_bit(4-1-bit_idx, bf_test_nonce_par[i]);
if(bit){
bitsliced_encrypted_parity_bits[i][bit_idx].value = bs_ones.value;
} else {
bitsliced_encrypted_parity_bits[i][bit_idx].value = bs_zeroes.value;
}
}
}
}
const uint64_t CRACK_STATES_BITSLICED(uint32_t cuid, uint8_t *best_first_bytes, statelist_t *p, uint32_t *keys_found, uint64_t *num_keys_tested, uint32_t nonces_to_bruteforce, uint8_t *bf_test_nonce_2nd_byte, noncelist_t *nonces){
// Unlike aczid's implementation this doesn't roll back at all when performing bitsliced bruteforce.
// We know that the best first byte is already shifted in. Testing with the remaining three bytes of
// the nonces is sufficient to eliminate most of them. The small rest is tested with a simple unsliced
// brute forcing (including roll back).
bitslice_t states[KEYSTREAM_SIZE+STATE_SIZE];
bitslice_t * restrict state_p;
uint64_t key = -1;
uint64_t bucket_states_tested = 0;
uint32_t bucket_size[(p->len[EVEN_STATE] - 1)/MAX_BITSLICES + 1];
uint32_t bitsliced_blocks = 0;
uint32_t const *restrict p_even_end = p->states[EVEN_STATE] + p->len[EVEN_STATE];
#if defined (DEBUG_BRUTE_FORCE)
uint32_t elimination_step = 0;
#define MAX_ELIMINATION_STEP 32
uint64_t keys_eliminated[MAX_ELIMINATION_STEP] = {0};
#endif
#ifdef DEBUG_KEY_ELIMINATION
bool bucket_contains_test_key[(p->len[EVEN_STATE] - 1)/MAX_BITSLICES + 1];
#endif
// constant ones/zeroes
bitslice_t bs_ones;
memset(bs_ones.bytes, 0xff, VECTOR_SIZE);
bitslice_t bs_zeroes;
memset(bs_zeroes.bytes, 0x00, VECTOR_SIZE);
// bitslice all the even states
bitslice_t **restrict bitsliced_even_states = (bitslice_t **)malloc(((p->len[EVEN_STATE] - 1)/MAX_BITSLICES + 1) * sizeof(bitslice_t *));
if (bitsliced_even_states == NULL) {
printf("Out of memory error in brute_force. Aborting...");
exit(4);
}
bitslice_value_t *restrict bitsliced_even_feedback = malloc_bitslice(((p->len[EVEN_STATE] - 1)/MAX_BITSLICES + 1) * sizeof(bitslice_value_t));
if (bitsliced_even_feedback == NULL) {
printf("Out of memory error in brute_force. Aborting...");
exit(4);
}
for(uint32_t *restrict p_even = p->states[EVEN_STATE]; p_even < p_even_end; p_even += MAX_BITSLICES){
bitslice_t *restrict lstate_p = malloc_bitslice(STATE_SIZE/2*sizeof(bitslice_t));
if (lstate_p == NULL) {
printf("Out of memory error in brute_force. Aborting... \n");
exit(4);
}
memset(lstate_p, 0x00, STATE_SIZE/2*sizeof(bitslice_t)); // zero even bits
// bitslice even half-states
const uint32_t max_slices = (p_even_end-p_even) < MAX_BITSLICES ? p_even_end-p_even : MAX_BITSLICES;
bucket_size[bitsliced_blocks] = max_slices;
#ifdef DEBUG_KEY_ELIMINATION
bucket_contains_test_key[bitsliced_blocks] = false;
#endif
uint32_t slice_idx;
for(slice_idx = 0; slice_idx < max_slices; ++slice_idx){
uint32_t e = *(p_even+slice_idx);
#ifdef DEBUG_KEY_ELIMINATION
if (known_target_key != -1 && e == test_state[EVEN_STATE]) {
bucket_contains_test_key[bitsliced_blocks] = true;
// printf("bucket %d contains test key even state\n", bitsliced_blocks);
// printf("in slice %d\n", slice_idx);
}
#endif
for(uint32_t bit_idx = 0; bit_idx < STATE_SIZE/2; bit_idx++, e >>= 1){
// set even bits
if(e&1){
lstate_p[bit_idx].bytes64[slice_idx>>6] |= 1ull << (slice_idx & 0x3f);
}
}
}
// padding with last even state
for ( ; slice_idx < MAX_BITSLICES; ++slice_idx) {
uint32_t e = *(p_even_end-1);
for(uint32_t bit_idx = 0; bit_idx < STATE_SIZE/2; bit_idx++, e >>= 1){
// set even bits
if(e&1){
lstate_p[bit_idx].bytes64[slice_idx>>6] |= 1ull << (slice_idx & 0x3f);
}
}
}
bitsliced_even_states[bitsliced_blocks] = lstate_p;
// bitsliced_even_feedback[bitsliced_blocks] = bs_ones;
bitsliced_even_feedback[bitsliced_blocks] = lstate_p[(47- 0)/2].value ^
lstate_p[(47-10)/2].value ^ lstate_p[(47-12)/2].value ^ lstate_p[(47-14)/2].value ^
lstate_p[(47-24)/2].value ^ lstate_p[(47-42)/2].value;
bitsliced_blocks++;
}
// bitslice every odd state to every block of even states
for(uint32_t const *restrict p_odd = p->states[ODD_STATE]; p_odd < p->states[ODD_STATE] + p->len[ODD_STATE]; ++p_odd){
// early abort
if(*keys_found){
goto out;
}
// set odd state bits and pre-compute first keystream bit vector. This is the same for all blocks of even states
state_p = &states[KEYSTREAM_SIZE];
uint32_t o = *p_odd;
// pre-compute the odd feedback bit
bool odd_feedback_bit = evenparity32(o&0x29ce5c);
const bitslice_value_t odd_feedback = odd_feedback_bit ? bs_ones.value : bs_zeroes.value;
// set odd state bits
for (uint32_t state_idx = 0; state_idx < STATE_SIZE; o >>= 1, state_idx += 2) {
if (o & 1){
state_p[state_idx] = bs_ones;
} else {
state_p[state_idx] = bs_zeroes;
}
}
bitslice_value_t crypto1_bs_f20b_2[16];
bitslice_value_t crypto1_bs_f20b_3[8];
crypto1_bs_f20b_2[0] = f20b(state_p[47-25].value, state_p[47-27].value, state_p[47-29].value, state_p[47-31].value);
crypto1_bs_f20b_3[0] = f20b(state_p[47-41].value, state_p[47-43].value, state_p[47-45].value, state_p[47-47].value);
bitslice_value_t ksb[8];
ksb[0] = f20c(f20a(state_p[47- 9].value, state_p[47-11].value, state_p[47-13].value, state_p[47-15].value),
f20b(state_p[47-17].value, state_p[47-19].value, state_p[47-21].value, state_p[47-23].value),
crypto1_bs_f20b_2[0],
f20a(state_p[47-33].value, state_p[47-35].value, state_p[47-37].value, state_p[47-39].value),
crypto1_bs_f20b_3[0]);
uint32_t *restrict p_even = p->states[EVEN_STATE];
for (uint32_t block_idx = 0; block_idx < bitsliced_blocks; ++block_idx, p_even += MAX_BITSLICES) {
#ifdef DEBUG_KEY_ELIMINATION
// if (known_target_key != -1 && bucket_contains_test_key[block_idx] && *p_odd == test_state[ODD_STATE]) {
// printf("Now testing known target key.\n");
// printf("block_idx = %d/%d\n", block_idx, bitsliced_blocks);
// }
#endif
// add the even state bits
const bitslice_t const *restrict bitsliced_even_state = bitsliced_even_states[block_idx];
for(uint32_t state_idx = 1; state_idx < STATE_SIZE; state_idx += 2) {
state_p[state_idx] = bitsliced_even_state[state_idx/2];
}
// pre-compute first feedback bit vector. This is the same for all nonces
bitslice_value_t fbb[8];
fbb[0] = odd_feedback ^ bitsliced_even_feedback[block_idx];
// vector to contain test results (1 = passed, 0 = failed)
bitslice_t results = bs_ones;
// parity_bits
bitslice_value_t par[8];
par[0] = bs_zeroes.value;
uint32_t next_common_bits = 0;
for(uint32_t tests = 0; tests < nonces_to_bruteforce; ++tests){
// common bits with preceding test nonce
uint32_t common_bits = next_common_bits; //tests ? trailing_zeros(bf_test_nonce_2nd_byte[tests] ^ bf_test_nonce_2nd_byte[tests-1]) : 0;
next_common_bits = tests < nonces_to_bruteforce - 1 ? trailing_zeros(bf_test_nonce_2nd_byte[tests] ^ bf_test_nonce_2nd_byte[tests+1]) : 0;
uint32_t parity_bit_idx = 1; // start checking with the parity of second nonce byte
bitslice_value_t fb_bits = fbb[common_bits]; // start with precomputed feedback bits from previous nonce
bitslice_value_t ks_bits = ksb[common_bits]; // dito for first keystream bits
bitslice_value_t parity_bit_vector = par[common_bits]; // dito for first parity vector
// bitslice_value_t fb_bits = fbb[0]; // start with precomputed feedback bits from previous nonce
// bitslice_value_t ks_bits = ksb[0]; // dito for first keystream bits
// bitslice_value_t parity_bit_vector = par[0]; // dito for first parity vector
state_p -= common_bits; // and reuse the already calculated state bits
// highest bit is transmitted/received first. We start with Bit 23 (highest bit of second nonce byte),
// or the highest bit which differs from the previous nonce
for (int32_t ks_idx = KEYSTREAM_SIZE-1-common_bits; ks_idx >= 0; --ks_idx) {
// decrypt nonce bits
const bitslice_value_t encrypted_nonce_bit_vector = bitsliced_encrypted_nonces[tests][ks_idx].value;
const bitslice_value_t decrypted_nonce_bit_vector = encrypted_nonce_bit_vector ^ ks_bits;
// compute real parity bits on the fly
parity_bit_vector ^= decrypted_nonce_bit_vector;
// update state
state_p--;
state_p[0].value = fb_bits ^ decrypted_nonce_bit_vector;
// update crypto1 subfunctions
bitslice_value_t f20a_1, f20b_1, f20b_2, f20a_2, f20b_3;
f20a_2 = f20a(state_p[47-33].value, state_p[47-35].value, state_p[47-37].value, state_p[47-39].value);
f20b_3 = f20b(state_p[47-41].value, state_p[47-43].value, state_p[47-45].value, state_p[47-47].value);
if (ks_idx > KEYSTREAM_SIZE - 8) {
f20a_1 = f20a(state_p[47- 9].value, state_p[47-11].value, state_p[47-13].value, state_p[47-15].value);
f20b_1 = f20b(state_p[47-17].value, state_p[47-19].value, state_p[47-21].value, state_p[47-23].value);
f20b_2 = f20b(state_p[47-25].value, state_p[47-27].value, state_p[47-29].value, state_p[47-31].value);
crypto1_bs_f20b_2[KEYSTREAM_SIZE - ks_idx] = f20b_2;
crypto1_bs_f20b_3[KEYSTREAM_SIZE - ks_idx] = f20b_3;
} else if (ks_idx > KEYSTREAM_SIZE - 16) {
f20a_1 = f20a(state_p[47- 9].value, state_p[47-11].value, state_p[47-13].value, state_p[47-15].value);
f20b_1 = crypto1_bs_f20b_2[KEYSTREAM_SIZE - ks_idx - 8];
f20b_2 = f20b(state_p[47-25].value, state_p[47-27].value, state_p[47-29].value, state_p[47-31].value);
crypto1_bs_f20b_2[KEYSTREAM_SIZE - ks_idx] = f20b_2;
} else if (ks_idx > KEYSTREAM_SIZE - 24){
f20a_1 = f20a(state_p[47- 9].value, state_p[47-11].value, state_p[47-13].value, state_p[47-15].value);
f20b_1 = crypto1_bs_f20b_2[KEYSTREAM_SIZE - ks_idx - 8];
f20b_2 = crypto1_bs_f20b_3[KEYSTREAM_SIZE - ks_idx - 16];
} else {
f20a_1 = f20a(state_p[47- 9].value, state_p[47-11].value, state_p[47-13].value, state_p[47-15].value);
f20b_1 = f20b(state_p[47-17].value, state_p[47-19].value, state_p[47-21].value, state_p[47-23].value);
f20b_2 = f20b(state_p[47-25].value, state_p[47-27].value, state_p[47-29].value, state_p[47-31].value);
}
// update keystream bit
ks_bits = f20c(f20a_1, f20b_1, f20b_2, f20a_2, f20b_3);
// for each completed byte:
if ((ks_idx & 0x07) == 0) {
// get encrypted parity bits
const bitslice_value_t encrypted_parity_bit_vector = bitsliced_encrypted_parity_bits[tests][parity_bit_idx++].value;
// decrypt parity bits
const bitslice_value_t decrypted_parity_bit_vector = encrypted_parity_bit_vector ^ ks_bits;
// compare actual parity bits with decrypted parity bits and take count in results vector
results.value &= ~parity_bit_vector ^ decrypted_parity_bit_vector;
// make sure we still have a match in our set
// if(memcmp(&results, &bs_zeroes, sizeof(bitslice_t)) == 0){
// this is much faster on my gcc, because somehow a memcmp needlessly spills/fills all the xmm registers to/from the stack - ???
// the short-circuiting also helps
if(results.bytes64[0] == 0
#if MAX_BITSLICES > 64
&& results.bytes64[1] == 0
#endif
#if MAX_BITSLICES > 128
&& results.bytes64[2] == 0
&& results.bytes64[3] == 0
#endif
) {
#if defined (DEBUG_BRUTE_FORCE)
if (elimination_step < MAX_ELIMINATION_STEP) {
keys_eliminated[elimination_step] += MAX_BITSLICES;
}
#endif
#ifdef DEBUG_KEY_ELIMINATION
if (known_target_key != -1 && bucket_contains_test_key[block_idx] && *p_odd == test_state[ODD_STATE]) {
printf("Known target key eliminated in brute_force.\n");
printf("block_idx = %d/%d, nonce = %d/%d\n", block_idx, bitsliced_blocks, tests, nonces_to_bruteforce);
}
#endif
goto stop_tests;
}
// prepare for next nonce byte
#if defined (DEBUG_BRUTE_FORCE)
elimination_step++;
#endif
parity_bit_vector = bs_zeroes.value;
}
// update feedback bit vector
if (ks_idx != 0) {
fb_bits =
(state_p[47- 0].value ^ state_p[47- 5].value ^ state_p[47- 9].value ^
state_p[47-10].value ^ state_p[47-12].value ^ state_p[47-14].value ^
state_p[47-15].value ^ state_p[47-17].value ^ state_p[47-19].value ^
state_p[47-24].value ^ state_p[47-25].value ^ state_p[47-27].value ^
state_p[47-29].value ^ state_p[47-35].value ^ state_p[47-39].value ^
state_p[47-41].value ^ state_p[47-42].value ^ state_p[47-43].value);
}
// remember feedback and keystream vectors for later use
uint8_t bit = KEYSTREAM_SIZE - ks_idx;
if (bit <= next_common_bits) { // if needed and not yet stored
fbb[bit] = fb_bits;
ksb[bit] = ks_bits;
par[bit] = parity_bit_vector;
}
}
// prepare for next nonce. Revert to initial state
state_p = &states[KEYSTREAM_SIZE];
}
// all nonce tests were successful: we've found a possible key in this block!
uint32_t *p_even_test = p_even;
for (uint32_t results_word = 0; results_word < MAX_BITSLICES / 64; ++results_word) {
uint64_t results64 = results.bytes64[results_word];
for (uint32_t results_bit = 0; results_bit < 64; results_bit++) {
if (results64 & 0x01) {
if (verify_key(cuid, nonces, best_first_bytes, *p_odd, *p_even_test)) {
struct Crypto1State pcs;
pcs.odd = *p_odd;
pcs.even = *p_even_test;
lfsr_rollback_byte(&pcs, (cuid >> 24) ^ best_first_bytes[0], true);
crypto1_get_lfsr(&pcs, &key);
bucket_states_tested += 64 * results_word + results_bit;
goto out;
}
#ifdef DEBUG_KEY_ELIMINATION
if (known_target_key != -1 && *p_even_test == test_state[EVEN_STATE] && *p_odd == test_state[ODD_STATE]) {
printf("Known target key eliminated in brute_force verification.\n");
printf("block_idx = %d/%d\n", block_idx, bitsliced_blocks);
}
#endif
}
#ifdef DEBUG_KEY_ELIMINATION
if (known_target_key != -1 && *p_even_test == test_state[EVEN_STATE] && *p_odd == test_state[ODD_STATE]) {
printf("Known target key eliminated in brute_force (results_bit == 0).\n");
printf("block_idx = %d/%d\n", block_idx, bitsliced_blocks);
}
#endif
results64 >>= 1;
p_even_test++;
if (p_even_test == p_even_end) {
goto stop_tests;
}
}
}
stop_tests:
#if defined (DEBUG_BRUTE_FORCE)
elimination_step = 0;
#endif
bucket_states_tested += bucket_size[block_idx];
// prepare to set new states
state_p = &states[KEYSTREAM_SIZE];
continue;
}
}
out:
for(uint32_t block_idx = 0; block_idx < bitsliced_blocks; ++block_idx){
free_bitslice(bitsliced_even_states[block_idx]);
}
free(bitsliced_even_states);
free_bitslice(bitsliced_even_feedback);
__sync_fetch_and_add(num_keys_tested, bucket_states_tested);
#if defined (DEBUG_BRUTE_FORCE)
for (uint32_t i = 0; i < MAX_ELIMINATION_STEP; i++) {
printf("Eliminated after %2u test_bytes: %5.2f%%\n", i+1, (float)keys_eliminated[i] / bucket_states_tested * 100);
}
#endif
return key;
}
#ifndef __MMX__
// pointers to functions:
crack_states_bitsliced_t *crack_states_bitsliced_function_p = &crack_states_bitsliced_dispatch;
bitslice_test_nonces_t *bitslice_test_nonces_function_p = &bitslice_test_nonces_dispatch;
// determine the available instruction set at runtime and call the correct function
const uint64_t crack_states_bitsliced_dispatch(uint32_t cuid, uint8_t *best_first_bytes, statelist_t *p, uint32_t *keys_found, uint64_t *num_keys_tested, uint32_t nonces_to_bruteforce, uint8_t *bf_test_nonce_2nd_byte, noncelist_t *nonces) {
#if defined (__i386__) || defined (__x86_64__)
#if !defined(__APPLE__) || (defined(__APPLE__) && (__clang_major__ > 8))
#if (__GNUC__ >= 5) && (__GNUC__ > 5 || __GNUC_MINOR__ > 2)
if (__builtin_cpu_supports("avx512f")) crack_states_bitsliced_function_p = &crack_states_bitsliced_AVX512;
else if (__builtin_cpu_supports("avx2")) crack_states_bitsliced_function_p = &crack_states_bitsliced_AVX2;
#else
if (__builtin_cpu_supports("avx2")) crack_states_bitsliced_function_p = &crack_states_bitsliced_AVX2;
#endif
else if (__builtin_cpu_supports("avx")) crack_states_bitsliced_function_p = &crack_states_bitsliced_AVX;
else if (__builtin_cpu_supports("sse2")) crack_states_bitsliced_function_p = &crack_states_bitsliced_SSE2;
else if (__builtin_cpu_supports("mmx")) crack_states_bitsliced_function_p = &crack_states_bitsliced_MMX;
else
#endif
#endif
crack_states_bitsliced_function_p = &crack_states_bitsliced_NOSIMD;
// call the most optimized function for this CPU
return (*crack_states_bitsliced_function_p)(cuid, best_first_bytes, p, keys_found, num_keys_tested, nonces_to_bruteforce, bf_test_nonce_2nd_byte, nonces);
}
void bitslice_test_nonces_dispatch(uint32_t nonces_to_bruteforce, uint32_t *bf_test_nonce, uint8_t *bf_test_nonce_par) {
#if defined (__i386__) || defined (__x86_64__)
#if !defined(__APPLE__) || (defined(__APPLE__) && (__clang_major__ > 8))
#if (__GNUC__ >= 5) && (__GNUC__ > 5 || __GNUC_MINOR__ > 2)
if (__builtin_cpu_supports("avx512f")) bitslice_test_nonces_function_p = &bitslice_test_nonces_AVX512;
else if (__builtin_cpu_supports("avx2")) bitslice_test_nonces_function_p = &bitslice_test_nonces_AVX2;
#else
if (__builtin_cpu_supports("avx2")) bitslice_test_nonces_function_p = &bitslice_test_nonces_AVX2;
#endif
else if (__builtin_cpu_supports("avx")) bitslice_test_nonces_function_p = &bitslice_test_nonces_AVX;
else if (__builtin_cpu_supports("sse2")) bitslice_test_nonces_function_p = &bitslice_test_nonces_SSE2;
else if (__builtin_cpu_supports("mmx")) bitslice_test_nonces_function_p = &bitslice_test_nonces_MMX;
else
#endif
#endif
bitslice_test_nonces_function_p = &bitslice_test_nonces_NOSIMD;
// call the most optimized function for this CPU
(*bitslice_test_nonces_function_p)(nonces_to_bruteforce, bf_test_nonce, bf_test_nonce_par);
}
// Entries to dispatched function calls
const uint64_t crack_states_bitsliced(uint32_t cuid, uint8_t *best_first_bytes, statelist_t *p, uint32_t *keys_found, uint64_t *num_keys_tested, uint32_t nonces_to_bruteforce, uint8_t *bf_test_nonce_2nd_byte, noncelist_t *nonces) {
return (*crack_states_bitsliced_function_p)(cuid, best_first_bytes, p, keys_found, num_keys_tested, nonces_to_bruteforce, bf_test_nonce_2nd_byte, nonces);
}
void bitslice_test_nonces(uint32_t nonces_to_bruteforce, uint32_t *bf_test_nonce, uint8_t *bf_test_nonce_par) {
(*bitslice_test_nonces_function_p)(nonces_to_bruteforce, bf_test_nonce, bf_test_nonce_par);
}
#endif

58
client/hardnested/hardnested_bf_core.h Normal file
View file

@ -0,0 +1,58 @@
//-----------------------------------------------------------------------------
// Copyright (C) 2016, 2017 by piwi
//
// This code is licensed to you under the terms of the GNU GPL, version 2 or,
// at your option, any later version. See the LICENSE.txt file for the text of
// the license.
//-----------------------------------------------------------------------------
// Implements a card only attack based on crypto text (encrypted nonces
// received during a nested authentication) only. Unlike other card only
// attacks this doesn't rely on implementation errors but only on the
// inherent weaknesses of the crypto1 cypher. Described in
// Carlo Meijer, Roel Verdult, "Ciphertext-only Cryptanalysis on Hardened
// Mifare Classic Cards" in Proceedings of the 22nd ACM SIGSAC Conference on
// Computer and Communications Security, 2015
//-----------------------------------------------------------------------------
//
// brute forcing is based on @aczids bitsliced brute forcer
// https://github.com/aczid/crypto1_bs with some modifications. Mainly:
// - don't rollback. Start with 2nd byte of nonce instead
// - reuse results of filter subfunctions
// - reuse results of previous nonces if some first bits are identical
//
//-----------------------------------------------------------------------------
// aczid's Copyright notice:
//
// Bit-sliced Crypto-1 brute-forcing implementation
// Builds on the data structures returned by CraptEV1 craptev1_get_space(nonces, threshold, uid)
/*
Copyright (c) 2015-2016 Aram Verstegen
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#ifndef HARDNESTED_BF_CORE_H__
#define HARDNESTED_BF_CORE_H__
#include "hardnested_bruteforce.h" // statelist_t
extern const uint64_t crack_states_bitsliced(uint32_t cuid, uint8_t *best_first_bytes, statelist_t *p, uint32_t *keys_found, uint64_t *num_keys_tested, uint32_t nonces_to_bruteforce, uint8_t *bf_test_nonces_2nd_byte, noncelist_t *nonces);
extern void bitslice_test_nonces(uint32_t nonces_to_bruteforce, uint32_t *bf_test_nonces, uint8_t *bf_test_nonce_par);
#endif

650
client/hardnested/hardnested_bitarray_core.c Normal file
View file

@ -0,0 +1,650 @@
//-----------------------------------------------------------------------------
// Copyright (C) 2016, 2017 by piwi
//
// This code is licensed to you under the terms of the GNU GPL, version 2 or,
// at your option, any later version. See the LICENSE.txt file for the text of
// the license.ch b
//-----------------------------------------------------------------------------
// Implements a card only attack based on crypto text (encrypted nonces
// received during a nested authentication) only. Unlike other card only
// attacks this doesn't rely on implementation errors but only on the
// inherent weaknesses of the crypto1 cypher. Described in
// Carlo Meijer, Roel Verdult, "Ciphertext-only Cryptanalysis on Hardened
// Mifare Classic Cards" in Proceedings of the 22nd ACM SIGSAC Conference on
// Computer and Communications Security, 2015
//-----------------------------------------------------------------------------
// some helper functions which can benefit from SIMD instructions or other special instructions
//
#include "hardnested_bitarray_core.h"
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#ifndef __APPLE__
#include <malloc.h>
#endif
// this needs to be compiled several times for each instruction set.
// For each instruction set, define a dedicated function name:
#if defined (__AVX512F__)
#define MALLOC_BITARRAY malloc_bitarray_AVX512
#define FREE_BITARRAY free_bitarray_AVX512
#define BITCOUNT bitcount_AVX512
#define COUNT_STATES count_states_AVX512
#define BITARRAY_AND bitarray_AND_AVX512
#define BITARRAY_LOW20_AND bitarray_low20_AND_AVX512
#define COUNT_BITARRAY_AND count_bitarray_AND_AVX512
#define COUNT_BITARRAY_LOW20_AND count_bitarray_low20_AND_AVX512
#define BITARRAY_AND4 bitarray_AND4_AVX512
#define BITARRAY_OR bitarray_OR_AVX512
#define COUNT_BITARRAY_AND2 count_bitarray_AND2_AVX512
#define COUNT_BITARRAY_AND3 count_bitarray_AND3_AVX512
#define COUNT_BITARRAY_AND4 count_bitarray_AND4_AVX512
#elif defined (__AVX2__)
#define MALLOC_BITARRAY malloc_bitarray_AVX2
#define FREE_BITARRAY free_bitarray_AVX2
#define BITCOUNT bitcount_AVX2
#define COUNT_STATES count_states_AVX2
#define BITARRAY_AND bitarray_AND_AVX2
#define BITARRAY_LOW20_AND bitarray_low20_AND_AVX2
#define COUNT_BITARRAY_AND count_bitarray_AND_AVX2
#define COUNT_BITARRAY_LOW20_AND count_bitarray_low20_AND_AVX2
#define BITARRAY_AND4 bitarray_AND4_AVX2
#define BITARRAY_OR bitarray_OR_AVX2
#define COUNT_BITARRAY_AND2 count_bitarray_AND2_AVX2
#define COUNT_BITARRAY_AND3 count_bitarray_AND3_AVX2
#define COUNT_BITARRAY_AND4 count_bitarray_AND4_AVX2
#elif defined (__AVX__)
#define MALLOC_BITARRAY malloc_bitarray_AVX
#define FREE_BITARRAY free_bitarray_AVX
#define BITCOUNT bitcount_AVX
#define COUNT_STATES count_states_AVX
#define BITARRAY_AND bitarray_AND_AVX
#define BITARRAY_LOW20_AND bitarray_low20_AND_AVX
#define COUNT_BITARRAY_AND count_bitarray_AND_AVX
#define COUNT_BITARRAY_LOW20_AND count_bitarray_low20_AND_AVX
#define BITARRAY_AND4 bitarray_AND4_AVX
#define BITARRAY_OR bitarray_OR_AVX
#define COUNT_BITARRAY_AND2 count_bitarray_AND2_AVX
#define COUNT_BITARRAY_AND3 count_bitarray_AND3_AVX
#define COUNT_BITARRAY_AND4 count_bitarray_AND4_AVX
#elif defined (__SSE2__)
#define MALLOC_BITARRAY malloc_bitarray_SSE2
#define FREE_BITARRAY free_bitarray_SSE2
#define BITCOUNT bitcount_SSE2
#define COUNT_STATES count_states_SSE2
#define BITARRAY_AND bitarray_AND_SSE2
#define BITARRAY_LOW20_AND bitarray_low20_AND_SSE2
#define COUNT_BITARRAY_AND count_bitarray_AND_SSE2
#define COUNT_BITARRAY_LOW20_AND count_bitarray_low20_AND_SSE2
#define BITARRAY_AND4 bitarray_AND4_SSE2
#define BITARRAY_OR bitarray_OR_SSE2
#define COUNT_BITARRAY_AND2 count_bitarray_AND2_SSE2
#define COUNT_BITARRAY_AND3 count_bitarray_AND3_SSE2
#define COUNT_BITARRAY_AND4 count_bitarray_AND4_SSE2
#elif defined (__MMX__)
#define MALLOC_BITARRAY malloc_bitarray_MMX
#define FREE_BITARRAY free_bitarray_MMX
#define BITCOUNT bitcount_MMX
#define COUNT_STATES count_states_MMX
#define BITARRAY_AND bitarray_AND_MMX
#define BITARRAY_LOW20_AND bitarray_low20_AND_MMX
#define COUNT_BITARRAY_AND count_bitarray_AND_MMX
#define COUNT_BITARRAY_LOW20_AND count_bitarray_low20_AND_MMX
#define BITARRAY_AND4 bitarray_AND4_MMX
#define BITARRAY_OR bitarray_OR_MMX
#define COUNT_BITARRAY_AND2 count_bitarray_AND2_MMX
#define COUNT_BITARRAY_AND3 count_bitarray_AND3_MMX
#define COUNT_BITARRAY_AND4 count_bitarray_AND4_MMX
#else
#define MALLOC_BITARRAY malloc_bitarray_NOSIMD
#define FREE_BITARRAY free_bitarray_NOSIMD
#define BITCOUNT bitcount_NOSIMD
#define COUNT_STATES count_states_NOSIMD
#define BITARRAY_AND bitarray_AND_NOSIMD
#define BITARRAY_LOW20_AND bitarray_low20_AND_NOSIMD
#define COUNT_BITARRAY_AND count_bitarray_AND_NOSIMD
#define COUNT_BITARRAY_LOW20_AND count_bitarray_low20_AND_NOSIMD
#define BITARRAY_AND4 bitarray_AND4_NOSIMD
#define BITARRAY_OR bitarray_OR_NOSIMD
#define COUNT_BITARRAY_AND2 count_bitarray_AND2_NOSIMD
#define COUNT_BITARRAY_AND3 count_bitarray_AND3_NOSIMD
#define COUNT_BITARRAY_AND4 count_bitarray_AND4_NOSIMD
#endif
// typedefs and declaration of functions:
typedef uint32_t* malloc_bitarray_t(uint32_t);
malloc_bitarray_t malloc_bitarray_AVX512, malloc_bitarray_AVX2, malloc_bitarray_AVX, malloc_bitarray_SSE2, malloc_bitarray_MMX, malloc_bitarray_NOSIMD, malloc_bitarray_dispatch;
typedef void free_bitarray_t(uint32_t*);
free_bitarray_t free_bitarray_AVX512, free_bitarray_AVX2, free_bitarray_AVX, free_bitarray_SSE2, free_bitarray_MMX, free_bitarray_NOSIMD, free_bitarray_dispatch;
typedef uint32_t bitcount_t(uint32_t);
bitcount_t bitcount_AVX512, bitcount_AVX2, bitcount_AVX, bitcount_SSE2, bitcount_MMX, bitcount_NOSIMD, bitcount_dispatch;
typedef uint32_t count_states_t(uint32_t*);
count_states_t count_states_AVX512, count_states_AVX2, count_states_AVX, count_states_SSE2, count_states_MMX, count_states_NOSIMD, count_states_dispatch;
typedef void bitarray_AND_t(uint32_t[], uint32_t[]);
bitarray_AND_t bitarray_AND_AVX512, bitarray_AND_AVX2, bitarray_AND_AVX, bitarray_AND_SSE2, bitarray_AND_MMX, bitarray_AND_NOSIMD, bitarray_AND_dispatch;
typedef void bitarray_low20_AND_t(uint32_t*, uint32_t*);
bitarray_low20_AND_t bitarray_low20_AND_AVX512, bitarray_low20_AND_AVX2, bitarray_low20_AND_AVX, bitarray_low20_AND_SSE2, bitarray_low20_AND_MMX, bitarray_low20_AND_NOSIMD, bitarray_low20_AND_dispatch;
typedef uint32_t count_bitarray_AND_t(uint32_t*, uint32_t*);
count_bitarray_AND_t count_bitarray_AND_AVX512, count_bitarray_AND_AVX2, count_bitarray_AND_AVX, count_bitarray_AND_SSE2, count_bitarray_AND_MMX, count_bitarray_AND_NOSIMD, count_bitarray_AND_dispatch;
typedef uint32_t count_bitarray_low20_AND_t(uint32_t*, uint32_t*);
count_bitarray_low20_AND_t count_bitarray_low20_AND_AVX512, count_bitarray_low20_AND_AVX2, count_bitarray_low20_AND_AVX, count_bitarray_low20_AND_SSE2, count_bitarray_low20_AND_MMX, count_bitarray_low20_AND_NOSIMD, count_bitarray_low20_AND_dispatch;
typedef void bitarray_AND4_t(uint32_t*, uint32_t*, uint32_t*, uint32_t*);
bitarray_AND4_t bitarray_AND4_AVX512, bitarray_AND4_AVX2, bitarray_AND4_AVX, bitarray_AND4_SSE2, bitarray_AND4_MMX, bitarray_AND4_NOSIMD, bitarray_AND4_dispatch;
typedef void bitarray_OR_t(uint32_t[], uint32_t[]);
bitarray_OR_t bitarray_OR_AVX512, bitarray_OR_AVX2, bitarray_OR_AVX, bitarray_OR_SSE2, bitarray_OR_MMX, bitarray_OR_NOSIMD, bitarray_OR_dispatch;
typedef uint32_t count_bitarray_AND2_t(uint32_t*, uint32_t*);
count_bitarray_AND2_t count_bitarray_AND2_AVX512, count_bitarray_AND2_AVX2, count_bitarray_AND2_AVX, count_bitarray_AND2_SSE2, count_bitarray_AND2_MMX, count_bitarray_AND2_NOSIMD, count_bitarray_AND2_dispatch;
typedef uint32_t count_bitarray_AND3_t(uint32_t*, uint32_t*, uint32_t*);
count_bitarray_AND3_t count_bitarray_AND3_AVX512, count_bitarray_AND3_AVX2, count_bitarray_AND3_AVX, count_bitarray_AND3_SSE2, count_bitarray_AND3_MMX, count_bitarray_AND3_NOSIMD, count_bitarray_AND3_dispatch;
typedef uint32_t count_bitarray_AND4_t(uint32_t*, uint32_t*, uint32_t*, uint32_t*);
count_bitarray_AND4_t count_bitarray_AND4_AVX512, count_bitarray_AND4_AVX2, count_bitarray_AND4_AVX, count_bitarray_AND4_SSE2, count_bitarray_AND4_MMX, count_bitarray_AND4_NOSIMD, count_bitarray_AND4_dispatch;
inline uint32_t *MALLOC_BITARRAY(uint32_t x)
{
#if defined (_WIN32)
return __builtin_assume_aligned(_aligned_malloc((x), __BIGGEST_ALIGNMENT__), __BIGGEST_ALIGNMENT__);
#elif defined (__APPLE__)
uint32_t *allocated_memory;
if (posix_memalign((void**)&allocated_memory, __BIGGEST_ALIGNMENT__, x)) {
return NULL;
} else {
return __builtin_assume_aligned(allocated_memory, __BIGGEST_ALIGNMENT__);
}
#else
return __builtin_assume_aligned(memalign(__BIGGEST_ALIGNMENT__, (x)), __BIGGEST_ALIGNMENT__);
#endif
}
inline void FREE_BITARRAY(uint32_t *x)
{
#ifdef _WIN32
_aligned_free(x);
#else
free(x);
#endif
}
inline uint32_t BITCOUNT(uint32_t a)
{
return __builtin_popcountl(a);
}
inline uint32_t COUNT_STATES(uint32_t *A)
{
uint32_t count = 0;
for (uint32_t i = 0; i < (1<<19); i++) {
count += BITCOUNT(A[i]);
}
return count;
}
inline void BITARRAY_AND(uint32_t *restrict A, uint32_t *restrict B)
{
A = __builtin_assume_aligned(A, __BIGGEST_ALIGNMENT__);
B = __builtin_assume_aligned(B, __BIGGEST_ALIGNMENT__);
for (uint32_t i = 0; i < (1<<19); i++) {
A[i] &= B[i];
}
}
inline void BITARRAY_LOW20_AND(uint32_t *restrict A, uint32_t *restrict B)
{
uint16_t *a = (uint16_t *)__builtin_assume_aligned(A, __BIGGEST_ALIGNMENT__);
uint16_t *b = (uint16_t *)__builtin_assume_aligned(B, __BIGGEST_ALIGNMENT__);
for (uint32_t i = 0; i < (1<<20); i++) {
if (!b[i]) {
a[i] = 0;
}
}
}
inline uint32_t COUNT_BITARRAY_AND(uint32_t *restrict A, uint32_t *restrict B)
{
A = __builtin_assume_aligned(A, __BIGGEST_ALIGNMENT__);
B = __builtin_assume_aligned(B, __BIGGEST_ALIGNMENT__);
uint32_t count = 0;
for (uint32_t i = 0; i < (1<<19); i++) {
A[i] &= B[i];
count += BITCOUNT(A[i]);
}
return count;
}
inline uint32_t COUNT_BITARRAY_LOW20_AND(uint32_t *restrict A, uint32_t *restrict B)
{
uint16_t *a = (uint16_t *)__builtin_assume_aligned(A, __BIGGEST_ALIGNMENT__);
uint16_t *b = (uint16_t *)__builtin_assume_aligned(B, __BIGGEST_ALIGNMENT__);
uint32_t count = 0;
for (uint32_t i = 0; i < (1<<20); i++) {
if (!b[i]) {
a[i] = 0;
}
count += BITCOUNT(a[i]);
}
return count;
}
inline void BITARRAY_AND4(uint32_t *restrict A, uint32_t *restrict B, uint32_t *restrict C, uint32_t *restrict D)
{
A = __builtin_assume_aligned(A, __BIGGEST_ALIGNMENT__);
B = __builtin_assume_aligned(B, __BIGGEST_ALIGNMENT__);
C = __builtin_assume_aligned(C, __BIGGEST_ALIGNMENT__);
D = __builtin_assume_aligned(D, __BIGGEST_ALIGNMENT__);
for (uint32_t i = 0; i < (1<<19); i++) {
A[i] = B[i] & C[i] & D[i];
}
}
inline void BITARRAY_OR(uint32_t *restrict A, uint32_t *restrict B)
{
A = __builtin_assume_aligned(A, __BIGGEST_ALIGNMENT__);
B = __builtin_assume_aligned(B, __BIGGEST_ALIGNMENT__);
for (uint32_t i = 0; i < (1<<19); i++) {
A[i] |= B[i];
}
}
inline uint32_t COUNT_BITARRAY_AND2(uint32_t *restrict A, uint32_t *restrict B)
{
A = __builtin_assume_aligned(A, __BIGGEST_ALIGNMENT__);
B = __builtin_assume_aligned(B, __BIGGEST_ALIGNMENT__);
uint32_t count = 0;
for (uint32_t i = 0; i < (1<<19); i++) {
count += BITCOUNT(A[i] & B[i]);
}
return count;
}
inline uint32_t COUNT_BITARRAY_AND3(uint32_t *restrict A, uint32_t *restrict B, uint32_t *restrict C)
{
A = __builtin_assume_aligned(A, __BIGGEST_ALIGNMENT__);
B = __builtin_assume_aligned(B, __BIGGEST_ALIGNMENT__);
C = __builtin_assume_aligned(C, __BIGGEST_ALIGNMENT__);
uint32_t count = 0;
for (uint32_t i = 0; i < (1<<19); i++) {
count += BITCOUNT(A[i] & B[i] & C[i]);
}
return count;
}
inline uint32_t COUNT_BITARRAY_AND4(uint32_t *restrict A, uint32_t *restrict B, uint32_t *restrict C, uint32_t *restrict D)
{
A = __builtin_assume_aligned(A, __BIGGEST_ALIGNMENT__);
B = __builtin_assume_aligned(B, __BIGGEST_ALIGNMENT__);
C = __builtin_assume_aligned(C, __BIGGEST_ALIGNMENT__);
D = __builtin_assume_aligned(D, __BIGGEST_ALIGNMENT__);
uint32_t count = 0;
for (uint32_t i = 0; i < (1<<19); i++) {
count += BITCOUNT(A[i] & B[i] & C[i] & D[i]);
}
return count;
}
#ifndef __MMX__
// pointers to functions:
malloc_bitarray_t *malloc_bitarray_function_p = &malloc_bitarray_dispatch;
free_bitarray_t *free_bitarray_function_p = &free_bitarray_dispatch;
bitcount_t *bitcount_function_p = &bitcount_dispatch;
count_states_t *count_states_function_p = &count_states_dispatch;
bitarray_AND_t *bitarray_AND_function_p = &bitarray_AND_dispatch;
bitarray_low20_AND_t *bitarray_low20_AND_function_p = &bitarray_low20_AND_dispatch;
count_bitarray_AND_t *count_bitarray_AND_function_p = &count_bitarray_AND_dispatch;
count_bitarray_low20_AND_t *count_bitarray_low20_AND_function_p = &count_bitarray_low20_AND_dispatch;
bitarray_AND4_t *bitarray_AND4_function_p = &bitarray_AND4_dispatch;
bitarray_OR_t *bitarray_OR_function_p = &bitarray_OR_dispatch;
count_bitarray_AND2_t *count_bitarray_AND2_function_p = &count_bitarray_AND2_dispatch;
count_bitarray_AND3_t *count_bitarray_AND3_function_p = &count_bitarray_AND3_dispatch;
count_bitarray_AND4_t *count_bitarray_AND4_function_p = &count_bitarray_AND4_dispatch;
// determine the available instruction set at runtime and call the correct function
uint32_t *malloc_bitarray_dispatch(uint32_t x) {
#if defined (__i386__) || defined (__x86_64__)
#if !defined(__APPLE__) || (defined(__APPLE__) && (__clang_major__ > 8))
#if (__GNUC__ >= 5) && (__GNUC__ > 5 || __GNUC_MINOR__ > 2)
if (__builtin_cpu_supports("avx512f")) malloc_bitarray_function_p = &malloc_bitarray_AVX512;
else if (__builtin_cpu_supports("avx2")) malloc_bitarray_function_p = &malloc_bitarray_AVX2;
#else
if (__builtin_cpu_supports("avx2")) malloc_bitarray_function_p = &malloc_bitarray_AVX2;
#endif
else if (__builtin_cpu_supports("avx")) malloc_bitarray_function_p = &malloc_bitarray_AVX;
else if (__builtin_cpu_supports("sse2")) malloc_bitarray_function_p = &malloc_bitarray_SSE2;
else if (__builtin_cpu_supports("mmx")) malloc_bitarray_function_p = &malloc_bitarray_MMX;
else
#endif
#endif
malloc_bitarray_function_p = &malloc_bitarray_NOSIMD;
// call the most optimized function for this CPU
return (*malloc_bitarray_function_p)(x);
}
void free_bitarray_dispatch(uint32_t *x) {
#if defined (__i386__) || defined (__x86_64__)
#if !defined(__APPLE__) || (defined(__APPLE__) && (__clang_major__ > 8))
#if (__GNUC__ >= 5) && (__GNUC__ > 5 || __GNUC_MINOR__ > 2)
if (__builtin_cpu_supports("avx512f")) free_bitarray_function_p = &free_bitarray_AVX512;
else if (__builtin_cpu_supports("avx2")) free_bitarray_function_p = &free_bitarray_AVX2;
#else
if (__builtin_cpu_supports("avx2")) free_bitarray_function_p = &free_bitarray_AVX2;
#endif
else if (__builtin_cpu_supports("avx")) free_bitarray_function_p = &free_bitarray_AVX;
else if (__builtin_cpu_supports("sse2")) free_bitarray_function_p = &free_bitarray_SSE2;
else if (__builtin_cpu_supports("mmx")) free_bitarray_function_p = &free_bitarray_MMX;
else
#endif
#endif
free_bitarray_function_p = &free_bitarray_NOSIMD;
// call the most optimized function for this CPU
(*free_bitarray_function_p)(x);
}
uint32_t bitcount_dispatch(uint32_t a) {
#if defined (__i386__) || defined (__x86_64__)
#if !defined(__APPLE__) || (defined(__APPLE__) && (__clang_major__ > 8))
#if (__GNUC__ >= 5) && (__GNUC__ > 5 || __GNUC_MINOR__ > 2)
if (__builtin_cpu_supports("avx512f")) bitcount_function_p = &bitcount_AVX512;
else if (__builtin_cpu_supports("avx2")) bitcount_function_p = &bitcount_AVX2;
#else
if (__builtin_cpu_supports("avx2")) bitcount_function_p = &bitcount_AVX2;
#endif
else if (__builtin_cpu_supports("avx")) bitcount_function_p = &bitcount_AVX;
else if (__builtin_cpu_supports("sse2")) bitcount_function_p = &bitcount_SSE2;
else if (__builtin_cpu_supports("mmx")) bitcount_function_p = &bitcount_MMX;
else
#endif
#endif
bitcount_function_p = &bitcount_NOSIMD;
// call the most optimized function for this CPU
return (*bitcount_function_p)(a);
}
uint32_t count_states_dispatch(uint32_t *bitarray) {
#if defined (__i386__) || defined (__x86_64__)
#if !defined(__APPLE__) || (defined(__APPLE__) && (__clang_major__ > 8))
#if (__GNUC__ >= 5) && (__GNUC__ > 5 || __GNUC_MINOR__ > 2)
if (__builtin_cpu_supports("avx512f")) count_states_function_p = &count_states_AVX512;
else if (__builtin_cpu_supports("avx2")) count_states_function_p = &count_states_AVX2;
#else
if (__builtin_cpu_supports("avx2")) count_states_function_p = &count_states_AVX2;
#endif
else if (__builtin_cpu_supports("avx")) count_states_function_p = &count_states_AVX;
else if (__builtin_cpu_supports("sse2")) count_states_function_p = &count_states_SSE2;
else if (__builtin_cpu_supports("mmx")) count_states_function_p = &count_states_MMX;
else
#endif
#endif
count_states_function_p = &count_states_NOSIMD;
// call the most optimized function for this CPU
return (*count_states_function_p)(bitarray);
}
void bitarray_AND_dispatch(uint32_t *A, uint32_t *B) {
#if defined (__i386__) || defined (__x86_64__)
#if !defined(__APPLE__) || (defined(__APPLE__) && (__clang_major__ > 8))
#if (__GNUC__ >= 5) && (__GNUC__ > 5 || __GNUC_MINOR__ > 2)
if (__builtin_cpu_supports("avx512f")) bitarray_AND_function_p = &bitarray_AND_AVX512;
else if (__builtin_cpu_supports("avx2")) bitarray_AND_function_p = &bitarray_AND_AVX2;
#else
if (__builtin_cpu_supports("avx2")) bitarray_AND_function_p = &bitarray_AND_AVX2;
#endif
else if (__builtin_cpu_supports("avx")) bitarray_AND_function_p = &bitarray_AND_AVX;
else if (__builtin_cpu_supports("sse2")) bitarray_AND_function_p = &bitarray_AND_SSE2;
else if (__builtin_cpu_supports("mmx")) bitarray_AND_function_p = &bitarray_AND_MMX;
else
#endif
#endif
bitarray_AND_function_p = &bitarray_AND_NOSIMD;
// call the most optimized function for this CPU
(*bitarray_AND_function_p)(A,B);
}
void bitarray_low20_AND_dispatch(uint32_t *A, uint32_t *B) {
#if defined (__i386__) || defined (__x86_64__)
#if !defined(__APPLE__) || (defined(__APPLE__) && (__clang_major__ > 8))
#if (__GNUC__ >= 5) && (__GNUC__ > 5 || __GNUC_MINOR__ > 2)
if (__builtin_cpu_supports("avx512f")) bitarray_low20_AND_function_p = &bitarray_low20_AND_AVX512;
else if (__builtin_cpu_supports("avx2")) bitarray_low20_AND_function_p = &bitarray_low20_AND_AVX2;
#else
if (__builtin_cpu_supports("avx2")) bitarray_low20_AND_function_p = &bitarray_low20_AND_AVX2;
#endif
else if (__builtin_cpu_supports("avx")) bitarray_low20_AND_function_p = &bitarray_low20_AND_AVX;
else if (__builtin_cpu_supports("sse2")) bitarray_low20_AND_function_p = &bitarray_low20_AND_SSE2;
else if (__builtin_cpu_supports("mmx")) bitarray_low20_AND_function_p = &bitarray_low20_AND_MMX;
else
#endif
#endif
bitarray_low20_AND_function_p = &bitarray_low20_AND_NOSIMD;
// call the most optimized function for this CPU
(*bitarray_low20_AND_function_p)(A, B);
}
uint32_t count_bitarray_AND_dispatch(uint32_t *A, uint32_t *B) {
#if defined (__i386__) || defined (__x86_64__)
#if !defined(__APPLE__) || (defined(__APPLE__) && (__clang_major__ > 8))
#if (__GNUC__ >= 5) && (__GNUC__ > 5 || __GNUC_MINOR__ > 2)
if (__builtin_cpu_supports("avx512f")) count_bitarray_AND_function_p = &count_bitarray_AND_AVX512;
else if (__builtin_cpu_supports("avx2")) count_bitarray_AND_function_p = &count_bitarray_AND_AVX2;
#else
if (__builtin_cpu_supports("avx2")) count_bitarray_AND_function_p = &count_bitarray_AND_AVX2;
#endif
else if (__builtin_cpu_supports("avx")) count_bitarray_AND_function_p = &count_bitarray_AND_AVX;
else if (__builtin_cpu_supports("sse2")) count_bitarray_AND_function_p = &count_bitarray_AND_SSE2;
else if (__builtin_cpu_supports("mmx")) count_bitarray_AND_function_p = &count_bitarray_AND_MMX;
else
#endif
#endif
count_bitarray_AND_function_p = &count_bitarray_AND_NOSIMD;
// call the most optimized function for this CPU
return (*count_bitarray_AND_function_p)(A, B);
}
uint32_t count_bitarray_low20_AND_dispatch(uint32_t *A, uint32_t *B) {
#if defined (__i386__) || defined (__x86_64__)
#if !defined(__APPLE__) || (defined(__APPLE__) && (__clang_major__ > 8))
#if (__GNUC__ >= 5) && (__GNUC__ > 5 || __GNUC_MINOR__ > 2)
if (__builtin_cpu_supports("avx512f")) count_bitarray_low20_AND_function_p = &count_bitarray_low20_AND_AVX512;
else if (__builtin_cpu_supports("avx2")) count_bitarray_low20_AND_function_p = &count_bitarray_low20_AND_AVX2;
#else
if (__builtin_cpu_supports("avx2")) count_bitarray_low20_AND_function_p = &count_bitarray_low20_AND_AVX2;
#endif
else if (__builtin_cpu_supports("avx")) count_bitarray_low20_AND_function_p = &count_bitarray_low20_AND_AVX;
else if (__builtin_cpu_supports("sse2")) count_bitarray_low20_AND_function_p = &count_bitarray_low20_AND_SSE2;
else if (__builtin_cpu_supports("mmx")) count_bitarray_low20_AND_function_p = &count_bitarray_low20_AND_MMX;
else
#endif
#endif
count_bitarray_low20_AND_function_p = &count_bitarray_low20_AND_NOSIMD;
// call the most optimized function for this CPU
return (*count_bitarray_low20_AND_function_p)(A, B);
}
void bitarray_AND4_dispatch(uint32_t *A, uint32_t *B, uint32_t *C, uint32_t *D) {
#if defined (__i386__) || defined (__x86_64__)
#if !defined(__APPLE__) || (defined(__APPLE__) && (__clang_major__ > 8))
#if (__GNUC__ >= 5) && (__GNUC__ > 5 || __GNUC_MINOR__ > 2)
if (__builtin_cpu_supports("avx512f")) bitarray_AND4_function_p = &bitarray_AND4_AVX512;
else if (__builtin_cpu_supports("avx2")) bitarray_AND4_function_p = &bitarray_AND4_AVX2;
#else
if (__builtin_cpu_supports("avx2")) bitarray_AND4_function_p = &bitarray_AND4_AVX2;
#endif
else if (__builtin_cpu_supports("avx")) bitarray_AND4_function_p = &bitarray_AND4_AVX;
else if (__builtin_cpu_supports("sse2")) bitarray_AND4_function_p = &bitarray_AND4_SSE2;
else if (__builtin_cpu_supports("mmx")) bitarray_AND4_function_p = &bitarray_AND4_MMX;
else
#endif
#endif
bitarray_AND4_function_p = &bitarray_AND4_NOSIMD;
// call the most optimized function for this CPU
(*bitarray_AND4_function_p)(A, B, C, D);
}
void bitarray_OR_dispatch(uint32_t *A, uint32_t *B) {
#if defined (__i386__) || defined (__x86_64__)
#if !defined(__APPLE__) || (defined(__APPLE__) && (__clang_major__ > 8))
#if (__GNUC__ >= 5) && (__GNUC__ > 5 || __GNUC_MINOR__ > 2)
if (__builtin_cpu_supports("avx512f")) bitarray_OR_function_p = &bitarray_OR_AVX512;
else if (__builtin_cpu_supports("avx2")) bitarray_OR_function_p = &bitarray_OR_AVX2;
#else
if (__builtin_cpu_supports("avx2")) bitarray_OR_function_p = &bitarray_OR_AVX2;
#endif
else if (__builtin_cpu_supports("avx")) bitarray_OR_function_p = &bitarray_OR_AVX;
else if (__builtin_cpu_supports("sse2")) bitarray_OR_function_p = &bitarray_OR_SSE2;
else if (__builtin_cpu_supports("mmx")) bitarray_OR_function_p = &bitarray_OR_MMX;
else
#endif
#endif
bitarray_OR_function_p = &bitarray_OR_NOSIMD;
// call the most optimized function for this CPU
(*bitarray_OR_function_p)(A,B);
}
uint32_t count_bitarray_AND2_dispatch(uint32_t *A, uint32_t *B) {
#if defined (__i386__) || defined (__x86_64__)
#if !defined(__APPLE__) || (defined(__APPLE__) && (__clang_major__ > 8))
#if (__GNUC__ >= 5) && (__GNUC__ > 5 || __GNUC_MINOR__ > 2)
if (__builtin_cpu_supports("avx512f")) count_bitarray_AND2_function_p = &count_bitarray_AND2_AVX512;
else if (__builtin_cpu_supports("avx2")) count_bitarray_AND2_function_p = &count_bitarray_AND2_AVX2;
#else
if (__builtin_cpu_supports("avx2")) count_bitarray_AND2_function_p = &count_bitarray_AND2_AVX2;
#endif
else if (__builtin_cpu_supports("avx")) count_bitarray_AND2_function_p = &count_bitarray_AND2_AVX;
else if (__builtin_cpu_supports("sse2")) count_bitarray_AND2_function_p = &count_bitarray_AND2_SSE2;
else if (__builtin_cpu_supports("mmx")) count_bitarray_AND2_function_p = &count_bitarray_AND2_MMX;
else
#endif
#endif
count_bitarray_AND2_function_p = &count_bitarray_AND2_NOSIMD;
// call the most optimized function for this CPU
return (*count_bitarray_AND2_function_p)(A, B);
}
uint32_t count_bitarray_AND3_dispatch(uint32_t *A, uint32_t *B, uint32_t *C) {
#if defined (__i386__) || defined (__x86_64__)
#if !defined(__APPLE__) || (defined(__APPLE__) && (__clang_major__ > 8))
#if (__GNUC__ >= 5) && (__GNUC__ > 5 || __GNUC_MINOR__ > 2)
if (__builtin_cpu_supports("avx512f")) count_bitarray_AND3_function_p = &count_bitarray_AND3_AVX512;
else if (__builtin_cpu_supports("avx2")) count_bitarray_AND3_function_p = &count_bitarray_AND3_AVX2;
#else
if (__builtin_cpu_supports("avx2")) count_bitarray_AND3_function_p = &count_bitarray_AND3_AVX2;
#endif
else if (__builtin_cpu_supports("avx")) count_bitarray_AND3_function_p = &count_bitarray_AND3_AVX;
else if (__builtin_cpu_supports("sse2")) count_bitarray_AND3_function_p = &count_bitarray_AND3_SSE2;
else if (__builtin_cpu_supports("mmx")) count_bitarray_AND3_function_p = &count_bitarray_AND3_MMX;
else
#endif
#endif
count_bitarray_AND3_function_p = &count_bitarray_AND3_NOSIMD;
// call the most optimized function for this CPU
return (*count_bitarray_AND3_function_p)(A, B, C);
}
uint32_t count_bitarray_AND4_dispatch(uint32_t *A, uint32_t *B, uint32_t *C, uint32_t *D) {
#if defined (__i386__) || defined (__x86_64__)
#if !defined(__APPLE__) || (defined(__APPLE__) && (__clang_major__ > 8))
#if (__GNUC__ >= 5) && (__GNUC__ > 5 || __GNUC_MINOR__ > 2)
if (__builtin_cpu_supports("avx512f")) count_bitarray_AND4_function_p = &count_bitarray_AND4_AVX512;
else if (__builtin_cpu_supports("avx2")) count_bitarray_AND4_function_p = &count_bitarray_AND4_AVX2;
#else
if (__builtin_cpu_supports("avx2")) count_bitarray_AND4_function_p = &count_bitarray_AND4_AVX2;
#endif
else if (__builtin_cpu_supports("avx")) count_bitarray_AND4_function_p = &count_bitarray_AND4_AVX;
else if (__builtin_cpu_supports("sse2")) count_bitarray_AND4_function_p = &count_bitarray_AND4_SSE2;
else if (__builtin_cpu_supports("mmx")) count_bitarray_AND4_function_p = &count_bitarray_AND4_MMX;
else
#endif
#endif
count_bitarray_AND4_function_p = &count_bitarray_AND4_NOSIMD;
// call the most optimized function for this CPU
return (*count_bitarray_AND4_function_p)(A, B, C, D);
}
///////////////////////////////////////////////77
// Entries to dispatched function calls
uint32_t *malloc_bitarray(uint32_t x) {
return (*malloc_bitarray_function_p)(x);
}
void free_bitarray(uint32_t *x) {
(*free_bitarray_function_p)(x);
}
uint32_t bitcount(uint32_t a) {
return (*bitcount_function_p)(a);
}
uint32_t count_states(uint32_t *bitarray) {
return (*count_states_function_p)(bitarray);
}
void bitarray_AND(uint32_t *A, uint32_t *B) {
(*bitarray_AND_function_p)(A, B);
}
void bitarray_low20_AND(uint32_t *A, uint32_t *B) {
(*bitarray_low20_AND_function_p)(A, B);
}
uint32_t count_bitarray_AND(uint32_t *A, uint32_t *B) {
return (*count_bitarray_AND_function_p)(A, B);
}
uint32_t count_bitarray_low20_AND(uint32_t *A, uint32_t *B) {
return (*count_bitarray_low20_AND_function_p)(A, B);
}
void bitarray_AND4(uint32_t *A, uint32_t *B, uint32_t *C, uint32_t *D) {
(*bitarray_AND4_function_p)(A, B, C, D);
}
void bitarray_OR(uint32_t *A, uint32_t *B) {
(*bitarray_OR_function_p)(A, B);
}
uint32_t count_bitarray_AND2(uint32_t *A, uint32_t *B) {
return (*count_bitarray_AND2_function_p)(A, B);
}
uint32_t count_bitarray_AND3(uint32_t *A, uint32_t *B, uint32_t *C) {
return (*count_bitarray_AND3_function_p)(A, B, C);
}
uint32_t count_bitarray_AND4(uint32_t *A, uint32_t *B, uint32_t *C, uint32_t *D) {
return (*count_bitarray_AND4_function_p)(A, B, C, D);
}
#endif

69
client/hardnested/hardnested_bitarray_core.h Normal file
View file

@ -0,0 +1,69 @@
//-----------------------------------------------------------------------------
// Copyright (C) 2016, 2017 by piwi
//
// This code is licensed to you under the terms of the GNU GPL, version 2 or,
// at your option, any later version. See the LICENSE.txt file for the text of
// the license.
//-----------------------------------------------------------------------------
// Implements a card only attack based on crypto text (encrypted nonces
// received during a nested authentication) only. Unlike other card only
// attacks this doesn't rely on implementation errors but only on the
// inherent weaknesses of the crypto1 cypher. Described in
// Carlo Meijer, Roel Verdult, "Ciphertext-only Cryptanalysis on Hardened
// Mifare Classic Cards" in Proceedings of the 22nd ACM SIGSAC Conference on
// Computer and Communications Security, 2015
//-----------------------------------------------------------------------------
//
// brute forcing is based on @aczids bitsliced brute forcer
// https://github.com/aczid/crypto1_bs with some modifications. Mainly:
// - don't rollback. Start with 2nd byte of nonce instead
// - reuse results of filter subfunctions
// - reuse results of previous nonces if some first bits are identical
//
//-----------------------------------------------------------------------------
// aczid's Copyright notice:
//
// Bit-sliced Crypto-1 brute-forcing implementation
// Builds on the data structures returned by CraptEV1 craptev1_get_space(nonces, threshold, uid)
/*
Copyright (c) 2015-2016 Aram Verstegen
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#ifndef HARDNESTED_BITARRAY_CORE_H__
#define HARDNESTED_BITARRAY_CORE_H__
#include <stdint.h>
extern uint32_t *malloc_bitarray(uint32_t x);
extern void free_bitarray(uint32_t *x);
extern uint32_t bitcount(uint32_t a);
extern uint32_t count_states(uint32_t *A);
extern void bitarray_AND(uint32_t *A, uint32_t *B);
extern void bitarray_low20_AND(uint32_t *A, uint32_t *B);
extern uint32_t count_bitarray_AND(uint32_t *A, uint32_t *B);
extern uint32_t count_bitarray_low20_AND(uint32_t *A, uint32_t *B);
extern void bitarray_AND4(uint32_t *A, uint32_t *B, uint32_t *C, uint32_t *D);
extern void bitarray_OR(uint32_t *A, uint32_t *B);
extern uint32_t count_bitarray_AND2(uint32_t *A, uint32_t *B);
extern uint32_t count_bitarray_AND3(uint32_t *A, uint32_t *B, uint32_t *C);
extern uint32_t count_bitarray_AND4(uint32_t *A, uint32_t *B, uint32_t *C, uint32_t *D);
#endif

472
client/hardnested/hardnested_bruteforce.c Normal file
View file

@ -0,0 +1,472 @@
//-----------------------------------------------------------------------------
// Copyright (C) 2016, 2017 by piwi
//
// This code is licensed to you under the terms of the GNU GPL, version 2 or,
// at your option, any later version. See the LICENSE.txt file for the text of
// the license.
//-----------------------------------------------------------------------------
// Implements a card only attack based on crypto text (encrypted nonces
// received during a nested authentication) only. Unlike other card only
// attacks this doesn't rely on implementation errors but only on the
// inherent weaknesses of the crypto1 cypher. Described in
// Carlo Meijer, Roel Verdult, "Ciphertext-only Cryptanalysis on Hardened
// Mifare Classic Cards" in Proceedings of the 22nd ACM SIGSAC Conference on
// Computer and Communications Security, 2015
//-----------------------------------------------------------------------------
//
// brute forcing is based on @aczids bitsliced brute forcer
// https://github.com/aczid/crypto1_bs with some modifications. Mainly:
// - don't rollback. Start with 2nd byte of nonce instead
// - reuse results of filter subfunctions
// - reuse results of previous nonces if some first bits are identical
//
//-----------------------------------------------------------------------------
// aczid's Copyright notice:
//
// Bit-sliced Crypto-1 brute-forcing implementation
// Builds on the data structures returned by CraptEV1 craptev1_get_space(nonces, threshold, uid)
/*
Copyright (c) 2015-2016 Aram Verstegen
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#include "hardnested_bruteforce.h"
#include <inttypes.h>
#include <stdbool.h>
#include <stdio.h>
#include <pthread.h>
#include <string.h>
#include <stdlib.h>
#include "proxmark3.h"
#include "cmdhfmfhard.h"
#include "hardnested_bf_core.h"
#include "ui.h"
#include "util.h"
#include "util_posix.h"
#include "crapto1/crapto1.h"
#include "parity.h"
#define NUM_BRUTE_FORCE_THREADS (num_CPUs())
#define DEFAULT_BRUTE_FORCE_RATE (120000000.0) // if benchmark doesn't succeed
#define TEST_BENCH_SIZE (6000) // number of odd and even states for brute force benchmark
#define TEST_BENCH_FILENAME "hardnested/bf_bench_data.bin"
//#define WRITE_BENCH_FILE
// debugging options
#define DEBUG_KEY_ELIMINATION
// #define DEBUG_BRUTE_FORCE
typedef enum {
EVEN_STATE = 0,
ODD_STATE = 1
} odd_even_t;
static uint32_t nonces_to_bruteforce = 0;
static uint32_t bf_test_nonce[256];
static uint8_t bf_test_nonce_2nd_byte[256];
static uint8_t bf_test_nonce_par[256];
static uint32_t bucket_count = 0;
static statelist_t* buckets[128];
static uint32_t keys_found = 0;
static uint64_t num_keys_tested;
uint8_t trailing_zeros(uint8_t byte)
{
static const uint8_t trailing_zeros_LUT[256] = {
8, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
7, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0
};
return trailing_zeros_LUT[byte];
}
bool verify_key(uint32_t cuid, noncelist_t *nonces, uint8_t *best_first_bytes, uint32_t odd, uint32_t even)
{
struct Crypto1State pcs;
for (uint16_t test_first_byte = 1; test_first_byte < 256; test_first_byte++) {
noncelistentry_t *test_nonce = nonces[best_first_bytes[test_first_byte]].first;
while (test_nonce != NULL) {
pcs.odd = odd;
pcs.even = even;
lfsr_rollback_byte(&pcs, (cuid >> 24) ^ best_first_bytes[0], true);
for (int8_t byte_pos = 3; byte_pos >= 0; byte_pos--) {
uint8_t test_par_enc_bit = (test_nonce->par_enc >> byte_pos) & 0x01; // the encoded parity bit
uint8_t test_byte_enc = (test_nonce->nonce_enc >> (8*byte_pos)) & 0xff; // the encoded nonce byte
uint8_t test_byte_dec = crypto1_byte(&pcs, test_byte_enc /* ^ (cuid >> (8*byte_pos)) */, true) ^ test_byte_enc; // decode the nonce byte
uint8_t ks_par = filter(pcs.odd); // the keystream bit to encode/decode the parity bit
uint8_t test_par_enc2 = ks_par ^ evenparity8(test_byte_dec); // determine the decoded byte's parity and encode it
if (test_par_enc_bit != test_par_enc2) {
return false;
}
}
test_nonce = test_nonce->next;
}
}
return true;
}
static void* crack_states_thread(void* x){
struct arg {
bool silent;
int thread_ID;
uint32_t cuid;
uint32_t num_acquired_nonces;
uint64_t maximum_states;
noncelist_t *nonces;
uint8_t* best_first_bytes;
} *thread_arg;
thread_arg = (struct arg *)x;
const int thread_id = thread_arg->thread_ID;
uint32_t current_bucket = thread_id;
while(current_bucket < bucket_count){
statelist_t *bucket = buckets[current_bucket];
if(bucket){
#if defined (DEBUG_BRUTE_FORCE)
printf("Thread %u starts working on bucket %u\n", thread_id, current_bucket);
#endif
const uint64_t key = crack_states_bitsliced(thread_arg->cuid, thread_arg->best_first_bytes, bucket, &keys_found, &num_keys_tested, nonces_to_bruteforce, bf_test_nonce_2nd_byte, thread_arg->nonces);
if(key != -1){
__sync_fetch_and_add(&keys_found, 1);
char progress_text[80];
sprintf(progress_text, "Brute force phase completed. Key found: %012" PRIx64, key);
hardnested_print_progress(thread_arg->num_acquired_nonces, progress_text, 0.0, 0);
break;
} else if(keys_found){
break;
} else {
if (!thread_arg->silent) {
char progress_text[80];
sprintf(progress_text, "Brute force phase: %6.02f%%", 100.0*(float)num_keys_tested/(float)(thread_arg->maximum_states));
float remaining_bruteforce = thread_arg->nonces[thread_arg->best_first_bytes[0]].expected_num_brute_force - (float)num_keys_tested/2;
hardnested_print_progress(thread_arg->num_acquired_nonces, progress_text, remaining_bruteforce, 5000);
}
}
}
current_bucket += NUM_BRUTE_FORCE_THREADS;
}
return NULL;
}
void prepare_bf_test_nonces(noncelist_t *nonces, uint8_t best_first_byte)
{
// we do bitsliced brute forcing with best_first_bytes[0] only.
// Extract the corresponding 2nd bytes
noncelistentry_t *test_nonce = nonces[best_first_byte].first;
uint32_t i = 0;
while (test_nonce != NULL) {
bf_test_nonce[i] = test_nonce->nonce_enc;
bf_test_nonce_par[i] = test_nonce->par_enc;
bf_test_nonce_2nd_byte[i] = (test_nonce->nonce_enc >> 16) & 0xff;
test_nonce = test_nonce->next;
i++;
}
nonces_to_bruteforce = i;
// printf("Nonces to bruteforce: %d\n", nonces_to_bruteforce);
// printf("Common bits of first 4 2nd nonce bytes (before sorting): %u %u %u\n",
// trailing_zeros(bf_test_nonce_2nd_byte[1] ^ bf_test_nonce_2nd_byte[0]),
// trailing_zeros(bf_test_nonce_2nd_byte[2] ^ bf_test_nonce_2nd_byte[1]),
// trailing_zeros(bf_test_nonce_2nd_byte[3] ^ bf_test_nonce_2nd_byte[2]));
uint8_t best_4[4] = {0};
int sum_best = -1;
for (uint16_t n1 = 0; n1 < nonces_to_bruteforce; n1++) {
for (uint16_t n2 = 0; n2 < nonces_to_bruteforce; n2++) {
if (n2 != n1) {
for (uint16_t n3 = 0; n3 < nonces_to_bruteforce; n3++) {
if ((n3 != n2 && n3 != n1) || nonces_to_bruteforce < 3
// && trailing_zeros(bf_test_nonce_2nd_byte[n1] ^ bf_test_nonce_2nd_byte[n2])
// > trailing_zeros(bf_test_nonce_2nd_byte[n2] ^ bf_test_nonce_2nd_byte[n3])
) {
for (uint16_t n4 = 0; n4 < nonces_to_bruteforce; n4++) {
if ((n4 != n3 && n4 != n2 && n4 != n1) || nonces_to_bruteforce < 4
// && trailing_zeros(bf_test_nonce_2nd_byte[n2] ^ bf_test_nonce_2nd_byte[n3])
// > trailing_zeros(bf_test_nonce_2nd_byte[n3] ^ bf_test_nonce_2nd_byte[n4])
) {
int sum = nonces_to_bruteforce > 1 ? trailing_zeros(bf_test_nonce_2nd_byte[n1] ^ bf_test_nonce_2nd_byte[n2]) : 0.0
+ nonces_to_bruteforce > 2 ? trailing_zeros(bf_test_nonce_2nd_byte[n2] ^ bf_test_nonce_2nd_byte[n3]) : 0.0
+ nonces_to_bruteforce > 3 ? trailing_zeros(bf_test_nonce_2nd_byte[n3] ^ bf_test_nonce_2nd_byte[n4]) : 0.0;
if (sum > sum_best) {
sum_best = sum;
best_4[0] = n1;
best_4[1] = n2;
best_4[2] = n3;
best_4[3] = n4;
}
}
}
}
}
}
}
}
uint32_t bf_test_nonce_temp[4];
uint8_t bf_test_nonce_par_temp[4];
uint8_t bf_test_nonce_2nd_byte_temp[4];
for (uint8_t i = 0; i < 4 && i < nonces_to_bruteforce; i++) {
bf_test_nonce_temp[i] = bf_test_nonce[best_4[i]];
bf_test_nonce_par_temp[i] = bf_test_nonce_par[best_4[i]];
bf_test_nonce_2nd_byte_temp[i] = bf_test_nonce_2nd_byte[best_4[i]];
}
for (uint8_t i = 0; i < 4 && i < nonces_to_bruteforce; i++) {
bf_test_nonce[i] = bf_test_nonce_temp[i];
bf_test_nonce_par[i] = bf_test_nonce_par_temp[i];
bf_test_nonce_2nd_byte[i] = bf_test_nonce_2nd_byte_temp[i];
}
}
#if defined (WRITE_BENCH_FILE)
static void write_benchfile(statelist_t *candidates) {
printf("Writing brute force benchmark data...");
FILE *benchfile = fopen(TEST_BENCH_FILENAME, "wb");
fwrite(&nonces_to_bruteforce, 1, sizeof(nonces_to_bruteforce), benchfile);
for (uint32_t i = 0; i < nonces_to_bruteforce; i++) {
fwrite(&(bf_test_nonce[i]), 1, sizeof(bf_test_nonce[i]), benchfile);
fwrite(&(bf_test_nonce_par[i]), 1, sizeof(bf_test_nonce_par[i]), benchfile);
}
uint32_t num_states = MIN(candidates->len[EVEN_STATE], TEST_BENCH_SIZE);
fwrite(&num_states, 1, sizeof(num_states), benchfile);
for (uint32_t i = 0; i < num_states; i++) {
fwrite(&(candidates->states[EVEN_STATE][i]), 1, sizeof(uint32_t), benchfile);
}
num_states = MIN(candidates->len[ODD_STATE], TEST_BENCH_SIZE);
fwrite(&num_states, 1, sizeof(num_states), benchfile);
for (uint32_t i = 0; i < num_states; i++) {
fwrite(&(candidates->states[ODD_STATE][i]), 1, sizeof(uint32_t), benchfile);
}
fclose(benchfile);
printf("done.\n");
}
#endif
bool brute_force_bs(float *bf_rate, statelist_t *candidates, uint32_t cuid, uint32_t num_acquired_nonces, uint64_t maximum_states, noncelist_t *nonces, uint8_t *best_first_bytes)
{
#if defined (WRITE_BENCH_FILE)
write_benchfile(candidates);
#endif
bool silent = (bf_rate != NULL);
// if (!silent) {
// PrintAndLog("Brute force phase starting.");
// PrintAndLog("Using %u-bit bitslices", MAX_BITSLICES);
// }
keys_found = 0;
num_keys_tested = 0;
bitslice_test_nonces(nonces_to_bruteforce, bf_test_nonce, bf_test_nonce_par);
// count number of states to go
bucket_count = 0;
for (statelist_t *p = candidates; p != NULL; p = p->next) {
if (p->states[ODD_STATE] != NULL && p->states[EVEN_STATE] != NULL) {
buckets[bucket_count] = p;
bucket_count++;
}
}
uint64_t start_time = msclock();
// enumerate states using all hardware threads, each thread handles one bucket
// if (!silent) {
// PrintAndLog("Starting %u cracking threads to search %u buckets containing a total of %" PRIu64" states...\n", NUM_BRUTE_FORCE_THREADS, bucket_count, maximum_states);
// printf("Common bits of first 4 2nd nonce bytes: %u %u %u\n",
// trailing_zeros(bf_test_nonce_2nd_byte[1] ^ bf_test_nonce_2nd_byte[0]),
// trailing_zeros(bf_test_nonce_2nd_byte[2] ^ bf_test_nonce_2nd_byte[1]),
// trailing_zeros(bf_test_nonce_2nd_byte[3] ^ bf_test_nonce_2nd_byte[2]));
// }
pthread_t threads[NUM_BRUTE_FORCE_THREADS];
struct args {
bool silent;
int thread_ID;
uint32_t cuid;
uint32_t num_acquired_nonces;
uint64_t maximum_states;
noncelist_t *nonces;
uint8_t *best_first_bytes;
} thread_args[NUM_BRUTE_FORCE_THREADS];
for(uint32_t i = 0; i < NUM_BRUTE_FORCE_THREADS; i++){
thread_args[i].thread_ID = i;
thread_args[i].silent = silent;
thread_args[i].cuid = cuid;
thread_args[i].num_acquired_nonces = num_acquired_nonces;
thread_args[i].maximum_states = maximum_states;
thread_args[i].nonces = nonces;
thread_args[i].best_first_bytes = best_first_bytes;
pthread_create(&threads[i], NULL, crack_states_thread, (void*)&thread_args[i]);
}
for(uint32_t i = 0; i < NUM_BRUTE_FORCE_THREADS; i++){
pthread_join(threads[i], 0);
}
uint64_t elapsed_time = msclock() - start_time;
// if (!silent) {
// printf("Brute force completed after testing %" PRIu64" (2^%1.1f) keys in %1.1f seconds at a rate of %1.0f (2^%1.1f) keys per second.\n",
// num_keys_tested,
// log(num_keys_tested) / log(2.0),
// (float)elapsed_time/1000.0,
// (float)num_keys_tested / ((float)elapsed_time / 1000.0),
// log((float)num_keys_tested / ((float)elapsed_time/1000.0)) / log(2.0));
// }
if (bf_rate != NULL) {
*bf_rate = (float)num_keys_tested / ((float)elapsed_time / 1000.0);
}
return (keys_found != 0);
}
static bool read_bench_data(statelist_t *test_candidates) {
size_t bytes_read = 0;
uint32_t temp = 0;
uint32_t num_states = 0;
uint32_t states_read = 0;
char bench_file_path[strlen(get_my_executable_directory()) + strlen(TEST_BENCH_FILENAME) + 1];
strcpy(bench_file_path, get_my_executable_directory());
strcat(bench_file_path, TEST_BENCH_FILENAME);
FILE *benchfile = fopen(bench_file_path, "rb");
if (benchfile == NULL) {
return false;
}
bytes_read = fread(&nonces_to_bruteforce, 1, sizeof(nonces_to_bruteforce), benchfile);
if (bytes_read != sizeof(nonces_to_bruteforce)) {
fclose(benchfile);
return false;
}
for (uint16_t i = 0; i < nonces_to_bruteforce && i < 256; i++) {
bytes_read = fread(&bf_test_nonce[i], 1, sizeof(uint32_t), benchfile);
if (bytes_read != sizeof(uint32_t)) {
fclose(benchfile);
return false;
}
bf_test_nonce_2nd_byte[i] = (bf_test_nonce[i] >> 16) & 0xff;
bytes_read = fread(&bf_test_nonce_par[i], 1, sizeof(uint8_t), benchfile);
if (bytes_read != sizeof(uint8_t)) {
fclose(benchfile);
return false;
}
}
bytes_read = fread(&num_states, 1, sizeof(uint32_t), benchfile);
if (bytes_read != sizeof(uint32_t)) {
fclose(benchfile);
return false;
}
for (states_read = 0; states_read < MIN(num_states, TEST_BENCH_SIZE); states_read++) {
bytes_read = fread(test_candidates->states[EVEN_STATE] + states_read, 1, sizeof(uint32_t), benchfile);
if (bytes_read != sizeof(uint32_t)) {
fclose(benchfile);
return false;
}
}
for (uint32_t i = states_read; i < TEST_BENCH_SIZE; i++) {
test_candidates->states[EVEN_STATE][i] = test_candidates->states[EVEN_STATE][i-states_read];
}
for (uint32_t i = states_read; i < num_states; i++) {
bytes_read = fread(&temp, 1, sizeof(uint32_t), benchfile);
if (bytes_read != sizeof(uint32_t)) {
fclose(benchfile);
return false;
}
}
for (states_read = 0; states_read < MIN(num_states, TEST_BENCH_SIZE); states_read++) {
bytes_read = fread(test_candidates->states[ODD_STATE] + states_read, 1, sizeof(uint32_t), benchfile);
if (bytes_read != sizeof(uint32_t)) {
fclose(benchfile);
return false;
}
}
for (uint32_t i = states_read; i < TEST_BENCH_SIZE; i++) {
test_candidates->states[ODD_STATE][i] = test_candidates->states[ODD_STATE][i-states_read];
}
fclose(benchfile);
return true;
}
float brute_force_benchmark()
{
statelist_t test_candidates[NUM_BRUTE_FORCE_THREADS];
test_candidates[0].states[ODD_STATE] = malloc((TEST_BENCH_SIZE+1) * sizeof(uint32_t));
test_candidates[0].states[EVEN_STATE] = malloc((TEST_BENCH_SIZE+1) * sizeof(uint32_t));
for (uint8_t i = 0; i < NUM_BRUTE_FORCE_THREADS - 1; i++){
test_candidates[i].next = test_candidates + i + 1;
test_candidates[i+1].states[ODD_STATE] = test_candidates[0].states[ODD_STATE];
test_candidates[i+1].states[EVEN_STATE] = test_candidates[0].states[EVEN_STATE];
}
test_candidates[NUM_BRUTE_FORCE_THREADS-1].next = NULL;
if (!read_bench_data(test_candidates)) {
PrintAndLog("Couldn't read benchmark data. Assuming brute force rate of %1.0f states per second", DEFAULT_BRUTE_FORCE_RATE);
return DEFAULT_BRUTE_FORCE_RATE;
}
for (uint8_t i = 0; i < NUM_BRUTE_FORCE_THREADS; i++) {
test_candidates[i].len[ODD_STATE] = TEST_BENCH_SIZE;
test_candidates[i].len[EVEN_STATE] = TEST_BENCH_SIZE;
test_candidates[i].states[ODD_STATE][TEST_BENCH_SIZE] = -1;
test_candidates[i].states[EVEN_STATE][TEST_BENCH_SIZE] = -1;
}
uint64_t maximum_states = TEST_BENCH_SIZE*TEST_BENCH_SIZE*(uint64_t)NUM_BRUTE_FORCE_THREADS;
float bf_rate;
brute_force_bs(&bf_rate, test_candidates, 0, 0, maximum_states, NULL, 0);
free(test_candidates[0].states[ODD_STATE]);
free(test_candidates[0].states[EVEN_STATE]);
return bf_rate;
}

36
client/hardnested/hardnested_bruteforce.h Normal file
View file

@ -0,0 +1,36 @@
//-----------------------------------------------------------------------------
// Copyright (C) 2016, 2017 by piwi
//
// This code is licensed to you under the terms of the GNU GPL, version 2 or,
// at your option, any later version. See the LICENSE.txt file for the text of
// the license.
//-----------------------------------------------------------------------------
// Implements a card only attack based on crypto text (encrypted nonces
// received during a nested authentication) only. Unlike other card only
// attacks this doesn't rely on implementation errors but only on the
// inherent weaknesses of the crypto1 cypher. Described in
// Carlo Meijer, Roel Verdult, "Ciphertext-only Cryptanalysis on Hardened
// Mifare Classic Cards" in Proceedings of the 22nd ACM SIGSAC Conference on
// Computer and Communications Security, 2015
//-----------------------------------------------------------------------------
#ifndef HARDNESTED_BRUTEFORCE_H__
#define HARDNESTED_BRUTEFORCE_H__
#include <stdint.h>
#include <stdbool.h>
#include "cmdhfmfhard.h"
typedef struct {
uint32_t *states[2];
uint32_t len[2];
void* next;
} statelist_t;
extern void prepare_bf_test_nonces(noncelist_t *nonces, uint8_t best_first_byte);
extern bool brute_force_bs(float *bf_rate, statelist_t *candidates, uint32_t cuid, uint32_t num_acquired_nonces, uint64_t maximum_states, noncelist_t *nonces, uint8_t *best_first_bytes);
extern float brute_force_benchmark();
extern uint8_t trailing_zeros(uint8_t byte);
extern bool verify_key(uint32_t cuid, noncelist_t *nonces, uint8_t *best_first_bytes, uint32_t odd, uint32_t even);
#endif

592
client/hardnested/hardnested_tables.c Normal file
View file

@ -0,0 +1,592 @@
//-----------------------------------------------------------------------------
// Copyright (C) 2015, 2016 by piwi
//
// This code is licensed to you under the terms of the GNU GPL, version 2 or,
// at your option, any later version. See the LICENSE.txt file for the text of
// the license.
//-----------------------------------------------------------------------------
// Implements a card only attack based on crypto text (encrypted nonces
// received during a nested authentication) only. Unlike other card only
// attacks this doesn't rely on implementation errors but only on the
// inherent weaknesses of the crypto1 cypher. Described in
// Carlo Meijer, Roel Verdult, "Ciphertext-only Cryptanalysis on Hardened
// Mifare Classic Cards" in Proceedings of the 22nd ACM SIGSAC Conference on
// Computer and Communications Security, 2015
//-----------------------------------------------------------------------------
//
// This program calculates tables with possible states for a given
// bitflip property.
//
//-----------------------------------------------------------------------------
#include <inttypes.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <time.h>
#include "crapto1/crapto1.h"
#include "parity.h"
#define NUM_PART_SUMS 9
#define BITFLIP_2ND_BYTE 0x0200
typedef enum {
EVEN_STATE = 0,
ODD_STATE = 1
} odd_even_t;
static uint16_t PartialSumProperty(uint32_t state, odd_even_t odd_even)
{
uint16_t sum = 0;
for (uint16_t j = 0; j < 16; j++) {
uint32_t st = state;
uint16_t part_sum = 0;
if (odd_even == ODD_STATE) {
for (uint16_t i = 0; i < 5; i++) {
part_sum ^= filter(st);
st = (st << 1) | ((j >> (3-i)) & 0x01) ;
}
part_sum ^= 1; // XOR 1 cancelled out for the other 8 bits
} else {
for (uint16_t i = 0; i < 4; i++) {
st = (st << 1) | ((j >> (3-i)) & 0x01) ;
part_sum ^= filter(st);
}
}
sum += part_sum;
}
return sum;
}
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// bitarray functions
#define malloc_bitarray(x) __builtin_assume_aligned(_aligned_malloc(x, __BIGGEST_ALIGNMENT__), __BIGGEST_ALIGNMENT__)
#define free_bitarray(x) _aligned_free(x)
static inline void clear_bitarray24(uint32_t *bitarray)
{
memset(bitarray, 0x00, sizeof(uint32_t) * (1<<19));
}
static inline uint32_t test_bit24(uint32_t *bitarray, uint32_t index)
{
return bitarray[index>>5] & (0x80000000>>(index&0x0000001f));
}
static inline void set_bit24(uint32_t *bitarray, uint32_t index)
{
bitarray[index>>5] |= 0x80000000>>(index&0x0000001f);
}
static inline uint32_t next_state(uint32_t *bitset, uint32_t state)
{
if (++state == 1<<24) return 1<<24;
uint32_t index = state >> 5;
uint_fast8_t bit = state & 0x1f;
uint32_t line = bitset[index] << bit;
while (bit <= 0x1f) {
if (line & 0x80000000) return state;
state++;
bit++;
line <<= 1;
}
index++;
while (bitset[index] == 0x00000000 && state < 1<<24) {
index++;
state += 0x20;
}
if (state >= 1<<24) return 1<<24;
#if defined __GNUC__
return state + __builtin_clz(bitset[index]);
#else
bit = 0x00;
line = bitset[index];
while (bit <= 0x1f) {
if (line & 0x80000000) return state;
state++;
bit++;
line <<= 1;
}
return 1<<24;
#endif
}
static inline uint32_t next_not_state(uint32_t *bitset, uint32_t state)
{
if (++state == 1<<24) return 1<<24;
uint32_t index = state >> 5;
uint_fast8_t bit = state & 0x1f;
uint32_t line = bitset[index] << bit;
while (bit <= 0x1f) {
if ((line & 0x80000000) == 0) return state;
state++;
bit++;
line <<= 1;
}
index++;
while (bitset[index] == 0xffffffff && state < 1<<24) {
index++;
state += 0x20;
}
if (state >= 1<<24) return 1<<24;
#if defined __GNUC__
return state + __builtin_clz(~bitset[index]);
#else
bit = 0x00;
line = bitset[index];
while (bit <= 0x1f) {
if ((line & 0x80000000) == 0) return state;
state++;
bit++;
line <<= 1;
}
return 1<<24;
#endif
}
static inline uint32_t bitcount(uint32_t a)
{
#if defined __GNUC__
return __builtin_popcountl(a);
#else
a = a - ((a >> 1) & 0x55555555);
a = (a & 0x33333333) + ((a >> 2) & 0x33333333);
return (((a + (a >> 4)) & 0x0f0f0f0f) * 0x01010101) >> 24;
#endif
}
static inline uint32_t count_states(uint32_t *bitset)
{
uint32_t count = 0;
for (uint32_t i = 0; i < (1<<19); i++) {
count += bitcount(bitset[i]);
}
return count;
}
static void write_bitflips_file(odd_even_t odd_even, uint16_t bitflip, int sum_a0, uint32_t *bitset, uint32_t count)
{
char filename[80];
sprintf(filename, "bitflip_%d_%03" PRIx16 "_sum%d_states.bin", odd_even, bitflip, sum_a0);
FILE *outfile = fopen(filename, "wb");
fwrite(&count, 1, sizeof(count), outfile);
fwrite(bitset, 1, sizeof(uint32_t)*(1<<19), outfile);
fclose(outfile);
}
uint32_t *restrict part_sum_a0_bitarrays[2][NUM_PART_SUMS];
static void init_part_sum_bitarrays(void)
{
printf("init_part_sum_bitarrays()...");
for (odd_even_t odd_even = EVEN_STATE; odd_even <= ODD_STATE; odd_even++) {
for (uint16_t part_sum_a0 = 0; part_sum_a0 < NUM_PART_SUMS; part_sum_a0++) {
part_sum_a0_bitarrays[odd_even][part_sum_a0] = (uint32_t *)malloc_bitarray(sizeof(uint32_t) * (1<<19));
if (part_sum_a0_bitarrays[odd_even][part_sum_a0] == NULL) {
printf("Out of memory error in init_part_suma0_statelists(). Aborting...\n");
exit(4);
}
clear_bitarray24(part_sum_a0_bitarrays[odd_even][part_sum_a0]);
}
}
for (odd_even_t odd_even = EVEN_STATE; odd_even <= ODD_STATE; odd_even++) {
//printf("(%d, %" PRIu16 ")...", odd_even, part_sum_a0);
for (uint32_t state = 0; state < (1<<20); state++) {
uint16_t part_sum_a0 = PartialSumProperty(state, odd_even) / 2;
for (uint16_t low_bits = 0; low_bits < 1<<4; low_bits++) {
set_bit24(part_sum_a0_bitarrays[odd_even][part_sum_a0], state<<4 | low_bits);
}
}
}
printf("done.\n");
}
static void free_part_sum_bitarrays(void)
{
printf("free_part_sum_bitarrays()...");
for (int16_t part_sum_a0 = (NUM_PART_SUMS-1); part_sum_a0 >= 0; part_sum_a0--) {
free_bitarray(part_sum_a0_bitarrays[ODD_STATE][part_sum_a0]);
}
for (int16_t part_sum_a0 = (NUM_PART_SUMS-1); part_sum_a0 >= 0; part_sum_a0--) {
free_bitarray(part_sum_a0_bitarrays[EVEN_STATE][part_sum_a0]);
}
printf("done.\n");
}
uint32_t *restrict sum_a0_bitarray[2];
void init_sum_bitarray(uint16_t sum_a0)
{
printf("init_sum_bitarray()...\n");
for (odd_even_t odd_even = EVEN_STATE; odd_even <= ODD_STATE; odd_even++) {
sum_a0_bitarray[odd_even] = (uint32_t *)malloc_bitarray(sizeof(uint32_t) * (1<<19));
if (sum_a0_bitarray[odd_even] == NULL) {
printf("Out of memory error in init_sum_bitarrays(). Aborting...\n");
exit(4);
}
clear_bitarray24(sum_a0_bitarray[odd_even]);
}
for (uint8_t p = 0; p < NUM_PART_SUMS; p++) {
for (uint8_t q = 0; q < NUM_PART_SUMS; q++) {
if (sum_a0 == 2*p*(16-2*q) + (16-2*p)*2*q) {
for (uint32_t i = 0; i < (1<<19); i++) {
sum_a0_bitarray[EVEN_STATE][i] |= part_sum_a0_bitarrays[EVEN_STATE][q][i];
sum_a0_bitarray[ODD_STATE][i] |= part_sum_a0_bitarrays[ODD_STATE][p][i];
}
}
}
}
for (odd_even_t odd_even = EVEN_STATE; odd_even <= ODD_STATE; odd_even++) {
uint32_t count = count_states(sum_a0_bitarray[odd_even]);
printf("sum_a0_bitarray[%s] has %d states (%5.2f%%)\n", odd_even==EVEN_STATE?"even":"odd ", count, (float)count/(1<<24)*100.0);
}
printf("done.\n");
}
static void free_sum_bitarray(void)
{
printf("free_sum_bitarray()...");
free_bitarray(sum_a0_bitarray[ODD_STATE]);
free_bitarray(sum_a0_bitarray[EVEN_STATE]);
printf("done.\n");
}
static void precalculate_bit0_bitflip_bitarrays(uint8_t const bitflip, uint16_t const sum_a0)
{
// #define TEST_RUN
#ifdef TEST_RUN
#define NUM_TEST_STATES (1<<10)
#else
#define NUM_TEST_STATES (1<<23)
#endif
time_t start_time = time(NULL);
time_t last_check_time = start_time;
uint32_t *restrict test_bitarray[2];
uint32_t *restrict test_not_bitarray[2];
test_bitarray[EVEN_STATE] = malloc_bitarray(sizeof(uint32_t) * (1<<19));
clear_bitarray24(test_bitarray[EVEN_STATE]);
test_bitarray[ODD_STATE] = malloc_bitarray(sizeof(uint32_t) * (1<<19));
clear_bitarray24(test_bitarray[ODD_STATE]);
test_not_bitarray[EVEN_STATE] = malloc_bitarray(sizeof(uint32_t) * (1<<19));
clear_bitarray24(test_not_bitarray[EVEN_STATE]);
test_not_bitarray[ODD_STATE] = malloc_bitarray(sizeof(uint32_t) * (1<<19));
clear_bitarray24(test_not_bitarray[ODD_STATE]);
uint32_t count[2];
bool all_odd_states_are_possible_for_notbitflip = false;
printf("\n\nStarting search for crypto1 states resulting in bitflip property 0x%03x...\n", bitflip);
for (uint32_t even_state = next_state(sum_a0_bitarray[EVEN_STATE], -1); even_state < NUM_TEST_STATES; even_state = next_state(sum_a0_bitarray[EVEN_STATE], even_state)) {
bool even_state_is_possible = false;
time_t time_now = time(NULL);
if (difftime(time_now, last_check_time) > 5*60) { // print status every 5 minutes
float runtime = difftime(time_now, start_time);
float remaining_time = runtime * ((1<<23) - even_state) / even_state;
printf("\n%1.1f hours elapsed, expected completion in %1.1f hours (%1.1f days)", runtime/3600, remaining_time/3600, remaining_time/3600/24);
last_check_time = time_now;
}
for (uint32_t odd_state = next_state(sum_a0_bitarray[ODD_STATE], -1); odd_state < (1<<24); odd_state = next_state(test_bitarray[ODD_STATE], odd_state)) {
if (even_state_is_possible && test_bit24(test_bitarray[ODD_STATE], odd_state)) continue;
// load crypto1 state
struct Crypto1State cs;
cs.odd = odd_state >> 4;
cs.even = even_state >> 4;
// track flipping bits in state
struct Crypto1DeltaState {
uint_fast8_t odd;
uint_fast8_t even;
} cs_delta;
cs_delta.odd = 0;
cs_delta.even = 0;
uint_fast16_t keystream = 0;
// decrypt 9 bits
for (int i = 0; i < 9; i++) {
uint_fast8_t keystream_bit = filter(cs.odd & 0x000fffff) ^ filter((cs.odd & 0x000fffff) ^ cs_delta.odd);
keystream = keystream << 1 | keystream_bit;
uint_fast8_t nt_bit = BIT(bitflip, i) ^ keystream_bit;
uint_fast8_t LSFR_feedback = BIT(cs_delta.odd, 2) ^ BIT(cs_delta.even, 2) ^ BIT(cs_delta.odd, 3);
cs_delta.even = cs_delta.even << 1 | (LSFR_feedback ^ nt_bit);
uint_fast8_t tmp = cs_delta.odd;
cs_delta.odd = cs_delta.even;
cs_delta.even = tmp;
cs.even = cs.odd;
if (i & 1) {
cs.odd = odd_state >> (7 - i) / 2;
} else {
cs.odd = even_state >> (7 - i) / 2;
}
}
if (evenparity32(keystream) == evenparity32(bitflip)) {
// found valid bitflip state
even_state_is_possible = true;
set_bit24(test_bitarray[EVEN_STATE], even_state);
set_bit24(test_bitarray[EVEN_STATE], 1 << 23 | even_state);
set_bit24(test_bitarray[ODD_STATE], odd_state);
} else {
// found valid !bitflip state
set_bit24(test_not_bitarray[EVEN_STATE], even_state);
set_bit24(test_not_bitarray[EVEN_STATE], 1 << 23 | even_state);
set_bit24(test_not_bitarray[ODD_STATE], odd_state);
}
}
if (!even_state_is_possible) {
all_odd_states_are_possible_for_notbitflip = true;
}
}
printf("\nAnalysis completed. Checking for effective bitflip properties...\n");
for (odd_even_t odd_even = EVEN_STATE; odd_even <= ODD_STATE; odd_even++) {
count[odd_even] = count_states(test_bitarray[odd_even]);
if (count[odd_even] != 1<<24) {
printf("Writing %d possible %s states for bitflip property %03x (%d (%1.2f%%) states eliminated)\n",
count[odd_even],
odd_even==EVEN_STATE?"even":"odd",
bitflip, (1<<24) - count[odd_even],
(float)((1<<24) - count[odd_even]) / (1<<24) * 100.0);
#ifndef TEST_RUN
write_bitflips_file(odd_even, bitflip, sum_a0, test_bitarray[odd_even], count[odd_even]);
#endif
} else {
printf("All %s states for bitflip property %03x are possible. No file written.\n", odd_even==EVEN_STATE?"even":"odd", bitflip);
}
}
uint32_t *restrict test_bitarray_2nd = malloc_bitarray(sizeof(uint32_t) * (1<<19));
clear_bitarray24(test_bitarray_2nd);
for (odd_even_t odd_even = EVEN_STATE; odd_even <= ODD_STATE; odd_even++) {
if (count[odd_even] != 1<<24) {
for (uint32_t state = 0; state < (1<<24); state += 1<<4) {
uint32_t line = test_bitarray[odd_even][state>>5];
uint16_t half_line = state&0x000000010 ? line&0x0000ffff : line>>16;
if (half_line != 0) {
for (uint32_t low_bits = 0; low_bits < (1<<4); low_bits++) {
set_bit24(test_bitarray_2nd, low_bits << 20 | state >> 4);
}
}
}
count[odd_even] = count_states(test_bitarray_2nd);
if (count[odd_even] != 1<<24) {
printf("Writing %d possible %s states for bitflip property %03x (%d (%1.2f%%) states eliminated)\n",
count[odd_even],
odd_even==EVEN_STATE?"even":"odd",
bitflip | BITFLIP_2ND_BYTE, (1<<24) - count[odd_even],
(float)((1<<24) - count[odd_even]) / (1<<24) * 100.0);
#ifndef TEST_RUN
write_bitflips_file(odd_even, bitflip | BITFLIP_2ND_BYTE, sum_a0, test_bitarray_2nd, count[odd_even]);
#endif
} else {
printf("All %s states for bitflip property %03x are possible. No file written.\n", odd_even==EVEN_STATE?"even":"odd", bitflip | BITFLIP_2ND_BYTE);
}
} else {
printf("All %s states for bitflip property %03x are possible. No file written.\n", odd_even==EVEN_STATE?"even":"odd", bitflip | BITFLIP_2ND_BYTE);
}
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// second run for the remaining "not bitflip" states
printf("\n\nStarting search for crypto1 states resulting in bitflip property 0x%03x...", bitflip | 0x100);
start_time = time(NULL);
last_check_time = start_time;
for (uint32_t even_state = next_state(sum_a0_bitarray[EVEN_STATE], -1); even_state < NUM_TEST_STATES; even_state = next_state(sum_a0_bitarray[EVEN_STATE], even_state)) {
bool even_state_is_possible = test_bit24(test_not_bitarray[EVEN_STATE], even_state);
time_t time_now = time(NULL);
if (difftime(time_now, last_check_time) > 5*60) { // print status every 5 minutes
float runtime = difftime(time_now, start_time);
float remaining_time = runtime * ((1<<23) - even_state) / even_state;
printf("\n%1.1f hours elapsed, expected completion in %1.1f hours (%1.1f days)", runtime/3600, remaining_time/3600, remaining_time/3600/24);
last_check_time = time_now;
}
for (uint32_t odd_state = next_state(sum_a0_bitarray[ODD_STATE], -1); odd_state < (1<<24); odd_state = next_state(sum_a0_bitarray[ODD_STATE], odd_state)) {
if (even_state_is_possible) {
if (all_odd_states_are_possible_for_notbitflip) break;
if (test_bit24(test_not_bitarray[ODD_STATE], odd_state)) continue;
}
// load crypto1 state
struct Crypto1State cs;
cs.odd = odd_state >> 4;
cs.even = even_state >> 4;
// track flipping bits in state
struct Crypto1DeltaState {
uint_fast8_t odd;
uint_fast8_t even;
} cs_delta;
cs_delta.odd = 0;
cs_delta.even = 0;
uint_fast16_t keystream = 0;
// uint_fast16_t nt = 0;
// decrypt 9 bits
for (int i = 0; i < 9; i++) {
uint_fast8_t keystream_bit = filter(cs.odd & 0x000fffff) ^ filter((cs.odd & 0x000fffff) ^ cs_delta.odd);
keystream = keystream << 1 | keystream_bit;
uint_fast8_t nt_bit = BIT(bitflip|0x100, i) ^ keystream_bit;
uint_fast8_t LSFR_feedback = BIT(cs_delta.odd, 2) ^ BIT(cs_delta.even, 2) ^ BIT(cs_delta.odd, 3);
cs_delta.even = cs_delta.even << 1 | (LSFR_feedback ^ nt_bit);
uint_fast8_t tmp = cs_delta.odd;
cs_delta.odd = cs_delta.even;
cs_delta.even = tmp;
cs.even = cs.odd;
if (i & 1) {
cs.odd = odd_state >> (7 - i) / 2;
} else {
cs.odd = even_state >> (7 - i) / 2;
}
}
if (evenparity32(keystream) != evenparity32(bitflip)) {
// found valid !bitflip state
even_state_is_possible = true;
set_bit24(test_not_bitarray[EVEN_STATE], even_state);
set_bit24(test_not_bitarray[EVEN_STATE], 1 << 23 | even_state);
set_bit24(test_not_bitarray[ODD_STATE], odd_state);
}
}
}
printf("\nAnalysis completed. Checking for effective !bitflip properties...\n");
for (odd_even_t odd_even = EVEN_STATE; odd_even <= ODD_STATE; odd_even++) {
count[odd_even] = count_states(test_not_bitarray[odd_even]);
if (count[odd_even] != 1<<24) {
printf("Writing %d possible %s states for bitflip property %03x (%d (%1.2f%%) states eliminated)\n",
count[odd_even],
odd_even==EVEN_STATE?"even":"odd",
bitflip|0x100, (1<<24) - count[odd_even],
(float)((1<<24) - count[odd_even]) / (1<<24) * 100.0);
#ifndef TEST_RUN
write_bitflips_file(odd_even, bitflip|0x100, sum_a0, test_not_bitarray[odd_even], count[odd_even]);
#endif
} else {
printf("All %s states for bitflip property %03x are possible. No file written.\n", odd_even==EVEN_STATE?"even":"odd", bitflip|0x100);
}
}
clear_bitarray24(test_bitarray_2nd);
for (odd_even_t odd_even = EVEN_STATE; odd_even <= ODD_STATE; odd_even++) {
if (count[odd_even] != 1<<24) {
for (uint32_t state = 0; state < (1<<24); state += 1<<4) {
uint32_t line = test_not_bitarray[odd_even][state>>5];
uint16_t half_line = state&0x000000010 ? line&0x0000ffff : line>>16;
if (half_line != 0) {
for (uint32_t low_bits = 0; low_bits < (1<<4); low_bits++) {
set_bit24(test_bitarray_2nd, low_bits << 20 | state >> 4);
}
}
}
count[odd_even] = count_states(test_bitarray_2nd);
if (count[odd_even] != 1<<24) {
printf("Writing %d possible %s states for bitflip property %03x (%d (%1.2f%%) states eliminated)\n",
count[odd_even],
odd_even==EVEN_STATE?"even":"odd",
bitflip | 0x100| BITFLIP_2ND_BYTE, (1<<24) - count[odd_even],
(float)((1<<24) - count[odd_even]) / (1<<24) * 100.0);
#ifndef TEST_RUN
write_bitflips_file(odd_even, bitflip | 0x100 | BITFLIP_2ND_BYTE, sum_a0, test_bitarray_2nd, count[odd_even]);
#endif
} else {
printf("All %s states for bitflip property %03x are possible. No file written.\n", odd_even==EVEN_STATE?"even":"odd", bitflip | 0x100 | BITFLIP_2ND_BYTE);
}
} else {
printf("All %s states for bitflip property %03x are possible. No file written.\n", odd_even==EVEN_STATE?"even":"odd", bitflip | 0x100 | BITFLIP_2ND_BYTE);
}
}
free_bitarray(test_bitarray_2nd);
free_bitarray(test_not_bitarray[ODD_STATE]);
free_bitarray(test_not_bitarray[EVEN_STATE]);
free_bitarray(test_bitarray[ODD_STATE]);
free_bitarray(test_bitarray[EVEN_STATE]);
exit(0);
}
int main (int argc, char *argv[]) {
unsigned int bitflip_in;
int sum_a0;
printf("Create tables required by hardnested attack.\n");
printf("Expect a runtime in the range of days or weeks.\n");
printf("Single thread only. If you want to use several threads, start it multiple times :-)\n\n");
if (argc != 2 && argc != 3) {
printf(" syntax: %s <bitflip property> [<Sum_a0>]\n\n", argv[0]);
printf(" example: %s 1f\n", argv[0]);
return 1;
}
sscanf(argv[1],"%x", &bitflip_in);
if (bitflip_in > 255) {
printf("Bitflip property must be less than or equal to 0xff\n\n");
return 1;
}
if(argc == 3) {
sscanf(argv[2], "%d", &sum_a0);
}
switch (sum_a0) {
case 0:
case 32:
case 56:
case 64:
case 80:
case 96:
case 104:
case 112:
case 120:
case 128:
case 136:
case 144:
case 152:
case 160:
case 176:
case 192:
case 200:
case 224:
case 256: break;
default: sum_a0 = -1;
}
printf("Calculating for bitflip = %02x, sum_a0 = %d\n", bitflip_in, sum_a0);
init_part_sum_bitarrays();
init_sum_bitarray(sum_a0);
precalculate_bit0_bitflip_bitarrays(bitflip_in, sum_a0);
free_sum_bitarray();
free_part_sum_bitarrays();
return 0;
}

BIN
client/hardnested/tables/bitflip_0_001_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_003_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_005_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_007_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_009_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_00b_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_00d_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_00f_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_010_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_014_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_01c_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_021_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_023_states.bin.z Normal file
View file

Binary file not shown.

49
client/hardnested/tables/bitflip_0_025_states.bin.z Normal file
View file

@ -0,0 +1,49 @@
xΪν<EFBFBD>λ<EFBFBD>λ°<EFBFBD>€§€¦¥-n › δο–1πξΩΐWλM9”Γ/ΐ<><CE90>Δ‘i<E28098>βC$EώΧ<CF8E>όχΧσ±οΗί¶=<1F>ήΏΎ<CE8F>ο~Ώ·<CE8F>{ΉλΗ<CEBB><CE97>ίύύ<<1F>ΎΫ¶pόΏχίοσψΏόϊzύ<7A>ίοΎΎόϋΝƒ<1F>ί¶ώΏoΏώ<CE8F>ώΰώ!ώΫv|·m%ψ―ίΟΗΏ~<0E>σx<1F>γίπήsα»y9γό67<36>ΠϊλΠ<CEBB>Έ―ϋϋGC<43>BψΟGί}οθ<1F>?Ύχο<CF87>9ψKΧ<4B>Όω<CE8C>ΗϋΧ<CF8B>οϊ”πί¶2όΉόίΏ†<CE8F><EFBFBD>―ϋίΑ<CEAF>π?όώΨ<CF8E>ιρ?©λ!όΤσ?ερϋ^/…<1F>>Κγ΅Z<7F>=¥ωΟ}–<>ϋΏ<CF8B>ώωΣς,Ζ??:λ<>,?sΧcϊΖί§ι<C2A7>Ώ<EFBFBD><CE8F>ϊΏιϊ<CEB9>7<EFBFBD>ϋ>‡>θδΏ¦ό•Ώi~Ι??ϋ?τ?ϊϊCό<7F>Θ<EFBFBD>:|<7C>·­}|<7C>ώΐΏ|β<><CEB2><EFBFBD>{όΕ<CF8C>ύ¶µοsώ<73>^ω[^<5E>ωρ9ω;<1A><>+<2B>ο<13>KΣ_*ϊα‡τ―<CF84><E28095>Χλ¶­΄ώΦ“<CEA6>­φϋ§<CF8B>Η<EFBFBD>Σ¶™;<3B>ΪόΧ<CF8C><CEA7>ψώωΪω»~ό»βΔ?‰b<7F>―—<E28095><E28094>j<6A>Ω<EFBFBD>Zφ<5A>mψ<6D>ω'<27><>ό?ψ<>ό?«ςΟΊ<CE9F><17>ώ?όvύRϋoVώΏVόώΗώ'ώ<><CF8E>όΑ<CF8C>ψω_δ<5F>BΫώ?νσ?Ϊη<CEAA>¬ϋ<C2AC>r<EFBFBD>ΣοσΟ?iΫ<69><CEAB><EFBFBD>γόη<>8<EFBFBD>Ηώ‡όw;π±<CF80>±<EFBFBD>‰<EFBFBD>c<EFBFBD><13>Gώ—ΰ;9§<03>ϊόoόΠίήωμ?ψϊΫ£<CEAB>Ώϋύύ„ώΓΏ<CE93>συγ{ηΏϊϋ Η<>ύ”Ηο{yΌ~<ώο§<>‡<>ο·?G<>ώομθ――σχαψΏ<CF88>γσΧ—Ώώ<CE8F>~ζΒ<CEB6>Η»λΗη――;Πί:ώο]<5D>γώηΪ{ξ~u<><EFBFBD>ώοτ<CEBF>ηπ“ϊ<E2809C>{η«wΎ[?β<CEB2>!<21>Jώ<4A>Τ~ύοη]ώ<>±υΧk<CEA7> <20>Π<EFBFBD>ϊτ<1F>?KιΏ†όOαί¶ώζΘ<CEB6>υΦ?φςΟςώΗώσμΟ1{V<56>σχΣoΞ£Ώ~~Όέ<7F>ξχ{ζώO<CF8E><4F>Χ³<CEA7>mι<6D>υψ<CF85>^ςO<CF82><4F>υχ<CF85>¶εϊ5<7F>ί¨ό<C2A8>™<EFBFBD>ί®¤ώτ?ϊ<1F>?ώό<7F>ψ<EFBFBD>ρ€?ψƒΏnό§%<25>h<EFBFBD>ό_/ώcKώCΫτ<CEAB>·<EFBFBD><C2B7>χ™ώύσχ»;ώ<>η<EFBFBD>Ηώ‡<CF8E>α;ό<><CF8C><EFBFBD>ύO‹<4F>1φί~κψάόϋγΏΫΗηθΏ|ς<><CF82><EFBFBD>k~Φ^<5E>Δ<EFBFBD>[υoΪ<6F>›?<3F>}πλγsφ'ςF<7F>0©ώm—Ώνγ¥ύ<C2A5>lϋ<6C>΄ιί²ώ―νωΞυ§m<C2A7>b<EFBFBD>Ω¶<CEA9>π<EFBFBD><13>Η<EFBFBD>ώΰOώοHόgά<67>Ώjώ<6A>υό_β<CEB2><7F>ηό+η<>Ω<EFBFBD>qώ<71>σ<EFBFBD>Θ?μ[η<>Ι<EFBFBD>!<21>ϋ<>ό?ψ<>ό?ς<>π<EFBFBD>α<EFBFBD>Γ<EFBFBD>‡ώ<E280A1>\ύ<0F>Γ<EFBFBD>πΏ5ώ<35>ϊzω£|ό<>η{qΚρέ¶ωσσο~ΗυΪψγϊ‹οBό<42>7ψΟGΫΒρ<07>VψΟΗ\ψρψm α‡ςί:ώΫvξrτ'y½Β~%ώοg¬ΏόΪϊoy~<7E>yKψ΄ΑηΫΞύ_μ:|θ7ϊΟ…―-<2D>―Λ<E28095>o<1B>zώw^—δΏΞ<CE8F><CE9E>λφ<CEBB>jλ_?{ώίέ/ΕΏ=ψΥΖKο―·ώ[σ?dωΪϊO<CF8A><4F>ωω<CF89><CF89>Ύω>ζΞ<CEB6>XύS«ς<C2AB>ύϋ_Λπϋν<CF8B>p<EFBFBD>#]<5D>aίΜϋ―ψωΓώ<CE93>ηοmο<6D>΄ϋ―»<E28095>±i<C2B1>χΠ_gώ?kύέOώγ<CF8E>Γ<EFBFBD>‡<EFBFBD>οSόΨπ?τ·Km<7F>γ<EFBFBD>Χ­ϋΚσ3Χ<33>yΏυ=ώ2ψµϋ—ύΏ½ρiόOΫώκΗ?<3F>Ώ³ώz>zβ?«ω<C2AB>[γo³μ<C2B3>γ–μτ?ω_<CF89>ρλχ<>–β<E28093>Ψν?βί¶ρ'<27>Οvόkt<6B>γ―χ™ωOuϋΏ<1C><<3C>ύΎwnL?Οέ<CE9F>­<C2AD>_<EFBFBD><5F>ΧΞ<7F><C2B6>Gό<47>“όΏ+ϊ<>ήΉ<CEAE>κχ?Ν<><CE9D><EFBFBD><EFBFBD>Oώ<4F>Jφo―ύ'Ν<>Χ<EFBFBD><CEA7>β<EFBFBD>“³β<C2B3>ο·<CEBF>‰<EFBFBD>τ9κόύ„υ<03>ϊ ―—ϋώξUO τύ1>ό>Ώ9πγρ__ιηπ·<CF80>ΏΤ<CE8F>)ΕΏ&<26>jψ_ν<5F>ƒί®<CEAF> ?τΧ¦ΏfύΓ»γ?cύ―[<5B>Ώξ<CEBE>ƒΏnύ7ψώ‡<CF8E>mβΟώη„ΓηήχήϋIαKΟώ―5ώ,¥<><C2A5>φ<EFBFBD>σΡ<CEA1>¤ρ_νυ―έ<E28095>fmύ_ΗΖϊΏs<CE8F>τ?ς<>
ω/“Ώσς_­ϊ<C2AD>Π<EFBFBD>vτ?τ‡ώψ<CF8E>‘<EFBFBD><E28098>>η8<7F>Σsώ{FώυΊη<CE8A>­η<C2AD>rώ<72>σ<EFBFBD><CF83><EFBFBD>ηό?η<>9<EFBFBD>ΟωΞ<7F>c<EFBFBD>Ϋ:<3A>OύoΫη<CEAB>9<EFBFBD>Cύψ<7F>ϊ<EFBFBD><CF8A><EFBFBD>·yώ<1F>ώ?όΦϊφΨ3ϊ<33>―{ώώΗώ·Y<C2B7><1F>ψƒΏέψύ_θ<5F>ύ­ϋ<C2AD>τϊ―Q<E28095>Τ¦<CEA4><C2A6>ϊΏΤ<CE8F>Υζ<CEA5>;Ι?{υ?Kώ±<CF8E>!<21><>ώΟΨ<CE9F>Ψ<EFBFBD>Δ<EFBFBD>±<EFBFBD>‰<EFBFBD>#<23>ι<EFBFBD><CEB9><EFBFBD>ϊ[‰<>c<EFBFBD>Α<EFBFBD>Π<EFBFBD>ϊ<EFBFBD>Τ<EFBFBD>£ώγ*τ§ώεϋλ<CF8B><CEBB>ϋ<EFBFBD>Ηλ<CE97>­P<C2AD>¥„Kύ=Ή<><EFBFBD>ϊΤ<7F>¶W<C2B6>ύOύGκΏΩ­<CEA9>†ύ‡όc<CF8C>c[ώ―X<E28095>{<7B>ϊηΦϋ<CEA6>Τχsκ<73>―g<E28095>S<EFBFBD><53>ϊ<EFBFBD>Τ<EFBFBD>§ώΏ%ύΏ’<CE8F>ο<EFBFBD>υ<EFBFBD>Kώ―Ϊϊ›“<E280BA>ƒώG<CF8E>γ<EFBFBD>Η<EFBFBD><CE97><EFBFBD><1F><>»υ<C2BB>ο·?ΏΌάό<CEAC>υΗ΅άwώχιρ>ύSγ¥πSϊ/ώΰώ/IεΛχC>εδ<CEB5>Y~Jρ?δσοw
~<1D>ςψm;_<0F>Ώ<EFBFBD><CE8F>όΧηόόωφ?τ‡ώkΘ?/YώάϋΧvΏ»γ/•<>σζΏηχώ™<CF8E>m;<3B>O]wλ{&<26>§αΧπ©<CF80>O]χ<>ώ‡<CF8E>-σ?ψΫ¶<CEAB>Gβ?Ύ<>ξχ»}όα<CEB1>ύ?<3F>πGθ<47>IγeώΏtόΑ}_<>mϋ_<16>™Q<E284A2>v•ψOμοOΛΣψχΏίνγγί<CEB3>~―΄ώΫρχύξ<CF8D>υίo~~Ό}†ώΏ†~³<>ηέΟoGώϋρ«yϊΏ]ώϊϊ_Z<5F>ΑϊώO›ώ#σί>Ύ><3E>ΪλoϋϋΟΆύ‡<CF8D><E280A1>ψ<EFBFBD>„ώRό[θΧ ύΑό­ΰολ²ςηΤ_=ΎR<CE8E>Ο<EFBFBD>륤κ?ηρ/<2F>j><3E>ώί‡
ΏsΕ<17>»πωγώS-ρ«ψςψ—”ώ²υΏm<CE8F>ωο{ήσοη­Ώ1ϊλπΏΤώ<CEA4>a<EFBFBD>jΦΏ΄.<2E>µϋΏiΛY<7F>·t<C2B7>7/-ύοW<CEBF>u&<26>#<23><>Ψ<7F>λΨ<CEBB>3μΟϋ<>ώψKι<4B>ύ<EFBFBD>ύ<0F>Γ<EFBFBD>Ίόoτ?ώ?όθΫϊώ‡<CF8E>α;όo=<3D>‘ρ<E28098><CF81>ηό<CEB7>xώ¤tύiη’<7F>ύ5αίρόΛΜσ?λ<><CEBB>³yώΥ§WΨ<57>=½?ΘΣ_<CEA3><5F>ί~ώΏ¶?κΉNώ<4E>¬σoιο[Ξ<>­qώ…σ<CF83><7F>g<EFBFBD>ΓώΧΦxΞ<78>P<EFBFBD>‡σΧθ?Ξ<>#<23>ρ<EFBFBD>ΰ<EFBFBD>ƒώ¶όΨπ?τ§ώ υ<>¬Χ<CEA7>W¤Η<C2A4>yΗυ?<13>•κ<E280A2>Ιβ?cρΏuκ?¥ρ―ωίηΥ<CEB7>Ρρ<CEA1>KγgσμO<CEBC>ψρτ?υ<>©<EFBFBD>GόϋΟΆύGόωOώ<4F>έψΧΘώοψέάϊ―:ύ¨<7F>Oύς<7F><CF82><EFBFBD>γ<EFBFBD>Υρ<CEA5>­S<C2AD>_<EFBFBD>¤ρς<>Ι<EFBFBD>ΧΝ<CEA7>—Ωcω<63>λΤ<CEBB>Η<EFBFBD>O<EFBFBD>Okρ<6B>Χ½θαγ<_ϊΊγ<CE8A>Χ<EFBFBD>ά·ιλµϋΗγ¥πkχο}>π<07>ΟΕ<CE9F>U‹$¬RώΎ¤ψ<C2A4>_!ΌώµρυWί~ψ½χ‡ώΠ_‡ώΪυο<>Ώtύ―W<E28095>ΊV<CE8A>κ\λjώ:υίΰψώ·‹Ώuϋ<75>πΕόύ„ώΛ|ηίzω<13>ϋ‡γ<E280A1><CEB3><18>γϊ™ώ―ίΟ…Ζ?„ύ}ϊoΫΉ<CEAB>MN_Ε}n¤τΧ<CEA7>[π―­ΏάΌΔφ<CE94>ϋ><3E>OΝυ―έ<E28095>f…υ/Α†ό»s<C2BB>τ?ς_ΊώΓΎi3δοYώ§ε2ϋ?τ?ϊϊΫ¥?ώβ?Uϋ‡λ\'ώ<>΅φ<CE85>Hό'ξ_2~ώrLώφ<CF8E>/Ϋ3²ώ/RωΟψ_}κϋ<CEBA>ήω—<CF89>??ΏζϊΣ–οcώ—OΫχΉρe<CF81>Ώ|δ<>Θώ/άΟHη_Wώ<57>μ<EFBFBD>ΒυΧ2εύίέψo<CF88><6F>›ψ'ρOμ<4F>»εΏ΄ΧOmΛ<6D>Ρ΄t<7F>_{ώΙ<CF8E>#<23>ώ'<27>Ο<EFBFBD>ό³ξίΕ<CEAF>‡<EFBFBD><0F><>e<EFBFBD><65>Μώ›‘<E280BA>―<1B>‡<EFBFBD>±<EFBFBD>±<EFBFBD>µΞ<C2B5>άύό ψƒ<CF88>gα<67>^ύ―-<2D>¥ϊ? ?ό®Ύ‚ώΠ_‹ώ<E280B9>ϊ_ΫvώώωHΧ—z><3E>υ¬Φ8<CEA6>2V<32>j<EFBFBD>ό—Β—ΦΏ=Σ?δ<>4<EFBFBD>¥υΟ|HΑkΕΏ4Ύτw><3E>Uβ<55>–υχzOρ<4F>σqζνυ―Ν<E28095><CE9D>#<23>Ζλ<CE96>=sη?5Ώώό§λίΩ”Ψ<7F>κρgΖί6ώ<36>ύ<EFBFBD>9ϋ?i<>΄+ϊ―½sύ[ΧΪτ³Ύώξ#<23>ηΕ<CEB7>µγΏΘθΏ|μ?μ?ό<>Π<EFBFBD>ύώ/ϊ_Ϊξ<CEAA>H<EFBFBD>W‹λ<E280B9>ώ?τ<>΅<EFBFBD><CE85>Υώ?Θ?τΏ¬ώλΌώΏΪςίz<CEAF>_μ?δ<>=ω‡ό<E280A1>Υ<EFBFBD>zΜώ_gύKϋοJι<CEB9>ώΏιύ<CEB9>T<EFBFBD>λΨ<CEBB>θ]ώ<>ω'Υ<>:ϋλςύ―λ<E28095>+η?<3F>Ιί™ω<E284A2>νϊGκ<47>A<EFBFBD>£<EFBFBD>ρ<EFBFBD>γ<EFBFBD>Η<EFBFBD><CE97><EFBFBD><1F>ψƒ?ψ_<CF88>ΏτόΣ<ω―£<E28095>­Λθ<7F>ώ<EFBFBD>γ<EFBFBD>iί<69>®δ<C2AE>³ξ<C2B3>Βώ‡<CF8E>αόίΰOώw«<77>qίC<CEAF>cλψ\όKώύ?i<ωψ<7F>{γί9~m|.ώΏΖϊ'ώ/ϋ,¥ίμηyχσΫ‘<CEAB>n=ΟΤ<CE9F>νςΧΧ<CEA7>ΫΦώόΉϊs<CF8A><73>Π£<CEA0>Θό·<CF8C>―ΟΏφϊ[ΗώΖώ³h<C2B3>α<EFBFBD>Η<EFBFBD>GόόΑίzό_<1A>σ/―#<23>mζ<6D><12>c<EFBFBD>ΗωWβ?μ<>8<EFBFBD>ΟωδφΏUόΙ<CF8C>!<21>ϋ<>ό?ψ<>ό?ς<>π<EFBFBD>α<EFBFBD>Γ<EFBFBD>‡ώ·sώ ώ‡<CF8E>α[ό<>zΆ=|ό<>ηγ:ΧΟΧ<CE9F>ό|ύΟ}›Ύ^»<^
Ώv<EFBFBD>ήηϋlό_½HΒώ'=<3D>¥λKzισχΓ<CF87>η―φ<E28095>έϊί‹ώsαkΚwyώ·<<3C>ωλλ•Ομ<CE9F>Ο=Ώ<CE8F>π<7F>λµρΗυ3ώ²όW©ό_©<5F>“λ_<CEBB>ο<15>~ώόΏ»<CE8F><C2BB>ΓΧΗ?Η<>©υWο_<CEBF>ω_ύKσ?dωΪϊO<CF8A><4F>q<EFBFBD>pώ<70>yn<79><6E>ηcξό<CEBE>Υ?µ(<28>°<EFBFBD>ΩίZΏήoΏ†/ιϊ<CEB9>ν—ϊχ_εηνί<CEBD>}ξώO»<4F>°ώώΗΊύ―K?λλο<CEBB>ς<1F>ώ?ό<CF8C>ΰ<EFBFBD>Γώƒ<CF8E>΅Ώeϋ_ί<5F>¨ ίΊύ76<37>σό<CF83>χ\<5C>sύΏ<CF8D>ώ<EFBFBD> <0B><>^όG<1A>Σ¶ΏΖπηίΕ‘<CE95>?–<>¥ψΟZώ<5A>ΎψΩόύ<CF8C>{γΔ<7F>Ρ<EFBFBD>–γ?-ροX^ΕςL:<3A>ΪςίzόϋΟ®ύGόωOώ<4F>έψ—d<E28094>γτΏDώϋ“mk·<6B>SρΟ<CF81>ψΰzτ<7A>ύ?w<>·Ϊώ<CEAA><CF8E>όΟόgλωΔ<7F>?Ι<>«ι<C2AB>Σί<CEAF>ψ<EFBFBD>ζΕΘ<7F>'<27>µό<C2B5>ϋoFώΏfό<17><><08>Μ‹<CE9C>λΨ<CEBB>Δ<EFBFBD><CE94>ρGΙψύ+σΚύ®6Ύφ=π<>όχΓOϋ<1F><><EFBFBD>|‰ύWΓ―αί¶<CEAF>.ϋ?4αCθ―M<E28095>sύιΈ~µϋ<C2B5>Xύλ|ύι»γχωOο?βύ›σΔϋ<CE94>9ψηαΧρoΩ–φ?π?όo<CF8C><6F>νβΟώ# ίϊ»υύ<CF85>σ/–―KηyUϋΏ?νω›1<E280BA>iωλδl|ύω<CF8D>7~]ύ/{ώ»Μ?ϊωΏΆό—όe<CF8C>‡ώ·®<C2B7>΅?τΗ<CF84>oYώΫ><3E> ώγό5<7F><01>zψ<7A>ωqήά<CEAE>σηόΏt^^:<3A>ΞΗ«<16>jΛ<6A>λƒί›<11><>=<3D>“<EFBFBD><E2809C>φόΛώιό?χΌ<CF87><CE8C>©λΏΠ~έwΩώΊv<CE8A>ηc.ό}<7D>µ<EFBFBD>· <20>OλΏϊω,―$τΧ–<CEA7>5|kλ/7/­σΉβϊΧΎ®Νw<7F>?δπ―;<3B>;―<>Η=Ο?<>ωίΦύOzΏ2gύ<67>οΏ<CEBF>φj|Ιώ?ΓΟ<CE93>o³<>Λφό―Ν<E28095>γϋο+ΦΏφώί<CF8E>ό£ώ'ώ?όψ<7F>μΦ<CEBC>·<>f¬?mϋ ώΗώ·m<C2B7>«―?ΰψ7”<37>οƒ<C692>ό_ >τ‡ώτ?Ώ<>ύΌσz<1C>Κ]ρ<>7>|?Ξ•Έωwµ²όϋ_5<5F>ύπΛγύο·Ν?7“¥Oηϋάωχk#<23>ΰ<1F>―}ήδπ«­ΏΦρΉΟk¬mώΏ<CF8E>ό»ϋό[—vνέψ<CEAD>~όΫ:ώΨ<CF8E>ν<C2B6>}ε§[?~}Ψqωλί<CEBB>χ;Ό<>:λί®ώ›C©ό›·ώβρmψ£<CF88>tβ<74>Ϊρ_δΏuϊ<75>Χo£<18><>ϋ`<60>a<EFBFBD>α<EFBFBD>‡ώzτ_±ώΤ=κ_iΧίΌΎυω·΄ώ¥ώcι»nύg9~R<>Ώφ»Δ<C2BB>0―ώx~ό?<3F>µώ<C2B5>χ¬?δϊgµϊ<C2B5>ύςK<CF82>΄ε
<EFBFBD>ρηηόΑΘ?δπeπµίµΧψήj^5<>ύπΛγKίΟΩ<CE9F>ΝέjΫ<6A>φτ<CF86>Zό?ωwχω·+<2B>Ψ<EFBFBD>­η<C2AD>{§ό<C2A7>£¤ώτ?ϊ<1F>?ώό<7F>ψ<EFBFBD>ι|ΰ<03>ώοτ<CF84>ώΠ<CF8E>ώίτ<CEAF>~oόΏ-<2D>tώΊφ7ό<0F>Ϋζϊ<7F>Ϊήμ{8ΎφΉχ½χ~Rψ<52>ίΗΛ}›w<7F>Ϊύζΐ<CEB6>ΗΣ<CE97>—ώ―¥ώσ®_Π±~ΒψΑΎΛβρψ:<3A>ΏsύKβ'sζ_;ώ“£<E2809C>΅?<3F>λ£ϊ?/<2F><>Οί?­<>γρ5ύo]ώ<>χ<EFBFBD>“κ<E2809C>Z<EFBFBD>²<EFBFBD>>ΏΊ<CE8F><CE8A>ΥώΟΪτί¶¶υu<7F>Λ±υΧή<CEA7>PΫώΕώΓώΓ<CF8E>Oό‡ώ‹ΐΎΥώ<CEA5>τ<EFBFBD>΅<EFBFBD>ύ¬φ<C2AC>΅<EFBFBD>µmω_ο__~—ΞΏ6<CE8F>IρΣ<CF81>?ψω‡όώ]ϋ<>έ<19>OμΏ<CEBC>ύO<CF8D>Oψί.<2E>[Γύ<><CF8D><0F>ϊύ<0F>Γ<EFBFBD>πΏ%ώ·<CF8E><C2B7>ώ<>αό<CEB1>Ύ—σ'<27>οFσΏΚωίϊω<CF8A>δ<EFBFBD>Ϊ¦<CEAA>ΎΟ…ΣίCψξώk<CF8E>YοόΟ;σ<>9<EFBFBD>›λ<19>JΥ/›‘<E280BA>_κW?<3F>#οg=<3D>_σόΩΊη<CE8A>-<2D><>γό?η<>Ω<EFBFBD>sώ<73>σ?6λ<36><CEBB><EFBFBD><EFBFBD>n“ΏξώΎΝµΞώϋ<>σ<EFBFBD><CF83><EFBFBD>Η<EFBFBD>‡<EFBFBD><0F><>=<3D>φηΏ΅ΏMϊS<CF8A><0F>Η
uHVσΏYy—Ζ¤ρΏμ?i<>'ιω»Uκ<55>εγgΗυΡϊίµύ<C2B5>zρ?+φ?ϊ<>ό/κ<>Ω<EFBFBD><CEA9>c<EFBFBD>Ω¶<CEA9><C2B6>#<23>Ι<EFBFBD>³<1B>’φ/<2F>³<EFBFBD>\―<>υ<>©<EFBFBD>Oύβ<7F>β<>+ϊ<>ήY<CEAE>_Άζ<7F>%<25><>όMϋwN<77>ϊQύ£<1D>Ε<EFBFBD>O<EFBFBD>O»ω!}<7D>ηΛΡ<CE9B><<>g<γο?>®K’®<E28099>r®<72>ς.ψW?Ώ6|θύuεΗωύχϋ<CF87>Χο<CEA7><CEBF>½η_ϊ'η<>Ϊύ―}~ψώ·Μ<C2B7>ΰoΣώΏwύi9|θ―[<5B>U[<5B>κΧ]…<>Βχ<CE92>ότΒ/<2F>χΏ_IώΞΓ<CE9E>ξσ<CEBE>ώGώkΤ<6B>Φ•ΏΦχθτ?τ·Kό<7F>ψ<EFBFBD>άωΞγ|bξόηόxΌ;<3B>•/…<>Κ<EFBFBD>βί<CEB2>/­<>p―Xϊά<1B>ρΗΏrQ<72>υ™–<E284A2>ξχνλΏ4ΎMώKγORω―·<E28095><C2B7>C™όΫ¶6ψ-ρΏ–η=<3D>~ήϊKΩΜξώώyύ<79>Nω/«<>ΠfΊϋ<CE8A>ι_Ξ<5F>ƒί“<CEAF><E2809C><EFBFBD>'¦iύ<69>ν<EFBFBD>JτΧ–<CEA7>γψ·ο<C2B7>|όcώΧ^<5E>ΦγoΔ?±±<7F>Λφy‹ύ%µ<>υχ<CF85>Rό¥ϋ<C2A5>yσ<79><CF83>_ς<5F>Θ<EFBFBD>ƒ<EFBFBD>Ι<EFBFBD>λ§Ο§Λ?όίψ<CEAF>π<EFBFBD>α<EFBFBD>³θ<C2B3>›g<E280BA>IΟ<49>hΗνς?φ?ηΟxΖsώ<73>ό/Ξ<>C‹ωί:ηOΦ‰Ωτ<CEA9>εθ_Ϊ+§~'Ο?Φ±<CEA6>Ι<EFBFBD>ηόη<>8<EFBFBD>Gό<47>όΛω<CE9B>Ψ<EFBFBD>Δ<EFBFBD>‰<EFBFBD><13>'ώo[<5B>Υβ<CEA5>#ς«-ώ«<1D>ηό§Uϊ<13>ΗώΓ<CF8E>ύ­ϊ<C2AD>µϋΟhΒ?Ζ»οb<CEBF>ρυΟo}ώ­―©<7F>Ω<EFBFBD>#ωύh]ΒλρχeωU§ίΥώ<CEA5>3ύ<33>?υω«Ν³|ώΗόRώkΏϊοZ<CEBF>Νυλω‡ώΧ¦Ώ$ώ,<2C><>uδΏV<CE8F>1ψω‡όcΌφϊΧ±?ΧY<CEA7><59>?)ύtώζν<CEB6>¤ϊ_ΗώG<CF8E>λς<CEBB>ηΘΏ»ΟΏMω‡ώΧυ<CEA7>iΛίyϊGκ<47>A<EFBFBD>£<EFBFBD>ρ<EFBFBD>γ<EFBFBD>Η<EFBFBD><CE97><EFBFBD><1F>π<>όwκ<CEBA>ψΟ
φφτΗ<CF84>gΣ<67>oέ<6F>§½<C2A7><C2BD>·<EFBFBD>ΊΆώό<0F>><3E>ƒΏmϋίΓρΗw―Ορυ~ξωKγχ½<^
?<1E>χS<1E>Γ<EFBFBD><CE93>Ώγϊθό»ϋ<1F><>ΑΘΣ_
??bϋό^ν<>ϊΧζEϋ_ϊόο<CF8C>?ιxΗ/m<>{ίΫξ§·ώGρ<47>K?½χ}~ΏΟηιGτ›ό“ΒΟ<CE92>―ιλς?Χ<>/<2F>ΟqωUΣ<55>Ήώg­ϊ??ΎMώZί<5A>­J<C2AD>–υ?£<>έΎΟ]ΟGyώάύΦ°±<7F>lΫψ<7F>ρ<EFBFBD>ψΐηόΏµό_λωΔ<7F>Π<EFBFBD>Ϊφη<CF86>γ­η±<7F>³³<C2B3>ƒ<EFBFBD><C692>μoλπΙ<CF80>!<21>ϋ<>ό?ψ<>ό?ς<>π<EFBFBD>α<EFBFBD>Γ<EFBFBD>‡ώηό?ό<0F>Γ<EFBFBD><CE93>Λ<EFBFBD>__―|,?<3F>ιθΟςz<CF82>γ»mσύ›<CF8D>ξχΊΎmαψ<17>ώψγϊΡ<CF8A>Δυyύ~.όxΌ»~Τgπηό<><CF8C>ςσ»QcψeψGΏ#ΧΏΨυ':ϊ!Ή~Ea<45>γλ?μ›|†_[<5B>ηη<CEB7><CEB7>?μΏ<CEBC>ϊ>…—ƒ_<C692><5F>άΌ΄Β‡ώΪτίχΉπc8ξώ©ωΤ–<CEA4>ςόoYώs
<EFBFBD>πz¬<EFBFBD><EFBFBD><EFBFBD>Ύρgώz>ζδΏΞΰ?ύώοηυΪΣiϊϋπΚτ9ΫW¥ω/υίkΑ?έ<>ΟρίσQη<51><CEB7>Jψ¥τGι~ηϋ―Έώ¥ηgΪΗkλΏ+<2B><>Nσo]ώ±<CF8E>`<60>o<19>Ϊώ§΄_<CE84>³<EFBFBD>ΠέYί<59>εν<CEB5>s<EFBFBD>α1ωλοβώΟ+μ°<7F>Gι?Cώ•Ξ<E280A2><CE9E>­ΏΎσΏΘόψ<7F>π<EFBFBD>Yυ<59>a<EFBFBD>Yηθo™ώ5<CF8E>lΏ<6C>±Ο<C2B1>«ν<C2AB>Δ<EFBFBD>!σ_^q]Ϋ<>¦<EFBFBD><C2A6>;―Kγ?<3F>ψ<EFBFBD>¶ύw<CF8D>?¥ςΡςώσzό§ό®ο<C2AE>ίχ‘ψΫ,ϋΕψ<CE95>%ϋύOώWOΌzΫζΖ<CEB6>Wά<57>[<5B><>c<EFBFBD>Ω¶<CEA9><C2B6>Ϋ†Oώ<4F>νψΧθώ§]<5D>χε?½ή<C2BD>¶ξ<C2B6>¦Η—μ<E28094>ηCbίHχ«ν<C2AB>WΰύψΏ¥ό?β<>–ύΏ+ϊ<>dϋ―}—ψίzτΟ<CF84>ψω<>δ<EFBFBD>―”<E28095>ίk<CEAF>Iυ<49>vό<15>‹όKΟΧω<>ΧΫ<CEA7>Δ<EFBFBD><CE94>λG½€ψύ+σΚύ®6Ύφ=π<>όχΓ—Κ<E28094>«αΧπΏΪ<CE8F>z5|θύµι―Yθξψί}ώ¥ώ‡9ψλΦί‚<CEAF>αΫόoφiψΦί­ο<C2AD>ZύΗ<CF8D>y^ΥώoΕO{ώfΜΏf<CE8F>™uυΏμωο2<CEBF>θδ<7F><CEB4>ς<EFBFBD>]ς—ύϊίΊώ‡ώΠ<1F>ΏeωOύ?Ξ<>sώ†σ?ύηΏgΤ<67>[σό?ωΏ<CF89><CE8F>ηό?η<>9<EFBFBD>ΟωΞ<7F>sώ<73>σ<EFBFBD>ΨίΦΞ<CEA6>[©<>ΝωΞ<7F>P<EFBFBD><50>ϊ<EFBFBD>Τ<EFBFBD>ηό?η<>ρ<EFBFBD>α<EFBFBD>Γ<EFBFBD>g©<67>ηΈύ7cύ­yώί<12>c<EFBFBD>Ϋ®<CEAB>|ΰίnό‡ώ/τ<><CF84>ώvύλυ<CEBB>~oύSλώ?κ<>Ϊ®<CEAA>»<1E>ίIώέΏώ―mωΗώƒόΫύ<CEAB>±<EFBFBD>‰<EFBFBD><13>'ώOόί¦ό·ή<C2B7>έΊ<CEAD>Ο:ύmΗ<6D>±<EFBFBD>π<EFBFBD>Cκ<7F>σNύGζίΦϋ<1C>±¬ώ<C2AC>vύ—ώ£Οίη<CEAF>Χ®<CEA7>Gύo«υΠχΤ¤ώ›έϊoπσΝώΗ¶ό_±ώ·~ύsλύΪφΧν?uνκ<7F>S<EFBFBD><53>ϊ<EFBFBD>Τ<EFBFBD>·΅<C2B7>Χσ<CEA7>½³ώΏD<CE8F>Μρ?Ά<>Ρ<EFBFBD>ψ<EFBFBD>ρ<EFBFBD>γ<EFBFBD>Η<EFBFBD><CE97>nύθ§β9<CEB2>―Η<E28095>g<γΧρ΅|?δSNώ<4E>εηµπ―~mψΠϊ―!?΄<>ξ<EFBFBD><CEBE>=ηί­Οσ{Λυyό_»<5F>5Ο<0F>Γ<EFBFBD>–ωόmΫ<6D>ξό§σΈσ“ώoΖύΟξώώ™ΛΌ<CE9B>[
?_ς<CF82>~ϋχ½ςπΗζ?ογ<CEBF>/…<>ΒΏDΙωciόA[<5B>κϋυγ?ϋϊϋέϊρωΓύίχ;<3B>~—ΏχΗίΗχΧ^<5E>?εη<CEB5>qIγ?><3E>sΰ—Η—ξ[Άw<CE86>^νϊ³MώIαKoWώKκΜΠ<CE9C>ωϊuύ/­<>`}<7D>§M<C2A7>Τόυ¬<CF85>ςψ6ύΏοsΧ__ύ]ϋϋΟ¶ύ‡<CF8D><E280A1>ψ<EFBFBD>xώΟxΖίzΌτO‰λΆ¤λ?—<>Ώ<>Ό<16>N<EFBFBD><4E>Ύ<~%<25>)ύ―]W?ΏφϊΣβ<CEA3>υκΟΏΎuω―έ<E28095>M›<4D>τϋΐΘ?δγµΗλΪ<CEBB>χΗ<CF87>ήσ<CEAE>ύoΣώ‡<CF8E>απG<CF80>γ<EFBFBD>Γ<EFBFBD>‡ώ·«<C2B7>αψώ·Η<C2B7>ΦσΑ<>σσΦΟ<CEA6>»όΞtώdx½?©΄ώµσ?Ι<>‚ώyόΗΰΗτ<CE97>ηΟΟ<CE9F>]'<27>_ηόΟ
η<EFBFBD>,<2C>υιύ|<7C>ιοΦ―ϋΏ_n^ώΏ{ο9<CEBF>S_Ϋ?<3F><>―ώLϋό‹υσ<CF83><7F>·½`<60>oΞ<7F>P<EFBFBD>gΞωοφσΨ+<2B><>G<EFBFBD>qώίΊόΗ<CF8C>‡<EFBFBD><0F><>M<EFBFBD>φόύ©<CF8D>Bύ?»υ<C2BB>4λ<34>¬γ<C2AC>Υ«Ώ·Jύ?Yόg,ώ·Bύ§ηγόήκ<CEBA>W<EFBFBD>GΗ<47>Σ7E<37>ψzoύο6ϋ_'ώGόύOύgκ<67><11>Ηώ³h<C2B3><11>Fώ[Ο<>³<1C><>νbϋy$<24>―­ώ¨N<C2A8>κ<>S<EFBFBD><53>ϊ<EFBFBD>Δ<EFBFBD>©<EFBFBD>―γ<E28095>[§ώΏT<CE8F>Hγ?δ<>“<EFBFBD>―Y<E28095>_j<5F><6A>ϋ<EFBFBD>Χ¨<CEA7>oΧ<6F>O<EFBFBD>O«ρ<C2AB>Χ“Όd†ο?=δSϊΊ{ώΧ<CF8E>ά·ιλµϋΗγ¥πkχο}>π<07>ΟΕ<CE9F>ίo_ΫΦφ9|Iρ?ΏBx5όkγλ―2Ύύπ{ού΅Ώύεωί²ό‡»γ/]<5D>mρλήω—δΏΏΦη±ί?Γ?ΧΊ<CEA7>ƒ<EFBFBD>¶µΑo©Ώ<15>ΟΧί‚<CEAF>αψί.ώΦν<CEA6>Γίωχϊ?sπ<73>λεO<ξ<1F>>bό<62>λgϊΏ~?ώ<19>>τχιθKΧΏ&――β>7RϊkΫ<6B>-ψΧΦ_n^b{Δ}Ξ§ζϊ—ηΚβ+¬ ώ3δ_)ώ96<39>½ρOτ?ς_Gώ<47>ϋ¦Ν<C2A6>Ώgω<67>–Λμ<CE9B>Π<EFBFBD>θθo—ώψ<CF8E>‰<EFBFBD>Tν®s<C2AE>ψ<EFBFBD>‡Ϊ<E280A1>#ρ_<5F>μcωί+ϋΖ—ν™^όΟϋG‰όΏgό―<CF8C>>υύοόKΖ<4B><CE96>_sύiΛχ1<CF87>ΏΛη<CE9B>νϋάψ²<CF88>_>ςd<7F>ξg¤σ―+<2B>Gφαϊk™Ώςώοnό7Ο<37>Mό“ψ'φ<>ές_JφWΏύ―k<E28095>θ>Ώφό“<CF8C>GώόOώ<4F>UωgέΏ‹<CE8F><0F>ώ?Λώ?™ύ7#<23>_7ώ<0F>c<EFBFBD>c<EFBFBD>k<EFBFBD><6B>Ήϋωπ<07>ΟΒ<CE9F>½ϊ_[ώKυ~ψ]}<7D>ύ΅Ώύ¥υίό9ΜΥσοίW<CEAF>ο<EFBFBD>η_Ζϊ_Μ“<CE9C>Rψ<52>ϊwgϊ‡ό‘¦³΄ώ<CE84>Ο)x­ψ—Ζ—ώΞηΏJόί²ώ^ο)ώ>Ξό―½ώµω<C2B5>sδίxύΗηcξό§ζΧ<CEB6><CEA7>t<EFBFBD>›ςϋ_=ώΜψΫΖ<CEAB>±<EFBFBD>?g<>W•Ώ_Χ^<5E>Φυ<CEA6>6ύ¬―ΏϋΘ<CF8B>yρνψ/ςϊ―ϋϋ<0F>?τΏ<7F>Λn<CE9B>_ϊ?ιΡ<CEB9>ώΧϊύ4ϋ­Σ<C2AD>9<EFBFBD>­<7F>αΌώOσϊ/¦ϊe•ϊ<E280A2>HόRω§έ<C2A7>«l?<3F>­Ώϋω‡ώ_ƒώcρηyύ<79>΄εΏέώΨΘ?«ςω―Ϋ<E28095>{<7B>υo³<6F>5ύΡ<7F><CEA1>ό<EFBFBD>9ςO<CF82><4F>uφ<75>Φεϊ_Χ<5F>WΞ“Ώ3σ<33>Ϋυ<CEAB>Τ<EFBFBD>ƒώG<CF8E>γ<EFBFBD>Η<EFBFBD><CE97><EFBFBD><1F>?ώ/+ώOπ<07>5πΧ‰<CEA7>hΫ<68>ΨΠϊΫυ<CEAB>[χ<>iο<69>kη<6B>Ϋχ_cη<63>αψώμ<7F>σψΧηψϊΏ<CF8A>;ψ<><>7<>ώψίοφρ9ϊ―<01>¬<EFBFBD>ώ~RΧCϋ?µ~<7E>~ϊζUϋ?χό?εη>ΚσηξWζ<57>Vψµρ?ερ9ω<39>ήΟΪλΏύyΣογλ<CEB3>οgόyΏ―ιί΄=7ώϋΰΧΗημOδ<CEB4>ό<EFBFBD>εΧύΫ.ΫΗχ<?ώΏΥθί²ώ·­έ™›<E284A2>5Φ<35>¶ύ‹ύgΫώΓ<CF8E>Οωόΰώ<><CF8E>·“<C2B7>k=<3D><>ψϊίηΪ<CEB7>cώ/mϋ—ό/φ–χλρ?ςω‡ύOώω?Ψ<>Ψ<EFBFBD>π?όOώωψ<7F>π<EFBFBD>΅<EFBFBD>Ρ<EFBFBD>π?ό<0F>Γ<EFBFBD>Rώ<52>ϊzω£|ό<>η{qΚρέ¶ωσσο~ΗυΪψγϊQ_ΑΗψwƒ<77>|„π·-ΐi…<69>|Μ…<1F>wΧ<77>ϊΎό·<CF8C><C2B7><EFBFBD>ϋo[ΨΕοWμ<57>~Ζϊ«Α―­<E28095>–ηχ<CEB7>·„Oόpώ·νά<CEBD>9μS†ύοF<CEBF>Ήπµε<C2B5>uωσmγSΟ<53>Ξλ’όΧς•ώοώϊMΩΣ1ύ|x3ηΏΤλΌ~¶­}όσqξΏ•ζ<E280A2>όjγ¥χΧ[<5B>­ω²όmύ'Ε<>όόΟGίό?sη?<1E>|”ΗΫ–μΨ<7F>Z†ίo<CEAF>‡ϋιϊχο7g<37>?ΏΟ<CE8F>q<EFBFBD>NφύςΏlυ<7F>Ώ\w<>cΣώο΅ΏΞόΦϊ»<CF8A>όΗ<CF8C>‡<EFBFBD><0F>ί§ψ<C2A7>°<EFBFBD>ΰθo—ώΪώΗ―[χ?”ηg®<67>σ~λ<>zόeπkχ/ϋ{γ?<3F>ψ<EFBFBD>¶ύΥ<CF8D>8gύυ|τΔVσ<56>·ΖίfΩ<66>+Ζ<>,Ω<>θςΏ4γΧ+ξ<>-Ε<>±<EFBFBD>lΫΔΏmγOώ<4F>νψΧθώΗ_ο3σ<33>κφ9ώyϊ<>|οά<CEBF>~<7E>»<EFBFBD>[m<>Ώ<02>―<EFBFBD><E28095>l=<3D><>ψ<EFBFBD>'ωWτ<57>½s<C2BD>Υο<CEBF><1B>!<21><>ό<EFBFBD>•μί^ϋO<CF8B><4F>―<1D>Ε<EFBFBD>?&<26>fΕ<66>ίo<CEAF><13>?θσzΉz m<>{_½χ“Β—ώόΑίώ±|‰εsϊz,?Ζρ?δΣρ<CEA3>~ <0A>Ϊψτuχό5όΗΰχήϊCϊ‡ύέψ\ύ΅sύ WKκ|ίάψuδ<75>ιϊOΟ<4F>tώSυ<53>~ΏΣγCϋϊX<CF8A>9<EFBFBD>Cμ?<3F>γΨηΏί)ψuόΛγ·ν|έ~ψώ·Ν<C2B7>ρ·n<C2B7>υ<02>~Βϊ<CE92>9ψαο^υKίγΓοσχ›<03><>ϊΉ Ώ4<CE8F>EJmϋΏ†mύIύ<49>Ϊλ_»ώω
λ_‚ΏtύλΧE<EFBFBD>#<23>υδ-ώ1&Ϋγμ<>Π<EFBFBD>Φυ?τ·Kό<7F>Δ<CE94>τη:Χ3ό/]<5D>mόΫ <1E>:ώηψΟ¶•ς―Ξω“#ρ£πωJυfZζ―6Ύ\Ο¦<17>sό¨ώ<C2A8>Α―Ε―ςπ¥ρ/)ύ¥ςelώ%γΟΟ―Ήώ΄ε»υσΘέϊϊς<CF8A>ϊ<1F>η<EFBFBD>WX<57>–Οc<7F>c<EFBFBD>KμχφΏ®ύ£ϋόΪσ?f?‡»Ιϊwϋ—mΩµ<7F><C2B5>Οό΄οΟZψO²<4F>ƒ<EFBFBD>οΘ<CEBF>σδ<CF83>zϋ[ςΟΊ<17>ώ?ό–ύ2ϋ/½ώ\υ6ώ/σKΏύu><3E><>{Α<>Ψ<EFBFBD>Ψ<EFBFBD>γφ―”<E28095>οi<CEBF>‚?ψ*ώοΥ<CEBF>Ϊς_<CF82><5F>ΣπΓοκϋ'θύµθοΞΏΔυ®^4τkd…υ—^ηVό9τλKύ~<7E>ΗίϋχΧ®γ?_κΊ[ί3εΏ~~||έ_ΆΘi:§ζίΡΏ^Ση<CEA3>ΌVόKγK²ϊ<C2B2>ιϊcn^Zκ®R<C2AE>Q‡<51>?Gώ<47>­<EFBFBD>xήfΜj~ύω<CF8D>ωΗ²όΓώW<CF8E>?3ώ¶ρμ<7F>ΟΩ<CE9F>UεοΕΧµΧΏuύ§M?λλο>ς^ό_;ώ‹ό‡ώkΑΗώΓώΓ<CF8E>ύίο<CEAF><CEBF>¨<EFBFBD>uχϊW<CF8A>ϊ§ϊυ?µιoνυ/υϋq¤Ώ<C2A4>σχώ~λο§Χ<C2A7>uύη:ώ©xείΟ\<5C>ΏΏ^ψ©ω<C2A9>Η<EFBFBD>~§ι2Γ<32>/•5<7F>Eκσοχ»ό<C2BB>cλ―ΗώAώ΅<CF8E>Χ <CEA7>XόYJ<59>uδ
<EFBFBD>ϊϊ›'<27>µυ?φςΟ<CF82>όCώ‡φω ϋ³Ηώ_gύηνΝ’ύ9<CF8D>ώRψcΏ<63>·<EFBFBD>“κϋύ―Λ<E28095><CE9B>#<23>¤ϊ_g<5F>o]ώ΅<CF8E>uύεόη1ω;3<>Ώ]<5D>Hύ?θτ?ώό<7F>ψ<EFBFBD>ρ<EFBFBD>Σ<EFBFBD><CEA3>ώοΰώτ§<7F> τ‡ώτ<CF8E>¦<EFBFBD>χ5ώΩωW9ώΊϋ?ψώ·Ν<C2B7>τ<EFBFBD>µl<C2B5>ώΒΎώ“η~<7E>µρΉώ<CE89>Ϊπ­¦<7F>+ύϋσί=CύQ<><7F>¬°ώ%ω3ϊ<33>ί/<2F>oζόΛΰk?ΏMως³D<C2B3><44>Ι_wΏ«ϋ<C2AB>}ώώO—ώcσί>^Ϊ<>ςκυ§m<C2A7>b<EFBFBD>Ω¶<CEA9>π<EFBFBD><13>΅<EFBFBD>#ψƒ?ύ?ι<>C<EFBFBD>ϊ<>Xλ<58>C<EFBFBD>kΫςί[ϊΧϋυκύ:χ3ϊΏλΚ<CEBB>:ώµυ—›—XΉοΓωΤ\<5C>Ϊό<CEAA>όCώa<CF8E>Ϋν<CEAB>wwό?―<>7φ?ύ?α»όo τ?ώ?όθτ?ό<0F>Γ<EFBFBD>Φψ<CEA6>|x>sώ<73>σ<EFBFBD>£ω“<CF89>υ¤<CF85><C2A4>IώτΧ„Οσ/σΞ<CF83>θη?[?<3F>;R<>ζω<CEB6>‘ϊ[νγλυ·Θ<C2B7>Χ¬ΏΒωΞ<>qώ<71>ύϋ[‹<>9<EFBFBD>CύΛη―±<E28095>9<EFBFBD><39>όΗ<CF8C>ƒ<EFBFBD>ϊ[τ<>a<EFBFBD>Α<EFBFBD>Πί.ύ©<CF8D>gϋσΨόΟσήsύΟΓ¥ϊ#ρiόo…ϊO’ώO3Ξ<33>ιϊ<CEB9>eρ3ωώ_7ώgέώG<CF8E>Ϋ<EFBFBD><CEAB>P<EFBFBD>ΟvόϋΟ¶ύGόωOώ<4F>έψΧΨώo^ύΧϊΏR<CE8F><52>ϊ<EFBFBD>δ<EFBFBD><11>·Z<C2B7>_Σ<5F>§½<C2A7>’φ–<7F>%<25><>ό<EFBFBD>5ς<35>Gμ?iώ<69>
υ<EFBFBD>ρ<EFBFBD>Σ<EFBFBD>Σr<EFBFBD>—ƒ<EFBFBD>ύυΦοpσwζWC£<ή­<CEAE>x<EFBFBD>|ΰψ―wW'%όόϋwΑoΗ?=ήΥ_kΑ¬ϊC ϊ‡ο‡]ιΰ;[ρψ]Ώ<ή<>ήΥϋ$όο><3E>αϋ¶¥<C2B6>rΏ›<CE8F> ·<17>άsηρ<CEB7><CF81>αψί.ώΨ<CF8E>ώxη—<CEB7>―‡π?uΌυύί™/·­ν³tώΧ°<CEA7>λψ—<CF88>_oώFΗ<46>ίί{}-ύ/}ώϋΝ?ϊωΏ<CF89>όΧ“Ώψ<CE8F>Π<EFBFBD>υ?τ‡ώψ<CF8E>-ΚIώO |Ώ<>ι9<CEB9>κ<EFBFBD>Ώ~*<2A>ό‰Ώ΄ώ<CE84>ΎrύSόό°Zό'Ώ<>ςοος…sϋ―R<E28095>—6ω›κ<E280BA>R—Ώ<E28094>ψ“TώλνηΠ_*<2A>ϊαηπ<CEB7>ΗΧβϋ>wύΕτϋ»γΫ¶¶ώϋϋI]ο·?γρώω<CF8E>ώ£πγρψ<CF81>{θΏmiy0Ύι£<CEB9>ϋε<CF8B>ώνϋΏ4ώωω[aύ[<5B>Ώ<11>Δώ¶n<C2B6>Ηφϋ¨ύΩg<CEA9>kΩ?RόηΫΏ£σ<1F>'<27><>ό?ψ<>όΏήύΏω‡<CF89><1B>ώ?όVύsμΏYωWZφ—]ώΗώ'<27> ψΐ>πΙ<CF80>"<22>ϊsώWϋό<CF8B>φω'ληϋίηΞΏ¶ύΟω?Ξ<>qώ<71>σφςΏΘ<CE8F>·<EFBFBD><C2B7><EFBFBD>ύOό<4F>ψ?ρβ<7F>6υ_kό³]ώχα―<15>ηό§Uϊ<13>ΗώΓ<CF8E> ύ­<CF8D>?ξ?qψ…^<5E>γλa<CEBB>‰O<1D>ϋ<EFBFBD>κ<EFBFBD>ΣΦ#5>ΧcUψΦηί<CEB7>ϊ—ϊ<E28094>¥οyωW§<57>;ό<>#Οίγ<CEAF>Χ~—ψfπ_ ~ό?<3F>µώ<C2B5>χ¬?δϊGώω%Υ?Ϊς?…<>ψσΏsώΰ?δςψ2ψΪοΪλ?|oµ?―<><E28095>~ψερ¥οημ<CEB7>ζξ?µν{ϊ-ώΏ<CF8E>ό»ϋόΫ•μ<7F>Φσ<CEA6>½SώΞΡ?R<>ϊύ<><CF8D><1F>?ώό<7F>ψ?€|ΰλΕZσ<5A>®…―<17>±$<24>΅?ϊ<1F> ώμψώ·κ<C2B7>Ζ<EFBFBD>oΥώίχpόΎ‡ώΓ}—ωγρϋ^/…Ώο}ώΟώΗόΧGηίέ<CEAF>ψόF<>ώRψρxς<78>Θ<EFBFBD>«―<C2AB>η£υsο{ΫύτΦΏυψ<CF88>>ρωQύί&<26>¤πσγkϊίΊό—φ<E28094>“κ<E2809C>|<7C>²6ύ]<5D>?ϋΏUιί²ώ―ν9¶ώzϋjΫΏΨδΰ<7F>'ώ|ΰ<03>όί±ψ<C2B1>4ώ΄Vώ<56>υό_β<CEB2><7F>ηό+η<>Ω<EFBFBD>qώ<71>σ<EFBFBD>Μ?φ·­σ<C2AD>δ<EFBFBD><CEB4><EFBFBD>‡ύOώόOώωψ<7F>π<EFBFBD>α<EFBFBD>C<EFBFBD>ςω/ψώ‡<CF8E>νρ<CEBD>ΧΧ+ΛΟ:ϊ³Ό<C2B3>τψnΫ|<7C>ζΏϋ½®o[8ώ…§?ώΈώϊ>μ<>ςοίΉπγρΫΒηό<><CF8C>ςσ»QcψeψΫvξtτ'z½Β~E~<7E>“λ?ξ›Γ―­<E28095>σsΕΟφ_I}<7D>ΒΛΑ/Οn^ZαCmϊοϋ\ψ1<CF88>°<EFBFBD>W<<3C>Ϊς_<CF82><5F>-ΛNα^<5E>υσσΡ7ώΜ_ΟΗ<CE9F>όΧό·n<C2B7>Ώ<EFBFBD>^¥~υeϊ<65>ν«<CEBD>όΏ»<CE8F>_<EFBFBD><5F>c~(α—<CEB1>¥ϋ<C2A5>οΏβϊ—<CF8A><E28094>i―­<E28095>®xώ;ΝΏuωΗώƒύΏeόkϋ<6B><CF8B>~iΞώCw<43>e}<7D>§έ<C2A7>\<>ƒύ?J<>ςO»<4F>5ς<1F>ώ?όVύΨΦωϊ[¦Ν?Ϋομσ<CEBC>jϋ?ρΘό—W\ΧφΏiγ<69>Ξλ<CE9E>ψ<EFBFBD>4ώ§m<C2A7><6D>γOι~@9<>y=ώS~Χχ<CEA7>οϋHόm–ύΏbόΟ’ύ<E28099>ώ'<27>«'^½msγ<73>+ξ<>-Ε<>±<EFBFBD>lΫΔΏmΓ'<27>Οvόkt<6B>Σ®<CEA3>ϋς<CF8B>^οN[χΖ?ΣγKφ<4B>σ!±o¤ϋΏΥφ<CEA5>+πΏ~όίRώρΛώίύ²ύΧΎKόo=ϊgFό‡ός<7F>WΚ<57>οµ<CEBF>¤ϊG;ώ<><CF8E>ΏEώ¥ηλ<CEB7>όΗλνβ<7F>Ηυ£_ΘίOΨ?δθOτzΉΟαο^υJίγΓοσχ›?<1E>υ•~.πΫψKχ?Rόkϋ<6B>ώW<CF8E><57>ƒίΎ<CEAF>ƒώΠ_›ώ<E280BA>ύο<><CEBF><EFBFBD>υΏn<CE8F>ΗΊ<CE97>mώΊύ<CE8A>ΰψώ·‰?ϋ<>ώ <0A>{ί{ο'…/ύ=ϋΏV<CE8F>³”ώ«Ϊ<C2AB>ΟGΫz’Ζ?΄ΧYώ<59>φnο<6E>Ό¶ώ―γ?cύλχF<7F>#<23>Χ’<CEA7>2ω;οό<CEBF>U<EFBFBD>ϊί<CF8A>ώ‡ώΠ<1F>?ςΏ<CF82>ώnύΖψεΖ—σ<1F>/ψΤ΄‘<CE84>›ΛΏτΏmνρ£tύΏώσΧαϊo©_U:=zώ}Φωoύσ?γτ<CEB3>!Fα;ό[Ηωq=3έυ·Άόο;Ώ<>yΧ­ΧμΛ_—ΝΏ6<CE8F>IρΣ<CF81>Ώχ_ΏΎώυO¨†ύ―έ<E28095>ηχ{Δώκµ<CEBA>µν ώΪπgΜ?υΏθ<CE8F><05>[®<>a[ώYχ<59>β<EFBFBD>Γ<EFBFBD>‡<EFBFBD>Ο®<CE9F>Ob<4F>Νθ<CE9D>£_<C2A3>ώΗώ§ώ/ώπβ?τ²Φ<C2B2> ϊγ<CF8A>£ώ/ώ?κ<>Ω¬<CEA9>g½ώ― <0C>Ωλ_><3E>ρxκ<78>R<EFBFBD>wζώ‡όϋO‚<4F>ύ<EFBFBD>ύOόϋ<>ψ?ςΏMώΟ<CF8E><CE9F>®<EFBFBD><C2AE><EFBFBD><EFBFBD>ϊ[‰<>c<EFBFBD>Α<EFBFBD>Πί&ύ©<CF8D>GύΗιOύΛχΧ<CF87>χ?<3F>Χ<EFBFBD>[΅ώK <09>–ϊ{r<><72>υ<>¨<EFBFBD>m―ώϊ<>ϊ<EFBFBD>Τ³[<5B> ϋωΗώΗ¶ό_±ώχυΟ­χ<C2AD>©ο<C2A9>ζΤ?_Οώ§ώ?υ<>©<EFBFBD>OύKϊ%<25>ί;λ<>—ό_µυ7'<27>ύ<>ώΗ<CF8E><CE97><EFBFBD><1F>?ώ<>wλ<77>ίo~xΉω?λ<>C<EFBFBD>ΈοόοΣγ}ϊ§ΖKα§τ_8όΑό_’Κ—ο‡|ΚΙ<CE9A>³ό”βΘηίοό:ώερΫvΎ><19>1ψ―ΟωωσνθύΧ<CF8D>ώ^²όΉχ―ν~wΗ_*<2A>ηΝΟού35Ϋv<1E>ΊξΦχLώOΓ―αS<1B>Ίξ??ό<0F>[ζπ·m<C2B7><6D>Δ|<7C>έοwϋψΓ<CF88>ϋ4α<34>Π<EFBFBD>“ΖΛόιψƒϋΎ><3E>ΪφΏ,ώ3£ών*ρ<>Ψί<CEA8>–§ροΏΫΗΗΏ<CE97>ύ^iύ·γοϋέ¥λ?Ύί8όόx<CF8C>ϊ ύ ύf?Ο»<CE9F>ί<EFBFBD>όχγWστ»όυυΏ΄ώƒυύ<CF85>6ύGζΏ}|}ώµΧί:φ7φ<37>Eϋ<0F>?ρ ύ¥ψ·Π―ώ<ϊƒ?ψ[ΑίΧeεΟ©Ώz|¥<1C>9ΧKIΥΞγ_Τ|>ύΏ<0F>~η<>/ώwασΗύ§ZβW-περ/)ύeλΫ¤σίχΌηίΟ[cτΧα©ύ?ΓώΥ¬i]ώkχΣ–<CEA3>²ώoιώn^Zϊή―ώλLώGώ!<21>°<EFBFBD>Χ±<CEA7>gΨ<67>#φ<>ύρ—<CF81>ϋϋώ‡<CF8E>uωί.ώθόψ<7F>Π<EFBFBD>υ?ό<0F>Γ<EFBFBD>vψίzώ#γ9<CEB3>Οω<CE9F>ρόIιϊΣΞ<CEA3>$<24> ϊkΒΏγω—™ηΦ9<CEA6>gσό«O―°?{z<7A>§Ώ4<CE8F>ΏύόmΤs<CEA4>ό<EFBFBD>Yηί<CEB7>ί·<CEAF><C2B7>[γό η<>8<EFBFBD>Οώ‡ύ―­ρ<C2AD><CF81>΅ώη―Ρ<CEA1><7F>Gώγ<CF8E>Α<EFBFBD>ύmω<6D>°<EFBFBD>ΰθOύκ<>Y―<59>4―ώH<CF8E><48>σ<EFBFBD>λ&ώ+Υ<>“ΕΖβλΤJγ_σΏΟ«<CE9F>£γ<C2A3>—ΖΟζΩ<CEB6>:ρ?β<>θκ?S<><53>ψ?φ<>Eϋ<45>ψ7ς<37>ό?»ρ―‘ύίρ»Ήυ_uϊ<75>P<EFBFBD><50>ϊ<EFBFBD>δ<EFBFBD><11>Η<EFBFBD>«γ<C2AB>[§ώΏT<CE8F>Hγ?δ<>“<EFBFBD>―›<E28095>/³<>Ζς<CE96>Χ©<CEA7><C2A9><EFBFBD><EFBFBD>ώ<EFBFBD>Φβ<CEA6>―'zΡΓΗ<CE93>xΎτuΗ?―<>ΉoΣΧkχ<6B>ΗKαΧξίϋ|ΰώ<>‹<EFBFBD>«IX<49>¤ό9|Iρ?ΏBx5όkγλ―2Ύύπ{ού΅Ώύµλήιϊ_―ώu­ώΥΉΦΥόuκΏΑ<CE8F>π?όoλφ<CEBB>α‹ωϋ ύ—9ψΞΏυς'χΗ?1ώΗυ3ύ_Ώ<5F> <0B><>ϊϋτί¶s<C2B6>›<EFBFBD>Ύ<EFBFBD>ϋάHι―m<E28095>·ΰ_[Ήy‰νχ}8<><38>λ_»<5F>Ν
λ_‚<EFBFBD> ωwηώ?θδΏtύ‡}ΣfΘί³όOΛeφθτ?τ·Kό<7F>Δ<CE94>φΧΉNό<4E>Cν<43>‘ψOάΏdόόε<CF8C>όν_¶gdύ_¤ς<C2A4><CF82>ρΏ>ϊΤχ<CEA4>½σ/~~Νυ§-ίΗό<CE97>.<2E>8¶οsγΛώ=ψΘ<CF88>‘ύ_Έ<5F>‘ΞΏ®όΩ<>…λ―eώΚϋΏ»ρί<<3C>7ρOβ<4F>Ψ<EFBFBD>wΛi―<69>Ϊ–<CEAA>£i<C2A3>θ>Ώφό“<CF8C>GώόOώ<4F>UωgέΏ‹<CE8F><0F>ώ?Λώ?™ύ7#<23>_7ώ<0F>c<EFBFBD>c<EFBFBD>k<EFBFBD><6B>Ήϋωπ<07>ΟΒ<CE9F>½ϊ_[ώKυ~ψ]}<7D>ύ΅Ώύ¥υΏ¶νόύσ‘®/υ|¤λY­qώe¬ώΥ<ω/…/­{¦Θi:Kλ<4B>ω<<3C>‚Χ<E2809A>i|ιο|ώ«Δ<C2AB>-λου<CEBF>β<EFBFBD>ηγΜ<CEB3>Ϊλ_›<5F>?Gώ<47>Χ<EFBFBD>{>ζΞj~ύωOΧΏ³)<29>°<EFBFBD>ΥγΟ<CEB3>Ώmόϋ<>sφ<CF86>ώiWτ_{ηϊ·®<C2B7>΄ιg}ύέGώΟ‹<CE9F>kΗ‘<7F>Π-ψΨΨψ<7F>΅<EFBFBD>ϋύ_τΏ΄έ<CE84>‘ώ―Χ?ύθ<7F>C<EFBFBD>«ύ<CF8D>θYύΧyύµεΏυώΏΨΘ?{ςω?«<>υ<EFBFBD>ύΏΞϊ—φί•<CEAF><E280A2>>ύΣϋ?©ώΧ±<CEA7>Ρ<EFBFBD>Ίό<CE8A>9ςO<CF82><4F>uφ<75>Φεϊ_Χ<5F>WΞ“Ώ3σ<33>Ϋυ<CEAB>Τ<EFBFBD>ƒώG<CF8E>γ<EFBFBD>Η<EFBFBD><CE97><EFBFBD><1F>?ώππΏιω§yς_G<5F>[—<>Πύ?Η<>ΣΎ]Ι<>gέ<67>…ύ<0F>Γ<EFBFBD>ψΏΑ<CE8F>όοV<CEBF>γΎ‡ώΗΦρΉψ—&όϊ<CF8A>xς<78>π<EFBFBD>χΖΏsώόΪψ\ό<CF8C>υOό_φYJΏΩΟσξη·#<23>έz<CEAD>©<EFBFBD>Ϋε――<E28095>·­ύωsυη8<CEB7>΅G<CE85>‘ωo_<>νυ·<CF85>ύ<EFBFBD>ύgΡώΓ<CF8E><CE93><EFBFBD><EFBFBD>ψ/ψƒΏυψΏ4ώ3ζ_^GώΫΜ<CEAB>%ώΗώ<CE97>σ―ΔΨ<7F>qώ<71>σ<EFBFBD>Θ?μ«ψ“<CF88>Cώφ?ωπ?ωδ<7F>α<EFBFBD>Γ<EFBFBD>‡<EFBFBD>ύoηόό<0F>Γ<EFBFBD>¶ψ<C2B6>υD/zψψΟΗu®<75>―;ωωϊ<CF89>ϋ6}½v<C2BD>xΌ~νώ½ΟχΩψΏz‘„ύOz>KΧ—τώ<CF84>ηο‡Ο_νU»?τΏύηΒΧ”οςόoyώσΧΧ+<2B>Ω<1F>{~<7E>ώ<EFBFBD>ΰΧkγ<6B>λgόeω―RωΏR<CE8F>'ΧΏ>ί<>*ώύόωw<7F>=‡―<E280A1><EFBFBD>?Sλ―6ήΏσΏώϊ—ζΘς΄υ<CE84><14>γώαόσά:<3A>ΟΗάω«jQώa<CF8E>³Ώµ~½ί~ _<>υUΫ/υοΏΚΟΫΏ?ϋάύ<CEAC>v<EFBFBD>aύύ<CF8D>uϋ_—~ΦΧί=ε?ώ?όψ<7F>>Α<>‡ύ<07>CΛφΏΎ<CE8F>QΎuϋolώηω?οΉώηϊ<CF8A>ύ;ώ<19>ώΌψ<CE8C>4ώ§m<6D>αΞΏ‹#9?~,<2C>Kρ<4B>µό<C2B5>}ρ³ωϋ<CF89>χΖ<CF87><CE96><EFBFBD>£<EFBFBD>-ΗZβί±Ό<C2B1>ε™tώµεΏυψ?φ<>]ϋ<>ψ7ς<37>ό?»ρ/ΙώΗι‰ό;φ'ΫΦn<CEA6>§β<C2A7>¥ρΑυθ<CF85>#ϊξώoµύ<C2B5>;ω<><CF89>ωΟΦσ<CEA6><CF83><EFBFBD>’<7F>WΣ<57>§Ώ<C2A7>ρ?Ν‹<CE9D><E280B9><EFBFBD>Oώ<4F>jω<6A>=φί<CF86>όΝψ/ώ<>ώ™<17>Χ±<CEA7>‰<EFBFBD>γ<>:’ρϋWζ•ϋ]m|ν{ΰψο‡<CEBF>φ?<9ωϋ®†_ΓΏm<CE8F>]φhΒ‡ώΠ_›ώηϊΣqύjχ<6A>±ϊΧωϊΣwΗ<77>ξσ<CEBE>ήΔϋ7η?<3F>χsπΟΓ―γί²<CEAF>,νΰψί:<3A>ΫΕ<CEAB>ύGΎυwλϋ?η_,_—Ξσ<CE9E>φ+~Ϊσ7cώΣςΧΙΩψϊσ1oόΊϊ_φόw™τ?ςEω<45>.ωΛώύo]<5D>Cθ<7F><CEB8>ί²ό·}ώόΗω<CE97>jώώυπ5σ<35>βΌΉ9η/ΞωιΌΌtώ<74><CF8E>W-ώΥ–<CEA5>ΧΏ'ώ6#ώ¥{ώ'5<>νω—)όΣωξy9<79>SΧ΅ύΊο²ύuνώΟΗ\ψϋ>k<>oAώ<41>ΦυσY^Iθ―-<2D>kψΦΦ_n^ZηsΕυ―}]›<>ξ>Θ?ΰ_wώw^<5E><>{<7B>ώ¤σΏ­ϋ<C2AD>τ~eΞϊί¥ν<C2A5>Τψ’ύ†<7F>;ί4f<34>—νψ_›<5F>ΗχίW¬νύΏ5ωGύOόψ<7F>π<EFBFBD>Ω­<CEA9>3n<33>ΝXΪφό<>ύoΫώW_ΐ>πo(<28>ί<07>:ωΏ|θύ5θ~<7E>ϋyηυ8>•»β?o|ψ~<7E>+qσοjeωχΏjώϋα—Ηϋίo›n&K<>ΞχΉσοΧFΑ?_ϋώΌΘαW[­γs<CEB3>ΧX<CEA7>Ϊό?ωwχω·.<2E>μΪ<CEBC>Ίρ?ύψ·uό±<CF8C>mΫ<6D>ϋΚO·~όϊ°γςΧΏ<CEA7>οwx<77>uΦΏ]ύ7‡ώRω7oύΕγΫπG<CF80>ιΔ<CEB9>µγΏΘλτ―<>ήF<CEAE>0ώχΐώΓώΓ<CF8E>ύυθΏbύ©{ΤΏ<CEA4>®Ώy|λσoiύKύΗ<CF8D>wέϊΟrό¤ώνw‰<77>a^ύρ4όψ/~ώkύ<6B>οYΘ?τΟjυ<6A>ϋε—T<E28094>hΛ<68>ώγΟ<CEB3>Ξωƒ<CF89><C692>Θ?ΰΛΰkΏk―<6B>π½ΥώΌjώϋα—Η—Ύ<E28094>³<EFBFBD>›»<E280BA>Τ<CEA4>νι<CEBD>µψ<C2B5>~ςοξσoWώ±<CF8E>[Ο<>χNω;G<>Hύ?θτ?ώό<7F>ψ<EFBFBD>ρ<EFBFBD>Σ<EFBFBD>ψΐ>ύίι<CEAF>ύ΅?ύΏι<CE8F>ύήψ[ώιόuνoψώ·Ν<C2B7>τ<EFBFBD>µ½<C2B5>Ψχp|νsο{ού¤π¥Ώ?ώ<>—ϋ<6<>ξώµϋΝ<CF8B><1F>§<EFBFBD>/ύ_Kύη]Ώ cύ„ρƒ}—Εβρuώηϊ—ΔOζΜΏvό'G<>CΧGυ^ώ¥<CF8E>Ώ~Z<>ΗγkϊίΊόο<>'Υ<>µώe5}~u<>?«ύ<C2AB>µιΏmmλ<6D>κώ—cλ―½<E28095>΅¶ύ‹ύ‡ύ‡<CF8D><E280A1>ψύ<17>|«ύ?ι<>C<EFBFBD>ϊ<>Xν<58>C<EFBFBD>kΫςΏήΏΎό.<2E>mώ“β§=πςωό»φ<C2BB>»3ώ<33>Ψϋ<>ώ<EFBFBD>πΏ]ώ·†?ϊ<1F>ώ?τ?ϊώ‡<CF8E>αKόo=<3D>ό9<CF8C>Βω<CE92>}/ηOί<>ζ•σΏυσ?Ι<>µM<C2B5>}<7D> ?¦<>Ύ‡πέύΧ8<CEA7>²ήω<CEAE>wζ?sώ7Χ<37>2<”<>_6#<23>ΏΤ<CE8F>®~ώGή<47>ΞzώΏζω³uΟ<75>[:<3A>ΗωΞ<7F>³<EFBFBD>ηό?ηlΦ<6C>?<3F>έ&έύ}›k<E280BA>ύφ?η<>9<EFBFBD><39><EFBFBD><0F>ώ?{ώ?μ?ΞC›τ§ώώ<>κ<>¬ζ³ς.<2E><>Hγ+Ψ<CEA8>ώO<CF8E>σw«Τ<C2AB>ΛΗΟ<CE97>λ£υΏkϋ<6B>υβVμτ?ω_Τ<5F>³<1B>Ηώ³m<C2B3><11>Fώ“<CF8E>g7ώ%ν_:g<>Ή^<5E>κ<>S<EFBFBD><53>ϊ<EFBFBD>Δ<EFBFBD>-Δ<>Wτ<57>½³ώΏD<CE8F>Μ9<CE9C>Jώ?ω<><CF89>φο<CF86>ώυ£ϊG;ώ‹<CF8E><E280B9>ώ<EFBFBD>vσ?BϊΟ—£<E28094>yώΟxΖί|\—$]<5D>ε\?ε]π―~~mψΠϊλΚ<CEBB>σϋοχ;―ί<1D>{ΟΏτOΞ<4F>µϋ_ϋόπ?όo™<6F>Αί¦ύοϊΣrψΠ_·ώ«¶ώΥ―?Ί
<EFBFBD>…ο9ωι<EFBFBD>.„_οΏ’ό<E28099>‡<EFBFBD>έηύ<>όΧ¨<CEA7>­+­ο<C2AD>Π<EFBFBD>θθo—ώψ<CF8E>ρ<EFBFBD>Ήσ<CE89>ΗωΔάωΟ1ψρxw>+=^
?•<>ώΔΏ_Z<5F>α^±τΉ7>γ<>εΆλ3-?έοΫΧi|›ό—Ζ<E28094>¤ς_o<5F>;‡ώ2ω·mmπ[β-Ο{ώύΌυ—²™έύόσϊ<CF83><CF8A>ς_V<5F>΅Νώtχ?ΣΏ<CEA3><CE8F>=Ώ'<27><1B>OL<4F><4C>ϊΫ<>•θ―-<2D>Ηρoί<6F>ωψΗό―½ώ­Ηί<CE97>b<7F>b<EFBFBD>—νσϋKj<4B>λο<CEBB>¥ψKχ<4B>σζ?=Ώδ<CE8F>‘<EFBFBD><07>“<EFBFBD>ΧO<CEA7>O—ψΏρ<CE8F>α<EFBFBD>Γ<EFBFBD>gΡ<67>7Οώ“<CF8E>?Ρ<><CEA1>ΪεμΞ<7F>0<EFBFBD>ρ<EFBFBD>ηό?ω_<CF89><5F>‡ώσΏuΞ<75>¬<13>²ι<C2B2>ΛΡΏ΄WNύN<CF8D>¬c<C2AC>“<EFBFBD>Οω?Ξ<>qώ<71>ψ?ω<>–σ<E28093>±<EFBFBD>‰<EFBFBD><13>'ώOόί¶ώ«Ε?GδW[όW;ώΟωO«τ'ώ<>ύ‡<CF8D>ϊ[υ<>kχ<6B>Ρ„<E2809E>wίΕ0γλ<CEB3>5ήϊό[_<>R<EFBFBD>³GςϋΡ8Ί„ΧγοΛς«NΏ«ύ<C2AB>9<fϊ<66><CF8A>~κσW›gωό<CF89>ω¤όΧ~<7E>τίµώ›λΧςύ―MIόY:<3A>λΘ­ώcπςωΗxνυ―c®³ώ¥RϊιόΝΫ<CE9D>IυΏ<CF85>ύ<EFBFBD>ώΧε<CEA7>Ο‘w<7F>›ςύ―λ<E28095>Σ–Ώστ<CF83>Τ<EFBFBD>ƒώG<CF8E>γ<EFBFBD>Η<EFBFBD><CE97><EFBFBD><1F>?ώ/ΰψοΤ<CEBF>:ρ<>μ/μ?θ<><CEB8>Ο¦<CE9F>ίΊ<CEAF>O{<7B>?o<>uEύ ψώ<>|ώΫφ<CEAB>Ύ‡γ<E280A1>ο^<5E>γλ!όάσ—Ζο{yΌ~<ώο§<>‡<>1ΗυΡωwχ?><3E>ƒ‘§Ώ~<~Δώφω)ΌΪ<>-τ―Ν<E28095><CE9D>φΏτωί9<39>ρ<EFBFBD>_Ϊ>χΎ·έOoύ<6F>β5—~zο9ϊό~<7E>ΟΣ<CE9F>θ<EFBFBD>6ω'…<>_Σ<5F>Φε®<7F>_8<5F>γς«¦<C2AB>sύΟZυ~|›όµΎ<C2B5>[•ώ-λF<7F>»}<7D>»ώ<C2BB><CF8E>ςόΉϋ­a<C2AD>b<EFBFBD>Ω¶<CEA9>π<EFBFBD>γ<EFBFBD>>π<>ΟωkωΏΦσ<CEA6><CF83><EFBFBD>΅<EFBFBD>µνΟΗ[Ο<>b<EFBFBD>gg<67><07>1<EFBFBD>ΨίΦα“<CEB1>Cώφ?ωπ?ωδ<7F>α<EFBFBD>Γ<EFBFBD>‡<EFBFBD>ύΟωψώ‡<CF8E>?—<>ΏΎ^ωX~ώΣΡ<CEA3>ευ¤ΗwΫζϋ7<CF8B>έοu}ΫΒρ/<ύρΗυ£?‰λ<E280B0>ςϊύ\ψρxwύ¨ΟΰΟ?ψ?εηw£ΖπώΚπ<CE9A>~G®±λOtτCrύ<72>Β>Η3ΦΨ7ω Ώ¶ώΟΟ?Ψ9υ}
/Ώ<<3C>Ήyi…ύµιΏοsαΗpάύSσ©-<2D>εωί²όηώαυX??}γΟόυ|ΜΙ<CE99>ΑϊύίΟλ?΄§Στχα•ιs¶―Jσ_κΏΧ‚Ί<7F><CE8A>γΏη£Ξ<C2A3>1?”πKι<4B><CEB9>ύΞχ_qύKΟΟ΄<CE9F>ΧΦW<<3C><>ζίΊόc<CF8C>Αώί2ώµύOiΏ4g<34>΅»<CE85>²Ύ<C2B2>ΛΫ<CE9B>ηώΓcςΧί<CEA7>Δύ<CE94>WΨ<57>`<60><><EFBFBD>†ό+<2B><>[}η‘<7F>ψ<EFBFBD>π<EFBFBD>α<EFBFBD>³κ<C2B3>Γώ³Ξ<C2B3>Πί2ύkώΩ~<7E>c<EFBFBD><63>WΫ<57>‰<EFBFBD>CζΏΌβΊ¶<CE8A>M<1B>w^—Ζ¤ρ?mϋοJε£εύηυψOω]ί<>Ώο#ρ·Yφ<59><CF86>ρ?Kφ?ϊ<>ό―<CF8C>xυΝ<C2B6><CE9D>―Έ<E28095>·<14>Ηώ³m<C2B3><11><0A>ό?Ϋρ―ΡύO»ώοΛz½;mέ<1B>L<EFBFBD>/Ω<>Ο‡ΔΎ‘ξ<E28098>VΫ<56>―ΐ<E28095>ϊρKωΔ<7F>-ϋWτ<57>Ιφ_ϋ.ρΏυθ<CF85>ρς<>Ι<EFBFBD>_)<29>ΏΧώ“κνψ+ώ<>ω—<CF89>―+ς―·<E28095>‰<EFBFBD>Χ<>~!?a<><61>£?Ρλε>‡Ώ{Υ(}<>ΏΟίoόxόΧWϊΉΐόmγ/έ<>Hρ―νjψ_}ώg ~ϋώϊCmϊkφ?Ό;ώ3Φ<33>Ίύλώ·9ψλφ<CEBB>ƒ<EFBFBD>αψί&ώμNψ7|ξ}ο½<CEBF>Ύτχμ<CF87>ZύΟRϊ―j<E28095>?mλI<1A>Π^<5E>eω?ΪΈ½<CE88>σΪϊΏ<CF8A><CE8F><EFBFBD>υ―ί<E28095>ύ<>ό_KώΛδοΌσVύθ;ϊϊCό<7F>Θ<EFBFBD>vϊ»υγ—_Ξώ½ΰS<CEB0>ΡFώo.<2E><><EFBFBD>ύ¶µΗ<C2B5><CE97>υ<EFBFBD>ϊΟ_‡λΏ¥~UιόυθωχYηΏυΟ<CF85><CE9F>Σ†ό…οπoδ<7F>ΕυΜtΧί<CEA7>ςΏοόώη]·^<5E>±/]6<>Ϊό'ΕO{ώήύϊϊΤ?΅ώφΏv<CE8F><76>ίοϋ«ΧώΧ¶$ψkΓ<6B>1<EFBFBD>Τ<EFBFBD>Ά<EFBFBD>όoΉώ‡mωgέ<67>‹<EFBFBD><0F>ώ?»ώ?‰ύ7£<37><C2A3>~ύ_ψϋ<>ϊΏψΐό‰<CF8C>Π<EFBFBD>ΙZ<CE99>'θ<><CEB8><EFBFBD>ϊΏψ<CE8F>¨<EFBFBD>g³ώ<C2B3>υϊΏ2όg―ωόΗγ©<CEB3>Kύί™ϋςο? >φ?φ?ρμβ<7F>Θ<EFBFBD>6ω?7ώ»bώ7ώ?θo%ώ<>ύ<07>C›τ§ώυW¤?υ/ί_<CEAF>oά<6F><^<5E>o…ϊ/%ό[κοΙύ<CE99>kΤ<6B>£ώ·½ϊ?θκ?R<>Νnύ7μ?δϋΫςΕϊίkΤ?·ή<C2B7>§Ύ<C2A7>›S<E280BA>|=ϋ<>ϊ<EFBFBD>Τ<EFBFBD>§ώ?υ<>-ι<>•όο¬<CEBF>_ςΥΦί<CEA6>ότ?ϊ<1F>?ώό<7F>ψ<EFBFBD>ί­<CEAF>Ώύω=ΰεζ<CEB5>¬?ύγΎσΏO<CE8F>χι<CF87>/…<><E280A6>αππI*_Ύς)'<27>ΟςS<CF82><53>!<21>ΏSπλψ—ΗoΫωzψόeόΗΰΏ>ηηΟ·<CE9F>΅?τ_Cώω{ΙςηήΏ¶ϋέ©ό<C2A9>7<EFBFBD>=ΏχΟΤlΫy|κΊ[ί3ω? Ώ†Om|κΊ<CEBA>όπ?όo™<6F>Αί¶ύ?<12>ρύwΏίνγ<0F>sμ<73>Ρ„?B<>O/σ<>¥γξϋϊόkΫ<6B>²ψΟ<CF88>ϊ·«ΔbZ<7F>ΖΏ<CE96>ύn<1F>ώχ{¥υί<CF85>Ώοw—®<E28094>ψ~γπσγύλ3τ<33>5τ›ύ<ο~~;ςί<CF82>_ΝΣ<CE9D>νςΧΧ<CEA7><CEA7>ϊΦχΪτ™<>φρυωΧ^λΨίΨν?ό<>Δ$τ—βίBΏ^ψσθώΰo_—•?§ώκρ•r|ζ\/%U<>9<EFBFBD>i|Pσωτ<CF89>>όSψ<53>+Ύψί…Οχ<>j‰_µΐ—ΗΏ¤τ—­<E28094>m“Ξίσ<CEAF>?oύ<6F>Ρ_‡<5F>¥φ<C2A5> ϋW³ώ¥uω―έ<E28095>M[ώΛϊΏ¥ϋΈyiι?xΏϊ―3ωω‡όΓώ_Ηώ<CE97>a<61>Ψ<EFBFBD>χΗ_JμμψώΧε»ψ£<CF88>ρ<EFBFBD>α<EFBFBD>C<EFBFBD>ΫΦ<CEAB>π?ό<0F>Ϋαλω<CEBB><CF89>ηό?η<>Ησ'¥λO;<3B>“ό/θ― <09><>η_f<5F><66>Yηό<CEB7>Νσ―>½ΒώμιύA<CF8D>ώ<EFBFBD>ό<EFBFBD>φσ<CF86>µύQΟuς<75>g<EFBFBD>Kίrώo<CF8E>σ/<2F><>γό?ϋφΏ¶Ζsώ‡ϊ?<3F>ΏF<CE8F>qώω<><CF89><07>τ·ε<C2B7>Γώƒ<CF8E>΅?υ_¨<5F>g½ώΣΌϊ#=ώΟ;®<>™ψ―T<E28095>O<16>‹<>­S<C2AD>)<29>Ν<7F>>―ώ<E28095><CF8E><EFBFBD>_?›gκΔ<CEBA><CE94><EFBFBD>£<EFBFBD>©<EFBFBD>Lύ?β<>Ψν?βίΘς<7F>μΖΏFφΗοζΦΥι<CEA5>Cύκ<7F>“<EFBFBD>Gό<1F>―<EFBFBD><E28095>o<EFBFBD>ϊ<EFBFBD>Rύ#<23><><EFBFBD><EFBFBD>OώΏnώΏΜώΛ<>_§ώ?ώϊZ‹<5A>Ώ<EFBFBD>θxjχόp<7F>λ\<5C>μλ<CEBC>ΧΥπ―~~mψΠϊkΡΏΝ~©εO<CEB5><4F>Ώ;ώw<CF8E><77>¶ϊUωϊiσπ―ΑΏξωαψώ·‰Ώuϋ<75>πWύύ„ώ«άxηίzω<13>λµρΗυΥΰC<CEB0>ΈoΝΎ—4dκw<CEBA>ωΧΤΏ-ψΧΦ_n^RpRίkσίΉ<CEAF>Μσ‘“<E28098>cύoςύgVX<56>όο><3E>θδΏ¦όΧ–Ώμ<CE8F>Π<EFBFBD>Φυ?τ·Kό<7F>Δ^ΉaώΓ‘<CE93><E28098>Ύ>ϋώρx)όΪύΑϋ—λισ“µώ'©ώ9γωOi‰θϊ£΄¬<CE84>Ϊψ²ώ—Ε<E28094>δφΗ
ώ<EFBFBD>qϊKε<EFBFBD>v<EFBFBD>§τz‘®ΏήϋλΙ<EFBFBD>#3΄σπΗμOw<4F>3ύSφ―ώό<7F>¥ύ<CF8D>Ώ^Z―cϋΏ<ύυε<1D>Ϊϊ«ο<C2AB>όόοσ|j®λρ7β<37>ΨΗΨ<CE97>zύ<7A>υνώσμ_Νώ―δ<E28095>ΩΞ<CEA9>³Ξ<C2B3>Φσ<CEA6>μΚ?λώ_όψ<7F>π<EFBFBD>Yφ<59>Ιμ§ϊS7ώ<0F>c<EFBFBD>sώη®ηOΟxΖλΙ<CEBB>χΑΏϊωµαCθ―A<E28095><41>Τ½<CEA4>ήsυ•βϊ_ξ|IyΌ<79>}\u<7F>σ/ωϊPmΧ¥τ“Β»<>£Θy:Ο<><CE9F>Ϊ_ ΏΡΏσϊ{½§ωΏeύ¥Η»ψΘ<7F>Ϊλ_›<5F>?Gώέ}ώmΚ?μΝψίρoλψc<CF88>Ϋή<CEAB>IκΏ¶ΧW­ΥgΥ]<5D>–υίϊKείΌυ7―ώ―=ύχήψΏvόωύϋπ΅<~ώ?φφώθ―ι<E28095>ϊϋ)χ―r<E28095>λYλ?¦ Ώ¥E­δ<7F>Η[<5B>λλ_κnι<6E>Sλ?“—_uϊ]ν<>Οα1Σ<31>χ<>Ιυιkν<6B>36<33>cώ)<29>µίΏ½<CE8F>Ο<<3C>Νυλω‡ώΧ¦Ώ$ώ,<2C><>uδ
<EFBFBD>ϊϊ›'<27>α?δς<>ρZλ_Ηώ\gύK<CF8D>¤τΣω›·<E280BA>“κϋύ―Λ<E28095><CE9B>#<23>ξ><3E>6εϊ_Χ<5F>§-ηι©<>ύ<>ώΗ<CF8E><CE97><EFBFBD><1F>?ώό_ΐ>πί©<CEAF>uβ?+Ψ_ΨΠ<1F><>M<EFBFBD>Ώu<CE8F><75>φώήώλ<CF8E>ϊπ?ό<>ωόώ¶ν<C2B6>}Ηί½>ΗΧCψΉη/<2F>ίχςx)όxόίOy|<0E>cώ<63>λ£σοξοχ\ΚΣ_
??bϋό^ν<>ϊΧζEϋ_ϊόο<CF8C>?ιxΗ/m<>{ίΫξ§·ώGρ<47>K?½χ}~ΏΟηιGτ›ό“ΒΟ<CE92>―ιλς?μζλΟΤυ~ωUΣ<55>±όμΥ<CEBC>ωρmςΧϊώoUϊ·¬<C2B7>Τό§ΞΏ—ζίη®Ώη£<ξ~kΨΏΨν?ό<>ψ<EFBFBD>€|ΰsώίZώ―υό?βθmϋsΕρΦσΏΨ<CE8F>ΩΩ<CEA9>ΑΜ?φ·uψδ<CF88><CEB4><EFBFBD>‡ύOώόOώωψ<7F>π<EFBFBD>α<EFBFBD>C<EFBFBD>sώώ‡<CF8E>α<EFBFBD>Οε<CE9F>――W>–<><E28093>tτgy=ιρέ¶ωώΝχ{]ί¶pό OόqύθOβϊΏΌ~?~<ή]?κ3ψσώΟGωωέ¨1ό<31>Ώ2ό£ί‘λ_μϊύ<>\ΏΆ°Ορ<CE9F>υφM>Γ―­<E28095>σsΕΟφ_N}<7D>ΒΛΑ/Οn^ZαCmϊοϋ\ψ1w<>Τ|jΛyώ·,<2C>9…x=ΦΟΟGίψ3=sς_gπ<67>~<7E>χσϊνι4ύ}xeϊ<65>ν«<CEBD>ό—ϊοµΰ<C2B5>ξ<EFBFBD>ηψοω¨σΜ%όRϊ£tΏσύW\<5C><>σ3νγµυίΟ§ω·.<2E>Ψ°<7F>·<EFBFBD>m<7F>SΪ/ΝΩθξΏ¬ο<C2AC>ςφ<CF82>Ή<EFBFBD>π<EFBFBD>όυχ?q<>ηφ?Ψ<>£τ<C2A3>!<21>JηΗΦ_ίω_δ?ώ?όψ<7F>¬ϊ<C2AC>°<EFBFBD>¬σ?τ·L<C2B7><4C>¶ί<C2B6>Ψη<CEA8>Υφβ<7F><CEB2>ω/―Έ®νΣΖ<CEA3><CE96>Χ¥ρiόOΫώ;Η<>Rωhy<68>y=ώS~Χχ<CEA7>οϋHόm–ύΏbόΟ’ύ<E28099>ώ'<27>«'^½msγ<73>+ξ<>-Ε<>±<EFBFBD>lΫΔΏmΓ'<27>Οvόkt<6B>Σ®<CEA3>ϋς<CF8B>^οN[χΖ?ΣγKφ<4B>σ!±o¤ϋΏΥφ<CEA5>+πΏ~όίRώρΛώίύ²ύΧΎKόo=ϊgFό‡ός<7F>WΚ<57>οµ<CEBF>¤ϊG;ώ<><CF8E>ΏEώ¥ηλ<CEB7>όΗλνβ<7F>Ηu^ΌxΩ}Ες%–µλWΓΏϊωµαCθ―ωςk+¥Ύ<C2A5><CE8E>®$wόο><3E>~}/}ζό±<>@<40>ώΥΟ<0F>Γ<EFBFBD>¶ωί6ώΦ_G½ΐψ½υχµογλ«Α·ώ’ϊ<E28099>¤σ―­kψΧΦ<CEA7>Τ<EFBFBD>¦½ώµλ<C2B5>®°ώ%ψί}ώΡ<CF8E>ΘMω―-Ω<7F>΅<EFBFBD>­λθo—ώψ<CF8E>‰<EFBFBD>ψω…q~bϊzοόΦξ<1F>—Β―έΏχω>®[½ξz£„υ<E2809E>rω—ηό©–ψ‹?>¬<>—®2“?<3F>™Β―6ΎτrΟ<72>ώΎ%~$yIγWsΖ<73>Σ_*<2A><>σ_‚<5F>ΓΏ4ώΌfΛλEΊώzο―'<27>­<EFBFBD>@ώλΦ<CEBB>Σ—<CEA3>Τ<EFBFBD>ΠΜ?^aύ[><3E><>}<7D>ύΫW¥σ—cφgΩώΧµdψΟ³ΏηΝκόkm<6B>PΫ<50>δνgωϊίΝxώΪ«†<C2AB>τ<05>kσ<6B>uω£WΓ<57>Ώ<EFBFBD>·%<25>¬ϋρ<7F>α<EFBFBD>Γ<EFBFBD>gΩ<67>'³<>fθOMϋ ώΗώΗώW_<5F>g<γo(<28>ί<07>κηΧ†ύ΅ΏύΟu®^οΗΉ
7ήνύϊR®ΎRyΌ<79>½{>ύϊw1~ρσµ_—<5F>O
μz<EFBFBD>ώ!oδι<kώk5όF<CF8C>τλ<CF84>ιΧΤδ<CEA4>Ο‘w<7F>›ςϋ_3ώ·FόΫ:ώΨ<CF8E>¶χ.^βlΒΧϊI_ο•―µϋ―°ώ-λΏ9τ—ΚΏyλ/½Ύjψ£<CF88>ή<1F>Χ<EFBFBD><CEA7>"<22>΅ώ#τ<>ηΟΟ<CE9F>ΗώΓώΓ<CF8E>ύ5ύ_<CF8D>υ§ξ]<5D>κώγ­ΟΏυυ/υ?ϋq¤Ώ<C2A4>σχρυψ{έϊΟuόsxΜτ<CE9C><CF84>ύΤη―6ΟςωσΜ«?^»ϊοZ<CEBF>Νυλω‡ώΧ¦Ώ$ώ,<2C><>uδ
<EFBFBD>ϊϊ›'<27>α?δς<>ρZλ_Ηώ\gύK<CF8D>¤τΣω›·<E280BA>“κϋύ―Λ<E28095><CE9B>#<23>ξ><3E>6εϊ_Χ<5F>§-ηι©<>ύ<>ώΗ<CF8E><CE97><EFBFBD><1F>?ώϊρβΕ‹ώοτ<CF84>ώΠ<CF8E>ώίτ<CEAF>ΎΖ<CE8E>#³_εψλΪίπ?όo›<6F>ι<EFBFBD>kωυχγϊ<CEB3>8<EFBFBD>αρwΌάη±ώ“ξώµϋΝ<CF8B><1F>ΟχΏ<CF87>οίφΉχΥ{?)όφίΣ<CEAF>•ώΏΗ<CE8F>Ο?ΗωA<CF89>7γρwΏηΨ*λ_™3<E284A2>ΪωO<CF89>ΎΗόεθ?¦?στLλοvψmγkϊίΊόο<>'Υ<>µώg5ύu<7F>ΏΟί<CE9F>ι<EFBFBD>ΏVΏΎ¶<CE8E>―ξ9¶ώΪϋjΫΏΨν?ό<>Δθ<7F>Θu®[ξ<>I<EFBFBD>ϊ<>Π<EFBFBD>Ηf<CE97>ϊ_Ϋ–<CEAB>qέϊT<CF8A>ϊm+υΉ—ΞΏ®ό―γ_[ΉyIΑI}<0F>!<21><>\·Ψ<C2B7>οξψN<7F>EμϊΒ<7F>vωί&ώθόψ<7F>Π<EFBFBD>θψώ‡<CF8E>­ρΏυόGπηΕω—ί™Ξ<E284A2><CE9E>―χζ/εΧ³vώ'ω_ΠΏ„<CE8F>όήϋk<CF8B>Ρ;<3B>£<EFBFBD><C2A3>lύό―£Ώ<C2A3><CE8F><EFBFBD>λ?Χ<>—<EFBFBD><E28094>(χ―«<E28095><C2AB>‘φΏ#<23>_σόΩ
η_8<EFBFBD>ΗωΫ/φ<>Vρηόυ$ηΏΫδo<~¥σΟΤ<CE9F>αόΏuω<75><CF89><0F>ώ?‹ώ?μ?ψϊΫ¥?υ<>lΫΪυGΦX<CEA6>zψ―T<E28095>o$ώ#<23><>­P<C2AD>I<EFBFBD><49>iΖω?]<5D>Hίtό,Όή_<CEAE>»΄<C2BB>Χ<EFBFBD><CEA7>Y·<59>Ρ<EFBFBD>¶_Τ<5F>³<1D>Ηώ³m<C2B3>ρBώ“<CF8E>g7ώUΫ<55>ΔφσXώ_iώυϋΏR<CE8F><52>ϊ<EFBFBD>Τ<EFBFBD>'ώoΡ<6F>«ν<C2AB>Σ®<CEA3>/Υ?ςσ―δ<E28095>“<EFBFBD>―<EFBFBD><E28095>?n<>IυΟ
υ<EFBFBD>ρ<EFBFBD>Σ<EFBFBD>Σnώ―T<EFBFBD>σ[’ξώ―ωwς/ΝRψ)ωοΓ<CEBF>ωόΑό]ύβγ»m+Αύ~>ώ­πsψ<73>Η‡υ—ΓZ0γψηα»y9γό67<36>ΠϊλΠ<CEBB>Έ―ϋϋGC<43>BψΟGί}οθ<1F>?Ύχο<CF87>9ψKΧ<4B>Όω<CE8C>ΗϋΧ<CF8B>οάΎ!<21><>¶•αΟε<CE9F>~ψ5όύϊjρσΖχ†<CF87>αψί2ώΨ<CF8E>ρψΏ<CF88>Τυ~ΞVοβeόGαΗγ<CE97><CEB3>ςxθ<78>ΦΟGiώs<CF8E>¥τ_Ηώ/γ<>ώ΄<‹ρΟΟ<CE9F>Ξϊ?ΛΟάυ<CEAC>ΎρχiϊηοΏ<CEBF>ώοΓ_ΊώηΝ<CEB7>ΎΟ΅ϊω―)<29>Gεo<CEB5>_ςΟΟώύ<>ώ‡ώΠ<1F>?ςΏίηίmk<1F>£?πο<05>ψ<EFBFBD>'βίρΏmνϋΗ<CF8B><CE97>ΏWώ–Χ~|Nώ<4E>ΖΏζΚ<CEB6>ϋΔ<CF8B><CE94>τ—Κ<E28094>~ψ!ύλγγυΊm+­Ώυδ«ύώ©γρ<CEB3>΄ν_ζΞΏ6<CE8F>µβ?ΎΎvώ®<1F>®ψρOβ<4F>Ψ<EFBFBD>λεΏ΄Ϊ_cφΏ–ύ#Ε_ΎtώΙ<CF8E>#<23>ώ'<27>Ο<EFBFBD>ό³ξ<C2B3>Ε<EFBFBD>‡<EFBFBD><0F><>]<5D><>Τώ›•<E280BA>―<15>…<EFBFBD>±<EFBFBD>‰<EFBFBD>γ<EFBFBD>π'ώCώωΏΠί¶<CEAF>Oϋό<CF8B>φω'λώΏάητϋόσOΪφ?η<>8<EFBFBD>Ηω?Ξ<>±<EFBFBD>!<21>έ|μμβ<7F>Ψ<EFBFBD>Δ<EFBFBD>‘<EFBFBD>%ψNΞιΐΏ><3E><1B>τ·wώϋώ‡ώφθξ<7F>υϊ_ϋOδϊW”Ζο{yΌ~<ώο§<^―<>YωωGα§ϊ_εϊ¬LλψΏwύ<77>ϋ<EFBFBD>kοΉϋΥύ<CEA5>uϊΏΣ<CE8F><CEA3>ΓOκ<4F>ο<EFBFBD>―ήωnύύ<CF8D><CF8D>a†ό+ω?RϋυΏ<CF85>wω<77>ΗΦ_―ύƒόC<CF8C>λΣ<ώ,¥<>ς?…Ϋϊ›#<23>Χ[<5B>ΨΘ?Λϋ[ψΟ³?ΗμYύύΟίOΏύ9<CF8D>ώRψωρώu<CF8E>»ίο™ϋ?©ώ_Οώ·¥<C2B7>Χγ<CEA7>{Ι?©ώΧί<CEA7>Ϋ–θ<7F>Υό£ςwfώ»ώ‘ϊΠ<7F>θό<7F>ψ<EFBFBD>ρ<EFBFBD>γ<EFBFBD>Η<EFBFBD>ώΰώΊρ<CE8A>–ό£yς½ψ<C2BD>-ωύmΣήώ3ήgϊχΟίοξψ<CF88><7F>ϋώ‡<CF8E>νπ?ώφ?-ώΗΨϋ©γsσο<CF83><CEBF>ύn<1F>£<EFBFBD>πΙ<CF80>#ώ―ωY{ύ<13>oΥΏi{nώόχΑ―<CE91>ΟΩ<CE9F>Θ<EFBFBD>ύΓ¤ϊ·]ώ¶<CF8E>—φ<E28094>³ν<C2B3>Σ¦ΛϊΏ¶<CE8F>ε;Χ<>¶ύ‹ύgΫώΓ<CF8E>Oό<1F>ψƒ?ωΏ#ρ<>q<EFBFBD><71><EFBFBD>ωΦσ‰<7F>qώ<71>σ―<CF83><E28095>g<EFBFBD>ΗωΞ<7F>#<23>°<EFBFBD>m<EFBFBD><6D>'<27>‡ό?μς<7F>ΰς<7F>Θ<EFBFBD>Γ<EFBFBD>‡<EFBFBD><0F>ϊ<>sυ?ό<0F>Γ<EFBFBD>Φψ<CEA6>λλε<CEBB>ςρ?<3F>οΕ)ΗwΫζΟΟΏϋΧkγ<6B>λ/Ύ ρώέΰ?!όm ΗpZα?sαΗγ·-„ΚλψoΫΉ<CEAB>ΙΡ<CE99>δυ
ϋ•ψΏ<EFBFBD>±ώjπkλΏεωύη-αΣ?<3F><>m;χq°λπ΅<CF80>έθ?Ύ¶όΏ.Ύm|κωίy]’<>:Cώ―Ϋ<E28095>«­ύμωw<7F>½<14>φΰW/½ΏήϊoΝ<6F><CE9D>ε?hλ?)ώηη>ϊζ<CF8A>ω<EFBFBD>;<3B>cυO­Κ?φ?μ-Γο·<CEBF>Γ}<7D>tύ‡}3gμΏβηϋ<CF8B>Ώ·½<C2B7>Σξ?ΌξώΗ¦ύίC<43>ω<EFBFBD>¬υw?ω<><CF89><0F>ώΏOρ<4F>a<EFBFBD>Α<EFBFBD>Πί.ύµύ<C2B5>+^·ξ(ΟΟ\<5C>ηύΦ<CF8D>υψΛΰΧξ_φ<5F>φΖ¤ρ?mϋ«<1F>pώΞϊλωθ‰<CEB8>¬ζ<C2AC>o<EFBFBD>ΏΝ²<CE9D>W<EFBFBD><57>Y²<59>Ρ<EFBFBD>δiΖ―Wά<57>[<5B><>c<EFBFBD>Ω¶<CEA9><C2B6>ΫΖ<CEAB>ό?Ϋρ―Ρύ<CEA1>Ώήgζ?Υν<CEA5>rόσ<>τ<>ωήΉ1ύ<w<>·Ϊώώ_;<3B>Ωzώρ<>Oς<4F>®θ<C2AE>{ηώ«ί<C2AB>47ώCώ?ω<>+ΩΏ½φ<C2BD>4<EFBFBD>_;ώ‹<CF8E>LώΝ<CF8E><CE9D>Ώίώ'ώΠη¨πχΦ8κ3Ό^ξsψ»W=<3D><>χΗψπϋόύζΐ<CEB6>Η}¥<> όΑί6ώR<CF8E>§<14><>ό«αµ<7F>w ~»ώƒώΠ_›ώ<E280BA>υο<><CEBF><EFBFBD>υΏnύ<6E>Ί<EFBFBD>aώΊυίΰψώ·‰?ϋ<>ώ <0A>{ί{ο'…/ύ=ϋΏΦψ³”ώ«Ϊ<C2AB>ΟGΫz’ΖµΧΏv<CE8F>›µυ<1D>λ<>ΞύΠ<7F>Θ<EFBFBD>+δΏLώΞΛµκ<C2B5>C<EFBFBD>ΫΡ<CEAB>Πϊγ<CF8A>Gώsώψ<><CF88>αόOΟωοωΧλ<CEA7><CEBB>·<EFBFBD><C2B7>ΛωΞ<7F>sώ<73>σ<EFBFBD><CF83><EFBFBD>ηό?η<>9<EFBFBD><39>ύoλό?υΏm<CE8F><6D>ηόυ<>ακ<7F>sώίζωόψ<7F>π<EFBFBD>Yλ<59>Ωc<CEA9>ΝθΎξωψϋίfύό?ΰώvγ?τ΅<7F>τ·ξ<C2B7>Σλ<CEA3>½FύS›ώ?κ<>R<EFBFBD>W›<57>ο$<24>μΥ<CEBC>ύ,ωΗώ‡όwϊ?c<>c<EFBFBD><13>Ηώ'ώ<>ό§<CF8C>;ώ?θo%ώ<>ύ<07>Cκ<7F>S<EFBFBD><53>ϊ<EFBFBD>«Π<C2AB>ϊ—ο―<CEBF>7ξ―<>·Bύ—ώ-υχδώ<CEB4>5κ<35>Q<EFBFBD>Ϋ^ύτ?υ©<>f·ώφς<>ύ<EFBFBD>mωΏbύο5κ<35>[ο<>Sί<53>Ν©Ύ<7F>ύOύκ<7F>S<EFBFBD><53>ϊ<EFBFBD>–τ<E28093>JώΏwΦ<77>/ωΏjλoNώϊύ<><CF8D><1F>?ώό<7F>οΦ<CEBF>ΏίώόπrσΦ‡ώqίωί§ΗϋτO<CF84>—ΒOιΏp ψƒ?ψΏ$•/ίω”“<E2809D>gω)Ε<><CE95>ΟΏί)ψuόΛγ·ν|=|ώ2ώcπ_<CF80>σσηΫ<CEB7>Πϊ―!<21>ό½dωsο_Ϋύξ<CF8D>ΏTώΟ›<CE9F><E280BA>ίϋgj¶ν<>uέ­ο™ό<E284A2>†_Γ§6>uέ~ψώ·Μ<C2B7>ΰoΫώ‰<>ψώ»ίοφρ‡<CF81>9φ<39>hΒ΅<>'<27>—ω<E28094><CF89>ρχ}}ώµνYόgFύΫUβ?±Ώ?-Oγί<CEB3>~·<><C2B7><EFBFBD>ϋ½<CF8B>ϊoΗίχ»KΧ|Ώqψωρώυϊ<>ϊΝ~<7E>w?ΏωοΗ―ζι<CEB6>vωλλiύλϋ?mϊ<6D>Μϋψϊόk―Ώuμoμ?‹φώβ?ϊKρo΅_/όyτπ·‚Ώ―ΛΚ<CE9B>SυψJ9>s®—’<E28094><E28099><EFBFBD>ΗΏ4>¨ω|ϊώ)όΞ_όοΒη<CE92>ϋOµΔ―ZΰΛγ_RϊΛΦ<CE9B>¶IηΏοyΟΏ<CE9F>·ώΖθ―Γ<E28095>Rϋ†ύ«Y<C2AB><59>ΊόΧξ<CEA7>¦-<2D>eύί<CF8D>ύάΌ΄τΌ_ύΧ™ό<E284A2>όCώa<CF8E>―c<E28095>Ο°?Gμ<47>ϋγ/¥?φ?φ?ό<0F>λςΏ]όΡ<CF8C>ψ<EFBFBD>π<EFBFBD>΅<EFBFBD>mλψώ‡<CF8E>νπΏυόGΖsώ<73>σ<EFBFBD>γω“<CF89>υ§<CF85><C2A7>IώτΧ„Ησ/3Ο<33>¬sώΟζωW<CF89>^aφτώ Oiώϋω<CF8B>Ϊώ¨η:ω<>³ΞΏ¥Ώo9<6F>·ΖωΞ<>qώ<71>ύϋ_[γ9<CEB3>CύΞ_£<5F>8<EFBFBD><38>όΗ<CF8C>ƒ<EFBFBD>ϊΫς<CEAB>a<EFBFBD>Α<EFBFBD>Π<EFBFBD>ϊ/Τ<>³^<5E>i^ύ‘<1E>ηΧ<>LόW<CF8C><57>'‹<><E280B9>Ε<EFBFBD>Φ©<CEA6>”ΖΏζ<CEB6>W<EFBFBD>GΗ<47>/<2F><>Ν³?uβΔ<7F>Ρ<EFBFBD>Τ¦ώρμ?‹φρoδ?ωvγ_#ϋΏγwsλΏκτ<CEBA>΅ώ?υ<>Ι<EFBFBD>#ώ<><CF8E>WΗ<57>·Nύ©ώ‘ΖΘ<7F>'<27>_7<5F>_f<5F><66>ε<EFBFBD>―S<E28095><1F>?ύ?­Ε<C2AD>_OτΆ‡<CE86><E280A1>ρ|ιλ<CEB9>^<5E>sί¦―Χξ<1F>—Β―έΏχωΐό?<17>W-’°ώIωsψ’β~…πjψΧΖΧ_e|ϋαχήϊCϊkΧ?Ό;ώ<>υΏ^ύλZύ«s­«9ψλΤƒ<7F>αψί.ώΦν<CEA6>Γσχϊ/sπ<73>λεO<ξ<1F>>bό<62>λgϊΏ~?ώ<19>>τχιΏmηώ79}χΉ‘<CE89>_ΫώoΑΏ¶ώrσΫ#ξϋp>5ΧΏv<CE8F>›ΦΏ<04>ςοΞύΠ<7F>Θιϊϋ¦Ν<C2A6>Ώgω<67>–Λμ<CE9B>Π<EFBFBD>θθo—ώψ<CF8E>‰<EFBFBD>Tν®s<C2AE>ψ<EFBFBD>‡Ϊ<E280A1>#ρ<>ΈΙψωΛ1ωΫ7ΎlΟΘϊΏHε<48>=γ}τ©ο<C2A9>{η_2ώόό<CF8C>λO[Ύ<>ω<EFBFBD>]>qlίηΖ—ύ<E28094>zπ‘<CF80>#ϋΏp?#<23>]ω?²<> Χ_Λό•χwγΏyώoβ<6F>Δ?±<>ο–<CEBF><E28093>^?µ-<2D>GΣώΡ}~νω'<27><>ό?ψ<>ό?«ςΟΊ<17>ώ?ό–ύ2ϋoFώΏnόώΗώΗώΧ:<3A>sχσ/ΰώ<>…<EFBFBD>{υΏ¶ό—κ<E28094>4όπ»ϊώ ϊC-ϊKλmΫωϋη#]_κωHΧ³ZγόΛXύ«yς_
_Z<EFBFBD>φL<EFBFBD><EFBFBD>?<3F>t–Φ?σy ―<15><>ψ<EFBFBD>ίωόW‰<57>[Φίλ=Ε<>ΟΗ™<CE97>µΧΏ6<CE8F><EFBFBD>ό―<>χ|Μ<><CE9C>Τόϊσ<CF8A>®gSώa<CF8E>«Η<C2AB>Ϋψ?φ<>ημ<CEB7>¤ύΣ®θΏφΞυo]<5D>iΣΟϊϊ»<CF8A>ό<EFBFBD><17>Χ<EFBFBD><CEA7>"<22>΅<EFBFBD>Zπ±<CF80>°<EFBFBD>π<EFBFBD>C<EFBFBD>χϋΏθi»<69>#ύ_-®ϊ<7F>Π<EFBFBD>‡ώ?Vϋ<56> <20>Π<EFBFBD>²ϊ―σϊ<CF83>jΛλύ±<7F><C2B1>φδςV<7F>λ1ϋ<CF8B>υ/νΏ+¥<>}ϊ<>¦χRύ―c<E28095>£<EFBFBD>uω<75>sδ<73>T<EFBFBD>λμ<CEBB>­Λ?τΏ®<CE8F>―<EFBFBD><E28095><&gζ<67>·λ©<>ύ<>ώΗ<CF8E><CE97><EFBFBD><1F>?ώόΰώΰ=ώ<>σOσδΏ<CEB4>ώ·.<2E>΅?ϊ<CF8A><7F>§}?Ί’<CE8A>ΟΊ<CE9F> ϋώ‡<CF8E>ρƒ?ωί­ώΗ}ύ<>­γsρ/Mψ#τ<>¤ρδ<CF81>α<EFBFBD>ο<EFBFBD>ηόωµρΉψ<CE89>λ<>ψΏμ³”~³<>ηέΟoGώ»υ<S<>·Λ__<5F>o[ϋσηκΟqώC<CF8E>ώ#σί>Ύ><3E>ΪλoϋϋΟΆύ‡<CF8D><1F>ρ_πλρiόgΜΏΌ<CE8F>ό·™<C2B7>Kό<4B>ύη_‰<5F>°<EFBFBD>γό?η<>‘Ψ<7F>Vρ'<27>‡ό?μς<7F>ΰς<7F>Θ<EFBFBD>Γ<EFBFBD>‡<EFBFBD><0F>ϊίΞω/ψώ‡<CF8E>mρ<6D>λ‰^τπρ?<3F><>λ\?_wςσυ?χmϊzνώρx)όΪύ{<7B>ο³ρυ" ϋ<>τ|–®/ιύ¥Οί?<3F>ΏΪ«vθ/ϊΟ…―)ίεωίςόη――W>³?>χόώύ<CF8E>Α?®ΧΖΧΟψΛς_¥ς¥ώO®}Ύ<>Uόϋωσ<CF89>ξώ{_<1F>¦Φ_mΌ=ζύυ/Ν<><CE9D>ε?hλ?)ώΗύΓω?ζΉuώ<75><CF8E>Ήσ?V<>ΤΆόΓώgkύzΏύΎ¤λ«¶_κί•<7F>·φΉϋ?νώΓϊϋλφΏ.ύ¬―Ώ{Κόψ<7F>π<EFBFBD>}‚<>ϋώ‡ώ–ν}<7D>£&|λφίΨόΟσήsύΟυ<CE9F>ώϋw.ό3ώ!όyρiόOΫώΓ?<3F>Gr~όXώ—β?kω<6B>ϋβgσχ<CF83>ο<EFBFBD><CEBF><11>G<EFBFBD>[<5B><>΄ΔΏcyΛ3ιόkΛλρμ?»φρoδ?ωvγ_’ύ<E28099>Σ<EFBFBD>ωwμO¶­έώOΕ?KγƒλΡ<CEBB>Gτ<47>άύίjϋ<6A>wς<77>=σ<>­η<C2AD><11><>$<24>―¦<E28095>O<4F>5β<CEB2><17>!<21><>ό<EFBFBD>Υς<CEA5>{μΏω<><CF89>ρ_ό<5F>#ό3/ώ―c<E28095><13>?Ζu$γχ―Μ+χ»ΪψΪχΐ>πί?νx>rς%φ?\ Ώ†Ϋώ»μ<C2BB>Π„ύ΅Ώ6ύΟυ§γϊΥξ<CEA5>cυ―συ§ο<C2A7><CEBF>έη?½<><C2BD>χoΞο?ζΰ<CEB6>‡_ΗΏe<CE8F>YΪ<59>ΐ<EFBFBD>πΏuώ·‹?ϋ<>4|λοΦχΞΏXΎ.<2E>ηUν<55>Vό΄ηoΖό§ε―“³ρυηcήψuυΏμωο2<CEBF>θδ<7F><CEB4>ς<EFBFBD>]ς—ύϊίΊώ‡ώΠ<1F>Ώeωoϋό3ψ<33>σ<EFBFBD>Υόόλαkζ<6B>ΕyssΞ_<CE9E>σ<EFBFBD><CF83>yyιό;―Zό«-<2D>―~OόmFόKχόOjώΫσ/Sψ§σ<C2A7>άσrώ§®<C2A7>BϋuίeϋλΪύ<CEAA><CF8D>Ήπχ}Φώί‚ό?­<>κη³Ό’Π_[ώΧπ­­ΏάΌ΄Ξη<CE9E>λ_ϋΊ6<CE8A>έ}ώ<>ΐΏξόοΌώχ<<3C>όIη[χ?ιύΚ<CF8D>υ7Ύ<37>JΫ<4A>©ρ%ϋ<> ?wΎiΜώ/ΫπΏ6<CE8F><36>οΏ―X<E28095>Ϊϋkς<6B>ϊ<EFBFBD>ψ<EFBFBD>π<EFBFBD>α<EFBFBD>³[<5B>gάώ›±ώ΄ν/ψϋί¶ύ―Ύώ€|ΰίPώΏώuς5ψΠϊkΠ<6B>όώχσΞλq|*w=Δήψπύ8WβζίΥΚςοΥόχΓ/<2F>χΏί6<CEAF>άL–><3E>οsηί―<CEAF>8‚<Ύφύy<1F>Γ―¶ώZΗη>―±ώµω<C2B5>~ςοξσo]ώΩµ<CEA9>uγϊρoλψc<CF88>Ϋ¶<CEAB>χ=”<>nύψυaΗε―<E28095>ίοπώ묻ϊoύ¥ςoήϊ‹Η·α<C2B7>ώΣ‰<CEA3>kΗ‘<7F>Φι?^<5E>½<EFBFBD>ώaό?ξ?€ύ‡ύ‡<CF8D>ϊλΡΕϊSχ¨¥]σ:ψΦηί<CEB7>ϊ—ϊ<E28094>¥οΊυ<CE8A>εψIύ<49>Ϊο<12>ΓΌϊγiψρ_όόΧϊ<CEA7>ί³ώ<C2B3>θ<7F>Υκ<CEA5>χΛ/©ώΡ–<CEA1>)όΗ<CF8C><CE97><EFBFBD>σ<07>!<21><>ΐ—ΑΧ~Χ^<5E>α{«ύyΥόχΓ/<2F>/}?g<>7w<37>©m<C2A9>ΫΣ<CEAB>kρ<6B>ύδίέηί®όc<CF8C>·<EFBFBD><C2B7>ο<EFBFBD>ςw<CF82>ώ‘ϊΠ<7F>θό<7F>ψ<EFBFBD>ρ<EFBFBD>γ<EFBFBD>§<EFBFBD>π<>|ϊΏΣ<CE8F>ϊCϊΣ<7F>ϋ½ρ<C2BD>¶όΣ9ψλΪίπ?όo›<6F>ι<EFBFBD>k{<7B>±οαψΪηήχήϋIαKό/χylώέύkχ›?O<>_ϊΏ–ϊΟ»~AΗϊ γϋ.‹?Δγλό<CEBB>Ξυ/‰<>Μ™νψO<CF88>ώ‡ώ<®<>κ<EFBFBD>ΌόK?;ό΄ώ<CE84>ΗΧτΏuω?ή<>O<EFBFBD><4F>kύΛjϊόκώVϋ?kΣΫΪΦ<CEAA>Υύ/ΗΦ_{<7B>Cmϋϋϋ<0F>?ρϊ/ψVϋ<CF8B><7F>‡ώ?τ<>±Ϊ<C2B1>‡ώΧ¶ε½}ω]:<3A>Ϊό'ΕO{ώΰ?δςψwν<77>wgό?±<>"φ?ύ?α»όo τ?ώ?όθτ?ό<0F>Γ<EFBFBD>–ψίzώ#ψsώ…σ<E280A6>ϋ^Ξ<><ΎΝ<>*ηλη’<7F>k›ώϋ>~L<>}α»ϋ―qώe½σ?οΜζόo®<6F>ex>(UΏlFώ©<7F>]ύό<CF8D>Ό<EFBFBD><CE8C>υόΝσgλ<67><CEBB>·tώ<74>σ<EFBFBD><CF83><EFBFBD>g<EFBFBD>ΟωΞ<7F>Ψ¬<CEA8>3~ώ»MώΊϋϋ6Χ:ϋμΞ<7F>sώ<1F>ώ?όφόΨ<CEA8><7F>†ώ6ιOύ?ό+Τ!YΝ<59>fε]<1A>‘Ζ<E28098>V°<56>¤ύ<C2A4>¤ηοV©<56>—<EFBFBD><E28094>ΧGλΧφ<CEA7>λΕ<CEBB>¬Ψ<C2AC>θςΏ¨<CE8F>g7ώ<37>ύgΫώ#ώ<>ό'<27>ΟnόKΪΏtΞώs½ώ?Τ<>§ώ?υ<>‰<EFBFBD>[<5B><>―θ<E28095>{gύ‰ώ™sώ•ός<7F>5νί9ύλGυ<47>vό<17>?ύ?νζ„τ=<3D>/G<>σό1<CF8C>ρ<EFBFBD>Ώ<EFBFBD>ψΈ.IΊώΛΉ~Κ»ΰ_ύόΪπ΅?τΧ•ηχίοw^Ώ;ώχ<CF8E>ι<7F><CEB9><EFBFBD>kχΏφωαψί2<CEAF>ƒΏMϋ<4D>ήυ§επ΅ΏnύWmύ«_tώ ίsςΣ<CF82>]Ώ<ή<>~%ω;<0F>»Ο?ϊω―Q<E28095>[WώZί<5A>΅<EFBFBD>Ρ<EFBFBD>Πί.ύρ<CF8D>γ<EFBFBD>sη;<3B>σ‰Ήσ<CE89>cπγρξ|VzΌ~*<2A> ό‰3Ύ΄ώΓ½bιso|Ζ<1F>ΚE=ΦgZ~Ίί·―<C2B7><E28095>ψ6ω/<2F>?IεΏήώwύeςoΫΪΰ·Δ<C2B7>Z<EFBFBD>χόϋyλ/e3»ϋψηυ<CEB7>;εΏ¬ώC›ύιξ¦9<7F>{ ~Oώ7ώ<37><CF8E>ώ¥υ?¶<>+Ρ_[ώ<>γίΎ<CEAF>σρ<CF83>ω_{ύ[<5B>Ώ<11>ΔώΕώ/Ϋη-φ—ΤώΧί<CEA7>Kρ—ξ<E28094>ηΝz~Ι<>#<23>ώ'<27>―<EFBFBD>><3E>.<2E>πγ<7F>Γ<EFBFBD>‡<EFBFBD>ΟΆ<CE9F>o<EFBFBD>ύ'=Ά<1D>µΛ<C2B5>Ψ<EFBFBD><CEA8><EFBFBD>a<γΟωςΏ8<CE8F>ύ-ζλ<7F>?Y'ώeΣ<65>—£i―<69>ϊ<EFBFBD><<3C>XΗώ'<27><>σ<CF83><7F>γόρς<7F>-η<>c<EFBFBD><13>'ώOό<4F>ψΏmύW‹<E280B9>Θ―¶ψ―vό<76>σ<EFBFBD>VιOόϋ<0F>?τ·κ<C2B7>Χξ?£ <09>οΎ‹aΖΧ?kΌυω·Ύώ¥ώg?<3F>δχ£qt ―Ηί—εW<CEB5>~Wϋ<57>sxΜτ<CE9C><CF84>ύΤη―6ΟςωσHω―ύώιΏkύ7Χ―?δϊ_›ώ’ψ³tώΧ‘<CEA7>ZύΗΰ?δς<>ρΪλ_Ηώ\gύK<CF8D>¤τΣω›·<E280BA>“κϋύ―Λ<E28095><CE9B>#<23>ξ><3E>6εϊ_Χ<5F>§-ηι©<>ύ<>ώΗ<CF8E><CE97><EFBFBD><1F>?ώό_ΐ>πί©<CEAF>uβ?+Ψ_ΨΠ<1F><>M<EFBFBD>Ώu<CE8F><75>φώήώλ<CF8E>ϊπ?ό<>ωόώ¶ν<C2B6>}Ηί½>ΗΧCψΉη/<2F>ίχςx)όxόίOy|<0E>cώ<63>λ£σοξ|ώ#O)όxό<78>ύνσSx=΄<>[θ_›<5F>νισΏsώ¤γΏ΄}ξ}o»<6F>ήϊΕk.ύτήsτωύ><3E>§Ρ<>mςO
??Ύ¦<CE8E>­Λ<C2AD>\<5C>Ώp>ΗεWM<57>ηϊ<CEB7>µκ<C2B5>όψ6ωk}<7D>·*ύ[Φ<><CEA6>ώwϋ>wύ=εωsχ[ΓώΕώ³m<C2B3>α<EFBFBD>Η<EFBFBD>|ΰ<03>σ<EFBFBD>Φς­η<C2AD><11>C<EFBFBD>kΫ<6B>+<2B>·<EFBFBD><C2B7>ΕώΟΞώώcώ±Ώ­Γ'<27>‡ό?μς<7F>ΰς<7F>Θ<EFBFBD>Γ<EFBFBD>‡<EFBFBD><0F>ϊ<>σ<EFBFBD>π?ό<0F>.<2E>}½ς±όό§£?ΛλI<CEBB>οΝχoώ»ίλϊ¶…γ_xϊγ<CF8A>λGΧ<>ευϋΉπγρξϊQ<CF8A>Α<EFBFBD>π>ΚΟοF<CEBF>αό•αύ<>\<5C>bΧ<62>θθ‡δϊ…}<7D>g¬<67>°oς~mύ<6D><CF8D>+~ώ°<CF8E>rκϋ^~yώsσ<73>
ϊkΣίηΒ<CEB7>αΈϋ§ζS[ώΛσΏeωΟ)όΓλ±~~>ϊΖ<CF8A>ωλω<CEBB>“<EFBFBD>:ƒ<>τϋΏ<CF8B>ΧhO§ιοΓ+Σηl_•ζΏΤ―<05>t<EFBFBD>?ΗΟG<CE9F><47>c~(α—<CEB1>¥ϋ<C2A5>οΏβϊ—<CF8A><E28094>i―­<E28095>®xώ;ΝΏuωΗώƒύΏeόkϋ<6B><CF8B>~iΞώCw<43>e}<7D>—·<E28094>Ού‡Ηδ―Ώ<E28095>‰ϋ?―°<E28095>Αώ¥<> ωW:<3A>;¶ώϊΞ<CF8A>"<22>ρ<EFBFBD>α<EFBFBD>Γ<EFBFBD>gΥ<67>‡ύg<CF8D><67>΅ΏeϊΧό³ύώΗ><3E>―¶<E28095><13>‡ΜyΕum<75>›6ώοΌ.<2E><>HγΪφί9ώ”ΚGΛϋΟλρ<CEBB>ς»Ύ<C2BB>ίGβo³μ<C2B3>γ–μτ?ω_=ρκm›<1B>_q<5F>o)ώ<>ύgΫώ#ώm>ωγ_£ϋ<C2A3>vύί—<CEAF>τzwΪΊ7ώ™_²<5F><C2B2>‰}#έ<>­<C2AD>_<EFBFBD><5F>υγ<CF85>–ς<E28093><CF82><EFBFBD>[φ<>®θ<C2AE>“νΏφ]βλΡ?3β?δ<>“<EFBFBD>ΏRώ―ύ'Υ?ΪρWό<57>-ς/=_Wδ?^o<><13>?®υβχ―Μ+χ»ΪψΪχΐ>πί_*®†_Γ<5F>j<EFBFBD>λΥπ΅?τΧ¦Ώfύ΅»γχω—ϊζΰ―[ ώ‡<CF8E>mσΏ]όΩ¤α[·Ύ<C2B7>kυKηyUϋΏ?νω›1<E280BA><31>ύgΦΥ<CEA6>²ηΏΛό£<CF8C>‘<EFBFBD>+Κ<>wΙ_φθλϊϊCό<7F>–ε?υ<>8<EFBFBD>ΟωΞ<>τ<EFBFBD><CF84><EFBFBD>Q<EFBFBD>oΝσ<CE9D>δ<EFBFBD>rώ<72>σ<EFBFBD><CF83><EFBFBD>ηό?η<>9<EFBFBD>ΟωΞ<7F>c[;<3B>o¥ώ7η<37>9<EFBFBD>Cύκ<7F>S<EFBFBD><53>σ<EFBFBD><CF83><EFBFBD>Η<EFBFBD>‡<EFBFBD><0F><>¥ώ<C2A5>γφί<CF86>υ·ζωKό<4B>ύo»ώ?π<>|»ρϊΏΠ<CE8F>ϊΫυ<CEAB>­Χ<C2AD>ϋ½υO­ϋ<C2AD>¨<EFBFBD>k»ώοzό'ωw<CF89>ϊΏ¶εϋς<>mχΖώ'ώOό<4F>ψ?ρ›ςίz<CEAF>wλώ?λτ·<1D>ΗώΓ<CF8E>ύ©<CF8D>Ο;υ™[οsόΗ²ϊsΪυ_Jψ<4A>><><7F>_»ώυΏ­Φ<C2AD>AίS<CEAF>‘ϊovλΏΑΜ7ϋΫςΕϊίϊυΟ­χ<C2AD>iΫ<69>]·<>Τµ<CEA4>©<EFBFBD>Oύκ<7F>S<EFBFBD>ί†ώ_Ο<5F>χΞϊ<CE9E>ύ3Η<33><CE97>ώG<CF8E>γ<EFBFBD>Η<EFBFBD><CE97><EFBFBD><1F><>»υ<C2BB>΅?<3F>N<EFBFBD>η<Ύ<1E><>ρ<EFBFBD>gό]Η‡ςύ<CF82>O9ω–<7F>ΧΒΏώωµαCθΏ†όΠώ»;ώχ<CF8E>·>Οο-ΧηρνώΧ<?ό<0F>[ζπ·m<C2B7>»σ<C2BB>ΞΰΞOϊΏχ?»ϋϋg.σώo)όx|Ι<>ύϋνί<CEBD>υΚΓ›<>xΌ<78>jΌ~
<EFBFBD>ύ%η<>¥ρmύ«οΤ<7F><CEA4>μ{θοwλΗηχίοόϋ]ώή|ί_{ύ<>ύ”<CF8D>?Ζ%<25><>ψόΟ<CF8C>__Ίo‰ήyzµλΟ6ω'…/ύ½]ω/©<>1C<31>ηλ?ΤυΏ΄ώƒυύ<CF85>6ύSσΧ³ώΛγΫτ<CEAB>ΎΟ]}υotν_μ?Ϋφώβ?βωc<γλρ<CEBB>?iό%®‹’®<E28099>\zώςψπZό;9~Rψςψ•tώ¥τΏvύ]ύόΪλO‹<4F>Χ«?<3F>^ψΦεΏv<CE8F>7mώΣο?<00>!<21><><EFBFBD>Χ―kή<1F>{Ο?φΏMϋώ‡<CF8E>Αύ<><CF8D><0F>ϊί®ώ‡<CF8E>αψί<1E>[ΟΞΟ[?<3F>ος;Σω“αυώό¥<CF8C>ϊΧΞ<CEA7>$<24> ϊηρƒΣ?<3F>??<3F>w<EFBFBD>ό<CF8C>σ?+<2B><>³|ώΥ§χσq¦Ώ[Ώξ<CE8F>~}Έyω<79>ξ½ηόOm|m<>@ώΏώω3νσ/ΦΟ<CEA6>qώίφώ<CF86>ύΏ]ό9<CF8C>Cύ<43>9ηΏΫΟc―tώύΗωλς<1F>ώ?ό6ύΨπ?τ§ώ υ<>μΦ<CEA6>¬?²<><C2B2>W―ώή*υ<>dρ<64>±ψί
υ<EFBFBD><EFBFBD><EFBFBD>σ{«<>}^ύ<1D>Lί}βλ½υΏΫμ<CEBC>ψρτ?υ<>©<EFBFBD>GόϋΟΆύGόωo=<3D>Οrό«¶<C2AB>‰νη‘όΏ¶ϊ£:ύ¨<7F>Oύκ<7F><13>§ώΏ<CF8E><CE8F>o<EFBFBD>ϊ<EFBFBD>Rύ#<23><><EFBFBD><EFBFBD>OώΏfύ©ύ7ξ^£ώΏ]<5D>?ύ?­Ζ<C2AD>_Oς’Ύ<>τ<EFBFBD>Oιλξω_<CF89>sί¦―Χξ<1F>—Β―έΏχωΐό?<17>Ώ}ύm[Ϋηπ%Ε<>ό
αΥπ―<EFBFBD>―ΏΚψφΓο½?τ‡ώ:τ—ηΛςξ<>Ώtύ·Ε―{η_’<5F>ώZ<CF8E>Η~<7E> <0C>\λjώΫΦΏ¥ώV<>_ ώ‡<CF8E>α»ψ[·<>ηίOθ<4F>ΜΑwώ­—?ρΈ8ώω<CF8E>ρ?®<>ι<EFBFBD>ϊύ\ψgόCψΠί§<CEAF>΅/]<5D><>ΌΎ<CE8C>ϋάHι―m<E28095>·ΰ_[Ήy‰νχ}8<><38>λ_<CEBB><5F>)‹¬°ώ%ψΟ<CF88>¥ψηΨόχΖ?Ρ<>Θωξ›6Cώ<43>εZ.³<>C<EFBFBD>£<EFBFBD>΅Ώ]ϊγ<CF8A>'ώSµΈΞuβ<75>j<><6A>Δ|ύ5²<C2B2>ε―όν_¶gzρ?ο%ς<><CF82>ρΏ>ϊΤχ<CEA4>½σ/~~Νυ§-ίΗό<CE97>.<2E>;¶οsγΛώ=ψΘ<CF88>‘ύ_Έ<5F>‘ΞΏ®όΩ<>…λ―eώΚϋΏ»ρί<<3C>7ρOβ<4F>Ψ<EFBFBD>wΛ)Ω_ύφΏ®ύ£ϋόΪσOώωπ?ωVε<56>u<EFBFBD>.ώ?όψ<7F>,ϋ<>dφί<CF86>όέψ?ό<>ύ<EFBFBD>ύ―uώηξη_ΐό? <0B>χκmω/Υ<>iψαwυύτ‡ώZτ—Φση0W?ΜΏ_ύΏw<CE8F>λ1OώKαKλί<CEBB>ιςG<CF82>Ξ<EFBFBD>ϊw>¤ΰµβ__ϊ;<3B><>*ρΛϊ{½§ψ<C2A7>ω8σΏφϊΧζ<CEA7>Ο‘γυ<1F><>Ήσ<CE89><CF83>_ώΣύolΚ?μυψ3γo<1B>Ηώ<CE97><CF8E>ύ_Uώ^|]{ύ[ΧΪτ³Ύώξ#<23>ηΕ<CEB7>µγΏΘθΏ|μ?μ?ό<>Π<EFBFBD>ύώ/»ύι<7F>¤Gϊ_λχ<CEBB>Ρμ<CEA1>µN<C2B5>η4ώµώ‡σϊ?ΝλΏ<CEBB>κ—Uκ<55>#ρHε<48>v<EFBFBD>―²ύ<¶ώzμδϊ ϊ<>Ε<EFBFBD>ηυ<CEB7>Σ–<CEA3>vϋ<76>a<EFBFBD>!<21>¬Κ?δΏn<CE8F>οuΦΏΝώΧτ<CEA7>E<EFBFBD>kς<6B>ηΘ?©ώΧΩ<CEA7>[—θ]<5D>_9<5F>yLώΞΜ<CE9E>oΧ?R<>ϊύ<><CF8D><1F>?ώό<7F>ψΏ¬ψ?ΑόΧΐ_'ώ£m<C2A3>c<EFBFBD>AθoΧ<6F>oέ<6F>§½<C2A7>―<EFBFBD>nί<CEAF><7F>†<7F>αψό±<CF8C>Ογ_<CEB3>γλ<CEB3>ώοΰςψάόϋγΏΫΗηθΏό³ώϋϋI]ν<>Τϊύϋι›<CEB9>Uν<55>άσ<CEAC>ύ”<CF8D><E2809D>ω(Ο<>»_™<5F>[αΧΖ<CEA7>ύ”Ηηδ<CEB7>{?k―<6B>φηMΏ<4D>―<EFBFBD>Ώ<EFBFBD>πηύΎ¦Σφάόωοƒ_<1F>³?‘<>}ς?–_sτo»όmίσόψ<CF8C>V£Λϊί¶v<C2B6>enώΧXΪφ/φ<>mϋ<0F>?ηπ€?ψsώίNώ―υό?βθ<7F>}<7D>k<6B>ωΏ΄ν_ςΏΨ<CE8F>Yή<59>­Η<C2AD>Θ?δφ?ω?δ<>`<60>c<EFBFBD>Γ<EFBFBD>π?ωδ<7F>α<EFBFBD>Γ<EFBFBD>‡ώG<CF8E>Γ<EFBFBD>π?ό<0F>Kω<4B>λλε<CEBB>ςρ?<3F>οΕ)ΗwΫζΟΟΏϋΧkγ<6B>λG}ΰί ώσΒί¶pό§ώσ1~<ή]?κsψςί:ώΫvξΌma?Ώ_±<5F>ϋλ―Ώ¶ώ[<5B>ίή>mπΓωί¶s<C2B6>η°L>τΏύηΒΧ–<CEA7>ΧεΟ·<CE9F>O=<3D>;―Kς_gΘ<67>UϊΏϋλ7eOΗτσαΝ<CEB1><CE9D>R<EFBFBD>­σϊΩ¶φρΟΗΉ<CE97>V<EFBFBD><56>{π«<CF80>—ή_oύ·ζΘς΄υ<CE84><14>σσ?}σ<>|Μ<><CE9C>xόσQo[ώ±<CF8E>a<EFBFBD>k~Ώύξs¤λίΏί<CE8F>ύWόό><3E>Η}:Ω<>υΛ<CF85>²ύΥ{ώrέύ<CEAD>MϋΏ‡ώ:σ<>Yλο~ς<1F>ώ?ό<CF8C>β<EFBFBD>Γώƒ<CF8E>΅Ώ]ϊkϋWΌnέ<6E>P<EFBFBD><50>ΉώΟϋ­<CF8B>λρ—Α―έΏμ<CE8F>ν<EFBFBD><CEBD>HγΪφW?ώαό<CEB1>υΧσΡ<13>YΝ<59>ί›e<E280BA>―<18>³d<C2B3>£<EFBFBD>Ι<EFBFBD><CE99><EFBFBD>_―Έ<E28095>·<14>Ηώ³m<C2B3><11><EFBFBD>?ωγ_£ϋ½ΟΜ<CE9C>Ϋ<EFBFBD>εψηy|θ<>σ½scϊyξώoµύ<C2B5>
όΏvώ³υό?β<><CEB2>δ<EFBFBD>]Ρ<>χΞύWΏ<57>inό‡ός<7F>W²{ν?iώΏvό<17><><EFBFBD>ό›<15>ΏύOό<4F> Ολεκ1΄}ξ}υήO
_ϊ{πψΗς%–Οιλ±όΗ<><CE97>OΗ<4F>cψ5|jγΣΧέσΧπƒί{θύuθφtγsυ‡Ξυƒ\-©σ}sγΧ‘Rό¥λ?=<>ωOΥϊύN<CF8D>νλc}ζό±<>@<40><>a<EFBFBD><61>~§ΰΧρ/<2F>ί¶σu<CF83>ωαψί6<CEAF>ΫΖίΊύΤ όϋ λζΰ‡Ώ{Υ,}<>ΏΟίoό3ώιη‚ώ<E2809A>ό)ύµν<C2B5>ώµυ'υj―νϊη+¬ ώ<>υ―_<E28095>ύ<>όΧ“<CEA7>µψΗ<CF88>όm<CF8C>°<7F>C<EFBFBD>[Χ<>Πί.ύρ<CF8D><13>©<EFBFBD><C2A9>λ\ΟπΏtύ·ρo/όyό<79>ιψ<CEB9>γ?ΫVΚΏ:ηO<CEB7>Δ<EFBFBD>Βη+Υ›i™ΏΪψr=›^όΟρ£ϊ«ΏΏΚΓ—ΖΏ¤τ—Κ—±ω—<CF89>??ΏζϊΣ–οΦΟ? <20>uλ<75>ιΛκh<7F>^aύ[><3E><>ύ<EFBFBD>ύ/±ίgΨ<67>Ίφ<CE8A>ξσkΟ<6B><CE9F>ύξn$λίν_¶md<6D>Υ6>>σΣΎ?kα?ΙώώΏ#<23>Ο“<CE9F>λν<CEBB>mΙ?λώ]όψ<7F>π<EFBFBD>Yφ<59>ΙμΏτϊsύΥΫψΏΜ/ύφΧωόξ<05>c<EFBFBD>c<EFBFBD><63>ΫΏRώΏ§ύ ώΰ<CF8E>©ψΏW<CE8F>kΛ©ώOΓΏ«ο<C2AB> ?τΧΆΏ;<3B>Χ»zΡΠ―‘Φ_z<5F>[ρηΠ―/υϋ}|οί_»ώ]<5D>_ό|©λn}Ο”<CE9F>Rψωρρu|‰ώ!¤ι<C2A4><CEB9>G<7F>zύM<CF8D>RπZρ/<2F>/ύΙκ?¦λ<C2A6>Ήyi©?ΈJύGώ<>ω7¶ώγy›1<E280BA>©ωυη?ζΛςϋ_=ώΜψΫΖ<CEAB>±<EFBFBD>?g<>W•Ώ_Χ^<5E>Φυ<CEA6>6ύ¬―ΏϋΘ<CF8B>yρνψ/ςϊ―ϋϋ<0F>?τΏ<7F>K£ώΧέλ_Iλ<49>κΧ<CEBA>Τ¦ΏuόµΧΏΤ<CE8F>νΗ‘ώ~Ξίϋϋ­Ώ<C2AD>^<5E><>Υυ<CEA5>λψ§β•?sύ<73>ώύzα§ζ?<1E>ϋ<EFBFBD>¦Λ <0C>ΏTώΥό©ΟΏίος<CEBF><CF82>­Ώϋω‡ώ_ƒώcρg)ύΧ‘<CEA7>)όλλo<CEBB>όΧΦ<CEA7>ΨΘ?{ςωΪη3μΟϋ<CF8B>υ<EFBFBD>·7Kφη<ϊKα<4B>ύ~ήώO<CF8E><4F>uμτΏ.<2E><EFBFBD>ό“κ<CEBA>ύΏuω‡ώΧυ<CEA7>•σ<E280A2>ΗδοΜό<CE9C>vύ#υ<> <EFBFBD>Ρ<EFBFBD>ψ<EFBFBD>ρ<EFBFBD>γ<EFBFBD>Η<EFBFBD>O<EFBFBD>#ϊΏƒ?ψΣ<CF88><CEA3>ώ/ΠϊΣ<CF8A>›ώίΧψdη_εψλξ<CEBB>ΰψί6<CEAF>Σ<EFBFBD>Χ²ύψ ϋϊO<CF8A>ϋyΦΖηϊjΓ·ώ™ώ―τ<E28095>νΟsτ υGmό9ώ³Βϊ—δ<E28094>Νθ~ΏόΏ™σ/ƒ―ύό6εΘΟύ;&έύ®ξ<C2AE>χωϋ?]ϊ<>Νϋxi<78>Λ«Χ<C2AB>¶ύ‹ύgΫώΓ<CF8E>Oό‡ώ<E280A1>ΰώτ<CF8E>¤<EFBFBD>ύθ<7F>c­<63>ύ―mΛ<6D>}oι_οΧ«χλάΟθ<CE9F>®+<2B>λψΧΦ_n^byδΎηSsύkσ?ςω‡ύo·<6F>ίέρ<CEAD>ΌώίΨ<CEAF>τ<EFBFBD>„<EFBFBD>νςΏ-όΡ<CF8C>ψ<EFBFBD>π<EFBFBD>΅<EFBFBD>Ρ<EFBFBD>π?ό<0F>[γςαωΜωΞ<7F><CE9E>ζOJΧ“vώ'ω_Π_ώ=ΟΏΜ;<3B>£<EFBFBD><C2A3>lύόοHύ<48>™η?Fκoµ<6F>―Χί"<22>_³ώύ
η_8<EFBFBD>Ηωφ?μo-~ζόυ,<2C>ΏΖώηό?ς<1F>ώ?θoΡ<6F>‡ύ<07>C»τ§ώ<C2A7>νΟcσ?Ο<>yΟυ?<0F>•κ<E280A2><CEBA>Δ¤ρΏκ?Iϊ?Ν8<CE9D>§λ<C2A7>—ΕΟδϋέψ<CEAD>uϋύo;ώCύ?Ϋρμ?Ϋφρoδ?ωvγ_cϋΏyυ_Wθ<57>Jύκ<7F>“<EFBFBD>GόίjύM<7F><4D>φώKΪ<4B>Y~ώ•ός<7F>ΧΘ<CEA7>±<>¤ω<C2A4>+Τ<>Η<EFBFBD>O<EFBFBD>OΛύ_~φΧoXΏΓΝί™<CEAF>] <0A>ςx·ώγύπ<>όuΰΏή]<5D>”π<E2809D>ροίΏ<1D>τxW9¬³|θύ5θΎv¥ƒοlΕγw!όςx<CF82>{Wμ“πΏϋό‡οΫ–ώΛύn6ώ1ά^όsΟ<73>Ηώ‡<CF8E>α»ψc<CF88>ϋγ<CF8B>_*ΎΒ<>ΤρΦχgΎά¶¶Ο<C2B6>ω_Γώ―γ_~~½ω~ουµτΏτωο7<CEBF>θδ<7F>:ς_Oώβ<CF8E>C<EFBFBD>[Τ<>Πϊγ<CF8A>·(<28>%ω?-πύώ§ηό«3ώRψ©όπ'ώ ό<>ϊwϊΚυOρσΓjρ<6A>όώΛΏΏΛΞνΏJύ_Ϊδo<CEB4><6F>K]ώJγORω―·<E28095><C2B7>C©όλ‡<CEBB>Γ?_‹<5F>νϋάυΣ?μ<>νz<CEBD>oΫΪϊοο'u½ίώ<CEAF>ΗϋηJψ<4A>Β<EFBFBD>Ηγ<CE97>ο΅<CEBF>¶¥εΑψώ¥<CF8E>ώο—<CEBF>cψ·ο<C2B7><CEBF>ψηηo…υo=ώFόϋΫΊύΫο£φg<CF86>ύ―e<E28095>Hρ<48>o<EFBFBD><6F>Ξ<<3C>ό?ς<>ΰς<7F>zχ<7A>Vδώoόψ<7F>π<EFBFBD>Yυ<59>Ν±<CE9D>fε_iΩ_vωϋ<>ό/ΰψΐ'<27>‹ό_θΟω_νσ?Ϊη<CEAA>¬<EFBFBD><C2AC>ν<CEBD>;<3B>Ϊφ?η<>8<EFBFBD>Ηω?Ξ<>ΩΛ<CEA9>"<22>ίvώ?φ?ρβ<7F>Δ<EFBFBD>‰<EFBFBD>ΫΤ­ρΟvωί‡ΏVό<56>σ<EFBFBD>VιOόϋ<0F>/τ·J<C2B7>Έ<EFBFBD>Δαz}<7D>―‡ύ'>uόοw<CEBF>N[<5B><>Τψ\<5C><>Uα[<5B>Kλ_κ?–Ύηε_<CEB5>ώοπ<CEBF><CF80><<><7F>_ϋ]β<CEB2>Α%ψρ_όόΧϊ<CEA7>ί³ώ<C2B3>θMψsδ—T<E28094>hΛ<68>ώγΟ<CEB3>Ξωƒ<CF89><C692>Θ?ΰΛΰkΏk―<6B>π½ΥώΌjώϋα—Η—Ύ<E28094>³<EFBFBD>›»<E280BA>Τ<CEA4>νι<CEBD>µψ<C2B5>~ςοξσoWώ±<CF8E>[Ο<>χNω;G<>Hύ?θτ?ώό<7F>ψ<EFBFBD>ρ<EFBFBD>γ<EFBFBD>>π<>―<17>iΝ?ΊΎ^όΗ’ό‡ώθό/ψ<>±<EFBFBD>αψί<CF88><CEAF><1B>ΏUϋίΓρϋϊχ]ζ<CEB6>Ηο{yΌώΎχω?sψσw\<1F>w<7F>γσ?yϊKαΗγΙ<CEB3>#<23>―Ύώ<CE8E><CF8E>ΦΟ½οmχΣ[<5B>Φγ<CEA6>9ϊΔgδGυ›ό“ΒΟ<CE92>―ιλς_Ϊ<5F>O<EFBFBD><4F>σύΛΪτ<CEAA>uύ<75>lμ<6C>V¥ΛϊΏ¶<CE8F>εΨϊλν¨m<C2A8>b<EFBFBD>‘<EFBFBD><E28098><EFBFBD><EFBFBD>ψ?π<>|ςΗβ?<3F>ψΣZωΦσ‰<7F>qώ<71>σ―<CF83><E28095>g<EFBFBD>ΗωΞ<7F>3<EFBFBD>Ψί¶Ξ<C2B6>“<EFBFBD>Cώφ?ωπ?ωδ<7F>α<EFBFBD>Γ<EFBFBD>‡<EFBFBD>ύ<>ΙηΏΰψώ·Η<C2B7>__―|,?<3F>ιθΟςz<CF82>γ»mσύ›<CF8D>ξχΊΎmαψ<17>ώψγϊλϋ°<CF8B>ΛΏηΒ<CEB7>Ηo[?<3F>π>ΚΟοF<CEBF>αό•αoΫΉ<CEAB>ΡΡ<CEA1>θυ
ϋω}Nf¬<66>Έor Ώ¶ώΟΟ?Ψ%υ}
/Ώ<<3C>Ήyi…ύµιΏοsαΗpΒώ_ρ|jΛyώ·,<2C>9…x=ΦΟΟGίψ3=sς_gπίΊύ<CE8A>Bz•ϊΥ—ιs¶―Jσ<4A>ξώ)ώ<>ω΅„_J”ξwΎ<77><CE8E>λ_z~¦}Ό¶ώ»βωο4<CEBF>Φεϋφ<>–ρ―νJϋ¥9ϋέύ—υύ<CF85>v<EFBFBD>sύύφ<>(ύgΘ?νώΧΘόψ<7F>π<EFBFBD>Yυ<59>a<EFBFBD>Yηθo™ώ5<CF8E>lΏ<6C>±Ο<C2B1>«ν<C2AB>Δ<EFBFBD>!σ_^q]Ϋ<>¦<EFBFBD><C2A6>;―Kγ?<3F>ψ<EFBFBD>¶ύw<CF8D>?¥ϋεόηυψOω]ί<>Ώο#ρ·Yφ<59><CF86>ρ?Kφ?ϊ<>ό―<CF8C>xυΝ<C2B6><CE9D>―Έ<E28095>·<14>Ηώ³m<C2B3><11><0A>ό?Ϋρ―ΡύO»ώοΛz½;mέ<1B>L<EFBFBD>/Ω<>Ο‡ΔΎ‘ξ<E28098>VΫ<56>―ΐ<E28095>ϊρKωΔ<7F>-ϋWτ<57>Ιφ_ϋ.ρΏυθ<CF85>ρς<>Ι<EFBFBD>_)<29>ΏΧώ“κνψ+ώ<>ω—<CF89>―+ς―·<E28095>‰<EFBFBD>Χ<>~!?a<><61>£?Ρλε>‡Ώ{Υ(}<>ΏΟίoόxόΧWϊΉΐόmγ/έ<>Hρ―νjψ_}ώg ~ϋώϊCmϊkφ?Ό;ώ3Φ<33>Ίύλώ·9ψλφ<CEBB>ƒ<EFBFBD>αψί&ώμNψ7|ξ}ο½<CEBF>Ύτχμ<CF87>ZύΟRϊ―j<E28095>?mλI<1A>Π^<5E>eω?ΪΈ½<CE88>σΪϊΏ<CF8A><CE8F><EFBFBD>υ―ί<E28095>ύ<>ό_KώΛδοΌσVύθ;ϊϊCό<7F>Θ<EFBFBD>vϊ»υγ—_Ξώ½ΰS<CEB0>ΡFώo.<2E><><EFBFBD>ύ¶µΗ<C2B5><CE97>υ<EFBFBD>ϊΟ_‡λΏ¥~UιόυθωχYηΏυΟ<CF85><CE9F>Σ†ό…οπoδ<7F>ΕυΜtΧί<CEA7>ςΏοόώη]·^<5E>±/]6<>Ϊό'ΕO{ώήύϊϊΤ?΅ώφΏv<CE8F><76>ίοϋ«ΧώΧ¶$ψkΓ<6B>1<EFBFBD>Τ<EFBFBD>Ά<EFBFBD>όoΉώ‡mωgέ<67>‹<EFBFBD><0F>ώ?»ώ?‰ύ7£<37><C2A3>~ύ_ψϋ<>ϊΏψΐό‰<CF8C>Π<EFBFBD>ΙZ<CE99>'θ<><CEB8><EFBFBD>ϊΏψ<CE8F>¨<EFBFBD>g³ώ<C2B3>υϊΏ2όg―ωόΗγ©<CEB3>Kύί™ϋςο? >φ?φ?ρμβ<7F>Θ<EFBFBD>6ω?7ώ»bώ7ώ?θo%ώ<>ύ<07>C›τ§ώυW¤?υ/ί_<CEAF>oά<6F><^<5E>o…ϊ/%ό[κοΙύ<CE99>kΤ<6B>£ώ·½ϊ?θκ?R<>Νnύ7μ?δϋΫςΕϊίkΤ?·ή<C2B7>§Ύ<C2A7>›S<E280BA>|=ϋ<>ϊ<EFBFBD>Τ<EFBFBD>§ώ?υ<>-ι<>•όο¬<CEBF>_ςΥΦί<CEA6>ότ?ϊ<1F>?ώό<7F>ψ<EFBFBD>ί­<CEAF>Ώύω=ΰεζ<CEB5>¬?ύγΎσΏO<CE8F>χι<CF87>/…<><E280A6>αππI*_Ύς)'<27>ΟςS<CF82><53>!<21>ΏSπλψ—ΗoΫωzψόeόΗΰΏ>ηηΟ·<CE9F>΅?τ_Cώω{ΙςηήΏ¶ϋέ©ό<C2A9>7<EFBFBD>=ΏχΟΤlΫy|κΊ[ί3ω? Ώ†Om|κΊ<CEBA>όπ?όo™<6F>Αί¶ύ?<12>ρύwΏίνγ<0F>sμ<73>Ρ„?B<>O/σ<>¥γξϋϊόkΫ<6B>²ψΟ<CF88>ϊ·«ΔbZ<7F>ΖΏ<CE96>ύn<1F>ώχ{¥υί<CF85>Ώοw—®<E28094>ψ~γπσγύλ3τ<33>5τ›ύ<ο~~;ςί<CF82>_ΝΣ<CE9D>νςΧΧ<CEA7><CEA7>ϊΦχΪτ™<>φρυωΧ^λΨίΨν?ό<>Δ$τ—βίBΏ^ψσθώΰo_—•?§ώκρ•r|ζ\/%U<>9<EFBFBD>i|Pσωτ<CF89>>όSψ<53>+Ύψί…Οχ<>j‰_µΐ—ΗΏ¤τ—­<E28094>m“Ξίσ<CEAF>?oύ<6F>Ρ_‡<5F>¥φ<C2A5> ϋW³ώ¥uω―έ<E28095>M[ώΛϊΏ¥ϋΈyiι?xΏϊ―3ωω‡όΓώ_Ηώ<CE97>a<61>Ψ<EFBFBD>χΗ_JμμψώΧε»ψ£<CF88>ρ<EFBFBD>α<EFBFBD>C<EFBFBD>ΫΦ<CEAB>π?ό<0F>Ϋαλω<CEBB><CF89>ηό?η<>Ησ'¥λO;<3B>“ό/θ― <09><>η_f<5F><66>Yηό<CEB7>Νσ―>½ΒώμιύA<CF8D>ώ<EFBFBD>ό<EFBFBD>φσ<CF86>µύQΟuς<75>g<EFBFBD>Kίrώo<CF8E>σ/<2F><>γό?ϋφΏ¶Ζsώ‡ϊ?<3F>ΏF<CE8F>qώω<><CF89><07>τ·ε<C2B7>Γώƒ<CF8E>΅?υ_¨<5F>g½ώΣΌϊ#=ώΟ;®<>™ψ―T<E28095>O<16>‹<>­S<C2AD>)<29>Ν<7F>>―ώ<E28095><CF8E><EFBFBD>_?›gκΔ<CEBA><CE94><EFBFBD>£<EFBFBD>©<EFBFBD>Lύ?β<>Ψν?βίΘς<7F>μΖΏFφΗοζΦΥι<CEA5>Cύκ<7F>“<EFBFBD>Gό<1F>―<EFBFBD><E28095>o<EFBFBD>ϊ<EFBFBD>Rύ#<23><><EFBFBD><EFBFBD>OώΏnώΏΜώΛ<>_§ώ?ώϊZ‹<5A>Ώ<EFBFBD>θE<1F>γω<CEB3>Χ<1D>ΌώηΎM_―έ?/…_»οσ<CEBF>?ψ.ώ―Z$aύ“ςηπ%Ε<>ό
αΥπ―<EFBFBD>―ΏΚψφΓο½?τ‡ώ:τΧ®xwό¥λ½ϊΧµϊWηZWsπΧ©<CEA7><06>Γ<EFBFBD>πΏ]ό­Ϋ<C2AD>‡/ζο'τ_ζΰ;<3B>ΦΛ<CEA6>xά?<1C>|ΔψΧΟτύ~.ό3ώ!|θοΣΫΞύorϊ*ξs#¥Ώ¶ύί‚mύεζ%¶Gάχα|j®νώ7+¬ ώ3δί<CEB4>ϋ<EFBFBD> <EFBFBD>‘<EFBFBD><E28098>υφM›!Ος?-—Ω<E28094>΅<EFBFBD>Ρ<EFBFBD>Πί.ύρ<CF8D><13>©Ϊ?\η:ρ<>µ<>Gβ?q<>’ρσ—cς·o|Ω<>‘υ‘Κ<E28098>{Ζ<>ϊθSί<53>χΞΏdόωω5Χ<35>¶|σ<>»|βΨΎΟ<CE8E>/ϋ<>υΰ#<23>Gφα~F:<3A>Ίςd<7F>®Ώ–ω+ο<>ξΖσόίΔ?‰b<7F>ί-<2D>¥½~j[ώ<>¦ύ£ϋόΪσOώωπ?ωVε<56>u<EFBFBD>.ώ?όψ<7F>,ϋ<>dφί<CF86>όέψ?ό<>ύ<EFBFBD>ύ―uώηξη_ΐό? <0B>χκmω/Υ<>iψαwυύτ‡ώZτ—Φ<E28094>Ϊ¶σχΟGΊΎΤσ‘®gµΖω—±ϊWσδΏΎ΄ών™ώ!¤ι,­ζσ@
^+ώ¥ρ¥Ώσω―<12>·¬ΏΧ{<7B><><EFBFBD><EFBFBD>3<EFBFBD>k―mώ<6D>ω7^<5E>οω<CEBF>;<3B>©ωυη?]<5D>Ξ¦όΓώW<CF8E>?3ώ¶ρμ<7F>ΟΩ<CE9F>Iϋ§]Ρν<7F>λίΊώΣ¦<CEA3>υυwω?/ώ―<1D>EώC<CF8E>µΰc<CEB0>a<EFBFBD>α<EFBFBD>‡ώοχΡ<7F><CEA1>v<EFBFBD>GϊΏZ\<5C>τ<EFBFBD>΅<EFBFBD>ύ¬φ<C2AC>Aώ΅<CF8E>eυ_ηυ<CEB7>Υ–<CEA5>Φϋ<CEA6>b<EFBFBD>!<21>μΙ?δ<>¬ώΧcφ<63>:λ_ΪWJ<57>ϋτ<CF8B>Mο<4D>¤ϊ_ΗώG<CF8E>λς<CEBB>ηΘ?©ώΧΩ<CEA7>[—θ]<5D>_9<5F>yLώΞΜ<CE9E>oΧ?R<>ϊύ<><CF8D><1F>?ώό<7F>ψ?ΐόΑ<CF8C>zό¥η<C2A5>ζΙύo]ώCτ<7F><1C>Oϋ~t%<25><>u<EFBFBD>φ?ό<0F>γ<EFBFBD>ςΏ[ύ<>ϋϊ[Ηηβ_<CEB2>πGθ<47>IγΙ<CEB3>Γ<EFBFBD>ί<1B>Ξωσkγsρ<73>5Φ?ρΩg)ύf?Ο»<CE9F>ί<EFBFBD>όwλy¦ώo—ΏΎώί¶φηΟΥ<CE9F>γό‡ύGζΏ}|}ώµΧί:φ7φ<37>Eϋ<0F>?ώ?βΏΰώΦγ<CEA6><CEB3>ψΟ<CF88>yωo3<6F>—ψϋ?ΞΏ<12>a<EFBFBD>ΗωΞ<7F>#<23>°<EFBFBD>­βOώωΨ<7F>δ<EFBFBD>Α<EFBFBD>δ<EFBFBD>‘<EFBFBD>‡<EFBFBD><0F>ώ?τΏ<CF84>σ_π?ό<0F>Ϋβ<CEAB>Χ½θαγ<ΧΉ~ΎξδηλξΫτυΪύγρRψµϋχ>ίgγ<67>κEφ?ιω,]_<>ϋK<CF8B>Ώ~<µWνώΠ<CF8E>^τ<> _SΎΛσΏεωΟ__―|f|ξωύϋ<CF8D>ƒ\―<>?®<>ρ—εΏJε<4A>Jύ<4A>\<5C>ϊ|<7C>«ψχση<CF83>έύχΎ>ώ9ώL­ΏΪx<CEAA>zΜ<7A>ϊλ_<CEBB><5F>!ΛΠΦRό<52>ϋ‡σΜsλό?sη¬ώ©Eω‡ύΟώΦϊυ~ϋ5|IΧWmΏΤΏ<CEA4>*?o<>ώμsχΪύ‡υχ?Φν]ϊY_χ”<CF87>ψ<EFBFBD>π<EFBFBD>α<EFBFBD>ϋ<04>φόύ-Ϋ<>ϊώGMψΦνΏ±ω<C2B1>η<EFBFBD>Όηϊ<CEB7>λ<EFBFBD>ύχο\ψgόCψσβ?<3F>ψ<EFBFBD>¶ύ5†8<7F>.<2E>δόψ±ό/ΕΦς<CEA6>χΕΟζο<CEB6>ί<1B>#ώ<>ώ·<1C>i‰Ης*–g<E28093>ωΧ–<CEA7>Φγ<CEA6>Ψvν?βίΘς<7F>μΖΏ$ϋ§<>%ςοΨ<CEBF>l[»ύ<C2BB><CF8D>–ΖΧ£<CEA7><C2A3>θ<EFBFBD>ΉϋΏΥφ<CEA5>οδ<CEBF>{ζ?[Ο<>#ώ<>Iώ_M<5F><4D>ώώkΔ<6B>4/ώCώ?ω<>«ε<C2AB>χΨ3ς<33>5γΏψ<CE8F>Gψg^ό_Ηώ'ώ<CF8E>?κHΖο_™Wξwµρµο<C2B5>|ΰΏ~Ϊ<>π|δδKμΈ~ <0A>¶ύwΩ<77>΅ ϊCmϊ<6D>λOΗυ«έ<C2AB>Ηκ_ηλOί<1D>»Οz<7F>οί<CEBF><CEAF> ήΜΑ?Ώ<>Λώ³΄<C2B3><CE84><EFBFBD>αλόoφiψΦί­ο<C2AD><CEBF>±|]:Ο«Ϊ<C2AB>­ψiΟί<CE9F>ωOΛ_'gγλΟΗΌρλκΩσίeώΡ<CF8E>Θ<EFBFBD>ε<>»δ/ϋ?τΏuύύ΅?ώΛςίφωgπη<>«ωψΧΓΧΜ<CEA7>‹σζζ<CEB6>Ώ8η<38>¥σς<CF83>ωw>^µψW[ώ_ό<>ψΫ<CF88>ψ—ξω<CEBE>Τό·η_¦πOη<4F>ΉηεόO]<5D>…φλΎΛφΧµϋ?sαοϋ¬ύΏωZ<7F>ΥΟgy%΅Ώ¶ό―α[[Ήyi<79>ΟΧΏφumώ»ϋό!<21>€έωίyύ?ξyώω“Ξ<E2809C>¶ξ<CEBE>ϋ•9λo|<7C>•¶<E280A2>SγKφ<4B>~ξ|Σ<>ύ_¶?ΰmώί_±ώµχ<C2B5>Φδυ?ρ<>α<EFBFBD>Γ<EFBFBD>g·ώΟΈύ7cύiΫ_π?φΏmϋ_}ύψΐΏ΅όόλδ<CEBB>jπ΅?τΧ <CEA7>ωύοη<CEBF>ΧγψTξz<CEBE><7A>Όραϋq®ΔΝΏ«•εί<CEB5><CEAF>ωο‡_οΏmώΉ™,}:ίηΞΏ_q<04>x|νϋσ> ‡_mύµ<CF8D>Ο}^cύkσ<6B>ύδίέηίΊό³k<C2B3>λΖ<CEBB>τγίΦρΗώ·m<C2B7>ο{(?έϊρλΓ<CEBB>Λ_<CE9B>ώΏίαύΧY<CEA7>vυίϊKείΌυ<17>oΓύ§<13>Χ<EFBFBD><CEA7>"<22>­ΣΌώ{ύΓψάϋϋ<0F>?τΧ£<CEA7><C2A3>υ§ξQ<CEBE>J»ώζuπ­ΟΏ¥υ/υKίuλ?Λρ“ϊ<E2809C>µί%ώ‡yυΗΣπγΏψω―υ<E28095>Ώgύ!<21>Π?«Υ<C2AB>ο—_Rύ£-<2D>Sψ<53>?<3F>;ηώCώ!<21>€/ƒ―ύ®½ώΓχVϋσ<CF8B>ωο‡__ϊ~ΞώoξώSΫώ·§<C2B7>Χβ<CEA7>ϋΙΏ»ΟΏ]ωΗώo=<3D>ί;εού#υ<> <EFBFBD>Ρ<EFBFBD>ψ<EFBFBD>ρ<EFBFBD>γ<EFBFBD>Η<EFBFBD>O<EFBFBD>#ΰψτ§<7F> τ‡ώτ<CF8E>¦<EFBFBD>χ{γ<>mω§sπΧµΏαψί6<CEAF>Σ<EFBFBD>ΧφώcίΓρµΟ½ο½χ“Β—ώώψ;^ξσΨό»ϋΧξ7~<<3C>ώΏτ-υ<>wύ‚<CF8D>υΖφ]<>ΗΧω<CEA7><CF89>λ_?™3<E284A2>Ϊρ<CEAA>ύύy\Υ<>yω—~ώvψiύ<1F>―ιλςΌ<7F><CE8C>T<EFBFBD>Χϊ—ΥτωΥύ<CEA5>¬φΦ¦<CEA6>¶µ­<C2B5>«ϋ_<CF8B>­Ώφώ‡Ϊφ/φφώβ?τ_>π­φ<C2AD>¤<EFBFBD>ύθ<7F>cµ<63>ύ―mΛ<6D>z<EFBFBD>ϊς»tώµωO<CF89><4F>φόΑΘ?δποΪ<CEBF>οΞψb<7F>EμϊΒ<7F>vωίώθόψ<7F>Π<EFBFBD>θψώ‡<CF8E>-ρΏυόGπηό η<>χ½<CF87>?y|7<><37>UΞ<55>ΦΟ<CEA6>$<24>Χ6ύχ}.ό<>ώϋΒwχ_γόΛzηή™<CEAE>Μωί\<5C>Λπ|P<>~Ω<>ό<EFBFBD>R<EFBFBD>»ϊωy<>;λω<CEBB><CF89>ηΟΦ=<3D>oιόη<>9<EFBFBD>Οώ<CE9F>σ<EFBFBD><CF83><EFBFBD>±Y<C2B1>gόόw›όuχχm®uφ?Ψ<><CEA8><EFBFBD>ηό?ώ?όψ<7F>μω<CEBC>°<EFBFBD>8<EFBFBD> ύm<CF8D><6D>ϊψ?V¨C²<43><C2B2>ΝΚ»4ώ#<23><>­`<60>Iϋ?IΟί­R<C2AD>/?;®<>Φ<EFBFBD>®ν<C2AE>Χ‹<CEA7>Y±<59>Ρ<EFBFBD>δQ<7F>ΟnόϋΟ¶ύGόωOώ<4F>έψ—΄ι<7F>ύηzύ¨<7F>Oύκ<7F><13>·<10>_Ρ<5F>χΞϊ<CE9E>ύ3ηό+ω<>δ<EFBFBD>kΪΏsϊΧ<CF8A>κνψ/ώϊΪΝ<CEAA>ι{<_<>ώηωc<γ<>ρq]’tύ—sύ”wΑΏϊωµαCθ―+?ΞοΏίοΌ~wόο=<3D><>?9<>ΧξνσΓ<CF83>πΏeώ›φ<E280BA>½λOΛαCέϊ―ΪϊWΏώθ*όΎηδ§<CEB4>»~yΌ<79>ύJςwώw<CF8E>τ?ς_£ώ·®όµΎ<C2B5>C<EFBFBD>£<EFBFBD>΅Ώ]ϊγ<CF8A>Η<EFBFBD>ηΞwηsη?ΗΰΗγέω¬τx)όTώψ<13>f|iύ‡{Ε<>ηήψ<CEAE>?ώ•‹z¬Ο΄όtΏo_<6F>¥ρmς_’Κ½ύοϊΛδί¶µΑo‰<6F>µ<οωχσΦ_Κfvχ?πΟλ<CE9F>wΚYύ‡6ϋΣέ<CEA3>L<EFBFBD>rώχό<>όoό?1ύKλl<7F>WΆΏ¶όΗΏ}<7D>ηγσΏφϊ·#ώ‰ύ‹ύ_¶Ο[μ/©ύ―Ώ<E28095>—β/έ<>Ο›<CE9F>τό’<CF8C>GώόOώ_?}>]ώα<CF8E>Ζ<EFBFBD>‡<EFBFBD><0F><>E<EFBFBD>ί<ϋOzώD;ώk—<6B>±<EFBFBD>9<EFBFBD>ΓxΖ3<CE96>σ<EFBFBD>δqώϊ[Μ<>Φ9²NόΛ¦<CE9B>/G<><47>^9υ;yώ±<CF8E>ύOώ?η<>8<EFBFBD>Ηω?β<>δ<EFBFBD>[Ξ<>Ηώ'ώOό<4F>ψ?ρΫϊ―<16>‘_mρ_νψ?η?­<><C2AD>ψ?φώθoΥ<6F>―έFώ1ή}Γ<>―Φxλσo}ύKύΟ~ΙοGγθ^<5E>Ώ/Λ―:ύ®φ<C2AE>ηπ<CEB7>ι<EFBFBD><CEB9>ϋ©Ο_m<5F>εσ?ζ?<3F>ς_ϋύΣΧϊo®_Θ?τΏ6ύ%ρgιό―#<23>µϊ<C2B5>ΑΘ?δγµΧΏ<CEA7>ύΉΞϊ—ώIι§σ7o<37>'Υ<>:φ?ϊ_—<5F>?Gώέ}ώmΚ?τΏ®<CE8F>O[ώΞΣ?R<>ϊύ<><CF8D><1F>?ώό<7F>ψΏ€|ΰΏS<CE8F>λΔV°Ώ°<CE8F> ?ώ?›ώλώ?νύ<CEBD>ΌύΧυ'ΰψ<7F>σωόmΫ<6D>ϋ<1E>?Ύ{}<7D>―‡πsΟ_ΏοερRψρψΏ<CF88>ςψώΗόΧGηίέ<CEAF>ψόF<>ώRψρψϋΫη§πzh<7A>·ΠΏ6<CE8F>+Ϊ<><CEAA>ηηόIΗ;~iϋάϋήv?½υ?<3F>Χ\ϊι½ηθσϋ}>O?Ά<>Ϋδ<CEAB>~~|M<>[—<>Ήώα|<7C>Λ―<CE9B>ώΟυ?kΥ<6B>ωρmςΧϊώoUϊ·¬<C2B7>ύοφ}ξϊ{>Κσηξ·†ύ‹ύgΫώΓ<CF8E><CE93><EFBFBD>ψΐ>η<>­ε<C2AD>ZΟ<5A>#ώ‡ώΧ¶?Wo=<3D>‹ύ<E280B9><CF8D>ύόΗόc[‡OώωΨ<7F>δ<EFBFBD>Α<EFBFBD>δ<EFBFBD>‘<EFBFBD>‡<EFBFBD><0F>ώ?τ?η<>αψώ<>\ώ<>ϊzεcωωOG–Χ“ίm›οίόwΏΧυm ΗΏπτΗΧ<>ώ$®<>ΛλχsαΗγέυ£>ƒ?<3F>ΰ<EFBFBD>|”<>ί<EFBFBD>Γψ+Γ?ϊΉώΕ®?ΡΡΙυ+
ϋΟX<CE9F>aίδ3όΪϊ??Wόόa<CF8C>εΤχ)Όόςόηζ¥>τΧ¦<CEA7>ΎΟ…ΓqχOΝ§¶ό—ηΛς<CE9B>Sψ‡Χcύό|τ<>?σΧσ1'<27>u<06>ιχ?―<>Π<EFBFBD>NΣί‡W¦ΟΩΎ*Ν©<7F>^ ώιώ<CF8E><7F><EFBFBD><EFBFBD>:<3A>ΗόPΒ/¥?Jχ;ίΕυ/=?Σ>^[<5B>]ρόw<CF8C>λς<CEBB>ύϋΛψΧφ?¥ύ<C2A5><CF8D>ύ‡ξώΛϊώ/o<><6F>ϋ<0F>Ι_<5F>χ^a<>ƒύ?J<>ς―tώwlύυ<CF8D><CF85>Eώγ<CF8E>Γ<EFBFBD>‡<EFBFBD>Ο<EFBFBD><CE9F>ϋΟ:<3A>CΛτ―ωgϋύ<CF8B>}ώ_m<5F>'ώ™<>ς<EFBFBD>λΪώ7mόίy]<1A>‘Ζ<E28098>΄νΏsό)•<>–χ<E28093>Χγ?εw}<7D><>Ύ<EFBFBD>ΔίfΩ<66>+Ζ<>,Ω<>θςΏzβΥΫ67ώΏβώίRόϋΟ¶ύGόΫ6|ς<>lΗΏFχ?νϊΏ/<2F>ιυξ΄uoό3=Ύd<CE8E>?ϋFΊ<46>[m<>Ώ<02>λΗ<CEBB>-ε<><11>·μ<C2B7>]Ρ<>'Ϋν»Δ<C2BB>Φ£fΔΘ<7F>'<27>¥ό<C2A5>^ϋO<CF8B>΄γ―ψ<E28095>[δ_zΎ®ΘΌήώ'ώ\?ϊ…όύ„ύC<CF8D>ώD―—ϋώξUO τύ1>ό>Ώ9πγρ__ιηπ·<CF80>Ώt<CE8F>#ΕΏ¶<CE8F>©αυω<CF85>1ψνϋ?θύµι―Ω<E28095>πξψΟX<CE9F>λφ¬ϋίζΰ―Ϋ<E28095>ώ‡<CF8E>α›ψ³<CF88>9αίπΉχ½χ~Rψ<52>ί³<CEAF>kυ?KιΏ<CEB9>ύ<EFBFBD>|΄­'iόC{ύ—ε<E28094>h<EFBFBD>αφώΟkλ<6B>:ώ3ΦΏ~<7E>gτ?ς-ω/“ΏσΞ<CF83>Yυ<59>΅<EFBFBD>νθθύρ<CF8D>#<23>ΫιοΦo<CEA6>_n|9<>ψχ‚OύGωΏΉόK<CF8C>χΫΦ?JΧ<4A>λ?®<>–ϊU¥σΧ£ηίg<CEAF><67>Φ?<3F>3N<33>ςgΎΓΏuό‘<CF8C>Χ3Σ]+Κ<>Ύσϋ<CF83>wέzύΗΎόuΩόkσ<6B>?νω{<7B>υλλP<7F>„ϊgΨ<67>Ϊύ~ΏGμ―^ϋ_Ϋώ‘ΰ― ΖόS<CF8C>‹ώ_πΏεϊ¶ε<C2B6>u<EFBFBD>/ώ?όψ<7F>μϊ<CEBC>$φί<CF86>ώ?ϊυαμκ<7F>β<EFBFBD>π'ώC<CF8E>'kύ<6B> ?ώ?κ<>β<EFBFBD>£ώ<C2A3>ΝϊΦλ<CEA6>Κπ<CE9A>½ώεσ<1F>§ώ/υgξΘΏ<CE98>$ψΨ<CF88>Ψ<EFBFBD>Δ<EFBFBD>±<EFBFBD>‰<EFBFBD>#<23>Ϋδ<CEAB>άψο<CF88>ωίψ<CEAF> Ώ•ψ?φόύm<CF8D><6D>ϊΤ\‘ώΤΏ|ύΏq<CE8F>σxύΏκΏ”πo©Ώ'χ<>―Q<E28095><51>ϊίφκ<CF86> <EFBFBD>©<EFBFBD>Hύ7»υί°<CEAF><C2B0>μlΛ<6C>λ―Q<E28095>άz<CEAC><7A>ϊώoNύσυμκ<7F>S<EFBFBD><53>ϊ<EFBFBD>Τ<EFBFBD>·¤<C2B7>Wς<57>½³ώΙ<7F>U[sςΠ<7F>θό<7F>ψ<EFBFBD>ρ<EFBFBD>γ<EFBFBD>·ώ<C2B7>ύφηχ€—›<E28094>³ώ8τ<38>ϋΞ<CF8B>>=ή§jΌ~J<>…cΐόΑ<CF8C>%©|ω~Θ§<CE98>ό?ΛO)ώ‡|ώύNΑ―γ_Ώmηλασ—ρƒ<>ϊ<EFBFBD><CF8A>?ίώ‡ώΠ ωηο%Λ<>{<7B>Ϊξwwό¥ςήόχόή?S³mηρ©λn}Οδ<CE9F>4ό>µρ©λώσΓ<CF83>πΏeώΫφ<CEAB>HόΗχίύ~·<>?όΟ±<CE9F>Gώύ?iΌΜ<CE8C>—<EFBFBD>?Έολσ―m<E28095>Λβ?3κί®<12>‰ύύiy<1A>ώχ»}|όϋίο•Φ;ώΎί]Ίώγϋ<CEB3>ΓΟ<CE93>χ―ΟΠ<CE9F>ΧΠoφσΌϋωνΘ?~5O<35>·Λ__<5F>Kλ?Xί<58>iΣdώΫΗΧη_{ύ­cc<7F>Y΄<59>π<EFBFBD><13>‘Π_<CEA0> ύzαΟ£?ψƒΏό}]Vώ<56>ϊ«ΗWΚρ™s½”Tύη<ώ¥ρAΝηΣ<CEB7>ϋπOαw®ψβ>ά<CEAC>%~Υ_<1E>’<EFBFBD>_¶ώ·M:<3A>}Ο{ώύΌυ7Fώ—Ϊ<E28094>3μ_Νϊ—ΦεΏv<CE8F>7mω/λ<>–ξ?ΰζ¥¥<C2A5>ΰύκΏΞδδςϋϋ†ύ9b<39>ί)ύ±<CF8D>±<EFBFBD>αψ_—<5F>νβ<CEBD>ώΗ<CF8E>‡<EFBFBD>ύo[<5B>Γ<EFBFBD>π?όo‡<6F>­η?2<>σ<EFBFBD><CF83><EFBFBD>Ο<>”®?νόOςΏ Ώ&ό;<3B>™yώg<CF8E>σ6ΟΏϊτ
ϋ³§χyϊKσ<4B>ΫΟ<CEAB>ΧφG=ΧΙ<CEA7><CE99>uώ-ύ}ΛωΏ5ΞΏpώ<70>σ<EFBFBD>μΨ<7F>ΪΟωκ<>pώύΗωδ?ώόΠί–<CEAF>ϋώ‡ώΤ΅ώ<CE85>υϊOσκ<CF83>τψ?οΈώgβΏRύ?Yόg,ώ·Nύ§4ώ5<CF8E>ϋΌϊ?:ώiόl<CF8C>ύ©<13>#ώ<>ώ§ώ3υ<33><CF85><EFBFBD>c<EFBFBD>Y΄<59><CE84>#<23>Ι<EFBFBD>³<1B>Ω<>Ώ›[<5B>U§<55>υ<>©<EFBFBD>OώρόΏ:ώΏuκ<75>Kυ<4B>4ώCώ?ω<>Ίω<CE8A>2ϋo,<2C><EFBFBD>ϊ<EFBFBD>ψ<EFBFBD>ι<EFBFBD>i-ώ<>zΆγ©έσόΑu®sύ³―K_WΓΏϊωµαCθ―E<E28095>6ϋ¥–?9>ώξψί}ώΫκWελ§ΝΓΏ<06>Ίη‡<CEB7>αψί&ώΦν<CEA6>Γ_υχϊ―rγ<72>λεO<®ΧΖΧWƒύγΎ5ϋ^<5E><>©ίIη_S<5F>¶ΰ_[ΉyIΑI}―Νηώ3ΟGN~<7E>υΏΙχ<CE99>YaύKπΏϋό£<CF8C>‘<EFBFBD><E28098>ς_[ώ²<CF8E>C<EFBFBD>[Χ<>Πί.ύρ<CF8D><13>yεb„ωG~BϊϊμϋΗγ¥πkχμ_®§ΟOΦϊ<CEA6>¤ϊη<CF8A>η?¥%Άλ<CE86><CEBB>²ώkγΛϊ_’Ϋ+ψ<>Ηι/•Ϊύ<CEAA><CF8D>λEΊώzο―'<27><>\ΜΠ~ΜΓ³?έύΟτOΩΏRψgόρ<CF8C>—φ<E28094>aώzi½<69>ν<EFBFBD>ςτΧ—<CEA7>uόkλ―Ύ<E28095>σσΏΟσ©Ήώ­Ηί<CE97>bc<>λυ?Φ·dψΟ³5ϋΏ’<CE8F>g;<3B>Ο:<3A>[Ο<>³+<2B>¬ϋρ<7F>α<EFBFBD>Γ<EFBFBD>gΩ<67>'³<>fθOέψ?ό<>ύΟω<CE9F>»<EFBFBD>?a<γ―'<27>ί<07>κηΧ†ύ΅Ώύ<>Sχ*zΟΥW<CEA5>λΉσ%ερώχqύΥ5ΞΏδλCµ]—<>O
μz<EFBFBD>ώ!oδι<kώk5όF<CF8C>Ξλου<CEBF>ζ<EFBFBD>–υ—οβ<CEBF>!<21>k―mώ<6D>ωwχω·)<29>°<EFBFBD>5γkΔΏ­γ<C2AD>ύo{<7B>'©<>Ϊ^_µV<C2B5>Uwύ[Φsθ/•σΦίΌϊΏφτί{γ<>Ϊρ_δ?τοΓ„ώρόωω<CF89>ΨΨψ<7F>΅Ώ¦<CE8F>λο§άΏΚύ¬<7F>e­<65><C2AD>&ό–ώµώ‘wo}ώ­―©<7F>Ή¥<CE89>O­<4F>L^~Υιwµ<77>?‡ΗL<CE97>ά<7F>'Χ§―µ<E28095>ΟΨό<CEA8>ω¤όΧ~<7E>φώ?σό7Χ―?δϊ_›ώ’ψ³tώΧ‘<CEA7>)όλλo<CEBB>ό‡<CF8C><E280A1>Θ?Ζk­ϋs<CF8B>υ/ύ“<CF8D>OηoήώO<CF8E><4F>uμτΏ.<2E><EFBFBD>ό»ϋόΫ”θ]<5D><>¶ό<C2B6>§¤ώτ?ϊ<1F>?ώό<7F>ψ<EFBFBD>ρψΐ§ώΧ‰<CEA7>¬`a<7F>Aό6ύ<36>ΦύΪϋ<CEAA>yϋ―+κOΐ<4F>π<EFBFBD>ησ?ψΫ¶<CEAB>χ=|χϊ_αη<CEB1>Ώ4~ίΛγ¥πγρ?ερ9ό<39>ω;®<>ΞΏ»Ώίs)O)όxό<78>ύνσSx=΄<>[θ_›<5F>νισΏsώ¤γΏ΄}ξ}o»<6F>ήϊΕk.ύτήsτωύ><3E>§Ρ<>mςO
??Ύ¦<CE8E>­Λ<C2AD>°<EFBFBD>™―?SΧϋεWM<57>Ης³W<C2B3>ηΗ·Ι_λϋΏUιί²ώSσ<53>:<3A>^<5E><>}<7D>»ώ<C2BB><CF8E>ςόΉϋ­a<C2AD>b<EFBFBD>Ω¶<CEA9>π<EFBFBD>γ<EFBFBD>>π<>ΟωkωΏΦσ<CEA6><CF83><EFBFBD>΅<EFBFBD>µνΟΗ[Ο<>b<EFBFBD>gg<67><07>1<EFBFBD>ΨίΦα“<CEB1>Cώφ?ωπ?ωδ<7F>α<EFBFBD>Γ<EFBFBD>‡<EFBFBD>ύΟωψώ‡<CF8E>?—<>ΏΎ^ωX~ώΣΡ<CEA3>ευ¤ΗwΫζϋ7<CF8B>έοu}ΫΒρ/<ύρΗυ£?‰λ<E280B0>ςϊύ\ψρxwύ¨ΟΰΟ?ψ?εηw£ΖπώΚπ<CE9A>~G®±λOtτCrύ<72>Β>Η3ΦΨ7ω Ώ¶ώΟΟ?Ψ9υ}
/Ώ<<3C>Ήyi…ύµιΏοsαΗpάύSσ©-<2D>εωί²όηώαυX??}γΟόυ|ΜΙ<CE99>ΑϊύίΟλ?΄§Στχα•ιs¶―Jσ_κΏΧ‚Ί<7F><CE8A>γΏη£Ξ<C2A3>1?”πKι<4B><CEB9>ύΞχ_qύKΟΟ΄<CE9F>ΧΦW<<3C><>ζίΊόc<CF8C>Αώί2ώµύOiΏ4g<34>΅»<CE85>²Ύ<C2B2>ΛΫ<CE9B>ηώΓcςΧί<CEA7>Δύ<CE94>WΨ<57>`<60><><EFBFBD>†ό+<2B><>[}η‘<7F>ψ<EFBFBD>π<EFBFBD>α<EFBFBD>³κ<C2B3>Γώ³Ξ<C2B3>Πί2ύkώΩ~<7E>c<EFBFBD><63>WΫ<57>‰<EFBFBD>CζΏΌβΊ¶<CE8A>M<1B>w^—Ζ¤ρ?mϋοJε£εύηυψOω]ί<>Ώο#ρ·Yφ<59><CF86>ρ?Kφ?ϊ<>ό―<CF8C>xυΝ<C2B6><CE9D>―Έ<E28095>·<14>Ηώ³m<C2B3><11><0A>ό?Ϋρ―ΡύO»ώοΛz½;mέ<1B>L<EFBFBD>/Ω<>Ο‡ΔΎ‘ξ<E28098>VΫ<56>―ΐ<E28095>ϊρKωΔ<7F>-ϋWτ<57>Ιφ_ϋ.ρΏυθ<CF85>ρς<>Ι<EFBFBD>_)<29>ΏΧώ“κνψ+ώ<>ω—<CF89>―+ς―·<E28095>‰<EFBFBD>ΧyρβeχΛ—X>Τ®_ <0A>κηΧ†ύ΅ΏζΛ―­”ϊ>ώ<>Ή~<7E>lόέρΏϋόϋυ½όυ™σ?Δώ9ώeψW??ό<0F>ΫζΫψ[υγχΦίΧΎ<CEA7>――ίϊKκ’ΞΏ¶ώ­α_[R<7F>›φϊΧ®?ΊΒϊ—ΰχωG<CF89>#<23>5εΏ¶όe<CF8C>‡ώ·®<C2B7>΅Ώ]ϊγ<CF8A>'ώγηΖω‰ιλ½σ[»<^
Ώv<EFBFBD>ήηϋtόΉnυΊλ<EFBFBD>Φ{Κε_<CEB5>σ§Zβ/ώψ°ώ_ΊΚLώόg
ΏΪψ<EFBFBD>Λ=ϊϋ–ψ‘δ%<25>_Ν?N©όKΟ ~<0E><>ψσ<CF88>-―ιϊλ½Ώ<C2BD>ό·~ώω―[<5B>O_ώS<CF8E>C3<43>x…υoωό7φ1φl_•Ξ_<CE9E>Ω<EFBFBD>eϋ_Χώ‘α?Οώύύ<CF8D>7<EFBFBD>©σ―µύCm<43>“·<E2809C>ελo|<7C>5γωk―~<7E>ό―Ν<E28095>Χε<CEA7>^ ώώί–ό³ξ<C2B3>Ε<EFBFBD>‡<EFBFBD><0F><>e<EFBFBD><65>Μ~<7E>΅?5ν/ψϋϋ_}ύ1<CF8D>ρ<EFBFBD>Ώ΅όό«<CF8C>_>τ‡ώτ?ΧΉz½η*άx·WτλKΉϊJερώχξωτλίΕψΕΟΧ~]J?)ό±λ9ϊ‡Ό‘§σ¬ω―ύΥπύΣ―?¦_<C2A6>Q“<51>?Gώέ}ώmΚ?μΝψίρoλψc<CF88>Ϋή<CEAB>Ήx‰³ _λ'}½WΎΦξΏΒϊ·¬<C2B7>ζΠ_*<2A>ζ­Ώτϊ<CF84>α<EFBFBD>ώ{ό_;ώ‹ό‡ώ}ψ<>Π?<3F>??<3F>ϋϋ<0F>?τΧτiΦ<69>Ίwύ«ϋ<C2AB>·><3E>ΦΧΏΤ<CE8F>μΗ‘ώ~ΞίΗΧγοuλ?ΧρΟα1Σ<31><CEA3>χS<CF87>ΏΪ<ΛηΜ0―ώxνώιΏkύ7Χ―?δϊ_›ώ’ψ³tώΧ‘<CEA7>)όλλo<CEBB>ό‡<CF8C><E280A1>Θ?Ζk­ϋs<CF8B>υ/ύ“<CF8D>OηoήώO<CF8E><4F>uμτΏ.<2E><EFBFBD>ό»ϋόΫ”θ]<5D><>¶ό<C2B6>§¤ώτ?ϊ<1F>?ώό<7F>ψ<EFBFBD>ιΔ‹/ϊΏΣ<CE8F>ϊCϊΣ<7F>ϋ<1A><>Μ~•γ―kΓ<7F>πΏmώ§<CF8E>―εΧί<CEA7>λ<EFBFBD>γό‡Ηίρr<CF81>ΗϊOΊϋΧξ7~<>ί<>2ΎΫηήWού¤πΫO<7F>Wϊ<57>><3E>ηύί<CF8D>Ηάύύ<CF8D>c«¬IόeΞόkη?9ϊσ—£<E28094><C2A3>ώΜΣ3­ΏΫα·<CEB1>―ιλςΌ<7F><CE8C>T<EFBFBD>Χϊ<CEA7>Υτ<CEA5>Υύ<CEA5>><>§K<C2A7>ZύϊΪzΎΊ<CE8E>εΨϊkο¨m<C2A8>b<EFBFBD>Ω¶<CEA9>π<EFBFBD><13>΅?"ΧΉnΉ<6E>'ύθ<7F>C<EFBFBD>›ύθm[ώΗuλSύλ·­Τη^:<3A>ΊςΏ<CF82>mύεζ%'υ=ό‡όCώqέb<CEAD>Ώ»γ<C2BB>9ύ±<>ι<EFBFBD> <09>Ϋε›ψ£<CF88>ρ<EFBFBD>α<EFBFBD>C<EFBFBD>£<EFBFBD>αψώ·Ζ<C2B7>ΦσΑ<>η<>]~g:2Ύή›Ώ”_ΟΪω<CEAA>δA<7F>ώcπ{ο―}ώEοό<CEBF>~ώ³υσΏ<CF83>ώ~ώ{®<>\\<5C>_~ώ£άΏ®~ώGΪ<47><CEAA>όΝσg+<2B>αόη<>mΏΨ<CE8F>[Ε<>σ?Τ<>‘<EFBFBD><E28098>n“Ώρψ•Ξ?S<>‡σ<E280A1>Φε?ώ?όψ<7F>,ϊ<>°<EFBFBD>ΰθo—ώΤ<CF8E>³m<C2B3>iΧYcύλαΏRύΏ‘ψ<E28098>4ώ·Bύ'I<>§η<>tύ<74>!}Σρ³πzύο<CF8D>ώ_7ώgέώG<CF8E>Ϋ~Q<>ΟvόϋΟ¶ύΗ ωOώ<4F>έψWm<57>ΫΟcω¥ωΧο<CEA7>Jύκ<7F>S<EFBFBD><53>ψΏE<CE8F>―¶<E28095>O»ώΏT<CE8F>ΘΟΏ’<CE8F>OώΏvώ<76>Έύ'Υ?+Τ<>Η<EFBFBD>O<EFBFBD>O«ρ<C2AB><CF81>=Hj—

BIN
client/hardnested/tables/bitflip_0_027_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_029_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_02b_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_02d_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_02f_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_030_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_034_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_03c_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_040_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_044_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_04c_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_051_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_053_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_055_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_057_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_059_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_05b_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_05d_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_05f_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_064_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_06c_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_071_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_073_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_075_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_077_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_079_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_07b_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_07f_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_081_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_083_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_085_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_087_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_089_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_08b_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_08d_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_08f_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_090_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_094_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_09c_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0a1_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0a3_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0a5_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0a7_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0a9_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0ab_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0ad_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0af_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0b0_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0b4_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0bc_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0c0_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0c4_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0cc_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0d1_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0d3_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0d5_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0d7_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0d9_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0db_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0dd_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0df_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0e4_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0ec_states.bin.z Normal file
View file

Binary file not shown.

28
client/hardnested/tables/bitflip_0_0f1_states.bin.z Normal file
View file

File diff suppressed because one or more lines are too long

BIN
client/hardnested/tables/bitflip_0_0f3_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0f5_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0f7_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0f9_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0fb_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0fd_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_0ff_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_104_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_10c_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_111_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_113_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_115_states.bin.z Normal file
View file

Binary file not shown.

BIN
client/hardnested/tables/bitflip_0_117_states.bin.z Normal file
View file

Binary file not shown.

Some files were not shown because too many files have changed in this diff Show more