US. Appl. No. 10/066,060, filed Jan. 31, 2002, Steven Teig, Application with same specification and drawings as U.S. Appl. No. 10/066,094,
which is a parent application of the present application. cited by other
.
U.S. Appl. No. 10/066,160, filed Jan. 31, 2002, Steven Teig et al., Application with same specification and drawings as U.S. Appl. No. 10/066,094, which is a parent application of the present application. cit- ed by other
.
U.S. Appl. No. 10/066,095, filed Jan. 31, 2002, Steven Teig et al., Application with same specification and drawings as U.S. Appl. No. 10/066,094, which is a parent application of the present application. cit- ed by other
.
U.S. Appl. No. 10/066,047, filed Jan. 31, 2002, Steven Teig et al., Application with same specification and drawings as U.S. Appl. No. 10/066,094, which is a parent application of the present application. cit- ed by other
.
U.S. Appl. No. 10/061,641, filed Jan. 31, 2002, Steven Teig et al., Application with same specification and drawings as U.S. Appl. No. 10/066,094, which is a parent application of the present application. cit- ed by other
.
U.S. Appl. No. 10/066,094, filed Jan. 31, 2002, Steven Teig et al., Per the preliminary amendment dated May 30, 2003, the present application is a CIP of this application. cited by other
.
U.S. Appl. No. 10/076,121, filed Feb. 12, 2002, Steven Teig, Per the preliminary amendment dated May 30, 2003, the present application is a CIP of this application. cited by other
.
U.S. Appl. No. 10/062,995, filed Jan. 31, 2002, Steven Teig et al., Application with same specification and drawings as U.S. Appl. No. 10/066,094, which is a parent application of the present application. cit- ed by other
.
U.S. Appl. No. 10/066,102, filed Jan. 31, 2002, Steven Teig, Application with same specification and drawings as U.S. Appl. No. 10/066,094, which is a parent application of the present application. cited by other
.
U.S. Appl. No. 10/066,187, filed Jan. 31, 2002, Steven Teig et al., Application with same specification and drawings as U.S. Appl. No. 10/066,094, which is a parent application of the present application. cit- ed by other
.
U.S. Appl. No. 10/228,736, filed Aug. 26, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,563. cited by other
.
U.S. Appl. No. 10/229,311, filed Aug. 26, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,563. cited by other
.
U.S. Appl. No. 10/229,108, filed Aug. 26, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,563. cited by other
.
U.S. Appl. No. 10/215,563, filed Aug. 9, 2002, Steven Teig, Application with similar specification and drawings as the present application but with additional material. cited by other
.
U.S. Appl. No. 10/215,896, filed Aug. 9, 2002, Steven Teig, The present application is a continuation of this application. cited by other
.
U.S. Appl. No. 10/219,675, filed Aug. 14, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,896, which is a parent application to the present application. cited by other
.
U.S. Appl. No. 10/219,608, filed Aug. 14, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,896, which is a parent application to the present application. cited by other
.
U.S. Appl. No. 10/229,196, filed Aug. 26, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,563. cited by other
.
U.S. Appl. No. 10/288,870, filed Nov. 6, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/076,121, which is a parent application to the present application cited by other
.
U.S. Appl. No. 10/219,923, filed Aug. 14, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,896, which is a parent application to the present application. cited by other
.
U.S. Appl. No. 10/286,254, filed Oct. 31, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,896, which is a parent application to the present application. cited by other
.
U.S. Appl. No. 10/219,706, filed Aug. 14, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,896, which is a parent application to the present application. cited by other
.
U.S. Appl. No. 10/231,423, filed Aug. 28, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,896, which is a parent application to the present application. cited by other
.
U.S. Appl. No. 10/230,503, filed Aug. 28, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,896, which is a parent application to the present. cited by other
.
U.S. Appl. No. 10/222,088, filed Aug. 14, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,896, which is a parent application to the present application. cited by other
.
U.S. Appl. No. 10/228,679, filed Aug. 26, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,563. cited by other
.
U.S. Appl. No. 10/229,202, filed Aug. 26, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,563. cited by other
.
U.S. Appl. No. 10/229,170, filed Aug. 26, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,563. cited by other
.
U.S. Appl. No. 10/286,630, filed Oct. 31, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,563. cited by other
.
U.S. Appl. No. 10/230,504, filed Aug. 28, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,563. cited by other
.
U.S. Appl. No. 10/215,923, filed Aug. 9, 2002, Steven Teig, Application regarding path search technology described in the present application. cited by other
.
U.S. Appl. No. 10/226,483, filed Aug. 23, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,923. cited by other
.
U.S. Appl. No. 10/226,774, filed Aug. 23, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,923. cited by other
.
U.S. Appl. No. 10/232,795, filed Aug. 28, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,923. cited by other
.
U.S. Appl. No. 10/231,369, filed Aug. 28, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,923. cited by other
.
U.S. Appl. No. 10/233,312, filed Aug. 28, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,923. cited by other
.
U.S. Appl. No. 10/227,016, filed Aug. 23, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,923. cited by other
.
U.S. Appl. No. 10/226,482, filed Aug. 23, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,923. cited by other
.
U.S. Appl. No. 10/285,844, filed Oct. 31, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,923. cited by other
.
U.S. Appl. No. 10/286,253, filed Oct. 31, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,923. cited by other
.
U.S. Appl. No. 10/288,033, filed Nov. 5, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,923. cited by other
.
U.S. Appl. No. 10/335,179, filed Dec. 31, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,923. cited by other
.
U.S. Appl. No. 10/285,758, filed Oct. 31, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,923. cited by other
.
U.S. Appl. No. 10/286,598, filed Oct. 31, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,896, which is a parent application to the present. cited by other
.
U.S. Appl. No. 10/286,584, filed Oct. 31, 2002, Steven Teig, Continuation of U.S. Appl. No. 10/215,896, which is a parent application to the present application. cited by other
.
U.S. Appl. No. 10/335,074, filed Dec. 31, 2002, Steven Teig et al., CIP of U.S. Appl. No. 10/215,923, U.S. Appl. No. 10/215,896, and U.S. Appl. No. 10/215,563. cited by other
.
U.S. Appl. No. 10/334,665, filed Dec. 31, 2002, Steven Teig et al., CIP of U.S. Appl. No. 10/215,923, U.S. Appl. No. 10/215,896, and U.S. Appl. No. 10/215,563. cited by other
.
U.S. Appl. No. 10/335,243, filed Dec. 31, 2002, Steven Teig et al., CIP of U.S. Appl. No. 10/215,923, U.S. Appl. No. 10/215,896, and U.S. Appl. No. 10/215,563. cited by other
.
U.S. Appl. No. 10/335,062, filed Dec. 31, 2002, Steven Teig, CIP of U.S. Appl. No. 10/215,923, U.S. Appl. No. 10/215,896, and U.S. Appl. No. 10/215,563. cited by other
.
Chen, H.F. et al., A Faster Algorithm for Rubber-Band Equivalent Transformation for Planar VLSI Layouts, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 15, No. 2, Feb. 1996, pp. 217-227. cited by other
.
Chip Model with Wiring Cost Map, Aug. 1983, IBM Technical Disclosure Bulletin, vol. 26, issu. 3A, pp. 929-933. cited by other
.
Dayan, T. et al., Layer Assignment for Rubber Band Routing, UCSC-CRI-93-04, Jan. 20, 1993. cited by other
.
Dayan, T., Rubber-Band Based Topological Router, A Dissertation, UC Santa Cruz, Jun. 1997. cited by other
.
Dood, P. et al. A Two-Dimensional Topological Compactor with Octagonal Geometry, 28.sup.th ACM/IEEE Design Automation Conference, pp. 727-731, Jul. 1991. cited by other
.
Fujimura, K. et al, Homotopic Shape Deformation. cited by other
.
Hama, T. et al., Curvilinear Detailed Routing Algorithm and its Extension to Wire-Spreading and Wire-Fattening. cited by other
.
Hama, T. et al., Topological Routing Path Search Algorithm with Incremental Routability Test, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 18, No. 2, Feb. 1999, pp. 142-150. cited by other
.
Kobayashi, K. et al., A New Interactive Analog Layout Methodology based on Rubber-Band Routing, UCSC-CRL-96-12, Jun. 13, 1996. cited by other
.
Lim, A. et al, A Fast Algorithm To Test Planar Topological Routability, Technical Report 94-012, pp. 1-16. cited by other
.
Lu, Y., Dynamic Constrained Delaunay Triangulation and Application to Multichip Module Layout, A Thesis for Master of Science, UC Santa Cruz, Dec. 1991. cited by other
.
Maley, F.M., Testing Homotopic Routability Under Polygonal Wiring Rules, Algorithmica 1996, 15: 1-16. cited by other
.
Morton, P. B. et al., An Efficient Sequential Quadratic Programming Formulation of Optimal Wire Spacing for Cross-Talk Noise Avoidance Routing, UCSC-CRL-99-05, Mar. 10, 1999. cited by other
.
NN71091316, Use of Relatively Diagonal And Rectangular Wiring Planes n Multilayer Packages, Sep. 1971, IBM Technical Disclosure Bulletin, vol. No. 14, Issue No. 4, pp. 1316-1317. cited by other
.
Staepelaere, D. et al., Geometric Transformations for a Rubber-Band Sketch, A Thesis for a Master of Science in Computer Engineering, UCSC, Sep. 1992. cited by other
.
Staepelaere, D. et al., Surf: A Rubber-Band Routing System for Multichip Modules, pp. 18-26, 1993. cited by other
.
Su, J. et al., Post-Route Optimization for Improved Yield Using Rubber-Band Wiring Model, 1997 International Conference on Computer-Aided Design, pp. 700-706, Nov. 1997. cited by other
.
Wei-Ming Dai, W. et al., Routability of a Rubber-Band Sketch. 28.sup.th ACM-IEEE Design Automation Conference, 1991. pp. 45-65. cited by other
.
Xing, Z. et al., A Minimum Cost Path Search Algorithm Through Tile Obstacles, slide presentation. cited by other
.
Xing, Z. et al., Shortest Path Search Using Tiles and Piecewise Linear Cost Propagation, IEEE, 2002, pp. 145-158. cited by other
.
Xu, A More Efficient Distance Vector Routing Algorithm, UCSC-CRL-96-18, Mar. 1997. cited by other
.
Yu, M.-F. et al., Fast and Incremental Routability Check of a Topological Routing Using a Cut-Based Encoding, UCSC-CRL-97-07, Apr. 14, 1997. cited by other
.
Yu, M.-F. et al, Interchangeable Pin Routing with Application to Package Layout, UCSC-CRL-96-10, Apr. 25, 1996. cited by other
.
Yu, M.-F. et al., Pin Assignment and Routing on a Single-Layer Pin Grid Array, UCSC-CRL-95-15, Feb. 24, 1995. cited by other
.
Yu, M.-F. et al., Planar Interchangeable 2-Terminal Routing, UCSC-CRL-95-49, Oct. 19, 1995. cited by other
.
Yu, M.-F. et al., Single-Layer Fanout Routing and Routability Analysis for Ball Grid Arrays, UCSC-CRL-95-18, Apr. 25, 1995. cited by other
.
Ahuja, R. et al., Faster Algorithms for the Shortest Path Problem, Journal of the Association for Computing Machinery, vol. 37, No. 2, Apr. 1990, pp. 213-223. cited by other
.
Alexander, M. et al., Performance-Oriented Placement and Routing for field-programmable gate arrays, Proceedings of the European Design Automation Conference, pp. 80-85, 1995. cited by other
.
Alexander, M. et al., Placement and Routing for Performance-Oriented FPGA Layout, VLSI Design, vol. 7, No. 1, 1998. cited by other
.
Andou, H. et al., Automatic Routing Algorithm for VLSI, 22.sup.nd Design Automation Conference, 1985, pp. 785-788. cited by other
.
Bagga, J. et al., Internal, External, and Mixed Visibility Edges of Polygons. cited by other
.
Berger, B. et al., Nearly Optimal Algorithms and Bounds for Multilayer Channel Routing, Journal of the Association for Computing Machinery, pp. 500-542, Mar. 1995. cited by other
.
Brady, L. et al., Channel Routing on a 60.degree. Grid, extended abstract, pp. 926-931. cited by other
.
Carothers, K., A Method of Measuring Nets Routability for MCM's General Area Routing Problems, 1999, pp. 186-192. cited by other
.
Chen, D-S. et al., A Wire-Length Minimization Algorithm for Single-Layer Layouts. cited by other
.
Chen et al., Optimal Algorithms for Bubble Sort Based Non-Manhattan Channel Routing, May 1994, Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions vol.: 13 Issues, pp. 603-609. cited by oth- er
.
Chen, H., Routing L-Shaped Channels in Nonslicing-Structure Placement. 24.sup.th ACM-IEEE Design Automation Conference, pp. 152-165, 1987. cited by other
.
Chen, H. et al., Physical Planning of On-Chip Interconnect Architectures, 2002, IEEE, International Conference, pp. 30-35. cited by other
.
Chen, S.-S. et al., A New Approach to the Ball Grid Array Package Routing, IEICE Trans. Fundamentals, vol. E82-A, No. 11, Nov. 1999, pp. 2599-2608. cited by other
.
Cheng, K. et al., Manhattan or Non Manhattan? A Study of Alternative VLSI Routing Architectures, pp. 47-52, 2000. cited by other
.
Cheng, K., Steiner Problem in Octilinear Routing Model, A Thesis submitted for the Degree of Master of Science, National University Singapore, 1995, pp. 1-122. cited by other
.
Chiang, C. et al., Wirability of Knock-Knee Layouts with 45.degree. Wires, IEEE Transactions on Circuits and Systems, vol. 38, Issue 6, pp. 613-624, Jun. 1991. cited by other
.
Cong, J. et al., Efficient Heuristics for the Minimum Shortest Path Steiner Arborescence Problem with Applications to VLSI Physical Design, Cadence Design Systems, pp. 88-95. cited by other
.
Cong, J. et al., Multilevel Approach to Full Chip Gridless Routing, Nov. 2001, IEEE, pp. 396-403. cited by other
.
Cong, J. et al., Performance Driven Multi-Layer General Routing for PCB/MCM Designs, UCLA Computer Science Department, 1998, pp. 356-361. cit- ed by other
.
Das, S. et al., Channel Routing in Manhattan-Diagonal Model, 9.sup.th International Conference on VLSI Design, Jan. 1996. pp. 43-48. cited by other
.
Das, S. et al., Routing of L-Shaped Channels, Switchboxes and Staircases in Manhattan-Diagonal Model, pp. 65-70, Jan. 1998. cited by other
.
Enbody, R. et al., Near-Optimal n-Layer Channel Routing, 23.sup.rd Design Automation Conference, 1986, pp. 708-714. cited by other
.
Finch, A.C. et al., A Method for Gridless Routing of Printed Circuit Boards, 22.sup.nd Design Automation Conference, 1985, ACM, pp. 509-515. cited by other
.
Gao, S. et al., Channel Routing of Multiterminal Nets, Journal of the Association for Computing Machinery, vol. 41, No. 4, Jul. 1994, pp. 791-818. cited by other
.
Gao, T. et al., Minimum Crosstalk Channel Routing, pp. 692-696, 1993 IEEE. cited by other
.
Gao, T. et al., Minimum Crosstalk Switchbox Routing, pp. 610-615, 1994 ACM. cited by other
.
Gonzalez, T. et al., A Linear Time-Algorithm for Optimal Routing, Journal of the Association for Computing Machinery, vol. 35, No. 4, Oct. 1988, pp. 810-831. cited by other
.
Guibas, L. et al., Optimal Shortest path Queries in a Simple Polygon, 1987 ACM, pp. 50-63. cited by other
.
Hachtel, G.D. et al., Linear Complexity Algorithms for Hierarchical Routing, Jan. 1989, IEEE, pp. 64-80. cited by other
.
Hershberger, J., Efficient Breakout Routing in Printed Circuit Boards, Computational Geometry, 1997, ACM, pp. 460-462. cited by other
.
Hershberger, J., Finding the Visbility Graph of a Simple Polygon in Time Proportional to its Size, Preliminary Version, 1987 ACM, pp. 11-20. cited by other
.
Hightower, D., A Solution to Line-Routing Problems on the Continuous Plane, Bell Laboratories, Inc., pp. 11-34. cited by other
.
Iso, N. et al., Efficient Routability Checking for Global Wires in Planar Layouts, IEICE Trans. Fundamentals, vol. E80-A, No. 10 Oct. 1997, pp. 1878-1882. cited by other
.
Khoo, K. et al., An Efficient Multilayer MCM Router Based on Four-Via Routing, 30.sup.th ACM/IEEE Design Automation Conference, 1993, pp. 590-595. cited by other
.
Ladage, L. et al., Resistance Extraction Using a Routing Algorithm, 30.sup.th ACM/IEEE Design Automation Confernce, 1993, pp. 38-42. cited by other
.
Leach, G., Improving Worst-case Optimal Delaunay Triangulation Algorithms, Department of Computer Science, Jun. 15, 1992, pp. 1-7. cited by other
.
Leiserson, C. et al., Algorithms for Routing and Testing Routability of Planar VLSI Layouts, pp. 69-78, May 1985. cited by other
.
Lillis, J. et al., New Performance Driven Routing Techniques With Explicit Area/Delay Tradeoff and Simultaneous Wire Sizing, 33.sup.rd Design Automation Conference, 1996. cited by other
.
Lipski, W. et al., A Unified Approach to Layout Wirability, Mathematical Systems Theory, 1987, pp. 189-203. cited by other
.
Lodi, E. et al., A 2d Channel Router for the Diagonal Model, pp. 111-125, Apr. 1991. cited by other
.
Lodi, E. et al., A Preliminary Study of a Diagonal Channel-Routing Model, Algorithmica, 1989, pp. 585-597. cited by other
.
Lodi, E. et al., Lecture Notes in Computer Science, A 4d Channel router for a two layer diagonal model, pp. 464-476, Jul. 1988. cited by other
.
Lodi, E. et al., Routing in Times Square Mode, pp. 41-48, Jun. 1990. cited by other
.
Lodi, E. et al., Routing Multiterminal Nets in a Diagonal Model, pp. 899-902, 1988. cited by other
.
Murooka, T. et al., Simplified Routing Procedure for a CAD-Verified FPGA, IEICE, Trans. Fundamentals, vol. E82-A, No. 11 Nov. 1999, pp. 2440-2447. cited by other
.
Naclerio, N. et al., Via Minimization for Gridless Layouts, 24.sup.th ACM/IEEE Design Automation Conference, 1987, pp. 159-165. cited by other
.
Nam, G. et al, Satisfiability-Based Layout Revisited: Detailed Routing of Complex FPGAs Via Search-Based Boolean SAT, 1999, pp. 167-175. cited by other
.
Nestor, J. A New Look at Hardware Maze Routing, Proceedings of the 12.sup.th ACM Symposium on Great Lakes Symposium on VLSI, pp. 142-147, Apr. 2002. cited by other
.
Ng, C., A "Gridless" Variable-Width Channel Router for Macro Cell Design, 24.sup.th ACM/IEEE Design Automation Conference, 1987, pp. 633-636. cited by other
.
Olaverri, A.G. et al., On the Minimum Size of Visibility Graphs. cited by other
.
Overtone, G., EDA Underwriter 2 Finding Space in a Multi-Layer Board, Electronic Engineering, Morgan-Grampian LTD, vol. 67, No. 819, pp. 29-30. cited by other
.
Pocchiola, M., Computing the Visibility Graph via Pseudo-Triangulations, 11.sup.th Computational Geometry, Vancouver, Canada, 1995 ACM, pp. 248-257. cited by other
.
Powers, K. et al., The 60.degree. Grid: Routing Channels in Width d/square root 3, VLSI, 1991, Proceedings., First Great Lakes Symposium on Kalamazoo, MI, USA, pp. 214-291, Mar. 1991. cited by other
.
Royle, J. et al., Geometric Compaction in One Dimension for Channel Routing, 24.sup.th ACM/IEEE Design Automation Conference, 1987, pp. 140-145. cited by other
.
Schiele, W. et al., A Gridless Router for Industrial Design Rule, 27.sup.th ACM-IEEE Design Automation Conference, pp. 626-631, 1990. cited by other
.
Sekiyama, Y. et al., Timing-Oriented Routers for PCB Layout Design of High-Performance Computers, International Conference on Computer Aided Design, pp. 332-335, Nov. 1991. cited by other
.
Soukup, J. et al., Maze Router Without a Grid Map, IEEE, 1992, pp. 382-385. cited by other
.
Takashima, Y. et al, Routability of FPGAs with External Switch-Block Structures, IEICE Trans. Fundamentals, vol. E81-A, No. 5, May 1998, pp. 850-856. cited by other
.
Teig, S. The X Architecture: Not your Father's Diagonal Wiring, International Workshop on System Level Interconnect Prediction, pp. 33-37, Apr. 2002. cited by other
.
Thakur, S. et al., Algorithms for a Switch Module Routing Problem, 1994, pp. 265-270. cited by other
.
Theune, D. et al., HERO: Hierarchical EMC-constrained routing, Nov. 1992, IEEE pp. 468-472. cited by other
.
Tollis, I. Techniques for Wiring in Non-Square Grids, pp. 66-69, May 1989. cited by other
.
Urrutia, J., On the Number of Internal and External Visibility Edges of Polygons, Department of CS University of Ottawa, ON, Canada, Feb. 11, 1997. cited by other
.
Wang, D., Novel Routing Schemes for IC Layout, Part I: Two-Layer Channel Routing, 28.sup.th ACM/IEEE Automation Conference, 1991, pp. 49-53. cite- d by other
.
Yan et al., Three-Layer Bubble-Sorting-Base Non-Manhattan Channel Routing, ACM Transactions on Design Automation of Electronic Systems, vol. 5, No. 3, Jul. 2000, pp. 726-734. cited by other
.
Zhou, H. et al., An Optimal Algorithm for River Routin
|
Free Web Sudoku Puzzles.
Solve with your browser.
| |
|
|
|
|
|
6 |
4 |
5 |
| |
1 |
|
|
|
7 |
|
|
3 |
| |
|
|
|
2 |
|
7 |
8 |
|
| |
|
3 |
8 |
|
|
|
|
9 |
| 2 |
8 |
|
|
|
|
|
1 |
7 |
| 5 |
|
|
|
|
3 |
8 |
|
|
| |
7 |
8 |
|
4 |
|
|
|
|
| 6 |
|
|
1 |
|
|
|
9 |
|
| 9 |
5 |
4 |
|
|
|
|
|
|
|
What is it?
|
