Quick Brute Force Code for C++

SUBMITTED BY: LeeechGather

DATE: Dec. 5, 2018, 9:23 p.m.

FORMAT: C++

SIZE: 27.4 kB

Raw Download

HITS: 332

Report
  1. */ this code is for a quick, simple and easy brute force program created by myself. Please report any bugs, this is still a work in progress but works, we're constantly updating. Thanks all involved/*
  3. #include <iostream>
  4. #include <ctime>
  5. using namespace std;
  6. string crackPassword(string pass);
  7. long long int attempt;
  8. clock_t start_t, end_t;
  10. int main(){
  11. string password;
  13. cout << "Enter the password to crack : ";
  14. cin >> password;
  16. cout << endl << endl << endl << ">\n>> CRACKED THE PASSWORD! >>\n>" << endl << endl <<"The password : " << crackPassword(password) << endl;
  17. cout << "The number of attempts : " << attempt << endl;
  18. cout << "The time duration passed : " << (double)(end_t - start_t)/1000 << " seconds" << endl << endl;
  19. return 0;
  20. }
  22. string crackPassword(string pass){
  23. int digit[7],alphabetSet=1,passwordLength=1;
  24. start_t = clock();
  26. string test,alphabet = "1337 also daktari is pro";
  27. while(1){
  30. switch(passwordLength){
  31. case 1:
  32. while(alphabetSet<4){
  33. switch(alphabetSet){
  34. case 1 : alphabet = "-0123456789";
  35. cout << endl << endl <<"Testing only digits(0123456789) - 10 Characters, please wait"; break;
  36. case 2 : alphabet = "-abcdefghijklmnopqrstuvwxyz";
  37. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing only lowercase characters(abcdefghijklmnopqrstuvwxyz) - 26 Characters, please wait"; break;
  38. case 3 : alphabet = "-ABCDEFGHIJKLMNOPQRSTUVWXYZ";
  39. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing only uppercase characters(ABCDEFGHIJKLMNOPQRSTUVWXYZ) - 26 Characters, please wait"; break;
  40. }
  42. for(digit[0]=1;digit[0]<alphabet.length();digit[0]++){
  43. attempt++;
  44. if(attempt%2500000==0) cout << ".";
  45. test=alphabet[digit[0]];
  46. for(int i=1;i<passwordLength;i++)
  47. if(alphabet[digit[i]]!='-')test+=alphabet[digit[i]];
  48. if(pass.compare(test)==0){end_t = clock(); return test;}
  49. }
  50. alphabetSet++;
  51. }
  52. break;
  53. case 2:
  54. alphabetSet=1;
  55. while(alphabetSet<6){
  56. switch(alphabetSet){
  57. case 1 : alphabet = "-0123456789";
  58. cout << endl << endl <<"Testing only digits(0123456789) - 10 Characters, please wait"; break;
  59. case 2 : alphabet = "-abcdefghijklmnopqrstuvwxyz";
  60. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing only lowercase characters(abcdefghijklmnopqrstuvwxyz) - 26 Characters, please wait"; break;
  61. case 3 : alphabet = "-ABCDEFGHIJKLMNOPQRSTUVWXYZ";
  62. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing only uppercase characters(ABCDEFGHIJKLMNOPQRSTUVWXYZ) - 26 Characters, please wait"; break;
  63. case 4 : alphabet = "-0123456789abcdefghijklmnopqrstuvwxyz";
  64. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase characters and numbers(0123456789abcdefghijklmnopqrstuvwxyz) - 36 Characters, please wait"; break;
  65. case 5 : alphabet = "-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
  66. }
  69. for(digit[1]=0;digit[1]<alphabet.length();digit[1]++)
  70. for(digit[0]=1;digit[0]<alphabet.length();digit[0]++){
  71. attempt++;
  72. if(attempt%2500000==0) cout << ".";
  73. test=alphabet[digit[0]];
  74. for(int i=1;i<passwordLength;i++)
  75. if(alphabet[digit[i]]!='-')test+=alphabet[digit[i]];
  76. if(pass.compare(test)==0){end_t = clock(); return test;}
  77. }
  78. alphabetSet++;
  79. }
  80. break;
  81. case 3:
  82. alphabetSet=1;
  83. while(alphabetSet<8){
  84. switch(alphabetSet){
  85. case 1 : alphabet = "-0123456789";
  86. cout << endl << endl <<"Testing only digits(0123456789) - 10 Characters, please wait"; break;
  87. case 2 : alphabet = "-abcdefghijklmnopqrstuvwxyz";
  88. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing only lowercase characters(abcdefghijklmnopqrstuvwxyz) - 26 Characters, please wait"; break;
  89. case 3 : alphabet = "-ABCDEFGHIJKLMNOPQRSTUVWXYZ";
  90. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing only uppercase characters(ABCDEFGHIJKLMNOPQRSTUVWXYZ) - 26 Characters, please wait"; break;
  91. case 4 : alphabet = "-0123456789abcdefghijklmnopqrstuvwxyz";
  92. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase characters and numbers(0123456789abcdefghijklmnopqrstuvwxyz) - 36 Characters, please wait"; break;
  93. case 5 : alphabet = "-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
  94. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing uppercase characters and numbers(0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ) - 36 Characters, please wait"; break;
  95. case 6 : alphabet = "-abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
  96. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase, uppercase characters(abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ) - 52 Characters, please wait"; break;
  97. case 7 : alphabet = "-0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
  98. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase, uppercase characters and numbers(0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ) - 62 Characters, please wait"; break;
  99. }
  100. for(digit[2]=0;digit[2]<alphabet.length();digit[2]++)
  101. for(digit[1]=0;digit[1]<alphabet.length();digit[1]++)
  102. for(digit[0]=1;digit[0]<alphabet.length();digit[0]++){
  103. attempt++;
  104. if(attempt%2500000==0) cout << ".";
  105. test=alphabet[digit[0]];
  106. for(int i=1;i<passwordLength;i++)
  107. if(alphabet[digit[i]]!='-')test+=alphabet[digit[i]];
  108. if(pass.compare(test)==0){end_t = clock(); return test;}
  109. }
  110. alphabetSet++;
  111. }
  112. break;
  113. case 4:
  114. alphabetSet=1;
  115. while(alphabetSet<8){
  116. switch(alphabetSet){
  117. case 1 : alphabet = "-0123456789";
  118. cout << endl << endl <<"Testing only digits(0123456789) - 10 Characters, please wait"; break;
  119. case 2 : alphabet = "-abcdefghijklmnopqrstuvwxyz";
  120. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing only lowercase characters(abcdefghijklmnopqrstuvwxyz) - 26 Characters, please wait"; break;
  121. case 3 : alphabet = "-ABCDEFGHIJKLMNOPQRSTUVWXYZ";
  122. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing only uppercase characters(ABCDEFGHIJKLMNOPQRSTUVWXYZ) - 26 Characters, please wait"; break;
  123. case 4 : alphabet = "-0123456789abcdefghijklmnopqrstuvwxyz";
  124. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase characters and numbers(0123456789abcdefghijklmnopqrstuvwxyz) - 36 Characters, please wait"; break;
  125. case 5 : alphabet = "-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
  126. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing uppercase characters and numbers(0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ) - 36 Characters, please wait"; break;
  127. case 6 : alphabet = "-abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
  128. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase, uppercase characters(abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ) - 52 Characters, please wait"; break;
  129. case 7 : alphabet = "-0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
  130. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase, uppercase characters and numbers(0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ) - 62 Characters, please wait"; break;
  131. }
  133. for(digit[3]=0;digit[3]<alphabet.length();digit[3]++)
  134. for(digit[2]=0;digit[2]<alphabet.length();digit[2]++)
  135. for(digit[1]=0;digit[1]<alphabet.length();digit[1]++)
  136. for(digit[0]=1;digit[0]<alphabet.length();digit[0]++){
  137. attempt++;
  138. if(attempt%2500000==0) cout << ".";
  139. test=alphabet[digit[0]];
  140. for(int i=1;i<passwordLength;i++)
  141. if(alphabet[digit[i]]!='-')test+=alphabet[digit[i]];
  142. if(pass.compare(test)==0){end_t = clock(); return test;}
  143. }
  144. alphabetSet++;
  145. }
  146. break;
  147. case 5:
  148. alphabetSet=1;
  149. while(alphabetSet<8){
  150. switch(alphabetSet){
  151. case 1 : alphabet = "-0123456789";
  152. cout << endl << endl <<"Testing only digits(0123456789) - 10 Characters, please wait"; break;
  153. case 2 : alphabet = "-abcdefghijklmnopqrstuvwxyz";
  154. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing only lowercase characters(abcdefghijklmnopqrstuvwxyz) - 26 Characters, please wait"; break;
  155. case 3 : alphabet = "-ABCDEFGHIJKLMNOPQRSTUVWXYZ";
  156. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing only uppercase characters(ABCDEFGHIJKLMNOPQRSTUVWXYZ) - 26 Characters, please wait"; break;
  157. case 4 : alphabet = "-0123456789abcdefghijklmnopqrstuvwxyz";
  158. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase characters and numbers(0123456789abcdefghijklmnopqrstuvwxyz) - 36 Characters, please wait"; break;
  159. case 5 : alphabet = "-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
  160. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing uppercase characters and numbers(0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ) - 36 Characters, please wait"; break;
  161. case 6 : alphabet = "-abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
  162. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase, uppercase characters(abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ) - 52 Characters, please wait"; break;
  163. case 7 : alphabet = "-0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
  164. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase, uppercase characters and numbers(0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ) - 62 Characters, please wait"; break;
  165. }
  166. for(digit[4]=0;digit[4]<alphabet.length();digit[4]++)
  167. for(digit[3]=0;digit[3]<alphabet.length();digit[3]++)
  168. for(digit[2]=0;digit[2]<alphabet.length();digit[2]++)
  169. for(digit[1]=0;digit[1]<alphabet.length();digit[1]++)
  170. for(digit[0]=1;digit[0]<alphabet.length();digit[0]++){
  171. attempt++;
  172. if(attempt%2500000==0) cout << ".";
  173. test=alphabet[digit[0]];
  174. for(int i=1;i<passwordLength;i++)
  175. if(alphabet[digit[i]]!='-')test+=alphabet[digit[i]];
  176. if(pass.compare(test)==0){end_t = clock(); return test;}
  177. }
  178. alphabetSet++;
  179. }
  180. break;
  181. case 6:
  182. alphabetSet=1;
  183. while(alphabetSet<8){
  184. switch(alphabetSet){
  185. case 1 : alphabet = "-0123456789";
  186. cout << endl << endl <<"Testing only digits(0123456789) - 10 Characters, please wait"; break;
  187. case 2 : alphabet = "-abcdefghijklmnopqrstuvwxyz";
  188. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing only lowercase characters(abcdefghijklmnopqrstuvwxyz) - 26 Characters, please wait"; break;
  189. case 3 : alphabet = "-ABCDEFGHIJKLMNOPQRSTUVWXYZ";
  190. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing only uppercase characters(ABCDEFGHIJKLMNOPQRSTUVWXYZ) - 26 Characters, please wait"; break;
  191. case 4 : alphabet = "-0123456789abcdefghijklmnopqrstuvwxyz";
  192. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase characters and numbers(0123456789abcdefghijklmnopqrstuvwxyz) - 36 Characters, please wait"; break;
  193. case 5 : alphabet = "-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
  194. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing uppercase characters and numbers(0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ) - 36 Characters, please wait"; break;
  195. case 6 : alphabet = "-abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
  196. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase, uppercase characters(abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ) - 52 Characters, please wait"; break;
  197. case 7 : alphabet = "-0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
  198. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase, uppercase characters and numbers(0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ) - 62 Characters, please wait"; break;
  199. }
  200. for(digit[5]=0;digit[5]<alphabet.length();digit[5]++)
  201. for(digit[4]=0;digit[4]<alphabet.length();digit[4]++)
  202. for(digit[3]=0;digit[3]<alphabet.length();digit[3]++)
  203. for(digit[2]=0;digit[2]<alphabet.length();digit[2]++)
  204. for(digit[1]=0;digit[1]<alphabet.length();digit[1]++)
  205. for(digit[0]=1;digit[0]<alphabet.length();digit[0]++){
  206. attempt++;
  207. if(attempt%2500000==0) cout << ".";
  208. test=alphabet[digit[0]];
  209. for(int i=1;i<passwordLength;i++)
  210. if(alphabet[digit[i]]!='-')test+=alphabet[digit[i]];
  211. if(pass.compare(test)==0){end_t = clock(); return test;}
  212. }
  213. alphabetSet++;
  214. }
  215. break;
  216. case 7:
  217. alphabetSet=1;
  218. while(alphabetSet<8){
  219. switch(alphabetSet){
  220. case 1 : alphabet = "-0123456789";
  221. cout << endl << endl <<"Testing only digits(0123456789) - 10 Characters, please wait"; break;
  222. case 2 : alphabet = "-abcdefghijklmnopqrstuvwxyz";
  223. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing only lowercase characters(abcdefghijklmnopqrstuvwxyz) - 26 Characters, please wait"; break;
  224. case 3 : alphabet = "-ABCDEFGHIJKLMNOPQRSTUVWXYZ";
  225. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing only uppercase characters(ABCDEFGHIJKLMNOPQRSTUVWXYZ) - 26 Characters, please wait"; break;
  226. case 4 : alphabet = "-0123456789abcdefghijklmnopqrstuvwxyz";
  227. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase characters and numbers(0123456789abcdefghijklmnopqrstuvwxyz) - 36 Characters, please wait"; break;
  228. case 5 : alphabet = "-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
  229. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing uppercase characters and numbers(0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ) - 36 Characters, please wait"; break;
  230. case 6 : alphabet = "-abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
  231. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase, uppercase characters(abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ) - 52 Characters, please wait"; break;
  232. case 7 : alphabet = "-0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
  233. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase, uppercase characters and numbers(0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ) - 62 Characters, please wait"; break;
  234. }
  235. for(digit[6]=0;digit[6]<alphabet.length();digit[6]++)
  236. for(digit[5]=0;digit[5]<alphabet.length();digit[5]++)
  237. for(digit[4]=0;digit[4]<alphabet.length();digit[4]++)
  238. for(digit[3]=0;digit[3]<alphabet.length();digit[3]++)
  239. for(digit[2]=0;digit[2]<alphabet.length();digit[2]++)
  240. for(digit[1]=0;digit[1]<alphabet.length();digit[1]++)
  241. for(digit[0]=1;digit[0]<alphabet.length();digit[0]++){
  242. attempt++;
  243. if(attempt%2500000==0) cout << ".";
  244. test=alphabet[digit[0]];
  245. for(int i=1;i<passwordLength;i++)
  246. if(alphabet[digit[i]]!='-')test+=alphabet[digit[i]];
  247. if(pass.compare(test)==0){end_t = clock(); return test;}
  248. }
  249. alphabetSet++;
  250. }
  251. break;
  252. case 8:
  253. alphabetSet=1;
  254. while(alphabetSet<8){
  255. switch(alphabetSet){
  256. case 1 : alphabet = "-0123456789";
  257. cout << endl << endl <<"Testing only digits(0123456789) - 10 Characters, please wait"; break;
  258. case 2 : alphabet = "-abcdefghijklmnopqrstuvwxyz";
  259. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing only lowercase characters(abcdefghijklmnopqrstuvwxyz) - 26 Characters, please wait"; break;
  260. case 3 : alphabet = "-ABCDEFGHIJKLMNOPQRSTUVWXYZ";
  261. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing only uppercase characters(ABCDEFGHIJKLMNOPQRSTUVWXYZ) - 26 Characters, please wait"; break;
  262. case 4 : alphabet = "-0123456789abcdefghijklmnopqrstuvwxyz";
  263. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase characters and numbers(0123456789abcdefghijklmnopqrstuvwxyz) - 36 Characters, please wait"; break;
  264. case 5 : alphabet = "-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
  265. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing uppercase characters and numbers(0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ) - 36 Characters, please wait"; break;
  266. case 6 : alphabet = "-abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
  267. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase, uppercase characters(abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ) - 52 Characters, please wait"; break;
  268. case 7 : alphabet = "-0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
  269. cout << endl << endl << "Couldn't find the password, increasing the searching level."<< endl << endl << "Testing lowercase, uppercase characters and numbers(0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ) - 62 Characters, please wait"; break;
  270. }
  271. for(digit[7]=0;digit[7]<alphabet.length();digit[7]++)
  272. for(digit[6]=0;digit[6]<alphabet.length();digit[6]++)
  273. for(digit[5]=0;digit[5]<alphabet.length();digit[5]++)
  274. for(digit[4]=0;digit[4]<alphabet.length();digit[4]++)
  275. for(digit[3]=0;digit[3]<alphabet.length();digit[3]++)
  276. for(digit[2]=0;digit[2]<alphabet.length();digit[2]++)
  277. for(digit[1]=0;digit[1]<alphabet.length();digit[1]++)
  278. for(digit[0]=1;digit[0]<alphabet.length();digit[0]++){
  279. attempt++;
  280. if(attempt%2500000==0) cout << ".";
  281. test=alphabet[digit[0]];
  282. for(int i=1;i<passwordLength;i++)
  283. if(alphabet[digit[i]]!='-')test+=alphabet[digit[i]];
  284. if(pass.compare(test)==0){end_t = clock(); return test;}
  285. }
  286. alphabetSet++;
  287. }
  288. break;
  289. }
  290. cout << endl << endl << endl << endl << "*" << endl;
  291. cout << "*** Password length is not " << passwordLength << ". Increasing password length! ***";
  292. cout << endl << "*" << endl << endl;
  293. passwordLength++;
  294. }
  295. }
comments powered by Disqus