ÐÏࡱá>þÿ ÎÐþÿÿÿÌÍjðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿì¥Á!` ø¿08Èbjbj\­\­ 4†>Ç>ǶœÛ(~ÿÿÿÿÿÿ€ˆˆˆ ’ " " " 6 ~£~£~£8¶£$Ú¥Ì6 =n²ŠŠ<®"^®(†®†®ŸÛ&ÅÛ ÑÛŒŸŸŸŸŸŸ$«h2â" ýÝ#Û|ŸÛýÝýÝâžž†®†®,÷·ô·ô·ôýÝ4 žú†®" †®Œ·ôýÝŒ·ô·ôrýT˜ Š" äý†®ŠŠ ³1Û±PÈ~£1çd \ý, 0=jýzE •ðŠE äýE " äý¬ÙÛhAÜJ·ô‹Ü<ÇÜ6ÙÛÙÛÙÛââ;ô|ÙÛÙÛÙÛ=ýÝýÝýÝýÝ6 6 6 €PÚ]€E6 6 6 Ú]6 6 6 žžžžžžÿÿÿÿ  An Introduction to Coding Theory via Hamming Codes A Computational Science Module Supported by National Science Foundation, NSF CCLI Grant (DUE 0618252) Module Author: Nuh Aydin Department of Mathematics Kenyon College  HYPERLINK "mailto:aydinn@kenyon.edu" aydinn@kenyon.edu August 2007 To the Instructor The only prerequisite for this module is a course on linear algebra. It can be used in a linear algebra course after students learn necessary background. In fact, it would be an excellent project in a linear algebra course. Typically, in a first course on linear algebra, students study vector spaces over the real numbers. For this module, they need to study vector spaces over the binary field. So, that will provide a level of abstraction (but a manageable one). Additionally, it can be used in any computational science course where introducing error-correct codes is appropriate or desired. Finally, another course that can use this module would be an Abstract Algebra course. Once students learn general finite fields, they can define and implement Hamming codes over an arbitrary finite field (of course they will still benefit from studying Hamming codes over the binary field first). Typically, students before taking an abstract algebra course are familiar with the field of integers module p, for a prime p, but they are not familiar with more general finite fields. The software used in this module is Maple (classical worksheet mode. Most versions of Maple should work, version 10 is used in this work ). Abstract The theory of error-correcting codes is a relatively recent application of mathematics to information and communication systems. The theory has found a wide range of applications from deep space communication to quality of sound in compact disks. It turns out that a rich set of mathematical ideas and tools can be used to design good codes. The set of mathematical tools used in the field generally comes from algebra (linear and abstract algebra). The purpose of this module is to introduce the basics of the subject to students with an elementary knowledge of linear algebra, via a well-known class of codes known as Hamming codes. Interesting properties and projects related to Hamming codes are introduced. KEYWORDS: Coding theory, error-correcting codes, linear codes, Hamming codes, perfect codes Introduction The Main Problem Coding theory is concerned with reliability of communication over noisy channels. Error correcting codes are used in a wide range of communication systems from deep space communication, to quality of sound in compact disks and wireless phones. In computers, data of any kind is stored and processed as binary digits (or bits for short). A bit is a 0 or a 1. Every letter has an ASCII code. For example, the ASCII code of the letter ‘A’ is 01000001. Typically, data consists of billions of bits. Digital data is transmitted over a channel (which could be a wire, network, space, air etc.), and there is often noise in the channel. The noise may distort the messages to be sent. Therefore, what the receiver receives may not be the same as what the sender sends. The goal of coding theory is to improve the reliability of digital communication by devising methods that enable the receiver to decide whether there have been errors during the transmission (error detection), and if there are, to possibly recover the original message (error correction). Sometimes, error detection could be good enough in practice, if we can easily retransmit the data such as scanning UPC’s in retail stores. However, in some application we want to be able to correct errors because retransmission is too expensive or infeasible, such as in deep space communication. The General Idea The main method used to recover messages that might be distorted during transmission over a noisy channel is to employ redundancy. We make use of redundancy present in human languages to detect or correct errors. This happens in both oral and written communication. For example, if you read the sentence “There is a miscake in this sentence” you can tell that something is wrong. So we can detect an error. Moreover we can even correct it. We are achieving two things here: error detection and error correction. What are the principles that we are using to achieve these goals? First, because the string “miscake” is not a valid word in English, we know that there is an error. Here, the redundancy manifests itself in the form of the fact that not every possible string is a valid word in the language. Secondly, the word “miscake” is closest to the valid word “mistake” in the language, so we conclude that it is the most likely word intended. Of course we can also use the context and meaning to detect and/or correct errors but that is an additional feature, not available to computers. When I enter the string “mistaky” to Merriam-Webster online dictionary (http://www.m-w.com ), no entry can be found for it, however, the computer comes up with a list of suggested words, the first of which is “mistake”. So, the computer is telling me that “mistake” is the most likely word to be intended, because it is closest to the given string. This is called the maximum likelihood principle. As I typed this article on my computer I witnessed many instances of this principle used by my word processor. For instance, when I mistakenly typed “fisrt” it automatically corrected it to “first”. There are also other ways redundancy is used in natural languages. As already pointed out, redundancy in context often enables us to detect and correct errors, vagueness, and ambiguities. When humans communicate, redundancy, either explicitly introduced by the speaker/author or built into the language, comes into play to help the audience understand the message better by overcoming such obstacles as noise, accent, hearing difficulties etc. Shetter [9] gives a number of examples in which redundancy is manifest and useful in languages. Mathematical Use of Redundancy in Digital Communication As we see, redundancy is present and useful in human languages in a number of different ways. Our next problem is whether computers can use some of the same principles to achieve error detection and/or correction in digital communication. Since computers have more limited capabilities than humans, in particular, they cannot make sense of words, it is the method of employing redundancy that can be used to achieve this goal in computers using the precise language of mathematics. To illustrate the use of redundancy in a mathematical way in digital communication systems, consider the following example. Suppose we want to communicate with another party in a simple manner: sending messages that represent a “Yes” or a “No”. Let’s agree that a 1 represents “Yes” and a 0 represents “No”. Unfortunately, there is often noise in the communication channel which may distort messages by flipping the binary bit. If we just send the messages as they are, do we have any way of knowing if an error occurred during the transmission? Note that the reason we can do nothing against errors is that all possible strings (that all have length 1 in this simple example) are valid codewords. Codewords in digital communication correspond to valid words in a language. To get an idea of how to employ redundancy in digital communication, we first model our channel then consider and compare several encoding schemes. The Binary Symmetric Channel One of the most fundamental models of a communication channel is the binary symmetric channel (BSC), pictured below. In this channel, every bit of a transmitted message has the same probability p of being changed to the other bit. So, a 0 will change to a 1 with probability p and will stay unchanged with probability 1-p. The number 1-p is called the reliability of the BSC. We also assume that errors occur randomly and independently (not always a realistic assumption but will work well for many situations). We will always assume that we work with a BSC with a fixed reliability.  SHAPE \* MERGEFORMAT  Figure 1: The Binary Symmetric Channel In block coding theory, original data is broken into blocks of a fixed length. In the examples below, the block size is 4. Then, a certain amount of redundancy is added to data. Scheme 1 Perhaps the most intuitive way of adding redundancy to a message is simply to repeat the original message. For example, instead of sending 1011, we send 10111011. Here 1011 is the original message and 10111011 is the codeword. The string obtained after adding redundancy is called a codeword. The set of all codewords is called the code. We shall call this code simple repetition code. What does this code buy us? Do we get any error detection or correction capability? If you think about this for a moment, you can see that if there is a single error, then it can be detected. We simply break the received word in half, and compare the two halves. If there is exactly one error, the two halves won’t be the same. We also note, however, that we cannot correct any errors. Problem 1 There are some double errors this code cannot detect. Can you come up with an example of such an error? Can you describe which double errors can be detected and which ones cannot be detected? To quantify what we gain by employing an encoding scheme, let us assume that the probability of error for a single bit for a certain channel is p = 0.001, errors occur randomly and independently, and there are about 3000 bits in a page. If we do not employ any encoding scheme, on average we expect to have 3 words (a word is an 8-bit block) in error per page (The expected number of bits in error is 3000*p =3 ). If we use the simple repetition code on the other hand, there must be at least 2 errors per word in order for an error to go unnoticed. This decreases the expected number of incorrect words to 1 in about 50 pages. Can we do better? Problem 2 Show the probability calculations to verify the claim that this scheme decreases the expected number of incorrect words to 1 in about 50 pages. Scheme 2 This scheme repeats everything 3 times. So the original message 1011 is encoded as 101110111011. What are the pros and cons of this scheme? It is easy to see that not only can we detect single or double errors, we can also correct single errors by using the majority opinion, where if at least 2 out of 3 repetitions of a bit agree, then the third one is changed to that majority value. This improvement comes with a cost however: only 1 out of 3 bits sent are information bits (so 2 out of 3 are redundancy bits). We say that the rate (or information rate) of this code is 1/3. In general, the rate of a code is the ratio of the length of an original message before encoding to the length of a codeword. The rate of the simple repetition code is 1/2. With this improved error correction capability, the expected number of incorrect words is 1 in about 6115 pages. Problem 3 Verify the last claim. Scheme 3 This is a well-known and commonly used encoding scheme that adds a single parity check bit at the end so that the number of 1’s in the resulting codeword is even. Therefore, the original information 1011 is encoded as the codeword 10111. Another way of describing this method is that the modulo 2 sum of all bits (including the redundancy bit) is 0. It is easy to see that this scheme detects any single errors, but cannot correct any. Problem 4 Find the rate of this parity check code. Scheme 4 This is also a well-known example of an error correcting code that was one of the earliest codes designed. It was introduced by Hamming [3]. In this scheme, 3 bits of redundancy are added to information bits. If we denote the original data bits by  EMBED Equation.3  then the codeword corresponding to the data is  EMBED Equation.3 , obtained by adding three redundancy bits according to the equations  EMBED Equation.3 ,  EMBED Equation.3 , and  EMBED Equation.3 where all computations are done modulo 2. According to this scheme, the information string 1011 is encoded as 1011010. Notice that the rate of this Hamming code is 4/7: 4 out of 7 bits are the original information bits. Although it is not obvious (but easy to show after learning a little bit of coding theory), this code corrects any single error. Therefore, compared to the Scheme 2 above, the Hamming code achieves the same error correction ability in a more efficient way: The information rates are 1/3 vs. 4/7 (Scheme 2 vs. Scheme 4). The following is a pictorial representation of digital communication over a noisy channel with error correcting codes.  SHAPE \* MERGEFORMAT  Figure 2: A general picture of communication over a noisy channel A visual representation of the Hamming Code The figure below gives an alternative representation of the Hamming code. Each one of the three big circles in the figure corresponds to the three parity check equations defining the Hamming code, and the seven regions correspond to the seven bits in a codeword. The defining equations require that there be an even number of ones in each big circle. If not, we know that there is an error. Moreover, when there is a single error in transmission, we can fix it by flipping a single bit in the appropriate region, corresponding to the location of the error. For instance, distribute the bits in the received vector 1001010 to the regions in the figure. Are the conditions satisfied? If not, can you fix it?  SHAPE \* MERGEFORMAT  Figure 3: An alternative description of the Hamming code Although codes used in practice are longer and more sophisticated, the basic principles are the same. These examples show that there are different ways of employing redundancy, some more efficient than others. The question is, therefore, not whether or not redundancy can be useful but how to best use it. Researchers are still looking for more clever ways of employing redundancy to design even more efficient codes. Surprisingly, a lot of theoretical mathematics can be used in the design of good codes. In the rest of this unit, we will be studying some of the formal mathematical methods used in coding theory. Formal Set-up and Mathematical Definitions Definition A code C of length n over an alphabet F is a subset of  EMBED Equation.3 , the Cartesian product of F with itself n times, which consists of n-tuples from the elements of F. The elements of C are called codewords. Informally, you can think of a code as the set of all valid words of a language, and a codeword as a particular word in the language. Just as a language does not contain all possible strings as valid words, a code is only a subset of  EMBED Equation.3 , not all of it (theoretically, it can be all of it but that would not be a useful code. We call this code a trivial code). The alphabet of a code is a finite set. In practice, the most important alphabet is the binary alphabet B ={0,1}. A code over the binary alphabet is referred to as a binary code. In most of this unit, we will be dealing with binary codes only. However, mathematicians do study codes over other alphabets, especially over finite fields. For example, a ternary code is a code over the field  EMBED Equation.3 , the integers modulo 3. As an example, let us consider the code C ={1010,0101,1111 } of length 4; it is a subset of  EMBED Equation.3 . This code has 3 codewords. Suppose, using this code over a channel, we receive the vector 0100. What can we say about possible transmission errors? Is there an error? Can we correct it? What is the most likely codeword that was sent? We see that the most likely codeword that was sent is 0101. This is because the received vector 0100 is closest to 0101. This brings us to the formal definition of Hamming distance (or simply distance): Definition The Hamming distance d(u,v) between two vectors u and v is the number of positions in which they differ. The Hamming weight wt(u) of a vector is the number of non-zero components it has. In the example above, if we label the codewords c1, c2, and c3 and the received vector u, the Hamming distances are d(u,c1) = 3, d(u,c2) = 1 and d(u,c3) = 3. Also, d(c1,c2) = 4, wt(c1) = 2. Problem 5 Show that for binary vectors u, and v, we have d(u,v) = wt(u+v), where u+v is the usual binary (modulo 2) sum of two vectors. The Hamming distance is a fundamental notion in coding theory. Error detection/correction is based on Hamming distances. Another important and related notion is the minimum distance of a code. Definition The minimum distance of a code C is min{ d(u,v) : u, v in C, u  EMBED Equation.3  v}, that is the smallest of the distances between distinct pairs of codewords. Similarly, the minimum weight of a code C is min{ wt(u) : u in C, u  EMBED Equation.3  the zero vector}, the smallest weight among non-zero codewords. The minimum distance of a code determines its error detection/correction capacity, as the following theorem shows: Theorem 1 Let C be a code with minimum distance d. Then C can detect any d-1 errors, and can correct any  EMBED Equation.3  (the floor of (d-1)/2 ) errors. Moreover, there are some d errors C cannot detect and there are  EMBED Equation.3 +1 errors C cannot correct. Problem 6 Convince yourself that Theorem 1 is true. Problem 7 Show that the Hamming distance is a metric, i.e. it satisfies the following properties: For all vectors u,v, and w d(u,v)  EMBED Equation.3  0 d(u,v) = 0 if and only if u = v d(u,v) = d(v,u) d(u,v)  EMBED Equation.3  d(u,w) + d(w,v) (This is called the triangle inequality) Linear Codes Although a binary code is defined as a subset of  EMBED Equation.3 , it is more convenient to consider subsets with certain mathematical structure instead of dealing with arbitrary subsets. The first observation in that direction is to notice that  EMBED Equation.3  is a vector space over the binary field B. Let us recall from linear algebra that this means we can add vectors in  EMBED Equation.3  (using component-wise mod 2 sum), and there is a scalar multiplication (and a there are a few properties these operations satisfy). Since there are only two scalars in the binary field, that is 0 and 1, the scalar multiplication is particularly simple. Since  EMBED Equation.3  has the structure of a vector space, we can consider subspaces of it. This is exactly what we do in the study of linear codes. We can then use what we know from linear algebra for coding theory. Again recall that a subspace of a vector space is a subset that is a vector space on its own. For binary linear codes, we consider the vector space  EMBED Equation.3 . In fact, all the codes in Scheme 1 through Scheme 4 are examples of linear codes. Definition A binary linear code of length n is a vector subspace of  EMBED Equation.3 . Problem 8 Show that each one of the codes considered so far (Scheme 1 through Scheme 4) is a linear code. How about the code C ={1010,0101,1111 }? We again recall from linear algebra that every vector space has a dimension. We define the dimension of a linear code as its dimension as a vector space. Problem 9 Find the dimension of each code in Problem 7. Problem 10 Let C be a binary code of length k. What is the size of C? (i.e. how many codewords does C contain?) The length and the dimension are two of the most important parameters of a linear code. Another important parameter is its minimum distance. A linear code C that has length n, dimension k, and minimum distance d is referred to as an [n,k,d]-code. Now you found that the Hamming code (Scheme 4) is a linear code. It has length 7, and dimension 4. So it contains  EMBED Equation.3  codewords. What is its minimum distance? Recall, that we claimed that it can correct single errors. What does that imply about its minimum distance? How can we go about finding the minimum distance of the Hamming code? An obvious and brute-force strategy would be to list all the codewords and compute all the distances between codewords. The next exercise asks you to do exactly that. Problem 11 List all the codewords of the Hamming code. Then look at the distances between distinct codewords. How many distances are there to consider? You probably agree that there are too many distances to check by hand. Later we will learn better methods to determine the minimum distance of a linear code. To this end, let us do a similar exercise which is a little less tedious. Problem 12 Compute the minimum weight of the Hamming code. How does it compare to the minimum distance? How many weights did you need to compute? Although Problems 10 and 11 are a little tedious, they are instructive. This kind of tedious work is exactly where we want to make use of a computer algebra system, like Maple. But, it was not a bad idea to first do it by hand for a couple of reasons: first we know exactly what we are doing, secondly we really appreciate the power of such systems. Now, let us see how to do these computations in Maple. Although, this example was doable by hand, there are much larger codes for which computations by hand are prohibitive. > with(linalg): > with(LinearAlgebra): #include these commands to do linear algebra in Maple Next, enter the equations defining the Hamming code > eq1:=x1+x2+x4+x5=0 mod 2;  > eq2:=x1+x3+x4+x6=0 mod 2;  > eq3:=x2+x3+x4+x7=0 mod 2; Then let Maple compute the matrix of this system of equations > A:=genmatrix({eq1,eq2,eq3},[x1,x2,x3,x4,x5,x6,x7],'b');  Now, let Maple solve this system using matrix form > C:=Linsolve(A,b,'r',t) mod 2;  Note that, the rank of the matrix is 3 and there are 4 free variables (which Maple calls t3,t5,t6,t7). Now, letting the free variables take all possible values (0 or 1), we can generate all solutions, hence all vectors (codewords) of the Hamming code as follows: > ls:=[]; # store solutions in a list, start with an empty list  > nops(ls); # gives the length of the list  > for t[3] from 0 to 1 do for t[5] from 0 to 1 do for t[6] from 0 to 1 do for t[7] from 0 to 1 do ls:=[op(ls),[C[1] mod 2,C[2] mod 2,C[3] mod 2,C[4] mod 2,C[5] mod 2,C[6] mod 2,C[7] mod 2]]: od: od: > od: > od: > nops(ls);  This means 16 vectors are stored in the list. We can access the individual elements in the list as follows: > ls[5];  And here are all of the elements in the list, hence all codewords of the Hamming code. > ls[1..16];  Next, we define a procedure to compute the distance between two vectors. > distance:=proc(u,v) local n,d,i: n:=vectdim(u): d:=0: for i from 1 to n do if u[i]<>v[i] then d:=d+1; fi; od; return d; end: And another one, to compute the weight of a vector. > weight:=proc(u) local n,w,i: n:=vectdim(u): w:=0: for i from 1 to n do if u[i]<>0 then w:=w+1; fi; od; return w; end: Finally, we can use all of above, to find the minimum distance and the minimum weight of the Hamming code: > mindist:=7;  > for i from 1 to nops(ls) do for j from i+1 to nops(ls) do if (distance(ls[i],ls[j])< mindist) then mindist:= distance(ls[i],ls[j]): fi: od: od: > mindist;  So, the minimum distance is 3. Now, check the minimum weight. > minweight:=7;  > for i from 1 to nops(ls) do > if (weight(ls[i])>0 and weight(ls[i])< minweight) then minweight:= weight(ls[i]): fi: > od: > minweight;  Maple confirms that minimum weight is 3 as well. Although, this example was small enough to be doable by hand, there are many codes that are much larger. We need computers to do computations for such codes. Fortunately, the fact that the minimum distance of the Hamming code is equal to its minimum weight is not a coincidence! This is true for any linear code. So, let us record this important result as a Theorem. Theorem 2 For a linear code C, its minimum distance is equal to its minimum weight. Problem 13 It is not hard to prove this theorem. Can you do that? Let us consider only binary codes. Here are some hints: You want to show that the minimum of the set { d(u,v) : u, v in C, u  EMBED Equation.3  v} is the same as the minimum of the set { wt(u) : u in C, u  EMBED Equation.3  the zero vector}. Use the linearity of C to show that every number in the first set appears in the second, and vice versa. Problem 14 Let C be linear code of dimension k. How many pairs does one need to consider when computing the minimum distance directly from the definition? How many weights need to be computed to find the minimum weight directly from the definition? So, you found that the minimum distance of the Hamming code is 3. Therefore, it is a [7,4,3]-code. It can detect any double errors and correct any single errors. Some History on Hamming Codes Coding theory is a subfield of a larger field called information theory. Cryptography, sometimes confused with coding theory, is another, distinct subfield of information theory. The whole subject started with the seminal paper of Claude Shannon [8] in the middle of the 20th century. Shannon established theoretical limits on how good a code can be, and he proved that “good codes” exist. However, his proofs were probabilistic and existential, not constructive. Shortly after Shannon’s theoretical results, Richard Hamming [3] and Marcel Golay [2] gave the first explicit constructions of error-correcting codes, known as Hamming codes and Golay codes. There is actually an infinite family of Hamming codes. What we have studied is the smallest non-trivial Hamming code. Richard Hamming was working at Bell Laboratories when he invented the Hamming code. He was frustrated that those early computers were detecting errors and halting, hence wasting a lot of computations. He thought, if the computer can detect errors, why can it not correct them? This led him to discover his single-error correcting code in the mid 1940’s. More about Richard Hamming and Hamming codes can be found at [3], [4]. There has been a vast amount of research since then to explicitly construct efficient codes that are promised by the theory. Mathematicians invented many other and more sophisticated codes over the years. In recent years, researchers came close to attaining the best possible theoretical results in practice [6]. Generator and Parity Check Matrices We have learned that a linear code is a subspace of  EMBED Equation.3 , hence a vector space by itself. There are other ways of obtaining or defining vector spaces that we recall from linear algebra. For example, the row space of a matrix defines a vector space. So does the null space. We can therefore define linear codes via matrices. Definition A generator matrix of a linear code C is a matrix G whose rows span C. A parity check matrix H of a linear code is a matrix whose null space is C. Therefore, the code (of dimension k) can be defined as either C = { u*G : u in  EMBED Equation.3  } or C = { u in  EMBED Equation.3 : H*u = 0 vector}. The rank of G or the nullity of H give the dimension of C. Problem 15 Find a generator and a parity check matrix for the Hamming code. We again recall from linear algebra that a k by n matrix over B defines a linear transformation from  EMBED Equation.3  to  EMBED Equation.3 . So, the vector-matrix multiplication u*G corresponds to encoding: The information vector u of length k is transformed into a codeword v = u*G of length n. The redundancy is added through the vector-matrix multiplication. The parity check matrix is useful for checking for errors. Suppose the code has a parity check matrix H. If a vector w is received, we compute the product H*w, called the syndrome of w. If the syndrome is the zero vector, we assume that there was no error. If not, we know that there is an error. In that case, can we correct the error? If yes, how? In general, decoding is a more difficult problem. There is an alternative description of the Hamming code based on a parity check matrix that has a very elegant way of decoding. We are about to learn this version of the Hamming code. We first note another useful property of the parity check matrix: Theorem 3 Let H be a parity check matrix of a code C such that any set of d-1 columns of H are linearly independent, and there is a set of d columns of H that is linearly dependent. Then the minimum weight (hence the minimum distance) of C is d. Proof The proof of this is based on the following observation: Let H be a k x n matrix with columns  EMBED Equation.3 , EMBED Equation.3 ,…, EMBED Equation.3  so, write H as H = [ EMBED Equation.3   EMBED Equation.3 … EMBED Equation.3 ], and  EMBED Equation.3 , EMBED Equation.3 ,.., EMBED Equation.3 ) be a vector, then the product H*v gives the linear combination  EMBED Equation.3  EMBED Equation.3 +  EMBED Equation.3 . We proceed by contradiction. Suppose there is a vector v of weight less than d in C. Let v have non-zero components at positions  EMBED Equation.3 , EMBED Equation.3 ,…, EMBED Equation.3 , where r < d. Then, we have H*v = 0 hence  EMBED Equation.3   EMBED Equation.3 . This means that the set of r < d columns  EMBED Equation.3   EMBED Equation.3 is linearly dependent, but this contradicts the assumption. Hence there is no codeword of weight less than d. On the other hand, existence of a set of s linearly dependent columns implies the existence of a codeword of weight d. Problem 16 Use theorem 3 to show that the Hamming code has minimum weight 3. Decoding with the Hamming Code and Equivalent Codes When we use an error-correcting code in a communication system, it is important to have an efficient way of correcting errors (this is called decoding) when errors do occur. Earlier in this unit we have seen a visual method to decode the Hamming code using circular regions (page 8). Although that is a neat way of illustration for humans, it is not as useful for computers. We now give an alternative description of the Hamming code that is very convenient for decoding using computers. We will also introduce the concept of equivalent codes. Consider the numbers 1 through 7 and their binary representations. For example, the binary representation of 6 is 110 because  EMBED Equation.3 . We define a 3 by 7 matrix whose columns are binary representations of the numbers 1-7. We will use that matrix as a parity check matrix of the Hamming code. Let us use Maple to construct this matrix. First, Maple can find binary representations of numbers as follows. The command > binrep:=convert(6,base,2);  converts the number 6 to binary. However, the order of bits is reverse of what we normally use, but this is easy to fix. Now, we can write a loop to construct the matrix. > H:=[]: > for s from 1 to 7 do > binrep:=convert(s,base,2): > column:=vector(3,0): > for t from 1 to vectdim(binrep) do # reversing the bits > column[3-t+1]:=binrep[t]: > od: > H:=augment(op(H),column): > od: > evalm(H); 1 2 3 4 5 6 7  Notice that this parity check matrix is not exactly the same as what you found in Problem 15. Although, both matrices have the same set of columns, they are in different order. If the order of the columns in the latter matrix is 1,2,3,4,5,6,7 then the order in the original matrix is 7,6,3,5,2,1,4. It turns out that permuting the rows of a parity check matrix does not change the code in any essential way. The effect of such a permutation is exactly to permute the coordinates of codewords. We call two versions of such codes equivalent codes. Equivalent codes have the same essential characteristics. Now let us list the codewords in this version of the Hamming code. The command > nH:=Nullspace(H) mod 2;  gives a basis for the nullspace of H, hence a basis for the Hamming code. Using this basis, we can generate all the vectors in the code: > v1:=Transpose(Vector(7,0)): > v2:=Transpose(Vector(7,0)): > v3:=Transpose(Vector(7,0)): > v4:=Transpose(Vector(7,0)): > for i from 1 to 7 do v1[i]:=nH[1][i]: > od: > for i from 1 to 7 do v2[i]:=nH[2][i]: > od: > for i from 1 to 7 do v3[i]:=nH[3][i]: > od: > for i from 1 to 7 do v4[i]:=nH[4][i]: > od: > ls2:=[]: > for i1 from 0 to 1 do > for i2 from 0 to 1 do > for i3 from 0 to 1 do > for i4 from 0 to 1 do > ls2:=[op(ls2),[VectorScalarMultiply(v1,i1) mod 2+VectorScalarMultiply(v2,i2) mod 2+VectorScalarMultiply(v3,i3) mod 2+VectorScalarMultiply(v4,i4) mod 2]]: > od: > od: > od: > od: > for i from 1 to nops(ls2) do ls2[i]; > od; (output written in compact form for space) ,,, ,,,,,, ,,, Problem 17 Verify that if the permutation 1->7, 2->6, 3->3, 4->5, 5->2, 6->1, 7->4 is applied to the coordinates of each of the vectors in this version of the Hamming code, we do get the set of vectors in the original version of the Hamming code. Let us also obtain a generator matrix for the Hamming code that we will be used for encoding. > G:=[]: > for i from 1 to nops(nH) do > G:=stackmatrix(op(G),nH[i]): > od: > evalm(G);  Now, let us encode the original data 1,0,1,1. We use the generator matrix for encoding. > v:=vector([1,0,1,1]);  > c:=map(x->x mod 2, evalm(v&*G));  (Explanation: evalm(v&*G) does the vector-matrix multiplication, and x->x mod 2 reduces the result mod 2) So, the resulting codeword is c = ( 0,1,1,0,0,1,1). To see if there is an error in the received vector r, we look at the syndrome H*r. If it is zero, there is no errors. If not, there is. Let us verify this: Suppose there is no error, so r = c. > r:=c: > syn:=map(x->x mod 2, evalm(H&*r));  Which means there is no error. Suppose now that an error occurs at position 6. That means that a 1 is added to that position, or the vector (0,0,0,0,0,1,0) is added to the entire codeword. So the received vector is r = (0,1,1,0,0,0,1). Let see what we obtain then. > r[6]:=(r[6]+1) mod 2; # introduce error at position 6  > syn:=map(x->x mod 2, evalm(H&*r));  We see that the syndrome is not the zero vector, so we know there is an error. The next question is, do we know where the error is? The elegant thing about this version of the Hamming code is that the syndrome gives the location of the error in binary. The vector 1,1,0 is the binary representation of the number 6, which means that the error is at location 6. Neat huh? Problem 18 Show that in general when there is a single error in the transmitted codeword of a Hamming code, the syndrome of the received vector is the position of the error in binary. In summary, notice that generator matrices are useful for encoding and parity-check matrices are useful for decoding. General Binary Hamming Codes It turns out that there are infinitely many Hamming codes. We just had fun with the smallest (non-trivial) Hamming code. Let us learn how to define all binary Hamming codes. A binary Hamming code has length  EMBED Equation.3  for some positive integer r. Their length have this particular form, they do not exist for arbitrary lengths. In the example we studied, r was equal to 3. They are defined through parity check matrices, similarly to the way we defined length 7 code. The parity check matrix H has binary representations (vectors of length r) of the numbers 1 through  EMBED Equation.3  as its columns. So it is an r by  EMBED Equation.3 matrix. Note that this means the rows of H give the set of all non-zero binary vectors of length r. So, the length of a Hamming code is n =  EMBED Equation.3 . Let us determine the other two important parameters of a Hamming code. The dimension is equal to the nullity of H, which is  EMBED Equation.3  - (the rank of H). Notice that the rank of H is at most r. We claim that it is in fact equal to r. Problem 19 Verify this claim. Therefore, the dimension of a Hamming code is  EMBED Equation.3 -r. The last important parameter to determine is its minimum distance. We claim that it is 3. Problem 20 Verify this claim. (Hint: Use Theorem 3) Therefore, the parameters of a general Hamming code are [ EMBED Equation.3 , EMBED Equation.3 -r, 3] for some positive integer r. For the Hamming code we studied in detail, r = 3. Hamming codes are 1-error-correcting codes: they can correct any single errors. Problem 21 Use Maple to construct a parity check matrix H and generator matrix G for the Hamming code for r = 4. Use G to encode the message 1,1,1,0,0,0,1,1,1,0,1. Introduce single errors at selected positions and see if you can correct them using H. Hamming Codes Are Perfect There are more useful properties of Hamming codes we are yet to explore. In a mathematically well-defined sense, the Hamming codes are “perfect”. This notion of perfectness is related to the concept of correctable errors. Recall that we are using the maximum likelihood principle in correcting errors. If a received vector is not a codeword, then we know there is an error. If there is a unique codeword the received vector is closest to, then we correct it to that codeword. There are situations where there are more than one codeword with the same distance to a given vector. In those cases, we cannot correct errors unambiguously. Problem 22 Consider the code from Problem 7, that is C ={1010,0101,1111}. Give an example of vector that has the same distance to more than one codeword. Problem 23 Let C be a code with an even minimum distance. Show that there exists a vector that has the same distance to more than one codeword. Definition A code of length n is said to be e-perfect if every vector in  EMBED Equation.3  is either a codeword or is within e units of a unique codeword. Problem 23 shows that the minimum distance of a perfect code cannot be an even number, therefore it is an odd number. If every vector in  EMBED Equation.3  is within e units of a unique codeword of a code C, then C is said to be e-perfect (also e error-correcting). Having an odd minimum distance is a necessary condition for a code to be perfect, but is it also sufficient? Problem 24 Show that having an odd minimum distance is not sufficient for a code to be perfect by considering the code whose generator matrix is  Use Maple to find the minimum distance (recall minimum weight is equal to minimum distance of a linear code). Then find a vector that has the same distance to more than one codeword. Hence, show that this code is not perfect (even though it has an odd minimum distance). Now, we will characterize perfectness using some equations. First, we define a sphere of radius r around a vector u as  EMBED Equation.3 , which is the set of all vectors in the space  EMBED Equation.3  whose distance from u is less than or equal to r, i.e., those vectors within r units of u. In Theorem 1, we showed that a code of minimum distance d can correct  EMBED Equation.3  errors. This is equivalent to saying that spheres of radius  EMBED Equation.3  around codewords are disjoint. We can represent this fact pictorially as follows:  EMBED Equation.3   SHAPE \* MERGEFORMAT  Figure 4: A graphical representation of the sphere packing bound In the figure above, the solid dots represent codeword. Other vectors in the space  EMBED Equation.3  are depicted by small circles. Big circles represent spheres of radius r. (A more correct term to use would be “ball” rather than “sphere”, but historically they are called spheres in this context). For a code of minimum distance d, spheres of radius r =  EMBED Equation.3  are disjoint, i.e., they do not overlap. Our next question is to determine the number of vectors in a sphere of radius r. This is a counting problem. To solve this problem, we can proceed as follows. Given a vector u in  EMBED Equation.3 , let us first determine the number of vectors that have distance exactly 1 to u. Such a vector v will have all but 1 position the same as vector u. So, to count all these vectors, we just find all possible positions that v will differ from u. Obviously, that number is n. Next, what is the number of vectors that have distance 2 from u? To determine such a vector v, we just need to pick 2 positions at which v will differ from u. The total number of such choices is  EMBED Equation.3  =  EMBED Equation.3 . Proceeding in this manner, we find that the total number of vectors in  EMBED Equation.3 , or “the volume of the sphere” is  EMBED Equation.3 + EMBED Equation.3 +…+ EMBED Equation.3  (the term  EMBED Equation.3 =1 is for u itself, the center of the sphere), and this number is independent of the vector at the center. Now, if C is a code of length n, and minimum distance d, then we know that the spheres of radius e =  EMBED Equation.3  are disjoint. Therefore, the total number of vectors in all of the spheres around codewords is no more than the total number of vectors in the whole space  EMBED Equation.3 . The latter number is  EMBED Equation.3 . Noting that the volumes of the spheres are all the same and there are |C| spheres around codewords, the number of vectors in all of the spheres around codewords is  EMBED Equation.3  EMBED Equation.3 + EMBED Equation.3 +…+ EMBED Equation.3 ] This number is no more than  EMBED Equation.3 . This gives us the well-known bound known as sphere packing bound. Theorem 4 For a code of length n, and minimum distance d = 2e+1 (or 2e+2), we have  EMBED Equation.3  EMBED Equation.3 + EMBED Equation.3 +…+ EMBED Equation.3 ] EMBED Equation.3 . To say that a code is perfect is equivalent to saying that there are no vectors left outside the spheres of radius e, i.e. those spheres cover the whole space. Hence, the equality is attained in sphere packing bound. Graphically, this means that there are no vectors outside the spheres in Figure 4 if radii of the spheres are all equal to  EMBED Equation.3 . Problem 25 Show that the [6,3,3] is not perfect and [7,4,3] Hamming code is perfect using the sphere packing bound. Problem 26 Show that the general the Hamming codes are all perfect. Hence, Hamming codes provide an infinite family of perfect codes. It turns out that perfect codes are rare. Besides Hamming codes, there exist only few other perfect codes. The only other linear perfect codes are what are known as Golay codes. They are also well-known codes that were invented around the same time as Hamming codes [2]. For more information on Golay codes see [5]. It took mathematicians a great deal of effort to prove the fact that there exist few perfect codes. To learn more about perfect codes and their classification, see page 24 of [5]. Additional Projects Related to Hamming Codes Project 1: Hamming Codes and the Hat Puzzle The binary Hamming code of length 7 has also an interesting connection to the well-known puzzle “The Hat Problem”, featured in the New York Times [7], with a more technical treatment in [1]. The puzzle is as follows: At a mathematical show with 7 players, each player receives a hat that is red or blue. The color of each hat is determined by a coin toss. So the hat colors of players are determined randomly and independently. Each person can see the other players’ hats but not his own. When the host signals, all players must simultaneously guess the color of their own hats or pass. The group shares a $1 million prize if at least one player guesses correctly and no players guess incorrectly. No communication of any sort is allowed between the players during the show, but they are given the rules in advance and they can have an initial strategy session before the game starts. What should they do to maximize their chances? Question 1 There is an obvious strategy with a 50% chance of winning. What is that? Question 2 Is there a strategy with a higher chance of winning? As you might predict, there is a strategy with a much higher chance of winning than 50%, and it involves [7,4,3] Hamming code. The fact that the Hamming code is perfect and 1-error correcting makes it a good solution, in fact the best possible solution. Describe how the Hamming code can be used to solve this puzzle with a winning probability of 7/8. Project 2: Hamming Codes over Integers Modulo p. We studied only binary codes so far. However, we can use any finite set as the alphabet. If we are interested in linear codes, the alphabet must have the structure of a field. We know that  EMBED Equation.3 , integers modulo p, is a field when p is a prime number. For instance,  EMBED Equation.3  is a field. A code whose alphabet is  EMBED Equation.3  is referred to as a ternary code. A linear code of length over  EMBED Equation.3  is a vector subspace of  EMBED Equation.3 . A code over  EMBED Equation.3  is referred to as a p-ary code. Most concepts for binary linear codes are defined in the same way for codes over other finite fields, such as the dimension and the Hamming distance. A code of length n, dimension k, and minimum Hamming distance d over  EMBED Equation.3  is referred to as an  EMBED Equation.3 -code. It turns out that Hamming codes can be defined over any finite field. The purpose of this project is to introduce general Hamming codes over  EMBED Equation.3 for any prime p. Here is the definition: Definition Let r be a positive integer. The p-ary Hamming code is defined as the code whose generator matrix H contains all vectors of length r over  EMBED Equation.3  whose first non-zero component is 1. Question 1 What is the number of columns of H, i.e. what is the length of the Hamming code? Questions 2 What is the dimension of the Hamming code? Question 3 Show that the minimum distance of the Hamming code is 3. Question 4 Obtain the general version of the sphere packing bound for  EMBED Equation.3 . Then show that Hamming codes are perfect. Question 5 Implement the Hamming code with p = 5, and r = 2 in Maple (find a parity check matrix and a generator matrix). Verify the code parameters using Maple. Encode the message m=(1,0,2,4) into a codeword c, then introduce an error at position 5 of c by adding 4 to that position. Then, come up with a decoding algorithm for this (and general) Hamming code. Notice that there are two things to figure out in decoding: The position of the error, and the magnitude of the error. Project 3: Hamming Codes Over an Arbitrary Finite Field. Integers modulo p, for a prime p, are well-known examples of finite fields. These are called prime fields. However, there exist other finite fields. It is well-known that there is a unique finite field for every prime power  EMBED Equation.3 , called the Galois field of order q, denoted by GF(q). For instance, there is a finite field with  EMBED Equation.3  elements (and it is not integers modulo 4). Typically, students are only familiar with the prime fields until they learn about more general finite fields in Abstract Algebra. This project is the same as project 2, but over non-prime finite fields. So, define Hamming codes over an arbitrary finite field. As a concrete example, implement the Hamming code for q = 4, and r = 2. REFERENCES Bernstein, M. 2001. The Hat Problem and Hamming Codes, Focus. 21(8): 4-6 Golay, M. J. E. 1949. Notes on digital coding. Proc. IRE. 37: 637 Hamming, R. W. 1950. Error-detecting and error-correcting codes. Bell System Technical Journal. 29: 147-160 Morgan S. P. 1998. Richard Wesley Hamming (1915-1998), Notices of the American Mathematical Society 45 (8): 972-977 Pless, V. Introduction to the theory of error-correcting codes, Third edition, 1998. John Wiley& Sons, New York. Richardson T. J., Shokrollahi M. A., and Urbanke R. L. Design of capacity-approaching irregular low-density parity-check codes. IEEE Transactions on Information Theory. 47 (2): 619-637. Robinson, S. 2001. Why Mathematicians now care about their hat color. The New York Times. Available:  HYPERLINK "http://www.cecs.csulb.edu/~ebert/hatProblem/nyTimes.htm" http://www.cecs.csulb.edu/~ebert/hatProblem/nyTimes.htm Shannon, C. E. 1948. A mathematical theory of communication. Bell System Technical Journal. 27: 379-423 and 623-656 Shetter, W. Z. 2000. This essay is redundant. Available: http://mypage.iu.edu/~shetter/miniatures/redund.htm   In general, the notation  EMBED Equation.3  pronounced as “n choose k” stands for the number of ways of choosing k objects out of n in which order does not matter. It is well known that  EMBED Equation.3      PAGE  PAGE 23 X1 X4 X3 X7 X6 X5 X2 Sent Received 1 1 0 Source le atprofessionst outside his profession are weather and soccer. authored several papers with Kenyon undergraduates. ement1011 1011010 1001010 1011010 1011 Receiver Decoder Received Message Encoder Channel 0 1-p p p 1-p r r r r 6ˆ‰ž¶·ÐÑàá     ' 2 3 4 E F G r Š Œ Ÿ   ® ¯ ¶ à 9 : Ã Ä ùëáÚáùáùÓÉá»áª»ž»á—ᐈ}ˆrnjfnbfbnfnbnbh£R‚h"V¿h‡ahõõhl+Phl+PCJ$aJ$hl+PhõõCJ$aJ$hl+PCJ$aJ$ h‡ah°?œ hõõ5\h‡ah‡a0J5\!jh‡ah‡a5U\jh‡ah‡a5U\h‡ahŠ75\ hŠ75\ h‡ah‡ah‡ah‡a5\hH>Îh‡a5CJ$\aJ$ h‡a5\&6Ucž·Ñà ( ) * + , - . / 0 1 2 3 4 F ôôôôôôôôôôôôôôôôôôôôôôôìää$a$gdl+Pdàgd‚%ó $dàa$gd‚%ó¶Å‘ƹÆ7ÈþþþþF G    ßà=>?@ABCDEFGHIJKLY÷òíòò÷÷òòòòòòòòòòòòòòòòòòâ $dàa$gdl+Pgd£R‚gdl+P$a$gdl+PÄ  ` a e § š » Œ À     ;<@AK^}—˜mpwxœ«¬¹×Øóô÷‘’ÞßàüøüøôüøüøüøüðìåÚÒÇÀ¹À²ø®ø§®² ¹œ¹œ¹œ¹œ¹œ¹œøœ˜‘œ˜øü† h‡ahl+Ph°?œ h‡ah°?œhõõhæ+n h‡ahbc  h‡ahV¢h‡a h‡ah$+· h‡ahÀuŒ h‡ah¹z-hl+Phl+PCJ$aJ$hl+PCJ$aJ$hl+Ph‡aCJ$aJ$ h‡ahõõhl+Ph 5.h k-h£R‚h^Bƒ3àéù-;<=LMXYj›º»^_`Óà<HIÌÒÞ  %4Gsƒ…†¶ÃÍïð.®¯°ÀõîêæêâÞÓÈÓœ¶ê¶¯«Þ§ § œ §œ§’§Ž§Ž§’Ž§’§œŠŽŠŽŠŽŠ§Þhl+PhÅ5ªCJ aJ hkUh k-h]~~h]~~6]h£R‚ h‡ah]~~h]~~h‘?ƒ h‡ah‘?ƒ h‡ahãAihl+Ph]~~CJ aJ hl+Ph÷dfCJ$aJ$hl+Ph°?œCJ$aJ$hl+PhÀuŒh hæ+n h‡ah°?œhl+Ph°?œCJ aJ 0Yj_`¯°ÁÂ\]z{|Žµ˜!™! $¡$5%6%S%T%œ'¹'ä'–(÷ïêêêêêêêêááêêêêêêêêêêêêêê„Ð`„Ðgdl+Pgdl+P$a$gdl+Pdàgdl+PÀÁÂÑ/9EOP_k•ŒœHNnuyzL_`acxy–ÀÄàáãäELu‘’“ž\]œ¶‹Œ‘’³ÓÖÝ øíéâéâÛÔéÛéÛÐÛÐÛÈÛÈÛÐÛÁžÁÛÁÐÁÛÁÛÐÛŽÛÁÛÈÛÈÛÐÛÁÛ°ÛÁÛÁÛÐÛÔÐÛ©ÛÁÛÁÛÁ h‡ahe99hl+Ph k-h‡ahx80J h‡ahx8h‡aho9Ü6h£R‚ h‡ahŒoN h‡aho9Ü h‡ahn ‚hÅ5ªhl+Phl+PCJ aJ h|%ƒCJ aJ @ "#%z{|Žµž Ÿ Ô Ù á ï !!>!—!˜!™!š!¬!" "†"ˆ""®"¯"°"³"Ž"Ç"È"É"Ë"Ì"%#F#T#s#»#Œ#õ#ù#I$R$b$$ $¡$€$§$ùõîçãÜÐÈçÁçÁçÁçœÁç¹²ç®çªç£çœœœçœçœœçœçÁçîçœç”çŒçÁçˆçÁhl+Ph‡aho9Ü6h‡aho9Ü] h‡ahŒoN h‡ahn ‚h}ihÅ5ª h‡ahl+Pho9Üh£R‚ h‡ah&O`h‡ahl+P5hl+Pho9ÜCJ \aJ h‡ah^Bƒh&O` h‡aho9Ü h‡ah&Jèh_>t h‡ahâ>ö5§$º$Ë$ä$å$æ$%3%4%5%6%R%S%T%™%±%²%·%È%É%š'›'œ''Ž'µ'¶'·'ž'¹'œ'ã'ä'û'ü'(2(3(ùòùòëçùçàÛÐÈœ¹¯š¡¹¹™¹‘™‘ƒ{‘¹skdùò`òh-b™ hG$³h•ih~EŸCJaJh£R‚CJaJjËh~EŸUjhkFcUmHnHujhkFcUhkFch£R‚ hG$³hG$³ hG$³6]hG$³hG$³6]hG$³hl+Phl+PCJ aJ h}iCJ aJ hl+Ph}iCJ aJ h}i>* h"V¿h}ih}i h‡ah&O` h‡aho9Ü h‡ahŒoN%3(M(N(^(e(g(•(–(—(Ÿ( (š(¬(°(±(Ô(á( ))*)+)=)A)y))Å) * *5*á*â*+—+€+¥+Š+¯+±+Ì+Ñ+Ò+,p,q,r,µ,Ñ,Ò,Û,Ü,Ý,Þ,é,÷,-- -ùõîêõêæß×õîÐîõîÐîùîõîÆîŸî·­·îõîŸî©¥ ©Ð·î·©æ™î·õîõîõ’·îêî h‡ah_< h‡ahl+P h}i>*hl+Ph}ih‡ahÚvŠ6] h‡ahÚvŠh‡aho9Ü6h‡aho9Ü5\ h‡ah&O`h‡aho9Ü>* h‡ah~EŸho9Üh~EŸ h‡aho9Üh£R‚ h‡ahŒoN8–(—(¥+Š+q,r,ú.û.•/–/33#3$3á4â45#9$9›9ž9ú9û9':(:ê<=@=A=öñññññññññññññññññññññññöñññgdl+P„Ð`„Ðgdl+P -5-6-S-«-¬-­-È-Ù-...F.U.V.….Š.§.Û.Ü.ø.ù.ú.û.//0/Z/”/•/–/ž/Ÿ/ö/þ/ÿ/0 0 00*0+050X0Y0~0"1+1L1¶1Ì1Í1â12ùòëòäòëòàòÜÕòÜòÎòÇÜÇÂœµ­à©à¥àž–ÜòŒòÜòÎòÎÜÎòÜòÎòÎòÎÜòÎh‡aho9Ü5\h‡aho9Ü>* h‡ahl+PhòwËhíŒh~EŸh~EŸ>*h~EŸhl+P>* ho9Ü>* h£R‚>* h~EŸho9Ü h‡ahä6~ h‡ah)$Éh£R‚h~EŸ h‡ahŒoN h‡ahÚvŠ h‡aho9Ü h‡ahw Ó52F2P2^2`2p2Š2›2œ2Ê2é2ø2333 3#3$3,3w3„3ž3Ÿ3444454à4á4â4ë4555w5š5ž5§5š5¹5º5Ô5ï5666ùòùòëòëòëòçëãß×çÐÈëÀëŒë²ëŒëãߪŠŸÈ똑Š†ëŠ‚ë{Š{ h‡ahSDhLrîh_>t h‡ahŒoN h‡ahŽ ¡ h‡ah&˜ h‡ah k-h k-h k-h k->*h‡aho9Ü5\h£R‚h‡aho9Ü6h‡aho9Ü>* h‡ahl+PhZ1&hZ1&>*hl+Pho9ÜhZ1& h‡aho9Ü h‡ahä6~ h‡ah_<-66*6+6,6-6]6^6q6r6s6t6˜6¹6º6»6Î6Ï6Ð6Ñ6Ó6Ô6ç6è6é6ê6ï6ð6ñ6777ôíÝÐôíôíÀ³ôí¯íôퟒôíôí‚uôínôí^Qj† h‡ahSDEHôÿUj·—ØI h‡ahSDPJUV h‡ahÏ šj,h‡ahSDEHôÿUj˜—ØI h‡ahSDPJUVjÔh‡ahSDEHôÿUjg—ØI h‡ahSDPJUVhLrîjˆh‡ahSDEHôÿUjø–ØI h‡ahSDPJUVj[h‡ahSDEHôÿUjv–ØI h‡ahSDPJUV h‡ahSDjh‡ahSDU770717?7a7y7|7}7~7ã7ý7=8Q8R88€8…8‡8ê8"9#9$9R9S9o9p9›9œ9³9Ž9µ9¶9·9ž9¿9À9Á9Â9ù9ú9û9ôíæßíßÕßÑÊßæßÑßÊßÊßÊÆŸџџ¶Ÿ¶š ¶Ÿ”‹”‚”yr h‡ahl+PhLrîmHnHuh£R‚mHnHuha5«mHnHuh‡ahLrîmHnHujà hLrîUjhLrîUmHnHujhLrîUhLrîh\O”ho9Ü h‡ah&˜h£R‚h‡aho9Ü5\ h‡aho9Ü h‡ahÏ š h‡ahSDjh‡ahSDU)û9&:':(:.;/;Ž<–<é<ê<ë<=========/=3=?=@=A=s>š>Ò>á>ã>ð>:?h?i?š?©?ª?õíâÛ×ÐÉÂÛ·°·Ÿ”·†ÛÂÛÂۂ{tmÂmÂfmb×bmbhLrî h‡ahei h‡ahÏ š h‡aho9Ü h‡ah—k±hyA„ h‡ah|%ƒ h‡ahŒoNjp h‡ahyA„U jh‡ahyA„UmHnHu h‡ahyA„jh‡ahyA„U h‡ahJm— h‡ahŽ ¡ h‡ah²Y h£R‚ h‡ah°.1hl+Phl+PCJ aJ hãAiCJ aJ hl+PhãAiCJ aJ $A=ª?«?Ö?×?•@–@ðCñCFFâFãF¡G¢G+H,HíHîHtjhhEHúÿU!jŽjOJ hCJPJUVaJhjhUhLrîh£R‚hLrîhLrî>*hl+Phl+PCJ aJ hLrîCJ aJ hl+PhLrîCJ aJ h‡ahl+P)ÕCÖC×CïCðCñCD+D-DMDNDaDbDcDdD¬D­DµD¹DÜDòDE E'E(EOEPEFFFF&F(Fºhb>º>*hšZÿhb>ºhvúhUthUt>*hւhû7h£R‚jµhhšZÿEHüÿU!jp [J hšZÿCJPJUVaJjhUtUhUthÓJïhl+Phh2cjhUj[hhÓJïEHôÿU4ªG«G+H,HŠHºHíHîHøHùHúH9I:IMINIOIPIiIjIlImIqIŸIÙIÚIâIäIåIøIùIúIûI;J*j¬hh aÊEHüÿU!j9sOJ h aÊCJPJUVaJjh aÊUh5%¢h aÊh£R‚j¿hhւEHüÿU!j9sOJ hւCJPJUVaJjhւUh/D˜ h£R‚>*hւhւ>*hšZÿhւhl+Phb>º hšZÿ>*,.K/K0K1K’K“KŠK§KšK©KÅKÆKÇKÏKÐKãKèKñKûKüKLLL*L0L]L^L€LL”L•L–L—LÑLÒLåLîáÙÕÙÕîÈÙÕÄÀž³Õ¯«ÕÀ£³Ÿ›‘›Õ›‰›xk‰›‰›joh/D˜h/D˜EHüÿU!jF2PJ h/D˜CJPJUVaJjh/D˜Uh/D˜h/D˜6]h/D˜h£R‚h/D˜hPzæ>*h0{Çh’^Ê hšZÿ>*hPzæhPzæ>*hl+PhւjhPzæhPzæEHäÿUhPzæjhPzæUj™hPzæhPzæEHäÿU!j8tOJ hPzæCJPJUVaJ#yLšLºLÊL"M#M$M1M2MrNÏOÐO°Q±QRR£R€R>S?SwSxSèSéSàTáTîVïV÷÷÷÷òòêòòòòòòòòòòòòòòòòòòòò$a$gdl+Pgdl+P & Fgdl+PåLæLçLèL!M#M$M0M1M2MbMcMdMwMxMyMzM N#N.N/N0NCNDNENFNLNXNºN»NÎNÏNÐNÑNOTOWOîáÙÕÑͺ²Ñ®ŠÑ•ˆŠÑ„Ñ®ŠÑ•wŠÑmÑŠÑ•`ŠÑ\„hkrâja'hë&hë&EHüÿUhë&hë&6]jZ%hë&hë&EHüÿUh’^ÊjS#hë&hë&EHüÿU!jŽ6PJ hë&CJPJUVaJjhë&Uh£R‚hl+PCJ$aJ$hë&CJ$aJ$hl+Phë&CJ$aJ$h^Bƒhë&h/D˜jh/D˜Uj_!h/D˜h/D˜EHüÿU!jÀ2PJ h/D˜CJPJUVaJ$WOÏOÐOÖO×OêOëOìOíOìP QEQFQYQZQ[Q\Q_Q‘Q°Q±Q»QõQöQ R R R RRRRRRyR¢R£R€R=S>S?SGSHSISwSxS€S‚SèSéS@TCTcT€T¥TüøôìôÛÎìôÊôìôÛœìô¹ôø±ôìôÛ€ìôø±Ÿ›ô¹ôø¹ôø“Ÿ›¹ø‹Ÿ‡ø¹‡Ê‡Êhãbhãbhãb>*hkrâhçGë>*h£R‚ h’^Ê>*jv-hë&hkrâEHüÿUhkrâhkrâ>*hçGëjo+hë&hkrâEHüÿUh’^Êjh)hë&hkrâEHüÿU!jŽ6PJ hkrâCJPJUVaJjhkrâUhkrâhl+Phë&5¥TßTàTáT÷TøTU!U"U#UDUEUSUTUUUhUiUjUkUwU”U•U¡U¢UV3VaVíVîVïVøVùV/W0W‡WˆWßWþW:X=XpXqXyX{XYYYAYKYêYìYZ"Z`ZaZbZöZ[[[üøôüðéüéðüðåüÝåÌ¿Ýåüðüðüå»åüô³®åðåôå»åªåô³®åŠ¢»ŠžªžªžšŠ¢ª¢ªh·pXh5%¢h”^ h aÊh²) h’^Ê>*hã6hã6>*h’^Êj}/hã6hã6EHúÿU!jú€PJ hã6CJPJUVaJjhã6Uhã6 h‡ahLrîh£R‚hl+PhçGëhãb;ïV‡WˆWpXqXYYbZ[[!["[9[:[p[q[¥[Š[Â[Ä[à[â[þ[ÿ[=\>\x\z\{\úúúúúúúúúñññññññññññññññññññ 7$8$H$gdl+Pgdl+P[[ [!["[$[8[9[:[H[P[Q[o[p[q[€[¥[Š[š[Á[Â[Ã[Æ[ß[à[ôàôËôàô˺©º©˜…}ujVjDjVj"j®1h·pXh·pXB*EHùÿUph'h·pXh·pX5B*OJQJ\^Jphÿh·pXh·pXB*phhÎ3 B*phh5%¢B*phh·pXB*phh5%¢hÎ3 B*ph!h5%¢5B*OJQJ\^Jphÿ!h·pX5B*OJQJ\^Jphÿ!hÎ3 5B*OJQJ\^Jphÿ)hÎ3 hÎ3 B*CJOJQJ^JaJphÿ'hÎ3 hÎ3 5B*OJQJ\^JphÿhÎ3 hÎ3 B*phà[á[ä[ý[þ[=\>\@\w\x\y\z\{\®\¯\±\Î\Ï\Ð\Ñ\Ò\]7]Ú]Ü]ã]æ]^^îãÏãÇ¿ãÏã­£˜Ç¿ãÏã†|˜ÇtÇãÏcRã!h·pX5B*OJQJ\^Jphÿ!hoù5B*OJQJ\^JphÿhoùB*phh·pXB*EHñÿph"j7h·pXh·pXB*EHñÿUphh·pXh²)B*phh·pXB*EHÕÿph"jN5h·pXh·pXB*EHÕÿUphh²)B*phh·pXB*ph'h·pXh·pX5B*OJQJ\^Jphÿh·pXh·pXB*ph"j~3h·pXh·pXB*EHùÿUph{\®\¯\Ï\Ñ\Ò\9]Ù]Ú]^^G^I^c^}^—^²^___!_'_3_5_6_¢_£_ööööööööööööööööööööööëææögd’^Ê $dða$gdl+P 7$8$H$gdl+P^^^'^F^G^H^K^b^c^d^|^}^^–^—^™^±^³^ð^ò^______ _#_&_)_2_3_4_5_6_d_¡_îãÏŸã¬ãÏã€Ïã€Ïã€ÏãϓÏãÏãÏãÏãÏãςwsokch·pXB*phh’^Êh²)h·pXjÈ<h«yŠh·pXU!h·pX5B*OJQJ\^Jphÿ!h£R‚5B*OJQJ\^Jphÿh£R‚B*ph"jh;h·pXh·pXB*EHùÿUph!h—k±5B*OJQJ\^Jphÿ'h·pXh·pX5B*OJQJ\^Jphÿh·pXh·pXB*ph"jà9h·pXh·pXB*EHùÿUph%¡_¢_£_¥_«_¬_­_®_¯_»_Ï_Ð_Ý_å_```````3`T`[`\`]`^`_`a`ùñæÒæÀ¶©¡ñ™‘™‘ñæÒææwowowño`hoùhoùB*mH phsH hoùB*phh"}B*ph"jÖ?h·pXh·pXB*EH…ÿUphh’^ÊB*phh”^ B*phh²)B*phh²)h²)B*EHùÿphh²)B*EHùÿph"j6>h·pXh·pXB*EHùÿUph'h·pXh·pX5B*OJQJ\^Jphÿh·pXh·pXB*phh·pXB*ph h’^Êh·pX£_¬_®_¯_```^`_`u`ƒ`”`œ`³`Ô`Ù`ä`é`ê`aa1a?aPaXaoaŒa‘aöííöööööööööööööööööööööööö 7$8$H$gd²) 7$8$H$gdl+Pa`u`v`‚`ƒ`…``“`”`–`›`œ`ž`³`µ`Ô`Õ`Ù`Ú`è`é`ê`aaçÒçÞ€…žqf^qMqMqMqfE=^hªX[B*phhoùB*ph!h£R‚5B*OJQJ\^Jphÿh£R‚B*phhoùhoùB*ph'hoùhoù5B*OJQJ\^Jphÿh£R‚hoùB*ph'h£R‚hoù5B*OJQJ\^Jphÿ'h£R‚h–J°5B*OJQJ\^Jphÿh£R‚h£R‚B*phhoùhoùB*mH phsH )h£R‚5B*OJQJ\^JmH phÿsH /hoùhoù5B*OJQJ\^JmH phÿsH aaa!a1a2a>a?aAaKaOaPaRaWaXaZaoapaŒaa‘a’a“a¡a¢a£aÍaÎabbbb÷ìáÍŒÍᎣÍáŽÍáŽÍŒÍŒÍŒ’ÍኂŽ‚wcw'hvÁhvÁ5B*OJQJ\^JphÿhvÁhvÁB*phhoùB*phh5%¢B*ph!hoù5B*OJQJ\^Jphÿ!h–J°5B*OJQJ\^Jphÿh£R‚B*ph!h£R‚5B*OJQJ\^Jphÿ'h"}h"}5B*OJQJ\^Jphÿh"}h"}B*phh5%¢h"}B*phhªX[B*ph‘aa¢a£a€abbb b>b]b­b²b·bÂbÄbÅbcccc4cc“c c¢cöööööíÞöööööööööööööööööö$dh7$8$H$a$gdvÁ 7$8$H$gdvÁ 7$8$H$gdl+Pbbb b"b=b>b?b\b]b^b¬b®b±b³b¶b¹bÁbÂbÃbÄbÅbcccccc3c5c7cŒcc’c•cŸc cîãÛЌЫŒÐ«ŒÐŒÐŒÐŒÐ™Ð‡ÐŒÐuÐŒÐmŒÐŒÐŒÐh£R‚B*ph"j­Gh}A,h}A,B*EHùÿUphh}A,B*phh}A,B*EHùÿph"j?Fh}A,h}A,B*EHùÿUph!h£R‚5B*OJQJ\^Jphÿ'h}A,h}A,5B*OJQJ\^Jphÿh}A,h}A,B*phh5%¢B*phhvÁhvÁB*ph"j·DhvÁhvÁB*EHùÿUph$ c¡c¢c?d@drdsdd€de e!eCeDeEeFeMeNeOeše›e€e¥eèe fffAfBfZf[fnfofpfqfƒfîãÛÓÛËÃÓÃÓ»ÃËÃË®€šÃË®ÃˆÃˆÃӄ|„k^|„j—Jhh5%¢EHüÿU!j9sOJ h5%¢CJPJUVaJjh5%¢Uh5%¢h²)B*phh>*B*phh0{Ç>*B*phhkU>*B*phh5%¢h5%¢>*B*phheYˆB*phh5%¢B*phhl+PB*phh£R‚B*phh}A,B*phh}A,h}A,B*ph"j7Ih}A,h}A,B*EHùÿUph#¢c£crdsdEeFeše›eBgCg*h ÂheYˆ>*hl+Pj„Lhh5%¢EHüÿU!j9sOJ h5%¢CJPJUVaJjh5%¢Uh5%¢h£R‚.Wm[m†m«m­m®mãnänçnénên oooBoCoDoWoXoYoZo|o p pp"p2pfpgpqp„p…p¹pqqBqCqTqUqhqüõîõêõîõâ×ÌĹµê­µœ­µ‹‡‹‡‹‡ƒ{‡ê‡wêwêwowjh€,,Uh€,,h€,,h.^0>*hl+Ph.^0h±= jqNhë&hal EHüÿU!jŽ6PJ hal CJPJUVaJjhal Uhal hl+Phl+PCJ aJ h5%¢CJ aJ hl+Phal CJ aJ h$6÷h²)CJaJh}A,CJaJh£R‚ hh„/â hh$6÷h²)'hqiqjqkq|q}qq‘q’q“q¥qŠqàqâqëqìqíqrr.r/r>rRrSr”r•ršr©rªr«r¯r°rÃrÄrîáÙÕÙÕÄ·ÙÕ³¯«£ž³ÕšÕ«¯–³¯Ž¯}pŽ¯Ž¯_!jŽ6PJ hI[CJPJUVaJj…Thë&hI[EHüÿU!jèPJ hI[CJPJUVaJjhI[UhhÍ× h>*h€,,h€,,>*hl+PhI[h£R‚j~Rhë&h€,,EHüÿU!jŽ6PJ h€,,CJPJUVaJh€,,jh€,,UjxPhë&h€,,EHüÿU!jiäPJ h€,,CJPJUVaJ!âq.r/r/v0v&w'wzp{q{¿{À{Á{Â{Ã{÷{ø{~~xÈÉæè“€”€€úúúúúúúõõúúúúúííúõõúúääúúä 7$8$H$gdl+P$a$gdžÚgdžÚgdl+PÄrÅrÆrßsôsõs÷s tPtXtuu4u5ulu‹u§u³uëu/v0v8v9vw ww$w%w&w'w,w‹wŒwŸw w¡w¢w£w€w·wžwòêæâæâæâØâÔâÔâÐâÐÌÐÈÀ»Ð·³Ð³ÐÈ«³£³’…£³£³t!jÐPRJ hŽOÅCJPJUVaJj’Xhp?ŒhŽOÅEHöÿU!j¹PRJ hŽOÅCJPJUVaJjhp?ŒUhŽOÅhp?Œ>*hp?ŒhzE" hmA@>*hp?ŒhkU>*hžÚhhkUh£R‚hSíhSí6]hSíhI[jhI[Uj‹Vhë&hI[EHüÿU(žw¹wºw»wŒwœwŸwÑwÒwÓwÔwÕwéwêwýwþwÿwxxxxxxxxx-x.x/x0x3x7x8xKxòêæâæÚÖÅžÚæâ°âŸ’°â°ât°â°âcV°âæÚÖjÁbhŽOÅhxu@EHôÿU!j QRJ hxu@CJPJUVaJj·`hp?Œhxu@EHöÿU!jÐPRJ hxu@CJPJUVaJj­^hp?Œhxu@EHöÿU!j¹PRJ hxu@CJPJUVaJjhxu@UjŠ\hŽOÅhŽOÅEHôÿU!j QRJ hŽOÅCJPJUVaJhŽOÅjhŽOÅUhxu@hp?Œjhp?ŒUjœZhp?ŒhŽOÅEHöÿU!KxLxMxNxOxPxcxdxexfxjxkx~xx€xx‚xƒxx•xÁxÂxÃxÖx×xØxÚxíxîxïxðxòxóxyîáÙÕÙÕÄ·ÙÕÙÕŠ™ÙՕ‘•Õ‘ÙՀsÙÕbUÙÕÙÕjSmhp?ŒhŽOÅEHöÿU!jÓQRJ hŽOÅCJPJUVaJjkhŽOÅhŽOÅEHöÿU!jŽQRJ hŽOÅCJPJUVaJhxu@hp?ŒjihŽOÅhŽOÅEHôÿU!jIQRJ hŽOÅCJPJUVaJjþfhp?ŒhŽOÅEHöÿU!jBQRJ hŽOÅCJPJUVaJhŽOÅjhŽOÅUjÈdhp?ŒhŽOÅEHöÿU!j(QRJ hŽOÅCJPJUVaJ!yyy y yŒyy y¡y¢y£y€y¥yžy¹yºy»yŸy¿yÒyÓyÔyÕyzzzzzzzz-zîáÙÕÑÉÑž«ÉÑÉњÉÑÉÑ|oÉÑÉÑ^QÉÑÉÑjæwhzE"hzE"EHòÿU!jDSJ hzE"CJPJUVaJjàuhzE"hzE"EHöÿU!jSJ hzE"CJPJUVaJj×shp?ŒhzE"EHöÿU!j SJ hzE"CJPJUVaJjÍqhp?ŒhzE"EHöÿU!jþSJ hzE"CJPJUVaJjhzE"UhzE"hŽOÅjhŽOÅUjvohŽOÅhzE"EHôÿU!j‡SJ hzE"CJPJUVaJ-z.z/z0zZz[z\z]zpzqzrzsztzuzˆz‰zŠz‹zo{p{q{z{{{|{}{Š{Ÿ{¿{À{Ã{Ñ{Õ{á{îáÙÕÑÕÙÕÀ³ÙÕÙÕ¢•ÙՑ…€{wsÕokw`U`hžÚhxláCJ$aJ$hžÚhªX[CJ$aJ$hxláhI[h0{Çh²) h²)>* hmA@>*hzE"hzE">*hžÚhkUjà~hzE"hzE"EHòÿU!jûSJ hzE"CJPJUVaJjŒ|hzE"hzE"EHòÿU!jêSJ hzE"CJPJUVaJh£R‚hzE"jhzE"Uj>zhzE"hzE"EHòÿU!j“SJ hzE"CJPJUVaJ á{ö{÷{ø{||†|Ž|¥|º|»|Ÿ|Ã|}n}o}~~~r~Œ~~Ž~–~—~˜~«~¬~­~®~LMTjkopwxÈÉËåæõíâÞÚÞÐÞÌÈÌÈÞÌÚÌÞÄÌÀÌÀÌÚžÀ§šžÀÚÀ–Ú–ÚÀÀȄp„'h69Ih69I5B*OJQJ\^Jphÿh69Ih69IB*ph hªX[hxláhmA@jh69Ih69IEHúÿU!j}+TJ h69ICJPJUVaJjh69IUh69IhžÚh²)hxláhªX[hªX[6]h£R‚hªX[hžÚhžÚCJ$aJ$hSíCJ$aJ$hžÚh69ICJ$aJ$+æçèôõ“€”€–€œ€Ÿ€³€µ€¶€Ð€Ò€Ó€è€ê€ë€ì€#$%&'îãßÛß×̞̞̰žÌ°žÌ°Ÿž”ƒo”Ì`Th£R‚B*mHphsHhdN°hdN°B*mHphsH'h7,th7,t5B*OJQJ\^Jphÿ!h7,t5B*OJQJ\^Jphÿh7,th7,tB*ph!h£R‚5B*OJQJ\^Jphÿh£R‚B*ph'hdN°hdN°5B*OJQJ\^JphÿhdN°hdN°B*phh²)h£R‚h69Ih69Ih69IB*ph"jƒh69Ih69IB*EHùÿUph€Ž€Ñ€é€$%BHdj{‘Šš„„I„U„V„p„r„s„Ÿ„ý„þ„öööñööööööööñææÛÖÖöööææÑgd²)gdžÚ $dða$gd²) $dða$gdl+Pgdl+P 7$8$H$gdl+P'(ADGHJcfiluz{ƒ„…ˆ‰‹Œ‘€êÒÃÒÞ€ž€ž€“‚“q“`“`q“`qUKh£R‚B*EHÕÿphhdN°h7,tB*ph!hžQØ5B*OJQJ\^Jphÿ!h7,t5B*OJQJ\^Jphÿ!hdN°5B*OJQJ\^Jphÿ!h£R‚5B*OJQJ\^Jphÿ'hdN°hdN°5B*OJQJ\^JphÿhdN°hdN°B*phhdN°hdN°B*mHphsH/hdN°hdN°5B*OJQJ\^JmHphÿsH)h£R‚5B*OJQJ\^JmHphÿsH€¥Š§šó‚/ƒ0ƒ”ƒ•ƒéƒ„„U„V„X„o„p„q„r„s„¶„·„œ„Ÿ„ü„ý„þ„…îãßØÔÐÔÐÔÌÔÈÄÈÀµ¡µ…zÈvÈßvßo`hM:hM:B*mH phsH  h²)h²)hM:hJªh²)B*phhJªB*EHùÿph"jL‡hJªhJªB*EHùÿUph'hJªhJª5B*OJQJ\^JphÿhJªhJªB*phh²)hžÚhJªh£R‚hmA@h7,t h69Ih69Ih69IhdN°hdN°B*ph"j7…hdN°hdN°B*EHÕÿUph………9…<…W…Z…u…v…x…Œ……’…¢…¥…š…©…¬…À…Á…Ä…Å…Õ…Ø…Û…Ü…Ý…ß…ó…ô…÷…ø…† †††%†&†)†*†:†=†@†D†K†L†P†e†g†h†~†€†‚†—†™†›†±†Ž†M‡P‡S‡çØçØçØçØ͹ͱ¹Í¹ Í¹Í±˜¹Í¹Í˜Í¹Í±˜¹Í¹Í¹Í±˜¹Í¹Í¹ Í¹Í±¹Í±¹Í±¹Í¹Í¹hM:B*ph!hM:5B*OJQJ\^Jphÿh£R‚B*ph'hM:hM:5B*OJQJ\^JphÿhM:hM:B*phhM:hM:B*mH phsH /hM:hM:5B*OJQJ\^JmH phÿsH <þ„…:…X…v……£…©…ª…Á…Ö…Ü…Ý…ô… ††&†;†A†B†M†N†f††˜†²†N‡T‡Z‡öööööööööööööööööööööööööööö 7$8$H$gdl+PS‡V‡Y‡\‡_‡b‡e‡h‡„‡…‡‡‡‡’‡•‡–‡À‡Á‡Â‡Ã‡Ä‡Å‡Æ‡Ç‡È‡É‡Ê‡Ë‡ôàôàôàôàôØàôàÇ¿Ž¢¿¿~¿lôZPh B*EHùÿph"jzhM:hM:B*EHùÿUph"jҎhM:hM:B*EHùÿUph"j)hM:hM:B*EHùÿUph"j€‹hM:hM:B*EHùÿUph"jډhM:hM:B*EHùÿUphhM:h²)B*phh B*ph!hM:5B*OJQJ\^Jphÿh£R‚B*ph'hM:hM:5B*OJQJ\^JphÿhM:hM:B*phZ‡`‡f‡…‡‡–‡Á‡É‡Ø‡à‡á‡ÙˆÚˆ8‰9‰B‰`‰€‰†‰’‰”‰•‰–‰î‰ï‰Š Š-Šöööööíööööèèèèööööööèèèèööögdl+P 7$8$H$gd²) 7$8$H$gdl+Pˇ͇̇·χЇч҇ӇԇՇևׇ؇هڇۇ܇݇îäÒäÀ®Š”ä‚äpeSäAä/"j¡hM:hM:B*EHùÿUph"jiŸhM:hM:B*EHùÿUph"jÁhM:hM:B*EHùÿUphhM:hM:B*ph"jœhM:hM:B*EHùÿUph"jpšhM:hM:B*EHùÿUph"jǘhM:hM:B*EHùÿUphh B*ph"j—hM:hM:B*EHùÿUph"ju•hM:hM:B*EHùÿUph"j̓hM:hM:B*EHùÿUphh B*EHùÿph"j#’hM:hM:B*EHùÿUph݇އ߇à‡á‡ê‡ë‡ˆˆ(ˆ)ˆ.ˆ/ˆØˆÙˆ7‰8‰9‰;‰A‰D‰_‰a‰b‰‰‚‰…‰ˆ‰‘‰’‰“‰”‰•‰–‰í‰î‰ï‰õãÙÎÆÁœ¹œµœµœ®œªŠ›‡›‡›‡›‡›‡›m›œfb^Šh€,,hQ hÎ3 h "ja€hQhQB*EHÃÿUphh£R‚B*ph'hQhQ5B*OJQJ\^JphÿhQhQB*phh²)hÎ3 hM:hM:hT*h h >*hM:hžÚB*phhM:B*EHùÿph"j»¢hM:hM:B*EHùÿUphh B*EHùÿph$ï‰ñ‰ŠŠŠ Š+Š,Š-Š.Š/Š0Š>ŠIŠJŠ`ŠaŠoŠuŠŠ€Š™Š‹‘‹“‹˜‹›‹œ‹Ÿ‹¿‹À‹Á‹ß‹à‹ð‹ñ‹ú‹ŒŒ~ŒÊŒËŒÍŒôàôÎôàœô«¡–’àœ‹œ‹œàœ‹’‡ôàôàôu¡–’q’q’m’m’‡ôhT*hžÚhXoB*EHùÿphh^UìB*EHùÿphhQB*EHùÿph"j0­hQhQB*EHùÿUph"j¥«hQhQB*EHñÿUphhQhQB*ph!hQ5B*OJQJ\^Jphÿ'hQhQ5B*OJQJ\^Jphÿñò$”%”C”D”Ž”è”锕•,–-–(—)—C—D—¿™À™Zš[šìšíš››  ÷òíííííííííííí÷èèèíííßíííí„Ð`„Ðgdl+PgdžÚgdl+PgdT*hB_ôjʹhXoh`%oEHüÿU!j%—TJ h`%oCJPJUVaJ hT*h`%oh`%o>*hžÚhXohT*höZPhöZP>*höZPh08] h¶]{>*h’pšh’pš>*hžÚhðh’pšh£R‚hB_ô h‡ahLrîhžÚCJ$aJ$hXoCJ$aJ$hžÚhXoCJ$aJ$ hXo5\ hB_ô>*hfhf>*hÚ%®hfh'S0K›L›M›N›c›d›g››››™›š›œœ-œ.œ/œ0œžœ  DdžŸ Wž¯ž°ž±žìžíž(Ÿ)Ÿ<Ÿ=Ÿ>ŸîáÙÕÑÍÑÕÉÍÅÕÙÕîžÙÕŽ°š£ŽŸŽ›ŸŽŸŠŸ°Š›Š‚ŠqdjÆh0{ÇhJ EHöÿU!já'WJ hJ CJPJUVaJjh0{ÇUh0{ÇjkÄh«yŠhAÜEHÕÿUh£R‚hAÜ h¯j >*hAÜhŸcà>*hžÚhŸcàjdÂhë&höZPEHüÿUh¶]{h]£h¯j hö|«höZPjhöZPUj]Àhë&höZPEHüÿU!jŽ6PJ höZPCJPJUVaJ' Ÿ¡°ž±žè ¡¡Q¡o¡p¡±¡²¡³¡_£;¥<¥fªgª»ª5«£¬€¬­ôôïïêåååÜÜÜÜ×êÒÒÍïïïïïïgd‚LgdžÚgdö|«„Ð`„Ðgdl+Pgdä/Ègd¯j gdl+P $dða$gdl+P>Ÿ?ŸnŸoŸ‚ŸƒŸ„Ÿ…ŸàŸáŸ  ' ( ) < = > ? | }  ‘ ’ “ ² ³ å ç è ¡$¡%¡8¡9¡:¡;¡O¡P¡÷ó÷óâÕ÷óÑÍÑÍÑÅÍŽ§ÅÍÅÍŽšÅÍÑÍіђŠ†uhŠÑdhA”jÐhë&hä/ÈEHüÿU!juLWJ hä/ÈCJPJUVaJhä/Èjhä/ÈUh‚LhAÜj˜ÍhPzæhJ EHäÿUj-ËhPzæhJ EHäÿU!j8tOJ hJ CJPJUVaJjhJ UhJ h£R‚j&Éhë&h0{ÇEHüÿU!jŽ6PJ h0{ÇCJPJUVaJh0{Çjh0{ÇU&P¡Q¡R¡S¡j¡k¡l¡m¡n¡p¡°¡±¡²¡³¡ê¡ë¡¢¢¢¢¢¢=¢ƒ¢„¢£££1£2£3£4£^£¯£°£€€€&€ùõíéíÛÓíÏËÏÇÃÇ¿Ç·ÇŠ™·Çÿÿ‘Às‘ÃÏ¿okckjhÂÂUhÂÂhz<j¡ÔhPzæhö|«EHäÿU!j8tOJ hö|«CJPJUVaJjhö|«UjšÒhë&h?&EHüÿU!jŽ6PJ h?&CJPJUVaJjh?&Uh£R‚hö|«h?&ha5«hœQcj Òhä/ÈUjhUœUmHnHuhUœjhUœUh—wõ höZPhA”&&€'€(€)€E€F€{€œ€Ÿ€;¥<¥\¥|¥Ä¥Å¥ÿ¥ŠŠŠŠŠŠŠŠ-Š.Š/Š0Š2Š3ŠnŠoŠzŠ{ŠŽŠŠŠ‘ŠîáÙÕÑÕÍÕÍÉÍÅÍÑÍÙÍŽ§ÙÅÍÙ͖‰ÙÍÍÑÍÙÍnaÙj±Ýh0{ÇhÂÂEHöÿU!j.WJ hÂÂCJPJUVaJjh‚L0JUj_ÛhÂÂhÂÂEHèÿU!j'.WJ hÂÂCJPJUVaJjÙhÂÂhÂÂEHâÿU!jù-WJ hÂÂCJPJUVaJh‚LhžÚhÂÂh£R‚hz<jhÂÂUj ×hë&hÂÂEHüÿU!jŽ6PJ hÂÂCJPJUVaJ%‘Š°Š±ŠŽŠµŠÈŠÉŠÊŠËŠÌŠÍŠàŠáŠâŠãŠæŠçŠúŠûŠüŠýŠ§ §§§§§-§Š§ï§ð§ššüøôìôÛÎìôìôœ°ìôìôŸ’ìôìôtìôpôìô_!j8tOJ hÂÂCJPJUVaJh¯j j·æhÂÂhÂÂEHâÿU!jœ.WJ hÂÂCJPJUVaJjpähÂÂhÂÂEHâÿU!j®.WJ hÂÂCJPJUVaJj#âhÂÂhÂÂEHâÿU!j§.WJ hÂÂCJPJUVaJjÖßhÂÂhÂÂEHâÿU!j .WJ hÂÂCJPJUVaJjhÂÂUhÂÂh£R‚hzWè ššš¢š£š¶š·šžš¹šÐšÑšäšåšæšçšéšïš©© ©M©©Ž©¡©¢©£©¥©ž©¹©º©»©Œ©œ©Ð©òêæêæÕÈêæêæ·ªê抢Š¢Š¢š¢‰|š¢k^š¢š¢j®ñhÂÂhzWèEHâÿU!j#0WJ hzWèCJPJUVaJjïhzWèhzWèEHöÿU!j0WJ hzWèCJPJUVaJjhzWèUhzWèh¯j jvíhë&hzWèEHüÿU!j“/WJ hzWèCJPJUVaJjoëhë&hÂÂEHüÿU!jŽ6PJ hÂÂCJPJUVaJhÂÂjhÂÂUjéhPzæhÂÂEHäÿU!Щѩҩө֩שê©ë©ì©í©î©ï© ª ª ªª ª!ª"ªeªfªgªoªpª»ªŒªÏªÐªÑªÓªæªîáÙÕÙÕÄ·Ù³¯³ÕÙ՞‘ÙՍ‰|ÕÙÕk^ÙÕj™úhzWèhzWèEHöÿU!j0WJ hzWèCJPJUVaJ h¯j >*hzWèhzWè>*hžÚhÂÂjøhë&hzWèEHüÿU!j“/WJ hzWèCJPJUVaJh£R‚h¯j jHöhÂÂhzWèEHâÿU!jÉ0WJ hzWèCJPJUVaJhzWèjhzWèUjûóhÂÂhzWèEHâÿU!j§.WJ hzWèCJPJUVaJæªçªèªéªêªëªþªÿª««««««««««0«1«2«3« ¬‰¬Š¬¬ž¬Ÿ¬ ¬¢¬€¬îáÙÕÙÕÄ·ÙÕÙÕŠ™ÙÕÙՈ{ÙÕwow^QowÕjÓhPzæh]£EHäÿU!j8tOJ h]£CJPJUVaJjh]£Uh]£jªhë&hzWèEHüÿU!j<1WJ hzWèCJPJUVaJjbhÂÂhzWèEHâÿU!jÉ0WJ hzWèCJPJUVaJjÿhÂÂhzWèEHâÿU!j§.WJ hzWèCJPJUVaJhzWèjhzWèUjÈühÂÂhzWèEHâÿU!j#0WJ hzWèCJPJUVaJ€¬­¬®¬­­"­#­1­:­>­J­S­]­ ®®3®E®Q®Û®ô®õ®÷®¯¯>¯Š¯‹¯¯¯‘¯’¯Ÿ¯¿¯À¯Á¯É¯Ê¯Ë¯Ø¯æ¯ë¯ì¯í¯p°÷òîê÷òêîêîêîêæêâêâêÞêâêâêÞÚÖêÒÇ¿Ž©ž–ˆ©€©x€q h¯j hºulh^BƒCJ aJ hºulCJ aJ hºulhºul5CJ \aJ hoýCJ aJ hºulhºulCJ aJ hºulh^BƒCJ aJ hžÚhžÚCJ$aJ$h@LŽCJ$aJ$hžÚh@LŽCJ$aJ$h^Uìhšph„/âh£R‚h¯j hEyûhÜçhzWè h¯j >*hzWèhzWè>*+­­]­^­¯‘¯’¯¿¯À¯ì¯í¯Æ°Ç°©²ª²”³•³é³ê³*Ž+ŽŒµµŸµ¿µ"¹#¹úúñúúúééúúúúúúúúúúúúäúúúúúgd„/â$a$gdžÚ„Ð`„Ðgdl+Pgdl+Pp°~°€°°š°©°Æ°Ç°™±š±Ö±×±•³Ÿ³ê³ô³õ³©ŽªŽ(µ)µŠµ‹µŒµµŸµ¿µÖµ|¶}¶¶‘¶’¶“¶ª¶«¶Û¶Ü¶ï¶ð¶ñ¶ò¶··,·öïèïèïèïäïäïÜïÔäïäïèïäïÌÁœ¹µ­µœ­µäµ­µ~q­µ­µjE h§%h§%EHôÿU!j,XJ h§%CJPJUVaJj>h§%h§%EHòÿU!jñŽXJ h§%CJPJUVaJjh§%Uh§%hoýhºulhoýhoýCJ aJ hoýCJaJh¯j h¯j >*h¯j hºul>*h£R‚ h¯j h„/â h¯j hºulh¯j hºul6],,·-·.·/·0·Q·R·o·p·ƒ·„·…·†·Ÿ· ·³·Ž·µ·¶·Ä·Å·Ø·Ù·Ú·Û·|ž€ž×žØžëžìžížîž¹¹¹¹îáÙÕÑÕÑÙÑÀ³ÙÑÙÑ¢•ÙÑÙÑÀˆÙфÑÙÑÀwÙÑÙÑf!j=XJ h§%CJPJUVaJjth§%h§%EHòÿUh¯j jmh§%h§%EHòÿUj`h§%h§%EHòÿU!jXJ h§%CJPJUVaJjYh§%h§%EHòÿU!jñŽXJ h§%CJPJUVaJh§%h£R‚jh§%UjO h§%h§%EHôÿU!jRXJ h§%CJPJUVaJ$¹¹¹°¹±¹Ä¹Å¹Æ¹Ç¹×¹Ø¹ñ¹û¹^º`º†º‡ºšº›ºœººÃºÄºÎºÏºÐºðºñº"»-»Z»d»e»Ÿ»©»ª»«»Û»Ü»æ»ç»ú»û»ü»ý»)Œ*ŒòêæêæÕÈêæÄæŒæžæêæÕ«ê枣ğžÄž£ž£Äž£ÄŸžÄž—ž†y—žuhoýj»h§%hêHòÿU!jñŽXJ hêJPJUVaJjhêh*ƒh¯j h¯j >*jŽh§%h§%EHòÿUhê[hê[h§%>*h£R‚j­h§%h§%EHòÿU!jñŽXJ h§%CJPJUVaJh§%jh§%Uj{h§%h§%EHòÿU.#¹ð¹ñ¹Äº!»"»Y»Z»ž»Ÿ»)Œ*Œ Ÿ ŸŸGŸHŸ4Á5Á6Á7Á8Á9Á:Á;Á<Á=Á>Áúúõúúúúúúúðððððððððððððððððgdl+Pgd„/âgd§%*Œ4ŒnŒ¢Œ¯ŒŽŒËŒ§œÎœ Ÿ ŸŸŸŸŸAŸFŸGŸHŸÝŸôŸ(¿)¿<¿=¿>¿?¿v¿w¿¢¿£¿¶¿·¿ž¿¹¿ÁÁÁ&Á,Á3Á÷óïóïóïëïóçÜÑÉÁѹÁïµï­ïœ­ï‹ï­ïzm­ï‹ïiïih„-ýjò hë&h—lËEHüÿU!jr‡YJ h—lËCJPJUVaJh£R‚jÂh—lËh—lËEHöÿU!jˆYJ h—lËCJPJUVaJjh—lËUh0 áh^BƒCJ aJ h—lËCJ aJ h£R‚CJ aJ h—lËh^BƒCJ aJ h—lËh—lËCJ aJ hoýhô1­h—lËhê[h¯j h¯j >*(3Á4Á6Á=Á>ÁHÁIÁJÁRÁSÁÁ†Á‡ÁŠÁÁ“Á”ÁÃÁÌÁÍÁÖÁ×ÁÂÂ6Â7ÂCÂDÂ{§·žÂÃÂ÷ÂùõñêàÖÏÈÁÈ·­ÈÏÈŠŸ•ÏŸŠŸ†•Ÿxqgqc_UhÜçhšp6]hšph&yh‡ah&y6] h‡ah&y h‡ahBÙ h£R‚6]h£R‚h‡ahU_ºmH sH h‡ah ×6] h‡ah × h‡ahR[ h‡ahU_º6]h‡ah’<’6] h‡ahY9â h‡ah’<’ h‡ahU_ºh‡ah’<’5\h‡ah ×5\ h‡ahl+Ph >õhl+P h—lËh—lË!>ÁIÁJÁ“Á”ÁÖÁ×ÁCÂDž¹Â*Ã+ÃåÃæÃÌÄÍÄAůŰűŲųŶŐÆ÷òêòêòêòêòêåÝòêòêÕòòòòòÓ & FgdS*â & Fgd„¡gd¯j  & Fgd—k±gd—k±dàgd2Wz÷ÂøÂùÂ)Ã*Ã+ëÃÒÃÓÃÔÃÙÃÛÃäÃåÃæÃùÃ,Ä>Ä?Ä@ÄAÄJÄKÄLđĒēÄÊÄËÄÍÄáÄâÄ Å'Å(Å)ÅAÅOÅPÅüøüôðéßØøØéØôÑÊùÃøòø§Ã™§§Ã‰ø‰¹Ã‚‰tih£R‚5CJ\aJh‡ah;ln5CJ\aJ h£R‚6] h‡ah£8ùh‡ahU_º0Jj!#h‡ahU_ºUjh‡ahU_ºU h‡ahp h‡ahU_º6] h‡ahU_º h£R‚hU_º h‡ahXD h‡ahÓJh‡ah÷df6] h‡ah÷dfh¯j h÷dfh£R‚hšp&PÅVÅmÅnÅoÅpÅxÅyÅzŮůŰűŲųŎÅòäòÙǵ£”‚peZOD1%jv$hÔ;÷h¬Yû<B*EHùÿUphh£R‚h&JèmH sH h£R‚hÞ;|mH sH h£R‚hHaèmH sH h£R‚ho9ÜmH sH "h‡ah»5CJ\aJmH sH "hS*âhS*â5CJ\aJmH sH h£R‚5CJ\aJmH sH "h‡ahp 5CJ\aJmH sH "h‡ah2Wz5CJ\aJmH sH "h‡ah€55CJ\aJmH sH h‡aho9ÜCJaJh‡aho9Ü5CJ\aJh‡ah€55CJ\aJŽÅµÅ¶Å·ÅÑÅÒÅåÅæÅçÅèÅÆ-ÆAÆIÆeÆwÆxÆyƌƍƎƏƐƑƒƔƕƗƘƚƛƝƞƟƠƊƧƚƪƫƱƲÆóèÞÚÒÚöÒÚ²Ú²Ú®ÚÒڟ’Òڎ†Ž†Ž†Ž†Ž{qkqk{qkq hf0Jjhf0JUhf hÞ;|hfjh¬YûUh¬Yûj™)hÂÂhEyûEHâÿUj%ÏK hEyûUVnHtHhIróhEyûjR'hÂÂh‚LEHâÿUjžÎK h‚LUVnHtHjh‚LUh‚Ljh‚L0JUh£R‚hÞ;|mH sH jä%hÔ;÷h¬Yû<U)Æ‘ƓƔƖƗƙƚƜƝƞƟƚƩƪƶƷƞƹƌƜƟÆÁÆÈÆýýýýýýýýýõýéçýéçýýÞÙýÍÍ $7$8$H$a$gdLrîgdLrî 7$8$H$gdLrî „üÿ„&`#$gd:H¹$a$gdÞ;|²ÆŽÆµÆ¶ÆžÆ¹ÆºÆ»ÆŒÆœÆŸÆÁÆÇÆÈÆÎÆÐÆÑÆÒÆÖÆ×ÆÚÆÛÆÞÆàÆâÆäÆçÆèÆéÆêÆíÆðÆòÆóÆôÆõÆöÆ÷ÆûÆüÆýÆÇÇôêäàܘ˶àËšœš—š—šœšœËà…—š—¶à—œšËœË~àvkàvkh•ihfCJaJhfCJaJ h°.1hf#h£R‚B*CJ$OJQJ^JaJ$ph!h°.1hfB*OJQJ^Jphh£R‚B*OJQJ^Jph hCrÏhfhfB*OJQJ^Jph!hCrÏhfB*OJQJ^Jphh¬Yûhf hf0Jjhf0JUhS*â0JmHnHu*ÈÆÒÆ×ÆÞÆßÆàÆèÆéÆêÆíÆîÆïÆðÆõÆöÆ÷ÆüÆýÆÇÇ Ç Ç Ç ÇÇóêêåãÖåãêêêêêóãÑãÑãÑãÑãÑgdkFc „Ð7$8$H$^„ÐgdLrîgdLrî 7$8$H$gdLrî $7$8$H$a$gdLrîÇÇÇ Ç Ç Ç Ç ÇÇÇÇÇÇǗǛǠǥǚǎǷǞǹǻnjÇÀÇÅÇÈÇÌÇüôéüôéüôéü×Åü²ŸŸ~nXŸ~JŸ~hfCJOJQJ^JaJ+h}t!hf5B*CJOJ\^JaJphhfB*CJOJ^JaJph hJm—hfCJOJQJ^JaJh£R‚B*CJOJ^JaJph%hyAhfB*CJOJ^JaJph%hf6<CJ\]aJmHnHu#hfB*CJ$OJQJ^JaJ$ph#hfB*CJOJQJ^JaJphh•ihfCJaJhfCJaJhfÇÇÇÇÑÇÒÇÛÇÜÇäÇåÇîÇöÇ÷ÇÿÇÈÈ È È ÈÈÈÈÈÈÈÈÈÈýôýôýôýôýôôýôýôýïýïýïïýïýïýgdkFc 7$8$H$gdLrîÌÇÑÇÒÇÛÇÜÇäÇåÇöÇ÷ÇÿÇÈÈ È È È ÈÈÈÈÈÈÈÈÈÈÈÈÈ#È$È%È&È'È(È)È+È,È-È.È/È0È1È2È6È7È8ÈìèìèìèìèìèìèàÕèàÕèàÕèàÕèàÕèÑÍÇŸÍǟͺŽ«º¥œ˜”…h£R‚hÞ;|mH sH h:H¹hTGäh—wõhA”h—wõCJ h—wõCJhA”hä/ÈCJ hä/ÈCJhUœhA”hUœCJ hUœCJhÂÂhœQch•ihfCJaJhfCJaJhf%hyAhfB*CJOJ^JaJph-ÈÈÈ È!È"È#È$È&È'È)È*È+È,È.È/È1È2È3È4È5È6È7È8Èýýýýýýýøýøýýýøýøýýýýýýógd—k±gda5«21h:p&Jè°Ð/ °à=!°"°ì#ì$ì%°°Ð°Ð ÐËDÐÉêyùºÎŒ‚ªK© aydinn@kenyon.eduàÉêyùºÎŒ‚ªK© 2mailto:aydinn@kenyon.eduDd àÊðD² ð 3 ð@@ÿÿðÿ"ñ?ð€-Dd phèèðb² ð c ð$€€A?¿ ÿ?3"ñ¿`¿€?ð€2ðw쟒*CÓ"‡_ÞŽŠ¹ßÏÿSŸR`!ðK쟒*CÓ"‡_ÞŽŠ¹ßÏò€@€†ø|þxÚcdàd``þÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu 1ÀÂâ6Ff° ÕbW’LDd ðhèèðb² ð# c ð$€€A?¿ ÿ?3"ñ¿`¿€?ð€2ð–yI,yâuV!£$'4 ÇÿrÌ `!ðjyI,yâuV!£$'4 ÇR€ @(ºø|8þxÚcdàd``Ödd``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:&ŠN! KŸAŠá?H1ƒÈZÄ@‹ž ㆪáaðM,É©,He`HÛý›Iá?Ø @–2°01„dæŠ+ø¥–+åç&æ1(¬ü\® Ä _ËÏh§Õ°ÕéUsi#®Œ×9@ZÍ+aüFvß Î×cñMáüÛ, Ÿ œßÁ âÃùŠL Ÿœÿ†Ä7¬„ž·áÌœŒ$¹—‘D€»»Q ìîŠJÿ *¿†•¯Ä‚Ê¿Æ„Šž•ïÃásACŸ Cà`††œ;˜·§ŒLLJÁ•Å%©¹ 5 w3u(2tA4€T}b€…=Ä/Œ Ì`H¡fòXDd hhèèðb² ð$ c ð$€€A?¿ ÿ?3"ñ¿`¿€?ð€2ð¢ªóÌK5Šü«žœðPb0ÿ~ `!ðvªóÌK5Šü«žœðPb0j@ @àâø|DþxÚcdàd``6ed``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:&&.! KŸAŠá?H1ƒÈZâq10<Æ UÃÃà›X’RYÊÀ¶û7“°&€,e`abÉÌM-VðK-WÊÏMÌcPXù¹\ˆ Ÿ–ɧ…±ÕéUsi#®Œ³9AZM*aüÝl Ÿœÿ†Ä7„óÿ1€øŠ•ûþÁìg$É~FýîŽÆG **a|&6TŸ3ŸÂGw( @î®ÌMÊÏa`ž.ϕåðQg8@ÜÁwÇ*vÚp{N± ò™˜@|ÛJ.h¬pcüÐ8``óö€ãšA)ž²ž$5—! d/P‡"CXˆˆù,Ā&Ì`ýÞ2mþZDd hhèèðb² ð% c ð$€€A?¿ ÿ?3"ñ¿`¿€?ð€2ð€?6hÖr š2ÏðBZnÿ€p `!ðx?6hÖr š2ÏðBZnj@ @àâø|FþxÚcdàd``6ed``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:&&.! KŸAŠá?H1ƒÈZâq10<Æ UÃÃà›X’RYÊÀ¶û7“°&€,e`abÉÌM-VðK-WÊÏMÌcPXù¹\ˆ Ÿ–¯µJ³gªÓªæÒF\'r‚ŽšTÂø;Ù@|c8ÿ3ˆoç3‚ýgV ±¿áÌ~F’ìgdÑàîh`ŒÁ2¡¢ÆggCå1£ò} |tw€¢äŽàÊÜ€ü†ûÆ\~ > á ˆ;áîXÈ2BnÏT>ˆo[ɍ.ṕƒ' ì`Þp\321)W—€æ2؃ìeêPdèk{> 1 ‡ 3X?Šn§ZDd hèèðb² ð& c ð$€€A?¿ ÿ?3"ñ¿`¿€?ð€2ð€]D0Þ{ýN Þt‹‰hÿ€Ê  `!ðx]D0Þ{ýN Þt‹‰hj€ @žFø|FþxÚcdàd``6ed``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:&Š.! KŸAŠá?H1ƒÈZÄ\ π†qCÕð0ø&–d„T€20$€íþÍ€ðì† KX˜B2sS‹üRË‚òsóV~.×bƒ¯åÛLÓbX€êtª9€Ž×ƃœ ­&•0þ 6ßÎçgñà|F°ÿÌ+!ö7üƒÙÏH’ýŒ úÜ Œ`wTTÂøflšü0fTŸ„îP€Ü\™›”ŸÃÀ0I—+tÁG!œáq#ÜØAFhÃíùǂÊçañm+¹ ±ÂŽ9pðCãD€ÌÛŽkF&&¥àÊâ’Ô\†œ @Š ]` bÏg!ô0aëÄÒnÀDdÀ!TèèðD² ð 3 ð@@ÿÿðÿ"ñ?ð€Dd àqðD² ð 3 ð@@ÿÿðÿ"ñ?ð€TDd €@èèðb² ð c ð$€€A?¿ ÿ?3"ñ¿`¿€?ð€2ðž ê§!Ë$`LK¶DG/ßMÿzDR`!ðr ê§!Ë$`LK¶DG/ßMd  ðw @þxڝQ1KÃ@þÞ%ÚæZ4f’ê¥: .f²6£ƒ" ŠI²uîäOȪ  þ ¥Šƒ`Œ»€ Y­g’×d`)·ÚY^E ™$Ãù«@Sç˜ ±FÁi¢ç…WnrëmåýÃÆ¿ª<(WÁt¯dŸø‘}: ŒìÇYŽ+ÂnEúÊeWŒ=A®‹œÃSzªË’bÇ(ò7M2œØ‰ç €NrG;ûŸ#Aîï¥ó'î•Â ^ìD~¢Ôí¹öQÞyh  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£€¥Š§š©ª«¬­®¯°±²³Žµ¶·ž¹º»ŒœŸ¿ÀÁÂÃþÿÿÿÅÆÇÈÉÊËýÿÿÿýÿÿÿÏÒþÓÔÖÕ×ØÙÛÚÜÞÝßáàâäãåçæèéêíëìîïðòñóõôöø÷ùûúüÿýdRoot Entryÿÿÿÿÿÿÿÿ' ÀFà(;Û±PÈÑWData ÿÿÿÿÿÿÿÿÿÿÿÿÄ@,WordDocument&ÿÿÿÿÿÿÿÿ4†ObjectPool)ÿÿÿÿT0 Û±PÈà(;Û±PÈ_1238931062ÿÿÿÿÿÿÿÿÎÀF0 Û±PÈ ê Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿCompObjÿÿÿÿfObjInfoÿÿÿÿÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ!þÿÿÿþÿÿÿ$þÿÿÿþÿÿÿ'þÿÿÿþÿÿÿþÿÿÿþÿÿÿ,þÿÿÿþÿÿÿ/þÿÿÿþÿÿÿ2þÿÿÿþÿÿÿþÿÿÿþÿÿÿ7þÿÿÿþÿÿÿþÿÿÿþÿÿÿ<þÿÿÿþÿÿÿ?þÿÿÿþÿÿÿBþÿÿÿþÿÿÿþÿÿÿþÿÿÿGþÿÿÿþÿÿÿþÿÿÿþÿÿÿLþÿÿÿþÿÿÿþÿÿÿþÿÿÿQþÿÿÿþÿÿÿTþÿÿÿþÿÿÿWþÿÿÿþÿÿÿþÿÿÿþÿÿÿ\þÿÿÿþÿÿÿþÿÿÿþÿÿÿaþÿÿÿþÿÿÿþÿÿÿþÿÿÿfþÿÿÿþÿÿÿþÿÿÿþÿÿÿkþÿÿÿþÿÿÿþÿÿÿþÿÿÿpþÿÿÿþÿÿÿsþÿÿÿþÿÿÿvþÿÿÿþÿÿÿþÿÿÿþÿÿÿ{þÿÿÿþÿÿÿþÿÿÿþÿÿÿ€þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²q§ÂP4Ú ƒx ˆ1 ƒx ˆ2 ƒx ˆ3 ƒx ˆ4þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS EqEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿl_1238931192 ÎÀF ê Û±PÈ ê Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿCompObj ÿÿÿÿfuation Equation.3ô9²q§Â†øË4Ú ƒx ˆ1 ƒx ˆ2 ƒx ˆ3 ƒx ˆ4 ƒx ˆ5 ƒx ˆ6 ƒx ˆ7þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qObjInfoÿÿÿÿ ÿÿÿÿ Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ ¢_1238931303ÿÿÿÿÿÿÿÿÎÀF ê Û±PÈ ê Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿ CompObjÿÿÿÿfObjInfoÿÿÿÿÿÿÿÿEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿx_1238931352 ÎÀF ê Û±PÈ ê Û±PȧÂ\h%4Ú ƒx ˆ5 †=ƒx ˆ1 †+ƒx ˆ2 †+ƒx ˆ4þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²q§Â\àÔ1 ƒx ˆ6 †=ƒxOle ÿÿÿÿÿÿÿÿÿÿÿÿCompObjÿÿÿÿfObjInfoÿÿÿÿÿÿÿÿEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿx ˆ1 †+ƒx ˆ3 †+ƒx ˆ4þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²q§Â\øì|" ƒx ˆ7 †=ƒx ˆ2 †+ƒx ˆ3 †+ƒx ˆ4_1238931383ÿÿÿÿÿÿÿÿÎÀF ê Û±PÈ ê Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿCompObjÿÿÿÿfObjInfoÿÿÿÿÿÿÿÿEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿx_1246718644"ÎÀF ê Û±PÈ ê Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿCompObj ÿÿÿÿ fþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qÝÂ;X÷<_ ƒF ƒn †=ƒFƒxƒFƒx‹ï"ƒxƒFþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qObjInfoÿÿÿÿ!ÿÿÿÿ"Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ#W_1246718862ÿÿÿÿÿÿÿÿ$ÎÀF ê Û±PÈ ê Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿ%CompObj#%ÿÿÿÿ&fObjInfoÿÿÿÿ&ÿÿÿÿ(Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ)6_1246719175;)ÎÀF ê Û±PÈ ê Û±PÈÝÂÐlÒ ƒF ƒnþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qÝÂ;ˆÄlÒ ƒZ ˆ3 †=‚{ˆ0‚,ˆ1‚,ˆ2‚}Ole ÿÿÿÿÿÿÿÿÿÿÿÿ*CompObj(*ÿÿÿÿ+fObjInfoÿÿÿÿ+ÿÿÿÿ-Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ.W_1247480944ÿÿÿÿÿÿÿÿ.ÎÀF ê Û±PÈ ê Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿ0CompObj-/ÿÿÿÿ1fObjInfoÿÿÿÿ0ÿÿÿÿ3þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁ`ÄdŸ ƒB ˆ4þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿ46_1246720825ÿÿÿÿ63ÎÀF ê Û±PÈ ê Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿ5CompObj24ÿÿÿÿ6fObjInfoÿÿÿÿ5ÿÿÿÿ8Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ9)_1246721080ÿÿÿÿÿÿÿÿ8ÎÀF‡*Û±Pȇ*Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿ:Ý HÈlÒ †`"þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qÝÂ1ÌlÒ ƒd†"ˆ1ˆ2–[–]CompObj79ÿÿÿÿ;fObjInfoÿÿÿÿ:ÿÿÿÿ=Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ>M_12467697341J=ÎÀF ê Û±PÈ ê Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿ@CompObj<>ÿÿÿÿAfObjInfoÿÿÿÿ?ÿÿÿÿCEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿD)þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qÝ ÌlÒ †e"þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²q_1246769856ÿÿÿÿEBÎÀF ê Û±PÈ ê Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿECompObjACÿÿÿÿFfObjInfoÿÿÿÿDÿÿÿÿHÝ HÈlÒ †d"þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²q݈ÄlÒ ƒB ƒnEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿI)_1246770830ÿÿÿÿÿÿÿÿGÎÀF‡*Û±Pȇ*Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿJCompObjFHÿÿÿÿKfObjInfoÿÿÿÿIÿÿÿÿMEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿN6_1246799098@OLÎÀF ê Û±PÈ ê Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿOCompObjKMÿÿÿÿPfObjInfoÿÿÿÿNÿÿÿÿREquation Native ÿÿÿÿÿÿÿÿÿÿÿÿSC_1246815337ÿÿÿÿÿÿÿÿQÎÀF ê Û±PÈ [#Û±PÈþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qÝÂ'XlÒ ˆ2 ˆ4 †=ˆ1ˆ6þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qOle ÿÿÿÿÿÿÿÿÿÿÿÿUCompObjPRÿÿÿÿVfObjInfoÿÿÿÿSÿÿÿÿXEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿY6݈ÄlÒ ƒB ƒkþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²q݈ÄlÒ ƒB ƒk_1246816260'ŸVÎÀF [#Û±PÈ [#Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿZCompObjUWÿÿÿÿ[fObjInfoÿÿÿÿXÿÿÿÿ]Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ^6_1246908601ÿÿÿÿÿÿÿÿ[ÎÀF [#Û±PÈ [#Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿ_CompObjZ\ÿÿÿÿ`fþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²q݈ÄlÒ ƒh ˆ1þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qObjInfoÿÿÿÿ]ÿÿÿÿbEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿc6_1246908624Yh`ÎÀF [#Û±PÈ [#Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿdCompObj_aÿÿÿÿefObjInfoÿÿÿÿbÿÿÿÿgEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿh6_1246908681ÿÿÿÿÿÿÿÿeÎÀF [#Û±PÈ [#Û±PÈÝÂx1< ƒh ˆ2þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qÝÂù€œ ƒh ƒnþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS EqOle ÿÿÿÿÿÿÿÿÿÿÿÿiCompObjdfÿÿÿÿjfObjInfoÿÿÿÿgÿÿÿÿlEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿm6_1246908712cmjÎÀF [#Û±PÈ [#Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿnCompObjikÿÿÿÿofObjInfoÿÿÿÿlÿÿÿÿquation Equation.3ô9²qÝÂ&@ÂlÒ ƒv†=‚(ƒv ˆ1þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿrB_1246908738ÿÿÿÿÿÿÿÿoÎÀF [#Û±PÈ [#Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿtCompObjnpÿÿÿÿufObjInfoÿÿÿÿqÿÿÿÿwEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿx6_1246908745^‹tÎÀF [#Û±PÈ [#Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿyÝÂð< ƒv ˆ2þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qÝ€|Ôh ƒv ƒnþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS EqCompObjsuÿÿÿÿzfObjInfoÿÿÿÿvÿÿÿÿ|Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ}6_1246908814ÿÿÿÿÿÿÿÿyÎÀF [#Û±PÈ [#Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿ~CompObjxzÿÿÿÿfObjInfoÿÿÿÿ{ÿÿÿÿEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿ‚Qþÿÿÿþÿÿÿƒþÿÿÿþÿÿÿ†þÿÿÿþÿÿÿ‰þÿÿÿþÿÿÿŒþÿÿÿþÿÿÿþÿÿÿþÿÿÿ’þÿÿÿþÿÿÿþÿÿÿþÿÿÿ—þÿÿÿþÿÿÿþÿÿÿþÿÿÿœþÿÿÿþÿÿÿþÿÿÿþÿÿÿ¡þÿÿÿþÿÿÿ€þÿÿÿþÿÿÿ§þÿÿÿþÿÿÿªþÿÿÿþÿÿÿ­þÿÿÿþÿÿÿ°þÿÿÿþÿÿÿ³þÿÿÿþÿÿÿ¶þÿÿÿþÿÿÿ¹þÿÿÿþÿÿÿŒœþÿÿÿþÿÿÿÀþÿÿÿþÿÿÿþÿÿÿþÿÿÿÅþÿÿÿþÿÿÿÈÉþÿÿÿþÿÿÿÌþÿÿÿþÿÿÿþÿÿÿþÿÿÿÑþÿÿÿþÿÿÿÔþÿÿÿþÿÿÿ×þÿÿÿþÿÿÿÚþÿÿÿþÿÿÿÝþÿÿÿþÿÿÿàþÿÿÿþÿÿÿãþÿÿÿþÿÿÿæþÿÿÿþÿÿÿéþÿÿÿþÿÿÿìþÿÿÿþÿÿÿïþÿÿÿþÿÿÿòþÿÿÿþÿÿÿõþÿÿÿþÿÿÿøþÿÿÿþÿÿÿûþÿÿÿþÿÿÿþÿÿÿþÿÿÿuation Equation.3ô9²qÝÂ5(5ÄH ƒv ˆ1 ‚*ƒh ˆ1 †+þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qýÿÿÿ     ON !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMkPQRTSUWVXYZ\[]_^`abecfþÿÿÿhgi¬«ýÿÿÿlmnopqrstuvwxyz{|}~€_1246908883w†~ÎÀF [#Û±PÈ [#Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿ„CompObj}ÿÿÿÿ…fObjInfoÿÿÿÿ€ÿÿÿÿ‡Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿˆL_1246955655šƒÎÀF [#Û±PÈ [#Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿŠCompObj‚„ÿÿÿÿ‹fÝÂ0x«lÒ ƒv ˆ2 ‚*ƒh ˆ2þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁ8ž,3 ‹ï"†+ƒv ƒn ‚*ƒh ƒnObjInfoÿÿÿÿ…ÿÿÿÿEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿŽT_1246955518ÿÿÿÿÿÿÿÿˆÎÀF [#Û±PÈ [#Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁ`ÄdŸ ƒi ˆ1þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qCompObj‡‰ÿÿÿÿ‘fObjInfoÿÿÿÿŠÿÿÿÿ“Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ”6_1246955529|ÎÀF [#Û±PÈ [#Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿ•CompObjŒŽÿÿÿÿ–fObjInfoÿÿÿÿÿÿÿÿ˜Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ™6êÁØ$  ƒi ˆ2þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁ0hŒÓ ƒi ƒr_1246955539ÿÿÿÿ•’ÎÀF [#Û±PÈ [#Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿšCompObj‘“ÿÿÿÿ›fObjInfoÿÿÿÿ”ÿÿÿÿEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿž6_1246955588ÿÿÿÿÿÿÿÿ—ÎÀF [#Û±PÈ [#Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿŸCompObj–˜ÿÿÿÿ fþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁQ˜€+ ƒv ƒi ˆ1  ‚*ƒh ƒi ˆ1  †+þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qObjInfoÿÿÿÿ™ÿÿÿÿ¢Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ£m_1246955667ÿÿÿÿÿÿÿÿœÎÀF [#Û±PÈ [#Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿ¥CompObj›ÿÿÿÿŠfObjInfoÿÿÿÿžÿÿÿÿšEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿ©y_1246955754rÌ¡ÎÀF [#Û±PÈ [#Û±PÈêÁ]8FlÅ ‹ï"†+ƒv ƒi ƒr  ‚*ƒh ƒi ƒr  †=ˆ0þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁ-€ÌÐ ƒh ƒi ˆ1 Ole ÿÿÿÿÿÿÿÿÿÿÿÿ«CompObj ¢ÿÿÿÿ¬fObjInfoÿÿÿÿ£ÿÿÿÿ®Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ¯I ‚,þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁ0ø&Ž  ‹ï"‚,ƒh ƒi ƒr _1246955771ÿÿÿÿÿÿÿÿŠÎÀF [#Û±PÈ [#Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿ±CompObj¥§ÿÿÿÿ²fObjInfoÿÿÿÿšÿÿÿÿŽEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿµL_1247030141€®«ÎÀF [#Û±PÈ [#Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿ·CompObjª¬ÿÿÿÿžfþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁg`ÄdŸ ˆ1†Å"ˆ2 ˆ2 †+ˆ1†Å"ˆ2 ˆ1 †+ˆ0†Å"ˆ2 ˆ0 †=ˆ6þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS EqObjInfoÿÿÿÿ­ÿÿÿÿºEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿ»ƒ_1247057701ÿÿÿÿÿÿÿÿ°ÎÀF(Û±Pȇ*Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿŸñï벓\—ÊŽP“Ǖºý$žÞkü¹Zw±Þ”ÆLJÄŒ˜W3#¥ž{™š©ìEM™Ûî'£ÐЕº/¶0Ɉu6³°ØƒŠnþþ~ppDd T,èèðb² ð c ð$€€A?¿ ÿ?3"ñ¿`¿€?ð€2ðQ€P†ŠG0ãNKB=30F }ÿ-˜R`!ð%€P†ŠG0ãNKB=30F }’ àXJèçóþxÚcdàd``>ÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu á ˆ¹Œðð0ea‹a.#Eîm`t`™UɍM.pŒƒƒ— ì`ÞpadbR ®,.IÍeH™ËÔ¡ÈÐÑ1Ÿ…ÐýÀ –8–z  Dd @,èèðb² ð  c ð$€€A?¿ ÿ?3"ñ¿`¿€?ð€2ðTóI":8Ï3º4&ìŠ}ÿ0ùR`!ð(óI":8Ï3º4&ìŠ}’à èçöþxÚcdàd``>ÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu;êvv0o8L™˜”‚+‹KRsX@æ2u(2tA4AÌg!˜Û!v120ƒe XF¹íDd ÜÜèèðb² ð  c ð$€€A?¿ ÿ?3"ñ¿`¿€?ð€2ð7Π¿žBGHÁ5ëkJ“°ÿR`!ð Π¿žBGHÁ5ëkJ“°:`` ! !ÙþxÚ=NÍ AQþfü_Êí®$‹Ë‚,H–ÞÁŠžID!ݝµ•P¶^@) D²R®9ãrjšoÎ|?CH‘=FæÅ€RüCL"â Õ)þ¥ÿŒ {ä‘#šÏ"ÀaË|—îŠÑP*r2h÷–£®?ÈN³_Œyë ؙPŽ2ìŽ?íÏ&@%awîñ±®J¹çz•Ž£B¬ ;)œi¹Ô‚‘ž}+L±ôR×o†„Nœ˜K±LãQ±UQ^Ÿ€ý&›ˆê?Æo5.íDd ÜÜèèðb² ð  c ð$€€A?¿ ÿ?3"ñ¿`¿€?ð €2ð7Π¿žBGHÁ5ëkJ“°ÿðR`!ð Π¿žBGHÁ5ëkJ“°:`` ! !ÙþxÚ=NÍ AQþfü_Êí®$‹Ë‚,H–ÞÁŠžID!ݝµ•P¶^@) D²R®9ãrjšoÎ|?CH‘=FæÅ€RüCL"â Õ)þ¥ÿŒ {ä‘#šÏ"ÀaË|—îŠÑP*r2h÷–£®?ÈN³_Œyë ؙPŽ2ìŽ?íÏ&@%awîñ±®J¹çz•Ž£B¬ ;)œi¹Ô‚‘ž}+L±ôR×o†„Nœ˜K±LãQ±UQ^Ÿ€ý&›ˆê?Æo5.kDd øšèèðb² ð  c ð$€€A?¿ ÿ?3"ñ¿`¿€?ð €2ðµ MƪŸxœÐp-lñÞÅyÿ‘ÝR`!ð‰ MƪŸxœÐp-lñÞÅy†À@`\–WþxڕR»JA=÷ÎúÈ0D Y,VÁ"Aók-L~ ⊂k„Âv©-$Ej±5ø)òvVVbç£P‚ ‰žÎ+[ø(žË9Ã9÷ž™YB ë$?˜‡Zc²R\̀iÎêywîñ±©J¹çŠŸW¢"¬‰:)œiyÔ218ùV˜bé%€[¿6ÊÎz;1—;þj=šfÄQÂN ÆÙ8øfö›üDÔÿY07dôDd Èðèèðb² ð c ð$€€A ?¿ ÿ?3"ñ¿`¿€?ð €2ð>ØID"wŽÃÌÚïUù(ŠÛÿ£!R`!ðØID"wŽÃÌÚïUù(ŠÛ:@€ïØRàþxÚcdàd``žËÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu 1(¬ü\® Ä _Ë7H§U³êUsi#.F5 ‹+¹ ¶p]Â6b‡;˜·ìvF&&¥àÊâ’Ô\y @Š ]` {> 1@ì`Ó€2Ì`ý9‘Dd @,èèðb² ð c ð$€€A ?¿ ÿ?3"ñ¿`¿€?ð€2ðQäÞ8QQy£˜‰«3SP‹ÿ-—#R`!ð%äÞ8QQy£˜‰«3SP‹’à èçóþxÚcdàd``>ÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuçÆæÖdlj×ðas«Vs Ñ՚ÕŸÄŠÖ_›N c÷—¹*ÿ63uE±¹u¥(6µŸÄ±¹5«¹Û¥°Å±46µSe°¹AP›Úb9lnx/‡Mm 67œU`§R€¿Œ{ˆDd }èèð0² ð # ð Aÿð€2ð]ÁeF¥‡#Ë· ëØÿà$:R`!ðØ]ÁeF¥‡#Ë· ëØ(ï@šžŠþxÚcdàd``îb```ba ffä``ÒÜL ‹‡é=£ˆ¥Ç(cbd„²8êþƒõÿfŠù6†a#Ô4¡ÌÜÔb¿Ôr… üÜÄ<…•ŸË5XÁàkùÑ41º@Õ@Z‘•…AÁÊVÁž±•ÝR`!ððZÇfÞËÅåýg·’„³PIäd7 ïX•žŸþxÚcdàd``ÞÄÀÀÀÈ Ã,@ÌÌÈÁÀ €¹™@" Ó{Fs^KQ*ÆÄÈeqÕýëÿÍól ÃFšiB!™¹©Å ~©å Aù¹‰y +?—k±‚Á×òÑŽµ uªÙŽ"+#C4ƒ=cœ äéòÀx:@2o532/„™÷— ™·Œ™çÏã‚l`Dæ]ƒÛ`äÕ³ Ëi°!ó.²#«¬âDæ)s3ƒCS1$³áDd àüèèð0² ð # ð Aÿð€2ð]Rehjˆ >ÓkýŸFÖéþÿ9@R`!ð1Rehjˆ >ÓkýŸFÖéþ 98Ê(O\ ÿþxÚU×Mh\UÀñ÷æå$'™€IŠ™$=M2“iú‘&“LÒŽÕÐ"¡Ô…JэVB µDÚt¡˜… ˆ¢¥íŠêB„‚‹ˆ» ÝTŠÅÅ ÝèFê¢E±(~Œî!óÏ}“{îÌüx$Mړ${®-IÒd( _-ùw–j"ùÏb!ü&<ê,|¯?M¥ƒ›¿+€éæ£öüºÿ6žÿwáÔ¿&ù(Ýük¥ç/œ}­úÌÙåêɋN/%Õk—ÇóïjãåË¯Œv¬çWçC$£’&/%O€õt«^Îkœs«&óºY`-µ°ZY7ÚX‹í¬Rq«a‡”u5cփVÖeí`ýZä‰Nnã‰ÊÆYîw³.÷²ŽlgÝëc]êgܪ™°C7gYëa+ñʞ>®]/³Î ðÊâžhy'O4¿—³t³Ÿa®²:j¬ov±Níæ,óCœå—a®}XáÚÁQ®ý\ãÚûc\kìá‰>ÝÇ-Ìq–¹ý¬Ÿ&XïÕYÓÓ¬» ÖÛ³œeaœ¥œìëI֋S¬¬Áç}5Ãzá÷{«‹õEÓ§îVÓ;öÛ_‰W¡q%›Ïâ벒ý³->o%û±…õf+kLY?Ž³Þ(²*]ñ ùëKø[ɞmãÚ#e}ÞÁ+Ÿîd=ìâ‰zx¢Úgù³—õÙv։2ë÷~Ö'ƒ¬§Œ»×z9çí×^ïc ÷óÊïžvq×wòDïóDÇÇ9ËP…u³ÊZª±ÆX7v³÷r÷ã#œlœÂº:Ê:¶‹Ï{0ƺ²‡WÝÇ]Ûϝ?ÄYžœdݯ³.O³ŽÌ°îͲ.Íq÷ó¬rµ6Å©Ï5X=³¬ëXgr¿ºY«MŸº;MïØ_‡â+áB.ôçB.ôçB.ôçB.ô—¢¿PÑ_#¯GÊ¢?ús¡?ús¡?ús¡?ús¡?ús¡¿|‡^žáv‰ý…ŠþÂóèυþ\èυþ\èυþ\èυþ\èυþ\è/ßa„“­Wžý…Šþ•ôçB.ôçB.ôçB.ôçB.ôçB.ô—ï0ÁŠþœkS\‹þBџ ý¹ÐŸ ý¹¬6}êî4œcôgJŠôgJŠôgJŠôgJŠÑ_#쐱èϔ÷?SÞÿLéϔþLéϔþLéϔþLéϔþLéϔþL£¿0Yôf¡?SÞÿLyÿ3¥?Sú3¥?Sú3¥?Sú3¥?Sú3¥?Sú3þÂ,Ñ_˜…þLyÿ3åýϔþLéϔþLéϔþLéϔþLéϔþLéÏ4ú ³D¡èϔ÷?SÞÿLéϔþLéϔþLW›>uÑ_8íôálã¿Èÿ‚€…bˆDd èèð0² ð  # ð Aÿð€2ðvL<*C‹¬èclzÔÒÂÿàûDR`!ðØvL<*C‹¬èclzÔÒ Üï`u žŠþxÚcdàd``nc```ba ffä``ÒÜL ‹‡é=ãKQ*ÆÄÈeqÕýëÿÍól ÃFšiB!™¹©Å ~©å Aù¹‰y +?—k±‚Á×ònÎŽHº@Õ@Z‘•…AÁÊVÁž1„ݲ ð! # ð Aÿ"ñ¿@@ð€2ð܃’äËŽz Ñ"*=ê›AÿžƒFR`!𰃒äËŽz Ñ"*=ê›A »ïønž~þxÚcdàd``````da ffä``ÒÜL ‹‡é=ãnFKQ*ÆÄÈeqÕýëÿÍól ÃFšiB!™¹©Å ~©å Aù¹‰y +?—k±‚Á×riî4yº@Õì@Z‘•‘Á˜Áž1‹l ÅYŠDd )èèð0² ð" # ð Aÿð €2ð‚Œ+»~wìoÁ8YÿâñGR`!ðڂŒ+»~wìoÁ8YÞ ï0HžšþxÚcdàd``ng```ba ffä``ÒÜL ‹‡é=ã=.KQ*ÆÄÈeqÕýëÿÍól ÃFšiB!™¹©Å ~©å Aù¹‰y +?—k±‚Á×òÁŽ uª9€Ž"+ ƒ‚•­‚=c;ºyŒ$™ÇÈÀ 6“!73¯<53=£€Öž1‹f;X–‘ÁœÁž±—“lšü-a`Dd ûèèð0² ð# # ð Aÿð!€2ðÜ(ùßÇN$À“2b¶ùƒ•¹ÿž{IR`!ð°(ùßÇN$À“2b¶ùƒ•¹ »ïønž~þxÚcdàd``````da ffä``ÒÜL ‹‡é=ãnFKQ*ÆÄÈeqÕýëÿÍól ÃFšiB!™¹©Å ~©å Aù¹‰y +?—k±‚Á×òt‘49º@Õì@Z‘•‘Á˜Áž1‹l ϊ­íDd ÜÜèèðb² ð$ c ð$€€A?¿ ÿ?3"ñ¿`¿€?ð"€2ð7Π¿žBGHÁ5ëkJ“°ÿÛJR`!ð Π¿žBGHÁ5ëkJ“°:`` ! !ÙþxÚ=NÍ AQþfü_Êí®$‹Ë‚,H–ÞÁŠžID!ݝµ•P¶^@) D²R®9ãrjšoÎ|?CH‘=FæÅ€RüCL"â Õ)þ¥ÿŒ {ä‘#šÏ"ÀaË|—îŠÑP*r2h÷–£®?ÈN³_Œyë ؙPŽ2ìŽ?íÏ&@%awîñ±®J¹çz•Ž£B¬ ;)œi¹Ô‚‘ž}+L±ôR×o†„Nœ˜K±LãQ±UQ^Ÿ€ý&›ˆê?Æo5.íDd ÜÜèèðb² ð% c ð$€€A?¿ ÿ?3"ñ¿`¿€?ð#€2ð7Π¿žBGHÁ5ëkJ“°ÿÈLR`!ð Π¿žBGHÁ5ëkJ“°:`` ! !ÙþxÚ=NÍ AQþfü_Êí®$‹Ë‚,H–ÞÁŠžID!ݝµ•P¶^@) D²R®9ãrjšoÎ|?CH‘=FæÅ€RüCL"â Õ)þ¥ÿŒ {ä‘#šÏ"ÀaË|—îŠÑP*r2h÷–£®?ÈN³_Œyë ؙPŽ2ìŽ?íÏ&@%awîñ±®J¹çz•Ž£B¬ ;)œi¹Ô‚‘ž}+L±ôR×o†„Nœ˜K±LãQ±UQ^Ÿ€ý&›ˆê?Æo5.Dd @,èèðb² ð& c ð$€€A ?¿ ÿ?3"ñ¿`¿€?ð$€2ðQäÞ8QQy£˜‰«3SP‹ÿ-µNR`!ð%äÞ8QQy£˜‰«3SP‹’à èçóþxÚcdàd``>ÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu ÑÀ➀W–1ÿkRkR`!ðcuƒã> ÑÀ➀W–1b  pñXJ1þxÚcdàd``6dd``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:&&V! KŸAŠá?H1ƒÈZÄXŽ ㆪáaðM,É©,He`Ûý›©áØ @–2±01Wæ&åç00ü’â ZðQˆAaåçrM V0øZ~@*Íh(ƒ.P56âj`aiÕ®„˜§ðÉ<y!™¹©Å ~©å Aù¹‰y8ÌcdÑàæ>`4caX ã_a€ð±ž›{ ö0ÂÝ? ÞZæ2RäþÆ L 2*a|°ûË*¹ ±ÁŽ1°ó¡q!ÀÀæíÇ1#“RpeqIj.ƒ#È E†.ˆªÏB è~bË/NtÙ#Dd ”Tèèðb² ð5 c ð$€€A"?¿ ÿ?3"ñ¿`¿€?ð3€2ðm H`|®ô®GÙgr®€ÿI—mR`!ðA H`|®ô®GÙgr®€   àdXJþxÚcdàd``fed``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:&&! KŸAŠá?H1ƒÈZĘŽ ㆪáaðM,É©,He`Ûý›Iá?Ø @–2°01„dæŠ+ø¥–+åç&æ1(¬ü\® Ä _ËI¥ífªÓªæÒF\+™AZ*aü· >Äü†ä™ÏÈ¢?Àíi`<- sIt7Ä\Fž¹»˜@&dTÂø&`÷—UrAC ²`çCÃL€ÌÛŽ F&&¥àÊâ’Ô\†Ý {€:ºÀ@ĞÏB è~bë#e‰WDd Lhèèðb² ð6 c ð$€€A#?¿ ÿ?3"ñ¿`¿€?ð4€2ð¡û(Âl'üÛd¶…,•¶šIwÿ}ºoR`!ðuû(Âl'üÛd¶…,•¶šIwºà@ š ø|CþxÚcdàd``Žed``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:&ŠlB@–?ƒÃb ÿµ ˆ°10<Æ UÃÃà›X’RYÊÀ¶û7“°&€meabÉÌM-VðK-WÊÏMÌcPXù¹\ˆ Ÿ–ŸäN³fªÓ*æÒF\õØ@:ó*aüyÌ>Äü†ä™ÏÈ¢?Àíi`Ìg™Q ã?eñË0ìa Ñ{áöT²€ŒÐÂf.ÈÜàÊÜ€ü†tn®{ > íþcàÐÆi®oˆ‚kEIQ"W?ns1Ý+Æ2§’ Ë\à”h 0°ƒy{Ài‡‘‰I)ž²ž$5—Ád.P‡"CXˆØóYˆÝÌ`ýó‰œ Dd ŽTèèðb² ð7 c ð$€€A$?¿ ÿ?3"ñ¿`¿€?ð5€2ðTu_°Æ ÝZ»ÈñäíéúYöÿ0rR`!ð(u_°Æ ÝZ»ÈñäíéúYö’  ÈœXJöþxÚcdàd``>ÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu;êvv0o8L™˜”‚+‹KRs®€ÌeêPdè‚h©ú,Äs;Ä.Ff° ‘€Lë Dd ÜTèèðb² ð8 c ð$€€A%?¿ ÿ?3"ñ¿`¿€?ð6€2ðS•ß)9Ÿ%My(BPžåÿ/tR`!ð'•ß)9Ÿ%My(BPžå’`  !XJõþxÚcdàd``>ÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuXDd „|èèðb² ð: c ð$€€A'?¿ ÿ?3"ñ¿`¿€?ð8€2ð¢’Ñ Tþ–|™ hBŽþ£ÿ~*xR`!ðv’Ñ Tþ–|™ hBŽþ£Ê `ž·0®DþxÚcdàd``Ned``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:ŠŠ¬B@–?ƒÃb ÿµ ˆ€Ê؀깡jx|K2B* R ÀvÿfjøvÐ¥L,L Á•¹Iù9 ßž¹Ü> 1(¬ü\® Ä _ËÅxÒÚX€ uª9€ŽWãVíJˆy ÿ‘Ìc™’™›Z¬à—Z®”Ÿ›˜‡Ã á0Ÿ‘D@²§›d„-ܞcàp҆ړðf#‰þ€ØõG‚iȄ¢Jÿ:3„±GL{Ðýó€1lOf%Œ?ÂG7ÊüÓÀ8ƒdB<ܞ2øe8ãÇ7DÁµ¢€(‘›Ë’”øcáSÉMm\à NVÐŽ&ÀÀæí§aF&&¥àÊâ’Ô\†; s€:º € 泺Ÿ˜Á2õ£P$Dd h|èèðb² ð< c ð$€€A)?¿ ÿ?3"ñ¿`¿€?ð:€2ðn³¬S]ùٕ÷Xž] ŽŸÿJ}R`!ðB³¬S]ùٕ÷Xž] ŽŸB@`ø|0®þxÚcdàd``Vdd``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:Š&&! KŸAŠá?H1ƒÈZâÕ²17T ƒobIFHeA*CØîßL ÿÀN`˜²”…‰A $37µXÁ/µ\!(?71AaåçrM V0øZ~;M–šNššHq50n»W§b^ÂòÌcdÑàæJ0)€Í5„š«7—‘DwBÌe„šû€ñȄÌJtÿ3RäÞF+°¹•\ÐÐæÇ8 a-ÀÀæíÇ!#“RpeqIj.ƒ,È\ E†.ˆªÏB è~`Ë4¢n€?Dd l|èèðb² ð= c ð$€€A*?¿ ÿ?3"ñ¿`¿€?ð;€2ð‰‰ŒJýñË*`" UÎ\+Ñÿe$R`!ð]‰ŒJýñË*`" UÎ\+њà`0®+þxÚcdàd``öed``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:ŠŠÌB@–?ƒÃb ÿµ ˆ030°ÕsCÕð0ø&–d„T€20€íþ͔ðì† `[Y˜B2sS‹üRË‚òsóV~.×bƒ¯åIÜi·Y€êtŠ9€Ž—“3HgQ%Ä<2ÍcdÑàæ>`|Å2!jnÃ?rÝ 1—jn£ØÜ s(roã"°Ët°™Ë2×7DÁµ¢€(‘‡kڂBD»WŒd„O%4¹À1 v.4ØÁŒ=àŽÁÈÄ€\Y\’šËpd.P‡"CXˆØóYˆÝÌ`ý16…EpDd Ô@èèðb² ð> c ð$€€A+?¿ ÿ?3"ñ¿`¿€?ð<€2ðºh»€¶92Z<êŠëÍÃÑÿ–cR`!ðŽCompObj¯±ÿÿÿÿ¿fObjInfoÿÿÿÿ²ÿÿÿÿÁEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿÂ?_1247225825©ÂµÎÀF‡*Û±Pȇ*Û±PÈuation Equation.3ô9²qêÁ#huüÒ ˆ2 ƒr †"ˆ1þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁqX#4¯ ƒS ƒr ‚(ƒu‚)Ole ÿÿÿÿÿÿÿÿÿÿÿÿÃCompObjŽ¶ÿÿÿÿÄfObjInfoÿÿÿÿ·ÿÿÿÿÆEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿǍ†=‚{ƒv†"ƒB ƒn ‚:ƒd‚(ƒu‚,ƒv‚)†d"ƒr‚}þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁp dŸ ƒB ƒn_1247235189ÿÿÿÿùºÎÀF‡*Û±Pȇ*Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿÊCompObj¹»ÿÿÿÿËfObjInfoÿÿÿÿŒÿÿÿÿÍEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿÎ6_1247227385ÿÿÿÿÿÿÿÿ¿ÎÀF‡*Û±Pȇ*Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿÏCompObjŸÀÿÿÿÿÐfþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁ&†4¯ ƒnˆ2–(–)þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qObjInfoÿÿÿÿÁÿÿÿÿÒEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿÓB_1247227431œÇÄÎÀF‡*Û±Pȇ*Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿÕCompObjÃÅÿÿÿÿÖfObjInfoÿÿÿÿÆÿÿÿÿØEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿÙJ_1247227521ÿÿÿÿÿÿÿÿÉÎÀF‡*Û±Pȇ*Û±PÈêÁ.P‹$' ƒn‚(ƒn†"ˆ1‚)ˆ2þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁ'š“4¯ ƒS ƒr ‚(ƒu‚)Ole ÿÿÿÿÿÿÿÿÿÿÿÿÛCompObjÈÊÿÿÿÿÜfObjInfoÿÿÿÿËÿÿÿÿÞEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿßCþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁ&šnÜ! ƒnˆ0–(–)_1247227552³ôÎÎÀF‡*Û±Pȇ*Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿáCompObjÍÏÿÿÿÿâfObjInfoÿÿÿÿÐÿÿÿÿäEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿåB_1247227559ÿÿÿÿÿÿÿÿÓÎÀF‡*Û±Pȇ*Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿçCompObjÒÔÿÿÿÿèfþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁ&˜‹œ ƒnˆ1–(–)þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qObjInfoÿÿÿÿÕÿÿÿÿêEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿëB_1247227566ÑàØÎÀF‡*Û±Pȇ*Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿíCompObj×ÙÿÿÿÿîfObjInfoÿÿÿÿÚÿÿÿÿðEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿñB_1247227581ÿÿÿÿÿÿÿÿÝÎÀF‡*Û±Pȇ*Û±PÈêÁ&ø7,˜ ƒnƒr–(–)þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁ&šnÜ! ƒnˆ0–(–)Ole ÿÿÿÿÿÿÿÿÿÿÿÿóCompObjÜÞÿÿÿÿôfObjInfoÿÿÿÿßÿÿÿÿöEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿ÷Bþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁ†4¯ ˆ2 ƒnþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Eq_1247227795ÛêâÎÀF‡*Û±Pȇ*Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿùCompObjáãÿÿÿÿúfObjInfoÿÿÿÿäÿÿÿÿüEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿý6_1247228033ÖïçÎÀF‡*Û±Pȇ*Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿþCompObjæèÿÿÿÿÿfþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿ%þÿÿÿþÿÿÿ(þÿÿÿþÿÿÿ+þÿÿÿþÿÿÿ.þÿÿÿþÿÿÿ1þÿÿÿþÿÿÿþÿÿÿþÿÿÿ6þÿÿÿþÿÿÿþÿÿÿþÿÿÿ;þÿÿÿþÿÿÿ>þÿÿÿþÿÿÿAþÿÿÿþÿÿÿDþÿÿÿFGHIJKLMþÿÿÿOPQRSTUVWXYþÿÿÿ[þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿuation Equation.3ô9²qêÁò„) ‚|ƒC‚|†Å"‚[þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁ&†4¯ ƒnˆ0–(–)ObjInfoÿÿÿÿéÿÿÿÿEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿ9_1247227939ÿÿÿÿÿÿÿÿìÎÀF‡*Û±Pȇ*Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿCompObjëíÿÿÿÿfObjInfoÿÿÿÿîÿÿÿÿEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿB_1247228105ÿÿÿÿÿÿÿÿñÎÀF‡*Û±Pȇ*Û±PÈþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁ&h’Œò ƒnƒe–(–)Ole ÿÿÿÿÿÿÿÿÿÿÿÿ CompObjðòÿÿÿÿ fObjInfoÿÿÿÿóÿÿÿÿ Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ B‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£€¥Š§š©ª¿­¯®°²±³µŽ¶ž·¹º»œŒŸSTÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔþÿÿÿá×ØÙÚÛÜÝÞßàÕâãäåæçèéêëìíîïñýÿÿÿòóôõö÷øùúûüýþÿh»€¶92Z<êŠëÍÃѺ På \þxÚcdàd``Žed``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:&&>! KŸAŠá?H1ƒÈÚÄx¶ ㆪáaðM,É©,He`0Ûý›©áØ @–2°01„dæŠ+ø¥–+åç&æ1(¬ü\® Ä _ËÃDÓ¢X€êtª9€Ž×F9^V³JŸ Ä7‚ók8@|8/+ªŒ' ˆoç·0¢Ê 0@ä!îUøOž{@ôž»¿0<åBv׆z6dw|aˆg‚žK81ì ®ÌMÊÏê嚺à£Îp‚Ø˯7Ü #láþ+âñ¯Ãù±ì Ÿ6œ¯ÈŠ*ïnj*ÿ‚"ύe.pJ4ŽØÁŒ=àŽÃÈÄ€\Y\’šËr'P‡"CXˆØóYˆ=̘Áú˜xŠšDd ~èèð0² ð? # ð A,ÿð=€2ð$¿ …œÖ:c&÷/?D×é )ÿӃR`!ðø¿ …œÖ:c&÷/?D×é )^8 ïÀ–žÆþxÚcdàd``^ÏÀÀÀÄ Ã,@ÌÌÈÁÀ €¹™@" Ó{F ^KQ*ÆÄÈeqÕýëÿÍól ÃFšiB!™¹©Å ~©å Aù¹‰y +?—k±‚Á×òYÂiâ uª9€Ž"+ ƒ‚•­‚=ã tóI2ä3 yl I™yE©öŒY 0›ØÁ2Œ Ñ öŒüì0^,§ÇãéyË9y\0žw ®ÏÈ«æDæ©p3ƒÝ 7z0áDd & °èèð0² ð@ # ð A-ÿð>€2ð‘KÓ6a»êÛ%šH(³Å†ÿm{…R`!ðeKÓ6a»êÛ%šH(³Å†ŒçØ,h% 3þxÚuœJA€gvoÏÜ©$ ‹³ X(¹ÎBð ,N킠‰â™ÂâÐBÔB®Žõ $>Kš} QK‘àfŽ$;]vŸÝÙýv!Ðû `xx+`hžUŒÂٜºñŸ8[ǥњBeÕý”燪õ]^÷Œ©fê;éa÷à6 7Z!Dœ÷l•"j~d‹G{l\£jª…ƒðOx2¡7ØôœÂ•’”hI OR1Eãè“ ýژ†dpTAR¢%5ÀÀÀÀÈ Ã,@ÌÌÈÁÀ €¹™@" Ó{Æœ| –£TŒ‰‘ÊâªûÖÿ›)æ؆ ŒPӄB2sS‹üRË‚òsóV~.×bƒ¯å$ÓxA6êU³iEVF†h{Æ,8/ÈÛ̋,§Ëˆ,÷ÆÓòŽ2!óòXyâlÈŒìÈŒLNdž7Œg²™7“™çĊÌ{̛͆̳åBæ=ãf‡àr) ©Dd [èèð0² ðC # ð A0ÿðA€2ð% J@N¶‡JR•ÈlàZQéÿċR`!ðù J@N¶‡JR•ÈlàZQ逜ïȹžÇþxÚcdàd``>ÀÀÀÀÈ Ã,@ÌÌÈÁÀ €¹™@" Ó{Æœ| –£TŒ‰‘ÊâªûÖÿ›)æ؆ ŒPӄB2sS‹üRË‚òsóV~.×bƒ¯å;„Óœ@6êU³iEVF†h{Æ,8/ÈÛ̋,§Ëˆ,÷ÆÓòŽ2!óòXyâlÈŒìÈŒLNdž7Œg²™7“Æ3òœX‘å^³!ËMá@æÙr!«|ÆÍ %Ü)H©Dd [èèð0² ðD # ð A1ÿðB€2ð%èDŽRàšg¡ZÚ íqÄ4ÓÿmR`!ðùèDŽRàšg¡ZÚ íqÄ4ӀœïȹžÇþxÚcdàd``>ÀÀÀÀÈ Ã,@ÌÌÈÁÀ €¹™@" Ó{Æœ| –£TŒ‰‘ÊâªûÖÿ›)æ؆ ŒPӄB2sS‹üRË‚òsóV~.×bƒ¯åG%Ó‚lÔªfҊ¬Œ Ñ öŒYp^,·™YN—YäeBæå± óÄِyؑy™œÈC o&3²œ+²Ük6d¹)Èr¶\ÈrÏž™Á¡š)ÙšDd [èèð0² ðE # ð A2ÿðC€2ð$TÉؙ±¢ÿnDX„Ø€TÿR`!ðøTÉؙ±¢ÿnDX„Ø€T€œïȹžÆþxÚcdàd``>ÀÀÀÀÈ Ã,@ÌÌÈÁÀ €¹™@" Ó{Æœ| –£TŒ‰‘ÊâªûÖÿ›)æ؆ ŒPӄB2sS‹üRË‚òsóV~.×bƒ¯å}Biî uªÙŽ"+#C4ƒ=cœ ämæE–ÓeD–ûÀãéyG™yy,ÈÀÀÀÀÈ Ã,@ÌÌÈÁÀ €¹™@" Ó{Æœ| –£TŒ‰‘ÊâªûÖÿ›)æ؆ ŒPӄB2sS‹üRË‚òsóV~.×bƒ¯å$ÓøA6êU³iEVF†h{Æ,8/ÈÛ̋,§Ëˆ,÷ÆÓòŽ2!óòXyâlÈŒìÈŒLNdž7Œg²nŸ7“™çĊ¬ò52o ²J[.dÞ3nfp(ã*)©Dd [èèð0² ðG # ð A4ÿðE€2ð%°Âq-¥Ïdz&GÚœÚÎßåÿg’R`!ðù°Âq-¥Ïdz&GÚœÚÎß倜ïȹžÇþxÚcdàd``>ÀÀÀÀÈ Ã,@ÌÌÈÁÀ €¹™@" Ó{Æœ| –£TŒ‰‘ÊâªûÖÿ›)æ؆ ŒPӄB2sS‹üRË‚òsóV~.×bƒ¯å;„Ó\@6êU³iEVF†h{Æ,8/ÈÛ̋,§Ëˆ,÷ÆÓòŽ2!óòXyâlÈŒìÈŒLNdž7Œg²nŸ!7“YΉ™÷š Yåd9[.d¹gÜÌàPh)I©Dd [èèð0² ðH # ð A5ÿðF€2ð%ŽoVÿ˜ðÑq=Ø¢™îÿ”R`!ðùŽoVÿ˜ðÑq=Ø¢™î€œïȹžÇþxÚcdàd``>ÀÀÀÀÈ Ã,@ÌÌÈÁÀ €¹™@" Ó{Æœ| –£TŒ‰‘ÊâªûÖÿ›)æ؆ ŒPӄB2sS‹üRË‚òsóV~.×bƒ¯åG%ӎ‚lÔªfҊ¬Œ Ñ öŒYp^,·™YN—YäeBæå± óÄِyؑy™œÈÀÀÀÀÈ Ã,@ÌÌÈÁÀ €¹™@" Ó{Æœ| –£TŒ‰‘ÊâªûÖÿ›)æ؆ ŒPӄB2sS‹üRË‚òsóV~.×bƒ¯å;„ÓÜ@6êU³iEVF†h{Æ,8/ÈÛ̋,§Ëˆ,÷ÆÓòŽ2!óòXyâlÈŒìÈŒLNdž7Œg²™7“™çÄ ãy¯ÙyS8y¶\ÈŒgÜÌàP`)L©Dd [èèð0² ðJ # ð A7ÿðH€2ð%ÞÖlJZDYU,0äf/)ÿb—R`!ðùÞÖlJZDYU,0äf/)€œïȹžÇþxÚcdàd``>ÀÀÀÀÈ Ã,@ÌÌÈÁÀ €¹™@" Ó{Æœ| –£TŒ‰‘ÊâªûÖÿ›)æ؆ ŒPӄB2sS‹üRË‚òsóV~.×bƒ¯åG%ӎƒlÔªfҊ¬Œ Ñ öŒYp^,·™YN—YäeBæå± óÄِyؑy™œÈÀÀÀÀÈ Ã,@ÌÌÈÁÀ €¹™@" Ó{Æœ| –£TŒ‰‘ÊâªûÖÿ›)æ؆ ŒPӄB2sS‹üRË‚òsóV~.×bƒ¯å;„Ó<@6êU³iEVF†h{Æ,8/ÈÛ̋,§Ëˆ,÷ÆÓòŽ2!óòXyâlÈŒìÈŒLNdž7Œg²™7“Æ3òœX‘y¯ÙUNá@æÙr!«|ÆÍ %\)M©Dd [èèð0² ðL # ð A9ÿðJ€2ð%$~\©"á^F¡u“òXŸÿŽšR`!ðù$~\©"á^F¡u“òXŸ€œïȹžÇþxÚcdàd``>ÀÀÀÀÈ Ã,@ÌÌÈÁÀ €¹™@" Ó{Æœ| –£TŒ‰‘ÊâªûÖÿ›)æ؆ ŒPӄB2sS‹üRË‚òsóV~.×bƒ¯å;„ÓŒ@6êU³iEVF†h{Æ,8/ÈÛ̋,§Ëˆ,÷ÆÓòŽ2!óòXyâlÈŒìÈŒLNdž7Œg²nŸ7“YΉ™÷š Yåd9[.d¹gÜÌàPÄ)PšDd [èèð0² ðM # ð A:ÿðK€2ð$ô{«¿çT*»å>ϙ ïžÛÿ]œR`!ðøô{«¿çT*»å>ϙ ïžÛ€œïȹžÆþxÚcdàd``>ÀÀÀÀÈ Ã,@ÌÌÈÁÀ €¹™@" Ó{Æœ| –£TŒ‰‘ÊâªûÖÿ›)æ؆ ŒPӄB2sS‹üRË‚òsóV~.×bƒ¯å}BiÞ uªÙŽ"+#C4ƒ=cœ ämæE–ÓeD–ûÀãéyG™yy,ÈÀÀÀÀÈ Ã,@ÌÌÈÁÀ €¹™@" Ó{Æœ| –£TŒ‰‘ÊâªûÖÿ›)æ؆ ŒPӄB2sS‹üRË‚òsóV~.×bƒ¯å;„Ó|@6êU³iEVF†h{Æ,8/ÈÛ̋,§Ëˆ,÷ÆÓòŽ2!óòXyâlÈŒìÈŒLNdž7Œg²nŸ!7“™çĊÌ{̛͆lŠ-2ï738”!Ÿ)R©Dd [èèð0² ðO # ð A<ÿðM€2ð%ó…Œwv—·ùǪÀ}H£)ÿ­ŸR`!ðùó…Œwv—·ùǪÀ}H£)€œïȹžÇþxÚcdàd``>ÀÀÀÀÈ Ã,@ÌÌÈÁÀ €¹™@" Ó{Æœ| –£TŒ‰‘ÊâªûÖÿ›)æ؆ ŒPӄB2sS‹üRË‚òsóV~.×bƒ¯å}BiŸ uªÙŽ"+#C4ƒ=cœ ämæE–ÓeD–ûÀãéyG™yy,ÈÀÀÀÀÈ Ã,@ÌÌÈÁÀ €¹™@" Ó{Æœ| –£TŒ‰‘ÊâªûÖÿ›)æ؆ ŒPӄB2sS‹üRË‚òsóV~.×bƒ¯å;„Óü@6êU³iEVF†h{Æ,8/ÈÛ̋,§Ëˆ,÷ÆÓòŽ2!óòXyâlÈŒìÈŒLNdž7Œg²™7“Æ3òœX‘å^³!ËMá@æÙr!«|ÆÍ %#J)SŠDd [èèð0² ðQ # ð A>ÿðO€2ð"¹akYÙÏgaŠ¬*y%PCÿþÿ¢R`!ðö¹akYÙÏgaŠ¬*y%PC€œïȹžÄþxÚcdàd``>ÀÀÀÀÈ Ã,@ÌÌÈÁÀ €¹™@" Ó{Æœ| –£TŒ‰‘ÊâªûÖÿ›)æ؆ ŒPӄB2sS‹üRË‚òsóV~.×bƒ¯å}Biþ uªÙŽ"+#C4ƒ=cœ ämæE–ÓeD–ûÀãéyG™yy,È 1 û¬F7aß1Dd X,èèðb² ðY c ð$€€AE?¿ ÿ?3"ñ¿`¿€?ðW€2ð{œ“®²G¢öíùeÏs®ÿWJ±R`!ðOœ“®²G¢öíùeÏs®úÀàÐÏèçþxÚcdàd``þËÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu 1 û¬F7aß1Dd X,èèðb² ðZ c ð$€€AE?¿ ÿ?3"ñ¿`¿€?ðX€2ð{œ“®²G¢öíùeÏs®ÿW{³R`!ðOœ“®²G¢öíùeÏs®úÀàÐÏèçþxÚcdàd``þËÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu 1 û¬F7aß1Dd X,èèðb² ð[ c ð$€€AE?¿ ÿ?3"ñ¿`¿€?ðY€2ð{œ“®²G¢öíùeÏs®ÿW¬µR`!ðOœ“®²G¢öíùeÏs®úÀàÐÏèçþxÚcdàd``þËÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu 1 û¬F7aß1Dd X,èèðb² ð\ c ð$€€AE?¿ ÿ?3"ñ¿`¿€?ðZ€2ð{œ“®²G¢öíùeÏs®ÿWÝ·R`!ðOœ“®²G¢öíùeÏs®úÀàÐÏèçþxÚcdàd``þËÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu 1 û¬F7aß1Dd X,èèðb² ð] c ð$€€AE?¿ ÿ?3"ñ¿`¿€?ð[€2ð{œ“®²G¢öíùeÏs®ÿWºR`!ðOœ“®²G¢öíùeÏs®úÀàÐÏèçþxÚcdàd``þËÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu 1 û¬F7aß1Dd X,èèðb² ð^ c ð$€€AE?¿ ÿ?3"ñ¿`¿€?ð\€2ð{œ“®²G¢öíùeÏs®ÿW?ŒR`!ðOœ“®²G¢öíùeÏs®úÀàÐÏèçþxÚcdàd``þËÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu 1 û¬F7aß1Dd X,èèðb² ð_ c ð$€€AE?¿ ÿ?3"ñ¿`¿€?ð]€2ð{œ“®²G¢öíùeÏs®ÿWpŸR`!ðOœ“®²G¢öíùeÏs®úÀàÐÏèçþxÚcdàd``þËÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu 1 û¬F7aßDd @,èèðb² ð` c ð$€€A ?¿ ÿ?3"ñ¿`¿€?ð^€2ðQäÞ8QQy£˜‰«3SP‹ÿ-¡ÀR`!ð%äÞ8QQy£˜‰«3SP‹’à èçóþxÚcdàd``>ÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu³þ‰ØûÈ4pƒ¹ÍÛ= [gþv+òƒNØ<ÿþ5ZŠã×ߢk÷àQO\¡êÝKÊmÃïÉ[üéÃùf2ÂôäñoÛ ªðvÎÃýÎ ÀÝ|¹Õ-ÿa߶gxÀ¡,èÖmCcžœÉ©fqJ§š­ œÓ„[Є&Ji§@rªYœÒ)j«[|é"ۀM ­‚êDc›Ó¡Ãé©ÂûšsœFUSKãl§&qjâÎXrg¢øž‰âÎD§&Ÿg¢ŒS÷ª2ûÿ_í@w–Dd  hèèðb² ðc c ð$€€AG?¿ ÿ?3"ñ¿`¿€?ða€2ðàú$¥ÛŽ‘ïm»™ˆÇãÿŒÔÆR`!ðŽú$¥ÛŽ‘ïm»™ˆÇãR @°Rø|‚þxڝ’»JA†ÿ™Ü7ÑìÆFDdµTÄJ!Ø+bÒ F\Q0‰šhXD°N%ø«< –©¬| ÅBq3™ &Xš ‡9ßî¹ý;‡!øê à=aÞñ8cÊcÜó<éM±Aõ.ªãb<ÍkVBxÉ`Cð(Šà[á] [³€7Q,ªbbX̕·²î®,ËÞïüäSŽ€Sj ?‡™ÝÎ;%{É©Ø+Å|®»Þª€„ÙÓ¯k`³áq“":,ΣƮMJ=v;lõ§4ßLj'4W£Äãš"ÄsšY€øH³áë®wÅÚùœó³?ÍÏ@çÓ7I©c_÷Yí#>Ô–:4ŸÄš›!âÍõ@wþ,ïÎOƒ8£tØÞÿt@é`JNjX%ªPP}ÀGX[×÷Í©OÆͯw€œžñQ{Nüú5å=_h=gAâ;͏òÞæ]CmŸ!7T®™Ú=!I7r§çc·TvòhP_ˆŒQTÛ ÕJ W³O~ù^ —ÇDd @,èèðb² ðd c ð$€€A ?¿ ÿ?3"ñ¿`¿€?ðb€2ðQäÞ8QQy£˜‰«3SP‹ÿ-jÉR`!ð%äÞ8QQy£˜‰«3SP‹’à èçóþxÚcdàd``>ÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpud›±K€ÌÛF&&¥àÊâ’Ô\c¹ @Š ] @óYˆævˆ]Œ Ì`FFDdÜ#†AðD² ð 3 ð@@ÿÿðÿ"ñ?ðf€Dd @,èèðb² ðh c ð$€€A ?¿ ÿ?3"ñ¿`¿€?ðg€2ðQäÞ8QQy£˜‰«3SP‹ÿ-ÞÒR`!ð%äÞ8QQy£˜‰«3SP‹’à èçóþxÚcdàd``>ÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuþxÚcdàd``Öf 2 À ĜL0##”ÅÈôÿÿ0KQ*Æ WÇÃô€ÙUÈRcãgbøRÌ ä²v@µÎ`ꁪáaðM,É©,HªaàŠþb‚è Öe„˜-ÂÄÀäf YX@îüÍÔð¢r#X=ƒ@Hfnj±‚_j¹BP~nbƒÂÊÏåš@¬`ðµÜ]&íÄLF°]F\=ÌæL ­F•~c ˆ¯ ç¯cñ á|pXhTb±Ÿ dpenR~Ã~®ª…pØÏöÛž;òw€Ý¡‹a.#‰þ‚˜Ë7w؄<žû£ |.h pc | »ØÁŒ=àxedbR ®,.IÍež²‡šC‘¡ ¬€`Ïg!t?1ƒõzh¹%Dd XTèèðb² ðm c ð$€€AK?¿ ÿ?3"ñ¿`¿€?ðl€2ðoǺíÖԝõíIæm‚@ ߉ÿKõÝR`!ðCǺíÖԝõíIæm‚@ ߉ À ÐÏXJþxÚcdàd``fed``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:&ŠÌB@–?ƒÃb ÿµ ˆ˜Ž ㆪáaðM,É©,He`Ûý›©áØ @–2°01„dæŠ+ø¥–+åç&æ1(¬ü\® Ä _Ëœ$Òf±ÕéUsi#®FnfVÍJ7Øý•èæ3’d>#ˆþ€d%ȄRž= ~0Ô…ÿäÙõ‡jÏF9° E•\ÐPã‡,8x a&ÀÀæíÇ#“RpeqIj.Ã,¹ @Š ]` bÏg!t?1ƒõ)ø`aMDd €Ðèèðb² ðn c ð$€€AL?¿ ÿ?3"ñ¿`¿€?ðm€2ð—N8ò?ó¿<1Êô;IÿsàR`!ðkN8ò?ó¿<1Êô;IZ € ðù9þxÚcdàd``Öed``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:Š–LB@–?ƒÃb ÿ @µ,@=P5< Ÿ‰%!•© ÀvÿfjøvÐ¥L,L Á•¹Iù9 2\?> 1(¬ü\® Ä _Ë7Ê€íÈr=6âÒaŸvï÷J*_‰Âÿå/b„ð¿UÂôë1€øÏáúQùJ,þ ž~ÿY%÷3€Ü’™›Z¬à—Z®”Ÿ›˜‡ÃýŒ úÜǘ_€Í5À0—‘$s æ2BÍmc|67¯’  \à˜; ì`ÞpÜ221)W—€æ2ì™ËÔ¡ÈÐÖ"b> 1 û¬ siMDd €Ðèèðb² ðo c ð$€€AM?¿ ÿ?3"ñ¿`¿€?ðn€2ð—U°e5qÍõ³íŒ¥«™ÿsgâR`!ðkU°e5qÍõ³íŒ¥«™Z € ðù9þxÚcdàd``Öed``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:Š–LB@–?ƒÃb ÿ @µ,@=P5< Ÿ‰%!•© ÀvÿfjøvÐ¥L,L Á•¹Iù9 ežÚ|bPXù¹\ˆ Ÿ–«J€œÈr=6âÒaŸvï÷J*_‰Âÿå/b„ð¿UÂôë1€øÏáúQùJ,þ ž~ÿY%÷3€Ü’™›Z¬à—Z®”Ÿ›˜‡ÃýŒ úÜǘ€Í5Ä0—‘$s æ2BÍmc|67¯’  \à˜; ì`ÞpÜ221)W—€æ2Œ™ËÔ¡ÈÐÖ"ö|b@÷3X?IrGDd €Ðèèðb² ðp c ð$€€AN?¿ ÿ?3"ñ¿`¿€?ðo€2ð‘,b¢Jú‡NN—ëó‘iÿmŽäR`!ðe,b¢Jú‡NN—ëó‘i € ðù3þxÚcdàd``ædd``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:Š–LB@–?ƒÃb ÿ @µ,@=P5< Ÿ‰%!•© ÀvÿfjøvÐ¥L,L Á•¹Iù9 Ÿež€|bPXù¹\ˆ Ÿ–’IKÈ  TÍ€žt˜/ÝûœŸÁ„ÊWbð@ù‹!üo•0ýz þsž~TŸ „ÿ®ÂV‰î~(Èý!™¹©Å ~©å Aù¹‰y8ÜÏÈ¢?ÀýqŒùØÜ"š=mŒ~^%4ôžÀ!̶ b·;˜·'ŒLLJÁ•Å%©¹ ) {€:º @ª> 1ÀÂb7#3X;`ÍMDd €Ðèèðb² ðq c ð$€€AO?¿ ÿ?3"ñ¿`¿€?ðp€2ð—szŽ?‰Írt-†.lPëÿsûæR`!ðkszŽ?‰Írt-†.lPëZ € ðù9þxÚcdàd``Öed``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:Š–LB@–?ƒÃb ÿ @µ,@=P5< Ÿ‰%!•© ÀvÿfjøvÐ¥L,L Á•¹Iù9 š2\Ï|bPXù¹\ˆ Ÿ–‡pŠ9 d¹žHqé0_»÷{%„?ƒ •¯Äáÿ€ò1Bøß*aúõ@üçpýš|%ÿ\?„ÿ¬‹û@îÉÌM-VðK-WÊÏMÌÃá~FýîcÌ/Àæ`˜ËH’¹ Ps¡æ¶1Ÿ››Wɍ.pL v0o8n™˜”‚+‹KRsœAæ2u(2t5€ˆ=Ÿ…ÐýÀ Öœo€kDd øšèèðb² ðr c ð$€€A?¿ ÿ?3"ñ¿`¿€?ðq€2ðµ MƪŸxœÐp-lñÞÅyÿ‘HéR`!ð‰ MƪŸxœÐp-lñÞÅy†À@`\–WþxڕR»JA=÷ÎúÈ0D Y,VÁ"Aók-L~ ⊂k„Âv©-$Ej±5ø)òvVVbç£P‚ ‰žÎ+[ø(žË9Ã9÷ž™YB ë$?˜‡Zc²RÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu 1(¬ü\® Ä _ËÝd҄2€\Ï€žt˜/‚ÝûœŸÁ„ÊWbð@ù‹!üo•0ýz þsž~TŸ „ÿ®ÂV‰Åý ÷‡dæŠ+ø¥–+åç&æáp?#ˆþ÷Ç1æ`s 0Ìe$É\š¹ŒPsÛ߁ÍÍ«ä‚Æ8ŠÀ΅Ɓ;˜··ŒLLJÁ•Å%©¹  s€:ºÀ@ĞÏB è~`ë ámðMDd €Ðèèðb² ðw c ð$€€AM?¿ ÿ?3"ñ¿`¿€?ðv€2ð—U°e5qÍõ³íŒ¥«™ÿs?ôR`!ðkU°e5qÍõ³íŒ¥«™Z € ðù9þxÚcdàd``Öed``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:Š–LB@–?ƒÃb ÿ @µ,@=P5< Ÿ‰%!•© ÀvÿfjøvÐ¥L,L Á•¹Iù9 ežÚ|bPXù¹\ˆ Ÿ–«J€œÈr=6âÒaŸvï÷J*_‰Âÿå/b„ð¿UÂôë1€øÏáúQùJ,þ ž~ÿY%÷3€Ü’™›Z¬à—Z®”Ÿ›˜‡ÃýŒ úÜǘ€Í5Ä0—‘$s æ2BÍmc|67¯’  \à˜; ì`ÞpÜ221)W—€æ2Œ™ËÔ¡ÈÐÖ"ö|b@÷3X?IrHDd €Ðèèðb² ðx c ð$€€AS?¿ ÿ?3"ñ¿`¿€?ðw€2ð’O£POŠÐy>ÒI•›ÿnŒöR`!ðfO£POŠÐy>ÒI•› € ðù4þxÚcdàd``ædd``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:Š–LB@–?ƒÃb ÿ @µ,@=P5< Ÿ‰%!•© ÀvÿfjøvÐ¥L,L Á•¹Iù9 ÏdžÄ|bPXù¹\ˆ Ÿ–¯IãÈ  TÍ€žt˜/ÝûœŸÁ„ÊWbð@ù‹!üo•0ýz þsž~TŸ „ÿ®ÂV‰î~(Èý!™¹©Å ~©å Aù¹‰y8ÜÏÈ¢?ÀýqŒùØÜTš=mŒïÀüŒJ.hèqC˜lÄnv0o8N™˜”‚+‹KRsø@ö0u(2tA4€T}b€…ÄnFf° ®_ Dd ,èèðb² ðy c ð$€€AP?¿ ÿ?3"ñ¿`¿€?ðx€2ðS•m[©ºå‰lpðAFþmÿ/ÔøR`!ð'•m[©ºå‰lpðAFþm’ÀàHµèçõþxÚcdàd``>ÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu 1(¬ü\® Ä _ËÝd҄2€\Ï€žt˜/‚ÝûœŸÁ„ÊWbð@ù‹!üo•0ýz þsž~TŸ „ÿ®ÂV‰Åý ÷‡dæŠ+ø¥–+åç&æáp?#ˆþ÷Ç1æ`s 0Ìe$É\š¹ŒPsÛ߁ÍÍ«ä‚Æ8ŠÀ΅Ɓ;˜··ŒLLJÁ•Å%©¹  s€:ºÀ@ĞÏB è~`ë ámðMDd €Ðèèðb² ð| c ð$€€AM?¿ ÿ?3"ñ¿`¿€?ð{€2ð—U°e5qÍõ³íŒ¥«™ÿsYÿR`!ðkU°e5qÍõ³íŒ¥«™Z € ðù9þxÚcdàd``Öed``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:Š–LB@–?ƒÃb ÿ @µ,@=P5< Ÿ‰%!•© ÀvÿfjøvÐ¥L,L Á•¹Iù9 ežÚ|bPXù¹\ˆ Ÿ–«J€œÈr=6âÒaŸvï÷J*_‰Âÿå/b„ð¿UÂôë1€øÏáúQùJ,þ ž~ÿY%÷3€Ü’™›Z¬à—Z®”Ÿ›˜‡ÃýŒ úÜǘ€Í5Ä0—‘$s æ2BÍmc|67¯’  \à˜; ì`ÞpÜ221)W—€æ2Œ™ËÔ¡ÈÐÖ"ö|b@÷3X?IrHDd €Ðèèðb² ð} c ð$€€AS?¿ ÿ?3"ñ¿`¿€?_1247228220åöÎÀF‡*Û±Pȇ*Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿCompObjõ÷ÿÿÿÿfObjInfoÿÿÿÿøÿÿÿÿþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁH4¯ †d"ˆ2 ƒnþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿ:_1247317745ÿÿÿÿÿÿÿÿûÎÀFÑ,Û±PÈÑ,Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿCompObjúüÿÿÿÿfObjInfoÿÿÿÿýÿÿÿÿEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿ6_1247317804žÎÀF‡*Û±Pȇ*Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿêÁ€!dŸ ƒZ ƒpþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁ4% ƒZ ˆ3þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS EqCompObjÿÿÿÿÿfObjInfoÿÿÿÿÿÿÿÿEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿ6_1247317842ÿÿÿÿÿÿÿÿÎÀFÑ,Û±PÈÑ,Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿCompObjÿÿÿÿfObjInfoÿÿÿÿÿÿÿÿ!Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ"6uation Equation.3ô9²qêÁ4% ƒZ ˆ3þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁ(`ÄÄ ƒZ ƒp  ƒn_1247317903þ ÎÀFÑ,Û±PÈÑ,Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿ#CompObj  ÿÿÿÿ$fObjInfoÿÿÿÿ ÿÿÿÿ&Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ'D_1247318077ÿÿÿÿÎÀFÑ,Û±PÈÑ,Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿ)CompObjÿÿÿÿ*fþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁ2`ÄdŸ ‚[ƒn‚,ƒk‚,ƒd‚] ƒpObjInfoÿÿÿÿÿÿÿÿ,Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ-N_1247381526 ÎÀFÑ,Û±PÈÑ,Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿ/CompObjÿÿÿÿ0fObjInfoÿÿÿÿÿÿÿÿ2Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ3>_1247381362ÿÿÿÿÿÿÿÿÎÀFÑ,Û±PÈÑ,Û±PÈþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qêÁ"`ÄdŸ ƒq†=ƒp ƒnþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²qOle ÿÿÿÿÿÿÿÿÿÿÿÿ4CompObjÿÿÿÿ5fObjInfoÿÿÿÿÿÿÿÿ7Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ8?êÁ#`ÄdŸ ˆ2 ˆ2 †=ˆ4þÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²q³Â&‰ q ƒnƒk–(–)_1260375736,!ÎÀFÑ,Û±PÈÑ,Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿ9CompObjÿÿÿÿ:fObjInfoÿÿÿÿ ÿÿÿÿ<Equation Native ÿÿÿÿÿÿÿÿÿÿÿÿ=B_1260375845ÿÿÿÿÿÿÿÿ#ÎÀFÑ,Û±PÈÑ,Û±PÈOle ÿÿÿÿÿÿÿÿÿÿÿÿ?CompObj"$ÿÿÿÿ@fþÿ ÿÿÿÿÎÀFMicrosoft Equation 3.0 DS Equation Equation.3ô9²q³Â[‰ q ƒnƒk–(–)†=ƒn‚!‚(ƒn†"ƒk‚)‚!ƒk‚!þÿà…ŸòùOh«‘+'³Ù0ø˜ $0<P |ˆ š Ž À ÌØàèObjInfoÿÿÿÿ%ÿÿÿÿBEquation Native ÿÿÿÿÿÿÿÿÿÿÿÿCw1TableÿÿÿÿÖa SummaryInformation((ÿÿÿÿE(ð|€2ð’O£POŠÐy>ÒI•›ÿnŠR`!ðfO£POŠÐy>ÒI•› € ðù4þxÚcdàd``ædd``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:Š–LB@–?ƒÃb ÿ @µ,@=P5< Ÿ‰%!•© ÀvÿfjøvÐ¥L,L Á•¹Iù9 ÏdžÄ|bPXù¹\ˆ Ÿ–¯IãÈ  TÍ€žt˜/ÝûœŸÁ„ÊWbð@ù‹!üo•0ýz þsž~TŸ „ÿ®ÂV‰î~(Èý!™¹©Å ~©å Aù¹‰y8ÜÏÈ¢?ÀýqŒùØÜTš=mŒïÀüŒJ.hèqC˜lÄnv0o8N™˜”‚+‹KRsø@ö0u(2tA4€T}b€…ÄnFf° ®_)Dd à,èèðb² ð~ c ð$€€AT?¿ ÿ?3"ñ¿`¿€?ð}€2ðs&~Æ %Š4Aˆ«è@AÚRÿOîR`!ðG&~Æ %Š4Aˆ«è@AÚRêà°¥èçþxÚcdàd``þÊÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu át'Ä\Fž¹& #WrAC… r`çBÃD€ÌÛkF&&¥àÊâ’Ô\†— s€:ºÀ@ĞÏB è~`ëΟ`kDd øšèèðb² ð c ð$€€A?¿ ÿ?3"ñ¿`¿€?ð~€2ðµ MƪŸxœÐp-lñÞÅyÿ‘R`!ð‰ MƪŸxœÐp-lñÞÅy†À@`\–WþxڕR»JA=÷ÎúÈ0D Y,VÁ"Aók-L~ ⊂k„Âv©-$Ej±5ø)òvVVbç£P‚ ‰žÎ+[ø(žË9Ã9÷ž™YB ë$?˜‡Zc²RÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu;êvv0o8L™˜”‚+‹KRsAæ2u(2tA4AÌg!˜Û!v120ƒe†K> Dd ,hèèðb² ð‡ c ð$€€AY?¿ ÿ?3"ñ¿`¿€?ð€2ðT«(/çRÎÙòËúÿÞÔ£ÿ0“ R`!ð(«(/çRÎÙòËúÿÞÔ£’à@èçø|öþxÚcdàd``>ÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpuÉÀÀÀÄ Ã¬@ÌÉc112BYŒLÿÿÿ³ô% bÜpu² ð‘ # ð AEÿ"ñ¿@@ð€2ð܃’äËŽz Ñ"*=ê›Aÿž& `!𰃒äËŽz Ñ"*=ê›A »ïønž~þxÚcdàd``````da ffä``ÒÜL ‹‡é=ãnFKQ*ÆÄÈeqÕýëÿÍól ÃFšiB!™¹©Å ~©å Aù¹‰y +?—k±‚Á×riî4yº@Õì@Z‘•‘Á˜Áž1‹l ÅYnDd sèèð>² ð’ # ð A_ÿ"ñ¿@@ð‘€2ðÜÊjÄcέaëƒHÞ»ºáÿž…' `!ð°ÊjÄcέaëƒHÞ»ºá ï™ž~þxÚcdàd``````da ffä``ÒÜL ‹‡é=c?ˆ¥Ç(cbd„²8êþƒõÿfŠù6†a#Ô4¡ÌÜÔb¿Ôr… üÜÄ<…•ŸË5XÁàk¹§h'ÈF] jv ­ÈÊÄ`hfϘÅÀ 6žS…GDd €Ðèèðb² ð c ð$€€A\?¿ ÿ?3"ñ¿`¿€?ð„2ð‘5Ø £ö,Ñø1Pþùlÿm–'R`!ðe5Ø £ö,Ñø1Pþùl € ðù3þxÚcdàd``ædd``baV æd‚±˜¡,FŠÿÿÿƒYzŒP1nž:Š–LB@–?ƒÃb ÿ @µ,@=P5< Ÿ‰%!•© ÀvÿfjøvÐ¥L,L Á•¹Iù9 b\ > 1t¬ü\>ˆ Ÿ–s‰¥ÍÈ  TÍ€žt˜o€ÝûœŸÁ„ÊWbð@ù‹!üo•0ýz þsž~TŸ „ÿ®ÂV‰î~(Èý!™¹©Å ~©å Aù¹‰y8ÜÏÈ¢?ÀýqŒùØÜlš=mŒ~^%4ôžÀ!̶ b·;˜·'ŒLLJÁ•Å%©¹ ó@ö0u(2tA4€T}b€…ÄnFf° ‚Ð`0§Dd TÐèèðb² ðŽ c ð$€€A]?¿ ÿ?3"ñ¿`¿€?ð„2ðñŒZNg8«1 ɚwæÿÍÝ)R`!ðÅŒZNg8«1 ɚwæ& €š±ðù“þxÚcdàd``žÌ$d@€ˆ9™`,&FF(‹‘éÿÿÿ`–£TŒ®Ž‡©EKÈRcãgbøRÌ ä²@øÐ" šßĒŒÊ‚T† @Ñ_L TÈ Ë1[„Ɂ‰‡Ä²q‚Üù›©áDåF°z&ÌÜÔb¿Ôr… üÜÄ<†Ž•ŸË'±‚Á×òýli!f2‚í2â:ÃÅ ÒªX ã/ayGSÆW`Ék@ùëEØÁêÑíg$É~&°ß> ¹c Ȅlžœ7ØPù«Àîȃ»#‡ ™Œù²ú6F?OK81Ü\™›”ŸÃÀp›«×á£Îp‚ž“ îά #t¡ö,`:ÇâÛBù:Ì7À!ñʟÁ„ÊWbð@ù‹!üopýz`w?‡ëGå+±@ø/àú!ügŠ\ÐÅNuàäÀñ»;˜·œN™˜”‚+‹KRs.‚üÉÔ¡ÈÐÖRóYˆ=Ž˜Áú³ŠªŸ¶Ÿ·ŸžŸ¹ŸŒŸœŸŸŸÁŸÈŸÒŸ×ŸÞŸßŸàŸèŸéŸêŸíŸîŸïŸðŸõŸöŸ÷ŸüŸýŸ¿¿ ¿ ¿ ¿ ¿¿¿¿¿Ñ¿Ò¿Û¿Ü¿ä¿å¿î¿ö¿÷¿ÿ¿ÀÀ À À ÀÀÀÀÀÀÀÀÀÀÀÀ À!À"À#À$À&À'À)À*À+À,À.À/À1À2À3À4À5À6À9À˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0†œD@ñÿD NormalCJ_HaJmH nHsH tHZ@Z o9Ü Heading 1$€ð€<@&5CJ KH OJQJ\^JaJ N@N Åà Heading 5 €ð€<@&56CJ\]aJP@P o9Ü Heading 6 €ð€<@&5CJPJ\aJtH DA@òÿ¡D Default Paragraph FontRi@óÿ³R  Table Normalö4Ö l4Öaö (k@ôÿÁ(No ListF@òF o9Ü Footnote TextCJPJaJtH @&@¢@ o9ÜFootnote ReferenceH*4U@¢4 o9Ü Hyperlink >*phÿ4 @"4 3Q1Footer  ÆàÀ!.)@¢1. 3Q1 Page Number4@B4 Þ;|Header  ÆàÀ!JþOòÿQJ 5%¢ Maple Input5B*OJQJ\^JphÿpþOñÿp ·pX Maple Output$dh7$8$H$a$%B*CJ_HaJmH nHphsH tHlþOñÿl ·pX Maple Output1dh7$8$H$%B*CJ_HaJmH nHphsH tH^þOñÿ‚^ Î3 Warning 7$8$H$)B*OJQJ^J_HmH nHphÿsH tH2ž8ÀÚÝ'1>DNQTW_#,>GPSX\_defghijknqrsvyz{|}8ÀÿÿÿÿrÿÿÿÿëÿÿÿÿpÿÿÿÿoÿÿÿÿÉÿÿÿÿÈÿÿÿÿÇÿÿÿÿÆÿÿÿÿÅÿÿÿÿèÿÿÿÿçÿÿÿÿæÿÿÿÿäÿÿÿÿâÿÿÿÿßÿÿÿÿÞÿÿÿÿÄÿÿÿÿÃÿÿÿÿÂÿÿÿÿÁÿÿÿÿÊÿÿÿÿ ÿÿÿÿÿÿÿÿ ÿÿÿÿ ÿÿÿÿ ÿÿÿÿÿÿÿÿÿÿÿÿ«ÿÿÿÿÁ%ÿÿÿÿÿÿÿÿÿÿÿÿûÿÿÿÿÿÿÿÿÿÿÿÿÿ"ÿÿÿÿ#ÿÿÿÿ$ÿÿÿÿ '1>DNQTW_#,>GPSX\_defghijknqrsvyz{|}€     !"#$%ÿÿ8À†ÿÿÿÿ6Ucž·Ñà()*+,-./01234FG   ßà= > ? @ A B C D E F G H I J K L Y j _ ` ¯°ÁÂ\]z{|Žµ˜™ ¡56STœ¹ä– — ¥#Š#q$r$ú&û&•'–'++#+$+á,â,-#1$1›1ž1ú1û1'2(2ê45@5A5ª7«7Ö7×7•8–8ð;ñ;>>â>ã>¡?¢?+@,@í@î@K?KwKxKèKéKàLáLîNïN‡OˆOpPqPQQbRSS!S"S9S:SpSqS¥SŠSÂSÄSàSâSþSÿS=T>TxTzT{T®T¯TÏTÑTÒT9UÙUÚUVVGVIVcV}V—V²VWWW!W'W3W5W6W¢W£W¬W®W¯WXXX^X_XuXƒX”XœX³XÔXÙXäXéXêXYY1Y?YPYXYoYŒY‘YY¢Y£Y€YZZZ Z>Z]Z­Z²Z·ZÂZÄZÅZ[[[[4[[“[ [¢[£[r\s\E]F]š]›]B_C_<`=`à`á`ÿ`açfèféfêfggfhgháiâi.j/j/n0n&o'orpsqs¿sÀsÁsÂsÃs÷søsvvxwÈwÉwæwèw“x”xxŽxÑxéx$y%yByHydyjy{y‘yŠyšy||I|U|V|p|r|s|Ÿ|ý|þ|}:}X}v}}£}©}ª}Á}Ö}Ü}Ý}ô} ~~&~;~A~B~M~N~f~~˜~²~NTZ`f…–ÁÉØàáـڀ89B`€†’”•–îï‚ ‚-‚/‚0‚š‚ƒ‘ƒ™ƒŸƒÀƒÁƒÊ„Ë„……*…,…-… †¡†Y‡Z‡Ð‡Ñ‡Ò‡Ó‡Ô‡ñ‡ò‡$Œ%ŒCŒDŒŽŒèŒéŒ,Ž-Ž()CD¿‘À‘Z’[’ì’풏““ • •Ÿ•¡•°–±–蘙™Q™o™p™±™²™³™_›;<f¢g¢»¢5££€€€¥¥]¥^¥§‘§’§¿§À§ì§í§ÆšÇš©ªªª”«•«é«ê«*¬+¬Œ­­Ÿ­¿­"±#±ð±ñ±Ä²!³"³Y³Z³ž³Ÿ³)Ž*Ž ¶ ¶¶G¶H¶4¹5¹6¹7¹8¹9¹:¹;¹<¹=¹>¹I¹J¹“¹”¹Ö¹×¹CºDºžº¹º*»+»å»æ»ÌŒÍŒAœ¯œ°œ±œ²œ³œ¶œŸ‘Ÿ“Ÿ”Ÿ–Ÿ—Ÿ™ŸšŸœŸŸžŸŸŸšŸ©Ÿ€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜ 0€€˜ 0€€˜ 0€€˜ 0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRWUþÿÿÿVþÿÿÿXYZ[\]^þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜ 0€€˜0€€˜ 0€€˜0€€˜ 0€€˜0€€˜ 0€€˜0€€˜ 0€€˜0€€˜ 0€€˜0€€˜ 0€€˜0€€˜ 0€€X 0€€˜0€ŽŸ˜0€ŽŸ˜0€ŽŸ˜0€ŽŸ˜0€€€˜@0€€00Ú˜@0€€ˆ00ј@0€€ˆ00ј@0€€ˆ00ј@0€€ˆ00ј@0€€˜@0€€˜@0€€˜@0€€˜@0€€˜@0€€˜@0€€˜@0€€ˆ00  ј0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€€˜0€€˜0€€˜0€€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€€˜0€€˜0€€€˜0€€˜0€€€˜0€€˜0€€˜0€€€˜0€€˜0€€€˜0€€˜0€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€˜0€€€˜0€€˜0€€€˜0€€˜0€€€˜0€€˜0€€ø˜0€€˜0€€ø˜0€€˜0€€ø˜0€€€˜0€€€˜0€€€˜0€€ø˜0€€6Ucž·Ñà()*+,-./01234FG   ßà= > ? @ A B C D E F G H I J K L Y j _ ` ¯°ÁÂ\]z{|Žµ˜™ ¡56STœ¹ä– — ¥#Š#q$r$ú&û&•'–'++#+$+á,â,-#1$1›1ž1ú1û1'2(2ê45@5A5ª7«7Ö7×7•8–8ð;ñ;>>â>ã>¡?¢?+@,@í@î@K?KwKxKèKéKàLáLîNïN‡OˆOpPqPQQbRSS!S"S9S:SpSqS¥SŠSÂSÄSàSâSþSÿS=T>TxTzT{T®T¯TÏTÑTÒT9UÙUÚUVVGVIVcV}V—V²VWWW!W'W3W5W6W¢W£W¬W®W¯WXXX^X_XuXƒX”XœX³XÔXÙXäXéXêXYY1Y?YPYXYoYŒY‘YY¢Y£Y€YZZZ Z>Z]Z­Z²Z·ZÂZÄZÅZ[[[[4[[“[ [¢[£[r\s\E]F]š]›]B_C_<`=`à`á`ÿ`açfèféfêfggfhgháiâi.j/j/n0n&o'orpsqs¿sÀsÁsÂsÃs÷søsvvxwÈwÉwæwèw“x”xxŽxÑxéx$y%yByHydyjy{y‘yŠyšy||I|U|V|p|r|s|Ÿ|ý|þ|}:}X}v}}£}©}ª}Á}Ö}Ü}Ý}ô} ~~&~;~A~B~M~N~f~~˜~²~NTZ`f…–ÁÉØàáـڀ89B`€†’”•–îï‚ ‚-‚/‚0‚š‚ƒ‘ƒ™ƒŸƒÀƒÁƒÊ„Ë„……*…,…-… †¡†Y‡Z‡Ð‡Ñ‡Ò‡Ó‡Ô‡ñ‡ò‡$Œ%ŒCŒDŒŽŒèŒéŒ,Ž-Ž()CD¿‘À‘Z’[’ì’풏““ • •Ÿ•¡•°–±–蘙™Q™o™p™±™²™³™_›;<f¢g¢»¢5££€€€¥¥]¥^¥§‘§’§¿§À§ì§í§ÆšÇš©ªªª”«•«é«ê«*¬+¬Œ­­Ÿ­¿­"±#±ð±ñ±Ä²!³"³Y³Z³ž³Ÿ³)Ž*Ž ¶ ¶¶G¶H¶4¹5¹6¹7¹8¹9¹:¹;¹<¹=¹>¹I¹J¹“¹”¹Ö¹×¹CºDºžº¹º*»+»å»æ»ÌŒÍŒAœ¯œ¹ŸŸŸèŸéŸíŸõŸöŸÑ¿Û¿ä¿î¿ö¿ÿ¿9À˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€˜0€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜ 0€€€˜ 0€€€˜ 0€€€˜ 0€€˜0€€˜0€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€˜0€€˜0€€€˜0€€€˜0€€˜0€€˜0€€˜0€€˜0€€€˜0€€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€€˜0€€€˜0€€€˜0€€˜0€€˜0€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€˜0€€˜0€€˜0€€˜0€€€˜0€€€˜0€€€˜0€€˜0€€€˜0€€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€€˜0€€˜0€€€˜0€€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€˜0€€˜0€€˜0€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€€˜0€€€˜0€€€˜0€€˜0€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€P˜0€€P˜0€€P˜0€€P˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€Ð˜0€€Ð˜0€€Ð˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€Ð˜0€€Ð˜0€€€˜0€€Ð˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€˜0€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€˜0€€˜0€€`˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€˜0€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜0€€€˜ 0€€€˜0€€€˜ 0€€€˜0€€€˜ 0€€€˜0€€€˜ 0€€˜0€€˜ 0€€€˜0€€€˜ 0€€€˜0€€€˜ 0€€˜0€€˜ 0€€€Z 0 €€š0€€Š00Œ(:@Ð0À!ÿÿÿÿŠÍ00€ŠÍ00ŠÍ00ŠÍ00š@0€€€š@0€€š@0€€š@0€€š@0€€š@0€€š0€€P '''*Ä àÀ §$3( -267û9ª?ÕCªG.KåLWO¥T[à[^¡_a`ab cƒfWmhqÄržwKxy-zá{æ'€…S‡Ë‡Ý‡ï‰ÍŒñœ“‰•K›>ŸP¡&€‘ŠšÐ©æª€¬p°,·¹*Œ3Á÷ÂPŎŲÆÇÌÇ8Èeijlmnoqrstuwxyz|}~€ƒ„†‡‰ŠŒŽ‘’“”•–˜™šœžŸ ¢€¥Š§©ª«¬­®¯°²³Ž¶·¹º»œ¿ÁF Y–(A=yLïV{\£_‘a¢câq€þ„Z‡-Šñ ­#¹>ÁÆÈÆÇÈ8Èfhkpv{‚…ˆ‹—›¡£š±µžŒŸÀÂ7ÈgàœŽ·.*.,.].q.s.º.Î.Ð.Ó.ç.é.ð.//›1³1¶1ê4558-8/8š9Œ9Ÿ9À;Ô;Ö;M<a<c<9AMAOAäAøAúAC.C0C’CŠCšC€D”D–DÑDåDçDcEwEyE/FCFEFºFÎFÐFÖGêGìGEIYI[IõI J JTMhMjMZ^n^p^¯^Ã^Å^CgWgYgTihiji|ii’i”jšjªj¯jÃjÅj‹oŸo¡o£o·o¹oœoÑoÓoéoýoÿopppp-p/p7pKpMpOpcpepjp~p€pÂpÖpØpÙpípïpòpqqŒq q¢q€qžqºqŸqÒqÔqrrrr-r/r\rprrrtrˆrŠr—v«v­vÁˆÕˆ×ˆ7ŠKŠMŠpŠ„Š†Š‹'‹)‹š‹Œ‹Ÿ‹rŒ†ŒˆŒWkmoƒ…7“K“M“”-”/”(—<—>—n—‚—„—(˜<˜>˜|˜˜’˜$™8™:™R™j™m™ššš›1›3›œ&œ(œÿžžž-ž/žzžŽžžŽžÈžÊžÌžàžâžæžúžüžŸŸŸïŸ  ¢ ¶ ž Ð ä æ ¡¡¡£¡€¡ž¡º¡Œ¡Ð¡Ò¡Ö¡ê¡ì¡ ¢¢!¢»¢Ï¢Ñ¢Ò¢æ¢è¢ê¢þ¢£££££0£2£‰€€Ÿ€|®®’®Û®ï®ñ®¯,¯.¯o¯ƒ¯…¯Ÿ¯³¯µ¯Ä¯Ø¯Ú¯×°ë°í°±±±°±Ä±Æ±†²š²œ²æ³ú³ü³(·<·>·¢·¶·ž·KŒ’ŒÊŒ8ÀXÿ„“_ÿœ:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„“_ÿœ“_ÿœ:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•€:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„“_ÿœ:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•€:”ÿ•€:”ÿ•„:”ÿ•„:”ÿ•€:”ÿ•„:”ÿ•„:”ÿ•€:”ÿ•„:”ÿ•„:”ÿ•„:”ÿ•€:”ÿ•€Xÿ„ #*!•!ÿ•€/1ÂÖØÝ:”ÿ•€:”ÿ•€ðlðDFð,bð$móm¢Y†q%ӑ®+ýÒ'ÿœÿÿÿÿ@ñÿÿÿ€€€÷ð ,ðgEðŸ+ð( ð ðð ðŒ ðà l 8* ðœ3 ðÀÀˆ¿ s"ñ*‘’¿?ððð`² ð c ð$X99¿ÿ?ðà l 8*ððP ðž  ð¿"ñ¿`ðà l „)ðð\2 ðŸ 3 ð€€¿"ñ¿`ðbGªððP2 ð   ð¿"ñ¿`ð° .lêððZB ð¡‚ S ðD¿Ñÿð»*{\ðð\2 ð¢ 3 ð€€¿"ñ¿`ð\¿€ðð\2 ð£ 3 ð€€¿"ñ¿`ðû.Cwðð\2 ð€ 3 ð€€¿"ñ¿`ðí Ô 5 ðð\2 ð¥ 3 ð€€¿"ñ¿`ðEaŽðð\2 ðŠ 3 ð€€¿"ñ¿`ðÞ³&üðð\2 ð§ 3 ð€€¿"ñ¿`ð÷”? Ýðð\2 ðš 3 ð€€¿"ñ¿`ðŸ Užðð\2 ð© 3 ð€€¿"ñ¿`ð° Œø Õðð\2 ðª 3 ð€€¿"ñ¿`ðÜ ]$Šððh¢ ð« 3 ð€¿ÿ"ñ¿`ðº Öuð ðð\2 ð¬ 3 ð€€¿"ñ¿`ðªnò·ðð\2 ð­ 3 ð€€¿"ñ¿`ðŠ%Ìî%ðð\2 ð¯ 3 ð€€¿"ñ¿`ðwß¿(ðð\2 ð³ 3 ð€€¿"ñ¿`ð®’öÛðð\2 ðŽ 3 ð€€¿"ñ¿`ðýPE™ðð\2 ðµ 3 ð€€¿"ñ¿`ð4†|Ïðð\2 ð¶ 3 ð€€¿"ñ¿`ðB êŠ 3ðð\2 ð· 3 ð€€¿"ñ¿`ðšJãðð\2 ðž 3 ð€€¿"ñ¿`ð×K”ðð\2 ð» 3 ð€€¿"ñ¿`ðNû–Dðð\2 ðŒ 3 ð€€¿"ñ¿`ðyÁÈðð\2 ðœ 3 ð€€¿"ñ¿`ðaê©3ðð\2 ðŸ 3 ð€€¿"ñ¿`ðªÚò#ððh¢ ðÁ 3 ð€¿ÿ"ñ¿`ðh4Ðð ððZB ð‚ S ðD¿ÑÿðU² äðð\2 ðà 3 ð€€¿"ñ¿`ðþÏFððP2 ðõ  ð¿"ñ¿`ð›cWððP2 ðö  ð¿"ñ¿`ðC‘ÿ&Mðð\2 ðø 3 ð€€¿"ñ¿`ðO@—‰ððZB ðú‚ S ðD¿Ñÿð—%¡Aððh¢ ðû 3 ð€!¿ÿ"ñ¿`ðÓ%ïð ð!ð\2 ðü 3 ð€€¿"ñ¿`ð÷"n?#·ððZB ðþ‚ S ðD¿Ñÿð!# "#Hððh¢ ðÿ 3 ð€"¿ÿ"ñ¿`ð"œ/$%ð ð"ðP2 ð  ð¿"ñ¿`ðY œðð\2 ð 3 ð€€¿"ñ¿`ðu äœ -ðð\2 ð 3 ð€€¿"ñ¿`ðRBš‹ðð\2 ð 3 ð€€¿"ñ¿`ð‘ŒÙðð\2 ð 3 ð€€¿"ñ¿`ðü›Däðð\2 ð 3 ð€€¿"ñ¿`ðÕ#M$–ðð\2 ð4 3 ð€€¿"ñ¿`ðc É« ðð\2 ð5 3 ð€€¿"ñ¿`ðš%Øâ%!ðð\2 ð6 3 ð€€¿"ñ¿`ð÷"B?#‹ðð\2 ð7 3 ð€€¿"ñ¿`ð÷"‘?#Úðð\2 ð8 3 ð€€¿"ñ¿`ðÿŽG×ðð\2 ð9 3 ð€€¿"ñ¿`ðæ!h."±ðð\2 ð: 3 ð€€¿"ñ¿`ðò$;:%„ðð\2 ð; 3 ð€€¿"ñ¿`ðØ N !—ðð\2 ð< 3 ð€€¿"ñ¿`ðY'Õ¡'ðð\2 ð= 3 ð€€¿"ñ¿`ð;'£ƒ'ìðð\2 ð> 3 ð€€¿"ñ¿`ð>ð †9ðð\2 ð? 3 ð€€¿"ñ¿`ðÒY¢ðð\2 ð@ 3 ð€€¿"ñ¿`ð.‚vËðð\2 ðA 3 ð€€¿"ñ¿`ð‹VÔðð\2 ðB 3 ð€€¿"ñ¿`ð§'‹ï'Ôðð\2 ðC 3 ð€€¿"ñ¿`ð§Pððð\2 ðD 3 ð€€¿"ñ¿`ðú OB˜ðð\2 ðE 3 ð€€¿"ñ¿`ðî '6 pððôðŒ ðß c+¿8m4 ðÛ3 ðÀÀˆ¿ s"ñ*‘’¿?ððð`² ðÜ c ð$X99¿ÿ?ðß c+¿8m4ððZB ðÝ S ðD¿Ñÿðf.g.ð𘢠ðÞ ³ ðB€Pւ(kƒPք(kŠÞ¿»àã¿Ëg ÿ"ñ¿`ðye-ñX/ð ð𘢠ðß ³ ðB€Pւ(kƒPք(kŠß¿»àã¿Ëg ÿ"ñ¿`ðbe-ÚX/ð ððZB ðà S ðD¿Ñÿðïf.«g.ððZB ðá S ðD¿Ñÿð# š.ß"›.ð𘢠ðâ ³ ðB€Pւ(kƒPք(kŠâ¿»àã¿Ëg ÿ"ñ¿`ð·"d,÷(¹/ð ððZB ðã‚ S ðD¿Ñÿð)f.E+g.ð𘢠ðä ³ ðB€ Pւ(kƒPք(kŠä¿»àã¿Ëg ÿ"ñ¿`ð+e-ï0Q/ð ð ðZB ðå S ðD¿Ñÿðï0f.§2g.ð𘢠ðæ ³ ðB€ Pւ(kƒPք(kŠæ¿»àã¿Ëg ÿ"ñ¿`ð2Ì-¿8¿/ð ð ð„¢ ðç £ ð<€ Pւ(kƒPք(kŠç¿»àã¿ÿðß œ0“7€2ð ð ðz¢ ðè c ð$€ Šè»àã¿Ëg ÿ"ñ¿`ðC e-€/ð ð ðh’ ðé S ð…‡»àã¿ÿ"ñ¿`ðc+×Ì-ððh’ ðê S ð…‡»àã¿ÿ"ñ¿`ðmc+ÅÌ-ðð\ðŒ 𪳠Fã& ð»3 ðÀÀˆ¿ s"ñ*‘’¿?ððð`² ðŒ c ð$X99¿ÿ?𪳠Fã&ððZB ðœ S ðD¿Ñÿð c"Žd"ððZB ðŸ S ðD¿Ñÿð Ã%ŽÄ%ððZB ð¿‚ S ðD¿Ñÿð c"ŽÃ%ððZB ðÀ S ðD¿Ñÿð c"ŽÃ%ððt¢ ðÁ S ð€ŠÁ‚Àÿÿÿÿ"ñ¿`ð}C! ó"ð ððt¢ ð S ð€ŠÂ‚Àÿÿÿÿ"ñ¿`ð}£$±ã&ð ððt¢ ðà S ð€ŠÃ‚Àÿÿÿÿ"ñ¿`ð. ó"ï$ð ððt¢ ðÄ S ð€ŠÄ‚Àÿÿÿÿ"ñ¿`ðù Ó!‡ ƒ#ð ððt¢ ðÅ S ð€ ŠÅ‚Àÿÿÿÿ"ñ¿`ðŽÓ!ƒ#ð ð ðt¢ ðÆ S ð€ŠÆ‚Àÿÿÿÿ"ñ¿`ðù 3%‡ ã&ð ððt¢ ðÇ S ð€ŠÇ‚Àÿÿÿÿ"ñ¿`ðŽ3%ã&ð ððt¢ ðÈ S ð€ŠÈ‚Àÿÿÿÿ"ñ¿`ðó"j£$ð ððt¢ ðÉ S ð€ŠÉ‚Àÿÿÿÿ"ñ¿`ðR ƒ# £$ð ððt¢ ðÊ S ð€ŠÊ‚Àÿÿÿÿ"ñ¿`ð. $ï3%ð ððþðŒ ðŒª P ðm3 ðÀÀˆ¿ s"ñ*‘’¿?ððð`² ðn c ð$X99¿ÿ?ðŒª Pððz2 ðo c ð$€‡Šo‚¿ÿ"ñ¿`ðŒ ^°Íð ððz2 ðp c ð$€‡Šp‚¿ÿ"ñ¿`ðÄ^èÌð ððt¢ ðr S ð€Šr‚Àÿÿÿÿ"ñ¿`ðxÆH.ð ððz2 ðë c ð$€‡Šë‚¿ÿ"ñ¿`ðš âÌPð ððB ðS ð¿Ëÿ ?ðµŽ15k™8À»ÔŒt€ ÛÀ!Tt€m”\ t€œX ”t€ÿÿ_PictureBullets³œ9Àµœ9Àÿÿ±Ú™ <'²Ú™ 4ÿæ ³Ú™ D(«ŽÚ™ L驵ڙ ¬¯¶Ú™  «·Ú™ Ô"Ö ÑÑØbÞb » »9À×ßß$båb(»(»9À=*€urn:schemas-microsoft-com:office:smarttags €PlaceType€=*€urn:schemas-microsoft-com:office:smarttags €PlaceName€9*€urn:schemas-microsoft-com:office:smarttags€place€9*€urn:schemas-microsoft-com:office:smarttags€State€ Ìǘ­°±¶ù þ þ&ú%*/ IRT]Ô!Ý!v8|8³8Œ8v<<>>A> ??Ý?à?ç?ê?ó?ö?%A(A•AžA1B:BnDqD{D~DœDŸDŒD¿DÅDÈDÌDÏDëDîDôD÷DÍKÖKÓLØLlMuM„NNŽNœNOORO[OSS)S6SCTLTŽTŒTœTÆT®U·UÜUÞUV"V#V%V³VµV»VœVWWWWWW#W%W)W-W.W0W¥W§WçWðWX XaXiXkXoXpXsX|XXˆXX¢X£XºX»XÀXÁXÐXÒXÕX×X8Y=YDYKY^Y_YuYvYˆYŠYYYZZ&Z'Z2Z6Z7Z9ZQZUZVZXZlZnZoZpZrZtZzZZˆZZ›ZZžZŸZ¡Z£Z©Z«Z®Z°Z³ZµZ¹ZÀZ[[[[([,[-[/[B[D[E[F[V[X[Y[Z[^[g[n[w[[ƒ[„[…[‰[‹[[‘[•[ž[F^I^c!c‚c‡cËwÑw¶xŒxüxyy y(yAyDyGyfyhylyqyŠ{“{|#|X|Z|\|e|‰|’|} }"}+}@}I}^}g}|}}}•}–}™}›}Ÿ} }¥}§}°}±}È}É}Ì}Î}Ò}Ó}Ø}Ú}ã}ä}û}ü}ÿ}~~~ ~ ~~~-~.~1~3~7~8~=~?~Ã~×~PRVX\^bdlmx|Œ’”HITXY[fqxz{|‚„ˆ‚#‚>‚C‚›ƒžƒ°ƒµƒ… ……!…åðË–Ö–›˜€˜Y b B¡K¡€¡‰¡EŠJŠÇŠÌŠò¯õ¯²"²”¹™¹¹ºŸº=»H»T»[»AœHœoœxœzœ­œ³œµœ¶œ‘Ÿ‘Ÿ“Ÿ“Ÿ”Ÿ”Ÿ–Ÿ—Ÿ™ŸšŸœŸŸžŸ¹Ÿ9À (ƒŠr!t! &&Ö&ß&I,S,`7n7¥9š9¥:§:º;À;<<<>>>£>Š>W?Y?‡?‰?Û?Ý?î@ý@ÍAÑAÁBÃBFCICÚCâCoDqD`EcEšGœG?IEIòIõIJ‘J¿KÂKÔLØLôLM"R(RSS$S)S²TŽT-U6UÜUÞUV#VKVNVeVhVV‚VšVVWWWWWW#W%W)W.W¥WšWX XaXiXvX{X…X†X–X—XžX¡XµX·XÕX×XÚXàXäXçXêXY!Y'Y2Y7YAYBYRYSYZY]YpYrYYY“Y™YY YZZ"Z%Z?ZBZ_ZaZ®Z°Z³ZµZ¹ZÀZ[[[[[‘[•[ž[]%]B^E^”`˜`ØdÙd@gCgGiJi»iÌi¬j¯j{llölmƒo‹o‚qŒqys€sv—vËwÑwèwðw—x™xŸx¢x¶xŒxÓxÙxéxïx%yAyByGyKyMyfyhylyryX|Z|s|x|}}"},}@}J}^}h}x}{}’}•}¥}§}¬}¯}Å}È}Ø}Ú}ß}â}ø}û} ~ ~~~*~-~=~?~H~J~P~S~f~l~~…~œ~Ÿ~PRVX\^bdhkˆŒ’”—<>DG`d‚„ˆŽñò ‚ ‚>‚D‚6ƒBƒ“ƒ”ƒ›ƒžƒÁƒßƒO„[„ž„ª„Í„Ï„… …V…\……‘…6†:†–†Ÿ†Í‰Ñ‰‹‹Š‹÷‘ù‘í’ú’ß“æ“%—(—˜˜œœ&žžwžzžœ ¢ Í Ð ¢ ¢†€‰€¿€Ã€Ò¥Ù¥–¬š¬Ž­º­w®|®ø®þ®œ¯Ÿ¯Í²Ô²š³±³àŽâŽ'¶+¶"·(·oœ®œ³œµœ¶œ‘Ÿ‘Ÿ“Ÿ“Ÿ”Ÿ”Ÿ–Ÿ—Ÿ™ŸšŸœŸŸžŸ¹ŸÀÀÀÀ$À%À'À(À,À-À/À0À9À33333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333¹ä3 _ yDšDºDÊDS"SŠSÂSÄSàS>TxT¯TÏT£W¬WXX?YZYZZ®ZÂZ[[[ [êfgŒwÇwÉwæw”xxdy€yI|T|V|p|þ|}}£}Á}Ö}ô} ~&~;~…ÁÉ9B€’ï‚‘ƒŸƒG‰t‰³˜™;™R™>¹”¹Ã¹×¹ºDº»+»«»æ»AœVœoœ®œ³œµœ¶œ‘Ÿ‘Ÿ“Ÿ“Ÿ”Ÿ”Ÿ–Ÿ—Ÿ™ŸšŸœŸŸžŸ¹ŸŒŸŸŸÞŸàŸèŸêŸõŸ÷ŸûŸýŸ¿¿¿ ¿ ¿ ¿¿¿¿¿Ð¿Ò¿Ú¿Ü¿ã¿å¿õ¿÷¿þ¿ÀÀ À À ÀÀÀÀÀÀÀÀ$À%À'À(À,À-À/À0À9Àzœ­œ³œµœ¶œ‘Ÿ‘Ÿ“Ÿ“Ÿ”Ÿ”Ÿ–Ÿ—Ÿ™ŸšŸœŸŸžŸ¹Ÿ9À‚IFT ÿa@úTØ24ÿÿÿÿÿÿÿÿÿ~ v<†N%ÿÿÿÿÿÿÿÿÿ(} wX€Víÿÿÿÿÿÿÿÿÿ„Є˜þÆÐ^„Ð`„˜þOJQJo(‡hˆH·ð„Є˜þÆÐ^„Ð`„˜þ5B*OJPJQJ^Jo(phØð€„ „˜þÆ ^„ `„˜þOJQJ^Jo(‡hˆHo€„p„˜þÆp^„p`„˜þOJQJo(‡hˆH§ð€„@ „˜þÆ@ ^„@ `„˜þOJQJo(‡hˆH·ð€„„˜þÆ^„`„˜þOJQJ^Jo(‡hˆHo€„à„˜þÆà^„à`„˜þOJQJo(‡hˆH§ð€„°„˜þÆ°^„°`„˜þOJQJo(‡hˆH·ð€„€„˜þÆ€^„€`„˜þOJQJ^Jo(‡hˆHo€„P„˜þÆP^„P`„˜þOJQJo(‡hˆH§ð„ „0ýÆ ^„ `„0ýo()€ „„˜þÆ^„`„˜þ‡hˆH.‚ „Ø „LÿÆØ ^„Ø `„Lÿ‡hˆH.€ „š „˜þÆš ^„š `„˜þ‡hˆH.€ „x„˜þÆx^„x`„˜þ‡hˆH.‚ „H„LÿÆH^„H`„Lÿ‡hˆH.€ „„˜þÆ^„ðä`A Great Course to Enhance Undergraduate Mathematics Curriculum: Coding Theory and Cryptographyaydinn Normal.dot$Library and Information Services74Microsoft Office Word@âÁý@:ÆßTÔÇ@„^}sÌÇ@М·±PÈPf¡þÿÕÍ՜.“—+,ù®DÕÍ՜.“—+,ù®˜T hpˆ˜  DocumentSummaryInformation8ÿÿÿÿÿÿÿÿÿÿÿÿNðCompObjÿÿÿÿÿÿÿÿÿÿÿÿZqÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿš°žÀ È 3äKenyon CollegeX`Vœº _A Great Course to Enhance Undergraduate Mathematics Curriculum: Coding Theory and Cryptography TitleX 8@ _PID_HLINKSäA pb>8http://www.cecs.csulb.edu/~ebert/hatProblem/nyTimes.htm +mailto:aydinn@kenyon.edu þÿ ÿÿÿÿ ÀFMicrosoft Office Word Document MSWordDocWord.Document.8ô9²q`„˜þ‡hˆH.€ „脘þÆè^„è`„˜þ‡hˆH.‚ „ž„LÿÆž^„ž`„Lÿ‡hˆH.h„Є˜þÆÐ^„Ð`„˜þ5\‡hˆH.h „ „˜þÆ ^„ `„˜þ‡hˆH.’h „p„LÿÆp^„p`„Lÿ‡hˆH.h „@ „˜þÆ@ ^„@ `„˜þ‡hˆH.h „„˜þÆ^„`„˜þ‡hˆH.’h „à„LÿÆà^„à`„Lÿ‡hˆH.h „°„˜þÆ°^„°`„˜þ‡hˆH.h „€„˜þÆ€^„€`„˜þ‡hˆH.’h „P„LÿÆP^„P`„Lÿ‡hˆH.‚IFT(} w~ va@úTÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿô»¶        ÂOŽü        ÒÞ>*        eådf‡ašyp ÆjFÚvÀ²).6x8‹vD. Î3 ”^ xY ¯j   al ‚LUtKK»„[öÁr"}M:•Fë&T-LLQåû7±= ²Y b} }t!zE"šB#‰($SK$i`$§%?&Z1&’:'Ÿ](?4*N,€,,ó8,}A,uX,-¯#- k-¹z- 5.)w..^0°.13Q1,c4€5Š.5ã62 7Š7I7g#9e99ìQ:úv:*S;_<z<?Ñ?mA@xu@“iAŽXCSDXDFâ!FTsR«/UkU~*V·pXjkYI[ê[ªX[+z[08]&O`p\aãb‚Vb2ckFcœQcT_e÷dfgDg•iãAiei}iºulFrmæ+nEEn5Qn;lnO o`%oXoa{ošpøhp2{qÃ=r«]s7,t_>t|RuX*vî/w&yADy.Ry—)z2Wz¶]{ñn{š1|Þ;|ä6~]~~J à€<Ö‚n ‚3&‚K‚£R‚|%ƒ*ƒ‘?ƒ^BƒyA„\J„ <…‘5†eYˆ; ‰l*ŠùXŠ7^ŠÚvŠ'SÒtKŽ@LŽvlVqó&‘H:‘’<’Ñe“A”s:”\O”§w”î@•Ž?–h—Jm—&˜/D˜-b™|(š…FšfVš’pš›m›°?œð~EŸŒOŸ¶- I R[ bc Ž ¡„¡¶y¡5%¢V¢]£ŒZ€%¥dqŠÏ šJªÅ5ªa5«ö|«1¬ô1­Ú%®–J°dN°—k±P²G$³ŽŠ·$+·Ò7·8ž:H¹b>ºU_ºíŒp?ŒÀuŒÅIœUœUŸHSŸ"V¿>%Á2ZÁâdÁvÁ ÂÂÂŽOÅÇ0{Çä/ÈÖ É)$ɒ^Ê aÊA ˗lËòwËø1ÍQ>͗KÍwÍH>ÎÏGLÏCrÏsBьIÒw Ó[Ó?ԃQÕjÕB× ×Í×éØžQØBٞÚÑfÚJQÛAÜo9Ü}_Ý6;ÞÅàVKàŸcà0 á–4á=AáxláS*â„/âY9âkrâ*äá?äTGäPzæÜçY"è&JèzWèHaè‰bè&Dé;êçGëÜì^UìSíLrîÓJï-ñŒDò‚%ó=IóIróœvóÈKôB_ôõõ >õ—wõâ>öûjö$6÷é}÷#ù£8ùoùvú¬YûoûEyûoý„-ýüIþ3ÿšZÿ®œŽœµœ¶œ9À0%.%.ÿ@€zœzœÜ– zœzœ8À`@ÿÿUnknownÿÿÿÿÿÿÿÿÿÿÿÿG‡z €ÿTimes New Roman5€Symbol3& ‡z €ÿArial?5 ‡z €ÿCourier New;†SimSun‹[SO;€Wingdings"1ˆðÐh’²·P4Á» žfJ[dPf¡`XPf¡`X!ð쎎4dVœVœ 2ƒqðHP ðÿ?äÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿšy2ÿÿ^A Great Course to Enhance Undergraduate Mathematics Curriculum: Coding Theory and Cryptographyaydinn Library and Information Services