#描述#
Do Not Be Confused! There is no input and output description for this problem. I wrote it, but I think it is too easy for you all. So I encrypted it.
<br>
The procedure is like this：
<br>
1, I wrote the description，stored it in a text file namely a.txt.
<br>
2, Then I wrote a program to read all content in file a.txt.
<br>
3, For every character(ASCII), after doing an operator xor with 1, I stored it into another file b.txt sequently.
<br>
4, The content of b.txt is "Bnofsutmuhnor !Xnt!iwd!fnu!uid!jdx !On!hoqtu-!xnt!ktru!odde!un!ntuqtu!#Vdmbnld!un![KTU!@BL.HBQB!Udl #!vhuintu!uid!ptnu`uhno/" without the quotation.
<br>
<br>
so...if you want to solve this problem, just decrypt it...

#格式#
##输入格式##
blank...

##输出格式##
blank...

#样例1#
##样例输入1##

blank...

##样例输出1##

blank...

#限制#
1000ms
32768KB

#提示#

#来源#
zjut_DD